pal_rtld.h 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209
  1. /* -*- mode:c; c-file-style:"k&r"; c-basic-offset: 4; tab-width:4; indent-tabs-mode:nil; mode:auto-fill; fill-column:78; -*- */
  2. /* vim: set ts=4 sw=4 et tw=78 fo=cqt wm=0: */
  3. /* Copyright (C) 2014 OSCAR lab, Stony Brook University
  4. This file is part of Graphene Library OS.
  5. Graphene Library OS is free software: you can redistribute it and/or
  6. modify it under the terms of the GNU General Public License
  7. as published by the Free Software Foundation, either version 3 of the
  8. License, or (at your option) any later version.
  9. Graphene Library OS is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  15. /*
  16. * pal_rtld.h
  17. */
  18. #ifndef PAL_RTLD_H
  19. #define PAL_RTLD_H
  20. #include "pal_internal.h"
  21. #include "pal_error.h"
  22. #include "pal_security.h"
  23. #include "api.h"
  24. #include <sysdeps/generic/ldsodefs.h>
  25. #include <elf/elf.h>
  26. #include <bits/dlfcn.h>
  27. #ifndef DT_THISPROCNUM
  28. # define DT_THISPROCNUM 0
  29. #endif
  30. typedef ElfW(Word) Elf_Symndx;
  31. /* Structure describing a loaded shared object. The `l_next' and `l_prev'
  32. members form a chain of all the shared objects loaded at startup.
  33. These data structures exist in space used by the run-time dynamic linker;
  34. modifying them may have disastrous results.
  35. This data structure might change in future, if necessary. User-level
  36. programs must avoid defining objects of this type. */
  37. /* This is a simplified link_map structure */
  38. struct link_map {
  39. /* These first few members are part of the protocol with the debugger.
  40. This is the same format used in SVR4. */
  41. ElfW(Addr) l_addr; /* Base address shared object is loaded at. */
  42. const char * l_name; /* Absolute file name object was found in. */
  43. ElfW(Dyn) * l_real_ld; /* Dynamic section of the shared object. */
  44. struct link_map * l_next, * l_prev; /* Chain of loaded objects. */
  45. /* All following members are internal to the dynamic linker.
  46. They may change without notice. */
  47. enum object_type l_type;
  48. ElfW(Dyn) * l_ld;
  49. char * l_soname;
  50. bool l_relocated;
  51. ElfW(Dyn) * l_info[DT_NUM + DT_THISPROCNUM + DT_VERSIONTAGNUM
  52. + DT_EXTRANUM + DT_VALNUM + DT_ADDRNUM];
  53. const ElfW(Phdr) * l_phdr; /* Pointer to program header table in core. */
  54. ElfW(Addr) l_entry; /* Entry point location. */
  55. ElfW(Half) l_phnum; /* Number of program header entries. */
  56. ElfW(Half) l_ldnum; /* Number of dynamic segment entries. */
  57. /* End of the executable part of the mapping. */
  58. ElfW(Addr) l_text_start, l_text_end;
  59. ElfW(Addr) l_data_start, l_data_end;
  60. /* Start and finish of memory map for this object. l_map_start
  61. need not be the same as l_addr. */
  62. ElfW(Addr) l_map_start, l_map_end;
  63. /* Information used to change permission after the relocations are
  64. done. */
  65. ElfW(Addr) l_relro_addr;
  66. size_t l_relro_size;
  67. Elf_Symndx l_nbuckets;
  68. /* For DT_HASH */
  69. const Elf_Symndx *l_buckets;
  70. const Elf_Symndx *l_chain;
  71. /* For DT_GNU_HASH */
  72. Elf32_Word l_gnu_bitmask_idxbits;
  73. Elf32_Word l_gnu_shift;
  74. const ElfW(Addr) * l_gnu_bitmask;
  75. const Elf32_Word * l_gnu_buckets;
  76. const Elf32_Word * l_gnu_chain_zero;
  77. };
  78. extern struct link_map * loaded_libraries;
  79. extern struct link_map * rtld_map;
  80. extern struct link_map * exec_map;
  81. /* Rendezvous structure used by the run-time dynamic linker to communicate
  82. details of shared object loading to the debugger. If the executable's
  83. dynamic section has a DT_DEBUG element, the run-time linker sets that
  84. element's value to the address where this structure can be found. */
  85. struct r_debug {
  86. int r_version; /* Version number for this protocol. */
  87. struct link_map * r_map; /* Head of the chain of loaded objects. */
  88. /* This is the address of a function internal to the run-time linker,
  89. that will always be called when the linker begins to map in a
  90. library or unmap it, and again when the mapping change is complete.
  91. The debugger can set a breakpoint at this address if it wants to
  92. notice shared object mapping changes. */
  93. ElfW(Addr) r_brk;
  94. enum {
  95. /* This state value describes the mapping change taking place when
  96. the `r_brk' address is called. */
  97. RT_CONSISTENT, /* Mapping change is complete. */
  98. RT_ADD, /* Beginning to add a new object. */
  99. RT_DELETE /* Beginning to remove an object mapping. */
  100. } r_state;
  101. ElfW(Addr) r_ldbase; /* Base address the linker is loaded at. */
  102. };
  103. void pal_dl_debug_state (void);
  104. /* This structure communicates dl state to the debugger. The debugger
  105. normally finds it via the DT_DEBUG entry in the dynamic section, but in
  106. a statically-linked program there is no dynamic section for the debugger
  107. to examine and it looks for this particular symbol name. */
  108. extern struct r_debug pal_r_debug;
  109. /* Some systems link their relocatable objects for another base address
  110. than 0. We want to know the base address for these such that we can
  111. subtract this address from the segment addresses during mapping.
  112. This results in a more efficient address space usage. Defaults to
  113. zero for almost all systems. */
  114. #ifndef MAP_BASE_ADDR
  115. # define MAP_BASE_ADDR(l) 0
  116. #endif
  117. /* Handle situations where we have a preferred location in memory for
  118. the shared objects. */
  119. #ifdef ELF_PREFERRED_ADDRESS_DATA
  120. ELF_PREFERRED_ADDRESS_DATA;
  121. #endif
  122. #ifndef ELF_PREFERRED_ADDRESS
  123. # define ELF_PREFERRED_ADDRESS(loader, maplength, mapstartpref) (mapstartpref)
  124. #endif
  125. #ifndef ELF_FIXED_ADDRESS
  126. # define ELF_FIXED_ADDRESS(loader, mapstart) ((void) 0)
  127. #endif
  128. #ifndef VERSYMIDX
  129. # define VERSYMIDX(sym) (DT_NUM + DT_THISPROCNUM + DT_VERSIONTAGIDX (sym))
  130. #endif
  131. #ifndef VALIDX
  132. # define VALIDX(tag) (DT_NUM + DT_THISPROCNUM + DT_VERSIONTAGNUM \
  133. + DT_EXTRANUM + DT_VALTAGIDX (tag))
  134. #endif
  135. #include <endian.h>
  136. #if BYTE_ORDER == BIG_ENDIAN
  137. # define byteorder ELFDATA2MSB
  138. #elif BYTE_ORDER == LITTLE_ENDIAN
  139. # define byteorder ELFDATA2LSB
  140. #else
  141. # error "Unknown BYTE_ORDER " BYTE_ORDER
  142. # define byteorder ELFDATANONE
  143. #endif
  144. #if __WORDSIZE == 32
  145. # define FILEBUF_SIZE 512
  146. #else
  147. # define FILEBUF_SIZE 832
  148. #endif
  149. struct link_map *
  150. new_elf_object (const char * realname, enum object_type type);
  151. void free_elf_object (struct link_map * map);
  152. static inline uint_fast32_t elf_fast_hash (const char *s)
  153. {
  154. uint_fast32_t h = 5381;
  155. for (unsigned char c = *s; c != '\0'; c = *++s)
  156. h = h * 33 + c;
  157. return h & 0xffffffff;
  158. }
  159. unsigned long int elf_hash (const char *name_arg);
  160. ElfW(Sym) *
  161. do_lookup_map (ElfW(Sym) * ref, const char * undef_name,
  162. const uint_fast32_t hash, unsigned long int elf_hash,
  163. const struct link_map * map);
  164. #endif /* PAL_RTLD_H */