DebugInfo.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295
  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 <LibDebug/Dwarf/CompilationUnit.h>
  29. #include <LibDebug/Dwarf/DwarfInfo.h>
  30. #include <LibDebug/Dwarf/Expression.h>
  31. DebugInfo::DebugInfo(NonnullRefPtr<const ELF::Loader> elf)
  32. : m_elf(elf)
  33. , m_dwarf_info(Dwarf::DwarfInfo::create(m_elf))
  34. {
  35. prepare_variable_scopes();
  36. prepare_lines();
  37. }
  38. void DebugInfo::prepare_variable_scopes()
  39. {
  40. m_dwarf_info->for_each_compilation_unit([&](const Dwarf::CompilationUnit& unit) {
  41. auto root = unit.root_die();
  42. parse_scopes_impl(root);
  43. });
  44. }
  45. void DebugInfo::parse_scopes_impl(const Dwarf::DIE& die)
  46. {
  47. die.for_each_child([&](const Dwarf::DIE& child) {
  48. if (child.is_null())
  49. return;
  50. if (!(child.tag() == Dwarf::EntryTag::SubProgram || child.tag() == Dwarf::EntryTag::LexicalBlock))
  51. return;
  52. if (child.get_attribute(Dwarf::Attribute::Inline).has_value()) {
  53. dbg() << "DWARF inlined functions are not supported";
  54. return;
  55. }
  56. if (child.get_attribute(Dwarf::Attribute::Ranges).has_value()) {
  57. dbg() << "DWARF ranges are not supported";
  58. return;
  59. }
  60. auto name = child.get_attribute(Dwarf::Attribute::Name);
  61. VariablesScope scope {};
  62. scope.is_function = (child.tag() == Dwarf::EntryTag::SubProgram);
  63. if (name.has_value())
  64. scope.name = name.value().data.as_string;
  65. if (!child.get_attribute(Dwarf::Attribute::LowPc).has_value()) {
  66. dbg() << "DWARF: Couldn't find attribtue LowPc for scope";
  67. return;
  68. }
  69. scope.address_low = child.get_attribute(Dwarf::Attribute::LowPc).value().data.as_u32;
  70. // The attribute name HighPc is confusing. In this context, it seems to actually be a positive offset from LowPc
  71. scope.address_high = scope.address_low + child.get_attribute(Dwarf::Attribute::HighPc).value().data.as_u32;
  72. child.for_each_child([&](const Dwarf::DIE& variable_entry) {
  73. if (!(variable_entry.tag() == Dwarf::EntryTag::Variable
  74. || variable_entry.tag() == Dwarf::EntryTag::FormalParameter))
  75. return;
  76. scope.dies_of_variables.append(variable_entry);
  77. });
  78. m_scopes.append(scope);
  79. parse_scopes_impl(child);
  80. });
  81. }
  82. void DebugInfo::prepare_lines()
  83. {
  84. auto section = m_elf->image().lookup_section(".debug_line");
  85. if (section.is_undefined())
  86. return;
  87. auto buffer = section.wrapping_byte_buffer();
  88. BufferStream stream(buffer);
  89. Vector<LineProgram::LineInfo> all_lines;
  90. while (!stream.at_end()) {
  91. LineProgram program(stream);
  92. all_lines.append(program.lines());
  93. }
  94. for (auto& line_info : all_lines) {
  95. String file_path = line_info.file;
  96. if (file_path.contains("Toolchain/") || file_path.contains("libgcc"))
  97. continue;
  98. if (file_path.contains("serenity/")) {
  99. auto start_index = file_path.index_of("serenity/").value() + String("serenity/").length();
  100. file_path = file_path.substring(start_index, file_path.length() - start_index);
  101. }
  102. m_sorted_lines.append({ line_info.address, file_path, line_info.line });
  103. }
  104. quick_sort(m_sorted_lines, [](auto& a, auto& b) {
  105. return a.address < b.address;
  106. });
  107. }
  108. Optional<DebugInfo::SourcePosition> DebugInfo::get_source_position(u32 target_address) const
  109. {
  110. if (m_sorted_lines.is_empty())
  111. return {};
  112. if (target_address < m_sorted_lines[0].address)
  113. return {};
  114. // TODO: We can do a binray search here
  115. for (size_t i = 0; i < m_sorted_lines.size() - 1; ++i) {
  116. if (m_sorted_lines[i + 1].address > target_address) {
  117. return Optional<SourcePosition>({ m_sorted_lines[i].file, m_sorted_lines[i].line, m_sorted_lines[i].address });
  118. }
  119. }
  120. return {};
  121. }
  122. Optional<u32> DebugInfo::get_instruction_from_source(const String& file, size_t line) const
  123. {
  124. for (const auto& line_entry : m_sorted_lines) {
  125. if (line_entry.file == file && line_entry.line == line)
  126. return Optional<u32>(line_entry.address);
  127. }
  128. return {};
  129. }
  130. NonnullOwnPtrVector<DebugInfo::VariableInfo> DebugInfo::get_variables_in_current_scope(const PtraceRegisters& regs) const
  131. {
  132. NonnullOwnPtrVector<DebugInfo::VariableInfo> variables;
  133. // TODO: We can store the scopes in a better data strucutre
  134. for (const auto& scope : m_scopes) {
  135. if (regs.eip < scope.address_low || regs.eip >= scope.address_high)
  136. continue;
  137. for (const auto& die_entry : scope.dies_of_variables) {
  138. auto variable_info = create_variable_info(die_entry, regs);
  139. if (!variable_info)
  140. continue;
  141. variables.append(variable_info.release_nonnull());
  142. }
  143. }
  144. return variables;
  145. }
  146. static Optional<Dwarf::DIE> parse_variable_type_die(const Dwarf::DIE& variable_die, DebugInfo::VariableInfo& variable_info)
  147. {
  148. auto type_die_offset = variable_die.get_attribute(Dwarf::Attribute::Type);
  149. if (!type_die_offset.has_value())
  150. return {};
  151. ASSERT(type_die_offset.value().type == Dwarf::DIE::AttributeValue::Type::DieReference);
  152. auto type_die = variable_die.get_die_at_offset(type_die_offset.value().data.as_u32);
  153. auto type_name = type_die.get_attribute(Dwarf::Attribute::Name);
  154. if (type_name.has_value()) {
  155. variable_info.type_name = type_name.value().data.as_string;
  156. } else {
  157. dbg() << "Unnamed DWARF type at offset: " << type_die.offset();
  158. variable_info.name = "[Unnamed Type]";
  159. }
  160. return type_die;
  161. }
  162. static void parse_variable_location(const Dwarf::DIE& variable_die, DebugInfo::VariableInfo& variable_info, const PtraceRegisters& regs)
  163. {
  164. auto location_info = variable_die.get_attribute(Dwarf::Attribute::Location);
  165. if (!location_info.has_value())
  166. location_info = variable_die.get_attribute(Dwarf::Attribute::MemberLocation);
  167. if (location_info.has_value()) {
  168. if (location_info.value().type == Dwarf::DIE::AttributeValue::Type::UnsignedNumber) {
  169. variable_info.location_type = DebugInfo::VariableInfo::LocationType::Address;
  170. variable_info.location_data.address = location_info.value().data.as_u32;
  171. }
  172. if (location_info.value().type == Dwarf::DIE::AttributeValue::Type::DwarfExpression) {
  173. auto expression_bytes = ByteBuffer::wrap(location_info.value().data.as_dwarf_expression.bytes, location_info.value().data.as_dwarf_expression.length);
  174. auto value = Dwarf::Expression::evaluate(expression_bytes, regs);
  175. if (value.type != Dwarf::Expression::Type::None) {
  176. ASSERT(value.type == Dwarf::Expression::Type::UnsignedIntetger);
  177. variable_info.location_type = DebugInfo::VariableInfo::LocationType::Address;
  178. variable_info.location_data.address = value.data.as_u32;
  179. }
  180. }
  181. }
  182. }
  183. OwnPtr<DebugInfo::VariableInfo> DebugInfo::create_variable_info(const Dwarf::DIE& variable_die, const PtraceRegisters& regs) const
  184. {
  185. ASSERT(variable_die.tag() == Dwarf::EntryTag::Variable
  186. || variable_die.tag() == Dwarf::EntryTag::Member
  187. || variable_die.tag() == Dwarf::EntryTag::FormalParameter
  188. || variable_die.tag() == Dwarf::EntryTag::EnumerationType
  189. || variable_die.tag() == Dwarf::EntryTag::Enumerator
  190. || variable_die.tag() == Dwarf::EntryTag::StructureType);
  191. if (variable_die.tag() == Dwarf::EntryTag::FormalParameter
  192. && !variable_die.get_attribute(Dwarf::Attribute::Name).has_value()) {
  193. // We don't want to display info for unused paramters
  194. return {};
  195. }
  196. NonnullOwnPtr<VariableInfo> variable_info = make<VariableInfo>();
  197. variable_info->name = variable_die.get_attribute(Dwarf::Attribute::Name).value().data.as_string;
  198. auto type_die = parse_variable_type_die(variable_die, *variable_info);
  199. if (variable_die.tag() == Dwarf::EntryTag::Enumerator) {
  200. auto constant = variable_die.get_attribute(Dwarf::Attribute::ConstValue);
  201. ASSERT(constant.has_value());
  202. switch (constant.value().type) {
  203. case Dwarf::DIE::AttributeValue::Type::UnsignedNumber:
  204. variable_info->constant_data.as_u32 = constant.value().data.as_u32;
  205. break;
  206. case Dwarf::DIE::AttributeValue::Type::SignedNumber:
  207. variable_info->constant_data.as_i32 = constant.value().data.as_i32;
  208. break;
  209. case Dwarf::DIE::AttributeValue::Type::String:
  210. variable_info->constant_data.as_string = constant.value().data.as_string;
  211. break;
  212. default:
  213. ASSERT_NOT_REACHED();
  214. }
  215. } else {
  216. parse_variable_location(variable_die, *variable_info, regs);
  217. }
  218. if (type_die.has_value()) {
  219. OwnPtr<VariableInfo> type_info;
  220. if (type_die.value().tag() == Dwarf::EntryTag::EnumerationType || type_die.value().tag() == Dwarf::EntryTag::StructureType) {
  221. type_info = create_variable_info(type_die.value(), regs);
  222. }
  223. type_die.value().for_each_child([&](const Dwarf::DIE& member) {
  224. if (member.is_null())
  225. return;
  226. auto member_variable = create_variable_info(member, regs);
  227. ASSERT(member_variable);
  228. if (type_die.value().tag() == Dwarf::EntryTag::EnumerationType) {
  229. member_variable->parent = type_info.ptr();
  230. type_info->members.append(member_variable.release_nonnull());
  231. } else {
  232. ASSERT(variable_info->location_type == DebugInfo::VariableInfo::LocationType::Address);
  233. if (member_variable->location_type == DebugInfo::VariableInfo::LocationType::Address)
  234. member_variable->location_data.address += variable_info->location_data.address;
  235. member_variable->parent = variable_info.ptr();
  236. variable_info->members.append(member_variable.release_nonnull());
  237. }
  238. });
  239. if (type_info) {
  240. variable_info->type = move(type_info);
  241. variable_info->type->type_tag = type_die.value().tag();
  242. }
  243. }
  244. return variable_info;
  245. }
  246. String DebugInfo::name_of_containing_function(u32 address) const
  247. {
  248. for (const auto& scope : m_scopes) {
  249. if (!scope.is_function || address < scope.address_low || address >= scope.address_high)
  250. continue;
  251. return scope.name;
  252. }
  253. return {};
  254. }