DebugInfo.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310
  1. /*
  2. * Copyright (c) 2020, Itamar S. <itamar8910@gmail.com>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include "DebugInfo.h"
  27. #include <AK/QuickSort.h>
  28. #include <AK/Stream.h>
  29. #include <LibDebug/Dwarf/CompilationUnit.h>
  30. #include <LibDebug/Dwarf/DwarfInfo.h>
  31. #include <LibDebug/Dwarf/Expression.h>
  32. //#define DEBUG_SPAM
  33. DebugInfo::DebugInfo(NonnullRefPtr<const ELF::Loader> elf)
  34. : m_elf(elf)
  35. , m_dwarf_info(Dwarf::DwarfInfo::create(m_elf))
  36. {
  37. prepare_variable_scopes();
  38. prepare_lines();
  39. }
  40. void DebugInfo::prepare_variable_scopes()
  41. {
  42. m_dwarf_info->for_each_compilation_unit([&](const Dwarf::CompilationUnit& unit) {
  43. auto root = unit.root_die();
  44. parse_scopes_impl(root);
  45. });
  46. }
  47. void DebugInfo::parse_scopes_impl(const Dwarf::DIE& die)
  48. {
  49. die.for_each_child([&](const Dwarf::DIE& child) {
  50. if (child.is_null())
  51. return;
  52. if (!(child.tag() == Dwarf::EntryTag::SubProgram || child.tag() == Dwarf::EntryTag::LexicalBlock))
  53. return;
  54. if (child.get_attribute(Dwarf::Attribute::Inline).has_value()) {
  55. #ifdef DEBUG_SPAM
  56. dbg() << "DWARF inlined functions are not supported";
  57. #endif
  58. return;
  59. }
  60. if (child.get_attribute(Dwarf::Attribute::Ranges).has_value()) {
  61. #ifdef DEBUG_SPAM
  62. dbg() << "DWARF ranges are not supported";
  63. #endif
  64. return;
  65. }
  66. auto name = child.get_attribute(Dwarf::Attribute::Name);
  67. VariablesScope scope {};
  68. scope.is_function = (child.tag() == Dwarf::EntryTag::SubProgram);
  69. if (name.has_value())
  70. scope.name = name.value().data.as_string;
  71. if (!child.get_attribute(Dwarf::Attribute::LowPc).has_value()) {
  72. #ifdef DEBUG_SPAM
  73. dbg() << "DWARF: Couldn't find attribtue LowPc for scope";
  74. #endif
  75. return;
  76. }
  77. scope.address_low = child.get_attribute(Dwarf::Attribute::LowPc).value().data.as_u32;
  78. // The attribute name HighPc is confusing. In this context, it seems to actually be a positive offset from LowPc
  79. scope.address_high = scope.address_low + child.get_attribute(Dwarf::Attribute::HighPc).value().data.as_u32;
  80. child.for_each_child([&](const Dwarf::DIE& variable_entry) {
  81. if (!(variable_entry.tag() == Dwarf::EntryTag::Variable
  82. || variable_entry.tag() == Dwarf::EntryTag::FormalParameter))
  83. return;
  84. scope.dies_of_variables.append(variable_entry);
  85. });
  86. m_scopes.append(scope);
  87. parse_scopes_impl(child);
  88. });
  89. }
  90. void DebugInfo::prepare_lines()
  91. {
  92. auto section = m_elf->image().lookup_section(".debug_line");
  93. if (section.is_undefined())
  94. return;
  95. auto buffer = section.wrapping_byte_buffer();
  96. InputMemoryStream stream { buffer };
  97. Vector<LineProgram::LineInfo> all_lines;
  98. while (!stream.eof()) {
  99. LineProgram program(stream);
  100. all_lines.append(program.lines());
  101. }
  102. for (auto& line_info : all_lines) {
  103. String file_path = line_info.file;
  104. if (file_path.contains("Toolchain/") || file_path.contains("libgcc"))
  105. continue;
  106. if (file_path.contains("serenity/")) {
  107. auto start_index = file_path.index_of("serenity/").value() + String("serenity/").length();
  108. file_path = file_path.substring(start_index, file_path.length() - start_index);
  109. }
  110. m_sorted_lines.append({ line_info.address, file_path, line_info.line });
  111. }
  112. quick_sort(m_sorted_lines, [](auto& a, auto& b) {
  113. return a.address < b.address;
  114. });
  115. }
  116. Optional<DebugInfo::SourcePosition> DebugInfo::get_source_position(u32 target_address) const
  117. {
  118. if (m_sorted_lines.is_empty())
  119. return {};
  120. if (target_address < m_sorted_lines[0].address)
  121. return {};
  122. // TODO: We can do a binray search here
  123. for (size_t i = 0; i < m_sorted_lines.size() - 1; ++i) {
  124. if (m_sorted_lines[i + 1].address > target_address) {
  125. return Optional<SourcePosition>({ m_sorted_lines[i].file, m_sorted_lines[i].line, m_sorted_lines[i].address });
  126. }
  127. }
  128. return {};
  129. }
  130. Optional<u32> DebugInfo::get_instruction_from_source(const String& file, size_t line) const
  131. {
  132. String file_path = file;
  133. constexpr char SERENITY_LIBS_PREFIX[] = "/usr/src/serenity";
  134. if (file.starts_with(SERENITY_LIBS_PREFIX)) {
  135. file_path = file.substring(sizeof(SERENITY_LIBS_PREFIX), file.length() - sizeof(SERENITY_LIBS_PREFIX));
  136. file_path = String::format("../%s", file_path.characters());
  137. }
  138. for (const auto& line_entry : m_sorted_lines) {
  139. if (line_entry.file == file_path && line_entry.line == line)
  140. return Optional<u32>(line_entry.address);
  141. }
  142. return {};
  143. }
  144. NonnullOwnPtrVector<DebugInfo::VariableInfo> DebugInfo::get_variables_in_current_scope(const PtraceRegisters& regs) const
  145. {
  146. NonnullOwnPtrVector<DebugInfo::VariableInfo> variables;
  147. // TODO: We can store the scopes in a better data strucutre
  148. for (const auto& scope : m_scopes) {
  149. if (regs.eip < scope.address_low || regs.eip >= scope.address_high)
  150. continue;
  151. for (const auto& die_entry : scope.dies_of_variables) {
  152. auto variable_info = create_variable_info(die_entry, regs);
  153. if (!variable_info)
  154. continue;
  155. variables.append(variable_info.release_nonnull());
  156. }
  157. }
  158. return variables;
  159. }
  160. static Optional<Dwarf::DIE> parse_variable_type_die(const Dwarf::DIE& variable_die, DebugInfo::VariableInfo& variable_info)
  161. {
  162. auto type_die_offset = variable_die.get_attribute(Dwarf::Attribute::Type);
  163. if (!type_die_offset.has_value())
  164. return {};
  165. ASSERT(type_die_offset.value().type == Dwarf::DIE::AttributeValue::Type::DieReference);
  166. auto type_die = variable_die.get_die_at_offset(type_die_offset.value().data.as_u32);
  167. auto type_name = type_die.get_attribute(Dwarf::Attribute::Name);
  168. if (type_name.has_value()) {
  169. variable_info.type_name = type_name.value().data.as_string;
  170. } else {
  171. dbg() << "Unnamed DWARF type at offset: " << type_die.offset();
  172. variable_info.name = "[Unnamed Type]";
  173. }
  174. return type_die;
  175. }
  176. static void parse_variable_location(const Dwarf::DIE& variable_die, DebugInfo::VariableInfo& variable_info, const PtraceRegisters& regs)
  177. {
  178. auto location_info = variable_die.get_attribute(Dwarf::Attribute::Location);
  179. if (!location_info.has_value())
  180. location_info = variable_die.get_attribute(Dwarf::Attribute::MemberLocation);
  181. if (location_info.has_value()) {
  182. if (location_info.value().type == Dwarf::DIE::AttributeValue::Type::UnsignedNumber) {
  183. variable_info.location_type = DebugInfo::VariableInfo::LocationType::Address;
  184. variable_info.location_data.address = location_info.value().data.as_u32;
  185. }
  186. if (location_info.value().type == Dwarf::DIE::AttributeValue::Type::DwarfExpression) {
  187. auto expression_bytes = ReadonlyBytes { location_info.value().data.as_raw_bytes.bytes, location_info.value().data.as_raw_bytes.length };
  188. auto value = Dwarf::Expression::evaluate(expression_bytes, regs);
  189. if (value.type != Dwarf::Expression::Type::None) {
  190. ASSERT(value.type == Dwarf::Expression::Type::UnsignedIntetger);
  191. variable_info.location_type = DebugInfo::VariableInfo::LocationType::Address;
  192. variable_info.location_data.address = value.data.as_u32;
  193. }
  194. }
  195. }
  196. }
  197. OwnPtr<DebugInfo::VariableInfo> DebugInfo::create_variable_info(const Dwarf::DIE& variable_die, const PtraceRegisters& regs) const
  198. {
  199. ASSERT(variable_die.tag() == Dwarf::EntryTag::Variable
  200. || variable_die.tag() == Dwarf::EntryTag::Member
  201. || variable_die.tag() == Dwarf::EntryTag::FormalParameter
  202. || variable_die.tag() == Dwarf::EntryTag::EnumerationType
  203. || variable_die.tag() == Dwarf::EntryTag::Enumerator
  204. || variable_die.tag() == Dwarf::EntryTag::StructureType);
  205. if (variable_die.tag() == Dwarf::EntryTag::FormalParameter
  206. && !variable_die.get_attribute(Dwarf::Attribute::Name).has_value()) {
  207. // We don't want to display info for unused paramters
  208. return {};
  209. }
  210. NonnullOwnPtr<VariableInfo> variable_info = make<VariableInfo>();
  211. variable_info->name = variable_die.get_attribute(Dwarf::Attribute::Name).value().data.as_string;
  212. auto type_die = parse_variable_type_die(variable_die, *variable_info);
  213. if (variable_die.tag() == Dwarf::EntryTag::Enumerator) {
  214. auto constant = variable_die.get_attribute(Dwarf::Attribute::ConstValue);
  215. ASSERT(constant.has_value());
  216. switch (constant.value().type) {
  217. case Dwarf::DIE::AttributeValue::Type::UnsignedNumber:
  218. variable_info->constant_data.as_u32 = constant.value().data.as_u32;
  219. break;
  220. case Dwarf::DIE::AttributeValue::Type::SignedNumber:
  221. variable_info->constant_data.as_i32 = constant.value().data.as_i32;
  222. break;
  223. case Dwarf::DIE::AttributeValue::Type::String:
  224. variable_info->constant_data.as_string = constant.value().data.as_string;
  225. break;
  226. default:
  227. ASSERT_NOT_REACHED();
  228. }
  229. } else {
  230. parse_variable_location(variable_die, *variable_info, regs);
  231. }
  232. if (type_die.has_value()) {
  233. OwnPtr<VariableInfo> type_info;
  234. if (type_die.value().tag() == Dwarf::EntryTag::EnumerationType || type_die.value().tag() == Dwarf::EntryTag::StructureType) {
  235. type_info = create_variable_info(type_die.value(), regs);
  236. }
  237. type_die.value().for_each_child([&](const Dwarf::DIE& member) {
  238. if (member.is_null())
  239. return;
  240. auto member_variable = create_variable_info(member, regs);
  241. ASSERT(member_variable);
  242. if (type_die.value().tag() == Dwarf::EntryTag::EnumerationType) {
  243. member_variable->parent = type_info.ptr();
  244. type_info->members.append(member_variable.release_nonnull());
  245. } else {
  246. ASSERT(variable_info->location_type == DebugInfo::VariableInfo::LocationType::Address);
  247. if (member_variable->location_type == DebugInfo::VariableInfo::LocationType::Address)
  248. member_variable->location_data.address += variable_info->location_data.address;
  249. member_variable->parent = variable_info.ptr();
  250. variable_info->members.append(member_variable.release_nonnull());
  251. }
  252. });
  253. if (type_info) {
  254. variable_info->type = move(type_info);
  255. variable_info->type->type_tag = type_die.value().tag();
  256. }
  257. }
  258. return variable_info;
  259. }
  260. String DebugInfo::name_of_containing_function(u32 address) const
  261. {
  262. for (const auto& scope : m_scopes) {
  263. if (!scope.is_function || address < scope.address_low || address >= scope.address_high)
  264. continue;
  265. return scope.name;
  266. }
  267. return {};
  268. }