1 /* Callgraph construction.
2 Copyright (C) 2003-2016 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"
27 #include "tree-pass.h"
29 #include "gimple-fold.h"
30 #include "gimple-iterator.h"
31 #include "gimple-walk.h"
32 #include "ipa-utils.h"
35 /* Context of record_reference. */
36 struct record_reference_ctx
39 class varpool_node
*varpool_node
;
42 /* Walk tree and record all calls and references to functions/variables.
43 Called via walk_tree: TP is pointer to tree to be examined.
44 When DATA is non-null, record references to callgraph.
48 record_reference (tree
*tp
, int *walk_subtrees
, void *data
)
52 record_reference_ctx
*ctx
= (record_reference_ctx
*)data
;
54 t
= canonicalize_constructor_val (t
, NULL
);
60 switch (TREE_CODE (t
))
69 /* Record dereferences to the functions. This makes the
70 functions reachable unconditionally. */
71 decl
= get_base_var (*tp
);
72 if (TREE_CODE (decl
) == FUNCTION_DECL
)
74 cgraph_node
*node
= cgraph_node::get_create (decl
);
76 node
->mark_address_taken ();
77 ctx
->varpool_node
->create_reference (node
, IPA_REF_ADDR
);
82 varpool_node
*vnode
= varpool_node::get_create (decl
);
83 ctx
->varpool_node
->create_reference (vnode
, IPA_REF_ADDR
);
89 /* Save some cycles by not walking types and declaration as we
90 won't find anything useful there anyway. */
91 if (IS_TYPE_OR_DECL_P (*tp
))
102 /* Record references to typeinfos in the type list LIST. */
105 record_type_list (cgraph_node
*node
, tree list
)
107 for (; list
; list
= TREE_CHAIN (list
))
109 tree type
= TREE_VALUE (list
);
112 type
= lookup_type_for_runtime (type
);
114 if (TREE_CODE (type
) == ADDR_EXPR
)
116 type
= TREE_OPERAND (type
, 0);
119 varpool_node
*vnode
= varpool_node::get_create (type
);
120 node
->create_reference (vnode
, IPA_REF_ADDR
);
126 /* Record all references we will introduce by producing EH tables
130 record_eh_tables (cgraph_node
*node
, function
*fun
)
134 if (DECL_FUNCTION_PERSONALITY (node
->decl
))
136 tree per_decl
= DECL_FUNCTION_PERSONALITY (node
->decl
);
137 cgraph_node
*per_node
= cgraph_node::get_create (per_decl
);
139 node
->create_reference (per_node
, IPA_REF_ADDR
);
140 per_node
->mark_address_taken ();
143 i
= fun
->eh
->region_tree
;
152 case ERT_MUST_NOT_THROW
:
158 for (c
= i
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
159 record_type_list (node
, c
->type_list
);
163 case ERT_ALLOWED_EXCEPTIONS
:
164 record_type_list (node
, i
->u
.allowed
.type_list
);
167 /* If there are sub-regions, process them. */
170 /* If there are peers, process them. */
171 else if (i
->next_peer
)
173 /* Otherwise, step back up the tree to the next peer. */
182 while (i
->next_peer
== NULL
);
188 /* Computes the frequency of the call statement so that it can be stored in
189 cgraph_edge. BB is the basic block of the call statement. */
191 compute_call_stmt_bb_frequency (tree decl
, basic_block bb
)
193 int entry_freq
= ENTRY_BLOCK_PTR_FOR_FN
194 (DECL_STRUCT_FUNCTION (decl
))->frequency
;
195 int freq
= bb
->frequency
;
197 if (profile_status_for_fn (DECL_STRUCT_FUNCTION (decl
)) == PROFILE_ABSENT
)
198 return CGRAPH_FREQ_BASE
;
201 entry_freq
= 1, freq
++;
203 freq
= freq
* CGRAPH_FREQ_BASE
/ entry_freq
;
204 if (freq
> CGRAPH_FREQ_MAX
)
205 freq
= CGRAPH_FREQ_MAX
;
210 /* Mark address taken in STMT. */
213 mark_address (gimple
*stmt
, tree addr
, tree
, void *data
)
215 addr
= get_base_address (addr
);
216 if (TREE_CODE (addr
) == FUNCTION_DECL
)
218 cgraph_node
*node
= cgraph_node::get_create (addr
);
219 node
->mark_address_taken ();
220 ((symtab_node
*)data
)->create_reference (node
, IPA_REF_ADDR
, stmt
);
222 else if (addr
&& VAR_P (addr
)
223 && (TREE_STATIC (addr
) || DECL_EXTERNAL (addr
)))
225 varpool_node
*vnode
= varpool_node::get_create (addr
);
227 ((symtab_node
*)data
)->create_reference (vnode
, IPA_REF_ADDR
, stmt
);
233 /* Mark load of T. */
236 mark_load (gimple
*stmt
, tree t
, tree
, void *data
)
238 t
= get_base_address (t
);
239 if (t
&& TREE_CODE (t
) == FUNCTION_DECL
)
241 /* ??? This can happen on platforms with descriptors when these are
242 directly manipulated in the code. Pretend that it's an address. */
243 cgraph_node
*node
= cgraph_node::get_create (t
);
244 node
->mark_address_taken ();
245 ((symtab_node
*)data
)->create_reference (node
, IPA_REF_ADDR
, stmt
);
247 else if (t
&& VAR_P (t
) && (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
249 varpool_node
*vnode
= varpool_node::get_create (t
);
251 ((symtab_node
*)data
)->create_reference (vnode
, IPA_REF_LOAD
, stmt
);
256 /* Mark store of T. */
259 mark_store (gimple
*stmt
, tree t
, tree
, void *data
)
261 t
= get_base_address (t
);
262 if (t
&& VAR_P (t
) && (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
264 varpool_node
*vnode
= varpool_node::get_create (t
);
266 ((symtab_node
*)data
)->create_reference (vnode
, IPA_REF_STORE
, stmt
);
271 /* Record all references from cgraph_node that are taken in statement STMT. */
274 cgraph_node::record_stmt_references (gimple
*stmt
)
276 walk_stmt_load_store_addr_ops (stmt
, this, mark_load
, mark_store
,
280 /* Create cgraph edges for function calls.
281 Also look for functions and variables having addresses taken. */
285 const pass_data pass_data_build_cgraph_edges
=
287 GIMPLE_PASS
, /* type */
288 "*build_cgraph_edges", /* name */
289 OPTGROUP_NONE
, /* optinfo_flags */
291 PROP_cfg
, /* properties_required */
292 0, /* properties_provided */
293 0, /* properties_destroyed */
294 0, /* todo_flags_start */
295 0, /* todo_flags_finish */
298 class pass_build_cgraph_edges
: public gimple_opt_pass
301 pass_build_cgraph_edges (gcc::context
*ctxt
)
302 : gimple_opt_pass (pass_data_build_cgraph_edges
, ctxt
)
305 /* opt_pass methods: */
306 virtual unsigned int execute (function
*);
308 }; // class pass_build_cgraph_edges
311 pass_build_cgraph_edges::execute (function
*fun
)
314 cgraph_node
*node
= cgraph_node::get (current_function_decl
);
315 gimple_stmt_iterator gsi
;
319 /* Create the callgraph edges and record the nodes referenced by the function.
321 FOR_EACH_BB_FN (bb
, fun
)
323 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
325 gimple
*stmt
= gsi_stmt (gsi
);
328 if (is_gimple_debug (stmt
))
331 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
333 int freq
= compute_call_stmt_bb_frequency (current_function_decl
,
335 decl
= gimple_call_fndecl (call_stmt
);
337 node
->create_edge (cgraph_node::get_create (decl
), call_stmt
, bb
->count
, freq
);
338 else if (gimple_call_internal_p (call_stmt
))
341 node
->create_indirect_edge (call_stmt
,
342 gimple_call_flags (call_stmt
),
345 node
->record_stmt_references (stmt
);
346 if (gomp_parallel
*omp_par_stmt
= dyn_cast
<gomp_parallel
*> (stmt
))
348 tree fn
= gimple_omp_parallel_child_fn (omp_par_stmt
);
349 node
->create_reference (cgraph_node::get_create (fn
),
352 if (gimple_code (stmt
) == GIMPLE_OMP_TASK
)
354 tree fn
= gimple_omp_task_child_fn (stmt
);
356 node
->create_reference (cgraph_node::get_create (fn
),
358 fn
= gimple_omp_task_copy_fn (stmt
);
360 node
->create_reference (cgraph_node::get_create (fn
),
364 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
365 node
->record_stmt_references (gsi_stmt (gsi
));
368 /* Look for initializers of constant variables and private statics. */
369 FOR_EACH_LOCAL_DECL (fun
, ix
, decl
)
371 && (TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
))
372 && !DECL_HAS_VALUE_EXPR_P (decl
)
373 && TREE_TYPE (decl
) != error_mark_node
)
374 varpool_node::finalize_decl (decl
);
375 record_eh_tables (node
, fun
);
383 make_pass_build_cgraph_edges (gcc::context
*ctxt
)
385 return new pass_build_cgraph_edges (ctxt
);
388 /* Record references to functions and other variables present in the
389 initial value of DECL, a variable.
390 When ONLY_VARS is true, we mark needed only variables, not functions. */
393 record_references_in_initializer (tree decl
, bool only_vars
)
395 varpool_node
*node
= varpool_node::get_create (decl
);
396 hash_set
<tree
> visited_nodes
;
397 record_reference_ctx ctx
= {false, NULL
};
399 ctx
.varpool_node
= node
;
400 ctx
.only_vars
= only_vars
;
401 walk_tree (&DECL_INITIAL (decl
), record_reference
,
402 &ctx
, &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 cgraph_edge::rebuild_edges (void)
412 cgraph_node
*node
= cgraph_node::get (current_function_decl
);
413 gimple_stmt_iterator gsi
;
415 node
->remove_callees ();
416 node
->remove_all_references ();
418 node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
420 FOR_EACH_BB_FN (bb
, cfun
)
422 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
424 gimple
*stmt
= gsi_stmt (gsi
);
427 if (gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
))
429 int freq
= compute_call_stmt_bb_frequency (current_function_decl
,
431 decl
= gimple_call_fndecl (call_stmt
);
433 node
->create_edge (cgraph_node::get_create (decl
), call_stmt
,
435 else if (gimple_call_internal_p (call_stmt
))
438 node
->create_indirect_edge (call_stmt
,
439 gimple_call_flags (call_stmt
),
442 node
->record_stmt_references (stmt
);
444 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
445 node
->record_stmt_references (gsi_stmt (gsi
));
447 record_eh_tables (node
, cfun
);
448 gcc_assert (!node
->global
.inlined_to
);
450 if (node
->instrumented_version
451 && !node
->instrumentation_clone
)
452 node
->create_reference (node
->instrumented_version
, IPA_REF_CHKP
, NULL
);
457 /* Rebuild cgraph references for current function node. This needs to be run
458 after passes that don't update the cgraph. */
461 cgraph_edge::rebuild_references (void)
464 cgraph_node
*node
= cgraph_node::get (current_function_decl
);
465 gimple_stmt_iterator gsi
;
469 /* Keep speculative references for further cgraph edge expansion. */
470 for (i
= 0; node
->iterate_reference (i
, ref
);)
471 if (!ref
->speculative
)
472 ref
->remove_reference ();
476 node
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
478 FOR_EACH_BB_FN (bb
, cfun
)
480 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
481 node
->record_stmt_references (gsi_stmt (gsi
));
482 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
483 node
->record_stmt_references (gsi_stmt (gsi
));
485 record_eh_tables (node
, cfun
);
487 if (node
->instrumented_version
488 && !node
->instrumentation_clone
)
489 node
->create_reference (node
->instrumented_version
, IPA_REF_CHKP
, NULL
);
494 const pass_data pass_data_rebuild_cgraph_edges
=
496 GIMPLE_PASS
, /* type */
497 "*rebuild_cgraph_edges", /* name */
498 OPTGROUP_NONE
, /* optinfo_flags */
499 TV_CGRAPH
, /* tv_id */
500 PROP_cfg
, /* properties_required */
501 0, /* properties_provided */
502 0, /* properties_destroyed */
503 0, /* todo_flags_start */
504 0, /* todo_flags_finish */
507 class pass_rebuild_cgraph_edges
: public gimple_opt_pass
510 pass_rebuild_cgraph_edges (gcc::context
*ctxt
)
511 : gimple_opt_pass (pass_data_rebuild_cgraph_edges
, ctxt
)
514 /* opt_pass methods: */
515 opt_pass
* clone () { return new pass_rebuild_cgraph_edges (m_ctxt
); }
516 virtual unsigned int execute (function
*)
518 return cgraph_edge::rebuild_edges ();
521 }; // class pass_rebuild_cgraph_edges
526 make_pass_rebuild_cgraph_edges (gcc::context
*ctxt
)
528 return new pass_rebuild_cgraph_edges (ctxt
);
534 const pass_data pass_data_remove_cgraph_callee_edges
=
536 GIMPLE_PASS
, /* type */
537 "*remove_cgraph_callee_edges", /* name */
538 OPTGROUP_NONE
, /* optinfo_flags */
540 0, /* properties_required */
541 0, /* properties_provided */
542 0, /* properties_destroyed */
543 0, /* todo_flags_start */
544 0, /* todo_flags_finish */
547 class pass_remove_cgraph_callee_edges
: public gimple_opt_pass
550 pass_remove_cgraph_callee_edges (gcc::context
*ctxt
)
551 : gimple_opt_pass (pass_data_remove_cgraph_callee_edges
, ctxt
)
554 /* opt_pass methods: */
555 opt_pass
* clone () {
556 return new pass_remove_cgraph_callee_edges (m_ctxt
);
558 virtual unsigned int execute (function
*);
560 }; // class pass_remove_cgraph_callee_edges
563 pass_remove_cgraph_callee_edges::execute (function
*)
565 cgraph_node
*node
= cgraph_node::get (current_function_decl
);
566 node
->remove_callees ();
567 node
->remove_all_references ();
574 make_pass_remove_cgraph_callee_edges (gcc::context
*ctxt
)
576 return new pass_remove_cgraph_callee_edges (ctxt
);