1 /* Callgraph handling code.
2 Copyright (C) 2003-2019 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file contains basic routines manipulating call graph
23 The call-graph is a data structure designed for inter-procedural
24 optimization. It represents a multi-graph where nodes are functions
25 (symbols within symbol table) and edges are call sites. */
29 #include "coretypes.h"
36 #include "alloc-pool.h"
37 #include "gimple-ssa.h"
39 #include "lto-streamer.h"
40 #include "fold-const.h"
43 #include "print-tree.h"
44 #include "langhooks.h"
47 #include "gimple-iterator.h"
50 #include "value-prof.h"
51 #include "ipa-utils.h"
52 #include "symbol-summary.h"
55 #include "ipa-fnsummary.h"
57 #include "gimple-pretty-print.h"
63 #include "stringpool.h"
67 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
68 #include "tree-pass.h"
70 /* Queue of cgraph nodes scheduled to be lowered. */
71 symtab_node
*x_cgraph_nodes_queue
;
72 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
74 /* Symbol table global context. */
77 /* List of hooks triggered on cgraph_edge events. */
78 struct cgraph_edge_hook_list
{
79 cgraph_edge_hook hook
;
81 struct cgraph_edge_hook_list
*next
;
84 /* List of hooks triggered on cgraph_node events. */
85 struct cgraph_node_hook_list
{
86 cgraph_node_hook hook
;
88 struct cgraph_node_hook_list
*next
;
91 /* List of hooks triggered on events involving two cgraph_edges. */
92 struct cgraph_2edge_hook_list
{
93 cgraph_2edge_hook hook
;
95 struct cgraph_2edge_hook_list
*next
;
98 /* List of hooks triggered on events involving two cgraph_nodes. */
99 struct cgraph_2node_hook_list
{
100 cgraph_2node_hook hook
;
102 struct cgraph_2node_hook_list
*next
;
105 /* Hash descriptor for cgraph_function_version_info. */
107 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
109 static hashval_t
hash (cgraph_function_version_info
*);
110 static bool equal (cgraph_function_version_info
*,
111 cgraph_function_version_info
*);
114 /* Map a cgraph_node to cgraph_function_version_info using this htab.
115 The cgraph_function_version_info has a THIS_NODE field that is the
116 corresponding cgraph_node.. */
118 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
120 /* Hash function for cgraph_fnver_htab. */
122 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
124 int uid
= ptr
->this_node
->get_uid ();
125 return (hashval_t
)(uid
);
128 /* eq function for cgraph_fnver_htab. */
130 function_version_hasher::equal (cgraph_function_version_info
*n1
,
131 cgraph_function_version_info
*n2
)
133 return n1
->this_node
->get_uid () == n2
->this_node
->get_uid ();
136 /* Mark as GC root all allocated nodes. */
137 static GTY(()) struct cgraph_function_version_info
*
138 version_info_node
= NULL
;
140 /* Return true if NODE's address can be compared. */
143 symtab_node::address_can_be_compared_p ()
145 /* Address of virtual tables and functions is never compared. */
146 if (DECL_VIRTUAL_P (decl
))
148 /* Address of C++ cdtors is never compared. */
149 if (is_a
<cgraph_node
*> (this)
150 && (DECL_CXX_CONSTRUCTOR_P (decl
)
151 || DECL_CXX_DESTRUCTOR_P (decl
)))
153 /* Constant pool symbols addresses are never compared.
154 flag_merge_constants permits us to assume the same on readonly vars. */
155 if (is_a
<varpool_node
*> (this)
156 && (DECL_IN_CONSTANT_POOL (decl
)
157 || (flag_merge_constants
>= 2
158 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
163 /* Get the cgraph_function_version_info node corresponding to node. */
164 cgraph_function_version_info
*
165 cgraph_node::function_version (void)
167 cgraph_function_version_info key
;
168 key
.this_node
= this;
170 if (cgraph_fnver_htab
== NULL
)
173 return cgraph_fnver_htab
->find (&key
);
176 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
177 corresponding to cgraph_node NODE. */
178 cgraph_function_version_info
*
179 cgraph_node::insert_new_function_version (void)
181 version_info_node
= NULL
;
182 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
183 version_info_node
->this_node
= this;
185 if (cgraph_fnver_htab
== NULL
)
186 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
188 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
190 return version_info_node
;
193 /* Remove the cgraph_function_version_info node given by DECL_V. */
195 delete_function_version (cgraph_function_version_info
*decl_v
)
200 if (decl_v
->prev
!= NULL
)
201 decl_v
->prev
->next
= decl_v
->next
;
203 if (decl_v
->next
!= NULL
)
204 decl_v
->next
->prev
= decl_v
->prev
;
206 if (cgraph_fnver_htab
!= NULL
)
207 cgraph_fnver_htab
->remove_elt (decl_v
);
210 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
211 DECL is a duplicate declaration. */
213 cgraph_node::delete_function_version_by_decl (tree decl
)
215 cgraph_node
*decl_node
= cgraph_node::get (decl
);
217 if (decl_node
== NULL
)
220 delete_function_version (decl_node
->function_version ());
222 decl_node
->remove ();
225 /* Record that DECL1 and DECL2 are semantically identical function
228 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
230 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
231 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
232 cgraph_function_version_info
*decl1_v
= NULL
;
233 cgraph_function_version_info
*decl2_v
= NULL
;
234 cgraph_function_version_info
*before
;
235 cgraph_function_version_info
*after
;
237 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
238 decl1_v
= decl1_node
->function_version ();
239 decl2_v
= decl2_node
->function_version ();
241 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
245 decl1_v
= decl1_node
->insert_new_function_version ();
248 decl2_v
= decl2_node
->insert_new_function_version ();
250 /* Chain decl2_v and decl1_v. All semantically identical versions
251 will be chained together. */
256 while (before
->next
!= NULL
)
257 before
= before
->next
;
259 while (after
->prev
!= NULL
)
262 before
->next
= after
;
263 after
->prev
= before
;
266 /* Initialize callgraph dump file. */
269 symbol_table::initialize (void)
272 dump_file
= dump_begin (TDI_cgraph
, NULL
);
274 if (!ipa_clones_dump_file
)
275 ipa_clones_dump_file
= dump_begin (TDI_clones
, NULL
);
278 /* Allocate new callgraph node and insert it into basic data structures. */
281 symbol_table::create_empty (void)
283 cgraph_node
*node
= allocate_cgraph_symbol ();
285 node
->type
= SYMTAB_FUNCTION
;
286 node
->frequency
= NODE_FREQUENCY_NORMAL
;
287 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
293 /* Register HOOK to be called with DATA on each removed edge. */
294 cgraph_edge_hook_list
*
295 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
297 cgraph_edge_hook_list
*entry
;
298 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
300 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
310 /* Remove ENTRY from the list of hooks called on removing edges. */
312 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
314 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
316 while (*ptr
!= entry
)
322 /* Call all edge removal hooks. */
324 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
326 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
329 entry
->hook (e
, entry
->data
);
334 /* Register HOOK to be called with DATA on each removed node. */
335 cgraph_node_hook_list
*
336 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
338 cgraph_node_hook_list
*entry
;
339 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
341 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
351 /* Remove ENTRY from the list of hooks called on removing nodes. */
353 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
355 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
357 while (*ptr
!= entry
)
363 /* Call all node removal hooks. */
365 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
367 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
370 entry
->hook (node
, entry
->data
);
375 /* Call all node removal hooks. */
377 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
379 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
382 entry
->hook (node
, entry
->data
);
388 /* Register HOOK to be called with DATA on each inserted node. */
389 cgraph_node_hook_list
*
390 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
392 cgraph_node_hook_list
*entry
;
393 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
395 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
405 /* Remove ENTRY from the list of hooks called on inserted nodes. */
407 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
409 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
411 while (*ptr
!= entry
)
417 /* Register HOOK to be called with DATA on each duplicated edge. */
418 cgraph_2edge_hook_list
*
419 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
421 cgraph_2edge_hook_list
*entry
;
422 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
424 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
434 /* Remove ENTRY from the list of hooks called on duplicating edges. */
436 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
438 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
440 while (*ptr
!= entry
)
446 /* Call all edge duplication hooks. */
448 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
450 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
453 entry
->hook (cs1
, cs2
, entry
->data
);
458 /* Register HOOK to be called with DATA on each duplicated node. */
459 cgraph_2node_hook_list
*
460 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
462 cgraph_2node_hook_list
*entry
;
463 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
465 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
475 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
477 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
479 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
481 while (*ptr
!= entry
)
487 /* Call all node duplication hooks. */
489 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
492 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
495 entry
->hook (node
, node2
, entry
->data
);
500 /* Return cgraph node assigned to DECL. Create new one when needed. */
503 cgraph_node::create (tree decl
)
505 cgraph_node
*node
= symtab
->create_empty ();
506 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
510 node
->count
= profile_count::uninitialized ();
512 if ((flag_openacc
|| flag_openmp
)
513 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
515 node
->offloadable
= 1;
516 if (ENABLE_OFFLOADING
)
517 g
->have_offload
= true;
520 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
521 node
->ifunc_resolver
= true;
523 node
->register_symbol ();
525 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
527 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
528 node
->next_nested
= node
->origin
->nested
;
529 node
->origin
->nested
= node
;
534 /* Try to find a call graph node for declaration DECL and if it does not exist
535 or if it corresponds to an inline clone, create a new one. */
538 cgraph_node::get_create (tree decl
)
540 cgraph_node
*first_clone
= cgraph_node::get (decl
);
542 if (first_clone
&& !first_clone
->global
.inlined_to
)
545 cgraph_node
*node
= cgraph_node::create (decl
);
548 first_clone
->clone_of
= node
;
549 node
->clones
= first_clone
;
550 symtab
->symtab_prevail_in_asm_name_hash (node
);
551 node
->decl
->decl_with_vis
.symtab_node
= node
;
553 fprintf (dump_file
, "Introduced new external node "
554 "(%s) and turned into root of the clone tree.\n",
558 fprintf (dump_file
, "Introduced new external node "
559 "(%s).\n", node
->dump_name ());
563 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
564 the function body is associated with (not necessarily cgraph_node (DECL). */
567 cgraph_node::create_alias (tree alias
, tree target
)
569 cgraph_node
*alias_node
;
571 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
572 || TREE_CODE (target
) == IDENTIFIER_NODE
);
573 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
574 alias_node
= cgraph_node::get_create (alias
);
575 gcc_assert (!alias_node
->definition
);
576 alias_node
->alias_target
= target
;
577 alias_node
->definition
= true;
578 alias_node
->alias
= true;
579 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
580 alias_node
->transparent_alias
= alias_node
->weakref
= true;
581 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (alias
)))
582 alias_node
->ifunc_resolver
= true;
586 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
588 Same body aliases are output whenever the body of DECL is output,
589 and cgraph_node::get (ALIAS) transparently returns
590 cgraph_node::get (DECL). */
593 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
597 /* If aliases aren't supported by the assembler, fail. */
598 if (!TARGET_SUPPORTS_ALIASES
)
601 /* Langhooks can create same body aliases of symbols not defined.
602 Those are useless. Drop them on the floor. */
603 if (symtab
->global_info_ready
)
606 n
= cgraph_node::create_alias (alias
, decl
);
607 n
->cpp_implicit_alias
= true;
608 if (symtab
->cpp_implicit_aliases_done
)
609 n
->resolve_alias (cgraph_node::get (decl
));
613 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
614 aliases DECL with an adjustments made into the first parameter.
615 See comments in struct cgraph_thunk_info for detail on the parameters. */
618 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
619 HOST_WIDE_INT fixed_offset
,
620 HOST_WIDE_INT virtual_value
,
621 HOST_WIDE_INT indirect_offset
,
627 node
= cgraph_node::get (alias
);
631 node
= cgraph_node::create (alias
);
633 /* Make sure that if VIRTUAL_OFFSET is in sync with VIRTUAL_VALUE. */
634 gcc_checking_assert (virtual_offset
635 ? virtual_value
== wi::to_wide (virtual_offset
)
636 : virtual_value
== 0);
638 node
->thunk
.fixed_offset
= fixed_offset
;
639 node
->thunk
.virtual_value
= virtual_value
;
640 node
->thunk
.indirect_offset
= indirect_offset
;
641 node
->thunk
.alias
= real_alias
;
642 node
->thunk
.this_adjusting
= this_adjusting
;
643 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
644 node
->thunk
.thunk_p
= true;
645 node
->definition
= true;
650 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
651 Return NULL if there's no such node. */
654 cgraph_node::get_for_asmname (tree asmname
)
656 /* We do not want to look at inline clones. */
657 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
659 node
= node
->next_sharing_asm_name
)
661 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
662 if (cn
&& !cn
->global
.inlined_to
)
668 /* Returns a hash value for X (which really is a cgraph_edge). */
671 cgraph_edge_hasher::hash (cgraph_edge
*e
)
673 /* This is a really poor hash function, but it is what htab_hash_pointer
675 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
678 /* Returns a hash value for X (which really is a cgraph_edge). */
681 cgraph_edge_hasher::hash (gimple
*call_stmt
)
683 /* This is a really poor hash function, but it is what htab_hash_pointer
685 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
688 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
691 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
693 return x
->call_stmt
== y
;
696 /* Add call graph edge E to call site hash of its caller. */
699 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
701 gimple
*call
= e
->call_stmt
;
702 *e
->caller
->call_site_hash
->find_slot_with_hash
703 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
706 /* Add call graph edge E to call site hash of its caller. */
709 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
711 /* There are two speculative edges for every statement (one direct,
712 one indirect); always hash the direct one. */
713 if (e
->speculative
&& e
->indirect_unknown_callee
)
715 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
716 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
719 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
724 gcc_assert (!*slot
|| e
->speculative
);
728 /* Return the callgraph edge representing the GIMPLE_CALL statement
732 cgraph_node::get_edge (gimple
*call_stmt
)
738 return call_site_hash
->find_with_hash
739 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
741 /* This loop may turn out to be performance problem. In such case adding
742 hashtables into call nodes with very many edges is probably best
743 solution. It is not good idea to add pointer into CALL_EXPR itself
744 because we want to make possible having multiple cgraph nodes representing
745 different clones of the same body before the body is actually cloned. */
746 for (e
= callees
; e
; e
= e
->next_callee
)
748 if (e
->call_stmt
== call_stmt
)
754 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
756 if (e
->call_stmt
== call_stmt
)
763 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
764 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
765 cgraph_add_edge_to_call_site_hash (e2
);
766 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
767 cgraph_add_edge_to_call_site_hash (e2
);
774 /* Change field call_stmt of edge to NEW_STMT.
775 If UPDATE_SPECULATIVE and E is any component of speculative
776 edge, then update all components. */
779 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
783 /* Speculative edges has three component, update all of them
785 if (update_speculative
&& speculative
)
787 cgraph_edge
*direct
, *indirect
;
790 speculative_call_info (direct
, indirect
, ref
);
791 direct
->set_call_stmt (new_stmt
, false);
792 indirect
->set_call_stmt (new_stmt
, false);
793 ref
->stmt
= new_stmt
;
797 /* Only direct speculative edges go to call_site_hash. */
798 if (caller
->call_site_hash
799 && (!speculative
|| !indirect_unknown_callee
))
801 caller
->call_site_hash
->remove_elt_with_hash
802 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
805 cgraph_edge
*e
= this;
807 call_stmt
= new_stmt
;
808 if (indirect_unknown_callee
809 && (decl
= gimple_call_fndecl (new_stmt
)))
811 /* Constant propagation (and possibly also inlining?) can turn an
812 indirect call into a direct one. */
813 cgraph_node
*new_callee
= cgraph_node::get (decl
);
815 gcc_checking_assert (new_callee
);
816 e
= make_direct (new_callee
);
819 function
*fun
= DECL_STRUCT_FUNCTION (e
->caller
->decl
);
820 e
->can_throw_external
= stmt_can_throw_external (fun
, new_stmt
);
821 if (e
->caller
->call_site_hash
)
822 cgraph_add_edge_to_call_site_hash (e
);
825 /* Allocate a cgraph_edge structure and fill it with data according to the
826 parameters of which only CALLEE can be NULL (when creating an indirect call
830 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
831 gcall
*call_stmt
, profile_count count
,
832 bool indir_unknown_callee
)
836 /* LTO does not actually have access to the call_stmt since these
837 have not been loaded yet. */
840 /* This is a rather expensive check possibly triggering
841 construction of call stmt hashtable. */
843 gcc_checking_assert (!(e
= caller
->get_edge (call_stmt
))
846 gcc_assert (is_gimple_call (call_stmt
));
849 edge
= ggc_alloc
<cgraph_edge
> ();
850 edge
->m_summary_id
= -1;
853 gcc_assert (++edges_max_uid
!= 0);
854 edge
->m_uid
= edges_max_uid
;
856 edge
->caller
= caller
;
857 edge
->callee
= callee
;
858 edge
->prev_caller
= NULL
;
859 edge
->next_caller
= NULL
;
860 edge
->prev_callee
= NULL
;
861 edge
->next_callee
= NULL
;
862 edge
->lto_stmt_uid
= 0;
866 edge
->call_stmt
= call_stmt
;
867 edge
->can_throw_external
868 = call_stmt
? stmt_can_throw_external (DECL_STRUCT_FUNCTION (caller
->decl
),
871 && callee
&& callee
->decl
872 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
875 edge
->inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
876 edge
->call_stmt_cannot_inline_p
= true;
880 edge
->inline_failed
= CIF_FUNCTION_NOT_CONSIDERED
;
881 edge
->call_stmt_cannot_inline_p
= false;
884 edge
->indirect_info
= NULL
;
885 edge
->indirect_inlining_edge
= 0;
886 edge
->speculative
= false;
887 edge
->indirect_unknown_callee
= indir_unknown_callee
;
888 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
889 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
890 edge
->in_polymorphic_cdtor
891 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
894 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
895 if (call_stmt
&& caller
->call_site_hash
)
896 cgraph_add_edge_to_call_site_hash (edge
);
901 /* Create edge from a given function to CALLEE in the cgraph. */
904 cgraph_node::create_edge (cgraph_node
*callee
,
905 gcall
*call_stmt
, profile_count count
)
907 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
910 initialize_inline_failed (edge
);
912 edge
->next_caller
= callee
->callers
;
914 callee
->callers
->prev_caller
= edge
;
915 edge
->next_callee
= callees
;
917 callees
->prev_callee
= edge
;
919 callee
->callers
= edge
;
924 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
926 cgraph_indirect_call_info
*
927 cgraph_allocate_init_indirect_info (void)
929 cgraph_indirect_call_info
*ii
;
931 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
932 ii
->param_index
= -1;
936 /* Create an indirect edge with a yet-undetermined callee where the call
937 statement destination is a formal parameter of the caller with index
941 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
943 bool compute_indirect_info
)
945 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
949 initialize_inline_failed (edge
);
951 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
952 edge
->indirect_info
->ecf_flags
= ecf_flags
;
953 edge
->indirect_info
->vptr_changed
= true;
955 /* Record polymorphic call info. */
956 if (compute_indirect_info
958 && (target
= gimple_call_fn (call_stmt
))
959 && virtual_method_call_p (target
))
961 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
963 /* Only record types can have virtual calls. */
964 edge
->indirect_info
->polymorphic
= true;
965 edge
->indirect_info
->param_index
= -1;
966 edge
->indirect_info
->otr_token
967 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
968 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
969 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
970 edge
->indirect_info
->context
= context
;
973 edge
->next_callee
= indirect_calls
;
975 indirect_calls
->prev_callee
= edge
;
976 indirect_calls
= edge
;
981 /* Remove the edge from the list of the callees of the caller. */
984 cgraph_edge::remove_caller (void)
987 prev_callee
->next_callee
= next_callee
;
989 next_callee
->prev_callee
= prev_callee
;
992 if (indirect_unknown_callee
)
993 caller
->indirect_calls
= next_callee
;
995 caller
->callees
= next_callee
;
997 if (caller
->call_site_hash
)
998 caller
->call_site_hash
->remove_elt_with_hash
999 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
1002 /* Put the edge onto the free list. */
1005 symbol_table::free_edge (cgraph_edge
*e
)
1008 if (e
->m_summary_id
!= -1)
1009 edge_released_summary_ids
.safe_push (e
->m_summary_id
);
1011 if (e
->indirect_info
)
1012 ggc_free (e
->indirect_info
);
1016 /* Remove the edge in the cgraph. */
1019 cgraph_edge::remove (void)
1021 /* Call all edge removal hooks. */
1022 symtab
->call_edge_removal_hooks (this);
1024 if (!indirect_unknown_callee
)
1025 /* Remove from callers list of the callee. */
1028 /* Remove from callees list of the callers. */
1031 /* Put the edge onto the free list. */
1032 symtab
->free_edge (this);
1035 /* Turn edge into speculative call calling N2. Update
1036 the profile so the direct call is taken COUNT times
1039 At clone materialization time, the indirect call E will
1042 if (call_dest == N2)
1047 At this time the function just creates the direct call,
1048 the referencd representing the if conditional and attaches
1049 them all to the orginal indirect call statement.
1051 Return direct edge created. */
1054 cgraph_edge::make_speculative (cgraph_node
*n2
, profile_count direct_count
)
1056 cgraph_node
*n
= caller
;
1057 ipa_ref
*ref
= NULL
;
1061 fprintf (dump_file
, "Indirect call -> speculative call %s => %s\n",
1062 n
->dump_name (), n2
->dump_name ());
1064 e2
= n
->create_edge (n2
, call_stmt
, direct_count
);
1065 initialize_inline_failed (e2
);
1066 e2
->speculative
= true;
1067 if (TREE_NOTHROW (n2
->decl
))
1068 e2
->can_throw_external
= false;
1070 e2
->can_throw_external
= can_throw_external
;
1071 e2
->lto_stmt_uid
= lto_stmt_uid
;
1072 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1074 symtab
->call_edge_duplication_hooks (this, e2
);
1075 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1076 ref
->lto_stmt_uid
= lto_stmt_uid
;
1077 ref
->speculative
= speculative
;
1078 n2
->mark_address_taken ();
1082 /* Speculative call consist of three components:
1083 1) an indirect edge representing the original call
1084 2) an direct edge representing the new call
1085 3) ADDR_EXPR reference representing the speculative check.
1086 All three components are attached to single statement (the indirect
1087 call) and if one of them exists, all of them must exist.
1089 Given speculative call edge, return all three components.
1093 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1094 cgraph_edge
*&indirect
,
1095 ipa_ref
*&reference
)
1100 cgraph_edge
*e
= this;
1102 if (!e
->indirect_unknown_callee
)
1103 for (e2
= e
->caller
->indirect_calls
;
1104 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1105 e2
= e2
->next_callee
)
1110 /* We can take advantage of the call stmt hash. */
1113 e
= e
->caller
->get_edge (e2
->call_stmt
);
1114 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1117 for (e
= e
->caller
->callees
;
1118 e2
->call_stmt
!= e
->call_stmt
1119 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1123 gcc_assert (e
->speculative
&& e2
->speculative
);
1128 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1129 if (ref
->speculative
1130 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1131 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1137 /* Speculative edge always consist of all three components - direct edge,
1138 indirect and reference. */
1140 gcc_assert (e
&& e2
&& ref
);
1143 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1144 Remove the speculative call sequence and return edge representing the call.
1145 It is up to caller to redirect the call as appropriate. */
1148 cgraph_edge::resolve_speculation (tree callee_decl
)
1150 cgraph_edge
*edge
= this;
1154 gcc_assert (edge
->speculative
);
1155 edge
->speculative_call_info (e2
, edge
, ref
);
1157 || !ref
->referred
->semantically_equivalent_p
1158 (symtab_node::get (callee_decl
)))
1164 fprintf (dump_file
, "Speculative indirect call %s => %s has "
1165 "turned out to have contradicting known target ",
1166 edge
->caller
->dump_name (),
1167 e2
->callee
->dump_name ());
1168 print_generic_expr (dump_file
, callee_decl
);
1169 fprintf (dump_file
, "\n");
1173 fprintf (dump_file
, "Removing speculative call %s => %s\n",
1174 edge
->caller
->dump_name (),
1175 e2
->callee
->dump_name ());
1181 cgraph_edge
*tmp
= edge
;
1183 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1186 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1187 in the functions inlined through it. */
1189 edge
->count
+= e2
->count
;
1190 edge
->speculative
= false;
1191 e2
->speculative
= false;
1192 ref
->remove_reference ();
1193 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1196 e2
->callee
->remove_symbol_and_inline_clones ();
1197 if (edge
->caller
->call_site_hash
)
1198 cgraph_update_edge_in_call_site_hash (edge
);
1202 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1203 CALLEE. DELTA is an integer constant that is to be added to the this
1204 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1207 cgraph_edge::make_direct (cgraph_node
*callee
)
1209 cgraph_edge
*edge
= this;
1210 gcc_assert (indirect_unknown_callee
);
1212 /* If we are redirecting speculative call, make it non-speculative. */
1213 if (indirect_unknown_callee
&& speculative
)
1215 edge
= edge
->resolve_speculation (callee
->decl
);
1217 /* On successful speculation just return the pre existing direct edge. */
1218 if (!edge
->indirect_unknown_callee
)
1222 indirect_unknown_callee
= 0;
1223 ggc_free (indirect_info
);
1224 indirect_info
= NULL
;
1226 /* Get the edge out of the indirect edge list. */
1228 prev_callee
->next_callee
= next_callee
;
1230 next_callee
->prev_callee
= prev_callee
;
1232 caller
->indirect_calls
= next_callee
;
1234 /* Put it into the normal callee list */
1236 next_callee
= caller
->callees
;
1237 if (caller
->callees
)
1238 caller
->callees
->prev_callee
= edge
;
1239 caller
->callees
= edge
;
1241 /* Insert to callers list of the new callee. */
1242 edge
->set_callee (callee
);
1245 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
, false))
1247 call_stmt_cannot_inline_p
= true;
1248 inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
1251 /* We need to re-determine the inlining status of the edge. */
1252 initialize_inline_failed (edge
);
1256 /* If necessary, change the function declaration in the call statement
1257 associated with E so that it corresponds to the edge callee. */
1260 cgraph_edge::redirect_call_stmt_to_callee (void)
1262 cgraph_edge
*e
= this;
1264 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1266 gimple_stmt_iterator gsi
;
1274 e
->speculative_call_info (e
, e2
, ref
);
1275 /* If there already is an direct call (i.e. as a result of inliner's
1276 substitution), forget about speculating. */
1278 e
= e
->resolve_speculation (decl
);
1279 /* If types do not match, speculation was likely wrong.
1280 The direct edge was possibly redirected to the clone with a different
1281 signature. We did not update the call statement yet, so compare it
1282 with the reference that still points to the proper type. */
1283 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1284 ref
->referred
->decl
,
1288 fprintf (dump_file
, "Not expanding speculative call of %s -> %s\n"
1290 e
->caller
->dump_name (),
1291 e
->callee
->dump_name ());
1292 e
= e
->resolve_speculation ();
1293 /* We are producing the final function body and will throw away the
1294 callgraph edges really soon. Reset the counts/frequencies to
1295 keep verifier happy in the case of roundoff errors. */
1296 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1298 /* Expand speculation into GIMPLE code. */
1304 "Expanding speculative call of %s -> %s count: ",
1305 e
->caller
->dump_name (),
1306 e
->callee
->dump_name ());
1307 e
->count
.dump (dump_file
);
1308 fprintf (dump_file
, "\n");
1310 gcc_assert (e2
->speculative
);
1311 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1313 profile_probability prob
= e
->count
.probability_in (e
->count
1315 if (!prob
.initialized_p ())
1316 prob
= profile_probability::even ();
1317 new_stmt
= gimple_ic (e
->call_stmt
,
1318 dyn_cast
<cgraph_node
*> (ref
->referred
),
1320 e
->speculative
= false;
1321 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1323 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1324 e2
->speculative
= false;
1325 e2
->count
= gimple_bb (e2
->call_stmt
)->count
;
1326 ref
->speculative
= false;
1328 /* Indirect edges are not both in the call site hash.
1330 if (e
->caller
->call_site_hash
)
1331 cgraph_update_edge_in_call_site_hash (e2
);
1333 /* Continue redirecting E to proper target. */
1338 if (e
->indirect_unknown_callee
1339 || decl
== e
->callee
->decl
)
1340 return e
->call_stmt
;
1342 if (flag_checking
&& decl
)
1344 cgraph_node
*node
= cgraph_node::get (decl
);
1345 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1348 if (symtab
->dump_file
)
1350 fprintf (symtab
->dump_file
, "updating call of %s -> %s: ",
1351 e
->caller
->dump_name (), e
->callee
->dump_name ());
1352 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1353 if (e
->callee
->clone
.combined_args_to_skip
)
1355 fprintf (symtab
->dump_file
, " combined args to skip: ");
1356 dump_bitmap (symtab
->dump_file
,
1357 e
->callee
->clone
.combined_args_to_skip
);
1361 if (e
->callee
->clone
.combined_args_to_skip
)
1365 new_stmt
= e
->call_stmt
;
1366 if (e
->callee
->clone
.combined_args_to_skip
)
1368 = gimple_call_copy_skip_args (new_stmt
,
1369 e
->callee
->clone
.combined_args_to_skip
);
1370 tree old_fntype
= gimple_call_fntype (e
->call_stmt
);
1371 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1372 cgraph_node
*origin
= e
->callee
;
1373 while (origin
->clone_of
)
1374 origin
= origin
->clone_of
;
1376 if ((origin
->former_clone_of
1377 && old_fntype
== TREE_TYPE (origin
->former_clone_of
))
1378 || old_fntype
== TREE_TYPE (origin
->decl
))
1379 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1382 bitmap skip
= e
->callee
->clone
.combined_args_to_skip
;
1383 tree t
= cgraph_build_function_type_skip_args (old_fntype
, skip
,
1385 gimple_call_set_fntype (new_stmt
, t
);
1388 if (gimple_vdef (new_stmt
)
1389 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1390 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1392 gsi
= gsi_for_stmt (e
->call_stmt
);
1394 /* For optimized away parameters, add on the caller side
1396 DEBUG D#X => parm_Y(D)
1397 stmts and associate D#X with parm in decl_debug_args_lookup
1398 vector to say for debug info that if parameter parm had been passed,
1399 it would have value parm_Y(D). */
1400 if (e
->callee
->clone
.combined_args_to_skip
&& MAY_HAVE_DEBUG_BIND_STMTS
)
1402 vec
<tree
, va_gc
> **debug_args
1403 = decl_debug_args_lookup (e
->callee
->decl
);
1404 tree old_decl
= gimple_call_fndecl (e
->call_stmt
);
1405 if (debug_args
&& old_decl
)
1408 unsigned i
= 0, num
;
1409 unsigned len
= vec_safe_length (*debug_args
);
1410 unsigned nargs
= gimple_call_num_args (e
->call_stmt
);
1411 for (parm
= DECL_ARGUMENTS (old_decl
), num
= 0;
1412 parm
&& num
< nargs
;
1413 parm
= DECL_CHAIN (parm
), num
++)
1414 if (bitmap_bit_p (e
->callee
->clone
.combined_args_to_skip
, num
)
1415 && is_gimple_reg (parm
))
1419 while (i
< len
&& (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1425 && (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1430 tree ddecl
= (**debug_args
)[i
+ 1];
1431 tree arg
= gimple_call_arg (e
->call_stmt
, num
);
1432 if (!useless_type_conversion_p (TREE_TYPE (ddecl
),
1436 if (!fold_convertible_p (TREE_TYPE (ddecl
), arg
))
1438 if (TREE_CODE (arg
) == SSA_NAME
1439 && gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg
))
1441 = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (arg
)))
1442 && useless_type_conversion_p (TREE_TYPE (ddecl
),
1446 arg
= fold_convert (TREE_TYPE (ddecl
), arg
);
1450 = gimple_build_debug_bind (ddecl
, unshare_expr (arg
),
1452 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
1457 gsi_replace (&gsi
, new_stmt
, false);
1458 /* We need to defer cleaning EH info on the new statement to
1459 fixup-cfg. We may not have dominator information at this point
1460 and thus would end up with unreachable blocks and have no way
1461 to communicate that we need to run CFG cleanup then. */
1462 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1465 remove_stmt_from_eh_lp (e
->call_stmt
);
1466 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1471 new_stmt
= e
->call_stmt
;
1472 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1473 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1476 /* If changing the call to __cxa_pure_virtual or similar noreturn function,
1477 adjust gimple_call_fntype too. */
1478 if (gimple_call_noreturn_p (new_stmt
)
1479 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e
->callee
->decl
)))
1480 && TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
))
1481 && (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
)))
1483 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1485 /* If the call becomes noreturn, remove the LHS if possible. */
1486 tree lhs
= gimple_call_lhs (new_stmt
);
1488 && gimple_call_noreturn_p (new_stmt
)
1489 && (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt
)))
1490 || should_remove_lhs_p (lhs
)))
1492 if (TREE_CODE (lhs
) == SSA_NAME
)
1494 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1495 TREE_TYPE (lhs
), NULL
);
1496 var
= get_or_create_ssa_default_def
1497 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1498 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1499 gsi
= gsi_for_stmt (new_stmt
);
1500 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1501 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1503 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1504 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1507 /* If new callee has no static chain, remove it. */
1508 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1510 gimple_call_set_chain (new_stmt
, NULL
);
1511 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1514 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1517 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1519 if (symtab
->dump_file
)
1521 fprintf (symtab
->dump_file
, " updated to:");
1522 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1527 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1528 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1529 of OLD_STMT if it was previously call statement.
1530 If NEW_STMT is NULL, the call has been dropped without any
1534 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1535 gimple
*old_stmt
, tree old_call
,
1538 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1539 ? gimple_call_fndecl (new_stmt
) : 0;
1541 /* We are seeing indirect calls, then there is nothing to update. */
1542 if (!new_call
&& !old_call
)
1544 /* See if we turned indirect call into direct call or folded call to one builtin
1545 into different builtin. */
1546 if (old_call
!= new_call
)
1548 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1549 cgraph_edge
*ne
= NULL
;
1550 profile_count count
;
1554 /* Keep calls marked as dead dead. */
1555 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1556 && fndecl_built_in_p (e
->callee
->decl
, BUILT_IN_UNREACHABLE
))
1558 node
->get_edge (old_stmt
)->set_call_stmt
1559 (as_a
<gcall
*> (new_stmt
));
1562 /* See if the edge is already there and has the correct callee. It
1563 might be so because of indirect inlining has already updated
1564 it. We also might've cloned and redirected the edge. */
1565 if (new_call
&& e
->callee
)
1567 cgraph_node
*callee
= e
->callee
;
1570 if (callee
->decl
== new_call
1571 || callee
->former_clone_of
== new_call
)
1573 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1576 callee
= callee
->clone_of
;
1580 /* Otherwise remove edge and create new one; we can't simply redirect
1581 since function has changed, so inline plan and other information
1582 attached to edge is invalid. */
1584 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1587 e
->callee
->remove_symbol_and_inline_clones ();
1591 /* We are seeing new direct call; compute profile info based on BB. */
1592 basic_block bb
= gimple_bb (new_stmt
);
1598 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1599 as_a
<gcall
*> (new_stmt
), count
);
1600 gcc_assert (ne
->inline_failed
);
1603 /* We only updated the call stmt; update pointer in cgraph edge.. */
1604 else if (old_stmt
!= new_stmt
)
1605 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1608 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1609 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1610 of OLD_STMT before it was updated (updating can happen inplace). */
1613 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1616 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1619 gcc_checking_assert (orig
);
1620 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1622 for (node
= orig
->clones
; node
!= orig
;)
1624 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1626 node
= node
->clones
;
1627 else if (node
->next_sibling_clone
)
1628 node
= node
->next_sibling_clone
;
1631 while (node
!= orig
&& !node
->next_sibling_clone
)
1632 node
= node
->clone_of
;
1634 node
= node
->next_sibling_clone
;
1640 /* Remove all callees from the node. */
1643 cgraph_node::remove_callees (void)
1647 /* It is sufficient to remove the edges from the lists of callers of
1648 the callees. The callee list of the node can be zapped with one
1650 for (e
= callees
; e
; e
= f
)
1653 symtab
->call_edge_removal_hooks (e
);
1654 if (!e
->indirect_unknown_callee
)
1655 e
->remove_callee ();
1656 symtab
->free_edge (e
);
1658 for (e
= indirect_calls
; e
; e
= f
)
1661 symtab
->call_edge_removal_hooks (e
);
1662 if (!e
->indirect_unknown_callee
)
1663 e
->remove_callee ();
1664 symtab
->free_edge (e
);
1666 indirect_calls
= NULL
;
1670 call_site_hash
->empty ();
1671 call_site_hash
= NULL
;
1675 /* Remove all callers from the node. */
1678 cgraph_node::remove_callers (void)
1682 /* It is sufficient to remove the edges from the lists of callees of
1683 the callers. The caller list of the node can be zapped with one
1685 for (e
= callers
; e
; e
= f
)
1688 symtab
->call_edge_removal_hooks (e
);
1689 e
->remove_caller ();
1690 symtab
->free_edge (e
);
1695 /* Helper function for cgraph_release_function_body and free_lang_data.
1696 It releases body from function DECL without having to inspect its
1697 possibly non-existent symtab node. */
1700 release_function_body (tree decl
)
1702 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1706 && loops_for_fn (fn
))
1708 fn
->curr_properties
&= ~PROP_loops
;
1709 loop_optimizer_finalize (fn
);
1713 delete_tree_ssa (fn
);
1718 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1719 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1720 delete_tree_cfg_annotations (fn
);
1724 if (fn
->value_histograms
)
1725 free_histograms (fn
);
1726 gimple_set_body (decl
, NULL
);
1727 /* Struct function hangs a lot of data that would leak if we didn't
1728 removed all pointers to it. */
1730 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1732 DECL_SAVED_TREE (decl
) = NULL
;
1735 /* Release memory used to represent body of function.
1736 Use this only for functions that are released before being translated to
1737 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1738 are free'd in final.c via free_after_compilation().
1739 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1742 cgraph_node::release_body (bool keep_arguments
)
1744 ipa_transforms_to_apply
.release ();
1745 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1747 DECL_RESULT (decl
) = NULL
;
1749 if (!keep_arguments
)
1750 DECL_ARGUMENTS (decl
) = NULL
;
1752 /* If the node is abstract and needed, then do not clear
1753 DECL_INITIAL of its associated function declaration because it's
1754 needed to emit debug info later. */
1755 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1756 DECL_INITIAL (decl
) = error_mark_node
;
1757 release_function_body (decl
);
1760 lto_free_function_in_decl_state_for_node (this);
1761 lto_file_data
= NULL
;
1765 /* Remove function from symbol table. */
1768 cgraph_node::remove (void)
1772 if (symtab
->ipa_clones_dump_file
&& symtab
->cloned_nodes
.contains (this))
1773 fprintf (symtab
->ipa_clones_dump_file
,
1774 "Callgraph removal;%s;%d;%s;%d;%d\n", asm_name (), order
,
1775 DECL_SOURCE_FILE (decl
), DECL_SOURCE_LINE (decl
),
1776 DECL_SOURCE_COLUMN (decl
));
1778 symtab
->call_cgraph_removal_hooks (this);
1781 ipa_transforms_to_apply
.release ();
1782 delete_function_version (function_version ());
1784 /* Incremental inlining access removed nodes stored in the postorder list.
1786 force_output
= false;
1787 forced_by_abi
= false;
1788 for (n
= nested
; n
; n
= n
->next_nested
)
1793 cgraph_node
**node2
= &origin
->nested
;
1795 while (*node2
!= this)
1796 node2
= &(*node2
)->next_nested
;
1797 *node2
= next_nested
;
1800 if (prev_sibling_clone
)
1801 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1803 clone_of
->clones
= next_sibling_clone
;
1804 if (next_sibling_clone
)
1805 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1808 cgraph_node
*n
, *next
;
1812 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1813 n
->clone_of
= clone_of
;
1814 n
->clone_of
= clone_of
;
1815 n
->next_sibling_clone
= clone_of
->clones
;
1816 if (clone_of
->clones
)
1817 clone_of
->clones
->prev_sibling_clone
= n
;
1818 clone_of
->clones
= clones
;
1822 /* We are removing node with clones. This makes clones inconsistent,
1823 but assume they will be removed subsequently and just keep clone
1824 tree intact. This can happen in unreachable function removal since
1825 we remove unreachable functions in random order, not by bottom-up
1826 walk of clone trees. */
1827 for (n
= clones
; n
; n
= next
)
1829 next
= n
->next_sibling_clone
;
1830 n
->next_sibling_clone
= NULL
;
1831 n
->prev_sibling_clone
= NULL
;
1837 /* While all the clones are removed after being proceeded, the function
1838 itself is kept in the cgraph even after it is compiled. Check whether
1839 we are done with this body and reclaim it proactively if this is the case.
1841 if (symtab
->state
!= LTO_STREAMING
)
1843 n
= cgraph_node::get (decl
);
1845 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1846 && ((symtab
->global_info_ready
|| in_lto_p
)
1847 && (TREE_ASM_WRITTEN (n
->decl
)
1848 || DECL_EXTERNAL (n
->decl
)
1850 || (!flag_wpa
&& n
->in_other_partition
)))))
1855 lto_free_function_in_decl_state_for_node (this);
1856 lto_file_data
= NULL
;
1862 call_site_hash
->empty ();
1863 call_site_hash
= NULL
;
1866 symtab
->release_symbol (this);
1869 /* Likewise indicate that a node is having address taken. */
1872 cgraph_node::mark_address_taken (void)
1874 /* Indirect inlining can figure out that all uses of the address are
1876 if (global
.inlined_to
)
1878 gcc_assert (cfun
->after_inlining
);
1879 gcc_assert (callers
->indirect_inlining_edge
);
1882 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1883 IPA_REF_ADDR reference exists (and thus it should be set on node
1884 representing alias we take address of) and as a test whether address
1885 of the object was taken (and thus it should be set on node alias is
1886 referring to). We should remove the first use and the remove the
1889 cgraph_node
*node
= ultimate_alias_target ();
1890 node
->address_taken
= 1;
1893 /* Return local info for the compiled function. */
1896 cgraph_node::local_info (tree decl
)
1898 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1899 cgraph_node
*node
= get (decl
);
1902 return &node
->ultimate_alias_target ()->local
;
1905 /* Return local info for the compiled function. */
1908 cgraph_node::rtl_info (tree decl
)
1910 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1911 cgraph_node
*node
= get (decl
);
1914 enum availability avail
;
1915 node
= node
->ultimate_alias_target (&avail
);
1916 if (decl
!= current_function_decl
1917 && (avail
< AVAIL_AVAILABLE
1918 || (node
->decl
!= current_function_decl
1919 && !TREE_ASM_WRITTEN (node
->decl
))))
1921 /* Allocate if it doesn't exist. */
1922 if (node
->rtl
== NULL
)
1923 node
->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1927 /* Return a string describing the failure REASON. */
1930 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1933 #define DEFCIFCODE(code, type, string) string,
1935 static const char *cif_string_table
[CIF_N_REASONS
] = {
1936 #include "cif-code.def"
1939 /* Signedness of an enum type is implementation defined, so cast it
1940 to unsigned before testing. */
1941 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1942 return cif_string_table
[reason
];
1945 /* Return a type describing the failure REASON. */
1947 cgraph_inline_failed_type_t
1948 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1951 #define DEFCIFCODE(code, type, string) type,
1953 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1954 #include "cif-code.def"
1957 /* Signedness of an enum type is implementation defined, so cast it
1958 to unsigned before testing. */
1959 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1960 return cif_type_table
[reason
];
1963 /* Names used to print out the availability enum. */
1964 const char * const cgraph_availability_names
[] =
1965 {"unset", "not_available", "overwritable", "available", "local"};
1967 /* Output flags of edge to a file F. */
1970 cgraph_edge::dump_edge_flags (FILE *f
)
1973 fprintf (f
, "(speculative) ");
1975 fprintf (f
, "(inlined) ");
1976 if (call_stmt_cannot_inline_p
)
1977 fprintf (f
, "(call_stmt_cannot_inline_p) ");
1978 if (indirect_inlining_edge
)
1979 fprintf (f
, "(indirect_inlining) ");
1980 if (count
.initialized_p ())
1985 fprintf (f
, "%.2f per call) ", sreal_frequency ().to_double ());
1987 if (can_throw_external
)
1988 fprintf (f
, "(can throw external) ");
1991 /* Dump call graph node to file F. */
1994 cgraph_node::dump (FILE *f
)
2000 if (global
.inlined_to
)
2001 fprintf (f
, " Function %s is inline copy in %s\n",
2003 global
.inlined_to
->dump_name ());
2005 fprintf (f
, " Clone of %s\n", clone_of
->dump_asm_name ());
2006 if (symtab
->function_flags_ready
)
2007 fprintf (f
, " Availability: %s\n",
2008 cgraph_availability_names
[get_availability ()]);
2011 fprintf (f
, " Profile id: %i\n",
2013 cgraph_function_version_info
*vi
= function_version ();
2016 fprintf (f
, " Version info: ");
2017 if (vi
->prev
!= NULL
)
2019 fprintf (f
, "prev: ");
2020 fprintf (f
, "%s ", vi
->prev
->this_node
->dump_asm_name ());
2022 if (vi
->next
!= NULL
)
2024 fprintf (f
, "next: ");
2025 fprintf (f
, "%s ", vi
->next
->this_node
->dump_asm_name ());
2027 if (vi
->dispatcher_resolver
!= NULL_TREE
)
2028 fprintf (f
, "dispatcher: %s",
2029 lang_hooks
.decl_printable_name (vi
->dispatcher_resolver
, 2));
2033 fprintf (f
, " Function flags:");
2034 if (count
.initialized_p ())
2036 fprintf (f
, " count:");
2039 if (tp_first_run
> 0)
2040 fprintf (f
, " first_run:%i", tp_first_run
);
2042 fprintf (f
, " nested in:%s", origin
->asm_name ());
2043 if (gimple_has_body_p (decl
))
2044 fprintf (f
, " body");
2046 fprintf (f
, " process");
2048 fprintf (f
, " local");
2049 if (local
.redefined_extern_inline
)
2050 fprintf (f
, " redefined_extern_inline");
2051 if (only_called_at_startup
)
2052 fprintf (f
, " only_called_at_startup");
2053 if (only_called_at_exit
)
2054 fprintf (f
, " only_called_at_exit");
2056 fprintf (f
, " tm_clone");
2057 if (calls_comdat_local
)
2058 fprintf (f
, " calls_comdat_local");
2060 fprintf (f
, " icf_merged");
2062 fprintf (f
, " merged_comdat");
2064 fprintf (f
, " split_part");
2065 if (indirect_call_target
)
2066 fprintf (f
, " indirect_call_target");
2068 fprintf (f
, " nonfreeing_fn");
2069 if (DECL_STATIC_CONSTRUCTOR (decl
))
2070 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2071 if (DECL_STATIC_DESTRUCTOR (decl
))
2072 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2073 if (frequency
== NODE_FREQUENCY_HOT
)
2074 fprintf (f
, " hot");
2075 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2076 fprintf (f
, " unlikely_executed");
2077 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2078 fprintf (f
, " executed_once");
2079 if (opt_for_fn (decl
, optimize_size
))
2080 fprintf (f
, " optimize_size");
2081 if (parallelized_function
)
2082 fprintf (f
, " parallelized_function");
2083 if (DECL_IS_OPERATOR_NEW_P (decl
))
2084 fprintf (f
, " operator_new");
2085 if (DECL_IS_OPERATOR_DELETE_P (decl
))
2086 fprintf (f
, " operator_delete");
2093 fprintf (f
, " Thunk");
2095 fprintf (f
, " of %s (asm:%s)",
2096 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2097 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2098 fprintf (f
, " fixed offset %i virtual value %i indirect_offset %i "
2099 "has virtual offset %i\n",
2100 (int)thunk
.fixed_offset
,
2101 (int)thunk
.virtual_value
,
2102 (int)thunk
.indirect_offset
,
2103 (int)thunk
.virtual_offset_p
);
2105 else if (former_thunk_p ())
2106 fprintf (f
, " Former thunk fixed offset %i virtual value %i "
2107 "indirect_offset %i has virtual offset %i\n",
2108 (int)thunk
.fixed_offset
,
2109 (int)thunk
.virtual_value
,
2110 (int)thunk
.indirect_offset
,
2111 (int)thunk
.virtual_offset_p
);
2112 if (alias
&& thunk
.alias
2113 && DECL_P (thunk
.alias
))
2115 fprintf (f
, " Alias of %s",
2116 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2117 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2118 fprintf (f
, " (asm:%s)",
2119 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2123 fprintf (f
, " Called by: ");
2125 profile_count sum
= profile_count::zero ();
2126 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2128 fprintf (f
, "%s ", edge
->caller
->dump_name ());
2129 edge
->dump_edge_flags (f
);
2130 if (edge
->count
.initialized_p ())
2131 sum
+= edge
->count
.ipa ();
2134 fprintf (f
, "\n Calls: ");
2135 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2137 fprintf (f
, "%s ", edge
->callee
->dump_name ());
2138 edge
->dump_edge_flags (f
);
2142 if (count
.ipa ().initialized_p ())
2148 FOR_EACH_ALIAS (this, ref
)
2149 if (dyn_cast
<cgraph_node
*> (ref
->referring
)->count
.initialized_p ())
2150 sum
+= dyn_cast
<cgraph_node
*> (ref
->referring
)->count
.ipa ();
2152 if (global
.inlined_to
2153 || (symtab
->state
< EXPANSION
2154 && ultimate_alias_target () == this && only_called_directly_p ()))
2155 ok
= !count
.ipa ().differs_from_p (sum
);
2156 else if (count
.ipa () > profile_count::from_gcov_type (100)
2157 && count
.ipa () < sum
.apply_scale (99, 100))
2158 ok
= false, min
= true;
2161 fprintf (f
, " Invalid sum of caller counts ");
2164 fprintf (f
, ", should be at most ");
2166 fprintf (f
, ", should be ");
2167 count
.ipa ().dump (f
);
2172 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2174 if (edge
->indirect_info
->polymorphic
)
2176 fprintf (f
, " Polymorphic indirect call of type ");
2177 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2178 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2181 fprintf (f
, " Indirect call");
2182 edge
->dump_edge_flags (f
);
2183 if (edge
->indirect_info
->param_index
!= -1)
2185 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2186 if (edge
->indirect_info
->agg_contents
)
2187 fprintf (f
, " loaded from %s %s at offset %i",
2188 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2189 edge
->indirect_info
->by_ref
? "passed by reference":"",
2190 (int)edge
->indirect_info
->offset
);
2191 if (edge
->indirect_info
->vptr_changed
)
2192 fprintf (f
, " (vptr maybe changed)");
2195 if (edge
->indirect_info
->polymorphic
)
2196 edge
->indirect_info
->context
.dump (f
);
2200 /* Dump call graph node to file F in graphviz format. */
2203 cgraph_node::dump_graphviz (FILE *f
)
2207 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2209 cgraph_node
*callee
= edge
->callee
;
2211 fprintf (f
, "\t\"%s\" -> \"%s\"\n", name (), callee
->name ());
2216 /* Dump call graph node NODE to stderr. */
2219 cgraph_node::debug (void)
2224 /* Dump the callgraph to file F. */
2227 cgraph_node::dump_cgraph (FILE *f
)
2231 fprintf (f
, "callgraph:\n\n");
2232 FOR_EACH_FUNCTION (node
)
2236 /* Return true when the DECL can possibly be inlined. */
2239 cgraph_function_possibly_inlined_p (tree decl
)
2241 if (!symtab
->global_info_ready
)
2242 return !DECL_UNINLINABLE (decl
);
2243 return DECL_POSSIBLY_INLINED (decl
);
2246 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2248 cgraph_node::unnest (void)
2250 cgraph_node
**node2
= &origin
->nested
;
2251 gcc_assert (origin
);
2253 while (*node2
!= this)
2254 node2
= &(*node2
)->next_nested
;
2255 *node2
= next_nested
;
2259 /* Return function availability. See cgraph.h for description of individual
2262 cgraph_node::get_availability (symtab_node
*ref
)
2266 cgraph_node
*cref
= dyn_cast
<cgraph_node
*> (ref
);
2268 ref
= cref
->global
.inlined_to
;
2270 enum availability avail
;
2272 avail
= AVAIL_NOT_AVAILABLE
;
2273 else if (local
.local
)
2274 avail
= AVAIL_LOCAL
;
2275 else if (global
.inlined_to
)
2276 avail
= AVAIL_AVAILABLE
;
2277 else if (transparent_alias
)
2278 ultimate_alias_target (&avail
, ref
);
2279 else if (ifunc_resolver
2280 || lookup_attribute ("noipa", DECL_ATTRIBUTES (decl
)))
2281 avail
= AVAIL_INTERPOSABLE
;
2282 else if (!externally_visible
)
2283 avail
= AVAIL_AVAILABLE
;
2284 /* If this is a reference from symbol itself and there are no aliases, we
2285 may be sure that the symbol was not interposed by something else because
2286 the symbol itself would be unreachable otherwise.
2288 Also comdat groups are always resolved in groups. */
2289 else if ((this == ref
&& !has_aliases_p ())
2290 || (ref
&& get_comdat_group ()
2291 && get_comdat_group () == ref
->get_comdat_group ()))
2292 avail
= AVAIL_AVAILABLE
;
2293 /* Inline functions are safe to be analyzed even if their symbol can
2294 be overwritten at runtime. It is not meaningful to enforce any sane
2295 behavior on replacing inline function by different body. */
2296 else if (DECL_DECLARED_INLINE_P (decl
))
2297 avail
= AVAIL_AVAILABLE
;
2299 /* If the function can be overwritten, return OVERWRITABLE. Take
2300 care at least of two notable extensions - the COMDAT functions
2301 used to share template instantiations in C++ (this is symmetric
2302 to code cp_cannot_inline_tree_fn and probably shall be shared and
2303 the inlinability hooks completely eliminated). */
2305 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2306 avail
= AVAIL_INTERPOSABLE
;
2307 else avail
= AVAIL_AVAILABLE
;
2312 /* Worker for cgraph_node_can_be_local_p. */
2314 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2316 return !(!node
->force_output
2317 && ((DECL_COMDAT (node
->decl
)
2318 && !node
->forced_by_abi
2319 && !node
->used_from_object_file_p ()
2320 && !node
->same_comdat_group
)
2321 || !node
->externally_visible
));
2324 /* Return true if cgraph_node can be made local for API change.
2325 Extern inline functions and C++ COMDAT functions can be made local
2326 at the expense of possible code size growth if function is used in multiple
2327 compilation units. */
2329 cgraph_node::can_be_local_p (void)
2331 return (!address_taken
2332 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2336 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2337 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
2338 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2341 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2342 (cgraph_node
*, void *),
2344 bool include_overwritable
,
2345 bool exclude_virtual_thunks
)
2349 enum availability avail
= AVAIL_AVAILABLE
;
2351 if (include_overwritable
2352 || (avail
= get_availability ()) > AVAIL_INTERPOSABLE
)
2354 if (callback (this, data
))
2357 FOR_EACH_ALIAS (this, ref
)
2359 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2360 if (include_overwritable
2361 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2362 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2363 include_overwritable
,
2364 exclude_virtual_thunks
))
2367 if (avail
<= AVAIL_INTERPOSABLE
)
2369 for (e
= callers
; e
; e
= e
->next_caller
)
2370 if (e
->caller
->thunk
.thunk_p
2371 && (include_overwritable
2372 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2373 && !(exclude_virtual_thunks
2374 && e
->caller
->thunk
.virtual_offset_p
))
2375 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2376 include_overwritable
,
2377 exclude_virtual_thunks
))
2383 /* Worker to bring NODE local. */
2386 cgraph_node::make_local (cgraph_node
*node
, void *)
2388 gcc_checking_assert (node
->can_be_local_p ());
2389 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2391 node
->make_decl_local ();
2392 node
->set_section (NULL
);
2393 node
->set_comdat_group (NULL
);
2394 node
->externally_visible
= false;
2395 node
->forced_by_abi
= false;
2396 node
->local
.local
= true;
2397 node
->set_section (NULL
);
2398 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2399 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2400 && !flag_incremental_link
);
2401 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2402 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2407 /* Bring cgraph node local. */
2410 cgraph_node::make_local (void)
2412 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2415 /* Worker to set nothrow flag. */
2418 set_nothrow_flag_1 (cgraph_node
*node
, bool nothrow
, bool non_call
,
2423 if (nothrow
&& !TREE_NOTHROW (node
->decl
))
2425 /* With non-call exceptions we can't say for sure if other function body
2426 was not possibly optimized to stil throw. */
2427 if (!non_call
|| node
->binds_to_current_def_p ())
2429 TREE_NOTHROW (node
->decl
) = true;
2431 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2432 e
->can_throw_external
= false;
2435 else if (!nothrow
&& TREE_NOTHROW (node
->decl
))
2437 TREE_NOTHROW (node
->decl
) = false;
2441 FOR_EACH_ALIAS (node
, ref
)
2443 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2444 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2445 set_nothrow_flag_1 (alias
, nothrow
, non_call
, changed
);
2447 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2448 if (e
->caller
->thunk
.thunk_p
2449 && (!nothrow
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2450 set_nothrow_flag_1 (e
->caller
, nothrow
, non_call
, changed
);
2453 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2454 if any to NOTHROW. */
2457 cgraph_node::set_nothrow_flag (bool nothrow
)
2459 bool changed
= false;
2460 bool non_call
= opt_for_fn (decl
, flag_non_call_exceptions
);
2462 if (!nothrow
|| get_availability () > AVAIL_INTERPOSABLE
)
2463 set_nothrow_flag_1 (this, nothrow
, non_call
, &changed
);
2468 FOR_EACH_ALIAS (this, ref
)
2470 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2471 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2472 set_nothrow_flag_1 (alias
, nothrow
, non_call
, &changed
);
2478 /* Worker to set malloc flag. */
2480 set_malloc_flag_1 (cgraph_node
*node
, bool malloc_p
, bool *changed
)
2482 if (malloc_p
&& !DECL_IS_MALLOC (node
->decl
))
2484 DECL_IS_MALLOC (node
->decl
) = true;
2489 FOR_EACH_ALIAS (node
, ref
)
2491 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2492 if (!malloc_p
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2493 set_malloc_flag_1 (alias
, malloc_p
, changed
);
2496 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2497 if (e
->caller
->thunk
.thunk_p
2498 && (!malloc_p
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2499 set_malloc_flag_1 (e
->caller
, malloc_p
, changed
);
2502 /* Set DECL_IS_MALLOC on NODE's decl and on NODE's aliases if any. */
2505 cgraph_node::set_malloc_flag (bool malloc_p
)
2507 bool changed
= false;
2509 if (!malloc_p
|| get_availability () > AVAIL_INTERPOSABLE
)
2510 set_malloc_flag_1 (this, malloc_p
, &changed
);
2515 FOR_EACH_ALIAS (this, ref
)
2517 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2518 if (!malloc_p
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2519 set_malloc_flag_1 (alias
, malloc_p
, &changed
);
2525 /* Worker to set_const_flag. */
2528 set_const_flag_1 (cgraph_node
*node
, bool set_const
, bool looping
,
2531 /* Static constructors and destructors without a side effect can be
2533 if (set_const
&& !looping
)
2535 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2537 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2540 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2542 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2548 if (TREE_READONLY (node
->decl
))
2550 TREE_READONLY (node
->decl
) = 0;
2551 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2557 /* Consider function:
2564 During early optimization we will turn this into:
2571 Now if this function will be detected as CONST however when interposed
2572 it may end up being just pure. We always must assume the worst
2574 if (TREE_READONLY (node
->decl
))
2576 if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2578 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2582 else if (node
->binds_to_current_def_p ())
2584 TREE_READONLY (node
->decl
) = true;
2585 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2586 DECL_PURE_P (node
->decl
) = false;
2591 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2592 fprintf (dump_file
, "Dropping state to PURE because function does "
2593 "not bind to current def.\n");
2594 if (!DECL_PURE_P (node
->decl
))
2596 DECL_PURE_P (node
->decl
) = true;
2597 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2600 else if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2602 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2609 FOR_EACH_ALIAS (node
, ref
)
2611 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2612 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2613 set_const_flag_1 (alias
, set_const
, looping
, changed
);
2615 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2616 if (e
->caller
->thunk
.thunk_p
2617 && (!set_const
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2619 /* Virtual thunks access virtual offset in the vtable, so they can
2620 only be pure, never const. */
2622 && (e
->caller
->thunk
.virtual_offset_p
2623 || !node
->binds_to_current_def_p (e
->caller
)))
2624 *changed
|= e
->caller
->set_pure_flag (true, looping
);
2626 set_const_flag_1 (e
->caller
, set_const
, looping
, changed
);
2630 /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
2631 If SET_CONST if false, clear the flag.
2633 When setting the flag be careful about possible interposition and
2634 do not set the flag for functions that can be interposet and set pure
2635 flag for functions that can bind to other definition.
2637 Return true if any change was done. */
2640 cgraph_node::set_const_flag (bool set_const
, bool looping
)
2642 bool changed
= false;
2643 if (!set_const
|| get_availability () > AVAIL_INTERPOSABLE
)
2644 set_const_flag_1 (this, set_const
, looping
, &changed
);
2649 FOR_EACH_ALIAS (this, ref
)
2651 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2652 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2653 set_const_flag_1 (alias
, set_const
, looping
, &changed
);
2659 /* Info used by set_pure_flag_1. */
2661 struct set_pure_flag_info
2668 /* Worker to set_pure_flag. */
2671 set_pure_flag_1 (cgraph_node
*node
, void *data
)
2673 struct set_pure_flag_info
*info
= (struct set_pure_flag_info
*)data
;
2674 /* Static constructors and destructors without a side effect can be
2676 if (info
->pure
&& !info
->looping
)
2678 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2680 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2681 info
->changed
= true;
2683 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2685 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2686 info
->changed
= true;
2691 if (!DECL_PURE_P (node
->decl
) && !TREE_READONLY (node
->decl
))
2693 DECL_PURE_P (node
->decl
) = true;
2694 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = info
->looping
;
2695 info
->changed
= true;
2697 else if (DECL_LOOPING_CONST_OR_PURE_P (node
->decl
)
2700 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2701 info
->changed
= true;
2706 if (DECL_PURE_P (node
->decl
))
2708 DECL_PURE_P (node
->decl
) = false;
2709 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2710 info
->changed
= true;
2716 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2719 When setting the flag, be careful about possible interposition.
2720 Return true if any change was done. */
2723 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2725 struct set_pure_flag_info info
= {pure
, looping
, false};
2726 call_for_symbol_thunks_and_aliases (set_pure_flag_1
, &info
, !pure
, true);
2727 return info
.changed
;
2730 /* Return true when cgraph_node cannot return or throw and thus
2731 it is safe to ignore its side effects for IPA analysis. */
2734 cgraph_node::cannot_return_p (void)
2736 int flags
= flags_from_decl_or_type (decl
);
2737 if (!opt_for_fn (decl
, flag_exceptions
))
2738 return (flags
& ECF_NORETURN
) != 0;
2740 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2741 == (ECF_NORETURN
| ECF_NOTHROW
));
2744 /* Return true when call of edge cannot lead to return from caller
2745 and thus it is safe to ignore its side effects for IPA analysis
2746 when computing side effects of the caller.
2747 FIXME: We could actually mark all edges that have no reaching
2748 patch to the exit block or throw to get better results. */
2750 cgraph_edge::cannot_lead_to_return_p (void)
2752 if (caller
->cannot_return_p ())
2754 if (indirect_unknown_callee
)
2756 int flags
= indirect_info
->ecf_flags
;
2757 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2758 return (flags
& ECF_NORETURN
) != 0;
2760 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2761 == (ECF_NORETURN
| ECF_NOTHROW
));
2764 return callee
->cannot_return_p ();
2767 /* Return true if the edge may be considered hot. */
2770 cgraph_edge::maybe_hot_p (void)
2772 if (!maybe_hot_count_p (NULL
, count
.ipa ()))
2774 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2776 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2778 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2780 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2782 if (opt_for_fn (caller
->decl
, optimize_size
))
2784 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2786 /* If profile is now known yet, be conservative.
2787 FIXME: this predicate is used by early inliner and can do better there. */
2788 if (symtab
->state
< IPA_SSA
)
2790 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2791 && sreal_frequency () * 2 < 3)
2793 if (sreal_frequency () * PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) <= 1)
2798 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2801 nonremovable_p (cgraph_node
*node
, void *)
2803 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2806 /* Return true if whole comdat group can be removed if there are no direct
2810 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2812 struct ipa_ref
*ref
;
2814 /* For local symbols or non-comdat group it is the same as
2815 can_remove_if_no_direct_calls_p. */
2816 if (!externally_visible
|| !same_comdat_group
)
2818 if (DECL_EXTERNAL (decl
))
2822 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2825 if (will_inline
&& address_taken
)
2828 /* Otheriwse check if we can remove the symbol itself and then verify
2829 that only uses of the comdat groups are direct call to THIS
2831 if (!can_remove_if_no_direct_calls_and_refs_p ())
2834 /* Check that all refs come from within the comdat group. */
2835 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2836 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2839 struct cgraph_node
*target
= ultimate_alias_target ();
2840 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2841 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2843 if (!externally_visible
)
2846 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2849 /* If we see different symbol than THIS, be sure to check calls. */
2850 if (next
->ultimate_alias_target () != target
)
2851 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2852 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2856 /* If function is not being inlined, we care only about
2857 references outside of the comdat group. */
2859 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2860 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2866 /* Return true when function cgraph_node can be expected to be removed
2867 from program when direct calls in this compilation unit are removed.
2869 As a special case COMDAT functions are
2870 cgraph_can_remove_if_no_direct_calls_p while the are not
2871 cgraph_only_called_directly_p (it is possible they are called from other
2874 This function behaves as cgraph_only_called_directly_p because eliminating
2875 all uses of COMDAT function does not make it necessarily disappear from
2876 the program unless we are compiling whole program or we do LTO. In this
2877 case we know we win since dynamic linking will not really discard the
2878 linkonce section. */
2881 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2884 gcc_assert (!global
.inlined_to
);
2885 if (DECL_EXTERNAL (decl
))
2888 if (!in_lto_p
&& !flag_whole_program
)
2890 /* If the symbol is in comdat group, we need to verify that whole comdat
2891 group becomes unreachable. Technically we could skip references from
2892 within the group, too. */
2893 if (!only_called_directly_p ())
2895 if (same_comdat_group
&& externally_visible
)
2897 struct cgraph_node
*target
= ultimate_alias_target ();
2899 if (will_inline
&& address_taken
)
2901 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2903 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2905 if (!externally_visible
)
2908 && !next
->only_called_directly_p ())
2911 /* If we see different symbol than THIS,
2912 be sure to check calls. */
2913 if (next
->ultimate_alias_target () != target
)
2914 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2915 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2923 return can_remove_if_no_direct_calls_p (will_inline
);
2927 /* Worker for cgraph_only_called_directly_p. */
2930 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2932 return !node
->only_called_directly_or_aliased_p ();
2935 /* Return true when function cgraph_node and all its aliases are only called
2937 i.e. it is not externally visible, address was not taken and
2938 it is not used in any other non-standard way. */
2941 cgraph_node::only_called_directly_p (void)
2943 gcc_assert (ultimate_alias_target () == this);
2944 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2949 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2952 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2954 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2956 enum availability avail
;
2957 node
->ultimate_alias_target (&avail
);
2959 if (avail
> AVAIL_INTERPOSABLE
)
2960 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2961 if (!cs
->indirect_inlining_edge
2962 && !cs
->caller
->thunk
.thunk_p
)
2963 redirect_callers
->safe_push (cs
);
2967 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2968 cgraph_node (i.e. are not overwritable). */
2971 cgraph_node::collect_callers (void)
2973 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2974 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2975 &redirect_callers
, false);
2976 return redirect_callers
;
2980 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. Return
2981 optimistically true if this cannot be determined. */
2984 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2986 node
= node
->ultimate_alias_target ();
2987 node2
= node2
->ultimate_alias_target ();
2989 if (node2
->clone_of
== node
2990 || node2
->former_clone_of
== node
->decl
)
2993 if (!node
->thunk
.thunk_p
&& !node
->former_thunk_p ())
2995 while (node2
&& node
->decl
!= node2
->decl
)
2996 node2
= node2
->clone_of
;
2997 return node2
!= NULL
;
3000 /* There are no virtual clones of thunks so check former_clone_of or if we
3001 might have skipped thunks because this adjustments are no longer
3003 while (node
->thunk
.thunk_p
|| node
->former_thunk_p ())
3005 if (!node
->thunk
.this_adjusting
)
3007 /* In case of instrumented expanded thunks, which can have multiple calls
3008 in them, we do not know how to continue and just have to be
3010 if (node
->callees
->next_callee
)
3012 node
= node
->callees
->callee
->ultimate_alias_target ();
3014 if (!node2
->clone
.args_to_skip
3015 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
3017 if (node2
->former_clone_of
== node
->decl
)
3020 cgraph_node
*n2
= node2
;
3021 while (n2
&& node
->decl
!= n2
->decl
)
3030 /* Verify edge count and frequency. */
3033 cgraph_edge::verify_count ()
3035 bool error_found
= false;
3036 if (!count
.verify ())
3038 error ("caller edge count invalid");
3044 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
3046 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
3048 bool fndecl_was_null
= false;
3049 /* debug_gimple_stmt needs correct cfun */
3050 if (cfun
!= this_cfun
)
3051 set_cfun (this_cfun
);
3052 /* ...and an actual current_function_decl */
3053 if (!current_function_decl
)
3055 current_function_decl
= this_cfun
->decl
;
3056 fndecl_was_null
= true;
3058 debug_gimple_stmt (stmt
);
3059 if (fndecl_was_null
)
3060 current_function_decl
= NULL
;
3063 /* Verify that call graph edge corresponds to DECL from the associated
3064 statement. Return true if the verification should fail. */
3067 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
3071 if (!decl
|| callee
->global
.inlined_to
)
3073 if (symtab
->state
== LTO_STREAMING
)
3075 node
= cgraph_node::get (decl
);
3077 /* We do not know if a node from a different partition is an alias or what it
3078 aliases and therefore cannot do the former_clone_of check reliably. When
3079 body_removed is set, we have lost all information about what was alias or
3080 thunk of and also cannot proceed. */
3082 || node
->body_removed
3083 || node
->in_other_partition
3084 || callee
->icf_merged
3085 || callee
->in_other_partition
)
3088 node
= node
->ultimate_alias_target ();
3090 /* Optimizers can redirect unreachable calls or calls triggering undefined
3091 behavior to builtin_unreachable. */
3093 if (fndecl_built_in_p (callee
->decl
, BUILT_IN_UNREACHABLE
))
3096 if (callee
->former_clone_of
!= node
->decl
3097 && (node
!= callee
->ultimate_alias_target ())
3098 && !clone_of_p (node
, callee
))
3104 /* Disable warnings about missing quoting in GCC diagnostics for
3105 the verification errors. Their format strings don't follow GCC
3106 diagnostic conventions and the calls are ultimately followed by
3107 one to internal_error. */
3109 # pragma GCC diagnostic push
3110 # pragma GCC diagnostic ignored "-Wformat-diag"
3113 /* Verify cgraph nodes of given cgraph node. */
3115 cgraph_node::verify_node (void)
3118 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
3119 basic_block this_block
;
3120 gimple_stmt_iterator gsi
;
3121 bool error_found
= false;
3126 timevar_push (TV_CGRAPH_VERIFY
);
3127 error_found
|= verify_base ();
3128 for (e
= callees
; e
; e
= e
->next_callee
)
3131 error ("aux field set for edge %s->%s",
3132 identifier_to_locale (e
->caller
->name ()),
3133 identifier_to_locale (e
->callee
->name ()));
3136 if (!count
.verify ())
3138 error ("cgraph count invalid");
3141 if (global
.inlined_to
&& same_comdat_group
)
3143 error ("inline clone in same comdat group list");
3146 if (!definition
&& !in_other_partition
&& local
.local
)
3148 error ("local symbols must be defined");
3151 if (global
.inlined_to
&& externally_visible
)
3153 error ("externally visible inline clone");
3156 if (global
.inlined_to
&& address_taken
)
3158 error ("inline clone with address taken");
3161 if (global
.inlined_to
&& force_output
)
3163 error ("inline clone is forced to output");
3166 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3170 error ("aux field set for indirect edge from %s",
3171 identifier_to_locale (e
->caller
->name ()));
3174 if (!e
->indirect_unknown_callee
3175 || !e
->indirect_info
)
3177 error ("An indirect edge from %s is not marked as indirect or has "
3178 "associated indirect_info, the corresponding statement is: ",
3179 identifier_to_locale (e
->caller
->name ()));
3180 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3184 bool check_comdat
= comdat_local_p ();
3185 for (e
= callers
; e
; e
= e
->next_caller
)
3187 if (e
->verify_count ())
3190 && !in_same_comdat_group_p (e
->caller
))
3192 error ("comdat-local function called by %s outside its comdat",
3193 identifier_to_locale (e
->caller
->name ()));
3196 if (!e
->inline_failed
)
3198 if (global
.inlined_to
3199 != (e
->caller
->global
.inlined_to
3200 ? e
->caller
->global
.inlined_to
: e
->caller
))
3202 error ("inlined_to pointer is wrong");
3205 if (callers
->next_caller
)
3207 error ("multiple inline callers");
3212 if (global
.inlined_to
)
3214 error ("inlined_to pointer set for noninline callers");
3218 for (e
= callees
; e
; e
= e
->next_callee
)
3220 if (e
->verify_count ())
3222 if (gimple_has_body_p (e
->caller
->decl
)
3223 && !e
->caller
->global
.inlined_to
3225 /* Optimized out calls are redirected to __builtin_unreachable. */
3226 && (e
->count
.nonzero_p ()
3227 || ! e
->callee
->decl
3228 || !fndecl_built_in_p (e
->callee
->decl
, BUILT_IN_UNREACHABLE
))
3230 == ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl
))->count
3231 && (!e
->count
.ipa_p ()
3232 && e
->count
.differs_from_p (gimple_bb (e
->call_stmt
)->count
)))
3234 error ("caller edge count does not match BB count");
3235 fprintf (stderr
, "edge count: ");
3236 e
->count
.dump (stderr
);
3237 fprintf (stderr
, "\n bb count: ");
3238 gimple_bb (e
->call_stmt
)->count
.dump (stderr
);
3239 fprintf (stderr
, "\n");
3243 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3245 if (e
->verify_count ())
3247 if (gimple_has_body_p (e
->caller
->decl
)
3248 && !e
->caller
->global
.inlined_to
3250 && e
->count
.ipa_p ()
3252 == ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl
))->count
3253 && (!e
->count
.ipa_p ()
3254 && e
->count
.differs_from_p (gimple_bb (e
->call_stmt
)->count
)))
3256 error ("indirect call count does not match BB count");
3257 fprintf (stderr
, "edge count: ");
3258 e
->count
.dump (stderr
);
3259 fprintf (stderr
, "\n bb count: ");
3260 gimple_bb (e
->call_stmt
)->count
.dump (stderr
);
3261 fprintf (stderr
, "\n");
3265 if (!callers
&& global
.inlined_to
)
3267 error ("inlined_to pointer is set but no predecessors found");
3270 if (global
.inlined_to
== this)
3272 error ("inlined_to pointer refers to itself");
3278 cgraph_node
*first_clone
= clone_of
->clones
;
3279 if (first_clone
!= this)
3281 if (prev_sibling_clone
->clone_of
!= clone_of
)
3283 error ("cgraph_node has wrong clone_of");
3291 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
3292 if (n
->clone_of
!= this)
3296 error ("cgraph_node has wrong clone list");
3300 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
3302 error ("cgraph_node is in clone list but it is not clone");
3305 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
3307 error ("cgraph_node has wrong prev_clone pointer");
3310 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
3312 error ("double linked list of clones corrupted");
3316 if (analyzed
&& alias
)
3318 bool ref_found
= false;
3320 ipa_ref
*ref
= NULL
;
3324 error ("Alias has call edges");
3327 for (i
= 0; iterate_reference (i
, ref
); i
++)
3328 if (ref
->use
!= IPA_REF_ALIAS
)
3330 error ("Alias has non-alias reference");
3335 error ("Alias has more than one alias reference");
3342 error ("Analyzed alias has no reference");
3347 if (analyzed
&& thunk
.thunk_p
)
3351 error ("No edge out of thunk node");
3354 else if (callees
->next_callee
)
3356 error ("More than one edge out of thunk node");
3359 if (gimple_has_body_p (decl
) && !global
.inlined_to
)
3361 error ("Thunk is not supposed to have body");
3365 else if (analyzed
&& gimple_has_body_p (decl
)
3366 && !TREE_ASM_WRITTEN (decl
)
3367 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3372 hash_set
<gimple
*> stmts
;
3374 ipa_ref
*ref
= NULL
;
3376 /* Reach the trees by walking over the CFG, and note the
3377 enclosing basic-blocks in the call edges. */
3378 FOR_EACH_BB_FN (this_block
, this_cfun
)
3380 for (gsi
= gsi_start_phis (this_block
);
3381 !gsi_end_p (gsi
); gsi_next (&gsi
))
3382 stmts
.add (gsi_stmt (gsi
));
3383 for (gsi
= gsi_start_bb (this_block
);
3387 gimple
*stmt
= gsi_stmt (gsi
);
3389 if (is_gimple_call (stmt
))
3391 cgraph_edge
*e
= get_edge (stmt
);
3392 tree decl
= gimple_call_fndecl (stmt
);
3397 error ("shared call_stmt:");
3398 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3401 if (!e
->indirect_unknown_callee
)
3403 if (e
->verify_corresponds_to_fndecl (decl
))
3405 error ("edge points to wrong declaration:");
3406 debug_tree (e
->callee
->decl
);
3407 fprintf (stderr
," Instead of:");
3414 error ("an indirect edge with unknown callee "
3415 "corresponding to a call_stmt with "
3416 "a known declaration:");
3418 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3424 error ("missing callgraph edge for call stmt:");
3425 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3431 for (i
= 0; iterate_reference (i
, ref
); i
++)
3432 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3434 error ("reference to dead statement");
3435 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3440 /* No CFG available?! */
3443 for (e
= callees
; e
; e
= e
->next_callee
)
3447 error ("edge %s->%s has no corresponding call_stmt",
3448 identifier_to_locale (e
->caller
->name ()),
3449 identifier_to_locale (e
->callee
->name ()));
3450 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3455 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3457 if (!e
->aux
&& !e
->speculative
)
3459 error ("an indirect edge from %s has no corresponding call_stmt",
3460 identifier_to_locale (e
->caller
->name ()));
3461 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3470 internal_error ("verify_cgraph_node failed");
3472 timevar_pop (TV_CGRAPH_VERIFY
);
3475 /* Verify whole cgraph structure. */
3477 cgraph_node::verify_cgraph_nodes (void)
3484 FOR_EACH_FUNCTION (node
)
3489 # pragma GCC diagnostic pop
3492 /* Walk the alias chain to return the function cgraph_node is alias of.
3493 Walk through thunks, too.
3494 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3495 When REF is non-NULL, assume that reference happens in symbol REF
3496 when determining the availability. */
3499 cgraph_node::function_symbol (enum availability
*availability
,
3500 struct symtab_node
*ref
)
3502 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3504 while (node
->thunk
.thunk_p
)
3507 node
= node
->callees
->callee
;
3510 enum availability a
;
3511 a
= node
->get_availability (ref
);
3512 if (a
< *availability
)
3515 node
= node
->ultimate_alias_target (availability
, ref
);
3520 /* Walk the alias chain to return the function cgraph_node is alias of.
3521 Walk through non virtual thunks, too. Thus we return either a function
3522 or a virtual thunk node.
3523 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3524 When REF is non-NULL, assume that reference happens in symbol REF
3525 when determining the availability. */
3528 cgraph_node::function_or_virtual_thunk_symbol
3529 (enum availability
*availability
,
3530 struct symtab_node
*ref
)
3532 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3534 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3537 node
= node
->callees
->callee
;
3540 enum availability a
;
3541 a
= node
->get_availability (ref
);
3542 if (a
< *availability
)
3545 node
= node
->ultimate_alias_target (availability
, ref
);
3550 /* When doing LTO, read cgraph_node's body from disk if it is not already
3554 cgraph_node::get_untransformed_body (void)
3556 lto_file_decl_data
*file_data
;
3557 const char *data
, *name
;
3559 tree decl
= this->decl
;
3561 /* Check if body is already there. Either we have gimple body or
3562 the function is thunk and in that case we set DECL_ARGUMENTS. */
3563 if (DECL_ARGUMENTS (decl
) || gimple_has_body_p (decl
))
3566 gcc_assert (in_lto_p
&& !DECL_RESULT (decl
));
3568 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3570 file_data
= lto_file_data
;
3571 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3573 /* We may have renamed the declaration, e.g., a static function. */
3574 name
= lto_get_decl_name_mapping (file_data
, name
);
3575 struct lto_in_decl_state
*decl_state
3576 = lto_get_function_in_decl_state (file_data
, decl
);
3578 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3579 name
, &len
, decl_state
->compressed
);
3581 fatal_error (input_location
, "%s: section %s is missing",
3582 file_data
->file_name
,
3585 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3588 fprintf (stderr
, " in:%s", IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
3589 lto_input_function_body (file_data
, this, data
);
3590 lto_stats
.num_function_bodies
++;
3591 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3592 data
, len
, decl_state
->compressed
);
3593 lto_free_function_in_decl_state_for_node (this);
3594 /* Keep lto file data so ipa-inline-analysis knows about cross module
3597 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3602 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3603 if it is not already present. When some IPA transformations are scheduled,
3607 cgraph_node::get_body (void)
3611 updated
= get_untransformed_body ();
3613 /* Getting transformed body makes no sense for inline clones;
3614 we should never use this on real clones because they are materialized
3616 TODO: Materializing clones here will likely lead to smaller LTRANS
3618 gcc_assert (!global
.inlined_to
&& !clone_of
);
3619 if (ipa_transforms_to_apply
.exists ())
3621 opt_pass
*saved_current_pass
= current_pass
;
3622 FILE *saved_dump_file
= dump_file
;
3623 const char *saved_dump_file_name
= dump_file_name
;
3624 dump_flags_t saved_dump_flags
= dump_flags
;
3625 dump_file_name
= NULL
;
3626 set_dump_file (NULL
);
3628 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3629 execute_all_ipa_transforms (true);
3630 cgraph_edge::rebuild_edges ();
3631 free_dominance_info (CDI_DOMINATORS
);
3632 free_dominance_info (CDI_POST_DOMINATORS
);
3636 current_pass
= saved_current_pass
;
3637 set_dump_file (saved_dump_file
);
3638 dump_file_name
= saved_dump_file_name
;
3639 dump_flags
= saved_dump_flags
;
3644 /* Return the DECL_STRUCT_FUNCTION of the function. */
3647 cgraph_node::get_fun (void)
3649 cgraph_node
*node
= this;
3650 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3652 while (!fun
&& node
->clone_of
)
3654 node
= node
->clone_of
;
3655 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3661 /* Verify if the type of the argument matches that of the function
3662 declaration. If we cannot verify this or there is a mismatch,
3666 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3669 unsigned int i
, nargs
;
3671 /* Calls to internal functions always match their signature. */
3672 if (gimple_call_internal_p (stmt
))
3675 nargs
= gimple_call_num_args (stmt
);
3677 /* Get argument types for verification. */
3679 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3681 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3683 /* Verify if the type of the argument matches that of the function
3684 declaration. If we cannot verify this or there is a mismatch,
3686 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3688 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3690 i
++, p
= DECL_CHAIN (p
))
3693 /* We cannot distinguish a varargs function from the case
3694 of excess parameters, still deferring the inlining decision
3695 to the callee is possible. */
3698 arg
= gimple_call_arg (stmt
, i
);
3699 if (p
== error_mark_node
3700 || DECL_ARG_TYPE (p
) == error_mark_node
3701 || arg
== error_mark_node
3702 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3703 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3706 if (args_count_match
&& p
)
3711 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3714 /* If this is a varargs function defer inlining decision
3718 arg
= gimple_call_arg (stmt
, i
);
3719 if (TREE_VALUE (p
) == error_mark_node
3720 || arg
== error_mark_node
3721 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3722 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3723 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3735 /* Verify if the type of the argument and lhs of CALL_STMT matches
3736 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3737 true, the arg count needs to be the same.
3738 If we cannot verify this or there is a mismatch, return false. */
3741 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3742 bool args_count_match
)
3746 if ((DECL_RESULT (callee
)
3747 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3748 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3749 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3751 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3752 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3757 /* Reset all state within cgraph.c so that we can rerun the compiler
3758 within the same process. For use by toplev::finalize. */
3761 cgraph_c_finalize (void)
3765 x_cgraph_nodes_queue
= NULL
;
3767 cgraph_fnver_htab
= NULL
;
3768 version_info_node
= NULL
;
3771 /* A wroker for call_for_symbol_and_aliases. */
3774 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3777 bool include_overwritable
)
3780 FOR_EACH_ALIAS (this, ref
)
3782 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3783 if (include_overwritable
3784 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3785 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3786 include_overwritable
))
3792 /* Return true if NODE has thunk. */
3795 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3797 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3798 if (e
->caller
->thunk
.thunk_p
)
3803 /* Expected frequency of executions within the function. */
3806 cgraph_edge::sreal_frequency ()
3808 return count
.to_sreal_scale (caller
->global
.inlined_to
3809 ? caller
->global
.inlined_to
->count
3814 /* During LTO stream in this can be used to check whether call can possibly
3815 be internal to the current translation unit. */
3818 cgraph_edge::possibly_call_in_translation_unit_p (void)
3820 gcc_checking_assert (in_lto_p
&& caller
->prevailing_p ());
3822 /* While incremental linking we may end up getting function body later. */
3823 if (flag_incremental_link
== INCREMENTAL_LINK_LTO
)
3826 /* We may be smarter here and avoid stremaing in indirect calls we can't
3827 track, but that would require arranging stremaing the indirect call
3832 /* If calle is local to the original translation unit, it will be defined. */
3833 if (!TREE_PUBLIC (callee
->decl
) && !DECL_EXTERNAL (callee
->decl
))
3836 /* Otherwise we need to lookup prevailing symbol (symbol table is not merged,
3837 yet) and see if it is a definition. In fact we may also resolve aliases,
3838 but that is probably not too important. */
3839 symtab_node
*node
= callee
;
3840 for (int n
= 10; node
->previous_sharing_asm_name
&& n
; n
--)
3841 node
= node
->previous_sharing_asm_name
;
3842 if (node
->previous_sharing_asm_name
)
3843 node
= symtab_node::get_for_asmname (DECL_ASSEMBLER_NAME (callee
->decl
));
3844 gcc_assert (TREE_PUBLIC (node
->decl
));
3845 return node
->get_availability () >= AVAIL_AVAILABLE
;
3848 /* A stashed copy of "symtab" for use by selftest::symbol_table_test.
3849 This needs to be a global so that it can be a GC root, and thus
3850 prevent the stashed copy from being garbage-collected if the GC runs
3851 during a symbol_table_test. */
3853 symbol_table
*saved_symtab
;
3857 namespace selftest
{
3859 /* class selftest::symbol_table_test. */
3861 /* Constructor. Store the old value of symtab, and create a new one. */
3863 symbol_table_test::symbol_table_test ()
3865 gcc_assert (saved_symtab
== NULL
);
3866 saved_symtab
= symtab
;
3867 symtab
= new (ggc_cleared_alloc
<symbol_table
> ()) symbol_table ();
3870 /* Destructor. Restore the old value of symtab. */
3872 symbol_table_test::~symbol_table_test ()
3874 gcc_assert (saved_symtab
!= NULL
);
3875 symtab
= saved_symtab
;
3876 saved_symtab
= NULL
;
3879 /* Verify that symbol_table_test works. */
3882 test_symbol_table_test ()
3884 /* Simulate running two selftests involving symbol tables. */
3885 for (int i
= 0; i
< 2; i
++)
3887 symbol_table_test stt
;
3888 tree test_decl
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
,
3889 get_identifier ("test_decl"),
3890 build_function_type_list (void_type_node
,
3892 cgraph_node
*node
= cgraph_node::get_create (test_decl
);
3895 /* Verify that the node has order 0 on both iterations,
3896 and thus that nodes have predictable dump names in selftests. */
3897 ASSERT_EQ (node
->order
, 0);
3898 ASSERT_STREQ (node
->dump_name (), "test_decl/0");
3902 /* Run all of the selftests within this file. */
3907 test_symbol_table_test ();
3910 } // namespace selftest
3912 #endif /* CHECKING_P */
3914 #include "gt-cgraph.h"