/usr/src/gnu/usr.bin/binutils/gdb/buildsym.c

Bug Summary

File:	src/gnu/usr.bin/binutils/gdb/buildsym.c
Warning:	line 977, column 8 Null pointer passed as 1st argument to string copy function
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 buildsym.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/gdb -resource-dir /usr/local/lib/clang/13.0.0 -D PIE_DEFAULT=1 -I . -I /usr/src/gnu/usr.bin/binutils/gdb -I /usr/src/gnu/usr.bin/binutils/gdb/config -D LOCALEDIR="/usr/share/locale" -D HAVE_CONFIG_H -I /usr/src/gnu/usr.bin/binutils/gdb/../include/opcode -I ../bfd -I /usr/src/gnu/usr.bin/binutils/gdb/../bfd -I /usr/src/gnu/usr.bin/binutils/gdb/../include -I ../intl -I /usr/src/gnu/usr.bin/binutils/gdb/../intl -D MI_OUT=1 -D TUI=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/gdb -ferror-limit 19 -fwrapv -D_RET_PROTECTOR -ret-protector -fgnuc-version=4.2.1 -fcommon -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/gdb/buildsym.c
1/* Support routines for building symbol tables in GDB's internal format.
 Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004
 Free Software Foundation, Inc.

 This file is part of GDB.

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

23/* This module provides subroutines used for creating and adding to
 the symbol table.  These routines are called from various symbol-
 file-reading routines.

 Routines to support specific debugging information formats (stabs,
 DWARF, etc) belong somewhere else. */

30#include "defs.h"
31#include "bfd.h"
32#include "gdb_obstack.h"
33#include "symtab.h"
34#include "symfile.h"
35#include "objfiles.h"
36#include "gdbtypes.h"
37#include "gdb_assert.h"
38#include "complaints.h"
39#include "gdb_string.h"
40#include "expression.h"		/* For "enum exp_opcode" used by... */
41#include "bcache.h"
42#include "filenames.h"		/* For DOSish file names */
43#include "macrotab.h"
44#include "demangle.h"		/* Needed by SYMBOL_INIT_DEMANGLED_NAME.  */
45#include "block.h"
46#include "cp-support.h"
47#include "dictionary.h"

49/* Ask buildsym.h to define the vars it normally declares `extern'.  */
50#define	EXTERN
51/**/
52#include "buildsym.h"		/* Our own declarations */
53#undef	EXTERN

55/* For cleanup_undefined_types and finish_global_stabs (somewhat
 questionable--see comment where we call them).  */

58#include "stabsread.h"

60/* List of free `struct pending' structures for reuse.  */

62static struct pending *free_pendings;

64/* Non-zero if symtab has line number info.  This prevents an
 otherwise empty symtab from being tossed.  */

67static int have_line_numbers;
68
69static int compare_line_numbers (const void *ln1p, const void *ln2p);
70

72/* Initial sizes of data structures.  These are realloc'd larger if
 needed, and realloc'd down to the size actually used, when
 completed.  */

76#define	INITIAL_CONTEXT_STACK_SIZE10	10
77#define	INITIAL_LINE_VECTOR_LENGTH1000	1000
78

80/* maintain the lists of symbols and blocks */

82/* Add a pending list to free_pendings. */
83void
84add_free_pendings (struct pending *list)
85{
struct pending *link = list;

if (list)
  {
    while (link->next) link = link->next;
    link->next = free_pendings;
    free_pendings = list;
  }
94}
    
96/* Add a symbol to one of the lists of symbols.  While we're at it, if
 we're in the C++ case and don't have full namespace debugging info,
 check to see if it references an anonymous namespace; if so, add an
 appropriate using directive.  */

101void
102add_symbol_to_list (struct symbol *symbol, struct pending **listhead)
103{
struct pending *link;

/* If this is an alias for another symbol, don't add it.  */
if (symbol->ginfo.name && symbol->ginfo.name[0] == '#')
  return;

/* We keep PENDINGSIZE symbols in each link of the list. If we
   don't have a link with room in it, add a new link.  */
if (*listhead == NULL((void*)0) || (*listhead)->nsyms == PENDINGSIZE100)
  {
    if (free_pendings)
{
 link = free_pendings;
 free_pendings = link->next;
}
    else
{
 link = (struct pending *) xmalloc (sizeof (struct pending));
}

    link->next = *listhead;
    *listhead = link;
    link->nsyms = 0;
  }

(*listhead)->symbol[(*listhead)->nsyms++] = symbol;

/* Check to see if we might need to look for a mention of anonymous
   namespaces.  */

if (SYMBOL_LANGUAGE (symbol)(symbol)->ginfo.language == language_cplus)
  cp_scan_for_anonymous_namespaces (symbol);
136}

138/* Find a symbol named NAME on a LIST.  NAME need not be
 '\0'-terminated; LENGTH is the length of the name.  */

141struct symbol *
142find_symbol_in_list (struct pending *list, char *name, int length)
143{
int j;
char *pp;

while (list != NULL((void*)0))
  {
    for (j = list->nsyms; --j >= 0;)
{
 pp = DEPRECATED_SYMBOL_NAME (list->symbol[j])(list->symbol[j])->ginfo.name;
 if (*pp == *name && strncmp (pp, name, length) == 0 &&
     pp[length] == '\0')
   {
     return (list->symbol[j]);
   }
}
    list = list->next;
  }
return (NULL((void*)0));
161}

163/* At end of reading syms, or in case of quit, really free as many
 `struct pending's as we can easily find. */

166void
167really_free_pendings (void *dummy)
168{
struct pending *next, *next1;

for (next = free_pendings; next; next = next1)
  {
    next1 = next->next;
    xfree ((void *) next);
  }
free_pendings = NULL((void*)0);

free_pending_blocks ();

for (next = file_symbols; next != NULL((void*)0); next = next1)
  {
    next1 = next->next;
    xfree ((void *) next);
  }
file_symbols = NULL((void*)0);

for (next = global_symbols; next != NULL((void*)0); next = next1)
  {
    next1 = next->next;
    xfree ((void *) next);
  }
global_symbols = NULL((void*)0);

if (pending_macros)
  free_macro_table (pending_macros);
196}

198/* This function is called to discard any pending blocks. */

200void
201free_pending_blocks (void)
202{
203#if 0				/* Now we make the links in the
		   objfile_obstack, so don't free
		   them.  */
struct pending_block *bnext, *bnext1;

for (bnext = pending_blocks; bnext; bnext = bnext1)
  {
    bnext1 = bnext->next;
    xfree ((void *) bnext);
  }
213#endif
pending_blocks = NULL((void*)0);
215}

217/* Take one of the lists of symbols and make a block from it.  Keep
 the order the symbols have in the list (reversed from the input
 file).  Put the block on the list of pending blocks.  */

221void
222finish_block (struct symbol *symbol, struct pending **listhead,
     struct pending_block *old_blocks,
     CORE_ADDR start, CORE_ADDR end,
     struct objfile *objfile)
226{
struct pending *next, *next1;
struct block *block;
struct pending_block *pblock;
struct pending_block *opblock;

block = allocate_block (&objfile->objfile_obstack);

if (symbol)
  {
    BLOCK_DICT (block)(block)->dict = dict_create_linear (&objfile->objfile_obstack,
			       *listhead);
  }
else
  {
    BLOCK_DICT (block)(block)->dict = dict_create_hashed (&objfile->objfile_obstack,
			       *listhead);
  }

BLOCK_START (block)(block)->startaddr = start;
BLOCK_END (block)(block)->endaddr = end;
/* Superblock filled in when containing block is made */
BLOCK_SUPERBLOCK (block)(block)->superblock = NULL((void*)0);
BLOCK_NAMESPACE (block)(block)->language_specific.cplus_specific.namespace = NULL((void*)0);

BLOCK_GCC_COMPILED (block)(block)->gcc_compile_flag = processing_gcc_compilation;

/* Put the block in as the value of the symbol that names it.  */

if (symbol)
  {
    struct type *ftype = SYMBOL_TYPE (symbol)(symbol)->type;
    struct dict_iterator iter;
    SYMBOL_BLOCK_VALUE (symbol)(symbol)->ginfo.value.block = block;
    BLOCK_FUNCTION (block)(block)->function = symbol;

    if (TYPE_NFIELDS (ftype)(ftype)->main_type->nfields <= 0)
{
 /* No parameter type information is recorded with the
    function's type.  Set that from the type of the
    parameter symbols. */
 int nparams = 0, iparams;
 struct symbol *sym;
 ALL_BLOCK_SYMBOLS (block, iter, sym)for ((sym) = dict_iterator_first (((block)->dict), &(iter
)); (sym); (sym) = dict_iterator_next (&(iter)))
   {
     switch (SYMBOL_CLASS (sym)(sym)->aclass)
{
case LOC_ARG:
case LOC_REF_ARG:
case LOC_REGPARM:
case LOC_REGPARM_ADDR:
case LOC_BASEREG_ARG:
case LOC_LOCAL_ARG:
case LOC_COMPUTED_ARG:
  nparams++;
  break;
case LOC_UNDEF:
case LOC_CONST:
case LOC_STATIC:
case LOC_INDIRECT:
case LOC_REGISTER:
case LOC_LOCAL:
case LOC_TYPEDEF:
case LOC_LABEL:
case LOC_BLOCK:
case LOC_CONST_BYTES:
case LOC_BASEREG:
case LOC_UNRESOLVED:
case LOC_OPTIMIZED_OUT:
case LOC_COMPUTED:
default:
  break;
}
   }
 if (nparams > 0)
   {
     TYPE_NFIELDS (ftype)(ftype)->main_type->nfields = nparams;
     TYPE_FIELDS (ftype)(ftype)->main_type->fields = (struct field *)
TYPE_ALLOC (ftype, nparams * sizeof (struct field))((ftype)->main_type->objfile != ((void*)0) ? __extension__
 ({ struct obstack *__h = (&(ftype)->main_type->objfile
 -> objfile_obstack); __extension__ ({ struct obstack *__o
 = (__h); int __len = ((nparams * sizeof (struct field))); if
 (__o->chunk_limit - __o->next_free < __len) _obstack_newchunk
 (__o, __len); ((__o)->next_free += (__len)); (void) 0; })
; __extension__ ({ struct obstack *__o1 = (__h); void *value;
 value = (void *) __o1->object_base; if (__o1->next_free
 == value) __o1->maybe_empty_object = 1; __o1->next_free
 = (((((__o1->next_free) - (char *) 0)+__o1->alignment_mask
) & ~ (__o1->alignment_mask)) + (char *) 0); if (__o1->
next_free - (char *)__o1->chunk > __o1->chunk_limit -
 (char *)__o1->chunk) __o1->next_free = __o1->chunk_limit
; __o1->object_base = __o1->next_free; value; }); }) : xmalloc
 (nparams * sizeof (struct field)));

     iparams = 0;
     ALL_BLOCK_SYMBOLS (block, iter, sym)for ((sym) = dict_iterator_first (((block)->dict), &(iter
)); (sym); (sym) = dict_iterator_next (&(iter)))
{
  if (iparams == nparams)
    break;

  switch (SYMBOL_CLASS (sym)(sym)->aclass)
    {
    case LOC_ARG:
    case LOC_REF_ARG:
    case LOC_REGPARM:
    case LOC_REGPARM_ADDR:
    case LOC_BASEREG_ARG:
    case LOC_LOCAL_ARG:
    case LOC_COMPUTED_ARG:
      TYPE_FIELD_TYPE (ftype, iparams)(((ftype)->main_type->fields[iparams]).type) = SYMBOL_TYPE (sym)(sym)->type;
      TYPE_FIELD_ARTIFICIAL (ftype, iparams)(((ftype)->main_type->fields[iparams]).artificial) = 0;
      iparams++;
      break;
    case LOC_UNDEF:
    case LOC_CONST:
    case LOC_STATIC:
    case LOC_INDIRECT:
    case LOC_REGISTER:
    case LOC_LOCAL:
    case LOC_TYPEDEF:
    case LOC_LABEL:
    case LOC_BLOCK:
    case LOC_CONST_BYTES:
    case LOC_BASEREG:
    case LOC_UNRESOLVED:
    case LOC_OPTIMIZED_OUT:
    case LOC_COMPUTED:
    default:
      break;
    }
}
   }
}

    /* If we're in the C++ case, set the block's scope.  */
    if (SYMBOL_LANGUAGE (symbol)(symbol)->ginfo.language == language_cplus)
{
 cp_set_block_scope (symbol, block, &objfile->objfile_obstack);
}
  }
else
  {
    BLOCK_FUNCTION (block)(block)->function = NULL((void*)0);
  }

/* Now "free" the links of the list, and empty the list.  */

for (next = *listhead; next; next = next1)
  {
    next1 = next->next;
    next->next = free_pendings;
    free_pendings = next;
  }
*listhead = NULL((void*)0);

367#if 1
/* Check to be sure that the blocks have an end address that is
   greater than starting address */

if (BLOCK_END (block)(block)->endaddr < BLOCK_START (block)(block)->startaddr)
  {
    if (symbol)
{
 complaint (&symfile_complaints,
     "block end address less than block start address in %s (patched it)",
     SYMBOL_PRINT_NAME (symbol)(demangle ? (symbol_natural_name (&(symbol)->ginfo)) :
 (symbol)->ginfo.name));
}
    else
{
 complaint (&symfile_complaints,
     "block end address 0x%s less than block start address 0x%s (patched it)",
     paddr_nz (BLOCK_END (block)(block)->endaddr), paddr_nz (BLOCK_START (block)(block)->startaddr));
}
    /* Better than nothing */
    BLOCK_END (block)(block)->endaddr = BLOCK_START (block)(block)->startaddr;
  }
388#endif

/* Install this block as the superblock of all blocks made since the
   start of this scope that don't have superblocks yet.  */

opblock = NULL((void*)0);
for (pblock = pending_blocks; 
     pblock && pblock != old_blocks; 
     pblock = pblock->next)
  {
    if (BLOCK_SUPERBLOCK (pblock->block)(pblock->block)->superblock == NULL((void*)0))
{
400#if 1
 /* Check to be sure the blocks are nested as we receive
    them. If the compiler/assembler/linker work, this just
    burns a small amount of time.  */
 if (BLOCK_START (pblock->block)(pblock->block)->startaddr < BLOCK_START (block)(block)->startaddr ||
     BLOCK_END (pblock->block)(pblock->block)->endaddr > BLOCK_END (block)(block)->endaddr)
   {
     if (symbol)
{
  complaint (&symfile_complaints,
	     "inner block not inside outer block in %s",
	     SYMBOL_PRINT_NAME (symbol)(demangle ? (symbol_natural_name (&(symbol)->ginfo)) :
 (symbol)->ginfo.name));
}
     else
{
  complaint (&symfile_complaints,
	     "inner block (0x%s-0x%s) not inside outer block (0x%s-0x%s)",
	     paddr_nz (BLOCK_START (pblock->block)(pblock->block)->startaddr),
	     paddr_nz (BLOCK_END (pblock->block)(pblock->block)->endaddr),
	     paddr_nz (BLOCK_START (block)(block)->startaddr),
	     paddr_nz (BLOCK_END (block)(block)->endaddr));
}
     if (BLOCK_START (pblock->block)(pblock->block)->startaddr < BLOCK_START (block)(block)->startaddr)
BLOCK_START (pblock->block)(pblock->block)->startaddr = BLOCK_START (block)(block)->startaddr;
     if (BLOCK_END (pblock->block)(pblock->block)->endaddr > BLOCK_END (block)(block)->endaddr)
BLOCK_END (pblock->block)(pblock->block)->endaddr = BLOCK_END (block)(block)->endaddr;
   }
427#endif
 BLOCK_SUPERBLOCK (pblock->block)(pblock->block)->superblock = block;
}
    opblock = pblock;
  }

record_pending_block (objfile, block, opblock);
434}


437/* Record BLOCK on the list of all blocks in the file.  Put it after
 OPBLOCK, or at the beginning if opblock is NULL.  This puts the
 block in the list after all its subblocks.

 Allocate the pending block struct in the objfile_obstack to save
 time.  This wastes a little space.  FIXME: Is it worth it?  */

444void
445record_pending_block (struct objfile *objfile, struct block *block,
      struct pending_block *opblock)
447{
struct pending_block *pblock;

pblock = (struct pending_block *)
  obstack_alloc (&objfile->objfile_obstack, sizeof (struct pending_block))__extension__ ({ struct obstack *__h = (&objfile->objfile_obstack
); __extension__ ({ struct obstack *__o = (__h); int __len = (
(sizeof (struct pending_block))); if (__o->chunk_limit - __o
->next_free < __len) _obstack_newchunk (__o, __len); ((
__o)->next_free += (__len)); (void) 0; }); __extension__ (
{ struct obstack *__o1 = (__h); void *value; value = (void *)
 __o1->object_base; if (__o1->next_free == value) __o1->
maybe_empty_object = 1; __o1->next_free = (((((__o1->next_free
) - (char *) 0)+__o1->alignment_mask) & ~ (__o1->alignment_mask
)) + (char *) 0); if (__o1->next_free - (char *)__o1->chunk
 > __o1->chunk_limit - (char *)__o1->chunk) __o1->
next_free = __o1->chunk_limit; __o1->object_base = __o1
->next_free; value; }); });
pblock->block = block;
if (opblock)
  {
    pblock->next = opblock->next;
    opblock->next = pblock;
  }
else
  {
    pblock->next = pending_blocks;
    pending_blocks = pblock;
  }
463}

465static struct blockvector *
466make_blockvector (struct objfile *objfile)
467{
struct pending_block *next;
struct blockvector *blockvector;
int i;

/* Count the length of the list of blocks.  */

for (next = pending_blocks, i = 0; next; next = next->next, i++)
  {;
  }

blockvector = (struct blockvector *)
  obstack_alloc (&objfile->objfile_obstack,__extension__ ({ struct obstack *__h = (&objfile->objfile_obstack
); __extension__ ({ struct obstack *__o = (__h); int __len = (
((sizeof (struct blockvector) + (i - 1) * sizeof (struct block
 *)))); if (__o->chunk_limit - __o->next_free < __len
) _obstack_newchunk (__o, __len); ((__o)->next_free += (__len
)); (void) 0; }); __extension__ ({ struct obstack *__o1 = (__h
); void *value; value = (void *) __o1->object_base; if (__o1
->next_free == value) __o1->maybe_empty_object = 1; __o1
->next_free = (((((__o1->next_free) - (char *) 0)+__o1->
alignment_mask) & ~ (__o1->alignment_mask)) + (char *)
 0); if (__o1->next_free - (char *)__o1->chunk > __o1
->chunk_limit - (char *)__o1->chunk) __o1->next_free
 = __o1->chunk_limit; __o1->object_base = __o1->next_free
; value; }); })
   (sizeof (struct blockvector)__extension__ ({ struct obstack *__h = (&objfile->objfile_obstack
); __extension__ ({ struct obstack *__o = (__h); int __len = (
((sizeof (struct blockvector) + (i - 1) * sizeof (struct block
 *)))); if (__o->chunk_limit - __o->next_free < __len
) _obstack_newchunk (__o, __len); ((__o)->next_free += (__len
)); (void) 0; }); __extension__ ({ struct obstack *__o1 = (__h
); void *value; value = (void *) __o1->object_base; if (__o1
->next_free == value) __o1->maybe_empty_object = 1; __o1
->next_free = (((((__o1->next_free) - (char *) 0)+__o1->
alignment_mask) & ~ (__o1->alignment_mask)) + (char *)
 0); if (__o1->next_free - (char *)__o1->chunk > __o1
->chunk_limit - (char *)__o1->chunk) __o1->next_free
 = __o1->chunk_limit; __o1->object_base = __o1->next_free
; value; }); })
    + (i - 1) * sizeof (struct block *)))__extension__ ({ struct obstack *__h = (&objfile->objfile_obstack
); __extension__ ({ struct obstack *__o = (__h); int __len = (
((sizeof (struct blockvector) + (i - 1) * sizeof (struct block
 *)))); if (__o->chunk_limit - __o->next_free < __len
) _obstack_newchunk (__o, __len); ((__o)->next_free += (__len
)); (void) 0; }); __extension__ ({ struct obstack *__o1 = (__h
); void *value; value = (void *) __o1->object_base; if (__o1
->next_free == value) __o1->maybe_empty_object = 1; __o1
->next_free = (((((__o1->next_free) - (char *) 0)+__o1->
alignment_mask) & ~ (__o1->alignment_mask)) + (char *)
 0); if (__o1->next_free - (char *)__o1->chunk > __o1
->chunk_limit - (char *)__o1->chunk) __o1->next_free
 = __o1->chunk_limit; __o1->object_base = __o1->next_free
; value; }); });

/* Copy the blocks into the blockvector. This is done in reverse
   order, which happens to put the blocks into the proper order
   (ascending starting address). finish_block has hair to insert
   each block into the list after its subblocks in order to make
   sure this is true.  */

BLOCKVECTOR_NBLOCKS (blockvector)(blockvector)->nblocks = i;
for (next = pending_blocks; next; next = next->next)
  {
    BLOCKVECTOR_BLOCK (blockvector, --i)(blockvector)->block[--i] = next->block;
  }

495#if 0				/* Now we make the links in the
		   obstack, so don't free them.  */
/* Now free the links of the list, and empty the list.  */

for (next = pending_blocks; next; next = next1)
  {
    next1 = next->next;
    xfree (next);
  }
504#endif
pending_blocks = NULL((void*)0);

507#if 1				/* FIXME, shut this off after a while
		   to speed up symbol reading.  */
/* Some compilers output blocks in the wrong order, but we depend on
   their being in the right order so we can binary search. Check the
   order and moan about it.  FIXME.  */
if (BLOCKVECTOR_NBLOCKS (blockvector)(blockvector)->nblocks > 1)
  {
    for (i = 1; i < BLOCKVECTOR_NBLOCKS (blockvector)(blockvector)->nblocks; i++)
{
 if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i - 1))((blockvector)->block[i - 1])->startaddr
     > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i))((blockvector)->block[i])->startaddr)
   {
     CORE_ADDR start
= BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i))((blockvector)->block[i])->startaddr;

     complaint (&symfile_complaints, "block at %s out of order",
	 hex_string ((LONGESTlong) start));
   }
}
  }
527#endif

return (blockvector);
530}
531
532/* Start recording information about source code that came from an
 included (or otherwise merged-in) source file with a different
 name.  NAME is the name of the file (cannot be NULL), DIRNAME is
 the directory in which it resides (or NULL if not known).  */

537void
538start_subfile (char *name, char *dirname)
539{
struct subfile *subfile;

/* See if this subfile is already known as a subfile of the current
   main source file.  */

for (subfile = subfiles; subfile; subfile = subfile->next)
  {
    if (FILENAME_CMP (subfile->name, name)strcmp(subfile->name, name) == 0)
{
 current_subfile = subfile;
 return;
}
  }

/* This subfile is not known.  Add an entry for it. Make an entry
   for this subfile in the list of all subfiles of the current main
   source file.  */

subfile = (struct subfile *) xmalloc (sizeof (struct subfile));
memset ((char *) subfile, 0, sizeof (struct subfile));
subfile->next = subfiles;
subfiles = subfile;
current_subfile = subfile;

/* Save its name and compilation directory name */
subfile->name = (name == NULL((void*)0)) ? NULL((void*)0) : savestring (name, strlen (name));
subfile->dirname =
  (dirname == NULL((void*)0)) ? NULL((void*)0) : savestring (dirname, strlen (dirname));

/* Initialize line-number recording for this subfile.  */
subfile->line_vector = NULL((void*)0);

/* Default the source language to whatever can be deduced from the
   filename.  If nothing can be deduced (such as for a C/C++ include
   file with a ".h" extension), then inherit whatever language the
   previous subfile had.  This kludgery is necessary because there
   is no standard way in some object formats to record the source
   language.  Also, when symtabs are allocated we try to deduce a
   language then as well, but it is too late for us to use that
   information while reading symbols, since symtabs aren't allocated
   until after all the symbols have been processed for a given
   source file. */

subfile->language = deduce_language_from_filename (subfile->name);
if (subfile->language == language_unknown &&
    subfile->next != NULL((void*)0))
  {
    subfile->language = subfile->next->language;
  }

/* Initialize the debug format string to NULL.  We may supply it
   later via a call to record_debugformat. */
subfile->debugformat = NULL((void*)0);

/* If the filename of this subfile ends in .C, then change the
   language of any pending subfiles from C to C++.  We also accept
   any other C++ suffixes accepted by deduce_language_from_filename.  */
/* Likewise for f2c.  */

if (subfile->name)
  {
    struct subfile *s;
    enum language sublang = deduce_language_from_filename (subfile->name);

    if (sublang == language_cplus || sublang == language_fortran)
for (s = subfiles; s != NULL((void*)0); s = s->next)
 if (s->language == language_c)
   s->language = sublang;
  }

/* And patch up this file if necessary.  */
if (subfile->language == language_c
    && subfile->next != NULL((void*)0)
    && (subfile->next->language == language_cplus
 || subfile->next->language == language_fortran))
  {
    subfile->language = subfile->next->language;
  }
618}

620/* For stabs readers, the first N_SO symbol is assumed to be the
 source file name, and the subfile struct is initialized using that
 assumption.  If another N_SO symbol is later seen, immediately
 following the first one, then the first one is assumed to be the
 directory name and the second one is really the source file name.

 So we have to patch up the subfile struct by moving the old name
 value to dirname and remembering the new name.  Some sanity
 checking is performed to ensure that the state of the subfile
 struct is reasonable and that the old name we are assuming to be a
 directory name actually is (by checking for a trailing '/'). */

632void
633patch_subfile_names (struct subfile *subfile, char *name)
634{
if (subfile != NULL((void*)0) && subfile->dirname == NULL((void*)0) && subfile->name != NULL((void*)0)
    && subfile->name[strlen (subfile->name) - 1] == '/')
  {
    subfile->dirname = subfile->name;
    subfile->name = savestring (name, strlen (name));
    last_source_file = name;

    /* Default the source language to whatever can be deduced from
       the filename.  If nothing can be deduced (such as for a C/C++
       include file with a ".h" extension), then inherit whatever
       language the previous subfile had.  This kludgery is
       necessary because there is no standard way in some object
       formats to record the source language.  Also, when symtabs
       are allocated we try to deduce a language then as well, but
       it is too late for us to use that information while reading
       symbols, since symtabs aren't allocated until after all the
       symbols have been processed for a given source file. */

    subfile->language = deduce_language_from_filename (subfile->name);
    if (subfile->language == language_unknown &&
 subfile->next != NULL((void*)0))
{
 subfile->language = subfile->next->language;
}
  }
660}
661
662/* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
 switching source files (different subfiles, as we call them) within
 one object file, but using a stack rather than in an arbitrary
 order.  */

667void
668push_subfile (void)
669{
struct subfile_stack *tem
= (struct subfile_stack *) xmalloc (sizeof (struct subfile_stack));

tem->next = subfile_stack;
subfile_stack = tem;
if (current_subfile == NULL((void*)0) || current_subfile->name == NULL((void*)0))
  {
    internal_error (__FILE__"/usr/src/gnu/usr.bin/binutils/gdb/buildsym.c", __LINE__677, "failed internal consistency check");
  }
tem->name = current_subfile->name;
680}

682char *
683pop_subfile (void)
684{
char *name;
struct subfile_stack *link = subfile_stack;

if (link == NULL((void*)0))
  {
    internal_error (__FILE__"/usr/src/gnu/usr.bin/binutils/gdb/buildsym.c", __LINE__690, "failed internal consistency check");
  }
name = link->name;
subfile_stack = link->next;
xfree ((void *) link);
return (name);
696}
697
698/* Add a linetable entry for line number LINE and address PC to the
 line vector for SUBFILE.  */

701void
702record_line (struct subfile *subfile, int line, CORE_ADDR pc)
703{
struct linetable_entry *e;
/* Ignore the dummy line number in libg.o */

if (line == 0xffff)
  {
    return;
  }

/* Make sure line vector exists and is big enough.  */
if (!subfile->line_vector)
  {
    subfile->line_vector_length = INITIAL_LINE_VECTOR_LENGTH1000;
    subfile->line_vector = (struct linetable *)
xmalloc (sizeof (struct linetable)
  + subfile->line_vector_length * sizeof (struct linetable_entry));
    subfile->line_vector->nitems = 0;
    have_line_numbers = 1;
  }

if (subfile->line_vector->nitems + 1 >= subfile->line_vector_length)
  {
    subfile->line_vector_length *= 2;
    subfile->line_vector = (struct linetable *)
xrealloc ((char *) subfile->line_vector,
  (sizeof (struct linetable)
   + (subfile->line_vector_length
      * sizeof (struct linetable_entry))));
  }

e = subfile->line_vector->item + subfile->line_vector->nitems++;
e->line = line;
e->pc = ADDR_BITS_REMOVE(pc)(gdbarch_addr_bits_remove (current_gdbarch, pc));
736}

738/* Needed in order to sort line tables from IBM xcoff files.  Sigh!  */

740static int
741compare_line_numbers (const void *ln1p, const void *ln2p)
742{
struct linetable_entry *ln1 = (struct linetable_entry *) ln1p;
struct linetable_entry *ln2 = (struct linetable_entry *) ln2p;

/* Note: this code does not assume that CORE_ADDRs can fit in ints.
   Please keep it that way.  */
if (ln1->pc < ln2->pc)
  return -1;

if (ln1->pc > ln2->pc)
  return 1;

/* If pc equal, sort by line.  I'm not sure whether this is optimum
   behavior (see comment at struct linetable in symtab.h).  */
return ln1->line - ln2->line;
757}
758
759/* Start a new symtab for a new source file.  Called, for example,
 when a stabs symbol of type N_SO is seen, or when a DWARF
 TAG_compile_unit DIE is seen.  It indicates the start of data for
 one original source file.  */

764void
765start_symtab (char *name, char *dirname, CORE_ADDR start_addr)
766{

last_source_file = name;
last_source_start_addr = start_addr;
file_symbols = NULL((void*)0);
global_symbols = NULL((void*)0);
within_function = 0;
have_line_numbers = 0;

/* Context stack is initially empty.  Allocate first one with room
   for 10 levels; reuse it forever afterward.  */
if (context_stack == NULL((void*)0))
  {
    context_stack_size = INITIAL_CONTEXT_STACK_SIZE10;
    context_stack = (struct context_stack *)
xmalloc (context_stack_size * sizeof (struct context_stack));
  }
context_stack_depth = 0;

/* Set up support for C++ namespace support, in case we need it.  */

cp_initialize_namespace ();

/* Initialize the list of sub source files with one entry for this
   file (the top-level source file).  */

subfiles = NULL((void*)0);
current_subfile = NULL((void*)0);
start_subfile (name, dirname);
795}

797/* Finish the symbol definitions for one main source file, close off
 all the lexical contexts for that file (creating struct block's for
 them), then make the struct symtab for that file and put it in the
 list of all such.

 END_ADDR is the address of the end of the file's text.  SECTION is
 the section number (in objfile->section_offsets) of the blockvector
 and linetable.

 Note that it is possible for end_symtab() to return NULL.  In
 particular, for the DWARF case at least, it will return NULL when
 it finds a compilation unit that has exactly one DIE, a
 TAG_compile_unit DIE.  This can happen when we link in an object
 file that was compiled from an empty source file.  Returning NULL
 is probably not the correct thing to do, because then gdb will
 never know about this empty file (FIXME). */

814struct symtab *
815end_symtab (CORE_ADDR end_addr, struct objfile *objfile, int section)
816{
struct symtab *symtab = NULL((void*)0);
struct blockvector *blockvector;
struct subfile *subfile;
struct context_stack *cstk;
struct subfile *nextsub;

/* Finish the lexical context of the last function in the file; pop
   the context stack.  */

if (context_stack_depth > 0)
1
Assuming 'context_stack_depth' is <= 0→
2
←
Taking false branch→
  {
    cstk = pop_context ();
    /* Make a block for the local symbols within.  */
    finish_block (cstk->name, &local_symbols, cstk->old_blocks,
    cstk->start_addr, end_addr, objfile);

    if (context_stack_depth > 0)
{
 /* This is said to happen with SCO.  The old coffread.c
    code simply emptied the context stack, so we do the
    same.  FIXME: Find out why it is happening.  This is not
    believed to happen in most cases (even for coffread.c);
    it used to be an abort().  */
 complaint (&symfile_complaints,
            "Context stack not empty in end_symtab");
 context_stack_depth = 0;
}
  }

/* Reordered executables may have out of order pending blocks; if
   OBJF_REORDERED is true, then sort the pending blocks.  */
if ((objfile->flags & OBJF_REORDERED(1 << 2)) && pending_blocks)
3
←
Assuming the condition is false→
  {
    /* FIXME!  Remove this horrid bubble sort and use merge sort!!! */
    int swapped;
    do
{
 struct pending_block *pb, *pbnext;

 pb = pending_blocks;
 pbnext = pb->next;
 swapped = 0;

 while (pbnext)
   {
     /* swap blocks if unordered! */

     if (BLOCK_START (pb->block)(pb->block)->startaddr < BLOCK_START (pbnext->block)(pbnext->block)->startaddr)
{
  struct block *tmp = pb->block;
  pb->block = pbnext->block;
  pbnext->block = tmp;
  swapped = 1;
}
     pb = pbnext;
     pbnext = pbnext->next;
   }
}
    while (swapped);
  }

/* Cleanup any undefined types that have been left hanging around
   (this needs to be done before the finish_blocks so that
   file_symbols is still good).

   Both cleanup_undefined_types and finish_global_stabs are stabs
   specific, but harmless for other symbol readers, since on gdb
   startup or when finished reading stabs, the state is set so these
   are no-ops.  FIXME: Is this handled right in case of QUIT?  Can
   we make this cleaner?  */

cleanup_undefined_types ();
finish_global_stabs (objfile);

if (pending_blocks == NULL((void*)0)
4
←
Assuming 'pending_blocks' is not equal to NULL→
    && file_symbols == NULL((void*)0)
    && global_symbols == NULL((void*)0)
    && have_line_numbers == 0
    && pending_macros == NULL((void*)0))
  {
    /* Ignore symtabs that have no functions with real debugging
       info.  */
    blockvector = NULL((void*)0);
  }
else
  {
    /* Define the STATIC_BLOCK & GLOBAL_BLOCK, and build the
       blockvector.  */
    finish_block (0, &file_symbols, 0, last_source_start_addr, end_addr,
    objfile);
    finish_block (0, &global_symbols, 0, last_source_start_addr, end_addr,
    objfile);
    blockvector = make_blockvector (objfile);
    cp_finalize_namespace (BLOCKVECTOR_BLOCK (blockvector, STATIC_BLOCK)(blockvector)->block[STATIC_BLOCK],
	     &objfile->objfile_obstack);
  }

914#ifndef PROCESS_LINENUMBER_HOOK
915#define PROCESS_LINENUMBER_HOOK()
916#endif
PROCESS_LINENUMBER_HOOK ();	/* Needed for xcoff. */

/* Now create the symtab objects proper, one for each subfile.  */
/* (The main file is the last one on the chain.)  */

for (subfile = subfiles; subfile; subfile = nextsub)
5
←
Loop condition is true.  Entering loop body→
  {
    int linetablesize = 0;
    symtab = NULL((void*)0);

    /* If we have blocks of symbols, make a symtab. Otherwise, just
       ignore this file and any line number info in it.  */
    if (blockvector5.1
'blockvector' is non-null
)
6
←
Taking true branch→
{
 if (subfile->line_vector)
7
←
Assuming field 'line_vector' is non-null→
8
←
Taking true branch→
   {
     linetablesize = sizeof (struct linetable) +
       subfile->line_vector->nitems * sizeof (struct linetable_entry);
935#if 0
     /* I think this is artifact from before it went on the
        obstack. I doubt we'll need the memory between now
        and when we free it later in this function.  */
     /* First, shrink the linetable to make more memory.  */
     subfile->line_vector = (struct linetable *)
xrealloc ((char *) subfile->line_vector, linetablesize);
942#endif

     /* Like the pending blocks, the line table may be
        scrambled in reordered executables.  Sort it if
        OBJF_REORDERED is true.  */
     if (objfile->flags & OBJF_REORDERED(1 << 2))
9
←
Assuming the condition is false→
10
←
Taking false branch→
qsort (subfile->line_vector->item,
       subfile->line_vector->nitems,
     sizeof (struct linetable_entry), compare_line_numbers);
   }

 /* Now, allocate a symbol table.  */
 symtab = allocate_symtab (subfile->name, objfile);

 /* Fill in its components.  */
 symtab->blockvector = blockvector;
        symtab->macro_table = pending_macros;
 if (subfile->line_vector10.1
Field 'line_vector' is non-null
)
11
←
Taking true branch→
   {
     /* Reallocate the line table on the symbol obstack */
     symtab->linetable = (struct linetable *)
obstack_alloc (&objfile->objfile_obstack, linetablesize)__extension__ ({ struct obstack *__h = (&objfile->objfile_obstack
); __extension__ ({ struct obstack *__o = (__h); int __len = (
(linetablesize)); if (__o->chunk_limit - __o->next_free
 < __len) _obstack_newchunk (__o, __len); ((__o)->next_free
 += (__len)); (void) 0; }); __extension__ ({ struct obstack *
__o1 = (__h); void *value; value = (void *) __o1->object_base
; if (__o1->next_free == value) __o1->maybe_empty_object
 = 1; __o1->next_free = (((((__o1->next_free) - (char *
) 0)+__o1->alignment_mask) & ~ (__o1->alignment_mask
)) + (char *) 0); if (__o1->next_free - (char *)__o1->chunk
 > __o1->chunk_limit - (char *)__o1->chunk) __o1->
next_free = __o1->chunk_limit; __o1->object_base = __o1
->next_free; value; }); });
12
←
Assuming the condition is false→
13
←
Taking false branch→
14
←
Assuming 'value' is not equal to field 'next_free'→
15
←
Taking false branch→
16
←
Assuming the condition is false→
17
←
Taking false branch→
     memcpy (symtab->linetable, subfile->line_vector, linetablesize);
   }
 else
   {
     symtab->linetable = NULL((void*)0);
   }
 symtab->block_line_section = section;
 if (subfile->dirname)
18
←
Assuming field 'dirname' is non-null→
19
←
Taking true branch→
   {
     /* Reallocate the dirname on the symbol obstack */
     symtab->dirname = (char *)
25
←
Null pointer value stored to field 'dirname'→
obstack_alloc (&objfile->objfile_obstack,__extension__ ({ struct obstack *__h = (&objfile->objfile_obstack
); __extension__ ({ struct obstack *__o = (__h); int __len = (
(strlen (subfile->dirname) + 1)); if (__o->chunk_limit -
 __o->next_free < __len) _obstack_newchunk (__o, __len)
; ((__o)->next_free += (__len)); (void) 0; }); __extension__
 ({ struct obstack *__o1 = (__h); void *value; value = (void *
) __o1->object_base; if (__o1->next_free == value) __o1
->maybe_empty_object = 1; __o1->next_free = (((((__o1->
next_free) - (char *) 0)+__o1->alignment_mask) & ~ (__o1
->alignment_mask)) + (char *) 0); if (__o1->next_free -
 (char *)__o1->chunk > __o1->chunk_limit - (char *)__o1
->chunk) __o1->next_free = __o1->chunk_limit; __o1->
object_base = __o1->next_free; value; }); })
20
←
Assuming the condition is false→
21
←
Taking false branch→
22
←
Taking true branch→
23
←
Assuming the condition is false→
24
←
Taking false branch→
	       strlen (subfile->dirname) + 1)__extension__ ({ struct obstack *__h = (&objfile->objfile_obstack
); __extension__ ({ struct obstack *__o = (__h); int __len = (
(strlen (subfile->dirname) + 1)); if (__o->chunk_limit -
 __o->next_free < __len) _obstack_newchunk (__o, __len)
; ((__o)->next_free += (__len)); (void) 0; }); __extension__
 ({ struct obstack *__o1 = (__h); void *value; value = (void *
) __o1->object_base; if (__o1->next_free == value) __o1
->maybe_empty_object = 1; __o1->next_free = (((((__o1->
next_free) - (char *) 0)+__o1->alignment_mask) & ~ (__o1
->alignment_mask)) + (char *) 0); if (__o1->next_free -
 (char *)__o1->chunk > __o1->chunk_limit - (char *)__o1
->chunk) __o1->next_free = __o1->chunk_limit; __o1->
object_base = __o1->next_free; value; }); });
     strcpy (symtab->dirname, subfile->dirname);
26
←
Null pointer passed as 1st argument to string copy function
   }
 else
   {
     symtab->dirname = NULL((void*)0);
   }
 symtab->free_code = free_linetable;
 symtab->free_func = NULL((void*)0);

 /* Use whatever language we have been using for this
    subfile, not the one that was deduced in allocate_symtab
    from the filename.  We already did our own deducing when
    we created the subfile, and we may have altered our
    opinion of what language it is from things we found in
    the symbols. */
 symtab->language = subfile->language;

 /* Save the debug format string (if any) in the symtab */
 if (subfile->debugformat != NULL((void*)0))
   {
     symtab->debugformat = obsavestring (subfile->debugformat,
			      strlen (subfile->debugformat),
				  &objfile->objfile_obstack);
   }

 /* All symtabs for the main file and the subfiles share a
    blockvector, so we need to clear primary for everything
    but the main file.  */

 symtab->primary = 0;
}
    if (subfile->name != NULL((void*)0))
{
 xfree ((void *) subfile->name);
}
    if (subfile->dirname != NULL((void*)0))
{
 xfree ((void *) subfile->dirname);
}
    if (subfile->line_vector != NULL((void*)0))
{
 xfree ((void *) subfile->line_vector);
}
    if (subfile->debugformat != NULL((void*)0))
{
 xfree ((void *) subfile->debugformat);
}

    nextsub = subfile->next;
    xfree ((void *) subfile);
  }

/* Set this for the main source file.  */
if (symtab)
  {
    symtab->primary = 1;
  }

last_source_file = NULL((void*)0);
current_subfile = NULL((void*)0);
pending_macros = NULL((void*)0);

return symtab;
1040}

1042/* Push a context block.  Args are an identifying nesting level
 (checkable when you pop it), and the starting PC address of this
 context.  */

1046struct context_stack *
1047push_context (int desc, CORE_ADDR valu)
1048{
struct context_stack *new;

if (context_stack_depth == context_stack_size)
  {
    context_stack_size *= 2;
    context_stack = (struct context_stack *)
xrealloc ((char *) context_stack,
  (context_stack_size * sizeof (struct context_stack)));
  }

new = &context_stack[context_stack_depth++];
new->depth = desc;
new->locals = local_symbols;
new->params = param_symbols;
new->old_blocks = pending_blocks;
new->start_addr = valu;
new->name = NULL((void*)0);

local_symbols = NULL((void*)0);
param_symbols = NULL((void*)0);

return new;
1071}

1073/* Pop a context block.  Returns the address of the context block just
 popped. */

1076struct context_stack *
1077pop_context (void)
1078{
gdb_assert (context_stack_depth > 0)((void) ((context_stack_depth > 0) ? 0 : (internal_error (
"/usr/src/gnu/usr.bin/binutils/gdb/buildsym.c", 1079, "%s: Assertion `%s' failed."
, __PRETTY_FUNCTION__, "context_stack_depth > 0"), 0)));
return (&context_stack[--context_stack_depth]);
1081}

1083

1085/* Compute a small integer hash code for the given name. */

1087int
1088hashname (char *name)
1089{
  return (hash(name,strlen(name)) % HASHSIZE127);
1091}
1092

1094void
1095record_debugformat (char *format)
1096{
current_subfile->debugformat = savestring (format, strlen (format));
1098}

1100/* Merge the first symbol list SRCLIST into the second symbol list
 TARGETLIST by repeated calls to add_symbol_to_list().  This
 procedure "frees" each link of SRCLIST by adding it to the
 free_pendings list.  Caller must set SRCLIST to a null list after
 calling this function.

 Void return. */

1108void
1109merge_symbol_lists (struct pending **srclist, struct pending **targetlist)
1110{
int i;

if (!srclist || !*srclist)
  return;

/* Merge in elements from current link.  */
for (i = 0; i < (*srclist)->nsyms; i++)
  add_symbol_to_list ((*srclist)->symbol[i], targetlist);

/* Recurse on next.  */
merge_symbol_lists (&(*srclist)->next, targetlist);

/* "Free" the current link.  */
(*srclist)->next = free_pendings;
free_pendings = (*srclist);
1126}
1127
1128/* Initialize anything that needs initializing when starting to read a
 fresh piece of a symbol file, e.g. reading in the stuff
 corresponding to a psymtab.  */

1132void
1133buildsym_init (void)
1134{
free_pendings = NULL((void*)0);
file_symbols = NULL((void*)0);
global_symbols = NULL((void*)0);
pending_blocks = NULL((void*)0);
pending_macros = NULL((void*)0);
1140}

1142/* Initialize anything that needs initializing when a completely new
 symbol file is specified (not just adding some symbols from another
 file, e.g. a shared library).  */

1146void
1147buildsym_new_init (void)
1148{
buildsym_init ();
1150}