AddressRanges.cpp 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  1. /*
  2. * Copyright (c) 2020-2021, Itamar S. <itamar8910@gmail.com>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include "AddressRanges.h"
  7. #include "DwarfTypes.h"
  8. namespace Debug::Dwarf {
  9. AddressRangesV5::AddressRangesV5(ReadonlyBytes range_lists_data, size_t offset, CompilationUnit const& compilation_unit)
  10. : m_range_lists_stream(range_lists_data)
  11. , m_compilation_unit(compilation_unit)
  12. {
  13. m_range_lists_stream.seek(offset);
  14. }
  15. void AddressRangesV5::for_each_range(Function<void(Range)> callback)
  16. {
  17. // Dwarf version 5, section 2.17.3 "Non-Contiguous Address Ranges"
  18. Optional<FlatPtr> current_base_address;
  19. while (!m_range_lists_stream.eof() && !m_range_lists_stream.has_any_error()) {
  20. u8 entry_type;
  21. m_range_lists_stream >> entry_type;
  22. switch (static_cast<RangeListEntryType>(entry_type)) {
  23. case RangeListEntryType::BaseAddress: {
  24. FlatPtr base;
  25. m_range_lists_stream >> base;
  26. current_base_address = base;
  27. break;
  28. }
  29. case RangeListEntryType::BaseAddressX: {
  30. FlatPtr index;
  31. m_range_lists_stream.read_LEB128_unsigned(index);
  32. current_base_address = m_compilation_unit.get_address(index);
  33. break;
  34. }
  35. case RangeListEntryType::OffsetPair: {
  36. Optional<FlatPtr> base_address = current_base_address;
  37. if (!base_address.has_value()) {
  38. base_address = m_compilation_unit.base_address();
  39. }
  40. if (!base_address.has_value()) {
  41. dbgln("expected base_address for rangelist");
  42. return;
  43. }
  44. size_t start_offset, end_offset;
  45. m_range_lists_stream.read_LEB128_unsigned(start_offset);
  46. m_range_lists_stream.read_LEB128_unsigned(end_offset);
  47. callback(Range { start_offset + *base_address, end_offset + *base_address });
  48. break;
  49. }
  50. case RangeListEntryType::StartLength: {
  51. FlatPtr start;
  52. m_range_lists_stream >> start;
  53. size_t length;
  54. m_range_lists_stream.read_LEB128_unsigned(length);
  55. callback(Range { start, start + length });
  56. break;
  57. }
  58. case RangeListEntryType::StartXEndX: {
  59. size_t start, end;
  60. m_range_lists_stream.read_LEB128_unsigned(start);
  61. m_range_lists_stream.read_LEB128_unsigned(end);
  62. callback(Range { m_compilation_unit.get_address(start), m_compilation_unit.get_address(end) });
  63. break;
  64. }
  65. case RangeListEntryType::StartXLength: {
  66. size_t start, length;
  67. m_range_lists_stream.read_LEB128_unsigned(start);
  68. m_range_lists_stream.read_LEB128_unsigned(length);
  69. auto start_addr = m_compilation_unit.get_address(start);
  70. callback(Range { start_addr, start_addr + length });
  71. break;
  72. }
  73. case RangeListEntryType::EndOfList:
  74. return;
  75. default:
  76. dbgln("unsupported range list entry type: 0x{:x}", entry_type);
  77. return;
  78. }
  79. }
  80. }
  81. AddressRangesV4::AddressRangesV4(ReadonlyBytes ranges_data, size_t offset, CompilationUnit const& compilation_unit)
  82. : m_ranges_stream(ranges_data)
  83. , m_compilation_unit(compilation_unit)
  84. {
  85. m_ranges_stream.seek(offset);
  86. }
  87. void AddressRangesV4::for_each_range(Function<void(Range)> callback)
  88. {
  89. // Dwarf version 4, section 2.17.3 "Non-Contiguous Address Ranges"
  90. Optional<FlatPtr> current_base_address;
  91. while (!m_ranges_stream.eof() && !m_ranges_stream.has_any_error()) {
  92. FlatPtr begin, end;
  93. m_ranges_stream >> begin >> end;
  94. if (begin == 0 && end == 0) {
  95. // end of list entry
  96. return;
  97. } else if (begin == explode_byte(0xff)) {
  98. current_base_address = end;
  99. } else {
  100. FlatPtr base = current_base_address.value_or(m_compilation_unit.base_address().value_or(0));
  101. callback({ base + begin, base + end });
  102. }
  103. }
  104. }
  105. }