489 lines
12 KiB
C
489 lines
12 KiB
C
/* Callgraph handling code.
|
|
Copyright (C) 2003 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. */
|
|
|
|
#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"
|
|
|
|
|
|
/* 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;
|
|
|
|
/* 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 struct cgraph_edge *create_edge PARAMS ((struct cgraph_node *,
|
|
struct cgraph_node *));
|
|
static void cgraph_remove_edge PARAMS ((struct cgraph_node *, struct cgraph_node *));
|
|
static hashval_t hash_node PARAMS ((const void *));
|
|
static int eq_node PARAMS ((const void *, const void *));
|
|
|
|
/* Returns a hash code for P. */
|
|
|
|
static hashval_t
|
|
hash_node (p)
|
|
const void *p;
|
|
{
|
|
return ((hashval_t)
|
|
IDENTIFIER_HASH_VALUE (DECL_ASSEMBLER_NAME
|
|
(((struct cgraph_node *) p)->decl)));
|
|
}
|
|
|
|
/* Returns nonzero if P1 and P2 are equal. */
|
|
|
|
static int
|
|
eq_node (p1, p2)
|
|
const void *p1;
|
|
const void *p2;
|
|
{
|
|
return ((DECL_ASSEMBLER_NAME (((struct cgraph_node *) p1)->decl)) ==
|
|
(tree) p2);
|
|
}
|
|
|
|
/* Return cgraph node assigned to DECL. Create new one when needed. */
|
|
struct cgraph_node *
|
|
cgraph_node (decl)
|
|
tree decl;
|
|
{
|
|
struct cgraph_node *node;
|
|
struct cgraph_node **slot;
|
|
|
|
if (TREE_CODE (decl) != FUNCTION_DECL)
|
|
abort ();
|
|
|
|
if (!cgraph_hash)
|
|
cgraph_hash = htab_create_ggc (10, hash_node, eq_node, NULL);
|
|
|
|
slot = (struct cgraph_node **)
|
|
htab_find_slot_with_hash (cgraph_hash, DECL_ASSEMBLER_NAME (decl),
|
|
IDENTIFIER_HASH_VALUE
|
|
(DECL_ASSEMBLER_NAME (decl)), 1);
|
|
if (*slot)
|
|
return *slot;
|
|
node = ggc_alloc_cleared (sizeof (*node));
|
|
node->decl = decl;
|
|
node->next = cgraph_nodes;
|
|
if (cgraph_nodes)
|
|
cgraph_nodes->previous = node;
|
|
node->previous = NULL;
|
|
cgraph_nodes = node;
|
|
cgraph_n_nodes++;
|
|
*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;
|
|
}
|
|
|
|
/* Try to find existing function for identifier ID. */
|
|
struct cgraph_node *
|
|
cgraph_node_for_identifier (id)
|
|
tree id;
|
|
{
|
|
struct cgraph_node **slot;
|
|
|
|
if (TREE_CODE (id) != IDENTIFIER_NODE)
|
|
abort ();
|
|
|
|
if (!cgraph_hash)
|
|
return NULL;
|
|
|
|
slot = (struct cgraph_node **)
|
|
htab_find_slot_with_hash (cgraph_hash, id,
|
|
IDENTIFIER_HASH_VALUE (id), 0);
|
|
if (!slot)
|
|
return NULL;
|
|
return *slot;
|
|
}
|
|
|
|
/* Create edge from CALLER to CALLEE in the cgraph. */
|
|
|
|
static struct cgraph_edge *
|
|
create_edge (caller, callee)
|
|
struct cgraph_node *caller, *callee;
|
|
{
|
|
struct cgraph_edge *edge = ggc_alloc (sizeof (struct cgraph_edge));
|
|
|
|
edge->caller = caller;
|
|
edge->callee = callee;
|
|
edge->next_caller = callee->callers;
|
|
edge->next_callee = caller->callees;
|
|
caller->callees = edge;
|
|
callee->callers = edge;
|
|
return edge;
|
|
}
|
|
|
|
/* Remove the edge from CALLER to CALLEE in the cgraph. */
|
|
|
|
static void
|
|
cgraph_remove_edge (caller, callee)
|
|
struct cgraph_node *caller, *callee;
|
|
{
|
|
struct cgraph_edge **edge, **edge2;
|
|
|
|
for (edge = &callee->callers; *edge && (*edge)->caller != caller;
|
|
edge = &((*edge)->next_caller))
|
|
continue;
|
|
if (!*edge)
|
|
abort ();
|
|
*edge = (*edge)->next_caller;
|
|
for (edge2 = &caller->callees; *edge2 && (*edge2)->callee != callee;
|
|
edge2 = &(*edge2)->next_callee)
|
|
continue;
|
|
if (!*edge2)
|
|
abort ();
|
|
*edge2 = (*edge2)->next_callee;
|
|
}
|
|
|
|
/* Remove the node from cgraph. */
|
|
|
|
void
|
|
cgraph_remove_node (node)
|
|
struct cgraph_node *node;
|
|
{
|
|
while (node->callers)
|
|
cgraph_remove_edge (node->callers->caller, node);
|
|
while (node->callees)
|
|
cgraph_remove_edge (node, node->callees->callee);
|
|
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;
|
|
if (node->next)
|
|
node->next->previous = node->previous;
|
|
DECL_SAVED_TREE (node->decl) = NULL;
|
|
/* Do not free the structure itself so the walk over chain can continue. */
|
|
}
|
|
|
|
/* Notify finalize_compilation_unit that given node is reachable
|
|
or needed. */
|
|
void
|
|
cgraph_mark_needed_node (node, needed)
|
|
struct cgraph_node *node;
|
|
int needed;
|
|
{
|
|
if (needed)
|
|
{
|
|
node->needed = 1;
|
|
}
|
|
if (!node->reachable)
|
|
{
|
|
node->reachable = 1;
|
|
if (DECL_SAVED_TREE (node->decl))
|
|
{
|
|
node->next_needed = cgraph_nodes_queue;
|
|
cgraph_nodes_queue = node;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
/* Record call from CALLER to CALLEE */
|
|
|
|
struct cgraph_edge *
|
|
cgraph_record_call (caller, callee)
|
|
tree caller, callee;
|
|
{
|
|
return create_edge (cgraph_node (caller), cgraph_node (callee));
|
|
}
|
|
|
|
void
|
|
cgraph_remove_call (caller, callee)
|
|
tree caller, callee;
|
|
{
|
|
cgraph_remove_edge (cgraph_node (caller), cgraph_node (callee));
|
|
}
|
|
|
|
/* Return true when CALLER_DECL calls CALLEE_DECL. */
|
|
|
|
bool
|
|
cgraph_calls_p (caller_decl, callee_decl)
|
|
tree caller_decl, 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 (decl)
|
|
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 (decl)
|
|
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 (decl)
|
|
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 (node)
|
|
struct cgraph_node *node;
|
|
{
|
|
return (*lang_hooks.decl_printable_name) (node->decl, 2);
|
|
}
|
|
|
|
/* Dump the callgraph. */
|
|
|
|
void
|
|
dump_cgraph (f)
|
|
FILE *f;
|
|
{
|
|
struct cgraph_node *node;
|
|
|
|
fprintf (f, "\nCallgraph:\n\n");
|
|
for (node = cgraph_nodes; node; node = node->next)
|
|
{
|
|
struct cgraph_edge *edge;
|
|
fprintf (f, "%s", cgraph_node_name (node));
|
|
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");
|
|
|
|
fprintf (f, "\n called by :");
|
|
for (edge = node->callers; edge; edge = edge->next_caller)
|
|
fprintf (f, "%s ", cgraph_node_name (edge->caller));
|
|
|
|
fprintf (f, "\n calls: ");
|
|
for (edge = node->callees; edge; edge = edge->next_callee)
|
|
fprintf (f, "%s ", cgraph_node_name (edge->callee));
|
|
fprintf (f, "\n");
|
|
}
|
|
}
|
|
|
|
/* Returns a hash code for P. */
|
|
|
|
static hashval_t
|
|
cgraph_varpool_hash_node (const PTR p)
|
|
{
|
|
return ((hashval_t)
|
|
IDENTIFIER_HASH_VALUE (DECL_ASSEMBLER_NAME
|
|
(((struct cgraph_varpool_node *) p)->decl)));
|
|
}
|
|
|
|
/* Returns nonzero if P1 and P2 are equal. */
|
|
|
|
static int
|
|
eq_cgraph_varpool_node (const PTR p1, const PTR p2)
|
|
{
|
|
return ((DECL_ASSEMBLER_NAME (((struct cgraph_varpool_node *) p1)->decl)) ==
|
|
(tree) p2);
|
|
}
|
|
|
|
/* 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 *node;
|
|
struct cgraph_varpool_node **slot;
|
|
|
|
if (!DECL_P (decl) || TREE_CODE (decl) == FUNCTION_DECL)
|
|
abort ();
|
|
|
|
if (!cgraph_varpool_hash)
|
|
cgraph_varpool_hash = htab_create_ggc (10, cgraph_varpool_hash_node,
|
|
eq_cgraph_varpool_node, NULL);
|
|
|
|
|
|
slot = (struct cgraph_varpool_node **)
|
|
htab_find_slot_with_hash (cgraph_varpool_hash, DECL_ASSEMBLER_NAME (decl),
|
|
IDENTIFIER_HASH_VALUE (DECL_ASSEMBLER_NAME (decl)),
|
|
1);
|
|
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;
|
|
}
|
|
|
|
/* Try to find existing function for identifier ID. */
|
|
struct cgraph_varpool_node *
|
|
cgraph_varpool_node_for_identifier (tree id)
|
|
{
|
|
struct cgraph_varpool_node **slot;
|
|
|
|
if (TREE_CODE (id) != IDENTIFIER_NODE)
|
|
abort ();
|
|
|
|
if (!cgraph_varpool_hash)
|
|
return NULL;
|
|
|
|
slot = (struct cgraph_varpool_node **)
|
|
htab_find_slot_with_hash (cgraph_varpool_hash, id,
|
|
IDENTIFIER_HASH_VALUE (id), 0);
|
|
if (!slot)
|
|
return NULL;
|
|
return *slot;
|
|
}
|
|
|
|
/* 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;
|
|
}
|
|
node->needed = 1;
|
|
}
|
|
|
|
void
|
|
cgraph_varpool_finalize_decl (tree decl)
|
|
{
|
|
struct cgraph_varpool_node *node = cgraph_varpool_node (decl);
|
|
|
|
if (node->needed && !node->finalized)
|
|
{
|
|
node->next_needed = cgraph_varpool_nodes_queue;
|
|
cgraph_varpool_nodes_queue = node;
|
|
}
|
|
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 ()
|
|
{
|
|
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;
|
|
}
|
|
|
|
|
|
#include "gt-cgraph.h"
|