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
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
|
#ifndef __READDWARF_H__
#define __READDWARF_H__
#include <string>
#include <vector>
#include "mspdb.h"
typedef unsigned char byte;
inline unsigned int LEB128(byte* &p)
{
unsigned int x = 0;
int shift = 0;
while (*p & 0x80)
{
x |= (*p & 0x7f) << shift;
shift += 7;
p++;
}
x |= *p << shift;
p++;
return x;
}
inline int SLEB128(byte* &p)
{
unsigned int x = 0;
int shift = 0;
while (*p & 0x80)
{
x |= (*p & 0x7f) << shift;
shift += 7;
p++;
}
x |= *p << shift;
if (*p & 0x40)
x |= -(1 << (shift + 7)); // sign extend
p++;
return x;
}
inline unsigned int RD2(byte* &p)
{
unsigned int x = *p++;
x |= *p++ << 8;
return x;
}
inline unsigned int RD4(byte* &p)
{
unsigned int x = *p++;
x |= *p++ << 8;
x |= *p++ << 16;
x |= *p++ << 24;
return x;
}
inline unsigned long long RD8(byte* &p)
{
unsigned long long x = *p++;
for (int shift = 8; shift < 64; shift += 8)
x |= (unsigned long long) *p++ << shift;
return x;
}
inline unsigned long long RDsize(byte* &p, int size)
{
if (size > 8)
size = 8;
unsigned long long x = *p++;
for (int shift = 8; shift < size * 8; shift += 8)
x |= (unsigned long long) *p++ << shift;
return x;
}
enum AttrClass
{
Invalid,
Addr,
Block,
Const,
String,
Flag,
Ref,
ExprLoc,
SecOffset
};
struct DWARF_Attribute
{
AttrClass type;
union
{
unsigned long addr;
struct { byte* ptr; unsigned len; } block;
unsigned long cons;
const char* string;
bool flag;
byte* ref;
struct { byte* ptr; unsigned len; } expr;
unsigned long sec_offset;
};
};
///////////////////////////////////////////////////////////////////////////////
#include "pshpack1.h"
struct DWARF_CompilationUnit
{
unsigned int unit_length; // 12 byte in DWARF-64
unsigned short version;
unsigned int debug_abbrev_offset; // 8 byte in DWARF-64
byte address_size;
bool isDWARF64() const { return unit_length == ~0; }
int refSize() const { return unit_length == ~0 ? 8 : 4; }
};
struct DWARF_FileName
{
const char* file_name;
unsigned int dir_index;
unsigned long lastModification;
unsigned long fileLength;
void read(byte* &p)
{
file_name = (const char*)p;
p += strlen((const char*)p) + 1;
dir_index = LEB128(p);
lastModification = LEB128(p);
fileLength = LEB128(p);
}
};
struct DWARF_InfoData
{
byte* entryPtr;
int code;
byte* abbrev;
int tag;
int hasChild;
const char* name;
const char* linkage_name;
const char* dir;
unsigned long byte_size;
byte* sibling;
unsigned long encoding;
unsigned long pclo;
unsigned long pchi;
unsigned long ranges;
byte* type;
byte* containing_type;
byte* specification;
unsigned long inlined;
bool external;
DWARF_Attribute location;
DWARF_Attribute member_location;
DWARF_Attribute frame_base;
long upper_bound;
long lower_bound;
void clear()
{
entryPtr = 0;
code = 0;
abbrev = 0;
tag = 0;
hasChild = 0;
name = 0;
linkage_name = 0;
dir = 0;
byte_size = 0;
sibling = 0;
encoding = 0;
pclo = 0;
pchi = 0;
type = 0;
containing_type = 0;
specification = 0;
inlined = 0;
external = 0;
member_location.type = Invalid;
location.type = Invalid;
frame_base.type = Invalid;
upper_bound = 0;
lower_bound = 0;
}
};
static const int maximum_operations_per_instruction = 1;
struct DWARF_LineNumberProgramHeader
{
unsigned int unit_length; // 12 byte in DWARF-64
unsigned short version;
unsigned int header_length; // 8 byte in DWARF-64
byte minimum_instruction_length;
//byte maximum_operations_per_instruction; (// not in DWARF 2
byte default_is_stmt;
signed char line_base;
byte line_range;
byte opcode_base;
//LEB128 standard_opcode_lengths[opcode_base];
// string include_directories[] // zero byte terminated
// DWARF_FileNames file_names[] // zero byte terminated
};
struct DWARF_LineState
{
// hdr info
std::vector<const char*> include_dirs;
std::vector<DWARF_FileName> files;
unsigned long address;
unsigned int op_index;
unsigned int file;
unsigned int line;
unsigned int column;
bool is_stmt;
bool basic_block;
bool end_sequence;
bool prologue_end;
bool epilogue_end;
unsigned int isa;
unsigned int discriminator;
// not part of the "documented" state
DWARF_FileName* file_ptr;
unsigned long seg_offset;
unsigned long last_addr;
std::vector<mspdb::LineInfoEntry> lineInfo;
DWARF_LineState()
{
seg_offset = 0x400000;
init(0);
}
void init(DWARF_LineNumberProgramHeader* hdr)
{
address = 0;
op_index = 0;
file = 1;
line = 1;
column = 0;
is_stmt = hdr && hdr->default_is_stmt != 0;
basic_block = false;
end_sequence = false;
prologue_end = false;
epilogue_end = false;
isa = 0;
discriminator = 0;
}
void advance_addr(DWARF_LineNumberProgramHeader* hdr, int operation_advance)
{
int address_advance = hdr->minimum_instruction_length * ((op_index + operation_advance) / maximum_operations_per_instruction);
address += address_advance;
op_index = (op_index + operation_advance) % maximum_operations_per_instruction;
}
void addLineInfo()
{
#if 0
const char* fname = (file == 0 ? file_ptr->file_name : files[file - 1].file_name);
printf("Adr:%08x Line: %5d File: %s\n", address, line, fname);
#endif
if (address < seg_offset)
return;
mspdb::LineInfoEntry entry;
entry.offset = address - seg_offset;
entry.line = line;
lineInfo.push_back(entry);
}
};
#include "poppack.h"
///////////////////////////////////////////////////////////////////////////////
// The actual value is {reg} + offset
struct Location
{
int reg;
int offset;
};
const int NoReg = -1;
bool decodeLocation(byte* loc, long len, Location& result, Location* frameBase = 0);
long decodeLocation(byte* loc, long len, bool push0, int &id, int& size);
inline long decodeLocation(byte*loc, long len, bool push0, int &id)
{
int size;
return decodeLocation(loc, len, push0, id, size);
}
class PEImage;
// Debug Information Entry Cursor
class DIECursor
{
public:
DWARF_CompilationUnit* cu;
byte* ptr;
int level;
bool hasChild; // indicates whether the last read DIE has children
byte* sibling;
byte* getDWARFAbbrev(unsigned off, unsigned findcode);
public:
static void setContext(PEImage* img_);
// Create a new DIECursor
DIECursor(DWARF_CompilationUnit* cu_, byte* ptr);
// Reads next sibling DIE. If the last read DIE had any children, they will be skipped over.
// Returns 'false' upon reaching the last sibling on the current level.
bool readSibling(DWARF_InfoData& id);
// Returns cursor that will enumerate children of the last read DIE.
DIECursor getSubtreeCursor();
// Reads the next DIE in physical order, returns 'true' if succeeds.
// If stopAtNull is true, readNext() will stop upon reaching a null DIE (end of the current tree level).
// Otherwise, it will skip null DIEs and stop only at the end of the subtree for which this DIECursor was created.
bool readNext(DWARF_InfoData& id, bool stopAtNull = false);
};
#endif
|