1 /* Callgraph handling code.
2 Copyright (C) 2003-2014 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file contains basic routines manipulating call graph
23 The call-graph is a data structure designed for intra-procedural optimization.
24 It represents a multi-graph where nodes are functions and edges are call sites. */
28 #include "coretypes.h"
33 #include "print-tree.h"
34 #include "tree-inline.h"
35 #include "langhooks.h"
43 #include "dominance.h"
45 #include "basic-block.h"
48 #include "plugin-api.h"
51 #include "hard-reg-set.h"
57 #include "tree-ssa-alias.h"
58 #include "internal-fn.h"
60 #include "gimple-expr.h"
62 #include "gimple-iterator.h"
65 #include "gimple-ssa.h"
68 #include "value-prof.h"
70 #include "diagnostic-core.h"
72 #include "ipa-utils.h"
73 #include "lto-streamer.h"
74 #include "alloc-pool.h"
76 #include "ipa-inline.h"
78 #include "gimple-pretty-print.h"
83 #include "tree-chkp.h"
86 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
87 #include "tree-pass.h"
89 /* Queue of cgraph nodes scheduled to be lowered. */
90 symtab_node
*x_cgraph_nodes_queue
;
91 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
93 /* Symbol table global context. */
96 /* List of hooks triggered on cgraph_edge events. */
97 struct cgraph_edge_hook_list
{
98 cgraph_edge_hook hook
;
100 struct cgraph_edge_hook_list
*next
;
103 /* List of hooks triggered on cgraph_node events. */
104 struct cgraph_node_hook_list
{
105 cgraph_node_hook hook
;
107 struct cgraph_node_hook_list
*next
;
110 /* List of hooks triggered on events involving two cgraph_edges. */
111 struct cgraph_2edge_hook_list
{
112 cgraph_2edge_hook hook
;
114 struct cgraph_2edge_hook_list
*next
;
117 /* List of hooks triggered on events involving two cgraph_nodes. */
118 struct cgraph_2node_hook_list
{
119 cgraph_2node_hook hook
;
121 struct cgraph_2node_hook_list
*next
;
124 /* Hash descriptor for cgraph_function_version_info. */
126 struct function_version_hasher
: ggc_hasher
<cgraph_function_version_info
*>
128 static hashval_t
hash (cgraph_function_version_info
*);
129 static bool equal (cgraph_function_version_info
*,
130 cgraph_function_version_info
*);
133 /* Map a cgraph_node to cgraph_function_version_info using this htab.
134 The cgraph_function_version_info has a THIS_NODE field that is the
135 corresponding cgraph_node.. */
137 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
139 /* Hash function for cgraph_fnver_htab. */
141 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
143 int uid
= ptr
->this_node
->uid
;
144 return (hashval_t
)(uid
);
147 /* eq function for cgraph_fnver_htab. */
149 function_version_hasher::equal (cgraph_function_version_info
*n1
,
150 cgraph_function_version_info
*n2
)
152 return n1
->this_node
->uid
== n2
->this_node
->uid
;
155 /* Mark as GC root all allocated nodes. */
156 static GTY(()) struct cgraph_function_version_info
*
157 version_info_node
= NULL
;
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
);
500 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
502 node
->offloadable
= 1;
503 #ifdef ENABLE_OFFLOADING
504 g
->have_offload
= true;
508 node
->register_symbol ();
510 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
512 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
513 node
->next_nested
= node
->origin
->nested
;
514 node
->origin
->nested
= node
;
519 /* Try to find a call graph node for declaration DECL and if it does not exist
520 or if it corresponds to an inline clone, create a new one. */
523 cgraph_node::get_create (tree decl
)
525 cgraph_node
*first_clone
= cgraph_node::get (decl
);
527 if (first_clone
&& !first_clone
->global
.inlined_to
)
530 cgraph_node
*node
= cgraph_node::create (decl
);
533 first_clone
->clone_of
= node
;
534 node
->clones
= first_clone
;
535 symtab
->symtab_prevail_in_asm_name_hash (node
);
536 node
->decl
->decl_with_vis
.symtab_node
= node
;
538 fprintf (dump_file
, "Introduced new external node "
539 "(%s/%i) and turned into root of the clone tree.\n",
540 xstrdup_for_dump (node
->name ()), node
->order
);
543 fprintf (dump_file
, "Introduced new external node "
544 "(%s/%i).\n", xstrdup_for_dump (node
->name ()),
549 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
550 the function body is associated with (not necessarily cgraph_node (DECL). */
553 cgraph_node::create_alias (tree alias
, tree target
)
555 cgraph_node
*alias_node
;
557 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
558 || TREE_CODE (target
) == IDENTIFIER_NODE
);
559 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
560 alias_node
= cgraph_node::get_create (alias
);
561 gcc_assert (!alias_node
->definition
);
562 alias_node
->alias_target
= target
;
563 alias_node
->definition
= true;
564 alias_node
->alias
= true;
565 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
566 alias_node
->weakref
= true;
570 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
572 Same body aliases are output whenever the body of DECL is output,
573 and cgraph_node::get (ALIAS) transparently returns
574 cgraph_node::get (DECL). */
577 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
580 #ifndef ASM_OUTPUT_DEF
581 /* If aliases aren't supported by the assembler, fail. */
584 /* Langhooks can create same body aliases of symbols not defined.
585 Those are useless. Drop them on the floor. */
586 if (symtab
->global_info_ready
)
589 n
= cgraph_node::create_alias (alias
, decl
);
590 n
->cpp_implicit_alias
= true;
591 if (symtab
->cpp_implicit_aliases_done
)
592 n
->resolve_alias (cgraph_node::get (decl
));
596 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
597 aliases DECL with an adjustments made into the first parameter.
598 See comments in thunk_adjust for detail on the parameters. */
601 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
602 HOST_WIDE_INT fixed_offset
,
603 HOST_WIDE_INT virtual_value
,
609 node
= cgraph_node::get (alias
);
613 node
= cgraph_node::create (alias
);
614 gcc_checking_assert (!virtual_offset
615 || wi::eq_p (virtual_offset
, virtual_value
));
616 node
->thunk
.fixed_offset
= fixed_offset
;
617 node
->thunk
.this_adjusting
= this_adjusting
;
618 node
->thunk
.virtual_value
= virtual_value
;
619 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
620 node
->thunk
.alias
= real_alias
;
621 node
->thunk
.thunk_p
= true;
622 node
->definition
= true;
627 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
628 Return NULL if there's no such node. */
631 cgraph_node::get_for_asmname (tree asmname
)
633 /* We do not want to look at inline clones. */
634 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
636 node
= node
->next_sharing_asm_name
)
638 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
639 if (cn
&& !cn
->global
.inlined_to
)
645 /* Returns a hash value for X (which really is a cgraph_edge). */
648 cgraph_edge_hasher::hash (cgraph_edge
*e
)
650 return htab_hash_pointer (e
->call_stmt
);
653 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
656 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple y
)
658 return x
->call_stmt
== y
;
661 /* Add call graph edge E to call site hash of its caller. */
664 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
666 gimple call
= e
->call_stmt
;
667 *e
->caller
->call_site_hash
->find_slot_with_hash (call
,
668 htab_hash_pointer (call
),
672 /* Add call graph edge E to call site hash of its caller. */
675 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
677 /* There are two speculative edges for every statement (one direct,
678 one indirect); always hash the direct one. */
679 if (e
->speculative
&& e
->indirect_unknown_callee
)
681 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
683 htab_hash_pointer (e
->call_stmt
), INSERT
);
686 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
691 gcc_assert (!*slot
|| e
->speculative
);
695 /* Return the callgraph edge representing the GIMPLE_CALL statement
699 cgraph_node::get_edge (gimple call_stmt
)
705 return call_site_hash
->find_with_hash (call_stmt
,
706 htab_hash_pointer (call_stmt
));
708 /* This loop may turn out to be performance problem. In such case adding
709 hashtables into call nodes with very many edges is probably best
710 solution. It is not good idea to add pointer into CALL_EXPR itself
711 because we want to make possible having multiple cgraph nodes representing
712 different clones of the same body before the body is actually cloned. */
713 for (e
= callees
; e
; e
= e
->next_callee
)
715 if (e
->call_stmt
== call_stmt
)
721 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
723 if (e
->call_stmt
== call_stmt
)
730 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
731 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
732 cgraph_add_edge_to_call_site_hash (e2
);
733 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
734 cgraph_add_edge_to_call_site_hash (e2
);
741 /* Change field call_stmt of edge to NEW_STMT.
742 If UPDATE_SPECULATIVE and E is any component of speculative
743 edge, then update all components. */
746 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
750 /* Speculative edges has three component, update all of them
752 if (update_speculative
&& speculative
)
754 cgraph_edge
*direct
, *indirect
;
757 speculative_call_info (direct
, indirect
, ref
);
758 direct
->set_call_stmt (new_stmt
, false);
759 indirect
->set_call_stmt (new_stmt
, false);
760 ref
->stmt
= new_stmt
;
764 /* Only direct speculative edges go to call_site_hash. */
765 if (caller
->call_site_hash
766 && (!speculative
|| !indirect_unknown_callee
))
768 caller
->call_site_hash
->remove_elt_with_hash
769 (call_stmt
, htab_hash_pointer (call_stmt
));
772 cgraph_edge
*e
= this;
774 call_stmt
= new_stmt
;
775 if (indirect_unknown_callee
776 && (decl
= gimple_call_fndecl (new_stmt
)))
778 /* Constant propagation (and possibly also inlining?) can turn an
779 indirect call into a direct one. */
780 cgraph_node
*new_callee
= cgraph_node::get (decl
);
782 gcc_checking_assert (new_callee
);
783 e
= make_direct (new_callee
);
786 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
787 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
789 if (e
->caller
->call_site_hash
)
790 cgraph_add_edge_to_call_site_hash (e
);
793 /* Allocate a cgraph_edge structure and fill it with data according to the
794 parameters of which only CALLEE can be NULL (when creating an indirect call
798 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
799 gcall
*call_stmt
, gcov_type count
, int freq
,
800 bool indir_unknown_callee
)
804 /* LTO does not actually have access to the call_stmt since these
805 have not been loaded yet. */
808 /* This is a rather expensive check possibly triggering
809 construction of call stmt hashtable. */
810 #ifdef ENABLE_CHECKING
812 gcc_checking_assert (
813 !(e
= caller
->get_edge (call_stmt
)) || e
->speculative
);
816 gcc_assert (is_gimple_call (call_stmt
));
822 free_edges
= NEXT_FREE_EDGE (edge
);
826 edge
= ggc_alloc
<cgraph_edge
> ();
827 edge
->uid
= edges_max_uid
++;
833 edge
->caller
= caller
;
834 edge
->callee
= callee
;
835 edge
->prev_caller
= NULL
;
836 edge
->next_caller
= NULL
;
837 edge
->prev_callee
= NULL
;
838 edge
->next_callee
= NULL
;
839 edge
->lto_stmt_uid
= 0;
842 gcc_assert (count
>= 0);
843 edge
->frequency
= freq
;
844 gcc_assert (freq
>= 0);
845 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
847 edge
->call_stmt
= call_stmt
;
848 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
849 edge
->can_throw_external
850 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
853 && callee
&& callee
->decl
854 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
856 edge
->call_stmt_cannot_inline_p
= true;
858 edge
->call_stmt_cannot_inline_p
= false;
860 edge
->indirect_info
= NULL
;
861 edge
->indirect_inlining_edge
= 0;
862 edge
->speculative
= false;
863 edge
->indirect_unknown_callee
= indir_unknown_callee
;
864 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
865 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
866 edge
->in_polymorphic_cdtor
867 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
870 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
871 if (call_stmt
&& caller
->call_site_hash
)
872 cgraph_add_edge_to_call_site_hash (edge
);
877 /* Create edge from a given function to CALLEE in the cgraph. */
880 cgraph_node::create_edge (cgraph_node
*callee
,
881 gcall
*call_stmt
, gcov_type count
, int freq
)
883 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
886 initialize_inline_failed (edge
);
888 edge
->next_caller
= callee
->callers
;
890 callee
->callers
->prev_caller
= edge
;
891 edge
->next_callee
= callees
;
893 callees
->prev_callee
= edge
;
895 callee
->callers
= edge
;
900 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
902 cgraph_indirect_call_info
*
903 cgraph_allocate_init_indirect_info (void)
905 cgraph_indirect_call_info
*ii
;
907 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
908 ii
->param_index
= -1;
912 /* Create an indirect edge with a yet-undetermined callee where the call
913 statement destination is a formal parameter of the caller with index
917 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
918 gcov_type count
, int freq
,
919 bool compute_indirect_info
)
921 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
925 initialize_inline_failed (edge
);
927 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
928 edge
->indirect_info
->ecf_flags
= ecf_flags
;
929 edge
->indirect_info
->vptr_changed
= true;
931 /* Record polymorphic call info. */
932 if (compute_indirect_info
934 && (target
= gimple_call_fn (call_stmt
))
935 && virtual_method_call_p (target
))
937 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
939 /* Only record types can have virtual calls. */
940 edge
->indirect_info
->polymorphic
= true;
941 edge
->indirect_info
->param_index
= -1;
942 edge
->indirect_info
->otr_token
943 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
944 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
945 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
946 edge
->indirect_info
->context
= context
;
949 edge
->next_callee
= indirect_calls
;
951 indirect_calls
->prev_callee
= edge
;
952 indirect_calls
= edge
;
957 /* Remove the edge from the list of the callers of the callee. */
960 cgraph_edge::remove_callee (void)
962 gcc_assert (!indirect_unknown_callee
);
964 prev_caller
->next_caller
= next_caller
;
966 next_caller
->prev_caller
= prev_caller
;
968 callee
->callers
= next_caller
;
971 /* Remove the edge from the list of the callees of the caller. */
974 cgraph_edge::remove_caller (void)
977 prev_callee
->next_callee
= next_callee
;
979 next_callee
->prev_callee
= prev_callee
;
982 if (indirect_unknown_callee
)
983 caller
->indirect_calls
= next_callee
;
985 caller
->callees
= next_callee
;
987 if (caller
->call_site_hash
)
988 caller
->call_site_hash
->remove_elt_with_hash (call_stmt
,
989 htab_hash_pointer (call_stmt
));
992 /* Put the edge onto the free list. */
995 symbol_table::free_edge (cgraph_edge
*e
)
999 if (e
->indirect_info
)
1000 ggc_free (e
->indirect_info
);
1002 /* Clear out the edge so we do not dangle pointers. */
1003 memset (e
, 0, sizeof (*e
));
1005 NEXT_FREE_EDGE (e
) = free_edges
;
1010 /* Remove the edge in the cgraph. */
1013 cgraph_edge::remove (void)
1015 /* Call all edge removal hooks. */
1016 symtab
->call_edge_removal_hooks (this);
1018 if (!indirect_unknown_callee
)
1019 /* Remove from callers list of the callee. */
1022 /* Remove from callees list of the callers. */
1025 /* Put the edge onto the free list. */
1026 symtab
->free_edge (this);
1029 /* Set callee of call graph edge E and add it to the corresponding set of
1033 cgraph_set_edge_callee (cgraph_edge
*e
, cgraph_node
*n
)
1035 e
->prev_caller
= NULL
;
1037 n
->callers
->prev_caller
= e
;
1038 e
->next_caller
= n
->callers
;
1043 /* Turn edge into speculative call calling N2. Update
1044 the profile so the direct call is taken COUNT times
1047 At clone materialization time, the indirect call E will
1050 if (call_dest == N2)
1055 At this time the function just creates the direct call,
1056 the referencd representing the if conditional and attaches
1057 them all to the orginal indirect call statement.
1059 Return direct edge created. */
1062 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1063 int direct_frequency
)
1065 cgraph_node
*n
= caller
;
1066 ipa_ref
*ref
= NULL
;
1071 fprintf (dump_file
, "Indirect call -> speculative call"
1072 " %s/%i => %s/%i\n",
1073 xstrdup_for_dump (n
->name ()), n
->order
,
1074 xstrdup_for_dump (n2
->name ()), n2
->order
);
1077 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1078 initialize_inline_failed (e2
);
1079 e2
->speculative
= true;
1080 if (TREE_NOTHROW (n2
->decl
))
1081 e2
->can_throw_external
= false;
1083 e2
->can_throw_external
= can_throw_external
;
1084 e2
->lto_stmt_uid
= lto_stmt_uid
;
1085 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1087 frequency
-= e2
->frequency
;
1088 symtab
->call_edge_duplication_hooks (this, e2
);
1089 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1090 ref
->lto_stmt_uid
= lto_stmt_uid
;
1091 ref
->speculative
= speculative
;
1092 n2
->mark_address_taken ();
1096 /* Speculative call consist of three components:
1097 1) an indirect edge representing the original call
1098 2) an direct edge representing the new call
1099 3) ADDR_EXPR reference representing the speculative check.
1100 All three components are attached to single statement (the indirect
1101 call) and if one of them exists, all of them must exist.
1103 Given speculative call edge, return all three components.
1107 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1108 cgraph_edge
*&indirect
,
1109 ipa_ref
*&reference
)
1114 cgraph_edge
*e
= this;
1116 if (!e
->indirect_unknown_callee
)
1117 for (e2
= e
->caller
->indirect_calls
;
1118 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1119 e2
= e2
->next_callee
)
1124 /* We can take advantage of the call stmt hash. */
1127 e
= e
->caller
->get_edge (e2
->call_stmt
);
1128 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1131 for (e
= e
->caller
->callees
;
1132 e2
->call_stmt
!= e
->call_stmt
1133 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1137 gcc_assert (e
->speculative
&& e2
->speculative
);
1142 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1143 if (ref
->speculative
1144 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1145 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1151 /* Speculative edge always consist of all three components - direct edge,
1152 indirect and reference. */
1154 gcc_assert (e
&& e2
&& ref
);
1157 /* Redirect callee of the edge to N. The function does not update underlying
1161 cgraph_edge::redirect_callee (cgraph_node
*n
)
1163 /* Remove from callers list of the current callee. */
1166 /* Insert to callers list of the new callee. */
1167 cgraph_set_edge_callee (this, n
);
1170 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1171 Remove the speculative call sequence and return edge representing the call.
1172 It is up to caller to redirect the call as appropriate. */
1175 cgraph_edge::resolve_speculation (tree callee_decl
)
1177 cgraph_edge
*edge
= this;
1181 gcc_assert (edge
->speculative
);
1182 edge
->speculative_call_info (e2
, edge
, ref
);
1184 || !ref
->referred
->semantically_equivalent_p
1185 (symtab_node::get (callee_decl
)))
1191 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1192 "turned out to have contradicting known target ",
1193 xstrdup_for_dump (edge
->caller
->name ()),
1194 edge
->caller
->order
,
1195 xstrdup_for_dump (e2
->callee
->name ()),
1197 print_generic_expr (dump_file
, callee_decl
, 0);
1198 fprintf (dump_file
, "\n");
1202 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1203 xstrdup_for_dump (edge
->caller
->name ()),
1204 edge
->caller
->order
,
1205 xstrdup_for_dump (e2
->callee
->name ()),
1212 cgraph_edge
*tmp
= edge
;
1214 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1217 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1218 in the functions inlined through it. */
1220 edge
->count
+= e2
->count
;
1221 edge
->frequency
+= e2
->frequency
;
1222 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1223 edge
->frequency
= CGRAPH_FREQ_MAX
;
1224 edge
->speculative
= false;
1225 e2
->speculative
= false;
1226 ref
->remove_reference ();
1227 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1230 e2
->callee
->remove_symbol_and_inline_clones ();
1231 if (edge
->caller
->call_site_hash
)
1232 cgraph_update_edge_in_call_site_hash (edge
);
1236 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1237 CALLEE. DELTA is an integer constant that is to be added to the this
1238 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1241 cgraph_edge::make_direct (cgraph_node
*callee
)
1243 cgraph_edge
*edge
= this;
1244 gcc_assert (indirect_unknown_callee
);
1246 /* If we are redirecting speculative call, make it non-speculative. */
1247 if (indirect_unknown_callee
&& speculative
)
1249 edge
= edge
->resolve_speculation (callee
->decl
);
1251 /* On successful speculation just return the pre existing direct edge. */
1252 if (!indirect_unknown_callee
)
1256 indirect_unknown_callee
= 0;
1257 ggc_free (indirect_info
);
1258 indirect_info
= NULL
;
1260 /* Get the edge out of the indirect edge list. */
1262 prev_callee
->next_callee
= next_callee
;
1264 next_callee
->prev_callee
= prev_callee
;
1266 caller
->indirect_calls
= next_callee
;
1268 /* Put it into the normal callee list */
1270 next_callee
= caller
->callees
;
1271 if (caller
->callees
)
1272 caller
->callees
->prev_callee
= edge
;
1273 caller
->callees
= edge
;
1275 /* Insert to callers list of the new callee. */
1276 cgraph_set_edge_callee (edge
, callee
);
1279 call_stmt_cannot_inline_p
1280 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1283 /* We need to re-determine the inlining status of the edge. */
1284 initialize_inline_failed (edge
);
1288 /* If necessary, change the function declaration in the call statement
1289 associated with E so that it corresponds to the edge callee. */
1292 cgraph_edge::redirect_call_stmt_to_callee (void)
1294 cgraph_edge
*e
= this;
1296 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1297 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1299 gimple_stmt_iterator gsi
;
1300 #ifdef ENABLE_CHECKING
1310 e
->speculative_call_info (e
, e2
, ref
);
1311 /* If there already is an direct call (i.e. as a result of inliner's
1312 substitution), forget about speculating. */
1314 e
= e
->resolve_speculation (decl
);
1315 /* If types do not match, speculation was likely wrong.
1316 The direct edge was posisbly redirected to the clone with a different
1317 signature. We did not update the call statement yet, so compare it
1318 with the reference that still points to the proper type. */
1319 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1320 ref
->referred
->decl
,
1324 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1326 xstrdup_for_dump (e
->caller
->name ()),
1328 xstrdup_for_dump (e
->callee
->name ()),
1330 e
= e
->resolve_speculation ();
1331 /* We are producing the final function body and will throw away the
1332 callgraph edges really soon. Reset the counts/frequencies to
1333 keep verifier happy in the case of roundoff errors. */
1334 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1335 e
->frequency
= compute_call_stmt_bb_frequency
1336 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1338 /* Expand speculation into GIMPLE code. */
1343 "Expanding speculative call of %s/%i -> %s/%i count:"
1345 xstrdup_for_dump (e
->caller
->name ()),
1347 xstrdup_for_dump (e
->callee
->name ()),
1350 gcc_assert (e2
->speculative
);
1351 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1352 new_stmt
= gimple_ic (e
->call_stmt
, dyn_cast
<cgraph_node
*> (ref
->referred
),
1353 e
->count
|| e2
->count
1354 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1355 e
->count
+ e2
->count
)
1356 : e
->frequency
|| e2
->frequency
1357 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1358 e
->frequency
+ e2
->frequency
)
1359 : REG_BR_PROB_BASE
/ 2,
1360 e
->count
, e
->count
+ e2
->count
);
1361 e
->speculative
= false;
1362 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1365 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1366 processed call stmt. */
1367 if (gimple_call_with_bounds_p (new_stmt
)
1368 && gimple_call_lhs (new_stmt
)
1369 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1371 tree dresult
= gimple_call_lhs (new_stmt
);
1372 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1373 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1374 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1375 struct cgraph_edge
*iedge
1376 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1377 struct cgraph_edge
*dedge
;
1381 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1384 dedge
->frequency
= compute_call_stmt_bb_frequency
1385 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1387 iedge
->frequency
= compute_call_stmt_bb_frequency
1388 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1391 e
->frequency
= compute_call_stmt_bb_frequency
1392 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1393 e2
->frequency
= compute_call_stmt_bb_frequency
1394 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1395 e2
->speculative
= false;
1396 ref
->speculative
= false;
1398 /* Indirect edges are not both in the call site hash.
1400 if (e
->caller
->call_site_hash
)
1401 cgraph_update_edge_in_call_site_hash (e2
);
1403 /* Continue redirecting E to proper target. */
1407 if (e
->indirect_unknown_callee
1408 || decl
== e
->callee
->decl
)
1409 return e
->call_stmt
;
1411 #ifdef ENABLE_CHECKING
1414 node
= cgraph_node::get (decl
);
1415 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1419 if (symtab
->dump_file
)
1421 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1422 xstrdup_for_dump (e
->caller
->name ()), e
->caller
->order
,
1423 xstrdup_for_dump (e
->callee
->name ()), e
->callee
->order
);
1424 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1425 if (e
->callee
->clone
.combined_args_to_skip
)
1427 fprintf (symtab
->dump_file
, " combined args to skip: ");
1428 dump_bitmap (symtab
->dump_file
,
1429 e
->callee
->clone
.combined_args_to_skip
);
1433 if (e
->callee
->clone
.combined_args_to_skip
)
1438 = gimple_call_copy_skip_args (e
->call_stmt
,
1439 e
->callee
->clone
.combined_args_to_skip
);
1440 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1441 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1443 if (gimple_vdef (new_stmt
)
1444 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1445 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1447 gsi
= gsi_for_stmt (e
->call_stmt
);
1448 gsi_replace (&gsi
, new_stmt
, false);
1449 /* We need to defer cleaning EH info on the new statement to
1450 fixup-cfg. We may not have dominator information at this point
1451 and thus would end up with unreachable blocks and have no way
1452 to communicate that we need to run CFG cleanup then. */
1453 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1456 remove_stmt_from_eh_lp (e
->call_stmt
);
1457 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1462 new_stmt
= e
->call_stmt
;
1463 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1464 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1467 /* If the call becomes noreturn, remove the lhs. */
1468 if (lhs
&& (gimple_call_flags (new_stmt
) & ECF_NORETURN
))
1470 if (TREE_CODE (lhs
) == SSA_NAME
)
1472 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1473 TREE_TYPE (lhs
), NULL
);
1474 var
= get_or_create_ssa_default_def
1475 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1476 gimple set_stmt
= gimple_build_assign (lhs
, var
);
1477 gsi
= gsi_for_stmt (new_stmt
);
1478 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1479 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1481 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1482 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1485 /* If new callee has no static chain, remove it. */
1486 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1488 gimple_call_set_chain (new_stmt
, NULL
);
1489 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1492 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1494 if (symtab
->dump_file
)
1496 fprintf (symtab
->dump_file
, " updated to:");
1497 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1502 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1503 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1504 of OLD_STMT if it was previously call statement.
1505 If NEW_STMT is NULL, the call has been dropped without any
1509 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1510 gimple old_stmt
, tree old_call
,
1513 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1514 ? gimple_call_fndecl (new_stmt
) : 0;
1516 /* We are seeing indirect calls, then there is nothing to update. */
1517 if (!new_call
&& !old_call
)
1519 /* See if we turned indirect call into direct call or folded call to one builtin
1520 into different builtin. */
1521 if (old_call
!= new_call
)
1523 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1524 cgraph_edge
*ne
= NULL
;
1530 /* See if the edge is already there and has the correct callee. It
1531 might be so because of indirect inlining has already updated
1532 it. We also might've cloned and redirected the edge. */
1533 if (new_call
&& e
->callee
)
1535 cgraph_node
*callee
= e
->callee
;
1538 if (callee
->decl
== new_call
1539 || callee
->former_clone_of
== new_call
)
1541 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1544 callee
= callee
->clone_of
;
1548 /* Otherwise remove edge and create new one; we can't simply redirect
1549 since function has changed, so inline plan and other information
1550 attached to edge is invalid. */
1552 frequency
= e
->frequency
;
1553 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1556 e
->callee
->remove_symbol_and_inline_clones ();
1560 /* We are seeing new direct call; compute profile info based on BB. */
1561 basic_block bb
= gimple_bb (new_stmt
);
1563 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1569 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1570 as_a
<gcall
*> (new_stmt
), count
,
1572 gcc_assert (ne
->inline_failed
);
1575 /* We only updated the call stmt; update pointer in cgraph edge.. */
1576 else if (old_stmt
!= new_stmt
)
1577 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1580 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1581 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1582 of OLD_STMT before it was updated (updating can happen inplace). */
1585 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1587 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1590 gcc_checking_assert (orig
);
1591 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1593 for (node
= orig
->clones
; node
!= orig
;)
1595 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1597 node
= node
->clones
;
1598 else if (node
->next_sibling_clone
)
1599 node
= node
->next_sibling_clone
;
1602 while (node
!= orig
&& !node
->next_sibling_clone
)
1603 node
= node
->clone_of
;
1605 node
= node
->next_sibling_clone
;
1611 /* Remove all callees from the node. */
1614 cgraph_node::remove_callees (void)
1618 /* It is sufficient to remove the edges from the lists of callers of
1619 the callees. The callee list of the node can be zapped with one
1621 for (e
= callees
; e
; e
= f
)
1624 symtab
->call_edge_removal_hooks (e
);
1625 if (!e
->indirect_unknown_callee
)
1626 e
->remove_callee ();
1627 symtab
->free_edge (e
);
1629 for (e
= indirect_calls
; e
; e
= f
)
1632 symtab
->call_edge_removal_hooks (e
);
1633 if (!e
->indirect_unknown_callee
)
1634 e
->remove_callee ();
1635 symtab
->free_edge (e
);
1637 indirect_calls
= NULL
;
1641 call_site_hash
->empty ();
1642 call_site_hash
= NULL
;
1646 /* Remove all callers from the node. */
1649 cgraph_node::remove_callers (void)
1653 /* It is sufficient to remove the edges from the lists of callees of
1654 the callers. The caller list of the node can be zapped with one
1656 for (e
= callers
; e
; e
= f
)
1659 symtab
->call_edge_removal_hooks (e
);
1660 e
->remove_caller ();
1661 symtab
->free_edge (e
);
1666 /* Helper function for cgraph_release_function_body and free_lang_data.
1667 It releases body from function DECL without having to inspect its
1668 possibly non-existent symtab node. */
1671 release_function_body (tree decl
)
1673 if (DECL_STRUCT_FUNCTION (decl
))
1675 if (DECL_STRUCT_FUNCTION (decl
)->cfg
1676 || DECL_STRUCT_FUNCTION (decl
)->gimple_df
)
1678 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1682 cfun
->curr_properties
&= ~PROP_loops
;
1683 loop_optimizer_finalize ();
1685 if (cfun
->gimple_df
)
1688 delete_tree_cfg_annotations ();
1693 gcc_assert (!dom_info_available_p (CDI_DOMINATORS
));
1694 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS
));
1698 if (cfun
->value_histograms
)
1702 gimple_set_body (decl
, NULL
);
1703 /* Struct function hangs a lot of data that would leak if we didn't
1704 removed all pointers to it. */
1705 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1706 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1708 DECL_SAVED_TREE (decl
) = NULL
;
1711 /* Release memory used to represent body of function.
1712 Use this only for functions that are released before being translated to
1713 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1714 are free'd in final.c via free_after_compilation().
1715 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1718 cgraph_node::release_body (bool keep_arguments
)
1720 ipa_transforms_to_apply
.release ();
1721 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1723 DECL_RESULT (decl
) = NULL
;
1725 if (!keep_arguments
)
1726 DECL_ARGUMENTS (decl
) = NULL
;
1728 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1729 of its associated function function declaration because it's
1730 needed to emit debug info later. */
1731 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1732 DECL_INITIAL (decl
) = error_mark_node
;
1733 release_function_body (decl
);
1735 lto_free_function_in_decl_state_for_node (this);
1738 /* Remove function from symbol table. */
1741 cgraph_node::remove (void)
1744 int uid
= this->uid
;
1746 symtab
->call_cgraph_removal_hooks (this);
1749 ipa_transforms_to_apply
.release ();
1751 /* Incremental inlining access removed nodes stored in the postorder list.
1753 force_output
= false;
1754 forced_by_abi
= false;
1755 for (n
= nested
; n
; n
= n
->next_nested
)
1760 cgraph_node
**node2
= &origin
->nested
;
1762 while (*node2
!= this)
1763 node2
= &(*node2
)->next_nested
;
1764 *node2
= next_nested
;
1767 if (prev_sibling_clone
)
1768 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1770 clone_of
->clones
= next_sibling_clone
;
1771 if (next_sibling_clone
)
1772 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1775 cgraph_node
*n
, *next
;
1779 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1780 n
->clone_of
= clone_of
;
1781 n
->clone_of
= clone_of
;
1782 n
->next_sibling_clone
= clone_of
->clones
;
1783 if (clone_of
->clones
)
1784 clone_of
->clones
->prev_sibling_clone
= n
;
1785 clone_of
->clones
= clones
;
1789 /* We are removing node with clones. This makes clones inconsistent,
1790 but assume they will be removed subsequently and just keep clone
1791 tree intact. This can happen in unreachable function removal since
1792 we remove unreachable functions in random order, not by bottom-up
1793 walk of clone trees. */
1794 for (n
= clones
; n
; n
= next
)
1796 next
= n
->next_sibling_clone
;
1797 n
->next_sibling_clone
= NULL
;
1798 n
->prev_sibling_clone
= NULL
;
1804 /* While all the clones are removed after being proceeded, the function
1805 itself is kept in the cgraph even after it is compiled. Check whether
1806 we are done with this body and reclaim it proactively if this is the case.
1808 if (symtab
->state
!= LTO_STREAMING
)
1810 n
= cgraph_node::get (decl
);
1812 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1813 && (symtab
->global_info_ready
1814 && (TREE_ASM_WRITTEN (n
->decl
)
1815 || DECL_EXTERNAL (n
->decl
)
1817 || (!flag_wpa
&& n
->in_other_partition
)))))
1824 call_site_hash
->empty ();
1825 call_site_hash
= NULL
;
1828 if (instrumented_version
)
1830 instrumented_version
->instrumented_version
= NULL
;
1831 instrumented_version
= NULL
;
1834 symtab
->release_symbol (this, uid
);
1837 /* Likewise indicate that a node is having address taken. */
1840 cgraph_node::mark_address_taken (void)
1842 /* Indirect inlining can figure out that all uses of the address are
1844 if (global
.inlined_to
)
1846 gcc_assert (cfun
->after_inlining
);
1847 gcc_assert (callers
->indirect_inlining_edge
);
1850 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1851 IPA_REF_ADDR reference exists (and thus it should be set on node
1852 representing alias we take address of) and as a test whether address
1853 of the object was taken (and thus it should be set on node alias is
1854 referring to). We should remove the first use and the remove the
1857 cgraph_node
*node
= ultimate_alias_target ();
1858 node
->address_taken
= 1;
1861 /* Return local info for the compiled function. */
1864 cgraph_node::local_info (tree decl
)
1866 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1867 cgraph_node
*node
= get (decl
);
1870 return &node
->local
;
1873 /* Return global info for the compiled function. */
1875 cgraph_global_info
*
1876 cgraph_node::global_info (tree decl
)
1878 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1879 && symtab
->global_info_ready
);
1880 cgraph_node
*node
= get (decl
);
1883 return &node
->global
;
1886 /* Return local info for the compiled function. */
1889 cgraph_node::rtl_info (tree decl
)
1891 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1892 cgraph_node
*node
= get (decl
);
1894 || (decl
!= current_function_decl
1895 && !TREE_ASM_WRITTEN (node
->decl
)))
1900 /* Return a string describing the failure REASON. */
1903 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1906 #define DEFCIFCODE(code, type, string) string,
1908 static const char *cif_string_table
[CIF_N_REASONS
] = {
1909 #include "cif-code.def"
1912 /* Signedness of an enum type is implementation defined, so cast it
1913 to unsigned before testing. */
1914 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1915 return cif_string_table
[reason
];
1918 /* Return a type describing the failure REASON. */
1920 cgraph_inline_failed_type_t
1921 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1924 #define DEFCIFCODE(code, type, string) type,
1926 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1927 #include "cif-code.def"
1930 /* Signedness of an enum type is implementation defined, so cast it
1931 to unsigned before testing. */
1932 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1933 return cif_type_table
[reason
];
1936 /* Names used to print out the availability enum. */
1937 const char * const cgraph_availability_names
[] =
1938 {"unset", "not_available", "overwritable", "available", "local"};
1940 /* Output flags of edge E. */
1943 dump_edge_flags (FILE *f
, struct cgraph_edge
*edge
)
1945 if (edge
->speculative
)
1946 fprintf (f
, "(speculative) ");
1947 if (!edge
->inline_failed
)
1948 fprintf (f
, "(inlined) ");
1949 if (edge
->indirect_inlining_edge
)
1950 fprintf (f
, "(indirect_inlining) ");
1952 fprintf (f
, "(%"PRId64
"x) ",
1953 (int64_t)edge
->count
);
1954 if (edge
->frequency
)
1955 fprintf (f
, "(%.2f per call) ",
1956 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1957 if (edge
->can_throw_external
)
1958 fprintf (f
, "(can throw external) ");
1961 /* Dump call graph node to file F. */
1964 cgraph_node::dump (FILE *f
)
1970 if (global
.inlined_to
)
1971 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1972 xstrdup_for_dump (name ()),
1974 xstrdup_for_dump (global
.inlined_to
->name ()),
1975 global
.inlined_to
->order
);
1977 fprintf (f
, " Clone of %s/%i\n",
1978 clone_of
->asm_name (),
1980 if (symtab
->function_flags_ready
)
1981 fprintf (f
, " Availability: %s\n",
1982 cgraph_availability_names
[get_availability ()]);
1985 fprintf (f
, " Profile id: %i\n",
1987 fprintf (f
, " First run: %i\n", tp_first_run
);
1988 fprintf (f
, " Function flags:");
1990 fprintf (f
, " executed %"PRId64
"x",
1993 fprintf (f
, " nested in: %s", origin
->asm_name ());
1994 if (gimple_has_body_p (decl
))
1995 fprintf (f
, " body");
1997 fprintf (f
, " process");
1999 fprintf (f
, " local");
2000 if (local
.redefined_extern_inline
)
2001 fprintf (f
, " redefined_extern_inline");
2002 if (only_called_at_startup
)
2003 fprintf (f
, " only_called_at_startup");
2004 if (only_called_at_exit
)
2005 fprintf (f
, " only_called_at_exit");
2007 fprintf (f
, " tm_clone");
2009 fprintf (f
, " icf_merged");
2011 fprintf (f
, " nonfreeing_fn");
2012 if (DECL_STATIC_CONSTRUCTOR (decl
))
2013 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
2014 if (DECL_STATIC_DESTRUCTOR (decl
))
2015 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
2021 fprintf (f
, " Thunk");
2023 fprintf (f
, " of %s (asm: %s)",
2024 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2025 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2026 fprintf (f
, " fixed offset %i virtual value %i has "
2027 "virtual offset %i)\n",
2028 (int)thunk
.fixed_offset
,
2029 (int)thunk
.virtual_value
,
2030 (int)thunk
.virtual_offset_p
);
2032 if (alias
&& thunk
.alias
2033 && DECL_P (thunk
.alias
))
2035 fprintf (f
, " Alias of %s",
2036 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2037 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2038 fprintf (f
, " (asm: %s)",
2039 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2043 fprintf (f
, " Called by: ");
2045 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2047 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
2048 edge
->caller
->order
);
2049 dump_edge_flags (f
, edge
);
2052 fprintf (f
, "\n Calls: ");
2053 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2055 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
2056 edge
->callee
->order
);
2057 dump_edge_flags (f
, edge
);
2061 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2063 if (edge
->indirect_info
->polymorphic
)
2065 fprintf (f
, " Polymorphic indirect call of type ");
2066 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2067 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2070 fprintf (f
, " Indirect call");
2071 dump_edge_flags (f
, edge
);
2072 if (edge
->indirect_info
->param_index
!= -1)
2074 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2075 if (edge
->indirect_info
->agg_contents
)
2076 fprintf (f
, " loaded from %s %s at offset %i",
2077 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2078 edge
->indirect_info
->by_ref
? "passed by reference":"",
2079 (int)edge
->indirect_info
->offset
);
2080 if (edge
->indirect_info
->vptr_changed
)
2081 fprintf (f
, " (vptr maybe changed)");
2084 if (edge
->indirect_info
->polymorphic
)
2085 edge
->indirect_info
->context
.dump (f
);
2088 if (instrumentation_clone
)
2089 fprintf (f
, " Is instrumented version.\n");
2090 else if (instrumented_version
)
2091 fprintf (f
, " Has instrumented version.\n");
2094 /* Dump call graph node NODE to stderr. */
2097 cgraph_node::debug (void)
2102 /* Dump the callgraph to file F. */
2105 cgraph_node::dump_cgraph (FILE *f
)
2109 fprintf (f
, "callgraph:\n\n");
2110 FOR_EACH_FUNCTION (node
)
2114 /* Return true when the DECL can possibly be inlined. */
2117 cgraph_function_possibly_inlined_p (tree decl
)
2119 if (!symtab
->global_info_ready
)
2120 return !DECL_UNINLINABLE (decl
);
2121 return DECL_POSSIBLY_INLINED (decl
);
2124 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2126 cgraph_node::unnest (void)
2128 cgraph_node
**node2
= &origin
->nested
;
2129 gcc_assert (origin
);
2131 while (*node2
!= this)
2132 node2
= &(*node2
)->next_nested
;
2133 *node2
= next_nested
;
2137 /* Return function availability. See cgraph.h for description of individual
2140 cgraph_node::get_availability (void)
2142 enum availability avail
;
2144 avail
= AVAIL_NOT_AVAILABLE
;
2145 else if (local
.local
)
2146 avail
= AVAIL_LOCAL
;
2147 else if (alias
&& weakref
)
2148 ultimate_alias_target (&avail
);
2149 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2150 avail
= AVAIL_INTERPOSABLE
;
2151 else if (!externally_visible
)
2152 avail
= AVAIL_AVAILABLE
;
2153 /* Inline functions are safe to be analyzed even if their symbol can
2154 be overwritten at runtime. It is not meaningful to enforce any sane
2155 behaviour on replacing inline function by different body. */
2156 else if (DECL_DECLARED_INLINE_P (decl
))
2157 avail
= AVAIL_AVAILABLE
;
2159 /* If the function can be overwritten, return OVERWRITABLE. Take
2160 care at least of two notable extensions - the COMDAT functions
2161 used to share template instantiations in C++ (this is symmetric
2162 to code cp_cannot_inline_tree_fn and probably shall be shared and
2163 the inlinability hooks completely eliminated).
2165 ??? Does the C++ one definition rule allow us to always return
2166 AVAIL_AVAILABLE here? That would be good reason to preserve this
2169 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2170 avail
= AVAIL_INTERPOSABLE
;
2171 else avail
= AVAIL_AVAILABLE
;
2176 /* Worker for cgraph_node_can_be_local_p. */
2178 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2180 return !(!node
->force_output
2181 && ((DECL_COMDAT (node
->decl
)
2182 && !node
->forced_by_abi
2183 && !node
->used_from_object_file_p ()
2184 && !node
->same_comdat_group
)
2185 || !node
->externally_visible
));
2188 /* Return true if cgraph_node can be made local for API change.
2189 Extern inline functions and C++ COMDAT functions can be made local
2190 at the expense of possible code size growth if function is used in multiple
2191 compilation units. */
2193 cgraph_node::can_be_local_p (void)
2195 return (!address_taken
2196 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2200 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2201 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2202 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2205 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2206 (cgraph_node
*, void *),
2208 bool include_overwritable
,
2209 bool exclude_virtual_thunks
)
2214 if (callback (this, data
))
2216 for (e
= callers
; e
; e
= e
->next_caller
)
2217 if (e
->caller
->thunk
.thunk_p
2218 && (include_overwritable
2219 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2220 && !(exclude_virtual_thunks
2221 && e
->caller
->thunk
.virtual_offset_p
))
2222 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2223 include_overwritable
,
2224 exclude_virtual_thunks
))
2227 FOR_EACH_ALIAS (this, ref
)
2229 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2230 if (include_overwritable
2231 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2232 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2233 include_overwritable
,
2234 exclude_virtual_thunks
))
2240 /* Call callback on function and aliases associated to the function.
2241 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2245 cgraph_node::call_for_symbol_and_aliases (bool (*callback
) (cgraph_node
*,
2248 bool include_overwritable
)
2252 if (callback (this, data
))
2255 FOR_EACH_ALIAS (this, ref
)
2257 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2258 if (include_overwritable
2259 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2260 if (alias
->call_for_symbol_and_aliases (callback
, data
,
2261 include_overwritable
))
2267 /* Worker to bring NODE local. */
2270 cgraph_node::make_local (cgraph_node
*node
, void *)
2272 gcc_checking_assert (node
->can_be_local_p ());
2273 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2275 node
->make_decl_local ();
2276 node
->set_section (NULL
);
2277 node
->set_comdat_group (NULL
);
2278 node
->externally_visible
= false;
2279 node
->forced_by_abi
= false;
2280 node
->local
.local
= true;
2281 node
->set_section (NULL
);
2282 node
->unique_name
= (node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2283 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2284 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2285 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2290 /* Bring cgraph node local. */
2293 cgraph_node::make_local (void)
2295 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2298 /* Worker to set nothrow flag. */
2301 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2305 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2308 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2309 e
->can_throw_external
= false;
2313 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2314 if any to NOTHROW. */
2317 cgraph_node::set_nothrow_flag (bool nothrow
)
2319 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2320 (void *)(size_t)nothrow
, false);
2323 /* Worker to set const flag. */
2326 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2328 /* Static constructors and destructors without a side effect can be
2330 if (data
&& !((size_t)data
& 2))
2332 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2333 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2334 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2335 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2337 TREE_READONLY (node
->decl
) = data
!= NULL
;
2338 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2342 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2343 if any to READONLY. */
2346 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2348 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2349 (void *)(size_t)(readonly
+ (int)looping
* 2),
2353 /* Worker to set pure flag. */
2356 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2358 /* Static constructors and destructors without a side effect can be
2360 if (data
&& !((size_t)data
& 2))
2362 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2363 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2364 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2365 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2367 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2368 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2372 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2376 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2378 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2379 (void *)(size_t)(pure
+ (int)looping
* 2),
2383 /* Return true when cgraph_node can not return or throw and thus
2384 it is safe to ignore its side effects for IPA analysis. */
2387 cgraph_node::cannot_return_p (void)
2389 int flags
= flags_from_decl_or_type (decl
);
2390 if (!opt_for_fn (decl
, flag_exceptions
))
2391 return (flags
& ECF_NORETURN
) != 0;
2393 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2394 == (ECF_NORETURN
| ECF_NOTHROW
));
2397 /* Return true when call of edge can not lead to return from caller
2398 and thus it is safe to ignore its side effects for IPA analysis
2399 when computing side effects of the caller.
2400 FIXME: We could actually mark all edges that have no reaching
2401 patch to the exit block or throw to get better results. */
2403 cgraph_edge::cannot_lead_to_return_p (void)
2405 if (caller
->cannot_return_p ())
2407 if (indirect_unknown_callee
)
2409 int flags
= indirect_info
->ecf_flags
;
2410 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2411 return (flags
& ECF_NORETURN
) != 0;
2413 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2414 == (ECF_NORETURN
| ECF_NOTHROW
));
2417 return callee
->cannot_return_p ();
2420 /* Return true if the call can be hot. */
2423 cgraph_edge::maybe_hot_p (void)
2425 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2427 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2428 && !maybe_hot_count_p (NULL
, count
))
2430 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2432 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2434 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2436 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2438 if (opt_for_fn (caller
->decl
, optimize_size
))
2440 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2442 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2443 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2445 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2447 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2448 || frequency
<= (CGRAPH_FREQ_BASE
2449 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2455 /* Return true when function can be removed from callgraph
2456 if all direct calls are eliminated. */
2459 cgraph_node::can_remove_if_no_direct_calls_and_refs_p (void)
2461 gcc_assert (!global
.inlined_to
);
2462 /* Instrumentation clones should not be removed before
2463 instrumentation happens. New callers may appear after
2465 if (instrumentation_clone
2466 && !chkp_function_instrumented_p (decl
))
2468 /* Extern inlines can always go, we will use the external definition. */
2469 if (DECL_EXTERNAL (decl
))
2471 /* When function is needed, we can not remove it. */
2472 if (force_output
|| used_from_other_partition
)
2474 if (DECL_STATIC_CONSTRUCTOR (decl
)
2475 || DECL_STATIC_DESTRUCTOR (decl
))
2477 /* Only COMDAT functions can be removed if externally visible. */
2478 if (externally_visible
2479 && (!DECL_COMDAT (decl
)
2481 || used_from_object_file_p ()))
2486 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2489 nonremovable_p (cgraph_node
*node
, void *)
2491 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2494 /* Return true when function cgraph_node and its aliases can be removed from
2495 callgraph if all direct calls are eliminated. */
2498 cgraph_node::can_remove_if_no_direct_calls_p (void)
2500 /* Extern inlines can always go, we will use the external definition. */
2501 if (DECL_EXTERNAL (decl
))
2505 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2508 /* Return true when function cgraph_node can be expected to be removed
2509 from program when direct calls in this compilation unit are removed.
2511 As a special case COMDAT functions are
2512 cgraph_can_remove_if_no_direct_calls_p while the are not
2513 cgraph_only_called_directly_p (it is possible they are called from other
2516 This function behaves as cgraph_only_called_directly_p because eliminating
2517 all uses of COMDAT function does not make it necessarily disappear from
2518 the program unless we are compiling whole program or we do LTO. In this
2519 case we know we win since dynamic linking will not really discard the
2520 linkonce section. */
2523 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p (void)
2525 gcc_assert (!global
.inlined_to
);
2527 if (call_for_symbol_and_aliases (used_from_object_file_p_worker
,
2530 if (!in_lto_p
&& !flag_whole_program
)
2531 return only_called_directly_p ();
2534 if (DECL_EXTERNAL (decl
))
2536 return can_remove_if_no_direct_calls_p ();
2541 /* Worker for cgraph_only_called_directly_p. */
2544 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2546 return !node
->only_called_directly_or_aliased_p ();
2549 /* Return true when function cgraph_node and all its aliases are only called
2551 i.e. it is not externally visible, address was not taken and
2552 it is not used in any other non-standard way. */
2555 cgraph_node::only_called_directly_p (void)
2557 gcc_assert (ultimate_alias_target () == this);
2558 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2563 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2566 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2568 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2570 enum availability avail
;
2571 node
->ultimate_alias_target (&avail
);
2573 if (avail
> AVAIL_INTERPOSABLE
)
2574 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2575 if (!cs
->indirect_inlining_edge
)
2576 redirect_callers
->safe_push (cs
);
2580 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2581 cgraph_node (i.e. are not overwritable). */
2584 cgraph_node::collect_callers (void)
2586 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2587 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2588 &redirect_callers
, false);
2589 return redirect_callers
;
2592 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2595 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2597 bool skipped_thunk
= false;
2598 node
= node
->ultimate_alias_target ();
2599 node2
= node2
->ultimate_alias_target ();
2601 /* There are no virtual clones of thunks so check former_clone_of or if we
2602 might have skipped thunks because this adjustments are no longer
2604 while (node
->thunk
.thunk_p
)
2606 if (node2
->former_clone_of
== node
->decl
)
2608 if (!node
->thunk
.this_adjusting
)
2610 node
= node
->callees
->callee
->ultimate_alias_target ();
2611 skipped_thunk
= true;
2616 if (!node2
->clone
.args_to_skip
2617 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2619 if (node2
->former_clone_of
== node
->decl
)
2621 else if (!node2
->clone_of
)
2625 while (node
!= node2
&& node2
)
2626 node2
= node2
->clone_of
;
2627 return node2
!= NULL
;
2630 /* Verify edge E count and frequency. */
2633 verify_edge_count_and_frequency (cgraph_edge
*e
)
2635 bool error_found
= false;
2638 error ("caller edge count is negative");
2641 if (e
->frequency
< 0)
2643 error ("caller edge frequency is negative");
2646 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2648 error ("caller edge frequency is too large");
2651 if (gimple_has_body_p (e
->caller
->decl
)
2652 && !e
->caller
->global
.inlined_to
2654 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2655 Remove this once edges are actually removed from the function at that time. */
2657 || (inline_edge_summary_vec
.exists ()
2658 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2659 || !inline_edge_summary (e
)->predicate
)))
2661 != compute_call_stmt_bb_frequency (e
->caller
->decl
,
2662 gimple_bb (e
->call_stmt
))))
2664 error ("caller edge frequency %i does not match BB frequency %i",
2666 compute_call_stmt_bb_frequency (e
->caller
->decl
,
2667 gimple_bb (e
->call_stmt
)));
2673 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2675 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple stmt
)
2677 bool fndecl_was_null
= false;
2678 /* debug_gimple_stmt needs correct cfun */
2679 if (cfun
!= this_cfun
)
2680 set_cfun (this_cfun
);
2681 /* ...and an actual current_function_decl */
2682 if (!current_function_decl
)
2684 current_function_decl
= this_cfun
->decl
;
2685 fndecl_was_null
= true;
2687 debug_gimple_stmt (stmt
);
2688 if (fndecl_was_null
)
2689 current_function_decl
= NULL
;
2692 /* Verify that call graph edge E corresponds to DECL from the associated
2693 statement. Return true if the verification should fail. */
2696 verify_edge_corresponds_to_fndecl (cgraph_edge
*e
, tree decl
)
2700 if (!decl
|| e
->callee
->global
.inlined_to
)
2702 if (symtab
->state
== LTO_STREAMING
)
2704 node
= cgraph_node::get (decl
);
2706 /* We do not know if a node from a different partition is an alias or what it
2707 aliases and therefore cannot do the former_clone_of check reliably. When
2708 body_removed is set, we have lost all information about what was alias or
2709 thunk of and also cannot proceed. */
2711 || node
->body_removed
2712 || node
->in_other_partition
2714 || e
->callee
->in_other_partition
)
2717 node
= node
->ultimate_alias_target ();
2719 /* Optimizers can redirect unreachable calls or calls triggering undefined
2720 behaviour to builtin_unreachable. */
2721 if (DECL_BUILT_IN_CLASS (e
->callee
->decl
) == BUILT_IN_NORMAL
2722 && DECL_FUNCTION_CODE (e
->callee
->decl
) == BUILT_IN_UNREACHABLE
)
2725 if (e
->callee
->former_clone_of
!= node
->decl
2726 && (node
!= e
->callee
->ultimate_alias_target ())
2727 && !clone_of_p (node
, e
->callee
))
2733 /* Verify cgraph nodes of given cgraph node. */
2735 cgraph_node::verify_node (void)
2738 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2739 basic_block this_block
;
2740 gimple_stmt_iterator gsi
;
2741 bool error_found
= false;
2746 timevar_push (TV_CGRAPH_VERIFY
);
2747 error_found
|= verify_base ();
2748 for (e
= callees
; e
; e
= e
->next_callee
)
2751 error ("aux field set for edge %s->%s",
2752 identifier_to_locale (e
->caller
->name ()),
2753 identifier_to_locale (e
->callee
->name ()));
2758 error ("execution count is negative");
2761 if (global
.inlined_to
&& same_comdat_group
)
2763 error ("inline clone in same comdat group list");
2766 if (!definition
&& !in_other_partition
&& local
.local
)
2768 error ("local symbols must be defined");
2771 if (global
.inlined_to
&& externally_visible
)
2773 error ("externally visible inline clone");
2776 if (global
.inlined_to
&& address_taken
)
2778 error ("inline clone with address taken");
2781 if (global
.inlined_to
&& force_output
)
2783 error ("inline clone is forced to output");
2786 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2790 error ("aux field set for indirect edge from %s",
2791 identifier_to_locale (e
->caller
->name ()));
2794 if (!e
->indirect_unknown_callee
2795 || !e
->indirect_info
)
2797 error ("An indirect edge from %s is not marked as indirect or has "
2798 "associated indirect_info, the corresponding statement is: ",
2799 identifier_to_locale (e
->caller
->name ()));
2800 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2804 bool check_comdat
= comdat_local_p ();
2805 for (e
= callers
; e
; e
= e
->next_caller
)
2807 if (verify_edge_count_and_frequency (e
))
2810 && !in_same_comdat_group_p (e
->caller
))
2812 error ("comdat-local function called by %s outside its comdat",
2813 identifier_to_locale (e
->caller
->name ()));
2816 if (!e
->inline_failed
)
2818 if (global
.inlined_to
2819 != (e
->caller
->global
.inlined_to
2820 ? e
->caller
->global
.inlined_to
: e
->caller
))
2822 error ("inlined_to pointer is wrong");
2825 if (callers
->next_caller
)
2827 error ("multiple inline callers");
2832 if (global
.inlined_to
)
2834 error ("inlined_to pointer set for noninline callers");
2838 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2839 if (verify_edge_count_and_frequency (e
))
2841 if (!callers
&& global
.inlined_to
)
2843 error ("inlined_to pointer is set but no predecessors found");
2846 if (global
.inlined_to
== this)
2848 error ("inlined_to pointer refers to itself");
2855 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2860 error ("cgraph_node has wrong clone_of");
2867 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2868 if (n
->clone_of
!= this)
2872 error ("cgraph_node has wrong clone list");
2876 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2878 error ("cgraph_node is in clone list but it is not clone");
2881 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2883 error ("cgraph_node has wrong prev_clone pointer");
2886 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2888 error ("double linked list of clones corrupted");
2892 if (analyzed
&& alias
)
2894 bool ref_found
= false;
2896 ipa_ref
*ref
= NULL
;
2900 error ("Alias has call edges");
2903 for (i
= 0; iterate_reference (i
, ref
); i
++)
2904 if (ref
->use
== IPA_REF_CHKP
)
2906 else if (ref
->use
!= IPA_REF_ALIAS
)
2908 error ("Alias has non-alias reference");
2913 error ("Alias has more than one alias reference");
2920 error ("Analyzed alias has no reference");
2925 /* Check instrumented version reference. */
2926 if (instrumented_version
2927 && instrumented_version
->instrumented_version
!= this)
2929 error ("Instrumentation clone does not reference original node");
2933 /* Cannot have orig_decl for not instrumented nodes. */
2934 if (!instrumentation_clone
&& orig_decl
)
2936 error ("Not instrumented node has non-NULL original declaration");
2940 /* If original not instrumented node still exists then we may check
2941 original declaration is set properly. */
2942 if (instrumented_version
2944 && orig_decl
!= instrumented_version
->decl
)
2946 error ("Instrumented node has wrong original declaration");
2950 /* Check all nodes have chkp reference to their instrumented versions. */
2952 && instrumented_version
2953 && !instrumentation_clone
)
2955 bool ref_found
= false;
2957 struct ipa_ref
*ref
;
2959 for (i
= 0; iterate_reference (i
, ref
); i
++)
2960 if (ref
->use
== IPA_REF_CHKP
)
2964 error ("Node has more than one chkp reference");
2967 if (ref
->referred
!= instrumented_version
)
2969 error ("Wrong node is referenced with chkp reference");
2977 error ("Analyzed node has no reference to instrumented version");
2982 if (analyzed
&& thunk
.thunk_p
)
2986 error ("No edge out of thunk node");
2989 else if (callees
->next_callee
)
2991 error ("More than one edge out of thunk node");
2994 if (gimple_has_body_p (decl
))
2996 error ("Thunk is not supposed to have body");
2999 if (thunk
.add_pointer_bounds_args
3000 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
3002 error ("Instrumentation thunk has wrong edge callee");
3006 else if (analyzed
&& gimple_has_body_p (decl
)
3007 && !TREE_ASM_WRITTEN (decl
)
3008 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3013 hash_set
<gimple
> stmts
;
3015 ipa_ref
*ref
= NULL
;
3017 /* Reach the trees by walking over the CFG, and note the
3018 enclosing basic-blocks in the call edges. */
3019 FOR_EACH_BB_FN (this_block
, this_cfun
)
3021 for (gsi
= gsi_start_phis (this_block
);
3022 !gsi_end_p (gsi
); gsi_next (&gsi
))
3023 stmts
.add (gsi_stmt (gsi
));
3024 for (gsi
= gsi_start_bb (this_block
);
3028 gimple stmt
= gsi_stmt (gsi
);
3030 if (is_gimple_call (stmt
))
3032 cgraph_edge
*e
= get_edge (stmt
);
3033 tree decl
= gimple_call_fndecl (stmt
);
3038 error ("shared call_stmt:");
3039 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3042 if (!e
->indirect_unknown_callee
)
3044 if (verify_edge_corresponds_to_fndecl (e
, decl
))
3046 error ("edge points to wrong declaration:");
3047 debug_tree (e
->callee
->decl
);
3048 fprintf (stderr
," Instead of:");
3055 error ("an indirect edge with unknown callee "
3056 "corresponding to a call_stmt with "
3057 "a known declaration:");
3059 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3065 error ("missing callgraph edge for call stmt:");
3066 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3072 for (i
= 0; iterate_reference (i
, ref
); i
++)
3073 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3075 error ("reference to dead statement");
3076 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3081 /* No CFG available?! */
3084 for (e
= callees
; e
; e
= e
->next_callee
)
3088 error ("edge %s->%s has no corresponding call_stmt",
3089 identifier_to_locale (e
->caller
->name ()),
3090 identifier_to_locale (e
->callee
->name ()));
3091 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3096 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3098 if (!e
->aux
&& !e
->speculative
)
3100 error ("an indirect edge from %s has no corresponding call_stmt",
3101 identifier_to_locale (e
->caller
->name ()));
3102 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3111 internal_error ("verify_cgraph_node failed");
3113 timevar_pop (TV_CGRAPH_VERIFY
);
3116 /* Verify whole cgraph structure. */
3118 cgraph_node::verify_cgraph_nodes (void)
3125 FOR_EACH_FUNCTION (node
)
3129 /* Walk the alias chain to return the function cgraph_node is alias of.
3130 Walk through thunks, too.
3131 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3134 cgraph_node::function_symbol (enum availability
*availability
)
3136 cgraph_node
*node
= ultimate_alias_target (availability
);
3138 while (node
->thunk
.thunk_p
)
3140 node
= node
->callees
->callee
;
3143 enum availability a
;
3144 a
= node
->get_availability ();
3145 if (a
< *availability
)
3148 node
= node
->ultimate_alias_target (availability
);
3153 /* Walk the alias chain to return the function cgraph_node is alias of.
3154 Walk through non virtual thunks, too. Thus we return either a function
3155 or a virtual thunk node.
3156 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3159 cgraph_node::function_or_virtual_thunk_symbol
3160 (enum availability
*availability
)
3162 cgraph_node
*node
= ultimate_alias_target (availability
);
3164 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3166 node
= node
->callees
->callee
;
3169 enum availability a
;
3170 a
= node
->get_availability ();
3171 if (a
< *availability
)
3174 node
= node
->ultimate_alias_target (availability
);
3179 /* When doing LTO, read cgraph_node's body from disk if it is not already
3183 cgraph_node::get_untransformed_body (void)
3185 lto_file_decl_data
*file_data
;
3186 const char *data
, *name
;
3188 tree decl
= this->decl
;
3190 if (DECL_RESULT (decl
))
3193 gcc_assert (in_lto_p
);
3195 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3197 file_data
= lto_file_data
;
3198 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3200 /* We may have renamed the declaration, e.g., a static function. */
3201 name
= lto_get_decl_name_mapping (file_data
, name
);
3203 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3206 fatal_error ("%s: section %s is missing",
3207 file_data
->file_name
,
3210 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3212 lto_input_function_body (file_data
, this, data
);
3213 lto_stats
.num_function_bodies
++;
3214 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3216 lto_free_function_in_decl_state_for_node (this);
3218 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3223 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3224 if it is not already present. When some IPA transformations are scheduled,
3228 cgraph_node::get_body (void)
3232 updated
= get_untransformed_body ();
3234 /* Getting transformed body makes no sense for inline clones;
3235 we should never use this on real clones becuase they are materialized
3237 TODO: Materializing clones here will likely lead to smaller LTRANS
3239 gcc_assert (!global
.inlined_to
&& !clone_of
);
3240 if (ipa_transforms_to_apply
.exists ())
3242 opt_pass
*saved_current_pass
= current_pass
;
3243 FILE *saved_dump_file
= dump_file
;
3244 int saved_dump_flags
= dump_flags
;
3246 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3247 execute_all_ipa_transforms ();
3248 cgraph_edge::rebuild_edges ();
3249 free_dominance_info (CDI_DOMINATORS
);
3250 free_dominance_info (CDI_POST_DOMINATORS
);
3254 current_pass
= saved_current_pass
;
3255 dump_file
= saved_dump_file
;
3256 dump_flags
= saved_dump_flags
;
3261 /* Return the DECL_STRUCT_FUNCTION of the function. */
3264 cgraph_node::get_fun (void)
3266 cgraph_node
*node
= this;
3267 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3269 while (!fun
&& node
->clone_of
)
3271 node
= node
->clone_of
;
3272 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3278 /* Verify if the type of the argument matches that of the function
3279 declaration. If we cannot verify this or there is a mismatch,
3283 gimple_check_call_args (gimple stmt
, tree fndecl
, bool args_count_match
)
3286 unsigned int i
, nargs
;
3288 /* Calls to internal functions always match their signature. */
3289 if (gimple_call_internal_p (stmt
))
3292 nargs
= gimple_call_num_args (stmt
);
3294 /* Get argument types for verification. */
3296 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3298 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3300 /* Verify if the type of the argument matches that of the function
3301 declaration. If we cannot verify this or there is a mismatch,
3303 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3305 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3307 i
++, p
= DECL_CHAIN (p
))
3310 /* We cannot distinguish a varargs function from the case
3311 of excess parameters, still deferring the inlining decision
3312 to the callee is possible. */
3315 arg
= gimple_call_arg (stmt
, i
);
3316 if (p
== error_mark_node
3317 || DECL_ARG_TYPE (p
) == error_mark_node
3318 || arg
== error_mark_node
3319 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3320 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3323 if (args_count_match
&& p
)
3328 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3331 /* If this is a varargs function defer inlining decision
3335 arg
= gimple_call_arg (stmt
, i
);
3336 if (TREE_VALUE (p
) == error_mark_node
3337 || arg
== error_mark_node
3338 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3339 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3340 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3352 /* Verify if the type of the argument and lhs of CALL_STMT matches
3353 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3354 true, the arg count needs to be the same.
3355 If we cannot verify this or there is a mismatch, return false. */
3358 gimple_check_call_matching_types (gimple call_stmt
, tree callee
,
3359 bool args_count_match
)
3363 if ((DECL_RESULT (callee
)
3364 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3365 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3366 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3368 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3369 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3374 /* Reset all state within cgraph.c so that we can rerun the compiler
3375 within the same process. For use by toplev::finalize. */
3378 cgraph_c_finalize (void)
3382 x_cgraph_nodes_queue
= NULL
;
3384 cgraph_fnver_htab
= NULL
;
3385 version_info_node
= NULL
;
3388 #include "gt-cgraph.h"