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
|
/*-
* Copyright (c) 2007 John Birrell (jb@freebsd.org)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $FreeBSD$
*/
#include <stdlib.h>
#include "_libdwarf.h"
static const char *anon_name = "__anon__";
int
dwarf_die_add(Dwarf_CU cu, int level, uint64_t offset, uint64_t abnum, Dwarf_Abbrev a, Dwarf_Die *diep, Dwarf_Error *err)
{
Dwarf_Die die;
uint64_t key;
int ret = DWARF_E_NONE;
if (err == NULL)
return DWARF_E_ERROR;
if (cu == NULL || a == NULL) {
DWARF_SET_ERROR(err, DWARF_E_ARGUMENT);
return DWARF_E_ARGUMENT;
}
if ((die = malloc(sizeof(struct _Dwarf_Die))) == NULL) {
DWARF_SET_ERROR(err, DWARF_E_MEMORY);
return DWARF_E_MEMORY;
}
/* Initialise the abbrev structure. */
die->die_level = level;
die->die_offset = offset;
die->die_abnum = abnum;
die->die_a = a;
die->die_cu = cu;
die->die_name = anon_name;
/* Initialise the list of attribute values. */
STAILQ_INIT(&die->die_attrval);
/* Add the die to the list in the compilation unit. */
STAILQ_INSERT_TAIL(&cu->cu_die, die, die_next);
/* Add the die to the hash table in the compilation unit. */
key = offset % DWARF_DIE_HASH_SIZE;
STAILQ_INSERT_TAIL(&cu->cu_die_hash[key], die, die_hash);
if (diep != NULL)
*diep = die;
return ret;
}
int
dwarf_dieoffset(Dwarf_Die die, Dwarf_Off *ret_offset, Dwarf_Error *err __unused)
{
*ret_offset = die->die_offset;
return DWARF_E_NONE;
}
int
dwarf_child(Dwarf_Die die, Dwarf_Die *ret_die, Dwarf_Error *err)
{
Dwarf_Die next;
int ret = DWARF_E_NONE;
if (err == NULL)
return DWARF_E_ERROR;
if (die == NULL || ret_die == NULL) {
DWARF_SET_ERROR(err, DWARF_E_ARGUMENT);
return DWARF_E_ARGUMENT;
}
if ((next = STAILQ_NEXT(die, die_next)) == NULL ||
next->die_level != die->die_level + 1) {
*ret_die = NULL;
DWARF_SET_ERROR(err, DWARF_E_NO_ENTRY);
ret = DWARF_E_NO_ENTRY;
} else
*ret_die = next;
return ret;
}
int
dwarf_tag(Dwarf_Die die, Dwarf_Half *tag, Dwarf_Error *err)
{
Dwarf_Abbrev a;
if (err == NULL)
return DWARF_E_ERROR;
if (die == NULL || tag == NULL || (a = die->die_a) == NULL) {
DWARF_SET_ERROR(err, DWARF_E_ARGUMENT);
return DWARF_E_ARGUMENT;
}
*tag = a->a_tag;
return DWARF_E_NONE;
}
int
dwarf_siblingof(Dwarf_Debug dbg, Dwarf_Die die, Dwarf_Die *caller_ret_die, Dwarf_Error *err)
{
Dwarf_Die next;
Dwarf_CU cu;
int ret = DWARF_E_NONE;
if (err == NULL)
return DWARF_E_ERROR;
if (dbg == NULL || caller_ret_die == NULL) {
DWARF_SET_ERROR(err, DWARF_E_ARGUMENT);
return DWARF_E_ARGUMENT;
}
if ((cu = dbg->dbg_cu_current) == NULL) {
DWARF_SET_ERROR(err, DWARF_E_CU_CURRENT);
return DWARF_E_CU_CURRENT;
}
if (die == NULL) {
*caller_ret_die = STAILQ_FIRST(&cu->cu_die);
if (*caller_ret_die == NULL) {
DWARF_SET_ERROR(err, DWARF_E_NO_ENTRY);
ret = DWARF_E_NO_ENTRY;
}
} else {
next = die;
while ((next = STAILQ_NEXT(next, die_next)) != NULL) {
if (next->die_level < die->die_level) {
next = NULL;
break;
}
if (next->die_level == die->die_level) {
*caller_ret_die = next;
break;
}
}
if (next == NULL) {
*caller_ret_die = NULL;
DWARF_SET_ERROR(err, DWARF_E_NO_ENTRY);
ret = DWARF_E_NO_ENTRY;
}
}
return ret;
}
Dwarf_Die
dwarf_die_find(Dwarf_Die die, Dwarf_Unsigned off)
{
Dwarf_CU cu = die->die_cu;
Dwarf_Die die1;
STAILQ_FOREACH(die1, &cu->cu_die, die_next) {
if (die1->die_offset == off)
return (die1);
}
return (NULL);
}
|
