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
|
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include "libdwP.h"
#include <dwarf.h>
enum die_class { ignore, match, match_inline, walk, imported };
static enum die_class
classify_die (Dwarf_Die *die)
{
switch (INTUSE(dwarf_tag) (die))
{
/* DIEs with addresses we can try to match. */
case DW_TAG_compile_unit:
case DW_TAG_module:
case DW_TAG_lexical_block:
case DW_TAG_with_stmt:
case DW_TAG_catch_block:
case DW_TAG_try_block:
case DW_TAG_entry_point:
return match;
case DW_TAG_inlined_subroutine:
return match_inline;
case DW_TAG_subprogram:
/* This might be a concrete out-of-line instance of an inline, in
which case it is not guaranteed to be owned by the right scope and
we will search for its origin as for DW_TAG_inlined_subroutine. */
return (INTUSE(dwarf_hasattr) (die, DW_AT_abstract_origin)
? match_inline : match);
/* DIEs without addresses that can own DIEs with addresses. */
case DW_TAG_namespace:
return walk;
/* Special indirection required. */
case DW_TAG_imported_unit:
return imported;
/* Other DIEs we have no reason to descend. */
default:
break;
}
return ignore;
}
int
__libdw_visit_scopes (depth, root, previsit, postvisit, arg)
unsigned int depth;
struct Dwarf_Die_Chain *root;
int (*previsit) (unsigned int depth, struct Dwarf_Die_Chain *, void *);
int (*postvisit) (unsigned int depth, struct Dwarf_Die_Chain *, void *);
void *arg;
{
struct Dwarf_Die_Chain child;
child.parent = root;
if (INTUSE(dwarf_child) (&root->die, &child.die) != 0)
return -1;
inline int recurse (void)
{
return __libdw_visit_scopes (depth + 1, &child,
previsit, postvisit, arg);
}
do
{
child.prune = false;
if (previsit != NULL)
{
int result = (*previsit) (depth + 1, &child, arg);
if (result != DWARF_CB_OK)
return result;
}
if (!child.prune)
switch (classify_die (&child.die))
{
case match:
case match_inline:
case walk:
if (INTUSE(dwarf_haschildren) (&child.die))
{
int result = recurse ();
if (result != DWARF_CB_OK)
return result;
}
break;
case imported:
{
/* This imports another compilation unit to appear
as part of this one, inside the current scope.
Recurse to search the referenced unit, but without
recording it as an inner scoping level. */
Dwarf_Attribute attr_mem;
Dwarf_Attribute *attr = INTUSE(dwarf_attr) (&child.die,
DW_AT_import,
&attr_mem);
if (INTUSE(dwarf_formref_die) (attr, &child.die) != NULL)
{
int result = recurse ();
if (result != DWARF_CB_OK)
return result;
}
}
break;
default:
break;
}
if (postvisit != NULL)
{
int result = (*postvisit) (depth + 1, &child, arg);
if (result != DWARF_CB_OK)
return result;
}
}
while (INTUSE(dwarf_siblingof) (&child.die, &child.die) == 0);
return 0;
}
|
