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 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 /* This module provides subroutines used for creating and adding to
23 the symbol table. These routines are called from various symbol-
24 file-reading routines.
26 Routines to support specific debugging information formats (stabs,
27 DWARF, etc) belong somewhere else. */
31 #include "gdb_obstack.h"
36 #include "gdb_assert.h"
37 #include "complaints.h"
38 #include "gdb_string.h"
39 #include "expression.h" /* For "enum exp_opcode" used by... */
40 #include "language.h" /* For "local_hex_string" */
42 #include "filenames.h" /* For DOSish file names */
44 #include "demangle.h" /* Needed by SYMBOL_INIT_DEMANGLED_NAME. */
45 /* Ask buildsym.h to define the vars it normally declares `extern'. */
48 #include "buildsym.h" /* Our own declarations */
51 /* For cleanup_undefined_types and finish_global_stabs (somewhat
52 questionable--see comment where we call them). */
54 #include "stabsread.h"
56 /* List of free `struct pending' structures for reuse. */
58 static struct pending
*free_pendings
;
60 /* Non-zero if symtab has line number info. This prevents an
61 otherwise empty symtab from being tossed. */
63 static int have_line_numbers
;
65 static int compare_line_numbers (const void *ln1p
, const void *ln2p
);
68 /* Initial sizes of data structures. These are realloc'd larger if
69 needed, and realloc'd down to the size actually used, when
72 #define INITIAL_CONTEXT_STACK_SIZE 10
73 #define INITIAL_LINE_VECTOR_LENGTH 1000
76 /* maintain the lists of symbols and blocks */
78 /* Add a pending list to free_pendings. */
80 add_free_pendings (struct pending
*list
)
82 register struct pending
*link
= list
;
86 while (link
->next
) link
= link
->next
;
87 link
->next
= free_pendings
;
92 /* Add a symbol to one of the lists of symbols. */
95 add_symbol_to_list (struct symbol
*symbol
, struct pending
**listhead
)
97 register struct pending
*link
;
99 /* If this is an alias for another symbol, don't add it. */
100 if (symbol
->ginfo
.name
&& symbol
->ginfo
.name
[0] == '#')
103 /* We keep PENDINGSIZE symbols in each link of the list. If we
104 don't have a link with room in it, add a new link. */
105 if (*listhead
== NULL
|| (*listhead
)->nsyms
== PENDINGSIZE
)
109 link
= free_pendings
;
110 free_pendings
= link
->next
;
114 link
= (struct pending
*) xmalloc (sizeof (struct pending
));
117 link
->next
= *listhead
;
122 (*listhead
)->symbol
[(*listhead
)->nsyms
++] = symbol
;
125 /* Find a symbol named NAME on a LIST. NAME need not be
126 '\0'-terminated; LENGTH is the length of the name. */
129 find_symbol_in_list (struct pending
*list
, char *name
, int length
)
136 for (j
= list
->nsyms
; --j
>= 0;)
138 pp
= SYMBOL_NAME (list
->symbol
[j
]);
139 if (*pp
== *name
&& strncmp (pp
, name
, length
) == 0 &&
142 return (list
->symbol
[j
]);
150 /* At end of reading syms, or in case of quit, really free as many
151 `struct pending's as we can easily find. */
155 really_free_pendings (PTR dummy
)
157 struct pending
*next
, *next1
;
159 for (next
= free_pendings
; next
; next
= next1
)
162 xfree ((void *) next
);
164 free_pendings
= NULL
;
166 free_pending_blocks ();
168 for (next
= file_symbols
; next
!= NULL
; next
= next1
)
171 xfree ((void *) next
);
175 for (next
= global_symbols
; next
!= NULL
; next
= next1
)
178 xfree ((void *) next
);
180 global_symbols
= NULL
;
183 free_macro_table (pending_macros
);
186 /* This function is called to discard any pending blocks. */
189 free_pending_blocks (void)
191 #if 0 /* Now we make the links in the
192 symbol_obstack, so don't free
194 struct pending_block
*bnext
, *bnext1
;
196 for (bnext
= pending_blocks
; bnext
; bnext
= bnext1
)
198 bnext1
= bnext
->next
;
199 xfree ((void *) bnext
);
202 pending_blocks
= NULL
;
205 /* Take one of the lists of symbols and make a block from it. Keep
206 the order the symbols have in the list (reversed from the input
207 file). Put the block on the list of pending blocks. */
210 finish_block (struct symbol
*symbol
, struct pending
**listhead
,
211 struct pending_block
*old_blocks
,
212 CORE_ADDR start
, CORE_ADDR end
,
213 struct objfile
*objfile
)
215 register struct pending
*next
, *next1
;
216 register struct block
*block
;
217 register struct pending_block
*pblock
;
218 struct pending_block
*opblock
;
222 /* Count the length of the list of symbols. */
224 for (next
= *listhead
, i
= 0;
226 i
+= next
->nsyms
, next
= next
->next
)
231 /* Copy the symbols into the block. */
235 block
= (struct block
*)
236 obstack_alloc (&objfile
->symbol_obstack
,
237 (sizeof (struct block
) +
238 ((i
- 1) * sizeof (struct symbol
*))));
239 BLOCK_NSYMS (block
) = i
;
240 for (next
= *listhead
; next
; next
= next
->next
)
241 for (j
= next
->nsyms
- 1; j
>= 0; j
--)
243 BLOCK_SYM (block
, --i
) = next
->symbol
[j
];
248 int htab_size
= BLOCK_HASHTABLE_SIZE (i
);
250 block
= (struct block
*)
251 obstack_alloc (&objfile
->symbol_obstack
,
252 (sizeof (struct block
) +
253 ((htab_size
- 1) * sizeof (struct symbol
*))));
254 for (j
= 0; j
< htab_size
; j
++)
256 BLOCK_BUCKET (block
, j
) = 0;
258 BLOCK_BUCKETS (block
) = htab_size
;
259 for (next
= *listhead
; next
; next
= next
->next
)
261 for (j
= next
->nsyms
- 1; j
>= 0; j
--)
264 unsigned int hash_index
;
265 const char *name
= SYMBOL_DEMANGLED_NAME (next
->symbol
[j
]);
267 name
= SYMBOL_NAME (next
->symbol
[j
]);
268 hash_index
= msymbol_hash_iw (name
);
269 hash_index
= hash_index
% BLOCK_BUCKETS (block
);
270 sym
= BLOCK_BUCKET (block
, hash_index
);
271 BLOCK_BUCKET (block
, hash_index
) = next
->symbol
[j
];
272 next
->symbol
[j
]->hash_next
= sym
;
277 BLOCK_START (block
) = start
;
278 BLOCK_END (block
) = end
;
279 /* Superblock filled in when containing block is made */
280 BLOCK_SUPERBLOCK (block
) = NULL
;
282 BLOCK_GCC_COMPILED (block
) = processing_gcc_compilation
;
284 /* Put the block in as the value of the symbol that names it. */
288 struct type
*ftype
= SYMBOL_TYPE (symbol
);
289 SYMBOL_BLOCK_VALUE (symbol
) = block
;
290 BLOCK_FUNCTION (block
) = symbol
;
291 BLOCK_HASHTABLE (block
) = 0;
293 if (TYPE_NFIELDS (ftype
) <= 0)
295 /* No parameter type information is recorded with the
296 function's type. Set that from the type of the
297 parameter symbols. */
298 int nparams
= 0, iparams
;
300 ALL_BLOCK_SYMBOLS (block
, i
, sym
)
302 switch (SYMBOL_CLASS (sym
))
307 case LOC_REGPARM_ADDR
:
308 case LOC_BASEREG_ARG
:
321 case LOC_CONST_BYTES
:
324 case LOC_OPTIMIZED_OUT
:
331 TYPE_NFIELDS (ftype
) = nparams
;
332 TYPE_FIELDS (ftype
) = (struct field
*)
333 TYPE_ALLOC (ftype
, nparams
* sizeof (struct field
));
335 for (i
= iparams
= 0; iparams
< nparams
; i
++)
337 sym
= BLOCK_SYM (block
, i
);
338 switch (SYMBOL_CLASS (sym
))
343 case LOC_REGPARM_ADDR
:
344 case LOC_BASEREG_ARG
:
346 TYPE_FIELD_TYPE (ftype
, iparams
) = SYMBOL_TYPE (sym
);
347 TYPE_FIELD_ARTIFICIAL (ftype
, iparams
) = 0;
359 case LOC_CONST_BYTES
:
362 case LOC_OPTIMIZED_OUT
:
372 BLOCK_FUNCTION (block
) = NULL
;
373 BLOCK_HASHTABLE (block
) = 1;
376 /* Now "free" the links of the list, and empty the list. */
378 for (next
= *listhead
; next
; next
= next1
)
381 next
->next
= free_pendings
;
382 free_pendings
= next
;
387 /* Check to be sure that the blocks have an end address that is
388 greater than starting address */
390 if (BLOCK_END (block
) < BLOCK_START (block
))
394 complaint (&symfile_complaints
,
395 "block end address less than block start address in %s (patched it)",
396 SYMBOL_SOURCE_NAME (symbol
));
400 complaint (&symfile_complaints
,
401 "block end address 0x%s less than block start address 0x%s (patched it)",
402 paddr_nz (BLOCK_END (block
)), paddr_nz (BLOCK_START (block
)));
404 /* Better than nothing */
405 BLOCK_END (block
) = BLOCK_START (block
);
409 /* Install this block as the superblock of all blocks made since the
410 start of this scope that don't have superblocks yet. */
413 for (pblock
= pending_blocks
;
414 pblock
&& pblock
!= old_blocks
;
415 pblock
= pblock
->next
)
417 if (BLOCK_SUPERBLOCK (pblock
->block
) == NULL
)
420 /* Check to be sure the blocks are nested as we receive
421 them. If the compiler/assembler/linker work, this just
422 burns a small amount of time. */
423 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
) ||
424 BLOCK_END (pblock
->block
) > BLOCK_END (block
))
428 complaint (&symfile_complaints
,
429 "inner block not inside outer block in %s",
430 SYMBOL_SOURCE_NAME (symbol
));
434 complaint (&symfile_complaints
,
435 "inner block (0x%s-0x%s) not inside outer block (0x%s-0x%s)",
436 paddr_nz (BLOCK_START (pblock
->block
)),
437 paddr_nz (BLOCK_END (pblock
->block
)),
438 paddr_nz (BLOCK_START (block
)),
439 paddr_nz (BLOCK_END (block
)));
441 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
))
442 BLOCK_START (pblock
->block
) = BLOCK_START (block
);
443 if (BLOCK_END (pblock
->block
) > BLOCK_END (block
))
444 BLOCK_END (pblock
->block
) = BLOCK_END (block
);
447 BLOCK_SUPERBLOCK (pblock
->block
) = block
;
452 record_pending_block (objfile
, block
, opblock
);
455 /* Record BLOCK on the list of all blocks in the file. Put it after
456 OPBLOCK, or at the beginning if opblock is NULL. This puts the
457 block in the list after all its subblocks.
459 Allocate the pending block struct in the symbol_obstack to save
460 time. This wastes a little space. FIXME: Is it worth it? */
463 record_pending_block (struct objfile
*objfile
, struct block
*block
,
464 struct pending_block
*opblock
)
466 register struct pending_block
*pblock
;
468 pblock
= (struct pending_block
*)
469 obstack_alloc (&objfile
->symbol_obstack
, sizeof (struct pending_block
));
470 pblock
->block
= block
;
473 pblock
->next
= opblock
->next
;
474 opblock
->next
= pblock
;
478 pblock
->next
= pending_blocks
;
479 pending_blocks
= pblock
;
483 /* OBSOLETE Note that this is only used in this file and in dstread.c, which */
484 /* OBSOLETE should be fixed to not need direct access to this function. When */
485 /* OBSOLETE that is done, it can be made static again. */
487 static struct blockvector
*
488 make_blockvector (struct objfile
*objfile
)
490 register struct pending_block
*next
;
491 register struct blockvector
*blockvector
;
494 /* Count the length of the list of blocks. */
496 for (next
= pending_blocks
, i
= 0; next
; next
= next
->next
, i
++)
500 blockvector
= (struct blockvector
*)
501 obstack_alloc (&objfile
->symbol_obstack
,
502 (sizeof (struct blockvector
)
503 + (i
- 1) * sizeof (struct block
*)));
505 /* Copy the blocks into the blockvector. This is done in reverse
506 order, which happens to put the blocks into the proper order
507 (ascending starting address). finish_block has hair to insert
508 each block into the list after its subblocks in order to make
509 sure this is true. */
511 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
512 for (next
= pending_blocks
; next
; next
= next
->next
)
514 BLOCKVECTOR_BLOCK (blockvector
, --i
) = next
->block
;
517 #if 0 /* Now we make the links in the
518 obstack, so don't free them. */
519 /* Now free the links of the list, and empty the list. */
521 for (next
= pending_blocks
; next
; next
= next1
)
527 pending_blocks
= NULL
;
529 #if 1 /* FIXME, shut this off after a while
530 to speed up symbol reading. */
531 /* Some compilers output blocks in the wrong order, but we depend on
532 their being in the right order so we can binary search. Check the
533 order and moan about it. FIXME. */
534 if (BLOCKVECTOR_NBLOCKS (blockvector
) > 1)
536 for (i
= 1; i
< BLOCKVECTOR_NBLOCKS (blockvector
); i
++)
538 if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
- 1))
539 > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
)))
542 = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
));
544 complaint (&symfile_complaints
, "block at %s out of order",
545 local_hex_string ((LONGEST
) start
));
551 return (blockvector
);
554 /* Start recording information about source code that came from an
555 included (or otherwise merged-in) source file with a different
556 name. NAME is the name of the file (cannot be NULL), DIRNAME is
557 the directory in which it resides (or NULL if not known). */
560 start_subfile (char *name
, char *dirname
)
562 register struct subfile
*subfile
;
564 /* See if this subfile is already known as a subfile of the current
567 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
569 if (FILENAME_CMP (subfile
->name
, name
) == 0)
571 current_subfile
= subfile
;
576 /* This subfile is not known. Add an entry for it. Make an entry
577 for this subfile in the list of all subfiles of the current main
580 subfile
= (struct subfile
*) xmalloc (sizeof (struct subfile
));
581 memset ((char *) subfile
, 0, sizeof (struct subfile
));
582 subfile
->next
= subfiles
;
584 current_subfile
= subfile
;
586 /* Save its name and compilation directory name */
587 subfile
->name
= (name
== NULL
) ? NULL
: savestring (name
, strlen (name
));
589 (dirname
== NULL
) ? NULL
: savestring (dirname
, strlen (dirname
));
591 /* Initialize line-number recording for this subfile. */
592 subfile
->line_vector
= NULL
;
594 /* Default the source language to whatever can be deduced from the
595 filename. If nothing can be deduced (such as for a C/C++ include
596 file with a ".h" extension), then inherit whatever language the
597 previous subfile had. This kludgery is necessary because there
598 is no standard way in some object formats to record the source
599 language. Also, when symtabs are allocated we try to deduce a
600 language then as well, but it is too late for us to use that
601 information while reading symbols, since symtabs aren't allocated
602 until after all the symbols have been processed for a given
605 subfile
->language
= deduce_language_from_filename (subfile
->name
);
606 if (subfile
->language
== language_unknown
&&
607 subfile
->next
!= NULL
)
609 subfile
->language
= subfile
->next
->language
;
612 /* Initialize the debug format string to NULL. We may supply it
613 later via a call to record_debugformat. */
614 subfile
->debugformat
= NULL
;
616 /* cfront output is a C program, so in most ways it looks like a C
617 program. But to demangle we need to set the language to C++. We
618 can distinguish cfront code by the fact that it has #line
619 directives which specify a file name ending in .C.
621 So if the filename of this subfile ends in .C, then change the
622 language of any pending subfiles from C to C++. We also accept
623 any other C++ suffixes accepted by deduce_language_from_filename
624 (in particular, some people use .cxx with cfront). */
625 /* Likewise for f2c. */
630 enum language sublang
= deduce_language_from_filename (subfile
->name
);
632 if (sublang
== language_cplus
|| sublang
== language_fortran
)
633 for (s
= subfiles
; s
!= NULL
; s
= s
->next
)
634 if (s
->language
== language_c
)
635 s
->language
= sublang
;
638 /* And patch up this file if necessary. */
639 if (subfile
->language
== language_c
640 && subfile
->next
!= NULL
641 && (subfile
->next
->language
== language_cplus
642 || subfile
->next
->language
== language_fortran
))
644 subfile
->language
= subfile
->next
->language
;
648 /* For stabs readers, the first N_SO symbol is assumed to be the
649 source file name, and the subfile struct is initialized using that
650 assumption. If another N_SO symbol is later seen, immediately
651 following the first one, then the first one is assumed to be the
652 directory name and the second one is really the source file name.
654 So we have to patch up the subfile struct by moving the old name
655 value to dirname and remembering the new name. Some sanity
656 checking is performed to ensure that the state of the subfile
657 struct is reasonable and that the old name we are assuming to be a
658 directory name actually is (by checking for a trailing '/'). */
661 patch_subfile_names (struct subfile
*subfile
, char *name
)
663 if (subfile
!= NULL
&& subfile
->dirname
== NULL
&& subfile
->name
!= NULL
664 && subfile
->name
[strlen (subfile
->name
) - 1] == '/')
666 subfile
->dirname
= subfile
->name
;
667 subfile
->name
= savestring (name
, strlen (name
));
668 last_source_file
= name
;
670 /* Default the source language to whatever can be deduced from
671 the filename. If nothing can be deduced (such as for a C/C++
672 include file with a ".h" extension), then inherit whatever
673 language the previous subfile had. This kludgery is
674 necessary because there is no standard way in some object
675 formats to record the source language. Also, when symtabs
676 are allocated we try to deduce a language then as well, but
677 it is too late for us to use that information while reading
678 symbols, since symtabs aren't allocated until after all the
679 symbols have been processed for a given source file. */
681 subfile
->language
= deduce_language_from_filename (subfile
->name
);
682 if (subfile
->language
== language_unknown
&&
683 subfile
->next
!= NULL
)
685 subfile
->language
= subfile
->next
->language
;
690 /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
691 switching source files (different subfiles, as we call them) within
692 one object file, but using a stack rather than in an arbitrary
698 register struct subfile_stack
*tem
699 = (struct subfile_stack
*) xmalloc (sizeof (struct subfile_stack
));
701 tem
->next
= subfile_stack
;
703 if (current_subfile
== NULL
|| current_subfile
->name
== NULL
)
705 internal_error (__FILE__
, __LINE__
, "failed internal consistency check");
707 tem
->name
= current_subfile
->name
;
714 register struct subfile_stack
*link
= subfile_stack
;
718 internal_error (__FILE__
, __LINE__
, "failed internal consistency check");
721 subfile_stack
= link
->next
;
722 xfree ((void *) link
);
726 /* Add a linetable entry for line number LINE and address PC to the
727 line vector for SUBFILE. */
730 record_line (register struct subfile
*subfile
, int line
, CORE_ADDR pc
)
732 struct linetable_entry
*e
;
733 /* Ignore the dummy line number in libg.o */
740 /* Make sure line vector exists and is big enough. */
741 if (!subfile
->line_vector
)
743 subfile
->line_vector_length
= INITIAL_LINE_VECTOR_LENGTH
;
744 subfile
->line_vector
= (struct linetable
*)
745 xmalloc (sizeof (struct linetable
)
746 + subfile
->line_vector_length
* sizeof (struct linetable_entry
));
747 subfile
->line_vector
->nitems
= 0;
748 have_line_numbers
= 1;
751 if (subfile
->line_vector
->nitems
+ 1 >= subfile
->line_vector_length
)
753 subfile
->line_vector_length
*= 2;
754 subfile
->line_vector
= (struct linetable
*)
755 xrealloc ((char *) subfile
->line_vector
,
756 (sizeof (struct linetable
)
757 + (subfile
->line_vector_length
758 * sizeof (struct linetable_entry
))));
761 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
++;
763 e
->pc
= ADDR_BITS_REMOVE(pc
);
766 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
769 compare_line_numbers (const void *ln1p
, const void *ln2p
)
771 struct linetable_entry
*ln1
= (struct linetable_entry
*) ln1p
;
772 struct linetable_entry
*ln2
= (struct linetable_entry
*) ln2p
;
774 /* Note: this code does not assume that CORE_ADDRs can fit in ints.
775 Please keep it that way. */
776 if (ln1
->pc
< ln2
->pc
)
779 if (ln1
->pc
> ln2
->pc
)
782 /* If pc equal, sort by line. I'm not sure whether this is optimum
783 behavior (see comment at struct linetable in symtab.h). */
784 return ln1
->line
- ln2
->line
;
787 /* Start a new symtab for a new source file. Called, for example,
788 when a stabs symbol of type N_SO is seen, or when a DWARF
789 TAG_compile_unit DIE is seen. It indicates the start of data for
790 one original source file. */
793 start_symtab (char *name
, char *dirname
, CORE_ADDR start_addr
)
796 last_source_file
= name
;
797 last_source_start_addr
= start_addr
;
799 global_symbols
= NULL
;
801 have_line_numbers
= 0;
803 /* Context stack is initially empty. Allocate first one with room
804 for 10 levels; reuse it forever afterward. */
805 if (context_stack
== NULL
)
807 context_stack_size
= INITIAL_CONTEXT_STACK_SIZE
;
808 context_stack
= (struct context_stack
*)
809 xmalloc (context_stack_size
* sizeof (struct context_stack
));
811 context_stack_depth
= 0;
813 /* Initialize the list of sub source files with one entry for this
814 file (the top-level source file). */
817 current_subfile
= NULL
;
818 start_subfile (name
, dirname
);
821 /* Finish the symbol definitions for one main source file, close off
822 all the lexical contexts for that file (creating struct block's for
823 them), then make the struct symtab for that file and put it in the
826 END_ADDR is the address of the end of the file's text. SECTION is
827 the section number (in objfile->section_offsets) of the blockvector
830 Note that it is possible for end_symtab() to return NULL. In
831 particular, for the DWARF case at least, it will return NULL when
832 it finds a compilation unit that has exactly one DIE, a
833 TAG_compile_unit DIE. This can happen when we link in an object
834 file that was compiled from an empty source file. Returning NULL
835 is probably not the correct thing to do, because then gdb will
836 never know about this empty file (FIXME). */
839 end_symtab (CORE_ADDR end_addr
, struct objfile
*objfile
, int section
)
841 register struct symtab
*symtab
= NULL
;
842 register struct blockvector
*blockvector
;
843 register struct subfile
*subfile
;
844 register struct context_stack
*cstk
;
845 struct subfile
*nextsub
;
847 /* Finish the lexical context of the last function in the file; pop
848 the context stack. */
850 if (context_stack_depth
> 0)
852 cstk
= pop_context ();
853 /* Make a block for the local symbols within. */
854 finish_block (cstk
->name
, &local_symbols
, cstk
->old_blocks
,
855 cstk
->start_addr
, end_addr
, objfile
);
857 if (context_stack_depth
> 0)
859 /* This is said to happen with SCO. The old coffread.c
860 code simply emptied the context stack, so we do the
861 same. FIXME: Find out why it is happening. This is not
862 believed to happen in most cases (even for coffread.c);
863 it used to be an abort(). */
864 complaint (&symfile_complaints
,
865 "Context stack not empty in end_symtab");
866 context_stack_depth
= 0;
870 /* Reordered executables may have out of order pending blocks; if
871 OBJF_REORDERED is true, then sort the pending blocks. */
872 if ((objfile
->flags
& OBJF_REORDERED
) && pending_blocks
)
874 /* FIXME! Remove this horrid bubble sort and use merge sort!!! */
878 struct pending_block
*pb
, *pbnext
;
886 /* swap blocks if unordered! */
888 if (BLOCK_START (pb
->block
) < BLOCK_START (pbnext
->block
))
890 struct block
*tmp
= pb
->block
;
891 pb
->block
= pbnext
->block
;
896 pbnext
= pbnext
->next
;
902 /* Cleanup any undefined types that have been left hanging around
903 (this needs to be done before the finish_blocks so that
904 file_symbols is still good).
906 Both cleanup_undefined_types and finish_global_stabs are stabs
907 specific, but harmless for other symbol readers, since on gdb
908 startup or when finished reading stabs, the state is set so these
909 are no-ops. FIXME: Is this handled right in case of QUIT? Can
910 we make this cleaner? */
912 cleanup_undefined_types ();
913 finish_global_stabs (objfile
);
915 if (pending_blocks
== NULL
916 && file_symbols
== NULL
917 && global_symbols
== NULL
918 && have_line_numbers
== 0
919 && pending_macros
== NULL
)
921 /* Ignore symtabs that have no functions with real debugging
927 /* Define the STATIC_BLOCK & GLOBAL_BLOCK, and build the
929 finish_block (0, &file_symbols
, 0, last_source_start_addr
, end_addr
,
931 finish_block (0, &global_symbols
, 0, last_source_start_addr
, end_addr
,
933 blockvector
= make_blockvector (objfile
);
936 #ifndef PROCESS_LINENUMBER_HOOK
937 #define PROCESS_LINENUMBER_HOOK()
939 PROCESS_LINENUMBER_HOOK (); /* Needed for xcoff. */
941 /* Now create the symtab objects proper, one for each subfile. */
942 /* (The main file is the last one on the chain.) */
944 for (subfile
= subfiles
; subfile
; subfile
= nextsub
)
946 int linetablesize
= 0;
949 /* If we have blocks of symbols, make a symtab. Otherwise, just
950 ignore this file and any line number info in it. */
953 if (subfile
->line_vector
)
955 linetablesize
= sizeof (struct linetable
) +
956 subfile
->line_vector
->nitems
* sizeof (struct linetable_entry
);
958 /* I think this is artifact from before it went on the
959 obstack. I doubt we'll need the memory between now
960 and when we free it later in this function. */
961 /* First, shrink the linetable to make more memory. */
962 subfile
->line_vector
= (struct linetable
*)
963 xrealloc ((char *) subfile
->line_vector
, linetablesize
);
966 /* Like the pending blocks, the line table may be
967 scrambled in reordered executables. Sort it if
968 OBJF_REORDERED is true. */
969 if (objfile
->flags
& OBJF_REORDERED
)
970 qsort (subfile
->line_vector
->item
,
971 subfile
->line_vector
->nitems
,
972 sizeof (struct linetable_entry
), compare_line_numbers
);
975 /* Now, allocate a symbol table. */
976 symtab
= allocate_symtab (subfile
->name
, objfile
);
978 /* Fill in its components. */
979 symtab
->blockvector
= blockvector
;
980 symtab
->macro_table
= pending_macros
;
981 if (subfile
->line_vector
)
983 /* Reallocate the line table on the symbol obstack */
984 symtab
->linetable
= (struct linetable
*)
985 obstack_alloc (&objfile
->symbol_obstack
, linetablesize
);
986 memcpy (symtab
->linetable
, subfile
->line_vector
, linetablesize
);
990 symtab
->linetable
= NULL
;
992 symtab
->block_line_section
= section
;
993 if (subfile
->dirname
)
995 /* Reallocate the dirname on the symbol obstack */
996 symtab
->dirname
= (char *)
997 obstack_alloc (&objfile
->symbol_obstack
,
998 strlen (subfile
->dirname
) + 1);
999 strcpy (symtab
->dirname
, subfile
->dirname
);
1003 symtab
->dirname
= NULL
;
1005 symtab
->free_code
= free_linetable
;
1006 symtab
->free_ptr
= NULL
;
1008 /* Use whatever language we have been using for this
1009 subfile, not the one that was deduced in allocate_symtab
1010 from the filename. We already did our own deducing when
1011 we created the subfile, and we may have altered our
1012 opinion of what language it is from things we found in
1014 symtab
->language
= subfile
->language
;
1016 /* Save the debug format string (if any) in the symtab */
1017 if (subfile
->debugformat
!= NULL
)
1019 symtab
->debugformat
= obsavestring (subfile
->debugformat
,
1020 strlen (subfile
->debugformat
),
1021 &objfile
->symbol_obstack
);
1024 /* All symtabs for the main file and the subfiles share a
1025 blockvector, so we need to clear primary for everything
1026 but the main file. */
1028 symtab
->primary
= 0;
1030 if (subfile
->name
!= NULL
)
1032 xfree ((void *) subfile
->name
);
1034 if (subfile
->dirname
!= NULL
)
1036 xfree ((void *) subfile
->dirname
);
1038 if (subfile
->line_vector
!= NULL
)
1040 xfree ((void *) subfile
->line_vector
);
1042 if (subfile
->debugformat
!= NULL
)
1044 xfree ((void *) subfile
->debugformat
);
1047 nextsub
= subfile
->next
;
1048 xfree ((void *) subfile
);
1051 /* Set this for the main source file. */
1054 symtab
->primary
= 1;
1057 last_source_file
= NULL
;
1058 current_subfile
= NULL
;
1059 pending_macros
= NULL
;
1064 /* Push a context block. Args are an identifying nesting level
1065 (checkable when you pop it), and the starting PC address of this
1068 struct context_stack
*
1069 push_context (int desc
, CORE_ADDR valu
)
1071 register struct context_stack
*new;
1073 if (context_stack_depth
== context_stack_size
)
1075 context_stack_size
*= 2;
1076 context_stack
= (struct context_stack
*)
1077 xrealloc ((char *) context_stack
,
1078 (context_stack_size
* sizeof (struct context_stack
)));
1081 new = &context_stack
[context_stack_depth
++];
1083 new->locals
= local_symbols
;
1084 new->params
= param_symbols
;
1085 new->old_blocks
= pending_blocks
;
1086 new->start_addr
= valu
;
1089 local_symbols
= NULL
;
1090 param_symbols
= NULL
;
1095 /* Pop a context block. Returns the address of the context block just
1098 struct context_stack
*
1101 gdb_assert (context_stack_depth
> 0);
1102 return (&context_stack
[--context_stack_depth
]);
1107 /* Compute a small integer hash code for the given name. */
1110 hashname (char *name
)
1112 return (hash(name
,strlen(name
)) % HASHSIZE
);
1117 record_debugformat (char *format
)
1119 current_subfile
->debugformat
= savestring (format
, strlen (format
));
1122 /* Merge the first symbol list SRCLIST into the second symbol list
1123 TARGETLIST by repeated calls to add_symbol_to_list(). This
1124 procedure "frees" each link of SRCLIST by adding it to the
1125 free_pendings list. Caller must set SRCLIST to a null list after
1126 calling this function.
1131 merge_symbol_lists (struct pending
**srclist
, struct pending
**targetlist
)
1135 if (!srclist
|| !*srclist
)
1138 /* Merge in elements from current link. */
1139 for (i
= 0; i
< (*srclist
)->nsyms
; i
++)
1140 add_symbol_to_list ((*srclist
)->symbol
[i
], targetlist
);
1142 /* Recurse on next. */
1143 merge_symbol_lists (&(*srclist
)->next
, targetlist
);
1145 /* "Free" the current link. */
1146 (*srclist
)->next
= free_pendings
;
1147 free_pendings
= (*srclist
);
1150 /* Initialize anything that needs initializing when starting to read a
1151 fresh piece of a symbol file, e.g. reading in the stuff
1152 corresponding to a psymtab. */
1155 buildsym_init (void)
1157 free_pendings
= NULL
;
1158 file_symbols
= NULL
;
1159 global_symbols
= NULL
;
1160 pending_blocks
= NULL
;
1161 pending_macros
= NULL
;
1164 /* Initialize anything that needs initializing when a completely new
1165 symbol file is specified (not just adding some symbols from another
1166 file, e.g. a shared library). */
1169 buildsym_new_init (void)