ELFLoader.cpp 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146
  1. #include "ELFLoader.h"
  2. #include <AK/Demangle.h>
  3. #include <AK/QuickSort.h>
  4. #include <AK/kstdio.h>
  5. #ifdef KERNEL
  6. #include <Kernel/VM/MemoryManager.h>
  7. #endif
  8. //#define ELFLOADER_DEBUG
  9. ELFLoader::ELFLoader(const u8* buffer)
  10. : m_image(buffer)
  11. {
  12. }
  13. ELFLoader::~ELFLoader()
  14. {
  15. }
  16. bool ELFLoader::load()
  17. {
  18. #ifdef ELFLOADER_DEBUG
  19. m_image.dump();
  20. #endif
  21. if (!m_image.is_valid())
  22. return false;
  23. if (!layout())
  24. return false;
  25. return true;
  26. }
  27. bool ELFLoader::layout()
  28. {
  29. bool failed = false;
  30. m_image.for_each_program_header([&](const ELFImage::ProgramHeader& program_header) {
  31. if (program_header.type() == PT_TLS) {
  32. #ifdef KERNEL
  33. auto* tls_image = tls_section_hook(program_header.size_in_memory(), program_header.alignment());
  34. if (!tls_image) {
  35. failed = true;
  36. return;
  37. }
  38. memcpy(tls_image, program_header.raw_data(), program_header.size_in_image());
  39. #endif
  40. return;
  41. }
  42. if (program_header.type() != PT_LOAD)
  43. return;
  44. #ifdef ELFLOADER_DEBUG
  45. kprintf("PH: V%p %u r:%u w:%u\n", program_header.vaddr().get(), program_header.size_in_memory(), program_header.is_readable(), program_header.is_writable());
  46. #endif
  47. #ifdef KERNEL
  48. if (program_header.is_writable()) {
  49. auto* allocated_section = alloc_section_hook(
  50. program_header.vaddr(),
  51. program_header.size_in_memory(),
  52. program_header.alignment(),
  53. program_header.is_readable(),
  54. program_header.is_writable(),
  55. String::format("elf-alloc-%s%s", program_header.is_readable() ? "r" : "", program_header.is_writable() ? "w" : ""));
  56. if (!allocated_section) {
  57. failed = true;
  58. return;
  59. }
  60. memcpy(program_header.vaddr().as_ptr(), program_header.raw_data(), program_header.size_in_image());
  61. } else {
  62. auto* mapped_section = map_section_hook(
  63. program_header.vaddr(),
  64. program_header.size_in_memory(),
  65. program_header.alignment(),
  66. program_header.offset(),
  67. program_header.is_readable(),
  68. program_header.is_writable(),
  69. program_header.is_executable(),
  70. String::format("elf-map-%s%s%s", program_header.is_readable() ? "r" : "", program_header.is_writable() ? "w" : "", program_header.is_executable() ? "x" : ""));
  71. if (!mapped_section) {
  72. failed = true;
  73. }
  74. }
  75. #endif
  76. });
  77. return !failed;
  78. }
  79. char* ELFLoader::symbol_ptr(const char* name)
  80. {
  81. char* found_ptr = nullptr;
  82. m_image.for_each_symbol([&](const ELFImage::Symbol symbol) {
  83. if (symbol.type() != STT_FUNC)
  84. return IterationDecision::Continue;
  85. if (strcmp(symbol.name(), name))
  86. return IterationDecision::Continue;
  87. if (m_image.is_executable())
  88. found_ptr = (char*)(size_t)symbol.value();
  89. else
  90. ASSERT_NOT_REACHED();
  91. return IterationDecision::Break;
  92. });
  93. return found_ptr;
  94. }
  95. String ELFLoader::symbolicate(u32 address) const
  96. {
  97. SortedSymbol* sorted_symbols = nullptr;
  98. #ifdef KERNEL
  99. if (!m_sorted_symbols_region) {
  100. m_sorted_symbols_region = MM.allocate_kernel_region(PAGE_ROUND_UP(m_image.symbol_count() * sizeof(SortedSymbol)), "Sorted symbols");
  101. sorted_symbols = (SortedSymbol*)m_sorted_symbols_region->vaddr().as_ptr();
  102. size_t index = 0;
  103. m_image.for_each_symbol([&](auto& symbol) {
  104. sorted_symbols[index++] = { symbol.value(), symbol.name() };
  105. return IterationDecision::Continue;
  106. });
  107. quick_sort(sorted_symbols, sorted_symbols + m_image.symbol_count(), [](auto& a, auto& b) {
  108. return a.address < b.address;
  109. });
  110. } else {
  111. sorted_symbols = (SortedSymbol*)m_sorted_symbols_region->vaddr().as_ptr();
  112. }
  113. #else
  114. if (m_sorted_symbols.is_empty()) {
  115. m_sorted_symbols.ensure_capacity(m_image.symbol_count());
  116. m_image.for_each_symbol([this](auto& symbol) {
  117. m_sorted_symbols.append({ symbol.value(), symbol.name() });
  118. return IterationDecision::Continue;
  119. });
  120. quick_sort(m_sorted_symbols.begin(), m_sorted_symbols.end(), [](auto& a, auto& b) {
  121. return a.address < b.address;
  122. });
  123. }
  124. sorted_symbols = m_sorted_symbols.data();
  125. #endif
  126. for (size_t i = 0; i < m_image.symbol_count(); ++i) {
  127. if (sorted_symbols[i].address > address) {
  128. if (i == 0)
  129. return "!!";
  130. auto& symbol = sorted_symbols[i - 1];
  131. return String::format("%s +%u", demangle(symbol.name).characters(), address - symbol.address);
  132. }
  133. }
  134. return "??";
  135. }