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
|
/* Return vhild of current DIE.
Copyright (C) 2003, 2004, 2005 Red Hat, Inc.
Written by Ulrich Drepper <drepper@redhat.com>, 2003.
This program is Open Source software; you can redistribute it and/or
modify it under the terms of the Open Software License version 1.0 as
published by the Open Source Initiative.
You should have received a copy of the Open Software License along
with this program; if not, you may obtain a copy of the Open Software
License version 1.0 from http://www.opensource.org/licenses/osl.php or
by writing the Open Source Initiative c/o Lawrence Rosen, Esq.,
3001 King Ranch Road, Ukiah, CA 95482. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include "libdwP.h"
#include <string.h>
/* Some arbitrary value not conflicting with any existing code. */
#define INVALID 0xffffe444
unsigned char *
internal_function_def
__libdw_find_attr (Dwarf_Die *die, unsigned int search_name,
unsigned int *codep, unsigned int *formp)
{
Dwarf *dbg = die->cu->dbg;
const unsigned char *readp = (unsigned char *) die->addr;
/* First we have to get the abbreviation code so that we can decode
the data in the DIE. */
unsigned int abbrev_code;
get_uleb128 (abbrev_code, readp);
/* Find the abbreviation entry. */
Dwarf_Abbrev *abbrevp = die->abbrev;
if (abbrevp == NULL)
{
abbrevp = __libdw_findabbrev (die->cu, abbrev_code);
die->abbrev = abbrevp ?: (Dwarf_Abbrev *) -1l;
}
if (unlikely (die->abbrev == (Dwarf_Abbrev *) -1l))
{
__libdw_seterrno (DWARF_E_INVALID_DWARF);
return NULL;
}
/* Search the name attribute. */
unsigned char *const endp
= ((unsigned char *) dbg->sectiondata[IDX_debug_abbrev]->d_buf
+ dbg->sectiondata[IDX_debug_abbrev]->d_size);
const unsigned char *attrp = die->abbrev->attrp;
while (1)
{
/* Are we still in bounds? This test needs to be refined. */
if (unlikely (attrp + 1 >= endp))
{
__libdw_seterrno (DWARF_E_INVALID_DWARF);
return NULL;
}
/* Get attribute name and form.
XXX We don't check whether this reads beyond the end of the
section. */
unsigned int attr_name;
get_uleb128 (attr_name, attrp);
unsigned int attr_form;
get_uleb128 (attr_form, attrp);
/* We can stop if we found the attribute with value zero. */
if (attr_name == 0 && attr_form == 0)
break;
/* Is this the name attribute? */
if (attr_name == search_name && search_name != INVALID)
{
if (codep != NULL)
*codep = attr_name;
if (formp != NULL)
*formp = attr_form;
return (unsigned char *) readp;
}
/* Skip over the rest of this attribute (if there is any). */
if (attr_form != 0)
{
size_t len = __libdw_form_val_len (dbg, die->cu, attr_form, readp);
if (unlikely (len == (size_t) -1l))
{
readp = NULL;
break;
}
// XXX We need better boundary checks.
readp += len;
}
}
// XXX Do we need other values?
if (codep != NULL)
*codep = INVALID;
if (formp != NULL)
*formp = INVALID;
return (unsigned char *) readp;
}
int
dwarf_child (die, result)
Dwarf_Die *die;
Dwarf_Die *result;
{
/* Ignore previous errors. */
if (die == NULL)
return -1;
/* Skip past the last attribute. */
void *addr = NULL;
/* If we already know there are no children do not search. */
if (die->abbrev != (Dwarf_Abbrev *) -1
&& (die->abbrev == NULL || die->abbrev->has_children))
addr = __libdw_find_attr (die, INVALID, NULL, NULL);
if (die->abbrev == (Dwarf_Abbrev *) -1l)
return -1;
/* Make sure the DIE really has children. */
if (! die->abbrev->has_children)
/* There cannot be any children. */
return 1;
if (addr == NULL)
return -1;
/* RESULT can be the same as DIE. So preserve what we need. */
struct Dwarf_CU *cu = die->cu;
/* Clear the entire DIE structure. This signals we have not yet
determined any of the information. */
memset (result, '\0', sizeof (Dwarf_Die));
/* We have the address. */
result->addr = addr;
/* Same CU as the parent. */
result->cu = cu;
return 0;
}
INTDEF(dwarf_child)
|
