/* Helper function for finalization code - add node into lists so it will
be analyzed and compiled. */
static void
varpool_enqueue_needed_node (struct varpool_node *node)
{
if (varpool_last_needed_node)
varpool_last_needed_node->next_needed = node;
varpool_last_needed_node = node;
node->next_needed = NULL;
if (!varpool_nodes_queue)
varpool_nodes_queue = node;
if (!varpool_first_unanalyzed_node)
varpool_first_unanalyzed_node = node;
notice_global_symbol (node->decl);
}
/* Helper function for finalization code - add node into lists so it will
be analyzed and compiled. */
static void
varpool_enqueue_needed_node (struct varpool_node *node)
{
if (varpool_last_needed_node)
{
varpool_last_needed_node->next_needed = node;
node->prev_needed = varpool_last_needed_node;
}
x_varpool_last_needed_node = (symtab_node)node;
node->next_needed = NULL;
if (!varpool_nodes_queue)
x_varpool_nodes_queue = (symtab_node)node;
if (!varpool_first_unanalyzed_node)
x_varpool_first_unanalyzed_node = (symtab_node)node;
notice_global_symbol (node->symbol.decl);
}
void
cgraph_finalize_function (tree decl, bool nested)
{
struct cgraph_node *node = cgraph_node (decl);
if (node->local.finalized)
cgraph_reset_node (node);
node->pid = cgraph_max_pid ++;
notice_global_symbol (decl);
node->local.finalized = true;
node->lowered = DECL_STRUCT_FUNCTION (decl)->cfg != NULL;
record_cdtor_fn (node->decl);
if (node->nested)
lower_nested_functions (decl);
gcc_assert (!node->nested);
if (decide_is_function_needed (node, decl))
cgraph_mark_needed_node (node);
/* Since we reclaim unreachable nodes at the end of every language
level unit, we need to be conservative about possible entry points
there. */
if ((TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)))
cgraph_mark_reachable_node (node);
/* If we've not yet emitted decl, tell the debug info about it. */
if (!TREE_ASM_WRITTEN (decl))
(*debug_hooks->deferred_inline_function) (decl);
/* Possibly warn about unused parameters. */
if (warn_unused_parameter)
do_warn_unused_parameter (decl);
if (!nested)
ggc_collect ();
}
