1 /* Callgraph handling code.
2 Copyright (C) 2003-2015 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 "double-int.h"
40 #include "fold-const.h"
43 #include "print-tree.h"
44 #include "tree-inline.h"
45 #include "langhooks.h"
52 #include "dominance.h"
54 #include "basic-block.h"
57 #include "plugin-api.h"
58 #include "hard-reg-set.h"
63 #include "tree-ssa-alias.h"
64 #include "internal-fn.h"
66 #include "gimple-expr.h"
68 #include "gimple-iterator.h"
71 #include "gimple-ssa.h"
74 #include "value-prof.h"
76 #include "diagnostic-core.h"
78 #include "ipa-utils.h"
79 #include "lto-streamer.h"
80 #include "alloc-pool.h"
81 #include "symbol-summary.h"
83 #include "ipa-inline.h"
85 #include "gimple-pretty-print.h"
86 #include "statistics.h"
88 #include "fixed-value.h"
89 #include "insn-config.h"
99 #include "tree-chkp.h"
102 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
103 #include "tree-pass.h"
105 /* Queue of cgraph nodes scheduled to be lowered. */
106 symtab_node
*x_cgraph_nodes_queue
;
107 #define cgraph_nodes_queue ((cgraph_node *)x_cgraph_nodes_queue)
109 /* Symbol table global context. */
110 symbol_table
*symtab
;
112 /* List of hooks triggered on cgraph_edge events. */
113 struct cgraph_edge_hook_list
{
114 cgraph_edge_hook hook
;
116 struct cgraph_edge_hook_list
*next
;
119 /* List of hooks triggered on cgraph_node events. */
120 struct cgraph_node_hook_list
{
121 cgraph_node_hook hook
;
123 struct cgraph_node_hook_list
*next
;
126 /* List of hooks triggered on events involving two cgraph_edges. */
127 struct cgraph_2edge_hook_list
{
128 cgraph_2edge_hook hook
;
130 struct cgraph_2edge_hook_list
*next
;
133 /* List of hooks triggered on events involving two cgraph_nodes. */
134 struct cgraph_2node_hook_list
{
135 cgraph_2node_hook hook
;
137 struct cgraph_2node_hook_list
*next
;
140 /* Hash descriptor for cgraph_function_version_info. */
142 struct function_version_hasher
: ggc_hasher
<cgraph_function_version_info
*>
144 static hashval_t
hash (cgraph_function_version_info
*);
145 static bool equal (cgraph_function_version_info
*,
146 cgraph_function_version_info
*);
149 /* Map a cgraph_node to cgraph_function_version_info using this htab.
150 The cgraph_function_version_info has a THIS_NODE field that is the
151 corresponding cgraph_node.. */
153 static GTY(()) hash_table
<function_version_hasher
> *cgraph_fnver_htab
= NULL
;
155 /* Hash function for cgraph_fnver_htab. */
157 function_version_hasher::hash (cgraph_function_version_info
*ptr
)
159 int uid
= ptr
->this_node
->uid
;
160 return (hashval_t
)(uid
);
163 /* eq function for cgraph_fnver_htab. */
165 function_version_hasher::equal (cgraph_function_version_info
*n1
,
166 cgraph_function_version_info
*n2
)
168 return n1
->this_node
->uid
== n2
->this_node
->uid
;
171 /* Mark as GC root all allocated nodes. */
172 static GTY(()) struct cgraph_function_version_info
*
173 version_info_node
= NULL
;
175 /* Get the cgraph_function_version_info node corresponding to node. */
176 cgraph_function_version_info
*
177 cgraph_node::function_version (void)
179 cgraph_function_version_info key
;
180 key
.this_node
= this;
182 if (cgraph_fnver_htab
== NULL
)
185 return cgraph_fnver_htab
->find (&key
);
188 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
189 corresponding to cgraph_node NODE. */
190 cgraph_function_version_info
*
191 cgraph_node::insert_new_function_version (void)
193 version_info_node
= NULL
;
194 version_info_node
= ggc_cleared_alloc
<cgraph_function_version_info
> ();
195 version_info_node
->this_node
= this;
197 if (cgraph_fnver_htab
== NULL
)
198 cgraph_fnver_htab
= hash_table
<function_version_hasher
>::create_ggc (2);
200 *cgraph_fnver_htab
->find_slot (version_info_node
, INSERT
)
202 return version_info_node
;
205 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
206 DECL is a duplicate declaration. */
208 cgraph_node::delete_function_version (tree decl
)
210 cgraph_node
*decl_node
= cgraph_node::get (decl
);
211 cgraph_function_version_info
*decl_v
= NULL
;
213 if (decl_node
== NULL
)
216 decl_v
= decl_node
->function_version ();
221 if (decl_v
->prev
!= NULL
)
222 decl_v
->prev
->next
= decl_v
->next
;
224 if (decl_v
->next
!= NULL
)
225 decl_v
->next
->prev
= decl_v
->prev
;
227 if (cgraph_fnver_htab
!= NULL
)
228 cgraph_fnver_htab
->remove_elt (decl_v
);
230 decl_node
->remove ();
233 /* Record that DECL1 and DECL2 are semantically identical function
236 cgraph_node::record_function_versions (tree decl1
, tree decl2
)
238 cgraph_node
*decl1_node
= cgraph_node::get_create (decl1
);
239 cgraph_node
*decl2_node
= cgraph_node::get_create (decl2
);
240 cgraph_function_version_info
*decl1_v
= NULL
;
241 cgraph_function_version_info
*decl2_v
= NULL
;
242 cgraph_function_version_info
*before
;
243 cgraph_function_version_info
*after
;
245 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
246 decl1_v
= decl1_node
->function_version ();
247 decl2_v
= decl2_node
->function_version ();
249 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
253 decl1_v
= decl1_node
->insert_new_function_version ();
256 decl2_v
= decl2_node
->insert_new_function_version ();
258 /* Chain decl2_v and decl1_v. All semantically identical versions
259 will be chained together. */
264 while (before
->next
!= NULL
)
265 before
= before
->next
;
267 while (after
->prev
!= NULL
)
270 before
->next
= after
;
271 after
->prev
= before
;
274 /* Initialize callgraph dump file. */
277 symbol_table::initialize (void)
280 dump_file
= dump_begin (TDI_cgraph
, NULL
);
283 /* Allocate new callgraph node and insert it into basic data structures. */
286 symbol_table::create_empty (void)
288 cgraph_node
*node
= allocate_cgraph_symbol ();
290 node
->type
= SYMTAB_FUNCTION
;
291 node
->frequency
= NODE_FREQUENCY_NORMAL
;
292 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
298 /* Register HOOK to be called with DATA on each removed edge. */
299 cgraph_edge_hook_list
*
300 symbol_table::add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
302 cgraph_edge_hook_list
*entry
;
303 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
305 entry
= (cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
315 /* Remove ENTRY from the list of hooks called on removing edges. */
317 symbol_table::remove_edge_removal_hook (cgraph_edge_hook_list
*entry
)
319 cgraph_edge_hook_list
**ptr
= &m_first_edge_removal_hook
;
321 while (*ptr
!= entry
)
327 /* Call all edge removal hooks. */
329 symbol_table::call_edge_removal_hooks (cgraph_edge
*e
)
331 cgraph_edge_hook_list
*entry
= m_first_edge_removal_hook
;
334 entry
->hook (e
, entry
->data
);
339 /* Register HOOK to be called with DATA on each removed node. */
340 cgraph_node_hook_list
*
341 symbol_table::add_cgraph_removal_hook (cgraph_node_hook hook
, void *data
)
343 cgraph_node_hook_list
*entry
;
344 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
346 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
356 /* Remove ENTRY from the list of hooks called on removing nodes. */
358 symbol_table::remove_cgraph_removal_hook (cgraph_node_hook_list
*entry
)
360 cgraph_node_hook_list
**ptr
= &m_first_cgraph_removal_hook
;
362 while (*ptr
!= entry
)
368 /* Call all node removal hooks. */
370 symbol_table::call_cgraph_removal_hooks (cgraph_node
*node
)
372 cgraph_node_hook_list
*entry
= m_first_cgraph_removal_hook
;
375 entry
->hook (node
, entry
->data
);
380 /* Call all node removal hooks. */
382 symbol_table::call_cgraph_insertion_hooks (cgraph_node
*node
)
384 cgraph_node_hook_list
*entry
= m_first_cgraph_insertion_hook
;
387 entry
->hook (node
, entry
->data
);
393 /* Register HOOK to be called with DATA on each inserted node. */
394 cgraph_node_hook_list
*
395 symbol_table::add_cgraph_insertion_hook (cgraph_node_hook hook
, void *data
)
397 cgraph_node_hook_list
*entry
;
398 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
400 entry
= (cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
410 /* Remove ENTRY from the list of hooks called on inserted nodes. */
412 symbol_table::remove_cgraph_insertion_hook (cgraph_node_hook_list
*entry
)
414 cgraph_node_hook_list
**ptr
= &m_first_cgraph_insertion_hook
;
416 while (*ptr
!= entry
)
422 /* Register HOOK to be called with DATA on each duplicated edge. */
423 cgraph_2edge_hook_list
*
424 symbol_table::add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
426 cgraph_2edge_hook_list
*entry
;
427 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
429 entry
= (cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
439 /* Remove ENTRY from the list of hooks called on duplicating edges. */
441 symbol_table::remove_edge_duplication_hook (cgraph_2edge_hook_list
*entry
)
443 cgraph_2edge_hook_list
**ptr
= &m_first_edge_duplicated_hook
;
445 while (*ptr
!= entry
)
451 /* Call all edge duplication hooks. */
453 symbol_table::call_edge_duplication_hooks (cgraph_edge
*cs1
, cgraph_edge
*cs2
)
455 cgraph_2edge_hook_list
*entry
= m_first_edge_duplicated_hook
;
458 entry
->hook (cs1
, cs2
, entry
->data
);
463 /* Register HOOK to be called with DATA on each duplicated node. */
464 cgraph_2node_hook_list
*
465 symbol_table::add_cgraph_duplication_hook (cgraph_2node_hook hook
, void *data
)
467 cgraph_2node_hook_list
*entry
;
468 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
470 entry
= (cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
480 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
482 symbol_table::remove_cgraph_duplication_hook (cgraph_2node_hook_list
*entry
)
484 cgraph_2node_hook_list
**ptr
= &m_first_cgraph_duplicated_hook
;
486 while (*ptr
!= entry
)
492 /* Call all node duplication hooks. */
494 symbol_table::call_cgraph_duplication_hooks (cgraph_node
*node
,
497 cgraph_2node_hook_list
*entry
= m_first_cgraph_duplicated_hook
;
500 entry
->hook (node
, node2
, entry
->data
);
505 /* Return cgraph node assigned to DECL. Create new one when needed. */
508 cgraph_node::create (tree decl
)
510 cgraph_node
*node
= symtab
->create_empty ();
511 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
515 if ((flag_openacc
|| flag_openmp
)
516 && lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
)))
518 node
->offloadable
= 1;
519 #ifdef ENABLE_OFFLOADING
520 g
->have_offload
= true;
524 node
->register_symbol ();
526 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
528 node
->origin
= cgraph_node::get_create (DECL_CONTEXT (decl
));
529 node
->next_nested
= node
->origin
->nested
;
530 node
->origin
->nested
= node
;
535 /* Try to find a call graph node for declaration DECL and if it does not exist
536 or if it corresponds to an inline clone, create a new one. */
539 cgraph_node::get_create (tree decl
)
541 cgraph_node
*first_clone
= cgraph_node::get (decl
);
543 if (first_clone
&& !first_clone
->global
.inlined_to
)
546 cgraph_node
*node
= cgraph_node::create (decl
);
549 first_clone
->clone_of
= node
;
550 node
->clones
= first_clone
;
551 symtab
->symtab_prevail_in_asm_name_hash (node
);
552 node
->decl
->decl_with_vis
.symtab_node
= node
;
554 fprintf (dump_file
, "Introduced new external node "
555 "(%s/%i) and turned into root of the clone tree.\n",
556 xstrdup_for_dump (node
->name ()), node
->order
);
559 fprintf (dump_file
, "Introduced new external node "
560 "(%s/%i).\n", xstrdup_for_dump (node
->name ()),
565 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
566 the function body is associated with (not necessarily cgraph_node (DECL). */
569 cgraph_node::create_alias (tree alias
, tree target
)
571 cgraph_node
*alias_node
;
573 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
574 || TREE_CODE (target
) == IDENTIFIER_NODE
);
575 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
576 alias_node
= cgraph_node::get_create (alias
);
577 gcc_assert (!alias_node
->definition
);
578 alias_node
->alias_target
= target
;
579 alias_node
->definition
= true;
580 alias_node
->alias
= true;
581 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
582 alias_node
->weakref
= true;
586 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
588 Same body aliases are output whenever the body of DECL is output,
589 and cgraph_node::get (ALIAS) transparently returns
590 cgraph_node::get (DECL). */
593 cgraph_node::create_same_body_alias (tree alias
, tree decl
)
596 #ifndef ASM_OUTPUT_DEF
597 /* If aliases aren't supported by the assembler, fail. */
600 /* Langhooks can create same body aliases of symbols not defined.
601 Those are useless. Drop them on the floor. */
602 if (symtab
->global_info_ready
)
605 n
= cgraph_node::create_alias (alias
, decl
);
606 n
->cpp_implicit_alias
= true;
607 if (symtab
->cpp_implicit_aliases_done
)
608 n
->resolve_alias (cgraph_node::get (decl
));
612 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
613 aliases DECL with an adjustments made into the first parameter.
614 See comments in thunk_adjust for detail on the parameters. */
617 cgraph_node::create_thunk (tree alias
, tree
, bool this_adjusting
,
618 HOST_WIDE_INT fixed_offset
,
619 HOST_WIDE_INT virtual_value
,
625 node
= cgraph_node::get (alias
);
629 node
= cgraph_node::create (alias
);
630 gcc_checking_assert (!virtual_offset
631 || wi::eq_p (virtual_offset
, virtual_value
));
632 node
->thunk
.fixed_offset
= fixed_offset
;
633 node
->thunk
.this_adjusting
= this_adjusting
;
634 node
->thunk
.virtual_value
= virtual_value
;
635 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
636 node
->thunk
.alias
= real_alias
;
637 node
->thunk
.thunk_p
= true;
638 node
->definition
= true;
643 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
644 Return NULL if there's no such node. */
647 cgraph_node::get_for_asmname (tree asmname
)
649 /* We do not want to look at inline clones. */
650 for (symtab_node
*node
= symtab_node::get_for_asmname (asmname
);
652 node
= node
->next_sharing_asm_name
)
654 cgraph_node
*cn
= dyn_cast
<cgraph_node
*> (node
);
655 if (cn
&& !cn
->global
.inlined_to
)
661 /* Returns a hash value for X (which really is a cgraph_edge). */
664 cgraph_edge_hasher::hash (cgraph_edge
*e
)
666 return htab_hash_pointer (e
->call_stmt
);
669 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
672 cgraph_edge_hasher::equal (cgraph_edge
*x
, gimple y
)
674 return x
->call_stmt
== y
;
677 /* Add call graph edge E to call site hash of its caller. */
680 cgraph_update_edge_in_call_site_hash (cgraph_edge
*e
)
682 gimple call
= e
->call_stmt
;
683 *e
->caller
->call_site_hash
->find_slot_with_hash (call
,
684 htab_hash_pointer (call
),
688 /* Add call graph edge E to call site hash of its caller. */
691 cgraph_add_edge_to_call_site_hash (cgraph_edge
*e
)
693 /* There are two speculative edges for every statement (one direct,
694 one indirect); always hash the direct one. */
695 if (e
->speculative
&& e
->indirect_unknown_callee
)
697 cgraph_edge
**slot
= e
->caller
->call_site_hash
->find_slot_with_hash
699 htab_hash_pointer (e
->call_stmt
), INSERT
);
702 gcc_assert (((cgraph_edge
*)*slot
)->speculative
);
707 gcc_assert (!*slot
|| e
->speculative
);
711 /* Return the callgraph edge representing the GIMPLE_CALL statement
715 cgraph_node::get_edge (gimple call_stmt
)
721 return call_site_hash
->find_with_hash (call_stmt
,
722 htab_hash_pointer (call_stmt
));
724 /* This loop may turn out to be performance problem. In such case adding
725 hashtables into call nodes with very many edges is probably best
726 solution. It is not good idea to add pointer into CALL_EXPR itself
727 because we want to make possible having multiple cgraph nodes representing
728 different clones of the same body before the body is actually cloned. */
729 for (e
= callees
; e
; e
= e
->next_callee
)
731 if (e
->call_stmt
== call_stmt
)
737 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
739 if (e
->call_stmt
== call_stmt
)
746 call_site_hash
= hash_table
<cgraph_edge_hasher
>::create_ggc (120);
747 for (e2
= callees
; e2
; e2
= e2
->next_callee
)
748 cgraph_add_edge_to_call_site_hash (e2
);
749 for (e2
= indirect_calls
; e2
; e2
= e2
->next_callee
)
750 cgraph_add_edge_to_call_site_hash (e2
);
757 /* Change field call_stmt of edge to NEW_STMT.
758 If UPDATE_SPECULATIVE and E is any component of speculative
759 edge, then update all components. */
762 cgraph_edge::set_call_stmt (gcall
*new_stmt
, bool update_speculative
)
766 /* Speculative edges has three component, update all of them
768 if (update_speculative
&& speculative
)
770 cgraph_edge
*direct
, *indirect
;
773 speculative_call_info (direct
, indirect
, ref
);
774 direct
->set_call_stmt (new_stmt
, false);
775 indirect
->set_call_stmt (new_stmt
, false);
776 ref
->stmt
= new_stmt
;
780 /* Only direct speculative edges go to call_site_hash. */
781 if (caller
->call_site_hash
782 && (!speculative
|| !indirect_unknown_callee
))
784 caller
->call_site_hash
->remove_elt_with_hash
785 (call_stmt
, htab_hash_pointer (call_stmt
));
788 cgraph_edge
*e
= this;
790 call_stmt
= new_stmt
;
791 if (indirect_unknown_callee
792 && (decl
= gimple_call_fndecl (new_stmt
)))
794 /* Constant propagation (and possibly also inlining?) can turn an
795 indirect call into a direct one. */
796 cgraph_node
*new_callee
= cgraph_node::get (decl
);
798 gcc_checking_assert (new_callee
);
799 e
= make_direct (new_callee
);
802 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
803 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
805 if (e
->caller
->call_site_hash
)
806 cgraph_add_edge_to_call_site_hash (e
);
809 /* Allocate a cgraph_edge structure and fill it with data according to the
810 parameters of which only CALLEE can be NULL (when creating an indirect call
814 symbol_table::create_edge (cgraph_node
*caller
, cgraph_node
*callee
,
815 gcall
*call_stmt
, gcov_type count
, int freq
,
816 bool indir_unknown_callee
)
820 /* LTO does not actually have access to the call_stmt since these
821 have not been loaded yet. */
824 /* This is a rather expensive check possibly triggering
825 construction of call stmt hashtable. */
826 #ifdef ENABLE_CHECKING
828 gcc_checking_assert (
829 !(e
= caller
->get_edge (call_stmt
)) || e
->speculative
);
832 gcc_assert (is_gimple_call (call_stmt
));
838 free_edges
= NEXT_FREE_EDGE (edge
);
842 edge
= ggc_alloc
<cgraph_edge
> ();
843 edge
->uid
= edges_max_uid
++;
849 edge
->caller
= caller
;
850 edge
->callee
= callee
;
851 edge
->prev_caller
= NULL
;
852 edge
->next_caller
= NULL
;
853 edge
->prev_callee
= NULL
;
854 edge
->next_callee
= NULL
;
855 edge
->lto_stmt_uid
= 0;
858 gcc_assert (count
>= 0);
859 edge
->frequency
= freq
;
860 gcc_assert (freq
>= 0);
861 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
863 edge
->call_stmt
= call_stmt
;
864 push_cfun (DECL_STRUCT_FUNCTION (caller
->decl
));
865 edge
->can_throw_external
866 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
869 && callee
&& callee
->decl
870 && !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
872 edge
->call_stmt_cannot_inline_p
= true;
874 edge
->call_stmt_cannot_inline_p
= false;
876 edge
->indirect_info
= NULL
;
877 edge
->indirect_inlining_edge
= 0;
878 edge
->speculative
= false;
879 edge
->indirect_unknown_callee
= indir_unknown_callee
;
880 if (opt_for_fn (edge
->caller
->decl
, flag_devirtualize
)
881 && call_stmt
&& DECL_STRUCT_FUNCTION (caller
->decl
))
882 edge
->in_polymorphic_cdtor
883 = decl_maybe_in_construction_p (NULL
, NULL
, call_stmt
,
886 edge
->in_polymorphic_cdtor
= caller
->thunk
.thunk_p
;
887 if (call_stmt
&& caller
->call_site_hash
)
888 cgraph_add_edge_to_call_site_hash (edge
);
893 /* Create edge from a given function to CALLEE in the cgraph. */
896 cgraph_node::create_edge (cgraph_node
*callee
,
897 gcall
*call_stmt
, gcov_type count
, int freq
)
899 cgraph_edge
*edge
= symtab
->create_edge (this, callee
, call_stmt
, count
,
902 initialize_inline_failed (edge
);
904 edge
->next_caller
= callee
->callers
;
906 callee
->callers
->prev_caller
= edge
;
907 edge
->next_callee
= callees
;
909 callees
->prev_callee
= edge
;
911 callee
->callers
= edge
;
916 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
918 cgraph_indirect_call_info
*
919 cgraph_allocate_init_indirect_info (void)
921 cgraph_indirect_call_info
*ii
;
923 ii
= ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
924 ii
->param_index
= -1;
928 /* Create an indirect edge with a yet-undetermined callee where the call
929 statement destination is a formal parameter of the caller with index
933 cgraph_node::create_indirect_edge (gcall
*call_stmt
, int ecf_flags
,
934 gcov_type count
, int freq
,
935 bool compute_indirect_info
)
937 cgraph_edge
*edge
= symtab
->create_edge (this, NULL
, call_stmt
,
941 initialize_inline_failed (edge
);
943 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
944 edge
->indirect_info
->ecf_flags
= ecf_flags
;
945 edge
->indirect_info
->vptr_changed
= true;
947 /* Record polymorphic call info. */
948 if (compute_indirect_info
950 && (target
= gimple_call_fn (call_stmt
))
951 && virtual_method_call_p (target
))
953 ipa_polymorphic_call_context
context (decl
, target
, call_stmt
);
955 /* Only record types can have virtual calls. */
956 edge
->indirect_info
->polymorphic
= true;
957 edge
->indirect_info
->param_index
= -1;
958 edge
->indirect_info
->otr_token
959 = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target
));
960 edge
->indirect_info
->otr_type
= obj_type_ref_class (target
);
961 gcc_assert (TREE_CODE (edge
->indirect_info
->otr_type
) == RECORD_TYPE
);
962 edge
->indirect_info
->context
= context
;
965 edge
->next_callee
= indirect_calls
;
967 indirect_calls
->prev_callee
= edge
;
968 indirect_calls
= edge
;
973 /* Remove the edge from the list of the callees of the caller. */
976 cgraph_edge::remove_caller (void)
979 prev_callee
->next_callee
= next_callee
;
981 next_callee
->prev_callee
= prev_callee
;
984 if (indirect_unknown_callee
)
985 caller
->indirect_calls
= next_callee
;
987 caller
->callees
= next_callee
;
989 if (caller
->call_site_hash
)
990 caller
->call_site_hash
->remove_elt_with_hash (call_stmt
,
991 htab_hash_pointer (call_stmt
));
994 /* Put the edge onto the free list. */
997 symbol_table::free_edge (cgraph_edge
*e
)
1001 if (e
->indirect_info
)
1002 ggc_free (e
->indirect_info
);
1004 /* Clear out the edge so we do not dangle pointers. */
1005 memset (e
, 0, sizeof (*e
));
1007 NEXT_FREE_EDGE (e
) = free_edges
;
1012 /* Remove the edge in the cgraph. */
1015 cgraph_edge::remove (void)
1017 /* Call all edge removal hooks. */
1018 symtab
->call_edge_removal_hooks (this);
1020 if (!indirect_unknown_callee
)
1021 /* Remove from callers list of the callee. */
1024 /* Remove from callees list of the callers. */
1027 /* Put the edge onto the free list. */
1028 symtab
->free_edge (this);
1031 /* Turn edge into speculative call calling N2. Update
1032 the profile so the direct call is taken COUNT times
1035 At clone materialization time, the indirect call E will
1038 if (call_dest == N2)
1043 At this time the function just creates the direct call,
1044 the referencd representing the if conditional and attaches
1045 them all to the orginal indirect call statement.
1047 Return direct edge created. */
1050 cgraph_edge::make_speculative (cgraph_node
*n2
, gcov_type direct_count
,
1051 int direct_frequency
)
1053 cgraph_node
*n
= caller
;
1054 ipa_ref
*ref
= NULL
;
1059 fprintf (dump_file
, "Indirect call -> speculative call"
1060 " %s/%i => %s/%i\n",
1061 xstrdup_for_dump (n
->name ()), n
->order
,
1062 xstrdup_for_dump (n2
->name ()), n2
->order
);
1065 e2
= n
->create_edge (n2
, call_stmt
, direct_count
, direct_frequency
);
1066 initialize_inline_failed (e2
);
1067 e2
->speculative
= true;
1068 if (TREE_NOTHROW (n2
->decl
))
1069 e2
->can_throw_external
= false;
1071 e2
->can_throw_external
= can_throw_external
;
1072 e2
->lto_stmt_uid
= lto_stmt_uid
;
1073 e2
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
1075 frequency
-= e2
->frequency
;
1076 symtab
->call_edge_duplication_hooks (this, e2
);
1077 ref
= n
->create_reference (n2
, IPA_REF_ADDR
, call_stmt
);
1078 ref
->lto_stmt_uid
= lto_stmt_uid
;
1079 ref
->speculative
= speculative
;
1080 n2
->mark_address_taken ();
1084 /* Speculative call consist of three components:
1085 1) an indirect edge representing the original call
1086 2) an direct edge representing the new call
1087 3) ADDR_EXPR reference representing the speculative check.
1088 All three components are attached to single statement (the indirect
1089 call) and if one of them exists, all of them must exist.
1091 Given speculative call edge, return all three components.
1095 cgraph_edge::speculative_call_info (cgraph_edge
*&direct
,
1096 cgraph_edge
*&indirect
,
1097 ipa_ref
*&reference
)
1102 cgraph_edge
*e
= this;
1104 if (!e
->indirect_unknown_callee
)
1105 for (e2
= e
->caller
->indirect_calls
;
1106 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1107 e2
= e2
->next_callee
)
1112 /* We can take advantage of the call stmt hash. */
1115 e
= e
->caller
->get_edge (e2
->call_stmt
);
1116 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1119 for (e
= e
->caller
->callees
;
1120 e2
->call_stmt
!= e
->call_stmt
1121 || e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1125 gcc_assert (e
->speculative
&& e2
->speculative
);
1130 for (i
= 0; e
->caller
->iterate_reference (i
, ref
); i
++)
1131 if (ref
->speculative
1132 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1133 || (!ref
->stmt
&& ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1139 /* Speculative edge always consist of all three components - direct edge,
1140 indirect and reference. */
1142 gcc_assert (e
&& e2
&& ref
);
1145 /* Speculative call edge turned out to be direct call to CALLE_DECL.
1146 Remove the speculative call sequence and return edge representing the call.
1147 It is up to caller to redirect the call as appropriate. */
1150 cgraph_edge::resolve_speculation (tree callee_decl
)
1152 cgraph_edge
*edge
= this;
1156 gcc_assert (edge
->speculative
);
1157 edge
->speculative_call_info (e2
, edge
, ref
);
1159 || !ref
->referred
->semantically_equivalent_p
1160 (symtab_node::get (callee_decl
)))
1166 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1167 "turned out to have contradicting known target ",
1168 xstrdup_for_dump (edge
->caller
->name ()),
1169 edge
->caller
->order
,
1170 xstrdup_for_dump (e2
->callee
->name ()),
1172 print_generic_expr (dump_file
, callee_decl
, 0);
1173 fprintf (dump_file
, "\n");
1177 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1178 xstrdup_for_dump (edge
->caller
->name ()),
1179 edge
->caller
->order
,
1180 xstrdup_for_dump (e2
->callee
->name ()),
1187 cgraph_edge
*tmp
= edge
;
1189 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1192 /* FIXME: If EDGE is inlined, we should scale up the frequencies and counts
1193 in the functions inlined through it. */
1195 edge
->count
+= e2
->count
;
1196 edge
->frequency
+= e2
->frequency
;
1197 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1198 edge
->frequency
= CGRAPH_FREQ_MAX
;
1199 edge
->speculative
= false;
1200 e2
->speculative
= false;
1201 ref
->remove_reference ();
1202 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1205 e2
->callee
->remove_symbol_and_inline_clones ();
1206 if (edge
->caller
->call_site_hash
)
1207 cgraph_update_edge_in_call_site_hash (edge
);
1211 /* Make an indirect edge with an unknown callee an ordinary edge leading to
1212 CALLEE. DELTA is an integer constant that is to be added to the this
1213 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1216 cgraph_edge::make_direct (cgraph_node
*callee
)
1218 cgraph_edge
*edge
= this;
1219 gcc_assert (indirect_unknown_callee
);
1221 /* If we are redirecting speculative call, make it non-speculative. */
1222 if (indirect_unknown_callee
&& speculative
)
1224 edge
= edge
->resolve_speculation (callee
->decl
);
1226 /* On successful speculation just return the pre existing direct edge. */
1227 if (!indirect_unknown_callee
)
1231 indirect_unknown_callee
= 0;
1232 ggc_free (indirect_info
);
1233 indirect_info
= NULL
;
1235 /* Get the edge out of the indirect edge list. */
1237 prev_callee
->next_callee
= next_callee
;
1239 next_callee
->prev_callee
= prev_callee
;
1241 caller
->indirect_calls
= next_callee
;
1243 /* Put it into the normal callee list */
1245 next_callee
= caller
->callees
;
1246 if (caller
->callees
)
1247 caller
->callees
->prev_callee
= edge
;
1248 caller
->callees
= edge
;
1250 /* Insert to callers list of the new callee. */
1251 edge
->set_callee (callee
);
1254 call_stmt_cannot_inline_p
1255 = !gimple_check_call_matching_types (call_stmt
, callee
->decl
,
1258 /* We need to re-determine the inlining status of the edge. */
1259 initialize_inline_failed (edge
);
1263 /* If necessary, change the function declaration in the call statement
1264 associated with E so that it corresponds to the edge callee. */
1267 cgraph_edge::redirect_call_stmt_to_callee (void)
1269 cgraph_edge
*e
= this;
1271 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1272 tree lhs
= gimple_call_lhs (e
->call_stmt
);
1274 gimple_stmt_iterator gsi
;
1275 #ifdef ENABLE_CHECKING
1285 e
->speculative_call_info (e
, e2
, ref
);
1286 /* If there already is an direct call (i.e. as a result of inliner's
1287 substitution), forget about speculating. */
1289 e
= e
->resolve_speculation (decl
);
1290 /* If types do not match, speculation was likely wrong.
1291 The direct edge was posisbly redirected to the clone with a different
1292 signature. We did not update the call statement yet, so compare it
1293 with the reference that still points to the proper type. */
1294 else if (!gimple_check_call_matching_types (e
->call_stmt
,
1295 ref
->referred
->decl
,
1299 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1301 xstrdup_for_dump (e
->caller
->name ()),
1303 xstrdup_for_dump (e
->callee
->name ()),
1305 e
= e
->resolve_speculation ();
1306 /* We are producing the final function body and will throw away the
1307 callgraph edges really soon. Reset the counts/frequencies to
1308 keep verifier happy in the case of roundoff errors. */
1309 e
->count
= gimple_bb (e
->call_stmt
)->count
;
1310 e
->frequency
= compute_call_stmt_bb_frequency
1311 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1313 /* Expand speculation into GIMPLE code. */
1318 "Expanding speculative call of %s/%i -> %s/%i count:"
1320 xstrdup_for_dump (e
->caller
->name ()),
1322 xstrdup_for_dump (e
->callee
->name ()),
1325 gcc_assert (e2
->speculative
);
1326 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->decl
));
1327 new_stmt
= gimple_ic (e
->call_stmt
,
1328 dyn_cast
<cgraph_node
*> (ref
->referred
),
1329 e
->count
|| e2
->count
1330 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1331 e
->count
+ e2
->count
)
1332 : e
->frequency
|| e2
->frequency
1333 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1334 e
->frequency
+ e2
->frequency
)
1335 : REG_BR_PROB_BASE
/ 2,
1336 e
->count
, e
->count
+ e2
->count
);
1337 e
->speculative
= false;
1338 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
,
1341 /* Fix edges for BUILT_IN_CHKP_BNDRET calls attached to the
1342 processed call stmt. */
1343 if (gimple_call_with_bounds_p (new_stmt
)
1344 && gimple_call_lhs (new_stmt
)
1345 && chkp_retbnd_call_by_val (gimple_call_lhs (e2
->call_stmt
)))
1347 tree dresult
= gimple_call_lhs (new_stmt
);
1348 tree iresult
= gimple_call_lhs (e2
->call_stmt
);
1349 gcall
*dbndret
= chkp_retbnd_call_by_val (dresult
);
1350 gcall
*ibndret
= chkp_retbnd_call_by_val (iresult
);
1351 struct cgraph_edge
*iedge
1352 = e2
->caller
->cgraph_node::get_edge (ibndret
);
1353 struct cgraph_edge
*dedge
;
1357 dedge
= iedge
->caller
->create_edge (iedge
->callee
,
1360 dedge
->frequency
= compute_call_stmt_bb_frequency
1361 (dedge
->caller
->decl
, gimple_bb (dedge
->call_stmt
));
1363 iedge
->frequency
= compute_call_stmt_bb_frequency
1364 (iedge
->caller
->decl
, gimple_bb (iedge
->call_stmt
));
1367 e
->frequency
= compute_call_stmt_bb_frequency
1368 (e
->caller
->decl
, gimple_bb (e
->call_stmt
));
1369 e2
->frequency
= compute_call_stmt_bb_frequency
1370 (e2
->caller
->decl
, gimple_bb (e2
->call_stmt
));
1371 e2
->speculative
= false;
1372 ref
->speculative
= false;
1374 /* Indirect edges are not both in the call site hash.
1376 if (e
->caller
->call_site_hash
)
1377 cgraph_update_edge_in_call_site_hash (e2
);
1379 /* Continue redirecting E to proper target. */
1383 if (e
->indirect_unknown_callee
1384 || decl
== e
->callee
->decl
)
1385 return e
->call_stmt
;
1387 #ifdef ENABLE_CHECKING
1390 node
= cgraph_node::get (decl
);
1391 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1395 if (symtab
->dump_file
)
1397 fprintf (symtab
->dump_file
, "updating call of %s/%i -> %s/%i: ",
1398 xstrdup_for_dump (e
->caller
->name ()), e
->caller
->order
,
1399 xstrdup_for_dump (e
->callee
->name ()), e
->callee
->order
);
1400 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1401 if (e
->callee
->clone
.combined_args_to_skip
)
1403 fprintf (symtab
->dump_file
, " combined args to skip: ");
1404 dump_bitmap (symtab
->dump_file
,
1405 e
->callee
->clone
.combined_args_to_skip
);
1409 if (e
->callee
->clone
.combined_args_to_skip
)
1414 = gimple_call_copy_skip_args (e
->call_stmt
,
1415 e
->callee
->clone
.combined_args_to_skip
);
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
);
1424 gsi_replace (&gsi
, new_stmt
, false);
1425 /* We need to defer cleaning EH info on the new statement to
1426 fixup-cfg. We may not have dominator information at this point
1427 and thus would end up with unreachable blocks and have no way
1428 to communicate that we need to run CFG cleanup then. */
1429 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1432 remove_stmt_from_eh_lp (e
->call_stmt
);
1433 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1438 new_stmt
= e
->call_stmt
;
1439 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1440 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1443 /* If the call becomes noreturn, remove the lhs. */
1444 if (lhs
&& (gimple_call_flags (new_stmt
) & ECF_NORETURN
))
1446 if (TREE_CODE (lhs
) == SSA_NAME
)
1448 tree var
= create_tmp_reg_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1449 TREE_TYPE (lhs
), NULL
);
1450 var
= get_or_create_ssa_default_def
1451 (DECL_STRUCT_FUNCTION (e
->caller
->decl
), var
);
1452 gimple set_stmt
= gimple_build_assign (lhs
, var
);
1453 gsi
= gsi_for_stmt (new_stmt
);
1454 gsi_insert_before_without_update (&gsi
, set_stmt
, GSI_SAME_STMT
);
1455 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), set_stmt
);
1457 gimple_call_set_lhs (new_stmt
, NULL_TREE
);
1458 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1461 /* If new callee has no static chain, remove it. */
1462 if (gimple_call_chain (new_stmt
) && !DECL_STATIC_CHAIN (e
->callee
->decl
))
1464 gimple_call_set_chain (new_stmt
, NULL
);
1465 update_stmt_fn (DECL_STRUCT_FUNCTION (e
->caller
->decl
), new_stmt
);
1468 maybe_remove_unused_call_args (DECL_STRUCT_FUNCTION (e
->caller
->decl
),
1471 e
->caller
->set_call_stmt_including_clones (e
->call_stmt
, new_stmt
, false);
1473 if (symtab
->dump_file
)
1475 fprintf (symtab
->dump_file
, " updated to:");
1476 print_gimple_stmt (symtab
->dump_file
, e
->call_stmt
, 0, dump_flags
);
1481 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1482 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1483 of OLD_STMT if it was previously call statement.
1484 If NEW_STMT is NULL, the call has been dropped without any
1488 cgraph_update_edges_for_call_stmt_node (cgraph_node
*node
,
1489 gimple old_stmt
, tree old_call
,
1492 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1493 ? gimple_call_fndecl (new_stmt
) : 0;
1495 /* We are seeing indirect calls, then there is nothing to update. */
1496 if (!new_call
&& !old_call
)
1498 /* See if we turned indirect call into direct call or folded call to one builtin
1499 into different builtin. */
1500 if (old_call
!= new_call
)
1502 cgraph_edge
*e
= node
->get_edge (old_stmt
);
1503 cgraph_edge
*ne
= NULL
;
1509 /* See if the edge is already there and has the correct callee. It
1510 might be so because of indirect inlining has already updated
1511 it. We also might've cloned and redirected the edge. */
1512 if (new_call
&& e
->callee
)
1514 cgraph_node
*callee
= e
->callee
;
1517 if (callee
->decl
== new_call
1518 || callee
->former_clone_of
== new_call
)
1520 e
->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1523 callee
= callee
->clone_of
;
1527 /* Otherwise remove edge and create new one; we can't simply redirect
1528 since function has changed, so inline plan and other information
1529 attached to edge is invalid. */
1531 frequency
= e
->frequency
;
1532 if (e
->indirect_unknown_callee
|| e
->inline_failed
)
1535 e
->callee
->remove_symbol_and_inline_clones ();
1539 /* We are seeing new direct call; compute profile info based on BB. */
1540 basic_block bb
= gimple_bb (new_stmt
);
1542 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1548 ne
= node
->create_edge (cgraph_node::get_create (new_call
),
1549 as_a
<gcall
*> (new_stmt
), count
,
1551 gcc_assert (ne
->inline_failed
);
1554 /* We only updated the call stmt; update pointer in cgraph edge.. */
1555 else if (old_stmt
!= new_stmt
)
1556 node
->get_edge (old_stmt
)->set_call_stmt (as_a
<gcall
*> (new_stmt
));
1559 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1560 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1561 of OLD_STMT before it was updated (updating can happen inplace). */
1564 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1566 cgraph_node
*orig
= cgraph_node::get (cfun
->decl
);
1569 gcc_checking_assert (orig
);
1570 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1572 for (node
= orig
->clones
; node
!= orig
;)
1574 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1576 node
= node
->clones
;
1577 else if (node
->next_sibling_clone
)
1578 node
= node
->next_sibling_clone
;
1581 while (node
!= orig
&& !node
->next_sibling_clone
)
1582 node
= node
->clone_of
;
1584 node
= node
->next_sibling_clone
;
1590 /* Remove all callees from the node. */
1593 cgraph_node::remove_callees (void)
1597 /* It is sufficient to remove the edges from the lists of callers of
1598 the callees. The callee list of the node can be zapped with one
1600 for (e
= callees
; e
; e
= f
)
1603 symtab
->call_edge_removal_hooks (e
);
1604 if (!e
->indirect_unknown_callee
)
1605 e
->remove_callee ();
1606 symtab
->free_edge (e
);
1608 for (e
= indirect_calls
; e
; e
= f
)
1611 symtab
->call_edge_removal_hooks (e
);
1612 if (!e
->indirect_unknown_callee
)
1613 e
->remove_callee ();
1614 symtab
->free_edge (e
);
1616 indirect_calls
= NULL
;
1620 call_site_hash
->empty ();
1621 call_site_hash
= NULL
;
1625 /* Remove all callers from the node. */
1628 cgraph_node::remove_callers (void)
1632 /* It is sufficient to remove the edges from the lists of callees of
1633 the callers. The caller list of the node can be zapped with one
1635 for (e
= callers
; e
; e
= f
)
1638 symtab
->call_edge_removal_hooks (e
);
1639 e
->remove_caller ();
1640 symtab
->free_edge (e
);
1645 /* Helper function for cgraph_release_function_body and free_lang_data.
1646 It releases body from function DECL without having to inspect its
1647 possibly non-existent symtab node. */
1650 release_function_body (tree decl
)
1652 if (DECL_STRUCT_FUNCTION (decl
))
1654 if (DECL_STRUCT_FUNCTION (decl
)->cfg
1655 || DECL_STRUCT_FUNCTION (decl
)->gimple_df
)
1657 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1661 cfun
->curr_properties
&= ~PROP_loops
;
1662 loop_optimizer_finalize ();
1664 if (cfun
->gimple_df
)
1667 delete_tree_cfg_annotations ();
1672 gcc_assert (!dom_info_available_p (CDI_DOMINATORS
));
1673 gcc_assert (!dom_info_available_p (CDI_POST_DOMINATORS
));
1677 if (cfun
->value_histograms
)
1681 gimple_set_body (decl
, NULL
);
1682 /* Struct function hangs a lot of data that would leak if we didn't
1683 removed all pointers to it. */
1684 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1685 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1687 DECL_SAVED_TREE (decl
) = NULL
;
1690 /* Release memory used to represent body of function.
1691 Use this only for functions that are released before being translated to
1692 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1693 are free'd in final.c via free_after_compilation().
1694 KEEP_ARGUMENTS are useful only if you want to rebuild body as thunk. */
1697 cgraph_node::release_body (bool keep_arguments
)
1699 ipa_transforms_to_apply
.release ();
1700 if (!used_as_abstract_origin
&& symtab
->state
!= PARSING
)
1702 DECL_RESULT (decl
) = NULL
;
1704 if (!keep_arguments
)
1705 DECL_ARGUMENTS (decl
) = NULL
;
1707 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1708 of its associated function function declaration because it's
1709 needed to emit debug info later. */
1710 if (!used_as_abstract_origin
&& DECL_INITIAL (decl
))
1711 DECL_INITIAL (decl
) = error_mark_node
;
1712 release_function_body (decl
);
1714 lto_free_function_in_decl_state_for_node (this);
1717 /* Remove function from symbol table. */
1720 cgraph_node::remove (void)
1723 int uid
= this->uid
;
1725 symtab
->call_cgraph_removal_hooks (this);
1728 ipa_transforms_to_apply
.release ();
1730 /* Incremental inlining access removed nodes stored in the postorder list.
1732 force_output
= false;
1733 forced_by_abi
= false;
1734 for (n
= nested
; n
; n
= n
->next_nested
)
1739 cgraph_node
**node2
= &origin
->nested
;
1741 while (*node2
!= this)
1742 node2
= &(*node2
)->next_nested
;
1743 *node2
= next_nested
;
1746 if (prev_sibling_clone
)
1747 prev_sibling_clone
->next_sibling_clone
= next_sibling_clone
;
1749 clone_of
->clones
= next_sibling_clone
;
1750 if (next_sibling_clone
)
1751 next_sibling_clone
->prev_sibling_clone
= prev_sibling_clone
;
1754 cgraph_node
*n
, *next
;
1758 for (n
= clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1759 n
->clone_of
= clone_of
;
1760 n
->clone_of
= clone_of
;
1761 n
->next_sibling_clone
= clone_of
->clones
;
1762 if (clone_of
->clones
)
1763 clone_of
->clones
->prev_sibling_clone
= n
;
1764 clone_of
->clones
= clones
;
1768 /* We are removing node with clones. This makes clones inconsistent,
1769 but assume they will be removed subsequently and just keep clone
1770 tree intact. This can happen in unreachable function removal since
1771 we remove unreachable functions in random order, not by bottom-up
1772 walk of clone trees. */
1773 for (n
= clones
; n
; n
= next
)
1775 next
= n
->next_sibling_clone
;
1776 n
->next_sibling_clone
= NULL
;
1777 n
->prev_sibling_clone
= NULL
;
1783 /* While all the clones are removed after being proceeded, the function
1784 itself is kept in the cgraph even after it is compiled. Check whether
1785 we are done with this body and reclaim it proactively if this is the case.
1787 if (symtab
->state
!= LTO_STREAMING
)
1789 n
= cgraph_node::get (decl
);
1791 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1792 && (symtab
->global_info_ready
1793 && (TREE_ASM_WRITTEN (n
->decl
)
1794 || DECL_EXTERNAL (n
->decl
)
1796 || (!flag_wpa
&& n
->in_other_partition
)))))
1803 call_site_hash
->empty ();
1804 call_site_hash
= NULL
;
1807 if (instrumented_version
)
1809 instrumented_version
->instrumented_version
= NULL
;
1810 instrumented_version
= NULL
;
1813 symtab
->release_symbol (this, uid
);
1816 /* Likewise indicate that a node is having address taken. */
1819 cgraph_node::mark_address_taken (void)
1821 /* Indirect inlining can figure out that all uses of the address are
1823 if (global
.inlined_to
)
1825 gcc_assert (cfun
->after_inlining
);
1826 gcc_assert (callers
->indirect_inlining_edge
);
1829 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1830 IPA_REF_ADDR reference exists (and thus it should be set on node
1831 representing alias we take address of) and as a test whether address
1832 of the object was taken (and thus it should be set on node alias is
1833 referring to). We should remove the first use and the remove the
1836 cgraph_node
*node
= ultimate_alias_target ();
1837 node
->address_taken
= 1;
1840 /* Return local info for the compiled function. */
1843 cgraph_node::local_info (tree decl
)
1845 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1846 cgraph_node
*node
= get (decl
);
1849 return &node
->ultimate_alias_target ()->local
;
1852 /* Return local info for the compiled function. */
1855 cgraph_node::rtl_info (tree decl
)
1857 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1858 cgraph_node
*node
= get (decl
);
1861 node
= node
->ultimate_alias_target ();
1862 if (node
->decl
!= current_function_decl
1863 && !TREE_ASM_WRITTEN (node
->decl
))
1865 return &node
->ultimate_alias_target ()->rtl
;
1868 /* Return a string describing the failure REASON. */
1871 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1874 #define DEFCIFCODE(code, type, string) string,
1876 static const char *cif_string_table
[CIF_N_REASONS
] = {
1877 #include "cif-code.def"
1880 /* Signedness of an enum type is implementation defined, so cast it
1881 to unsigned before testing. */
1882 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1883 return cif_string_table
[reason
];
1886 /* Return a type describing the failure REASON. */
1888 cgraph_inline_failed_type_t
1889 cgraph_inline_failed_type (cgraph_inline_failed_t reason
)
1892 #define DEFCIFCODE(code, type, string) type,
1894 static cgraph_inline_failed_type_t cif_type_table
[CIF_N_REASONS
] = {
1895 #include "cif-code.def"
1898 /* Signedness of an enum type is implementation defined, so cast it
1899 to unsigned before testing. */
1900 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1901 return cif_type_table
[reason
];
1904 /* Names used to print out the availability enum. */
1905 const char * const cgraph_availability_names
[] =
1906 {"unset", "not_available", "overwritable", "available", "local"};
1908 /* Output flags of edge to a file F. */
1911 cgraph_edge::dump_edge_flags (FILE *f
)
1914 fprintf (f
, "(speculative) ");
1916 fprintf (f
, "(inlined) ");
1917 if (indirect_inlining_edge
)
1918 fprintf (f
, "(indirect_inlining) ");
1920 fprintf (f
, "(%"PRId64
"x) ", (int64_t)count
);
1922 fprintf (f
, "(%.2f per call) ", frequency
/ (double)CGRAPH_FREQ_BASE
);
1923 if (can_throw_external
)
1924 fprintf (f
, "(can throw external) ");
1927 /* Dump call graph node to file F. */
1930 cgraph_node::dump (FILE *f
)
1936 if (global
.inlined_to
)
1937 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1938 xstrdup_for_dump (name ()),
1940 xstrdup_for_dump (global
.inlined_to
->name ()),
1941 global
.inlined_to
->order
);
1943 fprintf (f
, " Clone of %s/%i\n",
1944 clone_of
->asm_name (),
1946 if (symtab
->function_flags_ready
)
1947 fprintf (f
, " Availability: %s\n",
1948 cgraph_availability_names
[get_availability ()]);
1951 fprintf (f
, " Profile id: %i\n",
1953 fprintf (f
, " First run: %i\n", tp_first_run
);
1954 fprintf (f
, " Function flags:");
1956 fprintf (f
, " executed %"PRId64
"x",
1959 fprintf (f
, " nested in: %s", origin
->asm_name ());
1960 if (gimple_has_body_p (decl
))
1961 fprintf (f
, " body");
1963 fprintf (f
, " process");
1965 fprintf (f
, " local");
1966 if (local
.redefined_extern_inline
)
1967 fprintf (f
, " redefined_extern_inline");
1968 if (only_called_at_startup
)
1969 fprintf (f
, " only_called_at_startup");
1970 if (only_called_at_exit
)
1971 fprintf (f
, " only_called_at_exit");
1973 fprintf (f
, " tm_clone");
1975 fprintf (f
, " icf_merged");
1977 fprintf (f
, " nonfreeing_fn");
1978 if (DECL_STATIC_CONSTRUCTOR (decl
))
1979 fprintf (f
," static_constructor (priority:%i)", get_init_priority ());
1980 if (DECL_STATIC_DESTRUCTOR (decl
))
1981 fprintf (f
," static_destructor (priority:%i)", get_fini_priority ());
1982 if (frequency
== NODE_FREQUENCY_HOT
)
1983 fprintf (f
, " hot");
1984 if (frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
1985 fprintf (f
, " unlikely_executed");
1986 if (frequency
== NODE_FREQUENCY_EXECUTED_ONCE
)
1987 fprintf (f
, " executed_once");
1988 if (only_called_at_startup
)
1989 fprintf (f
, " only_called_at_startup");
1990 if (only_called_at_exit
)
1991 fprintf (f
, " only_called_at_exit");
1992 if (opt_for_fn (decl
, optimize_size
))
1993 fprintf (f
, " optimize_size");
1999 fprintf (f
, " Thunk");
2001 fprintf (f
, " of %s (asm: %s)",
2002 lang_hooks
.decl_printable_name (thunk
.alias
, 2),
2003 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2004 fprintf (f
, " fixed offset %i virtual value %i has "
2005 "virtual offset %i)\n",
2006 (int)thunk
.fixed_offset
,
2007 (int)thunk
.virtual_value
,
2008 (int)thunk
.virtual_offset_p
);
2010 if (alias
&& thunk
.alias
2011 && DECL_P (thunk
.alias
))
2013 fprintf (f
, " Alias of %s",
2014 lang_hooks
.decl_printable_name (thunk
.alias
, 2));
2015 if (DECL_ASSEMBLER_NAME_SET_P (thunk
.alias
))
2016 fprintf (f
, " (asm: %s)",
2017 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (thunk
.alias
)));
2021 fprintf (f
, " Called by: ");
2023 for (edge
= callers
; edge
; edge
= edge
->next_caller
)
2025 fprintf (f
, "%s/%i ", edge
->caller
->asm_name (),
2026 edge
->caller
->order
);
2027 edge
->dump_edge_flags (f
);
2030 fprintf (f
, "\n Calls: ");
2031 for (edge
= callees
; edge
; edge
= edge
->next_callee
)
2033 fprintf (f
, "%s/%i ", edge
->callee
->asm_name (),
2034 edge
->callee
->order
);
2035 edge
->dump_edge_flags (f
);
2039 for (edge
= indirect_calls
; edge
; edge
= edge
->next_callee
)
2041 if (edge
->indirect_info
->polymorphic
)
2043 fprintf (f
, " Polymorphic indirect call of type ");
2044 print_generic_expr (f
, edge
->indirect_info
->otr_type
, TDF_SLIM
);
2045 fprintf (f
, " token:%i", (int) edge
->indirect_info
->otr_token
);
2048 fprintf (f
, " Indirect call");
2049 edge
->dump_edge_flags (f
);
2050 if (edge
->indirect_info
->param_index
!= -1)
2052 fprintf (f
, " of param:%i", edge
->indirect_info
->param_index
);
2053 if (edge
->indirect_info
->agg_contents
)
2054 fprintf (f
, " loaded from %s %s at offset %i",
2055 edge
->indirect_info
->member_ptr
? "member ptr" : "aggregate",
2056 edge
->indirect_info
->by_ref
? "passed by reference":"",
2057 (int)edge
->indirect_info
->offset
);
2058 if (edge
->indirect_info
->vptr_changed
)
2059 fprintf (f
, " (vptr maybe changed)");
2062 if (edge
->indirect_info
->polymorphic
)
2063 edge
->indirect_info
->context
.dump (f
);
2066 if (instrumentation_clone
)
2067 fprintf (f
, " Is instrumented version.\n");
2068 else if (instrumented_version
)
2069 fprintf (f
, " Has instrumented version.\n");
2072 /* Dump call graph node NODE to stderr. */
2075 cgraph_node::debug (void)
2080 /* Dump the callgraph to file F. */
2083 cgraph_node::dump_cgraph (FILE *f
)
2087 fprintf (f
, "callgraph:\n\n");
2088 FOR_EACH_FUNCTION (node
)
2092 /* Return true when the DECL can possibly be inlined. */
2095 cgraph_function_possibly_inlined_p (tree decl
)
2097 if (!symtab
->global_info_ready
)
2098 return !DECL_UNINLINABLE (decl
);
2099 return DECL_POSSIBLY_INLINED (decl
);
2102 /* cgraph_node is no longer nested function; update cgraph accordingly. */
2104 cgraph_node::unnest (void)
2106 cgraph_node
**node2
= &origin
->nested
;
2107 gcc_assert (origin
);
2109 while (*node2
!= this)
2110 node2
= &(*node2
)->next_nested
;
2111 *node2
= next_nested
;
2115 /* Return function availability. See cgraph.h for description of individual
2118 cgraph_node::get_availability (void)
2120 enum availability avail
;
2122 avail
= AVAIL_NOT_AVAILABLE
;
2123 else if (local
.local
)
2124 avail
= AVAIL_LOCAL
;
2125 else if (alias
&& weakref
)
2126 ultimate_alias_target (&avail
);
2127 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (decl
)))
2128 avail
= AVAIL_INTERPOSABLE
;
2129 else if (!externally_visible
)
2130 avail
= AVAIL_AVAILABLE
;
2131 /* Inline functions are safe to be analyzed even if their symbol can
2132 be overwritten at runtime. It is not meaningful to enforce any sane
2133 behaviour on replacing inline function by different body. */
2134 else if (DECL_DECLARED_INLINE_P (decl
))
2135 avail
= AVAIL_AVAILABLE
;
2137 /* If the function can be overwritten, return OVERWRITABLE. Take
2138 care at least of two notable extensions - the COMDAT functions
2139 used to share template instantiations in C++ (this is symmetric
2140 to code cp_cannot_inline_tree_fn and probably shall be shared and
2141 the inlinability hooks completely eliminated).
2143 ??? Does the C++ one definition rule allow us to always return
2144 AVAIL_AVAILABLE here? That would be good reason to preserve this
2147 else if (decl_replaceable_p (decl
) && !DECL_EXTERNAL (decl
))
2148 avail
= AVAIL_INTERPOSABLE
;
2149 else avail
= AVAIL_AVAILABLE
;
2154 /* Worker for cgraph_node_can_be_local_p. */
2156 cgraph_node_cannot_be_local_p_1 (cgraph_node
*node
, void *)
2158 return !(!node
->force_output
2159 && ((DECL_COMDAT (node
->decl
)
2160 && !node
->forced_by_abi
2161 && !node
->used_from_object_file_p ()
2162 && !node
->same_comdat_group
)
2163 || !node
->externally_visible
));
2166 /* Return true if cgraph_node can be made local for API change.
2167 Extern inline functions and C++ COMDAT functions can be made local
2168 at the expense of possible code size growth if function is used in multiple
2169 compilation units. */
2171 cgraph_node::can_be_local_p (void)
2173 return (!address_taken
2174 && !call_for_symbol_thunks_and_aliases (cgraph_node_cannot_be_local_p_1
,
2178 /* Call callback on cgraph_node, thunks and aliases associated to cgraph_node.
2179 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2180 skipped. When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
2183 cgraph_node::call_for_symbol_thunks_and_aliases (bool (*callback
)
2184 (cgraph_node
*, void *),
2186 bool include_overwritable
,
2187 bool exclude_virtual_thunks
)
2192 if (callback (this, data
))
2194 FOR_EACH_ALIAS (this, ref
)
2196 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
2197 if (include_overwritable
2198 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
2199 if (alias
->call_for_symbol_thunks_and_aliases (callback
, data
,
2200 include_overwritable
,
2201 exclude_virtual_thunks
))
2204 for (e
= callers
; e
; e
= e
->next_caller
)
2205 if (e
->caller
->thunk
.thunk_p
2206 && (include_overwritable
2207 || e
->caller
->get_availability () > AVAIL_INTERPOSABLE
)
2208 && !(exclude_virtual_thunks
2209 && e
->caller
->thunk
.virtual_offset_p
))
2210 if (e
->caller
->call_for_symbol_thunks_and_aliases (callback
, data
,
2211 include_overwritable
,
2212 exclude_virtual_thunks
))
2218 /* Worker to bring NODE local. */
2221 cgraph_node::make_local (cgraph_node
*node
, void *)
2223 gcc_checking_assert (node
->can_be_local_p ());
2224 if (DECL_COMDAT (node
->decl
) || DECL_EXTERNAL (node
->decl
))
2226 node
->make_decl_local ();
2227 node
->set_section (NULL
);
2228 node
->set_comdat_group (NULL
);
2229 node
->externally_visible
= false;
2230 node
->forced_by_abi
= false;
2231 node
->local
.local
= true;
2232 node
->set_section (NULL
);
2233 node
->unique_name
= (node
->resolution
== LDPR_PREVAILING_DEF_IRONLY
2234 || node
->resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2235 node
->resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2236 gcc_assert (node
->get_availability () == AVAIL_LOCAL
);
2241 /* Bring cgraph node local. */
2244 cgraph_node::make_local (void)
2246 call_for_symbol_thunks_and_aliases (cgraph_node::make_local
, NULL
, true);
2249 /* Worker to set nothrow flag. */
2252 cgraph_set_nothrow_flag_1 (cgraph_node
*node
, void *data
)
2256 TREE_NOTHROW (node
->decl
) = data
!= NULL
;
2259 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2260 e
->can_throw_external
= false;
2264 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2265 if any to NOTHROW. */
2268 cgraph_node::set_nothrow_flag (bool nothrow
)
2270 call_for_symbol_thunks_and_aliases (cgraph_set_nothrow_flag_1
,
2271 (void *)(size_t)nothrow
, false);
2274 /* Worker to set const flag. */
2277 cgraph_set_const_flag_1 (cgraph_node
*node
, void *data
)
2279 /* Static constructors and destructors without a side effect can be
2281 if (data
&& !((size_t)data
& 2))
2283 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2284 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2285 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2286 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2288 TREE_READONLY (node
->decl
) = data
!= NULL
;
2289 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2293 /* Set TREE_READONLY on cgraph_node's decl and on aliases of the node
2294 if any to READONLY. */
2297 cgraph_node::set_const_flag (bool readonly
, bool looping
)
2299 call_for_symbol_thunks_and_aliases (cgraph_set_const_flag_1
,
2300 (void *)(size_t)(readonly
+ (int)looping
* 2),
2304 /* Worker to set pure flag. */
2307 cgraph_set_pure_flag_1 (cgraph_node
*node
, void *data
)
2309 /* Static constructors and destructors without a side effect can be
2311 if (data
&& !((size_t)data
& 2))
2313 if (DECL_STATIC_CONSTRUCTOR (node
->decl
))
2314 DECL_STATIC_CONSTRUCTOR (node
->decl
) = 0;
2315 if (DECL_STATIC_DESTRUCTOR (node
->decl
))
2316 DECL_STATIC_DESTRUCTOR (node
->decl
) = 0;
2318 DECL_PURE_P (node
->decl
) = data
!= NULL
;
2319 DECL_LOOPING_CONST_OR_PURE_P (node
->decl
) = ((size_t)data
& 2) != 0;
2323 /* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
2327 cgraph_node::set_pure_flag (bool pure
, bool looping
)
2329 call_for_symbol_thunks_and_aliases (cgraph_set_pure_flag_1
,
2330 (void *)(size_t)(pure
+ (int)looping
* 2),
2334 /* Return true when cgraph_node can not return or throw and thus
2335 it is safe to ignore its side effects for IPA analysis. */
2338 cgraph_node::cannot_return_p (void)
2340 int flags
= flags_from_decl_or_type (decl
);
2341 if (!opt_for_fn (decl
, flag_exceptions
))
2342 return (flags
& ECF_NORETURN
) != 0;
2344 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2345 == (ECF_NORETURN
| ECF_NOTHROW
));
2348 /* Return true when call of edge can not lead to return from caller
2349 and thus it is safe to ignore its side effects for IPA analysis
2350 when computing side effects of the caller.
2351 FIXME: We could actually mark all edges that have no reaching
2352 patch to the exit block or throw to get better results. */
2354 cgraph_edge::cannot_lead_to_return_p (void)
2356 if (caller
->cannot_return_p ())
2358 if (indirect_unknown_callee
)
2360 int flags
= indirect_info
->ecf_flags
;
2361 if (!opt_for_fn (caller
->decl
, flag_exceptions
))
2362 return (flags
& ECF_NORETURN
) != 0;
2364 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2365 == (ECF_NORETURN
| ECF_NOTHROW
));
2368 return callee
->cannot_return_p ();
2371 /* Return true if the call can be hot. */
2374 cgraph_edge::maybe_hot_p (void)
2376 /* TODO: Export profile_status from cfun->cfg to cgraph_node. */
2378 && opt_for_fn (caller
->decl
, flag_branch_probabilities
)
2379 && !maybe_hot_count_p (NULL
, count
))
2381 if (caller
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
2383 && callee
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
))
2385 if (caller
->frequency
> NODE_FREQUENCY_UNLIKELY_EXECUTED
2387 && callee
->frequency
<= NODE_FREQUENCY_EXECUTED_ONCE
))
2389 if (opt_for_fn (caller
->decl
, optimize_size
))
2391 if (caller
->frequency
== NODE_FREQUENCY_HOT
)
2393 if (caller
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
2394 && frequency
< CGRAPH_FREQ_BASE
* 3 / 2)
2396 if (opt_for_fn (caller
->decl
, flag_guess_branch_prob
))
2398 if (PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
) == 0
2399 || frequency
<= (CGRAPH_FREQ_BASE
2400 / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION
)))
2406 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2409 nonremovable_p (cgraph_node
*node
, void *)
2411 return !node
->can_remove_if_no_direct_calls_and_refs_p ();
2414 /* Return true if whole comdat group can be removed if there are no direct
2418 cgraph_node::can_remove_if_no_direct_calls_p (bool will_inline
)
2420 struct ipa_ref
*ref
;
2422 /* For local symbols or non-comdat group it is the same as
2423 can_remove_if_no_direct_calls_p. */
2424 if (!externally_visible
|| !same_comdat_group
)
2426 if (DECL_EXTERNAL (decl
))
2430 return !call_for_symbol_and_aliases (nonremovable_p
, NULL
, true);
2433 if (will_inline
&& address_taken
)
2436 /* Otheriwse check if we can remove the symbol itself and then verify
2437 that only uses of the comdat groups are direct call to THIS
2439 if (!can_remove_if_no_direct_calls_and_refs_p ())
2442 /* Check that all refs come from within the comdat group. */
2443 for (int i
= 0; iterate_referring (i
, ref
); i
++)
2444 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2447 struct cgraph_node
*target
= ultimate_alias_target ();
2448 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2449 next
!= this; next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2451 if (!externally_visible
)
2454 && !next
->can_remove_if_no_direct_calls_and_refs_p ())
2457 /* If we see different symbol than THIS, be sure to check calls. */
2458 if (next
->ultimate_alias_target () != target
)
2459 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2460 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2464 /* If function is not being inlined, we care only about
2465 references outside of the comdat group. */
2467 for (int i
= 0; next
->iterate_referring (i
, ref
); i
++)
2468 if (ref
->referring
->get_comdat_group () != get_comdat_group ())
2474 /* Return true when function cgraph_node can be expected to be removed
2475 from program when direct calls in this compilation unit are removed.
2477 As a special case COMDAT functions are
2478 cgraph_can_remove_if_no_direct_calls_p while the are not
2479 cgraph_only_called_directly_p (it is possible they are called from other
2482 This function behaves as cgraph_only_called_directly_p because eliminating
2483 all uses of COMDAT function does not make it necessarily disappear from
2484 the program unless we are compiling whole program or we do LTO. In this
2485 case we know we win since dynamic linking will not really discard the
2486 linkonce section. */
2489 cgraph_node::will_be_removed_from_program_if_no_direct_calls_p
2492 gcc_assert (!global
.inlined_to
);
2493 if (DECL_EXTERNAL (decl
))
2496 if (!in_lto_p
&& !flag_whole_program
)
2498 /* If the symbol is in comdat group, we need to verify that whole comdat
2499 group becomes unreachable. Technically we could skip references from
2500 within the group, too. */
2501 if (!only_called_directly_p ())
2503 if (same_comdat_group
&& externally_visible
)
2505 struct cgraph_node
*target
= ultimate_alias_target ();
2507 if (will_inline
&& address_taken
)
2509 for (cgraph_node
*next
= dyn_cast
<cgraph_node
*> (same_comdat_group
);
2511 next
= dyn_cast
<cgraph_node
*> (next
->same_comdat_group
))
2513 if (!externally_visible
)
2516 && !next
->only_called_directly_p ())
2519 /* If we see different symbol than THIS,
2520 be sure to check calls. */
2521 if (next
->ultimate_alias_target () != target
)
2522 for (cgraph_edge
*e
= next
->callers
; e
; e
= e
->next_caller
)
2523 if (e
->caller
->get_comdat_group () != get_comdat_group ()
2531 return can_remove_if_no_direct_calls_p (will_inline
);
2535 /* Worker for cgraph_only_called_directly_p. */
2538 cgraph_not_only_called_directly_p_1 (cgraph_node
*node
, void *)
2540 return !node
->only_called_directly_or_aliased_p ();
2543 /* Return true when function cgraph_node and all its aliases are only called
2545 i.e. it is not externally visible, address was not taken and
2546 it is not used in any other non-standard way. */
2549 cgraph_node::only_called_directly_p (void)
2551 gcc_assert (ultimate_alias_target () == this);
2552 return !call_for_symbol_and_aliases (cgraph_not_only_called_directly_p_1
,
2557 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2560 collect_callers_of_node_1 (cgraph_node
*node
, void *data
)
2562 vec
<cgraph_edge
*> *redirect_callers
= (vec
<cgraph_edge
*> *)data
;
2564 enum availability avail
;
2565 node
->ultimate_alias_target (&avail
);
2567 if (avail
> AVAIL_INTERPOSABLE
)
2568 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2569 if (!cs
->indirect_inlining_edge
)
2570 redirect_callers
->safe_push (cs
);
2574 /* Collect all callers of cgraph_node and its aliases that are known to lead to
2575 cgraph_node (i.e. are not overwritable). */
2578 cgraph_node::collect_callers (void)
2580 vec
<cgraph_edge
*> redirect_callers
= vNULL
;
2581 call_for_symbol_thunks_and_aliases (collect_callers_of_node_1
,
2582 &redirect_callers
, false);
2583 return redirect_callers
;
2586 /* Return TRUE if NODE2 a clone of NODE or is equivalent to it. */
2589 clone_of_p (cgraph_node
*node
, cgraph_node
*node2
)
2591 bool skipped_thunk
= false;
2592 node
= node
->ultimate_alias_target ();
2593 node2
= node2
->ultimate_alias_target ();
2595 /* There are no virtual clones of thunks so check former_clone_of or if we
2596 might have skipped thunks because this adjustments are no longer
2598 while (node
->thunk
.thunk_p
)
2600 if (node2
->former_clone_of
== node
->decl
)
2602 if (!node
->thunk
.this_adjusting
)
2604 node
= node
->callees
->callee
->ultimate_alias_target ();
2605 skipped_thunk
= true;
2610 if (!node2
->clone
.args_to_skip
2611 || !bitmap_bit_p (node2
->clone
.args_to_skip
, 0))
2613 if (node2
->former_clone_of
== node
->decl
)
2615 else if (!node2
->clone_of
)
2619 while (node
!= node2
&& node2
)
2620 node2
= node2
->clone_of
;
2621 return node2
!= NULL
;
2624 /* Verify edge count and frequency. */
2627 cgraph_edge::verify_count_and_frequency ()
2629 bool error_found
= false;
2632 error ("caller edge count is negative");
2637 error ("caller edge frequency is negative");
2640 if (frequency
> CGRAPH_FREQ_MAX
)
2642 error ("caller edge frequency is too large");
2645 if (gimple_has_body_p (caller
->decl
)
2646 && !caller
->global
.inlined_to
2648 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2649 Remove this once edges are actually removed from the function at that time. */
2651 || (inline_edge_summary_vec
.exists ()
2652 && ((inline_edge_summary_vec
.length () <= (unsigned) uid
)
2653 || !inline_edge_summary (this)->predicate
)))
2655 != compute_call_stmt_bb_frequency (caller
->decl
,
2656 gimple_bb (call_stmt
))))
2658 error ("caller edge frequency %i does not match BB frequency %i",
2660 compute_call_stmt_bb_frequency (caller
->decl
,
2661 gimple_bb (call_stmt
)));
2667 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2669 cgraph_debug_gimple_stmt (function
*this_cfun
, gimple stmt
)
2671 bool fndecl_was_null
= false;
2672 /* debug_gimple_stmt needs correct cfun */
2673 if (cfun
!= this_cfun
)
2674 set_cfun (this_cfun
);
2675 /* ...and an actual current_function_decl */
2676 if (!current_function_decl
)
2678 current_function_decl
= this_cfun
->decl
;
2679 fndecl_was_null
= true;
2681 debug_gimple_stmt (stmt
);
2682 if (fndecl_was_null
)
2683 current_function_decl
= NULL
;
2686 /* Verify that call graph edge corresponds to DECL from the associated
2687 statement. Return true if the verification should fail. */
2690 cgraph_edge::verify_corresponds_to_fndecl (tree decl
)
2694 if (!decl
|| callee
->global
.inlined_to
)
2696 if (symtab
->state
== LTO_STREAMING
)
2698 node
= cgraph_node::get (decl
);
2700 /* We do not know if a node from a different partition is an alias or what it
2701 aliases and therefore cannot do the former_clone_of check reliably. When
2702 body_removed is set, we have lost all information about what was alias or
2703 thunk of and also cannot proceed. */
2705 || node
->body_removed
2706 || node
->in_other_partition
2707 || callee
->icf_merged
2708 || callee
->in_other_partition
)
2711 node
= node
->ultimate_alias_target ();
2713 /* Optimizers can redirect unreachable calls or calls triggering undefined
2714 behaviour to builtin_unreachable. */
2715 if (DECL_BUILT_IN_CLASS (callee
->decl
) == BUILT_IN_NORMAL
2716 && DECL_FUNCTION_CODE (callee
->decl
) == BUILT_IN_UNREACHABLE
)
2719 if (callee
->former_clone_of
!= node
->decl
2720 && (node
!= callee
->ultimate_alias_target ())
2721 && !clone_of_p (node
, callee
))
2727 /* Verify cgraph nodes of given cgraph node. */
2729 cgraph_node::verify_node (void)
2732 function
*this_cfun
= DECL_STRUCT_FUNCTION (decl
);
2733 basic_block this_block
;
2734 gimple_stmt_iterator gsi
;
2735 bool error_found
= false;
2740 timevar_push (TV_CGRAPH_VERIFY
);
2741 error_found
|= verify_base ();
2742 for (e
= callees
; e
; e
= e
->next_callee
)
2745 error ("aux field set for edge %s->%s",
2746 identifier_to_locale (e
->caller
->name ()),
2747 identifier_to_locale (e
->callee
->name ()));
2752 error ("execution count is negative");
2755 if (global
.inlined_to
&& same_comdat_group
)
2757 error ("inline clone in same comdat group list");
2760 if (!definition
&& !in_other_partition
&& local
.local
)
2762 error ("local symbols must be defined");
2765 if (global
.inlined_to
&& externally_visible
)
2767 error ("externally visible inline clone");
2770 if (global
.inlined_to
&& address_taken
)
2772 error ("inline clone with address taken");
2775 if (global
.inlined_to
&& force_output
)
2777 error ("inline clone is forced to output");
2780 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2784 error ("aux field set for indirect edge from %s",
2785 identifier_to_locale (e
->caller
->name ()));
2788 if (!e
->indirect_unknown_callee
2789 || !e
->indirect_info
)
2791 error ("An indirect edge from %s is not marked as indirect or has "
2792 "associated indirect_info, the corresponding statement is: ",
2793 identifier_to_locale (e
->caller
->name ()));
2794 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2798 bool check_comdat
= comdat_local_p ();
2799 for (e
= callers
; e
; e
= e
->next_caller
)
2801 if (e
->verify_count_and_frequency ())
2804 && !in_same_comdat_group_p (e
->caller
))
2806 error ("comdat-local function called by %s outside its comdat",
2807 identifier_to_locale (e
->caller
->name ()));
2810 if (!e
->inline_failed
)
2812 if (global
.inlined_to
2813 != (e
->caller
->global
.inlined_to
2814 ? e
->caller
->global
.inlined_to
: e
->caller
))
2816 error ("inlined_to pointer is wrong");
2819 if (callers
->next_caller
)
2821 error ("multiple inline callers");
2826 if (global
.inlined_to
)
2828 error ("inlined_to pointer set for noninline callers");
2832 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
2833 if (e
->verify_count_and_frequency ())
2835 if (!callers
&& global
.inlined_to
)
2837 error ("inlined_to pointer is set but no predecessors found");
2840 if (global
.inlined_to
== this)
2842 error ("inlined_to pointer refers to itself");
2849 for (n
= clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2854 error ("cgraph_node has wrong clone_of");
2861 for (n
= clones
; n
; n
= n
->next_sibling_clone
)
2862 if (n
->clone_of
!= this)
2866 error ("cgraph_node has wrong clone list");
2870 if ((prev_sibling_clone
|| next_sibling_clone
) && !clone_of
)
2872 error ("cgraph_node is in clone list but it is not clone");
2875 if (!prev_sibling_clone
&& clone_of
&& clone_of
->clones
!= this)
2877 error ("cgraph_node has wrong prev_clone pointer");
2880 if (prev_sibling_clone
&& prev_sibling_clone
->next_sibling_clone
!= this)
2882 error ("double linked list of clones corrupted");
2886 if (analyzed
&& alias
)
2888 bool ref_found
= false;
2890 ipa_ref
*ref
= NULL
;
2894 error ("Alias has call edges");
2897 for (i
= 0; iterate_reference (i
, ref
); i
++)
2898 if (ref
->use
== IPA_REF_CHKP
)
2900 else if (ref
->use
!= IPA_REF_ALIAS
)
2902 error ("Alias has non-alias reference");
2907 error ("Alias has more than one alias reference");
2914 error ("Analyzed alias has no reference");
2919 /* Check instrumented version reference. */
2920 if (instrumented_version
2921 && instrumented_version
->instrumented_version
!= this)
2923 error ("Instrumentation clone does not reference original node");
2927 /* Cannot have orig_decl for not instrumented nodes. */
2928 if (!instrumentation_clone
&& orig_decl
)
2930 error ("Not instrumented node has non-NULL original declaration");
2934 /* If original not instrumented node still exists then we may check
2935 original declaration is set properly. */
2936 if (instrumented_version
2938 && orig_decl
!= instrumented_version
->decl
)
2940 error ("Instrumented node has wrong original declaration");
2944 /* Check all nodes have chkp reference to their instrumented versions. */
2946 && instrumented_version
2947 && !instrumentation_clone
)
2949 bool ref_found
= false;
2951 struct ipa_ref
*ref
;
2953 for (i
= 0; iterate_reference (i
, ref
); i
++)
2954 if (ref
->use
== IPA_REF_CHKP
)
2958 error ("Node has more than one chkp reference");
2961 if (ref
->referred
!= instrumented_version
)
2963 error ("Wrong node is referenced with chkp reference");
2971 error ("Analyzed node has no reference to instrumented version");
2976 if (analyzed
&& thunk
.thunk_p
)
2980 error ("No edge out of thunk node");
2983 else if (callees
->next_callee
)
2985 error ("More than one edge out of thunk node");
2988 if (gimple_has_body_p (decl
))
2990 error ("Thunk is not supposed to have body");
2993 if (thunk
.add_pointer_bounds_args
2994 && !instrumented_version
->semantically_equivalent_p (callees
->callee
))
2996 error ("Instrumentation thunk has wrong edge callee");
3000 else if (analyzed
&& gimple_has_body_p (decl
)
3001 && !TREE_ASM_WRITTEN (decl
)
3002 && (!DECL_EXTERNAL (decl
) || global
.inlined_to
)
3007 hash_set
<gimple
> stmts
;
3009 ipa_ref
*ref
= NULL
;
3011 /* Reach the trees by walking over the CFG, and note the
3012 enclosing basic-blocks in the call edges. */
3013 FOR_EACH_BB_FN (this_block
, this_cfun
)
3015 for (gsi
= gsi_start_phis (this_block
);
3016 !gsi_end_p (gsi
); gsi_next (&gsi
))
3017 stmts
.add (gsi_stmt (gsi
));
3018 for (gsi
= gsi_start_bb (this_block
);
3022 gimple stmt
= gsi_stmt (gsi
);
3024 if (is_gimple_call (stmt
))
3026 cgraph_edge
*e
= get_edge (stmt
);
3027 tree decl
= gimple_call_fndecl (stmt
);
3032 error ("shared call_stmt:");
3033 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3036 if (!e
->indirect_unknown_callee
)
3038 if (e
->verify_corresponds_to_fndecl (decl
))
3040 error ("edge points to wrong declaration:");
3041 debug_tree (e
->callee
->decl
);
3042 fprintf (stderr
," Instead of:");
3049 error ("an indirect edge with unknown callee "
3050 "corresponding to a call_stmt with "
3051 "a known declaration:");
3053 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3059 error ("missing callgraph edge for call stmt:");
3060 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
3066 for (i
= 0; iterate_reference (i
, ref
); i
++)
3067 if (ref
->stmt
&& !stmts
.contains (ref
->stmt
))
3069 error ("reference to dead statement");
3070 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
3075 /* No CFG available?! */
3078 for (e
= callees
; e
; e
= e
->next_callee
)
3082 error ("edge %s->%s has no corresponding call_stmt",
3083 identifier_to_locale (e
->caller
->name ()),
3084 identifier_to_locale (e
->callee
->name ()));
3085 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3090 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
3092 if (!e
->aux
&& !e
->speculative
)
3094 error ("an indirect edge from %s has no corresponding call_stmt",
3095 identifier_to_locale (e
->caller
->name ()));
3096 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
3105 internal_error ("verify_cgraph_node failed");
3107 timevar_pop (TV_CGRAPH_VERIFY
);
3110 /* Verify whole cgraph structure. */
3112 cgraph_node::verify_cgraph_nodes (void)
3119 FOR_EACH_FUNCTION (node
)
3123 /* Walk the alias chain to return the function cgraph_node is alias of.
3124 Walk through thunks, too.
3125 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3128 cgraph_node::function_symbol (enum availability
*availability
)
3130 cgraph_node
*node
= ultimate_alias_target (availability
);
3132 while (node
->thunk
.thunk_p
)
3134 node
= node
->callees
->callee
;
3137 enum availability a
;
3138 a
= node
->get_availability ();
3139 if (a
< *availability
)
3142 node
= node
->ultimate_alias_target (availability
);
3147 /* Walk the alias chain to return the function cgraph_node is alias of.
3148 Walk through non virtual thunks, too. Thus we return either a function
3149 or a virtual thunk node.
3150 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3153 cgraph_node::function_or_virtual_thunk_symbol
3154 (enum availability
*availability
)
3156 cgraph_node
*node
= ultimate_alias_target (availability
);
3158 while (node
->thunk
.thunk_p
&& !node
->thunk
.virtual_offset_p
)
3160 node
= node
->callees
->callee
;
3163 enum availability a
;
3164 a
= node
->get_availability ();
3165 if (a
< *availability
)
3168 node
= node
->ultimate_alias_target (availability
);
3173 /* When doing LTO, read cgraph_node's body from disk if it is not already
3177 cgraph_node::get_untransformed_body (void)
3179 lto_file_decl_data
*file_data
;
3180 const char *data
, *name
;
3182 tree decl
= this->decl
;
3184 if (DECL_RESULT (decl
))
3187 gcc_assert (in_lto_p
);
3189 timevar_push (TV_IPA_LTO_GIMPLE_IN
);
3191 file_data
= lto_file_data
;
3192 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3194 /* We may have renamed the declaration, e.g., a static function. */
3195 name
= lto_get_decl_name_mapping (file_data
, name
);
3197 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3200 fatal_error (input_location
, "%s: section %s is missing",
3201 file_data
->file_name
,
3204 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3206 lto_input_function_body (file_data
, this, data
);
3207 lto_stats
.num_function_bodies
++;
3208 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3210 lto_free_function_in_decl_state_for_node (this);
3212 timevar_pop (TV_IPA_LTO_GIMPLE_IN
);
3217 /* Prepare function body. When doing LTO, read cgraph_node's body from disk
3218 if it is not already present. When some IPA transformations are scheduled,
3222 cgraph_node::get_body (void)
3226 updated
= get_untransformed_body ();
3228 /* Getting transformed body makes no sense for inline clones;
3229 we should never use this on real clones becuase they are materialized
3231 TODO: Materializing clones here will likely lead to smaller LTRANS
3233 gcc_assert (!global
.inlined_to
&& !clone_of
);
3234 if (ipa_transforms_to_apply
.exists ())
3236 opt_pass
*saved_current_pass
= current_pass
;
3237 FILE *saved_dump_file
= dump_file
;
3238 int saved_dump_flags
= dump_flags
;
3240 push_cfun (DECL_STRUCT_FUNCTION (decl
));
3241 execute_all_ipa_transforms ();
3242 cgraph_edge::rebuild_edges ();
3243 free_dominance_info (CDI_DOMINATORS
);
3244 free_dominance_info (CDI_POST_DOMINATORS
);
3248 current_pass
= saved_current_pass
;
3249 dump_file
= saved_dump_file
;
3250 dump_flags
= saved_dump_flags
;
3255 /* Return the DECL_STRUCT_FUNCTION of the function. */
3258 cgraph_node::get_fun (void)
3260 cgraph_node
*node
= this;
3261 struct function
*fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3263 while (!fun
&& node
->clone_of
)
3265 node
= node
->clone_of
;
3266 fun
= DECL_STRUCT_FUNCTION (node
->decl
);
3272 /* Verify if the type of the argument matches that of the function
3273 declaration. If we cannot verify this or there is a mismatch,
3277 gimple_check_call_args (gimple stmt
, tree fndecl
, bool args_count_match
)
3280 unsigned int i
, nargs
;
3282 /* Calls to internal functions always match their signature. */
3283 if (gimple_call_internal_p (stmt
))
3286 nargs
= gimple_call_num_args (stmt
);
3288 /* Get argument types for verification. */
3290 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
3292 parms
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
3294 /* Verify if the type of the argument matches that of the function
3295 declaration. If we cannot verify this or there is a mismatch,
3297 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
3299 for (i
= 0, p
= DECL_ARGUMENTS (fndecl
);
3301 i
++, p
= DECL_CHAIN (p
))
3304 /* We cannot distinguish a varargs function from the case
3305 of excess parameters, still deferring the inlining decision
3306 to the callee is possible. */
3309 arg
= gimple_call_arg (stmt
, i
);
3310 if (p
== error_mark_node
3311 || DECL_ARG_TYPE (p
) == error_mark_node
3312 || arg
== error_mark_node
3313 || (!types_compatible_p (DECL_ARG_TYPE (p
), TREE_TYPE (arg
))
3314 && !fold_convertible_p (DECL_ARG_TYPE (p
), arg
)))
3317 if (args_count_match
&& p
)
3322 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
3325 /* If this is a varargs function defer inlining decision
3329 arg
= gimple_call_arg (stmt
, i
);
3330 if (TREE_VALUE (p
) == error_mark_node
3331 || arg
== error_mark_node
3332 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
3333 || (!types_compatible_p (TREE_VALUE (p
), TREE_TYPE (arg
))
3334 && !fold_convertible_p (TREE_VALUE (p
), arg
)))
3346 /* Verify if the type of the argument and lhs of CALL_STMT matches
3347 that of the function declaration CALLEE. If ARGS_COUNT_MATCH is
3348 true, the arg count needs to be the same.
3349 If we cannot verify this or there is a mismatch, return false. */
3352 gimple_check_call_matching_types (gimple call_stmt
, tree callee
,
3353 bool args_count_match
)
3357 if ((DECL_RESULT (callee
)
3358 && !DECL_BY_REFERENCE (DECL_RESULT (callee
))
3359 && (lhs
= gimple_call_lhs (call_stmt
)) != NULL_TREE
3360 && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee
)),
3362 && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee
)), lhs
))
3363 || !gimple_check_call_args (call_stmt
, callee
, args_count_match
))
3368 /* Reset all state within cgraph.c so that we can rerun the compiler
3369 within the same process. For use by toplev::finalize. */
3372 cgraph_c_finalize (void)
3376 x_cgraph_nodes_queue
= NULL
;
3378 cgraph_fnver_htab
= NULL
;
3379 version_info_node
= NULL
;
3382 /* A wroker for call_for_symbol_and_aliases. */
3385 cgraph_node::call_for_symbol_and_aliases_1 (bool (*callback
) (cgraph_node
*,
3388 bool include_overwritable
)
3391 FOR_EACH_ALIAS (this, ref
)
3393 cgraph_node
*alias
= dyn_cast
<cgraph_node
*> (ref
->referring
);
3394 if (include_overwritable
3395 || alias
->get_availability () > AVAIL_INTERPOSABLE
)
3396 if (alias
->call_for_symbol_and_aliases (callback
, data
,
3397 include_overwritable
))
3403 /* Return true if NODE has thunk. */
3406 cgraph_node::has_thunk_p (cgraph_node
*node
, void *)
3408 for (cgraph_edge
*e
= node
->callers
; e
; e
= e
->next_caller
)
3409 if (e
->caller
->thunk
.thunk_p
)
3414 #include "gt-cgraph.h"