1 /* Callgraph handling code.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
4 Contributed by Jan Hubicka
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains basic routines manipulating call graph
26 The call-graph is data structure designed for intra-procedural optimization
27 but it is also used in non-unit-at-a-time compilation to allow easier code
30 The call-graph consist of nodes and edges represented via linked lists.
31 Each function (external or not) corresponds to the unique node.
33 The mapping from declarations to call-graph nodes is done using hash table
34 based on DECL_UID. The call-graph nodes are created lazily using
35 cgraph_node function when called for unknown declaration.
37 The callgraph at the moment does not represent all indirect calls or calls
38 from other compilation units. Flag NEEDED is set for each node that may be
39 accessed in such an invisible way and it shall be considered an entry point
42 On the other hand, the callgraph currently does contain some edges for
43 indirect calls with unknown callees which can be accessed through
44 indirect_calls field of a node. It should be noted however that at the
45 moment only calls which are potential candidates for indirect inlining are
48 Interprocedural information:
50 Callgraph is place to store data needed for interprocedural optimization.
51 All data structures are divided into three components: local_info that
52 is produced while analyzing the function, global_info that is result
53 of global walking of the callgraph on the end of compilation and
54 rtl_info used by RTL backend to propagate data from already compiled
55 functions to their callers.
57 Moreover, each node has a uid which can be used to keep information in
58 on-the-side arrays. UIDs are reused and therefore reasonably dense.
62 The function inlining information is decided in advance and maintained
63 in the callgraph as so called inline plan.
64 For each inlined call, the callee's node is cloned to represent the
65 new function copy produced by inliner.
66 Each inlined call gets a unique corresponding clone node of the callee
67 and the data structure is updated while inlining is performed, so
68 the clones are eliminated and their callee edges redirected to the
71 Each edge has "inline_failed" field. When the field is set to NULL,
72 the call will be inlined. When it is non-NULL it contains a reason
73 why inlining wasn't performed. */
77 #include "coretypes.h"
80 #include "tree-inline.h"
81 #include "langhooks.h"
88 #include "basic-block.h"
93 #include "tree-dump.h"
94 #include "tree-flow.h"
95 #include "value-prof.h"
97 #include "diagnostic-core.h"
99 #include "ipa-utils.h"
100 #include "lto-streamer.h"
101 #include "ipa-inline.h"
103 const char * const ld_plugin_symbol_resolution_names[]=
108 "prevailing_def_ironly",
114 "prevailing_def_ironly_exp"
117 static void cgraph_node_remove_callers (struct cgraph_node *node);
118 static inline void cgraph_edge_remove_caller (struct cgraph_edge *e);
119 static inline void cgraph_edge_remove_callee (struct cgraph_edge *e);
121 /* Hash table used to convert declarations into nodes. */
122 static GTY((param_is (struct cgraph_node))) htab_t cgraph_hash;
123 /* Hash table used to convert assembler names into nodes. */
124 static GTY((param_is (struct cgraph_node))) htab_t assembler_name_hash;
126 /* The linked list of cgraph nodes. */
127 struct cgraph_node *cgraph_nodes;
129 /* Queue of cgraph nodes scheduled to be lowered. */
130 struct cgraph_node *cgraph_nodes_queue;
132 /* Queue of cgraph nodes scheduled to be added into cgraph. This is a
133 secondary queue used during optimization to accommodate passes that
134 may generate new functions that need to be optimized and expanded. */
135 struct cgraph_node *cgraph_new_nodes;
137 /* Number of nodes in existence. */
140 /* Maximal uid used in cgraph nodes. */
143 /* Maximal uid used in cgraph edges. */
144 int cgraph_edge_max_uid;
146 /* Set when whole unit has been analyzed so we can access global info. */
147 bool cgraph_global_info_ready = false;
149 /* What state callgraph is in right now. */
150 enum cgraph_state cgraph_state = CGRAPH_STATE_CONSTRUCTION;
152 /* Set when the cgraph is fully build and the basic flags are computed. */
153 bool cgraph_function_flags_ready = false;
155 /* Linked list of cgraph asm nodes. */
156 struct cgraph_asm_node *cgraph_asm_nodes;
158 /* Last node in cgraph_asm_nodes. */
159 static GTY(()) struct cgraph_asm_node *cgraph_asm_last_node;
161 /* The order index of the next cgraph node to be created. This is
162 used so that we can sort the cgraph nodes in order by when we saw
163 them, to support -fno-toplevel-reorder. */
166 /* List of hooks triggered on cgraph_edge events. */
167 struct cgraph_edge_hook_list {
168 cgraph_edge_hook hook;
170 struct cgraph_edge_hook_list *next;
173 /* List of hooks triggered on cgraph_node events. */
174 struct cgraph_node_hook_list {
175 cgraph_node_hook hook;
177 struct cgraph_node_hook_list *next;
180 /* List of hooks triggered on events involving two cgraph_edges. */
181 struct cgraph_2edge_hook_list {
182 cgraph_2edge_hook hook;
184 struct cgraph_2edge_hook_list *next;
187 /* List of hooks triggered on events involving two cgraph_nodes. */
188 struct cgraph_2node_hook_list {
189 cgraph_2node_hook hook;
191 struct cgraph_2node_hook_list *next;
194 /* List of hooks triggered when an edge is removed. */
195 struct cgraph_edge_hook_list *first_cgraph_edge_removal_hook;
196 /* List of hooks triggered when a node is removed. */
197 struct cgraph_node_hook_list *first_cgraph_node_removal_hook;
198 /* List of hooks triggered when an edge is duplicated. */
199 struct cgraph_2edge_hook_list *first_cgraph_edge_duplicated_hook;
200 /* List of hooks triggered when a node is duplicated. */
201 struct cgraph_2node_hook_list *first_cgraph_node_duplicated_hook;
202 /* List of hooks triggered when an function is inserted. */
203 struct cgraph_node_hook_list *first_cgraph_function_insertion_hook;
205 /* Head of a linked list of unused (freed) call graph nodes.
206 Do not GTY((delete)) this list so UIDs gets reliably recycled. */
207 static GTY(()) struct cgraph_node *free_nodes;
208 /* Head of a linked list of unused (freed) call graph edges.
209 Do not GTY((delete)) this list so UIDs gets reliably recycled. */
210 static GTY(()) struct cgraph_edge *free_edges;
212 /* Did procss_same_body_aliases run? */
213 bool same_body_aliases_done;
215 /* Macros to access the next item in the list of free cgraph nodes and
217 #define NEXT_FREE_NODE(NODE) (NODE)->next
218 #define NEXT_FREE_EDGE(EDGE) (EDGE)->prev_caller
220 /* Register HOOK to be called with DATA on each removed edge. */
221 struct cgraph_edge_hook_list *
222 cgraph_add_edge_removal_hook (cgraph_edge_hook hook, void *data)
224 struct cgraph_edge_hook_list *entry;
225 struct cgraph_edge_hook_list **ptr = &first_cgraph_edge_removal_hook;
227 entry = (struct cgraph_edge_hook_list *) xmalloc (sizeof (*entry));
237 /* Remove ENTRY from the list of hooks called on removing edges. */
239 cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *entry)
241 struct cgraph_edge_hook_list **ptr = &first_cgraph_edge_removal_hook;
243 while (*ptr != entry)
249 /* Call all edge removal hooks. */
251 cgraph_call_edge_removal_hooks (struct cgraph_edge *e)
253 struct cgraph_edge_hook_list *entry = first_cgraph_edge_removal_hook;
256 entry->hook (e, entry->data);
261 /* Register HOOK to be called with DATA on each removed node. */
262 struct cgraph_node_hook_list *
263 cgraph_add_node_removal_hook (cgraph_node_hook hook, void *data)
265 struct cgraph_node_hook_list *entry;
266 struct cgraph_node_hook_list **ptr = &first_cgraph_node_removal_hook;
268 entry = (struct cgraph_node_hook_list *) xmalloc (sizeof (*entry));
278 /* Remove ENTRY from the list of hooks called on removing nodes. */
280 cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *entry)
282 struct cgraph_node_hook_list **ptr = &first_cgraph_node_removal_hook;
284 while (*ptr != entry)
290 /* Call all node removal hooks. */
292 cgraph_call_node_removal_hooks (struct cgraph_node *node)
294 struct cgraph_node_hook_list *entry = first_cgraph_node_removal_hook;
297 entry->hook (node, entry->data);
302 /* Register HOOK to be called with DATA on each inserted node. */
303 struct cgraph_node_hook_list *
304 cgraph_add_function_insertion_hook (cgraph_node_hook hook, void *data)
306 struct cgraph_node_hook_list *entry;
307 struct cgraph_node_hook_list **ptr = &first_cgraph_function_insertion_hook;
309 entry = (struct cgraph_node_hook_list *) xmalloc (sizeof (*entry));
319 /* Remove ENTRY from the list of hooks called on inserted nodes. */
321 cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *entry)
323 struct cgraph_node_hook_list **ptr = &first_cgraph_function_insertion_hook;
325 while (*ptr != entry)
331 /* Call all node insertion hooks. */
333 cgraph_call_function_insertion_hooks (struct cgraph_node *node)
335 struct cgraph_node_hook_list *entry = first_cgraph_function_insertion_hook;
338 entry->hook (node, entry->data);
343 /* Register HOOK to be called with DATA on each duplicated edge. */
344 struct cgraph_2edge_hook_list *
345 cgraph_add_edge_duplication_hook (cgraph_2edge_hook hook, void *data)
347 struct cgraph_2edge_hook_list *entry;
348 struct cgraph_2edge_hook_list **ptr = &first_cgraph_edge_duplicated_hook;
350 entry = (struct cgraph_2edge_hook_list *) xmalloc (sizeof (*entry));
360 /* Remove ENTRY from the list of hooks called on duplicating edges. */
362 cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *entry)
364 struct cgraph_2edge_hook_list **ptr = &first_cgraph_edge_duplicated_hook;
366 while (*ptr != entry)
372 /* Call all edge duplication hooks. */
374 cgraph_call_edge_duplication_hooks (struct cgraph_edge *cs1,
375 struct cgraph_edge *cs2)
377 struct cgraph_2edge_hook_list *entry = first_cgraph_edge_duplicated_hook;
380 entry->hook (cs1, cs2, entry->data);
385 /* Register HOOK to be called with DATA on each duplicated node. */
386 struct cgraph_2node_hook_list *
387 cgraph_add_node_duplication_hook (cgraph_2node_hook hook, void *data)
389 struct cgraph_2node_hook_list *entry;
390 struct cgraph_2node_hook_list **ptr = &first_cgraph_node_duplicated_hook;
392 entry = (struct cgraph_2node_hook_list *) xmalloc (sizeof (*entry));
402 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
404 cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *entry)
406 struct cgraph_2node_hook_list **ptr = &first_cgraph_node_duplicated_hook;
408 while (*ptr != entry)
414 /* Call all node duplication hooks. */
416 cgraph_call_node_duplication_hooks (struct cgraph_node *node1,
417 struct cgraph_node *node2)
419 struct cgraph_2node_hook_list *entry = first_cgraph_node_duplicated_hook;
422 entry->hook (node1, node2, entry->data);
427 /* Returns a hash code for P. */
430 hash_node (const void *p)
432 const struct cgraph_node *n = (const struct cgraph_node *) p;
433 return (hashval_t) DECL_UID (n->decl);
437 /* Returns nonzero if P1 and P2 are equal. */
440 eq_node (const void *p1, const void *p2)
442 const struct cgraph_node *n1 = (const struct cgraph_node *) p1;
443 const struct cgraph_node *n2 = (const struct cgraph_node *) p2;
444 return DECL_UID (n1->decl) == DECL_UID (n2->decl);
447 /* Allocate new callgraph node. */
449 static inline struct cgraph_node *
450 cgraph_allocate_node (void)
452 struct cgraph_node *node;
457 free_nodes = NEXT_FREE_NODE (node);
461 node = ggc_alloc_cleared_cgraph_node ();
462 node->uid = cgraph_max_uid++;
468 /* Allocate new callgraph node and insert it into basic data structures. */
470 static struct cgraph_node *
471 cgraph_create_node_1 (void)
473 struct cgraph_node *node = cgraph_allocate_node ();
475 node->next = cgraph_nodes;
476 node->order = cgraph_order++;
478 cgraph_nodes->previous = node;
479 node->previous = NULL;
480 node->frequency = NODE_FREQUENCY_NORMAL;
481 node->count_materialization_scale = REG_BR_PROB_BASE;
482 ipa_empty_ref_list (&node->ref_list);
488 /* Return cgraph node assigned to DECL. Create new one when needed. */
491 cgraph_create_node (tree decl)
493 struct cgraph_node key, *node, **slot;
495 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
498 cgraph_hash = htab_create_ggc (10, hash_node, eq_node, NULL);
501 slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key, INSERT);
504 node = cgraph_create_node_1 ();
507 if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
509 node->origin = cgraph_get_create_node (DECL_CONTEXT (decl));
510 node->next_nested = node->origin->nested;
511 node->origin->nested = node;
513 if (assembler_name_hash)
516 tree name = DECL_ASSEMBLER_NAME (decl);
518 aslot = htab_find_slot_with_hash (assembler_name_hash, name,
519 decl_assembler_name_hash (name),
521 /* We can have multiple declarations with same assembler name. For C++
522 it is __builtin_strlen and strlen, for instance. Do we need to
523 record them all? Original implementation marked just first one
524 so lets hope for the best. */
531 /* Try to find a call graph node for declaration DECL and if it does not exist,
535 cgraph_get_create_node (tree decl)
537 struct cgraph_node *node;
539 node = cgraph_get_node (decl);
543 return cgraph_create_node (decl);
546 /* Mark ALIAS as an alias to DECL. DECL_NODE is cgraph node representing
547 the function body is associated with (not neccesarily cgraph_node (DECL). */
550 cgraph_create_function_alias (tree alias, tree decl)
552 struct cgraph_node *alias_node;
554 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
555 gcc_assert (TREE_CODE (alias) == FUNCTION_DECL);
556 alias_node = cgraph_get_create_node (alias);
557 gcc_assert (!alias_node->local.finalized);
558 alias_node->thunk.alias = decl;
559 alias_node->local.finalized = true;
560 alias_node->alias = 1;
562 if ((TREE_PUBLIC (alias) && !DECL_COMDAT (alias) && !DECL_EXTERNAL (alias))
563 || (DECL_VIRTUAL_P (alias)
564 && (DECL_COMDAT (alias) || DECL_EXTERNAL (alias))))
565 cgraph_mark_reachable_node (alias_node);
569 /* Attempt to mark ALIAS as an alias to DECL. Return alias node if successful
571 Same body aliases are output whenever the body of DECL is output,
572 and cgraph_get_node (ALIAS) transparently returns cgraph_get_node (DECL). */
575 cgraph_same_body_alias (struct cgraph_node *decl_node ATTRIBUTE_UNUSED, tree alias, tree decl)
577 struct cgraph_node *n;
578 #ifndef ASM_OUTPUT_DEF
579 /* If aliases aren't supported by the assembler, fail. */
582 /* Langhooks can create same body aliases of symbols not defined.
583 Those are useless. Drop them on the floor. */
584 if (cgraph_global_info_ready)
587 n = cgraph_create_function_alias (alias, decl);
588 n->same_body_alias = true;
589 if (same_body_aliases_done)
590 ipa_record_reference (n, NULL, cgraph_get_node (decl), NULL, IPA_REF_ALIAS,
595 /* Add thunk alias into callgraph. The alias declaration is ALIAS and it
596 aliases DECL with an adjustments made into the first parameter.
597 See comments in thunk_adjust for detail on the parameters. */
600 cgraph_add_thunk (struct cgraph_node *decl_node ATTRIBUTE_UNUSED,
601 tree alias, tree decl,
603 HOST_WIDE_INT fixed_offset, HOST_WIDE_INT virtual_value,
607 struct cgraph_node *node;
609 node = cgraph_get_node (alias);
612 gcc_assert (node->local.finalized);
613 gcc_assert (!node->alias);
614 gcc_assert (!node->thunk.thunk_p);
615 cgraph_remove_node (node);
618 node = cgraph_create_node (alias);
619 gcc_checking_assert (!virtual_offset
620 || double_int_equal_p
621 (tree_to_double_int (virtual_offset),
622 shwi_to_double_int (virtual_value)));
623 node->thunk.fixed_offset = fixed_offset;
624 node->thunk.this_adjusting = this_adjusting;
625 node->thunk.virtual_value = virtual_value;
626 node->thunk.virtual_offset_p = virtual_offset != NULL;
627 node->thunk.alias = real_alias;
628 node->thunk.thunk_p = true;
629 node->local.finalized = true;
631 if (cgraph_decide_is_function_needed (node, decl))
632 cgraph_mark_needed_node (node);
634 if ((TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl))
635 || (DECL_VIRTUAL_P (decl)
636 && (DECL_COMDAT (decl) || DECL_EXTERNAL (decl))))
637 cgraph_mark_reachable_node (node);
642 /* Returns the cgraph node assigned to DECL or NULL if no cgraph node
646 cgraph_get_node (const_tree decl)
648 struct cgraph_node key, *node = NULL, **slot;
650 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
655 key.decl = CONST_CAST2 (tree, const_tree, decl);
657 slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key,
665 /* Insert already constructed node into hashtable. */
668 cgraph_insert_node_to_hashtable (struct cgraph_node *node)
670 struct cgraph_node **slot;
672 slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, node, INSERT);
678 /* Returns a hash code for P. */
681 hash_node_by_assembler_name (const void *p)
683 const struct cgraph_node *n = (const struct cgraph_node *) p;
684 return (hashval_t) decl_assembler_name_hash (DECL_ASSEMBLER_NAME (n->decl));
687 /* Returns nonzero if P1 and P2 are equal. */
690 eq_assembler_name (const void *p1, const void *p2)
692 const struct cgraph_node *n1 = (const struct cgraph_node *) p1;
693 const_tree name = (const_tree)p2;
694 return (decl_assembler_name_equal (n1->decl, name));
697 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
698 Return NULL if there's no such node. */
701 cgraph_node_for_asm (tree asmname)
703 struct cgraph_node *node;
706 if (!assembler_name_hash)
708 assembler_name_hash =
709 htab_create_ggc (10, hash_node_by_assembler_name, eq_assembler_name,
711 for (node = cgraph_nodes; node; node = node->next)
712 if (!node->global.inlined_to)
714 tree name = DECL_ASSEMBLER_NAME (node->decl);
715 slot = htab_find_slot_with_hash (assembler_name_hash, name,
716 decl_assembler_name_hash (name),
718 /* We can have multiple declarations with same assembler name. For C++
719 it is __builtin_strlen and strlen, for instance. Do we need to
720 record them all? Original implementation marked just first one
721 so lets hope for the best. */
727 slot = htab_find_slot_with_hash (assembler_name_hash, asmname,
728 decl_assembler_name_hash (asmname),
733 node = (struct cgraph_node *) *slot;
739 /* Returns a hash value for X (which really is a die_struct). */
742 edge_hash (const void *x)
744 return htab_hash_pointer (((const struct cgraph_edge *) x)->call_stmt);
747 /* Return nonzero if decl_id of die_struct X is the same as UID of decl *Y. */
750 edge_eq (const void *x, const void *y)
752 return ((const struct cgraph_edge *) x)->call_stmt == y;
755 /* Add call graph edge E to call site hash of its caller. */
758 cgraph_add_edge_to_call_site_hash (struct cgraph_edge *e)
761 slot = htab_find_slot_with_hash (e->caller->call_site_hash,
763 htab_hash_pointer (e->call_stmt),
769 /* Return the callgraph edge representing the GIMPLE_CALL statement
773 cgraph_edge (struct cgraph_node *node, gimple call_stmt)
775 struct cgraph_edge *e, *e2;
778 if (node->call_site_hash)
779 return (struct cgraph_edge *)
780 htab_find_with_hash (node->call_site_hash, call_stmt,
781 htab_hash_pointer (call_stmt));
783 /* This loop may turn out to be performance problem. In such case adding
784 hashtables into call nodes with very many edges is probably best
785 solution. It is not good idea to add pointer into CALL_EXPR itself
786 because we want to make possible having multiple cgraph nodes representing
787 different clones of the same body before the body is actually cloned. */
788 for (e = node->callees; e; e = e->next_callee)
790 if (e->call_stmt == call_stmt)
796 for (e = node->indirect_calls; e; e = e->next_callee)
798 if (e->call_stmt == call_stmt)
805 node->call_site_hash = htab_create_ggc (120, edge_hash, edge_eq, NULL);
806 for (e2 = node->callees; e2; e2 = e2->next_callee)
807 cgraph_add_edge_to_call_site_hash (e2);
808 for (e2 = node->indirect_calls; e2; e2 = e2->next_callee)
809 cgraph_add_edge_to_call_site_hash (e2);
816 /* Change field call_stmt of edge E to NEW_STMT. */
819 cgraph_set_call_stmt (struct cgraph_edge *e, gimple new_stmt)
823 if (e->caller->call_site_hash)
825 htab_remove_elt_with_hash (e->caller->call_site_hash,
827 htab_hash_pointer (e->call_stmt));
830 e->call_stmt = new_stmt;
831 if (e->indirect_unknown_callee
832 && (decl = gimple_call_fndecl (new_stmt)))
834 /* Constant propagation (and possibly also inlining?) can turn an
835 indirect call into a direct one. */
836 struct cgraph_node *new_callee = cgraph_get_node (decl);
838 gcc_checking_assert (new_callee);
839 cgraph_make_edge_direct (e, new_callee);
842 push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl));
843 e->can_throw_external = stmt_can_throw_external (new_stmt);
845 if (e->caller->call_site_hash)
846 cgraph_add_edge_to_call_site_hash (e);
849 /* Like cgraph_set_call_stmt but walk the clone tree and update all
850 clones sharing the same function body. */
853 cgraph_set_call_stmt_including_clones (struct cgraph_node *orig,
854 gimple old_stmt, gimple new_stmt)
856 struct cgraph_node *node;
857 struct cgraph_edge *edge = cgraph_edge (orig, old_stmt);
860 cgraph_set_call_stmt (edge, new_stmt);
866 struct cgraph_edge *edge = cgraph_edge (node, old_stmt);
868 cgraph_set_call_stmt (edge, new_stmt);
871 else if (node->next_sibling_clone)
872 node = node->next_sibling_clone;
875 while (node != orig && !node->next_sibling_clone)
876 node = node->clone_of;
878 node = node->next_sibling_clone;
883 /* Like cgraph_create_edge walk the clone tree and update all clones sharing
884 same function body. If clones already have edge for OLD_STMT; only
885 update the edge same way as cgraph_set_call_stmt_including_clones does.
887 TODO: COUNT and LOOP_DEPTH should be properly distributed based on relative
888 frequencies of the clones. */
891 cgraph_create_edge_including_clones (struct cgraph_node *orig,
892 struct cgraph_node *callee,
894 gimple stmt, gcov_type count,
896 cgraph_inline_failed_t reason)
898 struct cgraph_node *node;
899 struct cgraph_edge *edge;
901 if (!cgraph_edge (orig, stmt))
903 edge = cgraph_create_edge (orig, callee, stmt, count, freq);
904 edge->inline_failed = reason;
911 struct cgraph_edge *edge = cgraph_edge (node, old_stmt);
913 /* It is possible that clones already contain the edge while
914 master didn't. Either we promoted indirect call into direct
915 call in the clone or we are processing clones of unreachable
916 master where edges has been removed. */
918 cgraph_set_call_stmt (edge, stmt);
919 else if (!cgraph_edge (node, stmt))
921 edge = cgraph_create_edge (node, callee, stmt, count,
923 edge->inline_failed = reason;
928 else if (node->next_sibling_clone)
929 node = node->next_sibling_clone;
932 while (node != orig && !node->next_sibling_clone)
933 node = node->clone_of;
935 node = node->next_sibling_clone;
940 /* Allocate a cgraph_edge structure and fill it with data according to the
941 parameters of which only CALLEE can be NULL (when creating an indirect call
944 static struct cgraph_edge *
945 cgraph_create_edge_1 (struct cgraph_node *caller, struct cgraph_node *callee,
946 gimple call_stmt, gcov_type count, int freq)
948 struct cgraph_edge *edge;
950 /* LTO does not actually have access to the call_stmt since these
951 have not been loaded yet. */
954 /* This is a rather expensive check possibly triggering
955 construction of call stmt hashtable. */
956 gcc_checking_assert (!cgraph_edge (caller, call_stmt));
958 gcc_assert (is_gimple_call (call_stmt));
964 free_edges = NEXT_FREE_EDGE (edge);
968 edge = ggc_alloc_cgraph_edge ();
969 edge->uid = cgraph_edge_max_uid++;
973 edge->caller = caller;
974 edge->callee = callee;
975 edge->prev_caller = NULL;
976 edge->next_caller = NULL;
977 edge->prev_callee = NULL;
978 edge->next_callee = NULL;
981 gcc_assert (count >= 0);
982 edge->frequency = freq;
983 gcc_assert (freq >= 0);
984 gcc_assert (freq <= CGRAPH_FREQ_MAX);
986 edge->call_stmt = call_stmt;
987 push_cfun (DECL_STRUCT_FUNCTION (caller->decl));
988 edge->can_throw_external
989 = call_stmt ? stmt_can_throw_external (call_stmt) : false;
991 edge->call_stmt_cannot_inline_p =
992 (call_stmt ? gimple_call_cannot_inline_p (call_stmt) : false);
993 if (call_stmt && caller->call_site_hash)
994 cgraph_add_edge_to_call_site_hash (edge);
996 edge->indirect_info = NULL;
997 edge->indirect_inlining_edge = 0;
1002 /* Create edge from CALLER to CALLEE in the cgraph. */
1004 struct cgraph_edge *
1005 cgraph_create_edge (struct cgraph_node *caller, struct cgraph_node *callee,
1006 gimple call_stmt, gcov_type count, int freq)
1008 struct cgraph_edge *edge = cgraph_create_edge_1 (caller, callee, call_stmt,
1011 edge->indirect_unknown_callee = 0;
1012 initialize_inline_failed (edge);
1014 edge->next_caller = callee->callers;
1015 if (callee->callers)
1016 callee->callers->prev_caller = edge;
1017 edge->next_callee = caller->callees;
1018 if (caller->callees)
1019 caller->callees->prev_callee = edge;
1020 caller->callees = edge;
1021 callee->callers = edge;
1026 /* Allocate cgraph_indirect_call_info and set its fields to default values. */
1028 struct cgraph_indirect_call_info *
1029 cgraph_allocate_init_indirect_info (void)
1031 struct cgraph_indirect_call_info *ii;
1033 ii = ggc_alloc_cleared_cgraph_indirect_call_info ();
1034 ii->param_index = -1;
1038 /* Create an indirect edge with a yet-undetermined callee where the call
1039 statement destination is a formal parameter of the caller with index
1042 struct cgraph_edge *
1043 cgraph_create_indirect_edge (struct cgraph_node *caller, gimple call_stmt,
1045 gcov_type count, int freq)
1047 struct cgraph_edge *edge = cgraph_create_edge_1 (caller, NULL, call_stmt,
1050 edge->indirect_unknown_callee = 1;
1051 initialize_inline_failed (edge);
1053 edge->indirect_info = cgraph_allocate_init_indirect_info ();
1054 edge->indirect_info->ecf_flags = ecf_flags;
1056 edge->next_callee = caller->indirect_calls;
1057 if (caller->indirect_calls)
1058 caller->indirect_calls->prev_callee = edge;
1059 caller->indirect_calls = edge;
1064 /* Remove the edge E from the list of the callers of the callee. */
1067 cgraph_edge_remove_callee (struct cgraph_edge *e)
1069 gcc_assert (!e->indirect_unknown_callee);
1071 e->prev_caller->next_caller = e->next_caller;
1073 e->next_caller->prev_caller = e->prev_caller;
1074 if (!e->prev_caller)
1075 e->callee->callers = e->next_caller;
1078 /* Remove the edge E from the list of the callees of the caller. */
1081 cgraph_edge_remove_caller (struct cgraph_edge *e)
1084 e->prev_callee->next_callee = e->next_callee;
1086 e->next_callee->prev_callee = e->prev_callee;
1087 if (!e->prev_callee)
1089 if (e->indirect_unknown_callee)
1090 e->caller->indirect_calls = e->next_callee;
1092 e->caller->callees = e->next_callee;
1094 if (e->caller->call_site_hash)
1095 htab_remove_elt_with_hash (e->caller->call_site_hash,
1097 htab_hash_pointer (e->call_stmt));
1100 /* Put the edge onto the free list. */
1103 cgraph_free_edge (struct cgraph_edge *e)
1107 /* Clear out the edge so we do not dangle pointers. */
1108 memset (e, 0, sizeof (*e));
1110 NEXT_FREE_EDGE (e) = free_edges;
1114 /* Remove the edge E in the cgraph. */
1117 cgraph_remove_edge (struct cgraph_edge *e)
1119 /* Call all edge removal hooks. */
1120 cgraph_call_edge_removal_hooks (e);
1122 if (!e->indirect_unknown_callee)
1123 /* Remove from callers list of the callee. */
1124 cgraph_edge_remove_callee (e);
1126 /* Remove from callees list of the callers. */
1127 cgraph_edge_remove_caller (e);
1129 /* Put the edge onto the free list. */
1130 cgraph_free_edge (e);
1133 /* Set callee of call graph edge E and add it to the corresponding set of
1137 cgraph_set_edge_callee (struct cgraph_edge *e, struct cgraph_node *n)
1139 e->prev_caller = NULL;
1141 n->callers->prev_caller = e;
1142 e->next_caller = n->callers;
1147 /* Redirect callee of E to N. The function does not update underlying
1151 cgraph_redirect_edge_callee (struct cgraph_edge *e, struct cgraph_node *n)
1153 /* Remove from callers list of the current callee. */
1154 cgraph_edge_remove_callee (e);
1156 /* Insert to callers list of the new callee. */
1157 cgraph_set_edge_callee (e, n);
1160 /* Make an indirect EDGE with an unknown callee an ordinary edge leading to
1161 CALLEE. DELTA is an integer constant that is to be added to the this
1162 pointer (first parameter) to compensate for skipping a thunk adjustment. */
1165 cgraph_make_edge_direct (struct cgraph_edge *edge, struct cgraph_node *callee)
1167 edge->indirect_unknown_callee = 0;
1169 /* Get the edge out of the indirect edge list. */
1170 if (edge->prev_callee)
1171 edge->prev_callee->next_callee = edge->next_callee;
1172 if (edge->next_callee)
1173 edge->next_callee->prev_callee = edge->prev_callee;
1174 if (!edge->prev_callee)
1175 edge->caller->indirect_calls = edge->next_callee;
1177 /* Put it into the normal callee list */
1178 edge->prev_callee = NULL;
1179 edge->next_callee = edge->caller->callees;
1180 if (edge->caller->callees)
1181 edge->caller->callees->prev_callee = edge;
1182 edge->caller->callees = edge;
1184 /* Insert to callers list of the new callee. */
1185 cgraph_set_edge_callee (edge, callee);
1187 /* We need to re-determine the inlining status of the edge. */
1188 initialize_inline_failed (edge);
1192 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1193 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1194 of OLD_STMT if it was previously call statement.
1195 If NEW_STMT is NULL, the call has been dropped without any
1199 cgraph_update_edges_for_call_stmt_node (struct cgraph_node *node,
1200 gimple old_stmt, tree old_call,
1203 tree new_call = (new_stmt && is_gimple_call (new_stmt))
1204 ? gimple_call_fndecl (new_stmt) : 0;
1206 /* We are seeing indirect calls, then there is nothing to update. */
1207 if (!new_call && !old_call)
1209 /* See if we turned indirect call into direct call or folded call to one builtin
1210 into different builtin. */
1211 if (old_call != new_call)
1213 struct cgraph_edge *e = cgraph_edge (node, old_stmt);
1214 struct cgraph_edge *ne = NULL;
1220 /* See if the edge is already there and has the correct callee. It
1221 might be so because of indirect inlining has already updated
1222 it. We also might've cloned and redirected the edge. */
1223 if (new_call && e->callee)
1225 struct cgraph_node *callee = e->callee;
1228 if (callee->decl == new_call
1229 || callee->former_clone_of == new_call)
1231 callee = callee->clone_of;
1235 /* Otherwise remove edge and create new one; we can't simply redirect
1236 since function has changed, so inline plan and other information
1237 attached to edge is invalid. */
1239 frequency = e->frequency;
1240 cgraph_remove_edge (e);
1244 /* We are seeing new direct call; compute profile info based on BB. */
1245 basic_block bb = gimple_bb (new_stmt);
1247 frequency = compute_call_stmt_bb_frequency (current_function_decl,
1253 ne = cgraph_create_edge (node, cgraph_get_create_node (new_call),
1254 new_stmt, count, frequency);
1255 gcc_assert (ne->inline_failed);
1258 /* We only updated the call stmt; update pointer in cgraph edge.. */
1259 else if (old_stmt != new_stmt)
1260 cgraph_set_call_stmt (cgraph_edge (node, old_stmt), new_stmt);
1263 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1264 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1265 of OLD_STMT before it was updated (updating can happen inplace). */
1268 cgraph_update_edges_for_call_stmt (gimple old_stmt, tree old_decl, gimple new_stmt)
1270 struct cgraph_node *orig = cgraph_get_node (cfun->decl);
1271 struct cgraph_node *node;
1273 gcc_checking_assert (orig);
1274 cgraph_update_edges_for_call_stmt_node (orig, old_stmt, old_decl, new_stmt);
1276 for (node = orig->clones; node != orig;)
1278 cgraph_update_edges_for_call_stmt_node (node, old_stmt, old_decl, new_stmt);
1280 node = node->clones;
1281 else if (node->next_sibling_clone)
1282 node = node->next_sibling_clone;
1285 while (node != orig && !node->next_sibling_clone)
1286 node = node->clone_of;
1288 node = node->next_sibling_clone;
1294 /* Remove all callees from the node. */
1297 cgraph_node_remove_callees (struct cgraph_node *node)
1299 struct cgraph_edge *e, *f;
1301 /* It is sufficient to remove the edges from the lists of callers of
1302 the callees. The callee list of the node can be zapped with one
1304 for (e = node->callees; e; e = f)
1307 cgraph_call_edge_removal_hooks (e);
1308 if (!e->indirect_unknown_callee)
1309 cgraph_edge_remove_callee (e);
1310 cgraph_free_edge (e);
1312 for (e = node->indirect_calls; e; e = f)
1315 cgraph_call_edge_removal_hooks (e);
1316 if (!e->indirect_unknown_callee)
1317 cgraph_edge_remove_callee (e);
1318 cgraph_free_edge (e);
1320 node->indirect_calls = NULL;
1321 node->callees = NULL;
1322 if (node->call_site_hash)
1324 htab_delete (node->call_site_hash);
1325 node->call_site_hash = NULL;
1329 /* Remove all callers from the node. */
1332 cgraph_node_remove_callers (struct cgraph_node *node)
1334 struct cgraph_edge *e, *f;
1336 /* It is sufficient to remove the edges from the lists of callees of
1337 the callers. The caller list of the node can be zapped with one
1339 for (e = node->callers; e; e = f)
1342 cgraph_call_edge_removal_hooks (e);
1343 cgraph_edge_remove_caller (e);
1344 cgraph_free_edge (e);
1346 node->callers = NULL;
1349 /* Release memory used to represent body of function NODE. */
1352 cgraph_release_function_body (struct cgraph_node *node)
1354 if (DECL_STRUCT_FUNCTION (node->decl))
1356 tree old_decl = current_function_decl;
1357 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1358 if (cfun->gimple_df)
1360 current_function_decl = node->decl;
1362 delete_tree_cfg_annotations ();
1364 current_function_decl = old_decl;
1368 gcc_assert (dom_computed[0] == DOM_NONE);
1369 gcc_assert (dom_computed[1] == DOM_NONE);
1372 if (cfun->value_histograms)
1374 gcc_assert (!current_loops);
1376 gimple_set_body (node->decl, NULL);
1377 VEC_free (ipa_opt_pass, heap,
1378 node->ipa_transforms_to_apply);
1379 /* Struct function hangs a lot of data that would leak if we didn't
1380 removed all pointers to it. */
1381 ggc_free (DECL_STRUCT_FUNCTION (node->decl));
1382 DECL_STRUCT_FUNCTION (node->decl) = NULL;
1384 DECL_SAVED_TREE (node->decl) = NULL;
1385 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1386 of its associated function function declaration because it's
1387 needed to emit debug info later. */
1388 if (!node->abstract_and_needed)
1389 DECL_INITIAL (node->decl) = error_mark_node;
1392 /* Remove the node from cgraph. */
1395 cgraph_remove_node (struct cgraph_node *node)
1398 bool kill_body = false;
1399 struct cgraph_node *n;
1400 int uid = node->uid;
1402 cgraph_call_node_removal_hooks (node);
1403 cgraph_node_remove_callers (node);
1404 cgraph_node_remove_callees (node);
1405 ipa_remove_all_references (&node->ref_list);
1406 ipa_remove_all_refering (&node->ref_list);
1407 VEC_free (ipa_opt_pass, heap,
1408 node->ipa_transforms_to_apply);
1410 /* Incremental inlining access removed nodes stored in the postorder list.
1412 node->needed = node->reachable = false;
1413 for (n = node->nested; n; n = n->next_nested)
1415 node->nested = NULL;
1418 struct cgraph_node **node2 = &node->origin->nested;
1420 while (*node2 != node)
1421 node2 = &(*node2)->next_nested;
1422 *node2 = node->next_nested;
1425 node->previous->next = node->next;
1427 cgraph_nodes = node->next;
1429 node->next->previous = node->previous;
1431 node->previous = NULL;
1432 slot = htab_find_slot (cgraph_hash, node, NO_INSERT);
1435 struct cgraph_node *next_inline_clone;
1437 for (next_inline_clone = node->clones;
1438 next_inline_clone && next_inline_clone->decl != node->decl;
1439 next_inline_clone = next_inline_clone->next_sibling_clone)
1442 /* If there is inline clone of the node being removed, we need
1443 to put it into the position of removed node and reorganize all
1444 other clones to be based on it. */
1445 if (next_inline_clone)
1447 struct cgraph_node *n;
1448 struct cgraph_node *new_clones;
1450 *slot = next_inline_clone;
1452 /* Unlink inline clone from the list of clones of removed node. */
1453 if (next_inline_clone->next_sibling_clone)
1454 next_inline_clone->next_sibling_clone->prev_sibling_clone
1455 = next_inline_clone->prev_sibling_clone;
1456 if (next_inline_clone->prev_sibling_clone)
1458 gcc_assert (node->clones != next_inline_clone);
1459 next_inline_clone->prev_sibling_clone->next_sibling_clone
1460 = next_inline_clone->next_sibling_clone;
1464 gcc_assert (node->clones == next_inline_clone);
1465 node->clones = next_inline_clone->next_sibling_clone;
1468 new_clones = node->clones;
1469 node->clones = NULL;
1471 /* Copy clone info. */
1472 next_inline_clone->clone = node->clone;
1474 /* Now place it into clone tree at same level at NODE. */
1475 next_inline_clone->clone_of = node->clone_of;
1476 next_inline_clone->prev_sibling_clone = NULL;
1477 next_inline_clone->next_sibling_clone = NULL;
1480 if (node->clone_of->clones)
1481 node->clone_of->clones->prev_sibling_clone = next_inline_clone;
1482 next_inline_clone->next_sibling_clone = node->clone_of->clones;
1483 node->clone_of->clones = next_inline_clone;
1486 /* Merge the clone list. */
1489 if (!next_inline_clone->clones)
1490 next_inline_clone->clones = new_clones;
1493 n = next_inline_clone->clones;
1494 while (n->next_sibling_clone)
1495 n = n->next_sibling_clone;
1496 n->next_sibling_clone = new_clones;
1497 new_clones->prev_sibling_clone = n;
1501 /* Update clone_of pointers. */
1505 n->clone_of = next_inline_clone;
1506 n = n->next_sibling_clone;
1511 htab_clear_slot (cgraph_hash, slot);
1516 if (node->prev_sibling_clone)
1517 node->prev_sibling_clone->next_sibling_clone = node->next_sibling_clone;
1518 else if (node->clone_of)
1519 node->clone_of->clones = node->next_sibling_clone;
1520 if (node->next_sibling_clone)
1521 node->next_sibling_clone->prev_sibling_clone = node->prev_sibling_clone;
1524 struct cgraph_node *n, *next;
1528 for (n = node->clones; n->next_sibling_clone; n = n->next_sibling_clone)
1529 n->clone_of = node->clone_of;
1530 n->clone_of = node->clone_of;
1531 n->next_sibling_clone = node->clone_of->clones;
1532 if (node->clone_of->clones)
1533 node->clone_of->clones->prev_sibling_clone = n;
1534 node->clone_of->clones = node->clones;
1538 /* We are removing node with clones. this makes clones inconsistent,
1539 but assume they will be removed subsequently and just keep clone
1540 tree intact. This can happen in unreachable function removal since
1541 we remove unreachable functions in random order, not by bottom-up
1542 walk of clone trees. */
1543 for (n = node->clones; n; n = next)
1545 next = n->next_sibling_clone;
1546 n->next_sibling_clone = NULL;
1547 n->prev_sibling_clone = NULL;
1553 if (node->same_comdat_group)
1555 struct cgraph_node *prev;
1556 for (prev = node->same_comdat_group;
1557 prev->same_comdat_group != node;
1558 prev = prev->same_comdat_group)
1560 if (node->same_comdat_group == prev)
1561 prev->same_comdat_group = NULL;
1563 prev->same_comdat_group = node->same_comdat_group;
1564 node->same_comdat_group = NULL;
1567 /* While all the clones are removed after being proceeded, the function
1568 itself is kept in the cgraph even after it is compiled. Check whether
1569 we are done with this body and reclaim it proactively if this is the case.
1571 if (!kill_body && *slot)
1573 struct cgraph_node *n = (struct cgraph_node *) *slot;
1574 if (!n->clones && !n->clone_of && !n->global.inlined_to
1575 && (cgraph_global_info_ready
1576 && (TREE_ASM_WRITTEN (n->decl) || DECL_EXTERNAL (n->decl)
1577 || n->in_other_partition)))
1580 if (assembler_name_hash)
1582 tree name = DECL_ASSEMBLER_NAME (node->decl);
1583 slot = htab_find_slot_with_hash (assembler_name_hash, name,
1584 decl_assembler_name_hash (name),
1586 /* Inline clones are not hashed. */
1587 if (slot && *slot == node)
1588 htab_clear_slot (assembler_name_hash, slot);
1592 cgraph_release_function_body (node);
1594 if (node->call_site_hash)
1596 htab_delete (node->call_site_hash);
1597 node->call_site_hash = NULL;
1601 /* Clear out the node to NULL all pointers and add the node to the free
1603 memset (node, 0, sizeof(*node));
1605 NEXT_FREE_NODE (node) = free_nodes;
1609 /* Add NEW_ to the same comdat group that OLD is in. */
1612 cgraph_add_to_same_comdat_group (struct cgraph_node *new_,
1613 struct cgraph_node *old)
1615 gcc_assert (DECL_ONE_ONLY (old->decl));
1616 gcc_assert (!new_->same_comdat_group);
1617 gcc_assert (new_ != old);
1619 DECL_COMDAT_GROUP (new_->decl) = DECL_COMDAT_GROUP (old->decl);
1620 new_->same_comdat_group = old;
1621 if (!old->same_comdat_group)
1622 old->same_comdat_group = new_;
1625 struct cgraph_node *n;
1626 for (n = old->same_comdat_group;
1627 n->same_comdat_group != old;
1628 n = n->same_comdat_group)
1630 n->same_comdat_group = new_;
1634 /* Remove the node from cgraph. */
1637 cgraph_remove_node_and_inline_clones (struct cgraph_node *node)
1639 struct cgraph_edge *e, *next;
1640 for (e = node->callees; e; e = next)
1642 next = e->next_callee;
1643 if (!e->inline_failed)
1644 cgraph_remove_node_and_inline_clones (e->callee);
1646 cgraph_remove_node (node);
1649 /* Notify finalize_compilation_unit that given node is reachable. */
1652 cgraph_mark_reachable_node (struct cgraph_node *node)
1654 if (!node->reachable && node->local.finalized)
1656 if (cgraph_global_info_ready)
1658 /* Verify that function does not appear to be needed out of blue
1659 during the optimization process. This can happen for extern
1660 inlines when bodies was removed after inlining. */
1661 gcc_assert ((node->analyzed || node->in_other_partition
1662 || DECL_EXTERNAL (node->decl)));
1665 notice_global_symbol (node->decl);
1666 node->reachable = 1;
1668 node->next_needed = cgraph_nodes_queue;
1669 cgraph_nodes_queue = node;
1673 /* Likewise indicate that a node is needed, i.e. reachable via some
1677 cgraph_mark_needed_node (struct cgraph_node *node)
1680 gcc_assert (!node->global.inlined_to);
1681 cgraph_mark_reachable_node (node);
1684 /* Likewise indicate that a node is having address taken. */
1687 cgraph_mark_address_taken_node (struct cgraph_node *node)
1689 gcc_assert (!node->global.inlined_to);
1690 cgraph_mark_reachable_node (node);
1691 /* FIXME: address_taken flag is used both as a shortcut for testing whether
1692 IPA_REF_ADDR reference exists (and thus it should be set on node
1693 representing alias we take address of) and as a test whether address
1694 of the object was taken (and thus it should be set on node alias is
1695 referring to). We should remove the first use and the remove the
1697 node->address_taken = 1;
1698 node = cgraph_function_or_thunk_node (node, NULL);
1699 node->address_taken = 1;
1702 /* Return local info for the compiled function. */
1704 struct cgraph_local_info *
1705 cgraph_local_info (tree decl)
1707 struct cgraph_node *node;
1709 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
1710 node = cgraph_get_node (decl);
1713 return &node->local;
1716 /* Return local info for the compiled function. */
1718 struct cgraph_global_info *
1719 cgraph_global_info (tree decl)
1721 struct cgraph_node *node;
1723 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL && cgraph_global_info_ready);
1724 node = cgraph_get_node (decl);
1727 return &node->global;
1730 /* Return local info for the compiled function. */
1732 struct cgraph_rtl_info *
1733 cgraph_rtl_info (tree decl)
1735 struct cgraph_node *node;
1737 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
1738 node = cgraph_get_node (decl);
1740 || (decl != current_function_decl
1741 && !TREE_ASM_WRITTEN (node->decl)))
1746 /* Return a string describing the failure REASON. */
1749 cgraph_inline_failed_string (cgraph_inline_failed_t reason)
1752 #define DEFCIFCODE(code, string) string,
1754 static const char *cif_string_table[CIF_N_REASONS] = {
1755 #include "cif-code.def"
1758 /* Signedness of an enum type is implementation defined, so cast it
1759 to unsigned before testing. */
1760 gcc_assert ((unsigned) reason < CIF_N_REASONS);
1761 return cif_string_table[reason];
1764 /* Return name of the node used in debug output. */
1766 cgraph_node_name (struct cgraph_node *node)
1768 return lang_hooks.decl_printable_name (node->decl, 2);
1771 /* Names used to print out the availability enum. */
1772 const char * const cgraph_availability_names[] =
1773 {"unset", "not_available", "overwritable", "available", "local"};
1776 /* Dump call graph node NODE to file F. */
1779 dump_cgraph_node (FILE *f, struct cgraph_node *node)
1781 struct cgraph_edge *edge;
1782 int indirect_calls_count = 0;
1784 fprintf (f, "%s/%i", cgraph_node_name (node), node->uid);
1785 dump_addr (f, " @", (void *)node);
1786 if (DECL_ASSEMBLER_NAME_SET_P (node->decl))
1787 fprintf (f, " (asm: %s)", IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->decl)));
1788 if (node->global.inlined_to)
1789 fprintf (f, " (inline copy in %s/%i)",
1790 cgraph_node_name (node->global.inlined_to),
1791 node->global.inlined_to->uid);
1792 if (node->same_comdat_group)
1793 fprintf (f, " (same comdat group as %s/%i)",
1794 cgraph_node_name (node->same_comdat_group),
1795 node->same_comdat_group->uid);
1797 fprintf (f, " (clone of %s/%i)",
1798 cgraph_node_name (node->clone_of),
1799 node->clone_of->uid);
1800 if (cgraph_function_flags_ready)
1801 fprintf (f, " availability:%s",
1802 cgraph_availability_names [cgraph_function_body_availability (node)]);
1804 fprintf (f, " analyzed");
1805 if (node->in_other_partition)
1806 fprintf (f, " in_other_partition");
1808 fprintf (f, " executed "HOST_WIDEST_INT_PRINT_DEC"x",
1809 (HOST_WIDEST_INT)node->count);
1811 fprintf (f, " nested in: %s", cgraph_node_name (node->origin));
1813 fprintf (f, " needed");
1814 if (node->address_taken)
1815 fprintf (f, " address_taken");
1816 else if (node->reachable)
1817 fprintf (f, " reachable");
1818 else if (node->reachable_from_other_partition)
1819 fprintf (f, " reachable_from_other_partition");
1820 if (gimple_has_body_p (node->decl))
1821 fprintf (f, " body");
1823 fprintf (f, " process");
1824 if (node->local.local)
1825 fprintf (f, " local");
1826 if (node->local.externally_visible)
1827 fprintf (f, " externally_visible");
1828 if (node->resolution != LDPR_UNKNOWN)
1830 ld_plugin_symbol_resolution_names[(int)node->resolution]);
1831 if (node->local.finalized)
1832 fprintf (f, " finalized");
1833 if (node->local.redefined_extern_inline)
1834 fprintf (f, " redefined_extern_inline");
1835 if (TREE_ASM_WRITTEN (node->decl))
1836 fprintf (f, " asm_written");
1837 if (node->only_called_at_startup)
1838 fprintf (f, " only_called_at_startup");
1839 if (node->only_called_at_exit)
1840 fprintf (f, " only_called_at_exit");
1841 else if (node->alias)
1842 fprintf (f, " alias");
1844 fprintf (f, " tm_clone");
1848 if (node->thunk.thunk_p)
1850 fprintf (f, " thunk of %s (asm: %s) fixed offset %i virtual value %i has "
1851 "virtual offset %i)\n",
1852 lang_hooks.decl_printable_name (node->thunk.alias, 2),
1853 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->thunk.alias)),
1854 (int)node->thunk.fixed_offset,
1855 (int)node->thunk.virtual_value,
1856 (int)node->thunk.virtual_offset_p);
1858 if (node->alias && node->thunk.alias)
1860 fprintf (f, " alias of %s",
1861 lang_hooks.decl_printable_name (node->thunk.alias, 2));
1862 if (DECL_ASSEMBLER_NAME_SET_P (node->thunk.alias))
1863 fprintf (f, " (asm: %s)",
1864 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->thunk.alias)));
1868 fprintf (f, " called by: ");
1870 for (edge = node->callers; edge; edge = edge->next_caller)
1872 fprintf (f, "%s/%i ", cgraph_node_name (edge->caller),
1875 fprintf (f, "("HOST_WIDEST_INT_PRINT_DEC"x) ",
1876 (HOST_WIDEST_INT)edge->count);
1877 if (edge->frequency)
1878 fprintf (f, "(%.2f per call) ",
1879 edge->frequency / (double)CGRAPH_FREQ_BASE);
1880 if (!edge->inline_failed)
1881 fprintf(f, "(inlined) ");
1882 if (edge->indirect_inlining_edge)
1883 fprintf(f, "(indirect_inlining) ");
1884 if (edge->can_throw_external)
1885 fprintf(f, "(can throw external) ");
1888 fprintf (f, "\n calls: ");
1889 for (edge = node->callees; edge; edge = edge->next_callee)
1891 fprintf (f, "%s/%i ", cgraph_node_name (edge->callee),
1893 if (!edge->inline_failed)
1894 fprintf(f, "(inlined) ");
1895 if (edge->indirect_inlining_edge)
1896 fprintf(f, "(indirect_inlining) ");
1898 fprintf (f, "("HOST_WIDEST_INT_PRINT_DEC"x) ",
1899 (HOST_WIDEST_INT)edge->count);
1900 if (edge->frequency)
1901 fprintf (f, "(%.2f per call) ",
1902 edge->frequency / (double)CGRAPH_FREQ_BASE);
1903 if (edge->can_throw_external)
1904 fprintf(f, "(can throw external) ");
1907 fprintf (f, " References: ");
1908 ipa_dump_references (f, &node->ref_list);
1909 fprintf (f, " Refering this function: ");
1910 ipa_dump_refering (f, &node->ref_list);
1912 for (edge = node->indirect_calls; edge; edge = edge->next_callee)
1913 indirect_calls_count++;
1914 if (indirect_calls_count)
1915 fprintf (f, " has %i outgoing edges for indirect calls.\n",
1916 indirect_calls_count);
1920 /* Dump call graph node NODE to stderr. */
1923 debug_cgraph_node (struct cgraph_node *node)
1925 dump_cgraph_node (stderr, node);
1929 /* Dump the callgraph to file F. */
1932 dump_cgraph (FILE *f)
1934 struct cgraph_node *node;
1936 fprintf (f, "callgraph:\n\n");
1937 for (node = cgraph_nodes; node; node = node->next)
1938 dump_cgraph_node (f, node);
1942 /* Dump the call graph to stderr. */
1947 dump_cgraph (stderr);
1951 /* Set the DECL_ASSEMBLER_NAME and update cgraph hashtables. */
1954 change_decl_assembler_name (tree decl, tree name)
1956 struct cgraph_node *node;
1958 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
1959 SET_DECL_ASSEMBLER_NAME (decl, name);
1962 if (name == DECL_ASSEMBLER_NAME (decl))
1965 if (assembler_name_hash
1966 && TREE_CODE (decl) == FUNCTION_DECL
1967 && (node = cgraph_get_node (decl)) != NULL)
1969 tree old_name = DECL_ASSEMBLER_NAME (decl);
1970 slot = htab_find_slot_with_hash (assembler_name_hash, old_name,
1971 decl_assembler_name_hash (old_name),
1973 /* Inline clones are not hashed. */
1974 if (slot && *slot == node)
1975 htab_clear_slot (assembler_name_hash, slot);
1977 if (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))
1978 && DECL_RTL_SET_P (decl))
1979 warning (0, "%D renamed after being referenced in assembly", decl);
1981 SET_DECL_ASSEMBLER_NAME (decl, name);
1983 if (assembler_name_hash
1984 && TREE_CODE (decl) == FUNCTION_DECL
1985 && (node = cgraph_get_node (decl)) != NULL)
1987 slot = htab_find_slot_with_hash (assembler_name_hash, name,
1988 decl_assembler_name_hash (name),
1990 gcc_assert (!*slot);
1995 /* Add a top-level asm statement to the list. */
1997 struct cgraph_asm_node *
1998 cgraph_add_asm_node (tree asm_str)
2000 struct cgraph_asm_node *node;
2002 node = ggc_alloc_cleared_cgraph_asm_node ();
2003 node->asm_str = asm_str;
2004 node->order = cgraph_order++;
2006 if (cgraph_asm_nodes == NULL)
2007 cgraph_asm_nodes = node;
2009 cgraph_asm_last_node->next = node;
2010 cgraph_asm_last_node = node;
2014 /* Return true when the DECL can possibly be inlined. */
2016 cgraph_function_possibly_inlined_p (tree decl)
2018 if (!cgraph_global_info_ready)
2019 return !DECL_UNINLINABLE (decl);
2020 return DECL_POSSIBLY_INLINED (decl);
2023 /* Create clone of E in the node N represented by CALL_EXPR the callgraph. */
2024 struct cgraph_edge *
2025 cgraph_clone_edge (struct cgraph_edge *e, struct cgraph_node *n,
2026 gimple call_stmt, unsigned stmt_uid, gcov_type count_scale,
2027 int freq_scale, bool update_original)
2029 struct cgraph_edge *new_edge;
2030 gcov_type count = e->count * count_scale / REG_BR_PROB_BASE;
2033 /* We do not want to ignore loop nest after frequency drops to 0. */
2036 freq = e->frequency * (gcov_type) freq_scale / CGRAPH_FREQ_BASE;
2037 if (freq > CGRAPH_FREQ_MAX)
2038 freq = CGRAPH_FREQ_MAX;
2040 if (e->indirect_unknown_callee)
2044 if (call_stmt && (decl = gimple_call_fndecl (call_stmt)))
2046 struct cgraph_node *callee = cgraph_get_node (decl);
2047 gcc_checking_assert (callee);
2048 new_edge = cgraph_create_edge (n, callee, call_stmt, count, freq);
2052 new_edge = cgraph_create_indirect_edge (n, call_stmt,
2053 e->indirect_info->ecf_flags,
2055 *new_edge->indirect_info = *e->indirect_info;
2060 new_edge = cgraph_create_edge (n, e->callee, call_stmt, count, freq);
2061 if (e->indirect_info)
2063 new_edge->indirect_info
2064 = ggc_alloc_cleared_cgraph_indirect_call_info ();
2065 *new_edge->indirect_info = *e->indirect_info;
2069 new_edge->inline_failed = e->inline_failed;
2070 new_edge->indirect_inlining_edge = e->indirect_inlining_edge;
2071 new_edge->lto_stmt_uid = stmt_uid;
2072 /* Clone flags that depend on call_stmt availability manually. */
2073 new_edge->can_throw_external = e->can_throw_external;
2074 new_edge->call_stmt_cannot_inline_p = e->call_stmt_cannot_inline_p;
2075 if (update_original)
2077 e->count -= new_edge->count;
2081 cgraph_call_edge_duplication_hooks (e, new_edge);
2086 /* Create node representing clone of N executed COUNT times. Decrease
2087 the execution counts from original node too.
2088 The new clone will have decl set to DECL that may or may not be the same
2091 When UPDATE_ORIGINAL is true, the counts are subtracted from the original
2092 function's profile to reflect the fact that part of execution is handled
2094 When CALL_DUPLICATOIN_HOOK is true, the ipa passes are acknowledged about
2095 the new clone. Otherwise the caller is responsible for doing so later. */
2097 struct cgraph_node *
2098 cgraph_clone_node (struct cgraph_node *n, tree decl, gcov_type count, int freq,
2099 bool update_original,
2100 VEC(cgraph_edge_p,heap) *redirect_callers,
2101 bool call_duplication_hook)
2103 struct cgraph_node *new_node = cgraph_create_node_1 ();
2104 struct cgraph_edge *e;
2105 gcov_type count_scale;
2108 new_node->decl = decl;
2109 new_node->origin = n->origin;
2110 if (new_node->origin)
2112 new_node->next_nested = new_node->origin->nested;
2113 new_node->origin->nested = new_node;
2115 new_node->analyzed = n->analyzed;
2116 new_node->local = n->local;
2117 new_node->local.externally_visible = false;
2118 new_node->local.local = true;
2119 new_node->global = n->global;
2120 new_node->rtl = n->rtl;
2121 new_node->count = count;
2122 new_node->frequency = n->frequency;
2123 new_node->clone = n->clone;
2124 new_node->clone.tree_map = 0;
2127 if (new_node->count > n->count)
2128 count_scale = REG_BR_PROB_BASE;
2130 count_scale = new_node->count * REG_BR_PROB_BASE / n->count;
2134 if (update_original)
2141 FOR_EACH_VEC_ELT (cgraph_edge_p, redirect_callers, i, e)
2143 /* Redirect calls to the old version node to point to its new
2145 cgraph_redirect_edge_callee (e, new_node);
2149 for (e = n->callees;e; e=e->next_callee)
2150 cgraph_clone_edge (e, new_node, e->call_stmt, e->lto_stmt_uid,
2151 count_scale, freq, update_original);
2153 for (e = n->indirect_calls; e; e = e->next_callee)
2154 cgraph_clone_edge (e, new_node, e->call_stmt, e->lto_stmt_uid,
2155 count_scale, freq, update_original);
2156 ipa_clone_references (new_node, NULL, &n->ref_list);
2158 new_node->next_sibling_clone = n->clones;
2160 n->clones->prev_sibling_clone = new_node;
2161 n->clones = new_node;
2162 new_node->clone_of = n;
2164 if (n->decl != decl)
2166 struct cgraph_node **slot;
2167 slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, new_node, INSERT);
2168 gcc_assert (!*slot);
2170 if (assembler_name_hash)
2173 tree name = DECL_ASSEMBLER_NAME (decl);
2175 aslot = htab_find_slot_with_hash (assembler_name_hash, name,
2176 decl_assembler_name_hash (name),
2178 gcc_assert (!*aslot);
2183 if (call_duplication_hook)
2184 cgraph_call_node_duplication_hooks (n, new_node);
2188 /* Create a new name for clone of DECL, add SUFFIX. Returns an identifier. */
2190 static GTY(()) unsigned int clone_fn_id_num;
2193 clone_function_name (tree decl, const char *suffix)
2195 tree name = DECL_ASSEMBLER_NAME (decl);
2196 size_t len = IDENTIFIER_LENGTH (name);
2197 char *tmp_name, *prefix;
2199 prefix = XALLOCAVEC (char, len + strlen (suffix) + 2);
2200 memcpy (prefix, IDENTIFIER_POINTER (name), len);
2201 strcpy (prefix + len + 1, suffix);
2202 #ifndef NO_DOT_IN_LABEL
2204 #elif !defined NO_DOLLAR_IN_LABEL
2209 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix, clone_fn_id_num++);
2210 return get_identifier (tmp_name);
2213 /* Create callgraph node clone with new declaration. The actual body will
2214 be copied later at compilation stage.
2216 TODO: after merging in ipa-sra use function call notes instead of args_to_skip
2219 struct cgraph_node *
2220 cgraph_create_virtual_clone (struct cgraph_node *old_node,
2221 VEC(cgraph_edge_p,heap) *redirect_callers,
2222 VEC(ipa_replace_map_p,gc) *tree_map,
2223 bitmap args_to_skip,
2224 const char * suffix)
2226 tree old_decl = old_node->decl;
2227 struct cgraph_node *new_node = NULL;
2230 struct ipa_replace_map *map;
2233 gcc_checking_assert (tree_versionable_function_p (old_decl));
2235 gcc_assert (old_node->local.can_change_signature || !args_to_skip);
2237 /* Make a new FUNCTION_DECL tree node */
2239 new_decl = copy_node (old_decl);
2241 new_decl = build_function_decl_skip_args (old_decl, args_to_skip);
2242 DECL_STRUCT_FUNCTION (new_decl) = NULL;
2244 /* Generate a new name for the new version. */
2245 DECL_NAME (new_decl) = clone_function_name (old_decl, suffix);
2246 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
2247 SET_DECL_RTL (new_decl, NULL);
2249 new_node = cgraph_clone_node (old_node, new_decl, old_node->count,
2250 CGRAPH_FREQ_BASE, false,
2251 redirect_callers, false);
2252 /* Update the properties.
2253 Make clone visible only within this translation unit. Make sure
2254 that is not weak also.
2255 ??? We cannot use COMDAT linkage because there is no
2256 ABI support for this. */
2257 DECL_EXTERNAL (new_node->decl) = 0;
2258 if (DECL_ONE_ONLY (old_decl))
2259 DECL_SECTION_NAME (new_node->decl) = NULL;
2260 DECL_COMDAT_GROUP (new_node->decl) = 0;
2261 TREE_PUBLIC (new_node->decl) = 0;
2262 DECL_COMDAT (new_node->decl) = 0;
2263 DECL_WEAK (new_node->decl) = 0;
2264 DECL_STATIC_CONSTRUCTOR (new_node->decl) = 0;
2265 DECL_STATIC_DESTRUCTOR (new_node->decl) = 0;
2266 new_node->clone.tree_map = tree_map;
2267 new_node->clone.args_to_skip = args_to_skip;
2268 FOR_EACH_VEC_ELT (ipa_replace_map_p, tree_map, i, map)
2270 tree var = map->new_tree;
2273 if (TREE_CODE (var) != ADDR_EXPR)
2275 var = get_base_var (var);
2279 /* Record references of the future statement initializing the constant
2281 if (TREE_CODE (var) == FUNCTION_DECL)
2283 struct cgraph_node *ref_node = cgraph_get_node (var);
2284 gcc_checking_assert (ref_node);
2285 ipa_record_reference (new_node, NULL, ref_node, NULL, IPA_REF_ADDR,
2288 else if (TREE_CODE (var) == VAR_DECL)
2289 ipa_record_reference (new_node, NULL, NULL, varpool_node (var),
2290 IPA_REF_ADDR, NULL);
2293 new_node->clone.combined_args_to_skip = old_node->clone.combined_args_to_skip;
2294 else if (old_node->clone.combined_args_to_skip)
2296 int newi = 0, oldi = 0;
2298 bitmap new_args_to_skip = BITMAP_GGC_ALLOC ();
2299 struct cgraph_node *orig_node;
2300 for (orig_node = old_node; orig_node->clone_of; orig_node = orig_node->clone_of)
2302 for (arg = DECL_ARGUMENTS (orig_node->decl); arg; arg = DECL_CHAIN (arg), oldi++)
2304 if (bitmap_bit_p (old_node->clone.combined_args_to_skip, oldi))
2306 bitmap_set_bit (new_args_to_skip, oldi);
2309 if (bitmap_bit_p (args_to_skip, newi))
2310 bitmap_set_bit (new_args_to_skip, oldi);
2313 new_node->clone.combined_args_to_skip = new_args_to_skip;
2316 new_node->clone.combined_args_to_skip = args_to_skip;
2317 new_node->local.externally_visible = 0;
2318 new_node->local.local = 1;
2319 new_node->lowered = true;
2320 new_node->reachable = true;
2322 cgraph_call_node_duplication_hooks (old_node, new_node);
2328 /* NODE is no longer nested function; update cgraph accordingly. */
2330 cgraph_unnest_node (struct cgraph_node *node)
2332 struct cgraph_node **node2 = &node->origin->nested;
2333 gcc_assert (node->origin);
2335 while (*node2 != node)
2336 node2 = &(*node2)->next_nested;
2337 *node2 = node->next_nested;
2338 node->origin = NULL;
2341 /* Return function availability. See cgraph.h for description of individual
2344 cgraph_function_body_availability (struct cgraph_node *node)
2346 enum availability avail;
2347 gcc_assert (cgraph_function_flags_ready);
2348 if (!node->analyzed)
2349 avail = AVAIL_NOT_AVAILABLE;
2350 else if (node->local.local)
2351 avail = AVAIL_LOCAL;
2352 else if (!node->local.externally_visible)
2353 avail = AVAIL_AVAILABLE;
2354 /* Inline functions are safe to be analyzed even if their symbol can
2355 be overwritten at runtime. It is not meaningful to enforce any sane
2356 behaviour on replacing inline function by different body. */
2357 else if (DECL_DECLARED_INLINE_P (node->decl))
2358 avail = AVAIL_AVAILABLE;
2360 /* If the function can be overwritten, return OVERWRITABLE. Take
2361 care at least of two notable extensions - the COMDAT functions
2362 used to share template instantiations in C++ (this is symmetric
2363 to code cp_cannot_inline_tree_fn and probably shall be shared and
2364 the inlinability hooks completely eliminated).
2366 ??? Does the C++ one definition rule allow us to always return
2367 AVAIL_AVAILABLE here? That would be good reason to preserve this
2370 else if (decl_replaceable_p (node->decl) && !DECL_EXTERNAL (node->decl))
2371 avail = AVAIL_OVERWRITABLE;
2372 else avail = AVAIL_AVAILABLE;
2377 /* Add the function FNDECL to the call graph.
2378 Unlike cgraph_finalize_function, this function is intended to be used
2379 by middle end and allows insertion of new function at arbitrary point
2380 of compilation. The function can be either in high, low or SSA form
2383 The function is assumed to be reachable and have address taken (so no
2384 API breaking optimizations are performed on it).
2386 Main work done by this function is to enqueue the function for later
2387 processing to avoid need the passes to be re-entrant. */
2390 cgraph_add_new_function (tree fndecl, bool lowered)
2392 struct cgraph_node *node;
2393 switch (cgraph_state)
2395 case CGRAPH_STATE_CONSTRUCTION:
2396 /* Just enqueue function to be processed at nearest occurrence. */
2397 node = cgraph_create_node (fndecl);
2398 node->next_needed = cgraph_new_nodes;
2400 node->lowered = true;
2401 cgraph_new_nodes = node;
2404 case CGRAPH_STATE_IPA:
2405 case CGRAPH_STATE_IPA_SSA:
2406 case CGRAPH_STATE_EXPANSION:
2407 /* Bring the function into finalized state and enqueue for later
2408 analyzing and compilation. */
2409 node = cgraph_get_create_node (fndecl);
2410 node->local.local = false;
2411 node->local.finalized = true;
2412 node->reachable = node->needed = true;
2413 if (!lowered && cgraph_state == CGRAPH_STATE_EXPANSION)
2415 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
2416 current_function_decl = fndecl;
2417 gimple_register_cfg_hooks ();
2418 tree_lowering_passes (fndecl);
2419 bitmap_obstack_initialize (NULL);
2420 if (!gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl)))
2421 execute_pass_list (pass_early_local_passes.pass.sub);
2422 bitmap_obstack_release (NULL);
2424 current_function_decl = NULL;
2429 node->lowered = true;
2430 node->next_needed = cgraph_new_nodes;
2431 cgraph_new_nodes = node;
2434 case CGRAPH_STATE_FINISHED:
2435 /* At the very end of compilation we have to do all the work up
2437 node = cgraph_create_node (fndecl);
2439 node->lowered = true;
2440 cgraph_analyze_function (node);
2441 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
2442 current_function_decl = fndecl;
2443 gimple_register_cfg_hooks ();
2444 bitmap_obstack_initialize (NULL);
2445 if (!gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl)))
2446 execute_pass_list (pass_early_local_passes.pass.sub);
2447 bitmap_obstack_release (NULL);
2448 tree_rest_of_compilation (fndecl);
2450 current_function_decl = NULL;
2454 /* Set a personality if required and we already passed EH lowering. */
2456 && (function_needs_eh_personality (DECL_STRUCT_FUNCTION (fndecl))
2457 == eh_personality_lang))
2458 DECL_FUNCTION_PERSONALITY (fndecl) = lang_hooks.eh_personality ();
2461 /* Worker for cgraph_node_can_be_local_p. */
2463 cgraph_node_cannot_be_local_p_1 (struct cgraph_node *node,
2464 void *data ATTRIBUTE_UNUSED)
2466 return !(!node->needed
2467 && ((DECL_COMDAT (node->decl) && !node->same_comdat_group)
2468 || !node->local.externally_visible));
2471 /* Return true if NODE can be made local for API change.
2472 Extern inline functions and C++ COMDAT functions can be made local
2473 at the expense of possible code size growth if function is used in multiple
2474 compilation units. */
2476 cgraph_node_can_be_local_p (struct cgraph_node *node)
2478 return (!node->address_taken
2479 && !cgraph_for_node_and_aliases (node,
2480 cgraph_node_cannot_be_local_p_1,
2484 /* Make DECL local. FIXME: We shouldn't need to mess with rtl this early,
2485 but other code such as notice_global_symbol generates rtl. */
2487 cgraph_make_decl_local (tree decl)
2491 if (TREE_CODE (decl) == VAR_DECL)
2492 DECL_COMMON (decl) = 0;
2493 else gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
2495 if (DECL_ONE_ONLY (decl) || DECL_COMDAT (decl))
2497 /* It is possible that we are linking against library defining same COMDAT
2498 function. To avoid conflict we need to rename our local name of the
2499 function just in the case WHOPR partitioning decide to make it hidden
2500 to avoid cross partition references. */
2503 const char *old_name;
2505 old_name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2506 if (TREE_CODE (decl) == FUNCTION_DECL)
2508 struct cgraph_node *node = cgraph_get_node (decl);
2509 change_decl_assembler_name (decl,
2510 clone_function_name (decl, "local"));
2511 if (node->local.lto_file_data)
2512 lto_record_renamed_decl (node->local.lto_file_data,
2515 (DECL_ASSEMBLER_NAME (decl)));
2517 else if (TREE_CODE (decl) == VAR_DECL)
2519 struct varpool_node *vnode = varpool_get_node (decl);
2520 /* change_decl_assembler_name will warn here on vtables because
2521 C++ frontend still sets TREE_SYMBOL_REFERENCED on them. */
2522 SET_DECL_ASSEMBLER_NAME (decl,
2523 clone_function_name (decl, "local"));
2524 if (vnode->lto_file_data)
2525 lto_record_renamed_decl (vnode->lto_file_data,
2528 (DECL_ASSEMBLER_NAME (decl)));
2531 DECL_SECTION_NAME (decl) = 0;
2532 DECL_COMDAT (decl) = 0;
2534 DECL_COMDAT_GROUP (decl) = 0;
2535 DECL_WEAK (decl) = 0;
2536 DECL_EXTERNAL (decl) = 0;
2537 TREE_PUBLIC (decl) = 0;
2538 if (!DECL_RTL_SET_P (decl))
2541 /* Update rtl flags. */
2542 make_decl_rtl (decl);
2544 rtl = DECL_RTL (decl);
2548 symbol = XEXP (rtl, 0);
2549 if (GET_CODE (symbol) != SYMBOL_REF)
2552 SYMBOL_REF_WEAK (symbol) = DECL_WEAK (decl);
2555 /* Call calback on NODE, thunks and aliases asociated to NODE.
2556 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2560 cgraph_for_node_thunks_and_aliases (struct cgraph_node *node,
2561 bool (*callback) (struct cgraph_node *, void *),
2563 bool include_overwritable)
2565 struct cgraph_edge *e;
2567 struct ipa_ref *ref;
2569 if (callback (node, data))
2571 for (e = node->callers; e; e = e->next_caller)
2572 if (e->caller->thunk.thunk_p
2573 && (include_overwritable
2574 || cgraph_function_body_availability (e->caller) > AVAIL_OVERWRITABLE))
2575 if (cgraph_for_node_thunks_and_aliases (e->caller, callback, data,
2576 include_overwritable))
2578 for (i = 0; ipa_ref_list_refering_iterate (&node->ref_list, i, ref); i++)
2579 if (ref->use == IPA_REF_ALIAS)
2581 struct cgraph_node *alias = ipa_ref_refering_node (ref);
2582 if (include_overwritable
2583 || cgraph_function_body_availability (alias) > AVAIL_OVERWRITABLE)
2584 if (cgraph_for_node_thunks_and_aliases (alias, callback, data,
2585 include_overwritable))
2591 /* Call calback on NODE and aliases asociated to NODE.
2592 When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
2596 cgraph_for_node_and_aliases (struct cgraph_node *node,
2597 bool (*callback) (struct cgraph_node *, void *),
2599 bool include_overwritable)
2602 struct ipa_ref *ref;
2604 if (callback (node, data))
2606 for (i = 0; ipa_ref_list_refering_iterate (&node->ref_list, i, ref); i++)
2607 if (ref->use == IPA_REF_ALIAS)
2609 struct cgraph_node *alias = ipa_ref_refering_node (ref);
2610 if (include_overwritable
2611 || cgraph_function_body_availability (alias) > AVAIL_OVERWRITABLE)
2612 if (cgraph_for_node_and_aliases (alias, callback, data,
2613 include_overwritable))
2619 /* Worker to bring NODE local. */
2622 cgraph_make_node_local_1 (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
2624 gcc_checking_assert (cgraph_node_can_be_local_p (node));
2625 if (DECL_COMDAT (node->decl) || DECL_EXTERNAL (node->decl))
2627 cgraph_make_decl_local (node->decl);
2629 node->local.externally_visible = false;
2630 node->local.local = true;
2631 node->resolution = LDPR_PREVAILING_DEF_IRONLY;
2632 gcc_assert (cgraph_function_body_availability (node) == AVAIL_LOCAL);
2637 /* Bring NODE local. */
2640 cgraph_make_node_local (struct cgraph_node *node)
2642 cgraph_for_node_thunks_and_aliases (node, cgraph_make_node_local_1,
2646 /* Worker to set nothrow flag. */
2649 cgraph_set_nothrow_flag_1 (struct cgraph_node *node, void *data)
2651 struct cgraph_edge *e;
2653 TREE_NOTHROW (node->decl) = data != NULL;
2656 for (e = node->callers; e; e = e->next_caller)
2657 e->can_throw_external = false;
2661 /* Set TREE_NOTHROW on NODE's decl and on aliases of NODE
2662 if any to NOTHROW. */
2665 cgraph_set_nothrow_flag (struct cgraph_node *node, bool nothrow)
2667 cgraph_for_node_thunks_and_aliases (node, cgraph_set_nothrow_flag_1,
2668 (void *)(size_t)nothrow, false);
2671 /* Worker to set const flag. */
2674 cgraph_set_const_flag_1 (struct cgraph_node *node, void *data)
2676 /* Static constructors and destructors without a side effect can be
2678 if (data && !((size_t)data & 2))
2680 if (DECL_STATIC_CONSTRUCTOR (node->decl))
2681 DECL_STATIC_CONSTRUCTOR (node->decl) = 0;
2682 if (DECL_STATIC_DESTRUCTOR (node->decl))
2683 DECL_STATIC_DESTRUCTOR (node->decl) = 0;
2685 TREE_READONLY (node->decl) = data != NULL;
2686 DECL_LOOPING_CONST_OR_PURE_P (node->decl) = ((size_t)data & 2) != 0;
2690 /* Set TREE_READONLY on NODE's decl and on aliases of NODE
2691 if any to READONLY. */
2694 cgraph_set_const_flag (struct cgraph_node *node, bool readonly, bool looping)
2696 cgraph_for_node_thunks_and_aliases (node, cgraph_set_const_flag_1,
2697 (void *)(size_t)(readonly + (int)looping * 2),
2701 /* Worker to set pure flag. */
2704 cgraph_set_pure_flag_1 (struct cgraph_node *node, void *data)
2706 /* Static pureructors and destructors without a side effect can be
2708 if (data && !((size_t)data & 2))
2710 if (DECL_STATIC_CONSTRUCTOR (node->decl))
2711 DECL_STATIC_CONSTRUCTOR (node->decl) = 0;
2712 if (DECL_STATIC_DESTRUCTOR (node->decl))
2713 DECL_STATIC_DESTRUCTOR (node->decl) = 0;
2715 DECL_PURE_P (node->decl) = data != NULL;
2716 DECL_LOOPING_CONST_OR_PURE_P (node->decl) = ((size_t)data & 2) != 0;
2720 /* Set DECL_PURE_P on NODE's decl and on aliases of NODE
2724 cgraph_set_pure_flag (struct cgraph_node *node, bool pure, bool looping)
2726 cgraph_for_node_thunks_and_aliases (node, cgraph_set_pure_flag_1,
2727 (void *)(size_t)(pure + (int)looping * 2),
2731 /* Data used by cgraph_propagate_frequency. */
2733 struct cgraph_propagate_frequency_data
2735 bool maybe_unlikely_executed;
2736 bool maybe_executed_once;
2737 bool only_called_at_startup;
2738 bool only_called_at_exit;
2741 /* Worker for cgraph_propagate_frequency_1. */
2744 cgraph_propagate_frequency_1 (struct cgraph_node *node, void *data)
2746 struct cgraph_propagate_frequency_data *d;
2747 struct cgraph_edge *edge;
2749 d = (struct cgraph_propagate_frequency_data *)data;
2750 for (edge = node->callers;
2751 edge && (d->maybe_unlikely_executed || d->maybe_executed_once
2752 || d->only_called_at_startup || d->only_called_at_exit);
2753 edge = edge->next_caller)
2755 if (edge->caller != node)
2757 d->only_called_at_startup &= edge->caller->only_called_at_startup;
2758 /* It makes sense to put main() together with the static constructors.
2759 It will be executed for sure, but rest of functions called from
2760 main are definitely not at startup only. */
2761 if (MAIN_NAME_P (DECL_NAME (edge->caller->decl)))
2762 d->only_called_at_startup = 0;
2763 d->only_called_at_exit &= edge->caller->only_called_at_exit;
2765 if (!edge->frequency)
2767 switch (edge->caller->frequency)
2769 case NODE_FREQUENCY_UNLIKELY_EXECUTED:
2771 case NODE_FREQUENCY_EXECUTED_ONCE:
2772 if (dump_file && (dump_flags & TDF_DETAILS))
2773 fprintf (dump_file, " Called by %s that is executed once\n",
2774 cgraph_node_name (edge->caller));
2775 d->maybe_unlikely_executed = false;
2776 if (inline_edge_summary (edge)->loop_depth)
2778 d->maybe_executed_once = false;
2779 if (dump_file && (dump_flags & TDF_DETAILS))
2780 fprintf (dump_file, " Called in loop\n");
2783 case NODE_FREQUENCY_HOT:
2784 case NODE_FREQUENCY_NORMAL:
2785 if (dump_file && (dump_flags & TDF_DETAILS))
2786 fprintf (dump_file, " Called by %s that is normal or hot\n",
2787 cgraph_node_name (edge->caller));
2788 d->maybe_unlikely_executed = false;
2789 d->maybe_executed_once = false;
2793 return edge != NULL;
2796 /* See if the frequency of NODE can be updated based on frequencies of its
2799 cgraph_propagate_frequency (struct cgraph_node *node)
2801 struct cgraph_propagate_frequency_data d = {true, true, true, true};
2802 bool changed = false;
2804 if (!node->local.local)
2806 gcc_assert (node->analyzed);
2807 if (dump_file && (dump_flags & TDF_DETAILS))
2808 fprintf (dump_file, "Processing frequency %s\n", cgraph_node_name (node));
2810 cgraph_for_node_and_aliases (node, cgraph_propagate_frequency_1, &d, true);
2812 if ((d.only_called_at_startup && !d.only_called_at_exit)
2813 && !node->only_called_at_startup)
2815 node->only_called_at_startup = true;
2817 fprintf (dump_file, "Node %s promoted to only called at startup.\n",
2818 cgraph_node_name (node));
2821 if ((d.only_called_at_exit && !d.only_called_at_startup)
2822 && !node->only_called_at_exit)
2824 node->only_called_at_exit = true;
2826 fprintf (dump_file, "Node %s promoted to only called at exit.\n",
2827 cgraph_node_name (node));
2830 /* These come either from profile or user hints; never update them. */
2831 if (node->frequency == NODE_FREQUENCY_HOT
2832 || node->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)
2834 if (d.maybe_unlikely_executed)
2836 node->frequency = NODE_FREQUENCY_UNLIKELY_EXECUTED;
2838 fprintf (dump_file, "Node %s promoted to unlikely executed.\n",
2839 cgraph_node_name (node));
2842 else if (d.maybe_executed_once && node->frequency != NODE_FREQUENCY_EXECUTED_ONCE)
2844 node->frequency = NODE_FREQUENCY_EXECUTED_ONCE;
2846 fprintf (dump_file, "Node %s promoted to executed once.\n",
2847 cgraph_node_name (node));
2853 /* Return true when NODE can not return or throw and thus
2854 it is safe to ignore its side effects for IPA analysis. */
2857 cgraph_node_cannot_return (struct cgraph_node *node)
2859 int flags = flags_from_decl_or_type (node->decl);
2860 if (!flag_exceptions)
2861 return (flags & ECF_NORETURN) != 0;
2863 return ((flags & (ECF_NORETURN | ECF_NOTHROW))
2864 == (ECF_NORETURN | ECF_NOTHROW));
2867 /* Return true when call of E can not lead to return from caller
2868 and thus it is safe to ignore its side effects for IPA analysis
2869 when computing side effects of the caller.
2870 FIXME: We could actually mark all edges that have no reaching
2871 patch to EXIT_BLOCK_PTR or throw to get better results. */
2873 cgraph_edge_cannot_lead_to_return (struct cgraph_edge *e)
2875 if (cgraph_node_cannot_return (e->caller))
2877 if (e->indirect_unknown_callee)
2879 int flags = e->indirect_info->ecf_flags;
2880 if (!flag_exceptions)
2881 return (flags & ECF_NORETURN) != 0;
2883 return ((flags & (ECF_NORETURN | ECF_NOTHROW))
2884 == (ECF_NORETURN | ECF_NOTHROW));
2887 return cgraph_node_cannot_return (e->callee);
2890 /* Return true when function NODE can be removed from callgraph
2891 if all direct calls are eliminated. */
2894 cgraph_can_remove_if_no_direct_calls_and_refs_p (struct cgraph_node *node)
2896 gcc_assert (!node->global.inlined_to);
2897 /* Extern inlines can always go, we will use the external definition. */
2898 if (DECL_EXTERNAL (node->decl))
2900 /* When function is needed, we can not remove it. */
2901 if (node->needed || node->reachable_from_other_partition)
2903 if (DECL_STATIC_CONSTRUCTOR (node->decl)
2904 || DECL_STATIC_DESTRUCTOR (node->decl))
2906 /* Only COMDAT functions can be removed if externally visible. */
2907 if (node->local.externally_visible
2908 && (!DECL_COMDAT (node->decl)
2909 || cgraph_used_from_object_file_p (node)))
2914 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2917 nonremovable_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
2919 return !cgraph_can_remove_if_no_direct_calls_and_refs_p (node);
2922 /* Return true when function NODE and its aliases can be removed from callgraph
2923 if all direct calls are eliminated. */
2926 cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node)
2928 /* Extern inlines can always go, we will use the external definition. */
2929 if (DECL_EXTERNAL (node->decl))
2931 if (node->address_taken)
2933 return !cgraph_for_node_and_aliases (node, nonremovable_p, NULL, true);
2936 /* Worker for cgraph_can_remove_if_no_direct_calls_p. */
2939 used_from_object_file_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
2941 return cgraph_used_from_object_file_p (node);
2944 /* Return true when function NODE can be expected to be removed
2945 from program when direct calls in this compilation unit are removed.
2947 As a special case COMDAT functions are
2948 cgraph_can_remove_if_no_direct_calls_p while the are not
2949 cgraph_only_called_directly_p (it is possible they are called from other
2952 This function behaves as cgraph_only_called_directly_p because eliminating
2953 all uses of COMDAT function does not make it necessarily disappear from
2954 the program unless we are compiling whole program or we do LTO. In this
2955 case we know we win since dynamic linking will not really discard the
2956 linkonce section. */
2959 cgraph_will_be_removed_from_program_if_no_direct_calls (struct cgraph_node *node)
2961 gcc_assert (!node->global.inlined_to);
2962 if (cgraph_for_node_and_aliases (node, used_from_object_file_p, NULL, true))
2964 if (!in_lto_p && !flag_whole_program)
2965 return cgraph_only_called_directly_p (node);
2968 if (DECL_EXTERNAL (node->decl))
2970 return cgraph_can_remove_if_no_direct_calls_p (node);
2974 /* Return true when RESOLUTION indicate that linker will use
2975 the symbol from non-LTO object files. */
2978 resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution resolution)
2980 return (resolution == LDPR_PREVAILING_DEF
2981 || resolution == LDPR_PREEMPTED_REG
2982 || resolution == LDPR_RESOLVED_EXEC
2983 || resolution == LDPR_RESOLVED_DYN);
2987 /* Return true when NODE is known to be used from other (non-LTO) object file.
2988 Known only when doing LTO via linker plugin. */
2991 cgraph_used_from_object_file_p (struct cgraph_node *node)
2993 gcc_assert (!node->global.inlined_to);
2994 if (!TREE_PUBLIC (node->decl) || DECL_EXTERNAL (node->decl))
2996 if (resolution_used_from_other_file_p (node->resolution))
3001 /* Worker for cgraph_only_called_directly_p. */
3004 cgraph_not_only_called_directly_p_1 (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
3006 return !cgraph_only_called_directly_or_aliased_p (node);
3009 /* Return true when function NODE and all its aliases are only called
3011 i.e. it is not externally visible, address was not taken and
3012 it is not used in any other non-standard way. */
3015 cgraph_only_called_directly_p (struct cgraph_node *node)
3017 gcc_assert (cgraph_function_or_thunk_node (node, NULL) == node);
3018 return !cgraph_for_node_and_aliases (node, cgraph_not_only_called_directly_p_1,
3023 /* Collect all callers of NODE. Worker for collect_callers_of_node. */
3026 collect_callers_of_node_1 (struct cgraph_node *node, void *data)
3028 VEC (cgraph_edge_p, heap) ** redirect_callers = (VEC (cgraph_edge_p, heap) **)data;
3029 struct cgraph_edge *cs;
3030 enum availability avail;
3031 cgraph_function_or_thunk_node (node, &avail);
3033 if (avail > AVAIL_OVERWRITABLE)
3034 for (cs = node->callers; cs != NULL; cs = cs->next_caller)
3035 if (!cs->indirect_inlining_edge)
3036 VEC_safe_push (cgraph_edge_p, heap, *redirect_callers, cs);
3040 /* Collect all callers of NODE and its aliases that are known to lead to NODE
3041 (i.e. are not overwritable). */
3043 VEC (cgraph_edge_p, heap) *
3044 collect_callers_of_node (struct cgraph_node *node)
3046 VEC (cgraph_edge_p, heap) * redirect_callers = NULL;
3047 cgraph_for_node_and_aliases (node, collect_callers_of_node_1,
3048 &redirect_callers, false);
3049 return redirect_callers;
3052 #include "gt-cgraph.h"