2 Copyright (C) 1994-2017 Free Software Foundation, Inc.
4 Adapted from gdb/dwarf2read.c by Gavin Koch of Cygnus Solutions
7 From the dwarf2read.c header:
8 Adapted by Gary Funck (gary@intrepid.com), Intrepid Technology,
9 Inc. with support from Florida State University (under contract
10 with the Ada Joint Program Office), and Silicon Graphics, Inc.
11 Initial contribution by Brent Benson, Harris Computer Systems, Inc.,
12 based on Fred Fish's (Cygnus Support) implementation of DWARF 1
13 support in dwarfread.c
15 This file is part of BFD.
17 This program is free software; you can redistribute it and/or modify
18 it under the terms of the GNU General Public License as published by
19 the Free Software Foundation; either version 3 of the License, or (at
20 your option) any later version.
22 This program is distributed in the hope that it will be useful, but
23 WITHOUT ANY WARRANTY; without even the implied warranty of
24 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
25 General Public License for more details.
27 You should have received a copy of the GNU General Public License
28 along with this program; if not, write to the Free Software
29 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
30 MA 02110-1301, USA. */
34 #include "libiberty.h"
39 /* The data in the .debug_line statement prologue looks like this. */
44 unsigned short version
;
45 bfd_vma prologue_length
;
46 unsigned char minimum_instruction_length
;
47 unsigned char maximum_ops_per_insn
;
48 unsigned char default_is_stmt
;
50 unsigned char line_range
;
51 unsigned char opcode_base
;
52 unsigned char *standard_opcode_lengths
;
55 /* Attributes have a name and a value. */
59 enum dwarf_attribute name
;
64 struct dwarf_block
*blk
;
71 /* Blocks are a bunch of untyped bytes. */
78 struct adjusted_section
86 /* A list of all previously read comp_units. */
87 struct comp_unit
*all_comp_units
;
89 /* Last comp unit in list above. */
90 struct comp_unit
*last_comp_unit
;
92 /* Names of the debug sections. */
93 const struct dwarf_debug_section
*debug_sections
;
95 /* The next unread compilation unit within the .debug_info section.
96 Zero indicates that the .debug_info section has not been loaded
100 /* Pointer to the end of the .debug_info section memory buffer. */
101 bfd_byte
*info_ptr_end
;
103 /* Pointer to the original bfd for which debug was loaded. This is what
104 we use to compare and so check that the cached debug data is still
105 valid - it saves having to possibly dereference the gnu_debuglink each
109 /* Pointer to the bfd, section and address of the beginning of the
110 section. The bfd might be different than expected because of
111 gnu_debuglink sections. */
114 bfd_byte
*sec_info_ptr
;
116 /* Support for alternate debug info sections created by the DWZ utility:
117 This includes a pointer to an alternate bfd which contains *extra*,
118 possibly duplicate debug sections, and pointers to the loaded
119 .debug_str and .debug_info sections from this bfd. */
121 bfd_byte
* alt_dwarf_str_buffer
;
122 bfd_size_type alt_dwarf_str_size
;
123 bfd_byte
* alt_dwarf_info_buffer
;
124 bfd_size_type alt_dwarf_info_size
;
126 /* A pointer to the memory block allocated for info_ptr. Neither
127 info_ptr nor sec_info_ptr are guaranteed to stay pointing to the
128 beginning of the malloc block. This is used only to free the
130 bfd_byte
*info_ptr_memory
;
132 /* Pointer to the symbol table. */
135 /* Pointer to the .debug_abbrev section loaded into memory. */
136 bfd_byte
*dwarf_abbrev_buffer
;
138 /* Length of the loaded .debug_abbrev section. */
139 bfd_size_type dwarf_abbrev_size
;
141 /* Buffer for decode_line_info. */
142 bfd_byte
*dwarf_line_buffer
;
144 /* Length of the loaded .debug_line section. */
145 bfd_size_type dwarf_line_size
;
147 /* Pointer to the .debug_str section loaded into memory. */
148 bfd_byte
*dwarf_str_buffer
;
150 /* Length of the loaded .debug_str section. */
151 bfd_size_type dwarf_str_size
;
153 /* Pointer to the .debug_ranges section loaded into memory. */
154 bfd_byte
*dwarf_ranges_buffer
;
156 /* Length of the loaded .debug_ranges section. */
157 bfd_size_type dwarf_ranges_size
;
159 /* If the most recent call to bfd_find_nearest_line was given an
160 address in an inlined function, preserve a pointer into the
161 calling chain for subsequent calls to bfd_find_inliner_info to
163 struct funcinfo
*inliner_chain
;
165 /* Section VMAs at the time the stash was built. */
168 /* Number of sections whose VMA we must adjust. */
169 int adjusted_section_count
;
171 /* Array of sections with adjusted VMA. */
172 struct adjusted_section
*adjusted_sections
;
174 /* Number of times find_line is called. This is used in
175 the heuristic for enabling the info hash tables. */
178 #define STASH_INFO_HASH_TRIGGER 100
180 /* Hash table mapping symbol names to function infos. */
181 struct info_hash_table
*funcinfo_hash_table
;
183 /* Hash table mapping symbol names to variable infos. */
184 struct info_hash_table
*varinfo_hash_table
;
186 /* Head of comp_unit list in the last hash table update. */
187 struct comp_unit
*hash_units_head
;
189 /* Status of info hash. */
190 int info_hash_status
;
191 #define STASH_INFO_HASH_OFF 0
192 #define STASH_INFO_HASH_ON 1
193 #define STASH_INFO_HASH_DISABLED 2
195 /* True if we opened bfd_ptr. */
196 bfd_boolean close_on_cleanup
;
206 /* A minimal decoding of DWARF2 compilation units. We only decode
207 what's needed to get to the line number information. */
211 /* Chain the previously read compilation units. */
212 struct comp_unit
*next_unit
;
214 /* Likewise, chain the compilation unit read after this one.
215 The comp units are stored in reversed reading order. */
216 struct comp_unit
*prev_unit
;
218 /* Keep the bfd convenient (for memory allocation). */
221 /* The lowest and highest addresses contained in this compilation
222 unit as specified in the compilation unit header. */
223 struct arange arange
;
225 /* The DW_AT_name attribute (for error messages). */
228 /* The abbrev hash table. */
229 struct abbrev_info
**abbrevs
;
231 /* DW_AT_language. */
234 /* Note that an error was found by comp_unit_find_nearest_line. */
237 /* The DW_AT_comp_dir attribute. */
240 /* TRUE if there is a line number table associated with this comp. unit. */
243 /* Pointer to the current comp_unit so that we can find a given entry
245 bfd_byte
*info_ptr_unit
;
247 /* Pointer to the start of the debug section, for DW_FORM_ref_addr. */
248 bfd_byte
*sec_info_ptr
;
250 /* The offset into .debug_line of the line number table. */
251 unsigned long line_offset
;
253 /* Pointer to the first child die for the comp unit. */
254 bfd_byte
*first_child_die_ptr
;
256 /* The end of the comp unit. */
259 /* The decoded line number, NULL if not yet decoded. */
260 struct line_info_table
*line_table
;
262 /* A list of the functions found in this comp. unit. */
263 struct funcinfo
*function_table
;
265 /* A table of function information references searchable by address. */
266 struct lookup_funcinfo
*lookup_funcinfo_table
;
268 /* Number of functions in the function_table and sorted_function_table. */
269 bfd_size_type number_of_functions
;
271 /* A list of the variables found in this comp. unit. */
272 struct varinfo
*variable_table
;
274 /* Pointer to dwarf2_debug structure. */
275 struct dwarf2_debug
*stash
;
277 /* DWARF format version for this unit - from unit header. */
280 /* Address size for this unit - from unit header. */
281 unsigned char addr_size
;
283 /* Offset size for this unit - from unit header. */
284 unsigned char offset_size
;
286 /* Base address for this unit - from DW_AT_low_pc attribute of
287 DW_TAG_compile_unit DIE */
288 bfd_vma base_address
;
290 /* TRUE if symbols are cached in hash table for faster lookup by name. */
294 /* This data structure holds the information of an abbrev. */
297 unsigned int number
; /* Number identifying abbrev. */
298 enum dwarf_tag tag
; /* DWARF tag. */
299 int has_children
; /* Boolean. */
300 unsigned int num_attrs
; /* Number of attributes. */
301 struct attr_abbrev
*attrs
; /* An array of attribute descriptions. */
302 struct abbrev_info
*next
; /* Next in chain. */
307 enum dwarf_attribute name
;
308 enum dwarf_form form
;
311 /* Map of uncompressed DWARF debug section name to compressed one. It
312 is terminated by NULL uncompressed_name. */
314 const struct dwarf_debug_section dwarf_debug_sections
[] =
316 { ".debug_abbrev", ".zdebug_abbrev" },
317 { ".debug_aranges", ".zdebug_aranges" },
318 { ".debug_frame", ".zdebug_frame" },
319 { ".debug_info", ".zdebug_info" },
320 { ".debug_info", ".zdebug_info" },
321 { ".debug_line", ".zdebug_line" },
322 { ".debug_loc", ".zdebug_loc" },
323 { ".debug_macinfo", ".zdebug_macinfo" },
324 { ".debug_macro", ".zdebug_macro" },
325 { ".debug_pubnames", ".zdebug_pubnames" },
326 { ".debug_pubtypes", ".zdebug_pubtypes" },
327 { ".debug_ranges", ".zdebug_ranges" },
328 { ".debug_static_func", ".zdebug_static_func" },
329 { ".debug_static_vars", ".zdebug_static_vars" },
330 { ".debug_str", ".zdebug_str", },
331 { ".debug_str", ".zdebug_str", },
332 { ".debug_types", ".zdebug_types" },
333 /* GNU DWARF 1 extensions */
334 { ".debug_sfnames", ".zdebug_sfnames" },
335 { ".debug_srcinfo", ".zebug_srcinfo" },
336 /* SGI/MIPS DWARF 2 extensions */
337 { ".debug_funcnames", ".zdebug_funcnames" },
338 { ".debug_typenames", ".zdebug_typenames" },
339 { ".debug_varnames", ".zdebug_varnames" },
340 { ".debug_weaknames", ".zdebug_weaknames" },
344 /* NB/ Numbers in this enum must match up with indicies
345 into the dwarf_debug_sections[] array above. */
346 enum dwarf_debug_section_enum
373 #ifndef ABBREV_HASH_SIZE
374 #define ABBREV_HASH_SIZE 121
376 #ifndef ATTR_ALLOC_CHUNK
377 #define ATTR_ALLOC_CHUNK 4
380 /* Variable and function hash tables. This is used to speed up look-up
381 in lookup_symbol_in_var_table() and lookup_symbol_in_function_table().
382 In order to share code between variable and function infos, we use
383 a list of untyped pointer for all variable/function info associated with
384 a symbol. We waste a bit of memory for list with one node but that
385 simplifies the code. */
387 struct info_list_node
389 struct info_list_node
*next
;
393 /* Info hash entry. */
394 struct info_hash_entry
396 struct bfd_hash_entry root
;
397 struct info_list_node
*head
;
400 struct info_hash_table
402 struct bfd_hash_table base
;
405 /* Function to create a new entry in info hash table. */
407 static struct bfd_hash_entry
*
408 info_hash_table_newfunc (struct bfd_hash_entry
*entry
,
409 struct bfd_hash_table
*table
,
412 struct info_hash_entry
*ret
= (struct info_hash_entry
*) entry
;
414 /* Allocate the structure if it has not already been allocated by a
418 ret
= (struct info_hash_entry
*) bfd_hash_allocate (table
,
424 /* Call the allocation method of the base class. */
425 ret
= ((struct info_hash_entry
*)
426 bfd_hash_newfunc ((struct bfd_hash_entry
*) ret
, table
, string
));
428 /* Initialize the local fields here. */
432 return (struct bfd_hash_entry
*) ret
;
435 /* Function to create a new info hash table. It returns a pointer to the
436 newly created table or NULL if there is any error. We need abfd
437 solely for memory allocation. */
439 static struct info_hash_table
*
440 create_info_hash_table (bfd
*abfd
)
442 struct info_hash_table
*hash_table
;
444 hash_table
= ((struct info_hash_table
*)
445 bfd_alloc (abfd
, sizeof (struct info_hash_table
)));
449 if (!bfd_hash_table_init (&hash_table
->base
, info_hash_table_newfunc
,
450 sizeof (struct info_hash_entry
)))
452 bfd_release (abfd
, hash_table
);
459 /* Insert an info entry into an info hash table. We do not check of
460 duplicate entries. Also, the caller need to guarantee that the
461 right type of info in inserted as info is passed as a void* pointer.
462 This function returns true if there is no error. */
465 insert_info_hash_table (struct info_hash_table
*hash_table
,
470 struct info_hash_entry
*entry
;
471 struct info_list_node
*node
;
473 entry
= (struct info_hash_entry
*) bfd_hash_lookup (&hash_table
->base
,
478 node
= (struct info_list_node
*) bfd_hash_allocate (&hash_table
->base
,
484 node
->next
= entry
->head
;
490 /* Look up an info entry list from an info hash table. Return NULL
493 static struct info_list_node
*
494 lookup_info_hash_table (struct info_hash_table
*hash_table
, const char *key
)
496 struct info_hash_entry
*entry
;
498 entry
= (struct info_hash_entry
*) bfd_hash_lookup (&hash_table
->base
, key
,
500 return entry
? entry
->head
: NULL
;
503 /* Read a section into its appropriate place in the dwarf2_debug
504 struct (indicated by SECTION_BUFFER and SECTION_SIZE). If SYMS is
505 not NULL, use bfd_simple_get_relocated_section_contents to read the
506 section contents, otherwise use bfd_get_section_contents. Fail if
507 the located section does not contain at least OFFSET bytes. */
510 read_section (bfd
* abfd
,
511 const struct dwarf_debug_section
*sec
,
514 bfd_byte
** section_buffer
,
515 bfd_size_type
* section_size
)
518 const char *section_name
= sec
->uncompressed_name
;
520 /* The section may have already been read. */
521 if (*section_buffer
== NULL
)
523 msec
= bfd_get_section_by_name (abfd
, section_name
);
526 section_name
= sec
->compressed_name
;
527 if (section_name
!= NULL
)
528 msec
= bfd_get_section_by_name (abfd
, section_name
);
532 _bfd_error_handler (_("Dwarf Error: Can't find %s section."),
533 sec
->uncompressed_name
);
534 bfd_set_error (bfd_error_bad_value
);
538 *section_size
= msec
->rawsize
? msec
->rawsize
: msec
->size
;
542 = bfd_simple_get_relocated_section_contents (abfd
, msec
, NULL
, syms
);
543 if (! *section_buffer
)
548 *section_buffer
= (bfd_byte
*) bfd_malloc (*section_size
);
549 if (! *section_buffer
)
551 if (! bfd_get_section_contents (abfd
, msec
, *section_buffer
,
557 /* It is possible to get a bad value for the offset into the section
558 that the client wants. Validate it here to avoid trouble later. */
559 if (offset
!= 0 && offset
>= *section_size
)
561 /* xgettext: c-format */
562 _bfd_error_handler (_("Dwarf Error: Offset (%lu)"
563 " greater than or equal to %s size (%lu)."),
564 (long) offset
, section_name
, *section_size
);
565 bfd_set_error (bfd_error_bad_value
);
572 /* Read dwarf information from a buffer. */
575 read_1_byte (bfd
*abfd ATTRIBUTE_UNUSED
, bfd_byte
*buf
, bfd_byte
*end
)
579 return bfd_get_8 (abfd
, buf
);
583 read_1_signed_byte (bfd
*abfd ATTRIBUTE_UNUSED
, bfd_byte
*buf
, bfd_byte
*end
)
587 return bfd_get_signed_8 (abfd
, buf
);
591 read_2_bytes (bfd
*abfd
, bfd_byte
*buf
, bfd_byte
*end
)
595 return bfd_get_16 (abfd
, buf
);
599 read_4_bytes (bfd
*abfd
, bfd_byte
*buf
, bfd_byte
*end
)
603 return bfd_get_32 (abfd
, buf
);
607 read_8_bytes (bfd
*abfd
, bfd_byte
*buf
, bfd_byte
*end
)
611 return bfd_get_64 (abfd
, buf
);
615 read_n_bytes (bfd
*abfd ATTRIBUTE_UNUSED
,
618 unsigned int size ATTRIBUTE_UNUSED
)
620 if (buf
+ size
> end
)
625 /* Scans a NUL terminated string starting at BUF, returning a pointer to it.
626 Returns the number of characters in the string, *including* the NUL byte,
627 in BYTES_READ_PTR. This value is set even if the function fails. Bytes
628 at or beyond BUF_END will not be read. Returns NULL if there was a
629 problem, or if the string is empty. */
632 read_string (bfd
* abfd ATTRIBUTE_UNUSED
,
635 unsigned int * bytes_read_ptr
)
641 * bytes_read_ptr
= 0;
647 * bytes_read_ptr
= 1;
651 while (buf
< buf_end
)
654 * bytes_read_ptr
= buf
- str
;
658 * bytes_read_ptr
= buf
- str
;
662 /* Reads an offset from BUF and then locates the string at this offset
663 inside the debug string section. Returns a pointer to the string.
664 Returns the number of bytes read from BUF, *not* the length of the string,
665 in BYTES_READ_PTR. This value is set even if the function fails. Bytes
666 at or beyond BUF_END will not be read from BUF. Returns NULL if there was
667 a problem, or if the string is empty. Does not check for NUL termination
671 read_indirect_string (struct comp_unit
* unit
,
674 unsigned int * bytes_read_ptr
)
677 struct dwarf2_debug
*stash
= unit
->stash
;
680 if (buf
+ unit
->offset_size
> buf_end
)
682 * bytes_read_ptr
= 0;
686 if (unit
->offset_size
== 4)
687 offset
= read_4_bytes (unit
->abfd
, buf
, buf_end
);
689 offset
= read_8_bytes (unit
->abfd
, buf
, buf_end
);
691 *bytes_read_ptr
= unit
->offset_size
;
693 if (! read_section (unit
->abfd
, &stash
->debug_sections
[debug_str
],
695 &stash
->dwarf_str_buffer
, &stash
->dwarf_str_size
))
698 if (offset
>= stash
->dwarf_str_size
)
700 str
= (char *) stash
->dwarf_str_buffer
+ offset
;
706 /* Like read_indirect_string but uses a .debug_str located in
707 an alternate file pointed to by the .gnu_debugaltlink section.
708 Used to impement DW_FORM_GNU_strp_alt. */
711 read_alt_indirect_string (struct comp_unit
* unit
,
714 unsigned int * bytes_read_ptr
)
717 struct dwarf2_debug
*stash
= unit
->stash
;
720 if (buf
+ unit
->offset_size
> buf_end
)
722 * bytes_read_ptr
= 0;
726 if (unit
->offset_size
== 4)
727 offset
= read_4_bytes (unit
->abfd
, buf
, buf_end
);
729 offset
= read_8_bytes (unit
->abfd
, buf
, buf_end
);
731 *bytes_read_ptr
= unit
->offset_size
;
733 if (stash
->alt_bfd_ptr
== NULL
)
736 char * debug_filename
= bfd_follow_gnu_debugaltlink (unit
->abfd
, DEBUGDIR
);
738 if (debug_filename
== NULL
)
741 if ((debug_bfd
= bfd_openr (debug_filename
, NULL
)) == NULL
742 || ! bfd_check_format (debug_bfd
, bfd_object
))
745 bfd_close (debug_bfd
);
747 /* FIXME: Should we report our failure to follow the debuglink ? */
748 free (debug_filename
);
751 stash
->alt_bfd_ptr
= debug_bfd
;
754 if (! read_section (unit
->stash
->alt_bfd_ptr
,
755 stash
->debug_sections
+ debug_str_alt
,
756 NULL
, /* FIXME: Do we need to load alternate symbols ? */
758 &stash
->alt_dwarf_str_buffer
,
759 &stash
->alt_dwarf_str_size
))
762 if (offset
>= stash
->alt_dwarf_str_size
)
764 str
= (char *) stash
->alt_dwarf_str_buffer
+ offset
;
771 /* Resolve an alternate reference from UNIT at OFFSET.
772 Returns a pointer into the loaded alternate CU upon success
773 or NULL upon failure. */
776 read_alt_indirect_ref (struct comp_unit
* unit
,
779 struct dwarf2_debug
*stash
= unit
->stash
;
781 if (stash
->alt_bfd_ptr
== NULL
)
784 char * debug_filename
= bfd_follow_gnu_debugaltlink (unit
->abfd
, DEBUGDIR
);
786 if (debug_filename
== NULL
)
789 if ((debug_bfd
= bfd_openr (debug_filename
, NULL
)) == NULL
790 || ! bfd_check_format (debug_bfd
, bfd_object
))
793 bfd_close (debug_bfd
);
795 /* FIXME: Should we report our failure to follow the debuglink ? */
796 free (debug_filename
);
799 stash
->alt_bfd_ptr
= debug_bfd
;
802 if (! read_section (unit
->stash
->alt_bfd_ptr
,
803 stash
->debug_sections
+ debug_info_alt
,
804 NULL
, /* FIXME: Do we need to load alternate symbols ? */
806 &stash
->alt_dwarf_info_buffer
,
807 &stash
->alt_dwarf_info_size
))
810 if (offset
>= stash
->alt_dwarf_info_size
)
812 return stash
->alt_dwarf_info_buffer
+ offset
;
816 read_address (struct comp_unit
*unit
, bfd_byte
*buf
, bfd_byte
* buf_end
)
820 if (bfd_get_flavour (unit
->abfd
) == bfd_target_elf_flavour
)
821 signed_vma
= get_elf_backend_data (unit
->abfd
)->sign_extend_vma
;
823 if (buf
+ unit
->addr_size
> buf_end
)
828 switch (unit
->addr_size
)
831 return bfd_get_signed_64 (unit
->abfd
, buf
);
833 return bfd_get_signed_32 (unit
->abfd
, buf
);
835 return bfd_get_signed_16 (unit
->abfd
, buf
);
842 switch (unit
->addr_size
)
845 return bfd_get_64 (unit
->abfd
, buf
);
847 return bfd_get_32 (unit
->abfd
, buf
);
849 return bfd_get_16 (unit
->abfd
, buf
);
856 /* Lookup an abbrev_info structure in the abbrev hash table. */
858 static struct abbrev_info
*
859 lookup_abbrev (unsigned int number
, struct abbrev_info
**abbrevs
)
861 unsigned int hash_number
;
862 struct abbrev_info
*abbrev
;
864 hash_number
= number
% ABBREV_HASH_SIZE
;
865 abbrev
= abbrevs
[hash_number
];
869 if (abbrev
->number
== number
)
872 abbrev
= abbrev
->next
;
878 /* In DWARF version 2, the description of the debugging information is
879 stored in a separate .debug_abbrev section. Before we read any
880 dies from a section we read in all abbreviations and install them
883 static struct abbrev_info
**
884 read_abbrevs (bfd
*abfd
, bfd_uint64_t offset
, struct dwarf2_debug
*stash
)
886 struct abbrev_info
**abbrevs
;
887 bfd_byte
*abbrev_ptr
;
888 bfd_byte
*abbrev_end
;
889 struct abbrev_info
*cur_abbrev
;
890 unsigned int abbrev_number
, bytes_read
, abbrev_name
;
891 unsigned int abbrev_form
, hash_number
;
894 if (! read_section (abfd
, &stash
->debug_sections
[debug_abbrev
],
896 &stash
->dwarf_abbrev_buffer
, &stash
->dwarf_abbrev_size
))
899 if (offset
>= stash
->dwarf_abbrev_size
)
902 amt
= sizeof (struct abbrev_info
*) * ABBREV_HASH_SIZE
;
903 abbrevs
= (struct abbrev_info
**) bfd_zalloc (abfd
, amt
);
907 abbrev_ptr
= stash
->dwarf_abbrev_buffer
+ offset
;
908 abbrev_end
= stash
->dwarf_abbrev_buffer
+ stash
->dwarf_abbrev_size
;
909 abbrev_number
= safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
, FALSE
, abbrev_end
);
910 abbrev_ptr
+= bytes_read
;
912 /* Loop until we reach an abbrev number of 0. */
913 while (abbrev_number
)
915 amt
= sizeof (struct abbrev_info
);
916 cur_abbrev
= (struct abbrev_info
*) bfd_zalloc (abfd
, amt
);
917 if (cur_abbrev
== NULL
)
920 /* Read in abbrev header. */
921 cur_abbrev
->number
= abbrev_number
;
922 cur_abbrev
->tag
= (enum dwarf_tag
)
923 safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
, FALSE
, abbrev_end
);
924 abbrev_ptr
+= bytes_read
;
925 cur_abbrev
->has_children
= read_1_byte (abfd
, abbrev_ptr
, abbrev_end
);
928 /* Now read in declarations. */
929 abbrev_name
= safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
, FALSE
, abbrev_end
);
930 abbrev_ptr
+= bytes_read
;
931 abbrev_form
= safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
, FALSE
, abbrev_end
);
932 abbrev_ptr
+= bytes_read
;
936 if ((cur_abbrev
->num_attrs
% ATTR_ALLOC_CHUNK
) == 0)
938 struct attr_abbrev
*tmp
;
940 amt
= cur_abbrev
->num_attrs
+ ATTR_ALLOC_CHUNK
;
941 amt
*= sizeof (struct attr_abbrev
);
942 tmp
= (struct attr_abbrev
*) bfd_realloc (cur_abbrev
->attrs
, amt
);
947 for (i
= 0; i
< ABBREV_HASH_SIZE
; i
++)
949 struct abbrev_info
*abbrev
= abbrevs
[i
];
953 free (abbrev
->attrs
);
954 abbrev
= abbrev
->next
;
959 cur_abbrev
->attrs
= tmp
;
962 cur_abbrev
->attrs
[cur_abbrev
->num_attrs
].name
963 = (enum dwarf_attribute
) abbrev_name
;
964 cur_abbrev
->attrs
[cur_abbrev
->num_attrs
++].form
965 = (enum dwarf_form
) abbrev_form
;
966 abbrev_name
= safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
, FALSE
, abbrev_end
);
967 abbrev_ptr
+= bytes_read
;
968 abbrev_form
= safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
, FALSE
, abbrev_end
);
969 abbrev_ptr
+= bytes_read
;
972 hash_number
= abbrev_number
% ABBREV_HASH_SIZE
;
973 cur_abbrev
->next
= abbrevs
[hash_number
];
974 abbrevs
[hash_number
] = cur_abbrev
;
976 /* Get next abbreviation.
977 Under Irix6 the abbreviations for a compilation unit are not
978 always properly terminated with an abbrev number of 0.
979 Exit loop if we encounter an abbreviation which we have
980 already read (which means we are about to read the abbreviations
981 for the next compile unit) or if the end of the abbreviation
983 if ((unsigned int) (abbrev_ptr
- stash
->dwarf_abbrev_buffer
)
984 >= stash
->dwarf_abbrev_size
)
986 abbrev_number
= safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
, FALSE
, abbrev_end
);
987 abbrev_ptr
+= bytes_read
;
988 if (lookup_abbrev (abbrev_number
, abbrevs
) != NULL
)
995 /* Returns true if the form is one which has a string value. */
997 static inline bfd_boolean
998 is_str_attr (enum dwarf_form form
)
1000 return form
== DW_FORM_string
|| form
== DW_FORM_strp
|| form
== DW_FORM_GNU_strp_alt
;
1003 /* Read and fill in the value of attribute ATTR as described by FORM.
1004 Read data starting from INFO_PTR, but never at or beyond INFO_PTR_END.
1005 Returns an updated INFO_PTR taking into account the amount of data read. */
1008 read_attribute_value (struct attribute
* attr
,
1010 struct comp_unit
* unit
,
1011 bfd_byte
* info_ptr
,
1012 bfd_byte
* info_ptr_end
)
1014 bfd
*abfd
= unit
->abfd
;
1015 unsigned int bytes_read
;
1016 struct dwarf_block
*blk
;
1019 if (info_ptr
>= info_ptr_end
&& form
!= DW_FORM_flag_present
)
1021 _bfd_error_handler (_("Dwarf Error: Info pointer extends beyond end of attributes"));
1022 bfd_set_error (bfd_error_bad_value
);
1026 attr
->form
= (enum dwarf_form
) form
;
1030 case DW_FORM_ref_addr
:
1031 /* DW_FORM_ref_addr is an address in DWARF2, and an offset in
1033 if (unit
->version
== 3 || unit
->version
== 4)
1035 if (unit
->offset_size
== 4)
1036 attr
->u
.val
= read_4_bytes (unit
->abfd
, info_ptr
, info_ptr_end
);
1038 attr
->u
.val
= read_8_bytes (unit
->abfd
, info_ptr
, info_ptr_end
);
1039 info_ptr
+= unit
->offset_size
;
1044 attr
->u
.val
= read_address (unit
, info_ptr
, info_ptr_end
);
1045 info_ptr
+= unit
->addr_size
;
1047 case DW_FORM_GNU_ref_alt
:
1048 case DW_FORM_sec_offset
:
1049 if (unit
->offset_size
== 4)
1050 attr
->u
.val
= read_4_bytes (unit
->abfd
, info_ptr
, info_ptr_end
);
1052 attr
->u
.val
= read_8_bytes (unit
->abfd
, info_ptr
, info_ptr_end
);
1053 info_ptr
+= unit
->offset_size
;
1055 case DW_FORM_block2
:
1056 amt
= sizeof (struct dwarf_block
);
1057 blk
= (struct dwarf_block
*) bfd_alloc (abfd
, amt
);
1060 blk
->size
= read_2_bytes (abfd
, info_ptr
, info_ptr_end
);
1062 blk
->data
= read_n_bytes (abfd
, info_ptr
, info_ptr_end
, blk
->size
);
1063 info_ptr
+= blk
->size
;
1066 case DW_FORM_block4
:
1067 amt
= sizeof (struct dwarf_block
);
1068 blk
= (struct dwarf_block
*) bfd_alloc (abfd
, amt
);
1071 blk
->size
= read_4_bytes (abfd
, info_ptr
, info_ptr_end
);
1073 blk
->data
= read_n_bytes (abfd
, info_ptr
, info_ptr_end
, blk
->size
);
1074 info_ptr
+= blk
->size
;
1078 attr
->u
.val
= read_2_bytes (abfd
, info_ptr
, info_ptr_end
);
1082 attr
->u
.val
= read_4_bytes (abfd
, info_ptr
, info_ptr_end
);
1086 attr
->u
.val
= read_8_bytes (abfd
, info_ptr
, info_ptr_end
);
1089 case DW_FORM_string
:
1090 attr
->u
.str
= read_string (abfd
, info_ptr
, info_ptr_end
, &bytes_read
);
1091 info_ptr
+= bytes_read
;
1094 attr
->u
.str
= read_indirect_string (unit
, info_ptr
, info_ptr_end
, &bytes_read
);
1095 info_ptr
+= bytes_read
;
1097 case DW_FORM_GNU_strp_alt
:
1098 attr
->u
.str
= read_alt_indirect_string (unit
, info_ptr
, info_ptr_end
, &bytes_read
);
1099 info_ptr
+= bytes_read
;
1101 case DW_FORM_exprloc
:
1103 amt
= sizeof (struct dwarf_block
);
1104 blk
= (struct dwarf_block
*) bfd_alloc (abfd
, amt
);
1107 blk
->size
= safe_read_leb128 (abfd
, info_ptr
, &bytes_read
, FALSE
, info_ptr_end
);
1108 info_ptr
+= bytes_read
;
1109 blk
->data
= read_n_bytes (abfd
, info_ptr
, info_ptr_end
, blk
->size
);
1110 info_ptr
+= blk
->size
;
1113 case DW_FORM_block1
:
1114 amt
= sizeof (struct dwarf_block
);
1115 blk
= (struct dwarf_block
*) bfd_alloc (abfd
, amt
);
1118 blk
->size
= read_1_byte (abfd
, info_ptr
, info_ptr_end
);
1120 blk
->data
= read_n_bytes (abfd
, info_ptr
, info_ptr_end
, blk
->size
);
1121 info_ptr
+= blk
->size
;
1125 attr
->u
.val
= read_1_byte (abfd
, info_ptr
, info_ptr_end
);
1129 attr
->u
.val
= read_1_byte (abfd
, info_ptr
, info_ptr_end
);
1132 case DW_FORM_flag_present
:
1136 attr
->u
.sval
= safe_read_leb128 (abfd
, info_ptr
, &bytes_read
, TRUE
, info_ptr_end
);
1137 info_ptr
+= bytes_read
;
1140 attr
->u
.val
= safe_read_leb128 (abfd
, info_ptr
, &bytes_read
, FALSE
, info_ptr_end
);
1141 info_ptr
+= bytes_read
;
1144 attr
->u
.val
= read_1_byte (abfd
, info_ptr
, info_ptr_end
);
1148 attr
->u
.val
= read_2_bytes (abfd
, info_ptr
, info_ptr_end
);
1152 attr
->u
.val
= read_4_bytes (abfd
, info_ptr
, info_ptr_end
);
1156 attr
->u
.val
= read_8_bytes (abfd
, info_ptr
, info_ptr_end
);
1159 case DW_FORM_ref_sig8
:
1160 attr
->u
.val
= read_8_bytes (abfd
, info_ptr
, info_ptr_end
);
1163 case DW_FORM_ref_udata
:
1164 attr
->u
.val
= safe_read_leb128 (abfd
, info_ptr
, &bytes_read
, FALSE
, info_ptr_end
);
1165 info_ptr
+= bytes_read
;
1167 case DW_FORM_indirect
:
1168 form
= safe_read_leb128 (abfd
, info_ptr
, &bytes_read
, FALSE
, info_ptr_end
);
1169 info_ptr
+= bytes_read
;
1170 info_ptr
= read_attribute_value (attr
, form
, unit
, info_ptr
, info_ptr_end
);
1173 _bfd_error_handler (_("Dwarf Error: Invalid or unhandled FORM value: %#x."),
1175 bfd_set_error (bfd_error_bad_value
);
1181 /* Read an attribute described by an abbreviated attribute. */
1184 read_attribute (struct attribute
* attr
,
1185 struct attr_abbrev
* abbrev
,
1186 struct comp_unit
* unit
,
1187 bfd_byte
* info_ptr
,
1188 bfd_byte
* info_ptr_end
)
1190 attr
->name
= abbrev
->name
;
1191 info_ptr
= read_attribute_value (attr
, abbrev
->form
, unit
, info_ptr
, info_ptr_end
);
1195 /* Return whether DW_AT_name will return the same as DW_AT_linkage_name
1199 non_mangled (int lang
)
1209 case DW_LANG_Cobol74
:
1210 case DW_LANG_Cobol85
:
1211 case DW_LANG_Fortran77
:
1212 case DW_LANG_Pascal83
:
1222 /* Source line information table routines. */
1224 #define FILE_ALLOC_CHUNK 5
1225 #define DIR_ALLOC_CHUNK 5
1229 struct line_info
* prev_line
;
1233 unsigned int column
;
1234 unsigned int discriminator
;
1235 unsigned char op_index
;
1236 unsigned char end_sequence
; /* End of (sequential) code sequence. */
1247 struct line_sequence
1250 struct line_sequence
* prev_sequence
;
1251 struct line_info
* last_line
; /* Largest VMA. */
1252 struct line_info
** line_info_lookup
;
1253 bfd_size_type num_lines
;
1256 struct line_info_table
1259 unsigned int num_files
;
1260 unsigned int num_dirs
;
1261 unsigned int num_sequences
;
1264 struct fileinfo
* files
;
1265 struct line_sequence
* sequences
;
1266 struct line_info
* lcl_head
; /* Local head; used in 'add_line_info'. */
1269 /* Remember some information about each function. If the function is
1270 inlined (DW_TAG_inlined_subroutine) it may have two additional
1271 attributes, DW_AT_call_file and DW_AT_call_line, which specify the
1272 source code location where this function was inlined. */
1276 /* Pointer to previous function in list of all functions. */
1277 struct funcinfo
* prev_func
;
1278 /* Pointer to function one scope higher. */
1279 struct funcinfo
* caller_func
;
1280 /* Source location file name where caller_func inlines this func. */
1282 /* Source location file name. */
1284 /* Source location line number where caller_func inlines this func. */
1286 /* Source location line number. */
1289 bfd_boolean is_linkage
;
1291 struct arange arange
;
1292 /* Where the symbol is defined. */
1296 struct lookup_funcinfo
1298 /* Function information corresponding to this lookup table entry. */
1299 struct funcinfo
* funcinfo
;
1301 /* The lowest address for this specific function. */
1304 /* The highest address of this function before the lookup table is sorted.
1305 The highest address of all prior functions after the lookup table is
1306 sorted, which is used for binary search. */
1312 /* Pointer to previous variable in list of all variables */
1313 struct varinfo
*prev_var
;
1314 /* Source location file name */
1316 /* Source location line number */
1321 /* Where the symbol is defined */
1323 /* Is this a stack variable? */
1324 unsigned int stack
: 1;
1327 /* Return TRUE if NEW_LINE should sort after LINE. */
1329 static inline bfd_boolean
1330 new_line_sorts_after (struct line_info
*new_line
, struct line_info
*line
)
1332 return (new_line
->address
> line
->address
1333 || (new_line
->address
== line
->address
1334 && (new_line
->op_index
> line
->op_index
1335 || (new_line
->op_index
== line
->op_index
1336 && new_line
->end_sequence
< line
->end_sequence
))));
1340 /* Adds a new entry to the line_info list in the line_info_table, ensuring
1341 that the list is sorted. Note that the line_info list is sorted from
1342 highest to lowest VMA (with possible duplicates); that is,
1343 line_info->prev_line always accesses an equal or smaller VMA. */
1346 add_line_info (struct line_info_table
*table
,
1348 unsigned char op_index
,
1351 unsigned int column
,
1352 unsigned int discriminator
,
1355 bfd_size_type amt
= sizeof (struct line_info
);
1356 struct line_sequence
* seq
= table
->sequences
;
1357 struct line_info
* info
= (struct line_info
*) bfd_alloc (table
->abfd
, amt
);
1362 /* Set member data of 'info'. */
1363 info
->prev_line
= NULL
;
1364 info
->address
= address
;
1365 info
->op_index
= op_index
;
1367 info
->column
= column
;
1368 info
->discriminator
= discriminator
;
1369 info
->end_sequence
= end_sequence
;
1371 if (filename
&& filename
[0])
1373 info
->filename
= (char *) bfd_alloc (table
->abfd
, strlen (filename
) + 1);
1374 if (info
->filename
== NULL
)
1376 strcpy (info
->filename
, filename
);
1379 info
->filename
= NULL
;
1381 /* Find the correct location for 'info'. Normally we will receive
1382 new line_info data 1) in order and 2) with increasing VMAs.
1383 However some compilers break the rules (cf. decode_line_info) and
1384 so we include some heuristics for quickly finding the correct
1385 location for 'info'. In particular, these heuristics optimize for
1386 the common case in which the VMA sequence that we receive is a
1387 list of locally sorted VMAs such as
1388 p...z a...j (where a < j < p < z)
1390 Note: table->lcl_head is used to head an *actual* or *possible*
1391 sub-sequence within the list (such as a...j) that is not directly
1392 headed by table->last_line
1394 Note: we may receive duplicate entries from 'decode_line_info'. */
1397 && seq
->last_line
->address
== address
1398 && seq
->last_line
->op_index
== op_index
1399 && seq
->last_line
->end_sequence
== end_sequence
)
1401 /* We only keep the last entry with the same address and end
1402 sequence. See PR ld/4986. */
1403 if (table
->lcl_head
== seq
->last_line
)
1404 table
->lcl_head
= info
;
1405 info
->prev_line
= seq
->last_line
->prev_line
;
1406 seq
->last_line
= info
;
1408 else if (!seq
|| seq
->last_line
->end_sequence
)
1410 /* Start a new line sequence. */
1411 amt
= sizeof (struct line_sequence
);
1412 seq
= (struct line_sequence
*) bfd_malloc (amt
);
1415 seq
->low_pc
= address
;
1416 seq
->prev_sequence
= table
->sequences
;
1417 seq
->last_line
= info
;
1418 table
->lcl_head
= info
;
1419 table
->sequences
= seq
;
1420 table
->num_sequences
++;
1422 else if (new_line_sorts_after (info
, seq
->last_line
))
1424 /* Normal case: add 'info' to the beginning of the current sequence. */
1425 info
->prev_line
= seq
->last_line
;
1426 seq
->last_line
= info
;
1428 /* lcl_head: initialize to head a *possible* sequence at the end. */
1429 if (!table
->lcl_head
)
1430 table
->lcl_head
= info
;
1432 else if (!new_line_sorts_after (info
, table
->lcl_head
)
1433 && (!table
->lcl_head
->prev_line
1434 || new_line_sorts_after (info
, table
->lcl_head
->prev_line
)))
1436 /* Abnormal but easy: lcl_head is the head of 'info'. */
1437 info
->prev_line
= table
->lcl_head
->prev_line
;
1438 table
->lcl_head
->prev_line
= info
;
1442 /* Abnormal and hard: Neither 'last_line' nor 'lcl_head'
1443 are valid heads for 'info'. Reset 'lcl_head'. */
1444 struct line_info
* li2
= seq
->last_line
; /* Always non-NULL. */
1445 struct line_info
* li1
= li2
->prev_line
;
1449 if (!new_line_sorts_after (info
, li2
)
1450 && new_line_sorts_after (info
, li1
))
1453 li2
= li1
; /* always non-NULL */
1454 li1
= li1
->prev_line
;
1456 table
->lcl_head
= li2
;
1457 info
->prev_line
= table
->lcl_head
->prev_line
;
1458 table
->lcl_head
->prev_line
= info
;
1459 if (address
< seq
->low_pc
)
1460 seq
->low_pc
= address
;
1465 /* Extract a fully qualified filename from a line info table.
1466 The returned string has been malloc'ed and it is the caller's
1467 responsibility to free it. */
1470 concat_filename (struct line_info_table
*table
, unsigned int file
)
1474 if (file
- 1 >= table
->num_files
)
1476 /* FILE == 0 means unknown. */
1479 (_("Dwarf Error: mangled line number section (bad file number)."));
1480 return strdup ("<unknown>");
1483 filename
= table
->files
[file
- 1].name
;
1485 if (!IS_ABSOLUTE_PATH (filename
))
1487 char *dir_name
= NULL
;
1488 char *subdir_name
= NULL
;
1492 if (table
->files
[file
- 1].dir
1493 /* PR 17512: file: 0317e960. */
1494 && table
->files
[file
- 1].dir
<= table
->num_dirs
1495 /* PR 17512: file: 7f3d2e4b. */
1496 && table
->dirs
!= NULL
)
1497 subdir_name
= table
->dirs
[table
->files
[file
- 1].dir
- 1];
1499 if (!subdir_name
|| !IS_ABSOLUTE_PATH (subdir_name
))
1500 dir_name
= table
->comp_dir
;
1504 dir_name
= subdir_name
;
1509 return strdup (filename
);
1511 len
= strlen (dir_name
) + strlen (filename
) + 2;
1515 len
+= strlen (subdir_name
) + 1;
1516 name
= (char *) bfd_malloc (len
);
1518 sprintf (name
, "%s/%s/%s", dir_name
, subdir_name
, filename
);
1522 name
= (char *) bfd_malloc (len
);
1524 sprintf (name
, "%s/%s", dir_name
, filename
);
1530 return strdup (filename
);
1534 arange_add (const struct comp_unit
*unit
, struct arange
*first_arange
,
1535 bfd_vma low_pc
, bfd_vma high_pc
)
1537 struct arange
*arange
;
1539 /* Ignore empty ranges. */
1540 if (low_pc
== high_pc
)
1543 /* If the first arange is empty, use it. */
1544 if (first_arange
->high
== 0)
1546 first_arange
->low
= low_pc
;
1547 first_arange
->high
= high_pc
;
1551 /* Next see if we can cheaply extend an existing range. */
1552 arange
= first_arange
;
1555 if (low_pc
== arange
->high
)
1557 arange
->high
= high_pc
;
1560 if (high_pc
== arange
->low
)
1562 arange
->low
= low_pc
;
1565 arange
= arange
->next
;
1569 /* Need to allocate a new arange and insert it into the arange list.
1570 Order isn't significant, so just insert after the first arange. */
1571 arange
= (struct arange
*) bfd_alloc (unit
->abfd
, sizeof (*arange
));
1574 arange
->low
= low_pc
;
1575 arange
->high
= high_pc
;
1576 arange
->next
= first_arange
->next
;
1577 first_arange
->next
= arange
;
1581 /* Compare function for line sequences. */
1584 compare_sequences (const void* a
, const void* b
)
1586 const struct line_sequence
* seq1
= a
;
1587 const struct line_sequence
* seq2
= b
;
1589 /* Sort by low_pc as the primary key. */
1590 if (seq1
->low_pc
< seq2
->low_pc
)
1592 if (seq1
->low_pc
> seq2
->low_pc
)
1595 /* If low_pc values are equal, sort in reverse order of
1596 high_pc, so that the largest region comes first. */
1597 if (seq1
->last_line
->address
< seq2
->last_line
->address
)
1599 if (seq1
->last_line
->address
> seq2
->last_line
->address
)
1602 if (seq1
->last_line
->op_index
< seq2
->last_line
->op_index
)
1604 if (seq1
->last_line
->op_index
> seq2
->last_line
->op_index
)
1610 /* Construct the line information table for quick lookup. */
1613 build_line_info_table (struct line_info_table
* table
,
1614 struct line_sequence
* seq
)
1617 struct line_info
** line_info_lookup
;
1618 struct line_info
* each_line
;
1619 unsigned int num_lines
;
1620 unsigned int line_index
;
1622 if (seq
->line_info_lookup
!= NULL
)
1625 /* Count the number of line information entries. We could do this while
1626 scanning the debug information, but some entries may be added via
1627 lcl_head without having a sequence handy to increment the number of
1630 for (each_line
= seq
->last_line
; each_line
; each_line
= each_line
->prev_line
)
1636 /* Allocate space for the line information lookup table. */
1637 amt
= sizeof (struct line_info
*) * num_lines
;
1638 line_info_lookup
= (struct line_info
**) bfd_alloc (table
->abfd
, amt
);
1639 if (line_info_lookup
== NULL
)
1642 /* Create the line information lookup table. */
1643 line_index
= num_lines
;
1644 for (each_line
= seq
->last_line
; each_line
; each_line
= each_line
->prev_line
)
1645 line_info_lookup
[--line_index
] = each_line
;
1647 BFD_ASSERT (line_index
== 0);
1649 seq
->num_lines
= num_lines
;
1650 seq
->line_info_lookup
= line_info_lookup
;
1655 /* Sort the line sequences for quick lookup. */
1658 sort_line_sequences (struct line_info_table
* table
)
1661 struct line_sequence
* sequences
;
1662 struct line_sequence
* seq
;
1664 unsigned int num_sequences
= table
->num_sequences
;
1665 bfd_vma last_high_pc
;
1667 if (num_sequences
== 0)
1670 /* Allocate space for an array of sequences. */
1671 amt
= sizeof (struct line_sequence
) * num_sequences
;
1672 sequences
= (struct line_sequence
*) bfd_alloc (table
->abfd
, amt
);
1673 if (sequences
== NULL
)
1676 /* Copy the linked list into the array, freeing the original nodes. */
1677 seq
= table
->sequences
;
1678 for (n
= 0; n
< num_sequences
; n
++)
1680 struct line_sequence
* last_seq
= seq
;
1683 sequences
[n
].low_pc
= seq
->low_pc
;
1684 sequences
[n
].prev_sequence
= NULL
;
1685 sequences
[n
].last_line
= seq
->last_line
;
1686 sequences
[n
].line_info_lookup
= NULL
;
1687 sequences
[n
].num_lines
= 0;
1688 seq
= seq
->prev_sequence
;
1691 BFD_ASSERT (seq
== NULL
);
1693 qsort (sequences
, n
, sizeof (struct line_sequence
), compare_sequences
);
1695 /* Make the list binary-searchable by trimming overlapping entries
1696 and removing nested entries. */
1698 last_high_pc
= sequences
[0].last_line
->address
;
1699 for (n
= 1; n
< table
->num_sequences
; n
++)
1701 if (sequences
[n
].low_pc
< last_high_pc
)
1703 if (sequences
[n
].last_line
->address
<= last_high_pc
)
1704 /* Skip nested entries. */
1707 /* Trim overlapping entries. */
1708 sequences
[n
].low_pc
= last_high_pc
;
1710 last_high_pc
= sequences
[n
].last_line
->address
;
1711 if (n
> num_sequences
)
1713 /* Close up the gap. */
1714 sequences
[num_sequences
].low_pc
= sequences
[n
].low_pc
;
1715 sequences
[num_sequences
].last_line
= sequences
[n
].last_line
;
1720 table
->sequences
= sequences
;
1721 table
->num_sequences
= num_sequences
;
1725 /* Decode the line number information for UNIT. */
1727 static struct line_info_table
*
1728 decode_line_info (struct comp_unit
*unit
, struct dwarf2_debug
*stash
)
1730 bfd
*abfd
= unit
->abfd
;
1731 struct line_info_table
* table
;
1734 struct line_head lh
;
1735 unsigned int i
, bytes_read
, offset_size
;
1736 char *cur_file
, *cur_dir
;
1737 unsigned char op_code
, extended_op
, adj_opcode
;
1738 unsigned int exop_len
;
1741 if (! read_section (abfd
, &stash
->debug_sections
[debug_line
],
1742 stash
->syms
, unit
->line_offset
,
1743 &stash
->dwarf_line_buffer
, &stash
->dwarf_line_size
))
1746 amt
= sizeof (struct line_info_table
);
1747 table
= (struct line_info_table
*) bfd_alloc (abfd
, amt
);
1751 table
->comp_dir
= unit
->comp_dir
;
1753 table
->num_files
= 0;
1754 table
->files
= NULL
;
1756 table
->num_dirs
= 0;
1759 table
->num_sequences
= 0;
1760 table
->sequences
= NULL
;
1762 table
->lcl_head
= NULL
;
1764 if (stash
->dwarf_line_size
< 16)
1767 (_("Dwarf Error: Line info section is too small (%ld)"),
1768 (long) stash
->dwarf_line_size
);
1769 bfd_set_error (bfd_error_bad_value
);
1772 line_ptr
= stash
->dwarf_line_buffer
+ unit
->line_offset
;
1773 line_end
= stash
->dwarf_line_buffer
+ stash
->dwarf_line_size
;
1775 /* Read in the prologue. */
1776 lh
.total_length
= read_4_bytes (abfd
, line_ptr
, line_end
);
1779 if (lh
.total_length
== 0xffffffff)
1781 lh
.total_length
= read_8_bytes (abfd
, line_ptr
, line_end
);
1785 else if (lh
.total_length
== 0 && unit
->addr_size
== 8)
1787 /* Handle (non-standard) 64-bit DWARF2 formats. */
1788 lh
.total_length
= read_4_bytes (abfd
, line_ptr
, line_end
);
1793 if (lh
.total_length
> stash
->dwarf_line_size
)
1796 /* xgettext: c-format */
1797 (_("Dwarf Error: Line info data is bigger (0x%lx) than the section (0x%lx)"),
1798 (long) lh
.total_length
, (long) stash
->dwarf_line_size
);
1799 bfd_set_error (bfd_error_bad_value
);
1803 line_end
= line_ptr
+ lh
.total_length
;
1805 lh
.version
= read_2_bytes (abfd
, line_ptr
, line_end
);
1806 if (lh
.version
< 2 || lh
.version
> 4)
1809 (_("Dwarf Error: Unhandled .debug_line version %d."), lh
.version
);
1810 bfd_set_error (bfd_error_bad_value
);
1815 if (line_ptr
+ offset_size
+ (lh
.version
>=4 ? 6 : 5) >= line_end
)
1818 (_("Dwarf Error: Ran out of room reading prologue"));
1819 bfd_set_error (bfd_error_bad_value
);
1823 if (offset_size
== 4)
1824 lh
.prologue_length
= read_4_bytes (abfd
, line_ptr
, line_end
);
1826 lh
.prologue_length
= read_8_bytes (abfd
, line_ptr
, line_end
);
1827 line_ptr
+= offset_size
;
1829 lh
.minimum_instruction_length
= read_1_byte (abfd
, line_ptr
, line_end
);
1832 if (lh
.version
>= 4)
1834 lh
.maximum_ops_per_insn
= read_1_byte (abfd
, line_ptr
, line_end
);
1838 lh
.maximum_ops_per_insn
= 1;
1840 if (lh
.maximum_ops_per_insn
== 0)
1843 (_("Dwarf Error: Invalid maximum operations per instruction."));
1844 bfd_set_error (bfd_error_bad_value
);
1848 lh
.default_is_stmt
= read_1_byte (abfd
, line_ptr
, line_end
);
1851 lh
.line_base
= read_1_signed_byte (abfd
, line_ptr
, line_end
);
1854 lh
.line_range
= read_1_byte (abfd
, line_ptr
, line_end
);
1857 lh
.opcode_base
= read_1_byte (abfd
, line_ptr
, line_end
);
1860 if (line_ptr
+ (lh
.opcode_base
- 1) >= line_end
)
1862 _bfd_error_handler (_("Dwarf Error: Ran out of room reading opcodes"));
1863 bfd_set_error (bfd_error_bad_value
);
1867 amt
= lh
.opcode_base
* sizeof (unsigned char);
1868 lh
.standard_opcode_lengths
= (unsigned char *) bfd_alloc (abfd
, amt
);
1870 lh
.standard_opcode_lengths
[0] = 1;
1872 for (i
= 1; i
< lh
.opcode_base
; ++i
)
1874 lh
.standard_opcode_lengths
[i
] = read_1_byte (abfd
, line_ptr
, line_end
);
1878 /* Read directory table. */
1879 while ((cur_dir
= read_string (abfd
, line_ptr
, line_end
, &bytes_read
)) != NULL
)
1881 line_ptr
+= bytes_read
;
1883 if ((table
->num_dirs
% DIR_ALLOC_CHUNK
) == 0)
1887 amt
= table
->num_dirs
+ DIR_ALLOC_CHUNK
;
1888 amt
*= sizeof (char *);
1890 tmp
= (char **) bfd_realloc (table
->dirs
, amt
);
1896 table
->dirs
[table
->num_dirs
++] = cur_dir
;
1899 line_ptr
+= bytes_read
;
1901 /* Read file name table. */
1902 while ((cur_file
= read_string (abfd
, line_ptr
, line_end
, &bytes_read
)) != NULL
)
1904 line_ptr
+= bytes_read
;
1906 if ((table
->num_files
% FILE_ALLOC_CHUNK
) == 0)
1908 struct fileinfo
*tmp
;
1910 amt
= table
->num_files
+ FILE_ALLOC_CHUNK
;
1911 amt
*= sizeof (struct fileinfo
);
1913 tmp
= (struct fileinfo
*) bfd_realloc (table
->files
, amt
);
1919 table
->files
[table
->num_files
].name
= cur_file
;
1920 table
->files
[table
->num_files
].dir
=
1921 safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
1922 line_ptr
+= bytes_read
;
1923 table
->files
[table
->num_files
].time
= safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
1924 line_ptr
+= bytes_read
;
1925 table
->files
[table
->num_files
].size
= safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
1926 line_ptr
+= bytes_read
;
1930 line_ptr
+= bytes_read
;
1932 /* Read the statement sequences until there's nothing left. */
1933 while (line_ptr
< line_end
)
1935 /* State machine registers. */
1936 bfd_vma address
= 0;
1937 unsigned char op_index
= 0;
1938 char * filename
= table
->num_files
? concat_filename (table
, 1) : NULL
;
1939 unsigned int line
= 1;
1940 unsigned int column
= 0;
1941 unsigned int discriminator
= 0;
1942 int is_stmt
= lh
.default_is_stmt
;
1943 int end_sequence
= 0;
1944 /* eraxxon@alumni.rice.edu: Against the DWARF2 specs, some
1945 compilers generate address sequences that are wildly out of
1946 order using DW_LNE_set_address (e.g. Intel C++ 6.0 compiler
1947 for ia64-Linux). Thus, to determine the low and high
1948 address, we must compare on every DW_LNS_copy, etc. */
1949 bfd_vma low_pc
= (bfd_vma
) -1;
1950 bfd_vma high_pc
= 0;
1952 /* Decode the table. */
1953 while (! end_sequence
)
1955 op_code
= read_1_byte (abfd
, line_ptr
, line_end
);
1958 if (op_code
>= lh
.opcode_base
)
1960 /* Special operand. */
1961 adj_opcode
= op_code
- lh
.opcode_base
;
1962 if (lh
.line_range
== 0)
1964 if (lh
.maximum_ops_per_insn
== 1)
1965 address
+= (adj_opcode
/ lh
.line_range
1966 * lh
.minimum_instruction_length
);
1969 address
+= ((op_index
+ adj_opcode
/ lh
.line_range
)
1970 / lh
.maximum_ops_per_insn
1971 * lh
.minimum_instruction_length
);
1972 op_index
= ((op_index
+ adj_opcode
/ lh
.line_range
)
1973 % lh
.maximum_ops_per_insn
);
1975 line
+= lh
.line_base
+ (adj_opcode
% lh
.line_range
);
1976 /* Append row to matrix using current values. */
1977 if (!add_line_info (table
, address
, op_index
, filename
,
1978 line
, column
, discriminator
, 0))
1981 if (address
< low_pc
)
1983 if (address
> high_pc
)
1986 else switch (op_code
)
1988 case DW_LNS_extended_op
:
1989 exop_len
= safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
1990 line_ptr
+= bytes_read
;
1991 extended_op
= read_1_byte (abfd
, line_ptr
, line_end
);
1994 switch (extended_op
)
1996 case DW_LNE_end_sequence
:
1998 if (!add_line_info (table
, address
, op_index
, filename
, line
,
1999 column
, discriminator
, end_sequence
))
2002 if (address
< low_pc
)
2004 if (address
> high_pc
)
2006 if (!arange_add (unit
, &unit
->arange
, low_pc
, high_pc
))
2009 case DW_LNE_set_address
:
2010 address
= read_address (unit
, line_ptr
, line_end
);
2012 line_ptr
+= unit
->addr_size
;
2014 case DW_LNE_define_file
:
2015 cur_file
= read_string (abfd
, line_ptr
, line_end
, &bytes_read
);
2016 line_ptr
+= bytes_read
;
2017 if ((table
->num_files
% FILE_ALLOC_CHUNK
) == 0)
2019 struct fileinfo
*tmp
;
2021 amt
= table
->num_files
+ FILE_ALLOC_CHUNK
;
2022 amt
*= sizeof (struct fileinfo
);
2023 tmp
= (struct fileinfo
*) bfd_realloc (table
->files
, amt
);
2028 table
->files
[table
->num_files
].name
= cur_file
;
2029 table
->files
[table
->num_files
].dir
=
2030 safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2031 line_ptr
+= bytes_read
;
2032 table
->files
[table
->num_files
].time
=
2033 safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2034 line_ptr
+= bytes_read
;
2035 table
->files
[table
->num_files
].size
=
2036 safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2037 line_ptr
+= bytes_read
;
2040 case DW_LNE_set_discriminator
:
2042 safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2043 line_ptr
+= bytes_read
;
2045 case DW_LNE_HP_source_file_correlation
:
2046 line_ptr
+= exop_len
- 1;
2050 (_("Dwarf Error: mangled line number section."));
2051 bfd_set_error (bfd_error_bad_value
);
2053 if (filename
!= NULL
)
2059 if (!add_line_info (table
, address
, op_index
,
2060 filename
, line
, column
, discriminator
, 0))
2063 if (address
< low_pc
)
2065 if (address
> high_pc
)
2068 case DW_LNS_advance_pc
:
2069 if (lh
.maximum_ops_per_insn
== 1)
2070 address
+= (lh
.minimum_instruction_length
2071 * safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2075 bfd_vma adjust
= safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2077 address
= ((op_index
+ adjust
) / lh
.maximum_ops_per_insn
2078 * lh
.minimum_instruction_length
);
2079 op_index
= (op_index
+ adjust
) % lh
.maximum_ops_per_insn
;
2081 line_ptr
+= bytes_read
;
2083 case DW_LNS_advance_line
:
2084 line
+= safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, TRUE
, line_end
);
2085 line_ptr
+= bytes_read
;
2087 case DW_LNS_set_file
:
2091 /* The file and directory tables are 0
2092 based, the references are 1 based. */
2093 file
= safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2094 line_ptr
+= bytes_read
;
2097 filename
= concat_filename (table
, file
);
2100 case DW_LNS_set_column
:
2101 column
= safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2102 line_ptr
+= bytes_read
;
2104 case DW_LNS_negate_stmt
:
2105 is_stmt
= (!is_stmt
);
2107 case DW_LNS_set_basic_block
:
2109 case DW_LNS_const_add_pc
:
2110 if (lh
.maximum_ops_per_insn
== 1)
2111 address
+= (lh
.minimum_instruction_length
2112 * ((255 - lh
.opcode_base
) / lh
.line_range
));
2115 bfd_vma adjust
= ((255 - lh
.opcode_base
) / lh
.line_range
);
2116 address
+= (lh
.minimum_instruction_length
2117 * ((op_index
+ adjust
)
2118 / lh
.maximum_ops_per_insn
));
2119 op_index
= (op_index
+ adjust
) % lh
.maximum_ops_per_insn
;
2122 case DW_LNS_fixed_advance_pc
:
2123 address
+= read_2_bytes (abfd
, line_ptr
, line_end
);
2128 /* Unknown standard opcode, ignore it. */
2129 for (i
= 0; i
< lh
.standard_opcode_lengths
[op_code
]; i
++)
2131 (void) safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2132 line_ptr
+= bytes_read
;
2142 if (sort_line_sequences (table
))
2146 if (table
->sequences
!= NULL
)
2147 free (table
->sequences
);
2148 if (table
->files
!= NULL
)
2149 free (table
->files
);
2150 if (table
->dirs
!= NULL
)
2155 /* If ADDR is within TABLE set the output parameters and return the
2156 range of addresses covered by the entry used to fill them out.
2157 Otherwise set * FILENAME_PTR to NULL and return 0.
2158 The parameters FILENAME_PTR, LINENUMBER_PTR and DISCRIMINATOR_PTR
2159 are pointers to the objects to be filled in. */
2162 lookup_address_in_line_info_table (struct line_info_table
*table
,
2164 const char **filename_ptr
,
2165 unsigned int *linenumber_ptr
,
2166 unsigned int *discriminator_ptr
)
2168 struct line_sequence
*seq
= NULL
;
2169 struct line_info
*info
;
2172 /* Binary search the array of sequences. */
2174 high
= table
->num_sequences
;
2177 mid
= (low
+ high
) / 2;
2178 seq
= &table
->sequences
[mid
];
2179 if (addr
< seq
->low_pc
)
2181 else if (addr
>= seq
->last_line
->address
)
2187 /* Check for a valid sequence. */
2188 if (!seq
|| addr
< seq
->low_pc
|| addr
>= seq
->last_line
->address
)
2191 if (!build_line_info_table (table
, seq
))
2194 /* Binary search the array of line information. */
2196 high
= seq
->num_lines
;
2200 mid
= (low
+ high
) / 2;
2201 info
= seq
->line_info_lookup
[mid
];
2202 if (addr
< info
->address
)
2204 else if (addr
>= seq
->line_info_lookup
[mid
+ 1]->address
)
2210 /* Check for a valid line information entry. */
2212 && addr
>= info
->address
2213 && addr
< seq
->line_info_lookup
[mid
+ 1]->address
2214 && !(info
->end_sequence
|| info
== seq
->last_line
))
2216 *filename_ptr
= info
->filename
;
2217 *linenumber_ptr
= info
->line
;
2218 if (discriminator_ptr
)
2219 *discriminator_ptr
= info
->discriminator
;
2220 return seq
->last_line
->address
- seq
->low_pc
;
2224 *filename_ptr
= NULL
;
2228 /* Read in the .debug_ranges section for future reference. */
2231 read_debug_ranges (struct comp_unit
* unit
)
2233 struct dwarf2_debug
* stash
= unit
->stash
;
2235 return read_section (unit
->abfd
, &stash
->debug_sections
[debug_ranges
],
2237 &stash
->dwarf_ranges_buffer
,
2238 &stash
->dwarf_ranges_size
);
2241 /* Function table functions. */
2244 compare_lookup_funcinfos (const void * a
, const void * b
)
2246 const struct lookup_funcinfo
* lookup1
= a
;
2247 const struct lookup_funcinfo
* lookup2
= b
;
2249 if (lookup1
->low_addr
< lookup2
->low_addr
)
2251 if (lookup1
->low_addr
> lookup2
->low_addr
)
2253 if (lookup1
->high_addr
< lookup2
->high_addr
)
2255 if (lookup1
->high_addr
> lookup2
->high_addr
)
2262 build_lookup_funcinfo_table (struct comp_unit
* unit
)
2264 struct lookup_funcinfo
*lookup_funcinfo_table
= unit
->lookup_funcinfo_table
;
2265 unsigned int number_of_functions
= unit
->number_of_functions
;
2266 struct funcinfo
*each
;
2267 struct lookup_funcinfo
*entry
;
2269 struct arange
*range
;
2270 bfd_vma low_addr
, high_addr
;
2272 if (lookup_funcinfo_table
|| number_of_functions
== 0)
2275 /* Create the function info lookup table. */
2276 lookup_funcinfo_table
= (struct lookup_funcinfo
*)
2277 bfd_malloc (number_of_functions
* sizeof (struct lookup_funcinfo
));
2278 if (lookup_funcinfo_table
== NULL
)
2281 /* Populate the function info lookup table. */
2282 func_index
= number_of_functions
;
2283 for (each
= unit
->function_table
; each
; each
= each
->prev_func
)
2285 entry
= &lookup_funcinfo_table
[--func_index
];
2286 entry
->funcinfo
= each
;
2288 /* Calculate the lowest and highest address for this function entry. */
2289 low_addr
= entry
->funcinfo
->arange
.low
;
2290 high_addr
= entry
->funcinfo
->arange
.high
;
2292 for (range
= entry
->funcinfo
->arange
.next
; range
; range
= range
->next
)
2294 if (range
->low
< low_addr
)
2295 low_addr
= range
->low
;
2296 if (range
->high
> high_addr
)
2297 high_addr
= range
->high
;
2300 entry
->low_addr
= low_addr
;
2301 entry
->high_addr
= high_addr
;
2304 BFD_ASSERT (func_index
== 0);
2306 /* Sort the function by address. */
2307 qsort (lookup_funcinfo_table
,
2308 number_of_functions
,
2309 sizeof (struct lookup_funcinfo
),
2310 compare_lookup_funcinfos
);
2312 /* Calculate the high watermark for each function in the lookup table. */
2313 high_addr
= lookup_funcinfo_table
[0].high_addr
;
2314 for (func_index
= 1; func_index
< number_of_functions
; func_index
++)
2316 entry
= &lookup_funcinfo_table
[func_index
];
2317 if (entry
->high_addr
> high_addr
)
2318 high_addr
= entry
->high_addr
;
2320 entry
->high_addr
= high_addr
;
2323 unit
->lookup_funcinfo_table
= lookup_funcinfo_table
;
2327 /* If ADDR is within UNIT's function tables, set FUNCTION_PTR, and return
2328 TRUE. Note that we need to find the function that has the smallest range
2329 that contains ADDR, to handle inlined functions without depending upon
2330 them being ordered in TABLE by increasing range. */
2333 lookup_address_in_function_table (struct comp_unit
*unit
,
2335 struct funcinfo
**function_ptr
)
2337 unsigned int number_of_functions
= unit
->number_of_functions
;
2338 struct lookup_funcinfo
* lookup_funcinfo
= NULL
;
2339 struct funcinfo
* funcinfo
= NULL
;
2340 struct funcinfo
* best_fit
= NULL
;
2341 bfd_vma best_fit_len
= 0;
2342 bfd_size_type low
, high
, mid
, first
;
2343 struct arange
*arange
;
2345 if (number_of_functions
== 0)
2348 if (!build_lookup_funcinfo_table (unit
))
2351 if (unit
->lookup_funcinfo_table
[number_of_functions
- 1].high_addr
< addr
)
2354 /* Find the first function in the lookup table which may contain the
2355 specified address. */
2357 high
= number_of_functions
;
2361 mid
= (low
+ high
) / 2;
2362 lookup_funcinfo
= &unit
->lookup_funcinfo_table
[mid
];
2363 if (addr
< lookup_funcinfo
->low_addr
)
2365 else if (addr
>= lookup_funcinfo
->high_addr
)
2371 /* Find the 'best' match for the address. The prior algorithm defined the
2372 best match as the function with the smallest address range containing
2373 the specified address. This definition should probably be changed to the
2374 innermost inline routine containing the address, but right now we want
2375 to get the same results we did before. */
2376 while (first
< number_of_functions
)
2378 if (addr
< unit
->lookup_funcinfo_table
[first
].low_addr
)
2380 funcinfo
= unit
->lookup_funcinfo_table
[first
].funcinfo
;
2382 for (arange
= &funcinfo
->arange
; arange
; arange
= arange
->next
)
2384 if (addr
< arange
->low
|| addr
>= arange
->high
)
2388 || arange
->high
- arange
->low
< best_fit_len
2389 /* The following comparison is designed to return the same
2390 match as the previous algorithm for routines which have the
2391 same best fit length. */
2392 || (arange
->high
- arange
->low
== best_fit_len
2393 && funcinfo
> best_fit
))
2395 best_fit
= funcinfo
;
2396 best_fit_len
= arange
->high
- arange
->low
;
2406 *function_ptr
= best_fit
;
2410 /* If SYM at ADDR is within function table of UNIT, set FILENAME_PTR
2411 and LINENUMBER_PTR, and return TRUE. */
2414 lookup_symbol_in_function_table (struct comp_unit
*unit
,
2417 const char **filename_ptr
,
2418 unsigned int *linenumber_ptr
)
2420 struct funcinfo
* each_func
;
2421 struct funcinfo
* best_fit
= NULL
;
2422 bfd_vma best_fit_len
= 0;
2423 struct arange
*arange
;
2424 const char *name
= bfd_asymbol_name (sym
);
2425 asection
*sec
= bfd_get_section (sym
);
2427 for (each_func
= unit
->function_table
;
2429 each_func
= each_func
->prev_func
)
2431 for (arange
= &each_func
->arange
;
2433 arange
= arange
->next
)
2435 if ((!each_func
->sec
|| each_func
->sec
== sec
)
2436 && addr
>= arange
->low
2437 && addr
< arange
->high
2439 && strcmp (name
, each_func
->name
) == 0
2441 || arange
->high
- arange
->low
< best_fit_len
))
2443 best_fit
= each_func
;
2444 best_fit_len
= arange
->high
- arange
->low
;
2451 best_fit
->sec
= sec
;
2452 *filename_ptr
= best_fit
->file
;
2453 *linenumber_ptr
= best_fit
->line
;
2460 /* Variable table functions. */
2462 /* If SYM is within variable table of UNIT, set FILENAME_PTR and
2463 LINENUMBER_PTR, and return TRUE. */
2466 lookup_symbol_in_variable_table (struct comp_unit
*unit
,
2469 const char **filename_ptr
,
2470 unsigned int *linenumber_ptr
)
2472 const char *name
= bfd_asymbol_name (sym
);
2473 asection
*sec
= bfd_get_section (sym
);
2474 struct varinfo
* each
;
2476 for (each
= unit
->variable_table
; each
; each
= each
->prev_var
)
2477 if (each
->stack
== 0
2478 && each
->file
!= NULL
2479 && each
->name
!= NULL
2480 && each
->addr
== addr
2481 && (!each
->sec
|| each
->sec
== sec
)
2482 && strcmp (name
, each
->name
) == 0)
2488 *filename_ptr
= each
->file
;
2489 *linenumber_ptr
= each
->line
;
2497 find_abstract_instance_name (struct comp_unit
*unit
,
2498 struct attribute
*attr_ptr
,
2499 bfd_boolean
*is_linkage
)
2501 bfd
*abfd
= unit
->abfd
;
2503 bfd_byte
*info_ptr_end
;
2504 unsigned int abbrev_number
, bytes_read
, i
;
2505 struct abbrev_info
*abbrev
;
2506 bfd_uint64_t die_ref
= attr_ptr
->u
.val
;
2507 struct attribute attr
;
2510 /* DW_FORM_ref_addr can reference an entry in a different CU. It
2511 is an offset from the .debug_info section, not the current CU. */
2512 if (attr_ptr
->form
== DW_FORM_ref_addr
)
2514 /* We only support DW_FORM_ref_addr within the same file, so
2515 any relocations should be resolved already. */
2519 info_ptr
= unit
->sec_info_ptr
+ die_ref
;
2520 info_ptr_end
= unit
->end_ptr
;
2522 /* Now find the CU containing this pointer. */
2523 if (info_ptr
>= unit
->info_ptr_unit
&& info_ptr
< unit
->end_ptr
)
2527 /* Check other CUs to see if they contain the abbrev. */
2528 struct comp_unit
* u
;
2530 for (u
= unit
->prev_unit
; u
!= NULL
; u
= u
->prev_unit
)
2531 if (info_ptr
>= u
->info_ptr_unit
&& info_ptr
< u
->end_ptr
)
2535 for (u
= unit
->next_unit
; u
!= NULL
; u
= u
->next_unit
)
2536 if (info_ptr
>= u
->info_ptr_unit
&& info_ptr
< u
->end_ptr
)
2541 /* else FIXME: What do we do now ? */
2544 else if (attr_ptr
->form
== DW_FORM_GNU_ref_alt
)
2546 info_ptr
= read_alt_indirect_ref (unit
, die_ref
);
2547 if (info_ptr
== NULL
)
2550 (_("Dwarf Error: Unable to read alt ref %u."), die_ref
);
2551 bfd_set_error (bfd_error_bad_value
);
2554 info_ptr_end
= unit
->stash
->alt_dwarf_info_buffer
+ unit
->stash
->alt_dwarf_info_size
;
2556 /* FIXME: Do we need to locate the correct CU, in a similar
2557 fashion to the code in the DW_FORM_ref_addr case above ? */
2561 info_ptr
= unit
->info_ptr_unit
+ die_ref
;
2562 info_ptr_end
= unit
->end_ptr
;
2565 abbrev_number
= safe_read_leb128 (abfd
, info_ptr
, &bytes_read
, FALSE
, info_ptr_end
);
2566 info_ptr
+= bytes_read
;
2570 abbrev
= lookup_abbrev (abbrev_number
, unit
->abbrevs
);
2574 (_("Dwarf Error: Could not find abbrev number %u."), abbrev_number
);
2575 bfd_set_error (bfd_error_bad_value
);
2579 for (i
= 0; i
< abbrev
->num_attrs
; ++i
)
2581 info_ptr
= read_attribute (&attr
, &abbrev
->attrs
[i
], unit
,
2582 info_ptr
, info_ptr_end
);
2583 if (info_ptr
== NULL
)
2588 /* Prefer DW_AT_MIPS_linkage_name or DW_AT_linkage_name
2590 if (name
== NULL
&& is_str_attr (attr
.form
))
2593 if (non_mangled (unit
->lang
))
2597 case DW_AT_specification
:
2598 name
= find_abstract_instance_name (unit
, &attr
, is_linkage
);
2600 case DW_AT_linkage_name
:
2601 case DW_AT_MIPS_linkage_name
:
2602 /* PR 16949: Corrupt debug info can place
2603 non-string forms into these attributes. */
2604 if (is_str_attr (attr
.form
))
2620 read_rangelist (struct comp_unit
*unit
, struct arange
*arange
,
2621 bfd_uint64_t offset
)
2623 bfd_byte
*ranges_ptr
;
2624 bfd_byte
*ranges_end
;
2625 bfd_vma base_address
= unit
->base_address
;
2627 if (! unit
->stash
->dwarf_ranges_buffer
)
2629 if (! read_debug_ranges (unit
))
2633 ranges_ptr
= unit
->stash
->dwarf_ranges_buffer
+ offset
;
2634 if (ranges_ptr
< unit
->stash
->dwarf_ranges_buffer
)
2636 ranges_end
= unit
->stash
->dwarf_ranges_buffer
+ unit
->stash
->dwarf_ranges_size
;
2643 /* PR 17512: file: 62cada7d. */
2644 if (ranges_ptr
+ 2 * unit
->addr_size
> ranges_end
)
2647 low_pc
= read_address (unit
, ranges_ptr
, ranges_end
);
2648 ranges_ptr
+= unit
->addr_size
;
2649 high_pc
= read_address (unit
, ranges_ptr
, ranges_end
);
2650 ranges_ptr
+= unit
->addr_size
;
2652 if (low_pc
== 0 && high_pc
== 0)
2654 if (low_pc
== -1UL && high_pc
!= -1UL)
2655 base_address
= high_pc
;
2658 if (!arange_add (unit
, arange
,
2659 base_address
+ low_pc
, base_address
+ high_pc
))
2666 /* DWARF2 Compilation unit functions. */
2668 /* Scan over each die in a comp. unit looking for functions to add
2669 to the function table and variables to the variable table. */
2672 scan_unit_for_symbols (struct comp_unit
*unit
)
2674 bfd
*abfd
= unit
->abfd
;
2675 bfd_byte
*info_ptr
= unit
->first_child_die_ptr
;
2676 bfd_byte
*info_ptr_end
= unit
->stash
->info_ptr_end
;
2677 int nesting_level
= 1;
2678 struct funcinfo
**nested_funcs
;
2679 int nested_funcs_size
;
2681 /* Maintain a stack of in-scope functions and inlined functions, which we
2682 can use to set the caller_func field. */
2683 nested_funcs_size
= 32;
2684 nested_funcs
= (struct funcinfo
**)
2685 bfd_malloc (nested_funcs_size
* sizeof (struct funcinfo
*));
2686 if (nested_funcs
== NULL
)
2688 nested_funcs
[nesting_level
] = 0;
2690 while (nesting_level
)
2692 unsigned int abbrev_number
, bytes_read
, i
;
2693 struct abbrev_info
*abbrev
;
2694 struct attribute attr
;
2695 struct funcinfo
*func
;
2696 struct varinfo
*var
;
2698 bfd_vma high_pc
= 0;
2699 bfd_boolean high_pc_relative
= FALSE
;
2701 /* PR 17512: file: 9f405d9d. */
2702 if (info_ptr
>= info_ptr_end
)
2705 abbrev_number
= safe_read_leb128 (abfd
, info_ptr
, &bytes_read
, FALSE
, info_ptr_end
);
2706 info_ptr
+= bytes_read
;
2708 if (! abbrev_number
)
2714 abbrev
= lookup_abbrev (abbrev_number
,unit
->abbrevs
);
2718 (_("Dwarf Error: Could not find abbrev number %u."),
2720 bfd_set_error (bfd_error_bad_value
);
2725 if (abbrev
->tag
== DW_TAG_subprogram
2726 || abbrev
->tag
== DW_TAG_entry_point
2727 || abbrev
->tag
== DW_TAG_inlined_subroutine
)
2729 bfd_size_type amt
= sizeof (struct funcinfo
);
2730 func
= (struct funcinfo
*) bfd_zalloc (abfd
, amt
);
2733 func
->tag
= abbrev
->tag
;
2734 func
->prev_func
= unit
->function_table
;
2735 unit
->function_table
= func
;
2736 unit
->number_of_functions
++;
2737 BFD_ASSERT (!unit
->cached
);
2739 if (func
->tag
== DW_TAG_inlined_subroutine
)
2740 for (i
= nesting_level
- 1; i
>= 1; i
--)
2741 if (nested_funcs
[i
])
2743 func
->caller_func
= nested_funcs
[i
];
2746 nested_funcs
[nesting_level
] = func
;
2751 if (abbrev
->tag
== DW_TAG_variable
)
2753 bfd_size_type amt
= sizeof (struct varinfo
);
2754 var
= (struct varinfo
*) bfd_zalloc (abfd
, amt
);
2757 var
->tag
= abbrev
->tag
;
2759 var
->prev_var
= unit
->variable_table
;
2760 unit
->variable_table
= var
;
2761 BFD_ASSERT (!unit
->cached
);
2764 /* No inline function in scope at this nesting level. */
2765 nested_funcs
[nesting_level
] = 0;
2768 for (i
= 0; i
< abbrev
->num_attrs
; ++i
)
2770 info_ptr
= read_attribute (&attr
, &abbrev
->attrs
[i
], unit
, info_ptr
, info_ptr_end
);
2771 if (info_ptr
== NULL
)
2778 case DW_AT_call_file
:
2779 func
->caller_file
= concat_filename (unit
->line_table
,
2783 case DW_AT_call_line
:
2784 func
->caller_line
= attr
.u
.val
;
2787 case DW_AT_abstract_origin
:
2788 case DW_AT_specification
:
2789 func
->name
= find_abstract_instance_name (unit
, &attr
,
2794 /* Prefer DW_AT_MIPS_linkage_name or DW_AT_linkage_name
2796 if (func
->name
== NULL
&& is_str_attr (attr
.form
))
2798 func
->name
= attr
.u
.str
;
2799 if (non_mangled (unit
->lang
))
2800 func
->is_linkage
= TRUE
;
2804 case DW_AT_linkage_name
:
2805 case DW_AT_MIPS_linkage_name
:
2806 /* PR 16949: Corrupt debug info can place
2807 non-string forms into these attributes. */
2808 if (is_str_attr (attr
.form
))
2810 func
->name
= attr
.u
.str
;
2811 func
->is_linkage
= TRUE
;
2816 low_pc
= attr
.u
.val
;
2820 high_pc
= attr
.u
.val
;
2821 high_pc_relative
= attr
.form
!= DW_FORM_addr
;
2825 if (!read_rangelist (unit
, &func
->arange
, attr
.u
.val
))
2829 case DW_AT_decl_file
:
2830 func
->file
= concat_filename (unit
->line_table
,
2834 case DW_AT_decl_line
:
2835 func
->line
= attr
.u
.val
;
2847 var
->name
= attr
.u
.str
;
2850 case DW_AT_decl_file
:
2851 var
->file
= concat_filename (unit
->line_table
,
2855 case DW_AT_decl_line
:
2856 var
->line
= attr
.u
.val
;
2859 case DW_AT_external
:
2860 if (attr
.u
.val
!= 0)
2864 case DW_AT_location
:
2868 case DW_FORM_block1
:
2869 case DW_FORM_block2
:
2870 case DW_FORM_block4
:
2871 case DW_FORM_exprloc
:
2872 if (*attr
.u
.blk
->data
== DW_OP_addr
)
2876 /* Verify that DW_OP_addr is the only opcode in the
2877 location, in which case the block size will be 1
2878 plus the address size. */
2879 /* ??? For TLS variables, gcc can emit
2880 DW_OP_addr <addr> DW_OP_GNU_push_tls_address
2881 which we don't handle here yet. */
2882 if (attr
.u
.blk
->size
== unit
->addr_size
+ 1U)
2883 var
->addr
= bfd_get (unit
->addr_size
* 8,
2885 attr
.u
.blk
->data
+ 1);
2900 if (high_pc_relative
)
2903 if (func
&& high_pc
!= 0)
2905 if (!arange_add (unit
, &func
->arange
, low_pc
, high_pc
))
2909 if (abbrev
->has_children
)
2913 if (nesting_level
>= nested_funcs_size
)
2915 struct funcinfo
**tmp
;
2917 nested_funcs_size
*= 2;
2918 tmp
= (struct funcinfo
**)
2919 bfd_realloc (nested_funcs
,
2920 nested_funcs_size
* sizeof (struct funcinfo
*));
2925 nested_funcs
[nesting_level
] = 0;
2929 free (nested_funcs
);
2933 free (nested_funcs
);
2937 /* Parse a DWARF2 compilation unit starting at INFO_PTR. This
2938 includes the compilation unit header that proceeds the DIE's, but
2939 does not include the length field that precedes each compilation
2940 unit header. END_PTR points one past the end of this comp unit.
2941 OFFSET_SIZE is the size of DWARF2 offsets (either 4 or 8 bytes).
2943 This routine does not read the whole compilation unit; only enough
2944 to get to the line number information for the compilation unit. */
2946 static struct comp_unit
*
2947 parse_comp_unit (struct dwarf2_debug
*stash
,
2948 bfd_vma unit_length
,
2949 bfd_byte
*info_ptr_unit
,
2950 unsigned int offset_size
)
2952 struct comp_unit
* unit
;
2953 unsigned int version
;
2954 bfd_uint64_t abbrev_offset
= 0;
2955 unsigned int addr_size
;
2956 struct abbrev_info
** abbrevs
;
2957 unsigned int abbrev_number
, bytes_read
, i
;
2958 struct abbrev_info
*abbrev
;
2959 struct attribute attr
;
2960 bfd_byte
*info_ptr
= stash
->info_ptr
;
2961 bfd_byte
*end_ptr
= info_ptr
+ unit_length
;
2964 bfd_vma high_pc
= 0;
2965 bfd
*abfd
= stash
->bfd_ptr
;
2966 bfd_boolean high_pc_relative
= FALSE
;
2968 version
= read_2_bytes (abfd
, info_ptr
, end_ptr
);
2970 BFD_ASSERT (offset_size
== 4 || offset_size
== 8);
2971 if (offset_size
== 4)
2972 abbrev_offset
= read_4_bytes (abfd
, info_ptr
, end_ptr
);
2974 abbrev_offset
= read_8_bytes (abfd
, info_ptr
, end_ptr
);
2975 info_ptr
+= offset_size
;
2976 addr_size
= read_1_byte (abfd
, info_ptr
, end_ptr
);
2979 if (version
!= 2 && version
!= 3 && version
!= 4)
2981 /* PR 19872: A version number of 0 probably means that there is padding
2982 at the end of the .debug_info section. Gold puts it there when
2983 performing an incremental link, for example. So do not generate
2984 an error, just return a NULL. */
2988 (_("Dwarf Error: found dwarf version '%u', this reader"
2989 " only handles version 2, 3 and 4 information."), version
);
2990 bfd_set_error (bfd_error_bad_value
);
2995 if (addr_size
> sizeof (bfd_vma
))
2998 /* xgettext: c-format */
2999 (_("Dwarf Error: found address size '%u', this reader"
3000 " can not handle sizes greater than '%u'."),
3002 (unsigned int) sizeof (bfd_vma
));
3003 bfd_set_error (bfd_error_bad_value
);
3007 if (addr_size
!= 2 && addr_size
!= 4 && addr_size
!= 8)
3010 ("Dwarf Error: found address size '%u', this reader"
3011 " can only handle address sizes '2', '4' and '8'.", addr_size
);
3012 bfd_set_error (bfd_error_bad_value
);
3016 /* Read the abbrevs for this compilation unit into a table. */
3017 abbrevs
= read_abbrevs (abfd
, abbrev_offset
, stash
);
3021 abbrev_number
= safe_read_leb128 (abfd
, info_ptr
, &bytes_read
, FALSE
, end_ptr
);
3022 info_ptr
+= bytes_read
;
3023 if (! abbrev_number
)
3025 /* PR 19872: An abbrev number of 0 probably means that there is padding
3026 at the end of the .debug_abbrev section. Gold puts it there when
3027 performing an incremental link, for example. So do not generate
3028 an error, just return a NULL. */
3032 abbrev
= lookup_abbrev (abbrev_number
, abbrevs
);
3035 _bfd_error_handler (_("Dwarf Error: Could not find abbrev number %u."),
3037 bfd_set_error (bfd_error_bad_value
);
3041 amt
= sizeof (struct comp_unit
);
3042 unit
= (struct comp_unit
*) bfd_zalloc (abfd
, amt
);
3046 unit
->version
= version
;
3047 unit
->addr_size
= addr_size
;
3048 unit
->offset_size
= offset_size
;
3049 unit
->abbrevs
= abbrevs
;
3050 unit
->end_ptr
= end_ptr
;
3051 unit
->stash
= stash
;
3052 unit
->info_ptr_unit
= info_ptr_unit
;
3053 unit
->sec_info_ptr
= stash
->sec_info_ptr
;
3055 for (i
= 0; i
< abbrev
->num_attrs
; ++i
)
3057 info_ptr
= read_attribute (&attr
, &abbrev
->attrs
[i
], unit
, info_ptr
, end_ptr
);
3058 if (info_ptr
== NULL
)
3061 /* Store the data if it is of an attribute we want to keep in a
3062 partial symbol table. */
3065 case DW_AT_stmt_list
:
3067 unit
->line_offset
= attr
.u
.val
;
3071 unit
->name
= attr
.u
.str
;
3075 low_pc
= attr
.u
.val
;
3076 /* If the compilation unit DIE has a DW_AT_low_pc attribute,
3077 this is the base address to use when reading location
3078 lists or range lists. */
3079 if (abbrev
->tag
== DW_TAG_compile_unit
)
3080 unit
->base_address
= low_pc
;
3084 high_pc
= attr
.u
.val
;
3085 high_pc_relative
= attr
.form
!= DW_FORM_addr
;
3089 if (!read_rangelist (unit
, &unit
->arange
, attr
.u
.val
))
3093 case DW_AT_comp_dir
:
3095 char *comp_dir
= attr
.u
.str
;
3097 /* PR 17512: file: 1fe726be. */
3098 if (! is_str_attr (attr
.form
))
3101 (_("Dwarf Error: DW_AT_comp_dir attribute encountered with a non-string form."));
3107 /* Irix 6.2 native cc prepends <machine>.: to the compilation
3108 directory, get rid of it. */
3109 char *cp
= strchr (comp_dir
, ':');
3111 if (cp
&& cp
!= comp_dir
&& cp
[-1] == '.' && cp
[1] == '/')
3114 unit
->comp_dir
= comp_dir
;
3118 case DW_AT_language
:
3119 unit
->lang
= attr
.u
.val
;
3126 if (high_pc_relative
)
3130 if (!arange_add (unit
, &unit
->arange
, low_pc
, high_pc
))
3134 unit
->first_child_die_ptr
= info_ptr
;
3138 /* Return TRUE if UNIT may contain the address given by ADDR. When
3139 there are functions written entirely with inline asm statements, the
3140 range info in the compilation unit header may not be correct. We
3141 need to consult the line info table to see if a compilation unit
3142 really contains the given address. */
3145 comp_unit_contains_address (struct comp_unit
*unit
, bfd_vma addr
)
3147 struct arange
*arange
;
3152 arange
= &unit
->arange
;
3155 if (addr
>= arange
->low
&& addr
< arange
->high
)
3157 arange
= arange
->next
;
3164 /* If UNIT contains ADDR, set the output parameters to the values for
3165 the line containing ADDR. The output parameters, FILENAME_PTR,
3166 FUNCTION_PTR, and LINENUMBER_PTR, are pointers to the objects
3169 Returns the range of addresses covered by the entry that was used
3170 to fill in *LINENUMBER_PTR or 0 if it was not filled in. */
3173 comp_unit_find_nearest_line (struct comp_unit
*unit
,
3175 const char **filename_ptr
,
3176 struct funcinfo
**function_ptr
,
3177 unsigned int *linenumber_ptr
,
3178 unsigned int *discriminator_ptr
,
3179 struct dwarf2_debug
*stash
)
3186 if (! unit
->line_table
)
3188 if (! unit
->stmtlist
)
3194 unit
->line_table
= decode_line_info (unit
, stash
);
3196 if (! unit
->line_table
)
3202 if (unit
->first_child_die_ptr
< unit
->end_ptr
3203 && ! scan_unit_for_symbols (unit
))
3210 *function_ptr
= NULL
;
3211 func_p
= lookup_address_in_function_table (unit
, addr
, function_ptr
);
3212 if (func_p
&& (*function_ptr
)->tag
== DW_TAG_inlined_subroutine
)
3213 stash
->inliner_chain
= *function_ptr
;
3215 return lookup_address_in_line_info_table (unit
->line_table
, addr
,
3221 /* Check to see if line info is already decoded in a comp_unit.
3222 If not, decode it. Returns TRUE if no errors were encountered;
3226 comp_unit_maybe_decode_line_info (struct comp_unit
*unit
,
3227 struct dwarf2_debug
*stash
)
3232 if (! unit
->line_table
)
3234 if (! unit
->stmtlist
)
3240 unit
->line_table
= decode_line_info (unit
, stash
);
3242 if (! unit
->line_table
)
3248 if (unit
->first_child_die_ptr
< unit
->end_ptr
3249 && ! scan_unit_for_symbols (unit
))
3259 /* If UNIT contains SYM at ADDR, set the output parameters to the
3260 values for the line containing SYM. The output parameters,
3261 FILENAME_PTR, and LINENUMBER_PTR, are pointers to the objects to be
3264 Return TRUE if UNIT contains SYM, and no errors were encountered;
3268 comp_unit_find_line (struct comp_unit
*unit
,
3271 const char **filename_ptr
,
3272 unsigned int *linenumber_ptr
,
3273 struct dwarf2_debug
*stash
)
3275 if (!comp_unit_maybe_decode_line_info (unit
, stash
))
3278 if (sym
->flags
& BSF_FUNCTION
)
3279 return lookup_symbol_in_function_table (unit
, sym
, addr
,
3283 return lookup_symbol_in_variable_table (unit
, sym
, addr
,
3288 static struct funcinfo
*
3289 reverse_funcinfo_list (struct funcinfo
*head
)
3291 struct funcinfo
*rhead
;
3292 struct funcinfo
*temp
;
3294 for (rhead
= NULL
; head
; head
= temp
)
3296 temp
= head
->prev_func
;
3297 head
->prev_func
= rhead
;
3303 static struct varinfo
*
3304 reverse_varinfo_list (struct varinfo
*head
)
3306 struct varinfo
*rhead
;
3307 struct varinfo
*temp
;
3309 for (rhead
= NULL
; head
; head
= temp
)
3311 temp
= head
->prev_var
;
3312 head
->prev_var
= rhead
;
3318 /* Extract all interesting funcinfos and varinfos of a compilation
3319 unit into hash tables for faster lookup. Returns TRUE if no
3320 errors were enountered; FALSE otherwise. */
3323 comp_unit_hash_info (struct dwarf2_debug
*stash
,
3324 struct comp_unit
*unit
,
3325 struct info_hash_table
*funcinfo_hash_table
,
3326 struct info_hash_table
*varinfo_hash_table
)
3328 struct funcinfo
* each_func
;
3329 struct varinfo
* each_var
;
3330 bfd_boolean okay
= TRUE
;
3332 BFD_ASSERT (stash
->info_hash_status
!= STASH_INFO_HASH_DISABLED
);
3334 if (!comp_unit_maybe_decode_line_info (unit
, stash
))
3337 BFD_ASSERT (!unit
->cached
);
3339 /* To preserve the original search order, we went to visit the function
3340 infos in the reversed order of the list. However, making the list
3341 bi-directional use quite a bit of extra memory. So we reverse
3342 the list first, traverse the list in the now reversed order and
3343 finally reverse the list again to get back the original order. */
3344 unit
->function_table
= reverse_funcinfo_list (unit
->function_table
);
3345 for (each_func
= unit
->function_table
;
3347 each_func
= each_func
->prev_func
)
3349 /* Skip nameless functions. */
3350 if (each_func
->name
)
3351 /* There is no need to copy name string into hash table as
3352 name string is either in the dwarf string buffer or
3353 info in the stash. */
3354 okay
= insert_info_hash_table (funcinfo_hash_table
, each_func
->name
,
3355 (void*) each_func
, FALSE
);
3357 unit
->function_table
= reverse_funcinfo_list (unit
->function_table
);
3361 /* We do the same for variable infos. */
3362 unit
->variable_table
= reverse_varinfo_list (unit
->variable_table
);
3363 for (each_var
= unit
->variable_table
;
3365 each_var
= each_var
->prev_var
)
3367 /* Skip stack vars and vars with no files or names. */
3368 if (each_var
->stack
== 0
3369 && each_var
->file
!= NULL
3370 && each_var
->name
!= NULL
)
3371 /* There is no need to copy name string into hash table as
3372 name string is either in the dwarf string buffer or
3373 info in the stash. */
3374 okay
= insert_info_hash_table (varinfo_hash_table
, each_var
->name
,
3375 (void*) each_var
, FALSE
);
3378 unit
->variable_table
= reverse_varinfo_list (unit
->variable_table
);
3379 unit
->cached
= TRUE
;
3383 /* Locate a section in a BFD containing debugging info. The search starts
3384 from the section after AFTER_SEC, or from the first section in the BFD if
3385 AFTER_SEC is NULL. The search works by examining the names of the
3386 sections. There are three permissiable names. The first two are given
3387 by DEBUG_SECTIONS[debug_info] (whose standard DWARF2 names are .debug_info
3388 and .zdebug_info). The third is a prefix .gnu.linkonce.wi.
3389 This is a variation on the .debug_info section which has a checksum
3390 describing the contents appended onto the name. This allows the linker to
3391 identify and discard duplicate debugging sections for different
3392 compilation units. */
3393 #define GNU_LINKONCE_INFO ".gnu.linkonce.wi."
3396 find_debug_info (bfd
*abfd
, const struct dwarf_debug_section
*debug_sections
,
3397 asection
*after_sec
)
3402 if (after_sec
== NULL
)
3404 look
= debug_sections
[debug_info
].uncompressed_name
;
3405 msec
= bfd_get_section_by_name (abfd
, look
);
3409 look
= debug_sections
[debug_info
].compressed_name
;
3412 msec
= bfd_get_section_by_name (abfd
, look
);
3417 for (msec
= abfd
->sections
; msec
!= NULL
; msec
= msec
->next
)
3418 if (CONST_STRNEQ (msec
->name
, GNU_LINKONCE_INFO
))
3424 for (msec
= after_sec
->next
; msec
!= NULL
; msec
= msec
->next
)
3426 look
= debug_sections
[debug_info
].uncompressed_name
;
3427 if (strcmp (msec
->name
, look
) == 0)
3430 look
= debug_sections
[debug_info
].compressed_name
;
3431 if (look
!= NULL
&& strcmp (msec
->name
, look
) == 0)
3434 if (CONST_STRNEQ (msec
->name
, GNU_LINKONCE_INFO
))
3441 /* Transfer VMAs from object file to separate debug file. */
3444 set_debug_vma (bfd
*orig_bfd
, bfd
*debug_bfd
)
3448 for (s
= orig_bfd
->sections
, d
= debug_bfd
->sections
;
3449 s
!= NULL
&& d
!= NULL
;
3450 s
= s
->next
, d
= d
->next
)
3452 if ((d
->flags
& SEC_DEBUGGING
) != 0)
3454 /* ??? Assumes 1-1 correspondence between sections in the
3456 if (strcmp (s
->name
, d
->name
) == 0)
3458 d
->output_section
= s
->output_section
;
3459 d
->output_offset
= s
->output_offset
;
3465 /* Unset vmas for adjusted sections in STASH. */
3468 unset_sections (struct dwarf2_debug
*stash
)
3471 struct adjusted_section
*p
;
3473 i
= stash
->adjusted_section_count
;
3474 p
= stash
->adjusted_sections
;
3475 for (; i
> 0; i
--, p
++)
3476 p
->section
->vma
= 0;
3479 /* Set VMAs for allocated and .debug_info sections in ORIG_BFD, a
3480 relocatable object file. VMAs are normally all zero in relocatable
3481 object files, so if we want to distinguish locations in sections by
3482 address we need to set VMAs so the sections do not overlap. We
3483 also set VMA on .debug_info so that when we have multiple
3484 .debug_info sections (or the linkonce variant) they also do not
3485 overlap. The multiple .debug_info sections make up a single
3486 logical section. ??? We should probably do the same for other
3490 place_sections (bfd
*orig_bfd
, struct dwarf2_debug
*stash
)
3493 struct adjusted_section
*p
;
3495 const char *debug_info_name
;
3497 if (stash
->adjusted_section_count
!= 0)
3499 i
= stash
->adjusted_section_count
;
3500 p
= stash
->adjusted_sections
;
3501 for (; i
> 0; i
--, p
++)
3502 p
->section
->vma
= p
->adj_vma
;
3506 debug_info_name
= stash
->debug_sections
[debug_info
].uncompressed_name
;
3513 for (sect
= abfd
->sections
; sect
!= NULL
; sect
= sect
->next
)
3517 if ((sect
->output_section
!= NULL
3518 && sect
->output_section
!= sect
3519 && (sect
->flags
& SEC_DEBUGGING
) == 0)
3523 is_debug_info
= (strcmp (sect
->name
, debug_info_name
) == 0
3524 || CONST_STRNEQ (sect
->name
, GNU_LINKONCE_INFO
));
3526 if (!((sect
->flags
& SEC_ALLOC
) != 0 && abfd
== orig_bfd
)
3532 if (abfd
== stash
->bfd_ptr
)
3534 abfd
= stash
->bfd_ptr
;
3538 stash
->adjusted_section_count
= -1;
3541 bfd_vma last_vma
= 0, last_dwarf
= 0;
3542 bfd_size_type amt
= i
* sizeof (struct adjusted_section
);
3544 p
= (struct adjusted_section
*) bfd_malloc (amt
);
3548 stash
->adjusted_sections
= p
;
3549 stash
->adjusted_section_count
= i
;
3556 for (sect
= abfd
->sections
; sect
!= NULL
; sect
= sect
->next
)
3561 if ((sect
->output_section
!= NULL
3562 && sect
->output_section
!= sect
3563 && (sect
->flags
& SEC_DEBUGGING
) == 0)
3567 is_debug_info
= (strcmp (sect
->name
, debug_info_name
) == 0
3568 || CONST_STRNEQ (sect
->name
, GNU_LINKONCE_INFO
));
3570 if (!((sect
->flags
& SEC_ALLOC
) != 0 && abfd
== orig_bfd
)
3574 sz
= sect
->rawsize
? sect
->rawsize
: sect
->size
;
3578 BFD_ASSERT (sect
->alignment_power
== 0);
3579 sect
->vma
= last_dwarf
;
3584 /* Align the new address to the current section
3586 last_vma
= ((last_vma
3587 + ~(-((bfd_vma
) 1 << sect
->alignment_power
)))
3588 & (-((bfd_vma
) 1 << sect
->alignment_power
)));
3589 sect
->vma
= last_vma
;
3594 p
->adj_vma
= sect
->vma
;
3597 if (abfd
== stash
->bfd_ptr
)
3599 abfd
= stash
->bfd_ptr
;
3603 if (orig_bfd
!= stash
->bfd_ptr
)
3604 set_debug_vma (orig_bfd
, stash
->bfd_ptr
);
3609 /* Look up a funcinfo by name using the given info hash table. If found,
3610 also update the locations pointed to by filename_ptr and linenumber_ptr.
3612 This function returns TRUE if a funcinfo that matches the given symbol
3613 and address is found with any error; otherwise it returns FALSE. */
3616 info_hash_lookup_funcinfo (struct info_hash_table
*hash_table
,
3619 const char **filename_ptr
,
3620 unsigned int *linenumber_ptr
)
3622 struct funcinfo
* each_func
;
3623 struct funcinfo
* best_fit
= NULL
;
3624 bfd_vma best_fit_len
= 0;
3625 struct info_list_node
*node
;
3626 struct arange
*arange
;
3627 const char *name
= bfd_asymbol_name (sym
);
3628 asection
*sec
= bfd_get_section (sym
);
3630 for (node
= lookup_info_hash_table (hash_table
, name
);
3634 each_func
= (struct funcinfo
*) node
->info
;
3635 for (arange
= &each_func
->arange
;
3637 arange
= arange
->next
)
3639 if ((!each_func
->sec
|| each_func
->sec
== sec
)
3640 && addr
>= arange
->low
3641 && addr
< arange
->high
3643 || arange
->high
- arange
->low
< best_fit_len
))
3645 best_fit
= each_func
;
3646 best_fit_len
= arange
->high
- arange
->low
;
3653 best_fit
->sec
= sec
;
3654 *filename_ptr
= best_fit
->file
;
3655 *linenumber_ptr
= best_fit
->line
;
3662 /* Look up a varinfo by name using the given info hash table. If found,
3663 also update the locations pointed to by filename_ptr and linenumber_ptr.
3665 This function returns TRUE if a varinfo that matches the given symbol
3666 and address is found with any error; otherwise it returns FALSE. */
3669 info_hash_lookup_varinfo (struct info_hash_table
*hash_table
,
3672 const char **filename_ptr
,
3673 unsigned int *linenumber_ptr
)
3675 const char *name
= bfd_asymbol_name (sym
);
3676 asection
*sec
= bfd_get_section (sym
);
3677 struct varinfo
* each
;
3678 struct info_list_node
*node
;
3680 for (node
= lookup_info_hash_table (hash_table
, name
);
3684 each
= (struct varinfo
*) node
->info
;
3685 if (each
->addr
== addr
3686 && (!each
->sec
|| each
->sec
== sec
))
3689 *filename_ptr
= each
->file
;
3690 *linenumber_ptr
= each
->line
;
3698 /* Update the funcinfo and varinfo info hash tables if they are
3699 not up to date. Returns TRUE if there is no error; otherwise
3700 returns FALSE and disable the info hash tables. */
3703 stash_maybe_update_info_hash_tables (struct dwarf2_debug
*stash
)
3705 struct comp_unit
*each
;
3707 /* Exit if hash tables are up-to-date. */
3708 if (stash
->all_comp_units
== stash
->hash_units_head
)
3711 if (stash
->hash_units_head
)
3712 each
= stash
->hash_units_head
->prev_unit
;
3714 each
= stash
->last_comp_unit
;
3718 if (!comp_unit_hash_info (stash
, each
, stash
->funcinfo_hash_table
,
3719 stash
->varinfo_hash_table
))
3721 stash
->info_hash_status
= STASH_INFO_HASH_DISABLED
;
3724 each
= each
->prev_unit
;
3727 stash
->hash_units_head
= stash
->all_comp_units
;
3731 /* Check consistency of info hash tables. This is for debugging only. */
3733 static void ATTRIBUTE_UNUSED
3734 stash_verify_info_hash_table (struct dwarf2_debug
*stash
)
3736 struct comp_unit
*each_unit
;
3737 struct funcinfo
*each_func
;
3738 struct varinfo
*each_var
;
3739 struct info_list_node
*node
;
3742 for (each_unit
= stash
->all_comp_units
;
3744 each_unit
= each_unit
->next_unit
)
3746 for (each_func
= each_unit
->function_table
;
3748 each_func
= each_func
->prev_func
)
3750 if (!each_func
->name
)
3752 node
= lookup_info_hash_table (stash
->funcinfo_hash_table
,
3756 while (node
&& !found
)
3758 found
= node
->info
== each_func
;
3764 for (each_var
= each_unit
->variable_table
;
3766 each_var
= each_var
->prev_var
)
3768 if (!each_var
->name
|| !each_var
->file
|| each_var
->stack
)
3770 node
= lookup_info_hash_table (stash
->varinfo_hash_table
,
3774 while (node
&& !found
)
3776 found
= node
->info
== each_var
;
3784 /* Check to see if we want to enable the info hash tables, which consume
3785 quite a bit of memory. Currently we only check the number times
3786 bfd_dwarf2_find_line is called. In the future, we may also want to
3787 take the number of symbols into account. */
3790 stash_maybe_enable_info_hash_tables (bfd
*abfd
, struct dwarf2_debug
*stash
)
3792 BFD_ASSERT (stash
->info_hash_status
== STASH_INFO_HASH_OFF
);
3794 if (stash
->info_hash_count
++ < STASH_INFO_HASH_TRIGGER
)
3797 /* FIXME: Maybe we should check the reduce_memory_overheads
3798 and optimize fields in the bfd_link_info structure ? */
3800 /* Create hash tables. */
3801 stash
->funcinfo_hash_table
= create_info_hash_table (abfd
);
3802 stash
->varinfo_hash_table
= create_info_hash_table (abfd
);
3803 if (!stash
->funcinfo_hash_table
|| !stash
->varinfo_hash_table
)
3805 /* Turn off info hashes if any allocation above fails. */
3806 stash
->info_hash_status
= STASH_INFO_HASH_DISABLED
;
3809 /* We need a forced update so that the info hash tables will
3810 be created even though there is no compilation unit. That
3811 happens if STASH_INFO_HASH_TRIGGER is 0. */
3812 stash_maybe_update_info_hash_tables (stash
);
3813 stash
->info_hash_status
= STASH_INFO_HASH_ON
;
3816 /* Find the file and line associated with a symbol and address using the
3817 info hash tables of a stash. If there is a match, the function returns
3818 TRUE and update the locations pointed to by filename_ptr and linenumber_ptr;
3819 otherwise it returns FALSE. */
3822 stash_find_line_fast (struct dwarf2_debug
*stash
,
3825 const char **filename_ptr
,
3826 unsigned int *linenumber_ptr
)
3828 BFD_ASSERT (stash
->info_hash_status
== STASH_INFO_HASH_ON
);
3830 if (sym
->flags
& BSF_FUNCTION
)
3831 return info_hash_lookup_funcinfo (stash
->funcinfo_hash_table
, sym
, addr
,
3832 filename_ptr
, linenumber_ptr
);
3833 return info_hash_lookup_varinfo (stash
->varinfo_hash_table
, sym
, addr
,
3834 filename_ptr
, linenumber_ptr
);
3837 /* Save current section VMAs. */
3840 save_section_vma (const bfd
*abfd
, struct dwarf2_debug
*stash
)
3845 if (abfd
->section_count
== 0)
3847 stash
->sec_vma
= bfd_malloc (sizeof (*stash
->sec_vma
) * abfd
->section_count
);
3848 if (stash
->sec_vma
== NULL
)
3850 for (i
= 0, s
= abfd
->sections
; i
< abfd
->section_count
; i
++, s
= s
->next
)
3852 if (s
->output_section
!= NULL
)
3853 stash
->sec_vma
[i
] = s
->output_section
->vma
+ s
->output_offset
;
3855 stash
->sec_vma
[i
] = s
->vma
;
3860 /* Compare current section VMAs against those at the time the stash
3861 was created. If find_nearest_line is used in linker warnings or
3862 errors early in the link process, the debug info stash will be
3863 invalid for later calls. This is because we relocate debug info
3864 sections, so the stashed section contents depend on symbol values,
3865 which in turn depend on section VMAs. */
3868 section_vma_same (const bfd
*abfd
, const struct dwarf2_debug
*stash
)
3873 for (i
= 0, s
= abfd
->sections
; i
< abfd
->section_count
; i
++, s
= s
->next
)
3877 if (s
->output_section
!= NULL
)
3878 vma
= s
->output_section
->vma
+ s
->output_offset
;
3881 if (vma
!= stash
->sec_vma
[i
])
3887 /* Read debug information from DEBUG_BFD when DEBUG_BFD is specified.
3888 If DEBUG_BFD is not specified, we read debug information from ABFD
3889 or its gnu_debuglink. The results will be stored in PINFO.
3890 The function returns TRUE iff debug information is ready. */
3893 _bfd_dwarf2_slurp_debug_info (bfd
*abfd
, bfd
*debug_bfd
,
3894 const struct dwarf_debug_section
*debug_sections
,
3897 bfd_boolean do_place
)
3899 bfd_size_type amt
= sizeof (struct dwarf2_debug
);
3900 bfd_size_type total_size
;
3902 struct dwarf2_debug
*stash
= (struct dwarf2_debug
*) *pinfo
;
3906 if (stash
->orig_bfd
== abfd
3907 && section_vma_same (abfd
, stash
))
3909 /* Check that we did previously find some debug information
3910 before attempting to make use of it. */
3911 if (stash
->bfd_ptr
!= NULL
)
3913 if (do_place
&& !place_sections (abfd
, stash
))
3920 _bfd_dwarf2_cleanup_debug_info (abfd
, pinfo
);
3921 memset (stash
, 0, amt
);
3925 stash
= (struct dwarf2_debug
*) bfd_zalloc (abfd
, amt
);
3929 stash
->orig_bfd
= abfd
;
3930 stash
->debug_sections
= debug_sections
;
3931 stash
->syms
= symbols
;
3932 if (!save_section_vma (abfd
, stash
))
3937 if (debug_bfd
== NULL
)
3940 msec
= find_debug_info (debug_bfd
, debug_sections
, NULL
);
3941 if (msec
== NULL
&& abfd
== debug_bfd
)
3943 char * debug_filename
;
3945 debug_filename
= bfd_follow_build_id_debuglink (abfd
, DEBUGDIR
);
3946 if (debug_filename
== NULL
)
3947 debug_filename
= bfd_follow_gnu_debuglink (abfd
, DEBUGDIR
);
3949 if (debug_filename
== NULL
)
3950 /* No dwarf2 info, and no gnu_debuglink to follow.
3951 Note that at this point the stash has been allocated, but
3952 contains zeros. This lets future calls to this function
3953 fail more quickly. */
3956 /* Set BFD_DECOMPRESS to decompress debug sections. */
3957 if ((debug_bfd
= bfd_openr (debug_filename
, NULL
)) == NULL
3958 || !(debug_bfd
->flags
|= BFD_DECOMPRESS
,
3959 bfd_check_format (debug_bfd
, bfd_object
))
3960 || (msec
= find_debug_info (debug_bfd
,
3961 debug_sections
, NULL
)) == NULL
3962 || !bfd_generic_link_read_symbols (debug_bfd
))
3965 bfd_close (debug_bfd
);
3966 /* FIXME: Should we report our failure to follow the debuglink ? */
3967 free (debug_filename
);
3971 symbols
= bfd_get_outsymbols (debug_bfd
);
3972 stash
->syms
= symbols
;
3973 stash
->close_on_cleanup
= TRUE
;
3975 stash
->bfd_ptr
= debug_bfd
;
3978 && !place_sections (abfd
, stash
))
3981 /* There can be more than one DWARF2 info section in a BFD these
3982 days. First handle the easy case when there's only one. If
3983 there's more than one, try case two: none of the sections is
3984 compressed. In that case, read them all in and produce one
3985 large stash. We do this in two passes - in the first pass we
3986 just accumulate the section sizes, and in the second pass we
3987 read in the section's contents. (The allows us to avoid
3988 reallocing the data as we add sections to the stash.) If
3989 some or all sections are compressed, then do things the slow
3990 way, with a bunch of reallocs. */
3992 if (! find_debug_info (debug_bfd
, debug_sections
, msec
))
3994 /* Case 1: only one info section. */
3995 total_size
= msec
->size
;
3996 if (! read_section (debug_bfd
, &stash
->debug_sections
[debug_info
],
3998 &stash
->info_ptr_memory
, &total_size
))
4003 /* Case 2: multiple sections. */
4004 for (total_size
= 0;
4006 msec
= find_debug_info (debug_bfd
, debug_sections
, msec
))
4007 total_size
+= msec
->size
;
4009 stash
->info_ptr_memory
= (bfd_byte
*) bfd_malloc (total_size
);
4010 if (stash
->info_ptr_memory
== NULL
)
4014 for (msec
= find_debug_info (debug_bfd
, debug_sections
, NULL
);
4016 msec
= find_debug_info (debug_bfd
, debug_sections
, msec
))
4024 if (!(bfd_simple_get_relocated_section_contents
4025 (debug_bfd
, msec
, stash
->info_ptr_memory
+ total_size
,
4033 stash
->info_ptr
= stash
->info_ptr_memory
;
4034 stash
->info_ptr_end
= stash
->info_ptr
+ total_size
;
4035 stash
->sec
= find_debug_info (debug_bfd
, debug_sections
, NULL
);
4036 stash
->sec_info_ptr
= stash
->info_ptr
;
4040 /* Scan the debug information in PINFO looking for a DW_TAG_subprogram
4041 abbrev with a DW_AT_low_pc attached to it. Then lookup that same
4042 symbol in SYMBOLS and return the difference between the low_pc and
4043 the symbol's address. Returns 0 if no suitable symbol could be found. */
4046 _bfd_dwarf2_find_symbol_bias (asymbol
** symbols
, void ** pinfo
)
4048 struct dwarf2_debug
*stash
;
4049 struct comp_unit
* unit
;
4051 stash
= (struct dwarf2_debug
*) *pinfo
;
4056 for (unit
= stash
->all_comp_units
; unit
; unit
= unit
->next_unit
)
4058 struct funcinfo
* func
;
4060 if (unit
->function_table
== NULL
)
4062 if (unit
->line_table
== NULL
)
4063 unit
->line_table
= decode_line_info (unit
, stash
);
4064 if (unit
->line_table
!= NULL
)
4065 scan_unit_for_symbols (unit
);
4068 for (func
= unit
->function_table
; func
!= NULL
; func
= func
->prev_func
)
4069 if (func
->name
&& func
->arange
.low
)
4073 /* FIXME: Do we need to scan the aranges looking for the lowest pc value ? */
4075 for (psym
= symbols
; * psym
!= NULL
; psym
++)
4077 asymbol
* sym
= * psym
;
4079 if (sym
->flags
& BSF_FUNCTION
4080 && sym
->section
!= NULL
4081 && strcmp (sym
->name
, func
->name
) == 0)
4082 return ((bfd_signed_vma
) func
->arange
.low
) -
4083 ((bfd_signed_vma
) (sym
->value
+ sym
->section
->vma
));
4091 /* Find the source code location of SYMBOL. If SYMBOL is NULL
4092 then find the nearest source code location corresponding to
4093 the address SECTION + OFFSET.
4094 Returns TRUE if the line is found without error and fills in
4095 FILENAME_PTR and LINENUMBER_PTR. In the case where SYMBOL was
4096 NULL the FUNCTIONNAME_PTR is also filled in.
4097 SYMBOLS contains the symbol table for ABFD.
4098 DEBUG_SECTIONS contains the name of the dwarf debug sections.
4099 ADDR_SIZE is the number of bytes in the initial .debug_info length
4100 field and in the abbreviation offset, or zero to indicate that the
4101 default value should be used. */
4104 _bfd_dwarf2_find_nearest_line (bfd
*abfd
,
4109 const char **filename_ptr
,
4110 const char **functionname_ptr
,
4111 unsigned int *linenumber_ptr
,
4112 unsigned int *discriminator_ptr
,
4113 const struct dwarf_debug_section
*debug_sections
,
4114 unsigned int addr_size
,
4117 /* Read each compilation unit from the section .debug_info, and check
4118 to see if it contains the address we are searching for. If yes,
4119 lookup the address, and return the line number info. If no, go
4120 on to the next compilation unit.
4122 We keep a list of all the previously read compilation units, and
4123 a pointer to the next un-read compilation unit. Check the
4124 previously read units before reading more. */
4125 struct dwarf2_debug
*stash
;
4126 /* What address are we looking for? */
4128 struct comp_unit
* each
;
4129 struct funcinfo
*function
= NULL
;
4130 bfd_boolean found
= FALSE
;
4131 bfd_boolean do_line
;
4133 *filename_ptr
= NULL
;
4134 if (functionname_ptr
!= NULL
)
4135 *functionname_ptr
= NULL
;
4136 *linenumber_ptr
= 0;
4137 if (discriminator_ptr
)
4138 *discriminator_ptr
= 0;
4140 if (! _bfd_dwarf2_slurp_debug_info (abfd
, NULL
, debug_sections
,
4142 (abfd
->flags
& (EXEC_P
| DYNAMIC
)) == 0))
4145 stash
= (struct dwarf2_debug
*) *pinfo
;
4147 do_line
= symbol
!= NULL
;
4150 BFD_ASSERT (section
== NULL
&& offset
== 0 && functionname_ptr
== NULL
);
4151 section
= bfd_get_section (symbol
);
4152 addr
= symbol
->value
;
4156 BFD_ASSERT (section
!= NULL
&& functionname_ptr
!= NULL
);
4160 if (section
->output_section
)
4161 addr
+= section
->output_section
->vma
+ section
->output_offset
;
4163 addr
+= section
->vma
;
4165 /* A null info_ptr indicates that there is no dwarf2 info
4166 (or that an error occured while setting up the stash). */
4167 if (! stash
->info_ptr
)
4170 stash
->inliner_chain
= NULL
;
4172 /* Check the previously read comp. units first. */
4175 /* The info hash tables use quite a bit of memory. We may not want to
4176 always use them. We use some heuristics to decide if and when to
4178 if (stash
->info_hash_status
== STASH_INFO_HASH_OFF
)
4179 stash_maybe_enable_info_hash_tables (abfd
, stash
);
4181 /* Keep info hash table up to date if they are available. Note that we
4182 may disable the hash tables if there is any error duing update. */
4183 if (stash
->info_hash_status
== STASH_INFO_HASH_ON
)
4184 stash_maybe_update_info_hash_tables (stash
);
4186 if (stash
->info_hash_status
== STASH_INFO_HASH_ON
)
4188 found
= stash_find_line_fast (stash
, symbol
, addr
, filename_ptr
,
4195 /* Check the previously read comp. units first. */
4196 for (each
= stash
->all_comp_units
; each
; each
= each
->next_unit
)
4197 if ((symbol
->flags
& BSF_FUNCTION
) == 0
4198 || each
->arange
.high
== 0
4199 || comp_unit_contains_address (each
, addr
))
4201 found
= comp_unit_find_line (each
, symbol
, addr
, filename_ptr
,
4202 linenumber_ptr
, stash
);
4210 bfd_vma min_range
= (bfd_vma
) -1;
4211 const char * local_filename
= NULL
;
4212 struct funcinfo
*local_function
= NULL
;
4213 unsigned int local_linenumber
= 0;
4214 unsigned int local_discriminator
= 0;
4216 for (each
= stash
->all_comp_units
; each
; each
= each
->next_unit
)
4218 bfd_vma range
= (bfd_vma
) -1;
4220 found
= ((each
->arange
.high
== 0
4221 || comp_unit_contains_address (each
, addr
))
4222 && (range
= comp_unit_find_nearest_line (each
, addr
,
4226 & local_discriminator
,
4230 /* PRs 15935 15994: Bogus debug information may have provided us
4231 with an erroneous match. We attempt to counter this by
4232 selecting the match that has the smallest address range
4233 associated with it. (We are assuming that corrupt debug info
4234 will tend to result in extra large address ranges rather than
4235 extra small ranges).
4237 This does mean that we scan through all of the CUs associated
4238 with the bfd each time this function is called. But this does
4239 have the benefit of producing consistent results every time the
4240 function is called. */
4241 if (range
<= min_range
)
4243 if (filename_ptr
&& local_filename
)
4244 * filename_ptr
= local_filename
;
4246 function
= local_function
;
4247 if (discriminator_ptr
&& local_discriminator
)
4248 * discriminator_ptr
= local_discriminator
;
4249 if (local_linenumber
)
4250 * linenumber_ptr
= local_linenumber
;
4256 if (* linenumber_ptr
)
4263 /* The DWARF2 spec says that the initial length field, and the
4264 offset of the abbreviation table, should both be 4-byte values.
4265 However, some compilers do things differently. */
4268 BFD_ASSERT (addr_size
== 4 || addr_size
== 8);
4270 /* Read each remaining comp. units checking each as they are read. */
4271 while (stash
->info_ptr
< stash
->info_ptr_end
)
4274 unsigned int offset_size
= addr_size
;
4275 bfd_byte
*info_ptr_unit
= stash
->info_ptr
;
4277 length
= read_4_bytes (stash
->bfd_ptr
, stash
->info_ptr
, stash
->info_ptr_end
);
4278 /* A 0xffffff length is the DWARF3 way of indicating
4279 we use 64-bit offsets, instead of 32-bit offsets. */
4280 if (length
== 0xffffffff)
4283 length
= read_8_bytes (stash
->bfd_ptr
, stash
->info_ptr
+ 4, stash
->info_ptr_end
);
4284 stash
->info_ptr
+= 12;
4286 /* A zero length is the IRIX way of indicating 64-bit offsets,
4287 mostly because the 64-bit length will generally fit in 32
4288 bits, and the endianness helps. */
4289 else if (length
== 0)
4292 length
= read_4_bytes (stash
->bfd_ptr
, stash
->info_ptr
+ 4, stash
->info_ptr_end
);
4293 stash
->info_ptr
+= 8;
4295 /* In the absence of the hints above, we assume 32-bit DWARF2
4296 offsets even for targets with 64-bit addresses, because:
4297 a) most of the time these targets will not have generated
4298 more than 2Gb of debug info and so will not need 64-bit
4301 b) if they do use 64-bit offsets but they are not using
4302 the size hints that are tested for above then they are
4303 not conforming to the DWARF3 standard anyway. */
4304 else if (addr_size
== 8)
4307 stash
->info_ptr
+= 4;
4310 stash
->info_ptr
+= 4;
4317 if (stash
->info_ptr
+ length
> stash
->info_ptr_end
)
4320 each
= parse_comp_unit (stash
, length
, info_ptr_unit
,
4323 /* The dwarf information is damaged, don't trust it any
4327 new_ptr
= stash
->info_ptr
+ length
;
4328 /* PR 17512: file: 1500698c. */
4329 if (new_ptr
< stash
->info_ptr
)
4331 /* A corrupt length value - do not trust the info any more. */
4336 stash
->info_ptr
= new_ptr
;
4338 if (stash
->all_comp_units
)
4339 stash
->all_comp_units
->prev_unit
= each
;
4341 stash
->last_comp_unit
= each
;
4343 each
->next_unit
= stash
->all_comp_units
;
4344 stash
->all_comp_units
= each
;
4346 /* DW_AT_low_pc and DW_AT_high_pc are optional for
4347 compilation units. If we don't have them (i.e.,
4348 unit->high == 0), we need to consult the line info table
4349 to see if a compilation unit contains the given
4352 found
= (((symbol
->flags
& BSF_FUNCTION
) == 0
4353 || each
->arange
.high
== 0
4354 || comp_unit_contains_address (each
, addr
))
4355 && comp_unit_find_line (each
, symbol
, addr
,
4360 found
= ((each
->arange
.high
== 0
4361 || comp_unit_contains_address (each
, addr
))
4362 && comp_unit_find_nearest_line (each
, addr
,
4369 if ((bfd_vma
) (stash
->info_ptr
- stash
->sec_info_ptr
)
4370 == stash
->sec
->size
)
4372 stash
->sec
= find_debug_info (stash
->bfd_ptr
, debug_sections
,
4374 stash
->sec_info_ptr
= stash
->info_ptr
;
4385 if (!function
->is_linkage
)
4390 fun
= _bfd_elf_find_function (abfd
, symbols
, section
, offset
,
4391 *filename_ptr
? NULL
: filename_ptr
,
4393 sec_vma
= section
->vma
;
4394 if (section
->output_section
!= NULL
)
4395 sec_vma
= section
->output_section
->vma
+ section
->output_offset
;
4397 && fun
->value
+ sec_vma
== function
->arange
.low
)
4398 function
->name
= *functionname_ptr
;
4399 /* Even if we didn't find a linkage name, say that we have
4400 to stop a repeated search of symbols. */
4401 function
->is_linkage
= TRUE
;
4403 *functionname_ptr
= function
->name
;
4405 if ((abfd
->flags
& (EXEC_P
| DYNAMIC
)) == 0)
4406 unset_sections (stash
);
4412 _bfd_dwarf2_find_inliner_info (bfd
*abfd ATTRIBUTE_UNUSED
,
4413 const char **filename_ptr
,
4414 const char **functionname_ptr
,
4415 unsigned int *linenumber_ptr
,
4418 struct dwarf2_debug
*stash
;
4420 stash
= (struct dwarf2_debug
*) *pinfo
;
4423 struct funcinfo
*func
= stash
->inliner_chain
;
4425 if (func
&& func
->caller_func
)
4427 *filename_ptr
= func
->caller_file
;
4428 *functionname_ptr
= func
->caller_func
->name
;
4429 *linenumber_ptr
= func
->caller_line
;
4430 stash
->inliner_chain
= func
->caller_func
;
4439 _bfd_dwarf2_cleanup_debug_info (bfd
*abfd
, void **pinfo
)
4441 struct dwarf2_debug
*stash
= (struct dwarf2_debug
*) *pinfo
;
4442 struct comp_unit
*each
;
4444 if (abfd
== NULL
|| stash
== NULL
)
4447 for (each
= stash
->all_comp_units
; each
; each
= each
->next_unit
)
4449 struct abbrev_info
**abbrevs
= each
->abbrevs
;
4450 struct funcinfo
*function_table
= each
->function_table
;
4451 struct varinfo
*variable_table
= each
->variable_table
;
4454 for (i
= 0; i
< ABBREV_HASH_SIZE
; i
++)
4456 struct abbrev_info
*abbrev
= abbrevs
[i
];
4460 free (abbrev
->attrs
);
4461 abbrev
= abbrev
->next
;
4465 if (each
->line_table
)
4467 free (each
->line_table
->dirs
);
4468 free (each
->line_table
->files
);
4471 while (function_table
)
4473 if (function_table
->file
)
4475 free (function_table
->file
);
4476 function_table
->file
= NULL
;
4479 if (function_table
->caller_file
)
4481 free (function_table
->caller_file
);
4482 function_table
->caller_file
= NULL
;
4484 function_table
= function_table
->prev_func
;
4487 if (each
->lookup_funcinfo_table
)
4489 free (each
->lookup_funcinfo_table
);
4490 each
->lookup_funcinfo_table
= NULL
;
4493 while (variable_table
)
4495 if (variable_table
->file
)
4497 free (variable_table
->file
);
4498 variable_table
->file
= NULL
;
4501 variable_table
= variable_table
->prev_var
;
4505 if (stash
->dwarf_abbrev_buffer
)
4506 free (stash
->dwarf_abbrev_buffer
);
4507 if (stash
->dwarf_line_buffer
)
4508 free (stash
->dwarf_line_buffer
);
4509 if (stash
->dwarf_str_buffer
)
4510 free (stash
->dwarf_str_buffer
);
4511 if (stash
->dwarf_ranges_buffer
)
4512 free (stash
->dwarf_ranges_buffer
);
4513 if (stash
->info_ptr_memory
)
4514 free (stash
->info_ptr_memory
);
4515 if (stash
->close_on_cleanup
)
4516 bfd_close (stash
->bfd_ptr
);
4517 if (stash
->alt_dwarf_str_buffer
)
4518 free (stash
->alt_dwarf_str_buffer
);
4519 if (stash
->alt_dwarf_info_buffer
)
4520 free (stash
->alt_dwarf_info_buffer
);
4522 free (stash
->sec_vma
);
4523 if (stash
->adjusted_sections
)
4524 free (stash
->adjusted_sections
);
4525 if (stash
->alt_bfd_ptr
)
4526 bfd_close (stash
->alt_bfd_ptr
);
4529 /* Find the function to a particular section and offset,
4530 for error reporting. */
4533 _bfd_elf_find_function (bfd
*abfd
,
4537 const char **filename_ptr
,
4538 const char **functionname_ptr
)
4540 struct elf_find_function_cache
4542 asection
*last_section
;
4544 const char *filename
;
4545 bfd_size_type func_size
;
4548 if (symbols
== NULL
)
4551 if (bfd_get_flavour (abfd
) != bfd_target_elf_flavour
)
4554 cache
= elf_tdata (abfd
)->elf_find_function_cache
;
4557 cache
= bfd_zalloc (abfd
, sizeof (*cache
));
4558 elf_tdata (abfd
)->elf_find_function_cache
= cache
;
4562 if (cache
->last_section
!= section
4563 || cache
->func
== NULL
4564 || offset
< cache
->func
->value
4565 || offset
>= cache
->func
->value
+ cache
->func_size
)
4570 /* ??? Given multiple file symbols, it is impossible to reliably
4571 choose the right file name for global symbols. File symbols are
4572 local symbols, and thus all file symbols must sort before any
4573 global symbols. The ELF spec may be interpreted to say that a
4574 file symbol must sort before other local symbols, but currently
4575 ld -r doesn't do this. So, for ld -r output, it is possible to
4576 make a better choice of file name for local symbols by ignoring
4577 file symbols appearing after a given local symbol. */
4578 enum { nothing_seen
, symbol_seen
, file_after_symbol_seen
} state
;
4579 const struct elf_backend_data
*bed
= get_elf_backend_data (abfd
);
4583 state
= nothing_seen
;
4584 cache
->filename
= NULL
;
4586 cache
->func_size
= 0;
4587 cache
->last_section
= section
;
4589 for (p
= symbols
; *p
!= NULL
; p
++)
4595 if ((sym
->flags
& BSF_FILE
) != 0)
4598 if (state
== symbol_seen
)
4599 state
= file_after_symbol_seen
;
4603 size
= bed
->maybe_function_sym (sym
, section
, &code_off
);
4605 && code_off
<= offset
4606 && (code_off
> low_func
4607 || (code_off
== low_func
4608 && size
> cache
->func_size
)))
4611 cache
->func_size
= size
;
4612 cache
->filename
= NULL
;
4613 low_func
= code_off
;
4615 && ((sym
->flags
& BSF_LOCAL
) != 0
4616 || state
!= file_after_symbol_seen
))
4617 cache
->filename
= bfd_asymbol_name (file
);
4619 if (state
== nothing_seen
)
4620 state
= symbol_seen
;
4624 if (cache
->func
== NULL
)
4628 *filename_ptr
= cache
->filename
;
4629 if (functionname_ptr
)
4630 *functionname_ptr
= bfd_asymbol_name (cache
->func
);