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
));
852 free_edges
= NEXT_FREE_EDGE (edge
);
855 edge
= ggc_alloc
<cgraph_edge
> ();
859 gcc_assert (++edges_max_uid
!= 0);
860 edge
->m_uid
= edges_max_uid
;
862 edge
->caller
= caller
;
863 edge
->callee
= callee
;
864 edge
->prev_caller
= NULL
;
865 edge
->next_caller
= NULL
;
866 edge
->prev_callee
= NULL
;
867 edge
->next_callee
= NULL
;
868 edge
->lto_stmt_uid
= 0;
872 edge
->call_stmt
= call_stmt
;
873 edge
->can_throw_external
874 = call_stmt
? stmt_can_throw_external (DECL_STRUCT_FUNCTION (caller
->decl
),
877 && callee
&& callee
->decl
878 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
881 edge
->inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
882 edge
->call_stmt_cannot_inline_p
= true;
886 edge
->inline_failed
= CIF_FUNCTION_NOT_CONSIDERED
;
887 edge
->call_stmt_cannot_inline_p
= false;
890 edge
->indirect_info
= NULL
;
891 edge
->indirect_inlining_edge
= 0;
892 edge
->speculative
= false;
893 edge
->indirect_unknown_callee
= indir_unknown_callee
;
894 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
895 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
896 edge
->in_polymorphic_cdtor
897 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
900 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
901 if (call_stmt
&& caller
->call_site_hash
)
902 cgraph_add_edge_to_call_site_hash (edge
);
907 /* Create edge from a given function to CALLEE in the cgraph. */
910 cgraph_node::create_edge (cgraph_node
*callee
,
911 gcall
*call_stmt
, profile_count count
)
913 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
916 initialize_inline_failed (edge
);
918 edge
->next_caller
= callee
->callers
;
920 callee
->callers
->prev_caller
= edge
;
921 edge
->next_callee
= callees
;
923 callees
->prev_callee
= edge
;
925 callee
->callers
= edge
;
930 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
932 cgraph_indirect_call_info
*
933 cgraph_allocate_init_indirect_info (void)
935 cgraph_indirect_call_info
*ii
;
937 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
938 ii
->param_index
= -1;
942 /* Create an indirect edge with a yet-undetermined callee where the call
943 statement destination is a formal parameter of the caller with index
947 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
949 bool compute_indirect_info
)
951 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
955 initialize_inline_failed (edge
);
957 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
958 edge
->indirect_info
->ecf_flags
= ecf_flags
;
959 edge
->indirect_info
->vptr_changed
= true;
961 /* Record polymorphic call info. */
962 if (compute_indirect_info
964 && (target
= gimple_call_fn (call_stmt
))
965 && virtual_method_call_p (target
))
967 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
969 /* Only record types can have virtual calls. */
970 edge
->indirect_info
->polymorphic
= true;
971 edge
->indirect_info
->param_index
= -1;
972 edge
->indirect_info
->otr_token
973 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
974 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
975 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
976 edge
->indirect_info
->context
= context
;
979 edge
->next_callee
= indirect_calls
;
981 indirect_calls
->prev_callee
= edge
;
982 indirect_calls
= edge
;
987 /* Remove the edge from the list of the callees of the caller. */
990 cgraph_edge::remove_caller (void)
993 prev_callee
->next_callee
= next_callee
;
995 next_callee
->prev_callee
= prev_callee
;
998 if (indirect_unknown_callee
)
999 caller
->indirect_calls
= next_callee
;
1001 caller
->callees
= next_callee
;
1003 if (caller
->call_site_hash
)
1004 caller
->call_site_hash
->remove_elt_with_hash
1005 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
1008 /* Put the edge onto the free list. */
1011 symbol_table::free_edge (cgraph_edge
*e
)
1013 if (e
->indirect_info
)
1014 ggc_free (e
->indirect_info
);
1016 /* Clear out the edge so we do not dangle pointers. */
1017 memset (e
, 0, sizeof (*e
));
1018 NEXT_FREE_EDGE (e
) = free_edges
;
1023 /* Remove the edge in the cgraph. */
1026 cgraph_edge::remove (void)
1028 /* Call all edge removal hooks. */
1029 symtab
->call_edge_removal_hooks (this);
1031 if (!indirect_unknown_callee
)
1032 /* Remove from callers list of the callee. */
1035 /* Remove from callees list of the callers. */
1038 /* Put the edge onto the free list. */
1039 symtab
->free_edge (this);
1042 /* Turn edge into speculative call calling N2. Update
1043 the profile so the direct call is taken COUNT times
1046 At clone materialization time, the indirect call E will
1049 if (call_dest == N2)
1054 At this time the function just creates the direct call,
1055 the referencd representing the if conditional and attaches
1056 them all to the orginal indirect call statement.
1058 Return direct edge created. */
1061 cgraph_edge::make_speculative (cgraph_node
*n2
, profile_count direct_count
)
1063 cgraph_node
*n
= caller
;
1064 ipa_ref
*ref
= NULL
;
1068 fprintf (dump_file
, "Indirect call -> speculative call %s => %s\n",
1069 n
->dump_name (), n2
->dump_name ());
1071 e2
= n
->create_edge (n2
, call_stmt
, direct_count
);
1072 initialize_inline_failed (e2
);
1073 e2
->speculative
= true;
1074 if (TREE_NOTHROW (n2
->decl
))
1075 e2
->can_throw_external
= false;
1077 e2
->can_throw_external
= can_throw_external
;
1078 e2
->lto_stmt_uid
= lto_stmt_uid
;
1079 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1081 symtab
->call_edge_duplication_hooks (this, e2
);
1082 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1083 ref
->lto_stmt_uid
= lto_stmt_uid
;
1084 ref
->speculative
= speculative
;
1085 n2
->mark_address_taken ();
1089 /* Speculative call consist of three components:
1090 1) an indirect edge representing the original call
1091 2) an direct edge representing the new call
1092 3) ADDR_EXPR reference representing the speculative check.
1093 All three components are attached to single statement (the indirect
1094 call) and if one of them exists, all of them must exist.
1096 Given speculative call edge, return all three components.
1100 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1101 cgraph_edge
*&indirect
,
1102 ipa_ref
*&reference
)
1107 cgraph_edge
*e
= this;
1109 if (!e
->indirect_unknown_callee
)
1110 for (e2
= e
->caller
->indirect_calls
;
1111 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1112 e2
= e2
->next_callee
)
1117 /* We can take advantage of the call stmt hash. */
1120 e
= e
->caller
->get_edge (e2
->call_stmt
);
1121 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1124 for (e
= e
->caller
->callees
;
1125 e2
->call_stmt
!= e
->call_stmt
1126 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1130 gcc_assert (e
->speculative
&& e2
->speculative
);
1135 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1136 if (ref
->speculative
1137 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1138 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1144 /* Speculative edge always consist of all three components - direct edge,
1145 indirect and reference. */
1147 gcc_assert (e
&& e2
&& ref
);
1150 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1151 Remove the speculative call sequence and return edge representing the call.
1152 It is up to caller to redirect the call as appropriate. */
1155 cgraph_edge::resolve_speculation (tree callee_decl
)
1157 cgraph_edge
*edge
= this;
1161 gcc_assert (edge
->speculative
);
1162 edge
->speculative_call_info (e2
, edge
, ref
);
1164 || !ref
->referred
->semantically_equivalent_p
1165 (symtab_node::get (callee_decl
)))
1171 fprintf (dump_file
, "Speculative indirect call %s => %s has "
1172 "turned out to have contradicting known target ",
1173 edge
->caller
->dump_name (),
1174 e2
->callee
->dump_name ());
1175 print_generic_expr (dump_file
, callee_decl
);
1176 fprintf (dump_file
, "\n");
1180 fprintf (dump_file
, "Removing speculative call %s => %s\n",
1181 edge
->caller
->dump_name (),
1182 e2
->callee
->dump_name ());
1188 cgraph_edge
*tmp
= edge
;
1190 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1193 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1194 in the functions inlined through it. */
1196 edge
->count
+= e2
->count
;
1197 edge
->speculative
= false;
1198 e2
->speculative
= false;
1199 ref
->remove_reference ();
1200 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1203 e2
->callee
->remove_symbol_and_inline_clones ();
1204 if (edge
->caller
->call_site_hash
)
1205 cgraph_update_edge_in_call_site_hash (edge
);
1209 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1210 CALLEE. DELTA is an integer constant that is to be added to the this
1211 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1214 cgraph_edge::make_direct (cgraph_node
*callee
)
1216 cgraph_edge
*edge
= this;
1217 gcc_assert (indirect_unknown_callee
);
1219 /* If we are redirecting speculative call, make it non-speculative. */
1220 if (indirect_unknown_callee
&& speculative
)
1222 edge
= edge
->resolve_speculation (callee
->decl
);
1224 /* On successful speculation just return the pre existing direct edge. */
1225 if (!indirect_unknown_callee
)
1229 indirect_unknown_callee
= 0;
1230 ggc_free (indirect_info
);
1231 indirect_info
= NULL
;
1233 /* Get the edge out of the indirect edge list. */
1235 prev_callee
->next_callee
= next_callee
;
1237 next_callee
->prev_callee
= prev_callee
;
1239 caller
->indirect_calls
= next_callee
;
1241 /* Put it into the normal callee list */
1243 next_callee
= caller
->callees
;
1244 if (caller
->callees
)
1245 caller
->callees
->prev_callee
= edge
;
1246 caller
->callees
= edge
;
1248 /* Insert to callers list of the new callee. */
1249 edge
->set_callee (callee
);
1252 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
, false))
1254 call_stmt_cannot_inline_p
= true;
1255 inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
1258 /* We need to re-determine the inlining status of the edge. */
1259 initialize_inline_failed (edge
);
1263 /* If necessary, change the function declaration in the call statement
1264 associated with E so that it corresponds to the edge callee. */
1267 cgraph_edge::redirect_call_stmt_to_callee (void)
1269 cgraph_edge
*e
= this;
1271 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1273 gimple_stmt_iterator gsi
;
1281 e
->speculative_call_info (e
, e2
, ref
);
1282 /* If there already is an direct call (i.e. as a result of inliner's
1283 substitution), forget about speculating. */
1285 e
= e
->resolve_speculation (decl
);
1286 /* If types do not match, speculation was likely wrong.
1287 The direct edge was possibly redirected to the clone with a different
1288 signature. We did not update the call statement yet, so compare it
1289 with the reference that still points to the proper type. */
1290 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1291 ref
->referred
->decl
,
1295 fprintf (dump_file
, "Not expanding speculative call of %s -> %s\n"
1297 e
->caller
->dump_name (),
1298 e
->callee
->dump_name ());
1299 e
= e
->resolve_speculation ();
1300 /* We are producing the final function body and will throw away the
1301 callgraph edges really soon. Reset the counts/frequencies to
1302 keep verifier happy in the case of roundoff errors. */
1303 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1305 /* Expand speculation into GIMPLE code. */
1311 "Expanding speculative call of %s -> %s count: ",
1312 e
->caller
->dump_name (),
1313 e
->callee
->dump_name ());
1314 e
->count
.dump (dump_file
);
1315 fprintf (dump_file
, "\n");
1317 gcc_assert (e2
->speculative
);
1318 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1320 profile_probability prob
= e
->count
.probability_in (e
->count
1322 if (!prob
.initialized_p ())
1323 prob
= profile_probability::even ();
1324 new_stmt
= gimple_ic (e
->call_stmt
,
1325 dyn_cast
<cgraph_node
*> (ref
->referred
),
1327 e
->speculative
= false;
1328 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1330 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1331 e2
->speculative
= false;
1332 e2
->count
= gimple_bb (e2
->call_stmt
)->count
;
1333 ref
->speculative
= false;
1335 /* Indirect edges are not both in the call site hash.
1337 if (e
->caller
->call_site_hash
)
1338 cgraph_update_edge_in_call_site_hash (e2
);
1340 /* Continue redirecting E to proper target. */
1345 if (e
->indirect_unknown_callee
1346 || decl
== e
->callee
->decl
)
1347 return e
->call_stmt
;
1349 if (flag_checking
&& decl
)
1351 cgraph_node
*node
= cgraph_node::get (decl
);
1352 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1355 if (symtab
->dump_file
)
1357 fprintf (symtab
->dump_file
, "updating call of %s -> %s: ",
1358 e
->caller
->dump_name (), e
->callee
->dump_name ());
1359 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1360 if (e
->callee
->clone
.combined_args_to_skip
)
1362 fprintf (symtab
->dump_file
, " combined args to skip: ");
1363 dump_bitmap (symtab
->dump_file
,
1364 e
->callee
->clone
.combined_args_to_skip
);
1368 if (e
->callee
->clone
.combined_args_to_skip
)
1372 new_stmt
= e
->call_stmt
;
1373 if (e
->callee
->clone
.combined_args_to_skip
)
1375 = gimple_call_copy_skip_args (new_stmt
,
1376 e
->callee
->clone
.combined_args_to_skip
);
1377 tree old_fntype
= gimple_call_fntype (e
->call_stmt
);
1378 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1379 cgraph_node
*origin
= e
->callee
;
1380 while (origin
->clone_of
)
1381 origin
= origin
->clone_of
;
1383 if ((origin
->former_clone_of
1384 && old_fntype
== TREE_TYPE (origin
->former_clone_of
))
1385 || old_fntype
== TREE_TYPE (origin
->decl
))
1386 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1389 bitmap skip
= e
->callee
->clone
.combined_args_to_skip
;
1390 tree t
= cgraph_build_function_type_skip_args (old_fntype
, skip
,
1392 gimple_call_set_fntype (new_stmt
, t
);
1395 if (gimple_vdef (new_stmt
)
1396 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1397 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1399 gsi
= gsi_for_stmt (e
->call_stmt
);
1401 /* For optimized away parameters, add on the caller side
1403 DEBUG D#X => parm_Y(D)
1404 stmts and associate D#X with parm in decl_debug_args_lookup
1405 vector to say for debug info that if parameter parm had been passed,
1406 it would have value parm_Y(D). */
1407 if (e
->callee
->clone
.combined_args_to_skip
&& MAY_HAVE_DEBUG_BIND_STMTS
)
1409 vec
<tree
, va_gc
> **debug_args
1410 = decl_debug_args_lookup (e
->callee
->decl
);
1411 tree old_decl
= gimple_call_fndecl (e
->call_stmt
);
1412 if (debug_args
&& old_decl
)
1415 unsigned i
= 0, num
;
1416 unsigned len
= vec_safe_length (*debug_args
);
1417 unsigned nargs
= gimple_call_num_args (e
->call_stmt
);
1418 for (parm
= DECL_ARGUMENTS (old_decl
), num
= 0;
1419 parm
&& num
< nargs
;
1420 parm
= DECL_CHAIN (parm
), num
++)
1421 if (bitmap_bit_p (e
->callee
->clone
.combined_args_to_skip
, num
)
1422 && is_gimple_reg (parm
))
1426 while (i
< len
&& (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1432 && (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1437 tree ddecl
= (**debug_args
)[i
+ 1];
1438 tree arg
= gimple_call_arg (e
->call_stmt
, num
);
1439 if (!useless_type_conversion_p (TREE_TYPE (ddecl
),
1443 if (!fold_convertible_p (TREE_TYPE (ddecl
), arg
))
1445 if (TREE_CODE (arg
) == SSA_NAME
1446 && gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg
))
1448 = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (arg
)))
1449 && useless_type_conversion_p (TREE_TYPE (ddecl
),
1453 arg
= fold_convert (TREE_TYPE (ddecl
), arg
);
1457 = gimple_build_debug_bind (ddecl
, unshare_expr (arg
),
1459 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
1464 gsi_replace (&gsi
, new_stmt
, false);
1465 /* We need to defer cleaning EH info on the new statement to
1466 fixup-cfg. We may not have dominator information at this point
1467 and thus would end up with unreachable blocks and have no way
1468 to communicate that we need to run CFG cleanup then. */
1469 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1472 remove_stmt_from_eh_lp (e
->call_stmt
);
1473 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1478 new_stmt
= e
->call_stmt
;
1479 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1480 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1483 /* If changing the call to __cxa_pure_virtual or similar noreturn function,
1484 adjust gimple_call_fntype too. */
1485 if (gimple_call_noreturn_p (new_stmt
)
1486 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e
->callee
->decl
)))
1487 && TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
))
1488 && (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
)))
1490 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1492 /* If the call becomes noreturn, remove the LHS if possible. */
1493 tree lhs
= gimple_call_lhs (new_stmt
);
1495 && gimple_call_noreturn_p (new_stmt
)
1496 && (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt
)))
1497 || should_remove_lhs_p (lhs
)))
1499 if (TREE_CODE (lhs
) == SSA_NAME
)
1501 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1502 TREE_TYPE (lhs
), NULL
);
1503 var
= get_or_create_ssa_default_def
1504 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1505 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1506 gsi
= gsi_for_stmt (new_stmt
);
1507 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1508 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1510 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1511 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1514 /* If new callee has no static chain, remove it. */
1515 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1517 gimple_call_set_chain (new_stmt
, NULL
);
1518 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1521 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1524 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1526 if (symtab
->dump_file
)
1528 fprintf (symtab
->dump_file
, " updated to:");
1529 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1534 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1535 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1536 of OLD_STMT if it was previously call statement.
1537 If NEW_STMT is NULL, the call has been dropped without any
1541 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1542 gimple
*old_stmt
, tree old_call
,
1545 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1546 ? gimple_call_fndecl (new_stmt
) : 0;
1548 /* We are seeing indirect calls, then there is nothing to update. */
1549 if (!new_call
&& !old_call
)
1551 /* See if we turned indirect call into direct call or folded call to one builtin
1552 into different builtin. */
1553 if (old_call
!= new_call
)
1555 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1556 cgraph_edge
*ne
= NULL
;
1557 profile_count count
;
1561 /* Keep calls marked as dead dead. */
1562 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1563 && fndecl_built_in_p (e
->callee
->decl
, BUILT_IN_UNREACHABLE
))
1565 node
->get_edge (old_stmt
)->set_call_stmt
1566 (as_a
<gcall
*> (new_stmt
));
1569 /* See if the edge is already there and has the correct callee. It
1570 might be so because of indirect inlining has already updated
1571 it. We also might've cloned and redirected the edge. */
1572 if (new_call
&& e
->callee
)
1574 cgraph_node
*callee
= e
->callee
;
1577 if (callee
->decl
== new_call
1578 || callee
->former_clone_of
== new_call
)
1580 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1583 callee
= callee
->clone_of
;
1587 /* Otherwise remove edge and create new one; we can't simply redirect
1588 since function has changed, so inline plan and other information
1589 attached to edge is invalid. */
1591 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1594 e
->callee
->remove_symbol_and_inline_clones ();
1598 /* We are seeing new direct call; compute profile info based on BB. */
1599 basic_block bb
= gimple_bb (new_stmt
);
1605 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1606 as_a
<gcall
*> (new_stmt
), count
);
1607 gcc_assert (ne
->inline_failed
);
1610 /* We only updated the call stmt; update pointer in cgraph edge.. */
1611 else if (old_stmt
!= new_stmt
)
1612 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1615 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1616 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1617 of OLD_STMT before it was updated (updating can happen inplace). */
1620 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1623 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1626 gcc_checking_assert (orig
);
1627 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1629 for (node
= orig
->clones
; node
!= orig
;)
1631 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1633 node
= node
->clones
;
1634 else if (node
->next_sibling_clone
)
1635 node
= node
->next_sibling_clone
;
1638 while (node
!= orig
&& !node
->next_sibling_clone
)
1639 node
= node
->clone_of
;
1641 node
= node
->next_sibling_clone
;
1647 /* Remove all callees from the node. */
1650 cgraph_node::remove_callees (void)
1654 /* It is sufficient to remove the edges from the lists of callers of
1655 the callees. The callee list of the node can be zapped with one
1657 for (e
= callees
; e
; e
= f
)
1660 symtab
->call_edge_removal_hooks (e
);
1661 if (!e
->indirect_unknown_callee
)
1662 e
->remove_callee ();
1663 symtab
->free_edge (e
);
1665 for (e
= indirect_calls
; e
; e
= f
)
1668 symtab
->call_edge_removal_hooks (e
);
1669 if (!e
->indirect_unknown_callee
)
1670 e
->remove_callee ();
1671 symtab
->free_edge (e
);
1673 indirect_calls
= NULL
;
1677 call_site_hash
->empty ();
1678 call_site_hash
= NULL
;
1682 /* Remove all callers from the node. */
1685 cgraph_node::remove_callers (void)
1689 /* It is sufficient to remove the edges from the lists of callees of
1690 the callers. The caller list of the node can be zapped with one
1692 for (e
= callers
; e
; e
= f
)
1695 symtab
->call_edge_removal_hooks (e
);
1696 e
->remove_caller ();
1697 symtab
->free_edge (e
);
1702 /* Helper function for cgraph_release_function_body and free_lang_data.
1703 It releases body from function DECL without having to inspect its
1704 possibly non-existent symtab node. */
1707 release_function_body (tree decl
)
1709 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1713 && loops_for_fn (fn
))
1715 fn
->curr_properties
&= ~PROP_loops
;
1716 loop_optimizer_finalize (fn
);
1720 delete_tree_ssa (fn
);
1725 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1726 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1727 delete_tree_cfg_annotations (fn
);
1731 if (fn
->value_histograms
)
1732 free_histograms (fn
);
1733 gimple_set_body (decl
, NULL
);
1734 /* Struct function hangs a lot of data that would leak if we didn't
1735 removed all pointers to it. */
1737 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1739 DECL_SAVED_TREE (decl
) = NULL
;
1742 /* Release memory used to represent body of function.
1743 Use this only for functions that are released before being translated to
1744 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1745 are free'd in final.c via free_after_compilation().
1746 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1749 cgraph_node::release_body (bool keep_arguments
)
1751 ipa_transforms_to_apply
.release ();
1752 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1754 DECL_RESULT (decl
) = NULL
;
1756 if (!keep_arguments
)
1757 DECL_ARGUMENTS (decl
) = NULL
;
1759 /* If the node is abstract and needed, then do not clear
1760 DECL_INITIAL of its associated function declaration because it's
1761 needed to emit debug info later. */
1762 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1763 DECL_INITIAL (decl
) = error_mark_node
;
1764 release_function_body (decl
);
1767 lto_free_function_in_decl_state_for_node (this);
1768 lto_file_data
= NULL
;
1772 /* Remove function from symbol table. */
1775 cgraph_node::remove (void)
1779 if (symtab
->ipa_clones_dump_file
&& symtab
->cloned_nodes
.contains (this))
1780 fprintf (symtab
->ipa_clones_dump_file
,
1781 "Callgraph removal;%s;%d;%s;%d;%d\n", asm_name (), order
,
1782 DECL_SOURCE_FILE (decl
), DECL_SOURCE_LINE (decl
),
1783 DECL_SOURCE_COLUMN (decl
));
1785 symtab
->call_cgraph_removal_hooks (this);
1788 ipa_transforms_to_apply
.release ();
1789 delete_function_version (function_version ());
1791 /* Incremental inlining access removed nodes stored in the postorder list.
1793 force_output
= false;
1794 forced_by_abi
= false;
1795 for (n
= nested
; n
; n
= n
->next_nested
)
1800 cgraph_node
**node2
= &origin
->nested
;
1802 while (*node2
!= this)
1803 node2
= &(*node2
)->next_nested
;
1804 *node2
= next_nested
;
1807 if (prev_sibling_clone
)
1808 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1810 clone_of
->clones
= next_sibling_clone
;
1811 if (next_sibling_clone
)
1812 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1815 cgraph_node
*n
, *next
;
1819 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1820 n
->clone_of
= clone_of
;
1821 n
->clone_of
= clone_of
;
1822 n
->next_sibling_clone
= clone_of
->clones
;
1823 if (clone_of
->clones
)
1824 clone_of
->clones
->prev_sibling_clone
= n
;
1825 clone_of
->clones
= clones
;
1829 /* We are removing node with clones. This makes clones inconsistent,
1830 but assume they will be removed subsequently and just keep clone
1831 tree intact. This can happen in unreachable function removal since
1832 we remove unreachable functions in random order, not by bottom-up
1833 walk of clone trees. */
1834 for (n
= clones
; n
; n
= next
)
1836 next
= n
->next_sibling_clone
;
1837 n
->next_sibling_clone
= NULL
;
1838 n
->prev_sibling_clone
= NULL
;
1844 /* While all the clones are removed after being proceeded, the function
1845 itself is kept in the cgraph even after it is compiled. Check whether
1846 we are done with this body and reclaim it proactively if this is the case.
1848 if (symtab
->state
!= LTO_STREAMING
)
1850 n
= cgraph_node::get (decl
);
1852 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1853 && ((symtab
->global_info_ready
|| in_lto_p
)
1854 && (TREE_ASM_WRITTEN (n
->decl
)
1855 || DECL_EXTERNAL (n
->decl
)
1857 || (!flag_wpa
&& n
->in_other_partition
)))))
1862 lto_free_function_in_decl_state_for_node (this);
1863 lto_file_data
= NULL
;
1869 call_site_hash
->empty ();
1870 call_site_hash
= NULL
;
1873 symtab
->release_symbol (this);
1876 /* Likewise indicate that a node is having address taken. */
1879 cgraph_node::mark_address_taken (void)
1881 /* Indirect inlining can figure out that all uses of the address are
1883 if (global
.inlined_to
)
1885 gcc_assert (cfun
->after_inlining
);
1886 gcc_assert (callers
->indirect_inlining_edge
);
1889 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1890 IPA_REF_ADDR reference exists (and thus it should be set on node
1891 representing alias we take address of) and as a test whether address
1892 of the object was taken (and thus it should be set on node alias is
1893 referring to). We should remove the first use and the remove the
1896 cgraph_node
*node
= ultimate_alias_target ();
1897 node
->address_taken
= 1;
1900 /* Return local info for the compiled function. */
1903 cgraph_node::local_info (tree decl
)
1905 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1906 cgraph_node
*node
= get (decl
);
1909 return &node
->ultimate_alias_target ()->local
;
1912 /* Return local info for the compiled function. */
1915 cgraph_node::rtl_info (tree decl
)
1917 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1918 cgraph_node
*node
= get (decl
);
1921 enum availability avail
;
1922 node
= node
->ultimate_alias_target (&avail
);
1923 if (decl
!= current_function_decl
1924 && (avail
< AVAIL_AVAILABLE
1925 || (node
->decl
!= current_function_decl
1926 && !TREE_ASM_WRITTEN (node
->decl
))))
1928 /* Allocate if it doesn't exist. */
1929 if (node
->rtl
== NULL
)
1930 node
->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1934 /* Return a string describing the failure REASON. */
1937 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1940 #define DEFCIFCODE(code, type, string) string,
1942 static const char *cif_string_table
[CIF_N_REASONS
] = {
1943 #include "cif-code.def"
1946 /* Signedness of an enum type is implementation defined, so cast it
1947 to unsigned before testing. */
1948 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1949 return cif_string_table
[reason
];
1952 /* Return a type describing the failure REASON. */
1954 cgraph_inline_failed_type_t
1955 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1958 #define DEFCIFCODE(code, type, string) type,
1960 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1961 #include "cif-code.def"
1964 /* Signedness of an enum type is implementation defined, so cast it
1965 to unsigned before testing. */
1966 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1967 return cif_type_table
[reason
];
1970 /* Names used to print out the availability enum. */
1971 const char * const cgraph_availability_names
[] =
1972 {"unset", "not_available", "overwritable", "available", "local"};
1974 /* Output flags of edge to a file F. */
1977 cgraph_edge::dump_edge_flags (FILE *f
)
1980 fprintf (f
, "(speculative) ");
1982 fprintf (f
, "(inlined) ");
1983 if (call_stmt_cannot_inline_p
)
1984 fprintf (f
, "(call_stmt_cannot_inline_p) ");
1985 if (indirect_inlining_edge
)
1986 fprintf (f
, "(indirect_inlining) ");
1987 if (count
.initialized_p ())
1992 fprintf (f
, "%.2f per call) ", sreal_frequency ().to_double ());
1994 if (can_throw_external
)
1995 fprintf (f
, "(can throw external) ");
1998 /* Dump call graph node to file F. */
2001 cgraph_node::dump (FILE *f
)
2007 if (global
.inlined_to
)
2008 fprintf (f
, " Function %s is inline copy in %s\n",
2010 global
.inlined_to
->dump_name ());
2012 fprintf (f
, " Clone of %s\n", clone_of
->dump_asm_name ());
2013 if (symtab
->function_flags_ready
)
2014 fprintf (f
, " Availability: %s\n",
2015 cgraph_availability_names
[get_availability ()]);
2018 fprintf (f
, " Profile id: %i\n",
2020 cgraph_function_version_info
*vi
= function_version ();
2023 fprintf (f
, " Version info: ");
2024 if (vi
->prev
!= NULL
)
2026 fprintf (f
, "prev: ");
2027 fprintf (f
, "%s ", vi
->prev
->this_node
->dump_asm_name ());
2029 if (vi
->next
!= NULL
)
2031 fprintf (f
, "next: ");
2032 fprintf (f
, "%s ", vi
->next
->this_node
->dump_asm_name ());
2034 if (vi
->dispatcher_resolver
!= NULL_TREE
)
2035 fprintf (f
, "dispatcher: %s",
2036 lang_hooks
.decl_printable_name (vi
->dispatcher_resolver
, 2));
2040 fprintf (f
, " Function flags:");
2041 if (count
.initialized_p ())
2043 fprintf (f
, " count:");
2046 if (tp_first_run
> 0)
2047 fprintf (f
, " first_run:%i", tp_first_run
);
2049 fprintf (f
, " nested in:%s", origin
->asm_name ());
2050 if (gimple_has_body_p (decl
))
2051 fprintf (f
, " body");
2053 fprintf (f
, " process");
2055 fprintf (f
, " local");
2056 if (local
.redefined_extern_inline
)
2057 fprintf (f
, " redefined_extern_inline");
2058 if (only_called_at_startup
)
2059 fprintf (f
, " only_called_at_startup");
2060 if (only_called_at_exit
)
2061 fprintf (f
, " only_called_at_exit");
2063 fprintf (f
, " tm_clone");
2064 if (calls_comdat_local
)
2065 fprintf (f
, " calls_comdat_local");
2067 fprintf (f
, " icf_merged");
2069 fprintf (f
, " merged_comdat");
2071 fprintf (f
, " split_part");
2072 if (indirect_call_target
)
2073 fprintf (f
, " indirect_call_target");
2075 fprintf (f
, " nonfreeing_fn");
2076 if (DECL_STATIC_CONSTRUCTOR (decl
))
2077 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2078 if (DECL_STATIC_DESTRUCTOR (decl
))
2079 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2080 if (frequency
== NODE_FREQUENCY_HOT
)
2081 fprintf (f
, " hot");
2082 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2083 fprintf (f
, " unlikely_executed");
2084 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2085 fprintf (f
, " executed_once");
2086 if (opt_for_fn (decl
, optimize_size
))
2087 fprintf (f
, " optimize_size");
2088 if (parallelized_function
)
2089 fprintf (f
, " parallelized_function");
2095 fprintf (f
, " Thunk");
2097 fprintf (f
, " of %s (asm:%s)",
2098 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2099 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2100 fprintf (f
, " fixed offset %i virtual value %i indirect_offset %i "
2101 "has virtual offset %i\n",
2102 (int)thunk
.fixed_offset
,
2103 (int)thunk
.virtual_value
,
2104 (int)thunk
.indirect_offset
,
2105 (int)thunk
.virtual_offset_p
);
2107 if (alias
&& thunk
.alias
2108 && DECL_P (thunk
.alias
))
2110 fprintf (f
, " Alias of %s",
2111 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2112 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2113 fprintf (f
, " (asm:%s)",
2114 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2118 fprintf (f
, " Called by: ");
2120 profile_count sum
= profile_count::zero ();
2121 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2123 fprintf (f
, "%s ", edge
->caller
->dump_name ());
2124 edge
->dump_edge_flags (f
);
2125 if (edge
->count
.initialized_p ())
2126 sum
+= edge
->count
.ipa ();
2129 fprintf (f
, "\n Calls: ");
2130 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2132 fprintf (f
, "%s ", edge
->callee
->dump_name ());
2133 edge
->dump_edge_flags (f
);
2137 if (count
.ipa ().initialized_p ())
2143 FOR_EACH_ALIAS (this, ref
)
2144 if (dyn_cast
<cgraph_node
*> (ref
->referring
)->count
.initialized_p ())
2145 sum
+= dyn_cast
<cgraph_node
*> (ref
->referring
)->count
.ipa ();
2147 if (global
.inlined_to
2148 || (symtab
->state
< EXPANSION
2149 && ultimate_alias_target () == this && only_called_directly_p ()))
2150 ok
= !count
.ipa ().differs_from_p (sum
);
2151 else if (count
.ipa () > profile_count::from_gcov_type (100)
2152 && count
.ipa () < sum
.apply_scale (99, 100))
2153 ok
= false, min
= true;
2156 fprintf (f
, " Invalid sum of caller counts ");
2159 fprintf (f
, ", should be at most ");
2161 fprintf (f
, ", should be ");
2162 count
.ipa ().dump (f
);
2167 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2169 if (edge
->indirect_info
->polymorphic
)
2171 fprintf (f
, " Polymorphic indirect call of type ");
2172 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2173 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2176 fprintf (f
, " Indirect call");
2177 edge
->dump_edge_flags (f
);
2178 if (edge
->indirect_info
->param_index
!= -1)
2180 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2181 if (edge
->indirect_info
->agg_contents
)
2182 fprintf (f
, " loaded from %s %s at offset %i",
2183 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2184 edge
->indirect_info
->by_ref
? "passed by reference":"",
2185 (int)edge
->indirect_info
->offset
);
2186 if (edge
->indirect_info
->vptr_changed
)
2187 fprintf (f
, " (vptr maybe changed)");
2190 if (edge
->indirect_info
->polymorphic
)
2191 edge
->indirect_info
->context
.dump (f
);
2195 /* Dump call graph node NODE to stderr. */
2198 cgraph_node::debug (void)
2203 /* Dump the callgraph to file F. */
2206 cgraph_node::dump_cgraph (FILE *f
)
2210 fprintf (f
, "callgraph:\n\n");
2211 FOR_EACH_FUNCTION (node
)
2215 /* Return true when the DECL can possibly be inlined. */
2218 cgraph_function_possibly_inlined_p (tree decl
)
2220 if (!symtab
->global_info_ready
)
2221 return !DECL_UNINLINABLE (decl
);
2222 return DECL_POSSIBLY_INLINED (decl
);
2225 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2227 cgraph_node::unnest (void)
2229 cgraph_node
**node2
= &origin
->nested
;
2230 gcc_assert (origin
);
2232 while (*node2
!= this)
2233 node2
= &(*node2
)->next_nested
;
2234 *node2
= next_nested
;
2238 /* Return function availability. See cgraph.h for description of individual
2241 cgraph_node::get_availability (symtab_node
*ref
)
2245 cgraph_node
*cref
= dyn_cast
<cgraph_node
*> (ref
);
2247 ref
= cref
->global
.inlined_to
;
2249 enum availability avail
;
2251 avail
= AVAIL_NOT_AVAILABLE
;
2252 else if (local
.local
)
2253 avail
= AVAIL_LOCAL
;
2254 else if (global
.inlined_to
)
2255 avail
= AVAIL_AVAILABLE
;
2256 else if (transparent_alias
)
2257 ultimate_alias_target (&avail
, ref
);
2258 else if (ifunc_resolver
2259 || lookup_attribute ("noipa", DECL_ATTRIBUTES (decl
)))
2260 avail
= AVAIL_INTERPOSABLE
;
2261 else if (!externally_visible
)
2262 avail
= AVAIL_AVAILABLE
;
2263 /* If this is a reference from symbol itself and there are no aliases, we
2264 may be sure that the symbol was not interposed by something else because
2265 the symbol itself would be unreachable otherwise.
2267 Also comdat groups are always resolved in groups. */
2268 else if ((this == ref
&& !has_aliases_p ())
2269 || (ref
&& get_comdat_group ()
2270 && get_comdat_group () == ref
->get_comdat_group ()))
2271 avail
= AVAIL_AVAILABLE
;
2272 /* Inline functions are safe to be analyzed even if their symbol can
2273 be overwritten at runtime. It is not meaningful to enforce any sane
2274 behavior on replacing inline function by different body. */
2275 else if (DECL_DECLARED_INLINE_P (decl
))
2276 avail
= AVAIL_AVAILABLE
;
2278 /* If the function can be overwritten, return OVERWRITABLE. Take
2279 care at least of two notable extensions - the COMDAT functions
2280 used to share template instantiations in C++ (this is symmetric
2281 to code cp_cannot_inline_tree_fn and probably shall be shared and
2282 the inlinability hooks completely eliminated). */
2284 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2285 avail
= AVAIL_INTERPOSABLE
;
2286 else avail
= AVAIL_AVAILABLE
;
2291 /* Worker for cgraph_node_can_be_local_p. */
2293 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2295 return !(!node
->force_output
2296 && ((DECL_COMDAT (node
->decl
)
2297 && !node
->forced_by_abi
2298 && !node
->used_from_object_file_p ()
2299 && !node
->same_comdat_group
)
2300 || !node
->externally_visible
));
2303 /* Return true if cgraph_node can be made local for API change.
2304 Extern inline functions and C++ COMDAT functions can be made local
2305 at the expense of possible code size growth if function is used in multiple
2306 compilation units. */
2308 cgraph_node::can_be_local_p (void)
2310 return (!address_taken
2311 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2315 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2316 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
2317 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2320 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2321 (cgraph_node
*, void *),
2323 bool include_overwritable
,
2324 bool exclude_virtual_thunks
)
2328 enum availability avail
= AVAIL_AVAILABLE
;
2330 if (include_overwritable
2331 || (avail
= get_availability ()) > AVAIL_INTERPOSABLE
)
2333 if (callback (this, data
))
2336 FOR_EACH_ALIAS (this, ref
)
2338 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2339 if (include_overwritable
2340 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2341 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2342 include_overwritable
,
2343 exclude_virtual_thunks
))
2346 if (avail
<= AVAIL_INTERPOSABLE
)
2348 for (e
= callers
; e
; e
= e
->next_caller
)
2349 if (e
->caller
->thunk
.thunk_p
2350 && (include_overwritable
2351 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2352 && !(exclude_virtual_thunks
2353 && e
->caller
->thunk
.virtual_offset_p
))
2354 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2355 include_overwritable
,
2356 exclude_virtual_thunks
))
2362 /* Worker to bring NODE local. */
2365 cgraph_node::make_local (cgraph_node
*node
, void *)
2367 gcc_checking_assert (node
->can_be_local_p ());
2368 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2370 node
->make_decl_local ();
2371 node
->set_section (NULL
);
2372 node
->set_comdat_group (NULL
);
2373 node
->externally_visible
= false;
2374 node
->forced_by_abi
= false;
2375 node
->local
.local
= true;
2376 node
->set_section (NULL
);
2377 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2378 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2379 && !flag_incremental_link
);
2380 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2381 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2386 /* Bring cgraph node local. */
2389 cgraph_node::make_local (void)
2391 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2394 /* Worker to set nothrow flag. */
2397 set_nothrow_flag_1 (cgraph_node
*node
, bool nothrow
, bool non_call
,
2402 if (nothrow
&& !TREE_NOTHROW (node
->decl
))
2404 /* With non-call exceptions we can't say for sure if other function body
2405 was not possibly optimized to stil throw. */
2406 if (!non_call
|| node
->binds_to_current_def_p ())
2408 TREE_NOTHROW (node
->decl
) = true;
2410 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2411 e
->can_throw_external
= false;
2414 else if (!nothrow
&& TREE_NOTHROW (node
->decl
))
2416 TREE_NOTHROW (node
->decl
) = false;
2420 FOR_EACH_ALIAS (node
, ref
)
2422 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2423 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2424 set_nothrow_flag_1 (alias
, nothrow
, non_call
, changed
);
2426 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2427 if (e
->caller
->thunk
.thunk_p
2428 && (!nothrow
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2429 set_nothrow_flag_1 (e
->caller
, nothrow
, non_call
, changed
);
2432 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2433 if any to NOTHROW. */
2436 cgraph_node::set_nothrow_flag (bool nothrow
)
2438 bool changed
= false;
2439 bool non_call
= opt_for_fn (decl
, flag_non_call_exceptions
);
2441 if (!nothrow
|| get_availability () > AVAIL_INTERPOSABLE
)
2442 set_nothrow_flag_1 (this, nothrow
, non_call
, &changed
);
2447 FOR_EACH_ALIAS (this, ref
)
2449 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2450 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2451 set_nothrow_flag_1 (alias
, nothrow
, non_call
, &changed
);
2457 /* Worker to set malloc flag. */
2459 set_malloc_flag_1 (cgraph_node
*node
, bool malloc_p
, bool *changed
)
2461 if (malloc_p
&& !DECL_IS_MALLOC (node
->decl
))
2463 DECL_IS_MALLOC (node
->decl
) = true;
2468 FOR_EACH_ALIAS (node
, ref
)
2470 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2471 if (!malloc_p
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2472 set_malloc_flag_1 (alias
, malloc_p
, changed
);
2475 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2476 if (e
->caller
->thunk
.thunk_p
2477 && (!malloc_p
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2478 set_malloc_flag_1 (e
->caller
, malloc_p
, changed
);
2481 /* Set DECL_IS_MALLOC on NODE's decl and on NODE's aliases if any. */
2484 cgraph_node::set_malloc_flag (bool malloc_p
)
2486 bool changed
= false;
2488 if (!malloc_p
|| get_availability () > AVAIL_INTERPOSABLE
)
2489 set_malloc_flag_1 (this, malloc_p
, &changed
);
2494 FOR_EACH_ALIAS (this, ref
)
2496 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2497 if (!malloc_p
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2498 set_malloc_flag_1 (alias
, malloc_p
, &changed
);
2504 /* Worker to set_const_flag. */
2507 set_const_flag_1 (cgraph_node
*node
, bool set_const
, bool looping
,
2510 /* Static constructors and destructors without a side effect can be
2512 if (set_const
&& !looping
)
2514 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2516 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2519 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2521 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2527 if (TREE_READONLY (node
->decl
))
2529 TREE_READONLY (node
->decl
) = 0;
2530 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2536 /* Consider function:
2543 During early optimization we will turn this into:
2550 Now if this function will be detected as CONST however when interposed
2551 it may end up being just pure. We always must assume the worst
2553 if (TREE_READONLY (node
->decl
))
2555 if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2557 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2561 else if (node
->binds_to_current_def_p ())
2563 TREE_READONLY (node
->decl
) = true;
2564 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2565 DECL_PURE_P (node
->decl
) = false;
2570 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2571 fprintf (dump_file
, "Dropping state to PURE because function does "
2572 "not bind to current def.\n");
2573 if (!DECL_PURE_P (node
->decl
))
2575 DECL_PURE_P (node
->decl
) = true;
2576 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2579 else if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2581 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2588 FOR_EACH_ALIAS (node
, ref
)
2590 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2591 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2592 set_const_flag_1 (alias
, set_const
, looping
, changed
);
2594 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2595 if (e
->caller
->thunk
.thunk_p
2596 && (!set_const
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2598 /* Virtual thunks access virtual offset in the vtable, so they can
2599 only be pure, never const. */
2601 && (e
->caller
->thunk
.virtual_offset_p
2602 || !node
->binds_to_current_def_p (e
->caller
)))
2603 *changed
|= e
->caller
->set_pure_flag (true, looping
);
2605 set_const_flag_1 (e
->caller
, set_const
, looping
, changed
);
2609 /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
2610 If SET_CONST if false, clear the flag.
2612 When setting the flag be careful about possible interposition and
2613 do not set the flag for functions that can be interposet and set pure
2614 flag for functions that can bind to other definition.
2616 Return true if any change was done. */
2619 cgraph_node::set_const_flag (bool set_const
, bool looping
)
2621 bool changed
= false;
2622 if (!set_const
|| get_availability () > AVAIL_INTERPOSABLE
)
2623 set_const_flag_1 (this, set_const
, looping
, &changed
);
2628 FOR_EACH_ALIAS (this, ref
)
2630 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2631 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2632 set_const_flag_1 (alias
, set_const
, looping
, &changed
);
2638 /* Info used by set_pure_flag_1. */
2640 struct set_pure_flag_info
2647 /* Worker to set_pure_flag. */
2650 set_pure_flag_1 (cgraph_node
*node
, void *data
)
2652 struct set_pure_flag_info
*info
= (struct set_pure_flag_info
*)data
;
2653 /* Static constructors and destructors without a side effect can be
2655 if (info
->pure
&& !info
->looping
)
2657 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2659 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2660 info
->changed
= true;
2662 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2664 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2665 info
->changed
= true;
2670 if (!DECL_PURE_P (node
->decl
) && !TREE_READONLY (node
->decl
))
2672 DECL_PURE_P (node
->decl
) = true;
2673 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = info
->looping
;
2674 info
->changed
= true;
2676 else if (DECL_LOOPING_CONST_OR_PURE_P (node
->decl
)
2679 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2680 info
->changed
= true;
2685 if (DECL_PURE_P (node
->decl
))
2687 DECL_PURE_P (node
->decl
) = false;
2688 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2689 info
->changed
= true;
2695 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2698 When setting the flag, be careful about possible interposition.
2699 Return true if any change was done. */
2702 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2704 struct set_pure_flag_info info
= {pure
, looping
, false};
2707 call_for_symbol_thunks_and_aliases (set_pure_flag_1
, &info
, !pure
, true);
2708 return info
.changed
;
2711 /* Return true when cgraph_node can not return or throw and thus
2712 it is safe to ignore its side effects for IPA analysis. */
2715 cgraph_node::cannot_return_p (void)
2717 int flags
= flags_from_decl_or_type (decl
);
2718 if (!opt_for_fn (decl
, flag_exceptions
))
2719 return (flags
& ECF_NORETURN
) != 0;
2721 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2722 == (ECF_NORETURN
| ECF_NOTHROW
));
2725 /* Return true when call of edge can not lead to return from caller
2726 and thus it is safe to ignore its side effects for IPA analysis
2727 when computing side effects of the caller.
2728 FIXME: We could actually mark all edges that have no reaching
2729 patch to the exit block or throw to get better results. */
2731 cgraph_edge::cannot_lead_to_return_p (void)
2733 if (caller
->cannot_return_p ())
2735 if (indirect_unknown_callee
)
2737 int flags
= indirect_info
->ecf_flags
;
2738 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2739 return (flags
& ECF_NORETURN
) != 0;
2741 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2742 == (ECF_NORETURN
| ECF_NOTHROW
));
2745 return callee
->cannot_return_p ();
2748 /* Return true if the call can be hot. */
2751 cgraph_edge::maybe_hot_p (void)
2753 if (!maybe_hot_count_p (NULL
, count
.ipa ()))
2755 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2757 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2759 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2761 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2763 if (opt_for_fn (caller
->decl
, optimize_size
))
2765 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2767 /* If profile is now known yet, be conservative.
2768 FIXME: this predicate is used by early inliner and can do better there. */
2769 if (symtab
->state
< IPA_SSA
)
2771 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2772 && sreal_frequency () * 2 < 3)
2774 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2775 || sreal_frequency () * PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) <= 1)
2780 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2783 nonremovable_p (cgraph_node
*node
, void *)
2785 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2788 /* Return true if whole comdat group can be removed if there are no direct
2792 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2794 struct ipa_ref
*ref
;
2796 /* For local symbols or non-comdat group it is the same as
2797 can_remove_if_no_direct_calls_p. */
2798 if (!externally_visible
|| !same_comdat_group
)
2800 if (DECL_EXTERNAL (decl
))
2804 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2807 if (will_inline
&& address_taken
)
2810 /* Otheriwse check if we can remove the symbol itself and then verify
2811 that only uses of the comdat groups are direct call to THIS
2813 if (!can_remove_if_no_direct_calls_and_refs_p ())
2816 /* Check that all refs come from within the comdat group. */
2817 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2818 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2821 struct cgraph_node
*target
= ultimate_alias_target ();
2822 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2823 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2825 if (!externally_visible
)
2828 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2831 /* If we see different symbol than THIS, be sure to check calls. */
2832 if (next
->ultimate_alias_target () != target
)
2833 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2834 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2838 /* If function is not being inlined, we care only about
2839 references outside of the comdat group. */
2841 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2842 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2848 /* Return true when function cgraph_node can be expected to be removed
2849 from program when direct calls in this compilation unit are removed.
2851 As a special case COMDAT functions are
2852 cgraph_can_remove_if_no_direct_calls_p while the are not
2853 cgraph_only_called_directly_p (it is possible they are called from other
2856 This function behaves as cgraph_only_called_directly_p because eliminating
2857 all uses of COMDAT function does not make it necessarily disappear from
2858 the program unless we are compiling whole program or we do LTO. In this
2859 case we know we win since dynamic linking will not really discard the
2860 linkonce section. */
2863 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2866 gcc_assert (!global
.inlined_to
);
2867 if (DECL_EXTERNAL (decl
))
2870 if (!in_lto_p
&& !flag_whole_program
)
2872 /* If the symbol is in comdat group, we need to verify that whole comdat
2873 group becomes unreachable. Technically we could skip references from
2874 within the group, too. */
2875 if (!only_called_directly_p ())
2877 if (same_comdat_group
&& externally_visible
)
2879 struct cgraph_node
*target
= ultimate_alias_target ();
2881 if (will_inline
&& address_taken
)
2883 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2885 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2887 if (!externally_visible
)
2890 && !next
->only_called_directly_p ())
2893 /* If we see different symbol than THIS,
2894 be sure to check calls. */
2895 if (next
->ultimate_alias_target () != target
)
2896 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2897 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2905 return can_remove_if_no_direct_calls_p (will_inline
);
2909 /* Worker for cgraph_only_called_directly_p. */
2912 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2914 return !node
->only_called_directly_or_aliased_p ();
2917 /* Return true when function cgraph_node and all its aliases are only called
2919 i.e. it is not externally visible, address was not taken and
2920 it is not used in any other non-standard way. */
2923 cgraph_node::only_called_directly_p (void)
2925 gcc_assert (ultimate_alias_target () == this);
2926 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2931 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2934 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2936 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2938 enum availability avail
;
2939 node
->ultimate_alias_target (&avail
);
2941 if (avail
> AVAIL_INTERPOSABLE
)
2942 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2943 if (!cs
->indirect_inlining_edge
2944 && !cs
->caller
->thunk
.thunk_p
)
2945 redirect_callers
->safe_push (cs
);
2949 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2950 cgraph_node (i.e. are not overwritable). */
2953 cgraph_node::collect_callers (void)
2955 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2956 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2957 &redirect_callers
, false);
2958 return redirect_callers
;
2961 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2964 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2966 bool skipped_thunk
= false;
2967 node
= node
->ultimate_alias_target ();
2968 node2
= node2
->ultimate_alias_target ();
2970 /* There are no virtual clones of thunks so check former_clone_of or if we
2971 might have skipped thunks because this adjustments are no longer
2973 while (node
->thunk
.thunk_p
)
2975 if (node2
->former_clone_of
== node
->decl
)
2977 if (!node
->thunk
.this_adjusting
)
2979 node
= node
->callees
->callee
->ultimate_alias_target ();
2980 skipped_thunk
= true;
2985 if (!node2
->clone
.args_to_skip
2986 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2988 if (node2
->former_clone_of
== node
->decl
)
2990 else if (!node2
->clone_of
)
2994 while (node
!= node2
&& node2
)
2995 node2
= node2
->clone_of
;
2996 return node2
!= NULL
;
2999 /* Verify edge count and frequency. */
3002 cgraph_edge::verify_count ()
3004 bool error_found
= false;
3005 if (!count
.verify ())
3007 error ("caller edge count invalid");
3013 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
3015 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
3017 bool fndecl_was_null
= false;
3018 /* debug_gimple_stmt needs correct cfun */
3019 if (cfun
!= this_cfun
)
3020 set_cfun (this_cfun
);
3021 /* ...and an actual current_function_decl */
3022 if (!current_function_decl
)
3024 current_function_decl
= this_cfun
->decl
;
3025 fndecl_was_null
= true;
3027 debug_gimple_stmt (stmt
);
3028 if (fndecl_was_null
)
3029 current_function_decl
= NULL
;
3032 /* Verify that call graph edge corresponds to DECL from the associated
3033 statement. Return true if the verification should fail. */
3036 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
3040 if (!decl
|| callee
->global
.inlined_to
)
3042 if (symtab
->state
== LTO_STREAMING
)
3044 node
= cgraph_node::get (decl
);
3046 /* We do not know if a node from a different partition is an alias or what it
3047 aliases and therefore cannot do the former_clone_of check reliably. When
3048 body_removed is set, we have lost all information about what was alias or
3049 thunk of and also cannot proceed. */
3051 || node
->body_removed
3052 || node
->in_other_partition
3053 || callee
->icf_merged
3054 || callee
->in_other_partition
)
3057 node
= node
->ultimate_alias_target ();
3059 /* Optimizers can redirect unreachable calls or calls triggering undefined
3060 behavior to builtin_unreachable. */
3062 if (fndecl_built_in_p (callee
->decl
, BUILT_IN_UNREACHABLE
))
3065 if (callee
->former_clone_of
!= node
->decl
3066 && (node
!= callee
->ultimate_alias_target ())
3067 && !clone_of_p (node
, callee
))
3073 /* Verify cgraph nodes of given cgraph node. */
3075 cgraph_node::verify_node (void)
3078 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
3079 basic_block this_block
;
3080 gimple_stmt_iterator gsi
;
3081 bool error_found
= false;
3086 timevar_push (TV_CGRAPH_VERIFY
);
3087 error_found
|= verify_base ();
3088 for (e
= callees
; e
; e
= e
->next_callee
)
3091 error ("aux field set for edge %s->%s",
3092 identifier_to_locale (e
->caller
->name ()),
3093 identifier_to_locale (e
->callee
->name ()));
3096 if (!count
.verify ())
3098 error ("cgraph count invalid");
3101 if (global
.inlined_to
&& same_comdat_group
)
3103 error ("inline clone in same comdat group list");
3106 if (!definition
&& !in_other_partition
&& local
.local
)
3108 error ("local symbols must be defined");
3111 if (global
.inlined_to
&& externally_visible
)
3113 error ("externally visible inline clone");
3116 if (global
.inlined_to
&& address_taken
)
3118 error ("inline clone with address taken");
3121 if (global
.inlined_to
&& force_output
)
3123 error ("inline clone is forced to output");
3126 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3130 error ("aux field set for indirect edge from %s",
3131 identifier_to_locale (e
->caller
->name ()));
3134 if (!e
->indirect_unknown_callee
3135 || !e
->indirect_info
)
3137 error ("An indirect edge from %s is not marked as indirect or has "
3138 "associated indirect_info, the corresponding statement is: ",
3139 identifier_to_locale (e
->caller
->name ()));
3140 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3144 bool check_comdat
= comdat_local_p ();
3145 for (e
= callers
; e
; e
= e
->next_caller
)
3147 if (e
->verify_count ())
3150 && !in_same_comdat_group_p (e
->caller
))
3152 error ("comdat-local function called by %s outside its comdat",
3153 identifier_to_locale (e
->caller
->name ()));
3156 if (!e
->inline_failed
)
3158 if (global
.inlined_to
3159 != (e
->caller
->global
.inlined_to
3160 ? e
->caller
->global
.inlined_to
: e
->caller
))
3162 error ("inlined_to pointer is wrong");
3165 if (callers
->next_caller
)
3167 error ("multiple inline callers");
3172 if (global
.inlined_to
)
3174 error ("inlined_to pointer set for noninline callers");
3178 for (e
= callees
; e
; e
= e
->next_callee
)
3180 if (e
->verify_count ())
3182 if (gimple_has_body_p (e
->caller
->decl
)
3183 && !e
->caller
->global
.inlined_to
3185 /* Optimized out calls are redirected to __builtin_unreachable. */
3186 && (e
->count
.nonzero_p ()
3187 || ! e
->callee
->decl
3188 || !fndecl_built_in_p (e
->callee
->decl
, BUILT_IN_UNREACHABLE
))
3190 == ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl
))->count
3191 && (!e
->count
.ipa_p ()
3192 && e
->count
.differs_from_p (gimple_bb (e
->call_stmt
)->count
)))
3194 error ("caller edge count does not match BB count");
3195 fprintf (stderr
, "edge count: ");
3196 e
->count
.dump (stderr
);
3197 fprintf (stderr
, "\n bb count: ");
3198 gimple_bb (e
->call_stmt
)->count
.dump (stderr
);
3199 fprintf (stderr
, "\n");
3203 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3205 if (e
->verify_count ())
3207 if (gimple_has_body_p (e
->caller
->decl
)
3208 && !e
->caller
->global
.inlined_to
3210 && e
->count
.ipa_p ()
3212 == ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl
))->count
3213 && (!e
->count
.ipa_p ()
3214 && e
->count
.differs_from_p (gimple_bb (e
->call_stmt
)->count
)))
3216 error ("indirect call count does not match BB count");
3217 fprintf (stderr
, "edge count: ");
3218 e
->count
.dump (stderr
);
3219 fprintf (stderr
, "\n bb count: ");
3220 gimple_bb (e
->call_stmt
)->count
.dump (stderr
);
3221 fprintf (stderr
, "\n");
3225 if (!callers
&& global
.inlined_to
)
3227 error ("inlined_to pointer is set but no predecessors found");
3230 if (global
.inlined_to
== this)
3232 error ("inlined_to pointer refers to itself");
3239 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
3244 error ("cgraph_node has wrong clone_of");
3251 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
3252 if (n
->clone_of
!= this)
3256 error ("cgraph_node has wrong clone list");
3260 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
3262 error ("cgraph_node is in clone list but it is not clone");
3265 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
3267 error ("cgraph_node has wrong prev_clone pointer");
3270 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
3272 error ("double linked list of clones corrupted");
3276 if (analyzed
&& alias
)
3278 bool ref_found
= false;
3280 ipa_ref
*ref
= NULL
;
3284 error ("Alias has call edges");
3287 for (i
= 0; iterate_reference (i
, ref
); i
++)
3288 if (ref
->use
!= IPA_REF_ALIAS
)
3290 error ("Alias has non-alias reference");
3295 error ("Alias has more than one alias reference");
3302 error ("Analyzed alias has no reference");
3307 if (analyzed
&& thunk
.thunk_p
)
3311 error ("No edge out of thunk node");
3314 else if (callees
->next_callee
)
3316 error ("More than one edge out of thunk node");
3319 if (gimple_has_body_p (decl
) && !global
.inlined_to
)
3321 error ("Thunk is not supposed to have body");
3325 else if (analyzed
&& gimple_has_body_p (decl
)
3326 && !TREE_ASM_WRITTEN (decl
)
3327 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3332 hash_set
<gimple
*> stmts
;
3334 ipa_ref
*ref
= NULL
;
3336 /* Reach the trees by walking over the CFG, and note the
3337 enclosing basic-blocks in the call edges. */
3338 FOR_EACH_BB_FN (this_block
, this_cfun
)
3340 for (gsi
= gsi_start_phis (this_block
);
3341 !gsi_end_p (gsi
); gsi_next (&gsi
))
3342 stmts
.add (gsi_stmt (gsi
));
3343 for (gsi
= gsi_start_bb (this_block
);
3347 gimple
*stmt
= gsi_stmt (gsi
);
3349 if (is_gimple_call (stmt
))
3351 cgraph_edge
*e
= get_edge (stmt
);
3352 tree decl
= gimple_call_fndecl (stmt
);
3357 error ("shared call_stmt:");
3358 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3361 if (!e
->indirect_unknown_callee
)
3363 if (e
->verify_corresponds_to_fndecl (decl
))
3365 error ("edge points to wrong declaration:");
3366 debug_tree (e
->callee
->decl
);
3367 fprintf (stderr
," Instead of:");
3374 error ("an indirect edge with unknown callee "
3375 "corresponding to a call_stmt with "
3376 "a known declaration:");
3378 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3384 error ("missing callgraph edge for call stmt:");
3385 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3391 for (i
= 0; iterate_reference (i
, ref
); i
++)
3392 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3394 error ("reference to dead statement");
3395 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3400 /* No CFG available?! */
3403 for (e
= callees
; e
; e
= e
->next_callee
)
3407 error ("edge %s->%s has no corresponding call_stmt",
3408 identifier_to_locale (e
->caller
->name ()),
3409 identifier_to_locale (e
->callee
->name ()));
3410 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3415 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3417 if (!e
->aux
&& !e
->speculative
)
3419 error ("an indirect edge from %s has no corresponding call_stmt",
3420 identifier_to_locale (e
->caller
->name ()));
3421 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3430 internal_error ("verify_cgraph_node failed");
3432 timevar_pop (TV_CGRAPH_VERIFY
);
3435 /* Verify whole cgraph structure. */
3437 cgraph_node::verify_cgraph_nodes (void)
3444 FOR_EACH_FUNCTION (node
)
3448 /* Walk the alias chain to return the function cgraph_node is alias of.
3449 Walk through thunks, too.
3450 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3451 When REF is non-NULL, assume that reference happens in symbol REF
3452 when determining the availability. */
3455 cgraph_node::function_symbol (enum availability
*availability
,
3456 struct symtab_node
*ref
)
3458 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3460 while (node
->thunk
.thunk_p
)
3463 node
= node
->callees
->callee
;
3466 enum availability a
;
3467 a
= node
->get_availability (ref
);
3468 if (a
< *availability
)
3471 node
= node
->ultimate_alias_target (availability
, ref
);
3476 /* Walk the alias chain to return the function cgraph_node is alias of.
3477 Walk through non virtual thunks, too. Thus we return either a function
3478 or a virtual thunk node.
3479 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3480 When REF is non-NULL, assume that reference happens in symbol REF
3481 when determining the availability. */
3484 cgraph_node::function_or_virtual_thunk_symbol
3485 (enum availability
*availability
,
3486 struct symtab_node
*ref
)
3488 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3490 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3493 node
= node
->callees
->callee
;
3496 enum availability a
;
3497 a
= node
->get_availability (ref
);
3498 if (a
< *availability
)
3501 node
= node
->ultimate_alias_target (availability
, ref
);
3506 /* When doing LTO, read cgraph_node's body from disk if it is not already
3510 cgraph_node::get_untransformed_body (void)
3512 lto_file_decl_data
*file_data
;
3513 const char *data
, *name
;
3515 tree decl
= this->decl
;
3517 /* Check if body is already there. Either we have gimple body or
3518 the function is thunk and in that case we set DECL_ARGUMENTS. */
3519 if (DECL_ARGUMENTS (decl
) || gimple_has_body_p (decl
))
3522 gcc_assert (in_lto_p
&& !DECL_RESULT (decl
));
3524 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3526 file_data
= lto_file_data
;
3527 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3529 /* We may have renamed the declaration, e.g., a static function. */
3530 name
= lto_get_decl_name_mapping (file_data
, name
);
3531 struct lto_in_decl_state
*decl_state
3532 = lto_get_function_in_decl_state (file_data
, decl
);
3534 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3535 name
, &len
, decl_state
->compressed
);
3537 fatal_error (input_location
, "%s: section %s is missing",
3538 file_data
->file_name
,
3541 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3544 fprintf (stderr
, " in:%s", IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
3545 lto_input_function_body (file_data
, this, data
);
3546 lto_stats
.num_function_bodies
++;
3547 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3548 data
, len
, decl_state
->compressed
);
3549 lto_free_function_in_decl_state_for_node (this);
3550 /* Keep lto file data so ipa-inline-analysis knows about cross module
3553 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3558 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3559 if it is not already present. When some IPA transformations are scheduled,
3563 cgraph_node::get_body (void)
3567 updated
= get_untransformed_body ();
3569 /* Getting transformed body makes no sense for inline clones;
3570 we should never use this on real clones because they are materialized
3572 TODO: Materializing clones here will likely lead to smaller LTRANS
3574 gcc_assert (!global
.inlined_to
&& !clone_of
);
3575 if (ipa_transforms_to_apply
.exists ())
3577 opt_pass
*saved_current_pass
= current_pass
;
3578 FILE *saved_dump_file
= dump_file
;
3579 const char *saved_dump_file_name
= dump_file_name
;
3580 dump_flags_t saved_dump_flags
= dump_flags
;
3581 dump_file_name
= NULL
;
3582 set_dump_file (NULL
);
3584 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3585 execute_all_ipa_transforms ();
3586 cgraph_edge::rebuild_edges ();
3587 free_dominance_info (CDI_DOMINATORS
);
3588 free_dominance_info (CDI_POST_DOMINATORS
);
3592 current_pass
= saved_current_pass
;
3593 set_dump_file (saved_dump_file
);
3594 dump_file_name
= saved_dump_file_name
;
3595 dump_flags
= saved_dump_flags
;
3600 /* Return the DECL_STRUCT_FUNCTION of the function. */
3603 cgraph_node::get_fun (void)
3605 cgraph_node
*node
= this;
3606 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3608 while (!fun
&& node
->clone_of
)
3610 node
= node
->clone_of
;
3611 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3617 /* Verify if the type of the argument matches that of the function
3618 declaration. If we cannot verify this or there is a mismatch,
3622 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3625 unsigned int i
, nargs
;
3627 /* Calls to internal functions always match their signature. */
3628 if (gimple_call_internal_p (stmt
))
3631 nargs
= gimple_call_num_args (stmt
);
3633 /* Get argument types for verification. */
3635 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3637 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3639 /* Verify if the type of the argument matches that of the function
3640 declaration. If we cannot verify this or there is a mismatch,
3642 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3644 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3646 i
++, p
= DECL_CHAIN (p
))
3649 /* We cannot distinguish a varargs function from the case
3650 of excess parameters, still deferring the inlining decision
3651 to the callee is possible. */
3654 arg
= gimple_call_arg (stmt
, i
);
3655 if (p
== error_mark_node
3656 || DECL_ARG_TYPE (p
) == error_mark_node
3657 || arg
== error_mark_node
3658 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3659 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3662 if (args_count_match
&& p
)
3667 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3670 /* If this is a varargs function defer inlining decision
3674 arg
= gimple_call_arg (stmt
, i
);
3675 if (TREE_VALUE (p
) == error_mark_node
3676 || arg
== error_mark_node
3677 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3678 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3679 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3691 /* Verify if the type of the argument and lhs of CALL_STMT matches
3692 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3693 true, the arg count needs to be the same.
3694 If we cannot verify this or there is a mismatch, return false. */
3697 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3698 bool args_count_match
)
3702 if ((DECL_RESULT (callee
)
3703 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3704 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3705 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3707 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3708 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3713 /* Reset all state within cgraph.c so that we can rerun the compiler
3714 within the same process. For use by toplev::finalize. */
3717 cgraph_c_finalize (void)
3721 x_cgraph_nodes_queue
= NULL
;
3723 cgraph_fnver_htab
= NULL
;
3724 version_info_node
= NULL
;
3727 /* A wroker for call_for_symbol_and_aliases. */
3730 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3733 bool include_overwritable
)
3736 FOR_EACH_ALIAS (this, ref
)
3738 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3739 if (include_overwritable
3740 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3741 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3742 include_overwritable
))
3748 /* Return true if NODE has thunk. */
3751 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3753 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3754 if (e
->caller
->thunk
.thunk_p
)
3759 /* Expected frequency of executions within the function. */
3762 cgraph_edge::sreal_frequency ()
3764 return count
.to_sreal_scale (caller
->global
.inlined_to
3765 ? caller
->global
.inlined_to
->count
3770 /* During LTO stream in this can be used to check whether call can possibly
3771 be internal to the current translation unit. */
3774 cgraph_edge::possibly_call_in_translation_unit_p (void)
3776 gcc_checking_assert (in_lto_p
&& caller
->prevailing_p ());
3778 /* While incremental linking we may end up getting function body later. */
3779 if (flag_incremental_link
== INCREMENTAL_LINK_LTO
)
3782 /* We may be smarter here and avoid stremaing in indirect calls we can't
3783 track, but that would require arranging stremaing the indirect call
3788 /* If calle is local to the original translation unit, it will be defined. */
3789 if (!TREE_PUBLIC (callee
->decl
) && !DECL_EXTERNAL (callee
->decl
))
3792 /* Otherwise we need to lookup prevailing symbol (symbol table is not merged,
3793 yet) and see if it is a definition. In fact we may also resolve aliases,
3794 but that is probably not too important. */
3795 symtab_node
*node
= callee
;
3796 for (int n
= 10; node
->previous_sharing_asm_name
&& n
; n
--)
3797 node
= node
->previous_sharing_asm_name
;
3798 if (node
->previous_sharing_asm_name
)
3799 node
= symtab_node::get_for_asmname (DECL_ASSEMBLER_NAME (callee
->decl
));
3800 gcc_assert (TREE_PUBLIC (node
->decl
));
3801 return node
->get_availability () >= AVAIL_AVAILABLE
;
3804 /* A stashed copy of "symtab" for use by selftest::symbol_table_test.
3805 This needs to be a global so that it can be a GC root, and thus
3806 prevent the stashed copy from being garbage-collected if the GC runs
3807 during a symbol_table_test. */
3809 symbol_table
*saved_symtab
;
3813 namespace selftest
{
3815 /* class selftest::symbol_table_test. */
3817 /* Constructor. Store the old value of symtab, and create a new one. */
3819 symbol_table_test::symbol_table_test ()
3821 gcc_assert (saved_symtab
== NULL
);
3822 saved_symtab
= symtab
;
3823 symtab
= new (ggc_cleared_alloc
<symbol_table
> ()) symbol_table ();
3826 /* Destructor. Restore the old value of symtab. */
3828 symbol_table_test::~symbol_table_test ()
3830 gcc_assert (saved_symtab
!= NULL
);
3831 symtab
= saved_symtab
;
3832 saved_symtab
= NULL
;
3835 /* Verify that symbol_table_test works. */
3838 test_symbol_table_test ()
3840 /* Simulate running two selftests involving symbol tables. */
3841 for (int i
= 0; i
< 2; i
++)
3843 symbol_table_test stt
;
3844 tree test_decl
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
,
3845 get_identifier ("test_decl"),
3846 build_function_type_list (void_type_node
,
3848 cgraph_node
*node
= cgraph_node::get_create (test_decl
);
3851 /* Verify that the node has order 0 on both iterations,
3852 and thus that nodes have predictable dump names in selftests. */
3853 ASSERT_EQ (node
->order
, 0);
3854 ASSERT_STREQ (node
->dump_name (), "test_decl/0");
3858 /* Run all of the selftests within this file. */
3863 test_symbol_table_test ();
3866 } // namespace selftest
3868 #endif /* CHECKING_P */
3870 #include "gt-cgraph.h"