1 //===-- DWARFDebugAranges.cpp -----------------------------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "DWARFDebugAranges.h"
11 #include "DWARFCompileUnit.h"
12 #include "DWARFContext.h"
13 #include "llvm/Support/Format.h"
14 #include "llvm/Support/raw_ostream.h"
19 void DWARFDebugAranges::extract(DataExtractor DebugArangesData) {
20 if (!DebugArangesData.isValidOffset(0))
23 typedef std::vector<DWARFDebugArangeSet> RangeSetColl;
25 DWARFDebugArangeSet Set;
26 uint32_t TotalRanges = 0;
28 while (Set.extract(DebugArangesData, &Offset)) {
30 TotalRanges += Set.getNumDescriptors();
35 Aranges.reserve(TotalRanges);
36 for (RangeSetColl::const_iterator I = Sets.begin(), E = Sets.end(); I != E;
38 uint32_t CUOffset = I->getCompileUnitDIEOffset();
40 for (uint32_t i = 0, n = I->getNumDescriptors(); i < n; ++i) {
41 const DWARFDebugArangeSet::Descriptor *ArangeDescPtr =
43 uint64_t LowPC = ArangeDescPtr->Address;
44 uint64_t HighPC = LowPC + ArangeDescPtr->Length;
45 appendRange(CUOffset, LowPC, HighPC);
51 void DWARFDebugAranges::generate(DWARFContext *CTX) {
53 const uint32_t num_compile_units = CTX->getNumCompileUnits();
54 for (uint32_t cu_idx = 0; cu_idx < num_compile_units; ++cu_idx) {
55 if (DWARFCompileUnit *cu = CTX->getCompileUnitAtIndex(cu_idx)) {
56 uint32_t CUOffset = cu->getOffset();
57 if (ParsedCUOffsets.insert(CUOffset).second)
58 cu->buildAddressRangeTable(this, true, CUOffset);
65 void DWARFDebugAranges::dump(raw_ostream &OS) const {
66 for (RangeCollIterator I = Aranges.begin(), E = Aranges.end(); I != E; ++I) {
71 void DWARFDebugAranges::Range::dump(raw_ostream &OS) const {
72 OS << format("{0x%8.8x}: [0x%8.8" PRIx64 " - 0x%8.8" PRIx64 ")\n",
73 CUOffset, LowPC, HighPC());
76 void DWARFDebugAranges::appendRange(uint32_t CUOffset, uint64_t LowPC,
78 if (!Aranges.empty()) {
79 if (Aranges.back().CUOffset == CUOffset &&
80 Aranges.back().HighPC() == LowPC) {
81 Aranges.back().setHighPC(HighPC);
85 Aranges.push_back(Range(LowPC, HighPC, CUOffset));
88 void DWARFDebugAranges::sortAndMinimize() {
89 const size_t orig_arange_size = Aranges.size();
90 // Size of one? If so, no sorting is needed
91 if (orig_arange_size <= 1)
93 // Sort our address range entries
94 std::stable_sort(Aranges.begin(), Aranges.end());
96 // Most address ranges are contiguous from function to function
97 // so our new ranges will likely be smaller. We calculate the size
98 // of the new ranges since although std::vector objects can be resized,
99 // the will never reduce their allocated block size and free any excesss
100 // memory, so we might as well start a brand new collection so it is as
101 // small as possible.
103 // First calculate the size of the new minimal arange vector
104 // so we don't have to do a bunch of re-allocations as we
105 // copy the new minimal stuff over to the new collection.
106 size_t minimal_size = 1;
107 for (size_t i = 1; i < orig_arange_size; ++i) {
108 if (!Range::SortedOverlapCheck(Aranges[i-1], Aranges[i]))
112 // If the sizes are the same, then no consecutive aranges can be
113 // combined, we are done.
114 if (minimal_size == orig_arange_size)
117 // Else, make a new RangeColl that _only_ contains what we need.
118 RangeColl minimal_aranges;
119 minimal_aranges.resize(minimal_size);
121 minimal_aranges[j] = Aranges[0];
122 for (size_t i = 1; i < orig_arange_size; ++i) {
123 if (Range::SortedOverlapCheck(minimal_aranges[j], Aranges[i])) {
124 minimal_aranges[j].setHighPC(Aranges[i].HighPC());
126 // Only increment j if we aren't merging
127 minimal_aranges[++j] = Aranges[i];
130 assert(j+1 == minimal_size);
132 // Now swap our new minimal aranges into place. The local
133 // minimal_aranges will then contian the old big collection
134 // which will get freed.
135 minimal_aranges.swap(Aranges);
138 uint32_t DWARFDebugAranges::findAddress(uint64_t Address) const {
139 if (!Aranges.empty()) {
140 Range range(Address);
141 RangeCollIterator begin = Aranges.begin();
142 RangeCollIterator end = Aranges.end();
143 RangeCollIterator pos =
144 std::lower_bound(begin, end, range);
146 if (pos != end && pos->containsAddress(Address)) {
147 return pos->CUOffset;
148 } else if (pos != begin) {
150 if (pos->containsAddress(Address))
151 return pos->CUOffset;