| 1 | /* Support routines for building symbol tables in GDB's internal format. |
| 2 | Copyright (C) 1986-2020 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 | #include "defs.h" |
| 20 | #include "buildsym-legacy.h" |
| 21 | #include "bfd.h" |
| 22 | #include "gdb_obstack.h" |
| 23 | #include "symtab.h" |
| 24 | #include "symfile.h" |
| 25 | #include "objfiles.h" |
| 26 | #include "gdbtypes.h" |
| 27 | #include "complaints.h" |
| 28 | #include "expression.h" /* For "enum exp_opcode" used by... */ |
| 29 | #include "filenames.h" /* For DOSish file names. */ |
| 30 | #include "macrotab.h" |
| 31 | #include "demangle.h" /* Needed by SYMBOL_INIT_DEMANGLED_NAME. */ |
| 32 | #include "block.h" |
| 33 | #include "cp-support.h" |
| 34 | #include "dictionary.h" |
| 35 | #include "addrmap.h" |
| 36 | #include <algorithm> |
| 37 | |
| 38 | /* For cleanup_undefined_stabs_types and finish_global_stabs (somewhat |
| 39 | questionable--see comment where we call them). */ |
| 40 | |
| 41 | #include "stabsread.h" |
| 42 | |
| 43 | /* List of blocks already made (lexical contexts already closed). |
| 44 | This is used at the end to make the blockvector. */ |
| 45 | |
| 46 | struct pending_block |
| 47 | { |
| 48 | struct pending_block *next; |
| 49 | struct block *block; |
| 50 | }; |
| 51 | |
| 52 | /* Initial sizes of data structures. These are realloc'd larger if |
| 53 | needed, and realloc'd down to the size actually used, when |
| 54 | completed. */ |
| 55 | |
| 56 | #define INITIAL_LINE_VECTOR_LENGTH 1000 |
| 57 | \f |
| 58 | |
| 59 | buildsym_compunit::buildsym_compunit (struct objfile *objfile_, |
| 60 | const char *name, |
| 61 | const char *comp_dir_, |
| 62 | enum language language_, |
| 63 | CORE_ADDR last_addr) |
| 64 | : m_objfile (objfile_), |
| 65 | m_last_source_file (name == nullptr ? nullptr : xstrdup (name)), |
| 66 | m_comp_dir (comp_dir_ == nullptr ? nullptr : xstrdup (comp_dir_)), |
| 67 | m_language (language_), |
| 68 | m_last_source_start_addr (last_addr) |
| 69 | { |
| 70 | /* Allocate the compunit symtab now. The caller needs it to allocate |
| 71 | non-primary symtabs. It is also needed by get_macro_table. */ |
| 72 | m_compunit_symtab = allocate_compunit_symtab (m_objfile, name); |
| 73 | |
| 74 | /* Build the subfile for NAME (the main source file) so that we can record |
| 75 | a pointer to it for later. |
| 76 | IMPORTANT: Do not allocate a struct symtab for NAME here. |
| 77 | It can happen that the debug info provides a different path to NAME than |
| 78 | DIRNAME,NAME. We cope with this in watch_main_source_file_lossage but |
| 79 | that only works if the main_subfile doesn't have a symtab yet. */ |
| 80 | start_subfile (name); |
| 81 | /* Save this so that we don't have to go looking for it at the end |
| 82 | of the subfiles list. */ |
| 83 | m_main_subfile = m_current_subfile; |
| 84 | } |
| 85 | |
| 86 | buildsym_compunit::~buildsym_compunit () |
| 87 | { |
| 88 | struct subfile *subfile, *nextsub; |
| 89 | |
| 90 | if (m_pending_macros != nullptr) |
| 91 | free_macro_table (m_pending_macros); |
| 92 | |
| 93 | for (subfile = m_subfiles; |
| 94 | subfile != NULL; |
| 95 | subfile = nextsub) |
| 96 | { |
| 97 | nextsub = subfile->next; |
| 98 | xfree (subfile->name); |
| 99 | xfree (subfile->line_vector); |
| 100 | xfree (subfile); |
| 101 | } |
| 102 | |
| 103 | struct pending *next, *next1; |
| 104 | |
| 105 | for (next = m_file_symbols; next != NULL; next = next1) |
| 106 | { |
| 107 | next1 = next->next; |
| 108 | xfree ((void *) next); |
| 109 | } |
| 110 | |
| 111 | for (next = m_global_symbols; next != NULL; next = next1) |
| 112 | { |
| 113 | next1 = next->next; |
| 114 | xfree ((void *) next); |
| 115 | } |
| 116 | } |
| 117 | |
| 118 | struct macro_table * |
| 119 | buildsym_compunit::get_macro_table () |
| 120 | { |
| 121 | if (m_pending_macros == nullptr) |
| 122 | m_pending_macros = new_macro_table (&m_objfile->per_bfd->storage_obstack, |
| 123 | &m_objfile->per_bfd->string_cache, |
| 124 | m_compunit_symtab); |
| 125 | return m_pending_macros; |
| 126 | } |
| 127 | |
| 128 | /* Maintain the lists of symbols and blocks. */ |
| 129 | |
| 130 | /* Add a symbol to one of the lists of symbols. */ |
| 131 | |
| 132 | void |
| 133 | add_symbol_to_list (struct symbol *symbol, struct pending **listhead) |
| 134 | { |
| 135 | struct pending *link; |
| 136 | |
| 137 | /* If this is an alias for another symbol, don't add it. */ |
| 138 | if (symbol->linkage_name () && symbol->linkage_name ()[0] == '#') |
| 139 | return; |
| 140 | |
| 141 | /* We keep PENDINGSIZE symbols in each link of the list. If we |
| 142 | don't have a link with room in it, add a new link. */ |
| 143 | if (*listhead == NULL || (*listhead)->nsyms == PENDINGSIZE) |
| 144 | { |
| 145 | link = XNEW (struct pending); |
| 146 | link->next = *listhead; |
| 147 | *listhead = link; |
| 148 | link->nsyms = 0; |
| 149 | } |
| 150 | |
| 151 | (*listhead)->symbol[(*listhead)->nsyms++] = symbol; |
| 152 | } |
| 153 | |
| 154 | /* Find a symbol named NAME on a LIST. NAME need not be |
| 155 | '\0'-terminated; LENGTH is the length of the name. */ |
| 156 | |
| 157 | struct symbol * |
| 158 | find_symbol_in_list (struct pending *list, char *name, int length) |
| 159 | { |
| 160 | int j; |
| 161 | const char *pp; |
| 162 | |
| 163 | while (list != NULL) |
| 164 | { |
| 165 | for (j = list->nsyms; --j >= 0;) |
| 166 | { |
| 167 | pp = list->symbol[j]->linkage_name (); |
| 168 | if (*pp == *name && strncmp (pp, name, length) == 0 |
| 169 | && pp[length] == '\0') |
| 170 | { |
| 171 | return (list->symbol[j]); |
| 172 | } |
| 173 | } |
| 174 | list = list->next; |
| 175 | } |
| 176 | return (NULL); |
| 177 | } |
| 178 | |
| 179 | /* Record BLOCK on the list of all blocks in the file. Put it after |
| 180 | OPBLOCK, or at the beginning if opblock is NULL. This puts the |
| 181 | block in the list after all its subblocks. */ |
| 182 | |
| 183 | void |
| 184 | buildsym_compunit::record_pending_block (struct block *block, |
| 185 | struct pending_block *opblock) |
| 186 | { |
| 187 | struct pending_block *pblock; |
| 188 | |
| 189 | pblock = XOBNEW (&m_pending_block_obstack, struct pending_block); |
| 190 | pblock->block = block; |
| 191 | if (opblock) |
| 192 | { |
| 193 | pblock->next = opblock->next; |
| 194 | opblock->next = pblock; |
| 195 | } |
| 196 | else |
| 197 | { |
| 198 | pblock->next = m_pending_blocks; |
| 199 | m_pending_blocks = pblock; |
| 200 | } |
| 201 | } |
| 202 | |
| 203 | /* Take one of the lists of symbols and make a block from it. Keep |
| 204 | the order the symbols have in the list (reversed from the input |
| 205 | file). Put the block on the list of pending blocks. */ |
| 206 | |
| 207 | struct block * |
| 208 | buildsym_compunit::finish_block_internal |
| 209 | (struct symbol *symbol, |
| 210 | struct pending **listhead, |
| 211 | struct pending_block *old_blocks, |
| 212 | const struct dynamic_prop *static_link, |
| 213 | CORE_ADDR start, CORE_ADDR end, |
| 214 | int is_global, int expandable) |
| 215 | { |
| 216 | struct gdbarch *gdbarch = get_objfile_arch (m_objfile); |
| 217 | struct pending *next, *next1; |
| 218 | struct block *block; |
| 219 | struct pending_block *pblock; |
| 220 | struct pending_block *opblock; |
| 221 | |
| 222 | block = (is_global |
| 223 | ? allocate_global_block (&m_objfile->objfile_obstack) |
| 224 | : allocate_block (&m_objfile->objfile_obstack)); |
| 225 | |
| 226 | if (symbol) |
| 227 | { |
| 228 | BLOCK_MULTIDICT (block) |
| 229 | = mdict_create_linear (&m_objfile->objfile_obstack, *listhead); |
| 230 | } |
| 231 | else |
| 232 | { |
| 233 | if (expandable) |
| 234 | { |
| 235 | BLOCK_MULTIDICT (block) = mdict_create_hashed_expandable (m_language); |
| 236 | mdict_add_pending (BLOCK_MULTIDICT (block), *listhead); |
| 237 | } |
| 238 | else |
| 239 | { |
| 240 | BLOCK_MULTIDICT (block) = |
| 241 | mdict_create_hashed (&m_objfile->objfile_obstack, *listhead); |
| 242 | } |
| 243 | } |
| 244 | |
| 245 | BLOCK_START (block) = start; |
| 246 | BLOCK_END (block) = end; |
| 247 | |
| 248 | /* Put the block in as the value of the symbol that names it. */ |
| 249 | |
| 250 | if (symbol) |
| 251 | { |
| 252 | struct type *ftype = SYMBOL_TYPE (symbol); |
| 253 | struct mdict_iterator miter; |
| 254 | SYMBOL_BLOCK_VALUE (symbol) = block; |
| 255 | BLOCK_FUNCTION (block) = symbol; |
| 256 | |
| 257 | if (TYPE_NFIELDS (ftype) <= 0) |
| 258 | { |
| 259 | /* No parameter type information is recorded with the |
| 260 | function's type. Set that from the type of the |
| 261 | parameter symbols. */ |
| 262 | int nparams = 0, iparams; |
| 263 | struct symbol *sym; |
| 264 | |
| 265 | /* Here we want to directly access the dictionary, because |
| 266 | we haven't fully initialized the block yet. */ |
| 267 | ALL_DICT_SYMBOLS (BLOCK_MULTIDICT (block), miter, sym) |
| 268 | { |
| 269 | if (SYMBOL_IS_ARGUMENT (sym)) |
| 270 | nparams++; |
| 271 | } |
| 272 | if (nparams > 0) |
| 273 | { |
| 274 | TYPE_NFIELDS (ftype) = nparams; |
| 275 | TYPE_FIELDS (ftype) = (struct field *) |
| 276 | TYPE_ALLOC (ftype, nparams * sizeof (struct field)); |
| 277 | |
| 278 | iparams = 0; |
| 279 | /* Here we want to directly access the dictionary, because |
| 280 | we haven't fully initialized the block yet. */ |
| 281 | ALL_DICT_SYMBOLS (BLOCK_MULTIDICT (block), miter, sym) |
| 282 | { |
| 283 | if (iparams == nparams) |
| 284 | break; |
| 285 | |
| 286 | if (SYMBOL_IS_ARGUMENT (sym)) |
| 287 | { |
| 288 | TYPE_FIELD_TYPE (ftype, iparams) = SYMBOL_TYPE (sym); |
| 289 | TYPE_FIELD_ARTIFICIAL (ftype, iparams) = 0; |
| 290 | iparams++; |
| 291 | } |
| 292 | } |
| 293 | } |
| 294 | } |
| 295 | } |
| 296 | else |
| 297 | { |
| 298 | BLOCK_FUNCTION (block) = NULL; |
| 299 | } |
| 300 | |
| 301 | if (static_link != NULL) |
| 302 | objfile_register_static_link (m_objfile, block, static_link); |
| 303 | |
| 304 | /* Now free the links of the list, and empty the list. */ |
| 305 | |
| 306 | for (next = *listhead; next; next = next1) |
| 307 | { |
| 308 | next1 = next->next; |
| 309 | xfree (next); |
| 310 | } |
| 311 | *listhead = NULL; |
| 312 | |
| 313 | /* Check to be sure that the blocks have an end address that is |
| 314 | greater than starting address. */ |
| 315 | |
| 316 | if (BLOCK_END (block) < BLOCK_START (block)) |
| 317 | { |
| 318 | if (symbol) |
| 319 | { |
| 320 | complaint (_("block end address less than block " |
| 321 | "start address in %s (patched it)"), |
| 322 | symbol->print_name ()); |
| 323 | } |
| 324 | else |
| 325 | { |
| 326 | complaint (_("block end address %s less than block " |
| 327 | "start address %s (patched it)"), |
| 328 | paddress (gdbarch, BLOCK_END (block)), |
| 329 | paddress (gdbarch, BLOCK_START (block))); |
| 330 | } |
| 331 | /* Better than nothing. */ |
| 332 | BLOCK_END (block) = BLOCK_START (block); |
| 333 | } |
| 334 | |
| 335 | /* Install this block as the superblock of all blocks made since the |
| 336 | start of this scope that don't have superblocks yet. */ |
| 337 | |
| 338 | opblock = NULL; |
| 339 | for (pblock = m_pending_blocks; |
| 340 | pblock && pblock != old_blocks; |
| 341 | pblock = pblock->next) |
| 342 | { |
| 343 | if (BLOCK_SUPERBLOCK (pblock->block) == NULL) |
| 344 | { |
| 345 | /* Check to be sure the blocks are nested as we receive |
| 346 | them. If the compiler/assembler/linker work, this just |
| 347 | burns a small amount of time. |
| 348 | |
| 349 | Skip blocks which correspond to a function; they're not |
| 350 | physically nested inside this other blocks, only |
| 351 | lexically nested. */ |
| 352 | if (BLOCK_FUNCTION (pblock->block) == NULL |
| 353 | && (BLOCK_START (pblock->block) < BLOCK_START (block) |
| 354 | || BLOCK_END (pblock->block) > BLOCK_END (block))) |
| 355 | { |
| 356 | if (symbol) |
| 357 | { |
| 358 | complaint (_("inner block not inside outer block in %s"), |
| 359 | symbol->print_name ()); |
| 360 | } |
| 361 | else |
| 362 | { |
| 363 | complaint (_("inner block (%s-%s) not " |
| 364 | "inside outer block (%s-%s)"), |
| 365 | paddress (gdbarch, BLOCK_START (pblock->block)), |
| 366 | paddress (gdbarch, BLOCK_END (pblock->block)), |
| 367 | paddress (gdbarch, BLOCK_START (block)), |
| 368 | paddress (gdbarch, BLOCK_END (block))); |
| 369 | } |
| 370 | if (BLOCK_START (pblock->block) < BLOCK_START (block)) |
| 371 | BLOCK_START (pblock->block) = BLOCK_START (block); |
| 372 | if (BLOCK_END (pblock->block) > BLOCK_END (block)) |
| 373 | BLOCK_END (pblock->block) = BLOCK_END (block); |
| 374 | } |
| 375 | BLOCK_SUPERBLOCK (pblock->block) = block; |
| 376 | } |
| 377 | opblock = pblock; |
| 378 | } |
| 379 | |
| 380 | block_set_using (block, |
| 381 | (is_global |
| 382 | ? m_global_using_directives |
| 383 | : m_local_using_directives), |
| 384 | &m_objfile->objfile_obstack); |
| 385 | if (is_global) |
| 386 | m_global_using_directives = NULL; |
| 387 | else |
| 388 | m_local_using_directives = NULL; |
| 389 | |
| 390 | record_pending_block (block, opblock); |
| 391 | |
| 392 | return block; |
| 393 | } |
| 394 | |
| 395 | struct block * |
| 396 | buildsym_compunit::finish_block (struct symbol *symbol, |
| 397 | struct pending_block *old_blocks, |
| 398 | const struct dynamic_prop *static_link, |
| 399 | CORE_ADDR start, CORE_ADDR end) |
| 400 | { |
| 401 | return finish_block_internal (symbol, &m_local_symbols, |
| 402 | old_blocks, static_link, start, end, 0, 0); |
| 403 | } |
| 404 | |
| 405 | /* Record that the range of addresses from START to END_INCLUSIVE |
| 406 | (inclusive, like it says) belongs to BLOCK. BLOCK's start and end |
| 407 | addresses must be set already. You must apply this function to all |
| 408 | BLOCK's children before applying it to BLOCK. |
| 409 | |
| 410 | If a call to this function complicates the picture beyond that |
| 411 | already provided by BLOCK_START and BLOCK_END, then we create an |
| 412 | address map for the block. */ |
| 413 | void |
| 414 | buildsym_compunit::record_block_range (struct block *block, |
| 415 | CORE_ADDR start, |
| 416 | CORE_ADDR end_inclusive) |
| 417 | { |
| 418 | /* If this is any different from the range recorded in the block's |
| 419 | own BLOCK_START and BLOCK_END, then note that the address map has |
| 420 | become interesting. Note that even if this block doesn't have |
| 421 | any "interesting" ranges, some later block might, so we still |
| 422 | need to record this block in the addrmap. */ |
| 423 | if (start != BLOCK_START (block) |
| 424 | || end_inclusive + 1 != BLOCK_END (block)) |
| 425 | m_pending_addrmap_interesting = true; |
| 426 | |
| 427 | if (m_pending_addrmap == nullptr) |
| 428 | m_pending_addrmap = addrmap_create_mutable (&m_pending_addrmap_obstack); |
| 429 | |
| 430 | addrmap_set_empty (m_pending_addrmap, start, end_inclusive, block); |
| 431 | } |
| 432 | |
| 433 | struct blockvector * |
| 434 | buildsym_compunit::make_blockvector () |
| 435 | { |
| 436 | struct pending_block *next; |
| 437 | struct blockvector *blockvector; |
| 438 | int i; |
| 439 | |
| 440 | /* Count the length of the list of blocks. */ |
| 441 | |
| 442 | for (next = m_pending_blocks, i = 0; next; next = next->next, i++) |
| 443 | { |
| 444 | } |
| 445 | |
| 446 | blockvector = (struct blockvector *) |
| 447 | obstack_alloc (&m_objfile->objfile_obstack, |
| 448 | (sizeof (struct blockvector) |
| 449 | + (i - 1) * sizeof (struct block *))); |
| 450 | |
| 451 | /* Copy the blocks into the blockvector. This is done in reverse |
| 452 | order, which happens to put the blocks into the proper order |
| 453 | (ascending starting address). finish_block has hair to insert |
| 454 | each block into the list after its subblocks in order to make |
| 455 | sure this is true. */ |
| 456 | |
| 457 | BLOCKVECTOR_NBLOCKS (blockvector) = i; |
| 458 | for (next = m_pending_blocks; next; next = next->next) |
| 459 | { |
| 460 | BLOCKVECTOR_BLOCK (blockvector, --i) = next->block; |
| 461 | } |
| 462 | |
| 463 | free_pending_blocks (); |
| 464 | |
| 465 | /* If we needed an address map for this symtab, record it in the |
| 466 | blockvector. */ |
| 467 | if (m_pending_addrmap != nullptr && m_pending_addrmap_interesting) |
| 468 | BLOCKVECTOR_MAP (blockvector) |
| 469 | = addrmap_create_fixed (m_pending_addrmap, &m_objfile->objfile_obstack); |
| 470 | else |
| 471 | BLOCKVECTOR_MAP (blockvector) = 0; |
| 472 | |
| 473 | /* Some compilers output blocks in the wrong order, but we depend on |
| 474 | their being in the right order so we can binary search. Check the |
| 475 | order and moan about it. |
| 476 | Note: Remember that the first two blocks are the global and static |
| 477 | blocks. We could special case that fact and begin checking at block 2. |
| 478 | To avoid making that assumption we do not. */ |
| 479 | if (BLOCKVECTOR_NBLOCKS (blockvector) > 1) |
| 480 | { |
| 481 | for (i = 1; i < BLOCKVECTOR_NBLOCKS (blockvector); i++) |
| 482 | { |
| 483 | if (BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i - 1)) |
| 484 | > BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i))) |
| 485 | { |
| 486 | CORE_ADDR start |
| 487 | = BLOCK_START (BLOCKVECTOR_BLOCK (blockvector, i)); |
| 488 | |
| 489 | complaint (_("block at %s out of order"), |
| 490 | hex_string ((LONGEST) start)); |
| 491 | } |
| 492 | } |
| 493 | } |
| 494 | |
| 495 | return (blockvector); |
| 496 | } |
| 497 | \f |
| 498 | /* Start recording information about source code that came from an |
| 499 | included (or otherwise merged-in) source file with a different |
| 500 | name. NAME is the name of the file (cannot be NULL). */ |
| 501 | |
| 502 | void |
| 503 | buildsym_compunit::start_subfile (const char *name) |
| 504 | { |
| 505 | const char *subfile_dirname; |
| 506 | struct subfile *subfile; |
| 507 | |
| 508 | subfile_dirname = m_comp_dir.get (); |
| 509 | |
| 510 | /* See if this subfile is already registered. */ |
| 511 | |
| 512 | for (subfile = m_subfiles; subfile; subfile = subfile->next) |
| 513 | { |
| 514 | char *subfile_name; |
| 515 | |
| 516 | /* If NAME is an absolute path, and this subfile is not, then |
| 517 | attempt to create an absolute path to compare. */ |
| 518 | if (IS_ABSOLUTE_PATH (name) |
| 519 | && !IS_ABSOLUTE_PATH (subfile->name) |
| 520 | && subfile_dirname != NULL) |
| 521 | subfile_name = concat (subfile_dirname, SLASH_STRING, |
| 522 | subfile->name, (char *) NULL); |
| 523 | else |
| 524 | subfile_name = subfile->name; |
| 525 | |
| 526 | if (FILENAME_CMP (subfile_name, name) == 0) |
| 527 | { |
| 528 | m_current_subfile = subfile; |
| 529 | if (subfile_name != subfile->name) |
| 530 | xfree (subfile_name); |
| 531 | return; |
| 532 | } |
| 533 | if (subfile_name != subfile->name) |
| 534 | xfree (subfile_name); |
| 535 | } |
| 536 | |
| 537 | /* This subfile is not known. Add an entry for it. */ |
| 538 | |
| 539 | subfile = XNEW (struct subfile); |
| 540 | memset (subfile, 0, sizeof (struct subfile)); |
| 541 | subfile->buildsym_compunit = this; |
| 542 | |
| 543 | subfile->next = m_subfiles; |
| 544 | m_subfiles = subfile; |
| 545 | |
| 546 | m_current_subfile = subfile; |
| 547 | |
| 548 | subfile->name = xstrdup (name); |
| 549 | |
| 550 | /* Initialize line-number recording for this subfile. */ |
| 551 | subfile->line_vector = NULL; |
| 552 | |
| 553 | /* Default the source language to whatever can be deduced from the |
| 554 | filename. If nothing can be deduced (such as for a C/C++ include |
| 555 | file with a ".h" extension), then inherit whatever language the |
| 556 | previous subfile had. This kludgery is necessary because there |
| 557 | is no standard way in some object formats to record the source |
| 558 | language. Also, when symtabs are allocated we try to deduce a |
| 559 | language then as well, but it is too late for us to use that |
| 560 | information while reading symbols, since symtabs aren't allocated |
| 561 | until after all the symbols have been processed for a given |
| 562 | source file. */ |
| 563 | |
| 564 | subfile->language = deduce_language_from_filename (subfile->name); |
| 565 | if (subfile->language == language_unknown |
| 566 | && subfile->next != NULL) |
| 567 | { |
| 568 | subfile->language = subfile->next->language; |
| 569 | } |
| 570 | |
| 571 | /* If the filename of this subfile ends in .C, then change the |
| 572 | language of any pending subfiles from C to C++. We also accept |
| 573 | any other C++ suffixes accepted by deduce_language_from_filename. */ |
| 574 | /* Likewise for f2c. */ |
| 575 | |
| 576 | if (subfile->name) |
| 577 | { |
| 578 | struct subfile *s; |
| 579 | enum language sublang = deduce_language_from_filename (subfile->name); |
| 580 | |
| 581 | if (sublang == language_cplus || sublang == language_fortran) |
| 582 | for (s = m_subfiles; s != NULL; s = s->next) |
| 583 | if (s->language == language_c) |
| 584 | s->language = sublang; |
| 585 | } |
| 586 | |
| 587 | /* And patch up this file if necessary. */ |
| 588 | if (subfile->language == language_c |
| 589 | && subfile->next != NULL |
| 590 | && (subfile->next->language == language_cplus |
| 591 | || subfile->next->language == language_fortran)) |
| 592 | { |
| 593 | subfile->language = subfile->next->language; |
| 594 | } |
| 595 | } |
| 596 | |
| 597 | /* For stabs readers, the first N_SO symbol is assumed to be the |
| 598 | source file name, and the subfile struct is initialized using that |
| 599 | assumption. If another N_SO symbol is later seen, immediately |
| 600 | following the first one, then the first one is assumed to be the |
| 601 | directory name and the second one is really the source file name. |
| 602 | |
| 603 | So we have to patch up the subfile struct by moving the old name |
| 604 | value to dirname and remembering the new name. Some sanity |
| 605 | checking is performed to ensure that the state of the subfile |
| 606 | struct is reasonable and that the old name we are assuming to be a |
| 607 | directory name actually is (by checking for a trailing '/'). */ |
| 608 | |
| 609 | void |
| 610 | buildsym_compunit::patch_subfile_names (struct subfile *subfile, |
| 611 | const char *name) |
| 612 | { |
| 613 | if (subfile != NULL |
| 614 | && m_comp_dir == NULL |
| 615 | && subfile->name != NULL |
| 616 | && IS_DIR_SEPARATOR (subfile->name[strlen (subfile->name) - 1])) |
| 617 | { |
| 618 | m_comp_dir.reset (subfile->name); |
| 619 | subfile->name = xstrdup (name); |
| 620 | set_last_source_file (name); |
| 621 | |
| 622 | /* Default the source language to whatever can be deduced from |
| 623 | the filename. If nothing can be deduced (such as for a C/C++ |
| 624 | include file with a ".h" extension), then inherit whatever |
| 625 | language the previous subfile had. This kludgery is |
| 626 | necessary because there is no standard way in some object |
| 627 | formats to record the source language. Also, when symtabs |
| 628 | are allocated we try to deduce a language then as well, but |
| 629 | it is too late for us to use that information while reading |
| 630 | symbols, since symtabs aren't allocated until after all the |
| 631 | symbols have been processed for a given source file. */ |
| 632 | |
| 633 | subfile->language = deduce_language_from_filename (subfile->name); |
| 634 | if (subfile->language == language_unknown |
| 635 | && subfile->next != NULL) |
| 636 | { |
| 637 | subfile->language = subfile->next->language; |
| 638 | } |
| 639 | } |
| 640 | } |
| 641 | \f |
| 642 | /* Handle the N_BINCL and N_EINCL symbol types that act like N_SOL for |
| 643 | switching source files (different subfiles, as we call them) within |
| 644 | one object file, but using a stack rather than in an arbitrary |
| 645 | order. */ |
| 646 | |
| 647 | void |
| 648 | buildsym_compunit::push_subfile () |
| 649 | { |
| 650 | gdb_assert (m_current_subfile != NULL); |
| 651 | gdb_assert (m_current_subfile->name != NULL); |
| 652 | m_subfile_stack.push_back (m_current_subfile->name); |
| 653 | } |
| 654 | |
| 655 | const char * |
| 656 | buildsym_compunit::pop_subfile () |
| 657 | { |
| 658 | gdb_assert (!m_subfile_stack.empty ()); |
| 659 | const char *name = m_subfile_stack.back (); |
| 660 | m_subfile_stack.pop_back (); |
| 661 | return name; |
| 662 | } |
| 663 | \f |
| 664 | /* Add a linetable entry for line number LINE and address PC to the |
| 665 | line vector for SUBFILE. */ |
| 666 | |
| 667 | void |
| 668 | buildsym_compunit::record_line (struct subfile *subfile, int line, |
| 669 | CORE_ADDR pc, bool is_stmt) |
| 670 | { |
| 671 | struct linetable_entry *e; |
| 672 | |
| 673 | /* Make sure line vector exists and is big enough. */ |
| 674 | if (!subfile->line_vector) |
| 675 | { |
| 676 | subfile->line_vector_length = INITIAL_LINE_VECTOR_LENGTH; |
| 677 | subfile->line_vector = (struct linetable *) |
| 678 | xmalloc (sizeof (struct linetable) |
| 679 | + subfile->line_vector_length * sizeof (struct linetable_entry)); |
| 680 | subfile->line_vector->nitems = 0; |
| 681 | m_have_line_numbers = true; |
| 682 | } |
| 683 | |
| 684 | if (subfile->line_vector->nitems > 0) |
| 685 | { |
| 686 | /* If we have a duplicate for the previous entry then ignore the new |
| 687 | entry, except, if the new entry is setting the is_stmt flag, then |
| 688 | ensure the previous entry respects the new setting. */ |
| 689 | e = subfile->line_vector->item + subfile->line_vector->nitems - 1; |
| 690 | if (e->line == line && e->pc == pc) |
| 691 | { |
| 692 | if (is_stmt && !e->is_stmt) |
| 693 | e->is_stmt = 1; |
| 694 | return; |
| 695 | } |
| 696 | } |
| 697 | |
| 698 | if (subfile->line_vector->nitems + 1 >= subfile->line_vector_length) |
| 699 | { |
| 700 | subfile->line_vector_length *= 2; |
| 701 | subfile->line_vector = (struct linetable *) |
| 702 | xrealloc ((char *) subfile->line_vector, |
| 703 | (sizeof (struct linetable) |
| 704 | + (subfile->line_vector_length |
| 705 | * sizeof (struct linetable_entry)))); |
| 706 | } |
| 707 | |
| 708 | /* Normally, we treat lines as unsorted. But the end of sequence |
| 709 | marker is special. We sort line markers at the same PC by line |
| 710 | number, so end of sequence markers (which have line == 0) appear |
| 711 | first. This is right if the marker ends the previous function, |
| 712 | and there is no padding before the next function. But it is |
| 713 | wrong if the previous line was empty and we are now marking a |
| 714 | switch to a different subfile. We must leave the end of sequence |
| 715 | marker at the end of this group of lines, not sort the empty line |
| 716 | to after the marker. The easiest way to accomplish this is to |
| 717 | delete any empty lines from our table, if they are followed by |
| 718 | end of sequence markers. All we lose is the ability to set |
| 719 | breakpoints at some lines which contain no instructions |
| 720 | anyway. */ |
| 721 | if (line == 0 && subfile->line_vector->nitems > 0) |
| 722 | { |
| 723 | e = subfile->line_vector->item + subfile->line_vector->nitems - 1; |
| 724 | while (subfile->line_vector->nitems > 0 && e->pc == pc) |
| 725 | { |
| 726 | e--; |
| 727 | subfile->line_vector->nitems--; |
| 728 | } |
| 729 | } |
| 730 | |
| 731 | e = subfile->line_vector->item + subfile->line_vector->nitems++; |
| 732 | e->line = line; |
| 733 | e->is_stmt = is_stmt ? 1 : 0; |
| 734 | e->pc = pc; |
| 735 | } |
| 736 | |
| 737 | \f |
| 738 | /* Subroutine of end_symtab to simplify it. Look for a subfile that |
| 739 | matches the main source file's basename. If there is only one, and |
| 740 | if the main source file doesn't have any symbol or line number |
| 741 | information, then copy this file's symtab and line_vector to the |
| 742 | main source file's subfile and discard the other subfile. This can |
| 743 | happen because of a compiler bug or from the user playing games |
| 744 | with #line or from things like a distributed build system that |
| 745 | manipulates the debug info. This can also happen from an innocent |
| 746 | symlink in the paths, we don't canonicalize paths here. */ |
| 747 | |
| 748 | void |
| 749 | buildsym_compunit::watch_main_source_file_lossage () |
| 750 | { |
| 751 | struct subfile *mainsub, *subfile; |
| 752 | |
| 753 | /* Get the main source file. */ |
| 754 | mainsub = m_main_subfile; |
| 755 | |
| 756 | /* If the main source file doesn't have any line number or symbol |
| 757 | info, look for an alias in another subfile. */ |
| 758 | |
| 759 | if (mainsub->line_vector == NULL |
| 760 | && mainsub->symtab == NULL) |
| 761 | { |
| 762 | const char *mainbase = lbasename (mainsub->name); |
| 763 | int nr_matches = 0; |
| 764 | struct subfile *prevsub; |
| 765 | struct subfile *mainsub_alias = NULL; |
| 766 | struct subfile *prev_mainsub_alias = NULL; |
| 767 | |
| 768 | prevsub = NULL; |
| 769 | for (subfile = m_subfiles; |
| 770 | subfile != NULL; |
| 771 | subfile = subfile->next) |
| 772 | { |
| 773 | if (subfile == mainsub) |
| 774 | continue; |
| 775 | if (filename_cmp (lbasename (subfile->name), mainbase) == 0) |
| 776 | { |
| 777 | ++nr_matches; |
| 778 | mainsub_alias = subfile; |
| 779 | prev_mainsub_alias = prevsub; |
| 780 | } |
| 781 | prevsub = subfile; |
| 782 | } |
| 783 | |
| 784 | if (nr_matches == 1) |
| 785 | { |
| 786 | gdb_assert (mainsub_alias != NULL && mainsub_alias != mainsub); |
| 787 | |
| 788 | /* Found a match for the main source file. |
| 789 | Copy its line_vector and symtab to the main subfile |
| 790 | and then discard it. */ |
| 791 | |
| 792 | mainsub->line_vector = mainsub_alias->line_vector; |
| 793 | mainsub->line_vector_length = mainsub_alias->line_vector_length; |
| 794 | mainsub->symtab = mainsub_alias->symtab; |
| 795 | |
| 796 | if (prev_mainsub_alias == NULL) |
| 797 | m_subfiles = mainsub_alias->next; |
| 798 | else |
| 799 | prev_mainsub_alias->next = mainsub_alias->next; |
| 800 | xfree (mainsub_alias->name); |
| 801 | xfree (mainsub_alias); |
| 802 | } |
| 803 | } |
| 804 | } |
| 805 | |
| 806 | /* Implementation of the first part of end_symtab. It allows modifying |
| 807 | STATIC_BLOCK before it gets finalized by end_symtab_from_static_block. |
| 808 | If the returned value is NULL there is no blockvector created for |
| 809 | this symtab (you still must call end_symtab_from_static_block). |
| 810 | |
| 811 | END_ADDR is the same as for end_symtab: the address of the end of the |
| 812 | file's text. |
| 813 | |
| 814 | If EXPANDABLE is non-zero the STATIC_BLOCK dictionary is made |
| 815 | expandable. |
| 816 | |
| 817 | If REQUIRED is non-zero, then a symtab is created even if it does |
| 818 | not contain any symbols. */ |
| 819 | |
| 820 | struct block * |
| 821 | buildsym_compunit::end_symtab_get_static_block (CORE_ADDR end_addr, |
| 822 | int expandable, int required) |
| 823 | { |
| 824 | /* Finish the lexical context of the last function in the file; pop |
| 825 | the context stack. */ |
| 826 | |
| 827 | if (!m_context_stack.empty ()) |
| 828 | { |
| 829 | struct context_stack cstk = pop_context (); |
| 830 | |
| 831 | /* Make a block for the local symbols within. */ |
| 832 | finish_block (cstk.name, cstk.old_blocks, NULL, |
| 833 | cstk.start_addr, end_addr); |
| 834 | |
| 835 | if (!m_context_stack.empty ()) |
| 836 | { |
| 837 | /* This is said to happen with SCO. The old coffread.c |
| 838 | code simply emptied the context stack, so we do the |
| 839 | same. FIXME: Find out why it is happening. This is not |
| 840 | believed to happen in most cases (even for coffread.c); |
| 841 | it used to be an abort(). */ |
| 842 | complaint (_("Context stack not empty in end_symtab")); |
| 843 | m_context_stack.clear (); |
| 844 | } |
| 845 | } |
| 846 | |
| 847 | /* Reordered executables may have out of order pending blocks; if |
| 848 | OBJF_REORDERED is true, then sort the pending blocks. */ |
| 849 | |
| 850 | if ((m_objfile->flags & OBJF_REORDERED) && m_pending_blocks) |
| 851 | { |
| 852 | struct pending_block *pb; |
| 853 | |
| 854 | std::vector<block *> barray; |
| 855 | |
| 856 | for (pb = m_pending_blocks; pb != NULL; pb = pb->next) |
| 857 | barray.push_back (pb->block); |
| 858 | |
| 859 | /* Sort blocks by start address in descending order. Blocks with the |
| 860 | same start address must remain in the original order to preserve |
| 861 | inline function caller/callee relationships. */ |
| 862 | std::stable_sort (barray.begin (), barray.end (), |
| 863 | [] (const block *a, const block *b) |
| 864 | { |
| 865 | return BLOCK_START (a) > BLOCK_START (b); |
| 866 | }); |
| 867 | |
| 868 | int i = 0; |
| 869 | for (pb = m_pending_blocks; pb != NULL; pb = pb->next) |
| 870 | pb->block = barray[i++]; |
| 871 | } |
| 872 | |
| 873 | /* Cleanup any undefined types that have been left hanging around |
| 874 | (this needs to be done before the finish_blocks so that |
| 875 | file_symbols is still good). |
| 876 | |
| 877 | Both cleanup_undefined_stabs_types and finish_global_stabs are stabs |
| 878 | specific, but harmless for other symbol readers, since on gdb |
| 879 | startup or when finished reading stabs, the state is set so these |
| 880 | are no-ops. FIXME: Is this handled right in case of QUIT? Can |
| 881 | we make this cleaner? */ |
| 882 | |
| 883 | cleanup_undefined_stabs_types (m_objfile); |
| 884 | finish_global_stabs (m_objfile); |
| 885 | |
| 886 | if (!required |
| 887 | && m_pending_blocks == NULL |
| 888 | && m_file_symbols == NULL |
| 889 | && m_global_symbols == NULL |
| 890 | && !m_have_line_numbers |
| 891 | && m_pending_macros == NULL |
| 892 | && m_global_using_directives == NULL) |
| 893 | { |
| 894 | /* Ignore symtabs that have no functions with real debugging info. */ |
| 895 | return NULL; |
| 896 | } |
| 897 | else |
| 898 | { |
| 899 | /* Define the STATIC_BLOCK. */ |
| 900 | return finish_block_internal (NULL, get_file_symbols (), NULL, NULL, |
| 901 | m_last_source_start_addr, |
| 902 | end_addr, 0, expandable); |
| 903 | } |
| 904 | } |
| 905 | |
| 906 | /* Subroutine of end_symtab_from_static_block to simplify it. |
| 907 | Handle the "have blockvector" case. |
| 908 | See end_symtab_from_static_block for a description of the arguments. */ |
| 909 | |
| 910 | struct compunit_symtab * |
| 911 | buildsym_compunit::end_symtab_with_blockvector (struct block *static_block, |
| 912 | int section, int expandable) |
| 913 | { |
| 914 | struct compunit_symtab *cu = m_compunit_symtab; |
| 915 | struct blockvector *blockvector; |
| 916 | struct subfile *subfile; |
| 917 | CORE_ADDR end_addr; |
| 918 | |
| 919 | gdb_assert (static_block != NULL); |
| 920 | gdb_assert (m_subfiles != NULL); |
| 921 | |
| 922 | end_addr = BLOCK_END (static_block); |
| 923 | |
| 924 | /* Create the GLOBAL_BLOCK and build the blockvector. */ |
| 925 | finish_block_internal (NULL, get_global_symbols (), NULL, NULL, |
| 926 | m_last_source_start_addr, end_addr, |
| 927 | 1, expandable); |
| 928 | blockvector = make_blockvector (); |
| 929 | |
| 930 | /* Read the line table if it has to be read separately. |
| 931 | This is only used by xcoffread.c. */ |
| 932 | if (m_objfile->sf->sym_read_linetable != NULL) |
| 933 | m_objfile->sf->sym_read_linetable (m_objfile); |
| 934 | |
| 935 | /* Handle the case where the debug info specifies a different path |
| 936 | for the main source file. It can cause us to lose track of its |
| 937 | line number information. */ |
| 938 | watch_main_source_file_lossage (); |
| 939 | |
| 940 | /* Now create the symtab objects proper, if not already done, |
| 941 | one for each subfile. */ |
| 942 | |
| 943 | for (subfile = m_subfiles; |
| 944 | subfile != NULL; |
| 945 | subfile = subfile->next) |
| 946 | { |
| 947 | int linetablesize = 0; |
| 948 | |
| 949 | if (subfile->line_vector) |
| 950 | { |
| 951 | linetablesize = sizeof (struct linetable) + |
| 952 | subfile->line_vector->nitems * sizeof (struct linetable_entry); |
| 953 | |
| 954 | const auto lte_is_less_than |
| 955 | = [] (const linetable_entry &ln1, |
| 956 | const linetable_entry &ln2) -> bool |
| 957 | { |
| 958 | return (ln1.pc < ln2.pc); |
| 959 | }; |
| 960 | |
| 961 | /* Like the pending blocks, the line table may be scrambled in |
| 962 | reordered executables. Sort it if OBJF_REORDERED is true. It |
| 963 | is important to preserve the order of lines at the same |
| 964 | address, as this maintains the inline function caller/callee |
| 965 | relationships, this is why std::stable_sort is used. */ |
| 966 | if (m_objfile->flags & OBJF_REORDERED) |
| 967 | std::stable_sort (subfile->line_vector->item, |
| 968 | subfile->line_vector->item |
| 969 | + subfile->line_vector->nitems, |
| 970 | lte_is_less_than); |
| 971 | } |
| 972 | |
| 973 | /* Allocate a symbol table if necessary. */ |
| 974 | if (subfile->symtab == NULL) |
| 975 | subfile->symtab = allocate_symtab (cu, subfile->name); |
| 976 | struct symtab *symtab = subfile->symtab; |
| 977 | |
| 978 | /* Fill in its components. */ |
| 979 | |
| 980 | if (subfile->line_vector) |
| 981 | { |
| 982 | /* Reallocate the line table on the symbol obstack. */ |
| 983 | SYMTAB_LINETABLE (symtab) = (struct linetable *) |
| 984 | obstack_alloc (&m_objfile->objfile_obstack, linetablesize); |
| 985 | memcpy (SYMTAB_LINETABLE (symtab), subfile->line_vector, |
| 986 | linetablesize); |
| 987 | } |
| 988 | else |
| 989 | { |
| 990 | SYMTAB_LINETABLE (symtab) = NULL; |
| 991 | } |
| 992 | |
| 993 | /* Use whatever language we have been using for this |
| 994 | subfile, not the one that was deduced in allocate_symtab |
| 995 | from the filename. We already did our own deducing when |
| 996 | we created the subfile, and we may have altered our |
| 997 | opinion of what language it is from things we found in |
| 998 | the symbols. */ |
| 999 | symtab->language = subfile->language; |
| 1000 | } |
| 1001 | |
| 1002 | /* Make sure the symtab of main_subfile is the first in its list. */ |
| 1003 | { |
| 1004 | struct symtab *main_symtab, *prev_symtab; |
| 1005 | |
| 1006 | main_symtab = m_main_subfile->symtab; |
| 1007 | prev_symtab = NULL; |
| 1008 | for (symtab *symtab : compunit_filetabs (cu)) |
| 1009 | { |
| 1010 | if (symtab == main_symtab) |
| 1011 | { |
| 1012 | if (prev_symtab != NULL) |
| 1013 | { |
| 1014 | prev_symtab->next = main_symtab->next; |
| 1015 | main_symtab->next = COMPUNIT_FILETABS (cu); |
| 1016 | COMPUNIT_FILETABS (cu) = main_symtab; |
| 1017 | } |
| 1018 | break; |
| 1019 | } |
| 1020 | prev_symtab = symtab; |
| 1021 | } |
| 1022 | gdb_assert (main_symtab == COMPUNIT_FILETABS (cu)); |
| 1023 | } |
| 1024 | |
| 1025 | /* Fill out the compunit symtab. */ |
| 1026 | |
| 1027 | if (m_comp_dir != NULL) |
| 1028 | { |
| 1029 | /* Reallocate the dirname on the symbol obstack. */ |
| 1030 | const char *comp_dir = m_comp_dir.get (); |
| 1031 | COMPUNIT_DIRNAME (cu) = obstack_strdup (&m_objfile->objfile_obstack, |
| 1032 | comp_dir); |
| 1033 | } |
| 1034 | |
| 1035 | /* Save the debug format string (if any) in the symtab. */ |
| 1036 | COMPUNIT_DEBUGFORMAT (cu) = m_debugformat; |
| 1037 | |
| 1038 | /* Similarly for the producer. */ |
| 1039 | COMPUNIT_PRODUCER (cu) = m_producer; |
| 1040 | |
| 1041 | COMPUNIT_BLOCKVECTOR (cu) = blockvector; |
| 1042 | { |
| 1043 | struct block *b = BLOCKVECTOR_BLOCK (blockvector, GLOBAL_BLOCK); |
| 1044 | |
| 1045 | set_block_compunit_symtab (b, cu); |
| 1046 | } |
| 1047 | |
| 1048 | COMPUNIT_BLOCK_LINE_SECTION (cu) = section; |
| 1049 | |
| 1050 | COMPUNIT_MACRO_TABLE (cu) = release_macros (); |
| 1051 | |
| 1052 | /* Default any symbols without a specified symtab to the primary symtab. */ |
| 1053 | { |
| 1054 | int block_i; |
| 1055 | |
| 1056 | /* The main source file's symtab. */ |
| 1057 | struct symtab *symtab = COMPUNIT_FILETABS (cu); |
| 1058 | |
| 1059 | for (block_i = 0; block_i < BLOCKVECTOR_NBLOCKS (blockvector); block_i++) |
| 1060 | { |
| 1061 | struct block *block = BLOCKVECTOR_BLOCK (blockvector, block_i); |
| 1062 | struct symbol *sym; |
| 1063 | struct mdict_iterator miter; |
| 1064 | |
| 1065 | /* Inlined functions may have symbols not in the global or |
| 1066 | static symbol lists. */ |
| 1067 | if (BLOCK_FUNCTION (block) != NULL) |
| 1068 | if (symbol_symtab (BLOCK_FUNCTION (block)) == NULL) |
| 1069 | symbol_set_symtab (BLOCK_FUNCTION (block), symtab); |
| 1070 | |
| 1071 | /* Note that we only want to fix up symbols from the local |
| 1072 | blocks, not blocks coming from included symtabs. That is why |
| 1073 | we use ALL_DICT_SYMBOLS here and not ALL_BLOCK_SYMBOLS. */ |
| 1074 | ALL_DICT_SYMBOLS (BLOCK_MULTIDICT (block), miter, sym) |
| 1075 | if (symbol_symtab (sym) == NULL) |
| 1076 | symbol_set_symtab (sym, symtab); |
| 1077 | } |
| 1078 | } |
| 1079 | |
| 1080 | add_compunit_symtab_to_objfile (cu); |
| 1081 | |
| 1082 | return cu; |
| 1083 | } |
| 1084 | |
| 1085 | /* Implementation of the second part of end_symtab. Pass STATIC_BLOCK |
| 1086 | as value returned by end_symtab_get_static_block. |
| 1087 | |
| 1088 | SECTION is the same as for end_symtab: the section number |
| 1089 | (in objfile->section_offsets) of the blockvector and linetable. |
| 1090 | |
| 1091 | If EXPANDABLE is non-zero the GLOBAL_BLOCK dictionary is made |
| 1092 | expandable. */ |
| 1093 | |
| 1094 | struct compunit_symtab * |
| 1095 | buildsym_compunit::end_symtab_from_static_block (struct block *static_block, |
| 1096 | int section, int expandable) |
| 1097 | { |
| 1098 | struct compunit_symtab *cu; |
| 1099 | |
| 1100 | if (static_block == NULL) |
| 1101 | { |
| 1102 | /* Handle the "no blockvector" case. |
| 1103 | When this happens there is nothing to record, so there's nothing |
| 1104 | to do: memory will be freed up later. |
| 1105 | |
| 1106 | Note: We won't be adding a compunit to the objfile's list of |
| 1107 | compunits, so there's nothing to unchain. However, since each symtab |
| 1108 | is added to the objfile's obstack we can't free that space. |
| 1109 | We could do better, but this is believed to be a sufficiently rare |
| 1110 | event. */ |
| 1111 | cu = NULL; |
| 1112 | } |
| 1113 | else |
| 1114 | cu = end_symtab_with_blockvector (static_block, section, expandable); |
| 1115 | |
| 1116 | return cu; |
| 1117 | } |
| 1118 | |
| 1119 | /* Finish the symbol definitions for one main source file, close off |
| 1120 | all the lexical contexts for that file (creating struct block's for |
| 1121 | them), then make the struct symtab for that file and put it in the |
| 1122 | list of all such. |
| 1123 | |
| 1124 | END_ADDR is the address of the end of the file's text. SECTION is |
| 1125 | the section number (in objfile->section_offsets) of the blockvector |
| 1126 | and linetable. |
| 1127 | |
| 1128 | Note that it is possible for end_symtab() to return NULL. In |
| 1129 | particular, for the DWARF case at least, it will return NULL when |
| 1130 | it finds a compilation unit that has exactly one DIE, a |
| 1131 | TAG_compile_unit DIE. This can happen when we link in an object |
| 1132 | file that was compiled from an empty source file. Returning NULL |
| 1133 | is probably not the correct thing to do, because then gdb will |
| 1134 | never know about this empty file (FIXME). |
| 1135 | |
| 1136 | If you need to modify STATIC_BLOCK before it is finalized you should |
| 1137 | call end_symtab_get_static_block and end_symtab_from_static_block |
| 1138 | yourself. */ |
| 1139 | |
| 1140 | struct compunit_symtab * |
| 1141 | buildsym_compunit::end_symtab (CORE_ADDR end_addr, int section) |
| 1142 | { |
| 1143 | struct block *static_block; |
| 1144 | |
| 1145 | static_block = end_symtab_get_static_block (end_addr, 0, 0); |
| 1146 | return end_symtab_from_static_block (static_block, section, 0); |
| 1147 | } |
| 1148 | |
| 1149 | /* Same as end_symtab except create a symtab that can be later added to. */ |
| 1150 | |
| 1151 | struct compunit_symtab * |
| 1152 | buildsym_compunit::end_expandable_symtab (CORE_ADDR end_addr, int section) |
| 1153 | { |
| 1154 | struct block *static_block; |
| 1155 | |
| 1156 | static_block = end_symtab_get_static_block (end_addr, 1, 0); |
| 1157 | return end_symtab_from_static_block (static_block, section, 1); |
| 1158 | } |
| 1159 | |
| 1160 | /* Subroutine of augment_type_symtab to simplify it. |
| 1161 | Attach the main source file's symtab to all symbols in PENDING_LIST that |
| 1162 | don't have one. */ |
| 1163 | |
| 1164 | static void |
| 1165 | set_missing_symtab (struct pending *pending_list, |
| 1166 | struct compunit_symtab *cu) |
| 1167 | { |
| 1168 | struct pending *pending; |
| 1169 | int i; |
| 1170 | |
| 1171 | for (pending = pending_list; pending != NULL; pending = pending->next) |
| 1172 | { |
| 1173 | for (i = 0; i < pending->nsyms; ++i) |
| 1174 | { |
| 1175 | if (symbol_symtab (pending->symbol[i]) == NULL) |
| 1176 | symbol_set_symtab (pending->symbol[i], COMPUNIT_FILETABS (cu)); |
| 1177 | } |
| 1178 | } |
| 1179 | } |
| 1180 | |
| 1181 | /* Same as end_symtab, but for the case where we're adding more symbols |
| 1182 | to an existing symtab that is known to contain only type information. |
| 1183 | This is the case for DWARF4 Type Units. */ |
| 1184 | |
| 1185 | void |
| 1186 | buildsym_compunit::augment_type_symtab () |
| 1187 | { |
| 1188 | struct compunit_symtab *cust = m_compunit_symtab; |
| 1189 | const struct blockvector *blockvector = COMPUNIT_BLOCKVECTOR (cust); |
| 1190 | |
| 1191 | if (!m_context_stack.empty ()) |
| 1192 | complaint (_("Context stack not empty in augment_type_symtab")); |
| 1193 | if (m_pending_blocks != NULL) |
| 1194 | complaint (_("Blocks in a type symtab")); |
| 1195 | if (m_pending_macros != NULL) |
| 1196 | complaint (_("Macro in a type symtab")); |
| 1197 | if (m_have_line_numbers) |
| 1198 | complaint (_("Line numbers recorded in a type symtab")); |
| 1199 | |
| 1200 | if (m_file_symbols != NULL) |
| 1201 | { |
| 1202 | struct block *block = BLOCKVECTOR_BLOCK (blockvector, STATIC_BLOCK); |
| 1203 | |
| 1204 | /* First mark any symbols without a specified symtab as belonging |
| 1205 | to the primary symtab. */ |
| 1206 | set_missing_symtab (m_file_symbols, cust); |
| 1207 | |
| 1208 | mdict_add_pending (BLOCK_MULTIDICT (block), m_file_symbols); |
| 1209 | } |
| 1210 | |
| 1211 | if (m_global_symbols != NULL) |
| 1212 | { |
| 1213 | struct block *block = BLOCKVECTOR_BLOCK (blockvector, GLOBAL_BLOCK); |
| 1214 | |
| 1215 | /* First mark any symbols without a specified symtab as belonging |
| 1216 | to the primary symtab. */ |
| 1217 | set_missing_symtab (m_global_symbols, cust); |
| 1218 | |
| 1219 | mdict_add_pending (BLOCK_MULTIDICT (block), |
| 1220 | m_global_symbols); |
| 1221 | } |
| 1222 | } |
| 1223 | |
| 1224 | /* Push a context block. Args are an identifying nesting level |
| 1225 | (checkable when you pop it), and the starting PC address of this |
| 1226 | context. */ |
| 1227 | |
| 1228 | struct context_stack * |
| 1229 | buildsym_compunit::push_context (int desc, CORE_ADDR valu) |
| 1230 | { |
| 1231 | m_context_stack.emplace_back (); |
| 1232 | struct context_stack *newobj = &m_context_stack.back (); |
| 1233 | |
| 1234 | newobj->depth = desc; |
| 1235 | newobj->locals = m_local_symbols; |
| 1236 | newobj->old_blocks = m_pending_blocks; |
| 1237 | newobj->start_addr = valu; |
| 1238 | newobj->local_using_directives = m_local_using_directives; |
| 1239 | newobj->name = NULL; |
| 1240 | |
| 1241 | m_local_symbols = NULL; |
| 1242 | m_local_using_directives = NULL; |
| 1243 | |
| 1244 | return newobj; |
| 1245 | } |
| 1246 | |
| 1247 | /* Pop a context block. Returns the address of the context block just |
| 1248 | popped. */ |
| 1249 | |
| 1250 | struct context_stack |
| 1251 | buildsym_compunit::pop_context () |
| 1252 | { |
| 1253 | gdb_assert (!m_context_stack.empty ()); |
| 1254 | struct context_stack result = m_context_stack.back (); |
| 1255 | m_context_stack.pop_back (); |
| 1256 | return result; |
| 1257 | } |