1 /* Callgraph construction.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
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"
34 #include "ipa-utils.h"
37 /* Context of record_reference. */
38 struct record_reference_ctx
41 struct varpool_node *varpool_node;
44 /* Walk tree and record all calls and references to functions/variables.
45 Called via walk_tree: TP is pointer to tree to be examined.
46 When DATA is non-null, record references to callgraph.
50 record_reference (tree *tp, int *walk_subtrees, void *data)
54 struct record_reference_ctx *ctx = (struct record_reference_ctx *)data;
56 switch (TREE_CODE (t))
65 /* Record dereferences to the functions. This makes the
66 functions reachable unconditionally. */
67 decl = get_base_var (*tp);
68 if (TREE_CODE (decl) == FUNCTION_DECL)
71 cgraph_mark_address_taken_node (cgraph_node (decl));
72 ipa_record_reference (NULL, ctx->varpool_node,
73 cgraph_node (decl), NULL,
77 if (TREE_CODE (decl) == VAR_DECL)
79 struct varpool_node *vnode = varpool_node (decl);
80 if (lang_hooks.callgraph.analyze_expr)
81 lang_hooks.callgraph.analyze_expr (&decl, walk_subtrees);
82 varpool_mark_needed_node (vnode);
83 if (vnode->alias && vnode->extra_name)
84 vnode = vnode->extra_name;
85 ipa_record_reference (NULL, ctx->varpool_node,
93 /* Save some cycles by not walking types and declaration as we
94 won't find anything useful there anyway. */
95 if (IS_TYPE_OR_DECL_P (*tp))
101 if ((unsigned int) TREE_CODE (t) >= LAST_AND_UNUSED_TREE_CODE)
102 return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees);
109 /* Record references to typeinfos in the type list LIST. */
112 record_type_list (struct cgraph_node *node, tree list)
114 for (; list; list = TREE_CHAIN (list))
116 tree type = TREE_VALUE (list);
119 type = lookup_type_for_runtime (type);
121 if (TREE_CODE (type) == ADDR_EXPR)
123 type = TREE_OPERAND (type, 0);
124 if (TREE_CODE (type) == VAR_DECL)
126 struct varpool_node *vnode = varpool_node (type);
127 varpool_mark_needed_node (vnode);
128 ipa_record_reference (node, NULL,
136 /* Record all references we will introduce by producing EH tables
140 record_eh_tables (struct cgraph_node *node, struct function *fun)
144 if (DECL_FUNCTION_PERSONALITY (node->decl))
145 ipa_record_reference (node, NULL,
146 cgraph_node (DECL_FUNCTION_PERSONALITY (node->decl)),
147 NULL, IPA_REF_ADDR, NULL);
149 i = fun->eh->region_tree;
158 case ERT_MUST_NOT_THROW:
164 for (c = i->u.eh_try.first_catch; c; c = c->next_catch)
165 record_type_list (node, c->type_list);
169 case ERT_ALLOWED_EXCEPTIONS:
170 record_type_list (node, i->u.allowed.type_list);
173 /* If there are sub-regions, process them. */
176 /* If there are peers, process them. */
177 else if (i->next_peer)
179 /* Otherwise, step back up the tree to the next peer. */
188 while (i->next_peer == NULL);
194 /* Reset inlining information of all incoming call edges of NODE. */
197 reset_inline_failed (struct cgraph_node *node)
199 struct cgraph_edge *e;
201 for (e = node->callers; e; e = e->next_caller)
203 e->callee->global.inlined_to = NULL;
205 e->inline_failed = CIF_BODY_NOT_AVAILABLE;
206 else if (node->local.redefined_extern_inline)
207 e->inline_failed = CIF_REDEFINED_EXTERN_INLINE;
208 else if (!node->local.inlinable)
209 e->inline_failed = CIF_FUNCTION_NOT_INLINABLE;
210 else if (e->call_stmt_cannot_inline_p)
211 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
213 e->inline_failed = CIF_FUNCTION_NOT_CONSIDERED;
217 /* Computes the frequency of the call statement so that it can be stored in
218 cgraph_edge. BB is the basic block of the call statement. */
220 compute_call_stmt_bb_frequency (tree decl, basic_block bb)
222 int entry_freq = ENTRY_BLOCK_PTR_FOR_FUNCTION
223 (DECL_STRUCT_FUNCTION (decl))->frequency;
224 int freq = bb->frequency;
226 if (profile_status_for_function (DECL_STRUCT_FUNCTION (decl)) == PROFILE_ABSENT)
227 return CGRAPH_FREQ_BASE;
230 entry_freq = 1, freq++;
232 freq = freq * CGRAPH_FREQ_BASE / entry_freq;
233 if (freq > CGRAPH_FREQ_MAX)
234 freq = CGRAPH_FREQ_MAX;
239 /* Mark address taken in STMT. */
242 mark_address (gimple stmt, tree addr, void *data)
244 addr = get_base_address (addr);
245 if (TREE_CODE (addr) == FUNCTION_DECL)
247 struct cgraph_node *node = cgraph_node (addr);
248 cgraph_mark_address_taken_node (node);
249 ipa_record_reference ((struct cgraph_node *)data, NULL,
253 else if (addr && TREE_CODE (addr) == VAR_DECL
254 && (TREE_STATIC (addr) || DECL_EXTERNAL (addr)))
256 struct varpool_node *vnode = varpool_node (addr);
259 if (lang_hooks.callgraph.analyze_expr)
260 lang_hooks.callgraph.analyze_expr (&addr, &walk_subtrees);
261 varpool_mark_needed_node (vnode);
262 if (vnode->alias && vnode->extra_name)
263 vnode = vnode->extra_name;
264 ipa_record_reference ((struct cgraph_node *)data, NULL,
272 /* Mark load of T. */
275 mark_load (gimple stmt, tree t, void *data)
277 t = get_base_address (t);
278 if (t && TREE_CODE (t) == FUNCTION_DECL)
280 /* ??? This can happen on platforms with descriptors when these are
281 directly manipulated in the code. Pretend that it's an address. */
282 struct cgraph_node *node = cgraph_node (t);
283 cgraph_mark_address_taken_node (node);
284 ipa_record_reference ((struct cgraph_node *)data, NULL,
288 else if (t && TREE_CODE (t) == VAR_DECL
289 && (TREE_STATIC (t) || DECL_EXTERNAL (t)))
291 struct varpool_node *vnode = varpool_node (t);
294 if (lang_hooks.callgraph.analyze_expr)
295 lang_hooks.callgraph.analyze_expr (&t, &walk_subtrees);
296 varpool_mark_needed_node (vnode);
297 if (vnode->alias && vnode->extra_name)
298 vnode = vnode->extra_name;
299 ipa_record_reference ((struct cgraph_node *)data, NULL,
306 /* Mark store of T. */
309 mark_store (gimple stmt, tree t, void *data)
311 t = get_base_address (t);
312 if (t && TREE_CODE (t) == VAR_DECL
313 && (TREE_STATIC (t) || DECL_EXTERNAL (t)))
315 struct varpool_node *vnode = varpool_node (t);
318 if (lang_hooks.callgraph.analyze_expr)
319 lang_hooks.callgraph.analyze_expr (&t, &walk_subtrees);
320 varpool_mark_needed_node (vnode);
321 if (vnode->alias && vnode->extra_name)
322 vnode = vnode->extra_name;
323 ipa_record_reference ((struct cgraph_node *)data, NULL,
325 IPA_REF_STORE, stmt);
330 /* Create cgraph edges for function calls.
331 Also look for functions and variables having addresses taken. */
334 build_cgraph_edges (void)
337 struct cgraph_node *node = cgraph_node (current_function_decl);
338 struct pointer_set_t *visited_nodes = pointer_set_create ();
339 gimple_stmt_iterator gsi;
343 /* Create the callgraph edges and record the nodes referenced by the function.
347 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
349 gimple stmt = gsi_stmt (gsi);
352 if (is_gimple_call (stmt))
354 int freq = compute_call_stmt_bb_frequency (current_function_decl,
356 decl = gimple_call_fndecl (stmt);
358 cgraph_create_edge (node, cgraph_node (decl), stmt,
362 cgraph_create_indirect_edge (node, stmt,
363 gimple_call_flags (stmt),
367 walk_stmt_load_store_addr_ops (stmt, node, mark_load,
368 mark_store, mark_address);
369 if (gimple_code (stmt) == GIMPLE_OMP_PARALLEL
370 && gimple_omp_parallel_child_fn (stmt))
372 tree fn = gimple_omp_parallel_child_fn (stmt);
373 ipa_record_reference (node, NULL, cgraph_node (fn),
374 NULL, IPA_REF_ADDR, stmt);
376 if (gimple_code (stmt) == GIMPLE_OMP_TASK)
378 tree fn = gimple_omp_task_child_fn (stmt);
380 ipa_record_reference (node, NULL, cgraph_node (fn),
381 NULL, IPA_REF_ADDR, stmt);
382 fn = gimple_omp_task_copy_fn (stmt);
384 ipa_record_reference (node, NULL, cgraph_node (fn),
385 NULL, IPA_REF_ADDR, stmt);
388 for (gsi = gsi_start (phi_nodes (bb)); !gsi_end_p (gsi); gsi_next (&gsi))
389 walk_stmt_load_store_addr_ops (gsi_stmt (gsi), node,
390 mark_load, mark_store, mark_address);
393 /* Look for initializers of constant variables and private statics. */
394 FOR_EACH_LOCAL_DECL (cfun, ix, decl)
395 if (TREE_CODE (decl) == VAR_DECL
396 && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl)))
397 varpool_finalize_decl (decl);
398 record_eh_tables (node, cfun);
400 pointer_set_destroy (visited_nodes);
404 struct gimple_opt_pass pass_build_cgraph_edges =
408 "*build_cgraph_edges", /* name */
410 build_cgraph_edges, /* execute */
413 0, /* static_pass_number */
415 PROP_cfg, /* properties_required */
416 0, /* properties_provided */
417 0, /* properties_destroyed */
418 0, /* todo_flags_start */
419 0 /* todo_flags_finish */
423 /* Record references to functions and other variables present in the
424 initial value of DECL, a variable.
425 When ONLY_VARS is true, we mark needed only variables, not functions. */
428 record_references_in_initializer (tree decl, bool only_vars)
430 struct pointer_set_t *visited_nodes = pointer_set_create ();
431 struct varpool_node *node = varpool_node (decl);
432 struct record_reference_ctx ctx = {false, NULL};
434 ctx.varpool_node = node;
435 ctx.only_vars = only_vars;
436 walk_tree (&DECL_INITIAL (decl), record_reference,
437 &ctx, visited_nodes);
438 pointer_set_destroy (visited_nodes);
441 /* Rebuild cgraph edges for current function node. This needs to be run after
442 passes that don't update the cgraph. */
445 rebuild_cgraph_edges (void)
448 struct cgraph_node *node = cgraph_node (current_function_decl);
449 gimple_stmt_iterator gsi;
451 cgraph_node_remove_callees (node);
452 ipa_remove_all_references (&node->ref_list);
454 node->count = ENTRY_BLOCK_PTR->count;
458 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
460 gimple stmt = gsi_stmt (gsi);
463 if (is_gimple_call (stmt))
465 int freq = compute_call_stmt_bb_frequency (current_function_decl,
467 decl = gimple_call_fndecl (stmt);
469 cgraph_create_edge (node, cgraph_node (decl), stmt,
473 cgraph_create_indirect_edge (node, stmt,
474 gimple_call_flags (stmt),
478 walk_stmt_load_store_addr_ops (stmt, node, mark_load,
479 mark_store, mark_address);
482 for (gsi = gsi_start (phi_nodes (bb)); !gsi_end_p (gsi); gsi_next (&gsi))
483 walk_stmt_load_store_addr_ops (gsi_stmt (gsi), node,
484 mark_load, mark_store, mark_address);
486 record_eh_tables (node, cfun);
487 gcc_assert (!node->global.inlined_to);
492 /* Rebuild cgraph edges for current function node. This needs to be run after
493 passes that don't update the cgraph. */
496 cgraph_rebuild_references (void)
499 struct cgraph_node *node = cgraph_node (current_function_decl);
500 gimple_stmt_iterator gsi;
502 ipa_remove_all_references (&node->ref_list);
504 node->count = ENTRY_BLOCK_PTR->count;
508 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
510 gimple stmt = gsi_stmt (gsi);
512 walk_stmt_load_store_addr_ops (stmt, node, mark_load,
513 mark_store, mark_address);
516 for (gsi = gsi_start (phi_nodes (bb)); !gsi_end_p (gsi); gsi_next (&gsi))
517 walk_stmt_load_store_addr_ops (gsi_stmt (gsi), node,
518 mark_load, mark_store, mark_address);
520 record_eh_tables (node, cfun);
523 struct gimple_opt_pass pass_rebuild_cgraph_edges =
527 "*rebuild_cgraph_edges", /* name */
529 rebuild_cgraph_edges, /* execute */
532 0, /* static_pass_number */
533 TV_CGRAPH, /* tv_id */
534 PROP_cfg, /* properties_required */
535 0, /* properties_provided */
536 0, /* properties_destroyed */
537 0, /* todo_flags_start */
538 0, /* todo_flags_finish */
544 remove_cgraph_callee_edges (void)
546 cgraph_node_remove_callees (cgraph_node (current_function_decl));
550 struct gimple_opt_pass pass_remove_cgraph_callee_edges =
554 "*remove_cgraph_callee_edges", /* name */
556 remove_cgraph_callee_edges, /* execute */
559 0, /* static_pass_number */
561 0, /* properties_required */
562 0, /* properties_provided */
563 0, /* properties_destroyed */
564 0, /* todo_flags_start */
565 0, /* todo_flags_finish */