1 /* Callgraph handling code.
2 Copyright (C) 2003-2018 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"
66 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
67 #include "tree-pass.h"
69 /* Queue of cgraph nodes scheduled to be lowered. */
70 symtab_node
*x_cgraph_nodes_queue
;
71 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
73 /* Symbol table global context. */
76 /* List of hooks triggered on cgraph_edge events. */
77 struct cgraph_edge_hook_list
{
78 cgraph_edge_hook hook
;
80 struct cgraph_edge_hook_list
*next
;
83 /* List of hooks triggered on cgraph_node events. */
84 struct cgraph_node_hook_list
{
85 cgraph_node_hook hook
;
87 struct cgraph_node_hook_list
*next
;
90 /* List of hooks triggered on events involving two cgraph_edges. */
91 struct cgraph_2edge_hook_list
{
92 cgraph_2edge_hook hook
;
94 struct cgraph_2edge_hook_list
*next
;
97 /* List of hooks triggered on events involving two cgraph_nodes. */
98 struct cgraph_2node_hook_list
{
99 cgraph_2node_hook hook
;
101 struct cgraph_2node_hook_list
*next
;
104 /* Hash descriptor for cgraph_function_version_info. */
106 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
108 static hashval_t
hash (cgraph_function_version_info
*);
109 static bool equal (cgraph_function_version_info
*,
110 cgraph_function_version_info
*);
113 /* Map a cgraph_node to cgraph_function_version_info using this htab.
114 The cgraph_function_version_info has a THIS_NODE field that is the
115 corresponding cgraph_node.. */
117 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
119 /* Hash function for cgraph_fnver_htab. */
121 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
123 int uid
= ptr
->this_node
->get_uid ();
124 return (hashval_t
)(uid
);
127 /* eq function for cgraph_fnver_htab. */
129 function_version_hasher::equal (cgraph_function_version_info
*n1
,
130 cgraph_function_version_info
*n2
)
132 return n1
->this_node
->get_uid () == n2
->this_node
->get_uid ();
135 /* Mark as GC root all allocated nodes. */
136 static GTY(()) struct cgraph_function_version_info
*
137 version_info_node
= NULL
;
139 /* Return true if NODE's address can be compared. */
142 symtab_node::address_can_be_compared_p ()
144 /* Address of virtual tables and functions is never compared. */
145 if (DECL_VIRTUAL_P (decl
))
147 /* Address of C++ cdtors is never compared. */
148 if (is_a
<cgraph_node
*> (this)
149 && (DECL_CXX_CONSTRUCTOR_P (decl
)
150 || DECL_CXX_DESTRUCTOR_P (decl
)))
152 /* Constant pool symbols addresses are never compared.
153 flag_merge_constants permits us to assume the same on readonly vars. */
154 if (is_a
<varpool_node
*> (this)
155 && (DECL_IN_CONSTANT_POOL (decl
)
156 || (flag_merge_constants
>= 2
157 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
162 /* Get the cgraph_function_version_info node corresponding to node. */
163 cgraph_function_version_info
*
164 cgraph_node::function_version (void)
166 cgraph_function_version_info key
;
167 key
.this_node
= this;
169 if (cgraph_fnver_htab
== NULL
)
172 return cgraph_fnver_htab
->find (&key
);
175 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
176 corresponding to cgraph_node NODE. */
177 cgraph_function_version_info
*
178 cgraph_node::insert_new_function_version (void)
180 version_info_node
= NULL
;
181 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
182 version_info_node
->this_node
= this;
184 if (cgraph_fnver_htab
== NULL
)
185 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
187 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
189 return version_info_node
;
192 /* Remove the cgraph_function_version_info node given by DECL_V. */
194 delete_function_version (cgraph_function_version_info
*decl_v
)
199 if (decl_v
->prev
!= NULL
)
200 decl_v
->prev
->next
= decl_v
->next
;
202 if (decl_v
->next
!= NULL
)
203 decl_v
->next
->prev
= decl_v
->prev
;
205 if (cgraph_fnver_htab
!= NULL
)
206 cgraph_fnver_htab
->remove_elt (decl_v
);
209 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
210 DECL is a duplicate declaration. */
212 cgraph_node::delete_function_version_by_decl (tree decl
)
214 cgraph_node
*decl_node
= cgraph_node::get (decl
);
216 if (decl_node
== NULL
)
219 delete_function_version (decl_node
->function_version ());
221 decl_node
->remove ();
224 /* Record that DECL1 and DECL2 are semantically identical function
227 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
229 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
230 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
231 cgraph_function_version_info
*decl1_v
= NULL
;
232 cgraph_function_version_info
*decl2_v
= NULL
;
233 cgraph_function_version_info
*before
;
234 cgraph_function_version_info
*after
;
236 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
237 decl1_v
= decl1_node
->function_version ();
238 decl2_v
= decl2_node
->function_version ();
240 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
244 decl1_v
= decl1_node
->insert_new_function_version ();
247 decl2_v
= decl2_node
->insert_new_function_version ();
249 /* Chain decl2_v and decl1_v. All semantically identical versions
250 will be chained together. */
255 while (before
->next
!= NULL
)
256 before
= before
->next
;
258 while (after
->prev
!= NULL
)
261 before
->next
= after
;
262 after
->prev
= before
;
265 /* Initialize callgraph dump file. */
268 symbol_table::initialize (void)
271 dump_file
= dump_begin (TDI_cgraph
, NULL
);
273 if (!ipa_clones_dump_file
)
274 ipa_clones_dump_file
= dump_begin (TDI_clones
, NULL
);
277 /* Allocate new callgraph node and insert it into basic data structures. */
280 symbol_table::create_empty (void)
282 cgraph_node
*node
= allocate_cgraph_symbol ();
284 node
->type
= SYMTAB_FUNCTION
;
285 node
->frequency
= NODE_FREQUENCY_NORMAL
;
286 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
292 /* Register HOOK to be called with DATA on each removed edge. */
293 cgraph_edge_hook_list
*
294 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
296 cgraph_edge_hook_list
*entry
;
297 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
299 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
309 /* Remove ENTRY from the list of hooks called on removing edges. */
311 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
313 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
315 while (*ptr
!= entry
)
321 /* Call all edge removal hooks. */
323 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
325 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
328 entry
->hook (e
, entry
->data
);
333 /* Register HOOK to be called with DATA on each removed node. */
334 cgraph_node_hook_list
*
335 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
337 cgraph_node_hook_list
*entry
;
338 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
340 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
350 /* Remove ENTRY from the list of hooks called on removing nodes. */
352 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
354 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
356 while (*ptr
!= entry
)
362 /* Call all node removal hooks. */
364 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
366 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
369 entry
->hook (node
, entry
->data
);
374 /* Call all node removal hooks. */
376 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
378 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
381 entry
->hook (node
, entry
->data
);
387 /* Register HOOK to be called with DATA on each inserted node. */
388 cgraph_node_hook_list
*
389 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
391 cgraph_node_hook_list
*entry
;
392 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
394 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
404 /* Remove ENTRY from the list of hooks called on inserted nodes. */
406 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
408 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
410 while (*ptr
!= entry
)
416 /* Register HOOK to be called with DATA on each duplicated edge. */
417 cgraph_2edge_hook_list
*
418 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
420 cgraph_2edge_hook_list
*entry
;
421 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
423 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
433 /* Remove ENTRY from the list of hooks called on duplicating edges. */
435 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
437 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
439 while (*ptr
!= entry
)
445 /* Call all edge duplication hooks. */
447 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
449 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
452 entry
->hook (cs1
, cs2
, entry
->data
);
457 /* Register HOOK to be called with DATA on each duplicated node. */
458 cgraph_2node_hook_list
*
459 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
461 cgraph_2node_hook_list
*entry
;
462 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
464 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
474 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
476 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
478 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
480 while (*ptr
!= entry
)
486 /* Call all node duplication hooks. */
488 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
491 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
494 entry
->hook (node
, node2
, entry
->data
);
499 /* Return cgraph node assigned to DECL. Create new one when needed. */
502 cgraph_node::create (tree decl
)
504 cgraph_node
*node
= symtab
->create_empty ();
505 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
509 node
->count
= profile_count::uninitialized ();
511 if ((flag_openacc
|| flag_openmp
)
512 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
514 node
->offloadable
= 1;
515 if (ENABLE_OFFLOADING
)
516 g
->have_offload
= true;
519 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
520 node
->ifunc_resolver
= true;
522 node
->register_symbol ();
524 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
526 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
527 node
->next_nested
= node
->origin
->nested
;
528 node
->origin
->nested
= node
;
533 /* Try to find a call graph node for declaration DECL and if it does not exist
534 or if it corresponds to an inline clone, create a new one. */
537 cgraph_node::get_create (tree decl
)
539 cgraph_node
*first_clone
= cgraph_node::get (decl
);
541 if (first_clone
&& !first_clone
->global
.inlined_to
)
544 cgraph_node
*node
= cgraph_node::create (decl
);
547 first_clone
->clone_of
= node
;
548 node
->clones
= first_clone
;
549 symtab
->symtab_prevail_in_asm_name_hash (node
);
550 node
->decl
->decl_with_vis
.symtab_node
= node
;
552 fprintf (dump_file
, "Introduced new external node "
553 "(%s) and turned into root of the clone tree.\n",
557 fprintf (dump_file
, "Introduced new external node "
558 "(%s).\n", node
->dump_name ());
562 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
563 the function body is associated with (not necessarily cgraph_node (DECL). */
566 cgraph_node::create_alias (tree alias
, tree target
)
568 cgraph_node
*alias_node
;
570 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
571 || TREE_CODE (target
) == IDENTIFIER_NODE
);
572 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
573 alias_node
= cgraph_node::get_create (alias
);
574 gcc_assert (!alias_node
->definition
);
575 alias_node
->alias_target
= target
;
576 alias_node
->definition
= true;
577 alias_node
->alias
= true;
578 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
579 alias_node
->transparent_alias
= alias_node
->weakref
= true;
580 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (alias
)))
581 alias_node
->ifunc_resolver
= true;
585 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
587 Same body aliases are output whenever the body of DECL is output,
588 and cgraph_node::get (ALIAS) transparently returns
589 cgraph_node::get (DECL). */
592 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
596 /* If aliases aren't supported by the assembler, fail. */
597 if (!TARGET_SUPPORTS_ALIASES
)
600 /* Langhooks can create same body aliases of symbols not defined.
601 Those are useless. Drop them on the floor. */
602 if (symtab
->global_info_ready
)
605 n
= cgraph_node::create_alias (alias
, decl
);
606 n
->cpp_implicit_alias
= true;
607 if (symtab
->cpp_implicit_aliases_done
)
608 n
->resolve_alias (cgraph_node::get (decl
));
612 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
613 aliases DECL with an adjustments made into the first parameter.
614 See comments in struct cgraph_thunk_info for detail on the parameters. */
617 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
618 HOST_WIDE_INT fixed_offset
,
619 HOST_WIDE_INT virtual_value
,
620 HOST_WIDE_INT indirect_offset
,
626 node
= cgraph_node::get (alias
);
630 node
= cgraph_node::create (alias
);
632 /* Make sure that if VIRTUAL_OFFSET is in sync with VIRTUAL_VALUE. */
633 gcc_checking_assert (virtual_offset
634 ? virtual_value
== wi::to_wide (virtual_offset
)
635 : virtual_value
== 0);
637 node
->thunk
.fixed_offset
= fixed_offset
;
638 node
->thunk
.virtual_value
= virtual_value
;
639 node
->thunk
.indirect_offset
= indirect_offset
;
640 node
->thunk
.alias
= real_alias
;
641 node
->thunk
.this_adjusting
= this_adjusting
;
642 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
643 node
->thunk
.thunk_p
= true;
644 node
->definition
= true;
649 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
650 Return NULL if there's no such node. */
653 cgraph_node::get_for_asmname (tree asmname
)
655 /* We do not want to look at inline clones. */
656 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
658 node
= node
->next_sharing_asm_name
)
660 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
661 if (cn
&& !cn
->global
.inlined_to
)
667 /* Returns a hash value for X (which really is a cgraph_edge). */
670 cgraph_edge_hasher::hash (cgraph_edge
*e
)
672 /* This is a really poor hash function, but it is what htab_hash_pointer
674 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
677 /* Returns a hash value for X (which really is a cgraph_edge). */
680 cgraph_edge_hasher::hash (gimple
*call_stmt
)
682 /* This is a really poor hash function, but it is what htab_hash_pointer
684 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
687 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
690 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
692 return x
->call_stmt
== y
;
695 /* Add call graph edge E to call site hash of its caller. */
698 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
700 gimple
*call
= e
->call_stmt
;
701 *e
->caller
->call_site_hash
->find_slot_with_hash
702 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
705 /* Add call graph edge E to call site hash of its caller. */
708 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
710 /* There are two speculative edges for every statement (one direct,
711 one indirect); always hash the direct one. */
712 if (e
->speculative
&& e
->indirect_unknown_callee
)
714 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
715 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
718 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
723 gcc_assert (!*slot
|| e
->speculative
);
727 /* Return the callgraph edge representing the GIMPLE_CALL statement
731 cgraph_node::get_edge (gimple
*call_stmt
)
737 return call_site_hash
->find_with_hash
738 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
740 /* This loop may turn out to be performance problem. In such case adding
741 hashtables into call nodes with very many edges is probably best
742 solution. It is not good idea to add pointer into CALL_EXPR itself
743 because we want to make possible having multiple cgraph nodes representing
744 different clones of the same body before the body is actually cloned. */
745 for (e
= callees
; e
; e
= e
->next_callee
)
747 if (e
->call_stmt
== call_stmt
)
753 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
755 if (e
->call_stmt
== call_stmt
)
762 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
763 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
764 cgraph_add_edge_to_call_site_hash (e2
);
765 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
766 cgraph_add_edge_to_call_site_hash (e2
);
773 /* Change field call_stmt of edge to NEW_STMT.
774 If UPDATE_SPECULATIVE and E is any component of speculative
775 edge, then update all components. */
778 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
782 /* Speculative edges has three component, update all of them
784 if (update_speculative
&& speculative
)
786 cgraph_edge
*direct
, *indirect
;
789 speculative_call_info (direct
, indirect
, ref
);
790 direct
->set_call_stmt (new_stmt
, false);
791 indirect
->set_call_stmt (new_stmt
, false);
792 ref
->stmt
= new_stmt
;
796 /* Only direct speculative edges go to call_site_hash. */
797 if (caller
->call_site_hash
798 && (!speculative
|| !indirect_unknown_callee
))
800 caller
->call_site_hash
->remove_elt_with_hash
801 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
804 cgraph_edge
*e
= this;
806 call_stmt
= new_stmt
;
807 if (indirect_unknown_callee
808 && (decl
= gimple_call_fndecl (new_stmt
)))
810 /* Constant propagation (and possibly also inlining?) can turn an
811 indirect call into a direct one. */
812 cgraph_node
*new_callee
= cgraph_node::get (decl
);
814 gcc_checking_assert (new_callee
);
815 e
= make_direct (new_callee
);
818 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
819 e
->can_throw_external
= stmt_can_throw_external (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 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
874 edge
->can_throw_external
875 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
878 && callee
&& callee
->decl
879 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
882 edge
->inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
883 edge
->call_stmt_cannot_inline_p
= true;
887 edge
->inline_failed
= CIF_FUNCTION_NOT_CONSIDERED
;
888 edge
->call_stmt_cannot_inline_p
= false;
891 edge
->indirect_info
= NULL
;
892 edge
->indirect_inlining_edge
= 0;
893 edge
->speculative
= false;
894 edge
->indirect_unknown_callee
= indir_unknown_callee
;
895 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
896 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
897 edge
->in_polymorphic_cdtor
898 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
901 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
902 if (call_stmt
&& caller
->call_site_hash
)
903 cgraph_add_edge_to_call_site_hash (edge
);
908 /* Create edge from a given function to CALLEE in the cgraph. */
911 cgraph_node::create_edge (cgraph_node
*callee
,
912 gcall
*call_stmt
, profile_count count
)
914 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
917 initialize_inline_failed (edge
);
919 edge
->next_caller
= callee
->callers
;
921 callee
->callers
->prev_caller
= edge
;
922 edge
->next_callee
= callees
;
924 callees
->prev_callee
= edge
;
926 callee
->callers
= edge
;
931 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
933 cgraph_indirect_call_info
*
934 cgraph_allocate_init_indirect_info (void)
936 cgraph_indirect_call_info
*ii
;
938 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
939 ii
->param_index
= -1;
943 /* Create an indirect edge with a yet-undetermined callee where the call
944 statement destination is a formal parameter of the caller with index
948 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
950 bool compute_indirect_info
)
952 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
956 initialize_inline_failed (edge
);
958 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
959 edge
->indirect_info
->ecf_flags
= ecf_flags
;
960 edge
->indirect_info
->vptr_changed
= true;
962 /* Record polymorphic call info. */
963 if (compute_indirect_info
965 && (target
= gimple_call_fn (call_stmt
))
966 && virtual_method_call_p (target
))
968 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
970 /* Only record types can have virtual calls. */
971 edge
->indirect_info
->polymorphic
= true;
972 edge
->indirect_info
->param_index
= -1;
973 edge
->indirect_info
->otr_token
974 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
975 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
976 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
977 edge
->indirect_info
->context
= context
;
980 edge
->next_callee
= indirect_calls
;
982 indirect_calls
->prev_callee
= edge
;
983 indirect_calls
= edge
;
988 /* Remove the edge from the list of the callees of the caller. */
991 cgraph_edge::remove_caller (void)
994 prev_callee
->next_callee
= next_callee
;
996 next_callee
->prev_callee
= prev_callee
;
999 if (indirect_unknown_callee
)
1000 caller
->indirect_calls
= next_callee
;
1002 caller
->callees
= next_callee
;
1004 if (caller
->call_site_hash
)
1005 caller
->call_site_hash
->remove_elt_with_hash
1006 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
1009 /* Put the edge onto the free list. */
1012 symbol_table::free_edge (cgraph_edge
*e
)
1014 if (e
->indirect_info
)
1015 ggc_free (e
->indirect_info
);
1017 /* Clear out the edge so we do not dangle pointers. */
1018 memset (e
, 0, sizeof (*e
));
1019 NEXT_FREE_EDGE (e
) = free_edges
;
1024 /* Remove the edge in the cgraph. */
1027 cgraph_edge::remove (void)
1029 /* Call all edge removal hooks. */
1030 symtab
->call_edge_removal_hooks (this);
1032 if (!indirect_unknown_callee
)
1033 /* Remove from callers list of the callee. */
1036 /* Remove from callees list of the callers. */
1039 /* Put the edge onto the free list. */
1040 symtab
->free_edge (this);
1043 /* Turn edge into speculative call calling N2. Update
1044 the profile so the direct call is taken COUNT times
1047 At clone materialization time, the indirect call E will
1050 if (call_dest == N2)
1055 At this time the function just creates the direct call,
1056 the referencd representing the if conditional and attaches
1057 them all to the orginal indirect call statement.
1059 Return direct edge created. */
1062 cgraph_edge::make_speculative (cgraph_node
*n2
, profile_count direct_count
)
1064 cgraph_node
*n
= caller
;
1065 ipa_ref
*ref
= NULL
;
1069 fprintf (dump_file
, "Indirect call -> speculative call %s => %s\n",
1070 n
->dump_name (), n2
->dump_name ());
1072 e2
= n
->create_edge (n2
, call_stmt
, direct_count
);
1073 initialize_inline_failed (e2
);
1074 e2
->speculative
= true;
1075 if (TREE_NOTHROW (n2
->decl
))
1076 e2
->can_throw_external
= false;
1078 e2
->can_throw_external
= can_throw_external
;
1079 e2
->lto_stmt_uid
= lto_stmt_uid
;
1080 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1082 symtab
->call_edge_duplication_hooks (this, e2
);
1083 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1084 ref
->lto_stmt_uid
= lto_stmt_uid
;
1085 ref
->speculative
= speculative
;
1086 n2
->mark_address_taken ();
1090 /* Speculative call consist of three components:
1091 1) an indirect edge representing the original call
1092 2) an direct edge representing the new call
1093 3) ADDR_EXPR reference representing the speculative check.
1094 All three components are attached to single statement (the indirect
1095 call) and if one of them exists, all of them must exist.
1097 Given speculative call edge, return all three components.
1101 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1102 cgraph_edge
*&indirect
,
1103 ipa_ref
*&reference
)
1108 cgraph_edge
*e
= this;
1110 if (!e
->indirect_unknown_callee
)
1111 for (e2
= e
->caller
->indirect_calls
;
1112 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1113 e2
= e2
->next_callee
)
1118 /* We can take advantage of the call stmt hash. */
1121 e
= e
->caller
->get_edge (e2
->call_stmt
);
1122 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1125 for (e
= e
->caller
->callees
;
1126 e2
->call_stmt
!= e
->call_stmt
1127 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1131 gcc_assert (e
->speculative
&& e2
->speculative
);
1136 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1137 if (ref
->speculative
1138 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1139 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1145 /* Speculative edge always consist of all three components - direct edge,
1146 indirect and reference. */
1148 gcc_assert (e
&& e2
&& ref
);
1151 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1152 Remove the speculative call sequence and return edge representing the call.
1153 It is up to caller to redirect the call as appropriate. */
1156 cgraph_edge::resolve_speculation (tree callee_decl
)
1158 cgraph_edge
*edge
= this;
1162 gcc_assert (edge
->speculative
);
1163 edge
->speculative_call_info (e2
, edge
, ref
);
1165 || !ref
->referred
->semantically_equivalent_p
1166 (symtab_node::get (callee_decl
)))
1172 fprintf (dump_file
, "Speculative indirect call %s => %s has "
1173 "turned out to have contradicting known target ",
1174 edge
->caller
->dump_name (),
1175 e2
->callee
->dump_name ());
1176 print_generic_expr (dump_file
, callee_decl
);
1177 fprintf (dump_file
, "\n");
1181 fprintf (dump_file
, "Removing speculative call %s => %s\n",
1182 edge
->caller
->dump_name (),
1183 e2
->callee
->dump_name ());
1189 cgraph_edge
*tmp
= edge
;
1191 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1194 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1195 in the functions inlined through it. */
1197 edge
->count
+= e2
->count
;
1198 edge
->speculative
= false;
1199 e2
->speculative
= false;
1200 ref
->remove_reference ();
1201 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1204 e2
->callee
->remove_symbol_and_inline_clones ();
1205 if (edge
->caller
->call_site_hash
)
1206 cgraph_update_edge_in_call_site_hash (edge
);
1210 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1211 CALLEE. DELTA is an integer constant that is to be added to the this
1212 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1215 cgraph_edge::make_direct (cgraph_node
*callee
)
1217 cgraph_edge
*edge
= this;
1218 gcc_assert (indirect_unknown_callee
);
1220 /* If we are redirecting speculative call, make it non-speculative. */
1221 if (indirect_unknown_callee
&& speculative
)
1223 edge
= edge
->resolve_speculation (callee
->decl
);
1225 /* On successful speculation just return the pre existing direct edge. */
1226 if (!indirect_unknown_callee
)
1230 indirect_unknown_callee
= 0;
1231 ggc_free (indirect_info
);
1232 indirect_info
= NULL
;
1234 /* Get the edge out of the indirect edge list. */
1236 prev_callee
->next_callee
= next_callee
;
1238 next_callee
->prev_callee
= prev_callee
;
1240 caller
->indirect_calls
= next_callee
;
1242 /* Put it into the normal callee list */
1244 next_callee
= caller
->callees
;
1245 if (caller
->callees
)
1246 caller
->callees
->prev_callee
= edge
;
1247 caller
->callees
= edge
;
1249 /* Insert to callers list of the new callee. */
1250 edge
->set_callee (callee
);
1253 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
, false))
1255 call_stmt_cannot_inline_p
= true;
1256 inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
1259 /* We need to re-determine the inlining status of the edge. */
1260 initialize_inline_failed (edge
);
1264 /* If necessary, change the function declaration in the call statement
1265 associated with E so that it corresponds to the edge callee. */
1268 cgraph_edge::redirect_call_stmt_to_callee (void)
1270 cgraph_edge
*e
= this;
1272 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1274 gimple_stmt_iterator gsi
;
1282 e
->speculative_call_info (e
, e2
, ref
);
1283 /* If there already is an direct call (i.e. as a result of inliner's
1284 substitution), forget about speculating. */
1286 e
= e
->resolve_speculation (decl
);
1287 /* If types do not match, speculation was likely wrong.
1288 The direct edge was possibly redirected to the clone with a different
1289 signature. We did not update the call statement yet, so compare it
1290 with the reference that still points to the proper type. */
1291 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1292 ref
->referred
->decl
,
1296 fprintf (dump_file
, "Not expanding speculative call of %s -> %s\n"
1298 e
->caller
->dump_name (),
1299 e
->callee
->dump_name ());
1300 e
= e
->resolve_speculation ();
1301 /* We are producing the final function body and will throw away the
1302 callgraph edges really soon. Reset the counts/frequencies to
1303 keep verifier happy in the case of roundoff errors. */
1304 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1306 /* Expand speculation into GIMPLE code. */
1312 "Expanding speculative call of %s -> %s count: ",
1313 e
->caller
->dump_name (),
1314 e
->callee
->dump_name ());
1315 e
->count
.dump (dump_file
);
1316 fprintf (dump_file
, "\n");
1318 gcc_assert (e2
->speculative
);
1319 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1321 profile_probability prob
= e
->count
.probability_in (e
->count
1323 if (!prob
.initialized_p ())
1324 prob
= profile_probability::even ();
1325 new_stmt
= gimple_ic (e
->call_stmt
,
1326 dyn_cast
<cgraph_node
*> (ref
->referred
),
1328 e
->speculative
= false;
1329 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1331 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1332 e2
->speculative
= false;
1333 e2
->count
= gimple_bb (e2
->call_stmt
)->count
;
1334 ref
->speculative
= false;
1336 /* Indirect edges are not both in the call site hash.
1338 if (e
->caller
->call_site_hash
)
1339 cgraph_update_edge_in_call_site_hash (e2
);
1341 /* Continue redirecting E to proper target. */
1346 if (e
->indirect_unknown_callee
1347 || decl
== e
->callee
->decl
)
1348 return e
->call_stmt
;
1350 if (flag_checking
&& decl
)
1352 cgraph_node
*node
= cgraph_node::get (decl
);
1353 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1356 if (symtab
->dump_file
)
1358 fprintf (symtab
->dump_file
, "updating call of %s -> %s: ",
1359 e
->caller
->dump_name (), e
->callee
->dump_name ());
1360 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1361 if (e
->callee
->clone
.combined_args_to_skip
)
1363 fprintf (symtab
->dump_file
, " combined args to skip: ");
1364 dump_bitmap (symtab
->dump_file
,
1365 e
->callee
->clone
.combined_args_to_skip
);
1369 if (e
->callee
->clone
.combined_args_to_skip
)
1373 new_stmt
= e
->call_stmt
;
1374 if (e
->callee
->clone
.combined_args_to_skip
)
1376 = gimple_call_copy_skip_args (new_stmt
,
1377 e
->callee
->clone
.combined_args_to_skip
);
1378 tree old_fntype
= gimple_call_fntype (e
->call_stmt
);
1379 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1380 cgraph_node
*origin
= e
->callee
;
1381 while (origin
->clone_of
)
1382 origin
= origin
->clone_of
;
1384 if ((origin
->former_clone_of
1385 && old_fntype
== TREE_TYPE (origin
->former_clone_of
))
1386 || old_fntype
== TREE_TYPE (origin
->decl
))
1387 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1390 bitmap skip
= e
->callee
->clone
.combined_args_to_skip
;
1391 tree t
= cgraph_build_function_type_skip_args (old_fntype
, skip
,
1393 gimple_call_set_fntype (new_stmt
, t
);
1396 if (gimple_vdef (new_stmt
)
1397 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1398 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1400 gsi
= gsi_for_stmt (e
->call_stmt
);
1402 /* For optimized away parameters, add on the caller side
1404 DEBUG D#X => parm_Y(D)
1405 stmts and associate D#X with parm in decl_debug_args_lookup
1406 vector to say for debug info that if parameter parm had been passed,
1407 it would have value parm_Y(D). */
1408 if (e
->callee
->clone
.combined_args_to_skip
&& MAY_HAVE_DEBUG_BIND_STMTS
)
1410 vec
<tree
, va_gc
> **debug_args
1411 = decl_debug_args_lookup (e
->callee
->decl
);
1412 tree old_decl
= gimple_call_fndecl (e
->call_stmt
);
1413 if (debug_args
&& old_decl
)
1416 unsigned i
= 0, num
;
1417 unsigned len
= vec_safe_length (*debug_args
);
1418 unsigned nargs
= gimple_call_num_args (e
->call_stmt
);
1419 for (parm
= DECL_ARGUMENTS (old_decl
), num
= 0;
1420 parm
&& num
< nargs
;
1421 parm
= DECL_CHAIN (parm
), num
++)
1422 if (bitmap_bit_p (e
->callee
->clone
.combined_args_to_skip
, num
)
1423 && is_gimple_reg (parm
))
1427 while (i
< len
&& (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1433 && (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1438 tree ddecl
= (**debug_args
)[i
+ 1];
1439 tree arg
= gimple_call_arg (e
->call_stmt
, num
);
1440 if (!useless_type_conversion_p (TREE_TYPE (ddecl
),
1444 if (!fold_convertible_p (TREE_TYPE (ddecl
), arg
))
1446 if (TREE_CODE (arg
) == SSA_NAME
1447 && gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg
))
1449 = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (arg
)))
1450 && useless_type_conversion_p (TREE_TYPE (ddecl
),
1454 arg
= fold_convert (TREE_TYPE (ddecl
), arg
);
1458 = gimple_build_debug_bind (ddecl
, unshare_expr (arg
),
1460 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
1465 gsi_replace (&gsi
, new_stmt
, false);
1466 /* We need to defer cleaning EH info on the new statement to
1467 fixup-cfg. We may not have dominator information at this point
1468 and thus would end up with unreachable blocks and have no way
1469 to communicate that we need to run CFG cleanup then. */
1470 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1473 remove_stmt_from_eh_lp (e
->call_stmt
);
1474 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1479 new_stmt
= e
->call_stmt
;
1480 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1481 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1484 /* If changing the call to __cxa_pure_virtual or similar noreturn function,
1485 adjust gimple_call_fntype too. */
1486 if (gimple_call_noreturn_p (new_stmt
)
1487 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e
->callee
->decl
)))
1488 && TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
))
1489 && (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
)))
1491 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1493 /* If the call becomes noreturn, remove the LHS if possible. */
1494 tree lhs
= gimple_call_lhs (new_stmt
);
1496 && gimple_call_noreturn_p (new_stmt
)
1497 && (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt
)))
1498 || should_remove_lhs_p (lhs
)))
1500 if (TREE_CODE (lhs
) == SSA_NAME
)
1502 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1503 TREE_TYPE (lhs
), NULL
);
1504 var
= get_or_create_ssa_default_def
1505 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1506 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1507 gsi
= gsi_for_stmt (new_stmt
);
1508 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1509 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1511 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1512 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1515 /* If new callee has no static chain, remove it. */
1516 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1518 gimple_call_set_chain (new_stmt
, NULL
);
1519 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1522 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1525 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1527 if (symtab
->dump_file
)
1529 fprintf (symtab
->dump_file
, " updated to:");
1530 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1535 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1536 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1537 of OLD_STMT if it was previously call statement.
1538 If NEW_STMT is NULL, the call has been dropped without any
1542 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1543 gimple
*old_stmt
, tree old_call
,
1546 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1547 ? gimple_call_fndecl (new_stmt
) : 0;
1549 /* We are seeing indirect calls, then there is nothing to update. */
1550 if (!new_call
&& !old_call
)
1552 /* See if we turned indirect call into direct call or folded call to one builtin
1553 into different builtin. */
1554 if (old_call
!= new_call
)
1556 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1557 cgraph_edge
*ne
= NULL
;
1558 profile_count count
;
1562 /* Keep calls marked as dead dead. */
1563 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1564 && fndecl_built_in_p (e
->callee
->decl
, BUILT_IN_UNREACHABLE
))
1566 node
->get_edge (old_stmt
)->set_call_stmt
1567 (as_a
<gcall
*> (new_stmt
));
1570 /* See if the edge is already there and has the correct callee. It
1571 might be so because of indirect inlining has already updated
1572 it. We also might've cloned and redirected the edge. */
1573 if (new_call
&& e
->callee
)
1575 cgraph_node
*callee
= e
->callee
;
1578 if (callee
->decl
== new_call
1579 || callee
->former_clone_of
== new_call
)
1581 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1584 callee
= callee
->clone_of
;
1588 /* Otherwise remove edge and create new one; we can't simply redirect
1589 since function has changed, so inline plan and other information
1590 attached to edge is invalid. */
1592 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1595 e
->callee
->remove_symbol_and_inline_clones ();
1599 /* We are seeing new direct call; compute profile info based on BB. */
1600 basic_block bb
= gimple_bb (new_stmt
);
1606 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1607 as_a
<gcall
*> (new_stmt
), count
);
1608 gcc_assert (ne
->inline_failed
);
1611 /* We only updated the call stmt; update pointer in cgraph edge.. */
1612 else if (old_stmt
!= new_stmt
)
1613 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1616 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1617 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1618 of OLD_STMT before it was updated (updating can happen inplace). */
1621 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1624 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1627 gcc_checking_assert (orig
);
1628 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1630 for (node
= orig
->clones
; node
!= orig
;)
1632 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1634 node
= node
->clones
;
1635 else if (node
->next_sibling_clone
)
1636 node
= node
->next_sibling_clone
;
1639 while (node
!= orig
&& !node
->next_sibling_clone
)
1640 node
= node
->clone_of
;
1642 node
= node
->next_sibling_clone
;
1648 /* Remove all callees from the node. */
1651 cgraph_node::remove_callees (void)
1655 /* It is sufficient to remove the edges from the lists of callers of
1656 the callees. The callee list of the node can be zapped with one
1658 for (e
= callees
; e
; e
= f
)
1661 symtab
->call_edge_removal_hooks (e
);
1662 if (!e
->indirect_unknown_callee
)
1663 e
->remove_callee ();
1664 symtab
->free_edge (e
);
1666 for (e
= indirect_calls
; e
; e
= f
)
1669 symtab
->call_edge_removal_hooks (e
);
1670 if (!e
->indirect_unknown_callee
)
1671 e
->remove_callee ();
1672 symtab
->free_edge (e
);
1674 indirect_calls
= NULL
;
1678 call_site_hash
->empty ();
1679 call_site_hash
= NULL
;
1683 /* Remove all callers from the node. */
1686 cgraph_node::remove_callers (void)
1690 /* It is sufficient to remove the edges from the lists of callees of
1691 the callers. The caller list of the node can be zapped with one
1693 for (e
= callers
; e
; e
= f
)
1696 symtab
->call_edge_removal_hooks (e
);
1697 e
->remove_caller ();
1698 symtab
->free_edge (e
);
1703 /* Helper function for cgraph_release_function_body and free_lang_data.
1704 It releases body from function DECL without having to inspect its
1705 possibly non-existent symtab node. */
1708 release_function_body (tree decl
)
1710 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1714 && loops_for_fn (fn
))
1716 fn
->curr_properties
&= ~PROP_loops
;
1717 loop_optimizer_finalize (fn
);
1721 delete_tree_ssa (fn
);
1726 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1727 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1728 delete_tree_cfg_annotations (fn
);
1732 if (fn
->value_histograms
)
1733 free_histograms (fn
);
1734 gimple_set_body (decl
, NULL
);
1735 /* Struct function hangs a lot of data that would leak if we didn't
1736 removed all pointers to it. */
1738 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1740 DECL_SAVED_TREE (decl
) = NULL
;
1743 /* Release memory used to represent body of function.
1744 Use this only for functions that are released before being translated to
1745 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1746 are free'd in final.c via free_after_compilation().
1747 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1750 cgraph_node::release_body (bool keep_arguments
)
1752 ipa_transforms_to_apply
.release ();
1753 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1755 DECL_RESULT (decl
) = NULL
;
1757 if (!keep_arguments
)
1758 DECL_ARGUMENTS (decl
) = NULL
;
1760 /* If the node is abstract and needed, then do not clear
1761 DECL_INITIAL of its associated function declaration because it's
1762 needed to emit debug info later. */
1763 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1764 DECL_INITIAL (decl
) = error_mark_node
;
1765 release_function_body (decl
);
1768 lto_free_function_in_decl_state_for_node (this);
1769 lto_file_data
= NULL
;
1773 /* Remove function from symbol table. */
1776 cgraph_node::remove (void)
1780 if (symtab
->ipa_clones_dump_file
&& symtab
->cloned_nodes
.contains (this))
1781 fprintf (symtab
->ipa_clones_dump_file
,
1782 "Callgraph removal;%s;%d;%s;%d;%d\n", asm_name (), order
,
1783 DECL_SOURCE_FILE (decl
), DECL_SOURCE_LINE (decl
),
1784 DECL_SOURCE_COLUMN (decl
));
1786 symtab
->call_cgraph_removal_hooks (this);
1789 ipa_transforms_to_apply
.release ();
1790 delete_function_version (function_version ());
1792 /* Incremental inlining access removed nodes stored in the postorder list.
1794 force_output
= false;
1795 forced_by_abi
= false;
1796 for (n
= nested
; n
; n
= n
->next_nested
)
1801 cgraph_node
**node2
= &origin
->nested
;
1803 while (*node2
!= this)
1804 node2
= &(*node2
)->next_nested
;
1805 *node2
= next_nested
;
1808 if (prev_sibling_clone
)
1809 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1811 clone_of
->clones
= next_sibling_clone
;
1812 if (next_sibling_clone
)
1813 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1816 cgraph_node
*n
, *next
;
1820 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1821 n
->clone_of
= clone_of
;
1822 n
->clone_of
= clone_of
;
1823 n
->next_sibling_clone
= clone_of
->clones
;
1824 if (clone_of
->clones
)
1825 clone_of
->clones
->prev_sibling_clone
= n
;
1826 clone_of
->clones
= clones
;
1830 /* We are removing node with clones. This makes clones inconsistent,
1831 but assume they will be removed subsequently and just keep clone
1832 tree intact. This can happen in unreachable function removal since
1833 we remove unreachable functions in random order, not by bottom-up
1834 walk of clone trees. */
1835 for (n
= clones
; n
; n
= next
)
1837 next
= n
->next_sibling_clone
;
1838 n
->next_sibling_clone
= NULL
;
1839 n
->prev_sibling_clone
= NULL
;
1845 /* While all the clones are removed after being proceeded, the function
1846 itself is kept in the cgraph even after it is compiled. Check whether
1847 we are done with this body and reclaim it proactively if this is the case.
1849 if (symtab
->state
!= LTO_STREAMING
)
1851 n
= cgraph_node::get (decl
);
1853 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1854 && ((symtab
->global_info_ready
|| in_lto_p
)
1855 && (TREE_ASM_WRITTEN (n
->decl
)
1856 || DECL_EXTERNAL (n
->decl
)
1858 || (!flag_wpa
&& n
->in_other_partition
)))))
1863 lto_free_function_in_decl_state_for_node (this);
1864 lto_file_data
= NULL
;
1870 call_site_hash
->empty ();
1871 call_site_hash
= NULL
;
1874 symtab
->release_symbol (this);
1877 /* Likewise indicate that a node is having address taken. */
1880 cgraph_node::mark_address_taken (void)
1882 /* Indirect inlining can figure out that all uses of the address are
1884 if (global
.inlined_to
)
1886 gcc_assert (cfun
->after_inlining
);
1887 gcc_assert (callers
->indirect_inlining_edge
);
1890 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1891 IPA_REF_ADDR reference exists (and thus it should be set on node
1892 representing alias we take address of) and as a test whether address
1893 of the object was taken (and thus it should be set on node alias is
1894 referring to). We should remove the first use and the remove the
1897 cgraph_node
*node
= ultimate_alias_target ();
1898 node
->address_taken
= 1;
1901 /* Return local info for the compiled function. */
1904 cgraph_node::local_info (tree decl
)
1906 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1907 cgraph_node
*node
= get (decl
);
1910 return &node
->ultimate_alias_target ()->local
;
1913 /* Return local info for the compiled function. */
1916 cgraph_node::rtl_info (tree decl
)
1918 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1919 cgraph_node
*node
= get (decl
);
1922 enum availability avail
;
1923 node
= node
->ultimate_alias_target (&avail
);
1924 if (decl
!= current_function_decl
1925 && (avail
< AVAIL_AVAILABLE
1926 || (node
->decl
!= current_function_decl
1927 && !TREE_ASM_WRITTEN (node
->decl
))))
1929 /* Allocate if it doesn't exist. */
1930 if (node
->rtl
== NULL
)
1931 node
->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1935 /* Return a string describing the failure REASON. */
1938 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1941 #define DEFCIFCODE(code, type, string) string,
1943 static const char *cif_string_table
[CIF_N_REASONS
] = {
1944 #include "cif-code.def"
1947 /* Signedness of an enum type is implementation defined, so cast it
1948 to unsigned before testing. */
1949 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1950 return cif_string_table
[reason
];
1953 /* Return a type describing the failure REASON. */
1955 cgraph_inline_failed_type_t
1956 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1959 #define DEFCIFCODE(code, type, string) type,
1961 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1962 #include "cif-code.def"
1965 /* Signedness of an enum type is implementation defined, so cast it
1966 to unsigned before testing. */
1967 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1968 return cif_type_table
[reason
];
1971 /* Names used to print out the availability enum. */
1972 const char * const cgraph_availability_names
[] =
1973 {"unset", "not_available", "overwritable", "available", "local"};
1975 /* Output flags of edge to a file F. */
1978 cgraph_edge::dump_edge_flags (FILE *f
)
1981 fprintf (f
, "(speculative) ");
1983 fprintf (f
, "(inlined) ");
1984 if (call_stmt_cannot_inline_p
)
1985 fprintf (f
, "(call_stmt_cannot_inline_p) ");
1986 if (indirect_inlining_edge
)
1987 fprintf (f
, "(indirect_inlining) ");
1988 if (count
.initialized_p ())
1993 fprintf (f
, "%.2f per call) ", sreal_frequency ().to_double ());
1995 if (can_throw_external
)
1996 fprintf (f
, "(can throw external) ");
1999 /* Dump call graph node to file F. */
2002 cgraph_node::dump (FILE *f
)
2008 if (global
.inlined_to
)
2009 fprintf (f
, " Function %s is inline copy in %s\n",
2011 global
.inlined_to
->dump_name ());
2013 fprintf (f
, " Clone of %s\n", clone_of
->dump_asm_name ());
2014 if (symtab
->function_flags_ready
)
2015 fprintf (f
, " Availability: %s\n",
2016 cgraph_availability_names
[get_availability ()]);
2019 fprintf (f
, " Profile id: %i\n",
2021 fprintf (f
, " First run: %i\n", tp_first_run
);
2022 cgraph_function_version_info
*vi
= function_version ();
2025 fprintf (f
, " Version info: ");
2026 if (vi
->prev
!= NULL
)
2028 fprintf (f
, "prev: ");
2029 fprintf (f
, "%s ", vi
->prev
->this_node
->dump_asm_name ());
2031 if (vi
->next
!= NULL
)
2033 fprintf (f
, "next: ");
2034 fprintf (f
, "%s ", vi
->next
->this_node
->dump_asm_name ());
2036 if (vi
->dispatcher_resolver
!= NULL_TREE
)
2037 fprintf (f
, "dispatcher: %s",
2038 lang_hooks
.decl_printable_name (vi
->dispatcher_resolver
, 2));
2042 fprintf (f
, " Function flags:");
2043 if (count
.initialized_p ())
2045 fprintf (f
, " count: ");
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 (only_called_at_startup
)
2087 fprintf (f
, " only_called_at_startup");
2088 if (only_called_at_exit
)
2089 fprintf (f
, " only_called_at_exit");
2090 if (opt_for_fn (decl
, optimize_size
))
2091 fprintf (f
, " optimize_size");
2092 if (parallelized_function
)
2093 fprintf (f
, " parallelized_function");
2099 fprintf (f
, " Thunk");
2101 fprintf (f
, " of %s (asm: %s)",
2102 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2103 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2104 fprintf (f
, " fixed offset %i virtual value %i indirect_offset %i "
2105 "has virtual offset %i\n",
2106 (int)thunk
.fixed_offset
,
2107 (int)thunk
.virtual_value
,
2108 (int)thunk
.indirect_offset
,
2109 (int)thunk
.virtual_offset_p
);
2111 if (alias
&& thunk
.alias
2112 && DECL_P (thunk
.alias
))
2114 fprintf (f
, " Alias of %s",
2115 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2116 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2117 fprintf (f
, " (asm: %s)",
2118 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2122 fprintf (f
, " Called by: ");
2124 profile_count sum
= profile_count::zero ();
2125 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2127 fprintf (f
, "%s ", edge
->caller
->dump_name ());
2128 edge
->dump_edge_flags (f
);
2129 if (edge
->count
.initialized_p ())
2130 sum
+= edge
->count
.ipa ();
2133 fprintf (f
, "\n Calls: ");
2134 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2136 fprintf (f
, "%s ", edge
->callee
->dump_name ());
2137 edge
->dump_edge_flags (f
);
2141 if (count
.ipa ().initialized_p ())
2147 FOR_EACH_ALIAS (this, ref
)
2148 if (dyn_cast
<cgraph_node
*> (ref
->referring
)->count
.initialized_p ())
2149 sum
+= dyn_cast
<cgraph_node
*> (ref
->referring
)->count
.ipa ();
2151 if (global
.inlined_to
2152 || (symtab
->state
< EXPANSION
2153 && ultimate_alias_target () == this && only_called_directly_p ()))
2154 ok
= !count
.ipa ().differs_from_p (sum
);
2155 else if (count
.ipa () > profile_count::from_gcov_type (100)
2156 && count
.ipa () < sum
.apply_scale (99, 100))
2157 ok
= false, min
= true;
2160 fprintf (f
, " Invalid sum of caller counts ");
2163 fprintf (f
, ", should be at most ");
2165 fprintf (f
, ", should be ");
2166 count
.ipa ().dump (f
);
2171 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2173 if (edge
->indirect_info
->polymorphic
)
2175 fprintf (f
, " Polymorphic indirect call of type ");
2176 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2177 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2180 fprintf (f
, " Indirect call");
2181 edge
->dump_edge_flags (f
);
2182 if (edge
->indirect_info
->param_index
!= -1)
2184 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2185 if (edge
->indirect_info
->agg_contents
)
2186 fprintf (f
, " loaded from %s %s at offset %i",
2187 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2188 edge
->indirect_info
->by_ref
? "passed by reference":"",
2189 (int)edge
->indirect_info
->offset
);
2190 if (edge
->indirect_info
->vptr_changed
)
2191 fprintf (f
, " (vptr maybe changed)");
2194 if (edge
->indirect_info
->polymorphic
)
2195 edge
->indirect_info
->context
.dump (f
);
2199 /* Dump call graph node NODE to stderr. */
2202 cgraph_node::debug (void)
2207 /* Dump the callgraph to file F. */
2210 cgraph_node::dump_cgraph (FILE *f
)
2214 fprintf (f
, "callgraph:\n\n");
2215 FOR_EACH_FUNCTION (node
)
2219 /* Return true when the DECL can possibly be inlined. */
2222 cgraph_function_possibly_inlined_p (tree decl
)
2224 if (!symtab
->global_info_ready
)
2225 return !DECL_UNINLINABLE (decl
);
2226 return DECL_POSSIBLY_INLINED (decl
);
2229 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2231 cgraph_node::unnest (void)
2233 cgraph_node
**node2
= &origin
->nested
;
2234 gcc_assert (origin
);
2236 while (*node2
!= this)
2237 node2
= &(*node2
)->next_nested
;
2238 *node2
= next_nested
;
2242 /* Return function availability. See cgraph.h for description of individual
2245 cgraph_node::get_availability (symtab_node
*ref
)
2249 cgraph_node
*cref
= dyn_cast
<cgraph_node
*> (ref
);
2251 ref
= cref
->global
.inlined_to
;
2253 enum availability avail
;
2255 avail
= AVAIL_NOT_AVAILABLE
;
2256 else if (local
.local
)
2257 avail
= AVAIL_LOCAL
;
2258 else if (global
.inlined_to
)
2259 avail
= AVAIL_AVAILABLE
;
2260 else if (transparent_alias
)
2261 ultimate_alias_target (&avail
, ref
);
2262 else if (ifunc_resolver
2263 || lookup_attribute ("noipa", DECL_ATTRIBUTES (decl
)))
2264 avail
= AVAIL_INTERPOSABLE
;
2265 else if (!externally_visible
)
2266 avail
= AVAIL_AVAILABLE
;
2267 /* If this is a reference from symbol itself and there are no aliases, we
2268 may be sure that the symbol was not interposed by something else because
2269 the symbol itself would be unreachable otherwise.
2271 Also comdat groups are always resolved in groups. */
2272 else if ((this == ref
&& !has_aliases_p ())
2273 || (ref
&& get_comdat_group ()
2274 && get_comdat_group () == ref
->get_comdat_group ()))
2275 avail
= AVAIL_AVAILABLE
;
2276 /* Inline functions are safe to be analyzed even if their symbol can
2277 be overwritten at runtime. It is not meaningful to enforce any sane
2278 behavior on replacing inline function by different body. */
2279 else if (DECL_DECLARED_INLINE_P (decl
))
2280 avail
= AVAIL_AVAILABLE
;
2282 /* If the function can be overwritten, return OVERWRITABLE. Take
2283 care at least of two notable extensions - the COMDAT functions
2284 used to share template instantiations in C++ (this is symmetric
2285 to code cp_cannot_inline_tree_fn and probably shall be shared and
2286 the inlinability hooks completely eliminated). */
2288 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2289 avail
= AVAIL_INTERPOSABLE
;
2290 else avail
= AVAIL_AVAILABLE
;
2295 /* Worker for cgraph_node_can_be_local_p. */
2297 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2299 return !(!node
->force_output
2300 && ((DECL_COMDAT (node
->decl
)
2301 && !node
->forced_by_abi
2302 && !node
->used_from_object_file_p ()
2303 && !node
->same_comdat_group
)
2304 || !node
->externally_visible
));
2307 /* Return true if cgraph_node can be made local for API change.
2308 Extern inline functions and C++ COMDAT functions can be made local
2309 at the expense of possible code size growth if function is used in multiple
2310 compilation units. */
2312 cgraph_node::can_be_local_p (void)
2314 return (!address_taken
2315 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2319 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2320 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
2321 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2324 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2325 (cgraph_node
*, void *),
2327 bool include_overwritable
,
2328 bool exclude_virtual_thunks
)
2332 enum availability avail
= AVAIL_AVAILABLE
;
2334 if (include_overwritable
2335 || (avail
= get_availability ()) > AVAIL_INTERPOSABLE
)
2337 if (callback (this, data
))
2340 FOR_EACH_ALIAS (this, ref
)
2342 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2343 if (include_overwritable
2344 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2345 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2346 include_overwritable
,
2347 exclude_virtual_thunks
))
2350 if (avail
<= AVAIL_INTERPOSABLE
)
2352 for (e
= callers
; e
; e
= e
->next_caller
)
2353 if (e
->caller
->thunk
.thunk_p
2354 && (include_overwritable
2355 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2356 && !(exclude_virtual_thunks
2357 && e
->caller
->thunk
.virtual_offset_p
))
2358 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2359 include_overwritable
,
2360 exclude_virtual_thunks
))
2366 /* Worker to bring NODE local. */
2369 cgraph_node::make_local (cgraph_node
*node
, void *)
2371 gcc_checking_assert (node
->can_be_local_p ());
2372 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2374 node
->make_decl_local ();
2375 node
->set_section (NULL
);
2376 node
->set_comdat_group (NULL
);
2377 node
->externally_visible
= false;
2378 node
->forced_by_abi
= false;
2379 node
->local
.local
= true;
2380 node
->set_section (NULL
);
2381 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2382 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2383 && !flag_incremental_link
);
2384 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2385 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2390 /* Bring cgraph node local. */
2393 cgraph_node::make_local (void)
2395 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2398 /* Worker to set nothrow flag. */
2401 set_nothrow_flag_1 (cgraph_node
*node
, bool nothrow
, bool non_call
,
2406 if (nothrow
&& !TREE_NOTHROW (node
->decl
))
2408 /* With non-call exceptions we can't say for sure if other function body
2409 was not possibly optimized to stil throw. */
2410 if (!non_call
|| node
->binds_to_current_def_p ())
2412 TREE_NOTHROW (node
->decl
) = true;
2414 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2415 e
->can_throw_external
= false;
2418 else if (!nothrow
&& TREE_NOTHROW (node
->decl
))
2420 TREE_NOTHROW (node
->decl
) = false;
2424 FOR_EACH_ALIAS (node
, ref
)
2426 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2427 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2428 set_nothrow_flag_1 (alias
, nothrow
, non_call
, changed
);
2430 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2431 if (e
->caller
->thunk
.thunk_p
2432 && (!nothrow
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2433 set_nothrow_flag_1 (e
->caller
, nothrow
, non_call
, changed
);
2436 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2437 if any to NOTHROW. */
2440 cgraph_node::set_nothrow_flag (bool nothrow
)
2442 bool changed
= false;
2443 bool non_call
= opt_for_fn (decl
, flag_non_call_exceptions
);
2445 if (!nothrow
|| get_availability () > AVAIL_INTERPOSABLE
)
2446 set_nothrow_flag_1 (this, nothrow
, non_call
, &changed
);
2451 FOR_EACH_ALIAS (this, ref
)
2453 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2454 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2455 set_nothrow_flag_1 (alias
, nothrow
, non_call
, &changed
);
2461 /* Worker to set malloc flag. */
2463 set_malloc_flag_1 (cgraph_node
*node
, bool malloc_p
, bool *changed
)
2465 if (malloc_p
&& !DECL_IS_MALLOC (node
->decl
))
2467 DECL_IS_MALLOC (node
->decl
) = true;
2472 FOR_EACH_ALIAS (node
, ref
)
2474 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2475 if (!malloc_p
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2476 set_malloc_flag_1 (alias
, malloc_p
, changed
);
2479 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2480 if (e
->caller
->thunk
.thunk_p
2481 && (!malloc_p
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2482 set_malloc_flag_1 (e
->caller
, malloc_p
, changed
);
2485 /* Set DECL_IS_MALLOC on NODE's decl and on NODE's aliases if any. */
2488 cgraph_node::set_malloc_flag (bool malloc_p
)
2490 bool changed
= false;
2492 if (!malloc_p
|| get_availability () > AVAIL_INTERPOSABLE
)
2493 set_malloc_flag_1 (this, malloc_p
, &changed
);
2498 FOR_EACH_ALIAS (this, ref
)
2500 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2501 if (!malloc_p
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2502 set_malloc_flag_1 (alias
, malloc_p
, &changed
);
2508 /* Worker to set_const_flag. */
2511 set_const_flag_1 (cgraph_node
*node
, bool set_const
, bool looping
,
2514 /* Static constructors and destructors without a side effect can be
2516 if (set_const
&& !looping
)
2518 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2520 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2523 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2525 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2531 if (TREE_READONLY (node
->decl
))
2533 TREE_READONLY (node
->decl
) = 0;
2534 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2540 /* Consider function:
2547 During early optimization we will turn this into:
2554 Now if this function will be detected as CONST however when interposed
2555 it may end up being just pure. We always must assume the worst
2557 if (TREE_READONLY (node
->decl
))
2559 if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2561 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2565 else if (node
->binds_to_current_def_p ())
2567 TREE_READONLY (node
->decl
) = true;
2568 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2569 DECL_PURE_P (node
->decl
) = false;
2574 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2575 fprintf (dump_file
, "Dropping state to PURE because function does "
2576 "not bind to current def.\n");
2577 if (!DECL_PURE_P (node
->decl
))
2579 DECL_PURE_P (node
->decl
) = true;
2580 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2583 else if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2585 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2592 FOR_EACH_ALIAS (node
, ref
)
2594 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2595 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2596 set_const_flag_1 (alias
, set_const
, looping
, changed
);
2598 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2599 if (e
->caller
->thunk
.thunk_p
2600 && (!set_const
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2602 /* Virtual thunks access virtual offset in the vtable, so they can
2603 only be pure, never const. */
2605 && (e
->caller
->thunk
.virtual_offset_p
2606 || !node
->binds_to_current_def_p (e
->caller
)))
2607 *changed
|= e
->caller
->set_pure_flag (true, looping
);
2609 set_const_flag_1 (e
->caller
, set_const
, looping
, changed
);
2613 /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
2614 If SET_CONST if false, clear the flag.
2616 When setting the flag be careful about possible interposition and
2617 do not set the flag for functions that can be interposet and set pure
2618 flag for functions that can bind to other definition.
2620 Return true if any change was done. */
2623 cgraph_node::set_const_flag (bool set_const
, bool looping
)
2625 bool changed
= false;
2626 if (!set_const
|| get_availability () > AVAIL_INTERPOSABLE
)
2627 set_const_flag_1 (this, set_const
, looping
, &changed
);
2632 FOR_EACH_ALIAS (this, ref
)
2634 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2635 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2636 set_const_flag_1 (alias
, set_const
, looping
, &changed
);
2642 /* Info used by set_pure_flag_1. */
2644 struct set_pure_flag_info
2651 /* Worker to set_pure_flag. */
2654 set_pure_flag_1 (cgraph_node
*node
, void *data
)
2656 struct set_pure_flag_info
*info
= (struct set_pure_flag_info
*)data
;
2657 /* Static constructors and destructors without a side effect can be
2659 if (info
->pure
&& !info
->looping
)
2661 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2663 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2664 info
->changed
= true;
2666 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2668 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2669 info
->changed
= true;
2674 if (!DECL_PURE_P (node
->decl
) && !TREE_READONLY (node
->decl
))
2676 DECL_PURE_P (node
->decl
) = true;
2677 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = info
->looping
;
2678 info
->changed
= true;
2680 else if (DECL_LOOPING_CONST_OR_PURE_P (node
->decl
)
2683 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2684 info
->changed
= true;
2689 if (DECL_PURE_P (node
->decl
))
2691 DECL_PURE_P (node
->decl
) = false;
2692 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2693 info
->changed
= true;
2699 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2702 When setting the flag, be careful about possible interposition.
2703 Return true if any change was done. */
2706 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2708 struct set_pure_flag_info info
= {pure
, looping
, false};
2711 call_for_symbol_thunks_and_aliases (set_pure_flag_1
, &info
, !pure
, true);
2712 return info
.changed
;
2715 /* Return true when cgraph_node can not return or throw and thus
2716 it is safe to ignore its side effects for IPA analysis. */
2719 cgraph_node::cannot_return_p (void)
2721 int flags
= flags_from_decl_or_type (decl
);
2722 if (!opt_for_fn (decl
, flag_exceptions
))
2723 return (flags
& ECF_NORETURN
) != 0;
2725 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2726 == (ECF_NORETURN
| ECF_NOTHROW
));
2729 /* Return true when call of edge can not lead to return from caller
2730 and thus it is safe to ignore its side effects for IPA analysis
2731 when computing side effects of the caller.
2732 FIXME: We could actually mark all edges that have no reaching
2733 patch to the exit block or throw to get better results. */
2735 cgraph_edge::cannot_lead_to_return_p (void)
2737 if (caller
->cannot_return_p ())
2739 if (indirect_unknown_callee
)
2741 int flags
= indirect_info
->ecf_flags
;
2742 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2743 return (flags
& ECF_NORETURN
) != 0;
2745 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2746 == (ECF_NORETURN
| ECF_NOTHROW
));
2749 return callee
->cannot_return_p ();
2752 /* Return true if the call can be hot. */
2755 cgraph_edge::maybe_hot_p (void)
2757 if (!maybe_hot_count_p (NULL
, count
.ipa ()))
2759 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2761 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2763 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2765 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2767 if (opt_for_fn (caller
->decl
, optimize_size
))
2769 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2771 /* If profile is now known yet, be conservative.
2772 FIXME: this predicate is used by early inliner and can do better there. */
2773 if (symtab
->state
< IPA_SSA
)
2775 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2776 && sreal_frequency () * 2 < 3)
2778 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2779 || sreal_frequency () * PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) <= 1)
2784 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2787 nonremovable_p (cgraph_node
*node
, void *)
2789 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2792 /* Return true if whole comdat group can be removed if there are no direct
2796 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2798 struct ipa_ref
*ref
;
2800 /* For local symbols or non-comdat group it is the same as
2801 can_remove_if_no_direct_calls_p. */
2802 if (!externally_visible
|| !same_comdat_group
)
2804 if (DECL_EXTERNAL (decl
))
2808 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2811 if (will_inline
&& address_taken
)
2814 /* Otheriwse check if we can remove the symbol itself and then verify
2815 that only uses of the comdat groups are direct call to THIS
2817 if (!can_remove_if_no_direct_calls_and_refs_p ())
2820 /* Check that all refs come from within the comdat group. */
2821 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2822 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2825 struct cgraph_node
*target
= ultimate_alias_target ();
2826 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2827 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2829 if (!externally_visible
)
2832 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2835 /* If we see different symbol than THIS, be sure to check calls. */
2836 if (next
->ultimate_alias_target () != target
)
2837 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2838 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2842 /* If function is not being inlined, we care only about
2843 references outside of the comdat group. */
2845 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2846 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2852 /* Return true when function cgraph_node can be expected to be removed
2853 from program when direct calls in this compilation unit are removed.
2855 As a special case COMDAT functions are
2856 cgraph_can_remove_if_no_direct_calls_p while the are not
2857 cgraph_only_called_directly_p (it is possible they are called from other
2860 This function behaves as cgraph_only_called_directly_p because eliminating
2861 all uses of COMDAT function does not make it necessarily disappear from
2862 the program unless we are compiling whole program or we do LTO. In this
2863 case we know we win since dynamic linking will not really discard the
2864 linkonce section. */
2867 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2870 gcc_assert (!global
.inlined_to
);
2871 if (DECL_EXTERNAL (decl
))
2874 if (!in_lto_p
&& !flag_whole_program
)
2876 /* If the symbol is in comdat group, we need to verify that whole comdat
2877 group becomes unreachable. Technically we could skip references from
2878 within the group, too. */
2879 if (!only_called_directly_p ())
2881 if (same_comdat_group
&& externally_visible
)
2883 struct cgraph_node
*target
= ultimate_alias_target ();
2885 if (will_inline
&& address_taken
)
2887 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2889 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2891 if (!externally_visible
)
2894 && !next
->only_called_directly_p ())
2897 /* If we see different symbol than THIS,
2898 be sure to check calls. */
2899 if (next
->ultimate_alias_target () != target
)
2900 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2901 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2909 return can_remove_if_no_direct_calls_p (will_inline
);
2913 /* Worker for cgraph_only_called_directly_p. */
2916 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2918 return !node
->only_called_directly_or_aliased_p ();
2921 /* Return true when function cgraph_node and all its aliases are only called
2923 i.e. it is not externally visible, address was not taken and
2924 it is not used in any other non-standard way. */
2927 cgraph_node::only_called_directly_p (void)
2929 gcc_assert (ultimate_alias_target () == this);
2930 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2935 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2938 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2940 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2942 enum availability avail
;
2943 node
->ultimate_alias_target (&avail
);
2945 if (avail
> AVAIL_INTERPOSABLE
)
2946 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2947 if (!cs
->indirect_inlining_edge
2948 && !cs
->caller
->thunk
.thunk_p
)
2949 redirect_callers
->safe_push (cs
);
2953 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2954 cgraph_node (i.e. are not overwritable). */
2957 cgraph_node::collect_callers (void)
2959 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2960 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2961 &redirect_callers
, false);
2962 return redirect_callers
;
2965 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2968 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2970 bool skipped_thunk
= false;
2971 node
= node
->ultimate_alias_target ();
2972 node2
= node2
->ultimate_alias_target ();
2974 /* There are no virtual clones of thunks so check former_clone_of or if we
2975 might have skipped thunks because this adjustments are no longer
2977 while (node
->thunk
.thunk_p
)
2979 if (node2
->former_clone_of
== node
->decl
)
2981 if (!node
->thunk
.this_adjusting
)
2983 node
= node
->callees
->callee
->ultimate_alias_target ();
2984 skipped_thunk
= true;
2989 if (!node2
->clone
.args_to_skip
2990 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2992 if (node2
->former_clone_of
== node
->decl
)
2994 else if (!node2
->clone_of
)
2998 while (node
!= node2
&& node2
)
2999 node2
= node2
->clone_of
;
3000 return node2
!= NULL
;
3003 /* Verify edge count and frequency. */
3006 cgraph_edge::verify_count ()
3008 bool error_found
= false;
3009 if (!count
.verify ())
3011 error ("caller edge count invalid");
3017 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
3019 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
3021 bool fndecl_was_null
= false;
3022 /* debug_gimple_stmt needs correct cfun */
3023 if (cfun
!= this_cfun
)
3024 set_cfun (this_cfun
);
3025 /* ...and an actual current_function_decl */
3026 if (!current_function_decl
)
3028 current_function_decl
= this_cfun
->decl
;
3029 fndecl_was_null
= true;
3031 debug_gimple_stmt (stmt
);
3032 if (fndecl_was_null
)
3033 current_function_decl
= NULL
;
3036 /* Verify that call graph edge corresponds to DECL from the associated
3037 statement. Return true if the verification should fail. */
3040 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
3044 if (!decl
|| callee
->global
.inlined_to
)
3046 if (symtab
->state
== LTO_STREAMING
)
3048 node
= cgraph_node::get (decl
);
3050 /* We do not know if a node from a different partition is an alias or what it
3051 aliases and therefore cannot do the former_clone_of check reliably. When
3052 body_removed is set, we have lost all information about what was alias or
3053 thunk of and also cannot proceed. */
3055 || node
->body_removed
3056 || node
->in_other_partition
3057 || callee
->icf_merged
3058 || callee
->in_other_partition
)
3061 node
= node
->ultimate_alias_target ();
3063 /* Optimizers can redirect unreachable calls or calls triggering undefined
3064 behavior to builtin_unreachable. */
3066 if (fndecl_built_in_p (callee
->decl
, BUILT_IN_UNREACHABLE
))
3069 if (callee
->former_clone_of
!= node
->decl
3070 && (node
!= callee
->ultimate_alias_target ())
3071 && !clone_of_p (node
, callee
))
3077 /* Verify cgraph nodes of given cgraph node. */
3079 cgraph_node::verify_node (void)
3082 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
3083 basic_block this_block
;
3084 gimple_stmt_iterator gsi
;
3085 bool error_found
= false;
3090 timevar_push (TV_CGRAPH_VERIFY
);
3091 error_found
|= verify_base ();
3092 for (e
= callees
; e
; e
= e
->next_callee
)
3095 error ("aux field set for edge %s->%s",
3096 identifier_to_locale (e
->caller
->name ()),
3097 identifier_to_locale (e
->callee
->name ()));
3100 if (!count
.verify ())
3102 error ("cgraph count invalid");
3105 if (global
.inlined_to
&& same_comdat_group
)
3107 error ("inline clone in same comdat group list");
3110 if (!definition
&& !in_other_partition
&& local
.local
)
3112 error ("local symbols must be defined");
3115 if (global
.inlined_to
&& externally_visible
)
3117 error ("externally visible inline clone");
3120 if (global
.inlined_to
&& address_taken
)
3122 error ("inline clone with address taken");
3125 if (global
.inlined_to
&& force_output
)
3127 error ("inline clone is forced to output");
3130 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3134 error ("aux field set for indirect edge from %s",
3135 identifier_to_locale (e
->caller
->name ()));
3138 if (!e
->indirect_unknown_callee
3139 || !e
->indirect_info
)
3141 error ("An indirect edge from %s is not marked as indirect or has "
3142 "associated indirect_info, the corresponding statement is: ",
3143 identifier_to_locale (e
->caller
->name ()));
3144 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3148 bool check_comdat
= comdat_local_p ();
3149 for (e
= callers
; e
; e
= e
->next_caller
)
3151 if (e
->verify_count ())
3154 && !in_same_comdat_group_p (e
->caller
))
3156 error ("comdat-local function called by %s outside its comdat",
3157 identifier_to_locale (e
->caller
->name ()));
3160 if (!e
->inline_failed
)
3162 if (global
.inlined_to
3163 != (e
->caller
->global
.inlined_to
3164 ? e
->caller
->global
.inlined_to
: e
->caller
))
3166 error ("inlined_to pointer is wrong");
3169 if (callers
->next_caller
)
3171 error ("multiple inline callers");
3176 if (global
.inlined_to
)
3178 error ("inlined_to pointer set for noninline callers");
3182 for (e
= callees
; e
; e
= e
->next_callee
)
3184 if (e
->verify_count ())
3186 if (gimple_has_body_p (e
->caller
->decl
)
3187 && !e
->caller
->global
.inlined_to
3189 /* Optimized out calls are redirected to __builtin_unreachable. */
3190 && (e
->count
.nonzero_p ()
3191 || ! e
->callee
->decl
3192 || !fndecl_built_in_p (e
->callee
->decl
, BUILT_IN_UNREACHABLE
))
3194 == ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl
))->count
3195 && (!e
->count
.ipa_p ()
3196 && e
->count
.differs_from_p (gimple_bb (e
->call_stmt
)->count
)))
3198 error ("caller edge count does not match BB count");
3199 fprintf (stderr
, "edge count: ");
3200 e
->count
.dump (stderr
);
3201 fprintf (stderr
, "\n bb count: ");
3202 gimple_bb (e
->call_stmt
)->count
.dump (stderr
);
3203 fprintf (stderr
, "\n");
3207 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3209 if (e
->verify_count ())
3211 if (gimple_has_body_p (e
->caller
->decl
)
3212 && !e
->caller
->global
.inlined_to
3214 && e
->count
.ipa_p ()
3216 == ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (decl
))->count
3217 && (!e
->count
.ipa_p ()
3218 && e
->count
.differs_from_p (gimple_bb (e
->call_stmt
)->count
)))
3220 error ("indirect call count does not match BB count");
3221 fprintf (stderr
, "edge count: ");
3222 e
->count
.dump (stderr
);
3223 fprintf (stderr
, "\n bb count: ");
3224 gimple_bb (e
->call_stmt
)->count
.dump (stderr
);
3225 fprintf (stderr
, "\n");
3229 if (!callers
&& global
.inlined_to
)
3231 error ("inlined_to pointer is set but no predecessors found");
3234 if (global
.inlined_to
== this)
3236 error ("inlined_to pointer refers to itself");
3243 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
3248 error ("cgraph_node has wrong clone_of");
3255 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
3256 if (n
->clone_of
!= this)
3260 error ("cgraph_node has wrong clone list");
3264 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
3266 error ("cgraph_node is in clone list but it is not clone");
3269 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
3271 error ("cgraph_node has wrong prev_clone pointer");
3274 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
3276 error ("double linked list of clones corrupted");
3280 if (analyzed
&& alias
)
3282 bool ref_found
= false;
3284 ipa_ref
*ref
= NULL
;
3288 error ("Alias has call edges");
3291 for (i
= 0; iterate_reference (i
, ref
); i
++)
3292 if (ref
->use
!= IPA_REF_ALIAS
)
3294 error ("Alias has non-alias reference");
3299 error ("Alias has more than one alias reference");
3306 error ("Analyzed alias has no reference");
3311 if (analyzed
&& thunk
.thunk_p
)
3315 error ("No edge out of thunk node");
3318 else if (callees
->next_callee
)
3320 error ("More than one edge out of thunk node");
3323 if (gimple_has_body_p (decl
) && !global
.inlined_to
)
3325 error ("Thunk is not supposed to have body");
3329 else if (analyzed
&& gimple_has_body_p (decl
)
3330 && !TREE_ASM_WRITTEN (decl
)
3331 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3336 hash_set
<gimple
*> stmts
;
3338 ipa_ref
*ref
= NULL
;
3340 /* Reach the trees by walking over the CFG, and note the
3341 enclosing basic-blocks in the call edges. */
3342 FOR_EACH_BB_FN (this_block
, this_cfun
)
3344 for (gsi
= gsi_start_phis (this_block
);
3345 !gsi_end_p (gsi
); gsi_next (&gsi
))
3346 stmts
.add (gsi_stmt (gsi
));
3347 for (gsi
= gsi_start_bb (this_block
);
3351 gimple
*stmt
= gsi_stmt (gsi
);
3353 if (is_gimple_call (stmt
))
3355 cgraph_edge
*e
= get_edge (stmt
);
3356 tree decl
= gimple_call_fndecl (stmt
);
3361 error ("shared call_stmt:");
3362 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3365 if (!e
->indirect_unknown_callee
)
3367 if (e
->verify_corresponds_to_fndecl (decl
))
3369 error ("edge points to wrong declaration:");
3370 debug_tree (e
->callee
->decl
);
3371 fprintf (stderr
," Instead of:");
3378 error ("an indirect edge with unknown callee "
3379 "corresponding to a call_stmt with "
3380 "a known declaration:");
3382 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3388 error ("missing callgraph edge for call stmt:");
3389 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3395 for (i
= 0; iterate_reference (i
, ref
); i
++)
3396 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3398 error ("reference to dead statement");
3399 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3404 /* No CFG available?! */
3407 for (e
= callees
; e
; e
= e
->next_callee
)
3411 error ("edge %s->%s has no corresponding call_stmt",
3412 identifier_to_locale (e
->caller
->name ()),
3413 identifier_to_locale (e
->callee
->name ()));
3414 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3419 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3421 if (!e
->aux
&& !e
->speculative
)
3423 error ("an indirect edge from %s has no corresponding call_stmt",
3424 identifier_to_locale (e
->caller
->name ()));
3425 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3434 internal_error ("verify_cgraph_node failed");
3436 timevar_pop (TV_CGRAPH_VERIFY
);
3439 /* Verify whole cgraph structure. */
3441 cgraph_node::verify_cgraph_nodes (void)
3448 FOR_EACH_FUNCTION (node
)
3452 /* Walk the alias chain to return the function cgraph_node is alias of.
3453 Walk through thunks, too.
3454 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3455 When REF is non-NULL, assume that reference happens in symbol REF
3456 when determining the availability. */
3459 cgraph_node::function_symbol (enum availability
*availability
,
3460 struct symtab_node
*ref
)
3462 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3464 while (node
->thunk
.thunk_p
)
3467 node
= node
->callees
->callee
;
3470 enum availability a
;
3471 a
= node
->get_availability (ref
);
3472 if (a
< *availability
)
3475 node
= node
->ultimate_alias_target (availability
, ref
);
3480 /* Walk the alias chain to return the function cgraph_node is alias of.
3481 Walk through non virtual thunks, too. Thus we return either a function
3482 or a virtual thunk node.
3483 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3484 When REF is non-NULL, assume that reference happens in symbol REF
3485 when determining the availability. */
3488 cgraph_node::function_or_virtual_thunk_symbol
3489 (enum availability
*availability
,
3490 struct symtab_node
*ref
)
3492 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3494 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3497 node
= node
->callees
->callee
;
3500 enum availability a
;
3501 a
= node
->get_availability (ref
);
3502 if (a
< *availability
)
3505 node
= node
->ultimate_alias_target (availability
, ref
);
3510 /* When doing LTO, read cgraph_node's body from disk if it is not already
3514 cgraph_node::get_untransformed_body (void)
3516 lto_file_decl_data
*file_data
;
3517 const char *data
, *name
;
3519 tree decl
= this->decl
;
3521 /* Check if body is already there. Either we have gimple body or
3522 the function is thunk and in that case we set DECL_ARGUMENTS. */
3523 if (DECL_ARGUMENTS (decl
) || gimple_has_body_p (decl
))
3526 gcc_assert (in_lto_p
&& !DECL_RESULT (decl
));
3528 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3530 file_data
= lto_file_data
;
3531 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3533 /* We may have renamed the declaration, e.g., a static function. */
3534 name
= lto_get_decl_name_mapping (file_data
, name
);
3535 struct lto_in_decl_state
*decl_state
3536 = lto_get_function_in_decl_state (file_data
, decl
);
3538 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3539 name
, &len
, decl_state
->compressed
);
3541 fatal_error (input_location
, "%s: section %s is missing",
3542 file_data
->file_name
,
3545 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3548 fprintf (stderr
, " in:%s", IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
3549 lto_input_function_body (file_data
, this, data
);
3550 lto_stats
.num_function_bodies
++;
3551 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3552 data
, len
, decl_state
->compressed
);
3553 lto_free_function_in_decl_state_for_node (this);
3554 /* Keep lto file data so ipa-inline-analysis knows about cross module
3557 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3562 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3563 if it is not already present. When some IPA transformations are scheduled,
3567 cgraph_node::get_body (void)
3571 updated
= get_untransformed_body ();
3573 /* Getting transformed body makes no sense for inline clones;
3574 we should never use this on real clones because they are materialized
3576 TODO: Materializing clones here will likely lead to smaller LTRANS
3578 gcc_assert (!global
.inlined_to
&& !clone_of
);
3579 if (ipa_transforms_to_apply
.exists ())
3581 opt_pass
*saved_current_pass
= current_pass
;
3582 FILE *saved_dump_file
= dump_file
;
3583 const char *saved_dump_file_name
= dump_file_name
;
3584 dump_flags_t saved_dump_flags
= dump_flags
;
3585 dump_file_name
= NULL
;
3586 set_dump_file (NULL
);
3588 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3589 execute_all_ipa_transforms ();
3590 cgraph_edge::rebuild_edges ();
3591 free_dominance_info (CDI_DOMINATORS
);
3592 free_dominance_info (CDI_POST_DOMINATORS
);
3596 current_pass
= saved_current_pass
;
3597 set_dump_file (saved_dump_file
);
3598 dump_file_name
= saved_dump_file_name
;
3599 dump_flags
= saved_dump_flags
;
3604 /* Return the DECL_STRUCT_FUNCTION of the function. */
3607 cgraph_node::get_fun (void)
3609 cgraph_node
*node
= this;
3610 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3612 while (!fun
&& node
->clone_of
)
3614 node
= node
->clone_of
;
3615 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3621 /* Verify if the type of the argument matches that of the function
3622 declaration. If we cannot verify this or there is a mismatch,
3626 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3629 unsigned int i
, nargs
;
3631 /* Calls to internal functions always match their signature. */
3632 if (gimple_call_internal_p (stmt
))
3635 nargs
= gimple_call_num_args (stmt
);
3637 /* Get argument types for verification. */
3639 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3641 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3643 /* Verify if the type of the argument matches that of the function
3644 declaration. If we cannot verify this or there is a mismatch,
3646 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3648 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3650 i
++, p
= DECL_CHAIN (p
))
3653 /* We cannot distinguish a varargs function from the case
3654 of excess parameters, still deferring the inlining decision
3655 to the callee is possible. */
3658 arg
= gimple_call_arg (stmt
, i
);
3659 if (p
== error_mark_node
3660 || DECL_ARG_TYPE (p
) == error_mark_node
3661 || arg
== error_mark_node
3662 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3663 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3666 if (args_count_match
&& p
)
3671 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3674 /* If this is a varargs function defer inlining decision
3678 arg
= gimple_call_arg (stmt
, i
);
3679 if (TREE_VALUE (p
) == error_mark_node
3680 || arg
== error_mark_node
3681 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3682 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3683 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3695 /* Verify if the type of the argument and lhs of CALL_STMT matches
3696 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3697 true, the arg count needs to be the same.
3698 If we cannot verify this or there is a mismatch, return false. */
3701 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3702 bool args_count_match
)
3706 if ((DECL_RESULT (callee
)
3707 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3708 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3709 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3711 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3712 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3717 /* Reset all state within cgraph.c so that we can rerun the compiler
3718 within the same process. For use by toplev::finalize. */
3721 cgraph_c_finalize (void)
3725 x_cgraph_nodes_queue
= NULL
;
3727 cgraph_fnver_htab
= NULL
;
3728 version_info_node
= NULL
;
3731 /* A wroker for call_for_symbol_and_aliases. */
3734 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3737 bool include_overwritable
)
3740 FOR_EACH_ALIAS (this, ref
)
3742 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3743 if (include_overwritable
3744 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3745 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3746 include_overwritable
))
3752 /* Return true if NODE has thunk. */
3755 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3757 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3758 if (e
->caller
->thunk
.thunk_p
)
3763 /* Expected frequency of executions within the function. */
3766 cgraph_edge::sreal_frequency ()
3768 return count
.to_sreal_scale (caller
->global
.inlined_to
3769 ? caller
->global
.inlined_to
->count
3773 #include "gt-cgraph.h"