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 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. While we're at it, if
117 we're in the C++ case and don't have full namespace debugging info,
118 check to see if it references an anonymous namespace; if so, add an
119 appropriate using directive. */
122 add_symbol_to_list (struct symbol
*symbol
, struct pending
**listhead
)
124 struct pending
*link
;
126 /* If this is an alias for another symbol, don't add it. */
127 if (symbol
->ginfo
.name
&& symbol
->ginfo
.name
[0] == '#')
130 /* We keep PENDINGSIZE symbols in each link of the list. If we
131 don't have a link with room in it, add a new link. */
132 if (*listhead
== NULL
|| (*listhead
)->nsyms
== PENDINGSIZE
)
136 link
= free_pendings
;
137 free_pendings
= link
->next
;
141 link
= (struct pending
*) xmalloc (sizeof (struct pending
));
144 link
->next
= *listhead
;
149 (*listhead
)->symbol
[(*listhead
)->nsyms
++] = symbol
;
152 /* Find a symbol named NAME on a LIST. NAME need not be
153 '\0'-terminated; LENGTH is the length of the name. */
156 find_symbol_in_list (struct pending
*list
, char *name
, int length
)
163 for (j
= list
->nsyms
; --j
>= 0;)
165 pp
= SYMBOL_LINKAGE_NAME (list
->symbol
[j
]);
166 if (*pp
== *name
&& strncmp (pp
, name
, length
) == 0 &&
169 return (list
->symbol
[j
]);
177 /* At end of reading syms, or in case of quit, really free as many
178 `struct pending's as we can easily find. */
181 really_free_pendings (void *dummy
)
183 struct pending
*next
, *next1
;
185 for (next
= free_pendings
; next
; next
= next1
)
188 xfree ((void *) next
);
190 free_pendings
= NULL
;
192 free_pending_blocks ();
194 for (next
= file_symbols
; next
!= NULL
; next
= next1
)
197 xfree ((void *) next
);
201 for (next
= global_symbols
; next
!= NULL
; next
= next1
)
204 xfree ((void *) next
);
206 global_symbols
= NULL
;
209 free_macro_table (pending_macros
);
213 obstack_free (&pending_addrmap_obstack
, NULL
);
214 pending_addrmap
= NULL
;
218 /* This function is called to discard any pending blocks. */
221 free_pending_blocks (void)
223 /* The links are made in the objfile_obstack, so we only need to
224 reset PENDING_BLOCKS. */
225 pending_blocks
= NULL
;
228 /* Take one of the lists of symbols and make a block from it. Keep
229 the order the symbols have in the list (reversed from the input
230 file). Put the block on the list of pending blocks. */
233 finish_block (struct symbol
*symbol
, struct pending
**listhead
,
234 struct pending_block
*old_blocks
,
235 CORE_ADDR start
, CORE_ADDR end
,
236 struct objfile
*objfile
)
238 struct pending
*next
, *next1
;
240 struct pending_block
*pblock
;
241 struct pending_block
*opblock
;
243 block
= allocate_block (&objfile
->objfile_obstack
);
247 BLOCK_DICT (block
) = dict_create_linear (&objfile
->objfile_obstack
,
252 BLOCK_DICT (block
) = dict_create_hashed (&objfile
->objfile_obstack
,
256 BLOCK_START (block
) = start
;
257 BLOCK_END (block
) = end
;
258 /* Superblock filled in when containing block is made */
259 BLOCK_SUPERBLOCK (block
) = NULL
;
260 BLOCK_NAMESPACE (block
) = NULL
;
262 /* Put the block in as the value of the symbol that names it. */
266 struct type
*ftype
= SYMBOL_TYPE (symbol
);
267 struct dict_iterator iter
;
268 SYMBOL_BLOCK_VALUE (symbol
) = block
;
269 BLOCK_FUNCTION (block
) = symbol
;
271 if (TYPE_NFIELDS (ftype
) <= 0)
273 /* No parameter type information is recorded with the
274 function's type. Set that from the type of the
275 parameter symbols. */
276 int nparams
= 0, iparams
;
278 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
280 if (SYMBOL_IS_ARGUMENT (sym
))
285 TYPE_NFIELDS (ftype
) = nparams
;
286 TYPE_FIELDS (ftype
) = (struct field
*)
287 TYPE_ALLOC (ftype
, nparams
* sizeof (struct field
));
290 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
292 if (iparams
== nparams
)
295 if (SYMBOL_IS_ARGUMENT (sym
))
297 TYPE_FIELD_TYPE (ftype
, iparams
) = SYMBOL_TYPE (sym
);
298 TYPE_FIELD_ARTIFICIAL (ftype
, iparams
) = 0;
307 BLOCK_FUNCTION (block
) = NULL
;
310 /* Now "free" the links of the list, and empty the list. */
312 for (next
= *listhead
; next
; next
= next1
)
315 next
->next
= free_pendings
;
316 free_pendings
= next
;
320 /* Check to be sure that the blocks have an end address that is
321 greater than starting address */
323 if (BLOCK_END (block
) < BLOCK_START (block
))
327 complaint (&symfile_complaints
,
328 _("block end address less than block start address in %s (patched it)"),
329 SYMBOL_PRINT_NAME (symbol
));
333 complaint (&symfile_complaints
,
334 _("block end address 0x%s less than block start address 0x%s (patched it)"),
335 paddr_nz (BLOCK_END (block
)), paddr_nz (BLOCK_START (block
)));
337 /* Better than nothing */
338 BLOCK_END (block
) = BLOCK_START (block
);
341 /* Install this block as the superblock of all blocks made since the
342 start of this scope that don't have superblocks yet. */
345 for (pblock
= pending_blocks
;
346 pblock
&& pblock
!= old_blocks
;
347 pblock
= pblock
->next
)
349 if (BLOCK_SUPERBLOCK (pblock
->block
) == NULL
)
351 /* Check to be sure the blocks are nested as we receive
352 them. If the compiler/assembler/linker work, this just
353 burns a small amount of time.
355 Skip blocks which correspond to a function; they're not
356 physically nested inside this other blocks, only
358 if (BLOCK_FUNCTION (pblock
->block
) == NULL
359 && (BLOCK_START (pblock
->block
) < BLOCK_START (block
)
360 || BLOCK_END (pblock
->block
) > BLOCK_END (block
)))
364 complaint (&symfile_complaints
,
365 _("inner block not inside outer block in %s"),
366 SYMBOL_PRINT_NAME (symbol
));
370 complaint (&symfile_complaints
,
371 _("inner block (0x%s-0x%s) not inside outer block (0x%s-0x%s)"),
372 paddr_nz (BLOCK_START (pblock
->block
)),
373 paddr_nz (BLOCK_END (pblock
->block
)),
374 paddr_nz (BLOCK_START (block
)),
375 paddr_nz (BLOCK_END (block
)));
377 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
))
378 BLOCK_START (pblock
->block
) = BLOCK_START (block
);
379 if (BLOCK_END (pblock
->block
) > BLOCK_END (block
))
380 BLOCK_END (pblock
->block
) = BLOCK_END (block
);
382 BLOCK_SUPERBLOCK (pblock
->block
) = block
;
387 block_set_using (block
, using_directives
, &objfile
->objfile_obstack
);
389 record_pending_block (objfile
, block
, opblock
);
395 /* Record BLOCK on the list of all blocks in the file. Put it after
396 OPBLOCK, or at the beginning if opblock is NULL. This puts the
397 block in the list after all its subblocks.
399 Allocate the pending block struct in the objfile_obstack to save
400 time. This wastes a little space. FIXME: Is it worth it? */
403 record_pending_block (struct objfile
*objfile
, struct block
*block
,
404 struct pending_block
*opblock
)
406 struct pending_block
*pblock
;
408 pblock
= (struct pending_block
*)
409 obstack_alloc (&objfile
->objfile_obstack
, sizeof (struct pending_block
));
410 pblock
->block
= block
;
413 pblock
->next
= opblock
->next
;
414 opblock
->next
= pblock
;
418 pblock
->next
= pending_blocks
;
419 pending_blocks
= pblock
;
424 /* Record that the range of addresses from START to END_INCLUSIVE
425 (inclusive, like it says) belongs to BLOCK. BLOCK's start and end
426 addresses must be set already. You must apply this function to all
427 BLOCK's children before applying it to BLOCK.
429 If a call to this function complicates the picture beyond that
430 already provided by BLOCK_START and BLOCK_END, then we create an
431 address map for the block. */
433 record_block_range (struct block
*block
,
434 CORE_ADDR start
, CORE_ADDR end_inclusive
)
436 /* If this is any different from the range recorded in the block's
437 own BLOCK_START and BLOCK_END, then note that the address map has
438 become interesting. Note that even if this block doesn't have
439 any "interesting" ranges, some later block might, so we still
440 need to record this block in the addrmap. */
441 if (start
!= BLOCK_START (block
)
442 || end_inclusive
+ 1 != BLOCK_END (block
))
443 pending_addrmap_interesting
= 1;
445 if (! pending_addrmap
)
447 obstack_init (&pending_addrmap_obstack
);
448 pending_addrmap
= addrmap_create_mutable (&pending_addrmap_obstack
);
451 addrmap_set_empty (pending_addrmap
, start
, end_inclusive
, block
);
455 static struct blockvector
*
456 make_blockvector (struct objfile
*objfile
)
458 struct pending_block
*next
;
459 struct blockvector
*blockvector
;
462 /* Count the length of the list of blocks. */
464 for (next
= pending_blocks
, i
= 0; next
; next
= next
->next
, i
++)
468 blockvector
= (struct blockvector
*)
469 obstack_alloc (&objfile
->objfile_obstack
,
470 (sizeof (struct blockvector
)
471 + (i
- 1) * sizeof (struct block
*)));
473 /* Copy the blocks into the blockvector. This is done in reverse
474 order, which happens to put the blocks into the proper order
475 (ascending starting address). finish_block has hair to insert
476 each block into the list after its subblocks in order to make
477 sure this is true. */
479 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
480 for (next
= pending_blocks
; next
; next
= next
->next
)
482 BLOCKVECTOR_BLOCK (blockvector
, --i
) = next
->block
;
485 free_pending_blocks ();
487 /* If we needed an address map for this symtab, record it in the
489 if (pending_addrmap
&& pending_addrmap_interesting
)
490 BLOCKVECTOR_MAP (blockvector
)
491 = addrmap_create_fixed (pending_addrmap
, &objfile
->objfile_obstack
);
493 BLOCKVECTOR_MAP (blockvector
) = 0;
495 /* Some compilers output blocks in the wrong order, but we depend on
496 their being in the right order so we can binary search. Check the
497 order and moan about it. */
498 if (BLOCKVECTOR_NBLOCKS (blockvector
) > 1)
500 for (i
= 1; i
< BLOCKVECTOR_NBLOCKS (blockvector
); i
++)
502 if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
- 1))
503 > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
)))
506 = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
));
508 complaint (&symfile_complaints
, _("block at %s out of order"),
509 hex_string ((LONGEST
) start
));
514 return (blockvector
);
517 /* Start recording information about source code that came from an
518 included (or otherwise merged-in) source file with a different
519 name. NAME is the name of the file (cannot be NULL), DIRNAME is
520 the directory in which the file was compiled (or NULL if not known). */
523 start_subfile (char *name
, char *dirname
)
525 struct subfile
*subfile
;
527 /* See if this subfile is already known as a subfile of the current
530 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
534 /* If NAME is an absolute path, and this subfile is not, then
535 attempt to create an absolute path to compare. */
536 if (IS_ABSOLUTE_PATH (name
)
537 && !IS_ABSOLUTE_PATH (subfile
->name
)
538 && subfile
->dirname
!= NULL
)
539 subfile_name
= concat (subfile
->dirname
, SLASH_STRING
,
540 subfile
->name
, (char *) NULL
);
542 subfile_name
= subfile
->name
;
544 if (FILENAME_CMP (subfile_name
, name
) == 0)
546 current_subfile
= subfile
;
547 if (subfile_name
!= subfile
->name
)
548 xfree (subfile_name
);
551 if (subfile_name
!= subfile
->name
)
552 xfree (subfile_name
);
555 /* This subfile is not known. Add an entry for it. Make an entry
556 for this subfile in the list of all subfiles of the current main
559 subfile
= (struct subfile
*) xmalloc (sizeof (struct subfile
));
560 memset ((char *) subfile
, 0, sizeof (struct subfile
));
561 subfile
->next
= subfiles
;
563 current_subfile
= subfile
;
565 /* Save its name and compilation directory name */
566 subfile
->name
= (name
== NULL
) ? NULL
: xstrdup (name
);
567 subfile
->dirname
= (dirname
== NULL
) ? NULL
: xstrdup (dirname
);
569 /* Initialize line-number recording for this subfile. */
570 subfile
->line_vector
= NULL
;
572 /* Default the source language to whatever can be deduced from the
573 filename. If nothing can be deduced (such as for a C/C++ include
574 file with a ".h" extension), then inherit whatever language the
575 previous subfile had. This kludgery is necessary because there
576 is no standard way in some object formats to record the source
577 language. Also, when symtabs are allocated we try to deduce a
578 language then as well, but it is too late for us to use that
579 information while reading symbols, since symtabs aren't allocated
580 until after all the symbols have been processed for a given
583 subfile
->language
= deduce_language_from_filename (subfile
->name
);
584 if (subfile
->language
== language_unknown
&&
585 subfile
->next
!= NULL
)
587 subfile
->language
= subfile
->next
->language
;
590 /* Initialize the debug format string to NULL. We may supply it
591 later via a call to record_debugformat. */
592 subfile
->debugformat
= NULL
;
594 /* Similarly for the producer. */
595 subfile
->producer
= NULL
;
597 /* If the filename of this subfile ends in .C, then change the
598 language of any pending subfiles from C to C++. We also accept
599 any other C++ suffixes accepted by deduce_language_from_filename. */
600 /* Likewise for f2c. */
605 enum language sublang
= deduce_language_from_filename (subfile
->name
);
607 if (sublang
== language_cplus
|| sublang
== language_fortran
)
608 for (s
= subfiles
; s
!= NULL
; s
= s
->next
)
609 if (s
->language
== language_c
)
610 s
->language
= sublang
;
613 /* And patch up this file if necessary. */
614 if (subfile
->language
== language_c
615 && subfile
->next
!= NULL
616 && (subfile
->next
->language
== language_cplus
617 || subfile
->next
->language
== language_fortran
))
619 subfile
->language
= subfile
->next
->language
;
623 /* For stabs readers, the first N_SO symbol is assumed to be the
624 source file name, and the subfile struct is initialized using that
625 assumption. If another N_SO symbol is later seen, immediately
626 following the first one, then the first one is assumed to be the
627 directory name and the second one is really the source file name.
629 So we have to patch up the subfile struct by moving the old name
630 value to dirname and remembering the new name. Some sanity
631 checking is performed to ensure that the state of the subfile
632 struct is reasonable and that the old name we are assuming to be a
633 directory name actually is (by checking for a trailing '/'). */
636 patch_subfile_names (struct subfile
*subfile
, char *name
)
638 if (subfile
!= NULL
&& subfile
->dirname
== NULL
&& subfile
->name
!= NULL
639 && subfile
->name
[strlen (subfile
->name
) - 1] == '/')
641 subfile
->dirname
= subfile
->name
;
642 subfile
->name
= xstrdup (name
);
643 last_source_file
= name
;
645 /* Default the source language to whatever can be deduced from
646 the filename. If nothing can be deduced (such as for a C/C++
647 include file with a ".h" extension), then inherit whatever
648 language the previous subfile had. This kludgery is
649 necessary because there is no standard way in some object
650 formats to record the source language. Also, when symtabs
651 are allocated we try to deduce a language then as well, but
652 it is too late for us to use that information while reading
653 symbols, since symtabs aren't allocated until after all the
654 symbols have been processed for a given source file. */
656 subfile
->language
= deduce_language_from_filename (subfile
->name
);
657 if (subfile
->language
== language_unknown
&&
658 subfile
->next
!= NULL
)
660 subfile
->language
= subfile
->next
->language
;
665 /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
666 switching source files (different subfiles, as we call them) within
667 one object file, but using a stack rather than in an arbitrary
673 struct subfile_stack
*tem
674 = (struct subfile_stack
*) xmalloc (sizeof (struct subfile_stack
));
676 tem
->next
= subfile_stack
;
678 if (current_subfile
== NULL
|| current_subfile
->name
== NULL
)
680 internal_error (__FILE__
, __LINE__
, _("failed internal consistency check"));
682 tem
->name
= current_subfile
->name
;
689 struct subfile_stack
*link
= subfile_stack
;
693 internal_error (__FILE__
, __LINE__
, _("failed internal consistency check"));
696 subfile_stack
= link
->next
;
697 xfree ((void *) link
);
701 /* Add a linetable entry for line number LINE and address PC to the
702 line vector for SUBFILE. */
705 record_line (struct subfile
*subfile
, int line
, CORE_ADDR pc
)
707 struct linetable_entry
*e
;
708 /* Ignore the dummy line number in libg.o */
715 /* Make sure line vector exists and is big enough. */
716 if (!subfile
->line_vector
)
718 subfile
->line_vector_length
= INITIAL_LINE_VECTOR_LENGTH
;
719 subfile
->line_vector
= (struct linetable
*)
720 xmalloc (sizeof (struct linetable
)
721 + subfile
->line_vector_length
* sizeof (struct linetable_entry
));
722 subfile
->line_vector
->nitems
= 0;
723 have_line_numbers
= 1;
726 if (subfile
->line_vector
->nitems
+ 1 >= subfile
->line_vector_length
)
728 subfile
->line_vector_length
*= 2;
729 subfile
->line_vector
= (struct linetable
*)
730 xrealloc ((char *) subfile
->line_vector
,
731 (sizeof (struct linetable
)
732 + (subfile
->line_vector_length
733 * sizeof (struct linetable_entry
))));
736 /* Normally, we treat lines as unsorted. But the end of sequence
737 marker is special. We sort line markers at the same PC by line
738 number, so end of sequence markers (which have line == 0) appear
739 first. This is right if the marker ends the previous function,
740 and there is no padding before the next function. But it is
741 wrong if the previous line was empty and we are now marking a
742 switch to a different subfile. We must leave the end of sequence
743 marker at the end of this group of lines, not sort the empty line
744 to after the marker. The easiest way to accomplish this is to
745 delete any empty lines from our table, if they are followed by
746 end of sequence markers. All we lose is the ability to set
747 breakpoints at some lines which contain no instructions
749 if (line
== 0 && subfile
->line_vector
->nitems
> 0)
751 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
- 1;
752 while (subfile
->line_vector
->nitems
> 0 && e
->pc
== pc
)
755 subfile
->line_vector
->nitems
--;
759 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
++;
764 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
767 compare_line_numbers (const void *ln1p
, const void *ln2p
)
769 struct linetable_entry
*ln1
= (struct linetable_entry
*) ln1p
;
770 struct linetable_entry
*ln2
= (struct linetable_entry
*) ln2p
;
772 /* Note: this code does not assume that CORE_ADDRs can fit in ints.
773 Please keep it that way. */
774 if (ln1
->pc
< ln2
->pc
)
777 if (ln1
->pc
> ln2
->pc
)
780 /* If pc equal, sort by line. I'm not sure whether this is optimum
781 behavior (see comment at struct linetable in symtab.h). */
782 return ln1
->line
- ln2
->line
;
785 /* Start a new symtab for a new source file. Called, for example,
786 when a stabs symbol of type N_SO is seen, or when a DWARF
787 TAG_compile_unit DIE is seen. It indicates the start of data for
788 one original source file.
790 NAME is the name of the file (cannot be NULL). DIRNAME is the directory in
791 which the file was compiled (or NULL if not known). START_ADDR is the
792 lowest address of objects in the file (or 0 if not known). */
795 start_symtab (char *name
, char *dirname
, CORE_ADDR start_addr
)
797 last_source_file
= name
;
798 last_source_start_addr
= start_addr
;
800 global_symbols
= NULL
;
802 have_line_numbers
= 0;
804 /* Context stack is initially empty. Allocate first one with room
805 for 10 levels; reuse it forever afterward. */
806 if (context_stack
== NULL
)
808 context_stack_size
= INITIAL_CONTEXT_STACK_SIZE
;
809 context_stack
= (struct context_stack
*)
810 xmalloc (context_stack_size
* sizeof (struct context_stack
));
812 context_stack_depth
= 0;
814 /* We shouldn't have any address map at this point. */
815 gdb_assert (! pending_addrmap
);
817 /* Initialize the list of sub source files with one entry for this
818 file (the top-level source file). */
821 current_subfile
= NULL
;
822 start_subfile (name
, dirname
);
825 /* Subroutine of end_symtab to simplify it.
826 Look for a subfile that matches the main source file's basename.
827 If there is only one, and if the main source file doesn't have any
828 symbol or line number information, then copy this file's symtab and
829 line_vector to the main source file's subfile and discard the other subfile.
830 This can happen because of a compiler bug or from the user playing games
831 with #line or from things like a distributed build system that manipulates
835 watch_main_source_file_lossage (void)
837 struct subfile
*mainsub
, *subfile
;
839 /* Find the main source file.
840 This loop could be eliminated if start_symtab saved it for us. */
842 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
844 /* The main subfile is guaranteed to be the last one. */
845 if (subfile
->next
== NULL
)
849 /* If the main source file doesn't have any line number or symbol info,
850 look for an alias in another subfile.
851 We have to watch for mainsub == NULL here. It's a quirk of end_symtab,
852 it can return NULL so there may not be a main subfile. */
855 && mainsub
->line_vector
== NULL
856 && mainsub
->symtab
== NULL
)
858 const char *mainbase
= lbasename (mainsub
->name
);
860 struct subfile
*prevsub
;
861 struct subfile
*mainsub_alias
= NULL
;
862 struct subfile
*prev_mainsub_alias
= NULL
;
865 for (subfile
= subfiles
;
866 /* Stop before we get to the last one. */
868 subfile
= subfile
->next
)
870 if (strcmp (lbasename (subfile
->name
), mainbase
) == 0)
873 mainsub_alias
= subfile
;
874 prev_mainsub_alias
= prevsub
;
881 gdb_assert (mainsub_alias
!= NULL
&& mainsub_alias
!= mainsub
);
883 /* Found a match for the main source file.
884 Copy its line_vector and symtab to the main subfile
885 and then discard it. */
887 mainsub
->line_vector
= mainsub_alias
->line_vector
;
888 mainsub
->line_vector_length
= mainsub_alias
->line_vector_length
;
889 mainsub
->symtab
= mainsub_alias
->symtab
;
891 if (prev_mainsub_alias
== NULL
)
892 subfiles
= mainsub_alias
->next
;
894 prev_mainsub_alias
->next
= mainsub_alias
->next
;
895 xfree (mainsub_alias
);
900 /* Helper function for qsort. Parametes are `struct block *' pointers,
901 function sorts them in descending order by their BLOCK_START. */
904 block_compar (const void *ap
, const void *bp
)
906 const struct block
*a
= *(const struct block
**) ap
;
907 const struct block
*b
= *(const struct block
**) bp
;
909 return ((BLOCK_START (b
) > BLOCK_START (a
))
910 - (BLOCK_START (b
) < BLOCK_START (a
)));
913 /* Finish the symbol definitions for one main source file, close off
914 all the lexical contexts for that file (creating struct block's for
915 them), then make the struct symtab for that file and put it in the
918 END_ADDR is the address of the end of the file's text. SECTION is
919 the section number (in objfile->section_offsets) of the blockvector
922 Note that it is possible for end_symtab() to return NULL. In
923 particular, for the DWARF case at least, it will return NULL when
924 it finds a compilation unit that has exactly one DIE, a
925 TAG_compile_unit DIE. This can happen when we link in an object
926 file that was compiled from an empty source file. Returning NULL
927 is probably not the correct thing to do, because then gdb will
928 never know about this empty file (FIXME). */
931 end_symtab (CORE_ADDR end_addr
, struct objfile
*objfile
, int section
)
933 struct symtab
*symtab
= NULL
;
934 struct blockvector
*blockvector
;
935 struct subfile
*subfile
;
936 struct context_stack
*cstk
;
937 struct subfile
*nextsub
;
939 /* Finish the lexical context of the last function in the file; pop
940 the context stack. */
942 if (context_stack_depth
> 0)
944 cstk
= pop_context ();
945 /* Make a block for the local symbols within. */
946 finish_block (cstk
->name
, &local_symbols
, cstk
->old_blocks
,
947 cstk
->start_addr
, end_addr
, objfile
);
949 if (context_stack_depth
> 0)
951 /* This is said to happen with SCO. The old coffread.c
952 code simply emptied the context stack, so we do the
953 same. FIXME: Find out why it is happening. This is not
954 believed to happen in most cases (even for coffread.c);
955 it used to be an abort(). */
956 complaint (&symfile_complaints
,
957 _("Context stack not empty in end_symtab"));
958 context_stack_depth
= 0;
962 /* Reordered executables may have out of order pending blocks; if
963 OBJF_REORDERED is true, then sort the pending blocks. */
964 if ((objfile
->flags
& OBJF_REORDERED
) && pending_blocks
)
967 struct pending_block
*pb
;
968 struct block
**barray
, **bp
;
969 struct cleanup
*back_to
;
971 for (pb
= pending_blocks
; pb
!= NULL
; pb
= pb
->next
)
974 barray
= xmalloc (sizeof (*barray
) * count
);
975 back_to
= make_cleanup (xfree
, barray
);
978 for (pb
= pending_blocks
; pb
!= NULL
; pb
= pb
->next
)
981 qsort (barray
, count
, sizeof (*barray
), block_compar
);
984 for (pb
= pending_blocks
; pb
!= NULL
; pb
= pb
->next
)
987 do_cleanups (back_to
);
990 /* Cleanup any undefined types that have been left hanging around
991 (this needs to be done before the finish_blocks so that
992 file_symbols is still good).
994 Both cleanup_undefined_types and finish_global_stabs are stabs
995 specific, but harmless for other symbol readers, since on gdb
996 startup or when finished reading stabs, the state is set so these
997 are no-ops. FIXME: Is this handled right in case of QUIT? Can
998 we make this cleaner? */
1000 cleanup_undefined_types ();
1001 finish_global_stabs (objfile
);
1003 if (pending_blocks
== NULL
1004 && file_symbols
== NULL
1005 && global_symbols
== NULL
1006 && have_line_numbers
== 0
1007 && pending_macros
== NULL
)
1009 /* Ignore symtabs that have no functions with real debugging
1015 /* Define the STATIC_BLOCK & GLOBAL_BLOCK, and build the
1017 finish_block (0, &file_symbols
, 0, last_source_start_addr
, end_addr
,
1019 finish_block (0, &global_symbols
, 0, last_source_start_addr
, end_addr
,
1021 blockvector
= make_blockvector (objfile
);
1024 /* Read the line table if it has to be read separately. */
1025 if (objfile
->sf
->sym_read_linetable
!= NULL
)
1026 objfile
->sf
->sym_read_linetable ();
1028 /* Handle the case where the debug info specifies a different path
1029 for the main source file. It can cause us to lose track of its
1030 line number information. */
1031 watch_main_source_file_lossage ();
1033 /* Now create the symtab objects proper, one for each subfile. */
1034 /* (The main file is the last one on the chain.) */
1036 for (subfile
= subfiles
; subfile
; subfile
= nextsub
)
1038 int linetablesize
= 0;
1041 /* If we have blocks of symbols, make a symtab. Otherwise, just
1042 ignore this file and any line number info in it. */
1045 if (subfile
->line_vector
)
1047 linetablesize
= sizeof (struct linetable
) +
1048 subfile
->line_vector
->nitems
* sizeof (struct linetable_entry
);
1050 /* Like the pending blocks, the line table may be
1051 scrambled in reordered executables. Sort it if
1052 OBJF_REORDERED is true. */
1053 if (objfile
->flags
& OBJF_REORDERED
)
1054 qsort (subfile
->line_vector
->item
,
1055 subfile
->line_vector
->nitems
,
1056 sizeof (struct linetable_entry
), compare_line_numbers
);
1059 /* Now, allocate a symbol table. */
1060 if (subfile
->symtab
== NULL
)
1061 symtab
= allocate_symtab (subfile
->name
, objfile
);
1063 symtab
= subfile
->symtab
;
1065 /* Fill in its components. */
1066 symtab
->blockvector
= blockvector
;
1067 symtab
->macro_table
= pending_macros
;
1068 if (subfile
->line_vector
)
1070 /* Reallocate the line table on the symbol obstack */
1071 symtab
->linetable
= (struct linetable
*)
1072 obstack_alloc (&objfile
->objfile_obstack
, linetablesize
);
1073 memcpy (symtab
->linetable
, subfile
->line_vector
, linetablesize
);
1077 symtab
->linetable
= NULL
;
1079 symtab
->block_line_section
= section
;
1080 if (subfile
->dirname
)
1082 /* Reallocate the dirname on the symbol obstack */
1083 symtab
->dirname
= (char *)
1084 obstack_alloc (&objfile
->objfile_obstack
,
1085 strlen (subfile
->dirname
) + 1);
1086 strcpy (symtab
->dirname
, subfile
->dirname
);
1090 symtab
->dirname
= NULL
;
1092 symtab
->free_code
= free_linetable
;
1093 symtab
->free_func
= NULL
;
1095 /* Use whatever language we have been using for this
1096 subfile, not the one that was deduced in allocate_symtab
1097 from the filename. We already did our own deducing when
1098 we created the subfile, and we may have altered our
1099 opinion of what language it is from things we found in
1101 symtab
->language
= subfile
->language
;
1103 /* Save the debug format string (if any) in the symtab */
1104 if (subfile
->debugformat
!= NULL
)
1106 symtab
->debugformat
= obsavestring (subfile
->debugformat
,
1107 strlen (subfile
->debugformat
),
1108 &objfile
->objfile_obstack
);
1111 /* Similarly for the producer. */
1112 if (subfile
->producer
!= NULL
)
1113 symtab
->producer
= obsavestring (subfile
->producer
,
1114 strlen (subfile
->producer
),
1115 &objfile
->objfile_obstack
);
1117 /* All symtabs for the main file and the subfiles share a
1118 blockvector, so we need to clear primary for everything
1119 but the main file. */
1121 symtab
->primary
= 0;
1125 if (subfile
->symtab
)
1127 /* Since we are ignoring that subfile, we also need
1128 to unlink the associated empty symtab that we created.
1129 Otherwise, we can into trouble because various parts
1130 such as the block-vector are uninitialized whereas
1131 the rest of the code assumes that they are.
1133 We can only unlink the symtab because it was allocated
1134 on the objfile obstack. */
1137 if (objfile
->symtabs
== subfile
->symtab
)
1138 objfile
->symtabs
= objfile
->symtabs
->next
;
1140 ALL_OBJFILE_SYMTABS (objfile
, s
)
1141 if (s
->next
== subfile
->symtab
)
1143 s
->next
= s
->next
->next
;
1146 subfile
->symtab
= NULL
;
1149 if (subfile
->name
!= NULL
)
1151 xfree ((void *) subfile
->name
);
1153 if (subfile
->dirname
!= NULL
)
1155 xfree ((void *) subfile
->dirname
);
1157 if (subfile
->line_vector
!= NULL
)
1159 xfree ((void *) subfile
->line_vector
);
1161 if (subfile
->debugformat
!= NULL
)
1163 xfree ((void *) subfile
->debugformat
);
1165 if (subfile
->producer
!= NULL
)
1166 xfree (subfile
->producer
);
1168 nextsub
= subfile
->next
;
1169 xfree ((void *) subfile
);
1172 /* Set this for the main source file. */
1175 symtab
->primary
= 1;
1178 /* Default any symbols without a specified symtab to the primary
1184 for (block_i
= 0; block_i
< BLOCKVECTOR_NBLOCKS (blockvector
); block_i
++)
1186 struct block
*block
= BLOCKVECTOR_BLOCK (blockvector
, block_i
);
1188 struct dict_iterator iter
;
1190 for (sym
= dict_iterator_first (BLOCK_DICT (block
), &iter
);
1192 sym
= dict_iterator_next (&iter
))
1193 if (SYMBOL_SYMTAB (sym
) == NULL
)
1194 SYMBOL_SYMTAB (sym
) = symtab
;
1198 last_source_file
= NULL
;
1199 current_subfile
= NULL
;
1200 pending_macros
= NULL
;
1201 if (pending_addrmap
)
1203 obstack_free (&pending_addrmap_obstack
, NULL
);
1204 pending_addrmap
= NULL
;
1210 /* Push a context block. Args are an identifying nesting level
1211 (checkable when you pop it), and the starting PC address of this
1214 struct context_stack
*
1215 push_context (int desc
, CORE_ADDR valu
)
1217 struct context_stack
*new;
1219 if (context_stack_depth
== context_stack_size
)
1221 context_stack_size
*= 2;
1222 context_stack
= (struct context_stack
*)
1223 xrealloc ((char *) context_stack
,
1224 (context_stack_size
* sizeof (struct context_stack
)));
1227 new = &context_stack
[context_stack_depth
++];
1229 new->locals
= local_symbols
;
1230 new->params
= param_symbols
;
1231 new->old_blocks
= pending_blocks
;
1232 new->start_addr
= valu
;
1233 new->using_directives
= using_directives
;
1236 local_symbols
= NULL
;
1237 param_symbols
= NULL
;
1238 using_directives
= NULL
;
1243 /* Pop a context block. Returns the address of the context block just
1246 struct context_stack
*
1249 gdb_assert (context_stack_depth
> 0);
1250 return (&context_stack
[--context_stack_depth
]);
1255 /* Compute a small integer hash code for the given name. */
1258 hashname (char *name
)
1260 return (hash(name
,strlen(name
)) % HASHSIZE
);
1265 record_debugformat (char *format
)
1267 current_subfile
->debugformat
= xstrdup (format
);
1271 record_producer (const char *producer
)
1273 /* The producer is not always provided in the debugging info.
1274 Do nothing if PRODUCER is NULL. */
1275 if (producer
== NULL
)
1278 current_subfile
->producer
= xstrdup (producer
);
1281 /* Merge the first symbol list SRCLIST into the second symbol list
1282 TARGETLIST by repeated calls to add_symbol_to_list(). This
1283 procedure "frees" each link of SRCLIST by adding it to the
1284 free_pendings list. Caller must set SRCLIST to a null list after
1285 calling this function.
1290 merge_symbol_lists (struct pending
**srclist
, struct pending
**targetlist
)
1294 if (!srclist
|| !*srclist
)
1297 /* Merge in elements from current link. */
1298 for (i
= 0; i
< (*srclist
)->nsyms
; i
++)
1299 add_symbol_to_list ((*srclist
)->symbol
[i
], targetlist
);
1301 /* Recurse on next. */
1302 merge_symbol_lists (&(*srclist
)->next
, targetlist
);
1304 /* "Free" the current link. */
1305 (*srclist
)->next
= free_pendings
;
1306 free_pendings
= (*srclist
);
1309 /* Initialize anything that needs initializing when starting to read a
1310 fresh piece of a symbol file, e.g. reading in the stuff
1311 corresponding to a psymtab. */
1314 buildsym_init (void)
1316 free_pendings
= NULL
;
1317 file_symbols
= NULL
;
1318 global_symbols
= NULL
;
1319 pending_blocks
= NULL
;
1320 pending_macros
= NULL
;
1322 /* We shouldn't have any address map at this point. */
1323 gdb_assert (! pending_addrmap
);
1324 pending_addrmap_interesting
= 0;
1327 /* Initialize anything that needs initializing when a completely new
1328 symbol file is specified (not just adding some symbols from another
1329 file, e.g. a shared library). */
1332 buildsym_new_init (void)