/* Callgraph based intraprocedural optimizations.
- Copyright (C) 2003, 2004 Free Software Foundation, Inc.
+ Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
Contributed by Jan Hubicka
This file is part of GCC.
mark_referenced call in assemble_variable functions referenced by
static variables are noticed too.
- The intra-procedural information is produced and it's existence
+ The intra-procedural information is produced and its existence
indicated by global_info_ready. Once this flag is set it is impossible
to change function from !reachable to reachable and thus
assemble_variable no longer call mark_referenced.
only one function at a time and is used in non-unit-at-a-time mode. */
-/* Additionally this file gathers information about how local statics
- are used. This is done in cgraph_characterize_statics. After the
- call graph has been built, each function is analyzed to determine
- which local static variables are either read or written or have
- their address taken. Any local static that has its address taken
- is removed from consideration. Once the local read and writes
- are determined, a transitive closure of this information is
- performed over the call graph to determine the worst case set of
- side effects of each call. In a later part of the compiler, these
- local and global sets are examined to make the call clobbering less
- traumatic both with respect to aliasing and to code generation. */
-
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tree-flow.h"
#include "tree-inline.h"
#include "langhooks.h"
-#include "hashtab.h"
+#include "pointer-set.h"
#include "toplev.h"
#include "flags.h"
#include "ggc.h"
#include "intl.h"
#include "function.h"
#include "tree-gimple.h"
+#include "output.h"
#define INSNS_PER_CALL 10
static void cgraph_mark_functions_to_output (void);
static void cgraph_expand_function (struct cgraph_node *);
static tree record_call_1 (tree *, int *, void *);
-static void cgraph_mark_local_and_external_functions (void);
+static void cgraph_mark_local_functions (void);
static bool cgraph_default_inline_p (struct cgraph_node *n);
static void cgraph_analyze_function (struct cgraph_node *node);
static void cgraph_decide_inlining_incrementally (struct cgraph_node *);
walk_tree_without_duplicates doesn't guarantee each node is visited
once because it gets a new htab upon each recursive call from
record_calls_1. */
-static htab_t visited_nodes;
+static struct pointer_set_t *visited_nodes;
static FILE *cgraph_dump_file;
-/* These splay trees contain all of the static variables that are
- being considered by the compilation level alias analysis. For
- module_at_a_time compilation, this is the set of static but not
- public variables. Any variables that either have their address
- taken or participate in otherwise unsavory operations are deleted
- from this list. */
-static GTY((param1_is(tree), param2_is(tree)))
- splay_tree static_vars_to_consider_by_tree;
-
-/* FIXME -- PROFILE-RESTRUCTURE: change comment from DECL_UID to var-ann. */
-/* same as above but indexed by DECL_UID */
-static GTY((param1_is(int), param2_is(tree)))
- splay_tree static_vars_to_consider_by_uid;
-
-/* This bitmap is used to knock out the module static variables whose
- addresses have been taken and passed around. This is indexed by
- uid. */
-static bitmap module_statics_escape;
-
-/* FIXME -- PROFILE-RESTRUCTURE: change comment from DECL_UID to var-ann. */
-/* A bit is set for every module static we are considering and is
- indexed by DECL_UID. This is ored into the local info when asm
- code is found that clobbers all memory. */
-static GTY(()) bitmap all_module_statics;
-
-/* Holds the value of "memory". */
-static tree memory_identifier;
-
/* Determine if function DECL is needed. That is, visible to something
either outside this translation unit, something magic in the system
configury, or (if not doing unit-at-a-time) to something we havn't
static bool
decide_is_function_needed (struct cgraph_node *node, tree decl)
{
- struct cgraph_node *origin;
+ tree origin;
/* If we decided it was needed before, but at the time we didn't have
the body of the function available, then it's still needed. We have
return false;
/* Nested functions of extern inline function shall not be emit unless
we inlined the origin. */
- for (origin = node->origin; origin; origin = origin->origin)
- if (DECL_EXTERNAL (origin->decl))
+ for (origin = decl_function_context (decl); origin;
+ origin = decl_function_context (origin))
+ if (DECL_EXTERNAL (origin))
return false;
/* We want to emit COMDAT functions only when absolutely necessary. */
if (DECL_COMDAT (decl))
return false;
}
-/* Debugging function for postorder and inorder code. NOTE is a string
- that is printed before the nodes are printed. ORDER is an array of
- cgraph_nodes that has COUNT useful nodes in it. */
-
-static void
-print_order (const char * note, struct cgraph_node** order, int count)
-{
- int i;
- fprintf (cgraph_dump_file, "\n\n ordered call graph: %s\n", note);
-
- for (i = count - 1; i >= 0; i--)
- {
- struct cgraph_edge *edge;
-
- fprintf (cgraph_dump_file, "\n %s<-(", cgraph_node_name (order[i]));
-
- for (edge = order[i]->callers; edge; edge = edge->next_caller)
- fprintf (cgraph_dump_file, " %s", cgraph_node_name (edge->caller));
- fprintf (cgraph_dump_file, ")");
- }
- fprintf (cgraph_dump_file, "\n");
-}
-
-/* FIXME -- PROFILE-RESTRUCTURE: Remove this function, it becomes a nop. */
-/* Convert IN_DECL bitmap which is indexed by DECL_UID to IN_ANN, a
- bitmap indexed by var_ann (VAR_DECL)->uid. */
-
-static void
-convert_UIDs_in_bitmap (bitmap in_ann, bitmap in_decl)
+/* Walk the decls we marked as necessary and see if they reference new
+ variables or functions and add them into the worklists. */
+static bool
+cgraph_varpool_analyze_pending_decls (void)
{
- int index;
- EXECUTE_IF_SET_IN_BITMAP(in_decl, 0, index,
- {
- splay_tree_node n =
- splay_tree_lookup (static_vars_to_consider_by_uid, index);
- if (n != NULL)
- {
- tree t = (tree)n->value;
- var_ann_t va = var_ann (t);
- if (va)
- bitmap_set_bit(in_ann, va->uid);
- }
- });
-}
+ bool changed = false;
+ timevar_push (TV_CGRAPH);
-/* FIXME -- PROFILE-RESTRUCTURE: Delete all stmts initing *_decl_uid
- variables. Add code to create a var_ann for tree node within the
- cgraph_node and have it point to the newly created
- static_vars_info. */
-/* Create a new static_vars_info structure and place it into
- cgraph_node, NODE. INIT_GLOBAL causes the global part of the
- structure to be initialized. */
-static static_vars_info_t
-new_static_vars_info(struct cgraph_node* node,
- bool init_global)
-{
- static_vars_info_t info = ggc_calloc (1, sizeof (struct static_vars_info_d));
- local_static_vars_info_t l
- = ggc_calloc (1, sizeof (struct local_static_vars_info_d));
+ while (cgraph_varpool_first_unanalyzed_node)
+ {
+ tree decl = cgraph_varpool_first_unanalyzed_node->decl;
- /* Add the info to the tree's annotation. */
- var_ann_t var_ann = get_var_ann(node->decl);
- node->static_vars_info = info;
- var_ann->static_vars_info = info;
+ cgraph_varpool_first_unanalyzed_node->analyzed = true;
- info->local = l;
- l->statics_read_by_decl_uid = BITMAP_GGC_ALLOC ();
- l->statics_written_by_decl_uid = BITMAP_GGC_ALLOC ();
+ cgraph_varpool_first_unanalyzed_node = cgraph_varpool_first_unanalyzed_node->next_needed;
- if (init_global)
- {
- global_static_vars_info_t g
- = ggc_calloc (1, sizeof (struct global_static_vars_info_d));
- info->global = g;
- g->statics_read_by_decl_uid = BITMAP_GGC_ALLOC ();
- g->statics_written_by_decl_uid = BITMAP_GGC_ALLOC ();
- g->statics_read_by_ann_uid = BITMAP_GGC_ALLOC ();
- g->statics_written_by_ann_uid = BITMAP_GGC_ALLOC ();
- g->statics_not_read_by_decl_uid = BITMAP_GGC_ALLOC ();
- g->statics_not_written_by_decl_uid = BITMAP_GGC_ALLOC ();
- g->statics_not_read_by_ann_uid = BITMAP_GGC_ALLOC ();
- g->statics_not_written_by_ann_uid = BITMAP_GGC_ALLOC ();
+ if (DECL_INITIAL (decl))
+ cgraph_create_edges (NULL, DECL_INITIAL (decl));
+ changed = true;
}
- return info;
+ timevar_pop (TV_CGRAPH);
+ return changed;
}
+/* Optimization of function bodies might've rendered some variables as
+ unnecessary so we want to avoid these from being compiled.
-/* FIXME -- PROFILE-RESTRUCTURE: Remove this function, it becomes a
- nop. */
-/* The bitmaps used to represent the static global variables are
- indexed by DECL_UID however, this is not used inside of functions
- to index the ssa variables. The denser var_ann (VAR_DECL)->uid is
- used there. This function is called from
- tree_dfa:find_referenced_vars after the denser representation is
- built. This function invalidates any cached indexes. */
-
-void
-cgraph_reset_static_var_maps (void)
+ This is done by prunning the queue and keeping only the variables that
+ really appear needed (ie they are either externally visible or referenced
+ by compiled function). Re-doing the reachability analysis on variables
+ brings back the remaining variables referenced by these. */
+static void
+cgraph_varpool_remove_unreferenced_decls (void)
{
- struct cgraph_node *node;
-
- for (node = cgraph_nodes; node; node = node->next)
- {
- static_vars_info_t info = node->static_vars_info;
- if (info)
- {
- global_static_vars_info_t g = info->global;
- if (g->var_anns_valid)
- {
- bitmap_clear (g->statics_read_by_ann_uid);
- bitmap_clear (g->statics_written_by_ann_uid);
- bitmap_clear (g->statics_not_read_by_ann_uid);
- bitmap_clear (g->statics_not_written_by_ann_uid);
- g->var_anns_valid = false;
- }
- }
- else
- /* Handle the case where a cgraph node has been inserted
- after the analysis. We know nothing. */
- new_static_vars_info(node, true);
- }
-}
+ struct cgraph_varpool_node *next, *node = cgraph_varpool_nodes_queue;
-/* Get the global static_vars_info structure for the function FN and
- make sure the ann_uid's bitmaps are properly converted. */
-
-static global_static_vars_info_t
-get_global_static_vars_info (tree fn)
-{
- global_static_vars_info_t g;
+ cgraph_varpool_reset_queue ();
- /* Was not compiled -O2 or higher. */
- static_vars_info_t info = get_var_ann(fn)->static_vars_info;
- if (!info)
- return NULL;
+ if (errorcount || sorrycount)
+ return;
- g = info->global;
- if (!g->var_anns_valid)
+ while (node)
{
- convert_UIDs_in_bitmap (g->statics_read_by_ann_uid,
- g->statics_read_by_decl_uid);
- convert_UIDs_in_bitmap (g->statics_written_by_ann_uid,
- g->statics_written_by_decl_uid);
- convert_UIDs_in_bitmap (g->statics_not_read_by_ann_uid,
- g->statics_not_read_by_decl_uid);
- convert_UIDs_in_bitmap (g->statics_not_written_by_ann_uid,
- g->statics_not_written_by_decl_uid);
- g->var_anns_valid = true;
- }
- return g;
-}
+ tree decl = node->decl;
+ next = node->next_needed;
+ node->needed = 0;
-/* Return a bitmap indexed by var_ann (VAR_DECL)->uid for the static
- variables that are not read during the execution of the function
- FN. Returns NULL if no data is available, such as it was not
- compiled with -O2 or higher. */
+ if (node->finalized
+ && ((DECL_ASSEMBLER_NAME_SET_P (decl)
+ && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)))
+ || node->force_output
+ || decide_is_variable_needed (node, decl)))
+ cgraph_varpool_mark_needed_node (node);
-bitmap
-get_global_statics_not_read (tree fn)
-{
- global_static_vars_info_t g = get_global_static_vars_info (fn);
- if (g)
- return g->statics_not_read_by_ann_uid;
- else
- return NULL;
+ node = next;
+ }
+ cgraph_varpool_analyze_pending_decls ();
}
-/* Return a bitmap indexed by var_ann (VAR_DECL)->uid for the static
- variables that are not written during the execution of the function
- FN. Note that variables written may or may not be read during the
- function call. Returns NULL if no data is available, such as it
- was not compiled with -O2 or higher. */
-
-bitmap
-get_global_statics_not_written (tree fn)
-{
- global_static_vars_info_t g = get_global_static_vars_info (fn);
- if (g)
- return g->statics_not_written_by_ann_uid;
- else
- return NULL;
-}
/* When not doing unit-at-a-time, output all functions enqueued.
Return true when such a functions were found. */
cgraph_nodes_queue = cgraph_nodes_queue->next_needed;
n->next_needed = NULL;
- if (!n->global.inlined_to && !DECL_EXTERNAL (n->decl))
+ if (!n->global.inlined_to
+ && !n->alias
+ && !DECL_EXTERNAL (n->decl))
{
cgraph_expand_function (n);
output = true;
memset (&node->rtl, 0, sizeof (node->rtl));
node->analyzed = false;
node->local.redefined_extern_inline = true;
- while (node->callees)
- cgraph_remove_edge (node->callees);
+
+ if (!flag_unit_at_a_time)
+ {
+ struct cgraph_node *n;
+
+ for (n = cgraph_nodes; n; n = n->next)
+ if (n->global.inlined_to == node)
+ cgraph_remove_node (n);
+ }
+
+ cgraph_node_remove_callees (node);
/* We may need to re-queue the node for assembling in case
we already proceeded it and ignored as not needed. */
notice_global_symbol (decl);
node->decl = decl;
node->local.finalized = true;
+ if (node->nested)
+ lower_nested_functions (decl);
+ gcc_assert (!node->nested);
/* If not unit at a time, then we need to create the call graph
now, so that called functions can be queued and emitted now. */
/* ??? Really, we should mark this decl as *potentially* referenced
by this function and re-examine whether the decl is actually used
after rtl has been generated. */
- if (TREE_STATIC (t))
+ if (TREE_STATIC (t) || DECL_EXTERNAL (t))
{
cgraph_varpool_mark_needed_node (cgraph_varpool_node (t));
if (lang_hooks.callgraph.analyze_expr)
}
break;
+ case FDESC_EXPR:
case ADDR_EXPR:
if (flag_unit_at_a_time)
{
default:
/* Save some cycles by not walking types and declaration as we
won't find anything useful there anyway. */
- if (DECL_P (*tp) || TYPE_P (*tp))
+ if (IS_TYPE_OR_DECL_P (*tp))
{
*walk_subtrees = 0;
break;
{
/* The nodes we're interested in are never shared, so walk
the tree ignoring duplicates. */
- visited_nodes = htab_create (37, htab_hash_pointer,
- htab_eq_pointer, NULL);
+ visited_nodes = pointer_set_create ();
walk_tree (&body, record_call_1, node, visited_nodes);
- htab_delete (visited_nodes);
+ pointer_set_destroy (visited_nodes);
visited_nodes = NULL;
}
static bool error_found;
-/* Callbrack of verify_cgraph_node. Check that all call_exprs have cgraph
- nodes. */
+/* Callback of verify_cgraph_node. Check that all call_exprs have
+ cgraph nodes. */
static tree
verify_cgraph_node_1 (tree *tp, int *walk_subtrees, void *data)
/* Save some cycles by not walking types and declaration as we
won't find anything useful there anyway. */
- if (DECL_P (*tp) || TYPE_P (*tp))
+ if (IS_TYPE_OR_DECL_P (*tp))
*walk_subtrees = 0;
return NULL_TREE;
verify_cgraph_node (node);
}
+
+/* Output all variables enqueued to be assembled. */
+bool
+cgraph_varpool_assemble_pending_decls (void)
+{
+ bool changed = false;
+
+ if (errorcount || sorrycount)
+ return false;
+
+ /* EH might mark decls as needed during expansion. This should be safe since
+ we don't create references to new function, but it should not be used
+ elsewhere. */
+ cgraph_varpool_analyze_pending_decls ();
+
+ while (cgraph_varpool_nodes_queue)
+ {
+ tree decl = cgraph_varpool_nodes_queue->decl;
+ struct cgraph_varpool_node *node = cgraph_varpool_nodes_queue;
+
+ cgraph_varpool_nodes_queue = cgraph_varpool_nodes_queue->next_needed;
+ if (!TREE_ASM_WRITTEN (decl) && !node->alias && !DECL_EXTERNAL (decl))
+ {
+ assemble_variable (decl, 0, 1, 0);
+ changed = true;
+ }
+ node->next_needed = NULL;
+ }
+ return changed;
+}
+
/* Analyze the function scheduled to be output. */
static void
cgraph_analyze_function (struct cgraph_node *node)
cgraph_finalize_compilation_unit (void)
{
struct cgraph_node *node;
+ /* Keep track of already processed nodes when called multiple times for
+ intermodule optimization. */
+ static struct cgraph_node *first_analyzed;
+
+ finish_aliases_1 ();
if (!flag_unit_at_a_time)
{
return;
}
- cgraph_varpool_assemble_pending_decls ();
if (!quiet_flag)
- fprintf (stderr, "\nAnalyzing compilation unit\n");
+ {
+ fprintf (stderr, "\nAnalyzing compilation unit");
+ fflush (stderr);
+ }
timevar_push (TV_CGRAPH);
+ cgraph_varpool_analyze_pending_decls ();
if (cgraph_dump_file)
{
fprintf (cgraph_dump_file, "Initial entry points:");
- for (node = cgraph_nodes; node; node = node->next)
+ for (node = cgraph_nodes; node != first_analyzed; node = node->next)
if (node->needed && DECL_SAVED_TREE (node->decl))
fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
fprintf (cgraph_dump_file, "\n");
if (!edge->callee->reachable)
cgraph_mark_reachable_node (edge->callee);
- cgraph_varpool_assemble_pending_decls ();
+ cgraph_varpool_analyze_pending_decls ();
}
/* Collect entry points to the unit. */
if (cgraph_dump_file)
{
fprintf (cgraph_dump_file, "Unit entry points:");
- for (node = cgraph_nodes; node; node = node->next)
+ for (node = cgraph_nodes; node != first_analyzed; node = node->next)
if (node->needed && DECL_SAVED_TREE (node->decl))
fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
fprintf (cgraph_dump_file, "\n\nInitial ");
if (cgraph_dump_file)
fprintf (cgraph_dump_file, "\nReclaiming functions:");
- for (node = cgraph_nodes; node; node = node->next)
+ for (node = cgraph_nodes; node != first_analyzed; node = node->next)
{
tree decl = node->decl;
fprintf (cgraph_dump_file, "\n\nReclaimed ");
dump_cgraph (cgraph_dump_file);
}
+ first_analyzed = cgraph_nodes;
ggc_collect ();
timevar_pop (TV_CGRAPH);
}
DECL_INITIAL (node->decl) = error_mark_node;
/* Eliminate all call edges. This is important so the call_expr no longer
points to the dead function body. */
- while (node->callees)
- cgraph_remove_edge (node->callees);
+ cgraph_node_remove_callees (node);
}
}
return order_pos;
}
-struct searchc_env {
- struct cgraph_node **stack;
- int stack_size;
- struct cgraph_node **result;
- int order_pos;
- splay_tree nodes_marked_new;
- bool reduce;
- int count;
-};
-
-struct dfs_info {
- int dfn_number;
- int low_link;
- bool new;
- bool on_stack;
-};
-
-/* This is an implementation of Tarjan's strongly connected region
- finder as reprinted in Aho Hopcraft and Ullman's The Design and
- Analysis of Computer Programs (1975) pages 192-193. This version
- has been customized for cgraph_nodes. The env parameter is because
- it is recursive and there are no nested functions here. This
- function should only be called from itself or
- cgraph_reduced_inorder. ENV is a stack env and would be
- unnecessary if C had nested functions. V is the node to start
- searching from. */
-
-static void
-searchc (struct searchc_env* env, struct cgraph_node *v)
-{
- struct cgraph_edge *edge;
- struct dfs_info *v_info = v->aux;
-
- /* mark node as old */
- v_info->new = false;
- splay_tree_remove (env->nodes_marked_new, v->uid);
-
- v_info->dfn_number = env->count;
- v_info->low_link = env->count;
- env->count++;
- env->stack[(env->stack_size)++] = v;
- v_info->on_stack = true;
-
- for (edge = v->callers; edge; edge = edge->next_caller)
- {
- struct dfs_info * w_info;
- struct cgraph_node *w = edge->caller;
- /* skip the nodes that we are supposed to ignore */
- if (w->aux)
- {
- w_info = w->aux;
- if (w_info->new)
- {
- searchc (env, w);
- v_info->low_link =
- (v_info->low_link < w_info->low_link) ?
- v_info->low_link : w_info->low_link;
- }
- else
- if ((w_info->dfn_number < v_info->dfn_number)
- && (w_info->on_stack))
- v_info->low_link =
- (w_info->dfn_number < v_info->low_link) ?
- w_info->dfn_number : v_info->low_link;
- }
- }
-
-
- if (v_info->low_link == v_info->dfn_number)
- {
- struct cgraph_node *last = NULL;
- struct cgraph_node *x;
- struct dfs_info *x_info;
- do {
- x = env->stack[--(env->stack_size)];
- x_info = x->aux;
- x_info->on_stack = false;
-
- if (env->reduce)
- {
- x->next_cycle = last;
- last = x;
- }
- else
- env->result[env->order_pos++] = x;
- }
- while (v != x);
- if (env->reduce)
- env->result[env->order_pos++] = v;
- }
-}
-
-/* Topsort the call graph by caller relation. Put the result in ORDER.
-
- The REDUCE flag is true if you want the cycles reduced to single
- nodes. Only consider nodes that have the output bit set. */
-
-static int
-cgraph_reduced_inorder (struct cgraph_node **order, bool reduce)
-{
- struct cgraph_node *node;
- struct searchc_env env;
- splay_tree_node result;
- env.stack = xcalloc (cgraph_n_nodes, sizeof (struct cgraph_node *));
- env.stack_size = 0;
- env.result = order;
- env.order_pos = 0;
- env.nodes_marked_new = splay_tree_new (splay_tree_compare_ints, 0, 0);
- env.count = 1;
- env.reduce = reduce;
-
- for (node = cgraph_nodes; node; node = node->next)
- if (node->output)
- {
- struct dfs_info *info = xcalloc (1, sizeof (struct dfs_info));
- info->new = true;
- info->on_stack = false;
- node->aux = info;
- node->next_cycle = NULL;
-
- splay_tree_insert (env.nodes_marked_new,
- node->uid, (splay_tree_value)node);
- }
- else
- node->aux = NULL;
- result = splay_tree_min (env.nodes_marked_new);
- while (result)
- {
- node = (struct cgraph_node *)result->value;
- searchc (&env, node);
- result = splay_tree_min (env.nodes_marked_new);
- }
- splay_tree_delete (env.nodes_marked_new);
- free (env.stack);
-
- for (node = cgraph_nodes; node; node = node->next)
- if (node->aux)
- {
- free (node->aux);
- node->aux = NULL;
- }
- return env.order_pos;
-}
/* Perform reachability analysis and reclaim all unreachable nodes.
This function also remove unneeded bodies of extern inline functions
DECL_STRUCT_FUNCTION (node->decl) = NULL;
DECL_INITIAL (node->decl) = error_mark_node;
}
- while (node->callees)
- cgraph_remove_edge (node->callees);
+ cgraph_node_remove_callees (node);
node->analyzed = false;
}
else
cgraph_estimate_size_after_inlining (int times, struct cgraph_node *to,
struct cgraph_node *what)
{
- return (what->global.insns - INSNS_PER_CALL) * times + to->global.insns;
+ tree fndecl = what->decl;
+ tree arg;
+ int call_insns = PARAM_VALUE (PARAM_INLINE_CALL_COST);
+ for (arg = DECL_ARGUMENTS (fndecl); arg; arg = TREE_CHAIN (arg))
+ call_insns += estimate_move_cost (TREE_TYPE (arg));
+ return (what->global.insns - call_insns) * times + to->global.insns;
}
/* Estimate the growth caused by inlining NODE into all callees. */
to->global.insns = new_insns;
}
gcc_assert (what->global.inlined_to == to);
- overall_insns += new_insns - old_insns;
+ if (new_insns > old_insns)
+ overall_insns += new_insns - old_insns;
ncalls_inlined++;
}
return !e->inline_failed;
}
-/* FIXME this needs to be enhanced. If we are compiling a single
- module this returns true if the variable is a module level static,
- but if we are doing whole program compilation, this could return
- true if TREE_PUBLIC is true. */
-/* Return true if the variable T is the right kind of static variable to
- perform compilation unit scope escape analysis. */
-
-static inline
-bool has_proper_scope_for_analysis (tree t)
-{
- return (TREE_STATIC(t)) && !(TREE_PUBLIC(t)) && !(TREE_THIS_VOLATILE(t));
-}
-
-/* Check to see if T is a read or address of operation on a static var
- we are interested in analyzing. FN is passed in to get access to
- its bit vectors. */
-
-static void
-check_rhs_var (struct cgraph_node *fn, tree t)
-{
- if (TREE_CODE (t) == ADDR_EXPR)
- {
- tree x = TREE_OPERAND (t, 0);
- if ((TREE_CODE (x) == VAR_DECL) && has_proper_scope_for_analysis (x))
- {
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file, "\nadding address:%s",
- lang_hooks.decl_printable_name (x, 2));
-
- /* FIXME -- PROFILE-RESTRUCTURE: Change the call from
- DECL_UID to get the uid from the var_ann field. */
- bitmap_set_bit (module_statics_escape, DECL_UID (x));
- }
- }
- t = get_base_address (t);
- if (!t) return;
- if ((TREE_CODE (t) == VAR_DECL) && has_proper_scope_for_analysis (t))
- {
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file, "\nadding rhs:%s",
- lang_hooks.decl_printable_name (t, 2));
- /* FIXME -- PROFILE-RESTRUCTURE: Change the call from
- DECL_UID to get the uid from the var_ann field. */
- bitmap_set_bit (fn->static_vars_info->local->statics_read_by_decl_uid,
- DECL_UID (t));
- }
-}
-
-/* Check to see if T is an assignment to a static var we are
- interrested in analyzing. FN is passed in to get access to its bit
- vectors.
-*/
-
-static void
-check_lhs_var (struct cgraph_node *fn, tree t)
-{
- t = get_base_address (t);
- if (!t) return;
- if ((TREE_CODE (t) == VAR_DECL) && has_proper_scope_for_analysis (t))
- {
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file, "\nadding lhs:%s",
- lang_hooks.decl_printable_name (t, 2));
-
- /* FIXME -- PROFILE-RESTRUCTURE: Change the call from
- DECL_UID to get the uid from the var_ann field. */
- bitmap_set_bit (fn->static_vars_info->local->statics_written_by_decl_uid,
- DECL_UID (t));
- }
-}
-
-/* This is a scaled down version of get_asm_expr_operands from
- tree_ssa_operands.c. The version there runs much later and assumes
- that aliasing information is already available. Here we are just
- trying to find if the set of inputs and outputs contain references
- or address of operations to local static variables. FN is the
- function being analyzed and STMT is the actual asm statement. */
-
-static void
-get_asm_expr_operands (struct cgraph_node * fn, tree stmt)
-{
- int noutputs = list_length (ASM_OUTPUTS (stmt));
- const char **oconstraints
- = (const char **) alloca ((noutputs) * sizeof (const char *));
- int i;
- tree link;
- const char *constraint;
- bool allows_mem, allows_reg, is_inout;
-
- for (i=0, link = ASM_OUTPUTS (stmt); link; ++i, link = TREE_CHAIN (link))
- {
- oconstraints[i] = constraint
- = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
- parse_output_constraint (&constraint, i, 0, 0,
- &allows_mem, &allows_reg, &is_inout);
-
- /* Memory operands are addressable. Note that STMT needs the
- address of this operand. */
- if (!allows_reg && allows_mem)
- {
- check_lhs_var (fn, TREE_VALUE (link));
- }
- }
-
- for (link = ASM_INPUTS (stmt); link; link = TREE_CHAIN (link))
- {
- constraint
- = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
- parse_input_constraint (&constraint, 0, 0, noutputs, 0,
- oconstraints, &allows_mem, &allows_reg);
-
- /* Memory operands are addressable. Note that STMT needs the
- address of this operand. */
- if (!allows_reg && allows_mem)
- {
- check_rhs_var (fn, TREE_VALUE (link));
- }
- }
-
- for (link = ASM_CLOBBERS (stmt); link; link = TREE_CHAIN (link))
- if (TREE_VALUE (link) == memory_identifier)
- {
- /* Abandon all hope, ye who enter here. */
- local_static_vars_info_t l = fn->static_vars_info->local;
- bitmap_a_or_b (l->statics_read_by_decl_uid,
- l->statics_read_by_decl_uid,
- all_module_statics);
- bitmap_a_or_b (l->statics_written_by_decl_uid,
- l->statics_written_by_decl_uid,
- all_module_statics);
-
- }
-}
-
-/* Check the parameters of a function call from CALLER to CALL_EXPR to
- see if any of them are static vars. Also check to see if this is
- either an indirect call, a call outside the compilation unit, or
- has special attributes that effect the clobbers. The caller
- parameter is the tree node for the caller and the second operand is
- the tree node for the entire call expression. */
-static void
-process_call_for_static_vars(struct cgraph_node * caller, tree call_expr)
-{
- int flags = call_expr_flags(call_expr);
- tree operandList = TREE_OPERAND (call_expr, 1);
- tree operand;
-
- for (operand = operandList;
- operand != NULL_TREE;
- operand = TREE_CHAIN (operand))
- {
- tree argument = TREE_VALUE (operand);
- check_rhs_var (caller, argument);
- }
-
- /* Const and pure functions have less clobber effects than other
- functions so we process these first. Otherwise if it is a call
- outside the compilation unit or an indirect call we punt. This
- leaves local calls which will be processed by following the call
- graph. */
- if (flags & ECF_CONST)
- return;
- else if (flags & ECF_PURE)
- caller->local.calls_write_all = true;
- else
- {
- tree callee_t = get_callee_fndecl (call_expr);
- if (callee_t == NULL)
- {
- /* Indirect call. */
- caller->local.calls_read_all = true;
- caller->local.calls_write_all = true;
- }
- else
- {
- struct cgraph_node* callee = cgraph_node(callee_t);
-
- if (callee->local.external)
- {
- caller->local.calls_read_all = true;
- caller->local.calls_write_all = true;
- }
- }
- }
-}
-/* FIXME -- PROFILE-RESTRUCTURE: Change to walk by explicitly walking
- the basic blocks rather than calling walktree. */
-
-/* Walk tree and record all calls. Called via walk_tree. FIXME When
- this is moved into the tree-profiling-branch, and is dealing with
- low GIMPLE, this routine should be changed to use tree iterators
- rather than being a walk_tree callback. The data is the function
- that is being scanned. */
-/* TP is the part of the tree currently under the
- microscope. WALK_SUBTREES is part of the walk_tree api but is
- unused here. DATA is cgraph_node of the function being walked. */
-
-static tree
-scan_for_static_refs (tree *tp,
- int *walk_subtrees ATTRIBUTE_UNUSED,
- void *data)
-{
- struct cgraph_node *fn = data;
- tree t = *tp;
-
- switch (TREE_CODE (t))
- {
- case MODIFY_EXPR:
- {
- /* First look on the lhs and see what variable is stored to */
- tree rhs = TREE_OPERAND (t, 1);
- check_lhs_var (fn, TREE_OPERAND (t, 0));
- /* Next check the operands on the rhs to see if they are ok. */
- switch (TREE_CODE_CLASS (TREE_CODE (rhs))) {
- case '2':
- check_rhs_var (fn, TREE_OPERAND (rhs, 0));
- check_rhs_var (fn, TREE_OPERAND (rhs, 1));
- break;
- case '1':
- case 'r':
- check_rhs_var (fn, TREE_OPERAND (rhs, 0));
- break;
- case 'd':
- check_rhs_var (fn, rhs);
- break;
- case 'e':
- switch (TREE_CODE (rhs)) {
- case ADDR_EXPR:
- check_rhs_var (fn, rhs);
- break;
- case CALL_EXPR:
- process_call_for_static_vars (fn, rhs);
- break;
- default:
- break;
- }
- break;
- default:
- break;
- }
- }
- break;
-
-
- case CALL_EXPR:
- process_call_for_static_vars (fn, t);
- break;
-
- case ASM_EXPR:
- get_asm_expr_operands (fn, t);
- break;
-
- default:
- break;
- }
- return NULL;
-}
-
-
-/* This is the main routine for finding the reference patterns for
- global variables within a function FN */
- static void
-cgraph_characterize_statics_local (struct cgraph_node *fn)
-{
- tree decl = fn->decl;
- static_vars_info_t info = new_static_vars_info(fn, false);
- local_static_vars_info_t l = info->local;
-
-
- /* The nodes we're interested in are never shared, so walk
- the tree ignoring duplicates. */
- visited_nodes = htab_create (37, htab_hash_pointer,
- htab_eq_pointer, NULL);
-
- /* FIXME -- PROFILE-RESTRUCTURE: Remove creation of _decl_uid vars. */
- l->statics_read_by_decl_uid = BITMAP_GGC_ALLOC ();
- l->statics_written_by_decl_uid = BITMAP_GGC_ALLOC ();
-
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file, "\n local analysis of %s", cgraph_node_name (fn));
-
- walk_tree (&DECL_SAVED_TREE (decl), scan_for_static_refs, fn, visited_nodes);
- htab_delete (visited_nodes);
- visited_nodes = NULL;
-}
-
-/* Lookup the tree node for the static variable that has UID and
- conver the name to a string for debugging. */
-static const char *
-cgraph_get_static_name_by_uid (int index)
-{
- splay_tree_node stn = splay_tree_lookup (static_vars_to_consider_by_uid, index);
- if (stn)
- return lang_hooks.decl_printable_name ((tree)(stn->value), 2);
- return NULL;
-}
-
-/* Clear out any the static variable with uid INDEX from further
- consideration because it escapes (i.e. has had its address
- taken). */
-static void
-clear_static_vars_maps (int index)
-{
- splay_tree_node stn = splay_tree_lookup (static_vars_to_consider_by_uid, index);
- if (stn)
- {
- splay_tree_remove (static_vars_to_consider_by_tree, stn->value);
- splay_tree_remove (static_vars_to_consider_by_uid, index);
- }
-}
-
-/* FIXME -- PROFILE-RESTRUCTURE: Change all *_decl_uid to *_ann_uid. */
-
-/* Or in all of the bits from every callee into X, the caller's, bit
- vector. There are several cases to check to avoid the sparse
- bitmap oring. */
-static void
-cgraph_propagate_bits (struct cgraph_node *x)
-{
- static_vars_info_t x_info = x->static_vars_info;
- global_static_vars_info_t x_global = x_info->global;
-
- struct cgraph_edge *e;
- for (e = x->callees; e; e = e->next_callee)
- {
- struct cgraph_node *y = e->callee;
-
- /* We are only going to look at edges that point to nodes that
- have their output bit set. */
- if (y->output)
- {
- static_vars_info_t y_info;
- global_static_vars_info_t y_global;
- y_info = y->static_vars_info;
- y_global = y_info->global;
-
- if (x_global->statics_read_by_decl_uid != all_module_statics)
- {
- if (y_global->statics_read_by_decl_uid == all_module_statics)
- x_global->statics_read_by_decl_uid = all_module_statics;
- /* Skip bitmaps that are pointer equal to node's bitmap
- (no reason to spin within the cycle). */
- else if (x_global->statics_read_by_decl_uid != y_global->statics_read_by_decl_uid)
- bitmap_a_or_b (x_global->statics_read_by_decl_uid,
- x_global->statics_read_by_decl_uid,
- y_global->statics_read_by_decl_uid);
- }
-
- if (x_global->statics_written_by_decl_uid != all_module_statics)
- {
- if (y_global->statics_written_by_decl_uid == all_module_statics)
- x_global->statics_written_by_decl_uid = all_module_statics;
- /* Skip bitmaps that are pointer equal to node's bitmap
- (no reason to spin within the cycle). */
- else if (x_global->statics_written_by_decl_uid != y_global->statics_written_by_decl_uid)
- bitmap_a_or_b (x_global->statics_written_by_decl_uid,
- x_global->statics_written_by_decl_uid,
- y_global->statics_written_by_decl_uid);
- }
- }
- }
-}
-
-/* FIXME -- PROFILE-RESTRUCTURE: Change all *_decl_uid to *_ann_uid
- except where noted below. */
-
-/* The main routine for analyzing global static variable usage. See
- comments at top for description. */
-
-static void
-cgraph_characterize_statics (void)
-{
- struct cgraph_node *node;
- struct cgraph_node *w;
- struct cgraph_node **order =
- xcalloc (cgraph_n_nodes, sizeof (struct cgraph_node *));
- int order_pos = 0;
- int i;
-
- struct cgraph_varpool_node *vnode;
- tree global;
-
- /* get rid of the splay trees from the previous compilation unit. */
-
- static_vars_to_consider_by_tree =
- splay_tree_new_ggc (splay_tree_compare_pointers);
- static_vars_to_consider_by_uid =
- splay_tree_new_ggc (splay_tree_compare_ints);
-
- if (module_statics_escape)
- {
- bitmap_clear (module_statics_escape);
- bitmap_clear (all_module_statics);
- }
- else
- {
- module_statics_escape = BITMAP_XMALLOC ();
- all_module_statics = BITMAP_GGC_ALLOC ();
- }
-
- /* Find all of the global variables that we wish to analyze. */
- for (vnode = cgraph_varpool_nodes_queue; vnode; vnode = vnode->next_needed)
- {
- global = vnode->decl;
- if ((TREE_CODE (global) == VAR_DECL) &&
- has_proper_scope_for_analysis (global))
- {
- splay_tree_insert (static_vars_to_consider_by_tree,
- (splay_tree_key) global,
- (splay_tree_value) global);
- /* FIXME -- PROFILE-RESTRUCTURE: Change the call from
- DECL_UID to get the uid from the var_ann field. */
- splay_tree_insert (static_vars_to_consider_by_uid,
- DECL_UID (global), (splay_tree_value)global);
-
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file, "\nConsidering global:%s",
- lang_hooks.decl_printable_name (global, 2));
- /* FIXME -- PROFILE-RESTRUCTURE: Change the call from
- DECL_UID to get the uid from the var_ann field. */
- bitmap_set_bit (all_module_statics, DECL_UID (global));
- }
- }
-
- order_pos = cgraph_reduced_inorder (order, false);
- if (cgraph_dump_file)
- print_order("new", order, order_pos);
-
- for (i = order_pos - 1; i >= 0; i--)
- {
- node = order[i];
-
- /* Scan each function to determine the variable usage
- patterns. */
- cgraph_characterize_statics_local (node);
- }
-
- /* Prune out the variables that were found to behave badly
- (i.e. have there address taken). */
- {
- int index;
- EXECUTE_IF_SET_IN_BITMAP (module_statics_escape,
- 0, index, clear_static_vars_maps (index));
- bitmap_operation (all_module_statics, all_module_statics,
- module_statics_escape, BITMAP_AND_COMPL);
-
- for (i = order_pos - 1; i >= 0; i--)
- {
- local_static_vars_info_t l;
- node = order[i];
- l = node->static_vars_info->local;
-
- bitmap_operation (l->statics_read_by_decl_uid,
- l->statics_read_by_decl_uid,
- module_statics_escape,
- BITMAP_AND_COMPL);
- bitmap_operation (l->statics_written_by_decl_uid,
- l->statics_written_by_decl_uid,
- module_statics_escape,
- BITMAP_AND_COMPL);
- }
- }
-
- if (cgraph_dump_file)
- {
- for (i = order_pos - 1; i >= 0; i--)
- {
- int index;
- local_static_vars_info_t l;
- node = order[i];
- l = node->static_vars_info->local;
- fprintf (cgraph_dump_file,
- "\nFunction name:%s/%i:",
- cgraph_node_name (node), node->uid);
- fprintf (cgraph_dump_file, "\n locals read: ");
- EXECUTE_IF_SET_IN_BITMAP (l->statics_read_by_decl_uid,
- 0, index,
- fprintf (cgraph_dump_file, "%s ",
- cgraph_get_static_name_by_uid (index)));
- fprintf (cgraph_dump_file, "\n locals written: ");
- EXECUTE_IF_SET_IN_BITMAP (l->statics_written_by_decl_uid,
- 0, index,
- fprintf(cgraph_dump_file, "%s ",
- cgraph_get_static_name_by_uid (index)));
- }
- }
-
- /* Propagate the local information thru the call graph to produce
- the global information. All the nodes within a cycle will have
- the same info so we collapse cycles first. Then we can do the
- propagation in one pass from the leaves to the roots. */
- order_pos = cgraph_reduced_inorder (order, true);
- for (i = order_pos - 1; i >= 0; i--)
- {
- static_vars_info_t node_info;
- global_static_vars_info_t node_g =
- ggc_calloc (1, sizeof (struct global_static_vars_info_d));
- local_static_vars_info_t node_l;
-
-
- bool read_all;
- bool write_all;
-
- node = order[i];
- node_info = node->static_vars_info;
- node_info->global = node_g;
- node_l = node_info->local;
-
- read_all = node->local.calls_read_all;
- write_all = node->local.calls_write_all;
-
- /* If any node in a cycle is calls_read_all or calls_write_all
- they all are. */
- w = node->next_cycle;
- while (w)
- {
- read_all |= w->local.calls_read_all;
- write_all |= w->local.calls_write_all;
- w = w->next_cycle;
- }
-
- /* Initialized the bitmaps for the reduced nodes */
- if (read_all)
- node_g->statics_read_by_decl_uid = all_module_statics;
- else
- {
- node_g->statics_read_by_decl_uid = BITMAP_GGC_ALLOC ();
- bitmap_copy (node_g->statics_read_by_decl_uid,
- node_l->statics_read_by_decl_uid);
- }
-
- if (write_all)
- node_g->statics_written_by_decl_uid = all_module_statics;
- else
- {
- node_g->statics_written_by_decl_uid = BITMAP_GGC_ALLOC ();
- bitmap_copy (node_g->statics_written_by_decl_uid,
- node_l->statics_written_by_decl_uid);
- }
-
- w = node->next_cycle;
- while (w)
- {
- /* All nodes within a cycle share the same global info bitmaps. */
- static_vars_info_t w_info = w->static_vars_info;
- local_static_vars_info_t w_l;
-
- w_info->global = node_g;
- w_l = w_info->local;
-
- /* These global bitmaps are initialized from the local info
- of all of the nodes in the region. However there is no
- need to do any work if the bitmaps were set to
- all_module_statics. */
- if (!read_all)
- bitmap_a_or_b (node_g->statics_read_by_decl_uid,
- node_g->statics_read_by_decl_uid,
- w_l->statics_read_by_decl_uid);
- if (!write_all)
- bitmap_a_or_b (node_g->statics_written_by_decl_uid,
- node_g->statics_written_by_decl_uid,
- w_l->statics_written_by_decl_uid);
- w = w->next_cycle;
- }
-
- cgraph_propagate_bits (node);
-
- w = node->next_cycle;
- while (w)
- {
- cgraph_propagate_bits (w);
- w = w->next_cycle;
- }
- }
-
- if (cgraph_dump_file)
- {
- for (i = order_pos - 1; i >= 0; i--)
- {
- static_vars_info_t node_info;
- global_static_vars_info_t node_g;
- int index;
- node = order[i];
- node_info = node->static_vars_info;
- node_g = node_info->global;
- fprintf (cgraph_dump_file,
- "\nFunction name:%s/%i:",
- cgraph_node_name (node), node->uid);
- w = node->next_cycle;
- while (w)
- {
- fprintf (cgraph_dump_file, "\n next cycle: %s/%i ",
- cgraph_node_name (w), w->uid);
- w = w->next_cycle;
- }
- fprintf (cgraph_dump_file, "\n globals read: ");
- EXECUTE_IF_SET_IN_BITMAP (node_g->statics_read_by_decl_uid,
- 0, index,
- fprintf (cgraph_dump_file, "%s ",
- cgraph_get_static_name_by_uid (index)));
- fprintf (cgraph_dump_file, "\n globals written: ");
- EXECUTE_IF_SET_IN_BITMAP (node_g->statics_written_by_decl_uid,
- 0, index,
- fprintf (cgraph_dump_file, "%s ",
- cgraph_get_static_name_by_uid (index)));
- }
- }
-
- /* Cleanup. */
- for (i = order_pos - 1; i >= 0; i--)
- {
- static_vars_info_t node_info;
- global_static_vars_info_t node_g;
- node = order[i];
- node_info = node->static_vars_info;
- node_g = node_info->global;
-
- node_g->var_anns_valid = false;
-
- /* Create the complimentary sets. These are more useful for
- certain apis. */
- node_g->statics_not_read_by_decl_uid = BITMAP_GGC_ALLOC ();
- node_g->statics_not_written_by_decl_uid = BITMAP_GGC_ALLOC ();
-
- /* FIXME -- PROFILE-RESTRUCTURE: Delete next 4 assignments. */
- node_g->statics_read_by_ann_uid = BITMAP_GGC_ALLOC ();
- node_g->statics_written_by_ann_uid = BITMAP_GGC_ALLOC ();
- node_g->statics_not_read_by_ann_uid = BITMAP_GGC_ALLOC ();
- node_g->statics_not_written_by_ann_uid = BITMAP_GGC_ALLOC ();
-
- if (node_g->statics_read_by_decl_uid != all_module_statics)
- {
- bitmap_operation (node_g->statics_not_read_by_decl_uid,
- all_module_statics,
- node_g->statics_read_by_decl_uid,
- BITMAP_AND_COMPL);
- }
-
- if (node_g->statics_written_by_decl_uid != all_module_statics)
- bitmap_operation (node_g->statics_not_written_by_decl_uid,
- all_module_statics,
- node_g->statics_written_by_decl_uid,
- BITMAP_AND_COMPL);
-
- w = node->next_cycle;
-
- while (w)
- {
- struct cgraph_node * last = w;
- w = w->next_cycle;
- last->next_cycle = NULL;
- }
- }
-
- free (order);
-}
/* Expand all functions that must be output.
free (order);
}
-/* Mark all local and external functions.
+/* Mark all local functions.
A local function is one whose calls can occur only in the current
compilation unit and all its calls are explicit, so we can change
its calling convention. We simply mark all static functions whose
- address is not taken as local.
-
- An external function is one whose body is outside the current
- compilation unit. */
+ address is not taken as local. */
static void
-cgraph_mark_local_and_external_functions (void)
+cgraph_mark_local_functions (void)
{
struct cgraph_node *node;
node->local.local = (!node->needed
&& DECL_SAVED_TREE (node->decl)
&& !TREE_PUBLIC (node->decl));
- node->local.external = (!DECL_SAVED_TREE (node->decl)
- && TREE_PUBLIC (node->decl));
}
if (cgraph_dump_file)
if (node->local.local)
fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
fprintf (cgraph_dump_file, "\n\n");
-
- fprintf (cgraph_dump_file, "\nMarking external functions:");
- for (node = cgraph_nodes; node; node = node->next)
- if (node->local.external)
- fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
- fprintf (cgraph_dump_file, "\n\n");
-}
+ }
}
/* Return true when function body of DECL still needs to be kept around
verify_cgraph ();
#endif
if (!flag_unit_at_a_time)
- return;
+ {
+ cgraph_varpool_assemble_pending_decls ();
+ return;
+ }
+
+ process_pending_assemble_externals ();
+
+ /* Frontend may output common variables after the unit has been finalized.
+ It is safe to deal with them here as they are always zero initialized. */
+ cgraph_varpool_analyze_pending_decls ();
+
timevar_push (TV_CGRAPHOPT);
if (!quiet_flag)
fprintf (stderr, "Performing intraprocedural optimizations\n");
- cgraph_mark_local_and_external_functions ();
+ cgraph_mark_local_functions ();
if (cgraph_dump_file)
{
fprintf (cgraph_dump_file, "Marked ");
{
fprintf (cgraph_dump_file, "Optimized ");
dump_cgraph (cgraph_dump_file);
+ dump_varpool (cgraph_dump_file);
}
timevar_pop (TV_CGRAPHOPT);
verify_cgraph ();
#endif
- /* This call was moved here from cgraph_expand_all_functions so that
- cgraph_characterize_statics could use the output flag of the cgraph
- node. */
-
cgraph_mark_functions_to_output ();
-
- cgraph_characterize_statics ();
-
cgraph_expand_all_functions ();
+ cgraph_varpool_remove_unreferenced_decls ();
+
+ cgraph_varpool_assemble_pending_decls ();
+
if (cgraph_dump_file)
{
fprintf (cgraph_dump_file, "\nFinal ");
/* ??? We will get called LATE in the compilation process. */
if (cgraph_global_info_ready)
- tree_rest_of_compilation (decl, false);
+ tree_rest_of_compilation (decl);
else
cgraph_finalize_function (decl, 0);
init_cgraph (void)
{
cgraph_dump_file = dump_begin (TDI_cgraph, NULL);
- memory_identifier = get_identifier("memory");
}
-#include "gt-cgraphunit.h"
OSDN Git Service
