Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* DWARF 2 support. |
818a27ac | 2 | Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, |
be04437d | 3 | 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc. |
252b5132 RH |
4 | |
5 | Adapted from gdb/dwarf2read.c by Gavin Koch of Cygnus Solutions | |
6 | (gavin@cygnus.com). | |
7 | ||
8 | From the dwarf2read.c header: | |
9 | Adapted by Gary Funck (gary@intrepid.com), Intrepid Technology, | |
10 | Inc. with support from Florida State University (under contract | |
11 | with the Ada Joint Program Office), and Silicon Graphics, Inc. | |
12 | Initial contribution by Brent Benson, Harris Computer Systems, Inc., | |
13 | based on Fred Fish's (Cygnus Support) implementation of DWARF 1 | |
14 | support in dwarfread.c | |
15 | ||
e2f6d277 | 16 | This file is part of BFD. |
252b5132 | 17 | |
e2f6d277 NC |
18 | This program is free software; you can redistribute it and/or modify |
19 | it under the terms of the GNU General Public License as published by | |
cd123cb7 | 20 | the Free Software Foundation; either version 3 of the License, or (at |
e2f6d277 | 21 | your option) any later version. |
252b5132 | 22 | |
e2f6d277 NC |
23 | This program is distributed in the hope that it will be useful, but |
24 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
25 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
26 | General Public License for more details. | |
252b5132 | 27 | |
e2f6d277 NC |
28 | You should have received a copy of the GNU General Public License |
29 | along with this program; if not, write to the Free Software | |
cd123cb7 NC |
30 | Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, |
31 | MA 02110-1301, USA. */ | |
252b5132 | 32 | |
252b5132 | 33 | #include "sysdep.h" |
3db64b00 | 34 | #include "bfd.h" |
252b5132 RH |
35 | #include "libiberty.h" |
36 | #include "libbfd.h" | |
37 | #include "elf-bfd.h" | |
38 | #include "elf/dwarf2.h" | |
39 | ||
40 | /* The data in the .debug_line statement prologue looks like this. */ | |
a092b084 | 41 | |
252b5132 | 42 | struct line_head |
a092b084 | 43 | { |
d03ba2a1 | 44 | bfd_vma total_length; |
a092b084 | 45 | unsigned short version; |
f46c2da6 | 46 | bfd_vma prologue_length; |
a092b084 NC |
47 | unsigned char minimum_instruction_length; |
48 | unsigned char default_is_stmt; | |
49 | int line_base; | |
50 | unsigned char line_range; | |
51 | unsigned char opcode_base; | |
52 | unsigned char *standard_opcode_lengths; | |
53 | }; | |
54 | ||
55 | /* Attributes have a name and a value. */ | |
56 | ||
252b5132 | 57 | struct attribute |
a092b084 NC |
58 | { |
59 | enum dwarf_attribute name; | |
60 | enum dwarf_form form; | |
61 | union | |
252b5132 | 62 | { |
a092b084 NC |
63 | char *str; |
64 | struct dwarf_block *blk; | |
8ce8c090 AM |
65 | bfd_uint64_t val; |
66 | bfd_int64_t sval; | |
a092b084 NC |
67 | } |
68 | u; | |
69 | }; | |
70 | ||
98591c73 | 71 | /* Blocks are a bunch of untyped bytes. */ |
252b5132 | 72 | struct dwarf_block |
a092b084 NC |
73 | { |
74 | unsigned int size; | |
f075ee0c | 75 | bfd_byte *data; |
a092b084 | 76 | }; |
252b5132 | 77 | |
5609a71e | 78 | struct adjusted_section |
d4c32a81 L |
79 | { |
80 | asection *section; | |
81 | bfd_vma adj_vma; | |
82 | }; | |
83 | ||
a092b084 NC |
84 | struct dwarf2_debug |
85 | { | |
86 | /* A list of all previously read comp_units. */ | |
f075ee0c | 87 | struct comp_unit *all_comp_units; |
252b5132 | 88 | |
bd210d54 NC |
89 | /* Last comp unit in list above. */ |
90 | struct comp_unit *last_comp_unit; | |
91 | ||
252b5132 RH |
92 | /* The next unread compilation unit within the .debug_info section. |
93 | Zero indicates that the .debug_info section has not been loaded | |
a092b084 | 94 | into a buffer yet. */ |
f075ee0c | 95 | bfd_byte *info_ptr; |
252b5132 | 96 | |
a092b084 | 97 | /* Pointer to the end of the .debug_info section memory buffer. */ |
f075ee0c | 98 | bfd_byte *info_ptr_end; |
252b5132 | 99 | |
0d161102 NC |
100 | /* Pointer to the bfd, section and address of the beginning of the |
101 | section. The bfd might be different than expected because of | |
102 | gnu_debuglink sections. */ | |
103 | bfd * bfd; | |
f075ee0c AM |
104 | asection *sec; |
105 | bfd_byte *sec_info_ptr; | |
f2363ce5 | 106 | |
aaf30c25 CS |
107 | /* A pointer to the memory block allocated for info_ptr. Neither |
108 | info_ptr nor sec_info_ptr are guaranteed to stay pointing to the | |
109 | beginning of the malloc block. This is used only to free the | |
110 | memory later. */ | |
111 | bfd_byte *info_ptr_memory; | |
112 | ||
f2363ce5 | 113 | /* Pointer to the symbol table. */ |
f075ee0c | 114 | asymbol **syms; |
f2363ce5 | 115 | |
a092b084 | 116 | /* Pointer to the .debug_abbrev section loaded into memory. */ |
f075ee0c | 117 | bfd_byte *dwarf_abbrev_buffer; |
252b5132 | 118 | |
a092b084 | 119 | /* Length of the loaded .debug_abbrev section. */ |
3076cd1f | 120 | bfd_size_type dwarf_abbrev_size; |
69dd2e2d RH |
121 | |
122 | /* Buffer for decode_line_info. */ | |
f075ee0c | 123 | bfd_byte *dwarf_line_buffer; |
ccdb16fc JW |
124 | |
125 | /* Length of the loaded .debug_line section. */ | |
3076cd1f | 126 | bfd_size_type dwarf_line_size; |
d03ba2a1 JJ |
127 | |
128 | /* Pointer to the .debug_str section loaded into memory. */ | |
f075ee0c | 129 | bfd_byte *dwarf_str_buffer; |
d03ba2a1 JJ |
130 | |
131 | /* Length of the loaded .debug_str section. */ | |
3076cd1f | 132 | bfd_size_type dwarf_str_size; |
a13afe8e FF |
133 | |
134 | /* Pointer to the .debug_ranges section loaded into memory. */ | |
135 | bfd_byte *dwarf_ranges_buffer; | |
136 | ||
137 | /* Length of the loaded .debug_ranges section. */ | |
3076cd1f | 138 | bfd_size_type dwarf_ranges_size; |
4ab527b0 FF |
139 | |
140 | /* If the most recent call to bfd_find_nearest_line was given an | |
141 | address in an inlined function, preserve a pointer into the | |
142 | calling chain for subsequent calls to bfd_find_inliner_info to | |
143 | use. */ | |
144 | struct funcinfo *inliner_chain; | |
d4c32a81 | 145 | |
5609a71e DJ |
146 | /* Number of sections whose VMA we must adjust. */ |
147 | unsigned int adjusted_section_count; | |
d4c32a81 | 148 | |
5609a71e DJ |
149 | /* Array of sections with adjusted VMA. */ |
150 | struct adjusted_section *adjusted_sections; | |
bd210d54 NC |
151 | |
152 | /* Number of times find_line is called. This is used in | |
153 | the heuristic for enabling the info hash tables. */ | |
154 | int info_hash_count; | |
155 | ||
156 | #define STASH_INFO_HASH_TRIGGER 100 | |
157 | ||
158 | /* Hash table mapping symbol names to function infos. */ | |
159 | struct info_hash_table *funcinfo_hash_table; | |
160 | ||
161 | /* Hash table mapping symbol names to variable infos. */ | |
162 | struct info_hash_table *varinfo_hash_table; | |
163 | ||
164 | /* Head of comp_unit list in the last hash table update. */ | |
165 | struct comp_unit *hash_units_head; | |
166 | ||
167 | /* Status of info hash. */ | |
168 | int info_hash_status; | |
169 | #define STASH_INFO_HASH_OFF 0 | |
170 | #define STASH_INFO_HASH_ON 1 | |
171 | #define STASH_INFO_HASH_DISABLED 2 | |
252b5132 RH |
172 | }; |
173 | ||
a092b084 NC |
174 | struct arange |
175 | { | |
f623be2b RH |
176 | struct arange *next; |
177 | bfd_vma low; | |
178 | bfd_vma high; | |
179 | }; | |
252b5132 | 180 | |
252b5132 | 181 | /* A minimal decoding of DWARF2 compilation units. We only decode |
a092b084 | 182 | what's needed to get to the line number information. */ |
252b5132 | 183 | |
a092b084 NC |
184 | struct comp_unit |
185 | { | |
186 | /* Chain the previously read compilation units. */ | |
f075ee0c | 187 | struct comp_unit *next_unit; |
252b5132 | 188 | |
bd210d54 NC |
189 | /* Likewise, chain the compilation unit read after this one. |
190 | The comp units are stored in reversed reading order. */ | |
191 | struct comp_unit *prev_unit; | |
192 | ||
2ae727ad | 193 | /* Keep the bfd convenient (for memory allocation). */ |
f075ee0c | 194 | bfd *abfd; |
252b5132 | 195 | |
709d67f1 AM |
196 | /* The lowest and highest addresses contained in this compilation |
197 | unit as specified in the compilation unit header. */ | |
198 | struct arange arange; | |
252b5132 | 199 | |
a092b084 | 200 | /* The DW_AT_name attribute (for error messages). */ |
f075ee0c | 201 | char *name; |
252b5132 | 202 | |
a092b084 | 203 | /* The abbrev hash table. */ |
f075ee0c | 204 | struct abbrev_info **abbrevs; |
252b5132 | 205 | |
a092b084 | 206 | /* Note that an error was found by comp_unit_find_nearest_line. */ |
252b5132 RH |
207 | int error; |
208 | ||
a092b084 | 209 | /* The DW_AT_comp_dir attribute. */ |
f075ee0c | 210 | char *comp_dir; |
252b5132 | 211 | |
b34976b6 | 212 | /* TRUE if there is a line number table associated with this comp. unit. */ |
252b5132 | 213 | int stmtlist; |
98591c73 | 214 | |
c0c28ab8 L |
215 | /* Pointer to the current comp_unit so that we can find a given entry |
216 | by its reference. */ | |
f075ee0c | 217 | bfd_byte *info_ptr_unit; |
c0c28ab8 | 218 | |
a092b084 | 219 | /* The offset into .debug_line of the line number table. */ |
252b5132 RH |
220 | unsigned long line_offset; |
221 | ||
a092b084 | 222 | /* Pointer to the first child die for the comp unit. */ |
f075ee0c | 223 | bfd_byte *first_child_die_ptr; |
252b5132 | 224 | |
a092b084 | 225 | /* The end of the comp unit. */ |
f075ee0c | 226 | bfd_byte *end_ptr; |
252b5132 | 227 | |
a092b084 | 228 | /* The decoded line number, NULL if not yet decoded. */ |
f075ee0c | 229 | struct line_info_table *line_table; |
252b5132 | 230 | |
a092b084 | 231 | /* A list of the functions found in this comp. unit. */ |
f075ee0c | 232 | struct funcinfo *function_table; |
252b5132 | 233 | |
5420f73d L |
234 | /* A list of the variables found in this comp. unit. */ |
235 | struct varinfo *variable_table; | |
236 | ||
d03ba2a1 JJ |
237 | /* Pointer to dwarf2_debug structure. */ |
238 | struct dwarf2_debug *stash; | |
239 | ||
5609a71e DJ |
240 | /* DWARF format version for this unit - from unit header. */ |
241 | int version; | |
242 | ||
a092b084 | 243 | /* Address size for this unit - from unit header. */ |
252b5132 | 244 | unsigned char addr_size; |
d03ba2a1 JJ |
245 | |
246 | /* Offset size for this unit - from unit header. */ | |
247 | unsigned char offset_size; | |
a13afe8e FF |
248 | |
249 | /* Base address for this unit - from DW_AT_low_pc attribute of | |
250 | DW_TAG_compile_unit DIE */ | |
251 | bfd_vma base_address; | |
bd210d54 NC |
252 | |
253 | /* TRUE if symbols are cached in hash table for faster lookup by name. */ | |
254 | bfd_boolean cached; | |
252b5132 RH |
255 | }; |
256 | ||
a7b97311 AM |
257 | /* This data structure holds the information of an abbrev. */ |
258 | struct abbrev_info | |
259 | { | |
260 | unsigned int number; /* Number identifying abbrev. */ | |
261 | enum dwarf_tag tag; /* DWARF tag. */ | |
262 | int has_children; /* Boolean. */ | |
263 | unsigned int num_attrs; /* Number of attributes. */ | |
264 | struct attr_abbrev *attrs; /* An array of attribute descriptions. */ | |
265 | struct abbrev_info *next; /* Next in chain. */ | |
266 | }; | |
267 | ||
268 | struct attr_abbrev | |
269 | { | |
270 | enum dwarf_attribute name; | |
271 | enum dwarf_form form; | |
272 | }; | |
273 | ||
274 | #ifndef ABBREV_HASH_SIZE | |
275 | #define ABBREV_HASH_SIZE 121 | |
276 | #endif | |
277 | #ifndef ATTR_ALLOC_CHUNK | |
278 | #define ATTR_ALLOC_CHUNK 4 | |
279 | #endif | |
280 | ||
bd210d54 NC |
281 | /* Variable and function hash tables. This is used to speed up look-up |
282 | in lookup_symbol_in_var_table() and lookup_symbol_in_function_table(). | |
283 | In order to share code between variable and function infos, we use | |
284 | a list of untyped pointer for all variable/function info associated with | |
285 | a symbol. We waste a bit of memory for list with one node but that | |
286 | simplifies the code. */ | |
287 | ||
288 | struct info_list_node | |
289 | { | |
290 | struct info_list_node *next; | |
291 | void *info; | |
292 | }; | |
293 | ||
294 | /* Info hash entry. */ | |
295 | struct info_hash_entry | |
296 | { | |
297 | struct bfd_hash_entry root; | |
298 | struct info_list_node *head; | |
299 | }; | |
300 | ||
301 | struct info_hash_table | |
302 | { | |
303 | struct bfd_hash_table base; | |
304 | }; | |
305 | ||
306 | /* Function to create a new entry in info hash table. */ | |
307 | ||
308 | static struct bfd_hash_entry * | |
309 | info_hash_table_newfunc (struct bfd_hash_entry *entry, | |
310 | struct bfd_hash_table *table, | |
311 | const char *string) | |
312 | { | |
313 | struct info_hash_entry *ret = (struct info_hash_entry *) entry; | |
314 | ||
315 | /* Allocate the structure if it has not already been allocated by a | |
316 | derived class. */ | |
317 | if (ret == NULL) | |
318 | { | |
319 | ret = bfd_hash_allocate (table, sizeof (* ret)); | |
320 | if (ret == NULL) | |
321 | return NULL; | |
322 | } | |
323 | ||
324 | /* Call the allocation method of the base class. */ | |
325 | ret = ((struct info_hash_entry *) | |
2d47a72c | 326 | bfd_hash_newfunc ((struct bfd_hash_entry *) ret, table, string)); |
bd210d54 NC |
327 | |
328 | /* Initialize the local fields here. */ | |
329 | if (ret) | |
330 | ret->head = NULL; | |
331 | ||
332 | return (struct bfd_hash_entry *) ret; | |
333 | } | |
334 | ||
335 | /* Function to create a new info hash table. It returns a pointer to the | |
336 | newly created table or NULL if there is any error. We need abfd | |
337 | solely for memory allocation. */ | |
338 | ||
339 | static struct info_hash_table * | |
340 | create_info_hash_table (bfd *abfd) | |
341 | { | |
342 | struct info_hash_table *hash_table; | |
343 | ||
344 | hash_table = bfd_alloc (abfd, sizeof (struct info_hash_table)); | |
345 | if (!hash_table) | |
346 | return hash_table; | |
347 | ||
348 | if (!bfd_hash_table_init (&hash_table->base, info_hash_table_newfunc, | |
349 | sizeof (struct info_hash_entry))) | |
350 | { | |
351 | bfd_release (abfd, hash_table); | |
352 | return NULL; | |
353 | } | |
354 | ||
355 | return hash_table; | |
356 | } | |
357 | ||
358 | /* Insert an info entry into an info hash table. We do not check of | |
359 | duplicate entries. Also, the caller need to guarantee that the | |
360 | right type of info in inserted as info is passed as a void* pointer. | |
361 | This function returns true if there is no error. */ | |
362 | ||
363 | static bfd_boolean | |
364 | insert_info_hash_table (struct info_hash_table *hash_table, | |
365 | const char *key, | |
366 | void *info, | |
367 | bfd_boolean copy_p) | |
368 | { | |
369 | struct info_hash_entry *entry; | |
370 | struct info_list_node *node; | |
371 | ||
372 | entry = (struct info_hash_entry*) bfd_hash_lookup (&hash_table->base, | |
373 | key, TRUE, copy_p); | |
374 | if (!entry) | |
375 | return FALSE; | |
376 | ||
377 | node = bfd_hash_allocate (&hash_table->base, sizeof (*node)); | |
378 | if (!node) | |
379 | return FALSE; | |
380 | ||
381 | node->info = info; | |
382 | node->next = entry->head; | |
383 | entry->head = node; | |
384 | ||
385 | return TRUE; | |
386 | } | |
387 | ||
388 | /* Look up an info entry list from an info hash table. Return NULL | |
389 | if there is none. */ | |
390 | ||
391 | static struct info_list_node * | |
392 | lookup_info_hash_table (struct info_hash_table *hash_table, const char *key) | |
393 | { | |
394 | struct info_hash_entry *entry; | |
395 | ||
396 | entry = (struct info_hash_entry*) bfd_hash_lookup (&hash_table->base, key, | |
397 | FALSE, FALSE); | |
398 | return entry ? entry->head : NULL; | |
399 | } | |
400 | ||
1b315056 | 401 | /* Read a section into its appropriate place in the dwarf2_debug |
dc80fd5c | 402 | struct (indicated by SECTION_BUFFER and SECTION_SIZE). If SYMS is |
1b315056 | 403 | not NULL, use bfd_simple_get_relocated_section_contents to read the |
dc80fd5c NC |
404 | section contents, otherwise use bfd_get_section_contents. Fail if |
405 | the located section does not contain at least OFFSET bytes. */ | |
1b315056 CS |
406 | |
407 | static bfd_boolean | |
dc80fd5c NC |
408 | read_section (bfd * abfd, |
409 | const char * section_name, | |
410 | const char * compressed_section_name, | |
411 | asymbol ** syms, | |
412 | bfd_uint64_t offset, | |
413 | bfd_byte ** section_buffer, | |
414 | bfd_size_type * section_size) | |
1b315056 CS |
415 | { |
416 | asection *msec; | |
417 | bfd_boolean section_is_compressed = FALSE; | |
418 | ||
419 | /* read_section is a noop if the section has already been read. */ | |
420 | if (*section_buffer) | |
421 | return TRUE; | |
422 | ||
423 | msec = bfd_get_section_by_name (abfd, section_name); | |
424 | if (! msec && compressed_section_name) | |
425 | { | |
426 | msec = bfd_get_section_by_name (abfd, compressed_section_name); | |
427 | section_is_compressed = TRUE; | |
428 | } | |
429 | if (! msec) | |
430 | { | |
431 | (*_bfd_error_handler) (_("Dwarf Error: Can't find %s section."), section_name); | |
432 | bfd_set_error (bfd_error_bad_value); | |
433 | return FALSE; | |
434 | } | |
435 | ||
436 | if (syms) | |
437 | { | |
438 | *section_size = msec->size; | |
439 | *section_buffer | |
2d47a72c | 440 | = bfd_simple_get_relocated_section_contents (abfd, msec, NULL, syms); |
1b315056 | 441 | if (! *section_buffer) |
2d47a72c | 442 | return FALSE; |
1b315056 CS |
443 | } |
444 | else | |
445 | { | |
446 | *section_size = msec->rawsize ? msec->rawsize : msec->size; | |
447 | *section_buffer = bfd_malloc (*section_size); | |
448 | if (! *section_buffer) | |
2d47a72c | 449 | return FALSE; |
1b315056 | 450 | if (! bfd_get_section_contents (abfd, msec, *section_buffer, |
9e32b19f | 451 | 0, *section_size)) |
2d47a72c | 452 | return FALSE; |
1b315056 CS |
453 | } |
454 | ||
455 | if (section_is_compressed) | |
456 | { | |
457 | if (! bfd_uncompress_section_contents (section_buffer, section_size)) | |
2d47a72c DJ |
458 | { |
459 | (*_bfd_error_handler) (_("Dwarf Error: unable to decompress %s section."), compressed_section_name); | |
460 | bfd_set_error (bfd_error_bad_value); | |
461 | return FALSE; | |
462 | } | |
1b315056 CS |
463 | } |
464 | ||
465 | /* It is possible to get a bad value for the offset into the section | |
dc80fd5c | 466 | that the client wants. Validate it here to avoid trouble later. */ |
1b315056 CS |
467 | if (offset != 0 && offset >= *section_size) |
468 | { | |
469 | (*_bfd_error_handler) (_("Dwarf Error: Offset (%lu) greater than or equal to %s size (%lu)."), | |
dc80fd5c | 470 | (long) offset, section_name, *section_size); |
1b315056 CS |
471 | bfd_set_error (bfd_error_bad_value); |
472 | return FALSE; | |
473 | } | |
474 | ||
475 | return TRUE; | |
476 | } | |
477 | ||
98591c73 KH |
478 | /* VERBATIM |
479 | The following function up to the END VERBATIM mark are | |
a092b084 | 480 | copied directly from dwarf2read.c. */ |
252b5132 | 481 | |
a092b084 | 482 | /* Read dwarf information from a buffer. */ |
252b5132 RH |
483 | |
484 | static unsigned int | |
f075ee0c | 485 | read_1_byte (bfd *abfd ATTRIBUTE_UNUSED, bfd_byte *buf) |
252b5132 | 486 | { |
818a27ac | 487 | return bfd_get_8 (abfd, buf); |
252b5132 RH |
488 | } |
489 | ||
490 | static int | |
f075ee0c | 491 | read_1_signed_byte (bfd *abfd ATTRIBUTE_UNUSED, bfd_byte *buf) |
252b5132 | 492 | { |
818a27ac | 493 | return bfd_get_signed_8 (abfd, buf); |
252b5132 RH |
494 | } |
495 | ||
496 | static unsigned int | |
f075ee0c | 497 | read_2_bytes (bfd *abfd, bfd_byte *buf) |
252b5132 | 498 | { |
818a27ac | 499 | return bfd_get_16 (abfd, buf); |
252b5132 RH |
500 | } |
501 | ||
252b5132 | 502 | static unsigned int |
f075ee0c | 503 | read_4_bytes (bfd *abfd, bfd_byte *buf) |
252b5132 | 504 | { |
818a27ac | 505 | return bfd_get_32 (abfd, buf); |
252b5132 RH |
506 | } |
507 | ||
8ce8c090 | 508 | static bfd_uint64_t |
f075ee0c | 509 | read_8_bytes (bfd *abfd, bfd_byte *buf) |
252b5132 | 510 | { |
818a27ac | 511 | return bfd_get_64 (abfd, buf); |
252b5132 RH |
512 | } |
513 | ||
f075ee0c | 514 | static bfd_byte * |
818a27ac | 515 | read_n_bytes (bfd *abfd ATTRIBUTE_UNUSED, |
f075ee0c | 516 | bfd_byte *buf, |
818a27ac | 517 | unsigned int size ATTRIBUTE_UNUSED) |
252b5132 | 518 | { |
252b5132 RH |
519 | return buf; |
520 | } | |
521 | ||
522 | static char * | |
818a27ac | 523 | read_string (bfd *abfd ATTRIBUTE_UNUSED, |
f075ee0c | 524 | bfd_byte *buf, |
818a27ac | 525 | unsigned int *bytes_read_ptr) |
252b5132 | 526 | { |
d03ba2a1 | 527 | /* Return a pointer to the embedded string. */ |
f075ee0c | 528 | char *str = (char *) buf; |
dc80fd5c | 529 | |
f075ee0c | 530 | if (*str == '\0') |
252b5132 RH |
531 | { |
532 | *bytes_read_ptr = 1; | |
533 | return NULL; | |
534 | } | |
98591c73 | 535 | |
f075ee0c AM |
536 | *bytes_read_ptr = strlen (str) + 1; |
537 | return str; | |
252b5132 RH |
538 | } |
539 | ||
dc80fd5c NC |
540 | /* END VERBATIM */ |
541 | ||
d03ba2a1 | 542 | static char * |
dc80fd5c NC |
543 | read_indirect_string (struct comp_unit * unit, |
544 | bfd_byte * buf, | |
545 | unsigned int * bytes_read_ptr) | |
d03ba2a1 | 546 | { |
8ce8c090 | 547 | bfd_uint64_t offset; |
d03ba2a1 | 548 | struct dwarf2_debug *stash = unit->stash; |
f075ee0c | 549 | char *str; |
d03ba2a1 JJ |
550 | |
551 | if (unit->offset_size == 4) | |
552 | offset = read_4_bytes (unit->abfd, buf); | |
553 | else | |
554 | offset = read_8_bytes (unit->abfd, buf); | |
dc80fd5c | 555 | |
d03ba2a1 JJ |
556 | *bytes_read_ptr = unit->offset_size; |
557 | ||
1b315056 | 558 | if (! read_section (unit->abfd, ".debug_str", ".zdebug_str", |
dc80fd5c | 559 | stash->syms, offset, |
9e32b19f | 560 | &stash->dwarf_str_buffer, &stash->dwarf_str_size)) |
dc80fd5c | 561 | return NULL; |
d03ba2a1 | 562 | |
f075ee0c AM |
563 | str = (char *) stash->dwarf_str_buffer + offset; |
564 | if (*str == '\0') | |
d03ba2a1 | 565 | return NULL; |
f075ee0c | 566 | return str; |
d03ba2a1 JJ |
567 | } |
568 | ||
8ce8c090 | 569 | static bfd_uint64_t |
f075ee0c | 570 | read_address (struct comp_unit *unit, bfd_byte *buf) |
252b5132 | 571 | { |
0af4cd7c PK |
572 | int signed_vma = get_elf_backend_data (unit->abfd)->sign_extend_vma; |
573 | ||
574 | if (signed_vma) | |
575 | { | |
576 | switch (unit->addr_size) | |
577 | { | |
578 | case 8: | |
579 | return bfd_get_signed_64 (unit->abfd, buf); | |
580 | case 4: | |
581 | return bfd_get_signed_32 (unit->abfd, buf); | |
582 | case 2: | |
583 | return bfd_get_signed_16 (unit->abfd, buf); | |
584 | default: | |
585 | abort (); | |
586 | } | |
587 | } | |
588 | else | |
252b5132 | 589 | { |
0af4cd7c PK |
590 | switch (unit->addr_size) |
591 | { | |
592 | case 8: | |
593 | return bfd_get_64 (unit->abfd, buf); | |
594 | case 4: | |
595 | return bfd_get_32 (unit->abfd, buf); | |
596 | case 2: | |
597 | return bfd_get_16 (unit->abfd, buf); | |
598 | default: | |
599 | abort (); | |
600 | } | |
252b5132 | 601 | } |
252b5132 RH |
602 | } |
603 | ||
252b5132 RH |
604 | /* Lookup an abbrev_info structure in the abbrev hash table. */ |
605 | ||
606 | static struct abbrev_info * | |
818a27ac | 607 | lookup_abbrev (unsigned int number, struct abbrev_info **abbrevs) |
252b5132 RH |
608 | { |
609 | unsigned int hash_number; | |
610 | struct abbrev_info *abbrev; | |
611 | ||
612 | hash_number = number % ABBREV_HASH_SIZE; | |
613 | abbrev = abbrevs[hash_number]; | |
614 | ||
615 | while (abbrev) | |
616 | { | |
617 | if (abbrev->number == number) | |
618 | return abbrev; | |
619 | else | |
620 | abbrev = abbrev->next; | |
621 | } | |
98591c73 | 622 | |
252b5132 RH |
623 | return NULL; |
624 | } | |
625 | ||
626 | /* In DWARF version 2, the description of the debugging information is | |
627 | stored in a separate .debug_abbrev section. Before we read any | |
628 | dies from a section we read in all abbreviations and install them | |
629 | in a hash table. */ | |
630 | ||
631 | static struct abbrev_info** | |
8ce8c090 | 632 | read_abbrevs (bfd *abfd, bfd_uint64_t offset, struct dwarf2_debug *stash) |
252b5132 RH |
633 | { |
634 | struct abbrev_info **abbrevs; | |
f075ee0c | 635 | bfd_byte *abbrev_ptr; |
252b5132 RH |
636 | struct abbrev_info *cur_abbrev; |
637 | unsigned int abbrev_number, bytes_read, abbrev_name; | |
638 | unsigned int abbrev_form, hash_number; | |
dc810e39 | 639 | bfd_size_type amt; |
252b5132 | 640 | |
1b315056 | 641 | if (! read_section (abfd, ".debug_abbrev", ".zdebug_abbrev", |
9e32b19f DJ |
642 | stash->syms, offset, |
643 | &stash->dwarf_abbrev_buffer, &stash->dwarf_abbrev_size)) | |
1b315056 | 644 | return 0; |
252b5132 | 645 | |
dc810e39 | 646 | amt = sizeof (struct abbrev_info*) * ABBREV_HASH_SIZE; |
818a27ac | 647 | abbrevs = bfd_zalloc (abfd, amt); |
252b5132 RH |
648 | |
649 | abbrev_ptr = stash->dwarf_abbrev_buffer + offset; | |
650 | abbrev_number = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); | |
651 | abbrev_ptr += bytes_read; | |
652 | ||
a092b084 | 653 | /* Loop until we reach an abbrev number of 0. */ |
252b5132 RH |
654 | while (abbrev_number) |
655 | { | |
dc810e39 | 656 | amt = sizeof (struct abbrev_info); |
818a27ac | 657 | cur_abbrev = bfd_zalloc (abfd, amt); |
252b5132 | 658 | |
a092b084 | 659 | /* Read in abbrev header. */ |
252b5132 | 660 | cur_abbrev->number = abbrev_number; |
d45913a0 DA |
661 | cur_abbrev->tag = (enum dwarf_tag) |
662 | read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); | |
252b5132 RH |
663 | abbrev_ptr += bytes_read; |
664 | cur_abbrev->has_children = read_1_byte (abfd, abbrev_ptr); | |
665 | abbrev_ptr += 1; | |
666 | ||
a092b084 | 667 | /* Now read in declarations. */ |
252b5132 RH |
668 | abbrev_name = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); |
669 | abbrev_ptr += bytes_read; | |
670 | abbrev_form = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); | |
671 | abbrev_ptr += bytes_read; | |
98591c73 | 672 | |
252b5132 RH |
673 | while (abbrev_name) |
674 | { | |
675 | if ((cur_abbrev->num_attrs % ATTR_ALLOC_CHUNK) == 0) | |
676 | { | |
35330cce NC |
677 | struct attr_abbrev *tmp; |
678 | ||
dc810e39 AM |
679 | amt = cur_abbrev->num_attrs + ATTR_ALLOC_CHUNK; |
680 | amt *= sizeof (struct attr_abbrev); | |
35330cce NC |
681 | tmp = bfd_realloc (cur_abbrev->attrs, amt); |
682 | if (tmp == NULL) | |
d8d1c398 AM |
683 | { |
684 | size_t i; | |
685 | ||
686 | for (i = 0; i < ABBREV_HASH_SIZE; i++) | |
687 | { | |
688 | struct abbrev_info *abbrev = abbrevs[i]; | |
689 | ||
690 | while (abbrev) | |
691 | { | |
34b5e0b2 NC |
692 | free (abbrev->attrs); |
693 | abbrev = abbrev->next; | |
d8d1c398 AM |
694 | } |
695 | } | |
696 | return NULL; | |
697 | } | |
35330cce | 698 | cur_abbrev->attrs = tmp; |
252b5132 | 699 | } |
98591c73 | 700 | |
d45913a0 DA |
701 | cur_abbrev->attrs[cur_abbrev->num_attrs].name |
702 | = (enum dwarf_attribute) abbrev_name; | |
703 | cur_abbrev->attrs[cur_abbrev->num_attrs++].form | |
704 | = (enum dwarf_form) abbrev_form; | |
252b5132 RH |
705 | abbrev_name = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); |
706 | abbrev_ptr += bytes_read; | |
707 | abbrev_form = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); | |
708 | abbrev_ptr += bytes_read; | |
709 | } | |
710 | ||
711 | hash_number = abbrev_number % ABBREV_HASH_SIZE; | |
712 | cur_abbrev->next = abbrevs[hash_number]; | |
713 | abbrevs[hash_number] = cur_abbrev; | |
714 | ||
715 | /* Get next abbreviation. | |
e82ce529 | 716 | Under Irix6 the abbreviations for a compilation unit are not |
252b5132 RH |
717 | always properly terminated with an abbrev number of 0. |
718 | Exit loop if we encounter an abbreviation which we have | |
719 | already read (which means we are about to read the abbreviations | |
720 | for the next compile unit) or if the end of the abbreviation | |
721 | table is reached. */ | |
722 | if ((unsigned int) (abbrev_ptr - stash->dwarf_abbrev_buffer) | |
d8d1c398 | 723 | >= stash->dwarf_abbrev_size) |
252b5132 RH |
724 | break; |
725 | abbrev_number = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); | |
726 | abbrev_ptr += bytes_read; | |
727 | if (lookup_abbrev (abbrev_number,abbrevs) != NULL) | |
728 | break; | |
729 | } | |
730 | ||
731 | return abbrevs; | |
732 | } | |
733 | ||
cf716c56 | 734 | /* Read an attribute value described by an attribute form. */ |
252b5132 | 735 | |
f075ee0c | 736 | static bfd_byte * |
818a27ac AM |
737 | read_attribute_value (struct attribute *attr, |
738 | unsigned form, | |
739 | struct comp_unit *unit, | |
f075ee0c | 740 | bfd_byte *info_ptr) |
252b5132 RH |
741 | { |
742 | bfd *abfd = unit->abfd; | |
743 | unsigned int bytes_read; | |
744 | struct dwarf_block *blk; | |
dc810e39 | 745 | bfd_size_type amt; |
252b5132 | 746 | |
d45913a0 | 747 | attr->form = (enum dwarf_form) form; |
98591c73 | 748 | |
cf716c56 | 749 | switch (form) |
252b5132 | 750 | { |
252b5132 | 751 | case DW_FORM_ref_addr: |
5609a71e DJ |
752 | /* DW_FORM_ref_addr is an address in DWARF2, and an offset in |
753 | DWARF3. */ | |
754 | if (unit->version == 3) | |
755 | { | |
756 | if (unit->offset_size == 4) | |
757 | attr->u.val = read_4_bytes (unit->abfd, info_ptr); | |
758 | else | |
759 | attr->u.val = read_8_bytes (unit->abfd, info_ptr); | |
760 | info_ptr += unit->offset_size; | |
761 | break; | |
762 | } | |
763 | /* FALLTHROUGH */ | |
764 | case DW_FORM_addr: | |
482e2e37 | 765 | attr->u.val = read_address (unit, info_ptr); |
252b5132 RH |
766 | info_ptr += unit->addr_size; |
767 | break; | |
768 | case DW_FORM_block2: | |
dc810e39 | 769 | amt = sizeof (struct dwarf_block); |
818a27ac | 770 | blk = bfd_alloc (abfd, amt); |
252b5132 RH |
771 | blk->size = read_2_bytes (abfd, info_ptr); |
772 | info_ptr += 2; | |
773 | blk->data = read_n_bytes (abfd, info_ptr, blk->size); | |
774 | info_ptr += blk->size; | |
482e2e37 | 775 | attr->u.blk = blk; |
252b5132 RH |
776 | break; |
777 | case DW_FORM_block4: | |
dc810e39 | 778 | amt = sizeof (struct dwarf_block); |
818a27ac | 779 | blk = bfd_alloc (abfd, amt); |
252b5132 RH |
780 | blk->size = read_4_bytes (abfd, info_ptr); |
781 | info_ptr += 4; | |
782 | blk->data = read_n_bytes (abfd, info_ptr, blk->size); | |
783 | info_ptr += blk->size; | |
482e2e37 | 784 | attr->u.blk = blk; |
252b5132 RH |
785 | break; |
786 | case DW_FORM_data2: | |
482e2e37 | 787 | attr->u.val = read_2_bytes (abfd, info_ptr); |
252b5132 RH |
788 | info_ptr += 2; |
789 | break; | |
790 | case DW_FORM_data4: | |
482e2e37 | 791 | attr->u.val = read_4_bytes (abfd, info_ptr); |
252b5132 RH |
792 | info_ptr += 4; |
793 | break; | |
794 | case DW_FORM_data8: | |
482e2e37 | 795 | attr->u.val = read_8_bytes (abfd, info_ptr); |
252b5132 RH |
796 | info_ptr += 8; |
797 | break; | |
798 | case DW_FORM_string: | |
482e2e37 | 799 | attr->u.str = read_string (abfd, info_ptr, &bytes_read); |
252b5132 RH |
800 | info_ptr += bytes_read; |
801 | break; | |
d03ba2a1 | 802 | case DW_FORM_strp: |
482e2e37 | 803 | attr->u.str = read_indirect_string (unit, info_ptr, &bytes_read); |
d03ba2a1 JJ |
804 | info_ptr += bytes_read; |
805 | break; | |
252b5132 | 806 | case DW_FORM_block: |
dc810e39 | 807 | amt = sizeof (struct dwarf_block); |
818a27ac | 808 | blk = bfd_alloc (abfd, amt); |
252b5132 RH |
809 | blk->size = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); |
810 | info_ptr += bytes_read; | |
811 | blk->data = read_n_bytes (abfd, info_ptr, blk->size); | |
812 | info_ptr += blk->size; | |
482e2e37 | 813 | attr->u.blk = blk; |
252b5132 RH |
814 | break; |
815 | case DW_FORM_block1: | |
dc810e39 | 816 | amt = sizeof (struct dwarf_block); |
818a27ac | 817 | blk = bfd_alloc (abfd, amt); |
252b5132 RH |
818 | blk->size = read_1_byte (abfd, info_ptr); |
819 | info_ptr += 1; | |
820 | blk->data = read_n_bytes (abfd, info_ptr, blk->size); | |
821 | info_ptr += blk->size; | |
482e2e37 | 822 | attr->u.blk = blk; |
252b5132 RH |
823 | break; |
824 | case DW_FORM_data1: | |
482e2e37 | 825 | attr->u.val = read_1_byte (abfd, info_ptr); |
252b5132 RH |
826 | info_ptr += 1; |
827 | break; | |
828 | case DW_FORM_flag: | |
482e2e37 | 829 | attr->u.val = read_1_byte (abfd, info_ptr); |
252b5132 RH |
830 | info_ptr += 1; |
831 | break; | |
832 | case DW_FORM_sdata: | |
482e2e37 | 833 | attr->u.sval = read_signed_leb128 (abfd, info_ptr, &bytes_read); |
252b5132 RH |
834 | info_ptr += bytes_read; |
835 | break; | |
836 | case DW_FORM_udata: | |
482e2e37 | 837 | attr->u.val = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); |
252b5132 RH |
838 | info_ptr += bytes_read; |
839 | break; | |
840 | case DW_FORM_ref1: | |
482e2e37 | 841 | attr->u.val = read_1_byte (abfd, info_ptr); |
252b5132 RH |
842 | info_ptr += 1; |
843 | break; | |
844 | case DW_FORM_ref2: | |
482e2e37 | 845 | attr->u.val = read_2_bytes (abfd, info_ptr); |
252b5132 RH |
846 | info_ptr += 2; |
847 | break; | |
848 | case DW_FORM_ref4: | |
482e2e37 | 849 | attr->u.val = read_4_bytes (abfd, info_ptr); |
252b5132 RH |
850 | info_ptr += 4; |
851 | break; | |
81edd86d | 852 | case DW_FORM_ref8: |
482e2e37 | 853 | attr->u.val = read_8_bytes (abfd, info_ptr); |
81edd86d MM |
854 | info_ptr += 8; |
855 | break; | |
252b5132 | 856 | case DW_FORM_ref_udata: |
482e2e37 | 857 | attr->u.val = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); |
252b5132 RH |
858 | info_ptr += bytes_read; |
859 | break; | |
252b5132 | 860 | case DW_FORM_indirect: |
cf716c56 RH |
861 | form = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); |
862 | info_ptr += bytes_read; | |
863 | info_ptr = read_attribute_value (attr, form, unit, info_ptr); | |
864 | break; | |
252b5132 | 865 | default: |
f46c2da6 | 866 | (*_bfd_error_handler) (_("Dwarf Error: Invalid or unhandled FORM value: %u."), |
cf716c56 | 867 | form); |
252b5132 RH |
868 | bfd_set_error (bfd_error_bad_value); |
869 | } | |
870 | return info_ptr; | |
871 | } | |
872 | ||
cf716c56 RH |
873 | /* Read an attribute described by an abbreviated attribute. */ |
874 | ||
f075ee0c | 875 | static bfd_byte * |
818a27ac AM |
876 | read_attribute (struct attribute *attr, |
877 | struct attr_abbrev *abbrev, | |
878 | struct comp_unit *unit, | |
f075ee0c | 879 | bfd_byte *info_ptr) |
cf716c56 RH |
880 | { |
881 | attr->name = abbrev->name; | |
882 | info_ptr = read_attribute_value (attr, abbrev->form, unit, info_ptr); | |
883 | return info_ptr; | |
884 | } | |
885 | ||
a092b084 | 886 | /* Source line information table routines. */ |
252b5132 RH |
887 | |
888 | #define FILE_ALLOC_CHUNK 5 | |
889 | #define DIR_ALLOC_CHUNK 5 | |
890 | ||
a092b084 NC |
891 | struct line_info |
892 | { | |
252b5132 | 893 | struct line_info* prev_line; |
252b5132 | 894 | bfd_vma address; |
f075ee0c | 895 | char *filename; |
252b5132 RH |
896 | unsigned int line; |
897 | unsigned int column; | |
a092b084 | 898 | int end_sequence; /* End of (sequential) code sequence. */ |
252b5132 RH |
899 | }; |
900 | ||
a092b084 NC |
901 | struct fileinfo |
902 | { | |
252b5132 RH |
903 | char *name; |
904 | unsigned int dir; | |
905 | unsigned int time; | |
906 | unsigned int size; | |
907 | }; | |
908 | ||
a092b084 NC |
909 | struct line_info_table |
910 | { | |
252b5132 | 911 | bfd* abfd; |
252b5132 RH |
912 | unsigned int num_files; |
913 | unsigned int num_dirs; | |
f075ee0c AM |
914 | char *comp_dir; |
915 | char **dirs; | |
252b5132 | 916 | struct fileinfo* files; |
709d67f1 AM |
917 | struct line_info* last_line; /* largest VMA */ |
918 | struct line_info* lcl_head; /* local head; used in 'add_line_info' */ | |
252b5132 RH |
919 | }; |
920 | ||
4ab527b0 FF |
921 | /* Remember some information about each function. If the function is |
922 | inlined (DW_TAG_inlined_subroutine) it may have two additional | |
923 | attributes, DW_AT_call_file and DW_AT_call_line, which specify the | |
924 | source code location where this function was inlined. */ | |
925 | ||
1ee24f27 DJ |
926 | struct funcinfo |
927 | { | |
709d67f1 AM |
928 | struct funcinfo *prev_func; /* Pointer to previous function in list of all functions */ |
929 | struct funcinfo *caller_func; /* Pointer to function one scope higher */ | |
930 | char *caller_file; /* Source location file name where caller_func inlines this func */ | |
931 | int caller_line; /* Source location line number where caller_func inlines this func */ | |
932 | char *file; /* Source location file name */ | |
933 | int line; /* Source location line number */ | |
4ab527b0 | 934 | int tag; |
f075ee0c | 935 | char *name; |
a13afe8e | 936 | struct arange arange; |
709d67f1 | 937 | asection *sec; /* Where the symbol is defined */ |
5420f73d L |
938 | }; |
939 | ||
940 | struct varinfo | |
941 | { | |
709d67f1 | 942 | /* Pointer to previous variable in list of all variables */ |
5420f73d | 943 | struct varinfo *prev_var; |
709d67f1 | 944 | /* Source location file name */ |
5420f73d | 945 | char *file; |
709d67f1 | 946 | /* Source location line number */ |
5420f73d L |
947 | int line; |
948 | int tag; | |
949 | char *name; | |
5cf2e3f0 | 950 | bfd_vma addr; |
709d67f1 | 951 | /* Where the symbol is defined */ |
5420f73d | 952 | asection *sec; |
709d67f1 | 953 | /* Is this a stack variable? */ |
5420f73d | 954 | unsigned int stack: 1; |
1ee24f27 DJ |
955 | }; |
956 | ||
d4c32a81 L |
957 | /* Return TRUE if NEW_LINE should sort after LINE. */ |
958 | ||
959 | static inline bfd_boolean | |
960 | new_line_sorts_after (struct line_info *new_line, struct line_info *line) | |
961 | { | |
962 | return (new_line->address > line->address | |
963 | || (new_line->address == line->address | |
aff90a5f | 964 | && new_line->end_sequence < line->end_sequence)); |
d4c32a81 L |
965 | } |
966 | ||
967 | ||
af3ef9fe NC |
968 | /* Adds a new entry to the line_info list in the line_info_table, ensuring |
969 | that the list is sorted. Note that the line_info list is sorted from | |
970 | highest to lowest VMA (with possible duplicates); that is, | |
971 | line_info->prev_line always accesses an equal or smaller VMA. */ | |
972 | ||
98591c73 | 973 | static void |
818a27ac AM |
974 | add_line_info (struct line_info_table *table, |
975 | bfd_vma address, | |
976 | char *filename, | |
977 | unsigned int line, | |
978 | unsigned int column, | |
979 | int end_sequence) | |
252b5132 | 980 | { |
dc810e39 | 981 | bfd_size_type amt = sizeof (struct line_info); |
709d67f1 | 982 | struct line_info* info = bfd_alloc (table->abfd, amt); |
252b5132 | 983 | |
d4c32a81 L |
984 | /* Set member data of 'info'. */ |
985 | info->address = address; | |
986 | info->line = line; | |
987 | info->column = column; | |
988 | info->end_sequence = end_sequence; | |
989 | ||
990 | if (filename && filename[0]) | |
991 | { | |
992 | info->filename = bfd_alloc (table->abfd, strlen (filename) + 1); | |
993 | if (info->filename) | |
994 | strcpy (info->filename, filename); | |
995 | } | |
996 | else | |
997 | info->filename = NULL; | |
998 | ||
e82ce529 AM |
999 | /* Find the correct location for 'info'. Normally we will receive |
1000 | new line_info data 1) in order and 2) with increasing VMAs. | |
1001 | However some compilers break the rules (cf. decode_line_info) and | |
1002 | so we include some heuristics for quickly finding the correct | |
1003 | location for 'info'. In particular, these heuristics optimize for | |
1004 | the common case in which the VMA sequence that we receive is a | |
1005 | list of locally sorted VMAs such as | |
1006 | p...z a...j (where a < j < p < z) | |
252b5132 | 1007 | |
e82ce529 AM |
1008 | Note: table->lcl_head is used to head an *actual* or *possible* |
1009 | sequence within the list (such as a...j) that is not directly | |
1010 | headed by table->last_line | |
1011 | ||
1012 | Note: we may receive duplicate entries from 'decode_line_info'. */ | |
1013 | ||
aff90a5f L |
1014 | if (table->last_line |
1015 | && table->last_line->address == address | |
1016 | && table->last_line->end_sequence == end_sequence) | |
1017 | { | |
1018 | /* We only keep the last entry with the same address and end | |
1019 | sequence. See PR ld/4986. */ | |
1020 | if (table->lcl_head == table->last_line) | |
1021 | table->lcl_head = info; | |
1022 | info->prev_line = table->last_line->prev_line; | |
1023 | table->last_line = info; | |
1024 | } | |
1025 | else if (!table->last_line | |
709d67f1 | 1026 | || new_line_sorts_after (info, table->last_line)) |
d8d1c398 | 1027 | { |
709d67f1 | 1028 | /* Normal case: add 'info' to the beginning of the list */ |
d8d1c398 AM |
1029 | info->prev_line = table->last_line; |
1030 | table->last_line = info; | |
e82ce529 | 1031 | |
d8d1c398 AM |
1032 | /* lcl_head: initialize to head a *possible* sequence at the end. */ |
1033 | if (!table->lcl_head) | |
1034 | table->lcl_head = info; | |
1035 | } | |
1036 | else if (!new_line_sorts_after (info, table->lcl_head) | |
1037 | && (!table->lcl_head->prev_line | |
1038 | || new_line_sorts_after (info, table->lcl_head->prev_line))) | |
1039 | { | |
1040 | /* Abnormal but easy: lcl_head is the head of 'info'. */ | |
1041 | info->prev_line = table->lcl_head->prev_line; | |
1042 | table->lcl_head->prev_line = info; | |
1043 | } | |
1044 | else | |
1045 | { | |
1046 | /* Abnormal and hard: Neither 'last_line' nor 'lcl_head' are valid | |
1047 | heads for 'info'. Reset 'lcl_head'. */ | |
709d67f1 | 1048 | struct line_info* li2 = table->last_line; /* always non-NULL */ |
d8d1c398 | 1049 | struct line_info* li1 = li2->prev_line; |
e82ce529 | 1050 | |
d8d1c398 AM |
1051 | while (li1) |
1052 | { | |
1053 | if (!new_line_sorts_after (info, li2) | |
1054 | && new_line_sorts_after (info, li1)) | |
1055 | break; | |
e82ce529 | 1056 | |
709d67f1 | 1057 | li2 = li1; /* always non-NULL */ |
d8d1c398 AM |
1058 | li1 = li1->prev_line; |
1059 | } | |
1060 | table->lcl_head = li2; | |
1061 | info->prev_line = table->lcl_head->prev_line; | |
1062 | table->lcl_head->prev_line = info; | |
1063 | } | |
252b5132 RH |
1064 | } |
1065 | ||
5ed6aba4 | 1066 | /* Extract a fully qualified filename from a line info table. |
af3ef9fe NC |
1067 | The returned string has been malloc'ed and it is the caller's |
1068 | responsibility to free it. */ | |
5ed6aba4 | 1069 | |
a092b084 | 1070 | static char * |
818a27ac | 1071 | concat_filename (struct line_info_table *table, unsigned int file) |
252b5132 | 1072 | { |
f075ee0c | 1073 | char *filename; |
159002ff RH |
1074 | |
1075 | if (file - 1 >= table->num_files) | |
1076 | { | |
75a657ba L |
1077 | /* FILE == 0 means unknown. */ |
1078 | if (file) | |
1079 | (*_bfd_error_handler) | |
1080 | (_("Dwarf Error: mangled line number section (bad file number).")); | |
af3ef9fe | 1081 | return strdup ("<unknown>"); |
159002ff RH |
1082 | } |
1083 | ||
1084 | filename = table->files[file - 1].name; | |
5ed6aba4 | 1085 | |
7421a730 | 1086 | if (!IS_ABSOLUTE_PATH (filename)) |
252b5132 | 1087 | { |
7421a730 AM |
1088 | char *dirname = NULL; |
1089 | char *subdirname = NULL; | |
1090 | char *name; | |
1091 | size_t len; | |
0dafd5f6 | 1092 | |
7421a730 AM |
1093 | if (table->files[file - 1].dir) |
1094 | subdirname = table->dirs[table->files[file - 1].dir - 1]; | |
1095 | ||
1096 | if (!subdirname || !IS_ABSOLUTE_PATH (subdirname)) | |
1097 | dirname = table->comp_dir; | |
1098 | ||
1099 | if (!dirname) | |
af3ef9fe | 1100 | { |
7421a730 AM |
1101 | dirname = subdirname; |
1102 | subdirname = NULL; | |
1103 | } | |
af3ef9fe | 1104 | |
7421a730 AM |
1105 | if (!dirname) |
1106 | return strdup (filename); | |
1107 | ||
1108 | len = strlen (dirname) + strlen (filename) + 2; | |
1109 | ||
1110 | if (subdirname) | |
1111 | { | |
1112 | len += strlen (subdirname) + 1; | |
1113 | name = bfd_malloc (len); | |
1114 | if (name) | |
1115 | sprintf (name, "%s/%s/%s", dirname, subdirname, filename); | |
1116 | } | |
1117 | else | |
1118 | { | |
af3ef9fe NC |
1119 | name = bfd_malloc (len); |
1120 | if (name) | |
1121 | sprintf (name, "%s/%s", dirname, filename); | |
af3ef9fe | 1122 | } |
7421a730 AM |
1123 | |
1124 | return name; | |
252b5132 | 1125 | } |
af3ef9fe NC |
1126 | |
1127 | return strdup (filename); | |
252b5132 RH |
1128 | } |
1129 | ||
f623be2b | 1130 | static void |
709d67f1 | 1131 | arange_add (bfd *abfd, struct arange *first_arange, bfd_vma low_pc, bfd_vma high_pc) |
f623be2b RH |
1132 | { |
1133 | struct arange *arange; | |
1134 | ||
709d67f1 | 1135 | /* If the first arange is empty, use it. */ |
a13afe8e FF |
1136 | if (first_arange->high == 0) |
1137 | { | |
1138 | first_arange->low = low_pc; | |
1139 | first_arange->high = high_pc; | |
1140 | return; | |
1141 | } | |
98591c73 | 1142 | |
a13afe8e FF |
1143 | /* Next see if we can cheaply extend an existing range. */ |
1144 | arange = first_arange; | |
f623be2b RH |
1145 | do |
1146 | { | |
1147 | if (low_pc == arange->high) | |
1148 | { | |
1149 | arange->high = high_pc; | |
1150 | return; | |
1151 | } | |
1152 | if (high_pc == arange->low) | |
1153 | { | |
1154 | arange->low = low_pc; | |
1155 | return; | |
1156 | } | |
1157 | arange = arange->next; | |
1158 | } | |
1159 | while (arange); | |
1160 | ||
a13afe8e | 1161 | /* Need to allocate a new arange and insert it into the arange list. |
709d67f1 | 1162 | Order isn't significant, so just insert after the first arange. */ |
a13afe8e | 1163 | arange = bfd_zalloc (abfd, sizeof (*arange)); |
f623be2b RH |
1164 | arange->low = low_pc; |
1165 | arange->high = high_pc; | |
a13afe8e FF |
1166 | arange->next = first_arange->next; |
1167 | first_arange->next = arange; | |
f623be2b RH |
1168 | } |
1169 | ||
34b5e0b2 | 1170 | /* Decode the line number information for UNIT. */ |
252b5132 | 1171 | |
34b5e0b2 | 1172 | static struct line_info_table* |
818a27ac | 1173 | decode_line_info (struct comp_unit *unit, struct dwarf2_debug *stash) |
252b5132 RH |
1174 | { |
1175 | bfd *abfd = unit->abfd; | |
252b5132 | 1176 | struct line_info_table* table; |
f075ee0c AM |
1177 | bfd_byte *line_ptr; |
1178 | bfd_byte *line_end; | |
252b5132 | 1179 | struct line_head lh; |
d03ba2a1 | 1180 | unsigned int i, bytes_read, offset_size; |
252b5132 RH |
1181 | char *cur_file, *cur_dir; |
1182 | unsigned char op_code, extended_op, adj_opcode; | |
dc810e39 | 1183 | bfd_size_type amt; |
252b5132 | 1184 | |
1b315056 | 1185 | if (! read_section (abfd, ".debug_line", ".zdebug_line", |
9e32b19f DJ |
1186 | stash->syms, unit->line_offset, |
1187 | &stash->dwarf_line_buffer, &stash->dwarf_line_size)) | |
1b315056 | 1188 | return 0; |
ccdb16fc | 1189 | |
dc810e39 | 1190 | amt = sizeof (struct line_info_table); |
818a27ac | 1191 | table = bfd_alloc (abfd, amt); |
252b5132 RH |
1192 | table->abfd = abfd; |
1193 | table->comp_dir = unit->comp_dir; | |
1194 | ||
1195 | table->num_files = 0; | |
1196 | table->files = NULL; | |
1197 | ||
1198 | table->num_dirs = 0; | |
1199 | table->dirs = NULL; | |
1200 | ||
159002ff RH |
1201 | table->files = NULL; |
1202 | table->last_line = NULL; | |
e82ce529 | 1203 | table->lcl_head = NULL; |
159002ff | 1204 | |
69dd2e2d | 1205 | line_ptr = stash->dwarf_line_buffer + unit->line_offset; |
252b5132 | 1206 | |
a092b084 | 1207 | /* Read in the prologue. */ |
91a4d569 AM |
1208 | lh.total_length = read_4_bytes (abfd, line_ptr); |
1209 | line_ptr += 4; | |
1210 | offset_size = 4; | |
1211 | if (lh.total_length == 0xffffffff) | |
dae2dd0d | 1212 | { |
dae2dd0d NC |
1213 | lh.total_length = read_8_bytes (abfd, line_ptr); |
1214 | line_ptr += 8; | |
1215 | offset_size = 8; | |
1216 | } | |
91a4d569 | 1217 | else if (lh.total_length == 0 && unit->addr_size == 8) |
d03ba2a1 | 1218 | { |
91a4d569 AM |
1219 | /* Handle (non-standard) 64-bit DWARF2 formats. */ |
1220 | lh.total_length = read_4_bytes (abfd, line_ptr); | |
1221 | line_ptr += 4; | |
d03ba2a1 JJ |
1222 | offset_size = 8; |
1223 | } | |
252b5132 RH |
1224 | line_end = line_ptr + lh.total_length; |
1225 | lh.version = read_2_bytes (abfd, line_ptr); | |
1226 | line_ptr += 2; | |
d03ba2a1 JJ |
1227 | if (offset_size == 4) |
1228 | lh.prologue_length = read_4_bytes (abfd, line_ptr); | |
1229 | else | |
1230 | lh.prologue_length = read_8_bytes (abfd, line_ptr); | |
1231 | line_ptr += offset_size; | |
252b5132 RH |
1232 | lh.minimum_instruction_length = read_1_byte (abfd, line_ptr); |
1233 | line_ptr += 1; | |
1234 | lh.default_is_stmt = read_1_byte (abfd, line_ptr); | |
1235 | line_ptr += 1; | |
1236 | lh.line_base = read_1_signed_byte (abfd, line_ptr); | |
1237 | line_ptr += 1; | |
1238 | lh.line_range = read_1_byte (abfd, line_ptr); | |
1239 | line_ptr += 1; | |
1240 | lh.opcode_base = read_1_byte (abfd, line_ptr); | |
1241 | line_ptr += 1; | |
dc810e39 | 1242 | amt = lh.opcode_base * sizeof (unsigned char); |
818a27ac | 1243 | lh.standard_opcode_lengths = bfd_alloc (abfd, amt); |
252b5132 RH |
1244 | |
1245 | lh.standard_opcode_lengths[0] = 1; | |
98591c73 | 1246 | |
252b5132 RH |
1247 | for (i = 1; i < lh.opcode_base; ++i) |
1248 | { | |
1249 | lh.standard_opcode_lengths[i] = read_1_byte (abfd, line_ptr); | |
1250 | line_ptr += 1; | |
1251 | } | |
1252 | ||
a092b084 | 1253 | /* Read directory table. */ |
252b5132 RH |
1254 | while ((cur_dir = read_string (abfd, line_ptr, &bytes_read)) != NULL) |
1255 | { | |
1256 | line_ptr += bytes_read; | |
98591c73 | 1257 | |
252b5132 RH |
1258 | if ((table->num_dirs % DIR_ALLOC_CHUNK) == 0) |
1259 | { | |
35330cce NC |
1260 | char **tmp; |
1261 | ||
dc810e39 AM |
1262 | amt = table->num_dirs + DIR_ALLOC_CHUNK; |
1263 | amt *= sizeof (char *); | |
35330cce NC |
1264 | |
1265 | tmp = bfd_realloc (table->dirs, amt); | |
1266 | if (tmp == NULL) | |
1267 | { | |
1268 | free (table->dirs); | |
1269 | return NULL; | |
1270 | } | |
1271 | table->dirs = tmp; | |
252b5132 | 1272 | } |
98591c73 | 1273 | |
252b5132 RH |
1274 | table->dirs[table->num_dirs++] = cur_dir; |
1275 | } | |
98591c73 | 1276 | |
252b5132 RH |
1277 | line_ptr += bytes_read; |
1278 | ||
a092b084 | 1279 | /* Read file name table. */ |
252b5132 RH |
1280 | while ((cur_file = read_string (abfd, line_ptr, &bytes_read)) != NULL) |
1281 | { | |
1282 | line_ptr += bytes_read; | |
98591c73 | 1283 | |
252b5132 RH |
1284 | if ((table->num_files % FILE_ALLOC_CHUNK) == 0) |
1285 | { | |
35330cce NC |
1286 | struct fileinfo *tmp; |
1287 | ||
dc810e39 AM |
1288 | amt = table->num_files + FILE_ALLOC_CHUNK; |
1289 | amt *= sizeof (struct fileinfo); | |
35330cce NC |
1290 | |
1291 | tmp = bfd_realloc (table->files, amt); | |
1292 | if (tmp == NULL) | |
1293 | { | |
1294 | free (table->files); | |
1295 | free (table->dirs); | |
1296 | return NULL; | |
1297 | } | |
1298 | table->files = tmp; | |
252b5132 | 1299 | } |
98591c73 | 1300 | |
252b5132 RH |
1301 | table->files[table->num_files].name = cur_file; |
1302 | table->files[table->num_files].dir = | |
1303 | read_unsigned_leb128 (abfd, line_ptr, &bytes_read); | |
1304 | line_ptr += bytes_read; | |
1305 | table->files[table->num_files].time = | |
1306 | read_unsigned_leb128 (abfd, line_ptr, &bytes_read); | |
1307 | line_ptr += bytes_read; | |
1308 | table->files[table->num_files].size = | |
1309 | read_unsigned_leb128 (abfd, line_ptr, &bytes_read); | |
1310 | line_ptr += bytes_read; | |
1311 | table->num_files++; | |
1312 | } | |
98591c73 | 1313 | |
252b5132 RH |
1314 | line_ptr += bytes_read; |
1315 | ||
1316 | /* Read the statement sequences until there's nothing left. */ | |
1317 | while (line_ptr < line_end) | |
1318 | { | |
a092b084 | 1319 | /* State machine registers. */ |
252b5132 | 1320 | bfd_vma address = 0; |
8bfd78b3 | 1321 | char * filename = table->num_files ? concat_filename (table, 1) : NULL; |
252b5132 RH |
1322 | unsigned int line = 1; |
1323 | unsigned int column = 0; | |
1324 | int is_stmt = lh.default_is_stmt; | |
e2f6d277 NC |
1325 | int end_sequence = 0; |
1326 | /* eraxxon@alumni.rice.edu: Against the DWARF2 specs, some | |
e82ce529 AM |
1327 | compilers generate address sequences that are wildly out of |
1328 | order using DW_LNE_set_address (e.g. Intel C++ 6.0 compiler | |
1329 | for ia64-Linux). Thus, to determine the low and high | |
1330 | address, we must compare on every DW_LNS_copy, etc. */ | |
75758e9d | 1331 | bfd_vma low_pc = (bfd_vma) -1; |
e2f6d277 | 1332 | bfd_vma high_pc = 0; |
252b5132 | 1333 | |
a092b084 | 1334 | /* Decode the table. */ |
252b5132 RH |
1335 | while (! end_sequence) |
1336 | { | |
1337 | op_code = read_1_byte (abfd, line_ptr); | |
1338 | line_ptr += 1; | |
98591c73 | 1339 | |
1a509dcc | 1340 | if (op_code >= lh.opcode_base) |
e2f6d277 NC |
1341 | { |
1342 | /* Special operand. */ | |
1a509dcc GK |
1343 | adj_opcode = op_code - lh.opcode_base; |
1344 | address += (adj_opcode / lh.line_range) | |
1345 | * lh.minimum_instruction_length; | |
1346 | line += lh.line_base + (adj_opcode % lh.line_range); | |
1347 | /* Append row to matrix using current values. */ | |
1348 | add_line_info (table, address, filename, line, column, 0); | |
75758e9d AM |
1349 | if (address < low_pc) |
1350 | low_pc = address; | |
e2f6d277 NC |
1351 | if (address > high_pc) |
1352 | high_pc = address; | |
1a509dcc GK |
1353 | } |
1354 | else switch (op_code) | |
252b5132 RH |
1355 | { |
1356 | case DW_LNS_extended_op: | |
e2f6d277 NC |
1357 | /* Ignore length. */ |
1358 | line_ptr += 1; | |
252b5132 RH |
1359 | extended_op = read_1_byte (abfd, line_ptr); |
1360 | line_ptr += 1; | |
e2f6d277 | 1361 | |
252b5132 RH |
1362 | switch (extended_op) |
1363 | { | |
1364 | case DW_LNE_end_sequence: | |
1365 | end_sequence = 1; | |
f623be2b RH |
1366 | add_line_info (table, address, filename, line, column, |
1367 | end_sequence); | |
75758e9d AM |
1368 | if (address < low_pc) |
1369 | low_pc = address; | |
e2f6d277 NC |
1370 | if (address > high_pc) |
1371 | high_pc = address; | |
709d67f1 | 1372 | arange_add (unit->abfd, &unit->arange, low_pc, high_pc); |
252b5132 RH |
1373 | break; |
1374 | case DW_LNE_set_address: | |
1375 | address = read_address (unit, line_ptr); | |
1376 | line_ptr += unit->addr_size; | |
1377 | break; | |
1378 | case DW_LNE_define_file: | |
1379 | cur_file = read_string (abfd, line_ptr, &bytes_read); | |
1380 | line_ptr += bytes_read; | |
1381 | if ((table->num_files % FILE_ALLOC_CHUNK) == 0) | |
1382 | { | |
35330cce NC |
1383 | struct fileinfo *tmp; |
1384 | ||
dc810e39 AM |
1385 | amt = table->num_files + FILE_ALLOC_CHUNK; |
1386 | amt *= sizeof (struct fileinfo); | |
35330cce NC |
1387 | tmp = bfd_realloc (table->files, amt); |
1388 | if (tmp == NULL) | |
d8d1c398 | 1389 | { |
35330cce NC |
1390 | free (table->files); |
1391 | free (table->dirs); | |
1392 | free (filename); | |
1393 | return NULL; | |
d8d1c398 | 1394 | } |
35330cce | 1395 | table->files = tmp; |
252b5132 RH |
1396 | } |
1397 | table->files[table->num_files].name = cur_file; | |
1398 | table->files[table->num_files].dir = | |
1399 | read_unsigned_leb128 (abfd, line_ptr, &bytes_read); | |
1400 | line_ptr += bytes_read; | |
1401 | table->files[table->num_files].time = | |
1402 | read_unsigned_leb128 (abfd, line_ptr, &bytes_read); | |
1403 | line_ptr += bytes_read; | |
1404 | table->files[table->num_files].size = | |
1405 | read_unsigned_leb128 (abfd, line_ptr, &bytes_read); | |
1406 | line_ptr += bytes_read; | |
1407 | table->num_files++; | |
1408 | break; | |
1409 | default: | |
1410 | (*_bfd_error_handler) (_("Dwarf Error: mangled line number section.")); | |
1411 | bfd_set_error (bfd_error_bad_value); | |
35330cce NC |
1412 | free (filename); |
1413 | free (table->files); | |
1414 | free (table->dirs); | |
1415 | return NULL; | |
252b5132 RH |
1416 | } |
1417 | break; | |
1418 | case DW_LNS_copy: | |
159002ff | 1419 | add_line_info (table, address, filename, line, column, 0); |
75758e9d AM |
1420 | if (address < low_pc) |
1421 | low_pc = address; | |
e2f6d277 NC |
1422 | if (address > high_pc) |
1423 | high_pc = address; | |
252b5132 RH |
1424 | break; |
1425 | case DW_LNS_advance_pc: | |
1426 | address += lh.minimum_instruction_length | |
1427 | * read_unsigned_leb128 (abfd, line_ptr, &bytes_read); | |
1428 | line_ptr += bytes_read; | |
1429 | break; | |
1430 | case DW_LNS_advance_line: | |
1431 | line += read_signed_leb128 (abfd, line_ptr, &bytes_read); | |
1432 | line_ptr += bytes_read; | |
1433 | break; | |
1434 | case DW_LNS_set_file: | |
1435 | { | |
1436 | unsigned int file; | |
1437 | ||
e2f6d277 NC |
1438 | /* The file and directory tables are 0 |
1439 | based, the references are 1 based. */ | |
252b5132 RH |
1440 | file = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); |
1441 | line_ptr += bytes_read; | |
af3ef9fe NC |
1442 | if (filename) |
1443 | free (filename); | |
252b5132 RH |
1444 | filename = concat_filename (table, file); |
1445 | break; | |
1446 | } | |
1447 | case DW_LNS_set_column: | |
1448 | column = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); | |
1449 | line_ptr += bytes_read; | |
1450 | break; | |
1451 | case DW_LNS_negate_stmt: | |
1452 | is_stmt = (!is_stmt); | |
1453 | break; | |
1454 | case DW_LNS_set_basic_block: | |
252b5132 RH |
1455 | break; |
1456 | case DW_LNS_const_add_pc: | |
159002ff RH |
1457 | address += lh.minimum_instruction_length |
1458 | * ((255 - lh.opcode_base) / lh.line_range); | |
252b5132 RH |
1459 | break; |
1460 | case DW_LNS_fixed_advance_pc: | |
1461 | address += read_2_bytes (abfd, line_ptr); | |
1462 | line_ptr += 2; | |
1463 | break; | |
1a509dcc | 1464 | default: |
e2f6d277 | 1465 | { |
1a509dcc | 1466 | int i; |
5ed6aba4 | 1467 | |
e2f6d277 | 1468 | /* Unknown standard opcode, ignore it. */ |
1a509dcc GK |
1469 | for (i = 0; i < lh.standard_opcode_lengths[op_code]; i++) |
1470 | { | |
1471 | (void) read_unsigned_leb128 (abfd, line_ptr, &bytes_read); | |
1472 | line_ptr += bytes_read; | |
1473 | } | |
1474 | } | |
252b5132 RH |
1475 | } |
1476 | } | |
5ed6aba4 | 1477 | |
af3ef9fe NC |
1478 | if (filename) |
1479 | free (filename); | |
252b5132 RH |
1480 | } |
1481 | ||
1482 | return table; | |
1483 | } | |
1484 | ||
b34976b6 AM |
1485 | /* If ADDR is within TABLE set the output parameters and return TRUE, |
1486 | otherwise return FALSE. The output parameters, FILENAME_PTR and | |
a092b084 | 1487 | LINENUMBER_PTR, are pointers to the objects to be filled in. */ |
252b5132 | 1488 | |
b34976b6 | 1489 | static bfd_boolean |
818a27ac AM |
1490 | lookup_address_in_line_info_table (struct line_info_table *table, |
1491 | bfd_vma addr, | |
1492 | struct funcinfo *function, | |
1493 | const char **filename_ptr, | |
1494 | unsigned int *linenumber_ptr) | |
252b5132 | 1495 | { |
e82ce529 | 1496 | /* Note: table->last_line should be a descendingly sorted list. */ |
159002ff | 1497 | struct line_info* next_line = table->last_line; |
e82ce529 AM |
1498 | struct line_info* each_line = NULL; |
1499 | *filename_ptr = NULL; | |
98591c73 | 1500 | |
159002ff | 1501 | if (!next_line) |
b34976b6 | 1502 | return FALSE; |
159002ff RH |
1503 | |
1504 | each_line = next_line->prev_line; | |
1505 | ||
e82ce529 AM |
1506 | /* Check for large addresses */ |
1507 | if (addr > next_line->address) | |
1508 | each_line = NULL; /* ensure we skip over the normal case */ | |
1509 | ||
1510 | /* Normal case: search the list; save */ | |
159002ff | 1511 | while (each_line && next_line) |
252b5132 | 1512 | { |
e82ce529 AM |
1513 | /* If we have an address match, save this info. This allows us |
1514 | to return as good as results as possible for strange debugging | |
1515 | info. */ | |
b34976b6 | 1516 | bfd_boolean addr_match = FALSE; |
a13afe8e | 1517 | if (each_line->address <= addr && addr < next_line->address) |
252b5132 | 1518 | { |
b34976b6 | 1519 | addr_match = TRUE; |
e82ce529 | 1520 | |
1ee24f27 DJ |
1521 | /* If this line appears to span functions, and addr is in the |
1522 | later function, return the first line of that function instead | |
1523 | of the last line of the earlier one. This check is for GCC | |
1524 | 2.95, which emits the first line number for a function late. */ | |
a13afe8e FF |
1525 | |
1526 | if (function != NULL) | |
1ee24f27 | 1527 | { |
a13afe8e FF |
1528 | bfd_vma lowest_pc; |
1529 | struct arange *arange; | |
1530 | ||
1531 | /* Find the lowest address in the function's range list */ | |
1532 | lowest_pc = function->arange.low; | |
1533 | for (arange = &function->arange; | |
1534 | arange; | |
1535 | arange = arange->next) | |
1536 | { | |
1537 | if (function->arange.low < lowest_pc) | |
1538 | lowest_pc = function->arange.low; | |
1539 | } | |
1540 | /* Check for spanning function and set outgoing line info */ | |
1541 | if (addr >= lowest_pc | |
1542 | && each_line->address < lowest_pc | |
1543 | && next_line->address > lowest_pc) | |
1544 | { | |
1545 | *filename_ptr = next_line->filename; | |
1546 | *linenumber_ptr = next_line->line; | |
1547 | } | |
1548 | else | |
1549 | { | |
1550 | *filename_ptr = each_line->filename; | |
1551 | *linenumber_ptr = each_line->line; | |
1552 | } | |
1ee24f27 | 1553 | } |
6bd00c5d L |
1554 | else |
1555 | { | |
1556 | *filename_ptr = each_line->filename; | |
1557 | *linenumber_ptr = each_line->line; | |
1558 | } | |
252b5132 | 1559 | } |
e82ce529 AM |
1560 | |
1561 | if (addr_match && !each_line->end_sequence) | |
b34976b6 | 1562 | return TRUE; /* we have definitely found what we want */ |
e82ce529 | 1563 | |
159002ff RH |
1564 | next_line = each_line; |
1565 | each_line = each_line->prev_line; | |
252b5132 | 1566 | } |
98591c73 | 1567 | |
e82ce529 AM |
1568 | /* At this point each_line is NULL but next_line is not. If we found |
1569 | a candidate end-of-sequence point in the loop above, we can return | |
1570 | that (compatibility with a bug in the Intel compiler); otherwise, | |
1571 | assuming that we found the containing function for this address in | |
1572 | this compilation unit, return the first line we have a number for | |
1573 | (compatibility with GCC 2.95). */ | |
1574 | if (*filename_ptr == NULL && function != NULL) | |
1ee24f27 DJ |
1575 | { |
1576 | *filename_ptr = next_line->filename; | |
1577 | *linenumber_ptr = next_line->line; | |
b34976b6 | 1578 | return TRUE; |
1ee24f27 DJ |
1579 | } |
1580 | ||
b34976b6 | 1581 | return FALSE; |
252b5132 | 1582 | } |
98591c73 | 1583 | |
a13afe8e FF |
1584 | /* Read in the .debug_ranges section for future reference */ |
1585 | ||
1586 | static bfd_boolean | |
1587 | read_debug_ranges (struct comp_unit *unit) | |
1588 | { | |
1589 | struct dwarf2_debug *stash = unit->stash; | |
1b315056 | 1590 | return read_section (unit->abfd, ".debug_ranges", ".zdebug_ranges", |
9e32b19f DJ |
1591 | stash->syms, 0, |
1592 | &stash->dwarf_ranges_buffer, &stash->dwarf_ranges_size); | |
a13afe8e FF |
1593 | } |
1594 | ||
a092b084 | 1595 | /* Function table functions. */ |
252b5132 | 1596 | |
a13afe8e FF |
1597 | /* If ADDR is within TABLE, set FUNCTIONNAME_PTR, and return TRUE. |
1598 | Note that we need to find the function that has the smallest | |
1599 | range that contains ADDR, to handle inlined functions without | |
1600 | depending upon them being ordered in TABLE by increasing range. */ | |
252b5132 | 1601 | |
b34976b6 | 1602 | static bfd_boolean |
4ab527b0 | 1603 | lookup_address_in_function_table (struct comp_unit *unit, |
818a27ac AM |
1604 | bfd_vma addr, |
1605 | struct funcinfo **function_ptr, | |
1606 | const char **functionname_ptr) | |
252b5132 RH |
1607 | { |
1608 | struct funcinfo* each_func; | |
a13afe8e FF |
1609 | struct funcinfo* best_fit = NULL; |
1610 | struct arange *arange; | |
252b5132 | 1611 | |
4ab527b0 | 1612 | for (each_func = unit->function_table; |
252b5132 RH |
1613 | each_func; |
1614 | each_func = each_func->prev_func) | |
1615 | { | |
a13afe8e FF |
1616 | for (arange = &each_func->arange; |
1617 | arange; | |
1618 | arange = arange->next) | |
252b5132 | 1619 | { |
a13afe8e FF |
1620 | if (addr >= arange->low && addr < arange->high) |
1621 | { | |
1622 | if (!best_fit || | |
1623 | ((arange->high - arange->low) < (best_fit->arange.high - best_fit->arange.low))) | |
1624 | best_fit = each_func; | |
1625 | } | |
252b5132 RH |
1626 | } |
1627 | } | |
98591c73 | 1628 | |
a13afe8e FF |
1629 | if (best_fit) |
1630 | { | |
1631 | *functionname_ptr = best_fit->name; | |
1632 | *function_ptr = best_fit; | |
1633 | return TRUE; | |
1634 | } | |
1635 | else | |
1636 | { | |
1637 | return FALSE; | |
1638 | } | |
252b5132 RH |
1639 | } |
1640 | ||
5420f73d L |
1641 | /* If SYM at ADDR is within function table of UNIT, set FILENAME_PTR |
1642 | and LINENUMBER_PTR, and return TRUE. */ | |
1643 | ||
1644 | static bfd_boolean | |
1645 | lookup_symbol_in_function_table (struct comp_unit *unit, | |
1646 | asymbol *sym, | |
1647 | bfd_vma addr, | |
1648 | const char **filename_ptr, | |
1649 | unsigned int *linenumber_ptr) | |
1650 | { | |
1651 | struct funcinfo* each_func; | |
1652 | struct funcinfo* best_fit = NULL; | |
1653 | struct arange *arange; | |
1654 | const char *name = bfd_asymbol_name (sym); | |
1655 | asection *sec = bfd_get_section (sym); | |
1656 | ||
1657 | for (each_func = unit->function_table; | |
1658 | each_func; | |
1659 | each_func = each_func->prev_func) | |
1660 | { | |
1661 | for (arange = &each_func->arange; | |
1662 | arange; | |
1663 | arange = arange->next) | |
1664 | { | |
1665 | if ((!each_func->sec || each_func->sec == sec) | |
1666 | && addr >= arange->low | |
1667 | && addr < arange->high | |
650f284e | 1668 | && each_func->name |
5420f73d L |
1669 | && strcmp (name, each_func->name) == 0 |
1670 | && (!best_fit | |
1671 | || ((arange->high - arange->low) | |
1672 | < (best_fit->arange.high - best_fit->arange.low)))) | |
1673 | best_fit = each_func; | |
1674 | } | |
1675 | } | |
1676 | ||
1677 | if (best_fit) | |
1678 | { | |
1679 | best_fit->sec = sec; | |
1680 | *filename_ptr = best_fit->file; | |
1681 | *linenumber_ptr = best_fit->line; | |
1682 | return TRUE; | |
1683 | } | |
1684 | else | |
1685 | return FALSE; | |
1686 | } | |
1687 | ||
1688 | /* Variable table functions. */ | |
1689 | ||
1690 | /* If SYM is within variable table of UNIT, set FILENAME_PTR and | |
1691 | LINENUMBER_PTR, and return TRUE. */ | |
1692 | ||
1693 | static bfd_boolean | |
1694 | lookup_symbol_in_variable_table (struct comp_unit *unit, | |
1695 | asymbol *sym, | |
5cf2e3f0 | 1696 | bfd_vma addr, |
5420f73d L |
1697 | const char **filename_ptr, |
1698 | unsigned int *linenumber_ptr) | |
1699 | { | |
1700 | const char *name = bfd_asymbol_name (sym); | |
1701 | asection *sec = bfd_get_section (sym); | |
1702 | struct varinfo* each; | |
1703 | ||
1704 | for (each = unit->variable_table; each; each = each->prev_var) | |
1705 | if (each->stack == 0 | |
5cf2e3f0 L |
1706 | && each->file != NULL |
1707 | && each->name != NULL | |
1708 | && each->addr == addr | |
5420f73d L |
1709 | && (!each->sec || each->sec == sec) |
1710 | && strcmp (name, each->name) == 0) | |
1711 | break; | |
1712 | ||
1713 | if (each) | |
1714 | { | |
1715 | each->sec = sec; | |
1716 | *filename_ptr = each->file; | |
1717 | *linenumber_ptr = each->line; | |
1718 | return TRUE; | |
1719 | } | |
1720 | else | |
1721 | return FALSE; | |
1722 | } | |
1723 | ||
06f22d7e | 1724 | static char * |
5609a71e DJ |
1725 | find_abstract_instance_name (struct comp_unit *unit, |
1726 | struct attribute *attr_ptr) | |
06f22d7e FF |
1727 | { |
1728 | bfd *abfd = unit->abfd; | |
f075ee0c | 1729 | bfd_byte *info_ptr; |
06f22d7e FF |
1730 | unsigned int abbrev_number, bytes_read, i; |
1731 | struct abbrev_info *abbrev; | |
5609a71e | 1732 | bfd_uint64_t die_ref = attr_ptr->u.val; |
06f22d7e FF |
1733 | struct attribute attr; |
1734 | char *name = 0; | |
1735 | ||
5609a71e DJ |
1736 | /* DW_FORM_ref_addr can reference an entry in a different CU. It |
1737 | is an offset from the .debug_info section, not the current CU. */ | |
1738 | if (attr_ptr->form == DW_FORM_ref_addr) | |
1739 | { | |
1740 | /* We only support DW_FORM_ref_addr within the same file, so | |
1741 | any relocations should be resolved already. */ | |
1742 | if (!die_ref) | |
1743 | abort (); | |
1744 | ||
1745 | info_ptr = unit->stash->sec_info_ptr + die_ref; | |
1746 | } | |
1747 | else | |
1748 | info_ptr = unit->info_ptr_unit + die_ref; | |
06f22d7e FF |
1749 | abbrev_number = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); |
1750 | info_ptr += bytes_read; | |
1751 | ||
1752 | if (abbrev_number) | |
1753 | { | |
1754 | abbrev = lookup_abbrev (abbrev_number, unit->abbrevs); | |
1755 | if (! abbrev) | |
1756 | { | |
1757 | (*_bfd_error_handler) (_("Dwarf Error: Could not find abbrev number %u."), | |
1758 | abbrev_number); | |
1759 | bfd_set_error (bfd_error_bad_value); | |
1760 | } | |
1761 | else | |
1762 | { | |
d5cbaa15 | 1763 | for (i = 0; i < abbrev->num_attrs; ++i) |
06f22d7e FF |
1764 | { |
1765 | info_ptr = read_attribute (&attr, &abbrev->attrs[i], unit, info_ptr); | |
26bf4e33 FF |
1766 | switch (attr.name) |
1767 | { | |
1768 | case DW_AT_name: | |
d5cbaa15 JW |
1769 | /* Prefer DW_AT_MIPS_linkage_name over DW_AT_name. */ |
1770 | if (name == NULL) | |
1771 | name = attr.u.str; | |
26bf4e33 FF |
1772 | break; |
1773 | case DW_AT_specification: | |
5609a71e | 1774 | name = find_abstract_instance_name (unit, &attr); |
26bf4e33 | 1775 | break; |
d5cbaa15 JW |
1776 | case DW_AT_MIPS_linkage_name: |
1777 | name = attr.u.str; | |
1778 | break; | |
26bf4e33 FF |
1779 | default: |
1780 | break; | |
1781 | } | |
06f22d7e FF |
1782 | } |
1783 | } | |
1784 | } | |
709d67f1 | 1785 | return (name); |
06f22d7e FF |
1786 | } |
1787 | ||
a13afe8e | 1788 | static void |
709d67f1 | 1789 | read_rangelist (struct comp_unit *unit, struct arange *arange, bfd_uint64_t offset) |
a13afe8e FF |
1790 | { |
1791 | bfd_byte *ranges_ptr; | |
1792 | bfd_vma base_address = unit->base_address; | |
1793 | ||
1794 | if (! unit->stash->dwarf_ranges_buffer) | |
1795 | { | |
1796 | if (! read_debug_ranges (unit)) | |
1797 | return; | |
1798 | } | |
1799 | ranges_ptr = unit->stash->dwarf_ranges_buffer + offset; | |
d8d1c398 | 1800 | |
a13afe8e FF |
1801 | for (;;) |
1802 | { | |
1803 | bfd_vma low_pc; | |
1804 | bfd_vma high_pc; | |
1805 | ||
13d72a14 AN |
1806 | low_pc = read_address (unit, ranges_ptr); |
1807 | ranges_ptr += unit->addr_size; | |
1808 | high_pc = read_address (unit, ranges_ptr); | |
1809 | ranges_ptr += unit->addr_size; | |
1810 | ||
a13afe8e FF |
1811 | if (low_pc == 0 && high_pc == 0) |
1812 | break; | |
1813 | if (low_pc == -1UL && high_pc != -1UL) | |
1814 | base_address = high_pc; | |
1815 | else | |
709d67f1 | 1816 | arange_add (unit->abfd, arange, base_address + low_pc, base_address + high_pc); |
a13afe8e FF |
1817 | } |
1818 | } | |
1819 | ||
a092b084 | 1820 | /* DWARF2 Compilation unit functions. */ |
252b5132 RH |
1821 | |
1822 | /* Scan over each die in a comp. unit looking for functions to add | |
34b5e0b2 | 1823 | to the function table and variables to the variable table. */ |
252b5132 | 1824 | |
b34976b6 | 1825 | static bfd_boolean |
5420f73d | 1826 | scan_unit_for_symbols (struct comp_unit *unit) |
252b5132 RH |
1827 | { |
1828 | bfd *abfd = unit->abfd; | |
f075ee0c | 1829 | bfd_byte *info_ptr = unit->first_child_die_ptr; |
252b5132 | 1830 | int nesting_level = 1; |
c955f9cd JW |
1831 | struct funcinfo **nested_funcs; |
1832 | int nested_funcs_size; | |
1833 | ||
1834 | /* Maintain a stack of in-scope functions and inlined functions, which we | |
1835 | can use to set the caller_func field. */ | |
1836 | nested_funcs_size = 32; | |
1837 | nested_funcs = bfd_malloc (nested_funcs_size * sizeof (struct funcinfo *)); | |
1838 | if (nested_funcs == NULL) | |
1839 | return FALSE; | |
34b5e0b2 | 1840 | nested_funcs[nesting_level] = 0; |
252b5132 RH |
1841 | |
1842 | while (nesting_level) | |
1843 | { | |
1844 | unsigned int abbrev_number, bytes_read, i; | |
1845 | struct abbrev_info *abbrev; | |
1846 | struct attribute attr; | |
1847 | struct funcinfo *func; | |
5420f73d | 1848 | struct varinfo *var; |
a13afe8e FF |
1849 | bfd_vma low_pc = 0; |
1850 | bfd_vma high_pc = 0; | |
252b5132 RH |
1851 | |
1852 | abbrev_number = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); | |
1853 | info_ptr += bytes_read; | |
1854 | ||
1855 | if (! abbrev_number) | |
1856 | { | |
1857 | nesting_level--; | |
1858 | continue; | |
1859 | } | |
98591c73 | 1860 | |
252b5132 RH |
1861 | abbrev = lookup_abbrev (abbrev_number,unit->abbrevs); |
1862 | if (! abbrev) | |
1863 | { | |
f46c2da6 | 1864 | (*_bfd_error_handler) (_("Dwarf Error: Could not find abbrev number %u."), |
252b5132 RH |
1865 | abbrev_number); |
1866 | bfd_set_error (bfd_error_bad_value); | |
c955f9cd | 1867 | free (nested_funcs); |
b34976b6 | 1868 | return FALSE; |
252b5132 | 1869 | } |
98591c73 | 1870 | |
5420f73d | 1871 | var = NULL; |
06f22d7e | 1872 | if (abbrev->tag == DW_TAG_subprogram |
5420f73d | 1873 | || abbrev->tag == DW_TAG_entry_point |
06f22d7e | 1874 | || abbrev->tag == DW_TAG_inlined_subroutine) |
252b5132 | 1875 | { |
dc810e39 | 1876 | bfd_size_type amt = sizeof (struct funcinfo); |
818a27ac | 1877 | func = bfd_zalloc (abfd, amt); |
4ab527b0 | 1878 | func->tag = abbrev->tag; |
252b5132 RH |
1879 | func->prev_func = unit->function_table; |
1880 | unit->function_table = func; | |
bd210d54 | 1881 | BFD_ASSERT (!unit->cached); |
c955f9cd JW |
1882 | |
1883 | if (func->tag == DW_TAG_inlined_subroutine) | |
1884 | for (i = nesting_level - 1; i >= 1; i--) | |
1885 | if (nested_funcs[i]) | |
1886 | { | |
1887 | func->caller_func = nested_funcs[i]; | |
1888 | break; | |
1889 | } | |
1890 | nested_funcs[nesting_level] = func; | |
252b5132 RH |
1891 | } |
1892 | else | |
5420f73d L |
1893 | { |
1894 | func = NULL; | |
1895 | if (abbrev->tag == DW_TAG_variable) | |
1896 | { | |
1897 | bfd_size_type amt = sizeof (struct varinfo); | |
1898 | var = bfd_zalloc (abfd, amt); | |
1899 | var->tag = abbrev->tag; | |
1900 | var->stack = 1; | |
1901 | var->prev_var = unit->variable_table; | |
1902 | unit->variable_table = var; | |
bd210d54 | 1903 | BFD_ASSERT (!unit->cached); |
5420f73d | 1904 | } |
c955f9cd JW |
1905 | |
1906 | /* No inline function in scope at this nesting level. */ | |
1907 | nested_funcs[nesting_level] = 0; | |
5420f73d | 1908 | } |
98591c73 | 1909 | |
252b5132 RH |
1910 | for (i = 0; i < abbrev->num_attrs; ++i) |
1911 | { | |
1912 | info_ptr = read_attribute (&attr, &abbrev->attrs[i], unit, info_ptr); | |
98591c73 | 1913 | |
252b5132 RH |
1914 | if (func) |
1915 | { | |
1916 | switch (attr.name) | |
1917 | { | |
4ab527b0 FF |
1918 | case DW_AT_call_file: |
1919 | func->caller_file = concat_filename (unit->line_table, attr.u.val); | |
1920 | break; | |
1921 | ||
1922 | case DW_AT_call_line: | |
1923 | func->caller_line = attr.u.val; | |
1924 | break; | |
1925 | ||
06f22d7e | 1926 | case DW_AT_abstract_origin: |
5609a71e | 1927 | func->name = find_abstract_instance_name (unit, &attr); |
06f22d7e FF |
1928 | break; |
1929 | ||
252b5132 | 1930 | case DW_AT_name: |
252b5132 RH |
1931 | /* Prefer DW_AT_MIPS_linkage_name over DW_AT_name. */ |
1932 | if (func->name == NULL) | |
482e2e37 | 1933 | func->name = attr.u.str; |
252b5132 | 1934 | break; |
98591c73 | 1935 | |
252b5132 | 1936 | case DW_AT_MIPS_linkage_name: |
482e2e37 | 1937 | func->name = attr.u.str; |
252b5132 RH |
1938 | break; |
1939 | ||
1940 | case DW_AT_low_pc: | |
a13afe8e | 1941 | low_pc = attr.u.val; |
252b5132 RH |
1942 | break; |
1943 | ||
1944 | case DW_AT_high_pc: | |
a13afe8e FF |
1945 | high_pc = attr.u.val; |
1946 | break; | |
1947 | ||
1948 | case DW_AT_ranges: | |
709d67f1 | 1949 | read_rangelist (unit, &func->arange, attr.u.val); |
252b5132 RH |
1950 | break; |
1951 | ||
5420f73d L |
1952 | case DW_AT_decl_file: |
1953 | func->file = concat_filename (unit->line_table, | |
1954 | attr.u.val); | |
1955 | break; | |
1956 | ||
1957 | case DW_AT_decl_line: | |
1958 | func->line = attr.u.val; | |
1959 | break; | |
1960 | ||
1961 | default: | |
1962 | break; | |
1963 | } | |
1964 | } | |
1965 | else if (var) | |
1966 | { | |
1967 | switch (attr.name) | |
1968 | { | |
1969 | case DW_AT_name: | |
1970 | var->name = attr.u.str; | |
1971 | break; | |
1972 | ||
1973 | case DW_AT_decl_file: | |
1974 | var->file = concat_filename (unit->line_table, | |
1975 | attr.u.val); | |
1976 | break; | |
1977 | ||
1978 | case DW_AT_decl_line: | |
1979 | var->line = attr.u.val; | |
1980 | break; | |
1981 | ||
1982 | case DW_AT_external: | |
1983 | if (attr.u.val != 0) | |
1984 | var->stack = 0; | |
1985 | break; | |
1986 | ||
1987 | case DW_AT_location: | |
5cf2e3f0 | 1988 | switch (attr.form) |
5420f73d | 1989 | { |
5cf2e3f0 L |
1990 | case DW_FORM_block: |
1991 | case DW_FORM_block1: | |
1992 | case DW_FORM_block2: | |
1993 | case DW_FORM_block4: | |
1994 | if (*attr.u.blk->data == DW_OP_addr) | |
5420f73d | 1995 | { |
5cf2e3f0 | 1996 | var->stack = 0; |
98b880f4 JW |
1997 | |
1998 | /* Verify that DW_OP_addr is the only opcode in the | |
1999 | location, in which case the block size will be 1 | |
2000 | plus the address size. */ | |
2001 | /* ??? For TLS variables, gcc can emit | |
2002 | DW_OP_addr <addr> DW_OP_GNU_push_tls_address | |
2003 | which we don't handle here yet. */ | |
2004 | if (attr.u.blk->size == unit->addr_size + 1U) | |
2005 | var->addr = bfd_get (unit->addr_size * 8, | |
2006 | unit->abfd, | |
2007 | attr.u.blk->data + 1); | |
5420f73d | 2008 | } |
5cf2e3f0 | 2009 | break; |
d8d1c398 | 2010 | |
5cf2e3f0 L |
2011 | default: |
2012 | break; | |
5420f73d L |
2013 | } |
2014 | break; | |
2015 | ||
252b5132 RH |
2016 | default: |
2017 | break; | |
2018 | } | |
2019 | } | |
2020 | } | |
2021 | ||
a13afe8e FF |
2022 | if (func && high_pc != 0) |
2023 | { | |
2024 | arange_add (unit->abfd, &func->arange, low_pc, high_pc); | |
2025 | } | |
2026 | ||
252b5132 | 2027 | if (abbrev->has_children) |
c955f9cd JW |
2028 | { |
2029 | nesting_level++; | |
2030 | ||
2031 | if (nesting_level >= nested_funcs_size) | |
2032 | { | |
2033 | struct funcinfo **tmp; | |
2034 | ||
2035 | nested_funcs_size *= 2; | |
2036 | tmp = bfd_realloc (nested_funcs, | |
2037 | (nested_funcs_size | |
2038 | * sizeof (struct funcinfo *))); | |
2039 | if (tmp == NULL) | |
2040 | { | |
2041 | free (nested_funcs); | |
2042 | return FALSE; | |
2043 | } | |
2044 | nested_funcs = tmp; | |
2045 | } | |
2046 | nested_funcs[nesting_level] = 0; | |
2047 | } | |
252b5132 RH |
2048 | } |
2049 | ||
c955f9cd | 2050 | free (nested_funcs); |
b34976b6 | 2051 | return TRUE; |
252b5132 RH |
2052 | } |
2053 | ||
5e38c3b8 MM |
2054 | /* Parse a DWARF2 compilation unit starting at INFO_PTR. This |
2055 | includes the compilation unit header that proceeds the DIE's, but | |
5c4491d3 | 2056 | does not include the length field that precedes each compilation |
5e38c3b8 | 2057 | unit header. END_PTR points one past the end of this comp unit. |
d03ba2a1 | 2058 | OFFSET_SIZE is the size of DWARF2 offsets (either 4 or 8 bytes). |
252b5132 RH |
2059 | |
2060 | This routine does not read the whole compilation unit; only enough | |
2061 | to get to the line number information for the compilation unit. */ | |
2062 | ||
2063 | static struct comp_unit * | |
0d161102 | 2064 | parse_comp_unit (struct dwarf2_debug *stash, |
818a27ac | 2065 | bfd_vma unit_length, |
f075ee0c | 2066 | bfd_byte *info_ptr_unit, |
818a27ac | 2067 | unsigned int offset_size) |
252b5132 RH |
2068 | { |
2069 | struct comp_unit* unit; | |
f46c2da6 | 2070 | unsigned int version; |
8ce8c090 | 2071 | bfd_uint64_t abbrev_offset = 0; |
f46c2da6 | 2072 | unsigned int addr_size; |
252b5132 | 2073 | struct abbrev_info** abbrevs; |
252b5132 RH |
2074 | unsigned int abbrev_number, bytes_read, i; |
2075 | struct abbrev_info *abbrev; | |
2076 | struct attribute attr; | |
f075ee0c AM |
2077 | bfd_byte *info_ptr = stash->info_ptr; |
2078 | bfd_byte *end_ptr = info_ptr + unit_length; | |
dc810e39 | 2079 | bfd_size_type amt; |
a13afe8e FF |
2080 | bfd_vma low_pc = 0; |
2081 | bfd_vma high_pc = 0; | |
0d161102 | 2082 | bfd *abfd = stash->bfd; |
3fde5a36 | 2083 | |
252b5132 RH |
2084 | version = read_2_bytes (abfd, info_ptr); |
2085 | info_ptr += 2; | |
d03ba2a1 JJ |
2086 | BFD_ASSERT (offset_size == 4 || offset_size == 8); |
2087 | if (offset_size == 4) | |
5e38c3b8 | 2088 | abbrev_offset = read_4_bytes (abfd, info_ptr); |
d03ba2a1 | 2089 | else |
5e38c3b8 | 2090 | abbrev_offset = read_8_bytes (abfd, info_ptr); |
d03ba2a1 | 2091 | info_ptr += offset_size; |
252b5132 RH |
2092 | addr_size = read_1_byte (abfd, info_ptr); |
2093 | info_ptr += 1; | |
2094 | ||
5609a71e | 2095 | if (version != 2 && version != 3) |
252b5132 | 2096 | { |
5609a71e | 2097 | (*_bfd_error_handler) (_("Dwarf Error: found dwarf version '%u', this reader only handles version 2 and 3 information."), version); |
252b5132 RH |
2098 | bfd_set_error (bfd_error_bad_value); |
2099 | return 0; | |
2100 | } | |
2101 | ||
2102 | if (addr_size > sizeof (bfd_vma)) | |
2103 | { | |
2104 | (*_bfd_error_handler) (_("Dwarf Error: found address size '%u', this reader can not handle sizes greater than '%u'."), | |
2105 | addr_size, | |
f46c2da6 | 2106 | (unsigned int) sizeof (bfd_vma)); |
252b5132 RH |
2107 | bfd_set_error (bfd_error_bad_value); |
2108 | return 0; | |
2109 | } | |
2110 | ||
ecb651f0 | 2111 | if (addr_size != 2 && addr_size != 4 && addr_size != 8) |
252b5132 | 2112 | { |
f5a3e38a | 2113 | (*_bfd_error_handler) ("Dwarf Error: found address size '%u', this reader can only handle address sizes '2', '4' and '8'.", addr_size); |
252b5132 RH |
2114 | bfd_set_error (bfd_error_bad_value); |
2115 | return 0; | |
2116 | } | |
2117 | ||
a092b084 | 2118 | /* Read the abbrevs for this compilation unit into a table. */ |
51db3708 | 2119 | abbrevs = read_abbrevs (abfd, abbrev_offset, stash); |
252b5132 RH |
2120 | if (! abbrevs) |
2121 | return 0; | |
2122 | ||
2123 | abbrev_number = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); | |
2124 | info_ptr += bytes_read; | |
2125 | if (! abbrev_number) | |
2126 | { | |
f46c2da6 | 2127 | (*_bfd_error_handler) (_("Dwarf Error: Bad abbrev number: %u."), |
252b5132 RH |
2128 | abbrev_number); |
2129 | bfd_set_error (bfd_error_bad_value); | |
2130 | return 0; | |
2131 | } | |
2132 | ||
2133 | abbrev = lookup_abbrev (abbrev_number, abbrevs); | |
2134 | if (! abbrev) | |
2135 | { | |
f46c2da6 | 2136 | (*_bfd_error_handler) (_("Dwarf Error: Could not find abbrev number %u."), |
252b5132 RH |
2137 | abbrev_number); |
2138 | bfd_set_error (bfd_error_bad_value); | |
2139 | return 0; | |
2140 | } | |
98591c73 | 2141 | |
dc810e39 | 2142 | amt = sizeof (struct comp_unit); |
818a27ac | 2143 | unit = bfd_zalloc (abfd, amt); |
252b5132 | 2144 | unit->abfd = abfd; |
5609a71e | 2145 | unit->version = version; |
98591c73 | 2146 | unit->addr_size = addr_size; |
d03ba2a1 | 2147 | unit->offset_size = offset_size; |
252b5132 RH |
2148 | unit->abbrevs = abbrevs; |
2149 | unit->end_ptr = end_ptr; | |
d03ba2a1 | 2150 | unit->stash = stash; |
c0c28ab8 | 2151 | unit->info_ptr_unit = info_ptr_unit; |
252b5132 RH |
2152 | |
2153 | for (i = 0; i < abbrev->num_attrs; ++i) | |
2154 | { | |
2155 | info_ptr = read_attribute (&attr, &abbrev->attrs[i], unit, info_ptr); | |
2156 | ||
2157 | /* Store the data if it is of an attribute we want to keep in a | |
2158 | partial symbol table. */ | |
2159 | switch (attr.name) | |
2160 | { | |
2161 | case DW_AT_stmt_list: | |
2162 | unit->stmtlist = 1; | |
482e2e37 | 2163 | unit->line_offset = attr.u.val; |
252b5132 RH |
2164 | break; |
2165 | ||
2166 | case DW_AT_name: | |
482e2e37 | 2167 | unit->name = attr.u.str; |
252b5132 RH |
2168 | break; |
2169 | ||
2170 | case DW_AT_low_pc: | |
a13afe8e FF |
2171 | low_pc = attr.u.val; |
2172 | /* If the compilation unit DIE has a DW_AT_low_pc attribute, | |
2173 | this is the base address to use when reading location | |
2174 | lists or range lists. */ | |
2175 | unit->base_address = low_pc; | |
252b5132 RH |
2176 | break; |
2177 | ||
2178 | case DW_AT_high_pc: | |
a13afe8e FF |
2179 | high_pc = attr.u.val; |
2180 | break; | |
2181 | ||
2182 | case DW_AT_ranges: | |
709d67f1 | 2183 | read_rangelist (unit, &unit->arange, attr.u.val); |
252b5132 RH |
2184 | break; |
2185 | ||
2186 | case DW_AT_comp_dir: | |
2187 | { | |
f075ee0c | 2188 | char *comp_dir = attr.u.str; |
252b5132 RH |
2189 | if (comp_dir) |
2190 | { | |
2191 | /* Irix 6.2 native cc prepends <machine>.: to the compilation | |
2192 | directory, get rid of it. */ | |
818a27ac | 2193 | char *cp = strchr (comp_dir, ':'); |
252b5132 RH |
2194 | |
2195 | if (cp && cp != comp_dir && cp[-1] == '.' && cp[1] == '/') | |
2196 | comp_dir = cp + 1; | |
2197 | } | |
2198 | unit->comp_dir = comp_dir; | |
2199 | break; | |
2200 | } | |
2201 | ||
2202 | default: | |
2203 | break; | |
2204 | } | |
2205 | } | |
a13afe8e | 2206 | if (high_pc != 0) |
709d67f1 AM |
2207 | { |
2208 | arange_add (unit->abfd, &unit->arange, low_pc, high_pc); | |
2209 | } | |
252b5132 RH |
2210 | |
2211 | unit->first_child_die_ptr = info_ptr; | |
2212 | return unit; | |
2213 | } | |
2214 | ||
6dd55cb7 L |
2215 | /* Return TRUE if UNIT may contain the address given by ADDR. When |
2216 | there are functions written entirely with inline asm statements, the | |
2217 | range info in the compilation unit header may not be correct. We | |
2218 | need to consult the line info table to see if a compilation unit | |
2219 | really contains the given address. */ | |
252b5132 | 2220 | |
b34976b6 | 2221 | static bfd_boolean |
818a27ac | 2222 | comp_unit_contains_address (struct comp_unit *unit, bfd_vma addr) |
252b5132 | 2223 | { |
709d67f1 AM |
2224 | struct arange *arange; |
2225 | ||
2226 | if (unit->error) | |
2227 | return FALSE; | |
2228 | ||
2229 | arange = &unit->arange; | |
2230 | do | |
2231 | { | |
2232 | if (addr >= arange->low && addr < arange->high) | |
2233 | return TRUE; | |
2234 | arange = arange->next; | |
2235 | } | |
2236 | while (arange); | |
2237 | ||
2238 | return FALSE; | |
252b5132 RH |
2239 | } |
2240 | ||
252b5132 RH |
2241 | /* If UNIT contains ADDR, set the output parameters to the values for |
2242 | the line containing ADDR. The output parameters, FILENAME_PTR, | |
2243 | FUNCTIONNAME_PTR, and LINENUMBER_PTR, are pointers to the objects | |
98591c73 | 2244 | to be filled in. |
252b5132 | 2245 | |
ab3acfbe | 2246 | Return TRUE if UNIT contains ADDR, and no errors were encountered; |
b34976b6 | 2247 | FALSE otherwise. */ |
252b5132 | 2248 | |
b34976b6 | 2249 | static bfd_boolean |
818a27ac AM |
2250 | comp_unit_find_nearest_line (struct comp_unit *unit, |
2251 | bfd_vma addr, | |
2252 | const char **filename_ptr, | |
2253 | const char **functionname_ptr, | |
2254 | unsigned int *linenumber_ptr, | |
2255 | struct dwarf2_debug *stash) | |
252b5132 | 2256 | { |
b34976b6 AM |
2257 | bfd_boolean line_p; |
2258 | bfd_boolean func_p; | |
1ee24f27 | 2259 | struct funcinfo *function; |
98591c73 | 2260 | |
252b5132 | 2261 | if (unit->error) |
b34976b6 | 2262 | return FALSE; |
252b5132 RH |
2263 | |
2264 | if (! unit->line_table) | |
2265 | { | |
2266 | if (! unit->stmtlist) | |
2267 | { | |
2268 | unit->error = 1; | |
b34976b6 | 2269 | return FALSE; |
252b5132 | 2270 | } |
98591c73 | 2271 | |
51db3708 | 2272 | unit->line_table = decode_line_info (unit, stash); |
252b5132 RH |
2273 | |
2274 | if (! unit->line_table) | |
2275 | { | |
2276 | unit->error = 1; | |
b34976b6 | 2277 | return FALSE; |
252b5132 | 2278 | } |
98591c73 | 2279 | |
3f5864e1 | 2280 | if (unit->first_child_die_ptr < unit->end_ptr |
5420f73d | 2281 | && ! scan_unit_for_symbols (unit)) |
252b5132 RH |
2282 | { |
2283 | unit->error = 1; | |
b34976b6 | 2284 | return FALSE; |
252b5132 RH |
2285 | } |
2286 | } | |
2287 | ||
1ee24f27 | 2288 | function = NULL; |
4ab527b0 | 2289 | func_p = lookup_address_in_function_table (unit, addr, |
e2f6d277 | 2290 | &function, functionname_ptr); |
4ab527b0 FF |
2291 | if (func_p && (function->tag == DW_TAG_inlined_subroutine)) |
2292 | stash->inliner_chain = function; | |
e2f6d277 NC |
2293 | line_p = lookup_address_in_line_info_table (unit->line_table, addr, |
2294 | function, filename_ptr, | |
252b5132 | 2295 | linenumber_ptr); |
b34976b6 | 2296 | return line_p || func_p; |
252b5132 RH |
2297 | } |
2298 | ||
bd210d54 NC |
2299 | /* Check to see if line info is already decoded in a comp_unit. |
2300 | If not, decode it. Returns TRUE if no errors were encountered; | |
5420f73d L |
2301 | FALSE otherwise. */ |
2302 | ||
2303 | static bfd_boolean | |
bd210d54 NC |
2304 | comp_unit_maybe_decode_line_info (struct comp_unit *unit, |
2305 | struct dwarf2_debug *stash) | |
5420f73d L |
2306 | { |
2307 | if (unit->error) | |
2308 | return FALSE; | |
2309 | ||
2310 | if (! unit->line_table) | |
2311 | { | |
2312 | if (! unit->stmtlist) | |
2313 | { | |
2314 | unit->error = 1; | |
2315 | return FALSE; | |
2316 | } | |
2317 | ||
2318 | unit->line_table = decode_line_info (unit, stash); | |
2319 | ||
2320 | if (! unit->line_table) | |
2321 | { | |
2322 | unit->error = 1; | |
2323 | return FALSE; | |
2324 | } | |
2325 | ||
2326 | if (unit->first_child_die_ptr < unit->end_ptr | |
2327 | && ! scan_unit_for_symbols (unit)) | |
2328 | { | |
2329 | unit->error = 1; | |
2330 | return FALSE; | |
2331 | } | |
2332 | } | |
2333 | ||
bd210d54 NC |
2334 | return TRUE; |
2335 | } | |
2336 | ||
2337 | /* If UNIT contains SYM at ADDR, set the output parameters to the | |
2338 | values for the line containing SYM. The output parameters, | |
2339 | FILENAME_PTR, and LINENUMBER_PTR, are pointers to the objects to be | |
2340 | filled in. | |
2341 | ||
2342 | Return TRUE if UNIT contains SYM, and no errors were encountered; | |
2343 | FALSE otherwise. */ | |
2344 | ||
2345 | static bfd_boolean | |
2346 | comp_unit_find_line (struct comp_unit *unit, | |
2347 | asymbol *sym, | |
2348 | bfd_vma addr, | |
2349 | const char **filename_ptr, | |
2350 | unsigned int *linenumber_ptr, | |
2351 | struct dwarf2_debug *stash) | |
2352 | { | |
2353 | if (!comp_unit_maybe_decode_line_info (unit, stash)) | |
2354 | return FALSE; | |
2355 | ||
5420f73d L |
2356 | if (sym->flags & BSF_FUNCTION) |
2357 | return lookup_symbol_in_function_table (unit, sym, addr, | |
2358 | filename_ptr, | |
2359 | linenumber_ptr); | |
bd210d54 NC |
2360 | |
2361 | return lookup_symbol_in_variable_table (unit, sym, addr, | |
2362 | filename_ptr, | |
2363 | linenumber_ptr); | |
2364 | } | |
2365 | ||
2366 | static struct funcinfo * | |
2367 | reverse_funcinfo_list (struct funcinfo *head) | |
2368 | { | |
2369 | struct funcinfo *rhead; | |
2370 | struct funcinfo *temp; | |
2371 | ||
2372 | for (rhead = NULL; head; head = temp) | |
2373 | { | |
2374 | temp = head->prev_func; | |
2375 | head->prev_func = rhead; | |
2376 | rhead = head; | |
2377 | } | |
2378 | return rhead; | |
2379 | } | |
2380 | ||
2381 | static struct varinfo * | |
2382 | reverse_varinfo_list (struct varinfo *head) | |
2383 | { | |
2384 | struct varinfo *rhead; | |
2385 | struct varinfo *temp; | |
2386 | ||
2387 | for (rhead = NULL; head; head = temp) | |
2388 | { | |
2389 | temp = head->prev_var; | |
2390 | head->prev_var = rhead; | |
2391 | rhead = head; | |
2392 | } | |
2393 | return rhead; | |
2394 | } | |
2395 | ||
2396 | /* Extract all interesting funcinfos and varinfos of a compilation | |
2397 | unit into hash tables for faster lookup. Returns TRUE if no | |
2398 | errors were enountered; FALSE otherwise. */ | |
2399 | ||
2400 | static bfd_boolean | |
2401 | comp_unit_hash_info (struct dwarf2_debug *stash, | |
2402 | struct comp_unit *unit, | |
2403 | struct info_hash_table *funcinfo_hash_table, | |
2404 | struct info_hash_table *varinfo_hash_table) | |
2405 | { | |
2406 | struct funcinfo* each_func; | |
2407 | struct varinfo* each_var; | |
2408 | bfd_boolean okay = TRUE; | |
2409 | ||
2410 | BFD_ASSERT (stash->info_hash_status != STASH_INFO_HASH_DISABLED); | |
2411 | ||
2412 | if (!comp_unit_maybe_decode_line_info (unit, stash)) | |
2413 | return FALSE; | |
2414 | ||
2415 | BFD_ASSERT (!unit->cached); | |
2416 | ||
2417 | /* To preserve the original search order, we went to visit the function | |
2418 | infos in the reversed order of the list. However, making the list | |
2419 | bi-directional use quite a bit of extra memory. So we reverse | |
2420 | the list first, traverse the list in the now reversed order and | |
2421 | finally reverse the list again to get back the original order. */ | |
2422 | unit->function_table = reverse_funcinfo_list (unit->function_table); | |
2423 | for (each_func = unit->function_table; | |
2424 | each_func && okay; | |
2425 | each_func = each_func->prev_func) | |
2426 | { | |
2427 | /* Skip nameless functions. */ | |
2428 | if (each_func->name) | |
2429 | /* There is no need to copy name string into hash table as | |
2430 | name string is either in the dwarf string buffer or | |
2431 | info in the stash. */ | |
2432 | okay = insert_info_hash_table (funcinfo_hash_table, each_func->name, | |
2433 | (void*) each_func, FALSE); | |
2434 | } | |
2435 | unit->function_table = reverse_funcinfo_list (unit->function_table); | |
2436 | if (!okay) | |
2437 | return FALSE; | |
2438 | ||
2439 | /* We do the same for variable infos. */ | |
2440 | unit->variable_table = reverse_varinfo_list (unit->variable_table); | |
2441 | for (each_var = unit->variable_table; | |
2442 | each_var && okay; | |
2443 | each_var = each_var->prev_var) | |
2444 | { | |
2445 | /* Skip stack vars and vars with no files or names. */ | |
2446 | if (each_var->stack == 0 | |
2447 | && each_var->file != NULL | |
2448 | && each_var->name != NULL) | |
2449 | /* There is no need to copy name string into hash table as | |
2450 | name string is either in the dwarf string buffer or | |
2451 | info in the stash. */ | |
2452 | okay = insert_info_hash_table (varinfo_hash_table, each_var->name, | |
2453 | (void*) each_var, FALSE); | |
2454 | } | |
2455 | ||
2456 | unit->variable_table = reverse_varinfo_list (unit->variable_table); | |
2457 | unit->cached = TRUE; | |
2458 | return okay; | |
5420f73d L |
2459 | } |
2460 | ||
e2f6d277 NC |
2461 | /* Locate a section in a BFD containing debugging info. The search starts |
2462 | from the section after AFTER_SEC, or from the first section in the BFD if | |
2463 | AFTER_SEC is NULL. The search works by examining the names of the | |
2464 | sections. There are two permissiable names. The first is .debug_info. | |
2465 | This is the standard DWARF2 name. The second is a prefix .gnu.linkonce.wi. | |
2466 | This is a variation on the .debug_info section which has a checksum | |
2467 | describing the contents appended onto the name. This allows the linker to | |
2468 | identify and discard duplicate debugging sections for different | |
2469 | compilation units. */ | |
a092b084 | 2470 | #define DWARF2_DEBUG_INFO ".debug_info" |
1b315056 | 2471 | #define DWARF2_COMPRESSED_DEBUG_INFO ".zdebug_info" |
a092b084 NC |
2472 | #define GNU_LINKONCE_INFO ".gnu.linkonce.wi." |
2473 | ||
2474 | static asection * | |
818a27ac | 2475 | find_debug_info (bfd *abfd, asection *after_sec) |
a092b084 NC |
2476 | { |
2477 | asection * msec; | |
2478 | ||
0d161102 | 2479 | msec = after_sec != NULL ? after_sec->next : abfd->sections; |
a092b084 NC |
2480 | |
2481 | while (msec) | |
2482 | { | |
2483 | if (strcmp (msec->name, DWARF2_DEBUG_INFO) == 0) | |
2484 | return msec; | |
2485 | ||
1b315056 CS |
2486 | if (strcmp (msec->name, DWARF2_COMPRESSED_DEBUG_INFO) == 0) |
2487 | return msec; | |
2488 | ||
0112cd26 | 2489 | if (CONST_STRNEQ (msec->name, GNU_LINKONCE_INFO)) |
a092b084 NC |
2490 | return msec; |
2491 | ||
2492 | msec = msec->next; | |
2493 | } | |
2494 | ||
2495 | return NULL; | |
2496 | } | |
2497 | ||
5609a71e | 2498 | /* Unset vmas for adjusted sections in STASH. */ |
d4c32a81 L |
2499 | |
2500 | static void | |
2501 | unset_sections (struct dwarf2_debug *stash) | |
2502 | { | |
2503 | unsigned int i; | |
5609a71e | 2504 | struct adjusted_section *p; |
d4c32a81 | 2505 | |
5609a71e DJ |
2506 | i = stash->adjusted_section_count; |
2507 | p = stash->adjusted_sections; | |
d4c32a81 L |
2508 | for (; i > 0; i--, p++) |
2509 | p->section->vma = 0; | |
2510 | } | |
2511 | ||
5609a71e DJ |
2512 | /* Set unique VMAs for loadable and DWARF sections in ABFD and save |
2513 | VMAs in STASH for unset_sections. */ | |
35ccda9e L |
2514 | |
2515 | static bfd_boolean | |
d4c32a81 | 2516 | place_sections (bfd *abfd, struct dwarf2_debug *stash) |
35ccda9e | 2517 | { |
5609a71e | 2518 | struct adjusted_section *p; |
d4c32a81 L |
2519 | unsigned int i; |
2520 | ||
5609a71e | 2521 | if (stash->adjusted_section_count != 0) |
35ccda9e | 2522 | { |
5609a71e DJ |
2523 | i = stash->adjusted_section_count; |
2524 | p = stash->adjusted_sections; | |
d4c32a81 L |
2525 | for (; i > 0; i--, p++) |
2526 | p->section->vma = p->adj_vma; | |
2527 | } | |
2528 | else | |
2529 | { | |
2530 | asection *sect; | |
5609a71e | 2531 | bfd_vma last_vma = 0, last_dwarf = 0; |
d4c32a81 | 2532 | bfd_size_type amt; |
5609a71e | 2533 | struct adjusted_section *p; |
35ccda9e | 2534 | |
d4c32a81 L |
2535 | i = 0; |
2536 | for (sect = abfd->sections; sect != NULL; sect = sect->next) | |
35ccda9e | 2537 | { |
d4c32a81 | 2538 | bfd_size_type sz; |
5609a71e DJ |
2539 | int is_debug_info; |
2540 | ||
2541 | if (sect->vma != 0) | |
2542 | continue; | |
2543 | ||
2544 | /* We need to adjust the VMAs of any .debug_info sections. | |
2545 | Skip compressed ones, since no relocations could target | |
2546 | them - they should not appear in object files anyway. */ | |
2547 | if (strcmp (sect->name, DWARF2_DEBUG_INFO) == 0) | |
2548 | is_debug_info = 1; | |
2549 | else if (CONST_STRNEQ (sect->name, GNU_LINKONCE_INFO)) | |
2550 | is_debug_info = 1; | |
2551 | else | |
2552 | is_debug_info = 0; | |
d4c32a81 | 2553 | |
5609a71e | 2554 | if (!is_debug_info && (sect->flags & SEC_LOAD) == 0) |
d4c32a81 L |
2555 | continue; |
2556 | ||
2557 | sz = sect->rawsize ? sect->rawsize : sect->size; | |
2558 | if (sz == 0) | |
2559 | continue; | |
2560 | ||
2561 | i++; | |
2562 | } | |
2563 | ||
5609a71e DJ |
2564 | amt = i * sizeof (struct adjusted_section); |
2565 | p = (struct adjusted_section *) bfd_zalloc (abfd, amt); | |
d4c32a81 L |
2566 | if (! p) |
2567 | return FALSE; | |
2568 | ||
5609a71e DJ |
2569 | stash->adjusted_sections = p; |
2570 | stash->adjusted_section_count = i; | |
d4c32a81 L |
2571 | |
2572 | for (sect = abfd->sections; sect != NULL; sect = sect->next) | |
2573 | { | |
2574 | bfd_size_type sz; | |
5609a71e | 2575 | int is_debug_info; |
d4c32a81 | 2576 | |
5609a71e DJ |
2577 | if (sect->vma != 0) |
2578 | continue; | |
2579 | ||
2580 | /* We need to adjust the VMAs of any .debug_info sections. | |
2581 | Skip compressed ones, since no relocations could target | |
2582 | them - they should not appear in object files anyway. */ | |
2583 | if (strcmp (sect->name, DWARF2_DEBUG_INFO) == 0) | |
2584 | is_debug_info = 1; | |
2585 | else if (CONST_STRNEQ (sect->name, GNU_LINKONCE_INFO)) | |
2586 | is_debug_info = 1; | |
2587 | else | |
2588 | is_debug_info = 0; | |
2589 | ||
2590 | if (!is_debug_info && (sect->flags & SEC_LOAD) == 0) | |
d4c32a81 L |
2591 | continue; |
2592 | ||
2593 | sz = sect->rawsize ? sect->rawsize : sect->size; | |
2594 | if (sz == 0) | |
2595 | continue; | |
2596 | ||
2597 | p->section = sect; | |
5609a71e DJ |
2598 | if (is_debug_info) |
2599 | { | |
2600 | BFD_ASSERT (sect->alignment_power == 0); | |
2601 | sect->vma = last_dwarf; | |
2602 | last_dwarf += sz; | |
2603 | } | |
2604 | else if (last_vma != 0) | |
d4c32a81 L |
2605 | { |
2606 | /* Align the new address to the current section | |
2607 | alignment. */ | |
2608 | last_vma = ((last_vma | |
2609 | + ~((bfd_vma) -1 << sect->alignment_power)) | |
2610 | & ((bfd_vma) -1 << sect->alignment_power)); | |
2611 | sect->vma = last_vma; | |
5609a71e | 2612 | last_vma += sect->vma + sz; |
d4c32a81 | 2613 | } |
5609a71e DJ |
2614 | else |
2615 | last_vma += sect->vma + sz; | |
2616 | ||
d4c32a81 | 2617 | p->adj_vma = sect->vma; |
d4c32a81 L |
2618 | |
2619 | p++; | |
35ccda9e L |
2620 | } |
2621 | } | |
2622 | ||
2623 | return TRUE; | |
2624 | } | |
2625 | ||
bd210d54 NC |
2626 | /* Look up a funcinfo by name using the given info hash table. If found, |
2627 | also update the locations pointed to by filename_ptr and linenumber_ptr. | |
2628 | ||
2629 | This function returns TRUE if a funcinfo that matches the given symbol | |
2630 | and address is found with any error; otherwise it returns FALSE. */ | |
2631 | ||
2632 | static bfd_boolean | |
2633 | info_hash_lookup_funcinfo (struct info_hash_table *hash_table, | |
2634 | asymbol *sym, | |
2635 | bfd_vma addr, | |
2636 | const char **filename_ptr, | |
2637 | unsigned int *linenumber_ptr) | |
2638 | { | |
2639 | struct funcinfo* each_func; | |
2640 | struct funcinfo* best_fit = NULL; | |
2641 | struct info_list_node *node; | |
2642 | struct arange *arange; | |
2643 | const char *name = bfd_asymbol_name (sym); | |
2644 | asection *sec = bfd_get_section (sym); | |
2645 | ||
2646 | for (node = lookup_info_hash_table (hash_table, name); | |
2647 | node; | |
2648 | node = node->next) | |
2649 | { | |
2650 | each_func = node->info; | |
2651 | for (arange = &each_func->arange; | |
2652 | arange; | |
2653 | arange = arange->next) | |
2654 | { | |
2655 | if ((!each_func->sec || each_func->sec == sec) | |
2656 | && addr >= arange->low | |
2657 | && addr < arange->high | |
2658 | && (!best_fit | |
2659 | || ((arange->high - arange->low) | |
2660 | < (best_fit->arange.high - best_fit->arange.low)))) | |
2661 | best_fit = each_func; | |
2662 | } | |
2663 | } | |
2664 | ||
2665 | if (best_fit) | |
2666 | { | |
2667 | best_fit->sec = sec; | |
2668 | *filename_ptr = best_fit->file; | |
2669 | *linenumber_ptr = best_fit->line; | |
2670 | return TRUE; | |
2671 | } | |
2672 | ||
2673 | return FALSE; | |
2674 | } | |
2675 | ||
2676 | /* Look up a varinfo by name using the given info hash table. If found, | |
2677 | also update the locations pointed to by filename_ptr and linenumber_ptr. | |
2678 | ||
2679 | This function returns TRUE if a varinfo that matches the given symbol | |
2680 | and address is found with any error; otherwise it returns FALSE. */ | |
2681 | ||
2682 | static bfd_boolean | |
2683 | info_hash_lookup_varinfo (struct info_hash_table *hash_table, | |
2684 | asymbol *sym, | |
2685 | bfd_vma addr, | |
2686 | const char **filename_ptr, | |
2687 | unsigned int *linenumber_ptr) | |
2688 | { | |
2689 | const char *name = bfd_asymbol_name (sym); | |
2690 | asection *sec = bfd_get_section (sym); | |
2691 | struct varinfo* each; | |
2692 | struct info_list_node *node; | |
2693 | ||
2694 | for (node = lookup_info_hash_table (hash_table, name); | |
2695 | node; | |
2696 | node = node->next) | |
2697 | { | |
2698 | each = node->info; | |
2699 | if (each->addr == addr | |
2700 | && (!each->sec || each->sec == sec)) | |
2701 | { | |
2702 | each->sec = sec; | |
2703 | *filename_ptr = each->file; | |
2704 | *linenumber_ptr = each->line; | |
2705 | return TRUE; | |
2706 | } | |
2707 | } | |
2708 | ||
2709 | return FALSE; | |
2710 | } | |
2711 | ||
2712 | /* Update the funcinfo and varinfo info hash tables if they are | |
2713 | not up to date. Returns TRUE if there is no error; otherwise | |
2714 | returns FALSE and disable the info hash tables. */ | |
2715 | ||
2716 | static bfd_boolean | |
2717 | stash_maybe_update_info_hash_tables (struct dwarf2_debug *stash) | |
2718 | { | |
2719 | struct comp_unit *each; | |
2720 | ||
2721 | /* Exit if hash tables are up-to-date. */ | |
2722 | if (stash->all_comp_units == stash->hash_units_head) | |
2723 | return TRUE; | |
2724 | ||
2725 | if (stash->hash_units_head) | |
2726 | each = stash->hash_units_head->prev_unit; | |
2727 | else | |
2728 | each = stash->last_comp_unit; | |
2729 | ||
2730 | while (each) | |
2731 | { | |
2732 | if (!comp_unit_hash_info (stash, each, stash->funcinfo_hash_table, | |
2733 | stash->varinfo_hash_table)) | |
2734 | { | |
2735 | stash->info_hash_status = STASH_INFO_HASH_DISABLED; | |
2736 | return FALSE; | |
2737 | } | |
2738 | each = each->prev_unit; | |
2739 | } | |
2740 | ||
2741 | stash->hash_units_head = stash->all_comp_units; | |
2742 | return TRUE; | |
2743 | } | |
2744 | ||
2745 | /* Check consistency of info hash tables. This is for debugging only. */ | |
2746 | ||
2747 | static void ATTRIBUTE_UNUSED | |
2748 | stash_verify_info_hash_table (struct dwarf2_debug *stash) | |
2749 | { | |
2750 | struct comp_unit *each_unit; | |
2751 | struct funcinfo *each_func; | |
2752 | struct varinfo *each_var; | |
2753 | struct info_list_node *node; | |
2754 | bfd_boolean found; | |
2755 | ||
2756 | for (each_unit = stash->all_comp_units; | |
2757 | each_unit; | |
2758 | each_unit = each_unit->next_unit) | |
2759 | { | |
2760 | for (each_func = each_unit->function_table; | |
2761 | each_func; | |
2762 | each_func = each_func->prev_func) | |
2763 | { | |
2764 | if (!each_func->name) | |
2765 | continue; | |
2766 | node = lookup_info_hash_table (stash->funcinfo_hash_table, | |
2767 | each_func->name); | |
2768 | BFD_ASSERT (node); | |
2769 | found = FALSE; | |
2770 | while (node && !found) | |
2771 | { | |
2772 | found = node->info == each_func; | |
2773 | node = node->next; | |
2774 | } | |
2775 | BFD_ASSERT (found); | |
2776 | } | |
2777 | ||
2778 | for (each_var = each_unit->variable_table; | |
2779 | each_var; | |
2780 | each_var = each_var->prev_var) | |
2781 | { | |
2782 | if (!each_var->name || !each_var->file || each_var->stack) | |
2783 | continue; | |
2784 | node = lookup_info_hash_table (stash->varinfo_hash_table, | |
2785 | each_var->name); | |
2786 | BFD_ASSERT (node); | |
2787 | found = FALSE; | |
2788 | while (node && !found) | |
2789 | { | |
2790 | found = node->info == each_var; | |
2791 | node = node->next; | |
2792 | } | |
2793 | BFD_ASSERT (found); | |
2794 | } | |
2795 | } | |
2796 | } | |
2797 | ||
2798 | /* Check to see if we want to enable the info hash tables, which consume | |
2799 | quite a bit of memory. Currently we only check the number times | |
2800 | bfd_dwarf2_find_line is called. In the future, we may also want to | |
2801 | take the number of symbols into account. */ | |
2802 | ||
2803 | static void | |
2804 | stash_maybe_enable_info_hash_tables (bfd *abfd, struct dwarf2_debug *stash) | |
2805 | { | |
2806 | BFD_ASSERT (stash->info_hash_status == STASH_INFO_HASH_OFF); | |
2807 | ||
2808 | if (stash->info_hash_count++ < STASH_INFO_HASH_TRIGGER) | |
2809 | return; | |
2810 | ||
2811 | /* FIXME: Maybe we should check the reduce_memory_overheads | |
2812 | and optimize fields in the bfd_link_info structure ? */ | |
2813 | ||
2814 | /* Create hash tables. */ | |
2815 | stash->funcinfo_hash_table = create_info_hash_table (abfd); | |
2816 | stash->varinfo_hash_table = create_info_hash_table (abfd); | |
2817 | if (!stash->funcinfo_hash_table || !stash->varinfo_hash_table) | |
2818 | { | |
2819 | /* Turn off info hashes if any allocation above fails. */ | |
2820 | stash->info_hash_status = STASH_INFO_HASH_DISABLED; | |
2821 | return; | |
2822 | } | |
2823 | /* We need a forced update so that the info hash tables will | |
2824 | be created even though there is no compilation unit. That | |
2825 | happens if STASH_INFO_HASH_TRIGGER is 0. */ | |
2826 | stash_maybe_update_info_hash_tables (stash); | |
2827 | stash->info_hash_status = STASH_INFO_HASH_ON; | |
2828 | } | |
2829 | ||
2830 | /* Find the file and line associated with a symbol and address using the | |
2831 | info hash tables of a stash. If there is a match, the function returns | |
2832 | TRUE and update the locations pointed to by filename_ptr and linenumber_ptr; | |
2833 | otherwise it returns FALSE. */ | |
2834 | ||
2835 | static bfd_boolean | |
2836 | stash_find_line_fast (struct dwarf2_debug *stash, | |
2837 | asymbol *sym, | |
2838 | bfd_vma addr, | |
2839 | const char **filename_ptr, | |
2840 | unsigned int *linenumber_ptr) | |
2841 | { | |
2842 | BFD_ASSERT (stash->info_hash_status == STASH_INFO_HASH_ON); | |
2843 | ||
2844 | if (sym->flags & BSF_FUNCTION) | |
2845 | return info_hash_lookup_funcinfo (stash->funcinfo_hash_table, sym, addr, | |
2846 | filename_ptr, linenumber_ptr); | |
2847 | return info_hash_lookup_varinfo (stash->varinfo_hash_table, sym, addr, | |
2848 | filename_ptr, linenumber_ptr); | |
2849 | } | |
2850 | ||
bec42b15 NC |
2851 | /* Find the source code location of SYMBOL. If SYMBOL is NULL |
2852 | then find the nearest source code location corresponding to | |
2853 | the address SECTION + OFFSET. | |
2854 | Returns TRUE if the line is found without error and fills in | |
2855 | FILENAME_PTR and LINENUMBER_PTR. In the case where SYMBOL was | |
2856 | NULL the FUNCTIONNAME_PTR is also filled in. | |
2857 | SYMBOLS contains the symbol table for ABFD. | |
2858 | ADDR_SIZE is the number of bytes in the initial .debug_info length | |
2859 | field and in the abbreviation offset, or zero to indicate that the | |
2860 | default value should be used. */ | |
252b5132 | 2861 | |
bec42b15 NC |
2862 | static bfd_boolean |
2863 | find_line (bfd *abfd, | |
2864 | asection *section, | |
2865 | bfd_vma offset, | |
2866 | asymbol *symbol, | |
2867 | asymbol **symbols, | |
2868 | const char **filename_ptr, | |
2869 | const char **functionname_ptr, | |
2870 | unsigned int *linenumber_ptr, | |
2871 | unsigned int addr_size, | |
2872 | void **pinfo) | |
252b5132 RH |
2873 | { |
2874 | /* Read each compilation unit from the section .debug_info, and check | |
2875 | to see if it contains the address we are searching for. If yes, | |
2876 | lookup the address, and return the line number info. If no, go | |
98591c73 | 2877 | on to the next compilation unit. |
252b5132 RH |
2878 | |
2879 | We keep a list of all the previously read compilation units, and | |
98591c73 | 2880 | a pointer to the next un-read compilation unit. Check the |
a092b084 | 2881 | previously read units before reading more. */ |
1ba54ee0 | 2882 | struct dwarf2_debug *stash; |
a092b084 | 2883 | /* What address are we looking for? */ |
1ba54ee0 | 2884 | bfd_vma addr; |
252b5132 | 2885 | struct comp_unit* each; |
d4c32a81 | 2886 | bfd_vma found = FALSE; |
bec42b15 | 2887 | bfd_boolean do_line; |
d4c32a81 | 2888 | |
1ba54ee0 | 2889 | stash = *pinfo; |
d4c32a81 L |
2890 | |
2891 | if (! stash) | |
2892 | { | |
2893 | bfd_size_type amt = sizeof (struct dwarf2_debug); | |
2894 | ||
2895 | stash = bfd_zalloc (abfd, amt); | |
2896 | if (! stash) | |
2897 | return FALSE; | |
2898 | } | |
2899 | ||
2900 | /* In a relocatable file, 2 functions may have the same address. | |
2901 | We change the section vma so that they won't overlap. */ | |
2902 | if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0) | |
2903 | { | |
2904 | if (! place_sections (abfd, stash)) | |
2905 | return FALSE; | |
2906 | } | |
2907 | ||
bec42b15 NC |
2908 | do_line = (section == NULL |
2909 | && offset == 0 | |
2910 | && functionname_ptr == NULL | |
2911 | && symbol != NULL); | |
2912 | if (do_line) | |
2913 | { | |
2914 | addr = symbol->value; | |
2915 | section = bfd_get_section (symbol); | |
2916 | } | |
2917 | else if (section != NULL | |
2918 | && functionname_ptr != NULL | |
2919 | && symbol == NULL) | |
2920 | addr = offset; | |
2921 | else | |
2922 | abort (); | |
2923 | ||
1ba54ee0 | 2924 | if (section->output_section) |
6dd55cb7 | 2925 | addr += section->output_section->vma + section->output_offset; |
1ba54ee0 | 2926 | else |
6dd55cb7 | 2927 | addr += section->vma; |
252b5132 | 2928 | *filename_ptr = NULL; |
6b33789f NC |
2929 | if (! do_line) |
2930 | *functionname_ptr = NULL; | |
252b5132 RH |
2931 | *linenumber_ptr = 0; |
2932 | ||
d4c32a81 | 2933 | if (! *pinfo) |
252b5132 | 2934 | { |
0d161102 | 2935 | bfd *debug_bfd; |
dc810e39 | 2936 | bfd_size_type total_size; |
252b5132 | 2937 | asection *msec; |
252b5132 | 2938 | |
818a27ac | 2939 | *pinfo = stash; |
3fde5a36 | 2940 | |
a092b084 | 2941 | msec = find_debug_info (abfd, NULL); |
0d161102 NC |
2942 | if (msec == NULL) |
2943 | { | |
0d4a1476 | 2944 | char * debug_filename = bfd_follow_gnu_debuglink (abfd, DEBUGDIR); |
0d161102 NC |
2945 | |
2946 | if (debug_filename == NULL) | |
2947 | /* No dwarf2 info, and no gnu_debuglink to follow. | |
2948 | Note that at this point the stash has been allocated, but | |
2949 | contains zeros. This lets future calls to this function | |
2950 | fail more quickly. */ | |
2951 | goto done; | |
2952 | ||
2953 | if ((debug_bfd = bfd_openr (debug_filename, NULL)) == NULL | |
2954 | || ! bfd_check_format (debug_bfd, bfd_object) | |
2955 | || (msec = find_debug_info (debug_bfd, NULL)) == NULL) | |
2956 | { | |
2957 | if (debug_bfd) | |
2958 | bfd_close (debug_bfd); | |
2959 | /* FIXME: Should we report our failure to follow the debuglink ? */ | |
2960 | free (debug_filename); | |
2961 | goto done; | |
2962 | } | |
2963 | } | |
2964 | else | |
2965 | debug_bfd = abfd; | |
a092b084 | 2966 | |
1b315056 | 2967 | /* There can be more than one DWARF2 info section in a BFD these |
2d47a72c DJ |
2968 | days. First handle the easy case when there's only one. If |
2969 | there's more than one, try case two: none of the sections is | |
2970 | compressed. In that case, read them all in and produce one | |
2971 | large stash. We do this in two passes - in the first pass we | |
2972 | just accumulate the section sizes, and in the second pass we | |
2973 | read in the section's contents. (The allows us to avoid | |
2974 | reallocing the data as we add sections to the stash.) If | |
2975 | some or all sections are compressed, then do things the slow | |
2976 | way, with a bunch of reallocs. */ | |
1b315056 CS |
2977 | |
2978 | if (! find_debug_info (debug_bfd, msec)) | |
2d47a72c DJ |
2979 | { |
2980 | /* Case 1: only one info section. */ | |
2981 | total_size = msec->size; | |
2982 | if (! read_section (debug_bfd, ".debug_info", ".zdebug_info", | |
9e32b19f DJ |
2983 | symbols, 0, |
2984 | &stash->info_ptr_memory, &total_size)) | |
2d47a72c | 2985 | goto done; |
2d47a72c | 2986 | } |
1b315056 | 2987 | else |
2d47a72c DJ |
2988 | { |
2989 | int all_uncompressed = 1; | |
2990 | for (total_size = 0; msec; msec = find_debug_info (debug_bfd, msec)) | |
2991 | { | |
2992 | total_size += msec->size; | |
2993 | if (strcmp (msec->name, DWARF2_COMPRESSED_DEBUG_INFO) == 0) | |
9e32b19f | 2994 | all_uncompressed = 0; |
2d47a72c DJ |
2995 | } |
2996 | if (all_uncompressed) | |
2997 | { | |
2998 | /* Case 2: multiple sections, but none is compressed. */ | |
2999 | stash->info_ptr_memory = bfd_malloc (total_size); | |
3000 | if (stash->info_ptr_memory == NULL) | |
3001 | goto done; | |
3002 | ||
5d0900eb | 3003 | total_size = 0; |
2d47a72c DJ |
3004 | for (msec = find_debug_info (debug_bfd, NULL); |
3005 | msec; | |
3006 | msec = find_debug_info (debug_bfd, msec)) | |
3007 | { | |
3008 | bfd_size_type size; | |
2d47a72c DJ |
3009 | |
3010 | size = msec->size; | |
3011 | if (size == 0) | |
3012 | continue; | |
3013 | ||
5d0900eb AM |
3014 | if (!(bfd_simple_get_relocated_section_contents |
3015 | (debug_bfd, msec, stash->info_ptr_memory + total_size, | |
3016 | symbols))) | |
3017 | goto done; | |
2d47a72c | 3018 | |
5d0900eb | 3019 | total_size += size; |
2d47a72c | 3020 | } |
2d47a72c DJ |
3021 | } |
3022 | else | |
3023 | { | |
3024 | /* Case 3: multiple sections, some or all compressed. */ | |
5d0900eb AM |
3025 | stash->info_ptr_memory = NULL; |
3026 | total_size = 0; | |
2d47a72c DJ |
3027 | for (msec = find_debug_info (debug_bfd, NULL); |
3028 | msec; | |
3029 | msec = find_debug_info (debug_bfd, msec)) | |
3030 | { | |
9e32b19f | 3031 | bfd_size_type size = msec->size; |
5d0900eb AM |
3032 | bfd_byte* buffer; |
3033 | ||
3034 | if (size == 0) | |
9e32b19f | 3035 | continue; |
5d0900eb AM |
3036 | |
3037 | buffer = (bfd_simple_get_relocated_section_contents | |
3038 | (debug_bfd, msec, NULL, symbols)); | |
3039 | if (! buffer) | |
3040 | goto done; | |
3041 | ||
9e32b19f DJ |
3042 | if (strcmp (msec->name, DWARF2_COMPRESSED_DEBUG_INFO) == 0) |
3043 | { | |
3044 | if (! bfd_uncompress_section_contents (&buffer, &size)) | |
5d0900eb AM |
3045 | { |
3046 | free (buffer); | |
3047 | goto done; | |
3048 | } | |
9e32b19f | 3049 | } |
5d0900eb AM |
3050 | stash->info_ptr_memory = bfd_realloc (stash->info_ptr_memory, |
3051 | total_size + size); | |
3052 | memcpy (stash->info_ptr_memory + total_size, buffer, size); | |
9e32b19f | 3053 | free (buffer); |
5d0900eb | 3054 | total_size += size; |
9e32b19f | 3055 | } |
2d47a72c DJ |
3056 | } |
3057 | } | |
f2363ce5 | 3058 | |
5d0900eb AM |
3059 | stash->info_ptr = stash->info_ptr_memory; |
3060 | stash->info_ptr_end = stash->info_ptr + total_size; | |
0d161102 | 3061 | stash->sec = find_debug_info (debug_bfd, NULL); |
f2363ce5 AO |
3062 | stash->sec_info_ptr = stash->info_ptr; |
3063 | stash->syms = symbols; | |
0d161102 | 3064 | stash->bfd = debug_bfd; |
252b5132 | 3065 | } |
a092b084 | 3066 | |
98591c73 | 3067 | /* A null info_ptr indicates that there is no dwarf2 info |
a092b084 | 3068 | (or that an error occured while setting up the stash). */ |
252b5132 | 3069 | if (! stash->info_ptr) |
d4c32a81 | 3070 | goto done; |
252b5132 | 3071 | |
4ab527b0 FF |
3072 | stash->inliner_chain = NULL; |
3073 | ||
a092b084 | 3074 | /* Check the previously read comp. units first. */ |
bd210d54 NC |
3075 | if (do_line) |
3076 | { | |
3077 | /* The info hash tables use quite a bit of memory. We may not want to | |
3078 | always use them. We use some heuristics to decide if and when to | |
3079 | turn it on. */ | |
3080 | if (stash->info_hash_status == STASH_INFO_HASH_OFF) | |
3081 | stash_maybe_enable_info_hash_tables (abfd, stash); | |
3082 | ||
3083 | /* Keep info hash table up to date if they are available. Note that we | |
3084 | may disable the hash tables if there is any error duing update. */ | |
3085 | if (stash->info_hash_status == STASH_INFO_HASH_ON) | |
3086 | stash_maybe_update_info_hash_tables (stash); | |
3087 | ||
3088 | if (stash->info_hash_status == STASH_INFO_HASH_ON) | |
3089 | { | |
3090 | found = stash_find_line_fast (stash, symbol, addr, filename_ptr, | |
3091 | linenumber_ptr); | |
3092 | if (found) | |
3093 | goto done; | |
3094 | } | |
0d161102 | 3095 | else |
bd210d54 NC |
3096 | { |
3097 | /* Check the previously read comp. units first. */ | |
3098 | for (each = stash->all_comp_units; each; each = each->next_unit) | |
3099 | if ((symbol->flags & BSF_FUNCTION) == 0 | |
3100 | || comp_unit_contains_address (each, addr)) | |
3101 | { | |
3102 | found = comp_unit_find_line (each, symbol, addr, filename_ptr, | |
3103 | linenumber_ptr, stash); | |
3104 | if (found) | |
3105 | goto done; | |
3106 | } | |
3107 | } | |
3108 | } | |
3109 | else | |
3110 | { | |
709d67f1 AM |
3111 | for (each = stash->all_comp_units; each; each = each->next_unit) |
3112 | { | |
3113 | found = (comp_unit_contains_address (each, addr) | |
3114 | && comp_unit_find_nearest_line (each, addr, | |
3115 | filename_ptr, | |
3116 | functionname_ptr, | |
3117 | linenumber_ptr, | |
3118 | stash)); | |
3119 | if (found) | |
3120 | goto done; | |
3121 | } | |
5420f73d L |
3122 | } |
3123 | ||
5420f73d L |
3124 | /* The DWARF2 spec says that the initial length field, and the |
3125 | offset of the abbreviation table, should both be 4-byte values. | |
3126 | However, some compilers do things differently. */ | |
3127 | if (addr_size == 0) | |
3128 | addr_size = 4; | |
3129 | BFD_ASSERT (addr_size == 4 || addr_size == 8); | |
3130 | ||
3131 | /* Read each remaining comp. units checking each as they are read. */ | |
3132 | while (stash->info_ptr < stash->info_ptr_end) | |
3133 | { | |
3134 | bfd_vma length; | |
3135 | unsigned int offset_size = addr_size; | |
3136 | bfd_byte *info_ptr_unit = stash->info_ptr; | |
3137 | ||
0d161102 | 3138 | length = read_4_bytes (stash->bfd, stash->info_ptr); |
bec42b15 NC |
3139 | /* A 0xffffff length is the DWARF3 way of indicating |
3140 | we use 64-bit offsets, instead of 32-bit offsets. */ | |
5420f73d L |
3141 | if (length == 0xffffffff) |
3142 | { | |
3143 | offset_size = 8; | |
0d161102 | 3144 | length = read_8_bytes (stash->bfd, stash->info_ptr + 4); |
5420f73d L |
3145 | stash->info_ptr += 12; |
3146 | } | |
3147 | /* A zero length is the IRIX way of indicating 64-bit offsets, | |
3148 | mostly because the 64-bit length will generally fit in 32 | |
3149 | bits, and the endianness helps. */ | |
3150 | else if (length == 0) | |
3151 | { | |
3152 | offset_size = 8; | |
0d161102 | 3153 | length = read_4_bytes (stash->bfd, stash->info_ptr + 4); |
5420f73d L |
3154 | stash->info_ptr += 8; |
3155 | } | |
024b2372 CD |
3156 | /* In the absence of the hints above, we assume 32-bit DWARF2 |
3157 | offsets even for targets with 64-bit addresses, because: | |
3158 | a) most of the time these targets will not have generated | |
3159 | more than 2Gb of debug info and so will not need 64-bit | |
3160 | offsets, | |
3161 | and | |
3162 | b) if they do use 64-bit offsets but they are not using | |
3163 | the size hints that are tested for above then they are | |
3164 | not conforming to the DWARF3 standard anyway. */ | |
5420f73d L |
3165 | else if (addr_size == 8) |
3166 | { | |
024b2372 | 3167 | offset_size = 4; |
2d47a72c | 3168 | stash->info_ptr += 4; |
5420f73d L |
3169 | } |
3170 | else | |
3171 | stash->info_ptr += 4; | |
3172 | ||
3173 | if (length > 0) | |
3174 | { | |
0d161102 | 3175 | each = parse_comp_unit (stash, length, info_ptr_unit, |
5420f73d | 3176 | offset_size); |
d74e4b29 NS |
3177 | if (!each) |
3178 | /* The dwarf information is damaged, don't trust it any | |
3179 | more. */ | |
3180 | break; | |
5420f73d L |
3181 | stash->info_ptr += length; |
3182 | ||
d74e4b29 NS |
3183 | if (stash->all_comp_units) |
3184 | stash->all_comp_units->prev_unit = each; | |
3185 | else | |
3186 | stash->last_comp_unit = each; | |
3187 | ||
3188 | each->next_unit = stash->all_comp_units; | |
3189 | stash->all_comp_units = each; | |
3190 | ||
3191 | /* DW_AT_low_pc and DW_AT_high_pc are optional for | |
3192 | compilation units. If we don't have them (i.e., | |
3193 | unit->high == 0), we need to consult the line info table | |
3194 | to see if a compilation unit contains the given | |
3195 | address. */ | |
3196 | if (do_line) | |
3197 | found = (((symbol->flags & BSF_FUNCTION) == 0 | |
3198 | || each->arange.high == 0 | |
3199 | || comp_unit_contains_address (each, addr)) | |
3200 | && comp_unit_find_line (each, symbol, addr, | |
3201 | filename_ptr, | |
3202 | linenumber_ptr, | |
3203 | stash)); | |
3204 | else | |
3205 | found = ((each->arange.high == 0 | |
3206 | || comp_unit_contains_address (each, addr)) | |
3207 | && comp_unit_find_nearest_line (each, addr, | |
3208 | filename_ptr, | |
3209 | functionname_ptr, | |
3210 | linenumber_ptr, | |
3211 | stash)); | |
be04437d AM |
3212 | |
3213 | if ((bfd_vma) (stash->info_ptr - stash->sec_info_ptr) | |
3214 | == stash->sec->size) | |
3215 | { | |
3216 | stash->sec = find_debug_info (stash->bfd, stash->sec); | |
3217 | stash->sec_info_ptr = stash->info_ptr; | |
3218 | } | |
3219 | ||
d74e4b29 NS |
3220 | if (found) |
3221 | goto done; | |
5420f73d L |
3222 | } |
3223 | } | |
3224 | ||
d4c32a81 L |
3225 | done: |
3226 | if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0) | |
3227 | unset_sections (stash); | |
3228 | ||
3229 | return found; | |
5420f73d L |
3230 | } |
3231 | ||
bec42b15 NC |
3232 | /* The DWARF2 version of find_nearest_line. |
3233 | Return TRUE if the line is found without error. */ | |
3234 | ||
3235 | bfd_boolean | |
3236 | _bfd_dwarf2_find_nearest_line (bfd *abfd, | |
3237 | asection *section, | |
3238 | asymbol **symbols, | |
3239 | bfd_vma offset, | |
3240 | const char **filename_ptr, | |
3241 | const char **functionname_ptr, | |
3242 | unsigned int *linenumber_ptr, | |
3243 | unsigned int addr_size, | |
3244 | void **pinfo) | |
3245 | { | |
3246 | return find_line (abfd, section, offset, NULL, symbols, filename_ptr, | |
3247 | functionname_ptr, linenumber_ptr, addr_size, | |
3248 | pinfo); | |
3249 | } | |
3250 | ||
3251 | /* The DWARF2 version of find_line. | |
3252 | Return TRUE if the line is found without error. */ | |
3253 | ||
3254 | bfd_boolean | |
3255 | _bfd_dwarf2_find_line (bfd *abfd, | |
3256 | asymbol **symbols, | |
3257 | asymbol *symbol, | |
3258 | const char **filename_ptr, | |
3259 | unsigned int *linenumber_ptr, | |
3260 | unsigned int addr_size, | |
3261 | void **pinfo) | |
3262 | { | |
3263 | return find_line (abfd, NULL, 0, symbol, symbols, filename_ptr, | |
3264 | NULL, linenumber_ptr, addr_size, | |
3265 | pinfo); | |
3266 | } | |
3267 | ||
4ab527b0 FF |
3268 | bfd_boolean |
3269 | _bfd_dwarf2_find_inliner_info (bfd *abfd ATTRIBUTE_UNUSED, | |
3270 | const char **filename_ptr, | |
3271 | const char **functionname_ptr, | |
3272 | unsigned int *linenumber_ptr, | |
3273 | void **pinfo) | |
3274 | { | |
3275 | struct dwarf2_debug *stash; | |
3276 | ||
3277 | stash = *pinfo; | |
3278 | if (stash) | |
3279 | { | |
3280 | struct funcinfo *func = stash->inliner_chain; | |
bec42b15 | 3281 | |
4ab527b0 FF |
3282 | if (func && func->caller_func) |
3283 | { | |
3284 | *filename_ptr = func->caller_file; | |
3285 | *functionname_ptr = func->caller_func->name; | |
3286 | *linenumber_ptr = func->caller_line; | |
3287 | stash->inliner_chain = func->caller_func; | |
bec42b15 | 3288 | return TRUE; |
4ab527b0 FF |
3289 | } |
3290 | } | |
3291 | ||
bec42b15 | 3292 | return FALSE; |
4ab527b0 FF |
3293 | } |
3294 | ||
35330cce NC |
3295 | void |
3296 | _bfd_dwarf2_cleanup_debug_info (bfd *abfd) | |
3297 | { | |
3298 | struct comp_unit *each; | |
3299 | struct dwarf2_debug *stash; | |
3300 | ||
3301 | if (abfd == NULL || elf_tdata (abfd) == NULL) | |
3302 | return; | |
3303 | ||
3304 | stash = elf_tdata (abfd)->dwarf2_find_line_info; | |
3305 | ||
3306 | if (stash == NULL) | |
3307 | return; | |
3308 | ||
3309 | for (each = stash->all_comp_units; each; each = each->next_unit) | |
3310 | { | |
34b5e0b2 | 3311 | struct abbrev_info **abbrevs = each->abbrevs; |
90b5b1a5 NC |
3312 | struct funcinfo *function_table = each->function_table; |
3313 | struct varinfo *variable_table = each->variable_table; | |
34b5e0b2 | 3314 | size_t i; |
35330cce | 3315 | |
34b5e0b2 | 3316 | for (i = 0; i < ABBREV_HASH_SIZE; i++) |
d8d1c398 | 3317 | { |
34b5e0b2 | 3318 | struct abbrev_info *abbrev = abbrevs[i]; |
35330cce | 3319 | |
34b5e0b2 | 3320 | while (abbrev) |
d8d1c398 | 3321 | { |
34b5e0b2 NC |
3322 | free (abbrev->attrs); |
3323 | abbrev = abbrev->next; | |
d8d1c398 AM |
3324 | } |
3325 | } | |
35330cce NC |
3326 | |
3327 | if (each->line_table) | |
d8d1c398 | 3328 | { |
34b5e0b2 NC |
3329 | free (each->line_table->dirs); |
3330 | free (each->line_table->files); | |
d8d1c398 | 3331 | } |
90b5b1a5 NC |
3332 | |
3333 | while (function_table) | |
3334 | { | |
3335 | if (function_table->file) | |
3336 | { | |
3337 | free (function_table->file); | |
3338 | function_table->file = NULL; | |
3339 | } | |
3340 | ||
3341 | if (function_table->caller_file) | |
3342 | { | |
3343 | free (function_table->caller_file); | |
3344 | function_table->caller_file = NULL; | |
3345 | } | |
3346 | function_table = function_table->prev_func; | |
3347 | } | |
3348 | ||
3349 | while (variable_table) | |
3350 | { | |
3351 | if (variable_table->file) | |
3352 | { | |
3353 | free (variable_table->file); | |
3354 | variable_table->file = NULL; | |
3355 | } | |
3356 | ||
3357 | variable_table = variable_table->prev_var; | |
3358 | } | |
35330cce NC |
3359 | } |
3360 | ||
5d0900eb AM |
3361 | if (stash->dwarf_abbrev_buffer) |
3362 | free (stash->dwarf_abbrev_buffer); | |
3363 | if (stash->dwarf_line_buffer) | |
3364 | free (stash->dwarf_line_buffer); | |
3365 | if (stash->dwarf_str_buffer) | |
3366 | free (stash->dwarf_str_buffer); | |
3367 | if (stash->dwarf_ranges_buffer) | |
3368 | free (stash->dwarf_ranges_buffer); | |
3369 | if (stash->info_ptr_memory) | |
3370 | free (stash->info_ptr_memory); | |
35330cce | 3371 | } |