Index: stable/9/contrib/binutils/bfd/dwarf2.c =================================================================== --- stable/9/contrib/binutils/bfd/dwarf2.c (revision 249039) +++ stable/9/contrib/binutils/bfd/dwarf2.c (revision 249040) @@ -1,2692 +1,2695 @@ /* DWARF 2 support. Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc. Adapted from gdb/dwarf2read.c by Gavin Koch of Cygnus Solutions (gavin@cygnus.com). From the dwarf2read.c header: Adapted by Gary Funck (gary@intrepid.com), Intrepid Technology, Inc. with support from Florida State University (under contract with the Ada Joint Program Office), and Silicon Graphics, Inc. Initial contribution by Brent Benson, Harris Computer Systems, Inc., based on Fred Fish's (Cygnus Support) implementation of DWARF 1 support in dwarfread.c This file is part of BFD. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA. */ #include "sysdep.h" #include "bfd.h" #include "libiberty.h" #include "libbfd.h" #include "elf-bfd.h" #include "elf/dwarf2.h" /* The data in the .debug_line statement prologue looks like this. */ struct line_head { bfd_vma total_length; unsigned short version; bfd_vma prologue_length; unsigned char minimum_instruction_length; unsigned char default_is_stmt; int line_base; unsigned char line_range; unsigned char opcode_base; unsigned char *standard_opcode_lengths; }; /* Attributes have a name and a value. */ struct attribute { enum dwarf_attribute name; enum dwarf_form form; union { char *str; struct dwarf_block *blk; bfd_uint64_t val; bfd_int64_t sval; } u; }; /* Blocks are a bunch of untyped bytes. */ struct dwarf_block { unsigned int size; bfd_byte *data; }; struct loadable_section { asection *section; bfd_vma adj_vma; }; struct dwarf2_debug { /* A list of all previously read comp_units. */ struct comp_unit *all_comp_units; /* The next unread compilation unit within the .debug_info section. Zero indicates that the .debug_info section has not been loaded into a buffer yet. */ bfd_byte *info_ptr; /* Pointer to the end of the .debug_info section memory buffer. */ bfd_byte *info_ptr_end; /* Pointer to the bfd, section and address of the beginning of the section. The bfd might be different than expected because of gnu_debuglink sections. */ bfd * bfd; asection *sec; bfd_byte *sec_info_ptr; /* Pointer to the symbol table. */ asymbol **syms; /* Pointer to the .debug_abbrev section loaded into memory. */ bfd_byte *dwarf_abbrev_buffer; /* Length of the loaded .debug_abbrev section. */ unsigned long dwarf_abbrev_size; /* Buffer for decode_line_info. */ bfd_byte *dwarf_line_buffer; /* Length of the loaded .debug_line section. */ unsigned long dwarf_line_size; /* Pointer to the .debug_str section loaded into memory. */ bfd_byte *dwarf_str_buffer; /* Length of the loaded .debug_str section. */ unsigned long dwarf_str_size; /* Pointer to the .debug_ranges section loaded into memory. */ bfd_byte *dwarf_ranges_buffer; /* Length of the loaded .debug_ranges section. */ unsigned long dwarf_ranges_size; /* If the most recent call to bfd_find_nearest_line was given an address in an inlined function, preserve a pointer into the calling chain for subsequent calls to bfd_find_inliner_info to use. */ struct funcinfo *inliner_chain; /* Number of loadable sections. */ unsigned int loadable_section_count; /* Array of loadable sections. */ struct loadable_section *loadable_sections; }; struct arange { struct arange *next; bfd_vma low; bfd_vma high; }; /* A minimal decoding of DWARF2 compilation units. We only decode what's needed to get to the line number information. */ struct comp_unit { /* Chain the previously read compilation units. */ struct comp_unit *next_unit; /* Keep the bfd convenient (for memory allocation). */ bfd *abfd; /* The lowest and highest addresses contained in this compilation unit as specified in the compilation unit header. */ struct arange arange; /* The DW_AT_name attribute (for error messages). */ char *name; /* The abbrev hash table. */ struct abbrev_info **abbrevs; /* Note that an error was found by comp_unit_find_nearest_line. */ int error; /* The DW_AT_comp_dir attribute. */ char *comp_dir; /* TRUE if there is a line number table associated with this comp. unit. */ int stmtlist; /* Pointer to the current comp_unit so that we can find a given entry by its reference. */ bfd_byte *info_ptr_unit; /* The offset into .debug_line of the line number table. */ unsigned long line_offset; /* Pointer to the first child die for the comp unit. */ bfd_byte *first_child_die_ptr; /* The end of the comp unit. */ bfd_byte *end_ptr; /* The decoded line number, NULL if not yet decoded. */ struct line_info_table *line_table; /* A list of the functions found in this comp. unit. */ struct funcinfo *function_table; /* A list of the variables found in this comp. unit. */ struct varinfo *variable_table; /* Pointer to dwarf2_debug structure. */ struct dwarf2_debug *stash; /* Address size for this unit - from unit header. */ unsigned char addr_size; /* Offset size for this unit - from unit header. */ unsigned char offset_size; /* Base address for this unit - from DW_AT_low_pc attribute of DW_TAG_compile_unit DIE */ bfd_vma base_address; }; /* This data structure holds the information of an abbrev. */ struct abbrev_info { unsigned int number; /* Number identifying abbrev. */ enum dwarf_tag tag; /* DWARF tag. */ int has_children; /* Boolean. */ unsigned int num_attrs; /* Number of attributes. */ struct attr_abbrev *attrs; /* An array of attribute descriptions. */ struct abbrev_info *next; /* Next in chain. */ }; struct attr_abbrev { enum dwarf_attribute name; enum dwarf_form form; }; #ifndef ABBREV_HASH_SIZE #define ABBREV_HASH_SIZE 121 #endif #ifndef ATTR_ALLOC_CHUNK #define ATTR_ALLOC_CHUNK 4 #endif /* VERBATIM The following function up to the END VERBATIM mark are copied directly from dwarf2read.c. */ /* Read dwarf information from a buffer. */ static unsigned int read_1_byte (bfd *abfd ATTRIBUTE_UNUSED, bfd_byte *buf) { return bfd_get_8 (abfd, buf); } static int read_1_signed_byte (bfd *abfd ATTRIBUTE_UNUSED, bfd_byte *buf) { return bfd_get_signed_8 (abfd, buf); } static unsigned int read_2_bytes (bfd *abfd, bfd_byte *buf) { return bfd_get_16 (abfd, buf); } static unsigned int read_4_bytes (bfd *abfd, bfd_byte *buf) { return bfd_get_32 (abfd, buf); } static bfd_uint64_t read_8_bytes (bfd *abfd, bfd_byte *buf) { return bfd_get_64 (abfd, buf); } static bfd_byte * read_n_bytes (bfd *abfd ATTRIBUTE_UNUSED, bfd_byte *buf, unsigned int size ATTRIBUTE_UNUSED) { /* If the size of a host char is 8 bits, we can return a pointer to the buffer, otherwise we have to copy the data to a buffer allocated on the temporary obstack. */ return buf; } static char * read_string (bfd *abfd ATTRIBUTE_UNUSED, bfd_byte *buf, unsigned int *bytes_read_ptr) { /* Return a pointer to the embedded string. */ char *str = (char *) buf; if (*str == '\0') { *bytes_read_ptr = 1; return NULL; } *bytes_read_ptr = strlen (str) + 1; return str; } static char * read_indirect_string (struct comp_unit* unit, bfd_byte *buf, unsigned int *bytes_read_ptr) { bfd_uint64_t offset; struct dwarf2_debug *stash = unit->stash; char *str; if (unit->offset_size == 4) offset = read_4_bytes (unit->abfd, buf); else offset = read_8_bytes (unit->abfd, buf); *bytes_read_ptr = unit->offset_size; if (! stash->dwarf_str_buffer) { asection *msec; bfd *abfd = unit->abfd; bfd_size_type sz; msec = bfd_get_section_by_name (abfd, ".debug_str"); if (! msec) { (*_bfd_error_handler) (_("Dwarf Error: Can't find .debug_str section.")); bfd_set_error (bfd_error_bad_value); return NULL; } sz = msec->rawsize ? msec->rawsize : msec->size; stash->dwarf_str_size = sz; stash->dwarf_str_buffer = bfd_alloc (abfd, sz); if (! stash->dwarf_str_buffer) return NULL; if (! bfd_get_section_contents (abfd, msec, stash->dwarf_str_buffer, 0, sz)) return NULL; } if (offset >= stash->dwarf_str_size) { (*_bfd_error_handler) (_("Dwarf Error: DW_FORM_strp offset (%lu) greater than or equal to .debug_str size (%lu)."), (unsigned long) offset, stash->dwarf_str_size); bfd_set_error (bfd_error_bad_value); return NULL; } str = (char *) stash->dwarf_str_buffer + offset; if (*str == '\0') return NULL; return str; } /* END VERBATIM */ static bfd_uint64_t read_address (struct comp_unit *unit, bfd_byte *buf) { int signed_vma = get_elf_backend_data (unit->abfd)->sign_extend_vma; if (signed_vma) { switch (unit->addr_size) { case 8: return bfd_get_signed_64 (unit->abfd, buf); case 4: return bfd_get_signed_32 (unit->abfd, buf); case 2: return bfd_get_signed_16 (unit->abfd, buf); default: abort (); } } else { switch (unit->addr_size) { case 8: return bfd_get_64 (unit->abfd, buf); case 4: return bfd_get_32 (unit->abfd, buf); case 2: return bfd_get_16 (unit->abfd, buf); default: abort (); } } } /* Lookup an abbrev_info structure in the abbrev hash table. */ static struct abbrev_info * lookup_abbrev (unsigned int number, struct abbrev_info **abbrevs) { unsigned int hash_number; struct abbrev_info *abbrev; hash_number = number % ABBREV_HASH_SIZE; abbrev = abbrevs[hash_number]; while (abbrev) { if (abbrev->number == number) return abbrev; else abbrev = abbrev->next; } return NULL; } /* In DWARF version 2, the description of the debugging information is stored in a separate .debug_abbrev section. Before we read any dies from a section we read in all abbreviations and install them in a hash table. */ static struct abbrev_info** read_abbrevs (bfd *abfd, bfd_uint64_t offset, struct dwarf2_debug *stash) { struct abbrev_info **abbrevs; bfd_byte *abbrev_ptr; struct abbrev_info *cur_abbrev; unsigned int abbrev_number, bytes_read, abbrev_name; unsigned int abbrev_form, hash_number; bfd_size_type amt; if (! stash->dwarf_abbrev_buffer) { asection *msec; msec = bfd_get_section_by_name (abfd, ".debug_abbrev"); if (! msec) { (*_bfd_error_handler) (_("Dwarf Error: Can't find .debug_abbrev section.")); bfd_set_error (bfd_error_bad_value); return 0; } stash->dwarf_abbrev_size = msec->size; stash->dwarf_abbrev_buffer = bfd_simple_get_relocated_section_contents (abfd, msec, NULL, stash->syms); if (! stash->dwarf_abbrev_buffer) return 0; } if (offset >= stash->dwarf_abbrev_size) { (*_bfd_error_handler) (_("Dwarf Error: Abbrev offset (%lu) greater than or equal to .debug_abbrev size (%lu)."), (unsigned long) offset, stash->dwarf_abbrev_size); bfd_set_error (bfd_error_bad_value); return 0; } amt = sizeof (struct abbrev_info*) * ABBREV_HASH_SIZE; abbrevs = bfd_zalloc (abfd, amt); abbrev_ptr = stash->dwarf_abbrev_buffer + offset; abbrev_number = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); abbrev_ptr += bytes_read; /* Loop until we reach an abbrev number of 0. */ while (abbrev_number) { amt = sizeof (struct abbrev_info); cur_abbrev = bfd_zalloc (abfd, amt); /* Read in abbrev header. */ cur_abbrev->number = abbrev_number; cur_abbrev->tag = (enum dwarf_tag) read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); abbrev_ptr += bytes_read; cur_abbrev->has_children = read_1_byte (abfd, abbrev_ptr); abbrev_ptr += 1; /* Now read in declarations. */ abbrev_name = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); abbrev_ptr += bytes_read; abbrev_form = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); abbrev_ptr += bytes_read; while (abbrev_name) { if ((cur_abbrev->num_attrs % ATTR_ALLOC_CHUNK) == 0) { struct attr_abbrev *tmp; amt = cur_abbrev->num_attrs + ATTR_ALLOC_CHUNK; amt *= sizeof (struct attr_abbrev); tmp = bfd_realloc (cur_abbrev->attrs, amt); if (tmp == NULL) { size_t i; for (i = 0; i < ABBREV_HASH_SIZE; i++) { struct abbrev_info *abbrev = abbrevs[i]; while (abbrev) { free (abbrev->attrs); abbrev = abbrev->next; } } return NULL; } cur_abbrev->attrs = tmp; } cur_abbrev->attrs[cur_abbrev->num_attrs].name = (enum dwarf_attribute) abbrev_name; cur_abbrev->attrs[cur_abbrev->num_attrs++].form = (enum dwarf_form) abbrev_form; abbrev_name = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); abbrev_ptr += bytes_read; abbrev_form = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); abbrev_ptr += bytes_read; } hash_number = abbrev_number % ABBREV_HASH_SIZE; cur_abbrev->next = abbrevs[hash_number]; abbrevs[hash_number] = cur_abbrev; /* Get next abbreviation. Under Irix6 the abbreviations for a compilation unit are not always properly terminated with an abbrev number of 0. Exit loop if we encounter an abbreviation which we have already read (which means we are about to read the abbreviations for the next compile unit) or if the end of the abbreviation table is reached. */ if ((unsigned int) (abbrev_ptr - stash->dwarf_abbrev_buffer) >= stash->dwarf_abbrev_size) break; abbrev_number = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read); abbrev_ptr += bytes_read; if (lookup_abbrev (abbrev_number,abbrevs) != NULL) break; } return abbrevs; } /* Read an attribute value described by an attribute form. */ static bfd_byte * read_attribute_value (struct attribute *attr, unsigned form, struct comp_unit *unit, bfd_byte *info_ptr) { bfd *abfd = unit->abfd; unsigned int bytes_read; struct dwarf_block *blk; bfd_size_type amt; attr->form = (enum dwarf_form) form; switch (form) { case DW_FORM_addr: /* FIXME: DWARF3 draft says DW_FORM_ref_addr is offset_size. */ case DW_FORM_ref_addr: attr->u.val = read_address (unit, info_ptr); info_ptr += unit->addr_size; break; case DW_FORM_block2: amt = sizeof (struct dwarf_block); blk = bfd_alloc (abfd, amt); blk->size = read_2_bytes (abfd, info_ptr); info_ptr += 2; blk->data = read_n_bytes (abfd, info_ptr, blk->size); info_ptr += blk->size; attr->u.blk = blk; break; case DW_FORM_block4: amt = sizeof (struct dwarf_block); blk = bfd_alloc (abfd, amt); blk->size = read_4_bytes (abfd, info_ptr); info_ptr += 4; blk->data = read_n_bytes (abfd, info_ptr, blk->size); info_ptr += blk->size; attr->u.blk = blk; break; case DW_FORM_data2: attr->u.val = read_2_bytes (abfd, info_ptr); info_ptr += 2; break; case DW_FORM_data4: attr->u.val = read_4_bytes (abfd, info_ptr); info_ptr += 4; break; case DW_FORM_data8: attr->u.val = read_8_bytes (abfd, info_ptr); info_ptr += 8; break; case DW_FORM_string: attr->u.str = read_string (abfd, info_ptr, &bytes_read); info_ptr += bytes_read; break; case DW_FORM_strp: attr->u.str = read_indirect_string (unit, info_ptr, &bytes_read); info_ptr += bytes_read; break; case DW_FORM_block: amt = sizeof (struct dwarf_block); blk = bfd_alloc (abfd, amt); blk->size = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); info_ptr += bytes_read; blk->data = read_n_bytes (abfd, info_ptr, blk->size); info_ptr += blk->size; attr->u.blk = blk; break; case DW_FORM_block1: amt = sizeof (struct dwarf_block); blk = bfd_alloc (abfd, amt); blk->size = read_1_byte (abfd, info_ptr); info_ptr += 1; blk->data = read_n_bytes (abfd, info_ptr, blk->size); info_ptr += blk->size; attr->u.blk = blk; break; case DW_FORM_data1: attr->u.val = read_1_byte (abfd, info_ptr); info_ptr += 1; break; case DW_FORM_flag: attr->u.val = read_1_byte (abfd, info_ptr); info_ptr += 1; break; + case DW_FORM_flag_present: + attr->u.val = 1; + break; case DW_FORM_sdata: attr->u.sval = read_signed_leb128 (abfd, info_ptr, &bytes_read); info_ptr += bytes_read; break; case DW_FORM_udata: attr->u.val = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); info_ptr += bytes_read; break; case DW_FORM_ref1: attr->u.val = read_1_byte (abfd, info_ptr); info_ptr += 1; break; case DW_FORM_ref2: attr->u.val = read_2_bytes (abfd, info_ptr); info_ptr += 2; break; case DW_FORM_ref4: attr->u.val = read_4_bytes (abfd, info_ptr); info_ptr += 4; break; case DW_FORM_ref8: attr->u.val = read_8_bytes (abfd, info_ptr); info_ptr += 8; break; case DW_FORM_ref_udata: attr->u.val = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); info_ptr += bytes_read; break; case DW_FORM_indirect: form = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); info_ptr += bytes_read; info_ptr = read_attribute_value (attr, form, unit, info_ptr); break; default: (*_bfd_error_handler) (_("Dwarf Error: Invalid or unhandled FORM value: %u."), form); bfd_set_error (bfd_error_bad_value); } return info_ptr; } /* Read an attribute described by an abbreviated attribute. */ static bfd_byte * read_attribute (struct attribute *attr, struct attr_abbrev *abbrev, struct comp_unit *unit, bfd_byte *info_ptr) { attr->name = abbrev->name; info_ptr = read_attribute_value (attr, abbrev->form, unit, info_ptr); return info_ptr; } /* Source line information table routines. */ #define FILE_ALLOC_CHUNK 5 #define DIR_ALLOC_CHUNK 5 struct line_info { struct line_info* prev_line; bfd_vma address; char *filename; unsigned int line; unsigned int column; int end_sequence; /* End of (sequential) code sequence. */ }; struct fileinfo { char *name; unsigned int dir; unsigned int time; unsigned int size; }; struct line_info_table { bfd* abfd; unsigned int num_files; unsigned int num_dirs; char *comp_dir; char **dirs; struct fileinfo* files; struct line_info* last_line; /* largest VMA */ struct line_info* lcl_head; /* local head; used in 'add_line_info' */ }; /* Remember some information about each function. If the function is inlined (DW_TAG_inlined_subroutine) it may have two additional attributes, DW_AT_call_file and DW_AT_call_line, which specify the source code location where this function was inlined. */ struct funcinfo { struct funcinfo *prev_func; /* Pointer to previous function in list of all functions */ struct funcinfo *caller_func; /* Pointer to function one scope higher */ char *caller_file; /* Source location file name where caller_func inlines this func */ int caller_line; /* Source location line number where caller_func inlines this func */ char *file; /* Source location file name */ int line; /* Source location line number */ int tag; char *name; struct arange arange; asection *sec; /* Where the symbol is defined */ }; struct varinfo { /* Pointer to previous variable in list of all variables */ struct varinfo *prev_var; /* Source location file name */ char *file; /* Source location line number */ int line; int tag; char *name; bfd_vma addr; /* Where the symbol is defined */ asection *sec; /* Is this a stack variable? */ unsigned int stack: 1; }; /* Return TRUE if NEW_LINE should sort after LINE. */ static inline bfd_boolean new_line_sorts_after (struct line_info *new_line, struct line_info *line) { return (new_line->address > line->address || (new_line->address == line->address && new_line->end_sequence < line->end_sequence)); } /* Adds a new entry to the line_info list in the line_info_table, ensuring that the list is sorted. Note that the line_info list is sorted from highest to lowest VMA (with possible duplicates); that is, line_info->prev_line always accesses an equal or smaller VMA. */ static void add_line_info (struct line_info_table *table, bfd_vma address, char *filename, unsigned int line, unsigned int column, int end_sequence) { bfd_size_type amt = sizeof (struct line_info); struct line_info* info = bfd_alloc (table->abfd, amt); /* Set member data of 'info'. */ info->address = address; info->line = line; info->column = column; info->end_sequence = end_sequence; if (filename && filename[0]) { info->filename = bfd_alloc (table->abfd, strlen (filename) + 1); if (info->filename) strcpy (info->filename, filename); } else info->filename = NULL; /* Find the correct location for 'info'. Normally we will receive new line_info data 1) in order and 2) with increasing VMAs. However some compilers break the rules (cf. decode_line_info) and so we include some heuristics for quickly finding the correct location for 'info'. In particular, these heuristics optimize for the common case in which the VMA sequence that we receive is a list of locally sorted VMAs such as p...z a...j (where a < j < p < z) Note: table->lcl_head is used to head an *actual* or *possible* sequence within the list (such as a...j) that is not directly headed by table->last_line Note: we may receive duplicate entries from 'decode_line_info'. */ if (!table->last_line || new_line_sorts_after (info, table->last_line)) { /* Normal case: add 'info' to the beginning of the list */ info->prev_line = table->last_line; table->last_line = info; /* lcl_head: initialize to head a *possible* sequence at the end. */ if (!table->lcl_head) table->lcl_head = info; } else if (!new_line_sorts_after (info, table->lcl_head) && (!table->lcl_head->prev_line || new_line_sorts_after (info, table->lcl_head->prev_line))) { /* Abnormal but easy: lcl_head is the head of 'info'. */ info->prev_line = table->lcl_head->prev_line; table->lcl_head->prev_line = info; } else { /* Abnormal and hard: Neither 'last_line' nor 'lcl_head' are valid heads for 'info'. Reset 'lcl_head'. */ struct line_info* li2 = table->last_line; /* always non-NULL */ struct line_info* li1 = li2->prev_line; while (li1) { if (!new_line_sorts_after (info, li2) && new_line_sorts_after (info, li1)) break; li2 = li1; /* always non-NULL */ li1 = li1->prev_line; } table->lcl_head = li2; info->prev_line = table->lcl_head->prev_line; table->lcl_head->prev_line = info; } } /* Extract a fully qualified filename from a line info table. The returned string has been malloc'ed and it is the caller's responsibility to free it. */ static char * concat_filename (struct line_info_table *table, unsigned int file) { char *filename; if (file - 1 >= table->num_files) { /* FILE == 0 means unknown. */ if (file) (*_bfd_error_handler) (_("Dwarf Error: mangled line number section (bad file number).")); return strdup (""); } filename = table->files[file - 1].name; if (!IS_ABSOLUTE_PATH (filename)) { char *dirname = NULL; char *subdirname = NULL; char *name; size_t len; if (table->files[file - 1].dir) subdirname = table->dirs[table->files[file - 1].dir - 1]; if (!subdirname || !IS_ABSOLUTE_PATH (subdirname)) dirname = table->comp_dir; if (!dirname) { dirname = subdirname; subdirname = NULL; } if (!dirname) return strdup (filename); len = strlen (dirname) + strlen (filename) + 2; if (subdirname) { len += strlen (subdirname) + 1; name = bfd_malloc (len); if (name) sprintf (name, "%s/%s/%s", dirname, subdirname, filename); } else { name = bfd_malloc (len); if (name) sprintf (name, "%s/%s", dirname, filename); } return name; } return strdup (filename); } static void arange_add (bfd *abfd, struct arange *first_arange, bfd_vma low_pc, bfd_vma high_pc) { struct arange *arange; /* If the first arange is empty, use it. */ if (first_arange->high == 0) { first_arange->low = low_pc; first_arange->high = high_pc; return; } /* Next see if we can cheaply extend an existing range. */ arange = first_arange; do { if (low_pc == arange->high) { arange->high = high_pc; return; } if (high_pc == arange->low) { arange->low = low_pc; return; } arange = arange->next; } while (arange); /* Need to allocate a new arange and insert it into the arange list. Order isn't significant, so just insert after the first arange. */ arange = bfd_zalloc (abfd, sizeof (*arange)); arange->low = low_pc; arange->high = high_pc; arange->next = first_arange->next; first_arange->next = arange; } /* Decode the line number information for UNIT. */ static struct line_info_table* decode_line_info (struct comp_unit *unit, struct dwarf2_debug *stash) { bfd *abfd = unit->abfd; struct line_info_table* table; bfd_byte *line_ptr; bfd_byte *line_end; struct line_head lh; unsigned int i, bytes_read, offset_size; char *cur_file, *cur_dir; unsigned char op_code, extended_op, adj_opcode; bfd_size_type amt; if (! stash->dwarf_line_buffer) { asection *msec; msec = bfd_get_section_by_name (abfd, ".debug_line"); if (! msec) { (*_bfd_error_handler) (_("Dwarf Error: Can't find .debug_line section.")); bfd_set_error (bfd_error_bad_value); return 0; } stash->dwarf_line_size = msec->size; stash->dwarf_line_buffer = bfd_simple_get_relocated_section_contents (abfd, msec, NULL, stash->syms); if (! stash->dwarf_line_buffer) return 0; } /* It is possible to get a bad value for the line_offset. Validate it here so that we won't get a segfault below. */ if (unit->line_offset >= stash->dwarf_line_size) { (*_bfd_error_handler) (_("Dwarf Error: Line offset (%lu) greater than or equal to .debug_line size (%lu)."), unit->line_offset, stash->dwarf_line_size); bfd_set_error (bfd_error_bad_value); return 0; } amt = sizeof (struct line_info_table); table = bfd_alloc (abfd, amt); table->abfd = abfd; table->comp_dir = unit->comp_dir; table->num_files = 0; table->files = NULL; table->num_dirs = 0; table->dirs = NULL; table->files = NULL; table->last_line = NULL; table->lcl_head = NULL; line_ptr = stash->dwarf_line_buffer + unit->line_offset; /* Read in the prologue. */ lh.total_length = read_4_bytes (abfd, line_ptr); line_ptr += 4; offset_size = 4; if (lh.total_length == 0xffffffff) { lh.total_length = read_8_bytes (abfd, line_ptr); line_ptr += 8; offset_size = 8; } else if (lh.total_length == 0 && unit->addr_size == 8) { /* Handle (non-standard) 64-bit DWARF2 formats. */ lh.total_length = read_4_bytes (abfd, line_ptr); line_ptr += 4; offset_size = 8; } line_end = line_ptr + lh.total_length; lh.version = read_2_bytes (abfd, line_ptr); line_ptr += 2; if (offset_size == 4) lh.prologue_length = read_4_bytes (abfd, line_ptr); else lh.prologue_length = read_8_bytes (abfd, line_ptr); line_ptr += offset_size; lh.minimum_instruction_length = read_1_byte (abfd, line_ptr); line_ptr += 1; lh.default_is_stmt = read_1_byte (abfd, line_ptr); line_ptr += 1; lh.line_base = read_1_signed_byte (abfd, line_ptr); line_ptr += 1; lh.line_range = read_1_byte (abfd, line_ptr); line_ptr += 1; lh.opcode_base = read_1_byte (abfd, line_ptr); line_ptr += 1; amt = lh.opcode_base * sizeof (unsigned char); lh.standard_opcode_lengths = bfd_alloc (abfd, amt); lh.standard_opcode_lengths[0] = 1; for (i = 1; i < lh.opcode_base; ++i) { lh.standard_opcode_lengths[i] = read_1_byte (abfd, line_ptr); line_ptr += 1; } /* Read directory table. */ while ((cur_dir = read_string (abfd, line_ptr, &bytes_read)) != NULL) { line_ptr += bytes_read; if ((table->num_dirs % DIR_ALLOC_CHUNK) == 0) { char **tmp; amt = table->num_dirs + DIR_ALLOC_CHUNK; amt *= sizeof (char *); tmp = bfd_realloc (table->dirs, amt); if (tmp == NULL) { free (table->dirs); return NULL; } table->dirs = tmp; } table->dirs[table->num_dirs++] = cur_dir; } line_ptr += bytes_read; /* Read file name table. */ while ((cur_file = read_string (abfd, line_ptr, &bytes_read)) != NULL) { line_ptr += bytes_read; if ((table->num_files % FILE_ALLOC_CHUNK) == 0) { struct fileinfo *tmp; amt = table->num_files + FILE_ALLOC_CHUNK; amt *= sizeof (struct fileinfo); tmp = bfd_realloc (table->files, amt); if (tmp == NULL) { free (table->files); free (table->dirs); return NULL; } table->files = tmp; } table->files[table->num_files].name = cur_file; table->files[table->num_files].dir = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; table->files[table->num_files].time = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; table->files[table->num_files].size = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; table->num_files++; } line_ptr += bytes_read; /* Read the statement sequences until there's nothing left. */ while (line_ptr < line_end) { /* State machine registers. */ bfd_vma address = 0; char * filename = table->num_files ? concat_filename (table, 1) : NULL; unsigned int line = 1; unsigned int column = 0; int is_stmt = lh.default_is_stmt; int end_sequence = 0; /* eraxxon@alumni.rice.edu: Against the DWARF2 specs, some compilers generate address sequences that are wildly out of order using DW_LNE_set_address (e.g. Intel C++ 6.0 compiler for ia64-Linux). Thus, to determine the low and high address, we must compare on every DW_LNS_copy, etc. */ bfd_vma low_pc = (bfd_vma) -1; bfd_vma high_pc = 0; /* Decode the table. */ while (! end_sequence) { op_code = read_1_byte (abfd, line_ptr); line_ptr += 1; if (op_code >= lh.opcode_base) { /* Special operand. */ adj_opcode = op_code - lh.opcode_base; address += (adj_opcode / lh.line_range) * lh.minimum_instruction_length; line += lh.line_base + (adj_opcode % lh.line_range); /* Append row to matrix using current values. */ add_line_info (table, address, filename, line, column, 0); if (address < low_pc) low_pc = address; if (address > high_pc) high_pc = address; } else switch (op_code) { case DW_LNS_extended_op: /* Ignore length. */ line_ptr += 1; extended_op = read_1_byte (abfd, line_ptr); line_ptr += 1; switch (extended_op) { case DW_LNE_end_sequence: end_sequence = 1; add_line_info (table, address, filename, line, column, end_sequence); if (address < low_pc) low_pc = address; if (address > high_pc) high_pc = address; arange_add (unit->abfd, &unit->arange, low_pc, high_pc); break; case DW_LNE_set_address: address = read_address (unit, line_ptr); line_ptr += unit->addr_size; break; case DW_LNE_define_file: cur_file = read_string (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; if ((table->num_files % FILE_ALLOC_CHUNK) == 0) { struct fileinfo *tmp; amt = table->num_files + FILE_ALLOC_CHUNK; amt *= sizeof (struct fileinfo); tmp = bfd_realloc (table->files, amt); if (tmp == NULL) { free (table->files); free (table->dirs); free (filename); return NULL; } table->files = tmp; } table->files[table->num_files].name = cur_file; table->files[table->num_files].dir = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; table->files[table->num_files].time = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; table->files[table->num_files].size = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; table->num_files++; break; default: (*_bfd_error_handler) (_("Dwarf Error: mangled line number section.")); bfd_set_error (bfd_error_bad_value); free (filename); free (table->files); free (table->dirs); return NULL; } break; case DW_LNS_copy: add_line_info (table, address, filename, line, column, 0); if (address < low_pc) low_pc = address; if (address > high_pc) high_pc = address; break; case DW_LNS_advance_pc: address += lh.minimum_instruction_length * read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; break; case DW_LNS_advance_line: line += read_signed_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; break; case DW_LNS_set_file: { unsigned int file; /* The file and directory tables are 0 based, the references are 1 based. */ file = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; if (filename) free (filename); filename = concat_filename (table, file); break; } case DW_LNS_set_column: column = read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; break; case DW_LNS_negate_stmt: is_stmt = (!is_stmt); break; case DW_LNS_set_basic_block: break; case DW_LNS_const_add_pc: address += lh.minimum_instruction_length * ((255 - lh.opcode_base) / lh.line_range); break; case DW_LNS_fixed_advance_pc: address += read_2_bytes (abfd, line_ptr); line_ptr += 2; break; default: { int i; /* Unknown standard opcode, ignore it. */ for (i = 0; i < lh.standard_opcode_lengths[op_code]; i++) { (void) read_unsigned_leb128 (abfd, line_ptr, &bytes_read); line_ptr += bytes_read; } } } } if (filename) free (filename); } return table; } /* If ADDR is within TABLE set the output parameters and return TRUE, otherwise return FALSE. The output parameters, FILENAME_PTR and LINENUMBER_PTR, are pointers to the objects to be filled in. */ static bfd_boolean lookup_address_in_line_info_table (struct line_info_table *table, bfd_vma addr, struct funcinfo *function, const char **filename_ptr, unsigned int *linenumber_ptr) { /* Note: table->last_line should be a descendingly sorted list. */ struct line_info* next_line = table->last_line; struct line_info* each_line = NULL; *filename_ptr = NULL; if (!next_line) return FALSE; each_line = next_line->prev_line; /* Check for large addresses */ if (addr > next_line->address) each_line = NULL; /* ensure we skip over the normal case */ /* Normal case: search the list; save */ while (each_line && next_line) { /* If we have an address match, save this info. This allows us to return as good as results as possible for strange debugging info. */ bfd_boolean addr_match = FALSE; if (each_line->address <= addr && addr < next_line->address) { addr_match = TRUE; /* If this line appears to span functions, and addr is in the later function, return the first line of that function instead of the last line of the earlier one. This check is for GCC 2.95, which emits the first line number for a function late. */ if (function != NULL) { bfd_vma lowest_pc; struct arange *arange; /* Find the lowest address in the function's range list */ lowest_pc = function->arange.low; for (arange = &function->arange; arange; arange = arange->next) { if (function->arange.low < lowest_pc) lowest_pc = function->arange.low; } /* Check for spanning function and set outgoing line info */ if (addr >= lowest_pc && each_line->address < lowest_pc && next_line->address > lowest_pc) { *filename_ptr = next_line->filename; *linenumber_ptr = next_line->line; } else { *filename_ptr = each_line->filename; *linenumber_ptr = each_line->line; } } else { *filename_ptr = each_line->filename; *linenumber_ptr = each_line->line; } } if (addr_match && !each_line->end_sequence) return TRUE; /* we have definitely found what we want */ next_line = each_line; each_line = each_line->prev_line; } /* At this point each_line is NULL but next_line is not. If we found a candidate end-of-sequence point in the loop above, we can return that (compatibility with a bug in the Intel compiler); otherwise, assuming that we found the containing function for this address in this compilation unit, return the first line we have a number for (compatibility with GCC 2.95). */ if (*filename_ptr == NULL && function != NULL) { *filename_ptr = next_line->filename; *linenumber_ptr = next_line->line; return TRUE; } return FALSE; } /* Read in the .debug_ranges section for future reference */ static bfd_boolean read_debug_ranges (struct comp_unit *unit) { struct dwarf2_debug *stash = unit->stash; if (! stash->dwarf_ranges_buffer) { bfd *abfd = unit->abfd; asection *msec; msec = bfd_get_section_by_name (abfd, ".debug_ranges"); if (! msec) { (*_bfd_error_handler) (_("Dwarf Error: Can't find .debug_ranges section.")); bfd_set_error (bfd_error_bad_value); return FALSE; } stash->dwarf_ranges_size = msec->size; stash->dwarf_ranges_buffer = bfd_simple_get_relocated_section_contents (abfd, msec, NULL, stash->syms); if (! stash->dwarf_ranges_buffer) return FALSE; } return TRUE; } /* Function table functions. */ /* If ADDR is within TABLE, set FUNCTIONNAME_PTR, and return TRUE. Note that we need to find the function that has the smallest range that contains ADDR, to handle inlined functions without depending upon them being ordered in TABLE by increasing range. */ static bfd_boolean lookup_address_in_function_table (struct comp_unit *unit, bfd_vma addr, struct funcinfo **function_ptr, const char **functionname_ptr) { struct funcinfo* each_func; struct funcinfo* best_fit = NULL; struct arange *arange; for (each_func = unit->function_table; each_func; each_func = each_func->prev_func) { for (arange = &each_func->arange; arange; arange = arange->next) { if (addr >= arange->low && addr < arange->high) { if (!best_fit || ((arange->high - arange->low) < (best_fit->arange.high - best_fit->arange.low))) best_fit = each_func; } } } if (best_fit) { *functionname_ptr = best_fit->name; *function_ptr = best_fit; return TRUE; } else { return FALSE; } } /* If SYM at ADDR is within function table of UNIT, set FILENAME_PTR and LINENUMBER_PTR, and return TRUE. */ static bfd_boolean lookup_symbol_in_function_table (struct comp_unit *unit, asymbol *sym, bfd_vma addr, const char **filename_ptr, unsigned int *linenumber_ptr) { struct funcinfo* each_func; struct funcinfo* best_fit = NULL; struct arange *arange; const char *name = bfd_asymbol_name (sym); asection *sec = bfd_get_section (sym); for (each_func = unit->function_table; each_func; each_func = each_func->prev_func) { for (arange = &each_func->arange; arange; arange = arange->next) { if ((!each_func->sec || each_func->sec == sec) && addr >= arange->low && addr < arange->high && each_func->name && strcmp (name, each_func->name) == 0 && (!best_fit || ((arange->high - arange->low) < (best_fit->arange.high - best_fit->arange.low)))) best_fit = each_func; } } if (best_fit) { best_fit->sec = sec; *filename_ptr = best_fit->file; *linenumber_ptr = best_fit->line; return TRUE; } else return FALSE; } /* Variable table functions. */ /* If SYM is within variable table of UNIT, set FILENAME_PTR and LINENUMBER_PTR, and return TRUE. */ static bfd_boolean lookup_symbol_in_variable_table (struct comp_unit *unit, asymbol *sym, bfd_vma addr, const char **filename_ptr, unsigned int *linenumber_ptr) { const char *name = bfd_asymbol_name (sym); asection *sec = bfd_get_section (sym); struct varinfo* each; for (each = unit->variable_table; each; each = each->prev_var) if (each->stack == 0 && each->file != NULL && each->name != NULL && each->addr == addr && (!each->sec || each->sec == sec) && strcmp (name, each->name) == 0) break; if (each) { each->sec = sec; *filename_ptr = each->file; *linenumber_ptr = each->line; return TRUE; } else return FALSE; } static char * find_abstract_instance_name (struct comp_unit *unit, bfd_uint64_t die_ref) { bfd *abfd = unit->abfd; bfd_byte *info_ptr; unsigned int abbrev_number, bytes_read, i; struct abbrev_info *abbrev; struct attribute attr; char *name = 0; info_ptr = unit->info_ptr_unit + die_ref; abbrev_number = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); info_ptr += bytes_read; if (abbrev_number) { abbrev = lookup_abbrev (abbrev_number, unit->abbrevs); if (! abbrev) { (*_bfd_error_handler) (_("Dwarf Error: Could not find abbrev number %u."), abbrev_number); bfd_set_error (bfd_error_bad_value); } else { for (i = 0; i < abbrev->num_attrs; ++i) { info_ptr = read_attribute (&attr, &abbrev->attrs[i], unit, info_ptr); switch (attr.name) { case DW_AT_name: /* Prefer DW_AT_MIPS_linkage_name over DW_AT_name. */ if (name == NULL) name = attr.u.str; break; case DW_AT_specification: name = find_abstract_instance_name (unit, attr.u.val); break; case DW_AT_MIPS_linkage_name: name = attr.u.str; break; default: break; } } } } return (name); } static void read_rangelist (struct comp_unit *unit, struct arange *arange, bfd_uint64_t offset) { bfd_byte *ranges_ptr; bfd_vma base_address = unit->base_address; if (! unit->stash->dwarf_ranges_buffer) { if (! read_debug_ranges (unit)) return; } ranges_ptr = unit->stash->dwarf_ranges_buffer + offset; for (;;) { bfd_vma low_pc; bfd_vma high_pc; if (unit->addr_size == 4) { low_pc = read_4_bytes (unit->abfd, ranges_ptr); ranges_ptr += 4; high_pc = read_4_bytes (unit->abfd, ranges_ptr); ranges_ptr += 4; } else { low_pc = read_8_bytes (unit->abfd, ranges_ptr); ranges_ptr += 8; high_pc = read_8_bytes (unit->abfd, ranges_ptr); ranges_ptr += 8; } if (low_pc == 0 && high_pc == 0) break; if (low_pc == -1UL && high_pc != -1UL) base_address = high_pc; else arange_add (unit->abfd, arange, base_address + low_pc, base_address + high_pc); } } /* DWARF2 Compilation unit functions. */ /* Scan over each die in a comp. unit looking for functions to add to the function table and variables to the variable table. */ static bfd_boolean scan_unit_for_symbols (struct comp_unit *unit) { bfd *abfd = unit->abfd; bfd_byte *info_ptr = unit->first_child_die_ptr; int nesting_level = 1; struct funcinfo **nested_funcs; int nested_funcs_size; /* Maintain a stack of in-scope functions and inlined functions, which we can use to set the caller_func field. */ nested_funcs_size = 32; nested_funcs = bfd_malloc (nested_funcs_size * sizeof (struct funcinfo *)); if (nested_funcs == NULL) return FALSE; nested_funcs[nesting_level] = 0; while (nesting_level) { unsigned int abbrev_number, bytes_read, i; struct abbrev_info *abbrev; struct attribute attr; struct funcinfo *func; struct varinfo *var; bfd_vma low_pc = 0; bfd_vma high_pc = 0; abbrev_number = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); info_ptr += bytes_read; if (! abbrev_number) { nesting_level--; continue; } abbrev = lookup_abbrev (abbrev_number,unit->abbrevs); if (! abbrev) { (*_bfd_error_handler) (_("Dwarf Error: Could not find abbrev number %u."), abbrev_number); bfd_set_error (bfd_error_bad_value); free (nested_funcs); return FALSE; } var = NULL; if (abbrev->tag == DW_TAG_subprogram || abbrev->tag == DW_TAG_entry_point || abbrev->tag == DW_TAG_inlined_subroutine) { bfd_size_type amt = sizeof (struct funcinfo); func = bfd_zalloc (abfd, amt); func->tag = abbrev->tag; func->prev_func = unit->function_table; unit->function_table = func; if (func->tag == DW_TAG_inlined_subroutine) for (i = nesting_level - 1; i >= 1; i--) if (nested_funcs[i]) { func->caller_func = nested_funcs[i]; break; } nested_funcs[nesting_level] = func; } else { func = NULL; if (abbrev->tag == DW_TAG_variable) { bfd_size_type amt = sizeof (struct varinfo); var = bfd_zalloc (abfd, amt); var->tag = abbrev->tag; var->stack = 1; var->prev_var = unit->variable_table; unit->variable_table = var; } /* No inline function in scope at this nesting level. */ nested_funcs[nesting_level] = 0; } for (i = 0; i < abbrev->num_attrs; ++i) { info_ptr = read_attribute (&attr, &abbrev->attrs[i], unit, info_ptr); if (func) { switch (attr.name) { case DW_AT_call_file: func->caller_file = concat_filename (unit->line_table, attr.u.val); break; case DW_AT_call_line: func->caller_line = attr.u.val; break; case DW_AT_abstract_origin: func->name = find_abstract_instance_name (unit, attr.u.val); break; case DW_AT_name: /* Prefer DW_AT_MIPS_linkage_name over DW_AT_name. */ if (func->name == NULL) func->name = attr.u.str; break; case DW_AT_MIPS_linkage_name: func->name = attr.u.str; break; case DW_AT_low_pc: low_pc = attr.u.val; break; case DW_AT_high_pc: high_pc = attr.u.val; break; case DW_AT_ranges: read_rangelist (unit, &func->arange, attr.u.val); break; case DW_AT_decl_file: func->file = concat_filename (unit->line_table, attr.u.val); break; case DW_AT_decl_line: func->line = attr.u.val; break; default: break; } } else if (var) { switch (attr.name) { case DW_AT_name: var->name = attr.u.str; break; case DW_AT_decl_file: var->file = concat_filename (unit->line_table, attr.u.val); break; case DW_AT_decl_line: var->line = attr.u.val; break; case DW_AT_external: if (attr.u.val != 0) var->stack = 0; break; case DW_AT_location: switch (attr.form) { case DW_FORM_block: case DW_FORM_block1: case DW_FORM_block2: case DW_FORM_block4: if (*attr.u.blk->data == DW_OP_addr) { var->stack = 0; /* Verify that DW_OP_addr is the only opcode in the location, in which case the block size will be 1 plus the address size. */ /* ??? For TLS variables, gcc can emit DW_OP_addr DW_OP_GNU_push_tls_address which we don't handle here yet. */ if (attr.u.blk->size == unit->addr_size + 1U) var->addr = bfd_get (unit->addr_size * 8, unit->abfd, attr.u.blk->data + 1); } break; default: break; } break; default: break; } } } if (func && high_pc != 0) { arange_add (unit->abfd, &func->arange, low_pc, high_pc); } if (abbrev->has_children) { nesting_level++; if (nesting_level >= nested_funcs_size) { struct funcinfo **tmp; nested_funcs_size *= 2; tmp = bfd_realloc (nested_funcs, (nested_funcs_size * sizeof (struct funcinfo *))); if (tmp == NULL) { free (nested_funcs); return FALSE; } nested_funcs = tmp; } nested_funcs[nesting_level] = 0; } } free (nested_funcs); return TRUE; } /* Parse a DWARF2 compilation unit starting at INFO_PTR. This includes the compilation unit header that proceeds the DIE's, but does not include the length field that precedes each compilation unit header. END_PTR points one past the end of this comp unit. OFFSET_SIZE is the size of DWARF2 offsets (either 4 or 8 bytes). This routine does not read the whole compilation unit; only enough to get to the line number information for the compilation unit. */ static struct comp_unit * parse_comp_unit (struct dwarf2_debug *stash, bfd_vma unit_length, bfd_byte *info_ptr_unit, unsigned int offset_size) { struct comp_unit* unit; unsigned int version; bfd_uint64_t abbrev_offset = 0; unsigned int addr_size; struct abbrev_info** abbrevs; unsigned int abbrev_number, bytes_read, i; struct abbrev_info *abbrev; struct attribute attr; bfd_byte *info_ptr = stash->info_ptr; bfd_byte *end_ptr = info_ptr + unit_length; bfd_size_type amt; bfd_vma low_pc = 0; bfd_vma high_pc = 0; bfd *abfd = stash->bfd; version = read_2_bytes (abfd, info_ptr); info_ptr += 2; BFD_ASSERT (offset_size == 4 || offset_size == 8); if (offset_size == 4) abbrev_offset = read_4_bytes (abfd, info_ptr); else abbrev_offset = read_8_bytes (abfd, info_ptr); info_ptr += offset_size; addr_size = read_1_byte (abfd, info_ptr); info_ptr += 1; if (version != 2) { (*_bfd_error_handler) (_("Dwarf Error: found dwarf version '%u', this reader only handles version 2 information."), version); bfd_set_error (bfd_error_bad_value); return 0; } if (addr_size > sizeof (bfd_vma)) { (*_bfd_error_handler) (_("Dwarf Error: found address size '%u', this reader can not handle sizes greater than '%u'."), addr_size, (unsigned int) sizeof (bfd_vma)); bfd_set_error (bfd_error_bad_value); return 0; } if (addr_size != 2 && addr_size != 4 && addr_size != 8) { (*_bfd_error_handler) ("Dwarf Error: found address size '%u', this reader can only handle address sizes '2', '4' and '8'.", addr_size); bfd_set_error (bfd_error_bad_value); return 0; } /* Read the abbrevs for this compilation unit into a table. */ abbrevs = read_abbrevs (abfd, abbrev_offset, stash); if (! abbrevs) return 0; abbrev_number = read_unsigned_leb128 (abfd, info_ptr, &bytes_read); info_ptr += bytes_read; if (! abbrev_number) { (*_bfd_error_handler) (_("Dwarf Error: Bad abbrev number: %u."), abbrev_number); bfd_set_error (bfd_error_bad_value); return 0; } abbrev = lookup_abbrev (abbrev_number, abbrevs); if (! abbrev) { (*_bfd_error_handler) (_("Dwarf Error: Could not find abbrev number %u."), abbrev_number); bfd_set_error (bfd_error_bad_value); return 0; } amt = sizeof (struct comp_unit); unit = bfd_zalloc (abfd, amt); unit->abfd = abfd; unit->addr_size = addr_size; unit->offset_size = offset_size; unit->abbrevs = abbrevs; unit->end_ptr = end_ptr; unit->stash = stash; unit->info_ptr_unit = info_ptr_unit; for (i = 0; i < abbrev->num_attrs; ++i) { info_ptr = read_attribute (&attr, &abbrev->attrs[i], unit, info_ptr); /* Store the data if it is of an attribute we want to keep in a partial symbol table. */ switch (attr.name) { case DW_AT_stmt_list: unit->stmtlist = 1; unit->line_offset = attr.u.val; break; case DW_AT_name: unit->name = attr.u.str; break; case DW_AT_low_pc: low_pc = attr.u.val; /* If the compilation unit DIE has a DW_AT_low_pc attribute, this is the base address to use when reading location lists or range lists. */ unit->base_address = low_pc; break; case DW_AT_high_pc: high_pc = attr.u.val; break; case DW_AT_ranges: read_rangelist (unit, &unit->arange, attr.u.val); break; case DW_AT_comp_dir: { char *comp_dir = attr.u.str; if (comp_dir) { /* Irix 6.2 native cc prepends .: to the compilation directory, get rid of it. */ char *cp = strchr (comp_dir, ':'); if (cp && cp != comp_dir && cp[-1] == '.' && cp[1] == '/') comp_dir = cp + 1; } unit->comp_dir = comp_dir; break; } default: break; } } if (high_pc != 0) { arange_add (unit->abfd, &unit->arange, low_pc, high_pc); } unit->first_child_die_ptr = info_ptr; return unit; } /* Return TRUE if UNIT may contain the address given by ADDR. When there are functions written entirely with inline asm statements, the range info in the compilation unit header may not be correct. We need to consult the line info table to see if a compilation unit really contains the given address. */ static bfd_boolean comp_unit_contains_address (struct comp_unit *unit, bfd_vma addr) { struct arange *arange; if (unit->error) return FALSE; arange = &unit->arange; do { if (addr >= arange->low && addr < arange->high) return TRUE; arange = arange->next; } while (arange); return FALSE; } /* If UNIT contains ADDR, set the output parameters to the values for the line containing ADDR. The output parameters, FILENAME_PTR, FUNCTIONNAME_PTR, and LINENUMBER_PTR, are pointers to the objects to be filled in. Return TRUE if UNIT contains ADDR, and no errors were encountered; FALSE otherwise. */ static bfd_boolean comp_unit_find_nearest_line (struct comp_unit *unit, bfd_vma addr, const char **filename_ptr, const char **functionname_ptr, unsigned int *linenumber_ptr, struct dwarf2_debug *stash) { bfd_boolean line_p; bfd_boolean func_p; struct funcinfo *function; if (unit->error) return FALSE; if (! unit->line_table) { if (! unit->stmtlist) { unit->error = 1; return FALSE; } unit->line_table = decode_line_info (unit, stash); if (! unit->line_table) { unit->error = 1; return FALSE; } if (unit->first_child_die_ptr < unit->end_ptr && ! scan_unit_for_symbols (unit)) { unit->error = 1; return FALSE; } } function = NULL; func_p = lookup_address_in_function_table (unit, addr, &function, functionname_ptr); if (func_p && (function->tag == DW_TAG_inlined_subroutine)) stash->inliner_chain = function; line_p = lookup_address_in_line_info_table (unit->line_table, addr, function, filename_ptr, linenumber_ptr); return line_p || func_p; } /* If UNIT contains SYM at ADDR, set the output parameters to the values for the line containing SYM. The output parameters, FILENAME_PTR, and LINENUMBER_PTR, are pointers to the objects to be filled in. Return TRUE if UNIT contains SYM, and no errors were encountered; FALSE otherwise. */ static bfd_boolean comp_unit_find_line (struct comp_unit *unit, asymbol *sym, bfd_vma addr, const char **filename_ptr, unsigned int *linenumber_ptr, struct dwarf2_debug *stash) { if (unit->error) return FALSE; if (! unit->line_table) { if (! unit->stmtlist) { unit->error = 1; return FALSE; } unit->line_table = decode_line_info (unit, stash); if (! unit->line_table) { unit->error = 1; return FALSE; } if (unit->first_child_die_ptr < unit->end_ptr && ! scan_unit_for_symbols (unit)) { unit->error = 1; return FALSE; } } if (sym->flags & BSF_FUNCTION) return lookup_symbol_in_function_table (unit, sym, addr, filename_ptr, linenumber_ptr); else return lookup_symbol_in_variable_table (unit, sym, addr, filename_ptr, linenumber_ptr); } /* Locate a section in a BFD containing debugging info. The search starts from the section after AFTER_SEC, or from the first section in the BFD if AFTER_SEC is NULL. The search works by examining the names of the sections. There are two permissiable names. The first is .debug_info. This is the standard DWARF2 name. The second is a prefix .gnu.linkonce.wi. This is a variation on the .debug_info section which has a checksum describing the contents appended onto the name. This allows the linker to identify and discard duplicate debugging sections for different compilation units. */ #define DWARF2_DEBUG_INFO ".debug_info" #define GNU_LINKONCE_INFO ".gnu.linkonce.wi." static asection * find_debug_info (bfd *abfd, asection *after_sec) { asection * msec; msec = after_sec != NULL ? after_sec->next : abfd->sections; while (msec) { if (strcmp (msec->name, DWARF2_DEBUG_INFO) == 0) return msec; if (CONST_STRNEQ (msec->name, GNU_LINKONCE_INFO)) return msec; msec = msec->next; } return NULL; } /* Unset vmas for loadable sections in STASH. */ static void unset_sections (struct dwarf2_debug *stash) { unsigned int i; struct loadable_section *p; i = stash->loadable_section_count; p = stash->loadable_sections; for (; i > 0; i--, p++) p->section->vma = 0; } /* Set unique vmas for loadable sections in ABFD and save vmas in STASH for unset_sections. */ static bfd_boolean place_sections (bfd *abfd, struct dwarf2_debug *stash) { struct loadable_section *p; unsigned int i; if (stash->loadable_section_count != 0) { i = stash->loadable_section_count; p = stash->loadable_sections; for (; i > 0; i--, p++) p->section->vma = p->adj_vma; } else { asection *sect; bfd_vma last_vma = 0; bfd_size_type amt; struct loadable_section *p; i = 0; for (sect = abfd->sections; sect != NULL; sect = sect->next) { bfd_size_type sz; if (sect->vma != 0 || (sect->flags & SEC_LOAD) == 0) continue; sz = sect->rawsize ? sect->rawsize : sect->size; if (sz == 0) continue; i++; } amt = i * sizeof (struct loadable_section); p = (struct loadable_section *) bfd_zalloc (abfd, amt); if (! p) return FALSE; stash->loadable_sections = p; stash->loadable_section_count = i; for (sect = abfd->sections; sect != NULL; sect = sect->next) { bfd_size_type sz; if (sect->vma != 0 || (sect->flags & SEC_LOAD) == 0) continue; sz = sect->rawsize ? sect->rawsize : sect->size; if (sz == 0) continue; p->section = sect; if (last_vma != 0) { /* Align the new address to the current section alignment. */ last_vma = ((last_vma + ~((bfd_vma) -1 << sect->alignment_power)) & ((bfd_vma) -1 << sect->alignment_power)); sect->vma = last_vma; } p->adj_vma = sect->vma; last_vma += sect->vma + sz; p++; } } return TRUE; } /* Find the source code location of SYMBOL. If SYMBOL is NULL then find the nearest source code location corresponding to the address SECTION + OFFSET. Returns TRUE if the line is found without error and fills in FILENAME_PTR and LINENUMBER_PTR. In the case where SYMBOL was NULL the FUNCTIONNAME_PTR is also filled in. SYMBOLS contains the symbol table for ABFD. ADDR_SIZE is the number of bytes in the initial .debug_info length field and in the abbreviation offset, or zero to indicate that the default value should be used. */ static bfd_boolean find_line (bfd *abfd, asection *section, bfd_vma offset, asymbol *symbol, asymbol **symbols, const char **filename_ptr, const char **functionname_ptr, unsigned int *linenumber_ptr, unsigned int addr_size, void **pinfo) { /* Read each compilation unit from the section .debug_info, and check to see if it contains the address we are searching for. If yes, lookup the address, and return the line number info. If no, go on to the next compilation unit. We keep a list of all the previously read compilation units, and a pointer to the next un-read compilation unit. Check the previously read units before reading more. */ struct dwarf2_debug *stash; /* What address are we looking for? */ bfd_vma addr; struct comp_unit* each; bfd_vma found = FALSE; bfd_boolean do_line; stash = *pinfo; if (! stash) { bfd_size_type amt = sizeof (struct dwarf2_debug); stash = bfd_zalloc (abfd, amt); if (! stash) return FALSE; } /* In a relocatable file, 2 functions may have the same address. We change the section vma so that they won't overlap. */ if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0) { if (! place_sections (abfd, stash)) return FALSE; } do_line = (section == NULL && offset == 0 && functionname_ptr == NULL && symbol != NULL); if (do_line) { addr = symbol->value; section = bfd_get_section (symbol); } else if (section != NULL && functionname_ptr != NULL && symbol == NULL) addr = offset; else abort (); if (section->output_section) addr += section->output_section->vma + section->output_offset; else addr += section->vma; *filename_ptr = NULL; *functionname_ptr = NULL; *linenumber_ptr = 0; if (! *pinfo) { bfd *debug_bfd; bfd_size_type total_size; asection *msec; *pinfo = stash; msec = find_debug_info (abfd, NULL); if (msec == NULL) { char * debug_filename = bfd_follow_gnu_debuglink (abfd, DEBUGDIR); if (debug_filename == NULL) /* No dwarf2 info, and no gnu_debuglink to follow. Note that at this point the stash has been allocated, but contains zeros. This lets future calls to this function fail more quickly. */ goto done; if ((debug_bfd = bfd_openr (debug_filename, NULL)) == NULL || ! bfd_check_format (debug_bfd, bfd_object) || (msec = find_debug_info (debug_bfd, NULL)) == NULL) { if (debug_bfd) bfd_close (debug_bfd); /* FIXME: Should we report our failure to follow the debuglink ? */ free (debug_filename); goto done; } } else debug_bfd = abfd; /* There can be more than one DWARF2 info section in a BFD these days. Read them all in and produce one large stash. We do this in two passes - in the first pass we just accumulate the section sizes. In the second pass we read in the section's contents. The allows us to avoid reallocing the data as we add sections to the stash. */ for (total_size = 0; msec; msec = find_debug_info (debug_bfd, msec)) total_size += msec->size; stash->info_ptr = bfd_alloc (debug_bfd, total_size); if (stash->info_ptr == NULL) goto done; stash->info_ptr_end = stash->info_ptr; for (msec = find_debug_info (debug_bfd, NULL); msec; msec = find_debug_info (debug_bfd, msec)) { bfd_size_type size; bfd_size_type start; size = msec->size; if (size == 0) continue; start = stash->info_ptr_end - stash->info_ptr; if ((bfd_simple_get_relocated_section_contents (debug_bfd, msec, stash->info_ptr + start, symbols)) == NULL) continue; stash->info_ptr_end = stash->info_ptr + start + size; } BFD_ASSERT (stash->info_ptr_end == stash->info_ptr + total_size); stash->sec = find_debug_info (debug_bfd, NULL); stash->sec_info_ptr = stash->info_ptr; stash->syms = symbols; stash->bfd = debug_bfd; } /* A null info_ptr indicates that there is no dwarf2 info (or that an error occured while setting up the stash). */ if (! stash->info_ptr) goto done; stash->inliner_chain = NULL; /* Check the previously read comp. units first. */ for (each = stash->all_comp_units; each; each = each->next_unit) { if (do_line) found = (((symbol->flags & BSF_FUNCTION) == 0 || comp_unit_contains_address (each, addr)) && comp_unit_find_line (each, symbol, addr, filename_ptr, linenumber_ptr, stash)); else found = (comp_unit_contains_address (each, addr) && comp_unit_find_nearest_line (each, addr, filename_ptr, functionname_ptr, linenumber_ptr, stash)); if (found) goto done; } /* The DWARF2 spec says that the initial length field, and the offset of the abbreviation table, should both be 4-byte values. However, some compilers do things differently. */ if (addr_size == 0) addr_size = 4; BFD_ASSERT (addr_size == 4 || addr_size == 8); /* Read each remaining comp. units checking each as they are read. */ while (stash->info_ptr < stash->info_ptr_end) { bfd_vma length; unsigned int offset_size = addr_size; bfd_byte *info_ptr_unit = stash->info_ptr; length = read_4_bytes (stash->bfd, stash->info_ptr); /* A 0xffffff length is the DWARF3 way of indicating we use 64-bit offsets, instead of 32-bit offsets. */ if (length == 0xffffffff) { offset_size = 8; length = read_8_bytes (stash->bfd, stash->info_ptr + 4); stash->info_ptr += 12; } /* A zero length is the IRIX way of indicating 64-bit offsets, mostly because the 64-bit length will generally fit in 32 bits, and the endianness helps. */ else if (length == 0) { offset_size = 8; length = read_4_bytes (stash->bfd, stash->info_ptr + 4); stash->info_ptr += 8; } /* In the absence of the hints above, we assume 32-bit DWARF2 offsets even for targets with 64-bit addresses, because: a) most of the time these targets will not have generated more than 2Gb of debug info and so will not need 64-bit offsets, and b) if they do use 64-bit offsets but they are not using the size hints that are tested for above then they are not conforming to the DWARF3 standard anyway. */ else if (addr_size == 8) { offset_size = 4; stash->info_ptr += 4; } else stash->info_ptr += 4; if (length > 0) { each = parse_comp_unit (stash, length, info_ptr_unit, offset_size); stash->info_ptr += length; if ((bfd_vma) (stash->info_ptr - stash->sec_info_ptr) == stash->sec->size) { stash->sec = find_debug_info (stash->bfd, stash->sec); stash->sec_info_ptr = stash->info_ptr; } if (each) { each->next_unit = stash->all_comp_units; stash->all_comp_units = each; /* DW_AT_low_pc and DW_AT_high_pc are optional for compilation units. If we don't have them (i.e., unit->high == 0), we need to consult the line info table to see if a compilation unit contains the given address. */ if (do_line) found = (((symbol->flags & BSF_FUNCTION) == 0 || each->arange.high == 0 || comp_unit_contains_address (each, addr)) && comp_unit_find_line (each, symbol, addr, filename_ptr, linenumber_ptr, stash)); else found = ((each->arange.high == 0 || comp_unit_contains_address (each, addr)) && comp_unit_find_nearest_line (each, addr, filename_ptr, functionname_ptr, linenumber_ptr, stash)); if (found) goto done; } } } done: if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0) unset_sections (stash); return found; } /* The DWARF2 version of find_nearest_line. Return TRUE if the line is found without error. */ bfd_boolean _bfd_dwarf2_find_nearest_line (bfd *abfd, asection *section, asymbol **symbols, bfd_vma offset, const char **filename_ptr, const char **functionname_ptr, unsigned int *linenumber_ptr, unsigned int addr_size, void **pinfo) { return find_line (abfd, section, offset, NULL, symbols, filename_ptr, functionname_ptr, linenumber_ptr, addr_size, pinfo); } /* The DWARF2 version of find_line. Return TRUE if the line is found without error. */ bfd_boolean _bfd_dwarf2_find_line (bfd *abfd, asymbol **symbols, asymbol *symbol, const char **filename_ptr, unsigned int *linenumber_ptr, unsigned int addr_size, void **pinfo) { return find_line (abfd, NULL, 0, symbol, symbols, filename_ptr, NULL, linenumber_ptr, addr_size, pinfo); } bfd_boolean _bfd_dwarf2_find_inliner_info (bfd *abfd ATTRIBUTE_UNUSED, const char **filename_ptr, const char **functionname_ptr, unsigned int *linenumber_ptr, void **pinfo) { struct dwarf2_debug *stash; stash = *pinfo; if (stash) { struct funcinfo *func = stash->inliner_chain; if (func && func->caller_func) { *filename_ptr = func->caller_file; *functionname_ptr = func->caller_func->name; *linenumber_ptr = func->caller_line; stash->inliner_chain = func->caller_func; return TRUE; } } return FALSE; } void _bfd_dwarf2_cleanup_debug_info (bfd *abfd) { struct comp_unit *each; struct dwarf2_debug *stash; if (abfd == NULL || elf_tdata (abfd) == NULL) return; stash = elf_tdata (abfd)->dwarf2_find_line_info; if (stash == NULL) return; for (each = stash->all_comp_units; each; each = each->next_unit) { struct abbrev_info **abbrevs = each->abbrevs; size_t i; for (i = 0; i < ABBREV_HASH_SIZE; i++) { struct abbrev_info *abbrev = abbrevs[i]; while (abbrev) { free (abbrev->attrs); abbrev = abbrev->next; } } if (each->line_table) { free (each->line_table->dirs); free (each->line_table->files); } } free (stash->dwarf_abbrev_buffer); free (stash->dwarf_line_buffer); free (stash->dwarf_ranges_buffer); } Index: stable/9/contrib/binutils/binutils/dwarf.c =================================================================== --- stable/9/contrib/binutils/binutils/dwarf.c (revision 249039) +++ stable/9/contrib/binutils/binutils/dwarf.c (revision 249040) @@ -1,3797 +1,3803 @@ /* dwarf.c -- display DWARF contents of a BFD binary file Copyright 2005, 2006, 2007 Free Software Foundation, Inc. This file is part of GNU Binutils. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA. */ #include "sysdep.h" #include "libiberty.h" #include "bfd.h" #include "bucomm.h" #include "elf/dwarf2.h" #include "dwarf.h" static int have_frame_base; static int need_base_address; static unsigned int last_pointer_size = 0; static int warned_about_missing_comp_units = FALSE; static unsigned int num_debug_info_entries = 0; static debug_info *debug_information = NULL; dwarf_vma eh_addr_size; int is_relocatable; int do_debug_info; int do_debug_abbrevs; int do_debug_lines; int do_debug_pubnames; int do_debug_aranges; int do_debug_ranges; int do_debug_frames; int do_debug_frames_interp; int do_debug_macinfo; int do_debug_str; int do_debug_loc; dwarf_vma (*byte_get) (unsigned char *, int); dwarf_vma byte_get_little_endian (unsigned char *field, int size) { switch (size) { case 1: return *field; case 2: return ((unsigned int) (field[0])) | (((unsigned int) (field[1])) << 8); case 4: return ((unsigned long) (field[0])) | (((unsigned long) (field[1])) << 8) | (((unsigned long) (field[2])) << 16) | (((unsigned long) (field[3])) << 24); case 8: if (sizeof (dwarf_vma) == 8) return ((dwarf_vma) (field[0])) | (((dwarf_vma) (field[1])) << 8) | (((dwarf_vma) (field[2])) << 16) | (((dwarf_vma) (field[3])) << 24) | (((dwarf_vma) (field[4])) << 32) | (((dwarf_vma) (field[5])) << 40) | (((dwarf_vma) (field[6])) << 48) | (((dwarf_vma) (field[7])) << 56); else if (sizeof (dwarf_vma) == 4) /* We want to extract data from an 8 byte wide field and place it into a 4 byte wide field. Since this is a little endian source we can just use the 4 byte extraction code. */ return ((unsigned long) (field[0])) | (((unsigned long) (field[1])) << 8) | (((unsigned long) (field[2])) << 16) | (((unsigned long) (field[3])) << 24); default: error (_("Unhandled data length: %d\n"), size); abort (); } } dwarf_vma byte_get_big_endian (unsigned char *field, int size) { switch (size) { case 1: return *field; case 2: return ((unsigned int) (field[1])) | (((int) (field[0])) << 8); case 4: return ((unsigned long) (field[3])) | (((unsigned long) (field[2])) << 8) | (((unsigned long) (field[1])) << 16) | (((unsigned long) (field[0])) << 24); case 8: if (sizeof (dwarf_vma) == 8) return ((dwarf_vma) (field[7])) | (((dwarf_vma) (field[6])) << 8) | (((dwarf_vma) (field[5])) << 16) | (((dwarf_vma) (field[4])) << 24) | (((dwarf_vma) (field[3])) << 32) | (((dwarf_vma) (field[2])) << 40) | (((dwarf_vma) (field[1])) << 48) | (((dwarf_vma) (field[0])) << 56); else if (sizeof (dwarf_vma) == 4) { /* Although we are extracing data from an 8 byte wide field, we are returning only 4 bytes of data. */ field += 4; return ((unsigned long) (field[3])) | (((unsigned long) (field[2])) << 8) | (((unsigned long) (field[1])) << 16) | (((unsigned long) (field[0])) << 24); } default: error (_("Unhandled data length: %d\n"), size); abort (); } } static dwarf_vma byte_get_signed (unsigned char *field, int size) { dwarf_vma x = byte_get (field, size); switch (size) { case 1: return (x ^ 0x80) - 0x80; case 2: return (x ^ 0x8000) - 0x8000; case 4: return (x ^ 0x80000000) - 0x80000000; case 8: return x; default: abort (); } } static unsigned long int read_leb128 (unsigned char *data, unsigned int *length_return, int sign) { unsigned long int result = 0; unsigned int num_read = 0; unsigned int shift = 0; unsigned char byte; do { byte = *data++; num_read++; result |= ((unsigned long int) (byte & 0x7f)) << shift; shift += 7; } while (byte & 0x80); if (length_return != NULL) *length_return = num_read; if (sign && (shift < 8 * sizeof (result)) && (byte & 0x40)) result |= -1L << shift; return result; } typedef struct State_Machine_Registers { unsigned long address; unsigned int file; unsigned int line; unsigned int column; int is_stmt; int basic_block; int end_sequence; /* This variable hold the number of the last entry seen in the File Table. */ unsigned int last_file_entry; } SMR; static SMR state_machine_regs; static void reset_state_machine (int is_stmt) { state_machine_regs.address = 0; state_machine_regs.file = 1; state_machine_regs.line = 1; state_machine_regs.column = 0; state_machine_regs.is_stmt = is_stmt; state_machine_regs.basic_block = 0; state_machine_regs.end_sequence = 0; state_machine_regs.last_file_entry = 0; } /* Handled an extend line op. Returns the number of bytes read. */ static int process_extended_line_op (unsigned char *data, int is_stmt) { unsigned char op_code; unsigned int bytes_read; unsigned int len; unsigned char *name; unsigned long adr; len = read_leb128 (data, & bytes_read, 0); data += bytes_read; if (len == 0) { warn (_("badly formed extended line op encountered!\n")); return bytes_read; } len += bytes_read; op_code = *data++; printf (_(" Extended opcode %d: "), op_code); switch (op_code) { case DW_LNE_end_sequence: printf (_("End of Sequence\n\n")); reset_state_machine (is_stmt); break; case DW_LNE_set_address: adr = byte_get (data, len - bytes_read - 1); printf (_("set Address to 0x%lx\n"), adr); state_machine_regs.address = adr; break; case DW_LNE_define_file: printf (_(" define new File Table entry\n")); printf (_(" Entry\tDir\tTime\tSize\tName\n")); printf (_(" %d\t"), ++state_machine_regs.last_file_entry); name = data; data += strlen ((char *) data) + 1; printf (_("%lu\t"), read_leb128 (data, & bytes_read, 0)); data += bytes_read; printf (_("%lu\t"), read_leb128 (data, & bytes_read, 0)); data += bytes_read; printf (_("%lu\t"), read_leb128 (data, & bytes_read, 0)); printf (_("%s\n\n"), name); break; default: printf (_("UNKNOWN: length %d\n"), len - bytes_read); break; } return len; } static const char * fetch_indirect_string (unsigned long offset) { struct dwarf_section *section = &debug_displays [str].section; if (section->start == NULL) return _(""); /* DWARF sections under Mach-O have non-zero addresses. */ offset -= section->address; if (offset > section->size) { warn (_("DW_FORM_strp offset too big: %lx\n"), offset); return _(""); } return (const char *) section->start + offset; } /* FIXME: There are better and more efficient ways to handle these structures. For now though, I just want something that is simple to implement. */ typedef struct abbrev_attr { unsigned long attribute; unsigned long form; struct abbrev_attr *next; } abbrev_attr; typedef struct abbrev_entry { unsigned long entry; unsigned long tag; int children; struct abbrev_attr *first_attr; struct abbrev_attr *last_attr; struct abbrev_entry *next; } abbrev_entry; static abbrev_entry *first_abbrev = NULL; static abbrev_entry *last_abbrev = NULL; static void free_abbrevs (void) { abbrev_entry *abbrev; for (abbrev = first_abbrev; abbrev;) { abbrev_entry *next = abbrev->next; abbrev_attr *attr; for (attr = abbrev->first_attr; attr;) { abbrev_attr *next = attr->next; free (attr); attr = next; } free (abbrev); abbrev = next; } last_abbrev = first_abbrev = NULL; } static void add_abbrev (unsigned long number, unsigned long tag, int children) { abbrev_entry *entry; entry = malloc (sizeof (*entry)); if (entry == NULL) /* ugg */ return; entry->entry = number; entry->tag = tag; entry->children = children; entry->first_attr = NULL; entry->last_attr = NULL; entry->next = NULL; if (first_abbrev == NULL) first_abbrev = entry; else last_abbrev->next = entry; last_abbrev = entry; } static void add_abbrev_attr (unsigned long attribute, unsigned long form) { abbrev_attr *attr; attr = malloc (sizeof (*attr)); if (attr == NULL) /* ugg */ return; attr->attribute = attribute; attr->form = form; attr->next = NULL; if (last_abbrev->first_attr == NULL) last_abbrev->first_attr = attr; else last_abbrev->last_attr->next = attr; last_abbrev->last_attr = attr; } /* Processes the (partial) contents of a .debug_abbrev section. Returns NULL if the end of the section was encountered. Returns the address after the last byte read if the end of an abbreviation set was found. */ static unsigned char * process_abbrev_section (unsigned char *start, unsigned char *end) { if (first_abbrev != NULL) return NULL; while (start < end) { unsigned int bytes_read; unsigned long entry; unsigned long tag; unsigned long attribute; int children; entry = read_leb128 (start, & bytes_read, 0); start += bytes_read; /* A single zero is supposed to end the section according to the standard. If there's more, then signal that to the caller. */ if (entry == 0) return start == end ? NULL : start; tag = read_leb128 (start, & bytes_read, 0); start += bytes_read; children = *start++; add_abbrev (entry, tag, children); do { unsigned long form; attribute = read_leb128 (start, & bytes_read, 0); start += bytes_read; form = read_leb128 (start, & bytes_read, 0); start += bytes_read; if (attribute != 0) add_abbrev_attr (attribute, form); } while (attribute != 0); } return NULL; } static char * get_TAG_name (unsigned long tag) { switch (tag) { case DW_TAG_padding: return "DW_TAG_padding"; case DW_TAG_array_type: return "DW_TAG_array_type"; case DW_TAG_class_type: return "DW_TAG_class_type"; case DW_TAG_entry_point: return "DW_TAG_entry_point"; case DW_TAG_enumeration_type: return "DW_TAG_enumeration_type"; case DW_TAG_formal_parameter: return "DW_TAG_formal_parameter"; case DW_TAG_imported_declaration: return "DW_TAG_imported_declaration"; case DW_TAG_label: return "DW_TAG_label"; case DW_TAG_lexical_block: return "DW_TAG_lexical_block"; case DW_TAG_member: return "DW_TAG_member"; case DW_TAG_pointer_type: return "DW_TAG_pointer_type"; case DW_TAG_reference_type: return "DW_TAG_reference_type"; case DW_TAG_compile_unit: return "DW_TAG_compile_unit"; case DW_TAG_string_type: return "DW_TAG_string_type"; case DW_TAG_structure_type: return "DW_TAG_structure_type"; case DW_TAG_subroutine_type: return "DW_TAG_subroutine_type"; case DW_TAG_typedef: return "DW_TAG_typedef"; case DW_TAG_union_type: return "DW_TAG_union_type"; case DW_TAG_unspecified_parameters: return "DW_TAG_unspecified_parameters"; case DW_TAG_variant: return "DW_TAG_variant"; case DW_TAG_common_block: return "DW_TAG_common_block"; case DW_TAG_common_inclusion: return "DW_TAG_common_inclusion"; case DW_TAG_inheritance: return "DW_TAG_inheritance"; case DW_TAG_inlined_subroutine: return "DW_TAG_inlined_subroutine"; case DW_TAG_module: return "DW_TAG_module"; case DW_TAG_ptr_to_member_type: return "DW_TAG_ptr_to_member_type"; case DW_TAG_set_type: return "DW_TAG_set_type"; case DW_TAG_subrange_type: return "DW_TAG_subrange_type"; case DW_TAG_with_stmt: return "DW_TAG_with_stmt"; case DW_TAG_access_declaration: return "DW_TAG_access_declaration"; case DW_TAG_base_type: return "DW_TAG_base_type"; case DW_TAG_catch_block: return "DW_TAG_catch_block"; case DW_TAG_const_type: return "DW_TAG_const_type"; case DW_TAG_constant: return "DW_TAG_constant"; case DW_TAG_enumerator: return "DW_TAG_enumerator"; case DW_TAG_file_type: return "DW_TAG_file_type"; case DW_TAG_friend: return "DW_TAG_friend"; case DW_TAG_namelist: return "DW_TAG_namelist"; case DW_TAG_namelist_item: return "DW_TAG_namelist_item"; case DW_TAG_packed_type: return "DW_TAG_packed_type"; case DW_TAG_subprogram: return "DW_TAG_subprogram"; case DW_TAG_template_type_param: return "DW_TAG_template_type_param"; case DW_TAG_template_value_param: return "DW_TAG_template_value_param"; case DW_TAG_thrown_type: return "DW_TAG_thrown_type"; case DW_TAG_try_block: return "DW_TAG_try_block"; case DW_TAG_variant_part: return "DW_TAG_variant_part"; case DW_TAG_variable: return "DW_TAG_variable"; case DW_TAG_volatile_type: return "DW_TAG_volatile_type"; case DW_TAG_MIPS_loop: return "DW_TAG_MIPS_loop"; case DW_TAG_format_label: return "DW_TAG_format_label"; case DW_TAG_function_template: return "DW_TAG_function_template"; case DW_TAG_class_template: return "DW_TAG_class_template"; /* DWARF 2.1 values. */ case DW_TAG_dwarf_procedure: return "DW_TAG_dwarf_procedure"; case DW_TAG_restrict_type: return "DW_TAG_restrict_type"; case DW_TAG_interface_type: return "DW_TAG_interface_type"; case DW_TAG_namespace: return "DW_TAG_namespace"; case DW_TAG_imported_module: return "DW_TAG_imported_module"; case DW_TAG_unspecified_type: return "DW_TAG_unspecified_type"; case DW_TAG_partial_unit: return "DW_TAG_partial_unit"; case DW_TAG_imported_unit: return "DW_TAG_imported_unit"; /* UPC values. */ case DW_TAG_upc_shared_type: return "DW_TAG_upc_shared_type"; case DW_TAG_upc_strict_type: return "DW_TAG_upc_strict_type"; case DW_TAG_upc_relaxed_type: return "DW_TAG_upc_relaxed_type"; default: { static char buffer[100]; snprintf (buffer, sizeof (buffer), _("Unknown TAG value: %lx"), tag); return buffer; } } } static char * get_FORM_name (unsigned long form) { switch (form) { case DW_FORM_addr: return "DW_FORM_addr"; case DW_FORM_block2: return "DW_FORM_block2"; case DW_FORM_block4: return "DW_FORM_block4"; case DW_FORM_data2: return "DW_FORM_data2"; case DW_FORM_data4: return "DW_FORM_data4"; case DW_FORM_data8: return "DW_FORM_data8"; case DW_FORM_string: return "DW_FORM_string"; case DW_FORM_block: return "DW_FORM_block"; case DW_FORM_block1: return "DW_FORM_block1"; case DW_FORM_data1: return "DW_FORM_data1"; case DW_FORM_flag: return "DW_FORM_flag"; case DW_FORM_sdata: return "DW_FORM_sdata"; case DW_FORM_strp: return "DW_FORM_strp"; case DW_FORM_udata: return "DW_FORM_udata"; case DW_FORM_ref_addr: return "DW_FORM_ref_addr"; case DW_FORM_ref1: return "DW_FORM_ref1"; case DW_FORM_ref2: return "DW_FORM_ref2"; case DW_FORM_ref4: return "DW_FORM_ref4"; case DW_FORM_ref8: return "DW_FORM_ref8"; case DW_FORM_ref_udata: return "DW_FORM_ref_udata"; case DW_FORM_indirect: return "DW_FORM_indirect"; + case DW_FORM_flag_present: return "DW_FORM_flag_present"; default: { static char buffer[100]; snprintf (buffer, sizeof (buffer), _("Unknown FORM value: %lx"), form); return buffer; } } } static unsigned char * display_block (unsigned char *data, unsigned long length) { printf (_(" %lu byte block: "), length); while (length --) printf ("%lx ", (unsigned long) byte_get (data++, 1)); return data; } static int decode_location_expression (unsigned char * data, unsigned int pointer_size, unsigned long length, unsigned long cu_offset) { unsigned op; unsigned int bytes_read; unsigned long uvalue; unsigned char *end = data + length; int need_frame_base = 0; while (data < end) { op = *data++; switch (op) { case DW_OP_addr: printf ("DW_OP_addr: %lx", (unsigned long) byte_get (data, pointer_size)); data += pointer_size; break; case DW_OP_deref: printf ("DW_OP_deref"); break; case DW_OP_const1u: printf ("DW_OP_const1u: %lu", (unsigned long) byte_get (data++, 1)); break; case DW_OP_const1s: printf ("DW_OP_const1s: %ld", (long) byte_get_signed (data++, 1)); break; case DW_OP_const2u: printf ("DW_OP_const2u: %lu", (unsigned long) byte_get (data, 2)); data += 2; break; case DW_OP_const2s: printf ("DW_OP_const2s: %ld", (long) byte_get_signed (data, 2)); data += 2; break; case DW_OP_const4u: printf ("DW_OP_const4u: %lu", (unsigned long) byte_get (data, 4)); data += 4; break; case DW_OP_const4s: printf ("DW_OP_const4s: %ld", (long) byte_get_signed (data, 4)); data += 4; break; case DW_OP_const8u: printf ("DW_OP_const8u: %lu %lu", (unsigned long) byte_get (data, 4), (unsigned long) byte_get (data + 4, 4)); data += 8; break; case DW_OP_const8s: printf ("DW_OP_const8s: %ld %ld", (long) byte_get (data, 4), (long) byte_get (data + 4, 4)); data += 8; break; case DW_OP_constu: printf ("DW_OP_constu: %lu", read_leb128 (data, &bytes_read, 0)); data += bytes_read; break; case DW_OP_consts: printf ("DW_OP_consts: %ld", read_leb128 (data, &bytes_read, 1)); data += bytes_read; break; case DW_OP_dup: printf ("DW_OP_dup"); break; case DW_OP_drop: printf ("DW_OP_drop"); break; case DW_OP_over: printf ("DW_OP_over"); break; case DW_OP_pick: printf ("DW_OP_pick: %ld", (unsigned long) byte_get (data++, 1)); break; case DW_OP_swap: printf ("DW_OP_swap"); break; case DW_OP_rot: printf ("DW_OP_rot"); break; case DW_OP_xderef: printf ("DW_OP_xderef"); break; case DW_OP_abs: printf ("DW_OP_abs"); break; case DW_OP_and: printf ("DW_OP_and"); break; case DW_OP_div: printf ("DW_OP_div"); break; case DW_OP_minus: printf ("DW_OP_minus"); break; case DW_OP_mod: printf ("DW_OP_mod"); break; case DW_OP_mul: printf ("DW_OP_mul"); break; case DW_OP_neg: printf ("DW_OP_neg"); break; case DW_OP_not: printf ("DW_OP_not"); break; case DW_OP_or: printf ("DW_OP_or"); break; case DW_OP_plus: printf ("DW_OP_plus"); break; case DW_OP_plus_uconst: printf ("DW_OP_plus_uconst: %lu", read_leb128 (data, &bytes_read, 0)); data += bytes_read; break; case DW_OP_shl: printf ("DW_OP_shl"); break; case DW_OP_shr: printf ("DW_OP_shr"); break; case DW_OP_shra: printf ("DW_OP_shra"); break; case DW_OP_xor: printf ("DW_OP_xor"); break; case DW_OP_bra: printf ("DW_OP_bra: %ld", (long) byte_get_signed (data, 2)); data += 2; break; case DW_OP_eq: printf ("DW_OP_eq"); break; case DW_OP_ge: printf ("DW_OP_ge"); break; case DW_OP_gt: printf ("DW_OP_gt"); break; case DW_OP_le: printf ("DW_OP_le"); break; case DW_OP_lt: printf ("DW_OP_lt"); break; case DW_OP_ne: printf ("DW_OP_ne"); break; case DW_OP_skip: printf ("DW_OP_skip: %ld", (long) byte_get_signed (data, 2)); data += 2; break; case DW_OP_lit0: case DW_OP_lit1: case DW_OP_lit2: case DW_OP_lit3: case DW_OP_lit4: case DW_OP_lit5: case DW_OP_lit6: case DW_OP_lit7: case DW_OP_lit8: case DW_OP_lit9: case DW_OP_lit10: case DW_OP_lit11: case DW_OP_lit12: case DW_OP_lit13: case DW_OP_lit14: case DW_OP_lit15: case DW_OP_lit16: case DW_OP_lit17: case DW_OP_lit18: case DW_OP_lit19: case DW_OP_lit20: case DW_OP_lit21: case DW_OP_lit22: case DW_OP_lit23: case DW_OP_lit24: case DW_OP_lit25: case DW_OP_lit26: case DW_OP_lit27: case DW_OP_lit28: case DW_OP_lit29: case DW_OP_lit30: case DW_OP_lit31: printf ("DW_OP_lit%d", op - DW_OP_lit0); break; case DW_OP_reg0: case DW_OP_reg1: case DW_OP_reg2: case DW_OP_reg3: case DW_OP_reg4: case DW_OP_reg5: case DW_OP_reg6: case DW_OP_reg7: case DW_OP_reg8: case DW_OP_reg9: case DW_OP_reg10: case DW_OP_reg11: case DW_OP_reg12: case DW_OP_reg13: case DW_OP_reg14: case DW_OP_reg15: case DW_OP_reg16: case DW_OP_reg17: case DW_OP_reg18: case DW_OP_reg19: case DW_OP_reg20: case DW_OP_reg21: case DW_OP_reg22: case DW_OP_reg23: case DW_OP_reg24: case DW_OP_reg25: case DW_OP_reg26: case DW_OP_reg27: case DW_OP_reg28: case DW_OP_reg29: case DW_OP_reg30: case DW_OP_reg31: printf ("DW_OP_reg%d", op - DW_OP_reg0); break; case DW_OP_breg0: case DW_OP_breg1: case DW_OP_breg2: case DW_OP_breg3: case DW_OP_breg4: case DW_OP_breg5: case DW_OP_breg6: case DW_OP_breg7: case DW_OP_breg8: case DW_OP_breg9: case DW_OP_breg10: case DW_OP_breg11: case DW_OP_breg12: case DW_OP_breg13: case DW_OP_breg14: case DW_OP_breg15: case DW_OP_breg16: case DW_OP_breg17: case DW_OP_breg18: case DW_OP_breg19: case DW_OP_breg20: case DW_OP_breg21: case DW_OP_breg22: case DW_OP_breg23: case DW_OP_breg24: case DW_OP_breg25: case DW_OP_breg26: case DW_OP_breg27: case DW_OP_breg28: case DW_OP_breg29: case DW_OP_breg30: case DW_OP_breg31: printf ("DW_OP_breg%d: %ld", op - DW_OP_breg0, read_leb128 (data, &bytes_read, 1)); data += bytes_read; break; case DW_OP_regx: printf ("DW_OP_regx: %lu", read_leb128 (data, &bytes_read, 0)); data += bytes_read; break; case DW_OP_fbreg: need_frame_base = 1; printf ("DW_OP_fbreg: %ld", read_leb128 (data, &bytes_read, 1)); data += bytes_read; break; case DW_OP_bregx: uvalue = read_leb128 (data, &bytes_read, 0); data += bytes_read; printf ("DW_OP_bregx: %lu %ld", uvalue, read_leb128 (data, &bytes_read, 1)); data += bytes_read; break; case DW_OP_piece: printf ("DW_OP_piece: %lu", read_leb128 (data, &bytes_read, 0)); data += bytes_read; break; case DW_OP_deref_size: printf ("DW_OP_deref_size: %ld", (long) byte_get (data++, 1)); break; case DW_OP_xderef_size: printf ("DW_OP_xderef_size: %ld", (long) byte_get (data++, 1)); break; case DW_OP_nop: printf ("DW_OP_nop"); break; /* DWARF 3 extensions. */ case DW_OP_push_object_address: printf ("DW_OP_push_object_address"); break; case DW_OP_call2: /* XXX: Strictly speaking for 64-bit DWARF3 files this ought to be an 8-byte wide computation. */ printf ("DW_OP_call2: <%lx>", (long) byte_get (data, 2) + cu_offset); data += 2; break; case DW_OP_call4: /* XXX: Strictly speaking for 64-bit DWARF3 files this ought to be an 8-byte wide computation. */ printf ("DW_OP_call4: <%lx>", (long) byte_get (data, 4) + cu_offset); data += 4; break; case DW_OP_call_ref: printf ("DW_OP_call_ref"); break; case DW_OP_form_tls_address: printf ("DW_OP_form_tls_address"); break; /* GNU extensions. */ case DW_OP_GNU_push_tls_address: printf ("DW_OP_GNU_push_tls_address"); break; default: if (op >= DW_OP_lo_user && op <= DW_OP_hi_user) printf (_("(User defined location op)")); else printf (_("(Unknown location op)")); /* No way to tell where the next op is, so just bail. */ return need_frame_base; } /* Separate the ops. */ if (data < end) printf ("; "); } return need_frame_base; } static unsigned char * read_and_display_attr_value (unsigned long attribute, unsigned long form, unsigned char *data, unsigned long cu_offset, unsigned long pointer_size, unsigned long offset_size, int dwarf_version, debug_info *debug_info_p, int do_loc) { unsigned long uvalue = 0; unsigned char *block_start = NULL; unsigned int bytes_read; switch (form) { default: break; case DW_FORM_ref_addr: if (dwarf_version == 2) { uvalue = byte_get (data, pointer_size); data += pointer_size; } else if (dwarf_version == 3) { uvalue = byte_get (data, offset_size); data += offset_size; } else { error (_("Internal error: DWARF version is not 2 or 3.\n")); } break; case DW_FORM_addr: uvalue = byte_get (data, pointer_size); data += pointer_size; break; case DW_FORM_strp: uvalue = byte_get (data, offset_size); data += offset_size; break; + case DW_FORM_flag_present: + uvalue = 1; + break; + case DW_FORM_ref1: case DW_FORM_flag: case DW_FORM_data1: uvalue = byte_get (data++, 1); break; case DW_FORM_ref2: case DW_FORM_data2: uvalue = byte_get (data, 2); data += 2; break; case DW_FORM_ref4: case DW_FORM_data4: uvalue = byte_get (data, 4); data += 4; break; case DW_FORM_sdata: uvalue = read_leb128 (data, & bytes_read, 1); data += bytes_read; break; case DW_FORM_ref_udata: case DW_FORM_udata: uvalue = read_leb128 (data, & bytes_read, 0); data += bytes_read; break; case DW_FORM_indirect: form = read_leb128 (data, & bytes_read, 0); data += bytes_read; if (!do_loc) printf (" %s", get_FORM_name (form)); return read_and_display_attr_value (attribute, form, data, cu_offset, pointer_size, offset_size, dwarf_version, debug_info_p, do_loc); } switch (form) { case DW_FORM_ref_addr: if (!do_loc) printf (" <#%lx>", uvalue); break; case DW_FORM_ref1: case DW_FORM_ref2: case DW_FORM_ref4: case DW_FORM_ref_udata: if (!do_loc) printf (" <%lx>", uvalue + cu_offset); break; case DW_FORM_data4: case DW_FORM_addr: if (!do_loc) printf (" %#lx", uvalue); break; + case DW_FORM_flag_present: case DW_FORM_flag: case DW_FORM_data1: case DW_FORM_data2: case DW_FORM_sdata: case DW_FORM_udata: if (!do_loc) printf (" %ld", uvalue); break; case DW_FORM_ref8: case DW_FORM_data8: if (!do_loc) { uvalue = byte_get (data, 4); printf (" %lx", uvalue); printf (" %lx", (unsigned long) byte_get (data + 4, 4)); } if ((do_loc || do_debug_loc || do_debug_ranges) && num_debug_info_entries == 0) { if (sizeof (uvalue) == 8) uvalue = byte_get (data, 8); else error (_("DW_FORM_data8 is unsupported when sizeof (unsigned long) != 8\n")); } data += 8; break; case DW_FORM_string: if (!do_loc) printf (" %s", data); data += strlen ((char *) data) + 1; break; case DW_FORM_block: uvalue = read_leb128 (data, & bytes_read, 0); block_start = data + bytes_read; if (do_loc) data = block_start + uvalue; else data = display_block (block_start, uvalue); break; case DW_FORM_block1: uvalue = byte_get (data, 1); block_start = data + 1; if (do_loc) data = block_start + uvalue; else data = display_block (block_start, uvalue); break; case DW_FORM_block2: uvalue = byte_get (data, 2); block_start = data + 2; if (do_loc) data = block_start + uvalue; else data = display_block (block_start, uvalue); break; case DW_FORM_block4: uvalue = byte_get (data, 4); block_start = data + 4; if (do_loc) data = block_start + uvalue; else data = display_block (block_start, uvalue); break; case DW_FORM_strp: if (!do_loc) printf (_(" (indirect string, offset: 0x%lx): %s"), uvalue, fetch_indirect_string (uvalue)); break; case DW_FORM_indirect: /* Handled above. */ break; default: warn (_("Unrecognized form: %lu\n"), form); break; } /* For some attributes we can display further information. */ if ((do_loc || do_debug_loc || do_debug_ranges) && num_debug_info_entries == 0) { switch (attribute) { case DW_AT_frame_base: have_frame_base = 1; case DW_AT_location: case DW_AT_data_member_location: case DW_AT_vtable_elem_location: case DW_AT_allocated: case DW_AT_associated: case DW_AT_data_location: case DW_AT_stride: case DW_AT_upper_bound: case DW_AT_lower_bound: if (form == DW_FORM_data4 || form == DW_FORM_data8) { /* Process location list. */ unsigned int max = debug_info_p->max_loc_offsets; unsigned int num = debug_info_p->num_loc_offsets; if (max == 0 || num >= max) { max += 1024; debug_info_p->loc_offsets = xcrealloc (debug_info_p->loc_offsets, max, sizeof (*debug_info_p->loc_offsets)); debug_info_p->have_frame_base = xcrealloc (debug_info_p->have_frame_base, max, sizeof (*debug_info_p->have_frame_base)); debug_info_p->max_loc_offsets = max; } debug_info_p->loc_offsets [num] = uvalue; debug_info_p->have_frame_base [num] = have_frame_base; debug_info_p->num_loc_offsets++; } break; case DW_AT_low_pc: if (need_base_address) debug_info_p->base_address = uvalue; break; case DW_AT_ranges: if (form == DW_FORM_data4 || form == DW_FORM_data8) { /* Process range list. */ unsigned int max = debug_info_p->max_range_lists; unsigned int num = debug_info_p->num_range_lists; if (max == 0 || num >= max) { max += 1024; debug_info_p->range_lists = xcrealloc (debug_info_p->range_lists, max, sizeof (*debug_info_p->range_lists)); debug_info_p->max_range_lists = max; } debug_info_p->range_lists [num] = uvalue; debug_info_p->num_range_lists++; } break; default: break; } } if (do_loc) return data; printf ("\t"); switch (attribute) { case DW_AT_inline: switch (uvalue) { case DW_INL_not_inlined: printf (_("(not inlined)")); break; case DW_INL_inlined: printf (_("(inlined)")); break; case DW_INL_declared_not_inlined: printf (_("(declared as inline but ignored)")); break; case DW_INL_declared_inlined: printf (_("(declared as inline and inlined)")); break; default: printf (_(" (Unknown inline attribute value: %lx)"), uvalue); break; } break; case DW_AT_language: switch (uvalue) { /* Ordered by the numeric value of these constants. */ case DW_LANG_C89: printf ("(ANSI C)"); break; case DW_LANG_C: printf ("(non-ANSI C)"); break; case DW_LANG_Ada83: printf ("(Ada)"); break; case DW_LANG_C_plus_plus: printf ("(C++)"); break; case DW_LANG_Cobol74: printf ("(Cobol 74)"); break; case DW_LANG_Cobol85: printf ("(Cobol 85)"); break; case DW_LANG_Fortran77: printf ("(FORTRAN 77)"); break; case DW_LANG_Fortran90: printf ("(Fortran 90)"); break; case DW_LANG_Pascal83: printf ("(ANSI Pascal)"); break; case DW_LANG_Modula2: printf ("(Modula 2)"); break; /* DWARF 2.1 values. */ case DW_LANG_Java: printf ("(Java)"); break; case DW_LANG_C99: printf ("(ANSI C99)"); break; case DW_LANG_Ada95: printf ("(ADA 95)"); break; case DW_LANG_Fortran95: printf ("(Fortran 95)"); break; /* DWARF 3 values. */ case DW_LANG_PLI: printf ("(PLI)"); break; case DW_LANG_ObjC: printf ("(Objective C)"); break; case DW_LANG_ObjC_plus_plus: printf ("(Objective C++)"); break; case DW_LANG_UPC: printf ("(Unified Parallel C)"); break; case DW_LANG_D: printf ("(D)"); break; /* MIPS extension. */ case DW_LANG_Mips_Assembler: printf ("(MIPS assembler)"); break; /* UPC extension. */ case DW_LANG_Upc: printf ("(Unified Parallel C)"); break; default: if (uvalue >= DW_LANG_lo_user && uvalue <= DW_LANG_hi_user) printf ("(implementation defined: %lx)", uvalue); else printf ("(Unknown: %lx)", uvalue); break; } break; case DW_AT_encoding: switch (uvalue) { case DW_ATE_void: printf ("(void)"); break; case DW_ATE_address: printf ("(machine address)"); break; case DW_ATE_boolean: printf ("(boolean)"); break; case DW_ATE_complex_float: printf ("(complex float)"); break; case DW_ATE_float: printf ("(float)"); break; case DW_ATE_signed: printf ("(signed)"); break; case DW_ATE_signed_char: printf ("(signed char)"); break; case DW_ATE_unsigned: printf ("(unsigned)"); break; case DW_ATE_unsigned_char: printf ("(unsigned char)"); break; /* DWARF 2.1 value. */ case DW_ATE_imaginary_float: printf ("(imaginary float)"); break; case DW_ATE_decimal_float: printf ("(decimal float)"); break; default: if (uvalue >= DW_ATE_lo_user && uvalue <= DW_ATE_hi_user) printf ("(user defined type)"); else printf ("(unknown type)"); break; } break; case DW_AT_accessibility: switch (uvalue) { case DW_ACCESS_public: printf ("(public)"); break; case DW_ACCESS_protected: printf ("(protected)"); break; case DW_ACCESS_private: printf ("(private)"); break; default: printf ("(unknown accessibility)"); break; } break; case DW_AT_visibility: switch (uvalue) { case DW_VIS_local: printf ("(local)"); break; case DW_VIS_exported: printf ("(exported)"); break; case DW_VIS_qualified: printf ("(qualified)"); break; default: printf ("(unknown visibility)"); break; } break; case DW_AT_virtuality: switch (uvalue) { case DW_VIRTUALITY_none: printf ("(none)"); break; case DW_VIRTUALITY_virtual: printf ("(virtual)"); break; case DW_VIRTUALITY_pure_virtual:printf ("(pure_virtual)"); break; default: printf ("(unknown virtuality)"); break; } break; case DW_AT_identifier_case: switch (uvalue) { case DW_ID_case_sensitive: printf ("(case_sensitive)"); break; case DW_ID_up_case: printf ("(up_case)"); break; case DW_ID_down_case: printf ("(down_case)"); break; case DW_ID_case_insensitive: printf ("(case_insensitive)"); break; default: printf ("(unknown case)"); break; } break; case DW_AT_calling_convention: switch (uvalue) { case DW_CC_normal: printf ("(normal)"); break; case DW_CC_program: printf ("(program)"); break; case DW_CC_nocall: printf ("(nocall)"); break; default: if (uvalue >= DW_CC_lo_user && uvalue <= DW_CC_hi_user) printf ("(user defined)"); else printf ("(unknown convention)"); } break; case DW_AT_ordering: switch (uvalue) { case -1: printf ("(undefined)"); break; case 0: printf ("(row major)"); break; case 1: printf ("(column major)"); break; } break; case DW_AT_frame_base: have_frame_base = 1; case DW_AT_location: case DW_AT_data_member_location: case DW_AT_vtable_elem_location: case DW_AT_allocated: case DW_AT_associated: case DW_AT_data_location: case DW_AT_stride: case DW_AT_upper_bound: case DW_AT_lower_bound: if (block_start) { int need_frame_base; printf ("("); need_frame_base = decode_location_expression (block_start, pointer_size, uvalue, cu_offset); printf (")"); if (need_frame_base && !have_frame_base) printf (_(" [without DW_AT_frame_base]")); } else if (form == DW_FORM_data4 || form == DW_FORM_data8) printf (_("(location list)")); break; default: break; } return data; } static char * get_AT_name (unsigned long attribute) { switch (attribute) { case DW_AT_sibling: return "DW_AT_sibling"; case DW_AT_location: return "DW_AT_location"; case DW_AT_name: return "DW_AT_name"; case DW_AT_ordering: return "DW_AT_ordering"; case DW_AT_subscr_data: return "DW_AT_subscr_data"; case DW_AT_byte_size: return "DW_AT_byte_size"; case DW_AT_bit_offset: return "DW_AT_bit_offset"; case DW_AT_bit_size: return "DW_AT_bit_size"; case DW_AT_element_list: return "DW_AT_element_list"; case DW_AT_stmt_list: return "DW_AT_stmt_list"; case DW_AT_low_pc: return "DW_AT_low_pc"; case DW_AT_high_pc: return "DW_AT_high_pc"; case DW_AT_language: return "DW_AT_language"; case DW_AT_member: return "DW_AT_member"; case DW_AT_discr: return "DW_AT_discr"; case DW_AT_discr_value: return "DW_AT_discr_value"; case DW_AT_visibility: return "DW_AT_visibility"; case DW_AT_import: return "DW_AT_import"; case DW_AT_string_length: return "DW_AT_string_length"; case DW_AT_common_reference: return "DW_AT_common_reference"; case DW_AT_comp_dir: return "DW_AT_comp_dir"; case DW_AT_const_value: return "DW_AT_const_value"; case DW_AT_containing_type: return "DW_AT_containing_type"; case DW_AT_default_value: return "DW_AT_default_value"; case DW_AT_inline: return "DW_AT_inline"; case DW_AT_is_optional: return "DW_AT_is_optional"; case DW_AT_lower_bound: return "DW_AT_lower_bound"; case DW_AT_producer: return "DW_AT_producer"; case DW_AT_prototyped: return "DW_AT_prototyped"; case DW_AT_return_addr: return "DW_AT_return_addr"; case DW_AT_start_scope: return "DW_AT_start_scope"; case DW_AT_stride_size: return "DW_AT_stride_size"; case DW_AT_upper_bound: return "DW_AT_upper_bound"; case DW_AT_abstract_origin: return "DW_AT_abstract_origin"; case DW_AT_accessibility: return "DW_AT_accessibility"; case DW_AT_address_class: return "DW_AT_address_class"; case DW_AT_artificial: return "DW_AT_artificial"; case DW_AT_base_types: return "DW_AT_base_types"; case DW_AT_calling_convention: return "DW_AT_calling_convention"; case DW_AT_count: return "DW_AT_count"; case DW_AT_data_member_location: return "DW_AT_data_member_location"; case DW_AT_decl_column: return "DW_AT_decl_column"; case DW_AT_decl_file: return "DW_AT_decl_file"; case DW_AT_decl_line: return "DW_AT_decl_line"; case DW_AT_declaration: return "DW_AT_declaration"; case DW_AT_discr_list: return "DW_AT_discr_list"; case DW_AT_encoding: return "DW_AT_encoding"; case DW_AT_external: return "DW_AT_external"; case DW_AT_frame_base: return "DW_AT_frame_base"; case DW_AT_friend: return "DW_AT_friend"; case DW_AT_identifier_case: return "DW_AT_identifier_case"; case DW_AT_macro_info: return "DW_AT_macro_info"; case DW_AT_namelist_items: return "DW_AT_namelist_items"; case DW_AT_priority: return "DW_AT_priority"; case DW_AT_segment: return "DW_AT_segment"; case DW_AT_specification: return "DW_AT_specification"; case DW_AT_static_link: return "DW_AT_static_link"; case DW_AT_type: return "DW_AT_type"; case DW_AT_use_location: return "DW_AT_use_location"; case DW_AT_variable_parameter: return "DW_AT_variable_parameter"; case DW_AT_virtuality: return "DW_AT_virtuality"; case DW_AT_vtable_elem_location: return "DW_AT_vtable_elem_location"; /* DWARF 2.1 values. */ case DW_AT_allocated: return "DW_AT_allocated"; case DW_AT_associated: return "DW_AT_associated"; case DW_AT_data_location: return "DW_AT_data_location"; case DW_AT_stride: return "DW_AT_stride"; case DW_AT_entry_pc: return "DW_AT_entry_pc"; case DW_AT_use_UTF8: return "DW_AT_use_UTF8"; case DW_AT_extension: return "DW_AT_extension"; case DW_AT_ranges: return "DW_AT_ranges"; case DW_AT_trampoline: return "DW_AT_trampoline"; case DW_AT_call_column: return "DW_AT_call_column"; case DW_AT_call_file: return "DW_AT_call_file"; case DW_AT_call_line: return "DW_AT_call_line"; /* SGI/MIPS extensions. */ case DW_AT_MIPS_fde: return "DW_AT_MIPS_fde"; case DW_AT_MIPS_loop_begin: return "DW_AT_MIPS_loop_begin"; case DW_AT_MIPS_tail_loop_begin: return "DW_AT_MIPS_tail_loop_begin"; case DW_AT_MIPS_epilog_begin: return "DW_AT_MIPS_epilog_begin"; case DW_AT_MIPS_loop_unroll_factor: return "DW_AT_MIPS_loop_unroll_factor"; case DW_AT_MIPS_software_pipeline_depth: return "DW_AT_MIPS_software_pipeline_depth"; case DW_AT_MIPS_linkage_name: return "DW_AT_MIPS_linkage_name"; case DW_AT_MIPS_stride: return "DW_AT_MIPS_stride"; case DW_AT_MIPS_abstract_name: return "DW_AT_MIPS_abstract_name"; case DW_AT_MIPS_clone_origin: return "DW_AT_MIPS_clone_origin"; case DW_AT_MIPS_has_inlines: return "DW_AT_MIPS_has_inlines"; /* GNU extensions. */ case DW_AT_sf_names: return "DW_AT_sf_names"; case DW_AT_src_info: return "DW_AT_src_info"; case DW_AT_mac_info: return "DW_AT_mac_info"; case DW_AT_src_coords: return "DW_AT_src_coords"; case DW_AT_body_begin: return "DW_AT_body_begin"; case DW_AT_body_end: return "DW_AT_body_end"; case DW_AT_GNU_vector: return "DW_AT_GNU_vector"; /* UPC extension. */ case DW_AT_upc_threads_scaled: return "DW_AT_upc_threads_scaled"; default: { static char buffer[100]; snprintf (buffer, sizeof (buffer), _("Unknown AT value: %lx"), attribute); return buffer; } } } static unsigned char * read_and_display_attr (unsigned long attribute, unsigned long form, unsigned char *data, unsigned long cu_offset, unsigned long pointer_size, unsigned long offset_size, int dwarf_version, debug_info *debug_info_p, int do_loc) { if (!do_loc) printf (" %-18s:", get_AT_name (attribute)); data = read_and_display_attr_value (attribute, form, data, cu_offset, pointer_size, offset_size, dwarf_version, debug_info_p, do_loc); if (!do_loc) printf ("\n"); return data; } /* Process the contents of a .debug_info section. If do_loc is non-zero then we are scanning for location lists and we do not want to display anything to the user. */ static int process_debug_info (struct dwarf_section *section, void *file, int do_loc) { unsigned char *start = section->start; unsigned char *end = start + section->size; unsigned char *section_begin; unsigned int unit; unsigned int num_units = 0; if ((do_loc || do_debug_loc || do_debug_ranges) && num_debug_info_entries == 0) { unsigned long length; /* First scan the section to get the number of comp units. */ for (section_begin = start, num_units = 0; section_begin < end; num_units ++) { /* Read the first 4 bytes. For a 32-bit DWARF section, this will be the length. For a 64-bit DWARF section, it'll be the escape code 0xffffffff followed by an 8 byte length. */ length = byte_get (section_begin, 4); if (length == 0xffffffff) { length = byte_get (section_begin + 4, 8); section_begin += length + 12; } else section_begin += length + 4; } if (num_units == 0) { error (_("No comp units in %s section ?"), section->name); return 0; } /* Then allocate an array to hold the information. */ debug_information = cmalloc (num_units, sizeof (* debug_information)); if (debug_information == NULL) { error (_("Not enough memory for a debug info array of %u entries"), num_units); return 0; } } if (!do_loc) { printf (_("The section %s contains:\n\n"), section->name); load_debug_section (str, file); } load_debug_section (abbrev, file); if (debug_displays [abbrev].section.start == NULL) { warn (_("Unable to locate %s section!\n"), debug_displays [abbrev].section.name); return 0; } for (section_begin = start, unit = 0; start < end; unit++) { DWARF2_Internal_CompUnit compunit; unsigned char *hdrptr; unsigned char *cu_abbrev_offset_ptr; unsigned char *tags; int level; unsigned long cu_offset; int offset_size; int initial_length_size; hdrptr = start; compunit.cu_length = byte_get (hdrptr, 4); hdrptr += 4; if (compunit.cu_length == 0xffffffff) { compunit.cu_length = byte_get (hdrptr, 8); hdrptr += 8; offset_size = 8; initial_length_size = 12; } else { offset_size = 4; initial_length_size = 4; } compunit.cu_version = byte_get (hdrptr, 2); hdrptr += 2; cu_offset = start - section_begin; cu_abbrev_offset_ptr = hdrptr; compunit.cu_abbrev_offset = byte_get (hdrptr, offset_size); hdrptr += offset_size; compunit.cu_pointer_size = byte_get (hdrptr, 1); hdrptr += 1; if ((do_loc || do_debug_loc || do_debug_ranges) && num_debug_info_entries == 0) { debug_information [unit].cu_offset = cu_offset; debug_information [unit].pointer_size = compunit.cu_pointer_size; debug_information [unit].base_address = 0; debug_information [unit].loc_offsets = NULL; debug_information [unit].have_frame_base = NULL; debug_information [unit].max_loc_offsets = 0; debug_information [unit].num_loc_offsets = 0; debug_information [unit].range_lists = NULL; debug_information [unit].max_range_lists= 0; debug_information [unit].num_range_lists = 0; } if (!do_loc) { printf (_(" Compilation Unit @ offset 0x%lx:\n"), cu_offset); printf (_(" Length: %ld\n"), compunit.cu_length); printf (_(" Version: %d\n"), compunit.cu_version); printf (_(" Abbrev Offset: %ld\n"), compunit.cu_abbrev_offset); printf (_(" Pointer Size: %d\n"), compunit.cu_pointer_size); } if (cu_offset + compunit.cu_length + initial_length_size > section->size) { warn (_("Debug info is corrupted, length is invalid (section is %lu bytes)\n"), (unsigned long)section->size); break; } tags = hdrptr; start += compunit.cu_length + initial_length_size; if (compunit.cu_version != 2 && compunit.cu_version != 3) { warn (_("Only version 2 and 3 DWARF debug information is currently supported.\n")); continue; } free_abbrevs (); /* Process the abbrevs used by this compilation unit. DWARF sections under Mach-O have non-zero addresses. */ if (compunit.cu_abbrev_offset >= debug_displays [abbrev].section.size) warn (_("Debug info is corrupted, abbrev offset is invalid (section is %lu bytes)\n"), (unsigned long)debug_displays [abbrev].section.size); else process_abbrev_section ((unsigned char *) debug_displays [abbrev].section.start + compunit.cu_abbrev_offset - debug_displays [abbrev].section.address, (unsigned char *) debug_displays [abbrev].section.start + debug_displays [abbrev].section.size); level = 0; while (tags < start) { unsigned int bytes_read; unsigned long abbrev_number; abbrev_entry *entry; abbrev_attr *attr; abbrev_number = read_leb128 (tags, & bytes_read, 0); tags += bytes_read; /* A null DIE marks the end of a list of children. */ if (abbrev_number == 0) { --level; continue; } if (!do_loc) printf (_(" <%d><%lx>: Abbrev Number: %lu"), level, (unsigned long) (tags - section_begin - bytes_read), abbrev_number); /* Scan through the abbreviation list until we reach the correct entry. */ for (entry = first_abbrev; entry && entry->entry != abbrev_number; entry = entry->next) continue; if (entry == NULL) { if (!do_loc) { printf ("\n"); fflush (stdout); } warn (_("Unable to locate entry %lu in the abbreviation table\n"), abbrev_number); return 0; } if (!do_loc) printf (_(" (%s)\n"), get_TAG_name (entry->tag)); switch (entry->tag) { default: need_base_address = 0; break; case DW_TAG_compile_unit: need_base_address = 1; break; case DW_TAG_entry_point: case DW_TAG_subprogram: need_base_address = 0; /* Assuming that there is no DW_AT_frame_base. */ have_frame_base = 0; break; } for (attr = entry->first_attr; attr; attr = attr->next) { if (! do_loc) /* Show the offset from where the tag was extracted. */ printf (" <%2lx>", (unsigned long)(tags - section_begin)); tags = read_and_display_attr (attr->attribute, attr->form, tags, cu_offset, compunit.cu_pointer_size, offset_size, compunit.cu_version, &debug_information [unit], do_loc); } if (entry->children) ++level; } } /* Set num_debug_info_entries here so that it can be used to check if we need to process .debug_loc and .debug_ranges sections. */ if ((do_loc || do_debug_loc || do_debug_ranges) && num_debug_info_entries == 0) num_debug_info_entries = num_units; if (!do_loc) { printf ("\n"); } return 1; } /* Locate and scan the .debug_info section in the file and record the pointer sizes and offsets for the compilation units in it. Usually an executable will have just one pointer size, but this is not guaranteed, and so we try not to make any assumptions. Returns zero upon failure, or the number of compilation units upon success. */ static unsigned int load_debug_info (void * file) { /* Reset the last pointer size so that we can issue correct error messages if we are displaying the contents of more than one section. */ last_pointer_size = 0; warned_about_missing_comp_units = FALSE; /* If we already have the information there is nothing else to do. */ if (num_debug_info_entries > 0) return num_debug_info_entries; if (load_debug_section (info, file) && process_debug_info (&debug_displays [info].section, file, 1)) return num_debug_info_entries; else return 0; } static int display_debug_lines (struct dwarf_section *section, void *file) { unsigned char *start = section->start; unsigned char *data = start; unsigned char *end = start + section->size; printf (_("\nDump of debug contents of section %s:\n\n"), section->name); load_debug_info (file); while (data < end) { DWARF2_Internal_LineInfo info; unsigned char *standard_opcodes; unsigned char *end_of_sequence; unsigned char *hdrptr; int initial_length_size; int offset_size; int i; hdrptr = data; /* Check the length of the block. */ info.li_length = byte_get (hdrptr, 4); hdrptr += 4; if (info.li_length == 0xffffffff) { /* This section is 64-bit DWARF 3. */ info.li_length = byte_get (hdrptr, 8); hdrptr += 8; offset_size = 8; initial_length_size = 12; } else { offset_size = 4; initial_length_size = 4; } if (info.li_length + initial_length_size > section->size) { warn (_("The line info appears to be corrupt - the section is too small\n")); return 0; } /* Check its version number. */ info.li_version = byte_get (hdrptr, 2); hdrptr += 2; if (info.li_version != 2 && info.li_version != 3) { warn (_("Only DWARF version 2 and 3 line info is currently supported.\n")); return 0; } info.li_prologue_length = byte_get (hdrptr, offset_size); hdrptr += offset_size; info.li_min_insn_length = byte_get (hdrptr, 1); hdrptr++; info.li_default_is_stmt = byte_get (hdrptr, 1); hdrptr++; info.li_line_base = byte_get (hdrptr, 1); hdrptr++; info.li_line_range = byte_get (hdrptr, 1); hdrptr++; info.li_opcode_base = byte_get (hdrptr, 1); hdrptr++; /* Sign extend the line base field. */ info.li_line_base <<= 24; info.li_line_base >>= 24; printf (_(" Length: %ld\n"), info.li_length); printf (_(" DWARF Version: %d\n"), info.li_version); printf (_(" Prologue Length: %d\n"), info.li_prologue_length); printf (_(" Minimum Instruction Length: %d\n"), info.li_min_insn_length); printf (_(" Initial value of 'is_stmt': %d\n"), info.li_default_is_stmt); printf (_(" Line Base: %d\n"), info.li_line_base); printf (_(" Line Range: %d\n"), info.li_line_range); printf (_(" Opcode Base: %d\n"), info.li_opcode_base); end_of_sequence = data + info.li_length + initial_length_size; reset_state_machine (info.li_default_is_stmt); /* Display the contents of the Opcodes table. */ standard_opcodes = hdrptr; printf (_("\n Opcodes:\n")); for (i = 1; i < info.li_opcode_base; i++) printf (_(" Opcode %d has %d args\n"), i, standard_opcodes[i - 1]); /* Display the contents of the Directory table. */ data = standard_opcodes + info.li_opcode_base - 1; if (*data == 0) printf (_("\n The Directory Table is empty.\n")); else { printf (_("\n The Directory Table:\n")); while (*data != 0) { printf (_(" %s\n"), data); data += strlen ((char *) data) + 1; } } /* Skip the NUL at the end of the table. */ data++; /* Display the contents of the File Name table. */ if (*data == 0) printf (_("\n The File Name Table is empty.\n")); else { printf (_("\n The File Name Table:\n")); printf (_(" Entry\tDir\tTime\tSize\tName\n")); while (*data != 0) { unsigned char *name; unsigned int bytes_read; printf (_(" %d\t"), ++state_machine_regs.last_file_entry); name = data; data += strlen ((char *) data) + 1; printf (_("%lu\t"), read_leb128 (data, & bytes_read, 0)); data += bytes_read; printf (_("%lu\t"), read_leb128 (data, & bytes_read, 0)); data += bytes_read; printf (_("%lu\t"), read_leb128 (data, & bytes_read, 0)); data += bytes_read; printf (_("%s\n"), name); } } /* Skip the NUL at the end of the table. */ data++; /* Now display the statements. */ printf (_("\n Line Number Statements:\n")); while (data < end_of_sequence) { unsigned char op_code; int adv; unsigned long int uladv; unsigned int bytes_read; op_code = *data++; if (op_code >= info.li_opcode_base) { op_code -= info.li_opcode_base; uladv = (op_code / info.li_line_range) * info.li_min_insn_length; state_machine_regs.address += uladv; printf (_(" Special opcode %d: advance Address by %lu to 0x%lx"), op_code, uladv, state_machine_regs.address); adv = (op_code % info.li_line_range) + info.li_line_base; state_machine_regs.line += adv; printf (_(" and Line by %d to %d\n"), adv, state_machine_regs.line); } else switch (op_code) { case DW_LNS_extended_op: data += process_extended_line_op (data, info.li_default_is_stmt); break; case DW_LNS_copy: printf (_(" Copy\n")); break; case DW_LNS_advance_pc: uladv = read_leb128 (data, & bytes_read, 0); uladv *= info.li_min_insn_length; data += bytes_read; state_machine_regs.address += uladv; printf (_(" Advance PC by %lu to 0x%lx\n"), uladv, state_machine_regs.address); break; case DW_LNS_advance_line: adv = read_leb128 (data, & bytes_read, 1); data += bytes_read; state_machine_regs.line += adv; printf (_(" Advance Line by %d to %d\n"), adv, state_machine_regs.line); break; case DW_LNS_set_file: adv = read_leb128 (data, & bytes_read, 0); data += bytes_read; printf (_(" Set File Name to entry %d in the File Name Table\n"), adv); state_machine_regs.file = adv; break; case DW_LNS_set_column: uladv = read_leb128 (data, & bytes_read, 0); data += bytes_read; printf (_(" Set column to %lu\n"), uladv); state_machine_regs.column = uladv; break; case DW_LNS_negate_stmt: adv = state_machine_regs.is_stmt; adv = ! adv; printf (_(" Set is_stmt to %d\n"), adv); state_machine_regs.is_stmt = adv; break; case DW_LNS_set_basic_block: printf (_(" Set basic block\n")); state_machine_regs.basic_block = 1; break; case DW_LNS_const_add_pc: uladv = (((255 - info.li_opcode_base) / info.li_line_range) * info.li_min_insn_length); state_machine_regs.address += uladv; printf (_(" Advance PC by constant %lu to 0x%lx\n"), uladv, state_machine_regs.address); break; case DW_LNS_fixed_advance_pc: uladv = byte_get (data, 2); data += 2; state_machine_regs.address += uladv; printf (_(" Advance PC by fixed size amount %lu to 0x%lx\n"), uladv, state_machine_regs.address); break; case DW_LNS_set_prologue_end: printf (_(" Set prologue_end to true\n")); break; case DW_LNS_set_epilogue_begin: printf (_(" Set epilogue_begin to true\n")); break; case DW_LNS_set_isa: uladv = read_leb128 (data, & bytes_read, 0); data += bytes_read; printf (_(" Set ISA to %lu\n"), uladv); break; default: printf (_(" Unknown opcode %d with operands: "), op_code); for (i = standard_opcodes[op_code - 1]; i > 0 ; --i) { printf ("0x%lx%s", read_leb128 (data, &bytes_read, 0), i == 1 ? "" : ", "); data += bytes_read; } putchar ('\n'); break; } } putchar ('\n'); } return 1; } static int display_debug_pubnames (struct dwarf_section *section, void *file ATTRIBUTE_UNUSED) { DWARF2_Internal_PubNames pubnames; unsigned char *start = section->start; unsigned char *end = start + section->size; printf (_("Contents of the %s section:\n\n"), section->name); while (start < end) { unsigned char *data; unsigned long offset; int offset_size, initial_length_size; data = start; pubnames.pn_length = byte_get (data, 4); data += 4; if (pubnames.pn_length == 0xffffffff) { pubnames.pn_length = byte_get (data, 8); data += 8; offset_size = 8; initial_length_size = 12; } else { offset_size = 4; initial_length_size = 4; } pubnames.pn_version = byte_get (data, 2); data += 2; pubnames.pn_offset = byte_get (data, offset_size); data += offset_size; pubnames.pn_size = byte_get (data, offset_size); data += offset_size; start += pubnames.pn_length + initial_length_size; if (pubnames.pn_version != 2 && pubnames.pn_version != 3) { static int warned = 0; if (! warned) { warn (_("Only DWARF 2 and 3 pubnames are currently supported\n")); warned = 1; } continue; } printf (_(" Length: %ld\n"), pubnames.pn_length); printf (_(" Version: %d\n"), pubnames.pn_version); printf (_(" Offset into .debug_info section: %ld\n"), pubnames.pn_offset); printf (_(" Size of area in .debug_info section: %ld\n"), pubnames.pn_size); printf (_("\n Offset\tName\n")); do { offset = byte_get (data, offset_size); if (offset != 0) { data += offset_size; printf (" %-6ld\t\t%s\n", offset, data); data += strlen ((char *) data) + 1; } } while (offset != 0); } printf ("\n"); return 1; } static int display_debug_macinfo (struct dwarf_section *section, void *file ATTRIBUTE_UNUSED) { unsigned char *start = section->start; unsigned char *end = start + section->size; unsigned char *curr = start; unsigned int bytes_read; enum dwarf_macinfo_record_type op; printf (_("Contents of the %s section:\n\n"), section->name); while (curr < end) { unsigned int lineno; const char *string; op = *curr; curr++; switch (op) { case DW_MACINFO_start_file: { unsigned int filenum; lineno = read_leb128 (curr, & bytes_read, 0); curr += bytes_read; filenum = read_leb128 (curr, & bytes_read, 0); curr += bytes_read; printf (_(" DW_MACINFO_start_file - lineno: %d filenum: %d\n"), lineno, filenum); } break; case DW_MACINFO_end_file: printf (_(" DW_MACINFO_end_file\n")); break; case DW_MACINFO_define: lineno = read_leb128 (curr, & bytes_read, 0); curr += bytes_read; string = (char *) curr; curr += strlen (string) + 1; printf (_(" DW_MACINFO_define - lineno : %d macro : %s\n"), lineno, string); break; case DW_MACINFO_undef: lineno = read_leb128 (curr, & bytes_read, 0); curr += bytes_read; string = (char *) curr; curr += strlen (string) + 1; printf (_(" DW_MACINFO_undef - lineno : %d macro : %s\n"), lineno, string); break; case DW_MACINFO_vendor_ext: { unsigned int constant; constant = read_leb128 (curr, & bytes_read, 0); curr += bytes_read; string = (char *) curr; curr += strlen (string) + 1; printf (_(" DW_MACINFO_vendor_ext - constant : %d string : %s\n"), constant, string); } break; } } return 1; } static int display_debug_abbrev (struct dwarf_section *section, void *file ATTRIBUTE_UNUSED) { abbrev_entry *entry; unsigned char *start = section->start; unsigned char *end = start + section->size; printf (_("Contents of the %s section:\n\n"), section->name); do { free_abbrevs (); start = process_abbrev_section (start, end); if (first_abbrev == NULL) continue; printf (_(" Number TAG\n")); for (entry = first_abbrev; entry; entry = entry->next) { abbrev_attr *attr; printf (_(" %ld %s [%s]\n"), entry->entry, get_TAG_name (entry->tag), entry->children ? _("has children") : _("no children")); for (attr = entry->first_attr; attr; attr = attr->next) printf (_(" %-18s %s\n"), get_AT_name (attr->attribute), get_FORM_name (attr->form)); } } while (start); printf ("\n"); return 1; } static int display_debug_loc (struct dwarf_section *section, void *file) { unsigned char *start = section->start; unsigned char *section_end; unsigned long bytes; unsigned char *section_begin = start; unsigned int num_loc_list = 0; unsigned long last_offset = 0; unsigned int first = 0; unsigned int i; unsigned int j; int seen_first_offset = 0; int use_debug_info = 1; unsigned char *next; bytes = section->size; section_end = start + bytes; if (bytes == 0) { printf (_("\nThe %s section is empty.\n"), section->name); return 0; } load_debug_info (file); /* Check the order of location list in .debug_info section. If offsets of location lists are in the ascending order, we can use `debug_information' directly. */ for (i = 0; i < num_debug_info_entries; i++) { unsigned int num; num = debug_information [i].num_loc_offsets; num_loc_list += num; /* Check if we can use `debug_information' directly. */ if (use_debug_info && num != 0) { if (!seen_first_offset) { /* This is the first location list. */ last_offset = debug_information [i].loc_offsets [0]; first = i; seen_first_offset = 1; j = 1; } else j = 0; for (; j < num; j++) { if (last_offset > debug_information [i].loc_offsets [j]) { use_debug_info = 0; break; } last_offset = debug_information [i].loc_offsets [j]; } } } if (!use_debug_info) /* FIXME: Should we handle this case? */ error (_("Location lists in .debug_info section aren't in ascending order!\n")); if (!seen_first_offset) error (_("No location lists in .debug_info section!\n")); /* DWARF sections under Mach-O have non-zero addresses. */ if (debug_information [first].num_loc_offsets > 0 && debug_information [first].loc_offsets [0] != section->address) warn (_("Location lists in %s section start at 0x%lx\n"), section->name, debug_information [first].loc_offsets [0]); printf (_("Contents of the %s section:\n\n"), section->name); printf (_(" Offset Begin End Expression\n")); seen_first_offset = 0; for (i = first; i < num_debug_info_entries; i++) { unsigned long begin; unsigned long end; unsigned short length; unsigned long offset; unsigned int pointer_size; unsigned long cu_offset; unsigned long base_address; int need_frame_base; int has_frame_base; pointer_size = debug_information [i].pointer_size; cu_offset = debug_information [i].cu_offset; for (j = 0; j < debug_information [i].num_loc_offsets; j++) { has_frame_base = debug_information [i].have_frame_base [j]; /* DWARF sections under Mach-O have non-zero addresses. */ offset = debug_information [i].loc_offsets [j] - section->address; next = section_begin + offset; base_address = debug_information [i].base_address; if (!seen_first_offset) seen_first_offset = 1; else { if (start < next) warn (_("There is a hole [0x%lx - 0x%lx] in .debug_loc section.\n"), (long)(start - section_begin), (long)(next - section_begin)); else if (start > next) warn (_("There is an overlap [0x%lx - 0x%lx] in .debug_loc section.\n"), (long)(start - section_begin), (long)(next - section_begin)); } start = next; if (offset >= bytes) { warn (_("Offset 0x%lx is bigger than .debug_loc section size.\n"), offset); continue; } while (1) { if (start + 2 * pointer_size > section_end) { warn (_("Location list starting at offset 0x%lx is not terminated.\n"), offset); break; } begin = byte_get (start, pointer_size); start += pointer_size; end = byte_get (start, pointer_size); start += pointer_size; if (begin == 0 && end == 0) { printf (_(" %8.8lx \n"), offset); break; } /* Check base address specifiers. */ if (begin == -1UL && end != -1UL) { base_address = end; printf (_(" %8.8lx %8.8lx %8.8lx (base address)\n"), offset, begin, end); continue; } if (start + 2 > section_end) { warn (_("Location list starting at offset 0x%lx is not terminated.\n"), offset); break; } length = byte_get (start, 2); start += 2; if (start + length > section_end) { warn (_("Location list starting at offset 0x%lx is not terminated.\n"), offset); break; } printf (" %8.8lx %8.8lx %8.8lx (", offset, begin + base_address, end + base_address); need_frame_base = decode_location_expression (start, pointer_size, length, cu_offset); putchar (')'); if (need_frame_base && !has_frame_base) printf (_(" [without DW_AT_frame_base]")); if (begin == end) fputs (_(" (start == end)"), stdout); else if (begin > end) fputs (_(" (start > end)"), stdout); putchar ('\n'); start += length; } } } return 1; } static int display_debug_str (struct dwarf_section *section, void *file ATTRIBUTE_UNUSED) { unsigned char *start = section->start; unsigned long bytes = section->size; dwarf_vma addr = section->address; if (bytes == 0) { printf (_("\nThe %s section is empty.\n"), section->name); return 0; } printf (_("Contents of the %s section:\n\n"), section->name); while (bytes) { int j; int k; int lbytes; lbytes = (bytes > 16 ? 16 : bytes); printf (" 0x%8.8lx ", (unsigned long) addr); for (j = 0; j < 16; j++) { if (j < lbytes) printf ("%2.2x", start[j]); else printf (" "); if ((j & 3) == 3) printf (" "); } for (j = 0; j < lbytes; j++) { k = start[j]; if (k >= ' ' && k < 0x80) printf ("%c", k); else printf ("."); } putchar ('\n'); start += lbytes; addr += lbytes; bytes -= lbytes; } putchar ('\n'); return 1; } static int display_debug_info (struct dwarf_section *section, void *file) { return process_debug_info (section, file, 0); } static int display_debug_aranges (struct dwarf_section *section, void *file ATTRIBUTE_UNUSED) { unsigned char *start = section->start; unsigned char *end = start + section->size; printf (_("The section %s contains:\n\n"), section->name); while (start < end) { unsigned char *hdrptr; DWARF2_Internal_ARange arange; unsigned char *ranges; unsigned long length; unsigned long address; unsigned char address_size; int excess; int offset_size; int initial_length_size; hdrptr = start; arange.ar_length = byte_get (hdrptr, 4); hdrptr += 4; if (arange.ar_length == 0xffffffff) { arange.ar_length = byte_get (hdrptr, 8); hdrptr += 8; offset_size = 8; initial_length_size = 12; } else { offset_size = 4; initial_length_size = 4; } arange.ar_version = byte_get (hdrptr, 2); hdrptr += 2; arange.ar_info_offset = byte_get (hdrptr, offset_size); hdrptr += offset_size; arange.ar_pointer_size = byte_get (hdrptr, 1); hdrptr += 1; arange.ar_segment_size = byte_get (hdrptr, 1); hdrptr += 1; if (arange.ar_version != 2 && arange.ar_version != 3) { warn (_("Only DWARF 2 and 3 aranges are currently supported.\n")); break; } printf (_(" Length: %ld\n"), arange.ar_length); printf (_(" Version: %d\n"), arange.ar_version); printf (_(" Offset into .debug_info: %lx\n"), arange.ar_info_offset); printf (_(" Pointer Size: %d\n"), arange.ar_pointer_size); printf (_(" Segment Size: %d\n"), arange.ar_segment_size); address_size = arange.ar_pointer_size + arange.ar_segment_size; /* The DWARF spec does not require that the address size be a power of two, but we do. This will have to change if we ever encounter an uneven architecture. */ if ((address_size & (address_size - 1)) != 0) { warn (_("Pointer size + Segment size is not a power of two.\n")); break; } if (address_size > 4) printf (_("\n Address Length\n")); else printf (_("\n Address Length\n")); ranges = hdrptr; /* Must pad to an alignment boundary that is twice the address size. */ excess = (hdrptr - start) % (2 * address_size); if (excess) ranges += (2 * address_size) - excess; start += arange.ar_length + initial_length_size; while (ranges + 2 * address_size <= start) { address = byte_get (ranges, address_size); ranges += address_size; length = byte_get (ranges, address_size); ranges += address_size; if (address_size > 4) printf (" 0x%16.16lx 0x%lx\n", address, length); else printf (" 0x%8.8lx 0x%lx\n", address, length); } } printf ("\n"); return 1; } static int display_debug_ranges (struct dwarf_section *section, void *file ATTRIBUTE_UNUSED) { unsigned char *start = section->start; unsigned char *section_end; unsigned long bytes; unsigned char *section_begin = start; unsigned int num_range_list = 0; unsigned long last_offset = 0; unsigned int first = 0; unsigned int i; unsigned int j; int seen_first_offset = 0; int use_debug_info = 1; unsigned char *next; bytes = section->size; section_end = start + bytes; if (bytes == 0) { printf (_("\nThe %s section is empty.\n"), section->name); return 0; } load_debug_info (file); /* Check the order of range list in .debug_info section. If offsets of range lists are in the ascending order, we can use `debug_information' directly. */ for (i = 0; i < num_debug_info_entries; i++) { unsigned int num; num = debug_information [i].num_range_lists; num_range_list += num; /* Check if we can use `debug_information' directly. */ if (use_debug_info && num != 0) { if (!seen_first_offset) { /* This is the first range list. */ last_offset = debug_information [i].range_lists [0]; first = i; seen_first_offset = 1; j = 1; } else j = 0; for (; j < num; j++) { if (last_offset > debug_information [i].range_lists [j]) { use_debug_info = 0; break; } last_offset = debug_information [i].range_lists [j]; } } } if (!use_debug_info) /* FIXME: Should we handle this case? */ error (_("Range lists in .debug_info section aren't in ascending order!\n")); if (!seen_first_offset) error (_("No range lists in .debug_info section!\n")); /* DWARF sections under Mach-O have non-zero addresses. */ if (debug_information [first].num_range_lists > 0 && debug_information [first].range_lists [0] != section->address) warn (_("Range lists in %s section start at 0x%lx\n"), section->name, debug_information [first].range_lists [0]); printf (_("Contents of the %s section:\n\n"), section->name); printf (_(" Offset Begin End\n")); seen_first_offset = 0; for (i = first; i < num_debug_info_entries; i++) { unsigned long begin; unsigned long end; unsigned long offset; unsigned int pointer_size; unsigned long base_address; pointer_size = debug_information [i].pointer_size; for (j = 0; j < debug_information [i].num_range_lists; j++) { /* DWARF sections under Mach-O have non-zero addresses. */ offset = debug_information [i].range_lists [j] - section->address; next = section_begin + offset; base_address = debug_information [i].base_address; if (!seen_first_offset) seen_first_offset = 1; else { if (start < next) warn (_("There is a hole [0x%lx - 0x%lx] in %s section.\n"), (long)(start - section_begin), (long)(next - section_begin), section->name); else if (start > next) warn (_("There is an overlap [0x%lx - 0x%lx] in %s section.\n"), (long)(start - section_begin), (long)(next - section_begin), section->name); } start = next; while (1) { begin = byte_get (start, pointer_size); start += pointer_size; end = byte_get (start, pointer_size); start += pointer_size; if (begin == 0 && end == 0) { printf (_(" %8.8lx \n"), offset); break; } /* Check base address specifiers. */ if (begin == -1UL && end != -1UL) { base_address = end; printf (" %8.8lx %8.8lx %8.8lx (base address)\n", offset, begin, end); continue; } printf (" %8.8lx %8.8lx %8.8lx", offset, begin + base_address, end + base_address); if (begin == end) fputs (_(" (start == end)"), stdout); else if (begin > end) fputs (_(" (start > end)"), stdout); putchar ('\n'); } } } putchar ('\n'); return 1; } typedef struct Frame_Chunk { struct Frame_Chunk *next; unsigned char *chunk_start; int ncols; /* DW_CFA_{undefined,same_value,offset,register,unreferenced} */ short int *col_type; int *col_offset; char *augmentation; unsigned int code_factor; int data_factor; unsigned long pc_begin; unsigned long pc_range; int cfa_reg; int cfa_offset; int ra; unsigned char fde_encoding; unsigned char cfa_exp; } Frame_Chunk; /* A marker for a col_type that means this column was never referenced in the frame info. */ #define DW_CFA_unreferenced (-1) static void frame_need_space (Frame_Chunk *fc, int reg) { int prev = fc->ncols; if (reg < fc->ncols) return; fc->ncols = reg + 1; fc->col_type = xcrealloc (fc->col_type, fc->ncols, sizeof (short int)); fc->col_offset = xcrealloc (fc->col_offset, fc->ncols, sizeof (int)); while (prev < fc->ncols) { fc->col_type[prev] = DW_CFA_unreferenced; fc->col_offset[prev] = 0; prev++; } } static void frame_display_row (Frame_Chunk *fc, int *need_col_headers, int *max_regs) { int r; char tmp[100]; if (*max_regs < fc->ncols) *max_regs = fc->ncols; if (*need_col_headers) { *need_col_headers = 0; printf (" LOC CFA "); for (r = 0; r < *max_regs; r++) if (fc->col_type[r] != DW_CFA_unreferenced) { if (r == fc->ra) printf ("ra "); else printf ("r%-4d", r); } printf ("\n"); } printf ("%08lx ", fc->pc_begin); if (fc->cfa_exp) strcpy (tmp, "exp"); else sprintf (tmp, "r%d%+d", fc->cfa_reg, fc->cfa_offset); printf ("%-8s ", tmp); for (r = 0; r < fc->ncols; r++) { if (fc->col_type[r] != DW_CFA_unreferenced) { switch (fc->col_type[r]) { case DW_CFA_undefined: strcpy (tmp, "u"); break; case DW_CFA_same_value: strcpy (tmp, "s"); break; case DW_CFA_offset: sprintf (tmp, "c%+d", fc->col_offset[r]); break; case DW_CFA_val_offset: sprintf (tmp, "v%+d", fc->col_offset[r]); break; case DW_CFA_register: sprintf (tmp, "r%d", fc->col_offset[r]); break; case DW_CFA_expression: strcpy (tmp, "exp"); break; case DW_CFA_val_expression: strcpy (tmp, "vexp"); break; default: strcpy (tmp, "n/a"); break; } printf ("%-5s", tmp); } } printf ("\n"); } static int size_of_encoded_value (int encoding) { switch (encoding & 0x7) { default: /* ??? */ case 0: return eh_addr_size; case 2: return 2; case 3: return 4; case 4: return 8; } } static dwarf_vma get_encoded_value (unsigned char *data, int encoding) { int size = size_of_encoded_value (encoding); if (encoding & DW_EH_PE_signed) return byte_get_signed (data, size); else return byte_get (data, size); } #define GET(N) byte_get (start, N); start += N #define LEB() read_leb128 (start, & length_return, 0); start += length_return #define SLEB() read_leb128 (start, & length_return, 1); start += length_return static int display_debug_frames (struct dwarf_section *section, void *file ATTRIBUTE_UNUSED) { unsigned char *start = section->start; unsigned char *end = start + section->size; unsigned char *section_start = start; Frame_Chunk *chunks = 0; Frame_Chunk *remembered_state = 0; Frame_Chunk *rs; int is_eh = strcmp (section->name, ".eh_frame") == 0; unsigned int length_return; int max_regs = 0; printf (_("The section %s contains:\n"), section->name); while (start < end) { unsigned char *saved_start; unsigned char *block_end; unsigned long length; unsigned long cie_id; Frame_Chunk *fc; Frame_Chunk *cie; int need_col_headers = 1; unsigned char *augmentation_data = NULL; unsigned long augmentation_data_len = 0; int encoded_ptr_size = eh_addr_size; int offset_size; int initial_length_size; saved_start = start; length = byte_get (start, 4); start += 4; if (length == 0) { printf ("\n%08lx ZERO terminator\n\n", (unsigned long)(saved_start - section_start)); continue; } if (length == 0xffffffff) { length = byte_get (start, 8); start += 8; offset_size = 8; initial_length_size = 12; } else { offset_size = 4; initial_length_size = 4; } block_end = saved_start + length + initial_length_size; if (block_end > end) { warn ("Invalid length %#08lx in FDE at %#08lx\n", length, (unsigned long)(saved_start - section_start)); block_end = end; } cie_id = byte_get (start, offset_size); start += offset_size; if (is_eh ? (cie_id == 0) : (cie_id == DW_CIE_ID)) { int version; fc = xmalloc (sizeof (Frame_Chunk)); memset (fc, 0, sizeof (Frame_Chunk)); fc->next = chunks; chunks = fc; fc->chunk_start = saved_start; fc->ncols = 0; fc->col_type = xmalloc (sizeof (short int)); fc->col_offset = xmalloc (sizeof (int)); frame_need_space (fc, max_regs-1); version = *start++; fc->augmentation = (char *) start; start = (unsigned char *) strchr ((char *) start, '\0') + 1; if (fc->augmentation[0] == 'z') { fc->code_factor = LEB (); fc->data_factor = SLEB (); if (version == 1) { fc->ra = GET (1); } else { fc->ra = LEB (); } augmentation_data_len = LEB (); augmentation_data = start; start += augmentation_data_len; } else if (strcmp (fc->augmentation, "eh") == 0) { start += eh_addr_size; fc->code_factor = LEB (); fc->data_factor = SLEB (); if (version == 1) { fc->ra = GET (1); } else { fc->ra = LEB (); } } else { fc->code_factor = LEB (); fc->data_factor = SLEB (); if (version == 1) { fc->ra = GET (1); } else { fc->ra = LEB (); } } cie = fc; if (do_debug_frames_interp) printf ("\n%08lx %08lx %08lx CIE \"%s\" cf=%d df=%d ra=%d\n", (unsigned long)(saved_start - section_start), length, cie_id, fc->augmentation, fc->code_factor, fc->data_factor, fc->ra); else { printf ("\n%08lx %08lx %08lx CIE\n", (unsigned long)(saved_start - section_start), length, cie_id); printf (" Version: %d\n", version); printf (" Augmentation: \"%s\"\n", fc->augmentation); printf (" Code alignment factor: %u\n", fc->code_factor); printf (" Data alignment factor: %d\n", fc->data_factor); printf (" Return address column: %d\n", fc->ra); if (augmentation_data_len) { unsigned long i; printf (" Augmentation data: "); for (i = 0; i < augmentation_data_len; ++i) printf (" %02x", augmentation_data[i]); putchar ('\n'); } putchar ('\n'); } if (augmentation_data_len) { unsigned char *p, *q; p = (unsigned char *) fc->augmentation + 1; q = augmentation_data; while (1) { if (*p == 'L') q++; else if (*p == 'P') q += 1 + size_of_encoded_value (*q); else if (*p == 'R') fc->fde_encoding = *q++; else break; p++; } if (fc->fde_encoding) encoded_ptr_size = size_of_encoded_value (fc->fde_encoding); } frame_need_space (fc, fc->ra); } else { unsigned char *look_for; static Frame_Chunk fde_fc; fc = & fde_fc; memset (fc, 0, sizeof (Frame_Chunk)); look_for = is_eh ? start - 4 - cie_id : section_start + cie_id; for (cie = chunks; cie ; cie = cie->next) if (cie->chunk_start == look_for) break; if (!cie) { warn ("Invalid CIE pointer %#08lx in FDE at %#08lx\n", cie_id, (unsigned long)(saved_start - section_start)); fc->ncols = 0; fc->col_type = xmalloc (sizeof (short int)); fc->col_offset = xmalloc (sizeof (int)); frame_need_space (fc, max_regs - 1); cie = fc; fc->augmentation = ""; fc->fde_encoding = 0; } else { fc->ncols = cie->ncols; fc->col_type = xcmalloc (fc->ncols, sizeof (short int)); fc->col_offset = xcmalloc (fc->ncols, sizeof (int)); memcpy (fc->col_type, cie->col_type, fc->ncols * sizeof (short int)); memcpy (fc->col_offset, cie->col_offset, fc->ncols * sizeof (int)); fc->augmentation = cie->augmentation; fc->code_factor = cie->code_factor; fc->data_factor = cie->data_factor; fc->cfa_reg = cie->cfa_reg; fc->cfa_offset = cie->cfa_offset; fc->ra = cie->ra; frame_need_space (fc, max_regs-1); fc->fde_encoding = cie->fde_encoding; } if (fc->fde_encoding) encoded_ptr_size = size_of_encoded_value (fc->fde_encoding); fc->pc_begin = get_encoded_value (start, fc->fde_encoding); if ((fc->fde_encoding & 0x70) == DW_EH_PE_pcrel /* Don't adjust for relocatable file since there's invariably a pcrel reloc here, which we haven't applied. */ && !is_relocatable) fc->pc_begin += section->address + (start - section_start); start += encoded_ptr_size; fc->pc_range = byte_get (start, encoded_ptr_size); start += encoded_ptr_size; if (cie->augmentation[0] == 'z') { augmentation_data_len = LEB (); augmentation_data = start; start += augmentation_data_len; } printf ("\n%08lx %08lx %08lx FDE cie=%08lx pc=%08lx..%08lx\n", (unsigned long)(saved_start - section_start), length, cie_id, (unsigned long)(cie->chunk_start - section_start), fc->pc_begin, fc->pc_begin + fc->pc_range); if (! do_debug_frames_interp && augmentation_data_len) { unsigned long i; printf (" Augmentation data: "); for (i = 0; i < augmentation_data_len; ++i) printf (" %02x", augmentation_data[i]); putchar ('\n'); putchar ('\n'); } } /* At this point, fc is the current chunk, cie (if any) is set, and we're about to interpret instructions for the chunk. */ /* ??? At present we need to do this always, since this sizes the fc->col_type and fc->col_offset arrays, which we write into always. We should probably split the interpreted and non-interpreted bits into two different routines, since there's so much that doesn't really overlap between them. */ if (1 || do_debug_frames_interp) { /* Start by making a pass over the chunk, allocating storage and taking note of what registers are used. */ unsigned char *tmp = start; while (start < block_end) { unsigned op, opa; unsigned long reg, tmp; op = *start++; opa = op & 0x3f; if (op & 0xc0) op &= 0xc0; /* Warning: if you add any more cases to this switch, be sure to add them to the corresponding switch below. */ switch (op) { case DW_CFA_advance_loc: break; case DW_CFA_offset: LEB (); frame_need_space (fc, opa); fc->col_type[opa] = DW_CFA_undefined; break; case DW_CFA_restore: frame_need_space (fc, opa); fc->col_type[opa] = DW_CFA_undefined; break; case DW_CFA_set_loc: start += encoded_ptr_size; break; case DW_CFA_advance_loc1: start += 1; break; case DW_CFA_advance_loc2: start += 2; break; case DW_CFA_advance_loc4: start += 4; break; case DW_CFA_offset_extended: case DW_CFA_val_offset: reg = LEB (); LEB (); frame_need_space (fc, reg); fc->col_type[reg] = DW_CFA_undefined; break; case DW_CFA_restore_extended: reg = LEB (); frame_need_space (fc, reg); fc->col_type[reg] = DW_CFA_undefined; break; case DW_CFA_undefined: reg = LEB (); frame_need_space (fc, reg); fc->col_type[reg] = DW_CFA_undefined; break; case DW_CFA_same_value: reg = LEB (); frame_need_space (fc, reg); fc->col_type[reg] = DW_CFA_undefined; break; case DW_CFA_register: reg = LEB (); LEB (); frame_need_space (fc, reg); fc->col_type[reg] = DW_CFA_undefined; break; case DW_CFA_def_cfa: LEB (); LEB (); break; case DW_CFA_def_cfa_register: LEB (); break; case DW_CFA_def_cfa_offset: LEB (); break; case DW_CFA_def_cfa_expression: tmp = LEB (); start += tmp; break; case DW_CFA_expression: case DW_CFA_val_expression: reg = LEB (); tmp = LEB (); start += tmp; frame_need_space (fc, reg); fc->col_type[reg] = DW_CFA_undefined; break; case DW_CFA_offset_extended_sf: case DW_CFA_val_offset_sf: reg = LEB (); SLEB (); frame_need_space (fc, reg); fc->col_type[reg] = DW_CFA_undefined; break; case DW_CFA_def_cfa_sf: LEB (); SLEB (); break; case DW_CFA_def_cfa_offset_sf: SLEB (); break; case DW_CFA_MIPS_advance_loc8: start += 8; break; case DW_CFA_GNU_args_size: LEB (); break; case DW_CFA_GNU_negative_offset_extended: reg = LEB (); LEB (); frame_need_space (fc, reg); fc->col_type[reg] = DW_CFA_undefined; default: break; } } start = tmp; } /* Now we know what registers are used, make a second pass over the chunk, this time actually printing out the info. */ while (start < block_end) { unsigned op, opa; unsigned long ul, reg, roffs; long l, ofs; dwarf_vma vma; op = *start++; opa = op & 0x3f; if (op & 0xc0) op &= 0xc0; /* Warning: if you add any more cases to this switch, be sure to add them to the corresponding switch above. */ switch (op) { case DW_CFA_advance_loc: if (do_debug_frames_interp) frame_display_row (fc, &need_col_headers, &max_regs); else printf (" DW_CFA_advance_loc: %d to %08lx\n", opa * fc->code_factor, fc->pc_begin + opa * fc->code_factor); fc->pc_begin += opa * fc->code_factor; break; case DW_CFA_offset: roffs = LEB (); if (! do_debug_frames_interp) printf (" DW_CFA_offset: r%d at cfa%+ld\n", opa, roffs * fc->data_factor); fc->col_type[opa] = DW_CFA_offset; fc->col_offset[opa] = roffs * fc->data_factor; break; case DW_CFA_restore: if (! do_debug_frames_interp) printf (" DW_CFA_restore: r%d\n", opa); fc->col_type[opa] = cie->col_type[opa]; fc->col_offset[opa] = cie->col_offset[opa]; break; case DW_CFA_set_loc: vma = get_encoded_value (start, fc->fde_encoding); if ((fc->fde_encoding & 0x70) == DW_EH_PE_pcrel && !is_relocatable) vma += section->address + (start - section_start); start += encoded_ptr_size; if (do_debug_frames_interp) frame_display_row (fc, &need_col_headers, &max_regs); else printf (" DW_CFA_set_loc: %08lx\n", (unsigned long)vma); fc->pc_begin = vma; break; case DW_CFA_advance_loc1: ofs = byte_get (start, 1); start += 1; if (do_debug_frames_interp) frame_display_row (fc, &need_col_headers, &max_regs); else printf (" DW_CFA_advance_loc1: %ld to %08lx\n", ofs * fc->code_factor, fc->pc_begin + ofs * fc->code_factor); fc->pc_begin += ofs * fc->code_factor; break; case DW_CFA_advance_loc2: ofs = byte_get (start, 2); start += 2; if (do_debug_frames_interp) frame_display_row (fc, &need_col_headers, &max_regs); else printf (" DW_CFA_advance_loc2: %ld to %08lx\n", ofs * fc->code_factor, fc->pc_begin + ofs * fc->code_factor); fc->pc_begin += ofs * fc->code_factor; break; case DW_CFA_advance_loc4: ofs = byte_get (start, 4); start += 4; if (do_debug_frames_interp) frame_display_row (fc, &need_col_headers, &max_regs); else printf (" DW_CFA_advance_loc4: %ld to %08lx\n", ofs * fc->code_factor, fc->pc_begin + ofs * fc->code_factor); fc->pc_begin += ofs * fc->code_factor; break; case DW_CFA_offset_extended: reg = LEB (); roffs = LEB (); if (! do_debug_frames_interp) printf (" DW_CFA_offset_extended: r%ld at cfa%+ld\n", reg, roffs * fc->data_factor); fc->col_type[reg] = DW_CFA_offset; fc->col_offset[reg] = roffs * fc->data_factor; break; case DW_CFA_val_offset: reg = LEB (); roffs = LEB (); if (! do_debug_frames_interp) printf (" DW_CFA_val_offset: r%ld at cfa%+ld\n", reg, roffs * fc->data_factor); fc->col_type[reg] = DW_CFA_val_offset; fc->col_offset[reg] = roffs * fc->data_factor; break; case DW_CFA_restore_extended: reg = LEB (); if (! do_debug_frames_interp) printf (" DW_CFA_restore_extended: r%ld\n", reg); fc->col_type[reg] = cie->col_type[reg]; fc->col_offset[reg] = cie->col_offset[reg]; break; case DW_CFA_undefined: reg = LEB (); if (! do_debug_frames_interp) printf (" DW_CFA_undefined: r%ld\n", reg); fc->col_type[reg] = DW_CFA_undefined; fc->col_offset[reg] = 0; break; case DW_CFA_same_value: reg = LEB (); if (! do_debug_frames_interp) printf (" DW_CFA_same_value: r%ld\n", reg); fc->col_type[reg] = DW_CFA_same_value; fc->col_offset[reg] = 0; break; case DW_CFA_register: reg = LEB (); roffs = LEB (); if (! do_debug_frames_interp) printf (" DW_CFA_register: r%ld in r%ld\n", reg, roffs); fc->col_type[reg] = DW_CFA_register; fc->col_offset[reg] = roffs; break; case DW_CFA_remember_state: if (! do_debug_frames_interp) printf (" DW_CFA_remember_state\n"); rs = xmalloc (sizeof (Frame_Chunk)); rs->ncols = fc->ncols; rs->col_type = xcmalloc (rs->ncols, sizeof (short int)); rs->col_offset = xcmalloc (rs->ncols, sizeof (int)); memcpy (rs->col_type, fc->col_type, rs->ncols); memcpy (rs->col_offset, fc->col_offset, rs->ncols * sizeof (int)); rs->next = remembered_state; remembered_state = rs; break; case DW_CFA_restore_state: if (! do_debug_frames_interp) printf (" DW_CFA_restore_state\n"); rs = remembered_state; if (rs) { remembered_state = rs->next; frame_need_space (fc, rs->ncols-1); memcpy (fc->col_type, rs->col_type, rs->ncols); memcpy (fc->col_offset, rs->col_offset, rs->ncols * sizeof (int)); free (rs->col_type); free (rs->col_offset); free (rs); } else if (do_debug_frames_interp) printf ("Mismatched DW_CFA_restore_state\n"); break; case DW_CFA_def_cfa: fc->cfa_reg = LEB (); fc->cfa_offset = LEB (); fc->cfa_exp = 0; if (! do_debug_frames_interp) printf (" DW_CFA_def_cfa: r%d ofs %d\n", fc->cfa_reg, fc->cfa_offset); break; case DW_CFA_def_cfa_register: fc->cfa_reg = LEB (); fc->cfa_exp = 0; if (! do_debug_frames_interp) printf (" DW_CFA_def_cfa_reg: r%d\n", fc->cfa_reg); break; case DW_CFA_def_cfa_offset: fc->cfa_offset = LEB (); if (! do_debug_frames_interp) printf (" DW_CFA_def_cfa_offset: %d\n", fc->cfa_offset); break; case DW_CFA_nop: if (! do_debug_frames_interp) printf (" DW_CFA_nop\n"); break; case DW_CFA_def_cfa_expression: ul = LEB (); if (! do_debug_frames_interp) { printf (" DW_CFA_def_cfa_expression ("); decode_location_expression (start, eh_addr_size, ul, 0); printf (")\n"); } fc->cfa_exp = 1; start += ul; break; case DW_CFA_expression: reg = LEB (); ul = LEB (); if (! do_debug_frames_interp) { printf (" DW_CFA_expression: r%ld (", reg); decode_location_expression (start, eh_addr_size, ul, 0); printf (")\n"); } fc->col_type[reg] = DW_CFA_expression; start += ul; break; case DW_CFA_val_expression: reg = LEB (); ul = LEB (); if (! do_debug_frames_interp) { printf (" DW_CFA_val_expression: r%ld (", reg); decode_location_expression (start, eh_addr_size, ul, 0); printf (")\n"); } fc->col_type[reg] = DW_CFA_val_expression; start += ul; break; case DW_CFA_offset_extended_sf: reg = LEB (); l = SLEB (); frame_need_space (fc, reg); if (! do_debug_frames_interp) printf (" DW_CFA_offset_extended_sf: r%ld at cfa%+ld\n", reg, l * fc->data_factor); fc->col_type[reg] = DW_CFA_offset; fc->col_offset[reg] = l * fc->data_factor; break; case DW_CFA_val_offset_sf: reg = LEB (); l = SLEB (); frame_need_space (fc, reg); if (! do_debug_frames_interp) printf (" DW_CFA_val_offset_sf: r%ld at cfa%+ld\n", reg, l * fc->data_factor); fc->col_type[reg] = DW_CFA_val_offset; fc->col_offset[reg] = l * fc->data_factor; break; case DW_CFA_def_cfa_sf: fc->cfa_reg = LEB (); fc->cfa_offset = SLEB (); fc->cfa_offset = fc->cfa_offset * fc->data_factor; fc->cfa_exp = 0; if (! do_debug_frames_interp) printf (" DW_CFA_def_cfa_sf: r%d ofs %d\n", fc->cfa_reg, fc->cfa_offset); break; case DW_CFA_def_cfa_offset_sf: fc->cfa_offset = SLEB (); fc->cfa_offset = fc->cfa_offset * fc->data_factor; if (! do_debug_frames_interp) printf (" DW_CFA_def_cfa_offset_sf: %d\n", fc->cfa_offset); break; case DW_CFA_MIPS_advance_loc8: ofs = byte_get (start, 8); start += 8; if (do_debug_frames_interp) frame_display_row (fc, &need_col_headers, &max_regs); else printf (" DW_CFA_MIPS_advance_loc8: %ld to %08lx\n", ofs * fc->code_factor, fc->pc_begin + ofs * fc->code_factor); fc->pc_begin += ofs * fc->code_factor; break; case DW_CFA_GNU_window_save: if (! do_debug_frames_interp) printf (" DW_CFA_GNU_window_save\n"); break; case DW_CFA_GNU_args_size: ul = LEB (); if (! do_debug_frames_interp) printf (" DW_CFA_GNU_args_size: %ld\n", ul); break; case DW_CFA_GNU_negative_offset_extended: reg = LEB (); l = - LEB (); frame_need_space (fc, reg); if (! do_debug_frames_interp) printf (" DW_CFA_GNU_negative_offset_extended: r%ld at cfa%+ld\n", reg, l * fc->data_factor); fc->col_type[reg] = DW_CFA_offset; fc->col_offset[reg] = l * fc->data_factor; break; default: if (op >= DW_CFA_lo_user && op <= DW_CFA_hi_user) printf (_(" DW_CFA_??? (User defined call frame op: %#x)\n"), op); else warn (_("unsupported or unknown Dwarf Call Frame Instruction number: %#x\n"), op); start = block_end; } } if (do_debug_frames_interp) frame_display_row (fc, &need_col_headers, &max_regs); start = block_end; } printf ("\n"); return 1; } #undef GET #undef LEB #undef SLEB static int display_debug_not_supported (struct dwarf_section *section, void *file ATTRIBUTE_UNUSED) { printf (_("Displaying the debug contents of section %s is not yet supported.\n"), section->name); return 1; } void * cmalloc (size_t nmemb, size_t size) { /* Check for overflow. */ if (nmemb >= ~(size_t) 0 / size) return NULL; else return malloc (nmemb * size); } void * xcmalloc (size_t nmemb, size_t size) { /* Check for overflow. */ if (nmemb >= ~(size_t) 0 / size) return NULL; else return xmalloc (nmemb * size); } void * xcrealloc (void *ptr, size_t nmemb, size_t size) { /* Check for overflow. */ if (nmemb >= ~(size_t) 0 / size) return NULL; else return xrealloc (ptr, nmemb * size); } void error (const char *message, ...) { va_list args; va_start (args, message); fprintf (stderr, _("%s: Error: "), program_name); vfprintf (stderr, message, args); va_end (args); } void warn (const char *message, ...) { va_list args; va_start (args, message); fprintf (stderr, _("%s: Warning: "), program_name); vfprintf (stderr, message, args); va_end (args); } void free_debug_memory (void) { enum dwarf_section_display_enum i; free_abbrevs (); for (i = 0; i < max; i++) free_debug_section (i); if (debug_information) { for (i = 0; i < num_debug_info_entries; i++) { if (!debug_information [i].max_loc_offsets) { free (debug_information [i].loc_offsets); free (debug_information [i].have_frame_base); } if (!debug_information [i].max_range_lists) free (debug_information [i].range_lists); } free (debug_information); debug_information = NULL; num_debug_info_entries = 0; } } struct dwarf_section_display debug_displays[] = { { { ".debug_abbrev", NULL, 0, 0 }, display_debug_abbrev, 0, 0 }, { { ".debug_aranges", NULL, 0, 0 }, display_debug_aranges, 0, 0 }, { { ".debug_frame", NULL, 0, 0 }, display_debug_frames, 1, 0 }, { { ".debug_info", NULL, 0, 0 }, display_debug_info, 1, 0 }, { { ".debug_line", NULL, 0, 0 }, display_debug_lines, 0, 0 }, { { ".debug_pubnames", NULL, 0, 0 }, display_debug_pubnames, 0, 0 }, { { ".eh_frame", NULL, 0, 0 }, display_debug_frames, 1, 1 }, { { ".debug_macinfo", NULL, 0, 0 }, display_debug_macinfo, 0, 0 }, { { ".debug_str", NULL, 0, 0 }, display_debug_str, 0, 0 }, { { ".debug_loc", NULL, 0, 0 }, display_debug_loc, 0, 0 }, { { ".debug_pubtypes", NULL, 0, 0 }, display_debug_pubnames, 0, 0 }, { { ".debug_ranges", NULL, 0, 0 }, display_debug_ranges, 0, 0 }, { { ".debug_static_func", NULL, 0, 0 }, display_debug_not_supported, 0, 0 }, { { ".debug_static_vars", NULL, 0, 0 }, display_debug_not_supported, 0, 0 }, { { ".debug_types", NULL, 0, 0 }, display_debug_not_supported, 0, 0 }, { { ".debug_weaknames", NULL, 0, 0 }, display_debug_not_supported, 0, 0 } }; Index: stable/9/contrib/binutils =================================================================== --- stable/9/contrib/binutils (revision 249039) +++ stable/9/contrib/binutils (revision 249040) Property changes on: stable/9/contrib/binutils ___________________________________________________________________ Modified: svn:mergeinfo ## -0,0 +0,1 ## Merged /head/contrib/binutils:r248802