1 /* Callgraph handling code.
2 Copyright (C) 2003-2014 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/>. */
21 /* This file contains basic routines manipulating call graph
23 The call-graph is a data structure designed for intra-procedural optimization.
24 It represents a multi-graph where nodes are functions and edges are call sites. */
28 #include "coretypes.h"
33 #include "print-tree.h"
34 #include "tree-inline.h"
35 #include "langhooks.h"
43 #include "dominance.h"
45 #include "basic-block.h"
48 #include "plugin-api.h"
51 #include "hard-reg-set.h"
57 #include "tree-ssa-alias.h"
58 #include "internal-fn.h"
60 #include "gimple-expr.h"
62 #include "gimple-iterator.h"
65 #include "gimple-ssa.h"
68 #include "value-prof.h"
70 #include "diagnostic-core.h"
72 #include "ipa-utils.h"
73 #include "lto-streamer.h"
74 #include "alloc-pool.h"
76 #include "ipa-inline.h"
78 #include "gimple-pretty-print.h"
83 #include "tree-chkp.h"
86 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
87 #include "tree-pass.h"
89 /* Queue of cgraph nodes scheduled to be lowered. */
90 symtab_node
*x_cgraph_nodes_queue
;
91 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
93 /* Symbol table global context. */
96 /* List of hooks triggered on cgraph_edge events. */
97 struct cgraph_edge_hook_list
{
98 cgraph_edge_hook hook
;
100 struct cgraph_edge_hook_list
*next
;
103 /* List of hooks triggered on cgraph_node events. */
104 struct cgraph_node_hook_list
{
105 cgraph_node_hook hook
;
107 struct cgraph_node_hook_list
*next
;
110 /* List of hooks triggered on events involving two cgraph_edges. */
111 struct cgraph_2edge_hook_list
{
112 cgraph_2edge_hook hook
;
114 struct cgraph_2edge_hook_list
*next
;
117 /* List of hooks triggered on events involving two cgraph_nodes. */
118 struct cgraph_2node_hook_list
{
119 cgraph_2node_hook hook
;
121 struct cgraph_2node_hook_list
*next
;
124 /* Hash descriptor for cgraph_function_version_info. */
126 struct function_version_hasher
: ggc_hasher
<cgraph_function_version_info
*>
128 static hashval_t
hash (cgraph_function_version_info
*);
129 static bool equal (cgraph_function_version_info
*,
130 cgraph_function_version_info
*);
133 /* Map a cgraph_node to cgraph_function_version_info using this htab.
134 The cgraph_function_version_info has a THIS_NODE field that is the
135 corresponding cgraph_node.. */
137 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
139 /* Hash function for cgraph_fnver_htab. */
141 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
143 int uid
= ptr
->this_node
->uid
;
144 return (hashval_t
)(uid
);
147 /* eq function for cgraph_fnver_htab. */
149 function_version_hasher::equal (cgraph_function_version_info
*n1
,
150 cgraph_function_version_info
*n2
)
152 return n1
->this_node
->uid
== n2
->this_node
->uid
;
155 /* Mark as GC root all allocated nodes. */
156 static GTY(()) struct cgraph_function_version_info
*
157 version_info_node
= NULL
;
159 /* Get the cgraph_function_version_info node corresponding to node. */
160 cgraph_function_version_info
*
161 cgraph_node::function_version (void)
163 cgraph_function_version_info key
;
164 key
.this_node
= this;
166 if (cgraph_fnver_htab
== NULL
)
169 return cgraph_fnver_htab
->find (&key
);
172 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
173 corresponding to cgraph_node NODE. */
174 cgraph_function_version_info
*
175 cgraph_node::insert_new_function_version (void)
177 version_info_node
= NULL
;
178 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
179 version_info_node
->this_node
= this;
181 if (cgraph_fnver_htab
== NULL
)
182 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
184 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
186 return version_info_node
;
189 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
190 DECL is a duplicate declaration. */
192 cgraph_node::delete_function_version (tree decl
)
194 cgraph_node
*decl_node
= cgraph_node::get (decl
);
195 cgraph_function_version_info
*decl_v
= NULL
;
197 if (decl_node
== NULL
)
200 decl_v
= decl_node
->function_version ();
205 if (decl_v
->prev
!= NULL
)
206 decl_v
->prev
->next
= decl_v
->next
;
208 if (decl_v
->next
!= NULL
)
209 decl_v
->next
->prev
= decl_v
->prev
;
211 if (cgraph_fnver_htab
!= NULL
)
212 cgraph_fnver_htab
->remove_elt (decl_v
);
214 decl_node
->remove ();
217 /* Record that DECL1 and DECL2 are semantically identical function
220 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
222 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
223 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
224 cgraph_function_version_info
*decl1_v
= NULL
;
225 cgraph_function_version_info
*decl2_v
= NULL
;
226 cgraph_function_version_info
*before
;
227 cgraph_function_version_info
*after
;
229 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
230 decl1_v
= decl1_node
->function_version ();
231 decl2_v
= decl2_node
->function_version ();
233 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
237 decl1_v
= decl1_node
->insert_new_function_version ();
240 decl2_v
= decl2_node
->insert_new_function_version ();
242 /* Chain decl2_v and decl1_v. All semantically identical versions
243 will be chained together. */
248 while (before
->next
!= NULL
)
249 before
= before
->next
;
251 while (after
->prev
!= NULL
)
254 before
->next
= after
;
255 after
->prev
= before
;
258 /* Initialize callgraph dump file. */
261 symbol_table::initialize (void)
264 dump_file
= dump_begin (TDI_cgraph
, NULL
);
267 /* Allocate new callgraph node and insert it into basic data structures. */
270 symbol_table::create_empty (void)
272 cgraph_node
*node
= allocate_cgraph_symbol ();
274 node
->type
= SYMTAB_FUNCTION
;
275 node
->frequency
= NODE_FREQUENCY_NORMAL
;
276 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
282 /* Register HOOK to be called with DATA on each removed edge. */
283 cgraph_edge_hook_list
*
284 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
286 cgraph_edge_hook_list
*entry
;
287 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
289 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
299 /* Remove ENTRY from the list of hooks called on removing edges. */
301 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
303 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
305 while (*ptr
!= entry
)
311 /* Call all edge removal hooks. */
313 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
315 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
318 entry
->hook (e
, entry
->data
);
323 /* Register HOOK to be called with DATA on each removed node. */
324 cgraph_node_hook_list
*
325 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
327 cgraph_node_hook_list
*entry
;
328 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
330 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
340 /* Remove ENTRY from the list of hooks called on removing nodes. */
342 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
344 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
346 while (*ptr
!= entry
)
352 /* Call all node removal hooks. */
354 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
356 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
359 entry
->hook (node
, entry
->data
);
364 /* Call all node removal hooks. */
366 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
368 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
371 entry
->hook (node
, entry
->data
);
377 /* Register HOOK to be called with DATA on each inserted node. */
378 cgraph_node_hook_list
*
379 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
381 cgraph_node_hook_list
*entry
;
382 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
384 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
394 /* Remove ENTRY from the list of hooks called on inserted nodes. */
396 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
398 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
400 while (*ptr
!= entry
)
406 /* Register HOOK to be called with DATA on each duplicated edge. */
407 cgraph_2edge_hook_list
*
408 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
410 cgraph_2edge_hook_list
*entry
;
411 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
413 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
423 /* Remove ENTRY from the list of hooks called on duplicating edges. */
425 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
427 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
429 while (*ptr
!= entry
)
435 /* Call all edge duplication hooks. */
437 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
439 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
442 entry
->hook (cs1
, cs2
, entry
->data
);
447 /* Register HOOK to be called with DATA on each duplicated node. */
448 cgraph_2node_hook_list
*
449 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
451 cgraph_2node_hook_list
*entry
;
452 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
454 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
464 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
466 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
468 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
470 while (*ptr
!= entry
)
476 /* Call all node duplication hooks. */
478 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
481 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
484 entry
->hook (node
, node2
, entry
->data
);
489 /* Return cgraph node assigned to DECL. Create new one when needed. */
492 cgraph_node::create (tree decl
)
494 cgraph_node
*node
= symtab
->create_empty ();
495 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
500 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
502 node
->offloadable
= 1;
503 g
->have_offload
= true;
506 node
->register_symbol ();
508 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
510 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
511 node
->next_nested
= node
->origin
->nested
;
512 node
->origin
->nested
= node
;
517 /* Try to find a call graph node for declaration DECL and if it does not exist
518 or if it corresponds to an inline clone, create a new one. */
521 cgraph_node::get_create (tree decl
)
523 cgraph_node
*first_clone
= cgraph_node::get (decl
);
525 if (first_clone
&& !first_clone
->global
.inlined_to
)
528 cgraph_node
*node
= cgraph_node::create (decl
);
531 first_clone
->clone_of
= node
;
532 node
->clones
= first_clone
;
533 symtab
->symtab_prevail_in_asm_name_hash (node
);
534 node
->decl
->decl_with_vis
.symtab_node
= node
;
536 fprintf (dump_file
, "Introduced new external node "
537 "(%s/%i) and turned into root of the clone tree.\n",
538 xstrdup (node
->name ()), node
->order
);
541 fprintf (dump_file
, "Introduced new external node "
542 "(%s/%i).\n", xstrdup (node
->name ()),
547 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
548 the function body is associated with (not necessarily cgraph_node (DECL). */
551 cgraph_node::create_alias (tree alias
, tree target
)
553 cgraph_node
*alias_node
;
555 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
556 || TREE_CODE (target
) == IDENTIFIER_NODE
);
557 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
558 alias_node
= cgraph_node::get_create (alias
);
559 gcc_assert (!alias_node
->definition
);
560 alias_node
->alias_target
= target
;
561 alias_node
->definition
= true;
562 alias_node
->alias
= true;
563 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
564 alias_node
->weakref
= true;
568 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
570 Same body aliases are output whenever the body of DECL is output,
571 and cgraph_node::get (ALIAS) transparently returns
572 cgraph_node::get (DECL). */
575 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
578 #ifndef ASM_OUTPUT_DEF
579 /* If aliases aren't supported by the assembler, fail. */
582 /* Langhooks can create same body aliases of symbols not defined.
583 Those are useless. Drop them on the floor. */
584 if (symtab
->global_info_ready
)
587 n
= cgraph_node::create_alias (alias
, decl
);
588 n
->cpp_implicit_alias
= true;
589 if (symtab
->cpp_implicit_aliases_done
)
590 n
->resolve_alias (cgraph_node::get (decl
));
594 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
595 aliases DECL with an adjustments made into the first parameter.
596 See comments in thunk_adjust for detail on the parameters. */
599 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
600 HOST_WIDE_INT fixed_offset
,
601 HOST_WIDE_INT virtual_value
,
607 node
= cgraph_node::get (alias
);
611 node
= cgraph_node::create (alias
);
612 gcc_checking_assert (!virtual_offset
613 || wi::eq_p (virtual_offset
, virtual_value
));
614 node
->thunk
.fixed_offset
= fixed_offset
;
615 node
->thunk
.this_adjusting
= this_adjusting
;
616 node
->thunk
.virtual_value
= virtual_value
;
617 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
618 node
->thunk
.alias
= real_alias
;
619 node
->thunk
.thunk_p
= true;
620 node
->definition
= true;
625 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
626 Return NULL if there's no such node. */
629 cgraph_node::get_for_asmname (tree asmname
)
631 /* We do not want to look at inline clones. */
632 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
634 node
= node
->next_sharing_asm_name
)
636 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
637 if (cn
&& !cn
->global
.inlined_to
)
643 /* Returns a hash value for X (which really is a cgraph_edge). */
646 cgraph_edge_hasher::hash (cgraph_edge
*e
)
648 return htab_hash_pointer (e
->call_stmt
);
651 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
654 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple y
)
656 return x
->call_stmt
== y
;
659 /* Add call graph edge E to call site hash of its caller. */
662 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
664 gimple call
= e
->call_stmt
;
665 *e
->caller
->call_site_hash
->find_slot_with_hash (call
,
666 htab_hash_pointer (call
),
670 /* Add call graph edge E to call site hash of its caller. */
673 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
675 /* There are two speculative edges for every statement (one direct,
676 one indirect); always hash the direct one. */
677 if (e
->speculative
&& e
->indirect_unknown_callee
)
679 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
681 htab_hash_pointer (e
->call_stmt
), INSERT
);
684 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
689 gcc_assert (!*slot
|| e
->speculative
);
693 /* Return the callgraph edge representing the GIMPLE_CALL statement
697 cgraph_node::get_edge (gimple call_stmt
)
703 return call_site_hash
->find_with_hash (call_stmt
,
704 htab_hash_pointer (call_stmt
));
706 /* This loop may turn out to be performance problem. In such case adding
707 hashtables into call nodes with very many edges is probably best
708 solution. It is not good idea to add pointer into CALL_EXPR itself
709 because we want to make possible having multiple cgraph nodes representing
710 different clones of the same body before the body is actually cloned. */
711 for (e
= callees
; e
; e
= e
->next_callee
)
713 if (e
->call_stmt
== call_stmt
)
719 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
721 if (e
->call_stmt
== call_stmt
)
728 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
729 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
730 cgraph_add_edge_to_call_site_hash (e2
);
731 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
732 cgraph_add_edge_to_call_site_hash (e2
);
739 /* Change field call_stmt of edge to NEW_STMT.
740 If UPDATE_SPECULATIVE and E is any component of speculative
741 edge, then update all components. */
744 cgraph_edge::set_call_stmt (gimple new_stmt
, bool update_speculative
)
748 /* Speculative edges has three component, update all of them
750 if (update_speculative
&& speculative
)
752 cgraph_edge
*direct
, *indirect
;
755 speculative_call_info (direct
, indirect
, ref
);
756 direct
->set_call_stmt (new_stmt
, false);
757 indirect
->set_call_stmt (new_stmt
, false);
758 ref
->stmt
= new_stmt
;
762 /* Only direct speculative edges go to call_site_hash. */
763 if (caller
->call_site_hash
764 && (!speculative
|| !indirect_unknown_callee
))
766 caller
->call_site_hash
->remove_elt_with_hash
767 (call_stmt
, htab_hash_pointer (call_stmt
));
770 cgraph_edge
*e
= this;
772 call_stmt
= new_stmt
;
773 if (indirect_unknown_callee
774 && (decl
= gimple_call_fndecl (new_stmt
)))
776 /* Constant propagation (and possibly also inlining?) can turn an
777 indirect call into a direct one. */
778 cgraph_node
*new_callee
= cgraph_node::get (decl
);
780 gcc_checking_assert (new_callee
);
781 e
= make_direct (new_callee
);
784 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
785 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
787 if (e
->caller
->call_site_hash
)
788 cgraph_add_edge_to_call_site_hash (e
);
791 /* Allocate a cgraph_edge structure and fill it with data according to the
792 parameters of which only CALLEE can be NULL (when creating an indirect call
796 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
797 gimple call_stmt
, gcov_type count
, int freq
,
798 bool indir_unknown_callee
)
802 /* LTO does not actually have access to the call_stmt since these
803 have not been loaded yet. */
806 /* This is a rather expensive check possibly triggering
807 construction of call stmt hashtable. */
808 #ifdef ENABLE_CHECKING
810 gcc_checking_assert (
811 !(e
= caller
->get_edge (call_stmt
)) || e
->speculative
);
814 gcc_assert (is_gimple_call (call_stmt
));
820 free_edges
= NEXT_FREE_EDGE (edge
);
824 edge
= ggc_alloc
<cgraph_edge
> ();
825 edge
->uid
= edges_max_uid
++;
831 edge
->caller
= caller
;
832 edge
->callee
= callee
;
833 edge
->prev_caller
= NULL
;
834 edge
->next_caller
= NULL
;
835 edge
->prev_callee
= NULL
;
836 edge
->next_callee
= NULL
;
837 edge
->lto_stmt_uid
= 0;
840 gcc_assert (count
>= 0);
841 edge
->frequency
= freq
;
842 gcc_assert (freq
>= 0);
843 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
845 edge
->call_stmt
= call_stmt
;
846 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
847 edge
->can_throw_external
848 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
851 && callee
&& callee
->decl
852 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
854 edge
->call_stmt_cannot_inline_p
= true;
856 edge
->call_stmt_cannot_inline_p
= false;
858 edge
->indirect_info
= NULL
;
859 edge
->indirect_inlining_edge
= 0;
860 edge
->speculative
= false;
861 edge
->indirect_unknown_callee
= indir_unknown_callee
;
862 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
863 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
864 edge
->in_polymorphic_cdtor
865 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
868 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
869 if (call_stmt
&& caller
->call_site_hash
)
870 cgraph_add_edge_to_call_site_hash (edge
);
875 /* Create edge from a given function to CALLEE in the cgraph. */
878 cgraph_node::create_edge (cgraph_node
*callee
,
879 gimple call_stmt
, gcov_type count
, int freq
)
881 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
884 initialize_inline_failed (edge
);
886 edge
->next_caller
= callee
->callers
;
888 callee
->callers
->prev_caller
= edge
;
889 edge
->next_callee
= callees
;
891 callees
->prev_callee
= edge
;
893 callee
->callers
= edge
;
898 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
900 cgraph_indirect_call_info
*
901 cgraph_allocate_init_indirect_info (void)
903 cgraph_indirect_call_info
*ii
;
905 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
906 ii
->param_index
= -1;
910 /* Create an indirect edge with a yet-undetermined callee where the call
911 statement destination is a formal parameter of the caller with index
915 cgraph_node::create_indirect_edge (gimple call_stmt
, int ecf_flags
,
916 gcov_type count
, int freq
,
917 bool compute_indirect_info
)
919 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
923 initialize_inline_failed (edge
);
925 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
926 edge
->indirect_info
->ecf_flags
= ecf_flags
;
927 edge
->indirect_info
->vptr_changed
= true;
929 /* Record polymorphic call info. */
930 if (compute_indirect_info
932 && (target
= gimple_call_fn (call_stmt
))
933 && virtual_method_call_p (target
))
935 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
937 /* Only record types can have virtual calls. */
938 edge
->indirect_info
->polymorphic
= true;
939 edge
->indirect_info
->param_index
= -1;
940 edge
->indirect_info
->otr_token
941 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
942 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
943 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
944 edge
->indirect_info
->context
= context
;
947 edge
->next_callee
= indirect_calls
;
949 indirect_calls
->prev_callee
= edge
;
950 indirect_calls
= edge
;
955 /* Remove the edge from the list of the callers of the callee. */
958 cgraph_edge::remove_callee (void)
960 gcc_assert (!indirect_unknown_callee
);
962 prev_caller
->next_caller
= next_caller
;
964 next_caller
->prev_caller
= prev_caller
;
966 callee
->callers
= next_caller
;
969 /* Remove the edge from the list of the callees of the caller. */
972 cgraph_edge::remove_caller (void)
975 prev_callee
->next_callee
= next_callee
;
977 next_callee
->prev_callee
= prev_callee
;
980 if (indirect_unknown_callee
)
981 caller
->indirect_calls
= next_callee
;
983 caller
->callees
= next_callee
;
985 if (caller
->call_site_hash
)
986 caller
->call_site_hash
->remove_elt_with_hash (call_stmt
,
987 htab_hash_pointer (call_stmt
));
990 /* Put the edge onto the free list. */
993 symbol_table::free_edge (cgraph_edge
*e
)
997 if (e
->indirect_info
)
998 ggc_free (e
->indirect_info
);
1000 /* Clear out the edge so we do not dangle pointers. */
1001 memset (e
, 0, sizeof (*e
));
1003 NEXT_FREE_EDGE (e
) = free_edges
;
1008 /* Remove the edge in the cgraph. */
1011 cgraph_edge::remove (void)
1013 /* Call all edge removal hooks. */
1014 symtab
->call_edge_removal_hooks (this);
1016 if (!indirect_unknown_callee
)
1017 /* Remove from callers list of the callee. */
1020 /* Remove from callees list of the callers. */
1023 /* Put the edge onto the free list. */
1024 symtab
->free_edge (this);
1027 /* Set callee of call graph edge E and add it to the corresponding set of
1031 cgraph_set_edge_callee (cgraph_edge
*e
, cgraph_node
*n
)
1033 e
->prev_caller
= NULL
;
1035 n
->callers
->prev_caller
= e
;
1036 e
->next_caller
= n
->callers
;
1041 /* Turn edge into speculative call calling N2. Update
1042 the profile so the direct call is taken COUNT times
1045 At clone materialization time, the indirect call E will
1048 if (call_dest == N2)
1053 At this time the function just creates the direct call,
1054 the referencd representing the if conditional and attaches
1055 them all to the orginal indirect call statement.
1057 Return direct edge created. */
1060 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1061 int direct_frequency
)
1063 cgraph_node
*n
= caller
;
1064 ipa_ref
*ref
= NULL
;
1069 fprintf (dump_file
, "Indirect call -> speculative call"
1070 " %s/%i => %s/%i\n",
1071 xstrdup (n
->name ()), n
->order
,
1072 xstrdup (n2
->name ()), n2
->order
);
1075 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1076 initialize_inline_failed (e2
);
1077 e2
->speculative
= true;
1078 if (TREE_NOTHROW (n2
->decl
))
1079 e2
->can_throw_external
= false;
1081 e2
->can_throw_external
= can_throw_external
;
1082 e2
->lto_stmt_uid
= lto_stmt_uid
;
1083 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1085 frequency
-= e2
->frequency
;
1086 symtab
->call_edge_duplication_hooks (this, e2
);
1087 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1088 ref
->lto_stmt_uid
= lto_stmt_uid
;
1089 ref
->speculative
= speculative
;
1090 n2
->mark_address_taken ();
1094 /* Speculative call consist of three components:
1095 1) an indirect edge representing the original call
1096 2) an direct edge representing the new call
1097 3) ADDR_EXPR reference representing the speculative check.
1098 All three components are attached to single statement (the indirect
1099 call) and if one of them exists, all of them must exist.
1101 Given speculative call edge, return all three components.
1105 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1106 cgraph_edge
*&indirect
,
1107 ipa_ref
*&reference
)
1112 cgraph_edge
*e
= this;
1114 if (!e
->indirect_unknown_callee
)
1115 for (e2
= e
->caller
->indirect_calls
;
1116 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1117 e2
= e2
->next_callee
)
1122 /* We can take advantage of the call stmt hash. */
1125 e
= e
->caller
->get_edge (e2
->call_stmt
);
1126 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1129 for (e
= e
->caller
->callees
;
1130 e2
->call_stmt
!= e
->call_stmt
1131 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1135 gcc_assert (e
->speculative
&& e2
->speculative
);
1140 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1141 if (ref
->speculative
1142 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1143 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1149 /* Speculative edge always consist of all three components - direct edge,
1150 indirect and reference. */
1152 gcc_assert (e
&& e2
&& ref
);
1155 /* Redirect callee of the edge to N. The function does not update underlying
1159 cgraph_edge::redirect_callee (cgraph_node
*n
)
1161 /* Remove from callers list of the current callee. */
1164 /* Insert to callers list of the new callee. */
1165 cgraph_set_edge_callee (this, n
);
1168 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1169 Remove the speculative call sequence and return edge representing the call.
1170 It is up to caller to redirect the call as appropriate. */
1173 cgraph_edge::resolve_speculation (tree callee_decl
)
1175 cgraph_edge
*edge
= this;
1179 gcc_assert (edge
->speculative
);
1180 edge
->speculative_call_info (e2
, edge
, ref
);
1182 || !ref
->referred
->semantically_equivalent_p
1183 (symtab_node::get (callee_decl
)))
1189 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1190 "turned out to have contradicting known target ",
1191 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1192 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1193 print_generic_expr (dump_file
, callee_decl
, 0);
1194 fprintf (dump_file
, "\n");
1198 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1199 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1200 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1206 cgraph_edge
*tmp
= edge
;
1208 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1211 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1212 in the functions inlined through it. */
1214 edge
->count
+= e2
->count
;
1215 edge
->frequency
+= e2
->frequency
;
1216 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1217 edge
->frequency
= CGRAPH_FREQ_MAX
;
1218 edge
->speculative
= false;
1219 e2
->speculative
= false;
1220 ref
->remove_reference ();
1221 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1224 e2
->callee
->remove_symbol_and_inline_clones ();
1225 if (edge
->caller
->call_site_hash
)
1226 cgraph_update_edge_in_call_site_hash (edge
);
1230 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1231 CALLEE. DELTA is an integer constant that is to be added to the this
1232 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1235 cgraph_edge::make_direct (cgraph_node
*callee
)
1237 cgraph_edge
*edge
= this;
1238 gcc_assert (indirect_unknown_callee
);
1240 /* If we are redirecting speculative call, make it non-speculative. */
1241 if (indirect_unknown_callee
&& speculative
)
1243 edge
= edge
->resolve_speculation (callee
->decl
);
1245 /* On successful speculation just return the pre existing direct edge. */
1246 if (!indirect_unknown_callee
)
1250 indirect_unknown_callee
= 0;
1251 ggc_free (indirect_info
);
1252 indirect_info
= NULL
;
1254 /* Get the edge out of the indirect edge list. */
1256 prev_callee
->next_callee
= next_callee
;
1258 next_callee
->prev_callee
= prev_callee
;
1260 caller
->indirect_calls
= next_callee
;
1262 /* Put it into the normal callee list */
1264 next_callee
= caller
->callees
;
1265 if (caller
->callees
)
1266 caller
->callees
->prev_callee
= edge
;
1267 caller
->callees
= edge
;
1269 /* Insert to callers list of the new callee. */
1270 cgraph_set_edge_callee (edge
, callee
);
1273 call_stmt_cannot_inline_p
1274 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1277 /* We need to re-determine the inlining status of the edge. */
1278 initialize_inline_failed (edge
);
1282 /* If necessary, change the function declaration in the call statement
1283 associated with E so that it corresponds to the edge callee. */
1286 cgraph_edge::redirect_call_stmt_to_callee (void)
1288 cgraph_edge
*e
= this;
1290 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1291 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1293 gimple_stmt_iterator gsi
;
1294 #ifdef ENABLE_CHECKING
1304 e
->speculative_call_info (e
, e2
, ref
);
1305 /* If there already is an direct call (i.e. as a result of inliner's
1306 substitution), forget about speculating. */
1308 e
= e
->resolve_speculation (decl
);
1309 /* If types do not match, speculation was likely wrong.
1310 The direct edge was posisbly redirected to the clone with a different
1311 signature. We did not update the call statement yet, so compare it
1312 with the reference that still points to the proper type. */
1313 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1314 ref
->referred
->decl
,
1318 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1320 xstrdup (e
->caller
->name ()),
1322 xstrdup (e
->callee
->name ()),
1324 e
= e
->resolve_speculation ();
1325 /* We are producing the final function body and will throw away the
1326 callgraph edges really soon. Reset the counts/frequencies to
1327 keep verifier happy in the case of roundoff errors. */
1328 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1329 e
->frequency
= compute_call_stmt_bb_frequency
1330 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1332 /* Expand speculation into GIMPLE code. */
1337 "Expanding speculative call of %s/%i -> %s/%i count:"
1339 xstrdup (e
->caller
->name ()),
1341 xstrdup (e
->callee
->name ()),
1344 gcc_assert (e2
->speculative
);
1345 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1346 new_stmt
= gimple_ic (e
->call_stmt
, dyn_cast
<cgraph_node
*> (ref
->referred
),
1347 e
->count
|| e2
->count
1348 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1349 e
->count
+ e2
->count
)
1350 : e
->frequency
|| e2
->frequency
1351 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1352 e
->frequency
+ e2
->frequency
)
1353 : REG_BR_PROB_BASE
/ 2,
1354 e
->count
, e
->count
+ e2
->count
);
1355 e
->speculative
= false;
1356 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1359 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1360 processed call stmt. */
1361 if (gimple_call_with_bounds_p (new_stmt
)
1362 && gimple_call_lhs (new_stmt
)
1363 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1365 tree dresult
= gimple_call_lhs (new_stmt
);
1366 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1367 gimple dbndret
= chkp_retbnd_call_by_val (dresult
);
1368 gimple ibndret
= chkp_retbnd_call_by_val (iresult
);
1369 struct cgraph_edge
*iedge
1370 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1371 struct cgraph_edge
*dedge
;
1375 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1378 dedge
->frequency
= compute_call_stmt_bb_frequency
1379 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1381 iedge
->frequency
= compute_call_stmt_bb_frequency
1382 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1385 e
->frequency
= compute_call_stmt_bb_frequency
1386 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1387 e2
->frequency
= compute_call_stmt_bb_frequency
1388 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1389 e2
->speculative
= false;
1390 ref
->speculative
= false;
1392 /* Indirect edges are not both in the call site hash.
1394 if (e
->caller
->call_site_hash
)
1395 cgraph_update_edge_in_call_site_hash (e2
);
1397 /* Continue redirecting E to proper target. */
1401 if (e
->indirect_unknown_callee
1402 || decl
== e
->callee
->decl
)
1403 return e
->call_stmt
;
1405 #ifdef ENABLE_CHECKING
1408 node
= cgraph_node::get (decl
);
1409 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1413 if (symtab
->dump_file
)
1415 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1416 xstrdup (e
->caller
->name ()), e
->caller
->order
,
1417 xstrdup (e
->callee
->name ()), e
->callee
->order
);
1418 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1419 if (e
->callee
->clone
.combined_args_to_skip
)
1421 fprintf (symtab
->dump_file
, " combined args to skip: ");
1422 dump_bitmap (symtab
->dump_file
,
1423 e
->callee
->clone
.combined_args_to_skip
);
1427 if (e
->callee
->clone
.combined_args_to_skip
)
1432 = gimple_call_copy_skip_args (e
->call_stmt
,
1433 e
->callee
->clone
.combined_args_to_skip
);
1434 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1435 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1437 if (gimple_vdef (new_stmt
)
1438 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1439 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1441 gsi
= gsi_for_stmt (e
->call_stmt
);
1442 gsi_replace (&gsi
, new_stmt
, false);
1443 /* We need to defer cleaning EH info on the new statement to
1444 fixup-cfg. We may not have dominator information at this point
1445 and thus would end up with unreachable blocks and have no way
1446 to communicate that we need to run CFG cleanup then. */
1447 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1450 remove_stmt_from_eh_lp (e
->call_stmt
);
1451 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1456 new_stmt
= e
->call_stmt
;
1457 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1458 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1461 /* If the call becomes noreturn, remove the lhs. */
1462 if (lhs
&& (gimple_call_flags (new_stmt
) & ECF_NORETURN
))
1464 if (TREE_CODE (lhs
) == SSA_NAME
)
1466 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1467 TREE_TYPE (lhs
), NULL
);
1468 var
= get_or_create_ssa_default_def
1469 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1470 gimple set_stmt
= gimple_build_assign (lhs
, var
);
1471 gsi
= gsi_for_stmt (new_stmt
);
1472 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1473 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1475 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1476 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1479 /* If new callee has no static chain, remove it. */
1480 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1482 gimple_call_set_chain (new_stmt
, NULL
);
1483 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1486 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1488 if (symtab
->dump_file
)
1490 fprintf (symtab
->dump_file
, " updated to:");
1491 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1496 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1497 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1498 of OLD_STMT if it was previously call statement.
1499 If NEW_STMT is NULL, the call has been dropped without any
1503 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1504 gimple old_stmt
, tree old_call
,
1507 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1508 ? gimple_call_fndecl (new_stmt
) : 0;
1510 /* We are seeing indirect calls, then there is nothing to update. */
1511 if (!new_call
&& !old_call
)
1513 /* See if we turned indirect call into direct call or folded call to one builtin
1514 into different builtin. */
1515 if (old_call
!= new_call
)
1517 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1518 cgraph_edge
*ne
= NULL
;
1524 /* See if the edge is already there and has the correct callee. It
1525 might be so because of indirect inlining has already updated
1526 it. We also might've cloned and redirected the edge. */
1527 if (new_call
&& e
->callee
)
1529 cgraph_node
*callee
= e
->callee
;
1532 if (callee
->decl
== new_call
1533 || callee
->former_clone_of
== new_call
)
1535 e
->set_call_stmt (new_stmt
);
1538 callee
= callee
->clone_of
;
1542 /* Otherwise remove edge and create new one; we can't simply redirect
1543 since function has changed, so inline plan and other information
1544 attached to edge is invalid. */
1546 frequency
= e
->frequency
;
1547 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1550 e
->callee
->remove_symbol_and_inline_clones ();
1554 /* We are seeing new direct call; compute profile info based on BB. */
1555 basic_block bb
= gimple_bb (new_stmt
);
1557 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1563 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1564 new_stmt
, count
, frequency
);
1565 gcc_assert (ne
->inline_failed
);
1568 /* We only updated the call stmt; update pointer in cgraph edge.. */
1569 else if (old_stmt
!= new_stmt
)
1570 node
->get_edge (old_stmt
)->set_call_stmt (new_stmt
);
1573 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1574 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1575 of OLD_STMT before it was updated (updating can happen inplace). */
1578 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1580 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1583 gcc_checking_assert (orig
);
1584 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1586 for (node
= orig
->clones
; node
!= orig
;)
1588 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1590 node
= node
->clones
;
1591 else if (node
->next_sibling_clone
)
1592 node
= node
->next_sibling_clone
;
1595 while (node
!= orig
&& !node
->next_sibling_clone
)
1596 node
= node
->clone_of
;
1598 node
= node
->next_sibling_clone
;
1604 /* Remove all callees from the node. */
1607 cgraph_node::remove_callees (void)
1611 /* It is sufficient to remove the edges from the lists of callers of
1612 the callees. The callee list of the node can be zapped with one
1614 for (e
= callees
; e
; e
= f
)
1617 symtab
->call_edge_removal_hooks (e
);
1618 if (!e
->indirect_unknown_callee
)
1619 e
->remove_callee ();
1620 symtab
->free_edge (e
);
1622 for (e
= indirect_calls
; e
; e
= f
)
1625 symtab
->call_edge_removal_hooks (e
);
1626 if (!e
->indirect_unknown_callee
)
1627 e
->remove_callee ();
1628 symtab
->free_edge (e
);
1630 indirect_calls
= NULL
;
1634 call_site_hash
->empty ();
1635 call_site_hash
= NULL
;
1639 /* Remove all callers from the node. */
1642 cgraph_node::remove_callers (void)
1646 /* It is sufficient to remove the edges from the lists of callees of
1647 the callers. The caller list of the node can be zapped with one
1649 for (e
= callers
; e
; e
= f
)
1652 symtab
->call_edge_removal_hooks (e
);
1653 e
->remove_caller ();
1654 symtab
->free_edge (e
);
1659 /* Helper function for cgraph_release_function_body and free_lang_data.
1660 It releases body from function DECL without having to inspect its
1661 possibly non-existent symtab node. */
1664 release_function_body (tree decl
)
1666 if (DECL_STRUCT_FUNCTION (decl
))
1668 if (DECL_STRUCT_FUNCTION (decl
)->cfg
1669 || DECL_STRUCT_FUNCTION (decl
)->gimple_df
)
1671 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1675 cfun
->curr_properties
&= ~PROP_loops
;
1676 loop_optimizer_finalize ();
1678 if (cfun
->gimple_df
)
1681 delete_tree_cfg_annotations ();
1686 gcc_assert (!dom_info_available_p (CDI_DOMINATORS
));
1687 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS
));
1691 if (cfun
->value_histograms
)
1695 gimple_set_body (decl
, NULL
);
1696 /* Struct function hangs a lot of data that would leak if we didn't
1697 removed all pointers to it. */
1698 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1699 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1701 DECL_SAVED_TREE (decl
) = NULL
;
1704 /* Release memory used to represent body of function.
1705 Use this only for functions that are released before being translated to
1706 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1707 are free'd in final.c via free_after_compilation().
1708 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1711 cgraph_node::release_body (bool keep_arguments
)
1713 ipa_transforms_to_apply
.release ();
1714 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1716 DECL_RESULT (decl
) = NULL
;
1718 if (!keep_arguments
)
1719 DECL_ARGUMENTS (decl
) = NULL
;
1721 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1722 of its associated function function declaration because it's
1723 needed to emit debug info later. */
1724 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1725 DECL_INITIAL (decl
) = error_mark_node
;
1726 release_function_body (decl
);
1728 lto_free_function_in_decl_state_for_node (this);
1731 /* Remove function from symbol table. */
1734 cgraph_node::remove (void)
1737 int uid
= this->uid
;
1739 symtab
->call_cgraph_removal_hooks (this);
1742 ipa_transforms_to_apply
.release ();
1744 /* Incremental inlining access removed nodes stored in the postorder list.
1746 force_output
= false;
1747 forced_by_abi
= false;
1748 for (n
= nested
; n
; n
= n
->next_nested
)
1753 cgraph_node
**node2
= &origin
->nested
;
1755 while (*node2
!= this)
1756 node2
= &(*node2
)->next_nested
;
1757 *node2
= next_nested
;
1760 if (prev_sibling_clone
)
1761 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1763 clone_of
->clones
= next_sibling_clone
;
1764 if (next_sibling_clone
)
1765 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1768 cgraph_node
*n
, *next
;
1772 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1773 n
->clone_of
= clone_of
;
1774 n
->clone_of
= clone_of
;
1775 n
->next_sibling_clone
= clone_of
->clones
;
1776 if (clone_of
->clones
)
1777 clone_of
->clones
->prev_sibling_clone
= n
;
1778 clone_of
->clones
= clones
;
1782 /* We are removing node with clones. This makes clones inconsistent,
1783 but assume they will be removed subsequently and just keep clone
1784 tree intact. This can happen in unreachable function removal since
1785 we remove unreachable functions in random order, not by bottom-up
1786 walk of clone trees. */
1787 for (n
= clones
; n
; n
= next
)
1789 next
= n
->next_sibling_clone
;
1790 n
->next_sibling_clone
= NULL
;
1791 n
->prev_sibling_clone
= NULL
;
1797 /* While all the clones are removed after being proceeded, the function
1798 itself is kept in the cgraph even after it is compiled. Check whether
1799 we are done with this body and reclaim it proactively if this is the case.
1801 if (symtab
->state
!= LTO_STREAMING
)
1803 n
= cgraph_node::get (decl
);
1805 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1806 && (symtab
->global_info_ready
1807 && (TREE_ASM_WRITTEN (n
->decl
)
1808 || DECL_EXTERNAL (n
->decl
)
1810 || (!flag_wpa
&& n
->in_other_partition
)))))
1817 call_site_hash
->empty ();
1818 call_site_hash
= NULL
;
1821 if (instrumented_version
)
1823 instrumented_version
->instrumented_version
= NULL
;
1824 instrumented_version
= NULL
;
1827 symtab
->release_symbol (this, uid
);
1830 /* Likewise indicate that a node is having address taken. */
1833 cgraph_node::mark_address_taken (void)
1835 /* Indirect inlining can figure out that all uses of the address are
1837 if (global
.inlined_to
)
1839 gcc_assert (cfun
->after_inlining
);
1840 gcc_assert (callers
->indirect_inlining_edge
);
1843 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1844 IPA_REF_ADDR reference exists (and thus it should be set on node
1845 representing alias we take address of) and as a test whether address
1846 of the object was taken (and thus it should be set on node alias is
1847 referring to). We should remove the first use and the remove the
1850 cgraph_node
*node
= ultimate_alias_target ();
1851 node
->address_taken
= 1;
1854 /* Return local info for the compiled function. */
1857 cgraph_node::local_info (tree decl
)
1859 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1860 cgraph_node
*node
= get (decl
);
1863 return &node
->local
;
1866 /* Return global info for the compiled function. */
1868 cgraph_global_info
*
1869 cgraph_node::global_info (tree decl
)
1871 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1872 && symtab
->global_info_ready
);
1873 cgraph_node
*node
= get (decl
);
1876 return &node
->global
;
1879 /* Return local info for the compiled function. */
1882 cgraph_node::rtl_info (tree decl
)
1884 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1885 cgraph_node
*node
= get (decl
);
1887 || (decl
!= current_function_decl
1888 && !TREE_ASM_WRITTEN (node
->decl
)))
1893 /* Return a string describing the failure REASON. */
1896 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1899 #define DEFCIFCODE(code, type, string) string,
1901 static const char *cif_string_table
[CIF_N_REASONS
] = {
1902 #include "cif-code.def"
1905 /* Signedness of an enum type is implementation defined, so cast it
1906 to unsigned before testing. */
1907 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1908 return cif_string_table
[reason
];
1911 /* Return a type describing the failure REASON. */
1913 cgraph_inline_failed_type_t
1914 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1917 #define DEFCIFCODE(code, type, string) type,
1919 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1920 #include "cif-code.def"
1923 /* Signedness of an enum type is implementation defined, so cast it
1924 to unsigned before testing. */
1925 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1926 return cif_type_table
[reason
];
1929 /* Names used to print out the availability enum. */
1930 const char * const cgraph_availability_names
[] =
1931 {"unset", "not_available", "overwritable", "available", "local"};
1933 /* Output flags of edge E. */
1936 dump_edge_flags (FILE *f
, struct cgraph_edge
*edge
)
1938 if (edge
->speculative
)
1939 fprintf (f
, "(speculative) ");
1940 if (!edge
->inline_failed
)
1941 fprintf (f
, "(inlined) ");
1942 if (edge
->indirect_inlining_edge
)
1943 fprintf (f
, "(indirect_inlining) ");
1945 fprintf (f
, "(%"PRId64
"x) ",
1946 (int64_t)edge
->count
);
1947 if (edge
->frequency
)
1948 fprintf (f
, "(%.2f per call) ",
1949 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1950 if (edge
->can_throw_external
)
1951 fprintf (f
, "(can throw external) ");
1954 /* Dump call graph node to file F. */
1957 cgraph_node::dump (FILE *f
)
1963 if (global
.inlined_to
)
1964 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1967 xstrdup (global
.inlined_to
->name ()),
1968 global
.inlined_to
->order
);
1970 fprintf (f
, " Clone of %s/%i\n",
1971 clone_of
->asm_name (),
1973 if (symtab
->function_flags_ready
)
1974 fprintf (f
, " Availability: %s\n",
1975 cgraph_availability_names
[get_availability ()]);
1978 fprintf (f
, " Profile id: %i\n",
1980 fprintf (f
, " First run: %i\n", tp_first_run
);
1981 fprintf (f
, " Function flags:");
1983 fprintf (f
, " executed %"PRId64
"x",
1986 fprintf (f
, " nested in: %s", origin
->asm_name ());
1987 if (gimple_has_body_p (decl
))
1988 fprintf (f
, " body");
1990 fprintf (f
, " process");
1992 fprintf (f
, " local");
1993 if (local
.redefined_extern_inline
)
1994 fprintf (f
, " redefined_extern_inline");
1995 if (only_called_at_startup
)
1996 fprintf (f
, " only_called_at_startup");
1997 if (only_called_at_exit
)
1998 fprintf (f
, " only_called_at_exit");
2000 fprintf (f
, " tm_clone");
2002 fprintf (f
, " icf_merged");
2004 fprintf (f
, " nonfreeing_fn");
2005 if (DECL_STATIC_CONSTRUCTOR (decl
))
2006 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2007 if (DECL_STATIC_DESTRUCTOR (decl
))
2008 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2014 fprintf (f
, " Thunk");
2016 fprintf (f
, " of %s (asm: %s)",
2017 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2018 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2019 fprintf (f
, " fixed offset %i virtual value %i has "
2020 "virtual offset %i)\n",
2021 (int)thunk
.fixed_offset
,
2022 (int)thunk
.virtual_value
,
2023 (int)thunk
.virtual_offset_p
);
2025 if (alias
&& thunk
.alias
2026 && DECL_P (thunk
.alias
))
2028 fprintf (f
, " Alias of %s",
2029 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2030 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2031 fprintf (f
, " (asm: %s)",
2032 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2036 fprintf (f
, " Called by: ");
2038 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2040 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
2041 edge
->caller
->order
);
2042 dump_edge_flags (f
, edge
);
2045 fprintf (f
, "\n Calls: ");
2046 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2048 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
2049 edge
->callee
->order
);
2050 dump_edge_flags (f
, edge
);
2054 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2056 if (edge
->indirect_info
->polymorphic
)
2058 fprintf (f
, " Polymorphic indirect call of type ");
2059 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2060 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2063 fprintf (f
, " Indirect call");
2064 dump_edge_flags (f
, edge
);
2065 if (edge
->indirect_info
->param_index
!= -1)
2067 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2068 if (edge
->indirect_info
->agg_contents
)
2069 fprintf (f
, " loaded from %s %s at offset %i",
2070 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2071 edge
->indirect_info
->by_ref
? "passed by reference":"",
2072 (int)edge
->indirect_info
->offset
);
2073 if (edge
->indirect_info
->vptr_changed
)
2074 fprintf (f
, " (vptr maybe changed)");
2077 if (edge
->indirect_info
->polymorphic
)
2078 edge
->indirect_info
->context
.dump (f
);
2081 if (instrumentation_clone
)
2082 fprintf (f
, " Is instrumented version.\n");
2083 else if (instrumented_version
)
2084 fprintf (f
, " Has instrumented version.\n");
2087 /* Dump call graph node NODE to stderr. */
2090 cgraph_node::debug (void)
2095 /* Dump the callgraph to file F. */
2098 cgraph_node::dump_cgraph (FILE *f
)
2102 fprintf (f
, "callgraph:\n\n");
2103 FOR_EACH_FUNCTION (node
)
2107 /* Return true when the DECL can possibly be inlined. */
2110 cgraph_function_possibly_inlined_p (tree decl
)
2112 if (!symtab
->global_info_ready
)
2113 return !DECL_UNINLINABLE (decl
);
2114 return DECL_POSSIBLY_INLINED (decl
);
2117 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2119 cgraph_node::unnest (void)
2121 cgraph_node
**node2
= &origin
->nested
;
2122 gcc_assert (origin
);
2124 while (*node2
!= this)
2125 node2
= &(*node2
)->next_nested
;
2126 *node2
= next_nested
;
2130 /* Return function availability. See cgraph.h for description of individual
2133 cgraph_node::get_availability (void)
2135 enum availability avail
;
2137 avail
= AVAIL_NOT_AVAILABLE
;
2138 else if (local
.local
)
2139 avail
= AVAIL_LOCAL
;
2140 else if (alias
&& weakref
)
2141 ultimate_alias_target (&avail
);
2142 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2143 avail
= AVAIL_INTERPOSABLE
;
2144 else if (!externally_visible
)
2145 avail
= AVAIL_AVAILABLE
;
2146 /* Inline functions are safe to be analyzed even if their symbol can
2147 be overwritten at runtime. It is not meaningful to enforce any sane
2148 behaviour on replacing inline function by different body. */
2149 else if (DECL_DECLARED_INLINE_P (decl
))
2150 avail
= AVAIL_AVAILABLE
;
2152 /* If the function can be overwritten, return OVERWRITABLE. Take
2153 care at least of two notable extensions - the COMDAT functions
2154 used to share template instantiations in C++ (this is symmetric
2155 to code cp_cannot_inline_tree_fn and probably shall be shared and
2156 the inlinability hooks completely eliminated).
2158 ??? Does the C++ one definition rule allow us to always return
2159 AVAIL_AVAILABLE here? That would be good reason to preserve this
2162 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2163 avail
= AVAIL_INTERPOSABLE
;
2164 else avail
= AVAIL_AVAILABLE
;
2169 /* Worker for cgraph_node_can_be_local_p. */
2171 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2173 return !(!node
->force_output
2174 && ((DECL_COMDAT (node
->decl
)
2175 && !node
->forced_by_abi
2176 && !node
->used_from_object_file_p ()
2177 && !node
->same_comdat_group
)
2178 || !node
->externally_visible
));
2181 /* Return true if cgraph_node can be made local for API change.
2182 Extern inline functions and C++ COMDAT functions can be made local
2183 at the expense of possible code size growth if function is used in multiple
2184 compilation units. */
2186 cgraph_node::can_be_local_p (void)
2188 return (!address_taken
2189 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2193 /* Call calback on cgraph_node, thunks and aliases associated to cgraph_node.
2194 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2198 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2199 (cgraph_node
*, void *),
2201 bool include_overwritable
)
2206 if (callback (this, data
))
2208 for (e
= callers
; e
; e
= e
->next_caller
)
2209 if (e
->caller
->thunk
.thunk_p
2210 && (include_overwritable
2211 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2212 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2213 include_overwritable
))
2216 FOR_EACH_ALIAS (this, ref
)
2218 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2219 if (include_overwritable
2220 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2221 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2222 include_overwritable
))
2228 /* Call calback on function and aliases associated to the function.
2229 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2233 cgraph_node::call_for_symbol_and_aliases (bool (*callback
) (cgraph_node
*,
2236 bool include_overwritable
)
2240 if (callback (this, data
))
2243 FOR_EACH_ALIAS (this, ref
)
2245 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2246 if (include_overwritable
2247 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2248 if (alias
->call_for_symbol_and_aliases (callback
, data
,
2249 include_overwritable
))
2255 /* Worker to bring NODE local. */
2258 cgraph_node::make_local (cgraph_node
*node
, void *)
2260 gcc_checking_assert (node
->can_be_local_p ());
2261 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2263 node
->make_decl_local ();
2264 node
->set_section (NULL
);
2265 node
->set_comdat_group (NULL
);
2266 node
->externally_visible
= false;
2267 node
->forced_by_abi
= false;
2268 node
->local
.local
= true;
2269 node
->set_section (NULL
);
2270 node
->unique_name
= (node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2271 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2272 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2273 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2278 /* Bring cgraph node local. */
2281 cgraph_node::make_local (void)
2283 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2286 /* Worker to set nothrow flag. */
2289 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2293 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2296 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2297 e
->can_throw_external
= false;
2301 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2302 if any to NOTHROW. */
2305 cgraph_node::set_nothrow_flag (bool nothrow
)
2307 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2308 (void *)(size_t)nothrow
, false);
2311 /* Worker to set const flag. */
2314 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2316 /* Static constructors and destructors without a side effect can be
2318 if (data
&& !((size_t)data
& 2))
2320 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2321 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2322 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2323 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2325 TREE_READONLY (node
->decl
) = data
!= NULL
;
2326 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2330 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2331 if any to READONLY. */
2334 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2336 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2337 (void *)(size_t)(readonly
+ (int)looping
* 2),
2341 /* Worker to set pure flag. */
2344 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2346 /* Static constructors and destructors without a side effect can be
2348 if (data
&& !((size_t)data
& 2))
2350 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2351 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2352 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2353 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2355 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2356 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2360 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2364 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2366 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2367 (void *)(size_t)(pure
+ (int)looping
* 2),
2371 /* Return true when cgraph_node can not return or throw and thus
2372 it is safe to ignore its side effects for IPA analysis. */
2375 cgraph_node::cannot_return_p (void)
2377 int flags
= flags_from_decl_or_type (decl
);
2378 if (!opt_for_fn (decl
, flag_exceptions
))
2379 return (flags
& ECF_NORETURN
) != 0;
2381 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2382 == (ECF_NORETURN
| ECF_NOTHROW
));
2385 /* Return true when call of edge can not lead to return from caller
2386 and thus it is safe to ignore its side effects for IPA analysis
2387 when computing side effects of the caller.
2388 FIXME: We could actually mark all edges that have no reaching
2389 patch to the exit block or throw to get better results. */
2391 cgraph_edge::cannot_lead_to_return_p (void)
2393 if (caller
->cannot_return_p ())
2395 if (indirect_unknown_callee
)
2397 int flags
= indirect_info
->ecf_flags
;
2398 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2399 return (flags
& ECF_NORETURN
) != 0;
2401 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2402 == (ECF_NORETURN
| ECF_NOTHROW
));
2405 return callee
->cannot_return_p ();
2408 /* Return true if the call can be hot. */
2411 cgraph_edge::maybe_hot_p (void)
2413 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2415 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2416 && !maybe_hot_count_p (NULL
, count
))
2418 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2420 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2422 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2424 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2426 if (opt_for_fn (caller
->decl
, optimize_size
))
2428 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2430 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2431 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2433 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2435 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2436 || frequency
<= (CGRAPH_FREQ_BASE
2437 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2443 /* Return true when function can be removed from callgraph
2444 if all direct calls are eliminated. */
2447 cgraph_node::can_remove_if_no_direct_calls_and_refs_p (void)
2449 gcc_assert (!global
.inlined_to
);
2450 /* Instrumentation clones should not be removed before
2451 instrumentation happens. New callers may appear after
2453 if (instrumentation_clone
2454 && !chkp_function_instrumented_p (decl
))
2456 /* Extern inlines can always go, we will use the external definition. */
2457 if (DECL_EXTERNAL (decl
))
2459 /* When function is needed, we can not remove it. */
2460 if (force_output
|| used_from_other_partition
)
2462 if (DECL_STATIC_CONSTRUCTOR (decl
)
2463 || DECL_STATIC_DESTRUCTOR (decl
))
2465 /* Only COMDAT functions can be removed if externally visible. */
2466 if (externally_visible
2467 && (!DECL_COMDAT (decl
)
2469 || used_from_object_file_p ()))
2474 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2477 nonremovable_p (cgraph_node
*node
, void *)
2479 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2482 /* Return true when function cgraph_node and its aliases can be removed from
2483 callgraph if all direct calls are eliminated. */
2486 cgraph_node::can_remove_if_no_direct_calls_p (void)
2488 /* Extern inlines can always go, we will use the external definition. */
2489 if (DECL_EXTERNAL (decl
))
2493 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2496 /* Return true when function cgraph_node can be expected to be removed
2497 from program when direct calls in this compilation unit are removed.
2499 As a special case COMDAT functions are
2500 cgraph_can_remove_if_no_direct_calls_p while the are not
2501 cgraph_only_called_directly_p (it is possible they are called from other
2504 This function behaves as cgraph_only_called_directly_p because eliminating
2505 all uses of COMDAT function does not make it necessarily disappear from
2506 the program unless we are compiling whole program or we do LTO. In this
2507 case we know we win since dynamic linking will not really discard the
2508 linkonce section. */
2511 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p (void)
2513 gcc_assert (!global
.inlined_to
);
2515 if (call_for_symbol_and_aliases (used_from_object_file_p_worker
,
2518 if (!in_lto_p
&& !flag_whole_program
)
2519 return only_called_directly_p ();
2522 if (DECL_EXTERNAL (decl
))
2524 return can_remove_if_no_direct_calls_p ();
2529 /* Worker for cgraph_only_called_directly_p. */
2532 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2534 return !node
->only_called_directly_or_aliased_p ();
2537 /* Return true when function cgraph_node and all its aliases are only called
2539 i.e. it is not externally visible, address was not taken and
2540 it is not used in any other non-standard way. */
2543 cgraph_node::only_called_directly_p (void)
2545 gcc_assert (ultimate_alias_target () == this);
2546 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2551 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2554 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2556 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2558 enum availability avail
;
2559 node
->ultimate_alias_target (&avail
);
2561 if (avail
> AVAIL_INTERPOSABLE
)
2562 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2563 if (!cs
->indirect_inlining_edge
)
2564 redirect_callers
->safe_push (cs
);
2568 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2569 cgraph_node (i.e. are not overwritable). */
2572 cgraph_node::collect_callers (void)
2574 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2575 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2576 &redirect_callers
, false);
2577 return redirect_callers
;
2580 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2583 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2585 bool skipped_thunk
= false;
2586 node
= node
->ultimate_alias_target ();
2587 node2
= node2
->ultimate_alias_target ();
2589 /* There are no virtual clones of thunks so check former_clone_of or if we
2590 might have skipped thunks because this adjustments are no longer
2592 while (node
->thunk
.thunk_p
)
2594 if (node2
->former_clone_of
== node
->decl
)
2596 if (!node
->thunk
.this_adjusting
)
2598 node
= node
->callees
->callee
->ultimate_alias_target ();
2599 skipped_thunk
= true;
2604 if (!node2
->clone
.args_to_skip
2605 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2607 if (node2
->former_clone_of
== node
->decl
)
2609 else if (!node2
->clone_of
)
2613 while (node
!= node2
&& node2
)
2614 node2
= node2
->clone_of
;
2615 return node2
!= NULL
;
2618 /* Verify edge E count and frequency. */
2621 verify_edge_count_and_frequency (cgraph_edge
*e
)
2623 bool error_found
= false;
2626 error ("caller edge count is negative");
2629 if (e
->frequency
< 0)
2631 error ("caller edge frequency is negative");
2634 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2636 error ("caller edge frequency is too large");
2639 if (gimple_has_body_p (e
->caller
->decl
)
2640 && !e
->caller
->global
.inlined_to
2642 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2643 Remove this once edges are actually removed from the function at that time. */
2645 || (inline_edge_summary_vec
.exists ()
2646 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2647 || !inline_edge_summary (e
)->predicate
)))
2649 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2650 gimple_bb (e
->call_stmt
))))
2652 error ("caller edge frequency %i does not match BB frequency %i",
2654 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2655 gimple_bb (e
->call_stmt
)));
2661 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2663 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple stmt
)
2665 bool fndecl_was_null
= false;
2666 /* debug_gimple_stmt needs correct cfun */
2667 if (cfun
!= this_cfun
)
2668 set_cfun (this_cfun
);
2669 /* ...and an actual current_function_decl */
2670 if (!current_function_decl
)
2672 current_function_decl
= this_cfun
->decl
;
2673 fndecl_was_null
= true;
2675 debug_gimple_stmt (stmt
);
2676 if (fndecl_was_null
)
2677 current_function_decl
= NULL
;
2680 /* Verify that call graph edge E corresponds to DECL from the associated
2681 statement. Return true if the verification should fail. */
2684 verify_edge_corresponds_to_fndecl (cgraph_edge
*e
, tree decl
)
2688 if (!decl
|| e
->callee
->global
.inlined_to
)
2690 if (symtab
->state
== LTO_STREAMING
)
2692 node
= cgraph_node::get (decl
);
2694 /* We do not know if a node from a different partition is an alias or what it
2695 aliases and therefore cannot do the former_clone_of check reliably. When
2696 body_removed is set, we have lost all information about what was alias or
2697 thunk of and also cannot proceed. */
2699 || node
->body_removed
2700 || node
->in_other_partition
2702 || e
->callee
->in_other_partition
)
2705 node
= node
->ultimate_alias_target ();
2707 /* Optimizers can redirect unreachable calls or calls triggering undefined
2708 behaviour to builtin_unreachable. */
2709 if (DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
2710 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
2713 if (e
->callee
->former_clone_of
!= node
->decl
2714 && (node
!= e
->callee
->ultimate_alias_target ())
2715 && !clone_of_p (node
, e
->callee
))
2721 /* Verify cgraph nodes of given cgraph node. */
2723 cgraph_node::verify_node (void)
2726 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2727 basic_block this_block
;
2728 gimple_stmt_iterator gsi
;
2729 bool error_found
= false;
2734 timevar_push (TV_CGRAPH_VERIFY
);
2735 error_found
|= verify_base ();
2736 for (e
= callees
; e
; e
= e
->next_callee
)
2739 error ("aux field set for edge %s->%s",
2740 identifier_to_locale (e
->caller
->name ()),
2741 identifier_to_locale (e
->callee
->name ()));
2746 error ("execution count is negative");
2749 if (global
.inlined_to
&& same_comdat_group
)
2751 error ("inline clone in same comdat group list");
2754 if (!definition
&& !in_other_partition
&& local
.local
)
2756 error ("local symbols must be defined");
2759 if (global
.inlined_to
&& externally_visible
)
2761 error ("externally visible inline clone");
2764 if (global
.inlined_to
&& address_taken
)
2766 error ("inline clone with address taken");
2769 if (global
.inlined_to
&& force_output
)
2771 error ("inline clone is forced to output");
2774 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2778 error ("aux field set for indirect edge from %s",
2779 identifier_to_locale (e
->caller
->name ()));
2782 if (!e
->indirect_unknown_callee
2783 || !e
->indirect_info
)
2785 error ("An indirect edge from %s is not marked as indirect or has "
2786 "associated indirect_info, the corresponding statement is: ",
2787 identifier_to_locale (e
->caller
->name ()));
2788 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2792 bool check_comdat
= comdat_local_p ();
2793 for (e
= callers
; e
; e
= e
->next_caller
)
2795 if (verify_edge_count_and_frequency (e
))
2798 && !in_same_comdat_group_p (e
->caller
))
2800 error ("comdat-local function called by %s outside its comdat",
2801 identifier_to_locale (e
->caller
->name ()));
2804 if (!e
->inline_failed
)
2806 if (global
.inlined_to
2807 != (e
->caller
->global
.inlined_to
2808 ? e
->caller
->global
.inlined_to
: e
->caller
))
2810 error ("inlined_to pointer is wrong");
2813 if (callers
->next_caller
)
2815 error ("multiple inline callers");
2820 if (global
.inlined_to
)
2822 error ("inlined_to pointer set for noninline callers");
2826 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2827 if (verify_edge_count_and_frequency (e
))
2829 if (!callers
&& global
.inlined_to
)
2831 error ("inlined_to pointer is set but no predecessors found");
2834 if (global
.inlined_to
== this)
2836 error ("inlined_to pointer refers to itself");
2843 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2848 error ("cgraph_node has wrong clone_of");
2855 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2856 if (n
->clone_of
!= this)
2860 error ("cgraph_node has wrong clone list");
2864 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2866 error ("cgraph_node is in clone list but it is not clone");
2869 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2871 error ("cgraph_node has wrong prev_clone pointer");
2874 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2876 error ("double linked list of clones corrupted");
2880 if (analyzed
&& alias
)
2882 bool ref_found
= false;
2884 ipa_ref
*ref
= NULL
;
2888 error ("Alias has call edges");
2891 for (i
= 0; iterate_reference (i
, ref
); i
++)
2892 if (ref
->use
== IPA_REF_CHKP
)
2894 else if (ref
->use
!= IPA_REF_ALIAS
)
2896 error ("Alias has non-alias reference");
2901 error ("Alias has more than one alias reference");
2908 error ("Analyzed alias has no reference");
2913 /* Check instrumented version reference. */
2914 if (instrumented_version
2915 && instrumented_version
->instrumented_version
!= this)
2917 error ("Instrumentation clone does not reference original node");
2921 /* Cannot have orig_decl for not instrumented nodes. */
2922 if (!instrumentation_clone
&& orig_decl
)
2924 error ("Not instrumented node has non-NULL original declaration");
2928 /* If original not instrumented node still exists then we may check
2929 original declaration is set properly. */
2930 if (instrumented_version
2932 && orig_decl
!= instrumented_version
->decl
)
2934 error ("Instrumented node has wrong original declaration");
2938 /* Check all nodes have chkp reference to their instrumented versions. */
2940 && instrumented_version
2941 && !instrumentation_clone
)
2943 bool ref_found
= false;
2945 struct ipa_ref
*ref
;
2947 for (i
= 0; iterate_reference (i
, ref
); i
++)
2948 if (ref
->use
== IPA_REF_CHKP
)
2952 error ("Node has more than one chkp reference");
2955 if (ref
->referred
!= instrumented_version
)
2957 error ("Wrong node is referenced with chkp reference");
2965 error ("Analyzed node has no reference to instrumented version");
2970 if (analyzed
&& thunk
.thunk_p
)
2974 error ("No edge out of thunk node");
2977 else if (callees
->next_callee
)
2979 error ("More than one edge out of thunk node");
2982 if (gimple_has_body_p (decl
))
2984 error ("Thunk is not supposed to have body");
2987 if (thunk
.add_pointer_bounds_args
2988 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
2990 error ("Instrumentation thunk has wrong edge callee");
2994 else if (analyzed
&& gimple_has_body_p (decl
)
2995 && !TREE_ASM_WRITTEN (decl
)
2996 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3001 hash_set
<gimple
> stmts
;
3003 ipa_ref
*ref
= NULL
;
3005 /* Reach the trees by walking over the CFG, and note the
3006 enclosing basic-blocks in the call edges. */
3007 FOR_EACH_BB_FN (this_block
, this_cfun
)
3009 for (gsi
= gsi_start_phis (this_block
);
3010 !gsi_end_p (gsi
); gsi_next (&gsi
))
3011 stmts
.add (gsi_stmt (gsi
));
3012 for (gsi
= gsi_start_bb (this_block
);
3016 gimple stmt
= gsi_stmt (gsi
);
3018 if (is_gimple_call (stmt
))
3020 cgraph_edge
*e
= get_edge (stmt
);
3021 tree decl
= gimple_call_fndecl (stmt
);
3026 error ("shared call_stmt:");
3027 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3030 if (!e
->indirect_unknown_callee
)
3032 if (verify_edge_corresponds_to_fndecl (e
, decl
))
3034 error ("edge points to wrong declaration:");
3035 debug_tree (e
->callee
->decl
);
3036 fprintf (stderr
," Instead of:");
3043 error ("an indirect edge with unknown callee "
3044 "corresponding to a call_stmt with "
3045 "a known declaration:");
3047 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3053 error ("missing callgraph edge for call stmt:");
3054 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3060 for (i
= 0; iterate_reference (i
, ref
); i
++)
3061 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3063 error ("reference to dead statement");
3064 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3069 /* No CFG available?! */
3072 for (e
= callees
; e
; e
= e
->next_callee
)
3076 error ("edge %s->%s has no corresponding call_stmt",
3077 identifier_to_locale (e
->caller
->name ()),
3078 identifier_to_locale (e
->callee
->name ()));
3079 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3084 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3086 if (!e
->aux
&& !e
->speculative
)
3088 error ("an indirect edge from %s has no corresponding call_stmt",
3089 identifier_to_locale (e
->caller
->name ()));
3090 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3099 internal_error ("verify_cgraph_node failed");
3101 timevar_pop (TV_CGRAPH_VERIFY
);
3104 /* Verify whole cgraph structure. */
3106 cgraph_node::verify_cgraph_nodes (void)
3113 FOR_EACH_FUNCTION (node
)
3117 /* Walk the alias chain to return the function cgraph_node is alias of.
3118 Walk through thunk, too.
3119 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3122 cgraph_node::function_symbol (enum availability
*availability
)
3124 cgraph_node
*node
= this;
3128 node
= node
->ultimate_alias_target (availability
);
3129 if (node
->thunk
.thunk_p
)
3131 node
= node
->callees
->callee
;
3134 enum availability a
;
3135 a
= node
->get_availability ();
3136 if (a
< *availability
)
3139 node
= node
->ultimate_alias_target (availability
);
3141 } while (node
&& node
->thunk
.thunk_p
);
3145 /* When doing LTO, read cgraph_node's body from disk if it is not already
3149 cgraph_node::get_untransformed_body (void)
3151 lto_file_decl_data
*file_data
;
3152 const char *data
, *name
;
3154 tree decl
= this->decl
;
3156 if (DECL_RESULT (decl
))
3159 gcc_assert (in_lto_p
);
3161 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3163 file_data
= lto_file_data
;
3164 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3166 /* We may have renamed the declaration, e.g., a static function. */
3167 name
= lto_get_decl_name_mapping (file_data
, name
);
3169 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3172 fatal_error ("%s: section %s is missing",
3173 file_data
->file_name
,
3176 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3178 lto_input_function_body (file_data
, this, data
);
3179 lto_stats
.num_function_bodies
++;
3180 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3182 lto_free_function_in_decl_state_for_node (this);
3184 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3189 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3190 if it is not already present. When some IPA transformations are scheduled,
3194 cgraph_node::get_body (void)
3198 updated
= get_untransformed_body ();
3200 /* Getting transformed body makes no sense for inline clones;
3201 we should never use this on real clones becuase they are materialized
3203 TODO: Materializing clones here will likely lead to smaller LTRANS
3205 gcc_assert (!global
.inlined_to
&& !clone_of
);
3206 if (ipa_transforms_to_apply
.exists ())
3208 opt_pass
*saved_current_pass
= current_pass
;
3209 FILE *saved_dump_file
= dump_file
;
3210 int saved_dump_flags
= dump_flags
;
3212 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3213 execute_all_ipa_transforms ();
3214 cgraph_edge::rebuild_edges ();
3215 free_dominance_info (CDI_DOMINATORS
);
3216 free_dominance_info (CDI_POST_DOMINATORS
);
3220 current_pass
= saved_current_pass
;
3221 dump_file
= saved_dump_file
;
3222 dump_flags
= saved_dump_flags
;
3227 /* Return the DECL_STRUCT_FUNCTION of the function. */
3230 cgraph_node::get_fun (void)
3232 cgraph_node
*node
= this;
3233 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3235 while (!fun
&& node
->clone_of
)
3237 node
= node
->clone_of
;
3238 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3244 /* Verify if the type of the argument matches that of the function
3245 declaration. If we cannot verify this or there is a mismatch,
3249 gimple_check_call_args (gimple stmt
, tree fndecl
, bool args_count_match
)
3252 unsigned int i
, nargs
;
3254 /* Calls to internal functions always match their signature. */
3255 if (gimple_call_internal_p (stmt
))
3258 nargs
= gimple_call_num_args (stmt
);
3260 /* Get argument types for verification. */
3262 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3264 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3266 /* Verify if the type of the argument matches that of the function
3267 declaration. If we cannot verify this or there is a mismatch,
3269 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3271 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3273 i
++, p
= DECL_CHAIN (p
))
3276 /* We cannot distinguish a varargs function from the case
3277 of excess parameters, still deferring the inlining decision
3278 to the callee is possible. */
3281 arg
= gimple_call_arg (stmt
, i
);
3282 if (p
== error_mark_node
3283 || DECL_ARG_TYPE (p
) == error_mark_node
3284 || arg
== error_mark_node
3285 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3286 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3289 if (args_count_match
&& p
)
3294 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3297 /* If this is a varargs function defer inlining decision
3301 arg
= gimple_call_arg (stmt
, i
);
3302 if (TREE_VALUE (p
) == error_mark_node
3303 || arg
== error_mark_node
3304 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3305 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3306 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3318 /* Verify if the type of the argument and lhs of CALL_STMT matches
3319 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3320 true, the arg count needs to be the same.
3321 If we cannot verify this or there is a mismatch, return false. */
3324 gimple_check_call_matching_types (gimple call_stmt
, tree callee
,
3325 bool args_count_match
)
3329 if ((DECL_RESULT (callee
)
3330 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3331 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3332 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3334 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3335 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3340 /* Reset all state within cgraph.c so that we can rerun the compiler
3341 within the same process. For use by toplev::finalize. */
3344 cgraph_c_finalize (void)
3348 x_cgraph_nodes_queue
= NULL
;
3350 cgraph_fnver_htab
= NULL
;
3351 version_info_node
= NULL
;
3354 #include "gt-cgraph.h"