1 //===-- DWARFDebugRangesList.cpp ------------------------------------------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9
10 #include "DWARFDebugRangeList.h"
11 #include "llvm/Support/Format.h"
12 #include "llvm/Support/raw_ostream.h"
13
14 using namespace llvm;
15
clear()16 void DWARFDebugRangeList::clear() {
17 Offset = -1U;
18 AddressSize = 0;
19 Entries.clear();
20 }
21
extract(DataExtractor data,uint32_t * offset_ptr)22 bool DWARFDebugRangeList::extract(DataExtractor data, uint32_t *offset_ptr) {
23 clear();
24 if (!data.isValidOffset(*offset_ptr))
25 return false;
26 AddressSize = data.getAddressSize();
27 if (AddressSize != 4 && AddressSize != 8)
28 return false;
29 Offset = *offset_ptr;
30 while (true) {
31 RangeListEntry entry;
32 uint32_t prev_offset = *offset_ptr;
33 entry.StartAddress = data.getAddress(offset_ptr);
34 entry.EndAddress = data.getAddress(offset_ptr);
35 // Check that both values were extracted correctly.
36 if (*offset_ptr != prev_offset + 2 * AddressSize) {
37 clear();
38 return false;
39 }
40 if (entry.isEndOfListEntry())
41 break;
42 Entries.push_back(entry);
43 }
44 return true;
45 }
46
dump(raw_ostream & OS) const47 void DWARFDebugRangeList::dump(raw_ostream &OS) const {
48 for (int i = 0, n = Entries.size(); i != n; ++i) {
49 const char *format_str = (AddressSize == 4
50 ? "%08x %08" PRIx64 " %08" PRIx64 "\n"
51 : "%08x %016" PRIx64 " %016" PRIx64 "\n");
52 OS << format(format_str, Offset, Entries[i].StartAddress,
53 Entries[i].EndAddress);
54 }
55 OS << format("%08x <End of list>\n", Offset);
56 }
57
containsAddress(uint64_t BaseAddress,uint64_t Address) const58 bool DWARFDebugRangeList::containsAddress(uint64_t BaseAddress,
59 uint64_t Address) const {
60 for (int i = 0, n = Entries.size(); i != n; ++i) {
61 if (Entries[i].isBaseAddressSelectionEntry(AddressSize))
62 BaseAddress = Entries[i].EndAddress;
63 else if (Entries[i].containsAddress(BaseAddress, Address))
64 return true;
65 }
66 return false;
67 }
68