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_line_str section loaded into memory. */
154 bfd_byte
*dwarf_line_str_buffer
;
156 /* Length of the loaded .debug_line_str section. */
157 bfd_size_type dwarf_line_str_size
;
159 /* Pointer to the .debug_ranges section loaded into memory. */
160 bfd_byte
*dwarf_ranges_buffer
;
162 /* Length of the loaded .debug_ranges section. */
163 bfd_size_type dwarf_ranges_size
;
165 /* If the most recent call to bfd_find_nearest_line was given an
166 address in an inlined function, preserve a pointer into the
167 calling chain for subsequent calls to bfd_find_inliner_info to
169 struct funcinfo
*inliner_chain
;
171 /* Section VMAs at the time the stash was built. */
174 /* Number of sections whose VMA we must adjust. */
175 int adjusted_section_count
;
177 /* Array of sections with adjusted VMA. */
178 struct adjusted_section
*adjusted_sections
;
180 /* Number of times find_line is called. This is used in
181 the heuristic for enabling the info hash tables. */
184 #define STASH_INFO_HASH_TRIGGER 100
186 /* Hash table mapping symbol names to function infos. */
187 struct info_hash_table
*funcinfo_hash_table
;
189 /* Hash table mapping symbol names to variable infos. */
190 struct info_hash_table
*varinfo_hash_table
;
192 /* Head of comp_unit list in the last hash table update. */
193 struct comp_unit
*hash_units_head
;
195 /* Status of info hash. */
196 int info_hash_status
;
197 #define STASH_INFO_HASH_OFF 0
198 #define STASH_INFO_HASH_ON 1
199 #define STASH_INFO_HASH_DISABLED 2
201 /* True if we opened bfd_ptr. */
202 bfd_boolean close_on_cleanup
;
212 /* A minimal decoding of DWARF2 compilation units. We only decode
213 what's needed to get to the line number information. */
217 /* Chain the previously read compilation units. */
218 struct comp_unit
*next_unit
;
220 /* Likewise, chain the compilation unit read after this one.
221 The comp units are stored in reversed reading order. */
222 struct comp_unit
*prev_unit
;
224 /* Keep the bfd convenient (for memory allocation). */
227 /* The lowest and highest addresses contained in this compilation
228 unit as specified in the compilation unit header. */
229 struct arange arange
;
231 /* The DW_AT_name attribute (for error messages). */
234 /* The abbrev hash table. */
235 struct abbrev_info
**abbrevs
;
237 /* DW_AT_language. */
240 /* Note that an error was found by comp_unit_find_nearest_line. */
243 /* The DW_AT_comp_dir attribute. */
246 /* TRUE if there is a line number table associated with this comp. unit. */
249 /* Pointer to the current comp_unit so that we can find a given entry
251 bfd_byte
*info_ptr_unit
;
253 /* Pointer to the start of the debug section, for DW_FORM_ref_addr. */
254 bfd_byte
*sec_info_ptr
;
256 /* The offset into .debug_line of the line number table. */
257 unsigned long line_offset
;
259 /* Pointer to the first child die for the comp unit. */
260 bfd_byte
*first_child_die_ptr
;
262 /* The end of the comp unit. */
265 /* The decoded line number, NULL if not yet decoded. */
266 struct line_info_table
*line_table
;
268 /* A list of the functions found in this comp. unit. */
269 struct funcinfo
*function_table
;
271 /* A table of function information references searchable by address. */
272 struct lookup_funcinfo
*lookup_funcinfo_table
;
274 /* Number of functions in the function_table and sorted_function_table. */
275 bfd_size_type number_of_functions
;
277 /* A list of the variables found in this comp. unit. */
278 struct varinfo
*variable_table
;
280 /* Pointer to dwarf2_debug structure. */
281 struct dwarf2_debug
*stash
;
283 /* DWARF format version for this unit - from unit header. */
286 /* Address size for this unit - from unit header. */
287 unsigned char addr_size
;
289 /* Offset size for this unit - from unit header. */
290 unsigned char offset_size
;
292 /* Base address for this unit - from DW_AT_low_pc attribute of
293 DW_TAG_compile_unit DIE */
294 bfd_vma base_address
;
296 /* TRUE if symbols are cached in hash table for faster lookup by name. */
300 /* This data structure holds the information of an abbrev. */
303 unsigned int number
; /* Number identifying abbrev. */
304 enum dwarf_tag tag
; /* DWARF tag. */
305 int has_children
; /* Boolean. */
306 unsigned int num_attrs
; /* Number of attributes. */
307 struct attr_abbrev
*attrs
; /* An array of attribute descriptions. */
308 struct abbrev_info
*next
; /* Next in chain. */
313 enum dwarf_attribute name
;
314 enum dwarf_form form
;
315 bfd_vma implicit_const
;
318 /* Map of uncompressed DWARF debug section name to compressed one. It
319 is terminated by NULL uncompressed_name. */
321 const struct dwarf_debug_section dwarf_debug_sections
[] =
323 { ".debug_abbrev", ".zdebug_abbrev" },
324 { ".debug_aranges", ".zdebug_aranges" },
325 { ".debug_frame", ".zdebug_frame" },
326 { ".debug_info", ".zdebug_info" },
327 { ".debug_info", ".zdebug_info" },
328 { ".debug_line", ".zdebug_line" },
329 { ".debug_loc", ".zdebug_loc" },
330 { ".debug_macinfo", ".zdebug_macinfo" },
331 { ".debug_macro", ".zdebug_macro" },
332 { ".debug_pubnames", ".zdebug_pubnames" },
333 { ".debug_pubtypes", ".zdebug_pubtypes" },
334 { ".debug_ranges", ".zdebug_ranges" },
335 { ".debug_static_func", ".zdebug_static_func" },
336 { ".debug_static_vars", ".zdebug_static_vars" },
337 { ".debug_str", ".zdebug_str", },
338 { ".debug_str", ".zdebug_str", },
339 { ".debug_line_str", ".zdebug_line_str", },
340 { ".debug_types", ".zdebug_types" },
341 /* GNU DWARF 1 extensions */
342 { ".debug_sfnames", ".zdebug_sfnames" },
343 { ".debug_srcinfo", ".zebug_srcinfo" },
344 /* SGI/MIPS DWARF 2 extensions */
345 { ".debug_funcnames", ".zdebug_funcnames" },
346 { ".debug_typenames", ".zdebug_typenames" },
347 { ".debug_varnames", ".zdebug_varnames" },
348 { ".debug_weaknames", ".zdebug_weaknames" },
352 /* NB/ Numbers in this enum must match up with indicies
353 into the dwarf_debug_sections[] array above. */
354 enum dwarf_debug_section_enum
383 /* A static assertion. */
384 extern int dwarf_debug_section_assert
[ARRAY_SIZE (dwarf_debug_sections
)
385 == debug_max
+ 1 ? 1 : -1];
387 #ifndef ABBREV_HASH_SIZE
388 #define ABBREV_HASH_SIZE 121
390 #ifndef ATTR_ALLOC_CHUNK
391 #define ATTR_ALLOC_CHUNK 4
394 /* Variable and function hash tables. This is used to speed up look-up
395 in lookup_symbol_in_var_table() and lookup_symbol_in_function_table().
396 In order to share code between variable and function infos, we use
397 a list of untyped pointer for all variable/function info associated with
398 a symbol. We waste a bit of memory for list with one node but that
399 simplifies the code. */
401 struct info_list_node
403 struct info_list_node
*next
;
407 /* Info hash entry. */
408 struct info_hash_entry
410 struct bfd_hash_entry root
;
411 struct info_list_node
*head
;
414 struct info_hash_table
416 struct bfd_hash_table base
;
419 /* Function to create a new entry in info hash table. */
421 static struct bfd_hash_entry
*
422 info_hash_table_newfunc (struct bfd_hash_entry
*entry
,
423 struct bfd_hash_table
*table
,
426 struct info_hash_entry
*ret
= (struct info_hash_entry
*) entry
;
428 /* Allocate the structure if it has not already been allocated by a
432 ret
= (struct info_hash_entry
*) bfd_hash_allocate (table
,
438 /* Call the allocation method of the base class. */
439 ret
= ((struct info_hash_entry
*)
440 bfd_hash_newfunc ((struct bfd_hash_entry
*) ret
, table
, string
));
442 /* Initialize the local fields here. */
446 return (struct bfd_hash_entry
*) ret
;
449 /* Function to create a new info hash table. It returns a pointer to the
450 newly created table or NULL if there is any error. We need abfd
451 solely for memory allocation. */
453 static struct info_hash_table
*
454 create_info_hash_table (bfd
*abfd
)
456 struct info_hash_table
*hash_table
;
458 hash_table
= ((struct info_hash_table
*)
459 bfd_alloc (abfd
, sizeof (struct info_hash_table
)));
463 if (!bfd_hash_table_init (&hash_table
->base
, info_hash_table_newfunc
,
464 sizeof (struct info_hash_entry
)))
466 bfd_release (abfd
, hash_table
);
473 /* Insert an info entry into an info hash table. We do not check of
474 duplicate entries. Also, the caller need to guarantee that the
475 right type of info in inserted as info is passed as a void* pointer.
476 This function returns true if there is no error. */
479 insert_info_hash_table (struct info_hash_table
*hash_table
,
484 struct info_hash_entry
*entry
;
485 struct info_list_node
*node
;
487 entry
= (struct info_hash_entry
*) bfd_hash_lookup (&hash_table
->base
,
492 node
= (struct info_list_node
*) bfd_hash_allocate (&hash_table
->base
,
498 node
->next
= entry
->head
;
504 /* Look up an info entry list from an info hash table. Return NULL
507 static struct info_list_node
*
508 lookup_info_hash_table (struct info_hash_table
*hash_table
, const char *key
)
510 struct info_hash_entry
*entry
;
512 entry
= (struct info_hash_entry
*) bfd_hash_lookup (&hash_table
->base
, key
,
514 return entry
? entry
->head
: NULL
;
517 /* Read a section into its appropriate place in the dwarf2_debug
518 struct (indicated by SECTION_BUFFER and SECTION_SIZE). If SYMS is
519 not NULL, use bfd_simple_get_relocated_section_contents to read the
520 section contents, otherwise use bfd_get_section_contents. Fail if
521 the located section does not contain at least OFFSET bytes. */
524 read_section (bfd
* abfd
,
525 const struct dwarf_debug_section
*sec
,
528 bfd_byte
** section_buffer
,
529 bfd_size_type
* section_size
)
532 const char *section_name
= sec
->uncompressed_name
;
534 /* The section may have already been read. */
535 if (*section_buffer
== NULL
)
537 msec
= bfd_get_section_by_name (abfd
, section_name
);
540 section_name
= sec
->compressed_name
;
541 if (section_name
!= NULL
)
542 msec
= bfd_get_section_by_name (abfd
, section_name
);
546 _bfd_error_handler (_("Dwarf Error: Can't find %s section."),
547 sec
->uncompressed_name
);
548 bfd_set_error (bfd_error_bad_value
);
552 *section_size
= msec
->rawsize
? msec
->rawsize
: msec
->size
;
556 = bfd_simple_get_relocated_section_contents (abfd
, msec
, NULL
, syms
);
557 if (! *section_buffer
)
562 *section_buffer
= (bfd_byte
*) bfd_malloc (*section_size
);
563 if (! *section_buffer
)
565 if (! bfd_get_section_contents (abfd
, msec
, *section_buffer
,
570 /* Paranoia - if we are reading in a string section, make sure that it
571 is NUL terminated. This is to prevent string functions from running
572 off the end of the buffer. Note - knowing the size of the buffer is
573 not enough as some functions, eg strchr, do not have a range limited
576 FIXME: We ought to use a flag in the dwarf_debug_sections[] table to
577 determine the nature of a debug section, rather than checking the
578 section name as we do here. */
579 if (*section_size
> 0
580 && (*section_buffer
)[*section_size
- 1] != 0
581 && (strstr (section_name
, "_str") || strstr (section_name
, "names")))
583 bfd_byte
* new_buffer
= malloc (*section_size
+ 1);
585 _bfd_error_handler (_("warning: dwarf string section '%s' is not NUL terminated"),
587 memcpy (new_buffer
, *section_buffer
, *section_size
);
588 new_buffer
[*section_size
] = 0;
589 free (*section_buffer
);
590 *section_buffer
= new_buffer
;
594 /* It is possible to get a bad value for the offset into the section
595 that the client wants. Validate it here to avoid trouble later. */
596 if (offset
!= 0 && offset
>= *section_size
)
598 /* xgettext: c-format */
599 _bfd_error_handler (_("Dwarf Error: Offset (%llu)"
600 " greater than or equal to %s size (%Lu)."),
601 (long long) offset
, section_name
, *section_size
);
602 bfd_set_error (bfd_error_bad_value
);
609 /* Read dwarf information from a buffer. */
612 read_1_byte (bfd
*abfd ATTRIBUTE_UNUSED
, bfd_byte
*buf
, bfd_byte
*end
)
616 return bfd_get_8 (abfd
, buf
);
620 read_1_signed_byte (bfd
*abfd ATTRIBUTE_UNUSED
, bfd_byte
*buf
, bfd_byte
*end
)
624 return bfd_get_signed_8 (abfd
, buf
);
628 read_2_bytes (bfd
*abfd
, bfd_byte
*buf
, bfd_byte
*end
)
632 return bfd_get_16 (abfd
, buf
);
636 read_4_bytes (bfd
*abfd
, bfd_byte
*buf
, bfd_byte
*end
)
640 return bfd_get_32 (abfd
, buf
);
644 read_8_bytes (bfd
*abfd
, bfd_byte
*buf
, bfd_byte
*end
)
648 return bfd_get_64 (abfd
, buf
);
652 read_n_bytes (bfd
*abfd ATTRIBUTE_UNUSED
,
655 unsigned int size ATTRIBUTE_UNUSED
)
657 if (buf
+ size
> end
)
662 /* Scans a NUL terminated string starting at BUF, returning a pointer to it.
663 Returns the number of characters in the string, *including* the NUL byte,
664 in BYTES_READ_PTR. This value is set even if the function fails. Bytes
665 at or beyond BUF_END will not be read. Returns NULL if there was a
666 problem, or if the string is empty. */
669 read_string (bfd
* abfd ATTRIBUTE_UNUSED
,
672 unsigned int * bytes_read_ptr
)
678 * bytes_read_ptr
= 0;
684 * bytes_read_ptr
= 1;
688 while (buf
< buf_end
)
691 * bytes_read_ptr
= buf
- str
;
695 * bytes_read_ptr
= buf
- str
;
699 /* Reads an offset from BUF and then locates the string at this offset
700 inside the debug string section. Returns a pointer to the string.
701 Returns the number of bytes read from BUF, *not* the length of the string,
702 in BYTES_READ_PTR. This value is set even if the function fails. Bytes
703 at or beyond BUF_END will not be read from BUF. Returns NULL if there was
704 a problem, or if the string is empty. Does not check for NUL termination
708 read_indirect_string (struct comp_unit
* unit
,
711 unsigned int * bytes_read_ptr
)
714 struct dwarf2_debug
*stash
= unit
->stash
;
717 if (buf
+ unit
->offset_size
> buf_end
)
719 * bytes_read_ptr
= 0;
723 if (unit
->offset_size
== 4)
724 offset
= read_4_bytes (unit
->abfd
, buf
, buf_end
);
726 offset
= read_8_bytes (unit
->abfd
, buf
, buf_end
);
728 *bytes_read_ptr
= unit
->offset_size
;
730 if (! read_section (unit
->abfd
, &stash
->debug_sections
[debug_str
],
732 &stash
->dwarf_str_buffer
, &stash
->dwarf_str_size
))
735 if (offset
>= stash
->dwarf_str_size
)
737 str
= (char *) stash
->dwarf_str_buffer
+ offset
;
743 /* Like read_indirect_string but from .debug_line_str section. */
746 read_indirect_line_string (struct comp_unit
* unit
,
749 unsigned int * bytes_read_ptr
)
752 struct dwarf2_debug
*stash
= unit
->stash
;
755 if (buf
+ unit
->offset_size
> buf_end
)
757 * bytes_read_ptr
= 0;
761 if (unit
->offset_size
== 4)
762 offset
= read_4_bytes (unit
->abfd
, buf
, buf_end
);
764 offset
= read_8_bytes (unit
->abfd
, buf
, buf_end
);
766 *bytes_read_ptr
= unit
->offset_size
;
768 if (! read_section (unit
->abfd
, &stash
->debug_sections
[debug_line_str
],
770 &stash
->dwarf_line_str_buffer
,
771 &stash
->dwarf_line_str_size
))
774 if (offset
>= stash
->dwarf_line_str_size
)
776 str
= (char *) stash
->dwarf_line_str_buffer
+ offset
;
782 /* Like read_indirect_string but uses a .debug_str located in
783 an alternate file pointed to by the .gnu_debugaltlink section.
784 Used to impement DW_FORM_GNU_strp_alt. */
787 read_alt_indirect_string (struct comp_unit
* unit
,
790 unsigned int * bytes_read_ptr
)
793 struct dwarf2_debug
*stash
= unit
->stash
;
796 if (buf
+ unit
->offset_size
> buf_end
)
798 * bytes_read_ptr
= 0;
802 if (unit
->offset_size
== 4)
803 offset
= read_4_bytes (unit
->abfd
, buf
, buf_end
);
805 offset
= read_8_bytes (unit
->abfd
, buf
, buf_end
);
807 *bytes_read_ptr
= unit
->offset_size
;
809 if (stash
->alt_bfd_ptr
== NULL
)
812 char * debug_filename
= bfd_follow_gnu_debugaltlink (unit
->abfd
, DEBUGDIR
);
814 if (debug_filename
== NULL
)
817 if ((debug_bfd
= bfd_openr (debug_filename
, NULL
)) == NULL
818 || ! bfd_check_format (debug_bfd
, bfd_object
))
821 bfd_close (debug_bfd
);
823 /* FIXME: Should we report our failure to follow the debuglink ? */
824 free (debug_filename
);
827 stash
->alt_bfd_ptr
= debug_bfd
;
830 if (! read_section (unit
->stash
->alt_bfd_ptr
,
831 stash
->debug_sections
+ debug_str_alt
,
832 NULL
, /* FIXME: Do we need to load alternate symbols ? */
834 &stash
->alt_dwarf_str_buffer
,
835 &stash
->alt_dwarf_str_size
))
838 if (offset
>= stash
->alt_dwarf_str_size
)
840 str
= (char *) stash
->alt_dwarf_str_buffer
+ offset
;
847 /* Resolve an alternate reference from UNIT at OFFSET.
848 Returns a pointer into the loaded alternate CU upon success
849 or NULL upon failure. */
852 read_alt_indirect_ref (struct comp_unit
* unit
,
855 struct dwarf2_debug
*stash
= unit
->stash
;
857 if (stash
->alt_bfd_ptr
== NULL
)
860 char * debug_filename
= bfd_follow_gnu_debugaltlink (unit
->abfd
, DEBUGDIR
);
862 if (debug_filename
== NULL
)
865 if ((debug_bfd
= bfd_openr (debug_filename
, NULL
)) == NULL
866 || ! bfd_check_format (debug_bfd
, bfd_object
))
869 bfd_close (debug_bfd
);
871 /* FIXME: Should we report our failure to follow the debuglink ? */
872 free (debug_filename
);
875 stash
->alt_bfd_ptr
= debug_bfd
;
878 if (! read_section (unit
->stash
->alt_bfd_ptr
,
879 stash
->debug_sections
+ debug_info_alt
,
880 NULL
, /* FIXME: Do we need to load alternate symbols ? */
882 &stash
->alt_dwarf_info_buffer
,
883 &stash
->alt_dwarf_info_size
))
886 if (offset
>= stash
->alt_dwarf_info_size
)
888 return stash
->alt_dwarf_info_buffer
+ offset
;
892 read_address (struct comp_unit
*unit
, bfd_byte
*buf
, bfd_byte
* buf_end
)
896 if (bfd_get_flavour (unit
->abfd
) == bfd_target_elf_flavour
)
897 signed_vma
= get_elf_backend_data (unit
->abfd
)->sign_extend_vma
;
899 if (buf
+ unit
->addr_size
> buf_end
)
904 switch (unit
->addr_size
)
907 return bfd_get_signed_64 (unit
->abfd
, buf
);
909 return bfd_get_signed_32 (unit
->abfd
, buf
);
911 return bfd_get_signed_16 (unit
->abfd
, buf
);
918 switch (unit
->addr_size
)
921 return bfd_get_64 (unit
->abfd
, buf
);
923 return bfd_get_32 (unit
->abfd
, buf
);
925 return bfd_get_16 (unit
->abfd
, buf
);
932 /* Lookup an abbrev_info structure in the abbrev hash table. */
934 static struct abbrev_info
*
935 lookup_abbrev (unsigned int number
, struct abbrev_info
**abbrevs
)
937 unsigned int hash_number
;
938 struct abbrev_info
*abbrev
;
940 hash_number
= number
% ABBREV_HASH_SIZE
;
941 abbrev
= abbrevs
[hash_number
];
945 if (abbrev
->number
== number
)
948 abbrev
= abbrev
->next
;
954 /* In DWARF version 2, the description of the debugging information is
955 stored in a separate .debug_abbrev section. Before we read any
956 dies from a section we read in all abbreviations and install them
959 static struct abbrev_info
**
960 read_abbrevs (bfd
*abfd
, bfd_uint64_t offset
, struct dwarf2_debug
*stash
)
962 struct abbrev_info
**abbrevs
;
963 bfd_byte
*abbrev_ptr
;
964 bfd_byte
*abbrev_end
;
965 struct abbrev_info
*cur_abbrev
;
966 unsigned int abbrev_number
, bytes_read
, abbrev_name
;
967 unsigned int abbrev_form
, hash_number
;
970 if (! read_section (abfd
, &stash
->debug_sections
[debug_abbrev
],
972 &stash
->dwarf_abbrev_buffer
, &stash
->dwarf_abbrev_size
))
975 if (offset
>= stash
->dwarf_abbrev_size
)
978 amt
= sizeof (struct abbrev_info
*) * ABBREV_HASH_SIZE
;
979 abbrevs
= (struct abbrev_info
**) bfd_zalloc (abfd
, amt
);
983 abbrev_ptr
= stash
->dwarf_abbrev_buffer
+ offset
;
984 abbrev_end
= stash
->dwarf_abbrev_buffer
+ stash
->dwarf_abbrev_size
;
985 abbrev_number
= _bfd_safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
,
987 abbrev_ptr
+= bytes_read
;
989 /* Loop until we reach an abbrev number of 0. */
990 while (abbrev_number
)
992 amt
= sizeof (struct abbrev_info
);
993 cur_abbrev
= (struct abbrev_info
*) bfd_zalloc (abfd
, amt
);
994 if (cur_abbrev
== NULL
)
997 /* Read in abbrev header. */
998 cur_abbrev
->number
= abbrev_number
;
999 cur_abbrev
->tag
= (enum dwarf_tag
)
1000 _bfd_safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
,
1002 abbrev_ptr
+= bytes_read
;
1003 cur_abbrev
->has_children
= read_1_byte (abfd
, abbrev_ptr
, abbrev_end
);
1006 /* Now read in declarations. */
1009 /* Initialize it just to avoid a GCC false warning. */
1010 bfd_vma implicit_const
= -1;
1012 abbrev_name
= _bfd_safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
,
1014 abbrev_ptr
+= bytes_read
;
1015 abbrev_form
= _bfd_safe_read_leb128 (abfd
, abbrev_ptr
, &bytes_read
,
1017 abbrev_ptr
+= bytes_read
;
1018 if (abbrev_form
== DW_FORM_implicit_const
)
1020 implicit_const
= _bfd_safe_read_leb128 (abfd
, abbrev_ptr
,
1023 abbrev_ptr
+= bytes_read
;
1026 if (abbrev_name
== 0)
1029 if ((cur_abbrev
->num_attrs
% ATTR_ALLOC_CHUNK
) == 0)
1031 struct attr_abbrev
*tmp
;
1033 amt
= cur_abbrev
->num_attrs
+ ATTR_ALLOC_CHUNK
;
1034 amt
*= sizeof (struct attr_abbrev
);
1035 tmp
= (struct attr_abbrev
*) bfd_realloc (cur_abbrev
->attrs
, amt
);
1040 for (i
= 0; i
< ABBREV_HASH_SIZE
; i
++)
1042 struct abbrev_info
*abbrev
= abbrevs
[i
];
1046 free (abbrev
->attrs
);
1047 abbrev
= abbrev
->next
;
1052 cur_abbrev
->attrs
= tmp
;
1055 cur_abbrev
->attrs
[cur_abbrev
->num_attrs
].name
1056 = (enum dwarf_attribute
) abbrev_name
;
1057 cur_abbrev
->attrs
[cur_abbrev
->num_attrs
].form
1058 = (enum dwarf_form
) abbrev_form
;
1059 cur_abbrev
->attrs
[cur_abbrev
->num_attrs
].implicit_const
1061 ++cur_abbrev
->num_attrs
;
1064 hash_number
= abbrev_number
% ABBREV_HASH_SIZE
;
1065 cur_abbrev
->next
= abbrevs
[hash_number
];
1066 abbrevs
[hash_number
] = cur_abbrev
;
1068 /* Get next abbreviation.
1069 Under Irix6 the abbreviations for a compilation unit are not
1070 always properly terminated with an abbrev number of 0.
1071 Exit loop if we encounter an abbreviation which we have
1072 already read (which means we are about to read the abbreviations
1073 for the next compile unit) or if the end of the abbreviation
1074 table is reached. */
1075 if ((unsigned int) (abbrev_ptr
- stash
->dwarf_abbrev_buffer
)
1076 >= stash
->dwarf_abbrev_size
)
1078 abbrev_number
= _bfd_safe_read_leb128 (abfd
, abbrev_ptr
,
1079 &bytes_read
, FALSE
, abbrev_end
);
1080 abbrev_ptr
+= bytes_read
;
1081 if (lookup_abbrev (abbrev_number
, abbrevs
) != NULL
)
1088 /* Returns true if the form is one which has a string value. */
1090 static inline bfd_boolean
1091 is_str_attr (enum dwarf_form form
)
1093 return (form
== DW_FORM_string
|| form
== DW_FORM_strp
1094 || form
== DW_FORM_line_strp
|| form
== DW_FORM_GNU_strp_alt
);
1097 /* Read and fill in the value of attribute ATTR as described by FORM.
1098 Read data starting from INFO_PTR, but never at or beyond INFO_PTR_END.
1099 Returns an updated INFO_PTR taking into account the amount of data read. */
1102 read_attribute_value (struct attribute
* attr
,
1104 bfd_vma implicit_const
,
1105 struct comp_unit
* unit
,
1106 bfd_byte
* info_ptr
,
1107 bfd_byte
* info_ptr_end
)
1109 bfd
*abfd
= unit
->abfd
;
1110 unsigned int bytes_read
;
1111 struct dwarf_block
*blk
;
1114 if (info_ptr
>= info_ptr_end
&& form
!= DW_FORM_flag_present
)
1116 _bfd_error_handler (_("Dwarf Error: Info pointer extends beyond end of attributes"));
1117 bfd_set_error (bfd_error_bad_value
);
1121 attr
->form
= (enum dwarf_form
) form
;
1125 case DW_FORM_ref_addr
:
1126 /* DW_FORM_ref_addr is an address in DWARF2, and an offset in
1128 if (unit
->version
== 3 || unit
->version
== 4)
1130 if (unit
->offset_size
== 4)
1131 attr
->u
.val
= read_4_bytes (unit
->abfd
, info_ptr
, info_ptr_end
);
1133 attr
->u
.val
= read_8_bytes (unit
->abfd
, info_ptr
, info_ptr_end
);
1134 info_ptr
+= unit
->offset_size
;
1139 attr
->u
.val
= read_address (unit
, info_ptr
, info_ptr_end
);
1140 info_ptr
+= unit
->addr_size
;
1142 case DW_FORM_GNU_ref_alt
:
1143 case DW_FORM_sec_offset
:
1144 if (unit
->offset_size
== 4)
1145 attr
->u
.val
= read_4_bytes (unit
->abfd
, info_ptr
, info_ptr_end
);
1147 attr
->u
.val
= read_8_bytes (unit
->abfd
, info_ptr
, info_ptr_end
);
1148 info_ptr
+= unit
->offset_size
;
1150 case DW_FORM_block2
:
1151 amt
= sizeof (struct dwarf_block
);
1152 blk
= (struct dwarf_block
*) bfd_alloc (abfd
, amt
);
1155 blk
->size
= read_2_bytes (abfd
, info_ptr
, info_ptr_end
);
1157 blk
->data
= read_n_bytes (abfd
, info_ptr
, info_ptr_end
, blk
->size
);
1158 info_ptr
+= blk
->size
;
1161 case DW_FORM_block4
:
1162 amt
= sizeof (struct dwarf_block
);
1163 blk
= (struct dwarf_block
*) bfd_alloc (abfd
, amt
);
1166 blk
->size
= read_4_bytes (abfd
, info_ptr
, info_ptr_end
);
1168 blk
->data
= read_n_bytes (abfd
, info_ptr
, info_ptr_end
, blk
->size
);
1169 info_ptr
+= blk
->size
;
1173 attr
->u
.val
= read_2_bytes (abfd
, info_ptr
, info_ptr_end
);
1177 attr
->u
.val
= read_4_bytes (abfd
, info_ptr
, info_ptr_end
);
1181 attr
->u
.val
= read_8_bytes (abfd
, info_ptr
, info_ptr_end
);
1184 case DW_FORM_string
:
1185 attr
->u
.str
= read_string (abfd
, info_ptr
, info_ptr_end
, &bytes_read
);
1186 info_ptr
+= bytes_read
;
1189 attr
->u
.str
= read_indirect_string (unit
, info_ptr
, info_ptr_end
, &bytes_read
);
1190 info_ptr
+= bytes_read
;
1192 case DW_FORM_line_strp
:
1193 attr
->u
.str
= read_indirect_line_string (unit
, info_ptr
, info_ptr_end
, &bytes_read
);
1194 info_ptr
+= bytes_read
;
1196 case DW_FORM_GNU_strp_alt
:
1197 attr
->u
.str
= read_alt_indirect_string (unit
, info_ptr
, info_ptr_end
, &bytes_read
);
1198 info_ptr
+= bytes_read
;
1200 case DW_FORM_exprloc
:
1202 amt
= sizeof (struct dwarf_block
);
1203 blk
= (struct dwarf_block
*) bfd_alloc (abfd
, amt
);
1206 blk
->size
= _bfd_safe_read_leb128 (abfd
, info_ptr
, &bytes_read
,
1207 FALSE
, info_ptr_end
);
1208 info_ptr
+= bytes_read
;
1209 blk
->data
= read_n_bytes (abfd
, info_ptr
, info_ptr_end
, blk
->size
);
1210 info_ptr
+= blk
->size
;
1213 case DW_FORM_block1
:
1214 amt
= sizeof (struct dwarf_block
);
1215 blk
= (struct dwarf_block
*) bfd_alloc (abfd
, amt
);
1218 blk
->size
= read_1_byte (abfd
, info_ptr
, info_ptr_end
);
1220 blk
->data
= read_n_bytes (abfd
, info_ptr
, info_ptr_end
, blk
->size
);
1221 info_ptr
+= blk
->size
;
1225 attr
->u
.val
= read_1_byte (abfd
, info_ptr
, info_ptr_end
);
1229 attr
->u
.val
= read_1_byte (abfd
, info_ptr
, info_ptr_end
);
1232 case DW_FORM_flag_present
:
1236 attr
->u
.sval
= _bfd_safe_read_leb128 (abfd
, info_ptr
, &bytes_read
,
1237 TRUE
, info_ptr_end
);
1238 info_ptr
+= bytes_read
;
1241 attr
->u
.val
= _bfd_safe_read_leb128 (abfd
, info_ptr
, &bytes_read
,
1242 FALSE
, info_ptr_end
);
1243 info_ptr
+= bytes_read
;
1246 attr
->u
.val
= read_1_byte (abfd
, info_ptr
, info_ptr_end
);
1250 attr
->u
.val
= read_2_bytes (abfd
, info_ptr
, info_ptr_end
);
1254 attr
->u
.val
= read_4_bytes (abfd
, info_ptr
, info_ptr_end
);
1258 attr
->u
.val
= read_8_bytes (abfd
, info_ptr
, info_ptr_end
);
1261 case DW_FORM_ref_sig8
:
1262 attr
->u
.val
= read_8_bytes (abfd
, info_ptr
, info_ptr_end
);
1265 case DW_FORM_ref_udata
:
1266 attr
->u
.val
= _bfd_safe_read_leb128 (abfd
, info_ptr
, &bytes_read
,
1267 FALSE
, info_ptr_end
);
1268 info_ptr
+= bytes_read
;
1270 case DW_FORM_indirect
:
1271 form
= _bfd_safe_read_leb128 (abfd
, info_ptr
, &bytes_read
,
1272 FALSE
, info_ptr_end
);
1273 info_ptr
+= bytes_read
;
1274 if (form
== DW_FORM_implicit_const
)
1276 implicit_const
= _bfd_safe_read_leb128 (abfd
, info_ptr
, &bytes_read
,
1277 TRUE
, info_ptr_end
);
1278 info_ptr
+= bytes_read
;
1280 info_ptr
= read_attribute_value (attr
, form
, implicit_const
, unit
,
1281 info_ptr
, info_ptr_end
);
1283 case DW_FORM_implicit_const
:
1284 attr
->form
= DW_FORM_sdata
;
1285 attr
->u
.sval
= implicit_const
;
1288 _bfd_error_handler (_("Dwarf Error: Invalid or unhandled FORM value: %#x."),
1290 bfd_set_error (bfd_error_bad_value
);
1296 /* Read an attribute described by an abbreviated attribute. */
1299 read_attribute (struct attribute
* attr
,
1300 struct attr_abbrev
* abbrev
,
1301 struct comp_unit
* unit
,
1302 bfd_byte
* info_ptr
,
1303 bfd_byte
* info_ptr_end
)
1305 attr
->name
= abbrev
->name
;
1306 info_ptr
= read_attribute_value (attr
, abbrev
->form
, abbrev
->implicit_const
,
1307 unit
, info_ptr
, info_ptr_end
);
1311 /* Return whether DW_AT_name will return the same as DW_AT_linkage_name
1315 non_mangled (int lang
)
1325 case DW_LANG_Cobol74
:
1326 case DW_LANG_Cobol85
:
1327 case DW_LANG_Fortran77
:
1328 case DW_LANG_Pascal83
:
1338 /* Source line information table routines. */
1340 #define FILE_ALLOC_CHUNK 5
1341 #define DIR_ALLOC_CHUNK 5
1345 struct line_info
* prev_line
;
1349 unsigned int column
;
1350 unsigned int discriminator
;
1351 unsigned char op_index
;
1352 unsigned char end_sequence
; /* End of (sequential) code sequence. */
1363 struct line_sequence
1366 struct line_sequence
* prev_sequence
;
1367 struct line_info
* last_line
; /* Largest VMA. */
1368 struct line_info
** line_info_lookup
;
1369 bfd_size_type num_lines
;
1372 struct line_info_table
1375 unsigned int num_files
;
1376 unsigned int num_dirs
;
1377 unsigned int num_sequences
;
1380 struct fileinfo
* files
;
1381 struct line_sequence
* sequences
;
1382 struct line_info
* lcl_head
; /* Local head; used in 'add_line_info'. */
1385 /* Remember some information about each function. If the function is
1386 inlined (DW_TAG_inlined_subroutine) it may have two additional
1387 attributes, DW_AT_call_file and DW_AT_call_line, which specify the
1388 source code location where this function was inlined. */
1392 /* Pointer to previous function in list of all functions. */
1393 struct funcinfo
* prev_func
;
1394 /* Pointer to function one scope higher. */
1395 struct funcinfo
* caller_func
;
1396 /* Source location file name where caller_func inlines this func. */
1398 /* Source location file name. */
1400 /* Source location line number where caller_func inlines this func. */
1402 /* Source location line number. */
1405 bfd_boolean is_linkage
;
1407 struct arange arange
;
1408 /* Where the symbol is defined. */
1412 struct lookup_funcinfo
1414 /* Function information corresponding to this lookup table entry. */
1415 struct funcinfo
* funcinfo
;
1417 /* The lowest address for this specific function. */
1420 /* The highest address of this function before the lookup table is sorted.
1421 The highest address of all prior functions after the lookup table is
1422 sorted, which is used for binary search. */
1428 /* Pointer to previous variable in list of all variables */
1429 struct varinfo
*prev_var
;
1430 /* Source location file name */
1432 /* Source location line number */
1437 /* Where the symbol is defined */
1439 /* Is this a stack variable? */
1440 unsigned int stack
: 1;
1443 /* Return TRUE if NEW_LINE should sort after LINE. */
1445 static inline bfd_boolean
1446 new_line_sorts_after (struct line_info
*new_line
, struct line_info
*line
)
1448 return (new_line
->address
> line
->address
1449 || (new_line
->address
== line
->address
1450 && (new_line
->op_index
> line
->op_index
1451 || (new_line
->op_index
== line
->op_index
1452 && new_line
->end_sequence
< line
->end_sequence
))));
1456 /* Adds a new entry to the line_info list in the line_info_table, ensuring
1457 that the list is sorted. Note that the line_info list is sorted from
1458 highest to lowest VMA (with possible duplicates); that is,
1459 line_info->prev_line always accesses an equal or smaller VMA. */
1462 add_line_info (struct line_info_table
*table
,
1464 unsigned char op_index
,
1467 unsigned int column
,
1468 unsigned int discriminator
,
1471 bfd_size_type amt
= sizeof (struct line_info
);
1472 struct line_sequence
* seq
= table
->sequences
;
1473 struct line_info
* info
= (struct line_info
*) bfd_alloc (table
->abfd
, amt
);
1478 /* Set member data of 'info'. */
1479 info
->prev_line
= NULL
;
1480 info
->address
= address
;
1481 info
->op_index
= op_index
;
1483 info
->column
= column
;
1484 info
->discriminator
= discriminator
;
1485 info
->end_sequence
= end_sequence
;
1487 if (filename
&& filename
[0])
1489 info
->filename
= (char *) bfd_alloc (table
->abfd
, strlen (filename
) + 1);
1490 if (info
->filename
== NULL
)
1492 strcpy (info
->filename
, filename
);
1495 info
->filename
= NULL
;
1497 /* Find the correct location for 'info'. Normally we will receive
1498 new line_info data 1) in order and 2) with increasing VMAs.
1499 However some compilers break the rules (cf. decode_line_info) and
1500 so we include some heuristics for quickly finding the correct
1501 location for 'info'. In particular, these heuristics optimize for
1502 the common case in which the VMA sequence that we receive is a
1503 list of locally sorted VMAs such as
1504 p...z a...j (where a < j < p < z)
1506 Note: table->lcl_head is used to head an *actual* or *possible*
1507 sub-sequence within the list (such as a...j) that is not directly
1508 headed by table->last_line
1510 Note: we may receive duplicate entries from 'decode_line_info'. */
1513 && seq
->last_line
->address
== address
1514 && seq
->last_line
->op_index
== op_index
1515 && seq
->last_line
->end_sequence
== end_sequence
)
1517 /* We only keep the last entry with the same address and end
1518 sequence. See PR ld/4986. */
1519 if (table
->lcl_head
== seq
->last_line
)
1520 table
->lcl_head
= info
;
1521 info
->prev_line
= seq
->last_line
->prev_line
;
1522 seq
->last_line
= info
;
1524 else if (!seq
|| seq
->last_line
->end_sequence
)
1526 /* Start a new line sequence. */
1527 amt
= sizeof (struct line_sequence
);
1528 seq
= (struct line_sequence
*) bfd_malloc (amt
);
1531 seq
->low_pc
= address
;
1532 seq
->prev_sequence
= table
->sequences
;
1533 seq
->last_line
= info
;
1534 table
->lcl_head
= info
;
1535 table
->sequences
= seq
;
1536 table
->num_sequences
++;
1538 else if (new_line_sorts_after (info
, seq
->last_line
))
1540 /* Normal case: add 'info' to the beginning of the current sequence. */
1541 info
->prev_line
= seq
->last_line
;
1542 seq
->last_line
= info
;
1544 /* lcl_head: initialize to head a *possible* sequence at the end. */
1545 if (!table
->lcl_head
)
1546 table
->lcl_head
= info
;
1548 else if (!new_line_sorts_after (info
, table
->lcl_head
)
1549 && (!table
->lcl_head
->prev_line
1550 || new_line_sorts_after (info
, table
->lcl_head
->prev_line
)))
1552 /* Abnormal but easy: lcl_head is the head of 'info'. */
1553 info
->prev_line
= table
->lcl_head
->prev_line
;
1554 table
->lcl_head
->prev_line
= info
;
1558 /* Abnormal and hard: Neither 'last_line' nor 'lcl_head'
1559 are valid heads for 'info'. Reset 'lcl_head'. */
1560 struct line_info
* li2
= seq
->last_line
; /* Always non-NULL. */
1561 struct line_info
* li1
= li2
->prev_line
;
1565 if (!new_line_sorts_after (info
, li2
)
1566 && new_line_sorts_after (info
, li1
))
1569 li2
= li1
; /* always non-NULL */
1570 li1
= li1
->prev_line
;
1572 table
->lcl_head
= li2
;
1573 info
->prev_line
= table
->lcl_head
->prev_line
;
1574 table
->lcl_head
->prev_line
= info
;
1575 if (address
< seq
->low_pc
)
1576 seq
->low_pc
= address
;
1581 /* Extract a fully qualified filename from a line info table.
1582 The returned string has been malloc'ed and it is the caller's
1583 responsibility to free it. */
1586 concat_filename (struct line_info_table
*table
, unsigned int file
)
1590 if (file
- 1 >= table
->num_files
)
1592 /* FILE == 0 means unknown. */
1595 (_("Dwarf Error: mangled line number section (bad file number)."));
1596 return strdup ("<unknown>");
1599 filename
= table
->files
[file
- 1].name
;
1600 if (filename
== NULL
)
1601 return strdup ("<unknown>");
1603 if (!IS_ABSOLUTE_PATH (filename
))
1605 char *dir_name
= NULL
;
1606 char *subdir_name
= NULL
;
1610 if (table
->files
[file
- 1].dir
1611 /* PR 17512: file: 0317e960. */
1612 && table
->files
[file
- 1].dir
<= table
->num_dirs
1613 /* PR 17512: file: 7f3d2e4b. */
1614 && table
->dirs
!= NULL
)
1615 subdir_name
= table
->dirs
[table
->files
[file
- 1].dir
- 1];
1617 if (!subdir_name
|| !IS_ABSOLUTE_PATH (subdir_name
))
1618 dir_name
= table
->comp_dir
;
1622 dir_name
= subdir_name
;
1627 return strdup (filename
);
1629 len
= strlen (dir_name
) + strlen (filename
) + 2;
1633 len
+= strlen (subdir_name
) + 1;
1634 name
= (char *) bfd_malloc (len
);
1636 sprintf (name
, "%s/%s/%s", dir_name
, subdir_name
, filename
);
1640 name
= (char *) bfd_malloc (len
);
1642 sprintf (name
, "%s/%s", dir_name
, filename
);
1648 return strdup (filename
);
1652 arange_add (const struct comp_unit
*unit
, struct arange
*first_arange
,
1653 bfd_vma low_pc
, bfd_vma high_pc
)
1655 struct arange
*arange
;
1657 /* Ignore empty ranges. */
1658 if (low_pc
== high_pc
)
1661 /* If the first arange is empty, use it. */
1662 if (first_arange
->high
== 0)
1664 first_arange
->low
= low_pc
;
1665 first_arange
->high
= high_pc
;
1669 /* Next see if we can cheaply extend an existing range. */
1670 arange
= first_arange
;
1673 if (low_pc
== arange
->high
)
1675 arange
->high
= high_pc
;
1678 if (high_pc
== arange
->low
)
1680 arange
->low
= low_pc
;
1683 arange
= arange
->next
;
1687 /* Need to allocate a new arange and insert it into the arange list.
1688 Order isn't significant, so just insert after the first arange. */
1689 arange
= (struct arange
*) bfd_alloc (unit
->abfd
, sizeof (*arange
));
1692 arange
->low
= low_pc
;
1693 arange
->high
= high_pc
;
1694 arange
->next
= first_arange
->next
;
1695 first_arange
->next
= arange
;
1699 /* Compare function for line sequences. */
1702 compare_sequences (const void* a
, const void* b
)
1704 const struct line_sequence
* seq1
= a
;
1705 const struct line_sequence
* seq2
= b
;
1707 /* Sort by low_pc as the primary key. */
1708 if (seq1
->low_pc
< seq2
->low_pc
)
1710 if (seq1
->low_pc
> seq2
->low_pc
)
1713 /* If low_pc values are equal, sort in reverse order of
1714 high_pc, so that the largest region comes first. */
1715 if (seq1
->last_line
->address
< seq2
->last_line
->address
)
1717 if (seq1
->last_line
->address
> seq2
->last_line
->address
)
1720 if (seq1
->last_line
->op_index
< seq2
->last_line
->op_index
)
1722 if (seq1
->last_line
->op_index
> seq2
->last_line
->op_index
)
1728 /* Construct the line information table for quick lookup. */
1731 build_line_info_table (struct line_info_table
* table
,
1732 struct line_sequence
* seq
)
1735 struct line_info
** line_info_lookup
;
1736 struct line_info
* each_line
;
1737 unsigned int num_lines
;
1738 unsigned int line_index
;
1740 if (seq
->line_info_lookup
!= NULL
)
1743 /* Count the number of line information entries. We could do this while
1744 scanning the debug information, but some entries may be added via
1745 lcl_head without having a sequence handy to increment the number of
1748 for (each_line
= seq
->last_line
; each_line
; each_line
= each_line
->prev_line
)
1754 /* Allocate space for the line information lookup table. */
1755 amt
= sizeof (struct line_info
*) * num_lines
;
1756 line_info_lookup
= (struct line_info
**) bfd_alloc (table
->abfd
, amt
);
1757 if (line_info_lookup
== NULL
)
1760 /* Create the line information lookup table. */
1761 line_index
= num_lines
;
1762 for (each_line
= seq
->last_line
; each_line
; each_line
= each_line
->prev_line
)
1763 line_info_lookup
[--line_index
] = each_line
;
1765 BFD_ASSERT (line_index
== 0);
1767 seq
->num_lines
= num_lines
;
1768 seq
->line_info_lookup
= line_info_lookup
;
1773 /* Sort the line sequences for quick lookup. */
1776 sort_line_sequences (struct line_info_table
* table
)
1779 struct line_sequence
* sequences
;
1780 struct line_sequence
* seq
;
1782 unsigned int num_sequences
= table
->num_sequences
;
1783 bfd_vma last_high_pc
;
1785 if (num_sequences
== 0)
1788 /* Allocate space for an array of sequences. */
1789 amt
= sizeof (struct line_sequence
) * num_sequences
;
1790 sequences
= (struct line_sequence
*) bfd_alloc (table
->abfd
, amt
);
1791 if (sequences
== NULL
)
1794 /* Copy the linked list into the array, freeing the original nodes. */
1795 seq
= table
->sequences
;
1796 for (n
= 0; n
< num_sequences
; n
++)
1798 struct line_sequence
* last_seq
= seq
;
1801 sequences
[n
].low_pc
= seq
->low_pc
;
1802 sequences
[n
].prev_sequence
= NULL
;
1803 sequences
[n
].last_line
= seq
->last_line
;
1804 sequences
[n
].line_info_lookup
= NULL
;
1805 sequences
[n
].num_lines
= 0;
1806 seq
= seq
->prev_sequence
;
1809 BFD_ASSERT (seq
== NULL
);
1811 qsort (sequences
, n
, sizeof (struct line_sequence
), compare_sequences
);
1813 /* Make the list binary-searchable by trimming overlapping entries
1814 and removing nested entries. */
1816 last_high_pc
= sequences
[0].last_line
->address
;
1817 for (n
= 1; n
< table
->num_sequences
; n
++)
1819 if (sequences
[n
].low_pc
< last_high_pc
)
1821 if (sequences
[n
].last_line
->address
<= last_high_pc
)
1822 /* Skip nested entries. */
1825 /* Trim overlapping entries. */
1826 sequences
[n
].low_pc
= last_high_pc
;
1828 last_high_pc
= sequences
[n
].last_line
->address
;
1829 if (n
> num_sequences
)
1831 /* Close up the gap. */
1832 sequences
[num_sequences
].low_pc
= sequences
[n
].low_pc
;
1833 sequences
[num_sequences
].last_line
= sequences
[n
].last_line
;
1838 table
->sequences
= sequences
;
1839 table
->num_sequences
= num_sequences
;
1843 /* Add directory to TABLE. CUR_DIR memory ownership is taken by TABLE. */
1846 line_info_add_include_dir (struct line_info_table
*table
, char *cur_dir
)
1848 if ((table
->num_dirs
% DIR_ALLOC_CHUNK
) == 0)
1853 amt
= table
->num_dirs
+ DIR_ALLOC_CHUNK
;
1854 amt
*= sizeof (char *);
1856 tmp
= (char **) bfd_realloc (table
->dirs
, amt
);
1862 table
->dirs
[table
->num_dirs
++] = cur_dir
;
1867 line_info_add_include_dir_stub (struct line_info_table
*table
, char *cur_dir
,
1868 unsigned int dir ATTRIBUTE_UNUSED
,
1869 unsigned int xtime ATTRIBUTE_UNUSED
,
1870 unsigned int size ATTRIBUTE_UNUSED
)
1872 return line_info_add_include_dir (table
, cur_dir
);
1875 /* Add file to TABLE. CUR_FILE memory ownership is taken by TABLE. */
1878 line_info_add_file_name (struct line_info_table
*table
, char *cur_file
,
1879 unsigned int dir
, unsigned int xtime
,
1882 if ((table
->num_files
% FILE_ALLOC_CHUNK
) == 0)
1884 struct fileinfo
*tmp
;
1887 amt
= table
->num_files
+ FILE_ALLOC_CHUNK
;
1888 amt
*= sizeof (struct fileinfo
);
1890 tmp
= (struct fileinfo
*) bfd_realloc (table
->files
, amt
);
1896 table
->files
[table
->num_files
].name
= cur_file
;
1897 table
->files
[table
->num_files
].dir
= dir
;
1898 table
->files
[table
->num_files
].time
= xtime
;
1899 table
->files
[table
->num_files
].size
= size
;
1904 /* Read directory or file name entry format, starting with byte of
1905 format count entries, ULEB128 pairs of entry formats, ULEB128 of
1906 entries count and the entries themselves in the described entry
1910 read_formatted_entries (struct comp_unit
*unit
, bfd_byte
**bufp
,
1911 bfd_byte
*buf_end
, struct line_info_table
*table
,
1912 bfd_boolean (*callback
) (struct line_info_table
*table
,
1918 bfd
*abfd
= unit
->abfd
;
1919 bfd_byte format_count
, formati
;
1920 bfd_vma data_count
, datai
;
1921 bfd_byte
*buf
= *bufp
;
1922 bfd_byte
*format_header_data
;
1923 unsigned int bytes_read
;
1925 format_count
= read_1_byte (abfd
, buf
, buf_end
);
1927 format_header_data
= buf
;
1928 for (formati
= 0; formati
< format_count
; formati
++)
1930 _bfd_safe_read_leb128 (abfd
, buf
, &bytes_read
, FALSE
, buf_end
);
1932 _bfd_safe_read_leb128 (abfd
, buf
, &bytes_read
, FALSE
, buf_end
);
1936 data_count
= _bfd_safe_read_leb128 (abfd
, buf
, &bytes_read
, FALSE
, buf_end
);
1938 if (format_count
== 0 && data_count
!= 0)
1940 _bfd_error_handler (_("Dwarf Error: Zero format count."));
1941 bfd_set_error (bfd_error_bad_value
);
1945 for (datai
= 0; datai
< data_count
; datai
++)
1947 bfd_byte
*format
= format_header_data
;
1950 memset (&fe
, 0, sizeof fe
);
1951 for (formati
= 0; formati
< format_count
; formati
++)
1953 bfd_vma content_type
, form
;
1955 char **stringp
= &string_trash
;
1956 unsigned int uint_trash
, *uintp
= &uint_trash
;
1958 content_type
= _bfd_safe_read_leb128 (abfd
, format
, &bytes_read
,
1960 format
+= bytes_read
;
1961 switch (content_type
)
1966 case DW_LNCT_directory_index
:
1969 case DW_LNCT_timestamp
:
1979 (_("Dwarf Error: Unknown format content type %Lu."),
1981 bfd_set_error (bfd_error_bad_value
);
1985 form
= _bfd_safe_read_leb128 (abfd
, format
, &bytes_read
, FALSE
,
1987 format
+= bytes_read
;
1990 case DW_FORM_string
:
1991 *stringp
= read_string (abfd
, buf
, buf_end
, &bytes_read
);
1995 case DW_FORM_line_strp
:
1996 *stringp
= read_indirect_line_string (unit
, buf
, buf_end
, &bytes_read
);
2001 *uintp
= read_1_byte (abfd
, buf
, buf_end
);
2006 *uintp
= read_2_bytes (abfd
, buf
, buf_end
);
2011 *uintp
= read_4_bytes (abfd
, buf
, buf_end
);
2016 *uintp
= read_8_bytes (abfd
, buf
, buf_end
);
2021 *uintp
= _bfd_safe_read_leb128 (abfd
, buf
, &bytes_read
, FALSE
,
2027 /* It is valid only for DW_LNCT_timestamp which is ignored by
2033 if (!callback (table
, fe
.name
, fe
.dir
, fe
.time
, fe
.size
))
2041 /* Decode the line number information for UNIT. */
2043 static struct line_info_table
*
2044 decode_line_info (struct comp_unit
*unit
, struct dwarf2_debug
*stash
)
2046 bfd
*abfd
= unit
->abfd
;
2047 struct line_info_table
* table
;
2050 struct line_head lh
;
2051 unsigned int i
, bytes_read
, offset_size
;
2052 char *cur_file
, *cur_dir
;
2053 unsigned char op_code
, extended_op
, adj_opcode
;
2054 unsigned int exop_len
;
2057 if (! read_section (abfd
, &stash
->debug_sections
[debug_line
],
2058 stash
->syms
, unit
->line_offset
,
2059 &stash
->dwarf_line_buffer
, &stash
->dwarf_line_size
))
2062 amt
= sizeof (struct line_info_table
);
2063 table
= (struct line_info_table
*) bfd_alloc (abfd
, amt
);
2067 table
->comp_dir
= unit
->comp_dir
;
2069 table
->num_files
= 0;
2070 table
->files
= NULL
;
2072 table
->num_dirs
= 0;
2075 table
->num_sequences
= 0;
2076 table
->sequences
= NULL
;
2078 table
->lcl_head
= NULL
;
2080 if (stash
->dwarf_line_size
< 16)
2083 (_("Dwarf Error: Line info section is too small (%Ld)"),
2084 stash
->dwarf_line_size
);
2085 bfd_set_error (bfd_error_bad_value
);
2088 line_ptr
= stash
->dwarf_line_buffer
+ unit
->line_offset
;
2089 line_end
= stash
->dwarf_line_buffer
+ stash
->dwarf_line_size
;
2091 /* Read in the prologue. */
2092 lh
.total_length
= read_4_bytes (abfd
, line_ptr
, line_end
);
2095 if (lh
.total_length
== 0xffffffff)
2097 lh
.total_length
= read_8_bytes (abfd
, line_ptr
, line_end
);
2101 else if (lh
.total_length
== 0 && unit
->addr_size
== 8)
2103 /* Handle (non-standard) 64-bit DWARF2 formats. */
2104 lh
.total_length
= read_4_bytes (abfd
, line_ptr
, line_end
);
2109 if (lh
.total_length
> (size_t) (line_end
- line_ptr
))
2112 /* xgettext: c-format */
2113 (_("Dwarf Error: Line info data is bigger (%#Lx)"
2114 " than the space remaining in the section (%#lx)"),
2115 lh
.total_length
, (unsigned long) (line_end
- line_ptr
));
2116 bfd_set_error (bfd_error_bad_value
);
2120 line_end
= line_ptr
+ lh
.total_length
;
2122 lh
.version
= read_2_bytes (abfd
, line_ptr
, line_end
);
2123 if (lh
.version
< 2 || lh
.version
> 5)
2126 (_("Dwarf Error: Unhandled .debug_line version %d."), lh
.version
);
2127 bfd_set_error (bfd_error_bad_value
);
2132 if (line_ptr
+ offset_size
+ (lh
.version
>= 5 ? 8 : (lh
.version
>= 4 ? 6 : 5))
2136 (_("Dwarf Error: Ran out of room reading prologue"));
2137 bfd_set_error (bfd_error_bad_value
);
2141 if (lh
.version
>= 5)
2143 unsigned int segment_selector_size
;
2145 /* Skip address size. */
2146 read_1_byte (abfd
, line_ptr
, line_end
);
2149 segment_selector_size
= read_1_byte (abfd
, line_ptr
, line_end
);
2151 if (segment_selector_size
!= 0)
2154 (_("Dwarf Error: Line info unsupported segment selector size %u."),
2155 segment_selector_size
);
2156 bfd_set_error (bfd_error_bad_value
);
2161 if (offset_size
== 4)
2162 lh
.prologue_length
= read_4_bytes (abfd
, line_ptr
, line_end
);
2164 lh
.prologue_length
= read_8_bytes (abfd
, line_ptr
, line_end
);
2165 line_ptr
+= offset_size
;
2167 lh
.minimum_instruction_length
= read_1_byte (abfd
, line_ptr
, line_end
);
2170 if (lh
.version
>= 4)
2172 lh
.maximum_ops_per_insn
= read_1_byte (abfd
, line_ptr
, line_end
);
2176 lh
.maximum_ops_per_insn
= 1;
2178 if (lh
.maximum_ops_per_insn
== 0)
2181 (_("Dwarf Error: Invalid maximum operations per instruction."));
2182 bfd_set_error (bfd_error_bad_value
);
2186 lh
.default_is_stmt
= read_1_byte (abfd
, line_ptr
, line_end
);
2189 lh
.line_base
= read_1_signed_byte (abfd
, line_ptr
, line_end
);
2192 lh
.line_range
= read_1_byte (abfd
, line_ptr
, line_end
);
2195 lh
.opcode_base
= read_1_byte (abfd
, line_ptr
, line_end
);
2198 if (line_ptr
+ (lh
.opcode_base
- 1) >= line_end
)
2200 _bfd_error_handler (_("Dwarf Error: Ran out of room reading opcodes"));
2201 bfd_set_error (bfd_error_bad_value
);
2205 amt
= lh
.opcode_base
* sizeof (unsigned char);
2206 lh
.standard_opcode_lengths
= (unsigned char *) bfd_alloc (abfd
, amt
);
2208 lh
.standard_opcode_lengths
[0] = 1;
2210 for (i
= 1; i
< lh
.opcode_base
; ++i
)
2212 lh
.standard_opcode_lengths
[i
] = read_1_byte (abfd
, line_ptr
, line_end
);
2216 if (lh
.version
>= 5)
2218 /* Read directory table. */
2219 if (!read_formatted_entries (unit
, &line_ptr
, line_end
, table
,
2220 line_info_add_include_dir_stub
))
2223 /* Read file name table. */
2224 if (!read_formatted_entries (unit
, &line_ptr
, line_end
, table
,
2225 line_info_add_file_name
))
2230 /* Read directory table. */
2231 while ((cur_dir
= read_string (abfd
, line_ptr
, line_end
, &bytes_read
)) != NULL
)
2233 line_ptr
+= bytes_read
;
2235 if (!line_info_add_include_dir (table
, cur_dir
))
2239 line_ptr
+= bytes_read
;
2241 /* Read file name table. */
2242 while ((cur_file
= read_string (abfd
, line_ptr
, line_end
, &bytes_read
)) != NULL
)
2244 unsigned int dir
, xtime
, size
;
2246 line_ptr
+= bytes_read
;
2248 dir
= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2249 line_ptr
+= bytes_read
;
2250 xtime
= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2251 line_ptr
+= bytes_read
;
2252 size
= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
, FALSE
, line_end
);
2253 line_ptr
+= bytes_read
;
2255 if (!line_info_add_file_name (table
, cur_file
, dir
, xtime
, size
))
2259 line_ptr
+= bytes_read
;
2262 /* Read the statement sequences until there's nothing left. */
2263 while (line_ptr
< line_end
)
2265 /* State machine registers. */
2266 bfd_vma address
= 0;
2267 unsigned char op_index
= 0;
2268 char * filename
= table
->num_files
? concat_filename (table
, 1) : NULL
;
2269 unsigned int line
= 1;
2270 unsigned int column
= 0;
2271 unsigned int discriminator
= 0;
2272 int is_stmt
= lh
.default_is_stmt
;
2273 int end_sequence
= 0;
2274 unsigned int dir
, xtime
, size
;
2275 /* eraxxon@alumni.rice.edu: Against the DWARF2 specs, some
2276 compilers generate address sequences that are wildly out of
2277 order using DW_LNE_set_address (e.g. Intel C++ 6.0 compiler
2278 for ia64-Linux). Thus, to determine the low and high
2279 address, we must compare on every DW_LNS_copy, etc. */
2280 bfd_vma low_pc
= (bfd_vma
) -1;
2281 bfd_vma high_pc
= 0;
2283 /* Decode the table. */
2284 while (!end_sequence
&& line_ptr
< line_end
)
2286 op_code
= read_1_byte (abfd
, line_ptr
, line_end
);
2289 if (op_code
>= lh
.opcode_base
)
2291 /* Special operand. */
2292 adj_opcode
= op_code
- lh
.opcode_base
;
2293 if (lh
.line_range
== 0)
2295 if (lh
.maximum_ops_per_insn
== 1)
2296 address
+= (adj_opcode
/ lh
.line_range
2297 * lh
.minimum_instruction_length
);
2300 address
+= ((op_index
+ adj_opcode
/ lh
.line_range
)
2301 / lh
.maximum_ops_per_insn
2302 * lh
.minimum_instruction_length
);
2303 op_index
= ((op_index
+ adj_opcode
/ lh
.line_range
)
2304 % lh
.maximum_ops_per_insn
);
2306 line
+= lh
.line_base
+ (adj_opcode
% lh
.line_range
);
2307 /* Append row to matrix using current values. */
2308 if (!add_line_info (table
, address
, op_index
, filename
,
2309 line
, column
, discriminator
, 0))
2312 if (address
< low_pc
)
2314 if (address
> high_pc
)
2317 else switch (op_code
)
2319 case DW_LNS_extended_op
:
2320 exop_len
= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2322 line_ptr
+= bytes_read
;
2323 extended_op
= read_1_byte (abfd
, line_ptr
, line_end
);
2326 switch (extended_op
)
2328 case DW_LNE_end_sequence
:
2330 if (!add_line_info (table
, address
, op_index
, filename
, line
,
2331 column
, discriminator
, end_sequence
))
2334 if (address
< low_pc
)
2336 if (address
> high_pc
)
2338 if (!arange_add (unit
, &unit
->arange
, low_pc
, high_pc
))
2341 case DW_LNE_set_address
:
2342 address
= read_address (unit
, line_ptr
, line_end
);
2344 line_ptr
+= unit
->addr_size
;
2346 case DW_LNE_define_file
:
2347 cur_file
= read_string (abfd
, line_ptr
, line_end
, &bytes_read
);
2348 line_ptr
+= bytes_read
;
2349 dir
= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2351 line_ptr
+= bytes_read
;
2352 xtime
= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2354 line_ptr
+= bytes_read
;
2355 size
= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2357 line_ptr
+= bytes_read
;
2358 if (!line_info_add_file_name (table
, cur_file
, dir
,
2362 case DW_LNE_set_discriminator
:
2364 _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2366 line_ptr
+= bytes_read
;
2368 case DW_LNE_HP_source_file_correlation
:
2369 line_ptr
+= exop_len
- 1;
2373 (_("Dwarf Error: mangled line number section."));
2374 bfd_set_error (bfd_error_bad_value
);
2376 if (filename
!= NULL
)
2382 if (!add_line_info (table
, address
, op_index
,
2383 filename
, line
, column
, discriminator
, 0))
2386 if (address
< low_pc
)
2388 if (address
> high_pc
)
2391 case DW_LNS_advance_pc
:
2392 if (lh
.maximum_ops_per_insn
== 1)
2393 address
+= (lh
.minimum_instruction_length
2394 * _bfd_safe_read_leb128 (abfd
, line_ptr
,
2399 bfd_vma adjust
= _bfd_safe_read_leb128 (abfd
, line_ptr
,
2402 address
= ((op_index
+ adjust
) / lh
.maximum_ops_per_insn
2403 * lh
.minimum_instruction_length
);
2404 op_index
= (op_index
+ adjust
) % lh
.maximum_ops_per_insn
;
2406 line_ptr
+= bytes_read
;
2408 case DW_LNS_advance_line
:
2409 line
+= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2411 line_ptr
+= bytes_read
;
2413 case DW_LNS_set_file
:
2417 /* The file and directory tables are 0
2418 based, the references are 1 based. */
2419 file
= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2421 line_ptr
+= bytes_read
;
2424 filename
= concat_filename (table
, file
);
2427 case DW_LNS_set_column
:
2428 column
= _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2430 line_ptr
+= bytes_read
;
2432 case DW_LNS_negate_stmt
:
2433 is_stmt
= (!is_stmt
);
2435 case DW_LNS_set_basic_block
:
2437 case DW_LNS_const_add_pc
:
2438 if (lh
.line_range
== 0)
2440 if (lh
.maximum_ops_per_insn
== 1)
2441 address
+= (lh
.minimum_instruction_length
2442 * ((255 - lh
.opcode_base
) / lh
.line_range
));
2445 bfd_vma adjust
= ((255 - lh
.opcode_base
) / lh
.line_range
);
2446 address
+= (lh
.minimum_instruction_length
2447 * ((op_index
+ adjust
)
2448 / lh
.maximum_ops_per_insn
));
2449 op_index
= (op_index
+ adjust
) % lh
.maximum_ops_per_insn
;
2452 case DW_LNS_fixed_advance_pc
:
2453 address
+= read_2_bytes (abfd
, line_ptr
, line_end
);
2458 /* Unknown standard opcode, ignore it. */
2459 for (i
= 0; i
< lh
.standard_opcode_lengths
[op_code
]; i
++)
2461 (void) _bfd_safe_read_leb128 (abfd
, line_ptr
, &bytes_read
,
2463 line_ptr
+= bytes_read
;
2473 if (sort_line_sequences (table
))
2477 while (table
->sequences
!= NULL
)
2479 struct line_sequence
* seq
= table
->sequences
;
2480 table
->sequences
= table
->sequences
->prev_sequence
;
2483 if (table
->files
!= NULL
)
2484 free (table
->files
);
2485 if (table
->dirs
!= NULL
)
2490 /* If ADDR is within TABLE set the output parameters and return the
2491 range of addresses covered by the entry used to fill them out.
2492 Otherwise set * FILENAME_PTR to NULL and return 0.
2493 The parameters FILENAME_PTR, LINENUMBER_PTR and DISCRIMINATOR_PTR
2494 are pointers to the objects to be filled in. */
2497 lookup_address_in_line_info_table (struct line_info_table
*table
,
2499 const char **filename_ptr
,
2500 unsigned int *linenumber_ptr
,
2501 unsigned int *discriminator_ptr
)
2503 struct line_sequence
*seq
= NULL
;
2504 struct line_info
*info
;
2507 /* Binary search the array of sequences. */
2509 high
= table
->num_sequences
;
2512 mid
= (low
+ high
) / 2;
2513 seq
= &table
->sequences
[mid
];
2514 if (addr
< seq
->low_pc
)
2516 else if (addr
>= seq
->last_line
->address
)
2522 /* Check for a valid sequence. */
2523 if (!seq
|| addr
< seq
->low_pc
|| addr
>= seq
->last_line
->address
)
2526 if (!build_line_info_table (table
, seq
))
2529 /* Binary search the array of line information. */
2531 high
= seq
->num_lines
;
2535 mid
= (low
+ high
) / 2;
2536 info
= seq
->line_info_lookup
[mid
];
2537 if (addr
< info
->address
)
2539 else if (addr
>= seq
->line_info_lookup
[mid
+ 1]->address
)
2545 /* Check for a valid line information entry. */
2547 && addr
>= info
->address
2548 && addr
< seq
->line_info_lookup
[mid
+ 1]->address
2549 && !(info
->end_sequence
|| info
== seq
->last_line
))
2551 *filename_ptr
= info
->filename
;
2552 *linenumber_ptr
= info
->line
;
2553 if (discriminator_ptr
)
2554 *discriminator_ptr
= info
->discriminator
;
2555 return seq
->last_line
->address
- seq
->low_pc
;
2559 *filename_ptr
= NULL
;
2563 /* Read in the .debug_ranges section for future reference. */
2566 read_debug_ranges (struct comp_unit
* unit
)
2568 struct dwarf2_debug
* stash
= unit
->stash
;
2570 return read_section (unit
->abfd
, &stash
->debug_sections
[debug_ranges
],
2572 &stash
->dwarf_ranges_buffer
,
2573 &stash
->dwarf_ranges_size
);
2576 /* Function table functions. */
2579 compare_lookup_funcinfos (const void * a
, const void * b
)
2581 const struct lookup_funcinfo
* lookup1
= a
;
2582 const struct lookup_funcinfo
* lookup2
= b
;
2584 if (lookup1
->low_addr
< lookup2
->low_addr
)
2586 if (lookup1
->low_addr
> lookup2
->low_addr
)
2588 if (lookup1
->high_addr
< lookup2
->high_addr
)
2590 if (lookup1
->high_addr
> lookup2
->high_addr
)
2597 build_lookup_funcinfo_table (struct comp_unit
* unit
)
2599 struct lookup_funcinfo
*lookup_funcinfo_table
= unit
->lookup_funcinfo_table
;
2600 unsigned int number_of_functions
= unit
->number_of_functions
;
2601 struct funcinfo
*each
;
2602 struct lookup_funcinfo
*entry
;
2604 struct arange
*range
;
2605 bfd_vma low_addr
, high_addr
;
2607 if (lookup_funcinfo_table
|| number_of_functions
== 0)
2610 /* Create the function info lookup table. */
2611 lookup_funcinfo_table
= (struct lookup_funcinfo
*)
2612 bfd_malloc (number_of_functions
* sizeof (struct lookup_funcinfo
));
2613 if (lookup_funcinfo_table
== NULL
)
2616 /* Populate the function info lookup table. */
2617 func_index
= number_of_functions
;
2618 for (each
= unit
->function_table
; each
; each
= each
->prev_func
)
2620 entry
= &lookup_funcinfo_table
[--func_index
];
2621 entry
->funcinfo
= each
;
2623 /* Calculate the lowest and highest address for this function entry. */
2624 low_addr
= entry
->funcinfo
->arange
.low
;
2625 high_addr
= entry
->funcinfo
->arange
.high
;
2627 for (range
= entry
->funcinfo
->arange
.next
; range
; range
= range
->next
)
2629 if (range
->low
< low_addr
)
2630 low_addr
= range
->low
;
2631 if (range
->high
> high_addr
)
2632 high_addr
= range
->high
;
2635 entry
->low_addr
= low_addr
;
2636 entry
->high_addr
= high_addr
;
2639 BFD_ASSERT (func_index
== 0);
2641 /* Sort the function by address. */
2642 qsort (lookup_funcinfo_table
,
2643 number_of_functions
,
2644 sizeof (struct lookup_funcinfo
),
2645 compare_lookup_funcinfos
);
2647 /* Calculate the high watermark for each function in the lookup table. */
2648 high_addr
= lookup_funcinfo_table
[0].high_addr
;
2649 for (func_index
= 1; func_index
< number_of_functions
; func_index
++)
2651 entry
= &lookup_funcinfo_table
[func_index
];
2652 if (entry
->high_addr
> high_addr
)
2653 high_addr
= entry
->high_addr
;
2655 entry
->high_addr
= high_addr
;
2658 unit
->lookup_funcinfo_table
= lookup_funcinfo_table
;
2662 /* If ADDR is within UNIT's function tables, set FUNCTION_PTR, and return
2663 TRUE. Note that we need to find the function that has the smallest range
2664 that contains ADDR, to handle inlined functions without depending upon
2665 them being ordered in TABLE by increasing range. */
2668 lookup_address_in_function_table (struct comp_unit
*unit
,
2670 struct funcinfo
**function_ptr
)
2672 unsigned int number_of_functions
= unit
->number_of_functions
;
2673 struct lookup_funcinfo
* lookup_funcinfo
= NULL
;
2674 struct funcinfo
* funcinfo
= NULL
;
2675 struct funcinfo
* best_fit
= NULL
;
2676 bfd_vma best_fit_len
= 0;
2677 bfd_size_type low
, high
, mid
, first
;
2678 struct arange
*arange
;
2680 if (number_of_functions
== 0)
2683 if (!build_lookup_funcinfo_table (unit
))
2686 if (unit
->lookup_funcinfo_table
[number_of_functions
- 1].high_addr
< addr
)
2689 /* Find the first function in the lookup table which may contain the
2690 specified address. */
2692 high
= number_of_functions
;
2696 mid
= (low
+ high
) / 2;
2697 lookup_funcinfo
= &unit
->lookup_funcinfo_table
[mid
];
2698 if (addr
< lookup_funcinfo
->low_addr
)
2700 else if (addr
>= lookup_funcinfo
->high_addr
)
2706 /* Find the 'best' match for the address. The prior algorithm defined the
2707 best match as the function with the smallest address range containing
2708 the specified address. This definition should probably be changed to the
2709 innermost inline routine containing the address, but right now we want
2710 to get the same results we did before. */
2711 while (first
< number_of_functions
)
2713 if (addr
< unit
->lookup_funcinfo_table
[first
].low_addr
)
2715 funcinfo
= unit
->lookup_funcinfo_table
[first
].funcinfo
;
2717 for (arange
= &funcinfo
->arange
; arange
; arange
= arange
->next
)
2719 if (addr
< arange
->low
|| addr
>= arange
->high
)
2723 || arange
->high
- arange
->low
< best_fit_len
2724 /* The following comparison is designed to return the same
2725 match as the previous algorithm for routines which have the
2726 same best fit length. */
2727 || (arange
->high
- arange
->low
== best_fit_len
2728 && funcinfo
> best_fit
))
2730 best_fit
= funcinfo
;
2731 best_fit_len
= arange
->high
- arange
->low
;
2741 *function_ptr
= best_fit
;
2745 /* If SYM at ADDR is within function table of UNIT, set FILENAME_PTR
2746 and LINENUMBER_PTR, and return TRUE. */
2749 lookup_symbol_in_function_table (struct comp_unit
*unit
,
2752 const char **filename_ptr
,
2753 unsigned int *linenumber_ptr
)
2755 struct funcinfo
* each_func
;
2756 struct funcinfo
* best_fit
= NULL
;
2757 bfd_vma best_fit_len
= 0;
2758 struct arange
*arange
;
2759 const char *name
= bfd_asymbol_name (sym
);
2760 asection
*sec
= bfd_get_section (sym
);
2762 for (each_func
= unit
->function_table
;
2764 each_func
= each_func
->prev_func
)
2766 for (arange
= &each_func
->arange
;
2768 arange
= arange
->next
)
2770 if ((!each_func
->sec
|| each_func
->sec
== sec
)
2771 && addr
>= arange
->low
2772 && addr
< arange
->high
2774 && strcmp (name
, each_func
->name
) == 0
2776 || arange
->high
- arange
->low
< best_fit_len
))
2778 best_fit
= each_func
;
2779 best_fit_len
= arange
->high
- arange
->low
;
2786 best_fit
->sec
= sec
;
2787 *filename_ptr
= best_fit
->file
;
2788 *linenumber_ptr
= best_fit
->line
;
2795 /* Variable table functions. */
2797 /* If SYM is within variable table of UNIT, set FILENAME_PTR and
2798 LINENUMBER_PTR, and return TRUE. */
2801 lookup_symbol_in_variable_table (struct comp_unit
*unit
,
2804 const char **filename_ptr
,
2805 unsigned int *linenumber_ptr
)
2807 const char *name
= bfd_asymbol_name (sym
);
2808 asection
*sec
= bfd_get_section (sym
);
2809 struct varinfo
* each
;
2811 for (each
= unit
->variable_table
; each
; each
= each
->prev_var
)
2812 if (each
->stack
== 0
2813 && each
->file
!= NULL
2814 && each
->name
!= NULL
2815 && each
->addr
== addr
2816 && (!each
->sec
|| each
->sec
== sec
)
2817 && strcmp (name
, each
->name
) == 0)
2823 *filename_ptr
= each
->file
;
2824 *linenumber_ptr
= each
->line
;
2832 find_abstract_instance_name (struct comp_unit
*unit
,
2833 bfd_byte
*orig_info_ptr
,
2834 struct attribute
*attr_ptr
,
2836 bfd_boolean
*is_linkage
)
2838 bfd
*abfd
= unit
->abfd
;
2840 bfd_byte
*info_ptr_end
;
2841 unsigned int abbrev_number
, bytes_read
, i
;
2842 struct abbrev_info
*abbrev
;
2843 bfd_uint64_t die_ref
= attr_ptr
->u
.val
;
2844 struct attribute attr
;
2845 const char *name
= NULL
;
2847 /* DW_FORM_ref_addr can reference an entry in a different CU. It
2848 is an offset from the .debug_info section, not the current CU. */
2849 if (attr_ptr
->form
== DW_FORM_ref_addr
)
2851 /* We only support DW_FORM_ref_addr within the same file, so
2852 any relocations should be resolved already. */
2856 (_("Dwarf Error: Abstract instance DIE ref zero."));
2857 bfd_set_error (bfd_error_bad_value
);
2861 info_ptr
= unit
->sec_info_ptr
+ die_ref
;
2862 info_ptr_end
= unit
->end_ptr
;
2864 /* Now find the CU containing this pointer. */
2865 if (info_ptr
>= unit
->info_ptr_unit
&& info_ptr
< unit
->end_ptr
)
2869 /* Check other CUs to see if they contain the abbrev. */
2870 struct comp_unit
* u
;
2872 for (u
= unit
->prev_unit
; u
!= NULL
; u
= u
->prev_unit
)
2873 if (info_ptr
>= u
->info_ptr_unit
&& info_ptr
< u
->end_ptr
)
2877 for (u
= unit
->next_unit
; u
!= NULL
; u
= u
->next_unit
)
2878 if (info_ptr
>= u
->info_ptr_unit
&& info_ptr
< u
->end_ptr
)
2883 /* else FIXME: What do we do now ? */
2886 else if (attr_ptr
->form
== DW_FORM_GNU_ref_alt
)
2888 info_ptr
= read_alt_indirect_ref (unit
, die_ref
);
2889 if (info_ptr
== NULL
)
2892 (_("Dwarf Error: Unable to read alt ref %llu."),
2893 (long long) die_ref
);
2894 bfd_set_error (bfd_error_bad_value
);
2897 info_ptr_end
= (unit
->stash
->alt_dwarf_info_buffer
2898 + unit
->stash
->alt_dwarf_info_size
);
2900 /* FIXME: Do we need to locate the correct CU, in a similar
2901 fashion to the code in the DW_FORM_ref_addr case above ? */
2905 info_ptr
= unit
->info_ptr_unit
+ die_ref
;
2906 info_ptr_end
= unit
->end_ptr
;
2909 abbrev_number
= _bfd_safe_read_leb128 (abfd
, info_ptr
, &bytes_read
,
2910 FALSE
, info_ptr_end
);
2911 info_ptr
+= bytes_read
;
2915 abbrev
= lookup_abbrev (abbrev_number
, unit
->abbrevs
);
2919 (_("Dwarf Error: Could not find abbrev number %u."), abbrev_number
);
2920 bfd_set_error (bfd_error_bad_value
);
2925 for (i
= 0; i
< abbrev
->num_attrs
; ++i
)
2927 info_ptr
= read_attribute (&attr
, &abbrev
->attrs
[i
], unit
,
2928 info_ptr
, info_ptr_end
);
2929 if (info_ptr
== NULL
)
2931 /* It doesn't ever make sense for DW_AT_specification to
2932 refer to the same DIE. Stop simple recursion. */
2933 if (info_ptr
== orig_info_ptr
)
2936 (_("Dwarf Error: Abstract instance recursion detected."));
2937 bfd_set_error (bfd_error_bad_value
);
2943 /* Prefer DW_AT_MIPS_linkage_name or DW_AT_linkage_name
2945 if (name
== NULL
&& is_str_attr (attr
.form
))
2948 if (non_mangled (unit
->lang
))
2952 case DW_AT_specification
:
2953 if (!find_abstract_instance_name (unit
, info_ptr
, &attr
,
2957 case DW_AT_linkage_name
:
2958 case DW_AT_MIPS_linkage_name
:
2959 /* PR 16949: Corrupt debug info can place
2960 non-string forms into these attributes. */
2961 if (is_str_attr (attr
.form
))
2978 read_rangelist (struct comp_unit
*unit
, struct arange
*arange
,
2979 bfd_uint64_t offset
)
2981 bfd_byte
*ranges_ptr
;
2982 bfd_byte
*ranges_end
;
2983 bfd_vma base_address
= unit
->base_address
;
2985 if (! unit
->stash
->dwarf_ranges_buffer
)
2987 if (! read_debug_ranges (unit
))
2991 ranges_ptr
= unit
->stash
->dwarf_ranges_buffer
+ offset
;
2992 if (ranges_ptr
< unit
->stash
->dwarf_ranges_buffer
)
2994 ranges_end
= unit
->stash
->dwarf_ranges_buffer
+ unit
->stash
->dwarf_ranges_size
;
3001 /* PR 17512: file: 62cada7d. */
3002 if (ranges_ptr
+ 2 * unit
->addr_size
> ranges_end
)
3005 low_pc
= read_address (unit
, ranges_ptr
, ranges_end
);
3006 ranges_ptr
+= unit
->addr_size
;
3007 high_pc
= read_address (unit
, ranges_ptr
, ranges_end
);
3008 ranges_ptr
+= unit
->addr_size
;
3010 if (low_pc
== 0 && high_pc
== 0)
3012 if (low_pc
== -1UL && high_pc
!= -1UL)
3013 base_address
= high_pc
;
3016 if (!arange_add (unit
, arange
,
3017 base_address
+ low_pc
, base_address
+ high_pc
))
3024 /* DWARF2 Compilation unit functions. */
3026 /* Scan over each die in a comp. unit looking for functions to add
3027 to the function table and variables to the variable table. */
3030 scan_unit_for_symbols (struct comp_unit
*unit
)
3032 bfd
*abfd
= unit
->abfd
;
3033 bfd_byte
*info_ptr
= unit
->first_child_die_ptr
;
3034 bfd_byte
*info_ptr_end
= unit
->stash
->info_ptr_end
;
3035 int nesting_level
= 0;
3036 struct nest_funcinfo
{
3037 struct funcinfo
*func
;
3039 int nested_funcs_size
;
3041 /* Maintain a stack of in-scope functions and inlined functions, which we
3042 can use to set the caller_func field. */
3043 nested_funcs_size
= 32;
3044 nested_funcs
= (struct nest_funcinfo
*)
3045 bfd_malloc (nested_funcs_size
* sizeof (*nested_funcs
));
3046 if (nested_funcs
== NULL
)
3048 nested_funcs
[nesting_level
].func
= 0;
3050 while (nesting_level
>= 0)
3052 unsigned int abbrev_number
, bytes_read
, i
;
3053 struct abbrev_info
*abbrev
;
3054 struct attribute attr
;
3055 struct funcinfo
*func
;
3056 struct varinfo
*var
;
3058 bfd_vma high_pc
= 0;
3059 bfd_boolean high_pc_relative
= FALSE
;
3061 /* PR 17512: file: 9f405d9d. */
3062 if (info_ptr
>= info_ptr_end
)
3065 abbrev_number
= _bfd_safe_read_leb128 (abfd
, info_ptr
, &bytes_read
,
3066 FALSE
, info_ptr_end
);
3067 info_ptr
+= bytes_read
;
3069 if (! abbrev_number
)
3075 abbrev
= lookup_abbrev (abbrev_number
, unit
->abbrevs
);
3078 static unsigned int previous_failed_abbrev
= -1U;
3080 /* Avoid multiple reports of the same missing abbrev. */
3081 if (abbrev_number
!= previous_failed_abbrev
)
3084 (_("Dwarf Error: Could not find abbrev number %u."),
3086 previous_failed_abbrev
= abbrev_number
;
3088 bfd_set_error (bfd_error_bad_value
);
3093 if (abbrev
->tag
== DW_TAG_subprogram
3094 || abbrev
->tag
== DW_TAG_entry_point
3095 || abbrev
->tag
== DW_TAG_inlined_subroutine
)
3097 bfd_size_type amt
= sizeof (struct funcinfo
);
3098 func
= (struct funcinfo
*) bfd_zalloc (abfd
, amt
);
3101 func
->tag
= abbrev
->tag
;
3102 func
->prev_func
= unit
->function_table
;
3103 unit
->function_table
= func
;
3104 unit
->number_of_functions
++;
3105 BFD_ASSERT (!unit
->cached
);
3107 if (func
->tag
== DW_TAG_inlined_subroutine
)
3108 for (i
= nesting_level
; i
-- != 0; )
3109 if (nested_funcs
[i
].func
)
3111 func
->caller_func
= nested_funcs
[i
].func
;
3114 nested_funcs
[nesting_level
].func
= func
;
3119 if (abbrev
->tag
== DW_TAG_variable
)
3121 bfd_size_type amt
= sizeof (struct varinfo
);
3122 var
= (struct varinfo
*) bfd_zalloc (abfd
, amt
);
3125 var
->tag
= abbrev
->tag
;
3127 var
->prev_var
= unit
->variable_table
;
3128 unit
->variable_table
= var
;
3129 /* PR 18205: Missing debug information can cause this
3130 var to be attached to an already cached unit. */
3133 /* No inline function in scope at this nesting level. */
3134 nested_funcs
[nesting_level
].func
= 0;
3137 for (i
= 0; i
< abbrev
->num_attrs
; ++i
)
3139 info_ptr
= read_attribute (&attr
, &abbrev
->attrs
[i
],
3140 unit
, info_ptr
, info_ptr_end
);
3141 if (info_ptr
== NULL
)
3148 case DW_AT_call_file
:
3149 func
->caller_file
= concat_filename (unit
->line_table
,
3153 case DW_AT_call_line
:
3154 func
->caller_line
= attr
.u
.val
;
3157 case DW_AT_abstract_origin
:
3158 case DW_AT_specification
:
3159 if (!find_abstract_instance_name (unit
, info_ptr
, &attr
,
3166 /* Prefer DW_AT_MIPS_linkage_name or DW_AT_linkage_name
3168 if (func
->name
== NULL
&& is_str_attr (attr
.form
))
3170 func
->name
= attr
.u
.str
;
3171 if (non_mangled (unit
->lang
))
3172 func
->is_linkage
= TRUE
;
3176 case DW_AT_linkage_name
:
3177 case DW_AT_MIPS_linkage_name
:
3178 /* PR 16949: Corrupt debug info can place
3179 non-string forms into these attributes. */
3180 if (is_str_attr (attr
.form
))
3182 func
->name
= attr
.u
.str
;
3183 func
->is_linkage
= TRUE
;
3188 low_pc
= attr
.u
.val
;
3192 high_pc
= attr
.u
.val
;
3193 high_pc_relative
= attr
.form
!= DW_FORM_addr
;
3197 if (!read_rangelist (unit
, &func
->arange
, attr
.u
.val
))
3201 case DW_AT_decl_file
:
3202 func
->file
= concat_filename (unit
->line_table
,
3206 case DW_AT_decl_line
:
3207 func
->line
= attr
.u
.val
;
3219 if (is_str_attr (attr
.form
))
3220 var
->name
= attr
.u
.str
;
3223 case DW_AT_decl_file
:
3224 var
->file
= concat_filename (unit
->line_table
,
3228 case DW_AT_decl_line
:
3229 var
->line
= attr
.u
.val
;
3232 case DW_AT_external
:
3233 if (attr
.u
.val
!= 0)
3237 case DW_AT_location
:
3241 case DW_FORM_block1
:
3242 case DW_FORM_block2
:
3243 case DW_FORM_block4
:
3244 case DW_FORM_exprloc
:
3245 if (attr
.u
.blk
->data
!= NULL
3246 && *attr
.u
.blk
->data
== DW_OP_addr
)
3250 /* Verify that DW_OP_addr is the only opcode in the
3251 location, in which case the block size will be 1
3252 plus the address size. */
3253 /* ??? For TLS variables, gcc can emit
3254 DW_OP_addr <addr> DW_OP_GNU_push_tls_address
3255 which we don't handle here yet. */
3256 if (attr
.u
.blk
->size
== unit
->addr_size
+ 1U)
3257 var
->addr
= bfd_get (unit
->addr_size
* 8,
3259 attr
.u
.blk
->data
+ 1);
3274 if (high_pc_relative
)
3277 if (func
&& high_pc
!= 0)
3279 if (!arange_add (unit
, &func
->arange
, low_pc
, high_pc
))
3283 if (abbrev
->has_children
)
3287 if (nesting_level
>= nested_funcs_size
)
3289 struct nest_funcinfo
*tmp
;
3291 nested_funcs_size
*= 2;
3292 tmp
= (struct nest_funcinfo
*)
3293 bfd_realloc (nested_funcs
,
3294 nested_funcs_size
* sizeof (*nested_funcs
));
3299 nested_funcs
[nesting_level
].func
= 0;
3303 free (nested_funcs
);
3307 free (nested_funcs
);
3311 /* Parse a DWARF2 compilation unit starting at INFO_PTR. This
3312 includes the compilation unit header that proceeds the DIE's, but
3313 does not include the length field that precedes each compilation
3314 unit header. END_PTR points one past the end of this comp unit.
3315 OFFSET_SIZE is the size of DWARF2 offsets (either 4 or 8 bytes).
3317 This routine does not read the whole compilation unit; only enough
3318 to get to the line number information for the compilation unit. */
3320 static struct comp_unit
*
3321 parse_comp_unit (struct dwarf2_debug
*stash
,
3322 bfd_vma unit_length
,
3323 bfd_byte
*info_ptr_unit
,
3324 unsigned int offset_size
)
3326 struct comp_unit
* unit
;
3327 unsigned int version
;
3328 bfd_uint64_t abbrev_offset
= 0;
3329 /* Initialize it just to avoid a GCC false warning. */
3330 unsigned int addr_size
= -1;
3331 struct abbrev_info
** abbrevs
;
3332 unsigned int abbrev_number
, bytes_read
, i
;
3333 struct abbrev_info
*abbrev
;
3334 struct attribute attr
;
3335 bfd_byte
*info_ptr
= stash
->info_ptr
;
3336 bfd_byte
*end_ptr
= info_ptr
+ unit_length
;
3339 bfd_vma high_pc
= 0;
3340 bfd
*abfd
= stash
->bfd_ptr
;
3341 bfd_boolean high_pc_relative
= FALSE
;
3342 enum dwarf_unit_type unit_type
;
3344 version
= read_2_bytes (abfd
, info_ptr
, end_ptr
);
3346 if (version
< 2 || version
> 5)
3348 /* PR 19872: A version number of 0 probably means that there is padding
3349 at the end of the .debug_info section. Gold puts it there when
3350 performing an incremental link, for example. So do not generate
3351 an error, just return a NULL. */
3355 (_("Dwarf Error: found dwarf version '%u', this reader"
3356 " only handles version 2, 3, 4 and 5 information."), version
);
3357 bfd_set_error (bfd_error_bad_value
);
3363 unit_type
= DW_UT_compile
;
3366 unit_type
= read_1_byte (abfd
, info_ptr
, end_ptr
);
3369 addr_size
= read_1_byte (abfd
, info_ptr
, end_ptr
);
3373 BFD_ASSERT (offset_size
== 4 || offset_size
== 8);
3374 if (offset_size
== 4)
3375 abbrev_offset
= read_4_bytes (abfd
, info_ptr
, end_ptr
);
3377 abbrev_offset
= read_8_bytes (abfd
, info_ptr
, end_ptr
);
3378 info_ptr
+= offset_size
;
3382 addr_size
= read_1_byte (abfd
, info_ptr
, end_ptr
);
3386 if (unit_type
== DW_UT_type
)
3388 /* Skip type signature. */
3391 /* Skip type offset. */
3392 info_ptr
+= offset_size
;
3395 if (addr_size
> sizeof (bfd_vma
))
3398 /* xgettext: c-format */
3399 (_("Dwarf Error: found address size '%u', this reader"
3400 " can not handle sizes greater than '%u'."),
3402 (unsigned int) sizeof (bfd_vma
));
3403 bfd_set_error (bfd_error_bad_value
);
3407 if (addr_size
!= 2 && addr_size
!= 4 && addr_size
!= 8)
3410 ("Dwarf Error: found address size '%u', this reader"
3411 " can only handle address sizes '2', '4' and '8'.", addr_size
);
3412 bfd_set_error (bfd_error_bad_value
);
3416 /* Read the abbrevs for this compilation unit into a table. */
3417 abbrevs
= read_abbrevs (abfd
, abbrev_offset
, stash
);
3421 abbrev_number
= _bfd_safe_read_leb128 (abfd
, info_ptr
, &bytes_read
,
3423 info_ptr
+= bytes_read
;
3424 if (! abbrev_number
)
3426 /* PR 19872: An abbrev number of 0 probably means that there is padding
3427 at the end of the .debug_abbrev section. Gold puts it there when
3428 performing an incremental link, for example. So do not generate
3429 an error, just return a NULL. */
3433 abbrev
= lookup_abbrev (abbrev_number
, abbrevs
);
3436 _bfd_error_handler (_("Dwarf Error: Could not find abbrev number %u."),
3438 bfd_set_error (bfd_error_bad_value
);
3442 amt
= sizeof (struct comp_unit
);
3443 unit
= (struct comp_unit
*) bfd_zalloc (abfd
, amt
);
3447 unit
->version
= version
;
3448 unit
->addr_size
= addr_size
;
3449 unit
->offset_size
= offset_size
;
3450 unit
->abbrevs
= abbrevs
;
3451 unit
->end_ptr
= end_ptr
;
3452 unit
->stash
= stash
;
3453 unit
->info_ptr_unit
= info_ptr_unit
;
3454 unit
->sec_info_ptr
= stash
->sec_info_ptr
;
3456 for (i
= 0; i
< abbrev
->num_attrs
; ++i
)
3458 info_ptr
= read_attribute (&attr
, &abbrev
->attrs
[i
], unit
, info_ptr
, end_ptr
);
3459 if (info_ptr
== NULL
)
3462 /* Store the data if it is of an attribute we want to keep in a
3463 partial symbol table. */
3466 case DW_AT_stmt_list
:
3468 unit
->line_offset
= attr
.u
.val
;
3472 if (is_str_attr (attr
.form
))
3473 unit
->name
= attr
.u
.str
;
3477 low_pc
= attr
.u
.val
;
3478 /* If the compilation unit DIE has a DW_AT_low_pc attribute,
3479 this is the base address to use when reading location
3480 lists or range lists. */
3481 if (abbrev
->tag
== DW_TAG_compile_unit
)
3482 unit
->base_address
= low_pc
;
3486 high_pc
= attr
.u
.val
;
3487 high_pc_relative
= attr
.form
!= DW_FORM_addr
;
3491 if (!read_rangelist (unit
, &unit
->arange
, attr
.u
.val
))
3495 case DW_AT_comp_dir
:
3497 char *comp_dir
= attr
.u
.str
;
3499 /* PR 17512: file: 1fe726be. */
3500 if (! is_str_attr (attr
.form
))
3503 (_("Dwarf Error: DW_AT_comp_dir attribute encountered with a non-string form."));
3509 /* Irix 6.2 native cc prepends <machine>.: to the compilation
3510 directory, get rid of it. */
3511 char *cp
= strchr (comp_dir
, ':');
3513 if (cp
&& cp
!= comp_dir
&& cp
[-1] == '.' && cp
[1] == '/')
3516 unit
->comp_dir
= comp_dir
;
3520 case DW_AT_language
:
3521 unit
->lang
= attr
.u
.val
;
3528 if (high_pc_relative
)
3532 if (!arange_add (unit
, &unit
->arange
, low_pc
, high_pc
))
3536 unit
->first_child_die_ptr
= info_ptr
;
3540 /* Return TRUE if UNIT may contain the address given by ADDR. When
3541 there are functions written entirely with inline asm statements, the
3542 range info in the compilation unit header may not be correct. We
3543 need to consult the line info table to see if a compilation unit
3544 really contains the given address. */
3547 comp_unit_contains_address (struct comp_unit
*unit
, bfd_vma addr
)
3549 struct arange
*arange
;
3554 arange
= &unit
->arange
;
3557 if (addr
>= arange
->low
&& addr
< arange
->high
)
3559 arange
= arange
->next
;
3566 /* If UNIT contains ADDR, set the output parameters to the values for
3567 the line containing ADDR. The output parameters, FILENAME_PTR,
3568 FUNCTION_PTR, and LINENUMBER_PTR, are pointers to the objects
3571 Returns the range of addresses covered by the entry that was used
3572 to fill in *LINENUMBER_PTR or 0 if it was not filled in. */
3575 comp_unit_find_nearest_line (struct comp_unit
*unit
,
3577 const char **filename_ptr
,
3578 struct funcinfo
**function_ptr
,
3579 unsigned int *linenumber_ptr
,
3580 unsigned int *discriminator_ptr
,
3581 struct dwarf2_debug
*stash
)
3588 if (! unit
->line_table
)
3590 if (! unit
->stmtlist
)
3596 unit
->line_table
= decode_line_info (unit
, stash
);
3598 if (! unit
->line_table
)
3604 if (unit
->first_child_die_ptr
< unit
->end_ptr
3605 && ! scan_unit_for_symbols (unit
))
3612 *function_ptr
= NULL
;
3613 func_p
= lookup_address_in_function_table (unit
, addr
, function_ptr
);
3614 if (func_p
&& (*function_ptr
)->tag
== DW_TAG_inlined_subroutine
)
3615 stash
->inliner_chain
= *function_ptr
;
3617 return lookup_address_in_line_info_table (unit
->line_table
, addr
,
3623 /* Check to see if line info is already decoded in a comp_unit.
3624 If not, decode it. Returns TRUE if no errors were encountered;
3628 comp_unit_maybe_decode_line_info (struct comp_unit
*unit
,
3629 struct dwarf2_debug
*stash
)
3634 if (! unit
->line_table
)
3636 if (! unit
->stmtlist
)
3642 unit
->line_table
= decode_line_info (unit
, stash
);
3644 if (! unit
->line_table
)
3650 if (unit
->first_child_die_ptr
< unit
->end_ptr
3651 && ! scan_unit_for_symbols (unit
))
3661 /* If UNIT contains SYM at ADDR, set the output parameters to the
3662 values for the line containing SYM. The output parameters,
3663 FILENAME_PTR, and LINENUMBER_PTR, are pointers to the objects to be
3666 Return TRUE if UNIT contains SYM, and no errors were encountered;
3670 comp_unit_find_line (struct comp_unit
*unit
,
3673 const char **filename_ptr
,
3674 unsigned int *linenumber_ptr
,
3675 struct dwarf2_debug
*stash
)
3677 if (!comp_unit_maybe_decode_line_info (unit
, stash
))
3680 if (sym
->flags
& BSF_FUNCTION
)
3681 return lookup_symbol_in_function_table (unit
, sym
, addr
,
3685 return lookup_symbol_in_variable_table (unit
, sym
, addr
,
3690 static struct funcinfo
*
3691 reverse_funcinfo_list (struct funcinfo
*head
)
3693 struct funcinfo
*rhead
;
3694 struct funcinfo
*temp
;
3696 for (rhead
= NULL
; head
; head
= temp
)
3698 temp
= head
->prev_func
;
3699 head
->prev_func
= rhead
;
3705 static struct varinfo
*
3706 reverse_varinfo_list (struct varinfo
*head
)
3708 struct varinfo
*rhead
;
3709 struct varinfo
*temp
;
3711 for (rhead
= NULL
; head
; head
= temp
)
3713 temp
= head
->prev_var
;
3714 head
->prev_var
= rhead
;
3720 /* Extract all interesting funcinfos and varinfos of a compilation
3721 unit into hash tables for faster lookup. Returns TRUE if no
3722 errors were enountered; FALSE otherwise. */
3725 comp_unit_hash_info (struct dwarf2_debug
*stash
,
3726 struct comp_unit
*unit
,
3727 struct info_hash_table
*funcinfo_hash_table
,
3728 struct info_hash_table
*varinfo_hash_table
)
3730 struct funcinfo
* each_func
;
3731 struct varinfo
* each_var
;
3732 bfd_boolean okay
= TRUE
;
3734 BFD_ASSERT (stash
->info_hash_status
!= STASH_INFO_HASH_DISABLED
);
3736 if (!comp_unit_maybe_decode_line_info (unit
, stash
))
3739 BFD_ASSERT (!unit
->cached
);
3741 /* To preserve the original search order, we went to visit the function
3742 infos in the reversed order of the list. However, making the list
3743 bi-directional use quite a bit of extra memory. So we reverse
3744 the list first, traverse the list in the now reversed order and
3745 finally reverse the list again to get back the original order. */
3746 unit
->function_table
= reverse_funcinfo_list (unit
->function_table
);
3747 for (each_func
= unit
->function_table
;
3749 each_func
= each_func
->prev_func
)
3751 /* Skip nameless functions. */
3752 if (each_func
->name
)
3753 /* There is no need to copy name string into hash table as
3754 name string is either in the dwarf string buffer or
3755 info in the stash. */
3756 okay
= insert_info_hash_table (funcinfo_hash_table
, each_func
->name
,
3757 (void*) each_func
, FALSE
);
3759 unit
->function_table
= reverse_funcinfo_list (unit
->function_table
);
3763 /* We do the same for variable infos. */
3764 unit
->variable_table
= reverse_varinfo_list (unit
->variable_table
);
3765 for (each_var
= unit
->variable_table
;
3767 each_var
= each_var
->prev_var
)
3769 /* Skip stack vars and vars with no files or names. */
3770 if (each_var
->stack
== 0
3771 && each_var
->file
!= NULL
3772 && each_var
->name
!= NULL
)
3773 /* There is no need to copy name string into hash table as
3774 name string is either in the dwarf string buffer or
3775 info in the stash. */
3776 okay
= insert_info_hash_table (varinfo_hash_table
, each_var
->name
,
3777 (void*) each_var
, FALSE
);
3780 unit
->variable_table
= reverse_varinfo_list (unit
->variable_table
);
3781 unit
->cached
= TRUE
;
3785 /* Locate a section in a BFD containing debugging info. The search starts
3786 from the section after AFTER_SEC, or from the first section in the BFD if
3787 AFTER_SEC is NULL. The search works by examining the names of the
3788 sections. There are three permissiable names. The first two are given
3789 by DEBUG_SECTIONS[debug_info] (whose standard DWARF2 names are .debug_info
3790 and .zdebug_info). The third is a prefix .gnu.linkonce.wi.
3791 This is a variation on the .debug_info section which has a checksum
3792 describing the contents appended onto the name. This allows the linker to
3793 identify and discard duplicate debugging sections for different
3794 compilation units. */
3795 #define GNU_LINKONCE_INFO ".gnu.linkonce.wi."
3798 find_debug_info (bfd
*abfd
, const struct dwarf_debug_section
*debug_sections
,
3799 asection
*after_sec
)
3804 if (after_sec
== NULL
)
3806 look
= debug_sections
[debug_info
].uncompressed_name
;
3807 msec
= bfd_get_section_by_name (abfd
, look
);
3811 look
= debug_sections
[debug_info
].compressed_name
;
3814 msec
= bfd_get_section_by_name (abfd
, look
);
3819 for (msec
= abfd
->sections
; msec
!= NULL
; msec
= msec
->next
)
3820 if (CONST_STRNEQ (msec
->name
, GNU_LINKONCE_INFO
))
3826 for (msec
= after_sec
->next
; msec
!= NULL
; msec
= msec
->next
)
3828 look
= debug_sections
[debug_info
].uncompressed_name
;
3829 if (strcmp (msec
->name
, look
) == 0)
3832 look
= debug_sections
[debug_info
].compressed_name
;
3833 if (look
!= NULL
&& strcmp (msec
->name
, look
) == 0)
3836 if (CONST_STRNEQ (msec
->name
, GNU_LINKONCE_INFO
))
3843 /* Transfer VMAs from object file to separate debug file. */
3846 set_debug_vma (bfd
*orig_bfd
, bfd
*debug_bfd
)
3850 for (s
= orig_bfd
->sections
, d
= debug_bfd
->sections
;
3851 s
!= NULL
&& d
!= NULL
;
3852 s
= s
->next
, d
= d
->next
)
3854 if ((d
->flags
& SEC_DEBUGGING
) != 0)
3856 /* ??? Assumes 1-1 correspondence between sections in the
3858 if (strcmp (s
->name
, d
->name
) == 0)
3860 d
->output_section
= s
->output_section
;
3861 d
->output_offset
= s
->output_offset
;
3867 /* Unset vmas for adjusted sections in STASH. */
3870 unset_sections (struct dwarf2_debug
*stash
)
3873 struct adjusted_section
*p
;
3875 i
= stash
->adjusted_section_count
;
3876 p
= stash
->adjusted_sections
;
3877 for (; i
> 0; i
--, p
++)
3878 p
->section
->vma
= 0;
3881 /* Set VMAs for allocated and .debug_info sections in ORIG_BFD, a
3882 relocatable object file. VMAs are normally all zero in relocatable
3883 object files, so if we want to distinguish locations in sections by
3884 address we need to set VMAs so the sections do not overlap. We
3885 also set VMA on .debug_info so that when we have multiple
3886 .debug_info sections (or the linkonce variant) they also do not
3887 overlap. The multiple .debug_info sections make up a single
3888 logical section. ??? We should probably do the same for other
3892 place_sections (bfd
*orig_bfd
, struct dwarf2_debug
*stash
)
3895 struct adjusted_section
*p
;
3897 const char *debug_info_name
;
3899 if (stash
->adjusted_section_count
!= 0)
3901 i
= stash
->adjusted_section_count
;
3902 p
= stash
->adjusted_sections
;
3903 for (; i
> 0; i
--, p
++)
3904 p
->section
->vma
= p
->adj_vma
;
3908 debug_info_name
= stash
->debug_sections
[debug_info
].uncompressed_name
;
3915 for (sect
= abfd
->sections
; sect
!= NULL
; sect
= sect
->next
)
3919 if ((sect
->output_section
!= NULL
3920 && sect
->output_section
!= sect
3921 && (sect
->flags
& SEC_DEBUGGING
) == 0)
3925 is_debug_info
= (strcmp (sect
->name
, debug_info_name
) == 0
3926 || CONST_STRNEQ (sect
->name
, GNU_LINKONCE_INFO
));
3928 if (!((sect
->flags
& SEC_ALLOC
) != 0 && abfd
== orig_bfd
)
3934 if (abfd
== stash
->bfd_ptr
)
3936 abfd
= stash
->bfd_ptr
;
3940 stash
->adjusted_section_count
= -1;
3943 bfd_vma last_vma
= 0, last_dwarf
= 0;
3944 bfd_size_type amt
= i
* sizeof (struct adjusted_section
);
3946 p
= (struct adjusted_section
*) bfd_malloc (amt
);
3950 stash
->adjusted_sections
= p
;
3951 stash
->adjusted_section_count
= i
;
3958 for (sect
= abfd
->sections
; sect
!= NULL
; sect
= sect
->next
)
3963 if ((sect
->output_section
!= NULL
3964 && sect
->output_section
!= sect
3965 && (sect
->flags
& SEC_DEBUGGING
) == 0)
3969 is_debug_info
= (strcmp (sect
->name
, debug_info_name
) == 0
3970 || CONST_STRNEQ (sect
->name
, GNU_LINKONCE_INFO
));
3972 if (!((sect
->flags
& SEC_ALLOC
) != 0 && abfd
== orig_bfd
)
3976 sz
= sect
->rawsize
? sect
->rawsize
: sect
->size
;
3980 BFD_ASSERT (sect
->alignment_power
== 0);
3981 sect
->vma
= last_dwarf
;
3986 /* Align the new address to the current section
3988 last_vma
= ((last_vma
3989 + ~(-((bfd_vma
) 1 << sect
->alignment_power
)))
3990 & (-((bfd_vma
) 1 << sect
->alignment_power
)));
3991 sect
->vma
= last_vma
;
3996 p
->adj_vma
= sect
->vma
;
3999 if (abfd
== stash
->bfd_ptr
)
4001 abfd
= stash
->bfd_ptr
;
4005 if (orig_bfd
!= stash
->bfd_ptr
)
4006 set_debug_vma (orig_bfd
, stash
->bfd_ptr
);
4011 /* Look up a funcinfo by name using the given info hash table. If found,
4012 also update the locations pointed to by filename_ptr and linenumber_ptr.
4014 This function returns TRUE if a funcinfo that matches the given symbol
4015 and address is found with any error; otherwise it returns FALSE. */
4018 info_hash_lookup_funcinfo (struct info_hash_table
*hash_table
,
4021 const char **filename_ptr
,
4022 unsigned int *linenumber_ptr
)
4024 struct funcinfo
* each_func
;
4025 struct funcinfo
* best_fit
= NULL
;
4026 bfd_vma best_fit_len
= 0;
4027 struct info_list_node
*node
;
4028 struct arange
*arange
;
4029 const char *name
= bfd_asymbol_name (sym
);
4030 asection
*sec
= bfd_get_section (sym
);
4032 for (node
= lookup_info_hash_table (hash_table
, name
);
4036 each_func
= (struct funcinfo
*) node
->info
;
4037 for (arange
= &each_func
->arange
;
4039 arange
= arange
->next
)
4041 if ((!each_func
->sec
|| each_func
->sec
== sec
)
4042 && addr
>= arange
->low
4043 && addr
< arange
->high
4045 || arange
->high
- arange
->low
< best_fit_len
))
4047 best_fit
= each_func
;
4048 best_fit_len
= arange
->high
- arange
->low
;
4055 best_fit
->sec
= sec
;
4056 *filename_ptr
= best_fit
->file
;
4057 *linenumber_ptr
= best_fit
->line
;
4064 /* Look up a varinfo by name using the given info hash table. If found,
4065 also update the locations pointed to by filename_ptr and linenumber_ptr.
4067 This function returns TRUE if a varinfo that matches the given symbol
4068 and address is found with any error; otherwise it returns FALSE. */
4071 info_hash_lookup_varinfo (struct info_hash_table
*hash_table
,
4074 const char **filename_ptr
,
4075 unsigned int *linenumber_ptr
)
4077 const char *name
= bfd_asymbol_name (sym
);
4078 asection
*sec
= bfd_get_section (sym
);
4079 struct varinfo
* each
;
4080 struct info_list_node
*node
;
4082 for (node
= lookup_info_hash_table (hash_table
, name
);
4086 each
= (struct varinfo
*) node
->info
;
4087 if (each
->addr
== addr
4088 && (!each
->sec
|| each
->sec
== sec
))
4091 *filename_ptr
= each
->file
;
4092 *linenumber_ptr
= each
->line
;
4100 /* Update the funcinfo and varinfo info hash tables if they are
4101 not up to date. Returns TRUE if there is no error; otherwise
4102 returns FALSE and disable the info hash tables. */
4105 stash_maybe_update_info_hash_tables (struct dwarf2_debug
*stash
)
4107 struct comp_unit
*each
;
4109 /* Exit if hash tables are up-to-date. */
4110 if (stash
->all_comp_units
== stash
->hash_units_head
)
4113 if (stash
->hash_units_head
)
4114 each
= stash
->hash_units_head
->prev_unit
;
4116 each
= stash
->last_comp_unit
;
4120 if (!comp_unit_hash_info (stash
, each
, stash
->funcinfo_hash_table
,
4121 stash
->varinfo_hash_table
))
4123 stash
->info_hash_status
= STASH_INFO_HASH_DISABLED
;
4126 each
= each
->prev_unit
;
4129 stash
->hash_units_head
= stash
->all_comp_units
;
4133 /* Check consistency of info hash tables. This is for debugging only. */
4135 static void ATTRIBUTE_UNUSED
4136 stash_verify_info_hash_table (struct dwarf2_debug
*stash
)
4138 struct comp_unit
*each_unit
;
4139 struct funcinfo
*each_func
;
4140 struct varinfo
*each_var
;
4141 struct info_list_node
*node
;
4144 for (each_unit
= stash
->all_comp_units
;
4146 each_unit
= each_unit
->next_unit
)
4148 for (each_func
= each_unit
->function_table
;
4150 each_func
= each_func
->prev_func
)
4152 if (!each_func
->name
)
4154 node
= lookup_info_hash_table (stash
->funcinfo_hash_table
,
4158 while (node
&& !found
)
4160 found
= node
->info
== each_func
;
4166 for (each_var
= each_unit
->variable_table
;
4168 each_var
= each_var
->prev_var
)
4170 if (!each_var
->name
|| !each_var
->file
|| each_var
->stack
)
4172 node
= lookup_info_hash_table (stash
->varinfo_hash_table
,
4176 while (node
&& !found
)
4178 found
= node
->info
== each_var
;
4186 /* Check to see if we want to enable the info hash tables, which consume
4187 quite a bit of memory. Currently we only check the number times
4188 bfd_dwarf2_find_line is called. In the future, we may also want to
4189 take the number of symbols into account. */
4192 stash_maybe_enable_info_hash_tables (bfd
*abfd
, struct dwarf2_debug
*stash
)
4194 BFD_ASSERT (stash
->info_hash_status
== STASH_INFO_HASH_OFF
);
4196 if (stash
->info_hash_count
++ < STASH_INFO_HASH_TRIGGER
)
4199 /* FIXME: Maybe we should check the reduce_memory_overheads
4200 and optimize fields in the bfd_link_info structure ? */
4202 /* Create hash tables. */
4203 stash
->funcinfo_hash_table
= create_info_hash_table (abfd
);
4204 stash
->varinfo_hash_table
= create_info_hash_table (abfd
);
4205 if (!stash
->funcinfo_hash_table
|| !stash
->varinfo_hash_table
)
4207 /* Turn off info hashes if any allocation above fails. */
4208 stash
->info_hash_status
= STASH_INFO_HASH_DISABLED
;
4211 /* We need a forced update so that the info hash tables will
4212 be created even though there is no compilation unit. That
4213 happens if STASH_INFO_HASH_TRIGGER is 0. */
4214 stash_maybe_update_info_hash_tables (stash
);
4215 stash
->info_hash_status
= STASH_INFO_HASH_ON
;
4218 /* Find the file and line associated with a symbol and address using the
4219 info hash tables of a stash. If there is a match, the function returns
4220 TRUE and update the locations pointed to by filename_ptr and linenumber_ptr;
4221 otherwise it returns FALSE. */
4224 stash_find_line_fast (struct dwarf2_debug
*stash
,
4227 const char **filename_ptr
,
4228 unsigned int *linenumber_ptr
)
4230 BFD_ASSERT (stash
->info_hash_status
== STASH_INFO_HASH_ON
);
4232 if (sym
->flags
& BSF_FUNCTION
)
4233 return info_hash_lookup_funcinfo (stash
->funcinfo_hash_table
, sym
, addr
,
4234 filename_ptr
, linenumber_ptr
);
4235 return info_hash_lookup_varinfo (stash
->varinfo_hash_table
, sym
, addr
,
4236 filename_ptr
, linenumber_ptr
);
4239 /* Save current section VMAs. */
4242 save_section_vma (const bfd
*abfd
, struct dwarf2_debug
*stash
)
4247 if (abfd
->section_count
== 0)
4249 stash
->sec_vma
= bfd_malloc (sizeof (*stash
->sec_vma
) * abfd
->section_count
);
4250 if (stash
->sec_vma
== NULL
)
4252 for (i
= 0, s
= abfd
->sections
; i
< abfd
->section_count
; i
++, s
= s
->next
)
4254 if (s
->output_section
!= NULL
)
4255 stash
->sec_vma
[i
] = s
->output_section
->vma
+ s
->output_offset
;
4257 stash
->sec_vma
[i
] = s
->vma
;
4262 /* Compare current section VMAs against those at the time the stash
4263 was created. If find_nearest_line is used in linker warnings or
4264 errors early in the link process, the debug info stash will be
4265 invalid for later calls. This is because we relocate debug info
4266 sections, so the stashed section contents depend on symbol values,
4267 which in turn depend on section VMAs. */
4270 section_vma_same (const bfd
*abfd
, const struct dwarf2_debug
*stash
)
4275 for (i
= 0, s
= abfd
->sections
; i
< abfd
->section_count
; i
++, s
= s
->next
)
4279 if (s
->output_section
!= NULL
)
4280 vma
= s
->output_section
->vma
+ s
->output_offset
;
4283 if (vma
!= stash
->sec_vma
[i
])
4289 /* Read debug information from DEBUG_BFD when DEBUG_BFD is specified.
4290 If DEBUG_BFD is not specified, we read debug information from ABFD
4291 or its gnu_debuglink. The results will be stored in PINFO.
4292 The function returns TRUE iff debug information is ready. */
4295 _bfd_dwarf2_slurp_debug_info (bfd
*abfd
, bfd
*debug_bfd
,
4296 const struct dwarf_debug_section
*debug_sections
,
4299 bfd_boolean do_place
)
4301 bfd_size_type amt
= sizeof (struct dwarf2_debug
);
4302 bfd_size_type total_size
;
4304 struct dwarf2_debug
*stash
= (struct dwarf2_debug
*) *pinfo
;
4308 if (stash
->orig_bfd
== abfd
4309 && section_vma_same (abfd
, stash
))
4311 /* Check that we did previously find some debug information
4312 before attempting to make use of it. */
4313 if (stash
->bfd_ptr
!= NULL
)
4315 if (do_place
&& !place_sections (abfd
, stash
))
4322 _bfd_dwarf2_cleanup_debug_info (abfd
, pinfo
);
4323 memset (stash
, 0, amt
);
4327 stash
= (struct dwarf2_debug
*) bfd_zalloc (abfd
, amt
);
4331 stash
->orig_bfd
= abfd
;
4332 stash
->debug_sections
= debug_sections
;
4333 stash
->syms
= symbols
;
4334 if (!save_section_vma (abfd
, stash
))
4339 if (debug_bfd
== NULL
)
4342 msec
= find_debug_info (debug_bfd
, debug_sections
, NULL
);
4343 if (msec
== NULL
&& abfd
== debug_bfd
)
4345 char * debug_filename
;
4347 debug_filename
= bfd_follow_build_id_debuglink (abfd
, DEBUGDIR
);
4348 if (debug_filename
== NULL
)
4349 debug_filename
= bfd_follow_gnu_debuglink (abfd
, DEBUGDIR
);
4351 if (debug_filename
== NULL
)
4352 /* No dwarf2 info, and no gnu_debuglink to follow.
4353 Note that at this point the stash has been allocated, but
4354 contains zeros. This lets future calls to this function
4355 fail more quickly. */
4358 /* Set BFD_DECOMPRESS to decompress debug sections. */
4359 if ((debug_bfd
= bfd_openr (debug_filename
, NULL
)) == NULL
4360 || !(debug_bfd
->flags
|= BFD_DECOMPRESS
,
4361 bfd_check_format (debug_bfd
, bfd_object
))
4362 || (msec
= find_debug_info (debug_bfd
,
4363 debug_sections
, NULL
)) == NULL
4364 || !bfd_generic_link_read_symbols (debug_bfd
))
4367 bfd_close (debug_bfd
);
4368 /* FIXME: Should we report our failure to follow the debuglink ? */
4369 free (debug_filename
);
4373 symbols
= bfd_get_outsymbols (debug_bfd
);
4374 stash
->syms
= symbols
;
4375 stash
->close_on_cleanup
= TRUE
;
4377 stash
->bfd_ptr
= debug_bfd
;
4380 && !place_sections (abfd
, stash
))
4383 /* There can be more than one DWARF2 info section in a BFD these
4384 days. First handle the easy case when there's only one. If
4385 there's more than one, try case two: none of the sections is
4386 compressed. In that case, read them all in and produce one
4387 large stash. We do this in two passes - in the first pass we
4388 just accumulate the section sizes, and in the second pass we
4389 read in the section's contents. (The allows us to avoid
4390 reallocing the data as we add sections to the stash.) If
4391 some or all sections are compressed, then do things the slow
4392 way, with a bunch of reallocs. */
4394 if (! find_debug_info (debug_bfd
, debug_sections
, msec
))
4396 /* Case 1: only one info section. */
4397 total_size
= msec
->size
;
4398 if (! read_section (debug_bfd
, &stash
->debug_sections
[debug_info
],
4400 &stash
->info_ptr_memory
, &total_size
))
4405 /* Case 2: multiple sections. */
4406 for (total_size
= 0;
4408 msec
= find_debug_info (debug_bfd
, debug_sections
, msec
))
4409 total_size
+= msec
->size
;
4411 stash
->info_ptr_memory
= (bfd_byte
*) bfd_malloc (total_size
);
4412 if (stash
->info_ptr_memory
== NULL
)
4416 for (msec
= find_debug_info (debug_bfd
, debug_sections
, NULL
);
4418 msec
= find_debug_info (debug_bfd
, debug_sections
, msec
))
4426 if (!(bfd_simple_get_relocated_section_contents
4427 (debug_bfd
, msec
, stash
->info_ptr_memory
+ total_size
,
4435 stash
->info_ptr
= stash
->info_ptr_memory
;
4436 stash
->info_ptr_end
= stash
->info_ptr
+ total_size
;
4437 stash
->sec
= find_debug_info (debug_bfd
, debug_sections
, NULL
);
4438 stash
->sec_info_ptr
= stash
->info_ptr
;
4442 /* Scan the debug information in PINFO looking for a DW_TAG_subprogram
4443 abbrev with a DW_AT_low_pc attached to it. Then lookup that same
4444 symbol in SYMBOLS and return the difference between the low_pc and
4445 the symbol's address. Returns 0 if no suitable symbol could be found. */
4448 _bfd_dwarf2_find_symbol_bias (asymbol
** symbols
, void ** pinfo
)
4450 struct dwarf2_debug
*stash
;
4451 struct comp_unit
* unit
;
4453 stash
= (struct dwarf2_debug
*) *pinfo
;
4458 for (unit
= stash
->all_comp_units
; unit
; unit
= unit
->next_unit
)
4460 struct funcinfo
* func
;
4462 if (unit
->function_table
== NULL
)
4464 if (unit
->line_table
== NULL
)
4465 unit
->line_table
= decode_line_info (unit
, stash
);
4466 if (unit
->line_table
!= NULL
)
4467 scan_unit_for_symbols (unit
);
4470 for (func
= unit
->function_table
; func
!= NULL
; func
= func
->prev_func
)
4471 if (func
->name
&& func
->arange
.low
)
4475 /* FIXME: Do we need to scan the aranges looking for the lowest pc value ? */
4477 for (psym
= symbols
; * psym
!= NULL
; psym
++)
4479 asymbol
* sym
= * psym
;
4481 if (sym
->flags
& BSF_FUNCTION
4482 && sym
->section
!= NULL
4483 && strcmp (sym
->name
, func
->name
) == 0)
4484 return ((bfd_signed_vma
) func
->arange
.low
) -
4485 ((bfd_signed_vma
) (sym
->value
+ sym
->section
->vma
));
4493 /* Find the source code location of SYMBOL. If SYMBOL is NULL
4494 then find the nearest source code location corresponding to
4495 the address SECTION + OFFSET.
4496 Returns TRUE if the line is found without error and fills in
4497 FILENAME_PTR and LINENUMBER_PTR. In the case where SYMBOL was
4498 NULL the FUNCTIONNAME_PTR is also filled in.
4499 SYMBOLS contains the symbol table for ABFD.
4500 DEBUG_SECTIONS contains the name of the dwarf debug sections.
4501 ADDR_SIZE is the number of bytes in the initial .debug_info length
4502 field and in the abbreviation offset, or zero to indicate that the
4503 default value should be used. */
4506 _bfd_dwarf2_find_nearest_line (bfd
*abfd
,
4511 const char **filename_ptr
,
4512 const char **functionname_ptr
,
4513 unsigned int *linenumber_ptr
,
4514 unsigned int *discriminator_ptr
,
4515 const struct dwarf_debug_section
*debug_sections
,
4516 unsigned int addr_size
,
4519 /* Read each compilation unit from the section .debug_info, and check
4520 to see if it contains the address we are searching for. If yes,
4521 lookup the address, and return the line number info. If no, go
4522 on to the next compilation unit.
4524 We keep a list of all the previously read compilation units, and
4525 a pointer to the next un-read compilation unit. Check the
4526 previously read units before reading more. */
4527 struct dwarf2_debug
*stash
;
4528 /* What address are we looking for? */
4530 struct comp_unit
* each
;
4531 struct funcinfo
*function
= NULL
;
4532 bfd_boolean found
= FALSE
;
4533 bfd_boolean do_line
;
4535 *filename_ptr
= NULL
;
4536 if (functionname_ptr
!= NULL
)
4537 *functionname_ptr
= NULL
;
4538 *linenumber_ptr
= 0;
4539 if (discriminator_ptr
)
4540 *discriminator_ptr
= 0;
4542 if (! _bfd_dwarf2_slurp_debug_info (abfd
, NULL
, debug_sections
,
4544 (abfd
->flags
& (EXEC_P
| DYNAMIC
)) == 0))
4547 stash
= (struct dwarf2_debug
*) *pinfo
;
4549 do_line
= symbol
!= NULL
;
4552 BFD_ASSERT (section
== NULL
&& offset
== 0 && functionname_ptr
== NULL
);
4553 section
= bfd_get_section (symbol
);
4554 addr
= symbol
->value
;
4558 BFD_ASSERT (section
!= NULL
&& functionname_ptr
!= NULL
);
4561 /* If we have no SYMBOL but the section we're looking at is not a
4562 code section, then take a look through the list of symbols to see
4563 if we have a symbol at the address we're looking for. If we do
4564 then use this to look up line information. This will allow us to
4565 give file and line results for data symbols. We exclude code
4566 symbols here, if we look up a function symbol and then look up the
4567 line information we'll actually return the line number for the
4568 opening '{' rather than the function definition line. This is
4569 because looking up by symbol uses the line table, in which the
4570 first line for a function is usually the opening '{', while
4571 looking up the function by section + offset uses the
4572 DW_AT_decl_line from the function DW_TAG_subprogram for the line,
4573 which will be the line of the function name. */
4574 if (symbols
!= NULL
&& (section
->flags
& SEC_CODE
) == 0)
4578 for (tmp
= symbols
; (*tmp
) != NULL
; ++tmp
)
4579 if ((*tmp
)->the_bfd
== abfd
4580 && (*tmp
)->section
== section
4581 && (*tmp
)->value
== offset
4582 && ((*tmp
)->flags
& BSF_SECTION_SYM
) == 0)
4586 /* For local symbols, keep going in the hope we find a
4588 if ((symbol
->flags
& BSF_GLOBAL
) != 0)
4594 if (section
->output_section
)
4595 addr
+= section
->output_section
->vma
+ section
->output_offset
;
4597 addr
+= section
->vma
;
4599 /* A null info_ptr indicates that there is no dwarf2 info
4600 (or that an error occured while setting up the stash). */
4601 if (! stash
->info_ptr
)
4604 stash
->inliner_chain
= NULL
;
4606 /* Check the previously read comp. units first. */
4609 /* The info hash tables use quite a bit of memory. We may not want to
4610 always use them. We use some heuristics to decide if and when to
4612 if (stash
->info_hash_status
== STASH_INFO_HASH_OFF
)
4613 stash_maybe_enable_info_hash_tables (abfd
, stash
);
4615 /* Keep info hash table up to date if they are available. Note that we
4616 may disable the hash tables if there is any error duing update. */
4617 if (stash
->info_hash_status
== STASH_INFO_HASH_ON
)
4618 stash_maybe_update_info_hash_tables (stash
);
4620 if (stash
->info_hash_status
== STASH_INFO_HASH_ON
)
4622 found
= stash_find_line_fast (stash
, symbol
, addr
, filename_ptr
,
4629 /* Check the previously read comp. units first. */
4630 for (each
= stash
->all_comp_units
; each
; each
= each
->next_unit
)
4631 if ((symbol
->flags
& BSF_FUNCTION
) == 0
4632 || each
->arange
.high
== 0
4633 || comp_unit_contains_address (each
, addr
))
4635 found
= comp_unit_find_line (each
, symbol
, addr
, filename_ptr
,
4636 linenumber_ptr
, stash
);
4644 bfd_vma min_range
= (bfd_vma
) -1;
4645 const char * local_filename
= NULL
;
4646 struct funcinfo
*local_function
= NULL
;
4647 unsigned int local_linenumber
= 0;
4648 unsigned int local_discriminator
= 0;
4650 for (each
= stash
->all_comp_units
; each
; each
= each
->next_unit
)
4652 bfd_vma range
= (bfd_vma
) -1;
4654 found
= ((each
->arange
.high
== 0
4655 || comp_unit_contains_address (each
, addr
))
4656 && (range
= comp_unit_find_nearest_line (each
, addr
,
4660 & local_discriminator
,
4664 /* PRs 15935 15994: Bogus debug information may have provided us
4665 with an erroneous match. We attempt to counter this by
4666 selecting the match that has the smallest address range
4667 associated with it. (We are assuming that corrupt debug info
4668 will tend to result in extra large address ranges rather than
4669 extra small ranges).
4671 This does mean that we scan through all of the CUs associated
4672 with the bfd each time this function is called. But this does
4673 have the benefit of producing consistent results every time the
4674 function is called. */
4675 if (range
<= min_range
)
4677 if (filename_ptr
&& local_filename
)
4678 * filename_ptr
= local_filename
;
4680 function
= local_function
;
4681 if (discriminator_ptr
&& local_discriminator
)
4682 * discriminator_ptr
= local_discriminator
;
4683 if (local_linenumber
)
4684 * linenumber_ptr
= local_linenumber
;
4690 if (* linenumber_ptr
)
4697 /* The DWARF2 spec says that the initial length field, and the
4698 offset of the abbreviation table, should both be 4-byte values.
4699 However, some compilers do things differently. */
4702 BFD_ASSERT (addr_size
== 4 || addr_size
== 8);
4704 /* Read each remaining comp. units checking each as they are read. */
4705 while (stash
->info_ptr
< stash
->info_ptr_end
)
4708 unsigned int offset_size
= addr_size
;
4709 bfd_byte
*info_ptr_unit
= stash
->info_ptr
;
4711 length
= read_4_bytes (stash
->bfd_ptr
, stash
->info_ptr
, stash
->info_ptr_end
);
4712 /* A 0xffffff length is the DWARF3 way of indicating
4713 we use 64-bit offsets, instead of 32-bit offsets. */
4714 if (length
== 0xffffffff)
4717 length
= read_8_bytes (stash
->bfd_ptr
, stash
->info_ptr
+ 4, stash
->info_ptr_end
);
4718 stash
->info_ptr
+= 12;
4720 /* A zero length is the IRIX way of indicating 64-bit offsets,
4721 mostly because the 64-bit length will generally fit in 32
4722 bits, and the endianness helps. */
4723 else if (length
== 0)
4726 length
= read_4_bytes (stash
->bfd_ptr
, stash
->info_ptr
+ 4, stash
->info_ptr_end
);
4727 stash
->info_ptr
+= 8;
4729 /* In the absence of the hints above, we assume 32-bit DWARF2
4730 offsets even for targets with 64-bit addresses, because:
4731 a) most of the time these targets will not have generated
4732 more than 2Gb of debug info and so will not need 64-bit
4735 b) if they do use 64-bit offsets but they are not using
4736 the size hints that are tested for above then they are
4737 not conforming to the DWARF3 standard anyway. */
4738 else if (addr_size
== 8)
4741 stash
->info_ptr
+= 4;
4744 stash
->info_ptr
+= 4;
4751 if (stash
->info_ptr
+ length
> stash
->info_ptr_end
)
4754 each
= parse_comp_unit (stash
, length
, info_ptr_unit
,
4757 /* The dwarf information is damaged, don't trust it any
4761 new_ptr
= stash
->info_ptr
+ length
;
4762 /* PR 17512: file: 1500698c. */
4763 if (new_ptr
< stash
->info_ptr
)
4765 /* A corrupt length value - do not trust the info any more. */
4770 stash
->info_ptr
= new_ptr
;
4772 if (stash
->all_comp_units
)
4773 stash
->all_comp_units
->prev_unit
= each
;
4775 stash
->last_comp_unit
= each
;
4777 each
->next_unit
= stash
->all_comp_units
;
4778 stash
->all_comp_units
= each
;
4780 /* DW_AT_low_pc and DW_AT_high_pc are optional for
4781 compilation units. If we don't have them (i.e.,
4782 unit->high == 0), we need to consult the line info table
4783 to see if a compilation unit contains the given
4786 found
= (((symbol
->flags
& BSF_FUNCTION
) == 0
4787 || each
->arange
.high
== 0
4788 || comp_unit_contains_address (each
, addr
))
4789 && comp_unit_find_line (each
, symbol
, addr
,
4794 found
= ((each
->arange
.high
== 0
4795 || comp_unit_contains_address (each
, addr
))
4796 && comp_unit_find_nearest_line (each
, addr
,
4803 if ((bfd_vma
) (stash
->info_ptr
- stash
->sec_info_ptr
)
4804 == stash
->sec
->size
)
4806 stash
->sec
= find_debug_info (stash
->bfd_ptr
, debug_sections
,
4808 stash
->sec_info_ptr
= stash
->info_ptr
;
4819 if (!function
->is_linkage
)
4824 fun
= _bfd_elf_find_function (abfd
, symbols
, section
, offset
,
4825 *filename_ptr
? NULL
: filename_ptr
,
4827 sec_vma
= section
->vma
;
4828 if (section
->output_section
!= NULL
)
4829 sec_vma
= section
->output_section
->vma
+ section
->output_offset
;
4831 && fun
->value
+ sec_vma
== function
->arange
.low
)
4832 function
->name
= *functionname_ptr
;
4833 /* Even if we didn't find a linkage name, say that we have
4834 to stop a repeated search of symbols. */
4835 function
->is_linkage
= TRUE
;
4837 *functionname_ptr
= function
->name
;
4839 if ((abfd
->flags
& (EXEC_P
| DYNAMIC
)) == 0)
4840 unset_sections (stash
);
4846 _bfd_dwarf2_find_inliner_info (bfd
*abfd ATTRIBUTE_UNUSED
,
4847 const char **filename_ptr
,
4848 const char **functionname_ptr
,
4849 unsigned int *linenumber_ptr
,
4852 struct dwarf2_debug
*stash
;
4854 stash
= (struct dwarf2_debug
*) *pinfo
;
4857 struct funcinfo
*func
= stash
->inliner_chain
;
4859 if (func
&& func
->caller_func
)
4861 *filename_ptr
= func
->caller_file
;
4862 *functionname_ptr
= func
->caller_func
->name
;
4863 *linenumber_ptr
= func
->caller_line
;
4864 stash
->inliner_chain
= func
->caller_func
;
4873 _bfd_dwarf2_cleanup_debug_info (bfd
*abfd
, void **pinfo
)
4875 struct dwarf2_debug
*stash
= (struct dwarf2_debug
*) *pinfo
;
4876 struct comp_unit
*each
;
4878 if (abfd
== NULL
|| stash
== NULL
)
4881 for (each
= stash
->all_comp_units
; each
; each
= each
->next_unit
)
4883 struct abbrev_info
**abbrevs
= each
->abbrevs
;
4884 struct funcinfo
*function_table
= each
->function_table
;
4885 struct varinfo
*variable_table
= each
->variable_table
;
4888 for (i
= 0; i
< ABBREV_HASH_SIZE
; i
++)
4890 struct abbrev_info
*abbrev
= abbrevs
[i
];
4894 free (abbrev
->attrs
);
4895 abbrev
= abbrev
->next
;
4899 if (each
->line_table
)
4901 free (each
->line_table
->dirs
);
4902 free (each
->line_table
->files
);
4905 while (function_table
)
4907 if (function_table
->file
)
4909 free (function_table
->file
);
4910 function_table
->file
= NULL
;
4913 if (function_table
->caller_file
)
4915 free (function_table
->caller_file
);
4916 function_table
->caller_file
= NULL
;
4918 function_table
= function_table
->prev_func
;
4921 if (each
->lookup_funcinfo_table
)
4923 free (each
->lookup_funcinfo_table
);
4924 each
->lookup_funcinfo_table
= NULL
;
4927 while (variable_table
)
4929 if (variable_table
->file
)
4931 free (variable_table
->file
);
4932 variable_table
->file
= NULL
;
4935 variable_table
= variable_table
->prev_var
;
4939 if (stash
->dwarf_abbrev_buffer
)
4940 free (stash
->dwarf_abbrev_buffer
);
4941 if (stash
->dwarf_line_buffer
)
4942 free (stash
->dwarf_line_buffer
);
4943 if (stash
->dwarf_str_buffer
)
4944 free (stash
->dwarf_str_buffer
);
4945 if (stash
->dwarf_line_str_buffer
)
4946 free (stash
->dwarf_line_str_buffer
);
4947 if (stash
->dwarf_ranges_buffer
)
4948 free (stash
->dwarf_ranges_buffer
);
4949 if (stash
->info_ptr_memory
)
4950 free (stash
->info_ptr_memory
);
4951 if (stash
->close_on_cleanup
)
4952 bfd_close (stash
->bfd_ptr
);
4953 if (stash
->alt_dwarf_str_buffer
)
4954 free (stash
->alt_dwarf_str_buffer
);
4955 if (stash
->alt_dwarf_info_buffer
)
4956 free (stash
->alt_dwarf_info_buffer
);
4958 free (stash
->sec_vma
);
4959 if (stash
->adjusted_sections
)
4960 free (stash
->adjusted_sections
);
4961 if (stash
->alt_bfd_ptr
)
4962 bfd_close (stash
->alt_bfd_ptr
);
4965 /* Find the function to a particular section and offset,
4966 for error reporting. */
4969 _bfd_elf_find_function (bfd
*abfd
,
4973 const char **filename_ptr
,
4974 const char **functionname_ptr
)
4976 struct elf_find_function_cache
4978 asection
*last_section
;
4980 const char *filename
;
4981 bfd_size_type func_size
;
4984 if (symbols
== NULL
)
4987 if (bfd_get_flavour (abfd
) != bfd_target_elf_flavour
)
4990 cache
= elf_tdata (abfd
)->elf_find_function_cache
;
4993 cache
= bfd_zalloc (abfd
, sizeof (*cache
));
4994 elf_tdata (abfd
)->elf_find_function_cache
= cache
;
4998 if (cache
->last_section
!= section
4999 || cache
->func
== NULL
5000 || offset
< cache
->func
->value
5001 || offset
>= cache
->func
->value
+ cache
->func_size
)
5006 /* ??? Given multiple file symbols, it is impossible to reliably
5007 choose the right file name for global symbols. File symbols are
5008 local symbols, and thus all file symbols must sort before any
5009 global symbols. The ELF spec may be interpreted to say that a
5010 file symbol must sort before other local symbols, but currently
5011 ld -r doesn't do this. So, for ld -r output, it is possible to
5012 make a better choice of file name for local symbols by ignoring
5013 file symbols appearing after a given local symbol. */
5014 enum { nothing_seen
, symbol_seen
, file_after_symbol_seen
} state
;
5015 const struct elf_backend_data
*bed
= get_elf_backend_data (abfd
);
5019 state
= nothing_seen
;
5020 cache
->filename
= NULL
;
5022 cache
->func_size
= 0;
5023 cache
->last_section
= section
;
5025 for (p
= symbols
; *p
!= NULL
; p
++)
5031 if ((sym
->flags
& BSF_FILE
) != 0)
5034 if (state
== symbol_seen
)
5035 state
= file_after_symbol_seen
;
5039 size
= bed
->maybe_function_sym (sym
, section
, &code_off
);
5041 && code_off
<= offset
5042 && (code_off
> low_func
5043 || (code_off
== low_func
5044 && size
> cache
->func_size
)))
5047 cache
->func_size
= size
;
5048 cache
->filename
= NULL
;
5049 low_func
= code_off
;
5051 && ((sym
->flags
& BSF_LOCAL
) != 0
5052 || state
!= file_after_symbol_seen
))
5053 cache
->filename
= bfd_asymbol_name (file
);
5055 if (state
== nothing_seen
)
5056 state
= symbol_seen
;
5060 if (cache
->func
== NULL
)
5064 *filename_ptr
= cache
->filename
;
5065 if (functionname_ptr
)
5066 *functionname_ptr
= bfd_asymbol_name (cache
->func
);