dl-hash.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364
  1. /* vi: set sw=4 ts=4: */
  2. /*
  3. * Program to load an ELF binary on a linux system, and run it
  4. * after resolving ELF shared library symbols
  5. *
  6. * Copyright (C) 2004 by Joakim Tjernlund <joakim.tjernlund@lumentis.se>
  7. * Copyright (C) 2000-2006 by Erik Andersen <andersen@codepoet.org>
  8. * Copyright (c) 1994-2000 Eric Youngdale, Peter MacDonald,
  9. * David Engel, Hongjiu Lu and Mitch D'Souza
  10. *
  11. * Redistribution and use in source and binary forms, with or without
  12. * modification, are permitted provided that the following conditions
  13. * are met:
  14. * 1. Redistributions of source code must retain the above copyright
  15. * notice, this list of conditions and the following disclaimer.
  16. * 2. The name of the above contributors may not be
  17. * used to endorse or promote products derived from this software
  18. * without specific prior written permission.
  19. *
  20. * THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND
  21. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  22. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  23. * ARE DISCLAIMED. IN NO EVENT SHALL THE CONTRIBUTORS BE LIABLE
  24. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  25. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  26. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  27. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  28. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  29. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  30. * SUCH DAMAGE.
  31. */
  32. /* Various symbol table handling functions, including symbol lookup */
  33. /*
  34. * This is the list of modules that are loaded when the image is first
  35. * started. As we add more via dlopen, they get added into other
  36. * chains.
  37. */
  38. struct dyn_elf *_dl_symbol_tables = NULL;
  39. /*
  40. * This is the list of modules that are loaded via dlopen. We may need
  41. * to search these for RTLD_GLOBAL files.
  42. */
  43. struct dyn_elf *_dl_handles = NULL;
  44. #ifdef __LDSO_GNU_HASH_SUPPORT__
  45. /* This is the new hash function that is used by the ELF linker to generate the
  46. * GNU hash table that each executable and library will have if --hash-style=[gnu,both]
  47. * is passed to the linker. We need it to decode the GNU hash table. */
  48. static __inline__ Elf_Symndx _dl_gnu_hash (const unsigned char *name)
  49. {
  50. unsigned long h = 5381;
  51. unsigned char c;
  52. for (c = *name; c != '\0'; c = *++name)
  53. h = h * 33 + c;
  54. return h & 0xffffffff;
  55. }
  56. #endif
  57. /* This is the hash function that is used by the ELF linker to generate the
  58. * hash table that each executable and library is required to have. We need
  59. * it to decode the hash table. */
  60. static __inline__ Elf_Symndx _dl_elf_hash(const unsigned char *name)
  61. {
  62. unsigned long hash=0;
  63. unsigned long tmp;
  64. while (*name) {
  65. hash = (hash << 4) + *name++;
  66. tmp = hash & 0xf0000000;
  67. /* The algorithm specified in the ELF ABI is as follows:
  68. if (tmp != 0)
  69. hash ^= tmp >> 24;
  70. hash &= ~tmp;
  71. But the following is equivalent and a lot
  72. faster, especially on modern processors. */
  73. hash ^= tmp;
  74. hash ^= tmp >> 24;
  75. }
  76. return hash;
  77. }
  78. /*
  79. * We call this function when we have just read an ELF library or executable.
  80. * We add the relevant info to the symbol chain, so that we can resolve all
  81. * externals properly.
  82. */
  83. struct elf_resolve *_dl_add_elf_hash_table(const char *libname,
  84. DL_LOADADDR_TYPE loadaddr, unsigned long *dynamic_info, unsigned long dynamic_addr,
  85. attribute_unused unsigned long dynamic_size)
  86. {
  87. Elf_Symndx *hash_addr;
  88. struct elf_resolve *tpnt;
  89. int i;
  90. if (!_dl_loaded_modules) {
  91. tpnt = _dl_loaded_modules = (struct elf_resolve *) _dl_malloc(sizeof(struct elf_resolve));
  92. _dl_memset(tpnt, 0, sizeof(struct elf_resolve));
  93. } else {
  94. tpnt = _dl_loaded_modules;
  95. while (tpnt->next)
  96. tpnt = tpnt->next;
  97. tpnt->next = (struct elf_resolve *) _dl_malloc(sizeof(struct elf_resolve));
  98. _dl_memset(tpnt->next, 0, sizeof(struct elf_resolve));
  99. tpnt->next->prev = tpnt;
  100. tpnt = tpnt->next;
  101. }
  102. tpnt->next = NULL;
  103. tpnt->init_flag = 0;
  104. tpnt->libname = _dl_strdup(libname);
  105. tpnt->dynamic_addr = (ElfW(Dyn) *)dynamic_addr;
  106. tpnt->libtype = loaded_file;
  107. #ifdef __LDSO_GNU_HASH_SUPPORT__
  108. if (dynamic_info[DT_GNU_HASH_IDX] != 0) {
  109. Elf32_Word *hash32 = (Elf_Symndx*)dynamic_info[DT_GNU_HASH_IDX];
  110. tpnt->nbucket = *hash32++;
  111. Elf32_Word symbias = *hash32++;
  112. Elf32_Word bitmask_nwords = *hash32++;
  113. /* Must be a power of two. */
  114. _dl_assert ((bitmask_nwords & (bitmask_nwords - 1)) == 0);
  115. tpnt->l_gnu_bitmask_idxbits = bitmask_nwords - 1;
  116. tpnt->l_gnu_shift = *hash32++;
  117. tpnt->l_gnu_bitmask = (ElfW(Addr) *) hash32;
  118. hash32 += __ELF_NATIVE_CLASS / 32 * bitmask_nwords;
  119. tpnt->l_gnu_buckets = hash32;
  120. hash32 += tpnt->nbucket;
  121. tpnt->l_gnu_chain_zero = hash32 - symbias;
  122. } else
  123. /* Fall using old SysV hash table if GNU hash is not present */
  124. #endif
  125. if (dynamic_info[DT_HASH] != 0) {
  126. hash_addr = (Elf_Symndx*)dynamic_info[DT_HASH];
  127. tpnt->nbucket = *hash_addr++;
  128. tpnt->nchain = *hash_addr++;
  129. tpnt->elf_buckets = hash_addr;
  130. hash_addr += tpnt->nbucket;
  131. tpnt->chains = hash_addr;
  132. }
  133. tpnt->loadaddr = loadaddr;
  134. tpnt->mapaddr = DL_RELOC_ADDR(loadaddr, 0);
  135. for (i = 0; i < DYNAMIC_SIZE; i++)
  136. tpnt->dynamic_info[i] = dynamic_info[i];
  137. return tpnt;
  138. }
  139. /* Routine to check whether the symbol matches. */
  140. static __attribute_noinline__ const ElfW(Sym) *
  141. check_match (const ElfW(Sym) *sym, char *strtab, const char* undef_name, int type_class)
  142. {
  143. if (type_class & (sym->st_shndx == SHN_UNDEF))
  144. /* undefined symbol itself */
  145. return NULL;
  146. #ifdef __mips__
  147. if (sym->st_shndx == SHN_UNDEF && !(sym->st_other & STO_MIPS_PLT))
  148. return NULL;
  149. #endif
  150. if (sym->st_value == 0)
  151. /* No value */
  152. return NULL;
  153. if (ELF_ST_TYPE(sym->st_info) > STT_FUNC
  154. && ELF_ST_TYPE(sym->st_info) != STT_COMMON)
  155. /* Ignore all but STT_NOTYPE, STT_OBJECT, STT_FUNC
  156. * and STT_COMMON entries since these are no
  157. * code/data definitions
  158. */
  159. return NULL;
  160. if (_dl_strcmp(strtab + sym->st_name, undef_name) != 0)
  161. return NULL;
  162. /* This is the matching symbol */
  163. return sym;
  164. }
  165. #ifdef __LDSO_GNU_HASH_SUPPORT__
  166. static __always_inline const ElfW(Sym) *
  167. _dl_lookup_gnu_hash(struct elf_resolve *tpnt, ElfW(Sym) *symtab, unsigned long hash,
  168. const char* undef_name, int type_class)
  169. {
  170. Elf_Symndx symidx;
  171. const ElfW(Sym) *sym;
  172. char *strtab;
  173. const ElfW(Addr) *bitmask = tpnt->l_gnu_bitmask;
  174. ElfW(Addr) bitmask_word = bitmask[(hash / __ELF_NATIVE_CLASS) & tpnt->l_gnu_bitmask_idxbits];
  175. unsigned int hashbit1 = hash & (__ELF_NATIVE_CLASS - 1);
  176. unsigned int hashbit2 = ((hash >> tpnt->l_gnu_shift) & (__ELF_NATIVE_CLASS - 1));
  177. _dl_assert (bitmask != NULL);
  178. if (unlikely((bitmask_word >> hashbit1) & (bitmask_word >> hashbit2) & 1)) {
  179. unsigned long rem;
  180. Elf32_Word bucket;
  181. do_rem (rem, hash, tpnt->nbucket);
  182. bucket = tpnt->l_gnu_buckets[rem];
  183. if (bucket != 0) {
  184. const Elf32_Word *hasharr = &tpnt->l_gnu_chain_zero[bucket];
  185. do {
  186. if (((*hasharr ^ hash) >> 1) == 0) {
  187. symidx = hasharr - tpnt->l_gnu_chain_zero;
  188. strtab = (char *) (tpnt->dynamic_info[DT_STRTAB]);
  189. sym = check_match (&symtab[symidx], strtab, undef_name, type_class);
  190. if (sym != NULL)
  191. return sym;
  192. }
  193. } while ((*hasharr++ & 1u) == 0);
  194. }
  195. }
  196. /* No symbol found. */
  197. return NULL;
  198. }
  199. #endif
  200. static __always_inline const ElfW(Sym) *
  201. _dl_lookup_sysv_hash(struct elf_resolve *tpnt, ElfW(Sym) *symtab, unsigned long hash, const char* undef_name, int type_class)
  202. {
  203. unsigned long hn;
  204. char *strtab;
  205. const ElfW(Sym) *sym;
  206. Elf_Symndx symidx;
  207. /* Avoid calling .urem here. */
  208. do_rem(hn, hash, tpnt->nbucket);
  209. strtab = (char *) (tpnt->dynamic_info[DT_STRTAB]);
  210. _dl_assert(tpnt->elf_buckets != NULL);
  211. for (symidx = tpnt->elf_buckets[hn]; symidx != STN_UNDEF; symidx = tpnt->chains[symidx]) {
  212. sym = check_match (&symtab[symidx], strtab, undef_name, type_class);
  213. if (sym != NULL)
  214. /* At this point the symbol is that we are looking for */
  215. return sym;
  216. }
  217. /* No symbol found into the current module*/
  218. return NULL;
  219. }
  220. /*
  221. * This function resolves externals, and this is either called when we process
  222. * relocations or when we call an entry in the PLT table for the first time.
  223. */
  224. char *_dl_lookup_hash(const char *name, struct dyn_elf *rpnt,
  225. struct elf_resolve *mytpnt, int type_class
  226. #ifdef __FDPIC__
  227. , struct elf_resolve **tpntp
  228. #endif
  229. )
  230. {
  231. struct elf_resolve *tpnt = NULL;
  232. ElfW(Sym) *symtab;
  233. unsigned long elf_hash_number = 0xffffffff;
  234. const ElfW(Sym) *sym = NULL;
  235. const ElfW(Sym) *weak_sym = 0;
  236. struct elf_resolve *weak_tpnt = 0;
  237. #ifdef __LDSO_GNU_HASH_SUPPORT__
  238. unsigned long gnu_hash_number = _dl_gnu_hash((const unsigned char *)name);
  239. #endif
  240. for (; rpnt; rpnt = rpnt->next) {
  241. tpnt = rpnt->dyn;
  242. if (!(tpnt->rtld_flags & RTLD_GLOBAL) && mytpnt) {
  243. if (mytpnt == tpnt)
  244. ;
  245. else {
  246. struct init_fini_list *tmp;
  247. for (tmp = mytpnt->rtld_local; tmp; tmp = tmp->next) {
  248. if (tmp->tpnt == tpnt)
  249. break;
  250. }
  251. if (!tmp)
  252. continue;
  253. }
  254. }
  255. /* Don't search the executable when resolving a copy reloc. */
  256. if ((type_class & ELF_RTYPE_CLASS_COPY) && tpnt->libtype == elf_executable)
  257. continue;
  258. /* If the hash table is empty there is nothing to do here. */
  259. if (tpnt->nbucket == 0)
  260. continue;
  261. symtab = (ElfW(Sym) *) (intptr_t) (tpnt->dynamic_info[DT_SYMTAB]);
  262. #ifdef __LDSO_GNU_HASH_SUPPORT__
  263. /* Prefer GNU hash style, if any */
  264. if (tpnt->l_gnu_bitmask) {
  265. sym = _dl_lookup_gnu_hash(tpnt, symtab, gnu_hash_number, name, type_class);
  266. if (sym != NULL)
  267. /* If sym has been found, do not search further */
  268. break;
  269. } else {
  270. #endif
  271. /* Use the old SysV-style hash table */
  272. /* Calculate the old sysv hash number only once */
  273. if (elf_hash_number == 0xffffffff)
  274. elf_hash_number = _dl_elf_hash((const unsigned char *)name);
  275. sym = _dl_lookup_sysv_hash(tpnt, symtab, elf_hash_number, name, type_class);
  276. if (sym != NULL)
  277. break;
  278. #ifdef __LDSO_GNU_HASH_SUPPORT__
  279. }
  280. #endif
  281. } /* end of for (; rpnt; rpnt = rpnt->next) { */
  282. if (sym) {
  283. /* At this point we have found the requested symbol, do binding */
  284. switch (ELF_ST_BIND(sym->st_info)) {
  285. case STB_WEAK:
  286. #if 0
  287. /* Perhaps we should support old style weak symbol handling
  288. * per what glibc does when you export LD_DYNAMIC_WEAK */
  289. if (!weak_sym) {
  290. weak_tpnt = tpnt;
  291. weak_sym = sym;
  292. }
  293. break;
  294. #endif
  295. case STB_GLOBAL:
  296. #ifdef __FDPIC__
  297. if (tpntp)
  298. *tpntp = tpnt;
  299. #endif
  300. return (char *) DL_FIND_HASH_VALUE (tpnt, type_class, sym);
  301. default: /* Local symbols not handled here */
  302. break;
  303. }
  304. }
  305. if (weak_sym) {
  306. #ifdef __FDPIC__
  307. if (tpntp)
  308. *tpntp = weak_tpnt;
  309. #endif
  310. return (char *) DL_FIND_HASH_VALUE (weak_tpnt, type_class, weak_sym);
  311. }
  312. #ifdef __FDPIC__
  313. if (tpntp)
  314. *tpntp = NULL;
  315. #endif
  316. return NULL;
  317. }