DebugInfo.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  1. /*
  2. * Copyright (c) 2020, Itamar S. <itamar8910@gmail.com>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include "DebugInfo.h"
  7. #include <AK/Debug.h>
  8. #include <AK/LexicalPath.h>
  9. #include <AK/MemoryStream.h>
  10. #include <AK/QuickSort.h>
  11. #include <LibDebug/Dwarf/CompilationUnit.h>
  12. #include <LibDebug/Dwarf/DwarfInfo.h>
  13. #include <LibDebug/Dwarf/Expression.h>
  14. namespace Debug {
  15. DebugInfo::DebugInfo(NonnullOwnPtr<const ELF::Image> elf, String source_root, FlatPtr base_address)
  16. : m_elf(move(elf))
  17. , m_source_root(source_root)
  18. , m_base_address(base_address)
  19. , m_dwarf_info(*m_elf)
  20. {
  21. prepare_variable_scopes();
  22. prepare_lines();
  23. }
  24. void DebugInfo::prepare_variable_scopes()
  25. {
  26. m_dwarf_info.for_each_compilation_unit([&](const Dwarf::CompilationUnit& unit) {
  27. auto root = unit.root_die();
  28. parse_scopes_impl(root);
  29. });
  30. }
  31. void DebugInfo::parse_scopes_impl(const Dwarf::DIE& die)
  32. {
  33. die.for_each_child([&](const Dwarf::DIE& child) {
  34. if (child.is_null())
  35. return;
  36. if (!(child.tag() == Dwarf::EntryTag::SubProgram || child.tag() == Dwarf::EntryTag::LexicalBlock))
  37. return;
  38. if (child.get_attribute(Dwarf::Attribute::Inline).has_value()) {
  39. dbgln_if(SPAM_DEBUG, "DWARF inlined functions are not supported");
  40. return;
  41. }
  42. if (child.get_attribute(Dwarf::Attribute::Ranges).has_value()) {
  43. dbgln_if(SPAM_DEBUG, "DWARF ranges are not supported");
  44. return;
  45. }
  46. auto name = child.get_attribute(Dwarf::Attribute::Name);
  47. VariablesScope scope {};
  48. scope.is_function = (child.tag() == Dwarf::EntryTag::SubProgram);
  49. if (name.has_value())
  50. scope.name = name.value().data.as_string;
  51. if (!child.get_attribute(Dwarf::Attribute::LowPc).has_value()) {
  52. dbgln_if(SPAM_DEBUG, "DWARF: Couldn't find attribute LowPc for scope");
  53. return;
  54. }
  55. scope.address_low = child.get_attribute(Dwarf::Attribute::LowPc).value().data.as_u32;
  56. // The attribute name HighPc is confusing. In this context, it seems to actually be a positive offset from LowPc
  57. scope.address_high = scope.address_low + child.get_attribute(Dwarf::Attribute::HighPc).value().data.as_u32;
  58. child.for_each_child([&](const Dwarf::DIE& variable_entry) {
  59. if (!(variable_entry.tag() == Dwarf::EntryTag::Variable
  60. || variable_entry.tag() == Dwarf::EntryTag::FormalParameter))
  61. return;
  62. scope.dies_of_variables.append(variable_entry);
  63. });
  64. m_scopes.append(scope);
  65. parse_scopes_impl(child);
  66. });
  67. }
  68. void DebugInfo::prepare_lines()
  69. {
  70. auto section = elf().lookup_section(".debug_line");
  71. if (section.is_undefined())
  72. return;
  73. InputMemoryStream stream { section.bytes() };
  74. Vector<Dwarf::LineProgram::LineInfo> all_lines;
  75. while (!stream.eof()) {
  76. Dwarf::LineProgram program(m_dwarf_info, stream);
  77. all_lines.append(program.lines());
  78. }
  79. String serenity_slash("serenity/");
  80. for (auto& line_info : all_lines) {
  81. String file_path = line_info.file;
  82. if (file_path.contains("Toolchain/") || file_path.contains("libgcc"))
  83. continue;
  84. if (file_path.contains(serenity_slash)) {
  85. auto start_index = file_path.index_of(serenity_slash).value() + serenity_slash.length();
  86. file_path = file_path.substring(start_index, file_path.length() - start_index);
  87. }
  88. if (file_path.starts_with("./") && !m_source_root.is_null()) {
  89. file_path = LexicalPath::canonicalized_path(String::formatted("{}/{}", m_source_root, file_path));
  90. }
  91. m_sorted_lines.append({ line_info.address, file_path, line_info.line });
  92. }
  93. quick_sort(m_sorted_lines, [](auto& a, auto& b) {
  94. return a.address < b.address;
  95. });
  96. }
  97. Optional<DebugInfo::SourcePosition> DebugInfo::get_source_position(u32 target_address) const
  98. {
  99. if (m_sorted_lines.is_empty())
  100. return {};
  101. if (target_address < m_sorted_lines[0].address)
  102. return {};
  103. // TODO: We can do a binray search here
  104. for (size_t i = 0; i < m_sorted_lines.size() - 1; ++i) {
  105. if (m_sorted_lines[i + 1].address > target_address) {
  106. return SourcePosition::from_line_info(m_sorted_lines[i]);
  107. }
  108. }
  109. return {};
  110. }
  111. Optional<DebugInfo::SourcePositionAndAddress> DebugInfo::get_address_from_source_position(const String& file, size_t line) const
  112. {
  113. String file_path = file;
  114. if (!file_path.starts_with("/"))
  115. file_path = String::formatted("/{}", file_path);
  116. constexpr char SERENITY_LIBS_PREFIX[] = "/usr/src/serenity";
  117. if (file.starts_with(SERENITY_LIBS_PREFIX)) {
  118. file_path = file.substring(sizeof(SERENITY_LIBS_PREFIX), file.length() - sizeof(SERENITY_LIBS_PREFIX));
  119. file_path = String::formatted("../{}", file_path);
  120. }
  121. Optional<SourcePositionAndAddress> result;
  122. for (const auto& line_entry : m_sorted_lines) {
  123. if (!line_entry.file.ends_with(file_path))
  124. continue;
  125. if (line_entry.line > line)
  126. continue;
  127. // We look for the source position that is closest to the desired position, and is not after it.
  128. // For example, get_address_of_source_position("main.cpp", 73) could return the address for an instruction whose location is ("main.cpp", 72)
  129. // as there might not be an instruction mapped for "main.cpp", 73.
  130. if (!result.has_value() || (line_entry.line > result.value().line)) {
  131. result = SourcePositionAndAddress { line_entry.file, line_entry.line, line_entry.address };
  132. }
  133. }
  134. return result;
  135. }
  136. NonnullOwnPtrVector<DebugInfo::VariableInfo> DebugInfo::get_variables_in_current_scope(const PtraceRegisters& regs) const
  137. {
  138. NonnullOwnPtrVector<DebugInfo::VariableInfo> variables;
  139. // TODO: We can store the scopes in a better data structure
  140. for (const auto& scope : m_scopes) {
  141. if (regs.eip - m_base_address < scope.address_low || regs.eip - m_base_address >= scope.address_high)
  142. continue;
  143. for (const auto& die_entry : scope.dies_of_variables) {
  144. auto variable_info = create_variable_info(die_entry, regs);
  145. if (!variable_info)
  146. continue;
  147. variables.append(variable_info.release_nonnull());
  148. }
  149. }
  150. return variables;
  151. }
  152. static Optional<Dwarf::DIE> parse_variable_type_die(const Dwarf::DIE& variable_die, DebugInfo::VariableInfo& variable_info)
  153. {
  154. auto type_die_offset = variable_die.get_attribute(Dwarf::Attribute::Type);
  155. if (!type_die_offset.has_value())
  156. return {};
  157. VERIFY(type_die_offset.value().type == Dwarf::AttributeValue::Type::DieReference);
  158. auto type_die = variable_die.get_die_at_offset(type_die_offset.value().data.as_u32);
  159. auto type_name = type_die.get_attribute(Dwarf::Attribute::Name);
  160. if (type_name.has_value()) {
  161. variable_info.type_name = type_name.value().data.as_string;
  162. } else {
  163. dbgln("Unnamed DWARF type at offset: {}", type_die.offset());
  164. variable_info.type_name = "[Unnamed Type]";
  165. }
  166. return type_die;
  167. }
  168. static void parse_variable_location(const Dwarf::DIE& variable_die, DebugInfo::VariableInfo& variable_info, const PtraceRegisters& regs)
  169. {
  170. auto location_info = variable_die.get_attribute(Dwarf::Attribute::Location);
  171. if (!location_info.has_value()) {
  172. location_info = variable_die.get_attribute(Dwarf::Attribute::MemberLocation);
  173. }
  174. if (!location_info.has_value())
  175. return;
  176. switch (location_info.value().type) {
  177. case Dwarf::AttributeValue::Type::UnsignedNumber:
  178. variable_info.location_type = DebugInfo::VariableInfo::LocationType::Address;
  179. variable_info.location_data.address = location_info.value().data.as_u32;
  180. break;
  181. case Dwarf::AttributeValue::Type::DwarfExpression: {
  182. auto expression_bytes = ReadonlyBytes { location_info.value().data.as_raw_bytes.bytes, location_info.value().data.as_raw_bytes.length };
  183. auto value = Dwarf::Expression::evaluate(expression_bytes, regs);
  184. if (value.type != Dwarf::Expression::Type::None) {
  185. VERIFY(value.type == Dwarf::Expression::Type::UnsignedIntetger);
  186. variable_info.location_type = DebugInfo::VariableInfo::LocationType::Address;
  187. variable_info.location_data.address = value.data.as_u32;
  188. }
  189. break;
  190. }
  191. default:
  192. dbgln("Warning: unhandled Dwarf location type: {}", (int)location_info.value().type);
  193. }
  194. }
  195. OwnPtr<DebugInfo::VariableInfo> DebugInfo::create_variable_info(const Dwarf::DIE& variable_die, const PtraceRegisters& regs, u32 address_offset) const
  196. {
  197. VERIFY(is_variable_tag_supported(variable_die.tag()));
  198. if (variable_die.tag() == Dwarf::EntryTag::FormalParameter
  199. && !variable_die.get_attribute(Dwarf::Attribute::Name).has_value()) {
  200. // We don't want to display info for unused parameters
  201. return {};
  202. }
  203. NonnullOwnPtr<VariableInfo> variable_info = make<VariableInfo>();
  204. auto name_attribute = variable_die.get_attribute(Dwarf::Attribute::Name);
  205. if (name_attribute.has_value())
  206. variable_info->name = name_attribute.value().data.as_string;
  207. auto type_die = parse_variable_type_die(variable_die, *variable_info);
  208. if (variable_die.tag() == Dwarf::EntryTag::Enumerator) {
  209. auto constant = variable_die.get_attribute(Dwarf::Attribute::ConstValue);
  210. VERIFY(constant.has_value());
  211. switch (constant.value().type) {
  212. case Dwarf::AttributeValue::Type::UnsignedNumber:
  213. variable_info->constant_data.as_u32 = constant.value().data.as_u32;
  214. break;
  215. case Dwarf::AttributeValue::Type::SignedNumber:
  216. variable_info->constant_data.as_i32 = constant.value().data.as_i32;
  217. break;
  218. case Dwarf::AttributeValue::Type::String:
  219. variable_info->constant_data.as_string = constant.value().data.as_string;
  220. break;
  221. default:
  222. VERIFY_NOT_REACHED();
  223. }
  224. } else {
  225. parse_variable_location(variable_die, *variable_info, regs);
  226. variable_info->location_data.address += address_offset;
  227. }
  228. if (type_die.has_value())
  229. add_type_info_to_variable(type_die.value(), regs, variable_info);
  230. return variable_info;
  231. }
  232. void DebugInfo::add_type_info_to_variable(const Dwarf::DIE& type_die, const PtraceRegisters& regs, DebugInfo::VariableInfo* parent_variable) const
  233. {
  234. OwnPtr<VariableInfo> type_info;
  235. auto is_array_type = type_die.tag() == Dwarf::EntryTag::ArrayType;
  236. if (type_die.tag() == Dwarf::EntryTag::EnumerationType
  237. || type_die.tag() == Dwarf::EntryTag::StructureType
  238. || is_array_type) {
  239. type_info = create_variable_info(type_die, regs);
  240. }
  241. type_die.for_each_child([&](const Dwarf::DIE& member) {
  242. if (member.is_null())
  243. return;
  244. if (is_array_type && member.tag() == Dwarf::EntryTag::SubRangeType) {
  245. auto upper_bound = member.get_attribute(Dwarf::Attribute::UpperBound);
  246. VERIFY(upper_bound.has_value());
  247. auto size = upper_bound.value().data.as_u32 + 1;
  248. type_info->dimension_sizes.append(size);
  249. return;
  250. }
  251. if (!is_variable_tag_supported(member.tag()))
  252. return;
  253. auto member_variable = create_variable_info(member, regs, parent_variable->location_data.address);
  254. VERIFY(member_variable);
  255. if (type_die.tag() == Dwarf::EntryTag::EnumerationType) {
  256. member_variable->parent = type_info.ptr();
  257. type_info->members.append(member_variable.release_nonnull());
  258. } else {
  259. if (parent_variable->location_type != DebugInfo::VariableInfo::LocationType::Address)
  260. return;
  261. member_variable->parent = parent_variable;
  262. parent_variable->members.append(member_variable.release_nonnull());
  263. }
  264. });
  265. if (type_info) {
  266. if (is_array_type) {
  267. StringBuilder array_type_name;
  268. array_type_name.append(type_info->type_name);
  269. for (auto array_size : type_info->dimension_sizes) {
  270. array_type_name.append("[");
  271. array_type_name.append(String::formatted("{:d}", array_size));
  272. array_type_name.append("]");
  273. }
  274. parent_variable->type_name = array_type_name.to_string();
  275. }
  276. parent_variable->type = move(type_info);
  277. parent_variable->type->type_tag = type_die.tag();
  278. }
  279. }
  280. bool DebugInfo::is_variable_tag_supported(const Dwarf::EntryTag& tag)
  281. {
  282. return tag == Dwarf::EntryTag::Variable
  283. || tag == Dwarf::EntryTag::Member
  284. || tag == Dwarf::EntryTag::FormalParameter
  285. || tag == Dwarf::EntryTag::EnumerationType
  286. || tag == Dwarf::EntryTag::Enumerator
  287. || tag == Dwarf::EntryTag::StructureType
  288. || tag == Dwarf::EntryTag::ArrayType;
  289. }
  290. String DebugInfo::name_of_containing_function(u32 address) const
  291. {
  292. auto function = get_containing_function(address);
  293. if (!function.has_value())
  294. return {};
  295. return function.value().name;
  296. }
  297. Optional<DebugInfo::VariablesScope> DebugInfo::get_containing_function(u32 address) const
  298. {
  299. for (const auto& scope : m_scopes) {
  300. if (!scope.is_function || address < scope.address_low || address >= scope.address_high)
  301. continue;
  302. return scope;
  303. }
  304. return {};
  305. }
  306. Vector<DebugInfo::SourcePosition> DebugInfo::source_lines_in_scope(const VariablesScope& scope) const
  307. {
  308. Vector<DebugInfo::SourcePosition> source_lines;
  309. for (const auto& line : m_sorted_lines) {
  310. if (line.address < scope.address_low)
  311. continue;
  312. if (line.address >= scope.address_high)
  313. break;
  314. source_lines.append(SourcePosition::from_line_info(line));
  315. }
  316. return source_lines;
  317. }
  318. DebugInfo::SourcePosition DebugInfo::SourcePosition::from_line_info(const Dwarf::LineProgram::LineInfo& line)
  319. {
  320. return { line.file, line.line, { line.address } };
  321. }
  322. }