gdb/buildsym.c - gdb

Global variables defined

Data types defined

Functions defined

Macros defined

Source code

  1. /* Support routines for building symbol tables in GDB's internal format.
  2.    Copyright (C) 1986-2015 Free Software Foundation, Inc.

  4.    This file is part of GDB.

  6.    This program is free software; you can redistribute it and/or modify
  7.    it under the terms of the GNU General Public License as published by
  8.    the Free Software Foundation; either version 3 of the License, or
  9.    (at your option) any later version.

  11.    This program is distributed in the hope that it will be useful,
  12.    but WITHOUT ANY WARRANTY; without even the implied warranty of
  13.    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14.    GNU General Public License for more details.

  16.    You should have received a copy of the GNU General Public License
  17.    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */

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

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

  26.    The basic way this module is used is as follows:

  28.    buildsym_init ();
  29.    cleanups = make_cleanup (really_free_pendings, NULL);
  30.    cust = start_symtab (...);
  31.    ... read debug info ...
  32.    cust = end_symtab (...);
  33.    do_cleanups (cleanups);

  35.    The compunit symtab pointer ("cust") is returned from both start_symtab
  36.    and end_symtab to simplify the debug info readers.

  38.    There are minor variations on this, e.g., dwarf2read.c splits end_symtab
  39.    into two calls: end_symtab_get_static_block, end_symtab_from_static_block,
  40.    but all debug info readers follow this basic flow.

  42.    Reading DWARF Type Units is another variation:

  44.    buildsym_init ();
  45.    cleanups = make_cleanup (really_free_pendings, NULL);
  46.    cust = start_symtab (...);
  47.    ... read debug info ...
  48.    cust = end_expandable_symtab (...);
  49.    do_cleanups (cleanups);

  51.    And then reading subsequent Type Units within the containing "Comp Unit"
  52.    will use a second flow:

  54.    buildsym_init ();
  55.    cleanups = make_cleanup (really_free_pendings, NULL);
  56.    cust = restart_symtab (...);
  57.    ... read debug info ...
  58.    cust = augment_type_symtab (...);
  59.    do_cleanups (cleanups);

  61.    dbxread.c and xcoffread.c use another variation:

  63.    buildsym_init ();
  64.    cleanups = make_cleanup (really_free_pendings, NULL);
  65.    cust = start_symtab (...);
  66.    ... read debug info ...
  67.    cust = end_symtab (...);
  68.    ... start_symtab + read + end_symtab repeated ...
  69.    do_cleanups (cleanups);
  70. */

  72. #include "defs.h"
  73. #include "bfd.h"
  74. #include "gdb_obstack.h"
  75. #include "symtab.h"
  76. #include "symfile.h"
  77. #include "objfiles.h"
  78. #include "gdbtypes.h"
  79. #include "complaints.h"
  80. #include "expression.h"                /* For "enum exp_opcode" used by...  */
  81. #include "bcache.h"
  82. #include "filenames.h"                /* For DOSish file names.  */
  83. #include "macrotab.h"
  84. #include "demangle.h"                /* Needed by SYMBOL_INIT_DEMANGLED_NAME.  */
  85. #include "block.h"
  86. #include "cp-support.h"
  87. #include "dictionary.h"
  88. #include "addrmap.h"

  90. /* Ask buildsym.h to define the vars it normally declares `extern'.  */
  91. ‌#define        EXTERN
  92. /**/
  93. #include "buildsym.h"                /* Our own declarations.  */
  94. ‌#undef        EXTERN

  96. /* For cleanup_undefined_stabs_types and finish_global_stabs (somewhat
  97.    questionable--see comment where we call them).  */

  99. #include "stabsread.h"

  101. /* Buildsym's counterpart to struct compunit_symtab.
  102.    TODO(dje): Move all related global state into here.  */

  104. ‌struct buildsym_compunit
  105. {
  106.   /* The objfile we're reading debug info from.  */
  107.   struct objfile *objfile;

  109.   /* List of subfiles (source files).
  110.      Files are added to the front of the list.
  111.      This is important mostly for the language determination hacks we use,
  112.      which iterate over previously added files.  */
  113.   struct subfile *subfiles;

  115.   /* The subfile of the main source file.  */
  116.   struct subfile *main_subfile;

  118.   /* E.g., DW_AT_comp_dir if DWARF.  Space for this is malloc'd.  */
  119.   char *comp_dir;

  121.   /* Space for this is not malloc'd, and is assumed to have at least
  122.      the same lifetime as objfile.  */
  123.   const char *producer;

  125.   /* Space for this is not malloc'd, and is assumed to have at least
  126.      the same lifetime as objfile.  */
  127.   const char *debugformat;

  129.   /* The compunit we are building.  */
  130.   struct compunit_symtab *compunit_symtab;
  131. };

  133. /* The work-in-progress of the compunit we are building.
  134.    This is created first, before any subfiles by start_symtab.  */

  136. ‌static struct buildsym_compunit *buildsym_compunit;

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

  140. ‌static struct pending *free_pendings;

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

  145. ‌static int have_line_numbers;

  147. /* The mutable address map for the compilation unit whose symbols
  148.    we're currently reading.  The symtabs' shared blockvector will
  149.    point to a fixed copy of this.  */
  150. ‌static struct addrmap *pending_addrmap;

  152. /* The obstack on which we allocate pending_addrmap.
  153.    If pending_addrmap is NULL, this is uninitialized; otherwise, it is
  154.    initialized (and holds pending_addrmap).  */
  155. ‌static struct obstack pending_addrmap_obstack;

  157. /* Non-zero if we recorded any ranges in the addrmap that are
  158.    different from those in the blockvector already.  We set this to
  159.    zero when we start processing a symfile, and if it's still zero at
  160.    the end, then we just toss the addrmap.  */
  161. ‌static int pending_addrmap_interesting;

  163. /* An obstack used for allocating pending blocks.  */

  165. ‌static struct obstack pending_block_obstack;

  167. /* List of blocks already made (lexical contexts already closed).
  168.    This is used at the end to make the blockvector.  */

  170. ‌struct pending_block
  171.   {
  172.     struct pending_block *next;
  173.     struct block *block;
  174.   };

  176. /* Pointer to the head of a linked list of symbol blocks which have
  177.    already been finalized (lexical contexts already closed) and which
  178.    are just waiting to be built into a blockvector when finalizing the
  179.    associated symtab.  */

  181. ‌static struct pending_block *pending_blocks;

  183. ‌struct subfile_stack
  184.   {
  185.     struct subfile_stack *next;
  186.     char *name;
  187.   };

  189. ‌static struct subfile_stack *subfile_stack;

  191. /* The macro table for the compilation unit whose symbols we're
  192.    currently reading.  */
  193. ‌static struct macro_table *pending_macros;

  195. static void free_buildsym_compunit (void);

  197. static int compare_line_numbers (const void *ln1p, const void *ln2p);

  199. static void record_pending_block (struct objfile *objfile,
  200.                                   struct block *block,
  201.                                   struct pending_block *opblock);

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

  207. ‌#define        INITIAL_CONTEXT_STACK_SIZE        10
  208. ‌#define        INITIAL_LINE_VECTOR_LENGTH        1000


  211. /* Maintain the lists of symbols and blocks.  */

  213. /* Add a symbol to one of the lists of symbols.  */

  215. void
  216. ‌add_symbol_to_list (struct symbol *symbol, struct pending **listhead)
  217. {
  218.   struct pending *link;

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

  224.   /* We keep PENDINGSIZE symbols in each link of the list.  If we
  225.      don't have a link with room in it, add a new link.  */
  226.   if (*listhead == NULL || (*listhead)->nsyms == PENDINGSIZE)
  227.     {
  228.       if (free_pendings)
  229.         {
  230.           link = free_pendings;
  231.           free_pendings = link->next;
  232.         }
  233.       else
  234.         {
  235.           link = (struct pending *) xmalloc (sizeof (struct pending));
  236.         }

  238.       link->next = *listhead;
  239.       *listhead = link;
  240.       link->nsyms = 0;
  241.     }

  243.   (*listhead)->symbol[(*listhead)->nsyms++] = symbol;
  244. }

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

  249. struct symbol *
  250. ‌find_symbol_in_list (struct pending *list, char *name, int length)
  251. {
  252.   int j;
  253.   const char *pp;

  255.   while (list != NULL)
  256.     {
  257.       for (j = list->nsyms; --j >= 0;)
  258.         {
  259.           pp = SYMBOL_LINKAGE_NAME (list->symbol[j]);
  260.           if (*pp == *name && strncmp (pp, name, length) == 0
  261.               && pp[length] == '\0')
  262.             {
  263.               return (list->symbol[j]);
  264.             }
  265.         }
  266.       list = list->next;
  267.     }
  268.   return (NULL);
  269. }

  271. /* At end of reading syms, or in case of quit, ensure everything associated
  272.    with building symtabs is freed.  This is intended to be registered as a
  273.    cleanup before doing psymtab->symtab expansion.

  275.    N.B. This is *not* intended to be used when building psymtabs.  Some debug
  276.    info readers call this anyway, which is harmless if confusing.  */

  278. void
  279. ‌really_free_pendings (void *dummy)
  280. {
  281.   struct pending *next, *next1;

  283.   for (next = free_pendings; next; next = next1)
  284.     {
  285.       next1 = next->next;
  286.       xfree ((void *) next);
  287.     }
  288.   free_pendings = NULL;

  290.   free_pending_blocks ();

  292.   for (next = file_symbols; next != NULL; next = next1)
  293.     {
  294.       next1 = next->next;
  295.       xfree ((void *) next);
  296.     }
  297.   file_symbols = NULL;

  299.   for (next = global_symbols; next != NULL; next = next1)
  300.     {
  301.       next1 = next->next;
  302.       xfree ((void *) next);
  303.     }
  304.   global_symbols = NULL;

  306.   if (pending_macros)
  307.     free_macro_table (pending_macros);
  308.   pending_macros = NULL;

  310.   if (pending_addrmap)
  311.     obstack_free (&pending_addrmap_obstack, NULL);
  312.   pending_addrmap = NULL;

  314.   free_buildsym_compunit ();
  315. }

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

  319. void
  320. ‌free_pending_blocks (void)
  321. {
  322.   if (pending_blocks != NULL)
  323.     {
  324.       obstack_free (&pending_block_obstack, NULL);
  325.       pending_blocks = NULL;
  326.     }
  327. }

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

  333. static struct block *
  334. ‌finish_block_internal (struct symbol *symbol, struct pending **listhead,
  335.                        struct pending_block *old_blocks,
  336.                        CORE_ADDR start, CORE_ADDR end,
  337.                        int is_global, int expandable)
  338. {
  339.   struct objfile *objfile = buildsym_compunit->objfile;
  340.   struct gdbarch *gdbarch = get_objfile_arch (objfile);
  341.   struct pending *next, *next1;
  342.   struct block *block;
  343.   struct pending_block *pblock;
  344.   struct pending_block *opblock;

  346.   block = (is_global
  347.            ? allocate_global_block (&objfile->objfile_obstack)
  348.            : allocate_block (&objfile->objfile_obstack));

  350.   if (symbol)
  351.     {
  352.       BLOCK_DICT (block) = dict_create_linear (&objfile->objfile_obstack,
  353.                                                *listhead);
  354.     }
  355.   else
  356.     {
  357.       if (expandable)
  358.         {
  359.           BLOCK_DICT (block) = dict_create_hashed_expandable ();
  360.           dict_add_pending (BLOCK_DICT (block), *listhead);
  361.         }
  362.       else
  363.         {
  364.           BLOCK_DICT (block) =
  365.             dict_create_hashed (&objfile->objfile_obstack, *listhead);
  366.         }
  367.     }

  369.   BLOCK_START (block) = start;
  370.   BLOCK_END (block) = end;

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

  374.   if (symbol)
  375.     {
  376.       struct type *ftype = SYMBOL_TYPE (symbol);
  377.       struct dict_iterator iter;
  378.       SYMBOL_BLOCK_VALUE (symbol) = block;
  379.       BLOCK_FUNCTION (block) = symbol;

  381.       if (TYPE_NFIELDS (ftype) <= 0)
  382.         {
  383.           /* No parameter type information is recorded with the
  384.              function's type.  Set that from the type of the
  385.              parameter symbols.  */
  386.           int nparams = 0, iparams;
  387.           struct symbol *sym;

  389.           /* Here we want to directly access the dictionary, because
  390.              we haven't fully initialized the block yet.  */
  391.           ALL_DICT_SYMBOLS (BLOCK_DICT (block), iter, sym)
  392.             {
  393.               if (SYMBOL_IS_ARGUMENT (sym))
  394.                 nparams++;
  395.             }
  396.           if (nparams > 0)
  397.             {
  398.               TYPE_NFIELDS (ftype) = nparams;
  399.               TYPE_FIELDS (ftype) = (struct field *)
  400.                 TYPE_ALLOC (ftype, nparams * sizeof (struct field));

  402.               iparams = 0;
  403.               /* Here we want to directly access the dictionary, because
  404.                  we haven't fully initialized the block yet.  */
  405.               ALL_DICT_SYMBOLS (BLOCK_DICT (block), iter, sym)
  406.                 {
  407.                   if (iparams == nparams)
  408.                     break;

  410.                   if (SYMBOL_IS_ARGUMENT (sym))
  411.                     {
  412.                       TYPE_FIELD_TYPE (ftype, iparams) = SYMBOL_TYPE (sym);
  413.                       TYPE_FIELD_ARTIFICIAL (ftype, iparams) = 0;
  414.                       iparams++;
  415.                     }
  416.                 }
  417.             }
  418.         }
  419.     }
  420.   else
  421.     {
  422.       BLOCK_FUNCTION (block) = NULL;
  423.     }

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

  427.   for (next = *listhead; next; next = next1)
  428.     {
  429.       next1 = next->next;
  430.       next->next = free_pendings;
  431.       free_pendings = next;
  432.     }
  433.   *listhead = NULL;

  435.   /* Check to be sure that the blocks have an end address that is
  436.      greater than starting address.  */

  438.   if (BLOCK_END (block) < BLOCK_START (block))
  439.     {
  440.       if (symbol)
  441.         {
  442.           complaint (&symfile_complaints,
  443.                      _("block end address less than block "
  444.                        "start address in %s (patched it)"),
  445.                      SYMBOL_PRINT_NAME (symbol));
  446.         }
  447.       else
  448.         {
  449.           complaint (&symfile_complaints,
  450.                      _("block end address %s less than block "
  451.                        "start address %s (patched it)"),
  452.                      paddress (gdbarch, BLOCK_END (block)),
  453.                      paddress (gdbarch, BLOCK_START (block)));
  454.         }
  455.       /* Better than nothing.  */
  456.       BLOCK_END (block) = BLOCK_START (block);
  457.     }

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

  462.   opblock = NULL;
  463.   for (pblock = pending_blocks;
  464.        pblock && pblock != old_blocks;
  465.        pblock = pblock->next)
  466.     {
  467.       if (BLOCK_SUPERBLOCK (pblock->block) == NULL)
  468.         {
  469.           /* Check to be sure the blocks are nested as we receive
  470.              them.  If the compiler/assembler/linker work, this just
  471.              burns a small amount of time.

  473.              Skip blocks which correspond to a function; they're not
  474.              physically nested inside this other blocks, only
  475.              lexically nested.  */
  476.           if (BLOCK_FUNCTION (pblock->block) == NULL
  477.               && (BLOCK_START (pblock->block) < BLOCK_START (block)
  478.                   || BLOCK_END (pblock->block) > BLOCK_END (block)))
  479.             {
  480.               if (symbol)
  481.                 {
  482.                   complaint (&symfile_complaints,
  483.                              _("inner block not inside outer block in %s"),
  484.                              SYMBOL_PRINT_NAME (symbol));
  485.                 }
  486.               else
  487.                 {
  488.                   complaint (&symfile_complaints,
  489.                              _("inner block (%s-%s) not "
  490.                                "inside outer block (%s-%s)"),
  491.                              paddress (gdbarch, BLOCK_START (pblock->block)),
  492.                              paddress (gdbarch, BLOCK_END (pblock->block)),
  493.                              paddress (gdbarch, BLOCK_START (block)),
  494.                              paddress (gdbarch, BLOCK_END (block)));
  495.                 }
  496.               if (BLOCK_START (pblock->block) < BLOCK_START (block))
  497.                 BLOCK_START (pblock->block) = BLOCK_START (block);
  498.               if (BLOCK_END (pblock->block) > BLOCK_END (block))
  499.                 BLOCK_END (pblock->block) = BLOCK_END (block);
  500.             }
  501.           BLOCK_SUPERBLOCK (pblock->block) = block;
  502.         }
  503.       opblock = pblock;
  504.     }

  506.   block_set_using (block, using_directives, &objfile->objfile_obstack);
  507.   using_directives = NULL;

  509.   record_pending_block (objfile, block, opblock);

  511.   return block;
  512. }

  514. struct block *
  515. ‌finish_block (struct symbol *symbol, struct pending **listhead,
  516.               struct pending_block *old_blocks,
  517.               CORE_ADDR start, CORE_ADDR end)
  518. {
  519.   return finish_block_internal (symbol, listhead, old_blocks,
  520.                                 start, end, 0, 0);
  521. }

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

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

  530. static void
  531. ‌record_pending_block (struct objfile *objfile, struct block *block,
  532.                       struct pending_block *opblock)
  533. {
  534.   struct pending_block *pblock;

  536.   if (pending_blocks == NULL)
  537.     obstack_init (&pending_block_obstack);

  539.   pblock = (struct pending_block *)
  540.     obstack_alloc (&pending_block_obstack, sizeof (struct pending_block));
  541.   pblock->block = block;
  542.   if (opblock)
  543.     {
  544.       pblock->next = opblock->next;
  545.       opblock->next = pblock;
  546.     }
  547.   else
  548.     {
  549.       pblock->next = pending_blocks;
  550.       pending_blocks = pblock;
  551.     }
  552. }


  555. /* Record that the range of addresses from START to END_INCLUSIVE
  556.    (inclusive, like it says) belongs to BLOCK.  BLOCK's start and end
  557.    addresses must be set already.  You must apply this function to all
  558.    BLOCK's children before applying it to BLOCK.

  560.    If a call to this function complicates the picture beyond that
  561.    already provided by BLOCK_START and BLOCK_END, then we create an
  562.    address map for the block.  */
  563. void
  564. ‌record_block_range (struct block *block,
  565.                     CORE_ADDR start, CORE_ADDR end_inclusive)
  566. {
  567.   /* If this is any different from the range recorded in the block's
  568.      own BLOCK_START and BLOCK_END, then note that the address map has
  569.      become interesting.  Note that even if this block doesn't have
  570.      any "interesting" ranges, some later block might, so we still
  571.      need to record this block in the addrmap.  */
  572.   if (start != BLOCK_START (block)
  573.       || end_inclusive + 1 != BLOCK_END (block))
  574.     pending_addrmap_interesting = 1;

  576.   if (! pending_addrmap)
  577.     {
  578.       obstack_init (&pending_addrmap_obstack);
  579.       pending_addrmap = addrmap_create_mutable (&pending_addrmap_obstack);
  580.     }

  582.   addrmap_set_empty (pending_addrmap, start, end_inclusive, block);
  583. }

  585. static struct blockvector *
  586. ‌make_blockvector (void)
  587. {
  588.   struct objfile *objfile = buildsym_compunit->objfile;
  589.   struct pending_block *next;
  590.   struct blockvector *blockvector;
  591.   int i;

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

  595.   for (next = pending_blocks, i = 0; next; next = next->next, i++)
  596.     {;
  597.     }

  599.   blockvector = (struct blockvector *)
  600.     obstack_alloc (&objfile->objfile_obstack,
  601.                    (sizeof (struct blockvector)
  602.                     + (i - 1) * sizeof (struct block *)));

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

  610.   BLOCKVECTOR_NBLOCKS (blockvector) = i;
  611.   for (next = pending_blocks; next; next = next->next)
  612.     {
  613.       BLOCKVECTOR_BLOCK (blockvector, --i) = next->block;
  614.     }

  616.   free_pending_blocks ();

  618.   /* If we needed an address map for this symtab, record it in the
  619.      blockvector.  */
  620.   if (pending_addrmap && pending_addrmap_interesting)
  621.     BLOCKVECTOR_MAP (blockvector)
  622.       = addrmap_create_fixed (pending_addrmap, &objfile->objfile_obstack);
  623.   else
  624.     BLOCKVECTOR_MAP (blockvector) = 0;

  626.   /* Some compilers output blocks in the wrong order, but we depend on
  627.      their being in the right order so we can binary search.  Check the
  628.      order and moan about it.
  629.      Note: Remember that the first two blocks are the global and static
  630.      blocks.  We could special case that fact and begin checking at block 2.
  631.      To avoid making that assumption we do not.  */
  632.   if (BLOCKVECTOR_NBLOCKS (blockvector) > 1)
  633.     {
  634.       for (i = 1; i < BLOCKVECTOR_NBLOCKS (blockvector); i++)
  635.         {
  636.           if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i - 1))
  637.               > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i)))
  638.             {
  639.               CORE_ADDR start
  640.                 = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i));

  642.               complaint (&symfile_complaints, _("block at %s out of order"),
  643.                          hex_string ((LONGEST) start));
  644.             }
  645.         }
  646.     }

  648.   return (blockvector);
  649. }

  651. /* Start recording information about source code that came from an
  652.    included (or otherwise merged-in) source file with a different
  653.    name.  NAME is the name of the file (cannot be NULL).  */

  655. void
  656. ‌start_subfile (const char *name)
  657. {
  658.   const char *subfile_dirname;
  659.   struct subfile *subfile;

  661.   gdb_assert (buildsym_compunit != NULL);

  663.   subfile_dirname = buildsym_compunit->comp_dir;

  665.   /* See if this subfile is already registered.  */

  667.   for (subfile = buildsym_compunit->subfiles; subfile; subfile = subfile->next)
  668.     {
  669.       char *subfile_name;

  671.       /* If NAME is an absolute path, and this subfile is not, then
  672.          attempt to create an absolute path to compare.  */
  673.       if (IS_ABSOLUTE_PATH (name)
  674.           && !IS_ABSOLUTE_PATH (subfile->name)
  675.           && subfile_dirname != NULL)
  676.         subfile_name = concat (subfile_dirname, SLASH_STRING,
  677.                                subfile->name, (char *) NULL);
  678.       else
  679.         subfile_name = subfile->name;

  681.       if (FILENAME_CMP (subfile_name, name) == 0)
  682.         {
  683.           current_subfile = subfile;
  684.           if (subfile_name != subfile->name)
  685.             xfree (subfile_name);
  686.           return;
  687.         }
  688.       if (subfile_name != subfile->name)
  689.         xfree (subfile_name);
  690.     }

  692.   /* This subfile is not known.  Add an entry for it.  */

  694.   subfile = (struct subfile *) xmalloc (sizeof (struct subfile));
  695.   memset (subfile, 0, sizeof (struct subfile));
  696.   subfile->buildsym_compunit = buildsym_compunit;

  698.   subfile->next = buildsym_compunit->subfiles;
  699.   buildsym_compunit->subfiles = subfile;

  701.   current_subfile = subfile;

  703.   subfile->name = xstrdup (name);

  705.   /* Initialize line-number recording for this subfile.  */
  706.   subfile->line_vector = NULL;

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

  719.   subfile->language = deduce_language_from_filename (subfile->name);
  720.   if (subfile->language == language_unknown
  721.       && subfile->next != NULL)
  722.     {
  723.       subfile->language = subfile->next->language;
  724.     }

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

  731.   if (subfile->name)
  732.     {
  733.       struct subfile *s;
  734.       enum language sublang = deduce_language_from_filename (subfile->name);

  736.       if (sublang == language_cplus || sublang == language_fortran)
  737.         for (s = buildsym_compunit->subfiles; s != NULL; s = s->next)
  738.           if (s->language == language_c)
  739.             s->language = sublang;
  740.     }

  742.   /* And patch up this file if necessary.  */
  743.   if (subfile->language == language_c
  744.       && subfile->next != NULL
  745.       && (subfile->next->language == language_cplus
  746.           || subfile->next->language == language_fortran))
  747.     {
  748.       subfile->language = subfile->next->language;
  749.     }
  750. }

  752. /* Start recording information about a primary source file (IOW, not an
  753.    included source file).
  754.    COMP_DIR is the directory in which the compilation unit was compiled
  755.    (or NULL if not known).  */

  757. static struct buildsym_compunit *
  758. ‌start_buildsym_compunit (struct objfile *objfile, const char *comp_dir)
  759. {
  760.   struct buildsym_compunit *bscu;

  762.   bscu = (struct buildsym_compunit *)
  763.     xmalloc (sizeof (struct buildsym_compunit));
  764.   memset (bscu, 0, sizeof (struct buildsym_compunit));

  766.   bscu->objfile = objfile;
  767.   bscu->comp_dir = (comp_dir == NULL) ? NULL : xstrdup (comp_dir);

  769.   /* Initialize the debug format string to NULL.  We may supply it
  770.      later via a call to record_debugformat.  */
  771.   bscu->debugformat = NULL;

  773.   /* Similarly for the producer.  */
  774.   bscu->producer = NULL;

  776.   return bscu;
  777. }

  779. /* Delete the buildsym compunit.  */

  781. static void
  782. ‌free_buildsym_compunit (void)
  783. {
  784.   struct subfile *subfile, *nextsub;

  786.   if (buildsym_compunit == NULL)
  787.     return;
  788.   for (subfile = buildsym_compunit->subfiles;
  789.        subfile != NULL;
  790.        subfile = nextsub)
  791.     {
  792.       nextsub = subfile->next;
  793.       xfree (subfile->name);
  794.       xfree (subfile->line_vector);
  795.       xfree (subfile);
  796.     }
  797.   xfree (buildsym_compunit->comp_dir);
  798.   xfree (buildsym_compunit);
  799.   buildsym_compunit = NULL;
  800.   current_subfile = NULL;
  801. }

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

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

  815. void
  816. ‌patch_subfile_names (struct subfile *subfile, char *name)
  817. {
  818.   if (subfile != NULL
  819.       && buildsym_compunit->comp_dir == NULL
  820.       && subfile->name != NULL
  821.       && IS_DIR_SEPARATOR (subfile->name[strlen (subfile->name) - 1]))
  822.     {
  823.       buildsym_compunit->comp_dir = subfile->name;
  824.       subfile->name = xstrdup (name);
  825.       set_last_source_file (name);

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

  838.       subfile->language = deduce_language_from_filename (subfile->name);
  839.       if (subfile->language == language_unknown
  840.           && subfile->next != NULL)
  841.         {
  842.           subfile->language = subfile->next->language;
  843.         }
  844.     }
  845. }

  847. /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
  848.    switching source files (different subfiles, as we call them) within
  849.    one object file, but using a stack rather than in an arbitrary
  850.    order.  */

  852. void
  853. ‌push_subfile (void)
  854. {
  855.   struct subfile_stack *tem
  856.     = (struct subfile_stack *) xmalloc (sizeof (struct subfile_stack));

  858.   tem->next = subfile_stack;
  859.   subfile_stack = tem;
  860.   if (current_subfile == NULL || current_subfile->name == NULL)
  861.     {
  862.       internal_error (__FILE__, __LINE__,
  863.                       _("failed internal consistency check"));
  864.     }
  865.   tem->name = current_subfile->name;
  866. }

  868. char *
  869. ‌pop_subfile (void)
  870. {
  871.   char *name;
  872.   struct subfile_stack *link = subfile_stack;

  874.   if (link == NULL)
  875.     {
  876.       internal_error (__FILE__, __LINE__,
  877.                       _("failed internal consistency check"));
  878.     }
  879.   name = link->name;
  880.   subfile_stack = link->next;
  881.   xfree ((void *) link);
  882.   return (name);
  883. }

  885. /* Add a linetable entry for line number LINE and address PC to the
  886.    line vector for SUBFILE.  */

  888. void
  889. ‌record_line (struct subfile *subfile, int line, CORE_ADDR pc)
  890. {
  891.   struct linetable_entry *e;

  893.   /* Ignore the dummy line number in libg.o */
  894.   if (line == 0xffff)
  895.     {
  896.       return;
  897.     }

  899.   /* Make sure line vector exists and is big enough.  */
  900.   if (!subfile->line_vector)
  901.     {
  902.       subfile->line_vector_length = INITIAL_LINE_VECTOR_LENGTH;
  903.       subfile->line_vector = (struct linetable *)
  904.         xmalloc (sizeof (struct linetable)
  905.            + subfile->line_vector_length * sizeof (struct linetable_entry));
  906.       subfile->line_vector->nitems = 0;
  907.       have_line_numbers = 1;
  908.     }

  910.   if (subfile->line_vector->nitems + 1 >= subfile->line_vector_length)
  911.     {
  912.       subfile->line_vector_length *= 2;
  913.       subfile->line_vector = (struct linetable *)
  914.         xrealloc ((char *) subfile->line_vector,
  915.                   (sizeof (struct linetable)
  916.                    + (subfile->line_vector_length
  917.                       * sizeof (struct linetable_entry))));
  918.     }

  920.   /* Normally, we treat lines as unsorted.  But the end of sequence
  921.      marker is special.  We sort line markers at the same PC by line
  922.      number, so end of sequence markers (which have line == 0) appear
  923.      first.  This is right if the marker ends the previous function,
  924.      and there is no padding before the next function.  But it is
  925.      wrong if the previous line was empty and we are now marking a
  926.      switch to a different subfile.  We must leave the end of sequence
  927.      marker at the end of this group of lines, not sort the empty line
  928.      to after the marker.  The easiest way to accomplish this is to
  929.      delete any empty lines from our table, if they are followed by
  930.      end of sequence markers.  All we lose is the ability to set
  931.      breakpoints at some lines which contain no instructions
  932.      anyway.  */
  933.   if (line == 0 && subfile->line_vector->nitems > 0)
  934.     {
  935.       e = subfile->line_vector->item + subfile->line_vector->nitems - 1;
  936.       while (subfile->line_vector->nitems > 0 && e->pc == pc)
  937.         {
  938.           e--;
  939.           subfile->line_vector->nitems--;
  940.         }
  941.     }

  943.   e = subfile->line_vector->item + subfile->line_vector->nitems++;
  944.   e->line = line;
  945.   e->pc = pc;
  946. }

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

  950. static int
  951. ‌compare_line_numbers (const void *ln1p, const void *ln2p)
  952. {
  953.   struct linetable_entry *ln1 = (struct linetable_entry *) ln1p;
  954.   struct linetable_entry *ln2 = (struct linetable_entry *) ln2p;

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

  961.   if (ln1->pc > ln2->pc)
  962.     return 1;

  964.   /* If pc equal, sort by line.  I'm not sure whether this is optimum
  965.      behavior (see comment at struct linetable in symtab.h).  */
  966.   return ln1->line - ln2->line;
  967. }

  969. /* See buildsym.h.  */

  971. struct compunit_symtab *
  972. ‌buildsym_compunit_symtab (void)
  973. {
  974.   gdb_assert (buildsym_compunit != NULL);

  976.   return buildsym_compunit->compunit_symtab;
  977. }

  979. /* See buildsym.h.  */

  981. struct macro_table *
  982. ‌get_macro_table (void)
  983. {
  984.   struct objfile *objfile;

  986.   gdb_assert (buildsym_compunit != NULL);

  988.   objfile = buildsym_compunit->objfile;

  990.   if (! pending_macros)
  991.     {
  992.       pending_macros = new_macro_table (&objfile->per_bfd->storage_obstack,
  993.                                         objfile->per_bfd->macro_cache,
  994.                                         buildsym_compunit->compunit_symtab);
  995.     }

  997.   return pending_macros;
  998. }

  1000. /* Init state to prepare for building a symtab.
  1001.    Note: This can't be done in buildsym_init because dbxread.c and xcoffread.c
  1002.    can call start_symtab+end_symtab multiple times after one call to
  1003.    buildsym_init.  */

  1005. static void
  1006. ‌prepare_for_building (const char *name, CORE_ADDR start_addr)
  1007. {
  1008.   set_last_source_file (name);
  1009.   last_source_start_addr = start_addr;

  1011.   local_symbols = NULL;
  1012.   within_function = 0;
  1013.   have_line_numbers = 0;

  1015.   context_stack_depth = 0;

  1017.   /* These should have been reset either by successful completion of building
  1018.      a symtab, or by the really_free_pendings cleanup.  */
  1019.   gdb_assert (file_symbols == NULL);
  1020.   gdb_assert (global_symbols == NULL);
  1021.   gdb_assert (pending_macros == NULL);
  1022.   gdb_assert (pending_addrmap == NULL);
  1023.   gdb_assert (current_subfile == NULL);
  1024. }

  1026. /* Start a new symtab for a new source file in OBJFILE.  Called, for example,
  1027.    when a stabs symbol of type N_SO is seen, or when a DWARF
  1028.    TAG_compile_unit DIE is seen.  It indicates the start of data for
  1029.    one original source file.

  1031.    NAME is the name of the file (cannot be NULL).  COMP_DIR is the directory in
  1032.    which the file was compiled (or NULL if not known).  START_ADDR is the
  1033.    lowest address of objects in the file (or 0 if not known).  */

  1035. struct compunit_symtab *
  1036. ‌start_symtab (struct objfile *objfile, const char *name, const char *comp_dir,
  1037.               CORE_ADDR start_addr)
  1038. {
  1039.   prepare_for_building (name, start_addr);

  1041.   buildsym_compunit = start_buildsym_compunit (objfile, comp_dir);

  1043.   /* Allocate the compunit symtab now.  The caller needs it to allocate
  1044.      non-primary symtabs.  It is also needed by get_macro_table.  */
  1045.   buildsym_compunit->compunit_symtab = allocate_compunit_symtab (objfile,
  1046.                                                                  name);

  1048.   /* Build the subfile for NAME (the main source file) so that we can record
  1049.      a pointer to it for later.
  1050.      IMPORTANT: Do not allocate a struct symtab for NAME here.
  1051.      It can happen that the debug info provides a different path to NAME than
  1052.      DIRNAME,NAME.  We cope with this in watch_main_source_file_lossage but
  1053.      that only works if the main_subfile doesn't have a symtab yet.  */
  1054.   start_subfile (name);
  1055.   /* Save this so that we don't have to go looking for it at the end
  1056.      of the subfiles list.  */
  1057.   buildsym_compunit->main_subfile = current_subfile;

  1059.   return buildsym_compunit->compunit_symtab;
  1060. }

  1062. /* Restart compilation for a symtab.
  1063.    CUST is the result of end_expandable_symtab.
  1064.    NAME, START_ADDR are the source file we are resuming with.

  1066.    This is used when a symtab is built from multiple sources.
  1067.    The symtab is first built with start_symtab/end_expandable_symtab
  1068.    and then for each additional piece call restart_symtab/augment_*_symtab.
  1069.    Note: At the moment there is only augment_type_symtab.  */

  1071. void
  1072. ‌restart_symtab (struct compunit_symtab *cust,
  1073.                 const char *name, CORE_ADDR start_addr)
  1074. {
  1075.   prepare_for_building (name, start_addr);

  1077.   buildsym_compunit = start_buildsym_compunit (COMPUNIT_OBJFILE (cust),
  1078.                                                COMPUNIT_DIRNAME (cust));
  1079.   buildsym_compunit->compunit_symtab = cust;
  1080. }

  1082. /* Subroutine of end_symtab to simplify it.  Look for a subfile that
  1083.    matches the main source file's basename.  If there is only one, and
  1084.    if the main source file doesn't have any symbol or line number
  1085.    information, then copy this file's symtab and line_vector to the
  1086.    main source file's subfile and discard the other subfile.  This can
  1087.    happen because of a compiler bug or from the user playing games
  1088.    with #line or from things like a distributed build system that
  1089.    manipulates the debug info.  This can also happen from an innocent
  1090.    symlink in the paths, we don't canonicalize paths here.  */

  1092. static void
  1093. ‌watch_main_source_file_lossage (void)
  1094. {
  1095.   struct subfile *mainsub, *subfile;

  1097.   /* We have to watch for buildsym_compunit == NULL here.  It's a quirk of
  1098.      end_symtab, it can return NULL so there may not be a main subfile.  */
  1099.   if (buildsym_compunit == NULL)
  1100.     return;

  1102.   /* Get the main source file.  */
  1103.   mainsub = buildsym_compunit->main_subfile;

  1105.   /* If the main source file doesn't have any line number or symbol
  1106.      info, look for an alias in another subfile.  */

  1108.   if (mainsub->line_vector == NULL
  1109.       && mainsub->symtab == NULL)
  1110.     {
  1111.       const char *mainbase = lbasename (mainsub->name);
  1112.       int nr_matches = 0;
  1113.       struct subfile *prevsub;
  1114.       struct subfile *mainsub_alias = NULL;
  1115.       struct subfile *prev_mainsub_alias = NULL;

  1117.       prevsub = NULL;
  1118.       for (subfile = buildsym_compunit->subfiles;
  1119.            subfile != NULL;
  1120.            subfile = subfile->next)
  1121.         {
  1122.           if (subfile == mainsub)
  1123.             continue;
  1124.           if (filename_cmp (lbasename (subfile->name), mainbase) == 0)
  1125.             {
  1126.               ++nr_matches;
  1127.               mainsub_alias = subfile;
  1128.               prev_mainsub_alias = prevsub;
  1129.             }
  1130.           prevsub = subfile;
  1131.         }

  1133.       if (nr_matches == 1)
  1134.         {
  1135.           gdb_assert (mainsub_alias != NULL && mainsub_alias != mainsub);

  1137.           /* Found a match for the main source file.
  1138.              Copy its line_vector and symtab to the main subfile
  1139.              and then discard it.  */

  1141.           mainsub->line_vector = mainsub_alias->line_vector;
  1142.           mainsub->line_vector_length = mainsub_alias->line_vector_length;
  1143.           mainsub->symtab = mainsub_alias->symtab;

  1145.           if (prev_mainsub_alias == NULL)
  1146.             buildsym_compunit->subfiles = mainsub_alias->next;
  1147.           else
  1148.             prev_mainsub_alias->next = mainsub_alias->next;
  1149.           xfree (mainsub_alias->name);
  1150.           xfree (mainsub_alias);
  1151.         }
  1152.     }
  1153. }

  1155. /* Helper function for qsort.  Parameters are `struct block *' pointers,
  1156.    function sorts them in descending order by their BLOCK_START.  */

  1158. static int
  1159. ‌block_compar (const void *ap, const void *bp)
  1160. {
  1161.   const struct block *a = *(const struct block **) ap;
  1162.   const struct block *b = *(const struct block **) bp;

  1164.   return ((BLOCK_START (b) > BLOCK_START (a))
  1165.           - (BLOCK_START (b) < BLOCK_START (a)));
  1166. }

  1168. /* Reset state after a successful building of a symtab.
  1169.    This exists because dbxread.c and xcoffread.c can call
  1170.    start_symtab+end_symtab multiple times after one call to buildsym_init,
  1171.    and before the really_free_pendings cleanup is called.
  1172.    We keep the free_pendings list around for dbx/xcoff sake.  */

  1174. static void
  1175. ‌reset_symtab_globals (void)
  1176. {
  1177.   set_last_source_file (NULL);

  1179.   local_symbols = NULL;
  1180.   file_symbols = NULL;
  1181.   global_symbols = NULL;

  1183.   /* We don't free pending_macros here because if the symtab was successfully
  1184.      built then ownership was transferred to the symtab.  */
  1185.   pending_macros = NULL;

  1187.   if (pending_addrmap)
  1188.     obstack_free (&pending_addrmap_obstack, NULL);
  1189.   pending_addrmap = NULL;

  1191.   free_buildsym_compunit ();
  1192. }

  1194. /* Implementation of the first part of end_symtab.  It allows modifying
  1195.    STATIC_BLOCK before it gets finalized by end_symtab_from_static_block.
  1196.    If the returned value is NULL there is no blockvector created for
  1197.    this symtab (you still must call end_symtab_from_static_block).

  1199.    END_ADDR is the same as for end_symtab: the address of the end of the
  1200.    file's text.

  1202.    If EXPANDABLE is non-zero the STATIC_BLOCK dictionary is made
  1203.    expandable.

  1205.    If REQUIRED is non-zero, then a symtab is created even if it does
  1206.    not contain any symbols.  */

  1208. struct block *
  1209. ‌end_symtab_get_static_block (CORE_ADDR end_addr, int expandable, int required)
  1210. {
  1211.   struct objfile *objfile = buildsym_compunit->objfile;

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

  1216.   if (context_stack_depth > 0)
  1217.     {
  1218.       struct context_stack *cstk = pop_context ();

  1220.       /* Make a block for the local symbols within.  */
  1221.       finish_block (cstk->name, &local_symbols, cstk->old_blocks,
  1222.                     cstk->start_addr, end_addr);

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

  1237.   /* Reordered executables may have out of order pending blocks; if
  1238.      OBJF_REORDERED is true, then sort the pending blocks.  */

  1240.   if ((objfile->flags & OBJF_REORDERED) && pending_blocks)
  1241.     {
  1242.       unsigned count = 0;
  1243.       struct pending_block *pb;
  1244.       struct block **barray, **bp;
  1245.       struct cleanup *back_to;

  1247.       for (pb = pending_blocks; pb != NULL; pb = pb->next)
  1248.         count++;

  1250.       barray = xmalloc (sizeof (*barray) * count);
  1251.       back_to = make_cleanup (xfree, barray);

  1253.       bp = barray;
  1254.       for (pb = pending_blocks; pb != NULL; pb = pb->next)
  1255.         *bp++ = pb->block;

  1257.       qsort (barray, count, sizeof (*barray), block_compar);

  1259.       bp = barray;
  1260.       for (pb = pending_blocks; pb != NULL; pb = pb->next)
  1261.         pb->block = *bp++;

  1263.       do_cleanups (back_to);
  1264.     }

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

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

  1276.   cleanup_undefined_stabs_types (objfile);
  1277.   finish_global_stabs (objfile);

  1279.   if (!required
  1280.       && pending_blocks == NULL
  1281.       && file_symbols == NULL
  1282.       && global_symbols == NULL
  1283.       && have_line_numbers == 0
  1284.       && pending_macros == NULL)
  1285.     {
  1286.       /* Ignore symtabs that have no functions with real debugging info.  */
  1287.       return NULL;
  1288.     }
  1289.   else
  1290.     {
  1291.       /* Define the STATIC_BLOCK.  */
  1292.       return finish_block_internal (NULL, &file_symbols, NULL,
  1293.                                     last_source_start_addr, end_addr,
  1294.                                     0, expandable);
  1295.     }
  1296. }

  1298. /* Subroutine of end_symtab_from_static_block to simplify it.
  1299.    Handle the "have blockvector" case.
  1300.    See end_symtab_from_static_block for a description of the arguments.  */

  1302. static struct compunit_symtab *
  1303. ‌end_symtab_with_blockvector (struct block *static_block,
  1304.                              int section, int expandable)
  1305. {
  1306.   struct objfile *objfile = buildsym_compunit->objfile;
  1307.   struct compunit_symtab *cu = buildsym_compunit->compunit_symtab;
  1308.   struct symtab *symtab;
  1309.   struct blockvector *blockvector;
  1310.   struct subfile *subfile;
  1311.   CORE_ADDR end_addr;

  1313.   gdb_assert (static_block != NULL);
  1314.   gdb_assert (buildsym_compunit != NULL);
  1315.   gdb_assert (buildsym_compunit->subfiles != NULL);

  1317.   end_addr = BLOCK_END (static_block);

  1319.   /* Create the GLOBAL_BLOCK and build the blockvector.  */
  1320.   finish_block_internal (NULL, &global_symbols, NULL,
  1321.                          last_source_start_addr, end_addr,
  1322.                          1, expandable);
  1323.   blockvector = make_blockvector ();

  1325.   /* Read the line table if it has to be read separately.
  1326.      This is only used by xcoffread.c.  */
  1327.   if (objfile->sf->sym_read_linetable != NULL)
  1328.     objfile->sf->sym_read_linetable (objfile);

  1330.   /* Handle the case where the debug info specifies a different path
  1331.      for the main source file.  It can cause us to lose track of its
  1332.      line number information.  */
  1333.   watch_main_source_file_lossage ();

  1335.   /* Now create the symtab objects proper, if not already done,
  1336.      one for each subfile.  */

  1338.   for (subfile = buildsym_compunit->subfiles;
  1339.        subfile != NULL;
  1340.        subfile = subfile->next)
  1341.     {
  1342.       int linetablesize = 0;

  1344.       if (subfile->line_vector)
  1345.         {
  1346.           linetablesize = sizeof (struct linetable) +
  1347.             subfile->line_vector->nitems * sizeof (struct linetable_entry);

  1349.           /* Like the pending blocks, the line table may be
  1350.              scrambled in reordered executables.  Sort it if
  1351.              OBJF_REORDERED is true.  */
  1352.           if (objfile->flags & OBJF_REORDERED)
  1353.             qsort (subfile->line_vector->item,
  1354.                    subfile->line_vector->nitems,
  1355.                    sizeof (struct linetable_entry), compare_line_numbers);
  1356.         }

  1358.       /* Allocate a symbol table if necessary.  */
  1359.       if (subfile->symtab == NULL)
  1360.         subfile->symtab = allocate_symtab (cu, subfile->name);
  1361.       symtab = subfile->symtab;

  1363.       /* Fill in its components.  */

  1365.       if (subfile->line_vector)
  1366.         {
  1367.           /* Reallocate the line table on the symbol obstack.  */
  1368.           SYMTAB_LINETABLE (symtab) = (struct linetable *)
  1369.             obstack_alloc (&objfile->objfile_obstack, linetablesize);
  1370.           memcpy (SYMTAB_LINETABLE (symtab), subfile->line_vector,
  1371.                   linetablesize);
  1372.         }
  1373.       else
  1374.         {
  1375.           SYMTAB_LINETABLE (symtab) = NULL;
  1376.         }

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

  1387.   /* Make sure the symtab of main_subfile is the first in its list.  */
  1388.   {
  1389.     struct symtab *main_symtab, *prev_symtab;

  1391.     main_symtab = buildsym_compunit->main_subfile->symtab;
  1392.     prev_symtab = NULL;
  1393.     ALL_COMPUNIT_FILETABS (cu, symtab)
  1394.       {
  1395.         if (symtab == main_symtab)
  1396.           {
  1397.             if (prev_symtab != NULL)
  1398.               {
  1399.                 prev_symtab->next = main_symtab->next;
  1400.                 main_symtab->next = COMPUNIT_FILETABS (cu);
  1401.                 COMPUNIT_FILETABS (cu) = main_symtab;
  1402.               }
  1403.             break;
  1404.           }
  1405.         prev_symtab = symtab;
  1406.       }
  1407.     gdb_assert (main_symtab == COMPUNIT_FILETABS (cu));
  1408.   }

  1410.   /* Fill out the compunit symtab.  */

  1412.   if (buildsym_compunit->comp_dir != NULL)
  1413.     {
  1414.       /* Reallocate the dirname on the symbol obstack.  */
  1415.       COMPUNIT_DIRNAME (cu)
  1416.         = obstack_copy0 (&objfile->objfile_obstack,
  1417.                          buildsym_compunit->comp_dir,
  1418.                          strlen (buildsym_compunit->comp_dir));
  1419.     }

  1421.   /* Save the debug format string (if any) in the symtab.  */
  1422.   COMPUNIT_DEBUGFORMAT (cu) = buildsym_compunit->debugformat;

  1424.   /* Similarly for the producer.  */
  1425.   COMPUNIT_PRODUCER (cu) = buildsym_compunit->producer;

  1427.   COMPUNIT_BLOCKVECTOR (cu) = blockvector;
  1428.   {
  1429.     struct block *b = BLOCKVECTOR_BLOCK (blockvector, GLOBAL_BLOCK);

  1431.     set_block_compunit_symtab (b, cu);
  1432.   }

  1434.   COMPUNIT_BLOCK_LINE_SECTION (cu) = section;

  1436.   COMPUNIT_MACRO_TABLE (cu) = pending_macros;

  1438.   /* Default any symbols without a specified symtab to the primary symtab.  */
  1439.   {
  1440.     int block_i;

  1442.     /* The main source file's symtab.  */
  1443.     symtab = COMPUNIT_FILETABS (cu);

  1445.     for (block_i = 0; block_i < BLOCKVECTOR_NBLOCKS (blockvector); block_i++)
  1446.       {
  1447.         struct block *block = BLOCKVECTOR_BLOCK (blockvector, block_i);
  1448.         struct symbol *sym;
  1449.         struct dict_iterator iter;

  1451.         /* Inlined functions may have symbols not in the global or
  1452.            static symbol lists.  */
  1453.         if (BLOCK_FUNCTION (block) != NULL)
  1454.           if (symbol_symtab (BLOCK_FUNCTION (block)) == NULL)
  1455.             symbol_set_symtab (BLOCK_FUNCTION (block), symtab);

  1457.         /* Note that we only want to fix up symbols from the local
  1458.            blocks, not blocks coming from included symtabs.  That is why
  1459.            we use ALL_DICT_SYMBOLS here and not ALL_BLOCK_SYMBOLS.  */
  1460.         ALL_DICT_SYMBOLS (BLOCK_DICT (block), iter, sym)
  1461.           if (symbol_symtab (sym) == NULL)
  1462.             symbol_set_symtab (sym, symtab);
  1463.       }
  1464.   }

  1466.   add_compunit_symtab_to_objfile (cu);

  1468.   return cu;
  1469. }

  1471. /* Implementation of the second part of end_symtab.  Pass STATIC_BLOCK
  1472.    as value returned by end_symtab_get_static_block.

  1474.    SECTION is the same as for end_symtab: the section number
  1475.    (in objfile->section_offsets) of the blockvector and linetable.

  1477.    If EXPANDABLE is non-zero the GLOBAL_BLOCK dictionary is made
  1478.    expandable.  */

  1480. struct compunit_symtab *
  1481. ‌end_symtab_from_static_block (struct block *static_block,
  1482.                               int section, int expandable)
  1483. {
  1484.   struct compunit_symtab *cu;

  1486.   if (static_block == NULL)
  1487.     {
  1488.       /* Handle the "no blockvector" case.
  1489.          When this happens there is nothing to record, so there's nothing
  1490.          to do: memory will be freed up later.

  1492.          Note: We won't be adding a compunit to the objfile's list of
  1493.          compunits, so there's nothing to unchain.  However, since each symtab
  1494.          is added to the objfile's obstack we can't free that space.
  1495.          We could do better, but this is believed to be a sufficiently rare
  1496.          event.  */
  1497.       cu = NULL;
  1498.     }
  1499.   else
  1500.     cu = end_symtab_with_blockvector (static_block, section, expandable);

  1502.   reset_symtab_globals ();

  1504.   return cu;
  1505. }

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

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

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

  1524.    If you need to modify STATIC_BLOCK before it is finalized you should
  1525.    call end_symtab_get_static_block and end_symtab_from_static_block
  1526.    yourself.  */

  1528. struct compunit_symtab *
  1529. ‌end_symtab (CORE_ADDR end_addr, int section)
  1530. {
  1531.   struct block *static_block;

  1533.   static_block = end_symtab_get_static_block (end_addr, 0, 0);
  1534.   return end_symtab_from_static_block (static_block, section, 0);
  1535. }

  1537. /* Same as end_symtab except create a symtab that can be later added to.  */

  1539. struct compunit_symtab *
  1540. ‌end_expandable_symtab (CORE_ADDR end_addr, int section)
  1541. {
  1542.   struct block *static_block;

  1544.   static_block = end_symtab_get_static_block (end_addr, 1, 0);
  1545.   return end_symtab_from_static_block (static_block, section, 1);
  1546. }

  1548. /* Subroutine of augment_type_symtab to simplify it.
  1549.    Attach the main source file's symtab to all symbols in PENDING_LIST that
  1550.    don't have one.  */

  1552. static void
  1553. ‌set_missing_symtab (struct pending *pending_list,
  1554.                     struct compunit_symtab *cu)
  1555. {
  1556.   struct pending *pending;
  1557.   int i;

  1559.   for (pending = pending_list; pending != NULL; pending = pending->next)
  1560.     {
  1561.       for (i = 0; i < pending->nsyms; ++i)
  1562.         {
  1563.           if (symbol_symtab (pending->symbol[i]) == NULL)
  1564.             symbol_set_symtab (pending->symbol[i], COMPUNIT_FILETABS (cu));
  1565.         }
  1566.     }
  1567. }

  1569. /* Same as end_symtab, but for the case where we're adding more symbols
  1570.    to an existing symtab that is known to contain only type information.
  1571.    This is the case for DWARF4 Type Units.  */

  1573. void
  1574. ‌augment_type_symtab (void)
  1575. {
  1576.   struct compunit_symtab *cust = buildsym_compunit->compunit_symtab;
  1577.   const struct blockvector *blockvector = COMPUNIT_BLOCKVECTOR (cust);

  1579.   if (context_stack_depth > 0)
  1580.     {
  1581.       complaint (&symfile_complaints,
  1582.                  _("Context stack not empty in augment_type_symtab"));
  1583.       context_stack_depth = 0;
  1584.     }
  1585.   if (pending_blocks != NULL)
  1586.     complaint (&symfile_complaints, _("Blocks in a type symtab"));
  1587.   if (pending_macros != NULL)
  1588.     complaint (&symfile_complaints, _("Macro in a type symtab"));
  1589.   if (have_line_numbers)
  1590.     complaint (&symfile_complaints,
  1591.                _("Line numbers recorded in a type symtab"));

  1593.   if (file_symbols != NULL)
  1594.     {
  1595.       struct block *block = BLOCKVECTOR_BLOCK (blockvector, STATIC_BLOCK);

  1597.       /* First mark any symbols without a specified symtab as belonging
  1598.          to the primary symtab.  */
  1599.       set_missing_symtab (file_symbols, cust);

  1601.       dict_add_pending (BLOCK_DICT (block), file_symbols);
  1602.     }

  1604.   if (global_symbols != NULL)
  1605.     {
  1606.       struct block *block = BLOCKVECTOR_BLOCK (blockvector, GLOBAL_BLOCK);

  1608.       /* First mark any symbols without a specified symtab as belonging
  1609.          to the primary symtab.  */
  1610.       set_missing_symtab (global_symbols, cust);

  1612.       dict_add_pending (BLOCK_DICT (block), global_symbols);
  1613.     }

  1615.   reset_symtab_globals ();
  1616. }

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

  1622. struct context_stack *
  1623. ‌push_context (int desc, CORE_ADDR valu)
  1624. {
  1625.   struct context_stack *new;

  1627.   if (context_stack_depth == context_stack_size)
  1628.     {
  1629.       context_stack_size *= 2;
  1630.       context_stack = (struct context_stack *)
  1631.         xrealloc ((char *) context_stack,
  1632.                   (context_stack_size * sizeof (struct context_stack)));
  1633.     }

  1635.   new = &context_stack[context_stack_depth++];
  1636.   new->depth = desc;
  1637.   new->locals = local_symbols;
  1638.   new->old_blocks = pending_blocks;
  1639.   new->start_addr = valu;
  1640.   new->using_directives = using_directives;
  1641.   new->name = NULL;

  1643.   local_symbols = NULL;
  1644.   using_directives = NULL;

  1646.   return new;
  1647. }

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

  1652. struct context_stack *
  1653. ‌pop_context (void)
  1654. {
  1655.   gdb_assert (context_stack_depth > 0);
  1656.   return (&context_stack[--context_stack_depth]);
  1657. }



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

  1663. int
  1664. ‌hashname (const char *name)
  1665. {
  1666.     return (hash(name,strlen(name)) % HASHSIZE);
  1667. }


  1670. void
  1671. ‌record_debugformat (const char *format)
  1672. {
  1673.   buildsym_compunit->debugformat = format;
  1674. }

  1676. void
  1677. ‌record_producer (const char *producer)
  1678. {
  1679.   buildsym_compunit->producer = producer;
  1680. }

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

  1688.    Void return.  */

  1690. void
  1691. ‌merge_symbol_lists (struct pending **srclist, struct pending **targetlist)
  1692. {
  1693.   int i;

  1695.   if (!srclist || !*srclist)
  1696.     return;

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

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

  1705.   /* "Free" the current link.  */
  1706.   (*srclist)->next = free_pendings;
  1707.   free_pendings = (*srclist);
  1708. }


  1711. /* Name of source file whose symbol data we are now processing.  This
  1712.    comes from a symbol of type N_SO for stabs.  For Dwarf it comes
  1713.    from the DW_AT_name attribute of a DW_TAG_compile_unit DIE.  */

  1715. ‌static char *last_source_file;

  1717. /* See buildsym.h.  */

  1719. void
  1720. ‌set_last_source_file (const char *name)
  1721. {
  1722.   xfree (last_source_file);
  1723.   last_source_file = name == NULL ? NULL : xstrdup (name);
  1724. }

  1726. /* See buildsym.h.  */

  1728. const char *
  1729. ‌get_last_source_file (void)
  1730. {
  1731.   return last_source_file;
  1732. }



  1736. /* Initialize anything that needs initializing when starting to read a
  1737.    fresh piece of a symbol file, e.g. reading in the stuff
  1738.    corresponding to a psymtab.  */

  1740. void
  1741. ‌buildsym_init (void)
  1742. {
  1743.   using_directives = NULL;
  1744.   subfile_stack = NULL;

  1746.   pending_addrmap_interesting = 0;

  1748.   /* Context stack is initially empty.  Allocate first one with room
  1749.      for a few levels; reuse it forever afterward.  */
  1750.   if (context_stack == NULL)
  1751.     {
  1752.       context_stack_size = INITIAL_CONTEXT_STACK_SIZE;
  1753.       context_stack = (struct context_stack *)
  1754.         xmalloc (context_stack_size * sizeof (struct context_stack));
  1755.     }

  1757.   /* Ensure the really_free_pendings cleanup was called after
  1758.      the last time.  */
  1759.   gdb_assert (free_pendings == NULL);
  1760.   gdb_assert (pending_blocks == NULL);
  1761.   gdb_assert (file_symbols == NULL);
  1762.   gdb_assert (global_symbols == NULL);
  1763.   gdb_assert (pending_macros == NULL);
  1764.   gdb_assert (pending_addrmap == NULL);
  1765.   gdb_assert (buildsym_compunit == NULL);
  1766. }

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

  1772. void
  1773. ‌buildsym_new_init (void)
  1774. {
  1775.   buildsym_init ();
  1776. }