/Users/buildslave/jenkins/workspace/coverage/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugAranges.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | //===-- DWARFDebugAranges.cpp ---------------------------------------------===// |
2 | | // |
3 | | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
4 | | // See https://llvm.org/LICENSE.txt for license information. |
5 | | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
6 | | // |
7 | | //===----------------------------------------------------------------------===// |
8 | | |
9 | | #include "DWARFDebugAranges.h" |
10 | | #include "DWARFDebugArangeSet.h" |
11 | | #include "DWARFUnit.h" |
12 | | #include "LogChannelDWARF.h" |
13 | | #include "lldb/Utility/Log.h" |
14 | | #include "lldb/Utility/Timer.h" |
15 | | |
16 | | using namespace lldb; |
17 | | using namespace lldb_private; |
18 | | |
19 | | // Constructor |
20 | 4.24k | DWARFDebugAranges::DWARFDebugAranges() : m_aranges() {} |
21 | | |
22 | | // CountArangeDescriptors |
23 | | class CountArangeDescriptors { |
24 | | public: |
25 | 0 | CountArangeDescriptors(uint32_t &count_ref) : count(count_ref) { |
26 | 0 | // printf("constructor CountArangeDescriptors()\n"); |
27 | 0 | } |
28 | 0 | void operator()(const DWARFDebugArangeSet &set) { |
29 | 0 | count += set.NumDescriptors(); |
30 | 0 | } |
31 | | uint32_t &count; |
32 | | }; |
33 | | |
34 | | // Extract |
35 | 2.15k | void DWARFDebugAranges::extract(const DWARFDataExtractor &debug_aranges_data) { |
36 | 2.15k | lldb::offset_t offset = 0; |
37 | | |
38 | 2.15k | DWARFDebugArangeSet set; |
39 | 2.15k | Range range; |
40 | 3.49k | while (debug_aranges_data.ValidOffset(offset)) { |
41 | 1.34k | const lldb::offset_t set_offset = offset; |
42 | 1.34k | if (llvm::Error error = set.extract(debug_aranges_data, &offset)) { |
43 | 1 | Log *log = GetLog(DWARFLog::DebugInfo); |
44 | 1 | LLDB_LOG_ERROR(log, std::move(error), |
45 | 1 | "DWARFDebugAranges::extract failed to extract " |
46 | 1 | ".debug_aranges set at offset %#" PRIx64, |
47 | 1 | set_offset); |
48 | 1.34k | } else { |
49 | 1.34k | const uint32_t num_descriptors = set.NumDescriptors(); |
50 | 1.34k | if (num_descriptors > 0) { |
51 | 1.34k | const dw_offset_t cu_offset = set.GetHeader().cu_offset; |
52 | | |
53 | 33.6k | for (uint32_t i = 0; i < num_descriptors; ++i32.2k ) { |
54 | 32.2k | const DWARFDebugArangeSet::Descriptor &descriptor = |
55 | 32.2k | set.GetDescriptorRef(i); |
56 | 32.2k | m_aranges.Append(RangeToDIE::Entry(descriptor.address, |
57 | 32.2k | descriptor.length, cu_offset)); |
58 | 32.2k | } |
59 | 1.34k | } |
60 | 1.34k | } |
61 | | // Always use the previous DWARFDebugArangeSet's information to calculate |
62 | | // the offset of the next DWARFDebugArangeSet in case we entouncter an |
63 | | // error in the current DWARFDebugArangeSet and our offset position is |
64 | | // still in the middle of the data. If we do this, we can parse all valid |
65 | | // DWARFDebugArangeSet objects without returning invalid errors. |
66 | 1.34k | offset = set.GetNextOffset(); |
67 | 1.34k | set.Clear(); |
68 | 1.34k | } |
69 | 2.15k | } |
70 | | |
71 | 0 | void DWARFDebugAranges::Dump(Log *log) const { |
72 | 0 | if (log == nullptr) |
73 | 0 | return; |
74 | | |
75 | 0 | const size_t num_entries = m_aranges.GetSize(); |
76 | 0 | for (size_t i = 0; i < num_entries; ++i) { |
77 | 0 | const RangeToDIE::Entry *entry = m_aranges.GetEntryAtIndex(i); |
78 | 0 | if (entry) |
79 | 0 | LLDB_LOG(log, "{0:x8}: [{1:x16} - {2:x16})", entry->data, |
80 | 0 | entry->GetRangeBase(), entry->GetRangeEnd()); |
81 | 0 | } |
82 | 0 | } |
83 | | |
84 | | void DWARFDebugAranges::AppendRange(dw_offset_t offset, dw_addr_t low_pc, |
85 | 51.6k | dw_addr_t high_pc) { |
86 | 51.6k | if (high_pc > low_pc) |
87 | 51.6k | m_aranges.Append(RangeToDIE::Entry(low_pc, high_pc - low_pc, offset)); |
88 | 51.6k | } |
89 | | |
90 | 4.24k | void DWARFDebugAranges::Sort(bool minimize) { |
91 | 4.24k | LLDB_SCOPED_TIMERF("%s this = %p", LLVM_PRETTY_FUNCTION, |
92 | 4.24k | static_cast<void *>(this)); |
93 | | |
94 | 4.24k | m_aranges.Sort(); |
95 | 4.24k | m_aranges.CombineConsecutiveEntriesWithEqualData(); |
96 | 4.24k | } |
97 | | |
98 | | // FindAddress |
99 | 1.51M | dw_offset_t DWARFDebugAranges::FindAddress(dw_addr_t address) const { |
100 | 1.51M | const RangeToDIE::Entry *entry = m_aranges.FindEntryThatContains(address); |
101 | 1.51M | if (entry) |
102 | 1.50M | return entry->data; |
103 | 1.94k | return DW_INVALID_OFFSET; |
104 | 1.51M | } |