| //===-- DWARFDebugAranges.cpp ---------------------------------------------===// |
| // |
| // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| // See https://llvm.org/LICENSE.txt for license information. |
| // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| // |
| //===----------------------------------------------------------------------===// |
| |
| #include "DWARFDebugAranges.h" |
| #include "DWARFDebugArangeSet.h" |
| #include "DWARFUnit.h" |
| #include "LogChannelDWARF.h" |
| #include "lldb/Utility/Log.h" |
| #include "lldb/Utility/Timer.h" |
| |
| using namespace lldb; |
| using namespace lldb_private; |
| using namespace lldb_private::plugin::dwarf; |
| |
| // Constructor |
| DWARFDebugAranges::DWARFDebugAranges() : m_aranges() {} |
| |
| // CountArangeDescriptors |
| class CountArangeDescriptors { |
| public: |
| CountArangeDescriptors(uint32_t &count_ref) : count(count_ref) { |
| // printf("constructor CountArangeDescriptors()\n"); |
| } |
| void operator()(const DWARFDebugArangeSet &set) { |
| count += set.NumDescriptors(); |
| } |
| uint32_t &count; |
| }; |
| |
| // Extract |
| void DWARFDebugAranges::extract(const DWARFDataExtractor &debug_aranges_data) { |
| lldb::offset_t offset = 0; |
| |
| DWARFDebugArangeSet set; |
| Range range; |
| while (debug_aranges_data.ValidOffset(offset)) { |
| const lldb::offset_t set_offset = offset; |
| if (llvm::Error error = set.extract(debug_aranges_data, &offset)) { |
| Log *log = GetLog(DWARFLog::DebugInfo); |
| LLDB_LOG_ERROR(log, std::move(error), |
| "DWARFDebugAranges::extract failed to extract " |
| ".debug_aranges set at offset {1:x}: {0}", |
| set_offset); |
| } else { |
| const uint32_t num_descriptors = set.NumDescriptors(); |
| if (num_descriptors > 0) { |
| const dw_offset_t cu_offset = set.GetHeader().cu_offset; |
| |
| for (uint32_t i = 0; i < num_descriptors; ++i) { |
| const DWARFDebugArangeSet::Descriptor &descriptor = |
| set.GetDescriptorRef(i); |
| m_aranges.Append(RangeToDIE::Entry(descriptor.address, |
| descriptor.length, cu_offset)); |
| } |
| } |
| } |
| // Always use the previous DWARFDebugArangeSet's information to calculate |
| // the offset of the next DWARFDebugArangeSet in case we entouncter an |
| // error in the current DWARFDebugArangeSet and our offset position is |
| // still in the middle of the data. If we do this, we can parse all valid |
| // DWARFDebugArangeSet objects without returning invalid errors. |
| offset = set.GetNextOffset(); |
| set.Clear(); |
| } |
| } |
| |
| void DWARFDebugAranges::Dump(Log *log) const { |
| if (log == nullptr) |
| return; |
| |
| const size_t num_entries = m_aranges.GetSize(); |
| for (size_t i = 0; i < num_entries; ++i) { |
| const RangeToDIE::Entry *entry = m_aranges.GetEntryAtIndex(i); |
| if (entry) |
| LLDB_LOG(log, "{0:x8}: [{1:x16} - {2:x16})", entry->data, |
| entry->GetRangeBase(), entry->GetRangeEnd()); |
| } |
| } |
| |
| void DWARFDebugAranges::AppendRange(dw_offset_t offset, dw_addr_t low_pc, |
| dw_addr_t high_pc) { |
| if (high_pc > low_pc) |
| m_aranges.Append(RangeToDIE::Entry(low_pc, high_pc - low_pc, offset)); |
| } |
| |
| void DWARFDebugAranges::Sort(bool minimize) { |
| LLDB_SCOPED_TIMERF("%s this = %p", LLVM_PRETTY_FUNCTION, |
| static_cast<void *>(this)); |
| |
| m_aranges.Sort(); |
| m_aranges.CombineConsecutiveEntriesWithEqualData(); |
| } |
| |
| // FindAddress |
| dw_offset_t DWARFDebugAranges::FindAddress(dw_addr_t address) const { |
| const RangeToDIE::Entry *entry = m_aranges.FindEntryThatContains(address); |
| if (entry) |
| return entry->data; |
| return DW_INVALID_OFFSET; |
| } |