1 /* Callgraph handling code.
2 Copyright (C) 2003-2014 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"
33 #include "print-tree.h"
34 #include "tree-inline.h"
35 #include "langhooks.h"
44 #include "tree-ssa-alias.h"
45 #include "internal-fn.h"
47 #include "gimple-expr.h"
49 #include "gimple-iterator.h"
52 #include "gimple-ssa.h"
56 #include "value-prof.h"
58 #include "diagnostic-core.h"
60 #include "ipa-utils.h"
61 #include "lto-streamer.h"
62 #include "ipa-inline.h"
64 #include "gimple-pretty-print.h"
70 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
71 #include "tree-pass.h"
73 /* Queue of cgraph nodes scheduled to be lowered. */
74 symtab_node
*x_cgraph_nodes_queue
;
75 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
77 /* Symbol table global context. */
80 /* List of hooks triggered on cgraph_edge events. */
81 struct cgraph_edge_hook_list
{
82 cgraph_edge_hook hook
;
84 struct cgraph_edge_hook_list
*next
;
87 /* List of hooks triggered on cgraph_node events. */
88 struct cgraph_node_hook_list
{
89 cgraph_node_hook hook
;
91 struct cgraph_node_hook_list
*next
;
94 /* List of hooks triggered on events involving two cgraph_edges. */
95 struct cgraph_2edge_hook_list
{
96 cgraph_2edge_hook hook
;
98 struct cgraph_2edge_hook_list
*next
;
101 /* List of hooks triggered on events involving two cgraph_nodes. */
102 struct cgraph_2node_hook_list
{
103 cgraph_2node_hook hook
;
105 struct cgraph_2node_hook_list
*next
;
108 /* Hash descriptor for cgraph_function_version_info. */
110 struct function_version_hasher
: ggc_hasher
<cgraph_function_version_info
*>
112 static hashval_t
hash (cgraph_function_version_info
*);
113 static bool equal (cgraph_function_version_info
*,
114 cgraph_function_version_info
*);
117 /* Map a cgraph_node to cgraph_function_version_info using this htab.
118 The cgraph_function_version_info has a THIS_NODE field that is the
119 corresponding cgraph_node.. */
121 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
123 /* Hash function for cgraph_fnver_htab. */
125 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
127 int uid
= ptr
->this_node
->uid
;
128 return (hashval_t
)(uid
);
131 /* eq function for cgraph_fnver_htab. */
133 function_version_hasher::equal (cgraph_function_version_info
*n1
,
134 cgraph_function_version_info
*n2
)
136 return n1
->this_node
->uid
== n2
->this_node
->uid
;
139 /* Mark as GC root all allocated nodes. */
140 static GTY(()) struct cgraph_function_version_info
*
141 version_info_node
= NULL
;
143 /* Get the cgraph_function_version_info node corresponding to node. */
144 cgraph_function_version_info
*
145 cgraph_node::function_version (void)
147 cgraph_function_version_info key
;
148 key
.this_node
= this;
150 if (cgraph_fnver_htab
== NULL
)
153 return cgraph_fnver_htab
->find (&key
);
156 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
157 corresponding to cgraph_node NODE. */
158 cgraph_function_version_info
*
159 cgraph_node::insert_new_function_version (void)
161 version_info_node
= NULL
;
162 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
163 version_info_node
->this_node
= this;
165 if (cgraph_fnver_htab
== NULL
)
166 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
168 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
170 return version_info_node
;
173 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
174 DECL is a duplicate declaration. */
176 cgraph_node::delete_function_version (tree decl
)
178 cgraph_node
*decl_node
= cgraph_node::get (decl
);
179 cgraph_function_version_info
*decl_v
= NULL
;
181 if (decl_node
== NULL
)
184 decl_v
= decl_node
->function_version ();
189 if (decl_v
->prev
!= NULL
)
190 decl_v
->prev
->next
= decl_v
->next
;
192 if (decl_v
->next
!= NULL
)
193 decl_v
->next
->prev
= decl_v
->prev
;
195 if (cgraph_fnver_htab
!= NULL
)
196 cgraph_fnver_htab
->remove_elt (decl_v
);
198 decl_node
->remove ();
201 /* Record that DECL1 and DECL2 are semantically identical function
204 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
206 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
207 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
208 cgraph_function_version_info
*decl1_v
= NULL
;
209 cgraph_function_version_info
*decl2_v
= NULL
;
210 cgraph_function_version_info
*before
;
211 cgraph_function_version_info
*after
;
213 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
214 decl1_v
= decl1_node
->function_version ();
215 decl2_v
= decl2_node
->function_version ();
217 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
221 decl1_v
= decl1_node
->insert_new_function_version ();
224 decl2_v
= decl2_node
->insert_new_function_version ();
226 /* Chain decl2_v and decl1_v. All semantically identical versions
227 will be chained together. */
232 while (before
->next
!= NULL
)
233 before
= before
->next
;
235 while (after
->prev
!= NULL
)
238 before
->next
= after
;
239 after
->prev
= before
;
242 /* Register HOOK to be called with DATA on each removed edge. */
243 cgraph_edge_hook_list
*
244 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
246 cgraph_edge_hook_list
*entry
;
247 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
249 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
259 /* Remove ENTRY from the list of hooks called on removing edges. */
261 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
263 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
265 while (*ptr
!= entry
)
271 /* Call all edge removal hooks. */
273 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
275 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
278 entry
->hook (e
, entry
->data
);
283 /* Register HOOK to be called with DATA on each removed node. */
284 cgraph_node_hook_list
*
285 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
287 cgraph_node_hook_list
*entry
;
288 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
290 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
300 /* Remove ENTRY from the list of hooks called on removing nodes. */
302 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
304 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
306 while (*ptr
!= entry
)
312 /* Call all node removal hooks. */
314 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
316 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
319 entry
->hook (node
, entry
->data
);
324 /* Call all node removal hooks. */
326 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
328 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
331 entry
->hook (node
, entry
->data
);
337 /* Register HOOK to be called with DATA on each inserted node. */
338 cgraph_node_hook_list
*
339 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
341 cgraph_node_hook_list
*entry
;
342 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
344 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
354 /* Remove ENTRY from the list of hooks called on inserted nodes. */
356 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
358 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
360 while (*ptr
!= entry
)
366 /* Register HOOK to be called with DATA on each duplicated edge. */
367 cgraph_2edge_hook_list
*
368 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
370 cgraph_2edge_hook_list
*entry
;
371 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
373 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
383 /* Remove ENTRY from the list of hooks called on duplicating edges. */
385 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
387 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
389 while (*ptr
!= entry
)
395 /* Call all edge duplication hooks. */
397 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
399 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
402 entry
->hook (cs1
, cs2
, entry
->data
);
407 /* Register HOOK to be called with DATA on each duplicated node. */
408 cgraph_2node_hook_list
*
409 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
411 cgraph_2node_hook_list
*entry
;
412 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
414 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
424 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
426 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
428 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
430 while (*ptr
!= entry
)
436 /* Call all node duplication hooks. */
438 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
441 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
444 entry
->hook (node
, node2
, entry
->data
);
449 /* Return cgraph node assigned to DECL. Create new one when needed. */
452 cgraph_node::create (tree decl
)
454 cgraph_node
*node
= symtab
->create_empty ();
455 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
458 node
->register_symbol ();
460 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
462 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
463 node
->next_nested
= node
->origin
->nested
;
464 node
->origin
->nested
= node
;
469 /* Try to find a call graph node for declaration DECL and if it does not exist
470 or if it corresponds to an inline clone, create a new one. */
473 cgraph_node::get_create (tree decl
)
475 cgraph_node
*first_clone
= cgraph_node::get (decl
);
477 if (first_clone
&& !first_clone
->global
.inlined_to
)
480 cgraph_node
*node
= cgraph_node::create (decl
);
483 first_clone
->clone_of
= node
;
484 node
->clones
= first_clone
;
485 symtab
->symtab_prevail_in_asm_name_hash (node
);
486 node
->decl
->decl_with_vis
.symtab_node
= node
;
488 fprintf (dump_file
, "Introduced new external node "
489 "(%s/%i) and turned into root of the clone tree.\n",
490 xstrdup (node
->name ()), node
->order
);
493 fprintf (dump_file
, "Introduced new external node "
494 "(%s/%i).\n", xstrdup (node
->name ()),
499 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
500 the function body is associated with (not necessarily cgraph_node (DECL). */
503 cgraph_node::create_alias (tree alias
, tree target
)
505 cgraph_node
*alias_node
;
507 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
508 || TREE_CODE (target
) == IDENTIFIER_NODE
);
509 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
510 alias_node
= cgraph_node::get_create (alias
);
511 gcc_assert (!alias_node
->definition
);
512 alias_node
->alias_target
= target
;
513 alias_node
->definition
= true;
514 alias_node
->alias
= true;
515 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
516 alias_node
->weakref
= true;
520 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
522 Same body aliases are output whenever the body of DECL is output,
523 and cgraph_node::get (ALIAS) transparently returns
524 cgraph_node::get (DECL). */
527 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
530 #ifndef ASM_OUTPUT_DEF
531 /* If aliases aren't supported by the assembler, fail. */
534 /* Langhooks can create same body aliases of symbols not defined.
535 Those are useless. Drop them on the floor. */
536 if (symtab
->global_info_ready
)
539 n
= cgraph_node::create_alias (alias
, decl
);
540 n
->cpp_implicit_alias
= true;
541 if (symtab
->cpp_implicit_aliases_done
)
542 n
->resolve_alias (cgraph_node::get (decl
));
546 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
547 aliases DECL with an adjustments made into the first parameter.
548 See comments in thunk_adjust for detail on the parameters. */
551 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
552 HOST_WIDE_INT fixed_offset
,
553 HOST_WIDE_INT virtual_value
,
559 node
= cgraph_node::get (alias
);
563 node
= cgraph_node::create (alias
);
564 gcc_checking_assert (!virtual_offset
565 || wi::eq_p (virtual_offset
, virtual_value
));
566 node
->thunk
.fixed_offset
= fixed_offset
;
567 node
->thunk
.this_adjusting
= this_adjusting
;
568 node
->thunk
.virtual_value
= virtual_value
;
569 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
570 node
->thunk
.alias
= real_alias
;
571 node
->thunk
.thunk_p
= true;
572 node
->definition
= true;
577 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
578 Return NULL if there's no such node. */
581 cgraph_node::get_for_asmname (tree asmname
)
583 /* We do not want to look at inline clones. */
584 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
586 node
= node
->next_sharing_asm_name
)
588 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
589 if (cn
&& !cn
->global
.inlined_to
)
595 /* Returns a hash value for X (which really is a cgraph_edge). */
598 cgraph_edge_hasher::hash (cgraph_edge
*e
)
600 return htab_hash_pointer (e
->call_stmt
);
603 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
606 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple y
)
608 return x
->call_stmt
== y
;
611 /* Add call graph edge E to call site hash of its caller. */
614 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
616 gimple call
= e
->call_stmt
;
617 *e
->caller
->call_site_hash
->find_slot_with_hash (call
,
618 htab_hash_pointer (call
),
622 /* Add call graph edge E to call site hash of its caller. */
625 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
627 /* There are two speculative edges for every statement (one direct,
628 one indirect); always hash the direct one. */
629 if (e
->speculative
&& e
->indirect_unknown_callee
)
631 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
633 htab_hash_pointer (e
->call_stmt
), INSERT
);
636 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
641 gcc_assert (!*slot
|| e
->speculative
);
645 /* Return the callgraph edge representing the GIMPLE_CALL statement
649 cgraph_node::get_edge (gimple call_stmt
)
655 return call_site_hash
->find_with_hash (call_stmt
,
656 htab_hash_pointer (call_stmt
));
658 /* This loop may turn out to be performance problem. In such case adding
659 hashtables into call nodes with very many edges is probably best
660 solution. It is not good idea to add pointer into CALL_EXPR itself
661 because we want to make possible having multiple cgraph nodes representing
662 different clones of the same body before the body is actually cloned. */
663 for (e
= callees
; e
; e
= e
->next_callee
)
665 if (e
->call_stmt
== call_stmt
)
671 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
673 if (e
->call_stmt
== call_stmt
)
680 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
681 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
682 cgraph_add_edge_to_call_site_hash (e2
);
683 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
684 cgraph_add_edge_to_call_site_hash (e2
);
691 /* Change field call_stmt of edge to NEW_STMT.
692 If UPDATE_SPECULATIVE and E is any component of speculative
693 edge, then update all components. */
696 cgraph_edge::set_call_stmt (gimple new_stmt
, bool update_speculative
)
700 /* Speculative edges has three component, update all of them
702 if (update_speculative
&& speculative
)
704 cgraph_edge
*direct
, *indirect
;
707 speculative_call_info (direct
, indirect
, ref
);
708 direct
->set_call_stmt (new_stmt
, false);
709 indirect
->set_call_stmt (new_stmt
, false);
710 ref
->stmt
= new_stmt
;
714 /* Only direct speculative edges go to call_site_hash. */
715 if (caller
->call_site_hash
716 && (!speculative
|| !indirect_unknown_callee
))
718 caller
->call_site_hash
->remove_elt_with_hash
719 (call_stmt
, htab_hash_pointer (call_stmt
));
722 cgraph_edge
*e
= this;
724 call_stmt
= new_stmt
;
725 if (indirect_unknown_callee
726 && (decl
= gimple_call_fndecl (new_stmt
)))
728 /* Constant propagation (and possibly also inlining?) can turn an
729 indirect call into a direct one. */
730 cgraph_node
*new_callee
= cgraph_node::get (decl
);
732 gcc_checking_assert (new_callee
);
733 e
= make_direct (new_callee
);
736 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
737 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
739 if (e
->caller
->call_site_hash
)
740 cgraph_add_edge_to_call_site_hash (e
);
743 /* Allocate a cgraph_edge structure and fill it with data according to the
744 parameters of which only CALLEE can be NULL (when creating an indirect call
748 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
749 gimple call_stmt
, gcov_type count
, int freq
,
750 bool indir_unknown_callee
)
754 /* LTO does not actually have access to the call_stmt since these
755 have not been loaded yet. */
758 /* This is a rather expensive check possibly triggering
759 construction of call stmt hashtable. */
760 #ifdef ENABLE_CHECKING
762 gcc_checking_assert (
763 !(e
= caller
->get_edge (call_stmt
)) || e
->speculative
);
766 gcc_assert (is_gimple_call (call_stmt
));
772 free_edges
= NEXT_FREE_EDGE (edge
);
776 edge
= ggc_alloc
<cgraph_edge
> ();
777 edge
->uid
= edges_max_uid
++;
783 edge
->caller
= caller
;
784 edge
->callee
= callee
;
785 edge
->prev_caller
= NULL
;
786 edge
->next_caller
= NULL
;
787 edge
->prev_callee
= NULL
;
788 edge
->next_callee
= NULL
;
789 edge
->lto_stmt_uid
= 0;
792 gcc_assert (count
>= 0);
793 edge
->frequency
= freq
;
794 gcc_assert (freq
>= 0);
795 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
797 edge
->call_stmt
= call_stmt
;
798 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
799 edge
->can_throw_external
800 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
803 && callee
&& callee
->decl
804 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
806 edge
->call_stmt_cannot_inline_p
= true;
808 edge
->call_stmt_cannot_inline_p
= false;
810 edge
->indirect_info
= NULL
;
811 edge
->indirect_inlining_edge
= 0;
812 edge
->speculative
= false;
813 edge
->indirect_unknown_callee
= indir_unknown_callee
;
814 if (flag_devirtualize
&& call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
815 edge
->in_polymorphic_cdtor
816 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
819 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
820 if (call_stmt
&& caller
->call_site_hash
)
821 cgraph_add_edge_to_call_site_hash (edge
);
826 /* Create edge from a given function to CALLEE in the cgraph. */
829 cgraph_node::create_edge (cgraph_node
*callee
,
830 gimple call_stmt
, gcov_type count
, int freq
)
832 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
835 initialize_inline_failed (edge
);
837 edge
->next_caller
= callee
->callers
;
839 callee
->callers
->prev_caller
= edge
;
840 edge
->next_callee
= callees
;
842 callees
->prev_callee
= edge
;
844 callee
->callers
= edge
;
849 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
851 cgraph_indirect_call_info
*
852 cgraph_allocate_init_indirect_info (void)
854 cgraph_indirect_call_info
*ii
;
856 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
857 ii
->param_index
= -1;
861 /* Create an indirect edge with a yet-undetermined callee where the call
862 statement destination is a formal parameter of the caller with index
866 cgraph_node::create_indirect_edge (gimple call_stmt
, int ecf_flags
,
867 gcov_type count
, int freq
,
868 bool compute_indirect_info
)
870 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
874 initialize_inline_failed (edge
);
876 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
877 edge
->indirect_info
->ecf_flags
= ecf_flags
;
878 edge
->indirect_info
->vptr_changed
= true;
880 /* Record polymorphic call info. */
881 if (compute_indirect_info
883 && (target
= gimple_call_fn (call_stmt
))
884 && virtual_method_call_p (target
))
886 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
888 /* Only record types can have virtual calls. */
889 edge
->indirect_info
->polymorphic
= true;
890 edge
->indirect_info
->param_index
= -1;
891 edge
->indirect_info
->otr_token
892 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
893 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
894 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
895 edge
->indirect_info
->context
= context
;
898 edge
->next_callee
= indirect_calls
;
900 indirect_calls
->prev_callee
= edge
;
901 indirect_calls
= edge
;
906 /* Remove the edge from the list of the callers of the callee. */
909 cgraph_edge::remove_callee (void)
911 gcc_assert (!indirect_unknown_callee
);
913 prev_caller
->next_caller
= next_caller
;
915 next_caller
->prev_caller
= prev_caller
;
917 callee
->callers
= next_caller
;
920 /* Remove the edge from the list of the callees of the caller. */
923 cgraph_edge::remove_caller (void)
926 prev_callee
->next_callee
= next_callee
;
928 next_callee
->prev_callee
= prev_callee
;
931 if (indirect_unknown_callee
)
932 caller
->indirect_calls
= next_callee
;
934 caller
->callees
= next_callee
;
936 if (caller
->call_site_hash
)
937 caller
->call_site_hash
->remove_elt_with_hash (call_stmt
,
938 htab_hash_pointer (call_stmt
));
941 /* Put the edge onto the free list. */
944 symbol_table::free_edge (cgraph_edge
*e
)
948 if (e
->indirect_info
)
949 ggc_free (e
->indirect_info
);
951 /* Clear out the edge so we do not dangle pointers. */
952 memset (e
, 0, sizeof (*e
));
954 NEXT_FREE_EDGE (e
) = free_edges
;
959 /* Remove the edge in the cgraph. */
962 cgraph_edge::remove (void)
964 /* Call all edge removal hooks. */
965 symtab
->call_edge_removal_hooks (this);
967 if (!indirect_unknown_callee
)
968 /* Remove from callers list of the callee. */
971 /* Remove from callees list of the callers. */
974 /* Put the edge onto the free list. */
975 symtab
->free_edge (this);
978 /* Set callee of call graph edge E and add it to the corresponding set of
982 cgraph_set_edge_callee (cgraph_edge
*e
, cgraph_node
*n
)
984 e
->prev_caller
= NULL
;
986 n
->callers
->prev_caller
= e
;
987 e
->next_caller
= n
->callers
;
992 /* Turn edge into speculative call calling N2. Update
993 the profile so the direct call is taken COUNT times
996 At clone materialization time, the indirect call E will
1004 At this time the function just creates the direct call,
1005 the referencd representing the if conditional and attaches
1006 them all to the orginal indirect call statement.
1008 Return direct edge created. */
1011 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1012 int direct_frequency
)
1014 cgraph_node
*n
= caller
;
1015 ipa_ref
*ref
= NULL
;
1020 fprintf (dump_file
, "Indirect call -> speculative call"
1021 " %s/%i => %s/%i\n",
1022 xstrdup (n
->name ()), n
->order
,
1023 xstrdup (n2
->name ()), n2
->order
);
1026 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1027 initialize_inline_failed (e2
);
1028 e2
->speculative
= true;
1029 if (TREE_NOTHROW (n2
->decl
))
1030 e2
->can_throw_external
= false;
1032 e2
->can_throw_external
= can_throw_external
;
1033 e2
->lto_stmt_uid
= lto_stmt_uid
;
1034 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1036 frequency
-= e2
->frequency
;
1037 symtab
->call_edge_duplication_hooks (this, e2
);
1038 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1039 ref
->lto_stmt_uid
= lto_stmt_uid
;
1040 ref
->speculative
= speculative
;
1041 n2
->mark_address_taken ();
1045 /* Speculative call consist of three components:
1046 1) an indirect edge representing the original call
1047 2) an direct edge representing the new call
1048 3) ADDR_EXPR reference representing the speculative check.
1049 All three components are attached to single statement (the indirect
1050 call) and if one of them exists, all of them must exist.
1052 Given speculative call edge, return all three components.
1056 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1057 cgraph_edge
*&indirect
,
1058 ipa_ref
*&reference
)
1063 cgraph_edge
*e
= this;
1065 if (!e
->indirect_unknown_callee
)
1066 for (e2
= e
->caller
->indirect_calls
;
1067 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1068 e2
= e2
->next_callee
)
1073 /* We can take advantage of the call stmt hash. */
1076 e
= e
->caller
->get_edge (e2
->call_stmt
);
1077 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1080 for (e
= e
->caller
->callees
;
1081 e2
->call_stmt
!= e
->call_stmt
1082 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1086 gcc_assert (e
->speculative
&& e2
->speculative
);
1091 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1092 if (ref
->speculative
1093 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1094 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1100 /* Speculative edge always consist of all three components - direct edge,
1101 indirect and reference. */
1103 gcc_assert (e
&& e2
&& ref
);
1106 /* Redirect callee of the edge to N. The function does not update underlying
1110 cgraph_edge::redirect_callee (cgraph_node
*n
)
1112 /* Remove from callers list of the current callee. */
1115 /* Insert to callers list of the new callee. */
1116 cgraph_set_edge_callee (this, n
);
1119 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1120 Remove the speculative call sequence and return edge representing the call.
1121 It is up to caller to redirect the call as appropriate. */
1124 cgraph_edge::resolve_speculation (tree callee_decl
)
1126 cgraph_edge
*edge
= this;
1130 gcc_assert (edge
->speculative
);
1131 edge
->speculative_call_info (e2
, edge
, ref
);
1133 || !ref
->referred
->semantically_equivalent_p
1134 (symtab_node::get (callee_decl
)))
1140 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1141 "turned out to have contradicting known target ",
1142 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1143 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1144 print_generic_expr (dump_file
, callee_decl
, 0);
1145 fprintf (dump_file
, "\n");
1149 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1150 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1151 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1157 cgraph_edge
*tmp
= edge
;
1159 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1162 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1163 in the functions inlined through it. */
1165 edge
->count
+= e2
->count
;
1166 edge
->frequency
+= e2
->frequency
;
1167 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1168 edge
->frequency
= CGRAPH_FREQ_MAX
;
1169 edge
->speculative
= false;
1170 e2
->speculative
= false;
1171 ref
->remove_reference ();
1172 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1175 e2
->callee
->remove_symbol_and_inline_clones ();
1176 if (edge
->caller
->call_site_hash
)
1177 cgraph_update_edge_in_call_site_hash (edge
);
1181 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1182 CALLEE. DELTA is an integer constant that is to be added to the this
1183 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1186 cgraph_edge::make_direct (cgraph_node
*callee
)
1188 cgraph_edge
*edge
= this;
1189 gcc_assert (indirect_unknown_callee
);
1191 /* If we are redirecting speculative call, make it non-speculative. */
1192 if (indirect_unknown_callee
&& speculative
)
1194 edge
= edge
->resolve_speculation (callee
->decl
);
1196 /* On successful speculation just return the pre existing direct edge. */
1197 if (!indirect_unknown_callee
)
1201 indirect_unknown_callee
= 0;
1202 ggc_free (indirect_info
);
1203 indirect_info
= NULL
;
1205 /* Get the edge out of the indirect edge list. */
1207 prev_callee
->next_callee
= next_callee
;
1209 next_callee
->prev_callee
= prev_callee
;
1211 caller
->indirect_calls
= next_callee
;
1213 /* Put it into the normal callee list */
1215 next_callee
= caller
->callees
;
1216 if (caller
->callees
)
1217 caller
->callees
->prev_callee
= edge
;
1218 caller
->callees
= edge
;
1220 /* Insert to callers list of the new callee. */
1221 cgraph_set_edge_callee (edge
, callee
);
1224 call_stmt_cannot_inline_p
1225 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1228 /* We need to re-determine the inlining status of the edge. */
1229 initialize_inline_failed (edge
);
1233 /* If necessary, change the function declaration in the call statement
1234 associated with E so that it corresponds to the edge callee. */
1237 cgraph_edge::redirect_call_stmt_to_callee (void)
1239 cgraph_edge
*e
= this;
1241 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1242 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1244 gimple_stmt_iterator gsi
;
1245 #ifdef ENABLE_CHECKING
1255 e
->speculative_call_info (e
, e2
, ref
);
1256 /* If there already is an direct call (i.e. as a result of inliner's
1257 substitution), forget about speculating. */
1259 e
= e
->resolve_speculation (decl
);
1260 /* If types do not match, speculation was likely wrong.
1261 The direct edge was posisbly redirected to the clone with a different
1262 signature. We did not update the call statement yet, so compare it
1263 with the reference that still points to the proper type. */
1264 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1265 ref
->referred
->decl
,
1269 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1271 xstrdup (e
->caller
->name ()),
1273 xstrdup (e
->callee
->name ()),
1275 e
= e
->resolve_speculation ();
1276 /* We are producing the final function body and will throw away the
1277 callgraph edges really soon. Reset the counts/frequencies to
1278 keep verifier happy in the case of roundoff errors. */
1279 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1280 e
->frequency
= compute_call_stmt_bb_frequency
1281 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1283 /* Expand speculation into GIMPLE code. */
1288 "Expanding speculative call of %s/%i -> %s/%i count:"
1290 xstrdup (e
->caller
->name ()),
1292 xstrdup (e
->callee
->name ()),
1295 gcc_assert (e2
->speculative
);
1296 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1297 new_stmt
= gimple_ic (e
->call_stmt
, dyn_cast
<cgraph_node
*> (ref
->referred
),
1298 e
->count
|| e2
->count
1299 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1300 e
->count
+ e2
->count
)
1301 : e
->frequency
|| e2
->frequency
1302 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1303 e
->frequency
+ e2
->frequency
)
1304 : REG_BR_PROB_BASE
/ 2,
1305 e
->count
, e
->count
+ e2
->count
);
1306 e
->speculative
= false;
1307 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1309 e
->frequency
= compute_call_stmt_bb_frequency
1310 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1311 e2
->frequency
= compute_call_stmt_bb_frequency
1312 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1313 e2
->speculative
= false;
1314 ref
->speculative
= false;
1316 /* Indirect edges are not both in the call site hash.
1318 if (e
->caller
->call_site_hash
)
1319 cgraph_update_edge_in_call_site_hash (e2
);
1321 /* Continue redirecting E to proper target. */
1325 if (e
->indirect_unknown_callee
1326 || decl
== e
->callee
->decl
)
1327 return e
->call_stmt
;
1329 #ifdef ENABLE_CHECKING
1332 node
= cgraph_node::get (decl
);
1333 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1337 if (symtab
->dump_file
)
1339 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1340 xstrdup (e
->caller
->name ()), e
->caller
->order
,
1341 xstrdup (e
->callee
->name ()), e
->callee
->order
);
1342 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1343 if (e
->callee
->clone
.combined_args_to_skip
)
1345 fprintf (symtab
->dump_file
, " combined args to skip: ");
1346 dump_bitmap (symtab
->dump_file
,
1347 e
->callee
->clone
.combined_args_to_skip
);
1351 if (e
->callee
->clone
.combined_args_to_skip
)
1356 = gimple_call_copy_skip_args (e
->call_stmt
,
1357 e
->callee
->clone
.combined_args_to_skip
);
1358 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1359 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1361 if (gimple_vdef (new_stmt
)
1362 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1363 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1365 gsi
= gsi_for_stmt (e
->call_stmt
);
1366 gsi_replace (&gsi
, new_stmt
, false);
1367 /* We need to defer cleaning EH info on the new statement to
1368 fixup-cfg. We may not have dominator information at this point
1369 and thus would end up with unreachable blocks and have no way
1370 to communicate that we need to run CFG cleanup then. */
1371 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1374 remove_stmt_from_eh_lp (e
->call_stmt
);
1375 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1380 new_stmt
= e
->call_stmt
;
1381 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1382 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1385 /* If the call becomes noreturn, remove the lhs. */
1386 if (lhs
&& (gimple_call_flags (new_stmt
) & ECF_NORETURN
))
1388 if (TREE_CODE (lhs
) == SSA_NAME
)
1390 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1391 TREE_TYPE (lhs
), NULL
);
1392 var
= get_or_create_ssa_default_def
1393 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1394 gimple set_stmt
= gimple_build_assign (lhs
, var
);
1395 gsi
= gsi_for_stmt (new_stmt
);
1396 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1397 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1399 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1400 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1403 /* If new callee has no static chain, remove it. */
1404 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1406 gimple_call_set_chain (new_stmt
, NULL
);
1407 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1410 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1412 if (symtab
->dump_file
)
1414 fprintf (symtab
->dump_file
, " updated to:");
1415 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1420 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1421 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1422 of OLD_STMT if it was previously call statement.
1423 If NEW_STMT is NULL, the call has been dropped without any
1427 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1428 gimple old_stmt
, tree old_call
,
1431 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1432 ? gimple_call_fndecl (new_stmt
) : 0;
1434 /* We are seeing indirect calls, then there is nothing to update. */
1435 if (!new_call
&& !old_call
)
1437 /* See if we turned indirect call into direct call or folded call to one builtin
1438 into different builtin. */
1439 if (old_call
!= new_call
)
1441 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1442 cgraph_edge
*ne
= NULL
;
1448 /* See if the edge is already there and has the correct callee. It
1449 might be so because of indirect inlining has already updated
1450 it. We also might've cloned and redirected the edge. */
1451 if (new_call
&& e
->callee
)
1453 cgraph_node
*callee
= e
->callee
;
1456 if (callee
->decl
== new_call
1457 || callee
->former_clone_of
== new_call
)
1459 e
->set_call_stmt (new_stmt
);
1462 callee
= callee
->clone_of
;
1466 /* Otherwise remove edge and create new one; we can't simply redirect
1467 since function has changed, so inline plan and other information
1468 attached to edge is invalid. */
1470 frequency
= e
->frequency
;
1471 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1474 e
->callee
->remove_symbol_and_inline_clones ();
1478 /* We are seeing new direct call; compute profile info based on BB. */
1479 basic_block bb
= gimple_bb (new_stmt
);
1481 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1487 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1488 new_stmt
, count
, frequency
);
1489 gcc_assert (ne
->inline_failed
);
1492 /* We only updated the call stmt; update pointer in cgraph edge.. */
1493 else if (old_stmt
!= new_stmt
)
1494 node
->get_edge (old_stmt
)->set_call_stmt (new_stmt
);
1497 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1498 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1499 of OLD_STMT before it was updated (updating can happen inplace). */
1502 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1504 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1507 gcc_checking_assert (orig
);
1508 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1510 for (node
= orig
->clones
; node
!= orig
;)
1512 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1514 node
= node
->clones
;
1515 else if (node
->next_sibling_clone
)
1516 node
= node
->next_sibling_clone
;
1519 while (node
!= orig
&& !node
->next_sibling_clone
)
1520 node
= node
->clone_of
;
1522 node
= node
->next_sibling_clone
;
1528 /* Remove all callees from the node. */
1531 cgraph_node::remove_callees (void)
1535 /* It is sufficient to remove the edges from the lists of callers of
1536 the callees. The callee list of the node can be zapped with one
1538 for (e
= callees
; e
; e
= f
)
1541 symtab
->call_edge_removal_hooks (e
);
1542 if (!e
->indirect_unknown_callee
)
1543 e
->remove_callee ();
1544 symtab
->free_edge (e
);
1546 for (e
= indirect_calls
; e
; e
= f
)
1549 symtab
->call_edge_removal_hooks (e
);
1550 if (!e
->indirect_unknown_callee
)
1551 e
->remove_callee ();
1552 symtab
->free_edge (e
);
1554 indirect_calls
= NULL
;
1558 call_site_hash
->empty ();
1559 call_site_hash
= NULL
;
1563 /* Remove all callers from the node. */
1566 cgraph_node::remove_callers (void)
1570 /* It is sufficient to remove the edges from the lists of callees of
1571 the callers. The caller list of the node can be zapped with one
1573 for (e
= callers
; e
; e
= f
)
1576 symtab
->call_edge_removal_hooks (e
);
1577 e
->remove_caller ();
1578 symtab
->free_edge (e
);
1583 /* Helper function for cgraph_release_function_body and free_lang_data.
1584 It releases body from function DECL without having to inspect its
1585 possibly non-existent symtab node. */
1588 release_function_body (tree decl
)
1590 if (DECL_STRUCT_FUNCTION (decl
))
1592 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1596 cfun
->curr_properties
&= ~PROP_loops
;
1597 loop_optimizer_finalize ();
1599 if (cfun
->gimple_df
)
1602 delete_tree_cfg_annotations ();
1607 gcc_assert (!dom_info_available_p (CDI_DOMINATORS
));
1608 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS
));
1612 if (cfun
->value_histograms
)
1615 gimple_set_body (decl
, NULL
);
1616 /* Struct function hangs a lot of data that would leak if we didn't
1617 removed all pointers to it. */
1618 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1619 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1621 DECL_SAVED_TREE (decl
) = NULL
;
1624 /* Release memory used to represent body of function.
1625 Use this only for functions that are released before being translated to
1626 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1627 are free'd in final.c via free_after_compilation().
1628 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1631 cgraph_node::release_body (bool keep_arguments
)
1633 ipa_transforms_to_apply
.release ();
1634 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1636 DECL_RESULT (decl
) = NULL
;
1638 if (!keep_arguments
)
1639 DECL_ARGUMENTS (decl
) = NULL
;
1641 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1642 of its associated function function declaration because it's
1643 needed to emit debug info later. */
1644 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1645 DECL_INITIAL (decl
) = error_mark_node
;
1646 release_function_body (decl
);
1648 lto_free_function_in_decl_state_for_node (this);
1651 /* Remove function from symbol table. */
1654 cgraph_node::remove (void)
1657 int uid
= this->uid
;
1659 symtab
->call_cgraph_removal_hooks (this);
1662 ipa_transforms_to_apply
.release ();
1664 /* Incremental inlining access removed nodes stored in the postorder list.
1666 force_output
= false;
1667 forced_by_abi
= false;
1668 for (n
= nested
; n
; n
= n
->next_nested
)
1673 cgraph_node
**node2
= &origin
->nested
;
1675 while (*node2
!= this)
1676 node2
= &(*node2
)->next_nested
;
1677 *node2
= next_nested
;
1680 if (prev_sibling_clone
)
1681 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1683 clone_of
->clones
= next_sibling_clone
;
1684 if (next_sibling_clone
)
1685 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1688 cgraph_node
*n
, *next
;
1692 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1693 n
->clone_of
= clone_of
;
1694 n
->clone_of
= clone_of
;
1695 n
->next_sibling_clone
= clone_of
->clones
;
1696 if (clone_of
->clones
)
1697 clone_of
->clones
->prev_sibling_clone
= n
;
1698 clone_of
->clones
= clones
;
1702 /* We are removing node with clones. This makes clones inconsistent,
1703 but assume they will be removed subsequently and just keep clone
1704 tree intact. This can happen in unreachable function removal since
1705 we remove unreachable functions in random order, not by bottom-up
1706 walk of clone trees. */
1707 for (n
= clones
; n
; n
= next
)
1709 next
= n
->next_sibling_clone
;
1710 n
->next_sibling_clone
= NULL
;
1711 n
->prev_sibling_clone
= NULL
;
1717 /* While all the clones are removed after being proceeded, the function
1718 itself is kept in the cgraph even after it is compiled. Check whether
1719 we are done with this body and reclaim it proactively if this is the case.
1721 if (symtab
->state
!= LTO_STREAMING
)
1723 n
= cgraph_node::get (decl
);
1725 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1726 && (symtab
->global_info_ready
1727 && (TREE_ASM_WRITTEN (n
->decl
)
1728 || DECL_EXTERNAL (n
->decl
)
1730 || (!flag_wpa
&& n
->in_other_partition
)))))
1737 call_site_hash
->empty ();
1738 call_site_hash
= NULL
;
1741 symtab
->release_symbol (this, uid
);
1744 /* Likewise indicate that a node is having address taken. */
1747 cgraph_node::mark_address_taken (void)
1749 /* Indirect inlining can figure out that all uses of the address are
1751 if (global
.inlined_to
)
1753 gcc_assert (cfun
->after_inlining
);
1754 gcc_assert (callers
->indirect_inlining_edge
);
1757 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1758 IPA_REF_ADDR reference exists (and thus it should be set on node
1759 representing alias we take address of) and as a test whether address
1760 of the object was taken (and thus it should be set on node alias is
1761 referring to). We should remove the first use and the remove the
1764 cgraph_node
*node
= ultimate_alias_target ();
1765 node
->address_taken
= 1;
1768 /* Return local info for the compiled function. */
1771 cgraph_node::local_info (tree decl
)
1773 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1774 cgraph_node
*node
= get (decl
);
1777 return &node
->local
;
1780 /* Return global info for the compiled function. */
1782 cgraph_global_info
*
1783 cgraph_node::global_info (tree decl
)
1785 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1786 && symtab
->global_info_ready
);
1787 cgraph_node
*node
= get (decl
);
1790 return &node
->global
;
1793 /* Return local info for the compiled function. */
1796 cgraph_node::rtl_info (tree decl
)
1798 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1799 cgraph_node
*node
= get (decl
);
1801 || (decl
!= current_function_decl
1802 && !TREE_ASM_WRITTEN (node
->decl
)))
1807 /* Return a string describing the failure REASON. */
1810 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1813 #define DEFCIFCODE(code, type, string) string,
1815 static const char *cif_string_table
[CIF_N_REASONS
] = {
1816 #include "cif-code.def"
1819 /* Signedness of an enum type is implementation defined, so cast it
1820 to unsigned before testing. */
1821 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1822 return cif_string_table
[reason
];
1825 /* Return a type describing the failure REASON. */
1827 cgraph_inline_failed_type_t
1828 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1831 #define DEFCIFCODE(code, type, string) type,
1833 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1834 #include "cif-code.def"
1837 /* Signedness of an enum type is implementation defined, so cast it
1838 to unsigned before testing. */
1839 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1840 return cif_type_table
[reason
];
1843 /* Names used to print out the availability enum. */
1844 const char * const cgraph_availability_names
[] =
1845 {"unset", "not_available", "overwritable", "available", "local"};
1847 /* Output flags of edge E. */
1850 dump_edge_flags (FILE *f
, struct cgraph_edge
*edge
)
1852 if (edge
->speculative
)
1853 fprintf (f
, "(speculative) ");
1854 if (!edge
->inline_failed
)
1855 fprintf (f
, "(inlined) ");
1856 if (edge
->indirect_inlining_edge
)
1857 fprintf (f
, "(indirect_inlining) ");
1859 fprintf (f
, "(%"PRId64
"x) ",
1860 (int64_t)edge
->count
);
1861 if (edge
->frequency
)
1862 fprintf (f
, "(%.2f per call) ",
1863 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1864 if (edge
->can_throw_external
)
1865 fprintf (f
, "(can throw external) ");
1868 /* Dump call graph node to file F. */
1871 cgraph_node::dump (FILE *f
)
1877 if (global
.inlined_to
)
1878 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1881 xstrdup (global
.inlined_to
->name ()),
1882 global
.inlined_to
->order
);
1884 fprintf (f
, " Clone of %s/%i\n",
1885 clone_of
->asm_name (),
1887 if (symtab
->function_flags_ready
)
1888 fprintf (f
, " Availability: %s\n",
1889 cgraph_availability_names
[get_availability ()]);
1892 fprintf (f
, " Profile id: %i\n",
1894 fprintf (f
, " First run: %i\n", tp_first_run
);
1895 fprintf (f
, " Function flags:");
1897 fprintf (f
, " executed %"PRId64
"x",
1900 fprintf (f
, " nested in: %s", origin
->asm_name ());
1901 if (gimple_has_body_p (decl
))
1902 fprintf (f
, " body");
1904 fprintf (f
, " process");
1906 fprintf (f
, " local");
1907 if (local
.redefined_extern_inline
)
1908 fprintf (f
, " redefined_extern_inline");
1909 if (only_called_at_startup
)
1910 fprintf (f
, " only_called_at_startup");
1911 if (only_called_at_exit
)
1912 fprintf (f
, " only_called_at_exit");
1914 fprintf (f
, " tm_clone");
1916 fprintf (f
, " icf_merged");
1917 if (DECL_STATIC_CONSTRUCTOR (decl
))
1918 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
1919 if (DECL_STATIC_DESTRUCTOR (decl
))
1920 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
1926 fprintf (f
, " Thunk");
1928 fprintf (f
, " of %s (asm: %s)",
1929 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
1930 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
1931 fprintf (f
, " fixed offset %i virtual value %i has "
1932 "virtual offset %i)\n",
1933 (int)thunk
.fixed_offset
,
1934 (int)thunk
.virtual_value
,
1935 (int)thunk
.virtual_offset_p
);
1937 if (alias
&& thunk
.alias
1938 && DECL_P (thunk
.alias
))
1940 fprintf (f
, " Alias of %s",
1941 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
1942 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
1943 fprintf (f
, " (asm: %s)",
1944 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
1948 fprintf (f
, " Called by: ");
1950 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
1952 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
1953 edge
->caller
->order
);
1954 dump_edge_flags (f
, edge
);
1957 fprintf (f
, "\n Calls: ");
1958 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
1960 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
1961 edge
->callee
->order
);
1962 dump_edge_flags (f
, edge
);
1966 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
1968 if (edge
->indirect_info
->polymorphic
)
1970 fprintf (f
, " Polymorphic indirect call of type ");
1971 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
1972 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
1975 fprintf (f
, " Indirect call");
1976 dump_edge_flags (f
, edge
);
1977 if (edge
->indirect_info
->param_index
!= -1)
1979 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
1980 if (edge
->indirect_info
->agg_contents
)
1981 fprintf (f
, " loaded from %s %s at offset %i",
1982 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
1983 edge
->indirect_info
->by_ref
? "passed by reference":"",
1984 (int)edge
->indirect_info
->offset
);
1985 if (edge
->indirect_info
->vptr_changed
)
1986 fprintf (f
, " (vptr maybe changed)");
1989 if (edge
->indirect_info
->polymorphic
)
1990 edge
->indirect_info
->context
.dump (f
);
1994 /* Dump call graph node NODE to stderr. */
1997 cgraph_node::debug (void)
2002 /* Dump the callgraph to file F. */
2005 cgraph_node::dump_cgraph (FILE *f
)
2009 fprintf (f
, "callgraph:\n\n");
2010 FOR_EACH_FUNCTION (node
)
2014 /* Return true when the DECL can possibly be inlined. */
2017 cgraph_function_possibly_inlined_p (tree decl
)
2019 if (!symtab
->global_info_ready
)
2020 return !DECL_UNINLINABLE (decl
);
2021 return DECL_POSSIBLY_INLINED (decl
);
2024 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2026 cgraph_node::unnest (void)
2028 cgraph_node
**node2
= &origin
->nested
;
2029 gcc_assert (origin
);
2031 while (*node2
!= this)
2032 node2
= &(*node2
)->next_nested
;
2033 *node2
= next_nested
;
2037 /* Return function availability. See cgraph.h for description of individual
2040 cgraph_node::get_availability (void)
2042 enum availability avail
;
2044 avail
= AVAIL_NOT_AVAILABLE
;
2045 else if (local
.local
)
2046 avail
= AVAIL_LOCAL
;
2047 else if (alias
&& weakref
)
2048 ultimate_alias_target (&avail
);
2049 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2050 avail
= AVAIL_INTERPOSABLE
;
2051 else if (!externally_visible
)
2052 avail
= AVAIL_AVAILABLE
;
2053 /* Inline functions are safe to be analyzed even if their symbol can
2054 be overwritten at runtime. It is not meaningful to enforce any sane
2055 behaviour on replacing inline function by different body. */
2056 else if (DECL_DECLARED_INLINE_P (decl
))
2057 avail
= AVAIL_AVAILABLE
;
2059 /* If the function can be overwritten, return OVERWRITABLE. Take
2060 care at least of two notable extensions - the COMDAT functions
2061 used to share template instantiations in C++ (this is symmetric
2062 to code cp_cannot_inline_tree_fn and probably shall be shared and
2063 the inlinability hooks completely eliminated).
2065 ??? Does the C++ one definition rule allow us to always return
2066 AVAIL_AVAILABLE here? That would be good reason to preserve this
2069 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2070 avail
= AVAIL_INTERPOSABLE
;
2071 else avail
= AVAIL_AVAILABLE
;
2076 /* Worker for cgraph_node_can_be_local_p. */
2078 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2080 return !(!node
->force_output
2081 && ((DECL_COMDAT (node
->decl
)
2082 && !node
->forced_by_abi
2083 && !node
->used_from_object_file_p ()
2084 && !node
->same_comdat_group
)
2085 || !node
->externally_visible
));
2088 /* Return true if cgraph_node can be made local for API change.
2089 Extern inline functions and C++ COMDAT functions can be made local
2090 at the expense of possible code size growth if function is used in multiple
2091 compilation units. */
2093 cgraph_node::can_be_local_p (void)
2095 return (!address_taken
2096 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2100 /* Call calback on cgraph_node, thunks and aliases associated to cgraph_node.
2101 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2105 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2106 (cgraph_node
*, void *),
2108 bool include_overwritable
)
2113 if (callback (this, data
))
2115 for (e
= callers
; e
; e
= e
->next_caller
)
2116 if (e
->caller
->thunk
.thunk_p
2117 && (include_overwritable
2118 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2119 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2120 include_overwritable
))
2123 FOR_EACH_ALIAS (this, ref
)
2125 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2126 if (include_overwritable
2127 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2128 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2129 include_overwritable
))
2135 /* Call calback on function and aliases associated to the function.
2136 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2140 cgraph_node::call_for_symbol_and_aliases (bool (*callback
) (cgraph_node
*,
2143 bool include_overwritable
)
2147 if (callback (this, data
))
2150 FOR_EACH_ALIAS (this, ref
)
2152 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2153 if (include_overwritable
2154 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2155 if (alias
->call_for_symbol_and_aliases (callback
, data
,
2156 include_overwritable
))
2162 /* Worker to bring NODE local. */
2165 cgraph_node::make_local (cgraph_node
*node
, void *)
2167 gcc_checking_assert (node
->can_be_local_p ());
2168 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2170 node
->make_decl_local ();
2171 node
->set_section (NULL
);
2172 node
->set_comdat_group (NULL
);
2173 node
->externally_visible
= false;
2174 node
->forced_by_abi
= false;
2175 node
->local
.local
= true;
2176 node
->set_section (NULL
);
2177 node
->unique_name
= (node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2178 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2179 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2180 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2185 /* Bring cgraph node local. */
2188 cgraph_node::make_local (void)
2190 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2193 /* Worker to set nothrow flag. */
2196 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2200 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2203 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2204 e
->can_throw_external
= false;
2208 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2209 if any to NOTHROW. */
2212 cgraph_node::set_nothrow_flag (bool nothrow
)
2214 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2215 (void *)(size_t)nothrow
, false);
2218 /* Worker to set const flag. */
2221 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2223 /* Static constructors and destructors without a side effect can be
2225 if (data
&& !((size_t)data
& 2))
2227 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2228 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2229 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2230 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2232 TREE_READONLY (node
->decl
) = data
!= NULL
;
2233 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2237 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2238 if any to READONLY. */
2241 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2243 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2244 (void *)(size_t)(readonly
+ (int)looping
* 2),
2248 /* Worker to set pure flag. */
2251 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2253 /* Static constructors and destructors without a side effect can be
2255 if (data
&& !((size_t)data
& 2))
2257 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2258 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2259 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2260 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2262 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2263 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2267 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2271 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2273 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2274 (void *)(size_t)(pure
+ (int)looping
* 2),
2278 /* Return true when cgraph_node can not return or throw and thus
2279 it is safe to ignore its side effects for IPA analysis. */
2282 cgraph_node::cannot_return_p (void)
2284 int flags
= flags_from_decl_or_type (decl
);
2285 if (!flag_exceptions
)
2286 return (flags
& ECF_NORETURN
) != 0;
2288 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2289 == (ECF_NORETURN
| ECF_NOTHROW
));
2292 /* Return true when call of edge can not lead to return from caller
2293 and thus it is safe to ignore its side effects for IPA analysis
2294 when computing side effects of the caller.
2295 FIXME: We could actually mark all edges that have no reaching
2296 patch to the exit block or throw to get better results. */
2298 cgraph_edge::cannot_lead_to_return_p (void)
2300 if (caller
->cannot_return_p ())
2302 if (indirect_unknown_callee
)
2304 int flags
= indirect_info
->ecf_flags
;
2305 if (!flag_exceptions
)
2306 return (flags
& ECF_NORETURN
) != 0;
2308 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2309 == (ECF_NORETURN
| ECF_NOTHROW
));
2312 return callee
->cannot_return_p ();
2315 /* Return true if the call can be hot. */
2318 cgraph_edge::maybe_hot_p (void)
2320 if (profile_info
&& flag_branch_probabilities
2321 && !maybe_hot_count_p (NULL
, count
))
2323 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2325 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2327 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2329 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2331 if (optimize_size
) return false;
2332 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2334 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2335 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2337 if (flag_guess_branch_prob
)
2339 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2340 || frequency
<= (CGRAPH_FREQ_BASE
2341 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2347 /* Return true when function can be removed from callgraph
2348 if all direct calls are eliminated. */
2351 cgraph_node::can_remove_if_no_direct_calls_and_refs_p (void)
2353 gcc_assert (!global
.inlined_to
);
2354 /* Extern inlines can always go, we will use the external definition. */
2355 if (DECL_EXTERNAL (decl
))
2357 /* When function is needed, we can not remove it. */
2358 if (force_output
|| used_from_other_partition
)
2360 if (DECL_STATIC_CONSTRUCTOR (decl
)
2361 || DECL_STATIC_DESTRUCTOR (decl
))
2363 /* Only COMDAT functions can be removed if externally visible. */
2364 if (externally_visible
2365 && (!DECL_COMDAT (decl
)
2367 || used_from_object_file_p ()))
2372 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2375 nonremovable_p (cgraph_node
*node
, void *)
2377 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2380 /* Return true when function cgraph_node and its aliases can be removed from
2381 callgraph if all direct calls are eliminated. */
2384 cgraph_node::can_remove_if_no_direct_calls_p (void)
2386 /* Extern inlines can always go, we will use the external definition. */
2387 if (DECL_EXTERNAL (decl
))
2391 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2394 /* Return true when function cgraph_node can be expected to be removed
2395 from program when direct calls in this compilation unit are removed.
2397 As a special case COMDAT functions are
2398 cgraph_can_remove_if_no_direct_calls_p while the are not
2399 cgraph_only_called_directly_p (it is possible they are called from other
2402 This function behaves as cgraph_only_called_directly_p because eliminating
2403 all uses of COMDAT function does not make it necessarily disappear from
2404 the program unless we are compiling whole program or we do LTO. In this
2405 case we know we win since dynamic linking will not really discard the
2406 linkonce section. */
2409 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p (void)
2411 gcc_assert (!global
.inlined_to
);
2413 if (call_for_symbol_and_aliases (used_from_object_file_p_worker
,
2416 if (!in_lto_p
&& !flag_whole_program
)
2417 return only_called_directly_p ();
2420 if (DECL_EXTERNAL (decl
))
2422 return can_remove_if_no_direct_calls_p ();
2427 /* Worker for cgraph_only_called_directly_p. */
2430 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2432 return !node
->only_called_directly_or_aliased_p ();
2435 /* Return true when function cgraph_node and all its aliases are only called
2437 i.e. it is not externally visible, address was not taken and
2438 it is not used in any other non-standard way. */
2441 cgraph_node::only_called_directly_p (void)
2443 gcc_assert (ultimate_alias_target () == this);
2444 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2449 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2452 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2454 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2456 enum availability avail
;
2457 node
->ultimate_alias_target (&avail
);
2459 if (avail
> AVAIL_INTERPOSABLE
)
2460 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2461 if (!cs
->indirect_inlining_edge
)
2462 redirect_callers
->safe_push (cs
);
2466 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2467 cgraph_node (i.e. are not overwritable). */
2470 cgraph_node::collect_callers (void)
2472 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2473 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2474 &redirect_callers
, false);
2475 return redirect_callers
;
2478 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2481 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2483 bool skipped_thunk
= false;
2484 node
= node
->ultimate_alias_target ();
2485 node2
= node2
->ultimate_alias_target ();
2487 /* There are no virtual clones of thunks so check former_clone_of or if we
2488 might have skipped thunks because this adjustments are no longer
2490 while (node
->thunk
.thunk_p
)
2492 if (node2
->former_clone_of
== node
->decl
)
2494 if (!node
->thunk
.this_adjusting
)
2496 node
= node
->callees
->callee
->ultimate_alias_target ();
2497 skipped_thunk
= true;
2502 if (!node2
->clone
.args_to_skip
2503 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2505 if (node2
->former_clone_of
== node
->decl
)
2507 else if (!node2
->clone_of
)
2511 while (node
!= node2
&& node2
)
2512 node2
= node2
->clone_of
;
2513 return node2
!= NULL
;
2516 /* Verify edge E count and frequency. */
2519 verify_edge_count_and_frequency (cgraph_edge
*e
)
2521 bool error_found
= false;
2524 error ("caller edge count is negative");
2527 if (e
->frequency
< 0)
2529 error ("caller edge frequency is negative");
2532 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2534 error ("caller edge frequency is too large");
2537 if (gimple_has_body_p (e
->caller
->decl
)
2538 && !e
->caller
->global
.inlined_to
2540 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2541 Remove this once edges are actually removed from the function at that time. */
2543 || (inline_edge_summary_vec
.exists ()
2544 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2545 || !inline_edge_summary (e
)->predicate
)))
2547 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2548 gimple_bb (e
->call_stmt
))))
2550 error ("caller edge frequency %i does not match BB frequency %i",
2552 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2553 gimple_bb (e
->call_stmt
)));
2559 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2561 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple stmt
)
2563 bool fndecl_was_null
= false;
2564 /* debug_gimple_stmt needs correct cfun */
2565 if (cfun
!= this_cfun
)
2566 set_cfun (this_cfun
);
2567 /* ...and an actual current_function_decl */
2568 if (!current_function_decl
)
2570 current_function_decl
= this_cfun
->decl
;
2571 fndecl_was_null
= true;
2573 debug_gimple_stmt (stmt
);
2574 if (fndecl_was_null
)
2575 current_function_decl
= NULL
;
2578 /* Verify that call graph edge E corresponds to DECL from the associated
2579 statement. Return true if the verification should fail. */
2582 verify_edge_corresponds_to_fndecl (cgraph_edge
*e
, tree decl
)
2586 if (!decl
|| e
->callee
->global
.inlined_to
)
2588 if (symtab
->state
== LTO_STREAMING
)
2590 node
= cgraph_node::get (decl
);
2592 /* We do not know if a node from a different partition is an alias or what it
2593 aliases and therefore cannot do the former_clone_of check reliably. When
2594 body_removed is set, we have lost all information about what was alias or
2595 thunk of and also cannot proceed. */
2597 || node
->body_removed
2598 || node
->in_other_partition
2600 || e
->callee
->in_other_partition
)
2603 node
= node
->ultimate_alias_target ();
2605 /* Optimizers can redirect unreachable calls or calls triggering undefined
2606 behaviour to builtin_unreachable. */
2607 if (DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
2608 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
2611 if (e
->callee
->former_clone_of
!= node
->decl
2612 && (node
!= e
->callee
->ultimate_alias_target ())
2613 && !clone_of_p (node
, e
->callee
))
2619 /* Verify cgraph nodes of given cgraph node. */
2621 cgraph_node::verify_node (void)
2624 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2625 basic_block this_block
;
2626 gimple_stmt_iterator gsi
;
2627 bool error_found
= false;
2632 timevar_push (TV_CGRAPH_VERIFY
);
2633 error_found
|= verify_base ();
2634 for (e
= callees
; e
; e
= e
->next_callee
)
2637 error ("aux field set for edge %s->%s",
2638 identifier_to_locale (e
->caller
->name ()),
2639 identifier_to_locale (e
->callee
->name ()));
2644 error ("execution count is negative");
2647 if (global
.inlined_to
&& same_comdat_group
)
2649 error ("inline clone in same comdat group list");
2652 if (!definition
&& !in_other_partition
&& local
.local
)
2654 error ("local symbols must be defined");
2657 if (global
.inlined_to
&& externally_visible
)
2659 error ("externally visible inline clone");
2662 if (global
.inlined_to
&& address_taken
)
2664 error ("inline clone with address taken");
2667 if (global
.inlined_to
&& force_output
)
2669 error ("inline clone is forced to output");
2672 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2676 error ("aux field set for indirect edge from %s",
2677 identifier_to_locale (e
->caller
->name ()));
2680 if (!e
->indirect_unknown_callee
2681 || !e
->indirect_info
)
2683 error ("An indirect edge from %s is not marked as indirect or has "
2684 "associated indirect_info, the corresponding statement is: ",
2685 identifier_to_locale (e
->caller
->name ()));
2686 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2690 bool check_comdat
= comdat_local_p ();
2691 for (e
= callers
; e
; e
= e
->next_caller
)
2693 if (verify_edge_count_and_frequency (e
))
2696 && !in_same_comdat_group_p (e
->caller
))
2698 error ("comdat-local function called by %s outside its comdat",
2699 identifier_to_locale (e
->caller
->name ()));
2702 if (!e
->inline_failed
)
2704 if (global
.inlined_to
2705 != (e
->caller
->global
.inlined_to
2706 ? e
->caller
->global
.inlined_to
: e
->caller
))
2708 error ("inlined_to pointer is wrong");
2711 if (callers
->next_caller
)
2713 error ("multiple inline callers");
2718 if (global
.inlined_to
)
2720 error ("inlined_to pointer set for noninline callers");
2724 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2725 if (verify_edge_count_and_frequency (e
))
2727 if (!callers
&& global
.inlined_to
)
2729 error ("inlined_to pointer is set but no predecessors found");
2732 if (global
.inlined_to
== this)
2734 error ("inlined_to pointer refers to itself");
2741 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2746 error ("cgraph_node has wrong clone_of");
2753 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2754 if (n
->clone_of
!= this)
2758 error ("cgraph_node has wrong clone list");
2762 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2764 error ("cgraph_node is in clone list but it is not clone");
2767 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2769 error ("cgraph_node has wrong prev_clone pointer");
2772 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2774 error ("double linked list of clones corrupted");
2778 if (analyzed
&& alias
)
2780 bool ref_found
= false;
2782 ipa_ref
*ref
= NULL
;
2786 error ("Alias has call edges");
2789 for (i
= 0; iterate_reference (i
, ref
); i
++)
2790 if (ref
->use
!= IPA_REF_ALIAS
)
2792 error ("Alias has non-alias reference");
2797 error ("Alias has more than one alias reference");
2804 error ("Analyzed alias has no reference");
2808 if (analyzed
&& thunk
.thunk_p
)
2812 error ("No edge out of thunk node");
2815 else if (callees
->next_callee
)
2817 error ("More than one edge out of thunk node");
2820 if (gimple_has_body_p (decl
))
2822 error ("Thunk is not supposed to have body");
2826 else if (analyzed
&& gimple_has_body_p (decl
)
2827 && !TREE_ASM_WRITTEN (decl
)
2828 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
2833 hash_set
<gimple
> stmts
;
2835 ipa_ref
*ref
= NULL
;
2837 /* Reach the trees by walking over the CFG, and note the
2838 enclosing basic-blocks in the call edges. */
2839 FOR_EACH_BB_FN (this_block
, this_cfun
)
2841 for (gsi
= gsi_start_phis (this_block
);
2842 !gsi_end_p (gsi
); gsi_next (&gsi
))
2843 stmts
.add (gsi_stmt (gsi
));
2844 for (gsi
= gsi_start_bb (this_block
);
2848 gimple stmt
= gsi_stmt (gsi
);
2850 if (is_gimple_call (stmt
))
2852 cgraph_edge
*e
= get_edge (stmt
);
2853 tree decl
= gimple_call_fndecl (stmt
);
2858 error ("shared call_stmt:");
2859 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2862 if (!e
->indirect_unknown_callee
)
2864 if (verify_edge_corresponds_to_fndecl (e
, decl
))
2866 error ("edge points to wrong declaration:");
2867 debug_tree (e
->callee
->decl
);
2868 fprintf (stderr
," Instead of:");
2875 error ("an indirect edge with unknown callee "
2876 "corresponding to a call_stmt with "
2877 "a known declaration:");
2879 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2885 error ("missing callgraph edge for call stmt:");
2886 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2892 for (i
= 0; iterate_reference (i
, ref
); i
++)
2893 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
2895 error ("reference to dead statement");
2896 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
2901 /* No CFG available?! */
2904 for (e
= callees
; e
; e
= e
->next_callee
)
2908 error ("edge %s->%s has no corresponding call_stmt",
2909 identifier_to_locale (e
->caller
->name ()),
2910 identifier_to_locale (e
->callee
->name ()));
2911 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2916 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2918 if (!e
->aux
&& !e
->speculative
)
2920 error ("an indirect edge from %s has no corresponding call_stmt",
2921 identifier_to_locale (e
->caller
->name ()));
2922 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2931 internal_error ("verify_cgraph_node failed");
2933 timevar_pop (TV_CGRAPH_VERIFY
);
2936 /* Verify whole cgraph structure. */
2938 cgraph_node::verify_cgraph_nodes (void)
2945 FOR_EACH_FUNCTION (node
)
2949 /* Walk the alias chain to return the function cgraph_node is alias of.
2950 Walk through thunk, too.
2951 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
2954 cgraph_node::function_symbol (enum availability
*availability
)
2956 cgraph_node
*node
= this;
2960 node
= node
->ultimate_alias_target (availability
);
2961 if (node
->thunk
.thunk_p
)
2963 node
= node
->callees
->callee
;
2966 enum availability a
;
2967 a
= node
->get_availability ();
2968 if (a
< *availability
)
2971 node
= node
->ultimate_alias_target (availability
);
2973 } while (node
&& node
->thunk
.thunk_p
);
2977 /* When doing LTO, read cgraph_node's body from disk if it is not already
2981 cgraph_node::get_body (void)
2983 lto_file_decl_data
*file_data
;
2984 const char *data
, *name
;
2986 tree decl
= this->decl
;
2988 if (DECL_RESULT (decl
))
2991 gcc_assert (in_lto_p
);
2993 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
2995 file_data
= lto_file_data
;
2996 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
2998 /* We may have renamed the declaration, e.g., a static function. */
2999 name
= lto_get_decl_name_mapping (file_data
, name
);
3001 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3004 fatal_error ("%s: section %s is missing",
3005 file_data
->file_name
,
3008 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3010 lto_input_function_body (file_data
, this, data
);
3011 lto_stats
.num_function_bodies
++;
3012 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3014 lto_free_function_in_decl_state_for_node (this);
3016 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3021 /* Return the DECL_STRUCT_FUNCTION of the function. */
3024 cgraph_node::get_fun (void)
3026 cgraph_node
*node
= this;
3027 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3029 while (!fun
&& node
->clone_of
)
3031 node
= node
->clone_of
;
3032 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3038 /* Verify if the type of the argument matches that of the function
3039 declaration. If we cannot verify this or there is a mismatch,
3043 gimple_check_call_args (gimple stmt
, tree fndecl
, bool args_count_match
)
3046 unsigned int i
, nargs
;
3048 /* Calls to internal functions always match their signature. */
3049 if (gimple_call_internal_p (stmt
))
3052 nargs
= gimple_call_num_args (stmt
);
3054 /* Get argument types for verification. */
3056 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3058 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3060 /* Verify if the type of the argument matches that of the function
3061 declaration. If we cannot verify this or there is a mismatch,
3063 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3065 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3067 i
++, p
= DECL_CHAIN (p
))
3070 /* We cannot distinguish a varargs function from the case
3071 of excess parameters, still deferring the inlining decision
3072 to the callee is possible. */
3075 arg
= gimple_call_arg (stmt
, i
);
3076 if (p
== error_mark_node
3077 || DECL_ARG_TYPE (p
) == error_mark_node
3078 || arg
== error_mark_node
3079 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3080 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3083 if (args_count_match
&& p
)
3088 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3091 /* If this is a varargs function defer inlining decision
3095 arg
= gimple_call_arg (stmt
, i
);
3096 if (TREE_VALUE (p
) == error_mark_node
3097 || arg
== error_mark_node
3098 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3099 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3100 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3112 /* Verify if the type of the argument and lhs of CALL_STMT matches
3113 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3114 true, the arg count needs to be the same.
3115 If we cannot verify this or there is a mismatch, return false. */
3118 gimple_check_call_matching_types (gimple call_stmt
, tree callee
,
3119 bool args_count_match
)
3123 if ((DECL_RESULT (callee
)
3124 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3125 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3126 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3128 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3129 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3134 /* Reset all state within cgraph.c so that we can rerun the compiler
3135 within the same process. For use by toplev::finalize. */
3138 cgraph_c_finalize (void)
3142 x_cgraph_nodes_queue
= NULL
;
3144 cgraph_fnver_htab
= NULL
;
3145 version_info_node
= NULL
;
3148 #include "gt-cgraph.h"