1 /* Callgraph handling code.
2 Copyright (C) 2003-2017 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"
35 #include "alloc-pool.h"
36 #include "gimple-ssa.h"
38 #include "lto-streamer.h"
39 #include "fold-const.h"
42 #include "print-tree.h"
43 #include "langhooks.h"
46 #include "gimple-iterator.h"
49 #include "value-prof.h"
50 #include "ipa-utils.h"
51 #include "symbol-summary.h"
54 #include "ipa-fnsummary.h"
56 #include "gimple-pretty-print.h"
60 #include "tree-chkp.h"
64 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
65 #include "tree-pass.h"
67 /* Queue of cgraph nodes scheduled to be lowered. */
68 symtab_node
*x_cgraph_nodes_queue
;
69 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
71 /* Symbol table global context. */
74 /* List of hooks triggered on cgraph_edge events. */
75 struct cgraph_edge_hook_list
{
76 cgraph_edge_hook hook
;
78 struct cgraph_edge_hook_list
*next
;
81 /* List of hooks triggered on cgraph_node events. */
82 struct cgraph_node_hook_list
{
83 cgraph_node_hook hook
;
85 struct cgraph_node_hook_list
*next
;
88 /* List of hooks triggered on events involving two cgraph_edges. */
89 struct cgraph_2edge_hook_list
{
90 cgraph_2edge_hook hook
;
92 struct cgraph_2edge_hook_list
*next
;
95 /* List of hooks triggered on events involving two cgraph_nodes. */
96 struct cgraph_2node_hook_list
{
97 cgraph_2node_hook hook
;
99 struct cgraph_2node_hook_list
*next
;
102 /* Hash descriptor for cgraph_function_version_info. */
104 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
106 static hashval_t
hash (cgraph_function_version_info
*);
107 static bool equal (cgraph_function_version_info
*,
108 cgraph_function_version_info
*);
111 /* Map a cgraph_node to cgraph_function_version_info using this htab.
112 The cgraph_function_version_info has a THIS_NODE field that is the
113 corresponding cgraph_node.. */
115 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
117 /* Hash function for cgraph_fnver_htab. */
119 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
121 int uid
= ptr
->this_node
->uid
;
122 return (hashval_t
)(uid
);
125 /* eq function for cgraph_fnver_htab. */
127 function_version_hasher::equal (cgraph_function_version_info
*n1
,
128 cgraph_function_version_info
*n2
)
130 return n1
->this_node
->uid
== n2
->this_node
->uid
;
133 /* Mark as GC root all allocated nodes. */
134 static GTY(()) struct cgraph_function_version_info
*
135 version_info_node
= NULL
;
137 /* Return true if NODE's address can be compared. */
140 symtab_node::address_can_be_compared_p ()
142 /* Address of virtual tables and functions is never compared. */
143 if (DECL_VIRTUAL_P (decl
))
145 /* Address of C++ cdtors is never compared. */
146 if (is_a
<cgraph_node
*> (this)
147 && (DECL_CXX_CONSTRUCTOR_P (decl
)
148 || DECL_CXX_DESTRUCTOR_P (decl
)))
150 /* Constant pool symbols addresses are never compared.
151 flag_merge_constants permits us to assume the same on readonly vars. */
152 if (is_a
<varpool_node
*> (this)
153 && (DECL_IN_CONSTANT_POOL (decl
)
154 || (flag_merge_constants
>= 2
155 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
160 /* Get the cgraph_function_version_info node corresponding to node. */
161 cgraph_function_version_info
*
162 cgraph_node::function_version (void)
164 cgraph_function_version_info key
;
165 key
.this_node
= this;
167 if (cgraph_fnver_htab
== NULL
)
170 return cgraph_fnver_htab
->find (&key
);
173 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
174 corresponding to cgraph_node NODE. */
175 cgraph_function_version_info
*
176 cgraph_node::insert_new_function_version (void)
178 version_info_node
= NULL
;
179 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
180 version_info_node
->this_node
= this;
182 if (cgraph_fnver_htab
== NULL
)
183 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
185 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
187 return version_info_node
;
190 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
191 DECL is a duplicate declaration. */
193 cgraph_node::delete_function_version (tree decl
)
195 cgraph_node
*decl_node
= cgraph_node::get (decl
);
196 cgraph_function_version_info
*decl_v
= NULL
;
198 if (decl_node
== NULL
)
201 decl_v
= decl_node
->function_version ();
206 if (decl_v
->prev
!= NULL
)
207 decl_v
->prev
->next
= decl_v
->next
;
209 if (decl_v
->next
!= NULL
)
210 decl_v
->next
->prev
= decl_v
->prev
;
212 if (cgraph_fnver_htab
!= NULL
)
213 cgraph_fnver_htab
->remove_elt (decl_v
);
215 decl_node
->remove ();
218 /* Record that DECL1 and DECL2 are semantically identical function
221 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
223 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
224 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
225 cgraph_function_version_info
*decl1_v
= NULL
;
226 cgraph_function_version_info
*decl2_v
= NULL
;
227 cgraph_function_version_info
*before
;
228 cgraph_function_version_info
*after
;
230 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
231 decl1_v
= decl1_node
->function_version ();
232 decl2_v
= decl2_node
->function_version ();
234 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
238 decl1_v
= decl1_node
->insert_new_function_version ();
241 decl2_v
= decl2_node
->insert_new_function_version ();
243 /* Chain decl2_v and decl1_v. All semantically identical versions
244 will be chained together. */
249 while (before
->next
!= NULL
)
250 before
= before
->next
;
252 while (after
->prev
!= NULL
)
255 before
->next
= after
;
256 after
->prev
= before
;
259 /* Initialize callgraph dump file. */
262 symbol_table::initialize (void)
265 dump_file
= dump_begin (TDI_cgraph
, NULL
);
267 if (!ipa_clones_dump_file
)
268 ipa_clones_dump_file
= dump_begin (TDI_clones
, NULL
);
271 /* Allocate new callgraph node and insert it into basic data structures. */
274 symbol_table::create_empty (void)
276 cgraph_node
*node
= allocate_cgraph_symbol ();
278 node
->type
= SYMTAB_FUNCTION
;
279 node
->frequency
= NODE_FREQUENCY_NORMAL
;
280 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
286 /* Register HOOK to be called with DATA on each removed edge. */
287 cgraph_edge_hook_list
*
288 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
290 cgraph_edge_hook_list
*entry
;
291 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
293 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
303 /* Remove ENTRY from the list of hooks called on removing edges. */
305 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
307 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
309 while (*ptr
!= entry
)
315 /* Call all edge removal hooks. */
317 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
319 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
322 entry
->hook (e
, entry
->data
);
327 /* Register HOOK to be called with DATA on each removed node. */
328 cgraph_node_hook_list
*
329 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
331 cgraph_node_hook_list
*entry
;
332 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
334 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
344 /* Remove ENTRY from the list of hooks called on removing nodes. */
346 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
348 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
350 while (*ptr
!= entry
)
356 /* Call all node removal hooks. */
358 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
360 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
363 entry
->hook (node
, entry
->data
);
368 /* Call all node removal hooks. */
370 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
372 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
375 entry
->hook (node
, entry
->data
);
381 /* Register HOOK to be called with DATA on each inserted node. */
382 cgraph_node_hook_list
*
383 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
385 cgraph_node_hook_list
*entry
;
386 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
388 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
398 /* Remove ENTRY from the list of hooks called on inserted nodes. */
400 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
402 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
404 while (*ptr
!= entry
)
410 /* Register HOOK to be called with DATA on each duplicated edge. */
411 cgraph_2edge_hook_list
*
412 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
414 cgraph_2edge_hook_list
*entry
;
415 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
417 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
427 /* Remove ENTRY from the list of hooks called on duplicating edges. */
429 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
431 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
433 while (*ptr
!= entry
)
439 /* Call all edge duplication hooks. */
441 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
443 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
446 entry
->hook (cs1
, cs2
, entry
->data
);
451 /* Register HOOK to be called with DATA on each duplicated node. */
452 cgraph_2node_hook_list
*
453 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
455 cgraph_2node_hook_list
*entry
;
456 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
458 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
468 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
470 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
472 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
474 while (*ptr
!= entry
)
480 /* Call all node duplication hooks. */
482 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
485 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
488 entry
->hook (node
, node2
, entry
->data
);
493 /* Return cgraph node assigned to DECL. Create new one when needed. */
496 cgraph_node::create (tree decl
)
498 cgraph_node
*node
= symtab
->create_empty ();
499 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
503 node
->count
= profile_count::uninitialized ();
505 if ((flag_openacc
|| flag_openmp
)
506 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
508 node
->offloadable
= 1;
509 if (ENABLE_OFFLOADING
)
510 g
->have_offload
= true;
513 node
->register_symbol ();
515 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
517 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
518 node
->next_nested
= node
->origin
->nested
;
519 node
->origin
->nested
= node
;
524 /* Try to find a call graph node for declaration DECL and if it does not exist
525 or if it corresponds to an inline clone, create a new one. */
528 cgraph_node::get_create (tree decl
)
530 cgraph_node
*first_clone
= cgraph_node::get (decl
);
532 if (first_clone
&& !first_clone
->global
.inlined_to
)
535 cgraph_node
*node
= cgraph_node::create (decl
);
538 first_clone
->clone_of
= node
;
539 node
->clones
= first_clone
;
540 symtab
->symtab_prevail_in_asm_name_hash (node
);
541 node
->decl
->decl_with_vis
.symtab_node
= node
;
543 fprintf (dump_file
, "Introduced new external node "
544 "(%s) and turned into root of the clone tree.\n",
548 fprintf (dump_file
, "Introduced new external node "
549 "(%s).\n", node
->dump_name ());
553 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
554 the function body is associated with (not necessarily cgraph_node (DECL). */
557 cgraph_node::create_alias (tree alias
, tree target
)
559 cgraph_node
*alias_node
;
561 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
562 || TREE_CODE (target
) == IDENTIFIER_NODE
);
563 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
564 alias_node
= cgraph_node::get_create (alias
);
565 gcc_assert (!alias_node
->definition
);
566 alias_node
->alias_target
= target
;
567 alias_node
->definition
= true;
568 alias_node
->alias
= true;
569 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
570 alias_node
->transparent_alias
= alias_node
->weakref
= true;
574 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
576 Same body aliases are output whenever the body of DECL is output,
577 and cgraph_node::get (ALIAS) transparently returns
578 cgraph_node::get (DECL). */
581 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
584 #ifndef ASM_OUTPUT_DEF
585 /* If aliases aren't supported by the assembler, fail. */
588 /* Langhooks can create same body aliases of symbols not defined.
589 Those are useless. Drop them on the floor. */
590 if (symtab
->global_info_ready
)
593 n
= cgraph_node::create_alias (alias
, decl
);
594 n
->cpp_implicit_alias
= true;
595 if (symtab
->cpp_implicit_aliases_done
)
596 n
->resolve_alias (cgraph_node::get (decl
));
600 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
601 aliases DECL with an adjustments made into the first parameter.
602 See comments in thunk_adjust for detail on the parameters. */
605 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
606 HOST_WIDE_INT fixed_offset
,
607 HOST_WIDE_INT virtual_value
,
613 node
= cgraph_node::get (alias
);
617 node
= cgraph_node::create (alias
);
618 gcc_checking_assert (!virtual_offset
619 || wi::eq_p (virtual_offset
, virtual_value
));
620 node
->thunk
.fixed_offset
= fixed_offset
;
621 node
->thunk
.this_adjusting
= this_adjusting
;
622 node
->thunk
.virtual_value
= virtual_value
;
623 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
624 node
->thunk
.alias
= real_alias
;
625 node
->thunk
.thunk_p
= true;
626 node
->definition
= true;
631 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
632 Return NULL if there's no such node. */
635 cgraph_node::get_for_asmname (tree asmname
)
637 /* We do not want to look at inline clones. */
638 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
640 node
= node
->next_sharing_asm_name
)
642 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
643 if (cn
&& !cn
->global
.inlined_to
)
649 /* Returns a hash value for X (which really is a cgraph_edge). */
652 cgraph_edge_hasher::hash (cgraph_edge
*e
)
654 /* This is a really poor hash function, but it is what htab_hash_pointer
656 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
659 /* Returns a hash value for X (which really is a cgraph_edge). */
662 cgraph_edge_hasher::hash (gimple
*call_stmt
)
664 /* This is a really poor hash function, but it is what htab_hash_pointer
666 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
669 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
672 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
674 return x
->call_stmt
== y
;
677 /* Add call graph edge E to call site hash of its caller. */
680 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
682 gimple
*call
= e
->call_stmt
;
683 *e
->caller
->call_site_hash
->find_slot_with_hash
684 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
687 /* Add call graph edge E to call site hash of its caller. */
690 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
692 /* There are two speculative edges for every statement (one direct,
693 one indirect); always hash the direct one. */
694 if (e
->speculative
&& e
->indirect_unknown_callee
)
696 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
697 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
700 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
705 gcc_assert (!*slot
|| e
->speculative
);
709 /* Return the callgraph edge representing the GIMPLE_CALL statement
713 cgraph_node::get_edge (gimple
*call_stmt
)
719 return call_site_hash
->find_with_hash
720 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
722 /* This loop may turn out to be performance problem. In such case adding
723 hashtables into call nodes with very many edges is probably best
724 solution. It is not good idea to add pointer into CALL_EXPR itself
725 because we want to make possible having multiple cgraph nodes representing
726 different clones of the same body before the body is actually cloned. */
727 for (e
= callees
; e
; e
= e
->next_callee
)
729 if (e
->call_stmt
== call_stmt
)
735 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
737 if (e
->call_stmt
== call_stmt
)
744 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
745 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
746 cgraph_add_edge_to_call_site_hash (e2
);
747 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
748 cgraph_add_edge_to_call_site_hash (e2
);
755 /* Change field call_stmt of edge to NEW_STMT.
756 If UPDATE_SPECULATIVE and E is any component of speculative
757 edge, then update all components. */
760 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
764 /* Speculative edges has three component, update all of them
766 if (update_speculative
&& speculative
)
768 cgraph_edge
*direct
, *indirect
;
771 speculative_call_info (direct
, indirect
, ref
);
772 direct
->set_call_stmt (new_stmt
, false);
773 indirect
->set_call_stmt (new_stmt
, false);
774 ref
->stmt
= new_stmt
;
778 /* Only direct speculative edges go to call_site_hash. */
779 if (caller
->call_site_hash
780 && (!speculative
|| !indirect_unknown_callee
))
782 caller
->call_site_hash
->remove_elt_with_hash
783 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
786 cgraph_edge
*e
= this;
788 call_stmt
= new_stmt
;
789 if (indirect_unknown_callee
790 && (decl
= gimple_call_fndecl (new_stmt
)))
792 /* Constant propagation (and possibly also inlining?) can turn an
793 indirect call into a direct one. */
794 cgraph_node
*new_callee
= cgraph_node::get (decl
);
796 gcc_checking_assert (new_callee
);
797 e
= make_direct (new_callee
);
800 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
801 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
803 if (e
->caller
->call_site_hash
)
804 cgraph_add_edge_to_call_site_hash (e
);
807 /* Allocate a cgraph_edge structure and fill it with data according to the
808 parameters of which only CALLEE can be NULL (when creating an indirect call
812 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
813 gcall
*call_stmt
, profile_count count
, int freq
,
814 bool indir_unknown_callee
)
818 /* LTO does not actually have access to the call_stmt since these
819 have not been loaded yet. */
822 /* This is a rather expensive check possibly triggering
823 construction of call stmt hashtable. */
825 gcc_checking_assert (!(e
= caller
->get_edge (call_stmt
))
828 gcc_assert (is_gimple_call (call_stmt
));
834 free_edges
= NEXT_FREE_EDGE (edge
);
838 edge
= ggc_alloc
<cgraph_edge
> ();
839 edge
->uid
= edges_max_uid
++;
845 edge
->caller
= caller
;
846 edge
->callee
= callee
;
847 edge
->prev_caller
= NULL
;
848 edge
->next_caller
= NULL
;
849 edge
->prev_callee
= NULL
;
850 edge
->next_callee
= NULL
;
851 edge
->lto_stmt_uid
= 0;
854 edge
->frequency
= freq
;
855 gcc_checking_assert (freq
>= 0);
856 gcc_checking_assert (freq
<= CGRAPH_FREQ_MAX
);
858 edge
->call_stmt
= call_stmt
;
859 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
860 edge
->can_throw_external
861 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
864 && callee
&& callee
->decl
865 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
868 edge
->inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
869 edge
->call_stmt_cannot_inline_p
= true;
873 edge
->inline_failed
= CIF_FUNCTION_NOT_CONSIDERED
;
874 edge
->call_stmt_cannot_inline_p
= false;
877 edge
->indirect_info
= NULL
;
878 edge
->indirect_inlining_edge
= 0;
879 edge
->speculative
= false;
880 edge
->indirect_unknown_callee
= indir_unknown_callee
;
881 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
882 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
883 edge
->in_polymorphic_cdtor
884 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
887 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
888 if (call_stmt
&& caller
->call_site_hash
)
889 cgraph_add_edge_to_call_site_hash (edge
);
894 /* Create edge from a given function to CALLEE in the cgraph. */
897 cgraph_node::create_edge (cgraph_node
*callee
,
898 gcall
*call_stmt
, profile_count count
, int freq
)
900 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
903 initialize_inline_failed (edge
);
905 edge
->next_caller
= callee
->callers
;
907 callee
->callers
->prev_caller
= edge
;
908 edge
->next_callee
= callees
;
910 callees
->prev_callee
= edge
;
912 callee
->callers
= edge
;
917 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
919 cgraph_indirect_call_info
*
920 cgraph_allocate_init_indirect_info (void)
922 cgraph_indirect_call_info
*ii
;
924 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
925 ii
->param_index
= -1;
929 /* Create an indirect edge with a yet-undetermined callee where the call
930 statement destination is a formal parameter of the caller with index
934 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
935 profile_count count
, int freq
,
936 bool compute_indirect_info
)
938 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
942 initialize_inline_failed (edge
);
944 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
945 edge
->indirect_info
->ecf_flags
= ecf_flags
;
946 edge
->indirect_info
->vptr_changed
= true;
948 /* Record polymorphic call info. */
949 if (compute_indirect_info
951 && (target
= gimple_call_fn (call_stmt
))
952 && virtual_method_call_p (target
))
954 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
956 /* Only record types can have virtual calls. */
957 edge
->indirect_info
->polymorphic
= true;
958 edge
->indirect_info
->param_index
= -1;
959 edge
->indirect_info
->otr_token
960 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
961 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
962 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
963 edge
->indirect_info
->context
= context
;
966 edge
->next_callee
= indirect_calls
;
968 indirect_calls
->prev_callee
= edge
;
969 indirect_calls
= edge
;
974 /* Remove the edge from the list of the callees of the caller. */
977 cgraph_edge::remove_caller (void)
980 prev_callee
->next_callee
= next_callee
;
982 next_callee
->prev_callee
= prev_callee
;
985 if (indirect_unknown_callee
)
986 caller
->indirect_calls
= next_callee
;
988 caller
->callees
= next_callee
;
990 if (caller
->call_site_hash
)
991 caller
->call_site_hash
->remove_elt_with_hash
992 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
995 /* Put the edge onto the free list. */
998 symbol_table::free_edge (cgraph_edge
*e
)
1002 if (e
->indirect_info
)
1003 ggc_free (e
->indirect_info
);
1005 /* Clear out the edge so we do not dangle pointers. */
1006 memset (e
, 0, sizeof (*e
));
1008 NEXT_FREE_EDGE (e
) = free_edges
;
1013 /* Remove the edge in the cgraph. */
1016 cgraph_edge::remove (void)
1018 /* Call all edge removal hooks. */
1019 symtab
->call_edge_removal_hooks (this);
1021 if (!indirect_unknown_callee
)
1022 /* Remove from callers list of the callee. */
1025 /* Remove from callees list of the callers. */
1028 /* Put the edge onto the free list. */
1029 symtab
->free_edge (this);
1032 /* Turn edge into speculative call calling N2. Update
1033 the profile so the direct call is taken COUNT times
1036 At clone materialization time, the indirect call E will
1039 if (call_dest == N2)
1044 At this time the function just creates the direct call,
1045 the referencd representing the if conditional and attaches
1046 them all to the orginal indirect call statement.
1048 Return direct edge created. */
1051 cgraph_edge::make_speculative (cgraph_node
*n2
, profile_count direct_count
,
1052 int direct_frequency
)
1054 cgraph_node
*n
= caller
;
1055 ipa_ref
*ref
= NULL
;
1059 fprintf (dump_file
, "Indirect call -> speculative call %s => %s\n",
1060 n
->dump_name (), n2
->dump_name ());
1062 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1063 initialize_inline_failed (e2
);
1064 e2
->speculative
= true;
1065 if (TREE_NOTHROW (n2
->decl
))
1066 e2
->can_throw_external
= false;
1068 e2
->can_throw_external
= can_throw_external
;
1069 e2
->lto_stmt_uid
= lto_stmt_uid
;
1070 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1072 frequency
-= e2
->frequency
;
1073 symtab
->call_edge_duplication_hooks (this, e2
);
1074 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1075 ref
->lto_stmt_uid
= lto_stmt_uid
;
1076 ref
->speculative
= speculative
;
1077 n2
->mark_address_taken ();
1081 /* Speculative call consist of three components:
1082 1) an indirect edge representing the original call
1083 2) an direct edge representing the new call
1084 3) ADDR_EXPR reference representing the speculative check.
1085 All three components are attached to single statement (the indirect
1086 call) and if one of them exists, all of them must exist.
1088 Given speculative call edge, return all three components.
1092 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1093 cgraph_edge
*&indirect
,
1094 ipa_ref
*&reference
)
1099 cgraph_edge
*e
= this;
1101 if (!e
->indirect_unknown_callee
)
1102 for (e2
= e
->caller
->indirect_calls
;
1103 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1104 e2
= e2
->next_callee
)
1109 /* We can take advantage of the call stmt hash. */
1112 e
= e
->caller
->get_edge (e2
->call_stmt
);
1113 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1116 for (e
= e
->caller
->callees
;
1117 e2
->call_stmt
!= e
->call_stmt
1118 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1122 gcc_assert (e
->speculative
&& e2
->speculative
);
1127 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1128 if (ref
->speculative
1129 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1130 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1136 /* Speculative edge always consist of all three components - direct edge,
1137 indirect and reference. */
1139 gcc_assert (e
&& e2
&& ref
);
1142 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1143 Remove the speculative call sequence and return edge representing the call.
1144 It is up to caller to redirect the call as appropriate. */
1147 cgraph_edge::resolve_speculation (tree callee_decl
)
1149 cgraph_edge
*edge
= this;
1153 gcc_assert (edge
->speculative
);
1154 edge
->speculative_call_info (e2
, edge
, ref
);
1156 || !ref
->referred
->semantically_equivalent_p
1157 (symtab_node::get (callee_decl
)))
1163 fprintf (dump_file
, "Speculative indirect call %s => %s has "
1164 "turned out to have contradicting known target ",
1165 edge
->caller
->dump_name (),
1166 e2
->callee
->dump_name ());
1167 print_generic_expr (dump_file
, callee_decl
);
1168 fprintf (dump_file
, "\n");
1172 fprintf (dump_file
, "Removing speculative call %s => %s\n",
1173 edge
->caller
->dump_name (),
1174 e2
->callee
->dump_name ());
1180 cgraph_edge
*tmp
= edge
;
1182 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1185 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1186 in the functions inlined through it. */
1188 edge
->count
+= e2
->count
;
1189 edge
->frequency
+= e2
->frequency
;
1190 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1191 edge
->frequency
= CGRAPH_FREQ_MAX
;
1192 edge
->speculative
= false;
1193 e2
->speculative
= false;
1194 ref
->remove_reference ();
1195 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1198 e2
->callee
->remove_symbol_and_inline_clones ();
1199 if (edge
->caller
->call_site_hash
)
1200 cgraph_update_edge_in_call_site_hash (edge
);
1204 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1205 CALLEE. DELTA is an integer constant that is to be added to the this
1206 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1209 cgraph_edge::make_direct (cgraph_node
*callee
)
1211 cgraph_edge
*edge
= this;
1212 gcc_assert (indirect_unknown_callee
);
1214 /* If we are redirecting speculative call, make it non-speculative. */
1215 if (indirect_unknown_callee
&& speculative
)
1217 edge
= edge
->resolve_speculation (callee
->decl
);
1219 /* On successful speculation just return the pre existing direct edge. */
1220 if (!indirect_unknown_callee
)
1224 indirect_unknown_callee
= 0;
1225 ggc_free (indirect_info
);
1226 indirect_info
= NULL
;
1228 /* Get the edge out of the indirect edge list. */
1230 prev_callee
->next_callee
= next_callee
;
1232 next_callee
->prev_callee
= prev_callee
;
1234 caller
->indirect_calls
= next_callee
;
1236 /* Put it into the normal callee list */
1238 next_callee
= caller
->callees
;
1239 if (caller
->callees
)
1240 caller
->callees
->prev_callee
= edge
;
1241 caller
->callees
= edge
;
1243 /* Insert to callers list of the new callee. */
1244 edge
->set_callee (callee
);
1247 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
, false))
1249 call_stmt_cannot_inline_p
= true;
1250 inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
1253 /* We need to re-determine the inlining status of the edge. */
1254 initialize_inline_failed (edge
);
1258 /* If necessary, change the function declaration in the call statement
1259 associated with E so that it corresponds to the edge callee. */
1262 cgraph_edge::redirect_call_stmt_to_callee (void)
1264 cgraph_edge
*e
= this;
1266 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1268 gimple_stmt_iterator gsi
;
1269 bool skip_bounds
= false;
1277 e
->speculative_call_info (e
, e2
, ref
);
1278 /* If there already is an direct call (i.e. as a result of inliner's
1279 substitution), forget about speculating. */
1281 e
= e
->resolve_speculation (decl
);
1282 /* If types do not match, speculation was likely wrong.
1283 The direct edge was possibly redirected to the clone with a different
1284 signature. We did not update the call statement yet, so compare it
1285 with the reference that still points to the proper type. */
1286 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1287 ref
->referred
->decl
,
1291 fprintf (dump_file
, "Not expanding speculative call of %s -> %s\n"
1293 e
->caller
->dump_name (),
1294 e
->callee
->dump_name ());
1295 e
= e
->resolve_speculation ();
1296 /* We are producing the final function body and will throw away the
1297 callgraph edges really soon. Reset the counts/frequencies to
1298 keep verifier happy in the case of roundoff errors. */
1299 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1300 e
->frequency
= compute_call_stmt_bb_frequency
1301 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1303 /* Expand speculation into GIMPLE code. */
1309 "Expanding speculative call of %s -> %s count: ",
1310 e
->caller
->dump_name (),
1311 e
->callee
->dump_name ());
1312 e
->count
.dump (dump_file
);
1313 fprintf (dump_file
, "\n");
1315 gcc_assert (e2
->speculative
);
1316 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1317 new_stmt
= gimple_ic (e
->call_stmt
,
1318 dyn_cast
<cgraph_node
*> (ref
->referred
),
1319 e
->count
> profile_count::zero ()
1320 || e2
->count
> profile_count::zero ()
1321 ? e
->count
.probability_in (e
->count
+ e2
->count
)
1322 : e
->frequency
|| e2
->frequency
1323 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1324 e
->frequency
+ e2
->frequency
)
1325 : REG_BR_PROB_BASE
/ 2,
1326 e
->count
, e
->count
+ e2
->count
);
1327 e
->speculative
= false;
1328 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1331 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1332 processed call stmt. */
1333 if (gimple_call_with_bounds_p (new_stmt
)
1334 && gimple_call_lhs (new_stmt
)
1335 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1337 tree dresult
= gimple_call_lhs (new_stmt
);
1338 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1339 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1340 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1341 struct cgraph_edge
*iedge
1342 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1343 struct cgraph_edge
*dedge
;
1347 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1350 dedge
->frequency
= compute_call_stmt_bb_frequency
1351 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1353 iedge
->frequency
= compute_call_stmt_bb_frequency
1354 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1357 e
->frequency
= compute_call_stmt_bb_frequency
1358 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1359 e2
->frequency
= compute_call_stmt_bb_frequency
1360 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1361 e2
->speculative
= false;
1362 ref
->speculative
= false;
1364 /* Indirect edges are not both in the call site hash.
1366 if (e
->caller
->call_site_hash
)
1367 cgraph_update_edge_in_call_site_hash (e2
);
1369 /* Continue redirecting E to proper target. */
1373 /* We might propagate instrumented function pointer into
1374 not instrumented function and vice versa. In such a
1375 case we need to either fix function declaration or
1376 remove bounds from call statement. */
1377 if (flag_check_pointer_bounds
&& e
->callee
)
1378 skip_bounds
= chkp_redirect_edge (e
);
1380 if (e
->indirect_unknown_callee
1381 || (decl
== e
->callee
->decl
1383 return e
->call_stmt
;
1385 if (flag_checking
&& decl
)
1387 cgraph_node
*node
= cgraph_node::get (decl
);
1388 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1391 if (symtab
->dump_file
)
1393 fprintf (symtab
->dump_file
, "updating call of %s -> %s: ",
1394 e
->caller
->dump_name (), e
->callee
->dump_name ());
1395 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1396 if (e
->callee
->clone
.combined_args_to_skip
)
1398 fprintf (symtab
->dump_file
, " combined args to skip: ");
1399 dump_bitmap (symtab
->dump_file
,
1400 e
->callee
->clone
.combined_args_to_skip
);
1404 if (e
->callee
->clone
.combined_args_to_skip
1409 new_stmt
= e
->call_stmt
;
1410 if (e
->callee
->clone
.combined_args_to_skip
)
1412 = gimple_call_copy_skip_args (new_stmt
,
1413 e
->callee
->clone
.combined_args_to_skip
);
1415 new_stmt
= chkp_copy_call_skip_bounds (new_stmt
);
1417 tree old_fntype
= gimple_call_fntype (e
->call_stmt
);
1418 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1419 cgraph_node
*origin
= e
->callee
;
1420 while (origin
->clone_of
)
1421 origin
= origin
->clone_of
;
1423 if ((origin
->former_clone_of
1424 && old_fntype
== TREE_TYPE (origin
->former_clone_of
))
1425 || old_fntype
== TREE_TYPE (origin
->decl
))
1426 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1429 bitmap skip
= e
->callee
->clone
.combined_args_to_skip
;
1430 tree t
= cgraph_build_function_type_skip_args (old_fntype
, skip
,
1432 gimple_call_set_fntype (new_stmt
, t
);
1435 if (gimple_vdef (new_stmt
)
1436 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1437 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1439 gsi
= gsi_for_stmt (e
->call_stmt
);
1441 /* For optimized away parameters, add on the caller side
1443 DEBUG D#X => parm_Y(D)
1444 stmts and associate D#X with parm in decl_debug_args_lookup
1445 vector to say for debug info that if parameter parm had been passed,
1446 it would have value parm_Y(D). */
1447 if (e
->callee
->clone
.combined_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
1449 vec
<tree
, va_gc
> **debug_args
1450 = decl_debug_args_lookup (e
->callee
->decl
);
1451 tree old_decl
= gimple_call_fndecl (e
->call_stmt
);
1452 if (debug_args
&& old_decl
)
1455 unsigned i
= 0, num
;
1456 unsigned len
= vec_safe_length (*debug_args
);
1457 unsigned nargs
= gimple_call_num_args (e
->call_stmt
);
1458 for (parm
= DECL_ARGUMENTS (old_decl
), num
= 0;
1459 parm
&& num
< nargs
;
1460 parm
= DECL_CHAIN (parm
), num
++)
1461 if (bitmap_bit_p (e
->callee
->clone
.combined_args_to_skip
, num
)
1462 && is_gimple_reg (parm
))
1466 while (i
< len
&& (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1472 && (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1477 tree ddecl
= (**debug_args
)[i
+ 1];
1478 tree arg
= gimple_call_arg (e
->call_stmt
, num
);
1479 if (!useless_type_conversion_p (TREE_TYPE (ddecl
),
1483 if (!fold_convertible_p (TREE_TYPE (ddecl
), arg
))
1485 if (TREE_CODE (arg
) == SSA_NAME
1486 && gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg
))
1488 = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (arg
)))
1489 && useless_type_conversion_p (TREE_TYPE (ddecl
),
1493 arg
= fold_convert (TREE_TYPE (ddecl
), arg
);
1497 = gimple_build_debug_bind (ddecl
, unshare_expr (arg
),
1499 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
1504 gsi_replace (&gsi
, new_stmt
, false);
1505 /* We need to defer cleaning EH info on the new statement to
1506 fixup-cfg. We may not have dominator information at this point
1507 and thus would end up with unreachable blocks and have no way
1508 to communicate that we need to run CFG cleanup then. */
1509 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1512 remove_stmt_from_eh_lp (e
->call_stmt
);
1513 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1518 new_stmt
= e
->call_stmt
;
1519 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1520 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1523 /* If changing the call to __cxa_pure_virtual or similar noreturn function,
1524 adjust gimple_call_fntype too. */
1525 if (gimple_call_noreturn_p (new_stmt
)
1526 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e
->callee
->decl
)))
1527 && TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
))
1528 && (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
)))
1530 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1532 /* If the call becomes noreturn, remove the LHS if possible. */
1533 tree lhs
= gimple_call_lhs (new_stmt
);
1535 && gimple_call_noreturn_p (new_stmt
)
1536 && (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt
)))
1537 || should_remove_lhs_p (lhs
)))
1539 if (TREE_CODE (lhs
) == SSA_NAME
)
1541 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1542 TREE_TYPE (lhs
), NULL
);
1543 var
= get_or_create_ssa_default_def
1544 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1545 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1546 gsi
= gsi_for_stmt (new_stmt
);
1547 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1548 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1550 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1551 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1554 /* If new callee has no static chain, remove it. */
1555 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1557 gimple_call_set_chain (new_stmt
, NULL
);
1558 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1561 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1564 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1566 if (symtab
->dump_file
)
1568 fprintf (symtab
->dump_file
, " updated to:");
1569 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1574 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1575 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1576 of OLD_STMT if it was previously call statement.
1577 If NEW_STMT is NULL, the call has been dropped without any
1581 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1582 gimple
*old_stmt
, tree old_call
,
1585 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1586 ? gimple_call_fndecl (new_stmt
) : 0;
1588 /* We are seeing indirect calls, then there is nothing to update. */
1589 if (!new_call
&& !old_call
)
1591 /* See if we turned indirect call into direct call or folded call to one builtin
1592 into different builtin. */
1593 if (old_call
!= new_call
)
1595 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1596 cgraph_edge
*ne
= NULL
;
1597 profile_count count
;
1602 /* Keep calls marked as dead dead. */
1603 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1604 && DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
1605 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
1607 node
->get_edge (old_stmt
)->set_call_stmt
1608 (as_a
<gcall
*> (new_stmt
));
1611 /* See if the edge is already there and has the correct callee. It
1612 might be so because of indirect inlining has already updated
1613 it. We also might've cloned and redirected the edge. */
1614 if (new_call
&& e
->callee
)
1616 cgraph_node
*callee
= e
->callee
;
1619 if (callee
->decl
== new_call
1620 || callee
->former_clone_of
== new_call
)
1622 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1625 callee
= callee
->clone_of
;
1629 /* Otherwise remove edge and create new one; we can't simply redirect
1630 since function has changed, so inline plan and other information
1631 attached to edge is invalid. */
1633 frequency
= e
->frequency
;
1634 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1637 e
->callee
->remove_symbol_and_inline_clones ();
1641 /* We are seeing new direct call; compute profile info based on BB. */
1642 basic_block bb
= gimple_bb (new_stmt
);
1644 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1650 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1651 as_a
<gcall
*> (new_stmt
), count
,
1653 gcc_assert (ne
->inline_failed
);
1656 /* We only updated the call stmt; update pointer in cgraph edge.. */
1657 else if (old_stmt
!= new_stmt
)
1658 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1661 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1662 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1663 of OLD_STMT before it was updated (updating can happen inplace). */
1666 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1669 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1672 gcc_checking_assert (orig
);
1673 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1675 for (node
= orig
->clones
; node
!= orig
;)
1677 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1679 node
= node
->clones
;
1680 else if (node
->next_sibling_clone
)
1681 node
= node
->next_sibling_clone
;
1684 while (node
!= orig
&& !node
->next_sibling_clone
)
1685 node
= node
->clone_of
;
1687 node
= node
->next_sibling_clone
;
1693 /* Remove all callees from the node. */
1696 cgraph_node::remove_callees (void)
1700 /* It is sufficient to remove the edges from the lists of callers of
1701 the callees. The callee list of the node can be zapped with one
1703 for (e
= callees
; e
; e
= f
)
1706 symtab
->call_edge_removal_hooks (e
);
1707 if (!e
->indirect_unknown_callee
)
1708 e
->remove_callee ();
1709 symtab
->free_edge (e
);
1711 for (e
= indirect_calls
; e
; e
= f
)
1714 symtab
->call_edge_removal_hooks (e
);
1715 if (!e
->indirect_unknown_callee
)
1716 e
->remove_callee ();
1717 symtab
->free_edge (e
);
1719 indirect_calls
= NULL
;
1723 call_site_hash
->empty ();
1724 call_site_hash
= NULL
;
1728 /* Remove all callers from the node. */
1731 cgraph_node::remove_callers (void)
1735 /* It is sufficient to remove the edges from the lists of callees of
1736 the callers. The caller list of the node can be zapped with one
1738 for (e
= callers
; e
; e
= f
)
1741 symtab
->call_edge_removal_hooks (e
);
1742 e
->remove_caller ();
1743 symtab
->free_edge (e
);
1748 /* Helper function for cgraph_release_function_body and free_lang_data.
1749 It releases body from function DECL without having to inspect its
1750 possibly non-existent symtab node. */
1753 release_function_body (tree decl
)
1755 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1759 && loops_for_fn (fn
))
1761 fn
->curr_properties
&= ~PROP_loops
;
1762 loop_optimizer_finalize (fn
);
1766 delete_tree_ssa (fn
);
1771 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1772 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1773 delete_tree_cfg_annotations (fn
);
1777 if (fn
->value_histograms
)
1778 free_histograms (fn
);
1779 gimple_set_body (decl
, NULL
);
1780 /* Struct function hangs a lot of data that would leak if we didn't
1781 removed all pointers to it. */
1783 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1785 DECL_SAVED_TREE (decl
) = NULL
;
1788 /* Release memory used to represent body of function.
1789 Use this only for functions that are released before being translated to
1790 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1791 are free'd in final.c via free_after_compilation().
1792 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1795 cgraph_node::release_body (bool keep_arguments
)
1797 ipa_transforms_to_apply
.release ();
1798 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1800 DECL_RESULT (decl
) = NULL
;
1802 if (!keep_arguments
)
1803 DECL_ARGUMENTS (decl
) = NULL
;
1805 /* If the node is abstract and needed, then do not clear
1806 DECL_INITIAL of its associated function declaration because it's
1807 needed to emit debug info later. */
1808 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1809 DECL_INITIAL (decl
) = error_mark_node
;
1810 release_function_body (decl
);
1813 lto_free_function_in_decl_state_for_node (this);
1814 lto_file_data
= NULL
;
1818 /* Remove function from symbol table. */
1821 cgraph_node::remove (void)
1824 int uid
= this->uid
;
1826 if (symtab
->ipa_clones_dump_file
&& symtab
->cloned_nodes
.contains (this))
1827 fprintf (symtab
->ipa_clones_dump_file
,
1828 "Callgraph removal;%s;%d;%s;%d;%d\n", asm_name (), order
,
1829 DECL_SOURCE_FILE (decl
), DECL_SOURCE_LINE (decl
),
1830 DECL_SOURCE_COLUMN (decl
));
1832 symtab
->call_cgraph_removal_hooks (this);
1835 ipa_transforms_to_apply
.release ();
1837 /* Incremental inlining access removed nodes stored in the postorder list.
1839 force_output
= false;
1840 forced_by_abi
= false;
1841 for (n
= nested
; n
; n
= n
->next_nested
)
1846 cgraph_node
**node2
= &origin
->nested
;
1848 while (*node2
!= this)
1849 node2
= &(*node2
)->next_nested
;
1850 *node2
= next_nested
;
1853 if (prev_sibling_clone
)
1854 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1856 clone_of
->clones
= next_sibling_clone
;
1857 if (next_sibling_clone
)
1858 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1861 cgraph_node
*n
, *next
;
1865 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1866 n
->clone_of
= clone_of
;
1867 n
->clone_of
= clone_of
;
1868 n
->next_sibling_clone
= clone_of
->clones
;
1869 if (clone_of
->clones
)
1870 clone_of
->clones
->prev_sibling_clone
= n
;
1871 clone_of
->clones
= clones
;
1875 /* We are removing node with clones. This makes clones inconsistent,
1876 but assume they will be removed subsequently and just keep clone
1877 tree intact. This can happen in unreachable function removal since
1878 we remove unreachable functions in random order, not by bottom-up
1879 walk of clone trees. */
1880 for (n
= clones
; n
; n
= next
)
1882 next
= n
->next_sibling_clone
;
1883 n
->next_sibling_clone
= NULL
;
1884 n
->prev_sibling_clone
= NULL
;
1890 /* While all the clones are removed after being proceeded, the function
1891 itself is kept in the cgraph even after it is compiled. Check whether
1892 we are done with this body and reclaim it proactively if this is the case.
1894 if (symtab
->state
!= LTO_STREAMING
)
1896 n
= cgraph_node::get (decl
);
1898 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1899 && ((symtab
->global_info_ready
|| in_lto_p
)
1900 && (TREE_ASM_WRITTEN (n
->decl
)
1901 || DECL_EXTERNAL (n
->decl
)
1903 || (!flag_wpa
&& n
->in_other_partition
)))))
1908 lto_free_function_in_decl_state_for_node (this);
1909 lto_file_data
= NULL
;
1915 call_site_hash
->empty ();
1916 call_site_hash
= NULL
;
1919 if (instrumented_version
)
1921 instrumented_version
->instrumented_version
= NULL
;
1922 instrumented_version
= NULL
;
1925 symtab
->release_symbol (this, uid
);
1928 /* Likewise indicate that a node is having address taken. */
1931 cgraph_node::mark_address_taken (void)
1933 /* Indirect inlining can figure out that all uses of the address are
1935 if (global
.inlined_to
)
1937 gcc_assert (cfun
->after_inlining
);
1938 gcc_assert (callers
->indirect_inlining_edge
);
1941 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1942 IPA_REF_ADDR reference exists (and thus it should be set on node
1943 representing alias we take address of) and as a test whether address
1944 of the object was taken (and thus it should be set on node alias is
1945 referring to). We should remove the first use and the remove the
1948 cgraph_node
*node
= ultimate_alias_target ();
1949 node
->address_taken
= 1;
1952 /* Return local info for the compiled function. */
1955 cgraph_node::local_info (tree decl
)
1957 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1958 cgraph_node
*node
= get (decl
);
1961 return &node
->ultimate_alias_target ()->local
;
1964 /* Return local info for the compiled function. */
1967 cgraph_node::rtl_info (tree decl
)
1969 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1970 cgraph_node
*node
= get (decl
);
1973 enum availability avail
;
1974 node
= node
->ultimate_alias_target (&avail
);
1975 if (decl
!= current_function_decl
1976 && (avail
< AVAIL_AVAILABLE
1977 || (node
->decl
!= current_function_decl
1978 && !TREE_ASM_WRITTEN (node
->decl
))))
1980 /* Allocate if it doesn't exist. */
1981 if (node
->rtl
== NULL
)
1982 node
->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1986 /* Return a string describing the failure REASON. */
1989 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1992 #define DEFCIFCODE(code, type, string) string,
1994 static const char *cif_string_table
[CIF_N_REASONS
] = {
1995 #include "cif-code.def"
1998 /* Signedness of an enum type is implementation defined, so cast it
1999 to unsigned before testing. */
2000 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
2001 return cif_string_table
[reason
];
2004 /* Return a type describing the failure REASON. */
2006 cgraph_inline_failed_type_t
2007 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
2010 #define DEFCIFCODE(code, type, string) type,
2012 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
2013 #include "cif-code.def"
2016 /* Signedness of an enum type is implementation defined, so cast it
2017 to unsigned before testing. */
2018 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
2019 return cif_type_table
[reason
];
2022 /* Names used to print out the availability enum. */
2023 const char * const cgraph_availability_names
[] =
2024 {"unset", "not_available", "overwritable", "available", "local"};
2026 /* Output flags of edge to a file F. */
2029 cgraph_edge::dump_edge_flags (FILE *f
)
2032 fprintf (f
, "(speculative) ");
2034 fprintf (f
, "(inlined) ");
2035 if (call_stmt_cannot_inline_p
)
2036 fprintf (f
, "(call_stmt_cannot_inline_p) ");
2037 if (indirect_inlining_edge
)
2038 fprintf (f
, "(indirect_inlining) ");
2039 if (count
.initialized_p ())
2046 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
2047 if (can_throw_external
)
2048 fprintf (f
, "(can throw external) ");
2051 /* Dump call graph node to file F. */
2054 cgraph_node::dump (FILE *f
)
2060 if (global
.inlined_to
)
2061 fprintf (f
, " Function %s is inline copy in %s\n",
2063 global
.inlined_to
->dump_name ());
2065 fprintf (f
, " Clone of %s\n", clone_of
->dump_asm_name ());
2066 if (symtab
->function_flags_ready
)
2067 fprintf (f
, " Availability: %s\n",
2068 cgraph_availability_names
[get_availability ()]);
2071 fprintf (f
, " Profile id: %i\n",
2073 fprintf (f
, " First run: %i\n", tp_first_run
);
2074 cgraph_function_version_info
*vi
= function_version ();
2077 fprintf (f
, " Version info: ");
2078 if (vi
->prev
!= NULL
)
2080 fprintf (f
, "prev: ");
2081 fprintf (f
, "%s ", vi
->prev
->this_node
->dump_asm_name ());
2083 if (vi
->next
!= NULL
)
2085 fprintf (f
, "next: ");
2086 fprintf (f
, "%s ", vi
->next
->this_node
->dump_asm_name ());
2088 if (vi
->dispatcher_resolver
!= NULL_TREE
)
2089 fprintf (f
, "dispatcher: %s",
2090 lang_hooks
.decl_printable_name (vi
->dispatcher_resolver
, 2));
2094 fprintf (f
, " Function flags:");
2095 if (count
.initialized_p ())
2097 fprintf (f
, " profile_count ");
2101 fprintf (f
, " nested in: %s", origin
->asm_name ());
2102 if (gimple_has_body_p (decl
))
2103 fprintf (f
, " body");
2105 fprintf (f
, " process");
2107 fprintf (f
, " local");
2108 if (local
.redefined_extern_inline
)
2109 fprintf (f
, " redefined_extern_inline");
2110 if (only_called_at_startup
)
2111 fprintf (f
, " only_called_at_startup");
2112 if (only_called_at_exit
)
2113 fprintf (f
, " only_called_at_exit");
2115 fprintf (f
, " tm_clone");
2116 if (calls_comdat_local
)
2117 fprintf (f
, " calls_comdat_local");
2119 fprintf (f
, " icf_merged");
2121 fprintf (f
, " merged_comdat");
2123 fprintf (f
, " split_part");
2124 if (indirect_call_target
)
2125 fprintf (f
, " indirect_call_target");
2127 fprintf (f
, " nonfreeing_fn");
2128 if (DECL_STATIC_CONSTRUCTOR (decl
))
2129 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2130 if (DECL_STATIC_DESTRUCTOR (decl
))
2131 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2132 if (frequency
== NODE_FREQUENCY_HOT
)
2133 fprintf (f
, " hot");
2134 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2135 fprintf (f
, " unlikely_executed");
2136 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2137 fprintf (f
, " executed_once");
2138 if (only_called_at_startup
)
2139 fprintf (f
, " only_called_at_startup");
2140 if (only_called_at_exit
)
2141 fprintf (f
, " only_called_at_exit");
2142 if (opt_for_fn (decl
, optimize_size
))
2143 fprintf (f
, " optimize_size");
2144 if (parallelized_function
)
2145 fprintf (f
, " parallelized_function");
2151 fprintf (f
, " Thunk");
2153 fprintf (f
, " of %s (asm: %s)",
2154 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2155 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2156 fprintf (f
, " fixed offset %i virtual value %i has "
2157 "virtual offset %i)\n",
2158 (int)thunk
.fixed_offset
,
2159 (int)thunk
.virtual_value
,
2160 (int)thunk
.virtual_offset_p
);
2162 if (alias
&& thunk
.alias
2163 && DECL_P (thunk
.alias
))
2165 fprintf (f
, " Alias of %s",
2166 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2167 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2168 fprintf (f
, " (asm: %s)",
2169 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2173 fprintf (f
, " Called by: ");
2175 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2177 fprintf (f
, "%s ", edge
->caller
->dump_name ());
2178 edge
->dump_edge_flags (f
);
2181 fprintf (f
, "\n Calls: ");
2182 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2184 fprintf (f
, "%s ", edge
->callee
->dump_name ());
2185 edge
->dump_edge_flags (f
);
2189 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2191 if (edge
->indirect_info
->polymorphic
)
2193 fprintf (f
, " Polymorphic indirect call of type ");
2194 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2195 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2198 fprintf (f
, " Indirect call");
2199 edge
->dump_edge_flags (f
);
2200 if (edge
->indirect_info
->param_index
!= -1)
2202 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2203 if (edge
->indirect_info
->agg_contents
)
2204 fprintf (f
, " loaded from %s %s at offset %i",
2205 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2206 edge
->indirect_info
->by_ref
? "passed by reference":"",
2207 (int)edge
->indirect_info
->offset
);
2208 if (edge
->indirect_info
->vptr_changed
)
2209 fprintf (f
, " (vptr maybe changed)");
2212 if (edge
->indirect_info
->polymorphic
)
2213 edge
->indirect_info
->context
.dump (f
);
2216 if (instrumentation_clone
)
2217 fprintf (f
, " Is instrumented version.\n");
2218 else if (instrumented_version
)
2219 fprintf (f
, " Has instrumented version.\n");
2222 /* Dump call graph node NODE to stderr. */
2225 cgraph_node::debug (void)
2230 /* Dump the callgraph to file F. */
2233 cgraph_node::dump_cgraph (FILE *f
)
2237 fprintf (f
, "callgraph:\n\n");
2238 FOR_EACH_FUNCTION (node
)
2242 /* Return true when the DECL can possibly be inlined. */
2245 cgraph_function_possibly_inlined_p (tree decl
)
2247 if (!symtab
->global_info_ready
)
2248 return !DECL_UNINLINABLE (decl
);
2249 return DECL_POSSIBLY_INLINED (decl
);
2252 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2254 cgraph_node::unnest (void)
2256 cgraph_node
**node2
= &origin
->nested
;
2257 gcc_assert (origin
);
2259 while (*node2
!= this)
2260 node2
= &(*node2
)->next_nested
;
2261 *node2
= next_nested
;
2265 /* Return function availability. See cgraph.h for description of individual
2268 cgraph_node::get_availability (symtab_node
*ref
)
2272 cgraph_node
*cref
= dyn_cast
<cgraph_node
*> (ref
);
2274 ref
= cref
->global
.inlined_to
;
2276 enum availability avail
;
2278 avail
= AVAIL_NOT_AVAILABLE
;
2279 else if (local
.local
)
2280 avail
= AVAIL_LOCAL
;
2281 else if (global
.inlined_to
)
2282 avail
= AVAIL_AVAILABLE
;
2283 else if (transparent_alias
)
2284 ultimate_alias_target (&avail
, ref
);
2285 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2286 avail
= AVAIL_INTERPOSABLE
;
2287 else if (!externally_visible
)
2288 avail
= AVAIL_AVAILABLE
;
2289 /* If this is a reference from symbol itself and there are no aliases, we
2290 may be sure that the symbol was not interposed by something else because
2291 the symbol itself would be unreachable otherwise.
2293 Also comdat groups are always resolved in groups. */
2294 else if ((this == ref
&& !has_aliases_p ())
2295 || (ref
&& get_comdat_group ()
2296 && get_comdat_group () == ref
->get_comdat_group ()))
2297 avail
= AVAIL_AVAILABLE
;
2298 /* Inline functions are safe to be analyzed even if their symbol can
2299 be overwritten at runtime. It is not meaningful to enforce any sane
2300 behavior on replacing inline function by different body. */
2301 else if (DECL_DECLARED_INLINE_P (decl
))
2302 avail
= AVAIL_AVAILABLE
;
2304 /* If the function can be overwritten, return OVERWRITABLE. Take
2305 care at least of two notable extensions - the COMDAT functions
2306 used to share template instantiations in C++ (this is symmetric
2307 to code cp_cannot_inline_tree_fn and probably shall be shared and
2308 the inlinability hooks completely eliminated). */
2310 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2311 avail
= AVAIL_INTERPOSABLE
;
2312 else avail
= AVAIL_AVAILABLE
;
2317 /* Worker for cgraph_node_can_be_local_p. */
2319 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2321 return !(!node
->force_output
2322 && ((DECL_COMDAT (node
->decl
)
2323 && !node
->forced_by_abi
2324 && !node
->used_from_object_file_p ()
2325 && !node
->same_comdat_group
)
2326 || !node
->externally_visible
));
2329 /* Return true if cgraph_node can be made local for API change.
2330 Extern inline functions and C++ COMDAT functions can be made local
2331 at the expense of possible code size growth if function is used in multiple
2332 compilation units. */
2334 cgraph_node::can_be_local_p (void)
2336 return (!address_taken
2337 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2341 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2342 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
2343 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2346 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2347 (cgraph_node
*, void *),
2349 bool include_overwritable
,
2350 bool exclude_virtual_thunks
)
2354 enum availability avail
= AVAIL_AVAILABLE
;
2356 if (include_overwritable
2357 || (avail
= get_availability ()) > AVAIL_INTERPOSABLE
)
2359 if (callback (this, data
))
2362 FOR_EACH_ALIAS (this, ref
)
2364 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2365 if (include_overwritable
2366 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2367 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2368 include_overwritable
,
2369 exclude_virtual_thunks
))
2372 if (avail
<= AVAIL_INTERPOSABLE
)
2374 for (e
= callers
; e
; e
= e
->next_caller
)
2375 if (e
->caller
->thunk
.thunk_p
2376 && (include_overwritable
2377 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2378 && !(exclude_virtual_thunks
2379 && e
->caller
->thunk
.virtual_offset_p
))
2380 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2381 include_overwritable
,
2382 exclude_virtual_thunks
))
2388 /* Worker to bring NODE local. */
2391 cgraph_node::make_local (cgraph_node
*node
, void *)
2393 gcc_checking_assert (node
->can_be_local_p ());
2394 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2396 node
->make_decl_local ();
2397 node
->set_section (NULL
);
2398 node
->set_comdat_group (NULL
);
2399 node
->externally_visible
= false;
2400 node
->forced_by_abi
= false;
2401 node
->local
.local
= true;
2402 node
->set_section (NULL
);
2403 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2404 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2405 && !flag_incremental_link
);
2406 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2407 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2412 /* Bring cgraph node local. */
2415 cgraph_node::make_local (void)
2417 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2420 /* Worker to set nothrow flag. */
2423 set_nothrow_flag_1 (cgraph_node
*node
, bool nothrow
, bool non_call
,
2428 if (nothrow
&& !TREE_NOTHROW (node
->decl
))
2430 /* With non-call exceptions we can't say for sure if other function body
2431 was not possibly optimized to stil throw. */
2432 if (!non_call
|| node
->binds_to_current_def_p ())
2434 TREE_NOTHROW (node
->decl
) = true;
2436 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2437 e
->can_throw_external
= false;
2440 else if (!nothrow
&& TREE_NOTHROW (node
->decl
))
2442 TREE_NOTHROW (node
->decl
) = false;
2446 FOR_EACH_ALIAS (node
, ref
)
2448 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2449 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2450 set_nothrow_flag_1 (alias
, nothrow
, non_call
, changed
);
2452 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2453 if (e
->caller
->thunk
.thunk_p
2454 && (!nothrow
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2455 set_nothrow_flag_1 (e
->caller
, nothrow
, non_call
, changed
);
2458 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2459 if any to NOTHROW. */
2462 cgraph_node::set_nothrow_flag (bool nothrow
)
2464 bool changed
= false;
2465 bool non_call
= opt_for_fn (decl
, flag_non_call_exceptions
);
2467 if (!nothrow
|| get_availability () > AVAIL_INTERPOSABLE
)
2468 set_nothrow_flag_1 (this, nothrow
, non_call
, &changed
);
2473 FOR_EACH_ALIAS (this, ref
)
2475 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2476 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2477 set_nothrow_flag_1 (alias
, nothrow
, non_call
, &changed
);
2483 /* Worker to set_const_flag. */
2486 set_const_flag_1 (cgraph_node
*node
, bool set_const
, bool looping
,
2489 /* Static constructors and destructors without a side effect can be
2491 if (set_const
&& !looping
)
2493 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2495 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2498 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2500 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2506 if (TREE_READONLY (node
->decl
))
2508 TREE_READONLY (node
->decl
) = 0;
2509 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2515 /* Consider function:
2522 During early optimization we will turn this into:
2529 Now if this function will be detected as CONST however when interposed
2530 it may end up being just pure. We always must assume the worst
2532 if (TREE_READONLY (node
->decl
))
2534 if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2536 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2540 else if (node
->binds_to_current_def_p ())
2542 TREE_READONLY (node
->decl
) = true;
2543 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2544 DECL_PURE_P (node
->decl
) = false;
2549 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2550 fprintf (dump_file
, "Dropping state to PURE because function does "
2551 "not bind to current def.\n");
2552 if (!DECL_PURE_P (node
->decl
))
2554 DECL_PURE_P (node
->decl
) = true;
2555 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2558 else if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2560 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2567 FOR_EACH_ALIAS (node
, ref
)
2569 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2570 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2571 set_const_flag_1 (alias
, set_const
, looping
, changed
);
2573 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2574 if (e
->caller
->thunk
.thunk_p
2575 && (!set_const
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2577 /* Virtual thunks access virtual offset in the vtable, so they can
2578 only be pure, never const. */
2580 && (e
->caller
->thunk
.virtual_offset_p
2581 || !node
->binds_to_current_def_p (e
->caller
)))
2582 *changed
|= e
->caller
->set_pure_flag (true, looping
);
2584 set_const_flag_1 (e
->caller
, set_const
, looping
, changed
);
2588 /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
2589 If SET_CONST if false, clear the flag.
2591 When setting the flag be careful about possible interposition and
2592 do not set the flag for functions that can be interposet and set pure
2593 flag for functions that can bind to other definition.
2595 Return true if any change was done. */
2598 cgraph_node::set_const_flag (bool set_const
, bool looping
)
2600 bool changed
= false;
2601 if (!set_const
|| get_availability () > AVAIL_INTERPOSABLE
)
2602 set_const_flag_1 (this, set_const
, looping
, &changed
);
2607 FOR_EACH_ALIAS (this, ref
)
2609 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2610 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2611 set_const_flag_1 (alias
, set_const
, looping
, &changed
);
2617 /* Info used by set_pure_flag_1. */
2619 struct set_pure_flag_info
2626 /* Worker to set_pure_flag. */
2629 set_pure_flag_1 (cgraph_node
*node
, void *data
)
2631 struct set_pure_flag_info
*info
= (struct set_pure_flag_info
*)data
;
2632 /* Static constructors and destructors without a side effect can be
2634 if (info
->pure
&& !info
->looping
)
2636 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2638 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2639 info
->changed
= true;
2641 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2643 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2644 info
->changed
= true;
2649 if (!DECL_PURE_P (node
->decl
) && !TREE_READONLY (node
->decl
))
2651 DECL_PURE_P (node
->decl
) = true;
2652 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = info
->looping
;
2653 info
->changed
= true;
2655 else if (DECL_LOOPING_CONST_OR_PURE_P (node
->decl
)
2658 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2659 info
->changed
= true;
2664 if (DECL_PURE_P (node
->decl
))
2666 DECL_PURE_P (node
->decl
) = false;
2667 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2668 info
->changed
= true;
2674 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2677 When setting the flag, be careful about possible interposition.
2678 Return true if any change was done. */
2681 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2683 struct set_pure_flag_info info
= {pure
, looping
, false};
2686 call_for_symbol_thunks_and_aliases (set_pure_flag_1
, &info
, !pure
, true);
2687 return info
.changed
;
2690 /* Return true when cgraph_node can not return or throw and thus
2691 it is safe to ignore its side effects for IPA analysis. */
2694 cgraph_node::cannot_return_p (void)
2696 int flags
= flags_from_decl_or_type (decl
);
2697 if (!opt_for_fn (decl
, flag_exceptions
))
2698 return (flags
& ECF_NORETURN
) != 0;
2700 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2701 == (ECF_NORETURN
| ECF_NOTHROW
));
2704 /* Return true when call of edge can not lead to return from caller
2705 and thus it is safe to ignore its side effects for IPA analysis
2706 when computing side effects of the caller.
2707 FIXME: We could actually mark all edges that have no reaching
2708 patch to the exit block or throw to get better results. */
2710 cgraph_edge::cannot_lead_to_return_p (void)
2712 if (caller
->cannot_return_p ())
2714 if (indirect_unknown_callee
)
2716 int flags
= indirect_info
->ecf_flags
;
2717 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2718 return (flags
& ECF_NORETURN
) != 0;
2720 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2721 == (ECF_NORETURN
| ECF_NOTHROW
));
2724 return callee
->cannot_return_p ();
2727 /* Return true if the call can be hot. */
2730 cgraph_edge::maybe_hot_p (void)
2732 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2734 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2735 && !maybe_hot_count_p (NULL
, count
))
2737 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2739 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2741 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2743 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2745 if (opt_for_fn (caller
->decl
, optimize_size
))
2747 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2749 /* If profile is now known yet, be conservative.
2750 FIXME: this predicate is used by early inliner and can do better there. */
2751 if (symtab
->state
< IPA_SSA
)
2753 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2754 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2756 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2758 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2759 || frequency
<= (CGRAPH_FREQ_BASE
2760 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2766 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2769 nonremovable_p (cgraph_node
*node
, void *)
2771 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2774 /* Return true if whole comdat group can be removed if there are no direct
2778 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2780 struct ipa_ref
*ref
;
2782 /* For local symbols or non-comdat group it is the same as
2783 can_remove_if_no_direct_calls_p. */
2784 if (!externally_visible
|| !same_comdat_group
)
2786 if (DECL_EXTERNAL (decl
))
2790 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2793 if (will_inline
&& address_taken
)
2796 /* Otheriwse check if we can remove the symbol itself and then verify
2797 that only uses of the comdat groups are direct call to THIS
2799 if (!can_remove_if_no_direct_calls_and_refs_p ())
2802 /* Check that all refs come from within the comdat group. */
2803 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2804 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2807 struct cgraph_node
*target
= ultimate_alias_target ();
2808 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2809 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2811 if (!externally_visible
)
2814 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2817 /* If we see different symbol than THIS, be sure to check calls. */
2818 if (next
->ultimate_alias_target () != target
)
2819 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2820 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2824 /* If function is not being inlined, we care only about
2825 references outside of the comdat group. */
2827 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2828 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2834 /* Return true when function cgraph_node can be expected to be removed
2835 from program when direct calls in this compilation unit are removed.
2837 As a special case COMDAT functions are
2838 cgraph_can_remove_if_no_direct_calls_p while the are not
2839 cgraph_only_called_directly_p (it is possible they are called from other
2842 This function behaves as cgraph_only_called_directly_p because eliminating
2843 all uses of COMDAT function does not make it necessarily disappear from
2844 the program unless we are compiling whole program or we do LTO. In this
2845 case we know we win since dynamic linking will not really discard the
2846 linkonce section. */
2849 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2852 gcc_assert (!global
.inlined_to
);
2853 if (DECL_EXTERNAL (decl
))
2856 if (!in_lto_p
&& !flag_whole_program
)
2858 /* If the symbol is in comdat group, we need to verify that whole comdat
2859 group becomes unreachable. Technically we could skip references from
2860 within the group, too. */
2861 if (!only_called_directly_p ())
2863 if (same_comdat_group
&& externally_visible
)
2865 struct cgraph_node
*target
= ultimate_alias_target ();
2867 if (will_inline
&& address_taken
)
2869 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2871 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2873 if (!externally_visible
)
2876 && !next
->only_called_directly_p ())
2879 /* If we see different symbol than THIS,
2880 be sure to check calls. */
2881 if (next
->ultimate_alias_target () != target
)
2882 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2883 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2891 return can_remove_if_no_direct_calls_p (will_inline
);
2895 /* Worker for cgraph_only_called_directly_p. */
2898 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2900 return !node
->only_called_directly_or_aliased_p ();
2903 /* Return true when function cgraph_node and all its aliases are only called
2905 i.e. it is not externally visible, address was not taken and
2906 it is not used in any other non-standard way. */
2909 cgraph_node::only_called_directly_p (void)
2911 gcc_assert (ultimate_alias_target () == this);
2912 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2917 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2920 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2922 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2924 enum availability avail
;
2925 node
->ultimate_alias_target (&avail
);
2927 if (avail
> AVAIL_INTERPOSABLE
)
2928 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2929 if (!cs
->indirect_inlining_edge
2930 && !cs
->caller
->thunk
.thunk_p
)
2931 redirect_callers
->safe_push (cs
);
2935 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2936 cgraph_node (i.e. are not overwritable). */
2939 cgraph_node::collect_callers (void)
2941 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2942 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2943 &redirect_callers
, false);
2944 return redirect_callers
;
2947 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2950 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2952 bool skipped_thunk
= false;
2953 node
= node
->ultimate_alias_target ();
2954 node2
= node2
->ultimate_alias_target ();
2956 /* There are no virtual clones of thunks so check former_clone_of or if we
2957 might have skipped thunks because this adjustments are no longer
2959 while (node
->thunk
.thunk_p
)
2961 if (node2
->former_clone_of
== node
->decl
)
2963 if (!node
->thunk
.this_adjusting
)
2965 node
= node
->callees
->callee
->ultimate_alias_target ();
2966 skipped_thunk
= true;
2971 if (!node2
->clone
.args_to_skip
2972 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2974 if (node2
->former_clone_of
== node
->decl
)
2976 else if (!node2
->clone_of
)
2980 while (node
!= node2
&& node2
)
2981 node2
= node2
->clone_of
;
2982 return node2
!= NULL
;
2985 /* Verify edge count and frequency. */
2988 cgraph_edge::verify_count_and_frequency ()
2990 bool error_found
= false;
2993 error ("caller edge count is negative");
2998 error ("caller edge frequency is negative");
3001 if (frequency
> CGRAPH_FREQ_MAX
)
3003 error ("caller edge frequency is too large");
3009 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
3011 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
3013 bool fndecl_was_null
= false;
3014 /* debug_gimple_stmt needs correct cfun */
3015 if (cfun
!= this_cfun
)
3016 set_cfun (this_cfun
);
3017 /* ...and an actual current_function_decl */
3018 if (!current_function_decl
)
3020 current_function_decl
= this_cfun
->decl
;
3021 fndecl_was_null
= true;
3023 debug_gimple_stmt (stmt
);
3024 if (fndecl_was_null
)
3025 current_function_decl
= NULL
;
3028 /* Verify that call graph edge corresponds to DECL from the associated
3029 statement. Return true if the verification should fail. */
3032 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
3036 if (!decl
|| callee
->global
.inlined_to
)
3038 if (symtab
->state
== LTO_STREAMING
)
3040 node
= cgraph_node::get (decl
);
3042 /* We do not know if a node from a different partition is an alias or what it
3043 aliases and therefore cannot do the former_clone_of check reliably. When
3044 body_removed is set, we have lost all information about what was alias or
3045 thunk of and also cannot proceed. */
3047 || node
->body_removed
3048 || node
->in_other_partition
3049 || callee
->icf_merged
3050 || callee
->in_other_partition
)
3053 node
= node
->ultimate_alias_target ();
3055 /* Optimizers can redirect unreachable calls or calls triggering undefined
3056 behavior to builtin_unreachable. */
3057 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
3058 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
3061 if (callee
->former_clone_of
!= node
->decl
3062 && (node
!= callee
->ultimate_alias_target ())
3063 && !clone_of_p (node
, callee
))
3069 /* Verify cgraph nodes of given cgraph node. */
3071 cgraph_node::verify_node (void)
3074 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
3075 basic_block this_block
;
3076 gimple_stmt_iterator gsi
;
3077 bool error_found
= false;
3082 timevar_push (TV_CGRAPH_VERIFY
);
3083 error_found
|= verify_base ();
3084 for (e
= callees
; e
; e
= e
->next_callee
)
3087 error ("aux field set for edge %s->%s",
3088 identifier_to_locale (e
->caller
->name ()),
3089 identifier_to_locale (e
->callee
->name ()));
3094 error ("execution count is negative");
3097 if (global
.inlined_to
&& same_comdat_group
)
3099 error ("inline clone in same comdat group list");
3102 if (!definition
&& !in_other_partition
&& local
.local
)
3104 error ("local symbols must be defined");
3107 if (global
.inlined_to
&& externally_visible
)
3109 error ("externally visible inline clone");
3112 if (global
.inlined_to
&& address_taken
)
3114 error ("inline clone with address taken");
3117 if (global
.inlined_to
&& force_output
)
3119 error ("inline clone is forced to output");
3122 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3126 error ("aux field set for indirect edge from %s",
3127 identifier_to_locale (e
->caller
->name ()));
3130 if (!e
->indirect_unknown_callee
3131 || !e
->indirect_info
)
3133 error ("An indirect edge from %s is not marked as indirect or has "
3134 "associated indirect_info, the corresponding statement is: ",
3135 identifier_to_locale (e
->caller
->name ()));
3136 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3140 bool check_comdat
= comdat_local_p ();
3141 for (e
= callers
; e
; e
= e
->next_caller
)
3143 if (e
->verify_count_and_frequency ())
3146 && !in_same_comdat_group_p (e
->caller
))
3148 error ("comdat-local function called by %s outside its comdat",
3149 identifier_to_locale (e
->caller
->name ()));
3152 if (!e
->inline_failed
)
3154 if (global
.inlined_to
3155 != (e
->caller
->global
.inlined_to
3156 ? e
->caller
->global
.inlined_to
: e
->caller
))
3158 error ("inlined_to pointer is wrong");
3161 if (callers
->next_caller
)
3163 error ("multiple inline callers");
3168 if (global
.inlined_to
)
3170 error ("inlined_to pointer set for noninline callers");
3174 for (e
= callees
; e
; e
= e
->next_callee
)
3176 if (e
->verify_count_and_frequency ())
3178 if (gimple_has_body_p (e
->caller
->decl
)
3179 && !e
->caller
->global
.inlined_to
3181 /* Optimized out calls are redirected to __builtin_unreachable. */
3183 || ! e
->callee
->decl
3184 || DECL_BUILT_IN_CLASS (e
->callee
->decl
) != BUILT_IN_NORMAL
3185 || DECL_FUNCTION_CODE (e
->callee
->decl
) != BUILT_IN_UNREACHABLE
)
3187 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3188 gimple_bb (e
->call_stmt
))))
3190 error ("caller edge frequency %i does not match BB frequency %i",
3192 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3193 gimple_bb (e
->call_stmt
)));
3197 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3199 if (e
->verify_count_and_frequency ())
3201 if (gimple_has_body_p (e
->caller
->decl
)
3202 && !e
->caller
->global
.inlined_to
3205 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3206 gimple_bb (e
->call_stmt
))))
3208 error ("indirect call frequency %i does not match BB frequency %i",
3210 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3211 gimple_bb (e
->call_stmt
)));
3215 if (!callers
&& global
.inlined_to
)
3217 error ("inlined_to pointer is set but no predecessors found");
3220 if (global
.inlined_to
== this)
3222 error ("inlined_to pointer refers to itself");
3229 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
3234 error ("cgraph_node has wrong clone_of");
3241 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
3242 if (n
->clone_of
!= this)
3246 error ("cgraph_node has wrong clone list");
3250 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
3252 error ("cgraph_node is in clone list but it is not clone");
3255 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
3257 error ("cgraph_node has wrong prev_clone pointer");
3260 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
3262 error ("double linked list of clones corrupted");
3266 if (analyzed
&& alias
)
3268 bool ref_found
= false;
3270 ipa_ref
*ref
= NULL
;
3274 error ("Alias has call edges");
3277 for (i
= 0; iterate_reference (i
, ref
); i
++)
3278 if (ref
->use
== IPA_REF_CHKP
)
3280 else if (ref
->use
!= IPA_REF_ALIAS
)
3282 error ("Alias has non-alias reference");
3287 error ("Alias has more than one alias reference");
3294 error ("Analyzed alias has no reference");
3299 /* Check instrumented version reference. */
3300 if (instrumented_version
3301 && instrumented_version
->instrumented_version
!= this)
3303 error ("Instrumentation clone does not reference original node");
3307 /* Cannot have orig_decl for not instrumented nodes. */
3308 if (!instrumentation_clone
&& orig_decl
)
3310 error ("Not instrumented node has non-NULL original declaration");
3314 /* If original not instrumented node still exists then we may check
3315 original declaration is set properly. */
3316 if (instrumented_version
3318 && orig_decl
!= instrumented_version
->decl
)
3320 error ("Instrumented node has wrong original declaration");
3324 /* Check all nodes have chkp reference to their instrumented versions. */
3326 && instrumented_version
3327 && !instrumentation_clone
)
3329 bool ref_found
= false;
3331 struct ipa_ref
*ref
;
3333 for (i
= 0; iterate_reference (i
, ref
); i
++)
3334 if (ref
->use
== IPA_REF_CHKP
)
3338 error ("Node has more than one chkp reference");
3341 if (ref
->referred
!= instrumented_version
)
3343 error ("Wrong node is referenced with chkp reference");
3351 error ("Analyzed node has no reference to instrumented version");
3356 if (instrumentation_clone
3357 && DECL_BUILT_IN_CLASS (decl
) == NOT_BUILT_IN
)
3359 tree name
= DECL_ASSEMBLER_NAME (decl
);
3360 tree orig_name
= DECL_ASSEMBLER_NAME (orig_decl
);
3362 if (!IDENTIFIER_TRANSPARENT_ALIAS (name
)
3363 || TREE_CHAIN (name
) != orig_name
)
3365 error ("Alias chain for instrumented node is broken");
3370 if (analyzed
&& thunk
.thunk_p
)
3374 error ("No edge out of thunk node");
3377 else if (callees
->next_callee
)
3379 error ("More than one edge out of thunk node");
3382 if (gimple_has_body_p (decl
) && !global
.inlined_to
)
3384 error ("Thunk is not supposed to have body");
3387 if (thunk
.add_pointer_bounds_args
3388 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3390 error ("Instrumentation thunk has wrong edge callee");
3394 else if (analyzed
&& gimple_has_body_p (decl
)
3395 && !TREE_ASM_WRITTEN (decl
)
3396 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3401 hash_set
<gimple
*> stmts
;
3403 ipa_ref
*ref
= NULL
;
3405 /* Reach the trees by walking over the CFG, and note the
3406 enclosing basic-blocks in the call edges. */
3407 FOR_EACH_BB_FN (this_block
, this_cfun
)
3409 for (gsi
= gsi_start_phis (this_block
);
3410 !gsi_end_p (gsi
); gsi_next (&gsi
))
3411 stmts
.add (gsi_stmt (gsi
));
3412 for (gsi
= gsi_start_bb (this_block
);
3416 gimple
*stmt
= gsi_stmt (gsi
);
3418 if (is_gimple_call (stmt
))
3420 cgraph_edge
*e
= get_edge (stmt
);
3421 tree decl
= gimple_call_fndecl (stmt
);
3426 error ("shared call_stmt:");
3427 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3430 if (!e
->indirect_unknown_callee
)
3432 if (e
->verify_corresponds_to_fndecl (decl
))
3434 error ("edge points to wrong declaration:");
3435 debug_tree (e
->callee
->decl
);
3436 fprintf (stderr
," Instead of:");
3443 error ("an indirect edge with unknown callee "
3444 "corresponding to a call_stmt with "
3445 "a known declaration:");
3447 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3453 error ("missing callgraph edge for call stmt:");
3454 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3460 for (i
= 0; iterate_reference (i
, ref
); i
++)
3461 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3463 error ("reference to dead statement");
3464 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3469 /* No CFG available?! */
3472 for (e
= callees
; e
; e
= e
->next_callee
)
3476 error ("edge %s->%s has no corresponding call_stmt",
3477 identifier_to_locale (e
->caller
->name ()),
3478 identifier_to_locale (e
->callee
->name ()));
3479 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3484 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3486 if (!e
->aux
&& !e
->speculative
)
3488 error ("an indirect edge from %s has no corresponding call_stmt",
3489 identifier_to_locale (e
->caller
->name ()));
3490 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3499 internal_error ("verify_cgraph_node failed");
3501 timevar_pop (TV_CGRAPH_VERIFY
);
3504 /* Verify whole cgraph structure. */
3506 cgraph_node::verify_cgraph_nodes (void)
3513 FOR_EACH_FUNCTION (node
)
3517 /* Walk the alias chain to return the function cgraph_node is alias of.
3518 Walk through thunks, too.
3519 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3520 When REF is non-NULL, assume that reference happens in symbol REF
3521 when determining the availability. */
3524 cgraph_node::function_symbol (enum availability
*availability
,
3525 struct symtab_node
*ref
)
3527 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3529 while (node
->thunk
.thunk_p
)
3532 node
= node
->callees
->callee
;
3535 enum availability a
;
3536 a
= node
->get_availability (ref
);
3537 if (a
< *availability
)
3540 node
= node
->ultimate_alias_target (availability
, ref
);
3545 /* Walk the alias chain to return the function cgraph_node is alias of.
3546 Walk through non virtual thunks, too. Thus we return either a function
3547 or a virtual thunk node.
3548 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3549 When REF is non-NULL, assume that reference happens in symbol REF
3550 when determining the availability. */
3553 cgraph_node::function_or_virtual_thunk_symbol
3554 (enum availability
*availability
,
3555 struct symtab_node
*ref
)
3557 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3559 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3562 node
= node
->callees
->callee
;
3565 enum availability a
;
3566 a
= node
->get_availability (ref
);
3567 if (a
< *availability
)
3570 node
= node
->ultimate_alias_target (availability
, ref
);
3575 /* When doing LTO, read cgraph_node's body from disk if it is not already
3579 cgraph_node::get_untransformed_body (void)
3581 lto_file_decl_data
*file_data
;
3582 const char *data
, *name
;
3584 tree decl
= this->decl
;
3586 /* Check if body is already there. Either we have gimple body or
3587 the function is thunk and in that case we set DECL_ARGUMENTS. */
3588 if (DECL_ARGUMENTS (decl
) || gimple_has_body_p (decl
))
3591 gcc_assert (in_lto_p
&& !DECL_RESULT (decl
));
3593 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3595 file_data
= lto_file_data
;
3596 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3598 /* We may have renamed the declaration, e.g., a static function. */
3599 name
= lto_get_decl_name_mapping (file_data
, name
);
3600 struct lto_in_decl_state
*decl_state
3601 = lto_get_function_in_decl_state (file_data
, decl
);
3603 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3604 name
, &len
, decl_state
->compressed
);
3606 fatal_error (input_location
, "%s: section %s is missing",
3607 file_data
->file_name
,
3610 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3612 lto_input_function_body (file_data
, this, data
);
3613 lto_stats
.num_function_bodies
++;
3614 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3615 data
, len
, decl_state
->compressed
);
3616 lto_free_function_in_decl_state_for_node (this);
3617 /* Keep lto file data so ipa-inline-analysis knows about cross module
3620 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3625 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3626 if it is not already present. When some IPA transformations are scheduled,
3630 cgraph_node::get_body (void)
3634 updated
= get_untransformed_body ();
3636 /* Getting transformed body makes no sense for inline clones;
3637 we should never use this on real clones because they are materialized
3639 TODO: Materializing clones here will likely lead to smaller LTRANS
3641 gcc_assert (!global
.inlined_to
&& !clone_of
);
3642 if (ipa_transforms_to_apply
.exists ())
3644 opt_pass
*saved_current_pass
= current_pass
;
3645 FILE *saved_dump_file
= dump_file
;
3646 const char *saved_dump_file_name
= dump_file_name
;
3647 dump_flags_t saved_dump_flags
= dump_flags
;
3648 dump_file_name
= NULL
;
3651 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3652 execute_all_ipa_transforms ();
3653 cgraph_edge::rebuild_edges ();
3654 free_dominance_info (CDI_DOMINATORS
);
3655 free_dominance_info (CDI_POST_DOMINATORS
);
3659 current_pass
= saved_current_pass
;
3660 dump_file
= saved_dump_file
;
3661 dump_file_name
= saved_dump_file_name
;
3662 dump_flags
= saved_dump_flags
;
3667 /* Return the DECL_STRUCT_FUNCTION of the function. */
3670 cgraph_node::get_fun (void)
3672 cgraph_node
*node
= this;
3673 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3675 while (!fun
&& node
->clone_of
)
3677 node
= node
->clone_of
;
3678 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3684 /* Verify if the type of the argument matches that of the function
3685 declaration. If we cannot verify this or there is a mismatch,
3689 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3692 unsigned int i
, nargs
;
3694 /* Calls to internal functions always match their signature. */
3695 if (gimple_call_internal_p (stmt
))
3698 nargs
= gimple_call_num_args (stmt
);
3700 /* Get argument types for verification. */
3702 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3704 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3706 /* Verify if the type of the argument matches that of the function
3707 declaration. If we cannot verify this or there is a mismatch,
3709 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3711 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3713 i
++, p
= DECL_CHAIN (p
))
3716 /* We cannot distinguish a varargs function from the case
3717 of excess parameters, still deferring the inlining decision
3718 to the callee is possible. */
3721 arg
= gimple_call_arg (stmt
, i
);
3722 if (p
== error_mark_node
3723 || DECL_ARG_TYPE (p
) == error_mark_node
3724 || arg
== error_mark_node
3725 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3726 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3729 if (args_count_match
&& p
)
3734 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3737 /* If this is a varargs function defer inlining decision
3741 arg
= gimple_call_arg (stmt
, i
);
3742 if (TREE_VALUE (p
) == error_mark_node
3743 || arg
== error_mark_node
3744 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3745 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3746 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3758 /* Verify if the type of the argument and lhs of CALL_STMT matches
3759 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3760 true, the arg count needs to be the same.
3761 If we cannot verify this or there is a mismatch, return false. */
3764 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3765 bool args_count_match
)
3769 if ((DECL_RESULT (callee
)
3770 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3771 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3772 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3774 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3775 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3780 /* Reset all state within cgraph.c so that we can rerun the compiler
3781 within the same process. For use by toplev::finalize. */
3784 cgraph_c_finalize (void)
3788 x_cgraph_nodes_queue
= NULL
;
3790 cgraph_fnver_htab
= NULL
;
3791 version_info_node
= NULL
;
3794 /* A wroker for call_for_symbol_and_aliases. */
3797 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3800 bool include_overwritable
)
3803 FOR_EACH_ALIAS (this, ref
)
3805 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3806 if (include_overwritable
3807 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3808 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3809 include_overwritable
))
3815 /* Return true if NODE has thunk. */
3818 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3820 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3821 if (e
->caller
->thunk
.thunk_p
)
3826 #include "gt-cgraph.h"