1 /* Callgraph construction.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008
3 Free Software Foundation, Inc.
4 Contributed by Jan Hubicka
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
27 #include "tree-flow.h"
28 #include "langhooks.h"
29 #include "pointer-set.h"
33 #include "tree-pass.h"
35 /* Walk tree and record all calls and references to functions/variables.
36 Called via walk_tree: TP is pointer to tree to be examined. */
39 record_reference (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
44 switch (TREE_CODE (t))
47 if (TREE_STATIC (t) || DECL_EXTERNAL (t))
49 varpool_mark_needed_node (varpool_node (t));
50 if (lang_hooks.callgraph.analyze_expr)
51 return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees);
57 /* Record dereferences to the functions. This makes the
58 functions reachable unconditionally. */
59 decl = TREE_OPERAND (*tp, 0);
60 if (TREE_CODE (decl) == FUNCTION_DECL)
61 cgraph_mark_needed_node (cgraph_node (decl));
65 /* Save some cycles by not walking types and declaration as we
66 won't find anything useful there anyway. */
67 if (IS_TYPE_OR_DECL_P (*tp))
73 if ((unsigned int) TREE_CODE (t) >= LAST_AND_UNUSED_TREE_CODE)
74 return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees);
81 /* Give initial reasons why inlining would fail on all calls from
82 NODE. Those get either nullified or usually overwritten by more precise
86 initialize_inline_failed (struct cgraph_node *node)
88 struct cgraph_edge *e;
90 for (e = node->callers; e; e = e->next_caller)
92 gcc_assert (!e->callee->global.inlined_to);
93 gcc_assert (e->inline_failed);
94 if (node->local.redefined_extern_inline)
95 e->inline_failed = N_("redefined extern inline functions are not "
96 "considered for inlining");
97 else if (!node->local.inlinable)
98 e->inline_failed = N_("function not inlinable");
99 else if (gimple_call_cannot_inline_p (e->call_stmt))
100 e->inline_failed = N_("mismatched arguments");
102 e->inline_failed = N_("function not considered for inlining");
106 /* Computes the frequency of the call statement so that it can be stored in
107 cgraph_edge. BB is the basic block of the call statement. */
109 compute_call_stmt_bb_frequency (basic_block bb)
111 int entry_freq = ENTRY_BLOCK_PTR->frequency;
117 freq = (!bb->frequency && !entry_freq ? CGRAPH_FREQ_BASE
118 : bb->frequency * CGRAPH_FREQ_BASE / entry_freq);
119 if (freq > CGRAPH_FREQ_MAX)
120 freq = CGRAPH_FREQ_MAX;
125 /* Create cgraph edges for function calls.
126 Also look for functions and variables having addresses taken. */
129 build_cgraph_edges (void)
132 struct cgraph_node *node = cgraph_node (current_function_decl);
133 struct pointer_set_t *visited_nodes = pointer_set_create ();
134 gimple_stmt_iterator gsi;
137 /* Create the callgraph edges and record the nodes referenced by the function.
140 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
142 gimple stmt = gsi_stmt (gsi);
145 if (is_gimple_call (stmt) && (decl = gimple_call_fndecl (stmt)))
148 size_t n = gimple_call_num_args (stmt);
149 cgraph_create_edge (node, cgraph_node (decl), stmt,
150 bb->count, compute_call_stmt_bb_frequency (bb),
152 for (i = 0; i < n; i++)
153 walk_tree (gimple_call_arg_ptr (stmt, i), record_reference,
154 node, visited_nodes);
155 if (gimple_call_lhs (stmt))
156 walk_tree (gimple_call_lhs_ptr (stmt), record_reference, node,
161 struct walk_stmt_info wi;
162 memset (&wi, 0, sizeof (wi));
164 wi.pset = visited_nodes;
165 walk_gimple_op (stmt, record_reference, &wi);
166 if (gimple_code (stmt) == GIMPLE_OMP_PARALLEL
167 && gimple_omp_parallel_child_fn (stmt))
169 tree fn = gimple_omp_parallel_child_fn (stmt);
170 cgraph_mark_needed_node (cgraph_node (fn));
172 if (gimple_code (stmt) == GIMPLE_OMP_TASK)
174 tree fn = gimple_omp_task_child_fn (stmt);
176 cgraph_mark_needed_node (cgraph_node (fn));
177 fn = gimple_omp_task_copy_fn (stmt);
179 cgraph_mark_needed_node (cgraph_node (fn));
184 /* Look for initializers of constant variables and private statics. */
185 for (step = cfun->local_decls;
187 step = TREE_CHAIN (step))
189 tree decl = TREE_VALUE (step);
190 if (TREE_CODE (decl) == VAR_DECL
191 && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl)))
192 varpool_finalize_decl (decl);
193 else if (TREE_CODE (decl) == VAR_DECL && DECL_INITIAL (decl))
194 walk_tree (&DECL_INITIAL (decl), record_reference, node, visited_nodes);
197 pointer_set_destroy (visited_nodes);
198 initialize_inline_failed (node);
202 struct gimple_opt_pass pass_build_cgraph_edges =
208 build_cgraph_edges, /* execute */
211 0, /* static_pass_number */
213 PROP_cfg, /* properties_required */
214 0, /* properties_provided */
215 0, /* properties_destroyed */
216 0, /* todo_flags_start */
217 0 /* todo_flags_finish */
221 /* Record references to functions and other variables present in the
222 initial value of DECL, a variable. */
225 record_references_in_initializer (tree decl)
227 struct pointer_set_t *visited_nodes = pointer_set_create ();
228 walk_tree (&DECL_INITIAL (decl), record_reference, NULL, visited_nodes);
229 pointer_set_destroy (visited_nodes);
232 /* Rebuild cgraph edges for current function node. This needs to be run after
233 passes that don't update the cgraph. */
236 rebuild_cgraph_edges (void)
239 struct cgraph_node *node = cgraph_node (current_function_decl);
240 gimple_stmt_iterator gsi;
242 cgraph_node_remove_callees (node);
244 node->count = ENTRY_BLOCK_PTR->count;
247 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
249 gimple stmt = gsi_stmt (gsi);
252 if (is_gimple_call (stmt) && (decl = gimple_call_fndecl (stmt)))
253 cgraph_create_edge (node, cgraph_node (decl), stmt,
254 bb->count, compute_call_stmt_bb_frequency (bb),
258 initialize_inline_failed (node);
259 gcc_assert (!node->global.inlined_to);
263 struct gimple_opt_pass pass_rebuild_cgraph_edges =
269 rebuild_cgraph_edges, /* execute */
272 0, /* static_pass_number */
274 PROP_cfg, /* properties_required */
275 0, /* properties_provided */
276 0, /* properties_destroyed */
277 0, /* todo_flags_start */
278 0, /* todo_flags_finish */