1 /* Callgraph construction.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
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_address_taken_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 /* Reset inlining information of all incoming call edges of NODE. */
84 reset_inline_failed (struct cgraph_node *node)
86 struct cgraph_edge *e;
88 for (e = node->callers; e; e = e->next_caller)
90 e->callee->global.inlined_to = NULL;
92 e->inline_failed = CIF_BODY_NOT_AVAILABLE;
93 else if (node->local.redefined_extern_inline)
94 e->inline_failed = CIF_REDEFINED_EXTERN_INLINE;
95 else if (!node->local.inlinable)
96 e->inline_failed = CIF_FUNCTION_NOT_INLINABLE;
97 else if (e->call_stmt_cannot_inline_p)
98 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
100 e->inline_failed = CIF_FUNCTION_NOT_CONSIDERED;
104 /* Computes the frequency of the call statement so that it can be stored in
105 cgraph_edge. BB is the basic block of the call statement. */
107 compute_call_stmt_bb_frequency (tree decl, basic_block bb)
109 int entry_freq = ENTRY_BLOCK_PTR->frequency;
110 int freq = bb->frequency;
112 if (profile_status_for_function (DECL_STRUCT_FUNCTION (decl)) == PROFILE_ABSENT)
113 return CGRAPH_FREQ_BASE;
116 entry_freq = 1, freq++;
118 freq = freq * 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 (current_function_decl, 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);
201 struct gimple_opt_pass pass_build_cgraph_edges =
207 build_cgraph_edges, /* execute */
210 0, /* static_pass_number */
212 PROP_cfg, /* properties_required */
213 0, /* properties_provided */
214 0, /* properties_destroyed */
215 0, /* todo_flags_start */
216 0 /* todo_flags_finish */
220 /* Record references to functions and other variables present in the
221 initial value of DECL, a variable. */
224 record_references_in_initializer (tree decl)
226 struct pointer_set_t *visited_nodes = pointer_set_create ();
227 walk_tree (&DECL_INITIAL (decl), record_reference, NULL, visited_nodes);
228 pointer_set_destroy (visited_nodes);
231 /* Rebuild cgraph edges for current function node. This needs to be run after
232 passes that don't update the cgraph. */
235 rebuild_cgraph_edges (void)
238 struct cgraph_node *node = cgraph_node (current_function_decl);
239 gimple_stmt_iterator gsi;
241 cgraph_node_remove_callees (node);
243 node->count = ENTRY_BLOCK_PTR->count;
246 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
248 gimple stmt = gsi_stmt (gsi);
251 if (is_gimple_call (stmt) && (decl = gimple_call_fndecl (stmt)))
252 cgraph_create_edge (node, cgraph_node (decl), stmt,
254 compute_call_stmt_bb_frequency
255 (current_function_decl, bb),
259 gcc_assert (!node->global.inlined_to);
264 struct gimple_opt_pass pass_rebuild_cgraph_edges =
270 rebuild_cgraph_edges, /* execute */
273 0, /* static_pass_number */
275 PROP_cfg, /* properties_required */
276 0, /* properties_provided */
277 0, /* properties_destroyed */
278 0, /* todo_flags_start */
279 0, /* todo_flags_finish */
285 remove_cgraph_callee_edges (void)
287 cgraph_node_remove_callees (cgraph_node (current_function_decl));
291 struct gimple_opt_pass pass_remove_cgraph_callee_edges =
297 remove_cgraph_callee_edges, /* execute */
300 0, /* static_pass_number */
302 0, /* properties_required */
303 0, /* properties_provided */
304 0, /* properties_destroyed */
305 0, /* todo_flags_start */
306 0, /* todo_flags_finish */