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 "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"
53 #include "ipa-inline.h"
55 #include "gimple-pretty-print.h"
59 #include "tree-chkp.h"
62 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
63 #include "tree-pass.h"
65 /* Queue of cgraph nodes scheduled to be lowered. */
66 symtab_node
*x_cgraph_nodes_queue
;
67 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
69 /* Symbol table global context. */
72 /* List of hooks triggered on cgraph_edge events. */
73 struct cgraph_edge_hook_list
{
74 cgraph_edge_hook hook
;
76 struct cgraph_edge_hook_list
*next
;
79 /* List of hooks triggered on cgraph_node events. */
80 struct cgraph_node_hook_list
{
81 cgraph_node_hook hook
;
83 struct cgraph_node_hook_list
*next
;
86 /* List of hooks triggered on events involving two cgraph_edges. */
87 struct cgraph_2edge_hook_list
{
88 cgraph_2edge_hook hook
;
90 struct cgraph_2edge_hook_list
*next
;
93 /* List of hooks triggered on events involving two cgraph_nodes. */
94 struct cgraph_2node_hook_list
{
95 cgraph_2node_hook hook
;
97 struct cgraph_2node_hook_list
*next
;
100 /* Hash descriptor for cgraph_function_version_info. */
102 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
104 static hashval_t
hash (cgraph_function_version_info
*);
105 static bool equal (cgraph_function_version_info
*,
106 cgraph_function_version_info
*);
109 /* Map a cgraph_node to cgraph_function_version_info using this htab.
110 The cgraph_function_version_info has a THIS_NODE field that is the
111 corresponding cgraph_node.. */
113 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
115 /* Hash function for cgraph_fnver_htab. */
117 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
119 int uid
= ptr
->this_node
->uid
;
120 return (hashval_t
)(uid
);
123 /* eq function for cgraph_fnver_htab. */
125 function_version_hasher::equal (cgraph_function_version_info
*n1
,
126 cgraph_function_version_info
*n2
)
128 return n1
->this_node
->uid
== n2
->this_node
->uid
;
131 /* Mark as GC root all allocated nodes. */
132 static GTY(()) struct cgraph_function_version_info
*
133 version_info_node
= NULL
;
135 /* Return true if NODE's address can be compared. */
138 symtab_node::address_can_be_compared_p ()
140 /* Address of virtual tables and functions is never compared. */
141 if (DECL_VIRTUAL_P (decl
))
143 /* Address of C++ cdtors is never compared. */
144 if (is_a
<cgraph_node
*> (this)
145 && (DECL_CXX_CONSTRUCTOR_P (decl
)
146 || DECL_CXX_DESTRUCTOR_P (decl
)))
148 /* Constant pool symbols addresses are never compared.
149 flag_merge_constants permits us to assume the same on readonly vars. */
150 if (is_a
<varpool_node
*> (this)
151 && (DECL_IN_CONSTANT_POOL (decl
)
152 || (flag_merge_constants
>= 2
153 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
158 /* Get the cgraph_function_version_info node corresponding to node. */
159 cgraph_function_version_info
*
160 cgraph_node::function_version (void)
162 cgraph_function_version_info key
;
163 key
.this_node
= this;
165 if (cgraph_fnver_htab
== NULL
)
168 return cgraph_fnver_htab
->find (&key
);
171 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
172 corresponding to cgraph_node NODE. */
173 cgraph_function_version_info
*
174 cgraph_node::insert_new_function_version (void)
176 version_info_node
= NULL
;
177 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
178 version_info_node
->this_node
= this;
180 if (cgraph_fnver_htab
== NULL
)
181 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
183 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
185 return version_info_node
;
188 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
189 DECL is a duplicate declaration. */
191 cgraph_node::delete_function_version (tree decl
)
193 cgraph_node
*decl_node
= cgraph_node::get (decl
);
194 cgraph_function_version_info
*decl_v
= NULL
;
196 if (decl_node
== NULL
)
199 decl_v
= decl_node
->function_version ();
204 if (decl_v
->prev
!= NULL
)
205 decl_v
->prev
->next
= decl_v
->next
;
207 if (decl_v
->next
!= NULL
)
208 decl_v
->next
->prev
= decl_v
->prev
;
210 if (cgraph_fnver_htab
!= NULL
)
211 cgraph_fnver_htab
->remove_elt (decl_v
);
213 decl_node
->remove ();
216 /* Record that DECL1 and DECL2 are semantically identical function
219 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
221 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
222 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
223 cgraph_function_version_info
*decl1_v
= NULL
;
224 cgraph_function_version_info
*decl2_v
= NULL
;
225 cgraph_function_version_info
*before
;
226 cgraph_function_version_info
*after
;
228 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
229 decl1_v
= decl1_node
->function_version ();
230 decl2_v
= decl2_node
->function_version ();
232 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
236 decl1_v
= decl1_node
->insert_new_function_version ();
239 decl2_v
= decl2_node
->insert_new_function_version ();
241 /* Chain decl2_v and decl1_v. All semantically identical versions
242 will be chained together. */
247 while (before
->next
!= NULL
)
248 before
= before
->next
;
250 while (after
->prev
!= NULL
)
253 before
->next
= after
;
254 after
->prev
= before
;
257 /* Initialize callgraph dump file. */
260 symbol_table::initialize (void)
263 dump_file
= dump_begin (TDI_cgraph
, NULL
);
266 /* Allocate new callgraph node and insert it into basic data structures. */
269 symbol_table::create_empty (void)
271 cgraph_node
*node
= allocate_cgraph_symbol ();
273 node
->type
= SYMTAB_FUNCTION
;
274 node
->frequency
= NODE_FREQUENCY_NORMAL
;
275 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
281 /* Register HOOK to be called with DATA on each removed edge. */
282 cgraph_edge_hook_list
*
283 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
285 cgraph_edge_hook_list
*entry
;
286 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
288 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
298 /* Remove ENTRY from the list of hooks called on removing edges. */
300 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
302 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
304 while (*ptr
!= entry
)
310 /* Call all edge removal hooks. */
312 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
314 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
317 entry
->hook (e
, entry
->data
);
322 /* Register HOOK to be called with DATA on each removed node. */
323 cgraph_node_hook_list
*
324 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
326 cgraph_node_hook_list
*entry
;
327 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
329 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
339 /* Remove ENTRY from the list of hooks called on removing nodes. */
341 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
343 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
345 while (*ptr
!= entry
)
351 /* Call all node removal hooks. */
353 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
355 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
358 entry
->hook (node
, entry
->data
);
363 /* Call all node removal hooks. */
365 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
367 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
370 entry
->hook (node
, entry
->data
);
376 /* Register HOOK to be called with DATA on each inserted node. */
377 cgraph_node_hook_list
*
378 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
380 cgraph_node_hook_list
*entry
;
381 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
383 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
393 /* Remove ENTRY from the list of hooks called on inserted nodes. */
395 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
397 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
399 while (*ptr
!= entry
)
405 /* Register HOOK to be called with DATA on each duplicated edge. */
406 cgraph_2edge_hook_list
*
407 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
409 cgraph_2edge_hook_list
*entry
;
410 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
412 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
422 /* Remove ENTRY from the list of hooks called on duplicating edges. */
424 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
426 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
428 while (*ptr
!= entry
)
434 /* Call all edge duplication hooks. */
436 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
438 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
441 entry
->hook (cs1
, cs2
, entry
->data
);
446 /* Register HOOK to be called with DATA on each duplicated node. */
447 cgraph_2node_hook_list
*
448 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
450 cgraph_2node_hook_list
*entry
;
451 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
453 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
463 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
465 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
467 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
469 while (*ptr
!= entry
)
475 /* Call all node duplication hooks. */
477 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
480 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
483 entry
->hook (node
, node2
, entry
->data
);
488 /* Return cgraph node assigned to DECL. Create new one when needed. */
491 cgraph_node::create (tree decl
)
493 cgraph_node
*node
= symtab
->create_empty ();
494 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
498 if ((flag_openacc
|| flag_openmp
)
499 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
501 node
->offloadable
= 1;
502 if (ENABLE_OFFLOADING
)
503 g
->have_offload
= true;
506 node
->register_symbol ();
508 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
510 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
511 node
->next_nested
= node
->origin
->nested
;
512 node
->origin
->nested
= node
;
517 /* Try to find a call graph node for declaration DECL and if it does not exist
518 or if it corresponds to an inline clone, create a new one. */
521 cgraph_node::get_create (tree decl
)
523 cgraph_node
*first_clone
= cgraph_node::get (decl
);
525 if (first_clone
&& !first_clone
->global
.inlined_to
)
528 cgraph_node
*node
= cgraph_node::create (decl
);
531 first_clone
->clone_of
= node
;
532 node
->clones
= first_clone
;
533 symtab
->symtab_prevail_in_asm_name_hash (node
);
534 node
->decl
->decl_with_vis
.symtab_node
= node
;
536 fprintf (dump_file
, "Introduced new external node "
537 "(%s/%i) and turned into root of the clone tree.\n",
538 node
->name (), node
->order
);
541 fprintf (dump_file
, "Introduced new external node "
542 "(%s/%i).\n", node
->name (), node
->order
);
546 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
547 the function body is associated with (not necessarily cgraph_node (DECL). */
550 cgraph_node::create_alias (tree alias
, tree target
)
552 cgraph_node
*alias_node
;
554 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
555 || TREE_CODE (target
) == IDENTIFIER_NODE
);
556 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
557 alias_node
= cgraph_node::get_create (alias
);
558 gcc_assert (!alias_node
->definition
);
559 alias_node
->alias_target
= target
;
560 alias_node
->definition
= true;
561 alias_node
->alias
= true;
562 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
563 alias_node
->transparent_alias
= alias_node
->weakref
= true;
567 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
569 Same body aliases are output whenever the body of DECL is output,
570 and cgraph_node::get (ALIAS) transparently returns
571 cgraph_node::get (DECL). */
574 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
577 #ifndef ASM_OUTPUT_DEF
578 /* If aliases aren't supported by the assembler, fail. */
581 /* Langhooks can create same body aliases of symbols not defined.
582 Those are useless. Drop them on the floor. */
583 if (symtab
->global_info_ready
)
586 n
= cgraph_node::create_alias (alias
, decl
);
587 n
->cpp_implicit_alias
= true;
588 if (symtab
->cpp_implicit_aliases_done
)
589 n
->resolve_alias (cgraph_node::get (decl
));
593 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
594 aliases DECL with an adjustments made into the first parameter.
595 See comments in thunk_adjust for detail on the parameters. */
598 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
599 HOST_WIDE_INT fixed_offset
,
600 HOST_WIDE_INT virtual_value
,
606 node
= cgraph_node::get (alias
);
610 node
= cgraph_node::create (alias
);
611 gcc_checking_assert (!virtual_offset
612 || wi::eq_p (virtual_offset
, virtual_value
));
613 node
->thunk
.fixed_offset
= fixed_offset
;
614 node
->thunk
.this_adjusting
= this_adjusting
;
615 node
->thunk
.virtual_value
= virtual_value
;
616 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
617 node
->thunk
.alias
= real_alias
;
618 node
->thunk
.thunk_p
= true;
619 node
->definition
= true;
624 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
625 Return NULL if there's no such node. */
628 cgraph_node::get_for_asmname (tree asmname
)
630 /* We do not want to look at inline clones. */
631 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
633 node
= node
->next_sharing_asm_name
)
635 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
636 if (cn
&& !cn
->global
.inlined_to
)
642 /* Returns a hash value for X (which really is a cgraph_edge). */
645 cgraph_edge_hasher::hash (cgraph_edge
*e
)
647 /* This is a really poor hash function, but it is what htab_hash_pointer
649 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
652 /* Returns a hash value for X (which really is a cgraph_edge). */
655 cgraph_edge_hasher::hash (gimple
*call_stmt
)
657 /* This is a really poor hash function, but it is what htab_hash_pointer
659 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
662 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
665 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
667 return x
->call_stmt
== y
;
670 /* Add call graph edge E to call site hash of its caller. */
673 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
675 gimple
*call
= e
->call_stmt
;
676 *e
->caller
->call_site_hash
->find_slot_with_hash
677 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
680 /* Add call graph edge E to call site hash of its caller. */
683 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
685 /* There are two speculative edges for every statement (one direct,
686 one indirect); always hash the direct one. */
687 if (e
->speculative
&& e
->indirect_unknown_callee
)
689 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
690 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
693 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
698 gcc_assert (!*slot
|| e
->speculative
);
702 /* Return the callgraph edge representing the GIMPLE_CALL statement
706 cgraph_node::get_edge (gimple
*call_stmt
)
712 return call_site_hash
->find_with_hash
713 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
715 /* This loop may turn out to be performance problem. In such case adding
716 hashtables into call nodes with very many edges is probably best
717 solution. It is not good idea to add pointer into CALL_EXPR itself
718 because we want to make possible having multiple cgraph nodes representing
719 different clones of the same body before the body is actually cloned. */
720 for (e
= callees
; e
; e
= e
->next_callee
)
722 if (e
->call_stmt
== call_stmt
)
728 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
730 if (e
->call_stmt
== call_stmt
)
737 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
738 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
739 cgraph_add_edge_to_call_site_hash (e2
);
740 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
741 cgraph_add_edge_to_call_site_hash (e2
);
748 /* Change field call_stmt of edge to NEW_STMT.
749 If UPDATE_SPECULATIVE and E is any component of speculative
750 edge, then update all components. */
753 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
757 /* Speculative edges has three component, update all of them
759 if (update_speculative
&& speculative
)
761 cgraph_edge
*direct
, *indirect
;
764 speculative_call_info (direct
, indirect
, ref
);
765 direct
->set_call_stmt (new_stmt
, false);
766 indirect
->set_call_stmt (new_stmt
, false);
767 ref
->stmt
= new_stmt
;
771 /* Only direct speculative edges go to call_site_hash. */
772 if (caller
->call_site_hash
773 && (!speculative
|| !indirect_unknown_callee
))
775 caller
->call_site_hash
->remove_elt_with_hash
776 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
779 cgraph_edge
*e
= this;
781 call_stmt
= new_stmt
;
782 if (indirect_unknown_callee
783 && (decl
= gimple_call_fndecl (new_stmt
)))
785 /* Constant propagation (and possibly also inlining?) can turn an
786 indirect call into a direct one. */
787 cgraph_node
*new_callee
= cgraph_node::get (decl
);
789 gcc_checking_assert (new_callee
);
790 e
= make_direct (new_callee
);
793 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
794 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
796 if (e
->caller
->call_site_hash
)
797 cgraph_add_edge_to_call_site_hash (e
);
800 /* Allocate a cgraph_edge structure and fill it with data according to the
801 parameters of which only CALLEE can be NULL (when creating an indirect call
805 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
806 gcall
*call_stmt
, gcov_type count
, int freq
,
807 bool indir_unknown_callee
)
811 /* LTO does not actually have access to the call_stmt since these
812 have not been loaded yet. */
815 /* This is a rather expensive check possibly triggering
816 construction of call stmt hashtable. */
818 gcc_checking_assert (!(e
= caller
->get_edge (call_stmt
))
821 gcc_assert (is_gimple_call (call_stmt
));
827 free_edges
= NEXT_FREE_EDGE (edge
);
831 edge
= ggc_alloc
<cgraph_edge
> ();
832 edge
->uid
= edges_max_uid
++;
838 edge
->caller
= caller
;
839 edge
->callee
= callee
;
840 edge
->prev_caller
= NULL
;
841 edge
->next_caller
= NULL
;
842 edge
->prev_callee
= NULL
;
843 edge
->next_callee
= NULL
;
844 edge
->lto_stmt_uid
= 0;
847 gcc_assert (count
>= 0);
848 edge
->frequency
= freq
;
849 gcc_assert (freq
>= 0);
850 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
852 edge
->call_stmt
= call_stmt
;
853 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
854 edge
->can_throw_external
855 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
858 && callee
&& callee
->decl
859 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
861 edge
->call_stmt_cannot_inline_p
= true;
863 edge
->call_stmt_cannot_inline_p
= false;
865 edge
->indirect_info
= NULL
;
866 edge
->indirect_inlining_edge
= 0;
867 edge
->speculative
= false;
868 edge
->indirect_unknown_callee
= indir_unknown_callee
;
869 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
870 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
871 edge
->in_polymorphic_cdtor
872 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
875 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
876 if (call_stmt
&& caller
->call_site_hash
)
877 cgraph_add_edge_to_call_site_hash (edge
);
882 /* Create edge from a given function to CALLEE in the cgraph. */
885 cgraph_node::create_edge (cgraph_node
*callee
,
886 gcall
*call_stmt
, gcov_type count
, int freq
)
888 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
891 initialize_inline_failed (edge
);
893 edge
->next_caller
= callee
->callers
;
895 callee
->callers
->prev_caller
= edge
;
896 edge
->next_callee
= callees
;
898 callees
->prev_callee
= edge
;
900 callee
->callers
= edge
;
905 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
907 cgraph_indirect_call_info
*
908 cgraph_allocate_init_indirect_info (void)
910 cgraph_indirect_call_info
*ii
;
912 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
913 ii
->param_index
= -1;
917 /* Create an indirect edge with a yet-undetermined callee where the call
918 statement destination is a formal parameter of the caller with index
922 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
923 gcov_type count
, int freq
,
924 bool compute_indirect_info
)
926 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
930 initialize_inline_failed (edge
);
932 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
933 edge
->indirect_info
->ecf_flags
= ecf_flags
;
934 edge
->indirect_info
->vptr_changed
= true;
936 /* Record polymorphic call info. */
937 if (compute_indirect_info
939 && (target
= gimple_call_fn (call_stmt
))
940 && virtual_method_call_p (target
))
942 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
944 /* Only record types can have virtual calls. */
945 edge
->indirect_info
->polymorphic
= true;
946 edge
->indirect_info
->param_index
= -1;
947 edge
->indirect_info
->otr_token
948 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
949 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
950 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
951 edge
->indirect_info
->context
= context
;
954 edge
->next_callee
= indirect_calls
;
956 indirect_calls
->prev_callee
= edge
;
957 indirect_calls
= edge
;
962 /* Remove the edge from the list of the callees of the caller. */
965 cgraph_edge::remove_caller (void)
968 prev_callee
->next_callee
= next_callee
;
970 next_callee
->prev_callee
= prev_callee
;
973 if (indirect_unknown_callee
)
974 caller
->indirect_calls
= next_callee
;
976 caller
->callees
= next_callee
;
978 if (caller
->call_site_hash
)
979 caller
->call_site_hash
->remove_elt_with_hash
980 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
983 /* Put the edge onto the free list. */
986 symbol_table::free_edge (cgraph_edge
*e
)
990 if (e
->indirect_info
)
991 ggc_free (e
->indirect_info
);
993 /* Clear out the edge so we do not dangle pointers. */
994 memset (e
, 0, sizeof (*e
));
996 NEXT_FREE_EDGE (e
) = free_edges
;
1001 /* Remove the edge in the cgraph. */
1004 cgraph_edge::remove (void)
1006 /* Call all edge removal hooks. */
1007 symtab
->call_edge_removal_hooks (this);
1009 if (!indirect_unknown_callee
)
1010 /* Remove from callers list of the callee. */
1013 /* Remove from callees list of the callers. */
1016 /* Put the edge onto the free list. */
1017 symtab
->free_edge (this);
1020 /* Turn edge into speculative call calling N2. Update
1021 the profile so the direct call is taken COUNT times
1024 At clone materialization time, the indirect call E will
1027 if (call_dest == N2)
1032 At this time the function just creates the direct call,
1033 the referencd representing the if conditional and attaches
1034 them all to the orginal indirect call statement.
1036 Return direct edge created. */
1039 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1040 int direct_frequency
)
1042 cgraph_node
*n
= caller
;
1043 ipa_ref
*ref
= NULL
;
1048 fprintf (dump_file
, "Indirect call -> speculative call"
1049 " %s/%i => %s/%i\n",
1050 xstrdup_for_dump (n
->name ()), n
->order
,
1051 xstrdup_for_dump (n2
->name ()), n2
->order
);
1054 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1055 initialize_inline_failed (e2
);
1056 e2
->speculative
= true;
1057 if (TREE_NOTHROW (n2
->decl
))
1058 e2
->can_throw_external
= false;
1060 e2
->can_throw_external
= can_throw_external
;
1061 e2
->lto_stmt_uid
= lto_stmt_uid
;
1062 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1064 frequency
-= e2
->frequency
;
1065 symtab
->call_edge_duplication_hooks (this, e2
);
1066 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1067 ref
->lto_stmt_uid
= lto_stmt_uid
;
1068 ref
->speculative
= speculative
;
1069 n2
->mark_address_taken ();
1073 /* Speculative call consist of three components:
1074 1) an indirect edge representing the original call
1075 2) an direct edge representing the new call
1076 3) ADDR_EXPR reference representing the speculative check.
1077 All three components are attached to single statement (the indirect
1078 call) and if one of them exists, all of them must exist.
1080 Given speculative call edge, return all three components.
1084 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1085 cgraph_edge
*&indirect
,
1086 ipa_ref
*&reference
)
1091 cgraph_edge
*e
= this;
1093 if (!e
->indirect_unknown_callee
)
1094 for (e2
= e
->caller
->indirect_calls
;
1095 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1096 e2
= e2
->next_callee
)
1101 /* We can take advantage of the call stmt hash. */
1104 e
= e
->caller
->get_edge (e2
->call_stmt
);
1105 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1108 for (e
= e
->caller
->callees
;
1109 e2
->call_stmt
!= e
->call_stmt
1110 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1114 gcc_assert (e
->speculative
&& e2
->speculative
);
1119 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1120 if (ref
->speculative
1121 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1122 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1128 /* Speculative edge always consist of all three components - direct edge,
1129 indirect and reference. */
1131 gcc_assert (e
&& e2
&& ref
);
1134 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1135 Remove the speculative call sequence and return edge representing the call.
1136 It is up to caller to redirect the call as appropriate. */
1139 cgraph_edge::resolve_speculation (tree callee_decl
)
1141 cgraph_edge
*edge
= this;
1145 gcc_assert (edge
->speculative
);
1146 edge
->speculative_call_info (e2
, edge
, ref
);
1148 || !ref
->referred
->semantically_equivalent_p
1149 (symtab_node::get (callee_decl
)))
1155 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1156 "turned out to have contradicting known target ",
1157 xstrdup_for_dump (edge
->caller
->name ()),
1158 edge
->caller
->order
,
1159 xstrdup_for_dump (e2
->callee
->name ()),
1161 print_generic_expr (dump_file
, callee_decl
, 0);
1162 fprintf (dump_file
, "\n");
1166 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1167 xstrdup_for_dump (edge
->caller
->name ()),
1168 edge
->caller
->order
,
1169 xstrdup_for_dump (e2
->callee
->name ()),
1176 cgraph_edge
*tmp
= edge
;
1178 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1181 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1182 in the functions inlined through it. */
1184 edge
->count
+= e2
->count
;
1185 edge
->frequency
+= e2
->frequency
;
1186 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1187 edge
->frequency
= CGRAPH_FREQ_MAX
;
1188 edge
->speculative
= false;
1189 e2
->speculative
= false;
1190 ref
->remove_reference ();
1191 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1194 e2
->callee
->remove_symbol_and_inline_clones ();
1195 if (edge
->caller
->call_site_hash
)
1196 cgraph_update_edge_in_call_site_hash (edge
);
1200 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1201 CALLEE. DELTA is an integer constant that is to be added to the this
1202 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1205 cgraph_edge::make_direct (cgraph_node
*callee
)
1207 cgraph_edge
*edge
= this;
1208 gcc_assert (indirect_unknown_callee
);
1210 /* If we are redirecting speculative call, make it non-speculative. */
1211 if (indirect_unknown_callee
&& speculative
)
1213 edge
= edge
->resolve_speculation (callee
->decl
);
1215 /* On successful speculation just return the pre existing direct edge. */
1216 if (!indirect_unknown_callee
)
1220 indirect_unknown_callee
= 0;
1221 ggc_free (indirect_info
);
1222 indirect_info
= NULL
;
1224 /* Get the edge out of the indirect edge list. */
1226 prev_callee
->next_callee
= next_callee
;
1228 next_callee
->prev_callee
= prev_callee
;
1230 caller
->indirect_calls
= next_callee
;
1232 /* Put it into the normal callee list */
1234 next_callee
= caller
->callees
;
1235 if (caller
->callees
)
1236 caller
->callees
->prev_callee
= edge
;
1237 caller
->callees
= edge
;
1239 /* Insert to callers list of the new callee. */
1240 edge
->set_callee (callee
);
1243 call_stmt_cannot_inline_p
1244 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1247 /* We need to re-determine the inlining status of the edge. */
1248 initialize_inline_failed (edge
);
1252 /* If necessary, change the function declaration in the call statement
1253 associated with E so that it corresponds to the edge callee. */
1256 cgraph_edge::redirect_call_stmt_to_callee (void)
1258 cgraph_edge
*e
= this;
1260 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1261 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1263 gimple_stmt_iterator gsi
;
1264 bool skip_bounds
= false;
1272 e
->speculative_call_info (e
, e2
, ref
);
1273 /* If there already is an direct call (i.e. as a result of inliner's
1274 substitution), forget about speculating. */
1276 e
= e
->resolve_speculation (decl
);
1277 /* If types do not match, speculation was likely wrong.
1278 The direct edge was posisbly redirected to the clone with a different
1279 signature. We did not update the call statement yet, so compare it
1280 with the reference that still points to the proper type. */
1281 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1282 ref
->referred
->decl
,
1286 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1288 xstrdup_for_dump (e
->caller
->name ()),
1290 xstrdup_for_dump (e
->callee
->name ()),
1292 e
= e
->resolve_speculation ();
1293 /* We are producing the final function body and will throw away the
1294 callgraph edges really soon. Reset the counts/frequencies to
1295 keep verifier happy in the case of roundoff errors. */
1296 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1297 e
->frequency
= compute_call_stmt_bb_frequency
1298 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1300 /* Expand speculation into GIMPLE code. */
1305 "Expanding speculative call of %s/%i -> %s/%i count:"
1307 xstrdup_for_dump (e
->caller
->name ()),
1309 xstrdup_for_dump (e
->callee
->name ()),
1312 gcc_assert (e2
->speculative
);
1313 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1314 new_stmt
= gimple_ic (e
->call_stmt
,
1315 dyn_cast
<cgraph_node
*> (ref
->referred
),
1316 e
->count
|| e2
->count
1317 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1318 e
->count
+ e2
->count
)
1319 : e
->frequency
|| e2
->frequency
1320 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1321 e
->frequency
+ e2
->frequency
)
1322 : REG_BR_PROB_BASE
/ 2,
1323 e
->count
, e
->count
+ e2
->count
);
1324 e
->speculative
= false;
1325 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1328 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1329 processed call stmt. */
1330 if (gimple_call_with_bounds_p (new_stmt
)
1331 && gimple_call_lhs (new_stmt
)
1332 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1334 tree dresult
= gimple_call_lhs (new_stmt
);
1335 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1336 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1337 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1338 struct cgraph_edge
*iedge
1339 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1340 struct cgraph_edge
*dedge
;
1344 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1347 dedge
->frequency
= compute_call_stmt_bb_frequency
1348 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1350 iedge
->frequency
= compute_call_stmt_bb_frequency
1351 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1354 e
->frequency
= compute_call_stmt_bb_frequency
1355 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1356 e2
->frequency
= compute_call_stmt_bb_frequency
1357 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1358 e2
->speculative
= false;
1359 ref
->speculative
= false;
1361 /* Indirect edges are not both in the call site hash.
1363 if (e
->caller
->call_site_hash
)
1364 cgraph_update_edge_in_call_site_hash (e2
);
1366 /* Continue redirecting E to proper target. */
1370 /* We might propagate instrumented function pointer into
1371 not instrumented function and vice versa. In such a
1372 case we need to either fix function declaration or
1373 remove bounds from call statement. */
1374 if (flag_check_pointer_bounds
&& e
->callee
)
1375 skip_bounds
= chkp_redirect_edge (e
);
1377 if (e
->indirect_unknown_callee
1378 || (decl
== e
->callee
->decl
1380 return e
->call_stmt
;
1382 if (flag_checking
&& decl
)
1384 cgraph_node
*node
= cgraph_node::get (decl
);
1385 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1388 if (symtab
->dump_file
)
1390 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1391 xstrdup_for_dump (e
->caller
->name ()), e
->caller
->order
,
1392 xstrdup_for_dump (e
->callee
->name ()), e
->callee
->order
);
1393 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1394 if (e
->callee
->clone
.combined_args_to_skip
)
1396 fprintf (symtab
->dump_file
, " combined args to skip: ");
1397 dump_bitmap (symtab
->dump_file
,
1398 e
->callee
->clone
.combined_args_to_skip
);
1402 if (e
->callee
->clone
.combined_args_to_skip
1407 new_stmt
= e
->call_stmt
;
1408 if (e
->callee
->clone
.combined_args_to_skip
)
1410 = gimple_call_copy_skip_args (new_stmt
,
1411 e
->callee
->clone
.combined_args_to_skip
);
1413 new_stmt
= chkp_copy_call_skip_bounds (new_stmt
);
1415 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1416 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1418 if (gimple_vdef (new_stmt
)
1419 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1420 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1422 gsi
= gsi_for_stmt (e
->call_stmt
);
1423 gsi_replace (&gsi
, new_stmt
, false);
1424 /* We need to defer cleaning EH info on the new statement to
1425 fixup-cfg. We may not have dominator information at this point
1426 and thus would end up with unreachable blocks and have no way
1427 to communicate that we need to run CFG cleanup then. */
1428 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1431 remove_stmt_from_eh_lp (e
->call_stmt
);
1432 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1437 new_stmt
= e
->call_stmt
;
1438 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1439 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1442 /* If the call becomes noreturn, remove the LHS if possible. */
1444 && (gimple_call_flags (new_stmt
) & ECF_NORETURN
)
1445 && TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (lhs
))) == INTEGER_CST
)
1447 if (TREE_CODE (lhs
) == SSA_NAME
)
1449 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1450 TREE_TYPE (lhs
), NULL
);
1451 var
= get_or_create_ssa_default_def
1452 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1453 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1454 gsi
= gsi_for_stmt (new_stmt
);
1455 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1456 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1458 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1459 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1462 /* If new callee has no static chain, remove it. */
1463 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1465 gimple_call_set_chain (new_stmt
, NULL
);
1466 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1469 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1472 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1474 if (symtab
->dump_file
)
1476 fprintf (symtab
->dump_file
, " updated to:");
1477 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1482 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1483 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1484 of OLD_STMT if it was previously call statement.
1485 If NEW_STMT is NULL, the call has been dropped without any
1489 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1490 gimple
*old_stmt
, tree old_call
,
1493 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1494 ? gimple_call_fndecl (new_stmt
) : 0;
1496 /* We are seeing indirect calls, then there is nothing to update. */
1497 if (!new_call
&& !old_call
)
1499 /* See if we turned indirect call into direct call or folded call to one builtin
1500 into different builtin. */
1501 if (old_call
!= new_call
)
1503 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1504 cgraph_edge
*ne
= NULL
;
1510 /* Keep calls marked as dead dead. */
1511 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1512 && DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
1513 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
1515 node
->get_edge (old_stmt
)->set_call_stmt
1516 (as_a
<gcall
*> (new_stmt
));
1519 /* See if the edge is already there and has the correct callee. It
1520 might be so because of indirect inlining has already updated
1521 it. We also might've cloned and redirected the edge. */
1522 if (new_call
&& e
->callee
)
1524 cgraph_node
*callee
= e
->callee
;
1527 if (callee
->decl
== new_call
1528 || callee
->former_clone_of
== new_call
)
1530 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1533 callee
= callee
->clone_of
;
1537 /* Otherwise remove edge and create new one; we can't simply redirect
1538 since function has changed, so inline plan and other information
1539 attached to edge is invalid. */
1541 frequency
= e
->frequency
;
1542 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1545 e
->callee
->remove_symbol_and_inline_clones ();
1549 /* We are seeing new direct call; compute profile info based on BB. */
1550 basic_block bb
= gimple_bb (new_stmt
);
1552 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1558 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1559 as_a
<gcall
*> (new_stmt
), count
,
1561 gcc_assert (ne
->inline_failed
);
1564 /* We only updated the call stmt; update pointer in cgraph edge.. */
1565 else if (old_stmt
!= new_stmt
)
1566 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1569 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1570 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1571 of OLD_STMT before it was updated (updating can happen inplace). */
1574 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1577 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1580 gcc_checking_assert (orig
);
1581 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1583 for (node
= orig
->clones
; node
!= orig
;)
1585 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1587 node
= node
->clones
;
1588 else if (node
->next_sibling_clone
)
1589 node
= node
->next_sibling_clone
;
1592 while (node
!= orig
&& !node
->next_sibling_clone
)
1593 node
= node
->clone_of
;
1595 node
= node
->next_sibling_clone
;
1601 /* Remove all callees from the node. */
1604 cgraph_node::remove_callees (void)
1608 /* It is sufficient to remove the edges from the lists of callers of
1609 the callees. The callee list of the node can be zapped with one
1611 for (e
= callees
; e
; e
= f
)
1614 symtab
->call_edge_removal_hooks (e
);
1615 if (!e
->indirect_unknown_callee
)
1616 e
->remove_callee ();
1617 symtab
->free_edge (e
);
1619 for (e
= indirect_calls
; e
; e
= f
)
1622 symtab
->call_edge_removal_hooks (e
);
1623 if (!e
->indirect_unknown_callee
)
1624 e
->remove_callee ();
1625 symtab
->free_edge (e
);
1627 indirect_calls
= NULL
;
1631 call_site_hash
->empty ();
1632 call_site_hash
= NULL
;
1636 /* Remove all callers from the node. */
1639 cgraph_node::remove_callers (void)
1643 /* It is sufficient to remove the edges from the lists of callees of
1644 the callers. The caller list of the node can be zapped with one
1646 for (e
= callers
; e
; e
= f
)
1649 symtab
->call_edge_removal_hooks (e
);
1650 e
->remove_caller ();
1651 symtab
->free_edge (e
);
1656 /* Helper function for cgraph_release_function_body and free_lang_data.
1657 It releases body from function DECL without having to inspect its
1658 possibly non-existent symtab node. */
1661 release_function_body (tree decl
)
1663 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1670 && loops_for_fn (fn
))
1672 fn
->curr_properties
&= ~PROP_loops
;
1673 loop_optimizer_finalize (fn
);
1677 delete_tree_ssa (fn
);
1678 delete_tree_cfg_annotations (fn
);
1683 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1684 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1688 if (fn
->value_histograms
)
1689 free_histograms (fn
);
1691 gimple_set_body (decl
, NULL
);
1692 /* Struct function hangs a lot of data that would leak if we didn't
1693 removed all pointers to it. */
1695 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1697 DECL_SAVED_TREE (decl
) = NULL
;
1700 /* Release memory used to represent body of function.
1701 Use this only for functions that are released before being translated to
1702 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1703 are free'd in final.c via free_after_compilation().
1704 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1707 cgraph_node::release_body (bool keep_arguments
)
1709 ipa_transforms_to_apply
.release ();
1710 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1712 DECL_RESULT (decl
) = NULL
;
1714 if (!keep_arguments
)
1715 DECL_ARGUMENTS (decl
) = NULL
;
1717 /* If the node is abstract and needed, then do not clear
1718 DECL_INITIAL of its associated function declaration because it's
1719 needed to emit debug info later. */
1720 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1721 DECL_INITIAL (decl
) = error_mark_node
;
1722 release_function_body (decl
);
1725 lto_free_function_in_decl_state_for_node (this);
1726 lto_file_data
= NULL
;
1730 /* Remove function from symbol table. */
1733 cgraph_node::remove (void)
1736 int uid
= this->uid
;
1738 symtab
->call_cgraph_removal_hooks (this);
1741 ipa_transforms_to_apply
.release ();
1743 /* Incremental inlining access removed nodes stored in the postorder list.
1745 force_output
= false;
1746 forced_by_abi
= false;
1747 for (n
= nested
; n
; n
= n
->next_nested
)
1752 cgraph_node
**node2
= &origin
->nested
;
1754 while (*node2
!= this)
1755 node2
= &(*node2
)->next_nested
;
1756 *node2
= next_nested
;
1759 if (prev_sibling_clone
)
1760 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1762 clone_of
->clones
= next_sibling_clone
;
1763 if (next_sibling_clone
)
1764 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1767 cgraph_node
*n
, *next
;
1771 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1772 n
->clone_of
= clone_of
;
1773 n
->clone_of
= clone_of
;
1774 n
->next_sibling_clone
= clone_of
->clones
;
1775 if (clone_of
->clones
)
1776 clone_of
->clones
->prev_sibling_clone
= n
;
1777 clone_of
->clones
= clones
;
1781 /* We are removing node with clones. This makes clones inconsistent,
1782 but assume they will be removed subsequently and just keep clone
1783 tree intact. This can happen in unreachable function removal since
1784 we remove unreachable functions in random order, not by bottom-up
1785 walk of clone trees. */
1786 for (n
= clones
; n
; n
= next
)
1788 next
= n
->next_sibling_clone
;
1789 n
->next_sibling_clone
= NULL
;
1790 n
->prev_sibling_clone
= NULL
;
1796 /* While all the clones are removed after being proceeded, the function
1797 itself is kept in the cgraph even after it is compiled. Check whether
1798 we are done with this body and reclaim it proactively if this is the case.
1800 if (symtab
->state
!= LTO_STREAMING
)
1802 n
= cgraph_node::get (decl
);
1804 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1805 && ((symtab
->global_info_ready
|| in_lto_p
)
1806 && (TREE_ASM_WRITTEN (n
->decl
)
1807 || DECL_EXTERNAL (n
->decl
)
1809 || (!flag_wpa
&& n
->in_other_partition
)))))
1814 lto_free_function_in_decl_state_for_node (this);
1815 lto_file_data
= NULL
;
1821 call_site_hash
->empty ();
1822 call_site_hash
= NULL
;
1825 if (instrumented_version
)
1827 instrumented_version
->instrumented_version
= NULL
;
1828 instrumented_version
= NULL
;
1831 symtab
->release_symbol (this, uid
);
1834 /* Likewise indicate that a node is having address taken. */
1837 cgraph_node::mark_address_taken (void)
1839 /* Indirect inlining can figure out that all uses of the address are
1841 if (global
.inlined_to
)
1843 gcc_assert (cfun
->after_inlining
);
1844 gcc_assert (callers
->indirect_inlining_edge
);
1847 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1848 IPA_REF_ADDR reference exists (and thus it should be set on node
1849 representing alias we take address of) and as a test whether address
1850 of the object was taken (and thus it should be set on node alias is
1851 referring to). We should remove the first use and the remove the
1854 cgraph_node
*node
= ultimate_alias_target ();
1855 node
->address_taken
= 1;
1858 /* Return local info for the compiled function. */
1861 cgraph_node::local_info (tree decl
)
1863 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1864 cgraph_node
*node
= get (decl
);
1867 return &node
->ultimate_alias_target ()->local
;
1870 /* Return local info for the compiled function. */
1873 cgraph_node::rtl_info (tree decl
)
1875 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1876 cgraph_node
*node
= get (decl
);
1879 node
= node
->ultimate_alias_target ();
1880 if (node
->decl
!= current_function_decl
1881 && !TREE_ASM_WRITTEN (node
->decl
))
1883 /* Allocate if it doesnt exist. */
1884 if (node
->ultimate_alias_target ()->rtl
== NULL
)
1885 node
->ultimate_alias_target ()->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1886 return node
->ultimate_alias_target ()->rtl
;
1889 /* Return a string describing the failure REASON. */
1892 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1895 #define DEFCIFCODE(code, type, string) string,
1897 static const char *cif_string_table
[CIF_N_REASONS
] = {
1898 #include "cif-code.def"
1901 /* Signedness of an enum type is implementation defined, so cast it
1902 to unsigned before testing. */
1903 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1904 return cif_string_table
[reason
];
1907 /* Return a type describing the failure REASON. */
1909 cgraph_inline_failed_type_t
1910 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1913 #define DEFCIFCODE(code, type, string) type,
1915 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1916 #include "cif-code.def"
1919 /* Signedness of an enum type is implementation defined, so cast it
1920 to unsigned before testing. */
1921 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1922 return cif_type_table
[reason
];
1925 /* Names used to print out the availability enum. */
1926 const char * const cgraph_availability_names
[] =
1927 {"unset", "not_available", "overwritable", "available", "local"};
1929 /* Output flags of edge to a file F. */
1932 cgraph_edge::dump_edge_flags (FILE *f
)
1935 fprintf (f
, "(speculative) ");
1937 fprintf (f
, "(inlined) ");
1938 if (indirect_inlining_edge
)
1939 fprintf (f
, "(indirect_inlining) ");
1941 fprintf (f
, "(%" PRId64
"x) ", (int64_t)count
);
1943 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
1944 if (can_throw_external
)
1945 fprintf (f
, "(can throw external) ");
1948 /* Dump call graph node to file F. */
1951 cgraph_node::dump (FILE *f
)
1957 if (global
.inlined_to
)
1958 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1959 xstrdup_for_dump (name ()),
1961 xstrdup_for_dump (global
.inlined_to
->name ()),
1962 global
.inlined_to
->order
);
1964 fprintf (f
, " Clone of %s/%i\n",
1965 clone_of
->asm_name (),
1967 if (symtab
->function_flags_ready
)
1968 fprintf (f
, " Availability: %s\n",
1969 cgraph_availability_names
[get_availability ()]);
1972 fprintf (f
, " Profile id: %i\n",
1974 fprintf (f
, " First run: %i\n", tp_first_run
);
1975 fprintf (f
, " Function flags:");
1977 fprintf (f
, " executed %" PRId64
"x",
1980 fprintf (f
, " nested in: %s", origin
->asm_name ());
1981 if (gimple_has_body_p (decl
))
1982 fprintf (f
, " body");
1984 fprintf (f
, " process");
1986 fprintf (f
, " local");
1987 if (local
.redefined_extern_inline
)
1988 fprintf (f
, " redefined_extern_inline");
1989 if (only_called_at_startup
)
1990 fprintf (f
, " only_called_at_startup");
1991 if (only_called_at_exit
)
1992 fprintf (f
, " only_called_at_exit");
1994 fprintf (f
, " tm_clone");
1996 fprintf (f
, " icf_merged");
1998 fprintf (f
, " merged_comdat");
2000 fprintf (f
, " nonfreeing_fn");
2001 if (DECL_STATIC_CONSTRUCTOR (decl
))
2002 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2003 if (DECL_STATIC_DESTRUCTOR (decl
))
2004 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2005 if (frequency
== NODE_FREQUENCY_HOT
)
2006 fprintf (f
, " hot");
2007 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2008 fprintf (f
, " unlikely_executed");
2009 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2010 fprintf (f
, " executed_once");
2011 if (only_called_at_startup
)
2012 fprintf (f
, " only_called_at_startup");
2013 if (only_called_at_exit
)
2014 fprintf (f
, " only_called_at_exit");
2015 if (opt_for_fn (decl
, optimize_size
))
2016 fprintf (f
, " optimize_size");
2017 if (parallelized_function
)
2018 fprintf (f
, " parallelized_function");
2024 fprintf (f
, " Thunk");
2026 fprintf (f
, " of %s (asm: %s)",
2027 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2028 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2029 fprintf (f
, " fixed offset %i virtual value %i has "
2030 "virtual offset %i)\n",
2031 (int)thunk
.fixed_offset
,
2032 (int)thunk
.virtual_value
,
2033 (int)thunk
.virtual_offset_p
);
2035 if (alias
&& thunk
.alias
2036 && DECL_P (thunk
.alias
))
2038 fprintf (f
, " Alias of %s",
2039 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2040 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2041 fprintf (f
, " (asm: %s)",
2042 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2046 fprintf (f
, " Called by: ");
2048 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2050 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
2051 edge
->caller
->order
);
2052 edge
->dump_edge_flags (f
);
2055 fprintf (f
, "\n Calls: ");
2056 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2058 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
2059 edge
->callee
->order
);
2060 edge
->dump_edge_flags (f
);
2064 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2066 if (edge
->indirect_info
->polymorphic
)
2068 fprintf (f
, " Polymorphic indirect call of type ");
2069 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2070 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2073 fprintf (f
, " Indirect call");
2074 edge
->dump_edge_flags (f
);
2075 if (edge
->indirect_info
->param_index
!= -1)
2077 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2078 if (edge
->indirect_info
->agg_contents
)
2079 fprintf (f
, " loaded from %s %s at offset %i",
2080 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2081 edge
->indirect_info
->by_ref
? "passed by reference":"",
2082 (int)edge
->indirect_info
->offset
);
2083 if (edge
->indirect_info
->vptr_changed
)
2084 fprintf (f
, " (vptr maybe changed)");
2087 if (edge
->indirect_info
->polymorphic
)
2088 edge
->indirect_info
->context
.dump (f
);
2091 if (instrumentation_clone
)
2092 fprintf (f
, " Is instrumented version.\n");
2093 else if (instrumented_version
)
2094 fprintf (f
, " Has instrumented version.\n");
2097 /* Dump call graph node NODE to stderr. */
2100 cgraph_node::debug (void)
2105 /* Dump the callgraph to file F. */
2108 cgraph_node::dump_cgraph (FILE *f
)
2112 fprintf (f
, "callgraph:\n\n");
2113 FOR_EACH_FUNCTION (node
)
2117 /* Return true when the DECL can possibly be inlined. */
2120 cgraph_function_possibly_inlined_p (tree decl
)
2122 if (!symtab
->global_info_ready
)
2123 return !DECL_UNINLINABLE (decl
);
2124 return DECL_POSSIBLY_INLINED (decl
);
2127 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2129 cgraph_node::unnest (void)
2131 cgraph_node
**node2
= &origin
->nested
;
2132 gcc_assert (origin
);
2134 while (*node2
!= this)
2135 node2
= &(*node2
)->next_nested
;
2136 *node2
= next_nested
;
2140 /* Return function availability. See cgraph.h for description of individual
2143 cgraph_node::get_availability (void)
2145 enum availability avail
;
2147 avail
= AVAIL_NOT_AVAILABLE
;
2148 else if (local
.local
)
2149 avail
= AVAIL_LOCAL
;
2150 else if (transparent_alias
)
2151 ultimate_alias_target (&avail
);
2152 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2153 avail
= AVAIL_INTERPOSABLE
;
2154 else if (!externally_visible
)
2155 avail
= AVAIL_AVAILABLE
;
2156 /* Inline functions are safe to be analyzed even if their symbol can
2157 be overwritten at runtime. It is not meaningful to enforce any sane
2158 behaviour on replacing inline function by different body. */
2159 else if (DECL_DECLARED_INLINE_P (decl
))
2160 avail
= AVAIL_AVAILABLE
;
2162 /* If the function can be overwritten, return OVERWRITABLE. Take
2163 care at least of two notable extensions - the COMDAT functions
2164 used to share template instantiations in C++ (this is symmetric
2165 to code cp_cannot_inline_tree_fn and probably shall be shared and
2166 the inlinability hooks completely eliminated).
2168 ??? Does the C++ one definition rule allow us to always return
2169 AVAIL_AVAILABLE here? That would be good reason to preserve this
2172 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2173 avail
= AVAIL_INTERPOSABLE
;
2174 else avail
= AVAIL_AVAILABLE
;
2179 /* Worker for cgraph_node_can_be_local_p. */
2181 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2183 return !(!node
->force_output
2184 && ((DECL_COMDAT (node
->decl
)
2185 && !node
->forced_by_abi
2186 && !node
->used_from_object_file_p ()
2187 && !node
->same_comdat_group
)
2188 || !node
->externally_visible
));
2191 /* Return true if cgraph_node can be made local for API change.
2192 Extern inline functions and C++ COMDAT functions can be made local
2193 at the expense of possible code size growth if function is used in multiple
2194 compilation units. */
2196 cgraph_node::can_be_local_p (void)
2198 return (!address_taken
2199 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2203 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2204 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2205 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2208 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2209 (cgraph_node
*, void *),
2211 bool include_overwritable
,
2212 bool exclude_virtual_thunks
)
2217 if (callback (this, data
))
2219 FOR_EACH_ALIAS (this, ref
)
2221 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2222 if (include_overwritable
2223 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2224 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2225 include_overwritable
,
2226 exclude_virtual_thunks
))
2229 for (e
= callers
; e
; e
= e
->next_caller
)
2230 if (e
->caller
->thunk
.thunk_p
2231 && (include_overwritable
2232 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2233 && !(exclude_virtual_thunks
2234 && e
->caller
->thunk
.virtual_offset_p
))
2235 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2236 include_overwritable
,
2237 exclude_virtual_thunks
))
2243 /* Worker to bring NODE local. */
2246 cgraph_node::make_local (cgraph_node
*node
, void *)
2248 gcc_checking_assert (node
->can_be_local_p ());
2249 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2251 node
->make_decl_local ();
2252 node
->set_section (NULL
);
2253 node
->set_comdat_group (NULL
);
2254 node
->externally_visible
= false;
2255 node
->forced_by_abi
= false;
2256 node
->local
.local
= true;
2257 node
->set_section (NULL
);
2258 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2259 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2260 && !flag_incremental_link
);
2261 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2262 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2267 /* Bring cgraph node local. */
2270 cgraph_node::make_local (void)
2272 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2275 /* Worker to set nothrow flag. */
2278 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2282 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2285 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2286 e
->can_throw_external
= false;
2290 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2291 if any to NOTHROW. */
2294 cgraph_node::set_nothrow_flag (bool nothrow
)
2296 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2297 (void *)(size_t)nothrow
, false);
2300 /* Worker to set const flag. */
2303 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2305 /* Static constructors and destructors without a side effect can be
2307 if (data
&& !((size_t)data
& 2))
2309 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2310 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2311 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2312 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2314 TREE_READONLY (node
->decl
) = data
!= NULL
;
2315 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2319 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2320 if any to READONLY. */
2323 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2325 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2326 (void *)(size_t)(readonly
+ (int)looping
* 2),
2330 /* Worker to set pure flag. */
2333 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2335 /* Static constructors and destructors without a side effect can be
2337 if (data
&& !((size_t)data
& 2))
2339 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2340 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2341 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2342 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2344 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2345 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2349 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2353 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2355 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2356 (void *)(size_t)(pure
+ (int)looping
* 2),
2360 /* Return true when cgraph_node can not return or throw and thus
2361 it is safe to ignore its side effects for IPA analysis. */
2364 cgraph_node::cannot_return_p (void)
2366 int flags
= flags_from_decl_or_type (decl
);
2367 if (!opt_for_fn (decl
, flag_exceptions
))
2368 return (flags
& ECF_NORETURN
) != 0;
2370 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2371 == (ECF_NORETURN
| ECF_NOTHROW
));
2374 /* Return true when call of edge can not lead to return from caller
2375 and thus it is safe to ignore its side effects for IPA analysis
2376 when computing side effects of the caller.
2377 FIXME: We could actually mark all edges that have no reaching
2378 patch to the exit block or throw to get better results. */
2380 cgraph_edge::cannot_lead_to_return_p (void)
2382 if (caller
->cannot_return_p ())
2384 if (indirect_unknown_callee
)
2386 int flags
= indirect_info
->ecf_flags
;
2387 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2388 return (flags
& ECF_NORETURN
) != 0;
2390 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2391 == (ECF_NORETURN
| ECF_NOTHROW
));
2394 return callee
->cannot_return_p ();
2397 /* Return true if the call can be hot. */
2400 cgraph_edge::maybe_hot_p (void)
2402 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2404 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2405 && !maybe_hot_count_p (NULL
, count
))
2407 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2409 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2411 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2413 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2415 if (opt_for_fn (caller
->decl
, optimize_size
))
2417 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2419 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2420 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2422 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2424 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2425 || frequency
<= (CGRAPH_FREQ_BASE
2426 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2432 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2435 nonremovable_p (cgraph_node
*node
, void *)
2437 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2440 /* Return true if whole comdat group can be removed if there are no direct
2444 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2446 struct ipa_ref
*ref
;
2448 /* For local symbols or non-comdat group it is the same as
2449 can_remove_if_no_direct_calls_p. */
2450 if (!externally_visible
|| !same_comdat_group
)
2452 if (DECL_EXTERNAL (decl
))
2456 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2459 if (will_inline
&& address_taken
)
2462 /* Otheriwse check if we can remove the symbol itself and then verify
2463 that only uses of the comdat groups are direct call to THIS
2465 if (!can_remove_if_no_direct_calls_and_refs_p ())
2468 /* Check that all refs come from within the comdat group. */
2469 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2470 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2473 struct cgraph_node
*target
= ultimate_alias_target ();
2474 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2475 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2477 if (!externally_visible
)
2480 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2483 /* If we see different symbol than THIS, be sure to check calls. */
2484 if (next
->ultimate_alias_target () != target
)
2485 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2486 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2490 /* If function is not being inlined, we care only about
2491 references outside of the comdat group. */
2493 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2494 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2500 /* Return true when function cgraph_node can be expected to be removed
2501 from program when direct calls in this compilation unit are removed.
2503 As a special case COMDAT functions are
2504 cgraph_can_remove_if_no_direct_calls_p while the are not
2505 cgraph_only_called_directly_p (it is possible they are called from other
2508 This function behaves as cgraph_only_called_directly_p because eliminating
2509 all uses of COMDAT function does not make it necessarily disappear from
2510 the program unless we are compiling whole program or we do LTO. In this
2511 case we know we win since dynamic linking will not really discard the
2512 linkonce section. */
2515 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2518 gcc_assert (!global
.inlined_to
);
2519 if (DECL_EXTERNAL (decl
))
2522 if (!in_lto_p
&& !flag_whole_program
)
2524 /* If the symbol is in comdat group, we need to verify that whole comdat
2525 group becomes unreachable. Technically we could skip references from
2526 within the group, too. */
2527 if (!only_called_directly_p ())
2529 if (same_comdat_group
&& externally_visible
)
2531 struct cgraph_node
*target
= ultimate_alias_target ();
2533 if (will_inline
&& address_taken
)
2535 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2537 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2539 if (!externally_visible
)
2542 && !next
->only_called_directly_p ())
2545 /* If we see different symbol than THIS,
2546 be sure to check calls. */
2547 if (next
->ultimate_alias_target () != target
)
2548 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2549 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2557 return can_remove_if_no_direct_calls_p (will_inline
);
2561 /* Worker for cgraph_only_called_directly_p. */
2564 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2566 return !node
->only_called_directly_or_aliased_p ();
2569 /* Return true when function cgraph_node and all its aliases are only called
2571 i.e. it is not externally visible, address was not taken and
2572 it is not used in any other non-standard way. */
2575 cgraph_node::only_called_directly_p (void)
2577 gcc_assert (ultimate_alias_target () == this);
2578 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2583 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2586 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2588 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2590 enum availability avail
;
2591 node
->ultimate_alias_target (&avail
);
2593 if (avail
> AVAIL_INTERPOSABLE
)
2594 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2595 if (!cs
->indirect_inlining_edge
2596 && !cs
->caller
->thunk
.thunk_p
)
2597 redirect_callers
->safe_push (cs
);
2601 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2602 cgraph_node (i.e. are not overwritable). */
2605 cgraph_node::collect_callers (void)
2607 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2608 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2609 &redirect_callers
, false);
2610 return redirect_callers
;
2613 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2616 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2618 bool skipped_thunk
= false;
2619 node
= node
->ultimate_alias_target ();
2620 node2
= node2
->ultimate_alias_target ();
2622 /* There are no virtual clones of thunks so check former_clone_of or if we
2623 might have skipped thunks because this adjustments are no longer
2625 while (node
->thunk
.thunk_p
)
2627 if (node2
->former_clone_of
== node
->decl
)
2629 if (!node
->thunk
.this_adjusting
)
2631 node
= node
->callees
->callee
->ultimate_alias_target ();
2632 skipped_thunk
= true;
2637 if (!node2
->clone
.args_to_skip
2638 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2640 if (node2
->former_clone_of
== node
->decl
)
2642 else if (!node2
->clone_of
)
2646 while (node
!= node2
&& node2
)
2647 node2
= node2
->clone_of
;
2648 return node2
!= NULL
;
2651 /* Verify edge count and frequency. */
2654 cgraph_edge::verify_count_and_frequency ()
2656 bool error_found
= false;
2659 error ("caller edge count is negative");
2664 error ("caller edge frequency is negative");
2667 if (frequency
> CGRAPH_FREQ_MAX
)
2669 error ("caller edge frequency is too large");
2675 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2677 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
2679 bool fndecl_was_null
= false;
2680 /* debug_gimple_stmt needs correct cfun */
2681 if (cfun
!= this_cfun
)
2682 set_cfun (this_cfun
);
2683 /* ...and an actual current_function_decl */
2684 if (!current_function_decl
)
2686 current_function_decl
= this_cfun
->decl
;
2687 fndecl_was_null
= true;
2689 debug_gimple_stmt (stmt
);
2690 if (fndecl_was_null
)
2691 current_function_decl
= NULL
;
2694 /* Verify that call graph edge corresponds to DECL from the associated
2695 statement. Return true if the verification should fail. */
2698 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
2702 if (!decl
|| callee
->global
.inlined_to
)
2704 if (symtab
->state
== LTO_STREAMING
)
2706 node
= cgraph_node::get (decl
);
2708 /* We do not know if a node from a different partition is an alias or what it
2709 aliases and therefore cannot do the former_clone_of check reliably. When
2710 body_removed is set, we have lost all information about what was alias or
2711 thunk of and also cannot proceed. */
2713 || node
->body_removed
2714 || node
->in_other_partition
2715 || callee
->icf_merged
2716 || callee
->in_other_partition
)
2719 node
= node
->ultimate_alias_target ();
2721 /* Optimizers can redirect unreachable calls or calls triggering undefined
2722 behaviour to builtin_unreachable. */
2723 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
2724 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
2727 if (callee
->former_clone_of
!= node
->decl
2728 && (node
!= callee
->ultimate_alias_target ())
2729 && !clone_of_p (node
, callee
))
2735 /* Verify cgraph nodes of given cgraph node. */
2737 cgraph_node::verify_node (void)
2740 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2741 basic_block this_block
;
2742 gimple_stmt_iterator gsi
;
2743 bool error_found
= false;
2748 timevar_push (TV_CGRAPH_VERIFY
);
2749 error_found
|= verify_base ();
2750 for (e
= callees
; e
; e
= e
->next_callee
)
2753 error ("aux field set for edge %s->%s",
2754 identifier_to_locale (e
->caller
->name ()),
2755 identifier_to_locale (e
->callee
->name ()));
2760 error ("execution count is negative");
2763 if (global
.inlined_to
&& same_comdat_group
)
2765 error ("inline clone in same comdat group list");
2768 if (!definition
&& !in_other_partition
&& local
.local
)
2770 error ("local symbols must be defined");
2773 if (global
.inlined_to
&& externally_visible
)
2775 error ("externally visible inline clone");
2778 if (global
.inlined_to
&& address_taken
)
2780 error ("inline clone with address taken");
2783 if (global
.inlined_to
&& force_output
)
2785 error ("inline clone is forced to output");
2788 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2792 error ("aux field set for indirect edge from %s",
2793 identifier_to_locale (e
->caller
->name ()));
2796 if (!e
->indirect_unknown_callee
2797 || !e
->indirect_info
)
2799 error ("An indirect edge from %s is not marked as indirect or has "
2800 "associated indirect_info, the corresponding statement is: ",
2801 identifier_to_locale (e
->caller
->name ()));
2802 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2806 bool check_comdat
= comdat_local_p ();
2807 for (e
= callers
; e
; e
= e
->next_caller
)
2809 if (e
->verify_count_and_frequency ())
2812 && !in_same_comdat_group_p (e
->caller
))
2814 error ("comdat-local function called by %s outside its comdat",
2815 identifier_to_locale (e
->caller
->name ()));
2818 if (!e
->inline_failed
)
2820 if (global
.inlined_to
2821 != (e
->caller
->global
.inlined_to
2822 ? e
->caller
->global
.inlined_to
: e
->caller
))
2824 error ("inlined_to pointer is wrong");
2827 if (callers
->next_caller
)
2829 error ("multiple inline callers");
2834 if (global
.inlined_to
)
2836 error ("inlined_to pointer set for noninline callers");
2840 for (e
= callees
; e
; e
= e
->next_callee
)
2842 if (e
->verify_count_and_frequency ())
2844 if (gimple_has_body_p (e
->caller
->decl
)
2845 && !e
->caller
->global
.inlined_to
2847 /* Optimized out calls are redirected to __builtin_unreachable. */
2850 != builtin_decl_implicit (BUILT_IN_UNREACHABLE
))
2852 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2853 gimple_bb (e
->call_stmt
))))
2855 error ("caller edge frequency %i does not match BB frequency %i",
2857 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2858 gimple_bb (e
->call_stmt
)));
2862 for (e
= indirect_calls
; 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
2870 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2871 gimple_bb (e
->call_stmt
))))
2873 error ("indirect call frequency %i does not match BB frequency %i",
2875 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2876 gimple_bb (e
->call_stmt
)));
2880 if (!callers
&& global
.inlined_to
)
2882 error ("inlined_to pointer is set but no predecessors found");
2885 if (global
.inlined_to
== this)
2887 error ("inlined_to pointer refers to itself");
2894 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2899 error ("cgraph_node has wrong clone_of");
2906 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2907 if (n
->clone_of
!= this)
2911 error ("cgraph_node has wrong clone list");
2915 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2917 error ("cgraph_node is in clone list but it is not clone");
2920 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2922 error ("cgraph_node has wrong prev_clone pointer");
2925 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2927 error ("double linked list of clones corrupted");
2931 if (analyzed
&& alias
)
2933 bool ref_found
= false;
2935 ipa_ref
*ref
= NULL
;
2939 error ("Alias has call edges");
2942 for (i
= 0; iterate_reference (i
, ref
); i
++)
2943 if (ref
->use
== IPA_REF_CHKP
)
2945 else if (ref
->use
!= IPA_REF_ALIAS
)
2947 error ("Alias has non-alias reference");
2952 error ("Alias has more than one alias reference");
2959 error ("Analyzed alias has no reference");
2964 /* Check instrumented version reference. */
2965 if (instrumented_version
2966 && instrumented_version
->instrumented_version
!= this)
2968 error ("Instrumentation clone does not reference original node");
2972 /* Cannot have orig_decl for not instrumented nodes. */
2973 if (!instrumentation_clone
&& orig_decl
)
2975 error ("Not instrumented node has non-NULL original declaration");
2979 /* If original not instrumented node still exists then we may check
2980 original declaration is set properly. */
2981 if (instrumented_version
2983 && orig_decl
!= instrumented_version
->decl
)
2985 error ("Instrumented node has wrong original declaration");
2989 /* Check all nodes have chkp reference to their instrumented versions. */
2991 && instrumented_version
2992 && !instrumentation_clone
)
2994 bool ref_found
= false;
2996 struct ipa_ref
*ref
;
2998 for (i
= 0; iterate_reference (i
, ref
); i
++)
2999 if (ref
->use
== IPA_REF_CHKP
)
3003 error ("Node has more than one chkp reference");
3006 if (ref
->referred
!= instrumented_version
)
3008 error ("Wrong node is referenced with chkp reference");
3016 error ("Analyzed node has no reference to instrumented version");
3021 if (instrumentation_clone
3022 && DECL_BUILT_IN_CLASS (decl
) == NOT_BUILT_IN
)
3024 tree name
= DECL_ASSEMBLER_NAME (decl
);
3025 tree orig_name
= DECL_ASSEMBLER_NAME (orig_decl
);
3027 if (!IDENTIFIER_TRANSPARENT_ALIAS (name
)
3028 || TREE_CHAIN (name
) != orig_name
)
3030 error ("Alias chain for instrumented node is broken");
3035 if (analyzed
&& thunk
.thunk_p
)
3039 error ("No edge out of thunk node");
3042 else if (callees
->next_callee
)
3044 error ("More than one edge out of thunk node");
3047 if (gimple_has_body_p (decl
))
3049 error ("Thunk is not supposed to have body");
3052 if (thunk
.add_pointer_bounds_args
3053 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3055 error ("Instrumentation thunk has wrong edge callee");
3059 else if (analyzed
&& gimple_has_body_p (decl
)
3060 && !TREE_ASM_WRITTEN (decl
)
3061 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3066 hash_set
<gimple
*> stmts
;
3068 ipa_ref
*ref
= NULL
;
3070 /* Reach the trees by walking over the CFG, and note the
3071 enclosing basic-blocks in the call edges. */
3072 FOR_EACH_BB_FN (this_block
, this_cfun
)
3074 for (gsi
= gsi_start_phis (this_block
);
3075 !gsi_end_p (gsi
); gsi_next (&gsi
))
3076 stmts
.add (gsi_stmt (gsi
));
3077 for (gsi
= gsi_start_bb (this_block
);
3081 gimple
*stmt
= gsi_stmt (gsi
);
3083 if (is_gimple_call (stmt
))
3085 cgraph_edge
*e
= get_edge (stmt
);
3086 tree decl
= gimple_call_fndecl (stmt
);
3091 error ("shared call_stmt:");
3092 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3095 if (!e
->indirect_unknown_callee
)
3097 if (e
->verify_corresponds_to_fndecl (decl
))
3099 error ("edge points to wrong declaration:");
3100 debug_tree (e
->callee
->decl
);
3101 fprintf (stderr
," Instead of:");
3108 error ("an indirect edge with unknown callee "
3109 "corresponding to a call_stmt with "
3110 "a known declaration:");
3112 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3118 error ("missing callgraph edge for call stmt:");
3119 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3125 for (i
= 0; iterate_reference (i
, ref
); i
++)
3126 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3128 error ("reference to dead statement");
3129 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3134 /* No CFG available?! */
3137 for (e
= callees
; e
; e
= e
->next_callee
)
3141 error ("edge %s->%s has no corresponding call_stmt",
3142 identifier_to_locale (e
->caller
->name ()),
3143 identifier_to_locale (e
->callee
->name ()));
3144 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3149 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3151 if (!e
->aux
&& !e
->speculative
)
3153 error ("an indirect edge from %s has no corresponding call_stmt",
3154 identifier_to_locale (e
->caller
->name ()));
3155 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3164 internal_error ("verify_cgraph_node failed");
3166 timevar_pop (TV_CGRAPH_VERIFY
);
3169 /* Verify whole cgraph structure. */
3171 cgraph_node::verify_cgraph_nodes (void)
3178 FOR_EACH_FUNCTION (node
)
3182 /* Walk the alias chain to return the function cgraph_node is alias of.
3183 Walk through thunks, too.
3184 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3187 cgraph_node::function_symbol (enum availability
*availability
)
3189 cgraph_node
*node
= ultimate_alias_target (availability
);
3191 while (node
->thunk
.thunk_p
)
3193 node
= node
->callees
->callee
;
3196 enum availability a
;
3197 a
= node
->get_availability ();
3198 if (a
< *availability
)
3201 node
= node
->ultimate_alias_target (availability
);
3206 /* Walk the alias chain to return the function cgraph_node is alias of.
3207 Walk through non virtual thunks, too. Thus we return either a function
3208 or a virtual thunk node.
3209 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3212 cgraph_node::function_or_virtual_thunk_symbol
3213 (enum availability
*availability
)
3215 cgraph_node
*node
= ultimate_alias_target (availability
);
3217 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3219 node
= node
->callees
->callee
;
3222 enum availability a
;
3223 a
= node
->get_availability ();
3224 if (a
< *availability
)
3227 node
= node
->ultimate_alias_target (availability
);
3232 /* When doing LTO, read cgraph_node's body from disk if it is not already
3236 cgraph_node::get_untransformed_body (void)
3238 lto_file_decl_data
*file_data
;
3239 const char *data
, *name
;
3241 tree decl
= this->decl
;
3243 if (DECL_RESULT (decl
))
3246 gcc_assert (in_lto_p
);
3248 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3250 file_data
= lto_file_data
;
3251 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3253 /* We may have renamed the declaration, e.g., a static function. */
3254 name
= lto_get_decl_name_mapping (file_data
, name
);
3255 struct lto_in_decl_state
*decl_state
3256 = lto_get_function_in_decl_state (file_data
, decl
);
3258 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3259 name
, &len
, decl_state
->compressed
);
3261 fatal_error (input_location
, "%s: section %s is missing",
3262 file_data
->file_name
,
3265 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3267 lto_input_function_body (file_data
, this, data
);
3268 lto_stats
.num_function_bodies
++;
3269 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3270 data
, len
, decl_state
->compressed
);
3271 lto_free_function_in_decl_state_for_node (this);
3272 /* Keep lto file data so ipa-inline-analysis knows about cross module
3275 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3280 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3281 if it is not already present. When some IPA transformations are scheduled,
3285 cgraph_node::get_body (void)
3289 updated
= get_untransformed_body ();
3291 /* Getting transformed body makes no sense for inline clones;
3292 we should never use this on real clones becuase they are materialized
3294 TODO: Materializing clones here will likely lead to smaller LTRANS
3296 gcc_assert (!global
.inlined_to
&& !clone_of
);
3297 if (ipa_transforms_to_apply
.exists ())
3299 opt_pass
*saved_current_pass
= current_pass
;
3300 FILE *saved_dump_file
= dump_file
;
3301 int saved_dump_flags
= dump_flags
;
3303 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3304 execute_all_ipa_transforms ();
3305 cgraph_edge::rebuild_edges ();
3306 free_dominance_info (CDI_DOMINATORS
);
3307 free_dominance_info (CDI_POST_DOMINATORS
);
3311 current_pass
= saved_current_pass
;
3312 dump_file
= saved_dump_file
;
3313 dump_flags
= saved_dump_flags
;
3318 /* Return the DECL_STRUCT_FUNCTION of the function. */
3321 cgraph_node::get_fun (void)
3323 cgraph_node
*node
= this;
3324 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3326 while (!fun
&& node
->clone_of
)
3328 node
= node
->clone_of
;
3329 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3335 /* Verify if the type of the argument matches that of the function
3336 declaration. If we cannot verify this or there is a mismatch,
3340 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3343 unsigned int i
, nargs
;
3345 /* Calls to internal functions always match their signature. */
3346 if (gimple_call_internal_p (stmt
))
3349 nargs
= gimple_call_num_args (stmt
);
3351 /* Get argument types for verification. */
3353 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3355 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3357 /* Verify if the type of the argument matches that of the function
3358 declaration. If we cannot verify this or there is a mismatch,
3360 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3362 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3364 i
++, p
= DECL_CHAIN (p
))
3367 /* We cannot distinguish a varargs function from the case
3368 of excess parameters, still deferring the inlining decision
3369 to the callee is possible. */
3372 arg
= gimple_call_arg (stmt
, i
);
3373 if (p
== error_mark_node
3374 || DECL_ARG_TYPE (p
) == error_mark_node
3375 || arg
== error_mark_node
3376 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3377 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3380 if (args_count_match
&& p
)
3385 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3388 /* If this is a varargs function defer inlining decision
3392 arg
= gimple_call_arg (stmt
, i
);
3393 if (TREE_VALUE (p
) == error_mark_node
3394 || arg
== error_mark_node
3395 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3396 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3397 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3409 /* Verify if the type of the argument and lhs of CALL_STMT matches
3410 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3411 true, the arg count needs to be the same.
3412 If we cannot verify this or there is a mismatch, return false. */
3415 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3416 bool args_count_match
)
3420 if ((DECL_RESULT (callee
)
3421 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3422 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3423 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3425 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3426 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3431 /* Reset all state within cgraph.c so that we can rerun the compiler
3432 within the same process. For use by toplev::finalize. */
3435 cgraph_c_finalize (void)
3439 x_cgraph_nodes_queue
= NULL
;
3441 cgraph_fnver_htab
= NULL
;
3442 version_info_node
= NULL
;
3445 /* A wroker for call_for_symbol_and_aliases. */
3448 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3451 bool include_overwritable
)
3454 FOR_EACH_ALIAS (this, ref
)
3456 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3457 if (include_overwritable
3458 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3459 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3460 include_overwritable
))
3466 /* Return true if NODE has thunk. */
3469 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3471 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3472 if (e
->caller
->thunk
.thunk_p
)
3477 #include "gt-cgraph.h"