1 /* Callgraph handling code.
2 Copyright (C) 2003-2016 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file contains basic routines manipulating call graph
23 The call-graph is a data structure designed for intra-procedural optimization.
24 It represents a multi-graph where nodes are functions and edges are call sites. */
28 #include "coretypes.h"
35 #include "alloc-pool.h"
36 #include "gimple-ssa.h"
38 #include "lto-streamer.h"
39 #include "fold-const.h"
42 #include "print-tree.h"
43 #include "langhooks.h"
46 #include "gimple-iterator.h"
49 #include "value-prof.h"
50 #include "ipa-utils.h"
51 #include "symbol-summary.h"
53 #include "ipa-inline.h"
55 #include "gimple-pretty-print.h"
59 #include "tree-chkp.h"
63 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
64 #include "tree-pass.h"
66 /* Queue of cgraph nodes scheduled to be lowered. */
67 symtab_node
*x_cgraph_nodes_queue
;
68 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
70 /* Symbol table global context. */
73 /* List of hooks triggered on cgraph_edge events. */
74 struct cgraph_edge_hook_list
{
75 cgraph_edge_hook hook
;
77 struct cgraph_edge_hook_list
*next
;
80 /* List of hooks triggered on cgraph_node events. */
81 struct cgraph_node_hook_list
{
82 cgraph_node_hook hook
;
84 struct cgraph_node_hook_list
*next
;
87 /* List of hooks triggered on events involving two cgraph_edges. */
88 struct cgraph_2edge_hook_list
{
89 cgraph_2edge_hook hook
;
91 struct cgraph_2edge_hook_list
*next
;
94 /* List of hooks triggered on events involving two cgraph_nodes. */
95 struct cgraph_2node_hook_list
{
96 cgraph_2node_hook hook
;
98 struct cgraph_2node_hook_list
*next
;
101 /* Hash descriptor for cgraph_function_version_info. */
103 struct function_version_hasher
: ggc_ptr_hash
<cgraph_function_version_info
>
105 static hashval_t
hash (cgraph_function_version_info
*);
106 static bool equal (cgraph_function_version_info
*,
107 cgraph_function_version_info
*);
110 /* Map a cgraph_node to cgraph_function_version_info using this htab.
111 The cgraph_function_version_info has a THIS_NODE field that is the
112 corresponding cgraph_node.. */
114 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
116 /* Hash function for cgraph_fnver_htab. */
118 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
120 int uid
= ptr
->this_node
->uid
;
121 return (hashval_t
)(uid
);
124 /* eq function for cgraph_fnver_htab. */
126 function_version_hasher::equal (cgraph_function_version_info
*n1
,
127 cgraph_function_version_info
*n2
)
129 return n1
->this_node
->uid
== n2
->this_node
->uid
;
132 /* Mark as GC root all allocated nodes. */
133 static GTY(()) struct cgraph_function_version_info
*
134 version_info_node
= NULL
;
136 /* Return true if NODE's address can be compared. */
139 symtab_node::address_can_be_compared_p ()
141 /* Address of virtual tables and functions is never compared. */
142 if (DECL_VIRTUAL_P (decl
))
144 /* Address of C++ cdtors is never compared. */
145 if (is_a
<cgraph_node
*> (this)
146 && (DECL_CXX_CONSTRUCTOR_P (decl
)
147 || DECL_CXX_DESTRUCTOR_P (decl
)))
149 /* Constant pool symbols addresses are never compared.
150 flag_merge_constants permits us to assume the same on readonly vars. */
151 if (is_a
<varpool_node
*> (this)
152 && (DECL_IN_CONSTANT_POOL (decl
)
153 || (flag_merge_constants
>= 2
154 && TREE_READONLY (decl
) && !TREE_THIS_VOLATILE (decl
))))
159 /* Get the cgraph_function_version_info node corresponding to node. */
160 cgraph_function_version_info
*
161 cgraph_node::function_version (void)
163 cgraph_function_version_info key
;
164 key
.this_node
= this;
166 if (cgraph_fnver_htab
== NULL
)
169 return cgraph_fnver_htab
->find (&key
);
172 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
173 corresponding to cgraph_node NODE. */
174 cgraph_function_version_info
*
175 cgraph_node::insert_new_function_version (void)
177 version_info_node
= NULL
;
178 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
179 version_info_node
->this_node
= this;
181 if (cgraph_fnver_htab
== NULL
)
182 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
184 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
186 return version_info_node
;
189 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
190 DECL is a duplicate declaration. */
192 cgraph_node::delete_function_version (tree decl
)
194 cgraph_node
*decl_node
= cgraph_node::get (decl
);
195 cgraph_function_version_info
*decl_v
= NULL
;
197 if (decl_node
== NULL
)
200 decl_v
= decl_node
->function_version ();
205 if (decl_v
->prev
!= NULL
)
206 decl_v
->prev
->next
= decl_v
->next
;
208 if (decl_v
->next
!= NULL
)
209 decl_v
->next
->prev
= decl_v
->prev
;
211 if (cgraph_fnver_htab
!= NULL
)
212 cgraph_fnver_htab
->remove_elt (decl_v
);
214 decl_node
->remove ();
217 /* Record that DECL1 and DECL2 are semantically identical function
220 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
222 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
223 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
224 cgraph_function_version_info
*decl1_v
= NULL
;
225 cgraph_function_version_info
*decl2_v
= NULL
;
226 cgraph_function_version_info
*before
;
227 cgraph_function_version_info
*after
;
229 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
230 decl1_v
= decl1_node
->function_version ();
231 decl2_v
= decl2_node
->function_version ();
233 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
237 decl1_v
= decl1_node
->insert_new_function_version ();
240 decl2_v
= decl2_node
->insert_new_function_version ();
242 /* Chain decl2_v and decl1_v. All semantically identical versions
243 will be chained together. */
248 while (before
->next
!= NULL
)
249 before
= before
->next
;
251 while (after
->prev
!= NULL
)
254 before
->next
= after
;
255 after
->prev
= before
;
258 /* Initialize callgraph dump file. */
261 symbol_table::initialize (void)
264 dump_file
= dump_begin (TDI_cgraph
, NULL
);
267 /* Allocate new callgraph node and insert it into basic data structures. */
270 symbol_table::create_empty (void)
272 cgraph_node
*node
= allocate_cgraph_symbol ();
274 node
->type
= SYMTAB_FUNCTION
;
275 node
->frequency
= NODE_FREQUENCY_NORMAL
;
276 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
282 /* Register HOOK to be called with DATA on each removed edge. */
283 cgraph_edge_hook_list
*
284 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
286 cgraph_edge_hook_list
*entry
;
287 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
289 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
299 /* Remove ENTRY from the list of hooks called on removing edges. */
301 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
303 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
305 while (*ptr
!= entry
)
311 /* Call all edge removal hooks. */
313 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
315 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
318 entry
->hook (e
, entry
->data
);
323 /* Register HOOK to be called with DATA on each removed node. */
324 cgraph_node_hook_list
*
325 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
327 cgraph_node_hook_list
*entry
;
328 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
330 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
340 /* Remove ENTRY from the list of hooks called on removing nodes. */
342 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
344 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
346 while (*ptr
!= entry
)
352 /* Call all node removal hooks. */
354 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
356 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
359 entry
->hook (node
, entry
->data
);
364 /* Call all node removal hooks. */
366 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
368 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
371 entry
->hook (node
, entry
->data
);
377 /* Register HOOK to be called with DATA on each inserted node. */
378 cgraph_node_hook_list
*
379 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
381 cgraph_node_hook_list
*entry
;
382 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
384 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
394 /* Remove ENTRY from the list of hooks called on inserted nodes. */
396 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
398 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
400 while (*ptr
!= entry
)
406 /* Register HOOK to be called with DATA on each duplicated edge. */
407 cgraph_2edge_hook_list
*
408 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
410 cgraph_2edge_hook_list
*entry
;
411 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
413 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
423 /* Remove ENTRY from the list of hooks called on duplicating edges. */
425 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
427 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
429 while (*ptr
!= entry
)
435 /* Call all edge duplication hooks. */
437 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
439 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
442 entry
->hook (cs1
, cs2
, entry
->data
);
447 /* Register HOOK to be called with DATA on each duplicated node. */
448 cgraph_2node_hook_list
*
449 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
451 cgraph_2node_hook_list
*entry
;
452 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
454 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
464 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
466 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
468 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
470 while (*ptr
!= entry
)
476 /* Call all node duplication hooks. */
478 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
481 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
484 entry
->hook (node
, node2
, entry
->data
);
489 /* Return cgraph node assigned to DECL. Create new one when needed. */
492 cgraph_node::create (tree decl
)
494 cgraph_node
*node
= symtab
->create_empty ();
495 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
499 if ((flag_openacc
|| flag_openmp
)
500 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
502 node
->offloadable
= 1;
503 if (ENABLE_OFFLOADING
)
504 g
->have_offload
= true;
507 node
->register_symbol ();
509 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
511 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
512 node
->next_nested
= node
->origin
->nested
;
513 node
->origin
->nested
= node
;
518 /* Try to find a call graph node for declaration DECL and if it does not exist
519 or if it corresponds to an inline clone, create a new one. */
522 cgraph_node::get_create (tree decl
)
524 cgraph_node
*first_clone
= cgraph_node::get (decl
);
526 if (first_clone
&& !first_clone
->global
.inlined_to
)
529 cgraph_node
*node
= cgraph_node::create (decl
);
532 first_clone
->clone_of
= node
;
533 node
->clones
= first_clone
;
534 symtab
->symtab_prevail_in_asm_name_hash (node
);
535 node
->decl
->decl_with_vis
.symtab_node
= node
;
537 fprintf (dump_file
, "Introduced new external node "
538 "(%s/%i) and turned into root of the clone tree.\n",
539 node
->name (), node
->order
);
542 fprintf (dump_file
, "Introduced new external node "
543 "(%s/%i).\n", node
->name (), node
->order
);
547 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
548 the function body is associated with (not necessarily cgraph_node (DECL). */
551 cgraph_node::create_alias (tree alias
, tree target
)
553 cgraph_node
*alias_node
;
555 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
556 || TREE_CODE (target
) == IDENTIFIER_NODE
);
557 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
558 alias_node
= cgraph_node::get_create (alias
);
559 gcc_assert (!alias_node
->definition
);
560 alias_node
->alias_target
= target
;
561 alias_node
->definition
= true;
562 alias_node
->alias
= true;
563 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
564 alias_node
->transparent_alias
= alias_node
->weakref
= true;
568 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
570 Same body aliases are output whenever the body of DECL is output,
571 and cgraph_node::get (ALIAS) transparently returns
572 cgraph_node::get (DECL). */
575 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
578 #ifndef ASM_OUTPUT_DEF
579 /* If aliases aren't supported by the assembler, fail. */
582 /* Langhooks can create same body aliases of symbols not defined.
583 Those are useless. Drop them on the floor. */
584 if (symtab
->global_info_ready
)
587 n
= cgraph_node::create_alias (alias
, decl
);
588 n
->cpp_implicit_alias
= true;
589 if (symtab
->cpp_implicit_aliases_done
)
590 n
->resolve_alias (cgraph_node::get (decl
));
594 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
595 aliases DECL with an adjustments made into the first parameter.
596 See comments in thunk_adjust for detail on the parameters. */
599 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
600 HOST_WIDE_INT fixed_offset
,
601 HOST_WIDE_INT virtual_value
,
607 node
= cgraph_node::get (alias
);
611 node
= cgraph_node::create (alias
);
612 gcc_checking_assert (!virtual_offset
613 || wi::eq_p (virtual_offset
, virtual_value
));
614 node
->thunk
.fixed_offset
= fixed_offset
;
615 node
->thunk
.this_adjusting
= this_adjusting
;
616 node
->thunk
.virtual_value
= virtual_value
;
617 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
618 node
->thunk
.alias
= real_alias
;
619 node
->thunk
.thunk_p
= true;
620 node
->definition
= true;
625 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
626 Return NULL if there's no such node. */
629 cgraph_node::get_for_asmname (tree asmname
)
631 /* We do not want to look at inline clones. */
632 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
634 node
= node
->next_sharing_asm_name
)
636 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
637 if (cn
&& !cn
->global
.inlined_to
)
643 /* Returns a hash value for X (which really is a cgraph_edge). */
646 cgraph_edge_hasher::hash (cgraph_edge
*e
)
648 /* This is a really poor hash function, but it is what htab_hash_pointer
650 return (hashval_t
) ((intptr_t)e
->call_stmt
>> 3);
653 /* Returns a hash value for X (which really is a cgraph_edge). */
656 cgraph_edge_hasher::hash (gimple
*call_stmt
)
658 /* This is a really poor hash function, but it is what htab_hash_pointer
660 return (hashval_t
) ((intptr_t)call_stmt
>> 3);
663 /* Return nonzero if the call_stmt of cgraph_edge X is stmt *Y. */
666 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple
*y
)
668 return x
->call_stmt
== y
;
671 /* Add call graph edge E to call site hash of its caller. */
674 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
676 gimple
*call
= e
->call_stmt
;
677 *e
->caller
->call_site_hash
->find_slot_with_hash
678 (call
, cgraph_edge_hasher::hash (call
), INSERT
) = e
;
681 /* Add call graph edge E to call site hash of its caller. */
684 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
686 /* There are two speculative edges for every statement (one direct,
687 one indirect); always hash the direct one. */
688 if (e
->speculative
&& e
->indirect_unknown_callee
)
690 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
691 (e
->call_stmt
, cgraph_edge_hasher::hash (e
->call_stmt
), INSERT
);
694 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
699 gcc_assert (!*slot
|| e
->speculative
);
703 /* Return the callgraph edge representing the GIMPLE_CALL statement
707 cgraph_node::get_edge (gimple
*call_stmt
)
713 return call_site_hash
->find_with_hash
714 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
716 /* This loop may turn out to be performance problem. In such case adding
717 hashtables into call nodes with very many edges is probably best
718 solution. It is not good idea to add pointer into CALL_EXPR itself
719 because we want to make possible having multiple cgraph nodes representing
720 different clones of the same body before the body is actually cloned. */
721 for (e
= callees
; e
; e
= e
->next_callee
)
723 if (e
->call_stmt
== call_stmt
)
729 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
731 if (e
->call_stmt
== call_stmt
)
738 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
739 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
740 cgraph_add_edge_to_call_site_hash (e2
);
741 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
742 cgraph_add_edge_to_call_site_hash (e2
);
749 /* Change field call_stmt of edge to NEW_STMT.
750 If UPDATE_SPECULATIVE and E is any component of speculative
751 edge, then update all components. */
754 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
758 /* Speculative edges has three component, update all of them
760 if (update_speculative
&& speculative
)
762 cgraph_edge
*direct
, *indirect
;
765 speculative_call_info (direct
, indirect
, ref
);
766 direct
->set_call_stmt (new_stmt
, false);
767 indirect
->set_call_stmt (new_stmt
, false);
768 ref
->stmt
= new_stmt
;
772 /* Only direct speculative edges go to call_site_hash. */
773 if (caller
->call_site_hash
774 && (!speculative
|| !indirect_unknown_callee
))
776 caller
->call_site_hash
->remove_elt_with_hash
777 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
780 cgraph_edge
*e
= this;
782 call_stmt
= new_stmt
;
783 if (indirect_unknown_callee
784 && (decl
= gimple_call_fndecl (new_stmt
)))
786 /* Constant propagation (and possibly also inlining?) can turn an
787 indirect call into a direct one. */
788 cgraph_node
*new_callee
= cgraph_node::get (decl
);
790 gcc_checking_assert (new_callee
);
791 e
= make_direct (new_callee
);
794 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
795 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
797 if (e
->caller
->call_site_hash
)
798 cgraph_add_edge_to_call_site_hash (e
);
801 /* Allocate a cgraph_edge structure and fill it with data according to the
802 parameters of which only CALLEE can be NULL (when creating an indirect call
806 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
807 gcall
*call_stmt
, gcov_type count
, int freq
,
808 bool indir_unknown_callee
)
812 /* LTO does not actually have access to the call_stmt since these
813 have not been loaded yet. */
816 /* This is a rather expensive check possibly triggering
817 construction of call stmt hashtable. */
819 gcc_checking_assert (!(e
= caller
->get_edge (call_stmt
))
822 gcc_assert (is_gimple_call (call_stmt
));
828 free_edges
= NEXT_FREE_EDGE (edge
);
832 edge
= ggc_alloc
<cgraph_edge
> ();
833 edge
->uid
= edges_max_uid
++;
839 edge
->caller
= caller
;
840 edge
->callee
= callee
;
841 edge
->prev_caller
= NULL
;
842 edge
->next_caller
= NULL
;
843 edge
->prev_callee
= NULL
;
844 edge
->next_callee
= NULL
;
845 edge
->lto_stmt_uid
= 0;
848 gcc_assert (count
>= 0);
849 edge
->frequency
= freq
;
850 gcc_assert (freq
>= 0);
851 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
853 edge
->call_stmt
= call_stmt
;
854 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
855 edge
->can_throw_external
856 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
859 && callee
&& callee
->decl
860 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
862 edge
->call_stmt_cannot_inline_p
= true;
864 edge
->call_stmt_cannot_inline_p
= false;
866 edge
->indirect_info
= NULL
;
867 edge
->indirect_inlining_edge
= 0;
868 edge
->speculative
= false;
869 edge
->indirect_unknown_callee
= indir_unknown_callee
;
870 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
871 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
872 edge
->in_polymorphic_cdtor
873 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
876 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
877 if (call_stmt
&& caller
->call_site_hash
)
878 cgraph_add_edge_to_call_site_hash (edge
);
883 /* Create edge from a given function to CALLEE in the cgraph. */
886 cgraph_node::create_edge (cgraph_node
*callee
,
887 gcall
*call_stmt
, gcov_type count
, int freq
)
889 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
892 initialize_inline_failed (edge
);
894 edge
->next_caller
= callee
->callers
;
896 callee
->callers
->prev_caller
= edge
;
897 edge
->next_callee
= callees
;
899 callees
->prev_callee
= edge
;
901 callee
->callers
= edge
;
906 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
908 cgraph_indirect_call_info
*
909 cgraph_allocate_init_indirect_info (void)
911 cgraph_indirect_call_info
*ii
;
913 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
914 ii
->param_index
= -1;
918 /* Create an indirect edge with a yet-undetermined callee where the call
919 statement destination is a formal parameter of the caller with index
923 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
924 gcov_type count
, int freq
,
925 bool compute_indirect_info
)
927 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
931 initialize_inline_failed (edge
);
933 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
934 edge
->indirect_info
->ecf_flags
= ecf_flags
;
935 edge
->indirect_info
->vptr_changed
= true;
937 /* Record polymorphic call info. */
938 if (compute_indirect_info
940 && (target
= gimple_call_fn (call_stmt
))
941 && virtual_method_call_p (target
))
943 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
945 /* Only record types can have virtual calls. */
946 edge
->indirect_info
->polymorphic
= true;
947 edge
->indirect_info
->param_index
= -1;
948 edge
->indirect_info
->otr_token
949 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
950 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
951 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
952 edge
->indirect_info
->context
= context
;
955 edge
->next_callee
= indirect_calls
;
957 indirect_calls
->prev_callee
= edge
;
958 indirect_calls
= edge
;
963 /* Remove the edge from the list of the callees of the caller. */
966 cgraph_edge::remove_caller (void)
969 prev_callee
->next_callee
= next_callee
;
971 next_callee
->prev_callee
= prev_callee
;
974 if (indirect_unknown_callee
)
975 caller
->indirect_calls
= next_callee
;
977 caller
->callees
= next_callee
;
979 if (caller
->call_site_hash
)
980 caller
->call_site_hash
->remove_elt_with_hash
981 (call_stmt
, cgraph_edge_hasher::hash (call_stmt
));
984 /* Put the edge onto the free list. */
987 symbol_table::free_edge (cgraph_edge
*e
)
991 if (e
->indirect_info
)
992 ggc_free (e
->indirect_info
);
994 /* Clear out the edge so we do not dangle pointers. */
995 memset (e
, 0, sizeof (*e
));
997 NEXT_FREE_EDGE (e
) = free_edges
;
1002 /* Remove the edge in the cgraph. */
1005 cgraph_edge::remove (void)
1007 /* Call all edge removal hooks. */
1008 symtab
->call_edge_removal_hooks (this);
1010 if (!indirect_unknown_callee
)
1011 /* Remove from callers list of the callee. */
1014 /* Remove from callees list of the callers. */
1017 /* Put the edge onto the free list. */
1018 symtab
->free_edge (this);
1021 /* Turn edge into speculative call calling N2. Update
1022 the profile so the direct call is taken COUNT times
1025 At clone materialization time, the indirect call E will
1028 if (call_dest == N2)
1033 At this time the function just creates the direct call,
1034 the referencd representing the if conditional and attaches
1035 them all to the orginal indirect call statement.
1037 Return direct edge created. */
1040 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1041 int direct_frequency
)
1043 cgraph_node
*n
= caller
;
1044 ipa_ref
*ref
= NULL
;
1049 fprintf (dump_file
, "Indirect call -> speculative call"
1050 " %s/%i => %s/%i\n",
1051 xstrdup_for_dump (n
->name ()), n
->order
,
1052 xstrdup_for_dump (n2
->name ()), n2
->order
);
1055 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1056 initialize_inline_failed (e2
);
1057 e2
->speculative
= true;
1058 if (TREE_NOTHROW (n2
->decl
))
1059 e2
->can_throw_external
= false;
1061 e2
->can_throw_external
= can_throw_external
;
1062 e2
->lto_stmt_uid
= lto_stmt_uid
;
1063 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1065 frequency
-= e2
->frequency
;
1066 symtab
->call_edge_duplication_hooks (this, e2
);
1067 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1068 ref
->lto_stmt_uid
= lto_stmt_uid
;
1069 ref
->speculative
= speculative
;
1070 n2
->mark_address_taken ();
1074 /* Speculative call consist of three components:
1075 1) an indirect edge representing the original call
1076 2) an direct edge representing the new call
1077 3) ADDR_EXPR reference representing the speculative check.
1078 All three components are attached to single statement (the indirect
1079 call) and if one of them exists, all of them must exist.
1081 Given speculative call edge, return all three components.
1085 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1086 cgraph_edge
*&indirect
,
1087 ipa_ref
*&reference
)
1092 cgraph_edge
*e
= this;
1094 if (!e
->indirect_unknown_callee
)
1095 for (e2
= e
->caller
->indirect_calls
;
1096 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1097 e2
= e2
->next_callee
)
1102 /* We can take advantage of the call stmt hash. */
1105 e
= e
->caller
->get_edge (e2
->call_stmt
);
1106 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1109 for (e
= e
->caller
->callees
;
1110 e2
->call_stmt
!= e
->call_stmt
1111 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1115 gcc_assert (e
->speculative
&& e2
->speculative
);
1120 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1121 if (ref
->speculative
1122 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1123 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1129 /* Speculative edge always consist of all three components - direct edge,
1130 indirect and reference. */
1132 gcc_assert (e
&& e2
&& ref
);
1135 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1136 Remove the speculative call sequence and return edge representing the call.
1137 It is up to caller to redirect the call as appropriate. */
1140 cgraph_edge::resolve_speculation (tree callee_decl
)
1142 cgraph_edge
*edge
= this;
1146 gcc_assert (edge
->speculative
);
1147 edge
->speculative_call_info (e2
, edge
, ref
);
1149 || !ref
->referred
->semantically_equivalent_p
1150 (symtab_node::get (callee_decl
)))
1156 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1157 "turned out to have contradicting known target ",
1158 xstrdup_for_dump (edge
->caller
->name ()),
1159 edge
->caller
->order
,
1160 xstrdup_for_dump (e2
->callee
->name ()),
1162 print_generic_expr (dump_file
, callee_decl
, 0);
1163 fprintf (dump_file
, "\n");
1167 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1168 xstrdup_for_dump (edge
->caller
->name ()),
1169 edge
->caller
->order
,
1170 xstrdup_for_dump (e2
->callee
->name ()),
1177 cgraph_edge
*tmp
= edge
;
1179 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1182 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1183 in the functions inlined through it. */
1185 edge
->count
+= e2
->count
;
1186 edge
->frequency
+= e2
->frequency
;
1187 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1188 edge
->frequency
= CGRAPH_FREQ_MAX
;
1189 edge
->speculative
= false;
1190 e2
->speculative
= false;
1191 ref
->remove_reference ();
1192 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1195 e2
->callee
->remove_symbol_and_inline_clones ();
1196 if (edge
->caller
->call_site_hash
)
1197 cgraph_update_edge_in_call_site_hash (edge
);
1201 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1202 CALLEE. DELTA is an integer constant that is to be added to the this
1203 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1206 cgraph_edge::make_direct (cgraph_node
*callee
)
1208 cgraph_edge
*edge
= this;
1209 gcc_assert (indirect_unknown_callee
);
1211 /* If we are redirecting speculative call, make it non-speculative. */
1212 if (indirect_unknown_callee
&& speculative
)
1214 edge
= edge
->resolve_speculation (callee
->decl
);
1216 /* On successful speculation just return the pre existing direct edge. */
1217 if (!indirect_unknown_callee
)
1221 indirect_unknown_callee
= 0;
1222 ggc_free (indirect_info
);
1223 indirect_info
= NULL
;
1225 /* Get the edge out of the indirect edge list. */
1227 prev_callee
->next_callee
= next_callee
;
1229 next_callee
->prev_callee
= prev_callee
;
1231 caller
->indirect_calls
= next_callee
;
1233 /* Put it into the normal callee list */
1235 next_callee
= caller
->callees
;
1236 if (caller
->callees
)
1237 caller
->callees
->prev_callee
= edge
;
1238 caller
->callees
= edge
;
1240 /* Insert to callers list of the new callee. */
1241 edge
->set_callee (callee
);
1244 call_stmt_cannot_inline_p
1245 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1248 /* We need to re-determine the inlining status of the edge. */
1249 initialize_inline_failed (edge
);
1253 /* If necessary, change the function declaration in the call statement
1254 associated with E so that it corresponds to the edge callee. */
1257 cgraph_edge::redirect_call_stmt_to_callee (void)
1259 cgraph_edge
*e
= this;
1261 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1262 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1264 gimple_stmt_iterator gsi
;
1265 bool skip_bounds
= false;
1273 e
->speculative_call_info (e
, e2
, ref
);
1274 /* If there already is an direct call (i.e. as a result of inliner's
1275 substitution), forget about speculating. */
1277 e
= e
->resolve_speculation (decl
);
1278 /* If types do not match, speculation was likely wrong.
1279 The direct edge was possibly redirected to the clone with a different
1280 signature. We did not update the call statement yet, so compare it
1281 with the reference that still points to the proper type. */
1282 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1283 ref
->referred
->decl
,
1287 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1289 xstrdup_for_dump (e
->caller
->name ()),
1291 xstrdup_for_dump (e
->callee
->name ()),
1293 e
= e
->resolve_speculation ();
1294 /* We are producing the final function body and will throw away the
1295 callgraph edges really soon. Reset the counts/frequencies to
1296 keep verifier happy in the case of roundoff errors. */
1297 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1298 e
->frequency
= compute_call_stmt_bb_frequency
1299 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1301 /* Expand speculation into GIMPLE code. */
1306 "Expanding speculative call of %s/%i -> %s/%i count:"
1308 xstrdup_for_dump (e
->caller
->name ()),
1310 xstrdup_for_dump (e
->callee
->name ()),
1313 gcc_assert (e2
->speculative
);
1314 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1315 new_stmt
= gimple_ic (e
->call_stmt
,
1316 dyn_cast
<cgraph_node
*> (ref
->referred
),
1317 e
->count
|| e2
->count
1318 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1319 e
->count
+ e2
->count
)
1320 : e
->frequency
|| e2
->frequency
1321 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1322 e
->frequency
+ e2
->frequency
)
1323 : REG_BR_PROB_BASE
/ 2,
1324 e
->count
, e
->count
+ e2
->count
);
1325 e
->speculative
= false;
1326 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1329 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1330 processed call stmt. */
1331 if (gimple_call_with_bounds_p (new_stmt
)
1332 && gimple_call_lhs (new_stmt
)
1333 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1335 tree dresult
= gimple_call_lhs (new_stmt
);
1336 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1337 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1338 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1339 struct cgraph_edge
*iedge
1340 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1341 struct cgraph_edge
*dedge
;
1345 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1348 dedge
->frequency
= compute_call_stmt_bb_frequency
1349 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1351 iedge
->frequency
= compute_call_stmt_bb_frequency
1352 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1355 e
->frequency
= compute_call_stmt_bb_frequency
1356 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1357 e2
->frequency
= compute_call_stmt_bb_frequency
1358 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1359 e2
->speculative
= false;
1360 ref
->speculative
= false;
1362 /* Indirect edges are not both in the call site hash.
1364 if (e
->caller
->call_site_hash
)
1365 cgraph_update_edge_in_call_site_hash (e2
);
1367 /* Continue redirecting E to proper target. */
1371 /* We might propagate instrumented function pointer into
1372 not instrumented function and vice versa. In such a
1373 case we need to either fix function declaration or
1374 remove bounds from call statement. */
1375 if (flag_check_pointer_bounds
&& e
->callee
)
1376 skip_bounds
= chkp_redirect_edge (e
);
1378 if (e
->indirect_unknown_callee
1379 || (decl
== e
->callee
->decl
1381 return e
->call_stmt
;
1383 if (flag_checking
&& decl
)
1385 cgraph_node
*node
= cgraph_node::get (decl
);
1386 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1389 if (symtab
->dump_file
)
1391 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1392 xstrdup_for_dump (e
->caller
->name ()), e
->caller
->order
,
1393 xstrdup_for_dump (e
->callee
->name ()), e
->callee
->order
);
1394 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1395 if (e
->callee
->clone
.combined_args_to_skip
)
1397 fprintf (symtab
->dump_file
, " combined args to skip: ");
1398 dump_bitmap (symtab
->dump_file
,
1399 e
->callee
->clone
.combined_args_to_skip
);
1403 if (e
->callee
->clone
.combined_args_to_skip
1408 new_stmt
= e
->call_stmt
;
1409 if (e
->callee
->clone
.combined_args_to_skip
)
1411 = gimple_call_copy_skip_args (new_stmt
,
1412 e
->callee
->clone
.combined_args_to_skip
);
1414 new_stmt
= chkp_copy_call_skip_bounds (new_stmt
);
1416 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1417 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1419 if (gimple_vdef (new_stmt
)
1420 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1421 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1423 gsi
= gsi_for_stmt (e
->call_stmt
);
1425 /* For optimized away parameters, add on the caller side
1427 DEBUG D#X => parm_Y(D)
1428 stmts and associate D#X with parm in decl_debug_args_lookup
1429 vector to say for debug info that if parameter parm had been passed,
1430 it would have value parm_Y(D). */
1431 if (e
->callee
->clone
.combined_args_to_skip
&& MAY_HAVE_DEBUG_STMTS
)
1433 vec
<tree
, va_gc
> **debug_args
1434 = decl_debug_args_lookup (e
->callee
->decl
);
1435 tree old_decl
= gimple_call_fndecl (e
->call_stmt
);
1436 if (debug_args
&& old_decl
)
1439 unsigned i
= 0, num
;
1440 unsigned len
= vec_safe_length (*debug_args
);
1441 unsigned nargs
= gimple_call_num_args (e
->call_stmt
);
1442 for (parm
= DECL_ARGUMENTS (old_decl
), num
= 0;
1443 parm
&& num
< nargs
;
1444 parm
= DECL_CHAIN (parm
), num
++)
1445 if (bitmap_bit_p (e
->callee
->clone
.combined_args_to_skip
, num
)
1446 && is_gimple_reg (parm
))
1450 while (i
< len
&& (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1456 && (**debug_args
)[i
] != DECL_ORIGIN (parm
))
1461 tree ddecl
= (**debug_args
)[i
+ 1];
1462 tree arg
= gimple_call_arg (e
->call_stmt
, num
);
1463 if (!useless_type_conversion_p (TREE_TYPE (ddecl
),
1467 if (!fold_convertible_p (TREE_TYPE (ddecl
), arg
))
1469 if (TREE_CODE (arg
) == SSA_NAME
1470 && gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg
))
1472 = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (arg
)))
1473 && useless_type_conversion_p (TREE_TYPE (ddecl
),
1477 arg
= fold_convert (TREE_TYPE (ddecl
), arg
);
1481 = gimple_build_debug_bind (ddecl
, unshare_expr (arg
),
1483 gsi_insert_before (&gsi
, def_temp
, GSI_SAME_STMT
);
1488 gsi_replace (&gsi
, new_stmt
, false);
1489 /* We need to defer cleaning EH info on the new statement to
1490 fixup-cfg. We may not have dominator information at this point
1491 and thus would end up with unreachable blocks and have no way
1492 to communicate that we need to run CFG cleanup then. */
1493 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1496 remove_stmt_from_eh_lp (e
->call_stmt
);
1497 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1502 new_stmt
= e
->call_stmt
;
1503 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1504 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1507 /* If changing the call to __cxa_pure_virtual or similar noreturn function,
1508 adjust gimple_call_fntype too. */
1509 if (gimple_call_noreturn_p (new_stmt
)
1510 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (e
->callee
->decl
)))
1511 && TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
))
1512 && (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (e
->callee
->decl
)))
1514 gimple_call_set_fntype (new_stmt
, TREE_TYPE (e
->callee
->decl
));
1516 /* If the call becomes noreturn, remove the LHS if possible. */
1518 && (gimple_call_flags (new_stmt
) & ECF_NORETURN
)
1519 && (VOID_TYPE_P (TREE_TYPE (gimple_call_fntype (new_stmt
)))
1520 || (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (lhs
))) == INTEGER_CST
1521 && !TREE_ADDRESSABLE (TREE_TYPE (lhs
)))))
1523 if (TREE_CODE (lhs
) == SSA_NAME
)
1525 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1526 TREE_TYPE (lhs
), NULL
);
1527 var
= get_or_create_ssa_default_def
1528 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1529 gimple
*set_stmt
= gimple_build_assign (lhs
, var
);
1530 gsi
= gsi_for_stmt (new_stmt
);
1531 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1532 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1534 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1535 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1538 /* If new callee has no static chain, remove it. */
1539 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1541 gimple_call_set_chain (new_stmt
, NULL
);
1542 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1545 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1548 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1550 if (symtab
->dump_file
)
1552 fprintf (symtab
->dump_file
, " updated to:");
1553 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1558 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1559 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1560 of OLD_STMT if it was previously call statement.
1561 If NEW_STMT is NULL, the call has been dropped without any
1565 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1566 gimple
*old_stmt
, tree old_call
,
1569 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1570 ? gimple_call_fndecl (new_stmt
) : 0;
1572 /* We are seeing indirect calls, then there is nothing to update. */
1573 if (!new_call
&& !old_call
)
1575 /* See if we turned indirect call into direct call or folded call to one builtin
1576 into different builtin. */
1577 if (old_call
!= new_call
)
1579 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1580 cgraph_edge
*ne
= NULL
;
1586 /* Keep calls marked as dead dead. */
1587 if (new_stmt
&& is_gimple_call (new_stmt
) && e
->callee
1588 && DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
1589 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
1591 node
->get_edge (old_stmt
)->set_call_stmt
1592 (as_a
<gcall
*> (new_stmt
));
1595 /* See if the edge is already there and has the correct callee. It
1596 might be so because of indirect inlining has already updated
1597 it. We also might've cloned and redirected the edge. */
1598 if (new_call
&& e
->callee
)
1600 cgraph_node
*callee
= e
->callee
;
1603 if (callee
->decl
== new_call
1604 || callee
->former_clone_of
== new_call
)
1606 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1609 callee
= callee
->clone_of
;
1613 /* Otherwise remove edge and create new one; we can't simply redirect
1614 since function has changed, so inline plan and other information
1615 attached to edge is invalid. */
1617 frequency
= e
->frequency
;
1618 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1621 e
->callee
->remove_symbol_and_inline_clones ();
1625 /* We are seeing new direct call; compute profile info based on BB. */
1626 basic_block bb
= gimple_bb (new_stmt
);
1628 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1634 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1635 as_a
<gcall
*> (new_stmt
), count
,
1637 gcc_assert (ne
->inline_failed
);
1640 /* We only updated the call stmt; update pointer in cgraph edge.. */
1641 else if (old_stmt
!= new_stmt
)
1642 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1645 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1646 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1647 of OLD_STMT before it was updated (updating can happen inplace). */
1650 cgraph_update_edges_for_call_stmt (gimple
*old_stmt
, tree old_decl
,
1653 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1656 gcc_checking_assert (orig
);
1657 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1659 for (node
= orig
->clones
; node
!= orig
;)
1661 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1663 node
= node
->clones
;
1664 else if (node
->next_sibling_clone
)
1665 node
= node
->next_sibling_clone
;
1668 while (node
!= orig
&& !node
->next_sibling_clone
)
1669 node
= node
->clone_of
;
1671 node
= node
->next_sibling_clone
;
1677 /* Remove all callees from the node. */
1680 cgraph_node::remove_callees (void)
1684 /* It is sufficient to remove the edges from the lists of callers of
1685 the callees. The callee list of the node can be zapped with one
1687 for (e
= callees
; e
; e
= f
)
1690 symtab
->call_edge_removal_hooks (e
);
1691 if (!e
->indirect_unknown_callee
)
1692 e
->remove_callee ();
1693 symtab
->free_edge (e
);
1695 for (e
= indirect_calls
; e
; e
= f
)
1698 symtab
->call_edge_removal_hooks (e
);
1699 if (!e
->indirect_unknown_callee
)
1700 e
->remove_callee ();
1701 symtab
->free_edge (e
);
1703 indirect_calls
= NULL
;
1707 call_site_hash
->empty ();
1708 call_site_hash
= NULL
;
1712 /* Remove all callers from the node. */
1715 cgraph_node::remove_callers (void)
1719 /* It is sufficient to remove the edges from the lists of callees of
1720 the callers. The caller list of the node can be zapped with one
1722 for (e
= callers
; e
; e
= f
)
1725 symtab
->call_edge_removal_hooks (e
);
1726 e
->remove_caller ();
1727 symtab
->free_edge (e
);
1732 /* Helper function for cgraph_release_function_body and free_lang_data.
1733 It releases body from function DECL without having to inspect its
1734 possibly non-existent symtab node. */
1737 release_function_body (tree decl
)
1739 function
*fn
= DECL_STRUCT_FUNCTION (decl
);
1746 && loops_for_fn (fn
))
1748 fn
->curr_properties
&= ~PROP_loops
;
1749 loop_optimizer_finalize (fn
);
1753 delete_tree_ssa (fn
);
1754 delete_tree_cfg_annotations (fn
);
1759 gcc_assert (!dom_info_available_p (fn
, CDI_DOMINATORS
));
1760 gcc_assert (!dom_info_available_p (fn
, CDI_POST_DOMINATORS
));
1764 if (fn
->value_histograms
)
1765 free_histograms (fn
);
1767 gimple_set_body (decl
, NULL
);
1768 /* Struct function hangs a lot of data that would leak if we didn't
1769 removed all pointers to it. */
1771 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1773 DECL_SAVED_TREE (decl
) = NULL
;
1776 /* Release memory used to represent body of function.
1777 Use this only for functions that are released before being translated to
1778 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1779 are free'd in final.c via free_after_compilation().
1780 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1783 cgraph_node::release_body (bool keep_arguments
)
1785 ipa_transforms_to_apply
.release ();
1786 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1788 DECL_RESULT (decl
) = NULL
;
1790 if (!keep_arguments
)
1791 DECL_ARGUMENTS (decl
) = NULL
;
1793 /* If the node is abstract and needed, then do not clear
1794 DECL_INITIAL of its associated function declaration because it's
1795 needed to emit debug info later. */
1796 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1797 DECL_INITIAL (decl
) = error_mark_node
;
1798 release_function_body (decl
);
1801 lto_free_function_in_decl_state_for_node (this);
1802 lto_file_data
= NULL
;
1806 /* Remove function from symbol table. */
1809 cgraph_node::remove (void)
1812 int uid
= this->uid
;
1814 symtab
->call_cgraph_removal_hooks (this);
1817 ipa_transforms_to_apply
.release ();
1819 /* Incremental inlining access removed nodes stored in the postorder list.
1821 force_output
= false;
1822 forced_by_abi
= false;
1823 for (n
= nested
; n
; n
= n
->next_nested
)
1828 cgraph_node
**node2
= &origin
->nested
;
1830 while (*node2
!= this)
1831 node2
= &(*node2
)->next_nested
;
1832 *node2
= next_nested
;
1835 if (prev_sibling_clone
)
1836 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1838 clone_of
->clones
= next_sibling_clone
;
1839 if (next_sibling_clone
)
1840 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1843 cgraph_node
*n
, *next
;
1847 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1848 n
->clone_of
= clone_of
;
1849 n
->clone_of
= clone_of
;
1850 n
->next_sibling_clone
= clone_of
->clones
;
1851 if (clone_of
->clones
)
1852 clone_of
->clones
->prev_sibling_clone
= n
;
1853 clone_of
->clones
= clones
;
1857 /* We are removing node with clones. This makes clones inconsistent,
1858 but assume they will be removed subsequently and just keep clone
1859 tree intact. This can happen in unreachable function removal since
1860 we remove unreachable functions in random order, not by bottom-up
1861 walk of clone trees. */
1862 for (n
= clones
; n
; n
= next
)
1864 next
= n
->next_sibling_clone
;
1865 n
->next_sibling_clone
= NULL
;
1866 n
->prev_sibling_clone
= NULL
;
1872 /* While all the clones are removed after being proceeded, the function
1873 itself is kept in the cgraph even after it is compiled. Check whether
1874 we are done with this body and reclaim it proactively if this is the case.
1876 if (symtab
->state
!= LTO_STREAMING
)
1878 n
= cgraph_node::get (decl
);
1880 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1881 && ((symtab
->global_info_ready
|| in_lto_p
)
1882 && (TREE_ASM_WRITTEN (n
->decl
)
1883 || DECL_EXTERNAL (n
->decl
)
1885 || (!flag_wpa
&& n
->in_other_partition
)))))
1890 lto_free_function_in_decl_state_for_node (this);
1891 lto_file_data
= NULL
;
1897 call_site_hash
->empty ();
1898 call_site_hash
= NULL
;
1901 if (instrumented_version
)
1903 instrumented_version
->instrumented_version
= NULL
;
1904 instrumented_version
= NULL
;
1907 symtab
->release_symbol (this, uid
);
1910 /* Likewise indicate that a node is having address taken. */
1913 cgraph_node::mark_address_taken (void)
1915 /* Indirect inlining can figure out that all uses of the address are
1917 if (global
.inlined_to
)
1919 gcc_assert (cfun
->after_inlining
);
1920 gcc_assert (callers
->indirect_inlining_edge
);
1923 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1924 IPA_REF_ADDR reference exists (and thus it should be set on node
1925 representing alias we take address of) and as a test whether address
1926 of the object was taken (and thus it should be set on node alias is
1927 referring to). We should remove the first use and the remove the
1930 cgraph_node
*node
= ultimate_alias_target ();
1931 node
->address_taken
= 1;
1934 /* Return local info for the compiled function. */
1937 cgraph_node::local_info (tree decl
)
1939 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1940 cgraph_node
*node
= get (decl
);
1943 return &node
->ultimate_alias_target ()->local
;
1946 /* Return local info for the compiled function. */
1949 cgraph_node::rtl_info (tree decl
)
1951 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1952 cgraph_node
*node
= get (decl
);
1955 node
= node
->ultimate_alias_target ();
1956 if (node
->decl
!= current_function_decl
1957 && !TREE_ASM_WRITTEN (node
->decl
))
1959 /* Allocate if it doesnt exist. */
1960 if (node
->ultimate_alias_target ()->rtl
== NULL
)
1961 node
->ultimate_alias_target ()->rtl
= ggc_cleared_alloc
<cgraph_rtl_info
> ();
1962 return node
->ultimate_alias_target ()->rtl
;
1965 /* Return a string describing the failure REASON. */
1968 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1971 #define DEFCIFCODE(code, type, string) string,
1973 static const char *cif_string_table
[CIF_N_REASONS
] = {
1974 #include "cif-code.def"
1977 /* Signedness of an enum type is implementation defined, so cast it
1978 to unsigned before testing. */
1979 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1980 return cif_string_table
[reason
];
1983 /* Return a type describing the failure REASON. */
1985 cgraph_inline_failed_type_t
1986 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1989 #define DEFCIFCODE(code, type, string) type,
1991 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1992 #include "cif-code.def"
1995 /* Signedness of an enum type is implementation defined, so cast it
1996 to unsigned before testing. */
1997 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1998 return cif_type_table
[reason
];
2001 /* Names used to print out the availability enum. */
2002 const char * const cgraph_availability_names
[] =
2003 {"unset", "not_available", "overwritable", "available", "local"};
2005 /* Output flags of edge to a file F. */
2008 cgraph_edge::dump_edge_flags (FILE *f
)
2011 fprintf (f
, "(speculative) ");
2013 fprintf (f
, "(inlined) ");
2014 if (indirect_inlining_edge
)
2015 fprintf (f
, "(indirect_inlining) ");
2017 fprintf (f
, "(%" PRId64
"x) ", (int64_t)count
);
2019 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
2020 if (can_throw_external
)
2021 fprintf (f
, "(can throw external) ");
2024 /* Dump call graph node to file F. */
2027 cgraph_node::dump (FILE *f
)
2033 if (global
.inlined_to
)
2034 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
2035 xstrdup_for_dump (name ()),
2037 xstrdup_for_dump (global
.inlined_to
->name ()),
2038 global
.inlined_to
->order
);
2040 fprintf (f
, " Clone of %s/%i\n",
2041 clone_of
->asm_name (),
2043 if (symtab
->function_flags_ready
)
2044 fprintf (f
, " Availability: %s\n",
2045 cgraph_availability_names
[get_availability ()]);
2048 fprintf (f
, " Profile id: %i\n",
2050 fprintf (f
, " First run: %i\n", tp_first_run
);
2051 fprintf (f
, " Function flags:");
2053 fprintf (f
, " executed %" PRId64
"x",
2056 fprintf (f
, " nested in: %s", origin
->asm_name ());
2057 if (gimple_has_body_p (decl
))
2058 fprintf (f
, " body");
2060 fprintf (f
, " process");
2062 fprintf (f
, " local");
2063 if (local
.redefined_extern_inline
)
2064 fprintf (f
, " redefined_extern_inline");
2065 if (only_called_at_startup
)
2066 fprintf (f
, " only_called_at_startup");
2067 if (only_called_at_exit
)
2068 fprintf (f
, " only_called_at_exit");
2070 fprintf (f
, " tm_clone");
2072 fprintf (f
, " icf_merged");
2074 fprintf (f
, " merged_comdat");
2076 fprintf (f
, " split_part");
2077 if (indirect_call_target
)
2078 fprintf (f
, " indirect_call_target");
2080 fprintf (f
, " nonfreeing_fn");
2081 if (DECL_STATIC_CONSTRUCTOR (decl
))
2082 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2083 if (DECL_STATIC_DESTRUCTOR (decl
))
2084 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2085 if (frequency
== NODE_FREQUENCY_HOT
)
2086 fprintf (f
, " hot");
2087 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2088 fprintf (f
, " unlikely_executed");
2089 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
2090 fprintf (f
, " executed_once");
2091 if (only_called_at_startup
)
2092 fprintf (f
, " only_called_at_startup");
2093 if (only_called_at_exit
)
2094 fprintf (f
, " only_called_at_exit");
2095 if (opt_for_fn (decl
, optimize_size
))
2096 fprintf (f
, " optimize_size");
2097 if (parallelized_function
)
2098 fprintf (f
, " parallelized_function");
2104 fprintf (f
, " Thunk");
2106 fprintf (f
, " of %s (asm: %s)",
2107 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2108 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2109 fprintf (f
, " fixed offset %i virtual value %i has "
2110 "virtual offset %i)\n",
2111 (int)thunk
.fixed_offset
,
2112 (int)thunk
.virtual_value
,
2113 (int)thunk
.virtual_offset_p
);
2115 if (alias
&& thunk
.alias
2116 && DECL_P (thunk
.alias
))
2118 fprintf (f
, " Alias of %s",
2119 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2120 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2121 fprintf (f
, " (asm: %s)",
2122 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2126 fprintf (f
, " Called by: ");
2128 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2130 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
2131 edge
->caller
->order
);
2132 edge
->dump_edge_flags (f
);
2135 fprintf (f
, "\n Calls: ");
2136 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2138 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
2139 edge
->callee
->order
);
2140 edge
->dump_edge_flags (f
);
2144 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2146 if (edge
->indirect_info
->polymorphic
)
2148 fprintf (f
, " Polymorphic indirect call of type ");
2149 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2150 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2153 fprintf (f
, " Indirect call");
2154 edge
->dump_edge_flags (f
);
2155 if (edge
->indirect_info
->param_index
!= -1)
2157 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2158 if (edge
->indirect_info
->agg_contents
)
2159 fprintf (f
, " loaded from %s %s at offset %i",
2160 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2161 edge
->indirect_info
->by_ref
? "passed by reference":"",
2162 (int)edge
->indirect_info
->offset
);
2163 if (edge
->indirect_info
->vptr_changed
)
2164 fprintf (f
, " (vptr maybe changed)");
2167 if (edge
->indirect_info
->polymorphic
)
2168 edge
->indirect_info
->context
.dump (f
);
2171 if (instrumentation_clone
)
2172 fprintf (f
, " Is instrumented version.\n");
2173 else if (instrumented_version
)
2174 fprintf (f
, " Has instrumented version.\n");
2177 /* Dump call graph node NODE to stderr. */
2180 cgraph_node::debug (void)
2185 /* Dump the callgraph to file F. */
2188 cgraph_node::dump_cgraph (FILE *f
)
2192 fprintf (f
, "callgraph:\n\n");
2193 FOR_EACH_FUNCTION (node
)
2197 /* Return true when the DECL can possibly be inlined. */
2200 cgraph_function_possibly_inlined_p (tree decl
)
2202 if (!symtab
->global_info_ready
)
2203 return !DECL_UNINLINABLE (decl
);
2204 return DECL_POSSIBLY_INLINED (decl
);
2207 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2209 cgraph_node::unnest (void)
2211 cgraph_node
**node2
= &origin
->nested
;
2212 gcc_assert (origin
);
2214 while (*node2
!= this)
2215 node2
= &(*node2
)->next_nested
;
2216 *node2
= next_nested
;
2220 /* Return function availability. See cgraph.h for description of individual
2223 cgraph_node::get_availability (void)
2225 enum availability avail
;
2227 avail
= AVAIL_NOT_AVAILABLE
;
2228 else if (local
.local
)
2229 avail
= AVAIL_LOCAL
;
2230 else if (transparent_alias
)
2231 ultimate_alias_target (&avail
);
2232 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2233 avail
= AVAIL_INTERPOSABLE
;
2234 else if (!externally_visible
)
2235 avail
= AVAIL_AVAILABLE
;
2236 /* Inline functions are safe to be analyzed even if their symbol can
2237 be overwritten at runtime. It is not meaningful to enforce any sane
2238 behavior on replacing inline function by different body. */
2239 else if (DECL_DECLARED_INLINE_P (decl
))
2240 avail
= AVAIL_AVAILABLE
;
2242 /* If the function can be overwritten, return OVERWRITABLE. Take
2243 care at least of two notable extensions - the COMDAT functions
2244 used to share template instantiations in C++ (this is symmetric
2245 to code cp_cannot_inline_tree_fn and probably shall be shared and
2246 the inlinability hooks completely eliminated).
2248 ??? Does the C++ one definition rule allow us to always return
2249 AVAIL_AVAILABLE here? That would be good reason to preserve this
2252 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2253 avail
= AVAIL_INTERPOSABLE
;
2254 else avail
= AVAIL_AVAILABLE
;
2259 /* Worker for cgraph_node_can_be_local_p. */
2261 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2263 return !(!node
->force_output
2264 && ((DECL_COMDAT (node
->decl
)
2265 && !node
->forced_by_abi
2266 && !node
->used_from_object_file_p ()
2267 && !node
->same_comdat_group
)
2268 || !node
->externally_visible
));
2271 /* Return true if cgraph_node can be made local for API change.
2272 Extern inline functions and C++ COMDAT functions can be made local
2273 at the expense of possible code size growth if function is used in multiple
2274 compilation units. */
2276 cgraph_node::can_be_local_p (void)
2278 return (!address_taken
2279 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2283 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2284 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2285 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2288 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2289 (cgraph_node
*, void *),
2291 bool include_overwritable
,
2292 bool exclude_virtual_thunks
)
2297 if (callback (this, data
))
2299 FOR_EACH_ALIAS (this, ref
)
2301 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2302 if (include_overwritable
2303 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2304 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2305 include_overwritable
,
2306 exclude_virtual_thunks
))
2309 for (e
= callers
; e
; e
= e
->next_caller
)
2310 if (e
->caller
->thunk
.thunk_p
2311 && (include_overwritable
2312 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2313 && !(exclude_virtual_thunks
2314 && e
->caller
->thunk
.virtual_offset_p
))
2315 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2316 include_overwritable
,
2317 exclude_virtual_thunks
))
2323 /* Worker to bring NODE local. */
2326 cgraph_node::make_local (cgraph_node
*node
, void *)
2328 gcc_checking_assert (node
->can_be_local_p ());
2329 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2331 node
->make_decl_local ();
2332 node
->set_section (NULL
);
2333 node
->set_comdat_group (NULL
);
2334 node
->externally_visible
= false;
2335 node
->forced_by_abi
= false;
2336 node
->local
.local
= true;
2337 node
->set_section (NULL
);
2338 node
->unique_name
= ((node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2339 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
)
2340 && !flag_incremental_link
);
2341 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2342 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2347 /* Bring cgraph node local. */
2350 cgraph_node::make_local (void)
2352 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2355 /* Worker to set nothrow flag. */
2358 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2362 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2365 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2366 e
->can_throw_external
= false;
2370 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2371 if any to NOTHROW. */
2374 cgraph_node::set_nothrow_flag (bool nothrow
)
2376 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2377 (void *)(size_t)nothrow
, false);
2380 /* Worker to set const flag. */
2383 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2385 /* Static constructors and destructors without a side effect can be
2387 if (data
&& !((size_t)data
& 2))
2389 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2390 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2391 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2392 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2394 TREE_READONLY (node
->decl
) = data
!= NULL
;
2395 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2399 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2400 if any to READONLY. */
2403 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2405 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2406 (void *)(size_t)(readonly
+ (int)looping
* 2),
2410 /* Worker to set pure flag. */
2413 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2415 /* Static constructors and destructors without a side effect can be
2417 if (data
&& !((size_t)data
& 2))
2419 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2420 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2421 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2422 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2424 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2425 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2429 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2433 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2435 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2436 (void *)(size_t)(pure
+ (int)looping
* 2),
2440 /* Return true when cgraph_node can not return or throw and thus
2441 it is safe to ignore its side effects for IPA analysis. */
2444 cgraph_node::cannot_return_p (void)
2446 int flags
= flags_from_decl_or_type (decl
);
2447 if (!opt_for_fn (decl
, flag_exceptions
))
2448 return (flags
& ECF_NORETURN
) != 0;
2450 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2451 == (ECF_NORETURN
| ECF_NOTHROW
));
2454 /* Return true when call of edge can not lead to return from caller
2455 and thus it is safe to ignore its side effects for IPA analysis
2456 when computing side effects of the caller.
2457 FIXME: We could actually mark all edges that have no reaching
2458 patch to the exit block or throw to get better results. */
2460 cgraph_edge::cannot_lead_to_return_p (void)
2462 if (caller
->cannot_return_p ())
2464 if (indirect_unknown_callee
)
2466 int flags
= indirect_info
->ecf_flags
;
2467 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2468 return (flags
& ECF_NORETURN
) != 0;
2470 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2471 == (ECF_NORETURN
| ECF_NOTHROW
));
2474 return callee
->cannot_return_p ();
2477 /* Return true if the call can be hot. */
2480 cgraph_edge::maybe_hot_p (void)
2482 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2484 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2485 && !maybe_hot_count_p (NULL
, count
))
2487 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2489 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2491 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2493 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2495 if (opt_for_fn (caller
->decl
, optimize_size
))
2497 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2499 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2500 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2502 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2504 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2505 || frequency
<= (CGRAPH_FREQ_BASE
2506 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2512 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2515 nonremovable_p (cgraph_node
*node
, void *)
2517 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2520 /* Return true if whole comdat group can be removed if there are no direct
2524 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2526 struct ipa_ref
*ref
;
2528 /* For local symbols or non-comdat group it is the same as
2529 can_remove_if_no_direct_calls_p. */
2530 if (!externally_visible
|| !same_comdat_group
)
2532 if (DECL_EXTERNAL (decl
))
2536 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2539 if (will_inline
&& address_taken
)
2542 /* Otheriwse check if we can remove the symbol itself and then verify
2543 that only uses of the comdat groups are direct call to THIS
2545 if (!can_remove_if_no_direct_calls_and_refs_p ())
2548 /* Check that all refs come from within the comdat group. */
2549 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2550 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2553 struct cgraph_node
*target
= ultimate_alias_target ();
2554 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2555 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2557 if (!externally_visible
)
2560 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2563 /* If we see different symbol than THIS, be sure to check calls. */
2564 if (next
->ultimate_alias_target () != target
)
2565 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2566 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2570 /* If function is not being inlined, we care only about
2571 references outside of the comdat group. */
2573 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2574 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2580 /* Return true when function cgraph_node can be expected to be removed
2581 from program when direct calls in this compilation unit are removed.
2583 As a special case COMDAT functions are
2584 cgraph_can_remove_if_no_direct_calls_p while the are not
2585 cgraph_only_called_directly_p (it is possible they are called from other
2588 This function behaves as cgraph_only_called_directly_p because eliminating
2589 all uses of COMDAT function does not make it necessarily disappear from
2590 the program unless we are compiling whole program or we do LTO. In this
2591 case we know we win since dynamic linking will not really discard the
2592 linkonce section. */
2595 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2598 gcc_assert (!global
.inlined_to
);
2599 if (DECL_EXTERNAL (decl
))
2602 if (!in_lto_p
&& !flag_whole_program
)
2604 /* If the symbol is in comdat group, we need to verify that whole comdat
2605 group becomes unreachable. Technically we could skip references from
2606 within the group, too. */
2607 if (!only_called_directly_p ())
2609 if (same_comdat_group
&& externally_visible
)
2611 struct cgraph_node
*target
= ultimate_alias_target ();
2613 if (will_inline
&& address_taken
)
2615 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2617 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2619 if (!externally_visible
)
2622 && !next
->only_called_directly_p ())
2625 /* If we see different symbol than THIS,
2626 be sure to check calls. */
2627 if (next
->ultimate_alias_target () != target
)
2628 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2629 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2637 return can_remove_if_no_direct_calls_p (will_inline
);
2641 /* Worker for cgraph_only_called_directly_p. */
2644 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2646 return !node
->only_called_directly_or_aliased_p ();
2649 /* Return true when function cgraph_node and all its aliases are only called
2651 i.e. it is not externally visible, address was not taken and
2652 it is not used in any other non-standard way. */
2655 cgraph_node::only_called_directly_p (void)
2657 gcc_assert (ultimate_alias_target () == this);
2658 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2663 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2666 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2668 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2670 enum availability avail
;
2671 node
->ultimate_alias_target (&avail
);
2673 if (avail
> AVAIL_INTERPOSABLE
)
2674 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2675 if (!cs
->indirect_inlining_edge
2676 && !cs
->caller
->thunk
.thunk_p
)
2677 redirect_callers
->safe_push (cs
);
2681 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2682 cgraph_node (i.e. are not overwritable). */
2685 cgraph_node::collect_callers (void)
2687 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2688 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2689 &redirect_callers
, false);
2690 return redirect_callers
;
2693 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2696 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2698 bool skipped_thunk
= false;
2699 node
= node
->ultimate_alias_target ();
2700 node2
= node2
->ultimate_alias_target ();
2702 /* There are no virtual clones of thunks so check former_clone_of or if we
2703 might have skipped thunks because this adjustments are no longer
2705 while (node
->thunk
.thunk_p
)
2707 if (node2
->former_clone_of
== node
->decl
)
2709 if (!node
->thunk
.this_adjusting
)
2711 node
= node
->callees
->callee
->ultimate_alias_target ();
2712 skipped_thunk
= true;
2717 if (!node2
->clone
.args_to_skip
2718 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2720 if (node2
->former_clone_of
== node
->decl
)
2722 else if (!node2
->clone_of
)
2726 while (node
!= node2
&& node2
)
2727 node2
= node2
->clone_of
;
2728 return node2
!= NULL
;
2731 /* Verify edge count and frequency. */
2734 cgraph_edge::verify_count_and_frequency ()
2736 bool error_found
= false;
2739 error ("caller edge count is negative");
2744 error ("caller edge frequency is negative");
2747 if (frequency
> CGRAPH_FREQ_MAX
)
2749 error ("caller edge frequency is too large");
2755 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2757 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple
*stmt
)
2759 bool fndecl_was_null
= false;
2760 /* debug_gimple_stmt needs correct cfun */
2761 if (cfun
!= this_cfun
)
2762 set_cfun (this_cfun
);
2763 /* ...and an actual current_function_decl */
2764 if (!current_function_decl
)
2766 current_function_decl
= this_cfun
->decl
;
2767 fndecl_was_null
= true;
2769 debug_gimple_stmt (stmt
);
2770 if (fndecl_was_null
)
2771 current_function_decl
= NULL
;
2774 /* Verify that call graph edge corresponds to DECL from the associated
2775 statement. Return true if the verification should fail. */
2778 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
2782 if (!decl
|| callee
->global
.inlined_to
)
2784 if (symtab
->state
== LTO_STREAMING
)
2786 node
= cgraph_node::get (decl
);
2788 /* We do not know if a node from a different partition is an alias or what it
2789 aliases and therefore cannot do the former_clone_of check reliably. When
2790 body_removed is set, we have lost all information about what was alias or
2791 thunk of and also cannot proceed. */
2793 || node
->body_removed
2794 || node
->in_other_partition
2795 || callee
->icf_merged
2796 || callee
->in_other_partition
)
2799 node
= node
->ultimate_alias_target ();
2801 /* Optimizers can redirect unreachable calls or calls triggering undefined
2802 behavior to builtin_unreachable. */
2803 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
2804 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
2807 if (callee
->former_clone_of
!= node
->decl
2808 && (node
!= callee
->ultimate_alias_target ())
2809 && !clone_of_p (node
, callee
))
2815 /* Verify cgraph nodes of given cgraph node. */
2817 cgraph_node::verify_node (void)
2820 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2821 basic_block this_block
;
2822 gimple_stmt_iterator gsi
;
2823 bool error_found
= false;
2828 timevar_push (TV_CGRAPH_VERIFY
);
2829 error_found
|= verify_base ();
2830 for (e
= callees
; e
; e
= e
->next_callee
)
2833 error ("aux field set for edge %s->%s",
2834 identifier_to_locale (e
->caller
->name ()),
2835 identifier_to_locale (e
->callee
->name ()));
2840 error ("execution count is negative");
2843 if (global
.inlined_to
&& same_comdat_group
)
2845 error ("inline clone in same comdat group list");
2848 if (!definition
&& !in_other_partition
&& local
.local
)
2850 error ("local symbols must be defined");
2853 if (global
.inlined_to
&& externally_visible
)
2855 error ("externally visible inline clone");
2858 if (global
.inlined_to
&& address_taken
)
2860 error ("inline clone with address taken");
2863 if (global
.inlined_to
&& force_output
)
2865 error ("inline clone is forced to output");
2868 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2872 error ("aux field set for indirect edge from %s",
2873 identifier_to_locale (e
->caller
->name ()));
2876 if (!e
->indirect_unknown_callee
2877 || !e
->indirect_info
)
2879 error ("An indirect edge from %s is not marked as indirect or has "
2880 "associated indirect_info, the corresponding statement is: ",
2881 identifier_to_locale (e
->caller
->name ()));
2882 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2886 bool check_comdat
= comdat_local_p ();
2887 for (e
= callers
; e
; e
= e
->next_caller
)
2889 if (e
->verify_count_and_frequency ())
2892 && !in_same_comdat_group_p (e
->caller
))
2894 error ("comdat-local function called by %s outside its comdat",
2895 identifier_to_locale (e
->caller
->name ()));
2898 if (!e
->inline_failed
)
2900 if (global
.inlined_to
2901 != (e
->caller
->global
.inlined_to
2902 ? e
->caller
->global
.inlined_to
: e
->caller
))
2904 error ("inlined_to pointer is wrong");
2907 if (callers
->next_caller
)
2909 error ("multiple inline callers");
2914 if (global
.inlined_to
)
2916 error ("inlined_to pointer set for noninline callers");
2920 for (e
= callees
; e
; e
= e
->next_callee
)
2922 if (e
->verify_count_and_frequency ())
2924 if (gimple_has_body_p (e
->caller
->decl
)
2925 && !e
->caller
->global
.inlined_to
2927 /* Optimized out calls are redirected to __builtin_unreachable. */
2930 != builtin_decl_implicit (BUILT_IN_UNREACHABLE
))
2932 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2933 gimple_bb (e
->call_stmt
))))
2935 error ("caller edge frequency %i does not match BB frequency %i",
2937 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2938 gimple_bb (e
->call_stmt
)));
2942 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2944 if (e
->verify_count_and_frequency ())
2946 if (gimple_has_body_p (e
->caller
->decl
)
2947 && !e
->caller
->global
.inlined_to
2950 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2951 gimple_bb (e
->call_stmt
))))
2953 error ("indirect call frequency %i does not match BB frequency %i",
2955 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2956 gimple_bb (e
->call_stmt
)));
2960 if (!callers
&& global
.inlined_to
)
2962 error ("inlined_to pointer is set but no predecessors found");
2965 if (global
.inlined_to
== this)
2967 error ("inlined_to pointer refers to itself");
2974 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2979 error ("cgraph_node has wrong clone_of");
2986 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2987 if (n
->clone_of
!= this)
2991 error ("cgraph_node has wrong clone list");
2995 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2997 error ("cgraph_node is in clone list but it is not clone");
3000 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
3002 error ("cgraph_node has wrong prev_clone pointer");
3005 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
3007 error ("double linked list of clones corrupted");
3011 if (analyzed
&& alias
)
3013 bool ref_found
= false;
3015 ipa_ref
*ref
= NULL
;
3019 error ("Alias has call edges");
3022 for (i
= 0; iterate_reference (i
, ref
); i
++)
3023 if (ref
->use
== IPA_REF_CHKP
)
3025 else if (ref
->use
!= IPA_REF_ALIAS
)
3027 error ("Alias has non-alias reference");
3032 error ("Alias has more than one alias reference");
3039 error ("Analyzed alias has no reference");
3044 /* Check instrumented version reference. */
3045 if (instrumented_version
3046 && instrumented_version
->instrumented_version
!= this)
3048 error ("Instrumentation clone does not reference original node");
3052 /* Cannot have orig_decl for not instrumented nodes. */
3053 if (!instrumentation_clone
&& orig_decl
)
3055 error ("Not instrumented node has non-NULL original declaration");
3059 /* If original not instrumented node still exists then we may check
3060 original declaration is set properly. */
3061 if (instrumented_version
3063 && orig_decl
!= instrumented_version
->decl
)
3065 error ("Instrumented node has wrong original declaration");
3069 /* Check all nodes have chkp reference to their instrumented versions. */
3071 && instrumented_version
3072 && !instrumentation_clone
)
3074 bool ref_found
= false;
3076 struct ipa_ref
*ref
;
3078 for (i
= 0; iterate_reference (i
, ref
); i
++)
3079 if (ref
->use
== IPA_REF_CHKP
)
3083 error ("Node has more than one chkp reference");
3086 if (ref
->referred
!= instrumented_version
)
3088 error ("Wrong node is referenced with chkp reference");
3096 error ("Analyzed node has no reference to instrumented version");
3101 if (instrumentation_clone
3102 && DECL_BUILT_IN_CLASS (decl
) == NOT_BUILT_IN
)
3104 tree name
= DECL_ASSEMBLER_NAME (decl
);
3105 tree orig_name
= DECL_ASSEMBLER_NAME (orig_decl
);
3107 if (!IDENTIFIER_TRANSPARENT_ALIAS (name
)
3108 || TREE_CHAIN (name
) != orig_name
)
3110 error ("Alias chain for instrumented node is broken");
3115 if (analyzed
&& thunk
.thunk_p
)
3119 error ("No edge out of thunk node");
3122 else if (callees
->next_callee
)
3124 error ("More than one edge out of thunk node");
3127 if (gimple_has_body_p (decl
))
3129 error ("Thunk is not supposed to have body");
3132 if (thunk
.add_pointer_bounds_args
3133 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3135 error ("Instrumentation thunk has wrong edge callee");
3139 else if (analyzed
&& gimple_has_body_p (decl
)
3140 && !TREE_ASM_WRITTEN (decl
)
3141 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3146 hash_set
<gimple
*> stmts
;
3148 ipa_ref
*ref
= NULL
;
3150 /* Reach the trees by walking over the CFG, and note the
3151 enclosing basic-blocks in the call edges. */
3152 FOR_EACH_BB_FN (this_block
, this_cfun
)
3154 for (gsi
= gsi_start_phis (this_block
);
3155 !gsi_end_p (gsi
); gsi_next (&gsi
))
3156 stmts
.add (gsi_stmt (gsi
));
3157 for (gsi
= gsi_start_bb (this_block
);
3161 gimple
*stmt
= gsi_stmt (gsi
);
3163 if (is_gimple_call (stmt
))
3165 cgraph_edge
*e
= get_edge (stmt
);
3166 tree decl
= gimple_call_fndecl (stmt
);
3171 error ("shared call_stmt:");
3172 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3175 if (!e
->indirect_unknown_callee
)
3177 if (e
->verify_corresponds_to_fndecl (decl
))
3179 error ("edge points to wrong declaration:");
3180 debug_tree (e
->callee
->decl
);
3181 fprintf (stderr
," Instead of:");
3188 error ("an indirect edge with unknown callee "
3189 "corresponding to a call_stmt with "
3190 "a known declaration:");
3192 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3198 error ("missing callgraph edge for call stmt:");
3199 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3205 for (i
= 0; iterate_reference (i
, ref
); i
++)
3206 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3208 error ("reference to dead statement");
3209 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3214 /* No CFG available?! */
3217 for (e
= callees
; e
; e
= e
->next_callee
)
3221 error ("edge %s->%s has no corresponding call_stmt",
3222 identifier_to_locale (e
->caller
->name ()),
3223 identifier_to_locale (e
->callee
->name ()));
3224 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3229 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3231 if (!e
->aux
&& !e
->speculative
)
3233 error ("an indirect edge from %s has no corresponding call_stmt",
3234 identifier_to_locale (e
->caller
->name ()));
3235 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3244 internal_error ("verify_cgraph_node failed");
3246 timevar_pop (TV_CGRAPH_VERIFY
);
3249 /* Verify whole cgraph structure. */
3251 cgraph_node::verify_cgraph_nodes (void)
3258 FOR_EACH_FUNCTION (node
)
3262 /* Walk the alias chain to return the function cgraph_node is alias of.
3263 Walk through thunks, too.
3264 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3267 cgraph_node::function_symbol (enum availability
*availability
)
3269 cgraph_node
*node
= ultimate_alias_target (availability
);
3271 while (node
->thunk
.thunk_p
)
3273 node
= node
->callees
->callee
;
3276 enum availability a
;
3277 a
= node
->get_availability ();
3278 if (a
< *availability
)
3281 node
= node
->ultimate_alias_target (availability
);
3286 /* Walk the alias chain to return the function cgraph_node is alias of.
3287 Walk through non virtual thunks, too. Thus we return either a function
3288 or a virtual thunk node.
3289 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3292 cgraph_node::function_or_virtual_thunk_symbol
3293 (enum availability
*availability
)
3295 cgraph_node
*node
= ultimate_alias_target (availability
);
3297 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3299 node
= node
->callees
->callee
;
3302 enum availability a
;
3303 a
= node
->get_availability ();
3304 if (a
< *availability
)
3307 node
= node
->ultimate_alias_target (availability
);
3312 /* When doing LTO, read cgraph_node's body from disk if it is not already
3316 cgraph_node::get_untransformed_body (void)
3318 lto_file_decl_data
*file_data
;
3319 const char *data
, *name
;
3321 tree decl
= this->decl
;
3323 /* Check if body is already there. Either we have gimple body or
3324 the function is thunk and in that case we set DECL_ARGUMENTS. */
3325 if (DECL_ARGUMENTS (decl
) || gimple_has_body_p (decl
))
3328 gcc_assert (in_lto_p
&& !DECL_RESULT (decl
));
3330 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3332 file_data
= lto_file_data
;
3333 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3335 /* We may have renamed the declaration, e.g., a static function. */
3336 name
= lto_get_decl_name_mapping (file_data
, name
);
3337 struct lto_in_decl_state
*decl_state
3338 = lto_get_function_in_decl_state (file_data
, decl
);
3340 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3341 name
, &len
, decl_state
->compressed
);
3343 fatal_error (input_location
, "%s: section %s is missing",
3344 file_data
->file_name
,
3347 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3349 lto_input_function_body (file_data
, this, data
);
3350 lto_stats
.num_function_bodies
++;
3351 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3352 data
, len
, decl_state
->compressed
);
3353 lto_free_function_in_decl_state_for_node (this);
3354 /* Keep lto file data so ipa-inline-analysis knows about cross module
3357 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3362 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3363 if it is not already present. When some IPA transformations are scheduled,
3367 cgraph_node::get_body (void)
3371 updated
= get_untransformed_body ();
3373 /* Getting transformed body makes no sense for inline clones;
3374 we should never use this on real clones because they are materialized
3376 TODO: Materializing clones here will likely lead to smaller LTRANS
3378 gcc_assert (!global
.inlined_to
&& !clone_of
);
3379 if (ipa_transforms_to_apply
.exists ())
3381 opt_pass
*saved_current_pass
= current_pass
;
3382 FILE *saved_dump_file
= dump_file
;
3383 const char *saved_dump_file_name
= dump_file_name
;
3384 int saved_dump_flags
= dump_flags
;
3385 dump_file_name
= NULL
;
3388 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3389 execute_all_ipa_transforms ();
3390 cgraph_edge::rebuild_edges ();
3391 free_dominance_info (CDI_DOMINATORS
);
3392 free_dominance_info (CDI_POST_DOMINATORS
);
3396 current_pass
= saved_current_pass
;
3397 dump_file
= saved_dump_file
;
3398 dump_file_name
= saved_dump_file_name
;
3399 dump_flags
= saved_dump_flags
;
3404 /* Return the DECL_STRUCT_FUNCTION of the function. */
3407 cgraph_node::get_fun (void)
3409 cgraph_node
*node
= this;
3410 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3412 while (!fun
&& node
->clone_of
)
3414 node
= node
->clone_of
;
3415 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3421 /* Verify if the type of the argument matches that of the function
3422 declaration. If we cannot verify this or there is a mismatch,
3426 gimple_check_call_args (gimple
*stmt
, tree fndecl
, bool args_count_match
)
3429 unsigned int i
, nargs
;
3431 /* Calls to internal functions always match their signature. */
3432 if (gimple_call_internal_p (stmt
))
3435 nargs
= gimple_call_num_args (stmt
);
3437 /* Get argument types for verification. */
3439 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3441 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3443 /* Verify if the type of the argument matches that of the function
3444 declaration. If we cannot verify this or there is a mismatch,
3446 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3448 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3450 i
++, p
= DECL_CHAIN (p
))
3453 /* We cannot distinguish a varargs function from the case
3454 of excess parameters, still deferring the inlining decision
3455 to the callee is possible. */
3458 arg
= gimple_call_arg (stmt
, i
);
3459 if (p
== error_mark_node
3460 || DECL_ARG_TYPE (p
) == error_mark_node
3461 || arg
== error_mark_node
3462 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3463 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3466 if (args_count_match
&& p
)
3471 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3474 /* If this is a varargs function defer inlining decision
3478 arg
= gimple_call_arg (stmt
, i
);
3479 if (TREE_VALUE (p
) == error_mark_node
3480 || arg
== error_mark_node
3481 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3482 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3483 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3495 /* Verify if the type of the argument and lhs of CALL_STMT matches
3496 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3497 true, the arg count needs to be the same.
3498 If we cannot verify this or there is a mismatch, return false. */
3501 gimple_check_call_matching_types (gimple
*call_stmt
, tree callee
,
3502 bool args_count_match
)
3506 if ((DECL_RESULT (callee
)
3507 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3508 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3509 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3511 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3512 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3517 /* Reset all state within cgraph.c so that we can rerun the compiler
3518 within the same process. For use by toplev::finalize. */
3521 cgraph_c_finalize (void)
3525 x_cgraph_nodes_queue
= NULL
;
3527 cgraph_fnver_htab
= NULL
;
3528 version_info_node
= NULL
;
3531 /* A wroker for call_for_symbol_and_aliases. */
3534 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3537 bool include_overwritable
)
3540 FOR_EACH_ALIAS (this, ref
)
3542 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3543 if (include_overwritable
3544 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3545 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3546 include_overwritable
))
3552 /* Return true if NODE has thunk. */
3555 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3557 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3558 if (e
->caller
->thunk
.thunk_p
)
3563 #include "gt-cgraph.h"