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
);
708 gcc_assert (!*slot
|| e
->speculative
);
712 /* Return the callgraph edge representing the GIMPLE_CALL statement
716 cgraph_edge (struct cgraph_node
*node
, gimple call_stmt
)
718 struct cgraph_edge
*e
, *e2
;
721 if (node
->call_site_hash
)
722 return (struct cgraph_edge
*)
723 htab_find_with_hash (node
->call_site_hash
, call_stmt
,
724 htab_hash_pointer (call_stmt
));
726 /* This loop may turn out to be performance problem. In such case adding
727 hashtables into call nodes with very many edges is probably best
728 solution. It is not good idea to add pointer into CALL_EXPR itself
729 because we want to make possible having multiple cgraph nodes representing
730 different clones of the same body before the body is actually cloned. */
731 for (e
= node
->callees
; e
; e
= e
->next_callee
)
733 if (e
->call_stmt
== call_stmt
)
739 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
741 if (e
->call_stmt
== call_stmt
)
748 node
->call_site_hash
= htab_create_ggc (120, edge_hash
, edge_eq
, NULL
);
749 for (e2
= node
->callees
; e2
; e2
= e2
->next_callee
)
750 cgraph_add_edge_to_call_site_hash (e2
);
751 for (e2
= node
->indirect_calls
; e2
; e2
= e2
->next_callee
)
752 cgraph_add_edge_to_call_site_hash (e2
);
759 /* Change field call_stmt of edge E to NEW_STMT.
760 If UPDATE_SPECULATIVE and E is any component of speculative
761 edge, then update all components. */
764 cgraph_set_call_stmt (struct cgraph_edge
*e
, gimple new_stmt
,
765 bool update_speculative
)
769 /* Speculative edges has three component, update all of them
771 if (update_speculative
&& e
->speculative
)
773 struct cgraph_edge
*direct
, *indirect
;
776 cgraph_speculative_call_info (e
, direct
, indirect
, ref
);
777 cgraph_set_call_stmt (direct
, new_stmt
, false);
778 cgraph_set_call_stmt (indirect
, new_stmt
, false);
779 ref
->stmt
= new_stmt
;
783 /* Only direct speculative edges go to call_site_hash. */
784 if (e
->caller
->call_site_hash
785 && (!e
->speculative
|| !e
->indirect_unknown_callee
))
787 htab_remove_elt_with_hash (e
->caller
->call_site_hash
,
789 htab_hash_pointer (e
->call_stmt
));
792 e
->call_stmt
= new_stmt
;
793 if (e
->indirect_unknown_callee
794 && (decl
= gimple_call_fndecl (new_stmt
)))
796 /* Constant propagation (and possibly also inlining?) can turn an
797 indirect call into a direct one. */
798 struct cgraph_node
*new_callee
= cgraph_get_node (decl
);
800 gcc_checking_assert (new_callee
);
801 e
= cgraph_make_edge_direct (e
, new_callee
);
804 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->symbol
.decl
));
805 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
807 if (e
->caller
->call_site_hash
)
808 cgraph_add_edge_to_call_site_hash (e
);
811 /* Allocate a cgraph_edge structure and fill it with data according to the
812 parameters of which only CALLEE can be NULL (when creating an indirect call
815 static struct cgraph_edge
*
816 cgraph_create_edge_1 (struct cgraph_node
*caller
, struct cgraph_node
*callee
,
817 gimple call_stmt
, gcov_type count
, int freq
)
819 struct cgraph_edge
*edge
;
821 /* LTO does not actually have access to the call_stmt since these
822 have not been loaded yet. */
825 /* This is a rather expensive check possibly triggering
826 construction of call stmt hashtable. */
827 #ifdef ENABLE_CHECKING
828 struct cgraph_edge
*e
;
829 gcc_checking_assert (!(e
=cgraph_edge (caller
, call_stmt
)) || e
->speculative
);
832 gcc_assert (is_gimple_call (call_stmt
));
838 free_edges
= NEXT_FREE_EDGE (edge
);
842 edge
= ggc_alloc_cgraph_edge ();
843 edge
->uid
= cgraph_edge_max_uid
++;
847 edge
->caller
= caller
;
848 edge
->callee
= callee
;
849 edge
->prev_caller
= NULL
;
850 edge
->next_caller
= NULL
;
851 edge
->prev_callee
= NULL
;
852 edge
->next_callee
= NULL
;
853 edge
->lto_stmt_uid
= 0;
856 gcc_assert (count
>= 0);
857 edge
->frequency
= freq
;
858 gcc_assert (freq
>= 0);
859 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
861 edge
->call_stmt
= call_stmt
;
862 push_cfun (DECL_STRUCT_FUNCTION (caller
->symbol
.decl
));
863 edge
->can_throw_external
864 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
867 && callee
&& callee
->symbol
.decl
868 && !gimple_check_call_matching_types (call_stmt
, callee
->symbol
.decl
,
870 edge
->call_stmt_cannot_inline_p
= true;
872 edge
->call_stmt_cannot_inline_p
= false;
873 if (call_stmt
&& caller
->call_site_hash
)
874 cgraph_add_edge_to_call_site_hash (edge
);
876 edge
->indirect_info
= NULL
;
877 edge
->indirect_inlining_edge
= 0;
878 edge
->speculative
= false;
883 /* Create edge from CALLER to CALLEE in the cgraph. */
886 cgraph_create_edge (struct cgraph_node
*caller
, struct cgraph_node
*callee
,
887 gimple call_stmt
, gcov_type count
, int freq
)
889 struct cgraph_edge
*edge
= cgraph_create_edge_1 (caller
, callee
, call_stmt
,
892 edge
->indirect_unknown_callee
= 0;
893 initialize_inline_failed (edge
);
895 edge
->next_caller
= callee
->callers
;
897 callee
->callers
->prev_caller
= edge
;
898 edge
->next_callee
= caller
->callees
;
900 caller
->callees
->prev_callee
= edge
;
901 caller
->callees
= edge
;
902 callee
->callers
= edge
;
907 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
909 struct cgraph_indirect_call_info
*
910 cgraph_allocate_init_indirect_info (void)
912 struct cgraph_indirect_call_info
*ii
;
914 ii
= ggc_alloc_cleared_cgraph_indirect_call_info ();
915 ii
->param_index
= -1;
919 /* Create an indirect edge with a yet-undetermined callee where the call
920 statement destination is a formal parameter of the caller with index
924 cgraph_create_indirect_edge (struct cgraph_node
*caller
, gimple call_stmt
,
926 gcov_type count
, int freq
)
928 struct cgraph_edge
*edge
= cgraph_create_edge_1 (caller
, NULL
, call_stmt
,
932 edge
->indirect_unknown_callee
= 1;
933 initialize_inline_failed (edge
);
935 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
936 edge
->indirect_info
->ecf_flags
= ecf_flags
;
938 /* Record polymorphic call info. */
940 && (target
= gimple_call_fn (call_stmt
))
941 && virtual_method_call_p (target
))
943 tree type
= obj_type_ref_class (target
);
946 /* Only record types can have virtual calls. */
947 gcc_assert (TREE_CODE (type
) == RECORD_TYPE
);
948 edge
->indirect_info
->param_index
= -1;
949 edge
->indirect_info
->otr_token
950 = tree_low_cst (OBJ_TYPE_REF_TOKEN (target
), 1);
951 edge
->indirect_info
->otr_type
= type
;
952 edge
->indirect_info
->polymorphic
= 1;
955 edge
->next_callee
= caller
->indirect_calls
;
956 if (caller
->indirect_calls
)
957 caller
->indirect_calls
->prev_callee
= edge
;
958 caller
->indirect_calls
= edge
;
963 /* Remove the edge E from the list of the callers of the callee. */
966 cgraph_edge_remove_callee (struct cgraph_edge
*e
)
968 gcc_assert (!e
->indirect_unknown_callee
);
970 e
->prev_caller
->next_caller
= e
->next_caller
;
972 e
->next_caller
->prev_caller
= e
->prev_caller
;
974 e
->callee
->callers
= e
->next_caller
;
977 /* Remove the edge E from the list of the callees of the caller. */
980 cgraph_edge_remove_caller (struct cgraph_edge
*e
)
983 e
->prev_callee
->next_callee
= e
->next_callee
;
985 e
->next_callee
->prev_callee
= e
->prev_callee
;
988 if (e
->indirect_unknown_callee
)
989 e
->caller
->indirect_calls
= e
->next_callee
;
991 e
->caller
->callees
= e
->next_callee
;
993 if (e
->caller
->call_site_hash
)
994 htab_remove_elt_with_hash (e
->caller
->call_site_hash
,
996 htab_hash_pointer (e
->call_stmt
));
999 /* Put the edge onto the free list. */
1002 cgraph_free_edge (struct cgraph_edge
*e
)
1006 if (e
->indirect_info
)
1007 ggc_free (e
->indirect_info
);
1009 /* Clear out the edge so we do not dangle pointers. */
1010 memset (e
, 0, sizeof (*e
));
1012 NEXT_FREE_EDGE (e
) = free_edges
;
1016 /* Remove the edge E in the cgraph. */
1019 cgraph_remove_edge (struct cgraph_edge
*e
)
1021 /* Call all edge removal hooks. */
1022 cgraph_call_edge_removal_hooks (e
);
1024 if (!e
->indirect_unknown_callee
)
1025 /* Remove from callers list of the callee. */
1026 cgraph_edge_remove_callee (e
);
1028 /* Remove from callees list of the callers. */
1029 cgraph_edge_remove_caller (e
);
1031 /* Put the edge onto the free list. */
1032 cgraph_free_edge (e
);
1035 /* Set callee of call graph edge E and add it to the corresponding set of
1039 cgraph_set_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
1041 e
->prev_caller
= NULL
;
1043 n
->callers
->prev_caller
= e
;
1044 e
->next_caller
= n
->callers
;
1049 /* Turn edge E into speculative call calling N2. Update
1050 the profile so the direct call is taken COUNT times
1053 At clone materialization time, the indirect call E will
1056 if (call_dest == N2)
1061 At this time the function just creates the direct call,
1062 the referencd representing the if conditional and attaches
1063 them all to the orginal indirect call statement.
1065 Return direct edge created. */
1067 struct cgraph_edge
*
1068 cgraph_turn_edge_to_speculative (struct cgraph_edge
*e
,
1069 struct cgraph_node
*n2
,
1070 gcov_type direct_count
,
1071 int direct_frequency
)
1073 struct cgraph_node
*n
= e
->caller
;
1074 struct ipa_ref
*ref
;
1075 struct cgraph_edge
*e2
;
1079 fprintf (dump_file
, "Indirect call -> speculative call"
1080 " %s/%i => %s/%i\n",
1081 xstrdup (cgraph_node_name (n
)), n
->symbol
.order
,
1082 xstrdup (cgraph_node_name (n2
)), n2
->symbol
.order
);
1084 e
->speculative
= true;
1085 e2
= cgraph_create_edge (n
, n2
, e
->call_stmt
, direct_count
, direct_frequency
);
1086 initialize_inline_failed (e2
);
1087 e2
->speculative
= true;
1088 if (TREE_NOTHROW (n2
->symbol
.decl
))
1089 e2
->can_throw_external
= false;
1091 e2
->can_throw_external
= e
->can_throw_external
;
1092 e2
->lto_stmt_uid
= e
->lto_stmt_uid
;
1093 e
->count
-= e2
->count
;
1094 e
->frequency
-= e2
->frequency
;
1095 cgraph_call_edge_duplication_hooks (e
, e2
);
1096 ref
= ipa_record_reference ((symtab_node
)n
, (symtab_node
)n2
,
1097 IPA_REF_ADDR
, e
->call_stmt
);
1098 ref
->lto_stmt_uid
= e
->lto_stmt_uid
;
1099 ref
->speculative
= e
->speculative
;
1100 cgraph_mark_address_taken_node (n2
);
1104 /* Speculative call consist of three components:
1105 1) an indirect edge representing the original call
1106 2) an direct edge representing the new call
1107 3) ADDR_EXPR reference representing the speculative check.
1108 All three components are attached to single statement (the indirect
1109 call) and if one of them exists, all of them must exist.
1111 Given speculative call edge E, return all three components.
1115 cgraph_speculative_call_info (struct cgraph_edge
*e
,
1116 struct cgraph_edge
*&indirect
,
1117 struct cgraph_edge
*&direct
,
1118 struct ipa_ref
*&reference
)
1120 struct ipa_ref
*ref
;
1122 struct cgraph_edge
*e2
;
1124 if (!e
->indirect_unknown_callee
)
1125 for (e2
= e
->caller
->indirect_calls
;
1126 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1127 e2
= e2
->next_callee
)
1132 /* We can take advantage of the call stmt hash. */
1135 e
= cgraph_edge (e
->caller
, e2
->call_stmt
);
1136 gcc_assert (e
->speculative
&& !e
->indirect_unknown_callee
);
1139 for (e
= e
->caller
->callees
;
1140 e2
->call_stmt
!= e
->call_stmt
|| e2
->lto_stmt_uid
!= e
->lto_stmt_uid
;
1144 gcc_assert (e
->speculative
&& e2
->speculative
);
1149 for (i
= 0; ipa_ref_list_reference_iterate (&e
->caller
->symbol
.ref_list
, i
, ref
); i
++)
1150 if (ref
->speculative
1151 && ((ref
->stmt
&& ref
->stmt
== e
->call_stmt
)
1152 || (ref
->lto_stmt_uid
== e
->lto_stmt_uid
)))
1159 /* Redirect callee of E to N. The function does not update underlying
1163 cgraph_redirect_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
1165 /* Remove from callers list of the current callee. */
1166 cgraph_edge_remove_callee (e
);
1168 /* Insert to callers list of the new callee. */
1169 cgraph_set_edge_callee (e
, n
);
1172 /* Speculative call EDGE turned out to be direct call to CALLE_DECL.
1173 Remove the speculative call sequence and return edge representing the call.
1174 It is up to caller to redirect the call as appropriate. */
1176 struct cgraph_edge
*
1177 cgraph_resolve_speculation (struct cgraph_edge
*edge
, tree callee_decl
)
1179 struct cgraph_edge
*e2
;
1180 struct ipa_ref
*ref
;
1182 gcc_assert (edge
->speculative
);
1183 cgraph_speculative_call_info (edge
, e2
, edge
, ref
);
1184 if (ref
->referred
->symbol
.decl
!= callee_decl
)
1190 fprintf (dump_file
, "Speculative indirect call %s/%i => %s/%i has "
1191 "turned out to have contradicting known target ",
1192 xstrdup (cgraph_node_name (edge
->caller
)), edge
->caller
->symbol
.order
,
1193 xstrdup (cgraph_node_name (e2
->callee
)), e2
->callee
->symbol
.order
);
1194 print_generic_expr (dump_file
, callee_decl
, 0);
1195 fprintf (dump_file
, "\n");
1199 fprintf (dump_file
, "Removing speculative call %s/%i => %s/%i\n",
1200 xstrdup (cgraph_node_name (edge
->caller
)), edge
->caller
->symbol
.order
,
1201 xstrdup (cgraph_node_name (e2
->callee
)), e2
->callee
->symbol
.order
);
1207 struct cgraph_edge
*tmp
= edge
;
1209 fprintf (dump_file
, "Speculative call turned into direct call.\n");
1213 edge
->count
+= e2
->count
;
1214 edge
->frequency
+= e2
->frequency
;
1215 if (edge
->frequency
> CGRAPH_FREQ_MAX
)
1216 edge
->frequency
= CGRAPH_FREQ_MAX
;
1217 edge
->speculative
= false;
1218 e2
->speculative
= false;
1219 if (e2
->indirect_unknown_callee
|| e2
->inline_failed
)
1220 cgraph_remove_edge (e2
);
1222 cgraph_remove_node_and_inline_clones (e2
->callee
, NULL
);
1223 if (edge
->caller
->call_site_hash
)
1224 cgraph_update_edge_in_call_site_hash (edge
);
1225 ipa_remove_reference (ref
);
1229 /* Make an indirect EDGE with an unknown callee an ordinary edge leading to
1230 CALLEE. DELTA is an integer constant that is to be added to the this
1231 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1233 struct cgraph_edge
*
1234 cgraph_make_edge_direct (struct cgraph_edge
*edge
, struct cgraph_node
*callee
)
1236 gcc_assert (edge
->indirect_unknown_callee
);
1238 /* If we are redirecting speculative call, make it non-speculative. */
1239 if (edge
->indirect_unknown_callee
&& edge
->speculative
)
1241 edge
= cgraph_resolve_speculation (edge
, callee
->symbol
.decl
);
1243 /* On successful speculation just return the pre existing direct edge. */
1244 if (!edge
->indirect_unknown_callee
)
1248 edge
->indirect_unknown_callee
= 0;
1249 ggc_free (edge
->indirect_info
);
1250 edge
->indirect_info
= NULL
;
1252 /* Get the edge out of the indirect edge list. */
1253 if (edge
->prev_callee
)
1254 edge
->prev_callee
->next_callee
= edge
->next_callee
;
1255 if (edge
->next_callee
)
1256 edge
->next_callee
->prev_callee
= edge
->prev_callee
;
1257 if (!edge
->prev_callee
)
1258 edge
->caller
->indirect_calls
= edge
->next_callee
;
1260 /* Put it into the normal callee list */
1261 edge
->prev_callee
= NULL
;
1262 edge
->next_callee
= edge
->caller
->callees
;
1263 if (edge
->caller
->callees
)
1264 edge
->caller
->callees
->prev_callee
= edge
;
1265 edge
->caller
->callees
= edge
;
1267 /* Insert to callers list of the new callee. */
1268 cgraph_set_edge_callee (edge
, callee
);
1270 if (edge
->call_stmt
)
1271 edge
->call_stmt_cannot_inline_p
1272 = !gimple_check_call_matching_types (edge
->call_stmt
, callee
->symbol
.decl
,
1275 /* We need to re-determine the inlining status of the edge. */
1276 initialize_inline_failed (edge
);
1280 /* If necessary, change the function declaration in the call statement
1281 associated with E so that it corresponds to the edge callee. */
1284 cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge
*e
)
1286 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1288 gimple_stmt_iterator gsi
;
1289 #ifdef ENABLE_CHECKING
1290 struct cgraph_node
*node
;
1295 struct cgraph_edge
*e2
;
1297 struct ipa_ref
*ref
;
1299 cgraph_speculative_call_info (e
, e
, e2
, ref
);
1300 /* If there already is an direct call (i.e. as a result of inliner's substitution),
1301 forget about speculating. */
1303 e
= cgraph_resolve_speculation (e
, decl
);
1304 /* If types do not match, speculation was likely wrong. */
1305 else if (!gimple_check_call_matching_types (e
->call_stmt
, e
->callee
->symbol
.decl
,
1308 e
= cgraph_resolve_speculation (e
, NULL
);
1310 fprintf (dump_file
, "Not expanding speculative call of %s/%i -> %s/%i\n"
1312 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1313 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
);
1315 /* Expand speculation into GIMPLE code. */
1319 fprintf (dump_file
, "Expanding speculative call of %s/%i -> %s/%i count:"
1320 HOST_WIDEST_INT_PRINT_DEC
"\n",
1321 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1322 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
,
1323 (HOST_WIDEST_INT
)e
->count
);
1324 gcc_assert (e2
->speculative
);
1325 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->symbol
.decl
));
1326 new_stmt
= gimple_ic (e
->call_stmt
, cgraph (ref
->referred
),
1327 e
->count
|| e2
->count
1328 ? RDIV (e
->count
* REG_BR_PROB_BASE
,
1329 e
->count
+ e2
->count
)
1330 : e
->frequency
|| e2
->frequency
1331 ? RDIV (e
->frequency
* REG_BR_PROB_BASE
,
1332 e
->frequency
+ e2
->frequency
)
1333 : REG_BR_PROB_BASE
/ 2,
1334 e
->count
, e
->count
+ e2
->count
);
1335 e
->speculative
= false;
1336 cgraph_set_call_stmt_including_clones (e
->caller
, e
->call_stmt
, new_stmt
, false);
1337 e
->frequency
= compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
1338 gimple_bb (e
->call_stmt
));
1339 e2
->frequency
= compute_call_stmt_bb_frequency (e2
->caller
->symbol
.decl
,
1340 gimple_bb (e2
->call_stmt
));
1341 e2
->speculative
= false;
1342 ref
->speculative
= false;
1344 /* Indirect edges are not both in the call site hash.
1346 if (e
->caller
->call_site_hash
)
1347 cgraph_update_edge_in_call_site_hash (e2
);
1349 /* Continue redirecting E to proper target. */
1353 if (e
->indirect_unknown_callee
1354 || decl
== e
->callee
->symbol
.decl
)
1355 return e
->call_stmt
;
1357 #ifdef ENABLE_CHECKING
1360 node
= cgraph_get_node (decl
);
1361 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1365 if (cgraph_dump_file
)
1367 fprintf (cgraph_dump_file
, "updating call of %s/%i -> %s/%i: ",
1368 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1369 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
);
1370 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1371 if (e
->callee
->clone
.combined_args_to_skip
)
1373 fprintf (cgraph_dump_file
, " combined args to skip: ");
1374 dump_bitmap (cgraph_dump_file
,
1375 e
->callee
->clone
.combined_args_to_skip
);
1379 if (e
->callee
->clone
.combined_args_to_skip
)
1384 = gimple_call_copy_skip_args (e
->call_stmt
,
1385 e
->callee
->clone
.combined_args_to_skip
);
1386 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1387 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1389 if (gimple_vdef (new_stmt
)
1390 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1391 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1393 gsi
= gsi_for_stmt (e
->call_stmt
);
1394 gsi_replace (&gsi
, new_stmt
, false);
1395 /* We need to defer cleaning EH info on the new statement to
1396 fixup-cfg. We may not have dominator information at this point
1397 and thus would end up with unreachable blocks and have no way
1398 to communicate that we need to run CFG cleanup then. */
1399 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1402 remove_stmt_from_eh_lp (e
->call_stmt
);
1403 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1408 new_stmt
= e
->call_stmt
;
1409 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1410 update_stmt (new_stmt
);
1413 cgraph_set_call_stmt_including_clones (e
->caller
, e
->call_stmt
, new_stmt
, false);
1415 if (cgraph_dump_file
)
1417 fprintf (cgraph_dump_file
, " updated to:");
1418 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1423 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1424 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1425 of OLD_STMT if it was previously call statement.
1426 If NEW_STMT is NULL, the call has been dropped without any
1430 cgraph_update_edges_for_call_stmt_node (struct cgraph_node
*node
,
1431 gimple old_stmt
, tree old_call
,
1434 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1435 ? gimple_call_fndecl (new_stmt
) : 0;
1437 /* We are seeing indirect calls, then there is nothing to update. */
1438 if (!new_call
&& !old_call
)
1440 /* See if we turned indirect call into direct call or folded call to one builtin
1441 into different builtin. */
1442 if (old_call
!= new_call
)
1444 struct cgraph_edge
*e
= cgraph_edge (node
, old_stmt
);
1445 struct cgraph_edge
*ne
= NULL
;
1451 /* See if the edge is already there and has the correct callee. It
1452 might be so because of indirect inlining has already updated
1453 it. We also might've cloned and redirected the edge. */
1454 if (new_call
&& e
->callee
)
1456 struct cgraph_node
*callee
= e
->callee
;
1459 if (callee
->symbol
.decl
== new_call
1460 || callee
->former_clone_of
== new_call
)
1462 callee
= callee
->clone_of
;
1466 /* Otherwise remove edge and create new one; we can't simply redirect
1467 since function has changed, so inline plan and other information
1468 attached to edge is invalid. */
1470 frequency
= e
->frequency
;
1471 cgraph_remove_edge (e
);
1475 /* We are seeing new direct call; compute profile info based on BB. */
1476 basic_block bb
= gimple_bb (new_stmt
);
1478 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1484 ne
= cgraph_create_edge (node
, cgraph_get_create_node (new_call
),
1485 new_stmt
, count
, frequency
);
1486 gcc_assert (ne
->inline_failed
);
1489 /* We only updated the call stmt; update pointer in cgraph edge.. */
1490 else if (old_stmt
!= new_stmt
)
1491 cgraph_set_call_stmt (cgraph_edge (node
, old_stmt
), new_stmt
);
1494 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1495 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1496 of OLD_STMT before it was updated (updating can happen inplace). */
1499 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1501 struct cgraph_node
*orig
= cgraph_get_node (cfun
->decl
);
1502 struct cgraph_node
*node
;
1504 gcc_checking_assert (orig
);
1505 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1507 for (node
= orig
->clones
; node
!= orig
;)
1509 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1511 node
= node
->clones
;
1512 else if (node
->next_sibling_clone
)
1513 node
= node
->next_sibling_clone
;
1516 while (node
!= orig
&& !node
->next_sibling_clone
)
1517 node
= node
->clone_of
;
1519 node
= node
->next_sibling_clone
;
1525 /* Remove all callees from the node. */
1528 cgraph_node_remove_callees (struct cgraph_node
*node
)
1530 struct cgraph_edge
*e
, *f
;
1532 /* It is sufficient to remove the edges from the lists of callers of
1533 the callees. The callee list of the node can be zapped with one
1535 for (e
= node
->callees
; e
; e
= f
)
1538 cgraph_call_edge_removal_hooks (e
);
1539 if (!e
->indirect_unknown_callee
)
1540 cgraph_edge_remove_callee (e
);
1541 cgraph_free_edge (e
);
1543 for (e
= node
->indirect_calls
; e
; e
= f
)
1546 cgraph_call_edge_removal_hooks (e
);
1547 if (!e
->indirect_unknown_callee
)
1548 cgraph_edge_remove_callee (e
);
1549 cgraph_free_edge (e
);
1551 node
->indirect_calls
= NULL
;
1552 node
->callees
= NULL
;
1553 if (node
->call_site_hash
)
1555 htab_delete (node
->call_site_hash
);
1556 node
->call_site_hash
= NULL
;
1560 /* Remove all callers from the node. */
1563 cgraph_node_remove_callers (struct cgraph_node
*node
)
1565 struct cgraph_edge
*e
, *f
;
1567 /* It is sufficient to remove the edges from the lists of callees of
1568 the callers. The caller list of the node can be zapped with one
1570 for (e
= node
->callers
; e
; e
= f
)
1573 cgraph_call_edge_removal_hooks (e
);
1574 cgraph_edge_remove_caller (e
);
1575 cgraph_free_edge (e
);
1577 node
->callers
= NULL
;
1580 /* Helper function for cgraph_release_function_body and free_lang_data.
1581 It releases body from function DECL without having to inspect its
1582 possibly non-existent symtab node. */
1585 release_function_body (tree decl
)
1587 if (DECL_STRUCT_FUNCTION (decl
))
1589 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1593 cfun
->curr_properties
&= ~PROP_loops
;
1594 loop_optimizer_finalize ();
1596 if (cfun
->gimple_df
)
1599 delete_tree_cfg_annotations ();
1604 gcc_assert (dom_computed
[0] == DOM_NONE
);
1605 gcc_assert (dom_computed
[1] == DOM_NONE
);
1609 if (cfun
->value_histograms
)
1612 gimple_set_body (decl
, NULL
);
1613 /* Struct function hangs a lot of data that would leak if we didn't
1614 removed all pointers to it. */
1615 ggc_free (DECL_STRUCT_FUNCTION (decl
));
1616 DECL_STRUCT_FUNCTION (decl
) = NULL
;
1618 DECL_SAVED_TREE (decl
) = NULL
;
1621 /* Release memory used to represent body of function NODE.
1622 Use this only for functions that are released before being translated to
1623 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1624 are free'd in final.c via free_after_compilation(). */
1627 cgraph_release_function_body (struct cgraph_node
*node
)
1629 node
->ipa_transforms_to_apply
.release ();
1630 if (!node
->used_as_abstract_origin
&& cgraph_state
!= CGRAPH_STATE_PARSING
)
1632 DECL_RESULT (node
->symbol
.decl
) = NULL
;
1633 DECL_ARGUMENTS (node
->symbol
.decl
) = NULL
;
1635 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1636 of its associated function function declaration because it's
1637 needed to emit debug info later. */
1638 if (!node
->used_as_abstract_origin
&& DECL_INITIAL (node
->symbol
.decl
))
1639 DECL_INITIAL (node
->symbol
.decl
) = error_mark_node
;
1640 release_function_body (node
->symbol
.decl
);
1643 /* Remove the node from cgraph. */
1646 cgraph_remove_node (struct cgraph_node
*node
)
1648 struct cgraph_node
*n
;
1649 int uid
= node
->uid
;
1651 cgraph_call_node_removal_hooks (node
);
1652 cgraph_node_remove_callers (node
);
1653 cgraph_node_remove_callees (node
);
1654 node
->ipa_transforms_to_apply
.release ();
1656 /* Incremental inlining access removed nodes stored in the postorder list.
1658 node
->symbol
.force_output
= false;
1659 node
->symbol
.forced_by_abi
= false;
1660 for (n
= node
->nested
; n
; n
= n
->next_nested
)
1662 node
->nested
= NULL
;
1665 struct cgraph_node
**node2
= &node
->origin
->nested
;
1667 while (*node2
!= node
)
1668 node2
= &(*node2
)->next_nested
;
1669 *node2
= node
->next_nested
;
1671 symtab_unregister_node ((symtab_node
)node
);
1672 if (node
->prev_sibling_clone
)
1673 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
1674 else if (node
->clone_of
)
1675 node
->clone_of
->clones
= node
->next_sibling_clone
;
1676 if (node
->next_sibling_clone
)
1677 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
1680 struct cgraph_node
*n
, *next
;
1684 for (n
= node
->clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1685 n
->clone_of
= node
->clone_of
;
1686 n
->clone_of
= node
->clone_of
;
1687 n
->next_sibling_clone
= node
->clone_of
->clones
;
1688 if (node
->clone_of
->clones
)
1689 node
->clone_of
->clones
->prev_sibling_clone
= n
;
1690 node
->clone_of
->clones
= node
->clones
;
1694 /* We are removing node with clones. This makes clones inconsistent,
1695 but assume they will be removed subsequently and just keep clone
1696 tree intact. This can happen in unreachable function removal since
1697 we remove unreachable functions in random order, not by bottom-up
1698 walk of clone trees. */
1699 for (n
= node
->clones
; n
; n
= next
)
1701 next
= n
->next_sibling_clone
;
1702 n
->next_sibling_clone
= NULL
;
1703 n
->prev_sibling_clone
= NULL
;
1709 /* While all the clones are removed after being proceeded, the function
1710 itself is kept in the cgraph even after it is compiled. Check whether
1711 we are done with this body and reclaim it proactively if this is the case.
1713 if (cgraph_state
!= CGRAPH_LTO_STREAMING
)
1715 n
= cgraph_get_node (node
->symbol
.decl
);
1717 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1718 && (cgraph_global_info_ready
1719 && (TREE_ASM_WRITTEN (n
->symbol
.decl
)
1720 || DECL_EXTERNAL (n
->symbol
.decl
)
1721 || !n
->symbol
.analyzed
1722 || (!flag_wpa
&& n
->symbol
.in_other_partition
)))))
1723 cgraph_release_function_body (node
);
1726 node
->symbol
.decl
= NULL
;
1727 if (node
->call_site_hash
)
1729 htab_delete (node
->call_site_hash
);
1730 node
->call_site_hash
= NULL
;
1734 /* Clear out the node to NULL all pointers and add the node to the free
1736 memset (node
, 0, sizeof(*node
));
1737 node
->symbol
.type
= SYMTAB_FUNCTION
;
1739 SET_NEXT_FREE_NODE (node
, free_nodes
);
1743 /* Likewise indicate that a node is having address taken. */
1746 cgraph_mark_address_taken_node (struct cgraph_node
*node
)
1748 /* Indirect inlining can figure out that all uses of the address are
1750 if (node
->global
.inlined_to
)
1752 gcc_assert (cfun
->after_inlining
);
1753 gcc_assert (node
->callers
->indirect_inlining_edge
);
1756 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1757 IPA_REF_ADDR reference exists (and thus it should be set on node
1758 representing alias we take address of) and as a test whether address
1759 of the object was taken (and thus it should be set on node alias is
1760 referring to). We should remove the first use and the remove the
1762 node
->symbol
.address_taken
= 1;
1763 node
= cgraph_function_or_thunk_node (node
, NULL
);
1764 node
->symbol
.address_taken
= 1;
1767 /* Return local info for the compiled function. */
1769 struct cgraph_local_info
*
1770 cgraph_local_info (tree decl
)
1772 struct cgraph_node
*node
;
1774 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1775 node
= cgraph_get_node (decl
);
1778 return &node
->local
;
1781 /* Return local info for the compiled function. */
1783 struct cgraph_global_info
*
1784 cgraph_global_info (tree decl
)
1786 struct cgraph_node
*node
;
1788 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
&& cgraph_global_info_ready
);
1789 node
= cgraph_get_node (decl
);
1792 return &node
->global
;
1795 /* Return local info for the compiled function. */
1797 struct cgraph_rtl_info
*
1798 cgraph_rtl_info (tree decl
)
1800 struct cgraph_node
*node
;
1802 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1803 node
= cgraph_get_node (decl
);
1805 || (decl
!= current_function_decl
1806 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)))
1811 /* Return a string describing the failure REASON. */
1814 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1817 #define DEFCIFCODE(code, string) string,
1819 static const char *cif_string_table
[CIF_N_REASONS
] = {
1820 #include "cif-code.def"
1823 /* Signedness of an enum type is implementation defined, so cast it
1824 to unsigned before testing. */
1825 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1826 return cif_string_table
[reason
];
1829 /* Names used to print out the availability enum. */
1830 const char * const cgraph_availability_names
[] =
1831 {"unset", "not_available", "overwritable", "available", "local"};
1834 /* Dump call graph node NODE to file F. */
1837 dump_cgraph_node (FILE *f
, struct cgraph_node
*node
)
1839 struct cgraph_edge
*edge
;
1840 int indirect_calls_count
= 0;
1842 dump_symtab_base (f
, (symtab_node
) node
);
1844 if (node
->global
.inlined_to
)
1845 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1846 xstrdup (cgraph_node_name (node
)),
1848 xstrdup (cgraph_node_name (node
->global
.inlined_to
)),
1849 node
->global
.inlined_to
->symbol
.order
);
1851 fprintf (f
, " Clone of %s/%i\n",
1852 cgraph_node_asm_name (node
->clone_of
),
1853 node
->clone_of
->symbol
.order
);
1854 if (cgraph_function_flags_ready
)
1855 fprintf (f
, " Availability: %s\n",
1856 cgraph_availability_names
[cgraph_function_body_availability (node
)]);
1858 if (node
->profile_id
)
1859 fprintf (f
, " Profile id: %i\n",
1861 fprintf (f
, " Function flags:");
1863 fprintf (f
, " executed "HOST_WIDEST_INT_PRINT_DEC
"x",
1864 (HOST_WIDEST_INT
)node
->count
);
1866 fprintf (f
, " nested in: %s", cgraph_node_asm_name (node
->origin
));
1867 if (gimple_has_body_p (node
->symbol
.decl
))
1868 fprintf (f
, " body");
1870 fprintf (f
, " process");
1871 if (node
->local
.local
)
1872 fprintf (f
, " local");
1873 if (node
->local
.redefined_extern_inline
)
1874 fprintf (f
, " redefined_extern_inline");
1875 if (node
->only_called_at_startup
)
1876 fprintf (f
, " only_called_at_startup");
1877 if (node
->only_called_at_exit
)
1878 fprintf (f
, " only_called_at_exit");
1880 fprintf (f
, " tm_clone");
1884 if (node
->thunk
.thunk_p
)
1886 fprintf (f
, " Thunk");
1887 if (node
->thunk
.alias
)
1888 fprintf (f
, " of %s (asm: %s)",
1889 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2),
1890 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)));
1891 fprintf (f
, " fixed offset %i virtual value %i has "
1892 "virtual offset %i)\n",
1893 (int)node
->thunk
.fixed_offset
,
1894 (int)node
->thunk
.virtual_value
,
1895 (int)node
->thunk
.virtual_offset_p
);
1897 if (node
->symbol
.alias
&& node
->thunk
.alias
1898 && DECL_P (node
->thunk
.alias
))
1900 fprintf (f
, " Alias of %s",
1901 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2));
1902 if (DECL_ASSEMBLER_NAME_SET_P (node
->thunk
.alias
))
1903 fprintf (f
, " (asm: %s)",
1904 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)));
1908 fprintf (f
, " Called by: ");
1910 for (edge
= node
->callers
; edge
; edge
= edge
->next_caller
)
1912 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->caller
),
1913 edge
->caller
->symbol
.order
);
1915 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1916 (HOST_WIDEST_INT
)edge
->count
);
1917 if (edge
->frequency
)
1918 fprintf (f
, "(%.2f per call) ",
1919 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1920 if (edge
->speculative
)
1921 fprintf(f
, "(speculative) ");
1922 if (!edge
->inline_failed
)
1923 fprintf(f
, "(inlined) ");
1924 if (edge
->indirect_inlining_edge
)
1925 fprintf(f
, "(indirect_inlining) ");
1926 if (edge
->can_throw_external
)
1927 fprintf(f
, "(can throw external) ");
1930 fprintf (f
, "\n Calls: ");
1931 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
1933 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->callee
),
1934 edge
->callee
->symbol
.order
);
1935 if (edge
->speculative
)
1936 fprintf(f
, "(speculative) ");
1937 if (!edge
->inline_failed
)
1938 fprintf(f
, "(inlined) ");
1939 if (edge
->indirect_inlining_edge
)
1940 fprintf(f
, "(indirect_inlining) ");
1942 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1943 (HOST_WIDEST_INT
)edge
->count
);
1944 if (edge
->frequency
)
1945 fprintf (f
, "(%.2f per call) ",
1946 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1947 if (edge
->can_throw_external
)
1948 fprintf(f
, "(can throw external) ");
1952 for (edge
= node
->indirect_calls
; edge
; edge
= edge
->next_callee
)
1953 indirect_calls_count
++;
1954 if (indirect_calls_count
)
1955 fprintf (f
, " Has %i outgoing edges for indirect calls.\n",
1956 indirect_calls_count
);
1960 /* Dump call graph node NODE to stderr. */
1963 debug_cgraph_node (struct cgraph_node
*node
)
1965 dump_cgraph_node (stderr
, node
);
1969 /* Dump the callgraph to file F. */
1972 dump_cgraph (FILE *f
)
1974 struct cgraph_node
*node
;
1976 fprintf (f
, "callgraph:\n\n");
1977 FOR_EACH_FUNCTION (node
)
1978 dump_cgraph_node (f
, node
);
1982 /* Dump the call graph to stderr. */
1987 dump_cgraph (stderr
);
1990 /* Return true when the DECL can possibly be inlined. */
1992 cgraph_function_possibly_inlined_p (tree decl
)
1994 if (!cgraph_global_info_ready
)
1995 return !DECL_UNINLINABLE (decl
);
1996 return DECL_POSSIBLY_INLINED (decl
);
1999 /* NODE is no longer nested function; update cgraph accordingly. */
2001 cgraph_unnest_node (struct cgraph_node
*node
)
2003 struct cgraph_node
**node2
= &node
->origin
->nested
;
2004 gcc_assert (node
->origin
);
2006 while (*node2
!= node
)
2007 node2
= &(*node2
)->next_nested
;
2008 *node2
= node
->next_nested
;
2009 node
->origin
= NULL
;
2012 /* Return function availability. See cgraph.h for description of individual
2015 cgraph_function_body_availability (struct cgraph_node
*node
)
2017 enum availability avail
;
2018 if (!node
->symbol
.analyzed
)
2019 avail
= AVAIL_NOT_AVAILABLE
;
2020 else if (node
->local
.local
)
2021 avail
= AVAIL_LOCAL
;
2022 else if (!node
->symbol
.externally_visible
)
2023 avail
= AVAIL_AVAILABLE
;
2024 /* Inline functions are safe to be analyzed even if their symbol can
2025 be overwritten at runtime. It is not meaningful to enforce any sane
2026 behaviour on replacing inline function by different body. */
2027 else if (DECL_DECLARED_INLINE_P (node
->symbol
.decl
))
2028 avail
= AVAIL_AVAILABLE
;
2030 /* If the function can be overwritten, return OVERWRITABLE. Take
2031 care at least of two notable extensions - the COMDAT functions
2032 used to share template instantiations in C++ (this is symmetric
2033 to code cp_cannot_inline_tree_fn and probably shall be shared and
2034 the inlinability hooks completely eliminated).
2036 ??? Does the C++ one definition rule allow us to always return
2037 AVAIL_AVAILABLE here? That would be good reason to preserve this
2040 else if (decl_replaceable_p (node
->symbol
.decl
)
2041 && !DECL_EXTERNAL (node
->symbol
.decl
))
2042 avail
= AVAIL_OVERWRITABLE
;
2043 else avail
= AVAIL_AVAILABLE
;
2048 /* Worker for cgraph_node_can_be_local_p. */
2050 cgraph_node_cannot_be_local_p_1 (struct cgraph_node
*node
,
2051 void *data ATTRIBUTE_UNUSED
)
2053 return !(!node
->symbol
.force_output
2054 && ((DECL_COMDAT (node
->symbol
.decl
)
2055 && !node
->symbol
.forced_by_abi
2056 && !symtab_used_from_object_file_p ((symtab_node
) node
)
2057 && !node
->symbol
.same_comdat_group
)
2058 || !node
->symbol
.externally_visible
));
2061 /* Return true if NODE can be made local for API change.
2062 Extern inline functions and C++ COMDAT functions can be made local
2063 at the expense of possible code size growth if function is used in multiple
2064 compilation units. */
2066 cgraph_node_can_be_local_p (struct cgraph_node
*node
)
2068 return (!node
->symbol
.address_taken
2069 && !cgraph_for_node_and_aliases (node
,
2070 cgraph_node_cannot_be_local_p_1
,
2074 /* Call calback on NODE, thunks and aliases associated to NODE.
2075 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2079 cgraph_for_node_thunks_and_aliases (struct cgraph_node
*node
,
2080 bool (*callback
) (struct cgraph_node
*, void *),
2082 bool include_overwritable
)
2084 struct cgraph_edge
*e
;
2086 struct ipa_ref
*ref
;
2088 if (callback (node
, data
))
2090 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2091 if (e
->caller
->thunk
.thunk_p
2092 && (include_overwritable
2093 || cgraph_function_body_availability (e
->caller
) > AVAIL_OVERWRITABLE
))
2094 if (cgraph_for_node_thunks_and_aliases (e
->caller
, callback
, data
,
2095 include_overwritable
))
2097 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
2098 if (ref
->use
== IPA_REF_ALIAS
)
2100 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
2101 if (include_overwritable
2102 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
2103 if (cgraph_for_node_thunks_and_aliases (alias
, callback
, data
,
2104 include_overwritable
))
2110 /* Call calback on NODE and aliases associated to NODE.
2111 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2115 cgraph_for_node_and_aliases (struct cgraph_node
*node
,
2116 bool (*callback
) (struct cgraph_node
*, void *),
2118 bool include_overwritable
)
2121 struct ipa_ref
*ref
;
2123 if (callback (node
, data
))
2125 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
2126 if (ref
->use
== IPA_REF_ALIAS
)
2128 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
2129 if (include_overwritable
2130 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
2131 if (cgraph_for_node_and_aliases (alias
, callback
, data
,
2132 include_overwritable
))
2138 /* Worker to bring NODE local. */
2141 cgraph_make_node_local_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2143 gcc_checking_assert (cgraph_node_can_be_local_p (node
));
2144 if (DECL_COMDAT (node
->symbol
.decl
) || DECL_EXTERNAL (node
->symbol
.decl
))
2146 symtab_make_decl_local (node
->symbol
.decl
);
2148 node
->symbol
.externally_visible
= false;
2149 node
->symbol
.forced_by_abi
= false;
2150 node
->local
.local
= true;
2151 node
->symbol
.unique_name
= (node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY
2152 || node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
2153 node
->symbol
.resolution
= LDPR_PREVAILING_DEF_IRONLY
;
2154 gcc_assert (cgraph_function_body_availability (node
) == AVAIL_LOCAL
);
2159 /* Bring NODE local. */
2162 cgraph_make_node_local (struct cgraph_node
*node
)
2164 cgraph_for_node_thunks_and_aliases (node
, cgraph_make_node_local_1
,
2168 /* Worker to set nothrow flag. */
2171 cgraph_set_nothrow_flag_1 (struct cgraph_node
*node
, void *data
)
2173 struct cgraph_edge
*e
;
2175 TREE_NOTHROW (node
->symbol
.decl
) = data
!= NULL
;
2178 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2179 e
->can_throw_external
= false;
2183 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2184 if any to NOTHROW. */
2187 cgraph_set_nothrow_flag (struct cgraph_node
*node
, bool nothrow
)
2189 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_nothrow_flag_1
,
2190 (void *)(size_t)nothrow
, false);
2193 /* Worker to set const flag. */
2196 cgraph_set_const_flag_1 (struct cgraph_node
*node
, void *data
)
2198 /* Static constructors and destructors without a side effect can be
2200 if (data
&& !((size_t)data
& 2))
2202 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
2203 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
2204 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2205 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
2207 TREE_READONLY (node
->symbol
.decl
) = data
!= NULL
;
2208 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
2212 /* Set TREE_READONLY on NODE's decl and on aliases of NODE
2213 if any to READONLY. */
2216 cgraph_set_const_flag (struct cgraph_node
*node
, bool readonly
, bool looping
)
2218 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_const_flag_1
,
2219 (void *)(size_t)(readonly
+ (int)looping
* 2),
2223 /* Worker to set pure flag. */
2226 cgraph_set_pure_flag_1 (struct cgraph_node
*node
, void *data
)
2228 /* Static constructors and destructors without a side effect can be
2230 if (data
&& !((size_t)data
& 2))
2232 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
2233 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
2234 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2235 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
2237 DECL_PURE_P (node
->symbol
.decl
) = data
!= NULL
;
2238 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
2242 /* Set DECL_PURE_P on NODE's decl and on aliases of NODE
2246 cgraph_set_pure_flag (struct cgraph_node
*node
, bool pure
, bool looping
)
2248 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_pure_flag_1
,
2249 (void *)(size_t)(pure
+ (int)looping
* 2),
2253 /* Data used by cgraph_propagate_frequency. */
2255 struct cgraph_propagate_frequency_data
2257 bool maybe_unlikely_executed
;
2258 bool maybe_executed_once
;
2259 bool only_called_at_startup
;
2260 bool only_called_at_exit
;
2263 /* Worker for cgraph_propagate_frequency_1. */
2266 cgraph_propagate_frequency_1 (struct cgraph_node
*node
, void *data
)
2268 struct cgraph_propagate_frequency_data
*d
;
2269 struct cgraph_edge
*edge
;
2271 d
= (struct cgraph_propagate_frequency_data
*)data
;
2272 for (edge
= node
->callers
;
2273 edge
&& (d
->maybe_unlikely_executed
|| d
->maybe_executed_once
2274 || d
->only_called_at_startup
|| d
->only_called_at_exit
);
2275 edge
= edge
->next_caller
)
2277 if (edge
->caller
!= node
)
2279 d
->only_called_at_startup
&= edge
->caller
->only_called_at_startup
;
2280 /* It makes sense to put main() together with the static constructors.
2281 It will be executed for sure, but rest of functions called from
2282 main are definitely not at startup only. */
2283 if (MAIN_NAME_P (DECL_NAME (edge
->caller
->symbol
.decl
)))
2284 d
->only_called_at_startup
= 0;
2285 d
->only_called_at_exit
&= edge
->caller
->only_called_at_exit
;
2287 if (!edge
->frequency
)
2289 switch (edge
->caller
->frequency
)
2291 case NODE_FREQUENCY_UNLIKELY_EXECUTED
:
2293 case NODE_FREQUENCY_EXECUTED_ONCE
:
2294 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2295 fprintf (dump_file
, " Called by %s that is executed once\n",
2296 cgraph_node_name (edge
->caller
));
2297 d
->maybe_unlikely_executed
= false;
2298 if (inline_edge_summary (edge
)->loop_depth
)
2300 d
->maybe_executed_once
= false;
2301 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2302 fprintf (dump_file
, " Called in loop\n");
2305 case NODE_FREQUENCY_HOT
:
2306 case NODE_FREQUENCY_NORMAL
:
2307 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2308 fprintf (dump_file
, " Called by %s that is normal or hot\n",
2309 cgraph_node_name (edge
->caller
));
2310 d
->maybe_unlikely_executed
= false;
2311 d
->maybe_executed_once
= false;
2315 return edge
!= NULL
;
2318 /* See if the frequency of NODE can be updated based on frequencies of its
2321 cgraph_propagate_frequency (struct cgraph_node
*node
)
2323 struct cgraph_propagate_frequency_data d
= {true, true, true, true};
2324 bool changed
= false;
2326 if (!node
->local
.local
)
2328 gcc_assert (node
->symbol
.analyzed
);
2329 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2330 fprintf (dump_file
, "Processing frequency %s\n", cgraph_node_name (node
));
2332 cgraph_for_node_and_aliases (node
, cgraph_propagate_frequency_1
, &d
, true);
2334 if ((d
.only_called_at_startup
&& !d
.only_called_at_exit
)
2335 && !node
->only_called_at_startup
)
2337 node
->only_called_at_startup
= true;
2339 fprintf (dump_file
, "Node %s promoted to only called at startup.\n",
2340 cgraph_node_name (node
));
2343 if ((d
.only_called_at_exit
&& !d
.only_called_at_startup
)
2344 && !node
->only_called_at_exit
)
2346 node
->only_called_at_exit
= true;
2348 fprintf (dump_file
, "Node %s promoted to only called at exit.\n",
2349 cgraph_node_name (node
));
2352 /* These come either from profile or user hints; never update them. */
2353 if (node
->frequency
== NODE_FREQUENCY_HOT
2354 || node
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2356 if (d
.maybe_unlikely_executed
)
2358 node
->frequency
= NODE_FREQUENCY_UNLIKELY_EXECUTED
;
2360 fprintf (dump_file
, "Node %s promoted to unlikely executed.\n",
2361 cgraph_node_name (node
));
2364 else if (d
.maybe_executed_once
&& node
->frequency
!= NODE_FREQUENCY_EXECUTED_ONCE
)
2366 node
->frequency
= NODE_FREQUENCY_EXECUTED_ONCE
;
2368 fprintf (dump_file
, "Node %s promoted to executed once.\n",
2369 cgraph_node_name (node
));
2375 /* Return true when NODE can not return or throw and thus
2376 it is safe to ignore its side effects for IPA analysis. */
2379 cgraph_node_cannot_return (struct cgraph_node
*node
)
2381 int flags
= flags_from_decl_or_type (node
->symbol
.decl
);
2382 if (!flag_exceptions
)
2383 return (flags
& ECF_NORETURN
) != 0;
2385 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2386 == (ECF_NORETURN
| ECF_NOTHROW
));
2389 /* Return true when call of E can not lead to return from caller
2390 and thus it is safe to ignore its side effects for IPA analysis
2391 when computing side effects of the caller.
2392 FIXME: We could actually mark all edges that have no reaching
2393 patch to EXIT_BLOCK_PTR or throw to get better results. */
2395 cgraph_edge_cannot_lead_to_return (struct cgraph_edge
*e
)
2397 if (cgraph_node_cannot_return (e
->caller
))
2399 if (e
->indirect_unknown_callee
)
2401 int flags
= e
->indirect_info
->ecf_flags
;
2402 if (!flag_exceptions
)
2403 return (flags
& ECF_NORETURN
) != 0;
2405 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2406 == (ECF_NORETURN
| ECF_NOTHROW
));
2409 return cgraph_node_cannot_return (e
->callee
);
2412 /* Return true when function NODE can be removed from callgraph
2413 if all direct calls are eliminated. */
2416 cgraph_can_remove_if_no_direct_calls_and_refs_p (struct cgraph_node
*node
)
2418 gcc_assert (!node
->global
.inlined_to
);
2419 /* Extern inlines can always go, we will use the external definition. */
2420 if (DECL_EXTERNAL (node
->symbol
.decl
))
2422 /* When function is needed, we can not remove it. */
2423 if (node
->symbol
.force_output
|| node
->symbol
.used_from_other_partition
)
2425 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
)
2426 || DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2428 /* Only COMDAT functions can be removed if externally visible. */
2429 if (node
->symbol
.externally_visible
2430 && (!DECL_COMDAT (node
->symbol
.decl
)
2431 || node
->symbol
.forced_by_abi
2432 || symtab_used_from_object_file_p ((symtab_node
) node
)))
2437 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2440 nonremovable_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2442 return !cgraph_can_remove_if_no_direct_calls_and_refs_p (node
);
2445 /* Return true when function NODE and its aliases can be removed from callgraph
2446 if all direct calls are eliminated. */
2449 cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node
*node
)
2451 /* Extern inlines can always go, we will use the external definition. */
2452 if (DECL_EXTERNAL (node
->symbol
.decl
))
2454 if (node
->symbol
.address_taken
)
2456 return !cgraph_for_node_and_aliases (node
, nonremovable_p
, NULL
, true);
2459 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2462 used_from_object_file_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2464 return symtab_used_from_object_file_p ((symtab_node
) node
);
2467 /* Return true when function NODE can be expected to be removed
2468 from program when direct calls in this compilation unit are removed.
2470 As a special case COMDAT functions are
2471 cgraph_can_remove_if_no_direct_calls_p while the are not
2472 cgraph_only_called_directly_p (it is possible they are called from other
2475 This function behaves as cgraph_only_called_directly_p because eliminating
2476 all uses of COMDAT function does not make it necessarily disappear from
2477 the program unless we are compiling whole program or we do LTO. In this
2478 case we know we win since dynamic linking will not really discard the
2479 linkonce section. */
2482 cgraph_will_be_removed_from_program_if_no_direct_calls (struct cgraph_node
*node
)
2484 gcc_assert (!node
->global
.inlined_to
);
2485 if (cgraph_for_node_and_aliases (node
, used_from_object_file_p
, NULL
, true))
2487 if (!in_lto_p
&& !flag_whole_program
)
2488 return cgraph_only_called_directly_p (node
);
2491 if (DECL_EXTERNAL (node
->symbol
.decl
))
2493 return cgraph_can_remove_if_no_direct_calls_p (node
);
2498 /* Worker for cgraph_only_called_directly_p. */
2501 cgraph_not_only_called_directly_p_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2503 return !cgraph_only_called_directly_or_aliased_p (node
);
2506 /* Return true when function NODE and all its aliases are only called
2508 i.e. it is not externally visible, address was not taken and
2509 it is not used in any other non-standard way. */
2512 cgraph_only_called_directly_p (struct cgraph_node
*node
)
2514 gcc_assert (cgraph_function_or_thunk_node (node
, NULL
) == node
);
2515 return !cgraph_for_node_and_aliases (node
, cgraph_not_only_called_directly_p_1
,
2520 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2523 collect_callers_of_node_1 (struct cgraph_node
*node
, void *data
)
2525 vec
<cgraph_edge_p
> *redirect_callers
= (vec
<cgraph_edge_p
> *)data
;
2526 struct cgraph_edge
*cs
;
2527 enum availability avail
;
2528 cgraph_function_or_thunk_node (node
, &avail
);
2530 if (avail
> AVAIL_OVERWRITABLE
)
2531 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2532 if (!cs
->indirect_inlining_edge
)
2533 redirect_callers
->safe_push (cs
);
2537 /* Collect all callers of NODE and its aliases that are known to lead to NODE
2538 (i.e. are not overwritable). */
2541 collect_callers_of_node (struct cgraph_node
*node
)
2543 vec
<cgraph_edge_p
> redirect_callers
= vNULL
;
2544 cgraph_for_node_and_aliases (node
, collect_callers_of_node_1
,
2545 &redirect_callers
, false);
2546 return redirect_callers
;
2549 /* Return TRUE if NODE2 is equivalent to NODE or its clone. */
2551 clone_of_p (struct cgraph_node
*node
, struct cgraph_node
*node2
)
2553 node
= cgraph_function_or_thunk_node (node
, NULL
);
2554 node2
= cgraph_function_or_thunk_node (node2
, NULL
);
2555 while (node
!= node2
&& node2
)
2556 node2
= node2
->clone_of
;
2557 return node2
!= NULL
;
2560 /* Verify edge E count and frequency. */
2563 verify_edge_count_and_frequency (struct cgraph_edge
*e
)
2565 bool error_found
= false;
2568 error ("caller edge count is negative");
2571 if (e
->frequency
< 0)
2573 error ("caller edge frequency is negative");
2576 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2578 error ("caller edge frequency is too large");
2581 if (gimple_has_body_p (e
->caller
->symbol
.decl
)
2582 && !e
->caller
->global
.inlined_to
2584 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2585 Remove this once edges are actually removed from the function at that time. */
2587 || (inline_edge_summary_vec
.exists ()
2588 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2589 || !inline_edge_summary (e
)->predicate
)))
2591 != compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2592 gimple_bb (e
->call_stmt
))))
2594 error ("caller edge frequency %i does not match BB frequency %i",
2596 compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2597 gimple_bb (e
->call_stmt
)));
2603 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2605 cgraph_debug_gimple_stmt (struct function
*this_cfun
, gimple stmt
)
2607 bool fndecl_was_null
= false;
2608 /* debug_gimple_stmt needs correct cfun */
2609 if (cfun
!= this_cfun
)
2610 set_cfun (this_cfun
);
2611 /* ...and an actual current_function_decl */
2612 if (!current_function_decl
)
2614 current_function_decl
= this_cfun
->decl
;
2615 fndecl_was_null
= true;
2617 debug_gimple_stmt (stmt
);
2618 if (fndecl_was_null
)
2619 current_function_decl
= NULL
;
2622 /* Verify that call graph edge E corresponds to DECL from the associated
2623 statement. Return true if the verification should fail. */
2626 verify_edge_corresponds_to_fndecl (struct cgraph_edge
*e
, tree decl
)
2628 struct cgraph_node
*node
;
2630 if (!decl
|| e
->callee
->global
.inlined_to
)
2632 if (cgraph_state
== CGRAPH_LTO_STREAMING
)
2634 node
= cgraph_get_node (decl
);
2636 /* We do not know if a node from a different partition is an alias or what it
2637 aliases and therefore cannot do the former_clone_of check reliably. */
2638 if (!node
|| node
->symbol
.in_other_partition
|| e
->callee
->symbol
.in_other_partition
)
2640 node
= cgraph_function_or_thunk_node (node
, NULL
);
2642 if (e
->callee
->former_clone_of
!= node
->symbol
.decl
2643 /* IPA-CP sometimes redirect edge to clone and then back to the former
2644 function. This ping-pong has to go, eventually. */
2645 && (node
!= cgraph_function_or_thunk_node (e
->callee
, NULL
))
2646 && !clone_of_p (cgraph_function_or_thunk_node (node
, NULL
), e
->callee
))
2652 /* Verify cgraph nodes of given cgraph node. */
2654 verify_cgraph_node (struct cgraph_node
*node
)
2656 struct cgraph_edge
*e
;
2657 struct function
*this_cfun
= DECL_STRUCT_FUNCTION (node
->symbol
.decl
);
2658 basic_block this_block
;
2659 gimple_stmt_iterator gsi
;
2660 bool error_found
= false;
2665 timevar_push (TV_CGRAPH_VERIFY
);
2666 error_found
|= verify_symtab_base ((symtab_node
) node
);
2667 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2670 error ("aux field set for edge %s->%s",
2671 identifier_to_locale (cgraph_node_name (e
->caller
)),
2672 identifier_to_locale (cgraph_node_name (e
->callee
)));
2675 if (node
->count
< 0)
2677 error ("execution count is negative");
2680 if (node
->global
.inlined_to
&& node
->symbol
.same_comdat_group
)
2682 error ("inline clone in same comdat group list");
2685 if (!node
->symbol
.definition
&& !node
->symbol
.in_other_partition
&& node
->local
.local
)
2687 error ("local symbols must be defined");
2690 if (node
->global
.inlined_to
&& node
->symbol
.externally_visible
)
2692 error ("externally visible inline clone");
2695 if (node
->global
.inlined_to
&& node
->symbol
.address_taken
)
2697 error ("inline clone with address taken");
2700 if (node
->global
.inlined_to
&& node
->symbol
.force_output
)
2702 error ("inline clone is forced to output");
2705 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2709 error ("aux field set for indirect edge from %s",
2710 identifier_to_locale (cgraph_node_name (e
->caller
)));
2713 if (!e
->indirect_unknown_callee
2714 || !e
->indirect_info
)
2716 error ("An indirect edge from %s is not marked as indirect or has "
2717 "associated indirect_info, the corresponding statement is: ",
2718 identifier_to_locale (cgraph_node_name (e
->caller
)));
2719 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2723 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2725 if (verify_edge_count_and_frequency (e
))
2727 if (!e
->inline_failed
)
2729 if (node
->global
.inlined_to
2730 != (e
->caller
->global
.inlined_to
2731 ? e
->caller
->global
.inlined_to
: e
->caller
))
2733 error ("inlined_to pointer is wrong");
2736 if (node
->callers
->next_caller
)
2738 error ("multiple inline callers");
2743 if (node
->global
.inlined_to
)
2745 error ("inlined_to pointer set for noninline callers");
2749 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2750 if (verify_edge_count_and_frequency (e
))
2752 if (!node
->callers
&& node
->global
.inlined_to
)
2754 error ("inlined_to pointer is set but no predecessors found");
2757 if (node
->global
.inlined_to
== node
)
2759 error ("inlined_to pointer refers to itself");
2765 struct cgraph_node
*n
;
2766 for (n
= node
->clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2771 error ("node has wrong clone_of");
2777 struct cgraph_node
*n
;
2778 for (n
= node
->clones
; n
; n
= n
->next_sibling_clone
)
2779 if (n
->clone_of
!= node
)
2783 error ("node has wrong clone list");
2787 if ((node
->prev_sibling_clone
|| node
->next_sibling_clone
) && !node
->clone_of
)
2789 error ("node is in clone list but it is not clone");
2792 if (!node
->prev_sibling_clone
&& node
->clone_of
&& node
->clone_of
->clones
!= node
)
2794 error ("node has wrong prev_clone pointer");
2797 if (node
->prev_sibling_clone
&& node
->prev_sibling_clone
->next_sibling_clone
!= node
)
2799 error ("double linked list of clones corrupted");
2803 if (node
->symbol
.analyzed
&& node
->symbol
.alias
)
2805 bool ref_found
= false;
2807 struct ipa_ref
*ref
;
2811 error ("Alias has call edges");
2814 for (i
= 0; ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
,
2816 if (ref
->use
!= IPA_REF_ALIAS
)
2818 error ("Alias has non-alias reference");
2823 error ("Alias has more than one alias reference");
2830 error ("Analyzed alias has no reference");
2834 if (node
->symbol
.analyzed
&& node
->thunk
.thunk_p
)
2838 error ("No edge out of thunk node");
2841 else if (node
->callees
->next_callee
)
2843 error ("More than one edge out of thunk node");
2846 if (gimple_has_body_p (node
->symbol
.decl
))
2848 error ("Thunk is not supposed to have body");
2852 else if (node
->symbol
.analyzed
&& gimple_has_body_p (node
->symbol
.decl
)
2853 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)
2854 && (!DECL_EXTERNAL (node
->symbol
.decl
) || node
->global
.inlined_to
)
2859 pointer_set_t
*stmts
= pointer_set_create ();
2861 struct ipa_ref
*ref
;
2863 /* Reach the trees by walking over the CFG, and note the
2864 enclosing basic-blocks in the call edges. */
2865 FOR_EACH_BB_FN (this_block
, this_cfun
)
2867 for (gsi
= gsi_start_phis (this_block
);
2868 !gsi_end_p (gsi
); gsi_next (&gsi
))
2869 pointer_set_insert (stmts
, gsi_stmt (gsi
));
2870 for (gsi
= gsi_start_bb (this_block
);
2874 gimple stmt
= gsi_stmt (gsi
);
2875 pointer_set_insert (stmts
, stmt
);
2876 if (is_gimple_call (stmt
))
2878 struct cgraph_edge
*e
= cgraph_edge (node
, stmt
);
2879 tree decl
= gimple_call_fndecl (stmt
);
2884 error ("shared call_stmt:");
2885 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2888 if (!e
->indirect_unknown_callee
)
2890 if (verify_edge_corresponds_to_fndecl (e
, decl
))
2892 error ("edge points to wrong declaration:");
2893 debug_tree (e
->callee
->symbol
.decl
);
2894 fprintf (stderr
," Instead of:");
2901 error ("an indirect edge with unknown callee "
2902 "corresponding to a call_stmt with "
2903 "a known declaration:");
2905 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2911 error ("missing callgraph edge for call stmt:");
2912 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2919 ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
, i
, ref
);
2921 if (ref
->stmt
&& !pointer_set_contains (stmts
, ref
->stmt
))
2923 error ("reference to dead statement");
2924 cgraph_debug_gimple_stmt (this_cfun
, ref
->stmt
);
2927 pointer_set_destroy (stmts
);
2930 /* No CFG available?! */
2933 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2937 error ("edge %s->%s has no corresponding call_stmt",
2938 identifier_to_locale (cgraph_node_name (e
->caller
)),
2939 identifier_to_locale (cgraph_node_name (e
->callee
)));
2940 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2945 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2947 if (!e
->aux
&& !e
->speculative
)
2949 error ("an indirect edge from %s has no corresponding call_stmt",
2950 identifier_to_locale (cgraph_node_name (e
->caller
)));
2951 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2959 dump_cgraph_node (stderr
, node
);
2960 internal_error ("verify_cgraph_node failed");
2962 timevar_pop (TV_CGRAPH_VERIFY
);
2965 /* Verify whole cgraph structure. */
2967 verify_cgraph (void)
2969 struct cgraph_node
*node
;
2974 FOR_EACH_FUNCTION (node
)
2975 verify_cgraph_node (node
);
2978 /* Create external decl node for DECL.
2979 The difference i nbetween cgraph_get_create_node and
2980 cgraph_get_create_real_symbol_node is that cgraph_get_create_node
2981 may return inline clone, while cgraph_get_create_real_symbol_node
2982 will create a new node in this case.
2983 FIXME: This function should be removed once clones are put out of decl
2986 struct cgraph_node
*
2987 cgraph_get_create_real_symbol_node (tree decl
)
2989 struct cgraph_node
*first_clone
= cgraph_get_node (decl
);
2990 struct cgraph_node
*node
;
2991 /* create symbol table node. even if inline clone exists, we can not take
2992 it as a target of non-inlined call. */
2993 node
= cgraph_get_node (decl
);
2994 if (node
&& !node
->global
.inlined_to
)
2997 node
= cgraph_create_node (decl
);
2999 /* ok, we previously inlined the function, then removed the offline copy and
3000 now we want it back for external call. this can happen when devirtualizing
3001 while inlining function called once that happens after extern inlined and
3002 virtuals are already removed. in this case introduce the external node
3003 and make it available for call. */
3006 first_clone
->clone_of
= node
;
3007 node
->clones
= first_clone
;
3008 symtab_prevail_in_asm_name_hash ((symtab_node
) node
);
3009 symtab_insert_node_to_hashtable ((symtab_node
) node
);
3011 fprintf (dump_file
, "Introduced new external node "
3012 "(%s/%i) and turned into root of the clone tree.\n",
3013 xstrdup (cgraph_node_name (node
)), node
->symbol
.order
);
3016 fprintf (dump_file
, "Introduced new external node "
3017 "(%s/%i).\n", xstrdup (cgraph_node_name (node
)),
3018 node
->symbol
.order
);
3023 /* Given NODE, walk the alias chain to return the function NODE is alias of.
3024 Walk through thunk, too.
3025 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
3027 struct cgraph_node
*
3028 cgraph_function_node (struct cgraph_node
*node
, enum availability
*availability
)
3032 node
= cgraph_function_or_thunk_node (node
, availability
);
3033 if (node
->thunk
.thunk_p
)
3035 node
= node
->callees
->callee
;
3038 enum availability a
;
3039 a
= cgraph_function_body_availability (node
);
3040 if (a
< *availability
)
3043 node
= cgraph_function_or_thunk_node (node
, availability
);
3045 } while (node
&& node
->thunk
.thunk_p
);
3049 /* When doing LTO, read NODE's body from disk if it is not already present. */
3052 cgraph_get_body (struct cgraph_node
*node
)
3054 struct lto_file_decl_data
*file_data
;
3055 const char *data
, *name
;
3057 tree decl
= node
->symbol
.decl
;
3059 if (DECL_RESULT (decl
))
3062 gcc_assert (in_lto_p
);
3064 file_data
= node
->symbol
.lto_file_data
;
3065 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
3067 /* We may have renamed the declaration, e.g., a static function. */
3068 name
= lto_get_decl_name_mapping (file_data
, name
);
3070 data
= lto_get_section_data (file_data
, LTO_section_function_body
,
3074 dump_cgraph_node (stderr
, node
);
3075 fatal_error ("%s: section %s is missing",
3076 file_data
->file_name
,
3080 gcc_assert (DECL_STRUCT_FUNCTION (decl
) == NULL
);
3082 lto_input_function_body (file_data
, decl
, data
);
3083 lto_stats
.num_function_bodies
++;
3084 lto_free_section_data (file_data
, LTO_section_function_body
, name
,
3089 #include "gt-cgraph.h"