1 /* Callgraph handling code.
2 Copyright (C) 2003-2015 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 "fold-const.h"
38 #include "print-tree.h"
39 #include "tree-inline.h"
40 #include "langhooks.h"
47 #include "internal-fn.h"
49 #include "gimple-iterator.h"
52 #include "gimple-ssa.h"
55 #include "value-prof.h"
57 #include "diagnostic-core.h"
58 #include "ipa-utils.h"
59 #include "lto-streamer.h"
60 #include "alloc-pool.h"
61 #include "symbol-summary.h"
63 #include "ipa-inline.h"
65 #include "gimple-pretty-print.h"
66 #include "insn-config.h"
76 #include "tree-chkp.h"
79 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
80 #include "tree-pass.h"
82 /* Queue of cgraph nodes scheduled to be lowered. */
83 symtab_node
*x_cgraph_nodes_queue
;
84 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
86 /* Symbol table global context. */
89 /* List of hooks triggered on cgraph_edge events. */
90 struct cgraph_edge_hook_list
{
91 cgraph_edge_hook hook
;
93 struct cgraph_edge_hook_list
*next
;
96 /* List of hooks triggered on cgraph_node events. */
97 struct cgraph_node_hook_list
{
98 cgraph_node_hook hook
;
100 struct cgraph_node_hook_list
*next
;
103 /* List of hooks triggered on events involving two cgraph_edges. */
104 struct cgraph_2edge_hook_list
{
105 cgraph_2edge_hook hook
;
107 struct cgraph_2edge_hook_list
*next
;
110 /* List of hooks triggered on events involving two cgraph_nodes. */
111 struct cgraph_2node_hook_list
{
112 cgraph_2node_hook hook
;
114 struct cgraph_2node_hook_list
*next
;
117 /* Hash descriptor for cgraph_function_version_info. */
119 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
121 static hashval_t
hash (cgraph_function_version_info
*);
122 static bool equal (cgraph_function_version_info
*,
123 cgraph_function_version_info
*);
126 /* Map a cgraph_node to cgraph_function_version_info using this htab.
127 The cgraph_function_version_info has a THIS_NODE field that is the
128 corresponding cgraph_node.. */
130 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
132 /* Hash function for cgraph_fnver_htab. */
134 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
136 int uid
= ptr
->this_node
->uid
;
137 return (hashval_t
)(uid
);
140 /* eq function for cgraph_fnver_htab. */
142 function_version_hasher::equal (cgraph_function_version_info
*n1
,
143 cgraph_function_version_info
*n2
)
145 return n1
->this_node
->uid
== n2
->this_node
->uid
;
148 /* Mark as GC root all allocated nodes. */
149 static GTY(()) struct cgraph_function_version_info
*
150 version_info_node
= NULL
;
152 /* Return true if NODE's address can be compared. */
155 symtab_node::address_can_be_compared_p ()
157 /* Address of virtual tables and functions is never compared. */
158 if (DECL_VIRTUAL_P (decl
))
160 /* Address of C++ cdtors is never compared. */
161 if (is_a
<cgraph_node
*> (this)
162 && (DECL_CXX_CONSTRUCTOR_P (decl
)
163 || DECL_CXX_DESTRUCTOR_P (decl
)))
165 /* Constant pool symbols addresses are never compared.
166 flag_merge_constants permits us to assume the same on readonly vars. */
167 if (is_a
<varpool_node
*> (this)
168 && (DECL_IN_CONSTANT_POOL (decl
)
169 || (flag_merge_constants
>= 2
170 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
175 /* Get the cgraph_function_version_info node corresponding to node. */
176 cgraph_function_version_info
*
177 cgraph_node::function_version (void)
179 cgraph_function_version_info key
;
180 key
.this_node
= this;
182 if (cgraph_fnver_htab
== NULL
)
185 return cgraph_fnver_htab
->find (&key
);
188 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
189 corresponding to cgraph_node NODE. */
190 cgraph_function_version_info
*
191 cgraph_node::insert_new_function_version (void)
193 version_info_node
= NULL
;
194 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
195 version_info_node
->this_node
= this;
197 if (cgraph_fnver_htab
== NULL
)
198 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
200 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
202 return version_info_node
;
205 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
206 DECL is a duplicate declaration. */
208 cgraph_node::delete_function_version (tree decl
)
210 cgraph_node
*decl_node
= cgraph_node::get (decl
);
211 cgraph_function_version_info
*decl_v
= NULL
;
213 if (decl_node
== NULL
)
216 decl_v
= decl_node
->function_version ();
221 if (decl_v
->prev
!= NULL
)
222 decl_v
->prev
->next
= decl_v
->next
;
224 if (decl_v
->next
!= NULL
)
225 decl_v
->next
->prev
= decl_v
->prev
;
227 if (cgraph_fnver_htab
!= NULL
)
228 cgraph_fnver_htab
->remove_elt (decl_v
);
230 decl_node
->remove ();
233 /* Record that DECL1 and DECL2 are semantically identical function
236 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
238 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
239 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
240 cgraph_function_version_info
*decl1_v
= NULL
;
241 cgraph_function_version_info
*decl2_v
= NULL
;
242 cgraph_function_version_info
*before
;
243 cgraph_function_version_info
*after
;
245 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
246 decl1_v
= decl1_node
->function_version ();
247 decl2_v
= decl2_node
->function_version ();
249 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
253 decl1_v
= decl1_node
->insert_new_function_version ();
256 decl2_v
= decl2_node
->insert_new_function_version ();
258 /* Chain decl2_v and decl1_v. All semantically identical versions
259 will be chained together. */
264 while (before
->next
!= NULL
)
265 before
= before
->next
;
267 while (after
->prev
!= NULL
)
270 before
->next
= after
;
271 after
->prev
= before
;
274 /* Initialize callgraph dump file. */
277 symbol_table::initialize (void)
280 dump_file
= dump_begin (TDI_cgraph
, NULL
);
283 /* Allocate new callgraph node and insert it into basic data structures. */
286 symbol_table::create_empty (void)
288 cgraph_node
*node
= allocate_cgraph_symbol ();
290 node
->type
= SYMTAB_FUNCTION
;
291 node
->frequency
= NODE_FREQUENCY_NORMAL
;
292 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
298 /* Register HOOK to be called with DATA on each removed edge. */
299 cgraph_edge_hook_list
*
300 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
302 cgraph_edge_hook_list
*entry
;
303 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
305 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
315 /* Remove ENTRY from the list of hooks called on removing edges. */
317 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
319 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
321 while (*ptr
!= entry
)
327 /* Call all edge removal hooks. */
329 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
331 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
334 entry
->hook (e
, entry
->data
);
339 /* Register HOOK to be called with DATA on each removed node. */
340 cgraph_node_hook_list
*
341 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
343 cgraph_node_hook_list
*entry
;
344 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
346 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
356 /* Remove ENTRY from the list of hooks called on removing nodes. */
358 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
360 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
362 while (*ptr
!= entry
)
368 /* Call all node removal hooks. */
370 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
372 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
375 entry
->hook (node
, entry
->data
);
380 /* Call all node removal hooks. */
382 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
384 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
387 entry
->hook (node
, entry
->data
);
393 /* Register HOOK to be called with DATA on each inserted node. */
394 cgraph_node_hook_list
*
395 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
397 cgraph_node_hook_list
*entry
;
398 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
400 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
410 /* Remove ENTRY from the list of hooks called on inserted nodes. */
412 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
414 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
416 while (*ptr
!= entry
)
422 /* Register HOOK to be called with DATA on each duplicated edge. */
423 cgraph_2edge_hook_list
*
424 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
426 cgraph_2edge_hook_list
*entry
;
427 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
429 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
439 /* Remove ENTRY from the list of hooks called on duplicating edges. */
441 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
443 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
445 while (*ptr
!= entry
)
451 /* Call all edge duplication hooks. */
453 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
455 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
458 entry
->hook (cs1
, cs2
, entry
->data
);
463 /* Register HOOK to be called with DATA on each duplicated node. */
464 cgraph_2node_hook_list
*
465 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
467 cgraph_2node_hook_list
*entry
;
468 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
470 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
480 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
482 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
484 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
486 while (*ptr
!= entry
)
492 /* Call all node duplication hooks. */
494 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
497 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
500 entry
->hook (node
, node2
, entry
->data
);
505 /* Return cgraph node assigned to DECL. Create new one when needed. */
508 cgraph_node::create (tree decl
)
510 cgraph_node
*node
= symtab
->create_empty ();
511 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
515 if ((flag_openacc
|| flag_openmp
)
516 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
518 node
->offloadable
= 1;
519 #ifdef ENABLE_OFFLOADING
520 g
->have_offload
= true;
524 node
->register_symbol ();
526 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
528 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
529 node
->next_nested
= node
->origin
->nested
;
530 node
->origin
->nested
= node
;
535 /* Try to find a call graph node for declaration DECL and if it does not exist
536 or if it corresponds to an inline clone, create a new one. */
539 cgraph_node::get_create (tree decl
)
541 cgraph_node
*first_clone
= cgraph_node::get (decl
);
543 if (first_clone
&& !first_clone
->global
.inlined_to
)
546 cgraph_node
*node
= cgraph_node::create (decl
);
549 first_clone
->clone_of
= node
;
550 node
->clones
= first_clone
;
551 symtab
->symtab_prevail_in_asm_name_hash (node
);
552 node
->decl
->decl_with_vis
.symtab_node
= node
;
554 fprintf (dump_file
, "Introduced new external node "
555 "(%s/%i) and turned into root of the clone tree.\n",
556 node
->name (), node
->order
);
559 fprintf (dump_file
, "Introduced new external node "
560 "(%s/%i).\n", node
->name (), node
->order
);
564 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
565 the function body is associated with (not necessarily cgraph_node (DECL). */
568 cgraph_node::create_alias (tree alias
, tree target
)
570 cgraph_node
*alias_node
;
572 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
573 || TREE_CODE (target
) == IDENTIFIER_NODE
);
574 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
575 alias_node
= cgraph_node::get_create (alias
);
576 gcc_assert (!alias_node
->definition
);
577 alias_node
->alias_target
= target
;
578 alias_node
->definition
= true;
579 alias_node
->alias
= true;
580 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
581 alias_node
->weakref
= true;
585 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
587 Same body aliases are output whenever the body of DECL is output,
588 and cgraph_node::get (ALIAS) transparently returns
589 cgraph_node::get (DECL). */
592 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
595 #ifndef ASM_OUTPUT_DEF
596 /* If aliases aren't supported by the assembler, fail. */
599 /* Langhooks can create same body aliases of symbols not defined.
600 Those are useless. Drop them on the floor. */
601 if (symtab
->global_info_ready
)
604 n
= cgraph_node::create_alias (alias
, decl
);
605 n
->cpp_implicit_alias
= true;
606 if (symtab
->cpp_implicit_aliases_done
)
607 n
->resolve_alias (cgraph_node::get (decl
));
611 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
612 aliases DECL with an adjustments made into the first parameter.
613 See comments in thunk_adjust for detail on the parameters. */
616 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
617 HOST_WIDE_INT fixed_offset
,
618 HOST_WIDE_INT virtual_value
,
624 node
= cgraph_node::get (alias
);
628 node
= cgraph_node::create (alias
);
629 gcc_checking_assert (!virtual_offset
630 || wi::eq_p (virtual_offset
, virtual_value
));
631 node
->thunk
.fixed_offset
= fixed_offset
;
632 node
->thunk
.this_adjusting
= this_adjusting
;
633 node
->thunk
.virtual_value
= virtual_value
;
634 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
635 node
->thunk
.alias
= real_alias
;
636 node
->thunk
.thunk_p
= true;
637 node
->definition
= true;
642 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
643 Return NULL if there's no such node. */
646 cgraph_node::get_for_asmname (tree asmname
)
648 /* We do not want to look at inline clones. */
649 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
651 node
= node
->next_sharing_asm_name
)
653 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
654 if (cn
&& !cn
->global
.inlined_to
)
660 /* Returns a hash value for X (which really is a cgraph_edge). */
663 cgraph_edge_hasher::hash (cgraph_edge
*e
)
665 /* This is a really poor hash function, but it is what htab_hash_pointer
667 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
670 /* Returns a hash value for X (which really is a cgraph_edge). */
673 cgraph_edge_hasher::hash (gimple
*call_stmt
)
675 /* This is a really poor hash function, but it is what htab_hash_pointer
677 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
680 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
683 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
685 return x
->call_stmt
== y
;
688 /* Add call graph edge E to call site hash of its caller. */
691 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
693 gimple
*call
= e
->call_stmt
;
694 *e
->caller
->call_site_hash
->find_slot_with_hash
695 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
698 /* Add call graph edge E to call site hash of its caller. */
701 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
703 /* There are two speculative edges for every statement (one direct,
704 one indirect); always hash the direct one. */
705 if (e
->speculative
&& e
->indirect_unknown_callee
)
707 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
708 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
711 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
716 gcc_assert (!*slot
|| e
->speculative
);
720 /* Return the callgraph edge representing the GIMPLE_CALL statement
724 cgraph_node::get_edge (gimple
*call_stmt
)
730 return call_site_hash
->find_with_hash
731 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
733 /* This loop may turn out to be performance problem. In such case adding
734 hashtables into call nodes with very many edges is probably best
735 solution. It is not good idea to add pointer into CALL_EXPR itself
736 because we want to make possible having multiple cgraph nodes representing
737 different clones of the same body before the body is actually cloned. */
738 for (e
= callees
; e
; e
= e
->next_callee
)
740 if (e
->call_stmt
== call_stmt
)
746 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
748 if (e
->call_stmt
== call_stmt
)
755 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
756 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
757 cgraph_add_edge_to_call_site_hash (e2
);
758 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
759 cgraph_add_edge_to_call_site_hash (e2
);
766 /* Change field call_stmt of edge to NEW_STMT.
767 If UPDATE_SPECULATIVE and E is any component of speculative
768 edge, then update all components. */
771 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
775 /* Speculative edges has three component, update all of them
777 if (update_speculative
&& speculative
)
779 cgraph_edge
*direct
, *indirect
;
782 speculative_call_info (direct
, indirect
, ref
);
783 direct
->set_call_stmt (new_stmt
, false);
784 indirect
->set_call_stmt (new_stmt
, false);
785 ref
->stmt
= new_stmt
;
789 /* Only direct speculative edges go to call_site_hash. */
790 if (caller
->call_site_hash
791 && (!speculative
|| !indirect_unknown_callee
))
793 caller
->call_site_hash
->remove_elt_with_hash
794 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
797 cgraph_edge
*e
= this;
799 call_stmt
= new_stmt
;
800 if (indirect_unknown_callee
801 && (decl
= gimple_call_fndecl (new_stmt
)))
803 /* Constant propagation (and possibly also inlining?) can turn an
804 indirect call into a direct one. */
805 cgraph_node
*new_callee
= cgraph_node::get (decl
);
807 gcc_checking_assert (new_callee
);
808 e
= make_direct (new_callee
);
811 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
812 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
814 if (e
->caller
->call_site_hash
)
815 cgraph_add_edge_to_call_site_hash (e
);
818 /* Allocate a cgraph_edge structure and fill it with data according to the
819 parameters of which only CALLEE can be NULL (when creating an indirect call
823 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
824 gcall
*call_stmt
, gcov_type count
, int freq
,
825 bool indir_unknown_callee
)
829 /* LTO does not actually have access to the call_stmt since these
830 have not been loaded yet. */
833 /* This is a rather expensive check possibly triggering
834 construction of call stmt hashtable. */
835 #ifdef ENABLE_CHECKING
837 gcc_checking_assert (
838 !(e
= caller
->get_edge (call_stmt
)) || e
->speculative
);
841 gcc_assert (is_gimple_call (call_stmt
));
847 free_edges
= NEXT_FREE_EDGE (edge
);
851 edge
= ggc_alloc
<cgraph_edge
> ();
852 edge
->uid
= edges_max_uid
++;
858 edge
->caller
= caller
;
859 edge
->callee
= callee
;
860 edge
->prev_caller
= NULL
;
861 edge
->next_caller
= NULL
;
862 edge
->prev_callee
= NULL
;
863 edge
->next_callee
= NULL
;
864 edge
->lto_stmt_uid
= 0;
867 gcc_assert (count
>= 0);
868 edge
->frequency
= freq
;
869 gcc_assert (freq
>= 0);
870 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
872 edge
->call_stmt
= call_stmt
;
873 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
874 edge
->can_throw_external
875 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
878 && callee
&& callee
->decl
879 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
881 edge
->call_stmt_cannot_inline_p
= true;
883 edge
->call_stmt_cannot_inline_p
= false;
885 edge
->indirect_info
= NULL
;
886 edge
->indirect_inlining_edge
= 0;
887 edge
->speculative
= false;
888 edge
->indirect_unknown_callee
= indir_unknown_callee
;
889 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
890 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
891 edge
->in_polymorphic_cdtor
892 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
895 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
896 if (call_stmt
&& caller
->call_site_hash
)
897 cgraph_add_edge_to_call_site_hash (edge
);
902 /* Create edge from a given function to CALLEE in the cgraph. */
905 cgraph_node::create_edge (cgraph_node
*callee
,
906 gcall
*call_stmt
, gcov_type count
, int freq
)
908 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
911 initialize_inline_failed (edge
);
913 edge
->next_caller
= callee
->callers
;
915 callee
->callers
->prev_caller
= edge
;
916 edge
->next_callee
= callees
;
918 callees
->prev_callee
= edge
;
920 callee
->callers
= edge
;
925 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
927 cgraph_indirect_call_info
*
928 cgraph_allocate_init_indirect_info (void)
930 cgraph_indirect_call_info
*ii
;
932 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
933 ii
->param_index
= -1;
937 /* Create an indirect edge with a yet-undetermined callee where the call
938 statement destination is a formal parameter of the caller with index
942 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
943 gcov_type count
, int freq
,
944 bool compute_indirect_info
)
946 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
950 initialize_inline_failed (edge
);
952 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
953 edge
->indirect_info
->ecf_flags
= ecf_flags
;
954 edge
->indirect_info
->vptr_changed
= true;
956 /* Record polymorphic call info. */
957 if (compute_indirect_info
959 && (target
= gimple_call_fn (call_stmt
))
960 && virtual_method_call_p (target
))
962 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
964 /* Only record types can have virtual calls. */
965 edge
->indirect_info
->polymorphic
= true;
966 edge
->indirect_info
->param_index
= -1;
967 edge
->indirect_info
->otr_token
968 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
969 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
970 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
971 edge
->indirect_info
->context
= context
;
974 edge
->next_callee
= indirect_calls
;
976 indirect_calls
->prev_callee
= edge
;
977 indirect_calls
= edge
;
982 /* Remove the edge from the list of the callees of the caller. */
985 cgraph_edge::remove_caller (void)
988 prev_callee
->next_callee
= next_callee
;
990 next_callee
->prev_callee
= prev_callee
;
993 if (indirect_unknown_callee
)
994 caller
->indirect_calls
= next_callee
;
996 caller
->callees
= next_callee
;
998 if (caller
->call_site_hash
)
999 caller
->call_site_hash
->remove_elt_with_hash
1000 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
1003 /* Put the edge onto the free list. */
1006 symbol_table::free_edge (cgraph_edge
*e
)
1010 if (e
->indirect_info
)
1011 ggc_free (e
->indirect_info
);
1013 /* Clear out the edge so we do not dangle pointers. */
1014 memset (e
, 0, sizeof (*e
));
1016 NEXT_FREE_EDGE (e
) = free_edges
;
1021 /* Remove the edge in the cgraph. */
1024 cgraph_edge::remove (void)
1026 /* Call all edge removal hooks. */
1027 symtab
->call_edge_removal_hooks (this);
1029 if (!indirect_unknown_callee
)
1030 /* Remove from callers list of the callee. */
1033 /* Remove from callees list of the callers. */
1036 /* Put the edge onto the free list. */
1037 symtab
->free_edge (this);
1040 /* Turn edge into speculative call calling N2. Update
1041 the profile so the direct call is taken COUNT times
1044 At clone materialization time, the indirect call E will
1047 if (call_dest == N2)
1052 At this time the function just creates the direct call,
1053 the referencd representing the if conditional and attaches
1054 them all to the orginal indirect call statement.
1056 Return direct edge created. */
1059 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1060 int direct_frequency
)
1062 cgraph_node
*n
= caller
;
1063 ipa_ref
*ref
= NULL
;
1068 fprintf (dump_file
, "Indirect call -> speculative call"
1069 " %s/%i => %s/%i\n",
1070 xstrdup_for_dump (n
->name ()), n
->order
,
1071 xstrdup_for_dump (n2
->name ()), n2
->order
);
1074 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1075 initialize_inline_failed (e2
);
1076 e2
->speculative
= true;
1077 if (TREE_NOTHROW (n2
->decl
))
1078 e2
->can_throw_external
= false;
1080 e2
->can_throw_external
= can_throw_external
;
1081 e2
->lto_stmt_uid
= lto_stmt_uid
;
1082 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1084 frequency
-= e2
->frequency
;
1085 symtab
->call_edge_duplication_hooks (this, e2
);
1086 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1087 ref
->lto_stmt_uid
= lto_stmt_uid
;
1088 ref
->speculative
= speculative
;
1089 n2
->mark_address_taken ();
1093 /* Speculative call consist of three components:
1094 1) an indirect edge representing the original call
1095 2) an direct edge representing the new call
1096 3) ADDR_EXPR reference representing the speculative check.
1097 All three components are attached to single statement (the indirect
1098 call) and if one of them exists, all of them must exist.
1100 Given speculative call edge, return all three components.
1104 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1105 cgraph_edge
*&indirect
,
1106 ipa_ref
*&reference
)
1111 cgraph_edge
*e
= this;
1113 if (!e
->indirect_unknown_callee
)
1114 for (e2
= e
->caller
->indirect_calls
;
1115 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1116 e2
= e2
->next_callee
)
1121 /* We can take advantage of the call stmt hash. */
1124 e
= e
->caller
->get_edge (e2
->call_stmt
);
1125 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1128 for (e
= e
->caller
->callees
;
1129 e2
->call_stmt
!= e
->call_stmt
1130 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1134 gcc_assert (e
->speculative
&& e2
->speculative
);
1139 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1140 if (ref
->speculative
1141 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1142 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1148 /* Speculative edge always consist of all three components - direct edge,
1149 indirect and reference. */
1151 gcc_assert (e
&& e2
&& ref
);
1154 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1155 Remove the speculative call sequence and return edge representing the call.
1156 It is up to caller to redirect the call as appropriate. */
1159 cgraph_edge::resolve_speculation (tree callee_decl
)
1161 cgraph_edge
*edge
= this;
1165 gcc_assert (edge
->speculative
);
1166 edge
->speculative_call_info (e2
, edge
, ref
);
1168 || !ref
->referred
->semantically_equivalent_p
1169 (symtab_node::get (callee_decl
)))
1175 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1176 "turned out to have contradicting known target ",
1177 xstrdup_for_dump (edge
->caller
->name ()),
1178 edge
->caller
->order
,
1179 xstrdup_for_dump (e2
->callee
->name ()),
1181 print_generic_expr (dump_file
, callee_decl
, 0);
1182 fprintf (dump_file
, "\n");
1186 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1187 xstrdup_for_dump (edge
->caller
->name ()),
1188 edge
->caller
->order
,
1189 xstrdup_for_dump (e2
->callee
->name ()),
1196 cgraph_edge
*tmp
= edge
;
1198 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1201 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1202 in the functions inlined through it. */
1204 edge
->count
+= e2
->count
;
1205 edge
->frequency
+= e2
->frequency
;
1206 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1207 edge
->frequency
= CGRAPH_FREQ_MAX
;
1208 edge
->speculative
= false;
1209 e2
->speculative
= false;
1210 ref
->remove_reference ();
1211 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1214 e2
->callee
->remove_symbol_and_inline_clones ();
1215 if (edge
->caller
->call_site_hash
)
1216 cgraph_update_edge_in_call_site_hash (edge
);
1220 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1221 CALLEE. DELTA is an integer constant that is to be added to the this
1222 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1225 cgraph_edge::make_direct (cgraph_node
*callee
)
1227 cgraph_edge
*edge
= this;
1228 gcc_assert (indirect_unknown_callee
);
1230 /* If we are redirecting speculative call, make it non-speculative. */
1231 if (indirect_unknown_callee
&& speculative
)
1233 edge
= edge
->resolve_speculation (callee
->decl
);
1235 /* On successful speculation just return the pre existing direct edge. */
1236 if (!indirect_unknown_callee
)
1240 indirect_unknown_callee
= 0;
1241 ggc_free (indirect_info
);
1242 indirect_info
= NULL
;
1244 /* Get the edge out of the indirect edge list. */
1246 prev_callee
->next_callee
= next_callee
;
1248 next_callee
->prev_callee
= prev_callee
;
1250 caller
->indirect_calls
= next_callee
;
1252 /* Put it into the normal callee list */
1254 next_callee
= caller
->callees
;
1255 if (caller
->callees
)
1256 caller
->callees
->prev_callee
= edge
;
1257 caller
->callees
= edge
;
1259 /* Insert to callers list of the new callee. */
1260 edge
->set_callee (callee
);
1263 call_stmt_cannot_inline_p
1264 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1267 /* We need to re-determine the inlining status of the edge. */
1268 initialize_inline_failed (edge
);
1272 /* If necessary, change the function declaration in the call statement
1273 associated with E so that it corresponds to the edge callee. */
1276 cgraph_edge::redirect_call_stmt_to_callee (void)
1278 cgraph_edge
*e
= this;
1280 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1281 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1283 gimple_stmt_iterator gsi
;
1284 bool skip_bounds
= false;
1285 #ifdef ENABLE_CHECKING
1295 e
->speculative_call_info (e
, e2
, ref
);
1296 /* If there already is an direct call (i.e. as a result of inliner's
1297 substitution), forget about speculating. */
1299 e
= e
->resolve_speculation (decl
);
1300 /* If types do not match, speculation was likely wrong.
1301 The direct edge was posisbly redirected to the clone with a different
1302 signature. We did not update the call statement yet, so compare it
1303 with the reference that still points to the proper type. */
1304 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1305 ref
->referred
->decl
,
1309 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1311 xstrdup_for_dump (e
->caller
->name ()),
1313 xstrdup_for_dump (e
->callee
->name ()),
1315 e
= e
->resolve_speculation ();
1316 /* We are producing the final function body and will throw away the
1317 callgraph edges really soon. Reset the counts/frequencies to
1318 keep verifier happy in the case of roundoff errors. */
1319 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1320 e
->frequency
= compute_call_stmt_bb_frequency
1321 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1323 /* Expand speculation into GIMPLE code. */
1328 "Expanding speculative call of %s/%i -> %s/%i count:"
1330 xstrdup_for_dump (e
->caller
->name ()),
1332 xstrdup_for_dump (e
->callee
->name ()),
1335 gcc_assert (e2
->speculative
);
1336 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1337 new_stmt
= gimple_ic (e
->call_stmt
,
1338 dyn_cast
<cgraph_node
*> (ref
->referred
),
1339 e
->count
|| e2
->count
1340 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1341 e
->count
+ e2
->count
)
1342 : e
->frequency
|| e2
->frequency
1343 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1344 e
->frequency
+ e2
->frequency
)
1345 : REG_BR_PROB_BASE
/ 2,
1346 e
->count
, e
->count
+ e2
->count
);
1347 e
->speculative
= false;
1348 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1351 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1352 processed call stmt. */
1353 if (gimple_call_with_bounds_p (new_stmt
)
1354 && gimple_call_lhs (new_stmt
)
1355 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1357 tree dresult
= gimple_call_lhs (new_stmt
);
1358 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1359 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1360 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1361 struct cgraph_edge
*iedge
1362 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1363 struct cgraph_edge
*dedge
;
1367 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1370 dedge
->frequency
= compute_call_stmt_bb_frequency
1371 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1373 iedge
->frequency
= compute_call_stmt_bb_frequency
1374 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1377 e
->frequency
= compute_call_stmt_bb_frequency
1378 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1379 e2
->frequency
= compute_call_stmt_bb_frequency
1380 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1381 e2
->speculative
= false;
1382 ref
->speculative
= false;
1384 /* Indirect edges are not both in the call site hash.
1386 if (e
->caller
->call_site_hash
)
1387 cgraph_update_edge_in_call_site_hash (e2
);
1389 /* Continue redirecting E to proper target. */
1393 /* We might propagate instrumented function pointer into
1394 not instrumented function and vice versa. In such a
1395 case we need to either fix function declaration or
1396 remove bounds from call statement. */
1397 if (flag_check_pointer_bounds
&& e
->callee
)
1398 skip_bounds
= chkp_redirect_edge (e
);
1400 if (e
->indirect_unknown_callee
1401 || (decl
== e
->callee
->decl
1403 return e
->call_stmt
;
1405 #ifdef ENABLE_CHECKING
1408 node
= cgraph_node::get (decl
);
1409 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1413 if (symtab
->dump_file
)
1415 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1416 xstrdup_for_dump (e
->caller
->name ()), e
->caller
->order
,
1417 xstrdup_for_dump (e
->callee
->name ()), e
->callee
->order
);
1418 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1419 if (e
->callee
->clone
.combined_args_to_skip
)
1421 fprintf (symtab
->dump_file
, " combined args to skip: ");
1422 dump_bitmap (symtab
->dump_file
,
1423 e
->callee
->clone
.combined_args_to_skip
);
1427 if (e
->callee
->clone
.combined_args_to_skip
1432 new_stmt
= e
->call_stmt
;
1433 if (e
->callee
->clone
.combined_args_to_skip
)
1435 = gimple_call_copy_skip_args (new_stmt
,
1436 e
->callee
->clone
.combined_args_to_skip
);
1438 new_stmt
= chkp_copy_call_skip_bounds (new_stmt
);
1440 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1441 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1443 if (gimple_vdef (new_stmt
)
1444 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1445 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1447 gsi
= gsi_for_stmt (e
->call_stmt
);
1448 gsi_replace (&gsi
, new_stmt
, false);
1449 /* We need to defer cleaning EH info on the new statement to
1450 fixup-cfg. We may not have dominator information at this point
1451 and thus would end up with unreachable blocks and have no way
1452 to communicate that we need to run CFG cleanup then. */
1453 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1456 remove_stmt_from_eh_lp (e
->call_stmt
);
1457 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1462 new_stmt
= e
->call_stmt
;
1463 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1464 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1467 /* If the call becomes noreturn, remove the LHS if possible. */
1469 && (gimple_call_flags (new_stmt
) & ECF_NORETURN
)
1470 && TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (lhs
))) == INTEGER_CST
)
1472 if (TREE_CODE (lhs
) == SSA_NAME
)
1474 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1475 TREE_TYPE (lhs
), NULL
);
1476 var
= get_or_create_ssa_default_def
1477 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1478 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1479 gsi
= gsi_for_stmt (new_stmt
);
1480 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1481 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1483 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1484 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1487 /* If new callee has no static chain, remove it. */
1488 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1490 gimple_call_set_chain (new_stmt
, NULL
);
1491 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1494 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1497 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1499 if (symtab
->dump_file
)
1501 fprintf (symtab
->dump_file
, " updated to:");
1502 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1507 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1508 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1509 of OLD_STMT if it was previously call statement.
1510 If NEW_STMT is NULL, the call has been dropped without any
1514 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1515 gimple
*old_stmt
, tree old_call
,
1518 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1519 ? gimple_call_fndecl (new_stmt
) : 0;
1521 /* We are seeing indirect calls, then there is nothing to update. */
1522 if (!new_call
&& !old_call
)
1524 /* See if we turned indirect call into direct call or folded call to one builtin
1525 into different builtin. */
1526 if (old_call
!= new_call
)
1528 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1529 cgraph_edge
*ne
= NULL
;
1535 /* Keep calls marked as dead dead. */
1536 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1537 && DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
1538 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
1540 node
->get_edge (old_stmt
)->set_call_stmt
1541 (as_a
<gcall
*> (new_stmt
));
1544 /* See if the edge is already there and has the correct callee. It
1545 might be so because of indirect inlining has already updated
1546 it. We also might've cloned and redirected the edge. */
1547 if (new_call
&& e
->callee
)
1549 cgraph_node
*callee
= e
->callee
;
1552 if (callee
->decl
== new_call
1553 || callee
->former_clone_of
== new_call
)
1555 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1558 callee
= callee
->clone_of
;
1562 /* Otherwise remove edge and create new one; we can't simply redirect
1563 since function has changed, so inline plan and other information
1564 attached to edge is invalid. */
1566 frequency
= e
->frequency
;
1567 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1570 e
->callee
->remove_symbol_and_inline_clones ();
1574 /* We are seeing new direct call; compute profile info based on BB. */
1575 basic_block bb
= gimple_bb (new_stmt
);
1577 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1583 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1584 as_a
<gcall
*> (new_stmt
), count
,
1586 gcc_assert (ne
->inline_failed
);
1589 /* We only updated the call stmt; update pointer in cgraph edge.. */
1590 else if (old_stmt
!= new_stmt
)
1591 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1594 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1595 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1596 of OLD_STMT before it was updated (updating can happen inplace). */
1599 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1602 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1605 gcc_checking_assert (orig
);
1606 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1608 for (node
= orig
->clones
; node
!= orig
;)
1610 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1612 node
= node
->clones
;
1613 else if (node
->next_sibling_clone
)
1614 node
= node
->next_sibling_clone
;
1617 while (node
!= orig
&& !node
->next_sibling_clone
)
1618 node
= node
->clone_of
;
1620 node
= node
->next_sibling_clone
;
1626 /* Remove all callees from the node. */
1629 cgraph_node::remove_callees (void)
1633 /* It is sufficient to remove the edges from the lists of callers of
1634 the callees. The callee list of the node can be zapped with one
1636 for (e
= callees
; e
; e
= f
)
1639 symtab
->call_edge_removal_hooks (e
);
1640 if (!e
->indirect_unknown_callee
)
1641 e
->remove_callee ();
1642 symtab
->free_edge (e
);
1644 for (e
= indirect_calls
; e
; e
= f
)
1647 symtab
->call_edge_removal_hooks (e
);
1648 if (!e
->indirect_unknown_callee
)
1649 e
->remove_callee ();
1650 symtab
->free_edge (e
);
1652 indirect_calls
= NULL
;
1656 call_site_hash
->empty ();
1657 call_site_hash
= NULL
;
1661 /* Remove all callers from the node. */
1664 cgraph_node::remove_callers (void)
1668 /* It is sufficient to remove the edges from the lists of callees of
1669 the callers. The caller list of the node can be zapped with one
1671 for (e
= callers
; e
; e
= f
)
1674 symtab
->call_edge_removal_hooks (e
);
1675 e
->remove_caller ();
1676 symtab
->free_edge (e
);
1681 /* Helper function for cgraph_release_function_body and free_lang_data.
1682 It releases body from function DECL without having to inspect its
1683 possibly non-existent symtab node. */
1686 release_function_body (tree decl
)
1688 if (DECL_STRUCT_FUNCTION (decl
))
1690 if (DECL_STRUCT_FUNCTION (decl
)->cfg
1691 || DECL_STRUCT_FUNCTION (decl
)->gimple_df
)
1693 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1697 cfun
->curr_properties
&= ~PROP_loops
;
1698 loop_optimizer_finalize ();
1700 if (cfun
->gimple_df
)
1703 delete_tree_cfg_annotations ();
1708 gcc_assert (!dom_info_available_p (CDI_DOMINATORS
));
1709 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS
));
1713 if (cfun
->value_histograms
)
1717 gimple_set_body (decl
, NULL
);
1718 /* Struct function hangs a lot of data that would leak if we didn't
1719 removed all pointers to it. */
1720 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1721 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1723 DECL_SAVED_TREE (decl
) = NULL
;
1726 /* Release memory used to represent body of function.
1727 Use this only for functions that are released before being translated to
1728 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1729 are free'd in final.c via free_after_compilation().
1730 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1733 cgraph_node::release_body (bool keep_arguments
)
1735 ipa_transforms_to_apply
.release ();
1736 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1738 DECL_RESULT (decl
) = NULL
;
1740 if (!keep_arguments
)
1741 DECL_ARGUMENTS (decl
) = NULL
;
1743 /* If the node is abstract and needed, then do not clear
1744 DECL_INITIAL of its associated function declaration because it's
1745 needed to emit debug info later. */
1746 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1747 DECL_INITIAL (decl
) = error_mark_node
;
1748 release_function_body (decl
);
1751 lto_free_function_in_decl_state_for_node (this);
1752 lto_file_data
= NULL
;
1756 /* Remove function from symbol table. */
1759 cgraph_node::remove (void)
1762 int uid
= this->uid
;
1764 symtab
->call_cgraph_removal_hooks (this);
1767 ipa_transforms_to_apply
.release ();
1769 /* Incremental inlining access removed nodes stored in the postorder list.
1771 force_output
= false;
1772 forced_by_abi
= false;
1773 for (n
= nested
; n
; n
= n
->next_nested
)
1778 cgraph_node
**node2
= &origin
->nested
;
1780 while (*node2
!= this)
1781 node2
= &(*node2
)->next_nested
;
1782 *node2
= next_nested
;
1785 if (prev_sibling_clone
)
1786 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1788 clone_of
->clones
= next_sibling_clone
;
1789 if (next_sibling_clone
)
1790 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1793 cgraph_node
*n
, *next
;
1797 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1798 n
->clone_of
= clone_of
;
1799 n
->clone_of
= clone_of
;
1800 n
->next_sibling_clone
= clone_of
->clones
;
1801 if (clone_of
->clones
)
1802 clone_of
->clones
->prev_sibling_clone
= n
;
1803 clone_of
->clones
= clones
;
1807 /* We are removing node with clones. This makes clones inconsistent,
1808 but assume they will be removed subsequently and just keep clone
1809 tree intact. This can happen in unreachable function removal since
1810 we remove unreachable functions in random order, not by bottom-up
1811 walk of clone trees. */
1812 for (n
= clones
; n
; n
= next
)
1814 next
= n
->next_sibling_clone
;
1815 n
->next_sibling_clone
= NULL
;
1816 n
->prev_sibling_clone
= NULL
;
1822 /* While all the clones are removed after being proceeded, the function
1823 itself is kept in the cgraph even after it is compiled. Check whether
1824 we are done with this body and reclaim it proactively if this is the case.
1826 if (symtab
->state
!= LTO_STREAMING
)
1828 n
= cgraph_node::get (decl
);
1830 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1831 && ((symtab
->global_info_ready
|| in_lto_p
)
1832 && (TREE_ASM_WRITTEN (n
->decl
)
1833 || DECL_EXTERNAL (n
->decl
)
1835 || (!flag_wpa
&& n
->in_other_partition
)))))
1840 lto_free_function_in_decl_state_for_node (this);
1841 lto_file_data
= NULL
;
1847 call_site_hash
->empty ();
1848 call_site_hash
= NULL
;
1851 if (instrumented_version
)
1853 instrumented_version
->instrumented_version
= NULL
;
1854 instrumented_version
= NULL
;
1857 symtab
->release_symbol (this, uid
);
1860 /* Likewise indicate that a node is having address taken. */
1863 cgraph_node::mark_address_taken (void)
1865 /* Indirect inlining can figure out that all uses of the address are
1867 if (global
.inlined_to
)
1869 gcc_assert (cfun
->after_inlining
);
1870 gcc_assert (callers
->indirect_inlining_edge
);
1873 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1874 IPA_REF_ADDR reference exists (and thus it should be set on node
1875 representing alias we take address of) and as a test whether address
1876 of the object was taken (and thus it should be set on node alias is
1877 referring to). We should remove the first use and the remove the
1880 cgraph_node
*node
= ultimate_alias_target ();
1881 node
->address_taken
= 1;
1884 /* Return local info for the compiled function. */
1887 cgraph_node::local_info (tree decl
)
1889 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1890 cgraph_node
*node
= get (decl
);
1893 return &node
->ultimate_alias_target ()->local
;
1896 /* Return local info for the compiled function. */
1899 cgraph_node::rtl_info (tree decl
)
1901 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1902 cgraph_node
*node
= get (decl
);
1905 node
= node
->ultimate_alias_target ();
1906 if (node
->decl
!= current_function_decl
1907 && !TREE_ASM_WRITTEN (node
->decl
))
1909 /* Allocate if it doesnt exist. */
1910 if (node
->ultimate_alias_target ()->rtl
== NULL
)
1911 node
->ultimate_alias_target ()->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1912 return node
->ultimate_alias_target ()->rtl
;
1915 /* Return a string describing the failure REASON. */
1918 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1921 #define DEFCIFCODE(code, type, string) string,
1923 static const char *cif_string_table
[CIF_N_REASONS
] = {
1924 #include "cif-code.def"
1927 /* Signedness of an enum type is implementation defined, so cast it
1928 to unsigned before testing. */
1929 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1930 return cif_string_table
[reason
];
1933 /* Return a type describing the failure REASON. */
1935 cgraph_inline_failed_type_t
1936 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1939 #define DEFCIFCODE(code, type, string) type,
1941 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1942 #include "cif-code.def"
1945 /* Signedness of an enum type is implementation defined, so cast it
1946 to unsigned before testing. */
1947 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1948 return cif_type_table
[reason
];
1951 /* Names used to print out the availability enum. */
1952 const char * const cgraph_availability_names
[] =
1953 {"unset", "not_available", "overwritable", "available", "local"};
1955 /* Output flags of edge to a file F. */
1958 cgraph_edge::dump_edge_flags (FILE *f
)
1961 fprintf (f
, "(speculative) ");
1963 fprintf (f
, "(inlined) ");
1964 if (indirect_inlining_edge
)
1965 fprintf (f
, "(indirect_inlining) ");
1967 fprintf (f
, "(%" PRId64
"x) ", (int64_t)count
);
1969 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
1970 if (can_throw_external
)
1971 fprintf (f
, "(can throw external) ");
1974 /* Dump call graph node to file F. */
1977 cgraph_node::dump (FILE *f
)
1983 if (global
.inlined_to
)
1984 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1985 xstrdup_for_dump (name ()),
1987 xstrdup_for_dump (global
.inlined_to
->name ()),
1988 global
.inlined_to
->order
);
1990 fprintf (f
, " Clone of %s/%i\n",
1991 clone_of
->asm_name (),
1993 if (symtab
->function_flags_ready
)
1994 fprintf (f
, " Availability: %s\n",
1995 cgraph_availability_names
[get_availability ()]);
1998 fprintf (f
, " Profile id: %i\n",
2000 fprintf (f
, " First run: %i\n", tp_first_run
);
2001 fprintf (f
, " Function flags:");
2003 fprintf (f
, " executed %" PRId64
"x",
2006 fprintf (f
, " nested in: %s", origin
->asm_name ());
2007 if (gimple_has_body_p (decl
))
2008 fprintf (f
, " body");
2010 fprintf (f
, " process");
2012 fprintf (f
, " local");
2013 if (local
.redefined_extern_inline
)
2014 fprintf (f
, " redefined_extern_inline");
2015 if (only_called_at_startup
)
2016 fprintf (f
, " only_called_at_startup");
2017 if (only_called_at_exit
)
2018 fprintf (f
, " only_called_at_exit");
2020 fprintf (f
, " tm_clone");
2022 fprintf (f
, " icf_merged");
2024 fprintf (f
, " nonfreeing_fn");
2025 if (DECL_STATIC_CONSTRUCTOR (decl
))
2026 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2027 if (DECL_STATIC_DESTRUCTOR (decl
))
2028 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2029 if (frequency
== NODE_FREQUENCY_HOT
)
2030 fprintf (f
, " hot");
2031 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2032 fprintf (f
, " unlikely_executed");
2033 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2034 fprintf (f
, " executed_once");
2035 if (only_called_at_startup
)
2036 fprintf (f
, " only_called_at_startup");
2037 if (only_called_at_exit
)
2038 fprintf (f
, " only_called_at_exit");
2039 if (opt_for_fn (decl
, optimize_size
))
2040 fprintf (f
, " optimize_size");
2041 if (parallelized_function
)
2042 fprintf (f
, " parallelized_function");
2048 fprintf (f
, " Thunk");
2050 fprintf (f
, " of %s (asm: %s)",
2051 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2052 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2053 fprintf (f
, " fixed offset %i virtual value %i has "
2054 "virtual offset %i)\n",
2055 (int)thunk
.fixed_offset
,
2056 (int)thunk
.virtual_value
,
2057 (int)thunk
.virtual_offset_p
);
2059 if (alias
&& thunk
.alias
2060 && DECL_P (thunk
.alias
))
2062 fprintf (f
, " Alias of %s",
2063 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2064 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2065 fprintf (f
, " (asm: %s)",
2066 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2070 fprintf (f
, " Called by: ");
2072 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2074 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
2075 edge
->caller
->order
);
2076 edge
->dump_edge_flags (f
);
2079 fprintf (f
, "\n Calls: ");
2080 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2082 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
2083 edge
->callee
->order
);
2084 edge
->dump_edge_flags (f
);
2088 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2090 if (edge
->indirect_info
->polymorphic
)
2092 fprintf (f
, " Polymorphic indirect call of type ");
2093 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2094 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2097 fprintf (f
, " Indirect call");
2098 edge
->dump_edge_flags (f
);
2099 if (edge
->indirect_info
->param_index
!= -1)
2101 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2102 if (edge
->indirect_info
->agg_contents
)
2103 fprintf (f
, " loaded from %s %s at offset %i",
2104 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2105 edge
->indirect_info
->by_ref
? "passed by reference":"",
2106 (int)edge
->indirect_info
->offset
);
2107 if (edge
->indirect_info
->vptr_changed
)
2108 fprintf (f
, " (vptr maybe changed)");
2111 if (edge
->indirect_info
->polymorphic
)
2112 edge
->indirect_info
->context
.dump (f
);
2115 if (instrumentation_clone
)
2116 fprintf (f
, " Is instrumented version.\n");
2117 else if (instrumented_version
)
2118 fprintf (f
, " Has instrumented version.\n");
2121 /* Dump call graph node NODE to stderr. */
2124 cgraph_node::debug (void)
2129 /* Dump the callgraph to file F. */
2132 cgraph_node::dump_cgraph (FILE *f
)
2136 fprintf (f
, "callgraph:\n\n");
2137 FOR_EACH_FUNCTION (node
)
2141 /* Return true when the DECL can possibly be inlined. */
2144 cgraph_function_possibly_inlined_p (tree decl
)
2146 if (!symtab
->global_info_ready
)
2147 return !DECL_UNINLINABLE (decl
);
2148 return DECL_POSSIBLY_INLINED (decl
);
2151 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2153 cgraph_node::unnest (void)
2155 cgraph_node
**node2
= &origin
->nested
;
2156 gcc_assert (origin
);
2158 while (*node2
!= this)
2159 node2
= &(*node2
)->next_nested
;
2160 *node2
= next_nested
;
2164 /* Return function availability. See cgraph.h for description of individual
2167 cgraph_node::get_availability (void)
2169 enum availability avail
;
2171 avail
= AVAIL_NOT_AVAILABLE
;
2172 else if (local
.local
)
2173 avail
= AVAIL_LOCAL
;
2174 else if (alias
&& weakref
)
2175 ultimate_alias_target (&avail
);
2176 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2177 avail
= AVAIL_INTERPOSABLE
;
2178 else if (!externally_visible
)
2179 avail
= AVAIL_AVAILABLE
;
2180 /* Inline functions are safe to be analyzed even if their symbol can
2181 be overwritten at runtime. It is not meaningful to enforce any sane
2182 behaviour on replacing inline function by different body. */
2183 else if (DECL_DECLARED_INLINE_P (decl
))
2184 avail
= AVAIL_AVAILABLE
;
2186 /* If the function can be overwritten, return OVERWRITABLE. Take
2187 care at least of two notable extensions - the COMDAT functions
2188 used to share template instantiations in C++ (this is symmetric
2189 to code cp_cannot_inline_tree_fn and probably shall be shared and
2190 the inlinability hooks completely eliminated).
2192 ??? Does the C++ one definition rule allow us to always return
2193 AVAIL_AVAILABLE here? That would be good reason to preserve this
2196 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2197 avail
= AVAIL_INTERPOSABLE
;
2198 else avail
= AVAIL_AVAILABLE
;
2203 /* Worker for cgraph_node_can_be_local_p. */
2205 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2207 return !(!node
->force_output
2208 && ((DECL_COMDAT (node
->decl
)
2209 && !node
->forced_by_abi
2210 && !node
->used_from_object_file_p ()
2211 && !node
->same_comdat_group
)
2212 || !node
->externally_visible
));
2215 /* Return true if cgraph_node can be made local for API change.
2216 Extern inline functions and C++ COMDAT functions can be made local
2217 at the expense of possible code size growth if function is used in multiple
2218 compilation units. */
2220 cgraph_node::can_be_local_p (void)
2222 return (!address_taken
2223 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2227 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2228 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2229 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2232 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2233 (cgraph_node
*, void *),
2235 bool include_overwritable
,
2236 bool exclude_virtual_thunks
)
2241 if (callback (this, data
))
2243 FOR_EACH_ALIAS (this, ref
)
2245 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2246 if (include_overwritable
2247 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2248 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2249 include_overwritable
,
2250 exclude_virtual_thunks
))
2253 for (e
= callers
; e
; e
= e
->next_caller
)
2254 if (e
->caller
->thunk
.thunk_p
2255 && (include_overwritable
2256 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2257 && !(exclude_virtual_thunks
2258 && e
->caller
->thunk
.virtual_offset_p
))
2259 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2260 include_overwritable
,
2261 exclude_virtual_thunks
))
2267 /* Worker to bring NODE local. */
2270 cgraph_node::make_local (cgraph_node
*node
, void *)
2272 gcc_checking_assert (node
->can_be_local_p ());
2273 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2275 node
->make_decl_local ();
2276 node
->set_section (NULL
);
2277 node
->set_comdat_group (NULL
);
2278 node
->externally_visible
= false;
2279 node
->forced_by_abi
= false;
2280 node
->local
.local
= true;
2281 node
->set_section (NULL
);
2282 node
->unique_name
= (node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2283 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2284 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2285 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2290 /* Bring cgraph node local. */
2293 cgraph_node::make_local (void)
2295 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2298 /* Worker to set nothrow flag. */
2301 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2305 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2308 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2309 e
->can_throw_external
= false;
2313 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2314 if any to NOTHROW. */
2317 cgraph_node::set_nothrow_flag (bool nothrow
)
2319 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2320 (void *)(size_t)nothrow
, false);
2323 /* Worker to set const flag. */
2326 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2328 /* Static constructors and destructors without a side effect can be
2330 if (data
&& !((size_t)data
& 2))
2332 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2333 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2334 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2335 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2337 TREE_READONLY (node
->decl
) = data
!= NULL
;
2338 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2342 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2343 if any to READONLY. */
2346 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2348 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2349 (void *)(size_t)(readonly
+ (int)looping
* 2),
2353 /* Worker to set pure flag. */
2356 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2358 /* Static constructors and destructors without a side effect can be
2360 if (data
&& !((size_t)data
& 2))
2362 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2363 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2364 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2365 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2367 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2368 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2372 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2376 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2378 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2379 (void *)(size_t)(pure
+ (int)looping
* 2),
2383 /* Return true when cgraph_node can not return or throw and thus
2384 it is safe to ignore its side effects for IPA analysis. */
2387 cgraph_node::cannot_return_p (void)
2389 int flags
= flags_from_decl_or_type (decl
);
2390 if (!opt_for_fn (decl
, flag_exceptions
))
2391 return (flags
& ECF_NORETURN
) != 0;
2393 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2394 == (ECF_NORETURN
| ECF_NOTHROW
));
2397 /* Return true when call of edge can not lead to return from caller
2398 and thus it is safe to ignore its side effects for IPA analysis
2399 when computing side effects of the caller.
2400 FIXME: We could actually mark all edges that have no reaching
2401 patch to the exit block or throw to get better results. */
2403 cgraph_edge::cannot_lead_to_return_p (void)
2405 if (caller
->cannot_return_p ())
2407 if (indirect_unknown_callee
)
2409 int flags
= indirect_info
->ecf_flags
;
2410 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2411 return (flags
& ECF_NORETURN
) != 0;
2413 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2414 == (ECF_NORETURN
| ECF_NOTHROW
));
2417 return callee
->cannot_return_p ();
2420 /* Return true if the call can be hot. */
2423 cgraph_edge::maybe_hot_p (void)
2425 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2427 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2428 && !maybe_hot_count_p (NULL
, count
))
2430 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2432 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2434 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2436 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2438 if (opt_for_fn (caller
->decl
, optimize_size
))
2440 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2442 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2443 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2445 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2447 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2448 || frequency
<= (CGRAPH_FREQ_BASE
2449 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2455 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2458 nonremovable_p (cgraph_node
*node
, void *)
2460 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2463 /* Return true if whole comdat group can be removed if there are no direct
2467 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2469 struct ipa_ref
*ref
;
2471 /* For local symbols or non-comdat group it is the same as
2472 can_remove_if_no_direct_calls_p. */
2473 if (!externally_visible
|| !same_comdat_group
)
2475 if (DECL_EXTERNAL (decl
))
2479 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2482 if (will_inline
&& address_taken
)
2485 /* Otheriwse check if we can remove the symbol itself and then verify
2486 that only uses of the comdat groups are direct call to THIS
2488 if (!can_remove_if_no_direct_calls_and_refs_p ())
2491 /* Check that all refs come from within the comdat group. */
2492 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2493 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2496 struct cgraph_node
*target
= ultimate_alias_target ();
2497 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2498 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2500 if (!externally_visible
)
2503 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2506 /* If we see different symbol than THIS, be sure to check calls. */
2507 if (next
->ultimate_alias_target () != target
)
2508 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2509 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2513 /* If function is not being inlined, we care only about
2514 references outside of the comdat group. */
2516 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2517 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2523 /* Return true when function cgraph_node can be expected to be removed
2524 from program when direct calls in this compilation unit are removed.
2526 As a special case COMDAT functions are
2527 cgraph_can_remove_if_no_direct_calls_p while the are not
2528 cgraph_only_called_directly_p (it is possible they are called from other
2531 This function behaves as cgraph_only_called_directly_p because eliminating
2532 all uses of COMDAT function does not make it necessarily disappear from
2533 the program unless we are compiling whole program or we do LTO. In this
2534 case we know we win since dynamic linking will not really discard the
2535 linkonce section. */
2538 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2541 gcc_assert (!global
.inlined_to
);
2542 if (DECL_EXTERNAL (decl
))
2545 if (!in_lto_p
&& !flag_whole_program
)
2547 /* If the symbol is in comdat group, we need to verify that whole comdat
2548 group becomes unreachable. Technically we could skip references from
2549 within the group, too. */
2550 if (!only_called_directly_p ())
2552 if (same_comdat_group
&& externally_visible
)
2554 struct cgraph_node
*target
= ultimate_alias_target ();
2556 if (will_inline
&& address_taken
)
2558 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2560 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2562 if (!externally_visible
)
2565 && !next
->only_called_directly_p ())
2568 /* If we see different symbol than THIS,
2569 be sure to check calls. */
2570 if (next
->ultimate_alias_target () != target
)
2571 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2572 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2580 return can_remove_if_no_direct_calls_p (will_inline
);
2584 /* Worker for cgraph_only_called_directly_p. */
2587 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2589 return !node
->only_called_directly_or_aliased_p ();
2592 /* Return true when function cgraph_node and all its aliases are only called
2594 i.e. it is not externally visible, address was not taken and
2595 it is not used in any other non-standard way. */
2598 cgraph_node::only_called_directly_p (void)
2600 gcc_assert (ultimate_alias_target () == this);
2601 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2606 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2609 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2611 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2613 enum availability avail
;
2614 node
->ultimate_alias_target (&avail
);
2616 if (avail
> AVAIL_INTERPOSABLE
)
2617 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2618 if (!cs
->indirect_inlining_edge
)
2619 redirect_callers
->safe_push (cs
);
2623 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2624 cgraph_node (i.e. are not overwritable). */
2627 cgraph_node::collect_callers (void)
2629 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2630 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2631 &redirect_callers
, false);
2632 return redirect_callers
;
2635 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2638 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2640 bool skipped_thunk
= false;
2641 node
= node
->ultimate_alias_target ();
2642 node2
= node2
->ultimate_alias_target ();
2644 /* There are no virtual clones of thunks so check former_clone_of or if we
2645 might have skipped thunks because this adjustments are no longer
2647 while (node
->thunk
.thunk_p
)
2649 if (node2
->former_clone_of
== node
->decl
)
2651 if (!node
->thunk
.this_adjusting
)
2653 node
= node
->callees
->callee
->ultimate_alias_target ();
2654 skipped_thunk
= true;
2659 if (!node2
->clone
.args_to_skip
2660 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2662 if (node2
->former_clone_of
== node
->decl
)
2664 else if (!node2
->clone_of
)
2668 while (node
!= node2
&& node2
)
2669 node2
= node2
->clone_of
;
2670 return node2
!= NULL
;
2673 /* Verify edge count and frequency. */
2676 cgraph_edge::verify_count_and_frequency ()
2678 bool error_found
= false;
2681 error ("caller edge count is negative");
2686 error ("caller edge frequency is negative");
2689 if (frequency
> CGRAPH_FREQ_MAX
)
2691 error ("caller edge frequency is too large");
2697 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2699 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
2701 bool fndecl_was_null
= false;
2702 /* debug_gimple_stmt needs correct cfun */
2703 if (cfun
!= this_cfun
)
2704 set_cfun (this_cfun
);
2705 /* ...and an actual current_function_decl */
2706 if (!current_function_decl
)
2708 current_function_decl
= this_cfun
->decl
;
2709 fndecl_was_null
= true;
2711 debug_gimple_stmt (stmt
);
2712 if (fndecl_was_null
)
2713 current_function_decl
= NULL
;
2716 /* Verify that call graph edge corresponds to DECL from the associated
2717 statement. Return true if the verification should fail. */
2720 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
2724 if (!decl
|| callee
->global
.inlined_to
)
2726 if (symtab
->state
== LTO_STREAMING
)
2728 node
= cgraph_node::get (decl
);
2730 /* We do not know if a node from a different partition is an alias or what it
2731 aliases and therefore cannot do the former_clone_of check reliably. When
2732 body_removed is set, we have lost all information about what was alias or
2733 thunk of and also cannot proceed. */
2735 || node
->body_removed
2736 || node
->in_other_partition
2737 || callee
->icf_merged
2738 || callee
->in_other_partition
)
2741 node
= node
->ultimate_alias_target ();
2743 /* Optimizers can redirect unreachable calls or calls triggering undefined
2744 behaviour to builtin_unreachable. */
2745 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
2746 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
2749 if (callee
->former_clone_of
!= node
->decl
2750 && (node
!= callee
->ultimate_alias_target ())
2751 && !clone_of_p (node
, callee
))
2757 /* Verify cgraph nodes of given cgraph node. */
2759 cgraph_node::verify_node (void)
2762 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2763 basic_block this_block
;
2764 gimple_stmt_iterator gsi
;
2765 bool error_found
= false;
2770 timevar_push (TV_CGRAPH_VERIFY
);
2771 error_found
|= verify_base ();
2772 for (e
= callees
; e
; e
= e
->next_callee
)
2775 error ("aux field set for edge %s->%s",
2776 identifier_to_locale (e
->caller
->name ()),
2777 identifier_to_locale (e
->callee
->name ()));
2782 error ("execution count is negative");
2785 if (global
.inlined_to
&& same_comdat_group
)
2787 error ("inline clone in same comdat group list");
2790 if (!definition
&& !in_other_partition
&& local
.local
)
2792 error ("local symbols must be defined");
2795 if (global
.inlined_to
&& externally_visible
)
2797 error ("externally visible inline clone");
2800 if (global
.inlined_to
&& address_taken
)
2802 error ("inline clone with address taken");
2805 if (global
.inlined_to
&& force_output
)
2807 error ("inline clone is forced to output");
2810 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2814 error ("aux field set for indirect edge from %s",
2815 identifier_to_locale (e
->caller
->name ()));
2818 if (!e
->indirect_unknown_callee
2819 || !e
->indirect_info
)
2821 error ("An indirect edge from %s is not marked as indirect or has "
2822 "associated indirect_info, the corresponding statement is: ",
2823 identifier_to_locale (e
->caller
->name ()));
2824 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2828 bool check_comdat
= comdat_local_p ();
2829 for (e
= callers
; e
; e
= e
->next_caller
)
2831 if (e
->verify_count_and_frequency ())
2834 && !in_same_comdat_group_p (e
->caller
))
2836 error ("comdat-local function called by %s outside its comdat",
2837 identifier_to_locale (e
->caller
->name ()));
2840 if (!e
->inline_failed
)
2842 if (global
.inlined_to
2843 != (e
->caller
->global
.inlined_to
2844 ? e
->caller
->global
.inlined_to
: e
->caller
))
2846 error ("inlined_to pointer is wrong");
2849 if (callers
->next_caller
)
2851 error ("multiple inline callers");
2856 if (global
.inlined_to
)
2858 error ("inlined_to pointer set for noninline callers");
2862 for (e
= callees
; e
; e
= e
->next_callee
)
2864 if (e
->verify_count_and_frequency ())
2866 if (gimple_has_body_p (e
->caller
->decl
)
2867 && !e
->caller
->global
.inlined_to
2869 /* Optimized out calls are redirected to __builtin_unreachable. */
2872 != builtin_decl_implicit (BUILT_IN_UNREACHABLE
))
2874 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2875 gimple_bb (e
->call_stmt
))))
2877 error ("caller edge frequency %i does not match BB frequency %i",
2879 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2880 gimple_bb (e
->call_stmt
)));
2884 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2886 if (e
->verify_count_and_frequency ())
2888 if (gimple_has_body_p (e
->caller
->decl
)
2889 && !e
->caller
->global
.inlined_to
2892 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2893 gimple_bb (e
->call_stmt
))))
2895 error ("indirect call frequency %i does not match BB frequency %i",
2897 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2898 gimple_bb (e
->call_stmt
)));
2902 if (!callers
&& global
.inlined_to
)
2904 error ("inlined_to pointer is set but no predecessors found");
2907 if (global
.inlined_to
== this)
2909 error ("inlined_to pointer refers to itself");
2916 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2921 error ("cgraph_node has wrong clone_of");
2928 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2929 if (n
->clone_of
!= this)
2933 error ("cgraph_node has wrong clone list");
2937 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2939 error ("cgraph_node is in clone list but it is not clone");
2942 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2944 error ("cgraph_node has wrong prev_clone pointer");
2947 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2949 error ("double linked list of clones corrupted");
2953 if (analyzed
&& alias
)
2955 bool ref_found
= false;
2957 ipa_ref
*ref
= NULL
;
2961 error ("Alias has call edges");
2964 for (i
= 0; iterate_reference (i
, ref
); i
++)
2965 if (ref
->use
== IPA_REF_CHKP
)
2967 else if (ref
->use
!= IPA_REF_ALIAS
)
2969 error ("Alias has non-alias reference");
2974 error ("Alias has more than one alias reference");
2981 error ("Analyzed alias has no reference");
2986 /* Check instrumented version reference. */
2987 if (instrumented_version
2988 && instrumented_version
->instrumented_version
!= this)
2990 error ("Instrumentation clone does not reference original node");
2994 /* Cannot have orig_decl for not instrumented nodes. */
2995 if (!instrumentation_clone
&& orig_decl
)
2997 error ("Not instrumented node has non-NULL original declaration");
3001 /* If original not instrumented node still exists then we may check
3002 original declaration is set properly. */
3003 if (instrumented_version
3005 && orig_decl
!= instrumented_version
->decl
)
3007 error ("Instrumented node has wrong original declaration");
3011 /* Check all nodes have chkp reference to their instrumented versions. */
3013 && instrumented_version
3014 && !instrumentation_clone
)
3016 bool ref_found
= false;
3018 struct ipa_ref
*ref
;
3020 for (i
= 0; iterate_reference (i
, ref
); i
++)
3021 if (ref
->use
== IPA_REF_CHKP
)
3025 error ("Node has more than one chkp reference");
3028 if (ref
->referred
!= instrumented_version
)
3030 error ("Wrong node is referenced with chkp reference");
3038 error ("Analyzed node has no reference to instrumented version");
3043 if (instrumentation_clone
3044 && DECL_BUILT_IN_CLASS (decl
) == NOT_BUILT_IN
)
3046 tree name
= DECL_ASSEMBLER_NAME (decl
);
3047 tree orig_name
= DECL_ASSEMBLER_NAME (orig_decl
);
3049 if (!IDENTIFIER_TRANSPARENT_ALIAS (name
)
3050 || TREE_CHAIN (name
) != orig_name
)
3052 error ("Alias chain for instrumented node is broken");
3057 if (analyzed
&& thunk
.thunk_p
)
3061 error ("No edge out of thunk node");
3064 else if (callees
->next_callee
)
3066 error ("More than one edge out of thunk node");
3069 if (gimple_has_body_p (decl
))
3071 error ("Thunk is not supposed to have body");
3074 if (thunk
.add_pointer_bounds_args
3075 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3077 error ("Instrumentation thunk has wrong edge callee");
3081 else if (analyzed
&& gimple_has_body_p (decl
)
3082 && !TREE_ASM_WRITTEN (decl
)
3083 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3088 hash_set
<gimple
*> stmts
;
3090 ipa_ref
*ref
= NULL
;
3092 /* Reach the trees by walking over the CFG, and note the
3093 enclosing basic-blocks in the call edges. */
3094 FOR_EACH_BB_FN (this_block
, this_cfun
)
3096 for (gsi
= gsi_start_phis (this_block
);
3097 !gsi_end_p (gsi
); gsi_next (&gsi
))
3098 stmts
.add (gsi_stmt (gsi
));
3099 for (gsi
= gsi_start_bb (this_block
);
3103 gimple
*stmt
= gsi_stmt (gsi
);
3105 if (is_gimple_call (stmt
))
3107 cgraph_edge
*e
= get_edge (stmt
);
3108 tree decl
= gimple_call_fndecl (stmt
);
3113 error ("shared call_stmt:");
3114 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3117 if (!e
->indirect_unknown_callee
)
3119 if (e
->verify_corresponds_to_fndecl (decl
))
3121 error ("edge points to wrong declaration:");
3122 debug_tree (e
->callee
->decl
);
3123 fprintf (stderr
," Instead of:");
3130 error ("an indirect edge with unknown callee "
3131 "corresponding to a call_stmt with "
3132 "a known declaration:");
3134 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3140 error ("missing callgraph edge for call stmt:");
3141 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3147 for (i
= 0; iterate_reference (i
, ref
); i
++)
3148 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3150 error ("reference to dead statement");
3151 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3156 /* No CFG available?! */
3159 for (e
= callees
; e
; e
= e
->next_callee
)
3163 error ("edge %s->%s has no corresponding call_stmt",
3164 identifier_to_locale (e
->caller
->name ()),
3165 identifier_to_locale (e
->callee
->name ()));
3166 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3171 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3173 if (!e
->aux
&& !e
->speculative
)
3175 error ("an indirect edge from %s has no corresponding call_stmt",
3176 identifier_to_locale (e
->caller
->name ()));
3177 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3186 internal_error ("verify_cgraph_node failed");
3188 timevar_pop (TV_CGRAPH_VERIFY
);
3191 /* Verify whole cgraph structure. */
3193 cgraph_node::verify_cgraph_nodes (void)
3200 FOR_EACH_FUNCTION (node
)
3204 /* Walk the alias chain to return the function cgraph_node is alias of.
3205 Walk through thunks, too.
3206 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3209 cgraph_node::function_symbol (enum availability
*availability
)
3211 cgraph_node
*node
= ultimate_alias_target (availability
);
3213 while (node
->thunk
.thunk_p
)
3215 node
= node
->callees
->callee
;
3218 enum availability a
;
3219 a
= node
->get_availability ();
3220 if (a
< *availability
)
3223 node
= node
->ultimate_alias_target (availability
);
3228 /* Walk the alias chain to return the function cgraph_node is alias of.
3229 Walk through non virtual thunks, too. Thus we return either a function
3230 or a virtual thunk node.
3231 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3234 cgraph_node::function_or_virtual_thunk_symbol
3235 (enum availability
*availability
)
3237 cgraph_node
*node
= ultimate_alias_target (availability
);
3239 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3241 node
= node
->callees
->callee
;
3244 enum availability a
;
3245 a
= node
->get_availability ();
3246 if (a
< *availability
)
3249 node
= node
->ultimate_alias_target (availability
);
3254 /* When doing LTO, read cgraph_node's body from disk if it is not already
3258 cgraph_node::get_untransformed_body (void)
3260 lto_file_decl_data
*file_data
;
3261 const char *data
, *name
;
3263 tree decl
= this->decl
;
3265 if (DECL_RESULT (decl
))
3268 gcc_assert (in_lto_p
);
3270 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3272 file_data
= lto_file_data
;
3273 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3275 /* We may have renamed the declaration, e.g., a static function. */
3276 name
= lto_get_decl_name_mapping (file_data
, name
);
3278 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3281 fatal_error (input_location
, "%s: section %s is missing",
3282 file_data
->file_name
,
3285 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3287 lto_input_function_body (file_data
, this, data
);
3288 lto_stats
.num_function_bodies
++;
3289 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3291 lto_free_function_in_decl_state_for_node (this);
3292 /* Keep lto file data so ipa-inline-analysis knows about cross module
3295 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3300 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3301 if it is not already present. When some IPA transformations are scheduled,
3305 cgraph_node::get_body (void)
3309 updated
= get_untransformed_body ();
3311 /* Getting transformed body makes no sense for inline clones;
3312 we should never use this on real clones becuase they are materialized
3314 TODO: Materializing clones here will likely lead to smaller LTRANS
3316 gcc_assert (!global
.inlined_to
&& !clone_of
);
3317 if (ipa_transforms_to_apply
.exists ())
3319 opt_pass
*saved_current_pass
= current_pass
;
3320 FILE *saved_dump_file
= dump_file
;
3321 int saved_dump_flags
= dump_flags
;
3323 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3324 execute_all_ipa_transforms ();
3325 cgraph_edge::rebuild_edges ();
3326 free_dominance_info (CDI_DOMINATORS
);
3327 free_dominance_info (CDI_POST_DOMINATORS
);
3331 current_pass
= saved_current_pass
;
3332 dump_file
= saved_dump_file
;
3333 dump_flags
= saved_dump_flags
;
3338 /* Return the DECL_STRUCT_FUNCTION of the function. */
3341 cgraph_node::get_fun (void)
3343 cgraph_node
*node
= this;
3344 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3346 while (!fun
&& node
->clone_of
)
3348 node
= node
->clone_of
;
3349 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3355 /* Verify if the type of the argument matches that of the function
3356 declaration. If we cannot verify this or there is a mismatch,
3360 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3363 unsigned int i
, nargs
;
3365 /* Calls to internal functions always match their signature. */
3366 if (gimple_call_internal_p (stmt
))
3369 nargs
= gimple_call_num_args (stmt
);
3371 /* Get argument types for verification. */
3373 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3375 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3377 /* Verify if the type of the argument matches that of the function
3378 declaration. If we cannot verify this or there is a mismatch,
3380 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3382 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3384 i
++, p
= DECL_CHAIN (p
))
3387 /* We cannot distinguish a varargs function from the case
3388 of excess parameters, still deferring the inlining decision
3389 to the callee is possible. */
3392 arg
= gimple_call_arg (stmt
, i
);
3393 if (p
== error_mark_node
3394 || DECL_ARG_TYPE (p
) == error_mark_node
3395 || arg
== error_mark_node
3396 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3397 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3400 if (args_count_match
&& p
)
3405 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3408 /* If this is a varargs function defer inlining decision
3412 arg
= gimple_call_arg (stmt
, i
);
3413 if (TREE_VALUE (p
) == error_mark_node
3414 || arg
== error_mark_node
3415 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3416 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3417 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3429 /* Verify if the type of the argument and lhs of CALL_STMT matches
3430 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3431 true, the arg count needs to be the same.
3432 If we cannot verify this or there is a mismatch, return false. */
3435 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3436 bool args_count_match
)
3440 if ((DECL_RESULT (callee
)
3441 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3442 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3443 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3445 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3446 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3451 /* Reset all state within cgraph.c so that we can rerun the compiler
3452 within the same process. For use by toplev::finalize. */
3455 cgraph_c_finalize (void)
3459 x_cgraph_nodes_queue
= NULL
;
3461 cgraph_fnver_htab
= NULL
;
3462 version_info_node
= NULL
;
3465 /* A wroker for call_for_symbol_and_aliases. */
3468 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3471 bool include_overwritable
)
3474 FOR_EACH_ALIAS (this, ref
)
3476 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3477 if (include_overwritable
3478 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3479 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3480 include_overwritable
))
3486 /* Return true if NODE has thunk. */
3489 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3491 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3492 if (e
->caller
->thunk
.thunk_p
)
3497 #include "gt-cgraph.h"