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
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
;
151 /* Check to see if we might need to look for a mention of anonymous
154 if (SYMBOL_LANGUAGE (symbol
) == language_cplus
)
155 cp_scan_for_anonymous_namespaces (symbol
);
158 /* Find a symbol named NAME on a LIST. NAME need not be
159 '\0'-terminated; LENGTH is the length of the name. */
162 find_symbol_in_list (struct pending
*list
, char *name
, int length
)
169 for (j
= list
->nsyms
; --j
>= 0;)
171 pp
= DEPRECATED_SYMBOL_NAME (list
->symbol
[j
]);
172 if (*pp
== *name
&& strncmp (pp
, name
, length
) == 0 &&
175 return (list
->symbol
[j
]);
183 /* At end of reading syms, or in case of quit, really free as many
184 `struct pending's as we can easily find. */
187 really_free_pendings (void *dummy
)
189 struct pending
*next
, *next1
;
191 for (next
= free_pendings
; next
; next
= next1
)
194 xfree ((void *) next
);
196 free_pendings
= NULL
;
198 free_pending_blocks ();
200 for (next
= file_symbols
; next
!= NULL
; next
= next1
)
203 xfree ((void *) next
);
207 for (next
= global_symbols
; next
!= NULL
; next
= next1
)
210 xfree ((void *) next
);
212 global_symbols
= NULL
;
215 free_macro_table (pending_macros
);
219 obstack_free (&pending_addrmap_obstack
, NULL
);
220 pending_addrmap
= NULL
;
224 /* This function is called to discard any pending blocks. */
227 free_pending_blocks (void)
229 /* The links are made in the objfile_obstack, so we only need to
230 reset PENDING_BLOCKS. */
231 pending_blocks
= NULL
;
234 /* Take one of the lists of symbols and make a block from it. Keep
235 the order the symbols have in the list (reversed from the input
236 file). Put the block on the list of pending blocks. */
239 finish_block (struct symbol
*symbol
, struct pending
**listhead
,
240 struct pending_block
*old_blocks
,
241 CORE_ADDR start
, CORE_ADDR end
,
242 struct objfile
*objfile
)
244 struct pending
*next
, *next1
;
246 struct pending_block
*pblock
;
247 struct pending_block
*opblock
;
249 block
= allocate_block (&objfile
->objfile_obstack
);
253 BLOCK_DICT (block
) = dict_create_linear (&objfile
->objfile_obstack
,
258 BLOCK_DICT (block
) = dict_create_hashed (&objfile
->objfile_obstack
,
262 BLOCK_START (block
) = start
;
263 BLOCK_END (block
) = end
;
264 /* Superblock filled in when containing block is made */
265 BLOCK_SUPERBLOCK (block
) = NULL
;
266 BLOCK_NAMESPACE (block
) = NULL
;
268 /* Put the block in as the value of the symbol that names it. */
272 struct type
*ftype
= SYMBOL_TYPE (symbol
);
273 struct dict_iterator iter
;
274 SYMBOL_BLOCK_VALUE (symbol
) = block
;
275 BLOCK_FUNCTION (block
) = symbol
;
277 if (TYPE_NFIELDS (ftype
) <= 0)
279 /* No parameter type information is recorded with the
280 function's type. Set that from the type of the
281 parameter symbols. */
282 int nparams
= 0, iparams
;
284 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
286 if (SYMBOL_IS_ARGUMENT (sym
))
291 TYPE_NFIELDS (ftype
) = nparams
;
292 TYPE_FIELDS (ftype
) = (struct field
*)
293 TYPE_ALLOC (ftype
, nparams
* sizeof (struct field
));
296 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
298 if (iparams
== nparams
)
301 if (SYMBOL_IS_ARGUMENT (sym
))
303 TYPE_FIELD_TYPE (ftype
, iparams
) = SYMBOL_TYPE (sym
);
304 TYPE_FIELD_ARTIFICIAL (ftype
, iparams
) = 0;
311 /* If we're in the C++ case, set the block's scope. */
312 if (SYMBOL_LANGUAGE (symbol
) == language_cplus
)
314 cp_set_block_scope (symbol
, block
, &objfile
->objfile_obstack
);
319 BLOCK_FUNCTION (block
) = NULL
;
322 /* Now "free" the links of the list, and empty the list. */
324 for (next
= *listhead
; next
; next
= next1
)
327 next
->next
= free_pendings
;
328 free_pendings
= next
;
332 /* Check to be sure that the blocks have an end address that is
333 greater than starting address */
335 if (BLOCK_END (block
) < BLOCK_START (block
))
339 complaint (&symfile_complaints
,
340 _("block end address less than block start address in %s (patched it)"),
341 SYMBOL_PRINT_NAME (symbol
));
345 complaint (&symfile_complaints
,
346 _("block end address 0x%s less than block start address 0x%s (patched it)"),
347 paddr_nz (BLOCK_END (block
)), paddr_nz (BLOCK_START (block
)));
349 /* Better than nothing */
350 BLOCK_END (block
) = BLOCK_START (block
);
353 /* Install this block as the superblock of all blocks made since the
354 start of this scope that don't have superblocks yet. */
357 for (pblock
= pending_blocks
;
358 pblock
&& pblock
!= old_blocks
;
359 pblock
= pblock
->next
)
361 if (BLOCK_SUPERBLOCK (pblock
->block
) == NULL
)
363 /* Check to be sure the blocks are nested as we receive
364 them. If the compiler/assembler/linker work, this just
365 burns a small amount of time.
367 Skip blocks which correspond to a function; they're not
368 physically nested inside this other blocks, only
370 if (BLOCK_FUNCTION (pblock
->block
) == NULL
371 && (BLOCK_START (pblock
->block
) < BLOCK_START (block
)
372 || BLOCK_END (pblock
->block
) > BLOCK_END (block
)))
376 complaint (&symfile_complaints
,
377 _("inner block not inside outer block in %s"),
378 SYMBOL_PRINT_NAME (symbol
));
382 complaint (&symfile_complaints
,
383 _("inner block (0x%s-0x%s) not inside outer block (0x%s-0x%s)"),
384 paddr_nz (BLOCK_START (pblock
->block
)),
385 paddr_nz (BLOCK_END (pblock
->block
)),
386 paddr_nz (BLOCK_START (block
)),
387 paddr_nz (BLOCK_END (block
)));
389 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
))
390 BLOCK_START (pblock
->block
) = BLOCK_START (block
);
391 if (BLOCK_END (pblock
->block
) > BLOCK_END (block
))
392 BLOCK_END (pblock
->block
) = BLOCK_END (block
);
394 BLOCK_SUPERBLOCK (pblock
->block
) = block
;
399 record_pending_block (objfile
, block
, opblock
);
405 /* Record BLOCK on the list of all blocks in the file. Put it after
406 OPBLOCK, or at the beginning if opblock is NULL. This puts the
407 block in the list after all its subblocks.
409 Allocate the pending block struct in the objfile_obstack to save
410 time. This wastes a little space. FIXME: Is it worth it? */
413 record_pending_block (struct objfile
*objfile
, struct block
*block
,
414 struct pending_block
*opblock
)
416 struct pending_block
*pblock
;
418 pblock
= (struct pending_block
*)
419 obstack_alloc (&objfile
->objfile_obstack
, sizeof (struct pending_block
));
420 pblock
->block
= block
;
423 pblock
->next
= opblock
->next
;
424 opblock
->next
= pblock
;
428 pblock
->next
= pending_blocks
;
429 pending_blocks
= pblock
;
434 /* Record that the range of addresses from START to END_INCLUSIVE
435 (inclusive, like it says) belongs to BLOCK. BLOCK's start and end
436 addresses must be set already. You must apply this function to all
437 BLOCK's children before applying it to BLOCK.
439 If a call to this function complicates the picture beyond that
440 already provided by BLOCK_START and BLOCK_END, then we create an
441 address map for the block. */
443 record_block_range (struct block
*block
,
444 CORE_ADDR start
, CORE_ADDR end_inclusive
)
446 /* If this is any different from the range recorded in the block's
447 own BLOCK_START and BLOCK_END, then note that the address map has
448 become interesting. Note that even if this block doesn't have
449 any "interesting" ranges, some later block might, so we still
450 need to record this block in the addrmap. */
451 if (start
!= BLOCK_START (block
)
452 || end_inclusive
+ 1 != BLOCK_END (block
))
453 pending_addrmap_interesting
= 1;
455 if (! pending_addrmap
)
457 obstack_init (&pending_addrmap_obstack
);
458 pending_addrmap
= addrmap_create_mutable (&pending_addrmap_obstack
);
461 addrmap_set_empty (pending_addrmap
, start
, end_inclusive
, block
);
465 static struct blockvector
*
466 make_blockvector (struct objfile
*objfile
)
468 struct pending_block
*next
;
469 struct blockvector
*blockvector
;
472 /* Count the length of the list of blocks. */
474 for (next
= pending_blocks
, i
= 0; next
; next
= next
->next
, i
++)
478 blockvector
= (struct blockvector
*)
479 obstack_alloc (&objfile
->objfile_obstack
,
480 (sizeof (struct blockvector
)
481 + (i
- 1) * sizeof (struct block
*)));
483 /* Copy the blocks into the blockvector. This is done in reverse
484 order, which happens to put the blocks into the proper order
485 (ascending starting address). finish_block has hair to insert
486 each block into the list after its subblocks in order to make
487 sure this is true. */
489 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
490 for (next
= pending_blocks
; next
; next
= next
->next
)
492 BLOCKVECTOR_BLOCK (blockvector
, --i
) = next
->block
;
495 free_pending_blocks ();
497 /* If we needed an address map for this symtab, record it in the
499 if (pending_addrmap
&& pending_addrmap_interesting
)
500 BLOCKVECTOR_MAP (blockvector
)
501 = addrmap_create_fixed (pending_addrmap
, &objfile
->objfile_obstack
);
503 BLOCKVECTOR_MAP (blockvector
) = 0;
505 /* Some compilers output blocks in the wrong order, but we depend on
506 their being in the right order so we can binary search. Check the
507 order and moan about it. */
508 if (BLOCKVECTOR_NBLOCKS (blockvector
) > 1)
510 for (i
= 1; i
< BLOCKVECTOR_NBLOCKS (blockvector
); i
++)
512 if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
- 1))
513 > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
)))
516 = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
));
518 complaint (&symfile_complaints
, _("block at %s out of order"),
519 hex_string ((LONGEST
) start
));
524 return (blockvector
);
527 /* Start recording information about source code that came from an
528 included (or otherwise merged-in) source file with a different
529 name. NAME is the name of the file (cannot be NULL), DIRNAME is
530 the directory in which the file was compiled (or NULL if not known). */
533 start_subfile (char *name
, char *dirname
)
535 struct subfile
*subfile
;
537 /* See if this subfile is already known as a subfile of the current
540 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
544 /* If NAME is an absolute path, and this subfile is not, then
545 attempt to create an absolute path to compare. */
546 if (IS_ABSOLUTE_PATH (name
)
547 && !IS_ABSOLUTE_PATH (subfile
->name
)
548 && subfile
->dirname
!= NULL
)
549 subfile_name
= concat (subfile
->dirname
, SLASH_STRING
,
550 subfile
->name
, NULL
);
552 subfile_name
= subfile
->name
;
554 if (FILENAME_CMP (subfile_name
, name
) == 0)
556 current_subfile
= subfile
;
557 if (subfile_name
!= subfile
->name
)
558 xfree (subfile_name
);
561 if (subfile_name
!= subfile
->name
)
562 xfree (subfile_name
);
565 /* This subfile is not known. Add an entry for it. Make an entry
566 for this subfile in the list of all subfiles of the current main
569 subfile
= (struct subfile
*) xmalloc (sizeof (struct subfile
));
570 memset ((char *) subfile
, 0, sizeof (struct subfile
));
571 subfile
->next
= subfiles
;
573 current_subfile
= subfile
;
575 /* Save its name and compilation directory name */
576 subfile
->name
= (name
== NULL
) ? NULL
: savestring (name
, strlen (name
));
578 (dirname
== NULL
) ? NULL
: savestring (dirname
, strlen (dirname
));
580 /* Initialize line-number recording for this subfile. */
581 subfile
->line_vector
= NULL
;
583 /* Default the source language to whatever can be deduced from the
584 filename. If nothing can be deduced (such as for a C/C++ include
585 file with a ".h" extension), then inherit whatever language the
586 previous subfile had. This kludgery is necessary because there
587 is no standard way in some object formats to record the source
588 language. Also, when symtabs are allocated we try to deduce a
589 language then as well, but it is too late for us to use that
590 information while reading symbols, since symtabs aren't allocated
591 until after all the symbols have been processed for a given
594 subfile
->language
= deduce_language_from_filename (subfile
->name
);
595 if (subfile
->language
== language_unknown
&&
596 subfile
->next
!= NULL
)
598 subfile
->language
= subfile
->next
->language
;
601 /* Initialize the debug format string to NULL. We may supply it
602 later via a call to record_debugformat. */
603 subfile
->debugformat
= NULL
;
605 /* Similarly for the producer. */
606 subfile
->producer
= NULL
;
608 /* If the filename of this subfile ends in .C, then change the
609 language of any pending subfiles from C to C++. We also accept
610 any other C++ suffixes accepted by deduce_language_from_filename. */
611 /* Likewise for f2c. */
616 enum language sublang
= deduce_language_from_filename (subfile
->name
);
618 if (sublang
== language_cplus
|| sublang
== language_fortran
)
619 for (s
= subfiles
; s
!= NULL
; s
= s
->next
)
620 if (s
->language
== language_c
)
621 s
->language
= sublang
;
624 /* And patch up this file if necessary. */
625 if (subfile
->language
== language_c
626 && subfile
->next
!= NULL
627 && (subfile
->next
->language
== language_cplus
628 || subfile
->next
->language
== language_fortran
))
630 subfile
->language
= subfile
->next
->language
;
634 /* For stabs readers, the first N_SO symbol is assumed to be the
635 source file name, and the subfile struct is initialized using that
636 assumption. If another N_SO symbol is later seen, immediately
637 following the first one, then the first one is assumed to be the
638 directory name and the second one is really the source file name.
640 So we have to patch up the subfile struct by moving the old name
641 value to dirname and remembering the new name. Some sanity
642 checking is performed to ensure that the state of the subfile
643 struct is reasonable and that the old name we are assuming to be a
644 directory name actually is (by checking for a trailing '/'). */
647 patch_subfile_names (struct subfile
*subfile
, char *name
)
649 if (subfile
!= NULL
&& subfile
->dirname
== NULL
&& subfile
->name
!= NULL
650 && subfile
->name
[strlen (subfile
->name
) - 1] == '/')
652 subfile
->dirname
= subfile
->name
;
653 subfile
->name
= savestring (name
, strlen (name
));
654 last_source_file
= name
;
656 /* Default the source language to whatever can be deduced from
657 the filename. If nothing can be deduced (such as for a C/C++
658 include file with a ".h" extension), then inherit whatever
659 language the previous subfile had. This kludgery is
660 necessary because there is no standard way in some object
661 formats to record the source language. Also, when symtabs
662 are allocated we try to deduce a language then as well, but
663 it is too late for us to use that information while reading
664 symbols, since symtabs aren't allocated until after all the
665 symbols have been processed for a given source file. */
667 subfile
->language
= deduce_language_from_filename (subfile
->name
);
668 if (subfile
->language
== language_unknown
&&
669 subfile
->next
!= NULL
)
671 subfile
->language
= subfile
->next
->language
;
676 /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
677 switching source files (different subfiles, as we call them) within
678 one object file, but using a stack rather than in an arbitrary
684 struct subfile_stack
*tem
685 = (struct subfile_stack
*) xmalloc (sizeof (struct subfile_stack
));
687 tem
->next
= subfile_stack
;
689 if (current_subfile
== NULL
|| current_subfile
->name
== NULL
)
691 internal_error (__FILE__
, __LINE__
, _("failed internal consistency check"));
693 tem
->name
= current_subfile
->name
;
700 struct subfile_stack
*link
= subfile_stack
;
704 internal_error (__FILE__
, __LINE__
, _("failed internal consistency check"));
707 subfile_stack
= link
->next
;
708 xfree ((void *) link
);
712 /* Add a linetable entry for line number LINE and address PC to the
713 line vector for SUBFILE. */
716 record_line (struct subfile
*subfile
, int line
, CORE_ADDR pc
)
718 struct linetable_entry
*e
;
719 /* Ignore the dummy line number in libg.o */
726 /* Make sure line vector exists and is big enough. */
727 if (!subfile
->line_vector
)
729 subfile
->line_vector_length
= INITIAL_LINE_VECTOR_LENGTH
;
730 subfile
->line_vector
= (struct linetable
*)
731 xmalloc (sizeof (struct linetable
)
732 + subfile
->line_vector_length
* sizeof (struct linetable_entry
));
733 subfile
->line_vector
->nitems
= 0;
734 have_line_numbers
= 1;
737 if (subfile
->line_vector
->nitems
+ 1 >= subfile
->line_vector_length
)
739 subfile
->line_vector_length
*= 2;
740 subfile
->line_vector
= (struct linetable
*)
741 xrealloc ((char *) subfile
->line_vector
,
742 (sizeof (struct linetable
)
743 + (subfile
->line_vector_length
744 * sizeof (struct linetable_entry
))));
747 pc
= gdbarch_addr_bits_remove (current_gdbarch
, pc
);
749 /* Normally, we treat lines as unsorted. But the end of sequence
750 marker is special. We sort line markers at the same PC by line
751 number, so end of sequence markers (which have line == 0) appear
752 first. This is right if the marker ends the previous function,
753 and there is no padding before the next function. But it is
754 wrong if the previous line was empty and we are now marking a
755 switch to a different subfile. We must leave the end of sequence
756 marker at the end of this group of lines, not sort the empty line
757 to after the marker. The easiest way to accomplish this is to
758 delete any empty lines from our table, if they are followed by
759 end of sequence markers. All we lose is the ability to set
760 breakpoints at some lines which contain no instructions
762 if (line
== 0 && subfile
->line_vector
->nitems
> 0)
764 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
- 1;
765 while (subfile
->line_vector
->nitems
> 0 && e
->pc
== pc
)
768 subfile
->line_vector
->nitems
--;
772 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
++;
777 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
780 compare_line_numbers (const void *ln1p
, const void *ln2p
)
782 struct linetable_entry
*ln1
= (struct linetable_entry
*) ln1p
;
783 struct linetable_entry
*ln2
= (struct linetable_entry
*) ln2p
;
785 /* Note: this code does not assume that CORE_ADDRs can fit in ints.
786 Please keep it that way. */
787 if (ln1
->pc
< ln2
->pc
)
790 if (ln1
->pc
> ln2
->pc
)
793 /* If pc equal, sort by line. I'm not sure whether this is optimum
794 behavior (see comment at struct linetable in symtab.h). */
795 return ln1
->line
- ln2
->line
;
798 /* Start a new symtab for a new source file. Called, for example,
799 when a stabs symbol of type N_SO is seen, or when a DWARF
800 TAG_compile_unit DIE is seen. It indicates the start of data for
801 one original source file.
803 NAME is the name of the file (cannot be NULL). DIRNAME is the directory in
804 which the file was compiled (or NULL if not known). START_ADDR is the
805 lowest address of objects in the file (or 0 if not known). */
808 start_symtab (char *name
, char *dirname
, CORE_ADDR start_addr
)
810 last_source_file
= name
;
811 last_source_start_addr
= start_addr
;
813 global_symbols
= NULL
;
815 have_line_numbers
= 0;
817 /* Context stack is initially empty. Allocate first one with room
818 for 10 levels; reuse it forever afterward. */
819 if (context_stack
== NULL
)
821 context_stack_size
= INITIAL_CONTEXT_STACK_SIZE
;
822 context_stack
= (struct context_stack
*)
823 xmalloc (context_stack_size
* sizeof (struct context_stack
));
825 context_stack_depth
= 0;
827 /* We shouldn't have any address map at this point. */
828 gdb_assert (! pending_addrmap
);
830 /* Set up support for C++ namespace support, in case we need it. */
832 cp_initialize_namespace ();
834 /* Initialize the list of sub source files with one entry for this
835 file (the top-level source file). */
838 current_subfile
= NULL
;
839 start_subfile (name
, dirname
);
842 /* Subroutine of end_symtab to simplify it.
843 Look for a subfile that matches the main source file's basename.
844 If there is only one, and if the main source file doesn't have any
845 symbol or line number information, then copy this file's symtab and
846 line_vector to the main source file's subfile and discard the other subfile.
847 This can happen because of a compiler bug or from the user playing games
848 with #line or from things like a distributed build system that manipulates
852 watch_main_source_file_lossage (void)
854 struct subfile
*mainsub
, *subfile
;
856 /* Find the main source file.
857 This loop could be eliminated if start_symtab saved it for us. */
859 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
861 /* The main subfile is guaranteed to be the last one. */
862 if (subfile
->next
== NULL
)
866 /* If the main source file doesn't have any line number or symbol info,
867 look for an alias in another subfile.
868 We have to watch for mainsub == NULL here. It's a quirk of end_symtab,
869 it can return NULL so there may not be a main subfile. */
872 && mainsub
->line_vector
== NULL
873 && mainsub
->symtab
== NULL
)
875 const char *mainbase
= lbasename (mainsub
->name
);
877 struct subfile
*prevsub
;
878 struct subfile
*mainsub_alias
= NULL
;
879 struct subfile
*prev_mainsub_alias
= NULL
;
882 for (subfile
= subfiles
;
883 /* Stop before we get to the last one. */
885 subfile
= subfile
->next
)
887 if (strcmp (lbasename (subfile
->name
), mainbase
) == 0)
890 mainsub_alias
= subfile
;
891 prev_mainsub_alias
= prevsub
;
898 gdb_assert (mainsub_alias
!= NULL
&& mainsub_alias
!= mainsub
);
900 /* Found a match for the main source file.
901 Copy its line_vector and symtab to the main subfile
902 and then discard it. */
904 mainsub
->line_vector
= mainsub_alias
->line_vector
;
905 mainsub
->line_vector_length
= mainsub_alias
->line_vector_length
;
906 mainsub
->symtab
= mainsub_alias
->symtab
;
908 if (prev_mainsub_alias
== NULL
)
909 subfiles
= mainsub_alias
->next
;
911 prev_mainsub_alias
->next
= mainsub_alias
->next
;
912 xfree (mainsub_alias
);
917 /* Finish the symbol definitions for one main source file, close off
918 all the lexical contexts for that file (creating struct block's for
919 them), then make the struct symtab for that file and put it in the
922 END_ADDR is the address of the end of the file's text. SECTION is
923 the section number (in objfile->section_offsets) of the blockvector
926 Note that it is possible for end_symtab() to return NULL. In
927 particular, for the DWARF case at least, it will return NULL when
928 it finds a compilation unit that has exactly one DIE, a
929 TAG_compile_unit DIE. This can happen when we link in an object
930 file that was compiled from an empty source file. Returning NULL
931 is probably not the correct thing to do, because then gdb will
932 never know about this empty file (FIXME). */
935 end_symtab (CORE_ADDR end_addr
, struct objfile
*objfile
, int section
)
937 struct symtab
*symtab
= NULL
;
938 struct blockvector
*blockvector
;
939 struct subfile
*subfile
;
940 struct context_stack
*cstk
;
941 struct subfile
*nextsub
;
943 /* Finish the lexical context of the last function in the file; pop
944 the context stack. */
946 if (context_stack_depth
> 0)
948 cstk
= pop_context ();
949 /* Make a block for the local symbols within. */
950 finish_block (cstk
->name
, &local_symbols
, cstk
->old_blocks
,
951 cstk
->start_addr
, end_addr
, objfile
);
953 if (context_stack_depth
> 0)
955 /* This is said to happen with SCO. The old coffread.c
956 code simply emptied the context stack, so we do the
957 same. FIXME: Find out why it is happening. This is not
958 believed to happen in most cases (even for coffread.c);
959 it used to be an abort(). */
960 complaint (&symfile_complaints
,
961 _("Context stack not empty in end_symtab"));
962 context_stack_depth
= 0;
966 /* Reordered executables may have out of order pending blocks; if
967 OBJF_REORDERED is true, then sort the pending blocks. */
968 if ((objfile
->flags
& OBJF_REORDERED
) && pending_blocks
)
970 /* FIXME! Remove this horrid bubble sort and use merge sort!!! */
974 struct pending_block
*pb
, *pbnext
;
982 /* swap blocks if unordered! */
984 if (BLOCK_START (pb
->block
) < BLOCK_START (pbnext
->block
))
986 struct block
*tmp
= pb
->block
;
987 pb
->block
= pbnext
->block
;
992 pbnext
= pbnext
->next
;
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 ();
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
, end_addr
,
1027 finish_block (0, &global_symbols
, 0, last_source_start_addr
, end_addr
,
1029 blockvector
= make_blockvector (objfile
);
1030 cp_finalize_namespace (BLOCKVECTOR_BLOCK (blockvector
, STATIC_BLOCK
),
1031 &objfile
->objfile_obstack
);
1034 /* Read the line table if it has to be read separately. */
1035 if (objfile
->sf
->sym_read_linetable
!= NULL
)
1036 objfile
->sf
->sym_read_linetable ();
1038 /* Handle the case where the debug info specifies a different path
1039 for the main source file. It can cause us to lose track of its
1040 line number information. */
1041 watch_main_source_file_lossage ();
1043 /* Now create the symtab objects proper, one for each subfile. */
1044 /* (The main file is the last one on the chain.) */
1046 for (subfile
= subfiles
; subfile
; subfile
= nextsub
)
1048 int linetablesize
= 0;
1051 /* If we have blocks of symbols, make a symtab. Otherwise, just
1052 ignore this file and any line number info in it. */
1055 if (subfile
->line_vector
)
1057 linetablesize
= sizeof (struct linetable
) +
1058 subfile
->line_vector
->nitems
* sizeof (struct linetable_entry
);
1060 /* Like the pending blocks, the line table may be
1061 scrambled in reordered executables. Sort it if
1062 OBJF_REORDERED is true. */
1063 if (objfile
->flags
& OBJF_REORDERED
)
1064 qsort (subfile
->line_vector
->item
,
1065 subfile
->line_vector
->nitems
,
1066 sizeof (struct linetable_entry
), compare_line_numbers
);
1069 /* Now, allocate a symbol table. */
1070 if (subfile
->symtab
== NULL
)
1071 symtab
= allocate_symtab (subfile
->name
, objfile
);
1073 symtab
= subfile
->symtab
;
1075 /* Fill in its components. */
1076 symtab
->blockvector
= blockvector
;
1077 symtab
->macro_table
= pending_macros
;
1078 if (subfile
->line_vector
)
1080 /* Reallocate the line table on the symbol obstack */
1081 symtab
->linetable
= (struct linetable
*)
1082 obstack_alloc (&objfile
->objfile_obstack
, linetablesize
);
1083 memcpy (symtab
->linetable
, subfile
->line_vector
, linetablesize
);
1087 symtab
->linetable
= NULL
;
1089 symtab
->block_line_section
= section
;
1090 if (subfile
->dirname
)
1092 /* Reallocate the dirname on the symbol obstack */
1093 symtab
->dirname
= (char *)
1094 obstack_alloc (&objfile
->objfile_obstack
,
1095 strlen (subfile
->dirname
) + 1);
1096 strcpy (symtab
->dirname
, subfile
->dirname
);
1100 symtab
->dirname
= NULL
;
1102 symtab
->free_code
= free_linetable
;
1103 symtab
->free_func
= NULL
;
1105 /* Use whatever language we have been using for this
1106 subfile, not the one that was deduced in allocate_symtab
1107 from the filename. We already did our own deducing when
1108 we created the subfile, and we may have altered our
1109 opinion of what language it is from things we found in
1111 symtab
->language
= subfile
->language
;
1113 /* Save the debug format string (if any) in the symtab */
1114 if (subfile
->debugformat
!= NULL
)
1116 symtab
->debugformat
= obsavestring (subfile
->debugformat
,
1117 strlen (subfile
->debugformat
),
1118 &objfile
->objfile_obstack
);
1121 /* Similarly for the producer. */
1122 if (subfile
->producer
!= NULL
)
1123 symtab
->producer
= obsavestring (subfile
->producer
,
1124 strlen (subfile
->producer
),
1125 &objfile
->objfile_obstack
);
1127 /* All symtabs for the main file and the subfiles share a
1128 blockvector, so we need to clear primary for everything
1129 but the main file. */
1131 symtab
->primary
= 0;
1133 if (subfile
->name
!= NULL
)
1135 xfree ((void *) subfile
->name
);
1137 if (subfile
->dirname
!= NULL
)
1139 xfree ((void *) subfile
->dirname
);
1141 if (subfile
->line_vector
!= NULL
)
1143 xfree ((void *) subfile
->line_vector
);
1145 if (subfile
->debugformat
!= NULL
)
1147 xfree ((void *) subfile
->debugformat
);
1149 if (subfile
->producer
!= NULL
)
1150 xfree (subfile
->producer
);
1152 nextsub
= subfile
->next
;
1153 xfree ((void *) subfile
);
1156 /* Set this for the main source file. */
1159 symtab
->primary
= 1;
1162 /* Default any symbols without a specified symtab to the primary
1168 for (block_i
= 0; block_i
< BLOCKVECTOR_NBLOCKS (blockvector
); block_i
++)
1170 struct block
*block
= BLOCKVECTOR_BLOCK (blockvector
, block_i
);
1172 struct dict_iterator iter
;
1174 for (sym
= dict_iterator_first (BLOCK_DICT (block
), &iter
);
1176 sym
= dict_iterator_next (&iter
))
1177 if (SYMBOL_SYMTAB (sym
) == NULL
)
1178 SYMBOL_SYMTAB (sym
) = symtab
;
1182 last_source_file
= NULL
;
1183 current_subfile
= NULL
;
1184 pending_macros
= NULL
;
1185 if (pending_addrmap
)
1187 obstack_free (&pending_addrmap_obstack
, NULL
);
1188 pending_addrmap
= NULL
;
1194 /* Push a context block. Args are an identifying nesting level
1195 (checkable when you pop it), and the starting PC address of this
1198 struct context_stack
*
1199 push_context (int desc
, CORE_ADDR valu
)
1201 struct context_stack
*new;
1203 if (context_stack_depth
== context_stack_size
)
1205 context_stack_size
*= 2;
1206 context_stack
= (struct context_stack
*)
1207 xrealloc ((char *) context_stack
,
1208 (context_stack_size
* sizeof (struct context_stack
)));
1211 new = &context_stack
[context_stack_depth
++];
1213 new->locals
= local_symbols
;
1214 new->params
= param_symbols
;
1215 new->old_blocks
= pending_blocks
;
1216 new->start_addr
= valu
;
1219 local_symbols
= NULL
;
1220 param_symbols
= NULL
;
1225 /* Pop a context block. Returns the address of the context block just
1228 struct context_stack
*
1231 gdb_assert (context_stack_depth
> 0);
1232 return (&context_stack
[--context_stack_depth
]);
1237 /* Compute a small integer hash code for the given name. */
1240 hashname (char *name
)
1242 return (hash(name
,strlen(name
)) % HASHSIZE
);
1247 record_debugformat (char *format
)
1249 current_subfile
->debugformat
= savestring (format
, strlen (format
));
1253 record_producer (const char *producer
)
1255 /* The producer is not always provided in the debugging info.
1256 Do nothing if PRODUCER is NULL. */
1257 if (producer
== NULL
)
1260 current_subfile
->producer
= savestring (producer
, strlen (producer
));
1263 /* Merge the first symbol list SRCLIST into the second symbol list
1264 TARGETLIST by repeated calls to add_symbol_to_list(). This
1265 procedure "frees" each link of SRCLIST by adding it to the
1266 free_pendings list. Caller must set SRCLIST to a null list after
1267 calling this function.
1272 merge_symbol_lists (struct pending
**srclist
, struct pending
**targetlist
)
1276 if (!srclist
|| !*srclist
)
1279 /* Merge in elements from current link. */
1280 for (i
= 0; i
< (*srclist
)->nsyms
; i
++)
1281 add_symbol_to_list ((*srclist
)->symbol
[i
], targetlist
);
1283 /* Recurse on next. */
1284 merge_symbol_lists (&(*srclist
)->next
, targetlist
);
1286 /* "Free" the current link. */
1287 (*srclist
)->next
= free_pendings
;
1288 free_pendings
= (*srclist
);
1291 /* Initialize anything that needs initializing when starting to read a
1292 fresh piece of a symbol file, e.g. reading in the stuff
1293 corresponding to a psymtab. */
1296 buildsym_init (void)
1298 free_pendings
= NULL
;
1299 file_symbols
= NULL
;
1300 global_symbols
= NULL
;
1301 pending_blocks
= NULL
;
1302 pending_macros
= NULL
;
1304 /* We shouldn't have any address map at this point. */
1305 gdb_assert (! pending_addrmap
);
1306 pending_addrmap_interesting
= 0;
1309 /* Initialize anything that needs initializing when a completely new
1310 symbol file is specified (not just adding some symbols from another
1311 file, e.g. a shared library). */
1314 buildsym_new_init (void)