Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Support routines for building symbol tables in GDB's internal format. |
32d0add0 | 2 | Copyright (C) 1986-2015 Free Software Foundation, Inc. |
c906108c | 3 | |
c5aa993b | 4 | This file is part of GDB. |
c906108c | 5 | |
c5aa993b JM |
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 | |
a9762ec7 | 8 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 9 | (at your option) any later version. |
c906108c | 10 | |
c5aa993b JM |
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. | |
c906108c | 15 | |
c5aa993b | 16 | You should have received a copy of the GNU General Public License |
a9762ec7 | 17 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
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, | |
0ab9ce85 DE |
24 | DWARF, etc) belong somewhere else. |
25 | ||
26 | The basic way this module is used is as follows: | |
27 | ||
28 | buildsym_init (); | |
29 | cleanups = make_cleanup (really_free_pendings, NULL); | |
30 | cust = start_symtab (...); | |
31 | ... read debug info ... | |
32 | cust = end_symtab (...); | |
33 | do_cleanups (cleanups); | |
34 | ||
35 | The compunit symtab pointer ("cust") is returned from both start_symtab | |
36 | and end_symtab to simplify the debug info readers. | |
37 | ||
38 | There are minor variations on this, e.g., dwarf2read.c splits end_symtab | |
39 | into two calls: end_symtab_get_static_block, end_symtab_from_static_block, | |
40 | but all debug info readers follow this basic flow. | |
41 | ||
42 | Reading DWARF Type Units is another variation: | |
43 | ||
44 | buildsym_init (); | |
45 | cleanups = make_cleanup (really_free_pendings, NULL); | |
46 | cust = start_symtab (...); | |
47 | ... read debug info ... | |
48 | cust = end_expandable_symtab (...); | |
49 | do_cleanups (cleanups); | |
50 | ||
51 | And then reading subsequent Type Units within the containing "Comp Unit" | |
52 | will use a second flow: | |
53 | ||
54 | buildsym_init (); | |
55 | cleanups = make_cleanup (really_free_pendings, NULL); | |
56 | cust = restart_symtab (...); | |
57 | ... read debug info ... | |
58 | cust = augment_type_symtab (...); | |
59 | do_cleanups (cleanups); | |
60 | ||
61 | dbxread.c and xcoffread.c use another variation: | |
62 | ||
63 | buildsym_init (); | |
64 | cleanups = make_cleanup (really_free_pendings, NULL); | |
65 | cust = start_symtab (...); | |
66 | ... read debug info ... | |
67 | cust = end_symtab (...); | |
68 | ... start_symtab + read + end_symtab repeated ... | |
69 | do_cleanups (cleanups); | |
70 | */ | |
c906108c SS |
71 | |
72 | #include "defs.h" | |
73 | #include "bfd.h" | |
04ea0df1 | 74 | #include "gdb_obstack.h" |
c906108c | 75 | #include "symtab.h" |
72367fb4 | 76 | #include "symfile.h" |
c906108c SS |
77 | #include "objfiles.h" |
78 | #include "gdbtypes.h" | |
79 | #include "complaints.h" | |
4a64f543 | 80 | #include "expression.h" /* For "enum exp_opcode" used by... */ |
357e46e7 | 81 | #include "bcache.h" |
4a64f543 | 82 | #include "filenames.h" /* For DOSish file names. */ |
99d9066e | 83 | #include "macrotab.h" |
261397f8 | 84 | #include "demangle.h" /* Needed by SYMBOL_INIT_DEMANGLED_NAME. */ |
fe898f56 | 85 | #include "block.h" |
9219021c | 86 | #include "cp-support.h" |
de4f826b | 87 | #include "dictionary.h" |
801e3a5b | 88 | #include "addrmap.h" |
9219021c | 89 | |
c906108c | 90 | /* Ask buildsym.h to define the vars it normally declares `extern'. */ |
c5aa993b JM |
91 | #define EXTERN |
92 | /**/ | |
4a64f543 | 93 | #include "buildsym.h" /* Our own declarations. */ |
c906108c SS |
94 | #undef EXTERN |
95 | ||
0a0edcd5 | 96 | /* For cleanup_undefined_stabs_types and finish_global_stabs (somewhat |
c906108c SS |
97 | questionable--see comment where we call them). */ |
98 | ||
99 | #include "stabsread.h" | |
100 | ||
43f3e411 DE |
101 | /* Buildsym's counterpart to struct compunit_symtab. |
102 | TODO(dje): Move all related global state into here. */ | |
4d663531 | 103 | |
43f3e411 DE |
104 | struct buildsym_compunit |
105 | { | |
106 | /* The objfile we're reading debug info from. */ | |
107 | struct objfile *objfile; | |
108 | ||
109 | /* List of subfiles (source files). | |
110 | Files are added to the front of the list. | |
111 | This is important mostly for the language determination hacks we use, | |
112 | which iterate over previously added files. */ | |
113 | struct subfile *subfiles; | |
114 | ||
115 | /* The subfile of the main source file. */ | |
116 | struct subfile *main_subfile; | |
4d663531 | 117 | |
43f3e411 DE |
118 | /* E.g., DW_AT_comp_dir if DWARF. Space for this is malloc'd. */ |
119 | char *comp_dir; | |
4d663531 | 120 | |
43f3e411 DE |
121 | /* Space for this is not malloc'd, and is assumed to have at least |
122 | the same lifetime as objfile. */ | |
123 | const char *producer; | |
4d663531 | 124 | |
43f3e411 DE |
125 | /* Space for this is not malloc'd, and is assumed to have at least |
126 | the same lifetime as objfile. */ | |
127 | const char *debugformat; | |
94d09e04 | 128 | |
43f3e411 DE |
129 | /* The compunit we are building. */ |
130 | struct compunit_symtab *compunit_symtab; | |
131 | }; | |
94d09e04 | 132 | |
43f3e411 DE |
133 | /* The work-in-progress of the compunit we are building. |
134 | This is created first, before any subfiles by start_symtab. */ | |
7bab9b58 | 135 | |
43f3e411 | 136 | static struct buildsym_compunit *buildsym_compunit; |
7bab9b58 | 137 | |
c906108c SS |
138 | /* List of free `struct pending' structures for reuse. */ |
139 | ||
140 | static struct pending *free_pendings; | |
141 | ||
142 | /* Non-zero if symtab has line number info. This prevents an | |
143 | otherwise empty symtab from being tossed. */ | |
144 | ||
145 | static int have_line_numbers; | |
801e3a5b JB |
146 | |
147 | /* The mutable address map for the compilation unit whose symbols | |
148 | we're currently reading. The symtabs' shared blockvector will | |
149 | point to a fixed copy of this. */ | |
150 | static struct addrmap *pending_addrmap; | |
151 | ||
152 | /* The obstack on which we allocate pending_addrmap. | |
153 | If pending_addrmap is NULL, this is uninitialized; otherwise, it is | |
154 | initialized (and holds pending_addrmap). */ | |
155 | static struct obstack pending_addrmap_obstack; | |
156 | ||
157 | /* Non-zero if we recorded any ranges in the addrmap that are | |
158 | different from those in the blockvector already. We set this to | |
159 | zero when we start processing a symfile, and if it's still zero at | |
160 | the end, then we just toss the addrmap. */ | |
161 | static int pending_addrmap_interesting; | |
162 | ||
93eed41f TT |
163 | /* An obstack used for allocating pending blocks. */ |
164 | ||
165 | static struct obstack pending_block_obstack; | |
166 | ||
167 | /* List of blocks already made (lexical contexts already closed). | |
168 | This is used at the end to make the blockvector. */ | |
169 | ||
170 | struct pending_block | |
171 | { | |
172 | struct pending_block *next; | |
173 | struct block *block; | |
174 | }; | |
175 | ||
176 | /* Pointer to the head of a linked list of symbol blocks which have | |
177 | already been finalized (lexical contexts already closed) and which | |
178 | are just waiting to be built into a blockvector when finalizing the | |
179 | associated symtab. */ | |
180 | ||
181 | static struct pending_block *pending_blocks; | |
fc474241 DE |
182 | |
183 | struct subfile_stack | |
184 | { | |
185 | struct subfile_stack *next; | |
186 | char *name; | |
187 | }; | |
188 | ||
189 | static struct subfile_stack *subfile_stack; | |
190 | ||
191 | /* The macro table for the compilation unit whose symbols we're | |
43f3e411 | 192 | currently reading. */ |
fc474241 DE |
193 | static struct macro_table *pending_macros; |
194 | ||
0ab9ce85 DE |
195 | static void free_buildsym_compunit (void); |
196 | ||
c906108c | 197 | static int compare_line_numbers (const void *ln1p, const void *ln2p); |
0b49e518 TT |
198 | |
199 | static void record_pending_block (struct objfile *objfile, | |
200 | struct block *block, | |
201 | struct pending_block *opblock); | |
c906108c SS |
202 | |
203 | /* Initial sizes of data structures. These are realloc'd larger if | |
204 | needed, and realloc'd down to the size actually used, when | |
205 | completed. */ | |
206 | ||
207 | #define INITIAL_CONTEXT_STACK_SIZE 10 | |
208 | #define INITIAL_LINE_VECTOR_LENGTH 1000 | |
209 | \f | |
210 | ||
4a64f543 | 211 | /* Maintain the lists of symbols and blocks. */ |
c906108c | 212 | |
93bf33fd | 213 | /* Add a symbol to one of the lists of symbols. */ |
c906108c SS |
214 | |
215 | void | |
216 | add_symbol_to_list (struct symbol *symbol, struct pending **listhead) | |
217 | { | |
52f0bd74 | 218 | struct pending *link; |
c906108c SS |
219 | |
220 | /* If this is an alias for another symbol, don't add it. */ | |
221 | if (symbol->ginfo.name && symbol->ginfo.name[0] == '#') | |
222 | return; | |
223 | ||
4a64f543 | 224 | /* We keep PENDINGSIZE symbols in each link of the list. If we |
c906108c SS |
225 | don't have a link with room in it, add a new link. */ |
226 | if (*listhead == NULL || (*listhead)->nsyms == PENDINGSIZE) | |
227 | { | |
228 | if (free_pendings) | |
229 | { | |
230 | link = free_pendings; | |
231 | free_pendings = link->next; | |
232 | } | |
233 | else | |
234 | { | |
235 | link = (struct pending *) xmalloc (sizeof (struct pending)); | |
236 | } | |
237 | ||
238 | link->next = *listhead; | |
239 | *listhead = link; | |
240 | link->nsyms = 0; | |
241 | } | |
242 | ||
243 | (*listhead)->symbol[(*listhead)->nsyms++] = symbol; | |
244 | } | |
245 | ||
246 | /* Find a symbol named NAME on a LIST. NAME need not be | |
247 | '\0'-terminated; LENGTH is the length of the name. */ | |
248 | ||
249 | struct symbol * | |
250 | find_symbol_in_list (struct pending *list, char *name, int length) | |
251 | { | |
252 | int j; | |
0d5cff50 | 253 | const char *pp; |
c906108c SS |
254 | |
255 | while (list != NULL) | |
256 | { | |
257 | for (j = list->nsyms; --j >= 0;) | |
258 | { | |
3567439c | 259 | pp = SYMBOL_LINKAGE_NAME (list->symbol[j]); |
5aafa1cc PM |
260 | if (*pp == *name && strncmp (pp, name, length) == 0 |
261 | && pp[length] == '\0') | |
c906108c SS |
262 | { |
263 | return (list->symbol[j]); | |
264 | } | |
265 | } | |
266 | list = list->next; | |
267 | } | |
268 | return (NULL); | |
269 | } | |
270 | ||
0ab9ce85 DE |
271 | /* At end of reading syms, or in case of quit, ensure everything associated |
272 | with building symtabs is freed. This is intended to be registered as a | |
273 | cleanup before doing psymtab->symtab expansion. | |
274 | ||
275 | N.B. This is *not* intended to be used when building psymtabs. Some debug | |
276 | info readers call this anyway, which is harmless if confusing. */ | |
c906108c | 277 | |
c906108c | 278 | void |
bde58177 | 279 | really_free_pendings (void *dummy) |
c906108c SS |
280 | { |
281 | struct pending *next, *next1; | |
282 | ||
283 | for (next = free_pendings; next; next = next1) | |
284 | { | |
285 | next1 = next->next; | |
b8c9b27d | 286 | xfree ((void *) next); |
c906108c SS |
287 | } |
288 | free_pendings = NULL; | |
289 | ||
290 | free_pending_blocks (); | |
291 | ||
292 | for (next = file_symbols; next != NULL; next = next1) | |
293 | { | |
294 | next1 = next->next; | |
b8c9b27d | 295 | xfree ((void *) next); |
c906108c SS |
296 | } |
297 | file_symbols = NULL; | |
298 | ||
299 | for (next = global_symbols; next != NULL; next = next1) | |
300 | { | |
301 | next1 = next->next; | |
b8c9b27d | 302 | xfree ((void *) next); |
c906108c SS |
303 | } |
304 | global_symbols = NULL; | |
99d9066e JB |
305 | |
306 | if (pending_macros) | |
307 | free_macro_table (pending_macros); | |
0ab9ce85 | 308 | pending_macros = NULL; |
801e3a5b JB |
309 | |
310 | if (pending_addrmap) | |
0ab9ce85 DE |
311 | obstack_free (&pending_addrmap_obstack, NULL); |
312 | pending_addrmap = NULL; | |
313 | ||
314 | free_buildsym_compunit (); | |
c906108c SS |
315 | } |
316 | ||
4a64f543 | 317 | /* This function is called to discard any pending blocks. */ |
c906108c SS |
318 | |
319 | void | |
320 | free_pending_blocks (void) | |
321 | { | |
93eed41f TT |
322 | if (pending_blocks != NULL) |
323 | { | |
324 | obstack_free (&pending_block_obstack, NULL); | |
325 | pending_blocks = NULL; | |
326 | } | |
c906108c SS |
327 | } |
328 | ||
329 | /* Take one of the lists of symbols and make a block from it. Keep | |
330 | the order the symbols have in the list (reversed from the input | |
331 | file). Put the block on the list of pending blocks. */ | |
332 | ||
84a146c9 TT |
333 | static struct block * |
334 | finish_block_internal (struct symbol *symbol, struct pending **listhead, | |
335 | struct pending_block *old_blocks, | |
336 | CORE_ADDR start, CORE_ADDR end, | |
6d30eef8 | 337 | int is_global, int expandable) |
c906108c | 338 | { |
43f3e411 | 339 | struct objfile *objfile = buildsym_compunit->objfile; |
5af949e3 | 340 | struct gdbarch *gdbarch = get_objfile_arch (objfile); |
52f0bd74 AC |
341 | struct pending *next, *next1; |
342 | struct block *block; | |
343 | struct pending_block *pblock; | |
c906108c | 344 | struct pending_block *opblock; |
c906108c | 345 | |
84a146c9 TT |
346 | block = (is_global |
347 | ? allocate_global_block (&objfile->objfile_obstack) | |
348 | : allocate_block (&objfile->objfile_obstack)); | |
c906108c | 349 | |
261397f8 DJ |
350 | if (symbol) |
351 | { | |
4a146b47 | 352 | BLOCK_DICT (block) = dict_create_linear (&objfile->objfile_obstack, |
de4f826b | 353 | *listhead); |
261397f8 DJ |
354 | } |
355 | else | |
c906108c | 356 | { |
6d30eef8 DE |
357 | if (expandable) |
358 | { | |
359 | BLOCK_DICT (block) = dict_create_hashed_expandable (); | |
360 | dict_add_pending (BLOCK_DICT (block), *listhead); | |
361 | } | |
362 | else | |
363 | { | |
364 | BLOCK_DICT (block) = | |
365 | dict_create_hashed (&objfile->objfile_obstack, *listhead); | |
366 | } | |
c906108c SS |
367 | } |
368 | ||
369 | BLOCK_START (block) = start; | |
370 | BLOCK_END (block) = end; | |
c906108c | 371 | |
c906108c SS |
372 | /* Put the block in as the value of the symbol that names it. */ |
373 | ||
374 | if (symbol) | |
375 | { | |
376 | struct type *ftype = SYMBOL_TYPE (symbol); | |
de4f826b | 377 | struct dict_iterator iter; |
c906108c SS |
378 | SYMBOL_BLOCK_VALUE (symbol) = block; |
379 | BLOCK_FUNCTION (block) = symbol; | |
380 | ||
381 | if (TYPE_NFIELDS (ftype) <= 0) | |
382 | { | |
383 | /* No parameter type information is recorded with the | |
384 | function's type. Set that from the type of the | |
4a64f543 | 385 | parameter symbols. */ |
c906108c SS |
386 | int nparams = 0, iparams; |
387 | struct symbol *sym; | |
8157b174 TT |
388 | |
389 | /* Here we want to directly access the dictionary, because | |
390 | we haven't fully initialized the block yet. */ | |
391 | ALL_DICT_SYMBOLS (BLOCK_DICT (block), iter, sym) | |
c906108c | 392 | { |
2a2d4dc3 AS |
393 | if (SYMBOL_IS_ARGUMENT (sym)) |
394 | nparams++; | |
c906108c SS |
395 | } |
396 | if (nparams > 0) | |
397 | { | |
398 | TYPE_NFIELDS (ftype) = nparams; | |
399 | TYPE_FIELDS (ftype) = (struct field *) | |
400 | TYPE_ALLOC (ftype, nparams * sizeof (struct field)); | |
401 | ||
de4f826b | 402 | iparams = 0; |
8157b174 TT |
403 | /* Here we want to directly access the dictionary, because |
404 | we haven't fully initialized the block yet. */ | |
405 | ALL_DICT_SYMBOLS (BLOCK_DICT (block), iter, sym) | |
c906108c | 406 | { |
de4f826b DC |
407 | if (iparams == nparams) |
408 | break; | |
409 | ||
2a2d4dc3 | 410 | if (SYMBOL_IS_ARGUMENT (sym)) |
c906108c | 411 | { |
c906108c | 412 | TYPE_FIELD_TYPE (ftype, iparams) = SYMBOL_TYPE (sym); |
8176bb6d | 413 | TYPE_FIELD_ARTIFICIAL (ftype, iparams) = 0; |
c906108c | 414 | iparams++; |
c906108c SS |
415 | } |
416 | } | |
417 | } | |
418 | } | |
419 | } | |
420 | else | |
421 | { | |
422 | BLOCK_FUNCTION (block) = NULL; | |
423 | } | |
424 | ||
425 | /* Now "free" the links of the list, and empty the list. */ | |
426 | ||
427 | for (next = *listhead; next; next = next1) | |
428 | { | |
429 | next1 = next->next; | |
430 | next->next = free_pendings; | |
431 | free_pendings = next; | |
432 | } | |
433 | *listhead = NULL; | |
434 | ||
c906108c | 435 | /* Check to be sure that the blocks have an end address that is |
4a64f543 | 436 | greater than starting address. */ |
c906108c SS |
437 | |
438 | if (BLOCK_END (block) < BLOCK_START (block)) | |
439 | { | |
440 | if (symbol) | |
441 | { | |
23136709 | 442 | complaint (&symfile_complaints, |
3e43a32a MS |
443 | _("block end address less than block " |
444 | "start address in %s (patched it)"), | |
de5ad195 | 445 | SYMBOL_PRINT_NAME (symbol)); |
c906108c SS |
446 | } |
447 | else | |
448 | { | |
23136709 | 449 | complaint (&symfile_complaints, |
3e43a32a MS |
450 | _("block end address %s less than block " |
451 | "start address %s (patched it)"), | |
5af949e3 UW |
452 | paddress (gdbarch, BLOCK_END (block)), |
453 | paddress (gdbarch, BLOCK_START (block))); | |
c906108c | 454 | } |
4a64f543 | 455 | /* Better than nothing. */ |
c906108c SS |
456 | BLOCK_END (block) = BLOCK_START (block); |
457 | } | |
c906108c SS |
458 | |
459 | /* Install this block as the superblock of all blocks made since the | |
460 | start of this scope that don't have superblocks yet. */ | |
461 | ||
462 | opblock = NULL; | |
c0219d42 MS |
463 | for (pblock = pending_blocks; |
464 | pblock && pblock != old_blocks; | |
465 | pblock = pblock->next) | |
c906108c SS |
466 | { |
467 | if (BLOCK_SUPERBLOCK (pblock->block) == NULL) | |
468 | { | |
c906108c | 469 | /* Check to be sure the blocks are nested as we receive |
4a64f543 | 470 | them. If the compiler/assembler/linker work, this just |
14711c82 DJ |
471 | burns a small amount of time. |
472 | ||
473 | Skip blocks which correspond to a function; they're not | |
474 | physically nested inside this other blocks, only | |
475 | lexically nested. */ | |
476 | if (BLOCK_FUNCTION (pblock->block) == NULL | |
477 | && (BLOCK_START (pblock->block) < BLOCK_START (block) | |
478 | || BLOCK_END (pblock->block) > BLOCK_END (block))) | |
c906108c SS |
479 | { |
480 | if (symbol) | |
481 | { | |
23136709 | 482 | complaint (&symfile_complaints, |
3d263c1d | 483 | _("inner block not inside outer block in %s"), |
de5ad195 | 484 | SYMBOL_PRINT_NAME (symbol)); |
c906108c SS |
485 | } |
486 | else | |
487 | { | |
23136709 | 488 | complaint (&symfile_complaints, |
3e43a32a MS |
489 | _("inner block (%s-%s) not " |
490 | "inside outer block (%s-%s)"), | |
5af949e3 UW |
491 | paddress (gdbarch, BLOCK_START (pblock->block)), |
492 | paddress (gdbarch, BLOCK_END (pblock->block)), | |
493 | paddress (gdbarch, BLOCK_START (block)), | |
494 | paddress (gdbarch, BLOCK_END (block))); | |
c906108c SS |
495 | } |
496 | if (BLOCK_START (pblock->block) < BLOCK_START (block)) | |
497 | BLOCK_START (pblock->block) = BLOCK_START (block); | |
498 | if (BLOCK_END (pblock->block) > BLOCK_END (block)) | |
499 | BLOCK_END (pblock->block) = BLOCK_END (block); | |
500 | } | |
c906108c SS |
501 | BLOCK_SUPERBLOCK (pblock->block) = block; |
502 | } | |
503 | opblock = pblock; | |
504 | } | |
505 | ||
22cee43f PMR |
506 | block_set_using (block, |
507 | (is_global | |
508 | ? global_using_directives | |
509 | : local_using_directives), | |
510 | &objfile->objfile_obstack); | |
511 | if (is_global) | |
512 | global_using_directives = NULL; | |
513 | else | |
514 | local_using_directives = NULL; | |
27aa8d6a | 515 | |
c906108c | 516 | record_pending_block (objfile, block, opblock); |
801e3a5b JB |
517 | |
518 | return block; | |
c906108c SS |
519 | } |
520 | ||
84a146c9 TT |
521 | struct block * |
522 | finish_block (struct symbol *symbol, struct pending **listhead, | |
523 | struct pending_block *old_blocks, | |
4d663531 | 524 | CORE_ADDR start, CORE_ADDR end) |
84a146c9 TT |
525 | { |
526 | return finish_block_internal (symbol, listhead, old_blocks, | |
4d663531 | 527 | start, end, 0, 0); |
84a146c9 | 528 | } |
de4f826b | 529 | |
c906108c SS |
530 | /* Record BLOCK on the list of all blocks in the file. Put it after |
531 | OPBLOCK, or at the beginning if opblock is NULL. This puts the | |
532 | block in the list after all its subblocks. | |
533 | ||
4a146b47 | 534 | Allocate the pending block struct in the objfile_obstack to save |
c906108c SS |
535 | time. This wastes a little space. FIXME: Is it worth it? */ |
536 | ||
0b49e518 | 537 | static void |
c906108c SS |
538 | record_pending_block (struct objfile *objfile, struct block *block, |
539 | struct pending_block *opblock) | |
540 | { | |
52f0bd74 | 541 | struct pending_block *pblock; |
c906108c | 542 | |
93eed41f TT |
543 | if (pending_blocks == NULL) |
544 | obstack_init (&pending_block_obstack); | |
545 | ||
c906108c | 546 | pblock = (struct pending_block *) |
93eed41f | 547 | obstack_alloc (&pending_block_obstack, sizeof (struct pending_block)); |
c906108c SS |
548 | pblock->block = block; |
549 | if (opblock) | |
550 | { | |
551 | pblock->next = opblock->next; | |
552 | opblock->next = pblock; | |
553 | } | |
554 | else | |
555 | { | |
556 | pblock->next = pending_blocks; | |
557 | pending_blocks = pblock; | |
558 | } | |
559 | } | |
560 | ||
801e3a5b JB |
561 | |
562 | /* Record that the range of addresses from START to END_INCLUSIVE | |
563 | (inclusive, like it says) belongs to BLOCK. BLOCK's start and end | |
564 | addresses must be set already. You must apply this function to all | |
565 | BLOCK's children before applying it to BLOCK. | |
566 | ||
567 | If a call to this function complicates the picture beyond that | |
568 | already provided by BLOCK_START and BLOCK_END, then we create an | |
569 | address map for the block. */ | |
570 | void | |
571 | record_block_range (struct block *block, | |
572 | CORE_ADDR start, CORE_ADDR end_inclusive) | |
573 | { | |
574 | /* If this is any different from the range recorded in the block's | |
575 | own BLOCK_START and BLOCK_END, then note that the address map has | |
576 | become interesting. Note that even if this block doesn't have | |
577 | any "interesting" ranges, some later block might, so we still | |
578 | need to record this block in the addrmap. */ | |
579 | if (start != BLOCK_START (block) | |
580 | || end_inclusive + 1 != BLOCK_END (block)) | |
581 | pending_addrmap_interesting = 1; | |
582 | ||
583 | if (! pending_addrmap) | |
584 | { | |
585 | obstack_init (&pending_addrmap_obstack); | |
586 | pending_addrmap = addrmap_create_mutable (&pending_addrmap_obstack); | |
587 | } | |
588 | ||
589 | addrmap_set_empty (pending_addrmap, start, end_inclusive, block); | |
590 | } | |
591 | ||
822e978b | 592 | static struct blockvector * |
43f3e411 | 593 | make_blockvector (void) |
c906108c | 594 | { |
43f3e411 | 595 | struct objfile *objfile = buildsym_compunit->objfile; |
52f0bd74 AC |
596 | struct pending_block *next; |
597 | struct blockvector *blockvector; | |
598 | int i; | |
c906108c SS |
599 | |
600 | /* Count the length of the list of blocks. */ | |
601 | ||
602 | for (next = pending_blocks, i = 0; next; next = next->next, i++) | |
603 | {; | |
604 | } | |
605 | ||
606 | blockvector = (struct blockvector *) | |
4a146b47 | 607 | obstack_alloc (&objfile->objfile_obstack, |
c906108c SS |
608 | (sizeof (struct blockvector) |
609 | + (i - 1) * sizeof (struct block *))); | |
610 | ||
4a64f543 | 611 | /* Copy the blocks into the blockvector. This is done in reverse |
c906108c | 612 | order, which happens to put the blocks into the proper order |
4a64f543 | 613 | (ascending starting address). finish_block has hair to insert |
c906108c SS |
614 | each block into the list after its subblocks in order to make |
615 | sure this is true. */ | |
616 | ||
617 | BLOCKVECTOR_NBLOCKS (blockvector) = i; | |
618 | for (next = pending_blocks; next; next = next->next) | |
619 | { | |
620 | BLOCKVECTOR_BLOCK (blockvector, --i) = next->block; | |
621 | } | |
622 | ||
89ba75b1 | 623 | free_pending_blocks (); |
c906108c | 624 | |
801e3a5b JB |
625 | /* If we needed an address map for this symtab, record it in the |
626 | blockvector. */ | |
627 | if (pending_addrmap && pending_addrmap_interesting) | |
628 | BLOCKVECTOR_MAP (blockvector) | |
629 | = addrmap_create_fixed (pending_addrmap, &objfile->objfile_obstack); | |
630 | else | |
631 | BLOCKVECTOR_MAP (blockvector) = 0; | |
4aad0dfc | 632 | |
c906108c | 633 | /* Some compilers output blocks in the wrong order, but we depend on |
4a64f543 | 634 | their being in the right order so we can binary search. Check the |
4aad0dfc DE |
635 | order and moan about it. |
636 | Note: Remember that the first two blocks are the global and static | |
637 | blocks. We could special case that fact and begin checking at block 2. | |
638 | To avoid making that assumption we do not. */ | |
c906108c SS |
639 | if (BLOCKVECTOR_NBLOCKS (blockvector) > 1) |
640 | { | |
641 | for (i = 1; i < BLOCKVECTOR_NBLOCKS (blockvector); i++) | |
642 | { | |
643 | if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i - 1)) | |
644 | > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i))) | |
645 | { | |
59527da0 JB |
646 | CORE_ADDR start |
647 | = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i)); | |
c906108c | 648 | |
3d263c1d | 649 | complaint (&symfile_complaints, _("block at %s out of order"), |
bb599908 | 650 | hex_string ((LONGEST) start)); |
c906108c SS |
651 | } |
652 | } | |
653 | } | |
c906108c SS |
654 | |
655 | return (blockvector); | |
656 | } | |
657 | \f | |
658 | /* Start recording information about source code that came from an | |
659 | included (or otherwise merged-in) source file with a different | |
4d663531 | 660 | name. NAME is the name of the file (cannot be NULL). */ |
c906108c SS |
661 | |
662 | void | |
4d663531 | 663 | start_subfile (const char *name) |
c906108c | 664 | { |
43f3e411 | 665 | const char *subfile_dirname; |
52f0bd74 | 666 | struct subfile *subfile; |
c906108c | 667 | |
43f3e411 DE |
668 | gdb_assert (buildsym_compunit != NULL); |
669 | ||
670 | subfile_dirname = buildsym_compunit->comp_dir; | |
c906108c | 671 | |
43f3e411 DE |
672 | /* See if this subfile is already registered. */ |
673 | ||
674 | for (subfile = buildsym_compunit->subfiles; subfile; subfile = subfile->next) | |
c906108c | 675 | { |
84ba0adf DJ |
676 | char *subfile_name; |
677 | ||
678 | /* If NAME is an absolute path, and this subfile is not, then | |
679 | attempt to create an absolute path to compare. */ | |
680 | if (IS_ABSOLUTE_PATH (name) | |
681 | && !IS_ABSOLUTE_PATH (subfile->name) | |
43f3e411 DE |
682 | && subfile_dirname != NULL) |
683 | subfile_name = concat (subfile_dirname, SLASH_STRING, | |
6eb7ee03 | 684 | subfile->name, (char *) NULL); |
84ba0adf DJ |
685 | else |
686 | subfile_name = subfile->name; | |
687 | ||
688 | if (FILENAME_CMP (subfile_name, name) == 0) | |
c906108c SS |
689 | { |
690 | current_subfile = subfile; | |
84ba0adf DJ |
691 | if (subfile_name != subfile->name) |
692 | xfree (subfile_name); | |
c906108c SS |
693 | return; |
694 | } | |
84ba0adf DJ |
695 | if (subfile_name != subfile->name) |
696 | xfree (subfile_name); | |
c906108c SS |
697 | } |
698 | ||
43f3e411 | 699 | /* This subfile is not known. Add an entry for it. */ |
c906108c SS |
700 | |
701 | subfile = (struct subfile *) xmalloc (sizeof (struct subfile)); | |
43f3e411 DE |
702 | memset (subfile, 0, sizeof (struct subfile)); |
703 | subfile->buildsym_compunit = buildsym_compunit; | |
704 | ||
705 | subfile->next = buildsym_compunit->subfiles; | |
706 | buildsym_compunit->subfiles = subfile; | |
707 | ||
c906108c SS |
708 | current_subfile = subfile; |
709 | ||
b74db436 | 710 | subfile->name = xstrdup (name); |
c906108c SS |
711 | |
712 | /* Initialize line-number recording for this subfile. */ | |
713 | subfile->line_vector = NULL; | |
714 | ||
715 | /* Default the source language to whatever can be deduced from the | |
716 | filename. If nothing can be deduced (such as for a C/C++ include | |
717 | file with a ".h" extension), then inherit whatever language the | |
718 | previous subfile had. This kludgery is necessary because there | |
719 | is no standard way in some object formats to record the source | |
720 | language. Also, when symtabs are allocated we try to deduce a | |
721 | language then as well, but it is too late for us to use that | |
722 | information while reading symbols, since symtabs aren't allocated | |
723 | until after all the symbols have been processed for a given | |
4a64f543 | 724 | source file. */ |
c906108c SS |
725 | |
726 | subfile->language = deduce_language_from_filename (subfile->name); | |
5aafa1cc PM |
727 | if (subfile->language == language_unknown |
728 | && subfile->next != NULL) | |
c906108c SS |
729 | { |
730 | subfile->language = subfile->next->language; | |
731 | } | |
732 | ||
25caa7a8 | 733 | /* If the filename of this subfile ends in .C, then change the |
c906108c | 734 | language of any pending subfiles from C to C++. We also accept |
25caa7a8 | 735 | any other C++ suffixes accepted by deduce_language_from_filename. */ |
c906108c SS |
736 | /* Likewise for f2c. */ |
737 | ||
738 | if (subfile->name) | |
739 | { | |
740 | struct subfile *s; | |
741 | enum language sublang = deduce_language_from_filename (subfile->name); | |
742 | ||
743 | if (sublang == language_cplus || sublang == language_fortran) | |
43f3e411 | 744 | for (s = buildsym_compunit->subfiles; s != NULL; s = s->next) |
c906108c SS |
745 | if (s->language == language_c) |
746 | s->language = sublang; | |
747 | } | |
748 | ||
749 | /* And patch up this file if necessary. */ | |
750 | if (subfile->language == language_c | |
751 | && subfile->next != NULL | |
752 | && (subfile->next->language == language_cplus | |
753 | || subfile->next->language == language_fortran)) | |
754 | { | |
755 | subfile->language = subfile->next->language; | |
756 | } | |
757 | } | |
758 | ||
43f3e411 DE |
759 | /* Start recording information about a primary source file (IOW, not an |
760 | included source file). | |
761 | COMP_DIR is the directory in which the compilation unit was compiled | |
762 | (or NULL if not known). */ | |
763 | ||
764 | static struct buildsym_compunit * | |
765 | start_buildsym_compunit (struct objfile *objfile, const char *comp_dir) | |
766 | { | |
767 | struct buildsym_compunit *bscu; | |
768 | ||
769 | bscu = (struct buildsym_compunit *) | |
770 | xmalloc (sizeof (struct buildsym_compunit)); | |
771 | memset (bscu, 0, sizeof (struct buildsym_compunit)); | |
772 | ||
773 | bscu->objfile = objfile; | |
774 | bscu->comp_dir = (comp_dir == NULL) ? NULL : xstrdup (comp_dir); | |
775 | ||
776 | /* Initialize the debug format string to NULL. We may supply it | |
777 | later via a call to record_debugformat. */ | |
778 | bscu->debugformat = NULL; | |
779 | ||
780 | /* Similarly for the producer. */ | |
781 | bscu->producer = NULL; | |
782 | ||
783 | return bscu; | |
784 | } | |
785 | ||
786 | /* Delete the buildsym compunit. */ | |
7bab9b58 DE |
787 | |
788 | static void | |
43f3e411 | 789 | free_buildsym_compunit (void) |
7bab9b58 DE |
790 | { |
791 | struct subfile *subfile, *nextsub; | |
792 | ||
43f3e411 DE |
793 | if (buildsym_compunit == NULL) |
794 | return; | |
795 | for (subfile = buildsym_compunit->subfiles; | |
796 | subfile != NULL; | |
797 | subfile = nextsub) | |
7bab9b58 DE |
798 | { |
799 | nextsub = subfile->next; | |
800 | xfree (subfile->name); | |
7bab9b58 DE |
801 | xfree (subfile->line_vector); |
802 | xfree (subfile); | |
803 | } | |
43f3e411 DE |
804 | xfree (buildsym_compunit->comp_dir); |
805 | xfree (buildsym_compunit); | |
806 | buildsym_compunit = NULL; | |
0ab9ce85 | 807 | current_subfile = NULL; |
7bab9b58 DE |
808 | } |
809 | ||
c906108c SS |
810 | /* For stabs readers, the first N_SO symbol is assumed to be the |
811 | source file name, and the subfile struct is initialized using that | |
812 | assumption. If another N_SO symbol is later seen, immediately | |
813 | following the first one, then the first one is assumed to be the | |
814 | directory name and the second one is really the source file name. | |
815 | ||
816 | So we have to patch up the subfile struct by moving the old name | |
817 | value to dirname and remembering the new name. Some sanity | |
818 | checking is performed to ensure that the state of the subfile | |
819 | struct is reasonable and that the old name we are assuming to be a | |
4a64f543 | 820 | directory name actually is (by checking for a trailing '/'). */ |
c906108c SS |
821 | |
822 | void | |
823 | patch_subfile_names (struct subfile *subfile, char *name) | |
824 | { | |
43f3e411 DE |
825 | if (subfile != NULL |
826 | && buildsym_compunit->comp_dir == NULL | |
827 | && subfile->name != NULL | |
0ba1096a | 828 | && IS_DIR_SEPARATOR (subfile->name[strlen (subfile->name) - 1])) |
c906108c | 829 | { |
43f3e411 | 830 | buildsym_compunit->comp_dir = subfile->name; |
1b36a34b | 831 | subfile->name = xstrdup (name); |
46212e0b | 832 | set_last_source_file (name); |
c906108c SS |
833 | |
834 | /* Default the source language to whatever can be deduced from | |
835 | the filename. If nothing can be deduced (such as for a C/C++ | |
836 | include file with a ".h" extension), then inherit whatever | |
837 | language the previous subfile had. This kludgery is | |
838 | necessary because there is no standard way in some object | |
839 | formats to record the source language. Also, when symtabs | |
840 | are allocated we try to deduce a language then as well, but | |
841 | it is too late for us to use that information while reading | |
842 | symbols, since symtabs aren't allocated until after all the | |
4a64f543 | 843 | symbols have been processed for a given source file. */ |
c906108c SS |
844 | |
845 | subfile->language = deduce_language_from_filename (subfile->name); | |
5aafa1cc PM |
846 | if (subfile->language == language_unknown |
847 | && subfile->next != NULL) | |
c906108c SS |
848 | { |
849 | subfile->language = subfile->next->language; | |
850 | } | |
851 | } | |
852 | } | |
853 | \f | |
854 | /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for | |
855 | switching source files (different subfiles, as we call them) within | |
856 | one object file, but using a stack rather than in an arbitrary | |
857 | order. */ | |
858 | ||
859 | void | |
860 | push_subfile (void) | |
861 | { | |
52f0bd74 | 862 | struct subfile_stack *tem |
cc59ec59 | 863 | = (struct subfile_stack *) xmalloc (sizeof (struct subfile_stack)); |
c906108c SS |
864 | |
865 | tem->next = subfile_stack; | |
866 | subfile_stack = tem; | |
867 | if (current_subfile == NULL || current_subfile->name == NULL) | |
868 | { | |
4a64f543 MS |
869 | internal_error (__FILE__, __LINE__, |
870 | _("failed internal consistency check")); | |
c906108c SS |
871 | } |
872 | tem->name = current_subfile->name; | |
873 | } | |
874 | ||
875 | char * | |
876 | pop_subfile (void) | |
877 | { | |
52f0bd74 AC |
878 | char *name; |
879 | struct subfile_stack *link = subfile_stack; | |
c906108c SS |
880 | |
881 | if (link == NULL) | |
882 | { | |
3e43a32a MS |
883 | internal_error (__FILE__, __LINE__, |
884 | _("failed internal consistency check")); | |
c906108c SS |
885 | } |
886 | name = link->name; | |
887 | subfile_stack = link->next; | |
b8c9b27d | 888 | xfree ((void *) link); |
c906108c SS |
889 | return (name); |
890 | } | |
891 | \f | |
892 | /* Add a linetable entry for line number LINE and address PC to the | |
893 | line vector for SUBFILE. */ | |
894 | ||
895 | void | |
aa1ee363 | 896 | record_line (struct subfile *subfile, int line, CORE_ADDR pc) |
c906108c SS |
897 | { |
898 | struct linetable_entry *e; | |
c906108c | 899 | |
cc59ec59 | 900 | /* Ignore the dummy line number in libg.o */ |
c906108c SS |
901 | if (line == 0xffff) |
902 | { | |
903 | return; | |
904 | } | |
905 | ||
906 | /* Make sure line vector exists and is big enough. */ | |
907 | if (!subfile->line_vector) | |
908 | { | |
909 | subfile->line_vector_length = INITIAL_LINE_VECTOR_LENGTH; | |
910 | subfile->line_vector = (struct linetable *) | |
911 | xmalloc (sizeof (struct linetable) | |
c5aa993b | 912 | + subfile->line_vector_length * sizeof (struct linetable_entry)); |
c906108c SS |
913 | subfile->line_vector->nitems = 0; |
914 | have_line_numbers = 1; | |
915 | } | |
916 | ||
917 | if (subfile->line_vector->nitems + 1 >= subfile->line_vector_length) | |
918 | { | |
919 | subfile->line_vector_length *= 2; | |
920 | subfile->line_vector = (struct linetable *) | |
921 | xrealloc ((char *) subfile->line_vector, | |
922 | (sizeof (struct linetable) | |
923 | + (subfile->line_vector_length | |
924 | * sizeof (struct linetable_entry)))); | |
925 | } | |
926 | ||
607ae575 DJ |
927 | /* Normally, we treat lines as unsorted. But the end of sequence |
928 | marker is special. We sort line markers at the same PC by line | |
929 | number, so end of sequence markers (which have line == 0) appear | |
930 | first. This is right if the marker ends the previous function, | |
931 | and there is no padding before the next function. But it is | |
932 | wrong if the previous line was empty and we are now marking a | |
933 | switch to a different subfile. We must leave the end of sequence | |
934 | marker at the end of this group of lines, not sort the empty line | |
935 | to after the marker. The easiest way to accomplish this is to | |
936 | delete any empty lines from our table, if they are followed by | |
937 | end of sequence markers. All we lose is the ability to set | |
938 | breakpoints at some lines which contain no instructions | |
939 | anyway. */ | |
940 | if (line == 0 && subfile->line_vector->nitems > 0) | |
941 | { | |
942 | e = subfile->line_vector->item + subfile->line_vector->nitems - 1; | |
943 | while (subfile->line_vector->nitems > 0 && e->pc == pc) | |
944 | { | |
945 | e--; | |
946 | subfile->line_vector->nitems--; | |
947 | } | |
948 | } | |
949 | ||
c906108c SS |
950 | e = subfile->line_vector->item + subfile->line_vector->nitems++; |
951 | e->line = line; | |
607ae575 | 952 | e->pc = pc; |
c906108c SS |
953 | } |
954 | ||
955 | /* Needed in order to sort line tables from IBM xcoff files. Sigh! */ | |
956 | ||
957 | static int | |
958 | compare_line_numbers (const void *ln1p, const void *ln2p) | |
959 | { | |
960 | struct linetable_entry *ln1 = (struct linetable_entry *) ln1p; | |
961 | struct linetable_entry *ln2 = (struct linetable_entry *) ln2p; | |
962 | ||
963 | /* Note: this code does not assume that CORE_ADDRs can fit in ints. | |
964 | Please keep it that way. */ | |
965 | if (ln1->pc < ln2->pc) | |
966 | return -1; | |
967 | ||
968 | if (ln1->pc > ln2->pc) | |
969 | return 1; | |
970 | ||
971 | /* If pc equal, sort by line. I'm not sure whether this is optimum | |
972 | behavior (see comment at struct linetable in symtab.h). */ | |
973 | return ln1->line - ln2->line; | |
974 | } | |
975 | \f | |
43f3e411 DE |
976 | /* See buildsym.h. */ |
977 | ||
978 | struct compunit_symtab * | |
979 | buildsym_compunit_symtab (void) | |
980 | { | |
981 | gdb_assert (buildsym_compunit != NULL); | |
982 | ||
983 | return buildsym_compunit->compunit_symtab; | |
984 | } | |
985 | ||
986 | /* See buildsym.h. */ | |
fc474241 DE |
987 | |
988 | struct macro_table * | |
43f3e411 | 989 | get_macro_table (void) |
fc474241 | 990 | { |
43f3e411 DE |
991 | struct objfile *objfile; |
992 | ||
993 | gdb_assert (buildsym_compunit != NULL); | |
994 | ||
995 | objfile = buildsym_compunit->objfile; | |
4d663531 | 996 | |
fc474241 | 997 | if (! pending_macros) |
43f3e411 DE |
998 | { |
999 | pending_macros = new_macro_table (&objfile->per_bfd->storage_obstack, | |
1000 | objfile->per_bfd->macro_cache, | |
1001 | buildsym_compunit->compunit_symtab); | |
1002 | } | |
1003 | ||
fc474241 DE |
1004 | return pending_macros; |
1005 | } | |
1006 | \f | |
0ab9ce85 DE |
1007 | /* Init state to prepare for building a symtab. |
1008 | Note: This can't be done in buildsym_init because dbxread.c and xcoffread.c | |
1009 | can call start_symtab+end_symtab multiple times after one call to | |
1010 | buildsym_init. */ | |
1011 | ||
1012 | static void | |
1013 | prepare_for_building (const char *name, CORE_ADDR start_addr) | |
1014 | { | |
1015 | set_last_source_file (name); | |
1016 | last_source_start_addr = start_addr; | |
1017 | ||
1018 | local_symbols = NULL; | |
22cee43f | 1019 | local_using_directives = NULL; |
0ab9ce85 DE |
1020 | within_function = 0; |
1021 | have_line_numbers = 0; | |
1022 | ||
1023 | context_stack_depth = 0; | |
1024 | ||
1025 | /* These should have been reset either by successful completion of building | |
1026 | a symtab, or by the really_free_pendings cleanup. */ | |
1027 | gdb_assert (file_symbols == NULL); | |
1028 | gdb_assert (global_symbols == NULL); | |
22cee43f | 1029 | gdb_assert (global_using_directives == NULL); |
0ab9ce85 DE |
1030 | gdb_assert (pending_macros == NULL); |
1031 | gdb_assert (pending_addrmap == NULL); | |
1032 | gdb_assert (current_subfile == NULL); | |
1033 | } | |
1034 | ||
4d663531 | 1035 | /* Start a new symtab for a new source file in OBJFILE. Called, for example, |
c906108c SS |
1036 | when a stabs symbol of type N_SO is seen, or when a DWARF |
1037 | TAG_compile_unit DIE is seen. It indicates the start of data for | |
0b0287a1 DE |
1038 | one original source file. |
1039 | ||
4d663531 | 1040 | NAME is the name of the file (cannot be NULL). COMP_DIR is the directory in |
0b0287a1 DE |
1041 | which the file was compiled (or NULL if not known). START_ADDR is the |
1042 | lowest address of objects in the file (or 0 if not known). */ | |
c906108c | 1043 | |
43f3e411 | 1044 | struct compunit_symtab * |
4d663531 DE |
1045 | start_symtab (struct objfile *objfile, const char *name, const char *comp_dir, |
1046 | CORE_ADDR start_addr) | |
c906108c | 1047 | { |
0ab9ce85 | 1048 | prepare_for_building (name, start_addr); |
43f3e411 DE |
1049 | |
1050 | buildsym_compunit = start_buildsym_compunit (objfile, comp_dir); | |
1051 | ||
0ab9ce85 | 1052 | /* Allocate the compunit symtab now. The caller needs it to allocate |
43f3e411 DE |
1053 | non-primary symtabs. It is also needed by get_macro_table. */ |
1054 | buildsym_compunit->compunit_symtab = allocate_compunit_symtab (objfile, | |
1055 | name); | |
1056 | ||
1057 | /* Build the subfile for NAME (the main source file) so that we can record | |
1058 | a pointer to it for later. | |
1059 | IMPORTANT: Do not allocate a struct symtab for NAME here. | |
1060 | It can happen that the debug info provides a different path to NAME than | |
1061 | DIRNAME,NAME. We cope with this in watch_main_source_file_lossage but | |
1062 | that only works if the main_subfile doesn't have a symtab yet. */ | |
4d663531 | 1063 | start_subfile (name); |
7bab9b58 DE |
1064 | /* Save this so that we don't have to go looking for it at the end |
1065 | of the subfiles list. */ | |
43f3e411 DE |
1066 | buildsym_compunit->main_subfile = current_subfile; |
1067 | ||
43f3e411 | 1068 | return buildsym_compunit->compunit_symtab; |
6d30eef8 DE |
1069 | } |
1070 | ||
1071 | /* Restart compilation for a symtab. | |
0ab9ce85 DE |
1072 | CUST is the result of end_expandable_symtab. |
1073 | NAME, START_ADDR are the source file we are resuming with. | |
1074 | ||
6d30eef8 | 1075 | This is used when a symtab is built from multiple sources. |
0ab9ce85 DE |
1076 | The symtab is first built with start_symtab/end_expandable_symtab |
1077 | and then for each additional piece call restart_symtab/augment_*_symtab. | |
1078 | Note: At the moment there is only augment_type_symtab. */ | |
6d30eef8 DE |
1079 | |
1080 | void | |
0ab9ce85 DE |
1081 | restart_symtab (struct compunit_symtab *cust, |
1082 | const char *name, CORE_ADDR start_addr) | |
6d30eef8 | 1083 | { |
0ab9ce85 | 1084 | prepare_for_building (name, start_addr); |
c906108c | 1085 | |
0ab9ce85 DE |
1086 | buildsym_compunit = start_buildsym_compunit (COMPUNIT_OBJFILE (cust), |
1087 | COMPUNIT_DIRNAME (cust)); | |
1088 | buildsym_compunit->compunit_symtab = cust; | |
c906108c SS |
1089 | } |
1090 | ||
4a64f543 MS |
1091 | /* Subroutine of end_symtab to simplify it. Look for a subfile that |
1092 | matches the main source file's basename. If there is only one, and | |
1093 | if the main source file doesn't have any symbol or line number | |
1094 | information, then copy this file's symtab and line_vector to the | |
1095 | main source file's subfile and discard the other subfile. This can | |
1096 | happen because of a compiler bug or from the user playing games | |
1097 | with #line or from things like a distributed build system that | |
43f3e411 DE |
1098 | manipulates the debug info. This can also happen from an innocent |
1099 | symlink in the paths, we don't canonicalize paths here. */ | |
4584e32e DE |
1100 | |
1101 | static void | |
1102 | watch_main_source_file_lossage (void) | |
1103 | { | |
43f3e411 | 1104 | struct subfile *mainsub, *subfile; |
4584e32e | 1105 | |
43f3e411 | 1106 | /* We have to watch for buildsym_compunit == NULL here. It's a quirk of |
7bab9b58 | 1107 | end_symtab, it can return NULL so there may not be a main subfile. */ |
43f3e411 | 1108 | if (buildsym_compunit == NULL) |
7bab9b58 | 1109 | return; |
4584e32e | 1110 | |
43f3e411 DE |
1111 | /* Get the main source file. */ |
1112 | mainsub = buildsym_compunit->main_subfile; | |
1113 | ||
4a64f543 | 1114 | /* If the main source file doesn't have any line number or symbol |
7bab9b58 | 1115 | info, look for an alias in another subfile. */ |
4584e32e | 1116 | |
43f3e411 DE |
1117 | if (mainsub->line_vector == NULL |
1118 | && mainsub->symtab == NULL) | |
4584e32e | 1119 | { |
43f3e411 | 1120 | const char *mainbase = lbasename (mainsub->name); |
4584e32e DE |
1121 | int nr_matches = 0; |
1122 | struct subfile *prevsub; | |
1123 | struct subfile *mainsub_alias = NULL; | |
1124 | struct subfile *prev_mainsub_alias = NULL; | |
1125 | ||
1126 | prevsub = NULL; | |
43f3e411 DE |
1127 | for (subfile = buildsym_compunit->subfiles; |
1128 | subfile != NULL; | |
4584e32e DE |
1129 | subfile = subfile->next) |
1130 | { | |
43f3e411 DE |
1131 | if (subfile == mainsub) |
1132 | continue; | |
0ba1096a | 1133 | if (filename_cmp (lbasename (subfile->name), mainbase) == 0) |
4584e32e DE |
1134 | { |
1135 | ++nr_matches; | |
1136 | mainsub_alias = subfile; | |
1137 | prev_mainsub_alias = prevsub; | |
1138 | } | |
1139 | prevsub = subfile; | |
1140 | } | |
1141 | ||
1142 | if (nr_matches == 1) | |
1143 | { | |
43f3e411 | 1144 | gdb_assert (mainsub_alias != NULL && mainsub_alias != mainsub); |
4584e32e DE |
1145 | |
1146 | /* Found a match for the main source file. | |
1147 | Copy its line_vector and symtab to the main subfile | |
1148 | and then discard it. */ | |
1149 | ||
43f3e411 DE |
1150 | mainsub->line_vector = mainsub_alias->line_vector; |
1151 | mainsub->line_vector_length = mainsub_alias->line_vector_length; | |
1152 | mainsub->symtab = mainsub_alias->symtab; | |
4584e32e DE |
1153 | |
1154 | if (prev_mainsub_alias == NULL) | |
43f3e411 | 1155 | buildsym_compunit->subfiles = mainsub_alias->next; |
4584e32e DE |
1156 | else |
1157 | prev_mainsub_alias->next = mainsub_alias->next; | |
98387a29 | 1158 | xfree (mainsub_alias->name); |
4584e32e DE |
1159 | xfree (mainsub_alias); |
1160 | } | |
1161 | } | |
1162 | } | |
1163 | ||
98cc87bd | 1164 | /* Helper function for qsort. Parameters are `struct block *' pointers, |
07e7f39f JK |
1165 | function sorts them in descending order by their BLOCK_START. */ |
1166 | ||
1167 | static int | |
1168 | block_compar (const void *ap, const void *bp) | |
1169 | { | |
1170 | const struct block *a = *(const struct block **) ap; | |
1171 | const struct block *b = *(const struct block **) bp; | |
1172 | ||
1173 | return ((BLOCK_START (b) > BLOCK_START (a)) | |
1174 | - (BLOCK_START (b) < BLOCK_START (a))); | |
1175 | } | |
1176 | ||
0ab9ce85 DE |
1177 | /* Reset state after a successful building of a symtab. |
1178 | This exists because dbxread.c and xcoffread.c can call | |
1179 | start_symtab+end_symtab multiple times after one call to buildsym_init, | |
1180 | and before the really_free_pendings cleanup is called. | |
1181 | We keep the free_pendings list around for dbx/xcoff sake. */ | |
6d30eef8 DE |
1182 | |
1183 | static void | |
1184 | reset_symtab_globals (void) | |
1185 | { | |
46212e0b | 1186 | set_last_source_file (NULL); |
0ab9ce85 DE |
1187 | |
1188 | local_symbols = NULL; | |
22cee43f | 1189 | local_using_directives = NULL; |
0ab9ce85 DE |
1190 | file_symbols = NULL; |
1191 | global_symbols = NULL; | |
22cee43f | 1192 | global_using_directives = NULL; |
0ab9ce85 DE |
1193 | |
1194 | /* We don't free pending_macros here because if the symtab was successfully | |
1195 | built then ownership was transferred to the symtab. */ | |
6d30eef8 | 1196 | pending_macros = NULL; |
0ab9ce85 | 1197 | |
6d30eef8 | 1198 | if (pending_addrmap) |
0ab9ce85 DE |
1199 | obstack_free (&pending_addrmap_obstack, NULL); |
1200 | pending_addrmap = NULL; | |
1201 | ||
1202 | free_buildsym_compunit (); | |
6d30eef8 DE |
1203 | } |
1204 | ||
4359dff1 JK |
1205 | /* Implementation of the first part of end_symtab. It allows modifying |
1206 | STATIC_BLOCK before it gets finalized by end_symtab_from_static_block. | |
1207 | If the returned value is NULL there is no blockvector created for | |
1208 | this symtab (you still must call end_symtab_from_static_block). | |
c906108c | 1209 | |
4359dff1 JK |
1210 | END_ADDR is the same as for end_symtab: the address of the end of the |
1211 | file's text. | |
c906108c | 1212 | |
4359dff1 | 1213 | If EXPANDABLE is non-zero the STATIC_BLOCK dictionary is made |
36586728 TT |
1214 | expandable. |
1215 | ||
1216 | If REQUIRED is non-zero, then a symtab is created even if it does | |
1217 | not contain any symbols. */ | |
6d30eef8 | 1218 | |
4359dff1 | 1219 | struct block * |
4d663531 | 1220 | end_symtab_get_static_block (CORE_ADDR end_addr, int expandable, int required) |
c906108c | 1221 | { |
43f3e411 | 1222 | struct objfile *objfile = buildsym_compunit->objfile; |
4d663531 | 1223 | |
c906108c SS |
1224 | /* Finish the lexical context of the last function in the file; pop |
1225 | the context stack. */ | |
1226 | ||
1227 | if (context_stack_depth > 0) | |
1228 | { | |
4359dff1 JK |
1229 | struct context_stack *cstk = pop_context (); |
1230 | ||
c906108c SS |
1231 | /* Make a block for the local symbols within. */ |
1232 | finish_block (cstk->name, &local_symbols, cstk->old_blocks, | |
4d663531 | 1233 | cstk->start_addr, end_addr); |
c906108c SS |
1234 | |
1235 | if (context_stack_depth > 0) | |
1236 | { | |
1237 | /* This is said to happen with SCO. The old coffread.c | |
1238 | code simply emptied the context stack, so we do the | |
1239 | same. FIXME: Find out why it is happening. This is not | |
1240 | believed to happen in most cases (even for coffread.c); | |
1241 | it used to be an abort(). */ | |
23136709 | 1242 | complaint (&symfile_complaints, |
3d263c1d | 1243 | _("Context stack not empty in end_symtab")); |
c906108c SS |
1244 | context_stack_depth = 0; |
1245 | } | |
1246 | } | |
1247 | ||
1248 | /* Reordered executables may have out of order pending blocks; if | |
1249 | OBJF_REORDERED is true, then sort the pending blocks. */ | |
6d30eef8 | 1250 | |
c906108c SS |
1251 | if ((objfile->flags & OBJF_REORDERED) && pending_blocks) |
1252 | { | |
07e7f39f JK |
1253 | unsigned count = 0; |
1254 | struct pending_block *pb; | |
1255 | struct block **barray, **bp; | |
1256 | struct cleanup *back_to; | |
c906108c | 1257 | |
07e7f39f JK |
1258 | for (pb = pending_blocks; pb != NULL; pb = pb->next) |
1259 | count++; | |
c906108c | 1260 | |
07e7f39f JK |
1261 | barray = xmalloc (sizeof (*barray) * count); |
1262 | back_to = make_cleanup (xfree, barray); | |
c906108c | 1263 | |
07e7f39f JK |
1264 | bp = barray; |
1265 | for (pb = pending_blocks; pb != NULL; pb = pb->next) | |
1266 | *bp++ = pb->block; | |
1267 | ||
1268 | qsort (barray, count, sizeof (*barray), block_compar); | |
1269 | ||
1270 | bp = barray; | |
1271 | for (pb = pending_blocks; pb != NULL; pb = pb->next) | |
1272 | pb->block = *bp++; | |
1273 | ||
1274 | do_cleanups (back_to); | |
c906108c SS |
1275 | } |
1276 | ||
1277 | /* Cleanup any undefined types that have been left hanging around | |
1278 | (this needs to be done before the finish_blocks so that | |
1279 | file_symbols is still good). | |
c5aa993b | 1280 | |
0a0edcd5 | 1281 | Both cleanup_undefined_stabs_types and finish_global_stabs are stabs |
c906108c SS |
1282 | specific, but harmless for other symbol readers, since on gdb |
1283 | startup or when finished reading stabs, the state is set so these | |
1284 | are no-ops. FIXME: Is this handled right in case of QUIT? Can | |
1285 | we make this cleaner? */ | |
1286 | ||
0a0edcd5 | 1287 | cleanup_undefined_stabs_types (objfile); |
c906108c SS |
1288 | finish_global_stabs (objfile); |
1289 | ||
36586728 TT |
1290 | if (!required |
1291 | && pending_blocks == NULL | |
c906108c SS |
1292 | && file_symbols == NULL |
1293 | && global_symbols == NULL | |
99d9066e | 1294 | && have_line_numbers == 0 |
22cee43f PMR |
1295 | && pending_macros == NULL |
1296 | && global_using_directives == NULL) | |
c906108c | 1297 | { |
4359dff1 JK |
1298 | /* Ignore symtabs that have no functions with real debugging info. */ |
1299 | return NULL; | |
1300 | } | |
1301 | else | |
1302 | { | |
1303 | /* Define the STATIC_BLOCK. */ | |
1304 | return finish_block_internal (NULL, &file_symbols, NULL, | |
4d663531 | 1305 | last_source_start_addr, end_addr, |
4359dff1 JK |
1306 | 0, expandable); |
1307 | } | |
1308 | } | |
1309 | ||
7bab9b58 DE |
1310 | /* Subroutine of end_symtab_from_static_block to simplify it. |
1311 | Handle the "have blockvector" case. | |
1312 | See end_symtab_from_static_block for a description of the arguments. */ | |
1313 | ||
43f3e411 | 1314 | static struct compunit_symtab * |
7bab9b58 | 1315 | end_symtab_with_blockvector (struct block *static_block, |
4d663531 | 1316 | int section, int expandable) |
4359dff1 | 1317 | { |
43f3e411 DE |
1318 | struct objfile *objfile = buildsym_compunit->objfile; |
1319 | struct compunit_symtab *cu = buildsym_compunit->compunit_symtab; | |
7bab9b58 | 1320 | struct symtab *symtab; |
4359dff1 JK |
1321 | struct blockvector *blockvector; |
1322 | struct subfile *subfile; | |
7bab9b58 | 1323 | CORE_ADDR end_addr; |
4359dff1 | 1324 | |
7bab9b58 | 1325 | gdb_assert (static_block != NULL); |
43f3e411 DE |
1326 | gdb_assert (buildsym_compunit != NULL); |
1327 | gdb_assert (buildsym_compunit->subfiles != NULL); | |
7bab9b58 DE |
1328 | |
1329 | end_addr = BLOCK_END (static_block); | |
1330 | ||
1331 | /* Create the GLOBAL_BLOCK and build the blockvector. */ | |
1332 | finish_block_internal (NULL, &global_symbols, NULL, | |
4d663531 | 1333 | last_source_start_addr, end_addr, |
7bab9b58 | 1334 | 1, expandable); |
43f3e411 | 1335 | blockvector = make_blockvector (); |
c906108c | 1336 | |
f56ce883 DE |
1337 | /* Read the line table if it has to be read separately. |
1338 | This is only used by xcoffread.c. */ | |
c295b2e5 | 1339 | if (objfile->sf->sym_read_linetable != NULL) |
f56ce883 | 1340 | objfile->sf->sym_read_linetable (objfile); |
c906108c | 1341 | |
4584e32e DE |
1342 | /* Handle the case where the debug info specifies a different path |
1343 | for the main source file. It can cause us to lose track of its | |
1344 | line number information. */ | |
1345 | watch_main_source_file_lossage (); | |
1346 | ||
43f3e411 DE |
1347 | /* Now create the symtab objects proper, if not already done, |
1348 | one for each subfile. */ | |
c906108c | 1349 | |
43f3e411 DE |
1350 | for (subfile = buildsym_compunit->subfiles; |
1351 | subfile != NULL; | |
1352 | subfile = subfile->next) | |
c906108c SS |
1353 | { |
1354 | int linetablesize = 0; | |
c906108c | 1355 | |
7bab9b58 | 1356 | if (subfile->line_vector) |
c906108c | 1357 | { |
7bab9b58 DE |
1358 | linetablesize = sizeof (struct linetable) + |
1359 | subfile->line_vector->nitems * sizeof (struct linetable_entry); | |
1360 | ||
1361 | /* Like the pending blocks, the line table may be | |
1362 | scrambled in reordered executables. Sort it if | |
1363 | OBJF_REORDERED is true. */ | |
1364 | if (objfile->flags & OBJF_REORDERED) | |
1365 | qsort (subfile->line_vector->item, | |
1366 | subfile->line_vector->nitems, | |
1367 | sizeof (struct linetable_entry), compare_line_numbers); | |
1368 | } | |
9182c5bc | 1369 | |
7bab9b58 DE |
1370 | /* Allocate a symbol table if necessary. */ |
1371 | if (subfile->symtab == NULL) | |
43f3e411 | 1372 | subfile->symtab = allocate_symtab (cu, subfile->name); |
7bab9b58 | 1373 | symtab = subfile->symtab; |
9182c5bc | 1374 | |
7bab9b58 | 1375 | /* Fill in its components. */ |
43f3e411 | 1376 | |
7bab9b58 DE |
1377 | if (subfile->line_vector) |
1378 | { | |
1379 | /* Reallocate the line table on the symbol obstack. */ | |
8435453b | 1380 | SYMTAB_LINETABLE (symtab) = (struct linetable *) |
7bab9b58 | 1381 | obstack_alloc (&objfile->objfile_obstack, linetablesize); |
8435453b DE |
1382 | memcpy (SYMTAB_LINETABLE (symtab), subfile->line_vector, |
1383 | linetablesize); | |
c906108c | 1384 | } |
24be086d | 1385 | else |
c906108c | 1386 | { |
8435453b | 1387 | SYMTAB_LINETABLE (symtab) = NULL; |
c906108c | 1388 | } |
c906108c | 1389 | |
7bab9b58 DE |
1390 | /* Use whatever language we have been using for this |
1391 | subfile, not the one that was deduced in allocate_symtab | |
1392 | from the filename. We already did our own deducing when | |
1393 | we created the subfile, and we may have altered our | |
1394 | opinion of what language it is from things we found in | |
1395 | the symbols. */ | |
1396 | symtab->language = subfile->language; | |
43f3e411 | 1397 | } |
c906108c | 1398 | |
43f3e411 DE |
1399 | /* Make sure the symtab of main_subfile is the first in its list. */ |
1400 | { | |
1401 | struct symtab *main_symtab, *prev_symtab; | |
1402 | ||
1403 | main_symtab = buildsym_compunit->main_subfile->symtab; | |
1404 | prev_symtab = NULL; | |
1405 | ALL_COMPUNIT_FILETABS (cu, symtab) | |
1406 | { | |
1407 | if (symtab == main_symtab) | |
1408 | { | |
1409 | if (prev_symtab != NULL) | |
1410 | { | |
1411 | prev_symtab->next = main_symtab->next; | |
1412 | main_symtab->next = COMPUNIT_FILETABS (cu); | |
1413 | COMPUNIT_FILETABS (cu) = main_symtab; | |
1414 | } | |
1415 | break; | |
1416 | } | |
1417 | prev_symtab = symtab; | |
1418 | } | |
1419 | gdb_assert (main_symtab == COMPUNIT_FILETABS (cu)); | |
1420 | } | |
84a146c9 | 1421 | |
0ab9ce85 | 1422 | /* Fill out the compunit symtab. */ |
84a146c9 | 1423 | |
43f3e411 DE |
1424 | if (buildsym_compunit->comp_dir != NULL) |
1425 | { | |
1426 | /* Reallocate the dirname on the symbol obstack. */ | |
1427 | COMPUNIT_DIRNAME (cu) | |
1428 | = obstack_copy0 (&objfile->objfile_obstack, | |
1429 | buildsym_compunit->comp_dir, | |
1430 | strlen (buildsym_compunit->comp_dir)); | |
c906108c SS |
1431 | } |
1432 | ||
43f3e411 DE |
1433 | /* Save the debug format string (if any) in the symtab. */ |
1434 | COMPUNIT_DEBUGFORMAT (cu) = buildsym_compunit->debugformat; | |
1435 | ||
1436 | /* Similarly for the producer. */ | |
1437 | COMPUNIT_PRODUCER (cu) = buildsym_compunit->producer; | |
1438 | ||
1439 | COMPUNIT_BLOCKVECTOR (cu) = blockvector; | |
7bab9b58 | 1440 | { |
43f3e411 | 1441 | struct block *b = BLOCKVECTOR_BLOCK (blockvector, GLOBAL_BLOCK); |
cb1df416 | 1442 | |
43f3e411 | 1443 | set_block_compunit_symtab (b, cu); |
7bab9b58 | 1444 | } |
cb1df416 | 1445 | |
43f3e411 DE |
1446 | COMPUNIT_BLOCK_LINE_SECTION (cu) = section; |
1447 | ||
1448 | COMPUNIT_MACRO_TABLE (cu) = pending_macros; | |
1449 | ||
7bab9b58 DE |
1450 | /* Default any symbols without a specified symtab to the primary symtab. */ |
1451 | { | |
1452 | int block_i; | |
1453 | ||
43f3e411 DE |
1454 | /* The main source file's symtab. */ |
1455 | symtab = COMPUNIT_FILETABS (cu); | |
1456 | ||
7bab9b58 DE |
1457 | for (block_i = 0; block_i < BLOCKVECTOR_NBLOCKS (blockvector); block_i++) |
1458 | { | |
1459 | struct block *block = BLOCKVECTOR_BLOCK (blockvector, block_i); | |
1460 | struct symbol *sym; | |
1461 | struct dict_iterator iter; | |
1462 | ||
1463 | /* Inlined functions may have symbols not in the global or | |
1464 | static symbol lists. */ | |
1465 | if (BLOCK_FUNCTION (block) != NULL) | |
08be3fe3 DE |
1466 | if (symbol_symtab (BLOCK_FUNCTION (block)) == NULL) |
1467 | symbol_set_symtab (BLOCK_FUNCTION (block), symtab); | |
7bab9b58 DE |
1468 | |
1469 | /* Note that we only want to fix up symbols from the local | |
1470 | blocks, not blocks coming from included symtabs. That is why | |
1471 | we use ALL_DICT_SYMBOLS here and not ALL_BLOCK_SYMBOLS. */ | |
1472 | ALL_DICT_SYMBOLS (BLOCK_DICT (block), iter, sym) | |
08be3fe3 DE |
1473 | if (symbol_symtab (sym) == NULL) |
1474 | symbol_set_symtab (sym, symtab); | |
7bab9b58 DE |
1475 | } |
1476 | } | |
edb3359d | 1477 | |
43f3e411 | 1478 | add_compunit_symtab_to_objfile (cu); |
43f3e411 DE |
1479 | |
1480 | return cu; | |
7bab9b58 DE |
1481 | } |
1482 | ||
1483 | /* Implementation of the second part of end_symtab. Pass STATIC_BLOCK | |
1484 | as value returned by end_symtab_get_static_block. | |
1485 | ||
1486 | SECTION is the same as for end_symtab: the section number | |
1487 | (in objfile->section_offsets) of the blockvector and linetable. | |
1488 | ||
1489 | If EXPANDABLE is non-zero the GLOBAL_BLOCK dictionary is made | |
1490 | expandable. */ | |
1491 | ||
43f3e411 | 1492 | struct compunit_symtab * |
7bab9b58 | 1493 | end_symtab_from_static_block (struct block *static_block, |
4d663531 | 1494 | int section, int expandable) |
7bab9b58 | 1495 | { |
43f3e411 | 1496 | struct compunit_symtab *cu; |
7bab9b58 DE |
1497 | |
1498 | if (static_block == NULL) | |
1499 | { | |
0ab9ce85 DE |
1500 | /* Handle the "no blockvector" case. |
1501 | When this happens there is nothing to record, so there's nothing | |
1502 | to do: memory will be freed up later. | |
1503 | ||
1504 | Note: We won't be adding a compunit to the objfile's list of | |
1505 | compunits, so there's nothing to unchain. However, since each symtab | |
1506 | is added to the objfile's obstack we can't free that space. | |
1507 | We could do better, but this is believed to be a sufficiently rare | |
1508 | event. */ | |
43f3e411 | 1509 | cu = NULL; |
7bab9b58 DE |
1510 | } |
1511 | else | |
43f3e411 | 1512 | cu = end_symtab_with_blockvector (static_block, section, expandable); |
cb1df416 | 1513 | |
6d30eef8 DE |
1514 | reset_symtab_globals (); |
1515 | ||
43f3e411 | 1516 | return cu; |
6d30eef8 DE |
1517 | } |
1518 | ||
4359dff1 JK |
1519 | /* Finish the symbol definitions for one main source file, close off |
1520 | all the lexical contexts for that file (creating struct block's for | |
1521 | them), then make the struct symtab for that file and put it in the | |
1522 | list of all such. | |
1523 | ||
1524 | END_ADDR is the address of the end of the file's text. SECTION is | |
1525 | the section number (in objfile->section_offsets) of the blockvector | |
1526 | and linetable. | |
1527 | ||
1528 | Note that it is possible for end_symtab() to return NULL. In | |
1529 | particular, for the DWARF case at least, it will return NULL when | |
1530 | it finds a compilation unit that has exactly one DIE, a | |
1531 | TAG_compile_unit DIE. This can happen when we link in an object | |
1532 | file that was compiled from an empty source file. Returning NULL | |
1533 | is probably not the correct thing to do, because then gdb will | |
1534 | never know about this empty file (FIXME). | |
1535 | ||
1536 | If you need to modify STATIC_BLOCK before it is finalized you should | |
1537 | call end_symtab_get_static_block and end_symtab_from_static_block | |
1538 | yourself. */ | |
6d30eef8 | 1539 | |
43f3e411 | 1540 | struct compunit_symtab * |
4d663531 | 1541 | end_symtab (CORE_ADDR end_addr, int section) |
6d30eef8 | 1542 | { |
4359dff1 JK |
1543 | struct block *static_block; |
1544 | ||
4d663531 DE |
1545 | static_block = end_symtab_get_static_block (end_addr, 0, 0); |
1546 | return end_symtab_from_static_block (static_block, section, 0); | |
6d30eef8 DE |
1547 | } |
1548 | ||
4359dff1 | 1549 | /* Same as end_symtab except create a symtab that can be later added to. */ |
6d30eef8 | 1550 | |
43f3e411 | 1551 | struct compunit_symtab * |
4d663531 | 1552 | end_expandable_symtab (CORE_ADDR end_addr, int section) |
6d30eef8 | 1553 | { |
4359dff1 JK |
1554 | struct block *static_block; |
1555 | ||
4d663531 DE |
1556 | static_block = end_symtab_get_static_block (end_addr, 1, 0); |
1557 | return end_symtab_from_static_block (static_block, section, 1); | |
6d30eef8 DE |
1558 | } |
1559 | ||
1560 | /* Subroutine of augment_type_symtab to simplify it. | |
43f3e411 DE |
1561 | Attach the main source file's symtab to all symbols in PENDING_LIST that |
1562 | don't have one. */ | |
6d30eef8 DE |
1563 | |
1564 | static void | |
43f3e411 DE |
1565 | set_missing_symtab (struct pending *pending_list, |
1566 | struct compunit_symtab *cu) | |
6d30eef8 DE |
1567 | { |
1568 | struct pending *pending; | |
1569 | int i; | |
1570 | ||
1571 | for (pending = pending_list; pending != NULL; pending = pending->next) | |
801e3a5b | 1572 | { |
6d30eef8 DE |
1573 | for (i = 0; i < pending->nsyms; ++i) |
1574 | { | |
08be3fe3 DE |
1575 | if (symbol_symtab (pending->symbol[i]) == NULL) |
1576 | symbol_set_symtab (pending->symbol[i], COMPUNIT_FILETABS (cu)); | |
6d30eef8 | 1577 | } |
801e3a5b | 1578 | } |
6d30eef8 | 1579 | } |
c906108c | 1580 | |
6d30eef8 DE |
1581 | /* Same as end_symtab, but for the case where we're adding more symbols |
1582 | to an existing symtab that is known to contain only type information. | |
1583 | This is the case for DWARF4 Type Units. */ | |
1584 | ||
1585 | void | |
0ab9ce85 | 1586 | augment_type_symtab (void) |
6d30eef8 | 1587 | { |
0ab9ce85 | 1588 | struct compunit_symtab *cust = buildsym_compunit->compunit_symtab; |
43f3e411 | 1589 | const struct blockvector *blockvector = COMPUNIT_BLOCKVECTOR (cust); |
6d30eef8 DE |
1590 | |
1591 | if (context_stack_depth > 0) | |
1592 | { | |
1593 | complaint (&symfile_complaints, | |
1594 | _("Context stack not empty in augment_type_symtab")); | |
1595 | context_stack_depth = 0; | |
1596 | } | |
1597 | if (pending_blocks != NULL) | |
1598 | complaint (&symfile_complaints, _("Blocks in a type symtab")); | |
1599 | if (pending_macros != NULL) | |
1600 | complaint (&symfile_complaints, _("Macro in a type symtab")); | |
1601 | if (have_line_numbers) | |
1602 | complaint (&symfile_complaints, | |
1603 | _("Line numbers recorded in a type symtab")); | |
1604 | ||
1605 | if (file_symbols != NULL) | |
1606 | { | |
1607 | struct block *block = BLOCKVECTOR_BLOCK (blockvector, STATIC_BLOCK); | |
1608 | ||
1609 | /* First mark any symbols without a specified symtab as belonging | |
1610 | to the primary symtab. */ | |
43f3e411 | 1611 | set_missing_symtab (file_symbols, cust); |
6d30eef8 DE |
1612 | |
1613 | dict_add_pending (BLOCK_DICT (block), file_symbols); | |
1614 | } | |
1615 | ||
1616 | if (global_symbols != NULL) | |
1617 | { | |
1618 | struct block *block = BLOCKVECTOR_BLOCK (blockvector, GLOBAL_BLOCK); | |
1619 | ||
1620 | /* First mark any symbols without a specified symtab as belonging | |
1621 | to the primary symtab. */ | |
43f3e411 | 1622 | set_missing_symtab (global_symbols, cust); |
6d30eef8 DE |
1623 | |
1624 | dict_add_pending (BLOCK_DICT (block), global_symbols); | |
1625 | } | |
1626 | ||
1627 | reset_symtab_globals (); | |
c906108c SS |
1628 | } |
1629 | ||
1630 | /* Push a context block. Args are an identifying nesting level | |
1631 | (checkable when you pop it), and the starting PC address of this | |
1632 | context. */ | |
1633 | ||
1634 | struct context_stack * | |
1635 | push_context (int desc, CORE_ADDR valu) | |
1636 | { | |
fe978cb0 | 1637 | struct context_stack *newobj; |
c906108c SS |
1638 | |
1639 | if (context_stack_depth == context_stack_size) | |
1640 | { | |
1641 | context_stack_size *= 2; | |
1642 | context_stack = (struct context_stack *) | |
1643 | xrealloc ((char *) context_stack, | |
c5aa993b | 1644 | (context_stack_size * sizeof (struct context_stack))); |
c906108c SS |
1645 | } |
1646 | ||
fe978cb0 PA |
1647 | newobj = &context_stack[context_stack_depth++]; |
1648 | newobj->depth = desc; | |
1649 | newobj->locals = local_symbols; | |
1650 | newobj->old_blocks = pending_blocks; | |
1651 | newobj->start_addr = valu; | |
22cee43f | 1652 | newobj->local_using_directives = local_using_directives; |
fe978cb0 | 1653 | newobj->name = NULL; |
c906108c SS |
1654 | |
1655 | local_symbols = NULL; | |
22cee43f | 1656 | local_using_directives = NULL; |
c906108c | 1657 | |
fe978cb0 | 1658 | return newobj; |
c906108c | 1659 | } |
0c5e171a | 1660 | |
a672ef13 | 1661 | /* Pop a context block. Returns the address of the context block just |
4a64f543 | 1662 | popped. */ |
a672ef13 | 1663 | |
0c5e171a KD |
1664 | struct context_stack * |
1665 | pop_context (void) | |
1666 | { | |
1667 | gdb_assert (context_stack_depth > 0); | |
1668 | return (&context_stack[--context_stack_depth]); | |
1669 | } | |
1670 | ||
c906108c | 1671 | \f |
357e46e7 | 1672 | |
4a64f543 | 1673 | /* Compute a small integer hash code for the given name. */ |
c906108c SS |
1674 | |
1675 | int | |
0d5cff50 | 1676 | hashname (const char *name) |
c906108c | 1677 | { |
357e46e7 | 1678 | return (hash(name,strlen(name)) % HASHSIZE); |
c906108c SS |
1679 | } |
1680 | \f | |
1681 | ||
1682 | void | |
554d387d | 1683 | record_debugformat (const char *format) |
c906108c | 1684 | { |
43f3e411 | 1685 | buildsym_compunit->debugformat = format; |
c906108c SS |
1686 | } |
1687 | ||
303b6f5d DJ |
1688 | void |
1689 | record_producer (const char *producer) | |
1690 | { | |
43f3e411 | 1691 | buildsym_compunit->producer = producer; |
303b6f5d DJ |
1692 | } |
1693 | ||
c906108c SS |
1694 | /* Merge the first symbol list SRCLIST into the second symbol list |
1695 | TARGETLIST by repeated calls to add_symbol_to_list(). This | |
1696 | procedure "frees" each link of SRCLIST by adding it to the | |
1697 | free_pendings list. Caller must set SRCLIST to a null list after | |
1698 | calling this function. | |
1699 | ||
4a64f543 | 1700 | Void return. */ |
c906108c SS |
1701 | |
1702 | void | |
1703 | merge_symbol_lists (struct pending **srclist, struct pending **targetlist) | |
1704 | { | |
52f0bd74 | 1705 | int i; |
c906108c SS |
1706 | |
1707 | if (!srclist || !*srclist) | |
1708 | return; | |
1709 | ||
1710 | /* Merge in elements from current link. */ | |
1711 | for (i = 0; i < (*srclist)->nsyms; i++) | |
1712 | add_symbol_to_list ((*srclist)->symbol[i], targetlist); | |
1713 | ||
1714 | /* Recurse on next. */ | |
1715 | merge_symbol_lists (&(*srclist)->next, targetlist); | |
1716 | ||
1717 | /* "Free" the current link. */ | |
1718 | (*srclist)->next = free_pendings; | |
1719 | free_pendings = (*srclist); | |
1720 | } | |
1721 | \f | |
46212e0b TT |
1722 | |
1723 | /* Name of source file whose symbol data we are now processing. This | |
1724 | comes from a symbol of type N_SO for stabs. For Dwarf it comes | |
1725 | from the DW_AT_name attribute of a DW_TAG_compile_unit DIE. */ | |
1726 | ||
1727 | static char *last_source_file; | |
1728 | ||
1729 | /* See buildsym.h. */ | |
1730 | ||
1731 | void | |
1732 | set_last_source_file (const char *name) | |
1733 | { | |
1734 | xfree (last_source_file); | |
1735 | last_source_file = name == NULL ? NULL : xstrdup (name); | |
1736 | } | |
1737 | ||
1738 | /* See buildsym.h. */ | |
1739 | ||
1740 | const char * | |
1741 | get_last_source_file (void) | |
1742 | { | |
1743 | return last_source_file; | |
1744 | } | |
1745 | ||
1746 | \f | |
1747 | ||
c906108c SS |
1748 | /* Initialize anything that needs initializing when starting to read a |
1749 | fresh piece of a symbol file, e.g. reading in the stuff | |
1750 | corresponding to a psymtab. */ | |
1751 | ||
1752 | void | |
fba45db2 | 1753 | buildsym_init (void) |
c906108c | 1754 | { |
fc474241 | 1755 | subfile_stack = NULL; |
801e3a5b | 1756 | |
801e3a5b | 1757 | pending_addrmap_interesting = 0; |
0ab9ce85 DE |
1758 | |
1759 | /* Context stack is initially empty. Allocate first one with room | |
1760 | for a few levels; reuse it forever afterward. */ | |
1761 | if (context_stack == NULL) | |
1762 | { | |
1763 | context_stack_size = INITIAL_CONTEXT_STACK_SIZE; | |
1764 | context_stack = (struct context_stack *) | |
1765 | xmalloc (context_stack_size * sizeof (struct context_stack)); | |
1766 | } | |
1767 | ||
1768 | /* Ensure the really_free_pendings cleanup was called after | |
1769 | the last time. */ | |
1770 | gdb_assert (free_pendings == NULL); | |
1771 | gdb_assert (pending_blocks == NULL); | |
1772 | gdb_assert (file_symbols == NULL); | |
1773 | gdb_assert (global_symbols == NULL); | |
22cee43f | 1774 | gdb_assert (global_using_directives == NULL); |
0ab9ce85 DE |
1775 | gdb_assert (pending_macros == NULL); |
1776 | gdb_assert (pending_addrmap == NULL); | |
1777 | gdb_assert (buildsym_compunit == NULL); | |
c906108c SS |
1778 | } |
1779 | ||
1780 | /* Initialize anything that needs initializing when a completely new | |
1781 | symbol file is specified (not just adding some symbols from another | |
1782 | file, e.g. a shared library). */ | |
1783 | ||
1784 | void | |
fba45db2 | 1785 | buildsym_new_init (void) |
c906108c SS |
1786 | { |
1787 | buildsym_init (); | |
1788 | } |