1 /* Callgraph construction.
2 Copyright (C) 2003-2013 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
26 #include "tree-flow.h"
27 #include "langhooks.h"
28 #include "pointer-set.h"
32 #include "tree-pass.h"
33 #include "ipa-utils.h"
35 #include "ipa-inline.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 t = canonicalize_constructor_val (t, NULL);
62 switch (TREE_CODE (t))
71 /* Record dereferences to the functions. This makes the
72 functions reachable unconditionally. */
73 decl = get_base_var (*tp);
74 if (TREE_CODE (decl) == FUNCTION_DECL)
76 struct cgraph_node *node = cgraph_get_create_node (decl);
78 cgraph_mark_address_taken_node (node);
79 ipa_record_reference ((symtab_node)ctx->varpool_node,
84 if (TREE_CODE (decl) == VAR_DECL)
86 struct varpool_node *vnode = varpool_node_for_decl (decl);
87 ipa_record_reference ((symtab_node)ctx->varpool_node,
95 /* Save some cycles by not walking types and declaration as we
96 won't find anything useful there anyway. */
97 if (IS_TYPE_OR_DECL_P (*tp))
108 /* Record references to typeinfos in the type list LIST. */
111 record_type_list (struct cgraph_node *node, tree list)
113 for (; list; list = TREE_CHAIN (list))
115 tree type = TREE_VALUE (list);
118 type = lookup_type_for_runtime (type);
120 if (TREE_CODE (type) == ADDR_EXPR)
122 type = TREE_OPERAND (type, 0);
123 if (TREE_CODE (type) == VAR_DECL)
125 struct varpool_node *vnode = varpool_node_for_decl (type);
126 ipa_record_reference ((symtab_node)node,
134 /* Record all references we will introduce by producing EH tables
138 record_eh_tables (struct cgraph_node *node, struct function *fun)
142 if (DECL_FUNCTION_PERSONALITY (node->symbol.decl))
144 struct cgraph_node *per_node;
146 per_node = cgraph_get_create_node (DECL_FUNCTION_PERSONALITY (node->symbol.decl));
147 ipa_record_reference ((symtab_node)node, (symtab_node)per_node, IPA_REF_ADDR, NULL);
148 cgraph_mark_address_taken_node (per_node);
151 i = fun->eh->region_tree;
160 case ERT_MUST_NOT_THROW:
166 for (c = i->u.eh_try.first_catch; c; c = c->next_catch)
167 record_type_list (node, c->type_list);
171 case ERT_ALLOWED_EXCEPTIONS:
172 record_type_list (node, i->u.allowed.type_list);
175 /* If there are sub-regions, process them. */
178 /* If there are peers, process them. */
179 else if (i->next_peer)
181 /* Otherwise, step back up the tree to the next peer. */
190 while (i->next_peer == NULL);
196 /* Computes the frequency of the call statement so that it can be stored in
197 cgraph_edge. BB is the basic block of the call statement. */
199 compute_call_stmt_bb_frequency (tree decl, basic_block bb)
201 int entry_freq = ENTRY_BLOCK_PTR_FOR_FUNCTION
202 (DECL_STRUCT_FUNCTION (decl))->frequency;
203 int freq = bb->frequency;
205 if (profile_status_for_function (DECL_STRUCT_FUNCTION (decl)) == PROFILE_ABSENT)
206 return CGRAPH_FREQ_BASE;
209 entry_freq = 1, freq++;
211 freq = freq * CGRAPH_FREQ_BASE / entry_freq;
212 if (freq > CGRAPH_FREQ_MAX)
213 freq = CGRAPH_FREQ_MAX;
218 /* Mark address taken in STMT. */
221 mark_address (gimple stmt, tree addr, void *data)
223 addr = get_base_address (addr);
224 if (TREE_CODE (addr) == FUNCTION_DECL)
226 struct cgraph_node *node = cgraph_get_create_node (addr);
227 cgraph_mark_address_taken_node (node);
228 ipa_record_reference ((symtab_node)data,
232 else if (addr && TREE_CODE (addr) == VAR_DECL
233 && (TREE_STATIC (addr) || DECL_EXTERNAL (addr)))
235 struct varpool_node *vnode = varpool_node_for_decl (addr);
237 ipa_record_reference ((symtab_node)data,
245 /* Mark load of T. */
248 mark_load (gimple stmt, tree t, void *data)
250 t = get_base_address (t);
251 if (t && TREE_CODE (t) == FUNCTION_DECL)
253 /* ??? This can happen on platforms with descriptors when these are
254 directly manipulated in the code. Pretend that it's an address. */
255 struct cgraph_node *node = cgraph_get_create_node (t);
256 cgraph_mark_address_taken_node (node);
257 ipa_record_reference ((symtab_node)data,
261 else if (t && TREE_CODE (t) == VAR_DECL
262 && (TREE_STATIC (t) || DECL_EXTERNAL (t)))
264 struct varpool_node *vnode = varpool_node_for_decl (t);
266 ipa_record_reference ((symtab_node)data,
273 /* Mark store of T. */
276 mark_store (gimple stmt, tree t, void *data)
278 t = get_base_address (t);
279 if (t && TREE_CODE (t) == VAR_DECL
280 && (TREE_STATIC (t) || DECL_EXTERNAL (t)))
282 struct varpool_node *vnode = varpool_node_for_decl (t);
284 ipa_record_reference ((symtab_node)data,
286 IPA_REF_STORE, stmt);
291 /* Create cgraph edges for function calls.
292 Also look for functions and variables having addresses taken. */
295 build_cgraph_edges (void)
298 struct cgraph_node *node = cgraph_get_node (current_function_decl);
299 struct pointer_set_t *visited_nodes = pointer_set_create ();
300 gimple_stmt_iterator gsi;
304 /* Create the callgraph edges and record the nodes referenced by the function.
308 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
310 gimple stmt = gsi_stmt (gsi);
313 if (is_gimple_call (stmt))
315 int freq = compute_call_stmt_bb_frequency (current_function_decl,
317 decl = gimple_call_fndecl (stmt);
319 cgraph_create_edge (node, cgraph_get_create_node (decl),
320 stmt, bb->count, freq);
322 cgraph_create_indirect_edge (node, stmt,
323 gimple_call_flags (stmt),
326 walk_stmt_load_store_addr_ops (stmt, node, mark_load,
327 mark_store, mark_address);
328 if (gimple_code (stmt) == GIMPLE_OMP_PARALLEL
329 && gimple_omp_parallel_child_fn (stmt))
331 tree fn = gimple_omp_parallel_child_fn (stmt);
332 ipa_record_reference ((symtab_node)node,
333 (symtab_node)cgraph_get_create_node (fn),
336 if (gimple_code (stmt) == GIMPLE_OMP_TASK)
338 tree fn = gimple_omp_task_child_fn (stmt);
340 ipa_record_reference ((symtab_node)node,
341 (symtab_node) cgraph_get_create_node (fn),
343 fn = gimple_omp_task_copy_fn (stmt);
345 ipa_record_reference ((symtab_node)node,
346 (symtab_node)cgraph_get_create_node (fn),
350 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
351 walk_stmt_load_store_addr_ops (gsi_stmt (gsi), node,
352 mark_load, mark_store, mark_address);
355 /* Look for initializers of constant variables and private statics. */
356 FOR_EACH_LOCAL_DECL (cfun, ix, decl)
357 if (TREE_CODE (decl) == VAR_DECL
358 && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl))
359 && !DECL_HAS_VALUE_EXPR_P (decl))
360 varpool_finalize_decl (decl);
361 record_eh_tables (node, cfun);
363 pointer_set_destroy (visited_nodes);
367 struct gimple_opt_pass pass_build_cgraph_edges =
371 "*build_cgraph_edges", /* name */
372 OPTGROUP_NONE, /* optinfo_flags */
374 build_cgraph_edges, /* execute */
377 0, /* static_pass_number */
379 PROP_cfg, /* properties_required */
380 0, /* properties_provided */
381 0, /* properties_destroyed */
382 0, /* todo_flags_start */
383 0 /* todo_flags_finish */
387 /* Record references to functions and other variables present in the
388 initial value of DECL, a variable.
389 When ONLY_VARS is true, we mark needed only variables, not functions. */
392 record_references_in_initializer (tree decl, bool only_vars)
394 struct pointer_set_t *visited_nodes = pointer_set_create ();
395 struct varpool_node *node = varpool_node_for_decl (decl);
396 struct record_reference_ctx ctx = {false, NULL};
398 ctx.varpool_node = node;
399 ctx.only_vars = only_vars;
400 walk_tree (&DECL_INITIAL (decl), record_reference,
401 &ctx, visited_nodes);
402 pointer_set_destroy (visited_nodes);
405 /* Rebuild cgraph edges for current function node. This needs to be run after
406 passes that don't update the cgraph. */
409 rebuild_cgraph_edges (void)
412 struct cgraph_node *node = cgraph_get_node (current_function_decl);
413 gimple_stmt_iterator gsi;
415 cgraph_node_remove_callees (node);
416 ipa_remove_all_references (&node->symbol.ref_list);
418 node->count = ENTRY_BLOCK_PTR->count;
422 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
424 gimple stmt = gsi_stmt (gsi);
427 if (is_gimple_call (stmt))
429 int freq = compute_call_stmt_bb_frequency (current_function_decl,
431 decl = gimple_call_fndecl (stmt);
433 cgraph_create_edge (node, cgraph_get_create_node (decl), stmt,
436 cgraph_create_indirect_edge (node, stmt,
437 gimple_call_flags (stmt),
440 walk_stmt_load_store_addr_ops (stmt, node, mark_load,
441 mark_store, mark_address);
444 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
445 walk_stmt_load_store_addr_ops (gsi_stmt (gsi), node,
446 mark_load, mark_store, mark_address);
448 record_eh_tables (node, cfun);
449 gcc_assert (!node->global.inlined_to);
454 /* Rebuild cgraph edges for current function node. This needs to be run after
455 passes that don't update the cgraph. */
458 cgraph_rebuild_references (void)
461 struct cgraph_node *node = cgraph_get_node (current_function_decl);
462 gimple_stmt_iterator gsi;
464 ipa_remove_all_references (&node->symbol.ref_list);
466 node->count = ENTRY_BLOCK_PTR->count;
470 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
472 gimple stmt = gsi_stmt (gsi);
474 walk_stmt_load_store_addr_ops (stmt, node, mark_load,
475 mark_store, mark_address);
478 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
479 walk_stmt_load_store_addr_ops (gsi_stmt (gsi), node,
480 mark_load, mark_store, mark_address);
482 record_eh_tables (node, cfun);
485 struct gimple_opt_pass pass_rebuild_cgraph_edges =
489 "*rebuild_cgraph_edges", /* name */
490 OPTGROUP_NONE, /* optinfo_flags */
492 rebuild_cgraph_edges, /* execute */
495 0, /* static_pass_number */
496 TV_CGRAPH, /* tv_id */
497 PROP_cfg, /* properties_required */
498 0, /* properties_provided */
499 0, /* properties_destroyed */
500 0, /* todo_flags_start */
501 0, /* todo_flags_finish */
507 remove_cgraph_callee_edges (void)
509 cgraph_node_remove_callees (cgraph_get_node (current_function_decl));
513 struct gimple_opt_pass pass_remove_cgraph_callee_edges =
517 "*remove_cgraph_callee_edges", /* name */
518 OPTGROUP_NONE, /* optinfo_flags */
520 remove_cgraph_callee_edges, /* execute */
523 0, /* static_pass_number */
525 0, /* properties_required */
526 0, /* properties_provided */
527 0, /* properties_destroyed */
528 0, /* todo_flags_start */
529 0, /* todo_flags_finish */