return result;
}
+ /* This function is called to discard any pending blocks. */
+
+ void free_pending_blocks ()
+ {
+ m_pending_block_obstack.clear ();
+ m_pending_blocks = nullptr;
+ }
+
/* The objfile we're reading debug info from. */
struct objfile *objfile;
we start processing a symfile, and if it's still false at the
end, then we just toss the addrmap. */
bool m_pending_addrmap_interesting = false;
+
+ /* An obstack used for allocating pending blocks. */
+ auto_obstack m_pending_block_obstack;
+
+ /* Pointer to the head of a linked list of symbol blocks which have
+ already been finalized (lexical contexts already closed) and which
+ are just waiting to be built into a blockvector when finalizing the
+ associated symtab. */
+ struct pending_block *m_pending_blocks = nullptr;
};
/* The work-in-progress of the compunit we are building.
static struct pending *free_pendings;
-/* An obstack used for allocating pending blocks. */
-
-static struct obstack pending_block_obstack;
-
/* List of blocks already made (lexical contexts already closed).
This is used at the end to make the blockvector. */
struct block *block;
};
-/* Pointer to the head of a linked list of symbol blocks which have
- already been finalized (lexical contexts already closed) and which
- are just waiting to be built into a blockvector when finalizing the
- associated symtab. */
-
-static struct pending_block *pending_blocks;
-
static void free_buildsym_compunit (void);
static int compare_line_numbers (const void *ln1p, const void *ln2p);
struct block *block,
struct pending_block *opblock);
-static void free_pending_blocks ();
-
/* Initial sizes of data structures. These are realloc'd larger if
needed, and realloc'd down to the size actually used, when
completed. */
return (NULL);
}
-scoped_free_pendings::scoped_free_pendings ()
-{
- gdb_assert (pending_blocks == nullptr);
-}
-
/* At end of reading syms, or in case of quit, ensure everything
associated with building symtabs is freed.
}
free_pendings = NULL;
- free_pending_blocks ();
-
for (next = file_symbols; next != NULL; next = next1)
{
next1 = next->next;
free_buildsym_compunit ();
}
-/* This function is called to discard any pending blocks. */
-
-static void
-free_pending_blocks ()
-{
- if (pending_blocks != NULL)
- {
- obstack_free (&pending_block_obstack, NULL);
- pending_blocks = NULL;
- }
-}
-
/* Take one of the lists of symbols and make a block from it. Keep
the order the symbols have in the list (reversed from the input
file). Put the block on the list of pending blocks. */
start of this scope that don't have superblocks yet. */
opblock = NULL;
- for (pblock = pending_blocks;
+ for (pblock = buildsym_compunit->m_pending_blocks;
pblock && pblock != old_blocks;
pblock = pblock->next)
{
{
struct pending_block *pblock;
- if (pending_blocks == NULL)
- obstack_init (&pending_block_obstack);
-
- pblock = XOBNEW (&pending_block_obstack, struct pending_block);
+ pblock = XOBNEW (&buildsym_compunit->m_pending_block_obstack,
+ struct pending_block);
pblock->block = block;
if (opblock)
{
}
else
{
- pblock->next = pending_blocks;
- pending_blocks = pblock;
+ pblock->next = buildsym_compunit->m_pending_blocks;
+ buildsym_compunit->m_pending_blocks = pblock;
}
}
/* Count the length of the list of blocks. */
- for (next = pending_blocks, i = 0; next; next = next->next, i++)
- {;
+ for (next = buildsym_compunit->m_pending_blocks, i = 0;
+ next;
+ next = next->next, i++)
+ {
}
blockvector = (struct blockvector *)
sure this is true. */
BLOCKVECTOR_NBLOCKS (blockvector) = i;
- for (next = pending_blocks; next; next = next->next)
+ for (next = buildsym_compunit->m_pending_blocks; next; next = next->next)
{
BLOCKVECTOR_BLOCK (blockvector, --i) = next->block;
}
- free_pending_blocks ();
+ buildsym_compunit->free_pending_blocks ();
/* If we needed an address map for this symtab, record it in the
blockvector. */
/* Reordered executables may have out of order pending blocks; if
OBJF_REORDERED is true, then sort the pending blocks. */
- if ((objfile->flags & OBJF_REORDERED) && pending_blocks)
+ if ((objfile->flags & OBJF_REORDERED) && buildsym_compunit->m_pending_blocks)
{
struct pending_block *pb;
std::vector<block *> barray;
- for (pb = pending_blocks; pb != NULL; pb = pb->next)
+ for (pb = buildsym_compunit->m_pending_blocks; pb != NULL; pb = pb->next)
barray.push_back (pb->block);
/* Sort blocks by start address in descending order. Blocks with the
});
int i = 0;
- for (pb = pending_blocks; pb != NULL; pb = pb->next)
+ for (pb = buildsym_compunit->m_pending_blocks; pb != NULL; pb = pb->next)
pb->block = barray[i++];
}
finish_global_stabs (objfile);
if (!required
- && pending_blocks == NULL
+ && buildsym_compunit->m_pending_blocks == NULL
&& file_symbols == NULL
&& global_symbols == NULL
&& !buildsym_compunit->m_have_line_numbers
if (!buildsym_compunit->m_context_stack.empty ())
complaint (_("Context stack not empty in augment_type_symtab"));
- if (pending_blocks != NULL)
+ if (buildsym_compunit->m_pending_blocks != NULL)
complaint (_("Blocks in a type symtab"));
if (buildsym_compunit->m_pending_macros != NULL)
complaint (_("Macro in a type symtab"));
newobj->depth = desc;
newobj->locals = local_symbols;
- newobj->old_blocks = pending_blocks;
+ newobj->old_blocks = buildsym_compunit->m_pending_blocks;
newobj->start_addr = valu;
newobj->local_using_directives
= buildsym_compunit->m_local_using_directives;
/* Ensure the scoped_free_pendings destructor was called after
the last time. */
gdb_assert (free_pendings == NULL);
- gdb_assert (pending_blocks == NULL);
gdb_assert (file_symbols == NULL);
gdb_assert (global_symbols == NULL);
gdb_assert (buildsym_compunit == NULL);