697 lines
19 KiB
C
697 lines
19 KiB
C
/* Callgraph handling code.
|
|
Copyright (C) 2003, 2004 Free Software Foundation, Inc.
|
|
Contributed by Jan Hubicka
|
|
|
|
This file is part of GCC.
|
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
|
the terms of the GNU General Public License as published by the Free
|
|
Software Foundation; either version 2, or (at your option) any later
|
|
version.
|
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with GCC; see the file COPYING. If not, write to the Free
|
|
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
|
|
02111-1307, USA. */
|
|
|
|
/* This file contains basic routines manipulating call graph and variable pool
|
|
|
|
The callgraph:
|
|
|
|
The call-graph is data structure designed for intra-procedural optimization
|
|
but it is also used in non-unit-at-a-time compilation to allow easier code
|
|
sharing.
|
|
|
|
The call-graph consist of nodes and edges represented via linked lists.
|
|
Each function (external or not) corresponds to the unique node (in
|
|
contrast to tree DECL nodes where we can have multiple nodes for each
|
|
function).
|
|
|
|
The mapping from declarations to call-graph nodes is done using hash table
|
|
based on DECL_ASSEMBLER_NAME, so it is essential for assembler name to
|
|
not change once the declaration is inserted into the call-graph.
|
|
The call-graph nodes are created lazily using cgraph_node function when
|
|
called for unknown declaration.
|
|
|
|
When built, there is one edge for each direct call. It is possible that
|
|
the reference will be later optimized out. The call-graph is built
|
|
conservatively in order to make conservative data flow analysis possible.
|
|
|
|
The callgraph at the moment does not represent indirect calls or calls
|
|
from other compilation unit. Flag NEEDED is set for each node that may
|
|
be accessed in such a invisible way and it shall be considered an
|
|
entry point to the callgraph.
|
|
|
|
Intraprocedural information:
|
|
|
|
Callgraph is place to store data needed for intraprocedural optimization.
|
|
All data structures are divided into three components: local_info that
|
|
is produced while analyzing the function, global_info that is result
|
|
of global walking of the callgraph on the end of compilation and
|
|
rtl_info used by RTL backend to propagate data from already compiled
|
|
functions to their callers.
|
|
|
|
Inlining plans:
|
|
|
|
The function inlining information is decided in advance and maintained
|
|
in the callgraph as so called inline plan.
|
|
For each inlined call, the callee's node is cloned to represent the
|
|
new function copy produced by inliner.
|
|
Each inlined call gets a unique corresponding clone node of the callee
|
|
and the data structure is updated while inlining is performed, so
|
|
the clones are eliminated and their callee edges redirected to the
|
|
caller.
|
|
|
|
Each edge has "inline_failed" field. When the field is set to NULL,
|
|
the call will be inlined. When it is non-NULL it contains a reason
|
|
why inlining wasn't performed.
|
|
|
|
|
|
The varpool data structure:
|
|
|
|
Varpool is used to maintain variables in similar manner as call-graph
|
|
is used for functions. Most of the API is symmetric replacing cgraph
|
|
function prefix by cgraph_varpool */
|
|
|
|
|
|
#include "config.h"
|
|
#include "system.h"
|
|
#include "coretypes.h"
|
|
#include "tm.h"
|
|
#include "tree.h"
|
|
#include "langhooks.h"
|
|
#include "hashtab.h"
|
|
#include "toplev.h"
|
|
#include "flags.h"
|
|
#include "ggc.h"
|
|
#include "debug.h"
|
|
#include "target.h"
|
|
#include "cgraph.h"
|
|
#include "varray.h"
|
|
#include "output.h"
|
|
#include "intl.h"
|
|
|
|
/* Hash table used to convert declarations into nodes. */
|
|
static GTY((param_is (struct cgraph_node))) htab_t cgraph_hash;
|
|
|
|
/* The linked list of cgraph nodes. */
|
|
struct cgraph_node *cgraph_nodes;
|
|
|
|
/* Queue of cgraph nodes scheduled to be lowered. */
|
|
struct cgraph_node *cgraph_nodes_queue;
|
|
|
|
/* Number of nodes in existence. */
|
|
int cgraph_n_nodes;
|
|
|
|
/* Maximal uid used in cgraph nodes. */
|
|
int cgraph_max_uid;
|
|
|
|
/* Set when whole unit has been analyzed so we can access global info. */
|
|
bool cgraph_global_info_ready = false;
|
|
|
|
/* Hash table used to convert declarations into nodes. */
|
|
static GTY((param_is (struct cgraph_varpool_node))) htab_t cgraph_varpool_hash;
|
|
|
|
/* Queue of cgraph nodes scheduled to be lowered and output. */
|
|
struct cgraph_varpool_node *cgraph_varpool_nodes_queue;
|
|
|
|
/* Number of nodes in existence. */
|
|
int cgraph_varpool_n_nodes;
|
|
|
|
/* The linked list of cgraph varpool nodes. */
|
|
static GTY(()) struct cgraph_varpool_node *cgraph_varpool_nodes;
|
|
|
|
static hashval_t hash_node (const void *);
|
|
static int eq_node (const void *, const void *);
|
|
|
|
/* Returns a hash code for P. */
|
|
|
|
static hashval_t
|
|
hash_node (const void *p)
|
|
{
|
|
const struct cgraph_node *n = p;
|
|
return (hashval_t) DECL_UID (n->decl);
|
|
}
|
|
|
|
/* Returns nonzero if P1 and P2 are equal. */
|
|
|
|
static int
|
|
eq_node (const void *p1, const void *p2)
|
|
{
|
|
const struct cgraph_node *n1 = p1, *n2 = p2;
|
|
return DECL_UID (n1->decl) == DECL_UID (n2->decl);
|
|
}
|
|
|
|
/* Allocate new callgraph node and insert it into basic data structures. */
|
|
static struct cgraph_node *
|
|
cgraph_create_node (void)
|
|
{
|
|
struct cgraph_node *node;
|
|
|
|
node = ggc_alloc_cleared (sizeof (*node));
|
|
node->next = cgraph_nodes;
|
|
node->uid = cgraph_max_uid++;
|
|
if (cgraph_nodes)
|
|
cgraph_nodes->previous = node;
|
|
node->previous = NULL;
|
|
cgraph_nodes = node;
|
|
cgraph_n_nodes++;
|
|
return node;
|
|
}
|
|
|
|
/* Return cgraph node assigned to DECL. Create new one when needed. */
|
|
struct cgraph_node *
|
|
cgraph_node (tree decl)
|
|
{
|
|
struct cgraph_node key, *node, **slot;
|
|
|
|
if (TREE_CODE (decl) != FUNCTION_DECL)
|
|
abort ();
|
|
|
|
if (!cgraph_hash)
|
|
cgraph_hash = htab_create_ggc (10, hash_node, eq_node, NULL);
|
|
|
|
key.decl = decl;
|
|
|
|
slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key, INSERT);
|
|
|
|
if (*slot)
|
|
return *slot;
|
|
|
|
node = cgraph_create_node ();
|
|
node->decl = decl;
|
|
*slot = node;
|
|
if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
|
|
{
|
|
node->origin = cgraph_node (DECL_CONTEXT (decl));
|
|
node->next_nested = node->origin->nested;
|
|
node->origin->nested = node;
|
|
}
|
|
return node;
|
|
}
|
|
|
|
/* Return callgraph edge representing CALL_EXPR. */
|
|
struct cgraph_edge *
|
|
cgraph_edge (struct cgraph_node *node, tree call_expr)
|
|
{
|
|
struct cgraph_edge *e;
|
|
|
|
/* This loop may turn out to be performance problem. In such case adding
|
|
hashtables into call nodes with very many edges is probably best
|
|
solution. It is not good idea to add pointer into CALL_EXPR itself
|
|
because we want to make possible having multiple cgraph nodes representing
|
|
different clones of the same body before the body is actually cloned. */
|
|
for (e = node->callees; e; e= e->next_callee)
|
|
if (e->call_expr == call_expr)
|
|
break;
|
|
return e;
|
|
}
|
|
|
|
/* Create edge from CALLER to CALLEE in the cgraph. */
|
|
|
|
struct cgraph_edge *
|
|
cgraph_create_edge (struct cgraph_node *caller, struct cgraph_node *callee,
|
|
tree call_expr)
|
|
{
|
|
struct cgraph_edge *edge = ggc_alloc (sizeof (struct cgraph_edge));
|
|
#ifdef ENABLE_CHECKING
|
|
struct cgraph_edge *e;
|
|
|
|
for (e = caller->callees; e; e = e->next_callee)
|
|
if (e->call_expr == call_expr)
|
|
abort ();
|
|
#endif
|
|
|
|
if (TREE_CODE (call_expr) != CALL_EXPR)
|
|
abort ();
|
|
|
|
if (!DECL_SAVED_TREE (callee->decl))
|
|
edge->inline_failed = N_("function body not available");
|
|
else if (callee->local.redefined_extern_inline)
|
|
edge->inline_failed = N_("redefined extern inline functions are not "
|
|
"considered for inlining");
|
|
else if (callee->local.inlinable)
|
|
edge->inline_failed = N_("function not considered for inlining");
|
|
else
|
|
edge->inline_failed = N_("function not inlinable");
|
|
|
|
edge->aux = NULL;
|
|
|
|
edge->caller = caller;
|
|
edge->callee = callee;
|
|
edge->call_expr = call_expr;
|
|
edge->next_caller = callee->callers;
|
|
edge->next_callee = caller->callees;
|
|
caller->callees = edge;
|
|
callee->callers = edge;
|
|
return edge;
|
|
}
|
|
|
|
/* Remove the edge E the cgraph. */
|
|
|
|
void
|
|
cgraph_remove_edge (struct cgraph_edge *e)
|
|
{
|
|
struct cgraph_edge **edge, **edge2;
|
|
|
|
for (edge = &e->callee->callers; *edge && *edge != e;
|
|
edge = &((*edge)->next_caller))
|
|
continue;
|
|
if (!*edge)
|
|
abort ();
|
|
*edge = (*edge)->next_caller;
|
|
for (edge2 = &e->caller->callees; *edge2 && *edge2 != e;
|
|
edge2 = &(*edge2)->next_callee)
|
|
continue;
|
|
if (!*edge2)
|
|
abort ();
|
|
*edge2 = (*edge2)->next_callee;
|
|
}
|
|
|
|
/* Redirect callee of E to N. The function does not update underlying
|
|
call expression. */
|
|
|
|
void
|
|
cgraph_redirect_edge_callee (struct cgraph_edge *e, struct cgraph_node *n)
|
|
{
|
|
struct cgraph_edge **edge;
|
|
|
|
for (edge = &e->callee->callers; *edge && *edge != e;
|
|
edge = &((*edge)->next_caller))
|
|
continue;
|
|
if (!*edge)
|
|
abort ();
|
|
*edge = (*edge)->next_caller;
|
|
e->callee = n;
|
|
e->next_caller = n->callers;
|
|
n->callers = e;
|
|
}
|
|
|
|
/* Remove the node from cgraph. */
|
|
|
|
void
|
|
cgraph_remove_node (struct cgraph_node *node)
|
|
{
|
|
void **slot;
|
|
bool check_dead = 1;
|
|
|
|
while (node->callers)
|
|
cgraph_remove_edge (node->callers);
|
|
while (node->callees)
|
|
cgraph_remove_edge (node->callees);
|
|
while (node->nested)
|
|
cgraph_remove_node (node->nested);
|
|
if (node->origin)
|
|
{
|
|
struct cgraph_node **node2 = &node->origin->nested;
|
|
|
|
while (*node2 != node)
|
|
node2 = &(*node2)->next_nested;
|
|
*node2 = node->next_nested;
|
|
}
|
|
if (node->previous)
|
|
node->previous->next = node->next;
|
|
else
|
|
cgraph_nodes = node->next;
|
|
if (node->next)
|
|
node->next->previous = node->previous;
|
|
slot = htab_find_slot (cgraph_hash, node, NO_INSERT);
|
|
if (*slot == node)
|
|
{
|
|
if (node->next_clone)
|
|
*slot = node->next_clone;
|
|
else
|
|
{
|
|
htab_clear_slot (cgraph_hash, slot);
|
|
if (!dump_enabled_p (TDI_all))
|
|
{
|
|
DECL_SAVED_TREE (node->decl) = NULL;
|
|
DECL_STRUCT_FUNCTION (node->decl) = NULL;
|
|
}
|
|
check_dead = false;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
struct cgraph_node *n;
|
|
|
|
for (n = *slot; n->next_clone != node; n = n->next_clone)
|
|
continue;
|
|
n->next_clone = node->next_clone;
|
|
}
|
|
|
|
/* Work out whether we still need a function body (either there is inline
|
|
clone or there is out of line function whose body is not written). */
|
|
if (check_dead && flag_unit_at_a_time)
|
|
{
|
|
struct cgraph_node *n;
|
|
|
|
for (n = *slot; n; n = n->next_clone)
|
|
if (n->global.inlined_to
|
|
|| (!n->global.inlined_to
|
|
&& !TREE_ASM_WRITTEN (n->decl) && !DECL_EXTERNAL (n->decl)))
|
|
break;
|
|
if (!n && !dump_enabled_p (TDI_all))
|
|
{
|
|
DECL_SAVED_TREE (node->decl) = NULL;
|
|
DECL_STRUCT_FUNCTION (node->decl) = NULL;
|
|
}
|
|
}
|
|
cgraph_n_nodes--;
|
|
/* Do not free the structure itself so the walk over chain can continue. */
|
|
}
|
|
|
|
/* Notify finalize_compilation_unit that given node is reachable. */
|
|
|
|
void
|
|
cgraph_mark_reachable_node (struct cgraph_node *node)
|
|
{
|
|
if (!node->reachable && node->local.finalized)
|
|
{
|
|
notice_global_symbol (node->decl);
|
|
node->reachable = 1;
|
|
|
|
node->next_needed = cgraph_nodes_queue;
|
|
cgraph_nodes_queue = node;
|
|
}
|
|
}
|
|
|
|
/* Likewise indicate that a node is needed, i.e. reachable via some
|
|
external means. */
|
|
|
|
void
|
|
cgraph_mark_needed_node (struct cgraph_node *node)
|
|
{
|
|
node->needed = 1;
|
|
cgraph_mark_reachable_node (node);
|
|
}
|
|
|
|
/* Return true when CALLER_DECL calls CALLEE_DECL. */
|
|
|
|
bool
|
|
cgraph_calls_p (tree caller_decl, tree callee_decl)
|
|
{
|
|
struct cgraph_node *caller = cgraph_node (caller_decl);
|
|
struct cgraph_node *callee = cgraph_node (callee_decl);
|
|
struct cgraph_edge *edge;
|
|
|
|
for (edge = callee->callers; edge && (edge)->caller != caller;
|
|
edge = (edge->next_caller))
|
|
continue;
|
|
return edge != NULL;
|
|
}
|
|
|
|
/* Return local info for the compiled function. */
|
|
|
|
struct cgraph_local_info *
|
|
cgraph_local_info (tree decl)
|
|
{
|
|
struct cgraph_node *node;
|
|
if (TREE_CODE (decl) != FUNCTION_DECL)
|
|
abort ();
|
|
node = cgraph_node (decl);
|
|
return &node->local;
|
|
}
|
|
|
|
/* Return local info for the compiled function. */
|
|
|
|
struct cgraph_global_info *
|
|
cgraph_global_info (tree decl)
|
|
{
|
|
struct cgraph_node *node;
|
|
if (TREE_CODE (decl) != FUNCTION_DECL || !cgraph_global_info_ready)
|
|
abort ();
|
|
node = cgraph_node (decl);
|
|
return &node->global;
|
|
}
|
|
|
|
/* Return local info for the compiled function. */
|
|
|
|
struct cgraph_rtl_info *
|
|
cgraph_rtl_info (tree decl)
|
|
{
|
|
struct cgraph_node *node;
|
|
if (TREE_CODE (decl) != FUNCTION_DECL)
|
|
abort ();
|
|
node = cgraph_node (decl);
|
|
if (decl != current_function_decl
|
|
&& !TREE_ASM_WRITTEN (node->decl))
|
|
return NULL;
|
|
return &node->rtl;
|
|
}
|
|
|
|
/* Return name of the node used in debug output. */
|
|
const char *
|
|
cgraph_node_name (struct cgraph_node *node)
|
|
{
|
|
return lang_hooks.decl_printable_name (node->decl, 2);
|
|
}
|
|
|
|
/* Dump given cgraph node. */
|
|
void
|
|
dump_cgraph_node (FILE *f, struct cgraph_node *node)
|
|
{
|
|
struct cgraph_edge *edge;
|
|
fprintf (f, "%s/%i:", cgraph_node_name (node), node->uid);
|
|
if (node->global.inlined_to)
|
|
fprintf (f, " (inline copy in %s/%i)",
|
|
cgraph_node_name (node->global.inlined_to),
|
|
node->global.inlined_to->uid);
|
|
if (node->local.self_insns)
|
|
fprintf (f, " %i insns", node->local.self_insns);
|
|
if (node->global.insns && node->global.insns != node->local.self_insns)
|
|
fprintf (f, " (%i after inlining)", node->global.insns);
|
|
if (node->origin)
|
|
fprintf (f, " nested in: %s", cgraph_node_name (node->origin));
|
|
if (node->needed)
|
|
fprintf (f, " needed");
|
|
else if (node->reachable)
|
|
fprintf (f, " reachable");
|
|
if (DECL_SAVED_TREE (node->decl))
|
|
fprintf (f, " tree");
|
|
if (node->output)
|
|
fprintf (f, " output");
|
|
|
|
if (node->local.local)
|
|
fprintf (f, " local");
|
|
if (node->local.disregard_inline_limits)
|
|
fprintf (f, " always_inline");
|
|
else if (node->local.inlinable)
|
|
fprintf (f, " inlinable");
|
|
if (TREE_ASM_WRITTEN (node->decl))
|
|
fprintf (f, " asm_written");
|
|
|
|
fprintf (f, "\n called by: ");
|
|
for (edge = node->callers; edge; edge = edge->next_caller)
|
|
{
|
|
fprintf (f, "%s/%i ", cgraph_node_name (edge->caller),
|
|
edge->caller->uid);
|
|
if (!edge->inline_failed)
|
|
fprintf(f, "(inlined) ");
|
|
}
|
|
|
|
fprintf (f, "\n calls: ");
|
|
for (edge = node->callees; edge; edge = edge->next_callee)
|
|
{
|
|
fprintf (f, "%s/%i ", cgraph_node_name (edge->callee),
|
|
edge->callee->uid);
|
|
if (!edge->inline_failed)
|
|
fprintf(f, "(inlined) ");
|
|
}
|
|
fprintf (f, "\n");
|
|
}
|
|
|
|
/* Dump the callgraph. */
|
|
|
|
void
|
|
dump_cgraph (FILE *f)
|
|
{
|
|
struct cgraph_node *node;
|
|
|
|
fprintf (f, "callgraph:\n\n");
|
|
for (node = cgraph_nodes; node; node = node->next)
|
|
dump_cgraph_node (f, node);
|
|
}
|
|
|
|
/* Returns a hash code for P. */
|
|
|
|
static hashval_t
|
|
hash_varpool_node (const void *p)
|
|
{
|
|
const struct cgraph_varpool_node *n = p;
|
|
return (hashval_t) DECL_UID (n->decl);
|
|
}
|
|
|
|
/* Returns nonzero if P1 and P2 are equal. */
|
|
|
|
static int
|
|
eq_varpool_node (const void *p1, const void *p2)
|
|
{
|
|
const struct cgraph_varpool_node *n1 = p1, *n2 = p2;
|
|
return DECL_UID (n1->decl) == DECL_UID (n2->decl);
|
|
}
|
|
|
|
/* Return cgraph_varpool node assigned to DECL. Create new one when needed. */
|
|
struct cgraph_varpool_node *
|
|
cgraph_varpool_node (tree decl)
|
|
{
|
|
struct cgraph_varpool_node key, *node, **slot;
|
|
|
|
if (!DECL_P (decl) || TREE_CODE (decl) == FUNCTION_DECL)
|
|
abort ();
|
|
|
|
if (!cgraph_varpool_hash)
|
|
cgraph_varpool_hash = htab_create_ggc (10, hash_varpool_node,
|
|
eq_varpool_node, NULL);
|
|
key.decl = decl;
|
|
slot = (struct cgraph_varpool_node **)
|
|
htab_find_slot (cgraph_varpool_hash, &key, INSERT);
|
|
if (*slot)
|
|
return *slot;
|
|
node = ggc_alloc_cleared (sizeof (*node));
|
|
node->decl = decl;
|
|
cgraph_varpool_n_nodes++;
|
|
cgraph_varpool_nodes = node;
|
|
*slot = node;
|
|
return node;
|
|
}
|
|
|
|
/* Set the DECL_ASSEMBLER_NAME and update cgraph hashtables. */
|
|
void
|
|
change_decl_assembler_name (tree decl, tree name)
|
|
{
|
|
if (!DECL_ASSEMBLER_NAME_SET_P (decl))
|
|
{
|
|
SET_DECL_ASSEMBLER_NAME (decl, name);
|
|
return;
|
|
}
|
|
if (name == DECL_ASSEMBLER_NAME (decl))
|
|
return;
|
|
|
|
if (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))
|
|
&& DECL_RTL_SET_P (decl))
|
|
warning ("%D renamed after being referenced in assembly", decl);
|
|
|
|
SET_DECL_ASSEMBLER_NAME (decl, name);
|
|
}
|
|
|
|
/* Notify finalize_compilation_unit that given node is reachable
|
|
or needed. */
|
|
void
|
|
cgraph_varpool_mark_needed_node (struct cgraph_varpool_node *node)
|
|
{
|
|
if (!node->needed && node->finalized)
|
|
{
|
|
node->next_needed = cgraph_varpool_nodes_queue;
|
|
cgraph_varpool_nodes_queue = node;
|
|
notice_global_symbol (node->decl);
|
|
}
|
|
node->needed = 1;
|
|
}
|
|
|
|
void
|
|
cgraph_varpool_finalize_decl (tree decl)
|
|
{
|
|
struct cgraph_varpool_node *node = cgraph_varpool_node (decl);
|
|
|
|
/* The first declaration of a variable that comes through this function
|
|
decides whether it is global (in C, has external linkage)
|
|
or local (in C, has internal linkage). So do nothing more
|
|
if this function has already run. */
|
|
if (node->finalized)
|
|
return;
|
|
if (node->needed)
|
|
{
|
|
node->next_needed = cgraph_varpool_nodes_queue;
|
|
cgraph_varpool_nodes_queue = node;
|
|
notice_global_symbol (decl);
|
|
}
|
|
node->finalized = true;
|
|
|
|
if (/* Externally visible variables must be output. The exception are
|
|
COMDAT functions that must be output only when they are needed. */
|
|
(TREE_PUBLIC (decl) && !DECL_COMDAT (decl))
|
|
/* Function whose name is output to the assembler file must be produced.
|
|
It is possible to assemble the name later after finalizing the function
|
|
and the fact is noticed in assemble_name then. */
|
|
|| (DECL_ASSEMBLER_NAME_SET_P (decl)
|
|
&& TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))))
|
|
{
|
|
cgraph_varpool_mark_needed_node (node);
|
|
}
|
|
}
|
|
|
|
bool
|
|
cgraph_varpool_assemble_pending_decls (void)
|
|
{
|
|
bool changed = false;
|
|
|
|
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))
|
|
{
|
|
assemble_variable (decl, 0, 1, 0);
|
|
changed = true;
|
|
}
|
|
node->next_needed = NULL;
|
|
}
|
|
return changed;
|
|
}
|
|
|
|
/* Return true when the DECL can possibly be inlined. */
|
|
bool
|
|
cgraph_function_possibly_inlined_p (tree decl)
|
|
{
|
|
if (!cgraph_global_info_ready)
|
|
return (DECL_INLINE (decl) && !flag_really_no_inline);
|
|
return DECL_POSSIBLY_INLINED (decl);
|
|
}
|
|
|
|
/* Create clone of E in the node N represented by CALL_EXPR the callgraph. */
|
|
struct cgraph_edge *
|
|
cgraph_clone_edge (struct cgraph_edge *e, struct cgraph_node *n, tree call_expr)
|
|
{
|
|
struct cgraph_edge *new = cgraph_create_edge (n, e->callee, call_expr);
|
|
|
|
new->inline_failed = e->inline_failed;
|
|
return new;
|
|
}
|
|
|
|
/* Create node representing clone of N. */
|
|
struct cgraph_node *
|
|
cgraph_clone_node (struct cgraph_node *n)
|
|
{
|
|
struct cgraph_node *new = cgraph_create_node ();
|
|
struct cgraph_edge *e;
|
|
|
|
new->decl = n->decl;
|
|
new->origin = n->origin;
|
|
if (new->origin)
|
|
{
|
|
new->next_nested = new->origin->nested;
|
|
new->origin->nested = new;
|
|
}
|
|
new->analyzed = n->analyzed;
|
|
new->local = n->local;
|
|
new->global = n->global;
|
|
new->rtl = n->rtl;
|
|
|
|
for (e = n->callees;e; e=e->next_callee)
|
|
cgraph_clone_edge (e, new, e->call_expr);
|
|
|
|
new->next_clone = n->next_clone;
|
|
n->next_clone = new;
|
|
|
|
return new;
|
|
}
|
|
#include "gt-cgraph.h"
|