Relocation.cpp 3.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104
  1. /*
  2. * Copyright (c) 2021, Gunnar Beutner <gbeutner@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <LibC/elf.h>
  7. #include <LibELF/Relocation.h>
  8. namespace ELF {
  9. bool perform_relative_relocations(FlatPtr base_address)
  10. {
  11. ElfW(Ehdr)* header = (ElfW(Ehdr)*)(base_address);
  12. ElfW(Phdr)* pheader = (ElfW(Phdr)*)(base_address + header->e_phoff);
  13. FlatPtr dynamic_section_addr = 0;
  14. for (size_t i = 0; i < (size_t)header->e_phnum; ++i, ++pheader) {
  15. if (pheader->p_type != PT_DYNAMIC)
  16. continue;
  17. dynamic_section_addr = pheader->p_vaddr + base_address;
  18. }
  19. if (!dynamic_section_addr)
  20. return false;
  21. FlatPtr relocation_section_addr = 0;
  22. size_t relocation_table_size = 0;
  23. size_t relocation_count = 0;
  24. size_t relocation_entry_size = 0;
  25. FlatPtr relr_relocation_section_addr = 0;
  26. size_t relr_relocation_table_size = 0;
  27. bool use_addend = false;
  28. auto* dyns = reinterpret_cast<const ElfW(Dyn)*>(dynamic_section_addr);
  29. for (unsigned i = 0;; ++i) {
  30. auto& dyn = dyns[i];
  31. if (dyn.d_tag == DT_NULL)
  32. break;
  33. if (dyn.d_tag == DT_RELA)
  34. use_addend = true;
  35. if (dyn.d_tag == DT_REL || dyn.d_tag == DT_RELA)
  36. relocation_section_addr = base_address + dyn.d_un.d_ptr;
  37. else if (dyn.d_tag == DT_RELCOUNT || dyn.d_tag == DT_RELACOUNT)
  38. relocation_count = dyn.d_un.d_val;
  39. else if (dyn.d_tag == DT_RELSZ || dyn.d_tag == DT_RELASZ)
  40. relocation_table_size = dyn.d_un.d_val;
  41. else if (dyn.d_tag == DT_RELENT || dyn.d_tag == DT_RELAENT)
  42. relocation_entry_size = dyn.d_un.d_val;
  43. else if (dyn.d_tag == DT_RELR)
  44. relr_relocation_section_addr = base_address + dyn.d_un.d_ptr;
  45. else if (dyn.d_tag == DT_RELRSZ)
  46. relr_relocation_table_size = dyn.d_un.d_val;
  47. else if (dyn.d_tag == DT_RELRENT)
  48. VERIFY(dyn.d_un.d_val == sizeof(FlatPtr));
  49. }
  50. if ((!relocation_section_addr || !relocation_table_size || !relocation_count) && (!relr_relocation_section_addr || !relr_relocation_table_size))
  51. return false;
  52. for (unsigned i = 0; i < relocation_count; ++i) {
  53. size_t offset_in_section = i * relocation_entry_size;
  54. auto* relocation = (ElfW(Rela)*)(relocation_section_addr + offset_in_section);
  55. #if ARCH(I386)
  56. VERIFY(ELF32_R_TYPE(relocation->r_info) == R_386_RELATIVE);
  57. #else
  58. VERIFY(ELF64_R_TYPE(relocation->r_info) == R_X86_64_RELATIVE);
  59. #endif
  60. auto* patch_address = (FlatPtr*)(base_address + relocation->r_offset);
  61. FlatPtr relocated_address;
  62. if (use_addend) {
  63. relocated_address = base_address + relocation->r_addend;
  64. } else {
  65. __builtin_memcpy(&relocated_address, patch_address, sizeof(relocated_address));
  66. relocated_address += base_address;
  67. }
  68. __builtin_memcpy(patch_address, &relocated_address, sizeof(relocated_address));
  69. }
  70. auto patch_relr = [base_address](FlatPtr* patch_ptr) {
  71. FlatPtr relocated_address;
  72. __builtin_memcpy(&relocated_address, patch_ptr, sizeof(FlatPtr));
  73. relocated_address += base_address;
  74. __builtin_memcpy(patch_ptr, &relocated_address, sizeof(FlatPtr));
  75. };
  76. auto* entries = reinterpret_cast<ElfW(Relr)*>(relr_relocation_section_addr);
  77. FlatPtr* patch_ptr = nullptr;
  78. for (unsigned i = 0; i < relr_relocation_table_size / sizeof(FlatPtr); ++i) {
  79. if ((entries[i] & 1u) == 0) {
  80. patch_ptr = reinterpret_cast<FlatPtr*>(base_address + entries[i]);
  81. patch_relr(patch_ptr);
  82. ++patch_ptr;
  83. } else {
  84. unsigned j = 0;
  85. for (auto bitmap = entries[i]; (bitmap >>= 1u) != 0; ++j)
  86. if (bitmap & 1u)
  87. patch_relr(patch_ptr + j);
  88. patch_ptr += 8 * sizeof(FlatPtr) - 1;
  89. }
  90. }
  91. return true;
  92. }
  93. }