DynamicObject.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459
  1. /*
  2. * Copyright (c) 2019-2020, Andrew Kaster <andrewdkaster@gmail.com>
  3. * Copyright (c) 2020, Itamar S. <itamar8910@gmail.com>
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions are met:
  8. *
  9. * 1. Redistributions of source code must retain the above copyright notice, this
  10. * list of conditions and the following disclaimer.
  11. *
  12. * 2. Redistributions in binary form must reproduce the above copyright notice,
  13. * this list of conditions and the following disclaimer in the documentation
  14. * and/or other materials provided with the distribution.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  17. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  19. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  20. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  22. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  23. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  24. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  25. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. */
  27. #include <AK/String.h>
  28. #include <AK/StringBuilder.h>
  29. #include <LibELF/DynamicLinker.h>
  30. #include <LibELF/DynamicObject.h>
  31. #include <LibELF/exec_elf.h>
  32. #include <stdio.h>
  33. #include <string.h>
  34. // #define DYNAMIC_OBJECT_VERBOSE
  35. #ifdef DYNAMIC_OBJECT_VERBOSE
  36. # define VERBOSE(fmt, ...) dbgprintf(fmt, ##__VA_ARGS__)
  37. #else
  38. # define VERBOSE(fmt, ...) \
  39. do { \
  40. } while (0)
  41. #endif
  42. namespace ELF {
  43. static const char* name_for_dtag(Elf32_Sword d_tag);
  44. DynamicObject::DynamicObject(VirtualAddress base_address, VirtualAddress dynamic_section_addresss)
  45. : m_base_address(base_address)
  46. , m_dynamic_address(dynamic_section_addresss)
  47. {
  48. Elf32_Ehdr* header = (Elf32_Ehdr*)base_address.as_ptr();
  49. Elf32_Phdr* pheader = (Elf32_Phdr*)(base_address.as_ptr() + header->e_phoff);
  50. m_elf_base_address = VirtualAddress(pheader->p_vaddr - pheader->p_offset);
  51. if (header->e_type == ET_DYN)
  52. m_is_elf_dynamic = true;
  53. else
  54. m_is_elf_dynamic = false;
  55. parse();
  56. }
  57. DynamicObject::~DynamicObject()
  58. {
  59. }
  60. void DynamicObject::dump() const
  61. {
  62. StringBuilder builder;
  63. builder.append("\nd_tag tag_name value\n");
  64. size_t num_dynamic_sections = 0;
  65. for_each_dynamic_entry([&](const DynamicObject::DynamicEntry& entry) {
  66. String name_field = String::format("(%s)", name_for_dtag(entry.tag()));
  67. builder.appendf("0x%08X %-17s0x%X\n", entry.tag(), name_field.characters(), entry.val());
  68. num_dynamic_sections++;
  69. return IterationDecision::Continue;
  70. });
  71. if (m_has_soname)
  72. builder.appendf("DT_SONAME: %s\n", soname()); // FIXME: Valdidate that this string is null terminated?
  73. VERBOSE("Dynamic section at address %p contains %zu entries:\n", m_dynamic_address.as_ptr(), num_dynamic_sections);
  74. VERBOSE("%s", builder.to_string().characters());
  75. }
  76. void DynamicObject::parse()
  77. {
  78. for_each_dynamic_entry([&](const DynamicEntry& entry) {
  79. switch (entry.tag()) {
  80. case DT_INIT:
  81. m_init_offset = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  82. break;
  83. case DT_FINI:
  84. m_fini_offset = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  85. break;
  86. case DT_INIT_ARRAY:
  87. m_init_array_offset = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  88. break;
  89. case DT_INIT_ARRAYSZ:
  90. m_init_array_size = entry.val();
  91. break;
  92. case DT_FINI_ARRAY:
  93. m_fini_array_offset = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  94. break;
  95. case DT_FINI_ARRAYSZ:
  96. m_fini_array_size = entry.val();
  97. break;
  98. case DT_HASH:
  99. m_hash_table_offset = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  100. break;
  101. case DT_SYMTAB:
  102. m_symbol_table_offset = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  103. break;
  104. case DT_STRTAB:
  105. m_string_table_offset = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  106. break;
  107. case DT_STRSZ:
  108. m_size_of_string_table = entry.val();
  109. break;
  110. case DT_SYMENT:
  111. m_size_of_symbol_table_entry = entry.val();
  112. break;
  113. case DT_PLTGOT:
  114. m_procedure_linkage_table_offset = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  115. break;
  116. case DT_PLTRELSZ:
  117. m_size_of_plt_relocation_entry_list = entry.val();
  118. break;
  119. case DT_PLTREL:
  120. m_procedure_linkage_table_relocation_type = entry.val();
  121. ASSERT(m_procedure_linkage_table_relocation_type & (DT_REL | DT_RELA));
  122. break;
  123. case DT_JMPREL:
  124. m_plt_relocation_offset_location = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  125. break;
  126. case DT_RELA:
  127. case DT_REL:
  128. m_relocation_table_offset = entry.ptr() - (FlatPtr)m_elf_base_address.as_ptr();
  129. break;
  130. case DT_RELASZ:
  131. case DT_RELSZ:
  132. m_size_of_relocation_table = entry.val();
  133. break;
  134. case DT_RELAENT:
  135. case DT_RELENT:
  136. m_size_of_relocation_entry = entry.val();
  137. break;
  138. case DT_RELACOUNT:
  139. case DT_RELCOUNT:
  140. m_number_of_relocations = entry.val();
  141. break;
  142. case DT_FLAGS:
  143. m_dt_flags = entry.val();
  144. break;
  145. case DT_TEXTREL:
  146. m_dt_flags |= DF_TEXTREL; // This tag seems to exist for legacy reasons only?
  147. break;
  148. case DT_SONAME:
  149. m_soname_index = entry.val();
  150. m_has_soname = true;
  151. break;
  152. case DT_DEBUG:
  153. break;
  154. case DT_FLAGS_1:
  155. break;
  156. case DT_NEEDED:
  157. // We handle these in for_each_needed_library
  158. break;
  159. default:
  160. dbgprintf("DynamicObject: DYNAMIC tag handling not implemented for DT_%s\n", name_for_dtag(entry.tag()));
  161. printf("DynamicObject: DYNAMIC tag handling not implemented for DT_%s\n", name_for_dtag(entry.tag()));
  162. ASSERT_NOT_REACHED(); // FIXME: Maybe just break out here and return false?
  163. break;
  164. }
  165. return IterationDecision::Continue;
  166. });
  167. if (!m_size_of_relocation_entry) {
  168. // TODO: FIXME, this shouldn't be hardcoded
  169. // The reason we need this here is that for some reason, when there only PLT relocations, the compiler
  170. // doesn't insert a 'PLTRELSZ' entry to the dynamic section
  171. m_size_of_relocation_entry = sizeof(Elf32_Rel);
  172. }
  173. auto hash_section_address = hash_section().address().as_ptr();
  174. // TODO: consider base address - it might not be zero
  175. auto num_hash_chains = ((u32*)hash_section_address)[1];
  176. m_symbol_count = num_hash_chains;
  177. }
  178. const DynamicObject::Relocation DynamicObject::RelocationSection::relocation(unsigned index) const
  179. {
  180. ASSERT(index < entry_count());
  181. unsigned offset_in_section = index * entry_size();
  182. auto relocation_address = (Elf32_Rel*)address().offset(offset_in_section).as_ptr();
  183. return Relocation(m_dynamic, *relocation_address, offset_in_section);
  184. }
  185. const DynamicObject::Relocation DynamicObject::RelocationSection::relocation_at_offset(unsigned offset) const
  186. {
  187. ASSERT(offset <= (m_section_size_bytes - m_entry_size));
  188. auto relocation_address = (Elf32_Rel*)address().offset(offset).as_ptr();
  189. return Relocation(m_dynamic, *relocation_address, offset);
  190. }
  191. const DynamicObject::Symbol DynamicObject::symbol(unsigned index) const
  192. {
  193. auto symbol_section = Section(*this, m_symbol_table_offset, (m_symbol_count * m_size_of_symbol_table_entry), m_size_of_symbol_table_entry, "DT_SYMTAB");
  194. auto symbol_entry = (Elf32_Sym*)symbol_section.address().offset(index * symbol_section.entry_size()).as_ptr();
  195. return Symbol(*this, index, *symbol_entry);
  196. }
  197. const DynamicObject::Section DynamicObject::init_section() const
  198. {
  199. return Section(*this, m_init_offset, sizeof(void (*)()), sizeof(void (*)()), "DT_INIT");
  200. }
  201. const DynamicObject::Section DynamicObject::fini_section() const
  202. {
  203. return Section(*this, m_fini_offset, sizeof(void (*)()), sizeof(void (*)()), "DT_FINI");
  204. }
  205. const DynamicObject::Section DynamicObject::init_array_section() const
  206. {
  207. return Section(*this, m_init_array_offset, m_init_array_size, sizeof(void (*)()), "DT_INIT_ARRAY");
  208. }
  209. const DynamicObject::Section DynamicObject::fini_array_section() const
  210. {
  211. return Section(*this, m_fini_array_offset, m_fini_array_size, sizeof(void (*)()), "DT_FINI_ARRAY");
  212. }
  213. const DynamicObject::HashSection DynamicObject::hash_section() const
  214. {
  215. return HashSection(Section(*this, m_hash_table_offset, 0, 0, "DT_HASH"), HashType::SYSV);
  216. }
  217. const DynamicObject::RelocationSection DynamicObject::relocation_section() const
  218. {
  219. return RelocationSection(Section(*this, m_relocation_table_offset, m_size_of_relocation_table, m_size_of_relocation_entry, "DT_REL"));
  220. }
  221. const DynamicObject::RelocationSection DynamicObject::plt_relocation_section() const
  222. {
  223. return RelocationSection(Section(*this, m_plt_relocation_offset_location, m_size_of_plt_relocation_entry_list, m_size_of_relocation_entry, "DT_JMPREL"));
  224. }
  225. u32 DynamicObject::HashSection::calculate_elf_hash(const char* name) const
  226. {
  227. // SYSV ELF hash algorithm
  228. // Note that the GNU HASH algorithm has less collisions
  229. uint32_t hash = 0;
  230. uint32_t top_nibble_of_hash = 0;
  231. while (*name != '\0') {
  232. hash = hash << 4;
  233. hash += *name;
  234. name++;
  235. top_nibble_of_hash = hash & 0xF0000000U;
  236. if (top_nibble_of_hash != 0)
  237. hash ^= top_nibble_of_hash >> 24;
  238. hash &= ~top_nibble_of_hash;
  239. }
  240. return hash;
  241. }
  242. u32 DynamicObject::HashSection::calculate_gnu_hash(const char*) const
  243. {
  244. // FIXME: Implement the GNU hash algorithm
  245. ASSERT_NOT_REACHED();
  246. }
  247. const DynamicObject::Symbol DynamicObject::HashSection::lookup_symbol(const char* name) const
  248. {
  249. // FIXME: If we enable gnu hash in the compiler, we should use that here instead
  250. // The algo is way better with less collisions
  251. u32 hash_value = (this->*(m_hash_function))(name);
  252. u32* hash_table_begin = (u32*)address().as_ptr();
  253. size_t num_buckets = hash_table_begin[0];
  254. // This is here for completeness, but, since we're using the fact that every chain
  255. // will end at chain 0 (which means 'not found'), we don't need to check num_chains.
  256. // Interestingly, num_chains is required to be num_symbols
  257. //size_t num_chains = hash_table_begin[1];
  258. u32* buckets = &hash_table_begin[2];
  259. u32* chains = &buckets[num_buckets];
  260. for (u32 i = buckets[hash_value % num_buckets]; i; i = chains[i]) {
  261. auto symbol = m_dynamic.symbol(i);
  262. if (strcmp(name, symbol.name()) == 0) {
  263. VERBOSE("Returning dynamic symbol with index %u for %s: %p\n", i, symbol.name(), symbol.address().as_ptr());
  264. return symbol;
  265. }
  266. }
  267. return Symbol::create_undefined(m_dynamic);
  268. }
  269. const char* DynamicObject::symbol_string_table_string(Elf32_Word index) const
  270. {
  271. return (const char*)base_address().offset(m_string_table_offset + index).as_ptr();
  272. }
  273. DynamicObject::InitializationFunction DynamicObject::init_section_function() const
  274. {
  275. ASSERT(has_init_section());
  276. return (InitializationFunction)init_section().address().as_ptr();
  277. }
  278. static const char* name_for_dtag(Elf32_Sword d_tag)
  279. {
  280. switch (d_tag) {
  281. case DT_NULL:
  282. return "NULL"; /* marks end of _DYNAMIC array */
  283. case DT_NEEDED:
  284. return "NEEDED"; /* string table offset of needed lib */
  285. case DT_PLTRELSZ:
  286. return "PLTRELSZ"; /* size of relocation entries in PLT */
  287. case DT_PLTGOT:
  288. return "PLTGOT"; /* address PLT/GOT */
  289. case DT_HASH:
  290. return "HASH"; /* address of symbol hash table */
  291. case DT_STRTAB:
  292. return "STRTAB"; /* address of string table */
  293. case DT_SYMTAB:
  294. return "SYMTAB"; /* address of symbol table */
  295. case DT_RELA:
  296. return "RELA"; /* address of relocation table */
  297. case DT_RELASZ:
  298. return "RELASZ"; /* size of relocation table */
  299. case DT_RELAENT:
  300. return "RELAENT"; /* size of relocation entry */
  301. case DT_STRSZ:
  302. return "STRSZ"; /* size of string table */
  303. case DT_SYMENT:
  304. return "SYMENT"; /* size of symbol table entry */
  305. case DT_INIT:
  306. return "INIT"; /* address of initialization func. */
  307. case DT_FINI:
  308. return "FINI"; /* address of termination function */
  309. case DT_SONAME:
  310. return "SONAME"; /* string table offset of shared obj */
  311. case DT_RPATH:
  312. return "RPATH"; /* string table offset of library search path */
  313. case DT_SYMBOLIC:
  314. return "SYMBOLIC"; /* start sym search in shared obj. */
  315. case DT_REL:
  316. return "REL"; /* address of rel. tbl. w addends */
  317. case DT_RELSZ:
  318. return "RELSZ"; /* size of DT_REL relocation table */
  319. case DT_RELENT:
  320. return "RELENT"; /* size of DT_REL relocation entry */
  321. case DT_PLTREL:
  322. return "PLTREL"; /* PLT referenced relocation entry */
  323. case DT_DEBUG:
  324. return "DEBUG"; /* bugger */
  325. case DT_TEXTREL:
  326. return "TEXTREL"; /* Allow rel. mod. to unwritable seg */
  327. case DT_JMPREL:
  328. return "JMPREL"; /* add. of PLT's relocation entries */
  329. case DT_BIND_NOW:
  330. return "BIND_NOW"; /* Bind now regardless of env setting */
  331. case DT_INIT_ARRAY:
  332. return "INIT_ARRAY"; /* address of array of init func */
  333. case DT_FINI_ARRAY:
  334. return "FINI_ARRAY"; /* address of array of term func */
  335. case DT_INIT_ARRAYSZ:
  336. return "INIT_ARRAYSZ"; /* size of array of init func */
  337. case DT_FINI_ARRAYSZ:
  338. return "FINI_ARRAYSZ"; /* size of array of term func */
  339. case DT_RUNPATH:
  340. return "RUNPATH"; /* strtab offset of lib search path */
  341. case DT_FLAGS:
  342. return "FLAGS"; /* Set of DF_* flags */
  343. case DT_ENCODING:
  344. return "ENCODING"; /* further DT_* follow encoding rules */
  345. case DT_PREINIT_ARRAY:
  346. return "PREINIT_ARRAY"; /* address of array of preinit func */
  347. case DT_PREINIT_ARRAYSZ:
  348. return "PREINIT_ARRAYSZ"; /* size of array of preinit func */
  349. case DT_LOOS:
  350. return "LOOS"; /* reserved range for OS */
  351. case DT_HIOS:
  352. return "HIOS"; /* specific dynamic array tags */
  353. case DT_LOPROC:
  354. return "LOPROC"; /* reserved range for processor */
  355. case DT_HIPROC:
  356. return "HIPROC"; /* specific dynamic array tags */
  357. case DT_GNU_HASH:
  358. return "GNU_HASH"; /* address of GNU hash table */
  359. case DT_RELACOUNT:
  360. return "RELACOUNT"; /* if present, number of RELATIVE */
  361. case DT_RELCOUNT:
  362. return "RELCOUNT"; /* relocs, which must come first */
  363. case DT_FLAGS_1:
  364. return "FLAGS_1";
  365. default:
  366. return "??";
  367. }
  368. }
  369. DynamicObject::SymbolLookupResult DynamicObject::lookup_symbol(const char* name) const
  370. {
  371. auto res = hash_section().lookup_symbol(name);
  372. if (res.is_undefined())
  373. return {};
  374. return SymbolLookupResult { true, res.value(), (FlatPtr)res.address().as_ptr(), res.bind(), this };
  375. }
  376. NonnullRefPtr<DynamicObject> DynamicObject::construct(VirtualAddress base_address, VirtualAddress dynamic_section_address)
  377. {
  378. return adopt(*new DynamicObject(base_address, dynamic_section_address));
  379. }
  380. // offset is in PLT relocation table
  381. Elf32_Addr DynamicObject::patch_plt_entry(u32 relocation_offset)
  382. {
  383. auto relocation = plt_relocation_section().relocation_at_offset(relocation_offset);
  384. ASSERT(relocation.type() == R_386_JMP_SLOT);
  385. auto sym = relocation.symbol();
  386. u8* relocation_address = relocation.address().as_ptr();
  387. auto res = lookup_symbol(sym);
  388. if (!res.found) {
  389. dbgln("did not find symbol: {} ", sym.name());
  390. ASSERT_NOT_REACHED();
  391. }
  392. u32 symbol_location = res.address;
  393. VERBOSE("DynamicLoader: Jump slot relocation: putting %s (%p) into PLT at %p\n", sym.name(), symbol_location, relocation_address);
  394. *(u32*)relocation_address = symbol_location;
  395. return symbol_location;
  396. }
  397. DynamicObject::SymbolLookupResult DynamicObject::lookup_symbol(const ELF::DynamicObject::Symbol& symbol) const
  398. {
  399. VERBOSE("looking up symbol: %s\n", symbol.name());
  400. if (!symbol.is_undefined()) {
  401. VERBOSE("symbol is defined in its object\n");
  402. return { true, symbol.value(), (FlatPtr)symbol.address().as_ptr(), symbol.bind(), &symbol.object() };
  403. }
  404. return DynamicLinker::lookup_global_symbol(symbol.name());
  405. }
  406. } // end namespace ELF