1 /* Callgraph handling code.
2 Copyright (C) 2003-2017 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file contains basic routines manipulating call graph
23 The call-graph is a data structure designed for intra-procedural optimization.
24 It represents a multi-graph where nodes are functions and edges are call sites. */
28 #include "coretypes.h"
35 #include "alloc-pool.h"
36 #include "gimple-ssa.h"
38 #include "lto-streamer.h"
39 #include "fold-const.h"
42 #include "print-tree.h"
43 #include "langhooks.h"
46 #include "gimple-iterator.h"
49 #include "value-prof.h"
50 #include "ipa-utils.h"
51 #include "symbol-summary.h"
54 #include "ipa-fnsummary.h"
56 #include "gimple-pretty-print.h"
60 #include "tree-chkp.h"
64 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
65 #include "tree-pass.h"
67 /* Queue of cgraph nodes scheduled to be lowered. */
68 symtab_node
*x_cgraph_nodes_queue
;
69 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
71 /* Symbol table global context. */
74 /* List of hooks triggered on cgraph_edge events. */
75 struct cgraph_edge_hook_list
{
76 cgraph_edge_hook hook
;
78 struct cgraph_edge_hook_list
*next
;
81 /* List of hooks triggered on cgraph_node events. */
82 struct cgraph_node_hook_list
{
83 cgraph_node_hook hook
;
85 struct cgraph_node_hook_list
*next
;
88 /* List of hooks triggered on events involving two cgraph_edges. */
89 struct cgraph_2edge_hook_list
{
90 cgraph_2edge_hook hook
;
92 struct cgraph_2edge_hook_list
*next
;
95 /* List of hooks triggered on events involving two cgraph_nodes. */
96 struct cgraph_2node_hook_list
{
97 cgraph_2node_hook hook
;
99 struct cgraph_2node_hook_list
*next
;
102 /* Hash descriptor for cgraph_function_version_info. */
104 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
106 static hashval_t
hash (cgraph_function_version_info
*);
107 static bool equal (cgraph_function_version_info
*,
108 cgraph_function_version_info
*);
111 /* Map a cgraph_node to cgraph_function_version_info using this htab.
112 The cgraph_function_version_info has a THIS_NODE field that is the
113 corresponding cgraph_node.. */
115 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
117 /* Hash function for cgraph_fnver_htab. */
119 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
121 int uid
= ptr
->this_node
->uid
;
122 return (hashval_t
)(uid
);
125 /* eq function for cgraph_fnver_htab. */
127 function_version_hasher::equal (cgraph_function_version_info
*n1
,
128 cgraph_function_version_info
*n2
)
130 return n1
->this_node
->uid
== n2
->this_node
->uid
;
133 /* Mark as GC root all allocated nodes. */
134 static GTY(()) struct cgraph_function_version_info
*
135 version_info_node
= NULL
;
137 /* Return true if NODE's address can be compared. */
140 symtab_node::address_can_be_compared_p ()
142 /* Address of virtual tables and functions is never compared. */
143 if (DECL_VIRTUAL_P (decl
))
145 /* Address of C++ cdtors is never compared. */
146 if (is_a
<cgraph_node
*> (this)
147 && (DECL_CXX_CONSTRUCTOR_P (decl
)
148 || DECL_CXX_DESTRUCTOR_P (decl
)))
150 /* Constant pool symbols addresses are never compared.
151 flag_merge_constants permits us to assume the same on readonly vars. */
152 if (is_a
<varpool_node
*> (this)
153 && (DECL_IN_CONSTANT_POOL (decl
)
154 || (flag_merge_constants
>= 2
155 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
160 /* Get the cgraph_function_version_info node corresponding to node. */
161 cgraph_function_version_info
*
162 cgraph_node::function_version (void)
164 cgraph_function_version_info key
;
165 key
.this_node
= this;
167 if (cgraph_fnver_htab
== NULL
)
170 return cgraph_fnver_htab
->find (&key
);
173 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
174 corresponding to cgraph_node NODE. */
175 cgraph_function_version_info
*
176 cgraph_node::insert_new_function_version (void)
178 version_info_node
= NULL
;
179 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
180 version_info_node
->this_node
= this;
182 if (cgraph_fnver_htab
== NULL
)
183 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
185 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
187 return version_info_node
;
190 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
191 DECL is a duplicate declaration. */
193 cgraph_node::delete_function_version (tree decl
)
195 cgraph_node
*decl_node
= cgraph_node::get (decl
);
196 cgraph_function_version_info
*decl_v
= NULL
;
198 if (decl_node
== NULL
)
201 decl_v
= decl_node
->function_version ();
206 if (decl_v
->prev
!= NULL
)
207 decl_v
->prev
->next
= decl_v
->next
;
209 if (decl_v
->next
!= NULL
)
210 decl_v
->next
->prev
= decl_v
->prev
;
212 if (cgraph_fnver_htab
!= NULL
)
213 cgraph_fnver_htab
->remove_elt (decl_v
);
215 decl_node
->remove ();
218 /* Record that DECL1 and DECL2 are semantically identical function
221 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
223 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
224 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
225 cgraph_function_version_info
*decl1_v
= NULL
;
226 cgraph_function_version_info
*decl2_v
= NULL
;
227 cgraph_function_version_info
*before
;
228 cgraph_function_version_info
*after
;
230 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
231 decl1_v
= decl1_node
->function_version ();
232 decl2_v
= decl2_node
->function_version ();
234 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
238 decl1_v
= decl1_node
->insert_new_function_version ();
241 decl2_v
= decl2_node
->insert_new_function_version ();
243 /* Chain decl2_v and decl1_v. All semantically identical versions
244 will be chained together. */
249 while (before
->next
!= NULL
)
250 before
= before
->next
;
252 while (after
->prev
!= NULL
)
255 before
->next
= after
;
256 after
->prev
= before
;
259 /* Initialize callgraph dump file. */
262 symbol_table::initialize (void)
265 dump_file
= dump_begin (TDI_cgraph
, NULL
);
267 if (!ipa_clones_dump_file
)
268 ipa_clones_dump_file
= dump_begin (TDI_clones
, NULL
);
271 /* Allocate new callgraph node and insert it into basic data structures. */
274 symbol_table::create_empty (void)
276 cgraph_node
*node
= allocate_cgraph_symbol ();
278 node
->type
= SYMTAB_FUNCTION
;
279 node
->frequency
= NODE_FREQUENCY_NORMAL
;
280 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
286 /* Register HOOK to be called with DATA on each removed edge. */
287 cgraph_edge_hook_list
*
288 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
290 cgraph_edge_hook_list
*entry
;
291 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
293 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
303 /* Remove ENTRY from the list of hooks called on removing edges. */
305 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
307 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
309 while (*ptr
!= entry
)
315 /* Call all edge removal hooks. */
317 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
319 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
322 entry
->hook (e
, entry
->data
);
327 /* Register HOOK to be called with DATA on each removed node. */
328 cgraph_node_hook_list
*
329 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
331 cgraph_node_hook_list
*entry
;
332 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
334 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
344 /* Remove ENTRY from the list of hooks called on removing nodes. */
346 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
348 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
350 while (*ptr
!= entry
)
356 /* Call all node removal hooks. */
358 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
360 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
363 entry
->hook (node
, entry
->data
);
368 /* Call all node removal hooks. */
370 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
372 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
375 entry
->hook (node
, entry
->data
);
381 /* Register HOOK to be called with DATA on each inserted node. */
382 cgraph_node_hook_list
*
383 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
385 cgraph_node_hook_list
*entry
;
386 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
388 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
398 /* Remove ENTRY from the list of hooks called on inserted nodes. */
400 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
402 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
404 while (*ptr
!= entry
)
410 /* Register HOOK to be called with DATA on each duplicated edge. */
411 cgraph_2edge_hook_list
*
412 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
414 cgraph_2edge_hook_list
*entry
;
415 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
417 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
427 /* Remove ENTRY from the list of hooks called on duplicating edges. */
429 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
431 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
433 while (*ptr
!= entry
)
439 /* Call all edge duplication hooks. */
441 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
443 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
446 entry
->hook (cs1
, cs2
, entry
->data
);
451 /* Register HOOK to be called with DATA on each duplicated node. */
452 cgraph_2node_hook_list
*
453 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
455 cgraph_2node_hook_list
*entry
;
456 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
458 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
468 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
470 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
472 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
474 while (*ptr
!= entry
)
480 /* Call all node duplication hooks. */
482 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
485 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
488 entry
->hook (node
, node2
, entry
->data
);
493 /* Return cgraph node assigned to DECL. Create new one when needed. */
496 cgraph_node::create (tree decl
)
498 cgraph_node
*node
= symtab
->create_empty ();
499 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
503 if ((flag_openacc
|| flag_openmp
)
504 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
506 node
->offloadable
= 1;
507 if (ENABLE_OFFLOADING
)
508 g
->have_offload
= true;
511 node
->register_symbol ();
513 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
515 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
516 node
->next_nested
= node
->origin
->nested
;
517 node
->origin
->nested
= node
;
522 /* Try to find a call graph node for declaration DECL and if it does not exist
523 or if it corresponds to an inline clone, create a new one. */
526 cgraph_node::get_create (tree decl
)
528 cgraph_node
*first_clone
= cgraph_node::get (decl
);
530 if (first_clone
&& !first_clone
->global
.inlined_to
)
533 cgraph_node
*node
= cgraph_node::create (decl
);
536 first_clone
->clone_of
= node
;
537 node
->clones
= first_clone
;
538 symtab
->symtab_prevail_in_asm_name_hash (node
);
539 node
->decl
->decl_with_vis
.symtab_node
= node
;
541 fprintf (dump_file
, "Introduced new external node "
542 "(%s) and turned into root of the clone tree.\n",
546 fprintf (dump_file
, "Introduced new external node "
547 "(%s).\n", node
->dump_name ());
551 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
552 the function body is associated with (not necessarily cgraph_node (DECL). */
555 cgraph_node::create_alias (tree alias
, tree target
)
557 cgraph_node
*alias_node
;
559 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
560 || TREE_CODE (target
) == IDENTIFIER_NODE
);
561 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
562 alias_node
= cgraph_node::get_create (alias
);
563 gcc_assert (!alias_node
->definition
);
564 alias_node
->alias_target
= target
;
565 alias_node
->definition
= true;
566 alias_node
->alias
= true;
567 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
568 alias_node
->transparent_alias
= alias_node
->weakref
= true;
572 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
574 Same body aliases are output whenever the body of DECL is output,
575 and cgraph_node::get (ALIAS) transparently returns
576 cgraph_node::get (DECL). */
579 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
582 #ifndef ASM_OUTPUT_DEF
583 /* If aliases aren't supported by the assembler, fail. */
586 /* Langhooks can create same body aliases of symbols not defined.
587 Those are useless. Drop them on the floor. */
588 if (symtab
->global_info_ready
)
591 n
= cgraph_node::create_alias (alias
, decl
);
592 n
->cpp_implicit_alias
= true;
593 if (symtab
->cpp_implicit_aliases_done
)
594 n
->resolve_alias (cgraph_node::get (decl
));
598 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
599 aliases DECL with an adjustments made into the first parameter.
600 See comments in thunk_adjust for detail on the parameters. */
603 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
604 HOST_WIDE_INT fixed_offset
,
605 HOST_WIDE_INT virtual_value
,
611 node
= cgraph_node::get (alias
);
615 node
= cgraph_node::create (alias
);
616 gcc_checking_assert (!virtual_offset
617 || wi::eq_p (virtual_offset
, virtual_value
));
618 node
->thunk
.fixed_offset
= fixed_offset
;
619 node
->thunk
.this_adjusting
= this_adjusting
;
620 node
->thunk
.virtual_value
= virtual_value
;
621 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
622 node
->thunk
.alias
= real_alias
;
623 node
->thunk
.thunk_p
= true;
624 node
->definition
= true;
629 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
630 Return NULL if there's no such node. */
633 cgraph_node::get_for_asmname (tree asmname
)
635 /* We do not want to look at inline clones. */
636 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
638 node
= node
->next_sharing_asm_name
)
640 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
641 if (cn
&& !cn
->global
.inlined_to
)
647 /* Returns a hash value for X (which really is a cgraph_edge). */
650 cgraph_edge_hasher::hash (cgraph_edge
*e
)
652 /* This is a really poor hash function, but it is what htab_hash_pointer
654 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
657 /* Returns a hash value for X (which really is a cgraph_edge). */
660 cgraph_edge_hasher::hash (gimple
*call_stmt
)
662 /* This is a really poor hash function, but it is what htab_hash_pointer
664 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
667 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
670 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
672 return x
->call_stmt
== y
;
675 /* Add call graph edge E to call site hash of its caller. */
678 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
680 gimple
*call
= e
->call_stmt
;
681 *e
->caller
->call_site_hash
->find_slot_with_hash
682 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
685 /* Add call graph edge E to call site hash of its caller. */
688 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
690 /* There are two speculative edges for every statement (one direct,
691 one indirect); always hash the direct one. */
692 if (e
->speculative
&& e
->indirect_unknown_callee
)
694 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
695 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
698 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
703 gcc_assert (!*slot
|| e
->speculative
);
707 /* Return the callgraph edge representing the GIMPLE_CALL statement
711 cgraph_node::get_edge (gimple
*call_stmt
)
717 return call_site_hash
->find_with_hash
718 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
720 /* This loop may turn out to be performance problem. In such case adding
721 hashtables into call nodes with very many edges is probably best
722 solution. It is not good idea to add pointer into CALL_EXPR itself
723 because we want to make possible having multiple cgraph nodes representing
724 different clones of the same body before the body is actually cloned. */
725 for (e
= callees
; e
; e
= e
->next_callee
)
727 if (e
->call_stmt
== call_stmt
)
733 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
735 if (e
->call_stmt
== call_stmt
)
742 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
743 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
744 cgraph_add_edge_to_call_site_hash (e2
);
745 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
746 cgraph_add_edge_to_call_site_hash (e2
);
753 /* Change field call_stmt of edge to NEW_STMT.
754 If UPDATE_SPECULATIVE and E is any component of speculative
755 edge, then update all components. */
758 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
762 /* Speculative edges has three component, update all of them
764 if (update_speculative
&& speculative
)
766 cgraph_edge
*direct
, *indirect
;
769 speculative_call_info (direct
, indirect
, ref
);
770 direct
->set_call_stmt (new_stmt
, false);
771 indirect
->set_call_stmt (new_stmt
, false);
772 ref
->stmt
= new_stmt
;
776 /* Only direct speculative edges go to call_site_hash. */
777 if (caller
->call_site_hash
778 && (!speculative
|| !indirect_unknown_callee
))
780 caller
->call_site_hash
->remove_elt_with_hash
781 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
784 cgraph_edge
*e
= this;
786 call_stmt
= new_stmt
;
787 if (indirect_unknown_callee
788 && (decl
= gimple_call_fndecl (new_stmt
)))
790 /* Constant propagation (and possibly also inlining?) can turn an
791 indirect call into a direct one. */
792 cgraph_node
*new_callee
= cgraph_node::get (decl
);
794 gcc_checking_assert (new_callee
);
795 e
= make_direct (new_callee
);
798 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
799 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
801 if (e
->caller
->call_site_hash
)
802 cgraph_add_edge_to_call_site_hash (e
);
805 /* Allocate a cgraph_edge structure and fill it with data according to the
806 parameters of which only CALLEE can be NULL (when creating an indirect call
810 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
811 gcall
*call_stmt
, gcov_type count
, int freq
,
812 bool indir_unknown_callee
)
816 /* LTO does not actually have access to the call_stmt since these
817 have not been loaded yet. */
820 /* This is a rather expensive check possibly triggering
821 construction of call stmt hashtable. */
823 gcc_checking_assert (!(e
= caller
->get_edge (call_stmt
))
826 gcc_assert (is_gimple_call (call_stmt
));
832 free_edges
= NEXT_FREE_EDGE (edge
);
836 edge
= ggc_alloc
<cgraph_edge
> ();
837 edge
->uid
= edges_max_uid
++;
843 edge
->caller
= caller
;
844 edge
->callee
= callee
;
845 edge
->prev_caller
= NULL
;
846 edge
->next_caller
= NULL
;
847 edge
->prev_callee
= NULL
;
848 edge
->next_callee
= NULL
;
849 edge
->lto_stmt_uid
= 0;
852 gcc_assert (count
>= 0);
853 edge
->frequency
= freq
;
854 gcc_assert (freq
>= 0);
855 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
857 edge
->call_stmt
= call_stmt
;
858 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
859 edge
->can_throw_external
860 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
863 && callee
&& callee
->decl
864 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
867 edge
->inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
868 edge
->call_stmt_cannot_inline_p
= true;
872 edge
->inline_failed
= CIF_FUNCTION_NOT_CONSIDERED
;
873 edge
->call_stmt_cannot_inline_p
= false;
876 edge
->indirect_info
= NULL
;
877 edge
->indirect_inlining_edge
= 0;
878 edge
->speculative
= false;
879 edge
->indirect_unknown_callee
= indir_unknown_callee
;
880 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
881 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
882 edge
->in_polymorphic_cdtor
883 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
886 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
887 if (call_stmt
&& caller
->call_site_hash
)
888 cgraph_add_edge_to_call_site_hash (edge
);
893 /* Create edge from a given function to CALLEE in the cgraph. */
896 cgraph_node::create_edge (cgraph_node
*callee
,
897 gcall
*call_stmt
, gcov_type count
, int freq
)
899 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
902 initialize_inline_failed (edge
);
904 edge
->next_caller
= callee
->callers
;
906 callee
->callers
->prev_caller
= edge
;
907 edge
->next_callee
= callees
;
909 callees
->prev_callee
= edge
;
911 callee
->callers
= edge
;
916 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
918 cgraph_indirect_call_info
*
919 cgraph_allocate_init_indirect_info (void)
921 cgraph_indirect_call_info
*ii
;
923 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
924 ii
->param_index
= -1;
928 /* Create an indirect edge with a yet-undetermined callee where the call
929 statement destination is a formal parameter of the caller with index
933 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
934 gcov_type count
, int freq
,
935 bool compute_indirect_info
)
937 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
941 initialize_inline_failed (edge
);
943 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
944 edge
->indirect_info
->ecf_flags
= ecf_flags
;
945 edge
->indirect_info
->vptr_changed
= true;
947 /* Record polymorphic call info. */
948 if (compute_indirect_info
950 && (target
= gimple_call_fn (call_stmt
))
951 && virtual_method_call_p (target
))
953 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
955 /* Only record types can have virtual calls. */
956 edge
->indirect_info
->polymorphic
= true;
957 edge
->indirect_info
->param_index
= -1;
958 edge
->indirect_info
->otr_token
959 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
960 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
961 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
962 edge
->indirect_info
->context
= context
;
965 edge
->next_callee
= indirect_calls
;
967 indirect_calls
->prev_callee
= edge
;
968 indirect_calls
= edge
;
973 /* Remove the edge from the list of the callees of the caller. */
976 cgraph_edge::remove_caller (void)
979 prev_callee
->next_callee
= next_callee
;
981 next_callee
->prev_callee
= prev_callee
;
984 if (indirect_unknown_callee
)
985 caller
->indirect_calls
= next_callee
;
987 caller
->callees
= next_callee
;
989 if (caller
->call_site_hash
)
990 caller
->call_site_hash
->remove_elt_with_hash
991 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
994 /* Put the edge onto the free list. */
997 symbol_table::free_edge (cgraph_edge
*e
)
1001 if (e
->indirect_info
)
1002 ggc_free (e
->indirect_info
);
1004 /* Clear out the edge so we do not dangle pointers. */
1005 memset (e
, 0, sizeof (*e
));
1007 NEXT_FREE_EDGE (e
) = free_edges
;
1012 /* Remove the edge in the cgraph. */
1015 cgraph_edge::remove (void)
1017 /* Call all edge removal hooks. */
1018 symtab
->call_edge_removal_hooks (this);
1020 if (!indirect_unknown_callee
)
1021 /* Remove from callers list of the callee. */
1024 /* Remove from callees list of the callers. */
1027 /* Put the edge onto the free list. */
1028 symtab
->free_edge (this);
1031 /* Turn edge into speculative call calling N2. Update
1032 the profile so the direct call is taken COUNT times
1035 At clone materialization time, the indirect call E will
1038 if (call_dest == N2)
1043 At this time the function just creates the direct call,
1044 the referencd representing the if conditional and attaches
1045 them all to the orginal indirect call statement.
1047 Return direct edge created. */
1050 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1051 int direct_frequency
)
1053 cgraph_node
*n
= caller
;
1054 ipa_ref
*ref
= NULL
;
1058 fprintf (dump_file
, "Indirect call -> speculative call %s => %s\n",
1059 n
->dump_name (), n2
->dump_name ());
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 => %s has "
1163 "turned out to have contradicting known target ",
1164 edge
->caller
->dump_name (),
1165 e2
->callee
->dump_name ());
1166 print_generic_expr (dump_file
, callee_decl
);
1167 fprintf (dump_file
, "\n");
1171 fprintf (dump_file
, "Removing speculative call %s => %s\n",
1172 edge
->caller
->dump_name (),
1173 e2
->callee
->dump_name ());
1179 cgraph_edge
*tmp
= edge
;
1181 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1184 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1185 in the functions inlined through it. */
1187 edge
->count
+= e2
->count
;
1188 edge
->frequency
+= e2
->frequency
;
1189 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1190 edge
->frequency
= CGRAPH_FREQ_MAX
;
1191 edge
->speculative
= false;
1192 e2
->speculative
= false;
1193 ref
->remove_reference ();
1194 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1197 e2
->callee
->remove_symbol_and_inline_clones ();
1198 if (edge
->caller
->call_site_hash
)
1199 cgraph_update_edge_in_call_site_hash (edge
);
1203 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1204 CALLEE. DELTA is an integer constant that is to be added to the this
1205 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1208 cgraph_edge::make_direct (cgraph_node
*callee
)
1210 cgraph_edge
*edge
= this;
1211 gcc_assert (indirect_unknown_callee
);
1213 /* If we are redirecting speculative call, make it non-speculative. */
1214 if (indirect_unknown_callee
&& speculative
)
1216 edge
= edge
->resolve_speculation (callee
->decl
);
1218 /* On successful speculation just return the pre existing direct edge. */
1219 if (!indirect_unknown_callee
)
1223 indirect_unknown_callee
= 0;
1224 ggc_free (indirect_info
);
1225 indirect_info
= NULL
;
1227 /* Get the edge out of the indirect edge list. */
1229 prev_callee
->next_callee
= next_callee
;
1231 next_callee
->prev_callee
= prev_callee
;
1233 caller
->indirect_calls
= next_callee
;
1235 /* Put it into the normal callee list */
1237 next_callee
= caller
->callees
;
1238 if (caller
->callees
)
1239 caller
->callees
->prev_callee
= edge
;
1240 caller
->callees
= edge
;
1242 /* Insert to callers list of the new callee. */
1243 edge
->set_callee (callee
);
1246 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
, false))
1248 call_stmt_cannot_inline_p
= true;
1249 inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
1252 /* We need to re-determine the inlining status of the edge. */
1253 initialize_inline_failed (edge
);
1257 /* If necessary, change the function declaration in the call statement
1258 associated with E so that it corresponds to the edge callee. */
1261 cgraph_edge::redirect_call_stmt_to_callee (void)
1263 cgraph_edge
*e
= this;
1265 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1267 gimple_stmt_iterator gsi
;
1268 bool skip_bounds
= false;
1276 e
->speculative_call_info (e
, e2
, ref
);
1277 /* If there already is an direct call (i.e. as a result of inliner's
1278 substitution), forget about speculating. */
1280 e
= e
->resolve_speculation (decl
);
1281 /* If types do not match, speculation was likely wrong.
1282 The direct edge was possibly redirected to the clone with a different
1283 signature. We did not update the call statement yet, so compare it
1284 with the reference that still points to the proper type. */
1285 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1286 ref
->referred
->decl
,
1290 fprintf (dump_file
, "Not expanding speculative call of %s -> %s\n"
1292 e
->caller
->dump_name (),
1293 e
->callee
->dump_name ());
1294 e
= e
->resolve_speculation ();
1295 /* We are producing the final function body and will throw away the
1296 callgraph edges really soon. Reset the counts/frequencies to
1297 keep verifier happy in the case of roundoff errors. */
1298 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1299 e
->frequency
= compute_call_stmt_bb_frequency
1300 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1302 /* Expand speculation into GIMPLE code. */
1307 "Expanding speculative call of %s -> %s count: "
1309 e
->caller
->dump_name (),
1310 e
->callee
->dump_name (),
1312 gcc_assert (e2
->speculative
);
1313 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1314 new_stmt
= gimple_ic (e
->call_stmt
,
1315 dyn_cast
<cgraph_node
*> (ref
->referred
),
1316 e
->count
|| e2
->count
1317 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1318 e
->count
+ e2
->count
)
1319 : e
->frequency
|| e2
->frequency
1320 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1321 e
->frequency
+ e2
->frequency
)
1322 : REG_BR_PROB_BASE
/ 2,
1323 e
->count
, e
->count
+ e2
->count
);
1324 e
->speculative
= false;
1325 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1328 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1329 processed call stmt. */
1330 if (gimple_call_with_bounds_p (new_stmt
)
1331 && gimple_call_lhs (new_stmt
)
1332 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1334 tree dresult
= gimple_call_lhs (new_stmt
);
1335 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1336 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1337 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1338 struct cgraph_edge
*iedge
1339 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1340 struct cgraph_edge
*dedge
;
1344 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1347 dedge
->frequency
= compute_call_stmt_bb_frequency
1348 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1350 iedge
->frequency
= compute_call_stmt_bb_frequency
1351 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1354 e
->frequency
= compute_call_stmt_bb_frequency
1355 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1356 e2
->frequency
= compute_call_stmt_bb_frequency
1357 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1358 e2
->speculative
= false;
1359 ref
->speculative
= false;
1361 /* Indirect edges are not both in the call site hash.
1363 if (e
->caller
->call_site_hash
)
1364 cgraph_update_edge_in_call_site_hash (e2
);
1366 /* Continue redirecting E to proper target. */
1370 /* We might propagate instrumented function pointer into
1371 not instrumented function and vice versa. In such a
1372 case we need to either fix function declaration or
1373 remove bounds from call statement. */
1374 if (flag_check_pointer_bounds
&& e
->callee
)
1375 skip_bounds
= chkp_redirect_edge (e
);
1377 if (e
->indirect_unknown_callee
1378 || (decl
== e
->callee
->decl
1380 return e
->call_stmt
;
1382 if (flag_checking
&& decl
)
1384 cgraph_node
*node
= cgraph_node::get (decl
);
1385 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1388 if (symtab
->dump_file
)
1390 fprintf (symtab
->dump_file
, "updating call of %s -> %s: ",
1391 e
->caller
->dump_name (), e
->callee
->dump_name ());
1392 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1393 if (e
->callee
->clone
.combined_args_to_skip
)
1395 fprintf (symtab
->dump_file
, " combined args to skip: ");
1396 dump_bitmap (symtab
->dump_file
,
1397 e
->callee
->clone
.combined_args_to_skip
);
1401 if (e
->callee
->clone
.combined_args_to_skip
1406 new_stmt
= e
->call_stmt
;
1407 if (e
->callee
->clone
.combined_args_to_skip
)
1409 = gimple_call_copy_skip_args (new_stmt
,
1410 e
->callee
->clone
.combined_args_to_skip
);
1412 new_stmt
= chkp_copy_call_skip_bounds (new_stmt
);
1414 tree old_fntype
= gimple_call_fntype (e
->call_stmt
);
1415 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1416 cgraph_node
*origin
= e
->callee
;
1417 while (origin
->clone_of
)
1418 origin
= origin
->clone_of
;
1420 if ((origin
->former_clone_of
1421 && old_fntype
== TREE_TYPE (origin
->former_clone_of
))
1422 || old_fntype
== TREE_TYPE (origin
->decl
))
1423 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1426 bitmap skip
= e
->callee
->clone
.combined_args_to_skip
;
1427 tree t
= cgraph_build_function_type_skip_args (old_fntype
, skip
,
1429 gimple_call_set_fntype (new_stmt
, t
);
1432 if (gimple_vdef (new_stmt
)
1433 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1434 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1436 gsi
= gsi_for_stmt (e
->call_stmt
);
1438 /* For optimized away parameters, add on the caller side
1440 DEBUG D#X => parm_Y(D)
1441 stmts and associate D#X with parm in decl_debug_args_lookup
1442 vector to say for debug info that if parameter parm had been passed,
1443 it would have value parm_Y(D). */
1444 if (e
->callee
->clone
.combined_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
1446 vec
<tree
, va_gc
> **debug_args
1447 = decl_debug_args_lookup (e
->callee
->decl
);
1448 tree old_decl
= gimple_call_fndecl (e
->call_stmt
);
1449 if (debug_args
&& old_decl
)
1452 unsigned i
= 0, num
;
1453 unsigned len
= vec_safe_length (*debug_args
);
1454 unsigned nargs
= gimple_call_num_args (e
->call_stmt
);
1455 for (parm
= DECL_ARGUMENTS (old_decl
), num
= 0;
1456 parm
&& num
< nargs
;
1457 parm
= DECL_CHAIN (parm
), num
++)
1458 if (bitmap_bit_p (e
->callee
->clone
.combined_args_to_skip
, num
)
1459 && is_gimple_reg (parm
))
1463 while (i
< len
&& (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1469 && (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1474 tree ddecl
= (**debug_args
)[i
+ 1];
1475 tree arg
= gimple_call_arg (e
->call_stmt
, num
);
1476 if (!useless_type_conversion_p (TREE_TYPE (ddecl
),
1480 if (!fold_convertible_p (TREE_TYPE (ddecl
), arg
))
1482 if (TREE_CODE (arg
) == SSA_NAME
1483 && gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg
))
1485 = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (arg
)))
1486 && useless_type_conversion_p (TREE_TYPE (ddecl
),
1490 arg
= fold_convert (TREE_TYPE (ddecl
), arg
);
1494 = gimple_build_debug_bind (ddecl
, unshare_expr (arg
),
1496 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
1501 gsi_replace (&gsi
, new_stmt
, false);
1502 /* We need to defer cleaning EH info on the new statement to
1503 fixup-cfg. We may not have dominator information at this point
1504 and thus would end up with unreachable blocks and have no way
1505 to communicate that we need to run CFG cleanup then. */
1506 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1509 remove_stmt_from_eh_lp (e
->call_stmt
);
1510 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1515 new_stmt
= e
->call_stmt
;
1516 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1517 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1520 /* If changing the call to __cxa_pure_virtual or similar noreturn function,
1521 adjust gimple_call_fntype too. */
1522 if (gimple_call_noreturn_p (new_stmt
)
1523 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e
->callee
->decl
)))
1524 && TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
))
1525 && (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
)))
1527 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1529 /* If the call becomes noreturn, remove the LHS if possible. */
1530 tree lhs
= gimple_call_lhs (new_stmt
);
1532 && gimple_call_noreturn_p (new_stmt
)
1533 && (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt
)))
1534 || should_remove_lhs_p (lhs
)))
1536 if (TREE_CODE (lhs
) == SSA_NAME
)
1538 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1539 TREE_TYPE (lhs
), NULL
);
1540 var
= get_or_create_ssa_default_def
1541 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1542 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1543 gsi
= gsi_for_stmt (new_stmt
);
1544 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1545 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1547 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1548 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1551 /* If new callee has no static chain, remove it. */
1552 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1554 gimple_call_set_chain (new_stmt
, NULL
);
1555 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1558 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1561 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1563 if (symtab
->dump_file
)
1565 fprintf (symtab
->dump_file
, " updated to:");
1566 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1571 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1572 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1573 of OLD_STMT if it was previously call statement.
1574 If NEW_STMT is NULL, the call has been dropped without any
1578 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1579 gimple
*old_stmt
, tree old_call
,
1582 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1583 ? gimple_call_fndecl (new_stmt
) : 0;
1585 /* We are seeing indirect calls, then there is nothing to update. */
1586 if (!new_call
&& !old_call
)
1588 /* See if we turned indirect call into direct call or folded call to one builtin
1589 into different builtin. */
1590 if (old_call
!= new_call
)
1592 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1593 cgraph_edge
*ne
= NULL
;
1599 /* Keep calls marked as dead dead. */
1600 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1601 && DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
1602 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
1604 node
->get_edge (old_stmt
)->set_call_stmt
1605 (as_a
<gcall
*> (new_stmt
));
1608 /* See if the edge is already there and has the correct callee. It
1609 might be so because of indirect inlining has already updated
1610 it. We also might've cloned and redirected the edge. */
1611 if (new_call
&& e
->callee
)
1613 cgraph_node
*callee
= e
->callee
;
1616 if (callee
->decl
== new_call
1617 || callee
->former_clone_of
== new_call
)
1619 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1622 callee
= callee
->clone_of
;
1626 /* Otherwise remove edge and create new one; we can't simply redirect
1627 since function has changed, so inline plan and other information
1628 attached to edge is invalid. */
1630 frequency
= e
->frequency
;
1631 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1634 e
->callee
->remove_symbol_and_inline_clones ();
1638 /* We are seeing new direct call; compute profile info based on BB. */
1639 basic_block bb
= gimple_bb (new_stmt
);
1641 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1647 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1648 as_a
<gcall
*> (new_stmt
), count
,
1650 gcc_assert (ne
->inline_failed
);
1653 /* We only updated the call stmt; update pointer in cgraph edge.. */
1654 else if (old_stmt
!= new_stmt
)
1655 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1658 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1659 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1660 of OLD_STMT before it was updated (updating can happen inplace). */
1663 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1666 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1669 gcc_checking_assert (orig
);
1670 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1672 for (node
= orig
->clones
; node
!= orig
;)
1674 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1676 node
= node
->clones
;
1677 else if (node
->next_sibling_clone
)
1678 node
= node
->next_sibling_clone
;
1681 while (node
!= orig
&& !node
->next_sibling_clone
)
1682 node
= node
->clone_of
;
1684 node
= node
->next_sibling_clone
;
1690 /* Remove all callees from the node. */
1693 cgraph_node::remove_callees (void)
1697 /* It is sufficient to remove the edges from the lists of callers of
1698 the callees. The callee list of the node can be zapped with one
1700 for (e
= callees
; e
; e
= f
)
1703 symtab
->call_edge_removal_hooks (e
);
1704 if (!e
->indirect_unknown_callee
)
1705 e
->remove_callee ();
1706 symtab
->free_edge (e
);
1708 for (e
= indirect_calls
; e
; e
= f
)
1711 symtab
->call_edge_removal_hooks (e
);
1712 if (!e
->indirect_unknown_callee
)
1713 e
->remove_callee ();
1714 symtab
->free_edge (e
);
1716 indirect_calls
= NULL
;
1720 call_site_hash
->empty ();
1721 call_site_hash
= NULL
;
1725 /* Remove all callers from the node. */
1728 cgraph_node::remove_callers (void)
1732 /* It is sufficient to remove the edges from the lists of callees of
1733 the callers. The caller list of the node can be zapped with one
1735 for (e
= callers
; e
; e
= f
)
1738 symtab
->call_edge_removal_hooks (e
);
1739 e
->remove_caller ();
1740 symtab
->free_edge (e
);
1745 /* Helper function for cgraph_release_function_body and free_lang_data.
1746 It releases body from function DECL without having to inspect its
1747 possibly non-existent symtab node. */
1750 release_function_body (tree decl
)
1752 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1756 && loops_for_fn (fn
))
1758 fn
->curr_properties
&= ~PROP_loops
;
1759 loop_optimizer_finalize (fn
);
1763 delete_tree_ssa (fn
);
1768 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1769 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1770 delete_tree_cfg_annotations (fn
);
1774 if (fn
->value_histograms
)
1775 free_histograms (fn
);
1776 gimple_set_body (decl
, NULL
);
1777 /* Struct function hangs a lot of data that would leak if we didn't
1778 removed all pointers to it. */
1780 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1782 DECL_SAVED_TREE (decl
) = NULL
;
1785 /* Release memory used to represent body of function.
1786 Use this only for functions that are released before being translated to
1787 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1788 are free'd in final.c via free_after_compilation().
1789 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1792 cgraph_node::release_body (bool keep_arguments
)
1794 ipa_transforms_to_apply
.release ();
1795 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1797 DECL_RESULT (decl
) = NULL
;
1799 if (!keep_arguments
)
1800 DECL_ARGUMENTS (decl
) = NULL
;
1802 /* If the node is abstract and needed, then do not clear
1803 DECL_INITIAL of its associated function declaration because it's
1804 needed to emit debug info later. */
1805 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1806 DECL_INITIAL (decl
) = error_mark_node
;
1807 release_function_body (decl
);
1810 lto_free_function_in_decl_state_for_node (this);
1811 lto_file_data
= NULL
;
1815 /* Remove function from symbol table. */
1818 cgraph_node::remove (void)
1821 int uid
= this->uid
;
1823 if (symtab
->ipa_clones_dump_file
&& symtab
->cloned_nodes
.contains (this))
1824 fprintf (symtab
->ipa_clones_dump_file
,
1825 "Callgraph removal;%s;%d;%s;%d;%d\n", asm_name (), order
,
1826 DECL_SOURCE_FILE (decl
), DECL_SOURCE_LINE (decl
),
1827 DECL_SOURCE_COLUMN (decl
));
1829 symtab
->call_cgraph_removal_hooks (this);
1832 ipa_transforms_to_apply
.release ();
1834 /* Incremental inlining access removed nodes stored in the postorder list.
1836 force_output
= false;
1837 forced_by_abi
= false;
1838 for (n
= nested
; n
; n
= n
->next_nested
)
1843 cgraph_node
**node2
= &origin
->nested
;
1845 while (*node2
!= this)
1846 node2
= &(*node2
)->next_nested
;
1847 *node2
= next_nested
;
1850 if (prev_sibling_clone
)
1851 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1853 clone_of
->clones
= next_sibling_clone
;
1854 if (next_sibling_clone
)
1855 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1858 cgraph_node
*n
, *next
;
1862 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1863 n
->clone_of
= clone_of
;
1864 n
->clone_of
= clone_of
;
1865 n
->next_sibling_clone
= clone_of
->clones
;
1866 if (clone_of
->clones
)
1867 clone_of
->clones
->prev_sibling_clone
= n
;
1868 clone_of
->clones
= clones
;
1872 /* We are removing node with clones. This makes clones inconsistent,
1873 but assume they will be removed subsequently and just keep clone
1874 tree intact. This can happen in unreachable function removal since
1875 we remove unreachable functions in random order, not by bottom-up
1876 walk of clone trees. */
1877 for (n
= clones
; n
; n
= next
)
1879 next
= n
->next_sibling_clone
;
1880 n
->next_sibling_clone
= NULL
;
1881 n
->prev_sibling_clone
= NULL
;
1887 /* While all the clones are removed after being proceeded, the function
1888 itself is kept in the cgraph even after it is compiled. Check whether
1889 we are done with this body and reclaim it proactively if this is the case.
1891 if (symtab
->state
!= LTO_STREAMING
)
1893 n
= cgraph_node::get (decl
);
1895 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1896 && ((symtab
->global_info_ready
|| in_lto_p
)
1897 && (TREE_ASM_WRITTEN (n
->decl
)
1898 || DECL_EXTERNAL (n
->decl
)
1900 || (!flag_wpa
&& n
->in_other_partition
)))))
1905 lto_free_function_in_decl_state_for_node (this);
1906 lto_file_data
= NULL
;
1912 call_site_hash
->empty ();
1913 call_site_hash
= NULL
;
1916 if (instrumented_version
)
1918 instrumented_version
->instrumented_version
= NULL
;
1919 instrumented_version
= NULL
;
1922 symtab
->release_symbol (this, uid
);
1925 /* Likewise indicate that a node is having address taken. */
1928 cgraph_node::mark_address_taken (void)
1930 /* Indirect inlining can figure out that all uses of the address are
1932 if (global
.inlined_to
)
1934 gcc_assert (cfun
->after_inlining
);
1935 gcc_assert (callers
->indirect_inlining_edge
);
1938 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1939 IPA_REF_ADDR reference exists (and thus it should be set on node
1940 representing alias we take address of) and as a test whether address
1941 of the object was taken (and thus it should be set on node alias is
1942 referring to). We should remove the first use and the remove the
1945 cgraph_node
*node
= ultimate_alias_target ();
1946 node
->address_taken
= 1;
1949 /* Return local info for the compiled function. */
1952 cgraph_node::local_info (tree decl
)
1954 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1955 cgraph_node
*node
= get (decl
);
1958 return &node
->ultimate_alias_target ()->local
;
1961 /* Return local info for the compiled function. */
1964 cgraph_node::rtl_info (tree decl
)
1966 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1967 cgraph_node
*node
= get (decl
);
1970 enum availability avail
;
1971 node
= node
->ultimate_alias_target (&avail
);
1972 if (decl
!= current_function_decl
1973 && (avail
< AVAIL_AVAILABLE
1974 || (node
->decl
!= current_function_decl
1975 && !TREE_ASM_WRITTEN (node
->decl
))))
1977 /* Allocate if it doesn't exist. */
1978 if (node
->rtl
== NULL
)
1979 node
->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1983 /* Return a string describing the failure REASON. */
1986 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1989 #define DEFCIFCODE(code, type, string) string,
1991 static const char *cif_string_table
[CIF_N_REASONS
] = {
1992 #include "cif-code.def"
1995 /* Signedness of an enum type is implementation defined, so cast it
1996 to unsigned before testing. */
1997 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1998 return cif_string_table
[reason
];
2001 /* Return a type describing the failure REASON. */
2003 cgraph_inline_failed_type_t
2004 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
2007 #define DEFCIFCODE(code, type, string) type,
2009 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
2010 #include "cif-code.def"
2013 /* Signedness of an enum type is implementation defined, so cast it
2014 to unsigned before testing. */
2015 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
2016 return cif_type_table
[reason
];
2019 /* Names used to print out the availability enum. */
2020 const char * const cgraph_availability_names
[] =
2021 {"unset", "not_available", "overwritable", "available", "local"};
2023 /* Output flags of edge to a file F. */
2026 cgraph_edge::dump_edge_flags (FILE *f
)
2029 fprintf (f
, "(speculative) ");
2031 fprintf (f
, "(inlined) ");
2032 if (call_stmt_cannot_inline_p
)
2033 fprintf (f
, "(call_stmt_cannot_inline_p) ");
2034 if (indirect_inlining_edge
)
2035 fprintf (f
, "(indirect_inlining) ");
2037 fprintf (f
, "(%" PRId64
"x) ", (int64_t)count
);
2039 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
2040 if (can_throw_external
)
2041 fprintf (f
, "(can throw external) ");
2044 /* Dump call graph node to file F. */
2047 cgraph_node::dump (FILE *f
)
2053 if (global
.inlined_to
)
2054 fprintf (f
, " Function %s is inline copy in %s\n",
2056 global
.inlined_to
->dump_name ());
2058 fprintf (f
, " Clone of %s\n", clone_of
->dump_asm_name ());
2059 if (symtab
->function_flags_ready
)
2060 fprintf (f
, " Availability: %s\n",
2061 cgraph_availability_names
[get_availability ()]);
2064 fprintf (f
, " Profile id: %i\n",
2066 fprintf (f
, " First run: %i\n", tp_first_run
);
2067 cgraph_function_version_info
*vi
= function_version ();
2070 fprintf (f
, " Version info: ");
2071 if (vi
->prev
!= NULL
)
2073 fprintf (f
, "prev: ");
2074 fprintf (f
, "%s ", vi
->prev
->this_node
->dump_asm_name ());
2076 if (vi
->next
!= NULL
)
2078 fprintf (f
, "next: ");
2079 fprintf (f
, "%s ", vi
->next
->this_node
->dump_asm_name ());
2081 if (vi
->dispatcher_resolver
!= NULL_TREE
)
2082 fprintf (f
, "dispatcher: %s",
2083 lang_hooks
.decl_printable_name (vi
->dispatcher_resolver
, 2));
2087 fprintf (f
, " Function flags:");
2089 fprintf (f
, " executed %" PRId64
"x",
2092 fprintf (f
, " nested in: %s", origin
->asm_name ());
2093 if (gimple_has_body_p (decl
))
2094 fprintf (f
, " body");
2096 fprintf (f
, " process");
2098 fprintf (f
, " local");
2099 if (local
.redefined_extern_inline
)
2100 fprintf (f
, " redefined_extern_inline");
2101 if (only_called_at_startup
)
2102 fprintf (f
, " only_called_at_startup");
2103 if (only_called_at_exit
)
2104 fprintf (f
, " only_called_at_exit");
2106 fprintf (f
, " tm_clone");
2107 if (calls_comdat_local
)
2108 fprintf (f
, " calls_comdat_local");
2110 fprintf (f
, " icf_merged");
2112 fprintf (f
, " merged_comdat");
2114 fprintf (f
, " split_part");
2115 if (indirect_call_target
)
2116 fprintf (f
, " indirect_call_target");
2118 fprintf (f
, " nonfreeing_fn");
2119 if (DECL_STATIC_CONSTRUCTOR (decl
))
2120 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2121 if (DECL_STATIC_DESTRUCTOR (decl
))
2122 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2123 if (frequency
== NODE_FREQUENCY_HOT
)
2124 fprintf (f
, " hot");
2125 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2126 fprintf (f
, " unlikely_executed");
2127 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2128 fprintf (f
, " executed_once");
2129 if (only_called_at_startup
)
2130 fprintf (f
, " only_called_at_startup");
2131 if (only_called_at_exit
)
2132 fprintf (f
, " only_called_at_exit");
2133 if (opt_for_fn (decl
, optimize_size
))
2134 fprintf (f
, " optimize_size");
2135 if (parallelized_function
)
2136 fprintf (f
, " parallelized_function");
2142 fprintf (f
, " Thunk");
2144 fprintf (f
, " of %s (asm: %s)",
2145 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2146 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2147 fprintf (f
, " fixed offset %i virtual value %i has "
2148 "virtual offset %i)\n",
2149 (int)thunk
.fixed_offset
,
2150 (int)thunk
.virtual_value
,
2151 (int)thunk
.virtual_offset_p
);
2153 if (alias
&& thunk
.alias
2154 && DECL_P (thunk
.alias
))
2156 fprintf (f
, " Alias of %s",
2157 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2158 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2159 fprintf (f
, " (asm: %s)",
2160 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2164 fprintf (f
, " Called by: ");
2166 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2168 fprintf (f
, "%s ", edge
->caller
->dump_name ());
2169 edge
->dump_edge_flags (f
);
2172 fprintf (f
, "\n Calls: ");
2173 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2175 fprintf (f
, "%s ", edge
->callee
->dump_name ());
2176 edge
->dump_edge_flags (f
);
2180 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2182 if (edge
->indirect_info
->polymorphic
)
2184 fprintf (f
, " Polymorphic indirect call of type ");
2185 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2186 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2189 fprintf (f
, " Indirect call");
2190 edge
->dump_edge_flags (f
);
2191 if (edge
->indirect_info
->param_index
!= -1)
2193 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2194 if (edge
->indirect_info
->agg_contents
)
2195 fprintf (f
, " loaded from %s %s at offset %i",
2196 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2197 edge
->indirect_info
->by_ref
? "passed by reference":"",
2198 (int)edge
->indirect_info
->offset
);
2199 if (edge
->indirect_info
->vptr_changed
)
2200 fprintf (f
, " (vptr maybe changed)");
2203 if (edge
->indirect_info
->polymorphic
)
2204 edge
->indirect_info
->context
.dump (f
);
2207 if (instrumentation_clone
)
2208 fprintf (f
, " Is instrumented version.\n");
2209 else if (instrumented_version
)
2210 fprintf (f
, " Has instrumented version.\n");
2213 /* Dump call graph node NODE to stderr. */
2216 cgraph_node::debug (void)
2221 /* Dump the callgraph to file F. */
2224 cgraph_node::dump_cgraph (FILE *f
)
2228 fprintf (f
, "callgraph:\n\n");
2229 FOR_EACH_FUNCTION (node
)
2233 /* Return true when the DECL can possibly be inlined. */
2236 cgraph_function_possibly_inlined_p (tree decl
)
2238 if (!symtab
->global_info_ready
)
2239 return !DECL_UNINLINABLE (decl
);
2240 return DECL_POSSIBLY_INLINED (decl
);
2243 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2245 cgraph_node::unnest (void)
2247 cgraph_node
**node2
= &origin
->nested
;
2248 gcc_assert (origin
);
2250 while (*node2
!= this)
2251 node2
= &(*node2
)->next_nested
;
2252 *node2
= next_nested
;
2256 /* Return function availability. See cgraph.h for description of individual
2259 cgraph_node::get_availability (symtab_node
*ref
)
2263 cgraph_node
*cref
= dyn_cast
<cgraph_node
*> (ref
);
2265 ref
= cref
->global
.inlined_to
;
2267 enum availability avail
;
2269 avail
= AVAIL_NOT_AVAILABLE
;
2270 else if (local
.local
)
2271 avail
= AVAIL_LOCAL
;
2272 else if (global
.inlined_to
)
2273 avail
= AVAIL_AVAILABLE
;
2274 else if (transparent_alias
)
2275 ultimate_alias_target (&avail
, ref
);
2276 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2277 avail
= AVAIL_INTERPOSABLE
;
2278 else if (!externally_visible
)
2279 avail
= AVAIL_AVAILABLE
;
2280 /* If this is a reference from symbol itself and there are no aliases, we
2281 may be sure that the symbol was not interposed by something else because
2282 the symbol itself would be unreachable otherwise.
2284 Also comdat groups are always resolved in groups. */
2285 else if ((this == ref
&& !has_aliases_p ())
2286 || (ref
&& get_comdat_group ()
2287 && get_comdat_group () == ref
->get_comdat_group ()))
2288 avail
= AVAIL_AVAILABLE
;
2289 /* Inline functions are safe to be analyzed even if their symbol can
2290 be overwritten at runtime. It is not meaningful to enforce any sane
2291 behavior on replacing inline function by different body. */
2292 else if (DECL_DECLARED_INLINE_P (decl
))
2293 avail
= AVAIL_AVAILABLE
;
2295 /* If the function can be overwritten, return OVERWRITABLE. Take
2296 care at least of two notable extensions - the COMDAT functions
2297 used to share template instantiations in C++ (this is symmetric
2298 to code cp_cannot_inline_tree_fn and probably shall be shared and
2299 the inlinability hooks completely eliminated). */
2301 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2302 avail
= AVAIL_INTERPOSABLE
;
2303 else avail
= AVAIL_AVAILABLE
;
2308 /* Worker for cgraph_node_can_be_local_p. */
2310 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2312 return !(!node
->force_output
2313 && ((DECL_COMDAT (node
->decl
)
2314 && !node
->forced_by_abi
2315 && !node
->used_from_object_file_p ()
2316 && !node
->same_comdat_group
)
2317 || !node
->externally_visible
));
2320 /* Return true if cgraph_node can be made local for API change.
2321 Extern inline functions and C++ COMDAT functions can be made local
2322 at the expense of possible code size growth if function is used in multiple
2323 compilation units. */
2325 cgraph_node::can_be_local_p (void)
2327 return (!address_taken
2328 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2332 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2333 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
2334 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2337 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2338 (cgraph_node
*, void *),
2340 bool include_overwritable
,
2341 bool exclude_virtual_thunks
)
2345 enum availability avail
= AVAIL_AVAILABLE
;
2347 if (include_overwritable
2348 || (avail
= get_availability ()) > AVAIL_INTERPOSABLE
)
2350 if (callback (this, data
))
2353 FOR_EACH_ALIAS (this, ref
)
2355 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2356 if (include_overwritable
2357 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2358 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2359 include_overwritable
,
2360 exclude_virtual_thunks
))
2363 if (avail
<= AVAIL_INTERPOSABLE
)
2365 for (e
= callers
; e
; e
= e
->next_caller
)
2366 if (e
->caller
->thunk
.thunk_p
2367 && (include_overwritable
2368 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2369 && !(exclude_virtual_thunks
2370 && e
->caller
->thunk
.virtual_offset_p
))
2371 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2372 include_overwritable
,
2373 exclude_virtual_thunks
))
2379 /* Worker to bring NODE local. */
2382 cgraph_node::make_local (cgraph_node
*node
, void *)
2384 gcc_checking_assert (node
->can_be_local_p ());
2385 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2387 node
->make_decl_local ();
2388 node
->set_section (NULL
);
2389 node
->set_comdat_group (NULL
);
2390 node
->externally_visible
= false;
2391 node
->forced_by_abi
= false;
2392 node
->local
.local
= true;
2393 node
->set_section (NULL
);
2394 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2395 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2396 && !flag_incremental_link
);
2397 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2398 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2403 /* Bring cgraph node local. */
2406 cgraph_node::make_local (void)
2408 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2411 /* Worker to set nothrow flag. */
2414 set_nothrow_flag_1 (cgraph_node
*node
, bool nothrow
, bool non_call
,
2419 if (nothrow
&& !TREE_NOTHROW (node
->decl
))
2421 /* With non-call exceptions we can't say for sure if other function body
2422 was not possibly optimized to stil throw. */
2423 if (!non_call
|| node
->binds_to_current_def_p ())
2425 TREE_NOTHROW (node
->decl
) = true;
2427 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2428 e
->can_throw_external
= false;
2431 else if (!nothrow
&& TREE_NOTHROW (node
->decl
))
2433 TREE_NOTHROW (node
->decl
) = false;
2437 FOR_EACH_ALIAS (node
, ref
)
2439 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2440 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2441 set_nothrow_flag_1 (alias
, nothrow
, non_call
, changed
);
2443 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2444 if (e
->caller
->thunk
.thunk_p
2445 && (!nothrow
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2446 set_nothrow_flag_1 (e
->caller
, nothrow
, non_call
, changed
);
2449 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2450 if any to NOTHROW. */
2453 cgraph_node::set_nothrow_flag (bool nothrow
)
2455 bool changed
= false;
2456 bool non_call
= opt_for_fn (decl
, flag_non_call_exceptions
);
2458 if (!nothrow
|| get_availability () > AVAIL_INTERPOSABLE
)
2459 set_nothrow_flag_1 (this, nothrow
, non_call
, &changed
);
2464 FOR_EACH_ALIAS (this, ref
)
2466 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2467 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2468 set_nothrow_flag_1 (alias
, nothrow
, non_call
, &changed
);
2474 /* Worker to set_const_flag. */
2477 set_const_flag_1 (cgraph_node
*node
, bool set_const
, bool looping
,
2480 /* Static constructors and destructors without a side effect can be
2482 if (set_const
&& !looping
)
2484 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2486 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2489 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2491 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2497 if (TREE_READONLY (node
->decl
))
2499 TREE_READONLY (node
->decl
) = 0;
2500 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2506 /* Consider function:
2513 During early optimization we will turn this into:
2520 Now if this function will be detected as CONST however when interposed
2521 it may end up being just pure. We always must assume the worst
2523 if (TREE_READONLY (node
->decl
))
2525 if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2527 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2531 else if (node
->binds_to_current_def_p ())
2533 TREE_READONLY (node
->decl
) = true;
2534 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2535 DECL_PURE_P (node
->decl
) = false;
2540 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2541 fprintf (dump_file
, "Dropping state to PURE because function does "
2542 "not bind to current def.\n");
2543 if (!DECL_PURE_P (node
->decl
))
2545 DECL_PURE_P (node
->decl
) = true;
2546 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2549 else if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2551 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2558 FOR_EACH_ALIAS (node
, ref
)
2560 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2561 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2562 set_const_flag_1 (alias
, set_const
, looping
, changed
);
2564 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2565 if (e
->caller
->thunk
.thunk_p
2566 && (!set_const
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2568 /* Virtual thunks access virtual offset in the vtable, so they can
2569 only be pure, never const. */
2571 && (e
->caller
->thunk
.virtual_offset_p
2572 || !node
->binds_to_current_def_p (e
->caller
)))
2573 *changed
|= e
->caller
->set_pure_flag (true, looping
);
2575 set_const_flag_1 (e
->caller
, set_const
, looping
, changed
);
2579 /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
2580 If SET_CONST if false, clear the flag.
2582 When setting the flag be careful about possible interposition and
2583 do not set the flag for functions that can be interposet and set pure
2584 flag for functions that can bind to other definition.
2586 Return true if any change was done. */
2589 cgraph_node::set_const_flag (bool set_const
, bool looping
)
2591 bool changed
= false;
2592 if (!set_const
|| get_availability () > AVAIL_INTERPOSABLE
)
2593 set_const_flag_1 (this, set_const
, looping
, &changed
);
2598 FOR_EACH_ALIAS (this, ref
)
2600 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2601 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2602 set_const_flag_1 (alias
, set_const
, looping
, &changed
);
2608 /* Info used by set_pure_flag_1. */
2610 struct set_pure_flag_info
2617 /* Worker to set_pure_flag. */
2620 set_pure_flag_1 (cgraph_node
*node
, void *data
)
2622 struct set_pure_flag_info
*info
= (struct set_pure_flag_info
*)data
;
2623 /* Static constructors and destructors without a side effect can be
2625 if (info
->pure
&& !info
->looping
)
2627 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2629 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2630 info
->changed
= true;
2632 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2634 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2635 info
->changed
= true;
2640 if (!DECL_PURE_P (node
->decl
) && !TREE_READONLY (node
->decl
))
2642 DECL_PURE_P (node
->decl
) = true;
2643 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = info
->looping
;
2644 info
->changed
= true;
2646 else if (DECL_LOOPING_CONST_OR_PURE_P (node
->decl
)
2649 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2650 info
->changed
= true;
2655 if (DECL_PURE_P (node
->decl
))
2657 DECL_PURE_P (node
->decl
) = false;
2658 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2659 info
->changed
= true;
2665 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2668 When setting the flag, be careful about possible interposition.
2669 Return true if any change was done. */
2672 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2674 struct set_pure_flag_info info
= {pure
, looping
, false};
2677 call_for_symbol_thunks_and_aliases (set_pure_flag_1
, &info
, !pure
, true);
2678 return info
.changed
;
2681 /* Return true when cgraph_node can not return or throw and thus
2682 it is safe to ignore its side effects for IPA analysis. */
2685 cgraph_node::cannot_return_p (void)
2687 int flags
= flags_from_decl_or_type (decl
);
2688 if (!opt_for_fn (decl
, flag_exceptions
))
2689 return (flags
& ECF_NORETURN
) != 0;
2691 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2692 == (ECF_NORETURN
| ECF_NOTHROW
));
2695 /* Return true when call of edge can not lead to return from caller
2696 and thus it is safe to ignore its side effects for IPA analysis
2697 when computing side effects of the caller.
2698 FIXME: We could actually mark all edges that have no reaching
2699 patch to the exit block or throw to get better results. */
2701 cgraph_edge::cannot_lead_to_return_p (void)
2703 if (caller
->cannot_return_p ())
2705 if (indirect_unknown_callee
)
2707 int flags
= indirect_info
->ecf_flags
;
2708 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2709 return (flags
& ECF_NORETURN
) != 0;
2711 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2712 == (ECF_NORETURN
| ECF_NOTHROW
));
2715 return callee
->cannot_return_p ();
2718 /* Return true if the call can be hot. */
2721 cgraph_edge::maybe_hot_p (void)
2723 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2725 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2726 && !maybe_hot_count_p (NULL
, count
))
2728 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2730 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2732 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2734 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2736 if (opt_for_fn (caller
->decl
, optimize_size
))
2738 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2740 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2741 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2743 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2745 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2746 || frequency
<= (CGRAPH_FREQ_BASE
2747 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2753 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2756 nonremovable_p (cgraph_node
*node
, void *)
2758 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2761 /* Return true if whole comdat group can be removed if there are no direct
2765 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2767 struct ipa_ref
*ref
;
2769 /* For local symbols or non-comdat group it is the same as
2770 can_remove_if_no_direct_calls_p. */
2771 if (!externally_visible
|| !same_comdat_group
)
2773 if (DECL_EXTERNAL (decl
))
2777 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2780 if (will_inline
&& address_taken
)
2783 /* Otheriwse check if we can remove the symbol itself and then verify
2784 that only uses of the comdat groups are direct call to THIS
2786 if (!can_remove_if_no_direct_calls_and_refs_p ())
2789 /* Check that all refs come from within the comdat group. */
2790 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2791 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2794 struct cgraph_node
*target
= ultimate_alias_target ();
2795 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2796 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2798 if (!externally_visible
)
2801 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2804 /* If we see different symbol than THIS, be sure to check calls. */
2805 if (next
->ultimate_alias_target () != target
)
2806 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2807 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2811 /* If function is not being inlined, we care only about
2812 references outside of the comdat group. */
2814 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2815 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2821 /* Return true when function cgraph_node can be expected to be removed
2822 from program when direct calls in this compilation unit are removed.
2824 As a special case COMDAT functions are
2825 cgraph_can_remove_if_no_direct_calls_p while the are not
2826 cgraph_only_called_directly_p (it is possible they are called from other
2829 This function behaves as cgraph_only_called_directly_p because eliminating
2830 all uses of COMDAT function does not make it necessarily disappear from
2831 the program unless we are compiling whole program or we do LTO. In this
2832 case we know we win since dynamic linking will not really discard the
2833 linkonce section. */
2836 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2839 gcc_assert (!global
.inlined_to
);
2840 if (DECL_EXTERNAL (decl
))
2843 if (!in_lto_p
&& !flag_whole_program
)
2845 /* If the symbol is in comdat group, we need to verify that whole comdat
2846 group becomes unreachable. Technically we could skip references from
2847 within the group, too. */
2848 if (!only_called_directly_p ())
2850 if (same_comdat_group
&& externally_visible
)
2852 struct cgraph_node
*target
= ultimate_alias_target ();
2854 if (will_inline
&& address_taken
)
2856 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2858 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2860 if (!externally_visible
)
2863 && !next
->only_called_directly_p ())
2866 /* If we see different symbol than THIS,
2867 be sure to check calls. */
2868 if (next
->ultimate_alias_target () != target
)
2869 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2870 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2878 return can_remove_if_no_direct_calls_p (will_inline
);
2882 /* Worker for cgraph_only_called_directly_p. */
2885 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2887 return !node
->only_called_directly_or_aliased_p ();
2890 /* Return true when function cgraph_node and all its aliases are only called
2892 i.e. it is not externally visible, address was not taken and
2893 it is not used in any other non-standard way. */
2896 cgraph_node::only_called_directly_p (void)
2898 gcc_assert (ultimate_alias_target () == this);
2899 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2904 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2907 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2909 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2911 enum availability avail
;
2912 node
->ultimate_alias_target (&avail
);
2914 if (avail
> AVAIL_INTERPOSABLE
)
2915 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2916 if (!cs
->indirect_inlining_edge
2917 && !cs
->caller
->thunk
.thunk_p
)
2918 redirect_callers
->safe_push (cs
);
2922 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2923 cgraph_node (i.e. are not overwritable). */
2926 cgraph_node::collect_callers (void)
2928 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2929 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2930 &redirect_callers
, false);
2931 return redirect_callers
;
2934 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2937 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2939 bool skipped_thunk
= false;
2940 node
= node
->ultimate_alias_target ();
2941 node2
= node2
->ultimate_alias_target ();
2943 /* There are no virtual clones of thunks so check former_clone_of or if we
2944 might have skipped thunks because this adjustments are no longer
2946 while (node
->thunk
.thunk_p
)
2948 if (node2
->former_clone_of
== node
->decl
)
2950 if (!node
->thunk
.this_adjusting
)
2952 node
= node
->callees
->callee
->ultimate_alias_target ();
2953 skipped_thunk
= true;
2958 if (!node2
->clone
.args_to_skip
2959 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2961 if (node2
->former_clone_of
== node
->decl
)
2963 else if (!node2
->clone_of
)
2967 while (node
!= node2
&& node2
)
2968 node2
= node2
->clone_of
;
2969 return node2
!= NULL
;
2972 /* Verify edge count and frequency. */
2975 cgraph_edge::verify_count_and_frequency ()
2977 bool error_found
= false;
2980 error ("caller edge count is negative");
2985 error ("caller edge frequency is negative");
2988 if (frequency
> CGRAPH_FREQ_MAX
)
2990 error ("caller edge frequency is too large");
2996 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2998 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
3000 bool fndecl_was_null
= false;
3001 /* debug_gimple_stmt needs correct cfun */
3002 if (cfun
!= this_cfun
)
3003 set_cfun (this_cfun
);
3004 /* ...and an actual current_function_decl */
3005 if (!current_function_decl
)
3007 current_function_decl
= this_cfun
->decl
;
3008 fndecl_was_null
= true;
3010 debug_gimple_stmt (stmt
);
3011 if (fndecl_was_null
)
3012 current_function_decl
= NULL
;
3015 /* Verify that call graph edge corresponds to DECL from the associated
3016 statement. Return true if the verification should fail. */
3019 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
3023 if (!decl
|| callee
->global
.inlined_to
)
3025 if (symtab
->state
== LTO_STREAMING
)
3027 node
= cgraph_node::get (decl
);
3029 /* We do not know if a node from a different partition is an alias or what it
3030 aliases and therefore cannot do the former_clone_of check reliably. When
3031 body_removed is set, we have lost all information about what was alias or
3032 thunk of and also cannot proceed. */
3034 || node
->body_removed
3035 || node
->in_other_partition
3036 || callee
->icf_merged
3037 || callee
->in_other_partition
)
3040 node
= node
->ultimate_alias_target ();
3042 /* Optimizers can redirect unreachable calls or calls triggering undefined
3043 behavior to builtin_unreachable. */
3044 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
3045 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
3048 if (callee
->former_clone_of
!= node
->decl
3049 && (node
!= callee
->ultimate_alias_target ())
3050 && !clone_of_p (node
, callee
))
3056 /* Verify cgraph nodes of given cgraph node. */
3058 cgraph_node::verify_node (void)
3061 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
3062 basic_block this_block
;
3063 gimple_stmt_iterator gsi
;
3064 bool error_found
= false;
3069 timevar_push (TV_CGRAPH_VERIFY
);
3070 error_found
|= verify_base ();
3071 for (e
= callees
; e
; e
= e
->next_callee
)
3074 error ("aux field set for edge %s->%s",
3075 identifier_to_locale (e
->caller
->name ()),
3076 identifier_to_locale (e
->callee
->name ()));
3081 error ("execution count is negative");
3084 if (global
.inlined_to
&& same_comdat_group
)
3086 error ("inline clone in same comdat group list");
3089 if (!definition
&& !in_other_partition
&& local
.local
)
3091 error ("local symbols must be defined");
3094 if (global
.inlined_to
&& externally_visible
)
3096 error ("externally visible inline clone");
3099 if (global
.inlined_to
&& address_taken
)
3101 error ("inline clone with address taken");
3104 if (global
.inlined_to
&& force_output
)
3106 error ("inline clone is forced to output");
3109 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3113 error ("aux field set for indirect edge from %s",
3114 identifier_to_locale (e
->caller
->name ()));
3117 if (!e
->indirect_unknown_callee
3118 || !e
->indirect_info
)
3120 error ("An indirect edge from %s is not marked as indirect or has "
3121 "associated indirect_info, the corresponding statement is: ",
3122 identifier_to_locale (e
->caller
->name ()));
3123 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3127 bool check_comdat
= comdat_local_p ();
3128 for (e
= callers
; e
; e
= e
->next_caller
)
3130 if (e
->verify_count_and_frequency ())
3133 && !in_same_comdat_group_p (e
->caller
))
3135 error ("comdat-local function called by %s outside its comdat",
3136 identifier_to_locale (e
->caller
->name ()));
3139 if (!e
->inline_failed
)
3141 if (global
.inlined_to
3142 != (e
->caller
->global
.inlined_to
3143 ? e
->caller
->global
.inlined_to
: e
->caller
))
3145 error ("inlined_to pointer is wrong");
3148 if (callers
->next_caller
)
3150 error ("multiple inline callers");
3155 if (global
.inlined_to
)
3157 error ("inlined_to pointer set for noninline callers");
3161 for (e
= callees
; e
; e
= e
->next_callee
)
3163 if (e
->verify_count_and_frequency ())
3165 if (gimple_has_body_p (e
->caller
->decl
)
3166 && !e
->caller
->global
.inlined_to
3168 /* Optimized out calls are redirected to __builtin_unreachable. */
3170 || ! e
->callee
->decl
3171 || DECL_BUILT_IN_CLASS (e
->callee
->decl
) != BUILT_IN_NORMAL
3172 || DECL_FUNCTION_CODE (e
->callee
->decl
) != BUILT_IN_UNREACHABLE
)
3174 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3175 gimple_bb (e
->call_stmt
))))
3177 error ("caller edge frequency %i does not match BB frequency %i",
3179 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3180 gimple_bb (e
->call_stmt
)));
3184 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3186 if (e
->verify_count_and_frequency ())
3188 if (gimple_has_body_p (e
->caller
->decl
)
3189 && !e
->caller
->global
.inlined_to
3192 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3193 gimple_bb (e
->call_stmt
))))
3195 error ("indirect call frequency %i does not match BB frequency %i",
3197 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3198 gimple_bb (e
->call_stmt
)));
3202 if (!callers
&& global
.inlined_to
)
3204 error ("inlined_to pointer is set but no predecessors found");
3207 if (global
.inlined_to
== this)
3209 error ("inlined_to pointer refers to itself");
3216 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
3221 error ("cgraph_node has wrong clone_of");
3228 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
3229 if (n
->clone_of
!= this)
3233 error ("cgraph_node has wrong clone list");
3237 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
3239 error ("cgraph_node is in clone list but it is not clone");
3242 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
3244 error ("cgraph_node has wrong prev_clone pointer");
3247 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
3249 error ("double linked list of clones corrupted");
3253 if (analyzed
&& alias
)
3255 bool ref_found
= false;
3257 ipa_ref
*ref
= NULL
;
3261 error ("Alias has call edges");
3264 for (i
= 0; iterate_reference (i
, ref
); i
++)
3265 if (ref
->use
== IPA_REF_CHKP
)
3267 else if (ref
->use
!= IPA_REF_ALIAS
)
3269 error ("Alias has non-alias reference");
3274 error ("Alias has more than one alias reference");
3281 error ("Analyzed alias has no reference");
3286 /* Check instrumented version reference. */
3287 if (instrumented_version
3288 && instrumented_version
->instrumented_version
!= this)
3290 error ("Instrumentation clone does not reference original node");
3294 /* Cannot have orig_decl for not instrumented nodes. */
3295 if (!instrumentation_clone
&& orig_decl
)
3297 error ("Not instrumented node has non-NULL original declaration");
3301 /* If original not instrumented node still exists then we may check
3302 original declaration is set properly. */
3303 if (instrumented_version
3305 && orig_decl
!= instrumented_version
->decl
)
3307 error ("Instrumented node has wrong original declaration");
3311 /* Check all nodes have chkp reference to their instrumented versions. */
3313 && instrumented_version
3314 && !instrumentation_clone
)
3316 bool ref_found
= false;
3318 struct ipa_ref
*ref
;
3320 for (i
= 0; iterate_reference (i
, ref
); i
++)
3321 if (ref
->use
== IPA_REF_CHKP
)
3325 error ("Node has more than one chkp reference");
3328 if (ref
->referred
!= instrumented_version
)
3330 error ("Wrong node is referenced with chkp reference");
3338 error ("Analyzed node has no reference to instrumented version");
3343 if (instrumentation_clone
3344 && DECL_BUILT_IN_CLASS (decl
) == NOT_BUILT_IN
)
3346 tree name
= DECL_ASSEMBLER_NAME (decl
);
3347 tree orig_name
= DECL_ASSEMBLER_NAME (orig_decl
);
3349 if (!IDENTIFIER_TRANSPARENT_ALIAS (name
)
3350 || TREE_CHAIN (name
) != orig_name
)
3352 error ("Alias chain for instrumented node is broken");
3357 if (analyzed
&& thunk
.thunk_p
)
3361 error ("No edge out of thunk node");
3364 else if (callees
->next_callee
)
3366 error ("More than one edge out of thunk node");
3369 if (gimple_has_body_p (decl
) && !global
.inlined_to
)
3371 error ("Thunk is not supposed to have body");
3374 if (thunk
.add_pointer_bounds_args
3375 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3377 error ("Instrumentation thunk has wrong edge callee");
3381 else if (analyzed
&& gimple_has_body_p (decl
)
3382 && !TREE_ASM_WRITTEN (decl
)
3383 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3388 hash_set
<gimple
*> stmts
;
3390 ipa_ref
*ref
= NULL
;
3392 /* Reach the trees by walking over the CFG, and note the
3393 enclosing basic-blocks in the call edges. */
3394 FOR_EACH_BB_FN (this_block
, this_cfun
)
3396 for (gsi
= gsi_start_phis (this_block
);
3397 !gsi_end_p (gsi
); gsi_next (&gsi
))
3398 stmts
.add (gsi_stmt (gsi
));
3399 for (gsi
= gsi_start_bb (this_block
);
3403 gimple
*stmt
= gsi_stmt (gsi
);
3405 if (is_gimple_call (stmt
))
3407 cgraph_edge
*e
= get_edge (stmt
);
3408 tree decl
= gimple_call_fndecl (stmt
);
3413 error ("shared call_stmt:");
3414 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3417 if (!e
->indirect_unknown_callee
)
3419 if (e
->verify_corresponds_to_fndecl (decl
))
3421 error ("edge points to wrong declaration:");
3422 debug_tree (e
->callee
->decl
);
3423 fprintf (stderr
," Instead of:");
3430 error ("an indirect edge with unknown callee "
3431 "corresponding to a call_stmt with "
3432 "a known declaration:");
3434 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3440 error ("missing callgraph edge for call stmt:");
3441 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3447 for (i
= 0; iterate_reference (i
, ref
); i
++)
3448 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3450 error ("reference to dead statement");
3451 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3456 /* No CFG available?! */
3459 for (e
= callees
; e
; e
= e
->next_callee
)
3463 error ("edge %s->%s has no corresponding call_stmt",
3464 identifier_to_locale (e
->caller
->name ()),
3465 identifier_to_locale (e
->callee
->name ()));
3466 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3471 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3473 if (!e
->aux
&& !e
->speculative
)
3475 error ("an indirect edge from %s has no corresponding call_stmt",
3476 identifier_to_locale (e
->caller
->name ()));
3477 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3486 internal_error ("verify_cgraph_node failed");
3488 timevar_pop (TV_CGRAPH_VERIFY
);
3491 /* Verify whole cgraph structure. */
3493 cgraph_node::verify_cgraph_nodes (void)
3500 FOR_EACH_FUNCTION (node
)
3504 /* Walk the alias chain to return the function cgraph_node is alias of.
3505 Walk through thunks, too.
3506 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3507 When REF is non-NULL, assume that reference happens in symbol REF
3508 when determining the availability. */
3511 cgraph_node::function_symbol (enum availability
*availability
,
3512 struct symtab_node
*ref
)
3514 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3516 while (node
->thunk
.thunk_p
)
3519 node
= node
->callees
->callee
;
3522 enum availability a
;
3523 a
= node
->get_availability (ref
);
3524 if (a
< *availability
)
3527 node
= node
->ultimate_alias_target (availability
, ref
);
3532 /* Walk the alias chain to return the function cgraph_node is alias of.
3533 Walk through non virtual thunks, too. Thus we return either a function
3534 or a virtual thunk node.
3535 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3536 When REF is non-NULL, assume that reference happens in symbol REF
3537 when determining the availability. */
3540 cgraph_node::function_or_virtual_thunk_symbol
3541 (enum availability
*availability
,
3542 struct symtab_node
*ref
)
3544 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3546 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3549 node
= node
->callees
->callee
;
3552 enum availability a
;
3553 a
= node
->get_availability (ref
);
3554 if (a
< *availability
)
3557 node
= node
->ultimate_alias_target (availability
, ref
);
3562 /* When doing LTO, read cgraph_node's body from disk if it is not already
3566 cgraph_node::get_untransformed_body (void)
3568 lto_file_decl_data
*file_data
;
3569 const char *data
, *name
;
3571 tree decl
= this->decl
;
3573 /* Check if body is already there. Either we have gimple body or
3574 the function is thunk and in that case we set DECL_ARGUMENTS. */
3575 if (DECL_ARGUMENTS (decl
) || gimple_has_body_p (decl
))
3578 gcc_assert (in_lto_p
&& !DECL_RESULT (decl
));
3580 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3582 file_data
= lto_file_data
;
3583 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3585 /* We may have renamed the declaration, e.g., a static function. */
3586 name
= lto_get_decl_name_mapping (file_data
, name
);
3587 struct lto_in_decl_state
*decl_state
3588 = lto_get_function_in_decl_state (file_data
, decl
);
3590 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3591 name
, &len
, decl_state
->compressed
);
3593 fatal_error (input_location
, "%s: section %s is missing",
3594 file_data
->file_name
,
3597 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3599 lto_input_function_body (file_data
, this, data
);
3600 lto_stats
.num_function_bodies
++;
3601 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3602 data
, len
, decl_state
->compressed
);
3603 lto_free_function_in_decl_state_for_node (this);
3604 /* Keep lto file data so ipa-inline-analysis knows about cross module
3607 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3612 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3613 if it is not already present. When some IPA transformations are scheduled,
3617 cgraph_node::get_body (void)
3621 updated
= get_untransformed_body ();
3623 /* Getting transformed body makes no sense for inline clones;
3624 we should never use this on real clones because they are materialized
3626 TODO: Materializing clones here will likely lead to smaller LTRANS
3628 gcc_assert (!global
.inlined_to
&& !clone_of
);
3629 if (ipa_transforms_to_apply
.exists ())
3631 opt_pass
*saved_current_pass
= current_pass
;
3632 FILE *saved_dump_file
= dump_file
;
3633 const char *saved_dump_file_name
= dump_file_name
;
3634 dump_flags_t saved_dump_flags
= dump_flags
;
3635 dump_file_name
= NULL
;
3638 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3639 execute_all_ipa_transforms ();
3640 cgraph_edge::rebuild_edges ();
3641 free_dominance_info (CDI_DOMINATORS
);
3642 free_dominance_info (CDI_POST_DOMINATORS
);
3646 current_pass
= saved_current_pass
;
3647 dump_file
= saved_dump_file
;
3648 dump_file_name
= saved_dump_file_name
;
3649 dump_flags
= saved_dump_flags
;
3654 /* Return the DECL_STRUCT_FUNCTION of the function. */
3657 cgraph_node::get_fun (void)
3659 cgraph_node
*node
= this;
3660 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3662 while (!fun
&& node
->clone_of
)
3664 node
= node
->clone_of
;
3665 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3671 /* Verify if the type of the argument matches that of the function
3672 declaration. If we cannot verify this or there is a mismatch,
3676 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3679 unsigned int i
, nargs
;
3681 /* Calls to internal functions always match their signature. */
3682 if (gimple_call_internal_p (stmt
))
3685 nargs
= gimple_call_num_args (stmt
);
3687 /* Get argument types for verification. */
3689 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3691 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3693 /* Verify if the type of the argument matches that of the function
3694 declaration. If we cannot verify this or there is a mismatch,
3696 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3698 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3700 i
++, p
= DECL_CHAIN (p
))
3703 /* We cannot distinguish a varargs function from the case
3704 of excess parameters, still deferring the inlining decision
3705 to the callee is possible. */
3708 arg
= gimple_call_arg (stmt
, i
);
3709 if (p
== error_mark_node
3710 || DECL_ARG_TYPE (p
) == error_mark_node
3711 || arg
== error_mark_node
3712 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3713 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3716 if (args_count_match
&& p
)
3721 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3724 /* If this is a varargs function defer inlining decision
3728 arg
= gimple_call_arg (stmt
, i
);
3729 if (TREE_VALUE (p
) == error_mark_node
3730 || arg
== error_mark_node
3731 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3732 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3733 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3745 /* Verify if the type of the argument and lhs of CALL_STMT matches
3746 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3747 true, the arg count needs to be the same.
3748 If we cannot verify this or there is a mismatch, return false. */
3751 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3752 bool args_count_match
)
3756 if ((DECL_RESULT (callee
)
3757 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3758 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3759 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3761 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3762 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3767 /* Reset all state within cgraph.c so that we can rerun the compiler
3768 within the same process. For use by toplev::finalize. */
3771 cgraph_c_finalize (void)
3775 x_cgraph_nodes_queue
= NULL
;
3777 cgraph_fnver_htab
= NULL
;
3778 version_info_node
= NULL
;
3781 /* A wroker for call_for_symbol_and_aliases. */
3784 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3787 bool include_overwritable
)
3790 FOR_EACH_ALIAS (this, ref
)
3792 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3793 if (include_overwritable
3794 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3795 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3796 include_overwritable
))
3802 /* Return true if NODE has thunk. */
3805 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3807 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3808 if (e
->caller
->thunk
.thunk_p
)
3813 #include "gt-cgraph.h"