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
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
|
// SPDX-License-Identifier: GPL-2.0
/*
* Copyright (C) 2024 Google LLC
*/
#include <inttypes.h>
#include <stdarg.h>
#include "gendwarfksyms.h"
static bool do_linebreak;
static int indentation_level;
/* Line breaks and indentation for pretty-printing */
static void process_linebreak(struct die *cache, int n)
{
indentation_level += n;
do_linebreak = true;
die_map_add_linebreak(cache, n);
}
#define DEFINE_GET_ATTR(attr, type) \
static bool get_##attr##_attr(Dwarf_Die *die, unsigned int id, \
type *value) \
{ \
Dwarf_Attribute da; \
return dwarf_attr(die, id, &da) && \
!dwarf_form##attr(&da, value); \
}
DEFINE_GET_ATTR(udata, Dwarf_Word)
static bool get_ref_die_attr(Dwarf_Die *die, unsigned int id, Dwarf_Die *value)
{
Dwarf_Attribute da;
/* dwarf_formref_die returns a pointer instead of an error value. */
return dwarf_attr(die, id, &da) && dwarf_formref_die(&da, value);
}
#define DEFINE_GET_STRING_ATTR(attr) \
static const char *get_##attr##_attr(Dwarf_Die *die) \
{ \
Dwarf_Attribute da; \
if (dwarf_attr(die, DW_AT_##attr, &da)) \
return dwarf_formstring(&da); \
return NULL; \
}
DEFINE_GET_STRING_ATTR(name)
DEFINE_GET_STRING_ATTR(linkage_name)
static const char *get_symbol_name(Dwarf_Die *die)
{
const char *name;
/* rustc uses DW_AT_linkage_name for exported symbols */
name = get_linkage_name_attr(die);
if (!name)
name = get_name_attr(die);
return name;
}
static bool match_export_symbol(struct state *state, Dwarf_Die *die)
{
Dwarf_Die *source = die;
Dwarf_Die origin;
/* If the DIE has an abstract origin, use it for type information. */
if (get_ref_die_attr(die, DW_AT_abstract_origin, &origin))
source = &origin;
state->sym = symbol_get(get_symbol_name(die));
/* Look up using the origin name if there are no matches. */
if (!state->sym && source != die)
state->sym = symbol_get(get_symbol_name(source));
state->die = *source;
return !!state->sym;
}
/*
* Type string processing
*/
static void process(struct die *cache, const char *s)
{
s = s ?: "<null>";
if (dump_dies && do_linebreak) {
fputs("\n", stderr);
for (int i = 0; i < indentation_level; i++)
fputs(" ", stderr);
do_linebreak = false;
}
if (dump_dies)
fputs(s, stderr);
die_map_add_string(cache, s);
}
#define MAX_FMT_BUFFER_SIZE 128
static void process_fmt(struct die *cache, const char *fmt, ...)
{
char buf[MAX_FMT_BUFFER_SIZE];
va_list args;
va_start(args, fmt);
if (checkp(vsnprintf(buf, sizeof(buf), fmt, args)) >= sizeof(buf))
error("vsnprintf overflow: increase MAX_FMT_BUFFER_SIZE");
process(cache, buf);
va_end(args);
}
#define MAX_FQN_SIZE 64
/* Get a fully qualified name from DWARF scopes */
static char *get_fqn(Dwarf_Die *die)
{
const char *list[MAX_FQN_SIZE];
Dwarf_Die *scopes = NULL;
bool has_name = false;
char *fqn = NULL;
char *p;
int count = 0;
int len = 0;
int res;
int i;
res = checkp(dwarf_getscopes_die(die, &scopes));
if (!res) {
list[count] = get_name_attr(die);
if (!list[count])
return NULL;
len += strlen(list[count]);
count++;
goto done;
}
for (i = res - 1; i >= 0 && count < MAX_FQN_SIZE; i--) {
if (dwarf_tag(&scopes[i]) == DW_TAG_compile_unit)
continue;
list[count] = get_name_attr(&scopes[i]);
if (list[count]) {
has_name = true;
} else {
list[count] = "<anonymous>";
has_name = false;
}
len += strlen(list[count]);
count++;
if (i > 0) {
list[count++] = "::";
len += 2;
}
}
free(scopes);
if (count == MAX_FQN_SIZE)
warn("increase MAX_FQN_SIZE: reached the maximum");
/* Consider the DIE unnamed if the last scope doesn't have a name */
if (!has_name)
return NULL;
done:
fqn = xmalloc(len + 1);
*fqn = '\0';
p = fqn;
for (i = 0; i < count; i++)
p = stpcpy(p, list[i]);
return fqn;
}
static void update_fqn(struct die *cache, Dwarf_Die *die)
{
if (!cache->fqn)
cache->fqn = get_fqn(die) ?: "";
}
static void process_fqn(struct die *cache, Dwarf_Die *die)
{
update_fqn(cache, die);
if (*cache->fqn)
process(cache, " ");
process(cache, cache->fqn);
}
#define DEFINE_PROCESS_UDATA_ATTRIBUTE(attribute) \
static void process_##attribute##_attr(struct die *cache, \
Dwarf_Die *die) \
{ \
Dwarf_Word value; \
if (get_udata_attr(die, DW_AT_##attribute, &value)) \
process_fmt(cache, " " #attribute "(%" PRIu64 ")", \
value); \
}
DEFINE_PROCESS_UDATA_ATTRIBUTE(alignment)
DEFINE_PROCESS_UDATA_ATTRIBUTE(byte_size)
DEFINE_PROCESS_UDATA_ATTRIBUTE(encoding)
/* Match functions -- die_match_callback_t */
#define DEFINE_MATCH(type) \
static bool match_##type##_type(Dwarf_Die *die) \
{ \
return dwarf_tag(die) == DW_TAG_##type##_type; \
}
DEFINE_MATCH(formal_parameter)
bool match_all(Dwarf_Die *die)
{
return true;
}
int process_die_container(struct state *state, struct die *cache,
Dwarf_Die *die, die_callback_t func,
die_match_callback_t match)
{
Dwarf_Die current;
int res;
/* Track the first item in lists. */
if (state)
state->first_list_item = true;
res = checkp(dwarf_child(die, ¤t));
while (!res) {
if (match(¤t)) {
/* <0 = error, 0 = continue, >0 = stop */
res = checkp(func(state, cache, ¤t));
if (res)
goto out;
}
res = checkp(dwarf_siblingof(¤t, ¤t));
}
res = 0;
out:
if (state)
state->first_list_item = false;
return res;
}
static int process_type(struct state *state, struct die *parent,
Dwarf_Die *die);
static void process_type_attr(struct state *state, struct die *cache,
Dwarf_Die *die)
{
Dwarf_Die type;
if (get_ref_die_attr(die, DW_AT_type, &type)) {
check(process_type(state, cache, &type));
return;
}
/* Compilers can omit DW_AT_type -- print out 'void' to clarify */
process(cache, "base_type void");
}
static void process_list_comma(struct state *state, struct die *cache)
{
if (state->first_list_item) {
state->first_list_item = false;
} else {
process(cache, " ,");
process_linebreak(cache, 0);
}
}
/* Comma-separated with DW_AT_type */
static void __process_list_type(struct state *state, struct die *cache,
Dwarf_Die *die, const char *type)
{
const char *name = get_name_attr(die);
process_list_comma(state, cache);
process(cache, type);
process_type_attr(state, cache, die);
if (name) {
process(cache, " ");
process(cache, name);
}
}
#define DEFINE_PROCESS_LIST_TYPE(type) \
static void process_##type##_type(struct state *state, \
struct die *cache, Dwarf_Die *die) \
{ \
__process_list_type(state, cache, die, #type " "); \
}
DEFINE_PROCESS_LIST_TYPE(formal_parameter)
/* Container types with DW_AT_type */
static void __process_type(struct state *state, struct die *cache,
Dwarf_Die *die, const char *type)
{
process(cache, type);
process_fqn(cache, die);
process(cache, " {");
process_linebreak(cache, 1);
process_type_attr(state, cache, die);
process_linebreak(cache, -1);
process(cache, "}");
process_byte_size_attr(cache, die);
process_alignment_attr(cache, die);
}
#define DEFINE_PROCESS_TYPE(type) \
static void process_##type##_type(struct state *state, \
struct die *cache, Dwarf_Die *die) \
{ \
__process_type(state, cache, die, #type "_type"); \
}
DEFINE_PROCESS_TYPE(atomic)
DEFINE_PROCESS_TYPE(const)
DEFINE_PROCESS_TYPE(immutable)
DEFINE_PROCESS_TYPE(packed)
DEFINE_PROCESS_TYPE(pointer)
DEFINE_PROCESS_TYPE(reference)
DEFINE_PROCESS_TYPE(restrict)
DEFINE_PROCESS_TYPE(rvalue_reference)
DEFINE_PROCESS_TYPE(shared)
DEFINE_PROCESS_TYPE(volatile)
DEFINE_PROCESS_TYPE(typedef)
static void __process_subroutine_type(struct state *state, struct die *cache,
Dwarf_Die *die, const char *type)
{
process(cache, type);
process(cache, " (");
process_linebreak(cache, 1);
/* Parameters */
check(process_die_container(state, cache, die, process_type,
match_formal_parameter_type));
process_linebreak(cache, -1);
process(cache, ")");
process_linebreak(cache, 0);
/* Return type */
process(cache, "-> ");
process_type_attr(state, cache, die);
}
static void process_subroutine_type(struct state *state, struct die *cache,
Dwarf_Die *die)
{
__process_subroutine_type(state, cache, die, "subroutine_type");
}
static void process_base_type(struct state *state, struct die *cache,
Dwarf_Die *die)
{
process(cache, "base_type");
process_fqn(cache, die);
process_byte_size_attr(cache, die);
process_encoding_attr(cache, die);
process_alignment_attr(cache, die);
}
static void process_cached(struct state *state, struct die *cache,
Dwarf_Die *die)
{
struct die_fragment *df;
Dwarf_Die child;
list_for_each_entry(df, &cache->fragments, list) {
switch (df->type) {
case FRAGMENT_STRING:
process(NULL, df->data.str);
break;
case FRAGMENT_LINEBREAK:
process_linebreak(NULL, df->data.linebreak);
break;
case FRAGMENT_DIE:
if (!dwarf_die_addr_die(dwarf_cu_getdwarf(die->cu),
(void *)df->data.addr, &child))
error("dwarf_die_addr_die failed");
check(process_type(state, NULL, &child));
break;
default:
error("empty die_fragment");
}
}
}
#define PROCESS_TYPE(type) \
case DW_TAG_##type##_type: \
process_##type##_type(state, cache, die); \
break;
static int process_type(struct state *state, struct die *parent, Dwarf_Die *die)
{
struct die *cache;
int tag = dwarf_tag(die);
/*
* If we have the DIE already cached, use it instead of walking
* through DWARF.
*/
cache = die_map_get(die, DIE_COMPLETE);
if (cache->state == DIE_COMPLETE) {
process_cached(state, cache, die);
die_map_add_die(parent, cache);
return 0;
}
switch (tag) {
/* Type modifiers */
PROCESS_TYPE(atomic)
PROCESS_TYPE(const)
PROCESS_TYPE(immutable)
PROCESS_TYPE(packed)
PROCESS_TYPE(pointer)
PROCESS_TYPE(reference)
PROCESS_TYPE(restrict)
PROCESS_TYPE(rvalue_reference)
PROCESS_TYPE(shared)
PROCESS_TYPE(volatile)
/* Subtypes */
PROCESS_TYPE(formal_parameter)
/* Other types */
PROCESS_TYPE(base)
PROCESS_TYPE(subroutine)
PROCESS_TYPE(typedef)
default:
debug("unimplemented type: %x", tag);
break;
}
/* Update cache state and append to the parent (if any) */
cache->tag = tag;
cache->state = DIE_COMPLETE;
die_map_add_die(parent, cache);
return 0;
}
/*
* Exported symbol processing
*/
static void process_symbol(struct state *state, Dwarf_Die *die,
die_callback_t process_func)
{
debug("%s", state->sym->name);
check(process_func(state, NULL, die));
if (dump_dies)
fputs("\n", stderr);
}
static int __process_subprogram(struct state *state, struct die *cache,
Dwarf_Die *die)
{
__process_subroutine_type(state, cache, die, "subprogram");
return 0;
}
static void process_subprogram(struct state *state, Dwarf_Die *die)
{
process_symbol(state, die, __process_subprogram);
}
static int __process_variable(struct state *state, struct die *cache,
Dwarf_Die *die)
{
process(cache, "variable ");
process_type_attr(state, cache, die);
return 0;
}
static void process_variable(struct state *state, Dwarf_Die *die)
{
process_symbol(state, die, __process_variable);
}
static int process_exported_symbols(struct state *unused, struct die *cache,
Dwarf_Die *die)
{
int tag = dwarf_tag(die);
switch (tag) {
/* Possible containers of exported symbols */
case DW_TAG_namespace:
case DW_TAG_class_type:
case DW_TAG_structure_type:
return check(process_die_container(
NULL, cache, die, process_exported_symbols, match_all));
/* Possible exported symbols */
case DW_TAG_subprogram:
case DW_TAG_variable: {
struct state state;
if (!match_export_symbol(&state, die))
return 0;
if (tag == DW_TAG_subprogram)
process_subprogram(&state, &state.die);
else
process_variable(&state, &state.die);
return 0;
}
default:
return 0;
}
}
void process_cu(Dwarf_Die *cudie)
{
check(process_die_container(NULL, NULL, cudie, process_exported_symbols,
match_all));
}
|