1 /* Callgraph handling code.
2 Copyright (C) 2003-2016 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file contains basic routines manipulating call graph
23 The call-graph is a data structure designed for intra-procedural optimization.
24 It represents a multi-graph where nodes are functions and edges are call sites. */
28 #include "coretypes.h"
35 #include "alloc-pool.h"
36 #include "gimple-ssa.h"
38 #include "lto-streamer.h"
39 #include "fold-const.h"
42 #include "print-tree.h"
43 #include "langhooks.h"
46 #include "gimple-iterator.h"
49 #include "value-prof.h"
50 #include "ipa-utils.h"
51 #include "symbol-summary.h"
53 #include "ipa-inline.h"
55 #include "gimple-pretty-print.h"
59 #include "tree-chkp.h"
63 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
64 #include "tree-pass.h"
66 /* Queue of cgraph nodes scheduled to be lowered. */
67 symtab_node
*x_cgraph_nodes_queue
;
68 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
70 /* Symbol table global context. */
73 /* List of hooks triggered on cgraph_edge events. */
74 struct cgraph_edge_hook_list
{
75 cgraph_edge_hook hook
;
77 struct cgraph_edge_hook_list
*next
;
80 /* List of hooks triggered on cgraph_node events. */
81 struct cgraph_node_hook_list
{
82 cgraph_node_hook hook
;
84 struct cgraph_node_hook_list
*next
;
87 /* List of hooks triggered on events involving two cgraph_edges. */
88 struct cgraph_2edge_hook_list
{
89 cgraph_2edge_hook hook
;
91 struct cgraph_2edge_hook_list
*next
;
94 /* List of hooks triggered on events involving two cgraph_nodes. */
95 struct cgraph_2node_hook_list
{
96 cgraph_2node_hook hook
;
98 struct cgraph_2node_hook_list
*next
;
101 /* Hash descriptor for cgraph_function_version_info. */
103 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
105 static hashval_t
hash (cgraph_function_version_info
*);
106 static bool equal (cgraph_function_version_info
*,
107 cgraph_function_version_info
*);
110 /* Map a cgraph_node to cgraph_function_version_info using this htab.
111 The cgraph_function_version_info has a THIS_NODE field that is the
112 corresponding cgraph_node.. */
114 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
116 /* Hash function for cgraph_fnver_htab. */
118 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
120 int uid
= ptr
->this_node
->uid
;
121 return (hashval_t
)(uid
);
124 /* eq function for cgraph_fnver_htab. */
126 function_version_hasher::equal (cgraph_function_version_info
*n1
,
127 cgraph_function_version_info
*n2
)
129 return n1
->this_node
->uid
== n2
->this_node
->uid
;
132 /* Mark as GC root all allocated nodes. */
133 static GTY(()) struct cgraph_function_version_info
*
134 version_info_node
= NULL
;
136 /* Return true if NODE's address can be compared. */
139 symtab_node::address_can_be_compared_p ()
141 /* Address of virtual tables and functions is never compared. */
142 if (DECL_VIRTUAL_P (decl
))
144 /* Address of C++ cdtors is never compared. */
145 if (is_a
<cgraph_node
*> (this)
146 && (DECL_CXX_CONSTRUCTOR_P (decl
)
147 || DECL_CXX_DESTRUCTOR_P (decl
)))
149 /* Constant pool symbols addresses are never compared.
150 flag_merge_constants permits us to assume the same on readonly vars. */
151 if (is_a
<varpool_node
*> (this)
152 && (DECL_IN_CONSTANT_POOL (decl
)
153 || (flag_merge_constants
>= 2
154 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
159 /* Get the cgraph_function_version_info node corresponding to node. */
160 cgraph_function_version_info
*
161 cgraph_node::function_version (void)
163 cgraph_function_version_info key
;
164 key
.this_node
= this;
166 if (cgraph_fnver_htab
== NULL
)
169 return cgraph_fnver_htab
->find (&key
);
172 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
173 corresponding to cgraph_node NODE. */
174 cgraph_function_version_info
*
175 cgraph_node::insert_new_function_version (void)
177 version_info_node
= NULL
;
178 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
179 version_info_node
->this_node
= this;
181 if (cgraph_fnver_htab
== NULL
)
182 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
184 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
186 return version_info_node
;
189 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
190 DECL is a duplicate declaration. */
192 cgraph_node::delete_function_version (tree decl
)
194 cgraph_node
*decl_node
= cgraph_node::get (decl
);
195 cgraph_function_version_info
*decl_v
= NULL
;
197 if (decl_node
== NULL
)
200 decl_v
= decl_node
->function_version ();
205 if (decl_v
->prev
!= NULL
)
206 decl_v
->prev
->next
= decl_v
->next
;
208 if (decl_v
->next
!= NULL
)
209 decl_v
->next
->prev
= decl_v
->prev
;
211 if (cgraph_fnver_htab
!= NULL
)
212 cgraph_fnver_htab
->remove_elt (decl_v
);
214 decl_node
->remove ();
217 /* Record that DECL1 and DECL2 are semantically identical function
220 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
222 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
223 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
224 cgraph_function_version_info
*decl1_v
= NULL
;
225 cgraph_function_version_info
*decl2_v
= NULL
;
226 cgraph_function_version_info
*before
;
227 cgraph_function_version_info
*after
;
229 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
230 decl1_v
= decl1_node
->function_version ();
231 decl2_v
= decl2_node
->function_version ();
233 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
237 decl1_v
= decl1_node
->insert_new_function_version ();
240 decl2_v
= decl2_node
->insert_new_function_version ();
242 /* Chain decl2_v and decl1_v. All semantically identical versions
243 will be chained together. */
248 while (before
->next
!= NULL
)
249 before
= before
->next
;
251 while (after
->prev
!= NULL
)
254 before
->next
= after
;
255 after
->prev
= before
;
258 /* Initialize callgraph dump file. */
261 symbol_table::initialize (void)
264 dump_file
= dump_begin (TDI_cgraph
, NULL
);
267 /* Allocate new callgraph node and insert it into basic data structures. */
270 symbol_table::create_empty (void)
272 cgraph_node
*node
= allocate_cgraph_symbol ();
274 node
->type
= SYMTAB_FUNCTION
;
275 node
->frequency
= NODE_FREQUENCY_NORMAL
;
276 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
282 /* Register HOOK to be called with DATA on each removed edge. */
283 cgraph_edge_hook_list
*
284 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
286 cgraph_edge_hook_list
*entry
;
287 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
289 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
299 /* Remove ENTRY from the list of hooks called on removing edges. */
301 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
303 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
305 while (*ptr
!= entry
)
311 /* Call all edge removal hooks. */
313 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
315 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
318 entry
->hook (e
, entry
->data
);
323 /* Register HOOK to be called with DATA on each removed node. */
324 cgraph_node_hook_list
*
325 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
327 cgraph_node_hook_list
*entry
;
328 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
330 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
340 /* Remove ENTRY from the list of hooks called on removing nodes. */
342 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
344 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
346 while (*ptr
!= entry
)
352 /* Call all node removal hooks. */
354 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
356 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
359 entry
->hook (node
, entry
->data
);
364 /* Call all node removal hooks. */
366 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
368 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
371 entry
->hook (node
, entry
->data
);
377 /* Register HOOK to be called with DATA on each inserted node. */
378 cgraph_node_hook_list
*
379 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
381 cgraph_node_hook_list
*entry
;
382 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
384 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
394 /* Remove ENTRY from the list of hooks called on inserted nodes. */
396 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
398 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
400 while (*ptr
!= entry
)
406 /* Register HOOK to be called with DATA on each duplicated edge. */
407 cgraph_2edge_hook_list
*
408 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
410 cgraph_2edge_hook_list
*entry
;
411 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
413 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
423 /* Remove ENTRY from the list of hooks called on duplicating edges. */
425 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
427 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
429 while (*ptr
!= entry
)
435 /* Call all edge duplication hooks. */
437 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
439 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
442 entry
->hook (cs1
, cs2
, entry
->data
);
447 /* Register HOOK to be called with DATA on each duplicated node. */
448 cgraph_2node_hook_list
*
449 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
451 cgraph_2node_hook_list
*entry
;
452 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
454 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
464 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
466 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
468 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
470 while (*ptr
!= entry
)
476 /* Call all node duplication hooks. */
478 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
481 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
484 entry
->hook (node
, node2
, entry
->data
);
489 /* Return cgraph node assigned to DECL. Create new one when needed. */
492 cgraph_node::create (tree decl
)
494 cgraph_node
*node
= symtab
->create_empty ();
495 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
499 if ((flag_openacc
|| flag_openmp
)
500 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
502 node
->offloadable
= 1;
503 if (ENABLE_OFFLOADING
)
504 g
->have_offload
= true;
507 node
->register_symbol ();
509 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
511 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
512 node
->next_nested
= node
->origin
->nested
;
513 node
->origin
->nested
= node
;
518 /* Try to find a call graph node for declaration DECL and if it does not exist
519 or if it corresponds to an inline clone, create a new one. */
522 cgraph_node::get_create (tree decl
)
524 cgraph_node
*first_clone
= cgraph_node::get (decl
);
526 if (first_clone
&& !first_clone
->global
.inlined_to
)
529 cgraph_node
*node
= cgraph_node::create (decl
);
532 first_clone
->clone_of
= node
;
533 node
->clones
= first_clone
;
534 symtab
->symtab_prevail_in_asm_name_hash (node
);
535 node
->decl
->decl_with_vis
.symtab_node
= node
;
537 fprintf (dump_file
, "Introduced new external node "
538 "(%s/%i) and turned into root of the clone tree.\n",
539 node
->name (), node
->order
);
542 fprintf (dump_file
, "Introduced new external node "
543 "(%s/%i).\n", node
->name (), node
->order
);
547 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
548 the function body is associated with (not necessarily cgraph_node (DECL). */
551 cgraph_node::create_alias (tree alias
, tree target
)
553 cgraph_node
*alias_node
;
555 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
556 || TREE_CODE (target
) == IDENTIFIER_NODE
);
557 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
558 alias_node
= cgraph_node::get_create (alias
);
559 gcc_assert (!alias_node
->definition
);
560 alias_node
->alias_target
= target
;
561 alias_node
->definition
= true;
562 alias_node
->alias
= true;
563 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
564 alias_node
->transparent_alias
= alias_node
->weakref
= true;
568 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
570 Same body aliases are output whenever the body of DECL is output,
571 and cgraph_node::get (ALIAS) transparently returns
572 cgraph_node::get (DECL). */
575 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
578 #ifndef ASM_OUTPUT_DEF
579 /* If aliases aren't supported by the assembler, fail. */
582 /* Langhooks can create same body aliases of symbols not defined.
583 Those are useless. Drop them on the floor. */
584 if (symtab
->global_info_ready
)
587 n
= cgraph_node::create_alias (alias
, decl
);
588 n
->cpp_implicit_alias
= true;
589 if (symtab
->cpp_implicit_aliases_done
)
590 n
->resolve_alias (cgraph_node::get (decl
));
594 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
595 aliases DECL with an adjustments made into the first parameter.
596 See comments in thunk_adjust for detail on the parameters. */
599 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
600 HOST_WIDE_INT fixed_offset
,
601 HOST_WIDE_INT virtual_value
,
607 node
= cgraph_node::get (alias
);
611 node
= cgraph_node::create (alias
);
612 gcc_checking_assert (!virtual_offset
613 || wi::eq_p (virtual_offset
, virtual_value
));
614 node
->thunk
.fixed_offset
= fixed_offset
;
615 node
->thunk
.this_adjusting
= this_adjusting
;
616 node
->thunk
.virtual_value
= virtual_value
;
617 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
618 node
->thunk
.alias
= real_alias
;
619 node
->thunk
.thunk_p
= true;
620 node
->definition
= true;
625 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
626 Return NULL if there's no such node. */
629 cgraph_node::get_for_asmname (tree asmname
)
631 /* We do not want to look at inline clones. */
632 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
634 node
= node
->next_sharing_asm_name
)
636 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
637 if (cn
&& !cn
->global
.inlined_to
)
643 /* Returns a hash value for X (which really is a cgraph_edge). */
646 cgraph_edge_hasher::hash (cgraph_edge
*e
)
648 /* This is a really poor hash function, but it is what htab_hash_pointer
650 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
653 /* Returns a hash value for X (which really is a cgraph_edge). */
656 cgraph_edge_hasher::hash (gimple
*call_stmt
)
658 /* This is a really poor hash function, but it is what htab_hash_pointer
660 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
663 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
666 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
668 return x
->call_stmt
== y
;
671 /* Add call graph edge E to call site hash of its caller. */
674 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
676 gimple
*call
= e
->call_stmt
;
677 *e
->caller
->call_site_hash
->find_slot_with_hash
678 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
681 /* Add call graph edge E to call site hash of its caller. */
684 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
686 /* There are two speculative edges for every statement (one direct,
687 one indirect); always hash the direct one. */
688 if (e
->speculative
&& e
->indirect_unknown_callee
)
690 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
691 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
694 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
699 gcc_assert (!*slot
|| e
->speculative
);
703 /* Return the callgraph edge representing the GIMPLE_CALL statement
707 cgraph_node::get_edge (gimple
*call_stmt
)
713 return call_site_hash
->find_with_hash
714 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
716 /* This loop may turn out to be performance problem. In such case adding
717 hashtables into call nodes with very many edges is probably best
718 solution. It is not good idea to add pointer into CALL_EXPR itself
719 because we want to make possible having multiple cgraph nodes representing
720 different clones of the same body before the body is actually cloned. */
721 for (e
= callees
; e
; e
= e
->next_callee
)
723 if (e
->call_stmt
== call_stmt
)
729 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
731 if (e
->call_stmt
== call_stmt
)
738 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
739 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
740 cgraph_add_edge_to_call_site_hash (e2
);
741 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
742 cgraph_add_edge_to_call_site_hash (e2
);
749 /* Change field call_stmt of edge to NEW_STMT.
750 If UPDATE_SPECULATIVE and E is any component of speculative
751 edge, then update all components. */
754 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
758 /* Speculative edges has three component, update all of them
760 if (update_speculative
&& speculative
)
762 cgraph_edge
*direct
, *indirect
;
765 speculative_call_info (direct
, indirect
, ref
);
766 direct
->set_call_stmt (new_stmt
, false);
767 indirect
->set_call_stmt (new_stmt
, false);
768 ref
->stmt
= new_stmt
;
772 /* Only direct speculative edges go to call_site_hash. */
773 if (caller
->call_site_hash
774 && (!speculative
|| !indirect_unknown_callee
))
776 caller
->call_site_hash
->remove_elt_with_hash
777 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
780 cgraph_edge
*e
= this;
782 call_stmt
= new_stmt
;
783 if (indirect_unknown_callee
784 && (decl
= gimple_call_fndecl (new_stmt
)))
786 /* Constant propagation (and possibly also inlining?) can turn an
787 indirect call into a direct one. */
788 cgraph_node
*new_callee
= cgraph_node::get (decl
);
790 gcc_checking_assert (new_callee
);
791 e
= make_direct (new_callee
);
794 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
795 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
797 if (e
->caller
->call_site_hash
)
798 cgraph_add_edge_to_call_site_hash (e
);
801 /* Allocate a cgraph_edge structure and fill it with data according to the
802 parameters of which only CALLEE can be NULL (when creating an indirect call
806 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
807 gcall
*call_stmt
, gcov_type count
, int freq
,
808 bool indir_unknown_callee
)
812 /* LTO does not actually have access to the call_stmt since these
813 have not been loaded yet. */
816 /* This is a rather expensive check possibly triggering
817 construction of call stmt hashtable. */
819 gcc_checking_assert (!(e
= caller
->get_edge (call_stmt
))
822 gcc_assert (is_gimple_call (call_stmt
));
828 free_edges
= NEXT_FREE_EDGE (edge
);
832 edge
= ggc_alloc
<cgraph_edge
> ();
833 edge
->uid
= edges_max_uid
++;
839 edge
->caller
= caller
;
840 edge
->callee
= callee
;
841 edge
->prev_caller
= NULL
;
842 edge
->next_caller
= NULL
;
843 edge
->prev_callee
= NULL
;
844 edge
->next_callee
= NULL
;
845 edge
->lto_stmt_uid
= 0;
848 gcc_assert (count
>= 0);
849 edge
->frequency
= freq
;
850 gcc_assert (freq
>= 0);
851 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
853 edge
->call_stmt
= call_stmt
;
854 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
855 edge
->can_throw_external
856 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
859 && callee
&& callee
->decl
860 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
863 edge
->inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
864 edge
->call_stmt_cannot_inline_p
= true;
868 edge
->inline_failed
= CIF_FUNCTION_NOT_CONSIDERED
;
869 edge
->call_stmt_cannot_inline_p
= false;
872 edge
->indirect_info
= NULL
;
873 edge
->indirect_inlining_edge
= 0;
874 edge
->speculative
= false;
875 edge
->indirect_unknown_callee
= indir_unknown_callee
;
876 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
877 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
878 edge
->in_polymorphic_cdtor
879 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
882 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
883 if (call_stmt
&& caller
->call_site_hash
)
884 cgraph_add_edge_to_call_site_hash (edge
);
889 /* Create edge from a given function to CALLEE in the cgraph. */
892 cgraph_node::create_edge (cgraph_node
*callee
,
893 gcall
*call_stmt
, gcov_type count
, int freq
)
895 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
898 initialize_inline_failed (edge
);
900 edge
->next_caller
= callee
->callers
;
902 callee
->callers
->prev_caller
= edge
;
903 edge
->next_callee
= callees
;
905 callees
->prev_callee
= edge
;
907 callee
->callers
= edge
;
912 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
914 cgraph_indirect_call_info
*
915 cgraph_allocate_init_indirect_info (void)
917 cgraph_indirect_call_info
*ii
;
919 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
920 ii
->param_index
= -1;
924 /* Create an indirect edge with a yet-undetermined callee where the call
925 statement destination is a formal parameter of the caller with index
929 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
930 gcov_type count
, int freq
,
931 bool compute_indirect_info
)
933 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
937 initialize_inline_failed (edge
);
939 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
940 edge
->indirect_info
->ecf_flags
= ecf_flags
;
941 edge
->indirect_info
->vptr_changed
= true;
943 /* Record polymorphic call info. */
944 if (compute_indirect_info
946 && (target
= gimple_call_fn (call_stmt
))
947 && virtual_method_call_p (target
))
949 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
951 /* Only record types can have virtual calls. */
952 edge
->indirect_info
->polymorphic
= true;
953 edge
->indirect_info
->param_index
= -1;
954 edge
->indirect_info
->otr_token
955 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
956 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
957 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
958 edge
->indirect_info
->context
= context
;
961 edge
->next_callee
= indirect_calls
;
963 indirect_calls
->prev_callee
= edge
;
964 indirect_calls
= edge
;
969 /* Remove the edge from the list of the callees of the caller. */
972 cgraph_edge::remove_caller (void)
975 prev_callee
->next_callee
= next_callee
;
977 next_callee
->prev_callee
= prev_callee
;
980 if (indirect_unknown_callee
)
981 caller
->indirect_calls
= next_callee
;
983 caller
->callees
= next_callee
;
985 if (caller
->call_site_hash
)
986 caller
->call_site_hash
->remove_elt_with_hash
987 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
990 /* Put the edge onto the free list. */
993 symbol_table::free_edge (cgraph_edge
*e
)
997 if (e
->indirect_info
)
998 ggc_free (e
->indirect_info
);
1000 /* Clear out the edge so we do not dangle pointers. */
1001 memset (e
, 0, sizeof (*e
));
1003 NEXT_FREE_EDGE (e
) = free_edges
;
1008 /* Remove the edge in the cgraph. */
1011 cgraph_edge::remove (void)
1013 /* Call all edge removal hooks. */
1014 symtab
->call_edge_removal_hooks (this);
1016 if (!indirect_unknown_callee
)
1017 /* Remove from callers list of the callee. */
1020 /* Remove from callees list of the callers. */
1023 /* Put the edge onto the free list. */
1024 symtab
->free_edge (this);
1027 /* Turn edge into speculative call calling N2. Update
1028 the profile so the direct call is taken COUNT times
1031 At clone materialization time, the indirect call E will
1034 if (call_dest == N2)
1039 At this time the function just creates the direct call,
1040 the referencd representing the if conditional and attaches
1041 them all to the orginal indirect call statement.
1043 Return direct edge created. */
1046 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1047 int direct_frequency
)
1049 cgraph_node
*n
= caller
;
1050 ipa_ref
*ref
= NULL
;
1055 fprintf (dump_file
, "Indirect call -> speculative call"
1056 " %s/%i => %s/%i\n",
1057 xstrdup_for_dump (n
->name ()), n
->order
,
1058 xstrdup_for_dump (n2
->name ()), n2
->order
);
1061 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1062 initialize_inline_failed (e2
);
1063 e2
->speculative
= true;
1064 if (TREE_NOTHROW (n2
->decl
))
1065 e2
->can_throw_external
= false;
1067 e2
->can_throw_external
= can_throw_external
;
1068 e2
->lto_stmt_uid
= lto_stmt_uid
;
1069 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1071 frequency
-= e2
->frequency
;
1072 symtab
->call_edge_duplication_hooks (this, e2
);
1073 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1074 ref
->lto_stmt_uid
= lto_stmt_uid
;
1075 ref
->speculative
= speculative
;
1076 n2
->mark_address_taken ();
1080 /* Speculative call consist of three components:
1081 1) an indirect edge representing the original call
1082 2) an direct edge representing the new call
1083 3) ADDR_EXPR reference representing the speculative check.
1084 All three components are attached to single statement (the indirect
1085 call) and if one of them exists, all of them must exist.
1087 Given speculative call edge, return all three components.
1091 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1092 cgraph_edge
*&indirect
,
1093 ipa_ref
*&reference
)
1098 cgraph_edge
*e
= this;
1100 if (!e
->indirect_unknown_callee
)
1101 for (e2
= e
->caller
->indirect_calls
;
1102 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1103 e2
= e2
->next_callee
)
1108 /* We can take advantage of the call stmt hash. */
1111 e
= e
->caller
->get_edge (e2
->call_stmt
);
1112 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1115 for (e
= e
->caller
->callees
;
1116 e2
->call_stmt
!= e
->call_stmt
1117 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1121 gcc_assert (e
->speculative
&& e2
->speculative
);
1126 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1127 if (ref
->speculative
1128 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1129 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1135 /* Speculative edge always consist of all three components - direct edge,
1136 indirect and reference. */
1138 gcc_assert (e
&& e2
&& ref
);
1141 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1142 Remove the speculative call sequence and return edge representing the call.
1143 It is up to caller to redirect the call as appropriate. */
1146 cgraph_edge::resolve_speculation (tree callee_decl
)
1148 cgraph_edge
*edge
= this;
1152 gcc_assert (edge
->speculative
);
1153 edge
->speculative_call_info (e2
, edge
, ref
);
1155 || !ref
->referred
->semantically_equivalent_p
1156 (symtab_node::get (callee_decl
)))
1162 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1163 "turned out to have contradicting known target ",
1164 xstrdup_for_dump (edge
->caller
->name ()),
1165 edge
->caller
->order
,
1166 xstrdup_for_dump (e2
->callee
->name ()),
1168 print_generic_expr (dump_file
, callee_decl
, 0);
1169 fprintf (dump_file
, "\n");
1173 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1174 xstrdup_for_dump (edge
->caller
->name ()),
1175 edge
->caller
->order
,
1176 xstrdup_for_dump (e2
->callee
->name ()),
1183 cgraph_edge
*tmp
= edge
;
1185 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1188 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1189 in the functions inlined through it. */
1191 edge
->count
+= e2
->count
;
1192 edge
->frequency
+= e2
->frequency
;
1193 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1194 edge
->frequency
= CGRAPH_FREQ_MAX
;
1195 edge
->speculative
= false;
1196 e2
->speculative
= false;
1197 ref
->remove_reference ();
1198 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1201 e2
->callee
->remove_symbol_and_inline_clones ();
1202 if (edge
->caller
->call_site_hash
)
1203 cgraph_update_edge_in_call_site_hash (edge
);
1207 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1208 CALLEE. DELTA is an integer constant that is to be added to the this
1209 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1212 cgraph_edge::make_direct (cgraph_node
*callee
)
1214 cgraph_edge
*edge
= this;
1215 gcc_assert (indirect_unknown_callee
);
1217 /* If we are redirecting speculative call, make it non-speculative. */
1218 if (indirect_unknown_callee
&& speculative
)
1220 edge
= edge
->resolve_speculation (callee
->decl
);
1222 /* On successful speculation just return the pre existing direct edge. */
1223 if (!indirect_unknown_callee
)
1227 indirect_unknown_callee
= 0;
1228 ggc_free (indirect_info
);
1229 indirect_info
= NULL
;
1231 /* Get the edge out of the indirect edge list. */
1233 prev_callee
->next_callee
= next_callee
;
1235 next_callee
->prev_callee
= prev_callee
;
1237 caller
->indirect_calls
= next_callee
;
1239 /* Put it into the normal callee list */
1241 next_callee
= caller
->callees
;
1242 if (caller
->callees
)
1243 caller
->callees
->prev_callee
= edge
;
1244 caller
->callees
= edge
;
1246 /* Insert to callers list of the new callee. */
1247 edge
->set_callee (callee
);
1250 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
, false))
1252 call_stmt_cannot_inline_p
= true;
1253 inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
1256 /* We need to re-determine the inlining status of the edge. */
1257 initialize_inline_failed (edge
);
1261 /* If necessary, change the function declaration in the call statement
1262 associated with E so that it corresponds to the edge callee. */
1265 cgraph_edge::redirect_call_stmt_to_callee (void)
1267 cgraph_edge
*e
= this;
1269 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1270 tree lhs
= gimple_call_lhs (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/%i -> %s/%i\n"
1297 xstrdup_for_dump (e
->caller
->name ()),
1299 xstrdup_for_dump (e
->callee
->name ()),
1301 e
= e
->resolve_speculation ();
1302 /* We are producing the final function body and will throw away the
1303 callgraph edges really soon. Reset the counts/frequencies to
1304 keep verifier happy in the case of roundoff errors. */
1305 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1306 e
->frequency
= compute_call_stmt_bb_frequency
1307 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1309 /* Expand speculation into GIMPLE code. */
1314 "Expanding speculative call of %s/%i -> %s/%i count:"
1316 xstrdup_for_dump (e
->caller
->name ()),
1318 xstrdup_for_dump (e
->callee
->name ()),
1321 gcc_assert (e2
->speculative
);
1322 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1323 new_stmt
= gimple_ic (e
->call_stmt
,
1324 dyn_cast
<cgraph_node
*> (ref
->referred
),
1325 e
->count
|| e2
->count
1326 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1327 e
->count
+ e2
->count
)
1328 : e
->frequency
|| e2
->frequency
1329 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1330 e
->frequency
+ e2
->frequency
)
1331 : REG_BR_PROB_BASE
/ 2,
1332 e
->count
, e
->count
+ e2
->count
);
1333 e
->speculative
= false;
1334 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1337 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1338 processed call stmt. */
1339 if (gimple_call_with_bounds_p (new_stmt
)
1340 && gimple_call_lhs (new_stmt
)
1341 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1343 tree dresult
= gimple_call_lhs (new_stmt
);
1344 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1345 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1346 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1347 struct cgraph_edge
*iedge
1348 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1349 struct cgraph_edge
*dedge
;
1353 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1356 dedge
->frequency
= compute_call_stmt_bb_frequency
1357 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1359 iedge
->frequency
= compute_call_stmt_bb_frequency
1360 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1363 e
->frequency
= compute_call_stmt_bb_frequency
1364 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1365 e2
->frequency
= compute_call_stmt_bb_frequency
1366 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1367 e2
->speculative
= false;
1368 ref
->speculative
= false;
1370 /* Indirect edges are not both in the call site hash.
1372 if (e
->caller
->call_site_hash
)
1373 cgraph_update_edge_in_call_site_hash (e2
);
1375 /* Continue redirecting E to proper target. */
1379 /* We might propagate instrumented function pointer into
1380 not instrumented function and vice versa. In such a
1381 case we need to either fix function declaration or
1382 remove bounds from call statement. */
1383 if (flag_check_pointer_bounds
&& e
->callee
)
1384 skip_bounds
= chkp_redirect_edge (e
);
1386 if (e
->indirect_unknown_callee
1387 || (decl
== e
->callee
->decl
1389 return e
->call_stmt
;
1391 if (flag_checking
&& decl
)
1393 cgraph_node
*node
= cgraph_node::get (decl
);
1394 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1397 if (symtab
->dump_file
)
1399 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1400 xstrdup_for_dump (e
->caller
->name ()), e
->caller
->order
,
1401 xstrdup_for_dump (e
->callee
->name ()), e
->callee
->order
);
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 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1425 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1427 if (gimple_vdef (new_stmt
)
1428 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1429 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1431 gsi
= gsi_for_stmt (e
->call_stmt
);
1433 /* For optimized away parameters, add on the caller side
1435 DEBUG D#X => parm_Y(D)
1436 stmts and associate D#X with parm in decl_debug_args_lookup
1437 vector to say for debug info that if parameter parm had been passed,
1438 it would have value parm_Y(D). */
1439 if (e
->callee
->clone
.combined_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
1441 vec
<tree
, va_gc
> **debug_args
1442 = decl_debug_args_lookup (e
->callee
->decl
);
1443 tree old_decl
= gimple_call_fndecl (e
->call_stmt
);
1444 if (debug_args
&& old_decl
)
1447 unsigned i
= 0, num
;
1448 unsigned len
= vec_safe_length (*debug_args
);
1449 unsigned nargs
= gimple_call_num_args (e
->call_stmt
);
1450 for (parm
= DECL_ARGUMENTS (old_decl
), num
= 0;
1451 parm
&& num
< nargs
;
1452 parm
= DECL_CHAIN (parm
), num
++)
1453 if (bitmap_bit_p (e
->callee
->clone
.combined_args_to_skip
, num
)
1454 && is_gimple_reg (parm
))
1458 while (i
< len
&& (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1464 && (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1469 tree ddecl
= (**debug_args
)[i
+ 1];
1470 tree arg
= gimple_call_arg (e
->call_stmt
, num
);
1471 if (!useless_type_conversion_p (TREE_TYPE (ddecl
),
1475 if (!fold_convertible_p (TREE_TYPE (ddecl
), arg
))
1477 if (TREE_CODE (arg
) == SSA_NAME
1478 && gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg
))
1480 = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (arg
)))
1481 && useless_type_conversion_p (TREE_TYPE (ddecl
),
1485 arg
= fold_convert (TREE_TYPE (ddecl
), arg
);
1489 = gimple_build_debug_bind (ddecl
, unshare_expr (arg
),
1491 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
1496 gsi_replace (&gsi
, new_stmt
, false);
1497 /* We need to defer cleaning EH info on the new statement to
1498 fixup-cfg. We may not have dominator information at this point
1499 and thus would end up with unreachable blocks and have no way
1500 to communicate that we need to run CFG cleanup then. */
1501 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1504 remove_stmt_from_eh_lp (e
->call_stmt
);
1505 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1510 new_stmt
= e
->call_stmt
;
1511 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1512 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1515 /* If the call becomes noreturn, remove the LHS if possible. */
1517 && (gimple_call_flags (new_stmt
) & ECF_NORETURN
)
1518 && TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (lhs
))) == INTEGER_CST
)
1520 if (TREE_CODE (lhs
) == SSA_NAME
)
1522 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1523 TREE_TYPE (lhs
), NULL
);
1524 var
= get_or_create_ssa_default_def
1525 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1526 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1527 gsi
= gsi_for_stmt (new_stmt
);
1528 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1529 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1531 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1532 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1535 /* If new callee has no static chain, remove it. */
1536 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1538 gimple_call_set_chain (new_stmt
, NULL
);
1539 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1542 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1545 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1547 if (symtab
->dump_file
)
1549 fprintf (symtab
->dump_file
, " updated to:");
1550 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1555 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1556 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1557 of OLD_STMT if it was previously call statement.
1558 If NEW_STMT is NULL, the call has been dropped without any
1562 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1563 gimple
*old_stmt
, tree old_call
,
1566 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1567 ? gimple_call_fndecl (new_stmt
) : 0;
1569 /* We are seeing indirect calls, then there is nothing to update. */
1570 if (!new_call
&& !old_call
)
1572 /* See if we turned indirect call into direct call or folded call to one builtin
1573 into different builtin. */
1574 if (old_call
!= new_call
)
1576 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1577 cgraph_edge
*ne
= NULL
;
1583 /* Keep calls marked as dead dead. */
1584 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1585 && DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
1586 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
1588 node
->get_edge (old_stmt
)->set_call_stmt
1589 (as_a
<gcall
*> (new_stmt
));
1592 /* See if the edge is already there and has the correct callee. It
1593 might be so because of indirect inlining has already updated
1594 it. We also might've cloned and redirected the edge. */
1595 if (new_call
&& e
->callee
)
1597 cgraph_node
*callee
= e
->callee
;
1600 if (callee
->decl
== new_call
1601 || callee
->former_clone_of
== new_call
)
1603 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1606 callee
= callee
->clone_of
;
1610 /* Otherwise remove edge and create new one; we can't simply redirect
1611 since function has changed, so inline plan and other information
1612 attached to edge is invalid. */
1614 frequency
= e
->frequency
;
1615 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1618 e
->callee
->remove_symbol_and_inline_clones ();
1622 /* We are seeing new direct call; compute profile info based on BB. */
1623 basic_block bb
= gimple_bb (new_stmt
);
1625 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1631 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1632 as_a
<gcall
*> (new_stmt
), count
,
1634 gcc_assert (ne
->inline_failed
);
1637 /* We only updated the call stmt; update pointer in cgraph edge.. */
1638 else if (old_stmt
!= new_stmt
)
1639 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1642 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1643 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1644 of OLD_STMT before it was updated (updating can happen inplace). */
1647 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1650 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1653 gcc_checking_assert (orig
);
1654 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1656 for (node
= orig
->clones
; node
!= orig
;)
1658 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1660 node
= node
->clones
;
1661 else if (node
->next_sibling_clone
)
1662 node
= node
->next_sibling_clone
;
1665 while (node
!= orig
&& !node
->next_sibling_clone
)
1666 node
= node
->clone_of
;
1668 node
= node
->next_sibling_clone
;
1674 /* Remove all callees from the node. */
1677 cgraph_node::remove_callees (void)
1681 /* It is sufficient to remove the edges from the lists of callers of
1682 the callees. The callee list of the node can be zapped with one
1684 for (e
= callees
; e
; e
= f
)
1687 symtab
->call_edge_removal_hooks (e
);
1688 if (!e
->indirect_unknown_callee
)
1689 e
->remove_callee ();
1690 symtab
->free_edge (e
);
1692 for (e
= indirect_calls
; e
; e
= f
)
1695 symtab
->call_edge_removal_hooks (e
);
1696 if (!e
->indirect_unknown_callee
)
1697 e
->remove_callee ();
1698 symtab
->free_edge (e
);
1700 indirect_calls
= NULL
;
1704 call_site_hash
->empty ();
1705 call_site_hash
= NULL
;
1709 /* Remove all callers from the node. */
1712 cgraph_node::remove_callers (void)
1716 /* It is sufficient to remove the edges from the lists of callees of
1717 the callers. The caller list of the node can be zapped with one
1719 for (e
= callers
; e
; e
= f
)
1722 symtab
->call_edge_removal_hooks (e
);
1723 e
->remove_caller ();
1724 symtab
->free_edge (e
);
1729 /* Helper function for cgraph_release_function_body and free_lang_data.
1730 It releases body from function DECL without having to inspect its
1731 possibly non-existent symtab node. */
1734 release_function_body (tree decl
)
1736 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1740 && loops_for_fn (fn
))
1742 fn
->curr_properties
&= ~PROP_loops
;
1743 loop_optimizer_finalize (fn
);
1747 delete_tree_ssa (fn
);
1752 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1753 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1754 delete_tree_cfg_annotations (fn
);
1758 if (fn
->value_histograms
)
1759 free_histograms (fn
);
1760 gimple_set_body (decl
, NULL
);
1761 /* Struct function hangs a lot of data that would leak if we didn't
1762 removed all pointers to it. */
1764 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1766 DECL_SAVED_TREE (decl
) = NULL
;
1769 /* Release memory used to represent body of function.
1770 Use this only for functions that are released before being translated to
1771 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1772 are free'd in final.c via free_after_compilation().
1773 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1776 cgraph_node::release_body (bool keep_arguments
)
1778 ipa_transforms_to_apply
.release ();
1779 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1781 DECL_RESULT (decl
) = NULL
;
1783 if (!keep_arguments
)
1784 DECL_ARGUMENTS (decl
) = NULL
;
1786 /* If the node is abstract and needed, then do not clear
1787 DECL_INITIAL of its associated function declaration because it's
1788 needed to emit debug info later. */
1789 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1790 DECL_INITIAL (decl
) = error_mark_node
;
1791 release_function_body (decl
);
1794 lto_free_function_in_decl_state_for_node (this);
1795 lto_file_data
= NULL
;
1799 /* Remove function from symbol table. */
1802 cgraph_node::remove (void)
1805 int uid
= this->uid
;
1807 symtab
->call_cgraph_removal_hooks (this);
1810 ipa_transforms_to_apply
.release ();
1812 /* Incremental inlining access removed nodes stored in the postorder list.
1814 force_output
= false;
1815 forced_by_abi
= false;
1816 for (n
= nested
; n
; n
= n
->next_nested
)
1821 cgraph_node
**node2
= &origin
->nested
;
1823 while (*node2
!= this)
1824 node2
= &(*node2
)->next_nested
;
1825 *node2
= next_nested
;
1828 if (prev_sibling_clone
)
1829 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1831 clone_of
->clones
= next_sibling_clone
;
1832 if (next_sibling_clone
)
1833 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1836 cgraph_node
*n
, *next
;
1840 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1841 n
->clone_of
= clone_of
;
1842 n
->clone_of
= clone_of
;
1843 n
->next_sibling_clone
= clone_of
->clones
;
1844 if (clone_of
->clones
)
1845 clone_of
->clones
->prev_sibling_clone
= n
;
1846 clone_of
->clones
= clones
;
1850 /* We are removing node with clones. This makes clones inconsistent,
1851 but assume they will be removed subsequently and just keep clone
1852 tree intact. This can happen in unreachable function removal since
1853 we remove unreachable functions in random order, not by bottom-up
1854 walk of clone trees. */
1855 for (n
= clones
; n
; n
= next
)
1857 next
= n
->next_sibling_clone
;
1858 n
->next_sibling_clone
= NULL
;
1859 n
->prev_sibling_clone
= NULL
;
1865 /* While all the clones are removed after being proceeded, the function
1866 itself is kept in the cgraph even after it is compiled. Check whether
1867 we are done with this body and reclaim it proactively if this is the case.
1869 if (symtab
->state
!= LTO_STREAMING
)
1871 n
= cgraph_node::get (decl
);
1873 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1874 && ((symtab
->global_info_ready
|| in_lto_p
)
1875 && (TREE_ASM_WRITTEN (n
->decl
)
1876 || DECL_EXTERNAL (n
->decl
)
1878 || (!flag_wpa
&& n
->in_other_partition
)))))
1883 lto_free_function_in_decl_state_for_node (this);
1884 lto_file_data
= NULL
;
1890 call_site_hash
->empty ();
1891 call_site_hash
= NULL
;
1894 if (instrumented_version
)
1896 instrumented_version
->instrumented_version
= NULL
;
1897 instrumented_version
= NULL
;
1900 symtab
->release_symbol (this, uid
);
1903 /* Likewise indicate that a node is having address taken. */
1906 cgraph_node::mark_address_taken (void)
1908 /* Indirect inlining can figure out that all uses of the address are
1910 if (global
.inlined_to
)
1912 gcc_assert (cfun
->after_inlining
);
1913 gcc_assert (callers
->indirect_inlining_edge
);
1916 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1917 IPA_REF_ADDR reference exists (and thus it should be set on node
1918 representing alias we take address of) and as a test whether address
1919 of the object was taken (and thus it should be set on node alias is
1920 referring to). We should remove the first use and the remove the
1923 cgraph_node
*node
= ultimate_alias_target ();
1924 node
->address_taken
= 1;
1927 /* Return local info for the compiled function. */
1930 cgraph_node::local_info (tree decl
)
1932 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1933 cgraph_node
*node
= get (decl
);
1936 return &node
->ultimate_alias_target ()->local
;
1939 /* Return local info for the compiled function. */
1942 cgraph_node::rtl_info (tree decl
)
1944 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1945 cgraph_node
*node
= get (decl
);
1948 node
= node
->ultimate_alias_target ();
1949 if (node
->decl
!= current_function_decl
1950 && !TREE_ASM_WRITTEN (node
->decl
))
1952 /* Allocate if it doesnt exist. */
1953 if (node
->ultimate_alias_target ()->rtl
== NULL
)
1954 node
->ultimate_alias_target ()->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1955 return node
->ultimate_alias_target ()->rtl
;
1958 /* Return a string describing the failure REASON. */
1961 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1964 #define DEFCIFCODE(code, type, string) string,
1966 static const char *cif_string_table
[CIF_N_REASONS
] = {
1967 #include "cif-code.def"
1970 /* Signedness of an enum type is implementation defined, so cast it
1971 to unsigned before testing. */
1972 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1973 return cif_string_table
[reason
];
1976 /* Return a type describing the failure REASON. */
1978 cgraph_inline_failed_type_t
1979 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1982 #define DEFCIFCODE(code, type, string) type,
1984 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1985 #include "cif-code.def"
1988 /* Signedness of an enum type is implementation defined, so cast it
1989 to unsigned before testing. */
1990 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1991 return cif_type_table
[reason
];
1994 /* Names used to print out the availability enum. */
1995 const char * const cgraph_availability_names
[] =
1996 {"unset", "not_available", "overwritable", "available", "local"};
1998 /* Output flags of edge to a file F. */
2001 cgraph_edge::dump_edge_flags (FILE *f
)
2004 fprintf (f
, "(speculative) ");
2006 fprintf (f
, "(inlined) ");
2007 if (call_stmt_cannot_inline_p
)
2008 fprintf (f
, "(call_stmt_cannot_inline_p) ");
2009 if (indirect_inlining_edge
)
2010 fprintf (f
, "(indirect_inlining) ");
2012 fprintf (f
, "(%" PRId64
"x) ", (int64_t)count
);
2014 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
2015 if (can_throw_external
)
2016 fprintf (f
, "(can throw external) ");
2019 /* Dump call graph node to file F. */
2022 cgraph_node::dump (FILE *f
)
2028 if (global
.inlined_to
)
2029 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
2030 xstrdup_for_dump (name ()),
2032 xstrdup_for_dump (global
.inlined_to
->name ()),
2033 global
.inlined_to
->order
);
2035 fprintf (f
, " Clone of %s/%i\n",
2036 clone_of
->asm_name (),
2038 if (symtab
->function_flags_ready
)
2039 fprintf (f
, " Availability: %s\n",
2040 cgraph_availability_names
[get_availability ()]);
2043 fprintf (f
, " Profile id: %i\n",
2045 fprintf (f
, " First run: %i\n", tp_first_run
);
2046 fprintf (f
, " Function flags:");
2048 fprintf (f
, " executed %" PRId64
"x",
2051 fprintf (f
, " nested in: %s", origin
->asm_name ());
2052 if (gimple_has_body_p (decl
))
2053 fprintf (f
, " body");
2055 fprintf (f
, " process");
2057 fprintf (f
, " local");
2058 if (local
.redefined_extern_inline
)
2059 fprintf (f
, " redefined_extern_inline");
2060 if (only_called_at_startup
)
2061 fprintf (f
, " only_called_at_startup");
2062 if (only_called_at_exit
)
2063 fprintf (f
, " only_called_at_exit");
2065 fprintf (f
, " tm_clone");
2067 fprintf (f
, " icf_merged");
2069 fprintf (f
, " merged_comdat");
2071 fprintf (f
, " split_part");
2072 if (indirect_call_target
)
2073 fprintf (f
, " indirect_call_target");
2075 fprintf (f
, " nonfreeing_fn");
2076 if (DECL_STATIC_CONSTRUCTOR (decl
))
2077 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2078 if (DECL_STATIC_DESTRUCTOR (decl
))
2079 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2080 if (frequency
== NODE_FREQUENCY_HOT
)
2081 fprintf (f
, " hot");
2082 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2083 fprintf (f
, " unlikely_executed");
2084 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2085 fprintf (f
, " executed_once");
2086 if (only_called_at_startup
)
2087 fprintf (f
, " only_called_at_startup");
2088 if (only_called_at_exit
)
2089 fprintf (f
, " only_called_at_exit");
2090 if (opt_for_fn (decl
, optimize_size
))
2091 fprintf (f
, " optimize_size");
2092 if (parallelized_function
)
2093 fprintf (f
, " parallelized_function");
2099 fprintf (f
, " Thunk");
2101 fprintf (f
, " of %s (asm: %s)",
2102 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2103 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2104 fprintf (f
, " fixed offset %i virtual value %i has "
2105 "virtual offset %i)\n",
2106 (int)thunk
.fixed_offset
,
2107 (int)thunk
.virtual_value
,
2108 (int)thunk
.virtual_offset_p
);
2110 if (alias
&& thunk
.alias
2111 && DECL_P (thunk
.alias
))
2113 fprintf (f
, " Alias of %s",
2114 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2115 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2116 fprintf (f
, " (asm: %s)",
2117 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2121 fprintf (f
, " Called by: ");
2123 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2125 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
2126 edge
->caller
->order
);
2127 edge
->dump_edge_flags (f
);
2130 fprintf (f
, "\n Calls: ");
2131 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2133 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
2134 edge
->callee
->order
);
2135 edge
->dump_edge_flags (f
);
2139 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2141 if (edge
->indirect_info
->polymorphic
)
2143 fprintf (f
, " Polymorphic indirect call of type ");
2144 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2145 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2148 fprintf (f
, " Indirect call");
2149 edge
->dump_edge_flags (f
);
2150 if (edge
->indirect_info
->param_index
!= -1)
2152 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2153 if (edge
->indirect_info
->agg_contents
)
2154 fprintf (f
, " loaded from %s %s at offset %i",
2155 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2156 edge
->indirect_info
->by_ref
? "passed by reference":"",
2157 (int)edge
->indirect_info
->offset
);
2158 if (edge
->indirect_info
->vptr_changed
)
2159 fprintf (f
, " (vptr maybe changed)");
2162 if (edge
->indirect_info
->polymorphic
)
2163 edge
->indirect_info
->context
.dump (f
);
2166 if (instrumentation_clone
)
2167 fprintf (f
, " Is instrumented version.\n");
2168 else if (instrumented_version
)
2169 fprintf (f
, " Has instrumented version.\n");
2172 /* Dump call graph node NODE to stderr. */
2175 cgraph_node::debug (void)
2180 /* Dump the callgraph to file F. */
2183 cgraph_node::dump_cgraph (FILE *f
)
2187 fprintf (f
, "callgraph:\n\n");
2188 FOR_EACH_FUNCTION (node
)
2192 /* Return true when the DECL can possibly be inlined. */
2195 cgraph_function_possibly_inlined_p (tree decl
)
2197 if (!symtab
->global_info_ready
)
2198 return !DECL_UNINLINABLE (decl
);
2199 return DECL_POSSIBLY_INLINED (decl
);
2202 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2204 cgraph_node::unnest (void)
2206 cgraph_node
**node2
= &origin
->nested
;
2207 gcc_assert (origin
);
2209 while (*node2
!= this)
2210 node2
= &(*node2
)->next_nested
;
2211 *node2
= next_nested
;
2215 /* Return function availability. See cgraph.h for description of individual
2218 cgraph_node::get_availability (symtab_node
*ref
)
2222 cgraph_node
*cref
= dyn_cast
<cgraph_node
*> (ref
);
2224 ref
= cref
->global
.inlined_to
;
2226 enum availability avail
;
2228 avail
= AVAIL_NOT_AVAILABLE
;
2229 else if (local
.local
)
2230 avail
= AVAIL_LOCAL
;
2231 else if (global
.inlined_to
)
2232 avail
= AVAIL_AVAILABLE
;
2233 else if (transparent_alias
)
2234 ultimate_alias_target (&avail
, ref
);
2235 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2236 avail
= AVAIL_INTERPOSABLE
;
2237 else if (!externally_visible
)
2238 avail
= AVAIL_AVAILABLE
;
2239 /* If this is a reference from symbol itself and there are no aliases, we
2240 may be sure that the symbol was not interposed by soemthing else because
2241 the symbol itself would be unreachable otherwise.
2243 Also comdat groups are always resolved in groups. */
2244 else if ((this == ref
&& !has_aliases_p ())
2245 || (ref
&& get_comdat_group ()
2246 && get_comdat_group () == ref
->get_comdat_group ()))
2247 avail
= AVAIL_AVAILABLE
;
2248 /* Inline functions are safe to be analyzed even if their symbol can
2249 be overwritten at runtime. It is not meaningful to enforce any sane
2250 behavior on replacing inline function by different body. */
2251 else if (DECL_DECLARED_INLINE_P (decl
))
2252 avail
= AVAIL_AVAILABLE
;
2254 /* If the function can be overwritten, return OVERWRITABLE. Take
2255 care at least of two notable extensions - the COMDAT functions
2256 used to share template instantiations in C++ (this is symmetric
2257 to code cp_cannot_inline_tree_fn and probably shall be shared and
2258 the inlinability hooks completely eliminated). */
2260 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2261 avail
= AVAIL_INTERPOSABLE
;
2262 else avail
= AVAIL_AVAILABLE
;
2267 /* Worker for cgraph_node_can_be_local_p. */
2269 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2271 return !(!node
->force_output
2272 && ((DECL_COMDAT (node
->decl
)
2273 && !node
->forced_by_abi
2274 && !node
->used_from_object_file_p ()
2275 && !node
->same_comdat_group
)
2276 || !node
->externally_visible
));
2279 /* Return true if cgraph_node can be made local for API change.
2280 Extern inline functions and C++ COMDAT functions can be made local
2281 at the expense of possible code size growth if function is used in multiple
2282 compilation units. */
2284 cgraph_node::can_be_local_p (void)
2286 return (!address_taken
2287 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2291 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2292 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2293 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2296 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2297 (cgraph_node
*, void *),
2299 bool include_overwritable
,
2300 bool exclude_virtual_thunks
)
2305 if (callback (this, data
))
2307 FOR_EACH_ALIAS (this, ref
)
2309 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2310 if (include_overwritable
2311 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2312 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2313 include_overwritable
,
2314 exclude_virtual_thunks
))
2317 if (get_availability () <= AVAIL_INTERPOSABLE
)
2319 for (e
= callers
; e
; e
= e
->next_caller
)
2320 if (e
->caller
->thunk
.thunk_p
2321 && (include_overwritable
2322 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2323 && !(exclude_virtual_thunks
2324 && e
->caller
->thunk
.virtual_offset_p
))
2325 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2326 include_overwritable
,
2327 exclude_virtual_thunks
))
2333 /* Worker to bring NODE local. */
2336 cgraph_node::make_local (cgraph_node
*node
, void *)
2338 gcc_checking_assert (node
->can_be_local_p ());
2339 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2341 node
->make_decl_local ();
2342 node
->set_section (NULL
);
2343 node
->set_comdat_group (NULL
);
2344 node
->externally_visible
= false;
2345 node
->forced_by_abi
= false;
2346 node
->local
.local
= true;
2347 node
->set_section (NULL
);
2348 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2349 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2350 && !flag_incremental_link
);
2351 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2352 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2357 /* Bring cgraph node local. */
2360 cgraph_node::make_local (void)
2362 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2365 /* Worker to set nothrow flag. */
2368 set_nothrow_flag_1 (cgraph_node
*node
, bool nothrow
, bool non_call
,
2373 if (nothrow
&& !TREE_NOTHROW (node
->decl
))
2375 /* With non-call exceptions we can't say for sure if other function body
2376 was not possibly optimized to stil throw. */
2377 if (!non_call
|| node
->binds_to_current_def_p ())
2379 TREE_NOTHROW (node
->decl
) = true;
2381 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2382 e
->can_throw_external
= false;
2385 else if (!nothrow
&& TREE_NOTHROW (node
->decl
))
2387 TREE_NOTHROW (node
->decl
) = false;
2391 FOR_EACH_ALIAS (node
, ref
)
2393 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2394 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2395 set_nothrow_flag_1 (alias
, nothrow
, non_call
, changed
);
2397 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2398 if (e
->caller
->thunk
.thunk_p
2399 && (!nothrow
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2400 set_nothrow_flag_1 (e
->caller
, nothrow
, non_call
, changed
);
2403 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2404 if any to NOTHROW. */
2407 cgraph_node::set_nothrow_flag (bool nothrow
)
2409 bool changed
= false;
2410 bool non_call
= opt_for_fn (decl
, flag_non_call_exceptions
);
2412 if (!nothrow
|| get_availability () > AVAIL_INTERPOSABLE
)
2413 set_nothrow_flag_1 (this, nothrow
, non_call
, &changed
);
2418 FOR_EACH_ALIAS (this, ref
)
2420 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2421 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2422 set_nothrow_flag_1 (alias
, nothrow
, non_call
, &changed
);
2428 /* Worker to set_const_flag. */
2431 set_const_flag_1 (cgraph_node
*node
, bool set_const
, bool looping
,
2434 /* Static constructors and destructors without a side effect can be
2436 if (set_const
&& !looping
)
2438 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2440 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2443 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2445 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2451 if (TREE_READONLY (node
->decl
))
2453 TREE_READONLY (node
->decl
) = 0;
2454 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2460 /* Consider function:
2467 During early optimization we will turn this into:
2474 Now if this function will be detected as CONST however when interposed
2475 it may end up being just pure. We always must assume the worst
2477 if (TREE_READONLY (node
->decl
))
2479 if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2481 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2485 else if (node
->binds_to_current_def_p ())
2487 TREE_READONLY (node
->decl
) = true;
2488 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2489 DECL_PURE_P (node
->decl
) = false;
2494 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2495 fprintf (dump_file
, "Dropping state to PURE because function does "
2496 "not bind to current def.\n");
2497 if (!DECL_PURE_P (node
->decl
))
2499 DECL_PURE_P (node
->decl
) = true;
2500 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2503 else if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2505 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2512 FOR_EACH_ALIAS (node
, ref
)
2514 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2515 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2516 set_const_flag_1 (alias
, set_const
, looping
, changed
);
2518 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2519 if (e
->caller
->thunk
.thunk_p
2520 && (!set_const
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2522 /* Virtual thunks access virtual offset in the vtable, so they can
2523 only be pure, never const. */
2525 && (e
->caller
->thunk
.virtual_offset_p
2526 || !node
->binds_to_current_def_p (e
->caller
)))
2527 *changed
|= e
->caller
->set_pure_flag (true, looping
);
2529 set_const_flag_1 (e
->caller
, set_const
, looping
, changed
);
2533 /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
2534 If SET_CONST if false, clear the flag.
2536 When setting the flag be careful about possible interposition and
2537 do not set the flag for functions that can be interposet and set pure
2538 flag for functions that can bind to other definition.
2540 Return true if any change was done. */
2543 cgraph_node::set_const_flag (bool set_const
, bool looping
)
2545 bool changed
= false;
2546 if (!set_const
|| get_availability () > AVAIL_INTERPOSABLE
)
2547 set_const_flag_1 (this, set_const
, looping
, &changed
);
2552 FOR_EACH_ALIAS (this, ref
)
2554 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2555 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2556 set_const_flag_1 (alias
, set_const
, looping
, &changed
);
2562 /* Info used by set_pure_flag_1. */
2564 struct set_pure_flag_info
2571 /* Worker to set_pure_flag. */
2574 set_pure_flag_1 (cgraph_node
*node
, void *data
)
2576 struct set_pure_flag_info
*info
= (struct set_pure_flag_info
*)data
;
2577 /* Static constructors and destructors without a side effect can be
2579 if (info
->pure
&& !info
->looping
)
2581 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2583 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2584 info
->changed
= true;
2586 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2588 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2589 info
->changed
= true;
2594 if (!DECL_PURE_P (node
->decl
) && !TREE_READONLY (node
->decl
))
2596 DECL_PURE_P (node
->decl
) = true;
2597 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = info
->looping
;
2598 info
->changed
= true;
2600 else if (DECL_LOOPING_CONST_OR_PURE_P (node
->decl
)
2603 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2604 info
->changed
= true;
2609 if (DECL_PURE_P (node
->decl
))
2611 DECL_PURE_P (node
->decl
) = false;
2612 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2613 info
->changed
= true;
2619 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2622 When setting the flag, be careful about possible interposition.
2623 Return true if any change was done. */
2626 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2628 struct set_pure_flag_info info
= {pure
, looping
, false};
2631 call_for_symbol_thunks_and_aliases (set_pure_flag_1
, &info
, !pure
, true);
2632 return info
.changed
;
2635 /* Return true when cgraph_node can not return or throw and thus
2636 it is safe to ignore its side effects for IPA analysis. */
2639 cgraph_node::cannot_return_p (void)
2641 int flags
= flags_from_decl_or_type (decl
);
2642 if (!opt_for_fn (decl
, flag_exceptions
))
2643 return (flags
& ECF_NORETURN
) != 0;
2645 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2646 == (ECF_NORETURN
| ECF_NOTHROW
));
2649 /* Return true when call of edge can not lead to return from caller
2650 and thus it is safe to ignore its side effects for IPA analysis
2651 when computing side effects of the caller.
2652 FIXME: We could actually mark all edges that have no reaching
2653 patch to the exit block or throw to get better results. */
2655 cgraph_edge::cannot_lead_to_return_p (void)
2657 if (caller
->cannot_return_p ())
2659 if (indirect_unknown_callee
)
2661 int flags
= indirect_info
->ecf_flags
;
2662 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2663 return (flags
& ECF_NORETURN
) != 0;
2665 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2666 == (ECF_NORETURN
| ECF_NOTHROW
));
2669 return callee
->cannot_return_p ();
2672 /* Return true if the call can be hot. */
2675 cgraph_edge::maybe_hot_p (void)
2677 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2679 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2680 && !maybe_hot_count_p (NULL
, count
))
2682 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2684 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2686 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2688 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2690 if (opt_for_fn (caller
->decl
, optimize_size
))
2692 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2694 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2695 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2697 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2699 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2700 || frequency
<= (CGRAPH_FREQ_BASE
2701 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2707 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2710 nonremovable_p (cgraph_node
*node
, void *)
2712 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2715 /* Return true if whole comdat group can be removed if there are no direct
2719 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2721 struct ipa_ref
*ref
;
2723 /* For local symbols or non-comdat group it is the same as
2724 can_remove_if_no_direct_calls_p. */
2725 if (!externally_visible
|| !same_comdat_group
)
2727 if (DECL_EXTERNAL (decl
))
2731 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2734 if (will_inline
&& address_taken
)
2737 /* Otheriwse check if we can remove the symbol itself and then verify
2738 that only uses of the comdat groups are direct call to THIS
2740 if (!can_remove_if_no_direct_calls_and_refs_p ())
2743 /* Check that all refs come from within the comdat group. */
2744 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2745 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2748 struct cgraph_node
*target
= ultimate_alias_target ();
2749 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2750 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2752 if (!externally_visible
)
2755 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2758 /* If we see different symbol than THIS, be sure to check calls. */
2759 if (next
->ultimate_alias_target () != target
)
2760 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2761 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2765 /* If function is not being inlined, we care only about
2766 references outside of the comdat group. */
2768 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2769 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2775 /* Return true when function cgraph_node can be expected to be removed
2776 from program when direct calls in this compilation unit are removed.
2778 As a special case COMDAT functions are
2779 cgraph_can_remove_if_no_direct_calls_p while the are not
2780 cgraph_only_called_directly_p (it is possible they are called from other
2783 This function behaves as cgraph_only_called_directly_p because eliminating
2784 all uses of COMDAT function does not make it necessarily disappear from
2785 the program unless we are compiling whole program or we do LTO. In this
2786 case we know we win since dynamic linking will not really discard the
2787 linkonce section. */
2790 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2793 gcc_assert (!global
.inlined_to
);
2794 if (DECL_EXTERNAL (decl
))
2797 if (!in_lto_p
&& !flag_whole_program
)
2799 /* If the symbol is in comdat group, we need to verify that whole comdat
2800 group becomes unreachable. Technically we could skip references from
2801 within the group, too. */
2802 if (!only_called_directly_p ())
2804 if (same_comdat_group
&& externally_visible
)
2806 struct cgraph_node
*target
= ultimate_alias_target ();
2808 if (will_inline
&& address_taken
)
2810 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2812 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2814 if (!externally_visible
)
2817 && !next
->only_called_directly_p ())
2820 /* If we see different symbol than THIS,
2821 be sure to check calls. */
2822 if (next
->ultimate_alias_target () != target
)
2823 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2824 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2832 return can_remove_if_no_direct_calls_p (will_inline
);
2836 /* Worker for cgraph_only_called_directly_p. */
2839 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2841 return !node
->only_called_directly_or_aliased_p ();
2844 /* Return true when function cgraph_node and all its aliases are only called
2846 i.e. it is not externally visible, address was not taken and
2847 it is not used in any other non-standard way. */
2850 cgraph_node::only_called_directly_p (void)
2852 gcc_assert (ultimate_alias_target () == this);
2853 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2858 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2861 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2863 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2865 enum availability avail
;
2866 node
->ultimate_alias_target (&avail
);
2868 if (avail
> AVAIL_INTERPOSABLE
)
2869 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2870 if (!cs
->indirect_inlining_edge
2871 && !cs
->caller
->thunk
.thunk_p
)
2872 redirect_callers
->safe_push (cs
);
2876 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2877 cgraph_node (i.e. are not overwritable). */
2880 cgraph_node::collect_callers (void)
2882 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2883 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2884 &redirect_callers
, false);
2885 return redirect_callers
;
2888 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2891 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2893 bool skipped_thunk
= false;
2894 node
= node
->ultimate_alias_target ();
2895 node2
= node2
->ultimate_alias_target ();
2897 /* There are no virtual clones of thunks so check former_clone_of or if we
2898 might have skipped thunks because this adjustments are no longer
2900 while (node
->thunk
.thunk_p
)
2902 if (node2
->former_clone_of
== node
->decl
)
2904 if (!node
->thunk
.this_adjusting
)
2906 node
= node
->callees
->callee
->ultimate_alias_target ();
2907 skipped_thunk
= true;
2912 if (!node2
->clone
.args_to_skip
2913 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2915 if (node2
->former_clone_of
== node
->decl
)
2917 else if (!node2
->clone_of
)
2921 while (node
!= node2
&& node2
)
2922 node2
= node2
->clone_of
;
2923 return node2
!= NULL
;
2926 /* Verify edge count and frequency. */
2929 cgraph_edge::verify_count_and_frequency ()
2931 bool error_found
= false;
2934 error ("caller edge count is negative");
2939 error ("caller edge frequency is negative");
2942 if (frequency
> CGRAPH_FREQ_MAX
)
2944 error ("caller edge frequency is too large");
2950 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2952 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
2954 bool fndecl_was_null
= false;
2955 /* debug_gimple_stmt needs correct cfun */
2956 if (cfun
!= this_cfun
)
2957 set_cfun (this_cfun
);
2958 /* ...and an actual current_function_decl */
2959 if (!current_function_decl
)
2961 current_function_decl
= this_cfun
->decl
;
2962 fndecl_was_null
= true;
2964 debug_gimple_stmt (stmt
);
2965 if (fndecl_was_null
)
2966 current_function_decl
= NULL
;
2969 /* Verify that call graph edge corresponds to DECL from the associated
2970 statement. Return true if the verification should fail. */
2973 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
2977 if (!decl
|| callee
->global
.inlined_to
)
2979 if (symtab
->state
== LTO_STREAMING
)
2981 node
= cgraph_node::get (decl
);
2983 /* We do not know if a node from a different partition is an alias or what it
2984 aliases and therefore cannot do the former_clone_of check reliably. When
2985 body_removed is set, we have lost all information about what was alias or
2986 thunk of and also cannot proceed. */
2988 || node
->body_removed
2989 || node
->in_other_partition
2990 || callee
->icf_merged
2991 || callee
->in_other_partition
)
2994 node
= node
->ultimate_alias_target ();
2996 /* Optimizers can redirect unreachable calls or calls triggering undefined
2997 behavior to builtin_unreachable. */
2998 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
2999 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
3002 if (callee
->former_clone_of
!= node
->decl
3003 && (node
!= callee
->ultimate_alias_target ())
3004 && !clone_of_p (node
, callee
))
3010 /* Verify cgraph nodes of given cgraph node. */
3012 cgraph_node::verify_node (void)
3015 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
3016 basic_block this_block
;
3017 gimple_stmt_iterator gsi
;
3018 bool error_found
= false;
3023 timevar_push (TV_CGRAPH_VERIFY
);
3024 error_found
|= verify_base ();
3025 for (e
= callees
; e
; e
= e
->next_callee
)
3028 error ("aux field set for edge %s->%s",
3029 identifier_to_locale (e
->caller
->name ()),
3030 identifier_to_locale (e
->callee
->name ()));
3035 error ("execution count is negative");
3038 if (global
.inlined_to
&& same_comdat_group
)
3040 error ("inline clone in same comdat group list");
3043 if (!definition
&& !in_other_partition
&& local
.local
)
3045 error ("local symbols must be defined");
3048 if (global
.inlined_to
&& externally_visible
)
3050 error ("externally visible inline clone");
3053 if (global
.inlined_to
&& address_taken
)
3055 error ("inline clone with address taken");
3058 if (global
.inlined_to
&& force_output
)
3060 error ("inline clone is forced to output");
3063 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3067 error ("aux field set for indirect edge from %s",
3068 identifier_to_locale (e
->caller
->name ()));
3071 if (!e
->indirect_unknown_callee
3072 || !e
->indirect_info
)
3074 error ("An indirect edge from %s is not marked as indirect or has "
3075 "associated indirect_info, the corresponding statement is: ",
3076 identifier_to_locale (e
->caller
->name ()));
3077 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3081 bool check_comdat
= comdat_local_p ();
3082 for (e
= callers
; e
; e
= e
->next_caller
)
3084 if (e
->verify_count_and_frequency ())
3087 && !in_same_comdat_group_p (e
->caller
))
3089 error ("comdat-local function called by %s outside its comdat",
3090 identifier_to_locale (e
->caller
->name ()));
3093 if (!e
->inline_failed
)
3095 if (global
.inlined_to
3096 != (e
->caller
->global
.inlined_to
3097 ? e
->caller
->global
.inlined_to
: e
->caller
))
3099 error ("inlined_to pointer is wrong");
3102 if (callers
->next_caller
)
3104 error ("multiple inline callers");
3109 if (global
.inlined_to
)
3111 error ("inlined_to pointer set for noninline callers");
3115 for (e
= callees
; e
; e
= e
->next_callee
)
3117 if (e
->verify_count_and_frequency ())
3119 if (gimple_has_body_p (e
->caller
->decl
)
3120 && !e
->caller
->global
.inlined_to
3122 /* Optimized out calls are redirected to __builtin_unreachable. */
3125 != builtin_decl_implicit (BUILT_IN_UNREACHABLE
))
3127 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3128 gimple_bb (e
->call_stmt
))))
3130 error ("caller edge frequency %i does not match BB frequency %i",
3132 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3133 gimple_bb (e
->call_stmt
)));
3137 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3139 if (e
->verify_count_and_frequency ())
3141 if (gimple_has_body_p (e
->caller
->decl
)
3142 && !e
->caller
->global
.inlined_to
3145 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3146 gimple_bb (e
->call_stmt
))))
3148 error ("indirect call frequency %i does not match BB frequency %i",
3150 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3151 gimple_bb (e
->call_stmt
)));
3155 if (!callers
&& global
.inlined_to
)
3157 error ("inlined_to pointer is set but no predecessors found");
3160 if (global
.inlined_to
== this)
3162 error ("inlined_to pointer refers to itself");
3169 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
3174 error ("cgraph_node has wrong clone_of");
3181 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
3182 if (n
->clone_of
!= this)
3186 error ("cgraph_node has wrong clone list");
3190 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
3192 error ("cgraph_node is in clone list but it is not clone");
3195 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
3197 error ("cgraph_node has wrong prev_clone pointer");
3200 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
3202 error ("double linked list of clones corrupted");
3206 if (analyzed
&& alias
)
3208 bool ref_found
= false;
3210 ipa_ref
*ref
= NULL
;
3214 error ("Alias has call edges");
3217 for (i
= 0; iterate_reference (i
, ref
); i
++)
3218 if (ref
->use
== IPA_REF_CHKP
)
3220 else if (ref
->use
!= IPA_REF_ALIAS
)
3222 error ("Alias has non-alias reference");
3227 error ("Alias has more than one alias reference");
3234 error ("Analyzed alias has no reference");
3239 /* Check instrumented version reference. */
3240 if (instrumented_version
3241 && instrumented_version
->instrumented_version
!= this)
3243 error ("Instrumentation clone does not reference original node");
3247 /* Cannot have orig_decl for not instrumented nodes. */
3248 if (!instrumentation_clone
&& orig_decl
)
3250 error ("Not instrumented node has non-NULL original declaration");
3254 /* If original not instrumented node still exists then we may check
3255 original declaration is set properly. */
3256 if (instrumented_version
3258 && orig_decl
!= instrumented_version
->decl
)
3260 error ("Instrumented node has wrong original declaration");
3264 /* Check all nodes have chkp reference to their instrumented versions. */
3266 && instrumented_version
3267 && !instrumentation_clone
)
3269 bool ref_found
= false;
3271 struct ipa_ref
*ref
;
3273 for (i
= 0; iterate_reference (i
, ref
); i
++)
3274 if (ref
->use
== IPA_REF_CHKP
)
3278 error ("Node has more than one chkp reference");
3281 if (ref
->referred
!= instrumented_version
)
3283 error ("Wrong node is referenced with chkp reference");
3291 error ("Analyzed node has no reference to instrumented version");
3296 if (instrumentation_clone
3297 && DECL_BUILT_IN_CLASS (decl
) == NOT_BUILT_IN
)
3299 tree name
= DECL_ASSEMBLER_NAME (decl
);
3300 tree orig_name
= DECL_ASSEMBLER_NAME (orig_decl
);
3302 if (!IDENTIFIER_TRANSPARENT_ALIAS (name
)
3303 || TREE_CHAIN (name
) != orig_name
)
3305 error ("Alias chain for instrumented node is broken");
3310 if (analyzed
&& thunk
.thunk_p
)
3314 error ("No edge out of thunk node");
3317 else if (callees
->next_callee
)
3319 error ("More than one edge out of thunk node");
3322 if (gimple_has_body_p (decl
))
3324 error ("Thunk is not supposed to have body");
3327 if (thunk
.add_pointer_bounds_args
3328 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3330 error ("Instrumentation thunk has wrong edge callee");
3334 else if (analyzed
&& gimple_has_body_p (decl
)
3335 && !TREE_ASM_WRITTEN (decl
)
3336 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3341 hash_set
<gimple
*> stmts
;
3343 ipa_ref
*ref
= NULL
;
3345 /* Reach the trees by walking over the CFG, and note the
3346 enclosing basic-blocks in the call edges. */
3347 FOR_EACH_BB_FN (this_block
, this_cfun
)
3349 for (gsi
= gsi_start_phis (this_block
);
3350 !gsi_end_p (gsi
); gsi_next (&gsi
))
3351 stmts
.add (gsi_stmt (gsi
));
3352 for (gsi
= gsi_start_bb (this_block
);
3356 gimple
*stmt
= gsi_stmt (gsi
);
3358 if (is_gimple_call (stmt
))
3360 cgraph_edge
*e
= get_edge (stmt
);
3361 tree decl
= gimple_call_fndecl (stmt
);
3366 error ("shared call_stmt:");
3367 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3370 if (!e
->indirect_unknown_callee
)
3372 if (e
->verify_corresponds_to_fndecl (decl
))
3374 error ("edge points to wrong declaration:");
3375 debug_tree (e
->callee
->decl
);
3376 fprintf (stderr
," Instead of:");
3383 error ("an indirect edge with unknown callee "
3384 "corresponding to a call_stmt with "
3385 "a known declaration:");
3387 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3393 error ("missing callgraph edge for call stmt:");
3394 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3400 for (i
= 0; iterate_reference (i
, ref
); i
++)
3401 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3403 error ("reference to dead statement");
3404 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3409 /* No CFG available?! */
3412 for (e
= callees
; e
; e
= e
->next_callee
)
3416 error ("edge %s->%s has no corresponding call_stmt",
3417 identifier_to_locale (e
->caller
->name ()),
3418 identifier_to_locale (e
->callee
->name ()));
3419 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3424 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3426 if (!e
->aux
&& !e
->speculative
)
3428 error ("an indirect edge from %s has no corresponding call_stmt",
3429 identifier_to_locale (e
->caller
->name ()));
3430 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3439 internal_error ("verify_cgraph_node failed");
3441 timevar_pop (TV_CGRAPH_VERIFY
);
3444 /* Verify whole cgraph structure. */
3446 cgraph_node::verify_cgraph_nodes (void)
3453 FOR_EACH_FUNCTION (node
)
3457 /* Walk the alias chain to return the function cgraph_node is alias of.
3458 Walk through thunks, too.
3459 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3460 When REF is non-NULL, assume that reference happens in symbol REF
3461 when determining the availability. */
3464 cgraph_node::function_symbol (enum availability
*availability
,
3465 struct symtab_node
*ref
)
3467 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3469 while (node
->thunk
.thunk_p
)
3472 node
= node
->callees
->callee
;
3475 enum availability a
;
3476 a
= node
->get_availability (ref
);
3477 if (a
< *availability
)
3480 node
= node
->ultimate_alias_target (availability
, ref
);
3485 /* Walk the alias chain to return the function cgraph_node is alias of.
3486 Walk through non virtual thunks, too. Thus we return either a function
3487 or a virtual thunk node.
3488 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3489 When REF is non-NULL, assume that reference happens in symbol REF
3490 when determining the availability. */
3493 cgraph_node::function_or_virtual_thunk_symbol
3494 (enum availability
*availability
,
3495 struct symtab_node
*ref
)
3497 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3499 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3502 node
= node
->callees
->callee
;
3505 enum availability a
;
3506 a
= node
->get_availability (ref
);
3507 if (a
< *availability
)
3510 node
= node
->ultimate_alias_target (availability
, ref
);
3515 /* When doing LTO, read cgraph_node's body from disk if it is not already
3519 cgraph_node::get_untransformed_body (void)
3521 lto_file_decl_data
*file_data
;
3522 const char *data
, *name
;
3524 tree decl
= this->decl
;
3526 /* Check if body is already there. Either we have gimple body or
3527 the function is thunk and in that case we set DECL_ARGUMENTS. */
3528 if (DECL_ARGUMENTS (decl
) || gimple_has_body_p (decl
))
3531 gcc_assert (in_lto_p
&& !DECL_RESULT (decl
));
3533 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3535 file_data
= lto_file_data
;
3536 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3538 /* We may have renamed the declaration, e.g., a static function. */
3539 name
= lto_get_decl_name_mapping (file_data
, name
);
3540 struct lto_in_decl_state
*decl_state
3541 = lto_get_function_in_decl_state (file_data
, decl
);
3543 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3544 name
, &len
, decl_state
->compressed
);
3546 fatal_error (input_location
, "%s: section %s is missing",
3547 file_data
->file_name
,
3550 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3552 lto_input_function_body (file_data
, this, data
);
3553 lto_stats
.num_function_bodies
++;
3554 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3555 data
, len
, decl_state
->compressed
);
3556 lto_free_function_in_decl_state_for_node (this);
3557 /* Keep lto file data so ipa-inline-analysis knows about cross module
3560 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3565 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3566 if it is not already present. When some IPA transformations are scheduled,
3570 cgraph_node::get_body (void)
3574 updated
= get_untransformed_body ();
3576 /* Getting transformed body makes no sense for inline clones;
3577 we should never use this on real clones because they are materialized
3579 TODO: Materializing clones here will likely lead to smaller LTRANS
3581 gcc_assert (!global
.inlined_to
&& !clone_of
);
3582 if (ipa_transforms_to_apply
.exists ())
3584 opt_pass
*saved_current_pass
= current_pass
;
3585 FILE *saved_dump_file
= dump_file
;
3586 const char *saved_dump_file_name
= dump_file_name
;
3587 int saved_dump_flags
= dump_flags
;
3588 dump_file_name
= NULL
;
3591 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3592 execute_all_ipa_transforms ();
3593 cgraph_edge::rebuild_edges ();
3594 free_dominance_info (CDI_DOMINATORS
);
3595 free_dominance_info (CDI_POST_DOMINATORS
);
3599 current_pass
= saved_current_pass
;
3600 dump_file
= saved_dump_file
;
3601 dump_file_name
= saved_dump_file_name
;
3602 dump_flags
= saved_dump_flags
;
3607 /* Return the DECL_STRUCT_FUNCTION of the function. */
3610 cgraph_node::get_fun (void)
3612 cgraph_node
*node
= this;
3613 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3615 while (!fun
&& node
->clone_of
)
3617 node
= node
->clone_of
;
3618 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3624 /* Verify if the type of the argument matches that of the function
3625 declaration. If we cannot verify this or there is a mismatch,
3629 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3632 unsigned int i
, nargs
;
3634 /* Calls to internal functions always match their signature. */
3635 if (gimple_call_internal_p (stmt
))
3638 nargs
= gimple_call_num_args (stmt
);
3640 /* Get argument types for verification. */
3642 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3644 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3646 /* Verify if the type of the argument matches that of the function
3647 declaration. If we cannot verify this or there is a mismatch,
3649 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3651 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3653 i
++, p
= DECL_CHAIN (p
))
3656 /* We cannot distinguish a varargs function from the case
3657 of excess parameters, still deferring the inlining decision
3658 to the callee is possible. */
3661 arg
= gimple_call_arg (stmt
, i
);
3662 if (p
== error_mark_node
3663 || DECL_ARG_TYPE (p
) == error_mark_node
3664 || arg
== error_mark_node
3665 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3666 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3669 if (args_count_match
&& p
)
3674 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3677 /* If this is a varargs function defer inlining decision
3681 arg
= gimple_call_arg (stmt
, i
);
3682 if (TREE_VALUE (p
) == error_mark_node
3683 || arg
== error_mark_node
3684 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3685 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3686 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3698 /* Verify if the type of the argument and lhs of CALL_STMT matches
3699 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3700 true, the arg count needs to be the same.
3701 If we cannot verify this or there is a mismatch, return false. */
3704 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3705 bool args_count_match
)
3709 if ((DECL_RESULT (callee
)
3710 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3711 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3712 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3714 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3715 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3720 /* Reset all state within cgraph.c so that we can rerun the compiler
3721 within the same process. For use by toplev::finalize. */
3724 cgraph_c_finalize (void)
3728 x_cgraph_nodes_queue
= NULL
;
3730 cgraph_fnver_htab
= NULL
;
3731 version_info_node
= NULL
;
3734 /* A wroker for call_for_symbol_and_aliases. */
3737 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3740 bool include_overwritable
)
3743 FOR_EACH_ALIAS (this, ref
)
3745 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3746 if (include_overwritable
3747 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3748 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3749 include_overwritable
))
3755 /* Return true if NODE has thunk. */
3758 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3760 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3761 if (e
->caller
->thunk
.thunk_p
)
3766 #include "gt-cgraph.h"