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
,
930 edge
->indirect_unknown_callee
= 1;
931 initialize_inline_failed (edge
);
933 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
934 edge
->indirect_info
->ecf_flags
= ecf_flags
;
936 /* Record polymorphic call info. */
938 && (target
= gimple_call_fn (call_stmt
))
939 && virtual_method_call_p (target
))
941 tree type
= obj_type_ref_class (target
);
944 /* Only record types can have virtual calls. */
945 gcc_assert (TREE_CODE (type
) == RECORD_TYPE
);
946 edge
->indirect_info
->param_index
= -1;
947 edge
->indirect_info
->otr_token
948 = tree_low_cst (OBJ_TYPE_REF_TOKEN (target
), 1);
949 edge
->indirect_info
->otr_type
= type
;
950 edge
->indirect_info
->polymorphic
= 1;
953 edge
->next_callee
= caller
->indirect_calls
;
954 if (caller
->indirect_calls
)
955 caller
->indirect_calls
->prev_callee
= edge
;
956 caller
->indirect_calls
= edge
;
961 /* Remove the edge E from the list of the callers of the callee. */
964 cgraph_edge_remove_callee (struct cgraph_edge
*e
)
966 gcc_assert (!e
->indirect_unknown_callee
);
968 e
->prev_caller
->next_caller
= e
->next_caller
;
970 e
->next_caller
->prev_caller
= e
->prev_caller
;
972 e
->callee
->callers
= e
->next_caller
;
975 /* Remove the edge E from the list of the callees of the caller. */
978 cgraph_edge_remove_caller (struct cgraph_edge
*e
)
981 e
->prev_callee
->next_callee
= e
->next_callee
;
983 e
->next_callee
->prev_callee
= e
->prev_callee
;
986 if (e
->indirect_unknown_callee
)
987 e
->caller
->indirect_calls
= e
->next_callee
;
989 e
->caller
->callees
= e
->next_callee
;
991 if (e
->caller
->call_site_hash
)
992 htab_remove_elt_with_hash (e
->caller
->call_site_hash
,
994 htab_hash_pointer (e
->call_stmt
));
997 /* Put the edge onto the free list. */
1000 cgraph_free_edge (struct cgraph_edge
*e
)
1004 if (e
->indirect_info
)
1005 ggc_free (e
->indirect_info
);
1007 /* Clear out the edge so we do not dangle pointers. */
1008 memset (e
, 0, sizeof (*e
));
1010 NEXT_FREE_EDGE (e
) = free_edges
;
1014 /* Remove the edge E in the cgraph. */
1017 cgraph_remove_edge (struct cgraph_edge
*e
)
1019 /* Call all edge removal hooks. */
1020 cgraph_call_edge_removal_hooks (e
);
1022 if (!e
->indirect_unknown_callee
)
1023 /* Remove from callers list of the callee. */
1024 cgraph_edge_remove_callee (e
);
1026 /* Remove from callees list of the callers. */
1027 cgraph_edge_remove_caller (e
);
1029 /* Put the edge onto the free list. */
1030 cgraph_free_edge (e
);
1033 /* Set callee of call graph edge E and add it to the corresponding set of
1037 cgraph_set_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
1039 e
->prev_caller
= NULL
;
1041 n
->callers
->prev_caller
= e
;
1042 e
->next_caller
= n
->callers
;
1047 /* Turn edge E into speculative call calling N2. Update
1048 the profile so the direct call is taken COUNT times
1051 At clone materialization time, the indirect call E will
1054 if (call_dest == N2)
1059 At this time the function just creates the direct call,
1060 the referencd representing the if conditional and attaches
1061 them all to the orginal indirect call statement.
1063 Return direct edge created. */
1065 struct cgraph_edge
*
1066 cgraph_turn_edge_to_speculative (struct cgraph_edge
*e
,
1067 struct cgraph_node
*n2
,
1068 gcov_type direct_count
,
1069 int direct_frequency
)
1071 struct cgraph_node
*n
= e
->caller
;
1072 struct ipa_ref
*ref
;
1073 struct cgraph_edge
*e2
;
1077 fprintf (dump_file
, "Indirect call -> direct call from"
1078 " other module %s/%i => %s/%i\n",
1079 xstrdup (cgraph_node_name (n
)), n
->symbol
.order
,
1080 xstrdup (cgraph_node_name (n2
)), n2
->symbol
.order
);
1082 e
->speculative
= true;
1083 e2
= cgraph_create_edge (n
, n2
, e
->call_stmt
, direct_count
, direct_frequency
);
1084 initialize_inline_failed (e2
);
1085 e2
->speculative
= true;
1086 e2
->call_stmt
= e
->call_stmt
;
1087 e2
->can_throw_external
= e
->can_throw_external
;
1088 e2
->lto_stmt_uid
= e
->lto_stmt_uid
;
1089 e
->count
-= e2
->count
;
1090 e
->frequency
-= e2
->frequency
;
1091 cgraph_call_edge_duplication_hooks (e
, e2
);
1092 ref
= ipa_record_reference ((symtab_node
)n
, (symtab_node
)n2
,
1093 IPA_REF_ADDR
, e
->call_stmt
);
1094 ref
->lto_stmt_uid
= e
->lto_stmt_uid
;
1095 ref
->speculative
= e
->speculative
;
1099 /* Speculative call consist of three components:
1100 1) an indirect edge representing the original call
1101 2) an direct edge representing the new call
1102 3) ADDR_EXPR reference representing the speculative check.
1103 All three components are attached to single statement (the indirect
1104 call) and if one of them exists, all of them must exist.
1106 Given speculative call edge E, return all three components.
1110 cgraph_speculative_call_info (struct cgraph_edge
*e
,
1111 struct cgraph_edge
*&indirect
,
1112 struct cgraph_edge
*&direct
,
1113 struct ipa_ref
*&reference
)
1115 struct ipa_ref
*ref
;
1117 struct cgraph_edge
*e2
;
1119 if (!e
->indirect_unknown_callee
)
1120 for (e2
= e
->caller
->indirect_calls
;
1121 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1122 e2
= e2
->next_callee
)
1127 /* We can take advantage of the call stmt hash. */
1130 e
= cgraph_edge (e
->caller
, e2
->call_stmt
);
1131 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1134 for (e
= e
->caller
->callees
;
1135 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1139 gcc_assert (e
->speculative
&& e2
->speculative
);
1144 for (i
= 0; ipa_ref_list_reference_iterate (&e
->caller
->symbol
.ref_list
, i
, ref
); i
++)
1145 if (ref
->speculative
1146 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1147 || (ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1154 /* Redirect callee of E to N. The function does not update underlying
1158 cgraph_redirect_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
1160 /* Remove from callers list of the current callee. */
1161 cgraph_edge_remove_callee (e
);
1163 /* Insert to callers list of the new callee. */
1164 cgraph_set_edge_callee (e
, n
);
1167 /* Speculative call EDGE turned out to be direct call to CALLE_DECL.
1168 Remove the speculative call sequence and return edge representing the call.
1169 It is up to caller to redirect the call as appropriate. */
1171 struct cgraph_edge
*
1172 cgraph_resolve_speculation (struct cgraph_edge
*edge
, tree callee_decl
)
1174 struct cgraph_edge
*e2
;
1175 struct ipa_ref
*ref
;
1177 gcc_assert (edge
->speculative
);
1178 cgraph_speculative_call_info (edge
, e2
, edge
, ref
);
1179 if (ref
->referred
->symbol
.decl
!= callee_decl
)
1185 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1186 "turned out to have contradicting known target ",
1187 xstrdup (cgraph_node_name (edge
->caller
)), edge
->caller
->symbol
.order
,
1188 xstrdup (cgraph_node_name (e2
->callee
)), e2
->callee
->symbol
.order
);
1189 print_generic_expr (dump_file
, callee_decl
, 0);
1190 fprintf (dump_file
, "\n");
1194 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1195 xstrdup (cgraph_node_name (edge
->caller
)), edge
->caller
->symbol
.order
,
1196 xstrdup (cgraph_node_name (e2
->callee
)), e2
->callee
->symbol
.order
);
1202 struct cgraph_edge
*tmp
= edge
;
1204 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1208 edge
->count
+= e2
->count
;
1209 edge
->frequency
+= e2
->frequency
;
1210 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1211 edge
->frequency
= CGRAPH_FREQ_MAX
;
1212 edge
->speculative
= false;
1213 e2
->speculative
= false;
1214 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1215 cgraph_remove_edge (e2
);
1217 cgraph_remove_node_and_inline_clones (e2
->callee
, NULL
);
1218 if (edge
->caller
->call_site_hash
)
1219 cgraph_update_edge_in_call_site_hash (edge
);
1220 ipa_remove_reference (ref
);
1224 /* Make an indirect EDGE with an unknown callee an ordinary edge leading to
1225 CALLEE. DELTA is an integer constant that is to be added to the this
1226 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1228 struct cgraph_edge
*
1229 cgraph_make_edge_direct (struct cgraph_edge
*edge
, struct cgraph_node
*callee
)
1231 gcc_assert (edge
->indirect_unknown_callee
);
1233 /* If we are redirecting speculative call, make it non-speculative. */
1234 if (edge
->indirect_unknown_callee
&& edge
->speculative
)
1236 edge
= cgraph_resolve_speculation (edge
, callee
->symbol
.decl
);
1238 /* On successful speculation just return the pre existing direct edge. */
1239 if (!edge
->indirect_unknown_callee
)
1243 edge
->indirect_unknown_callee
= 0;
1244 ggc_free (edge
->indirect_info
);
1245 edge
->indirect_info
= NULL
;
1247 /* Get the edge out of the indirect edge list. */
1248 if (edge
->prev_callee
)
1249 edge
->prev_callee
->next_callee
= edge
->next_callee
;
1250 if (edge
->next_callee
)
1251 edge
->next_callee
->prev_callee
= edge
->prev_callee
;
1252 if (!edge
->prev_callee
)
1253 edge
->caller
->indirect_calls
= edge
->next_callee
;
1255 /* Put it into the normal callee list */
1256 edge
->prev_callee
= NULL
;
1257 edge
->next_callee
= edge
->caller
->callees
;
1258 if (edge
->caller
->callees
)
1259 edge
->caller
->callees
->prev_callee
= edge
;
1260 edge
->caller
->callees
= edge
;
1262 /* Insert to callers list of the new callee. */
1263 cgraph_set_edge_callee (edge
, callee
);
1265 if (edge
->call_stmt
)
1266 edge
->call_stmt_cannot_inline_p
1267 = !gimple_check_call_matching_types (edge
->call_stmt
, callee
->symbol
.decl
,
1270 /* We need to re-determine the inlining status of the edge. */
1271 initialize_inline_failed (edge
);
1275 /* If necessary, change the function declaration in the call statement
1276 associated with E so that it corresponds to the edge callee. */
1279 cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge
*e
)
1281 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1283 gimple_stmt_iterator gsi
;
1284 #ifdef ENABLE_CHECKING
1285 struct cgraph_node
*node
;
1290 struct cgraph_edge
*e2
;
1292 struct ipa_ref
*ref
;
1294 cgraph_speculative_call_info (e
, e
, e2
, ref
);
1295 if (gimple_call_fndecl (e
->call_stmt
))
1296 e
= cgraph_resolve_speculation (e
, gimple_call_fndecl (e
->call_stmt
));
1297 if (!gimple_check_call_matching_types (e
->call_stmt
, e
->callee
->symbol
.decl
,
1300 e
= cgraph_resolve_speculation (e
, NULL
);
1302 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1304 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1305 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
);
1310 fprintf (dump_file
, "Expanding speculative call of %s/%i -> %s/%i count:"
1311 HOST_WIDEST_INT_PRINT_DEC
"\n",
1312 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1313 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
,
1314 (HOST_WIDEST_INT
)e
->count
);
1315 gcc_assert (e2
->speculative
);
1316 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->symbol
.decl
));
1317 new_stmt
= gimple_ic (e
->call_stmt
, cgraph (ref
->referred
),
1318 e
->count
|| e2
->count
1319 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1320 e
->count
+ e2
->count
)
1321 : e
->frequency
|| e2
->frequency
1322 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1323 e
->frequency
+ e2
->frequency
)
1324 : REG_BR_PROB_BASE
/ 2,
1325 e
->count
, e
->count
+ e2
->count
);
1326 e
->speculative
= false;
1327 cgraph_set_call_stmt_including_clones (e
->caller
, e
->call_stmt
, new_stmt
, false);
1328 e
->frequency
= compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
1329 gimple_bb (e
->call_stmt
));
1330 e2
->frequency
= compute_call_stmt_bb_frequency (e2
->caller
->symbol
.decl
,
1331 gimple_bb (e2
->call_stmt
));
1332 e2
->speculative
= false;
1333 ref
->speculative
= false;
1335 /* Indirect edges are not both in the call site hash.
1337 if (e
->caller
->call_site_hash
)
1338 cgraph_update_edge_in_call_site_hash (e2
);
1340 /* Continue redirecting E to proper target. */
1344 if (e
->indirect_unknown_callee
1345 || decl
== e
->callee
->symbol
.decl
)
1346 return e
->call_stmt
;
1348 #ifdef ENABLE_CHECKING
1351 node
= cgraph_get_node (decl
);
1352 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1356 if (cgraph_dump_file
)
1358 fprintf (cgraph_dump_file
, "updating call of %s/%i -> %s/%i: ",
1359 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1360 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
);
1361 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1362 if (e
->callee
->clone
.combined_args_to_skip
)
1364 fprintf (cgraph_dump_file
, " combined args to skip: ");
1365 dump_bitmap (cgraph_dump_file
,
1366 e
->callee
->clone
.combined_args_to_skip
);
1370 if (e
->callee
->clone
.combined_args_to_skip
)
1375 = gimple_call_copy_skip_args (e
->call_stmt
,
1376 e
->callee
->clone
.combined_args_to_skip
);
1377 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1378 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1380 if (gimple_vdef (new_stmt
)
1381 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1382 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1384 gsi
= gsi_for_stmt (e
->call_stmt
);
1385 gsi_replace (&gsi
, new_stmt
, false);
1386 /* We need to defer cleaning EH info on the new statement to
1387 fixup-cfg. We may not have dominator information at this point
1388 and thus would end up with unreachable blocks and have no way
1389 to communicate that we need to run CFG cleanup then. */
1390 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1393 remove_stmt_from_eh_lp (e
->call_stmt
);
1394 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1399 new_stmt
= e
->call_stmt
;
1400 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1401 update_stmt (new_stmt
);
1404 cgraph_set_call_stmt_including_clones (e
->caller
, e
->call_stmt
, new_stmt
, false);
1406 if (cgraph_dump_file
)
1408 fprintf (cgraph_dump_file
, " updated to:");
1409 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1414 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1415 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1416 of OLD_STMT if it was previously call statement.
1417 If NEW_STMT is NULL, the call has been dropped without any
1421 cgraph_update_edges_for_call_stmt_node (struct cgraph_node
*node
,
1422 gimple old_stmt
, tree old_call
,
1425 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1426 ? gimple_call_fndecl (new_stmt
) : 0;
1428 /* We are seeing indirect calls, then there is nothing to update. */
1429 if (!new_call
&& !old_call
)
1431 /* See if we turned indirect call into direct call or folded call to one builtin
1432 into different builtin. */
1433 if (old_call
!= new_call
)
1435 struct cgraph_edge
*e
= cgraph_edge (node
, old_stmt
);
1436 struct cgraph_edge
*ne
= NULL
;
1442 /* See if the edge is already there and has the correct callee. It
1443 might be so because of indirect inlining has already updated
1444 it. We also might've cloned and redirected the edge. */
1445 if (new_call
&& e
->callee
)
1447 struct cgraph_node
*callee
= e
->callee
;
1450 if (callee
->symbol
.decl
== new_call
1451 || callee
->former_clone_of
== new_call
)
1453 callee
= callee
->clone_of
;
1457 /* Otherwise remove edge and create new one; we can't simply redirect
1458 since function has changed, so inline plan and other information
1459 attached to edge is invalid. */
1461 frequency
= e
->frequency
;
1462 cgraph_remove_edge (e
);
1466 /* We are seeing new direct call; compute profile info based on BB. */
1467 basic_block bb
= gimple_bb (new_stmt
);
1469 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1475 ne
= cgraph_create_edge (node
, cgraph_get_create_node (new_call
),
1476 new_stmt
, count
, frequency
);
1477 gcc_assert (ne
->inline_failed
);
1480 /* We only updated the call stmt; update pointer in cgraph edge.. */
1481 else if (old_stmt
!= new_stmt
)
1482 cgraph_set_call_stmt (cgraph_edge (node
, old_stmt
), new_stmt
);
1485 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1486 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1487 of OLD_STMT before it was updated (updating can happen inplace). */
1490 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1492 struct cgraph_node
*orig
= cgraph_get_node (cfun
->decl
);
1493 struct cgraph_node
*node
;
1495 gcc_checking_assert (orig
);
1496 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1498 for (node
= orig
->clones
; node
!= orig
;)
1500 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1502 node
= node
->clones
;
1503 else if (node
->next_sibling_clone
)
1504 node
= node
->next_sibling_clone
;
1507 while (node
!= orig
&& !node
->next_sibling_clone
)
1508 node
= node
->clone_of
;
1510 node
= node
->next_sibling_clone
;
1516 /* Remove all callees from the node. */
1519 cgraph_node_remove_callees (struct cgraph_node
*node
)
1521 struct cgraph_edge
*e
, *f
;
1523 /* It is sufficient to remove the edges from the lists of callers of
1524 the callees. The callee list of the node can be zapped with one
1526 for (e
= node
->callees
; e
; e
= f
)
1529 cgraph_call_edge_removal_hooks (e
);
1530 if (!e
->indirect_unknown_callee
)
1531 cgraph_edge_remove_callee (e
);
1532 cgraph_free_edge (e
);
1534 for (e
= node
->indirect_calls
; e
; e
= f
)
1537 cgraph_call_edge_removal_hooks (e
);
1538 if (!e
->indirect_unknown_callee
)
1539 cgraph_edge_remove_callee (e
);
1540 cgraph_free_edge (e
);
1542 node
->indirect_calls
= NULL
;
1543 node
->callees
= NULL
;
1544 if (node
->call_site_hash
)
1546 htab_delete (node
->call_site_hash
);
1547 node
->call_site_hash
= NULL
;
1551 /* Remove all callers from the node. */
1554 cgraph_node_remove_callers (struct cgraph_node
*node
)
1556 struct cgraph_edge
*e
, *f
;
1558 /* It is sufficient to remove the edges from the lists of callees of
1559 the callers. The caller list of the node can be zapped with one
1561 for (e
= node
->callers
; e
; e
= f
)
1564 cgraph_call_edge_removal_hooks (e
);
1565 cgraph_edge_remove_caller (e
);
1566 cgraph_free_edge (e
);
1568 node
->callers
= NULL
;
1571 /* Helper function for cgraph_release_function_body and free_lang_data.
1572 It releases body from function DECL without having to inspect its
1573 possibly non-existent symtab node. */
1576 release_function_body (tree decl
)
1578 if (DECL_STRUCT_FUNCTION (decl
))
1580 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1584 cfun
->curr_properties
&= ~PROP_loops
;
1585 loop_optimizer_finalize ();
1587 if (cfun
->gimple_df
)
1590 delete_tree_cfg_annotations ();
1595 gcc_assert (dom_computed
[0] == DOM_NONE
);
1596 gcc_assert (dom_computed
[1] == DOM_NONE
);
1600 if (cfun
->value_histograms
)
1603 gimple_set_body (decl
, NULL
);
1604 /* Struct function hangs a lot of data that would leak if we didn't
1605 removed all pointers to it. */
1606 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1607 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1609 DECL_SAVED_TREE (decl
) = NULL
;
1612 /* Release memory used to represent body of function NODE.
1613 Use this only for functions that are released before being translated to
1614 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1615 are free'd in final.c via free_after_compilation(). */
1618 cgraph_release_function_body (struct cgraph_node
*node
)
1620 node
->ipa_transforms_to_apply
.release ();
1621 if (!node
->used_as_abstract_origin
&& cgraph_state
!= CGRAPH_STATE_PARSING
)
1623 DECL_RESULT (node
->symbol
.decl
) = NULL
;
1624 DECL_ARGUMENTS (node
->symbol
.decl
) = NULL
;
1626 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1627 of its associated function function declaration because it's
1628 needed to emit debug info later. */
1629 if (!node
->used_as_abstract_origin
&& DECL_INITIAL (node
->symbol
.decl
))
1630 DECL_INITIAL (node
->symbol
.decl
) = error_mark_node
;
1631 release_function_body (node
->symbol
.decl
);
1634 /* Remove the node from cgraph. */
1637 cgraph_remove_node (struct cgraph_node
*node
)
1639 struct cgraph_node
*n
;
1640 int uid
= node
->uid
;
1642 cgraph_call_node_removal_hooks (node
);
1643 cgraph_node_remove_callers (node
);
1644 cgraph_node_remove_callees (node
);
1645 node
->ipa_transforms_to_apply
.release ();
1647 /* Incremental inlining access removed nodes stored in the postorder list.
1649 node
->symbol
.force_output
= false;
1650 node
->symbol
.forced_by_abi
= false;
1651 for (n
= node
->nested
; n
; n
= n
->next_nested
)
1653 node
->nested
= NULL
;
1656 struct cgraph_node
**node2
= &node
->origin
->nested
;
1658 while (*node2
!= node
)
1659 node2
= &(*node2
)->next_nested
;
1660 *node2
= node
->next_nested
;
1662 symtab_unregister_node ((symtab_node
)node
);
1663 if (node
->prev_sibling_clone
)
1664 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
1665 else if (node
->clone_of
)
1666 node
->clone_of
->clones
= node
->next_sibling_clone
;
1667 if (node
->next_sibling_clone
)
1668 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
1671 struct cgraph_node
*n
, *next
;
1675 for (n
= node
->clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1676 n
->clone_of
= node
->clone_of
;
1677 n
->clone_of
= node
->clone_of
;
1678 n
->next_sibling_clone
= node
->clone_of
->clones
;
1679 if (node
->clone_of
->clones
)
1680 node
->clone_of
->clones
->prev_sibling_clone
= n
;
1681 node
->clone_of
->clones
= node
->clones
;
1685 /* We are removing node with clones. This makes clones inconsistent,
1686 but assume they will be removed subsequently and just keep clone
1687 tree intact. This can happen in unreachable function removal since
1688 we remove unreachable functions in random order, not by bottom-up
1689 walk of clone trees. */
1690 for (n
= node
->clones
; n
; n
= next
)
1692 next
= n
->next_sibling_clone
;
1693 n
->next_sibling_clone
= NULL
;
1694 n
->prev_sibling_clone
= NULL
;
1700 /* While all the clones are removed after being proceeded, the function
1701 itself is kept in the cgraph even after it is compiled. Check whether
1702 we are done with this body and reclaim it proactively if this is the case.
1704 if (cgraph_state
!= CGRAPH_LTO_STREAMING
)
1706 n
= cgraph_get_node (node
->symbol
.decl
);
1708 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1709 && (cgraph_global_info_ready
1710 && (TREE_ASM_WRITTEN (n
->symbol
.decl
)
1711 || DECL_EXTERNAL (n
->symbol
.decl
)
1712 || !n
->symbol
.analyzed
1713 || (!flag_wpa
&& n
->symbol
.in_other_partition
)))))
1714 cgraph_release_function_body (node
);
1717 node
->symbol
.decl
= NULL
;
1718 if (node
->call_site_hash
)
1720 htab_delete (node
->call_site_hash
);
1721 node
->call_site_hash
= NULL
;
1725 /* Clear out the node to NULL all pointers and add the node to the free
1727 memset (node
, 0, sizeof(*node
));
1728 node
->symbol
.type
= SYMTAB_FUNCTION
;
1730 SET_NEXT_FREE_NODE (node
, free_nodes
);
1734 /* Likewise indicate that a node is having address taken. */
1737 cgraph_mark_address_taken_node (struct cgraph_node
*node
)
1739 /* Indirect inlining can figure out that all uses of the address are
1741 if (node
->global
.inlined_to
)
1743 gcc_assert (cfun
->after_inlining
);
1744 gcc_assert (node
->callers
->indirect_inlining_edge
);
1747 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1748 IPA_REF_ADDR reference exists (and thus it should be set on node
1749 representing alias we take address of) and as a test whether address
1750 of the object was taken (and thus it should be set on node alias is
1751 referring to). We should remove the first use and the remove the
1753 node
->symbol
.address_taken
= 1;
1754 node
= cgraph_function_or_thunk_node (node
, NULL
);
1755 node
->symbol
.address_taken
= 1;
1758 /* Return local info for the compiled function. */
1760 struct cgraph_local_info
*
1761 cgraph_local_info (tree decl
)
1763 struct cgraph_node
*node
;
1765 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1766 node
= cgraph_get_node (decl
);
1769 return &node
->local
;
1772 /* Return local info for the compiled function. */
1774 struct cgraph_global_info
*
1775 cgraph_global_info (tree decl
)
1777 struct cgraph_node
*node
;
1779 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
&& cgraph_global_info_ready
);
1780 node
= cgraph_get_node (decl
);
1783 return &node
->global
;
1786 /* Return local info for the compiled function. */
1788 struct cgraph_rtl_info
*
1789 cgraph_rtl_info (tree decl
)
1791 struct cgraph_node
*node
;
1793 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1794 node
= cgraph_get_node (decl
);
1796 || (decl
!= current_function_decl
1797 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)))
1802 /* Return a string describing the failure REASON. */
1805 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1808 #define DEFCIFCODE(code, string) string,
1810 static const char *cif_string_table
[CIF_N_REASONS
] = {
1811 #include "cif-code.def"
1814 /* Signedness of an enum type is implementation defined, so cast it
1815 to unsigned before testing. */
1816 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1817 return cif_string_table
[reason
];
1820 /* Names used to print out the availability enum. */
1821 const char * const cgraph_availability_names
[] =
1822 {"unset", "not_available", "overwritable", "available", "local"};
1825 /* Dump call graph node NODE to file F. */
1828 dump_cgraph_node (FILE *f
, struct cgraph_node
*node
)
1830 struct cgraph_edge
*edge
;
1831 int indirect_calls_count
= 0;
1833 dump_symtab_base (f
, (symtab_node
) node
);
1835 if (node
->global
.inlined_to
)
1836 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1837 xstrdup (cgraph_node_name (node
)),
1839 xstrdup (cgraph_node_name (node
->global
.inlined_to
)),
1840 node
->global
.inlined_to
->symbol
.order
);
1842 fprintf (f
, " Clone of %s/%i\n",
1843 cgraph_node_asm_name (node
->clone_of
),
1844 node
->clone_of
->symbol
.order
);
1845 if (cgraph_function_flags_ready
)
1846 fprintf (f
, " Availability: %s\n",
1847 cgraph_availability_names
[cgraph_function_body_availability (node
)]);
1849 if (node
->profile_id
)
1850 fprintf (f
, " Profile id: %i\n",
1852 fprintf (f
, " Function flags:");
1854 fprintf (f
, " executed "HOST_WIDEST_INT_PRINT_DEC
"x",
1855 (HOST_WIDEST_INT
)node
->count
);
1857 fprintf (f
, " nested in: %s", cgraph_node_asm_name (node
->origin
));
1858 if (gimple_has_body_p (node
->symbol
.decl
))
1859 fprintf (f
, " body");
1861 fprintf (f
, " process");
1862 if (node
->local
.local
)
1863 fprintf (f
, " local");
1864 if (node
->local
.redefined_extern_inline
)
1865 fprintf (f
, " redefined_extern_inline");
1866 if (node
->only_called_at_startup
)
1867 fprintf (f
, " only_called_at_startup");
1868 if (node
->only_called_at_exit
)
1869 fprintf (f
, " only_called_at_exit");
1871 fprintf (f
, " tm_clone");
1875 if (node
->thunk
.thunk_p
)
1877 fprintf (f
, " Thunk");
1878 if (node
->thunk
.alias
)
1879 fprintf (f
, " of %s (asm: %s)",
1880 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2),
1881 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)));
1882 fprintf (f
, " fixed offset %i virtual value %i has "
1883 "virtual offset %i)\n",
1884 (int)node
->thunk
.fixed_offset
,
1885 (int)node
->thunk
.virtual_value
,
1886 (int)node
->thunk
.virtual_offset_p
);
1888 if (node
->symbol
.alias
&& node
->thunk
.alias
1889 && DECL_P (node
->thunk
.alias
))
1891 fprintf (f
, " Alias of %s",
1892 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2));
1893 if (DECL_ASSEMBLER_NAME_SET_P (node
->thunk
.alias
))
1894 fprintf (f
, " (asm: %s)",
1895 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)));
1899 fprintf (f
, " Called by: ");
1901 for (edge
= node
->callers
; edge
; edge
= edge
->next_caller
)
1903 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->caller
),
1904 edge
->caller
->symbol
.order
);
1906 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1907 (HOST_WIDEST_INT
)edge
->count
);
1908 if (edge
->frequency
)
1909 fprintf (f
, "(%.2f per call) ",
1910 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1911 if (edge
->speculative
)
1912 fprintf(f
, "(speculative) ");
1913 if (!edge
->inline_failed
)
1914 fprintf(f
, "(inlined) ");
1915 if (edge
->indirect_inlining_edge
)
1916 fprintf(f
, "(indirect_inlining) ");
1917 if (edge
->can_throw_external
)
1918 fprintf(f
, "(can throw external) ");
1921 fprintf (f
, "\n Calls: ");
1922 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
1924 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->callee
),
1925 edge
->callee
->symbol
.order
);
1926 if (edge
->speculative
)
1927 fprintf(f
, "(speculative) ");
1928 if (!edge
->inline_failed
)
1929 fprintf(f
, "(inlined) ");
1930 if (edge
->indirect_inlining_edge
)
1931 fprintf(f
, "(indirect_inlining) ");
1933 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1934 (HOST_WIDEST_INT
)edge
->count
);
1935 if (edge
->frequency
)
1936 fprintf (f
, "(%.2f per call) ",
1937 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1938 if (edge
->can_throw_external
)
1939 fprintf(f
, "(can throw external) ");
1943 for (edge
= node
->indirect_calls
; edge
; edge
= edge
->next_callee
)
1944 indirect_calls_count
++;
1945 if (indirect_calls_count
)
1946 fprintf (f
, " Has %i outgoing edges for indirect calls.\n",
1947 indirect_calls_count
);
1951 /* Dump call graph node NODE to stderr. */
1954 debug_cgraph_node (struct cgraph_node
*node
)
1956 dump_cgraph_node (stderr
, node
);
1960 /* Dump the callgraph to file F. */
1963 dump_cgraph (FILE *f
)
1965 struct cgraph_node
*node
;
1967 fprintf (f
, "callgraph:\n\n");
1968 FOR_EACH_FUNCTION (node
)
1969 dump_cgraph_node (f
, node
);
1973 /* Dump the call graph to stderr. */
1978 dump_cgraph (stderr
);
1981 /* Return true when the DECL can possibly be inlined. */
1983 cgraph_function_possibly_inlined_p (tree decl
)
1985 if (!cgraph_global_info_ready
)
1986 return !DECL_UNINLINABLE (decl
);
1987 return DECL_POSSIBLY_INLINED (decl
);
1990 /* NODE is no longer nested function; update cgraph accordingly. */
1992 cgraph_unnest_node (struct cgraph_node
*node
)
1994 struct cgraph_node
**node2
= &node
->origin
->nested
;
1995 gcc_assert (node
->origin
);
1997 while (*node2
!= node
)
1998 node2
= &(*node2
)->next_nested
;
1999 *node2
= node
->next_nested
;
2000 node
->origin
= NULL
;
2003 /* Return function availability. See cgraph.h for description of individual
2006 cgraph_function_body_availability (struct cgraph_node
*node
)
2008 enum availability avail
;
2009 if (!node
->symbol
.analyzed
)
2010 avail
= AVAIL_NOT_AVAILABLE
;
2011 else if (node
->local
.local
)
2012 avail
= AVAIL_LOCAL
;
2013 else if (!node
->symbol
.externally_visible
)
2014 avail
= AVAIL_AVAILABLE
;
2015 /* Inline functions are safe to be analyzed even if their symbol can
2016 be overwritten at runtime. It is not meaningful to enforce any sane
2017 behaviour on replacing inline function by different body. */
2018 else if (DECL_DECLARED_INLINE_P (node
->symbol
.decl
))
2019 avail
= AVAIL_AVAILABLE
;
2021 /* If the function can be overwritten, return OVERWRITABLE. Take
2022 care at least of two notable extensions - the COMDAT functions
2023 used to share template instantiations in C++ (this is symmetric
2024 to code cp_cannot_inline_tree_fn and probably shall be shared and
2025 the inlinability hooks completely eliminated).
2027 ??? Does the C++ one definition rule allow us to always return
2028 AVAIL_AVAILABLE here? That would be good reason to preserve this
2031 else if (decl_replaceable_p (node
->symbol
.decl
)
2032 && !DECL_EXTERNAL (node
->symbol
.decl
))
2033 avail
= AVAIL_OVERWRITABLE
;
2034 else avail
= AVAIL_AVAILABLE
;
2039 /* Worker for cgraph_node_can_be_local_p. */
2041 cgraph_node_cannot_be_local_p_1 (struct cgraph_node
*node
,
2042 void *data ATTRIBUTE_UNUSED
)
2044 return !(!node
->symbol
.force_output
2045 && ((DECL_COMDAT (node
->symbol
.decl
)
2046 && !node
->symbol
.forced_by_abi
2047 && !symtab_used_from_object_file_p ((symtab_node
) node
)
2048 && !node
->symbol
.same_comdat_group
)
2049 || !node
->symbol
.externally_visible
));
2052 /* Return true if NODE can be made local for API change.
2053 Extern inline functions and C++ COMDAT functions can be made local
2054 at the expense of possible code size growth if function is used in multiple
2055 compilation units. */
2057 cgraph_node_can_be_local_p (struct cgraph_node
*node
)
2059 return (!node
->symbol
.address_taken
2060 && !cgraph_for_node_and_aliases (node
,
2061 cgraph_node_cannot_be_local_p_1
,
2065 /* Call calback on NODE, thunks and aliases associated to NODE.
2066 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2070 cgraph_for_node_thunks_and_aliases (struct cgraph_node
*node
,
2071 bool (*callback
) (struct cgraph_node
*, void *),
2073 bool include_overwritable
)
2075 struct cgraph_edge
*e
;
2077 struct ipa_ref
*ref
;
2079 if (callback (node
, data
))
2081 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2082 if (e
->caller
->thunk
.thunk_p
2083 && (include_overwritable
2084 || cgraph_function_body_availability (e
->caller
) > AVAIL_OVERWRITABLE
))
2085 if (cgraph_for_node_thunks_and_aliases (e
->caller
, callback
, data
,
2086 include_overwritable
))
2088 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
2089 if (ref
->use
== IPA_REF_ALIAS
)
2091 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
2092 if (include_overwritable
2093 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
2094 if (cgraph_for_node_thunks_and_aliases (alias
, callback
, data
,
2095 include_overwritable
))
2101 /* Call calback on NODE and aliases associated to NODE.
2102 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2106 cgraph_for_node_and_aliases (struct cgraph_node
*node
,
2107 bool (*callback
) (struct cgraph_node
*, void *),
2109 bool include_overwritable
)
2112 struct ipa_ref
*ref
;
2114 if (callback (node
, data
))
2116 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
2117 if (ref
->use
== IPA_REF_ALIAS
)
2119 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
2120 if (include_overwritable
2121 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
2122 if (cgraph_for_node_and_aliases (alias
, callback
, data
,
2123 include_overwritable
))
2129 /* Worker to bring NODE local. */
2132 cgraph_make_node_local_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2134 gcc_checking_assert (cgraph_node_can_be_local_p (node
));
2135 if (DECL_COMDAT (node
->symbol
.decl
) || DECL_EXTERNAL (node
->symbol
.decl
))
2137 symtab_make_decl_local (node
->symbol
.decl
);
2139 node
->symbol
.externally_visible
= false;
2140 node
->symbol
.forced_by_abi
= false;
2141 node
->local
.local
= true;
2142 node
->symbol
.unique_name
= (node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY
2143 || node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2144 node
->symbol
.resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2145 gcc_assert (cgraph_function_body_availability (node
) == AVAIL_LOCAL
);
2150 /* Bring NODE local. */
2153 cgraph_make_node_local (struct cgraph_node
*node
)
2155 cgraph_for_node_thunks_and_aliases (node
, cgraph_make_node_local_1
,
2159 /* Worker to set nothrow flag. */
2162 cgraph_set_nothrow_flag_1 (struct cgraph_node
*node
, void *data
)
2164 struct cgraph_edge
*e
;
2166 TREE_NOTHROW (node
->symbol
.decl
) = data
!= NULL
;
2169 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2170 e
->can_throw_external
= false;
2174 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2175 if any to NOTHROW. */
2178 cgraph_set_nothrow_flag (struct cgraph_node
*node
, bool nothrow
)
2180 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_nothrow_flag_1
,
2181 (void *)(size_t)nothrow
, false);
2184 /* Worker to set const flag. */
2187 cgraph_set_const_flag_1 (struct cgraph_node
*node
, void *data
)
2189 /* Static constructors and destructors without a side effect can be
2191 if (data
&& !((size_t)data
& 2))
2193 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
2194 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
2195 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2196 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
2198 TREE_READONLY (node
->symbol
.decl
) = data
!= NULL
;
2199 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
2203 /* Set TREE_READONLY on NODE's decl and on aliases of NODE
2204 if any to READONLY. */
2207 cgraph_set_const_flag (struct cgraph_node
*node
, bool readonly
, bool looping
)
2209 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_const_flag_1
,
2210 (void *)(size_t)(readonly
+ (int)looping
* 2),
2214 /* Worker to set pure flag. */
2217 cgraph_set_pure_flag_1 (struct cgraph_node
*node
, void *data
)
2219 /* Static constructors and destructors without a side effect can be
2221 if (data
&& !((size_t)data
& 2))
2223 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
2224 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
2225 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2226 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
2228 DECL_PURE_P (node
->symbol
.decl
) = data
!= NULL
;
2229 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
2233 /* Set DECL_PURE_P on NODE's decl and on aliases of NODE
2237 cgraph_set_pure_flag (struct cgraph_node
*node
, bool pure
, bool looping
)
2239 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_pure_flag_1
,
2240 (void *)(size_t)(pure
+ (int)looping
* 2),
2244 /* Data used by cgraph_propagate_frequency. */
2246 struct cgraph_propagate_frequency_data
2248 bool maybe_unlikely_executed
;
2249 bool maybe_executed_once
;
2250 bool only_called_at_startup
;
2251 bool only_called_at_exit
;
2254 /* Worker for cgraph_propagate_frequency_1. */
2257 cgraph_propagate_frequency_1 (struct cgraph_node
*node
, void *data
)
2259 struct cgraph_propagate_frequency_data
*d
;
2260 struct cgraph_edge
*edge
;
2262 d
= (struct cgraph_propagate_frequency_data
*)data
;
2263 for (edge
= node
->callers
;
2264 edge
&& (d
->maybe_unlikely_executed
|| d
->maybe_executed_once
2265 || d
->only_called_at_startup
|| d
->only_called_at_exit
);
2266 edge
= edge
->next_caller
)
2268 if (edge
->caller
!= node
)
2270 d
->only_called_at_startup
&= edge
->caller
->only_called_at_startup
;
2271 /* It makes sense to put main() together with the static constructors.
2272 It will be executed for sure, but rest of functions called from
2273 main are definitely not at startup only. */
2274 if (MAIN_NAME_P (DECL_NAME (edge
->caller
->symbol
.decl
)))
2275 d
->only_called_at_startup
= 0;
2276 d
->only_called_at_exit
&= edge
->caller
->only_called_at_exit
;
2278 if (!edge
->frequency
)
2280 switch (edge
->caller
->frequency
)
2282 case NODE_FREQUENCY_UNLIKELY_EXECUTED
:
2284 case NODE_FREQUENCY_EXECUTED_ONCE
:
2285 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2286 fprintf (dump_file
, " Called by %s that is executed once\n",
2287 cgraph_node_name (edge
->caller
));
2288 d
->maybe_unlikely_executed
= false;
2289 if (inline_edge_summary (edge
)->loop_depth
)
2291 d
->maybe_executed_once
= false;
2292 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2293 fprintf (dump_file
, " Called in loop\n");
2296 case NODE_FREQUENCY_HOT
:
2297 case NODE_FREQUENCY_NORMAL
:
2298 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2299 fprintf (dump_file
, " Called by %s that is normal or hot\n",
2300 cgraph_node_name (edge
->caller
));
2301 d
->maybe_unlikely_executed
= false;
2302 d
->maybe_executed_once
= false;
2306 return edge
!= NULL
;
2309 /* See if the frequency of NODE can be updated based on frequencies of its
2312 cgraph_propagate_frequency (struct cgraph_node
*node
)
2314 struct cgraph_propagate_frequency_data d
= {true, true, true, true};
2315 bool changed
= false;
2317 if (!node
->local
.local
)
2319 gcc_assert (node
->symbol
.analyzed
);
2320 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2321 fprintf (dump_file
, "Processing frequency %s\n", cgraph_node_name (node
));
2323 cgraph_for_node_and_aliases (node
, cgraph_propagate_frequency_1
, &d
, true);
2325 if ((d
.only_called_at_startup
&& !d
.only_called_at_exit
)
2326 && !node
->only_called_at_startup
)
2328 node
->only_called_at_startup
= true;
2330 fprintf (dump_file
, "Node %s promoted to only called at startup.\n",
2331 cgraph_node_name (node
));
2334 if ((d
.only_called_at_exit
&& !d
.only_called_at_startup
)
2335 && !node
->only_called_at_exit
)
2337 node
->only_called_at_exit
= true;
2339 fprintf (dump_file
, "Node %s promoted to only called at exit.\n",
2340 cgraph_node_name (node
));
2343 /* These come either from profile or user hints; never update them. */
2344 if (node
->frequency
== NODE_FREQUENCY_HOT
2345 || node
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2347 if (d
.maybe_unlikely_executed
)
2349 node
->frequency
= NODE_FREQUENCY_UNLIKELY_EXECUTED
;
2351 fprintf (dump_file
, "Node %s promoted to unlikely executed.\n",
2352 cgraph_node_name (node
));
2355 else if (d
.maybe_executed_once
&& node
->frequency
!= NODE_FREQUENCY_EXECUTED_ONCE
)
2357 node
->frequency
= NODE_FREQUENCY_EXECUTED_ONCE
;
2359 fprintf (dump_file
, "Node %s promoted to executed once.\n",
2360 cgraph_node_name (node
));
2366 /* Return true when NODE can not return or throw and thus
2367 it is safe to ignore its side effects for IPA analysis. */
2370 cgraph_node_cannot_return (struct cgraph_node
*node
)
2372 int flags
= flags_from_decl_or_type (node
->symbol
.decl
);
2373 if (!flag_exceptions
)
2374 return (flags
& ECF_NORETURN
) != 0;
2376 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2377 == (ECF_NORETURN
| ECF_NOTHROW
));
2380 /* Return true when call of E can not lead to return from caller
2381 and thus it is safe to ignore its side effects for IPA analysis
2382 when computing side effects of the caller.
2383 FIXME: We could actually mark all edges that have no reaching
2384 patch to EXIT_BLOCK_PTR or throw to get better results. */
2386 cgraph_edge_cannot_lead_to_return (struct cgraph_edge
*e
)
2388 if (cgraph_node_cannot_return (e
->caller
))
2390 if (e
->indirect_unknown_callee
)
2392 int flags
= e
->indirect_info
->ecf_flags
;
2393 if (!flag_exceptions
)
2394 return (flags
& ECF_NORETURN
) != 0;
2396 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2397 == (ECF_NORETURN
| ECF_NOTHROW
));
2400 return cgraph_node_cannot_return (e
->callee
);
2403 /* Return true when function NODE can be removed from callgraph
2404 if all direct calls are eliminated. */
2407 cgraph_can_remove_if_no_direct_calls_and_refs_p (struct cgraph_node
*node
)
2409 gcc_assert (!node
->global
.inlined_to
);
2410 /* Extern inlines can always go, we will use the external definition. */
2411 if (DECL_EXTERNAL (node
->symbol
.decl
))
2413 /* When function is needed, we can not remove it. */
2414 if (node
->symbol
.force_output
|| node
->symbol
.used_from_other_partition
)
2416 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
)
2417 || DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2419 /* Only COMDAT functions can be removed if externally visible. */
2420 if (node
->symbol
.externally_visible
2421 && (!DECL_COMDAT (node
->symbol
.decl
)
2422 || node
->symbol
.forced_by_abi
2423 || symtab_used_from_object_file_p ((symtab_node
) node
)))
2428 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2431 nonremovable_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2433 return !cgraph_can_remove_if_no_direct_calls_and_refs_p (node
);
2436 /* Return true when function NODE and its aliases can be removed from callgraph
2437 if all direct calls are eliminated. */
2440 cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node
*node
)
2442 /* Extern inlines can always go, we will use the external definition. */
2443 if (DECL_EXTERNAL (node
->symbol
.decl
))
2445 if (node
->symbol
.address_taken
)
2447 return !cgraph_for_node_and_aliases (node
, nonremovable_p
, NULL
, true);
2450 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2453 used_from_object_file_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2455 return symtab_used_from_object_file_p ((symtab_node
) node
);
2458 /* Return true when function NODE can be expected to be removed
2459 from program when direct calls in this compilation unit are removed.
2461 As a special case COMDAT functions are
2462 cgraph_can_remove_if_no_direct_calls_p while the are not
2463 cgraph_only_called_directly_p (it is possible they are called from other
2466 This function behaves as cgraph_only_called_directly_p because eliminating
2467 all uses of COMDAT function does not make it necessarily disappear from
2468 the program unless we are compiling whole program or we do LTO. In this
2469 case we know we win since dynamic linking will not really discard the
2470 linkonce section. */
2473 cgraph_will_be_removed_from_program_if_no_direct_calls (struct cgraph_node
*node
)
2475 gcc_assert (!node
->global
.inlined_to
);
2476 if (cgraph_for_node_and_aliases (node
, used_from_object_file_p
, NULL
, true))
2478 if (!in_lto_p
&& !flag_whole_program
)
2479 return cgraph_only_called_directly_p (node
);
2482 if (DECL_EXTERNAL (node
->symbol
.decl
))
2484 return cgraph_can_remove_if_no_direct_calls_p (node
);
2489 /* Worker for cgraph_only_called_directly_p. */
2492 cgraph_not_only_called_directly_p_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2494 return !cgraph_only_called_directly_or_aliased_p (node
);
2497 /* Return true when function NODE and all its aliases are only called
2499 i.e. it is not externally visible, address was not taken and
2500 it is not used in any other non-standard way. */
2503 cgraph_only_called_directly_p (struct cgraph_node
*node
)
2505 gcc_assert (cgraph_function_or_thunk_node (node
, NULL
) == node
);
2506 return !cgraph_for_node_and_aliases (node
, cgraph_not_only_called_directly_p_1
,
2511 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2514 collect_callers_of_node_1 (struct cgraph_node
*node
, void *data
)
2516 vec
<cgraph_edge_p
> *redirect_callers
= (vec
<cgraph_edge_p
> *)data
;
2517 struct cgraph_edge
*cs
;
2518 enum availability avail
;
2519 cgraph_function_or_thunk_node (node
, &avail
);
2521 if (avail
> AVAIL_OVERWRITABLE
)
2522 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2523 if (!cs
->indirect_inlining_edge
)
2524 redirect_callers
->safe_push (cs
);
2528 /* Collect all callers of NODE and its aliases that are known to lead to NODE
2529 (i.e. are not overwritable). */
2532 collect_callers_of_node (struct cgraph_node
*node
)
2534 vec
<cgraph_edge_p
> redirect_callers
= vNULL
;
2535 cgraph_for_node_and_aliases (node
, collect_callers_of_node_1
,
2536 &redirect_callers
, false);
2537 return redirect_callers
;
2540 /* Return TRUE if NODE2 is equivalent to NODE or its clone. */
2542 clone_of_p (struct cgraph_node
*node
, struct cgraph_node
*node2
)
2544 node
= cgraph_function_or_thunk_node (node
, NULL
);
2545 node2
= cgraph_function_or_thunk_node (node2
, NULL
);
2546 while (node
!= node2
&& node2
)
2547 node2
= node2
->clone_of
;
2548 return node2
!= NULL
;
2551 /* Verify edge E count and frequency. */
2554 verify_edge_count_and_frequency (struct cgraph_edge
*e
)
2556 bool error_found
= false;
2559 error ("caller edge count is negative");
2562 if (e
->frequency
< 0)
2564 error ("caller edge frequency is negative");
2567 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2569 error ("caller edge frequency is too large");
2572 if (gimple_has_body_p (e
->caller
->symbol
.decl
)
2573 && !e
->caller
->global
.inlined_to
2575 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2576 Remove this once edges are actually removed from the function at that time. */
2578 || (inline_edge_summary_vec
.exists ()
2579 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2580 || !inline_edge_summary (e
)->predicate
)))
2582 != compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2583 gimple_bb (e
->call_stmt
))))
2585 error ("caller edge frequency %i does not match BB frequency %i",
2587 compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2588 gimple_bb (e
->call_stmt
)));
2594 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2596 cgraph_debug_gimple_stmt (struct function
*this_cfun
, gimple stmt
)
2598 bool fndecl_was_null
= false;
2599 /* debug_gimple_stmt needs correct cfun */
2600 if (cfun
!= this_cfun
)
2601 set_cfun (this_cfun
);
2602 /* ...and an actual current_function_decl */
2603 if (!current_function_decl
)
2605 current_function_decl
= this_cfun
->decl
;
2606 fndecl_was_null
= true;
2608 debug_gimple_stmt (stmt
);
2609 if (fndecl_was_null
)
2610 current_function_decl
= NULL
;
2613 /* Verify that call graph edge E corresponds to DECL from the associated
2614 statement. Return true if the verification should fail. */
2617 verify_edge_corresponds_to_fndecl (struct cgraph_edge
*e
, tree decl
)
2619 struct cgraph_node
*node
;
2621 if (!decl
|| e
->callee
->global
.inlined_to
)
2623 if (cgraph_state
== CGRAPH_LTO_STREAMING
)
2625 node
= cgraph_get_node (decl
);
2627 /* We do not know if a node from a different partition is an alias or what it
2628 aliases and therefore cannot do the former_clone_of check reliably. */
2629 if (!node
|| node
->symbol
.in_other_partition
|| e
->callee
->symbol
.in_other_partition
)
2631 node
= cgraph_function_or_thunk_node (node
, NULL
);
2633 if (e
->callee
->former_clone_of
!= node
->symbol
.decl
2634 /* IPA-CP sometimes redirect edge to clone and then back to the former
2635 function. This ping-pong has to go, eventually. */
2636 && (node
!= cgraph_function_or_thunk_node (e
->callee
, NULL
))
2637 && !clone_of_p (cgraph_function_or_thunk_node (node
, NULL
), e
->callee
))
2643 /* Verify cgraph nodes of given cgraph node. */
2645 verify_cgraph_node (struct cgraph_node
*node
)
2647 struct cgraph_edge
*e
;
2648 struct function
*this_cfun
= DECL_STRUCT_FUNCTION (node
->symbol
.decl
);
2649 basic_block this_block
;
2650 gimple_stmt_iterator gsi
;
2651 bool error_found
= false;
2656 timevar_push (TV_CGRAPH_VERIFY
);
2657 error_found
|= verify_symtab_base ((symtab_node
) node
);
2658 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2661 error ("aux field set for edge %s->%s",
2662 identifier_to_locale (cgraph_node_name (e
->caller
)),
2663 identifier_to_locale (cgraph_node_name (e
->callee
)));
2666 if (node
->count
< 0)
2668 error ("execution count is negative");
2671 if (node
->global
.inlined_to
&& node
->symbol
.same_comdat_group
)
2673 error ("inline clone in same comdat group list");
2676 if (!node
->symbol
.definition
&& !node
->symbol
.in_other_partition
&& node
->local
.local
)
2678 error ("local symbols must be defined");
2681 if (node
->global
.inlined_to
&& node
->symbol
.externally_visible
)
2683 error ("externally visible inline clone");
2686 if (node
->global
.inlined_to
&& node
->symbol
.address_taken
)
2688 error ("inline clone with address taken");
2691 if (node
->global
.inlined_to
&& node
->symbol
.force_output
)
2693 error ("inline clone is forced to output");
2696 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2700 error ("aux field set for indirect edge from %s",
2701 identifier_to_locale (cgraph_node_name (e
->caller
)));
2704 if (!e
->indirect_unknown_callee
2705 || !e
->indirect_info
)
2707 error ("An indirect edge from %s is not marked as indirect or has "
2708 "associated indirect_info, the corresponding statement is: ",
2709 identifier_to_locale (cgraph_node_name (e
->caller
)));
2710 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2714 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2716 if (verify_edge_count_and_frequency (e
))
2718 if (!e
->inline_failed
)
2720 if (node
->global
.inlined_to
2721 != (e
->caller
->global
.inlined_to
2722 ? e
->caller
->global
.inlined_to
: e
->caller
))
2724 error ("inlined_to pointer is wrong");
2727 if (node
->callers
->next_caller
)
2729 error ("multiple inline callers");
2734 if (node
->global
.inlined_to
)
2736 error ("inlined_to pointer set for noninline callers");
2740 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2741 if (verify_edge_count_and_frequency (e
))
2743 if (!node
->callers
&& node
->global
.inlined_to
)
2745 error ("inlined_to pointer is set but no predecessors found");
2748 if (node
->global
.inlined_to
== node
)
2750 error ("inlined_to pointer refers to itself");
2756 struct cgraph_node
*n
;
2757 for (n
= node
->clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2762 error ("node has wrong clone_of");
2768 struct cgraph_node
*n
;
2769 for (n
= node
->clones
; n
; n
= n
->next_sibling_clone
)
2770 if (n
->clone_of
!= node
)
2774 error ("node has wrong clone list");
2778 if ((node
->prev_sibling_clone
|| node
->next_sibling_clone
) && !node
->clone_of
)
2780 error ("node is in clone list but it is not clone");
2783 if (!node
->prev_sibling_clone
&& node
->clone_of
&& node
->clone_of
->clones
!= node
)
2785 error ("node has wrong prev_clone pointer");
2788 if (node
->prev_sibling_clone
&& node
->prev_sibling_clone
->next_sibling_clone
!= node
)
2790 error ("double linked list of clones corrupted");
2794 if (node
->symbol
.analyzed
&& node
->symbol
.alias
)
2796 bool ref_found
= false;
2798 struct ipa_ref
*ref
;
2802 error ("Alias has call edges");
2805 for (i
= 0; ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
,
2807 if (ref
->use
!= IPA_REF_ALIAS
)
2809 error ("Alias has non-alias reference");
2814 error ("Alias has more than one alias reference");
2821 error ("Analyzed alias has no reference");
2825 if (node
->symbol
.analyzed
&& node
->thunk
.thunk_p
)
2829 error ("No edge out of thunk node");
2832 else if (node
->callees
->next_callee
)
2834 error ("More than one edge out of thunk node");
2837 if (gimple_has_body_p (node
->symbol
.decl
))
2839 error ("Thunk is not supposed to have body");
2843 else if (node
->symbol
.analyzed
&& gimple_has_body_p (node
->symbol
.decl
)
2844 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)
2845 && (!DECL_EXTERNAL (node
->symbol
.decl
) || node
->global
.inlined_to
)
2850 pointer_set_t
*stmts
= pointer_set_create ();
2852 struct ipa_ref
*ref
;
2854 /* Reach the trees by walking over the CFG, and note the
2855 enclosing basic-blocks in the call edges. */
2856 FOR_EACH_BB_FN (this_block
, this_cfun
)
2858 for (gsi
= gsi_start_phis (this_block
);
2859 !gsi_end_p (gsi
); gsi_next (&gsi
))
2860 pointer_set_insert (stmts
, gsi_stmt (gsi
));
2861 for (gsi
= gsi_start_bb (this_block
);
2865 gimple stmt
= gsi_stmt (gsi
);
2866 pointer_set_insert (stmts
, stmt
);
2867 if (is_gimple_call (stmt
))
2869 struct cgraph_edge
*e
= cgraph_edge (node
, stmt
);
2870 tree decl
= gimple_call_fndecl (stmt
);
2875 error ("shared call_stmt:");
2876 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2879 if (!e
->indirect_unknown_callee
)
2881 if (verify_edge_corresponds_to_fndecl (e
, decl
))
2883 error ("edge points to wrong declaration:");
2884 debug_tree (e
->callee
->symbol
.decl
);
2885 fprintf (stderr
," Instead of:");
2892 error ("an indirect edge with unknown callee "
2893 "corresponding to a call_stmt with "
2894 "a known declaration:");
2896 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2902 error ("missing callgraph edge for call stmt:");
2903 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2910 ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
, i
, ref
);
2912 if (ref
->stmt
&& !pointer_set_contains (stmts
, ref
->stmt
))
2914 error ("reference to dead statement");
2915 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
2918 pointer_set_destroy (stmts
);
2921 /* No CFG available?! */
2924 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2928 error ("edge %s->%s has no corresponding call_stmt",
2929 identifier_to_locale (cgraph_node_name (e
->caller
)),
2930 identifier_to_locale (cgraph_node_name (e
->callee
)));
2931 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2936 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2938 if (!e
->aux
&& !e
->speculative
)
2940 error ("an indirect edge from %s has no corresponding call_stmt",
2941 identifier_to_locale (cgraph_node_name (e
->caller
)));
2942 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2950 dump_cgraph_node (stderr
, node
);
2951 internal_error ("verify_cgraph_node failed");
2953 timevar_pop (TV_CGRAPH_VERIFY
);
2956 /* Verify whole cgraph structure. */
2958 verify_cgraph (void)
2960 struct cgraph_node
*node
;
2965 FOR_EACH_FUNCTION (node
)
2966 verify_cgraph_node (node
);
2969 /* Create external decl node for DECL.
2970 The difference i nbetween cgraph_get_create_node and
2971 cgraph_get_create_real_symbol_node is that cgraph_get_create_node
2972 may return inline clone, while cgraph_get_create_real_symbol_node
2973 will create a new node in this case.
2974 FIXME: This function should be removed once clones are put out of decl
2977 struct cgraph_node
*
2978 cgraph_get_create_real_symbol_node (tree decl
)
2980 struct cgraph_node
*first_clone
= cgraph_get_node (decl
);
2981 struct cgraph_node
*node
;
2982 /* create symbol table node. even if inline clone exists, we can not take
2983 it as a target of non-inlined call. */
2984 node
= cgraph_get_node (decl
);
2985 if (node
&& !node
->global
.inlined_to
)
2988 node
= cgraph_create_node (decl
);
2990 /* ok, we previously inlined the function, then removed the offline copy and
2991 now we want it back for external call. this can happen when devirtualizing
2992 while inlining function called once that happens after extern inlined and
2993 virtuals are already removed. in this case introduce the external node
2994 and make it available for call. */
2997 first_clone
->clone_of
= node
;
2998 node
->clones
= first_clone
;
2999 symtab_prevail_in_asm_name_hash ((symtab_node
) node
);
3000 symtab_insert_node_to_hashtable ((symtab_node
) node
);
3002 fprintf (dump_file
, "Introduced new external node "
3003 "(%s/%i) and turned into root of the clone tree.\n",
3004 xstrdup (cgraph_node_name (node
)), node
->symbol
.order
);
3007 fprintf (dump_file
, "Introduced new external node "
3008 "(%s/%i).\n", xstrdup (cgraph_node_name (node
)),
3009 node
->symbol
.order
);
3014 /* Given NODE, walk the alias chain to return the function NODE is alias of.
3015 Walk through thunk, too.
3016 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3018 struct cgraph_node
*
3019 cgraph_function_node (struct cgraph_node
*node
, enum availability
*availability
)
3023 node
= cgraph_function_or_thunk_node (node
, availability
);
3024 if (node
->thunk
.thunk_p
)
3026 node
= node
->callees
->callee
;
3029 enum availability a
;
3030 a
= cgraph_function_body_availability (node
);
3031 if (a
< *availability
)
3034 node
= cgraph_function_or_thunk_node (node
, availability
);
3036 } while (node
&& node
->thunk
.thunk_p
);
3040 /* When doing LTO, read NODE's body from disk if it is not already present. */
3043 cgraph_get_body (struct cgraph_node
*node
)
3045 struct lto_file_decl_data
*file_data
;
3046 const char *data
, *name
;
3048 tree decl
= node
->symbol
.decl
;
3050 if (DECL_RESULT (decl
))
3053 gcc_assert (in_lto_p
);
3055 file_data
= node
->symbol
.lto_file_data
;
3056 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3058 /* We may have renamed the declaration, e.g., a static function. */
3059 name
= lto_get_decl_name_mapping (file_data
, name
);
3061 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3065 dump_cgraph_node (stderr
, node
);
3066 fatal_error ("%s: section %s is missing",
3067 file_data
->file_name
,
3071 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3073 lto_input_function_body (file_data
, decl
, data
);
3074 lto_stats
.num_function_bodies
++;
3075 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3080 #include "gt-cgraph.h"