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 (flag_devirtualize
&& call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
823 edge
->in_polymorphic_cdtor
824 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
827 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
828 if (call_stmt
&& caller
->call_site_hash
)
829 cgraph_add_edge_to_call_site_hash (edge
);
834 /* Create edge from a given function to CALLEE in the cgraph. */
837 cgraph_node::create_edge (cgraph_node
*callee
,
838 gimple call_stmt
, gcov_type count
, int freq
)
840 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
843 initialize_inline_failed (edge
);
845 edge
->next_caller
= callee
->callers
;
847 callee
->callers
->prev_caller
= edge
;
848 edge
->next_callee
= callees
;
850 callees
->prev_callee
= edge
;
852 callee
->callers
= edge
;
857 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
859 cgraph_indirect_call_info
*
860 cgraph_allocate_init_indirect_info (void)
862 cgraph_indirect_call_info
*ii
;
864 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
865 ii
->param_index
= -1;
869 /* Create an indirect edge with a yet-undetermined callee where the call
870 statement destination is a formal parameter of the caller with index
874 cgraph_node::create_indirect_edge (gimple call_stmt
, int ecf_flags
,
875 gcov_type count
, int freq
,
876 bool compute_indirect_info
)
878 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
882 initialize_inline_failed (edge
);
884 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
885 edge
->indirect_info
->ecf_flags
= ecf_flags
;
886 edge
->indirect_info
->vptr_changed
= true;
888 /* Record polymorphic call info. */
889 if (compute_indirect_info
891 && (target
= gimple_call_fn (call_stmt
))
892 && virtual_method_call_p (target
))
894 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
896 /* Only record types can have virtual calls. */
897 edge
->indirect_info
->polymorphic
= true;
898 edge
->indirect_info
->param_index
= -1;
899 edge
->indirect_info
->otr_token
900 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
901 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
902 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
903 edge
->indirect_info
->context
= context
;
906 edge
->next_callee
= indirect_calls
;
908 indirect_calls
->prev_callee
= edge
;
909 indirect_calls
= edge
;
914 /* Remove the edge from the list of the callers of the callee. */
917 cgraph_edge::remove_callee (void)
919 gcc_assert (!indirect_unknown_callee
);
921 prev_caller
->next_caller
= next_caller
;
923 next_caller
->prev_caller
= prev_caller
;
925 callee
->callers
= next_caller
;
928 /* Remove the edge from the list of the callees of the caller. */
931 cgraph_edge::remove_caller (void)
934 prev_callee
->next_callee
= next_callee
;
936 next_callee
->prev_callee
= prev_callee
;
939 if (indirect_unknown_callee
)
940 caller
->indirect_calls
= next_callee
;
942 caller
->callees
= next_callee
;
944 if (caller
->call_site_hash
)
945 htab_remove_elt_with_hash (caller
->call_site_hash
,
947 htab_hash_pointer (call_stmt
));
950 /* Put the edge onto the free list. */
953 symbol_table::free_edge (cgraph_edge
*e
)
957 if (e
->indirect_info
)
958 ggc_free (e
->indirect_info
);
960 /* Clear out the edge so we do not dangle pointers. */
961 memset (e
, 0, sizeof (*e
));
963 NEXT_FREE_EDGE (e
) = free_edges
;
968 /* Remove the edge in the cgraph. */
971 cgraph_edge::remove (void)
973 /* Call all edge removal hooks. */
974 symtab
->call_edge_removal_hooks (this);
976 if (!indirect_unknown_callee
)
977 /* Remove from callers list of the callee. */
980 /* Remove from callees list of the callers. */
983 /* Put the edge onto the free list. */
984 symtab
->free_edge (this);
987 /* Set callee of call graph edge E and add it to the corresponding set of
991 cgraph_set_edge_callee (cgraph_edge
*e
, cgraph_node
*n
)
993 e
->prev_caller
= NULL
;
995 n
->callers
->prev_caller
= e
;
996 e
->next_caller
= n
->callers
;
1001 /* Turn edge into speculative call calling N2. Update
1002 the profile so the direct call is taken COUNT times
1005 At clone materialization time, the indirect call E will
1008 if (call_dest == N2)
1013 At this time the function just creates the direct call,
1014 the referencd representing the if conditional and attaches
1015 them all to the orginal indirect call statement.
1017 Return direct edge created. */
1020 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1021 int direct_frequency
)
1023 cgraph_node
*n
= caller
;
1024 ipa_ref
*ref
= NULL
;
1029 fprintf (dump_file
, "Indirect call -> speculative call"
1030 " %s/%i => %s/%i\n",
1031 xstrdup (n
->name ()), n
->order
,
1032 xstrdup (n2
->name ()), n2
->order
);
1035 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1036 initialize_inline_failed (e2
);
1037 e2
->speculative
= true;
1038 if (TREE_NOTHROW (n2
->decl
))
1039 e2
->can_throw_external
= false;
1041 e2
->can_throw_external
= can_throw_external
;
1042 e2
->lto_stmt_uid
= lto_stmt_uid
;
1043 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1045 frequency
-= e2
->frequency
;
1046 symtab
->call_edge_duplication_hooks (this, e2
);
1047 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1048 ref
->lto_stmt_uid
= lto_stmt_uid
;
1049 ref
->speculative
= speculative
;
1050 n2
->mark_address_taken ();
1054 /* Speculative call consist of three components:
1055 1) an indirect edge representing the original call
1056 2) an direct edge representing the new call
1057 3) ADDR_EXPR reference representing the speculative check.
1058 All three components are attached to single statement (the indirect
1059 call) and if one of them exists, all of them must exist.
1061 Given speculative call edge, return all three components.
1065 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1066 cgraph_edge
*&indirect
,
1067 ipa_ref
*&reference
)
1072 cgraph_edge
*e
= this;
1074 if (!e
->indirect_unknown_callee
)
1075 for (e2
= e
->caller
->indirect_calls
;
1076 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1077 e2
= e2
->next_callee
)
1082 /* We can take advantage of the call stmt hash. */
1085 e
= e
->caller
->get_edge (e2
->call_stmt
);
1086 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1089 for (e
= e
->caller
->callees
;
1090 e2
->call_stmt
!= e
->call_stmt
1091 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1095 gcc_assert (e
->speculative
&& e2
->speculative
);
1100 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1101 if (ref
->speculative
1102 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1103 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1109 /* Speculative edge always consist of all three components - direct edge,
1110 indirect and reference. */
1112 gcc_assert (e
&& e2
&& ref
);
1115 /* Redirect callee of the edge to N. The function does not update underlying
1119 cgraph_edge::redirect_callee (cgraph_node
*n
)
1121 /* Remove from callers list of the current callee. */
1124 /* Insert to callers list of the new callee. */
1125 cgraph_set_edge_callee (this, n
);
1128 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1129 Remove the speculative call sequence and return edge representing the call.
1130 It is up to caller to redirect the call as appropriate. */
1133 cgraph_edge::resolve_speculation (tree callee_decl
)
1135 cgraph_edge
*edge
= this;
1139 gcc_assert (edge
->speculative
);
1140 edge
->speculative_call_info (e2
, edge
, ref
);
1142 || !ref
->referred
->semantically_equivalent_p
1143 (symtab_node::get (callee_decl
)))
1149 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1150 "turned out to have contradicting known target ",
1151 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1152 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1153 print_generic_expr (dump_file
, callee_decl
, 0);
1154 fprintf (dump_file
, "\n");
1158 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1159 xstrdup (edge
->caller
->name ()), edge
->caller
->order
,
1160 xstrdup (e2
->callee
->name ()), e2
->callee
->order
);
1166 cgraph_edge
*tmp
= edge
;
1168 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1171 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1172 in the functions inlined through it. */
1174 edge
->count
+= e2
->count
;
1175 edge
->frequency
+= e2
->frequency
;
1176 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1177 edge
->frequency
= CGRAPH_FREQ_MAX
;
1178 edge
->speculative
= false;
1179 e2
->speculative
= false;
1180 ref
->remove_reference ();
1181 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1184 e2
->callee
->remove_symbol_and_inline_clones ();
1185 if (edge
->caller
->call_site_hash
)
1186 cgraph_update_edge_in_call_site_hash (edge
);
1190 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1191 CALLEE. DELTA is an integer constant that is to be added to the this
1192 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1195 cgraph_edge::make_direct (cgraph_node
*callee
)
1197 cgraph_edge
*edge
= this;
1198 gcc_assert (indirect_unknown_callee
);
1200 /* If we are redirecting speculative call, make it non-speculative. */
1201 if (indirect_unknown_callee
&& speculative
)
1203 edge
= edge
->resolve_speculation (callee
->decl
);
1205 /* On successful speculation just return the pre existing direct edge. */
1206 if (!indirect_unknown_callee
)
1210 indirect_unknown_callee
= 0;
1211 ggc_free (indirect_info
);
1212 indirect_info
= NULL
;
1214 /* Get the edge out of the indirect edge list. */
1216 prev_callee
->next_callee
= next_callee
;
1218 next_callee
->prev_callee
= prev_callee
;
1220 caller
->indirect_calls
= next_callee
;
1222 /* Put it into the normal callee list */
1224 next_callee
= caller
->callees
;
1225 if (caller
->callees
)
1226 caller
->callees
->prev_callee
= edge
;
1227 caller
->callees
= edge
;
1229 /* Insert to callers list of the new callee. */
1230 cgraph_set_edge_callee (edge
, callee
);
1233 call_stmt_cannot_inline_p
1234 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1237 /* We need to re-determine the inlining status of the edge. */
1238 initialize_inline_failed (edge
);
1242 /* If necessary, change the function declaration in the call statement
1243 associated with E so that it corresponds to the edge callee. */
1246 cgraph_edge::redirect_call_stmt_to_callee (void)
1248 cgraph_edge
*e
= this;
1250 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1251 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1253 gimple_stmt_iterator gsi
;
1254 #ifdef ENABLE_CHECKING
1264 e
->speculative_call_info (e
, e2
, ref
);
1265 /* If there already is an direct call (i.e. as a result of inliner's
1266 substitution), forget about speculating. */
1268 e
= e
->resolve_speculation (decl
);
1269 /* If types do not match, speculation was likely wrong.
1270 The direct edge was posisbly redirected to the clone with a different
1271 signature. We did not update the call statement yet, so compare it
1272 with the reference that still points to the proper type. */
1273 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1274 ref
->referred
->decl
,
1278 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1280 xstrdup (e
->caller
->name ()),
1282 xstrdup (e
->callee
->name ()),
1284 e
= e
->resolve_speculation ();
1285 /* We are producing the final function body and will throw away the
1286 callgraph edges really soon. Reset the counts/frequencies to
1287 keep verifier happy in the case of roundoff errors. */
1288 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1289 e
->frequency
= compute_call_stmt_bb_frequency
1290 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1292 /* Expand speculation into GIMPLE code. */
1297 "Expanding speculative call of %s/%i -> %s/%i count:"
1299 xstrdup (e
->caller
->name ()),
1301 xstrdup (e
->callee
->name ()),
1304 gcc_assert (e2
->speculative
);
1305 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1306 new_stmt
= gimple_ic (e
->call_stmt
, dyn_cast
<cgraph_node
*> (ref
->referred
),
1307 e
->count
|| e2
->count
1308 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1309 e
->count
+ e2
->count
)
1310 : e
->frequency
|| e2
->frequency
1311 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1312 e
->frequency
+ e2
->frequency
)
1313 : REG_BR_PROB_BASE
/ 2,
1314 e
->count
, e
->count
+ e2
->count
);
1315 e
->speculative
= false;
1316 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1318 e
->frequency
= compute_call_stmt_bb_frequency
1319 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1320 e2
->frequency
= compute_call_stmt_bb_frequency
1321 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1322 e2
->speculative
= false;
1323 ref
->speculative
= false;
1325 /* Indirect edges are not both in the call site hash.
1327 if (e
->caller
->call_site_hash
)
1328 cgraph_update_edge_in_call_site_hash (e2
);
1330 /* Continue redirecting E to proper target. */
1334 if (e
->indirect_unknown_callee
1335 || decl
== e
->callee
->decl
)
1336 return e
->call_stmt
;
1338 #ifdef ENABLE_CHECKING
1341 node
= cgraph_node::get (decl
);
1342 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1346 if (symtab
->dump_file
)
1348 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1349 xstrdup (e
->caller
->name ()), e
->caller
->order
,
1350 xstrdup (e
->callee
->name ()), e
->callee
->order
);
1351 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1352 if (e
->callee
->clone
.combined_args_to_skip
)
1354 fprintf (symtab
->dump_file
, " combined args to skip: ");
1355 dump_bitmap (symtab
->dump_file
,
1356 e
->callee
->clone
.combined_args_to_skip
);
1360 if (e
->callee
->clone
.combined_args_to_skip
)
1365 = gimple_call_copy_skip_args (e
->call_stmt
,
1366 e
->callee
->clone
.combined_args_to_skip
);
1367 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1368 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1370 if (gimple_vdef (new_stmt
)
1371 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1372 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1374 gsi
= gsi_for_stmt (e
->call_stmt
);
1375 gsi_replace (&gsi
, new_stmt
, false);
1376 /* We need to defer cleaning EH info on the new statement to
1377 fixup-cfg. We may not have dominator information at this point
1378 and thus would end up with unreachable blocks and have no way
1379 to communicate that we need to run CFG cleanup then. */
1380 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1383 remove_stmt_from_eh_lp (e
->call_stmt
);
1384 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1389 new_stmt
= e
->call_stmt
;
1390 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1391 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1394 /* If the call becomes noreturn, remove the lhs. */
1395 if (lhs
&& (gimple_call_flags (new_stmt
) & ECF_NORETURN
))
1397 if (TREE_CODE (lhs
) == SSA_NAME
)
1399 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1400 TREE_TYPE (lhs
), NULL
);
1401 var
= get_or_create_ssa_default_def
1402 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1403 gimple set_stmt
= gimple_build_assign (lhs
, var
);
1404 gsi
= gsi_for_stmt (new_stmt
);
1405 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1406 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1408 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1409 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1412 /* If new callee has no static chain, remove it. */
1413 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1415 gimple_call_set_chain (new_stmt
, NULL
);
1416 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1419 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1421 if (symtab
->dump_file
)
1423 fprintf (symtab
->dump_file
, " updated to:");
1424 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1429 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1430 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1431 of OLD_STMT if it was previously call statement.
1432 If NEW_STMT is NULL, the call has been dropped without any
1436 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1437 gimple old_stmt
, tree old_call
,
1440 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1441 ? gimple_call_fndecl (new_stmt
) : 0;
1443 /* We are seeing indirect calls, then there is nothing to update. */
1444 if (!new_call
&& !old_call
)
1446 /* See if we turned indirect call into direct call or folded call to one builtin
1447 into different builtin. */
1448 if (old_call
!= new_call
)
1450 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1451 cgraph_edge
*ne
= NULL
;
1457 /* See if the edge is already there and has the correct callee. It
1458 might be so because of indirect inlining has already updated
1459 it. We also might've cloned and redirected the edge. */
1460 if (new_call
&& e
->callee
)
1462 cgraph_node
*callee
= e
->callee
;
1465 if (callee
->decl
== new_call
1466 || callee
->former_clone_of
== new_call
)
1468 e
->set_call_stmt (new_stmt
);
1471 callee
= callee
->clone_of
;
1475 /* Otherwise remove edge and create new one; we can't simply redirect
1476 since function has changed, so inline plan and other information
1477 attached to edge is invalid. */
1479 frequency
= e
->frequency
;
1480 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1483 e
->callee
->remove_symbol_and_inline_clones ();
1487 /* We are seeing new direct call; compute profile info based on BB. */
1488 basic_block bb
= gimple_bb (new_stmt
);
1490 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1496 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1497 new_stmt
, count
, frequency
);
1498 gcc_assert (ne
->inline_failed
);
1501 /* We only updated the call stmt; update pointer in cgraph edge.. */
1502 else if (old_stmt
!= new_stmt
)
1503 node
->get_edge (old_stmt
)->set_call_stmt (new_stmt
);
1506 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1507 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1508 of OLD_STMT before it was updated (updating can happen inplace). */
1511 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1513 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1516 gcc_checking_assert (orig
);
1517 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1519 for (node
= orig
->clones
; node
!= orig
;)
1521 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1523 node
= node
->clones
;
1524 else if (node
->next_sibling_clone
)
1525 node
= node
->next_sibling_clone
;
1528 while (node
!= orig
&& !node
->next_sibling_clone
)
1529 node
= node
->clone_of
;
1531 node
= node
->next_sibling_clone
;
1537 /* Remove all callees from the node. */
1540 cgraph_node::remove_callees (void)
1544 /* It is sufficient to remove the edges from the lists of callers of
1545 the callees. The callee list of the node can be zapped with one
1547 for (e
= callees
; 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 for (e
= indirect_calls
; e
; e
= f
)
1558 symtab
->call_edge_removal_hooks (e
);
1559 if (!e
->indirect_unknown_callee
)
1560 e
->remove_callee ();
1561 symtab
->free_edge (e
);
1563 indirect_calls
= NULL
;
1567 htab_delete (call_site_hash
);
1568 call_site_hash
= NULL
;
1572 /* Remove all callers from the node. */
1575 cgraph_node::remove_callers (void)
1579 /* It is sufficient to remove the edges from the lists of callees of
1580 the callers. The caller list of the node can be zapped with one
1582 for (e
= callers
; e
; e
= f
)
1585 symtab
->call_edge_removal_hooks (e
);
1586 e
->remove_caller ();
1587 symtab
->free_edge (e
);
1592 /* Helper function for cgraph_release_function_body and free_lang_data.
1593 It releases body from function DECL without having to inspect its
1594 possibly non-existent symtab node. */
1597 release_function_body (tree decl
)
1599 if (DECL_STRUCT_FUNCTION (decl
))
1601 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1605 cfun
->curr_properties
&= ~PROP_loops
;
1606 loop_optimizer_finalize ();
1608 if (cfun
->gimple_df
)
1611 delete_tree_cfg_annotations ();
1616 gcc_assert (!dom_info_available_p (CDI_DOMINATORS
));
1617 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS
));
1621 if (cfun
->value_histograms
)
1624 gimple_set_body (decl
, NULL
);
1625 /* Struct function hangs a lot of data that would leak if we didn't
1626 removed all pointers to it. */
1627 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1628 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1630 DECL_SAVED_TREE (decl
) = NULL
;
1633 /* Release memory used to represent body of function.
1634 Use this only for functions that are released before being translated to
1635 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1636 are free'd in final.c via free_after_compilation().
1637 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1640 cgraph_node::release_body (bool keep_arguments
)
1642 ipa_transforms_to_apply
.release ();
1643 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1645 DECL_RESULT (decl
) = NULL
;
1647 if (!keep_arguments
)
1648 DECL_ARGUMENTS (decl
) = NULL
;
1650 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1651 of its associated function function declaration because it's
1652 needed to emit debug info later. */
1653 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1654 DECL_INITIAL (decl
) = error_mark_node
;
1655 release_function_body (decl
);
1657 lto_free_function_in_decl_state_for_node (this);
1660 /* Remove function from symbol table. */
1663 cgraph_node::remove (void)
1666 int uid
= this->uid
;
1668 symtab
->call_cgraph_removal_hooks (this);
1671 ipa_transforms_to_apply
.release ();
1673 /* Incremental inlining access removed nodes stored in the postorder list.
1675 force_output
= false;
1676 forced_by_abi
= false;
1677 for (n
= nested
; n
; n
= n
->next_nested
)
1682 cgraph_node
**node2
= &origin
->nested
;
1684 while (*node2
!= this)
1685 node2
= &(*node2
)->next_nested
;
1686 *node2
= next_nested
;
1689 if (prev_sibling_clone
)
1690 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1692 clone_of
->clones
= next_sibling_clone
;
1693 if (next_sibling_clone
)
1694 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1697 cgraph_node
*n
, *next
;
1701 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1702 n
->clone_of
= clone_of
;
1703 n
->clone_of
= clone_of
;
1704 n
->next_sibling_clone
= clone_of
->clones
;
1705 if (clone_of
->clones
)
1706 clone_of
->clones
->prev_sibling_clone
= n
;
1707 clone_of
->clones
= clones
;
1711 /* We are removing node with clones. This makes clones inconsistent,
1712 but assume they will be removed subsequently and just keep clone
1713 tree intact. This can happen in unreachable function removal since
1714 we remove unreachable functions in random order, not by bottom-up
1715 walk of clone trees. */
1716 for (n
= clones
; n
; n
= next
)
1718 next
= n
->next_sibling_clone
;
1719 n
->next_sibling_clone
= NULL
;
1720 n
->prev_sibling_clone
= NULL
;
1726 /* While all the clones are removed after being proceeded, the function
1727 itself is kept in the cgraph even after it is compiled. Check whether
1728 we are done with this body and reclaim it proactively if this is the case.
1730 if (symtab
->state
!= LTO_STREAMING
)
1732 n
= cgraph_node::get (decl
);
1734 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1735 && (symtab
->global_info_ready
1736 && (TREE_ASM_WRITTEN (n
->decl
)
1737 || DECL_EXTERNAL (n
->decl
)
1739 || (!flag_wpa
&& n
->in_other_partition
)))))
1746 htab_delete (call_site_hash
);
1747 call_site_hash
= NULL
;
1750 symtab
->release_symbol (this, uid
);
1753 /* Likewise indicate that a node is having address taken. */
1756 cgraph_node::mark_address_taken (void)
1758 /* Indirect inlining can figure out that all uses of the address are
1760 if (global
.inlined_to
)
1762 gcc_assert (cfun
->after_inlining
);
1763 gcc_assert (callers
->indirect_inlining_edge
);
1766 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1767 IPA_REF_ADDR reference exists (and thus it should be set on node
1768 representing alias we take address of) and as a test whether address
1769 of the object was taken (and thus it should be set on node alias is
1770 referring to). We should remove the first use and the remove the
1773 cgraph_node
*node
= ultimate_alias_target ();
1774 node
->address_taken
= 1;
1777 /* Return local info for the compiled function. */
1780 cgraph_node::local_info (tree decl
)
1782 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1783 cgraph_node
*node
= get (decl
);
1786 return &node
->local
;
1789 /* Return global info for the compiled function. */
1791 cgraph_global_info
*
1792 cgraph_node::global_info (tree decl
)
1794 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1795 && symtab
->global_info_ready
);
1796 cgraph_node
*node
= get (decl
);
1799 return &node
->global
;
1802 /* Return local info for the compiled function. */
1805 cgraph_node::rtl_info (tree decl
)
1807 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1808 cgraph_node
*node
= get (decl
);
1810 || (decl
!= current_function_decl
1811 && !TREE_ASM_WRITTEN (node
->decl
)))
1816 /* Return a string describing the failure REASON. */
1819 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1822 #define DEFCIFCODE(code, type, string) string,
1824 static const char *cif_string_table
[CIF_N_REASONS
] = {
1825 #include "cif-code.def"
1828 /* Signedness of an enum type is implementation defined, so cast it
1829 to unsigned before testing. */
1830 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1831 return cif_string_table
[reason
];
1834 /* Return a type describing the failure REASON. */
1836 cgraph_inline_failed_type_t
1837 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1840 #define DEFCIFCODE(code, type, string) type,
1842 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1843 #include "cif-code.def"
1846 /* Signedness of an enum type is implementation defined, so cast it
1847 to unsigned before testing. */
1848 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1849 return cif_type_table
[reason
];
1852 /* Names used to print out the availability enum. */
1853 const char * const cgraph_availability_names
[] =
1854 {"unset", "not_available", "overwritable", "available", "local"};
1856 /* Output flags of edge E. */
1859 dump_edge_flags (FILE *f
, struct cgraph_edge
*edge
)
1861 if (edge
->speculative
)
1862 fprintf (f
, "(speculative) ");
1863 if (!edge
->inline_failed
)
1864 fprintf (f
, "(inlined) ");
1865 if (edge
->indirect_inlining_edge
)
1866 fprintf (f
, "(indirect_inlining) ");
1868 fprintf (f
, "(%"PRId64
"x) ",
1869 (int64_t)edge
->count
);
1870 if (edge
->frequency
)
1871 fprintf (f
, "(%.2f per call) ",
1872 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1873 if (edge
->can_throw_external
)
1874 fprintf (f
, "(can throw external) ");
1877 /* Dump call graph node to file F. */
1880 cgraph_node::dump (FILE *f
)
1886 if (global
.inlined_to
)
1887 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1890 xstrdup (global
.inlined_to
->name ()),
1891 global
.inlined_to
->order
);
1893 fprintf (f
, " Clone of %s/%i\n",
1894 clone_of
->asm_name (),
1896 if (symtab
->function_flags_ready
)
1897 fprintf (f
, " Availability: %s\n",
1898 cgraph_availability_names
[get_availability ()]);
1901 fprintf (f
, " Profile id: %i\n",
1903 fprintf (f
, " First run: %i\n", tp_first_run
);
1904 fprintf (f
, " Function flags:");
1906 fprintf (f
, " executed %"PRId64
"x",
1909 fprintf (f
, " nested in: %s", origin
->asm_name ());
1910 if (gimple_has_body_p (decl
))
1911 fprintf (f
, " body");
1913 fprintf (f
, " process");
1915 fprintf (f
, " local");
1916 if (local
.redefined_extern_inline
)
1917 fprintf (f
, " redefined_extern_inline");
1918 if (only_called_at_startup
)
1919 fprintf (f
, " only_called_at_startup");
1920 if (only_called_at_exit
)
1921 fprintf (f
, " only_called_at_exit");
1923 fprintf (f
, " tm_clone");
1924 if (DECL_STATIC_CONSTRUCTOR (decl
))
1925 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
1926 if (DECL_STATIC_DESTRUCTOR (decl
))
1927 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
1933 fprintf (f
, " Thunk");
1935 fprintf (f
, " of %s (asm: %s)",
1936 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
1937 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
1938 fprintf (f
, " fixed offset %i virtual value %i has "
1939 "virtual offset %i)\n",
1940 (int)thunk
.fixed_offset
,
1941 (int)thunk
.virtual_value
,
1942 (int)thunk
.virtual_offset_p
);
1944 if (alias
&& thunk
.alias
1945 && DECL_P (thunk
.alias
))
1947 fprintf (f
, " Alias of %s",
1948 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
1949 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
1950 fprintf (f
, " (asm: %s)",
1951 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
1955 fprintf (f
, " Called by: ");
1957 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
1959 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
1960 edge
->caller
->order
);
1961 dump_edge_flags (f
, edge
);
1964 fprintf (f
, "\n Calls: ");
1965 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
1967 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
1968 edge
->callee
->order
);
1969 dump_edge_flags (f
, edge
);
1973 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
1975 if (edge
->indirect_info
->polymorphic
)
1977 fprintf (f
, " Polymorphic indirect call of type ");
1978 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
1979 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
1982 fprintf (f
, " Indirect call");
1983 dump_edge_flags (f
, edge
);
1984 if (edge
->indirect_info
->param_index
!= -1)
1986 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
1987 if (edge
->indirect_info
->agg_contents
)
1988 fprintf (f
, " loaded from %s %s at offset %i",
1989 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
1990 edge
->indirect_info
->by_ref
? "passed by reference":"",
1991 (int)edge
->indirect_info
->offset
);
1992 if (edge
->indirect_info
->vptr_changed
)
1993 fprintf (f
, " (vptr maybe changed)");
1996 if (edge
->indirect_info
->polymorphic
)
1997 edge
->indirect_info
->context
.dump (f
);
2001 /* Dump call graph node NODE to stderr. */
2004 cgraph_node::debug (void)
2009 /* Dump the callgraph to file F. */
2012 cgraph_node::dump_cgraph (FILE *f
)
2016 fprintf (f
, "callgraph:\n\n");
2017 FOR_EACH_FUNCTION (node
)
2021 /* Return true when the DECL can possibly be inlined. */
2024 cgraph_function_possibly_inlined_p (tree decl
)
2026 if (!symtab
->global_info_ready
)
2027 return !DECL_UNINLINABLE (decl
);
2028 return DECL_POSSIBLY_INLINED (decl
);
2031 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2033 cgraph_node::unnest (void)
2035 cgraph_node
**node2
= &origin
->nested
;
2036 gcc_assert (origin
);
2038 while (*node2
!= this)
2039 node2
= &(*node2
)->next_nested
;
2040 *node2
= next_nested
;
2044 /* Return function availability. See cgraph.h for description of individual
2047 cgraph_node::get_availability (void)
2049 enum availability avail
;
2051 avail
= AVAIL_NOT_AVAILABLE
;
2052 else if (local
.local
)
2053 avail
= AVAIL_LOCAL
;
2054 else if (alias
&& weakref
)
2055 ultimate_alias_target (&avail
);
2056 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2057 avail
= AVAIL_INTERPOSABLE
;
2058 else if (!externally_visible
)
2059 avail
= AVAIL_AVAILABLE
;
2060 /* Inline functions are safe to be analyzed even if their symbol can
2061 be overwritten at runtime. It is not meaningful to enforce any sane
2062 behaviour on replacing inline function by different body. */
2063 else if (DECL_DECLARED_INLINE_P (decl
))
2064 avail
= AVAIL_AVAILABLE
;
2066 /* If the function can be overwritten, return OVERWRITABLE. Take
2067 care at least of two notable extensions - the COMDAT functions
2068 used to share template instantiations in C++ (this is symmetric
2069 to code cp_cannot_inline_tree_fn and probably shall be shared and
2070 the inlinability hooks completely eliminated).
2072 ??? Does the C++ one definition rule allow us to always return
2073 AVAIL_AVAILABLE here? That would be good reason to preserve this
2076 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2077 avail
= AVAIL_INTERPOSABLE
;
2078 else avail
= AVAIL_AVAILABLE
;
2083 /* Worker for cgraph_node_can_be_local_p. */
2085 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2087 return !(!node
->force_output
2088 && ((DECL_COMDAT (node
->decl
)
2089 && !node
->forced_by_abi
2090 && !node
->used_from_object_file_p ()
2091 && !node
->same_comdat_group
)
2092 || !node
->externally_visible
));
2095 /* Return true if cgraph_node can be made local for API change.
2096 Extern inline functions and C++ COMDAT functions can be made local
2097 at the expense of possible code size growth if function is used in multiple
2098 compilation units. */
2100 cgraph_node::can_be_local_p (void)
2102 return (!address_taken
2103 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2107 /* Call calback on cgraph_node, thunks and aliases associated to cgraph_node.
2108 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2112 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2113 (cgraph_node
*, void *),
2115 bool include_overwritable
)
2120 if (callback (this, data
))
2122 for (e
= callers
; e
; e
= e
->next_caller
)
2123 if (e
->caller
->thunk
.thunk_p
2124 && (include_overwritable
2125 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
))
2126 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2127 include_overwritable
))
2130 FOR_EACH_ALIAS (this, ref
)
2132 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2133 if (include_overwritable
2134 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2135 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2136 include_overwritable
))
2142 /* Call calback on function and aliases associated to the function.
2143 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2147 cgraph_node::call_for_symbol_and_aliases (bool (*callback
) (cgraph_node
*,
2150 bool include_overwritable
)
2154 if (callback (this, data
))
2157 FOR_EACH_ALIAS (this, ref
)
2159 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2160 if (include_overwritable
2161 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2162 if (alias
->call_for_symbol_and_aliases (callback
, data
,
2163 include_overwritable
))
2169 /* Worker to bring NODE local. */
2172 cgraph_node::make_local (cgraph_node
*node
, void *)
2174 gcc_checking_assert (node
->can_be_local_p ());
2175 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2177 node
->make_decl_local ();
2178 node
->set_section (NULL
);
2179 node
->set_comdat_group (NULL
);
2180 node
->externally_visible
= false;
2181 node
->forced_by_abi
= false;
2182 node
->local
.local
= true;
2183 node
->set_section (NULL
);
2184 node
->unique_name
= (node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2185 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2186 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2187 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2192 /* Bring cgraph node local. */
2195 cgraph_node::make_local (void)
2197 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2200 /* Worker to set nothrow flag. */
2203 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2207 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2210 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2211 e
->can_throw_external
= false;
2215 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2216 if any to NOTHROW. */
2219 cgraph_node::set_nothrow_flag (bool nothrow
)
2221 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2222 (void *)(size_t)nothrow
, false);
2225 /* Worker to set const flag. */
2228 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2230 /* Static constructors and destructors without a side effect can be
2232 if (data
&& !((size_t)data
& 2))
2234 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2235 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2236 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2237 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2239 TREE_READONLY (node
->decl
) = data
!= NULL
;
2240 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2244 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2245 if any to READONLY. */
2248 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2250 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2251 (void *)(size_t)(readonly
+ (int)looping
* 2),
2255 /* Worker to set pure flag. */
2258 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2260 /* Static constructors and destructors without a side effect can be
2262 if (data
&& !((size_t)data
& 2))
2264 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2265 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2266 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2267 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2269 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2270 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2274 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2278 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2280 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2281 (void *)(size_t)(pure
+ (int)looping
* 2),
2285 /* Return true when cgraph_node can not return or throw and thus
2286 it is safe to ignore its side effects for IPA analysis. */
2289 cgraph_node::cannot_return_p (void)
2291 int flags
= flags_from_decl_or_type (decl
);
2292 if (!flag_exceptions
)
2293 return (flags
& ECF_NORETURN
) != 0;
2295 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2296 == (ECF_NORETURN
| ECF_NOTHROW
));
2299 /* Return true when call of edge can not lead to return from caller
2300 and thus it is safe to ignore its side effects for IPA analysis
2301 when computing side effects of the caller.
2302 FIXME: We could actually mark all edges that have no reaching
2303 patch to the exit block or throw to get better results. */
2305 cgraph_edge::cannot_lead_to_return_p (void)
2307 if (caller
->cannot_return_p ())
2309 if (indirect_unknown_callee
)
2311 int flags
= indirect_info
->ecf_flags
;
2312 if (!flag_exceptions
)
2313 return (flags
& ECF_NORETURN
) != 0;
2315 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2316 == (ECF_NORETURN
| ECF_NOTHROW
));
2319 return callee
->cannot_return_p ();
2322 /* Return true when function can be removed from callgraph
2323 if all direct calls are eliminated. */
2326 cgraph_node::can_remove_if_no_direct_calls_and_refs_p (void)
2328 gcc_assert (!global
.inlined_to
);
2329 /* Extern inlines can always go, we will use the external definition. */
2330 if (DECL_EXTERNAL (decl
))
2332 /* When function is needed, we can not remove it. */
2333 if (force_output
|| used_from_other_partition
)
2335 if (DECL_STATIC_CONSTRUCTOR (decl
)
2336 || DECL_STATIC_DESTRUCTOR (decl
))
2338 /* Only COMDAT functions can be removed if externally visible. */
2339 if (externally_visible
2340 && (!DECL_COMDAT (decl
)
2342 || used_from_object_file_p ()))
2347 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2350 nonremovable_p (cgraph_node
*node
, void *)
2352 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2355 /* Return true when function cgraph_node and its aliases can be removed from
2356 callgraph if all direct calls are eliminated. */
2359 cgraph_node::can_remove_if_no_direct_calls_p (void)
2361 /* Extern inlines can always go, we will use the external definition. */
2362 if (DECL_EXTERNAL (decl
))
2366 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2369 /* Return true when function cgraph_node can be expected to be removed
2370 from program when direct calls in this compilation unit are removed.
2372 As a special case COMDAT functions are
2373 cgraph_can_remove_if_no_direct_calls_p while the are not
2374 cgraph_only_called_directly_p (it is possible they are called from other
2377 This function behaves as cgraph_only_called_directly_p because eliminating
2378 all uses of COMDAT function does not make it necessarily disappear from
2379 the program unless we are compiling whole program or we do LTO. In this
2380 case we know we win since dynamic linking will not really discard the
2381 linkonce section. */
2384 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p (void)
2386 gcc_assert (!global
.inlined_to
);
2388 if (call_for_symbol_and_aliases (used_from_object_file_p_worker
,
2391 if (!in_lto_p
&& !flag_whole_program
)
2392 return only_called_directly_p ();
2395 if (DECL_EXTERNAL (decl
))
2397 return can_remove_if_no_direct_calls_p ();
2402 /* Worker for cgraph_only_called_directly_p. */
2405 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2407 return !node
->only_called_directly_or_aliased_p ();
2410 /* Return true when function cgraph_node and all its aliases are only called
2412 i.e. it is not externally visible, address was not taken and
2413 it is not used in any other non-standard way. */
2416 cgraph_node::only_called_directly_p (void)
2418 gcc_assert (ultimate_alias_target () == this);
2419 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2424 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2427 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2429 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2431 enum availability avail
;
2432 node
->ultimate_alias_target (&avail
);
2434 if (avail
> AVAIL_INTERPOSABLE
)
2435 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2436 if (!cs
->indirect_inlining_edge
)
2437 redirect_callers
->safe_push (cs
);
2441 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2442 cgraph_node (i.e. are not overwritable). */
2445 cgraph_node::collect_callers (void)
2447 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2448 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2449 &redirect_callers
, false);
2450 return redirect_callers
;
2453 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2456 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2458 bool skipped_thunk
= false;
2459 node
= node
->ultimate_alias_target ();
2460 node2
= node2
->ultimate_alias_target ();
2462 /* There are no virtual clones of thunks so check former_clone_of or if we
2463 might have skipped thunks because this adjustments are no longer
2465 while (node
->thunk
.thunk_p
)
2467 if (node2
->former_clone_of
== node
->decl
)
2469 if (!node
->thunk
.this_adjusting
)
2471 node
= node
->callees
->callee
->ultimate_alias_target ();
2472 skipped_thunk
= true;
2477 if (!node2
->clone
.args_to_skip
2478 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2480 if (node2
->former_clone_of
== node
->decl
)
2482 else if (!node2
->clone_of
)
2486 while (node
!= node2
&& node2
)
2487 node2
= node2
->clone_of
;
2488 return node2
!= NULL
;
2491 /* Verify edge E count and frequency. */
2494 verify_edge_count_and_frequency (cgraph_edge
*e
)
2496 bool error_found
= false;
2499 error ("caller edge count is negative");
2502 if (e
->frequency
< 0)
2504 error ("caller edge frequency is negative");
2507 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2509 error ("caller edge frequency is too large");
2512 if (gimple_has_body_p (e
->caller
->decl
)
2513 && !e
->caller
->global
.inlined_to
2515 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2516 Remove this once edges are actually removed from the function at that time. */
2518 || (inline_edge_summary_vec
.exists ()
2519 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2520 || !inline_edge_summary (e
)->predicate
)))
2522 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2523 gimple_bb (e
->call_stmt
))))
2525 error ("caller edge frequency %i does not match BB frequency %i",
2527 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2528 gimple_bb (e
->call_stmt
)));
2534 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2536 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple stmt
)
2538 bool fndecl_was_null
= false;
2539 /* debug_gimple_stmt needs correct cfun */
2540 if (cfun
!= this_cfun
)
2541 set_cfun (this_cfun
);
2542 /* ...and an actual current_function_decl */
2543 if (!current_function_decl
)
2545 current_function_decl
= this_cfun
->decl
;
2546 fndecl_was_null
= true;
2548 debug_gimple_stmt (stmt
);
2549 if (fndecl_was_null
)
2550 current_function_decl
= NULL
;
2553 /* Verify that call graph edge E corresponds to DECL from the associated
2554 statement. Return true if the verification should fail. */
2557 verify_edge_corresponds_to_fndecl (cgraph_edge
*e
, tree decl
)
2561 if (!decl
|| e
->callee
->global
.inlined_to
)
2563 if (symtab
->state
== LTO_STREAMING
)
2565 node
= cgraph_node::get (decl
);
2567 /* We do not know if a node from a different partition is an alias or what it
2568 aliases and therefore cannot do the former_clone_of check reliably. When
2569 body_removed is set, we have lost all information about what was alias or
2570 thunk of and also cannot proceed. */
2572 || node
->body_removed
2573 || node
->in_other_partition
2574 || e
->callee
->in_other_partition
)
2577 node
= node
->ultimate_alias_target ();
2579 /* Optimizers can redirect unreachable calls or calls triggering undefined
2580 behaviour to builtin_unreachable. */
2581 if (DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
2582 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
2585 if (e
->callee
->former_clone_of
!= node
->decl
2586 && (node
!= e
->callee
->ultimate_alias_target ())
2587 && !clone_of_p (node
, e
->callee
))
2593 /* Verify cgraph nodes of given cgraph node. */
2595 cgraph_node::verify_node (void)
2598 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2599 basic_block this_block
;
2600 gimple_stmt_iterator gsi
;
2601 bool error_found
= false;
2606 timevar_push (TV_CGRAPH_VERIFY
);
2607 error_found
|= verify_base ();
2608 for (e
= callees
; e
; e
= e
->next_callee
)
2611 error ("aux field set for edge %s->%s",
2612 identifier_to_locale (e
->caller
->name ()),
2613 identifier_to_locale (e
->callee
->name ()));
2618 error ("execution count is negative");
2621 if (global
.inlined_to
&& same_comdat_group
)
2623 error ("inline clone in same comdat group list");
2626 if (!definition
&& !in_other_partition
&& local
.local
)
2628 error ("local symbols must be defined");
2631 if (global
.inlined_to
&& externally_visible
)
2633 error ("externally visible inline clone");
2636 if (global
.inlined_to
&& address_taken
)
2638 error ("inline clone with address taken");
2641 if (global
.inlined_to
&& force_output
)
2643 error ("inline clone is forced to output");
2646 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2650 error ("aux field set for indirect edge from %s",
2651 identifier_to_locale (e
->caller
->name ()));
2654 if (!e
->indirect_unknown_callee
2655 || !e
->indirect_info
)
2657 error ("An indirect edge from %s is not marked as indirect or has "
2658 "associated indirect_info, the corresponding statement is: ",
2659 identifier_to_locale (e
->caller
->name ()));
2660 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2664 bool check_comdat
= comdat_local_p ();
2665 for (e
= callers
; e
; e
= e
->next_caller
)
2667 if (verify_edge_count_and_frequency (e
))
2670 && !in_same_comdat_group_p (e
->caller
))
2672 error ("comdat-local function called by %s outside its comdat",
2673 identifier_to_locale (e
->caller
->name ()));
2676 if (!e
->inline_failed
)
2678 if (global
.inlined_to
2679 != (e
->caller
->global
.inlined_to
2680 ? e
->caller
->global
.inlined_to
: e
->caller
))
2682 error ("inlined_to pointer is wrong");
2685 if (callers
->next_caller
)
2687 error ("multiple inline callers");
2692 if (global
.inlined_to
)
2694 error ("inlined_to pointer set for noninline callers");
2698 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2699 if (verify_edge_count_and_frequency (e
))
2701 if (!callers
&& global
.inlined_to
)
2703 error ("inlined_to pointer is set but no predecessors found");
2706 if (global
.inlined_to
== this)
2708 error ("inlined_to pointer refers to itself");
2715 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2720 error ("cgraph_node has wrong clone_of");
2727 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2728 if (n
->clone_of
!= this)
2732 error ("cgraph_node has wrong clone list");
2736 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2738 error ("cgraph_node is in clone list but it is not clone");
2741 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2743 error ("cgraph_node has wrong prev_clone pointer");
2746 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2748 error ("double linked list of clones corrupted");
2752 if (analyzed
&& alias
)
2754 bool ref_found
= false;
2756 ipa_ref
*ref
= NULL
;
2760 error ("Alias has call edges");
2763 for (i
= 0; iterate_reference (i
, ref
); i
++)
2764 if (ref
->use
!= IPA_REF_ALIAS
)
2766 error ("Alias has non-alias reference");
2771 error ("Alias has more than one alias reference");
2778 error ("Analyzed alias has no reference");
2782 if (analyzed
&& thunk
.thunk_p
)
2786 error ("No edge out of thunk node");
2789 else if (callees
->next_callee
)
2791 error ("More than one edge out of thunk node");
2794 if (gimple_has_body_p (decl
))
2796 error ("Thunk is not supposed to have body");
2800 else if (analyzed
&& gimple_has_body_p (decl
)
2801 && !TREE_ASM_WRITTEN (decl
)
2802 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
2807 hash_set
<gimple
> stmts
;
2809 ipa_ref
*ref
= NULL
;
2811 /* Reach the trees by walking over the CFG, and note the
2812 enclosing basic-blocks in the call edges. */
2813 FOR_EACH_BB_FN (this_block
, this_cfun
)
2815 for (gsi
= gsi_start_phis (this_block
);
2816 !gsi_end_p (gsi
); gsi_next (&gsi
))
2817 stmts
.add (gsi_stmt (gsi
));
2818 for (gsi
= gsi_start_bb (this_block
);
2822 gimple stmt
= gsi_stmt (gsi
);
2824 if (is_gimple_call (stmt
))
2826 cgraph_edge
*e
= get_edge (stmt
);
2827 tree decl
= gimple_call_fndecl (stmt
);
2832 error ("shared call_stmt:");
2833 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2836 if (!e
->indirect_unknown_callee
)
2838 if (verify_edge_corresponds_to_fndecl (e
, decl
))
2840 error ("edge points to wrong declaration:");
2841 debug_tree (e
->callee
->decl
);
2842 fprintf (stderr
," Instead of:");
2849 error ("an indirect edge with unknown callee "
2850 "corresponding to a call_stmt with "
2851 "a known declaration:");
2853 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2859 error ("missing callgraph edge for call stmt:");
2860 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2866 for (i
= 0; iterate_reference (i
, ref
); i
++)
2867 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
2869 error ("reference to dead statement");
2870 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
2875 /* No CFG available?! */
2878 for (e
= callees
; e
; e
= e
->next_callee
)
2882 error ("edge %s->%s has no corresponding call_stmt",
2883 identifier_to_locale (e
->caller
->name ()),
2884 identifier_to_locale (e
->callee
->name ()));
2885 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2890 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2892 if (!e
->aux
&& !e
->speculative
)
2894 error ("an indirect edge from %s has no corresponding call_stmt",
2895 identifier_to_locale (e
->caller
->name ()));
2896 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2905 internal_error ("verify_cgraph_node failed");
2907 timevar_pop (TV_CGRAPH_VERIFY
);
2910 /* Verify whole cgraph structure. */
2912 cgraph_node::verify_cgraph_nodes (void)
2919 FOR_EACH_FUNCTION (node
)
2923 /* Walk the alias chain to return the function cgraph_node is alias of.
2924 Walk through thunk, too.
2925 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
2928 cgraph_node::function_symbol (enum availability
*availability
)
2930 cgraph_node
*node
= this;
2934 node
= node
->ultimate_alias_target (availability
);
2935 if (node
->thunk
.thunk_p
)
2937 node
= node
->callees
->callee
;
2940 enum availability a
;
2941 a
= node
->get_availability ();
2942 if (a
< *availability
)
2945 node
= node
->ultimate_alias_target (availability
);
2947 } while (node
&& node
->thunk
.thunk_p
);
2951 /* When doing LTO, read cgraph_node's body from disk if it is not already
2955 cgraph_node::get_body (void)
2957 lto_file_decl_data
*file_data
;
2958 const char *data
, *name
;
2960 tree decl
= this->decl
;
2962 if (DECL_RESULT (decl
))
2965 gcc_assert (in_lto_p
);
2967 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
2969 file_data
= lto_file_data
;
2970 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
2972 /* We may have renamed the declaration, e.g., a static function. */
2973 name
= lto_get_decl_name_mapping (file_data
, name
);
2975 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
2978 fatal_error ("%s: section %s is missing",
2979 file_data
->file_name
,
2982 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
2984 lto_input_function_body (file_data
, this, data
);
2985 lto_stats
.num_function_bodies
++;
2986 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
2988 lto_free_function_in_decl_state_for_node (this);
2990 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
2995 /* Verify if the type of the argument matches that of the function
2996 declaration. If we cannot verify this or there is a mismatch,
3000 gimple_check_call_args (gimple stmt
, tree fndecl
, bool args_count_match
)
3003 unsigned int i
, nargs
;
3005 /* Calls to internal functions always match their signature. */
3006 if (gimple_call_internal_p (stmt
))
3009 nargs
= gimple_call_num_args (stmt
);
3011 /* Get argument types for verification. */
3013 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3015 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3017 /* Verify if the type of the argument matches that of the function
3018 declaration. If we cannot verify this or there is a mismatch,
3020 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3022 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3024 i
++, p
= DECL_CHAIN (p
))
3027 /* We cannot distinguish a varargs function from the case
3028 of excess parameters, still deferring the inlining decision
3029 to the callee is possible. */
3032 arg
= gimple_call_arg (stmt
, i
);
3033 if (p
== error_mark_node
3034 || DECL_ARG_TYPE (p
) == error_mark_node
3035 || arg
== error_mark_node
3036 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3037 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3040 if (args_count_match
&& p
)
3045 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3048 /* If this is a varargs function defer inlining decision
3052 arg
= gimple_call_arg (stmt
, i
);
3053 if (TREE_VALUE (p
) == error_mark_node
3054 || arg
== error_mark_node
3055 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3056 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3057 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3069 /* Verify if the type of the argument and lhs of CALL_STMT matches
3070 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3071 true, the arg count needs to be the same.
3072 If we cannot verify this or there is a mismatch, return false. */
3075 gimple_check_call_matching_types (gimple call_stmt
, tree callee
,
3076 bool args_count_match
)
3080 if ((DECL_RESULT (callee
)
3081 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3082 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3083 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3085 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3086 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3091 #include "gt-cgraph.h"