gdb/
[deliverable/binutils-gdb.git] / gdb / buildsym.c
1 /* Support routines for building symbol tables in GDB's internal format.
2 Copyright (C) 1986-2004, 2007-2012 Free Software Foundation, Inc.
3
4 This file is part of GDB.
5
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
10
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>. */
18
19 /* This module provides subroutines used for creating and adding to
20 the symbol table. These routines are called from various symbol-
21 file-reading routines.
22
23 Routines to support specific debugging information formats (stabs,
24 DWARF, etc) belong somewhere else. */
25
26 #include "defs.h"
27 #include "bfd.h"
28 #include "gdb_obstack.h"
29 #include "symtab.h"
30 #include "symfile.h"
31 #include "objfiles.h"
32 #include "gdbtypes.h"
33 #include "gdb_assert.h"
34 #include "complaints.h"
35 #include "gdb_string.h"
36 #include "expression.h" /* For "enum exp_opcode" used by... */
37 #include "bcache.h"
38 #include "filenames.h" /* For DOSish file names. */
39 #include "macrotab.h"
40 #include "demangle.h" /* Needed by SYMBOL_INIT_DEMANGLED_NAME. */
41 #include "block.h"
42 #include "cp-support.h"
43 #include "dictionary.h"
44 #include "addrmap.h"
45
46 /* Ask buildsym.h to define the vars it normally declares `extern'. */
47 #define EXTERN
48 /**/
49 #include "buildsym.h" /* Our own declarations. */
50 #undef EXTERN
51
52 /* For cleanup_undefined_stabs_types and finish_global_stabs (somewhat
53 questionable--see comment where we call them). */
54
55 #include "stabsread.h"
56
57 /* List of subfiles. */
58
59 static struct subfile *subfiles;
60
61 /* List of free `struct pending' structures for reuse. */
62
63 static struct pending *free_pendings;
64
65 /* Non-zero if symtab has line number info. This prevents an
66 otherwise empty symtab from being tossed. */
67
68 static int have_line_numbers;
69
70 /* The mutable address map for the compilation unit whose symbols
71 we're currently reading. The symtabs' shared blockvector will
72 point to a fixed copy of this. */
73 static struct addrmap *pending_addrmap;
74
75 /* The obstack on which we allocate pending_addrmap.
76 If pending_addrmap is NULL, this is uninitialized; otherwise, it is
77 initialized (and holds pending_addrmap). */
78 static struct obstack pending_addrmap_obstack;
79
80 /* Non-zero if we recorded any ranges in the addrmap that are
81 different from those in the blockvector already. We set this to
82 zero when we start processing a symfile, and if it's still zero at
83 the end, then we just toss the addrmap. */
84 static int pending_addrmap_interesting;
85
86 \f
87 static int compare_line_numbers (const void *ln1p, const void *ln2p);
88
89 static void record_pending_block (struct objfile *objfile,
90 struct block *block,
91 struct pending_block *opblock);
92 \f
93
94 /* Initial sizes of data structures. These are realloc'd larger if
95 needed, and realloc'd down to the size actually used, when
96 completed. */
97
98 #define INITIAL_CONTEXT_STACK_SIZE 10
99 #define INITIAL_LINE_VECTOR_LENGTH 1000
100 \f
101
102 /* Maintain the lists of symbols and blocks. */
103
104 /* Add a symbol to one of the lists of symbols. */
105
106 void
107 add_symbol_to_list (struct symbol *symbol, struct pending **listhead)
108 {
109 struct pending *link;
110
111 /* If this is an alias for another symbol, don't add it. */
112 if (symbol->ginfo.name && symbol->ginfo.name[0] == '#')
113 return;
114
115 /* We keep PENDINGSIZE symbols in each link of the list. If we
116 don't have a link with room in it, add a new link. */
117 if (*listhead == NULL || (*listhead)->nsyms == PENDINGSIZE)
118 {
119 if (free_pendings)
120 {
121 link = free_pendings;
122 free_pendings = link->next;
123 }
124 else
125 {
126 link = (struct pending *) xmalloc (sizeof (struct pending));
127 }
128
129 link->next = *listhead;
130 *listhead = link;
131 link->nsyms = 0;
132 }
133
134 (*listhead)->symbol[(*listhead)->nsyms++] = symbol;
135 }
136
137 /* Find a symbol named NAME on a LIST. NAME need not be
138 '\0'-terminated; LENGTH is the length of the name. */
139
140 struct symbol *
141 find_symbol_in_list (struct pending *list, char *name, int length)
142 {
143 int j;
144 const char *pp;
145
146 while (list != NULL)
147 {
148 for (j = list->nsyms; --j >= 0;)
149 {
150 pp = SYMBOL_LINKAGE_NAME (list->symbol[j]);
151 if (*pp == *name && strncmp (pp, name, length) == 0
152 && pp[length] == '\0')
153 {
154 return (list->symbol[j]);
155 }
156 }
157 list = list->next;
158 }
159 return (NULL);
160 }
161
162 /* At end of reading syms, or in case of quit, really free as many
163 `struct pending's as we can easily find. */
164
165 void
166 really_free_pendings (void *dummy)
167 {
168 struct pending *next, *next1;
169
170 for (next = free_pendings; next; next = next1)
171 {
172 next1 = next->next;
173 xfree ((void *) next);
174 }
175 free_pendings = NULL;
176
177 free_pending_blocks ();
178
179 for (next = file_symbols; next != NULL; next = next1)
180 {
181 next1 = next->next;
182 xfree ((void *) next);
183 }
184 file_symbols = NULL;
185
186 for (next = global_symbols; next != NULL; next = next1)
187 {
188 next1 = next->next;
189 xfree ((void *) next);
190 }
191 global_symbols = NULL;
192
193 if (pending_macros)
194 free_macro_table (pending_macros);
195
196 if (pending_addrmap)
197 {
198 obstack_free (&pending_addrmap_obstack, NULL);
199 pending_addrmap = NULL;
200 }
201 }
202
203 /* This function is called to discard any pending blocks. */
204
205 void
206 free_pending_blocks (void)
207 {
208 /* The links are made in the objfile_obstack, so we only need to
209 reset PENDING_BLOCKS. */
210 pending_blocks = NULL;
211 }
212
213 /* Take one of the lists of symbols and make a block from it. Keep
214 the order the symbols have in the list (reversed from the input
215 file). Put the block on the list of pending blocks. */
216
217 static struct block *
218 finish_block_internal (struct symbol *symbol, struct pending **listhead,
219 struct pending_block *old_blocks,
220 CORE_ADDR start, CORE_ADDR end,
221 struct objfile *objfile,
222 int is_global, int expandable)
223 {
224 struct gdbarch *gdbarch = get_objfile_arch (objfile);
225 struct pending *next, *next1;
226 struct block *block;
227 struct pending_block *pblock;
228 struct pending_block *opblock;
229
230 block = (is_global
231 ? allocate_global_block (&objfile->objfile_obstack)
232 : allocate_block (&objfile->objfile_obstack));
233
234 if (symbol)
235 {
236 BLOCK_DICT (block) = dict_create_linear (&objfile->objfile_obstack,
237 *listhead);
238 }
239 else
240 {
241 if (expandable)
242 {
243 BLOCK_DICT (block) = dict_create_hashed_expandable ();
244 dict_add_pending (BLOCK_DICT (block), *listhead);
245 }
246 else
247 {
248 BLOCK_DICT (block) =
249 dict_create_hashed (&objfile->objfile_obstack, *listhead);
250 }
251 }
252
253 BLOCK_START (block) = start;
254 BLOCK_END (block) = end;
255
256 /* Put the block in as the value of the symbol that names it. */
257
258 if (symbol)
259 {
260 struct type *ftype = SYMBOL_TYPE (symbol);
261 struct dict_iterator iter;
262 SYMBOL_BLOCK_VALUE (symbol) = block;
263 BLOCK_FUNCTION (block) = symbol;
264
265 if (TYPE_NFIELDS (ftype) <= 0)
266 {
267 /* No parameter type information is recorded with the
268 function's type. Set that from the type of the
269 parameter symbols. */
270 int nparams = 0, iparams;
271 struct symbol *sym;
272
273 /* Here we want to directly access the dictionary, because
274 we haven't fully initialized the block yet. */
275 ALL_DICT_SYMBOLS (BLOCK_DICT (block), iter, sym)
276 {
277 if (SYMBOL_IS_ARGUMENT (sym))
278 nparams++;
279 }
280 if (nparams > 0)
281 {
282 TYPE_NFIELDS (ftype) = nparams;
283 TYPE_FIELDS (ftype) = (struct field *)
284 TYPE_ALLOC (ftype, nparams * sizeof (struct field));
285
286 iparams = 0;
287 /* Here we want to directly access the dictionary, because
288 we haven't fully initialized the block yet. */
289 ALL_DICT_SYMBOLS (BLOCK_DICT (block), iter, sym)
290 {
291 if (iparams == nparams)
292 break;
293
294 if (SYMBOL_IS_ARGUMENT (sym))
295 {
296 TYPE_FIELD_TYPE (ftype, iparams) = SYMBOL_TYPE (sym);
297 TYPE_FIELD_ARTIFICIAL (ftype, iparams) = 0;
298 iparams++;
299 }
300 }
301 }
302 }
303 }
304 else
305 {
306 BLOCK_FUNCTION (block) = NULL;
307 }
308
309 /* Now "free" the links of the list, and empty the list. */
310
311 for (next = *listhead; next; next = next1)
312 {
313 next1 = next->next;
314 next->next = free_pendings;
315 free_pendings = next;
316 }
317 *listhead = NULL;
318
319 /* Check to be sure that the blocks have an end address that is
320 greater than starting address. */
321
322 if (BLOCK_END (block) < BLOCK_START (block))
323 {
324 if (symbol)
325 {
326 complaint (&symfile_complaints,
327 _("block end address less than block "
328 "start address in %s (patched it)"),
329 SYMBOL_PRINT_NAME (symbol));
330 }
331 else
332 {
333 complaint (&symfile_complaints,
334 _("block end address %s less than block "
335 "start address %s (patched it)"),
336 paddress (gdbarch, BLOCK_END (block)),
337 paddress (gdbarch, BLOCK_START (block)));
338 }
339 /* Better than nothing. */
340 BLOCK_END (block) = BLOCK_START (block);
341 }
342
343 /* Install this block as the superblock of all blocks made since the
344 start of this scope that don't have superblocks yet. */
345
346 opblock = NULL;
347 for (pblock = pending_blocks;
348 pblock && pblock != old_blocks;
349 pblock = pblock->next)
350 {
351 if (BLOCK_SUPERBLOCK (pblock->block) == NULL)
352 {
353 /* Check to be sure the blocks are nested as we receive
354 them. If the compiler/assembler/linker work, this just
355 burns a small amount of time.
356
357 Skip blocks which correspond to a function; they're not
358 physically nested inside this other blocks, only
359 lexically nested. */
360 if (BLOCK_FUNCTION (pblock->block) == NULL
361 && (BLOCK_START (pblock->block) < BLOCK_START (block)
362 || BLOCK_END (pblock->block) > BLOCK_END (block)))
363 {
364 if (symbol)
365 {
366 complaint (&symfile_complaints,
367 _("inner block not inside outer block in %s"),
368 SYMBOL_PRINT_NAME (symbol));
369 }
370 else
371 {
372 complaint (&symfile_complaints,
373 _("inner block (%s-%s) not "
374 "inside outer block (%s-%s)"),
375 paddress (gdbarch, BLOCK_START (pblock->block)),
376 paddress (gdbarch, BLOCK_END (pblock->block)),
377 paddress (gdbarch, BLOCK_START (block)),
378 paddress (gdbarch, BLOCK_END (block)));
379 }
380 if (BLOCK_START (pblock->block) < BLOCK_START (block))
381 BLOCK_START (pblock->block) = BLOCK_START (block);
382 if (BLOCK_END (pblock->block) > BLOCK_END (block))
383 BLOCK_END (pblock->block) = BLOCK_END (block);
384 }
385 BLOCK_SUPERBLOCK (pblock->block) = block;
386 }
387 opblock = pblock;
388 }
389
390 block_set_using (block, using_directives, &objfile->objfile_obstack);
391 using_directives = NULL;
392
393 record_pending_block (objfile, block, opblock);
394
395 return block;
396 }
397
398 struct block *
399 finish_block (struct symbol *symbol, struct pending **listhead,
400 struct pending_block *old_blocks,
401 CORE_ADDR start, CORE_ADDR end,
402 struct objfile *objfile)
403 {
404 return finish_block_internal (symbol, listhead, old_blocks,
405 start, end, objfile, 0, 0);
406 }
407
408 /* Record BLOCK on the list of all blocks in the file. Put it after
409 OPBLOCK, or at the beginning if opblock is NULL. This puts the
410 block in the list after all its subblocks.
411
412 Allocate the pending block struct in the objfile_obstack to save
413 time. This wastes a little space. FIXME: Is it worth it? */
414
415 static void
416 record_pending_block (struct objfile *objfile, struct block *block,
417 struct pending_block *opblock)
418 {
419 struct pending_block *pblock;
420
421 pblock = (struct pending_block *)
422 obstack_alloc (&objfile->objfile_obstack, sizeof (struct pending_block));
423 pblock->block = block;
424 if (opblock)
425 {
426 pblock->next = opblock->next;
427 opblock->next = pblock;
428 }
429 else
430 {
431 pblock->next = pending_blocks;
432 pending_blocks = pblock;
433 }
434 }
435
436
437 /* Record that the range of addresses from START to END_INCLUSIVE
438 (inclusive, like it says) belongs to BLOCK. BLOCK's start and end
439 addresses must be set already. You must apply this function to all
440 BLOCK's children before applying it to BLOCK.
441
442 If a call to this function complicates the picture beyond that
443 already provided by BLOCK_START and BLOCK_END, then we create an
444 address map for the block. */
445 void
446 record_block_range (struct block *block,
447 CORE_ADDR start, CORE_ADDR end_inclusive)
448 {
449 /* If this is any different from the range recorded in the block's
450 own BLOCK_START and BLOCK_END, then note that the address map has
451 become interesting. Note that even if this block doesn't have
452 any "interesting" ranges, some later block might, so we still
453 need to record this block in the addrmap. */
454 if (start != BLOCK_START (block)
455 || end_inclusive + 1 != BLOCK_END (block))
456 pending_addrmap_interesting = 1;
457
458 if (! pending_addrmap)
459 {
460 obstack_init (&pending_addrmap_obstack);
461 pending_addrmap = addrmap_create_mutable (&pending_addrmap_obstack);
462 }
463
464 addrmap_set_empty (pending_addrmap, start, end_inclusive, block);
465 }
466
467
468 static struct blockvector *
469 make_blockvector (struct objfile *objfile)
470 {
471 struct pending_block *next;
472 struct blockvector *blockvector;
473 int i;
474
475 /* Count the length of the list of blocks. */
476
477 for (next = pending_blocks, i = 0; next; next = next->next, i++)
478 {;
479 }
480
481 blockvector = (struct blockvector *)
482 obstack_alloc (&objfile->objfile_obstack,
483 (sizeof (struct blockvector)
484 + (i - 1) * sizeof (struct block *)));
485
486 /* Copy the blocks into the blockvector. This is done in reverse
487 order, which happens to put the blocks into the proper order
488 (ascending starting address). finish_block has hair to insert
489 each block into the list after its subblocks in order to make
490 sure this is true. */
491
492 BLOCKVECTOR_NBLOCKS (blockvector) = i;
493 for (next = pending_blocks; next; next = next->next)
494 {
495 BLOCKVECTOR_BLOCK (blockvector, --i) = next->block;
496 }
497
498 free_pending_blocks ();
499
500 /* If we needed an address map for this symtab, record it in the
501 blockvector. */
502 if (pending_addrmap && pending_addrmap_interesting)
503 BLOCKVECTOR_MAP (blockvector)
504 = addrmap_create_fixed (pending_addrmap, &objfile->objfile_obstack);
505 else
506 BLOCKVECTOR_MAP (blockvector) = 0;
507
508 /* Some compilers output blocks in the wrong order, but we depend on
509 their being in the right order so we can binary search. Check the
510 order and moan about it.
511 Note: Remember that the first two blocks are the global and static
512 blocks. We could special case that fact and begin checking at block 2.
513 To avoid making that assumption we do not. */
514 if (BLOCKVECTOR_NBLOCKS (blockvector) > 1)
515 {
516 for (i = 1; i < BLOCKVECTOR_NBLOCKS (blockvector); i++)
517 {
518 if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i - 1))
519 > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i)))
520 {
521 CORE_ADDR start
522 = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i));
523
524 complaint (&symfile_complaints, _("block at %s out of order"),
525 hex_string ((LONGEST) start));
526 }
527 }
528 }
529
530 return (blockvector);
531 }
532 \f
533 /* Start recording information about source code that came from an
534 included (or otherwise merged-in) source file with a different
535 name. NAME is the name of the file (cannot be NULL), DIRNAME is
536 the directory in which the file was compiled (or NULL if not
537 known). */
538
539 void
540 start_subfile (const char *name, const char *dirname)
541 {
542 struct subfile *subfile;
543
544 /* See if this subfile is already known as a subfile of the current
545 main source file. */
546
547 for (subfile = subfiles; subfile; subfile = subfile->next)
548 {
549 char *subfile_name;
550
551 /* If NAME is an absolute path, and this subfile is not, then
552 attempt to create an absolute path to compare. */
553 if (IS_ABSOLUTE_PATH (name)
554 && !IS_ABSOLUTE_PATH (subfile->name)
555 && subfile->dirname != NULL)
556 subfile_name = concat (subfile->dirname, SLASH_STRING,
557 subfile->name, (char *) NULL);
558 else
559 subfile_name = subfile->name;
560
561 if (FILENAME_CMP (subfile_name, name) == 0)
562 {
563 current_subfile = subfile;
564 if (subfile_name != subfile->name)
565 xfree (subfile_name);
566 return;
567 }
568 if (subfile_name != subfile->name)
569 xfree (subfile_name);
570 }
571
572 /* This subfile is not known. Add an entry for it. Make an entry
573 for this subfile in the list of all subfiles of the current main
574 source file. */
575
576 subfile = (struct subfile *) xmalloc (sizeof (struct subfile));
577 memset ((char *) subfile, 0, sizeof (struct subfile));
578 subfile->next = subfiles;
579 subfiles = subfile;
580 current_subfile = subfile;
581
582 /* Save its name and compilation directory name. */
583 subfile->name = xstrdup (name);
584 subfile->dirname = (dirname == NULL) ? NULL : xstrdup (dirname);
585
586 /* Initialize line-number recording for this subfile. */
587 subfile->line_vector = NULL;
588
589 /* Default the source language to whatever can be deduced from the
590 filename. If nothing can be deduced (such as for a C/C++ include
591 file with a ".h" extension), then inherit whatever language the
592 previous subfile had. This kludgery is necessary because there
593 is no standard way in some object formats to record the source
594 language. Also, when symtabs are allocated we try to deduce a
595 language then as well, but it is too late for us to use that
596 information while reading symbols, since symtabs aren't allocated
597 until after all the symbols have been processed for a given
598 source file. */
599
600 subfile->language = deduce_language_from_filename (subfile->name);
601 if (subfile->language == language_unknown
602 && subfile->next != NULL)
603 {
604 subfile->language = subfile->next->language;
605 }
606
607 /* Initialize the debug format string to NULL. We may supply it
608 later via a call to record_debugformat. */
609 subfile->debugformat = NULL;
610
611 /* Similarly for the producer. */
612 subfile->producer = NULL;
613
614 /* If the filename of this subfile ends in .C, then change the
615 language of any pending subfiles from C to C++. We also accept
616 any other C++ suffixes accepted by deduce_language_from_filename. */
617 /* Likewise for f2c. */
618
619 if (subfile->name)
620 {
621 struct subfile *s;
622 enum language sublang = deduce_language_from_filename (subfile->name);
623
624 if (sublang == language_cplus || sublang == language_fortran)
625 for (s = subfiles; s != NULL; s = s->next)
626 if (s->language == language_c)
627 s->language = sublang;
628 }
629
630 /* And patch up this file if necessary. */
631 if (subfile->language == language_c
632 && subfile->next != NULL
633 && (subfile->next->language == language_cplus
634 || subfile->next->language == language_fortran))
635 {
636 subfile->language = subfile->next->language;
637 }
638 }
639
640 /* For stabs readers, the first N_SO symbol is assumed to be the
641 source file name, and the subfile struct is initialized using that
642 assumption. If another N_SO symbol is later seen, immediately
643 following the first one, then the first one is assumed to be the
644 directory name and the second one is really the source file name.
645
646 So we have to patch up the subfile struct by moving the old name
647 value to dirname and remembering the new name. Some sanity
648 checking is performed to ensure that the state of the subfile
649 struct is reasonable and that the old name we are assuming to be a
650 directory name actually is (by checking for a trailing '/'). */
651
652 void
653 patch_subfile_names (struct subfile *subfile, char *name)
654 {
655 if (subfile != NULL && subfile->dirname == NULL && subfile->name != NULL
656 && IS_DIR_SEPARATOR (subfile->name[strlen (subfile->name) - 1]))
657 {
658 subfile->dirname = subfile->name;
659 subfile->name = xstrdup (name);
660 last_source_file = name;
661
662 /* Default the source language to whatever can be deduced from
663 the filename. If nothing can be deduced (such as for a C/C++
664 include file with a ".h" extension), then inherit whatever
665 language the previous subfile had. This kludgery is
666 necessary because there is no standard way in some object
667 formats to record the source language. Also, when symtabs
668 are allocated we try to deduce a language then as well, but
669 it is too late for us to use that information while reading
670 symbols, since symtabs aren't allocated until after all the
671 symbols have been processed for a given source file. */
672
673 subfile->language = deduce_language_from_filename (subfile->name);
674 if (subfile->language == language_unknown
675 && subfile->next != NULL)
676 {
677 subfile->language = subfile->next->language;
678 }
679 }
680 }
681 \f
682 /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for
683 switching source files (different subfiles, as we call them) within
684 one object file, but using a stack rather than in an arbitrary
685 order. */
686
687 void
688 push_subfile (void)
689 {
690 struct subfile_stack *tem
691 = (struct subfile_stack *) xmalloc (sizeof (struct subfile_stack));
692
693 tem->next = subfile_stack;
694 subfile_stack = tem;
695 if (current_subfile == NULL || current_subfile->name == NULL)
696 {
697 internal_error (__FILE__, __LINE__,
698 _("failed internal consistency check"));
699 }
700 tem->name = current_subfile->name;
701 }
702
703 char *
704 pop_subfile (void)
705 {
706 char *name;
707 struct subfile_stack *link = subfile_stack;
708
709 if (link == NULL)
710 {
711 internal_error (__FILE__, __LINE__,
712 _("failed internal consistency check"));
713 }
714 name = link->name;
715 subfile_stack = link->next;
716 xfree ((void *) link);
717 return (name);
718 }
719 \f
720 /* Add a linetable entry for line number LINE and address PC to the
721 line vector for SUBFILE. */
722
723 void
724 record_line (struct subfile *subfile, int line, CORE_ADDR pc)
725 {
726 struct linetable_entry *e;
727
728 /* Ignore the dummy line number in libg.o */
729 if (line == 0xffff)
730 {
731 return;
732 }
733
734 /* Make sure line vector exists and is big enough. */
735 if (!subfile->line_vector)
736 {
737 subfile->line_vector_length = INITIAL_LINE_VECTOR_LENGTH;
738 subfile->line_vector = (struct linetable *)
739 xmalloc (sizeof (struct linetable)
740 + subfile->line_vector_length * sizeof (struct linetable_entry));
741 subfile->line_vector->nitems = 0;
742 have_line_numbers = 1;
743 }
744
745 if (subfile->line_vector->nitems + 1 >= subfile->line_vector_length)
746 {
747 subfile->line_vector_length *= 2;
748 subfile->line_vector = (struct linetable *)
749 xrealloc ((char *) subfile->line_vector,
750 (sizeof (struct linetable)
751 + (subfile->line_vector_length
752 * sizeof (struct linetable_entry))));
753 }
754
755 /* Normally, we treat lines as unsorted. But the end of sequence
756 marker is special. We sort line markers at the same PC by line
757 number, so end of sequence markers (which have line == 0) appear
758 first. This is right if the marker ends the previous function,
759 and there is no padding before the next function. But it is
760 wrong if the previous line was empty and we are now marking a
761 switch to a different subfile. We must leave the end of sequence
762 marker at the end of this group of lines, not sort the empty line
763 to after the marker. The easiest way to accomplish this is to
764 delete any empty lines from our table, if they are followed by
765 end of sequence markers. All we lose is the ability to set
766 breakpoints at some lines which contain no instructions
767 anyway. */
768 if (line == 0 && subfile->line_vector->nitems > 0)
769 {
770 e = subfile->line_vector->item + subfile->line_vector->nitems - 1;
771 while (subfile->line_vector->nitems > 0 && e->pc == pc)
772 {
773 e--;
774 subfile->line_vector->nitems--;
775 }
776 }
777
778 e = subfile->line_vector->item + subfile->line_vector->nitems++;
779 e->line = line;
780 e->pc = pc;
781 }
782
783 /* Needed in order to sort line tables from IBM xcoff files. Sigh! */
784
785 static int
786 compare_line_numbers (const void *ln1p, const void *ln2p)
787 {
788 struct linetable_entry *ln1 = (struct linetable_entry *) ln1p;
789 struct linetable_entry *ln2 = (struct linetable_entry *) ln2p;
790
791 /* Note: this code does not assume that CORE_ADDRs can fit in ints.
792 Please keep it that way. */
793 if (ln1->pc < ln2->pc)
794 return -1;
795
796 if (ln1->pc > ln2->pc)
797 return 1;
798
799 /* If pc equal, sort by line. I'm not sure whether this is optimum
800 behavior (see comment at struct linetable in symtab.h). */
801 return ln1->line - ln2->line;
802 }
803 \f
804 /* Start a new symtab for a new source file. Called, for example,
805 when a stabs symbol of type N_SO is seen, or when a DWARF
806 TAG_compile_unit DIE is seen. It indicates the start of data for
807 one original source file.
808
809 NAME is the name of the file (cannot be NULL). DIRNAME is the directory in
810 which the file was compiled (or NULL if not known). START_ADDR is the
811 lowest address of objects in the file (or 0 if not known). */
812
813 void
814 start_symtab (char *name, char *dirname, CORE_ADDR start_addr)
815 {
816 restart_symtab (start_addr);
817 last_source_file = name;
818 start_subfile (name, dirname);
819 }
820
821 /* Restart compilation for a symtab.
822 This is used when a symtab is built from multiple sources.
823 The symtab is first built with start_symtab and then for each additional
824 piece call restart_symtab. */
825
826 void
827 restart_symtab (CORE_ADDR start_addr)
828 {
829 last_source_file = NULL;
830 last_source_start_addr = start_addr;
831 file_symbols = NULL;
832 global_symbols = NULL;
833 within_function = 0;
834 have_line_numbers = 0;
835
836 /* Context stack is initially empty. Allocate first one with room
837 for 10 levels; reuse it forever afterward. */
838 if (context_stack == NULL)
839 {
840 context_stack_size = INITIAL_CONTEXT_STACK_SIZE;
841 context_stack = (struct context_stack *)
842 xmalloc (context_stack_size * sizeof (struct context_stack));
843 }
844 context_stack_depth = 0;
845
846 /* We shouldn't have any address map at this point. */
847 gdb_assert (! pending_addrmap);
848
849 /* Initialize the list of sub source files with one entry for this
850 file (the top-level source file). */
851 subfiles = NULL;
852 current_subfile = NULL;
853 }
854
855 /* Subroutine of end_symtab to simplify it. Look for a subfile that
856 matches the main source file's basename. If there is only one, and
857 if the main source file doesn't have any symbol or line number
858 information, then copy this file's symtab and line_vector to the
859 main source file's subfile and discard the other subfile. This can
860 happen because of a compiler bug or from the user playing games
861 with #line or from things like a distributed build system that
862 manipulates the debug info. */
863
864 static void
865 watch_main_source_file_lossage (void)
866 {
867 struct subfile *mainsub, *subfile;
868
869 /* Find the main source file.
870 This loop could be eliminated if start_symtab saved it for us. */
871 mainsub = NULL;
872 for (subfile = subfiles; subfile; subfile = subfile->next)
873 {
874 /* The main subfile is guaranteed to be the last one. */
875 if (subfile->next == NULL)
876 mainsub = subfile;
877 }
878
879 /* If the main source file doesn't have any line number or symbol
880 info, look for an alias in another subfile.
881
882 We have to watch for mainsub == NULL here. It's a quirk of
883 end_symtab, it can return NULL so there may not be a main
884 subfile. */
885
886 if (mainsub
887 && mainsub->line_vector == NULL
888 && mainsub->symtab == NULL)
889 {
890 const char *mainbase = lbasename (mainsub->name);
891 int nr_matches = 0;
892 struct subfile *prevsub;
893 struct subfile *mainsub_alias = NULL;
894 struct subfile *prev_mainsub_alias = NULL;
895
896 prevsub = NULL;
897 for (subfile = subfiles;
898 /* Stop before we get to the last one. */
899 subfile->next;
900 subfile = subfile->next)
901 {
902 if (filename_cmp (lbasename (subfile->name), mainbase) == 0)
903 {
904 ++nr_matches;
905 mainsub_alias = subfile;
906 prev_mainsub_alias = prevsub;
907 }
908 prevsub = subfile;
909 }
910
911 if (nr_matches == 1)
912 {
913 gdb_assert (mainsub_alias != NULL && mainsub_alias != mainsub);
914
915 /* Found a match for the main source file.
916 Copy its line_vector and symtab to the main subfile
917 and then discard it. */
918
919 mainsub->line_vector = mainsub_alias->line_vector;
920 mainsub->line_vector_length = mainsub_alias->line_vector_length;
921 mainsub->symtab = mainsub_alias->symtab;
922
923 if (prev_mainsub_alias == NULL)
924 subfiles = mainsub_alias->next;
925 else
926 prev_mainsub_alias->next = mainsub_alias->next;
927 xfree (mainsub_alias);
928 }
929 }
930 }
931
932 /* Helper function for qsort. Parameters are `struct block *' pointers,
933 function sorts them in descending order by their BLOCK_START. */
934
935 static int
936 block_compar (const void *ap, const void *bp)
937 {
938 const struct block *a = *(const struct block **) ap;
939 const struct block *b = *(const struct block **) bp;
940
941 return ((BLOCK_START (b) > BLOCK_START (a))
942 - (BLOCK_START (b) < BLOCK_START (a)));
943 }
944
945 /* Reset globals used to build symtabs. */
946
947 static void
948 reset_symtab_globals (void)
949 {
950 last_source_file = NULL;
951 current_subfile = NULL;
952 pending_macros = NULL;
953 if (pending_addrmap)
954 {
955 obstack_free (&pending_addrmap_obstack, NULL);
956 pending_addrmap = NULL;
957 }
958 }
959
960 /* Implementation of the first part of end_symtab. It allows modifying
961 STATIC_BLOCK before it gets finalized by end_symtab_from_static_block.
962 If the returned value is NULL there is no blockvector created for
963 this symtab (you still must call end_symtab_from_static_block).
964
965 END_ADDR is the same as for end_symtab: the address of the end of the
966 file's text.
967
968 If EXPANDABLE is non-zero the STATIC_BLOCK dictionary is made
969 expandable. */
970
971 struct block *
972 end_symtab_get_static_block (CORE_ADDR end_addr, struct objfile *objfile,
973 int expandable)
974 {
975 /* Finish the lexical context of the last function in the file; pop
976 the context stack. */
977
978 if (context_stack_depth > 0)
979 {
980 struct context_stack *cstk = pop_context ();
981
982 /* Make a block for the local symbols within. */
983 finish_block (cstk->name, &local_symbols, cstk->old_blocks,
984 cstk->start_addr, end_addr, objfile);
985
986 if (context_stack_depth > 0)
987 {
988 /* This is said to happen with SCO. The old coffread.c
989 code simply emptied the context stack, so we do the
990 same. FIXME: Find out why it is happening. This is not
991 believed to happen in most cases (even for coffread.c);
992 it used to be an abort(). */
993 complaint (&symfile_complaints,
994 _("Context stack not empty in end_symtab"));
995 context_stack_depth = 0;
996 }
997 }
998
999 /* Reordered executables may have out of order pending blocks; if
1000 OBJF_REORDERED is true, then sort the pending blocks. */
1001
1002 if ((objfile->flags & OBJF_REORDERED) && pending_blocks)
1003 {
1004 unsigned count = 0;
1005 struct pending_block *pb;
1006 struct block **barray, **bp;
1007 struct cleanup *back_to;
1008
1009 for (pb = pending_blocks; pb != NULL; pb = pb->next)
1010 count++;
1011
1012 barray = xmalloc (sizeof (*barray) * count);
1013 back_to = make_cleanup (xfree, barray);
1014
1015 bp = barray;
1016 for (pb = pending_blocks; pb != NULL; pb = pb->next)
1017 *bp++ = pb->block;
1018
1019 qsort (barray, count, sizeof (*barray), block_compar);
1020
1021 bp = barray;
1022 for (pb = pending_blocks; pb != NULL; pb = pb->next)
1023 pb->block = *bp++;
1024
1025 do_cleanups (back_to);
1026 }
1027
1028 /* Cleanup any undefined types that have been left hanging around
1029 (this needs to be done before the finish_blocks so that
1030 file_symbols is still good).
1031
1032 Both cleanup_undefined_stabs_types and finish_global_stabs are stabs
1033 specific, but harmless for other symbol readers, since on gdb
1034 startup or when finished reading stabs, the state is set so these
1035 are no-ops. FIXME: Is this handled right in case of QUIT? Can
1036 we make this cleaner? */
1037
1038 cleanup_undefined_stabs_types (objfile);
1039 finish_global_stabs (objfile);
1040
1041 if (pending_blocks == NULL
1042 && file_symbols == NULL
1043 && global_symbols == NULL
1044 && have_line_numbers == 0
1045 && pending_macros == NULL)
1046 {
1047 /* Ignore symtabs that have no functions with real debugging info. */
1048 return NULL;
1049 }
1050 else
1051 {
1052 /* Define the STATIC_BLOCK. */
1053 return finish_block_internal (NULL, &file_symbols, NULL,
1054 last_source_start_addr, end_addr, objfile,
1055 0, expandable);
1056 }
1057 }
1058
1059 /* Implementation of the second part of end_symtab. Pass STATIC_BLOCK
1060 as value returned by end_symtab_get_static_block.
1061
1062 SECTION is the same as for end_symtab: the section number
1063 (in objfile->section_offsets) of the blockvector and linetable.
1064
1065 If EXPANDABLE is non-zero the GLOBAL_BLOCK dictionary is made
1066 expandable. */
1067
1068 struct symtab *
1069 end_symtab_from_static_block (struct block *static_block,
1070 struct objfile *objfile, int section,
1071 int expandable)
1072 {
1073 struct symtab *symtab = NULL;
1074 struct blockvector *blockvector;
1075 struct subfile *subfile;
1076 struct subfile *nextsub;
1077
1078 if (static_block == NULL)
1079 {
1080 /* Ignore symtabs that have no functions with real debugging info. */
1081 blockvector = NULL;
1082 }
1083 else
1084 {
1085 CORE_ADDR end_addr = BLOCK_END (static_block);
1086
1087 /* Define after STATIC_BLOCK also GLOBAL_BLOCK, and build the
1088 blockvector. */
1089 finish_block_internal (NULL, &global_symbols, NULL,
1090 last_source_start_addr, end_addr, objfile,
1091 1, expandable);
1092 blockvector = make_blockvector (objfile);
1093 }
1094
1095 /* Read the line table if it has to be read separately. */
1096 if (objfile->sf->sym_read_linetable != NULL)
1097 objfile->sf->sym_read_linetable ();
1098
1099 /* Handle the case where the debug info specifies a different path
1100 for the main source file. It can cause us to lose track of its
1101 line number information. */
1102 watch_main_source_file_lossage ();
1103
1104 /* Now create the symtab objects proper, one for each subfile. */
1105 /* (The main file is the last one on the chain.) */
1106
1107 for (subfile = subfiles; subfile; subfile = nextsub)
1108 {
1109 int linetablesize = 0;
1110 symtab = NULL;
1111
1112 /* If we have blocks of symbols, make a symtab. Otherwise, just
1113 ignore this file and any line number info in it. */
1114 if (blockvector)
1115 {
1116 if (subfile->line_vector)
1117 {
1118 linetablesize = sizeof (struct linetable) +
1119 subfile->line_vector->nitems * sizeof (struct linetable_entry);
1120
1121 /* Like the pending blocks, the line table may be
1122 scrambled in reordered executables. Sort it if
1123 OBJF_REORDERED is true. */
1124 if (objfile->flags & OBJF_REORDERED)
1125 qsort (subfile->line_vector->item,
1126 subfile->line_vector->nitems,
1127 sizeof (struct linetable_entry), compare_line_numbers);
1128 }
1129
1130 /* Now, allocate a symbol table. */
1131 if (subfile->symtab == NULL)
1132 symtab = allocate_symtab (subfile->name, objfile);
1133 else
1134 symtab = subfile->symtab;
1135
1136 /* Fill in its components. */
1137 symtab->blockvector = blockvector;
1138 symtab->macro_table = pending_macros;
1139 if (subfile->line_vector)
1140 {
1141 /* Reallocate the line table on the symbol obstack. */
1142 symtab->linetable = (struct linetable *)
1143 obstack_alloc (&objfile->objfile_obstack, linetablesize);
1144 memcpy (symtab->linetable, subfile->line_vector, linetablesize);
1145 }
1146 else
1147 {
1148 symtab->linetable = NULL;
1149 }
1150 symtab->block_line_section = section;
1151 if (subfile->dirname)
1152 {
1153 /* Reallocate the dirname on the symbol obstack. */
1154 symtab->dirname = (char *)
1155 obstack_alloc (&objfile->objfile_obstack,
1156 strlen (subfile->dirname) + 1);
1157 strcpy (symtab->dirname, subfile->dirname);
1158 }
1159 else
1160 {
1161 symtab->dirname = NULL;
1162 }
1163
1164 /* Use whatever language we have been using for this
1165 subfile, not the one that was deduced in allocate_symtab
1166 from the filename. We already did our own deducing when
1167 we created the subfile, and we may have altered our
1168 opinion of what language it is from things we found in
1169 the symbols. */
1170 symtab->language = subfile->language;
1171
1172 /* Save the debug format string (if any) in the symtab. */
1173 symtab->debugformat = subfile->debugformat;
1174
1175 /* Similarly for the producer. */
1176 symtab->producer = subfile->producer;
1177
1178 /* All symtabs for the main file and the subfiles share a
1179 blockvector, so we need to clear primary for everything
1180 but the main file. */
1181
1182 symtab->primary = 0;
1183 }
1184 else
1185 {
1186 if (subfile->symtab)
1187 {
1188 /* Since we are ignoring that subfile, we also need
1189 to unlink the associated empty symtab that we created.
1190 Otherwise, we can run into trouble because various parts
1191 such as the block-vector are uninitialized whereas
1192 the rest of the code assumes that they are.
1193
1194 We can only unlink the symtab because it was allocated
1195 on the objfile obstack. */
1196 struct symtab *s;
1197
1198 if (objfile->symtabs == subfile->symtab)
1199 objfile->symtabs = objfile->symtabs->next;
1200 else
1201 ALL_OBJFILE_SYMTABS (objfile, s)
1202 if (s->next == subfile->symtab)
1203 {
1204 s->next = s->next->next;
1205 break;
1206 }
1207 subfile->symtab = NULL;
1208 }
1209 }
1210 if (subfile->name != NULL)
1211 {
1212 xfree ((void *) subfile->name);
1213 }
1214 if (subfile->dirname != NULL)
1215 {
1216 xfree ((void *) subfile->dirname);
1217 }
1218 if (subfile->line_vector != NULL)
1219 {
1220 xfree ((void *) subfile->line_vector);
1221 }
1222
1223 nextsub = subfile->next;
1224 xfree ((void *) subfile);
1225 }
1226
1227 /* Set this for the main source file. */
1228 if (symtab)
1229 {
1230 symtab->primary = 1;
1231
1232 if (symtab->blockvector)
1233 {
1234 struct block *b = BLOCKVECTOR_BLOCK (symtab->blockvector,
1235 GLOBAL_BLOCK);
1236
1237 set_block_symtab (b, symtab);
1238 }
1239 }
1240
1241 /* Default any symbols without a specified symtab to the primary
1242 symtab. */
1243 if (blockvector)
1244 {
1245 int block_i;
1246
1247 for (block_i = 0; block_i < BLOCKVECTOR_NBLOCKS (blockvector); block_i++)
1248 {
1249 struct block *block = BLOCKVECTOR_BLOCK (blockvector, block_i);
1250 struct symbol *sym;
1251 struct dict_iterator iter;
1252
1253 /* Inlined functions may have symbols not in the global or
1254 static symbol lists. */
1255 if (BLOCK_FUNCTION (block) != NULL)
1256 if (SYMBOL_SYMTAB (BLOCK_FUNCTION (block)) == NULL)
1257 SYMBOL_SYMTAB (BLOCK_FUNCTION (block)) = symtab;
1258
1259 /* Note that we only want to fix up symbols from the local
1260 blocks, not blocks coming from included symtabs. That is why
1261 we use ALL_DICT_SYMBOLS here and not ALL_BLOCK_SYMBOLS. */
1262 ALL_DICT_SYMBOLS (BLOCK_DICT (block), iter, sym)
1263 if (SYMBOL_SYMTAB (sym) == NULL)
1264 SYMBOL_SYMTAB (sym) = symtab;
1265 }
1266 }
1267
1268 reset_symtab_globals ();
1269
1270 return symtab;
1271 }
1272
1273 /* Finish the symbol definitions for one main source file, close off
1274 all the lexical contexts for that file (creating struct block's for
1275 them), then make the struct symtab for that file and put it in the
1276 list of all such.
1277
1278 END_ADDR is the address of the end of the file's text. SECTION is
1279 the section number (in objfile->section_offsets) of the blockvector
1280 and linetable.
1281
1282 Note that it is possible for end_symtab() to return NULL. In
1283 particular, for the DWARF case at least, it will return NULL when
1284 it finds a compilation unit that has exactly one DIE, a
1285 TAG_compile_unit DIE. This can happen when we link in an object
1286 file that was compiled from an empty source file. Returning NULL
1287 is probably not the correct thing to do, because then gdb will
1288 never know about this empty file (FIXME).
1289
1290 If you need to modify STATIC_BLOCK before it is finalized you should
1291 call end_symtab_get_static_block and end_symtab_from_static_block
1292 yourself. */
1293
1294 struct symtab *
1295 end_symtab (CORE_ADDR end_addr, struct objfile *objfile, int section)
1296 {
1297 struct block *static_block;
1298
1299 static_block = end_symtab_get_static_block (end_addr, objfile, 0);
1300 return end_symtab_from_static_block (static_block, objfile, section, 0);
1301 }
1302
1303 /* Same as end_symtab except create a symtab that can be later added to. */
1304
1305 struct symtab *
1306 end_expandable_symtab (CORE_ADDR end_addr, struct objfile *objfile,
1307 int section)
1308 {
1309 struct block *static_block;
1310
1311 static_block = end_symtab_get_static_block (end_addr, objfile, 1);
1312 return end_symtab_from_static_block (static_block, objfile, section, 1);
1313 }
1314
1315 /* Subroutine of augment_type_symtab to simplify it.
1316 Attach SYMTAB to all symbols in PENDING_LIST that don't have one. */
1317
1318 static void
1319 set_missing_symtab (struct pending *pending_list, struct symtab *symtab)
1320 {
1321 struct pending *pending;
1322 int i;
1323
1324 for (pending = pending_list; pending != NULL; pending = pending->next)
1325 {
1326 for (i = 0; i < pending->nsyms; ++i)
1327 {
1328 if (SYMBOL_SYMTAB (pending->symbol[i]) == NULL)
1329 SYMBOL_SYMTAB (pending->symbol[i]) = symtab;
1330 }
1331 }
1332 }
1333
1334 /* Same as end_symtab, but for the case where we're adding more symbols
1335 to an existing symtab that is known to contain only type information.
1336 This is the case for DWARF4 Type Units. */
1337
1338 void
1339 augment_type_symtab (struct objfile *objfile, struct symtab *primary_symtab)
1340 {
1341 struct blockvector *blockvector = primary_symtab->blockvector;
1342 int i;
1343
1344 if (context_stack_depth > 0)
1345 {
1346 complaint (&symfile_complaints,
1347 _("Context stack not empty in augment_type_symtab"));
1348 context_stack_depth = 0;
1349 }
1350 if (pending_blocks != NULL)
1351 complaint (&symfile_complaints, _("Blocks in a type symtab"));
1352 if (pending_macros != NULL)
1353 complaint (&symfile_complaints, _("Macro in a type symtab"));
1354 if (have_line_numbers)
1355 complaint (&symfile_complaints,
1356 _("Line numbers recorded in a type symtab"));
1357
1358 if (file_symbols != NULL)
1359 {
1360 struct block *block = BLOCKVECTOR_BLOCK (blockvector, STATIC_BLOCK);
1361
1362 /* First mark any symbols without a specified symtab as belonging
1363 to the primary symtab. */
1364 set_missing_symtab (file_symbols, primary_symtab);
1365
1366 dict_add_pending (BLOCK_DICT (block), file_symbols);
1367 }
1368
1369 if (global_symbols != NULL)
1370 {
1371 struct block *block = BLOCKVECTOR_BLOCK (blockvector, GLOBAL_BLOCK);
1372
1373 /* First mark any symbols without a specified symtab as belonging
1374 to the primary symtab. */
1375 set_missing_symtab (global_symbols, primary_symtab);
1376
1377 dict_add_pending (BLOCK_DICT (block), global_symbols);
1378 }
1379
1380 reset_symtab_globals ();
1381 }
1382
1383 /* Push a context block. Args are an identifying nesting level
1384 (checkable when you pop it), and the starting PC address of this
1385 context. */
1386
1387 struct context_stack *
1388 push_context (int desc, CORE_ADDR valu)
1389 {
1390 struct context_stack *new;
1391
1392 if (context_stack_depth == context_stack_size)
1393 {
1394 context_stack_size *= 2;
1395 context_stack = (struct context_stack *)
1396 xrealloc ((char *) context_stack,
1397 (context_stack_size * sizeof (struct context_stack)));
1398 }
1399
1400 new = &context_stack[context_stack_depth++];
1401 new->depth = desc;
1402 new->locals = local_symbols;
1403 new->params = param_symbols;
1404 new->old_blocks = pending_blocks;
1405 new->start_addr = valu;
1406 new->using_directives = using_directives;
1407 new->name = NULL;
1408
1409 local_symbols = NULL;
1410 param_symbols = NULL;
1411 using_directives = NULL;
1412
1413 return new;
1414 }
1415
1416 /* Pop a context block. Returns the address of the context block just
1417 popped. */
1418
1419 struct context_stack *
1420 pop_context (void)
1421 {
1422 gdb_assert (context_stack_depth > 0);
1423 return (&context_stack[--context_stack_depth]);
1424 }
1425
1426 \f
1427
1428 /* Compute a small integer hash code for the given name. */
1429
1430 int
1431 hashname (const char *name)
1432 {
1433 return (hash(name,strlen(name)) % HASHSIZE);
1434 }
1435 \f
1436
1437 void
1438 record_debugformat (const char *format)
1439 {
1440 current_subfile->debugformat = format;
1441 }
1442
1443 void
1444 record_producer (const char *producer)
1445 {
1446 current_subfile->producer = producer;
1447 }
1448
1449 /* Merge the first symbol list SRCLIST into the second symbol list
1450 TARGETLIST by repeated calls to add_symbol_to_list(). This
1451 procedure "frees" each link of SRCLIST by adding it to the
1452 free_pendings list. Caller must set SRCLIST to a null list after
1453 calling this function.
1454
1455 Void return. */
1456
1457 void
1458 merge_symbol_lists (struct pending **srclist, struct pending **targetlist)
1459 {
1460 int i;
1461
1462 if (!srclist || !*srclist)
1463 return;
1464
1465 /* Merge in elements from current link. */
1466 for (i = 0; i < (*srclist)->nsyms; i++)
1467 add_symbol_to_list ((*srclist)->symbol[i], targetlist);
1468
1469 /* Recurse on next. */
1470 merge_symbol_lists (&(*srclist)->next, targetlist);
1471
1472 /* "Free" the current link. */
1473 (*srclist)->next = free_pendings;
1474 free_pendings = (*srclist);
1475 }
1476 \f
1477 /* Initialize anything that needs initializing when starting to read a
1478 fresh piece of a symbol file, e.g. reading in the stuff
1479 corresponding to a psymtab. */
1480
1481 void
1482 buildsym_init (void)
1483 {
1484 free_pendings = NULL;
1485 file_symbols = NULL;
1486 global_symbols = NULL;
1487 pending_blocks = NULL;
1488 pending_macros = NULL;
1489
1490 /* We shouldn't have any address map at this point. */
1491 gdb_assert (! pending_addrmap);
1492 pending_addrmap_interesting = 0;
1493 }
1494
1495 /* Initialize anything that needs initializing when a completely new
1496 symbol file is specified (not just adding some symbols from another
1497 file, e.g. a shared library). */
1498
1499 void
1500 buildsym_new_init (void)
1501 {
1502 buildsym_init ();
1503 }
This page took 0.06004 seconds and 5 git commands to generate.