1 /* Callgraph handling code.
2 Copyright (C) 2003-2013 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"
31 #include "tree-inline.h"
32 #include "langhooks.h"
39 #include "basic-block.h"
45 #include "tree-flow.h"
46 #include "value-prof.h"
48 #include "diagnostic-core.h"
50 #include "ipa-utils.h"
51 #include "lto-streamer.h"
52 #include "ipa-inline.h"
54 #include "gimple-pretty-print.h"
56 /* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
57 #include "tree-pass.h"
59 static void cgraph_node_remove_callers (struct cgraph_node
*node
);
60 static inline void cgraph_edge_remove_caller (struct cgraph_edge
*e
);
61 static inline void cgraph_edge_remove_callee (struct cgraph_edge
*e
);
63 /* Queue of cgraph nodes scheduled to be lowered. */
64 symtab_node x_cgraph_nodes_queue
;
65 #define cgraph_nodes_queue ((struct cgraph_node *)x_cgraph_nodes_queue)
67 /* Number of nodes in existence. */
70 /* Maximal uid used in cgraph nodes. */
73 /* Maximal uid used in cgraph edges. */
74 int cgraph_edge_max_uid
;
76 /* Set when whole unit has been analyzed so we can access global info. */
77 bool cgraph_global_info_ready
= false;
79 /* What state callgraph is in right now. */
80 enum cgraph_state cgraph_state
= CGRAPH_STATE_PARSING
;
82 /* Set when the cgraph is fully build and the basic flags are computed. */
83 bool cgraph_function_flags_ready
= false;
85 /* List of hooks triggered on cgraph_edge events. */
86 struct cgraph_edge_hook_list
{
87 cgraph_edge_hook hook
;
89 struct cgraph_edge_hook_list
*next
;
92 /* List of hooks triggered on cgraph_node events. */
93 struct cgraph_node_hook_list
{
94 cgraph_node_hook hook
;
96 struct cgraph_node_hook_list
*next
;
99 /* List of hooks triggered on events involving two cgraph_edges. */
100 struct cgraph_2edge_hook_list
{
101 cgraph_2edge_hook hook
;
103 struct cgraph_2edge_hook_list
*next
;
106 /* List of hooks triggered on events involving two cgraph_nodes. */
107 struct cgraph_2node_hook_list
{
108 cgraph_2node_hook hook
;
110 struct cgraph_2node_hook_list
*next
;
113 /* List of hooks triggered when an edge is removed. */
114 struct cgraph_edge_hook_list
*first_cgraph_edge_removal_hook
;
115 /* List of hooks triggered when a node is removed. */
116 struct cgraph_node_hook_list
*first_cgraph_node_removal_hook
;
117 /* List of hooks triggered when an edge is duplicated. */
118 struct cgraph_2edge_hook_list
*first_cgraph_edge_duplicated_hook
;
119 /* List of hooks triggered when a node is duplicated. */
120 struct cgraph_2node_hook_list
*first_cgraph_node_duplicated_hook
;
121 /* List of hooks triggered when an function is inserted. */
122 struct cgraph_node_hook_list
*first_cgraph_function_insertion_hook
;
124 /* Head of a linked list of unused (freed) call graph nodes.
125 Do not GTY((delete)) this list so UIDs gets reliably recycled. */
126 static GTY(()) struct cgraph_node
*free_nodes
;
127 /* Head of a linked list of unused (freed) call graph edges.
128 Do not GTY((delete)) this list so UIDs gets reliably recycled. */
129 static GTY(()) struct cgraph_edge
*free_edges
;
131 /* Did procss_same_body_aliases run? */
132 bool cpp_implicit_aliases_done
;
134 /* Map a cgraph_node to cgraph_function_version_info using this htab.
135 The cgraph_function_version_info has a THIS_NODE field that is the
136 corresponding cgraph_node.. */
138 static htab_t
GTY((param_is (struct cgraph_function_version_info
*)))
139 cgraph_fnver_htab
= NULL
;
141 /* Hash function for cgraph_fnver_htab. */
143 cgraph_fnver_htab_hash (const void *ptr
)
145 int uid
= ((const struct cgraph_function_version_info
*)ptr
)->this_node
->uid
;
146 return (hashval_t
)(uid
);
149 /* eq function for cgraph_fnver_htab. */
151 cgraph_fnver_htab_eq (const void *p1
, const void *p2
)
153 const struct cgraph_function_version_info
*n1
154 = (const struct cgraph_function_version_info
*)p1
;
155 const struct cgraph_function_version_info
*n2
156 = (const struct cgraph_function_version_info
*)p2
;
158 return n1
->this_node
->uid
== n2
->this_node
->uid
;
161 /* Mark as GC root all allocated nodes. */
162 static GTY(()) struct cgraph_function_version_info
*
163 version_info_node
= NULL
;
165 /* Get the cgraph_function_version_info node corresponding to node. */
166 struct cgraph_function_version_info
*
167 get_cgraph_node_version (struct cgraph_node
*node
)
169 struct cgraph_function_version_info
*ret
;
170 struct cgraph_function_version_info key
;
171 key
.this_node
= node
;
173 if (cgraph_fnver_htab
== NULL
)
176 ret
= (struct cgraph_function_version_info
*)
177 htab_find (cgraph_fnver_htab
, &key
);
182 /* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
183 corresponding to cgraph_node NODE. */
184 struct cgraph_function_version_info
*
185 insert_new_cgraph_node_version (struct cgraph_node
*node
)
189 version_info_node
= NULL
;
190 version_info_node
= ggc_alloc_cleared_cgraph_function_version_info ();
191 version_info_node
->this_node
= node
;
193 if (cgraph_fnver_htab
== NULL
)
194 cgraph_fnver_htab
= htab_create_ggc (2, cgraph_fnver_htab_hash
,
195 cgraph_fnver_htab_eq
, NULL
);
197 slot
= htab_find_slot (cgraph_fnver_htab
, version_info_node
, INSERT
);
198 gcc_assert (slot
!= NULL
);
199 *slot
= version_info_node
;
200 return version_info_node
;
203 /* Remove the cgraph_function_version_info and cgraph_node for DECL. This
204 DECL is a duplicate declaration. */
206 delete_function_version (tree decl
)
208 struct cgraph_node
*decl_node
= cgraph_get_node (decl
);
209 struct cgraph_function_version_info
*decl_v
= NULL
;
211 if (decl_node
== NULL
)
214 decl_v
= get_cgraph_node_version (decl_node
);
219 if (decl_v
->prev
!= NULL
)
220 decl_v
->prev
->next
= decl_v
->next
;
222 if (decl_v
->next
!= NULL
)
223 decl_v
->next
->prev
= decl_v
->prev
;
225 if (cgraph_fnver_htab
!= NULL
)
226 htab_remove_elt (cgraph_fnver_htab
, decl_v
);
228 cgraph_remove_node (decl_node
);
231 /* Record that DECL1 and DECL2 are semantically identical function
234 record_function_versions (tree decl1
, tree decl2
)
236 struct cgraph_node
*decl1_node
= cgraph_get_create_node (decl1
);
237 struct cgraph_node
*decl2_node
= cgraph_get_create_node (decl2
);
238 struct cgraph_function_version_info
*decl1_v
= NULL
;
239 struct cgraph_function_version_info
*decl2_v
= NULL
;
240 struct cgraph_function_version_info
*before
;
241 struct cgraph_function_version_info
*after
;
243 gcc_assert (decl1_node
!= NULL
&& decl2_node
!= NULL
);
244 decl1_v
= get_cgraph_node_version (decl1_node
);
245 decl2_v
= get_cgraph_node_version (decl2_node
);
247 if (decl1_v
!= NULL
&& decl2_v
!= NULL
)
251 decl1_v
= insert_new_cgraph_node_version (decl1_node
);
254 decl2_v
= insert_new_cgraph_node_version (decl2_node
);
256 /* Chain decl2_v and decl1_v. All semantically identical versions
257 will be chained together. */
262 while (before
->next
!= NULL
)
263 before
= before
->next
;
265 while (after
->prev
!= NULL
)
268 before
->next
= after
;
269 after
->prev
= before
;
272 /* Macros to access the next item in the list of free cgraph nodes and
274 #define NEXT_FREE_NODE(NODE) cgraph ((NODE)->symbol.next)
275 #define SET_NEXT_FREE_NODE(NODE,NODE2) ((NODE))->symbol.next = (symtab_node)NODE2
276 #define NEXT_FREE_EDGE(EDGE) (EDGE)->prev_caller
278 /* Register HOOK to be called with DATA on each removed edge. */
279 struct cgraph_edge_hook_list
*
280 cgraph_add_edge_removal_hook (cgraph_edge_hook hook
, void *data
)
282 struct cgraph_edge_hook_list
*entry
;
283 struct cgraph_edge_hook_list
**ptr
= &first_cgraph_edge_removal_hook
;
285 entry
= (struct cgraph_edge_hook_list
*) xmalloc (sizeof (*entry
));
295 /* Remove ENTRY from the list of hooks called on removing edges. */
297 cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list
*entry
)
299 struct cgraph_edge_hook_list
**ptr
= &first_cgraph_edge_removal_hook
;
301 while (*ptr
!= entry
)
307 /* Call all edge removal hooks. */
309 cgraph_call_edge_removal_hooks (struct cgraph_edge
*e
)
311 struct cgraph_edge_hook_list
*entry
= first_cgraph_edge_removal_hook
;
314 entry
->hook (e
, entry
->data
);
319 /* Register HOOK to be called with DATA on each removed node. */
320 struct cgraph_node_hook_list
*
321 cgraph_add_node_removal_hook (cgraph_node_hook hook
, void *data
)
323 struct cgraph_node_hook_list
*entry
;
324 struct cgraph_node_hook_list
**ptr
= &first_cgraph_node_removal_hook
;
326 entry
= (struct cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
336 /* Remove ENTRY from the list of hooks called on removing nodes. */
338 cgraph_remove_node_removal_hook (struct cgraph_node_hook_list
*entry
)
340 struct cgraph_node_hook_list
**ptr
= &first_cgraph_node_removal_hook
;
342 while (*ptr
!= entry
)
348 /* Call all node removal hooks. */
350 cgraph_call_node_removal_hooks (struct cgraph_node
*node
)
352 struct cgraph_node_hook_list
*entry
= first_cgraph_node_removal_hook
;
355 entry
->hook (node
, entry
->data
);
360 /* Register HOOK to be called with DATA on each inserted node. */
361 struct cgraph_node_hook_list
*
362 cgraph_add_function_insertion_hook (cgraph_node_hook hook
, void *data
)
364 struct cgraph_node_hook_list
*entry
;
365 struct cgraph_node_hook_list
**ptr
= &first_cgraph_function_insertion_hook
;
367 entry
= (struct cgraph_node_hook_list
*) xmalloc (sizeof (*entry
));
377 /* Remove ENTRY from the list of hooks called on inserted nodes. */
379 cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list
*entry
)
381 struct cgraph_node_hook_list
**ptr
= &first_cgraph_function_insertion_hook
;
383 while (*ptr
!= entry
)
389 /* Call all node insertion hooks. */
391 cgraph_call_function_insertion_hooks (struct cgraph_node
*node
)
393 struct cgraph_node_hook_list
*entry
= first_cgraph_function_insertion_hook
;
396 entry
->hook (node
, entry
->data
);
401 /* Register HOOK to be called with DATA on each duplicated edge. */
402 struct cgraph_2edge_hook_list
*
403 cgraph_add_edge_duplication_hook (cgraph_2edge_hook hook
, void *data
)
405 struct cgraph_2edge_hook_list
*entry
;
406 struct cgraph_2edge_hook_list
**ptr
= &first_cgraph_edge_duplicated_hook
;
408 entry
= (struct cgraph_2edge_hook_list
*) xmalloc (sizeof (*entry
));
418 /* Remove ENTRY from the list of hooks called on duplicating edges. */
420 cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list
*entry
)
422 struct cgraph_2edge_hook_list
**ptr
= &first_cgraph_edge_duplicated_hook
;
424 while (*ptr
!= entry
)
430 /* Call all edge duplication hooks. */
432 cgraph_call_edge_duplication_hooks (struct cgraph_edge
*cs1
,
433 struct cgraph_edge
*cs2
)
435 struct cgraph_2edge_hook_list
*entry
= first_cgraph_edge_duplicated_hook
;
438 entry
->hook (cs1
, cs2
, entry
->data
);
443 /* Register HOOK to be called with DATA on each duplicated node. */
444 struct cgraph_2node_hook_list
*
445 cgraph_add_node_duplication_hook (cgraph_2node_hook hook
, void *data
)
447 struct cgraph_2node_hook_list
*entry
;
448 struct cgraph_2node_hook_list
**ptr
= &first_cgraph_node_duplicated_hook
;
450 entry
= (struct cgraph_2node_hook_list
*) xmalloc (sizeof (*entry
));
460 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
462 cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list
*entry
)
464 struct cgraph_2node_hook_list
**ptr
= &first_cgraph_node_duplicated_hook
;
466 while (*ptr
!= entry
)
472 /* Call all node duplication hooks. */
474 cgraph_call_node_duplication_hooks (struct cgraph_node
*node1
,
475 struct cgraph_node
*node2
)
477 struct cgraph_2node_hook_list
*entry
= first_cgraph_node_duplicated_hook
;
480 entry
->hook (node1
, node2
, entry
->data
);
485 /* Allocate new callgraph node. */
487 static inline struct cgraph_node
*
488 cgraph_allocate_node (void)
490 struct cgraph_node
*node
;
495 free_nodes
= NEXT_FREE_NODE (node
);
499 node
= ggc_alloc_cleared_cgraph_node ();
500 node
->uid
= cgraph_max_uid
++;
506 /* Allocate new callgraph node and insert it into basic data structures. */
509 cgraph_create_empty_node (void)
511 struct cgraph_node
*node
= cgraph_allocate_node ();
513 node
->symbol
.type
= SYMTAB_FUNCTION
;
514 node
->frequency
= NODE_FREQUENCY_NORMAL
;
515 node
->count_materialization_scale
= REG_BR_PROB_BASE
;
520 /* Return cgraph node assigned to DECL. Create new one when needed. */
523 cgraph_create_node (tree decl
)
525 struct cgraph_node
*node
= cgraph_create_empty_node ();
526 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
528 node
->symbol
.decl
= decl
;
529 symtab_register_node ((symtab_node
) node
);
531 if (DECL_CONTEXT (decl
) && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
533 node
->origin
= cgraph_get_create_node (DECL_CONTEXT (decl
));
534 node
->next_nested
= node
->origin
->nested
;
535 node
->origin
->nested
= node
;
540 /* Try to find a call graph node for declaration DECL and if it does not exist,
544 cgraph_get_create_node (tree decl
)
546 struct cgraph_node
*node
;
548 node
= cgraph_get_node (decl
);
552 return cgraph_create_node (decl
);
555 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
556 the function body is associated with (not necessarily cgraph_node (DECL). */
559 cgraph_create_function_alias (tree alias
, tree target
)
561 struct cgraph_node
*alias_node
;
563 gcc_assert (TREE_CODE (target
) == FUNCTION_DECL
564 || TREE_CODE (target
) == IDENTIFIER_NODE
);
565 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
566 alias_node
= cgraph_get_create_node (alias
);
567 gcc_assert (!alias_node
->symbol
.definition
);
568 alias_node
->symbol
.alias_target
= target
;
569 alias_node
->symbol
.definition
= true;
570 alias_node
->symbol
.alias
= true;
571 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (alias
)) != NULL
)
572 alias_node
->symbol
.weakref
= true;
576 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
578 Same body aliases are output whenever the body of DECL is output,
579 and cgraph_get_node (ALIAS) transparently returns cgraph_get_node (DECL). */
582 cgraph_same_body_alias (struct cgraph_node
*decl_node ATTRIBUTE_UNUSED
, tree alias
, tree decl
)
584 struct cgraph_node
*n
;
585 #ifndef ASM_OUTPUT_DEF
586 /* If aliases aren't supported by the assembler, fail. */
589 /* Langhooks can create same body aliases of symbols not defined.
590 Those are useless. Drop them on the floor. */
591 if (cgraph_global_info_ready
)
594 n
= cgraph_create_function_alias (alias
, decl
);
595 n
->symbol
.cpp_implicit_alias
= true;
596 if (cpp_implicit_aliases_done
)
597 symtab_resolve_alias ((symtab_node
)n
,
598 (symtab_node
)cgraph_get_node (decl
));
602 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
603 aliases DECL with an adjustments made into the first parameter.
604 See comments in thunk_adjust for detail on the parameters. */
607 cgraph_add_thunk (struct cgraph_node
*decl_node ATTRIBUTE_UNUSED
,
608 tree alias
, tree decl ATTRIBUTE_UNUSED
,
610 HOST_WIDE_INT fixed_offset
, HOST_WIDE_INT virtual_value
,
614 struct cgraph_node
*node
;
616 node
= cgraph_get_node (alias
);
619 gcc_assert (node
->symbol
.definition
);
620 gcc_assert (!node
->symbol
.alias
);
621 gcc_assert (!node
->thunk
.thunk_p
);
622 cgraph_remove_node (node
);
625 node
= cgraph_create_node (alias
);
626 gcc_checking_assert (!virtual_offset
627 || tree_to_double_int (virtual_offset
) ==
628 double_int::from_shwi (virtual_value
));
629 node
->thunk
.fixed_offset
= fixed_offset
;
630 node
->thunk
.this_adjusting
= this_adjusting
;
631 node
->thunk
.virtual_value
= virtual_value
;
632 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
633 node
->thunk
.alias
= real_alias
;
634 node
->thunk
.thunk_p
= true;
635 node
->symbol
.definition
= true;
640 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
641 Return NULL if there's no such node. */
644 cgraph_node_for_asm (tree asmname
)
646 /* We do not want to look at inline clones. */
647 for (symtab_node node
= symtab_node_for_asm (asmname
);
649 node
= node
->symbol
.next_sharing_asm_name
)
651 cgraph_node
*cn
= dyn_cast
<cgraph_node
> (node
);
652 if (cn
&& !cn
->global
.inlined_to
)
658 /* Returns a hash value for X (which really is a cgraph_edge). */
661 edge_hash (const void *x
)
663 return htab_hash_pointer (((const struct cgraph_edge
*) x
)->call_stmt
);
666 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
669 edge_eq (const void *x
, const void *y
)
671 return ((const struct cgraph_edge
*) x
)->call_stmt
== y
;
674 /* Add call graph edge E to call site hash of its caller. */
677 cgraph_update_edge_in_call_site_hash (struct cgraph_edge
*e
)
680 slot
= htab_find_slot_with_hash (e
->caller
->call_site_hash
,
682 htab_hash_pointer (e
->call_stmt
),
687 /* Add call graph edge E to call site hash of its caller. */
690 cgraph_add_edge_to_call_site_hash (struct 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 slot
= htab_find_slot_with_hash (e
->caller
->call_site_hash
,
699 htab_hash_pointer (e
->call_stmt
),
703 gcc_assert (((struct cgraph_edge
*)*slot
)->speculative
);
706 gcc_assert (!*slot
|| e
->speculative
);
710 /* Return the callgraph edge representing the GIMPLE_CALL statement
714 cgraph_edge (struct cgraph_node
*node
, gimple call_stmt
)
716 struct cgraph_edge
*e
, *e2
;
719 if (node
->call_site_hash
)
720 return (struct cgraph_edge
*)
721 htab_find_with_hash (node
->call_site_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
= node
->callees
; e
; e
= e
->next_callee
)
731 if (e
->call_stmt
== call_stmt
)
737 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
739 if (e
->call_stmt
== call_stmt
)
746 node
->call_site_hash
= htab_create_ggc (120, edge_hash
, edge_eq
, NULL
);
747 for (e2
= node
->callees
; e2
; e2
= e2
->next_callee
)
748 cgraph_add_edge_to_call_site_hash (e2
);
749 for (e2
= node
->indirect_calls
; e2
; e2
= e2
->next_callee
)
750 cgraph_add_edge_to_call_site_hash (e2
);
757 /* Change field call_stmt of edge E to NEW_STMT.
758 If UPDATE_SPECULATIVE and E is any component of speculative
759 edge, then update all components. */
762 cgraph_set_call_stmt (struct cgraph_edge
*e
, gimple new_stmt
,
763 bool update_speculative
)
767 /* Speculative edges has three component, update all of them
769 if (update_speculative
&& e
->speculative
)
771 struct cgraph_edge
*direct
, *indirect
;
774 cgraph_speculative_call_info (e
, direct
, indirect
, ref
);
775 cgraph_set_call_stmt (direct
, new_stmt
, false);
776 cgraph_set_call_stmt (indirect
, new_stmt
, false);
777 ref
->stmt
= new_stmt
;
781 /* Only direct speculative edges go to call_site_hash. */
782 if (e
->caller
->call_site_hash
783 && (!e
->speculative
|| !e
->indirect_unknown_callee
))
785 htab_remove_elt_with_hash (e
->caller
->call_site_hash
,
787 htab_hash_pointer (e
->call_stmt
));
790 e
->call_stmt
= new_stmt
;
791 if (e
->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 struct cgraph_node
*new_callee
= cgraph_get_node (decl
);
798 gcc_checking_assert (new_callee
);
799 e
= cgraph_make_edge_direct (e
, new_callee
);
802 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->symbol
.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
813 static struct cgraph_edge
*
814 cgraph_create_edge_1 (struct cgraph_node
*caller
, struct cgraph_node
*callee
,
815 gimple call_stmt
, gcov_type count
, int freq
)
817 struct cgraph_edge
*edge
;
819 /* LTO does not actually have access to the call_stmt since these
820 have not been loaded yet. */
823 /* This is a rather expensive check possibly triggering
824 construction of call stmt hashtable. */
825 #ifdef ENABLE_CHECKING
826 struct cgraph_edge
*e
;
827 gcc_checking_assert (!(e
=cgraph_edge (caller
, call_stmt
)) || e
->speculative
);
830 gcc_assert (is_gimple_call (call_stmt
));
836 free_edges
= NEXT_FREE_EDGE (edge
);
840 edge
= ggc_alloc_cgraph_edge ();
841 edge
->uid
= cgraph_edge_max_uid
++;
845 edge
->caller
= caller
;
846 edge
->callee
= callee
;
847 edge
->prev_caller
= NULL
;
848 edge
->next_caller
= NULL
;
849 edge
->prev_callee
= NULL
;
850 edge
->next_callee
= NULL
;
851 edge
->lto_stmt_uid
= 0;
854 gcc_assert (count
>= 0);
855 edge
->frequency
= freq
;
856 gcc_assert (freq
>= 0);
857 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
859 edge
->call_stmt
= call_stmt
;
860 push_cfun (DECL_STRUCT_FUNCTION (caller
->symbol
.decl
));
861 edge
->can_throw_external
862 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
865 && callee
&& callee
->symbol
.decl
866 && !gimple_check_call_matching_types (call_stmt
, callee
->symbol
.decl
,
868 edge
->call_stmt_cannot_inline_p
= true;
870 edge
->call_stmt_cannot_inline_p
= false;
871 if (call_stmt
&& caller
->call_site_hash
)
872 cgraph_add_edge_to_call_site_hash (edge
);
874 edge
->indirect_info
= NULL
;
875 edge
->indirect_inlining_edge
= 0;
876 edge
->speculative
= false;
881 /* Create edge from CALLER to CALLEE in the cgraph. */
884 cgraph_create_edge (struct cgraph_node
*caller
, struct cgraph_node
*callee
,
885 gimple call_stmt
, gcov_type count
, int freq
)
887 struct cgraph_edge
*edge
= cgraph_create_edge_1 (caller
, callee
, call_stmt
,
890 edge
->indirect_unknown_callee
= 0;
891 initialize_inline_failed (edge
);
893 edge
->next_caller
= callee
->callers
;
895 callee
->callers
->prev_caller
= edge
;
896 edge
->next_callee
= caller
->callees
;
898 caller
->callees
->prev_callee
= edge
;
899 caller
->callees
= edge
;
900 callee
->callers
= edge
;
905 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
907 struct cgraph_indirect_call_info
*
908 cgraph_allocate_init_indirect_info (void)
910 struct cgraph_indirect_call_info
*ii
;
912 ii
= ggc_alloc_cleared_cgraph_indirect_call_info ();
913 ii
->param_index
= -1;
917 /* Create an indirect edge with a yet-undetermined callee where the call
918 statement destination is a formal parameter of the caller with index
922 cgraph_create_indirect_edge (struct cgraph_node
*caller
, gimple call_stmt
,
924 gcov_type count
, int freq
)
926 struct cgraph_edge
*edge
= cgraph_create_edge_1 (caller
, NULL
, call_stmt
,
929 edge
->indirect_unknown_callee
= 1;
930 initialize_inline_failed (edge
);
932 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
933 edge
->indirect_info
->ecf_flags
= ecf_flags
;
935 edge
->next_callee
= caller
->indirect_calls
;
936 if (caller
->indirect_calls
)
937 caller
->indirect_calls
->prev_callee
= edge
;
938 caller
->indirect_calls
= edge
;
943 /* Remove the edge E from the list of the callers of the callee. */
946 cgraph_edge_remove_callee (struct cgraph_edge
*e
)
948 gcc_assert (!e
->indirect_unknown_callee
);
950 e
->prev_caller
->next_caller
= e
->next_caller
;
952 e
->next_caller
->prev_caller
= e
->prev_caller
;
954 e
->callee
->callers
= e
->next_caller
;
957 /* Remove the edge E from the list of the callees of the caller. */
960 cgraph_edge_remove_caller (struct cgraph_edge
*e
)
963 e
->prev_callee
->next_callee
= e
->next_callee
;
965 e
->next_callee
->prev_callee
= e
->prev_callee
;
968 if (e
->indirect_unknown_callee
)
969 e
->caller
->indirect_calls
= e
->next_callee
;
971 e
->caller
->callees
= e
->next_callee
;
973 if (e
->caller
->call_site_hash
)
974 htab_remove_elt_with_hash (e
->caller
->call_site_hash
,
976 htab_hash_pointer (e
->call_stmt
));
979 /* Put the edge onto the free list. */
982 cgraph_free_edge (struct cgraph_edge
*e
)
986 if (e
->indirect_info
)
987 ggc_free (e
->indirect_info
);
989 /* Clear out the edge so we do not dangle pointers. */
990 memset (e
, 0, sizeof (*e
));
992 NEXT_FREE_EDGE (e
) = free_edges
;
996 /* Remove the edge E in the cgraph. */
999 cgraph_remove_edge (struct cgraph_edge
*e
)
1001 /* Call all edge removal hooks. */
1002 cgraph_call_edge_removal_hooks (e
);
1004 if (!e
->indirect_unknown_callee
)
1005 /* Remove from callers list of the callee. */
1006 cgraph_edge_remove_callee (e
);
1008 /* Remove from callees list of the callers. */
1009 cgraph_edge_remove_caller (e
);
1011 /* Put the edge onto the free list. */
1012 cgraph_free_edge (e
);
1015 /* Set callee of call graph edge E and add it to the corresponding set of
1019 cgraph_set_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
1021 e
->prev_caller
= NULL
;
1023 n
->callers
->prev_caller
= e
;
1024 e
->next_caller
= n
->callers
;
1029 /* Turn edge E into speculative call calling N2. Update
1030 the profile so the direct call is taken COUNT times
1033 At clone materialization time, the indirect call E will
1036 if (call_dest == N2)
1041 At this time the function just creates the direct call,
1042 the referencd representing the if conditional and attaches
1043 them all to the orginal indirect call statement. */
1046 cgraph_turn_edge_to_speculative (struct cgraph_edge
*e
,
1047 struct cgraph_node
*n2
,
1048 gcov_type direct_count
,
1049 int direct_frequency
)
1051 struct cgraph_node
*n
= e
->caller
;
1052 struct ipa_ref
*ref
;
1053 struct cgraph_edge
*e2
;
1057 fprintf (dump_file
, "Indirect call -> direct call from"
1058 " other module %s/%i => %s/%i\n",
1059 xstrdup (cgraph_node_name (n
)), n
->symbol
.order
,
1060 xstrdup (cgraph_node_name (n2
)), n2
->symbol
.order
);
1062 e
->speculative
= true;
1063 e2
= cgraph_create_edge (n
, n2
, e
->call_stmt
, direct_count
, direct_frequency
);
1064 initialize_inline_failed (e2
);
1065 e2
->speculative
= true;
1066 e2
->call_stmt
= e
->call_stmt
;
1067 e2
->can_throw_external
= e
->can_throw_external
;
1068 e2
->lto_stmt_uid
= e
->lto_stmt_uid
;
1069 e
->count
-= e2
->count
;
1070 e
->frequency
-= e2
->frequency
;
1071 cgraph_call_edge_duplication_hooks (e
, e2
);
1072 ref
= ipa_record_reference ((symtab_node
)n
, (symtab_node
)n2
,
1073 IPA_REF_ADDR
, e
->call_stmt
);
1074 ref
->lto_stmt_uid
= e
->lto_stmt_uid
;
1075 ref
->speculative
= e
->speculative
;
1078 /* Speculative call consist of three components:
1079 1) an indirect edge representing the original call
1080 2) an direct edge representing the new call
1081 3) ADDR_EXPR reference representing the speculative check.
1082 All three components are attached to single statement (the indirect
1083 call) and if one of them exists, all of them must exist.
1085 Given speculative call edge E, return all three components.
1089 cgraph_speculative_call_info (struct cgraph_edge
*e
,
1090 struct cgraph_edge
*&indirect
,
1091 struct cgraph_edge
*&direct
,
1092 struct ipa_ref
*&reference
)
1094 struct ipa_ref
*ref
;
1096 struct cgraph_edge
*e2
;
1098 if (!e
->indirect_unknown_callee
)
1099 for (e2
= e
->caller
->indirect_calls
;
1100 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1101 e2
= e2
->next_callee
)
1106 /* We can take advantage of the call stmt hash. */
1109 e
= cgraph_edge (e
->caller
, e2
->call_stmt
);
1110 gcc_assert (!e
->speculative
&& !e
->indirect_unknown_callee
);
1113 for (e
= e
->caller
->callees
;
1114 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1118 gcc_assert (e
->speculative
&& e2
->speculative
);
1123 for (i
= 0; ipa_ref_list_reference_iterate (&e
->caller
->symbol
.ref_list
, i
, ref
); i
++)
1124 if (ref
->speculative
1125 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1126 || (ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1133 /* Redirect callee of E to N. The function does not update underlying
1137 cgraph_redirect_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
1139 /* Remove from callers list of the current callee. */
1140 cgraph_edge_remove_callee (e
);
1142 /* Insert to callers list of the new callee. */
1143 cgraph_set_edge_callee (e
, n
);
1146 /* Speculative call EDGE turned out to be direct call to CALLE_DECL.
1147 Remove the speculative call sequence and return edge representing the call.
1148 It is up to caller to redirect the call as appropriate. */
1150 static struct cgraph_edge
*
1151 cgraph_resolve_speculation (struct cgraph_edge
*edge
, tree callee_decl
)
1153 struct cgraph_edge
*e2
;
1154 struct ipa_ref
*ref
;
1156 gcc_assert (edge
->speculative
);
1157 cgraph_speculative_call_info (edge
, e2
, edge
, ref
);
1158 if (ref
->referred
->symbol
.decl
!= callee_decl
)
1162 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1163 "turned out to have contradicitng known target ",
1164 xstrdup (cgraph_node_name (edge
->caller
)), edge
->caller
->symbol
.order
,
1165 xstrdup (cgraph_node_name (e2
->callee
)), e2
->callee
->symbol
.order
);
1166 print_generic_expr (dump_file
, callee_decl
, 0);
1167 fprintf (dump_file
, "\n");
1172 struct cgraph_edge
*tmp
= edge
;
1174 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1178 edge
->count
+= e2
->count
;
1179 edge
->frequency
+= e2
->frequency
;
1180 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1181 edge
->frequency
= CGRAPH_FREQ_MAX
;
1182 edge
->speculative
= false;
1183 e2
->speculative
= false;
1184 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1185 cgraph_remove_edge (e2
);
1187 cgraph_remove_node_and_inline_clones (e2
->callee
, NULL
);
1188 if (edge
->caller
->call_site_hash
)
1189 cgraph_update_edge_in_call_site_hash (edge
);
1190 ipa_remove_reference (ref
);
1194 /* Make an indirect EDGE with an unknown callee an ordinary edge leading to
1195 CALLEE. DELTA is an integer constant that is to be added to the this
1196 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1198 struct cgraph_edge
*
1199 cgraph_make_edge_direct (struct cgraph_edge
*edge
, struct cgraph_node
*callee
)
1201 gcc_assert (edge
->indirect_unknown_callee
);
1203 /* If we are redirecting speculative call, make it non-speculative. */
1204 if (edge
->indirect_unknown_callee
&& edge
->speculative
)
1206 edge
= cgraph_resolve_speculation (edge
, callee
->symbol
.decl
);
1208 /* On successful speculation just return the pre existing direct edge. */
1209 if (!edge
->indirect_unknown_callee
)
1213 edge
->indirect_unknown_callee
= 0;
1214 ggc_free (edge
->indirect_info
);
1215 edge
->indirect_info
= NULL
;
1217 /* Get the edge out of the indirect edge list. */
1218 if (edge
->prev_callee
)
1219 edge
->prev_callee
->next_callee
= edge
->next_callee
;
1220 if (edge
->next_callee
)
1221 edge
->next_callee
->prev_callee
= edge
->prev_callee
;
1222 if (!edge
->prev_callee
)
1223 edge
->caller
->indirect_calls
= edge
->next_callee
;
1225 /* Put it into the normal callee list */
1226 edge
->prev_callee
= NULL
;
1227 edge
->next_callee
= edge
->caller
->callees
;
1228 if (edge
->caller
->callees
)
1229 edge
->caller
->callees
->prev_callee
= edge
;
1230 edge
->caller
->callees
= edge
;
1232 /* Insert to callers list of the new callee. */
1233 cgraph_set_edge_callee (edge
, callee
);
1235 if (edge
->call_stmt
)
1236 edge
->call_stmt_cannot_inline_p
1237 = !gimple_check_call_matching_types (edge
->call_stmt
, callee
->symbol
.decl
,
1240 /* We need to re-determine the inlining status of the edge. */
1241 initialize_inline_failed (edge
);
1245 /* If necessary, change the function declaration in the call statement
1246 associated with E so that it corresponds to the edge callee. */
1249 cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge
*e
)
1251 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1253 gimple_stmt_iterator gsi
;
1254 #ifdef ENABLE_CHECKING
1255 struct cgraph_node
*node
;
1260 struct cgraph_edge
*e2
;
1262 struct ipa_ref
*ref
;
1264 cgraph_speculative_call_info (e
, e
, e2
, ref
);
1265 if (gimple_call_fndecl (e
->call_stmt
))
1266 e
= cgraph_resolve_speculation (e
, gimple_call_fndecl (e
->call_stmt
));
1270 fprintf (dump_file
, "Expanding speculative call of %s/%i -> %s/%i\n",
1271 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1272 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
);
1273 gcc_assert (e2
->speculative
);
1274 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->symbol
.decl
));
1275 new_stmt
= gimple_ic (e
->call_stmt
, cgraph (ref
->referred
),
1276 e
->count
|| e2
->count
1277 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1278 e
->count
+ e2
->count
)
1279 : e
->frequency
|| e2
->frequency
1280 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1281 e
->frequency
+ e2
->frequency
)
1282 : REG_BR_PROB_BASE
/ 2,
1283 e
->count
, e
->count
+ e2
->count
);
1284 e
->speculative
= false;
1285 cgraph_set_call_stmt_including_clones (e
->caller
, e
->call_stmt
, new_stmt
, false);
1286 e
->frequency
= compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
1287 gimple_bb (e
->call_stmt
));
1288 e2
->frequency
= compute_call_stmt_bb_frequency (e2
->caller
->symbol
.decl
,
1289 gimple_bb (e2
->call_stmt
));
1290 e2
->speculative
= false;
1291 ref
->speculative
= false;
1293 /* Indirect edges are not both in the call site hash.
1295 if (e
->caller
->call_site_hash
)
1296 cgraph_update_edge_in_call_site_hash (e2
);
1298 /* Continue redirecting E to proper target. */
1302 if (e
->indirect_unknown_callee
1303 || decl
== e
->callee
->symbol
.decl
)
1304 return e
->call_stmt
;
1306 #ifdef ENABLE_CHECKING
1309 node
= cgraph_get_node (decl
);
1310 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1314 if (cgraph_dump_file
)
1316 fprintf (cgraph_dump_file
, "updating call of %s/%i -> %s/%i: ",
1317 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1318 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
);
1319 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1320 if (e
->callee
->clone
.combined_args_to_skip
)
1322 fprintf (cgraph_dump_file
, " combined args to skip: ");
1323 dump_bitmap (cgraph_dump_file
,
1324 e
->callee
->clone
.combined_args_to_skip
);
1328 if (e
->callee
->clone
.combined_args_to_skip
)
1333 = gimple_call_copy_skip_args (e
->call_stmt
,
1334 e
->callee
->clone
.combined_args_to_skip
);
1335 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1336 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1338 if (gimple_vdef (new_stmt
)
1339 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1340 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1342 gsi
= gsi_for_stmt (e
->call_stmt
);
1343 gsi_replace (&gsi
, new_stmt
, false);
1344 /* We need to defer cleaning EH info on the new statement to
1345 fixup-cfg. We may not have dominator information at this point
1346 and thus would end up with unreachable blocks and have no way
1347 to communicate that we need to run CFG cleanup then. */
1348 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1351 remove_stmt_from_eh_lp (e
->call_stmt
);
1352 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1357 new_stmt
= e
->call_stmt
;
1358 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1359 update_stmt (new_stmt
);
1362 cgraph_set_call_stmt_including_clones (e
->caller
, e
->call_stmt
, new_stmt
, false);
1364 if (cgraph_dump_file
)
1366 fprintf (cgraph_dump_file
, " updated to:");
1367 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1372 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1373 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1374 of OLD_STMT if it was previously call statement.
1375 If NEW_STMT is NULL, the call has been dropped without any
1379 cgraph_update_edges_for_call_stmt_node (struct cgraph_node
*node
,
1380 gimple old_stmt
, tree old_call
,
1383 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1384 ? gimple_call_fndecl (new_stmt
) : 0;
1386 /* We are seeing indirect calls, then there is nothing to update. */
1387 if (!new_call
&& !old_call
)
1389 /* See if we turned indirect call into direct call or folded call to one builtin
1390 into different builtin. */
1391 if (old_call
!= new_call
)
1393 struct cgraph_edge
*e
= cgraph_edge (node
, old_stmt
);
1394 struct cgraph_edge
*ne
= NULL
;
1400 /* See if the edge is already there and has the correct callee. It
1401 might be so because of indirect inlining has already updated
1402 it. We also might've cloned and redirected the edge. */
1403 if (new_call
&& e
->callee
)
1405 struct cgraph_node
*callee
= e
->callee
;
1408 if (callee
->symbol
.decl
== new_call
1409 || callee
->former_clone_of
== new_call
)
1411 callee
= callee
->clone_of
;
1415 /* Otherwise remove edge and create new one; we can't simply redirect
1416 since function has changed, so inline plan and other information
1417 attached to edge is invalid. */
1419 frequency
= e
->frequency
;
1420 cgraph_remove_edge (e
);
1424 /* We are seeing new direct call; compute profile info based on BB. */
1425 basic_block bb
= gimple_bb (new_stmt
);
1427 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1433 ne
= cgraph_create_edge (node
, cgraph_get_create_node (new_call
),
1434 new_stmt
, count
, frequency
);
1435 gcc_assert (ne
->inline_failed
);
1438 /* We only updated the call stmt; update pointer in cgraph edge.. */
1439 else if (old_stmt
!= new_stmt
)
1440 cgraph_set_call_stmt (cgraph_edge (node
, old_stmt
), new_stmt
);
1443 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1444 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1445 of OLD_STMT before it was updated (updating can happen inplace). */
1448 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1450 struct cgraph_node
*orig
= cgraph_get_node (cfun
->decl
);
1451 struct cgraph_node
*node
;
1453 gcc_checking_assert (orig
);
1454 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1456 for (node
= orig
->clones
; node
!= orig
;)
1458 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1460 node
= node
->clones
;
1461 else if (node
->next_sibling_clone
)
1462 node
= node
->next_sibling_clone
;
1465 while (node
!= orig
&& !node
->next_sibling_clone
)
1466 node
= node
->clone_of
;
1468 node
= node
->next_sibling_clone
;
1474 /* Remove all callees from the node. */
1477 cgraph_node_remove_callees (struct cgraph_node
*node
)
1479 struct cgraph_edge
*e
, *f
;
1481 /* It is sufficient to remove the edges from the lists of callers of
1482 the callees. The callee list of the node can be zapped with one
1484 for (e
= node
->callees
; e
; e
= f
)
1487 cgraph_call_edge_removal_hooks (e
);
1488 if (!e
->indirect_unknown_callee
)
1489 cgraph_edge_remove_callee (e
);
1490 cgraph_free_edge (e
);
1492 for (e
= node
->indirect_calls
; e
; e
= f
)
1495 cgraph_call_edge_removal_hooks (e
);
1496 if (!e
->indirect_unknown_callee
)
1497 cgraph_edge_remove_callee (e
);
1498 cgraph_free_edge (e
);
1500 node
->indirect_calls
= NULL
;
1501 node
->callees
= NULL
;
1502 if (node
->call_site_hash
)
1504 htab_delete (node
->call_site_hash
);
1505 node
->call_site_hash
= NULL
;
1509 /* Remove all callers from the node. */
1512 cgraph_node_remove_callers (struct cgraph_node
*node
)
1514 struct cgraph_edge
*e
, *f
;
1516 /* It is sufficient to remove the edges from the lists of callees of
1517 the callers. The caller list of the node can be zapped with one
1519 for (e
= node
->callers
; e
; e
= f
)
1522 cgraph_call_edge_removal_hooks (e
);
1523 cgraph_edge_remove_caller (e
);
1524 cgraph_free_edge (e
);
1526 node
->callers
= NULL
;
1529 /* Helper function for cgraph_release_function_body and free_lang_data.
1530 It releases body from function DECL without having to inspect its
1531 possibly non-existent symtab node. */
1534 release_function_body (tree decl
)
1536 if (DECL_STRUCT_FUNCTION (decl
))
1538 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1542 cfun
->curr_properties
&= ~PROP_loops
;
1543 loop_optimizer_finalize ();
1545 if (cfun
->gimple_df
)
1548 delete_tree_cfg_annotations ();
1553 gcc_assert (dom_computed
[0] == DOM_NONE
);
1554 gcc_assert (dom_computed
[1] == DOM_NONE
);
1558 if (cfun
->value_histograms
)
1561 gimple_set_body (decl
, NULL
);
1562 /* Struct function hangs a lot of data that would leak if we didn't
1563 removed all pointers to it. */
1564 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1565 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1567 DECL_SAVED_TREE (decl
) = NULL
;
1570 /* Release memory used to represent body of function NODE.
1571 Use this only for functions that are released before being translated to
1572 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1573 are free'd in final.c via free_after_compilation(). */
1576 cgraph_release_function_body (struct cgraph_node
*node
)
1578 node
->ipa_transforms_to_apply
.release ();
1579 if (!node
->used_as_abstract_origin
&& cgraph_state
!= CGRAPH_STATE_PARSING
)
1581 DECL_RESULT (node
->symbol
.decl
) = NULL
;
1582 DECL_ARGUMENTS (node
->symbol
.decl
) = NULL
;
1584 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1585 of its associated function function declaration because it's
1586 needed to emit debug info later. */
1587 if (!node
->used_as_abstract_origin
&& DECL_INITIAL (node
->symbol
.decl
))
1588 DECL_INITIAL (node
->symbol
.decl
) = error_mark_node
;
1589 release_function_body (node
->symbol
.decl
);
1592 /* Remove the node from cgraph. */
1595 cgraph_remove_node (struct cgraph_node
*node
)
1597 struct cgraph_node
*n
;
1598 int uid
= node
->uid
;
1600 cgraph_call_node_removal_hooks (node
);
1601 cgraph_node_remove_callers (node
);
1602 cgraph_node_remove_callees (node
);
1603 node
->ipa_transforms_to_apply
.release ();
1605 /* Incremental inlining access removed nodes stored in the postorder list.
1607 node
->symbol
.force_output
= false;
1608 node
->symbol
.forced_by_abi
= false;
1609 for (n
= node
->nested
; n
; n
= n
->next_nested
)
1611 node
->nested
= NULL
;
1614 struct cgraph_node
**node2
= &node
->origin
->nested
;
1616 while (*node2
!= node
)
1617 node2
= &(*node2
)->next_nested
;
1618 *node2
= node
->next_nested
;
1620 symtab_unregister_node ((symtab_node
)node
);
1621 if (node
->prev_sibling_clone
)
1622 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
1623 else if (node
->clone_of
)
1624 node
->clone_of
->clones
= node
->next_sibling_clone
;
1625 if (node
->next_sibling_clone
)
1626 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
1629 struct cgraph_node
*n
, *next
;
1633 for (n
= node
->clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1634 n
->clone_of
= node
->clone_of
;
1635 n
->clone_of
= node
->clone_of
;
1636 n
->next_sibling_clone
= node
->clone_of
->clones
;
1637 if (node
->clone_of
->clones
)
1638 node
->clone_of
->clones
->prev_sibling_clone
= n
;
1639 node
->clone_of
->clones
= node
->clones
;
1643 /* We are removing node with clones. This makes clones inconsistent,
1644 but assume they will be removed subsequently and just keep clone
1645 tree intact. This can happen in unreachable function removal since
1646 we remove unreachable functions in random order, not by bottom-up
1647 walk of clone trees. */
1648 for (n
= node
->clones
; n
; n
= next
)
1650 next
= n
->next_sibling_clone
;
1651 n
->next_sibling_clone
= NULL
;
1652 n
->prev_sibling_clone
= NULL
;
1658 /* While all the clones are removed after being proceeded, the function
1659 itself is kept in the cgraph even after it is compiled. Check whether
1660 we are done with this body and reclaim it proactively if this is the case.
1662 if (cgraph_state
!= CGRAPH_LTO_STREAMING
)
1664 n
= cgraph_get_node (node
->symbol
.decl
);
1666 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1667 && (cgraph_global_info_ready
1668 && (TREE_ASM_WRITTEN (n
->symbol
.decl
)
1669 || DECL_EXTERNAL (n
->symbol
.decl
)
1670 || !n
->symbol
.analyzed
1671 || (!flag_wpa
&& n
->symbol
.in_other_partition
)))))
1672 cgraph_release_function_body (node
);
1675 node
->symbol
.decl
= NULL
;
1676 if (node
->call_site_hash
)
1678 htab_delete (node
->call_site_hash
);
1679 node
->call_site_hash
= NULL
;
1683 /* Clear out the node to NULL all pointers and add the node to the free
1685 memset (node
, 0, sizeof(*node
));
1686 node
->symbol
.type
= SYMTAB_FUNCTION
;
1688 SET_NEXT_FREE_NODE (node
, free_nodes
);
1692 /* Likewise indicate that a node is having address taken. */
1695 cgraph_mark_address_taken_node (struct cgraph_node
*node
)
1697 /* Indirect inlining can figure out that all uses of the address are
1699 if (node
->global
.inlined_to
)
1701 gcc_assert (cfun
->after_inlining
);
1702 gcc_assert (node
->callers
->indirect_inlining_edge
);
1705 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1706 IPA_REF_ADDR reference exists (and thus it should be set on node
1707 representing alias we take address of) and as a test whether address
1708 of the object was taken (and thus it should be set on node alias is
1709 referring to). We should remove the first use and the remove the
1711 node
->symbol
.address_taken
= 1;
1712 node
= cgraph_function_or_thunk_node (node
, NULL
);
1713 node
->symbol
.address_taken
= 1;
1716 /* Return local info for the compiled function. */
1718 struct cgraph_local_info
*
1719 cgraph_local_info (tree decl
)
1721 struct cgraph_node
*node
;
1723 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1724 node
= cgraph_get_node (decl
);
1727 return &node
->local
;
1730 /* Return local info for the compiled function. */
1732 struct cgraph_global_info
*
1733 cgraph_global_info (tree decl
)
1735 struct cgraph_node
*node
;
1737 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
&& cgraph_global_info_ready
);
1738 node
= cgraph_get_node (decl
);
1741 return &node
->global
;
1744 /* Return local info for the compiled function. */
1746 struct cgraph_rtl_info
*
1747 cgraph_rtl_info (tree decl
)
1749 struct cgraph_node
*node
;
1751 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1752 node
= cgraph_get_node (decl
);
1754 || (decl
!= current_function_decl
1755 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)))
1760 /* Return a string describing the failure REASON. */
1763 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1766 #define DEFCIFCODE(code, string) string,
1768 static const char *cif_string_table
[CIF_N_REASONS
] = {
1769 #include "cif-code.def"
1772 /* Signedness of an enum type is implementation defined, so cast it
1773 to unsigned before testing. */
1774 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1775 return cif_string_table
[reason
];
1778 /* Names used to print out the availability enum. */
1779 const char * const cgraph_availability_names
[] =
1780 {"unset", "not_available", "overwritable", "available", "local"};
1783 /* Dump call graph node NODE to file F. */
1786 dump_cgraph_node (FILE *f
, struct cgraph_node
*node
)
1788 struct cgraph_edge
*edge
;
1789 int indirect_calls_count
= 0;
1791 dump_symtab_base (f
, (symtab_node
) node
);
1793 if (node
->global
.inlined_to
)
1794 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1795 xstrdup (cgraph_node_name (node
)),
1797 xstrdup (cgraph_node_name (node
->global
.inlined_to
)),
1798 node
->global
.inlined_to
->symbol
.order
);
1800 fprintf (f
, " Clone of %s/%i\n",
1801 cgraph_node_asm_name (node
->clone_of
),
1802 node
->clone_of
->symbol
.order
);
1803 if (cgraph_function_flags_ready
)
1804 fprintf (f
, " Availability: %s\n",
1805 cgraph_availability_names
[cgraph_function_body_availability (node
)]);
1807 if (node
->profile_id
)
1808 fprintf (f
, " Profile id: %i\n",
1810 fprintf (f
, " Function flags:");
1812 fprintf (f
, " executed "HOST_WIDEST_INT_PRINT_DEC
"x",
1813 (HOST_WIDEST_INT
)node
->count
);
1815 fprintf (f
, " nested in: %s", cgraph_node_asm_name (node
->origin
));
1816 if (gimple_has_body_p (node
->symbol
.decl
))
1817 fprintf (f
, " body");
1819 fprintf (f
, " process");
1820 if (node
->local
.local
)
1821 fprintf (f
, " local");
1822 if (node
->local
.redefined_extern_inline
)
1823 fprintf (f
, " redefined_extern_inline");
1824 if (node
->only_called_at_startup
)
1825 fprintf (f
, " only_called_at_startup");
1826 if (node
->only_called_at_exit
)
1827 fprintf (f
, " only_called_at_exit");
1829 fprintf (f
, " tm_clone");
1833 if (node
->thunk
.thunk_p
)
1835 fprintf (f
, " Thunk");
1836 if (node
->thunk
.alias
)
1837 fprintf (f
, " of %s (asm: %s)",
1838 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2),
1839 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)));
1840 fprintf (f
, " fixed offset %i virtual value %i has "
1841 "virtual offset %i)\n",
1842 (int)node
->thunk
.fixed_offset
,
1843 (int)node
->thunk
.virtual_value
,
1844 (int)node
->thunk
.virtual_offset_p
);
1846 if (node
->symbol
.alias
&& node
->thunk
.alias
1847 && DECL_P (node
->thunk
.alias
))
1849 fprintf (f
, " Alias of %s",
1850 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2));
1851 if (DECL_ASSEMBLER_NAME_SET_P (node
->thunk
.alias
))
1852 fprintf (f
, " (asm: %s)",
1853 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)));
1857 fprintf (f
, " Called by: ");
1859 for (edge
= node
->callers
; edge
; edge
= edge
->next_caller
)
1861 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->caller
),
1862 edge
->caller
->symbol
.order
);
1864 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1865 (HOST_WIDEST_INT
)edge
->count
);
1866 if (edge
->frequency
)
1867 fprintf (f
, "(%.2f per call) ",
1868 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1869 if (edge
->speculative
)
1870 fprintf(f
, "(speculative) ");
1871 if (!edge
->inline_failed
)
1872 fprintf(f
, "(inlined) ");
1873 if (edge
->indirect_inlining_edge
)
1874 fprintf(f
, "(indirect_inlining) ");
1875 if (edge
->can_throw_external
)
1876 fprintf(f
, "(can throw external) ");
1879 fprintf (f
, "\n Calls: ");
1880 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
1882 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->callee
),
1883 edge
->callee
->symbol
.order
);
1884 if (edge
->speculative
)
1885 fprintf(f
, "(speculative) ");
1886 if (!edge
->inline_failed
)
1887 fprintf(f
, "(inlined) ");
1888 if (edge
->indirect_inlining_edge
)
1889 fprintf(f
, "(indirect_inlining) ");
1891 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1892 (HOST_WIDEST_INT
)edge
->count
);
1893 if (edge
->frequency
)
1894 fprintf (f
, "(%.2f per call) ",
1895 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1896 if (edge
->can_throw_external
)
1897 fprintf(f
, "(can throw external) ");
1901 for (edge
= node
->indirect_calls
; edge
; edge
= edge
->next_callee
)
1902 indirect_calls_count
++;
1903 if (indirect_calls_count
)
1904 fprintf (f
, " Has %i outgoing edges for indirect calls.\n",
1905 indirect_calls_count
);
1909 /* Dump call graph node NODE to stderr. */
1912 debug_cgraph_node (struct cgraph_node
*node
)
1914 dump_cgraph_node (stderr
, node
);
1918 /* Dump the callgraph to file F. */
1921 dump_cgraph (FILE *f
)
1923 struct cgraph_node
*node
;
1925 fprintf (f
, "callgraph:\n\n");
1926 FOR_EACH_FUNCTION (node
)
1927 dump_cgraph_node (f
, node
);
1931 /* Dump the call graph to stderr. */
1936 dump_cgraph (stderr
);
1939 /* Return true when the DECL can possibly be inlined. */
1941 cgraph_function_possibly_inlined_p (tree decl
)
1943 if (!cgraph_global_info_ready
)
1944 return !DECL_UNINLINABLE (decl
);
1945 return DECL_POSSIBLY_INLINED (decl
);
1948 /* NODE is no longer nested function; update cgraph accordingly. */
1950 cgraph_unnest_node (struct cgraph_node
*node
)
1952 struct cgraph_node
**node2
= &node
->origin
->nested
;
1953 gcc_assert (node
->origin
);
1955 while (*node2
!= node
)
1956 node2
= &(*node2
)->next_nested
;
1957 *node2
= node
->next_nested
;
1958 node
->origin
= NULL
;
1961 /* Return function availability. See cgraph.h for description of individual
1964 cgraph_function_body_availability (struct cgraph_node
*node
)
1966 enum availability avail
;
1967 if (!node
->symbol
.analyzed
)
1968 avail
= AVAIL_NOT_AVAILABLE
;
1969 else if (node
->local
.local
)
1970 avail
= AVAIL_LOCAL
;
1971 else if (!node
->symbol
.externally_visible
)
1972 avail
= AVAIL_AVAILABLE
;
1973 /* Inline functions are safe to be analyzed even if their symbol can
1974 be overwritten at runtime. It is not meaningful to enforce any sane
1975 behaviour on replacing inline function by different body. */
1976 else if (DECL_DECLARED_INLINE_P (node
->symbol
.decl
))
1977 avail
= AVAIL_AVAILABLE
;
1979 /* If the function can be overwritten, return OVERWRITABLE. Take
1980 care at least of two notable extensions - the COMDAT functions
1981 used to share template instantiations in C++ (this is symmetric
1982 to code cp_cannot_inline_tree_fn and probably shall be shared and
1983 the inlinability hooks completely eliminated).
1985 ??? Does the C++ one definition rule allow us to always return
1986 AVAIL_AVAILABLE here? That would be good reason to preserve this
1989 else if (decl_replaceable_p (node
->symbol
.decl
)
1990 && !DECL_EXTERNAL (node
->symbol
.decl
))
1991 avail
= AVAIL_OVERWRITABLE
;
1992 else avail
= AVAIL_AVAILABLE
;
1997 /* Worker for cgraph_node_can_be_local_p. */
1999 cgraph_node_cannot_be_local_p_1 (struct cgraph_node
*node
,
2000 void *data ATTRIBUTE_UNUSED
)
2002 return !(!node
->symbol
.force_output
2003 && ((DECL_COMDAT (node
->symbol
.decl
)
2004 && !node
->symbol
.forced_by_abi
2005 && !symtab_used_from_object_file_p ((symtab_node
) node
)
2006 && !node
->symbol
.same_comdat_group
)
2007 || !node
->symbol
.externally_visible
));
2010 /* Return true if NODE can be made local for API change.
2011 Extern inline functions and C++ COMDAT functions can be made local
2012 at the expense of possible code size growth if function is used in multiple
2013 compilation units. */
2015 cgraph_node_can_be_local_p (struct cgraph_node
*node
)
2017 return (!node
->symbol
.address_taken
2018 && !cgraph_for_node_and_aliases (node
,
2019 cgraph_node_cannot_be_local_p_1
,
2023 /* Call calback on NODE, thunks and aliases associated to NODE.
2024 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2028 cgraph_for_node_thunks_and_aliases (struct cgraph_node
*node
,
2029 bool (*callback
) (struct cgraph_node
*, void *),
2031 bool include_overwritable
)
2033 struct cgraph_edge
*e
;
2035 struct ipa_ref
*ref
;
2037 if (callback (node
, data
))
2039 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2040 if (e
->caller
->thunk
.thunk_p
2041 && (include_overwritable
2042 || cgraph_function_body_availability (e
->caller
) > AVAIL_OVERWRITABLE
))
2043 if (cgraph_for_node_thunks_and_aliases (e
->caller
, callback
, data
,
2044 include_overwritable
))
2046 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
2047 if (ref
->use
== IPA_REF_ALIAS
)
2049 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
2050 if (include_overwritable
2051 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
2052 if (cgraph_for_node_thunks_and_aliases (alias
, callback
, data
,
2053 include_overwritable
))
2059 /* Call calback on NODE and aliases associated to NODE.
2060 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2064 cgraph_for_node_and_aliases (struct cgraph_node
*node
,
2065 bool (*callback
) (struct cgraph_node
*, void *),
2067 bool include_overwritable
)
2070 struct ipa_ref
*ref
;
2072 if (callback (node
, data
))
2074 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
2075 if (ref
->use
== IPA_REF_ALIAS
)
2077 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
2078 if (include_overwritable
2079 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
2080 if (cgraph_for_node_and_aliases (alias
, callback
, data
,
2081 include_overwritable
))
2087 /* Worker to bring NODE local. */
2090 cgraph_make_node_local_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2092 gcc_checking_assert (cgraph_node_can_be_local_p (node
));
2093 if (DECL_COMDAT (node
->symbol
.decl
) || DECL_EXTERNAL (node
->symbol
.decl
))
2095 symtab_make_decl_local (node
->symbol
.decl
);
2097 node
->symbol
.externally_visible
= false;
2098 node
->symbol
.forced_by_abi
= false;
2099 node
->local
.local
= true;
2100 node
->symbol
.unique_name
= (node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY
2101 || node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2102 node
->symbol
.resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2103 gcc_assert (cgraph_function_body_availability (node
) == AVAIL_LOCAL
);
2108 /* Bring NODE local. */
2111 cgraph_make_node_local (struct cgraph_node
*node
)
2113 cgraph_for_node_thunks_and_aliases (node
, cgraph_make_node_local_1
,
2117 /* Worker to set nothrow flag. */
2120 cgraph_set_nothrow_flag_1 (struct cgraph_node
*node
, void *data
)
2122 struct cgraph_edge
*e
;
2124 TREE_NOTHROW (node
->symbol
.decl
) = data
!= NULL
;
2127 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2128 e
->can_throw_external
= false;
2132 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2133 if any to NOTHROW. */
2136 cgraph_set_nothrow_flag (struct cgraph_node
*node
, bool nothrow
)
2138 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_nothrow_flag_1
,
2139 (void *)(size_t)nothrow
, false);
2142 /* Worker to set const flag. */
2145 cgraph_set_const_flag_1 (struct cgraph_node
*node
, void *data
)
2147 /* Static constructors and destructors without a side effect can be
2149 if (data
&& !((size_t)data
& 2))
2151 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
2152 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
2153 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2154 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
2156 TREE_READONLY (node
->symbol
.decl
) = data
!= NULL
;
2157 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
2161 /* Set TREE_READONLY on NODE's decl and on aliases of NODE
2162 if any to READONLY. */
2165 cgraph_set_const_flag (struct cgraph_node
*node
, bool readonly
, bool looping
)
2167 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_const_flag_1
,
2168 (void *)(size_t)(readonly
+ (int)looping
* 2),
2172 /* Worker to set pure flag. */
2175 cgraph_set_pure_flag_1 (struct cgraph_node
*node
, void *data
)
2177 /* Static constructors and destructors without a side effect can be
2179 if (data
&& !((size_t)data
& 2))
2181 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
2182 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
2183 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2184 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
2186 DECL_PURE_P (node
->symbol
.decl
) = data
!= NULL
;
2187 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
2191 /* Set DECL_PURE_P on NODE's decl and on aliases of NODE
2195 cgraph_set_pure_flag (struct cgraph_node
*node
, bool pure
, bool looping
)
2197 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_pure_flag_1
,
2198 (void *)(size_t)(pure
+ (int)looping
* 2),
2202 /* Data used by cgraph_propagate_frequency. */
2204 struct cgraph_propagate_frequency_data
2206 bool maybe_unlikely_executed
;
2207 bool maybe_executed_once
;
2208 bool only_called_at_startup
;
2209 bool only_called_at_exit
;
2212 /* Worker for cgraph_propagate_frequency_1. */
2215 cgraph_propagate_frequency_1 (struct cgraph_node
*node
, void *data
)
2217 struct cgraph_propagate_frequency_data
*d
;
2218 struct cgraph_edge
*edge
;
2220 d
= (struct cgraph_propagate_frequency_data
*)data
;
2221 for (edge
= node
->callers
;
2222 edge
&& (d
->maybe_unlikely_executed
|| d
->maybe_executed_once
2223 || d
->only_called_at_startup
|| d
->only_called_at_exit
);
2224 edge
= edge
->next_caller
)
2226 if (edge
->caller
!= node
)
2228 d
->only_called_at_startup
&= edge
->caller
->only_called_at_startup
;
2229 /* It makes sense to put main() together with the static constructors.
2230 It will be executed for sure, but rest of functions called from
2231 main are definitely not at startup only. */
2232 if (MAIN_NAME_P (DECL_NAME (edge
->caller
->symbol
.decl
)))
2233 d
->only_called_at_startup
= 0;
2234 d
->only_called_at_exit
&= edge
->caller
->only_called_at_exit
;
2236 if (!edge
->frequency
)
2238 switch (edge
->caller
->frequency
)
2240 case NODE_FREQUENCY_UNLIKELY_EXECUTED
:
2242 case NODE_FREQUENCY_EXECUTED_ONCE
:
2243 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2244 fprintf (dump_file
, " Called by %s that is executed once\n",
2245 cgraph_node_name (edge
->caller
));
2246 d
->maybe_unlikely_executed
= false;
2247 if (inline_edge_summary (edge
)->loop_depth
)
2249 d
->maybe_executed_once
= false;
2250 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2251 fprintf (dump_file
, " Called in loop\n");
2254 case NODE_FREQUENCY_HOT
:
2255 case NODE_FREQUENCY_NORMAL
:
2256 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2257 fprintf (dump_file
, " Called by %s that is normal or hot\n",
2258 cgraph_node_name (edge
->caller
));
2259 d
->maybe_unlikely_executed
= false;
2260 d
->maybe_executed_once
= false;
2264 return edge
!= NULL
;
2267 /* See if the frequency of NODE can be updated based on frequencies of its
2270 cgraph_propagate_frequency (struct cgraph_node
*node
)
2272 struct cgraph_propagate_frequency_data d
= {true, true, true, true};
2273 bool changed
= false;
2275 if (!node
->local
.local
)
2277 gcc_assert (node
->symbol
.analyzed
);
2278 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2279 fprintf (dump_file
, "Processing frequency %s\n", cgraph_node_name (node
));
2281 cgraph_for_node_and_aliases (node
, cgraph_propagate_frequency_1
, &d
, true);
2283 if ((d
.only_called_at_startup
&& !d
.only_called_at_exit
)
2284 && !node
->only_called_at_startup
)
2286 node
->only_called_at_startup
= true;
2288 fprintf (dump_file
, "Node %s promoted to only called at startup.\n",
2289 cgraph_node_name (node
));
2292 if ((d
.only_called_at_exit
&& !d
.only_called_at_startup
)
2293 && !node
->only_called_at_exit
)
2295 node
->only_called_at_exit
= true;
2297 fprintf (dump_file
, "Node %s promoted to only called at exit.\n",
2298 cgraph_node_name (node
));
2301 /* These come either from profile or user hints; never update them. */
2302 if (node
->frequency
== NODE_FREQUENCY_HOT
2303 || node
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2305 if (d
.maybe_unlikely_executed
)
2307 node
->frequency
= NODE_FREQUENCY_UNLIKELY_EXECUTED
;
2309 fprintf (dump_file
, "Node %s promoted to unlikely executed.\n",
2310 cgraph_node_name (node
));
2313 else if (d
.maybe_executed_once
&& node
->frequency
!= NODE_FREQUENCY_EXECUTED_ONCE
)
2315 node
->frequency
= NODE_FREQUENCY_EXECUTED_ONCE
;
2317 fprintf (dump_file
, "Node %s promoted to executed once.\n",
2318 cgraph_node_name (node
));
2324 /* Return true when NODE can not return or throw and thus
2325 it is safe to ignore its side effects for IPA analysis. */
2328 cgraph_node_cannot_return (struct cgraph_node
*node
)
2330 int flags
= flags_from_decl_or_type (node
->symbol
.decl
);
2331 if (!flag_exceptions
)
2332 return (flags
& ECF_NORETURN
) != 0;
2334 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2335 == (ECF_NORETURN
| ECF_NOTHROW
));
2338 /* Return true when call of E can not lead to return from caller
2339 and thus it is safe to ignore its side effects for IPA analysis
2340 when computing side effects of the caller.
2341 FIXME: We could actually mark all edges that have no reaching
2342 patch to EXIT_BLOCK_PTR or throw to get better results. */
2344 cgraph_edge_cannot_lead_to_return (struct cgraph_edge
*e
)
2346 if (cgraph_node_cannot_return (e
->caller
))
2348 if (e
->indirect_unknown_callee
)
2350 int flags
= e
->indirect_info
->ecf_flags
;
2351 if (!flag_exceptions
)
2352 return (flags
& ECF_NORETURN
) != 0;
2354 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2355 == (ECF_NORETURN
| ECF_NOTHROW
));
2358 return cgraph_node_cannot_return (e
->callee
);
2361 /* Return true when function NODE can be removed from callgraph
2362 if all direct calls are eliminated. */
2365 cgraph_can_remove_if_no_direct_calls_and_refs_p (struct cgraph_node
*node
)
2367 gcc_assert (!node
->global
.inlined_to
);
2368 /* Extern inlines can always go, we will use the external definition. */
2369 if (DECL_EXTERNAL (node
->symbol
.decl
))
2371 /* When function is needed, we can not remove it. */
2372 if (node
->symbol
.force_output
|| node
->symbol
.used_from_other_partition
)
2374 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
)
2375 || DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2377 /* Only COMDAT functions can be removed if externally visible. */
2378 if (node
->symbol
.externally_visible
2379 && (!DECL_COMDAT (node
->symbol
.decl
)
2380 || node
->symbol
.forced_by_abi
2381 || symtab_used_from_object_file_p ((symtab_node
) node
)))
2386 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2389 nonremovable_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2391 return !cgraph_can_remove_if_no_direct_calls_and_refs_p (node
);
2394 /* Return true when function NODE and its aliases can be removed from callgraph
2395 if all direct calls are eliminated. */
2398 cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node
*node
)
2400 /* Extern inlines can always go, we will use the external definition. */
2401 if (DECL_EXTERNAL (node
->symbol
.decl
))
2403 if (node
->symbol
.address_taken
)
2405 return !cgraph_for_node_and_aliases (node
, nonremovable_p
, NULL
, true);
2408 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2411 used_from_object_file_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2413 return symtab_used_from_object_file_p ((symtab_node
) node
);
2416 /* Return true when function NODE can be expected to be removed
2417 from program when direct calls in this compilation unit are removed.
2419 As a special case COMDAT functions are
2420 cgraph_can_remove_if_no_direct_calls_p while the are not
2421 cgraph_only_called_directly_p (it is possible they are called from other
2424 This function behaves as cgraph_only_called_directly_p because eliminating
2425 all uses of COMDAT function does not make it necessarily disappear from
2426 the program unless we are compiling whole program or we do LTO. In this
2427 case we know we win since dynamic linking will not really discard the
2428 linkonce section. */
2431 cgraph_will_be_removed_from_program_if_no_direct_calls (struct cgraph_node
*node
)
2433 gcc_assert (!node
->global
.inlined_to
);
2434 if (cgraph_for_node_and_aliases (node
, used_from_object_file_p
, NULL
, true))
2436 if (!in_lto_p
&& !flag_whole_program
)
2437 return cgraph_only_called_directly_p (node
);
2440 if (DECL_EXTERNAL (node
->symbol
.decl
))
2442 return cgraph_can_remove_if_no_direct_calls_p (node
);
2447 /* Worker for cgraph_only_called_directly_p. */
2450 cgraph_not_only_called_directly_p_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2452 return !cgraph_only_called_directly_or_aliased_p (node
);
2455 /* Return true when function NODE and all its aliases are only called
2457 i.e. it is not externally visible, address was not taken and
2458 it is not used in any other non-standard way. */
2461 cgraph_only_called_directly_p (struct cgraph_node
*node
)
2463 gcc_assert (cgraph_function_or_thunk_node (node
, NULL
) == node
);
2464 return !cgraph_for_node_and_aliases (node
, cgraph_not_only_called_directly_p_1
,
2469 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2472 collect_callers_of_node_1 (struct cgraph_node
*node
, void *data
)
2474 vec
<cgraph_edge_p
> *redirect_callers
= (vec
<cgraph_edge_p
> *)data
;
2475 struct cgraph_edge
*cs
;
2476 enum availability avail
;
2477 cgraph_function_or_thunk_node (node
, &avail
);
2479 if (avail
> AVAIL_OVERWRITABLE
)
2480 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2481 if (!cs
->indirect_inlining_edge
)
2482 redirect_callers
->safe_push (cs
);
2486 /* Collect all callers of NODE and its aliases that are known to lead to NODE
2487 (i.e. are not overwritable). */
2490 collect_callers_of_node (struct cgraph_node
*node
)
2492 vec
<cgraph_edge_p
> redirect_callers
= vNULL
;
2493 cgraph_for_node_and_aliases (node
, collect_callers_of_node_1
,
2494 &redirect_callers
, false);
2495 return redirect_callers
;
2498 /* Return TRUE if NODE2 is equivalent to NODE or its clone. */
2500 clone_of_p (struct cgraph_node
*node
, struct cgraph_node
*node2
)
2502 node
= cgraph_function_or_thunk_node (node
, NULL
);
2503 node2
= cgraph_function_or_thunk_node (node2
, NULL
);
2504 while (node
!= node2
&& node2
)
2505 node2
= node2
->clone_of
;
2506 return node2
!= NULL
;
2509 /* Verify edge E count and frequency. */
2512 verify_edge_count_and_frequency (struct cgraph_edge
*e
)
2514 bool error_found
= false;
2517 error ("caller edge count is negative");
2520 if (e
->frequency
< 0)
2522 error ("caller edge frequency is negative");
2525 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2527 error ("caller edge frequency is too large");
2530 if (gimple_has_body_p (e
->caller
->symbol
.decl
)
2531 && !e
->caller
->global
.inlined_to
2533 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2534 Remove this once edges are actually removed from the function at that time. */
2536 || (inline_edge_summary_vec
.exists ()
2537 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2538 || !inline_edge_summary (e
)->predicate
)))
2540 != compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2541 gimple_bb (e
->call_stmt
))))
2543 error ("caller edge frequency %i does not match BB frequency %i",
2545 compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2546 gimple_bb (e
->call_stmt
)));
2552 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2554 cgraph_debug_gimple_stmt (struct function
*this_cfun
, gimple stmt
)
2556 bool fndecl_was_null
= false;
2557 /* debug_gimple_stmt needs correct cfun */
2558 if (cfun
!= this_cfun
)
2559 set_cfun (this_cfun
);
2560 /* ...and an actual current_function_decl */
2561 if (!current_function_decl
)
2563 current_function_decl
= this_cfun
->decl
;
2564 fndecl_was_null
= true;
2566 debug_gimple_stmt (stmt
);
2567 if (fndecl_was_null
)
2568 current_function_decl
= NULL
;
2571 /* Verify that call graph edge E corresponds to DECL from the associated
2572 statement. Return true if the verification should fail. */
2575 verify_edge_corresponds_to_fndecl (struct cgraph_edge
*e
, tree decl
)
2577 struct cgraph_node
*node
;
2579 if (!decl
|| e
->callee
->global
.inlined_to
)
2581 if (cgraph_state
== CGRAPH_LTO_STREAMING
)
2583 node
= cgraph_get_node (decl
);
2585 /* We do not know if a node from a different partition is an alias or what it
2586 aliases and therefore cannot do the former_clone_of check reliably. */
2587 if (!node
|| node
->symbol
.in_other_partition
|| e
->callee
->symbol
.in_other_partition
)
2589 node
= cgraph_function_or_thunk_node (node
, NULL
);
2591 if (e
->callee
->former_clone_of
!= node
->symbol
.decl
2592 /* IPA-CP sometimes redirect edge to clone and then back to the former
2593 function. This ping-pong has to go, eventually. */
2594 && (node
!= cgraph_function_or_thunk_node (e
->callee
, NULL
))
2595 && !clone_of_p (cgraph_function_or_thunk_node (node
, NULL
), e
->callee
))
2601 /* Verify cgraph nodes of given cgraph node. */
2603 verify_cgraph_node (struct cgraph_node
*node
)
2605 struct cgraph_edge
*e
;
2606 struct function
*this_cfun
= DECL_STRUCT_FUNCTION (node
->symbol
.decl
);
2607 basic_block this_block
;
2608 gimple_stmt_iterator gsi
;
2609 bool error_found
= false;
2614 timevar_push (TV_CGRAPH_VERIFY
);
2615 error_found
|= verify_symtab_base ((symtab_node
) node
);
2616 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2619 error ("aux field set for edge %s->%s",
2620 identifier_to_locale (cgraph_node_name (e
->caller
)),
2621 identifier_to_locale (cgraph_node_name (e
->callee
)));
2624 if (node
->count
< 0)
2626 error ("execution count is negative");
2629 if (node
->global
.inlined_to
&& node
->symbol
.same_comdat_group
)
2631 error ("inline clone in same comdat group list");
2634 if (!node
->symbol
.definition
&& !node
->symbol
.in_other_partition
&& node
->local
.local
)
2636 error ("local symbols must be defined");
2639 if (node
->global
.inlined_to
&& node
->symbol
.externally_visible
)
2641 error ("externally visible inline clone");
2644 if (node
->global
.inlined_to
&& node
->symbol
.address_taken
)
2646 error ("inline clone with address taken");
2649 if (node
->global
.inlined_to
&& node
->symbol
.force_output
)
2651 error ("inline clone is forced to output");
2654 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2658 error ("aux field set for indirect edge from %s",
2659 identifier_to_locale (cgraph_node_name (e
->caller
)));
2662 if (!e
->indirect_unknown_callee
2663 || !e
->indirect_info
)
2665 error ("An indirect edge from %s is not marked as indirect or has "
2666 "associated indirect_info, the corresponding statement is: ",
2667 identifier_to_locale (cgraph_node_name (e
->caller
)));
2668 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2672 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2674 if (verify_edge_count_and_frequency (e
))
2676 if (!e
->inline_failed
)
2678 if (node
->global
.inlined_to
2679 != (e
->caller
->global
.inlined_to
2680 ? e
->caller
->global
.inlined_to
: e
->caller
))
2682 error ("inlined_to pointer is wrong");
2685 if (node
->callers
->next_caller
)
2687 error ("multiple inline callers");
2692 if (node
->global
.inlined_to
)
2694 error ("inlined_to pointer set for noninline callers");
2698 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2699 if (verify_edge_count_and_frequency (e
))
2701 if (!node
->callers
&& node
->global
.inlined_to
)
2703 error ("inlined_to pointer is set but no predecessors found");
2706 if (node
->global
.inlined_to
== node
)
2708 error ("inlined_to pointer refers to itself");
2714 struct cgraph_node
*n
;
2715 for (n
= node
->clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2720 error ("node has wrong clone_of");
2726 struct cgraph_node
*n
;
2727 for (n
= node
->clones
; n
; n
= n
->next_sibling_clone
)
2728 if (n
->clone_of
!= node
)
2732 error ("node has wrong clone list");
2736 if ((node
->prev_sibling_clone
|| node
->next_sibling_clone
) && !node
->clone_of
)
2738 error ("node is in clone list but it is not clone");
2741 if (!node
->prev_sibling_clone
&& node
->clone_of
&& node
->clone_of
->clones
!= node
)
2743 error ("node has wrong prev_clone pointer");
2746 if (node
->prev_sibling_clone
&& node
->prev_sibling_clone
->next_sibling_clone
!= node
)
2748 error ("double linked list of clones corrupted");
2752 if (node
->symbol
.analyzed
&& node
->symbol
.alias
)
2754 bool ref_found
= false;
2756 struct ipa_ref
*ref
;
2760 error ("Alias has call edges");
2763 for (i
= 0; ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
,
2765 if (ref
->use
!= IPA_REF_ALIAS
)
2767 error ("Alias has non-alias reference");
2772 error ("Alias has more than one alias reference");
2779 error ("Analyzed alias has no reference");
2783 if (node
->symbol
.analyzed
&& node
->thunk
.thunk_p
)
2787 error ("No edge out of thunk node");
2790 else if (node
->callees
->next_callee
)
2792 error ("More than one edge out of thunk node");
2795 if (gimple_has_body_p (node
->symbol
.decl
))
2797 error ("Thunk is not supposed to have body");
2801 else if (node
->symbol
.analyzed
&& gimple_has_body_p (node
->symbol
.decl
)
2802 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)
2803 && (!DECL_EXTERNAL (node
->symbol
.decl
) || node
->global
.inlined_to
)
2808 pointer_set_t
*stmts
= pointer_set_create ();
2810 struct ipa_ref
*ref
;
2812 /* Reach the trees by walking over the CFG, and note the
2813 enclosing basic-blocks in the call edges. */
2814 FOR_EACH_BB_FN (this_block
, this_cfun
)
2816 for (gsi
= gsi_start_phis (this_block
);
2817 !gsi_end_p (gsi
); gsi_next (&gsi
))
2818 pointer_set_insert (stmts
, gsi_stmt (gsi
));
2819 for (gsi
= gsi_start_bb (this_block
);
2823 gimple stmt
= gsi_stmt (gsi
);
2824 pointer_set_insert (stmts
, stmt
);
2825 if (is_gimple_call (stmt
))
2827 struct cgraph_edge
*e
= cgraph_edge (node
, stmt
);
2828 tree decl
= gimple_call_fndecl (stmt
);
2833 error ("shared call_stmt:");
2834 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2837 if (!e
->indirect_unknown_callee
)
2839 if (verify_edge_corresponds_to_fndecl (e
, decl
))
2841 error ("edge points to wrong declaration:");
2842 debug_tree (e
->callee
->symbol
.decl
);
2843 fprintf (stderr
," Instead of:");
2850 error ("an indirect edge with unknown callee "
2851 "corresponding to a call_stmt with "
2852 "a known declaration:");
2854 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2860 error ("missing callgraph edge for call stmt:");
2861 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2868 ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
, i
, ref
);
2870 if (ref
->stmt
&& !pointer_set_contains (stmts
, ref
->stmt
))
2872 error ("reference to dead statement");
2873 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
2876 pointer_set_destroy (stmts
);
2879 /* No CFG available?! */
2882 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2886 error ("edge %s->%s has no corresponding call_stmt",
2887 identifier_to_locale (cgraph_node_name (e
->caller
)),
2888 identifier_to_locale (cgraph_node_name (e
->callee
)));
2889 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2894 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2896 if (!e
->aux
&& !e
->speculative
)
2898 error ("an indirect edge from %s has no corresponding call_stmt",
2899 identifier_to_locale (cgraph_node_name (e
->caller
)));
2900 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2908 dump_cgraph_node (stderr
, node
);
2909 internal_error ("verify_cgraph_node failed");
2911 timevar_pop (TV_CGRAPH_VERIFY
);
2914 /* Verify whole cgraph structure. */
2916 verify_cgraph (void)
2918 struct cgraph_node
*node
;
2923 FOR_EACH_FUNCTION (node
)
2924 verify_cgraph_node (node
);
2927 /* Create external decl node for DECL.
2928 The difference i nbetween cgraph_get_create_node and
2929 cgraph_get_create_real_symbol_node is that cgraph_get_create_node
2930 may return inline clone, while cgraph_get_create_real_symbol_node
2931 will create a new node in this case.
2932 FIXME: This function should be removed once clones are put out of decl
2935 struct cgraph_node
*
2936 cgraph_get_create_real_symbol_node (tree decl
)
2938 struct cgraph_node
*first_clone
= cgraph_get_node (decl
);
2939 struct cgraph_node
*node
;
2940 /* create symbol table node. even if inline clone exists, we can not take
2941 it as a target of non-inlined call. */
2942 node
= cgraph_get_node (decl
);
2943 if (node
&& !node
->global
.inlined_to
)
2946 node
= cgraph_create_node (decl
);
2948 /* ok, we previously inlined the function, then removed the offline copy and
2949 now we want it back for external call. this can happen when devirtualizing
2950 while inlining function called once that happens after extern inlined and
2951 virtuals are already removed. in this case introduce the external node
2952 and make it available for call. */
2955 first_clone
->clone_of
= node
;
2956 node
->clones
= first_clone
;
2957 symtab_prevail_in_asm_name_hash ((symtab_node
) node
);
2958 symtab_insert_node_to_hashtable ((symtab_node
) node
);
2960 fprintf (dump_file
, "Introduced new external node "
2961 "(%s/%i) and turned into root of the clone tree.\n",
2962 xstrdup (cgraph_node_name (node
)), node
->symbol
.order
);
2965 fprintf (dump_file
, "Introduced new external node "
2966 "(%s/%i).\n", xstrdup (cgraph_node_name (node
)),
2967 node
->symbol
.order
);
2972 /* Given NODE, walk the alias chain to return the function NODE is alias of.
2973 Walk through thunk, too.
2974 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
2976 struct cgraph_node
*
2977 cgraph_function_node (struct cgraph_node
*node
, enum availability
*availability
)
2981 node
= cgraph_function_or_thunk_node (node
, availability
);
2982 if (node
->thunk
.thunk_p
)
2984 node
= node
->callees
->callee
;
2987 enum availability a
;
2988 a
= cgraph_function_body_availability (node
);
2989 if (a
< *availability
)
2992 node
= cgraph_function_or_thunk_node (node
, availability
);
2994 } while (node
&& node
->thunk
.thunk_p
);
2998 /* When doing LTO, read NODE's body from disk if it is not already present. */
3001 cgraph_get_body (struct cgraph_node
*node
)
3003 struct lto_file_decl_data
*file_data
;
3004 const char *data
, *name
;
3006 tree decl
= node
->symbol
.decl
;
3008 if (DECL_RESULT (decl
))
3011 gcc_assert (in_lto_p
);
3013 file_data
= node
->symbol
.lto_file_data
;
3014 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3016 /* We may have renamed the declaration, e.g., a static function. */
3017 name
= lto_get_decl_name_mapping (file_data
, name
);
3019 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3023 dump_cgraph_node (stderr
, node
);
3024 fatal_error ("%s: section %s is missing",
3025 file_data
->file_name
,
3029 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3031 lto_input_function_body (file_data
, decl
, data
);
3032 lto_stats
.num_function_bodies
++;
3033 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3038 #include "gt-cgraph.h"