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 #ifdef ENABLE_OFFLOADING
503 g
->have_offload
= true;
507 node
->register_symbol ();
509 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
511 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
512 node
->next_nested
= node
->origin
->nested
;
513 node
->origin
->nested
= node
;
518 /* Try to find a call graph node for declaration DECL and if it does not exist
519 or if it corresponds to an inline clone, create a new one. */
522 cgraph_node::get_create (tree decl
)
524 cgraph_node
*first_clone
= cgraph_node::get (decl
);
526 if (first_clone
&& !first_clone
->global
.inlined_to
)
529 cgraph_node
*node
= cgraph_node::create (decl
);
532 first_clone
->clone_of
= node
;
533 node
->clones
= first_clone
;
534 symtab
->symtab_prevail_in_asm_name_hash (node
);
535 node
->decl
->decl_with_vis
.symtab_node
= node
;
537 fprintf (dump_file
, "Introduced new external node "
538 "(%s/%i) and turned into root of the clone tree.\n",
539 node
->name (), node
->order
);
542 fprintf (dump_file
, "Introduced new external node "
543 "(%s/%i).\n", node
->name (), node
->order
);
547 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
548 the function body is associated with (not necessarily cgraph_node (DECL). */
551 cgraph_node::create_alias (tree alias
, tree target
)
553 cgraph_node
*alias_node
;
555 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
556 || TREE_CODE (target
) == IDENTIFIER_NODE
);
557 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
558 alias_node
= cgraph_node::get_create (alias
);
559 gcc_assert (!alias_node
->definition
);
560 alias_node
->alias_target
= target
;
561 alias_node
->definition
= true;
562 alias_node
->alias
= true;
563 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
564 alias_node
->weakref
= true;
568 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
570 Same body aliases are output whenever the body of DECL is output,
571 and cgraph_node::get (ALIAS) transparently returns
572 cgraph_node::get (DECL). */
575 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
578 #ifndef ASM_OUTPUT_DEF
579 /* If aliases aren't supported by the assembler, fail. */
582 /* Langhooks can create same body aliases of symbols not defined.
583 Those are useless. Drop them on the floor. */
584 if (symtab
->global_info_ready
)
587 n
= cgraph_node::create_alias (alias
, decl
);
588 n
->cpp_implicit_alias
= true;
589 if (symtab
->cpp_implicit_aliases_done
)
590 n
->resolve_alias (cgraph_node::get (decl
));
594 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
595 aliases DECL with an adjustments made into the first parameter.
596 See comments in thunk_adjust for detail on the parameters. */
599 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
600 HOST_WIDE_INT fixed_offset
,
601 HOST_WIDE_INT virtual_value
,
607 node
= cgraph_node::get (alias
);
611 node
= cgraph_node::create (alias
);
612 gcc_checking_assert (!virtual_offset
613 || wi::eq_p (virtual_offset
, virtual_value
));
614 node
->thunk
.fixed_offset
= fixed_offset
;
615 node
->thunk
.this_adjusting
= this_adjusting
;
616 node
->thunk
.virtual_value
= virtual_value
;
617 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
618 node
->thunk
.alias
= real_alias
;
619 node
->thunk
.thunk_p
= true;
620 node
->definition
= true;
625 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
626 Return NULL if there's no such node. */
629 cgraph_node::get_for_asmname (tree asmname
)
631 /* We do not want to look at inline clones. */
632 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
634 node
= node
->next_sharing_asm_name
)
636 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
637 if (cn
&& !cn
->global
.inlined_to
)
643 /* Returns a hash value for X (which really is a cgraph_edge). */
646 cgraph_edge_hasher::hash (cgraph_edge
*e
)
648 /* This is a really poor hash function, but it is what htab_hash_pointer
650 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
653 /* Returns a hash value for X (which really is a cgraph_edge). */
656 cgraph_edge_hasher::hash (gimple
*call_stmt
)
658 /* This is a really poor hash function, but it is what htab_hash_pointer
660 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
663 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
666 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
668 return x
->call_stmt
== y
;
671 /* Add call graph edge E to call site hash of its caller. */
674 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
676 gimple
*call
= e
->call_stmt
;
677 *e
->caller
->call_site_hash
->find_slot_with_hash
678 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
681 /* Add call graph edge E to call site hash of its caller. */
684 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
686 /* There are two speculative edges for every statement (one direct,
687 one indirect); always hash the direct one. */
688 if (e
->speculative
&& e
->indirect_unknown_callee
)
690 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
691 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
694 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
699 gcc_assert (!*slot
|| e
->speculative
);
703 /* Return the callgraph edge representing the GIMPLE_CALL statement
707 cgraph_node::get_edge (gimple
*call_stmt
)
713 return call_site_hash
->find_with_hash
714 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
716 /* This loop may turn out to be performance problem. In such case adding
717 hashtables into call nodes with very many edges is probably best
718 solution. It is not good idea to add pointer into CALL_EXPR itself
719 because we want to make possible having multiple cgraph nodes representing
720 different clones of the same body before the body is actually cloned. */
721 for (e
= callees
; e
; e
= e
->next_callee
)
723 if (e
->call_stmt
== call_stmt
)
729 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
731 if (e
->call_stmt
== call_stmt
)
738 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
739 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
740 cgraph_add_edge_to_call_site_hash (e2
);
741 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
742 cgraph_add_edge_to_call_site_hash (e2
);
749 /* Change field call_stmt of edge to NEW_STMT.
750 If UPDATE_SPECULATIVE and E is any component of speculative
751 edge, then update all components. */
754 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
758 /* Speculative edges has three component, update all of them
760 if (update_speculative
&& speculative
)
762 cgraph_edge
*direct
, *indirect
;
765 speculative_call_info (direct
, indirect
, ref
);
766 direct
->set_call_stmt (new_stmt
, false);
767 indirect
->set_call_stmt (new_stmt
, false);
768 ref
->stmt
= new_stmt
;
772 /* Only direct speculative edges go to call_site_hash. */
773 if (caller
->call_site_hash
774 && (!speculative
|| !indirect_unknown_callee
))
776 caller
->call_site_hash
->remove_elt_with_hash
777 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
780 cgraph_edge
*e
= this;
782 call_stmt
= new_stmt
;
783 if (indirect_unknown_callee
784 && (decl
= gimple_call_fndecl (new_stmt
)))
786 /* Constant propagation (and possibly also inlining?) can turn an
787 indirect call into a direct one. */
788 cgraph_node
*new_callee
= cgraph_node::get (decl
);
790 gcc_checking_assert (new_callee
);
791 e
= make_direct (new_callee
);
794 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
795 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
797 if (e
->caller
->call_site_hash
)
798 cgraph_add_edge_to_call_site_hash (e
);
801 /* Allocate a cgraph_edge structure and fill it with data according to the
802 parameters of which only CALLEE can be NULL (when creating an indirect call
806 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
807 gcall
*call_stmt
, gcov_type count
, int freq
,
808 bool indir_unknown_callee
)
812 /* LTO does not actually have access to the call_stmt since these
813 have not been loaded yet. */
816 /* This is a rather expensive check possibly triggering
817 construction of call stmt hashtable. */
819 gcc_checking_assert (!(e
= caller
->get_edge (call_stmt
))
822 gcc_assert (is_gimple_call (call_stmt
));
828 free_edges
= NEXT_FREE_EDGE (edge
);
832 edge
= ggc_alloc
<cgraph_edge
> ();
833 edge
->uid
= edges_max_uid
++;
839 edge
->caller
= caller
;
840 edge
->callee
= callee
;
841 edge
->prev_caller
= NULL
;
842 edge
->next_caller
= NULL
;
843 edge
->prev_callee
= NULL
;
844 edge
->next_callee
= NULL
;
845 edge
->lto_stmt_uid
= 0;
848 gcc_assert (count
>= 0);
849 edge
->frequency
= freq
;
850 gcc_assert (freq
>= 0);
851 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
853 edge
->call_stmt
= call_stmt
;
854 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
855 edge
->can_throw_external
856 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
859 && callee
&& callee
->decl
860 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
862 edge
->call_stmt_cannot_inline_p
= true;
864 edge
->call_stmt_cannot_inline_p
= false;
866 edge
->indirect_info
= NULL
;
867 edge
->indirect_inlining_edge
= 0;
868 edge
->speculative
= false;
869 edge
->indirect_unknown_callee
= indir_unknown_callee
;
870 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
871 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
872 edge
->in_polymorphic_cdtor
873 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
876 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
877 if (call_stmt
&& caller
->call_site_hash
)
878 cgraph_add_edge_to_call_site_hash (edge
);
883 /* Create edge from a given function to CALLEE in the cgraph. */
886 cgraph_node::create_edge (cgraph_node
*callee
,
887 gcall
*call_stmt
, gcov_type count
, int freq
)
889 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
892 initialize_inline_failed (edge
);
894 edge
->next_caller
= callee
->callers
;
896 callee
->callers
->prev_caller
= edge
;
897 edge
->next_callee
= callees
;
899 callees
->prev_callee
= edge
;
901 callee
->callers
= edge
;
906 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
908 cgraph_indirect_call_info
*
909 cgraph_allocate_init_indirect_info (void)
911 cgraph_indirect_call_info
*ii
;
913 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
914 ii
->param_index
= -1;
918 /* Create an indirect edge with a yet-undetermined callee where the call
919 statement destination is a formal parameter of the caller with index
923 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
924 gcov_type count
, int freq
,
925 bool compute_indirect_info
)
927 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
931 initialize_inline_failed (edge
);
933 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
934 edge
->indirect_info
->ecf_flags
= ecf_flags
;
935 edge
->indirect_info
->vptr_changed
= true;
937 /* Record polymorphic call info. */
938 if (compute_indirect_info
940 && (target
= gimple_call_fn (call_stmt
))
941 && virtual_method_call_p (target
))
943 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
945 /* Only record types can have virtual calls. */
946 edge
->indirect_info
->polymorphic
= true;
947 edge
->indirect_info
->param_index
= -1;
948 edge
->indirect_info
->otr_token
949 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
950 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
951 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
952 edge
->indirect_info
->context
= context
;
955 edge
->next_callee
= indirect_calls
;
957 indirect_calls
->prev_callee
= edge
;
958 indirect_calls
= edge
;
963 /* Remove the edge from the list of the callees of the caller. */
966 cgraph_edge::remove_caller (void)
969 prev_callee
->next_callee
= next_callee
;
971 next_callee
->prev_callee
= prev_callee
;
974 if (indirect_unknown_callee
)
975 caller
->indirect_calls
= next_callee
;
977 caller
->callees
= next_callee
;
979 if (caller
->call_site_hash
)
980 caller
->call_site_hash
->remove_elt_with_hash
981 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
984 /* Put the edge onto the free list. */
987 symbol_table::free_edge (cgraph_edge
*e
)
991 if (e
->indirect_info
)
992 ggc_free (e
->indirect_info
);
994 /* Clear out the edge so we do not dangle pointers. */
995 memset (e
, 0, sizeof (*e
));
997 NEXT_FREE_EDGE (e
) = free_edges
;
1002 /* Remove the edge in the cgraph. */
1005 cgraph_edge::remove (void)
1007 /* Call all edge removal hooks. */
1008 symtab
->call_edge_removal_hooks (this);
1010 if (!indirect_unknown_callee
)
1011 /* Remove from callers list of the callee. */
1014 /* Remove from callees list of the callers. */
1017 /* Put the edge onto the free list. */
1018 symtab
->free_edge (this);
1021 /* Turn edge into speculative call calling N2. Update
1022 the profile so the direct call is taken COUNT times
1025 At clone materialization time, the indirect call E will
1028 if (call_dest == N2)
1033 At this time the function just creates the direct call,
1034 the referencd representing the if conditional and attaches
1035 them all to the orginal indirect call statement.
1037 Return direct edge created. */
1040 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1041 int direct_frequency
)
1043 cgraph_node
*n
= caller
;
1044 ipa_ref
*ref
= NULL
;
1049 fprintf (dump_file
, "Indirect call -> speculative call"
1050 " %s/%i => %s/%i\n",
1051 xstrdup_for_dump (n
->name ()), n
->order
,
1052 xstrdup_for_dump (n2
->name ()), n2
->order
);
1055 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1056 initialize_inline_failed (e2
);
1057 e2
->speculative
= true;
1058 if (TREE_NOTHROW (n2
->decl
))
1059 e2
->can_throw_external
= false;
1061 e2
->can_throw_external
= can_throw_external
;
1062 e2
->lto_stmt_uid
= lto_stmt_uid
;
1063 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1065 frequency
-= e2
->frequency
;
1066 symtab
->call_edge_duplication_hooks (this, e2
);
1067 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1068 ref
->lto_stmt_uid
= lto_stmt_uid
;
1069 ref
->speculative
= speculative
;
1070 n2
->mark_address_taken ();
1074 /* Speculative call consist of three components:
1075 1) an indirect edge representing the original call
1076 2) an direct edge representing the new call
1077 3) ADDR_EXPR reference representing the speculative check.
1078 All three components are attached to single statement (the indirect
1079 call) and if one of them exists, all of them must exist.
1081 Given speculative call edge, return all three components.
1085 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1086 cgraph_edge
*&indirect
,
1087 ipa_ref
*&reference
)
1092 cgraph_edge
*e
= this;
1094 if (!e
->indirect_unknown_callee
)
1095 for (e2
= e
->caller
->indirect_calls
;
1096 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1097 e2
= e2
->next_callee
)
1102 /* We can take advantage of the call stmt hash. */
1105 e
= e
->caller
->get_edge (e2
->call_stmt
);
1106 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1109 for (e
= e
->caller
->callees
;
1110 e2
->call_stmt
!= e
->call_stmt
1111 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1115 gcc_assert (e
->speculative
&& e2
->speculative
);
1120 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1121 if (ref
->speculative
1122 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1123 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1129 /* Speculative edge always consist of all three components - direct edge,
1130 indirect and reference. */
1132 gcc_assert (e
&& e2
&& ref
);
1135 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1136 Remove the speculative call sequence and return edge representing the call.
1137 It is up to caller to redirect the call as appropriate. */
1140 cgraph_edge::resolve_speculation (tree callee_decl
)
1142 cgraph_edge
*edge
= this;
1146 gcc_assert (edge
->speculative
);
1147 edge
->speculative_call_info (e2
, edge
, ref
);
1149 || !ref
->referred
->semantically_equivalent_p
1150 (symtab_node::get (callee_decl
)))
1156 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1157 "turned out to have contradicting known target ",
1158 xstrdup_for_dump (edge
->caller
->name ()),
1159 edge
->caller
->order
,
1160 xstrdup_for_dump (e2
->callee
->name ()),
1162 print_generic_expr (dump_file
, callee_decl
, 0);
1163 fprintf (dump_file
, "\n");
1167 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1168 xstrdup_for_dump (edge
->caller
->name ()),
1169 edge
->caller
->order
,
1170 xstrdup_for_dump (e2
->callee
->name ()),
1177 cgraph_edge
*tmp
= edge
;
1179 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1182 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1183 in the functions inlined through it. */
1185 edge
->count
+= e2
->count
;
1186 edge
->frequency
+= e2
->frequency
;
1187 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1188 edge
->frequency
= CGRAPH_FREQ_MAX
;
1189 edge
->speculative
= false;
1190 e2
->speculative
= false;
1191 ref
->remove_reference ();
1192 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1195 e2
->callee
->remove_symbol_and_inline_clones ();
1196 if (edge
->caller
->call_site_hash
)
1197 cgraph_update_edge_in_call_site_hash (edge
);
1201 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1202 CALLEE. DELTA is an integer constant that is to be added to the this
1203 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1206 cgraph_edge::make_direct (cgraph_node
*callee
)
1208 cgraph_edge
*edge
= this;
1209 gcc_assert (indirect_unknown_callee
);
1211 /* If we are redirecting speculative call, make it non-speculative. */
1212 if (indirect_unknown_callee
&& speculative
)
1214 edge
= edge
->resolve_speculation (callee
->decl
);
1216 /* On successful speculation just return the pre existing direct edge. */
1217 if (!indirect_unknown_callee
)
1221 indirect_unknown_callee
= 0;
1222 ggc_free (indirect_info
);
1223 indirect_info
= NULL
;
1225 /* Get the edge out of the indirect edge list. */
1227 prev_callee
->next_callee
= next_callee
;
1229 next_callee
->prev_callee
= prev_callee
;
1231 caller
->indirect_calls
= next_callee
;
1233 /* Put it into the normal callee list */
1235 next_callee
= caller
->callees
;
1236 if (caller
->callees
)
1237 caller
->callees
->prev_callee
= edge
;
1238 caller
->callees
= edge
;
1240 /* Insert to callers list of the new callee. */
1241 edge
->set_callee (callee
);
1244 call_stmt_cannot_inline_p
1245 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1248 /* We need to re-determine the inlining status of the edge. */
1249 initialize_inline_failed (edge
);
1253 /* If necessary, change the function declaration in the call statement
1254 associated with E so that it corresponds to the edge callee. */
1257 cgraph_edge::redirect_call_stmt_to_callee (void)
1259 cgraph_edge
*e
= this;
1261 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1262 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1264 gimple_stmt_iterator gsi
;
1265 bool skip_bounds
= false;
1273 e
->speculative_call_info (e
, e2
, ref
);
1274 /* If there already is an direct call (i.e. as a result of inliner's
1275 substitution), forget about speculating. */
1277 e
= e
->resolve_speculation (decl
);
1278 /* If types do not match, speculation was likely wrong.
1279 The direct edge was posisbly redirected to the clone with a different
1280 signature. We did not update the call statement yet, so compare it
1281 with the reference that still points to the proper type. */
1282 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1283 ref
->referred
->decl
,
1287 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1289 xstrdup_for_dump (e
->caller
->name ()),
1291 xstrdup_for_dump (e
->callee
->name ()),
1293 e
= e
->resolve_speculation ();
1294 /* We are producing the final function body and will throw away the
1295 callgraph edges really soon. Reset the counts/frequencies to
1296 keep verifier happy in the case of roundoff errors. */
1297 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1298 e
->frequency
= compute_call_stmt_bb_frequency
1299 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1301 /* Expand speculation into GIMPLE code. */
1306 "Expanding speculative call of %s/%i -> %s/%i count:"
1308 xstrdup_for_dump (e
->caller
->name ()),
1310 xstrdup_for_dump (e
->callee
->name ()),
1313 gcc_assert (e2
->speculative
);
1314 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1315 new_stmt
= gimple_ic (e
->call_stmt
,
1316 dyn_cast
<cgraph_node
*> (ref
->referred
),
1317 e
->count
|| e2
->count
1318 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1319 e
->count
+ e2
->count
)
1320 : e
->frequency
|| e2
->frequency
1321 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1322 e
->frequency
+ e2
->frequency
)
1323 : REG_BR_PROB_BASE
/ 2,
1324 e
->count
, e
->count
+ e2
->count
);
1325 e
->speculative
= false;
1326 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1329 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1330 processed call stmt. */
1331 if (gimple_call_with_bounds_p (new_stmt
)
1332 && gimple_call_lhs (new_stmt
)
1333 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1335 tree dresult
= gimple_call_lhs (new_stmt
);
1336 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1337 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1338 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1339 struct cgraph_edge
*iedge
1340 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1341 struct cgraph_edge
*dedge
;
1345 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1348 dedge
->frequency
= compute_call_stmt_bb_frequency
1349 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1351 iedge
->frequency
= compute_call_stmt_bb_frequency
1352 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1355 e
->frequency
= compute_call_stmt_bb_frequency
1356 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1357 e2
->frequency
= compute_call_stmt_bb_frequency
1358 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1359 e2
->speculative
= false;
1360 ref
->speculative
= false;
1362 /* Indirect edges are not both in the call site hash.
1364 if (e
->caller
->call_site_hash
)
1365 cgraph_update_edge_in_call_site_hash (e2
);
1367 /* Continue redirecting E to proper target. */
1371 /* We might propagate instrumented function pointer into
1372 not instrumented function and vice versa. In such a
1373 case we need to either fix function declaration or
1374 remove bounds from call statement. */
1375 if (flag_check_pointer_bounds
&& e
->callee
)
1376 skip_bounds
= chkp_redirect_edge (e
);
1378 if (e
->indirect_unknown_callee
1379 || (decl
== e
->callee
->decl
1381 return e
->call_stmt
;
1383 if (flag_checking
&& decl
)
1385 cgraph_node
*node
= cgraph_node::get (decl
);
1386 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1389 if (symtab
->dump_file
)
1391 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1392 xstrdup_for_dump (e
->caller
->name ()), e
->caller
->order
,
1393 xstrdup_for_dump (e
->callee
->name ()), e
->callee
->order
);
1394 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1395 if (e
->callee
->clone
.combined_args_to_skip
)
1397 fprintf (symtab
->dump_file
, " combined args to skip: ");
1398 dump_bitmap (symtab
->dump_file
,
1399 e
->callee
->clone
.combined_args_to_skip
);
1403 if (e
->callee
->clone
.combined_args_to_skip
1408 new_stmt
= e
->call_stmt
;
1409 if (e
->callee
->clone
.combined_args_to_skip
)
1411 = gimple_call_copy_skip_args (new_stmt
,
1412 e
->callee
->clone
.combined_args_to_skip
);
1414 new_stmt
= chkp_copy_call_skip_bounds (new_stmt
);
1416 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1417 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1419 if (gimple_vdef (new_stmt
)
1420 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1421 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1423 gsi
= gsi_for_stmt (e
->call_stmt
);
1424 gsi_replace (&gsi
, new_stmt
, false);
1425 /* We need to defer cleaning EH info on the new statement to
1426 fixup-cfg. We may not have dominator information at this point
1427 and thus would end up with unreachable blocks and have no way
1428 to communicate that we need to run CFG cleanup then. */
1429 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1432 remove_stmt_from_eh_lp (e
->call_stmt
);
1433 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1438 new_stmt
= e
->call_stmt
;
1439 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1440 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1443 /* If the call becomes noreturn, remove the LHS if possible. */
1445 && (gimple_call_flags (new_stmt
) & ECF_NORETURN
)
1446 && TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (lhs
))) == INTEGER_CST
)
1448 if (TREE_CODE (lhs
) == SSA_NAME
)
1450 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1451 TREE_TYPE (lhs
), NULL
);
1452 var
= get_or_create_ssa_default_def
1453 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1454 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1455 gsi
= gsi_for_stmt (new_stmt
);
1456 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1457 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1459 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1460 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1463 /* If new callee has no static chain, remove it. */
1464 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1466 gimple_call_set_chain (new_stmt
, NULL
);
1467 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1470 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1473 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1475 if (symtab
->dump_file
)
1477 fprintf (symtab
->dump_file
, " updated to:");
1478 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1483 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1484 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1485 of OLD_STMT if it was previously call statement.
1486 If NEW_STMT is NULL, the call has been dropped without any
1490 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1491 gimple
*old_stmt
, tree old_call
,
1494 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1495 ? gimple_call_fndecl (new_stmt
) : 0;
1497 /* We are seeing indirect calls, then there is nothing to update. */
1498 if (!new_call
&& !old_call
)
1500 /* See if we turned indirect call into direct call or folded call to one builtin
1501 into different builtin. */
1502 if (old_call
!= new_call
)
1504 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1505 cgraph_edge
*ne
= NULL
;
1511 /* Keep calls marked as dead dead. */
1512 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1513 && DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
1514 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
1516 node
->get_edge (old_stmt
)->set_call_stmt
1517 (as_a
<gcall
*> (new_stmt
));
1520 /* See if the edge is already there and has the correct callee. It
1521 might be so because of indirect inlining has already updated
1522 it. We also might've cloned and redirected the edge. */
1523 if (new_call
&& e
->callee
)
1525 cgraph_node
*callee
= e
->callee
;
1528 if (callee
->decl
== new_call
1529 || callee
->former_clone_of
== new_call
)
1531 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1534 callee
= callee
->clone_of
;
1538 /* Otherwise remove edge and create new one; we can't simply redirect
1539 since function has changed, so inline plan and other information
1540 attached to edge is invalid. */
1542 frequency
= e
->frequency
;
1543 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1546 e
->callee
->remove_symbol_and_inline_clones ();
1550 /* We are seeing new direct call; compute profile info based on BB. */
1551 basic_block bb
= gimple_bb (new_stmt
);
1553 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1559 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1560 as_a
<gcall
*> (new_stmt
), count
,
1562 gcc_assert (ne
->inline_failed
);
1565 /* We only updated the call stmt; update pointer in cgraph edge.. */
1566 else if (old_stmt
!= new_stmt
)
1567 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1570 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1571 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1572 of OLD_STMT before it was updated (updating can happen inplace). */
1575 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1578 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1581 gcc_checking_assert (orig
);
1582 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1584 for (node
= orig
->clones
; node
!= orig
;)
1586 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1588 node
= node
->clones
;
1589 else if (node
->next_sibling_clone
)
1590 node
= node
->next_sibling_clone
;
1593 while (node
!= orig
&& !node
->next_sibling_clone
)
1594 node
= node
->clone_of
;
1596 node
= node
->next_sibling_clone
;
1602 /* Remove all callees from the node. */
1605 cgraph_node::remove_callees (void)
1609 /* It is sufficient to remove the edges from the lists of callers of
1610 the callees. The callee list of the node can be zapped with one
1612 for (e
= callees
; e
; e
= f
)
1615 symtab
->call_edge_removal_hooks (e
);
1616 if (!e
->indirect_unknown_callee
)
1617 e
->remove_callee ();
1618 symtab
->free_edge (e
);
1620 for (e
= indirect_calls
; e
; e
= f
)
1623 symtab
->call_edge_removal_hooks (e
);
1624 if (!e
->indirect_unknown_callee
)
1625 e
->remove_callee ();
1626 symtab
->free_edge (e
);
1628 indirect_calls
= NULL
;
1632 call_site_hash
->empty ();
1633 call_site_hash
= NULL
;
1637 /* Remove all callers from the node. */
1640 cgraph_node::remove_callers (void)
1644 /* It is sufficient to remove the edges from the lists of callees of
1645 the callers. The caller list of the node can be zapped with one
1647 for (e
= callers
; e
; e
= f
)
1650 symtab
->call_edge_removal_hooks (e
);
1651 e
->remove_caller ();
1652 symtab
->free_edge (e
);
1657 /* Helper function for cgraph_release_function_body and free_lang_data.
1658 It releases body from function DECL without having to inspect its
1659 possibly non-existent symtab node. */
1662 release_function_body (tree decl
)
1664 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1671 && loops_for_fn (fn
))
1673 fn
->curr_properties
&= ~PROP_loops
;
1674 loop_optimizer_finalize (fn
);
1678 delete_tree_ssa (fn
);
1679 delete_tree_cfg_annotations (fn
);
1684 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1685 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1689 if (fn
->value_histograms
)
1690 free_histograms (fn
);
1692 gimple_set_body (decl
, NULL
);
1693 /* Struct function hangs a lot of data that would leak if we didn't
1694 removed all pointers to it. */
1696 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1698 DECL_SAVED_TREE (decl
) = NULL
;
1701 /* Release memory used to represent body of function.
1702 Use this only for functions that are released before being translated to
1703 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1704 are free'd in final.c via free_after_compilation().
1705 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1708 cgraph_node::release_body (bool keep_arguments
)
1710 ipa_transforms_to_apply
.release ();
1711 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1713 DECL_RESULT (decl
) = NULL
;
1715 if (!keep_arguments
)
1716 DECL_ARGUMENTS (decl
) = NULL
;
1718 /* If the node is abstract and needed, then do not clear
1719 DECL_INITIAL of its associated function declaration because it's
1720 needed to emit debug info later. */
1721 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1722 DECL_INITIAL (decl
) = error_mark_node
;
1723 release_function_body (decl
);
1726 lto_free_function_in_decl_state_for_node (this);
1727 lto_file_data
= NULL
;
1731 /* Remove function from symbol table. */
1734 cgraph_node::remove (void)
1737 int uid
= this->uid
;
1739 symtab
->call_cgraph_removal_hooks (this);
1742 ipa_transforms_to_apply
.release ();
1744 /* Incremental inlining access removed nodes stored in the postorder list.
1746 force_output
= false;
1747 forced_by_abi
= false;
1748 for (n
= nested
; n
; n
= n
->next_nested
)
1753 cgraph_node
**node2
= &origin
->nested
;
1755 while (*node2
!= this)
1756 node2
= &(*node2
)->next_nested
;
1757 *node2
= next_nested
;
1760 if (prev_sibling_clone
)
1761 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1763 clone_of
->clones
= next_sibling_clone
;
1764 if (next_sibling_clone
)
1765 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1768 cgraph_node
*n
, *next
;
1772 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1773 n
->clone_of
= clone_of
;
1774 n
->clone_of
= clone_of
;
1775 n
->next_sibling_clone
= clone_of
->clones
;
1776 if (clone_of
->clones
)
1777 clone_of
->clones
->prev_sibling_clone
= n
;
1778 clone_of
->clones
= clones
;
1782 /* We are removing node with clones. This makes clones inconsistent,
1783 but assume they will be removed subsequently and just keep clone
1784 tree intact. This can happen in unreachable function removal since
1785 we remove unreachable functions in random order, not by bottom-up
1786 walk of clone trees. */
1787 for (n
= clones
; n
; n
= next
)
1789 next
= n
->next_sibling_clone
;
1790 n
->next_sibling_clone
= NULL
;
1791 n
->prev_sibling_clone
= NULL
;
1797 /* While all the clones are removed after being proceeded, the function
1798 itself is kept in the cgraph even after it is compiled. Check whether
1799 we are done with this body and reclaim it proactively if this is the case.
1801 if (symtab
->state
!= LTO_STREAMING
)
1803 n
= cgraph_node::get (decl
);
1805 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1806 && ((symtab
->global_info_ready
|| in_lto_p
)
1807 && (TREE_ASM_WRITTEN (n
->decl
)
1808 || DECL_EXTERNAL (n
->decl
)
1810 || (!flag_wpa
&& n
->in_other_partition
)))))
1815 lto_free_function_in_decl_state_for_node (this);
1816 lto_file_data
= NULL
;
1822 call_site_hash
->empty ();
1823 call_site_hash
= NULL
;
1826 if (instrumented_version
)
1828 instrumented_version
->instrumented_version
= NULL
;
1829 instrumented_version
= NULL
;
1832 symtab
->release_symbol (this, uid
);
1835 /* Likewise indicate that a node is having address taken. */
1838 cgraph_node::mark_address_taken (void)
1840 /* Indirect inlining can figure out that all uses of the address are
1842 if (global
.inlined_to
)
1844 gcc_assert (cfun
->after_inlining
);
1845 gcc_assert (callers
->indirect_inlining_edge
);
1848 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1849 IPA_REF_ADDR reference exists (and thus it should be set on node
1850 representing alias we take address of) and as a test whether address
1851 of the object was taken (and thus it should be set on node alias is
1852 referring to). We should remove the first use and the remove the
1855 cgraph_node
*node
= ultimate_alias_target ();
1856 node
->address_taken
= 1;
1859 /* Return local info for the compiled function. */
1862 cgraph_node::local_info (tree decl
)
1864 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1865 cgraph_node
*node
= get (decl
);
1868 return &node
->ultimate_alias_target ()->local
;
1871 /* Return local info for the compiled function. */
1874 cgraph_node::rtl_info (tree decl
)
1876 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1877 cgraph_node
*node
= get (decl
);
1880 node
= node
->ultimate_alias_target ();
1881 if (node
->decl
!= current_function_decl
1882 && !TREE_ASM_WRITTEN (node
->decl
))
1884 /* Allocate if it doesnt exist. */
1885 if (node
->ultimate_alias_target ()->rtl
== NULL
)
1886 node
->ultimate_alias_target ()->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1887 return node
->ultimate_alias_target ()->rtl
;
1890 /* Return a string describing the failure REASON. */
1893 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1896 #define DEFCIFCODE(code, type, string) string,
1898 static const char *cif_string_table
[CIF_N_REASONS
] = {
1899 #include "cif-code.def"
1902 /* Signedness of an enum type is implementation defined, so cast it
1903 to unsigned before testing. */
1904 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1905 return cif_string_table
[reason
];
1908 /* Return a type describing the failure REASON. */
1910 cgraph_inline_failed_type_t
1911 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1914 #define DEFCIFCODE(code, type, string) type,
1916 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1917 #include "cif-code.def"
1920 /* Signedness of an enum type is implementation defined, so cast it
1921 to unsigned before testing. */
1922 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1923 return cif_type_table
[reason
];
1926 /* Names used to print out the availability enum. */
1927 const char * const cgraph_availability_names
[] =
1928 {"unset", "not_available", "overwritable", "available", "local"};
1930 /* Output flags of edge to a file F. */
1933 cgraph_edge::dump_edge_flags (FILE *f
)
1936 fprintf (f
, "(speculative) ");
1938 fprintf (f
, "(inlined) ");
1939 if (indirect_inlining_edge
)
1940 fprintf (f
, "(indirect_inlining) ");
1942 fprintf (f
, "(%" PRId64
"x) ", (int64_t)count
);
1944 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
1945 if (can_throw_external
)
1946 fprintf (f
, "(can throw external) ");
1949 /* Dump call graph node to file F. */
1952 cgraph_node::dump (FILE *f
)
1958 if (global
.inlined_to
)
1959 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1960 xstrdup_for_dump (name ()),
1962 xstrdup_for_dump (global
.inlined_to
->name ()),
1963 global
.inlined_to
->order
);
1965 fprintf (f
, " Clone of %s/%i\n",
1966 clone_of
->asm_name (),
1968 if (symtab
->function_flags_ready
)
1969 fprintf (f
, " Availability: %s\n",
1970 cgraph_availability_names
[get_availability ()]);
1973 fprintf (f
, " Profile id: %i\n",
1975 fprintf (f
, " First run: %i\n", tp_first_run
);
1976 fprintf (f
, " Function flags:");
1978 fprintf (f
, " executed %" PRId64
"x",
1981 fprintf (f
, " nested in: %s", origin
->asm_name ());
1982 if (gimple_has_body_p (decl
))
1983 fprintf (f
, " body");
1985 fprintf (f
, " process");
1987 fprintf (f
, " local");
1988 if (local
.redefined_extern_inline
)
1989 fprintf (f
, " redefined_extern_inline");
1990 if (only_called_at_startup
)
1991 fprintf (f
, " only_called_at_startup");
1992 if (only_called_at_exit
)
1993 fprintf (f
, " only_called_at_exit");
1995 fprintf (f
, " tm_clone");
1997 fprintf (f
, " icf_merged");
1999 fprintf (f
, " nonfreeing_fn");
2000 if (DECL_STATIC_CONSTRUCTOR (decl
))
2001 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2002 if (DECL_STATIC_DESTRUCTOR (decl
))
2003 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2004 if (frequency
== NODE_FREQUENCY_HOT
)
2005 fprintf (f
, " hot");
2006 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2007 fprintf (f
, " unlikely_executed");
2008 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2009 fprintf (f
, " executed_once");
2010 if (only_called_at_startup
)
2011 fprintf (f
, " only_called_at_startup");
2012 if (only_called_at_exit
)
2013 fprintf (f
, " only_called_at_exit");
2014 if (opt_for_fn (decl
, optimize_size
))
2015 fprintf (f
, " optimize_size");
2016 if (parallelized_function
)
2017 fprintf (f
, " parallelized_function");
2023 fprintf (f
, " Thunk");
2025 fprintf (f
, " of %s (asm: %s)",
2026 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2027 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2028 fprintf (f
, " fixed offset %i virtual value %i has "
2029 "virtual offset %i)\n",
2030 (int)thunk
.fixed_offset
,
2031 (int)thunk
.virtual_value
,
2032 (int)thunk
.virtual_offset_p
);
2034 if (alias
&& thunk
.alias
2035 && DECL_P (thunk
.alias
))
2037 fprintf (f
, " Alias of %s",
2038 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2039 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2040 fprintf (f
, " (asm: %s)",
2041 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2045 fprintf (f
, " Called by: ");
2047 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2049 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
2050 edge
->caller
->order
);
2051 edge
->dump_edge_flags (f
);
2054 fprintf (f
, "\n Calls: ");
2055 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2057 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
2058 edge
->callee
->order
);
2059 edge
->dump_edge_flags (f
);
2063 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2065 if (edge
->indirect_info
->polymorphic
)
2067 fprintf (f
, " Polymorphic indirect call of type ");
2068 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2069 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2072 fprintf (f
, " Indirect call");
2073 edge
->dump_edge_flags (f
);
2074 if (edge
->indirect_info
->param_index
!= -1)
2076 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2077 if (edge
->indirect_info
->agg_contents
)
2078 fprintf (f
, " loaded from %s %s at offset %i",
2079 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2080 edge
->indirect_info
->by_ref
? "passed by reference":"",
2081 (int)edge
->indirect_info
->offset
);
2082 if (edge
->indirect_info
->vptr_changed
)
2083 fprintf (f
, " (vptr maybe changed)");
2086 if (edge
->indirect_info
->polymorphic
)
2087 edge
->indirect_info
->context
.dump (f
);
2090 if (instrumentation_clone
)
2091 fprintf (f
, " Is instrumented version.\n");
2092 else if (instrumented_version
)
2093 fprintf (f
, " Has instrumented version.\n");
2096 /* Dump call graph node NODE to stderr. */
2099 cgraph_node::debug (void)
2104 /* Dump the callgraph to file F. */
2107 cgraph_node::dump_cgraph (FILE *f
)
2111 fprintf (f
, "callgraph:\n\n");
2112 FOR_EACH_FUNCTION (node
)
2116 /* Return true when the DECL can possibly be inlined. */
2119 cgraph_function_possibly_inlined_p (tree decl
)
2121 if (!symtab
->global_info_ready
)
2122 return !DECL_UNINLINABLE (decl
);
2123 return DECL_POSSIBLY_INLINED (decl
);
2126 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2128 cgraph_node::unnest (void)
2130 cgraph_node
**node2
= &origin
->nested
;
2131 gcc_assert (origin
);
2133 while (*node2
!= this)
2134 node2
= &(*node2
)->next_nested
;
2135 *node2
= next_nested
;
2139 /* Return function availability. See cgraph.h for description of individual
2142 cgraph_node::get_availability (void)
2144 enum availability avail
;
2146 avail
= AVAIL_NOT_AVAILABLE
;
2147 else if (local
.local
)
2148 avail
= AVAIL_LOCAL
;
2149 else if (alias
&& weakref
)
2150 ultimate_alias_target (&avail
);
2151 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2152 avail
= AVAIL_INTERPOSABLE
;
2153 else if (!externally_visible
)
2154 avail
= AVAIL_AVAILABLE
;
2155 /* Inline functions are safe to be analyzed even if their symbol can
2156 be overwritten at runtime. It is not meaningful to enforce any sane
2157 behaviour on replacing inline function by different body. */
2158 else if (DECL_DECLARED_INLINE_P (decl
))
2159 avail
= AVAIL_AVAILABLE
;
2161 /* If the function can be overwritten, return OVERWRITABLE. Take
2162 care at least of two notable extensions - the COMDAT functions
2163 used to share template instantiations in C++ (this is symmetric
2164 to code cp_cannot_inline_tree_fn and probably shall be shared and
2165 the inlinability hooks completely eliminated).
2167 ??? Does the C++ one definition rule allow us to always return
2168 AVAIL_AVAILABLE here? That would be good reason to preserve this
2171 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2172 avail
= AVAIL_INTERPOSABLE
;
2173 else avail
= AVAIL_AVAILABLE
;
2178 /* Worker for cgraph_node_can_be_local_p. */
2180 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2182 return !(!node
->force_output
2183 && ((DECL_COMDAT (node
->decl
)
2184 && !node
->forced_by_abi
2185 && !node
->used_from_object_file_p ()
2186 && !node
->same_comdat_group
)
2187 || !node
->externally_visible
));
2190 /* Return true if cgraph_node can be made local for API change.
2191 Extern inline functions and C++ COMDAT functions can be made local
2192 at the expense of possible code size growth if function is used in multiple
2193 compilation units. */
2195 cgraph_node::can_be_local_p (void)
2197 return (!address_taken
2198 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2202 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2203 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2204 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2207 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2208 (cgraph_node
*, void *),
2210 bool include_overwritable
,
2211 bool exclude_virtual_thunks
)
2216 if (callback (this, data
))
2218 FOR_EACH_ALIAS (this, ref
)
2220 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2221 if (include_overwritable
2222 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2223 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2224 include_overwritable
,
2225 exclude_virtual_thunks
))
2228 for (e
= callers
; e
; e
= e
->next_caller
)
2229 if (e
->caller
->thunk
.thunk_p
2230 && (include_overwritable
2231 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2232 && !(exclude_virtual_thunks
2233 && e
->caller
->thunk
.virtual_offset_p
))
2234 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2235 include_overwritable
,
2236 exclude_virtual_thunks
))
2242 /* Worker to bring NODE local. */
2245 cgraph_node::make_local (cgraph_node
*node
, void *)
2247 gcc_checking_assert (node
->can_be_local_p ());
2248 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2250 node
->make_decl_local ();
2251 node
->set_section (NULL
);
2252 node
->set_comdat_group (NULL
);
2253 node
->externally_visible
= false;
2254 node
->forced_by_abi
= false;
2255 node
->local
.local
= true;
2256 node
->set_section (NULL
);
2257 node
->unique_name
= (node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2258 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2259 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2260 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2265 /* Bring cgraph node local. */
2268 cgraph_node::make_local (void)
2270 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2273 /* Worker to set nothrow flag. */
2276 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2280 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2283 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2284 e
->can_throw_external
= false;
2288 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2289 if any to NOTHROW. */
2292 cgraph_node::set_nothrow_flag (bool nothrow
)
2294 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2295 (void *)(size_t)nothrow
, false);
2298 /* Worker to set const flag. */
2301 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2303 /* Static constructors and destructors without a side effect can be
2305 if (data
&& !((size_t)data
& 2))
2307 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2308 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2309 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2310 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2312 TREE_READONLY (node
->decl
) = data
!= NULL
;
2313 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2317 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2318 if any to READONLY. */
2321 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2323 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2324 (void *)(size_t)(readonly
+ (int)looping
* 2),
2328 /* Worker to set pure flag. */
2331 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2333 /* Static constructors and destructors without a side effect can be
2335 if (data
&& !((size_t)data
& 2))
2337 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2338 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2339 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2340 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2342 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2343 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2347 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2351 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2353 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2354 (void *)(size_t)(pure
+ (int)looping
* 2),
2358 /* Return true when cgraph_node can not return or throw and thus
2359 it is safe to ignore its side effects for IPA analysis. */
2362 cgraph_node::cannot_return_p (void)
2364 int flags
= flags_from_decl_or_type (decl
);
2365 if (!opt_for_fn (decl
, flag_exceptions
))
2366 return (flags
& ECF_NORETURN
) != 0;
2368 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2369 == (ECF_NORETURN
| ECF_NOTHROW
));
2372 /* Return true when call of edge can not lead to return from caller
2373 and thus it is safe to ignore its side effects for IPA analysis
2374 when computing side effects of the caller.
2375 FIXME: We could actually mark all edges that have no reaching
2376 patch to the exit block or throw to get better results. */
2378 cgraph_edge::cannot_lead_to_return_p (void)
2380 if (caller
->cannot_return_p ())
2382 if (indirect_unknown_callee
)
2384 int flags
= indirect_info
->ecf_flags
;
2385 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2386 return (flags
& ECF_NORETURN
) != 0;
2388 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2389 == (ECF_NORETURN
| ECF_NOTHROW
));
2392 return callee
->cannot_return_p ();
2395 /* Return true if the call can be hot. */
2398 cgraph_edge::maybe_hot_p (void)
2400 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2402 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2403 && !maybe_hot_count_p (NULL
, count
))
2405 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2407 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2409 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2411 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2413 if (opt_for_fn (caller
->decl
, optimize_size
))
2415 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2417 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2418 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2420 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2422 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2423 || frequency
<= (CGRAPH_FREQ_BASE
2424 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2430 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2433 nonremovable_p (cgraph_node
*node
, void *)
2435 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2438 /* Return true if whole comdat group can be removed if there are no direct
2442 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2444 struct ipa_ref
*ref
;
2446 /* For local symbols or non-comdat group it is the same as
2447 can_remove_if_no_direct_calls_p. */
2448 if (!externally_visible
|| !same_comdat_group
)
2450 if (DECL_EXTERNAL (decl
))
2454 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2457 if (will_inline
&& address_taken
)
2460 /* Otheriwse check if we can remove the symbol itself and then verify
2461 that only uses of the comdat groups are direct call to THIS
2463 if (!can_remove_if_no_direct_calls_and_refs_p ())
2466 /* Check that all refs come from within the comdat group. */
2467 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2468 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2471 struct cgraph_node
*target
= ultimate_alias_target ();
2472 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2473 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2475 if (!externally_visible
)
2478 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2481 /* If we see different symbol than THIS, be sure to check calls. */
2482 if (next
->ultimate_alias_target () != target
)
2483 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2484 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2488 /* If function is not being inlined, we care only about
2489 references outside of the comdat group. */
2491 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2492 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2498 /* Return true when function cgraph_node can be expected to be removed
2499 from program when direct calls in this compilation unit are removed.
2501 As a special case COMDAT functions are
2502 cgraph_can_remove_if_no_direct_calls_p while the are not
2503 cgraph_only_called_directly_p (it is possible they are called from other
2506 This function behaves as cgraph_only_called_directly_p because eliminating
2507 all uses of COMDAT function does not make it necessarily disappear from
2508 the program unless we are compiling whole program or we do LTO. In this
2509 case we know we win since dynamic linking will not really discard the
2510 linkonce section. */
2513 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2516 gcc_assert (!global
.inlined_to
);
2517 if (DECL_EXTERNAL (decl
))
2520 if (!in_lto_p
&& !flag_whole_program
)
2522 /* If the symbol is in comdat group, we need to verify that whole comdat
2523 group becomes unreachable. Technically we could skip references from
2524 within the group, too. */
2525 if (!only_called_directly_p ())
2527 if (same_comdat_group
&& externally_visible
)
2529 struct cgraph_node
*target
= ultimate_alias_target ();
2531 if (will_inline
&& address_taken
)
2533 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2535 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2537 if (!externally_visible
)
2540 && !next
->only_called_directly_p ())
2543 /* If we see different symbol than THIS,
2544 be sure to check calls. */
2545 if (next
->ultimate_alias_target () != target
)
2546 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2547 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2555 return can_remove_if_no_direct_calls_p (will_inline
);
2559 /* Worker for cgraph_only_called_directly_p. */
2562 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2564 return !node
->only_called_directly_or_aliased_p ();
2567 /* Return true when function cgraph_node and all its aliases are only called
2569 i.e. it is not externally visible, address was not taken and
2570 it is not used in any other non-standard way. */
2573 cgraph_node::only_called_directly_p (void)
2575 gcc_assert (ultimate_alias_target () == this);
2576 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2581 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2584 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2586 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2588 enum availability avail
;
2589 node
->ultimate_alias_target (&avail
);
2591 if (avail
> AVAIL_INTERPOSABLE
)
2592 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2593 if (!cs
->indirect_inlining_edge
)
2594 redirect_callers
->safe_push (cs
);
2598 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2599 cgraph_node (i.e. are not overwritable). */
2602 cgraph_node::collect_callers (void)
2604 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2605 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2606 &redirect_callers
, false);
2607 return redirect_callers
;
2610 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2613 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2615 bool skipped_thunk
= false;
2616 node
= node
->ultimate_alias_target ();
2617 node2
= node2
->ultimate_alias_target ();
2619 /* There are no virtual clones of thunks so check former_clone_of or if we
2620 might have skipped thunks because this adjustments are no longer
2622 while (node
->thunk
.thunk_p
)
2624 if (node2
->former_clone_of
== node
->decl
)
2626 if (!node
->thunk
.this_adjusting
)
2628 node
= node
->callees
->callee
->ultimate_alias_target ();
2629 skipped_thunk
= true;
2634 if (!node2
->clone
.args_to_skip
2635 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2637 if (node2
->former_clone_of
== node
->decl
)
2639 else if (!node2
->clone_of
)
2643 while (node
!= node2
&& node2
)
2644 node2
= node2
->clone_of
;
2645 return node2
!= NULL
;
2648 /* Verify edge count and frequency. */
2651 cgraph_edge::verify_count_and_frequency ()
2653 bool error_found
= false;
2656 error ("caller edge count is negative");
2661 error ("caller edge frequency is negative");
2664 if (frequency
> CGRAPH_FREQ_MAX
)
2666 error ("caller edge frequency is too large");
2672 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2674 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
2676 bool fndecl_was_null
= false;
2677 /* debug_gimple_stmt needs correct cfun */
2678 if (cfun
!= this_cfun
)
2679 set_cfun (this_cfun
);
2680 /* ...and an actual current_function_decl */
2681 if (!current_function_decl
)
2683 current_function_decl
= this_cfun
->decl
;
2684 fndecl_was_null
= true;
2686 debug_gimple_stmt (stmt
);
2687 if (fndecl_was_null
)
2688 current_function_decl
= NULL
;
2691 /* Verify that call graph edge corresponds to DECL from the associated
2692 statement. Return true if the verification should fail. */
2695 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
2699 if (!decl
|| callee
->global
.inlined_to
)
2701 if (symtab
->state
== LTO_STREAMING
)
2703 node
= cgraph_node::get (decl
);
2705 /* We do not know if a node from a different partition is an alias or what it
2706 aliases and therefore cannot do the former_clone_of check reliably. When
2707 body_removed is set, we have lost all information about what was alias or
2708 thunk of and also cannot proceed. */
2710 || node
->body_removed
2711 || node
->in_other_partition
2712 || callee
->icf_merged
2713 || callee
->in_other_partition
)
2716 node
= node
->ultimate_alias_target ();
2718 /* Optimizers can redirect unreachable calls or calls triggering undefined
2719 behaviour to builtin_unreachable. */
2720 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
2721 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
2724 if (callee
->former_clone_of
!= node
->decl
2725 && (node
!= callee
->ultimate_alias_target ())
2726 && !clone_of_p (node
, callee
))
2732 /* Verify cgraph nodes of given cgraph node. */
2734 cgraph_node::verify_node (void)
2737 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2738 basic_block this_block
;
2739 gimple_stmt_iterator gsi
;
2740 bool error_found
= false;
2745 timevar_push (TV_CGRAPH_VERIFY
);
2746 error_found
|= verify_base ();
2747 for (e
= callees
; e
; e
= e
->next_callee
)
2750 error ("aux field set for edge %s->%s",
2751 identifier_to_locale (e
->caller
->name ()),
2752 identifier_to_locale (e
->callee
->name ()));
2757 error ("execution count is negative");
2760 if (global
.inlined_to
&& same_comdat_group
)
2762 error ("inline clone in same comdat group list");
2765 if (!definition
&& !in_other_partition
&& local
.local
)
2767 error ("local symbols must be defined");
2770 if (global
.inlined_to
&& externally_visible
)
2772 error ("externally visible inline clone");
2775 if (global
.inlined_to
&& address_taken
)
2777 error ("inline clone with address taken");
2780 if (global
.inlined_to
&& force_output
)
2782 error ("inline clone is forced to output");
2785 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2789 error ("aux field set for indirect edge from %s",
2790 identifier_to_locale (e
->caller
->name ()));
2793 if (!e
->indirect_unknown_callee
2794 || !e
->indirect_info
)
2796 error ("An indirect edge from %s is not marked as indirect or has "
2797 "associated indirect_info, the corresponding statement is: ",
2798 identifier_to_locale (e
->caller
->name ()));
2799 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2803 bool check_comdat
= comdat_local_p ();
2804 for (e
= callers
; e
; e
= e
->next_caller
)
2806 if (e
->verify_count_and_frequency ())
2809 && !in_same_comdat_group_p (e
->caller
))
2811 error ("comdat-local function called by %s outside its comdat",
2812 identifier_to_locale (e
->caller
->name ()));
2815 if (!e
->inline_failed
)
2817 if (global
.inlined_to
2818 != (e
->caller
->global
.inlined_to
2819 ? e
->caller
->global
.inlined_to
: e
->caller
))
2821 error ("inlined_to pointer is wrong");
2824 if (callers
->next_caller
)
2826 error ("multiple inline callers");
2831 if (global
.inlined_to
)
2833 error ("inlined_to pointer set for noninline callers");
2837 for (e
= callees
; e
; e
= e
->next_callee
)
2839 if (e
->verify_count_and_frequency ())
2841 if (gimple_has_body_p (e
->caller
->decl
)
2842 && !e
->caller
->global
.inlined_to
2844 /* Optimized out calls are redirected to __builtin_unreachable. */
2847 != builtin_decl_implicit (BUILT_IN_UNREACHABLE
))
2849 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2850 gimple_bb (e
->call_stmt
))))
2852 error ("caller edge frequency %i does not match BB frequency %i",
2854 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2855 gimple_bb (e
->call_stmt
)));
2859 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2861 if (e
->verify_count_and_frequency ())
2863 if (gimple_has_body_p (e
->caller
->decl
)
2864 && !e
->caller
->global
.inlined_to
2867 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2868 gimple_bb (e
->call_stmt
))))
2870 error ("indirect call frequency %i does not match BB frequency %i",
2872 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2873 gimple_bb (e
->call_stmt
)));
2877 if (!callers
&& global
.inlined_to
)
2879 error ("inlined_to pointer is set but no predecessors found");
2882 if (global
.inlined_to
== this)
2884 error ("inlined_to pointer refers to itself");
2891 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2896 error ("cgraph_node has wrong clone_of");
2903 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2904 if (n
->clone_of
!= this)
2908 error ("cgraph_node has wrong clone list");
2912 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2914 error ("cgraph_node is in clone list but it is not clone");
2917 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2919 error ("cgraph_node has wrong prev_clone pointer");
2922 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2924 error ("double linked list of clones corrupted");
2928 if (analyzed
&& alias
)
2930 bool ref_found
= false;
2932 ipa_ref
*ref
= NULL
;
2936 error ("Alias has call edges");
2939 for (i
= 0; iterate_reference (i
, ref
); i
++)
2940 if (ref
->use
== IPA_REF_CHKP
)
2942 else if (ref
->use
!= IPA_REF_ALIAS
)
2944 error ("Alias has non-alias reference");
2949 error ("Alias has more than one alias reference");
2956 error ("Analyzed alias has no reference");
2961 /* Check instrumented version reference. */
2962 if (instrumented_version
2963 && instrumented_version
->instrumented_version
!= this)
2965 error ("Instrumentation clone does not reference original node");
2969 /* Cannot have orig_decl for not instrumented nodes. */
2970 if (!instrumentation_clone
&& orig_decl
)
2972 error ("Not instrumented node has non-NULL original declaration");
2976 /* If original not instrumented node still exists then we may check
2977 original declaration is set properly. */
2978 if (instrumented_version
2980 && orig_decl
!= instrumented_version
->decl
)
2982 error ("Instrumented node has wrong original declaration");
2986 /* Check all nodes have chkp reference to their instrumented versions. */
2988 && instrumented_version
2989 && !instrumentation_clone
)
2991 bool ref_found
= false;
2993 struct ipa_ref
*ref
;
2995 for (i
= 0; iterate_reference (i
, ref
); i
++)
2996 if (ref
->use
== IPA_REF_CHKP
)
3000 error ("Node has more than one chkp reference");
3003 if (ref
->referred
!= instrumented_version
)
3005 error ("Wrong node is referenced with chkp reference");
3013 error ("Analyzed node has no reference to instrumented version");
3018 if (instrumentation_clone
3019 && DECL_BUILT_IN_CLASS (decl
) == NOT_BUILT_IN
)
3021 tree name
= DECL_ASSEMBLER_NAME (decl
);
3022 tree orig_name
= DECL_ASSEMBLER_NAME (orig_decl
);
3024 if (!IDENTIFIER_TRANSPARENT_ALIAS (name
)
3025 || TREE_CHAIN (name
) != orig_name
)
3027 error ("Alias chain for instrumented node is broken");
3032 if (analyzed
&& thunk
.thunk_p
)
3036 error ("No edge out of thunk node");
3039 else if (callees
->next_callee
)
3041 error ("More than one edge out of thunk node");
3044 if (gimple_has_body_p (decl
))
3046 error ("Thunk is not supposed to have body");
3049 if (thunk
.add_pointer_bounds_args
3050 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3052 error ("Instrumentation thunk has wrong edge callee");
3056 else if (analyzed
&& gimple_has_body_p (decl
)
3057 && !TREE_ASM_WRITTEN (decl
)
3058 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3063 hash_set
<gimple
*> stmts
;
3065 ipa_ref
*ref
= NULL
;
3067 /* Reach the trees by walking over the CFG, and note the
3068 enclosing basic-blocks in the call edges. */
3069 FOR_EACH_BB_FN (this_block
, this_cfun
)
3071 for (gsi
= gsi_start_phis (this_block
);
3072 !gsi_end_p (gsi
); gsi_next (&gsi
))
3073 stmts
.add (gsi_stmt (gsi
));
3074 for (gsi
= gsi_start_bb (this_block
);
3078 gimple
*stmt
= gsi_stmt (gsi
);
3080 if (is_gimple_call (stmt
))
3082 cgraph_edge
*e
= get_edge (stmt
);
3083 tree decl
= gimple_call_fndecl (stmt
);
3088 error ("shared call_stmt:");
3089 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3092 if (!e
->indirect_unknown_callee
)
3094 if (e
->verify_corresponds_to_fndecl (decl
))
3096 error ("edge points to wrong declaration:");
3097 debug_tree (e
->callee
->decl
);
3098 fprintf (stderr
," Instead of:");
3105 error ("an indirect edge with unknown callee "
3106 "corresponding to a call_stmt with "
3107 "a known declaration:");
3109 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3115 error ("missing callgraph edge for call stmt:");
3116 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3122 for (i
= 0; iterate_reference (i
, ref
); i
++)
3123 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3125 error ("reference to dead statement");
3126 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3131 /* No CFG available?! */
3134 for (e
= callees
; e
; e
= e
->next_callee
)
3138 error ("edge %s->%s has no corresponding call_stmt",
3139 identifier_to_locale (e
->caller
->name ()),
3140 identifier_to_locale (e
->callee
->name ()));
3141 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3146 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3148 if (!e
->aux
&& !e
->speculative
)
3150 error ("an indirect edge from %s has no corresponding call_stmt",
3151 identifier_to_locale (e
->caller
->name ()));
3152 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3161 internal_error ("verify_cgraph_node failed");
3163 timevar_pop (TV_CGRAPH_VERIFY
);
3166 /* Verify whole cgraph structure. */
3168 cgraph_node::verify_cgraph_nodes (void)
3175 FOR_EACH_FUNCTION (node
)
3179 /* Walk the alias chain to return the function cgraph_node is alias of.
3180 Walk through thunks, too.
3181 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3184 cgraph_node::function_symbol (enum availability
*availability
)
3186 cgraph_node
*node
= ultimate_alias_target (availability
);
3188 while (node
->thunk
.thunk_p
)
3190 node
= node
->callees
->callee
;
3193 enum availability a
;
3194 a
= node
->get_availability ();
3195 if (a
< *availability
)
3198 node
= node
->ultimate_alias_target (availability
);
3203 /* Walk the alias chain to return the function cgraph_node is alias of.
3204 Walk through non virtual thunks, too. Thus we return either a function
3205 or a virtual thunk node.
3206 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3209 cgraph_node::function_or_virtual_thunk_symbol
3210 (enum availability
*availability
)
3212 cgraph_node
*node
= ultimate_alias_target (availability
);
3214 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3216 node
= node
->callees
->callee
;
3219 enum availability a
;
3220 a
= node
->get_availability ();
3221 if (a
< *availability
)
3224 node
= node
->ultimate_alias_target (availability
);
3229 /* When doing LTO, read cgraph_node's body from disk if it is not already
3233 cgraph_node::get_untransformed_body (void)
3235 lto_file_decl_data
*file_data
;
3236 const char *data
, *name
;
3238 tree decl
= this->decl
;
3240 if (DECL_RESULT (decl
))
3243 gcc_assert (in_lto_p
);
3245 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3247 file_data
= lto_file_data
;
3248 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3250 /* We may have renamed the declaration, e.g., a static function. */
3251 name
= lto_get_decl_name_mapping (file_data
, name
);
3253 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3256 fatal_error (input_location
, "%s: section %s is missing",
3257 file_data
->file_name
,
3260 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3262 lto_input_function_body (file_data
, this, data
);
3263 lto_stats
.num_function_bodies
++;
3264 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3266 lto_free_function_in_decl_state_for_node (this);
3267 /* Keep lto file data so ipa-inline-analysis knows about cross module
3270 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3275 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3276 if it is not already present. When some IPA transformations are scheduled,
3280 cgraph_node::get_body (void)
3284 updated
= get_untransformed_body ();
3286 /* Getting transformed body makes no sense for inline clones;
3287 we should never use this on real clones becuase they are materialized
3289 TODO: Materializing clones here will likely lead to smaller LTRANS
3291 gcc_assert (!global
.inlined_to
&& !clone_of
);
3292 if (ipa_transforms_to_apply
.exists ())
3294 opt_pass
*saved_current_pass
= current_pass
;
3295 FILE *saved_dump_file
= dump_file
;
3296 int saved_dump_flags
= dump_flags
;
3298 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3299 execute_all_ipa_transforms ();
3300 cgraph_edge::rebuild_edges ();
3301 free_dominance_info (CDI_DOMINATORS
);
3302 free_dominance_info (CDI_POST_DOMINATORS
);
3306 current_pass
= saved_current_pass
;
3307 dump_file
= saved_dump_file
;
3308 dump_flags
= saved_dump_flags
;
3313 /* Return the DECL_STRUCT_FUNCTION of the function. */
3316 cgraph_node::get_fun (void)
3318 cgraph_node
*node
= this;
3319 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3321 while (!fun
&& node
->clone_of
)
3323 node
= node
->clone_of
;
3324 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3330 /* Verify if the type of the argument matches that of the function
3331 declaration. If we cannot verify this or there is a mismatch,
3335 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3338 unsigned int i
, nargs
;
3340 /* Calls to internal functions always match their signature. */
3341 if (gimple_call_internal_p (stmt
))
3344 nargs
= gimple_call_num_args (stmt
);
3346 /* Get argument types for verification. */
3348 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3350 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3352 /* Verify if the type of the argument matches that of the function
3353 declaration. If we cannot verify this or there is a mismatch,
3355 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3357 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3359 i
++, p
= DECL_CHAIN (p
))
3362 /* We cannot distinguish a varargs function from the case
3363 of excess parameters, still deferring the inlining decision
3364 to the callee is possible. */
3367 arg
= gimple_call_arg (stmt
, i
);
3368 if (p
== error_mark_node
3369 || DECL_ARG_TYPE (p
) == error_mark_node
3370 || arg
== error_mark_node
3371 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3372 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3375 if (args_count_match
&& p
)
3380 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3383 /* If this is a varargs function defer inlining decision
3387 arg
= gimple_call_arg (stmt
, i
);
3388 if (TREE_VALUE (p
) == error_mark_node
3389 || arg
== error_mark_node
3390 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3391 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3392 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3404 /* Verify if the type of the argument and lhs of CALL_STMT matches
3405 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3406 true, the arg count needs to be the same.
3407 If we cannot verify this or there is a mismatch, return false. */
3410 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3411 bool args_count_match
)
3415 if ((DECL_RESULT (callee
)
3416 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3417 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3418 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3420 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3421 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3426 /* Reset all state within cgraph.c so that we can rerun the compiler
3427 within the same process. For use by toplev::finalize. */
3430 cgraph_c_finalize (void)
3434 x_cgraph_nodes_queue
= NULL
;
3436 cgraph_fnver_htab
= NULL
;
3437 version_info_node
= NULL
;
3440 /* A wroker for call_for_symbol_and_aliases. */
3443 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3446 bool include_overwritable
)
3449 FOR_EACH_ALIAS (this, ref
)
3451 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3452 if (include_overwritable
3453 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3454 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3455 include_overwritable
))
3461 /* Return true if NODE has thunk. */
3464 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3466 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3467 if (e
->caller
->thunk
.thunk_p
)
3472 #include "gt-cgraph.h"