elf-fdpic.h 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115
  1. /* Copyright 2003, 2004 Free Software Foundation, Inc.
  2. This file is part of the GNU C Library.
  3. The GNU C Library is free software; you can redistribute it and/or
  4. modify it under the terms of the GNU Lesser General Public License as
  5. published by the Free Software Foundation; either version 2.1 of the
  6. License, or (at your option) any later version.
  7. In addition to the permissions in the GNU Lesser General Public
  8. License, the Free Software Foundation gives you unlimited
  9. permission to link the compiled version of this file with other
  10. programs, and to distribute those programs without any restriction
  11. coming from the use of this file. (The GNU Lesser General Public
  12. License restrictions do apply in other respects; for example, they
  13. cover modification of the file, and distribution when not linked
  14. into another program.)
  15. The GNU C Library is distributed in the hope that it will be useful,
  16. but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. Library General Public License for more details.
  19. You should have received a copy of the GNU Lesser General Public
  20. License along with the GNU C Library; see the file COPYING.LIB. If
  21. not, write to the Free Software Foundation, Inc., 675 Mass Ave,
  22. Cambridge, MA 02139, USA. */
  23. #ifndef _BITS_ELF_FDPIC_H
  24. #define _BITS_ELF_FDPIC_H
  25. /* These data structures are described in the FDPIC ABI extension.
  26. The kernel passes a process a memory map, such that for every LOAD
  27. segment there is an elf32_fdpic_loadseg entry. A pointer to an
  28. elf32_fdpic_loadmap is passed in GR8 at start-up, and a pointer to
  29. an additional such map is passed in GR9 for the interpreter, when
  30. there is one. */
  31. #include <elf.h>
  32. /* This data structure represents a PT_LOAD segment. */
  33. struct elf32_fdpic_loadseg
  34. {
  35. /* Core address to which the segment is mapped. */
  36. Elf32_Addr addr;
  37. /* VMA recorded in the program header. */
  38. Elf32_Addr p_vaddr;
  39. /* Size of this segment in memory. */
  40. Elf32_Word p_memsz;
  41. };
  42. struct elf32_fdpic_loadmap {
  43. /* Protocol version number, must be zero. */
  44. Elf32_Half version;
  45. /* Number of segments in this map. */
  46. Elf32_Half nsegs;
  47. /* The actual memory map. */
  48. struct elf32_fdpic_loadseg segs[/*nsegs*/];
  49. };
  50. struct elf32_fdpic_loadaddr {
  51. struct elf32_fdpic_loadmap *map;
  52. void *got_value;
  53. };
  54. /* Map a pointer's VMA to its corresponding address according to the
  55. load map. */
  56. static __always_inline void *
  57. __reloc_pointer (void *p,
  58. const struct elf32_fdpic_loadmap *map)
  59. {
  60. int c;
  61. #if 0
  62. if (map->version != 0)
  63. /* Crash. */
  64. ((void(*)())0)();
  65. #endif
  66. /* No special provision is made for NULL. We don't want NULL
  67. addresses to go through relocation, so they shouldn't be in
  68. .rofixup sections, and, if they're present in dynamic
  69. relocations, they shall be mapped to the NULL address without
  70. undergoing relocations. */
  71. for (c = 0;
  72. /* Take advantage of the fact that the loadmap is ordered by
  73. virtual addresses. In general there will only be 2 entries,
  74. so it's not profitable to do a binary search. */
  75. c < map->nsegs && p >= (void*)map->segs[c].p_vaddr;
  76. c++)
  77. {
  78. /* This should be computed as part of the pointer comparison
  79. above, but we want to use the carry in the comparison, so we
  80. can't convert it to an integer type beforehand. */
  81. unsigned long offset = p - (void*)map->segs[c].p_vaddr;
  82. /* We only check for one-past-the-end for the last segment,
  83. assumed to be the data segment, because other cases are
  84. ambiguous in the absence of padding between segments, and
  85. rofixup already serves as padding between text and data.
  86. Unfortunately, unless we special-case the last segment, we
  87. fail to relocate the _end symbol. */
  88. if (offset < map->segs[c].p_memsz
  89. || (offset == map->segs[c].p_memsz && c + 1 == map->nsegs))
  90. return (char*)map->segs[c].addr + offset;
  91. }
  92. /* We might want to crash instead. */
  93. return (void*)-1;
  94. }
  95. # define __RELOC_POINTER(ptr, loadaddr) \
  96. (__reloc_pointer ((void*)(ptr), \
  97. (loadaddr).map))
  98. #endif /* _BITS_ELF_FDPIC_H */