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 inter-procedural
24 optimization. It represents a multi-graph where nodes are functions
25 (symbols within symbol table) and edges are call sites. */
29 #include "coretypes.h"
36 #include "alloc-pool.h"
37 #include "gimple-ssa.h"
39 #include "lto-streamer.h"
40 #include "fold-const.h"
43 #include "print-tree.h"
44 #include "langhooks.h"
47 #include "gimple-iterator.h"
50 #include "value-prof.h"
51 #include "ipa-utils.h"
52 #include "symbol-summary.h"
55 #include "ipa-fnsummary.h"
57 #include "gimple-pretty-print.h"
61 #include "tree-chkp.h"
64 #include "stringpool.h"
67 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
68 #include "tree-pass.h"
70 /* Queue of cgraph nodes scheduled to be lowered. */
71 symtab_node
*x_cgraph_nodes_queue
;
72 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
74 /* Symbol table global context. */
77 /* List of hooks triggered on cgraph_edge events. */
78 struct cgraph_edge_hook_list
{
79 cgraph_edge_hook hook
;
81 struct cgraph_edge_hook_list
*next
;
84 /* List of hooks triggered on cgraph_node events. */
85 struct cgraph_node_hook_list
{
86 cgraph_node_hook hook
;
88 struct cgraph_node_hook_list
*next
;
91 /* List of hooks triggered on events involving two cgraph_edges. */
92 struct cgraph_2edge_hook_list
{
93 cgraph_2edge_hook hook
;
95 struct cgraph_2edge_hook_list
*next
;
98 /* List of hooks triggered on events involving two cgraph_nodes. */
99 struct cgraph_2node_hook_list
{
100 cgraph_2node_hook hook
;
102 struct cgraph_2node_hook_list
*next
;
105 /* Hash descriptor for cgraph_function_version_info. */
107 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
109 static hashval_t
hash (cgraph_function_version_info
*);
110 static bool equal (cgraph_function_version_info
*,
111 cgraph_function_version_info
*);
114 /* Map a cgraph_node to cgraph_function_version_info using this htab.
115 The cgraph_function_version_info has a THIS_NODE field that is the
116 corresponding cgraph_node.. */
118 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
120 /* Hash function for cgraph_fnver_htab. */
122 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
124 int uid
= ptr
->this_node
->uid
;
125 return (hashval_t
)(uid
);
128 /* eq function for cgraph_fnver_htab. */
130 function_version_hasher::equal (cgraph_function_version_info
*n1
,
131 cgraph_function_version_info
*n2
)
133 return n1
->this_node
->uid
== n2
->this_node
->uid
;
136 /* Mark as GC root all allocated nodes. */
137 static GTY(()) struct cgraph_function_version_info
*
138 version_info_node
= NULL
;
140 /* Return true if NODE's address can be compared. */
143 symtab_node::address_can_be_compared_p ()
145 /* Address of virtual tables and functions is never compared. */
146 if (DECL_VIRTUAL_P (decl
))
148 /* Address of C++ cdtors is never compared. */
149 if (is_a
<cgraph_node
*> (this)
150 && (DECL_CXX_CONSTRUCTOR_P (decl
)
151 || DECL_CXX_DESTRUCTOR_P (decl
)))
153 /* Constant pool symbols addresses are never compared.
154 flag_merge_constants permits us to assume the same on readonly vars. */
155 if (is_a
<varpool_node
*> (this)
156 && (DECL_IN_CONSTANT_POOL (decl
)
157 || (flag_merge_constants
>= 2
158 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
163 /* Get the cgraph_function_version_info node corresponding to node. */
164 cgraph_function_version_info
*
165 cgraph_node::function_version (void)
167 cgraph_function_version_info key
;
168 key
.this_node
= this;
170 if (cgraph_fnver_htab
== NULL
)
173 return cgraph_fnver_htab
->find (&key
);
176 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
177 corresponding to cgraph_node NODE. */
178 cgraph_function_version_info
*
179 cgraph_node::insert_new_function_version (void)
181 version_info_node
= NULL
;
182 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
183 version_info_node
->this_node
= this;
185 if (cgraph_fnver_htab
== NULL
)
186 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
188 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
190 return version_info_node
;
193 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
194 DECL is a duplicate declaration. */
196 cgraph_node::delete_function_version (tree decl
)
198 cgraph_node
*decl_node
= cgraph_node::get (decl
);
199 cgraph_function_version_info
*decl_v
= NULL
;
201 if (decl_node
== NULL
)
204 decl_v
= decl_node
->function_version ();
209 if (decl_v
->prev
!= NULL
)
210 decl_v
->prev
->next
= decl_v
->next
;
212 if (decl_v
->next
!= NULL
)
213 decl_v
->next
->prev
= decl_v
->prev
;
215 if (cgraph_fnver_htab
!= NULL
)
216 cgraph_fnver_htab
->remove_elt (decl_v
);
218 decl_node
->remove ();
221 /* Record that DECL1 and DECL2 are semantically identical function
224 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
226 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
227 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
228 cgraph_function_version_info
*decl1_v
= NULL
;
229 cgraph_function_version_info
*decl2_v
= NULL
;
230 cgraph_function_version_info
*before
;
231 cgraph_function_version_info
*after
;
233 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
234 decl1_v
= decl1_node
->function_version ();
235 decl2_v
= decl2_node
->function_version ();
237 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
241 decl1_v
= decl1_node
->insert_new_function_version ();
244 decl2_v
= decl2_node
->insert_new_function_version ();
246 /* Chain decl2_v and decl1_v. All semantically identical versions
247 will be chained together. */
252 while (before
->next
!= NULL
)
253 before
= before
->next
;
255 while (after
->prev
!= NULL
)
258 before
->next
= after
;
259 after
->prev
= before
;
262 /* Initialize callgraph dump file. */
265 symbol_table::initialize (void)
268 dump_file
= dump_begin (TDI_cgraph
, NULL
);
270 if (!ipa_clones_dump_file
)
271 ipa_clones_dump_file
= dump_begin (TDI_clones
, NULL
);
274 /* Allocate new callgraph node and insert it into basic data structures. */
277 symbol_table::create_empty (void)
279 cgraph_node
*node
= allocate_cgraph_symbol ();
281 node
->type
= SYMTAB_FUNCTION
;
282 node
->frequency
= NODE_FREQUENCY_NORMAL
;
283 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
289 /* Register HOOK to be called with DATA on each removed edge. */
290 cgraph_edge_hook_list
*
291 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
293 cgraph_edge_hook_list
*entry
;
294 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
296 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
306 /* Remove ENTRY from the list of hooks called on removing edges. */
308 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
310 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
312 while (*ptr
!= entry
)
318 /* Call all edge removal hooks. */
320 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
322 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
325 entry
->hook (e
, entry
->data
);
330 /* Register HOOK to be called with DATA on each removed node. */
331 cgraph_node_hook_list
*
332 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
334 cgraph_node_hook_list
*entry
;
335 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
337 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
347 /* Remove ENTRY from the list of hooks called on removing nodes. */
349 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
351 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
353 while (*ptr
!= entry
)
359 /* Call all node removal hooks. */
361 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
363 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
366 entry
->hook (node
, entry
->data
);
371 /* Call all node removal hooks. */
373 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
375 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
378 entry
->hook (node
, entry
->data
);
384 /* Register HOOK to be called with DATA on each inserted node. */
385 cgraph_node_hook_list
*
386 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
388 cgraph_node_hook_list
*entry
;
389 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
391 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
401 /* Remove ENTRY from the list of hooks called on inserted nodes. */
403 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
405 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
407 while (*ptr
!= entry
)
413 /* Register HOOK to be called with DATA on each duplicated edge. */
414 cgraph_2edge_hook_list
*
415 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
417 cgraph_2edge_hook_list
*entry
;
418 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
420 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
430 /* Remove ENTRY from the list of hooks called on duplicating edges. */
432 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
434 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
436 while (*ptr
!= entry
)
442 /* Call all edge duplication hooks. */
444 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
446 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
449 entry
->hook (cs1
, cs2
, entry
->data
);
454 /* Register HOOK to be called with DATA on each duplicated node. */
455 cgraph_2node_hook_list
*
456 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
458 cgraph_2node_hook_list
*entry
;
459 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
461 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
471 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
473 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
475 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
477 while (*ptr
!= entry
)
483 /* Call all node duplication hooks. */
485 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
488 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
491 entry
->hook (node
, node2
, entry
->data
);
496 /* Return cgraph node assigned to DECL. Create new one when needed. */
499 cgraph_node::create (tree decl
)
501 cgraph_node
*node
= symtab
->create_empty ();
502 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
506 node
->count
= profile_count::uninitialized ();
508 if ((flag_openacc
|| flag_openmp
)
509 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
511 node
->offloadable
= 1;
512 if (ENABLE_OFFLOADING
)
513 g
->have_offload
= true;
516 node
->register_symbol ();
518 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
520 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
521 node
->next_nested
= node
->origin
->nested
;
522 node
->origin
->nested
= node
;
527 /* Try to find a call graph node for declaration DECL and if it does not exist
528 or if it corresponds to an inline clone, create a new one. */
531 cgraph_node::get_create (tree decl
)
533 cgraph_node
*first_clone
= cgraph_node::get (decl
);
535 if (first_clone
&& !first_clone
->global
.inlined_to
)
538 cgraph_node
*node
= cgraph_node::create (decl
);
541 first_clone
->clone_of
= node
;
542 node
->clones
= first_clone
;
543 symtab
->symtab_prevail_in_asm_name_hash (node
);
544 node
->decl
->decl_with_vis
.symtab_node
= node
;
546 fprintf (dump_file
, "Introduced new external node "
547 "(%s) and turned into root of the clone tree.\n",
551 fprintf (dump_file
, "Introduced new external node "
552 "(%s).\n", node
->dump_name ());
556 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
557 the function body is associated with (not necessarily cgraph_node (DECL). */
560 cgraph_node::create_alias (tree alias
, tree target
)
562 cgraph_node
*alias_node
;
564 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
565 || TREE_CODE (target
) == IDENTIFIER_NODE
);
566 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
567 alias_node
= cgraph_node::get_create (alias
);
568 gcc_assert (!alias_node
->definition
);
569 alias_node
->alias_target
= target
;
570 alias_node
->definition
= true;
571 alias_node
->alias
= true;
572 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
573 alias_node
->transparent_alias
= alias_node
->weakref
= true;
577 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
579 Same body aliases are output whenever the body of DECL is output,
580 and cgraph_node::get (ALIAS) transparently returns
581 cgraph_node::get (DECL). */
584 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
588 /* If aliases aren't supported by the assembler, fail. */
589 if (!TARGET_SUPPORTS_ALIASES
)
592 /* Langhooks can create same body aliases of symbols not defined.
593 Those are useless. Drop them on the floor. */
594 if (symtab
->global_info_ready
)
597 n
= cgraph_node::create_alias (alias
, decl
);
598 n
->cpp_implicit_alias
= true;
599 if (symtab
->cpp_implicit_aliases_done
)
600 n
->resolve_alias (cgraph_node::get (decl
));
604 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
605 aliases DECL with an adjustments made into the first parameter.
606 See comments in thunk_adjust for detail on the parameters. */
609 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
610 HOST_WIDE_INT fixed_offset
,
611 HOST_WIDE_INT virtual_value
,
617 node
= cgraph_node::get (alias
);
621 node
= cgraph_node::create (alias
);
622 gcc_checking_assert (!virtual_offset
623 || wi::eq_p (virtual_offset
, virtual_value
));
624 node
->thunk
.fixed_offset
= fixed_offset
;
625 node
->thunk
.this_adjusting
= this_adjusting
;
626 node
->thunk
.virtual_value
= virtual_value
;
627 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
628 node
->thunk
.alias
= real_alias
;
629 node
->thunk
.thunk_p
= true;
630 node
->definition
= true;
635 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
636 Return NULL if there's no such node. */
639 cgraph_node::get_for_asmname (tree asmname
)
641 /* We do not want to look at inline clones. */
642 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
644 node
= node
->next_sharing_asm_name
)
646 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
647 if (cn
&& !cn
->global
.inlined_to
)
653 /* Returns a hash value for X (which really is a cgraph_edge). */
656 cgraph_edge_hasher::hash (cgraph_edge
*e
)
658 /* This is a really poor hash function, but it is what htab_hash_pointer
660 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
663 /* Returns a hash value for X (which really is a cgraph_edge). */
666 cgraph_edge_hasher::hash (gimple
*call_stmt
)
668 /* This is a really poor hash function, but it is what htab_hash_pointer
670 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
673 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
676 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
678 return x
->call_stmt
== y
;
681 /* Add call graph edge E to call site hash of its caller. */
684 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
686 gimple
*call
= e
->call_stmt
;
687 *e
->caller
->call_site_hash
->find_slot_with_hash
688 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
691 /* Add call graph edge E to call site hash of its caller. */
694 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
696 /* There are two speculative edges for every statement (one direct,
697 one indirect); always hash the direct one. */
698 if (e
->speculative
&& e
->indirect_unknown_callee
)
700 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
701 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
704 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
709 gcc_assert (!*slot
|| e
->speculative
);
713 /* Return the callgraph edge representing the GIMPLE_CALL statement
717 cgraph_node::get_edge (gimple
*call_stmt
)
723 return call_site_hash
->find_with_hash
724 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
726 /* This loop may turn out to be performance problem. In such case adding
727 hashtables into call nodes with very many edges is probably best
728 solution. It is not good idea to add pointer into CALL_EXPR itself
729 because we want to make possible having multiple cgraph nodes representing
730 different clones of the same body before the body is actually cloned. */
731 for (e
= callees
; e
; e
= e
->next_callee
)
733 if (e
->call_stmt
== call_stmt
)
739 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
741 if (e
->call_stmt
== call_stmt
)
748 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
749 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
750 cgraph_add_edge_to_call_site_hash (e2
);
751 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
752 cgraph_add_edge_to_call_site_hash (e2
);
759 /* Change field call_stmt of edge to NEW_STMT.
760 If UPDATE_SPECULATIVE and E is any component of speculative
761 edge, then update all components. */
764 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
768 /* Speculative edges has three component, update all of them
770 if (update_speculative
&& speculative
)
772 cgraph_edge
*direct
, *indirect
;
775 speculative_call_info (direct
, indirect
, ref
);
776 direct
->set_call_stmt (new_stmt
, false);
777 indirect
->set_call_stmt (new_stmt
, false);
778 ref
->stmt
= new_stmt
;
782 /* Only direct speculative edges go to call_site_hash. */
783 if (caller
->call_site_hash
784 && (!speculative
|| !indirect_unknown_callee
))
786 caller
->call_site_hash
->remove_elt_with_hash
787 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
790 cgraph_edge
*e
= this;
792 call_stmt
= new_stmt
;
793 if (indirect_unknown_callee
794 && (decl
= gimple_call_fndecl (new_stmt
)))
796 /* Constant propagation (and possibly also inlining?) can turn an
797 indirect call into a direct one. */
798 cgraph_node
*new_callee
= cgraph_node::get (decl
);
800 gcc_checking_assert (new_callee
);
801 e
= make_direct (new_callee
);
804 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
805 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
807 if (e
->caller
->call_site_hash
)
808 cgraph_add_edge_to_call_site_hash (e
);
811 /* Allocate a cgraph_edge structure and fill it with data according to the
812 parameters of which only CALLEE can be NULL (when creating an indirect call
816 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
817 gcall
*call_stmt
, profile_count count
, int freq
,
818 bool indir_unknown_callee
)
822 /* LTO does not actually have access to the call_stmt since these
823 have not been loaded yet. */
826 /* This is a rather expensive check possibly triggering
827 construction of call stmt hashtable. */
829 gcc_checking_assert (!(e
= caller
->get_edge (call_stmt
))
832 gcc_assert (is_gimple_call (call_stmt
));
838 free_edges
= NEXT_FREE_EDGE (edge
);
842 edge
= ggc_alloc
<cgraph_edge
> ();
843 edge
->uid
= edges_max_uid
++;
849 edge
->caller
= caller
;
850 edge
->callee
= callee
;
851 edge
->prev_caller
= NULL
;
852 edge
->next_caller
= NULL
;
853 edge
->prev_callee
= NULL
;
854 edge
->next_callee
= NULL
;
855 edge
->lto_stmt_uid
= 0;
858 edge
->frequency
= freq
;
859 gcc_checking_assert (freq
>= 0);
860 gcc_checking_assert (freq
<= CGRAPH_FREQ_MAX
);
862 edge
->call_stmt
= call_stmt
;
863 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
864 edge
->can_throw_external
865 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
868 && callee
&& callee
->decl
869 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
872 edge
->inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
873 edge
->call_stmt_cannot_inline_p
= true;
877 edge
->inline_failed
= CIF_FUNCTION_NOT_CONSIDERED
;
878 edge
->call_stmt_cannot_inline_p
= false;
881 edge
->indirect_info
= NULL
;
882 edge
->indirect_inlining_edge
= 0;
883 edge
->speculative
= false;
884 edge
->indirect_unknown_callee
= indir_unknown_callee
;
885 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
886 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
887 edge
->in_polymorphic_cdtor
888 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
891 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
892 if (call_stmt
&& caller
->call_site_hash
)
893 cgraph_add_edge_to_call_site_hash (edge
);
898 /* Create edge from a given function to CALLEE in the cgraph. */
901 cgraph_node::create_edge (cgraph_node
*callee
,
902 gcall
*call_stmt
, profile_count count
, int freq
)
904 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
907 initialize_inline_failed (edge
);
909 edge
->next_caller
= callee
->callers
;
911 callee
->callers
->prev_caller
= edge
;
912 edge
->next_callee
= callees
;
914 callees
->prev_callee
= edge
;
916 callee
->callers
= edge
;
921 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
923 cgraph_indirect_call_info
*
924 cgraph_allocate_init_indirect_info (void)
926 cgraph_indirect_call_info
*ii
;
928 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
929 ii
->param_index
= -1;
933 /* Create an indirect edge with a yet-undetermined callee where the call
934 statement destination is a formal parameter of the caller with index
938 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
939 profile_count count
, int freq
,
940 bool compute_indirect_info
)
942 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
946 initialize_inline_failed (edge
);
948 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
949 edge
->indirect_info
->ecf_flags
= ecf_flags
;
950 edge
->indirect_info
->vptr_changed
= true;
952 /* Record polymorphic call info. */
953 if (compute_indirect_info
955 && (target
= gimple_call_fn (call_stmt
))
956 && virtual_method_call_p (target
))
958 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
960 /* Only record types can have virtual calls. */
961 edge
->indirect_info
->polymorphic
= true;
962 edge
->indirect_info
->param_index
= -1;
963 edge
->indirect_info
->otr_token
964 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
965 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
966 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
967 edge
->indirect_info
->context
= context
;
970 edge
->next_callee
= indirect_calls
;
972 indirect_calls
->prev_callee
= edge
;
973 indirect_calls
= edge
;
978 /* Remove the edge from the list of the callees of the caller. */
981 cgraph_edge::remove_caller (void)
984 prev_callee
->next_callee
= next_callee
;
986 next_callee
->prev_callee
= prev_callee
;
989 if (indirect_unknown_callee
)
990 caller
->indirect_calls
= next_callee
;
992 caller
->callees
= next_callee
;
994 if (caller
->call_site_hash
)
995 caller
->call_site_hash
->remove_elt_with_hash
996 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
999 /* Put the edge onto the free list. */
1002 symbol_table::free_edge (cgraph_edge
*e
)
1006 if (e
->indirect_info
)
1007 ggc_free (e
->indirect_info
);
1009 /* Clear out the edge so we do not dangle pointers. */
1010 memset (e
, 0, sizeof (*e
));
1012 NEXT_FREE_EDGE (e
) = free_edges
;
1017 /* Remove the edge in the cgraph. */
1020 cgraph_edge::remove (void)
1022 /* Call all edge removal hooks. */
1023 symtab
->call_edge_removal_hooks (this);
1025 if (!indirect_unknown_callee
)
1026 /* Remove from callers list of the callee. */
1029 /* Remove from callees list of the callers. */
1032 /* Put the edge onto the free list. */
1033 symtab
->free_edge (this);
1036 /* Turn edge into speculative call calling N2. Update
1037 the profile so the direct call is taken COUNT times
1040 At clone materialization time, the indirect call E will
1043 if (call_dest == N2)
1048 At this time the function just creates the direct call,
1049 the referencd representing the if conditional and attaches
1050 them all to the orginal indirect call statement.
1052 Return direct edge created. */
1055 cgraph_edge::make_speculative (cgraph_node
*n2
, profile_count direct_count
,
1056 int direct_frequency
)
1058 cgraph_node
*n
= caller
;
1059 ipa_ref
*ref
= NULL
;
1063 fprintf (dump_file
, "Indirect call -> speculative call %s => %s\n",
1064 n
->dump_name (), n2
->dump_name ());
1066 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1067 initialize_inline_failed (e2
);
1068 e2
->speculative
= true;
1069 if (TREE_NOTHROW (n2
->decl
))
1070 e2
->can_throw_external
= false;
1072 e2
->can_throw_external
= can_throw_external
;
1073 e2
->lto_stmt_uid
= lto_stmt_uid
;
1074 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1076 frequency
-= e2
->frequency
;
1077 symtab
->call_edge_duplication_hooks (this, e2
);
1078 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1079 ref
->lto_stmt_uid
= lto_stmt_uid
;
1080 ref
->speculative
= speculative
;
1081 n2
->mark_address_taken ();
1085 /* Speculative call consist of three components:
1086 1) an indirect edge representing the original call
1087 2) an direct edge representing the new call
1088 3) ADDR_EXPR reference representing the speculative check.
1089 All three components are attached to single statement (the indirect
1090 call) and if one of them exists, all of them must exist.
1092 Given speculative call edge, return all three components.
1096 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1097 cgraph_edge
*&indirect
,
1098 ipa_ref
*&reference
)
1103 cgraph_edge
*e
= this;
1105 if (!e
->indirect_unknown_callee
)
1106 for (e2
= e
->caller
->indirect_calls
;
1107 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1108 e2
= e2
->next_callee
)
1113 /* We can take advantage of the call stmt hash. */
1116 e
= e
->caller
->get_edge (e2
->call_stmt
);
1117 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1120 for (e
= e
->caller
->callees
;
1121 e2
->call_stmt
!= e
->call_stmt
1122 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1126 gcc_assert (e
->speculative
&& e2
->speculative
);
1131 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1132 if (ref
->speculative
1133 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1134 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1140 /* Speculative edge always consist of all three components - direct edge,
1141 indirect and reference. */
1143 gcc_assert (e
&& e2
&& ref
);
1146 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1147 Remove the speculative call sequence and return edge representing the call.
1148 It is up to caller to redirect the call as appropriate. */
1151 cgraph_edge::resolve_speculation (tree callee_decl
)
1153 cgraph_edge
*edge
= this;
1157 gcc_assert (edge
->speculative
);
1158 edge
->speculative_call_info (e2
, edge
, ref
);
1160 || !ref
->referred
->semantically_equivalent_p
1161 (symtab_node::get (callee_decl
)))
1167 fprintf (dump_file
, "Speculative indirect call %s => %s has "
1168 "turned out to have contradicting known target ",
1169 edge
->caller
->dump_name (),
1170 e2
->callee
->dump_name ());
1171 print_generic_expr (dump_file
, callee_decl
);
1172 fprintf (dump_file
, "\n");
1176 fprintf (dump_file
, "Removing speculative call %s => %s\n",
1177 edge
->caller
->dump_name (),
1178 e2
->callee
->dump_name ());
1184 cgraph_edge
*tmp
= edge
;
1186 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1189 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1190 in the functions inlined through it. */
1192 edge
->count
+= e2
->count
;
1193 edge
->frequency
+= e2
->frequency
;
1194 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1195 edge
->frequency
= CGRAPH_FREQ_MAX
;
1196 edge
->speculative
= false;
1197 e2
->speculative
= false;
1198 ref
->remove_reference ();
1199 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1202 e2
->callee
->remove_symbol_and_inline_clones ();
1203 if (edge
->caller
->call_site_hash
)
1204 cgraph_update_edge_in_call_site_hash (edge
);
1208 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1209 CALLEE. DELTA is an integer constant that is to be added to the this
1210 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1213 cgraph_edge::make_direct (cgraph_node
*callee
)
1215 cgraph_edge
*edge
= this;
1216 gcc_assert (indirect_unknown_callee
);
1218 /* If we are redirecting speculative call, make it non-speculative. */
1219 if (indirect_unknown_callee
&& speculative
)
1221 edge
= edge
->resolve_speculation (callee
->decl
);
1223 /* On successful speculation just return the pre existing direct edge. */
1224 if (!indirect_unknown_callee
)
1228 indirect_unknown_callee
= 0;
1229 ggc_free (indirect_info
);
1230 indirect_info
= NULL
;
1232 /* Get the edge out of the indirect edge list. */
1234 prev_callee
->next_callee
= next_callee
;
1236 next_callee
->prev_callee
= prev_callee
;
1238 caller
->indirect_calls
= next_callee
;
1240 /* Put it into the normal callee list */
1242 next_callee
= caller
->callees
;
1243 if (caller
->callees
)
1244 caller
->callees
->prev_callee
= edge
;
1245 caller
->callees
= edge
;
1247 /* Insert to callers list of the new callee. */
1248 edge
->set_callee (callee
);
1251 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
, false))
1253 call_stmt_cannot_inline_p
= true;
1254 inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
1257 /* We need to re-determine the inlining status of the edge. */
1258 initialize_inline_failed (edge
);
1262 /* If necessary, change the function declaration in the call statement
1263 associated with E so that it corresponds to the edge callee. */
1266 cgraph_edge::redirect_call_stmt_to_callee (void)
1268 cgraph_edge
*e
= this;
1270 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1272 gimple_stmt_iterator gsi
;
1273 bool skip_bounds
= false;
1281 e
->speculative_call_info (e
, e2
, ref
);
1282 /* If there already is an direct call (i.e. as a result of inliner's
1283 substitution), forget about speculating. */
1285 e
= e
->resolve_speculation (decl
);
1286 /* If types do not match, speculation was likely wrong.
1287 The direct edge was possibly redirected to the clone with a different
1288 signature. We did not update the call statement yet, so compare it
1289 with the reference that still points to the proper type. */
1290 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1291 ref
->referred
->decl
,
1295 fprintf (dump_file
, "Not expanding speculative call of %s -> %s\n"
1297 e
->caller
->dump_name (),
1298 e
->callee
->dump_name ());
1299 e
= e
->resolve_speculation ();
1300 /* We are producing the final function body and will throw away the
1301 callgraph edges really soon. Reset the counts/frequencies to
1302 keep verifier happy in the case of roundoff errors. */
1303 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1304 e
->frequency
= compute_call_stmt_bb_frequency
1305 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1307 /* Expand speculation into GIMPLE code. */
1313 "Expanding speculative call of %s -> %s count: ",
1314 e
->caller
->dump_name (),
1315 e
->callee
->dump_name ());
1316 e
->count
.dump (dump_file
);
1317 fprintf (dump_file
, "\n");
1319 gcc_assert (e2
->speculative
);
1320 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1322 profile_probability prob
= e
->count
.probability_in (e
->count
1324 if (prob
.initialized_p ())
1326 else if (e
->frequency
|| e2
->frequency
)
1327 prob
= profile_probability::probability_in_gcov_type
1328 (e
->frequency
, e
->frequency
+ e2
->frequency
).guessed ();
1330 prob
= profile_probability::even ();
1331 new_stmt
= gimple_ic (e
->call_stmt
,
1332 dyn_cast
<cgraph_node
*> (ref
->referred
),
1333 prob
, e
->count
, e
->count
+ e2
->count
);
1334 e
->speculative
= false;
1335 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1338 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1339 processed call stmt. */
1340 if (gimple_call_with_bounds_p (new_stmt
)
1341 && gimple_call_lhs (new_stmt
)
1342 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1344 tree dresult
= gimple_call_lhs (new_stmt
);
1345 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1346 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1347 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1348 struct cgraph_edge
*iedge
1349 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1350 struct cgraph_edge
*dedge
;
1354 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1357 dedge
->frequency
= compute_call_stmt_bb_frequency
1358 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1360 iedge
->frequency
= compute_call_stmt_bb_frequency
1361 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1364 e
->frequency
= compute_call_stmt_bb_frequency
1365 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1366 e2
->frequency
= compute_call_stmt_bb_frequency
1367 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1368 e2
->speculative
= false;
1369 ref
->speculative
= false;
1371 /* Indirect edges are not both in the call site hash.
1373 if (e
->caller
->call_site_hash
)
1374 cgraph_update_edge_in_call_site_hash (e2
);
1376 /* Continue redirecting E to proper target. */
1380 /* We might propagate instrumented function pointer into
1381 not instrumented function and vice versa. In such a
1382 case we need to either fix function declaration or
1383 remove bounds from call statement. */
1384 if (flag_check_pointer_bounds
&& e
->callee
)
1385 skip_bounds
= chkp_redirect_edge (e
);
1387 if (e
->indirect_unknown_callee
1388 || (decl
== e
->callee
->decl
1390 return e
->call_stmt
;
1392 if (flag_checking
&& decl
)
1394 cgraph_node
*node
= cgraph_node::get (decl
);
1395 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1398 if (symtab
->dump_file
)
1400 fprintf (symtab
->dump_file
, "updating call of %s -> %s: ",
1401 e
->caller
->dump_name (), e
->callee
->dump_name ());
1402 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1403 if (e
->callee
->clone
.combined_args_to_skip
)
1405 fprintf (symtab
->dump_file
, " combined args to skip: ");
1406 dump_bitmap (symtab
->dump_file
,
1407 e
->callee
->clone
.combined_args_to_skip
);
1411 if (e
->callee
->clone
.combined_args_to_skip
1416 new_stmt
= e
->call_stmt
;
1417 if (e
->callee
->clone
.combined_args_to_skip
)
1419 = gimple_call_copy_skip_args (new_stmt
,
1420 e
->callee
->clone
.combined_args_to_skip
);
1422 new_stmt
= chkp_copy_call_skip_bounds (new_stmt
);
1424 tree old_fntype
= gimple_call_fntype (e
->call_stmt
);
1425 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1426 cgraph_node
*origin
= e
->callee
;
1427 while (origin
->clone_of
)
1428 origin
= origin
->clone_of
;
1430 if ((origin
->former_clone_of
1431 && old_fntype
== TREE_TYPE (origin
->former_clone_of
))
1432 || old_fntype
== TREE_TYPE (origin
->decl
))
1433 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1436 bitmap skip
= e
->callee
->clone
.combined_args_to_skip
;
1437 tree t
= cgraph_build_function_type_skip_args (old_fntype
, skip
,
1439 gimple_call_set_fntype (new_stmt
, t
);
1442 if (gimple_vdef (new_stmt
)
1443 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1444 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1446 gsi
= gsi_for_stmt (e
->call_stmt
);
1448 /* For optimized away parameters, add on the caller side
1450 DEBUG D#X => parm_Y(D)
1451 stmts and associate D#X with parm in decl_debug_args_lookup
1452 vector to say for debug info that if parameter parm had been passed,
1453 it would have value parm_Y(D). */
1454 if (e
->callee
->clone
.combined_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
1456 vec
<tree
, va_gc
> **debug_args
1457 = decl_debug_args_lookup (e
->callee
->decl
);
1458 tree old_decl
= gimple_call_fndecl (e
->call_stmt
);
1459 if (debug_args
&& old_decl
)
1462 unsigned i
= 0, num
;
1463 unsigned len
= vec_safe_length (*debug_args
);
1464 unsigned nargs
= gimple_call_num_args (e
->call_stmt
);
1465 for (parm
= DECL_ARGUMENTS (old_decl
), num
= 0;
1466 parm
&& num
< nargs
;
1467 parm
= DECL_CHAIN (parm
), num
++)
1468 if (bitmap_bit_p (e
->callee
->clone
.combined_args_to_skip
, num
)
1469 && is_gimple_reg (parm
))
1473 while (i
< len
&& (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1479 && (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1484 tree ddecl
= (**debug_args
)[i
+ 1];
1485 tree arg
= gimple_call_arg (e
->call_stmt
, num
);
1486 if (!useless_type_conversion_p (TREE_TYPE (ddecl
),
1490 if (!fold_convertible_p (TREE_TYPE (ddecl
), arg
))
1492 if (TREE_CODE (arg
) == SSA_NAME
1493 && gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg
))
1495 = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (arg
)))
1496 && useless_type_conversion_p (TREE_TYPE (ddecl
),
1500 arg
= fold_convert (TREE_TYPE (ddecl
), arg
);
1504 = gimple_build_debug_bind (ddecl
, unshare_expr (arg
),
1506 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
1511 gsi_replace (&gsi
, new_stmt
, false);
1512 /* We need to defer cleaning EH info on the new statement to
1513 fixup-cfg. We may not have dominator information at this point
1514 and thus would end up with unreachable blocks and have no way
1515 to communicate that we need to run CFG cleanup then. */
1516 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1519 remove_stmt_from_eh_lp (e
->call_stmt
);
1520 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1525 new_stmt
= e
->call_stmt
;
1526 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1527 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1530 /* If changing the call to __cxa_pure_virtual or similar noreturn function,
1531 adjust gimple_call_fntype too. */
1532 if (gimple_call_noreturn_p (new_stmt
)
1533 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e
->callee
->decl
)))
1534 && TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
))
1535 && (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
)))
1537 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1539 /* If the call becomes noreturn, remove the LHS if possible. */
1540 tree lhs
= gimple_call_lhs (new_stmt
);
1542 && gimple_call_noreturn_p (new_stmt
)
1543 && (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt
)))
1544 || should_remove_lhs_p (lhs
)))
1546 if (TREE_CODE (lhs
) == SSA_NAME
)
1548 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1549 TREE_TYPE (lhs
), NULL
);
1550 var
= get_or_create_ssa_default_def
1551 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1552 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1553 gsi
= gsi_for_stmt (new_stmt
);
1554 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1555 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1557 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1558 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1561 /* If new callee has no static chain, remove it. */
1562 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1564 gimple_call_set_chain (new_stmt
, NULL
);
1565 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1568 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1571 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1573 if (symtab
->dump_file
)
1575 fprintf (symtab
->dump_file
, " updated to:");
1576 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1581 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1582 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1583 of OLD_STMT if it was previously call statement.
1584 If NEW_STMT is NULL, the call has been dropped without any
1588 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1589 gimple
*old_stmt
, tree old_call
,
1592 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1593 ? gimple_call_fndecl (new_stmt
) : 0;
1595 /* We are seeing indirect calls, then there is nothing to update. */
1596 if (!new_call
&& !old_call
)
1598 /* See if we turned indirect call into direct call or folded call to one builtin
1599 into different builtin. */
1600 if (old_call
!= new_call
)
1602 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1603 cgraph_edge
*ne
= NULL
;
1604 profile_count count
;
1609 /* Keep calls marked as dead dead. */
1610 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1611 && DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
1612 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
1614 node
->get_edge (old_stmt
)->set_call_stmt
1615 (as_a
<gcall
*> (new_stmt
));
1618 /* See if the edge is already there and has the correct callee. It
1619 might be so because of indirect inlining has already updated
1620 it. We also might've cloned and redirected the edge. */
1621 if (new_call
&& e
->callee
)
1623 cgraph_node
*callee
= e
->callee
;
1626 if (callee
->decl
== new_call
1627 || callee
->former_clone_of
== new_call
)
1629 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1632 callee
= callee
->clone_of
;
1636 /* Otherwise remove edge and create new one; we can't simply redirect
1637 since function has changed, so inline plan and other information
1638 attached to edge is invalid. */
1640 frequency
= e
->frequency
;
1641 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1644 e
->callee
->remove_symbol_and_inline_clones ();
1648 /* We are seeing new direct call; compute profile info based on BB. */
1649 basic_block bb
= gimple_bb (new_stmt
);
1651 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1657 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1658 as_a
<gcall
*> (new_stmt
), count
,
1660 gcc_assert (ne
->inline_failed
);
1663 /* We only updated the call stmt; update pointer in cgraph edge.. */
1664 else if (old_stmt
!= new_stmt
)
1665 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1668 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1669 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1670 of OLD_STMT before it was updated (updating can happen inplace). */
1673 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1676 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1679 gcc_checking_assert (orig
);
1680 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1682 for (node
= orig
->clones
; node
!= orig
;)
1684 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1686 node
= node
->clones
;
1687 else if (node
->next_sibling_clone
)
1688 node
= node
->next_sibling_clone
;
1691 while (node
!= orig
&& !node
->next_sibling_clone
)
1692 node
= node
->clone_of
;
1694 node
= node
->next_sibling_clone
;
1700 /* Remove all callees from the node. */
1703 cgraph_node::remove_callees (void)
1707 /* It is sufficient to remove the edges from the lists of callers of
1708 the callees. The callee list of the node can be zapped with one
1710 for (e
= callees
; e
; e
= f
)
1713 symtab
->call_edge_removal_hooks (e
);
1714 if (!e
->indirect_unknown_callee
)
1715 e
->remove_callee ();
1716 symtab
->free_edge (e
);
1718 for (e
= indirect_calls
; e
; e
= f
)
1721 symtab
->call_edge_removal_hooks (e
);
1722 if (!e
->indirect_unknown_callee
)
1723 e
->remove_callee ();
1724 symtab
->free_edge (e
);
1726 indirect_calls
= NULL
;
1730 call_site_hash
->empty ();
1731 call_site_hash
= NULL
;
1735 /* Remove all callers from the node. */
1738 cgraph_node::remove_callers (void)
1742 /* It is sufficient to remove the edges from the lists of callees of
1743 the callers. The caller list of the node can be zapped with one
1745 for (e
= callers
; e
; e
= f
)
1748 symtab
->call_edge_removal_hooks (e
);
1749 e
->remove_caller ();
1750 symtab
->free_edge (e
);
1755 /* Helper function for cgraph_release_function_body and free_lang_data.
1756 It releases body from function DECL without having to inspect its
1757 possibly non-existent symtab node. */
1760 release_function_body (tree decl
)
1762 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1766 && loops_for_fn (fn
))
1768 fn
->curr_properties
&= ~PROP_loops
;
1769 loop_optimizer_finalize (fn
);
1773 delete_tree_ssa (fn
);
1778 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1779 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1780 delete_tree_cfg_annotations (fn
);
1784 if (fn
->value_histograms
)
1785 free_histograms (fn
);
1786 gimple_set_body (decl
, NULL
);
1787 /* Struct function hangs a lot of data that would leak if we didn't
1788 removed all pointers to it. */
1790 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1792 DECL_SAVED_TREE (decl
) = NULL
;
1795 /* Release memory used to represent body of function.
1796 Use this only for functions that are released before being translated to
1797 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1798 are free'd in final.c via free_after_compilation().
1799 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1802 cgraph_node::release_body (bool keep_arguments
)
1804 ipa_transforms_to_apply
.release ();
1805 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1807 DECL_RESULT (decl
) = NULL
;
1809 if (!keep_arguments
)
1810 DECL_ARGUMENTS (decl
) = NULL
;
1812 /* If the node is abstract and needed, then do not clear
1813 DECL_INITIAL of its associated function declaration because it's
1814 needed to emit debug info later. */
1815 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1816 DECL_INITIAL (decl
) = error_mark_node
;
1817 release_function_body (decl
);
1820 lto_free_function_in_decl_state_for_node (this);
1821 lto_file_data
= NULL
;
1825 /* Remove function from symbol table. */
1828 cgraph_node::remove (void)
1831 int uid
= this->uid
;
1833 if (symtab
->ipa_clones_dump_file
&& symtab
->cloned_nodes
.contains (this))
1834 fprintf (symtab
->ipa_clones_dump_file
,
1835 "Callgraph removal;%s;%d;%s;%d;%d\n", asm_name (), order
,
1836 DECL_SOURCE_FILE (decl
), DECL_SOURCE_LINE (decl
),
1837 DECL_SOURCE_COLUMN (decl
));
1839 symtab
->call_cgraph_removal_hooks (this);
1842 ipa_transforms_to_apply
.release ();
1844 /* Incremental inlining access removed nodes stored in the postorder list.
1846 force_output
= false;
1847 forced_by_abi
= false;
1848 for (n
= nested
; n
; n
= n
->next_nested
)
1853 cgraph_node
**node2
= &origin
->nested
;
1855 while (*node2
!= this)
1856 node2
= &(*node2
)->next_nested
;
1857 *node2
= next_nested
;
1860 if (prev_sibling_clone
)
1861 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1863 clone_of
->clones
= next_sibling_clone
;
1864 if (next_sibling_clone
)
1865 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1868 cgraph_node
*n
, *next
;
1872 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1873 n
->clone_of
= clone_of
;
1874 n
->clone_of
= clone_of
;
1875 n
->next_sibling_clone
= clone_of
->clones
;
1876 if (clone_of
->clones
)
1877 clone_of
->clones
->prev_sibling_clone
= n
;
1878 clone_of
->clones
= clones
;
1882 /* We are removing node with clones. This makes clones inconsistent,
1883 but assume they will be removed subsequently and just keep clone
1884 tree intact. This can happen in unreachable function removal since
1885 we remove unreachable functions in random order, not by bottom-up
1886 walk of clone trees. */
1887 for (n
= clones
; n
; n
= next
)
1889 next
= n
->next_sibling_clone
;
1890 n
->next_sibling_clone
= NULL
;
1891 n
->prev_sibling_clone
= NULL
;
1897 /* While all the clones are removed after being proceeded, the function
1898 itself is kept in the cgraph even after it is compiled. Check whether
1899 we are done with this body and reclaim it proactively if this is the case.
1901 if (symtab
->state
!= LTO_STREAMING
)
1903 n
= cgraph_node::get (decl
);
1905 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1906 && ((symtab
->global_info_ready
|| in_lto_p
)
1907 && (TREE_ASM_WRITTEN (n
->decl
)
1908 || DECL_EXTERNAL (n
->decl
)
1910 || (!flag_wpa
&& n
->in_other_partition
)))))
1915 lto_free_function_in_decl_state_for_node (this);
1916 lto_file_data
= NULL
;
1922 call_site_hash
->empty ();
1923 call_site_hash
= NULL
;
1926 if (instrumented_version
)
1928 instrumented_version
->instrumented_version
= NULL
;
1929 instrumented_version
= NULL
;
1932 symtab
->release_symbol (this, uid
);
1935 /* Likewise indicate that a node is having address taken. */
1938 cgraph_node::mark_address_taken (void)
1940 /* Indirect inlining can figure out that all uses of the address are
1942 if (global
.inlined_to
)
1944 gcc_assert (cfun
->after_inlining
);
1945 gcc_assert (callers
->indirect_inlining_edge
);
1948 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1949 IPA_REF_ADDR reference exists (and thus it should be set on node
1950 representing alias we take address of) and as a test whether address
1951 of the object was taken (and thus it should be set on node alias is
1952 referring to). We should remove the first use and the remove the
1955 cgraph_node
*node
= ultimate_alias_target ();
1956 node
->address_taken
= 1;
1959 /* Return local info for the compiled function. */
1962 cgraph_node::local_info (tree decl
)
1964 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1965 cgraph_node
*node
= get (decl
);
1968 return &node
->ultimate_alias_target ()->local
;
1971 /* Return local info for the compiled function. */
1974 cgraph_node::rtl_info (tree decl
)
1976 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1977 cgraph_node
*node
= get (decl
);
1980 enum availability avail
;
1981 node
= node
->ultimate_alias_target (&avail
);
1982 if (decl
!= current_function_decl
1983 && (avail
< AVAIL_AVAILABLE
1984 || (node
->decl
!= current_function_decl
1985 && !TREE_ASM_WRITTEN (node
->decl
))))
1987 /* Allocate if it doesn't exist. */
1988 if (node
->rtl
== NULL
)
1989 node
->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1993 /* Return a string describing the failure REASON. */
1996 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1999 #define DEFCIFCODE(code, type, string) string,
2001 static const char *cif_string_table
[CIF_N_REASONS
] = {
2002 #include "cif-code.def"
2005 /* Signedness of an enum type is implementation defined, so cast it
2006 to unsigned before testing. */
2007 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
2008 return cif_string_table
[reason
];
2011 /* Return a type describing the failure REASON. */
2013 cgraph_inline_failed_type_t
2014 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
2017 #define DEFCIFCODE(code, type, string) type,
2019 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
2020 #include "cif-code.def"
2023 /* Signedness of an enum type is implementation defined, so cast it
2024 to unsigned before testing. */
2025 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
2026 return cif_type_table
[reason
];
2029 /* Names used to print out the availability enum. */
2030 const char * const cgraph_availability_names
[] =
2031 {"unset", "not_available", "overwritable", "available", "local"};
2033 /* Output flags of edge to a file F. */
2036 cgraph_edge::dump_edge_flags (FILE *f
)
2039 fprintf (f
, "(speculative) ");
2041 fprintf (f
, "(inlined) ");
2042 if (call_stmt_cannot_inline_p
)
2043 fprintf (f
, "(call_stmt_cannot_inline_p) ");
2044 if (indirect_inlining_edge
)
2045 fprintf (f
, "(indirect_inlining) ");
2046 if (count
.initialized_p ())
2053 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
2054 if (can_throw_external
)
2055 fprintf (f
, "(can throw external) ");
2058 /* Dump call graph node to file F. */
2061 cgraph_node::dump (FILE *f
)
2067 if (global
.inlined_to
)
2068 fprintf (f
, " Function %s is inline copy in %s\n",
2070 global
.inlined_to
->dump_name ());
2072 fprintf (f
, " Clone of %s\n", clone_of
->dump_asm_name ());
2073 if (symtab
->function_flags_ready
)
2074 fprintf (f
, " Availability: %s\n",
2075 cgraph_availability_names
[get_availability ()]);
2078 fprintf (f
, " Profile id: %i\n",
2080 fprintf (f
, " First run: %i\n", tp_first_run
);
2081 cgraph_function_version_info
*vi
= function_version ();
2084 fprintf (f
, " Version info: ");
2085 if (vi
->prev
!= NULL
)
2087 fprintf (f
, "prev: ");
2088 fprintf (f
, "%s ", vi
->prev
->this_node
->dump_asm_name ());
2090 if (vi
->next
!= NULL
)
2092 fprintf (f
, "next: ");
2093 fprintf (f
, "%s ", vi
->next
->this_node
->dump_asm_name ());
2095 if (vi
->dispatcher_resolver
!= NULL_TREE
)
2096 fprintf (f
, "dispatcher: %s",
2097 lang_hooks
.decl_printable_name (vi
->dispatcher_resolver
, 2));
2101 fprintf (f
, " Function flags:");
2102 if (count
.initialized_p ())
2104 fprintf (f
, " count: ");
2108 fprintf (f
, " nested in: %s", origin
->asm_name ());
2109 if (gimple_has_body_p (decl
))
2110 fprintf (f
, " body");
2112 fprintf (f
, " process");
2114 fprintf (f
, " local");
2115 if (local
.redefined_extern_inline
)
2116 fprintf (f
, " redefined_extern_inline");
2117 if (only_called_at_startup
)
2118 fprintf (f
, " only_called_at_startup");
2119 if (only_called_at_exit
)
2120 fprintf (f
, " only_called_at_exit");
2122 fprintf (f
, " tm_clone");
2123 if (calls_comdat_local
)
2124 fprintf (f
, " calls_comdat_local");
2126 fprintf (f
, " icf_merged");
2128 fprintf (f
, " merged_comdat");
2130 fprintf (f
, " split_part");
2131 if (indirect_call_target
)
2132 fprintf (f
, " indirect_call_target");
2134 fprintf (f
, " nonfreeing_fn");
2135 if (DECL_STATIC_CONSTRUCTOR (decl
))
2136 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2137 if (DECL_STATIC_DESTRUCTOR (decl
))
2138 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2139 if (frequency
== NODE_FREQUENCY_HOT
)
2140 fprintf (f
, " hot");
2141 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2142 fprintf (f
, " unlikely_executed");
2143 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2144 fprintf (f
, " executed_once");
2145 if (only_called_at_startup
)
2146 fprintf (f
, " only_called_at_startup");
2147 if (only_called_at_exit
)
2148 fprintf (f
, " only_called_at_exit");
2149 if (opt_for_fn (decl
, optimize_size
))
2150 fprintf (f
, " optimize_size");
2151 if (parallelized_function
)
2152 fprintf (f
, " parallelized_function");
2158 fprintf (f
, " Thunk");
2160 fprintf (f
, " of %s (asm: %s)",
2161 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2162 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2163 fprintf (f
, " fixed offset %i virtual value %i has "
2164 "virtual offset %i)\n",
2165 (int)thunk
.fixed_offset
,
2166 (int)thunk
.virtual_value
,
2167 (int)thunk
.virtual_offset_p
);
2169 if (alias
&& thunk
.alias
2170 && DECL_P (thunk
.alias
))
2172 fprintf (f
, " Alias of %s",
2173 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2174 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2175 fprintf (f
, " (asm: %s)",
2176 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2180 fprintf (f
, " Called by: ");
2182 profile_count sum
= profile_count::zero ();
2183 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2185 fprintf (f
, "%s ", edge
->caller
->dump_name ());
2186 edge
->dump_edge_flags (f
);
2187 if (edge
->count
.initialized_p ())
2191 fprintf (f
, "\n Calls: ");
2192 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2194 fprintf (f
, "%s ", edge
->callee
->dump_name ());
2195 edge
->dump_edge_flags (f
);
2199 if (count
.initialized_p ())
2205 FOR_EACH_ALIAS (this, ref
)
2206 if (dyn_cast
<cgraph_node
*> (ref
->referring
)->count
.initialized_p ())
2207 sum
+= dyn_cast
<cgraph_node
*> (ref
->referring
)->count
;
2209 if (global
.inlined_to
2210 || (symtab
->state
< EXPANSION
2211 && ultimate_alias_target () == this && only_called_directly_p ()))
2212 ok
= !count
.differs_from_p (sum
);
2213 else if (count
> profile_count::from_gcov_type (100)
2214 && count
< sum
.apply_scale (99, 100))
2215 ok
= false, min
= true;
2218 fprintf (f
, " Invalid sum of caller counts ");
2221 fprintf (f
, ", should be at most ");
2223 fprintf (f
, ", should be ");
2229 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2231 if (edge
->indirect_info
->polymorphic
)
2233 fprintf (f
, " Polymorphic indirect call of type ");
2234 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2235 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2238 fprintf (f
, " Indirect call");
2239 edge
->dump_edge_flags (f
);
2240 if (edge
->indirect_info
->param_index
!= -1)
2242 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2243 if (edge
->indirect_info
->agg_contents
)
2244 fprintf (f
, " loaded from %s %s at offset %i",
2245 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2246 edge
->indirect_info
->by_ref
? "passed by reference":"",
2247 (int)edge
->indirect_info
->offset
);
2248 if (edge
->indirect_info
->vptr_changed
)
2249 fprintf (f
, " (vptr maybe changed)");
2252 if (edge
->indirect_info
->polymorphic
)
2253 edge
->indirect_info
->context
.dump (f
);
2256 if (instrumentation_clone
)
2257 fprintf (f
, " Is instrumented version.\n");
2258 else if (instrumented_version
)
2259 fprintf (f
, " Has instrumented version.\n");
2262 /* Dump call graph node NODE to stderr. */
2265 cgraph_node::debug (void)
2270 /* Dump the callgraph to file F. */
2273 cgraph_node::dump_cgraph (FILE *f
)
2277 fprintf (f
, "callgraph:\n\n");
2278 FOR_EACH_FUNCTION (node
)
2282 /* Return true when the DECL can possibly be inlined. */
2285 cgraph_function_possibly_inlined_p (tree decl
)
2287 if (!symtab
->global_info_ready
)
2288 return !DECL_UNINLINABLE (decl
);
2289 return DECL_POSSIBLY_INLINED (decl
);
2292 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2294 cgraph_node::unnest (void)
2296 cgraph_node
**node2
= &origin
->nested
;
2297 gcc_assert (origin
);
2299 while (*node2
!= this)
2300 node2
= &(*node2
)->next_nested
;
2301 *node2
= next_nested
;
2305 /* Return function availability. See cgraph.h for description of individual
2308 cgraph_node::get_availability (symtab_node
*ref
)
2312 cgraph_node
*cref
= dyn_cast
<cgraph_node
*> (ref
);
2314 ref
= cref
->global
.inlined_to
;
2316 enum availability avail
;
2318 avail
= AVAIL_NOT_AVAILABLE
;
2319 else if (local
.local
)
2320 avail
= AVAIL_LOCAL
;
2321 else if (global
.inlined_to
)
2322 avail
= AVAIL_AVAILABLE
;
2323 else if (transparent_alias
)
2324 ultimate_alias_target (&avail
, ref
);
2325 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
))
2326 || lookup_attribute ("noipa", DECL_ATTRIBUTES (decl
)))
2327 avail
= AVAIL_INTERPOSABLE
;
2328 else if (!externally_visible
)
2329 avail
= AVAIL_AVAILABLE
;
2330 /* If this is a reference from symbol itself and there are no aliases, we
2331 may be sure that the symbol was not interposed by something else because
2332 the symbol itself would be unreachable otherwise.
2334 Also comdat groups are always resolved in groups. */
2335 else if ((this == ref
&& !has_aliases_p ())
2336 || (ref
&& get_comdat_group ()
2337 && get_comdat_group () == ref
->get_comdat_group ()))
2338 avail
= AVAIL_AVAILABLE
;
2339 /* Inline functions are safe to be analyzed even if their symbol can
2340 be overwritten at runtime. It is not meaningful to enforce any sane
2341 behavior on replacing inline function by different body. */
2342 else if (DECL_DECLARED_INLINE_P (decl
))
2343 avail
= AVAIL_AVAILABLE
;
2345 /* If the function can be overwritten, return OVERWRITABLE. Take
2346 care at least of two notable extensions - the COMDAT functions
2347 used to share template instantiations in C++ (this is symmetric
2348 to code cp_cannot_inline_tree_fn and probably shall be shared and
2349 the inlinability hooks completely eliminated). */
2351 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2352 avail
= AVAIL_INTERPOSABLE
;
2353 else avail
= AVAIL_AVAILABLE
;
2358 /* Worker for cgraph_node_can_be_local_p. */
2360 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2362 return !(!node
->force_output
2363 && ((DECL_COMDAT (node
->decl
)
2364 && !node
->forced_by_abi
2365 && !node
->used_from_object_file_p ()
2366 && !node
->same_comdat_group
)
2367 || !node
->externally_visible
));
2370 /* Return true if cgraph_node can be made local for API change.
2371 Extern inline functions and C++ COMDAT functions can be made local
2372 at the expense of possible code size growth if function is used in multiple
2373 compilation units. */
2375 cgraph_node::can_be_local_p (void)
2377 return (!address_taken
2378 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2382 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2383 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
2384 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2387 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2388 (cgraph_node
*, void *),
2390 bool include_overwritable
,
2391 bool exclude_virtual_thunks
)
2395 enum availability avail
= AVAIL_AVAILABLE
;
2397 if (include_overwritable
2398 || (avail
= get_availability ()) > AVAIL_INTERPOSABLE
)
2400 if (callback (this, data
))
2403 FOR_EACH_ALIAS (this, ref
)
2405 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2406 if (include_overwritable
2407 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2408 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2409 include_overwritable
,
2410 exclude_virtual_thunks
))
2413 if (avail
<= AVAIL_INTERPOSABLE
)
2415 for (e
= callers
; e
; e
= e
->next_caller
)
2416 if (e
->caller
->thunk
.thunk_p
2417 && (include_overwritable
2418 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2419 && !(exclude_virtual_thunks
2420 && e
->caller
->thunk
.virtual_offset_p
))
2421 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2422 include_overwritable
,
2423 exclude_virtual_thunks
))
2429 /* Worker to bring NODE local. */
2432 cgraph_node::make_local (cgraph_node
*node
, void *)
2434 gcc_checking_assert (node
->can_be_local_p ());
2435 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2437 node
->make_decl_local ();
2438 node
->set_section (NULL
);
2439 node
->set_comdat_group (NULL
);
2440 node
->externally_visible
= false;
2441 node
->forced_by_abi
= false;
2442 node
->local
.local
= true;
2443 node
->set_section (NULL
);
2444 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2445 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2446 && !flag_incremental_link
);
2447 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2448 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2453 /* Bring cgraph node local. */
2456 cgraph_node::make_local (void)
2458 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2461 /* Worker to set nothrow flag. */
2464 set_nothrow_flag_1 (cgraph_node
*node
, bool nothrow
, bool non_call
,
2469 if (nothrow
&& !TREE_NOTHROW (node
->decl
))
2471 /* With non-call exceptions we can't say for sure if other function body
2472 was not possibly optimized to stil throw. */
2473 if (!non_call
|| node
->binds_to_current_def_p ())
2475 TREE_NOTHROW (node
->decl
) = true;
2477 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2478 e
->can_throw_external
= false;
2481 else if (!nothrow
&& TREE_NOTHROW (node
->decl
))
2483 TREE_NOTHROW (node
->decl
) = false;
2487 FOR_EACH_ALIAS (node
, ref
)
2489 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2490 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2491 set_nothrow_flag_1 (alias
, nothrow
, non_call
, changed
);
2493 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2494 if (e
->caller
->thunk
.thunk_p
2495 && (!nothrow
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2496 set_nothrow_flag_1 (e
->caller
, nothrow
, non_call
, changed
);
2499 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2500 if any to NOTHROW. */
2503 cgraph_node::set_nothrow_flag (bool nothrow
)
2505 bool changed
= false;
2506 bool non_call
= opt_for_fn (decl
, flag_non_call_exceptions
);
2508 if (!nothrow
|| get_availability () > AVAIL_INTERPOSABLE
)
2509 set_nothrow_flag_1 (this, nothrow
, non_call
, &changed
);
2514 FOR_EACH_ALIAS (this, ref
)
2516 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2517 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2518 set_nothrow_flag_1 (alias
, nothrow
, non_call
, &changed
);
2524 /* Worker to set_const_flag. */
2527 set_const_flag_1 (cgraph_node
*node
, bool set_const
, bool looping
,
2530 /* Static constructors and destructors without a side effect can be
2532 if (set_const
&& !looping
)
2534 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2536 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2539 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2541 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2547 if (TREE_READONLY (node
->decl
))
2549 TREE_READONLY (node
->decl
) = 0;
2550 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2556 /* Consider function:
2563 During early optimization we will turn this into:
2570 Now if this function will be detected as CONST however when interposed
2571 it may end up being just pure. We always must assume the worst
2573 if (TREE_READONLY (node
->decl
))
2575 if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2577 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2581 else if (node
->binds_to_current_def_p ())
2583 TREE_READONLY (node
->decl
) = true;
2584 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2585 DECL_PURE_P (node
->decl
) = false;
2590 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2591 fprintf (dump_file
, "Dropping state to PURE because function does "
2592 "not bind to current def.\n");
2593 if (!DECL_PURE_P (node
->decl
))
2595 DECL_PURE_P (node
->decl
) = true;
2596 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2599 else if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2601 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2608 FOR_EACH_ALIAS (node
, ref
)
2610 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2611 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2612 set_const_flag_1 (alias
, set_const
, looping
, changed
);
2614 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2615 if (e
->caller
->thunk
.thunk_p
2616 && (!set_const
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2618 /* Virtual thunks access virtual offset in the vtable, so they can
2619 only be pure, never const. */
2621 && (e
->caller
->thunk
.virtual_offset_p
2622 || !node
->binds_to_current_def_p (e
->caller
)))
2623 *changed
|= e
->caller
->set_pure_flag (true, looping
);
2625 set_const_flag_1 (e
->caller
, set_const
, looping
, changed
);
2629 /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
2630 If SET_CONST if false, clear the flag.
2632 When setting the flag be careful about possible interposition and
2633 do not set the flag for functions that can be interposet and set pure
2634 flag for functions that can bind to other definition.
2636 Return true if any change was done. */
2639 cgraph_node::set_const_flag (bool set_const
, bool looping
)
2641 bool changed
= false;
2642 if (!set_const
|| get_availability () > AVAIL_INTERPOSABLE
)
2643 set_const_flag_1 (this, set_const
, looping
, &changed
);
2648 FOR_EACH_ALIAS (this, ref
)
2650 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2651 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2652 set_const_flag_1 (alias
, set_const
, looping
, &changed
);
2658 /* Info used by set_pure_flag_1. */
2660 struct set_pure_flag_info
2667 /* Worker to set_pure_flag. */
2670 set_pure_flag_1 (cgraph_node
*node
, void *data
)
2672 struct set_pure_flag_info
*info
= (struct set_pure_flag_info
*)data
;
2673 /* Static constructors and destructors without a side effect can be
2675 if (info
->pure
&& !info
->looping
)
2677 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2679 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2680 info
->changed
= true;
2682 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2684 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2685 info
->changed
= true;
2690 if (!DECL_PURE_P (node
->decl
) && !TREE_READONLY (node
->decl
))
2692 DECL_PURE_P (node
->decl
) = true;
2693 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = info
->looping
;
2694 info
->changed
= true;
2696 else if (DECL_LOOPING_CONST_OR_PURE_P (node
->decl
)
2699 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2700 info
->changed
= true;
2705 if (DECL_PURE_P (node
->decl
))
2707 DECL_PURE_P (node
->decl
) = false;
2708 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2709 info
->changed
= true;
2715 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2718 When setting the flag, be careful about possible interposition.
2719 Return true if any change was done. */
2722 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2724 struct set_pure_flag_info info
= {pure
, looping
, false};
2727 call_for_symbol_thunks_and_aliases (set_pure_flag_1
, &info
, !pure
, true);
2728 return info
.changed
;
2731 /* Return true when cgraph_node can not return or throw and thus
2732 it is safe to ignore its side effects for IPA analysis. */
2735 cgraph_node::cannot_return_p (void)
2737 int flags
= flags_from_decl_or_type (decl
);
2738 if (!opt_for_fn (decl
, flag_exceptions
))
2739 return (flags
& ECF_NORETURN
) != 0;
2741 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2742 == (ECF_NORETURN
| ECF_NOTHROW
));
2745 /* Return true when call of edge can not lead to return from caller
2746 and thus it is safe to ignore its side effects for IPA analysis
2747 when computing side effects of the caller.
2748 FIXME: We could actually mark all edges that have no reaching
2749 patch to the exit block or throw to get better results. */
2751 cgraph_edge::cannot_lead_to_return_p (void)
2753 if (caller
->cannot_return_p ())
2755 if (indirect_unknown_callee
)
2757 int flags
= indirect_info
->ecf_flags
;
2758 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2759 return (flags
& ECF_NORETURN
) != 0;
2761 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2762 == (ECF_NORETURN
| ECF_NOTHROW
));
2765 return callee
->cannot_return_p ();
2768 /* Return true if the call can be hot. */
2771 cgraph_edge::maybe_hot_p (void)
2773 if (!maybe_hot_count_p (NULL
, count
))
2775 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2777 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2779 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2781 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2783 if (opt_for_fn (caller
->decl
, optimize_size
))
2785 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2787 /* If profile is now known yet, be conservative.
2788 FIXME: this predicate is used by early inliner and can do better there. */
2789 if (symtab
->state
< IPA_SSA
)
2791 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2792 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2794 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2796 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2797 || frequency
<= (CGRAPH_FREQ_BASE
2798 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2804 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2807 nonremovable_p (cgraph_node
*node
, void *)
2809 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2812 /* Return true if whole comdat group can be removed if there are no direct
2816 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2818 struct ipa_ref
*ref
;
2820 /* For local symbols or non-comdat group it is the same as
2821 can_remove_if_no_direct_calls_p. */
2822 if (!externally_visible
|| !same_comdat_group
)
2824 if (DECL_EXTERNAL (decl
))
2828 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2831 if (will_inline
&& address_taken
)
2834 /* Otheriwse check if we can remove the symbol itself and then verify
2835 that only uses of the comdat groups are direct call to THIS
2837 if (!can_remove_if_no_direct_calls_and_refs_p ())
2840 /* Check that all refs come from within the comdat group. */
2841 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2842 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2845 struct cgraph_node
*target
= ultimate_alias_target ();
2846 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2847 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2849 if (!externally_visible
)
2852 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2855 /* If we see different symbol than THIS, be sure to check calls. */
2856 if (next
->ultimate_alias_target () != target
)
2857 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2858 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2862 /* If function is not being inlined, we care only about
2863 references outside of the comdat group. */
2865 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2866 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2872 /* Return true when function cgraph_node can be expected to be removed
2873 from program when direct calls in this compilation unit are removed.
2875 As a special case COMDAT functions are
2876 cgraph_can_remove_if_no_direct_calls_p while the are not
2877 cgraph_only_called_directly_p (it is possible they are called from other
2880 This function behaves as cgraph_only_called_directly_p because eliminating
2881 all uses of COMDAT function does not make it necessarily disappear from
2882 the program unless we are compiling whole program or we do LTO. In this
2883 case we know we win since dynamic linking will not really discard the
2884 linkonce section. */
2887 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2890 gcc_assert (!global
.inlined_to
);
2891 if (DECL_EXTERNAL (decl
))
2894 if (!in_lto_p
&& !flag_whole_program
)
2896 /* If the symbol is in comdat group, we need to verify that whole comdat
2897 group becomes unreachable. Technically we could skip references from
2898 within the group, too. */
2899 if (!only_called_directly_p ())
2901 if (same_comdat_group
&& externally_visible
)
2903 struct cgraph_node
*target
= ultimate_alias_target ();
2905 if (will_inline
&& address_taken
)
2907 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2909 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2911 if (!externally_visible
)
2914 && !next
->only_called_directly_p ())
2917 /* If we see different symbol than THIS,
2918 be sure to check calls. */
2919 if (next
->ultimate_alias_target () != target
)
2920 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2921 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2929 return can_remove_if_no_direct_calls_p (will_inline
);
2933 /* Worker for cgraph_only_called_directly_p. */
2936 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2938 return !node
->only_called_directly_or_aliased_p ();
2941 /* Return true when function cgraph_node and all its aliases are only called
2943 i.e. it is not externally visible, address was not taken and
2944 it is not used in any other non-standard way. */
2947 cgraph_node::only_called_directly_p (void)
2949 gcc_assert (ultimate_alias_target () == this);
2950 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2955 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2958 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2960 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2962 enum availability avail
;
2963 node
->ultimate_alias_target (&avail
);
2965 if (avail
> AVAIL_INTERPOSABLE
)
2966 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2967 if (!cs
->indirect_inlining_edge
2968 && !cs
->caller
->thunk
.thunk_p
)
2969 redirect_callers
->safe_push (cs
);
2973 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2974 cgraph_node (i.e. are not overwritable). */
2977 cgraph_node::collect_callers (void)
2979 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2980 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2981 &redirect_callers
, false);
2982 return redirect_callers
;
2985 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2988 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2990 bool skipped_thunk
= false;
2991 node
= node
->ultimate_alias_target ();
2992 node2
= node2
->ultimate_alias_target ();
2994 /* There are no virtual clones of thunks so check former_clone_of or if we
2995 might have skipped thunks because this adjustments are no longer
2997 while (node
->thunk
.thunk_p
)
2999 if (node2
->former_clone_of
== node
->decl
)
3001 if (!node
->thunk
.this_adjusting
)
3003 node
= node
->callees
->callee
->ultimate_alias_target ();
3004 skipped_thunk
= true;
3009 if (!node2
->clone
.args_to_skip
3010 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
3012 if (node2
->former_clone_of
== node
->decl
)
3014 else if (!node2
->clone_of
)
3018 while (node
!= node2
&& node2
)
3019 node2
= node2
->clone_of
;
3020 return node2
!= NULL
;
3023 /* Verify edge count and frequency. */
3026 cgraph_edge::verify_count_and_frequency ()
3028 bool error_found
= false;
3031 error ("caller edge count is negative");
3036 error ("caller edge frequency is negative");
3039 if (frequency
> CGRAPH_FREQ_MAX
)
3041 error ("caller edge frequency is too large");
3047 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
3049 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
3051 bool fndecl_was_null
= false;
3052 /* debug_gimple_stmt needs correct cfun */
3053 if (cfun
!= this_cfun
)
3054 set_cfun (this_cfun
);
3055 /* ...and an actual current_function_decl */
3056 if (!current_function_decl
)
3058 current_function_decl
= this_cfun
->decl
;
3059 fndecl_was_null
= true;
3061 debug_gimple_stmt (stmt
);
3062 if (fndecl_was_null
)
3063 current_function_decl
= NULL
;
3066 /* Verify that call graph edge corresponds to DECL from the associated
3067 statement. Return true if the verification should fail. */
3070 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
3074 if (!decl
|| callee
->global
.inlined_to
)
3076 if (symtab
->state
== LTO_STREAMING
)
3078 node
= cgraph_node::get (decl
);
3080 /* We do not know if a node from a different partition is an alias or what it
3081 aliases and therefore cannot do the former_clone_of check reliably. When
3082 body_removed is set, we have lost all information about what was alias or
3083 thunk of and also cannot proceed. */
3085 || node
->body_removed
3086 || node
->in_other_partition
3087 || callee
->icf_merged
3088 || callee
->in_other_partition
)
3091 node
= node
->ultimate_alias_target ();
3093 /* Optimizers can redirect unreachable calls or calls triggering undefined
3094 behavior to builtin_unreachable. */
3095 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
3096 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
3099 if (callee
->former_clone_of
!= node
->decl
3100 && (node
!= callee
->ultimate_alias_target ())
3101 && !clone_of_p (node
, callee
))
3107 /* Verify cgraph nodes of given cgraph node. */
3109 cgraph_node::verify_node (void)
3112 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
3113 basic_block this_block
;
3114 gimple_stmt_iterator gsi
;
3115 bool error_found
= false;
3120 timevar_push (TV_CGRAPH_VERIFY
);
3121 error_found
|= verify_base ();
3122 for (e
= callees
; e
; e
= e
->next_callee
)
3125 error ("aux field set for edge %s->%s",
3126 identifier_to_locale (e
->caller
->name ()),
3127 identifier_to_locale (e
->callee
->name ()));
3132 error ("execution count is negative");
3135 if (global
.inlined_to
&& same_comdat_group
)
3137 error ("inline clone in same comdat group list");
3140 if (!definition
&& !in_other_partition
&& local
.local
)
3142 error ("local symbols must be defined");
3145 if (global
.inlined_to
&& externally_visible
)
3147 error ("externally visible inline clone");
3150 if (global
.inlined_to
&& address_taken
)
3152 error ("inline clone with address taken");
3155 if (global
.inlined_to
&& force_output
)
3157 error ("inline clone is forced to output");
3160 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3164 error ("aux field set for indirect edge from %s",
3165 identifier_to_locale (e
->caller
->name ()));
3168 if (!e
->indirect_unknown_callee
3169 || !e
->indirect_info
)
3171 error ("An indirect edge from %s is not marked as indirect or has "
3172 "associated indirect_info, the corresponding statement is: ",
3173 identifier_to_locale (e
->caller
->name ()));
3174 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3178 bool check_comdat
= comdat_local_p ();
3179 for (e
= callers
; e
; e
= e
->next_caller
)
3181 if (e
->verify_count_and_frequency ())
3184 && !in_same_comdat_group_p (e
->caller
))
3186 error ("comdat-local function called by %s outside its comdat",
3187 identifier_to_locale (e
->caller
->name ()));
3190 if (!e
->inline_failed
)
3192 if (global
.inlined_to
3193 != (e
->caller
->global
.inlined_to
3194 ? e
->caller
->global
.inlined_to
: e
->caller
))
3196 error ("inlined_to pointer is wrong");
3199 if (callers
->next_caller
)
3201 error ("multiple inline callers");
3206 if (global
.inlined_to
)
3208 error ("inlined_to pointer set for noninline callers");
3212 for (e
= callees
; e
; e
= e
->next_callee
)
3214 if (e
->verify_count_and_frequency ())
3216 if (gimple_has_body_p (e
->caller
->decl
)
3217 && !e
->caller
->global
.inlined_to
3219 /* Optimized out calls are redirected to __builtin_unreachable. */
3221 || ! e
->callee
->decl
3222 || DECL_BUILT_IN_CLASS (e
->callee
->decl
) != BUILT_IN_NORMAL
3223 || DECL_FUNCTION_CODE (e
->callee
->decl
) != BUILT_IN_UNREACHABLE
)
3225 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3226 gimple_bb (e
->call_stmt
))))
3228 error ("caller edge frequency %i does not match BB frequency %i",
3230 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3231 gimple_bb (e
->call_stmt
)));
3235 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3237 if (e
->verify_count_and_frequency ())
3239 if (gimple_has_body_p (e
->caller
->decl
)
3240 && !e
->caller
->global
.inlined_to
3243 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3244 gimple_bb (e
->call_stmt
))))
3246 error ("indirect call frequency %i does not match BB frequency %i",
3248 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3249 gimple_bb (e
->call_stmt
)));
3253 if (!callers
&& global
.inlined_to
)
3255 error ("inlined_to pointer is set but no predecessors found");
3258 if (global
.inlined_to
== this)
3260 error ("inlined_to pointer refers to itself");
3267 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
3272 error ("cgraph_node has wrong clone_of");
3279 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
3280 if (n
->clone_of
!= this)
3284 error ("cgraph_node has wrong clone list");
3288 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
3290 error ("cgraph_node is in clone list but it is not clone");
3293 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
3295 error ("cgraph_node has wrong prev_clone pointer");
3298 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
3300 error ("double linked list of clones corrupted");
3304 if (analyzed
&& alias
)
3306 bool ref_found
= false;
3308 ipa_ref
*ref
= NULL
;
3312 error ("Alias has call edges");
3315 for (i
= 0; iterate_reference (i
, ref
); i
++)
3316 if (ref
->use
== IPA_REF_CHKP
)
3318 else if (ref
->use
!= IPA_REF_ALIAS
)
3320 error ("Alias has non-alias reference");
3325 error ("Alias has more than one alias reference");
3332 error ("Analyzed alias has no reference");
3337 /* Check instrumented version reference. */
3338 if (instrumented_version
3339 && instrumented_version
->instrumented_version
!= this)
3341 error ("Instrumentation clone does not reference original node");
3345 /* Cannot have orig_decl for not instrumented nodes. */
3346 if (!instrumentation_clone
&& orig_decl
)
3348 error ("Not instrumented node has non-NULL original declaration");
3352 /* If original not instrumented node still exists then we may check
3353 original declaration is set properly. */
3354 if (instrumented_version
3356 && orig_decl
!= instrumented_version
->decl
)
3358 error ("Instrumented node has wrong original declaration");
3362 /* Check all nodes have chkp reference to their instrumented versions. */
3364 && instrumented_version
3365 && !instrumentation_clone
)
3367 bool ref_found
= false;
3369 struct ipa_ref
*ref
;
3371 for (i
= 0; iterate_reference (i
, ref
); i
++)
3372 if (ref
->use
== IPA_REF_CHKP
)
3376 error ("Node has more than one chkp reference");
3379 if (ref
->referred
!= instrumented_version
)
3381 error ("Wrong node is referenced with chkp reference");
3389 error ("Analyzed node has no reference to instrumented version");
3394 if (instrumentation_clone
3395 && DECL_BUILT_IN_CLASS (decl
) == NOT_BUILT_IN
)
3397 tree name
= DECL_ASSEMBLER_NAME (decl
);
3398 tree orig_name
= DECL_ASSEMBLER_NAME (orig_decl
);
3400 if (!IDENTIFIER_TRANSPARENT_ALIAS (name
)
3401 || TREE_CHAIN (name
) != orig_name
)
3403 error ("Alias chain for instrumented node is broken");
3408 if (analyzed
&& thunk
.thunk_p
)
3412 error ("No edge out of thunk node");
3415 else if (callees
->next_callee
)
3417 error ("More than one edge out of thunk node");
3420 if (gimple_has_body_p (decl
) && !global
.inlined_to
)
3422 error ("Thunk is not supposed to have body");
3425 if (thunk
.add_pointer_bounds_args
3426 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3428 error ("Instrumentation thunk has wrong edge callee");
3432 else if (analyzed
&& gimple_has_body_p (decl
)
3433 && !TREE_ASM_WRITTEN (decl
)
3434 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3439 hash_set
<gimple
*> stmts
;
3441 ipa_ref
*ref
= NULL
;
3443 /* Reach the trees by walking over the CFG, and note the
3444 enclosing basic-blocks in the call edges. */
3445 FOR_EACH_BB_FN (this_block
, this_cfun
)
3447 for (gsi
= gsi_start_phis (this_block
);
3448 !gsi_end_p (gsi
); gsi_next (&gsi
))
3449 stmts
.add (gsi_stmt (gsi
));
3450 for (gsi
= gsi_start_bb (this_block
);
3454 gimple
*stmt
= gsi_stmt (gsi
);
3456 if (is_gimple_call (stmt
))
3458 cgraph_edge
*e
= get_edge (stmt
);
3459 tree decl
= gimple_call_fndecl (stmt
);
3464 error ("shared call_stmt:");
3465 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3468 if (!e
->indirect_unknown_callee
)
3470 if (e
->verify_corresponds_to_fndecl (decl
))
3472 error ("edge points to wrong declaration:");
3473 debug_tree (e
->callee
->decl
);
3474 fprintf (stderr
," Instead of:");
3481 error ("an indirect edge with unknown callee "
3482 "corresponding to a call_stmt with "
3483 "a known declaration:");
3485 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3491 error ("missing callgraph edge for call stmt:");
3492 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3498 for (i
= 0; iterate_reference (i
, ref
); i
++)
3499 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3501 error ("reference to dead statement");
3502 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3507 /* No CFG available?! */
3510 for (e
= callees
; e
; e
= e
->next_callee
)
3514 error ("edge %s->%s has no corresponding call_stmt",
3515 identifier_to_locale (e
->caller
->name ()),
3516 identifier_to_locale (e
->callee
->name ()));
3517 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3522 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3524 if (!e
->aux
&& !e
->speculative
)
3526 error ("an indirect edge from %s has no corresponding call_stmt",
3527 identifier_to_locale (e
->caller
->name ()));
3528 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3537 internal_error ("verify_cgraph_node failed");
3539 timevar_pop (TV_CGRAPH_VERIFY
);
3542 /* Verify whole cgraph structure. */
3544 cgraph_node::verify_cgraph_nodes (void)
3551 FOR_EACH_FUNCTION (node
)
3555 /* Walk the alias chain to return the function cgraph_node is alias of.
3556 Walk through thunks, too.
3557 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3558 When REF is non-NULL, assume that reference happens in symbol REF
3559 when determining the availability. */
3562 cgraph_node::function_symbol (enum availability
*availability
,
3563 struct symtab_node
*ref
)
3565 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3567 while (node
->thunk
.thunk_p
)
3570 node
= node
->callees
->callee
;
3573 enum availability a
;
3574 a
= node
->get_availability (ref
);
3575 if (a
< *availability
)
3578 node
= node
->ultimate_alias_target (availability
, ref
);
3583 /* Walk the alias chain to return the function cgraph_node is alias of.
3584 Walk through non virtual thunks, too. Thus we return either a function
3585 or a virtual thunk node.
3586 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3587 When REF is non-NULL, assume that reference happens in symbol REF
3588 when determining the availability. */
3591 cgraph_node::function_or_virtual_thunk_symbol
3592 (enum availability
*availability
,
3593 struct symtab_node
*ref
)
3595 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3597 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3600 node
= node
->callees
->callee
;
3603 enum availability a
;
3604 a
= node
->get_availability (ref
);
3605 if (a
< *availability
)
3608 node
= node
->ultimate_alias_target (availability
, ref
);
3613 /* When doing LTO, read cgraph_node's body from disk if it is not already
3617 cgraph_node::get_untransformed_body (void)
3619 lto_file_decl_data
*file_data
;
3620 const char *data
, *name
;
3622 tree decl
= this->decl
;
3624 /* Check if body is already there. Either we have gimple body or
3625 the function is thunk and in that case we set DECL_ARGUMENTS. */
3626 if (DECL_ARGUMENTS (decl
) || gimple_has_body_p (decl
))
3629 gcc_assert (in_lto_p
&& !DECL_RESULT (decl
));
3631 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3633 file_data
= lto_file_data
;
3634 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3636 /* We may have renamed the declaration, e.g., a static function. */
3637 name
= lto_get_decl_name_mapping (file_data
, name
);
3638 struct lto_in_decl_state
*decl_state
3639 = lto_get_function_in_decl_state (file_data
, decl
);
3641 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3642 name
, &len
, decl_state
->compressed
);
3644 fatal_error (input_location
, "%s: section %s is missing",
3645 file_data
->file_name
,
3648 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3650 lto_input_function_body (file_data
, this, data
);
3651 lto_stats
.num_function_bodies
++;
3652 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3653 data
, len
, decl_state
->compressed
);
3654 lto_free_function_in_decl_state_for_node (this);
3655 /* Keep lto file data so ipa-inline-analysis knows about cross module
3658 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3663 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3664 if it is not already present. When some IPA transformations are scheduled,
3668 cgraph_node::get_body (void)
3672 updated
= get_untransformed_body ();
3674 /* Getting transformed body makes no sense for inline clones;
3675 we should never use this on real clones because they are materialized
3677 TODO: Materializing clones here will likely lead to smaller LTRANS
3679 gcc_assert (!global
.inlined_to
&& !clone_of
);
3680 if (ipa_transforms_to_apply
.exists ())
3682 opt_pass
*saved_current_pass
= current_pass
;
3683 FILE *saved_dump_file
= dump_file
;
3684 const char *saved_dump_file_name
= dump_file_name
;
3685 dump_flags_t saved_dump_flags
= dump_flags
;
3686 dump_file_name
= NULL
;
3689 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3690 execute_all_ipa_transforms ();
3691 cgraph_edge::rebuild_edges ();
3692 free_dominance_info (CDI_DOMINATORS
);
3693 free_dominance_info (CDI_POST_DOMINATORS
);
3697 current_pass
= saved_current_pass
;
3698 dump_file
= saved_dump_file
;
3699 dump_file_name
= saved_dump_file_name
;
3700 dump_flags
= saved_dump_flags
;
3705 /* Return the DECL_STRUCT_FUNCTION of the function. */
3708 cgraph_node::get_fun (void)
3710 cgraph_node
*node
= this;
3711 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3713 while (!fun
&& node
->clone_of
)
3715 node
= node
->clone_of
;
3716 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3722 /* Verify if the type of the argument matches that of the function
3723 declaration. If we cannot verify this or there is a mismatch,
3727 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3730 unsigned int i
, nargs
;
3732 /* Calls to internal functions always match their signature. */
3733 if (gimple_call_internal_p (stmt
))
3736 nargs
= gimple_call_num_args (stmt
);
3738 /* Get argument types for verification. */
3740 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3742 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3744 /* Verify if the type of the argument matches that of the function
3745 declaration. If we cannot verify this or there is a mismatch,
3747 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3749 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3751 i
++, p
= DECL_CHAIN (p
))
3754 /* We cannot distinguish a varargs function from the case
3755 of excess parameters, still deferring the inlining decision
3756 to the callee is possible. */
3759 arg
= gimple_call_arg (stmt
, i
);
3760 if (p
== error_mark_node
3761 || DECL_ARG_TYPE (p
) == error_mark_node
3762 || arg
== error_mark_node
3763 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3764 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3767 if (args_count_match
&& p
)
3772 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3775 /* If this is a varargs function defer inlining decision
3779 arg
= gimple_call_arg (stmt
, i
);
3780 if (TREE_VALUE (p
) == error_mark_node
3781 || arg
== error_mark_node
3782 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3783 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3784 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3796 /* Verify if the type of the argument and lhs of CALL_STMT matches
3797 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3798 true, the arg count needs to be the same.
3799 If we cannot verify this or there is a mismatch, return false. */
3802 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3803 bool args_count_match
)
3807 if ((DECL_RESULT (callee
)
3808 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3809 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3810 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3812 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3813 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3818 /* Reset all state within cgraph.c so that we can rerun the compiler
3819 within the same process. For use by toplev::finalize. */
3822 cgraph_c_finalize (void)
3826 x_cgraph_nodes_queue
= NULL
;
3828 cgraph_fnver_htab
= NULL
;
3829 version_info_node
= NULL
;
3832 /* A wroker for call_for_symbol_and_aliases. */
3835 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3838 bool include_overwritable
)
3841 FOR_EACH_ALIAS (this, ref
)
3843 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3844 if (include_overwritable
3845 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3846 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3847 include_overwritable
))
3853 /* Return true if NODE has thunk. */
3856 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3858 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3859 if (e
->caller
->thunk
.thunk_p
)
3864 #include "gt-cgraph.h"