1 /* Callgraph handling code.
2 Copyright (C) 2003-2017 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file contains basic routines manipulating call graph
23 The call-graph is a data structure designed for intra-procedural optimization.
24 It represents a multi-graph where nodes are functions and edges are call sites. */
28 #include "coretypes.h"
35 #include "alloc-pool.h"
36 #include "gimple-ssa.h"
38 #include "lto-streamer.h"
39 #include "fold-const.h"
42 #include "print-tree.h"
43 #include "langhooks.h"
46 #include "gimple-iterator.h"
49 #include "value-prof.h"
50 #include "ipa-utils.h"
51 #include "symbol-summary.h"
54 #include "ipa-inline.h"
56 #include "gimple-pretty-print.h"
60 #include "tree-chkp.h"
64 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
65 #include "tree-pass.h"
67 /* Queue of cgraph nodes scheduled to be lowered. */
68 symtab_node
*x_cgraph_nodes_queue
;
69 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
71 /* Symbol table global context. */
74 /* List of hooks triggered on cgraph_edge events. */
75 struct cgraph_edge_hook_list
{
76 cgraph_edge_hook hook
;
78 struct cgraph_edge_hook_list
*next
;
81 /* List of hooks triggered on cgraph_node events. */
82 struct cgraph_node_hook_list
{
83 cgraph_node_hook hook
;
85 struct cgraph_node_hook_list
*next
;
88 /* List of hooks triggered on events involving two cgraph_edges. */
89 struct cgraph_2edge_hook_list
{
90 cgraph_2edge_hook hook
;
92 struct cgraph_2edge_hook_list
*next
;
95 /* List of hooks triggered on events involving two cgraph_nodes. */
96 struct cgraph_2node_hook_list
{
97 cgraph_2node_hook hook
;
99 struct cgraph_2node_hook_list
*next
;
102 /* Hash descriptor for cgraph_function_version_info. */
104 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
106 static hashval_t
hash (cgraph_function_version_info
*);
107 static bool equal (cgraph_function_version_info
*,
108 cgraph_function_version_info
*);
111 /* Map a cgraph_node to cgraph_function_version_info using this htab.
112 The cgraph_function_version_info has a THIS_NODE field that is the
113 corresponding cgraph_node.. */
115 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
117 /* Hash function for cgraph_fnver_htab. */
119 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
121 int uid
= ptr
->this_node
->uid
;
122 return (hashval_t
)(uid
);
125 /* eq function for cgraph_fnver_htab. */
127 function_version_hasher::equal (cgraph_function_version_info
*n1
,
128 cgraph_function_version_info
*n2
)
130 return n1
->this_node
->uid
== n2
->this_node
->uid
;
133 /* Mark as GC root all allocated nodes. */
134 static GTY(()) struct cgraph_function_version_info
*
135 version_info_node
= NULL
;
137 /* Return true if NODE's address can be compared. */
140 symtab_node::address_can_be_compared_p ()
142 /* Address of virtual tables and functions is never compared. */
143 if (DECL_VIRTUAL_P (decl
))
145 /* Address of C++ cdtors is never compared. */
146 if (is_a
<cgraph_node
*> (this)
147 && (DECL_CXX_CONSTRUCTOR_P (decl
)
148 || DECL_CXX_DESTRUCTOR_P (decl
)))
150 /* Constant pool symbols addresses are never compared.
151 flag_merge_constants permits us to assume the same on readonly vars. */
152 if (is_a
<varpool_node
*> (this)
153 && (DECL_IN_CONSTANT_POOL (decl
)
154 || (flag_merge_constants
>= 2
155 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
160 /* Get the cgraph_function_version_info node corresponding to node. */
161 cgraph_function_version_info
*
162 cgraph_node::function_version (void)
164 cgraph_function_version_info key
;
165 key
.this_node
= this;
167 if (cgraph_fnver_htab
== NULL
)
170 return cgraph_fnver_htab
->find (&key
);
173 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
174 corresponding to cgraph_node NODE. */
175 cgraph_function_version_info
*
176 cgraph_node::insert_new_function_version (void)
178 version_info_node
= NULL
;
179 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
180 version_info_node
->this_node
= this;
182 if (cgraph_fnver_htab
== NULL
)
183 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
185 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
187 return version_info_node
;
190 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
191 DECL is a duplicate declaration. */
193 cgraph_node::delete_function_version (tree decl
)
195 cgraph_node
*decl_node
= cgraph_node::get (decl
);
196 cgraph_function_version_info
*decl_v
= NULL
;
198 if (decl_node
== NULL
)
201 decl_v
= decl_node
->function_version ();
206 if (decl_v
->prev
!= NULL
)
207 decl_v
->prev
->next
= decl_v
->next
;
209 if (decl_v
->next
!= NULL
)
210 decl_v
->next
->prev
= decl_v
->prev
;
212 if (cgraph_fnver_htab
!= NULL
)
213 cgraph_fnver_htab
->remove_elt (decl_v
);
215 decl_node
->remove ();
218 /* Record that DECL1 and DECL2 are semantically identical function
221 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
223 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
224 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
225 cgraph_function_version_info
*decl1_v
= NULL
;
226 cgraph_function_version_info
*decl2_v
= NULL
;
227 cgraph_function_version_info
*before
;
228 cgraph_function_version_info
*after
;
230 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
231 decl1_v
= decl1_node
->function_version ();
232 decl2_v
= decl2_node
->function_version ();
234 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
238 decl1_v
= decl1_node
->insert_new_function_version ();
241 decl2_v
= decl2_node
->insert_new_function_version ();
243 /* Chain decl2_v and decl1_v. All semantically identical versions
244 will be chained together. */
249 while (before
->next
!= NULL
)
250 before
= before
->next
;
252 while (after
->prev
!= NULL
)
255 before
->next
= after
;
256 after
->prev
= before
;
259 /* Initialize callgraph dump file. */
262 symbol_table::initialize (void)
265 dump_file
= dump_begin (TDI_cgraph
, NULL
);
267 if (!ipa_clones_dump_file
)
268 ipa_clones_dump_file
= dump_begin (TDI_clones
, NULL
);
271 /* Allocate new callgraph node and insert it into basic data structures. */
274 symbol_table::create_empty (void)
276 cgraph_node
*node
= allocate_cgraph_symbol ();
278 node
->type
= SYMTAB_FUNCTION
;
279 node
->frequency
= NODE_FREQUENCY_NORMAL
;
280 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
286 /* Register HOOK to be called with DATA on each removed edge. */
287 cgraph_edge_hook_list
*
288 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
290 cgraph_edge_hook_list
*entry
;
291 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
293 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
303 /* Remove ENTRY from the list of hooks called on removing edges. */
305 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
307 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
309 while (*ptr
!= entry
)
315 /* Call all edge removal hooks. */
317 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
319 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
322 entry
->hook (e
, entry
->data
);
327 /* Register HOOK to be called with DATA on each removed node. */
328 cgraph_node_hook_list
*
329 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
331 cgraph_node_hook_list
*entry
;
332 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
334 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
344 /* Remove ENTRY from the list of hooks called on removing nodes. */
346 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
348 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
350 while (*ptr
!= entry
)
356 /* Call all node removal hooks. */
358 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
360 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
363 entry
->hook (node
, entry
->data
);
368 /* Call all node removal hooks. */
370 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
372 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
375 entry
->hook (node
, entry
->data
);
381 /* Register HOOK to be called with DATA on each inserted node. */
382 cgraph_node_hook_list
*
383 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
385 cgraph_node_hook_list
*entry
;
386 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
388 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
398 /* Remove ENTRY from the list of hooks called on inserted nodes. */
400 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
402 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
404 while (*ptr
!= entry
)
410 /* Register HOOK to be called with DATA on each duplicated edge. */
411 cgraph_2edge_hook_list
*
412 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
414 cgraph_2edge_hook_list
*entry
;
415 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
417 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
427 /* Remove ENTRY from the list of hooks called on duplicating edges. */
429 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
431 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
433 while (*ptr
!= entry
)
439 /* Call all edge duplication hooks. */
441 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
443 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
446 entry
->hook (cs1
, cs2
, entry
->data
);
451 /* Register HOOK to be called with DATA on each duplicated node. */
452 cgraph_2node_hook_list
*
453 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
455 cgraph_2node_hook_list
*entry
;
456 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
458 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
468 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
470 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
472 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
474 while (*ptr
!= entry
)
480 /* Call all node duplication hooks. */
482 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
485 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
488 entry
->hook (node
, node2
, entry
->data
);
493 /* Return cgraph node assigned to DECL. Create new one when needed. */
496 cgraph_node::create (tree decl
)
498 cgraph_node
*node
= symtab
->create_empty ();
499 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
503 if ((flag_openacc
|| flag_openmp
)
504 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
506 node
->offloadable
= 1;
507 if (ENABLE_OFFLOADING
)
508 g
->have_offload
= true;
511 node
->register_symbol ();
513 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
515 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
516 node
->next_nested
= node
->origin
->nested
;
517 node
->origin
->nested
= node
;
522 /* Try to find a call graph node for declaration DECL and if it does not exist
523 or if it corresponds to an inline clone, create a new one. */
526 cgraph_node::get_create (tree decl
)
528 cgraph_node
*first_clone
= cgraph_node::get (decl
);
530 if (first_clone
&& !first_clone
->global
.inlined_to
)
533 cgraph_node
*node
= cgraph_node::create (decl
);
536 first_clone
->clone_of
= node
;
537 node
->clones
= first_clone
;
538 symtab
->symtab_prevail_in_asm_name_hash (node
);
539 node
->decl
->decl_with_vis
.symtab_node
= node
;
541 fprintf (dump_file
, "Introduced new external node "
542 "(%s/%i) and turned into root of the clone tree.\n",
543 node
->name (), node
->order
);
546 fprintf (dump_file
, "Introduced new external node "
547 "(%s/%i).\n", node
->name (), node
->order
);
551 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
552 the function body is associated with (not necessarily cgraph_node (DECL). */
555 cgraph_node::create_alias (tree alias
, tree target
)
557 cgraph_node
*alias_node
;
559 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
560 || TREE_CODE (target
) == IDENTIFIER_NODE
);
561 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
562 alias_node
= cgraph_node::get_create (alias
);
563 gcc_assert (!alias_node
->definition
);
564 alias_node
->alias_target
= target
;
565 alias_node
->definition
= true;
566 alias_node
->alias
= true;
567 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
568 alias_node
->transparent_alias
= alias_node
->weakref
= true;
572 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
574 Same body aliases are output whenever the body of DECL is output,
575 and cgraph_node::get (ALIAS) transparently returns
576 cgraph_node::get (DECL). */
579 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
582 #ifndef ASM_OUTPUT_DEF
583 /* If aliases aren't supported by the assembler, fail. */
586 /* Langhooks can create same body aliases of symbols not defined.
587 Those are useless. Drop them on the floor. */
588 if (symtab
->global_info_ready
)
591 n
= cgraph_node::create_alias (alias
, decl
);
592 n
->cpp_implicit_alias
= true;
593 if (symtab
->cpp_implicit_aliases_done
)
594 n
->resolve_alias (cgraph_node::get (decl
));
598 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
599 aliases DECL with an adjustments made into the first parameter.
600 See comments in thunk_adjust for detail on the parameters. */
603 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
604 HOST_WIDE_INT fixed_offset
,
605 HOST_WIDE_INT virtual_value
,
611 node
= cgraph_node::get (alias
);
615 node
= cgraph_node::create (alias
);
616 gcc_checking_assert (!virtual_offset
617 || wi::eq_p (virtual_offset
, virtual_value
));
618 node
->thunk
.fixed_offset
= fixed_offset
;
619 node
->thunk
.this_adjusting
= this_adjusting
;
620 node
->thunk
.virtual_value
= virtual_value
;
621 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
622 node
->thunk
.alias
= real_alias
;
623 node
->thunk
.thunk_p
= true;
624 node
->definition
= true;
629 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
630 Return NULL if there's no such node. */
633 cgraph_node::get_for_asmname (tree asmname
)
635 /* We do not want to look at inline clones. */
636 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
638 node
= node
->next_sharing_asm_name
)
640 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
641 if (cn
&& !cn
->global
.inlined_to
)
647 /* Returns a hash value for X (which really is a cgraph_edge). */
650 cgraph_edge_hasher::hash (cgraph_edge
*e
)
652 /* This is a really poor hash function, but it is what htab_hash_pointer
654 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
657 /* Returns a hash value for X (which really is a cgraph_edge). */
660 cgraph_edge_hasher::hash (gimple
*call_stmt
)
662 /* This is a really poor hash function, but it is what htab_hash_pointer
664 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
667 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
670 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
672 return x
->call_stmt
== y
;
675 /* Add call graph edge E to call site hash of its caller. */
678 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
680 gimple
*call
= e
->call_stmt
;
681 *e
->caller
->call_site_hash
->find_slot_with_hash
682 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
685 /* Add call graph edge E to call site hash of its caller. */
688 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
690 /* There are two speculative edges for every statement (one direct,
691 one indirect); always hash the direct one. */
692 if (e
->speculative
&& e
->indirect_unknown_callee
)
694 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
695 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
698 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
703 gcc_assert (!*slot
|| e
->speculative
);
707 /* Return the callgraph edge representing the GIMPLE_CALL statement
711 cgraph_node::get_edge (gimple
*call_stmt
)
717 return call_site_hash
->find_with_hash
718 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
720 /* This loop may turn out to be performance problem. In such case adding
721 hashtables into call nodes with very many edges is probably best
722 solution. It is not good idea to add pointer into CALL_EXPR itself
723 because we want to make possible having multiple cgraph nodes representing
724 different clones of the same body before the body is actually cloned. */
725 for (e
= callees
; e
; e
= e
->next_callee
)
727 if (e
->call_stmt
== call_stmt
)
733 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
735 if (e
->call_stmt
== call_stmt
)
742 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
743 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
744 cgraph_add_edge_to_call_site_hash (e2
);
745 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
746 cgraph_add_edge_to_call_site_hash (e2
);
753 /* Change field call_stmt of edge to NEW_STMT.
754 If UPDATE_SPECULATIVE and E is any component of speculative
755 edge, then update all components. */
758 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
762 /* Speculative edges has three component, update all of them
764 if (update_speculative
&& speculative
)
766 cgraph_edge
*direct
, *indirect
;
769 speculative_call_info (direct
, indirect
, ref
);
770 direct
->set_call_stmt (new_stmt
, false);
771 indirect
->set_call_stmt (new_stmt
, false);
772 ref
->stmt
= new_stmt
;
776 /* Only direct speculative edges go to call_site_hash. */
777 if (caller
->call_site_hash
778 && (!speculative
|| !indirect_unknown_callee
))
780 caller
->call_site_hash
->remove_elt_with_hash
781 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
784 cgraph_edge
*e
= this;
786 call_stmt
= new_stmt
;
787 if (indirect_unknown_callee
788 && (decl
= gimple_call_fndecl (new_stmt
)))
790 /* Constant propagation (and possibly also inlining?) can turn an
791 indirect call into a direct one. */
792 cgraph_node
*new_callee
= cgraph_node::get (decl
);
794 gcc_checking_assert (new_callee
);
795 e
= make_direct (new_callee
);
798 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
799 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
801 if (e
->caller
->call_site_hash
)
802 cgraph_add_edge_to_call_site_hash (e
);
805 /* Allocate a cgraph_edge structure and fill it with data according to the
806 parameters of which only CALLEE can be NULL (when creating an indirect call
810 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
811 gcall
*call_stmt
, gcov_type count
, int freq
,
812 bool indir_unknown_callee
)
816 /* LTO does not actually have access to the call_stmt since these
817 have not been loaded yet. */
820 /* This is a rather expensive check possibly triggering
821 construction of call stmt hashtable. */
823 gcc_checking_assert (!(e
= caller
->get_edge (call_stmt
))
826 gcc_assert (is_gimple_call (call_stmt
));
832 free_edges
= NEXT_FREE_EDGE (edge
);
836 edge
= ggc_alloc
<cgraph_edge
> ();
837 edge
->uid
= edges_max_uid
++;
843 edge
->caller
= caller
;
844 edge
->callee
= callee
;
845 edge
->prev_caller
= NULL
;
846 edge
->next_caller
= NULL
;
847 edge
->prev_callee
= NULL
;
848 edge
->next_callee
= NULL
;
849 edge
->lto_stmt_uid
= 0;
852 gcc_assert (count
>= 0);
853 edge
->frequency
= freq
;
854 gcc_assert (freq
>= 0);
855 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
857 edge
->call_stmt
= call_stmt
;
858 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
859 edge
->can_throw_external
860 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
863 && callee
&& callee
->decl
864 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
867 edge
->inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
868 edge
->call_stmt_cannot_inline_p
= true;
872 edge
->inline_failed
= CIF_FUNCTION_NOT_CONSIDERED
;
873 edge
->call_stmt_cannot_inline_p
= false;
876 edge
->indirect_info
= NULL
;
877 edge
->indirect_inlining_edge
= 0;
878 edge
->speculative
= false;
879 edge
->indirect_unknown_callee
= indir_unknown_callee
;
880 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
881 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
882 edge
->in_polymorphic_cdtor
883 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
886 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
887 if (call_stmt
&& caller
->call_site_hash
)
888 cgraph_add_edge_to_call_site_hash (edge
);
893 /* Create edge from a given function to CALLEE in the cgraph. */
896 cgraph_node::create_edge (cgraph_node
*callee
,
897 gcall
*call_stmt
, gcov_type count
, int freq
)
899 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
902 initialize_inline_failed (edge
);
904 edge
->next_caller
= callee
->callers
;
906 callee
->callers
->prev_caller
= edge
;
907 edge
->next_callee
= callees
;
909 callees
->prev_callee
= edge
;
911 callee
->callers
= edge
;
916 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
918 cgraph_indirect_call_info
*
919 cgraph_allocate_init_indirect_info (void)
921 cgraph_indirect_call_info
*ii
;
923 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
924 ii
->param_index
= -1;
928 /* Create an indirect edge with a yet-undetermined callee where the call
929 statement destination is a formal parameter of the caller with index
933 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
934 gcov_type count
, int freq
,
935 bool compute_indirect_info
)
937 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
941 initialize_inline_failed (edge
);
943 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
944 edge
->indirect_info
->ecf_flags
= ecf_flags
;
945 edge
->indirect_info
->vptr_changed
= true;
947 /* Record polymorphic call info. */
948 if (compute_indirect_info
950 && (target
= gimple_call_fn (call_stmt
))
951 && virtual_method_call_p (target
))
953 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
955 /* Only record types can have virtual calls. */
956 edge
->indirect_info
->polymorphic
= true;
957 edge
->indirect_info
->param_index
= -1;
958 edge
->indirect_info
->otr_token
959 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
960 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
961 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
962 edge
->indirect_info
->context
= context
;
965 edge
->next_callee
= indirect_calls
;
967 indirect_calls
->prev_callee
= edge
;
968 indirect_calls
= edge
;
973 /* Remove the edge from the list of the callees of the caller. */
976 cgraph_edge::remove_caller (void)
979 prev_callee
->next_callee
= next_callee
;
981 next_callee
->prev_callee
= prev_callee
;
984 if (indirect_unknown_callee
)
985 caller
->indirect_calls
= next_callee
;
987 caller
->callees
= next_callee
;
989 if (caller
->call_site_hash
)
990 caller
->call_site_hash
->remove_elt_with_hash
991 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
994 /* Put the edge onto the free list. */
997 symbol_table::free_edge (cgraph_edge
*e
)
1001 if (e
->indirect_info
)
1002 ggc_free (e
->indirect_info
);
1004 /* Clear out the edge so we do not dangle pointers. */
1005 memset (e
, 0, sizeof (*e
));
1007 NEXT_FREE_EDGE (e
) = free_edges
;
1012 /* Remove the edge in the cgraph. */
1015 cgraph_edge::remove (void)
1017 /* Call all edge removal hooks. */
1018 symtab
->call_edge_removal_hooks (this);
1020 if (!indirect_unknown_callee
)
1021 /* Remove from callers list of the callee. */
1024 /* Remove from callees list of the callers. */
1027 /* Put the edge onto the free list. */
1028 symtab
->free_edge (this);
1031 /* Turn edge into speculative call calling N2. Update
1032 the profile so the direct call is taken COUNT times
1035 At clone materialization time, the indirect call E will
1038 if (call_dest == N2)
1043 At this time the function just creates the direct call,
1044 the referencd representing the if conditional and attaches
1045 them all to the orginal indirect call statement.
1047 Return direct edge created. */
1050 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1051 int direct_frequency
)
1053 cgraph_node
*n
= caller
;
1054 ipa_ref
*ref
= NULL
;
1059 fprintf (dump_file
, "Indirect call -> speculative call"
1060 " %s/%i => %s/%i\n",
1061 xstrdup_for_dump (n
->name ()), n
->order
,
1062 xstrdup_for_dump (n2
->name ()), n2
->order
);
1065 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1066 initialize_inline_failed (e2
);
1067 e2
->speculative
= true;
1068 if (TREE_NOTHROW (n2
->decl
))
1069 e2
->can_throw_external
= false;
1071 e2
->can_throw_external
= can_throw_external
;
1072 e2
->lto_stmt_uid
= lto_stmt_uid
;
1073 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1075 frequency
-= e2
->frequency
;
1076 symtab
->call_edge_duplication_hooks (this, e2
);
1077 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1078 ref
->lto_stmt_uid
= lto_stmt_uid
;
1079 ref
->speculative
= speculative
;
1080 n2
->mark_address_taken ();
1084 /* Speculative call consist of three components:
1085 1) an indirect edge representing the original call
1086 2) an direct edge representing the new call
1087 3) ADDR_EXPR reference representing the speculative check.
1088 All three components are attached to single statement (the indirect
1089 call) and if one of them exists, all of them must exist.
1091 Given speculative call edge, return all three components.
1095 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1096 cgraph_edge
*&indirect
,
1097 ipa_ref
*&reference
)
1102 cgraph_edge
*e
= this;
1104 if (!e
->indirect_unknown_callee
)
1105 for (e2
= e
->caller
->indirect_calls
;
1106 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1107 e2
= e2
->next_callee
)
1112 /* We can take advantage of the call stmt hash. */
1115 e
= e
->caller
->get_edge (e2
->call_stmt
);
1116 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1119 for (e
= e
->caller
->callees
;
1120 e2
->call_stmt
!= e
->call_stmt
1121 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1125 gcc_assert (e
->speculative
&& e2
->speculative
);
1130 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1131 if (ref
->speculative
1132 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1133 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1139 /* Speculative edge always consist of all three components - direct edge,
1140 indirect and reference. */
1142 gcc_assert (e
&& e2
&& ref
);
1145 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1146 Remove the speculative call sequence and return edge representing the call.
1147 It is up to caller to redirect the call as appropriate. */
1150 cgraph_edge::resolve_speculation (tree callee_decl
)
1152 cgraph_edge
*edge
= this;
1156 gcc_assert (edge
->speculative
);
1157 edge
->speculative_call_info (e2
, edge
, ref
);
1159 || !ref
->referred
->semantically_equivalent_p
1160 (symtab_node::get (callee_decl
)))
1166 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1167 "turned out to have contradicting known target ",
1168 xstrdup_for_dump (edge
->caller
->name ()),
1169 edge
->caller
->order
,
1170 xstrdup_for_dump (e2
->callee
->name ()),
1172 print_generic_expr (dump_file
, callee_decl
, 0);
1173 fprintf (dump_file
, "\n");
1177 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1178 xstrdup_for_dump (edge
->caller
->name ()),
1179 edge
->caller
->order
,
1180 xstrdup_for_dump (e2
->callee
->name ()),
1187 cgraph_edge
*tmp
= edge
;
1189 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1192 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1193 in the functions inlined through it. */
1195 edge
->count
+= e2
->count
;
1196 edge
->frequency
+= e2
->frequency
;
1197 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1198 edge
->frequency
= CGRAPH_FREQ_MAX
;
1199 edge
->speculative
= false;
1200 e2
->speculative
= false;
1201 ref
->remove_reference ();
1202 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1205 e2
->callee
->remove_symbol_and_inline_clones ();
1206 if (edge
->caller
->call_site_hash
)
1207 cgraph_update_edge_in_call_site_hash (edge
);
1211 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1212 CALLEE. DELTA is an integer constant that is to be added to the this
1213 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1216 cgraph_edge::make_direct (cgraph_node
*callee
)
1218 cgraph_edge
*edge
= this;
1219 gcc_assert (indirect_unknown_callee
);
1221 /* If we are redirecting speculative call, make it non-speculative. */
1222 if (indirect_unknown_callee
&& speculative
)
1224 edge
= edge
->resolve_speculation (callee
->decl
);
1226 /* On successful speculation just return the pre existing direct edge. */
1227 if (!indirect_unknown_callee
)
1231 indirect_unknown_callee
= 0;
1232 ggc_free (indirect_info
);
1233 indirect_info
= NULL
;
1235 /* Get the edge out of the indirect edge list. */
1237 prev_callee
->next_callee
= next_callee
;
1239 next_callee
->prev_callee
= prev_callee
;
1241 caller
->indirect_calls
= next_callee
;
1243 /* Put it into the normal callee list */
1245 next_callee
= caller
->callees
;
1246 if (caller
->callees
)
1247 caller
->callees
->prev_callee
= edge
;
1248 caller
->callees
= edge
;
1250 /* Insert to callers list of the new callee. */
1251 edge
->set_callee (callee
);
1254 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
, false))
1256 call_stmt_cannot_inline_p
= true;
1257 inline_failed
= CIF_MISMATCHED_ARGUMENTS
;
1260 /* We need to re-determine the inlining status of the edge. */
1261 initialize_inline_failed (edge
);
1265 /* If necessary, change the function declaration in the call statement
1266 associated with E so that it corresponds to the edge callee. */
1269 cgraph_edge::redirect_call_stmt_to_callee (void)
1271 cgraph_edge
*e
= this;
1273 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1275 gimple_stmt_iterator gsi
;
1276 bool skip_bounds
= false;
1284 e
->speculative_call_info (e
, e2
, ref
);
1285 /* If there already is an direct call (i.e. as a result of inliner's
1286 substitution), forget about speculating. */
1288 e
= e
->resolve_speculation (decl
);
1289 /* If types do not match, speculation was likely wrong.
1290 The direct edge was possibly redirected to the clone with a different
1291 signature. We did not update the call statement yet, so compare it
1292 with the reference that still points to the proper type. */
1293 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1294 ref
->referred
->decl
,
1298 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1300 xstrdup_for_dump (e
->caller
->name ()),
1302 xstrdup_for_dump (e
->callee
->name ()),
1304 e
= e
->resolve_speculation ();
1305 /* We are producing the final function body and will throw away the
1306 callgraph edges really soon. Reset the counts/frequencies to
1307 keep verifier happy in the case of roundoff errors. */
1308 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1309 e
->frequency
= compute_call_stmt_bb_frequency
1310 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1312 /* Expand speculation into GIMPLE code. */
1317 "Expanding speculative call of %s/%i -> %s/%i count:"
1319 xstrdup_for_dump (e
->caller
->name ()),
1321 xstrdup_for_dump (e
->callee
->name ()),
1324 gcc_assert (e2
->speculative
);
1325 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1326 new_stmt
= gimple_ic (e
->call_stmt
,
1327 dyn_cast
<cgraph_node
*> (ref
->referred
),
1328 e
->count
|| e2
->count
1329 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1330 e
->count
+ e2
->count
)
1331 : e
->frequency
|| e2
->frequency
1332 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1333 e
->frequency
+ e2
->frequency
)
1334 : REG_BR_PROB_BASE
/ 2,
1335 e
->count
, e
->count
+ e2
->count
);
1336 e
->speculative
= false;
1337 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1340 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1341 processed call stmt. */
1342 if (gimple_call_with_bounds_p (new_stmt
)
1343 && gimple_call_lhs (new_stmt
)
1344 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1346 tree dresult
= gimple_call_lhs (new_stmt
);
1347 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1348 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1349 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1350 struct cgraph_edge
*iedge
1351 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1352 struct cgraph_edge
*dedge
;
1356 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1359 dedge
->frequency
= compute_call_stmt_bb_frequency
1360 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1362 iedge
->frequency
= compute_call_stmt_bb_frequency
1363 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1366 e
->frequency
= compute_call_stmt_bb_frequency
1367 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1368 e2
->frequency
= compute_call_stmt_bb_frequency
1369 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1370 e2
->speculative
= false;
1371 ref
->speculative
= false;
1373 /* Indirect edges are not both in the call site hash.
1375 if (e
->caller
->call_site_hash
)
1376 cgraph_update_edge_in_call_site_hash (e2
);
1378 /* Continue redirecting E to proper target. */
1382 /* We might propagate instrumented function pointer into
1383 not instrumented function and vice versa. In such a
1384 case we need to either fix function declaration or
1385 remove bounds from call statement. */
1386 if (flag_check_pointer_bounds
&& e
->callee
)
1387 skip_bounds
= chkp_redirect_edge (e
);
1389 if (e
->indirect_unknown_callee
1390 || (decl
== e
->callee
->decl
1392 return e
->call_stmt
;
1394 if (flag_checking
&& decl
)
1396 cgraph_node
*node
= cgraph_node::get (decl
);
1397 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1400 if (symtab
->dump_file
)
1402 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1403 xstrdup_for_dump (e
->caller
->name ()), e
->caller
->order
,
1404 xstrdup_for_dump (e
->callee
->name ()), e
->callee
->order
);
1405 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1406 if (e
->callee
->clone
.combined_args_to_skip
)
1408 fprintf (symtab
->dump_file
, " combined args to skip: ");
1409 dump_bitmap (symtab
->dump_file
,
1410 e
->callee
->clone
.combined_args_to_skip
);
1414 if (e
->callee
->clone
.combined_args_to_skip
1419 new_stmt
= e
->call_stmt
;
1420 if (e
->callee
->clone
.combined_args_to_skip
)
1422 = gimple_call_copy_skip_args (new_stmt
,
1423 e
->callee
->clone
.combined_args_to_skip
);
1425 new_stmt
= chkp_copy_call_skip_bounds (new_stmt
);
1427 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1428 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1430 if (gimple_vdef (new_stmt
)
1431 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1432 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1434 gsi
= gsi_for_stmt (e
->call_stmt
);
1436 /* For optimized away parameters, add on the caller side
1438 DEBUG D#X => parm_Y(D)
1439 stmts and associate D#X with parm in decl_debug_args_lookup
1440 vector to say for debug info that if parameter parm had been passed,
1441 it would have value parm_Y(D). */
1442 if (e
->callee
->clone
.combined_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
1444 vec
<tree
, va_gc
> **debug_args
1445 = decl_debug_args_lookup (e
->callee
->decl
);
1446 tree old_decl
= gimple_call_fndecl (e
->call_stmt
);
1447 if (debug_args
&& old_decl
)
1450 unsigned i
= 0, num
;
1451 unsigned len
= vec_safe_length (*debug_args
);
1452 unsigned nargs
= gimple_call_num_args (e
->call_stmt
);
1453 for (parm
= DECL_ARGUMENTS (old_decl
), num
= 0;
1454 parm
&& num
< nargs
;
1455 parm
= DECL_CHAIN (parm
), num
++)
1456 if (bitmap_bit_p (e
->callee
->clone
.combined_args_to_skip
, num
)
1457 && is_gimple_reg (parm
))
1461 while (i
< len
&& (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1467 && (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1472 tree ddecl
= (**debug_args
)[i
+ 1];
1473 tree arg
= gimple_call_arg (e
->call_stmt
, num
);
1474 if (!useless_type_conversion_p (TREE_TYPE (ddecl
),
1478 if (!fold_convertible_p (TREE_TYPE (ddecl
), arg
))
1480 if (TREE_CODE (arg
) == SSA_NAME
1481 && gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg
))
1483 = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (arg
)))
1484 && useless_type_conversion_p (TREE_TYPE (ddecl
),
1488 arg
= fold_convert (TREE_TYPE (ddecl
), arg
);
1492 = gimple_build_debug_bind (ddecl
, unshare_expr (arg
),
1494 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
1499 gsi_replace (&gsi
, new_stmt
, false);
1500 /* We need to defer cleaning EH info on the new statement to
1501 fixup-cfg. We may not have dominator information at this point
1502 and thus would end up with unreachable blocks and have no way
1503 to communicate that we need to run CFG cleanup then. */
1504 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1507 remove_stmt_from_eh_lp (e
->call_stmt
);
1508 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1513 new_stmt
= e
->call_stmt
;
1514 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1515 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1518 /* If changing the call to __cxa_pure_virtual or similar noreturn function,
1519 adjust gimple_call_fntype too. */
1520 if (gimple_call_noreturn_p (new_stmt
)
1521 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e
->callee
->decl
)))
1522 && TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
))
1523 && (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
)))
1525 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1527 /* If the call becomes noreturn, remove the LHS if possible. */
1528 tree lhs
= gimple_call_lhs (new_stmt
);
1530 && gimple_call_noreturn_p (new_stmt
)
1531 && (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt
)))
1532 || should_remove_lhs_p (lhs
)))
1534 if (TREE_CODE (lhs
) == SSA_NAME
)
1536 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1537 TREE_TYPE (lhs
), NULL
);
1538 var
= get_or_create_ssa_default_def
1539 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1540 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1541 gsi
= gsi_for_stmt (new_stmt
);
1542 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1543 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1545 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1546 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1549 /* If new callee has no static chain, remove it. */
1550 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1552 gimple_call_set_chain (new_stmt
, NULL
);
1553 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1556 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1559 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1561 if (symtab
->dump_file
)
1563 fprintf (symtab
->dump_file
, " updated to:");
1564 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1569 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1570 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1571 of OLD_STMT if it was previously call statement.
1572 If NEW_STMT is NULL, the call has been dropped without any
1576 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1577 gimple
*old_stmt
, tree old_call
,
1580 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1581 ? gimple_call_fndecl (new_stmt
) : 0;
1583 /* We are seeing indirect calls, then there is nothing to update. */
1584 if (!new_call
&& !old_call
)
1586 /* See if we turned indirect call into direct call or folded call to one builtin
1587 into different builtin. */
1588 if (old_call
!= new_call
)
1590 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1591 cgraph_edge
*ne
= NULL
;
1597 /* Keep calls marked as dead dead. */
1598 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1599 && DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
1600 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
1602 node
->get_edge (old_stmt
)->set_call_stmt
1603 (as_a
<gcall
*> (new_stmt
));
1606 /* See if the edge is already there and has the correct callee. It
1607 might be so because of indirect inlining has already updated
1608 it. We also might've cloned and redirected the edge. */
1609 if (new_call
&& e
->callee
)
1611 cgraph_node
*callee
= e
->callee
;
1614 if (callee
->decl
== new_call
1615 || callee
->former_clone_of
== new_call
)
1617 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1620 callee
= callee
->clone_of
;
1624 /* Otherwise remove edge and create new one; we can't simply redirect
1625 since function has changed, so inline plan and other information
1626 attached to edge is invalid. */
1628 frequency
= e
->frequency
;
1629 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1632 e
->callee
->remove_symbol_and_inline_clones ();
1636 /* We are seeing new direct call; compute profile info based on BB. */
1637 basic_block bb
= gimple_bb (new_stmt
);
1639 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1645 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1646 as_a
<gcall
*> (new_stmt
), count
,
1648 gcc_assert (ne
->inline_failed
);
1651 /* We only updated the call stmt; update pointer in cgraph edge.. */
1652 else if (old_stmt
!= new_stmt
)
1653 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1656 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1657 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1658 of OLD_STMT before it was updated (updating can happen inplace). */
1661 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1664 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1667 gcc_checking_assert (orig
);
1668 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1670 for (node
= orig
->clones
; node
!= orig
;)
1672 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1674 node
= node
->clones
;
1675 else if (node
->next_sibling_clone
)
1676 node
= node
->next_sibling_clone
;
1679 while (node
!= orig
&& !node
->next_sibling_clone
)
1680 node
= node
->clone_of
;
1682 node
= node
->next_sibling_clone
;
1688 /* Remove all callees from the node. */
1691 cgraph_node::remove_callees (void)
1695 /* It is sufficient to remove the edges from the lists of callers of
1696 the callees. The callee list of the node can be zapped with one
1698 for (e
= callees
; e
; e
= f
)
1701 symtab
->call_edge_removal_hooks (e
);
1702 if (!e
->indirect_unknown_callee
)
1703 e
->remove_callee ();
1704 symtab
->free_edge (e
);
1706 for (e
= indirect_calls
; e
; e
= f
)
1709 symtab
->call_edge_removal_hooks (e
);
1710 if (!e
->indirect_unknown_callee
)
1711 e
->remove_callee ();
1712 symtab
->free_edge (e
);
1714 indirect_calls
= NULL
;
1718 call_site_hash
->empty ();
1719 call_site_hash
= NULL
;
1723 /* Remove all callers from the node. */
1726 cgraph_node::remove_callers (void)
1730 /* It is sufficient to remove the edges from the lists of callees of
1731 the callers. The caller list of the node can be zapped with one
1733 for (e
= callers
; e
; e
= f
)
1736 symtab
->call_edge_removal_hooks (e
);
1737 e
->remove_caller ();
1738 symtab
->free_edge (e
);
1743 /* Helper function for cgraph_release_function_body and free_lang_data.
1744 It releases body from function DECL without having to inspect its
1745 possibly non-existent symtab node. */
1748 release_function_body (tree decl
)
1750 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1754 && loops_for_fn (fn
))
1756 fn
->curr_properties
&= ~PROP_loops
;
1757 loop_optimizer_finalize (fn
);
1761 delete_tree_ssa (fn
);
1766 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1767 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1768 delete_tree_cfg_annotations (fn
);
1772 if (fn
->value_histograms
)
1773 free_histograms (fn
);
1774 gimple_set_body (decl
, NULL
);
1775 /* Struct function hangs a lot of data that would leak if we didn't
1776 removed all pointers to it. */
1778 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1780 DECL_SAVED_TREE (decl
) = NULL
;
1783 /* Release memory used to represent body of function.
1784 Use this only for functions that are released before being translated to
1785 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1786 are free'd in final.c via free_after_compilation().
1787 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1790 cgraph_node::release_body (bool keep_arguments
)
1792 ipa_transforms_to_apply
.release ();
1793 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1795 DECL_RESULT (decl
) = NULL
;
1797 if (!keep_arguments
)
1798 DECL_ARGUMENTS (decl
) = NULL
;
1800 /* If the node is abstract and needed, then do not clear
1801 DECL_INITIAL of its associated function declaration because it's
1802 needed to emit debug info later. */
1803 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1804 DECL_INITIAL (decl
) = error_mark_node
;
1805 release_function_body (decl
);
1808 lto_free_function_in_decl_state_for_node (this);
1809 lto_file_data
= NULL
;
1813 /* Remove function from symbol table. */
1816 cgraph_node::remove (void)
1819 int uid
= this->uid
;
1821 if (symtab
->ipa_clones_dump_file
&& symtab
->cloned_nodes
.contains (this))
1822 fprintf (symtab
->ipa_clones_dump_file
,
1823 "Callgraph removal;%s;%d;%s;%d;%d\n", asm_name (), order
,
1824 DECL_SOURCE_FILE (decl
), DECL_SOURCE_LINE (decl
),
1825 DECL_SOURCE_COLUMN (decl
));
1827 symtab
->call_cgraph_removal_hooks (this);
1830 ipa_transforms_to_apply
.release ();
1832 /* Incremental inlining access removed nodes stored in the postorder list.
1834 force_output
= false;
1835 forced_by_abi
= false;
1836 for (n
= nested
; n
; n
= n
->next_nested
)
1841 cgraph_node
**node2
= &origin
->nested
;
1843 while (*node2
!= this)
1844 node2
= &(*node2
)->next_nested
;
1845 *node2
= next_nested
;
1848 if (prev_sibling_clone
)
1849 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1851 clone_of
->clones
= next_sibling_clone
;
1852 if (next_sibling_clone
)
1853 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1856 cgraph_node
*n
, *next
;
1860 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1861 n
->clone_of
= clone_of
;
1862 n
->clone_of
= clone_of
;
1863 n
->next_sibling_clone
= clone_of
->clones
;
1864 if (clone_of
->clones
)
1865 clone_of
->clones
->prev_sibling_clone
= n
;
1866 clone_of
->clones
= clones
;
1870 /* We are removing node with clones. This makes clones inconsistent,
1871 but assume they will be removed subsequently and just keep clone
1872 tree intact. This can happen in unreachable function removal since
1873 we remove unreachable functions in random order, not by bottom-up
1874 walk of clone trees. */
1875 for (n
= clones
; n
; n
= next
)
1877 next
= n
->next_sibling_clone
;
1878 n
->next_sibling_clone
= NULL
;
1879 n
->prev_sibling_clone
= NULL
;
1885 /* While all the clones are removed after being proceeded, the function
1886 itself is kept in the cgraph even after it is compiled. Check whether
1887 we are done with this body and reclaim it proactively if this is the case.
1889 if (symtab
->state
!= LTO_STREAMING
)
1891 n
= cgraph_node::get (decl
);
1893 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1894 && ((symtab
->global_info_ready
|| in_lto_p
)
1895 && (TREE_ASM_WRITTEN (n
->decl
)
1896 || DECL_EXTERNAL (n
->decl
)
1898 || (!flag_wpa
&& n
->in_other_partition
)))))
1903 lto_free_function_in_decl_state_for_node (this);
1904 lto_file_data
= NULL
;
1910 call_site_hash
->empty ();
1911 call_site_hash
= NULL
;
1914 if (instrumented_version
)
1916 instrumented_version
->instrumented_version
= NULL
;
1917 instrumented_version
= NULL
;
1920 symtab
->release_symbol (this, uid
);
1923 /* Likewise indicate that a node is having address taken. */
1926 cgraph_node::mark_address_taken (void)
1928 /* Indirect inlining can figure out that all uses of the address are
1930 if (global
.inlined_to
)
1932 gcc_assert (cfun
->after_inlining
);
1933 gcc_assert (callers
->indirect_inlining_edge
);
1936 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1937 IPA_REF_ADDR reference exists (and thus it should be set on node
1938 representing alias we take address of) and as a test whether address
1939 of the object was taken (and thus it should be set on node alias is
1940 referring to). We should remove the first use and the remove the
1943 cgraph_node
*node
= ultimate_alias_target ();
1944 node
->address_taken
= 1;
1947 /* Return local info for the compiled function. */
1950 cgraph_node::local_info (tree decl
)
1952 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1953 cgraph_node
*node
= get (decl
);
1956 return &node
->ultimate_alias_target ()->local
;
1959 /* Return local info for the compiled function. */
1962 cgraph_node::rtl_info (tree decl
)
1964 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1965 cgraph_node
*node
= get (decl
);
1968 enum availability avail
;
1969 node
= node
->ultimate_alias_target (&avail
);
1970 if (decl
!= current_function_decl
1971 && (avail
< AVAIL_AVAILABLE
1972 || (node
->decl
!= current_function_decl
1973 && !TREE_ASM_WRITTEN (node
->decl
))))
1975 /* Allocate if it doesn't exist. */
1976 if (node
->rtl
== NULL
)
1977 node
->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1981 /* Return a string describing the failure REASON. */
1984 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1987 #define DEFCIFCODE(code, type, string) string,
1989 static const char *cif_string_table
[CIF_N_REASONS
] = {
1990 #include "cif-code.def"
1993 /* Signedness of an enum type is implementation defined, so cast it
1994 to unsigned before testing. */
1995 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1996 return cif_string_table
[reason
];
1999 /* Return a type describing the failure REASON. */
2001 cgraph_inline_failed_type_t
2002 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
2005 #define DEFCIFCODE(code, type, string) type,
2007 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
2008 #include "cif-code.def"
2011 /* Signedness of an enum type is implementation defined, so cast it
2012 to unsigned before testing. */
2013 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
2014 return cif_type_table
[reason
];
2017 /* Names used to print out the availability enum. */
2018 const char * const cgraph_availability_names
[] =
2019 {"unset", "not_available", "overwritable", "available", "local"};
2021 /* Output flags of edge to a file F. */
2024 cgraph_edge::dump_edge_flags (FILE *f
)
2027 fprintf (f
, "(speculative) ");
2029 fprintf (f
, "(inlined) ");
2030 if (call_stmt_cannot_inline_p
)
2031 fprintf (f
, "(call_stmt_cannot_inline_p) ");
2032 if (indirect_inlining_edge
)
2033 fprintf (f
, "(indirect_inlining) ");
2035 fprintf (f
, "(%" PRId64
"x) ", (int64_t)count
);
2037 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
2038 if (can_throw_external
)
2039 fprintf (f
, "(can throw external) ");
2042 /* Dump call graph node to file F. */
2045 cgraph_node::dump (FILE *f
)
2051 if (global
.inlined_to
)
2052 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
2053 xstrdup_for_dump (name ()),
2055 xstrdup_for_dump (global
.inlined_to
->name ()),
2056 global
.inlined_to
->order
);
2058 fprintf (f
, " Clone of %s/%i\n",
2059 clone_of
->asm_name (),
2061 if (symtab
->function_flags_ready
)
2062 fprintf (f
, " Availability: %s\n",
2063 cgraph_availability_names
[get_availability ()]);
2066 fprintf (f
, " Profile id: %i\n",
2068 fprintf (f
, " First run: %i\n", tp_first_run
);
2069 cgraph_function_version_info
*vi
= function_version ();
2072 fprintf (f
, " Version info: ");
2073 if (vi
->prev
!= NULL
)
2075 fprintf (f
, "prev: ");
2076 fprintf (f
, "%s/%i ", vi
->prev
->this_node
->asm_name (),
2077 vi
->prev
->this_node
->order
);
2079 if (vi
->next
!= NULL
)
2081 fprintf (f
, "next: ");
2082 fprintf (f
, "%s/%i ", vi
->next
->this_node
->asm_name (),
2083 vi
->next
->this_node
->order
);
2085 if (vi
->dispatcher_resolver
!= NULL_TREE
)
2086 fprintf (f
, "dispatcher: %s",
2087 lang_hooks
.decl_printable_name (vi
->dispatcher_resolver
, 2));
2091 fprintf (f
, " Function flags:");
2093 fprintf (f
, " executed %" PRId64
"x",
2096 fprintf (f
, " nested in: %s", origin
->asm_name ());
2097 if (gimple_has_body_p (decl
))
2098 fprintf (f
, " body");
2100 fprintf (f
, " process");
2102 fprintf (f
, " local");
2103 if (local
.redefined_extern_inline
)
2104 fprintf (f
, " redefined_extern_inline");
2105 if (only_called_at_startup
)
2106 fprintf (f
, " only_called_at_startup");
2107 if (only_called_at_exit
)
2108 fprintf (f
, " only_called_at_exit");
2110 fprintf (f
, " tm_clone");
2112 fprintf (f
, " icf_merged");
2114 fprintf (f
, " merged_comdat");
2116 fprintf (f
, " split_part");
2117 if (indirect_call_target
)
2118 fprintf (f
, " indirect_call_target");
2120 fprintf (f
, " nonfreeing_fn");
2121 if (DECL_STATIC_CONSTRUCTOR (decl
))
2122 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2123 if (DECL_STATIC_DESTRUCTOR (decl
))
2124 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2125 if (frequency
== NODE_FREQUENCY_HOT
)
2126 fprintf (f
, " hot");
2127 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2128 fprintf (f
, " unlikely_executed");
2129 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2130 fprintf (f
, " executed_once");
2131 if (only_called_at_startup
)
2132 fprintf (f
, " only_called_at_startup");
2133 if (only_called_at_exit
)
2134 fprintf (f
, " only_called_at_exit");
2135 if (opt_for_fn (decl
, optimize_size
))
2136 fprintf (f
, " optimize_size");
2137 if (parallelized_function
)
2138 fprintf (f
, " parallelized_function");
2144 fprintf (f
, " Thunk");
2146 fprintf (f
, " of %s (asm: %s)",
2147 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2148 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2149 fprintf (f
, " fixed offset %i virtual value %i has "
2150 "virtual offset %i)\n",
2151 (int)thunk
.fixed_offset
,
2152 (int)thunk
.virtual_value
,
2153 (int)thunk
.virtual_offset_p
);
2155 if (alias
&& thunk
.alias
2156 && DECL_P (thunk
.alias
))
2158 fprintf (f
, " Alias of %s",
2159 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2160 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2161 fprintf (f
, " (asm: %s)",
2162 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2166 fprintf (f
, " Called by: ");
2168 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2170 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
2171 edge
->caller
->order
);
2172 edge
->dump_edge_flags (f
);
2175 fprintf (f
, "\n Calls: ");
2176 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2178 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
2179 edge
->callee
->order
);
2180 edge
->dump_edge_flags (f
);
2184 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2186 if (edge
->indirect_info
->polymorphic
)
2188 fprintf (f
, " Polymorphic indirect call of type ");
2189 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2190 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2193 fprintf (f
, " Indirect call");
2194 edge
->dump_edge_flags (f
);
2195 if (edge
->indirect_info
->param_index
!= -1)
2197 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2198 if (edge
->indirect_info
->agg_contents
)
2199 fprintf (f
, " loaded from %s %s at offset %i",
2200 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2201 edge
->indirect_info
->by_ref
? "passed by reference":"",
2202 (int)edge
->indirect_info
->offset
);
2203 if (edge
->indirect_info
->vptr_changed
)
2204 fprintf (f
, " (vptr maybe changed)");
2207 if (edge
->indirect_info
->polymorphic
)
2208 edge
->indirect_info
->context
.dump (f
);
2211 if (instrumentation_clone
)
2212 fprintf (f
, " Is instrumented version.\n");
2213 else if (instrumented_version
)
2214 fprintf (f
, " Has instrumented version.\n");
2217 /* Dump call graph node NODE to stderr. */
2220 cgraph_node::debug (void)
2225 /* Dump the callgraph to file F. */
2228 cgraph_node::dump_cgraph (FILE *f
)
2232 fprintf (f
, "callgraph:\n\n");
2233 FOR_EACH_FUNCTION (node
)
2237 /* Return true when the DECL can possibly be inlined. */
2240 cgraph_function_possibly_inlined_p (tree decl
)
2242 if (!symtab
->global_info_ready
)
2243 return !DECL_UNINLINABLE (decl
);
2244 return DECL_POSSIBLY_INLINED (decl
);
2247 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2249 cgraph_node::unnest (void)
2251 cgraph_node
**node2
= &origin
->nested
;
2252 gcc_assert (origin
);
2254 while (*node2
!= this)
2255 node2
= &(*node2
)->next_nested
;
2256 *node2
= next_nested
;
2260 /* Return function availability. See cgraph.h for description of individual
2263 cgraph_node::get_availability (symtab_node
*ref
)
2267 cgraph_node
*cref
= dyn_cast
<cgraph_node
*> (ref
);
2269 ref
= cref
->global
.inlined_to
;
2271 enum availability avail
;
2273 avail
= AVAIL_NOT_AVAILABLE
;
2274 else if (local
.local
)
2275 avail
= AVAIL_LOCAL
;
2276 else if (global
.inlined_to
)
2277 avail
= AVAIL_AVAILABLE
;
2278 else if (transparent_alias
)
2279 ultimate_alias_target (&avail
, ref
);
2280 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2281 avail
= AVAIL_INTERPOSABLE
;
2282 else if (!externally_visible
)
2283 avail
= AVAIL_AVAILABLE
;
2284 /* If this is a reference from symbol itself and there are no aliases, we
2285 may be sure that the symbol was not interposed by something else because
2286 the symbol itself would be unreachable otherwise.
2288 Also comdat groups are always resolved in groups. */
2289 else if ((this == ref
&& !has_aliases_p ())
2290 || (ref
&& get_comdat_group ()
2291 && get_comdat_group () == ref
->get_comdat_group ()))
2292 avail
= AVAIL_AVAILABLE
;
2293 /* Inline functions are safe to be analyzed even if their symbol can
2294 be overwritten at runtime. It is not meaningful to enforce any sane
2295 behavior on replacing inline function by different body. */
2296 else if (DECL_DECLARED_INLINE_P (decl
))
2297 avail
= AVAIL_AVAILABLE
;
2299 /* If the function can be overwritten, return OVERWRITABLE. Take
2300 care at least of two notable extensions - the COMDAT functions
2301 used to share template instantiations in C++ (this is symmetric
2302 to code cp_cannot_inline_tree_fn and probably shall be shared and
2303 the inlinability hooks completely eliminated). */
2305 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2306 avail
= AVAIL_INTERPOSABLE
;
2307 else avail
= AVAIL_AVAILABLE
;
2312 /* Worker for cgraph_node_can_be_local_p. */
2314 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2316 return !(!node
->force_output
2317 && ((DECL_COMDAT (node
->decl
)
2318 && !node
->forced_by_abi
2319 && !node
->used_from_object_file_p ()
2320 && !node
->same_comdat_group
)
2321 || !node
->externally_visible
));
2324 /* Return true if cgraph_node can be made local for API change.
2325 Extern inline functions and C++ COMDAT functions can be made local
2326 at the expense of possible code size growth if function is used in multiple
2327 compilation units. */
2329 cgraph_node::can_be_local_p (void)
2331 return (!address_taken
2332 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2336 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2337 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
2338 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2341 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2342 (cgraph_node
*, void *),
2344 bool include_overwritable
,
2345 bool exclude_virtual_thunks
)
2349 enum availability avail
= AVAIL_AVAILABLE
;
2351 if (include_overwritable
2352 || (avail
= get_availability ()) > AVAIL_INTERPOSABLE
)
2354 if (callback (this, data
))
2357 FOR_EACH_ALIAS (this, ref
)
2359 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2360 if (include_overwritable
2361 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2362 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2363 include_overwritable
,
2364 exclude_virtual_thunks
))
2367 if (avail
<= AVAIL_INTERPOSABLE
)
2369 for (e
= callers
; e
; e
= e
->next_caller
)
2370 if (e
->caller
->thunk
.thunk_p
2371 && (include_overwritable
2372 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2373 && !(exclude_virtual_thunks
2374 && e
->caller
->thunk
.virtual_offset_p
))
2375 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2376 include_overwritable
,
2377 exclude_virtual_thunks
))
2383 /* Worker to bring NODE local. */
2386 cgraph_node::make_local (cgraph_node
*node
, void *)
2388 gcc_checking_assert (node
->can_be_local_p ());
2389 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2391 node
->make_decl_local ();
2392 node
->set_section (NULL
);
2393 node
->set_comdat_group (NULL
);
2394 node
->externally_visible
= false;
2395 node
->forced_by_abi
= false;
2396 node
->local
.local
= true;
2397 node
->set_section (NULL
);
2398 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2399 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2400 && !flag_incremental_link
);
2401 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2402 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2407 /* Bring cgraph node local. */
2410 cgraph_node::make_local (void)
2412 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2415 /* Worker to set nothrow flag. */
2418 set_nothrow_flag_1 (cgraph_node
*node
, bool nothrow
, bool non_call
,
2423 if (nothrow
&& !TREE_NOTHROW (node
->decl
))
2425 /* With non-call exceptions we can't say for sure if other function body
2426 was not possibly optimized to stil throw. */
2427 if (!non_call
|| node
->binds_to_current_def_p ())
2429 TREE_NOTHROW (node
->decl
) = true;
2431 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2432 e
->can_throw_external
= false;
2435 else if (!nothrow
&& TREE_NOTHROW (node
->decl
))
2437 TREE_NOTHROW (node
->decl
) = false;
2441 FOR_EACH_ALIAS (node
, ref
)
2443 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2444 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2445 set_nothrow_flag_1 (alias
, nothrow
, non_call
, changed
);
2447 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2448 if (e
->caller
->thunk
.thunk_p
2449 && (!nothrow
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2450 set_nothrow_flag_1 (e
->caller
, nothrow
, non_call
, changed
);
2453 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2454 if any to NOTHROW. */
2457 cgraph_node::set_nothrow_flag (bool nothrow
)
2459 bool changed
= false;
2460 bool non_call
= opt_for_fn (decl
, flag_non_call_exceptions
);
2462 if (!nothrow
|| get_availability () > AVAIL_INTERPOSABLE
)
2463 set_nothrow_flag_1 (this, nothrow
, non_call
, &changed
);
2468 FOR_EACH_ALIAS (this, ref
)
2470 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2471 if (!nothrow
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2472 set_nothrow_flag_1 (alias
, nothrow
, non_call
, &changed
);
2478 /* Worker to set_const_flag. */
2481 set_const_flag_1 (cgraph_node
*node
, bool set_const
, bool looping
,
2484 /* Static constructors and destructors without a side effect can be
2486 if (set_const
&& !looping
)
2488 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2490 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2493 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2495 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2501 if (TREE_READONLY (node
->decl
))
2503 TREE_READONLY (node
->decl
) = 0;
2504 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2510 /* Consider function:
2517 During early optimization we will turn this into:
2524 Now if this function will be detected as CONST however when interposed
2525 it may end up being just pure. We always must assume the worst
2527 if (TREE_READONLY (node
->decl
))
2529 if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2531 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2535 else if (node
->binds_to_current_def_p ())
2537 TREE_READONLY (node
->decl
) = true;
2538 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2539 DECL_PURE_P (node
->decl
) = false;
2544 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2545 fprintf (dump_file
, "Dropping state to PURE because function does "
2546 "not bind to current def.\n");
2547 if (!DECL_PURE_P (node
->decl
))
2549 DECL_PURE_P (node
->decl
) = true;
2550 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = looping
;
2553 else if (!looping
&& DECL_LOOPING_CONST_OR_PURE_P (node
->decl
))
2555 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2562 FOR_EACH_ALIAS (node
, ref
)
2564 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2565 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2566 set_const_flag_1 (alias
, set_const
, looping
, changed
);
2568 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
2569 if (e
->caller
->thunk
.thunk_p
2570 && (!set_const
|| e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2572 /* Virtual thunks access virtual offset in the vtable, so they can
2573 only be pure, never const. */
2575 && (e
->caller
->thunk
.virtual_offset_p
2576 || !node
->binds_to_current_def_p (e
->caller
)))
2577 *changed
|= e
->caller
->set_pure_flag (true, looping
);
2579 set_const_flag_1 (e
->caller
, set_const
, looping
, changed
);
2583 /* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
2584 If SET_CONST if false, clear the flag.
2586 When setting the flag be careful about possible interposition and
2587 do not set the flag for functions that can be interposet and set pure
2588 flag for functions that can bind to other definition.
2590 Return true if any change was done. */
2593 cgraph_node::set_const_flag (bool set_const
, bool looping
)
2595 bool changed
= false;
2596 if (!set_const
|| get_availability () > AVAIL_INTERPOSABLE
)
2597 set_const_flag_1 (this, set_const
, looping
, &changed
);
2602 FOR_EACH_ALIAS (this, ref
)
2604 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2605 if (!set_const
|| alias
->get_availability () > AVAIL_INTERPOSABLE
)
2606 set_const_flag_1 (alias
, set_const
, looping
, &changed
);
2612 /* Info used by set_pure_flag_1. */
2614 struct set_pure_flag_info
2621 /* Worker to set_pure_flag. */
2624 set_pure_flag_1 (cgraph_node
*node
, void *data
)
2626 struct set_pure_flag_info
*info
= (struct set_pure_flag_info
*)data
;
2627 /* Static constructors and destructors without a side effect can be
2629 if (info
->pure
&& !info
->looping
)
2631 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2633 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2634 info
->changed
= true;
2636 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2638 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2639 info
->changed
= true;
2644 if (!DECL_PURE_P (node
->decl
) && !TREE_READONLY (node
->decl
))
2646 DECL_PURE_P (node
->decl
) = true;
2647 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = info
->looping
;
2648 info
->changed
= true;
2650 else if (DECL_LOOPING_CONST_OR_PURE_P (node
->decl
)
2653 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2654 info
->changed
= true;
2659 if (DECL_PURE_P (node
->decl
))
2661 DECL_PURE_P (node
->decl
) = false;
2662 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = false;
2663 info
->changed
= true;
2669 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2672 When setting the flag, be careful about possible interposition.
2673 Return true if any change was done. */
2676 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2678 struct set_pure_flag_info info
= {pure
, looping
, false};
2681 call_for_symbol_thunks_and_aliases (set_pure_flag_1
, &info
, !pure
, true);
2682 return info
.changed
;
2685 /* Return true when cgraph_node can not return or throw and thus
2686 it is safe to ignore its side effects for IPA analysis. */
2689 cgraph_node::cannot_return_p (void)
2691 int flags
= flags_from_decl_or_type (decl
);
2692 if (!opt_for_fn (decl
, flag_exceptions
))
2693 return (flags
& ECF_NORETURN
) != 0;
2695 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2696 == (ECF_NORETURN
| ECF_NOTHROW
));
2699 /* Return true when call of edge can not lead to return from caller
2700 and thus it is safe to ignore its side effects for IPA analysis
2701 when computing side effects of the caller.
2702 FIXME: We could actually mark all edges that have no reaching
2703 patch to the exit block or throw to get better results. */
2705 cgraph_edge::cannot_lead_to_return_p (void)
2707 if (caller
->cannot_return_p ())
2709 if (indirect_unknown_callee
)
2711 int flags
= indirect_info
->ecf_flags
;
2712 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2713 return (flags
& ECF_NORETURN
) != 0;
2715 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2716 == (ECF_NORETURN
| ECF_NOTHROW
));
2719 return callee
->cannot_return_p ();
2722 /* Return true if the call can be hot. */
2725 cgraph_edge::maybe_hot_p (void)
2727 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2729 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2730 && !maybe_hot_count_p (NULL
, count
))
2732 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2734 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2736 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2738 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2740 if (opt_for_fn (caller
->decl
, optimize_size
))
2742 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2744 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2745 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2747 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2749 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2750 || frequency
<= (CGRAPH_FREQ_BASE
2751 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2757 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2760 nonremovable_p (cgraph_node
*node
, void *)
2762 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2765 /* Return true if whole comdat group can be removed if there are no direct
2769 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2771 struct ipa_ref
*ref
;
2773 /* For local symbols or non-comdat group it is the same as
2774 can_remove_if_no_direct_calls_p. */
2775 if (!externally_visible
|| !same_comdat_group
)
2777 if (DECL_EXTERNAL (decl
))
2781 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2784 if (will_inline
&& address_taken
)
2787 /* Otheriwse check if we can remove the symbol itself and then verify
2788 that only uses of the comdat groups are direct call to THIS
2790 if (!can_remove_if_no_direct_calls_and_refs_p ())
2793 /* Check that all refs come from within the comdat group. */
2794 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2795 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2798 struct cgraph_node
*target
= ultimate_alias_target ();
2799 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2800 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2802 if (!externally_visible
)
2805 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2808 /* If we see different symbol than THIS, be sure to check calls. */
2809 if (next
->ultimate_alias_target () != target
)
2810 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2811 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2815 /* If function is not being inlined, we care only about
2816 references outside of the comdat group. */
2818 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2819 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2825 /* Return true when function cgraph_node can be expected to be removed
2826 from program when direct calls in this compilation unit are removed.
2828 As a special case COMDAT functions are
2829 cgraph_can_remove_if_no_direct_calls_p while the are not
2830 cgraph_only_called_directly_p (it is possible they are called from other
2833 This function behaves as cgraph_only_called_directly_p because eliminating
2834 all uses of COMDAT function does not make it necessarily disappear from
2835 the program unless we are compiling whole program or we do LTO. In this
2836 case we know we win since dynamic linking will not really discard the
2837 linkonce section. */
2840 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2843 gcc_assert (!global
.inlined_to
);
2844 if (DECL_EXTERNAL (decl
))
2847 if (!in_lto_p
&& !flag_whole_program
)
2849 /* If the symbol is in comdat group, we need to verify that whole comdat
2850 group becomes unreachable. Technically we could skip references from
2851 within the group, too. */
2852 if (!only_called_directly_p ())
2854 if (same_comdat_group
&& externally_visible
)
2856 struct cgraph_node
*target
= ultimate_alias_target ();
2858 if (will_inline
&& address_taken
)
2860 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2862 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2864 if (!externally_visible
)
2867 && !next
->only_called_directly_p ())
2870 /* If we see different symbol than THIS,
2871 be sure to check calls. */
2872 if (next
->ultimate_alias_target () != target
)
2873 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2874 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2882 return can_remove_if_no_direct_calls_p (will_inline
);
2886 /* Worker for cgraph_only_called_directly_p. */
2889 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2891 return !node
->only_called_directly_or_aliased_p ();
2894 /* Return true when function cgraph_node and all its aliases are only called
2896 i.e. it is not externally visible, address was not taken and
2897 it is not used in any other non-standard way. */
2900 cgraph_node::only_called_directly_p (void)
2902 gcc_assert (ultimate_alias_target () == this);
2903 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2908 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2911 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2913 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2915 enum availability avail
;
2916 node
->ultimate_alias_target (&avail
);
2918 if (avail
> AVAIL_INTERPOSABLE
)
2919 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2920 if (!cs
->indirect_inlining_edge
2921 && !cs
->caller
->thunk
.thunk_p
)
2922 redirect_callers
->safe_push (cs
);
2926 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2927 cgraph_node (i.e. are not overwritable). */
2930 cgraph_node::collect_callers (void)
2932 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2933 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2934 &redirect_callers
, false);
2935 return redirect_callers
;
2938 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2941 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2943 bool skipped_thunk
= false;
2944 node
= node
->ultimate_alias_target ();
2945 node2
= node2
->ultimate_alias_target ();
2947 /* There are no virtual clones of thunks so check former_clone_of or if we
2948 might have skipped thunks because this adjustments are no longer
2950 while (node
->thunk
.thunk_p
)
2952 if (node2
->former_clone_of
== node
->decl
)
2954 if (!node
->thunk
.this_adjusting
)
2956 node
= node
->callees
->callee
->ultimate_alias_target ();
2957 skipped_thunk
= true;
2962 if (!node2
->clone
.args_to_skip
2963 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2965 if (node2
->former_clone_of
== node
->decl
)
2967 else if (!node2
->clone_of
)
2971 while (node
!= node2
&& node2
)
2972 node2
= node2
->clone_of
;
2973 return node2
!= NULL
;
2976 /* Verify edge count and frequency. */
2979 cgraph_edge::verify_count_and_frequency ()
2981 bool error_found
= false;
2984 error ("caller edge count is negative");
2989 error ("caller edge frequency is negative");
2992 if (frequency
> CGRAPH_FREQ_MAX
)
2994 error ("caller edge frequency is too large");
3000 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
3002 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
3004 bool fndecl_was_null
= false;
3005 /* debug_gimple_stmt needs correct cfun */
3006 if (cfun
!= this_cfun
)
3007 set_cfun (this_cfun
);
3008 /* ...and an actual current_function_decl */
3009 if (!current_function_decl
)
3011 current_function_decl
= this_cfun
->decl
;
3012 fndecl_was_null
= true;
3014 debug_gimple_stmt (stmt
);
3015 if (fndecl_was_null
)
3016 current_function_decl
= NULL
;
3019 /* Verify that call graph edge corresponds to DECL from the associated
3020 statement. Return true if the verification should fail. */
3023 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
3027 if (!decl
|| callee
->global
.inlined_to
)
3029 if (symtab
->state
== LTO_STREAMING
)
3031 node
= cgraph_node::get (decl
);
3033 /* We do not know if a node from a different partition is an alias or what it
3034 aliases and therefore cannot do the former_clone_of check reliably. When
3035 body_removed is set, we have lost all information about what was alias or
3036 thunk of and also cannot proceed. */
3038 || node
->body_removed
3039 || node
->in_other_partition
3040 || callee
->icf_merged
3041 || callee
->in_other_partition
)
3044 node
= node
->ultimate_alias_target ();
3046 /* Optimizers can redirect unreachable calls or calls triggering undefined
3047 behavior to builtin_unreachable. */
3048 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
3049 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
3052 if (callee
->former_clone_of
!= node
->decl
3053 && (node
!= callee
->ultimate_alias_target ())
3054 && !clone_of_p (node
, callee
))
3060 /* Verify cgraph nodes of given cgraph node. */
3062 cgraph_node::verify_node (void)
3065 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
3066 basic_block this_block
;
3067 gimple_stmt_iterator gsi
;
3068 bool error_found
= false;
3073 timevar_push (TV_CGRAPH_VERIFY
);
3074 error_found
|= verify_base ();
3075 for (e
= callees
; e
; e
= e
->next_callee
)
3078 error ("aux field set for edge %s->%s",
3079 identifier_to_locale (e
->caller
->name ()),
3080 identifier_to_locale (e
->callee
->name ()));
3085 error ("execution count is negative");
3088 if (global
.inlined_to
&& same_comdat_group
)
3090 error ("inline clone in same comdat group list");
3093 if (!definition
&& !in_other_partition
&& local
.local
)
3095 error ("local symbols must be defined");
3098 if (global
.inlined_to
&& externally_visible
)
3100 error ("externally visible inline clone");
3103 if (global
.inlined_to
&& address_taken
)
3105 error ("inline clone with address taken");
3108 if (global
.inlined_to
&& force_output
)
3110 error ("inline clone is forced to output");
3113 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3117 error ("aux field set for indirect edge from %s",
3118 identifier_to_locale (e
->caller
->name ()));
3121 if (!e
->indirect_unknown_callee
3122 || !e
->indirect_info
)
3124 error ("An indirect edge from %s is not marked as indirect or has "
3125 "associated indirect_info, the corresponding statement is: ",
3126 identifier_to_locale (e
->caller
->name ()));
3127 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3131 bool check_comdat
= comdat_local_p ();
3132 for (e
= callers
; e
; e
= e
->next_caller
)
3134 if (e
->verify_count_and_frequency ())
3137 && !in_same_comdat_group_p (e
->caller
))
3139 error ("comdat-local function called by %s outside its comdat",
3140 identifier_to_locale (e
->caller
->name ()));
3143 if (!e
->inline_failed
)
3145 if (global
.inlined_to
3146 != (e
->caller
->global
.inlined_to
3147 ? e
->caller
->global
.inlined_to
: e
->caller
))
3149 error ("inlined_to pointer is wrong");
3152 if (callers
->next_caller
)
3154 error ("multiple inline callers");
3159 if (global
.inlined_to
)
3161 error ("inlined_to pointer set for noninline callers");
3165 for (e
= callees
; e
; e
= e
->next_callee
)
3167 if (e
->verify_count_and_frequency ())
3169 if (gimple_has_body_p (e
->caller
->decl
)
3170 && !e
->caller
->global
.inlined_to
3172 /* Optimized out calls are redirected to __builtin_unreachable. */
3174 || ! e
->callee
->decl
3175 || DECL_BUILT_IN_CLASS (e
->callee
->decl
) != BUILT_IN_NORMAL
3176 || DECL_FUNCTION_CODE (e
->callee
->decl
) != BUILT_IN_UNREACHABLE
)
3178 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3179 gimple_bb (e
->call_stmt
))))
3181 error ("caller edge frequency %i does not match BB frequency %i",
3183 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3184 gimple_bb (e
->call_stmt
)));
3188 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3190 if (e
->verify_count_and_frequency ())
3192 if (gimple_has_body_p (e
->caller
->decl
)
3193 && !e
->caller
->global
.inlined_to
3196 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
3197 gimple_bb (e
->call_stmt
))))
3199 error ("indirect call frequency %i does not match BB frequency %i",
3201 compute_call_stmt_bb_frequency (e
->caller
->decl
,
3202 gimple_bb (e
->call_stmt
)));
3206 if (!callers
&& global
.inlined_to
)
3208 error ("inlined_to pointer is set but no predecessors found");
3211 if (global
.inlined_to
== this)
3213 error ("inlined_to pointer refers to itself");
3220 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
3225 error ("cgraph_node has wrong clone_of");
3232 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
3233 if (n
->clone_of
!= this)
3237 error ("cgraph_node has wrong clone list");
3241 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
3243 error ("cgraph_node is in clone list but it is not clone");
3246 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
3248 error ("cgraph_node has wrong prev_clone pointer");
3251 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
3253 error ("double linked list of clones corrupted");
3257 if (analyzed
&& alias
)
3259 bool ref_found
= false;
3261 ipa_ref
*ref
= NULL
;
3265 error ("Alias has call edges");
3268 for (i
= 0; iterate_reference (i
, ref
); i
++)
3269 if (ref
->use
== IPA_REF_CHKP
)
3271 else if (ref
->use
!= IPA_REF_ALIAS
)
3273 error ("Alias has non-alias reference");
3278 error ("Alias has more than one alias reference");
3285 error ("Analyzed alias has no reference");
3290 /* Check instrumented version reference. */
3291 if (instrumented_version
3292 && instrumented_version
->instrumented_version
!= this)
3294 error ("Instrumentation clone does not reference original node");
3298 /* Cannot have orig_decl for not instrumented nodes. */
3299 if (!instrumentation_clone
&& orig_decl
)
3301 error ("Not instrumented node has non-NULL original declaration");
3305 /* If original not instrumented node still exists then we may check
3306 original declaration is set properly. */
3307 if (instrumented_version
3309 && orig_decl
!= instrumented_version
->decl
)
3311 error ("Instrumented node has wrong original declaration");
3315 /* Check all nodes have chkp reference to their instrumented versions. */
3317 && instrumented_version
3318 && !instrumentation_clone
)
3320 bool ref_found
= false;
3322 struct ipa_ref
*ref
;
3324 for (i
= 0; iterate_reference (i
, ref
); i
++)
3325 if (ref
->use
== IPA_REF_CHKP
)
3329 error ("Node has more than one chkp reference");
3332 if (ref
->referred
!= instrumented_version
)
3334 error ("Wrong node is referenced with chkp reference");
3342 error ("Analyzed node has no reference to instrumented version");
3347 if (instrumentation_clone
3348 && DECL_BUILT_IN_CLASS (decl
) == NOT_BUILT_IN
)
3350 tree name
= DECL_ASSEMBLER_NAME (decl
);
3351 tree orig_name
= DECL_ASSEMBLER_NAME (orig_decl
);
3353 if (!IDENTIFIER_TRANSPARENT_ALIAS (name
)
3354 || TREE_CHAIN (name
) != orig_name
)
3356 error ("Alias chain for instrumented node is broken");
3361 if (analyzed
&& thunk
.thunk_p
)
3365 error ("No edge out of thunk node");
3368 else if (callees
->next_callee
)
3370 error ("More than one edge out of thunk node");
3373 if (gimple_has_body_p (decl
) && !global
.inlined_to
)
3375 error ("Thunk is not supposed to have body");
3378 if (thunk
.add_pointer_bounds_args
3379 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3381 error ("Instrumentation thunk has wrong edge callee");
3385 else if (analyzed
&& gimple_has_body_p (decl
)
3386 && !TREE_ASM_WRITTEN (decl
)
3387 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3392 hash_set
<gimple
*> stmts
;
3394 ipa_ref
*ref
= NULL
;
3396 /* Reach the trees by walking over the CFG, and note the
3397 enclosing basic-blocks in the call edges. */
3398 FOR_EACH_BB_FN (this_block
, this_cfun
)
3400 for (gsi
= gsi_start_phis (this_block
);
3401 !gsi_end_p (gsi
); gsi_next (&gsi
))
3402 stmts
.add (gsi_stmt (gsi
));
3403 for (gsi
= gsi_start_bb (this_block
);
3407 gimple
*stmt
= gsi_stmt (gsi
);
3409 if (is_gimple_call (stmt
))
3411 cgraph_edge
*e
= get_edge (stmt
);
3412 tree decl
= gimple_call_fndecl (stmt
);
3417 error ("shared call_stmt:");
3418 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3421 if (!e
->indirect_unknown_callee
)
3423 if (e
->verify_corresponds_to_fndecl (decl
))
3425 error ("edge points to wrong declaration:");
3426 debug_tree (e
->callee
->decl
);
3427 fprintf (stderr
," Instead of:");
3434 error ("an indirect edge with unknown callee "
3435 "corresponding to a call_stmt with "
3436 "a known declaration:");
3438 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3444 error ("missing callgraph edge for call stmt:");
3445 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3451 for (i
= 0; iterate_reference (i
, ref
); i
++)
3452 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3454 error ("reference to dead statement");
3455 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3460 /* No CFG available?! */
3463 for (e
= callees
; e
; e
= e
->next_callee
)
3467 error ("edge %s->%s has no corresponding call_stmt",
3468 identifier_to_locale (e
->caller
->name ()),
3469 identifier_to_locale (e
->callee
->name ()));
3470 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3475 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3477 if (!e
->aux
&& !e
->speculative
)
3479 error ("an indirect edge from %s has no corresponding call_stmt",
3480 identifier_to_locale (e
->caller
->name ()));
3481 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3490 internal_error ("verify_cgraph_node failed");
3492 timevar_pop (TV_CGRAPH_VERIFY
);
3495 /* Verify whole cgraph structure. */
3497 cgraph_node::verify_cgraph_nodes (void)
3504 FOR_EACH_FUNCTION (node
)
3508 /* Walk the alias chain to return the function cgraph_node is alias of.
3509 Walk through thunks, too.
3510 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3511 When REF is non-NULL, assume that reference happens in symbol REF
3512 when determining the availability. */
3515 cgraph_node::function_symbol (enum availability
*availability
,
3516 struct symtab_node
*ref
)
3518 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3520 while (node
->thunk
.thunk_p
)
3523 node
= node
->callees
->callee
;
3526 enum availability a
;
3527 a
= node
->get_availability (ref
);
3528 if (a
< *availability
)
3531 node
= node
->ultimate_alias_target (availability
, ref
);
3536 /* Walk the alias chain to return the function cgraph_node is alias of.
3537 Walk through non virtual thunks, too. Thus we return either a function
3538 or a virtual thunk node.
3539 When AVAILABILITY is non-NULL, get minimal availability in the chain.
3540 When REF is non-NULL, assume that reference happens in symbol REF
3541 when determining the availability. */
3544 cgraph_node::function_or_virtual_thunk_symbol
3545 (enum availability
*availability
,
3546 struct symtab_node
*ref
)
3548 cgraph_node
*node
= ultimate_alias_target (availability
, ref
);
3550 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3553 node
= node
->callees
->callee
;
3556 enum availability a
;
3557 a
= node
->get_availability (ref
);
3558 if (a
< *availability
)
3561 node
= node
->ultimate_alias_target (availability
, ref
);
3566 /* When doing LTO, read cgraph_node's body from disk if it is not already
3570 cgraph_node::get_untransformed_body (void)
3572 lto_file_decl_data
*file_data
;
3573 const char *data
, *name
;
3575 tree decl
= this->decl
;
3577 /* Check if body is already there. Either we have gimple body or
3578 the function is thunk and in that case we set DECL_ARGUMENTS. */
3579 if (DECL_ARGUMENTS (decl
) || gimple_has_body_p (decl
))
3582 gcc_assert (in_lto_p
&& !DECL_RESULT (decl
));
3584 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3586 file_data
= lto_file_data
;
3587 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3589 /* We may have renamed the declaration, e.g., a static function. */
3590 name
= lto_get_decl_name_mapping (file_data
, name
);
3591 struct lto_in_decl_state
*decl_state
3592 = lto_get_function_in_decl_state (file_data
, decl
);
3594 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3595 name
, &len
, decl_state
->compressed
);
3597 fatal_error (input_location
, "%s: section %s is missing",
3598 file_data
->file_name
,
3601 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3603 lto_input_function_body (file_data
, this, data
);
3604 lto_stats
.num_function_bodies
++;
3605 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3606 data
, len
, decl_state
->compressed
);
3607 lto_free_function_in_decl_state_for_node (this);
3608 /* Keep lto file data so ipa-inline-analysis knows about cross module
3611 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3616 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3617 if it is not already present. When some IPA transformations are scheduled,
3621 cgraph_node::get_body (void)
3625 updated
= get_untransformed_body ();
3627 /* Getting transformed body makes no sense for inline clones;
3628 we should never use this on real clones because they are materialized
3630 TODO: Materializing clones here will likely lead to smaller LTRANS
3632 gcc_assert (!global
.inlined_to
&& !clone_of
);
3633 if (ipa_transforms_to_apply
.exists ())
3635 opt_pass
*saved_current_pass
= current_pass
;
3636 FILE *saved_dump_file
= dump_file
;
3637 const char *saved_dump_file_name
= dump_file_name
;
3638 int saved_dump_flags
= dump_flags
;
3639 dump_file_name
= NULL
;
3642 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3643 execute_all_ipa_transforms ();
3644 cgraph_edge::rebuild_edges ();
3645 free_dominance_info (CDI_DOMINATORS
);
3646 free_dominance_info (CDI_POST_DOMINATORS
);
3650 current_pass
= saved_current_pass
;
3651 dump_file
= saved_dump_file
;
3652 dump_file_name
= saved_dump_file_name
;
3653 dump_flags
= saved_dump_flags
;
3658 /* Return the DECL_STRUCT_FUNCTION of the function. */
3661 cgraph_node::get_fun (void)
3663 cgraph_node
*node
= this;
3664 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3666 while (!fun
&& node
->clone_of
)
3668 node
= node
->clone_of
;
3669 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3675 /* Verify if the type of the argument matches that of the function
3676 declaration. If we cannot verify this or there is a mismatch,
3680 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3683 unsigned int i
, nargs
;
3685 /* Calls to internal functions always match their signature. */
3686 if (gimple_call_internal_p (stmt
))
3689 nargs
= gimple_call_num_args (stmt
);
3691 /* Get argument types for verification. */
3693 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3695 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3697 /* Verify if the type of the argument matches that of the function
3698 declaration. If we cannot verify this or there is a mismatch,
3700 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3702 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3704 i
++, p
= DECL_CHAIN (p
))
3707 /* We cannot distinguish a varargs function from the case
3708 of excess parameters, still deferring the inlining decision
3709 to the callee is possible. */
3712 arg
= gimple_call_arg (stmt
, i
);
3713 if (p
== error_mark_node
3714 || DECL_ARG_TYPE (p
) == error_mark_node
3715 || arg
== error_mark_node
3716 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3717 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3720 if (args_count_match
&& p
)
3725 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3728 /* If this is a varargs function defer inlining decision
3732 arg
= gimple_call_arg (stmt
, i
);
3733 if (TREE_VALUE (p
) == error_mark_node
3734 || arg
== error_mark_node
3735 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3736 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3737 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3749 /* Verify if the type of the argument and lhs of CALL_STMT matches
3750 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3751 true, the arg count needs to be the same.
3752 If we cannot verify this or there is a mismatch, return false. */
3755 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3756 bool args_count_match
)
3760 if ((DECL_RESULT (callee
)
3761 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3762 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3763 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3765 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3766 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3771 /* Reset all state within cgraph.c so that we can rerun the compiler
3772 within the same process. For use by toplev::finalize. */
3775 cgraph_c_finalize (void)
3779 x_cgraph_nodes_queue
= NULL
;
3781 cgraph_fnver_htab
= NULL
;
3782 version_info_node
= NULL
;
3785 /* A wroker for call_for_symbol_and_aliases. */
3788 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3791 bool include_overwritable
)
3794 FOR_EACH_ALIAS (this, ref
)
3796 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3797 if (include_overwritable
3798 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3799 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3800 include_overwritable
))
3806 /* Return true if NODE has thunk. */
3809 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3811 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3812 if (e
->caller
->thunk
.thunk_p
)
3817 #include "gt-cgraph.h"