DynamicObject.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389
  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. #pragma once
  28. #include <AK/Assertions.h>
  29. #include <AK/RefCounted.h>
  30. #include <Kernel/VirtualAddress.h>
  31. #include <LibELF/exec_elf.h>
  32. namespace ELF {
  33. class DynamicObject : public RefCounted<DynamicObject> {
  34. public:
  35. static NonnullRefPtr<DynamicObject> create(VirtualAddress base_address, VirtualAddress dynamic_section_address);
  36. ~DynamicObject();
  37. void dump() const;
  38. class DynamicEntry;
  39. class Section;
  40. class RelocationSection;
  41. class Symbol;
  42. class Relocation;
  43. class HashSection;
  44. class DynamicEntry {
  45. public:
  46. explicit DynamicEntry(const Elf32_Dyn& dyn)
  47. : m_dyn(dyn)
  48. {
  49. }
  50. ~DynamicEntry() { }
  51. Elf32_Sword tag() const { return m_dyn.d_tag; }
  52. Elf32_Addr ptr() const { return m_dyn.d_un.d_ptr; }
  53. Elf32_Word val() const { return m_dyn.d_un.d_val; }
  54. private:
  55. const Elf32_Dyn& m_dyn;
  56. };
  57. class Symbol {
  58. public:
  59. Symbol(const DynamicObject& dynamic, unsigned index, const Elf32_Sym& sym)
  60. : m_dynamic(dynamic)
  61. , m_sym(sym)
  62. , m_index(index)
  63. {
  64. }
  65. StringView name() const { return m_dynamic.symbol_string_table_string(m_sym.st_name); }
  66. unsigned section_index() const { return m_sym.st_shndx; }
  67. unsigned value() const { return m_sym.st_value; }
  68. unsigned size() const { return m_sym.st_size; }
  69. unsigned index() const { return m_index; }
  70. unsigned type() const { return ELF32_ST_TYPE(m_sym.st_info); }
  71. unsigned bind() const { return ELF32_ST_BIND(m_sym.st_info); }
  72. bool is_undefined() const { return section_index() == 0; }
  73. VirtualAddress address() const
  74. {
  75. if (m_dynamic.elf_is_dynamic())
  76. return m_dynamic.base_address().offset(value());
  77. return VirtualAddress { value() };
  78. }
  79. const DynamicObject& object() const { return m_dynamic; }
  80. private:
  81. const DynamicObject& m_dynamic;
  82. const Elf32_Sym& m_sym;
  83. const unsigned m_index;
  84. };
  85. class Section {
  86. public:
  87. Section(const DynamicObject& dynamic, unsigned section_offset, unsigned section_size_bytes, unsigned entry_size, const StringView& name)
  88. : m_dynamic(dynamic)
  89. , m_section_offset(section_offset)
  90. , m_section_size_bytes(section_size_bytes)
  91. , m_entry_size(entry_size)
  92. , m_name(name)
  93. {
  94. }
  95. ~Section() { }
  96. StringView name() const { return m_name; }
  97. unsigned offset() const { return m_section_offset; }
  98. unsigned size() const { return m_section_size_bytes; }
  99. unsigned entry_size() const { return m_entry_size; }
  100. unsigned entry_count() const
  101. {
  102. return !entry_size() ? 0 : size() / entry_size();
  103. }
  104. VirtualAddress address() const
  105. {
  106. return m_dynamic.base_address().offset(m_section_offset);
  107. }
  108. protected:
  109. friend class RelocationSection;
  110. friend class HashSection;
  111. const DynamicObject& m_dynamic;
  112. unsigned m_section_offset;
  113. unsigned m_section_size_bytes;
  114. unsigned m_entry_size;
  115. StringView m_name;
  116. };
  117. class RelocationSection : public Section {
  118. public:
  119. explicit RelocationSection(const Section& section)
  120. : Section(section.m_dynamic, section.m_section_offset, section.m_section_size_bytes, section.m_entry_size, section.m_name)
  121. {
  122. }
  123. unsigned relocation_count() const { return entry_count(); }
  124. Relocation relocation(unsigned index) const;
  125. Relocation relocation_at_offset(unsigned offset) const;
  126. template<typename F>
  127. void for_each_relocation(F) const;
  128. };
  129. class Relocation {
  130. public:
  131. Relocation(const DynamicObject& dynamic, const Elf32_Rel& rel, unsigned offset_in_section)
  132. : m_dynamic(dynamic)
  133. , m_rel(rel)
  134. , m_offset_in_section(offset_in_section)
  135. {
  136. }
  137. ~Relocation() { }
  138. unsigned offset_in_section() const { return m_offset_in_section; }
  139. unsigned offset() const { return m_rel.r_offset; }
  140. unsigned type() const { return ELF32_R_TYPE(m_rel.r_info); }
  141. unsigned symbol_index() const { return ELF32_R_SYM(m_rel.r_info); }
  142. Symbol symbol() const { return m_dynamic.symbol(symbol_index()); }
  143. VirtualAddress address() const
  144. {
  145. if (m_dynamic.elf_is_dynamic())
  146. return m_dynamic.base_address().offset(offset());
  147. return VirtualAddress { offset() };
  148. }
  149. private:
  150. const DynamicObject& m_dynamic;
  151. const Elf32_Rel& m_rel;
  152. const unsigned m_offset_in_section;
  153. };
  154. enum class HashType {
  155. SYSV,
  156. GNU
  157. };
  158. class HashSection : public Section {
  159. public:
  160. HashSection(const Section& section, HashType hash_type)
  161. : Section(section.m_dynamic, section.m_section_offset, section.m_section_size_bytes, section.m_entry_size, section.m_name)
  162. {
  163. switch (hash_type) {
  164. case HashType::SYSV:
  165. m_lookup_function = &HashSection::lookup_elf_symbol;
  166. break;
  167. case HashType::GNU:
  168. m_lookup_function = &HashSection::lookup_gnu_symbol;
  169. break;
  170. default:
  171. ASSERT_NOT_REACHED();
  172. }
  173. }
  174. Optional<Symbol> lookup_symbol(const StringView& name) const;
  175. private:
  176. static u32 calculate_elf_hash(const StringView& name);
  177. static u32 calculate_gnu_hash(const StringView& name);
  178. Optional<Symbol> lookup_elf_symbol(const StringView& name) const;
  179. Optional<Symbol> lookup_gnu_symbol(const StringView& name) const;
  180. typedef Optional<Symbol> (HashSection::*LookupFunction)(const StringView&) const;
  181. LookupFunction m_lookup_function {};
  182. };
  183. unsigned symbol_count() const { return m_symbol_count; }
  184. Symbol symbol(unsigned) const;
  185. typedef void (*InitializationFunction)();
  186. bool has_init_section() const { return m_init_offset != 0; }
  187. bool has_init_array_section() const { return m_init_array_offset != 0; }
  188. Section init_section() const;
  189. InitializationFunction init_section_function() const;
  190. Section fini_section() const;
  191. Section init_array_section() const;
  192. Section fini_array_section() const;
  193. HashSection hash_section() const;
  194. RelocationSection relocation_section() const;
  195. RelocationSection plt_relocation_section() const;
  196. bool should_process_origin() const { return m_dt_flags & DF_ORIGIN; }
  197. bool requires_symbolic_symbol_resolution() const { return m_dt_flags & DF_SYMBOLIC; }
  198. // Text relocations meaning: we need to edit the .text section which is normally mapped PROT_READ
  199. bool has_text_relocations() const { return m_dt_flags & DF_TEXTREL; }
  200. bool must_bind_now() const { return m_dt_flags & DF_BIND_NOW; }
  201. bool has_static_thread_local_storage() const { return m_dt_flags & DF_STATIC_TLS; }
  202. bool has_plt() const { return m_procedure_linkage_table_offset.has_value(); }
  203. VirtualAddress plt_got_base_address() const { return m_base_address.offset(m_procedure_linkage_table_offset.value()); }
  204. VirtualAddress base_address() const { return m_base_address; }
  205. StringView soname() const { return m_has_soname ? symbol_string_table_string(m_soname_index) : StringView {}; }
  206. Optional<FlatPtr> tls_offset() const { return m_tls_offset; }
  207. Optional<FlatPtr> tls_size() const { return m_tls_size; }
  208. void set_tls_offset(FlatPtr offset) { m_tls_offset = offset; }
  209. void set_tls_size(FlatPtr size) { m_tls_size = size; }
  210. template<typename F>
  211. void for_each_needed_library(F) const;
  212. template<typename F>
  213. void for_each_initialization_array_function(F f) const;
  214. struct SymbolLookupResult {
  215. FlatPtr value { 0 };
  216. FlatPtr address { 0 };
  217. unsigned bind { STB_LOCAL };
  218. const ELF::DynamicObject* dynamic_object { nullptr }; // The object in which the symbol is defined
  219. };
  220. Optional<SymbolLookupResult> lookup_symbol(const StringView& name) const;
  221. // Will be called from _fixup_plt_entry, as part of the PLT trampoline
  222. Elf32_Addr patch_plt_entry(u32 relocation_offset);
  223. Optional<SymbolLookupResult> lookup_symbol(const ELF::DynamicObject::Symbol&) const;
  224. bool elf_is_dynamic() const { return m_is_elf_dynamic; }
  225. private:
  226. explicit DynamicObject(VirtualAddress base_address, VirtualAddress dynamic_section_address);
  227. StringView symbol_string_table_string(Elf32_Word) const;
  228. void parse();
  229. template<typename F>
  230. void for_each_symbol(F) const;
  231. template<typename F>
  232. void for_each_dynamic_entry(F) const;
  233. VirtualAddress m_base_address;
  234. VirtualAddress m_dynamic_address;
  235. VirtualAddress m_elf_base_address;
  236. unsigned m_symbol_count { 0 };
  237. // Begin Section information collected from DT_* entries
  238. FlatPtr m_init_offset { 0 };
  239. FlatPtr m_fini_offset { 0 };
  240. FlatPtr m_init_array_offset { 0 };
  241. size_t m_init_array_size { 0 };
  242. FlatPtr m_fini_array_offset { 0 };
  243. size_t m_fini_array_size { 0 };
  244. FlatPtr m_hash_table_offset { 0 };
  245. HashType m_hash_type { HashType::SYSV };
  246. FlatPtr m_string_table_offset { 0 };
  247. size_t m_size_of_string_table { 0 };
  248. FlatPtr m_symbol_table_offset { 0 };
  249. size_t m_size_of_symbol_table_entry { 0 };
  250. Elf32_Sword m_procedure_linkage_table_relocation_type { -1 };
  251. FlatPtr m_plt_relocation_offset_location { 0 }; // offset of PLT relocations, at end of relocations
  252. size_t m_size_of_plt_relocation_entry_list { 0 };
  253. Optional<FlatPtr> m_procedure_linkage_table_offset;
  254. // NOTE: We'll only ever either RELA or REL entries, not both (thank god)
  255. // NOTE: The x86 ABI will only ever genrerate REL entries.
  256. size_t m_number_of_relocations { 0 };
  257. size_t m_size_of_relocation_entry { 0 };
  258. size_t m_size_of_relocation_table { 0 };
  259. FlatPtr m_relocation_table_offset { 0 };
  260. bool m_is_elf_dynamic { false };
  261. // DT_FLAGS
  262. Elf32_Word m_dt_flags { 0 };
  263. bool m_has_soname { false };
  264. Elf32_Word m_soname_index { 0 }; // Index into dynstr table for SONAME
  265. Optional<FlatPtr> m_tls_offset;
  266. Optional<FlatPtr> m_tls_size;
  267. // End Section information from DT_* entries
  268. };
  269. template<typename F>
  270. inline void DynamicObject::RelocationSection::for_each_relocation(F func) const
  271. {
  272. for (unsigned i = 0; i < relocation_count(); ++i) {
  273. const auto reloc = relocation(i);
  274. if (reloc.type() == 0)
  275. continue;
  276. if (func(reloc) == IterationDecision::Break)
  277. break;
  278. }
  279. }
  280. template<typename F>
  281. inline void DynamicObject::for_each_symbol(F func) const
  282. {
  283. for (unsigned i = 0; i < symbol_count(); ++i) {
  284. if (func(symbol(i)) == IterationDecision::Break)
  285. break;
  286. }
  287. }
  288. template<typename F>
  289. inline void DynamicObject::for_each_dynamic_entry(F func) const
  290. {
  291. auto* dyns = reinterpret_cast<const Elf32_Dyn*>(m_dynamic_address.as_ptr());
  292. for (unsigned i = 0;; ++i) {
  293. auto&& dyn = DynamicEntry(dyns[i]);
  294. if (dyn.tag() == DT_NULL)
  295. break;
  296. if (func(dyn) == IterationDecision::Break)
  297. break;
  298. }
  299. }
  300. template<typename F>
  301. inline void DynamicObject::for_each_needed_library(F func) const
  302. {
  303. for_each_dynamic_entry([func, this](auto entry) {
  304. if (entry.tag() != DT_NEEDED)
  305. return IterationDecision::Continue;
  306. Elf32_Word offset = entry.val();
  307. StringView name { (const char*)(m_base_address.offset(m_string_table_offset).offset(offset)).as_ptr() };
  308. if (func(StringView(name)) == IterationDecision::Break)
  309. return IterationDecision::Break;
  310. return IterationDecision::Continue;
  311. });
  312. }
  313. template<typename F>
  314. void DynamicObject::for_each_initialization_array_function(F f) const
  315. {
  316. if (!has_init_array_section())
  317. return;
  318. FlatPtr init_array = (FlatPtr)init_array_section().address().as_ptr();
  319. for (size_t i = 0; i < (m_init_array_size / sizeof(void*)); ++i) {
  320. InitializationFunction current = ((InitializationFunction*)(init_array))[i];
  321. f(current);
  322. }
  323. }
  324. } // end namespace ELF