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 same_body_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 decl
)
561 struct cgraph_node
*alias_node
;
563 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
564 gcc_assert (TREE_CODE (alias
) == FUNCTION_DECL
);
565 alias_node
= cgraph_get_create_node (alias
);
566 gcc_assert (!alias_node
->symbol
.definition
);
567 alias_node
->thunk
.alias
= decl
;
568 alias_node
->symbol
.definition
= true;
569 alias_node
->symbol
.alias
= true;
573 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
575 Same body aliases are output whenever the body of DECL is output,
576 and cgraph_get_node (ALIAS) transparently returns cgraph_get_node (DECL). */
579 cgraph_same_body_alias (struct cgraph_node
*decl_node ATTRIBUTE_UNUSED
, tree alias
, tree decl
)
581 struct cgraph_node
*n
;
582 #ifndef ASM_OUTPUT_DEF
583 /* If aliases aren't supported by the assembler, fail. */
586 /* Langhooks can create same body aliases of symbols not defined.
587 Those are useless. Drop them on the floor. */
588 if (cgraph_global_info_ready
)
591 n
= cgraph_create_function_alias (alias
, decl
);
592 n
->same_body_alias
= true;
593 if (same_body_aliases_done
)
594 ipa_record_reference ((symtab_node
)n
, (symtab_node
)cgraph_get_node (decl
),
595 IPA_REF_ALIAS
, NULL
);
599 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
600 aliases DECL with an adjustments made into the first parameter.
601 See comments in thunk_adjust for detail on the parameters. */
604 cgraph_add_thunk (struct cgraph_node
*decl_node ATTRIBUTE_UNUSED
,
605 tree alias
, tree decl ATTRIBUTE_UNUSED
,
607 HOST_WIDE_INT fixed_offset
, HOST_WIDE_INT virtual_value
,
611 struct cgraph_node
*node
;
613 node
= cgraph_get_node (alias
);
616 gcc_assert (node
->symbol
.definition
);
617 gcc_assert (!node
->symbol
.alias
);
618 gcc_assert (!node
->thunk
.thunk_p
);
619 cgraph_remove_node (node
);
622 node
= cgraph_create_node (alias
);
623 gcc_checking_assert (!virtual_offset
624 || tree_to_double_int (virtual_offset
) ==
625 double_int::from_shwi (virtual_value
));
626 node
->thunk
.fixed_offset
= fixed_offset
;
627 node
->thunk
.this_adjusting
= this_adjusting
;
628 node
->thunk
.virtual_value
= virtual_value
;
629 node
->thunk
.virtual_offset_p
= virtual_offset
!= NULL
;
630 node
->thunk
.alias
= real_alias
;
631 node
->thunk
.thunk_p
= true;
632 node
->symbol
.definition
= true;
637 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
638 Return NULL if there's no such node. */
641 cgraph_node_for_asm (tree asmname
)
643 /* We do not want to look at inline clones. */
644 for (symtab_node node
= symtab_node_for_asm (asmname
);
646 node
= node
->symbol
.next_sharing_asm_name
)
648 cgraph_node
*cn
= dyn_cast
<cgraph_node
> (node
);
649 if (cn
&& !cn
->global
.inlined_to
)
655 /* Returns a hash value for X (which really is a cgraph_edge). */
658 edge_hash (const void *x
)
660 return htab_hash_pointer (((const struct cgraph_edge
*) x
)->call_stmt
);
663 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
666 edge_eq (const void *x
, const void *y
)
668 return ((const struct cgraph_edge
*) x
)->call_stmt
== y
;
671 /* Add call graph edge E to call site hash of its caller. */
674 cgraph_add_edge_to_call_site_hash (struct cgraph_edge
*e
)
677 slot
= htab_find_slot_with_hash (e
->caller
->call_site_hash
,
679 htab_hash_pointer (e
->call_stmt
),
685 /* Return the callgraph edge representing the GIMPLE_CALL statement
689 cgraph_edge (struct cgraph_node
*node
, gimple call_stmt
)
691 struct cgraph_edge
*e
, *e2
;
694 if (node
->call_site_hash
)
695 return (struct cgraph_edge
*)
696 htab_find_with_hash (node
->call_site_hash
, call_stmt
,
697 htab_hash_pointer (call_stmt
));
699 /* This loop may turn out to be performance problem. In such case adding
700 hashtables into call nodes with very many edges is probably best
701 solution. It is not good idea to add pointer into CALL_EXPR itself
702 because we want to make possible having multiple cgraph nodes representing
703 different clones of the same body before the body is actually cloned. */
704 for (e
= node
->callees
; e
; e
= e
->next_callee
)
706 if (e
->call_stmt
== call_stmt
)
712 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
714 if (e
->call_stmt
== call_stmt
)
721 node
->call_site_hash
= htab_create_ggc (120, edge_hash
, edge_eq
, NULL
);
722 for (e2
= node
->callees
; e2
; e2
= e2
->next_callee
)
723 cgraph_add_edge_to_call_site_hash (e2
);
724 for (e2
= node
->indirect_calls
; e2
; e2
= e2
->next_callee
)
725 cgraph_add_edge_to_call_site_hash (e2
);
732 /* Change field call_stmt of edge E to NEW_STMT. */
735 cgraph_set_call_stmt (struct cgraph_edge
*e
, gimple new_stmt
)
739 if (e
->caller
->call_site_hash
)
741 htab_remove_elt_with_hash (e
->caller
->call_site_hash
,
743 htab_hash_pointer (e
->call_stmt
));
746 e
->call_stmt
= new_stmt
;
747 if (e
->indirect_unknown_callee
748 && (decl
= gimple_call_fndecl (new_stmt
)))
750 /* Constant propagation (and possibly also inlining?) can turn an
751 indirect call into a direct one. */
752 struct cgraph_node
*new_callee
= cgraph_get_node (decl
);
754 gcc_checking_assert (new_callee
);
755 cgraph_make_edge_direct (e
, new_callee
);
758 push_cfun (DECL_STRUCT_FUNCTION (e
->caller
->symbol
.decl
));
759 e
->can_throw_external
= stmt_can_throw_external (new_stmt
);
761 if (e
->caller
->call_site_hash
)
762 cgraph_add_edge_to_call_site_hash (e
);
765 /* Allocate a cgraph_edge structure and fill it with data according to the
766 parameters of which only CALLEE can be NULL (when creating an indirect call
769 static struct cgraph_edge
*
770 cgraph_create_edge_1 (struct cgraph_node
*caller
, struct cgraph_node
*callee
,
771 gimple call_stmt
, gcov_type count
, int freq
)
773 struct cgraph_edge
*edge
;
775 /* LTO does not actually have access to the call_stmt since these
776 have not been loaded yet. */
779 /* This is a rather expensive check possibly triggering
780 construction of call stmt hashtable. */
781 gcc_checking_assert (!cgraph_edge (caller
, call_stmt
));
783 gcc_assert (is_gimple_call (call_stmt
));
789 free_edges
= NEXT_FREE_EDGE (edge
);
793 edge
= ggc_alloc_cgraph_edge ();
794 edge
->uid
= cgraph_edge_max_uid
++;
798 edge
->caller
= caller
;
799 edge
->callee
= callee
;
800 edge
->prev_caller
= NULL
;
801 edge
->next_caller
= NULL
;
802 edge
->prev_callee
= NULL
;
803 edge
->next_callee
= NULL
;
806 gcc_assert (count
>= 0);
807 edge
->frequency
= freq
;
808 gcc_assert (freq
>= 0);
809 gcc_assert (freq
<= CGRAPH_FREQ_MAX
);
811 edge
->call_stmt
= call_stmt
;
812 push_cfun (DECL_STRUCT_FUNCTION (caller
->symbol
.decl
));
813 edge
->can_throw_external
814 = call_stmt
? stmt_can_throw_external (call_stmt
) : false;
817 && callee
&& callee
->symbol
.decl
818 && !gimple_check_call_matching_types (call_stmt
, callee
->symbol
.decl
))
819 edge
->call_stmt_cannot_inline_p
= true;
821 edge
->call_stmt_cannot_inline_p
= false;
822 if (call_stmt
&& caller
->call_site_hash
)
823 cgraph_add_edge_to_call_site_hash (edge
);
825 edge
->indirect_info
= NULL
;
826 edge
->indirect_inlining_edge
= 0;
831 /* Create edge from CALLER to CALLEE in the cgraph. */
834 cgraph_create_edge (struct cgraph_node
*caller
, struct cgraph_node
*callee
,
835 gimple call_stmt
, gcov_type count
, int freq
)
837 struct cgraph_edge
*edge
= cgraph_create_edge_1 (caller
, callee
, call_stmt
,
840 edge
->indirect_unknown_callee
= 0;
841 initialize_inline_failed (edge
);
843 edge
->next_caller
= callee
->callers
;
845 callee
->callers
->prev_caller
= edge
;
846 edge
->next_callee
= caller
->callees
;
848 caller
->callees
->prev_callee
= edge
;
849 caller
->callees
= edge
;
850 callee
->callers
= edge
;
855 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
857 struct cgraph_indirect_call_info
*
858 cgraph_allocate_init_indirect_info (void)
860 struct cgraph_indirect_call_info
*ii
;
862 ii
= ggc_alloc_cleared_cgraph_indirect_call_info ();
863 ii
->param_index
= -1;
867 /* Create an indirect edge with a yet-undetermined callee where the call
868 statement destination is a formal parameter of the caller with index
872 cgraph_create_indirect_edge (struct cgraph_node
*caller
, gimple call_stmt
,
874 gcov_type count
, int freq
)
876 struct cgraph_edge
*edge
= cgraph_create_edge_1 (caller
, NULL
, call_stmt
,
879 edge
->indirect_unknown_callee
= 1;
880 initialize_inline_failed (edge
);
882 edge
->indirect_info
= cgraph_allocate_init_indirect_info ();
883 edge
->indirect_info
->ecf_flags
= ecf_flags
;
885 edge
->next_callee
= caller
->indirect_calls
;
886 if (caller
->indirect_calls
)
887 caller
->indirect_calls
->prev_callee
= edge
;
888 caller
->indirect_calls
= edge
;
893 /* Remove the edge E from the list of the callers of the callee. */
896 cgraph_edge_remove_callee (struct cgraph_edge
*e
)
898 gcc_assert (!e
->indirect_unknown_callee
);
900 e
->prev_caller
->next_caller
= e
->next_caller
;
902 e
->next_caller
->prev_caller
= e
->prev_caller
;
904 e
->callee
->callers
= e
->next_caller
;
907 /* Remove the edge E from the list of the callees of the caller. */
910 cgraph_edge_remove_caller (struct cgraph_edge
*e
)
913 e
->prev_callee
->next_callee
= e
->next_callee
;
915 e
->next_callee
->prev_callee
= e
->prev_callee
;
918 if (e
->indirect_unknown_callee
)
919 e
->caller
->indirect_calls
= e
->next_callee
;
921 e
->caller
->callees
= e
->next_callee
;
923 if (e
->caller
->call_site_hash
)
924 htab_remove_elt_with_hash (e
->caller
->call_site_hash
,
926 htab_hash_pointer (e
->call_stmt
));
929 /* Put the edge onto the free list. */
932 cgraph_free_edge (struct cgraph_edge
*e
)
936 /* Clear out the edge so we do not dangle pointers. */
937 memset (e
, 0, sizeof (*e
));
939 NEXT_FREE_EDGE (e
) = free_edges
;
943 /* Remove the edge E in the cgraph. */
946 cgraph_remove_edge (struct cgraph_edge
*e
)
948 /* Call all edge removal hooks. */
949 cgraph_call_edge_removal_hooks (e
);
951 if (!e
->indirect_unknown_callee
)
952 /* Remove from callers list of the callee. */
953 cgraph_edge_remove_callee (e
);
955 /* Remove from callees list of the callers. */
956 cgraph_edge_remove_caller (e
);
958 /* Put the edge onto the free list. */
959 cgraph_free_edge (e
);
962 /* Set callee of call graph edge E and add it to the corresponding set of
966 cgraph_set_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
968 e
->prev_caller
= NULL
;
970 n
->callers
->prev_caller
= e
;
971 e
->next_caller
= n
->callers
;
976 /* Redirect callee of E to N. The function does not update underlying
980 cgraph_redirect_edge_callee (struct cgraph_edge
*e
, struct cgraph_node
*n
)
982 /* Remove from callers list of the current callee. */
983 cgraph_edge_remove_callee (e
);
985 /* Insert to callers list of the new callee. */
986 cgraph_set_edge_callee (e
, n
);
989 /* Make an indirect EDGE with an unknown callee an ordinary edge leading to
990 CALLEE. DELTA is an integer constant that is to be added to the this
991 pointer (first parameter) to compensate for skipping a thunk adjustment. */
994 cgraph_make_edge_direct (struct cgraph_edge
*edge
, struct cgraph_node
*callee
)
996 edge
->indirect_unknown_callee
= 0;
998 /* Get the edge out of the indirect edge list. */
999 if (edge
->prev_callee
)
1000 edge
->prev_callee
->next_callee
= edge
->next_callee
;
1001 if (edge
->next_callee
)
1002 edge
->next_callee
->prev_callee
= edge
->prev_callee
;
1003 if (!edge
->prev_callee
)
1004 edge
->caller
->indirect_calls
= edge
->next_callee
;
1006 /* Put it into the normal callee list */
1007 edge
->prev_callee
= NULL
;
1008 edge
->next_callee
= edge
->caller
->callees
;
1009 if (edge
->caller
->callees
)
1010 edge
->caller
->callees
->prev_callee
= edge
;
1011 edge
->caller
->callees
= edge
;
1013 /* Insert to callers list of the new callee. */
1014 cgraph_set_edge_callee (edge
, callee
);
1016 if (edge
->call_stmt
)
1017 edge
->call_stmt_cannot_inline_p
1018 = !gimple_check_call_matching_types (edge
->call_stmt
, callee
->symbol
.decl
);
1020 /* We need to re-determine the inlining status of the edge. */
1021 initialize_inline_failed (edge
);
1024 /* If necessary, change the function declaration in the call statement
1025 associated with E so that it corresponds to the edge callee. */
1028 cgraph_redirect_edge_call_stmt_to_callee (struct cgraph_edge
*e
)
1030 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1032 gimple_stmt_iterator gsi
;
1033 #ifdef ENABLE_CHECKING
1034 struct cgraph_node
*node
;
1037 if (e
->indirect_unknown_callee
1038 || decl
== e
->callee
->symbol
.decl
)
1039 return e
->call_stmt
;
1041 #ifdef ENABLE_CHECKING
1044 node
= cgraph_get_node (decl
);
1045 gcc_assert (!node
|| !node
->clone
.combined_args_to_skip
);
1049 if (cgraph_dump_file
)
1051 fprintf (cgraph_dump_file
, "updating call of %s/%i -> %s/%i: ",
1052 xstrdup (cgraph_node_name (e
->caller
)), e
->caller
->symbol
.order
,
1053 xstrdup (cgraph_node_name (e
->callee
)), e
->callee
->symbol
.order
);
1054 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1055 if (e
->callee
->clone
.combined_args_to_skip
)
1057 fprintf (cgraph_dump_file
, " combined args to skip: ");
1058 dump_bitmap (cgraph_dump_file
,
1059 e
->callee
->clone
.combined_args_to_skip
);
1063 if (e
->callee
->clone
.combined_args_to_skip
)
1068 = gimple_call_copy_skip_args (e
->call_stmt
,
1069 e
->callee
->clone
.combined_args_to_skip
);
1070 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1071 gimple_call_set_fntype (new_stmt
, gimple_call_fntype (e
->call_stmt
));
1073 if (gimple_vdef (new_stmt
)
1074 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1075 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1077 gsi
= gsi_for_stmt (e
->call_stmt
);
1078 gsi_replace (&gsi
, new_stmt
, false);
1079 /* We need to defer cleaning EH info on the new statement to
1080 fixup-cfg. We may not have dominator information at this point
1081 and thus would end up with unreachable blocks and have no way
1082 to communicate that we need to run CFG cleanup then. */
1083 lp_nr
= lookup_stmt_eh_lp (e
->call_stmt
);
1086 remove_stmt_from_eh_lp (e
->call_stmt
);
1087 add_stmt_to_eh_lp (new_stmt
, lp_nr
);
1092 new_stmt
= e
->call_stmt
;
1093 gimple_call_set_fndecl (new_stmt
, e
->callee
->symbol
.decl
);
1094 update_stmt (new_stmt
);
1097 cgraph_set_call_stmt_including_clones (e
->caller
, e
->call_stmt
, new_stmt
);
1099 if (cgraph_dump_file
)
1101 fprintf (cgraph_dump_file
, " updated to:");
1102 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1107 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1108 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1109 of OLD_STMT if it was previously call statement.
1110 If NEW_STMT is NULL, the call has been dropped without any
1114 cgraph_update_edges_for_call_stmt_node (struct cgraph_node
*node
,
1115 gimple old_stmt
, tree old_call
,
1118 tree new_call
= (new_stmt
&& is_gimple_call (new_stmt
))
1119 ? gimple_call_fndecl (new_stmt
) : 0;
1121 /* We are seeing indirect calls, then there is nothing to update. */
1122 if (!new_call
&& !old_call
)
1124 /* See if we turned indirect call into direct call or folded call to one builtin
1125 into different builtin. */
1126 if (old_call
!= new_call
)
1128 struct cgraph_edge
*e
= cgraph_edge (node
, old_stmt
);
1129 struct cgraph_edge
*ne
= NULL
;
1135 /* See if the edge is already there and has the correct callee. It
1136 might be so because of indirect inlining has already updated
1137 it. We also might've cloned and redirected the edge. */
1138 if (new_call
&& e
->callee
)
1140 struct cgraph_node
*callee
= e
->callee
;
1143 if (callee
->symbol
.decl
== new_call
1144 || callee
->former_clone_of
== new_call
)
1146 callee
= callee
->clone_of
;
1150 /* Otherwise remove edge and create new one; we can't simply redirect
1151 since function has changed, so inline plan and other information
1152 attached to edge is invalid. */
1154 frequency
= e
->frequency
;
1155 cgraph_remove_edge (e
);
1159 /* We are seeing new direct call; compute profile info based on BB. */
1160 basic_block bb
= gimple_bb (new_stmt
);
1162 frequency
= compute_call_stmt_bb_frequency (current_function_decl
,
1168 ne
= cgraph_create_edge (node
, cgraph_get_create_node (new_call
),
1169 new_stmt
, count
, frequency
);
1170 gcc_assert (ne
->inline_failed
);
1173 /* We only updated the call stmt; update pointer in cgraph edge.. */
1174 else if (old_stmt
!= new_stmt
)
1175 cgraph_set_call_stmt (cgraph_edge (node
, old_stmt
), new_stmt
);
1178 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1179 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1180 of OLD_STMT before it was updated (updating can happen inplace). */
1183 cgraph_update_edges_for_call_stmt (gimple old_stmt
, tree old_decl
, gimple new_stmt
)
1185 struct cgraph_node
*orig
= cgraph_get_node (cfun
->decl
);
1186 struct cgraph_node
*node
;
1188 gcc_checking_assert (orig
);
1189 cgraph_update_edges_for_call_stmt_node (orig
, old_stmt
, old_decl
, new_stmt
);
1191 for (node
= orig
->clones
; node
!= orig
;)
1193 cgraph_update_edges_for_call_stmt_node (node
, old_stmt
, old_decl
, new_stmt
);
1195 node
= node
->clones
;
1196 else if (node
->next_sibling_clone
)
1197 node
= node
->next_sibling_clone
;
1200 while (node
!= orig
&& !node
->next_sibling_clone
)
1201 node
= node
->clone_of
;
1203 node
= node
->next_sibling_clone
;
1209 /* Remove all callees from the node. */
1212 cgraph_node_remove_callees (struct cgraph_node
*node
)
1214 struct cgraph_edge
*e
, *f
;
1216 /* It is sufficient to remove the edges from the lists of callers of
1217 the callees. The callee list of the node can be zapped with one
1219 for (e
= node
->callees
; e
; e
= f
)
1222 cgraph_call_edge_removal_hooks (e
);
1223 if (!e
->indirect_unknown_callee
)
1224 cgraph_edge_remove_callee (e
);
1225 cgraph_free_edge (e
);
1227 for (e
= node
->indirect_calls
; e
; e
= f
)
1230 cgraph_call_edge_removal_hooks (e
);
1231 if (!e
->indirect_unknown_callee
)
1232 cgraph_edge_remove_callee (e
);
1233 cgraph_free_edge (e
);
1235 node
->indirect_calls
= NULL
;
1236 node
->callees
= NULL
;
1237 if (node
->call_site_hash
)
1239 htab_delete (node
->call_site_hash
);
1240 node
->call_site_hash
= NULL
;
1244 /* Remove all callers from the node. */
1247 cgraph_node_remove_callers (struct cgraph_node
*node
)
1249 struct cgraph_edge
*e
, *f
;
1251 /* It is sufficient to remove the edges from the lists of callees of
1252 the callers. The caller list of the node can be zapped with one
1254 for (e
= node
->callers
; e
; e
= f
)
1257 cgraph_call_edge_removal_hooks (e
);
1258 cgraph_edge_remove_caller (e
);
1259 cgraph_free_edge (e
);
1261 node
->callers
= NULL
;
1264 /* Release memory used to represent body of function NODE.
1265 Use this only for functions that are released before being translated to
1266 target code (i.e. RTL). Functions that are compiled to RTL and beyond
1267 are free'd in final.c via free_after_compilation(). */
1270 cgraph_release_function_body (struct cgraph_node
*node
)
1272 if (DECL_STRUCT_FUNCTION (node
->symbol
.decl
))
1274 push_cfun (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
1278 cfun
->curr_properties
&= ~PROP_loops
;
1279 loop_optimizer_finalize ();
1281 if (cfun
->gimple_df
)
1284 delete_tree_cfg_annotations ();
1289 gcc_assert (dom_computed
[0] == DOM_NONE
);
1290 gcc_assert (dom_computed
[1] == DOM_NONE
);
1294 if (cfun
->value_histograms
)
1297 gimple_set_body (node
->symbol
.decl
, NULL
);
1298 node
->ipa_transforms_to_apply
.release ();
1299 /* Struct function hangs a lot of data that would leak if we didn't
1300 removed all pointers to it. */
1301 ggc_free (DECL_STRUCT_FUNCTION (node
->symbol
.decl
));
1302 DECL_STRUCT_FUNCTION (node
->symbol
.decl
) = NULL
;
1304 DECL_SAVED_TREE (node
->symbol
.decl
) = NULL
;
1305 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1306 of its associated function function declaration because it's
1307 needed to emit debug info later. */
1308 if (!node
->abstract_and_needed
&& DECL_INITIAL (node
->symbol
.decl
))
1309 DECL_INITIAL (node
->symbol
.decl
) = error_mark_node
;
1312 /* Remove the node from cgraph. */
1315 cgraph_remove_node (struct cgraph_node
*node
)
1317 struct cgraph_node
*n
;
1318 int uid
= node
->uid
;
1320 cgraph_call_node_removal_hooks (node
);
1321 cgraph_node_remove_callers (node
);
1322 cgraph_node_remove_callees (node
);
1323 node
->ipa_transforms_to_apply
.release ();
1325 /* Incremental inlining access removed nodes stored in the postorder list.
1327 node
->symbol
.force_output
= false;
1328 for (n
= node
->nested
; n
; n
= n
->next_nested
)
1330 node
->nested
= NULL
;
1333 struct cgraph_node
**node2
= &node
->origin
->nested
;
1335 while (*node2
!= node
)
1336 node2
= &(*node2
)->next_nested
;
1337 *node2
= node
->next_nested
;
1339 symtab_unregister_node ((symtab_node
)node
);
1340 if (node
->prev_sibling_clone
)
1341 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
1342 else if (node
->clone_of
)
1343 node
->clone_of
->clones
= node
->next_sibling_clone
;
1344 if (node
->next_sibling_clone
)
1345 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
1348 struct cgraph_node
*n
, *next
;
1352 for (n
= node
->clones
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1353 n
->clone_of
= node
->clone_of
;
1354 n
->clone_of
= node
->clone_of
;
1355 n
->next_sibling_clone
= node
->clone_of
->clones
;
1356 if (node
->clone_of
->clones
)
1357 node
->clone_of
->clones
->prev_sibling_clone
= n
;
1358 node
->clone_of
->clones
= node
->clones
;
1362 /* We are removing node with clones. This makes clones inconsistent,
1363 but assume they will be removed subsequently and just keep clone
1364 tree intact. This can happen in unreachable function removal since
1365 we remove unreachable functions in random order, not by bottom-up
1366 walk of clone trees. */
1367 for (n
= node
->clones
; n
; n
= next
)
1369 next
= n
->next_sibling_clone
;
1370 n
->next_sibling_clone
= NULL
;
1371 n
->prev_sibling_clone
= NULL
;
1377 /* While all the clones are removed after being proceeded, the function
1378 itself is kept in the cgraph even after it is compiled. Check whether
1379 we are done with this body and reclaim it proactively if this is the case.
1381 n
= cgraph_get_node (node
->symbol
.decl
);
1383 || (!n
->clones
&& !n
->clone_of
&& !n
->global
.inlined_to
1384 && (cgraph_global_info_ready
1385 && (TREE_ASM_WRITTEN (n
->symbol
.decl
)
1386 || DECL_EXTERNAL (n
->symbol
.decl
)
1387 || !n
->symbol
.analyzed
1388 || n
->symbol
.in_other_partition
))))
1389 cgraph_release_function_body (node
);
1391 node
->symbol
.decl
= NULL
;
1392 if (node
->call_site_hash
)
1394 htab_delete (node
->call_site_hash
);
1395 node
->call_site_hash
= NULL
;
1399 /* Clear out the node to NULL all pointers and add the node to the free
1401 memset (node
, 0, sizeof(*node
));
1402 node
->symbol
.type
= SYMTAB_FUNCTION
;
1404 SET_NEXT_FREE_NODE (node
, free_nodes
);
1408 /* Likewise indicate that a node is having address taken. */
1411 cgraph_mark_address_taken_node (struct cgraph_node
*node
)
1413 /* Indirect inlining can figure out that all uses of the address are
1415 if (node
->global
.inlined_to
)
1417 gcc_assert (cfun
->after_inlining
);
1418 gcc_assert (node
->callers
->indirect_inlining_edge
);
1421 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1422 IPA_REF_ADDR reference exists (and thus it should be set on node
1423 representing alias we take address of) and as a test whether address
1424 of the object was taken (and thus it should be set on node alias is
1425 referring to). We should remove the first use and the remove the
1427 node
->symbol
.address_taken
= 1;
1428 node
= cgraph_function_or_thunk_node (node
, NULL
);
1429 node
->symbol
.address_taken
= 1;
1432 /* Return local info for the compiled function. */
1434 struct cgraph_local_info
*
1435 cgraph_local_info (tree decl
)
1437 struct cgraph_node
*node
;
1439 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1440 node
= cgraph_get_node (decl
);
1443 return &node
->local
;
1446 /* Return local info for the compiled function. */
1448 struct cgraph_global_info
*
1449 cgraph_global_info (tree decl
)
1451 struct cgraph_node
*node
;
1453 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
&& cgraph_global_info_ready
);
1454 node
= cgraph_get_node (decl
);
1457 return &node
->global
;
1460 /* Return local info for the compiled function. */
1462 struct cgraph_rtl_info
*
1463 cgraph_rtl_info (tree decl
)
1465 struct cgraph_node
*node
;
1467 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
1468 node
= cgraph_get_node (decl
);
1470 || (decl
!= current_function_decl
1471 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)))
1476 /* Return a string describing the failure REASON. */
1479 cgraph_inline_failed_string (cgraph_inline_failed_t reason
)
1482 #define DEFCIFCODE(code, string) string,
1484 static const char *cif_string_table
[CIF_N_REASONS
] = {
1485 #include "cif-code.def"
1488 /* Signedness of an enum type is implementation defined, so cast it
1489 to unsigned before testing. */
1490 gcc_assert ((unsigned) reason
< CIF_N_REASONS
);
1491 return cif_string_table
[reason
];
1494 /* Names used to print out the availability enum. */
1495 const char * const cgraph_availability_names
[] =
1496 {"unset", "not_available", "overwritable", "available", "local"};
1499 /* Dump call graph node NODE to file F. */
1502 dump_cgraph_node (FILE *f
, struct cgraph_node
*node
)
1504 struct cgraph_edge
*edge
;
1505 int indirect_calls_count
= 0;
1507 dump_symtab_base (f
, (symtab_node
) node
);
1509 if (node
->global
.inlined_to
)
1510 fprintf (f
, " Function %s/%i is inline copy in %s/%i\n",
1511 xstrdup (cgraph_node_name (node
)),
1513 xstrdup (cgraph_node_name (node
->global
.inlined_to
)),
1514 node
->global
.inlined_to
->symbol
.order
);
1516 fprintf (f
, " Clone of %s/%i\n",
1517 cgraph_node_asm_name (node
->clone_of
),
1518 node
->clone_of
->symbol
.order
);
1519 if (cgraph_function_flags_ready
)
1520 fprintf (f
, " Availability: %s\n",
1521 cgraph_availability_names
[cgraph_function_body_availability (node
)]);
1523 fprintf (f
, " Function flags:");
1525 fprintf (f
, " executed "HOST_WIDEST_INT_PRINT_DEC
"x",
1526 (HOST_WIDEST_INT
)node
->count
);
1528 fprintf (f
, " nested in: %s", cgraph_node_asm_name (node
->origin
));
1529 if (gimple_has_body_p (node
->symbol
.decl
))
1530 fprintf (f
, " body");
1532 fprintf (f
, " process");
1533 if (node
->local
.local
)
1534 fprintf (f
, " local");
1535 if (node
->local
.redefined_extern_inline
)
1536 fprintf (f
, " redefined_extern_inline");
1537 if (node
->only_called_at_startup
)
1538 fprintf (f
, " only_called_at_startup");
1539 if (node
->only_called_at_exit
)
1540 fprintf (f
, " only_called_at_exit");
1542 fprintf (f
, " tm_clone");
1546 if (node
->thunk
.thunk_p
)
1548 fprintf (f
, " Thunk of %s (asm: %s) fixed offset %i virtual value %i has "
1549 "virtual offset %i)\n",
1550 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2),
1551 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)),
1552 (int)node
->thunk
.fixed_offset
,
1553 (int)node
->thunk
.virtual_value
,
1554 (int)node
->thunk
.virtual_offset_p
);
1556 if (node
->symbol
.alias
&& node
->thunk
.alias
1557 && DECL_P (node
->thunk
.alias
))
1559 fprintf (f
, " Alias of %s",
1560 lang_hooks
.decl_printable_name (node
->thunk
.alias
, 2));
1561 if (DECL_ASSEMBLER_NAME_SET_P (node
->thunk
.alias
))
1562 fprintf (f
, " (asm: %s)",
1563 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node
->thunk
.alias
)));
1567 fprintf (f
, " Called by: ");
1569 for (edge
= node
->callers
; edge
; edge
= edge
->next_caller
)
1571 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->caller
),
1572 edge
->caller
->symbol
.order
);
1574 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1575 (HOST_WIDEST_INT
)edge
->count
);
1576 if (edge
->frequency
)
1577 fprintf (f
, "(%.2f per call) ",
1578 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1579 if (!edge
->inline_failed
)
1580 fprintf(f
, "(inlined) ");
1581 if (edge
->indirect_inlining_edge
)
1582 fprintf(f
, "(indirect_inlining) ");
1583 if (edge
->can_throw_external
)
1584 fprintf(f
, "(can throw external) ");
1587 fprintf (f
, "\n Calls: ");
1588 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
1590 fprintf (f
, "%s/%i ", cgraph_node_asm_name (edge
->callee
),
1591 edge
->callee
->symbol
.order
);
1592 if (!edge
->inline_failed
)
1593 fprintf(f
, "(inlined) ");
1594 if (edge
->indirect_inlining_edge
)
1595 fprintf(f
, "(indirect_inlining) ");
1597 fprintf (f
, "("HOST_WIDEST_INT_PRINT_DEC
"x) ",
1598 (HOST_WIDEST_INT
)edge
->count
);
1599 if (edge
->frequency
)
1600 fprintf (f
, "(%.2f per call) ",
1601 edge
->frequency
/ (double)CGRAPH_FREQ_BASE
);
1602 if (edge
->can_throw_external
)
1603 fprintf(f
, "(can throw external) ");
1607 for (edge
= node
->indirect_calls
; edge
; edge
= edge
->next_callee
)
1608 indirect_calls_count
++;
1609 if (indirect_calls_count
)
1610 fprintf (f
, " Has %i outgoing edges for indirect calls.\n",
1611 indirect_calls_count
);
1615 /* Dump call graph node NODE to stderr. */
1618 debug_cgraph_node (struct cgraph_node
*node
)
1620 dump_cgraph_node (stderr
, node
);
1624 /* Dump the callgraph to file F. */
1627 dump_cgraph (FILE *f
)
1629 struct cgraph_node
*node
;
1631 fprintf (f
, "callgraph:\n\n");
1632 FOR_EACH_FUNCTION (node
)
1633 dump_cgraph_node (f
, node
);
1637 /* Dump the call graph to stderr. */
1642 dump_cgraph (stderr
);
1645 /* Return true when the DECL can possibly be inlined. */
1647 cgraph_function_possibly_inlined_p (tree decl
)
1649 if (!cgraph_global_info_ready
)
1650 return !DECL_UNINLINABLE (decl
);
1651 return DECL_POSSIBLY_INLINED (decl
);
1654 /* NODE is no longer nested function; update cgraph accordingly. */
1656 cgraph_unnest_node (struct cgraph_node
*node
)
1658 struct cgraph_node
**node2
= &node
->origin
->nested
;
1659 gcc_assert (node
->origin
);
1661 while (*node2
!= node
)
1662 node2
= &(*node2
)->next_nested
;
1663 *node2
= node
->next_nested
;
1664 node
->origin
= NULL
;
1667 /* Return function availability. See cgraph.h for description of individual
1670 cgraph_function_body_availability (struct cgraph_node
*node
)
1672 enum availability avail
;
1673 gcc_assert (cgraph_function_flags_ready
);
1674 if (!node
->symbol
.analyzed
)
1675 avail
= AVAIL_NOT_AVAILABLE
;
1676 else if (node
->local
.local
)
1677 avail
= AVAIL_LOCAL
;
1678 else if (!node
->symbol
.externally_visible
)
1679 avail
= AVAIL_AVAILABLE
;
1680 /* Inline functions are safe to be analyzed even if their symbol can
1681 be overwritten at runtime. It is not meaningful to enforce any sane
1682 behaviour on replacing inline function by different body. */
1683 else if (DECL_DECLARED_INLINE_P (node
->symbol
.decl
))
1684 avail
= AVAIL_AVAILABLE
;
1686 /* If the function can be overwritten, return OVERWRITABLE. Take
1687 care at least of two notable extensions - the COMDAT functions
1688 used to share template instantiations in C++ (this is symmetric
1689 to code cp_cannot_inline_tree_fn and probably shall be shared and
1690 the inlinability hooks completely eliminated).
1692 ??? Does the C++ one definition rule allow us to always return
1693 AVAIL_AVAILABLE here? That would be good reason to preserve this
1696 else if (decl_replaceable_p (node
->symbol
.decl
)
1697 && !DECL_EXTERNAL (node
->symbol
.decl
))
1698 avail
= AVAIL_OVERWRITABLE
;
1699 else avail
= AVAIL_AVAILABLE
;
1704 /* Worker for cgraph_node_can_be_local_p. */
1706 cgraph_node_cannot_be_local_p_1 (struct cgraph_node
*node
,
1707 void *data ATTRIBUTE_UNUSED
)
1709 return !(!node
->symbol
.force_output
1710 && ((DECL_COMDAT (node
->symbol
.decl
)
1711 && !node
->symbol
.same_comdat_group
)
1712 || !node
->symbol
.externally_visible
));
1715 /* Return true if NODE can be made local for API change.
1716 Extern inline functions and C++ COMDAT functions can be made local
1717 at the expense of possible code size growth if function is used in multiple
1718 compilation units. */
1720 cgraph_node_can_be_local_p (struct cgraph_node
*node
)
1722 return (!node
->symbol
.address_taken
1723 && !cgraph_for_node_and_aliases (node
,
1724 cgraph_node_cannot_be_local_p_1
,
1728 /* Call calback on NODE, thunks and aliases associated to NODE.
1729 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
1733 cgraph_for_node_thunks_and_aliases (struct cgraph_node
*node
,
1734 bool (*callback
) (struct cgraph_node
*, void *),
1736 bool include_overwritable
)
1738 struct cgraph_edge
*e
;
1740 struct ipa_ref
*ref
;
1742 if (callback (node
, data
))
1744 for (e
= node
->callers
; e
; e
= e
->next_caller
)
1745 if (e
->caller
->thunk
.thunk_p
1746 && (include_overwritable
1747 || cgraph_function_body_availability (e
->caller
) > AVAIL_OVERWRITABLE
))
1748 if (cgraph_for_node_thunks_and_aliases (e
->caller
, callback
, data
,
1749 include_overwritable
))
1751 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
1752 if (ref
->use
== IPA_REF_ALIAS
)
1754 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
1755 if (include_overwritable
1756 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
1757 if (cgraph_for_node_thunks_and_aliases (alias
, callback
, data
,
1758 include_overwritable
))
1764 /* Call calback on NODE and aliases associated to NODE.
1765 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
1769 cgraph_for_node_and_aliases (struct cgraph_node
*node
,
1770 bool (*callback
) (struct cgraph_node
*, void *),
1772 bool include_overwritable
)
1775 struct ipa_ref
*ref
;
1777 if (callback (node
, data
))
1779 for (i
= 0; ipa_ref_list_referring_iterate (&node
->symbol
.ref_list
, i
, ref
); i
++)
1780 if (ref
->use
== IPA_REF_ALIAS
)
1782 struct cgraph_node
*alias
= ipa_ref_referring_node (ref
);
1783 if (include_overwritable
1784 || cgraph_function_body_availability (alias
) > AVAIL_OVERWRITABLE
)
1785 if (cgraph_for_node_and_aliases (alias
, callback
, data
,
1786 include_overwritable
))
1792 /* Worker to bring NODE local. */
1795 cgraph_make_node_local_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
1797 gcc_checking_assert (cgraph_node_can_be_local_p (node
));
1798 if (DECL_COMDAT (node
->symbol
.decl
) || DECL_EXTERNAL (node
->symbol
.decl
))
1800 symtab_make_decl_local (node
->symbol
.decl
);
1802 node
->symbol
.externally_visible
= false;
1803 node
->local
.local
= true;
1804 node
->symbol
.unique_name
= (node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY
1805 || node
->symbol
.resolution
== LDPR_PREVAILING_DEF_IRONLY_EXP
);
1806 node
->symbol
.resolution
= LDPR_PREVAILING_DEF_IRONLY
;
1807 gcc_assert (cgraph_function_body_availability (node
) == AVAIL_LOCAL
);
1812 /* Bring NODE local. */
1815 cgraph_make_node_local (struct cgraph_node
*node
)
1817 cgraph_for_node_thunks_and_aliases (node
, cgraph_make_node_local_1
,
1821 /* Worker to set nothrow flag. */
1824 cgraph_set_nothrow_flag_1 (struct cgraph_node
*node
, void *data
)
1826 struct cgraph_edge
*e
;
1828 TREE_NOTHROW (node
->symbol
.decl
) = data
!= NULL
;
1831 for (e
= node
->callers
; e
; e
= e
->next_caller
)
1832 e
->can_throw_external
= false;
1836 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
1837 if any to NOTHROW. */
1840 cgraph_set_nothrow_flag (struct cgraph_node
*node
, bool nothrow
)
1842 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_nothrow_flag_1
,
1843 (void *)(size_t)nothrow
, false);
1846 /* Worker to set const flag. */
1849 cgraph_set_const_flag_1 (struct cgraph_node
*node
, void *data
)
1851 /* Static constructors and destructors without a side effect can be
1853 if (data
&& !((size_t)data
& 2))
1855 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
1856 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
1857 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
1858 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
1860 TREE_READONLY (node
->symbol
.decl
) = data
!= NULL
;
1861 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
1865 /* Set TREE_READONLY on NODE's decl and on aliases of NODE
1866 if any to READONLY. */
1869 cgraph_set_const_flag (struct cgraph_node
*node
, bool readonly
, bool looping
)
1871 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_const_flag_1
,
1872 (void *)(size_t)(readonly
+ (int)looping
* 2),
1876 /* Worker to set pure flag. */
1879 cgraph_set_pure_flag_1 (struct cgraph_node
*node
, void *data
)
1881 /* Static constructors and destructors without a side effect can be
1883 if (data
&& !((size_t)data
& 2))
1885 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
))
1886 DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
) = 0;
1887 if (DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
1888 DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
) = 0;
1890 DECL_PURE_P (node
->symbol
.decl
) = data
!= NULL
;
1891 DECL_LOOPING_CONST_OR_PURE_P (node
->symbol
.decl
) = ((size_t)data
& 2) != 0;
1895 /* Set DECL_PURE_P on NODE's decl and on aliases of NODE
1899 cgraph_set_pure_flag (struct cgraph_node
*node
, bool pure
, bool looping
)
1901 cgraph_for_node_thunks_and_aliases (node
, cgraph_set_pure_flag_1
,
1902 (void *)(size_t)(pure
+ (int)looping
* 2),
1906 /* Data used by cgraph_propagate_frequency. */
1908 struct cgraph_propagate_frequency_data
1910 bool maybe_unlikely_executed
;
1911 bool maybe_executed_once
;
1912 bool only_called_at_startup
;
1913 bool only_called_at_exit
;
1916 /* Worker for cgraph_propagate_frequency_1. */
1919 cgraph_propagate_frequency_1 (struct cgraph_node
*node
, void *data
)
1921 struct cgraph_propagate_frequency_data
*d
;
1922 struct cgraph_edge
*edge
;
1924 d
= (struct cgraph_propagate_frequency_data
*)data
;
1925 for (edge
= node
->callers
;
1926 edge
&& (d
->maybe_unlikely_executed
|| d
->maybe_executed_once
1927 || d
->only_called_at_startup
|| d
->only_called_at_exit
);
1928 edge
= edge
->next_caller
)
1930 if (edge
->caller
!= node
)
1932 d
->only_called_at_startup
&= edge
->caller
->only_called_at_startup
;
1933 /* It makes sense to put main() together with the static constructors.
1934 It will be executed for sure, but rest of functions called from
1935 main are definitely not at startup only. */
1936 if (MAIN_NAME_P (DECL_NAME (edge
->caller
->symbol
.decl
)))
1937 d
->only_called_at_startup
= 0;
1938 d
->only_called_at_exit
&= edge
->caller
->only_called_at_exit
;
1940 if (!edge
->frequency
)
1942 switch (edge
->caller
->frequency
)
1944 case NODE_FREQUENCY_UNLIKELY_EXECUTED
:
1946 case NODE_FREQUENCY_EXECUTED_ONCE
:
1947 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1948 fprintf (dump_file
, " Called by %s that is executed once\n",
1949 cgraph_node_name (edge
->caller
));
1950 d
->maybe_unlikely_executed
= false;
1951 if (inline_edge_summary (edge
)->loop_depth
)
1953 d
->maybe_executed_once
= false;
1954 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1955 fprintf (dump_file
, " Called in loop\n");
1958 case NODE_FREQUENCY_HOT
:
1959 case NODE_FREQUENCY_NORMAL
:
1960 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1961 fprintf (dump_file
, " Called by %s that is normal or hot\n",
1962 cgraph_node_name (edge
->caller
));
1963 d
->maybe_unlikely_executed
= false;
1964 d
->maybe_executed_once
= false;
1968 return edge
!= NULL
;
1971 /* See if the frequency of NODE can be updated based on frequencies of its
1974 cgraph_propagate_frequency (struct cgraph_node
*node
)
1976 struct cgraph_propagate_frequency_data d
= {true, true, true, true};
1977 bool changed
= false;
1979 if (!node
->local
.local
)
1981 gcc_assert (node
->symbol
.analyzed
);
1982 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1983 fprintf (dump_file
, "Processing frequency %s\n", cgraph_node_name (node
));
1985 cgraph_for_node_and_aliases (node
, cgraph_propagate_frequency_1
, &d
, true);
1987 if ((d
.only_called_at_startup
&& !d
.only_called_at_exit
)
1988 && !node
->only_called_at_startup
)
1990 node
->only_called_at_startup
= true;
1992 fprintf (dump_file
, "Node %s promoted to only called at startup.\n",
1993 cgraph_node_name (node
));
1996 if ((d
.only_called_at_exit
&& !d
.only_called_at_startup
)
1997 && !node
->only_called_at_exit
)
1999 node
->only_called_at_exit
= true;
2001 fprintf (dump_file
, "Node %s promoted to only called at exit.\n",
2002 cgraph_node_name (node
));
2005 /* These come either from profile or user hints; never update them. */
2006 if (node
->frequency
== NODE_FREQUENCY_HOT
2007 || node
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
)
2009 if (d
.maybe_unlikely_executed
)
2011 node
->frequency
= NODE_FREQUENCY_UNLIKELY_EXECUTED
;
2013 fprintf (dump_file
, "Node %s promoted to unlikely executed.\n",
2014 cgraph_node_name (node
));
2017 else if (d
.maybe_executed_once
&& node
->frequency
!= NODE_FREQUENCY_EXECUTED_ONCE
)
2019 node
->frequency
= NODE_FREQUENCY_EXECUTED_ONCE
;
2021 fprintf (dump_file
, "Node %s promoted to executed once.\n",
2022 cgraph_node_name (node
));
2028 /* Return true when NODE can not return or throw and thus
2029 it is safe to ignore its side effects for IPA analysis. */
2032 cgraph_node_cannot_return (struct cgraph_node
*node
)
2034 int flags
= flags_from_decl_or_type (node
->symbol
.decl
);
2035 if (!flag_exceptions
)
2036 return (flags
& ECF_NORETURN
) != 0;
2038 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2039 == (ECF_NORETURN
| ECF_NOTHROW
));
2042 /* Return true when call of E can not lead to return from caller
2043 and thus it is safe to ignore its side effects for IPA analysis
2044 when computing side effects of the caller.
2045 FIXME: We could actually mark all edges that have no reaching
2046 patch to EXIT_BLOCK_PTR or throw to get better results. */
2048 cgraph_edge_cannot_lead_to_return (struct cgraph_edge
*e
)
2050 if (cgraph_node_cannot_return (e
->caller
))
2052 if (e
->indirect_unknown_callee
)
2054 int flags
= e
->indirect_info
->ecf_flags
;
2055 if (!flag_exceptions
)
2056 return (flags
& ECF_NORETURN
) != 0;
2058 return ((flags
& (ECF_NORETURN
| ECF_NOTHROW
))
2059 == (ECF_NORETURN
| ECF_NOTHROW
));
2062 return cgraph_node_cannot_return (e
->callee
);
2065 /* Return true when function NODE can be removed from callgraph
2066 if all direct calls are eliminated. */
2069 cgraph_can_remove_if_no_direct_calls_and_refs_p (struct cgraph_node
*node
)
2071 gcc_assert (!node
->global
.inlined_to
);
2072 /* Extern inlines can always go, we will use the external definition. */
2073 if (DECL_EXTERNAL (node
->symbol
.decl
))
2075 /* When function is needed, we can not remove it. */
2076 if (node
->symbol
.force_output
|| node
->symbol
.used_from_other_partition
)
2078 if (DECL_STATIC_CONSTRUCTOR (node
->symbol
.decl
)
2079 || DECL_STATIC_DESTRUCTOR (node
->symbol
.decl
))
2081 /* Only COMDAT functions can be removed if externally visible. */
2082 if (node
->symbol
.externally_visible
2083 && (!DECL_COMDAT (node
->symbol
.decl
)
2084 || symtab_used_from_object_file_p ((symtab_node
) node
)))
2089 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2092 nonremovable_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2094 return !cgraph_can_remove_if_no_direct_calls_and_refs_p (node
);
2097 /* Return true when function NODE and its aliases can be removed from callgraph
2098 if all direct calls are eliminated. */
2101 cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node
*node
)
2103 /* Extern inlines can always go, we will use the external definition. */
2104 if (DECL_EXTERNAL (node
->symbol
.decl
))
2106 if (node
->symbol
.address_taken
)
2108 return !cgraph_for_node_and_aliases (node
, nonremovable_p
, NULL
, true);
2111 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2114 used_from_object_file_p (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2116 return symtab_used_from_object_file_p ((symtab_node
) node
);
2119 /* Return true when function NODE can be expected to be removed
2120 from program when direct calls in this compilation unit are removed.
2122 As a special case COMDAT functions are
2123 cgraph_can_remove_if_no_direct_calls_p while the are not
2124 cgraph_only_called_directly_p (it is possible they are called from other
2127 This function behaves as cgraph_only_called_directly_p because eliminating
2128 all uses of COMDAT function does not make it necessarily disappear from
2129 the program unless we are compiling whole program or we do LTO. In this
2130 case we know we win since dynamic linking will not really discard the
2131 linkonce section. */
2134 cgraph_will_be_removed_from_program_if_no_direct_calls (struct cgraph_node
*node
)
2136 gcc_assert (!node
->global
.inlined_to
);
2137 if (cgraph_for_node_and_aliases (node
, used_from_object_file_p
, NULL
, true))
2139 if (!in_lto_p
&& !flag_whole_program
)
2140 return cgraph_only_called_directly_p (node
);
2143 if (DECL_EXTERNAL (node
->symbol
.decl
))
2145 return cgraph_can_remove_if_no_direct_calls_p (node
);
2150 /* Worker for cgraph_only_called_directly_p. */
2153 cgraph_not_only_called_directly_p_1 (struct cgraph_node
*node
, void *data ATTRIBUTE_UNUSED
)
2155 return !cgraph_only_called_directly_or_aliased_p (node
);
2158 /* Return true when function NODE and all its aliases are only called
2160 i.e. it is not externally visible, address was not taken and
2161 it is not used in any other non-standard way. */
2164 cgraph_only_called_directly_p (struct cgraph_node
*node
)
2166 gcc_assert (cgraph_function_or_thunk_node (node
, NULL
) == node
);
2167 return !cgraph_for_node_and_aliases (node
, cgraph_not_only_called_directly_p_1
,
2172 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
2175 collect_callers_of_node_1 (struct cgraph_node
*node
, void *data
)
2177 vec
<cgraph_edge_p
> *redirect_callers
= (vec
<cgraph_edge_p
> *)data
;
2178 struct cgraph_edge
*cs
;
2179 enum availability avail
;
2180 cgraph_function_or_thunk_node (node
, &avail
);
2182 if (avail
> AVAIL_OVERWRITABLE
)
2183 for (cs
= node
->callers
; cs
!= NULL
; cs
= cs
->next_caller
)
2184 if (!cs
->indirect_inlining_edge
)
2185 redirect_callers
->safe_push (cs
);
2189 /* Collect all callers of NODE and its aliases that are known to lead to NODE
2190 (i.e. are not overwritable). */
2193 collect_callers_of_node (struct cgraph_node
*node
)
2195 vec
<cgraph_edge_p
> redirect_callers
= vNULL
;
2196 cgraph_for_node_and_aliases (node
, collect_callers_of_node_1
,
2197 &redirect_callers
, false);
2198 return redirect_callers
;
2201 /* Return TRUE if NODE2 is equivalent to NODE or its clone. */
2203 clone_of_p (struct cgraph_node
*node
, struct cgraph_node
*node2
)
2205 node
= cgraph_function_or_thunk_node (node
, NULL
);
2206 node2
= cgraph_function_or_thunk_node (node2
, NULL
);
2207 while (node
!= node2
&& node2
)
2208 node2
= node2
->clone_of
;
2209 return node2
!= NULL
;
2212 /* Verify edge E count and frequency. */
2215 verify_edge_count_and_frequency (struct cgraph_edge
*e
)
2217 bool error_found
= false;
2220 error ("caller edge count is negative");
2223 if (e
->frequency
< 0)
2225 error ("caller edge frequency is negative");
2228 if (e
->frequency
> CGRAPH_FREQ_MAX
)
2230 error ("caller edge frequency is too large");
2233 if (gimple_has_body_p (e
->caller
->symbol
.decl
)
2234 && !e
->caller
->global
.inlined_to
2235 /* FIXME: Inline-analysis sets frequency to 0 when edge is optimized out.
2236 Remove this once edges are actually removed from the function at that time. */
2238 || (inline_edge_summary_vec
.exists ()
2239 && ((inline_edge_summary_vec
.length () <= (unsigned) e
->uid
)
2240 || !inline_edge_summary (e
)->predicate
)))
2242 != compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2243 gimple_bb (e
->call_stmt
))))
2245 error ("caller edge frequency %i does not match BB frequency %i",
2247 compute_call_stmt_bb_frequency (e
->caller
->symbol
.decl
,
2248 gimple_bb (e
->call_stmt
)));
2254 /* Switch to THIS_CFUN if needed and print STMT to stderr. */
2256 cgraph_debug_gimple_stmt (struct function
*this_cfun
, gimple stmt
)
2258 bool fndecl_was_null
= false;
2259 /* debug_gimple_stmt needs correct cfun */
2260 if (cfun
!= this_cfun
)
2261 set_cfun (this_cfun
);
2262 /* ...and an actual current_function_decl */
2263 if (!current_function_decl
)
2265 current_function_decl
= this_cfun
->decl
;
2266 fndecl_was_null
= true;
2268 debug_gimple_stmt (stmt
);
2269 if (fndecl_was_null
)
2270 current_function_decl
= NULL
;
2273 /* Verify that call graph edge E corresponds to DECL from the associated
2274 statement. Return true if the verification should fail. */
2277 verify_edge_corresponds_to_fndecl (struct cgraph_edge
*e
, tree decl
)
2279 struct cgraph_node
*node
;
2281 if (!decl
|| e
->callee
->global
.inlined_to
)
2283 node
= cgraph_get_node (decl
);
2285 /* We do not know if a node from a different partition is an alias or what it
2286 aliases and therefore cannot do the former_clone_of check reliably. */
2287 if (!node
|| node
->symbol
.in_other_partition
)
2289 node
= cgraph_function_or_thunk_node (node
, NULL
);
2291 if ((e
->callee
->former_clone_of
!= node
->symbol
.decl
2292 && (!node
->same_body_alias
2293 || e
->callee
->former_clone_of
!= node
->thunk
.alias
))
2294 /* IPA-CP sometimes redirect edge to clone and then back to the former
2295 function. This ping-pong has to go, eventually. */
2296 && (node
!= cgraph_function_or_thunk_node (e
->callee
, NULL
))
2297 && !clone_of_p (node
, e
->callee
)
2298 /* If decl is a same body alias of some other decl, allow e->callee to be
2299 a clone of a clone of that other decl too. */
2300 && (!node
->same_body_alias
2301 || !clone_of_p (cgraph_get_node (node
->thunk
.alias
), e
->callee
)))
2307 /* Verify cgraph nodes of given cgraph node. */
2309 verify_cgraph_node (struct cgraph_node
*node
)
2311 struct cgraph_edge
*e
;
2312 struct function
*this_cfun
= DECL_STRUCT_FUNCTION (node
->symbol
.decl
);
2313 basic_block this_block
;
2314 gimple_stmt_iterator gsi
;
2315 bool error_found
= false;
2320 timevar_push (TV_CGRAPH_VERIFY
);
2321 error_found
|= verify_symtab_base ((symtab_node
) node
);
2322 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2325 error ("aux field set for edge %s->%s",
2326 identifier_to_locale (cgraph_node_name (e
->caller
)),
2327 identifier_to_locale (cgraph_node_name (e
->callee
)));
2330 if (node
->count
< 0)
2332 error ("execution count is negative");
2335 if (node
->global
.inlined_to
&& node
->symbol
.same_comdat_group
)
2337 error ("inline clone in same comdat group list");
2340 if (!node
->symbol
.definition
&& node
->local
.local
)
2342 error ("local symbols must be defined");
2345 if (node
->global
.inlined_to
&& node
->symbol
.externally_visible
)
2347 error ("externally visible inline clone");
2350 if (node
->global
.inlined_to
&& node
->symbol
.address_taken
)
2352 error ("inline clone with address taken");
2355 if (node
->global
.inlined_to
&& node
->symbol
.force_output
)
2357 error ("inline clone is forced to output");
2360 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2364 error ("aux field set for indirect edge from %s",
2365 identifier_to_locale (cgraph_node_name (e
->caller
)));
2368 if (!e
->indirect_unknown_callee
2369 || !e
->indirect_info
)
2371 error ("An indirect edge from %s is not marked as indirect or has "
2372 "associated indirect_info, the corresponding statement is: ",
2373 identifier_to_locale (cgraph_node_name (e
->caller
)));
2374 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2378 for (e
= node
->callers
; e
; e
= e
->next_caller
)
2380 if (verify_edge_count_and_frequency (e
))
2382 if (!e
->inline_failed
)
2384 if (node
->global
.inlined_to
2385 != (e
->caller
->global
.inlined_to
2386 ? e
->caller
->global
.inlined_to
: e
->caller
))
2388 error ("inlined_to pointer is wrong");
2391 if (node
->callers
->next_caller
)
2393 error ("multiple inline callers");
2398 if (node
->global
.inlined_to
)
2400 error ("inlined_to pointer set for noninline callers");
2404 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2405 if (verify_edge_count_and_frequency (e
))
2407 if (!node
->callers
&& node
->global
.inlined_to
)
2409 error ("inlined_to pointer is set but no predecessors found");
2412 if (node
->global
.inlined_to
== node
)
2414 error ("inlined_to pointer refers to itself");
2420 struct cgraph_node
*n
;
2421 for (n
= node
->clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
2426 error ("node has wrong clone_of");
2432 struct cgraph_node
*n
;
2433 for (n
= node
->clones
; n
; n
= n
->next_sibling_clone
)
2434 if (n
->clone_of
!= node
)
2438 error ("node has wrong clone list");
2442 if ((node
->prev_sibling_clone
|| node
->next_sibling_clone
) && !node
->clone_of
)
2444 error ("node is in clone list but it is not clone");
2447 if (!node
->prev_sibling_clone
&& node
->clone_of
&& node
->clone_of
->clones
!= node
)
2449 error ("node has wrong prev_clone pointer");
2452 if (node
->prev_sibling_clone
&& node
->prev_sibling_clone
->next_sibling_clone
!= node
)
2454 error ("double linked list of clones corrupted");
2458 if (node
->symbol
.analyzed
&& node
->symbol
.alias
)
2460 bool ref_found
= false;
2462 struct ipa_ref
*ref
;
2466 error ("Alias has call edges");
2469 for (i
= 0; ipa_ref_list_reference_iterate (&node
->symbol
.ref_list
,
2471 if (ref
->use
!= IPA_REF_ALIAS
)
2473 error ("Alias has non-alias reference");
2478 error ("Alias has more than one alias reference");
2485 error ("Analyzed alias has no reference");
2489 if (node
->symbol
.analyzed
&& node
->thunk
.thunk_p
)
2493 error ("No edge out of thunk node");
2496 else if (node
->callees
->next_callee
)
2498 error ("More than one edge out of thunk node");
2501 if (gimple_has_body_p (node
->symbol
.decl
))
2503 error ("Thunk is not supposed to have body");
2507 else if (node
->symbol
.analyzed
&& gimple_has_body_p (node
->symbol
.decl
)
2508 && !TREE_ASM_WRITTEN (node
->symbol
.decl
)
2509 && (!DECL_EXTERNAL (node
->symbol
.decl
) || node
->global
.inlined_to
)
2514 /* Reach the trees by walking over the CFG, and note the
2515 enclosing basic-blocks in the call edges. */
2516 FOR_EACH_BB_FN (this_block
, this_cfun
)
2517 for (gsi
= gsi_start_bb (this_block
);
2521 gimple stmt
= gsi_stmt (gsi
);
2522 if (is_gimple_call (stmt
))
2524 struct cgraph_edge
*e
= cgraph_edge (node
, stmt
);
2525 tree decl
= gimple_call_fndecl (stmt
);
2530 error ("shared call_stmt:");
2531 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2534 if (!e
->indirect_unknown_callee
)
2536 if (verify_edge_corresponds_to_fndecl (e
, decl
))
2538 error ("edge points to wrong declaration:");
2539 debug_tree (e
->callee
->symbol
.decl
);
2540 fprintf (stderr
," Instead of:");
2547 error ("an indirect edge with unknown callee "
2548 "corresponding to a call_stmt with "
2549 "a known declaration:");
2551 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2557 error ("missing callgraph edge for call stmt:");
2558 cgraph_debug_gimple_stmt (this_cfun
, stmt
);
2565 /* No CFG available?! */
2568 for (e
= node
->callees
; e
; e
= e
->next_callee
)
2572 error ("edge %s->%s has no corresponding call_stmt",
2573 identifier_to_locale (cgraph_node_name (e
->caller
)),
2574 identifier_to_locale (cgraph_node_name (e
->callee
)));
2575 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2580 for (e
= node
->indirect_calls
; e
; e
= e
->next_callee
)
2584 error ("an indirect edge from %s has no corresponding call_stmt",
2585 identifier_to_locale (cgraph_node_name (e
->caller
)));
2586 cgraph_debug_gimple_stmt (this_cfun
, e
->call_stmt
);
2594 dump_cgraph_node (stderr
, node
);
2595 internal_error ("verify_cgraph_node failed");
2597 timevar_pop (TV_CGRAPH_VERIFY
);
2600 /* Verify whole cgraph structure. */
2602 verify_cgraph (void)
2604 struct cgraph_node
*node
;
2609 FOR_EACH_FUNCTION (node
)
2610 verify_cgraph_node (node
);
2613 /* Create external decl node for DECL.
2614 The difference i nbetween cgraph_get_create_node and
2615 cgraph_get_create_real_symbol_node is that cgraph_get_create_node
2616 may return inline clone, while cgraph_get_create_real_symbol_node
2617 will create a new node in this case.
2618 FIXME: This function should be removed once clones are put out of decl
2621 struct cgraph_node
*
2622 cgraph_get_create_real_symbol_node (tree decl
)
2624 struct cgraph_node
*first_clone
= cgraph_get_node (decl
);
2625 struct cgraph_node
*node
;
2626 /* create symbol table node. even if inline clone exists, we can not take
2627 it as a target of non-inlined call. */
2628 node
= cgraph_get_node (decl
);
2629 if (node
&& !node
->global
.inlined_to
)
2632 node
= cgraph_create_node (decl
);
2634 /* ok, we previously inlined the function, then removed the offline copy and
2635 now we want it back for external call. this can happen when devirtualizing
2636 while inlining function called once that happens after extern inlined and
2637 virtuals are already removed. in this case introduce the external node
2638 and make it available for call. */
2641 first_clone
->clone_of
= node
;
2642 node
->clones
= first_clone
;
2643 symtab_prevail_in_asm_name_hash ((symtab_node
) node
);
2644 symtab_insert_node_to_hashtable ((symtab_node
) node
);
2646 fprintf (dump_file
, "Introduced new external node "
2647 "(%s/%i) and turned into root of the clone tree.\n",
2648 xstrdup (cgraph_node_name (node
)), node
->symbol
.order
);
2651 fprintf (dump_file
, "Introduced new external node "
2652 "(%s/%i).\n", xstrdup (cgraph_node_name (node
)),
2653 node
->symbol
.order
);
2658 /* Given NODE, walk the alias chain to return the function NODE is alias of.
2659 Walk through thunk, too.
2660 When AVAILABILITY is non-NULL, get minimal availability in the chain. */
2662 struct cgraph_node
*
2663 cgraph_function_node (struct cgraph_node
*node
, enum availability
*availability
)
2667 node
= cgraph_function_or_thunk_node (node
, availability
);
2668 if (node
->thunk
.thunk_p
)
2670 node
= node
->callees
->callee
;
2673 enum availability a
;
2674 a
= cgraph_function_body_availability (node
);
2675 if (a
< *availability
)
2678 node
= cgraph_function_or_thunk_node (node
, availability
);
2680 } while (node
&& node
->thunk
.thunk_p
);
2684 #include "gt-cgraph.h"