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"
43 #include "dominance.h"
45 #include "basic-block.h"
48 #include "plugin-api.h"
51 #include "hard-reg-set.h"
57 #include "tree-ssa-alias.h"
58 #include "internal-fn.h"
60 #include "gimple-expr.h"
62 #include "gimple-iterator.h"
65 #include "gimple-ssa.h"
68 #include "value-prof.h"
70 #include "diagnostic-core.h"
72 #include "ipa-utils.h"
73 #include "lto-streamer.h"
74 #include "alloc-pool.h"
76 #include "ipa-inline.h"
78 #include "gimple-pretty-print.h"
84 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
85 #include "tree-pass.h"
87 /* Queue of cgraph nodes scheduled to be lowered. */
88 symtab_node
*x_cgraph_nodes_queue
;
89 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
91 /* Symbol table global context. */
94 /* List of hooks triggered on cgraph_edge events. */
95 struct cgraph_edge_hook_list
{
96 cgraph_edge_hook hook
;
98 struct cgraph_edge_hook_list
*next
;
101 /* List of hooks triggered on cgraph_node events. */
102 struct cgraph_node_hook_list
{
103 cgraph_node_hook hook
;
105 struct cgraph_node_hook_list
*next
;
108 /* List of hooks triggered on events involving two cgraph_edges. */
109 struct cgraph_2edge_hook_list
{
110 cgraph_2edge_hook hook
;
112 struct cgraph_2edge_hook_list
*next
;
115 /* List of hooks triggered on events involving two cgraph_nodes. */
116 struct cgraph_2node_hook_list
{
117 cgraph_2node_hook hook
;
119 struct cgraph_2node_hook_list
*next
;
122 /* Hash descriptor for cgraph_function_version_info. */
124 struct function_version_hasher
: ggc_hasher
<cgraph_function_version_info
*>
126 static hashval_t
hash (cgraph_function_version_info
*);
127 static bool equal (cgraph_function_version_info
*,
128 cgraph_function_version_info
*);
131 /* Map a cgraph_node to cgraph_function_version_info using this htab.
132 The cgraph_function_version_info has a THIS_NODE field that is the
133 corresponding cgraph_node.. */
135 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
137 /* Hash function for cgraph_fnver_htab. */
139 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
141 int uid
= ptr
->this_node
->uid
;
142 return (hashval_t
)(uid
);
145 /* eq function for cgraph_fnver_htab. */
147 function_version_hasher::equal (cgraph_function_version_info
*n1
,
148 cgraph_function_version_info
*n2
)
150 return n1
->this_node
->uid
== n2
->this_node
->uid
;
153 /* Mark as GC root all allocated nodes. */
154 static GTY(()) struct cgraph_function_version_info
*
155 version_info_node
= NULL
;
157 /* Get the cgraph_function_version_info node corresponding to node. */
158 cgraph_function_version_info
*
159 cgraph_node::function_version (void)
161 cgraph_function_version_info key
;
162 key
.this_node
= this;
164 if (cgraph_fnver_htab
== NULL
)
167 return cgraph_fnver_htab
->find (&key
);
170 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
171 corresponding to cgraph_node NODE. */
172 cgraph_function_version_info
*
173 cgraph_node::insert_new_function_version (void)
175 version_info_node
= NULL
;
176 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
177 version_info_node
->this_node
= this;
179 if (cgraph_fnver_htab
== NULL
)
180 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
182 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
184 return version_info_node
;
187 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
188 DECL is a duplicate declaration. */
190 cgraph_node::delete_function_version (tree decl
)
192 cgraph_node
*decl_node
= cgraph_node::get (decl
);
193 cgraph_function_version_info
*decl_v
= NULL
;
195 if (decl_node
== NULL
)
198 decl_v
= decl_node
->function_version ();
203 if (decl_v
->prev
!= NULL
)
204 decl_v
->prev
->next
= decl_v
->next
;
206 if (decl_v
->next
!= NULL
)
207 decl_v
->next
->prev
= decl_v
->prev
;
209 if (cgraph_fnver_htab
!= NULL
)
210 cgraph_fnver_htab
->remove_elt (decl_v
);
212 decl_node
->remove ();
215 /* Record that DECL1 and DECL2 are semantically identical function
218 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
220 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
221 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
222 cgraph_function_version_info
*decl1_v
= NULL
;
223 cgraph_function_version_info
*decl2_v
= NULL
;
224 cgraph_function_version_info
*before
;
225 cgraph_function_version_info
*after
;
227 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
228 decl1_v
= decl1_node
->function_version ();
229 decl2_v
= decl2_node
->function_version ();
231 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
235 decl1_v
= decl1_node
->insert_new_function_version ();
238 decl2_v
= decl2_node
->insert_new_function_version ();
240 /* Chain decl2_v and decl1_v. All semantically identical versions
241 will be chained together. */
246 while (before
->next
!= NULL
)
247 before
= before
->next
;
249 while (after
->prev
!= NULL
)
252 before
->next
= after
;
253 after
->prev
= before
;
256 /* Initialize callgraph dump file. */
259 symbol_table::initialize (void)
262 dump_file
= dump_begin (TDI_cgraph
, NULL
);
265 /* Allocate new callgraph node and insert it into basic data structures. */
268 symbol_table::create_empty (void)
270 cgraph_node
*node
= allocate_cgraph_symbol ();
272 node
->type
= SYMTAB_FUNCTION
;
273 node
->frequency
= NODE_FREQUENCY_NORMAL
;
274 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
280 /* Register HOOK to be called with DATA on each removed edge. */
281 cgraph_edge_hook_list
*
282 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
284 cgraph_edge_hook_list
*entry
;
285 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
287 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
297 /* Remove ENTRY from the list of hooks called on removing edges. */
299 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
301 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
303 while (*ptr
!= entry
)
309 /* Call all edge removal hooks. */
311 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
313 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
316 entry
->hook (e
, entry
->data
);
321 /* Register HOOK to be called with DATA on each removed node. */
322 cgraph_node_hook_list
*
323 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
325 cgraph_node_hook_list
*entry
;
326 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
328 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
338 /* Remove ENTRY from the list of hooks called on removing nodes. */
340 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
342 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
344 while (*ptr
!= entry
)
350 /* Call all node removal hooks. */
352 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
354 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
357 entry
->hook (node
, entry
->data
);
362 /* Call all node removal hooks. */
364 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
366 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
369 entry
->hook (node
, entry
->data
);
375 /* Register HOOK to be called with DATA on each inserted node. */
376 cgraph_node_hook_list
*
377 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
379 cgraph_node_hook_list
*entry
;
380 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
382 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
392 /* Remove ENTRY from the list of hooks called on inserted nodes. */
394 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
396 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
398 while (*ptr
!= entry
)
404 /* Register HOOK to be called with DATA on each duplicated edge. */
405 cgraph_2edge_hook_list
*
406 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
408 cgraph_2edge_hook_list
*entry
;
409 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
411 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
421 /* Remove ENTRY from the list of hooks called on duplicating edges. */
423 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
425 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
427 while (*ptr
!= entry
)
433 /* Call all edge duplication hooks. */
435 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
437 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
440 entry
->hook (cs1
, cs2
, entry
->data
);
445 /* Register HOOK to be called with DATA on each duplicated node. */
446 cgraph_2node_hook_list
*
447 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
449 cgraph_2node_hook_list
*entry
;
450 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
452 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
462 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
464 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
466 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
468 while (*ptr
!= entry
)
474 /* Call all node duplication hooks. */
476 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
479 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
482 entry
->hook (node
, node2
, entry
->data
);
487 /* Return cgraph node assigned to DECL. Create new one when needed. */
490 cgraph_node::create (tree decl
)
492 cgraph_node
*node
= symtab
->create_empty ();
493 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
496 node
->register_symbol ();
498 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
500 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
501 node
->next_nested
= node
->origin
->nested
;
502 node
->origin
->nested
= node
;
507 /* Try to find a call graph node for declaration DECL and if it does not exist
508 or if it corresponds to an inline clone, create a new one. */
511 cgraph_node::get_create (tree decl
)
513 cgraph_node
*first_clone
= cgraph_node::get (decl
);
515 if (first_clone
&& !first_clone
->global
.inlined_to
)
518 cgraph_node
*node
= cgraph_node::create (decl
);
521 first_clone
->clone_of
= node
;
522 node
->clones
= first_clone
;
523 symtab
->symtab_prevail_in_asm_name_hash (node
);
524 node
->decl
->decl_with_vis
.symtab_node
= node
;
526 fprintf (dump_file
, "Introduced new external node "
527 "(%s/%i) and turned into root of the clone tree.\n",
528 xstrdup (node
->name ()), node
->order
);
531 fprintf (dump_file
, "Introduced new external node "
532 "(%s/%i).\n", xstrdup (node
->name ()),
537 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
538 the function body is associated with (not necessarily cgraph_node (DECL). */
541 cgraph_node::create_alias (tree alias
, tree target
)
543 cgraph_node
*alias_node
;
545 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
546 || TREE_CODE (target
) == IDENTIFIER_NODE
);
547 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
548 alias_node
= cgraph_node::get_create (alias
);
549 gcc_assert (!alias_node
->definition
);
550 alias_node
->alias_target
= target
;
551 alias_node
->definition
= true;
552 alias_node
->alias
= true;
553 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
554 alias_node
->weakref
= true;
558 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
560 Same body aliases are output whenever the body of DECL is output,
561 and cgraph_node::get (ALIAS) transparently returns
562 cgraph_node::get (DECL). */
565 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
568 #ifndef ASM_OUTPUT_DEF
569 /* If aliases aren't supported by the assembler, fail. */
572 /* Langhooks can create same body aliases of symbols not defined.
573 Those are useless. Drop them on the floor. */
574 if (symtab
->global_info_ready
)
577 n
= cgraph_node::create_alias (alias
, decl
);
578 n
->cpp_implicit_alias
= true;
579 if (symtab
->cpp_implicit_aliases_done
)
580 n
->resolve_alias (cgraph_node::get (decl
));
584 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
585 aliases DECL with an adjustments made into the first parameter.
586 See comments in thunk_adjust for detail on the parameters. */
589 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
590 HOST_WIDE_INT fixed_offset
,
591 HOST_WIDE_INT virtual_value
,
597 node
= cgraph_node::get (alias
);
601 node
= cgraph_node::create (alias
);
602 gcc_checking_assert (!virtual_offset
603 || wi::eq_p (virtual_offset
, virtual_value
));
604 node
->thunk
.fixed_offset
= fixed_offset
;
605 node
->thunk
.this_adjusting
= this_adjusting
;
606 node
->thunk
.virtual_value
= virtual_value
;
607 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
608 node
->thunk
.alias
= real_alias
;
609 node
->thunk
.thunk_p
= true;
610 node
->definition
= true;
615 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
616 Return NULL if there's no such node. */
619 cgraph_node::get_for_asmname (tree asmname
)
621 /* We do not want to look at inline clones. */
622 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
624 node
= node
->next_sharing_asm_name
)
626 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
627 if (cn
&& !cn
->global
.inlined_to
)
633 /* Returns a hash value for X (which really is a cgraph_edge). */
636 cgraph_edge_hasher::hash (cgraph_edge
*e
)
638 return htab_hash_pointer (e
->call_stmt
);
641 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
644 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple y
)
646 return x
->call_stmt
== y
;
649 /* Add call graph edge E to call site hash of its caller. */
652 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
654 gimple call
= e
->call_stmt
;
655 *e
->caller
->call_site_hash
->find_slot_with_hash (call
,
656 htab_hash_pointer (call
),
660 /* Add call graph edge E to call site hash of its caller. */
663 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
665 /* There are two speculative edges for every statement (one direct,
666 one indirect); always hash the direct one. */
667 if (e
->speculative
&& e
->indirect_unknown_callee
)
669 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
671 htab_hash_pointer (e
->call_stmt
), INSERT
);
674 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
679 gcc_assert (!*slot
|| e
->speculative
);
683 /* Return the callgraph edge representing the GIMPLE_CALL statement
687 cgraph_node::get_edge (gimple call_stmt
)
693 return call_site_hash
->find_with_hash (call_stmt
,
694 htab_hash_pointer (call_stmt
));
696 /* This loop may turn out to be performance problem. In such case adding
697 hashtables into call nodes with very many edges is probably best
698 solution. It is not good idea to add pointer into CALL_EXPR itself
699 because we want to make possible having multiple cgraph nodes representing
700 different clones of the same body before the body is actually cloned. */
701 for (e
= callees
; e
; e
= e
->next_callee
)
703 if (e
->call_stmt
== call_stmt
)
709 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
711 if (e
->call_stmt
== call_stmt
)
718 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
719 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
720 cgraph_add_edge_to_call_site_hash (e2
);
721 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
722 cgraph_add_edge_to_call_site_hash (e2
);
729 /* Change field call_stmt of edge to NEW_STMT.
730 If UPDATE_SPECULATIVE and E is any component of speculative
731 edge, then update all components. */
734 cgraph_edge::set_call_stmt (gimple new_stmt
, bool update_speculative
)
738 /* Speculative edges has three component, update all of them
740 if (update_speculative
&& speculative
)
742 cgraph_edge
*direct
, *indirect
;
745 speculative_call_info (direct
, indirect
, ref
);
746 direct
->set_call_stmt (new_stmt
, false);
747 indirect
->set_call_stmt (new_stmt
, false);
748 ref
->stmt
= new_stmt
;
752 /* Only direct speculative edges go to call_site_hash. */
753 if (caller
->call_site_hash
754 && (!speculative
|| !indirect_unknown_callee
))
756 caller
->call_site_hash
->remove_elt_with_hash
757 (call_stmt
, htab_hash_pointer (call_stmt
));
760 cgraph_edge
*e
= this;
762 call_stmt
= new_stmt
;
763 if (indirect_unknown_callee
764 && (decl
= gimple_call_fndecl (new_stmt
)))
766 /* Constant propagation (and possibly also inlining?) can turn an
767 indirect call into a direct one. */
768 cgraph_node
*new_callee
= cgraph_node::get (decl
);
770 gcc_checking_assert (new_callee
);
771 e
= make_direct (new_callee
);
774 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
775 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
777 if (e
->caller
->call_site_hash
)
778 cgraph_add_edge_to_call_site_hash (e
);
781 /* Allocate a cgraph_edge structure and fill it with data according to the
782 parameters of which only CALLEE can be NULL (when creating an indirect call
786 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
787 gimple call_stmt
, gcov_type count
, int freq
,
788 bool indir_unknown_callee
)
792 /* LTO does not actually have access to the call_stmt since these
793 have not been loaded yet. */
796 /* This is a rather expensive check possibly triggering
797 construction of call stmt hashtable. */
798 #ifdef ENABLE_CHECKING
800 gcc_checking_assert (
801 !(e
= caller
->get_edge (call_stmt
)) || e
->speculative
);
804 gcc_assert (is_gimple_call (call_stmt
));
810 free_edges
= NEXT_FREE_EDGE (edge
);
814 edge
= ggc_alloc
<cgraph_edge
> ();
815 edge
->uid
= edges_max_uid
++;
821 edge
->caller
= caller
;
822 edge
->callee
= callee
;
823 edge
->prev_caller
= NULL
;
824 edge
->next_caller
= NULL
;
825 edge
->prev_callee
= NULL
;
826 edge
->next_callee
= NULL
;
827 edge
->lto_stmt_uid
= 0;
830 gcc_assert (count
>= 0);
831 edge
->frequency
= freq
;
832 gcc_assert (freq
>= 0);
833 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
835 edge
->call_stmt
= call_stmt
;
836 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
837 edge
->can_throw_external
838 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
841 && callee
&& callee
->decl
842 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
844 edge
->call_stmt_cannot_inline_p
= true;
846 edge
->call_stmt_cannot_inline_p
= false;
848 edge
->indirect_info
= NULL
;
849 edge
->indirect_inlining_edge
= 0;
850 edge
->speculative
= false;
851 edge
->indirect_unknown_callee
= indir_unknown_callee
;
852 if (flag_devirtualize
&& call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
853 edge
->in_polymorphic_cdtor
854 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
857 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
858 if (call_stmt
&& caller
->call_site_hash
)
859 cgraph_add_edge_to_call_site_hash (edge
);
864 /* Create edge from a given function to CALLEE in the cgraph. */
867 cgraph_node::create_edge (cgraph_node
*callee
,
868 gimple call_stmt
, gcov_type count
, int freq
)
870 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
873 initialize_inline_failed (edge
);
875 edge
->next_caller
= callee
->callers
;
877 callee
->callers
->prev_caller
= edge
;
878 edge
->next_callee
= callees
;
880 callees
->prev_callee
= edge
;
882 callee
->callers
= edge
;
887 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
889 cgraph_indirect_call_info
*
890 cgraph_allocate_init_indirect_info (void)
892 cgraph_indirect_call_info
*ii
;
894 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
895 ii
->param_index
= -1;
899 /* Create an indirect edge with a yet-undetermined callee where the call
900 statement destination is a formal parameter of the caller with index
904 cgraph_node::create_indirect_edge (gimple call_stmt
, int ecf_flags
,
905 gcov_type count
, int freq
,
906 bool compute_indirect_info
)
908 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
912 initialize_inline_failed (edge
);
914 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
915 edge
->indirect_info
->ecf_flags
= ecf_flags
;
916 edge
->indirect_info
->vptr_changed
= true;
918 /* Record polymorphic call info. */
919 if (compute_indirect_info
921 && (target
= gimple_call_fn (call_stmt
))
922 && virtual_method_call_p (target
))
924 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
926 /* Only record types can have virtual calls. */
927 edge
->indirect_info
->polymorphic
= true;
928 edge
->indirect_info
->param_index
= -1;
929 edge
->indirect_info
->otr_token
930 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
931 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
932 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
933 edge
->indirect_info
->context
= context
;
936 edge
->next_callee
= indirect_calls
;
938 indirect_calls
->prev_callee
= edge
;
939 indirect_calls
= edge
;
944 /* Remove the edge from the list of the callers of the callee. */
947 cgraph_edge::remove_callee (void)
949 gcc_assert (!indirect_unknown_callee
);
951 prev_caller
->next_caller
= next_caller
;
953 next_caller
->prev_caller
= prev_caller
;
955 callee
->callers
= next_caller
;
958 /* Remove the edge from the list of the callees of the caller. */
961 cgraph_edge::remove_caller (void)
964 prev_callee
->next_callee
= next_callee
;
966 next_callee
->prev_callee
= prev_callee
;
969 if (indirect_unknown_callee
)
970 caller
->indirect_calls
= next_callee
;
972 caller
->callees
= next_callee
;
974 if (caller
->call_site_hash
)
975 caller
->call_site_hash
->remove_elt_with_hash (call_stmt
,
976 htab_hash_pointer (call_stmt
));
979 /* Put the edge onto the free list. */
982 symbol_table::free_edge (cgraph_edge
*e
)
986 if (e
->indirect_info
)
987 ggc_free (e
->indirect_info
);
989 /* Clear out the edge so we do not dangle pointers. */
990 memset (e
, 0, sizeof (*e
));
992 NEXT_FREE_EDGE (e
) = free_edges
;
997 /* Remove the edge in the cgraph. */
1000 cgraph_edge::remove (void)
1002 /* Call all edge removal hooks. */
1003 symtab
->call_edge_removal_hooks (this);
1005 if (!indirect_unknown_callee
)
1006 /* Remove from callers list of the callee. */
1009 /* Remove from callees list of the callers. */
1012 /* Put the edge onto the free list. */
1013 symtab
->free_edge (this);
1016 /* Set callee of call graph edge E and add it to the corresponding set of
1020 cgraph_set_edge_callee (cgraph_edge
*e
, cgraph_node
*n
)
1022 e
->prev_caller
= NULL
;
1024 n
->callers
->prev_caller
= e
;
1025 e
->next_caller
= n
->callers
;
1030 /* Turn edge into speculative call calling N2. Update
1031 the profile so the direct call is taken COUNT times
1034 At clone materialization time, the indirect call E will
1037 if (call_dest == N2)
1042 At this time the function just creates the direct call,
1043 the referencd representing the if conditional and attaches
1044 them all to the orginal indirect call statement.
1046 Return direct edge created. */
1049 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1050 int direct_frequency
)
1052 cgraph_node
*n
= caller
;
1053 ipa_ref
*ref
= NULL
;
1058 fprintf (dump_file
, "Indirect call -> speculative call"
1059 " %s/%i => %s/%i\n",
1060 xstrdup (n
->name ()), n
->order
,
1061 xstrdup (n2
->name ()), n2
->order
);
1064 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1065 initialize_inline_failed (e2
);
1066 e2
->speculative
= true;
1067 if (TREE_NOTHROW (n2
->decl
))
1068 e2
->can_throw_external
= false;
1070 e2
->can_throw_external
= can_throw_external
;
1071 e2
->lto_stmt_uid
= lto_stmt_uid
;
1072 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1074 frequency
-= e2
->frequency
;
1075 symtab
->call_edge_duplication_hooks (this, e2
);
1076 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1077 ref
->lto_stmt_uid
= lto_stmt_uid
;
1078 ref
->speculative
= speculative
;
1079 n2
->mark_address_taken ();
1083 /* Speculative call consist of three components:
1084 1) an indirect edge representing the original call
1085 2) an direct edge representing the new call
1086 3) ADDR_EXPR reference representing the speculative check.
1087 All three components are attached to single statement (the indirect
1088 call) and if one of them exists, all of them must exist.
1090 Given speculative call edge, return all three components.
1094 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1095 cgraph_edge
*&indirect
,
1096 ipa_ref
*&reference
)
1101 cgraph_edge
*e
= this;
1103 if (!e
->indirect_unknown_callee
)
1104 for (e2
= e
->caller
->indirect_calls
;
1105 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1106 e2
= e2
->next_callee
)
1111 /* We can take advantage of the call stmt hash. */
1114 e
= e
->caller
->get_edge (e2
->call_stmt
);
1115 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1118 for (e
= e
->caller
->callees
;
1119 e2
->call_stmt
!= e
->call_stmt
1120 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1124 gcc_assert (e
->speculative
&& e2
->speculative
);
1129 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1130 if (ref
->speculative
1131 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1132 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1138 /* Speculative edge always consist of all three components - direct edge,
1139 indirect and reference. */
1141 gcc_assert (e
&& e2
&& ref
);
1144 /* Redirect callee of the edge to N. The function does not update underlying
1148 cgraph_edge::redirect_callee (cgraph_node
*n
)
1150 /* Remove from callers list of the current callee. */
1153 /* Insert to callers list of the new callee. */
1154 cgraph_set_edge_callee (this, n
);
1157 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1158 Remove the speculative call sequence and return edge representing the call.
1159 It is up to caller to redirect the call as appropriate. */
1162 cgraph_edge::resolve_speculation (tree callee_decl
)
1164 cgraph_edge
*edge
= this;
1168 gcc_assert (edge
->speculative
);
1169 edge
->speculative_call_info (e2
, edge
, ref
);
1171 || !ref
->referred
->semantically_equivalent_p
1172 (symtab_node::get (callee_decl
)))
1178 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1179 "turned out to have contradicting known target ",
1180 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1181 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1182 print_generic_expr (dump_file
, callee_decl
, 0);
1183 fprintf (dump_file
, "\n");
1187 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1188 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1189 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1195 cgraph_edge
*tmp
= edge
;
1197 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1200 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1201 in the functions inlined through it. */
1203 edge
->count
+= e2
->count
;
1204 edge
->frequency
+= e2
->frequency
;
1205 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1206 edge
->frequency
= CGRAPH_FREQ_MAX
;
1207 edge
->speculative
= false;
1208 e2
->speculative
= false;
1209 ref
->remove_reference ();
1210 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1213 e2
->callee
->remove_symbol_and_inline_clones ();
1214 if (edge
->caller
->call_site_hash
)
1215 cgraph_update_edge_in_call_site_hash (edge
);
1219 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1220 CALLEE. DELTA is an integer constant that is to be added to the this
1221 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1224 cgraph_edge::make_direct (cgraph_node
*callee
)
1226 cgraph_edge
*edge
= this;
1227 gcc_assert (indirect_unknown_callee
);
1229 /* If we are redirecting speculative call, make it non-speculative. */
1230 if (indirect_unknown_callee
&& speculative
)
1232 edge
= edge
->resolve_speculation (callee
->decl
);
1234 /* On successful speculation just return the pre existing direct edge. */
1235 if (!indirect_unknown_callee
)
1239 indirect_unknown_callee
= 0;
1240 ggc_free (indirect_info
);
1241 indirect_info
= NULL
;
1243 /* Get the edge out of the indirect edge list. */
1245 prev_callee
->next_callee
= next_callee
;
1247 next_callee
->prev_callee
= prev_callee
;
1249 caller
->indirect_calls
= next_callee
;
1251 /* Put it into the normal callee list */
1253 next_callee
= caller
->callees
;
1254 if (caller
->callees
)
1255 caller
->callees
->prev_callee
= edge
;
1256 caller
->callees
= edge
;
1258 /* Insert to callers list of the new callee. */
1259 cgraph_set_edge_callee (edge
, callee
);
1262 call_stmt_cannot_inline_p
1263 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1266 /* We need to re-determine the inlining status of the edge. */
1267 initialize_inline_failed (edge
);
1271 /* If necessary, change the function declaration in the call statement
1272 associated with E so that it corresponds to the edge callee. */
1275 cgraph_edge::redirect_call_stmt_to_callee (void)
1277 cgraph_edge
*e
= this;
1279 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1280 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1282 gimple_stmt_iterator gsi
;
1283 #ifdef ENABLE_CHECKING
1293 e
->speculative_call_info (e
, e2
, ref
);
1294 /* If there already is an direct call (i.e. as a result of inliner's
1295 substitution), forget about speculating. */
1297 e
= e
->resolve_speculation (decl
);
1298 /* If types do not match, speculation was likely wrong.
1299 The direct edge was posisbly redirected to the clone with a different
1300 signature. We did not update the call statement yet, so compare it
1301 with the reference that still points to the proper type. */
1302 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1303 ref
->referred
->decl
,
1307 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1309 xstrdup (e
->caller
->name ()),
1311 xstrdup (e
->callee
->name ()),
1313 e
= e
->resolve_speculation ();
1314 /* We are producing the final function body and will throw away the
1315 callgraph edges really soon. Reset the counts/frequencies to
1316 keep verifier happy in the case of roundoff errors. */
1317 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1318 e
->frequency
= compute_call_stmt_bb_frequency
1319 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1321 /* Expand speculation into GIMPLE code. */
1326 "Expanding speculative call of %s/%i -> %s/%i count:"
1328 xstrdup (e
->caller
->name ()),
1330 xstrdup (e
->callee
->name ()),
1333 gcc_assert (e2
->speculative
);
1334 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1335 new_stmt
= gimple_ic (e
->call_stmt
, dyn_cast
<cgraph_node
*> (ref
->referred
),
1336 e
->count
|| e2
->count
1337 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1338 e
->count
+ e2
->count
)
1339 : e
->frequency
|| e2
->frequency
1340 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1341 e
->frequency
+ e2
->frequency
)
1342 : REG_BR_PROB_BASE
/ 2,
1343 e
->count
, e
->count
+ e2
->count
);
1344 e
->speculative
= false;
1345 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1347 e
->frequency
= compute_call_stmt_bb_frequency
1348 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1349 e2
->frequency
= compute_call_stmt_bb_frequency
1350 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1351 e2
->speculative
= false;
1352 ref
->speculative
= false;
1354 /* Indirect edges are not both in the call site hash.
1356 if (e
->caller
->call_site_hash
)
1357 cgraph_update_edge_in_call_site_hash (e2
);
1359 /* Continue redirecting E to proper target. */
1363 if (e
->indirect_unknown_callee
1364 || decl
== e
->callee
->decl
)
1365 return e
->call_stmt
;
1367 #ifdef ENABLE_CHECKING
1370 node
= cgraph_node::get (decl
);
1371 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1375 if (symtab
->dump_file
)
1377 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1378 xstrdup (e
->caller
->name ()), e
->caller
->order
,
1379 xstrdup (e
->callee
->name ()), e
->callee
->order
);
1380 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1381 if (e
->callee
->clone
.combined_args_to_skip
)
1383 fprintf (symtab
->dump_file
, " combined args to skip: ");
1384 dump_bitmap (symtab
->dump_file
,
1385 e
->callee
->clone
.combined_args_to_skip
);
1389 if (e
->callee
->clone
.combined_args_to_skip
)
1394 = gimple_call_copy_skip_args (e
->call_stmt
,
1395 e
->callee
->clone
.combined_args_to_skip
);
1396 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1397 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1399 if (gimple_vdef (new_stmt
)
1400 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1401 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1403 gsi
= gsi_for_stmt (e
->call_stmt
);
1404 gsi_replace (&gsi
, new_stmt
, false);
1405 /* We need to defer cleaning EH info on the new statement to
1406 fixup-cfg. We may not have dominator information at this point
1407 and thus would end up with unreachable blocks and have no way
1408 to communicate that we need to run CFG cleanup then. */
1409 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1412 remove_stmt_from_eh_lp (e
->call_stmt
);
1413 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1418 new_stmt
= e
->call_stmt
;
1419 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1420 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1423 /* If the call becomes noreturn, remove the lhs. */
1424 if (lhs
&& (gimple_call_flags (new_stmt
) & ECF_NORETURN
))
1426 if (TREE_CODE (lhs
) == SSA_NAME
)
1428 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1429 TREE_TYPE (lhs
), NULL
);
1430 var
= get_or_create_ssa_default_def
1431 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1432 gimple set_stmt
= gimple_build_assign (lhs
, var
);
1433 gsi
= gsi_for_stmt (new_stmt
);
1434 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1435 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1437 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1438 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1441 /* If new callee has no static chain, remove it. */
1442 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1444 gimple_call_set_chain (new_stmt
, NULL
);
1445 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1448 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1450 if (symtab
->dump_file
)
1452 fprintf (symtab
->dump_file
, " updated to:");
1453 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1458 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1459 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1460 of OLD_STMT if it was previously call statement.
1461 If NEW_STMT is NULL, the call has been dropped without any
1465 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1466 gimple old_stmt
, tree old_call
,
1469 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1470 ? gimple_call_fndecl (new_stmt
) : 0;
1472 /* We are seeing indirect calls, then there is nothing to update. */
1473 if (!new_call
&& !old_call
)
1475 /* See if we turned indirect call into direct call or folded call to one builtin
1476 into different builtin. */
1477 if (old_call
!= new_call
)
1479 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1480 cgraph_edge
*ne
= NULL
;
1486 /* See if the edge is already there and has the correct callee. It
1487 might be so because of indirect inlining has already updated
1488 it. We also might've cloned and redirected the edge. */
1489 if (new_call
&& e
->callee
)
1491 cgraph_node
*callee
= e
->callee
;
1494 if (callee
->decl
== new_call
1495 || callee
->former_clone_of
== new_call
)
1497 e
->set_call_stmt (new_stmt
);
1500 callee
= callee
->clone_of
;
1504 /* Otherwise remove edge and create new one; we can't simply redirect
1505 since function has changed, so inline plan and other information
1506 attached to edge is invalid. */
1508 frequency
= e
->frequency
;
1509 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1512 e
->callee
->remove_symbol_and_inline_clones ();
1516 /* We are seeing new direct call; compute profile info based on BB. */
1517 basic_block bb
= gimple_bb (new_stmt
);
1519 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1525 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1526 new_stmt
, count
, frequency
);
1527 gcc_assert (ne
->inline_failed
);
1530 /* We only updated the call stmt; update pointer in cgraph edge.. */
1531 else if (old_stmt
!= new_stmt
)
1532 node
->get_edge (old_stmt
)->set_call_stmt (new_stmt
);
1535 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1536 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1537 of OLD_STMT before it was updated (updating can happen inplace). */
1540 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1542 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1545 gcc_checking_assert (orig
);
1546 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1548 for (node
= orig
->clones
; node
!= orig
;)
1550 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1552 node
= node
->clones
;
1553 else if (node
->next_sibling_clone
)
1554 node
= node
->next_sibling_clone
;
1557 while (node
!= orig
&& !node
->next_sibling_clone
)
1558 node
= node
->clone_of
;
1560 node
= node
->next_sibling_clone
;
1566 /* Remove all callees from the node. */
1569 cgraph_node::remove_callees (void)
1573 /* It is sufficient to remove the edges from the lists of callers of
1574 the callees. The callee list of the node can be zapped with one
1576 for (e
= callees
; e
; e
= f
)
1579 symtab
->call_edge_removal_hooks (e
);
1580 if (!e
->indirect_unknown_callee
)
1581 e
->remove_callee ();
1582 symtab
->free_edge (e
);
1584 for (e
= indirect_calls
; e
; e
= f
)
1587 symtab
->call_edge_removal_hooks (e
);
1588 if (!e
->indirect_unknown_callee
)
1589 e
->remove_callee ();
1590 symtab
->free_edge (e
);
1592 indirect_calls
= NULL
;
1596 call_site_hash
->empty ();
1597 call_site_hash
= NULL
;
1601 /* Remove all callers from the node. */
1604 cgraph_node::remove_callers (void)
1608 /* It is sufficient to remove the edges from the lists of callees of
1609 the callers. The caller list of the node can be zapped with one
1611 for (e
= callers
; e
; e
= f
)
1614 symtab
->call_edge_removal_hooks (e
);
1615 e
->remove_caller ();
1616 symtab
->free_edge (e
);
1621 /* Helper function for cgraph_release_function_body and free_lang_data.
1622 It releases body from function DECL without having to inspect its
1623 possibly non-existent symtab node. */
1626 release_function_body (tree decl
)
1628 if (DECL_STRUCT_FUNCTION (decl
))
1630 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1634 cfun
->curr_properties
&= ~PROP_loops
;
1635 loop_optimizer_finalize ();
1637 if (cfun
->gimple_df
)
1640 delete_tree_cfg_annotations ();
1645 gcc_assert (!dom_info_available_p (CDI_DOMINATORS
));
1646 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS
));
1650 if (cfun
->value_histograms
)
1653 gimple_set_body (decl
, NULL
);
1654 /* Struct function hangs a lot of data that would leak if we didn't
1655 removed all pointers to it. */
1656 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1657 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1659 DECL_SAVED_TREE (decl
) = NULL
;
1662 /* Release memory used to represent body of function.
1663 Use this only for functions that are released before being translated to
1664 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1665 are free'd in final.c via free_after_compilation().
1666 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1669 cgraph_node::release_body (bool keep_arguments
)
1671 ipa_transforms_to_apply
.release ();
1672 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1674 DECL_RESULT (decl
) = NULL
;
1676 if (!keep_arguments
)
1677 DECL_ARGUMENTS (decl
) = NULL
;
1679 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1680 of its associated function function declaration because it's
1681 needed to emit debug info later. */
1682 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1683 DECL_INITIAL (decl
) = error_mark_node
;
1684 release_function_body (decl
);
1686 lto_free_function_in_decl_state_for_node (this);
1689 /* Remove function from symbol table. */
1692 cgraph_node::remove (void)
1695 int uid
= this->uid
;
1697 symtab
->call_cgraph_removal_hooks (this);
1700 ipa_transforms_to_apply
.release ();
1702 /* Incremental inlining access removed nodes stored in the postorder list.
1704 force_output
= false;
1705 forced_by_abi
= false;
1706 for (n
= nested
; n
; n
= n
->next_nested
)
1711 cgraph_node
**node2
= &origin
->nested
;
1713 while (*node2
!= this)
1714 node2
= &(*node2
)->next_nested
;
1715 *node2
= next_nested
;
1718 if (prev_sibling_clone
)
1719 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1721 clone_of
->clones
= next_sibling_clone
;
1722 if (next_sibling_clone
)
1723 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1726 cgraph_node
*n
, *next
;
1730 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1731 n
->clone_of
= clone_of
;
1732 n
->clone_of
= clone_of
;
1733 n
->next_sibling_clone
= clone_of
->clones
;
1734 if (clone_of
->clones
)
1735 clone_of
->clones
->prev_sibling_clone
= n
;
1736 clone_of
->clones
= clones
;
1740 /* We are removing node with clones. This makes clones inconsistent,
1741 but assume they will be removed subsequently and just keep clone
1742 tree intact. This can happen in unreachable function removal since
1743 we remove unreachable functions in random order, not by bottom-up
1744 walk of clone trees. */
1745 for (n
= clones
; n
; n
= next
)
1747 next
= n
->next_sibling_clone
;
1748 n
->next_sibling_clone
= NULL
;
1749 n
->prev_sibling_clone
= NULL
;
1755 /* While all the clones are removed after being proceeded, the function
1756 itself is kept in the cgraph even after it is compiled. Check whether
1757 we are done with this body and reclaim it proactively if this is the case.
1759 if (symtab
->state
!= LTO_STREAMING
)
1761 n
= cgraph_node::get (decl
);
1763 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1764 && (symtab
->global_info_ready
1765 && (TREE_ASM_WRITTEN (n
->decl
)
1766 || DECL_EXTERNAL (n
->decl
)
1768 || (!flag_wpa
&& n
->in_other_partition
)))))
1775 call_site_hash
->empty ();
1776 call_site_hash
= NULL
;
1779 symtab
->release_symbol (this, uid
);
1782 /* Likewise indicate that a node is having address taken. */
1785 cgraph_node::mark_address_taken (void)
1787 /* Indirect inlining can figure out that all uses of the address are
1789 if (global
.inlined_to
)
1791 gcc_assert (cfun
->after_inlining
);
1792 gcc_assert (callers
->indirect_inlining_edge
);
1795 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1796 IPA_REF_ADDR reference exists (and thus it should be set on node
1797 representing alias we take address of) and as a test whether address
1798 of the object was taken (and thus it should be set on node alias is
1799 referring to). We should remove the first use and the remove the
1802 cgraph_node
*node
= ultimate_alias_target ();
1803 node
->address_taken
= 1;
1806 /* Return local info for the compiled function. */
1809 cgraph_node::local_info (tree decl
)
1811 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1812 cgraph_node
*node
= get (decl
);
1815 return &node
->local
;
1818 /* Return global info for the compiled function. */
1820 cgraph_global_info
*
1821 cgraph_node::global_info (tree decl
)
1823 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1824 && symtab
->global_info_ready
);
1825 cgraph_node
*node
= get (decl
);
1828 return &node
->global
;
1831 /* Return local info for the compiled function. */
1834 cgraph_node::rtl_info (tree decl
)
1836 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1837 cgraph_node
*node
= get (decl
);
1839 || (decl
!= current_function_decl
1840 && !TREE_ASM_WRITTEN (node
->decl
)))
1845 /* Return a string describing the failure REASON. */
1848 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1851 #define DEFCIFCODE(code, type, string) string,
1853 static const char *cif_string_table
[CIF_N_REASONS
] = {
1854 #include "cif-code.def"
1857 /* Signedness of an enum type is implementation defined, so cast it
1858 to unsigned before testing. */
1859 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1860 return cif_string_table
[reason
];
1863 /* Return a type describing the failure REASON. */
1865 cgraph_inline_failed_type_t
1866 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1869 #define DEFCIFCODE(code, type, string) type,
1871 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1872 #include "cif-code.def"
1875 /* Signedness of an enum type is implementation defined, so cast it
1876 to unsigned before testing. */
1877 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1878 return cif_type_table
[reason
];
1881 /* Names used to print out the availability enum. */
1882 const char * const cgraph_availability_names
[] =
1883 {"unset", "not_available", "overwritable", "available", "local"};
1885 /* Output flags of edge E. */
1888 dump_edge_flags (FILE *f
, struct cgraph_edge
*edge
)
1890 if (edge
->speculative
)
1891 fprintf (f
, "(speculative) ");
1892 if (!edge
->inline_failed
)
1893 fprintf (f
, "(inlined) ");
1894 if (edge
->indirect_inlining_edge
)
1895 fprintf (f
, "(indirect_inlining) ");
1897 fprintf (f
, "(%"PRId64
"x) ",
1898 (int64_t)edge
->count
);
1899 if (edge
->frequency
)
1900 fprintf (f
, "(%.2f per call) ",
1901 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1902 if (edge
->can_throw_external
)
1903 fprintf (f
, "(can throw external) ");
1906 /* Dump call graph node to file F. */
1909 cgraph_node::dump (FILE *f
)
1915 if (global
.inlined_to
)
1916 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1919 xstrdup (global
.inlined_to
->name ()),
1920 global
.inlined_to
->order
);
1922 fprintf (f
, " Clone of %s/%i\n",
1923 clone_of
->asm_name (),
1925 if (symtab
->function_flags_ready
)
1926 fprintf (f
, " Availability: %s\n",
1927 cgraph_availability_names
[get_availability ()]);
1930 fprintf (f
, " Profile id: %i\n",
1932 fprintf (f
, " First run: %i\n", tp_first_run
);
1933 fprintf (f
, " Function flags:");
1935 fprintf (f
, " executed %"PRId64
"x",
1938 fprintf (f
, " nested in: %s", origin
->asm_name ());
1939 if (gimple_has_body_p (decl
))
1940 fprintf (f
, " body");
1942 fprintf (f
, " process");
1944 fprintf (f
, " local");
1945 if (local
.redefined_extern_inline
)
1946 fprintf (f
, " redefined_extern_inline");
1947 if (only_called_at_startup
)
1948 fprintf (f
, " only_called_at_startup");
1949 if (only_called_at_exit
)
1950 fprintf (f
, " only_called_at_exit");
1952 fprintf (f
, " tm_clone");
1954 fprintf (f
, " icf_merged");
1955 if (DECL_STATIC_CONSTRUCTOR (decl
))
1956 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
1957 if (DECL_STATIC_DESTRUCTOR (decl
))
1958 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
1964 fprintf (f
, " Thunk");
1966 fprintf (f
, " of %s (asm: %s)",
1967 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
1968 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
1969 fprintf (f
, " fixed offset %i virtual value %i has "
1970 "virtual offset %i)\n",
1971 (int)thunk
.fixed_offset
,
1972 (int)thunk
.virtual_value
,
1973 (int)thunk
.virtual_offset_p
);
1975 if (alias
&& thunk
.alias
1976 && DECL_P (thunk
.alias
))
1978 fprintf (f
, " Alias of %s",
1979 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
1980 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
1981 fprintf (f
, " (asm: %s)",
1982 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
1986 fprintf (f
, " Called by: ");
1988 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
1990 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
1991 edge
->caller
->order
);
1992 dump_edge_flags (f
, edge
);
1995 fprintf (f
, "\n Calls: ");
1996 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
1998 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
1999 edge
->callee
->order
);
2000 dump_edge_flags (f
, edge
);
2004 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2006 if (edge
->indirect_info
->polymorphic
)
2008 fprintf (f
, " Polymorphic indirect call of type ");
2009 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2010 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2013 fprintf (f
, " Indirect call");
2014 dump_edge_flags (f
, edge
);
2015 if (edge
->indirect_info
->param_index
!= -1)
2017 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2018 if (edge
->indirect_info
->agg_contents
)
2019 fprintf (f
, " loaded from %s %s at offset %i",
2020 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2021 edge
->indirect_info
->by_ref
? "passed by reference":"",
2022 (int)edge
->indirect_info
->offset
);
2023 if (edge
->indirect_info
->vptr_changed
)
2024 fprintf (f
, " (vptr maybe changed)");
2027 if (edge
->indirect_info
->polymorphic
)
2028 edge
->indirect_info
->context
.dump (f
);
2032 /* Dump call graph node NODE to stderr. */
2035 cgraph_node::debug (void)
2040 /* Dump the callgraph to file F. */
2043 cgraph_node::dump_cgraph (FILE *f
)
2047 fprintf (f
, "callgraph:\n\n");
2048 FOR_EACH_FUNCTION (node
)
2052 /* Return true when the DECL can possibly be inlined. */
2055 cgraph_function_possibly_inlined_p (tree decl
)
2057 if (!symtab
->global_info_ready
)
2058 return !DECL_UNINLINABLE (decl
);
2059 return DECL_POSSIBLY_INLINED (decl
);
2062 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2064 cgraph_node::unnest (void)
2066 cgraph_node
**node2
= &origin
->nested
;
2067 gcc_assert (origin
);
2069 while (*node2
!= this)
2070 node2
= &(*node2
)->next_nested
;
2071 *node2
= next_nested
;
2075 /* Return function availability. See cgraph.h for description of individual
2078 cgraph_node::get_availability (void)
2080 enum availability avail
;
2082 avail
= AVAIL_NOT_AVAILABLE
;
2083 else if (local
.local
)
2084 avail
= AVAIL_LOCAL
;
2085 else if (alias
&& weakref
)
2086 ultimate_alias_target (&avail
);
2087 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2088 avail
= AVAIL_INTERPOSABLE
;
2089 else if (!externally_visible
)
2090 avail
= AVAIL_AVAILABLE
;
2091 /* Inline functions are safe to be analyzed even if their symbol can
2092 be overwritten at runtime. It is not meaningful to enforce any sane
2093 behaviour on replacing inline function by different body. */
2094 else if (DECL_DECLARED_INLINE_P (decl
))
2095 avail
= AVAIL_AVAILABLE
;
2097 /* If the function can be overwritten, return OVERWRITABLE. Take
2098 care at least of two notable extensions - the COMDAT functions
2099 used to share template instantiations in C++ (this is symmetric
2100 to code cp_cannot_inline_tree_fn and probably shall be shared and
2101 the inlinability hooks completely eliminated).
2103 ??? Does the C++ one definition rule allow us to always return
2104 AVAIL_AVAILABLE here? That would be good reason to preserve this
2107 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2108 avail
= AVAIL_INTERPOSABLE
;
2109 else avail
= AVAIL_AVAILABLE
;
2114 /* Worker for cgraph_node_can_be_local_p. */
2116 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2118 return !(!node
->force_output
2119 && ((DECL_COMDAT (node
->decl
)
2120 && !node
->forced_by_abi
2121 && !node
->used_from_object_file_p ()
2122 && !node
->same_comdat_group
)
2123 || !node
->externally_visible
));
2126 /* Return true if cgraph_node can be made local for API change.
2127 Extern inline functions and C++ COMDAT functions can be made local
2128 at the expense of possible code size growth if function is used in multiple
2129 compilation units. */
2131 cgraph_node::can_be_local_p (void)
2133 return (!address_taken
2134 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2138 /* Call calback on cgraph_node, thunks and aliases associated to cgraph_node.
2139 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2143 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2144 (cgraph_node
*, void *),
2146 bool include_overwritable
)
2151 if (callback (this, data
))
2153 for (e
= callers
; e
; e
= e
->next_caller
)
2154 if (e
->caller
->thunk
.thunk_p
2155 && (include_overwritable
2156 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2157 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2158 include_overwritable
))
2161 FOR_EACH_ALIAS (this, ref
)
2163 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2164 if (include_overwritable
2165 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2166 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2167 include_overwritable
))
2173 /* Call calback on function and aliases associated to the function.
2174 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2178 cgraph_node::call_for_symbol_and_aliases (bool (*callback
) (cgraph_node
*,
2181 bool include_overwritable
)
2185 if (callback (this, data
))
2188 FOR_EACH_ALIAS (this, ref
)
2190 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2191 if (include_overwritable
2192 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2193 if (alias
->call_for_symbol_and_aliases (callback
, data
,
2194 include_overwritable
))
2200 /* Worker to bring NODE local. */
2203 cgraph_node::make_local (cgraph_node
*node
, void *)
2205 gcc_checking_assert (node
->can_be_local_p ());
2206 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2208 node
->make_decl_local ();
2209 node
->set_section (NULL
);
2210 node
->set_comdat_group (NULL
);
2211 node
->externally_visible
= false;
2212 node
->forced_by_abi
= false;
2213 node
->local
.local
= true;
2214 node
->set_section (NULL
);
2215 node
->unique_name
= (node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2216 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2217 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2218 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2223 /* Bring cgraph node local. */
2226 cgraph_node::make_local (void)
2228 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2231 /* Worker to set nothrow flag. */
2234 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2238 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2241 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2242 e
->can_throw_external
= false;
2246 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2247 if any to NOTHROW. */
2250 cgraph_node::set_nothrow_flag (bool nothrow
)
2252 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2253 (void *)(size_t)nothrow
, false);
2256 /* Worker to set const flag. */
2259 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2261 /* Static constructors and destructors without a side effect can be
2263 if (data
&& !((size_t)data
& 2))
2265 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2266 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2267 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2268 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2270 TREE_READONLY (node
->decl
) = data
!= NULL
;
2271 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2275 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2276 if any to READONLY. */
2279 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2281 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2282 (void *)(size_t)(readonly
+ (int)looping
* 2),
2286 /* Worker to set pure flag. */
2289 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2291 /* Static constructors and destructors without a side effect can be
2293 if (data
&& !((size_t)data
& 2))
2295 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2296 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2297 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2298 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2300 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2301 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2305 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2309 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2311 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2312 (void *)(size_t)(pure
+ (int)looping
* 2),
2316 /* Return true when cgraph_node can not return or throw and thus
2317 it is safe to ignore its side effects for IPA analysis. */
2320 cgraph_node::cannot_return_p (void)
2322 int flags
= flags_from_decl_or_type (decl
);
2323 if (!flag_exceptions
)
2324 return (flags
& ECF_NORETURN
) != 0;
2326 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2327 == (ECF_NORETURN
| ECF_NOTHROW
));
2330 /* Return true when call of edge can not lead to return from caller
2331 and thus it is safe to ignore its side effects for IPA analysis
2332 when computing side effects of the caller.
2333 FIXME: We could actually mark all edges that have no reaching
2334 patch to the exit block or throw to get better results. */
2336 cgraph_edge::cannot_lead_to_return_p (void)
2338 if (caller
->cannot_return_p ())
2340 if (indirect_unknown_callee
)
2342 int flags
= indirect_info
->ecf_flags
;
2343 if (!flag_exceptions
)
2344 return (flags
& ECF_NORETURN
) != 0;
2346 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2347 == (ECF_NORETURN
| ECF_NOTHROW
));
2350 return callee
->cannot_return_p ();
2353 /* Return true if the call can be hot. */
2356 cgraph_edge::maybe_hot_p (void)
2358 if (profile_info
&& flag_branch_probabilities
2359 && !maybe_hot_count_p (NULL
, count
))
2361 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2363 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2365 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2367 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2369 if (optimize_size
) return false;
2370 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2372 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2373 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2375 if (flag_guess_branch_prob
)
2377 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2378 || frequency
<= (CGRAPH_FREQ_BASE
2379 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2385 /* Return true when function can be removed from callgraph
2386 if all direct calls are eliminated. */
2389 cgraph_node::can_remove_if_no_direct_calls_and_refs_p (void)
2391 gcc_assert (!global
.inlined_to
);
2392 /* Extern inlines can always go, we will use the external definition. */
2393 if (DECL_EXTERNAL (decl
))
2395 /* When function is needed, we can not remove it. */
2396 if (force_output
|| used_from_other_partition
)
2398 if (DECL_STATIC_CONSTRUCTOR (decl
)
2399 || DECL_STATIC_DESTRUCTOR (decl
))
2401 /* Only COMDAT functions can be removed if externally visible. */
2402 if (externally_visible
2403 && (!DECL_COMDAT (decl
)
2405 || used_from_object_file_p ()))
2410 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2413 nonremovable_p (cgraph_node
*node
, void *)
2415 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2418 /* Return true when function cgraph_node and its aliases can be removed from
2419 callgraph if all direct calls are eliminated. */
2422 cgraph_node::can_remove_if_no_direct_calls_p (void)
2424 /* Extern inlines can always go, we will use the external definition. */
2425 if (DECL_EXTERNAL (decl
))
2429 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2432 /* Return true when function cgraph_node can be expected to be removed
2433 from program when direct calls in this compilation unit are removed.
2435 As a special case COMDAT functions are
2436 cgraph_can_remove_if_no_direct_calls_p while the are not
2437 cgraph_only_called_directly_p (it is possible they are called from other
2440 This function behaves as cgraph_only_called_directly_p because eliminating
2441 all uses of COMDAT function does not make it necessarily disappear from
2442 the program unless we are compiling whole program or we do LTO. In this
2443 case we know we win since dynamic linking will not really discard the
2444 linkonce section. */
2447 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p (void)
2449 gcc_assert (!global
.inlined_to
);
2451 if (call_for_symbol_and_aliases (used_from_object_file_p_worker
,
2454 if (!in_lto_p
&& !flag_whole_program
)
2455 return only_called_directly_p ();
2458 if (DECL_EXTERNAL (decl
))
2460 return can_remove_if_no_direct_calls_p ();
2465 /* Worker for cgraph_only_called_directly_p. */
2468 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2470 return !node
->only_called_directly_or_aliased_p ();
2473 /* Return true when function cgraph_node and all its aliases are only called
2475 i.e. it is not externally visible, address was not taken and
2476 it is not used in any other non-standard way. */
2479 cgraph_node::only_called_directly_p (void)
2481 gcc_assert (ultimate_alias_target () == this);
2482 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2487 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2490 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2492 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2494 enum availability avail
;
2495 node
->ultimate_alias_target (&avail
);
2497 if (avail
> AVAIL_INTERPOSABLE
)
2498 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2499 if (!cs
->indirect_inlining_edge
)
2500 redirect_callers
->safe_push (cs
);
2504 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2505 cgraph_node (i.e. are not overwritable). */
2508 cgraph_node::collect_callers (void)
2510 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2511 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2512 &redirect_callers
, false);
2513 return redirect_callers
;
2516 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2519 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2521 bool skipped_thunk
= false;
2522 node
= node
->ultimate_alias_target ();
2523 node2
= node2
->ultimate_alias_target ();
2525 /* There are no virtual clones of thunks so check former_clone_of or if we
2526 might have skipped thunks because this adjustments are no longer
2528 while (node
->thunk
.thunk_p
)
2530 if (node2
->former_clone_of
== node
->decl
)
2532 if (!node
->thunk
.this_adjusting
)
2534 node
= node
->callees
->callee
->ultimate_alias_target ();
2535 skipped_thunk
= true;
2540 if (!node2
->clone
.args_to_skip
2541 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2543 if (node2
->former_clone_of
== node
->decl
)
2545 else if (!node2
->clone_of
)
2549 while (node
!= node2
&& node2
)
2550 node2
= node2
->clone_of
;
2551 return node2
!= NULL
;
2554 /* Verify edge E count and frequency. */
2557 verify_edge_count_and_frequency (cgraph_edge
*e
)
2559 bool error_found
= false;
2562 error ("caller edge count is negative");
2565 if (e
->frequency
< 0)
2567 error ("caller edge frequency is negative");
2570 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2572 error ("caller edge frequency is too large");
2575 if (gimple_has_body_p (e
->caller
->decl
)
2576 && !e
->caller
->global
.inlined_to
2578 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2579 Remove this once edges are actually removed from the function at that time. */
2581 || (inline_edge_summary_vec
.exists ()
2582 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2583 || !inline_edge_summary (e
)->predicate
)))
2585 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2586 gimple_bb (e
->call_stmt
))))
2588 error ("caller edge frequency %i does not match BB frequency %i",
2590 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2591 gimple_bb (e
->call_stmt
)));
2597 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2599 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple stmt
)
2601 bool fndecl_was_null
= false;
2602 /* debug_gimple_stmt needs correct cfun */
2603 if (cfun
!= this_cfun
)
2604 set_cfun (this_cfun
);
2605 /* ...and an actual current_function_decl */
2606 if (!current_function_decl
)
2608 current_function_decl
= this_cfun
->decl
;
2609 fndecl_was_null
= true;
2611 debug_gimple_stmt (stmt
);
2612 if (fndecl_was_null
)
2613 current_function_decl
= NULL
;
2616 /* Verify that call graph edge E corresponds to DECL from the associated
2617 statement. Return true if the verification should fail. */
2620 verify_edge_corresponds_to_fndecl (cgraph_edge
*e
, tree decl
)
2624 if (!decl
|| e
->callee
->global
.inlined_to
)
2626 if (symtab
->state
== LTO_STREAMING
)
2628 node
= cgraph_node::get (decl
);
2630 /* We do not know if a node from a different partition is an alias or what it
2631 aliases and therefore cannot do the former_clone_of check reliably. When
2632 body_removed is set, we have lost all information about what was alias or
2633 thunk of and also cannot proceed. */
2635 || node
->body_removed
2636 || node
->in_other_partition
2638 || e
->callee
->in_other_partition
)
2641 node
= node
->ultimate_alias_target ();
2643 /* Optimizers can redirect unreachable calls or calls triggering undefined
2644 behaviour to builtin_unreachable. */
2645 if (DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
2646 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
2649 if (e
->callee
->former_clone_of
!= node
->decl
2650 && (node
!= e
->callee
->ultimate_alias_target ())
2651 && !clone_of_p (node
, e
->callee
))
2657 /* Verify cgraph nodes of given cgraph node. */
2659 cgraph_node::verify_node (void)
2662 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2663 basic_block this_block
;
2664 gimple_stmt_iterator gsi
;
2665 bool error_found
= false;
2670 timevar_push (TV_CGRAPH_VERIFY
);
2671 error_found
|= verify_base ();
2672 for (e
= callees
; e
; e
= e
->next_callee
)
2675 error ("aux field set for edge %s->%s",
2676 identifier_to_locale (e
->caller
->name ()),
2677 identifier_to_locale (e
->callee
->name ()));
2682 error ("execution count is negative");
2685 if (global
.inlined_to
&& same_comdat_group
)
2687 error ("inline clone in same comdat group list");
2690 if (!definition
&& !in_other_partition
&& local
.local
)
2692 error ("local symbols must be defined");
2695 if (global
.inlined_to
&& externally_visible
)
2697 error ("externally visible inline clone");
2700 if (global
.inlined_to
&& address_taken
)
2702 error ("inline clone with address taken");
2705 if (global
.inlined_to
&& force_output
)
2707 error ("inline clone is forced to output");
2710 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2714 error ("aux field set for indirect edge from %s",
2715 identifier_to_locale (e
->caller
->name ()));
2718 if (!e
->indirect_unknown_callee
2719 || !e
->indirect_info
)
2721 error ("An indirect edge from %s is not marked as indirect or has "
2722 "associated indirect_info, the corresponding statement is: ",
2723 identifier_to_locale (e
->caller
->name ()));
2724 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2728 bool check_comdat
= comdat_local_p ();
2729 for (e
= callers
; e
; e
= e
->next_caller
)
2731 if (verify_edge_count_and_frequency (e
))
2734 && !in_same_comdat_group_p (e
->caller
))
2736 error ("comdat-local function called by %s outside its comdat",
2737 identifier_to_locale (e
->caller
->name ()));
2740 if (!e
->inline_failed
)
2742 if (global
.inlined_to
2743 != (e
->caller
->global
.inlined_to
2744 ? e
->caller
->global
.inlined_to
: e
->caller
))
2746 error ("inlined_to pointer is wrong");
2749 if (callers
->next_caller
)
2751 error ("multiple inline callers");
2756 if (global
.inlined_to
)
2758 error ("inlined_to pointer set for noninline callers");
2762 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2763 if (verify_edge_count_and_frequency (e
))
2765 if (!callers
&& global
.inlined_to
)
2767 error ("inlined_to pointer is set but no predecessors found");
2770 if (global
.inlined_to
== this)
2772 error ("inlined_to pointer refers to itself");
2779 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2784 error ("cgraph_node has wrong clone_of");
2791 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2792 if (n
->clone_of
!= this)
2796 error ("cgraph_node has wrong clone list");
2800 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2802 error ("cgraph_node is in clone list but it is not clone");
2805 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2807 error ("cgraph_node has wrong prev_clone pointer");
2810 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2812 error ("double linked list of clones corrupted");
2816 if (analyzed
&& alias
)
2818 bool ref_found
= false;
2820 ipa_ref
*ref
= NULL
;
2824 error ("Alias has call edges");
2827 for (i
= 0; iterate_reference (i
, ref
); i
++)
2828 if (ref
->use
!= IPA_REF_ALIAS
)
2830 error ("Alias has non-alias reference");
2835 error ("Alias has more than one alias reference");
2842 error ("Analyzed alias has no reference");
2846 if (analyzed
&& thunk
.thunk_p
)
2850 error ("No edge out of thunk node");
2853 else if (callees
->next_callee
)
2855 error ("More than one edge out of thunk node");
2858 if (gimple_has_body_p (decl
))
2860 error ("Thunk is not supposed to have body");
2864 else if (analyzed
&& gimple_has_body_p (decl
)
2865 && !TREE_ASM_WRITTEN (decl
)
2866 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
2871 hash_set
<gimple
> stmts
;
2873 ipa_ref
*ref
= NULL
;
2875 /* Reach the trees by walking over the CFG, and note the
2876 enclosing basic-blocks in the call edges. */
2877 FOR_EACH_BB_FN (this_block
, this_cfun
)
2879 for (gsi
= gsi_start_phis (this_block
);
2880 !gsi_end_p (gsi
); gsi_next (&gsi
))
2881 stmts
.add (gsi_stmt (gsi
));
2882 for (gsi
= gsi_start_bb (this_block
);
2886 gimple stmt
= gsi_stmt (gsi
);
2888 if (is_gimple_call (stmt
))
2890 cgraph_edge
*e
= get_edge (stmt
);
2891 tree decl
= gimple_call_fndecl (stmt
);
2896 error ("shared call_stmt:");
2897 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2900 if (!e
->indirect_unknown_callee
)
2902 if (verify_edge_corresponds_to_fndecl (e
, decl
))
2904 error ("edge points to wrong declaration:");
2905 debug_tree (e
->callee
->decl
);
2906 fprintf (stderr
," Instead of:");
2913 error ("an indirect edge with unknown callee "
2914 "corresponding to a call_stmt with "
2915 "a known declaration:");
2917 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2923 error ("missing callgraph edge for call stmt:");
2924 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2930 for (i
= 0; iterate_reference (i
, ref
); i
++)
2931 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
2933 error ("reference to dead statement");
2934 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
2939 /* No CFG available?! */
2942 for (e
= callees
; e
; e
= e
->next_callee
)
2946 error ("edge %s->%s has no corresponding call_stmt",
2947 identifier_to_locale (e
->caller
->name ()),
2948 identifier_to_locale (e
->callee
->name ()));
2949 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2954 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2956 if (!e
->aux
&& !e
->speculative
)
2958 error ("an indirect edge from %s has no corresponding call_stmt",
2959 identifier_to_locale (e
->caller
->name ()));
2960 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2969 internal_error ("verify_cgraph_node failed");
2971 timevar_pop (TV_CGRAPH_VERIFY
);
2974 /* Verify whole cgraph structure. */
2976 cgraph_node::verify_cgraph_nodes (void)
2983 FOR_EACH_FUNCTION (node
)
2987 /* Walk the alias chain to return the function cgraph_node is alias of.
2988 Walk through thunk, too.
2989 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
2992 cgraph_node::function_symbol (enum availability
*availability
)
2994 cgraph_node
*node
= this;
2998 node
= node
->ultimate_alias_target (availability
);
2999 if (node
->thunk
.thunk_p
)
3001 node
= node
->callees
->callee
;
3004 enum availability a
;
3005 a
= node
->get_availability ();
3006 if (a
< *availability
)
3009 node
= node
->ultimate_alias_target (availability
);
3011 } while (node
&& node
->thunk
.thunk_p
);
3015 /* When doing LTO, read cgraph_node's body from disk if it is not already
3019 cgraph_node::get_body (void)
3021 lto_file_decl_data
*file_data
;
3022 const char *data
, *name
;
3024 tree decl
= this->decl
;
3026 if (DECL_RESULT (decl
))
3029 gcc_assert (in_lto_p
);
3031 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3033 file_data
= lto_file_data
;
3034 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3036 /* We may have renamed the declaration, e.g., a static function. */
3037 name
= lto_get_decl_name_mapping (file_data
, name
);
3039 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3042 fatal_error ("%s: section %s is missing",
3043 file_data
->file_name
,
3046 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3048 lto_input_function_body (file_data
, this, data
);
3049 lto_stats
.num_function_bodies
++;
3050 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3052 lto_free_function_in_decl_state_for_node (this);
3054 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3059 /* Return the DECL_STRUCT_FUNCTION of the function. */
3062 cgraph_node::get_fun (void)
3064 cgraph_node
*node
= this;
3065 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3067 while (!fun
&& node
->clone_of
)
3069 node
= node
->clone_of
;
3070 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3076 /* Verify if the type of the argument matches that of the function
3077 declaration. If we cannot verify this or there is a mismatch,
3081 gimple_check_call_args (gimple stmt
, tree fndecl
, bool args_count_match
)
3084 unsigned int i
, nargs
;
3086 /* Calls to internal functions always match their signature. */
3087 if (gimple_call_internal_p (stmt
))
3090 nargs
= gimple_call_num_args (stmt
);
3092 /* Get argument types for verification. */
3094 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3096 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3098 /* Verify if the type of the argument matches that of the function
3099 declaration. If we cannot verify this or there is a mismatch,
3101 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3103 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3105 i
++, p
= DECL_CHAIN (p
))
3108 /* We cannot distinguish a varargs function from the case
3109 of excess parameters, still deferring the inlining decision
3110 to the callee is possible. */
3113 arg
= gimple_call_arg (stmt
, i
);
3114 if (p
== error_mark_node
3115 || DECL_ARG_TYPE (p
) == error_mark_node
3116 || arg
== error_mark_node
3117 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3118 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3121 if (args_count_match
&& p
)
3126 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3129 /* If this is a varargs function defer inlining decision
3133 arg
= gimple_call_arg (stmt
, i
);
3134 if (TREE_VALUE (p
) == error_mark_node
3135 || arg
== error_mark_node
3136 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3137 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3138 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3150 /* Verify if the type of the argument and lhs of CALL_STMT matches
3151 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3152 true, the arg count needs to be the same.
3153 If we cannot verify this or there is a mismatch, return false. */
3156 gimple_check_call_matching_types (gimple call_stmt
, tree callee
,
3157 bool args_count_match
)
3161 if ((DECL_RESULT (callee
)
3162 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3163 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3164 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3166 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3167 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3172 /* Reset all state within cgraph.c so that we can rerun the compiler
3173 within the same process. For use by toplev::finalize. */
3176 cgraph_c_finalize (void)
3180 x_cgraph_nodes_queue
= NULL
;
3182 cgraph_fnver_htab
= NULL
;
3183 version_info_node
= NULL
;
3186 #include "gt-cgraph.h"