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 indirect calls or calls
38 from other compilation unit. Flag NEEDED is set for each node that may
39 be accessed in such an invisible way and it shall be considered an
40 entry point to the callgraph.
42 Interprocedural information:
44 Callgraph is place to store data needed for interprocedural optimization.
45 All data structures are divided into three components: local_info that
46 is produced while analyzing the function, global_info that is result
47 of global walking of the callgraph on the end of compilation and
48 rtl_info used by RTL backend to propagate data from already compiled
49 functions to their callers.
53 The function inlining information is decided in advance and maintained
54 in the callgraph as so called inline plan.
55 For each inlined call, the callee's node is cloned to represent the
56 new function copy produced by inliner.
57 Each inlined call gets a unique corresponding clone node of the callee
58 and the data structure is updated while inlining is performed, so
59 the clones are eliminated and their callee edges redirected to the
62 Each edge has "inline_failed" field. When the field is set to NULL,
63 the call will be inlined. When it is non-NULL it contains a reason
64 why inlining wasn't performed. */
68 #include "coretypes.h"
71 #include "tree-inline.h"
72 #include "langhooks.h"
79 #include "basic-block.h"
84 #include "tree-dump.h"
85 #include "tree-flow.h"
86 #include "value-prof.h"
88 #include "diagnostic.h"
90 static void cgraph_node_remove_callers (struct cgraph_node *node);
91 static inline void cgraph_edge_remove_caller (struct cgraph_edge *e);
92 static inline void cgraph_edge_remove_callee (struct cgraph_edge *e);
94 /* Hash table used to convert declarations into nodes. */
95 static GTY((param_is (struct cgraph_node))) htab_t cgraph_hash;
96 /* Hash table used to convert assembler names into nodes. */
97 static GTY((param_is (struct cgraph_node))) htab_t assembler_name_hash;
99 /* The linked list of cgraph nodes. */
100 struct cgraph_node *cgraph_nodes;
102 /* Queue of cgraph nodes scheduled to be lowered. */
103 struct cgraph_node *cgraph_nodes_queue;
105 /* Queue of cgraph nodes scheduled to be added into cgraph. This is a
106 secondary queue used during optimization to accommodate passes that
107 may generate new functions that need to be optimized and expanded. */
108 struct cgraph_node *cgraph_new_nodes;
110 /* Number of nodes in existence. */
113 /* Maximal uid used in cgraph nodes. */
116 /* Maximal uid used in cgraph edges. */
117 int cgraph_edge_max_uid;
119 /* Maximal pid used for profiling */
122 /* Set when whole unit has been analyzed so we can access global info. */
123 bool cgraph_global_info_ready = false;
125 /* What state callgraph is in right now. */
126 enum cgraph_state cgraph_state = CGRAPH_STATE_CONSTRUCTION;
128 /* Set when the cgraph is fully build and the basic flags are computed. */
129 bool cgraph_function_flags_ready = false;
131 /* Linked list of cgraph asm nodes. */
132 struct cgraph_asm_node *cgraph_asm_nodes;
134 /* Last node in cgraph_asm_nodes. */
135 static GTY(()) struct cgraph_asm_node *cgraph_asm_last_node;
137 /* The order index of the next cgraph node to be created. This is
138 used so that we can sort the cgraph nodes in order by when we saw
139 them, to support -fno-toplevel-reorder. */
142 /* List of hooks trigerred on cgraph_edge events. */
143 struct cgraph_edge_hook_list {
144 cgraph_edge_hook hook;
146 struct cgraph_edge_hook_list *next;
149 /* List of hooks trigerred on cgraph_node events. */
150 struct cgraph_node_hook_list {
151 cgraph_node_hook hook;
153 struct cgraph_node_hook_list *next;
156 /* List of hooks trigerred on events involving two cgraph_edges. */
157 struct cgraph_2edge_hook_list {
158 cgraph_2edge_hook hook;
160 struct cgraph_2edge_hook_list *next;
163 /* List of hooks trigerred on events involving two cgraph_nodes. */
164 struct cgraph_2node_hook_list {
165 cgraph_2node_hook hook;
167 struct cgraph_2node_hook_list *next;
170 /* List of hooks triggered when an edge is removed. */
171 struct cgraph_edge_hook_list *first_cgraph_edge_removal_hook;
172 /* List of hooks triggered when a node is removed. */
173 struct cgraph_node_hook_list *first_cgraph_node_removal_hook;
174 /* List of hooks triggered when an edge is duplicated. */
175 struct cgraph_2edge_hook_list *first_cgraph_edge_duplicated_hook;
176 /* List of hooks triggered when a node is duplicated. */
177 struct cgraph_2node_hook_list *first_cgraph_node_duplicated_hook;
178 /* List of hooks triggered when an function is inserted. */
179 struct cgraph_node_hook_list *first_cgraph_function_insertion_hook;
181 /* Head of a linked list of unused (freed) call graph nodes.
182 Do not GTY((delete)) this list so UIDs gets reliably recycled. */
183 static GTY(()) struct cgraph_node *free_nodes;
184 /* Head of a linked list of unused (freed) call graph edges.
185 Do not GTY((delete)) this list so UIDs gets reliably recycled. */
186 static GTY(()) struct cgraph_edge *free_edges;
188 /* Macros to access the next item in the list of free cgraph nodes and
190 #define NEXT_FREE_NODE(NODE) (NODE)->next
191 #define NEXT_FREE_EDGE(EDGE) (EDGE)->prev_caller
193 /* Register HOOK to be called with DATA on each removed edge. */
194 struct cgraph_edge_hook_list *
195 cgraph_add_edge_removal_hook (cgraph_edge_hook hook, void *data)
197 struct cgraph_edge_hook_list *entry;
198 struct cgraph_edge_hook_list **ptr = &first_cgraph_edge_removal_hook;
200 entry = (struct cgraph_edge_hook_list *) xmalloc (sizeof (*entry));
210 /* Remove ENTRY from the list of hooks called on removing edges. */
212 cgraph_remove_edge_removal_hook (struct cgraph_edge_hook_list *entry)
214 struct cgraph_edge_hook_list **ptr = &first_cgraph_edge_removal_hook;
216 while (*ptr != entry)
222 /* Call all edge removal hooks. */
224 cgraph_call_edge_removal_hooks (struct cgraph_edge *e)
226 struct cgraph_edge_hook_list *entry = first_cgraph_edge_removal_hook;
229 entry->hook (e, entry->data);
234 /* Register HOOK to be called with DATA on each removed node. */
235 struct cgraph_node_hook_list *
236 cgraph_add_node_removal_hook (cgraph_node_hook hook, void *data)
238 struct cgraph_node_hook_list *entry;
239 struct cgraph_node_hook_list **ptr = &first_cgraph_node_removal_hook;
241 entry = (struct cgraph_node_hook_list *) xmalloc (sizeof (*entry));
251 /* Remove ENTRY from the list of hooks called on removing nodes. */
253 cgraph_remove_node_removal_hook (struct cgraph_node_hook_list *entry)
255 struct cgraph_node_hook_list **ptr = &first_cgraph_node_removal_hook;
257 while (*ptr != entry)
263 /* Call all node removal hooks. */
265 cgraph_call_node_removal_hooks (struct cgraph_node *node)
267 struct cgraph_node_hook_list *entry = first_cgraph_node_removal_hook;
270 entry->hook (node, entry->data);
275 /* Register HOOK to be called with DATA on each removed node. */
276 struct cgraph_node_hook_list *
277 cgraph_add_function_insertion_hook (cgraph_node_hook hook, void *data)
279 struct cgraph_node_hook_list *entry;
280 struct cgraph_node_hook_list **ptr = &first_cgraph_function_insertion_hook;
282 entry = (struct cgraph_node_hook_list *) xmalloc (sizeof (*entry));
292 /* Remove ENTRY from the list of hooks called on removing nodes. */
294 cgraph_remove_function_insertion_hook (struct cgraph_node_hook_list *entry)
296 struct cgraph_node_hook_list **ptr = &first_cgraph_function_insertion_hook;
298 while (*ptr != entry)
304 /* Call all node removal hooks. */
306 cgraph_call_function_insertion_hooks (struct cgraph_node *node)
308 struct cgraph_node_hook_list *entry = first_cgraph_function_insertion_hook;
311 entry->hook (node, entry->data);
316 /* Register HOOK to be called with DATA on each duplicated edge. */
317 struct cgraph_2edge_hook_list *
318 cgraph_add_edge_duplication_hook (cgraph_2edge_hook hook, void *data)
320 struct cgraph_2edge_hook_list *entry;
321 struct cgraph_2edge_hook_list **ptr = &first_cgraph_edge_duplicated_hook;
323 entry = (struct cgraph_2edge_hook_list *) xmalloc (sizeof (*entry));
333 /* Remove ENTRY from the list of hooks called on duplicating edges. */
335 cgraph_remove_edge_duplication_hook (struct cgraph_2edge_hook_list *entry)
337 struct cgraph_2edge_hook_list **ptr = &first_cgraph_edge_duplicated_hook;
339 while (*ptr != entry)
345 /* Call all edge duplication hooks. */
347 cgraph_call_edge_duplication_hooks (struct cgraph_edge *cs1,
348 struct cgraph_edge *cs2)
350 struct cgraph_2edge_hook_list *entry = first_cgraph_edge_duplicated_hook;
353 entry->hook (cs1, cs2, entry->data);
358 /* Register HOOK to be called with DATA on each duplicated node. */
359 struct cgraph_2node_hook_list *
360 cgraph_add_node_duplication_hook (cgraph_2node_hook hook, void *data)
362 struct cgraph_2node_hook_list *entry;
363 struct cgraph_2node_hook_list **ptr = &first_cgraph_node_duplicated_hook;
365 entry = (struct cgraph_2node_hook_list *) xmalloc (sizeof (*entry));
375 /* Remove ENTRY from the list of hooks called on duplicating nodes. */
377 cgraph_remove_node_duplication_hook (struct cgraph_2node_hook_list *entry)
379 struct cgraph_2node_hook_list **ptr = &first_cgraph_node_duplicated_hook;
381 while (*ptr != entry)
387 /* Call all node duplication hooks. */
389 cgraph_call_node_duplication_hooks (struct cgraph_node *node1,
390 struct cgraph_node *node2)
392 struct cgraph_2node_hook_list *entry = first_cgraph_node_duplicated_hook;
395 entry->hook (node1, node2, entry->data);
400 /* Returns a hash code for P. */
403 hash_node (const void *p)
405 const struct cgraph_node *n = (const struct cgraph_node *) p;
406 return (hashval_t) DECL_UID (n->decl);
410 /* Returns nonzero if P1 and P2 are equal. */
413 eq_node (const void *p1, const void *p2)
415 const struct cgraph_node *n1 = (const struct cgraph_node *) p1;
416 const struct cgraph_node *n2 = (const struct cgraph_node *) p2;
417 return DECL_UID (n1->decl) == DECL_UID (n2->decl);
420 /* Allocate new callgraph node. */
422 static inline struct cgraph_node *
423 cgraph_allocate_node (void)
425 struct cgraph_node *node;
430 free_nodes = NEXT_FREE_NODE (node);
434 node = GGC_CNEW (struct cgraph_node);
435 node->uid = cgraph_max_uid++;
441 /* Allocate new callgraph node and insert it into basic data structures. */
443 static struct cgraph_node *
444 cgraph_create_node (void)
446 struct cgraph_node *node = cgraph_allocate_node ();
448 node->next = cgraph_nodes;
450 node->order = cgraph_order++;
452 cgraph_nodes->previous = node;
453 node->previous = NULL;
454 node->global.estimated_growth = INT_MIN;
460 /* Return cgraph node assigned to DECL. Create new one when needed. */
463 cgraph_node (tree decl)
465 struct cgraph_node key, *node, **slot;
467 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
470 cgraph_hash = htab_create_ggc (10, hash_node, eq_node, NULL);
474 slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key, INSERT);
479 if (node->same_body_alias)
480 node = node->same_body;
484 node = cgraph_create_node ();
487 if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
489 node->origin = cgraph_node (DECL_CONTEXT (decl));
490 node->next_nested = node->origin->nested;
491 node->origin->nested = node;
493 if (assembler_name_hash)
496 tree name = DECL_ASSEMBLER_NAME (decl);
498 aslot = htab_find_slot_with_hash (assembler_name_hash, name,
499 decl_assembler_name_hash (name),
501 /* We can have multiple declarations with same assembler name. For C++
502 it is __builtin_strlen and strlen, for instance. Do we need to
503 record them all? Original implementation marked just first one
504 so lets hope for the best. */
511 /* Mark ALIAS as an alias to DECL. */
513 static struct cgraph_node *
514 cgraph_same_body_alias_1 (tree alias, tree decl)
516 struct cgraph_node key, *alias_node, *decl_node, **slot;
518 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
519 gcc_assert (TREE_CODE (alias) == FUNCTION_DECL);
520 decl_node = cgraph_node (decl);
524 slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key, INSERT);
526 /* If the cgraph_node has been already created, fail. */
530 alias_node = cgraph_allocate_node ();
531 alias_node->decl = alias;
532 alias_node->same_body_alias = 1;
533 alias_node->same_body = decl_node;
534 alias_node->previous = NULL;
535 if (decl_node->same_body)
536 decl_node->same_body->previous = alias_node;
537 alias_node->next = decl_node->same_body;
538 alias_node->thunk.alias = decl;
539 decl_node->same_body = alias_node;
544 /* Attempt to mark ALIAS as an alias to DECL. Return TRUE if successful.
545 Same body aliases are output whenever the body of DECL is output,
546 and cgraph_node (ALIAS) transparently returns cgraph_node (DECL). */
549 cgraph_same_body_alias (tree alias, tree decl)
551 #ifndef ASM_OUTPUT_DEF
552 /* If aliases aren't supported by the assembler, fail. */
556 /*gcc_assert (!assembler_name_hash);*/
558 return cgraph_same_body_alias_1 (alias, decl) != NULL;
562 cgraph_add_thunk (tree alias, tree decl, bool this_adjusting,
563 HOST_WIDE_INT fixed_offset, HOST_WIDE_INT virtual_value,
567 struct cgraph_node *node = cgraph_get_node (alias);
571 gcc_assert (node->local.finalized);
572 gcc_assert (!node->same_body);
573 cgraph_remove_node (node);
576 node = cgraph_same_body_alias_1 (alias, decl);
578 #ifdef ENABLE_CHECKING
579 gcc_assert (!virtual_offset
580 || tree_int_cst_equal (virtual_offset, size_int (virtual_value)));
582 node->thunk.fixed_offset = fixed_offset;
583 node->thunk.this_adjusting = this_adjusting;
584 node->thunk.virtual_value = virtual_value;
585 node->thunk.virtual_offset_p = virtual_offset != NULL;
586 node->thunk.alias = real_alias;
587 node->thunk.thunk_p = true;
590 /* Returns the cgraph node assigned to DECL or NULL if no cgraph node
594 cgraph_get_node (tree decl)
596 struct cgraph_node key, *node = NULL, **slot;
598 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
605 slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key,
611 if (node->same_body_alias)
612 node = node->same_body;
617 /* Insert already constructed node into hashtable. */
620 cgraph_insert_node_to_hashtable (struct cgraph_node *node)
622 struct cgraph_node **slot;
624 slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, node, INSERT);
630 /* Returns a hash code for P. */
633 hash_node_by_assembler_name (const void *p)
635 const struct cgraph_node *n = (const struct cgraph_node *) p;
636 return (hashval_t) decl_assembler_name_hash (DECL_ASSEMBLER_NAME (n->decl));
639 /* Returns nonzero if P1 and P2 are equal. */
642 eq_assembler_name (const void *p1, const void *p2)
644 const struct cgraph_node *n1 = (const struct cgraph_node *) p1;
645 const_tree name = (const_tree)p2;
646 return (decl_assembler_name_equal (n1->decl, name));
649 /* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
650 Return NULL if there's no such node. */
653 cgraph_node_for_asm (tree asmname)
655 struct cgraph_node *node;
658 if (!assembler_name_hash)
660 assembler_name_hash =
661 htab_create_ggc (10, hash_node_by_assembler_name, eq_assembler_name,
663 for (node = cgraph_nodes; node; node = node->next)
664 if (!node->global.inlined_to)
666 tree name = DECL_ASSEMBLER_NAME (node->decl);
667 slot = htab_find_slot_with_hash (assembler_name_hash, name,
668 decl_assembler_name_hash (name),
670 /* We can have multiple declarations with same assembler name. For C++
671 it is __builtin_strlen and strlen, for instance. Do we need to
672 record them all? Original implementation marked just first one
673 so lets hope for the best. */
678 struct cgraph_node *alias;
680 for (alias = node->same_body; alias; alias = alias->next)
683 name = DECL_ASSEMBLER_NAME (alias->decl);
684 hash = decl_assembler_name_hash (name);
685 slot = htab_find_slot_with_hash (assembler_name_hash, name,
694 slot = htab_find_slot_with_hash (assembler_name_hash, asmname,
695 decl_assembler_name_hash (asmname),
700 node = (struct cgraph_node *) *slot;
701 if (node->same_body_alias)
702 node = node->same_body;
708 /* Returns a hash value for X (which really is a die_struct). */
711 edge_hash (const void *x)
713 return htab_hash_pointer (((const struct cgraph_edge *) x)->call_stmt);
716 /* Return nonzero if decl_id of die_struct X is the same as UID of decl *Y. */
719 edge_eq (const void *x, const void *y)
721 return ((const struct cgraph_edge *) x)->call_stmt == y;
725 /* Return the callgraph edge representing the GIMPLE_CALL statement
729 cgraph_edge (struct cgraph_node *node, gimple call_stmt)
731 struct cgraph_edge *e, *e2;
734 if (node->call_site_hash)
735 return (struct cgraph_edge *)
736 htab_find_with_hash (node->call_site_hash, call_stmt,
737 htab_hash_pointer (call_stmt));
739 /* This loop may turn out to be performance problem. In such case adding
740 hashtables into call nodes with very many edges is probably best
741 solution. It is not good idea to add pointer into CALL_EXPR itself
742 because we want to make possible having multiple cgraph nodes representing
743 different clones of the same body before the body is actually cloned. */
744 for (e = node->callees; e; e= e->next_callee)
746 if (e->call_stmt == call_stmt)
753 node->call_site_hash = htab_create_ggc (120, edge_hash, edge_eq, NULL);
754 for (e2 = node->callees; e2; e2 = e2->next_callee)
757 slot = htab_find_slot_with_hash (node->call_site_hash,
759 htab_hash_pointer (e2->call_stmt),
770 /* Change field call_stmt of edge E to NEW_STMT. */
773 cgraph_set_call_stmt (struct cgraph_edge *e, gimple new_stmt)
775 if (e->caller->call_site_hash)
777 htab_remove_elt_with_hash (e->caller->call_site_hash,
779 htab_hash_pointer (e->call_stmt));
781 e->call_stmt = new_stmt;
782 push_cfun (DECL_STRUCT_FUNCTION (e->caller->decl));
783 e->can_throw_external = stmt_can_throw_external (new_stmt);
785 if (e->caller->call_site_hash)
788 slot = htab_find_slot_with_hash (e->caller->call_site_hash,
791 (e->call_stmt), INSERT);
797 /* Like cgraph_set_call_stmt but walk the clone tree and update all
798 clones sharing the same function body. */
801 cgraph_set_call_stmt_including_clones (struct cgraph_node *orig,
802 gimple old_stmt, gimple new_stmt)
804 struct cgraph_node *node;
805 struct cgraph_edge *edge = cgraph_edge (orig, old_stmt);
808 cgraph_set_call_stmt (edge, new_stmt);
814 struct cgraph_edge *edge = cgraph_edge (node, old_stmt);
816 cgraph_set_call_stmt (edge, new_stmt);
819 else if (node->next_sibling_clone)
820 node = node->next_sibling_clone;
823 while (node != orig && !node->next_sibling_clone)
824 node = node->clone_of;
826 node = node->next_sibling_clone;
831 /* Like cgraph_create_edge walk the clone tree and update all clones sharing
832 same function body. If clones already have edge for OLD_STMT; only
833 update the edge same way as cgraph_set_call_stmt_including_clones does.
835 TODO: COUNT and LOOP_DEPTH should be properly distributed based on relative
836 frequencies of the clones. */
839 cgraph_create_edge_including_clones (struct cgraph_node *orig,
840 struct cgraph_node *callee,
842 gimple stmt, gcov_type count,
843 int freq, int loop_depth,
844 cgraph_inline_failed_t reason)
846 struct cgraph_node *node;
847 struct cgraph_edge *edge;
849 if (!cgraph_edge (orig, stmt))
851 edge = cgraph_create_edge (orig, callee, stmt, count, freq, loop_depth);
852 edge->inline_failed = reason;
859 struct cgraph_edge *edge = cgraph_edge (node, old_stmt);
861 /* It is possible that clones already contain the edge while
862 master didn't. Either we promoted indirect call into direct
863 call in the clone or we are processing clones of unreachable
864 master where edges has been rmeoved. */
866 cgraph_set_call_stmt (edge, stmt);
867 else if (!cgraph_edge (node, stmt))
869 edge = cgraph_create_edge (node, callee, stmt, count,
871 edge->inline_failed = reason;
876 else if (node->next_sibling_clone)
877 node = node->next_sibling_clone;
880 while (node != orig && !node->next_sibling_clone)
881 node = node->clone_of;
883 node = node->next_sibling_clone;
888 /* Give initial reasons why inlining would fail on EDGE. This gets either
889 nullified or usually overwritten by more precise reasons later. */
892 initialize_inline_failed (struct cgraph_edge *e)
894 struct cgraph_node *callee = e->callee;
896 if (!callee->analyzed)
897 e->inline_failed = CIF_BODY_NOT_AVAILABLE;
898 else if (callee->local.redefined_extern_inline)
899 e->inline_failed = CIF_REDEFINED_EXTERN_INLINE;
900 else if (!callee->local.inlinable)
901 e->inline_failed = CIF_FUNCTION_NOT_INLINABLE;
902 else if (e->call_stmt && gimple_call_cannot_inline_p (e->call_stmt))
903 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
905 e->inline_failed = CIF_FUNCTION_NOT_CONSIDERED;
908 /* Create edge from CALLER to CALLEE in the cgraph. */
911 cgraph_create_edge (struct cgraph_node *caller, struct cgraph_node *callee,
912 gimple call_stmt, gcov_type count, int freq, int nest)
914 struct cgraph_edge *edge;
917 /* LTO does not actually have access to the call_stmt since these
918 have not been loaded yet. */
921 #ifdef ENABLE_CHECKING
922 /* This is rather pricely check possibly trigerring construction of
923 call stmt hashtable. */
924 gcc_assert (!cgraph_edge (caller, call_stmt));
927 gcc_assert (is_gimple_call (call_stmt));
933 free_edges = NEXT_FREE_EDGE (edge);
937 edge = GGC_NEW (struct cgraph_edge);
938 edge->uid = cgraph_edge_max_uid++;
943 edge->caller = caller;
944 edge->callee = callee;
945 edge->call_stmt = call_stmt;
946 push_cfun (DECL_STRUCT_FUNCTION (caller->decl));
947 edge->can_throw_external
948 = call_stmt ? stmt_can_throw_external (call_stmt) : false;
950 edge->prev_caller = NULL;
951 edge->next_caller = callee->callers;
953 callee->callers->prev_caller = edge;
954 edge->prev_callee = NULL;
955 edge->next_callee = caller->callees;
957 caller->callees->prev_callee = edge;
958 caller->callees = edge;
959 callee->callers = edge;
961 gcc_assert (count >= 0);
962 edge->frequency = freq;
963 gcc_assert (freq >= 0);
964 gcc_assert (freq <= CGRAPH_FREQ_MAX);
965 edge->loop_nest = nest;
966 edge->indirect_call = 0;
967 edge->call_stmt_cannot_inline_p =
968 (call_stmt ? gimple_call_cannot_inline_p (call_stmt) : false);
969 if (call_stmt && caller->call_site_hash)
972 slot = htab_find_slot_with_hash (caller->call_site_hash,
981 initialize_inline_failed (edge);
986 /* Remove the edge E from the list of the callers of the callee. */
989 cgraph_edge_remove_callee (struct cgraph_edge *e)
992 e->prev_caller->next_caller = e->next_caller;
994 e->next_caller->prev_caller = e->prev_caller;
996 e->callee->callers = e->next_caller;
999 /* Remove the edge E from the list of the callees of the caller. */
1002 cgraph_edge_remove_caller (struct cgraph_edge *e)
1005 e->prev_callee->next_callee = e->next_callee;
1007 e->next_callee->prev_callee = e->prev_callee;
1008 if (!e->prev_callee)
1009 e->caller->callees = e->next_callee;
1010 if (e->caller->call_site_hash)
1011 htab_remove_elt_with_hash (e->caller->call_site_hash,
1013 htab_hash_pointer (e->call_stmt));
1016 /* Put the edge onto the free list. */
1019 cgraph_free_edge (struct cgraph_edge *e)
1023 /* Clear out the edge so we do not dangle pointers. */
1024 memset (e, 0, sizeof (*e));
1026 NEXT_FREE_EDGE (e) = free_edges;
1030 /* Remove the edge E in the cgraph. */
1033 cgraph_remove_edge (struct cgraph_edge *e)
1035 /* Call all edge removal hooks. */
1036 cgraph_call_edge_removal_hooks (e);
1038 /* Remove from callers list of the callee. */
1039 cgraph_edge_remove_callee (e);
1041 /* Remove from callees list of the callers. */
1042 cgraph_edge_remove_caller (e);
1044 /* Put the edge onto the free list. */
1045 cgraph_free_edge (e);
1048 /* Redirect callee of E to N. The function does not update underlying
1052 cgraph_redirect_edge_callee (struct cgraph_edge *e, struct cgraph_node *n)
1054 /* Remove from callers list of the current callee. */
1055 cgraph_edge_remove_callee (e);
1057 /* Insert to callers list of the new callee. */
1058 e->prev_caller = NULL;
1060 n->callers->prev_caller = e;
1061 e->next_caller = n->callers;
1067 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1068 OLD_STMT changed into NEW_STMT. OLD_CALL is gimple_call_fndecl
1069 of OLD_STMT if it was previously call statement. */
1072 cgraph_update_edges_for_call_stmt_node (struct cgraph_node *node,
1073 gimple old_stmt, tree old_call, gimple new_stmt)
1075 tree new_call = (is_gimple_call (new_stmt)) ? gimple_call_fndecl (new_stmt) : 0;
1077 /* We are seeing indirect calls, then there is nothing to update. */
1078 if (!new_call && !old_call)
1080 /* See if we turned indirect call into direct call or folded call to one builtin
1081 into different bultin. */
1082 if (old_call != new_call)
1084 struct cgraph_edge *e = cgraph_edge (node, old_stmt);
1085 struct cgraph_edge *ne = NULL;
1092 /* See if the call is already there. It might be because of indirect
1093 inlining already found it. */
1094 if (new_call && e->callee->decl == new_call)
1097 /* Otherwise remove edge and create new one; we can't simply redirect
1098 since function has changed, so inline plan and other information
1099 attached to edge is invalid. */
1101 frequency = e->frequency;
1102 loop_nest = e->loop_nest;
1103 cgraph_remove_edge (e);
1107 /* We are seeing new direct call; compute profile info based on BB. */
1108 basic_block bb = gimple_bb (new_stmt);
1110 frequency = compute_call_stmt_bb_frequency (current_function_decl,
1112 loop_nest = bb->loop_depth;
1117 ne = cgraph_create_edge (node, cgraph_node (new_call),
1118 new_stmt, count, frequency,
1120 gcc_assert (ne->inline_failed);
1123 /* We only updated the call stmt; update pointer in cgraph edge.. */
1124 else if (old_stmt != new_stmt)
1125 cgraph_set_call_stmt (cgraph_edge (node, old_stmt), new_stmt);
1128 /* Update or remove the corresponding cgraph edge if a GIMPLE_CALL
1129 OLD_STMT changed into NEW_STMT. OLD_DECL is gimple_call_fndecl
1130 of OLD_STMT before it was updated (updating can happen inplace). */
1133 cgraph_update_edges_for_call_stmt (gimple old_stmt, tree old_decl, gimple new_stmt)
1135 struct cgraph_node *orig = cgraph_node (cfun->decl);
1136 struct cgraph_node *node;
1138 cgraph_update_edges_for_call_stmt_node (orig, old_stmt, old_decl, new_stmt);
1140 for (node = orig->clones; node != orig;)
1142 cgraph_update_edges_for_call_stmt_node (node, old_stmt, old_decl, new_stmt);
1144 node = node->clones;
1145 else if (node->next_sibling_clone)
1146 node = node->next_sibling_clone;
1149 while (node != orig && !node->next_sibling_clone)
1150 node = node->clone_of;
1152 node = node->next_sibling_clone;
1158 /* Remove all callees from the node. */
1161 cgraph_node_remove_callees (struct cgraph_node *node)
1163 struct cgraph_edge *e, *f;
1165 /* It is sufficient to remove the edges from the lists of callers of
1166 the callees. The callee list of the node can be zapped with one
1168 for (e = node->callees; e; e = f)
1171 cgraph_call_edge_removal_hooks (e);
1172 cgraph_edge_remove_callee (e);
1173 cgraph_free_edge (e);
1175 node->callees = NULL;
1176 if (node->call_site_hash)
1178 htab_delete (node->call_site_hash);
1179 node->call_site_hash = NULL;
1183 /* Remove all callers from the node. */
1186 cgraph_node_remove_callers (struct cgraph_node *node)
1188 struct cgraph_edge *e, *f;
1190 /* It is sufficient to remove the edges from the lists of callees of
1191 the callers. The caller list of the node can be zapped with one
1193 for (e = node->callers; e; e = f)
1196 cgraph_call_edge_removal_hooks (e);
1197 cgraph_edge_remove_caller (e);
1198 cgraph_free_edge (e);
1200 node->callers = NULL;
1203 /* Release memory used to represent body of function NODE. */
1206 cgraph_release_function_body (struct cgraph_node *node)
1208 if (DECL_STRUCT_FUNCTION (node->decl))
1210 tree old_decl = current_function_decl;
1211 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1212 if (cfun->gimple_df)
1214 current_function_decl = node->decl;
1216 delete_tree_cfg_annotations ();
1218 current_function_decl = old_decl;
1222 gcc_assert (dom_computed[0] == DOM_NONE);
1223 gcc_assert (dom_computed[1] == DOM_NONE);
1226 if (cfun->value_histograms)
1228 gcc_assert (!current_loops);
1230 gimple_set_body (node->decl, NULL);
1231 VEC_free (ipa_opt_pass, heap,
1232 node->ipa_transforms_to_apply);
1233 /* Struct function hangs a lot of data that would leak if we didn't
1234 removed all pointers to it. */
1235 ggc_free (DECL_STRUCT_FUNCTION (node->decl));
1236 DECL_STRUCT_FUNCTION (node->decl) = NULL;
1238 DECL_SAVED_TREE (node->decl) = NULL;
1239 /* If the node is abstract and needed, then do not clear DECL_INITIAL
1240 of its associated function function declaration because it's
1241 needed to emit debug info later. */
1242 if (!node->abstract_and_needed)
1243 DECL_INITIAL (node->decl) = error_mark_node;
1246 /* Remove same body alias node. */
1249 cgraph_remove_same_body_alias (struct cgraph_node *node)
1252 int uid = node->uid;
1254 gcc_assert (node->same_body_alias);
1256 node->previous->next = node->next;
1258 node->same_body->same_body = node->next;
1260 node->next->previous = node->previous;
1262 node->previous = NULL;
1263 slot = htab_find_slot (cgraph_hash, node, NO_INSERT);
1265 htab_clear_slot (cgraph_hash, slot);
1266 if (assembler_name_hash)
1268 tree name = DECL_ASSEMBLER_NAME (node->decl);
1269 slot = htab_find_slot_with_hash (assembler_name_hash, name,
1270 decl_assembler_name_hash (name),
1272 if (slot && *slot == node)
1273 htab_clear_slot (assembler_name_hash, slot);
1276 /* Clear out the node to NULL all pointers and add the node to the free
1278 memset (node, 0, sizeof(*node));
1280 NEXT_FREE_NODE (node) = free_nodes;
1284 /* Remove the node from cgraph. */
1287 cgraph_remove_node (struct cgraph_node *node)
1290 bool kill_body = false;
1291 struct cgraph_node *n;
1292 int uid = node->uid;
1294 cgraph_call_node_removal_hooks (node);
1295 cgraph_node_remove_callers (node);
1296 cgraph_node_remove_callees (node);
1297 VEC_free (ipa_opt_pass, heap,
1298 node->ipa_transforms_to_apply);
1300 /* Incremental inlining access removed nodes stored in the postorder list.
1302 node->needed = node->reachable = false;
1303 for (n = node->nested; n; n = n->next_nested)
1305 node->nested = NULL;
1308 struct cgraph_node **node2 = &node->origin->nested;
1310 while (*node2 != node)
1311 node2 = &(*node2)->next_nested;
1312 *node2 = node->next_nested;
1315 node->previous->next = node->next;
1317 cgraph_nodes = node->next;
1319 node->next->previous = node->previous;
1321 node->previous = NULL;
1322 slot = htab_find_slot (cgraph_hash, node, NO_INSERT);
1325 struct cgraph_node *next_inline_clone;
1327 for (next_inline_clone = node->clones;
1328 next_inline_clone && next_inline_clone->decl != node->decl;
1329 next_inline_clone = next_inline_clone->next_sibling_clone)
1332 /* If there is inline clone of the node being removed, we need
1333 to put it into the position of removed node and reorganize all
1334 other clones to be based on it. */
1335 if (next_inline_clone)
1337 struct cgraph_node *n;
1338 struct cgraph_node *new_clones;
1340 *slot = next_inline_clone;
1342 /* Unlink inline clone from the list of clones of removed node. */
1343 if (next_inline_clone->next_sibling_clone)
1344 next_inline_clone->next_sibling_clone->prev_sibling_clone
1345 = next_inline_clone->prev_sibling_clone;
1346 if (next_inline_clone->prev_sibling_clone)
1348 gcc_assert (node->clones != next_inline_clone);
1349 next_inline_clone->prev_sibling_clone->next_sibling_clone
1350 = next_inline_clone->next_sibling_clone;
1354 gcc_assert (node->clones == next_inline_clone);
1355 node->clones = next_inline_clone->next_sibling_clone;
1358 new_clones = node->clones;
1359 node->clones = NULL;
1361 /* Copy clone info. */
1362 next_inline_clone->clone = node->clone;
1364 /* Now place it into clone tree at same level at NODE. */
1365 next_inline_clone->clone_of = node->clone_of;
1366 next_inline_clone->prev_sibling_clone = NULL;
1367 next_inline_clone->next_sibling_clone = NULL;
1370 if (node->clone_of->clones)
1371 node->clone_of->clones->prev_sibling_clone = next_inline_clone;
1372 next_inline_clone->next_sibling_clone = node->clone_of->clones;
1373 node->clone_of->clones = next_inline_clone;
1376 /* Merge the clone list. */
1379 if (!next_inline_clone->clones)
1380 next_inline_clone->clones = new_clones;
1383 n = next_inline_clone->clones;
1384 while (n->next_sibling_clone)
1385 n = n->next_sibling_clone;
1386 n->next_sibling_clone = new_clones;
1387 new_clones->prev_sibling_clone = n;
1391 /* Update clone_of pointers. */
1395 n->clone_of = next_inline_clone;
1396 n = n->next_sibling_clone;
1401 htab_clear_slot (cgraph_hash, slot);
1406 if (node->prev_sibling_clone)
1407 node->prev_sibling_clone->next_sibling_clone = node->next_sibling_clone;
1408 else if (node->clone_of)
1409 node->clone_of->clones = node->next_sibling_clone;
1410 if (node->next_sibling_clone)
1411 node->next_sibling_clone->prev_sibling_clone = node->prev_sibling_clone;
1414 struct cgraph_node *n, *next;
1418 for (n = node->clones; n->next_sibling_clone; n = n->next_sibling_clone)
1419 n->clone_of = node->clone_of;
1420 n->clone_of = node->clone_of;
1421 n->next_sibling_clone = node->clone_of->clones;
1422 if (node->clone_of->clones)
1423 node->clone_of->clones->prev_sibling_clone = n;
1424 node->clone_of->clones = node->clones;
1428 /* We are removing node with clones. this makes clones inconsistent,
1429 but assume they will be removed subsequently and just keep clone
1430 tree intact. This can happen in unreachable function removal since
1431 we remove unreachable functions in random order, not by bottom-up
1432 walk of clone trees. */
1433 for (n = node->clones; n; n = next)
1435 next = n->next_sibling_clone;
1436 n->next_sibling_clone = NULL;
1437 n->prev_sibling_clone = NULL;
1443 while (node->same_body)
1444 cgraph_remove_same_body_alias (node->same_body);
1446 if (node->same_comdat_group)
1448 struct cgraph_node *prev;
1449 for (prev = node->same_comdat_group;
1450 prev->same_comdat_group != node;
1451 prev = prev->same_comdat_group)
1453 if (node->same_comdat_group == prev)
1454 prev->same_comdat_group = NULL;
1456 prev->same_comdat_group = node->same_comdat_group;
1457 node->same_comdat_group = NULL;
1460 /* While all the clones are removed after being proceeded, the function
1461 itself is kept in the cgraph even after it is compiled. Check whether
1462 we are done with this body and reclaim it proactively if this is the case.
1464 if (!kill_body && *slot)
1466 struct cgraph_node *n = (struct cgraph_node *) *slot;
1467 if (!n->clones && !n->clone_of && !n->global.inlined_to
1468 && (cgraph_global_info_ready
1469 && (TREE_ASM_WRITTEN (n->decl) || DECL_EXTERNAL (n->decl))))
1472 if (assembler_name_hash)
1474 tree name = DECL_ASSEMBLER_NAME (node->decl);
1475 slot = htab_find_slot_with_hash (assembler_name_hash, name,
1476 decl_assembler_name_hash (name),
1478 /* Inline clones are not hashed. */
1479 if (slot && *slot == node)
1480 htab_clear_slot (assembler_name_hash, slot);
1484 cgraph_release_function_body (node);
1486 if (node->call_site_hash)
1488 htab_delete (node->call_site_hash);
1489 node->call_site_hash = NULL;
1493 /* Clear out the node to NULL all pointers and add the node to the free
1495 memset (node, 0, sizeof(*node));
1497 NEXT_FREE_NODE (node) = free_nodes;
1501 /* Remove the node from cgraph. */
1504 cgraph_remove_node_and_inline_clones (struct cgraph_node *node)
1506 struct cgraph_edge *e, *next;
1507 for (e = node->callees; e; e = next)
1509 next = e->next_callee;
1510 if (!e->inline_failed)
1511 cgraph_remove_node_and_inline_clones (e->callee);
1513 cgraph_remove_node (node);
1516 /* Notify finalize_compilation_unit that given node is reachable. */
1519 cgraph_mark_reachable_node (struct cgraph_node *node)
1521 if (!node->reachable && node->local.finalized)
1523 notice_global_symbol (node->decl);
1524 node->reachable = 1;
1525 gcc_assert (!cgraph_global_info_ready);
1527 node->next_needed = cgraph_nodes_queue;
1528 cgraph_nodes_queue = node;
1532 /* Likewise indicate that a node is needed, i.e. reachable via some
1536 cgraph_mark_needed_node (struct cgraph_node *node)
1539 gcc_assert (!node->global.inlined_to);
1540 cgraph_mark_reachable_node (node);
1543 /* Likewise indicate that a node is having address taken. */
1546 cgraph_mark_address_taken_node (struct cgraph_node *node)
1548 node->address_taken = 1;
1549 cgraph_mark_needed_node (node);
1552 /* Return local info for the compiled function. */
1554 struct cgraph_local_info *
1555 cgraph_local_info (tree decl)
1557 struct cgraph_node *node;
1559 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
1560 node = cgraph_node (decl);
1561 return &node->local;
1564 /* Return local info for the compiled function. */
1566 struct cgraph_global_info *
1567 cgraph_global_info (tree decl)
1569 struct cgraph_node *node;
1571 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL && cgraph_global_info_ready);
1572 node = cgraph_node (decl);
1573 return &node->global;
1576 /* Return local info for the compiled function. */
1578 struct cgraph_rtl_info *
1579 cgraph_rtl_info (tree decl)
1581 struct cgraph_node *node;
1583 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
1584 node = cgraph_node (decl);
1585 if (decl != current_function_decl
1586 && !TREE_ASM_WRITTEN (node->decl))
1591 /* Return a string describing the failure REASON. */
1594 cgraph_inline_failed_string (cgraph_inline_failed_t reason)
1597 #define DEFCIFCODE(code, string) string,
1599 static const char *cif_string_table[CIF_N_REASONS] = {
1600 #include "cif-code.def"
1603 /* Signedness of an enum type is implementation defined, so cast it
1604 to unsigned before testing. */
1605 gcc_assert ((unsigned) reason < CIF_N_REASONS);
1606 return cif_string_table[reason];
1609 /* Return name of the node used in debug output. */
1611 cgraph_node_name (struct cgraph_node *node)
1613 return lang_hooks.decl_printable_name (node->decl, 2);
1616 /* Names used to print out the availability enum. */
1617 const char * const cgraph_availability_names[] =
1618 {"unset", "not_available", "overwritable", "available", "local"};
1621 /* Dump call graph node NODE to file F. */
1624 dump_cgraph_node (FILE *f, struct cgraph_node *node)
1626 struct cgraph_edge *edge;
1627 fprintf (f, "%s/%i(%i)", cgraph_node_name (node), node->uid,
1629 dump_addr (f, " @", (void *)node);
1630 if (node->global.inlined_to)
1631 fprintf (f, " (inline copy in %s/%i)",
1632 cgraph_node_name (node->global.inlined_to),
1633 node->global.inlined_to->uid);
1635 fprintf (f, " (clone of %s/%i)",
1636 cgraph_node_name (node->clone_of),
1637 node->clone_of->uid);
1638 if (cgraph_function_flags_ready)
1639 fprintf (f, " availability:%s",
1640 cgraph_availability_names [cgraph_function_body_availability (node)]);
1642 fprintf (f, " executed "HOST_WIDEST_INT_PRINT_DEC"x",
1643 (HOST_WIDEST_INT)node->count);
1644 if (node->local.inline_summary.self_time)
1645 fprintf (f, " %i time, %i benefit", node->local.inline_summary.self_time,
1646 node->local.inline_summary.time_inlining_benefit);
1647 if (node->global.time && node->global.time
1648 != node->local.inline_summary.self_time)
1649 fprintf (f, " (%i after inlining)", node->global.time);
1650 if (node->local.inline_summary.self_size)
1651 fprintf (f, " %i size, %i benefit", node->local.inline_summary.self_size,
1652 node->local.inline_summary.size_inlining_benefit);
1653 if (node->global.size && node->global.size
1654 != node->local.inline_summary.self_size)
1655 fprintf (f, " (%i after inlining)", node->global.size);
1656 if (node->local.inline_summary.estimated_self_stack_size)
1657 fprintf (f, " %i bytes stack usage", (int)node->local.inline_summary.estimated_self_stack_size);
1658 if (node->global.estimated_stack_size != node->local.inline_summary.estimated_self_stack_size)
1659 fprintf (f, " %i bytes after inlining", (int)node->global.estimated_stack_size);
1661 fprintf (f, " nested in: %s", cgraph_node_name (node->origin));
1663 fprintf (f, " needed");
1664 if (node->address_taken)
1665 fprintf (f, " address_taken");
1666 else if (node->reachable)
1667 fprintf (f, " reachable");
1668 if (gimple_has_body_p (node->decl))
1669 fprintf (f, " body");
1671 fprintf (f, " process");
1672 if (node->local.local)
1673 fprintf (f, " local");
1674 if (node->local.externally_visible)
1675 fprintf (f, " externally_visible");
1676 if (node->local.finalized)
1677 fprintf (f, " finalized");
1678 if (node->local.disregard_inline_limits)
1679 fprintf (f, " always_inline");
1680 else if (node->local.inlinable)
1681 fprintf (f, " inlinable");
1682 if (node->local.redefined_extern_inline)
1683 fprintf (f, " redefined_extern_inline");
1684 if (TREE_ASM_WRITTEN (node->decl))
1685 fprintf (f, " asm_written");
1687 fprintf (f, "\n called by: ");
1688 for (edge = node->callers; edge; edge = edge->next_caller)
1690 fprintf (f, "%s/%i ", cgraph_node_name (edge->caller),
1693 fprintf (f, "("HOST_WIDEST_INT_PRINT_DEC"x) ",
1694 (HOST_WIDEST_INT)edge->count);
1695 if (edge->frequency)
1696 fprintf (f, "(%.2f per call) ",
1697 edge->frequency / (double)CGRAPH_FREQ_BASE);
1698 if (!edge->inline_failed)
1699 fprintf(f, "(inlined) ");
1700 if (edge->indirect_call)
1701 fprintf(f, "(indirect) ");
1702 if (edge->can_throw_external)
1703 fprintf(f, "(can throw external) ");
1706 fprintf (f, "\n calls: ");
1707 for (edge = node->callees; edge; edge = edge->next_callee)
1709 fprintf (f, "%s/%i ", cgraph_node_name (edge->callee),
1711 if (!edge->inline_failed)
1712 fprintf(f, "(inlined) ");
1713 if (edge->indirect_call)
1714 fprintf(f, "(indirect) ");
1716 fprintf (f, "("HOST_WIDEST_INT_PRINT_DEC"x) ",
1717 (HOST_WIDEST_INT)edge->count);
1718 if (edge->frequency)
1719 fprintf (f, "(%.2f per call) ",
1720 edge->frequency / (double)CGRAPH_FREQ_BASE);
1721 if (edge->loop_nest)
1722 fprintf (f, "(nested in %i loops) ", edge->loop_nest);
1723 if (edge->can_throw_external)
1724 fprintf(f, "(can throw external) ");
1728 if (node->same_body)
1730 struct cgraph_node *n;
1731 fprintf (f, " aliases & thunks:");
1732 for (n = node->same_body; n; n = n->next)
1734 fprintf (f, " %s/%i", cgraph_node_name (n), n->uid);
1735 if (n->thunk.thunk_p)
1737 fprintf (f, " (thunk of %s fixed ofset %i virtual value %i has "
1738 "virtual offset %i",
1739 lang_hooks.decl_printable_name (n->thunk.alias, 2),
1740 (int)n->thunk.fixed_offset,
1741 (int)n->thunk.virtual_value,
1742 (int)n->thunk.virtual_offset_p);
1751 /* Dump call graph node NODE to stderr. */
1754 debug_cgraph_node (struct cgraph_node *node)
1756 dump_cgraph_node (stderr, node);
1760 /* Dump the callgraph to file F. */
1763 dump_cgraph (FILE *f)
1765 struct cgraph_node *node;
1767 fprintf (f, "callgraph:\n\n");
1768 for (node = cgraph_nodes; node; node = node->next)
1769 dump_cgraph_node (f, node);
1773 /* Dump the call graph to stderr. */
1778 dump_cgraph (stderr);
1782 /* Set the DECL_ASSEMBLER_NAME and update cgraph hashtables. */
1785 change_decl_assembler_name (tree decl, tree name)
1787 gcc_assert (!assembler_name_hash);
1788 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
1790 SET_DECL_ASSEMBLER_NAME (decl, name);
1793 if (name == DECL_ASSEMBLER_NAME (decl))
1796 if (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))
1797 && DECL_RTL_SET_P (decl))
1798 warning (0, "%D renamed after being referenced in assembly", decl);
1800 SET_DECL_ASSEMBLER_NAME (decl, name);
1803 /* Add a top-level asm statement to the list. */
1805 struct cgraph_asm_node *
1806 cgraph_add_asm_node (tree asm_str)
1808 struct cgraph_asm_node *node;
1810 node = GGC_CNEW (struct cgraph_asm_node);
1811 node->asm_str = asm_str;
1812 node->order = cgraph_order++;
1814 if (cgraph_asm_nodes == NULL)
1815 cgraph_asm_nodes = node;
1817 cgraph_asm_last_node->next = node;
1818 cgraph_asm_last_node = node;
1822 /* Return true when the DECL can possibly be inlined. */
1824 cgraph_function_possibly_inlined_p (tree decl)
1826 if (!cgraph_global_info_ready)
1827 return !DECL_UNINLINABLE (decl);
1828 return DECL_POSSIBLY_INLINED (decl);
1831 /* Create clone of E in the node N represented by CALL_EXPR the callgraph. */
1832 struct cgraph_edge *
1833 cgraph_clone_edge (struct cgraph_edge *e, struct cgraph_node *n,
1834 gimple call_stmt, unsigned stmt_uid, gcov_type count_scale,
1835 int freq_scale, int loop_nest, bool update_original)
1837 struct cgraph_edge *new_edge;
1838 gcov_type count = e->count * count_scale / REG_BR_PROB_BASE;
1841 /* We do not want to ignore loop nest after frequency drops to 0. */
1844 freq = e->frequency * (gcov_type) freq_scale / CGRAPH_FREQ_BASE;
1845 if (freq > CGRAPH_FREQ_MAX)
1846 freq = CGRAPH_FREQ_MAX;
1847 new_edge = cgraph_create_edge (n, e->callee, call_stmt, count, freq,
1848 e->loop_nest + loop_nest);
1850 new_edge->inline_failed = e->inline_failed;
1851 new_edge->indirect_call = e->indirect_call;
1852 new_edge->lto_stmt_uid = stmt_uid;
1853 if (update_original)
1855 e->count -= new_edge->count;
1859 cgraph_call_edge_duplication_hooks (e, new_edge);
1863 /* Create node representing clone of N executed COUNT times. Decrease
1864 the execution counts from original node too.
1866 When UPDATE_ORIGINAL is true, the counts are subtracted from the original
1867 function's profile to reflect the fact that part of execution is handled
1869 struct cgraph_node *
1870 cgraph_clone_node (struct cgraph_node *n, gcov_type count, int freq,
1871 int loop_nest, bool update_original,
1872 VEC(cgraph_edge_p,heap) *redirect_callers)
1874 struct cgraph_node *new_node = cgraph_create_node ();
1875 struct cgraph_edge *e;
1876 gcov_type count_scale;
1879 new_node->decl = n->decl;
1880 new_node->origin = n->origin;
1881 if (new_node->origin)
1883 new_node->next_nested = new_node->origin->nested;
1884 new_node->origin->nested = new_node;
1886 new_node->analyzed = n->analyzed;
1887 new_node->local = n->local;
1888 new_node->local.externally_visible = false;
1889 new_node->global = n->global;
1890 new_node->rtl = n->rtl;
1891 new_node->count = count;
1892 new_node->clone = n->clone;
1895 if (new_node->count > n->count)
1896 count_scale = REG_BR_PROB_BASE;
1898 count_scale = new_node->count * REG_BR_PROB_BASE / n->count;
1902 if (update_original)
1909 for (i = 0; VEC_iterate (cgraph_edge_p, redirect_callers, i, e); i++)
1911 /* Redirect calls to the old version node to point to its new
1913 cgraph_redirect_edge_callee (e, new_node);
1917 for (e = n->callees;e; e=e->next_callee)
1918 cgraph_clone_edge (e, new_node, e->call_stmt, e->lto_stmt_uid,
1919 count_scale, freq, loop_nest, update_original);
1921 new_node->next_sibling_clone = n->clones;
1923 n->clones->prev_sibling_clone = new_node;
1924 n->clones = new_node;
1925 new_node->clone_of = n;
1927 cgraph_call_node_duplication_hooks (n, new_node);
1931 /* Create a new name for omp child function. Returns an identifier. */
1933 static GTY(()) unsigned int clone_fn_id_num;
1936 clone_function_name (tree decl)
1938 tree name = DECL_ASSEMBLER_NAME (decl);
1939 size_t len = IDENTIFIER_LENGTH (name);
1940 char *tmp_name, *prefix;
1942 prefix = XALLOCAVEC (char, len + strlen ("_clone") + 1);
1943 memcpy (prefix, IDENTIFIER_POINTER (name), len);
1944 strcpy (prefix + len, "_clone");
1945 #ifndef NO_DOT_IN_LABEL
1947 #elif !defined NO_DOLLAR_IN_LABEL
1950 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix, clone_fn_id_num++);
1951 return get_identifier (tmp_name);
1954 /* Create callgraph node clone with new declaration. The actual body will
1955 be copied later at compilation stage.
1957 TODO: after merging in ipa-sra use function call notes instead of args_to_skip
1960 struct cgraph_node *
1961 cgraph_create_virtual_clone (struct cgraph_node *old_node,
1962 VEC(cgraph_edge_p,heap) *redirect_callers,
1963 VEC(ipa_replace_map_p,gc) *tree_map,
1964 bitmap args_to_skip)
1966 tree old_decl = old_node->decl;
1967 struct cgraph_node *new_node = NULL;
1969 struct cgraph_node key, **slot;
1971 gcc_assert (tree_versionable_function_p (old_decl));
1973 /* Make a new FUNCTION_DECL tree node */
1975 new_decl = copy_node (old_decl);
1977 new_decl = build_function_decl_skip_args (old_decl, args_to_skip);
1978 DECL_STRUCT_FUNCTION (new_decl) = NULL;
1980 /* Generate a new name for the new version. */
1981 DECL_NAME (new_decl) = clone_function_name (old_decl);
1982 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
1983 SET_DECL_RTL (new_decl, NULL);
1985 new_node = cgraph_clone_node (old_node, old_node->count,
1986 CGRAPH_FREQ_BASE, 0, false,
1988 new_node->decl = new_decl;
1989 /* Update the properties.
1990 Make clone visible only within this translation unit. Make sure
1991 that is not weak also.
1992 ??? We cannot use COMDAT linkage because there is no
1993 ABI support for this. */
1994 DECL_EXTERNAL (new_node->decl) = 0;
1995 DECL_COMDAT_GROUP (new_node->decl) = 0;
1996 TREE_PUBLIC (new_node->decl) = 0;
1997 DECL_COMDAT (new_node->decl) = 0;
1998 DECL_WEAK (new_node->decl) = 0;
1999 new_node->clone.tree_map = tree_map;
2000 new_node->clone.args_to_skip = args_to_skip;
2002 new_node->clone.combined_args_to_skip = old_node->clone.combined_args_to_skip;
2003 else if (old_node->clone.combined_args_to_skip)
2005 int newi = 0, oldi = 0;
2007 bitmap new_args_to_skip = BITMAP_GGC_ALLOC ();
2008 struct cgraph_node *orig_node;
2009 for (orig_node = old_node; orig_node->clone_of; orig_node = orig_node->clone_of)
2011 for (arg = DECL_ARGUMENTS (orig_node->decl); arg; arg = TREE_CHAIN (arg), oldi++)
2013 if (bitmap_bit_p (old_node->clone.combined_args_to_skip, oldi))
2015 bitmap_set_bit (new_args_to_skip, oldi);
2018 if (bitmap_bit_p (args_to_skip, newi))
2019 bitmap_set_bit (new_args_to_skip, oldi);
2022 new_node->clone.combined_args_to_skip = new_args_to_skip;
2025 new_node->clone.combined_args_to_skip = args_to_skip;
2026 new_node->local.externally_visible = 0;
2027 new_node->local.local = 1;
2028 new_node->lowered = true;
2029 new_node->reachable = true;
2031 key.decl = new_decl;
2032 slot = (struct cgraph_node **) htab_find_slot (cgraph_hash, &key, INSERT);
2033 gcc_assert (!*slot);
2035 if (assembler_name_hash)
2038 tree name = DECL_ASSEMBLER_NAME (new_decl);
2040 aslot = htab_find_slot_with_hash (assembler_name_hash, name,
2041 decl_assembler_name_hash (name),
2043 gcc_assert (!*aslot);
2050 /* NODE is no longer nested function; update cgraph accordingly. */
2052 cgraph_unnest_node (struct cgraph_node *node)
2054 struct cgraph_node **node2 = &node->origin->nested;
2055 gcc_assert (node->origin);
2057 while (*node2 != node)
2058 node2 = &(*node2)->next_nested;
2059 *node2 = node->next_nested;
2060 node->origin = NULL;
2063 /* Return function availability. See cgraph.h for description of individual
2066 cgraph_function_body_availability (struct cgraph_node *node)
2068 enum availability avail;
2069 gcc_assert (cgraph_function_flags_ready);
2070 if (!node->analyzed)
2071 avail = AVAIL_NOT_AVAILABLE;
2072 else if (node->local.local)
2073 avail = AVAIL_LOCAL;
2074 else if (!node->local.externally_visible)
2075 avail = AVAIL_AVAILABLE;
2076 /* Inline functions are safe to be analyzed even if their sybol can
2077 be overwritten at runtime. It is not meaningful to enfore any sane
2078 behaviour on replacing inline function by different body. */
2079 else if (DECL_DECLARED_INLINE_P (node->decl))
2080 avail = AVAIL_AVAILABLE;
2082 /* If the function can be overwritten, return OVERWRITABLE. Take
2083 care at least of two notable extensions - the COMDAT functions
2084 used to share template instantiations in C++ (this is symmetric
2085 to code cp_cannot_inline_tree_fn and probably shall be shared and
2086 the inlinability hooks completely eliminated).
2088 ??? Does the C++ one definition rule allow us to always return
2089 AVAIL_AVAILABLE here? That would be good reason to preserve this
2092 else if (DECL_REPLACEABLE_P (node->decl) && !DECL_EXTERNAL (node->decl))
2093 avail = AVAIL_OVERWRITABLE;
2094 else avail = AVAIL_AVAILABLE;
2099 /* Add the function FNDECL to the call graph.
2100 Unlike cgraph_finalize_function, this function is intended to be used
2101 by middle end and allows insertion of new function at arbitrary point
2102 of compilation. The function can be either in high, low or SSA form
2105 The function is assumed to be reachable and have address taken (so no
2106 API breaking optimizations are performed on it).
2108 Main work done by this function is to enqueue the function for later
2109 processing to avoid need the passes to be re-entrant. */
2112 cgraph_add_new_function (tree fndecl, bool lowered)
2114 struct cgraph_node *node;
2115 switch (cgraph_state)
2117 case CGRAPH_STATE_CONSTRUCTION:
2118 /* Just enqueue function to be processed at nearest occurrence. */
2119 node = cgraph_node (fndecl);
2120 node->next_needed = cgraph_new_nodes;
2122 node->lowered = true;
2123 cgraph_new_nodes = node;
2126 case CGRAPH_STATE_IPA:
2127 case CGRAPH_STATE_IPA_SSA:
2128 case CGRAPH_STATE_EXPANSION:
2129 /* Bring the function into finalized state and enqueue for later
2130 analyzing and compilation. */
2131 node = cgraph_node (fndecl);
2132 node->local.local = false;
2133 node->local.finalized = true;
2134 node->reachable = node->needed = true;
2135 if (!lowered && cgraph_state == CGRAPH_STATE_EXPANSION)
2137 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
2138 current_function_decl = fndecl;
2139 gimple_register_cfg_hooks ();
2140 tree_lowering_passes (fndecl);
2141 bitmap_obstack_initialize (NULL);
2142 if (!gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl)))
2143 execute_pass_list (pass_early_local_passes.pass.sub);
2144 bitmap_obstack_release (NULL);
2146 current_function_decl = NULL;
2151 node->lowered = true;
2152 node->next_needed = cgraph_new_nodes;
2153 cgraph_new_nodes = node;
2156 case CGRAPH_STATE_FINISHED:
2157 /* At the very end of compilation we have to do all the work up
2159 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
2160 current_function_decl = fndecl;
2161 gimple_register_cfg_hooks ();
2163 tree_lowering_passes (fndecl);
2164 bitmap_obstack_initialize (NULL);
2165 if (!gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl)))
2166 execute_pass_list (pass_early_local_passes.pass.sub);
2167 bitmap_obstack_release (NULL);
2168 tree_rest_of_compilation (fndecl);
2170 current_function_decl = NULL;
2174 /* Set a personality if required and we already passed EH lowering. */
2176 && (function_needs_eh_personality (DECL_STRUCT_FUNCTION (fndecl))
2177 == eh_personality_lang))
2178 DECL_FUNCTION_PERSONALITY (fndecl) = lang_hooks.eh_personality ();
2181 /* Return true if NODE can be made local for API change.
2182 Extern inline functions and C++ COMDAT functions can be made local
2183 at the expense of possible code size growth if function is used in multiple
2184 compilation units. */
2186 cgraph_node_can_be_local_p (struct cgraph_node *node)
2188 return (!node->needed
2189 && ((DECL_COMDAT (node->decl) && !node->same_comdat_group)
2190 || !node->local.externally_visible));
2193 /* Bring NODE local. */
2195 cgraph_make_node_local (struct cgraph_node *node)
2197 gcc_assert (cgraph_node_can_be_local_p (node));
2198 if (DECL_COMDAT (node->decl) || DECL_EXTERNAL (node->decl))
2200 struct cgraph_node *alias;
2201 DECL_COMDAT (node->decl) = 0;
2202 DECL_COMDAT_GROUP (node->decl) = 0;
2203 TREE_PUBLIC (node->decl) = 0;
2204 DECL_WEAK (node->decl) = 0;
2205 DECL_EXTERNAL (node->decl) = 0;
2206 for (alias = node->same_body; alias; alias = alias->next)
2208 DECL_COMDAT (alias->decl) = 0;
2209 DECL_COMDAT_GROUP (alias->decl) = 0;
2210 TREE_PUBLIC (alias->decl) = 0;
2211 DECL_WEAK (alias->decl) = 0;
2212 DECL_EXTERNAL (alias->decl) = 0;
2214 node->local.externally_visible = false;
2215 node->local.local = true;
2216 gcc_assert (cgraph_function_body_availability (node) == AVAIL_LOCAL);
2220 /* Set TREE_NOTHROW on NODE's decl and on same_body aliases of NODE
2221 if any to NOTHROW. */
2224 cgraph_set_nothrow_flag (struct cgraph_node *node, bool nothrow)
2226 struct cgraph_node *alias;
2227 TREE_NOTHROW (node->decl) = nothrow;
2228 for (alias = node->same_body; alias; alias = alias->next)
2229 TREE_NOTHROW (alias->decl) = nothrow;
2232 /* Set TREE_READONLY on NODE's decl and on same_body aliases of NODE
2233 if any to READONLY. */
2236 cgraph_set_readonly_flag (struct cgraph_node *node, bool readonly)
2238 struct cgraph_node *alias;
2239 TREE_READONLY (node->decl) = readonly;
2240 for (alias = node->same_body; alias; alias = alias->next)
2241 TREE_READONLY (alias->decl) = readonly;
2244 /* Set DECL_PURE_P on NODE's decl and on same_body aliases of NODE
2248 cgraph_set_pure_flag (struct cgraph_node *node, bool pure)
2250 struct cgraph_node *alias;
2251 DECL_PURE_P (node->decl) = pure;
2252 for (alias = node->same_body; alias; alias = alias->next)
2253 DECL_PURE_P (alias->decl) = pure;
2256 /* Set DECL_LOOPING_CONST_OR_PURE_P on NODE's decl and on
2257 same_body aliases of NODE if any to LOOPING_CONST_OR_PURE. */
2260 cgraph_set_looping_const_or_pure_flag (struct cgraph_node *node,
2261 bool looping_const_or_pure)
2263 struct cgraph_node *alias;
2264 DECL_LOOPING_CONST_OR_PURE_P (node->decl) = looping_const_or_pure;
2265 for (alias = node->same_body; alias; alias = alias->next)
2266 DECL_LOOPING_CONST_OR_PURE_P (alias->decl) = looping_const_or_pure;
2269 #include "gt-cgraph.h"