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"
68 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
69 #include "tree-pass.h"
71 /* Queue of cgraph nodes scheduled to be lowered. */
72 symtab_node
*x_cgraph_nodes_queue
;
73 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
75 /* Symbol table global context. */
78 /* List of hooks triggered on cgraph_edge events. */
79 struct cgraph_edge_hook_list
{
80 cgraph_edge_hook hook
;
82 struct cgraph_edge_hook_list
*next
;
85 /* List of hooks triggered on cgraph_node events. */
86 struct cgraph_node_hook_list
{
87 cgraph_node_hook hook
;
89 struct cgraph_node_hook_list
*next
;
92 /* List of hooks triggered on events involving two cgraph_edges. */
93 struct cgraph_2edge_hook_list
{
94 cgraph_2edge_hook hook
;
96 struct cgraph_2edge_hook_list
*next
;
99 /* List of hooks triggered on events involving two cgraph_nodes. */
100 struct cgraph_2node_hook_list
{
101 cgraph_2node_hook hook
;
103 struct cgraph_2node_hook_list
*next
;
106 /* Map a cgraph_node to cgraph_function_version_info using this htab.
107 The cgraph_function_version_info has a THIS_NODE field that is the
108 corresponding cgraph_node.. */
110 static GTY((param_is (cgraph_function_version_info
))) htab_t
111 cgraph_fnver_htab
= NULL
;
113 /* Hash function for cgraph_fnver_htab. */
115 cgraph_fnver_htab_hash (const void *ptr
)
117 int uid
= ((const cgraph_function_version_info
*)ptr
)->this_node
->uid
;
118 return (hashval_t
)(uid
);
121 /* eq function for cgraph_fnver_htab. */
123 cgraph_fnver_htab_eq (const void *p1
, const void *p2
)
125 const cgraph_function_version_info
*n1
126 = (const cgraph_function_version_info
*)p1
;
127 const cgraph_function_version_info
*n2
128 = (const cgraph_function_version_info
*)p2
;
130 return n1
->this_node
->uid
== n2
->this_node
->uid
;
133 /* Mark as GC root all allocated nodes. */
134 static GTY(()) struct cgraph_function_version_info
*
135 version_info_node
= NULL
;
137 /* Get the cgraph_function_version_info node corresponding to node. */
138 cgraph_function_version_info
*
139 cgraph_node::function_version (void)
141 cgraph_function_version_info
*ret
;
142 cgraph_function_version_info key
;
143 key
.this_node
= this;
145 if (cgraph_fnver_htab
== NULL
)
148 ret
= (cgraph_function_version_info
*)
149 htab_find (cgraph_fnver_htab
, &key
);
154 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
155 corresponding to cgraph_node NODE. */
156 cgraph_function_version_info
*
157 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
= htab_create_ggc (2, cgraph_fnver_htab_hash
,
167 cgraph_fnver_htab_eq
, NULL
);
169 slot
= htab_find_slot (cgraph_fnver_htab
, version_info_node
, INSERT
);
170 gcc_assert (slot
!= NULL
);
171 *slot
= version_info_node
;
172 return version_info_node
;
175 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
176 DECL is a duplicate declaration. */
178 cgraph_node::delete_function_version (tree decl
)
180 cgraph_node
*decl_node
= cgraph_node::get (decl
);
181 cgraph_function_version_info
*decl_v
= NULL
;
183 if (decl_node
== NULL
)
186 decl_v
= decl_node
->function_version ();
191 if (decl_v
->prev
!= NULL
)
192 decl_v
->prev
->next
= decl_v
->next
;
194 if (decl_v
->next
!= NULL
)
195 decl_v
->next
->prev
= decl_v
->prev
;
197 if (cgraph_fnver_htab
!= NULL
)
198 htab_remove_elt (cgraph_fnver_htab
, decl_v
);
200 decl_node
->remove ();
203 /* Record that DECL1 and DECL2 are semantically identical function
206 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
208 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
209 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
210 cgraph_function_version_info
*decl1_v
= NULL
;
211 cgraph_function_version_info
*decl2_v
= NULL
;
212 cgraph_function_version_info
*before
;
213 cgraph_function_version_info
*after
;
215 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
216 decl1_v
= decl1_node
->function_version ();
217 decl2_v
= decl2_node
->function_version ();
219 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
223 decl1_v
= decl1_node
->insert_new_function_version ();
226 decl2_v
= decl2_node
->insert_new_function_version ();
228 /* Chain decl2_v and decl1_v. All semantically identical versions
229 will be chained together. */
234 while (before
->next
!= NULL
)
235 before
= before
->next
;
237 while (after
->prev
!= NULL
)
240 before
->next
= after
;
241 after
->prev
= before
;
244 /* Register HOOK to be called with DATA on each removed edge. */
245 cgraph_edge_hook_list
*
246 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
248 cgraph_edge_hook_list
*entry
;
249 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
251 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
261 /* Remove ENTRY from the list of hooks called on removing edges. */
263 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
265 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
267 while (*ptr
!= entry
)
273 /* Call all edge removal hooks. */
275 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
277 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
280 entry
->hook (e
, entry
->data
);
285 /* Register HOOK to be called with DATA on each removed node. */
286 cgraph_node_hook_list
*
287 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
289 cgraph_node_hook_list
*entry
;
290 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
292 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
302 /* Remove ENTRY from the list of hooks called on removing nodes. */
304 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
306 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
308 while (*ptr
!= entry
)
314 /* Call all node removal hooks. */
316 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
318 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
321 entry
->hook (node
, entry
->data
);
326 /* Call all node removal hooks. */
328 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
330 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
333 entry
->hook (node
, entry
->data
);
339 /* Register HOOK to be called with DATA on each inserted node. */
340 cgraph_node_hook_list
*
341 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
343 cgraph_node_hook_list
*entry
;
344 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
346 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
356 /* Remove ENTRY from the list of hooks called on inserted nodes. */
358 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
360 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
362 while (*ptr
!= entry
)
368 /* Register HOOK to be called with DATA on each duplicated edge. */
369 cgraph_2edge_hook_list
*
370 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
372 cgraph_2edge_hook_list
*entry
;
373 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
375 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
385 /* Remove ENTRY from the list of hooks called on duplicating edges. */
387 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
389 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
391 while (*ptr
!= entry
)
397 /* Call all edge duplication hooks. */
399 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
401 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
404 entry
->hook (cs1
, cs2
, entry
->data
);
409 /* Register HOOK to be called with DATA on each duplicated node. */
410 cgraph_2node_hook_list
*
411 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
413 cgraph_2node_hook_list
*entry
;
414 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
416 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
426 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
428 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
430 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
432 while (*ptr
!= entry
)
438 /* Call all node duplication hooks. */
440 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
443 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
446 entry
->hook (node
, node2
, entry
->data
);
451 /* Return cgraph node assigned to DECL. Create new one when needed. */
454 cgraph_node::create (tree decl
)
456 cgraph_node
*node
= symtab
->create_empty ();
457 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
460 node
->register_symbol ();
462 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
464 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
465 node
->next_nested
= node
->origin
->nested
;
466 node
->origin
->nested
= node
;
471 /* Try to find a call graph node for declaration DECL and if it does not exist
472 or if it corresponds to an inline clone, create a new one. */
475 cgraph_node::get_create (tree decl
)
477 cgraph_node
*first_clone
= cgraph_node::get (decl
);
479 if (first_clone
&& !first_clone
->global
.inlined_to
)
482 cgraph_node
*node
= cgraph_node::create (decl
);
485 first_clone
->clone_of
= node
;
486 node
->clones
= first_clone
;
487 symtab
->symtab_prevail_in_asm_name_hash (node
);
488 node
->decl
->decl_with_vis
.symtab_node
= node
;
490 fprintf (dump_file
, "Introduced new external node "
491 "(%s/%i) and turned into root of the clone tree.\n",
492 xstrdup (node
->name ()), node
->order
);
495 fprintf (dump_file
, "Introduced new external node "
496 "(%s/%i).\n", xstrdup (node
->name ()),
501 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
502 the function body is associated with (not necessarily cgraph_node (DECL). */
505 cgraph_node::create_alias (tree alias
, tree target
)
507 cgraph_node
*alias_node
;
509 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
510 || TREE_CODE (target
) == IDENTIFIER_NODE
);
511 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
512 alias_node
= cgraph_node::get_create (alias
);
513 gcc_assert (!alias_node
->definition
);
514 alias_node
->alias_target
= target
;
515 alias_node
->definition
= true;
516 alias_node
->alias
= true;
517 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
518 alias_node
->weakref
= true;
522 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
524 Same body aliases are output whenever the body of DECL is output,
525 and cgraph_node::get (ALIAS) transparently returns
526 cgraph_node::get (DECL). */
529 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
532 #ifndef ASM_OUTPUT_DEF
533 /* If aliases aren't supported by the assembler, fail. */
536 /* Langhooks can create same body aliases of symbols not defined.
537 Those are useless. Drop them on the floor. */
538 if (symtab
->global_info_ready
)
541 n
= cgraph_node::create_alias (alias
, decl
);
542 n
->cpp_implicit_alias
= true;
543 if (symtab
->cpp_implicit_aliases_done
)
544 n
->resolve_alias (cgraph_node::get (decl
));
548 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
549 aliases DECL with an adjustments made into the first parameter.
550 See comments in thunk_adjust for detail on the parameters. */
553 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
554 HOST_WIDE_INT fixed_offset
,
555 HOST_WIDE_INT virtual_value
,
561 node
= cgraph_node::get (alias
);
565 node
= cgraph_node::create (alias
);
566 gcc_checking_assert (!virtual_offset
567 || wi::eq_p (virtual_offset
, virtual_value
));
568 node
->thunk
.fixed_offset
= fixed_offset
;
569 node
->thunk
.this_adjusting
= this_adjusting
;
570 node
->thunk
.virtual_value
= virtual_value
;
571 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
572 node
->thunk
.alias
= real_alias
;
573 node
->thunk
.thunk_p
= true;
574 node
->definition
= true;
579 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
580 Return NULL if there's no such node. */
583 cgraph_node::get_for_asmname (tree asmname
)
585 /* We do not want to look at inline clones. */
586 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
588 node
= node
->next_sharing_asm_name
)
590 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
591 if (cn
&& !cn
->global
.inlined_to
)
597 /* Returns a hash value for X (which really is a cgraph_edge). */
600 edge_hash (const void *x
)
602 return htab_hash_pointer (((const cgraph_edge
*) x
)->call_stmt
);
605 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
608 edge_eq (const void *x
, const void *y
)
610 return ((const cgraph_edge
*) x
)->call_stmt
== y
;
613 /* Add call graph edge E to call site hash of its caller. */
616 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
619 slot
= htab_find_slot_with_hash (e
->caller
->call_site_hash
,
621 htab_hash_pointer (e
->call_stmt
),
626 /* Add call graph edge E to call site hash of its caller. */
629 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
632 /* There are two speculative edges for every statement (one direct,
633 one indirect); always hash the direct one. */
634 if (e
->speculative
&& e
->indirect_unknown_callee
)
636 slot
= htab_find_slot_with_hash (e
->caller
->call_site_hash
,
638 htab_hash_pointer (e
->call_stmt
),
642 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
647 gcc_assert (!*slot
|| e
->speculative
);
651 /* Return the callgraph edge representing the GIMPLE_CALL statement
655 cgraph_node::get_edge (gimple call_stmt
)
661 return (cgraph_edge
*)
662 htab_find_with_hash (call_site_hash
, call_stmt
,
663 htab_hash_pointer (call_stmt
));
665 /* This loop may turn out to be performance problem. In such case adding
666 hashtables into call nodes with very many edges is probably best
667 solution. It is not good idea to add pointer into CALL_EXPR itself
668 because we want to make possible having multiple cgraph nodes representing
669 different clones of the same body before the body is actually cloned. */
670 for (e
= callees
; e
; e
= e
->next_callee
)
672 if (e
->call_stmt
== call_stmt
)
678 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
680 if (e
->call_stmt
== call_stmt
)
687 call_site_hash
= htab_create_ggc (120, edge_hash
, edge_eq
, NULL
);
688 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
689 cgraph_add_edge_to_call_site_hash (e2
);
690 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
691 cgraph_add_edge_to_call_site_hash (e2
);
698 /* Change field call_stmt of edge to NEW_STMT.
699 If UPDATE_SPECULATIVE and E is any component of speculative
700 edge, then update all components. */
703 cgraph_edge::set_call_stmt (gimple new_stmt
, bool update_speculative
)
707 /* Speculative edges has three component, update all of them
709 if (update_speculative
&& speculative
)
711 cgraph_edge
*direct
, *indirect
;
714 speculative_call_info (direct
, indirect
, ref
);
715 direct
->set_call_stmt (new_stmt
, false);
716 indirect
->set_call_stmt (new_stmt
, false);
717 ref
->stmt
= new_stmt
;
721 /* Only direct speculative edges go to call_site_hash. */
722 if (caller
->call_site_hash
723 && (!speculative
|| !indirect_unknown_callee
))
725 htab_remove_elt_with_hash (caller
->call_site_hash
,
727 htab_hash_pointer (call_stmt
));
730 cgraph_edge
*e
= this;
732 call_stmt
= new_stmt
;
733 if (indirect_unknown_callee
734 && (decl
= gimple_call_fndecl (new_stmt
)))
736 /* Constant propagation (and possibly also inlining?) can turn an
737 indirect call into a direct one. */
738 cgraph_node
*new_callee
= cgraph_node::get (decl
);
740 gcc_checking_assert (new_callee
);
741 e
= make_direct (new_callee
);
744 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
745 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
747 if (e
->caller
->call_site_hash
)
748 cgraph_add_edge_to_call_site_hash (e
);
751 /* Allocate a cgraph_edge structure and fill it with data according to the
752 parameters of which only CALLEE can be NULL (when creating an indirect call
756 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
757 gimple call_stmt
, gcov_type count
, int freq
,
758 bool indir_unknown_callee
)
762 /* LTO does not actually have access to the call_stmt since these
763 have not been loaded yet. */
766 /* This is a rather expensive check possibly triggering
767 construction of call stmt hashtable. */
768 #ifdef ENABLE_CHECKING
770 gcc_checking_assert (
771 !(e
= caller
->get_edge (call_stmt
)) || e
->speculative
);
774 gcc_assert (is_gimple_call (call_stmt
));
780 free_edges
= NEXT_FREE_EDGE (edge
);
784 edge
= ggc_alloc
<cgraph_edge
> ();
785 edge
->uid
= edges_max_uid
++;
791 edge
->caller
= caller
;
792 edge
->callee
= callee
;
793 edge
->prev_caller
= NULL
;
794 edge
->next_caller
= NULL
;
795 edge
->prev_callee
= NULL
;
796 edge
->next_callee
= NULL
;
797 edge
->lto_stmt_uid
= 0;
800 gcc_assert (count
>= 0);
801 edge
->frequency
= freq
;
802 gcc_assert (freq
>= 0);
803 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
805 edge
->call_stmt
= call_stmt
;
806 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
807 edge
->can_throw_external
808 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
811 && callee
&& callee
->decl
812 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
814 edge
->call_stmt_cannot_inline_p
= true;
816 edge
->call_stmt_cannot_inline_p
= false;
818 edge
->indirect_info
= NULL
;
819 edge
->indirect_inlining_edge
= 0;
820 edge
->speculative
= false;
821 edge
->indirect_unknown_callee
= indir_unknown_callee
;
822 if (call_stmt
&& caller
->call_site_hash
)
823 cgraph_add_edge_to_call_site_hash (edge
);
828 /* Create edge from a given function to CALLEE in the cgraph. */
831 cgraph_node::create_edge (cgraph_node
*callee
,
832 gimple call_stmt
, gcov_type count
, int freq
)
834 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
837 initialize_inline_failed (edge
);
839 edge
->next_caller
= callee
->callers
;
841 callee
->callers
->prev_caller
= edge
;
842 edge
->next_callee
= callees
;
844 callees
->prev_callee
= edge
;
846 callee
->callers
= edge
;
851 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
853 cgraph_indirect_call_info
*
854 cgraph_allocate_init_indirect_info (void)
856 cgraph_indirect_call_info
*ii
;
858 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
859 ii
->param_index
= -1;
863 /* Create an indirect edge with a yet-undetermined callee where the call
864 statement destination is a formal parameter of the caller with index
868 cgraph_node::create_indirect_edge (gimple call_stmt
, int ecf_flags
,
869 gcov_type count
, int freq
,
870 bool compute_indirect_info
)
872 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
876 initialize_inline_failed (edge
);
878 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
879 edge
->indirect_info
->ecf_flags
= ecf_flags
;
881 /* Record polymorphic call info. */
882 if (compute_indirect_info
884 && (target
= gimple_call_fn (call_stmt
))
885 && virtual_method_call_p (target
))
887 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
889 /* Only record types can have virtual calls. */
890 edge
->indirect_info
->polymorphic
= true;
891 edge
->indirect_info
->param_index
= -1;
892 edge
->indirect_info
->otr_token
893 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
894 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
895 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
896 edge
->indirect_info
->context
= context
;
899 edge
->next_callee
= indirect_calls
;
901 indirect_calls
->prev_callee
= edge
;
902 indirect_calls
= edge
;
907 /* Remove the edge from the list of the callers of the callee. */
910 cgraph_edge::remove_callee (void)
912 gcc_assert (!indirect_unknown_callee
);
914 prev_caller
->next_caller
= next_caller
;
916 next_caller
->prev_caller
= prev_caller
;
918 callee
->callers
= next_caller
;
921 /* Remove the edge from the list of the callees of the caller. */
924 cgraph_edge::remove_caller (void)
927 prev_callee
->next_callee
= next_callee
;
929 next_callee
->prev_callee
= prev_callee
;
932 if (indirect_unknown_callee
)
933 caller
->indirect_calls
= next_callee
;
935 caller
->callees
= next_callee
;
937 if (caller
->call_site_hash
)
938 htab_remove_elt_with_hash (caller
->call_site_hash
,
940 htab_hash_pointer (call_stmt
));
943 /* Put the edge onto the free list. */
946 symbol_table::free_edge (cgraph_edge
*e
)
950 if (e
->indirect_info
)
951 ggc_free (e
->indirect_info
);
953 /* Clear out the edge so we do not dangle pointers. */
954 memset (e
, 0, sizeof (*e
));
956 NEXT_FREE_EDGE (e
) = free_edges
;
961 /* Remove the edge in the cgraph. */
964 cgraph_edge::remove (void)
966 /* Call all edge removal hooks. */
967 symtab
->call_edge_removal_hooks (this);
969 if (!indirect_unknown_callee
)
970 /* Remove from callers list of the callee. */
973 /* Remove from callees list of the callers. */
976 /* Put the edge onto the free list. */
977 symtab
->free_edge (this);
980 /* Set callee of call graph edge E and add it to the corresponding set of
984 cgraph_set_edge_callee (cgraph_edge
*e
, cgraph_node
*n
)
986 e
->prev_caller
= NULL
;
988 n
->callers
->prev_caller
= e
;
989 e
->next_caller
= n
->callers
;
994 /* Turn edge into speculative call calling N2. Update
995 the profile so the direct call is taken COUNT times
998 At clone materialization time, the indirect call E will
1001 if (call_dest == N2)
1006 At this time the function just creates the direct call,
1007 the referencd representing the if conditional and attaches
1008 them all to the orginal indirect call statement.
1010 Return direct edge created. */
1013 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1014 int direct_frequency
)
1016 cgraph_node
*n
= caller
;
1017 ipa_ref
*ref
= NULL
;
1022 fprintf (dump_file
, "Indirect call -> speculative call"
1023 " %s/%i => %s/%i\n",
1024 xstrdup (n
->name ()), n
->order
,
1025 xstrdup (n2
->name ()), n2
->order
);
1028 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1029 initialize_inline_failed (e2
);
1030 e2
->speculative
= true;
1031 if (TREE_NOTHROW (n2
->decl
))
1032 e2
->can_throw_external
= false;
1034 e2
->can_throw_external
= can_throw_external
;
1035 e2
->lto_stmt_uid
= lto_stmt_uid
;
1037 frequency
-= e2
->frequency
;
1038 symtab
->call_edge_duplication_hooks (this, e2
);
1039 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1040 ref
->lto_stmt_uid
= lto_stmt_uid
;
1041 ref
->speculative
= speculative
;
1042 n2
->mark_address_taken ();
1046 /* Speculative call consist of three components:
1047 1) an indirect edge representing the original call
1048 2) an direct edge representing the new call
1049 3) ADDR_EXPR reference representing the speculative check.
1050 All three components are attached to single statement (the indirect
1051 call) and if one of them exists, all of them must exist.
1053 Given speculative call edge, return all three components.
1057 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1058 cgraph_edge
*&indirect
,
1059 ipa_ref
*&reference
)
1064 cgraph_edge
*e
= this;
1066 if (!e
->indirect_unknown_callee
)
1067 for (e2
= e
->caller
->indirect_calls
;
1068 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1069 e2
= e2
->next_callee
)
1074 /* We can take advantage of the call stmt hash. */
1077 e
= e
->caller
->get_edge (e2
->call_stmt
);
1078 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1081 for (e
= e
->caller
->callees
;
1082 e2
->call_stmt
!= e
->call_stmt
1083 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1087 gcc_assert (e
->speculative
&& e2
->speculative
);
1092 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1093 if (ref
->speculative
1094 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1095 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1101 /* Speculative edge always consist of all three components - direct edge,
1102 indirect and reference. */
1104 gcc_assert (e
&& e2
&& ref
);
1107 /* Redirect callee of the edge to N. The function does not update underlying
1111 cgraph_edge::redirect_callee (cgraph_node
*n
)
1113 /* Remove from callers list of the current callee. */
1116 /* Insert to callers list of the new callee. */
1117 cgraph_set_edge_callee (this, n
);
1120 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1121 Remove the speculative call sequence and return edge representing the call.
1122 It is up to caller to redirect the call as appropriate. */
1125 cgraph_edge::resolve_speculation (tree callee_decl
)
1127 cgraph_edge
*edge
= this;
1131 gcc_assert (edge
->speculative
);
1132 edge
->speculative_call_info (e2
, edge
, ref
);
1134 || !ref
->referred
->semantically_equivalent_p
1135 (symtab_node::get (callee_decl
)))
1141 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1142 "turned out to have contradicting known target ",
1143 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1144 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1145 print_generic_expr (dump_file
, callee_decl
, 0);
1146 fprintf (dump_file
, "\n");
1150 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1151 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1152 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1158 cgraph_edge
*tmp
= edge
;
1160 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1163 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1164 in the functions inlined through it. */
1166 edge
->count
+= e2
->count
;
1167 edge
->frequency
+= e2
->frequency
;
1168 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1169 edge
->frequency
= CGRAPH_FREQ_MAX
;
1170 edge
->speculative
= false;
1171 e2
->speculative
= false;
1172 ref
->remove_reference ();
1173 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1176 e2
->callee
->remove_symbol_and_inline_clones ();
1177 if (edge
->caller
->call_site_hash
)
1178 cgraph_update_edge_in_call_site_hash (edge
);
1182 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1183 CALLEE. DELTA is an integer constant that is to be added to the this
1184 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1187 cgraph_edge::make_direct (cgraph_node
*callee
)
1189 cgraph_edge
*edge
= this;
1190 gcc_assert (indirect_unknown_callee
);
1192 /* If we are redirecting speculative call, make it non-speculative. */
1193 if (indirect_unknown_callee
&& speculative
)
1195 edge
= edge
->resolve_speculation (callee
->decl
);
1197 /* On successful speculation just return the pre existing direct edge. */
1198 if (!indirect_unknown_callee
)
1202 indirect_unknown_callee
= 0;
1203 ggc_free (indirect_info
);
1204 indirect_info
= NULL
;
1206 /* Get the edge out of the indirect edge list. */
1208 prev_callee
->next_callee
= next_callee
;
1210 next_callee
->prev_callee
= prev_callee
;
1212 caller
->indirect_calls
= next_callee
;
1214 /* Put it into the normal callee list */
1216 next_callee
= caller
->callees
;
1217 if (caller
->callees
)
1218 caller
->callees
->prev_callee
= edge
;
1219 caller
->callees
= edge
;
1221 /* Insert to callers list of the new callee. */
1222 cgraph_set_edge_callee (edge
, callee
);
1225 call_stmt_cannot_inline_p
1226 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1229 /* We need to re-determine the inlining status of the edge. */
1230 initialize_inline_failed (edge
);
1234 /* If necessary, change the function declaration in the call statement
1235 associated with E so that it corresponds to the edge callee. */
1238 cgraph_edge::redirect_call_stmt_to_callee (void)
1240 cgraph_edge
*e
= this;
1242 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1243 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1245 gimple_stmt_iterator gsi
;
1246 #ifdef ENABLE_CHECKING
1256 e
->speculative_call_info (e
, e2
, ref
);
1257 /* If there already is an direct call (i.e. as a result of inliner's
1258 substitution), forget about speculating. */
1260 e
= e
->resolve_speculation (decl
);
1261 /* If types do not match, speculation was likely wrong.
1262 The direct edge was posisbly redirected to the clone with a different
1263 signature. We did not update the call statement yet, so compare it
1264 with the reference that still points to the proper type. */
1265 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1266 ref
->referred
->decl
,
1270 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1272 xstrdup (e
->caller
->name ()),
1274 xstrdup (e
->callee
->name ()),
1276 e
= e
->resolve_speculation ();
1277 /* We are producing the final function body and will throw away the
1278 callgraph edges really soon. Reset the counts/frequencies to
1279 keep verifier happy in the case of roundoff errors. */
1280 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1281 e
->frequency
= compute_call_stmt_bb_frequency
1282 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1284 /* Expand speculation into GIMPLE code. */
1289 "Expanding speculative call of %s/%i -> %s/%i count:"
1291 xstrdup (e
->caller
->name ()),
1293 xstrdup (e
->callee
->name ()),
1296 gcc_assert (e2
->speculative
);
1297 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1298 new_stmt
= gimple_ic (e
->call_stmt
, dyn_cast
<cgraph_node
*> (ref
->referred
),
1299 e
->count
|| e2
->count
1300 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1301 e
->count
+ e2
->count
)
1302 : e
->frequency
|| e2
->frequency
1303 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1304 e
->frequency
+ e2
->frequency
)
1305 : REG_BR_PROB_BASE
/ 2,
1306 e
->count
, e
->count
+ e2
->count
);
1307 e
->speculative
= false;
1308 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1310 e
->frequency
= compute_call_stmt_bb_frequency
1311 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1312 e2
->frequency
= compute_call_stmt_bb_frequency
1313 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1314 e2
->speculative
= false;
1315 ref
->speculative
= false;
1317 /* Indirect edges are not both in the call site hash.
1319 if (e
->caller
->call_site_hash
)
1320 cgraph_update_edge_in_call_site_hash (e2
);
1322 /* Continue redirecting E to proper target. */
1326 if (e
->indirect_unknown_callee
1327 || decl
== e
->callee
->decl
)
1328 return e
->call_stmt
;
1330 #ifdef ENABLE_CHECKING
1333 node
= cgraph_node::get (decl
);
1334 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1338 if (symtab
->dump_file
)
1340 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1341 xstrdup (e
->caller
->name ()), e
->caller
->order
,
1342 xstrdup (e
->callee
->name ()), e
->callee
->order
);
1343 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1344 if (e
->callee
->clone
.combined_args_to_skip
)
1346 fprintf (symtab
->dump_file
, " combined args to skip: ");
1347 dump_bitmap (symtab
->dump_file
,
1348 e
->callee
->clone
.combined_args_to_skip
);
1352 if (e
->callee
->clone
.combined_args_to_skip
)
1357 = gimple_call_copy_skip_args (e
->call_stmt
,
1358 e
->callee
->clone
.combined_args_to_skip
);
1359 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1360 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1362 if (gimple_vdef (new_stmt
)
1363 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1364 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1366 gsi
= gsi_for_stmt (e
->call_stmt
);
1367 gsi_replace (&gsi
, new_stmt
, false);
1368 /* We need to defer cleaning EH info on the new statement to
1369 fixup-cfg. We may not have dominator information at this point
1370 and thus would end up with unreachable blocks and have no way
1371 to communicate that we need to run CFG cleanup then. */
1372 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1375 remove_stmt_from_eh_lp (e
->call_stmt
);
1376 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1381 new_stmt
= e
->call_stmt
;
1382 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1383 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1386 /* If the call becomes noreturn, remove the lhs. */
1387 if (lhs
&& (gimple_call_flags (new_stmt
) & ECF_NORETURN
))
1389 if (TREE_CODE (lhs
) == SSA_NAME
)
1391 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1392 TREE_TYPE (lhs
), NULL
);
1393 var
= get_or_create_ssa_default_def
1394 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1395 gimple set_stmt
= gimple_build_assign (lhs
, var
);
1396 gsi
= gsi_for_stmt (new_stmt
);
1397 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1398 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1400 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1401 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1404 /* If new callee has no static chain, remove it. */
1405 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1407 gimple_call_set_chain (new_stmt
, NULL
);
1408 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1411 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1413 if (symtab
->dump_file
)
1415 fprintf (symtab
->dump_file
, " updated to:");
1416 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1421 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1422 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1423 of OLD_STMT if it was previously call statement.
1424 If NEW_STMT is NULL, the call has been dropped without any
1428 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1429 gimple old_stmt
, tree old_call
,
1432 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1433 ? gimple_call_fndecl (new_stmt
) : 0;
1435 /* We are seeing indirect calls, then there is nothing to update. */
1436 if (!new_call
&& !old_call
)
1438 /* See if we turned indirect call into direct call or folded call to one builtin
1439 into different builtin. */
1440 if (old_call
!= new_call
)
1442 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1443 cgraph_edge
*ne
= NULL
;
1449 /* See if the edge is already there and has the correct callee. It
1450 might be so because of indirect inlining has already updated
1451 it. We also might've cloned and redirected the edge. */
1452 if (new_call
&& e
->callee
)
1454 cgraph_node
*callee
= e
->callee
;
1457 if (callee
->decl
== new_call
1458 || callee
->former_clone_of
== new_call
)
1460 e
->set_call_stmt (new_stmt
);
1463 callee
= callee
->clone_of
;
1467 /* Otherwise remove edge and create new one; we can't simply redirect
1468 since function has changed, so inline plan and other information
1469 attached to edge is invalid. */
1471 frequency
= e
->frequency
;
1472 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1475 e
->callee
->remove_symbol_and_inline_clones ();
1479 /* We are seeing new direct call; compute profile info based on BB. */
1480 basic_block bb
= gimple_bb (new_stmt
);
1482 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1488 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1489 new_stmt
, count
, frequency
);
1490 gcc_assert (ne
->inline_failed
);
1493 /* We only updated the call stmt; update pointer in cgraph edge.. */
1494 else if (old_stmt
!= new_stmt
)
1495 node
->get_edge (old_stmt
)->set_call_stmt (new_stmt
);
1498 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1499 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1500 of OLD_STMT before it was updated (updating can happen inplace). */
1503 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1505 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1508 gcc_checking_assert (orig
);
1509 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1511 for (node
= orig
->clones
; node
!= orig
;)
1513 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1515 node
= node
->clones
;
1516 else if (node
->next_sibling_clone
)
1517 node
= node
->next_sibling_clone
;
1520 while (node
!= orig
&& !node
->next_sibling_clone
)
1521 node
= node
->clone_of
;
1523 node
= node
->next_sibling_clone
;
1529 /* Remove all callees from the node. */
1532 cgraph_node::remove_callees (void)
1536 /* It is sufficient to remove the edges from the lists of callers of
1537 the callees. The callee list of the node can be zapped with one
1539 for (e
= callees
; e
; e
= f
)
1542 symtab
->call_edge_removal_hooks (e
);
1543 if (!e
->indirect_unknown_callee
)
1544 e
->remove_callee ();
1545 symtab
->free_edge (e
);
1547 for (e
= indirect_calls
; e
; e
= f
)
1550 symtab
->call_edge_removal_hooks (e
);
1551 if (!e
->indirect_unknown_callee
)
1552 e
->remove_callee ();
1553 symtab
->free_edge (e
);
1555 indirect_calls
= NULL
;
1559 htab_delete (call_site_hash
);
1560 call_site_hash
= NULL
;
1564 /* Remove all callers from the node. */
1567 cgraph_node::remove_callers (void)
1571 /* It is sufficient to remove the edges from the lists of callees of
1572 the callers. The caller list of the node can be zapped with one
1574 for (e
= callers
; e
; e
= f
)
1577 symtab
->call_edge_removal_hooks (e
);
1578 e
->remove_caller ();
1579 symtab
->free_edge (e
);
1584 /* Helper function for cgraph_release_function_body and free_lang_data.
1585 It releases body from function DECL without having to inspect its
1586 possibly non-existent symtab node. */
1589 release_function_body (tree decl
)
1591 if (DECL_STRUCT_FUNCTION (decl
))
1593 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1597 cfun
->curr_properties
&= ~PROP_loops
;
1598 loop_optimizer_finalize ();
1600 if (cfun
->gimple_df
)
1603 delete_tree_cfg_annotations ();
1608 gcc_assert (!dom_info_available_p (CDI_DOMINATORS
));
1609 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS
));
1613 if (cfun
->value_histograms
)
1616 gimple_set_body (decl
, NULL
);
1617 /* Struct function hangs a lot of data that would leak if we didn't
1618 removed all pointers to it. */
1619 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1620 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1622 DECL_SAVED_TREE (decl
) = NULL
;
1625 /* Release memory used to represent body of function.
1626 Use this only for functions that are released before being translated to
1627 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1628 are free'd in final.c via free_after_compilation(). */
1631 cgraph_node::release_body (void)
1633 ipa_transforms_to_apply
.release ();
1634 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1636 DECL_RESULT (decl
) = NULL
;
1637 DECL_ARGUMENTS (decl
) = NULL
;
1639 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1640 of its associated function function declaration because it's
1641 needed to emit debug info later. */
1642 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1643 DECL_INITIAL (decl
) = error_mark_node
;
1644 release_function_body (decl
);
1646 lto_free_function_in_decl_state_for_node (this);
1649 /* Remove function from symbol table. */
1652 cgraph_node::remove (void)
1655 int uid
= this->uid
;
1657 symtab
->call_cgraph_removal_hooks (this);
1660 ipa_transforms_to_apply
.release ();
1662 /* Incremental inlining access removed nodes stored in the postorder list.
1664 force_output
= false;
1665 forced_by_abi
= false;
1666 for (n
= nested
; n
; n
= n
->next_nested
)
1671 cgraph_node
**node2
= &origin
->nested
;
1673 while (*node2
!= this)
1674 node2
= &(*node2
)->next_nested
;
1675 *node2
= next_nested
;
1678 if (prev_sibling_clone
)
1679 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1681 clone_of
->clones
= next_sibling_clone
;
1682 if (next_sibling_clone
)
1683 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1686 cgraph_node
*n
, *next
;
1690 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1691 n
->clone_of
= clone_of
;
1692 n
->clone_of
= clone_of
;
1693 n
->next_sibling_clone
= clone_of
->clones
;
1694 if (clone_of
->clones
)
1695 clone_of
->clones
->prev_sibling_clone
= n
;
1696 clone_of
->clones
= clones
;
1700 /* We are removing node with clones. This makes clones inconsistent,
1701 but assume they will be removed subsequently and just keep clone
1702 tree intact. This can happen in unreachable function removal since
1703 we remove unreachable functions in random order, not by bottom-up
1704 walk of clone trees. */
1705 for (n
= clones
; n
; n
= next
)
1707 next
= n
->next_sibling_clone
;
1708 n
->next_sibling_clone
= NULL
;
1709 n
->prev_sibling_clone
= NULL
;
1715 /* While all the clones are removed after being proceeded, the function
1716 itself is kept in the cgraph even after it is compiled. Check whether
1717 we are done with this body and reclaim it proactively if this is the case.
1719 if (symtab
->state
!= LTO_STREAMING
)
1721 n
= cgraph_node::get (decl
);
1723 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1724 && (symtab
->global_info_ready
1725 && (TREE_ASM_WRITTEN (n
->decl
)
1726 || DECL_EXTERNAL (n
->decl
)
1728 || (!flag_wpa
&& n
->in_other_partition
)))))
1735 htab_delete (call_site_hash
);
1736 call_site_hash
= NULL
;
1739 symtab
->release_symbol (this, uid
);
1742 /* Likewise indicate that a node is having address taken. */
1745 cgraph_node::mark_address_taken (void)
1747 /* Indirect inlining can figure out that all uses of the address are
1749 if (global
.inlined_to
)
1751 gcc_assert (cfun
->after_inlining
);
1752 gcc_assert (callers
->indirect_inlining_edge
);
1755 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1756 IPA_REF_ADDR reference exists (and thus it should be set on node
1757 representing alias we take address of) and as a test whether address
1758 of the object was taken (and thus it should be set on node alias is
1759 referring to). We should remove the first use and the remove the
1762 cgraph_node
*node
= ultimate_alias_target ();
1763 node
->address_taken
= 1;
1766 /* Return local info for the compiled function. */
1769 cgraph_node::local_info (tree decl
)
1771 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1772 cgraph_node
*node
= get (decl
);
1775 return &node
->local
;
1778 /* Return global info for the compiled function. */
1780 cgraph_global_info
*
1781 cgraph_node::global_info (tree decl
)
1783 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1784 && symtab
->global_info_ready
);
1785 cgraph_node
*node
= get (decl
);
1788 return &node
->global
;
1791 /* Return local info for the compiled function. */
1794 cgraph_node::rtl_info (tree decl
)
1796 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1797 cgraph_node
*node
= get (decl
);
1799 || (decl
!= current_function_decl
1800 && !TREE_ASM_WRITTEN (node
->decl
)))
1805 /* Return a string describing the failure REASON. */
1808 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1811 #define DEFCIFCODE(code, type, string) string,
1813 static const char *cif_string_table
[CIF_N_REASONS
] = {
1814 #include "cif-code.def"
1817 /* Signedness of an enum type is implementation defined, so cast it
1818 to unsigned before testing. */
1819 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1820 return cif_string_table
[reason
];
1823 /* Return a type describing the failure REASON. */
1825 cgraph_inline_failed_type_t
1826 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1829 #define DEFCIFCODE(code, type, string) type,
1831 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1832 #include "cif-code.def"
1835 /* Signedness of an enum type is implementation defined, so cast it
1836 to unsigned before testing. */
1837 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1838 return cif_type_table
[reason
];
1841 /* Names used to print out the availability enum. */
1842 const char * const cgraph_availability_names
[] =
1843 {"unset", "not_available", "overwritable", "available", "local"};
1845 /* Output flags of edge E. */
1848 dump_edge_flags (FILE *f
, struct cgraph_edge
*edge
)
1850 if (edge
->speculative
)
1851 fprintf (f
, "(speculative) ");
1852 if (!edge
->inline_failed
)
1853 fprintf (f
, "(inlined) ");
1854 if (edge
->indirect_inlining_edge
)
1855 fprintf (f
, "(indirect_inlining) ");
1857 fprintf (f
, "(%"PRId64
"x) ",
1858 (int64_t)edge
->count
);
1859 if (edge
->frequency
)
1860 fprintf (f
, "(%.2f per call) ",
1861 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1862 if (edge
->can_throw_external
)
1863 fprintf (f
, "(can throw external) ");
1866 /* Dump call graph node to file F. */
1869 cgraph_node::dump (FILE *f
)
1875 if (global
.inlined_to
)
1876 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1879 xstrdup (global
.inlined_to
->name ()),
1880 global
.inlined_to
->order
);
1882 fprintf (f
, " Clone of %s/%i\n",
1883 clone_of
->asm_name (),
1885 if (symtab
->function_flags_ready
)
1886 fprintf (f
, " Availability: %s\n",
1887 cgraph_availability_names
[get_availability ()]);
1890 fprintf (f
, " Profile id: %i\n",
1892 fprintf (f
, " First run: %i\n", tp_first_run
);
1893 fprintf (f
, " Function flags:");
1895 fprintf (f
, " executed %"PRId64
"x",
1898 fprintf (f
, " nested in: %s", origin
->asm_name ());
1899 if (gimple_has_body_p (decl
))
1900 fprintf (f
, " body");
1902 fprintf (f
, " process");
1904 fprintf (f
, " local");
1905 if (local
.redefined_extern_inline
)
1906 fprintf (f
, " redefined_extern_inline");
1907 if (only_called_at_startup
)
1908 fprintf (f
, " only_called_at_startup");
1909 if (only_called_at_exit
)
1910 fprintf (f
, " only_called_at_exit");
1912 fprintf (f
, " tm_clone");
1913 if (DECL_STATIC_CONSTRUCTOR (decl
))
1914 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
1915 if (DECL_STATIC_DESTRUCTOR (decl
))
1916 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
1922 fprintf (f
, " Thunk");
1924 fprintf (f
, " of %s (asm: %s)",
1925 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
1926 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
1927 fprintf (f
, " fixed offset %i virtual value %i has "
1928 "virtual offset %i)\n",
1929 (int)thunk
.fixed_offset
,
1930 (int)thunk
.virtual_value
,
1931 (int)thunk
.virtual_offset_p
);
1933 if (alias
&& thunk
.alias
1934 && DECL_P (thunk
.alias
))
1936 fprintf (f
, " Alias of %s",
1937 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
1938 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
1939 fprintf (f
, " (asm: %s)",
1940 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
1944 fprintf (f
, " Called by: ");
1946 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
1948 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
1949 edge
->caller
->order
);
1950 dump_edge_flags (f
, edge
);
1953 fprintf (f
, "\n Calls: ");
1954 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
1956 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
1957 edge
->callee
->order
);
1958 dump_edge_flags (f
, edge
);
1962 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
1964 if (edge
->indirect_info
->polymorphic
)
1966 fprintf (f
, " Polymorphic indirect call of type ");
1967 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
1968 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
1971 fprintf (f
, " Indirect call");
1972 dump_edge_flags (f
, edge
);
1973 if (edge
->indirect_info
->param_index
!= -1)
1975 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
1976 if (edge
->indirect_info
->agg_contents
)
1977 fprintf (f
, " loaded from %s %s at offset %i",
1978 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
1979 edge
->indirect_info
->by_ref
? "passed by reference":"",
1980 (int)edge
->indirect_info
->offset
);
1983 if (edge
->indirect_info
->polymorphic
)
1984 edge
->indirect_info
->context
.dump (f
);
1988 /* Dump call graph node NODE to stderr. */
1991 cgraph_node::debug (void)
1996 /* Dump the callgraph to file F. */
1999 cgraph_node::dump_cgraph (FILE *f
)
2003 fprintf (f
, "callgraph:\n\n");
2004 FOR_EACH_FUNCTION (node
)
2008 /* Return true when the DECL can possibly be inlined. */
2011 cgraph_function_possibly_inlined_p (tree decl
)
2013 if (!symtab
->global_info_ready
)
2014 return !DECL_UNINLINABLE (decl
);
2015 return DECL_POSSIBLY_INLINED (decl
);
2018 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2020 cgraph_node::unnest (void)
2022 cgraph_node
**node2
= &origin
->nested
;
2023 gcc_assert (origin
);
2025 while (*node2
!= this)
2026 node2
= &(*node2
)->next_nested
;
2027 *node2
= next_nested
;
2031 /* Return function availability. See cgraph.h for description of individual
2034 cgraph_node::get_availability (void)
2036 enum availability avail
;
2038 avail
= AVAIL_NOT_AVAILABLE
;
2039 else if (local
.local
)
2040 avail
= AVAIL_LOCAL
;
2041 else if (alias
&& weakref
)
2042 ultimate_alias_target (&avail
);
2043 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2044 avail
= AVAIL_INTERPOSABLE
;
2045 else if (!externally_visible
)
2046 avail
= AVAIL_AVAILABLE
;
2047 /* Inline functions are safe to be analyzed even if their symbol can
2048 be overwritten at runtime. It is not meaningful to enforce any sane
2049 behaviour on replacing inline function by different body. */
2050 else if (DECL_DECLARED_INLINE_P (decl
))
2051 avail
= AVAIL_AVAILABLE
;
2053 /* If the function can be overwritten, return OVERWRITABLE. Take
2054 care at least of two notable extensions - the COMDAT functions
2055 used to share template instantiations in C++ (this is symmetric
2056 to code cp_cannot_inline_tree_fn and probably shall be shared and
2057 the inlinability hooks completely eliminated).
2059 ??? Does the C++ one definition rule allow us to always return
2060 AVAIL_AVAILABLE here? That would be good reason to preserve this
2063 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2064 avail
= AVAIL_INTERPOSABLE
;
2065 else avail
= AVAIL_AVAILABLE
;
2070 /* Worker for cgraph_node_can_be_local_p. */
2072 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2074 return !(!node
->force_output
2075 && ((DECL_COMDAT (node
->decl
)
2076 && !node
->forced_by_abi
2077 && !node
->used_from_object_file_p ()
2078 && !node
->same_comdat_group
)
2079 || !node
->externally_visible
));
2082 /* Return true if cgraph_node can be made local for API change.
2083 Extern inline functions and C++ COMDAT functions can be made local
2084 at the expense of possible code size growth if function is used in multiple
2085 compilation units. */
2087 cgraph_node::can_be_local_p (void)
2089 return (!address_taken
2090 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2094 /* Call calback on cgraph_node, thunks and aliases associated to cgraph_node.
2095 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2099 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2100 (cgraph_node
*, void *),
2102 bool include_overwritable
)
2107 if (callback (this, data
))
2109 for (e
= callers
; e
; e
= e
->next_caller
)
2110 if (e
->caller
->thunk
.thunk_p
2111 && (include_overwritable
2112 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2113 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2114 include_overwritable
))
2117 FOR_EACH_ALIAS (this, ref
)
2119 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2120 if (include_overwritable
2121 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2122 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2123 include_overwritable
))
2129 /* Call calback on function and aliases associated to the function.
2130 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2134 cgraph_node::call_for_symbol_and_aliases (bool (*callback
) (cgraph_node
*,
2137 bool include_overwritable
)
2141 if (callback (this, data
))
2144 FOR_EACH_ALIAS (this, ref
)
2146 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2147 if (include_overwritable
2148 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2149 if (alias
->call_for_symbol_and_aliases (callback
, data
,
2150 include_overwritable
))
2156 /* Worker to bring NODE local. */
2159 cgraph_node::make_local (cgraph_node
*node
, void *)
2161 gcc_checking_assert (node
->can_be_local_p ());
2162 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2164 node
->make_decl_local ();
2165 node
->set_section (NULL
);
2166 node
->set_comdat_group (NULL
);
2167 node
->externally_visible
= false;
2168 node
->forced_by_abi
= false;
2169 node
->local
.local
= true;
2170 node
->set_section (NULL
);
2171 node
->unique_name
= (node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2172 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2173 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2174 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2179 /* Bring cgraph node local. */
2182 cgraph_node::make_local (void)
2184 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2187 /* Worker to set nothrow flag. */
2190 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2194 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2197 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2198 e
->can_throw_external
= false;
2202 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2203 if any to NOTHROW. */
2206 cgraph_node::set_nothrow_flag (bool nothrow
)
2208 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2209 (void *)(size_t)nothrow
, false);
2212 /* Worker to set const flag. */
2215 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2217 /* Static constructors and destructors without a side effect can be
2219 if (data
&& !((size_t)data
& 2))
2221 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2222 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2223 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2224 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2226 TREE_READONLY (node
->decl
) = data
!= NULL
;
2227 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2231 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2232 if any to READONLY. */
2235 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2237 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2238 (void *)(size_t)(readonly
+ (int)looping
* 2),
2242 /* Worker to set pure flag. */
2245 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2247 /* Static constructors and destructors without a side effect can be
2249 if (data
&& !((size_t)data
& 2))
2251 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2252 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2253 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2254 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2256 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2257 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2261 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2265 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2267 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2268 (void *)(size_t)(pure
+ (int)looping
* 2),
2272 /* Return true when cgraph_node can not return or throw and thus
2273 it is safe to ignore its side effects for IPA analysis. */
2276 cgraph_node::cannot_return_p (void)
2278 int flags
= flags_from_decl_or_type (decl
);
2279 if (!flag_exceptions
)
2280 return (flags
& ECF_NORETURN
) != 0;
2282 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2283 == (ECF_NORETURN
| ECF_NOTHROW
));
2286 /* Return true when call of edge can not lead to return from caller
2287 and thus it is safe to ignore its side effects for IPA analysis
2288 when computing side effects of the caller.
2289 FIXME: We could actually mark all edges that have no reaching
2290 patch to the exit block or throw to get better results. */
2292 cgraph_edge::cannot_lead_to_return_p (void)
2294 if (caller
->cannot_return_p ())
2296 if (indirect_unknown_callee
)
2298 int flags
= indirect_info
->ecf_flags
;
2299 if (!flag_exceptions
)
2300 return (flags
& ECF_NORETURN
) != 0;
2302 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2303 == (ECF_NORETURN
| ECF_NOTHROW
));
2306 return callee
->cannot_return_p ();
2309 /* Return true when function can be removed from callgraph
2310 if all direct calls are eliminated. */
2313 cgraph_node::can_remove_if_no_direct_calls_and_refs_p (void)
2315 gcc_assert (!global
.inlined_to
);
2316 /* Extern inlines can always go, we will use the external definition. */
2317 if (DECL_EXTERNAL (decl
))
2319 /* When function is needed, we can not remove it. */
2320 if (force_output
|| used_from_other_partition
)
2322 if (DECL_STATIC_CONSTRUCTOR (decl
)
2323 || DECL_STATIC_DESTRUCTOR (decl
))
2325 /* Only COMDAT functions can be removed if externally visible. */
2326 if (externally_visible
2327 && (!DECL_COMDAT (decl
)
2329 || used_from_object_file_p ()))
2334 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2337 nonremovable_p (cgraph_node
*node
, void *)
2339 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2342 /* Return true when function cgraph_node and its aliases can be removed from
2343 callgraph if all direct calls are eliminated. */
2346 cgraph_node::can_remove_if_no_direct_calls_p (void)
2348 /* Extern inlines can always go, we will use the external definition. */
2349 if (DECL_EXTERNAL (decl
))
2353 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2356 /* Return true when function cgraph_node can be expected to be removed
2357 from program when direct calls in this compilation unit are removed.
2359 As a special case COMDAT functions are
2360 cgraph_can_remove_if_no_direct_calls_p while the are not
2361 cgraph_only_called_directly_p (it is possible they are called from other
2364 This function behaves as cgraph_only_called_directly_p because eliminating
2365 all uses of COMDAT function does not make it necessarily disappear from
2366 the program unless we are compiling whole program or we do LTO. In this
2367 case we know we win since dynamic linking will not really discard the
2368 linkonce section. */
2371 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p (void)
2373 gcc_assert (!global
.inlined_to
);
2375 if (call_for_symbol_and_aliases (used_from_object_file_p_worker
,
2378 if (!in_lto_p
&& !flag_whole_program
)
2379 return only_called_directly_p ();
2382 if (DECL_EXTERNAL (decl
))
2384 return can_remove_if_no_direct_calls_p ();
2389 /* Worker for cgraph_only_called_directly_p. */
2392 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2394 return !node
->only_called_directly_or_aliased_p ();
2397 /* Return true when function cgraph_node and all its aliases are only called
2399 i.e. it is not externally visible, address was not taken and
2400 it is not used in any other non-standard way. */
2403 cgraph_node::only_called_directly_p (void)
2405 gcc_assert (ultimate_alias_target () == this);
2406 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2411 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2414 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2416 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2418 enum availability avail
;
2419 node
->ultimate_alias_target (&avail
);
2421 if (avail
> AVAIL_INTERPOSABLE
)
2422 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2423 if (!cs
->indirect_inlining_edge
)
2424 redirect_callers
->safe_push (cs
);
2428 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2429 cgraph_node (i.e. are not overwritable). */
2432 cgraph_node::collect_callers (void)
2434 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2435 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2436 &redirect_callers
, false);
2437 return redirect_callers
;
2440 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2443 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2445 bool skipped_thunk
= false;
2446 node
= node
->ultimate_alias_target ();
2447 node2
= node2
->ultimate_alias_target ();
2449 /* There are no virtual clones of thunks so check former_clone_of or if we
2450 might have skipped thunks because this adjustments are no longer
2452 while (node
->thunk
.thunk_p
)
2454 if (node2
->former_clone_of
== node
->decl
)
2456 if (!node
->thunk
.this_adjusting
)
2458 node
= node
->callees
->callee
->ultimate_alias_target ();
2459 skipped_thunk
= true;
2464 if (!node2
->clone
.args_to_skip
2465 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2467 if (node2
->former_clone_of
== node
->decl
)
2469 else if (!node2
->clone_of
)
2473 while (node
!= node2
&& node2
)
2474 node2
= node2
->clone_of
;
2475 return node2
!= NULL
;
2478 /* Verify edge E count and frequency. */
2481 verify_edge_count_and_frequency (cgraph_edge
*e
)
2483 bool error_found
= false;
2486 error ("caller edge count is negative");
2489 if (e
->frequency
< 0)
2491 error ("caller edge frequency is negative");
2494 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2496 error ("caller edge frequency is too large");
2499 if (gimple_has_body_p (e
->caller
->decl
)
2500 && !e
->caller
->global
.inlined_to
2502 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2503 Remove this once edges are actually removed from the function at that time. */
2505 || (inline_edge_summary_vec
.exists ()
2506 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2507 || !inline_edge_summary (e
)->predicate
)))
2509 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2510 gimple_bb (e
->call_stmt
))))
2512 error ("caller edge frequency %i does not match BB frequency %i",
2514 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2515 gimple_bb (e
->call_stmt
)));
2521 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2523 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple stmt
)
2525 bool fndecl_was_null
= false;
2526 /* debug_gimple_stmt needs correct cfun */
2527 if (cfun
!= this_cfun
)
2528 set_cfun (this_cfun
);
2529 /* ...and an actual current_function_decl */
2530 if (!current_function_decl
)
2532 current_function_decl
= this_cfun
->decl
;
2533 fndecl_was_null
= true;
2535 debug_gimple_stmt (stmt
);
2536 if (fndecl_was_null
)
2537 current_function_decl
= NULL
;
2540 /* Verify that call graph edge E corresponds to DECL from the associated
2541 statement. Return true if the verification should fail. */
2544 verify_edge_corresponds_to_fndecl (cgraph_edge
*e
, tree decl
)
2548 if (!decl
|| e
->callee
->global
.inlined_to
)
2550 if (symtab
->state
== LTO_STREAMING
)
2552 node
= cgraph_node::get (decl
);
2554 /* We do not know if a node from a different partition is an alias or what it
2555 aliases and therefore cannot do the former_clone_of check reliably. When
2556 body_removed is set, we have lost all information about what was alias or
2557 thunk of and also cannot proceed. */
2559 || node
->body_removed
2560 || node
->in_other_partition
2561 || e
->callee
->in_other_partition
)
2564 node
= node
->ultimate_alias_target ();
2566 /* Optimizers can redirect unreachable calls or calls triggering undefined
2567 behaviour to builtin_unreachable. */
2568 if (DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
2569 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
2572 if (e
->callee
->former_clone_of
!= node
->decl
2573 && (node
!= e
->callee
->ultimate_alias_target ())
2574 && !clone_of_p (node
, e
->callee
))
2580 /* Verify cgraph nodes of given cgraph node. */
2582 cgraph_node::verify_node (void)
2585 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2586 basic_block this_block
;
2587 gimple_stmt_iterator gsi
;
2588 bool error_found
= false;
2593 timevar_push (TV_CGRAPH_VERIFY
);
2594 error_found
|= verify_base ();
2595 for (e
= callees
; e
; e
= e
->next_callee
)
2598 error ("aux field set for edge %s->%s",
2599 identifier_to_locale (e
->caller
->name ()),
2600 identifier_to_locale (e
->callee
->name ()));
2605 error ("execution count is negative");
2608 if (global
.inlined_to
&& same_comdat_group
)
2610 error ("inline clone in same comdat group list");
2613 if (!definition
&& !in_other_partition
&& local
.local
)
2615 error ("local symbols must be defined");
2618 if (global
.inlined_to
&& externally_visible
)
2620 error ("externally visible inline clone");
2623 if (global
.inlined_to
&& address_taken
)
2625 error ("inline clone with address taken");
2628 if (global
.inlined_to
&& force_output
)
2630 error ("inline clone is forced to output");
2633 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2637 error ("aux field set for indirect edge from %s",
2638 identifier_to_locale (e
->caller
->name ()));
2641 if (!e
->indirect_unknown_callee
2642 || !e
->indirect_info
)
2644 error ("An indirect edge from %s is not marked as indirect or has "
2645 "associated indirect_info, the corresponding statement is: ",
2646 identifier_to_locale (e
->caller
->name ()));
2647 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2651 bool check_comdat
= comdat_local_p ();
2652 for (e
= callers
; e
; e
= e
->next_caller
)
2654 if (verify_edge_count_and_frequency (e
))
2657 && !in_same_comdat_group_p (e
->caller
))
2659 error ("comdat-local function called by %s outside its comdat",
2660 identifier_to_locale (e
->caller
->name ()));
2663 if (!e
->inline_failed
)
2665 if (global
.inlined_to
2666 != (e
->caller
->global
.inlined_to
2667 ? e
->caller
->global
.inlined_to
: e
->caller
))
2669 error ("inlined_to pointer is wrong");
2672 if (callers
->next_caller
)
2674 error ("multiple inline callers");
2679 if (global
.inlined_to
)
2681 error ("inlined_to pointer set for noninline callers");
2685 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2686 if (verify_edge_count_and_frequency (e
))
2688 if (!callers
&& global
.inlined_to
)
2690 error ("inlined_to pointer is set but no predecessors found");
2693 if (global
.inlined_to
== this)
2695 error ("inlined_to pointer refers to itself");
2702 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2707 error ("cgraph_node has wrong clone_of");
2714 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2715 if (n
->clone_of
!= this)
2719 error ("cgraph_node has wrong clone list");
2723 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2725 error ("cgraph_node is in clone list but it is not clone");
2728 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2730 error ("cgraph_node has wrong prev_clone pointer");
2733 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2735 error ("double linked list of clones corrupted");
2739 if (analyzed
&& alias
)
2741 bool ref_found
= false;
2743 ipa_ref
*ref
= NULL
;
2747 error ("Alias has call edges");
2750 for (i
= 0; iterate_reference (i
, ref
); i
++)
2751 if (ref
->use
!= IPA_REF_ALIAS
)
2753 error ("Alias has non-alias reference");
2758 error ("Alias has more than one alias reference");
2765 error ("Analyzed alias has no reference");
2769 if (analyzed
&& thunk
.thunk_p
)
2773 error ("No edge out of thunk node");
2776 else if (callees
->next_callee
)
2778 error ("More than one edge out of thunk node");
2781 if (gimple_has_body_p (decl
))
2783 error ("Thunk is not supposed to have body");
2787 else if (analyzed
&& gimple_has_body_p (decl
)
2788 && !TREE_ASM_WRITTEN (decl
)
2789 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
2794 hash_set
<gimple
> stmts
;
2796 ipa_ref
*ref
= NULL
;
2798 /* Reach the trees by walking over the CFG, and note the
2799 enclosing basic-blocks in the call edges. */
2800 FOR_EACH_BB_FN (this_block
, this_cfun
)
2802 for (gsi
= gsi_start_phis (this_block
);
2803 !gsi_end_p (gsi
); gsi_next (&gsi
))
2804 stmts
.add (gsi_stmt (gsi
));
2805 for (gsi
= gsi_start_bb (this_block
);
2809 gimple stmt
= gsi_stmt (gsi
);
2811 if (is_gimple_call (stmt
))
2813 cgraph_edge
*e
= get_edge (stmt
);
2814 tree decl
= gimple_call_fndecl (stmt
);
2819 error ("shared call_stmt:");
2820 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2823 if (!e
->indirect_unknown_callee
)
2825 if (verify_edge_corresponds_to_fndecl (e
, decl
))
2827 error ("edge points to wrong declaration:");
2828 debug_tree (e
->callee
->decl
);
2829 fprintf (stderr
," Instead of:");
2836 error ("an indirect edge with unknown callee "
2837 "corresponding to a call_stmt with "
2838 "a known declaration:");
2840 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2846 error ("missing callgraph edge for call stmt:");
2847 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2853 for (i
= 0; iterate_reference (i
, ref
); i
++)
2854 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
2856 error ("reference to dead statement");
2857 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
2862 /* No CFG available?! */
2865 for (e
= callees
; e
; e
= e
->next_callee
)
2869 error ("edge %s->%s has no corresponding call_stmt",
2870 identifier_to_locale (e
->caller
->name ()),
2871 identifier_to_locale (e
->callee
->name ()));
2872 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2877 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2879 if (!e
->aux
&& !e
->speculative
)
2881 error ("an indirect edge from %s has no corresponding call_stmt",
2882 identifier_to_locale (e
->caller
->name ()));
2883 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2892 internal_error ("verify_cgraph_node failed");
2894 timevar_pop (TV_CGRAPH_VERIFY
);
2897 /* Verify whole cgraph structure. */
2899 cgraph_node::verify_cgraph_nodes (void)
2906 FOR_EACH_FUNCTION (node
)
2910 /* Walk the alias chain to return the function cgraph_node is alias of.
2911 Walk through thunk, too.
2912 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
2915 cgraph_node::function_symbol (enum availability
*availability
)
2917 cgraph_node
*node
= this;
2921 node
= node
->ultimate_alias_target (availability
);
2922 if (node
->thunk
.thunk_p
)
2924 node
= node
->callees
->callee
;
2927 enum availability a
;
2928 a
= node
->get_availability ();
2929 if (a
< *availability
)
2932 node
= node
->ultimate_alias_target (availability
);
2934 } while (node
&& node
->thunk
.thunk_p
);
2938 /* When doing LTO, read cgraph_node's body from disk if it is not already
2942 cgraph_node::get_body (void)
2944 lto_file_decl_data
*file_data
;
2945 const char *data
, *name
;
2947 tree decl
= this->decl
;
2949 if (DECL_RESULT (decl
))
2952 gcc_assert (in_lto_p
);
2954 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
2956 file_data
= lto_file_data
;
2957 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
2959 /* We may have renamed the declaration, e.g., a static function. */
2960 name
= lto_get_decl_name_mapping (file_data
, name
);
2962 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
2965 fatal_error ("%s: section %s is missing",
2966 file_data
->file_name
,
2969 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
2971 lto_input_function_body (file_data
, this, data
);
2972 lto_stats
.num_function_bodies
++;
2973 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
2975 lto_free_function_in_decl_state_for_node (this);
2977 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
2982 /* Verify if the type of the argument matches that of the function
2983 declaration. If we cannot verify this or there is a mismatch,
2987 gimple_check_call_args (gimple stmt
, tree fndecl
, bool args_count_match
)
2990 unsigned int i
, nargs
;
2992 /* Calls to internal functions always match their signature. */
2993 if (gimple_call_internal_p (stmt
))
2996 nargs
= gimple_call_num_args (stmt
);
2998 /* Get argument types for verification. */
3000 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3002 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3004 /* Verify if the type of the argument matches that of the function
3005 declaration. If we cannot verify this or there is a mismatch,
3007 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3009 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3011 i
++, p
= DECL_CHAIN (p
))
3014 /* We cannot distinguish a varargs function from the case
3015 of excess parameters, still deferring the inlining decision
3016 to the callee is possible. */
3019 arg
= gimple_call_arg (stmt
, i
);
3020 if (p
== error_mark_node
3021 || DECL_ARG_TYPE (p
) == error_mark_node
3022 || arg
== error_mark_node
3023 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3024 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3027 if (args_count_match
&& p
)
3032 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3035 /* If this is a varargs function defer inlining decision
3039 arg
= gimple_call_arg (stmt
, i
);
3040 if (TREE_VALUE (p
) == error_mark_node
3041 || arg
== error_mark_node
3042 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3043 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3044 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3056 /* Verify if the type of the argument and lhs of CALL_STMT matches
3057 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3058 true, the arg count needs to be the same.
3059 If we cannot verify this or there is a mismatch, return false. */
3062 gimple_check_call_matching_types (gimple call_stmt
, tree callee
,
3063 bool args_count_match
)
3067 if ((DECL_RESULT (callee
)
3068 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3069 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3070 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3072 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3073 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3078 #include "gt-cgraph.h"