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
|
/*
Copyright (C) 2000-2006 Silicon Graphics, Inc. All Rights Reserved.
Portions Copyright 2007-2010 Sun Microsystems, Inc. All rights reserved.
Portions Copyright 2009-2010 SN Systems Ltd. All rights reserved.
Portions Copyright 2008-2010 David Anderson. All rights reserved.
This program is free software; you can redistribute it and/or modify it
under the terms of version 2 of the GNU General Public License as
published by the Free Software Foundation.
This program is distributed in the hope that it would be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
Further, this software is distributed without any warranty that it is
free of the rightful claim of any third person regarding infringement
or the like. Any license provided herein, whether implied or
otherwise, applies only to this software file. Patent licenses, if
any, provided herein do not apply to combinations of this program with
other software, or any other product whatsoever.
You should have received a copy of the GNU General Public License along
with this program; if not, write the Free Software Foundation, Inc., 51
Franklin Street - Fifth Floor, Boston MA 02110-1301, USA.
Contact information: Silicon Graphics, Inc., 1500 Crittenden Lane,
Mountain View, CA 94043, or:
http://www.sgi.com
For further information regarding this notice, see:
http://oss.sgi.com/projects/GenInfo/NoticeExplan
$Header: /plroot/cmplrs.src/v7.4.5m/.RCS/PL/dwarfdump/RCS/print_sections.c,v 1.69 2006/04/17 00:09:56 davea Exp $ */
/* The address of the Free Software Foundation is
Free Software Foundation, Inc., 51 Franklin St, Fifth Floor,
Boston, MA 02110-1301, USA.
SGI has moved from the Crittenden Lane address.
*/
// Contains functions that support printing.
// Actual section-print code is in other print_*.cc files.
#include "globals.h"
#include <vector>
#include "naming.h"
#include "dwconf.h"
#include "print_frames.h"
#include "print_sections.h"
using std::string;
using std::cout;
using std::cerr;
using std::endl;
bool dwarf_names_print_on_error = true;
/* If an offset is bad, libdwarf will notice it and
return an error.
If it does the error checking in
print_pubname_style_entry()
will be useless as we give up here on an error.
This intended for checking pubnames-style call return
values (for all the pubnames-style interfaces).
In at least one gigantic executable die_off turned out wrong.
*/
void
deal_with_name_offset_err(Dwarf_Debug dbg,
const string &err_loc,
const string &name,
Dwarf_Unsigned die_off,
int nres, Dwarf_Error err)
{
if (nres == DW_DLV_ERROR) {
Dwarf_Unsigned myerr = dwarf_errno(err);
if (myerr == DW_DLE_OFFSET_BAD) {
cout << "Error: bad offset ";
cout << err_loc;
cout << " ";
cout << name;
cout << die_off;
cout << " (";
cout << IToHex0N(die_off,10);
cout << ")" << endl;
}
print_error(dbg, err_loc, nres, err);
}
}
/* The new (April 2005) dwarf_get_section_max_offsets()
in libdwarf returns all max-offsets, but we only
want one of those offsets. This function returns
the one we want from that set,
making functions needing this offset as readable as possible.
(avoiding code duplication).
*/
Dwarf_Unsigned
get_info_max_offset(Dwarf_Debug dbg)
{
Dwarf_Unsigned debug_info_size = 0;
Dwarf_Unsigned debug_abbrev_size = 0;
Dwarf_Unsigned debug_line_size = 0;
Dwarf_Unsigned debug_loc_size = 0;
Dwarf_Unsigned debug_aranges_size = 0;
Dwarf_Unsigned debug_macinfo_size = 0;
Dwarf_Unsigned debug_pubnames_size = 0;
Dwarf_Unsigned debug_str_size = 0;
Dwarf_Unsigned debug_frame_size = 0;
Dwarf_Unsigned debug_ranges_size = 0;
Dwarf_Unsigned debug_pubtypes_size = 0;
dwarf_get_section_max_offsets(dbg,
&debug_info_size,
&debug_abbrev_size,
&debug_line_size,
&debug_loc_size,
&debug_aranges_size,
&debug_macinfo_size,
&debug_pubnames_size,
&debug_str_size,
&debug_frame_size,
&debug_ranges_size,
&debug_pubtypes_size);
return debug_info_size;
}
/*
decode ULEB
*/
Dwarf_Unsigned
local_dwarf_decode_u_leb128(unsigned char *leb128,
unsigned int *leb128_length)
{
unsigned char byte = 0;
Dwarf_Unsigned number = 0;
unsigned int shift = 0;
unsigned int byte_length = 1;
byte = *leb128;
for (;;) {
number |= (byte & 0x7f) << shift;
shift += 7;
if ((byte & 0x80) == 0) {
if (leb128_length != NULL)
*leb128_length = byte_length;
return (number);
}
byte_length++;
byte = *(++leb128);
}
}
#define BITSINBYTE 8
Dwarf_Signed
local_dwarf_decode_s_leb128(unsigned char *leb128,
unsigned int *leb128_length)
{
Dwarf_Signed number = 0;
Dwarf_Bool sign = 0;
Dwarf_Signed shift = 0;
unsigned char byte = *leb128;
Dwarf_Signed byte_length = 1;
/* byte_length being the number of bytes of data absorbed so far in
turning the leb into a Dwarf_Signed. */
for (;;) {
sign = byte & 0x40;
number |= ((Dwarf_Signed) ((byte & 0x7f))) << shift;
shift += 7;
if ((byte & 0x80) == 0) {
break;
}
++leb128;
byte = *leb128;
byte_length++;
}
if ((shift < sizeof(Dwarf_Signed) * BITSINBYTE) && sign) {
number |= -((Dwarf_Signed) 1 << shift);
}
if (leb128_length != NULL)
*leb128_length = byte_length;
return (number);
}
/* Dumping a dwarf-expression as a byte stream. */
void
dump_block(const string &prefix, char *data, Dwarf_Signed len)
{
char *end_data = data + len;
char *cur = data;
int i = 0;
cout << prefix;
for (; cur < end_data; ++cur, ++i) {
if (i > 0 && i % 4 == 0){
cout << " ";
}
cout << IToHex02(*cur);
}
}
|
