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. */
33 #include "symfile.h" /* Needed for "struct complaint" */
36 #include "complaints.h"
37 #include "gdb_string.h"
38 #include "expression.h" /* For "enum exp_opcode" used by... */
39 #include "language.h" /* For "local_hex_string" */
41 #include "filenames.h" /* For DOSish file names */
43 #include "demangle.h" /* Needed by SYMBOL_INIT_DEMANGLED_NAME. */
44 /* Ask buildsym.h to define the vars it normally declares `extern'. */
47 #include "buildsym.h" /* Our own declarations */
50 /* For cleanup_undefined_types and finish_global_stabs (somewhat
51 questionable--see comment where we call them). */
53 #include "stabsread.h"
55 /* List of free `struct pending' structures for reuse. */
57 static struct pending
*free_pendings
;
59 /* Non-zero if symtab has line number info. This prevents an
60 otherwise empty symtab from being tossed. */
62 static int have_line_numbers
;
64 static int compare_line_numbers (const void *ln1p
, const void *ln2p
);
67 /* Initial sizes of data structures. These are realloc'd larger if
68 needed, and realloc'd down to the size actually used, when
71 #define INITIAL_CONTEXT_STACK_SIZE 10
72 #define INITIAL_LINE_VECTOR_LENGTH 1000
75 /* Complaints about the symbols we have encountered. */
77 struct complaint block_end_complaint
=
78 {"block end address less than block start address in %s (patched it)", 0, 0};
80 struct complaint anon_block_end_complaint
=
81 {"block end address 0x%lx less than block start address 0x%lx (patched it)", 0, 0};
83 struct complaint innerblock_complaint
=
84 {"inner block not inside outer block in %s", 0, 0};
86 struct complaint innerblock_anon_complaint
=
87 {"inner block (0x%lx-0x%lx) not inside outer block (0x%lx-0x%lx)", 0, 0};
89 struct complaint blockvector_complaint
=
90 {"block at %s out of order", 0, 0};
92 /* maintain the lists of symbols and blocks */
94 /* Add a pending list to free_pendings. */
96 add_free_pendings (struct pending
*list
)
98 register struct pending
*link
= list
;
102 while (link
->next
) link
= link
->next
;
103 link
->next
= free_pendings
;
104 free_pendings
= list
;
108 /* Add a symbol to one of the lists of symbols. */
111 add_symbol_to_list (struct symbol
*symbol
, struct pending
**listhead
)
113 register struct pending
*link
;
115 /* If this is an alias for another symbol, don't add it. */
116 if (symbol
->ginfo
.name
&& symbol
->ginfo
.name
[0] == '#')
119 /* We keep PENDINGSIZE symbols in each link of the list. If we
120 don't have a link with room in it, add a new link. */
121 if (*listhead
== NULL
|| (*listhead
)->nsyms
== PENDINGSIZE
)
125 link
= free_pendings
;
126 free_pendings
= link
->next
;
130 link
= (struct pending
*) xmalloc (sizeof (struct pending
));
133 link
->next
= *listhead
;
138 (*listhead
)->symbol
[(*listhead
)->nsyms
++] = symbol
;
141 /* Find a symbol named NAME on a LIST. NAME need not be
142 '\0'-terminated; LENGTH is the length of the name. */
145 find_symbol_in_list (struct pending
*list
, char *name
, int length
)
152 for (j
= list
->nsyms
; --j
>= 0;)
154 pp
= SYMBOL_NAME (list
->symbol
[j
]);
155 if (*pp
== *name
&& strncmp (pp
, name
, length
) == 0 &&
158 return (list
->symbol
[j
]);
166 /* At end of reading syms, or in case of quit, really free as many
167 `struct pending's as we can easily find. */
171 really_free_pendings (PTR dummy
)
173 struct pending
*next
, *next1
;
175 for (next
= free_pendings
; next
; next
= next1
)
178 xfree ((void *) next
);
180 free_pendings
= NULL
;
182 free_pending_blocks ();
184 for (next
= file_symbols
; next
!= NULL
; next
= next1
)
187 xfree ((void *) next
);
191 for (next
= global_symbols
; next
!= NULL
; next
= next1
)
194 xfree ((void *) next
);
196 global_symbols
= NULL
;
199 free_macro_table (pending_macros
);
202 /* This function is called to discard any pending blocks. */
205 free_pending_blocks (void)
207 #if 0 /* Now we make the links in the
208 symbol_obstack, so don't free
210 struct pending_block
*bnext
, *bnext1
;
212 for (bnext
= pending_blocks
; bnext
; bnext
= bnext1
)
214 bnext1
= bnext
->next
;
215 xfree ((void *) bnext
);
218 pending_blocks
= NULL
;
221 /* Take one of the lists of symbols and make a block from it. Keep
222 the order the symbols have in the list (reversed from the input
223 file). Put the block on the list of pending blocks. */
226 finish_block (struct symbol
*symbol
, struct pending
**listhead
,
227 struct pending_block
*old_blocks
,
228 CORE_ADDR start
, CORE_ADDR end
,
229 struct objfile
*objfile
)
231 register struct pending
*next
, *next1
;
232 register struct block
*block
;
233 register struct pending_block
*pblock
;
234 struct pending_block
*opblock
;
238 /* Count the length of the list of symbols. */
240 for (next
= *listhead
, i
= 0;
242 i
+= next
->nsyms
, next
= next
->next
)
247 /* Copy the symbols into the block. */
251 block
= (struct block
*)
252 obstack_alloc (&objfile
->symbol_obstack
,
253 (sizeof (struct block
) +
254 ((i
- 1) * sizeof (struct symbol
*))));
255 BLOCK_NSYMS (block
) = i
;
256 for (next
= *listhead
; next
; next
= next
->next
)
257 for (j
= next
->nsyms
- 1; j
>= 0; j
--)
259 BLOCK_SYM (block
, --i
) = next
->symbol
[j
];
264 int htab_size
= BLOCK_HASHTABLE_SIZE (i
);
266 block
= (struct block
*)
267 obstack_alloc (&objfile
->symbol_obstack
,
268 (sizeof (struct block
) +
269 ((htab_size
- 1) * sizeof (struct symbol
*))));
270 for (j
= 0; j
< htab_size
; j
++)
272 BLOCK_BUCKET (block
, j
) = 0;
274 BLOCK_BUCKETS (block
) = htab_size
;
275 for (next
= *listhead
; next
; next
= next
->next
)
277 for (j
= next
->nsyms
- 1; j
>= 0; j
--)
280 unsigned int hash_index
;
281 const char *name
= SYMBOL_DEMANGLED_NAME (next
->symbol
[j
]);
283 name
= SYMBOL_NAME (next
->symbol
[j
]);
284 hash_index
= msymbol_hash_iw (name
);
285 hash_index
= hash_index
% BLOCK_BUCKETS (block
);
286 sym
= BLOCK_BUCKET (block
, hash_index
);
287 BLOCK_BUCKET (block
, hash_index
) = next
->symbol
[j
];
288 next
->symbol
[j
]->hash_next
= sym
;
293 BLOCK_START (block
) = start
;
294 BLOCK_END (block
) = end
;
295 /* Superblock filled in when containing block is made */
296 BLOCK_SUPERBLOCK (block
) = NULL
;
298 BLOCK_GCC_COMPILED (block
) = processing_gcc_compilation
;
300 /* Put the block in as the value of the symbol that names it. */
304 struct type
*ftype
= SYMBOL_TYPE (symbol
);
305 SYMBOL_BLOCK_VALUE (symbol
) = block
;
306 BLOCK_FUNCTION (block
) = symbol
;
307 BLOCK_HASHTABLE (block
) = 0;
309 if (TYPE_NFIELDS (ftype
) <= 0)
311 /* No parameter type information is recorded with the
312 function's type. Set that from the type of the
313 parameter symbols. */
314 int nparams
= 0, iparams
;
316 ALL_BLOCK_SYMBOLS (block
, i
, sym
)
318 switch (SYMBOL_CLASS (sym
))
323 case LOC_REGPARM_ADDR
:
324 case LOC_BASEREG_ARG
:
337 case LOC_CONST_BYTES
:
340 case LOC_OPTIMIZED_OUT
:
347 TYPE_NFIELDS (ftype
) = nparams
;
348 TYPE_FIELDS (ftype
) = (struct field
*)
349 TYPE_ALLOC (ftype
, nparams
* sizeof (struct field
));
351 for (i
= iparams
= 0; iparams
< nparams
; i
++)
353 sym
= BLOCK_SYM (block
, i
);
354 switch (SYMBOL_CLASS (sym
))
359 case LOC_REGPARM_ADDR
:
360 case LOC_BASEREG_ARG
:
362 TYPE_FIELD_TYPE (ftype
, iparams
) = SYMBOL_TYPE (sym
);
363 TYPE_FIELD_ARTIFICIAL (ftype
, iparams
) = 0;
375 case LOC_CONST_BYTES
:
378 case LOC_OPTIMIZED_OUT
:
388 BLOCK_FUNCTION (block
) = NULL
;
389 BLOCK_HASHTABLE (block
) = 1;
392 /* Now "free" the links of the list, and empty the list. */
394 for (next
= *listhead
; next
; next
= next1
)
397 next
->next
= free_pendings
;
398 free_pendings
= next
;
403 /* Check to be sure that the blocks have an end address that is
404 greater than starting address */
406 if (BLOCK_END (block
) < BLOCK_START (block
))
410 complain (&block_end_complaint
, SYMBOL_SOURCE_NAME (symbol
));
414 complain (&anon_block_end_complaint
, BLOCK_END (block
), BLOCK_START (block
));
416 /* Better than nothing */
417 BLOCK_END (block
) = BLOCK_START (block
);
421 /* Install this block as the superblock of all blocks made since the
422 start of this scope that don't have superblocks yet. */
425 for (pblock
= pending_blocks
; pblock
!= old_blocks
; pblock
= pblock
->next
)
427 if (BLOCK_SUPERBLOCK (pblock
->block
) == NULL
)
430 /* Check to be sure the blocks are nested as we receive
431 them. If the compiler/assembler/linker work, this just
432 burns a small amount of time. */
433 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
) ||
434 BLOCK_END (pblock
->block
) > BLOCK_END (block
))
438 complain (&innerblock_complaint
,
439 SYMBOL_SOURCE_NAME (symbol
));
443 complain (&innerblock_anon_complaint
, BLOCK_START (pblock
->block
),
444 BLOCK_END (pblock
->block
), BLOCK_START (block
),
447 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
))
448 BLOCK_START (pblock
->block
) = BLOCK_START (block
);
449 if (BLOCK_END (pblock
->block
) > BLOCK_END (block
))
450 BLOCK_END (pblock
->block
) = BLOCK_END (block
);
453 BLOCK_SUPERBLOCK (pblock
->block
) = block
;
458 record_pending_block (objfile
, block
, opblock
);
461 /* Record BLOCK on the list of all blocks in the file. Put it after
462 OPBLOCK, or at the beginning if opblock is NULL. This puts the
463 block in the list after all its subblocks.
465 Allocate the pending block struct in the symbol_obstack to save
466 time. This wastes a little space. FIXME: Is it worth it? */
469 record_pending_block (struct objfile
*objfile
, struct block
*block
,
470 struct pending_block
*opblock
)
472 register struct pending_block
*pblock
;
474 pblock
= (struct pending_block
*)
475 obstack_alloc (&objfile
->symbol_obstack
, sizeof (struct pending_block
));
476 pblock
->block
= block
;
479 pblock
->next
= opblock
->next
;
480 opblock
->next
= pblock
;
484 pblock
->next
= pending_blocks
;
485 pending_blocks
= pblock
;
489 /* Note that this is only used in this file and in dstread.c, which
490 should be fixed to not need direct access to this function. When
491 that is done, it can be made static again. */
494 make_blockvector (struct objfile
*objfile
)
496 register struct pending_block
*next
;
497 register struct blockvector
*blockvector
;
500 /* Count the length of the list of blocks. */
502 for (next
= pending_blocks
, i
= 0; next
; next
= next
->next
, i
++)
506 blockvector
= (struct blockvector
*)
507 obstack_alloc (&objfile
->symbol_obstack
,
508 (sizeof (struct blockvector
)
509 + (i
- 1) * sizeof (struct block
*)));
511 /* Copy the blocks into the blockvector. This is done in reverse
512 order, which happens to put the blocks into the proper order
513 (ascending starting address). finish_block has hair to insert
514 each block into the list after its subblocks in order to make
515 sure this is true. */
517 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
518 for (next
= pending_blocks
; next
; next
= next
->next
)
520 BLOCKVECTOR_BLOCK (blockvector
, --i
) = next
->block
;
523 #if 0 /* Now we make the links in the
524 obstack, so don't free them. */
525 /* Now free the links of the list, and empty the list. */
527 for (next
= pending_blocks
; next
; next
= next1
)
533 pending_blocks
= NULL
;
535 #if 1 /* FIXME, shut this off after a while
536 to speed up symbol reading. */
537 /* Some compilers output blocks in the wrong order, but we depend on
538 their being in the right order so we can binary search. Check the
539 order and moan about it. FIXME. */
540 if (BLOCKVECTOR_NBLOCKS (blockvector
) > 1)
542 for (i
= 1; i
< BLOCKVECTOR_NBLOCKS (blockvector
); i
++)
544 if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
- 1))
545 > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
)))
548 = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
));
550 complain (&blockvector_complaint
,
551 local_hex_string ((LONGEST
) start
));
557 return (blockvector
);
560 /* Start recording information about source code that came from an
561 included (or otherwise merged-in) source file with a different
562 name. NAME is the name of the file (cannot be NULL), DIRNAME is
563 the directory in which it resides (or NULL if not known). */
566 start_subfile (char *name
, char *dirname
)
568 register struct subfile
*subfile
;
570 /* See if this subfile is already known as a subfile of the current
573 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
575 if (FILENAME_CMP (subfile
->name
, name
) == 0)
577 current_subfile
= subfile
;
582 /* This subfile is not known. Add an entry for it. Make an entry
583 for this subfile in the list of all subfiles of the current main
586 subfile
= (struct subfile
*) xmalloc (sizeof (struct subfile
));
587 memset ((char *) subfile
, 0, sizeof (struct subfile
));
588 subfile
->next
= subfiles
;
590 current_subfile
= subfile
;
592 /* Save its name and compilation directory name */
593 subfile
->name
= (name
== NULL
) ? NULL
: savestring (name
, strlen (name
));
595 (dirname
== NULL
) ? NULL
: savestring (dirname
, strlen (dirname
));
597 /* Initialize line-number recording for this subfile. */
598 subfile
->line_vector
= NULL
;
600 /* Default the source language to whatever can be deduced from the
601 filename. If nothing can be deduced (such as for a C/C++ include
602 file with a ".h" extension), then inherit whatever language the
603 previous subfile had. This kludgery is necessary because there
604 is no standard way in some object formats to record the source
605 language. Also, when symtabs are allocated we try to deduce a
606 language then as well, but it is too late for us to use that
607 information while reading symbols, since symtabs aren't allocated
608 until after all the symbols have been processed for a given
611 subfile
->language
= deduce_language_from_filename (subfile
->name
);
612 if (subfile
->language
== language_unknown
&&
613 subfile
->next
!= NULL
)
615 subfile
->language
= subfile
->next
->language
;
618 /* Initialize the debug format string to NULL. We may supply it
619 later via a call to record_debugformat. */
620 subfile
->debugformat
= NULL
;
622 /* cfront output is a C program, so in most ways it looks like a C
623 program. But to demangle we need to set the language to C++. We
624 can distinguish cfront code by the fact that it has #line
625 directives which specify a file name ending in .C.
627 So if the filename of this subfile ends in .C, then change the
628 language of any pending subfiles from C to C++. We also accept
629 any other C++ suffixes accepted by deduce_language_from_filename
630 (in particular, some people use .cxx with cfront). */
631 /* Likewise for f2c. */
636 enum language sublang
= deduce_language_from_filename (subfile
->name
);
638 if (sublang
== language_cplus
|| sublang
== language_fortran
)
639 for (s
= subfiles
; s
!= NULL
; s
= s
->next
)
640 if (s
->language
== language_c
)
641 s
->language
= sublang
;
644 /* And patch up this file if necessary. */
645 if (subfile
->language
== language_c
646 && subfile
->next
!= NULL
647 && (subfile
->next
->language
== language_cplus
648 || subfile
->next
->language
== language_fortran
))
650 subfile
->language
= subfile
->next
->language
;
654 /* For stabs readers, the first N_SO symbol is assumed to be the
655 source file name, and the subfile struct is initialized using that
656 assumption. If another N_SO symbol is later seen, immediately
657 following the first one, then the first one is assumed to be the
658 directory name and the second one is really the source file name.
660 So we have to patch up the subfile struct by moving the old name
661 value to dirname and remembering the new name. Some sanity
662 checking is performed to ensure that the state of the subfile
663 struct is reasonable and that the old name we are assuming to be a
664 directory name actually is (by checking for a trailing '/'). */
667 patch_subfile_names (struct subfile
*subfile
, char *name
)
669 if (subfile
!= NULL
&& subfile
->dirname
== NULL
&& subfile
->name
!= NULL
670 && subfile
->name
[strlen (subfile
->name
) - 1] == '/')
672 subfile
->dirname
= subfile
->name
;
673 subfile
->name
= savestring (name
, strlen (name
));
674 last_source_file
= name
;
676 /* Default the source language to whatever can be deduced from
677 the filename. If nothing can be deduced (such as for a C/C++
678 include file with a ".h" extension), then inherit whatever
679 language the previous subfile had. This kludgery is
680 necessary because there is no standard way in some object
681 formats to record the source language. Also, when symtabs
682 are allocated we try to deduce a language then as well, but
683 it is too late for us to use that information while reading
684 symbols, since symtabs aren't allocated until after all the
685 symbols have been processed for a given source file. */
687 subfile
->language
= deduce_language_from_filename (subfile
->name
);
688 if (subfile
->language
== language_unknown
&&
689 subfile
->next
!= NULL
)
691 subfile
->language
= subfile
->next
->language
;
696 /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
697 switching source files (different subfiles, as we call them) within
698 one object file, but using a stack rather than in an arbitrary
704 register struct subfile_stack
*tem
705 = (struct subfile_stack
*) xmalloc (sizeof (struct subfile_stack
));
707 tem
->next
= subfile_stack
;
709 if (current_subfile
== NULL
|| current_subfile
->name
== NULL
)
711 internal_error (__FILE__
, __LINE__
, "failed internal consistency check");
713 tem
->name
= current_subfile
->name
;
720 register struct subfile_stack
*link
= subfile_stack
;
724 internal_error (__FILE__
, __LINE__
, "failed internal consistency check");
727 subfile_stack
= link
->next
;
728 xfree ((void *) link
);
732 /* Add a linetable entry for line number LINE and address PC to the
733 line vector for SUBFILE. */
736 record_line (register struct subfile
*subfile
, int line
, CORE_ADDR pc
)
738 struct linetable_entry
*e
;
739 /* Ignore the dummy line number in libg.o */
746 /* Make sure line vector exists and is big enough. */
747 if (!subfile
->line_vector
)
749 subfile
->line_vector_length
= INITIAL_LINE_VECTOR_LENGTH
;
750 subfile
->line_vector
= (struct linetable
*)
751 xmalloc (sizeof (struct linetable
)
752 + subfile
->line_vector_length
* sizeof (struct linetable_entry
));
753 subfile
->line_vector
->nitems
= 0;
754 have_line_numbers
= 1;
757 if (subfile
->line_vector
->nitems
+ 1 >= subfile
->line_vector_length
)
759 subfile
->line_vector_length
*= 2;
760 subfile
->line_vector
= (struct linetable
*)
761 xrealloc ((char *) subfile
->line_vector
,
762 (sizeof (struct linetable
)
763 + (subfile
->line_vector_length
764 * sizeof (struct linetable_entry
))));
767 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
++;
769 e
->pc
= ADDR_BITS_REMOVE(pc
);
772 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
775 compare_line_numbers (const void *ln1p
, const void *ln2p
)
777 struct linetable_entry
*ln1
= (struct linetable_entry
*) ln1p
;
778 struct linetable_entry
*ln2
= (struct linetable_entry
*) ln2p
;
780 /* Note: this code does not assume that CORE_ADDRs can fit in ints.
781 Please keep it that way. */
782 if (ln1
->pc
< ln2
->pc
)
785 if (ln1
->pc
> ln2
->pc
)
788 /* If pc equal, sort by line. I'm not sure whether this is optimum
789 behavior (see comment at struct linetable in symtab.h). */
790 return ln1
->line
- ln2
->line
;
793 /* Start a new symtab for a new source file. Called, for example,
794 when a stabs symbol of type N_SO is seen, or when a DWARF
795 TAG_compile_unit DIE is seen. It indicates the start of data for
796 one original source file. */
799 start_symtab (char *name
, char *dirname
, CORE_ADDR start_addr
)
802 last_source_file
= name
;
803 last_source_start_addr
= start_addr
;
805 global_symbols
= NULL
;
807 have_line_numbers
= 0;
809 /* Context stack is initially empty. Allocate first one with room
810 for 10 levels; reuse it forever afterward. */
811 if (context_stack
== NULL
)
813 context_stack_size
= INITIAL_CONTEXT_STACK_SIZE
;
814 context_stack
= (struct context_stack
*)
815 xmalloc (context_stack_size
* sizeof (struct context_stack
));
817 context_stack_depth
= 0;
819 /* Initialize the list of sub source files with one entry for this
820 file (the top-level source file). */
823 current_subfile
= NULL
;
824 start_subfile (name
, dirname
);
827 /* Finish the symbol definitions for one main source file, close off
828 all the lexical contexts for that file (creating struct block's for
829 them), then make the struct symtab for that file and put it in the
832 END_ADDR is the address of the end of the file's text. SECTION is
833 the section number (in objfile->section_offsets) of the blockvector
836 Note that it is possible for end_symtab() to return NULL. In
837 particular, for the DWARF case at least, it will return NULL when
838 it finds a compilation unit that has exactly one DIE, a
839 TAG_compile_unit DIE. This can happen when we link in an object
840 file that was compiled from an empty source file. Returning NULL
841 is probably not the correct thing to do, because then gdb will
842 never know about this empty file (FIXME). */
845 end_symtab (CORE_ADDR end_addr
, struct objfile
*objfile
, int section
)
847 register struct symtab
*symtab
= NULL
;
848 register struct blockvector
*blockvector
;
849 register struct subfile
*subfile
;
850 register struct context_stack
*cstk
;
851 struct subfile
*nextsub
;
853 /* Finish the lexical context of the last function in the file; pop
854 the context stack. */
856 if (context_stack_depth
> 0)
858 cstk
= pop_context ();
859 /* Make a block for the local symbols within. */
860 finish_block (cstk
->name
, &local_symbols
, cstk
->old_blocks
,
861 cstk
->start_addr
, end_addr
, objfile
);
863 if (context_stack_depth
> 0)
865 /* This is said to happen with SCO. The old coffread.c
866 code simply emptied the context stack, so we do the
867 same. FIXME: Find out why it is happening. This is not
868 believed to happen in most cases (even for coffread.c);
869 it used to be an abort(). */
870 static struct complaint msg
=
871 {"Context stack not empty in end_symtab", 0, 0};
873 context_stack_depth
= 0;
877 /* Reordered executables may have out of order pending blocks; if
878 OBJF_REORDERED is true, then sort the pending blocks. */
879 if ((objfile
->flags
& OBJF_REORDERED
) && pending_blocks
)
881 /* FIXME! Remove this horrid bubble sort and use merge sort!!! */
885 struct pending_block
*pb
, *pbnext
;
893 /* swap blocks if unordered! */
895 if (BLOCK_START (pb
->block
) < BLOCK_START (pbnext
->block
))
897 struct block
*tmp
= pb
->block
;
898 pb
->block
= pbnext
->block
;
903 pbnext
= pbnext
->next
;
909 /* Cleanup any undefined types that have been left hanging around
910 (this needs to be done before the finish_blocks so that
911 file_symbols is still good).
913 Both cleanup_undefined_types and finish_global_stabs are stabs
914 specific, but harmless for other symbol readers, since on gdb
915 startup or when finished reading stabs, the state is set so these
916 are no-ops. FIXME: Is this handled right in case of QUIT? Can
917 we make this cleaner? */
919 cleanup_undefined_types ();
920 finish_global_stabs (objfile
);
922 if (pending_blocks
== NULL
923 && file_symbols
== NULL
924 && global_symbols
== NULL
925 && have_line_numbers
== 0
926 && pending_macros
== NULL
)
928 /* Ignore symtabs that have no functions with real debugging
934 /* Define the STATIC_BLOCK & GLOBAL_BLOCK, and build the
936 finish_block (0, &file_symbols
, 0, last_source_start_addr
, end_addr
,
938 finish_block (0, &global_symbols
, 0, last_source_start_addr
, end_addr
,
940 blockvector
= make_blockvector (objfile
);
943 #ifndef PROCESS_LINENUMBER_HOOK
944 #define PROCESS_LINENUMBER_HOOK()
946 PROCESS_LINENUMBER_HOOK (); /* Needed for xcoff. */
948 /* Now create the symtab objects proper, one for each subfile. */
949 /* (The main file is the last one on the chain.) */
951 for (subfile
= subfiles
; subfile
; subfile
= nextsub
)
953 int linetablesize
= 0;
956 /* If we have blocks of symbols, make a symtab. Otherwise, just
957 ignore this file and any line number info in it. */
960 if (subfile
->line_vector
)
962 linetablesize
= sizeof (struct linetable
) +
963 subfile
->line_vector
->nitems
* sizeof (struct linetable_entry
);
965 /* I think this is artifact from before it went on the
966 obstack. I doubt we'll need the memory between now
967 and when we free it later in this function. */
968 /* First, shrink the linetable to make more memory. */
969 subfile
->line_vector
= (struct linetable
*)
970 xrealloc ((char *) subfile
->line_vector
, linetablesize
);
973 /* Like the pending blocks, the line table may be
974 scrambled in reordered executables. Sort it if
975 OBJF_REORDERED is true. */
976 if (objfile
->flags
& OBJF_REORDERED
)
977 qsort (subfile
->line_vector
->item
,
978 subfile
->line_vector
->nitems
,
979 sizeof (struct linetable_entry
), compare_line_numbers
);
982 /* Now, allocate a symbol table. */
983 symtab
= allocate_symtab (subfile
->name
, objfile
);
985 /* Fill in its components. */
986 symtab
->blockvector
= blockvector
;
987 symtab
->macro_table
= pending_macros
;
988 if (subfile
->line_vector
)
990 /* Reallocate the line table on the symbol obstack */
991 symtab
->linetable
= (struct linetable
*)
992 obstack_alloc (&objfile
->symbol_obstack
, linetablesize
);
993 memcpy (symtab
->linetable
, subfile
->line_vector
, linetablesize
);
997 symtab
->linetable
= NULL
;
999 symtab
->block_line_section
= section
;
1000 if (subfile
->dirname
)
1002 /* Reallocate the dirname on the symbol obstack */
1003 symtab
->dirname
= (char *)
1004 obstack_alloc (&objfile
->symbol_obstack
,
1005 strlen (subfile
->dirname
) + 1);
1006 strcpy (symtab
->dirname
, subfile
->dirname
);
1010 symtab
->dirname
= NULL
;
1012 symtab
->free_code
= free_linetable
;
1013 symtab
->free_ptr
= NULL
;
1015 /* Use whatever language we have been using for this
1016 subfile, not the one that was deduced in allocate_symtab
1017 from the filename. We already did our own deducing when
1018 we created the subfile, and we may have altered our
1019 opinion of what language it is from things we found in
1021 symtab
->language
= subfile
->language
;
1023 /* Save the debug format string (if any) in the symtab */
1024 if (subfile
->debugformat
!= NULL
)
1026 symtab
->debugformat
= obsavestring (subfile
->debugformat
,
1027 strlen (subfile
->debugformat
),
1028 &objfile
->symbol_obstack
);
1031 /* All symtabs for the main file and the subfiles share a
1032 blockvector, so we need to clear primary for everything
1033 but the main file. */
1035 symtab
->primary
= 0;
1037 if (subfile
->name
!= NULL
)
1039 xfree ((void *) subfile
->name
);
1041 if (subfile
->dirname
!= NULL
)
1043 xfree ((void *) subfile
->dirname
);
1045 if (subfile
->line_vector
!= NULL
)
1047 xfree ((void *) subfile
->line_vector
);
1049 if (subfile
->debugformat
!= NULL
)
1051 xfree ((void *) subfile
->debugformat
);
1054 nextsub
= subfile
->next
;
1055 xfree ((void *) subfile
);
1058 /* Set this for the main source file. */
1061 symtab
->primary
= 1;
1064 last_source_file
= NULL
;
1065 current_subfile
= NULL
;
1066 pending_macros
= NULL
;
1071 /* Push a context block. Args are an identifying nesting level
1072 (checkable when you pop it), and the starting PC address of this
1075 struct context_stack
*
1076 push_context (int desc
, CORE_ADDR valu
)
1078 register struct context_stack
*new;
1080 if (context_stack_depth
== context_stack_size
)
1082 context_stack_size
*= 2;
1083 context_stack
= (struct context_stack
*)
1084 xrealloc ((char *) context_stack
,
1085 (context_stack_size
* sizeof (struct context_stack
)));
1088 new = &context_stack
[context_stack_depth
++];
1090 new->locals
= local_symbols
;
1091 new->params
= param_symbols
;
1092 new->old_blocks
= pending_blocks
;
1093 new->start_addr
= valu
;
1096 local_symbols
= NULL
;
1097 param_symbols
= NULL
;
1103 /* Compute a small integer hash code for the given name. */
1106 hashname (char *name
)
1108 return (hash(name
,strlen(name
)) % HASHSIZE
);
1113 record_debugformat (char *format
)
1115 current_subfile
->debugformat
= savestring (format
, strlen (format
));
1118 /* Merge the first symbol list SRCLIST into the second symbol list
1119 TARGETLIST by repeated calls to add_symbol_to_list(). This
1120 procedure "frees" each link of SRCLIST by adding it to the
1121 free_pendings list. Caller must set SRCLIST to a null list after
1122 calling this function.
1127 merge_symbol_lists (struct pending
**srclist
, struct pending
**targetlist
)
1131 if (!srclist
|| !*srclist
)
1134 /* Merge in elements from current link. */
1135 for (i
= 0; i
< (*srclist
)->nsyms
; i
++)
1136 add_symbol_to_list ((*srclist
)->symbol
[i
], targetlist
);
1138 /* Recurse on next. */
1139 merge_symbol_lists (&(*srclist
)->next
, targetlist
);
1141 /* "Free" the current link. */
1142 (*srclist
)->next
= free_pendings
;
1143 free_pendings
= (*srclist
);
1146 /* Initialize anything that needs initializing when starting to read a
1147 fresh piece of a symbol file, e.g. reading in the stuff
1148 corresponding to a psymtab. */
1151 buildsym_init (void)
1153 free_pendings
= NULL
;
1154 file_symbols
= NULL
;
1155 global_symbols
= NULL
;
1156 pending_blocks
= NULL
;
1157 pending_macros
= NULL
;
1160 /* Initialize anything that needs initializing when a completely new
1161 symbol file is specified (not just adding some symbols from another
1162 file, e.g. a shared library). */
1165 buildsym_new_init (void)