1 /* Support routines for building symbol tables in GDB's internal format.
2 Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
3 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2007, 2008, 2009,
4 2010, 2011 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
21 /* This module provides subroutines used for creating and adding to
22 the symbol table. These routines are called from various symbol-
23 file-reading routines.
25 Routines to support specific debugging information formats (stabs,
26 DWARF, etc) belong somewhere else. */
30 #include "gdb_obstack.h"
35 #include "gdb_assert.h"
36 #include "complaints.h"
37 #include "gdb_string.h"
38 #include "expression.h" /* For "enum exp_opcode" used by... */
40 #include "filenames.h" /* For DOSish file names. */
42 #include "demangle.h" /* Needed by SYMBOL_INIT_DEMANGLED_NAME. */
44 #include "cp-support.h"
45 #include "dictionary.h"
48 /* Ask buildsym.h to define the vars it normally declares `extern'. */
51 #include "buildsym.h" /* Our own declarations. */
54 /* For cleanup_undefined_types and finish_global_stabs (somewhat
55 questionable--see comment where we call them). */
57 #include "stabsread.h"
59 /* List of subfiles. */
61 static struct subfile
*subfiles
;
63 /* List of free `struct pending' structures for reuse. */
65 static struct pending
*free_pendings
;
67 /* Non-zero if symtab has line number info. This prevents an
68 otherwise empty symtab from being tossed. */
70 static int have_line_numbers
;
72 /* The mutable address map for the compilation unit whose symbols
73 we're currently reading. The symtabs' shared blockvector will
74 point to a fixed copy of this. */
75 static struct addrmap
*pending_addrmap
;
77 /* The obstack on which we allocate pending_addrmap.
78 If pending_addrmap is NULL, this is uninitialized; otherwise, it is
79 initialized (and holds pending_addrmap). */
80 static struct obstack pending_addrmap_obstack
;
82 /* Non-zero if we recorded any ranges in the addrmap that are
83 different from those in the blockvector already. We set this to
84 zero when we start processing a symfile, and if it's still zero at
85 the end, then we just toss the addrmap. */
86 static int pending_addrmap_interesting
;
89 static int compare_line_numbers (const void *ln1p
, const void *ln2p
);
92 /* Initial sizes of data structures. These are realloc'd larger if
93 needed, and realloc'd down to the size actually used, when
96 #define INITIAL_CONTEXT_STACK_SIZE 10
97 #define INITIAL_LINE_VECTOR_LENGTH 1000
100 /* Maintain the lists of symbols and blocks. */
102 /* Add a pending list to free_pendings. */
104 add_free_pendings (struct pending
*list
)
106 struct pending
*link
= list
;
110 while (link
->next
) link
= link
->next
;
111 link
->next
= free_pendings
;
112 free_pendings
= list
;
116 /* Add a symbol to one of the lists of symbols. */
119 add_symbol_to_list (struct symbol
*symbol
, struct pending
**listhead
)
121 struct pending
*link
;
123 /* If this is an alias for another symbol, don't add it. */
124 if (symbol
->ginfo
.name
&& symbol
->ginfo
.name
[0] == '#')
127 /* We keep PENDINGSIZE symbols in each link of the list. If we
128 don't have a link with room in it, add a new link. */
129 if (*listhead
== NULL
|| (*listhead
)->nsyms
== PENDINGSIZE
)
133 link
= free_pendings
;
134 free_pendings
= link
->next
;
138 link
= (struct pending
*) xmalloc (sizeof (struct pending
));
141 link
->next
= *listhead
;
146 (*listhead
)->symbol
[(*listhead
)->nsyms
++] = symbol
;
149 /* Find a symbol named NAME on a LIST. NAME need not be
150 '\0'-terminated; LENGTH is the length of the name. */
153 find_symbol_in_list (struct pending
*list
, char *name
, int length
)
160 for (j
= list
->nsyms
; --j
>= 0;)
162 pp
= SYMBOL_LINKAGE_NAME (list
->symbol
[j
]);
163 if (*pp
== *name
&& strncmp (pp
, name
, length
) == 0
164 && pp
[length
] == '\0')
166 return (list
->symbol
[j
]);
174 /* At end of reading syms, or in case of quit, really free as many
175 `struct pending's as we can easily find. */
178 really_free_pendings (void *dummy
)
180 struct pending
*next
, *next1
;
182 for (next
= free_pendings
; next
; next
= next1
)
185 xfree ((void *) next
);
187 free_pendings
= NULL
;
189 free_pending_blocks ();
191 for (next
= file_symbols
; next
!= NULL
; next
= next1
)
194 xfree ((void *) next
);
198 for (next
= global_symbols
; next
!= NULL
; next
= next1
)
201 xfree ((void *) next
);
203 global_symbols
= NULL
;
206 free_macro_table (pending_macros
);
210 obstack_free (&pending_addrmap_obstack
, NULL
);
211 pending_addrmap
= NULL
;
215 /* This function is called to discard any pending blocks. */
218 free_pending_blocks (void)
220 /* The links are made in the objfile_obstack, so we only need to
221 reset PENDING_BLOCKS. */
222 pending_blocks
= NULL
;
225 /* Take one of the lists of symbols and make a block from it. Keep
226 the order the symbols have in the list (reversed from the input
227 file). Put the block on the list of pending blocks. */
230 finish_block (struct symbol
*symbol
, struct pending
**listhead
,
231 struct pending_block
*old_blocks
,
232 CORE_ADDR start
, CORE_ADDR end
,
233 struct objfile
*objfile
)
235 struct gdbarch
*gdbarch
= get_objfile_arch (objfile
);
236 struct pending
*next
, *next1
;
238 struct pending_block
*pblock
;
239 struct pending_block
*opblock
;
241 block
= allocate_block (&objfile
->objfile_obstack
);
245 BLOCK_DICT (block
) = dict_create_linear (&objfile
->objfile_obstack
,
250 BLOCK_DICT (block
) = dict_create_hashed (&objfile
->objfile_obstack
,
254 BLOCK_START (block
) = start
;
255 BLOCK_END (block
) = end
;
256 /* Superblock filled in when containing block is made. */
257 BLOCK_SUPERBLOCK (block
) = NULL
;
258 BLOCK_NAMESPACE (block
) = NULL
;
260 /* Put the block in as the value of the symbol that names it. */
264 struct type
*ftype
= SYMBOL_TYPE (symbol
);
265 struct dict_iterator iter
;
266 SYMBOL_BLOCK_VALUE (symbol
) = block
;
267 BLOCK_FUNCTION (block
) = symbol
;
269 if (TYPE_NFIELDS (ftype
) <= 0)
271 /* No parameter type information is recorded with the
272 function's type. Set that from the type of the
273 parameter symbols. */
274 int nparams
= 0, iparams
;
276 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
278 if (SYMBOL_IS_ARGUMENT (sym
))
283 TYPE_NFIELDS (ftype
) = nparams
;
284 TYPE_FIELDS (ftype
) = (struct field
*)
285 TYPE_ALLOC (ftype
, nparams
* sizeof (struct field
));
288 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
290 if (iparams
== nparams
)
293 if (SYMBOL_IS_ARGUMENT (sym
))
295 TYPE_FIELD_TYPE (ftype
, iparams
) = SYMBOL_TYPE (sym
);
296 TYPE_FIELD_ARTIFICIAL (ftype
, iparams
) = 0;
305 BLOCK_FUNCTION (block
) = NULL
;
308 /* Now "free" the links of the list, and empty the list. */
310 for (next
= *listhead
; next
; next
= next1
)
313 next
->next
= free_pendings
;
314 free_pendings
= next
;
318 /* Check to be sure that the blocks have an end address that is
319 greater than starting address. */
321 if (BLOCK_END (block
) < BLOCK_START (block
))
325 complaint (&symfile_complaints
,
326 _("block end address less than block "
327 "start address in %s (patched it)"),
328 SYMBOL_PRINT_NAME (symbol
));
332 complaint (&symfile_complaints
,
333 _("block end address %s less than block "
334 "start address %s (patched it)"),
335 paddress (gdbarch
, BLOCK_END (block
)),
336 paddress (gdbarch
, BLOCK_START (block
)));
338 /* Better than nothing. */
339 BLOCK_END (block
) = BLOCK_START (block
);
342 /* Install this block as the superblock of all blocks made since the
343 start of this scope that don't have superblocks yet. */
346 for (pblock
= pending_blocks
;
347 pblock
&& pblock
!= old_blocks
;
348 pblock
= pblock
->next
)
350 if (BLOCK_SUPERBLOCK (pblock
->block
) == NULL
)
352 /* Check to be sure the blocks are nested as we receive
353 them. If the compiler/assembler/linker work, this just
354 burns a small amount of time.
356 Skip blocks which correspond to a function; they're not
357 physically nested inside this other blocks, only
359 if (BLOCK_FUNCTION (pblock
->block
) == NULL
360 && (BLOCK_START (pblock
->block
) < BLOCK_START (block
)
361 || BLOCK_END (pblock
->block
) > BLOCK_END (block
)))
365 complaint (&symfile_complaints
,
366 _("inner block not inside outer block in %s"),
367 SYMBOL_PRINT_NAME (symbol
));
371 complaint (&symfile_complaints
,
372 _("inner block (%s-%s) not "
373 "inside outer block (%s-%s)"),
374 paddress (gdbarch
, BLOCK_START (pblock
->block
)),
375 paddress (gdbarch
, BLOCK_END (pblock
->block
)),
376 paddress (gdbarch
, BLOCK_START (block
)),
377 paddress (gdbarch
, BLOCK_END (block
)));
379 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
))
380 BLOCK_START (pblock
->block
) = BLOCK_START (block
);
381 if (BLOCK_END (pblock
->block
) > BLOCK_END (block
))
382 BLOCK_END (pblock
->block
) = BLOCK_END (block
);
384 BLOCK_SUPERBLOCK (pblock
->block
) = block
;
389 block_set_using (block
, using_directives
, &objfile
->objfile_obstack
);
390 using_directives
= NULL
;
392 record_pending_block (objfile
, block
, opblock
);
398 /* Record BLOCK on the list of all blocks in the file. Put it after
399 OPBLOCK, or at the beginning if opblock is NULL. This puts the
400 block in the list after all its subblocks.
402 Allocate the pending block struct in the objfile_obstack to save
403 time. This wastes a little space. FIXME: Is it worth it? */
406 record_pending_block (struct objfile
*objfile
, struct block
*block
,
407 struct pending_block
*opblock
)
409 struct pending_block
*pblock
;
411 pblock
= (struct pending_block
*)
412 obstack_alloc (&objfile
->objfile_obstack
, sizeof (struct pending_block
));
413 pblock
->block
= block
;
416 pblock
->next
= opblock
->next
;
417 opblock
->next
= pblock
;
421 pblock
->next
= pending_blocks
;
422 pending_blocks
= pblock
;
427 /* Record that the range of addresses from START to END_INCLUSIVE
428 (inclusive, like it says) belongs to BLOCK. BLOCK's start and end
429 addresses must be set already. You must apply this function to all
430 BLOCK's children before applying it to BLOCK.
432 If a call to this function complicates the picture beyond that
433 already provided by BLOCK_START and BLOCK_END, then we create an
434 address map for the block. */
436 record_block_range (struct block
*block
,
437 CORE_ADDR start
, CORE_ADDR end_inclusive
)
439 /* If this is any different from the range recorded in the block's
440 own BLOCK_START and BLOCK_END, then note that the address map has
441 become interesting. Note that even if this block doesn't have
442 any "interesting" ranges, some later block might, so we still
443 need to record this block in the addrmap. */
444 if (start
!= BLOCK_START (block
)
445 || end_inclusive
+ 1 != BLOCK_END (block
))
446 pending_addrmap_interesting
= 1;
448 if (! pending_addrmap
)
450 obstack_init (&pending_addrmap_obstack
);
451 pending_addrmap
= addrmap_create_mutable (&pending_addrmap_obstack
);
454 addrmap_set_empty (pending_addrmap
, start
, end_inclusive
, block
);
458 static struct blockvector
*
459 make_blockvector (struct objfile
*objfile
)
461 struct pending_block
*next
;
462 struct blockvector
*blockvector
;
465 /* Count the length of the list of blocks. */
467 for (next
= pending_blocks
, i
= 0; next
; next
= next
->next
, i
++)
471 blockvector
= (struct blockvector
*)
472 obstack_alloc (&objfile
->objfile_obstack
,
473 (sizeof (struct blockvector
)
474 + (i
- 1) * sizeof (struct block
*)));
476 /* Copy the blocks into the blockvector. This is done in reverse
477 order, which happens to put the blocks into the proper order
478 (ascending starting address). finish_block has hair to insert
479 each block into the list after its subblocks in order to make
480 sure this is true. */
482 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
483 for (next
= pending_blocks
; next
; next
= next
->next
)
485 BLOCKVECTOR_BLOCK (blockvector
, --i
) = next
->block
;
488 free_pending_blocks ();
490 /* If we needed an address map for this symtab, record it in the
492 if (pending_addrmap
&& pending_addrmap_interesting
)
493 BLOCKVECTOR_MAP (blockvector
)
494 = addrmap_create_fixed (pending_addrmap
, &objfile
->objfile_obstack
);
496 BLOCKVECTOR_MAP (blockvector
) = 0;
498 /* Some compilers output blocks in the wrong order, but we depend on
499 their being in the right order so we can binary search. Check the
500 order and moan about it. */
501 if (BLOCKVECTOR_NBLOCKS (blockvector
) > 1)
503 for (i
= 1; i
< BLOCKVECTOR_NBLOCKS (blockvector
); i
++)
505 if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
- 1))
506 > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
)))
509 = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
));
511 complaint (&symfile_complaints
, _("block at %s out of order"),
512 hex_string ((LONGEST
) start
));
517 return (blockvector
);
520 /* Start recording information about source code that came from an
521 included (or otherwise merged-in) source file with a different
522 name. NAME is the name of the file (cannot be NULL), DIRNAME is
523 the directory in which the file was compiled (or NULL if not
527 start_subfile (const char *name
, const char *dirname
)
529 struct subfile
*subfile
;
531 /* See if this subfile is already known as a subfile of the current
534 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
538 /* If NAME is an absolute path, and this subfile is not, then
539 attempt to create an absolute path to compare. */
540 if (IS_ABSOLUTE_PATH (name
)
541 && !IS_ABSOLUTE_PATH (subfile
->name
)
542 && subfile
->dirname
!= NULL
)
543 subfile_name
= concat (subfile
->dirname
, SLASH_STRING
,
544 subfile
->name
, (char *) NULL
);
546 subfile_name
= subfile
->name
;
548 if (FILENAME_CMP (subfile_name
, name
) == 0)
550 current_subfile
= subfile
;
551 if (subfile_name
!= subfile
->name
)
552 xfree (subfile_name
);
555 if (subfile_name
!= subfile
->name
)
556 xfree (subfile_name
);
559 /* This subfile is not known. Add an entry for it. Make an entry
560 for this subfile in the list of all subfiles of the current main
563 subfile
= (struct subfile
*) xmalloc (sizeof (struct subfile
));
564 memset ((char *) subfile
, 0, sizeof (struct subfile
));
565 subfile
->next
= subfiles
;
567 current_subfile
= subfile
;
569 /* Save its name and compilation directory name. */
570 subfile
->name
= (name
== NULL
) ? NULL
: xstrdup (name
);
571 subfile
->dirname
= (dirname
== NULL
) ? NULL
: xstrdup (dirname
);
573 /* Initialize line-number recording for this subfile. */
574 subfile
->line_vector
= NULL
;
576 /* Default the source language to whatever can be deduced from the
577 filename. If nothing can be deduced (such as for a C/C++ include
578 file with a ".h" extension), then inherit whatever language the
579 previous subfile had. This kludgery is necessary because there
580 is no standard way in some object formats to record the source
581 language. Also, when symtabs are allocated we try to deduce a
582 language then as well, but it is too late for us to use that
583 information while reading symbols, since symtabs aren't allocated
584 until after all the symbols have been processed for a given
587 subfile
->language
= deduce_language_from_filename (subfile
->name
);
588 if (subfile
->language
== language_unknown
589 && subfile
->next
!= NULL
)
591 subfile
->language
= subfile
->next
->language
;
594 /* Initialize the debug format string to NULL. We may supply it
595 later via a call to record_debugformat. */
596 subfile
->debugformat
= NULL
;
598 /* Similarly for the producer. */
599 subfile
->producer
= NULL
;
601 /* If the filename of this subfile ends in .C, then change the
602 language of any pending subfiles from C to C++. We also accept
603 any other C++ suffixes accepted by deduce_language_from_filename. */
604 /* Likewise for f2c. */
609 enum language sublang
= deduce_language_from_filename (subfile
->name
);
611 if (sublang
== language_cplus
|| sublang
== language_fortran
)
612 for (s
= subfiles
; s
!= NULL
; s
= s
->next
)
613 if (s
->language
== language_c
)
614 s
->language
= sublang
;
617 /* And patch up this file if necessary. */
618 if (subfile
->language
== language_c
619 && subfile
->next
!= NULL
620 && (subfile
->next
->language
== language_cplus
621 || subfile
->next
->language
== language_fortran
))
623 subfile
->language
= subfile
->next
->language
;
627 /* For stabs readers, the first N_SO symbol is assumed to be the
628 source file name, and the subfile struct is initialized using that
629 assumption. If another N_SO symbol is later seen, immediately
630 following the first one, then the first one is assumed to be the
631 directory name and the second one is really the source file name.
633 So we have to patch up the subfile struct by moving the old name
634 value to dirname and remembering the new name. Some sanity
635 checking is performed to ensure that the state of the subfile
636 struct is reasonable and that the old name we are assuming to be a
637 directory name actually is (by checking for a trailing '/'). */
640 patch_subfile_names (struct subfile
*subfile
, char *name
)
642 if (subfile
!= NULL
&& subfile
->dirname
== NULL
&& subfile
->name
!= NULL
643 && IS_DIR_SEPARATOR (subfile
->name
[strlen (subfile
->name
) - 1]))
645 subfile
->dirname
= subfile
->name
;
646 subfile
->name
= xstrdup (name
);
647 last_source_file
= name
;
649 /* Default the source language to whatever can be deduced from
650 the filename. If nothing can be deduced (such as for a C/C++
651 include file with a ".h" extension), then inherit whatever
652 language the previous subfile had. This kludgery is
653 necessary because there is no standard way in some object
654 formats to record the source language. Also, when symtabs
655 are allocated we try to deduce a language then as well, but
656 it is too late for us to use that information while reading
657 symbols, since symtabs aren't allocated until after all the
658 symbols have been processed for a given source file. */
660 subfile
->language
= deduce_language_from_filename (subfile
->name
);
661 if (subfile
->language
== language_unknown
662 && subfile
->next
!= NULL
)
664 subfile
->language
= subfile
->next
->language
;
669 /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
670 switching source files (different subfiles, as we call them) within
671 one object file, but using a stack rather than in an arbitrary
677 struct subfile_stack
*tem
678 = (struct subfile_stack
*) xmalloc (sizeof (struct subfile_stack
));
680 tem
->next
= subfile_stack
;
682 if (current_subfile
== NULL
|| current_subfile
->name
== NULL
)
684 internal_error (__FILE__
, __LINE__
,
685 _("failed internal consistency check"));
687 tem
->name
= current_subfile
->name
;
694 struct subfile_stack
*link
= subfile_stack
;
698 internal_error (__FILE__
, __LINE__
,
699 _("failed internal consistency check"));
702 subfile_stack
= link
->next
;
703 xfree ((void *) link
);
707 /* Add a linetable entry for line number LINE and address PC to the
708 line vector for SUBFILE. */
711 record_line (struct subfile
*subfile
, int line
, CORE_ADDR pc
)
713 struct linetable_entry
*e
;
715 /* Ignore the dummy line number in libg.o */
721 /* Make sure line vector exists and is big enough. */
722 if (!subfile
->line_vector
)
724 subfile
->line_vector_length
= INITIAL_LINE_VECTOR_LENGTH
;
725 subfile
->line_vector
= (struct linetable
*)
726 xmalloc (sizeof (struct linetable
)
727 + subfile
->line_vector_length
* sizeof (struct linetable_entry
));
728 subfile
->line_vector
->nitems
= 0;
729 have_line_numbers
= 1;
732 if (subfile
->line_vector
->nitems
+ 1 >= subfile
->line_vector_length
)
734 subfile
->line_vector_length
*= 2;
735 subfile
->line_vector
= (struct linetable
*)
736 xrealloc ((char *) subfile
->line_vector
,
737 (sizeof (struct linetable
)
738 + (subfile
->line_vector_length
739 * sizeof (struct linetable_entry
))));
742 /* Normally, we treat lines as unsorted. But the end of sequence
743 marker is special. We sort line markers at the same PC by line
744 number, so end of sequence markers (which have line == 0) appear
745 first. This is right if the marker ends the previous function,
746 and there is no padding before the next function. But it is
747 wrong if the previous line was empty and we are now marking a
748 switch to a different subfile. We must leave the end of sequence
749 marker at the end of this group of lines, not sort the empty line
750 to after the marker. The easiest way to accomplish this is to
751 delete any empty lines from our table, if they are followed by
752 end of sequence markers. All we lose is the ability to set
753 breakpoints at some lines which contain no instructions
755 if (line
== 0 && subfile
->line_vector
->nitems
> 0)
757 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
- 1;
758 while (subfile
->line_vector
->nitems
> 0 && e
->pc
== pc
)
761 subfile
->line_vector
->nitems
--;
765 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
++;
770 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
773 compare_line_numbers (const void *ln1p
, const void *ln2p
)
775 struct linetable_entry
*ln1
= (struct linetable_entry
*) ln1p
;
776 struct linetable_entry
*ln2
= (struct linetable_entry
*) ln2p
;
778 /* Note: this code does not assume that CORE_ADDRs can fit in ints.
779 Please keep it that way. */
780 if (ln1
->pc
< ln2
->pc
)
783 if (ln1
->pc
> ln2
->pc
)
786 /* If pc equal, sort by line. I'm not sure whether this is optimum
787 behavior (see comment at struct linetable in symtab.h). */
788 return ln1
->line
- ln2
->line
;
791 /* Start a new symtab for a new source file. Called, for example,
792 when a stabs symbol of type N_SO is seen, or when a DWARF
793 TAG_compile_unit DIE is seen. It indicates the start of data for
794 one original source file.
796 NAME is the name of the file (cannot be NULL). DIRNAME is the directory in
797 which the file was compiled (or NULL if not known). START_ADDR is the
798 lowest address of objects in the file (or 0 if not known). */
801 start_symtab (char *name
, char *dirname
, CORE_ADDR start_addr
)
803 last_source_file
= name
;
804 last_source_start_addr
= start_addr
;
806 global_symbols
= NULL
;
808 have_line_numbers
= 0;
810 /* Context stack is initially empty. Allocate first one with room
811 for 10 levels; reuse it forever afterward. */
812 if (context_stack
== NULL
)
814 context_stack_size
= INITIAL_CONTEXT_STACK_SIZE
;
815 context_stack
= (struct context_stack
*)
816 xmalloc (context_stack_size
* sizeof (struct context_stack
));
818 context_stack_depth
= 0;
820 /* We shouldn't have any address map at this point. */
821 gdb_assert (! pending_addrmap
);
823 /* Initialize the list of sub source files with one entry for this
824 file (the top-level source file). */
827 current_subfile
= NULL
;
828 start_subfile (name
, dirname
);
831 /* Subroutine of end_symtab to simplify it. Look for a subfile that
832 matches the main source file's basename. If there is only one, and
833 if the main source file doesn't have any symbol or line number
834 information, then copy this file's symtab and line_vector to the
835 main source file's subfile and discard the other subfile. This can
836 happen because of a compiler bug or from the user playing games
837 with #line or from things like a distributed build system that
838 manipulates the debug info. */
841 watch_main_source_file_lossage (void)
843 struct subfile
*mainsub
, *subfile
;
845 /* Find the main source file.
846 This loop could be eliminated if start_symtab saved it for us. */
848 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
850 /* The main subfile is guaranteed to be the last one. */
851 if (subfile
->next
== NULL
)
855 /* If the main source file doesn't have any line number or symbol
856 info, look for an alias in another subfile.
858 We have to watch for mainsub == NULL here. It's a quirk of
859 end_symtab, it can return NULL so there may not be a main
863 && mainsub
->line_vector
== NULL
864 && mainsub
->symtab
== NULL
)
866 const char *mainbase
= lbasename (mainsub
->name
);
868 struct subfile
*prevsub
;
869 struct subfile
*mainsub_alias
= NULL
;
870 struct subfile
*prev_mainsub_alias
= NULL
;
873 for (subfile
= subfiles
;
874 /* Stop before we get to the last one. */
876 subfile
= subfile
->next
)
878 if (filename_cmp (lbasename (subfile
->name
), mainbase
) == 0)
881 mainsub_alias
= subfile
;
882 prev_mainsub_alias
= prevsub
;
889 gdb_assert (mainsub_alias
!= NULL
&& mainsub_alias
!= mainsub
);
891 /* Found a match for the main source file.
892 Copy its line_vector and symtab to the main subfile
893 and then discard it. */
895 mainsub
->line_vector
= mainsub_alias
->line_vector
;
896 mainsub
->line_vector_length
= mainsub_alias
->line_vector_length
;
897 mainsub
->symtab
= mainsub_alias
->symtab
;
899 if (prev_mainsub_alias
== NULL
)
900 subfiles
= mainsub_alias
->next
;
902 prev_mainsub_alias
->next
= mainsub_alias
->next
;
903 xfree (mainsub_alias
);
908 /* Helper function for qsort. Parametes are `struct block *' pointers,
909 function sorts them in descending order by their BLOCK_START. */
912 block_compar (const void *ap
, const void *bp
)
914 const struct block
*a
= *(const struct block
**) ap
;
915 const struct block
*b
= *(const struct block
**) bp
;
917 return ((BLOCK_START (b
) > BLOCK_START (a
))
918 - (BLOCK_START (b
) < BLOCK_START (a
)));
921 /* Finish the symbol definitions for one main source file, close off
922 all the lexical contexts for that file (creating struct block's for
923 them), then make the struct symtab for that file and put it in the
926 END_ADDR is the address of the end of the file's text. SECTION is
927 the section number (in objfile->section_offsets) of the blockvector
930 Note that it is possible for end_symtab() to return NULL. In
931 particular, for the DWARF case at least, it will return NULL when
932 it finds a compilation unit that has exactly one DIE, a
933 TAG_compile_unit DIE. This can happen when we link in an object
934 file that was compiled from an empty source file. Returning NULL
935 is probably not the correct thing to do, because then gdb will
936 never know about this empty file (FIXME). */
939 end_symtab (CORE_ADDR end_addr
, struct objfile
*objfile
, int section
)
941 struct symtab
*symtab
= NULL
;
942 struct blockvector
*blockvector
;
943 struct subfile
*subfile
;
944 struct context_stack
*cstk
;
945 struct subfile
*nextsub
;
947 /* Finish the lexical context of the last function in the file; pop
948 the context stack. */
950 if (context_stack_depth
> 0)
952 cstk
= pop_context ();
953 /* Make a block for the local symbols within. */
954 finish_block (cstk
->name
, &local_symbols
, cstk
->old_blocks
,
955 cstk
->start_addr
, end_addr
, objfile
);
957 if (context_stack_depth
> 0)
959 /* This is said to happen with SCO. The old coffread.c
960 code simply emptied the context stack, so we do the
961 same. FIXME: Find out why it is happening. This is not
962 believed to happen in most cases (even for coffread.c);
963 it used to be an abort(). */
964 complaint (&symfile_complaints
,
965 _("Context stack not empty in end_symtab"));
966 context_stack_depth
= 0;
970 /* Reordered executables may have out of order pending blocks; if
971 OBJF_REORDERED is true, then sort the pending blocks. */
972 if ((objfile
->flags
& OBJF_REORDERED
) && pending_blocks
)
975 struct pending_block
*pb
;
976 struct block
**barray
, **bp
;
977 struct cleanup
*back_to
;
979 for (pb
= pending_blocks
; pb
!= NULL
; pb
= pb
->next
)
982 barray
= xmalloc (sizeof (*barray
) * count
);
983 back_to
= make_cleanup (xfree
, barray
);
986 for (pb
= pending_blocks
; pb
!= NULL
; pb
= pb
->next
)
989 qsort (barray
, count
, sizeof (*barray
), block_compar
);
992 for (pb
= pending_blocks
; pb
!= NULL
; pb
= pb
->next
)
995 do_cleanups (back_to
);
998 /* Cleanup any undefined types that have been left hanging around
999 (this needs to be done before the finish_blocks so that
1000 file_symbols is still good).
1002 Both cleanup_undefined_types and finish_global_stabs are stabs
1003 specific, but harmless for other symbol readers, since on gdb
1004 startup or when finished reading stabs, the state is set so these
1005 are no-ops. FIXME: Is this handled right in case of QUIT? Can
1006 we make this cleaner? */
1008 cleanup_undefined_types (objfile
);
1009 finish_global_stabs (objfile
);
1011 if (pending_blocks
== NULL
1012 && file_symbols
== NULL
1013 && global_symbols
== NULL
1014 && have_line_numbers
== 0
1015 && pending_macros
== NULL
)
1017 /* Ignore symtabs that have no functions with real debugging
1023 /* Define the STATIC_BLOCK & GLOBAL_BLOCK, and build the
1025 finish_block (0, &file_symbols
, 0, last_source_start_addr
,
1027 finish_block (0, &global_symbols
, 0, last_source_start_addr
,
1029 blockvector
= make_blockvector (objfile
);
1032 /* Read the line table if it has to be read separately. */
1033 if (objfile
->sf
->sym_read_linetable
!= NULL
)
1034 objfile
->sf
->sym_read_linetable ();
1036 /* Handle the case where the debug info specifies a different path
1037 for the main source file. It can cause us to lose track of its
1038 line number information. */
1039 watch_main_source_file_lossage ();
1041 /* Now create the symtab objects proper, one for each subfile. */
1042 /* (The main file is the last one on the chain.) */
1044 for (subfile
= subfiles
; subfile
; subfile
= nextsub
)
1046 int linetablesize
= 0;
1049 /* If we have blocks of symbols, make a symtab. Otherwise, just
1050 ignore this file and any line number info in it. */
1053 if (subfile
->line_vector
)
1055 linetablesize
= sizeof (struct linetable
) +
1056 subfile
->line_vector
->nitems
* sizeof (struct linetable_entry
);
1058 /* Like the pending blocks, the line table may be
1059 scrambled in reordered executables. Sort it if
1060 OBJF_REORDERED is true. */
1061 if (objfile
->flags
& OBJF_REORDERED
)
1062 qsort (subfile
->line_vector
->item
,
1063 subfile
->line_vector
->nitems
,
1064 sizeof (struct linetable_entry
), compare_line_numbers
);
1067 /* Now, allocate a symbol table. */
1068 if (subfile
->symtab
== NULL
)
1069 symtab
= allocate_symtab (subfile
->name
, objfile
);
1071 symtab
= subfile
->symtab
;
1073 /* Fill in its components. */
1074 symtab
->blockvector
= blockvector
;
1075 symtab
->macro_table
= pending_macros
;
1076 if (subfile
->line_vector
)
1078 /* Reallocate the line table on the symbol obstack. */
1079 symtab
->linetable
= (struct linetable
*)
1080 obstack_alloc (&objfile
->objfile_obstack
, linetablesize
);
1081 memcpy (symtab
->linetable
, subfile
->line_vector
, linetablesize
);
1085 symtab
->linetable
= NULL
;
1087 symtab
->block_line_section
= section
;
1088 if (subfile
->dirname
)
1090 /* Reallocate the dirname on the symbol obstack. */
1091 symtab
->dirname
= (char *)
1092 obstack_alloc (&objfile
->objfile_obstack
,
1093 strlen (subfile
->dirname
) + 1);
1094 strcpy (symtab
->dirname
, subfile
->dirname
);
1098 symtab
->dirname
= NULL
;
1101 /* Use whatever language we have been using for this
1102 subfile, not the one that was deduced in allocate_symtab
1103 from the filename. We already did our own deducing when
1104 we created the subfile, and we may have altered our
1105 opinion of what language it is from things we found in
1107 symtab
->language
= subfile
->language
;
1109 /* Save the debug format string (if any) in the symtab. */
1110 symtab
->debugformat
= subfile
->debugformat
;
1112 /* Similarly for the producer. */
1113 symtab
->producer
= subfile
->producer
;
1115 /* All symtabs for the main file and the subfiles share a
1116 blockvector, so we need to clear primary for everything
1117 but the main file. */
1119 symtab
->primary
= 0;
1123 if (subfile
->symtab
)
1125 /* Since we are ignoring that subfile, we also need
1126 to unlink the associated empty symtab that we created.
1127 Otherwise, we can into trouble because various parts
1128 such as the block-vector are uninitialized whereas
1129 the rest of the code assumes that they are.
1131 We can only unlink the symtab because it was allocated
1132 on the objfile obstack. */
1135 if (objfile
->symtabs
== subfile
->symtab
)
1136 objfile
->symtabs
= objfile
->symtabs
->next
;
1138 ALL_OBJFILE_SYMTABS (objfile
, s
)
1139 if (s
->next
== subfile
->symtab
)
1141 s
->next
= s
->next
->next
;
1144 subfile
->symtab
= NULL
;
1147 if (subfile
->name
!= NULL
)
1149 xfree ((void *) subfile
->name
);
1151 if (subfile
->dirname
!= NULL
)
1153 xfree ((void *) subfile
->dirname
);
1155 if (subfile
->line_vector
!= NULL
)
1157 xfree ((void *) subfile
->line_vector
);
1160 nextsub
= subfile
->next
;
1161 xfree ((void *) subfile
);
1164 /* Set this for the main source file. */
1167 symtab
->primary
= 1;
1170 /* Default any symbols without a specified symtab to the primary
1176 for (block_i
= 0; block_i
< BLOCKVECTOR_NBLOCKS (blockvector
); block_i
++)
1178 struct block
*block
= BLOCKVECTOR_BLOCK (blockvector
, block_i
);
1180 struct dict_iterator iter
;
1182 /* Inlined functions may have symbols not in the global or
1183 static symbol lists. */
1184 if (BLOCK_FUNCTION (block
) != NULL
)
1185 if (SYMBOL_SYMTAB (BLOCK_FUNCTION (block
)) == NULL
)
1186 SYMBOL_SYMTAB (BLOCK_FUNCTION (block
)) = symtab
;
1188 for (sym
= dict_iterator_first (BLOCK_DICT (block
), &iter
);
1190 sym
= dict_iterator_next (&iter
))
1191 if (SYMBOL_SYMTAB (sym
) == NULL
)
1192 SYMBOL_SYMTAB (sym
) = symtab
;
1196 last_source_file
= NULL
;
1197 current_subfile
= NULL
;
1198 pending_macros
= NULL
;
1199 if (pending_addrmap
)
1201 obstack_free (&pending_addrmap_obstack
, NULL
);
1202 pending_addrmap
= NULL
;
1208 /* Push a context block. Args are an identifying nesting level
1209 (checkable when you pop it), and the starting PC address of this
1212 struct context_stack
*
1213 push_context (int desc
, CORE_ADDR valu
)
1215 struct context_stack
*new;
1217 if (context_stack_depth
== context_stack_size
)
1219 context_stack_size
*= 2;
1220 context_stack
= (struct context_stack
*)
1221 xrealloc ((char *) context_stack
,
1222 (context_stack_size
* sizeof (struct context_stack
)));
1225 new = &context_stack
[context_stack_depth
++];
1227 new->locals
= local_symbols
;
1228 new->params
= param_symbols
;
1229 new->old_blocks
= pending_blocks
;
1230 new->start_addr
= valu
;
1231 new->using_directives
= using_directives
;
1234 local_symbols
= NULL
;
1235 param_symbols
= NULL
;
1236 using_directives
= NULL
;
1241 /* Pop a context block. Returns the address of the context block just
1244 struct context_stack
*
1247 gdb_assert (context_stack_depth
> 0);
1248 return (&context_stack
[--context_stack_depth
]);
1253 /* Compute a small integer hash code for the given name. */
1256 hashname (char *name
)
1258 return (hash(name
,strlen(name
)) % HASHSIZE
);
1263 record_debugformat (const char *format
)
1265 current_subfile
->debugformat
= format
;
1269 record_producer (const char *producer
)
1271 current_subfile
->producer
= producer
;
1274 /* Merge the first symbol list SRCLIST into the second symbol list
1275 TARGETLIST by repeated calls to add_symbol_to_list(). This
1276 procedure "frees" each link of SRCLIST by adding it to the
1277 free_pendings list. Caller must set SRCLIST to a null list after
1278 calling this function.
1283 merge_symbol_lists (struct pending
**srclist
, struct pending
**targetlist
)
1287 if (!srclist
|| !*srclist
)
1290 /* Merge in elements from current link. */
1291 for (i
= 0; i
< (*srclist
)->nsyms
; i
++)
1292 add_symbol_to_list ((*srclist
)->symbol
[i
], targetlist
);
1294 /* Recurse on next. */
1295 merge_symbol_lists (&(*srclist
)->next
, targetlist
);
1297 /* "Free" the current link. */
1298 (*srclist
)->next
= free_pendings
;
1299 free_pendings
= (*srclist
);
1302 /* Initialize anything that needs initializing when starting to read a
1303 fresh piece of a symbol file, e.g. reading in the stuff
1304 corresponding to a psymtab. */
1307 buildsym_init (void)
1309 free_pendings
= NULL
;
1310 file_symbols
= NULL
;
1311 global_symbols
= NULL
;
1312 pending_blocks
= NULL
;
1313 pending_macros
= NULL
;
1315 /* We shouldn't have any address map at this point. */
1316 gdb_assert (! pending_addrmap
);
1317 pending_addrmap_interesting
= 0;
1320 /* Initialize anything that needs initializing when a completely new
1321 symbol file is specified (not just adding some symbols from another
1322 file, e.g. a shared library). */
1325 buildsym_new_init (void)