/usr/src/gnu/usr.bin/binutils/bfd/dwarf2.c

Bug Summary

File:	src/gnu/usr.bin/binutils/bfd/dwarf2.c
Warning:	line 1533, column 21 Assigned value is garbage or undefined
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name dwarf2.c -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 1 -pic-is-pie -mframe-pointer=all -relaxed-aliasing -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -target-feature +retpoline-indirect-calls -target-feature +retpoline-indirect-branches -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/gnu/usr.bin/binutils/obj/bfd -resource-dir /usr/local/lib/clang/13.0.0 -D HAVE_CONFIG_H -I . -I /usr/src/gnu/usr.bin/binutils/bfd -I . -D _GNU_SOURCE -D NETBSD_CORE -I . -I /usr/src/gnu/usr.bin/binutils/bfd -I /usr/src/gnu/usr.bin/binutils/bfd/../include -I /usr/src/gnu/usr.bin/binutils/bfd/../intl -I ../intl -D PIE_DEFAULT=1 -internal-isystem /usr/local/lib/clang/13.0.0/include -internal-externc-isystem /usr/include -O2 -fdebug-compilation-dir=/usr/src/gnu/usr.bin/binutils/obj/bfd -ferror-limit 19 -fwrapv -D_RET_PROTECTOR -ret-protector -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/vmm/scan-build/2022-01-12-194120-40624-1 -x c /usr/src/gnu/usr.bin/binutils/bfd/dwarf2.c
1/* DWARF 2 support.
 Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003,
 2004 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */

32#include "bfd.h"
33#include "sysdep.h"
34#include "libiberty.h"
35#include "libbfd.h"
36#include "elf-bfd.h"
37#include "elf/dwarf2.h"

39/* The data in the .debug_line statement prologue looks like this.  */

41struct line_head
42{
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;
52};

54/* Attributes have a name and a value.  */

56struct attribute
57{
enum dwarf_attribute name;
enum dwarf_form form;
union
{
  char *str;
  struct dwarf_block *blk;
  bfd_uint64_t val;
  bfd_int64_t sval;
}
u;
68};

70/* Blocks are a bunch of untyped bytes.  */
71struct dwarf_block
72{
unsigned int size;
char *data;
75};

77struct dwarf2_debug
78{
/* 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.  */
char* info_ptr;

/* Pointer to the end of the .debug_info section memory buffer.  */
char* info_ptr_end;

/* Pointer to the section and address of the beginning of the
   section.  */
asection* sec;
char* sec_info_ptr;

/* Pointer to the symbol table.  */
asymbol** syms;

/* Pointer to the .debug_abbrev section loaded into memory.  */
char* dwarf_abbrev_buffer;

/* Length of the loaded .debug_abbrev section.  */
unsigned long dwarf_abbrev_size;

/* Buffer for decode_line_info.  */
char *dwarf_line_buffer;

/* Length of the loaded .debug_line section.  */
unsigned long dwarf_line_size;

/* Pointer to the .debug_str section loaded into memory.  */
char* dwarf_str_buffer;

/* Length of the loaded .debug_str section.  */
unsigned long dwarf_str_size;
115};

117struct arange
118{
struct arange *next;
bfd_vma low;
bfd_vma high;
122};

124/* A minimal decoding of DWARF2 compilation units.  We only decode
 what's needed to get to the line number information.  */

127struct comp_unit
128{
/* Chain the previously read compilation units.  */
struct comp_unit* next_unit;

/* Keep the bdf convenient (for memory allocation).  */
bfd* abfd;

/* The lowest and higest 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;

/* The offset into .debug_line of the line number table.  */
unsigned long line_offset;

/* Pointer to the first child die for the comp unit.  */
char *first_child_die_ptr;

/* The end of the comp unit.  */
char *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;

/* 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;
177};

179/* This data structure holds the information of an abbrev.  */
180struct abbrev_info
181{
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.  */
188};

190struct attr_abbrev
191{
enum dwarf_attribute name;
enum dwarf_form form;
194};

196#ifndef ABBREV_HASH_SIZE121
197#define ABBREV_HASH_SIZE121 121
198#endif
199#ifndef ATTR_ALLOC_CHUNK4
200#define ATTR_ALLOC_CHUNK4 4
201#endif

203/* VERBATIM
 The following function up to the END VERBATIM mark are
 copied directly from dwarf2read.c.  */

207/* Read dwarf information from a buffer.  */

209static unsigned int
210read_1_byte (bfd *abfd ATTRIBUTE_UNUSED__attribute__ ((__unused__)), char *buf)
211{
return bfd_get_8 (abfd, buf)(*(unsigned char *) (buf) & 0xff);
213}

215static int
216read_1_signed_byte (bfd *abfd ATTRIBUTE_UNUSED__attribute__ ((__unused__)), char *buf)
217{
return bfd_get_signed_8 (abfd, buf)(((*(unsigned char *) (buf) & 0xff) ^ 0x80) - 0x80);
219}

221static unsigned int
222read_2_bytes (bfd *abfd, char *buf)
223{
return bfd_get_16 (abfd, buf)((*((abfd)->xvec->bfd_getx16)) (buf));
225}

227static unsigned int
228read_4_bytes (bfd *abfd, char *buf)
229{
return bfd_get_32 (abfd, buf)((*((abfd)->xvec->bfd_getx32)) (buf));
231}

233static bfd_uint64_t
234read_8_bytes (bfd *abfd, char *buf)
235{
return bfd_get_64 (abfd, buf)((*((abfd)->xvec->bfd_getx64)) (buf));
237}

239static char *
240read_n_bytes (bfd *abfd ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
     char *buf,
     unsigned int size ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
243{
/* 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;
248}

250static char *
251read_string (bfd *abfd ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
    char *buf,
    unsigned int *bytes_read_ptr)
254{
/* Return a pointer to the embedded string.  */
if (*buf == '\0')
  {
    *bytes_read_ptr = 1;
    return NULL((void*)0);
  }

*bytes_read_ptr = strlen (buf) + 1;
return buf;
264}

266static char *
267read_indirect_string (struct comp_unit* unit,
      char *buf,
      unsigned int *bytes_read_ptr)
270{
bfd_uint64_t offset;
struct dwarf2_debug *stash = unit->stash;

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;

    msec = bfd_get_section_by_name (abfd, ".debug_str");
    if (! msec)
{
 (*_bfd_error_handler)
   (_("Dwarf Error: Can't find .debug_str section.")("Dwarf Error: Can't find .debug_str section."));
 bfd_set_error (bfd_error_bad_value);
 return NULL((void*)0);
}

    stash->dwarf_str_size = msec->_raw_size;
    stash->dwarf_str_buffer = bfd_alloc (abfd, msec->_raw_size);
    if (! stash->dwarf_abbrev_buffer)
return NULL((void*)0);

    if (! bfd_get_section_contents (abfd, msec, stash->dwarf_str_buffer,
		      0, msec->_raw_size))
return NULL((void*)0);
  }

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).")("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((void*)0);
  }

buf = stash->dwarf_str_buffer + offset;
if (*buf == '\0')
  return NULL((void*)0);
return buf;
316}

318static unsigned int
319read_unsigned_leb128 (bfd *abfd ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
      char *buf,
      unsigned int *bytes_read_ptr)
322{
unsigned int  result;
unsigned int  num_read;
int           shift;
unsigned char byte;

result   = 0;
shift    = 0;
num_read = 0;

do
33
←
Loop condition is false.  Exiting loop→
42
←
Loop condition is false.  Exiting loop→
  {
    byte = bfd_get_8 (abfd, buf)(*(unsigned char *) (buf) & 0xff);
    buf ++;
    num_read ++;
    result |= ((byte & 0x7f) << shift);
    shift += 7;
  }
while (byte & 0x80);

* bytes_read_ptr = num_read;

return result;
34
←
Returning value (loaded from 'result'), which participates in a condition later→
43
←
Returning value (loaded from 'result'), which participates in a condition later→
345}

347static int
348read_signed_leb128 (bfd *abfd ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
    char *buf,
    unsigned int * bytes_read_ptr)
351{
int           result;
int           shift;
int           num_read;
unsigned char byte;

result = 0;
shift = 0;
num_read = 0;

do
  {
    byte = bfd_get_8 (abfd, buf)(*(unsigned char *) (buf) & 0xff);
    buf ++;
    num_read ++;
    result |= ((byte & 0x7f) << shift);
    shift += 7;
  }
while (byte & 0x80);

if ((shift < 32) && (byte & 0x40))
  result |= -(1 << shift);

* bytes_read_ptr = num_read;

return result;
377}

379/* END VERBATIM */

381static bfd_uint64_t
382read_address (struct comp_unit *unit, char *buf)
383{
switch (unit->addr_size)
  {
  case 8:
    return bfd_get_64 (unit->abfd, buf)((*((unit->abfd)->xvec->bfd_getx64)) (buf));
  case 4:
    return bfd_get_32 (unit->abfd, buf)((*((unit->abfd)->xvec->bfd_getx32)) (buf));
  case 2:
    return bfd_get_16 (unit->abfd, buf)((*((unit->abfd)->xvec->bfd_getx16)) (buf));
  default:
    abort ()_bfd_abort ("/usr/src/gnu/usr.bin/binutils/bfd/dwarf2.c", 393
, __PRETTY_FUNCTION__);
  }
395}

397/* Lookup an abbrev_info structure in the abbrev hash table.  */

399static struct abbrev_info *
400lookup_abbrev (unsigned int number, struct abbrev_info **abbrevs)
401{
unsigned int hash_number;
struct abbrev_info *abbrev;

hash_number = number % ABBREV_HASH_SIZE121;
abbrev = abbrevs[hash_number];

while (abbrev)
48
←
Loop condition is true.  Entering loop body→
  {
    if (abbrev->number == number)
49
←
Assuming 'number' is equal to field 'number'→
50
←
Taking true branch→
return abbrev;
51
←
Returning pointer (loaded from 'abbrev'), which participates in a condition later→
    else
abbrev = abbrev->next;
  }

return NULL((void*)0);
417}

419/* 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.  */

424static struct abbrev_info**
425read_abbrevs (bfd *abfd, bfd_uint64_t offset, struct dwarf2_debug *stash)
426{
struct abbrev_info **abbrevs;
char *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)
28
←
Assuming field 'dwarf_abbrev_buffer' is non-null, which participates in a condition later→
29
←
Taking false branch→
  {
    asection *msec;

    msec = bfd_get_section_by_name (abfd, ".debug_abbrev");
    if (! msec)
{
 (*_bfd_error_handler) (_("Dwarf Error: Can't find .debug_abbrev section.")("Dwarf Error: Can't find .debug_abbrev section."));
 bfd_set_error (bfd_error_bad_value);
 return 0;
}

    stash->dwarf_abbrev_size = msec->_raw_size;
    stash->dwarf_abbrev_buffer
= bfd_simple_get_relocated_section_contents (abfd, msec, NULL((void*)0),
				     stash->syms);
    if (! stash->dwarf_abbrev_buffer)
 return 0;
  }

if (offset >= stash->dwarf_abbrev_size)
30
←
Assuming 'offset' is < field 'dwarf_abbrev_size'→
31
←
Taking false branch→
  {
    (*_bfd_error_handler) (_("Dwarf Error: Abbrev offset (%lu) greater than or equal to .debug_abbrev size (%lu).")("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_SIZE121;
abbrevs = bfd_zalloc (abfd, amt);

abbrev_ptr = stash->dwarf_abbrev_buffer + offset;
abbrev_number = read_unsigned_leb128 (abfd, abbrev_ptr, &bytes_read);
32
←
Calling 'read_unsigned_leb128'→
35
←
Returning from 'read_unsigned_leb128'→
abbrev_ptr += bytes_read;

/* Loop until we reach an abbrev number of 0.  */
while (abbrev_number)
36
←
Loop condition is false. Execution continues on line 530→
  {
    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_CHUNK4) == 0)
   {
     amt = cur_abbrev->num_attrs + ATTR_ALLOC_CHUNK4;
     amt *= sizeof (struct attr_abbrev);
     cur_abbrev->attrs = bfd_realloc (cur_abbrev->attrs, amt);
     if (! cur_abbrev->attrs)
return 0;
   }

 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_SIZE121;
    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((void*)0))
break;
  }

return abbrevs;
37
←
Returning pointer (loaded from 'abbrevs'), which participates in a condition later→
531}

533/* Read an attribute value described by an attribute form.  */

535static char *
536read_attribute_value (struct attribute *attr,
      unsigned form,
      struct comp_unit *unit,
      char *info_ptr)
540{
bfd *abfd = unit->abfd;
unsigned int bytes_read;
struct dwarf_block *blk;
bfd_size_type amt;

attr->form = (enum dwarf_form) form;

switch (form)
59
←
Control jumps to the 'default' case at line 653→
  {
  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_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.")("Dwarf Error: Invalid or unhandled FORM value: %u."),
	     form);
    bfd_set_error (bfd_error_bad_value);
  }
return info_ptr;
60
←
Returning without writing to 'attr->name', which participates in a condition later→
61
←
Returning without writing to 'attr->u.val'→
659}

661/* Read an attribute described by an abbreviated attribute.  */

663static char *
664read_attribute (struct attribute *attr,
struct attr_abbrev *abbrev,
struct comp_unit *unit,
char *info_ptr)
668{
attr->name = abbrev->name;
57
←
Value assigned to 'attr.name', which participates in a condition later→
info_ptr = read_attribute_value (attr, abbrev->form, unit, info_ptr);
58
←
Calling 'read_attribute_value'→
62
←
Returning from 'read_attribute_value'→
return info_ptr;
63
←
Returning without writing to 'attr->u.val'→
672}

674/* Source line information table routines.  */

676#define FILE_ALLOC_CHUNK5 5
677#define DIR_ALLOC_CHUNK5 5

679struct line_info
680{
struct line_info* prev_line;
bfd_vma address;
char* filename;
unsigned int line;
unsigned int column;
int end_sequence;		/* End of (sequential) code sequence.  */
687};

689struct fileinfo
690{
char *name;
unsigned int dir;
unsigned int time;
unsigned int size;
695};

697struct line_info_table
698{
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' */
707};

709struct funcinfo
710{
struct funcinfo *prev_func;
char* name;
bfd_vma low;
bfd_vma high;
715};

717/* 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.  */

722static void
723add_line_info (struct line_info_table *table,
      bfd_vma address,
      char *filename,
      unsigned int line,
      unsigned int column,
      int end_sequence)
729{
bfd_size_type amt = sizeof (struct line_info);
struct line_info* info = bfd_alloc (table->abfd, amt);

/* 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'.  */

while (1)
  if (!table->last_line
|| address >= table->last_line->address)
    {
/* 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;
break;
    }
  else if (!table->lcl_head->prev_line
    && table->lcl_head->address > address)
    {
/* Abnormal but easy: lcl_head is 1) at the *end* of the line
  list and 2) the head of 'info'.  */
info->prev_line = NULL((void*)0);
table->lcl_head->prev_line = info;
break;
    }
  else if (table->lcl_head->prev_line
    && table->lcl_head->address > address
    && address >= table->lcl_head->prev_line->address)
    {
/* Abnormal but easy: lcl_head is 1) in the *middle* of the line
  list and 2) the head of 'info'.  */
info->prev_line = table->lcl_head->prev_line;
table->lcl_head->prev_line = info;
break;
    }
  else
    {
/* Abnormal and hard: Neither 'last_line' nor 'lcl_head' are valid
  heads for 'info'.  Reset 'lcl_head' and repeat.  */
struct line_info* li2 = table->last_line; /* always non-NULL */
struct line_info* li1 = li2->prev_line;

while (li1)
 {
   if (li2->address > address && address >= li1->address)
     break;

   li2 = li1; /* always non-NULL */
   li1 = li1->prev_line;
 }
table->lcl_head = li2;
    }

/* 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((void*)0);
812}

814/* 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.  */

818static char *
819concat_filename (struct line_info_table *table, unsigned int file)
820{
char* filename;

if (file - 1 >= table->num_files)
  {
    (*_bfd_error_handler)
(_("Dwarf Error: mangled line number section (bad file number).")("Dwarf Error: mangled line number section (bad file number)."
));
    return strdup ("<unknown>");
  }

filename = table->files[file - 1].name;

if (! IS_ABSOLUTE_PATH (filename)((((filename)[0]) == '/')))
  {
    char* dirname = (table->files[file - 1].dir
       ? table->dirs[table->files[file - 1].dir - 1]
       : table->comp_dir);

    /* Not all tools set DW_AT_comp_dir, so dirname may be unknown.
The best we can do is return the filename part.  */
    if (dirname != NULL((void*)0))
{
 unsigned int len = strlen (dirname) + strlen (filename) + 2;
 char * name;

 name = bfd_malloc (len);
 if (name)
   sprintf (name, "%s/%s", dirname, filename);
 return name;
}
  }

return strdup (filename);
853}

855static void
856arange_add (struct comp_unit *unit, bfd_vma low_pc, bfd_vma high_pc)
857{
struct arange *arange;

/* First see if we can cheaply extend an existing range.  */
arange = &unit->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);

if (unit->arange.high == 0)
  {
    /* This is the first address range: store it in unit->arange.  */
    unit->arange.next = 0;
    unit->arange.low = low_pc;
    unit->arange.high = high_pc;
    return;
  }

/* Need to allocate a new arange and insert it into the arange list.  */
arange = bfd_zalloc (unit->abfd, sizeof (*arange));
arange->low = low_pc;
arange->high = high_pc;

arange->next = unit->arange.next;
unit->arange.next = arange;
895}

897/* Decode the line number information for UNIT.  */

899static struct line_info_table*
900decode_line_info (struct comp_unit *unit, struct dwarf2_debug *stash)
901{
bfd *abfd = unit->abfd;
struct line_info_table* table;
char *line_ptr;
char *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.")("Dwarf Error: Can't find .debug_line section."));
 bfd_set_error (bfd_error_bad_value);
 return 0;
}

    stash->dwarf_line_size = msec->_raw_size;
    stash->dwarf_line_buffer
= bfd_simple_get_relocated_section_contents (abfd, msec, NULL((void*)0),
				     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).")("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((void*)0);

table->num_dirs = 0;
table->dirs = NULL((void*)0);

table->files = NULL((void*)0);
table->last_line = NULL((void*)0);
table->lcl_head = NULL((void*)0);

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((void*)0))
  {
    line_ptr += bytes_read;

    if ((table->num_dirs % DIR_ALLOC_CHUNK5) == 0)
{
 amt = table->num_dirs + DIR_ALLOC_CHUNK5;
 amt *= sizeof (char *);
 table->dirs = bfd_realloc (table->dirs, amt);
 if (! table->dirs)
   return 0;
}

    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((void*)0))
  {
    line_ptr += bytes_read;

    if ((table->num_files % FILE_ALLOC_CHUNK5) == 0)
{
 amt = table->num_files + FILE_ALLOC_CHUNK5;
 amt *= sizeof (struct fileinfo);
 table->files = bfd_realloc (table->files, amt);
 if (! table->files)
   return 0;
}

    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((void*)0);
    unsigned int line = 1;
    unsigned int column = 0;
    int is_stmt = lh.default_is_stmt;
    int basic_block = 0;
    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  = 0;
    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);
     basic_block = 1;
     if (low_pc == 0 || 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 (low_pc == 0 || address < low_pc)
    low_pc = address;
  if (address > high_pc)
    high_pc = address;
  arange_add (unit, 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_CHUNK5) == 0)
    {
      amt = table->num_files + FILE_ALLOC_CHUNK5;
      amt *= sizeof (struct fileinfo);
      table->files = bfd_realloc (table->files, amt);
      if (! table->files)
	return 0;
    }
  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.")("Dwarf Error: mangled line number section."));
  bfd_set_error (bfd_error_bad_value);
  return 0;
}
     break;
   case DW_LNS_copy:
     add_line_info (table, address, filename, line, column, 0);
     basic_block = 0;
     if (low_pc == 0 || 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:
     basic_block = 1;
     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;
1213}

1215/* 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.  */

1219static bfd_boolean
1220lookup_address_in_line_info_table (struct line_info_table *table,
		   bfd_vma addr,
		   struct funcinfo *function,
		   const char **filename_ptr,
		   unsigned int *linenumber_ptr)
1225{
/* Note: table->last_line should be a descendingly sorted list. */
struct line_info* next_line = table->last_line;
struct line_info* each_line = NULL((void*)0);
*filename_ptr = NULL((void*)0);

if (!next_line)
  return FALSE0;

each_line = next_line->prev_line;

/* Check for large addresses */
if (addr > next_line->address)
  each_line = NULL((void*)0); /* 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 = FALSE0;
    if (each_line->address <= addr && addr <= next_line->address)
{
 addr_match = TRUE1;

 /* 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((void*)0)
     && each_line->address < function->low
     && next_line->address > function->low)
   {
     *filename_ptr = next_line->filename;
     *linenumber_ptr = next_line->line;
   }
 else
   {
     *filename_ptr = each_line->filename;
     *linenumber_ptr = each_line->line;
   }
}

    if (addr_match && !each_line->end_sequence)
return TRUE1; /* 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((void*)0) && function != NULL((void*)0))
  {
    *filename_ptr = next_line->filename;
    *linenumber_ptr = next_line->line;
    return TRUE1;
  }

return FALSE0;
1290}

1292/* Function table functions.  */

1294/* If ADDR is within TABLE, set FUNCTIONNAME_PTR, and return TRUE.  */

1296static bfd_boolean
1297lookup_address_in_function_table (struct funcinfo *table,
		  bfd_vma addr,
		  struct funcinfo **function_ptr,
		  const char **functionname_ptr)
1301{
struct funcinfo* each_func;

for (each_func = table;
     each_func;
     each_func = each_func->prev_func)
  {
    if (addr >= each_func->low && addr < each_func->high)
{
 *functionname_ptr = each_func->name;
 *function_ptr = each_func;
 return TRUE1;
}
  }

return FALSE0;
1317}

1319/* DWARF2 Compilation unit functions.  */

1321/* Scan over each die in a comp. unit looking for functions to add
 to the function table.  */

1324static bfd_boolean
1325scan_unit_for_functions (struct comp_unit *unit)
1326{
bfd *abfd = unit->abfd;
char *info_ptr = unit->first_child_die_ptr;
int nesting_level = 1;

while (nesting_level)
  {
    unsigned int abbrev_number, bytes_read, i;
    struct abbrev_info *abbrev;
    struct attribute attr;
    struct funcinfo *func;
    char* name = 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.")("Dwarf Error: Could not find abbrev number %u."),
	     abbrev_number);
 bfd_set_error (bfd_error_bad_value);
 return FALSE0;
}

    if (abbrev->tag == DW_TAG_subprogram)
{
 bfd_size_type amt = sizeof (struct funcinfo);
 func = bfd_zalloc (abfd, amt);
 func->prev_func = unit->function_table;
 unit->function_table = func;
}
    else
func = NULL((void*)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_name:

  name = attr.u.str;

  /* Prefer DW_AT_MIPS_linkage_name over DW_AT_name.  */
  if (func->name == NULL((void*)0))
    func->name = attr.u.str;
  break;

case DW_AT_MIPS_linkage_name:
  func->name = attr.u.str;
  break;

case DW_AT_low_pc:
  func->low = attr.u.val;
  break;

case DW_AT_high_pc:
  func->high = attr.u.val;
  break;

default:
  break;
}
   }
 else
   {
     switch (attr.name)
{
case DW_AT_name:
  name = attr.u.str;
  break;

default:
  break;
}
   }
}

    if (abbrev->has_children)
nesting_level++;
  }

return TRUE1;
1419}

1421/* 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.  */

1430static struct comp_unit *
1431parse_comp_unit (bfd *abfd,
 struct dwarf2_debug *stash,
 bfd_vma unit_length,
 unsigned int offset_size)
1435{
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;
char *info_ptr = stash->info_ptr;
char *end_ptr = info_ptr + unit_length;
bfd_size_type amt;

version = read_2_bytes (abfd, info_ptr);
info_ptr += 2;
BFD_ASSERT (offset_size == 4 || offset_size == 8){ if (!(offset_size == 4 || offset_size == 8)) bfd_assert("/usr/src/gnu/usr.bin/binutils/bfd/dwarf2.c"
,1450); };
20
←
Taking true branch→
if (offset_size20.1
'offset_size' is not equal to 4
 == 4)
21
←
Taking false branch→
  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)
22
←
Assuming 'version' is equal to 2→
23
←
Taking false branch→
  {
    (*_bfd_error_handler) (_("Dwarf Error: found dwarf version '%u', this reader only handles version 2 information.")("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))
24
←
Assuming the condition is false→
25
←
Taking false branch→
  {
    (*_bfd_error_handler) (_("Dwarf Error: found address size '%u', this reader can not handle sizes greater than '%u'.")("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)
26
←
Assuming 'addr_size' is equal to 2→
  {
    (*_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);
27
←
Calling 'read_abbrevs'→
38
←
Returning from 'read_abbrevs'→
if (! abbrevs)
39
←
Assuming 'abbrevs' is non-null→
40
←
Taking false branch→
    return 0;

abbrev_number = read_unsigned_leb128 (abfd, info_ptr, &bytes_read);
41
←
Calling 'read_unsigned_leb128'→
44
←
Returning from 'read_unsigned_leb128'→
info_ptr += bytes_read;
if (! abbrev_number)
45
←
Assuming 'abbrev_number' is not equal to 0→
46
←
Taking false branch→
  {
    (*_bfd_error_handler) (_("Dwarf Error: Bad abbrev number: %u.")("Dwarf Error: Bad abbrev number: %u."),
	 abbrev_number);
    bfd_set_error (bfd_error_bad_value);
    return 0;
  }

abbrev = lookup_abbrev (abbrev_number, abbrevs);
47
←
Calling 'lookup_abbrev'→
52
←
Returning from 'lookup_abbrev'→
if (! abbrev52.1
'abbrev' is non-null
)
53
←
Taking false branch→
  {
    (*_bfd_error_handler) (_("Dwarf Error: Could not find abbrev number %u.")("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;

for (i = 0; i < abbrev->num_attrs; ++i)
54
←
Assuming 'i' is < field 'num_attrs'→
55
←
Loop condition is true.  Entering loop body→
  {
    info_ptr = read_attribute (&attr, &abbrev->attrs[i], unit, info_ptr);
56
←
Calling 'read_attribute'→
64
←
Returning from 'read_attribute'→

    /* Store the data if it is of an attribute we want to keep in a
partial symbol table.  */
    switch (attr.name)
65
←
Control jumps to 'case DW_AT_low_pc:'  at line 1532→
{
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:
 unit->arange.low = attr.u.val;
66
←
Assigned value is garbage or undefined
 break;

case DW_AT_high_pc:
 unit->arange.high = attr.u.val;
 break;

case DW_AT_comp_dir:
 {
   char* comp_dir = attr.u.str;
   if (comp_dir)
     {
/* Irix 6.2 native cc prepends <machine>.: 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;
}
  }

unit->first_child_die_ptr = info_ptr;
return unit;
1563}

1565/* Return TRUE if UNIT contains the address given by ADDR.  */

1567static bfd_boolean
1568comp_unit_contains_address (struct comp_unit *unit, bfd_vma addr)
1569{
struct arange *arange;

if (unit->error)
  return FALSE0;

arange = &unit->arange;
do
  {
    if (addr >= arange->low && addr < arange->high)
return TRUE1;
    arange = arange->next;
  }
while (arange);

return FALSE0;
1585}

1587/* 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.  */

1595static bfd_boolean
1596comp_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)
1602{
bfd_boolean line_p;
bfd_boolean func_p;
struct funcinfo *function;

if (unit->error)
  return FALSE0;

if (! unit->line_table)
  {
    if (! unit->stmtlist)
{
 unit->error = 1;
 return FALSE0;
}

    unit->line_table = decode_line_info (unit, stash);

    if (! unit->line_table)
{
 unit->error = 1;
 return FALSE0;
}

    if (unit->first_child_die_ptr < unit->end_ptr
 && ! scan_unit_for_functions (unit))
{
 unit->error = 1;
 return FALSE0;
}
  }

function = NULL((void*)0);
func_p = lookup_address_in_function_table (unit->function_table, addr,
			     &function, functionname_ptr);
line_p = lookup_address_in_line_info_table (unit->line_table, addr,
			      function, filename_ptr,
			      linenumber_ptr);
return line_p || func_p;
1641}

1643/* 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.  */
1652#define DWARF2_DEBUG_INFO".debug_info" ".debug_info"
1653#define GNU_LINKONCE_INFO".gnu.linkonce.wi." ".gnu.linkonce.wi."

1655static asection *
1656find_debug_info (bfd *abfd, asection *after_sec)
1657{
asection * msec;

if (after_sec)
  msec = after_sec->next;
else
  msec = abfd->sections;

while (msec)
  {
    if (strcmp (msec->name, DWARF2_DEBUG_INFO".debug_info") == 0)
return msec;

    if (strncmp (msec->name, GNU_LINKONCE_INFO".gnu.linkonce.wi.", strlen (GNU_LINKONCE_INFO".gnu.linkonce.wi.")) == 0)
return msec;

    msec = msec->next;
  }

return NULL((void*)0);
1677}

1679/* The DWARF2 version of find_nearest line.  Return TRUE if the line
 is found without error.  ADDR_SIZE is the number of bytes in the
 initial .debug_info length field and in the abbreviation offset.
 You may use zero to indicate that the default value should be
 used.  */

1685bfd_boolean
1686_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)
1695{
/* 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 = *pinfo;

/* What address are we looking for?  */
bfd_vma addr = offset + section->vma;

struct comp_unit* each;

*filename_ptr = NULL((void*)0);
*functionname_ptr = NULL((void*)0);
*linenumber_ptr = 0;

/* 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)
1
Assuming 'addr_size' is not equal to 0→
2
←
Taking false branch→
  addr_size = 4;
BFD_ASSERT (addr_size == 4 || addr_size == 8){ if (!(addr_size == 4 || addr_size == 8)) bfd_assert("/usr/src/gnu/usr.bin/binutils/bfd/dwarf2.c"
,1720); };
3
←
Assuming 'addr_size' is not equal to 4→
4
←
Assuming 'addr_size' is not equal to 8→
5
←
Taking true branch→

if (! stash)
6
←
Assuming 'stash' is non-null→
7
←
Taking false branch→
  {
    bfd_size_type total_size;
    asection *msec;
    bfd_size_type amt = sizeof (struct dwarf2_debug);

    stash = bfd_zalloc (abfd, amt);
    if (! stash)
return FALSE0;

    *pinfo = stash;

    msec = find_debug_info (abfd, NULL((void*)0));
    if (! msec)
/* No dwarf2 info.  Note that at this point the stash
  has been allocated, but contains zeros, this lets
  future calls to this function fail quicker.  */
return FALSE0;

    /* 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 (abfd, msec))
total_size += msec->_raw_size;

    stash->info_ptr = bfd_alloc (abfd, total_size);
    if (stash->info_ptr == NULL((void*)0))
return FALSE0;

    stash->info_ptr_end = stash->info_ptr;

    for (msec = find_debug_info (abfd, NULL((void*)0));
  msec;
  msec = find_debug_info (abfd, msec))
{
 bfd_size_type size;
 bfd_size_type start;

 size = msec->_raw_size;
 if (size == 0)
   continue;

 start = stash->info_ptr_end - stash->info_ptr;

 if ((bfd_simple_get_relocated_section_contents
      (abfd, msec, stash->info_ptr + start, symbols)) == NULL((void*)0))
   continue;

 stash->info_ptr_end = stash->info_ptr + start + size;
}

    BFD_ASSERT (stash->info_ptr_end == stash->info_ptr + total_size){ if (!(stash->info_ptr_end == stash->info_ptr + total_size
)) bfd_assert("/usr/src/gnu/usr.bin/binutils/bfd/dwarf2.c",1775
); };

    stash->sec = find_debug_info (abfd, NULL((void*)0));
    stash->sec_info_ptr = stash->info_ptr;
    stash->syms = symbols;
  }

/* 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)
8
←
Assuming field 'info_ptr' is non-null→
9
←
Taking false branch→
  return FALSE0;

/* Check the previously read comp. units first.  */
for (each = stash->all_comp_units; each; each = each->next_unit)
10
←
Loop condition is false. Execution continues on line 1795→
  if (comp_unit_contains_address (each, addr))
    return comp_unit_find_nearest_line (each, addr, filename_ptr,
			  functionname_ptr, linenumber_ptr,
			  stash);

/* Read each remaining comp. units checking each as they are read.  */
while (stash->info_ptr < stash->info_ptr_end)
11
←
Assuming field 'info_ptr' is < field 'info_ptr_end'→
12
←
Loop condition is true.  Entering loop body→
  {
    bfd_vma length;
    bfd_boolean found;
    unsigned int offset_size = addr_size;

    length = read_4_bytes (abfd, 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)
13
←
Assuming 'length' is not equal to -1→
14
←
Taking false branch→
{
 offset_size = 8;
 length = read_8_bytes (abfd, 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)
15
←
Assuming 'length' is not equal to 0→
16
←
Taking false branch→
{
 offset_size = 8;
 length = read_4_bytes (abfd, stash->info_ptr + 4);
 stash->info_ptr += 8;
}
    /* In the absence of the hints above, we assume addr_size-sized
offsets, for backward-compatibility with pre-DWARF3 64-bit
platforms.  */
    else if (addr_size16.1
'addr_size' is not equal to 8
 == 8)
17
←
Taking false branch→
{
 length = read_8_bytes (abfd, stash->info_ptr);
 stash->info_ptr += 8;
}
    else
stash->info_ptr += 4;

    if (length17.1
'length' is > 0
 > 0)
18
←
Taking true branch→
{
 each = parse_comp_unit (abfd, stash, length, offset_size);
19
←
Calling 'parse_comp_unit'→
 stash->info_ptr += length;

 if ((bfd_vma) (stash->info_ptr - stash->sec_info_ptr)
     == stash->sec->_raw_size)
   {
     stash->sec = find_debug_info (abfd, 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 (each->arange.high > 0)
{
  if (comp_unit_contains_address (each, addr))
    return comp_unit_find_nearest_line (each, addr,
					filename_ptr,
					functionname_ptr,
					linenumber_ptr,
					stash);
}
     else
{
  found = comp_unit_find_nearest_line (each, addr,
				       filename_ptr,
				       functionname_ptr,
				       linenumber_ptr,
				       stash);
  if (found)
    return TRUE1;
}
   }
}
  }

return FALSE0;
1876}