1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
|
//===-- DWARFDebugRanges.cpp ------------------------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include "DWARFDebugRanges.h"
#include "SymbolFileDWARF.h"
#include "lldb/Core/Stream.h"
#include <assert.h>
using namespace lldb_private;
using namespace std;
DWARFDebugRanges::DWARFDebugRanges() :
m_range_map()
{
}
DWARFDebugRanges::~DWARFDebugRanges()
{
}
void
DWARFDebugRanges::Extract(SymbolFileDWARF* dwarf2Data)
{
RangeList range_list;
dw_offset_t offset = 0;
dw_offset_t debug_ranges_offset = offset;
while (range_list.Extract(dwarf2Data, &offset))
{
m_range_map[debug_ranges_offset] = range_list;
debug_ranges_offset = offset;
}
}
bool
DWARFDebugRanges::RangeList::AddRange(dw_addr_t lo_addr, dw_addr_t hi_addr)
{
if (lo_addr <= hi_addr)
{
Range range(lo_addr, hi_addr);
ranges.push_back(range);
return true;
}
return false;
}
const DWARFDebugRanges::Range*
DWARFDebugRanges::RangeList::Lookup(dw_addr_t offset) const
{
Range::const_iterator pos = ranges.begin();
Range::const_iterator end_pos = ranges.end();
for (pos = ranges.begin(); pos != end_pos; ++pos)
{
if (pos->begin_offset <= offset && offset < pos->end_offset)
{
return &(*pos);
}
}
return NULL;
}
size_t
DWARFDebugRanges::RangeList::Size() const
{
return ranges.size();
}
void
DWARFDebugRanges::RangeList::AddOffset(dw_addr_t offset)
{
if (!ranges.empty())
{
Range::iterator pos = ranges.begin();
Range::iterator end_pos = ranges.end();
for (pos = ranges.begin(); pos != end_pos; ++pos)
{
// assert for unsigned overflows
assert (~pos->begin_offset >= offset);
assert (~pos->end_offset >= offset);
pos->begin_offset += offset;
pos->end_offset += offset;
}
}
}
void
DWARFDebugRanges::RangeList::SubtractOffset(dw_addr_t offset)
{
if (!ranges.empty())
{
Range::iterator pos = ranges.begin();
Range::iterator end_pos = ranges.end();
for (pos = ranges.begin(); pos != end_pos; ++pos)
{
assert (pos->begin_offset >= offset);
assert (pos->end_offset >= offset);
pos->begin_offset -= offset;
pos->end_offset -= offset;
}
}
}
const DWARFDebugRanges::Range*
DWARFDebugRanges::RangeList::RangeAtIndex(size_t i) const
{
if (i < ranges.size())
return &ranges[i];
return NULL;
}
bool
DWARFDebugRanges::RangeList::Extract(SymbolFileDWARF* dwarf2Data, uint32_t* offset_ptr)
{
Clear();
uint32_t range_offset = *offset_ptr;
const DataExtractor& debug_ranges_data = dwarf2Data->get_debug_ranges_data();
uint32_t addr_size = debug_ranges_data.GetAddressByteSize();
while (debug_ranges_data.ValidOffsetForDataOfSize(*offset_ptr, 2 * addr_size))
{
dw_addr_t begin = debug_ranges_data.GetMaxU64(offset_ptr, addr_size);
dw_addr_t end = debug_ranges_data.GetMaxU64(offset_ptr, addr_size);
if (!begin && !end)
{
// End of range list
break;
}
// Extend 4 byte addresses that consists of 32 bits of 1's to be 64 bits
// of ones
switch (addr_size)
{
case 2:
if (begin == 0xFFFFull)
begin = DW_INVALID_ADDRESS;
break;
case 4:
if (begin == 0xFFFFFFFFull)
begin = DW_INVALID_ADDRESS;
break;
case 8:
break;
default:
assert(!"DWARFDebugRanges::RangeList::Extract() unsupported address size.");
break;
}
// Filter out empty ranges
if (begin != end)
ranges.push_back(Range(begin, end));
}
// Make sure we consumed at least something
return range_offset != *offset_ptr;
}
dw_addr_t
DWARFDebugRanges::RangeList::LowestAddress(const dw_addr_t cu_base_addr) const
{
dw_addr_t addr = DW_INVALID_ADDRESS;
dw_addr_t curr_base_addr = cu_base_addr;
if (!ranges.empty())
{
Range::const_iterator pos = ranges.begin();
Range::const_iterator end_pos = ranges.end();
for (pos = ranges.begin(); pos != end_pos; ++pos)
{
if (pos->begin_offset == DW_INVALID_ADDRESS)
curr_base_addr = pos->end_offset;
else if (curr_base_addr != DW_INVALID_ADDRESS)
{
dw_addr_t curr_addr = curr_base_addr + pos->begin_offset;
if (addr > curr_addr)
addr = curr_addr;
}
}
}
return addr;
}
dw_addr_t
DWARFDebugRanges::RangeList::HighestAddress(const dw_addr_t cu_base_addr) const
{
dw_addr_t addr = 0;
dw_addr_t curr_base_addr = cu_base_addr;
if (!ranges.empty())
{
Range::const_iterator pos = ranges.begin();
Range::const_iterator end_pos = ranges.end();
for (pos = ranges.begin(); pos != end_pos; ++pos)
{
if (pos->begin_offset == DW_INVALID_ADDRESS)
curr_base_addr = pos->end_offset;
else if (curr_base_addr != DW_INVALID_ADDRESS)
{
dw_addr_t curr_addr = curr_base_addr + pos->end_offset;
if (addr < curr_addr)
addr = curr_addr;
}
}
}
if (addr != 0)
return addr;
return DW_INVALID_ADDRESS;
}
void
DWARFDebugRanges::Dump(Stream *s, const DataExtractor& debug_ranges_data, uint32_t* offset_ptr, dw_addr_t cu_base_addr)
{
uint32_t addr_size = s->GetAddressByteSize();
bool verbose = s->GetVerbose();
dw_addr_t base_addr = cu_base_addr;
while (debug_ranges_data.ValidOffsetForDataOfSize(*offset_ptr, 2 * addr_size))
{
dw_addr_t begin = debug_ranges_data.GetMaxU64(offset_ptr, addr_size);
dw_addr_t end = debug_ranges_data.GetMaxU64(offset_ptr, addr_size);
// Extend 4 byte addresses that consits of 32 bits of 1's to be 64 bits
// of ones
if (begin == 0xFFFFFFFFull && addr_size == 4)
begin = DW_INVALID_ADDRESS;
s->Indent();
if (verbose)
{
s->AddressRange(begin, end, sizeof (dw_addr_t), " offsets = ");
}
if (begin == 0 && end == 0)
{
s->PutCString(" End");
break;
}
else if (begin == DW_INVALID_ADDRESS)
{
// A base address selection entry
base_addr = end;
s->Address(base_addr, sizeof (dw_addr_t), " Base address = ");
}
else
{
// Convert from offset to an address
dw_addr_t begin_addr = begin + base_addr;
dw_addr_t end_addr = end + base_addr;
s->AddressRange(begin_addr, end_addr, sizeof (dw_addr_t), verbose ? " ==> addrs = " : NULL);
}
}
}
bool
DWARFDebugRanges::FindRanges(dw_offset_t debug_ranges_offset, RangeList& range_list) const
{
range_map_const_iterator pos = m_range_map.find(debug_ranges_offset);
if (pos != m_range_map.end())
{
range_list = pos->second;
return true;
}
return false;
}
|
