1 /* Support routines for building symbol tables in GDB's internal format.
2 Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1995, 1996
3 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, Boston, MA 02111-1307, USA. */
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. */
32 #include "symfile.h" /* Needed for "struct complaint" */
35 #include "complaints.h"
36 #include "gdb_string.h"
38 /* Ask buildsym.h to define the vars it normally declares `extern'. */
40 #include "buildsym.h" /* Our own declarations */
43 /* For cleanup_undefined_types and finish_global_stabs (somewhat
44 questionable--see comment where we call them). */
45 #include "stabsread.h"
47 /* Pointer to the head of a linked list of symbol blocks which have
48 already been finalized (lexical contexts already closed) and which are
49 just waiting to be built into a blockvector when finalizing the
52 static struct pending_block
*pending_blocks
= NULL
;
54 /* List of free `struct pending' structures for reuse. */
56 static struct pending
*free_pendings
;
60 compare_line_numbers
PARAMS ((const void *, const void *));
63 /* Initial sizes of data structures. These are realloc'd larger if needed,
64 and realloc'd down to the size actually used, when completed. */
66 #define INITIAL_CONTEXT_STACK_SIZE 10
67 #define INITIAL_LINE_VECTOR_LENGTH 1000
70 /* Complaints about the symbols we have encountered. */
72 struct complaint block_end_complaint
=
73 {"block end address less than block start address in %s (patched it)", 0, 0};
75 struct complaint anon_block_end_complaint
=
76 {"block end address 0x%lx less than block start address 0x%lx (patched it)", 0, 0};
78 struct complaint innerblock_complaint
=
79 {"inner block not inside outer block in %s", 0, 0};
81 struct complaint innerblock_anon_complaint
=
82 {"inner block (0x%lx-0x%lx) not inside outer block (0x%lx-0x%lx)", 0, 0};
84 struct complaint blockvector_complaint
=
85 {"block at 0x%lx out of order", 0, 0};
88 /* maintain the lists of symbols and blocks */
90 /* Add a symbol to one of the lists of symbols. */
93 add_symbol_to_list (symbol
, listhead
)
94 struct symbol
*symbol
;
95 struct pending
**listhead
;
97 register struct pending
*link
;
99 /* We keep PENDINGSIZE symbols in each link of the list.
100 If we don't have a link with room in it, add a new link. */
101 if (*listhead
== NULL
|| (*listhead
)->nsyms
== PENDINGSIZE
)
105 link
= free_pendings
;
106 free_pendings
= link
->next
;
110 link
= (struct pending
*) xmalloc (sizeof (struct pending
));
113 link
->next
= *listhead
;
118 (*listhead
)->symbol
[(*listhead
)->nsyms
++] = symbol
;
121 /* Find a symbol named NAME on a LIST. NAME need not be '\0'-terminated;
122 LENGTH is the length of the name. */
125 find_symbol_in_list (list
, name
, length
)
126 struct pending
*list
;
135 for (j
= list
->nsyms
; --j
>= 0; )
137 pp
= SYMBOL_NAME (list
->symbol
[j
]);
138 if (*pp
== *name
&& strncmp (pp
, name
, length
) == 0 &&
141 return (list
->symbol
[j
]);
149 /* At end of reading syms, or in case of quit,
150 really free as many `struct pending's as we can easily find. */
154 really_free_pendings (foo
)
157 struct pending
*next
, *next1
;
159 for (next
= free_pendings
; next
; next
= next1
)
164 free_pendings
= NULL
;
166 free_pending_blocks ();
168 for (next
= file_symbols
; next
!= NULL
; next
= next1
)
175 for (next
= global_symbols
; next
!= NULL
; next
= next1
)
180 global_symbols
= NULL
;
183 /* This function is called to discard any pending blocks. */
186 free_pending_blocks ()
188 #if 0 /* Now we make the links in the symbol_obstack, so don't free them. */
189 struct pending_block
*bnext
, *bnext1
;
191 for (bnext
= pending_blocks
; bnext
; bnext
= bnext1
)
193 bnext1
= bnext
->next
;
197 pending_blocks
= NULL
;
200 /* Take one of the lists of symbols and make a block from it.
201 Keep the order the symbols have in the list (reversed from the input file).
202 Put the block on the list of pending blocks. */
205 finish_block (symbol
, listhead
, old_blocks
, start
, end
, objfile
)
206 struct symbol
*symbol
;
207 struct pending
**listhead
;
208 struct pending_block
*old_blocks
;
209 CORE_ADDR start
, end
;
210 struct objfile
*objfile
;
212 register struct pending
*next
, *next1
;
213 register struct block
*block
;
214 register struct pending_block
*pblock
;
215 struct pending_block
*opblock
;
219 /* Count the length of the list of symbols. */
221 for (next
= *listhead
, i
= 0;
223 i
+= next
->nsyms
, next
= next
->next
)
228 block
= (struct block
*) obstack_alloc (&objfile
-> symbol_obstack
,
229 (sizeof (struct block
) + ((i
- 1) * sizeof (struct symbol
*))));
231 /* Copy the symbols into the block. */
233 BLOCK_NSYMS (block
) = i
;
234 for (next
= *listhead
; next
; next
= next
->next
)
236 for (j
= next
->nsyms
- 1; j
>= 0; j
--)
238 BLOCK_SYM (block
, --i
) = next
->symbol
[j
];
242 BLOCK_START (block
) = start
;
243 BLOCK_END (block
) = end
;
244 /* Superblock filled in when containing block is made */
245 BLOCK_SUPERBLOCK (block
) = NULL
;
246 BLOCK_GCC_COMPILED (block
) = processing_gcc_compilation
;
248 /* Put the block in as the value of the symbol that names it. */
252 struct type
*ftype
= SYMBOL_TYPE (symbol
);
253 SYMBOL_BLOCK_VALUE (symbol
) = block
;
254 BLOCK_FUNCTION (block
) = symbol
;
256 if (TYPE_NFIELDS (ftype
) <= 0)
258 /* No parameter type information is recorded with the function's
259 type. Set that from the type of the parameter symbols. */
260 int nparams
= 0, iparams
;
262 for (i
= 0; i
< BLOCK_NSYMS (block
); i
++)
264 sym
= BLOCK_SYM (block
, i
);
265 switch (SYMBOL_CLASS (sym
))
270 case LOC_REGPARM_ADDR
:
271 case LOC_BASEREG_ARG
:
283 case LOC_CONST_BYTES
:
286 case LOC_OPTIMIZED_OUT
:
293 TYPE_NFIELDS (ftype
) = nparams
;
294 TYPE_FIELDS (ftype
) = (struct field
*)
295 TYPE_ALLOC (ftype
, nparams
* sizeof (struct field
));
297 for (i
= iparams
= 0; iparams
< nparams
; i
++)
299 sym
= BLOCK_SYM (block
, i
);
300 switch (SYMBOL_CLASS (sym
))
305 case LOC_REGPARM_ADDR
:
306 case LOC_BASEREG_ARG
:
308 TYPE_FIELD_TYPE (ftype
, iparams
) = SYMBOL_TYPE (sym
);
319 case LOC_CONST_BYTES
:
322 case LOC_OPTIMIZED_OUT
:
332 BLOCK_FUNCTION (block
) = NULL
;
335 /* Now "free" the links of the list, and empty the list. */
337 for (next
= *listhead
; next
; next
= next1
)
340 next
->next
= free_pendings
;
341 free_pendings
= next
;
346 /* Check to be sure that the blocks have an end address that is
347 greater than starting address */
349 if (BLOCK_END (block
) < BLOCK_START (block
))
353 complain (&block_end_complaint
, SYMBOL_SOURCE_NAME (symbol
));
357 complain (&anon_block_end_complaint
, BLOCK_END (block
), BLOCK_START (block
));
359 /* Better than nothing */
360 BLOCK_END (block
) = BLOCK_START (block
);
364 /* Install this block as the superblock
365 of all blocks made since the start of this scope
366 that don't have superblocks yet. */
369 for (pblock
= pending_blocks
; pblock
!= old_blocks
; pblock
= pblock
->next
)
371 if (BLOCK_SUPERBLOCK (pblock
->block
) == NULL
)
374 /* Check to be sure the blocks are nested as we receive them.
375 If the compiler/assembler/linker work, this just burns a small
377 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
) ||
378 BLOCK_END (pblock
->block
) > BLOCK_END (block
))
382 complain (&innerblock_complaint
,
383 SYMBOL_SOURCE_NAME (symbol
));
387 complain (&innerblock_anon_complaint
, BLOCK_START (pblock
->block
),
388 BLOCK_END (pblock
->block
), BLOCK_START (block
),
391 if (BLOCK_START (pblock
->block
) < BLOCK_START (block
))
392 BLOCK_START (pblock
->block
) = BLOCK_START (block
);
393 if (BLOCK_END (pblock
->block
) > BLOCK_END (block
))
394 BLOCK_END (pblock
->block
) = BLOCK_END (block
);
397 BLOCK_SUPERBLOCK (pblock
->block
) = block
;
402 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 block
407 in the list after all its subblocks.
409 Allocate the pending block struct in the symbol_obstack to save
410 time. This wastes a little space. FIXME: Is it worth it? */
413 record_pending_block (objfile
, block
, opblock
)
414 struct objfile
* objfile
;
416 struct pending_block
*opblock
;
418 register struct pending_block
*pblock
;
420 pblock
= (struct pending_block
*)
421 obstack_alloc (&objfile
-> symbol_obstack
, sizeof (struct pending_block
));
422 pblock
-> block
= block
;
425 pblock
-> next
= opblock
-> next
;
426 opblock
-> next
= pblock
;
430 pblock
-> next
= pending_blocks
;
431 pending_blocks
= pblock
;
435 /* Note that this is only used in this file and in dstread.c, which should be
436 fixed to not need direct access to this function. When that is done, it can
437 be made static again. */
440 make_blockvector (objfile
)
441 struct objfile
*objfile
;
443 register struct pending_block
*next
;
444 register struct blockvector
*blockvector
;
447 /* Count the length of the list of blocks. */
449 for (next
= pending_blocks
, i
= 0; next
; next
= next
->next
, i
++) {;}
451 blockvector
= (struct blockvector
*)
452 obstack_alloc (&objfile
-> symbol_obstack
,
453 (sizeof (struct blockvector
)
454 + (i
- 1) * sizeof (struct block
*)));
456 /* Copy the blocks into the blockvector.
457 This is done in reverse order, which happens to put
458 the blocks into the proper order (ascending starting address).
459 finish_block has hair to insert each block into the list
460 after its subblocks in order to make sure this is true. */
462 BLOCKVECTOR_NBLOCKS (blockvector
) = i
;
463 for (next
= pending_blocks
; next
; next
= next
->next
)
465 BLOCKVECTOR_BLOCK (blockvector
, --i
) = next
->block
;
468 #if 0 /* Now we make the links in the obstack, so don't free them. */
469 /* Now free the links of the list, and empty the list. */
471 for (next
= pending_blocks
; next
; next
= next1
)
477 pending_blocks
= NULL
;
479 #if 1 /* FIXME, shut this off after a while to speed up symbol reading. */
480 /* Some compilers output blocks in the wrong order, but we depend
481 on their being in the right order so we can binary search.
482 Check the order and moan about it. FIXME. */
483 if (BLOCKVECTOR_NBLOCKS (blockvector
) > 1)
485 for (i
= 1; i
< BLOCKVECTOR_NBLOCKS (blockvector
); i
++)
487 if (BLOCK_START(BLOCKVECTOR_BLOCK (blockvector
, i
-1))
488 > BLOCK_START(BLOCKVECTOR_BLOCK (blockvector
, i
)))
491 /* FIXME-32x64: loses if CORE_ADDR doesn't fit in a
492 long. Possible solutions include a version of
493 complain which takes a callback, a
494 sprintf_address_numeric to match
495 print_address_numeric, or a way to set up a GDB_FILE
496 * which causes sprintf rather than fprintf to be
499 complain (&blockvector_complaint
,
500 (unsigned long) BLOCK_START(BLOCKVECTOR_BLOCK (blockvector
, i
)));
506 return (blockvector
);
510 /* Start recording information about source code that came from an included
511 (or otherwise merged-in) source file with a different name. NAME is
512 the name of the file (cannot be NULL), DIRNAME is the directory in which
513 it resides (or NULL if not known). */
516 start_subfile (name
, dirname
)
520 register struct subfile
*subfile
;
522 /* See if this subfile is already known as a subfile of the
523 current main source file. */
525 for (subfile
= subfiles
; subfile
; subfile
= subfile
->next
)
527 if (STREQ (subfile
->name
, name
))
529 current_subfile
= subfile
;
534 /* This subfile is not known. Add an entry for it.
535 Make an entry for this subfile in the list of all subfiles
536 of the current main source file. */
538 subfile
= (struct subfile
*) xmalloc (sizeof (struct subfile
));
539 subfile
->next
= subfiles
;
541 current_subfile
= subfile
;
543 /* Save its name and compilation directory name */
544 subfile
->name
= (name
== NULL
) ? NULL
: savestring (name
, strlen (name
));
546 (dirname
== NULL
) ? NULL
: savestring (dirname
, strlen (dirname
));
548 /* Initialize line-number recording for this subfile. */
549 subfile
->line_vector
= NULL
;
551 /* Default the source language to whatever can be deduced from
552 the filename. If nothing can be deduced (such as for a C/C++
553 include file with a ".h" extension), then inherit whatever
554 language the previous subfile had. This kludgery is necessary
555 because there is no standard way in some object formats to
556 record the source language. Also, when symtabs are allocated
557 we try to deduce a language then as well, but it is too late
558 for us to use that information while reading symbols, since
559 symtabs aren't allocated until after all the symbols have
560 been processed for a given source file. */
562 subfile
->language
= deduce_language_from_filename (subfile
->name
);
563 if (subfile
->language
== language_unknown
&&
564 subfile
->next
!= NULL
)
566 subfile
->language
= subfile
->next
->language
;
569 /* cfront output is a C program, so in most ways it looks like a C
570 program. But to demangle we need to set the language to C++. We
571 can distinguish cfront code by the fact that it has #line
572 directives which specify a file name ending in .C.
574 So if the filename of this subfile ends in .C, then change the language
575 of any pending subfiles from C to C++. We also accept any other C++
576 suffixes accepted by deduce_language_from_filename (in particular,
577 some people use .cxx with cfront). */
578 /* Likewise for f2c. */
583 enum language sublang
= deduce_language_from_filename (subfile
->name
);
585 if (sublang
== language_cplus
|| sublang
== language_fortran
)
586 for (s
= subfiles
; s
!= NULL
; s
= s
->next
)
587 if (s
->language
== language_c
)
588 s
->language
= sublang
;
591 /* And patch up this file if necessary. */
592 if (subfile
->language
== language_c
593 && subfile
->next
!= NULL
594 && (subfile
->next
->language
== language_cplus
595 || subfile
->next
->language
== language_fortran
))
597 subfile
->language
= subfile
->next
->language
;
601 /* For stabs readers, the first N_SO symbol is assumed to be the source
602 file name, and the subfile struct is initialized using that assumption.
603 If another N_SO symbol is later seen, immediately following the first
604 one, then the first one is assumed to be the directory name and the
605 second one is really the source file name.
607 So we have to patch up the subfile struct by moving the old name value to
608 dirname and remembering the new name. Some sanity checking is performed
609 to ensure that the state of the subfile struct is reasonable and that the
610 old name we are assuming to be a directory name actually is (by checking
611 for a trailing '/'). */
614 patch_subfile_names (subfile
, name
)
615 struct subfile
*subfile
;
618 if (subfile
!= NULL
&& subfile
->dirname
== NULL
&& subfile
->name
!= NULL
619 && subfile
->name
[strlen(subfile
->name
)-1] == '/')
621 subfile
->dirname
= subfile
->name
;
622 subfile
->name
= savestring (name
, strlen (name
));
623 last_source_file
= name
;
625 /* Default the source language to whatever can be deduced from
626 the filename. If nothing can be deduced (such as for a C/C++
627 include file with a ".h" extension), then inherit whatever
628 language the previous subfile had. This kludgery is necessary
629 because there is no standard way in some object formats to
630 record the source language. Also, when symtabs are allocated
631 we try to deduce a language then as well, but it is too late
632 for us to use that information while reading symbols, since
633 symtabs aren't allocated until after all the symbols have
634 been processed for a given source file. */
636 subfile
->language
= deduce_language_from_filename (subfile
->name
);
637 if (subfile
->language
== language_unknown
&&
638 subfile
->next
!= NULL
)
640 subfile
->language
= subfile
->next
->language
;
646 /* Handle the N_BINCL and N_EINCL symbol types
647 that act like N_SOL for switching source files
648 (different subfiles, as we call them) within one object file,
649 but using a stack rather than in an arbitrary order. */
654 register struct subfile_stack
*tem
655 = (struct subfile_stack
*) xmalloc (sizeof (struct subfile_stack
));
657 tem
->next
= subfile_stack
;
659 if (current_subfile
== NULL
|| current_subfile
->name
== NULL
)
663 tem
->name
= current_subfile
->name
;
670 register struct subfile_stack
*link
= subfile_stack
;
677 subfile_stack
= link
->next
;
683 /* Add a linetable entry for line number LINE and address PC to the line
684 vector for SUBFILE. */
687 record_line (subfile
, line
, pc
)
688 register struct subfile
*subfile
;
692 struct linetable_entry
*e
;
693 /* Ignore the dummy line number in libg.o */
700 /* Make sure line vector exists and is big enough. */
701 if (!subfile
->line_vector
)
703 subfile
->line_vector_length
= INITIAL_LINE_VECTOR_LENGTH
;
704 subfile
->line_vector
= (struct linetable
*)
705 xmalloc (sizeof (struct linetable
)
706 + subfile
->line_vector_length
* sizeof (struct linetable_entry
));
707 subfile
->line_vector
->nitems
= 0;
710 if (subfile
->line_vector
->nitems
+ 1 >= subfile
->line_vector_length
)
712 subfile
->line_vector_length
*= 2;
713 subfile
->line_vector
= (struct linetable
*)
714 xrealloc ((char *) subfile
->line_vector
, (sizeof (struct linetable
)
715 + subfile
->line_vector_length
* sizeof (struct linetable_entry
)));
718 e
= subfile
->line_vector
->item
+ subfile
->line_vector
->nitems
++;
719 e
->line
= line
; e
->pc
= pc
;
723 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
726 compare_line_numbers (ln1p
, ln2p
)
730 struct linetable_entry
*ln1
= (struct linetable_entry
*) ln1p
;
731 struct linetable_entry
*ln2
= (struct linetable_entry
*) ln2p
;
733 /* Note: this code does not assume that CORE_ADDRs can fit in ints.
734 Please keep it that way. */
735 if (ln1
->pc
< ln2
->pc
)
738 if (ln1
->pc
> ln2
->pc
)
741 /* If pc equal, sort by line. I'm not sure whether this is optimum
742 behavior (see comment at struct linetable in symtab.h). */
743 return ln1
->line
- ln2
->line
;
747 /* Start a new symtab for a new source file.
748 Called, for example, when a stabs symbol of type N_SO is seen, or when
749 a DWARF TAG_compile_unit DIE is seen.
750 It indicates the start of data for one original source file. */
753 start_symtab (name
, dirname
, start_addr
)
756 CORE_ADDR start_addr
;
759 last_source_file
= name
;
760 last_source_start_addr
= start_addr
;
762 global_symbols
= NULL
;
765 /* Context stack is initially empty. Allocate first one with room for
766 10 levels; reuse it forever afterward. */
767 if (context_stack
== NULL
)
769 context_stack_size
= INITIAL_CONTEXT_STACK_SIZE
;
770 context_stack
= (struct context_stack
*)
771 xmalloc (context_stack_size
* sizeof (struct context_stack
));
773 context_stack_depth
= 0;
775 /* Initialize the list of sub source files with one entry
776 for this file (the top-level source file). */
779 current_subfile
= NULL
;
780 start_subfile (name
, dirname
);
783 /* Finish the symbol definitions for one main source file,
784 close off all the lexical contexts for that file
785 (creating struct block's for them), then make the struct symtab
786 for that file and put it in the list of all such.
788 END_ADDR is the address of the end of the file's text.
789 SECTION is the section number (in objfile->section_offsets) of
790 the blockvector and linetable.
792 Note that it is possible for end_symtab() to return NULL. In particular,
793 for the DWARF case at least, it will return NULL when it finds a
794 compilation unit that has exactly one DIE, a TAG_compile_unit DIE. This
795 can happen when we link in an object file that was compiled from an empty
796 source file. Returning NULL is probably not the correct thing to do,
797 because then gdb will never know about this empty file (FIXME). */
800 end_symtab (end_addr
, objfile
, section
)
802 struct objfile
*objfile
;
805 register struct symtab
*symtab
= NULL
;
806 register struct blockvector
*blockvector
;
807 register struct subfile
*subfile
;
808 register struct context_stack
*cstk
;
809 struct subfile
*nextsub
;
811 /* Finish the lexical context of the last function in the file;
812 pop the context stack. */
814 if (context_stack_depth
> 0)
816 cstk
= pop_context();
817 /* Make a block for the local symbols within. */
818 finish_block (cstk
->name
, &local_symbols
, cstk
->old_blocks
,
819 cstk
->start_addr
, end_addr
, objfile
);
821 if (context_stack_depth
> 0)
823 /* This is said to happen with SCO. The old coffread.c code
824 simply emptied the context stack, so we do the same. FIXME:
825 Find out why it is happening. This is not believed to happen
826 in most cases (even for coffread.c); it used to be an abort(). */
827 static struct complaint msg
=
828 {"Context stack not empty in end_symtab", 0, 0};
830 context_stack_depth
= 0;
834 /* Reordered executables may have out of order pending blocks; if
835 OBJF_REORDERED is true, then sort the pending blocks. */
836 if ((objfile
->flags
& OBJF_REORDERED
) && pending_blocks
)
838 /* FIXME! Remove this horrid bubble sort and use qsort!!!
839 It'd be a whole lot easier if they weren't in a linked list!!! */
843 struct pending_block
*pb
, *pbnext
;
851 /* swap blocks if unordered! */
853 if (BLOCK_START(pb
->block
) < BLOCK_START(pbnext
->block
))
855 struct block
*tmp
= pb
->block
;
856 pb
->block
= pbnext
->block
;
861 pbnext
= pbnext
->next
;
866 /* Cleanup any undefined types that have been left hanging around
867 (this needs to be done before the finish_blocks so that
868 file_symbols is still good).
870 Both cleanup_undefined_types and finish_global_stabs are stabs
871 specific, but harmless for other symbol readers, since on gdb
872 startup or when finished reading stabs, the state is set so these
873 are no-ops. FIXME: Is this handled right in case of QUIT? Can
874 we make this cleaner? */
876 cleanup_undefined_types ();
877 finish_global_stabs (objfile
);
879 if (pending_blocks
== NULL
880 && file_symbols
== NULL
881 && global_symbols
== NULL
)
883 /* Ignore symtabs that have no functions with real debugging info */
888 /* Define the STATIC_BLOCK & GLOBAL_BLOCK, and build the blockvector. */
889 finish_block (0, &file_symbols
, 0, last_source_start_addr
, end_addr
,
891 finish_block (0, &global_symbols
, 0, last_source_start_addr
, end_addr
,
893 blockvector
= make_blockvector (objfile
);
896 #ifdef PROCESS_LINENUMBER_HOOK
897 PROCESS_LINENUMBER_HOOK (); /* Needed for xcoff. */
900 /* Now create the symtab objects proper, one for each subfile. */
901 /* (The main file is the last one on the chain.) */
903 for (subfile
= subfiles
; subfile
; subfile
= nextsub
)
905 int linetablesize
= 0;
906 /* If we have blocks of symbols, make a symtab.
907 Otherwise, just ignore this file and any line number info in it. */
911 if (subfile
->line_vector
)
913 linetablesize
= sizeof (struct linetable
) +
914 subfile
->line_vector
->nitems
* sizeof (struct linetable_entry
);
916 /* I think this is artifact from before it went on the obstack.
917 I doubt we'll need the memory between now and when we
918 free it later in this function. */
919 /* First, shrink the linetable to make more memory. */
920 subfile
->line_vector
= (struct linetable
*)
921 xrealloc ((char *) subfile
->line_vector
, linetablesize
);
924 /* Like the pending blocks, the line table may be scrambled
925 in reordered executables. Sort it if OBJF_REORDERED is
927 if (objfile
->flags
& OBJF_REORDERED
)
928 qsort (subfile
->line_vector
->item
,
929 subfile
->line_vector
->nitems
,
930 sizeof (struct linetable_entry
), compare_line_numbers
);
933 /* Now, allocate a symbol table. */
934 symtab
= allocate_symtab (subfile
->name
, objfile
);
936 /* Fill in its components. */
937 symtab
->blockvector
= blockvector
;
938 if (subfile
->line_vector
)
940 /* Reallocate the line table on the symbol obstack */
941 symtab
->linetable
= (struct linetable
*)
942 obstack_alloc (&objfile
-> symbol_obstack
, linetablesize
);
943 memcpy (symtab
->linetable
, subfile
->line_vector
, linetablesize
);
947 symtab
->linetable
= NULL
;
949 symtab
->block_line_section
= section
;
950 if (subfile
->dirname
)
952 /* Reallocate the dirname on the symbol obstack */
953 symtab
->dirname
= (char *)
954 obstack_alloc (&objfile
-> symbol_obstack
,
955 strlen (subfile
-> dirname
) + 1);
956 strcpy (symtab
->dirname
, subfile
->dirname
);
960 symtab
->dirname
= NULL
;
962 symtab
->free_code
= free_linetable
;
963 symtab
->free_ptr
= NULL
;
965 /* Use whatever language we have been using for this subfile,
966 not the one that was deduced in allocate_symtab from the
967 filename. We already did our own deducing when we created
968 the subfile, and we may have altered our opinion of what
969 language it is from things we found in the symbols. */
970 symtab
->language
= subfile
->language
;
972 /* All symtabs for the main file and the subfiles share a
973 blockvector, so we need to clear primary for everything but
978 if (subfile
->name
!= NULL
)
980 free ((PTR
) subfile
->name
);
982 if (subfile
->dirname
!= NULL
)
984 free ((PTR
) subfile
->dirname
);
986 if (subfile
->line_vector
!= NULL
)
988 free ((PTR
) subfile
->line_vector
);
991 nextsub
= subfile
->next
;
995 /* Set this for the main source file. */
1001 last_source_file
= NULL
;
1002 current_subfile
= NULL
;
1008 /* Push a context block. Args are an identifying nesting level (checkable
1009 when you pop it), and the starting PC address of this context. */
1011 struct context_stack
*
1012 push_context (desc
, valu
)
1016 register struct context_stack
*new;
1018 if (context_stack_depth
== context_stack_size
)
1020 context_stack_size
*= 2;
1021 context_stack
= (struct context_stack
*)
1022 xrealloc ((char *) context_stack
,
1023 (context_stack_size
* sizeof (struct context_stack
)));
1026 new = &context_stack
[context_stack_depth
++];
1028 new->locals
= local_symbols
;
1029 new->old_blocks
= pending_blocks
;
1030 new->start_addr
= valu
;
1033 local_symbols
= NULL
;
1039 /* Compute a small integer hash code for the given name. */
1045 register char *p
= name
;
1046 register int total
= p
[0];
1061 /* Ensure result is positive. */
1064 total
+= (1000 << 6);
1066 return (total
% HASHSIZE
);
1070 /* Initialize anything that needs initializing when starting to read
1071 a fresh piece of a symbol file, e.g. reading in the stuff corresponding
1077 free_pendings
= NULL
;
1078 file_symbols
= NULL
;
1079 global_symbols
= NULL
;
1080 pending_blocks
= NULL
;
1083 /* Initialize anything that needs initializing when a completely new
1084 symbol file is specified (not just adding some symbols from another
1085 file, e.g. a shared library). */
1088 buildsym_new_init ()
1093 /* Initializer for this module */
1096 _initialize_buildsym ()