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;
574 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
576 Same body aliases are output whenever the body of DECL is output,
577 and cgraph_get_node (ALIAS) transparently returns cgraph_get_node (DECL). */
580 cgraph_same_body_alias (struct cgraph_node
*decl_node ATTRIBUTE_UNUSED
, tree alias
, tree decl
)
582 struct cgraph_node
*n
;
583 #ifndef ASM_OUTPUT_DEF
584 /* If aliases aren't supported by the assembler, fail. */
587 /* Langhooks can create same body aliases of symbols not defined.
588 Those are useless. Drop them on the floor. */
589 if (cgraph_global_info_ready
)
592 n
= cgraph_create_function_alias (alias
, decl
);
593 n
->symbol
.cpp_implicit_alias
= true;
594 if (cpp_implicit_aliases_done
)
595 symtab_resolve_alias ((symtab_node
)n
,
596 (symtab_node
)cgraph_get_node (decl
));
600 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
601 aliases DECL with an adjustments made into the first parameter.
602 See comments in thunk_adjust for detail on the parameters. */
605 cgraph_add_thunk (struct cgraph_node
*decl_node ATTRIBUTE_UNUSED
,
606 tree alias
, tree decl ATTRIBUTE_UNUSED
,
608 HOST_WIDE_INT fixed_offset
, HOST_WIDE_INT virtual_value
,
612 struct cgraph_node
*node
;
614 node
= cgraph_get_node (alias
);
617 gcc_assert (node
->symbol
.definition
);
618 gcc_assert (!node
->symbol
.alias
);
619 gcc_assert (!node
->thunk
.thunk_p
);
620 cgraph_remove_node (node
);
623 node
= cgraph_create_node (alias
);
624 gcc_checking_assert (!virtual_offset
625 || tree_to_double_int (virtual_offset
) ==
626 double_int::from_shwi (virtual_value
));
627 node
->thunk
.fixed_offset
= fixed_offset
;
628 node
->thunk
.this_adjusting
= this_adjusting
;
629 node
->thunk
.virtual_value
= virtual_value
;
630 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
631 node
->thunk
.alias
= real_alias
;
632 node
->thunk
.thunk_p
= true;
633 node
->symbol
.definition
= true;
638 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
639 Return NULL if there's no such node. */
642 cgraph_node_for_asm (tree asmname
)
644 /* We do not want to look at inline clones. */
645 for (symtab_node node
= symtab_node_for_asm (asmname
);
647 node
= node
->symbol
.next_sharing_asm_name
)
649 cgraph_node
*cn
= dyn_cast
<cgraph_node
> (node
);
650 if (cn
&& !cn
->global
.inlined_to
)
656 /* Returns a hash value for X (which really is a cgraph_edge). */
659 edge_hash (const void *x
)
661 return htab_hash_pointer (((const struct cgraph_edge
*) x
)->call_stmt
);
664 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
667 edge_eq (const void *x
, const void *y
)
669 return ((const struct cgraph_edge
*) x
)->call_stmt
== y
;
672 /* Add call graph edge E to call site hash of its caller. */
675 cgraph_add_edge_to_call_site_hash (struct cgraph_edge
*e
)
678 slot
= htab_find_slot_with_hash (e
->caller
->call_site_hash
,
680 htab_hash_pointer (e
->call_stmt
),
686 /* Return the callgraph edge representing the GIMPLE_CALL statement
690 cgraph_edge (struct cgraph_node
*node
, gimple call_stmt
)
692 struct cgraph_edge
*e
, *e2
;
695 if (node
->call_site_hash
)
696 return (struct cgraph_edge
*)
697 htab_find_with_hash (node
->call_site_hash
, call_stmt
,
698 htab_hash_pointer (call_stmt
));
700 /* This loop may turn out to be performance problem. In such case adding
701 hashtables into call nodes with very many edges is probably best
702 solution. It is not good idea to add pointer into CALL_EXPR itself
703 because we want to make possible having multiple cgraph nodes representing
704 different clones of the same body before the body is actually cloned. */
705 for (e
= node
->callees
; e
; e
= e
->next_callee
)
707 if (e
->call_stmt
== call_stmt
)
713 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
715 if (e
->call_stmt
== call_stmt
)
722 node
->call_site_hash
= htab_create_ggc (120, edge_hash
, edge_eq
, NULL
);
723 for (e2
= node
->callees
; e2
; e2
= e2
->next_callee
)
724 cgraph_add_edge_to_call_site_hash (e2
);
725 for (e2
= node
->indirect_calls
; e2
; e2
= e2
->next_callee
)
726 cgraph_add_edge_to_call_site_hash (e2
);
733 /* Change field call_stmt of edge E to NEW_STMT. */
736 cgraph_set_call_stmt (struct cgraph_edge
*e
, gimple new_stmt
)
740 if (e
->caller
->call_site_hash
)
742 htab_remove_elt_with_hash (e
->caller
->call_site_hash
,
744 htab_hash_pointer (e
->call_stmt
));
747 e
->call_stmt
= new_stmt
;
748 if (e
->indirect_unknown_callee
749 && (decl
= gimple_call_fndecl (new_stmt
)))
751 /* Constant propagation (and possibly also inlining?) can turn an
752 indirect call into a direct one. */
753 struct cgraph_node
*new_callee
= cgraph_get_node (decl
);
755 gcc_checking_assert (new_callee
);
756 cgraph_make_edge_direct (e
, new_callee
);
759 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->symbol
.decl
));
760 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
762 if (e
->caller
->call_site_hash
)
763 cgraph_add_edge_to_call_site_hash (e
);
766 /* Allocate a cgraph_edge structure and fill it with data according to the
767 parameters of which only CALLEE can be NULL (when creating an indirect call
770 static struct cgraph_edge
*
771 cgraph_create_edge_1 (struct cgraph_node
*caller
, struct cgraph_node
*callee
,
772 gimple call_stmt
, gcov_type count
, int freq
)
774 struct cgraph_edge
*edge
;
776 /* LTO does not actually have access to the call_stmt since these
777 have not been loaded yet. */
780 /* This is a rather expensive check possibly triggering
781 construction of call stmt hashtable. */
782 gcc_checking_assert (!cgraph_edge (caller
, call_stmt
));
784 gcc_assert (is_gimple_call (call_stmt
));
790 free_edges
= NEXT_FREE_EDGE (edge
);
794 edge
= ggc_alloc_cgraph_edge ();
795 edge
->uid
= cgraph_edge_max_uid
++;
799 edge
->caller
= caller
;
800 edge
->callee
= callee
;
801 edge
->prev_caller
= NULL
;
802 edge
->next_caller
= NULL
;
803 edge
->prev_callee
= NULL
;
804 edge
->next_callee
= NULL
;
807 gcc_assert (count
>= 0);
808 edge
->frequency
= freq
;
809 gcc_assert (freq
>= 0);
810 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
812 edge
->call_stmt
= call_stmt
;
813 push_cfun (DECL_STRUCT_FUNCTION (caller
->symbol
.decl
));
814 edge
->can_throw_external
815 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
818 && callee
&& callee
->symbol
.decl
819 && !gimple_check_call_matching_types (call_stmt
, callee
->symbol
.decl
))
820 edge
->call_stmt_cannot_inline_p
= true;
822 edge
->call_stmt_cannot_inline_p
= false;
823 if (call_stmt
&& caller
->call_site_hash
)
824 cgraph_add_edge_to_call_site_hash (edge
);
826 edge
->indirect_info
= NULL
;
827 edge
->indirect_inlining_edge
= 0;
832 /* Create edge from CALLER to CALLEE in the cgraph. */
835 cgraph_create_edge (struct cgraph_node
*caller
, struct cgraph_node
*callee
,
836 gimple call_stmt
, gcov_type count
, int freq
)
838 struct cgraph_edge
*edge
= cgraph_create_edge_1 (caller
, callee
, call_stmt
,
841 edge
->indirect_unknown_callee
= 0;
842 initialize_inline_failed (edge
);
844 edge
->next_caller
= callee
->callers
;
846 callee
->callers
->prev_caller
= edge
;
847 edge
->next_callee
= caller
->callees
;
849 caller
->callees
->prev_callee
= edge
;
850 caller
->callees
= edge
;
851 callee
->callers
= edge
;
856 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
858 struct cgraph_indirect_call_info
*
859 cgraph_allocate_init_indirect_info (void)
861 struct cgraph_indirect_call_info
*ii
;
863 ii
= ggc_alloc_cleared_cgraph_indirect_call_info ();
864 ii
->param_index
= -1;
868 /* Create an indirect edge with a yet-undetermined callee where the call
869 statement destination is a formal parameter of the caller with index
873 cgraph_create_indirect_edge (struct cgraph_node
*caller
, gimple call_stmt
,
875 gcov_type count
, int freq
)
877 struct cgraph_edge
*edge
= cgraph_create_edge_1 (caller
, NULL
, call_stmt
,
880 edge
->indirect_unknown_callee
= 1;
881 initialize_inline_failed (edge
);
883 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
884 edge
->indirect_info
->ecf_flags
= ecf_flags
;
886 edge
->next_callee
= caller
->indirect_calls
;
887 if (caller
->indirect_calls
)
888 caller
->indirect_calls
->prev_callee
= edge
;
889 caller
->indirect_calls
= edge
;
894 /* Remove the edge E from the list of the callers of the callee. */
897 cgraph_edge_remove_callee (struct cgraph_edge
*e
)
899 gcc_assert (!e
->indirect_unknown_callee
);
901 e
->prev_caller
->next_caller
= e
->next_caller
;
903 e
->next_caller
->prev_caller
= e
->prev_caller
;
905 e
->callee
->callers
= e
->next_caller
;
908 /* Remove the edge E from the list of the callees of the caller. */
911 cgraph_edge_remove_caller (struct cgraph_edge
*e
)
914 e
->prev_callee
->next_callee
= e
->next_callee
;
916 e
->next_callee
->prev_callee
= e
->prev_callee
;
919 if (e
->indirect_unknown_callee
)
920 e
->caller
->indirect_calls
= e
->next_callee
;
922 e
->caller
->callees
= e
->next_callee
;
924 if (e
->caller
->call_site_hash
)
925 htab_remove_elt_with_hash (e
->caller
->call_site_hash
,
927 htab_hash_pointer (e
->call_stmt
));
930 /* Put the edge onto the free list. */
933 cgraph_free_edge (struct cgraph_edge
*e
)
937 /* Clear out the edge so we do not dangle pointers. */
938 memset (e
, 0, sizeof (*e
));
940 NEXT_FREE_EDGE (e
) = free_edges
;
944 /* Remove the edge E in the cgraph. */
947 cgraph_remove_edge (struct cgraph_edge
*e
)
949 /* Call all edge removal hooks. */
950 cgraph_call_edge_removal_hooks (e
);
952 if (!e
->indirect_unknown_callee
)
953 /* Remove from callers list of the callee. */
954 cgraph_edge_remove_callee (e
);
956 /* Remove from callees list of the callers. */
957 cgraph_edge_remove_caller (e
);
959 /* Put the edge onto the free list. */
960 cgraph_free_edge (e
);
963 /* Set callee of call graph edge E and add it to the corresponding set of
967 cgraph_set_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
969 e
->prev_caller
= NULL
;
971 n
->callers
->prev_caller
= e
;
972 e
->next_caller
= n
->callers
;
977 /* Redirect callee of E to N. The function does not update underlying
981 cgraph_redirect_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
983 /* Remove from callers list of the current callee. */
984 cgraph_edge_remove_callee (e
);
986 /* Insert to callers list of the new callee. */
987 cgraph_set_edge_callee (e
, n
);
990 /* Make an indirect EDGE with an unknown callee an ordinary edge leading to
991 CALLEE. DELTA is an integer constant that is to be added to the this
992 pointer (first parameter) to compensate for skipping a thunk adjustment. */
995 cgraph_make_edge_direct (struct cgraph_edge
*edge
, struct cgraph_node
*callee
)
997 edge
->indirect_unknown_callee
= 0;
999 /* Get the edge out of the indirect edge list. */
1000 if (edge
->prev_callee
)
1001 edge
->prev_callee
->next_callee
= edge
->next_callee
;
1002 if (edge
->next_callee
)
1003 edge
->next_callee
->prev_callee
= edge
->prev_callee
;
1004 if (!edge
->prev_callee
)
1005 edge
->caller
->indirect_calls
= edge
->next_callee
;
1007 /* Put it into the normal callee list */
1008 edge
->prev_callee
= NULL
;
1009 edge
->next_callee
= edge
->caller
->callees
;
1010 if (edge
->caller
->callees
)
1011 edge
->caller
->callees
->prev_callee
= edge
;
1012 edge
->caller
->callees
= edge
;
1014 /* Insert to callers list of the new callee. */
1015 cgraph_set_edge_callee (edge
, callee
);
1017 if (edge
->call_stmt
)
1018 edge
->call_stmt_cannot_inline_p
1019 = !gimple_check_call_matching_types (edge
->call_stmt
, callee
->symbol
.decl
);
1021 /* We need to re-determine the inlining status of the edge. */
1022 initialize_inline_failed (edge
);
1025 /* If necessary, change the function declaration in the call statement
1026 associated with E so that it corresponds to the edge callee. */
1029 cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge
*e
)
1031 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1033 gimple_stmt_iterator gsi
;
1034 #ifdef ENABLE_CHECKING
1035 struct cgraph_node
*node
;
1038 if (e
->indirect_unknown_callee
1039 || decl
== e
->callee
->symbol
.decl
)
1040 return e
->call_stmt
;
1042 #ifdef ENABLE_CHECKING
1045 node
= cgraph_get_node (decl
);
1046 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1050 if (cgraph_dump_file
)
1052 fprintf (cgraph_dump_file
, "updating call of %s/%i -> %s/%i: ",
1053 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1054 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
);
1055 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1056 if (e
->callee
->clone
.combined_args_to_skip
)
1058 fprintf (cgraph_dump_file
, " combined args to skip: ");
1059 dump_bitmap (cgraph_dump_file
,
1060 e
->callee
->clone
.combined_args_to_skip
);
1064 if (e
->callee
->clone
.combined_args_to_skip
)
1069 = gimple_call_copy_skip_args (e
->call_stmt
,
1070 e
->callee
->clone
.combined_args_to_skip
);
1071 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1072 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1074 if (gimple_vdef (new_stmt
)
1075 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1076 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1078 gsi
= gsi_for_stmt (e
->call_stmt
);
1079 gsi_replace (&gsi
, new_stmt
, false);
1080 /* We need to defer cleaning EH info on the new statement to
1081 fixup-cfg. We may not have dominator information at this point
1082 and thus would end up with unreachable blocks and have no way
1083 to communicate that we need to run CFG cleanup then. */
1084 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1087 remove_stmt_from_eh_lp (e
->call_stmt
);
1088 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1093 new_stmt
= e
->call_stmt
;
1094 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1095 update_stmt (new_stmt
);
1098 cgraph_set_call_stmt_including_clones (e
->caller
, e
->call_stmt
, new_stmt
);
1100 if (cgraph_dump_file
)
1102 fprintf (cgraph_dump_file
, " updated to:");
1103 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1108 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1109 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1110 of OLD_STMT if it was previously call statement.
1111 If NEW_STMT is NULL, the call has been dropped without any
1115 cgraph_update_edges_for_call_stmt_node (struct cgraph_node
*node
,
1116 gimple old_stmt
, tree old_call
,
1119 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1120 ? gimple_call_fndecl (new_stmt
) : 0;
1122 /* We are seeing indirect calls, then there is nothing to update. */
1123 if (!new_call
&& !old_call
)
1125 /* See if we turned indirect call into direct call or folded call to one builtin
1126 into different builtin. */
1127 if (old_call
!= new_call
)
1129 struct cgraph_edge
*e
= cgraph_edge (node
, old_stmt
);
1130 struct cgraph_edge
*ne
= NULL
;
1136 /* See if the edge is already there and has the correct callee. It
1137 might be so because of indirect inlining has already updated
1138 it. We also might've cloned and redirected the edge. */
1139 if (new_call
&& e
->callee
)
1141 struct cgraph_node
*callee
= e
->callee
;
1144 if (callee
->symbol
.decl
== new_call
1145 || callee
->former_clone_of
== new_call
)
1147 callee
= callee
->clone_of
;
1151 /* Otherwise remove edge and create new one; we can't simply redirect
1152 since function has changed, so inline plan and other information
1153 attached to edge is invalid. */
1155 frequency
= e
->frequency
;
1156 cgraph_remove_edge (e
);
1160 /* We are seeing new direct call; compute profile info based on BB. */
1161 basic_block bb
= gimple_bb (new_stmt
);
1163 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1169 ne
= cgraph_create_edge (node
, cgraph_get_create_node (new_call
),
1170 new_stmt
, count
, frequency
);
1171 gcc_assert (ne
->inline_failed
);
1174 /* We only updated the call stmt; update pointer in cgraph edge.. */
1175 else if (old_stmt
!= new_stmt
)
1176 cgraph_set_call_stmt (cgraph_edge (node
, old_stmt
), new_stmt
);
1179 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1180 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1181 of OLD_STMT before it was updated (updating can happen inplace). */
1184 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1186 struct cgraph_node
*orig
= cgraph_get_node (cfun
->decl
);
1187 struct cgraph_node
*node
;
1189 gcc_checking_assert (orig
);
1190 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1192 for (node
= orig
->clones
; node
!= orig
;)
1194 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1196 node
= node
->clones
;
1197 else if (node
->next_sibling_clone
)
1198 node
= node
->next_sibling_clone
;
1201 while (node
!= orig
&& !node
->next_sibling_clone
)
1202 node
= node
->clone_of
;
1204 node
= node
->next_sibling_clone
;
1210 /* Remove all callees from the node. */
1213 cgraph_node_remove_callees (struct cgraph_node
*node
)
1215 struct cgraph_edge
*e
, *f
;
1217 /* It is sufficient to remove the edges from the lists of callers of
1218 the callees. The callee list of the node can be zapped with one
1220 for (e
= node
->callees
; e
; e
= f
)
1223 cgraph_call_edge_removal_hooks (e
);
1224 if (!e
->indirect_unknown_callee
)
1225 cgraph_edge_remove_callee (e
);
1226 cgraph_free_edge (e
);
1228 for (e
= node
->indirect_calls
; e
; e
= f
)
1231 cgraph_call_edge_removal_hooks (e
);
1232 if (!e
->indirect_unknown_callee
)
1233 cgraph_edge_remove_callee (e
);
1234 cgraph_free_edge (e
);
1236 node
->indirect_calls
= NULL
;
1237 node
->callees
= NULL
;
1238 if (node
->call_site_hash
)
1240 htab_delete (node
->call_site_hash
);
1241 node
->call_site_hash
= NULL
;
1245 /* Remove all callers from the node. */
1248 cgraph_node_remove_callers (struct cgraph_node
*node
)
1250 struct cgraph_edge
*e
, *f
;
1252 /* It is sufficient to remove the edges from the lists of callees of
1253 the callers. The caller list of the node can be zapped with one
1255 for (e
= node
->callers
; e
; e
= f
)
1258 cgraph_call_edge_removal_hooks (e
);
1259 cgraph_edge_remove_caller (e
);
1260 cgraph_free_edge (e
);
1262 node
->callers
= NULL
;
1265 /* Release memory used to represent body of function NODE.
1266 Use this only for functions that are released before being translated to
1267 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1268 are free'd in final.c via free_after_compilation(). */
1271 cgraph_release_function_body (struct cgraph_node
*node
)
1273 if (DECL_STRUCT_FUNCTION (node
->symbol
.decl
))
1275 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
1279 cfun
->curr_properties
&= ~PROP_loops
;
1280 loop_optimizer_finalize ();
1282 if (cfun
->gimple_df
)
1285 delete_tree_cfg_annotations ();
1290 gcc_assert (dom_computed
[0] == DOM_NONE
);
1291 gcc_assert (dom_computed
[1] == DOM_NONE
);
1295 if (cfun
->value_histograms
)
1298 gimple_set_body (node
->symbol
.decl
, NULL
);
1299 node
->ipa_transforms_to_apply
.release ();
1300 /* Struct function hangs a lot of data that would leak if we didn't
1301 removed all pointers to it. */
1302 ggc_free (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
1303 DECL_STRUCT_FUNCTION (node
->symbol
.decl
) = NULL
;
1305 DECL_SAVED_TREE (node
->symbol
.decl
) = NULL
;
1306 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1307 of its associated function function declaration because it's
1308 needed to emit debug info later. */
1309 if (!node
->abstract_and_needed
&& DECL_INITIAL (node
->symbol
.decl
))
1310 DECL_INITIAL (node
->symbol
.decl
) = error_mark_node
;
1313 /* Remove the node from cgraph. */
1316 cgraph_remove_node (struct cgraph_node
*node
)
1318 struct cgraph_node
*n
;
1319 int uid
= node
->uid
;
1321 cgraph_call_node_removal_hooks (node
);
1322 cgraph_node_remove_callers (node
);
1323 cgraph_node_remove_callees (node
);
1324 node
->ipa_transforms_to_apply
.release ();
1326 /* Incremental inlining access removed nodes stored in the postorder list.
1328 node
->symbol
.force_output
= false;
1329 node
->symbol
.forced_by_abi
= false;
1330 for (n
= node
->nested
; n
; n
= n
->next_nested
)
1332 node
->nested
= NULL
;
1335 struct cgraph_node
**node2
= &node
->origin
->nested
;
1337 while (*node2
!= node
)
1338 node2
= &(*node2
)->next_nested
;
1339 *node2
= node
->next_nested
;
1341 symtab_unregister_node ((symtab_node
)node
);
1342 if (node
->prev_sibling_clone
)
1343 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
1344 else if (node
->clone_of
)
1345 node
->clone_of
->clones
= node
->next_sibling_clone
;
1346 if (node
->next_sibling_clone
)
1347 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
1350 struct cgraph_node
*n
, *next
;
1354 for (n
= node
->clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1355 n
->clone_of
= node
->clone_of
;
1356 n
->clone_of
= node
->clone_of
;
1357 n
->next_sibling_clone
= node
->clone_of
->clones
;
1358 if (node
->clone_of
->clones
)
1359 node
->clone_of
->clones
->prev_sibling_clone
= n
;
1360 node
->clone_of
->clones
= node
->clones
;
1364 /* We are removing node with clones. This makes clones inconsistent,
1365 but assume they will be removed subsequently and just keep clone
1366 tree intact. This can happen in unreachable function removal since
1367 we remove unreachable functions in random order, not by bottom-up
1368 walk of clone trees. */
1369 for (n
= node
->clones
; n
; n
= next
)
1371 next
= n
->next_sibling_clone
;
1372 n
->next_sibling_clone
= NULL
;
1373 n
->prev_sibling_clone
= NULL
;
1379 /* While all the clones are removed after being proceeded, the function
1380 itself is kept in the cgraph even after it is compiled. Check whether
1381 we are done with this body and reclaim it proactively if this is the case.
1383 n
= cgraph_get_node (node
->symbol
.decl
);
1385 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1386 && (cgraph_global_info_ready
1387 && (TREE_ASM_WRITTEN (n
->symbol
.decl
)
1388 || DECL_EXTERNAL (n
->symbol
.decl
)
1389 || !n
->symbol
.analyzed
1390 || n
->symbol
.in_other_partition
))))
1391 cgraph_release_function_body (node
);
1393 node
->symbol
.decl
= NULL
;
1394 if (node
->call_site_hash
)
1396 htab_delete (node
->call_site_hash
);
1397 node
->call_site_hash
= NULL
;
1401 /* Clear out the node to NULL all pointers and add the node to the free
1403 memset (node
, 0, sizeof(*node
));
1404 node
->symbol
.type
= SYMTAB_FUNCTION
;
1406 SET_NEXT_FREE_NODE (node
, free_nodes
);
1410 /* Likewise indicate that a node is having address taken. */
1413 cgraph_mark_address_taken_node (struct cgraph_node
*node
)
1415 /* Indirect inlining can figure out that all uses of the address are
1417 if (node
->global
.inlined_to
)
1419 gcc_assert (cfun
->after_inlining
);
1420 gcc_assert (node
->callers
->indirect_inlining_edge
);
1423 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1424 IPA_REF_ADDR reference exists (and thus it should be set on node
1425 representing alias we take address of) and as a test whether address
1426 of the object was taken (and thus it should be set on node alias is
1427 referring to). We should remove the first use and the remove the
1429 node
->symbol
.address_taken
= 1;
1430 node
= cgraph_function_or_thunk_node (node
, NULL
);
1431 node
->symbol
.address_taken
= 1;
1434 /* Return local info for the compiled function. */
1436 struct cgraph_local_info
*
1437 cgraph_local_info (tree decl
)
1439 struct cgraph_node
*node
;
1441 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1442 node
= cgraph_get_node (decl
);
1445 return &node
->local
;
1448 /* Return local info for the compiled function. */
1450 struct cgraph_global_info
*
1451 cgraph_global_info (tree decl
)
1453 struct cgraph_node
*node
;
1455 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
&& cgraph_global_info_ready
);
1456 node
= cgraph_get_node (decl
);
1459 return &node
->global
;
1462 /* Return local info for the compiled function. */
1464 struct cgraph_rtl_info
*
1465 cgraph_rtl_info (tree decl
)
1467 struct cgraph_node
*node
;
1469 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1470 node
= cgraph_get_node (decl
);
1472 || (decl
!= current_function_decl
1473 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)))
1478 /* Return a string describing the failure REASON. */
1481 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1484 #define DEFCIFCODE(code, string) string,
1486 static const char *cif_string_table
[CIF_N_REASONS
] = {
1487 #include "cif-code.def"
1490 /* Signedness of an enum type is implementation defined, so cast it
1491 to unsigned before testing. */
1492 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1493 return cif_string_table
[reason
];
1496 /* Names used to print out the availability enum. */
1497 const char * const cgraph_availability_names
[] =
1498 {"unset", "not_available", "overwritable", "available", "local"};
1501 /* Dump call graph node NODE to file F. */
1504 dump_cgraph_node (FILE *f
, struct cgraph_node
*node
)
1506 struct cgraph_edge
*edge
;
1507 int indirect_calls_count
= 0;
1509 dump_symtab_base (f
, (symtab_node
) node
);
1511 if (node
->global
.inlined_to
)
1512 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1513 xstrdup (cgraph_node_name (node
)),
1515 xstrdup (cgraph_node_name (node
->global
.inlined_to
)),
1516 node
->global
.inlined_to
->symbol
.order
);
1518 fprintf (f
, " Clone of %s/%i\n",
1519 cgraph_node_asm_name (node
->clone_of
),
1520 node
->clone_of
->symbol
.order
);
1521 if (cgraph_function_flags_ready
)
1522 fprintf (f
, " Availability: %s\n",
1523 cgraph_availability_names
[cgraph_function_body_availability (node
)]);
1525 fprintf (f
, " Function flags:");
1527 fprintf (f
, " executed "HOST_WIDEST_INT_PRINT_DEC
"x",
1528 (HOST_WIDEST_INT
)node
->count
);
1530 fprintf (f
, " nested in: %s", cgraph_node_asm_name (node
->origin
));
1531 if (gimple_has_body_p (node
->symbol
.decl
))
1532 fprintf (f
, " body");
1534 fprintf (f
, " process");
1535 if (node
->local
.local
)
1536 fprintf (f
, " local");
1537 if (node
->local
.redefined_extern_inline
)
1538 fprintf (f
, " redefined_extern_inline");
1539 if (node
->only_called_at_startup
)
1540 fprintf (f
, " only_called_at_startup");
1541 if (node
->only_called_at_exit
)
1542 fprintf (f
, " only_called_at_exit");
1544 fprintf (f
, " tm_clone");
1548 if (node
->thunk
.thunk_p
)
1550 fprintf (f
, " Thunk");
1551 if (node
->thunk
.alias
)
1552 fprintf (f
, " of %s (asm: %s)",
1553 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2),
1554 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)));
1555 fprintf (f
, " fixed offset %i virtual value %i has "
1556 "virtual offset %i)\n",
1557 (int)node
->thunk
.fixed_offset
,
1558 (int)node
->thunk
.virtual_value
,
1559 (int)node
->thunk
.virtual_offset_p
);
1561 if (node
->symbol
.alias
&& node
->thunk
.alias
1562 && DECL_P (node
->thunk
.alias
))
1564 fprintf (f
, " Alias of %s",
1565 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2));
1566 if (DECL_ASSEMBLER_NAME_SET_P (node
->thunk
.alias
))
1567 fprintf (f
, " (asm: %s)",
1568 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)));
1572 fprintf (f
, " Called by: ");
1574 for (edge
= node
->callers
; edge
; edge
= edge
->next_caller
)
1576 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->caller
),
1577 edge
->caller
->symbol
.order
);
1579 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1580 (HOST_WIDEST_INT
)edge
->count
);
1581 if (edge
->frequency
)
1582 fprintf (f
, "(%.2f per call) ",
1583 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1584 if (!edge
->inline_failed
)
1585 fprintf(f
, "(inlined) ");
1586 if (edge
->indirect_inlining_edge
)
1587 fprintf(f
, "(indirect_inlining) ");
1588 if (edge
->can_throw_external
)
1589 fprintf(f
, "(can throw external) ");
1592 fprintf (f
, "\n Calls: ");
1593 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
1595 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->callee
),
1596 edge
->callee
->symbol
.order
);
1597 if (!edge
->inline_failed
)
1598 fprintf(f
, "(inlined) ");
1599 if (edge
->indirect_inlining_edge
)
1600 fprintf(f
, "(indirect_inlining) ");
1602 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1603 (HOST_WIDEST_INT
)edge
->count
);
1604 if (edge
->frequency
)
1605 fprintf (f
, "(%.2f per call) ",
1606 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1607 if (edge
->can_throw_external
)
1608 fprintf(f
, "(can throw external) ");
1612 for (edge
= node
->indirect_calls
; edge
; edge
= edge
->next_callee
)
1613 indirect_calls_count
++;
1614 if (indirect_calls_count
)
1615 fprintf (f
, " Has %i outgoing edges for indirect calls.\n",
1616 indirect_calls_count
);
1620 /* Dump call graph node NODE to stderr. */
1623 debug_cgraph_node (struct cgraph_node
*node
)
1625 dump_cgraph_node (stderr
, node
);
1629 /* Dump the callgraph to file F. */
1632 dump_cgraph (FILE *f
)
1634 struct cgraph_node
*node
;
1636 fprintf (f
, "callgraph:\n\n");
1637 FOR_EACH_FUNCTION (node
)
1638 dump_cgraph_node (f
, node
);
1642 /* Dump the call graph to stderr. */
1647 dump_cgraph (stderr
);
1650 /* Return true when the DECL can possibly be inlined. */
1652 cgraph_function_possibly_inlined_p (tree decl
)
1654 if (!cgraph_global_info_ready
)
1655 return !DECL_UNINLINABLE (decl
);
1656 return DECL_POSSIBLY_INLINED (decl
);
1659 /* NODE is no longer nested function; update cgraph accordingly. */
1661 cgraph_unnest_node (struct cgraph_node
*node
)
1663 struct cgraph_node
**node2
= &node
->origin
->nested
;
1664 gcc_assert (node
->origin
);
1666 while (*node2
!= node
)
1667 node2
= &(*node2
)->next_nested
;
1668 *node2
= node
->next_nested
;
1669 node
->origin
= NULL
;
1672 /* Return function availability. See cgraph.h for description of individual
1675 cgraph_function_body_availability (struct cgraph_node
*node
)
1677 enum availability avail
;
1678 gcc_assert (cgraph_function_flags_ready
);
1679 if (!node
->symbol
.analyzed
)
1680 avail
= AVAIL_NOT_AVAILABLE
;
1681 else if (node
->local
.local
)
1682 avail
= AVAIL_LOCAL
;
1683 else if (!node
->symbol
.externally_visible
)
1684 avail
= AVAIL_AVAILABLE
;
1685 /* Inline functions are safe to be analyzed even if their symbol can
1686 be overwritten at runtime. It is not meaningful to enforce any sane
1687 behaviour on replacing inline function by different body. */
1688 else if (DECL_DECLARED_INLINE_P (node
->symbol
.decl
))
1689 avail
= AVAIL_AVAILABLE
;
1691 /* If the function can be overwritten, return OVERWRITABLE. Take
1692 care at least of two notable extensions - the COMDAT functions
1693 used to share template instantiations in C++ (this is symmetric
1694 to code cp_cannot_inline_tree_fn and probably shall be shared and
1695 the inlinability hooks completely eliminated).
1697 ??? Does the C++ one definition rule allow us to always return
1698 AVAIL_AVAILABLE here? That would be good reason to preserve this
1701 else if (decl_replaceable_p (node
->symbol
.decl
)
1702 && !DECL_EXTERNAL (node
->symbol
.decl
))
1703 avail
= AVAIL_OVERWRITABLE
;
1704 else avail
= AVAIL_AVAILABLE
;
1709 /* Worker for cgraph_node_can_be_local_p. */
1711 cgraph_node_cannot_be_local_p_1 (struct cgraph_node
*node
,
1712 void *data ATTRIBUTE_UNUSED
)
1714 return !(!node
->symbol
.force_output
1715 && ((DECL_COMDAT (node
->symbol
.decl
)
1716 && !node
->symbol
.forced_by_abi
1717 && !symtab_used_from_object_file_p ((symtab_node
) node
)
1718 && !node
->symbol
.same_comdat_group
)
1719 || !node
->symbol
.externally_visible
));
1722 /* Return true if NODE can be made local for API change.
1723 Extern inline functions and C++ COMDAT functions can be made local
1724 at the expense of possible code size growth if function is used in multiple
1725 compilation units. */
1727 cgraph_node_can_be_local_p (struct cgraph_node
*node
)
1729 return (!node
->symbol
.address_taken
1730 && !cgraph_for_node_and_aliases (node
,
1731 cgraph_node_cannot_be_local_p_1
,
1735 /* Call calback on NODE, thunks and aliases associated to NODE.
1736 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
1740 cgraph_for_node_thunks_and_aliases (struct cgraph_node
*node
,
1741 bool (*callback
) (struct cgraph_node
*, void *),
1743 bool include_overwritable
)
1745 struct cgraph_edge
*e
;
1747 struct ipa_ref
*ref
;
1749 if (callback (node
, data
))
1751 for (e
= node
->callers
; e
; e
= e
->next_caller
)
1752 if (e
->caller
->thunk
.thunk_p
1753 && (include_overwritable
1754 || cgraph_function_body_availability (e
->caller
) > AVAIL_OVERWRITABLE
))
1755 if (cgraph_for_node_thunks_and_aliases (e
->caller
, callback
, data
,
1756 include_overwritable
))
1758 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
1759 if (ref
->use
== IPA_REF_ALIAS
)
1761 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
1762 if (include_overwritable
1763 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
1764 if (cgraph_for_node_thunks_and_aliases (alias
, callback
, data
,
1765 include_overwritable
))
1771 /* Call calback on NODE and aliases associated to NODE.
1772 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
1776 cgraph_for_node_and_aliases (struct cgraph_node
*node
,
1777 bool (*callback
) (struct cgraph_node
*, void *),
1779 bool include_overwritable
)
1782 struct ipa_ref
*ref
;
1784 if (callback (node
, data
))
1786 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
1787 if (ref
->use
== IPA_REF_ALIAS
)
1789 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
1790 if (include_overwritable
1791 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
1792 if (cgraph_for_node_and_aliases (alias
, callback
, data
,
1793 include_overwritable
))
1799 /* Worker to bring NODE local. */
1802 cgraph_make_node_local_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
1804 gcc_checking_assert (cgraph_node_can_be_local_p (node
));
1805 if (DECL_COMDAT (node
->symbol
.decl
) || DECL_EXTERNAL (node
->symbol
.decl
))
1807 symtab_make_decl_local (node
->symbol
.decl
);
1809 node
->symbol
.externally_visible
= false;
1810 node
->symbol
.forced_by_abi
= false;
1811 node
->local
.local
= true;
1812 node
->symbol
.unique_name
= (node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY
1813 || node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
1814 node
->symbol
.resolution
= LDPR_PREVAILING_DEF_IRONLY
;
1815 gcc_assert (cgraph_function_body_availability (node
) == AVAIL_LOCAL
);
1820 /* Bring NODE local. */
1823 cgraph_make_node_local (struct cgraph_node
*node
)
1825 cgraph_for_node_thunks_and_aliases (node
, cgraph_make_node_local_1
,
1829 /* Worker to set nothrow flag. */
1832 cgraph_set_nothrow_flag_1 (struct cgraph_node
*node
, void *data
)
1834 struct cgraph_edge
*e
;
1836 TREE_NOTHROW (node
->symbol
.decl
) = data
!= NULL
;
1839 for (e
= node
->callers
; e
; e
= e
->next_caller
)
1840 e
->can_throw_external
= false;
1844 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
1845 if any to NOTHROW. */
1848 cgraph_set_nothrow_flag (struct cgraph_node
*node
, bool nothrow
)
1850 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_nothrow_flag_1
,
1851 (void *)(size_t)nothrow
, false);
1854 /* Worker to set const flag. */
1857 cgraph_set_const_flag_1 (struct cgraph_node
*node
, void *data
)
1859 /* Static constructors and destructors without a side effect can be
1861 if (data
&& !((size_t)data
& 2))
1863 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
1864 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
1865 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
1866 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
1868 TREE_READONLY (node
->symbol
.decl
) = data
!= NULL
;
1869 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
1873 /* Set TREE_READONLY on NODE's decl and on aliases of NODE
1874 if any to READONLY. */
1877 cgraph_set_const_flag (struct cgraph_node
*node
, bool readonly
, bool looping
)
1879 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_const_flag_1
,
1880 (void *)(size_t)(readonly
+ (int)looping
* 2),
1884 /* Worker to set pure flag. */
1887 cgraph_set_pure_flag_1 (struct cgraph_node
*node
, void *data
)
1889 /* Static constructors and destructors without a side effect can be
1891 if (data
&& !((size_t)data
& 2))
1893 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
1894 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
1895 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
1896 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
1898 DECL_PURE_P (node
->symbol
.decl
) = data
!= NULL
;
1899 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
1903 /* Set DECL_PURE_P on NODE's decl and on aliases of NODE
1907 cgraph_set_pure_flag (struct cgraph_node
*node
, bool pure
, bool looping
)
1909 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_pure_flag_1
,
1910 (void *)(size_t)(pure
+ (int)looping
* 2),
1914 /* Data used by cgraph_propagate_frequency. */
1916 struct cgraph_propagate_frequency_data
1918 bool maybe_unlikely_executed
;
1919 bool maybe_executed_once
;
1920 bool only_called_at_startup
;
1921 bool only_called_at_exit
;
1924 /* Worker for cgraph_propagate_frequency_1. */
1927 cgraph_propagate_frequency_1 (struct cgraph_node
*node
, void *data
)
1929 struct cgraph_propagate_frequency_data
*d
;
1930 struct cgraph_edge
*edge
;
1932 d
= (struct cgraph_propagate_frequency_data
*)data
;
1933 for (edge
= node
->callers
;
1934 edge
&& (d
->maybe_unlikely_executed
|| d
->maybe_executed_once
1935 || d
->only_called_at_startup
|| d
->only_called_at_exit
);
1936 edge
= edge
->next_caller
)
1938 if (edge
->caller
!= node
)
1940 d
->only_called_at_startup
&= edge
->caller
->only_called_at_startup
;
1941 /* It makes sense to put main() together with the static constructors.
1942 It will be executed for sure, but rest of functions called from
1943 main are definitely not at startup only. */
1944 if (MAIN_NAME_P (DECL_NAME (edge
->caller
->symbol
.decl
)))
1945 d
->only_called_at_startup
= 0;
1946 d
->only_called_at_exit
&= edge
->caller
->only_called_at_exit
;
1948 if (!edge
->frequency
)
1950 switch (edge
->caller
->frequency
)
1952 case NODE_FREQUENCY_UNLIKELY_EXECUTED
:
1954 case NODE_FREQUENCY_EXECUTED_ONCE
:
1955 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1956 fprintf (dump_file
, " Called by %s that is executed once\n",
1957 cgraph_node_name (edge
->caller
));
1958 d
->maybe_unlikely_executed
= false;
1959 if (inline_edge_summary (edge
)->loop_depth
)
1961 d
->maybe_executed_once
= false;
1962 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1963 fprintf (dump_file
, " Called in loop\n");
1966 case NODE_FREQUENCY_HOT
:
1967 case NODE_FREQUENCY_NORMAL
:
1968 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1969 fprintf (dump_file
, " Called by %s that is normal or hot\n",
1970 cgraph_node_name (edge
->caller
));
1971 d
->maybe_unlikely_executed
= false;
1972 d
->maybe_executed_once
= false;
1976 return edge
!= NULL
;
1979 /* See if the frequency of NODE can be updated based on frequencies of its
1982 cgraph_propagate_frequency (struct cgraph_node
*node
)
1984 struct cgraph_propagate_frequency_data d
= {true, true, true, true};
1985 bool changed
= false;
1987 if (!node
->local
.local
)
1989 gcc_assert (node
->symbol
.analyzed
);
1990 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1991 fprintf (dump_file
, "Processing frequency %s\n", cgraph_node_name (node
));
1993 cgraph_for_node_and_aliases (node
, cgraph_propagate_frequency_1
, &d
, true);
1995 if ((d
.only_called_at_startup
&& !d
.only_called_at_exit
)
1996 && !node
->only_called_at_startup
)
1998 node
->only_called_at_startup
= true;
2000 fprintf (dump_file
, "Node %s promoted to only called at startup.\n",
2001 cgraph_node_name (node
));
2004 if ((d
.only_called_at_exit
&& !d
.only_called_at_startup
)
2005 && !node
->only_called_at_exit
)
2007 node
->only_called_at_exit
= true;
2009 fprintf (dump_file
, "Node %s promoted to only called at exit.\n",
2010 cgraph_node_name (node
));
2013 /* These come either from profile or user hints; never update them. */
2014 if (node
->frequency
== NODE_FREQUENCY_HOT
2015 || node
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2017 if (d
.maybe_unlikely_executed
)
2019 node
->frequency
= NODE_FREQUENCY_UNLIKELY_EXECUTED
;
2021 fprintf (dump_file
, "Node %s promoted to unlikely executed.\n",
2022 cgraph_node_name (node
));
2025 else if (d
.maybe_executed_once
&& node
->frequency
!= NODE_FREQUENCY_EXECUTED_ONCE
)
2027 node
->frequency
= NODE_FREQUENCY_EXECUTED_ONCE
;
2029 fprintf (dump_file
, "Node %s promoted to executed once.\n",
2030 cgraph_node_name (node
));
2036 /* Return true when NODE can not return or throw and thus
2037 it is safe to ignore its side effects for IPA analysis. */
2040 cgraph_node_cannot_return (struct cgraph_node
*node
)
2042 int flags
= flags_from_decl_or_type (node
->symbol
.decl
);
2043 if (!flag_exceptions
)
2044 return (flags
& ECF_NORETURN
) != 0;
2046 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2047 == (ECF_NORETURN
| ECF_NOTHROW
));
2050 /* Return true when call of E can not lead to return from caller
2051 and thus it is safe to ignore its side effects for IPA analysis
2052 when computing side effects of the caller.
2053 FIXME: We could actually mark all edges that have no reaching
2054 patch to EXIT_BLOCK_PTR or throw to get better results. */
2056 cgraph_edge_cannot_lead_to_return (struct cgraph_edge
*e
)
2058 if (cgraph_node_cannot_return (e
->caller
))
2060 if (e
->indirect_unknown_callee
)
2062 int flags
= e
->indirect_info
->ecf_flags
;
2063 if (!flag_exceptions
)
2064 return (flags
& ECF_NORETURN
) != 0;
2066 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2067 == (ECF_NORETURN
| ECF_NOTHROW
));
2070 return cgraph_node_cannot_return (e
->callee
);
2073 /* Return true when function NODE can be removed from callgraph
2074 if all direct calls are eliminated. */
2077 cgraph_can_remove_if_no_direct_calls_and_refs_p (struct cgraph_node
*node
)
2079 gcc_assert (!node
->global
.inlined_to
);
2080 /* Extern inlines can always go, we will use the external definition. */
2081 if (DECL_EXTERNAL (node
->symbol
.decl
))
2083 /* When function is needed, we can not remove it. */
2084 if (node
->symbol
.force_output
|| node
->symbol
.used_from_other_partition
)
2086 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
)
2087 || DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2089 /* Only COMDAT functions can be removed if externally visible. */
2090 if (node
->symbol
.externally_visible
2091 && (!DECL_COMDAT (node
->symbol
.decl
)
2092 || node
->symbol
.forced_by_abi
2093 || symtab_used_from_object_file_p ((symtab_node
) node
)))
2098 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2101 nonremovable_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2103 return !cgraph_can_remove_if_no_direct_calls_and_refs_p (node
);
2106 /* Return true when function NODE and its aliases can be removed from callgraph
2107 if all direct calls are eliminated. */
2110 cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node
*node
)
2112 /* Extern inlines can always go, we will use the external definition. */
2113 if (DECL_EXTERNAL (node
->symbol
.decl
))
2115 if (node
->symbol
.address_taken
)
2117 return !cgraph_for_node_and_aliases (node
, nonremovable_p
, NULL
, true);
2120 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2123 used_from_object_file_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2125 return symtab_used_from_object_file_p ((symtab_node
) node
);
2128 /* Return true when function NODE can be expected to be removed
2129 from program when direct calls in this compilation unit are removed.
2131 As a special case COMDAT functions are
2132 cgraph_can_remove_if_no_direct_calls_p while the are not
2133 cgraph_only_called_directly_p (it is possible they are called from other
2136 This function behaves as cgraph_only_called_directly_p because eliminating
2137 all uses of COMDAT function does not make it necessarily disappear from
2138 the program unless we are compiling whole program or we do LTO. In this
2139 case we know we win since dynamic linking will not really discard the
2140 linkonce section. */
2143 cgraph_will_be_removed_from_program_if_no_direct_calls (struct cgraph_node
*node
)
2145 gcc_assert (!node
->global
.inlined_to
);
2146 if (cgraph_for_node_and_aliases (node
, used_from_object_file_p
, NULL
, true))
2148 if (!in_lto_p
&& !flag_whole_program
)
2149 return cgraph_only_called_directly_p (node
);
2152 if (DECL_EXTERNAL (node
->symbol
.decl
))
2154 return cgraph_can_remove_if_no_direct_calls_p (node
);
2159 /* Worker for cgraph_only_called_directly_p. */
2162 cgraph_not_only_called_directly_p_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2164 return !cgraph_only_called_directly_or_aliased_p (node
);
2167 /* Return true when function NODE and all its aliases are only called
2169 i.e. it is not externally visible, address was not taken and
2170 it is not used in any other non-standard way. */
2173 cgraph_only_called_directly_p (struct cgraph_node
*node
)
2175 gcc_assert (cgraph_function_or_thunk_node (node
, NULL
) == node
);
2176 return !cgraph_for_node_and_aliases (node
, cgraph_not_only_called_directly_p_1
,
2181 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2184 collect_callers_of_node_1 (struct cgraph_node
*node
, void *data
)
2186 vec
<cgraph_edge_p
> *redirect_callers
= (vec
<cgraph_edge_p
> *)data
;
2187 struct cgraph_edge
*cs
;
2188 enum availability avail
;
2189 cgraph_function_or_thunk_node (node
, &avail
);
2191 if (avail
> AVAIL_OVERWRITABLE
)
2192 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2193 if (!cs
->indirect_inlining_edge
)
2194 redirect_callers
->safe_push (cs
);
2198 /* Collect all callers of NODE and its aliases that are known to lead to NODE
2199 (i.e. are not overwritable). */
2202 collect_callers_of_node (struct cgraph_node
*node
)
2204 vec
<cgraph_edge_p
> redirect_callers
= vNULL
;
2205 cgraph_for_node_and_aliases (node
, collect_callers_of_node_1
,
2206 &redirect_callers
, false);
2207 return redirect_callers
;
2210 /* Return TRUE if NODE2 is equivalent to NODE or its clone. */
2212 clone_of_p (struct cgraph_node
*node
, struct cgraph_node
*node2
)
2214 node
= cgraph_function_or_thunk_node (node
, NULL
);
2215 node2
= cgraph_function_or_thunk_node (node2
, NULL
);
2216 while (node
!= node2
&& node2
)
2217 node2
= node2
->clone_of
;
2218 return node2
!= NULL
;
2221 /* Verify edge E count and frequency. */
2224 verify_edge_count_and_frequency (struct cgraph_edge
*e
)
2226 bool error_found
= false;
2229 error ("caller edge count is negative");
2232 if (e
->frequency
< 0)
2234 error ("caller edge frequency is negative");
2237 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2239 error ("caller edge frequency is too large");
2242 if (gimple_has_body_p (e
->caller
->symbol
.decl
)
2243 && !e
->caller
->global
.inlined_to
2244 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2245 Remove this once edges are actually removed from the function at that time. */
2247 || (inline_edge_summary_vec
.exists ()
2248 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2249 || !inline_edge_summary (e
)->predicate
)))
2251 != compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2252 gimple_bb (e
->call_stmt
))))
2254 error ("caller edge frequency %i does not match BB frequency %i",
2256 compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2257 gimple_bb (e
->call_stmt
)));
2263 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2265 cgraph_debug_gimple_stmt (struct function
*this_cfun
, gimple stmt
)
2267 bool fndecl_was_null
= false;
2268 /* debug_gimple_stmt needs correct cfun */
2269 if (cfun
!= this_cfun
)
2270 set_cfun (this_cfun
);
2271 /* ...and an actual current_function_decl */
2272 if (!current_function_decl
)
2274 current_function_decl
= this_cfun
->decl
;
2275 fndecl_was_null
= true;
2277 debug_gimple_stmt (stmt
);
2278 if (fndecl_was_null
)
2279 current_function_decl
= NULL
;
2282 /* Verify that call graph edge E corresponds to DECL from the associated
2283 statement. Return true if the verification should fail. */
2286 verify_edge_corresponds_to_fndecl (struct cgraph_edge
*e
, tree decl
)
2288 struct cgraph_node
*node
;
2290 if (!decl
|| e
->callee
->global
.inlined_to
)
2292 node
= cgraph_get_node (decl
);
2294 /* We do not know if a node from a different partition is an alias or what it
2295 aliases and therefore cannot do the former_clone_of check reliably. */
2296 if (!node
|| node
->symbol
.in_other_partition
)
2298 node
= cgraph_function_or_thunk_node (node
, NULL
);
2300 if (e
->callee
->former_clone_of
!= node
->symbol
.decl
2301 /* IPA-CP sometimes redirect edge to clone and then back to the former
2302 function. This ping-pong has to go, eventually. */
2303 && (node
!= cgraph_function_or_thunk_node (e
->callee
, NULL
))
2304 && !clone_of_p (cgraph_function_or_thunk_node (node
, NULL
), e
->callee
))
2310 /* Verify cgraph nodes of given cgraph node. */
2312 verify_cgraph_node (struct cgraph_node
*node
)
2314 struct cgraph_edge
*e
;
2315 struct function
*this_cfun
= DECL_STRUCT_FUNCTION (node
->symbol
.decl
);
2316 basic_block this_block
;
2317 gimple_stmt_iterator gsi
;
2318 bool error_found
= false;
2323 timevar_push (TV_CGRAPH_VERIFY
);
2324 error_found
|= verify_symtab_base ((symtab_node
) node
);
2325 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2328 error ("aux field set for edge %s->%s",
2329 identifier_to_locale (cgraph_node_name (e
->caller
)),
2330 identifier_to_locale (cgraph_node_name (e
->callee
)));
2333 if (node
->count
< 0)
2335 error ("execution count is negative");
2338 if (node
->global
.inlined_to
&& node
->symbol
.same_comdat_group
)
2340 error ("inline clone in same comdat group list");
2343 if (!node
->symbol
.definition
&& node
->local
.local
)
2345 error ("local symbols must be defined");
2348 if (node
->global
.inlined_to
&& node
->symbol
.externally_visible
)
2350 error ("externally visible inline clone");
2353 if (node
->global
.inlined_to
&& node
->symbol
.address_taken
)
2355 error ("inline clone with address taken");
2358 if (node
->global
.inlined_to
&& node
->symbol
.force_output
)
2360 error ("inline clone is forced to output");
2363 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2367 error ("aux field set for indirect edge from %s",
2368 identifier_to_locale (cgraph_node_name (e
->caller
)));
2371 if (!e
->indirect_unknown_callee
2372 || !e
->indirect_info
)
2374 error ("An indirect edge from %s is not marked as indirect or has "
2375 "associated indirect_info, the corresponding statement is: ",
2376 identifier_to_locale (cgraph_node_name (e
->caller
)));
2377 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2381 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2383 if (verify_edge_count_and_frequency (e
))
2385 if (!e
->inline_failed
)
2387 if (node
->global
.inlined_to
2388 != (e
->caller
->global
.inlined_to
2389 ? e
->caller
->global
.inlined_to
: e
->caller
))
2391 error ("inlined_to pointer is wrong");
2394 if (node
->callers
->next_caller
)
2396 error ("multiple inline callers");
2401 if (node
->global
.inlined_to
)
2403 error ("inlined_to pointer set for noninline callers");
2407 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2408 if (verify_edge_count_and_frequency (e
))
2410 if (!node
->callers
&& node
->global
.inlined_to
)
2412 error ("inlined_to pointer is set but no predecessors found");
2415 if (node
->global
.inlined_to
== node
)
2417 error ("inlined_to pointer refers to itself");
2423 struct cgraph_node
*n
;
2424 for (n
= node
->clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2429 error ("node has wrong clone_of");
2435 struct cgraph_node
*n
;
2436 for (n
= node
->clones
; n
; n
= n
->next_sibling_clone
)
2437 if (n
->clone_of
!= node
)
2441 error ("node has wrong clone list");
2445 if ((node
->prev_sibling_clone
|| node
->next_sibling_clone
) && !node
->clone_of
)
2447 error ("node is in clone list but it is not clone");
2450 if (!node
->prev_sibling_clone
&& node
->clone_of
&& node
->clone_of
->clones
!= node
)
2452 error ("node has wrong prev_clone pointer");
2455 if (node
->prev_sibling_clone
&& node
->prev_sibling_clone
->next_sibling_clone
!= node
)
2457 error ("double linked list of clones corrupted");
2461 if (node
->symbol
.analyzed
&& node
->symbol
.alias
)
2463 bool ref_found
= false;
2465 struct ipa_ref
*ref
;
2469 error ("Alias has call edges");
2472 for (i
= 0; ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
,
2474 if (ref
->use
!= IPA_REF_ALIAS
)
2476 error ("Alias has non-alias reference");
2481 error ("Alias has more than one alias reference");
2488 error ("Analyzed alias has no reference");
2492 if (node
->symbol
.analyzed
&& node
->thunk
.thunk_p
)
2496 error ("No edge out of thunk node");
2499 else if (node
->callees
->next_callee
)
2501 error ("More than one edge out of thunk node");
2504 if (gimple_has_body_p (node
->symbol
.decl
))
2506 error ("Thunk is not supposed to have body");
2510 else if (node
->symbol
.analyzed
&& gimple_has_body_p (node
->symbol
.decl
)
2511 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)
2512 && (!DECL_EXTERNAL (node
->symbol
.decl
) || node
->global
.inlined_to
)
2517 /* Reach the trees by walking over the CFG, and note the
2518 enclosing basic-blocks in the call edges. */
2519 FOR_EACH_BB_FN (this_block
, this_cfun
)
2520 for (gsi
= gsi_start_bb (this_block
);
2524 gimple stmt
= gsi_stmt (gsi
);
2525 if (is_gimple_call (stmt
))
2527 struct cgraph_edge
*e
= cgraph_edge (node
, stmt
);
2528 tree decl
= gimple_call_fndecl (stmt
);
2533 error ("shared call_stmt:");
2534 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2537 if (!e
->indirect_unknown_callee
)
2539 if (verify_edge_corresponds_to_fndecl (e
, decl
))
2541 error ("edge points to wrong declaration:");
2542 debug_tree (e
->callee
->symbol
.decl
);
2543 fprintf (stderr
," Instead of:");
2550 error ("an indirect edge with unknown callee "
2551 "corresponding to a call_stmt with "
2552 "a known declaration:");
2554 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2560 error ("missing callgraph edge for call stmt:");
2561 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2568 /* No CFG available?! */
2571 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2575 error ("edge %s->%s has no corresponding call_stmt",
2576 identifier_to_locale (cgraph_node_name (e
->caller
)),
2577 identifier_to_locale (cgraph_node_name (e
->callee
)));
2578 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2583 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2587 error ("an indirect edge from %s has no corresponding call_stmt",
2588 identifier_to_locale (cgraph_node_name (e
->caller
)));
2589 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2597 dump_cgraph_node (stderr
, node
);
2598 internal_error ("verify_cgraph_node failed");
2600 timevar_pop (TV_CGRAPH_VERIFY
);
2603 /* Verify whole cgraph structure. */
2605 verify_cgraph (void)
2607 struct cgraph_node
*node
;
2612 FOR_EACH_FUNCTION (node
)
2613 verify_cgraph_node (node
);
2616 /* Create external decl node for DECL.
2617 The difference i nbetween cgraph_get_create_node and
2618 cgraph_get_create_real_symbol_node is that cgraph_get_create_node
2619 may return inline clone, while cgraph_get_create_real_symbol_node
2620 will create a new node in this case.
2621 FIXME: This function should be removed once clones are put out of decl
2624 struct cgraph_node
*
2625 cgraph_get_create_real_symbol_node (tree decl
)
2627 struct cgraph_node
*first_clone
= cgraph_get_node (decl
);
2628 struct cgraph_node
*node
;
2629 /* create symbol table node. even if inline clone exists, we can not take
2630 it as a target of non-inlined call. */
2631 node
= cgraph_get_node (decl
);
2632 if (node
&& !node
->global
.inlined_to
)
2635 node
= cgraph_create_node (decl
);
2637 /* ok, we previously inlined the function, then removed the offline copy and
2638 now we want it back for external call. this can happen when devirtualizing
2639 while inlining function called once that happens after extern inlined and
2640 virtuals are already removed. in this case introduce the external node
2641 and make it available for call. */
2644 first_clone
->clone_of
= node
;
2645 node
->clones
= first_clone
;
2646 symtab_prevail_in_asm_name_hash ((symtab_node
) node
);
2647 symtab_insert_node_to_hashtable ((symtab_node
) node
);
2649 fprintf (dump_file
, "Introduced new external node "
2650 "(%s/%i) and turned into root of the clone tree.\n",
2651 xstrdup (cgraph_node_name (node
)), node
->symbol
.order
);
2654 fprintf (dump_file
, "Introduced new external node "
2655 "(%s/%i).\n", xstrdup (cgraph_node_name (node
)),
2656 node
->symbol
.order
);
2661 /* Given NODE, walk the alias chain to return the function NODE is alias of.
2662 Walk through thunk, too.
2663 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
2665 struct cgraph_node
*
2666 cgraph_function_node (struct cgraph_node
*node
, enum availability
*availability
)
2670 node
= cgraph_function_or_thunk_node (node
, availability
);
2671 if (node
->thunk
.thunk_p
)
2673 node
= node
->callees
->callee
;
2676 enum availability a
;
2677 a
= cgraph_function_body_availability (node
);
2678 if (a
< *availability
)
2681 node
= cgraph_function_or_thunk_node (node
, availability
);
2683 } while (node
&& node
->thunk
.thunk_p
);
2687 #include "gt-cgraph.h"