1 /* Support routines for building symbol tables in GDB's internal format.
2 Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
3 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003
4 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 2 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, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* This module provides subroutines used for creating and adding to
24 the symbol table. These routines are called from various symbol-
25 file-reading routines.
27 Routines to support specific debugging information formats (stabs,
28 DWARF, etc) belong somewhere else. */
32 #include "gdb_obstack.h"
37 #include "gdb_assert.h"
38 #include "complaints.h"
39 #include "gdb_string.h"
40 #include "expression.h" /* For "enum exp_opcode" used by... */
41 #include "language.h" /* For "local_hex_string" */
43 #include "filenames.h" /* For DOSish file names */
45 #include "demangle.h" /* Needed by SYMBOL_INIT_DEMANGLED_NAME. */
47 #include "cp-support.h"
48 #include "dictionary.h"
50 /* Ask buildsym.h to define the vars it normally declares `extern'. */
53 #include "buildsym.h" /* Our own declarations */
56 /* For cleanup_undefined_types and finish_global_stabs (somewhat
57 questionable--see comment where we call them). */
59 #include "stabsread.h"
61 /* List of free `struct pending' structures for reuse. */
63 static struct pending
*free_pendings
;
65 /* Non-zero if symtab has line number info. This prevents an
66 otherwise empty symtab from being tossed. */
68 static int have_line_numbers
;
70 static int compare_line_numbers (const void *ln1p
, const void *ln2p
);
73 /* Initial sizes of data structures. These are realloc'd larger if
74 needed, and realloc'd down to the size actually used, when
77 #define INITIAL_CONTEXT_STACK_SIZE 10
78 #define INITIAL_LINE_VECTOR_LENGTH 1000
81 /* maintain the lists of symbols and blocks */
83 /* Add a pending list to free_pendings. */
85 add_free_pendings (struct pending
*list
)
87 register struct pending
*link
= list
;
91 while (link
->next
) link
= link
->next
;
92 link
->next
= free_pendings
;
97 /* Add a symbol to one of the lists of symbols. While we're at it, if
98 we're in the C++ case and don't have full namespace debugging info,
99 check to see if it references an anonymous namespace; if so, add an
100 appropriate using directive. */
103 add_symbol_to_list (struct symbol
*symbol
, struct pending
**listhead
)
105 register struct pending
*link
;
107 /* If this is an alias for another symbol, don't add it. */
108 if (symbol
->ginfo
.name
&& symbol
->ginfo
.name
[0] == '#')
111 /* We keep PENDINGSIZE symbols in each link of the list. If we
112 don't have a link with room in it, add a new link. */
113 if (*listhead
== NULL
|| (*listhead
)->nsyms
== PENDINGSIZE
)
117 link
= free_pendings
;
118 free_pendings
= link
->next
;
122 link
= (struct pending
*) xmalloc (sizeof (struct pending
));
125 link
->next
= *listhead
;
130 (*listhead
)->symbol
[(*listhead
)->nsyms
++] = symbol
;
132 /* Check to see if we might need to look for a mention of anonymous
135 if (SYMBOL_LANGUAGE (symbol
) == language_cplus
)
136 cp_scan_for_anonymous_namespaces (symbol
);
139 /* Find a symbol named NAME on a LIST. NAME need not be
140 '\0'-terminated; LENGTH is the length of the name. */
143 find_symbol_in_list (struct pending
*list
, char *name
, int length
)
150 for (j
= list
->nsyms
; --j
>= 0;)
152 pp
= DEPRECATED_SYMBOL_NAME (list
->symbol
[j
]);
153 if (*pp
== *name
&& strncmp (pp
, name
, length
) == 0 &&
156 return (list
->symbol
[j
]);
164 /* At end of reading syms, or in case of quit, really free as many
165 `struct pending's as we can easily find. */
169 really_free_pendings (void *dummy
)
171 struct pending
*next
, *next1
;
173 for (next
= free_pendings
; next
; next
= next1
)
176 xfree ((void *) next
);
178 free_pendings
= NULL
;
180 free_pending_blocks ();
182 for (next
= file_symbols
; next
!= NULL
; next
= next1
)
185 xfree ((void *) next
);
189 for (next
= global_symbols
; next
!= NULL
; next
= next1
)
192 xfree ((void *) next
);
194 global_symbols
= NULL
;
197 free_macro_table (pending_macros
);
200 /* This function is called to discard any pending blocks. */
203 free_pending_blocks (void)
205 #if 0 /* Now we make the links in the
206 symbol_obstack, so don't free
208 struct pending_block
*bnext
, *bnext1
;
210 for (bnext
= pending_blocks
; bnext
; bnext
= bnext1
)
212 bnext1
= bnext
->next
;
213 xfree ((void *) bnext
);
216 pending_blocks
= NULL
;
219 /* Take one of the lists of symbols and make a block from it. Keep
220 the order the symbols have in the list (reversed from the input
221 file). Put the block on the list of pending blocks. */
224 finish_block (struct symbol
*symbol
, struct pending
**listhead
,
225 struct pending_block
*old_blocks
,
226 CORE_ADDR start
, CORE_ADDR end
,
227 struct objfile
*objfile
)
229 register struct pending
*next
, *next1
;
230 register struct block
*block
;
231 register struct pending_block
*pblock
;
232 struct pending_block
*opblock
;
234 block
= allocate_block (&objfile
->symbol_obstack
);
238 BLOCK_DICT (block
) = dict_create_linear (&objfile
->symbol_obstack
,
243 BLOCK_DICT (block
) = dict_create_hashed (&objfile
->symbol_obstack
,
247 BLOCK_START (block
) = start
;
248 BLOCK_END (block
) = end
;
249 /* Superblock filled in when containing block is made */
250 BLOCK_SUPERBLOCK (block
) = NULL
;
251 BLOCK_NAMESPACE (block
) = NULL
;
253 BLOCK_GCC_COMPILED (block
) = processing_gcc_compilation
;
255 /* Put the block in as the value of the symbol that names it. */
259 struct type
*ftype
= SYMBOL_TYPE (symbol
);
260 struct dict_iterator iter
;
261 SYMBOL_BLOCK_VALUE (symbol
) = block
;
262 BLOCK_FUNCTION (block
) = symbol
;
264 if (TYPE_NFIELDS (ftype
) <= 0)
266 /* No parameter type information is recorded with the
267 function's type. Set that from the type of the
268 parameter symbols. */
269 int nparams
= 0, iparams
;
271 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
273 switch (SYMBOL_CLASS (sym
))
278 case LOC_REGPARM_ADDR
:
279 case LOC_BASEREG_ARG
:
281 case LOC_COMPUTED_ARG
:
293 case LOC_CONST_BYTES
:
296 case LOC_OPTIMIZED_OUT
:
304 TYPE_NFIELDS (ftype
) = nparams
;
305 TYPE_FIELDS (ftype
) = (struct field
*)
306 TYPE_ALLOC (ftype
, nparams
* sizeof (struct field
));
309 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
311 if (iparams
== nparams
)
314 switch (SYMBOL_CLASS (sym
))
319 case LOC_REGPARM_ADDR
:
320 case LOC_BASEREG_ARG
:
322 case LOC_COMPUTED_ARG
:
323 TYPE_FIELD_TYPE (ftype
, iparams
) = SYMBOL_TYPE (sym
);
324 TYPE_FIELD_ARTIFICIAL (ftype
, iparams
) = 0;
336 case LOC_CONST_BYTES
:
339 case LOC_OPTIMIZED_OUT
:
348 /* If we're in the C++ case, set the block's scope. */
349 if (SYMBOL_LANGUAGE (symbol
) == language_cplus
)
351 cp_set_block_scope (symbol
, block
, &objfile
->symbol_obstack
);
356 BLOCK_FUNCTION (block
) = NULL
;
359 /* Now "free" the links of the list, and empty the list. */
361 for (next
= *listhead
; next
; next
= next1
)
364 next
->next
= free_pendings
;
365 free_pendings
= next
;
370 /* Check to be sure that the blocks have an end address that is
371 greater than starting address */
373 if (BLOCK_END (block
) < BLOCK_START (block
))
377 complaint (&symfile_complaints
,
378 "block end address less than block start address in %s (patched it)",
379 SYMBOL_PRINT_NAME (symbol
));
383 complaint (&symfile_complaints
,
384 "block end address 0x%s less than block start address 0x%s (patched it)",
385 paddr_nz (BLOCK_END (block
)), paddr_nz (BLOCK_START (block
)));
387 /* Better than nothing */
388 BLOCK_END (block
) = BLOCK_START (block
);
392 /* Install this block as the superblock of all blocks made since the
393 start of this scope that don't have superblocks yet. */
396 for (pblock
= pending_blocks
;
397 pblock
&& pblock
!= old_blocks
;
398 pblock
= pblock
->next
)
400 if (BLOCK_SUPERBLOCK (pblock
->block
) == NULL
)
403 /* Check to be sure the blocks are nested as we receive
404 them. If the compiler/assembler/linker work, this just
405 burns a small amount of time. */
406 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
) ||
407 BLOCK_END (pblock
->block
) > BLOCK_END (block
))
411 complaint (&symfile_complaints
,
412 "inner block not inside outer block in %s",
413 SYMBOL_PRINT_NAME (symbol
));
417 complaint (&symfile_complaints
,
418 "inner block (0x%s-0x%s) not inside outer block (0x%s-0x%s)",
419 paddr_nz (BLOCK_START (pblock
->block
)),
420 paddr_nz (BLOCK_END (pblock
->block
)),
421 paddr_nz (BLOCK_START (block
)),
422 paddr_nz (BLOCK_END (block
)));
424 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
))
425 BLOCK_START (pblock
->block
) = BLOCK_START (block
);
426 if (BLOCK_END (pblock
->block
) > BLOCK_END (block
))
427 BLOCK_END (pblock
->block
) = BLOCK_END (block
);
430 BLOCK_SUPERBLOCK (pblock
->block
) = block
;
435 record_pending_block (objfile
, block
, opblock
);
439 /* Record BLOCK on the list of all blocks in the file. Put it after
440 OPBLOCK, or at the beginning if opblock is NULL. This puts the
441 block in the list after all its subblocks.
443 Allocate the pending block struct in the symbol_obstack to save
444 time. This wastes a little space. FIXME: Is it worth it? */
447 record_pending_block (struct objfile
*objfile
, struct block
*block
,
448 struct pending_block
*opblock
)
450 register struct pending_block
*pblock
;
452 pblock
= (struct pending_block
*)
453 obstack_alloc (&objfile
->symbol_obstack
, sizeof (struct pending_block
));
454 pblock
->block
= block
;
457 pblock
->next
= opblock
->next
;
458 opblock
->next
= pblock
;
462 pblock
->next
= pending_blocks
;
463 pending_blocks
= pblock
;
467 static struct blockvector
*
468 make_blockvector (struct objfile
*objfile
)
470 register struct pending_block
*next
;
471 register struct blockvector
*blockvector
;
474 /* Count the length of the list of blocks. */
476 for (next
= pending_blocks
, i
= 0; next
; next
= next
->next
, i
++)
480 blockvector
= (struct blockvector
*)
481 obstack_alloc (&objfile
->symbol_obstack
,
482 (sizeof (struct blockvector
)
483 + (i
- 1) * sizeof (struct block
*)));
485 /* Copy the blocks into the blockvector. This is done in reverse
486 order, which happens to put the blocks into the proper order
487 (ascending starting address). finish_block has hair to insert
488 each block into the list after its subblocks in order to make
489 sure this is true. */
491 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
492 for (next
= pending_blocks
; next
; next
= next
->next
)
494 BLOCKVECTOR_BLOCK (blockvector
, --i
) = next
->block
;
497 #if 0 /* Now we make the links in the
498 obstack, so don't free them. */
499 /* Now free the links of the list, and empty the list. */
501 for (next
= pending_blocks
; next
; next
= next1
)
507 pending_blocks
= NULL
;
509 #if 1 /* FIXME, shut this off after a while
510 to speed up symbol reading. */
511 /* Some compilers output blocks in the wrong order, but we depend on
512 their being in the right order so we can binary search. Check the
513 order and moan about it. FIXME. */
514 if (BLOCKVECTOR_NBLOCKS (blockvector
) > 1)
516 for (i
= 1; i
< BLOCKVECTOR_NBLOCKS (blockvector
); i
++)
518 if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
- 1))
519 > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
)))
522 = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
));
524 complaint (&symfile_complaints
, "block at %s out of order",
525 local_hex_string ((LONGEST
) start
));
531 return (blockvector
);
534 /* Start recording information about source code that came from an
535 included (or otherwise merged-in) source file with a different
536 name. NAME is the name of the file (cannot be NULL), DIRNAME is
537 the directory in which it resides (or NULL if not known). */
540 start_subfile (char *name
, char *dirname
)
542 register struct subfile
*subfile
;
544 /* See if this subfile is already known as a subfile of the current
547 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
549 if (FILENAME_CMP (subfile
->name
, name
) == 0)
551 current_subfile
= subfile
;
556 /* This subfile is not known. Add an entry for it. Make an entry
557 for this subfile in the list of all subfiles of the current main
560 subfile
= (struct subfile
*) xmalloc (sizeof (struct subfile
));
561 memset ((char *) subfile
, 0, sizeof (struct subfile
));
562 subfile
->next
= subfiles
;
564 current_subfile
= subfile
;
566 /* Save its name and compilation directory name */
567 subfile
->name
= (name
== NULL
) ? NULL
: savestring (name
, strlen (name
));
569 (dirname
== NULL
) ? NULL
: savestring (dirname
, strlen (dirname
));
571 /* Initialize line-number recording for this subfile. */
572 subfile
->line_vector
= NULL
;
574 /* Default the source language to whatever can be deduced from the
575 filename. If nothing can be deduced (such as for a C/C++ include
576 file with a ".h" extension), then inherit whatever language the
577 previous subfile had. This kludgery is necessary because there
578 is no standard way in some object formats to record the source
579 language. Also, when symtabs are allocated we try to deduce a
580 language then as well, but it is too late for us to use that
581 information while reading symbols, since symtabs aren't allocated
582 until after all the symbols have been processed for a given
585 subfile
->language
= deduce_language_from_filename (subfile
->name
);
586 if (subfile
->language
== language_unknown
&&
587 subfile
->next
!= NULL
)
589 subfile
->language
= subfile
->next
->language
;
592 /* Initialize the debug format string to NULL. We may supply it
593 later via a call to record_debugformat. */
594 subfile
->debugformat
= NULL
;
596 #if 0 /* OBSOLETE CFront */
597 // OBSOLETE /* cfront output is a C program, so in most ways it looks like a C
598 // OBSOLETE program. But to demangle we need to set the language to C++. We
599 // OBSOLETE can distinguish cfront code by the fact that it has #line
600 // OBSOLETE directives which specify a file name ending in .C. */
601 #endif /* OBSOLETE CFront */
603 /* If the filename of this subfile ends in .C, then change the
604 language of any pending subfiles from C to C++. We also accept
605 any other C++ suffixes accepted by deduce_language_from_filename. */
606 /* OBSOLETE (in particular, some people use .cxx with cfront). */
607 /* Likewise for f2c. */
612 enum language sublang
= deduce_language_from_filename (subfile
->name
);
614 if (sublang
== language_cplus
|| sublang
== language_fortran
)
615 for (s
= subfiles
; s
!= NULL
; s
= s
->next
)
616 if (s
->language
== language_c
)
617 s
->language
= sublang
;
620 /* And patch up this file if necessary. */
621 if (subfile
->language
== language_c
622 && subfile
->next
!= NULL
623 && (subfile
->next
->language
== language_cplus
624 || subfile
->next
->language
== language_fortran
))
626 subfile
->language
= subfile
->next
->language
;
630 /* For stabs readers, the first N_SO symbol is assumed to be the
631 source file name, and the subfile struct is initialized using that
632 assumption. If another N_SO symbol is later seen, immediately
633 following the first one, then the first one is assumed to be the
634 directory name and the second one is really the source file name.
636 So we have to patch up the subfile struct by moving the old name
637 value to dirname and remembering the new name. Some sanity
638 checking is performed to ensure that the state of the subfile
639 struct is reasonable and that the old name we are assuming to be a
640 directory name actually is (by checking for a trailing '/'). */
643 patch_subfile_names (struct subfile
*subfile
, char *name
)
645 if (subfile
!= NULL
&& subfile
->dirname
== NULL
&& subfile
->name
!= NULL
646 && subfile
->name
[strlen (subfile
->name
) - 1] == '/')
648 subfile
->dirname
= subfile
->name
;
649 subfile
->name
= savestring (name
, strlen (name
));
650 last_source_file
= name
;
652 /* Default the source language to whatever can be deduced from
653 the filename. If nothing can be deduced (such as for a C/C++
654 include file with a ".h" extension), then inherit whatever
655 language the previous subfile had. This kludgery is
656 necessary because there is no standard way in some object
657 formats to record the source language. Also, when symtabs
658 are allocated we try to deduce a language then as well, but
659 it is too late for us to use that information while reading
660 symbols, since symtabs aren't allocated until after all the
661 symbols have been processed for a given source file. */
663 subfile
->language
= deduce_language_from_filename (subfile
->name
);
664 if (subfile
->language
== language_unknown
&&
665 subfile
->next
!= NULL
)
667 subfile
->language
= subfile
->next
->language
;
672 /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
673 switching source files (different subfiles, as we call them) within
674 one object file, but using a stack rather than in an arbitrary
680 register struct subfile_stack
*tem
681 = (struct subfile_stack
*) xmalloc (sizeof (struct subfile_stack
));
683 tem
->next
= subfile_stack
;
685 if (current_subfile
== NULL
|| current_subfile
->name
== NULL
)
687 internal_error (__FILE__
, __LINE__
, "failed internal consistency check");
689 tem
->name
= current_subfile
->name
;
696 register struct subfile_stack
*link
= subfile_stack
;
700 internal_error (__FILE__
, __LINE__
, "failed internal consistency check");
703 subfile_stack
= link
->next
;
704 xfree ((void *) link
);
708 /* Add a linetable entry for line number LINE and address PC to the
709 line vector for SUBFILE. */
712 record_line (register struct subfile
*subfile
, int line
, CORE_ADDR pc
)
714 struct linetable_entry
*e
;
715 /* Ignore the dummy line number in libg.o */
722 /* Make sure line vector exists and is big enough. */
723 if (!subfile
->line_vector
)
725 subfile
->line_vector_length
= INITIAL_LINE_VECTOR_LENGTH
;
726 subfile
->line_vector
= (struct linetable
*)
727 xmalloc (sizeof (struct linetable
)
728 + subfile
->line_vector_length
* sizeof (struct linetable_entry
));
729 subfile
->line_vector
->nitems
= 0;
730 have_line_numbers
= 1;
733 if (subfile
->line_vector
->nitems
+ 1 >= subfile
->line_vector_length
)
735 subfile
->line_vector_length
*= 2;
736 subfile
->line_vector
= (struct linetable
*)
737 xrealloc ((char *) subfile
->line_vector
,
738 (sizeof (struct linetable
)
739 + (subfile
->line_vector_length
740 * sizeof (struct linetable_entry
))));
743 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
++;
745 e
->pc
= ADDR_BITS_REMOVE(pc
);
748 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
751 compare_line_numbers (const void *ln1p
, const void *ln2p
)
753 struct linetable_entry
*ln1
= (struct linetable_entry
*) ln1p
;
754 struct linetable_entry
*ln2
= (struct linetable_entry
*) ln2p
;
756 /* Note: this code does not assume that CORE_ADDRs can fit in ints.
757 Please keep it that way. */
758 if (ln1
->pc
< ln2
->pc
)
761 if (ln1
->pc
> ln2
->pc
)
764 /* If pc equal, sort by line. I'm not sure whether this is optimum
765 behavior (see comment at struct linetable in symtab.h). */
766 return ln1
->line
- ln2
->line
;
769 /* Start a new symtab for a new source file. Called, for example,
770 when a stabs symbol of type N_SO is seen, or when a DWARF
771 TAG_compile_unit DIE is seen. It indicates the start of data for
772 one original source file. */
775 start_symtab (char *name
, char *dirname
, CORE_ADDR start_addr
)
778 last_source_file
= name
;
779 last_source_start_addr
= start_addr
;
781 global_symbols
= NULL
;
783 have_line_numbers
= 0;
785 /* Context stack is initially empty. Allocate first one with room
786 for 10 levels; reuse it forever afterward. */
787 if (context_stack
== NULL
)
789 context_stack_size
= INITIAL_CONTEXT_STACK_SIZE
;
790 context_stack
= (struct context_stack
*)
791 xmalloc (context_stack_size
* sizeof (struct context_stack
));
793 context_stack_depth
= 0;
795 /* Set up support for C++ namespace support, in case we need it. */
797 cp_initialize_namespace ();
799 /* Initialize the list of sub source files with one entry for this
800 file (the top-level source file). */
803 current_subfile
= NULL
;
804 start_subfile (name
, dirname
);
807 /* Finish the symbol definitions for one main source file, close off
808 all the lexical contexts for that file (creating struct block's for
809 them), then make the struct symtab for that file and put it in the
812 END_ADDR is the address of the end of the file's text. SECTION is
813 the section number (in objfile->section_offsets) of the blockvector
816 Note that it is possible for end_symtab() to return NULL. In
817 particular, for the DWARF case at least, it will return NULL when
818 it finds a compilation unit that has exactly one DIE, a
819 TAG_compile_unit DIE. This can happen when we link in an object
820 file that was compiled from an empty source file. Returning NULL
821 is probably not the correct thing to do, because then gdb will
822 never know about this empty file (FIXME). */
825 end_symtab (CORE_ADDR end_addr
, struct objfile
*objfile
, int section
)
827 register struct symtab
*symtab
= NULL
;
828 register struct blockvector
*blockvector
;
829 register struct subfile
*subfile
;
830 register struct context_stack
*cstk
;
831 struct subfile
*nextsub
;
833 /* Finish the lexical context of the last function in the file; pop
834 the context stack. */
836 if (context_stack_depth
> 0)
838 cstk
= pop_context ();
839 /* Make a block for the local symbols within. */
840 finish_block (cstk
->name
, &local_symbols
, cstk
->old_blocks
,
841 cstk
->start_addr
, end_addr
, objfile
);
843 if (context_stack_depth
> 0)
845 /* This is said to happen with SCO. The old coffread.c
846 code simply emptied the context stack, so we do the
847 same. FIXME: Find out why it is happening. This is not
848 believed to happen in most cases (even for coffread.c);
849 it used to be an abort(). */
850 complaint (&symfile_complaints
,
851 "Context stack not empty in end_symtab");
852 context_stack_depth
= 0;
856 /* Reordered executables may have out of order pending blocks; if
857 OBJF_REORDERED is true, then sort the pending blocks. */
858 if ((objfile
->flags
& OBJF_REORDERED
) && pending_blocks
)
860 /* FIXME! Remove this horrid bubble sort and use merge sort!!! */
864 struct pending_block
*pb
, *pbnext
;
872 /* swap blocks if unordered! */
874 if (BLOCK_START (pb
->block
) < BLOCK_START (pbnext
->block
))
876 struct block
*tmp
= pb
->block
;
877 pb
->block
= pbnext
->block
;
882 pbnext
= pbnext
->next
;
888 /* Cleanup any undefined types that have been left hanging around
889 (this needs to be done before the finish_blocks so that
890 file_symbols is still good).
892 Both cleanup_undefined_types and finish_global_stabs are stabs
893 specific, but harmless for other symbol readers, since on gdb
894 startup or when finished reading stabs, the state is set so these
895 are no-ops. FIXME: Is this handled right in case of QUIT? Can
896 we make this cleaner? */
898 cleanup_undefined_types ();
899 finish_global_stabs (objfile
);
901 if (pending_blocks
== NULL
902 && file_symbols
== NULL
903 && global_symbols
== NULL
904 && have_line_numbers
== 0
905 && pending_macros
== NULL
)
907 /* Ignore symtabs that have no functions with real debugging
913 /* Define the STATIC_BLOCK & GLOBAL_BLOCK, and build the
915 finish_block (0, &file_symbols
, 0, last_source_start_addr
, end_addr
,
917 finish_block (0, &global_symbols
, 0, last_source_start_addr
, end_addr
,
919 blockvector
= make_blockvector (objfile
);
920 cp_finalize_namespace (BLOCKVECTOR_BLOCK (blockvector
, STATIC_BLOCK
),
921 &objfile
->symbol_obstack
);
924 #ifndef PROCESS_LINENUMBER_HOOK
925 #define PROCESS_LINENUMBER_HOOK()
927 PROCESS_LINENUMBER_HOOK (); /* Needed for xcoff. */
929 /* Now create the symtab objects proper, one for each subfile. */
930 /* (The main file is the last one on the chain.) */
932 for (subfile
= subfiles
; subfile
; subfile
= nextsub
)
934 int linetablesize
= 0;
937 /* If we have blocks of symbols, make a symtab. Otherwise, just
938 ignore this file and any line number info in it. */
941 if (subfile
->line_vector
)
943 linetablesize
= sizeof (struct linetable
) +
944 subfile
->line_vector
->nitems
* sizeof (struct linetable_entry
);
946 /* I think this is artifact from before it went on the
947 obstack. I doubt we'll need the memory between now
948 and when we free it later in this function. */
949 /* First, shrink the linetable to make more memory. */
950 subfile
->line_vector
= (struct linetable
*)
951 xrealloc ((char *) subfile
->line_vector
, linetablesize
);
954 /* Like the pending blocks, the line table may be
955 scrambled in reordered executables. Sort it if
956 OBJF_REORDERED is true. */
957 if (objfile
->flags
& OBJF_REORDERED
)
958 qsort (subfile
->line_vector
->item
,
959 subfile
->line_vector
->nitems
,
960 sizeof (struct linetable_entry
), compare_line_numbers
);
963 /* Now, allocate a symbol table. */
964 symtab
= allocate_symtab (subfile
->name
, objfile
);
966 /* Fill in its components. */
967 symtab
->blockvector
= blockvector
;
968 symtab
->macro_table
= pending_macros
;
969 if (subfile
->line_vector
)
971 /* Reallocate the line table on the symbol obstack */
972 symtab
->linetable
= (struct linetable
*)
973 obstack_alloc (&objfile
->symbol_obstack
, linetablesize
);
974 memcpy (symtab
->linetable
, subfile
->line_vector
, linetablesize
);
978 symtab
->linetable
= NULL
;
980 symtab
->block_line_section
= section
;
981 if (subfile
->dirname
)
983 /* Reallocate the dirname on the symbol obstack */
984 symtab
->dirname
= (char *)
985 obstack_alloc (&objfile
->symbol_obstack
,
986 strlen (subfile
->dirname
) + 1);
987 strcpy (symtab
->dirname
, subfile
->dirname
);
991 symtab
->dirname
= NULL
;
993 symtab
->free_code
= free_linetable
;
994 symtab
->free_func
= NULL
;
996 /* Use whatever language we have been using for this
997 subfile, not the one that was deduced in allocate_symtab
998 from the filename. We already did our own deducing when
999 we created the subfile, and we may have altered our
1000 opinion of what language it is from things we found in
1002 symtab
->language
= subfile
->language
;
1004 /* Save the debug format string (if any) in the symtab */
1005 if (subfile
->debugformat
!= NULL
)
1007 symtab
->debugformat
= obsavestring (subfile
->debugformat
,
1008 strlen (subfile
->debugformat
),
1009 &objfile
->symbol_obstack
);
1012 /* All symtabs for the main file and the subfiles share a
1013 blockvector, so we need to clear primary for everything
1014 but the main file. */
1016 symtab
->primary
= 0;
1018 if (subfile
->name
!= NULL
)
1020 xfree ((void *) subfile
->name
);
1022 if (subfile
->dirname
!= NULL
)
1024 xfree ((void *) subfile
->dirname
);
1026 if (subfile
->line_vector
!= NULL
)
1028 xfree ((void *) subfile
->line_vector
);
1030 if (subfile
->debugformat
!= NULL
)
1032 xfree ((void *) subfile
->debugformat
);
1035 nextsub
= subfile
->next
;
1036 xfree ((void *) subfile
);
1039 /* Set this for the main source file. */
1042 symtab
->primary
= 1;
1045 last_source_file
= NULL
;
1046 current_subfile
= NULL
;
1047 pending_macros
= NULL
;
1052 /* Push a context block. Args are an identifying nesting level
1053 (checkable when you pop it), and the starting PC address of this
1056 struct context_stack
*
1057 push_context (int desc
, CORE_ADDR valu
)
1059 register struct context_stack
*new;
1061 if (context_stack_depth
== context_stack_size
)
1063 context_stack_size
*= 2;
1064 context_stack
= (struct context_stack
*)
1065 xrealloc ((char *) context_stack
,
1066 (context_stack_size
* sizeof (struct context_stack
)));
1069 new = &context_stack
[context_stack_depth
++];
1071 new->locals
= local_symbols
;
1072 new->params
= param_symbols
;
1073 new->old_blocks
= pending_blocks
;
1074 new->start_addr
= valu
;
1077 local_symbols
= NULL
;
1078 param_symbols
= NULL
;
1083 /* Pop a context block. Returns the address of the context block just
1086 struct context_stack
*
1089 gdb_assert (context_stack_depth
> 0);
1090 return (&context_stack
[--context_stack_depth
]);
1095 /* Compute a small integer hash code for the given name. */
1098 hashname (char *name
)
1100 return (hash(name
,strlen(name
)) % HASHSIZE
);
1105 record_debugformat (char *format
)
1107 current_subfile
->debugformat
= savestring (format
, strlen (format
));
1110 /* Merge the first symbol list SRCLIST into the second symbol list
1111 TARGETLIST by repeated calls to add_symbol_to_list(). This
1112 procedure "frees" each link of SRCLIST by adding it to the
1113 free_pendings list. Caller must set SRCLIST to a null list after
1114 calling this function.
1119 merge_symbol_lists (struct pending
**srclist
, struct pending
**targetlist
)
1123 if (!srclist
|| !*srclist
)
1126 /* Merge in elements from current link. */
1127 for (i
= 0; i
< (*srclist
)->nsyms
; i
++)
1128 add_symbol_to_list ((*srclist
)->symbol
[i
], targetlist
);
1130 /* Recurse on next. */
1131 merge_symbol_lists (&(*srclist
)->next
, targetlist
);
1133 /* "Free" the current link. */
1134 (*srclist
)->next
= free_pendings
;
1135 free_pendings
= (*srclist
);
1138 /* Initialize anything that needs initializing when starting to read a
1139 fresh piece of a symbol file, e.g. reading in the stuff
1140 corresponding to a psymtab. */
1143 buildsym_init (void)
1145 free_pendings
= NULL
;
1146 file_symbols
= NULL
;
1147 global_symbols
= NULL
;
1148 pending_blocks
= NULL
;
1149 pending_macros
= NULL
;
1152 /* Initialize anything that needs initializing when a completely new
1153 symbol file is specified (not just adding some symbols from another
1154 file, e.g. a shared library). */
1157 buildsym_new_init (void)