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 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 "longest_local_hex_string_custom" */
41 #include "filenames.h" /* For DOSish file names */
42 /* Ask buildsym.h to define the vars it normally declares `extern'. */
45 #include "buildsym.h" /* Our own declarations */
48 /* For cleanup_undefined_types and finish_global_stabs (somewhat
49 questionable--see comment where we call them). */
51 #include "stabsread.h"
53 /* List of free `struct pending' structures for reuse. */
55 static struct pending
*free_pendings
;
57 /* Non-zero if symtab has line number info. This prevents an
58 otherwise empty symtab from being tossed. */
60 static int have_line_numbers
;
62 static int compare_line_numbers (const void *ln1p
, const void *ln2p
);
65 /* Initial sizes of data structures. These are realloc'd larger if
66 needed, and realloc'd down to the size actually used, when
69 #define INITIAL_CONTEXT_STACK_SIZE 10
70 #define INITIAL_LINE_VECTOR_LENGTH 1000
73 /* Complaints about the symbols we have encountered. */
75 struct complaint block_end_complaint
=
76 {"block end address less than block start address in %s (patched it)", 0, 0};
78 struct complaint anon_block_end_complaint
=
79 {"block end address 0x%lx less than block start address 0x%lx (patched it)", 0, 0};
81 struct complaint innerblock_complaint
=
82 {"inner block not inside outer block in %s", 0, 0};
84 struct complaint innerblock_anon_complaint
=
85 {"inner block (0x%lx-0x%lx) not inside outer block (0x%lx-0x%lx)", 0, 0};
87 struct complaint blockvector_complaint
=
88 {"block at %s out of order", 0, 0};
90 /* maintain the lists of symbols and blocks */
92 /* Add a pending list to free_pendings. */
94 add_free_pendings (struct pending
*list
)
96 register struct pending
*link
= list
;
100 while (link
->next
) link
= link
->next
;
101 link
->next
= free_pendings
;
102 free_pendings
= list
;
106 /* Add a symbol to one of the lists of symbols. */
109 add_symbol_to_list (struct symbol
*symbol
, struct pending
**listhead
)
111 register struct pending
*link
;
113 /* If this is an alias for another symbol, don't add it. */
114 if (symbol
->ginfo
.name
&& symbol
->ginfo
.name
[0] == '#')
117 /* We keep PENDINGSIZE symbols in each link of the list. If we
118 don't have a link with room in it, add a new link. */
119 if (*listhead
== NULL
|| (*listhead
)->nsyms
== PENDINGSIZE
)
123 link
= free_pendings
;
124 free_pendings
= link
->next
;
128 link
= (struct pending
*) xmalloc (sizeof (struct pending
));
131 link
->next
= *listhead
;
136 (*listhead
)->symbol
[(*listhead
)->nsyms
++] = symbol
;
139 /* Find a symbol named NAME on a LIST. NAME need not be
140 '\0'-terminated; LENGTH is the length of the name. */
143 find_symbol_in_list (struct pending
*list
, char *name
, int length
)
150 for (j
= list
->nsyms
; --j
>= 0;)
152 pp
= SYMBOL_NAME (list
->symbol
[j
]);
153 if (*pp
== *name
&& strncmp (pp
, name
, length
) == 0 &&
156 return (list
->symbol
[j
]);
164 /* At end of reading syms, or in case of quit, really free as many
165 `struct pending's as we can easily find. */
169 really_free_pendings (PTR dummy
)
171 struct pending
*next
, *next1
;
173 for (next
= free_pendings
; next
; next
= next1
)
176 xfree ((void *) next
);
178 free_pendings
= NULL
;
180 free_pending_blocks ();
182 for (next
= file_symbols
; next
!= NULL
; next
= next1
)
185 xfree ((void *) next
);
189 for (next
= global_symbols
; next
!= NULL
; next
= next1
)
192 xfree ((void *) next
);
194 global_symbols
= NULL
;
197 /* This function is called to discard any pending blocks. */
200 free_pending_blocks (void)
202 #if 0 /* Now we make the links in the
203 symbol_obstack, so don't free
205 struct pending_block
*bnext
, *bnext1
;
207 for (bnext
= pending_blocks
; bnext
; bnext
= bnext1
)
209 bnext1
= bnext
->next
;
210 xfree ((void *) bnext
);
213 pending_blocks
= NULL
;
216 /* Take one of the lists of symbols and make a block from it. Keep
217 the order the symbols have in the list (reversed from the input
218 file). Put the block on the list of pending blocks. */
221 finish_block (struct symbol
*symbol
, struct pending
**listhead
,
222 struct pending_block
*old_blocks
,
223 CORE_ADDR start
, CORE_ADDR end
,
224 struct objfile
*objfile
)
226 register struct pending
*next
, *next1
;
227 register struct block
*block
;
228 register struct pending_block
*pblock
;
229 struct pending_block
*opblock
;
233 /* Count the length of the list of symbols. */
235 for (next
= *listhead
, i
= 0;
237 i
+= next
->nsyms
, next
= next
->next
)
242 block
= (struct block
*) obstack_alloc (&objfile
->symbol_obstack
,
243 (sizeof (struct block
) + ((i
- 1) * sizeof (struct symbol
*))));
245 /* Copy the symbols into the block. */
247 BLOCK_NSYMS (block
) = i
;
248 for (next
= *listhead
; next
; next
= next
->next
)
250 for (j
= next
->nsyms
- 1; j
>= 0; j
--)
252 BLOCK_SYM (block
, --i
) = next
->symbol
[j
];
256 BLOCK_START (block
) = start
;
257 BLOCK_END (block
) = end
;
258 /* Superblock filled in when containing block is made */
259 BLOCK_SUPERBLOCK (block
) = NULL
;
261 BLOCK_GCC_COMPILED (block
) = processing_gcc_compilation
;
263 /* Put the block in as the value of the symbol that names it. */
267 struct type
*ftype
= SYMBOL_TYPE (symbol
);
268 SYMBOL_BLOCK_VALUE (symbol
) = block
;
269 BLOCK_FUNCTION (block
) = symbol
;
271 if (TYPE_NFIELDS (ftype
) <= 0)
273 /* No parameter type information is recorded with the
274 function's type. Set that from the type of the
275 parameter symbols. */
276 int nparams
= 0, iparams
;
278 for (i
= 0; i
< BLOCK_NSYMS (block
); i
++)
280 sym
= BLOCK_SYM (block
, i
);
281 switch (SYMBOL_CLASS (sym
))
286 case LOC_REGPARM_ADDR
:
287 case LOC_BASEREG_ARG
:
300 case LOC_CONST_BYTES
:
303 case LOC_OPTIMIZED_OUT
:
310 TYPE_NFIELDS (ftype
) = nparams
;
311 TYPE_FIELDS (ftype
) = (struct field
*)
312 TYPE_ALLOC (ftype
, nparams
* sizeof (struct field
));
314 for (i
= iparams
= 0; iparams
< nparams
; i
++)
316 sym
= BLOCK_SYM (block
, i
);
317 switch (SYMBOL_CLASS (sym
))
322 case LOC_REGPARM_ADDR
:
323 case LOC_BASEREG_ARG
:
325 TYPE_FIELD_TYPE (ftype
, iparams
) = SYMBOL_TYPE (sym
);
337 case LOC_CONST_BYTES
:
340 case LOC_OPTIMIZED_OUT
:
350 BLOCK_FUNCTION (block
) = NULL
;
353 /* Now "free" the links of the list, and empty the list. */
355 for (next
= *listhead
; next
; next
= next1
)
358 next
->next
= free_pendings
;
359 free_pendings
= next
;
364 /* Check to be sure that the blocks have an end address that is
365 greater than starting address */
367 if (BLOCK_END (block
) < BLOCK_START (block
))
371 complain (&block_end_complaint
, SYMBOL_SOURCE_NAME (symbol
));
375 complain (&anon_block_end_complaint
, BLOCK_END (block
), BLOCK_START (block
));
377 /* Better than nothing */
378 BLOCK_END (block
) = BLOCK_START (block
);
382 /* Install this block as the superblock of all blocks made since the
383 start of this scope that don't have superblocks yet. */
386 for (pblock
= pending_blocks
; pblock
!= old_blocks
; pblock
= pblock
->next
)
388 if (BLOCK_SUPERBLOCK (pblock
->block
) == NULL
)
391 /* Check to be sure the blocks are nested as we receive
392 them. If the compiler/assembler/linker work, this just
393 burns a small amount of time. */
394 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
) ||
395 BLOCK_END (pblock
->block
) > BLOCK_END (block
))
399 complain (&innerblock_complaint
,
400 SYMBOL_SOURCE_NAME (symbol
));
404 complain (&innerblock_anon_complaint
, BLOCK_START (pblock
->block
),
405 BLOCK_END (pblock
->block
), BLOCK_START (block
),
408 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
))
409 BLOCK_START (pblock
->block
) = BLOCK_START (block
);
410 if (BLOCK_END (pblock
->block
) > BLOCK_END (block
))
411 BLOCK_END (pblock
->block
) = BLOCK_END (block
);
414 BLOCK_SUPERBLOCK (pblock
->block
) = block
;
419 record_pending_block (objfile
, block
, opblock
);
422 /* Record BLOCK on the list of all blocks in the file. Put it after
423 OPBLOCK, or at the beginning if opblock is NULL. This puts the
424 block in the list after all its subblocks.
426 Allocate the pending block struct in the symbol_obstack to save
427 time. This wastes a little space. FIXME: Is it worth it? */
430 record_pending_block (struct objfile
*objfile
, struct block
*block
,
431 struct pending_block
*opblock
)
433 register struct pending_block
*pblock
;
435 pblock
= (struct pending_block
*)
436 obstack_alloc (&objfile
->symbol_obstack
, sizeof (struct pending_block
));
437 pblock
->block
= block
;
440 pblock
->next
= opblock
->next
;
441 opblock
->next
= pblock
;
445 pblock
->next
= pending_blocks
;
446 pending_blocks
= pblock
;
450 /* Note that this is only used in this file and in dstread.c, which
451 should be fixed to not need direct access to this function. When
452 that is done, it can be made static again. */
455 make_blockvector (struct objfile
*objfile
)
457 register struct pending_block
*next
;
458 register struct blockvector
*blockvector
;
461 /* Count the length of the list of blocks. */
463 for (next
= pending_blocks
, i
= 0; next
; next
= next
->next
, i
++)
467 blockvector
= (struct blockvector
*)
468 obstack_alloc (&objfile
->symbol_obstack
,
469 (sizeof (struct blockvector
)
470 + (i
- 1) * sizeof (struct block
*)));
472 /* Copy the blocks into the blockvector. This is done in reverse
473 order, which happens to put the blocks into the proper order
474 (ascending starting address). finish_block has hair to insert
475 each block into the list after its subblocks in order to make
476 sure this is true. */
478 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
479 for (next
= pending_blocks
; next
; next
= next
->next
)
481 BLOCKVECTOR_BLOCK (blockvector
, --i
) = next
->block
;
484 #if 0 /* Now we make the links in the
485 obstack, so don't free them. */
486 /* Now free the links of the list, and empty the list. */
488 for (next
= pending_blocks
; next
; next
= next1
)
494 pending_blocks
= NULL
;
496 #if 1 /* FIXME, shut this off after a while
497 to speed up symbol reading. */
498 /* Some compilers output blocks in the wrong order, but we depend on
499 their being in the right order so we can binary search. Check the
500 order and moan about it. FIXME. */
501 if (BLOCKVECTOR_NBLOCKS (blockvector
) > 1)
503 for (i
= 1; i
< BLOCKVECTOR_NBLOCKS (blockvector
); i
++)
505 if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
- 1))
506 > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
)))
509 = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector
, i
));
511 complain (&blockvector_complaint
,
512 longest_local_hex_string ((LONGEST
) start
));
518 return (blockvector
);
521 /* Start recording information about source code that came from an
522 included (or otherwise merged-in) source file with a different
523 name. NAME is the name of the file (cannot be NULL), DIRNAME is
524 the directory in which it resides (or NULL if not known). */
527 start_subfile (char *name
, char *dirname
)
529 register struct subfile
*subfile
;
531 /* See if this subfile is already known as a subfile of the current
534 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
536 if (FILENAME_CMP (subfile
->name
, name
) == 0)
538 current_subfile
= subfile
;
543 /* This subfile is not known. Add an entry for it. Make an entry
544 for this subfile in the list of all subfiles of the current main
547 subfile
= (struct subfile
*) xmalloc (sizeof (struct subfile
));
548 memset ((char *) subfile
, 0, sizeof (struct subfile
));
549 subfile
->next
= subfiles
;
551 current_subfile
= subfile
;
553 /* Save its name and compilation directory name */
554 subfile
->name
= (name
== NULL
) ? NULL
: savestring (name
, strlen (name
));
556 (dirname
== NULL
) ? NULL
: savestring (dirname
, strlen (dirname
));
558 /* Initialize line-number recording for this subfile. */
559 subfile
->line_vector
= NULL
;
561 /* Default the source language to whatever can be deduced from the
562 filename. If nothing can be deduced (such as for a C/C++ include
563 file with a ".h" extension), then inherit whatever language the
564 previous subfile had. This kludgery is necessary because there
565 is no standard way in some object formats to record the source
566 language. Also, when symtabs are allocated we try to deduce a
567 language then as well, but it is too late for us to use that
568 information while reading symbols, since symtabs aren't allocated
569 until after all the symbols have been processed for a given
572 subfile
->language
= deduce_language_from_filename (subfile
->name
);
573 if (subfile
->language
== language_unknown
&&
574 subfile
->next
!= NULL
)
576 subfile
->language
= subfile
->next
->language
;
579 /* Initialize the debug format string to NULL. We may supply it
580 later via a call to record_debugformat. */
581 subfile
->debugformat
= NULL
;
583 /* cfront output is a C program, so in most ways it looks like a C
584 program. But to demangle we need to set the language to C++. We
585 can distinguish cfront code by the fact that it has #line
586 directives which specify a file name ending in .C.
588 So if the filename of this subfile ends in .C, then change the
589 language of any pending subfiles from C to C++. We also accept
590 any other C++ suffixes accepted by deduce_language_from_filename
591 (in particular, some people use .cxx with cfront). */
592 /* Likewise for f2c. */
597 enum language sublang
= deduce_language_from_filename (subfile
->name
);
599 if (sublang
== language_cplus
|| sublang
== language_fortran
)
600 for (s
= subfiles
; s
!= NULL
; s
= s
->next
)
601 if (s
->language
== language_c
)
602 s
->language
= sublang
;
605 /* And patch up this file if necessary. */
606 if (subfile
->language
== language_c
607 && subfile
->next
!= NULL
608 && (subfile
->next
->language
== language_cplus
609 || subfile
->next
->language
== language_fortran
))
611 subfile
->language
= subfile
->next
->language
;
615 /* For stabs readers, the first N_SO symbol is assumed to be the
616 source file name, and the subfile struct is initialized using that
617 assumption. If another N_SO symbol is later seen, immediately
618 following the first one, then the first one is assumed to be the
619 directory name and the second one is really the source file name.
621 So we have to patch up the subfile struct by moving the old name
622 value to dirname and remembering the new name. Some sanity
623 checking is performed to ensure that the state of the subfile
624 struct is reasonable and that the old name we are assuming to be a
625 directory name actually is (by checking for a trailing '/'). */
628 patch_subfile_names (struct subfile
*subfile
, char *name
)
630 if (subfile
!= NULL
&& subfile
->dirname
== NULL
&& subfile
->name
!= NULL
631 && subfile
->name
[strlen (subfile
->name
) - 1] == '/')
633 subfile
->dirname
= subfile
->name
;
634 subfile
->name
= savestring (name
, strlen (name
));
635 last_source_file
= name
;
637 /* Default the source language to whatever can be deduced from
638 the filename. If nothing can be deduced (such as for a C/C++
639 include file with a ".h" extension), then inherit whatever
640 language the previous subfile had. This kludgery is
641 necessary because there is no standard way in some object
642 formats to record the source language. Also, when symtabs
643 are allocated we try to deduce a language then as well, but
644 it is too late for us to use that information while reading
645 symbols, since symtabs aren't allocated until after all the
646 symbols have been processed for a given source file. */
648 subfile
->language
= deduce_language_from_filename (subfile
->name
);
649 if (subfile
->language
== language_unknown
&&
650 subfile
->next
!= NULL
)
652 subfile
->language
= subfile
->next
->language
;
657 /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
658 switching source files (different subfiles, as we call them) within
659 one object file, but using a stack rather than in an arbitrary
665 register struct subfile_stack
*tem
666 = (struct subfile_stack
*) xmalloc (sizeof (struct subfile_stack
));
668 tem
->next
= subfile_stack
;
670 if (current_subfile
== NULL
|| current_subfile
->name
== NULL
)
672 internal_error (__FILE__
, __LINE__
, "failed internal consistency check");
674 tem
->name
= current_subfile
->name
;
681 register struct subfile_stack
*link
= subfile_stack
;
685 internal_error (__FILE__
, __LINE__
, "failed internal consistency check");
688 subfile_stack
= link
->next
;
689 xfree ((void *) link
);
693 /* Add a linetable entry for line number LINE and address PC to the
694 line vector for SUBFILE. */
697 record_line (register struct subfile
*subfile
, int line
, CORE_ADDR pc
)
699 struct linetable_entry
*e
;
700 /* Ignore the dummy line number in libg.o */
707 /* Make sure line vector exists and is big enough. */
708 if (!subfile
->line_vector
)
710 subfile
->line_vector_length
= INITIAL_LINE_VECTOR_LENGTH
;
711 subfile
->line_vector
= (struct linetable
*)
712 xmalloc (sizeof (struct linetable
)
713 + subfile
->line_vector_length
* sizeof (struct linetable_entry
));
714 subfile
->line_vector
->nitems
= 0;
715 have_line_numbers
= 1;
718 if (subfile
->line_vector
->nitems
+ 1 >= subfile
->line_vector_length
)
720 subfile
->line_vector_length
*= 2;
721 subfile
->line_vector
= (struct linetable
*)
722 xrealloc ((char *) subfile
->line_vector
,
723 (sizeof (struct linetable
)
724 + (subfile
->line_vector_length
725 * sizeof (struct linetable_entry
))));
728 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
++;
730 e
->pc
= ADDR_BITS_REMOVE(pc
);
733 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
736 compare_line_numbers (const void *ln1p
, const void *ln2p
)
738 struct linetable_entry
*ln1
= (struct linetable_entry
*) ln1p
;
739 struct linetable_entry
*ln2
= (struct linetable_entry
*) ln2p
;
741 /* Note: this code does not assume that CORE_ADDRs can fit in ints.
742 Please keep it that way. */
743 if (ln1
->pc
< ln2
->pc
)
746 if (ln1
->pc
> ln2
->pc
)
749 /* If pc equal, sort by line. I'm not sure whether this is optimum
750 behavior (see comment at struct linetable in symtab.h). */
751 return ln1
->line
- ln2
->line
;
754 /* Start a new symtab for a new source file. Called, for example,
755 when a stabs symbol of type N_SO is seen, or when a DWARF
756 TAG_compile_unit DIE is seen. It indicates the start of data for
757 one original source file. */
760 start_symtab (char *name
, char *dirname
, CORE_ADDR start_addr
)
763 last_source_file
= name
;
764 last_source_start_addr
= start_addr
;
766 global_symbols
= NULL
;
768 have_line_numbers
= 0;
770 /* Context stack is initially empty. Allocate first one with room
771 for 10 levels; reuse it forever afterward. */
772 if (context_stack
== NULL
)
774 context_stack_size
= INITIAL_CONTEXT_STACK_SIZE
;
775 context_stack
= (struct context_stack
*)
776 xmalloc (context_stack_size
* sizeof (struct context_stack
));
778 context_stack_depth
= 0;
780 /* Initialize the list of sub source files with one entry for this
781 file (the top-level source file). */
784 current_subfile
= NULL
;
785 start_subfile (name
, dirname
);
788 /* Finish the symbol definitions for one main source file, close off
789 all the lexical contexts for that file (creating struct block's for
790 them), then make the struct symtab for that file and put it in the
793 END_ADDR is the address of the end of the file's text. SECTION is
794 the section number (in objfile->section_offsets) of the blockvector
797 Note that it is possible for end_symtab() to return NULL. In
798 particular, for the DWARF case at least, it will return NULL when
799 it finds a compilation unit that has exactly one DIE, a
800 TAG_compile_unit DIE. This can happen when we link in an object
801 file that was compiled from an empty source file. Returning NULL
802 is probably not the correct thing to do, because then gdb will
803 never know about this empty file (FIXME). */
806 end_symtab (CORE_ADDR end_addr
, struct objfile
*objfile
, int section
)
808 register struct symtab
*symtab
= NULL
;
809 register struct blockvector
*blockvector
;
810 register struct subfile
*subfile
;
811 register struct context_stack
*cstk
;
812 struct subfile
*nextsub
;
814 /* Finish the lexical context of the last function in the file; pop
815 the context stack. */
817 if (context_stack_depth
> 0)
819 cstk
= pop_context ();
820 /* Make a block for the local symbols within. */
821 finish_block (cstk
->name
, &local_symbols
, cstk
->old_blocks
,
822 cstk
->start_addr
, end_addr
, objfile
);
824 if (context_stack_depth
> 0)
826 /* This is said to happen with SCO. The old coffread.c
827 code simply emptied the context stack, so we do the
828 same. FIXME: Find out why it is happening. This is not
829 believed to happen in most cases (even for coffread.c);
830 it used to be an abort(). */
831 static struct complaint msg
=
832 {"Context stack not empty in end_symtab", 0, 0};
834 context_stack_depth
= 0;
838 /* Reordered executables may have out of order pending blocks; if
839 OBJF_REORDERED is true, then sort the pending blocks. */
840 if ((objfile
->flags
& OBJF_REORDERED
) && pending_blocks
)
842 /* FIXME! Remove this horrid bubble sort and use merge sort!!! */
846 struct pending_block
*pb
, *pbnext
;
854 /* swap blocks if unordered! */
856 if (BLOCK_START (pb
->block
) < BLOCK_START (pbnext
->block
))
858 struct block
*tmp
= pb
->block
;
859 pb
->block
= pbnext
->block
;
864 pbnext
= pbnext
->next
;
870 /* Cleanup any undefined types that have been left hanging around
871 (this needs to be done before the finish_blocks so that
872 file_symbols is still good).
874 Both cleanup_undefined_types and finish_global_stabs are stabs
875 specific, but harmless for other symbol readers, since on gdb
876 startup or when finished reading stabs, the state is set so these
877 are no-ops. FIXME: Is this handled right in case of QUIT? Can
878 we make this cleaner? */
880 cleanup_undefined_types ();
881 finish_global_stabs (objfile
);
883 if (pending_blocks
== NULL
884 && file_symbols
== NULL
885 && global_symbols
== NULL
886 && have_line_numbers
== 0)
888 /* Ignore symtabs that have no functions with real debugging
894 /* Define the STATIC_BLOCK & GLOBAL_BLOCK, and build the
896 finish_block (0, &file_symbols
, 0, last_source_start_addr
, end_addr
,
898 finish_block (0, &global_symbols
, 0, last_source_start_addr
, end_addr
,
900 blockvector
= make_blockvector (objfile
);
903 #ifndef PROCESS_LINENUMBER_HOOK
904 #define PROCESS_LINENUMBER_HOOK()
906 PROCESS_LINENUMBER_HOOK (); /* Needed for xcoff. */
908 /* Now create the symtab objects proper, one for each subfile. */
909 /* (The main file is the last one on the chain.) */
911 for (subfile
= subfiles
; subfile
; subfile
= nextsub
)
913 int linetablesize
= 0;
916 /* If we have blocks of symbols, make a symtab. Otherwise, just
917 ignore this file and any line number info in it. */
920 if (subfile
->line_vector
)
922 linetablesize
= sizeof (struct linetable
) +
923 subfile
->line_vector
->nitems
* sizeof (struct linetable_entry
);
925 /* I think this is artifact from before it went on the
926 obstack. I doubt we'll need the memory between now
927 and when we free it later in this function. */
928 /* First, shrink the linetable to make more memory. */
929 subfile
->line_vector
= (struct linetable
*)
930 xrealloc ((char *) subfile
->line_vector
, linetablesize
);
933 /* Like the pending blocks, the line table may be
934 scrambled in reordered executables. Sort it if
935 OBJF_REORDERED is true. */
936 if (objfile
->flags
& OBJF_REORDERED
)
937 qsort (subfile
->line_vector
->item
,
938 subfile
->line_vector
->nitems
,
939 sizeof (struct linetable_entry
), compare_line_numbers
);
942 /* Now, allocate a symbol table. */
943 symtab
= allocate_symtab (subfile
->name
, objfile
);
945 /* Fill in its components. */
946 symtab
->blockvector
= blockvector
;
947 if (subfile
->line_vector
)
949 /* Reallocate the line table on the symbol obstack */
950 symtab
->linetable
= (struct linetable
*)
951 obstack_alloc (&objfile
->symbol_obstack
, linetablesize
);
952 memcpy (symtab
->linetable
, subfile
->line_vector
, linetablesize
);
956 symtab
->linetable
= NULL
;
958 symtab
->block_line_section
= section
;
959 if (subfile
->dirname
)
961 /* Reallocate the dirname on the symbol obstack */
962 symtab
->dirname
= (char *)
963 obstack_alloc (&objfile
->symbol_obstack
,
964 strlen (subfile
->dirname
) + 1);
965 strcpy (symtab
->dirname
, subfile
->dirname
);
969 symtab
->dirname
= NULL
;
971 symtab
->free_code
= free_linetable
;
972 symtab
->free_ptr
= NULL
;
974 /* Use whatever language we have been using for this
975 subfile, not the one that was deduced in allocate_symtab
976 from the filename. We already did our own deducing when
977 we created the subfile, and we may have altered our
978 opinion of what language it is from things we found in
980 symtab
->language
= subfile
->language
;
982 /* Save the debug format string (if any) in the symtab */
983 if (subfile
->debugformat
!= NULL
)
985 symtab
->debugformat
= obsavestring (subfile
->debugformat
,
986 strlen (subfile
->debugformat
),
987 &objfile
->symbol_obstack
);
990 /* All symtabs for the main file and the subfiles share a
991 blockvector, so we need to clear primary for everything
992 but the main file. */
996 if (subfile
->name
!= NULL
)
998 xfree ((void *) subfile
->name
);
1000 if (subfile
->dirname
!= NULL
)
1002 xfree ((void *) subfile
->dirname
);
1004 if (subfile
->line_vector
!= NULL
)
1006 xfree ((void *) subfile
->line_vector
);
1008 if (subfile
->debugformat
!= NULL
)
1010 xfree ((void *) subfile
->debugformat
);
1013 nextsub
= subfile
->next
;
1014 xfree ((void *) subfile
);
1017 /* Set this for the main source file. */
1020 symtab
->primary
= 1;
1023 last_source_file
= NULL
;
1024 current_subfile
= NULL
;
1029 /* Push a context block. Args are an identifying nesting level
1030 (checkable when you pop it), and the starting PC address of this
1033 struct context_stack
*
1034 push_context (int desc
, CORE_ADDR valu
)
1036 register struct context_stack
*new;
1038 if (context_stack_depth
== context_stack_size
)
1040 context_stack_size
*= 2;
1041 context_stack
= (struct context_stack
*)
1042 xrealloc ((char *) context_stack
,
1043 (context_stack_size
* sizeof (struct context_stack
)));
1046 new = &context_stack
[context_stack_depth
++];
1048 new->locals
= local_symbols
;
1049 new->params
= param_symbols
;
1050 new->old_blocks
= pending_blocks
;
1051 new->start_addr
= valu
;
1054 local_symbols
= NULL
;
1055 param_symbols
= NULL
;
1061 /* Compute a small integer hash code for the given name. */
1064 hashname (char *name
)
1066 return (hash(name
,strlen(name
)) % HASHSIZE
);
1071 record_debugformat (char *format
)
1073 current_subfile
->debugformat
= savestring (format
, strlen (format
));
1076 /* Merge the first symbol list SRCLIST into the second symbol list
1077 TARGETLIST by repeated calls to add_symbol_to_list(). This
1078 procedure "frees" each link of SRCLIST by adding it to the
1079 free_pendings list. Caller must set SRCLIST to a null list after
1080 calling this function.
1085 merge_symbol_lists (struct pending
**srclist
, struct pending
**targetlist
)
1089 if (!srclist
|| !*srclist
)
1092 /* Merge in elements from current link. */
1093 for (i
= 0; i
< (*srclist
)->nsyms
; i
++)
1094 add_symbol_to_list ((*srclist
)->symbol
[i
], targetlist
);
1096 /* Recurse on next. */
1097 merge_symbol_lists (&(*srclist
)->next
, targetlist
);
1099 /* "Free" the current link. */
1100 (*srclist
)->next
= free_pendings
;
1101 free_pendings
= (*srclist
);
1104 /* Initialize anything that needs initializing when starting to read a
1105 fresh piece of a symbol file, e.g. reading in the stuff
1106 corresponding to a psymtab. */
1109 buildsym_init (void)
1111 free_pendings
= NULL
;
1112 file_symbols
= NULL
;
1113 global_symbols
= NULL
;
1114 pending_blocks
= NULL
;
1117 /* Initialize anything that needs initializing when a completely new
1118 symbol file is specified (not just adding some symbols from another
1119 file, e.g. a shared library). */
1122 buildsym_new_init (void)