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
|
/* Copyright (C) 1998, 1999, 2000, 2001, 2002, 2004, 2005 Red Hat, Inc.
This file is part of Red Hat elfutils.
Written by Ulrich Drepper <drepper@redhat.com>, 1998.
Red Hat elfutils is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by the
Free Software Foundation; version 2 of the License.
Red Hat elfutils is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License along
with Red Hat elfutils; if not, write to the Free Software Foundation,
Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
Red Hat elfutils is an included package of the Open Invention Network.
An included package of the Open Invention Network is a package for which
Open Invention Network licensees cross-license their patents. No patent
license is granted, either expressly or impliedly, by designation as an
included package. Should you wish to participate in the Open Invention
Network licensing program, please visit www.openinventionnetwork.com
<http://www.openinventionnetwork.com>. */
#include <config.h>
#include <fcntl.h>
#include <inttypes.h>
#include ELFUTILS_HEADER(dw)
#include <stdio.h>
#include <unistd.h>
int
main (int argc, char *argv[])
{
int cnt;
for (cnt = 1; cnt < argc; ++cnt)
{
int fd = open (argv[cnt], O_RDONLY);
Dwarf *dbg = dwarf_begin (fd, DWARF_C_READ);
if (dbg == NULL)
{
printf ("%s not usable: %s\n", argv[cnt], dwarf_errmsg (-1));
close (fd);
continue;
}
Dwarf_Off cuoff = 0;
Dwarf_Off old_cuoff = 0;
size_t hsize;
while (dwarf_nextcu (dbg, cuoff, &cuoff, &hsize, NULL, NULL, NULL) == 0)
{
/* Get the DIE for the CU. */
Dwarf_Die die;
if (dwarf_offdie (dbg, old_cuoff + hsize, &die) == NULL)
/* Something went wrong. */
break;
Dwarf_Off offset = 0;
while (1)
{
size_t length;
Dwarf_Abbrev *abbrev = dwarf_getabbrev (&die, offset, &length);
if (abbrev == NULL || abbrev == DWARF_END_ABBREV)
/* End of the list. */
break;
unsigned tag = dwarf_getabbrevtag (abbrev);
if (tag == 0)
{
printf ("dwarf_getabbrevtag at offset %llu returned error: %s\n",
(unsigned long long int) offset,
dwarf_errmsg (-1));
break;
}
unsigned code = dwarf_getabbrevcode (abbrev);
if (code == 0)
{
printf ("dwarf_getabbrevcode at offset %llu returned error: %s\n",
(unsigned long long int) offset,
dwarf_errmsg (-1));
break;
}
int children = dwarf_abbrevhaschildren (abbrev);
if (children < 0)
{
printf ("dwarf_abbrevhaschildren at offset %llu returned error: %s\n",
(unsigned long long int) offset,
dwarf_errmsg (-1));
break;
}
printf ("abbrev[%llu]: code = %u, tag = %u, children = %d\n",
(unsigned long long int) offset, code, tag, children);
size_t attrcnt;
if (dwarf_getattrcnt (abbrev, &attrcnt) != 0)
{
printf ("dwarf_getattrcnt at offset %llu returned error: %s\n",
(unsigned long long int) offset,
dwarf_errmsg (-1));
break;
}
unsigned int attr_num;
unsigned int attr_form;
Dwarf_Off aboffset;
size_t j;
for (j = 0; j < attrcnt; ++j)
if (dwarf_getabbrevattr (abbrev, j, &attr_num, &attr_form,
&aboffset))
printf ("dwarf_getabbrevattr for abbrev[%llu] and index %zu failed\n",
(unsigned long long int) offset, j);
else
printf ("abbrev[%llu]: attr[%zu]: code = %u, form = %u, offset = %" PRIu64 "\n",
(unsigned long long int) offset, j, attr_num,
attr_form, (uint64_t) aboffset);
offset += length;
}
old_cuoff = cuoff;
}
if (dwarf_end (dbg) != 0)
printf ("dwarf_end failed for %s: %s\n", argv[cnt],
dwarf_errmsg (-1));
close (fd);
}
return 0;
}
|
