1 /* Callgraph based intraprocedural optimizations.
2 Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
22 /* This module implements main driver of compilation process as well as
23 few basic intraprocedural optimizers.
25 The main scope of this file is to act as an interface in between
26 tree based frontends and the backend (and middle end)
28 The front-end is supposed to use following functionality:
30 - cgraph_finalize_function
32 This function is called once front-end has parsed whole body of function
33 and it is certain that the function body nor the declaration will change.
35 (There is one exception needed for implementing GCC extern inline function.)
37 - cgraph_varpool_finalize_variable
39 This function has same behavior as the above but is used for static
42 - cgraph_finalize_compilation_unit
44 This function is called once compilation unit is finalized and it will
47 In the unit-at-a-time the call-graph construction and local function
48 analysis takes place here. Bodies of unreachable functions are released
49 to conserve memory usage.
51 ??? The compilation unit in this point of view should be compilation
52 unit as defined by the language - for instance C frontend allows multiple
53 compilation units to be parsed at once and it should call function each
54 time parsing is done so we save memory.
58 In this unit-at-a-time compilation the intra procedural analysis takes
59 place here. In particular the static functions whose address is never
60 taken are marked as local. Backend can then use this information to
61 modify calling conventions, do better inlining or similar optimizations.
63 - cgraph_assemble_pending_functions
64 - cgraph_varpool_assemble_pending_variables
66 In non-unit-at-a-time mode these functions can be used to force compilation
67 of functions or variables that are known to be needed at given stage
70 - cgraph_mark_needed_node
71 - cgraph_varpool_mark_needed_node
73 When function or variable is referenced by some hidden way (for instance
74 via assembly code and marked by attribute "used"), the call-graph data structure
75 must be updated accordingly by this function.
77 - analyze_expr callback
79 This function is responsible for lowering tree nodes not understood by
80 generic code into understandable ones or alternatively marking
81 callgraph and varpool nodes referenced by the as needed.
83 ??? On the tree-ssa genericizing should take place here and we will avoid
84 need for these hooks (replacing them by genericizing hook)
86 - expand_function callback
88 This function is used to expand function and pass it into RTL back-end.
89 Front-end should not make any assumptions about when this function can be
90 called. In particular cgraph_assemble_pending_functions,
91 cgraph_varpool_assemble_pending_variables, cgraph_finalize_function,
92 cgraph_varpool_finalize_function, cgraph_optimize can cause arbitrarily
93 previously finalized functions to be expanded.
95 We implement two compilation modes.
97 - unit-at-a-time: In this mode analyzing of all functions is deferred
98 to cgraph_finalize_compilation_unit and expansion into cgraph_optimize.
100 In cgraph_finalize_compilation_unit the reachable functions are
101 analyzed. During analysis the call-graph edges from reachable
102 functions are constructed and their destinations are marked as
103 reachable. References to functions and variables are discovered too
104 and variables found to be needed output to the assembly file. Via
105 mark_referenced call in assemble_variable functions referenced by
106 static variables are noticed too.
108 The intra-procedural information is produced and its existence
109 indicated by global_info_ready. Once this flag is set it is impossible
110 to change function from !reachable to reachable and thus
111 assemble_variable no longer call mark_referenced.
113 Finally the call-graph is topologically sorted and all reachable functions
114 that has not been completely inlined or are not external are output.
116 ??? It is possible that reference to function or variable is optimized
117 out. We can not deal with this nicely because topological order is not
118 suitable for it. For tree-ssa we may consider another pass doing
119 optimization and re-discovering reachable functions.
121 ??? Reorganize code so variables are output very last and only if they
122 really has been referenced by produced code, so we catch more cases
123 where reference has been optimized out.
127 All functions are variables are output as early as possible to conserve
128 memory consumption. This may or may not result in less memory used but
129 it is still needed for some legacy code that rely on particular ordering
130 of things output from the compiler.
132 Varpool data structures are not used and variables are output directly.
134 Functions are output early using call of
135 cgraph_assemble_pending_function from cgraph_finalize_function. The
136 decision on whether function is needed is made more conservative so
137 uninlininable static functions are needed too. During the call-graph
138 construction the edge destinations are not marked as reachable and it
139 is completely relied upn assemble_variable to mark them. */
144 #include "coretypes.h"
148 #include "tree-flow.h"
149 #include "tree-inline.h"
150 #include "langhooks.h"
151 #include "pointer-set.h"
158 #include "diagnostic.h"
162 #include "c-common.h"
164 #include "function.h"
165 #include "ipa-prop.h"
166 #include "tree-gimple.h"
167 #include "tree-pass.h"
170 static void cgraph_expand_all_functions (void);
171 static void cgraph_mark_functions_to_output (void);
172 static void cgraph_expand_function (struct cgraph_node *);
173 static tree record_reference (tree *, int *, void *);
174 static void cgraph_output_pending_asms (void);
176 /* Records tree nodes seen in record_reference. Simply using
177 walk_tree_without_duplicates doesn't guarantee each node is visited
178 once because it gets a new htab upon each recursive call from
179 record_reference itself. */
180 static struct pointer_set_t *visited_nodes;
182 static FILE *cgraph_dump_file;
184 /* Determine if function DECL is needed. That is, visible to something
185 either outside this translation unit, something magic in the system
186 configury, or (if not doing unit-at-a-time) to something we havn't
190 decide_is_function_needed (struct cgraph_node *node, tree decl)
193 if (MAIN_NAME_P (DECL_NAME (decl))
194 && TREE_PUBLIC (decl))
196 node->local.externally_visible = true;
200 /* If the user told us it is used, then it must be so. */
201 if (node->local.externally_visible
202 || lookup_attribute ("used", DECL_ATTRIBUTES (decl)))
205 /* ??? If the assembler name is set by hand, it is possible to assemble
206 the name later after finalizing the function and the fact is noticed
207 in assemble_name then. This is arguably a bug. */
208 if (DECL_ASSEMBLER_NAME_SET_P (decl)
209 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)))
212 /* If we decided it was needed before, but at the time we didn't have
213 the body of the function available, then it's still needed. We have
214 to go back and re-check its dependencies now. */
218 /* Externally visible functions must be output. The exception is
219 COMDAT functions that must be output only when they are needed.
221 When not optimizing, also output the static functions. (see
222 PR25962), but don't do so for always_inline functions.
224 if (((TREE_PUBLIC (decl)
225 || (!optimize && !node->local.disregard_inline_limits))
226 && !flag_whole_program)
227 && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl))
230 /* Constructors and destructors are reachable from the runtime by
232 if (DECL_STATIC_CONSTRUCTOR (decl) || DECL_STATIC_DESTRUCTOR (decl))
235 if (flag_unit_at_a_time)
238 /* If not doing unit at a time, then we'll only defer this function
239 if its marked for inlining. Otherwise we want to emit it now. */
241 /* "extern inline" functions are never output locally. */
242 if (DECL_EXTERNAL (decl))
244 /* Nested functions of extern inline function shall not be emit unless
245 we inlined the origin. */
246 for (origin = decl_function_context (decl); origin;
247 origin = decl_function_context (origin))
248 if (DECL_EXTERNAL (origin))
250 /* We want to emit COMDAT functions only when absolutely necessary. */
251 if (DECL_COMDAT (decl))
253 if (!DECL_INLINE (decl)
254 || (!node->local.disregard_inline_limits
255 /* When declared inline, defer even the uninlinable functions.
256 This allows them to be eliminated when unused. */
257 && !DECL_DECLARED_INLINE_P (decl)
258 && (!node->local.inlinable || !cgraph_default_inline_p (node, NULL))))
264 /* Walk the decls we marked as necessary and see if they reference new
265 variables or functions and add them into the worklists. */
267 cgraph_varpool_analyze_pending_decls (void)
269 bool changed = false;
270 timevar_push (TV_CGRAPH);
272 while (cgraph_varpool_first_unanalyzed_node)
274 tree decl = cgraph_varpool_first_unanalyzed_node->decl;
276 cgraph_varpool_first_unanalyzed_node->analyzed = true;
278 cgraph_varpool_first_unanalyzed_node = cgraph_varpool_first_unanalyzed_node->next_needed;
280 if (DECL_INITIAL (decl))
282 visited_nodes = pointer_set_create ();
283 walk_tree (&DECL_INITIAL (decl), record_reference, NULL, visited_nodes);
284 pointer_set_destroy (visited_nodes);
285 visited_nodes = NULL;
289 timevar_pop (TV_CGRAPH);
293 /* Optimization of function bodies might've rendered some variables as
294 unnecessary so we want to avoid these from being compiled.
296 This is done by pruning the queue and keeping only the variables that
297 really appear needed (ie they are either externally visible or referenced
298 by compiled function). Re-doing the reachability analysis on variables
299 brings back the remaining variables referenced by these. */
301 cgraph_varpool_remove_unreferenced_decls (void)
303 struct cgraph_varpool_node *next, *node = cgraph_varpool_nodes_queue;
305 cgraph_varpool_reset_queue ();
307 if (errorcount || sorrycount)
312 tree decl = node->decl;
313 next = node->next_needed;
317 && ((DECL_ASSEMBLER_NAME_SET_P (decl)
318 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)))
319 || node->force_output
320 || decide_is_variable_needed (node, decl)
321 /* ??? Cgraph does not yet rule the world with an iron hand,
322 and does not control the emission of debug information.
323 After a variable has its DECL_RTL set, we must assume that
324 it may be referenced by the debug information, and we can
325 no longer elide it. */
326 || DECL_RTL_SET_P (decl)))
327 cgraph_varpool_mark_needed_node (node);
331 /* Make sure we mark alias targets as used targets. */
333 cgraph_varpool_analyze_pending_decls ();
337 /* When not doing unit-at-a-time, output all functions enqueued.
338 Return true when such a functions were found. */
341 cgraph_assemble_pending_functions (void)
345 if (flag_unit_at_a_time)
348 cgraph_output_pending_asms ();
350 while (cgraph_nodes_queue)
352 struct cgraph_node *n = cgraph_nodes_queue;
354 cgraph_nodes_queue = cgraph_nodes_queue->next_needed;
355 n->next_needed = NULL;
356 if (!n->global.inlined_to
358 && !DECL_EXTERNAL (n->decl))
360 cgraph_expand_function (n);
365 /* Process CGRAPH_EXPAND_QUEUE, these are functions created during
366 the expansion process. Note that this queue may grow as its
367 being processed, as the new functions may generate new ones. */
368 while (cgraph_expand_queue)
370 struct cgraph_node *n = cgraph_expand_queue;
371 cgraph_expand_queue = cgraph_expand_queue->next_needed;
372 n->next_needed = NULL;
373 cgraph_finalize_function (n->decl, false);
381 /* As an GCC extension we allow redefinition of the function. The
382 semantics when both copies of bodies differ is not well defined.
383 We replace the old body with new body so in unit at a time mode
384 we always use new body, while in normal mode we may end up with
385 old body inlined into some functions and new body expanded and
388 ??? It may make more sense to use one body for inlining and other
389 body for expanding the function but this is difficult to do. */
392 cgraph_reset_node (struct cgraph_node *node)
394 /* If node->output is set, then this is a unit-at-a-time compilation
395 and we have already begun whole-unit analysis. This is *not*
396 testing for whether we've already emitted the function. That
397 case can be sort-of legitimately seen with real function
398 redefinition errors. I would argue that the front end should
399 never present us with such a case, but don't enforce that for now. */
400 gcc_assert (!node->output);
402 /* Reset our data structures so we can analyze the function again. */
403 memset (&node->local, 0, sizeof (node->local));
404 memset (&node->global, 0, sizeof (node->global));
405 memset (&node->rtl, 0, sizeof (node->rtl));
406 node->analyzed = false;
407 node->local.redefined_extern_inline = true;
408 node->local.finalized = false;
410 if (!flag_unit_at_a_time)
412 struct cgraph_node *n;
414 for (n = cgraph_nodes; n; n = n->next)
415 if (n->global.inlined_to == node)
416 cgraph_remove_node (n);
419 cgraph_node_remove_callees (node);
421 /* We may need to re-queue the node for assembling in case
422 we already proceeded it and ignored as not needed. */
423 if (node->reachable && !flag_unit_at_a_time)
425 struct cgraph_node *n;
427 for (n = cgraph_nodes_queue; n; n = n->next_needed)
436 cgraph_lower_function (struct cgraph_node *node)
440 tree_lowering_passes (node->decl);
441 node->lowered = true;
444 /* DECL has been parsed. Take it, queue it, compile it at the whim of the
445 logic in effect. If NESTED is true, then our caller cannot stand to have
446 the garbage collector run at the moment. We would need to either create
447 a new GC context, or just not compile right now. */
450 cgraph_finalize_function (tree decl, bool nested)
452 struct cgraph_node *node = cgraph_node (decl);
454 if (node->local.finalized)
455 cgraph_reset_node (node);
457 notice_global_symbol (decl);
459 node->local.finalized = true;
460 node->lowered = DECL_STRUCT_FUNCTION (decl)->cfg != NULL;
462 lower_nested_functions (decl);
463 gcc_assert (!node->nested);
465 /* If not unit at a time, then we need to create the call graph
466 now, so that called functions can be queued and emitted now. */
467 if (!flag_unit_at_a_time)
469 cgraph_analyze_function (node);
470 cgraph_decide_inlining_incrementally (node, false);
473 if (decide_is_function_needed (node, decl))
474 cgraph_mark_needed_node (node);
476 /* Since we reclaim unreachable nodes at the end of every language
477 level unit, we need to be conservative about possible entry points
479 if ((TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl)))
480 cgraph_mark_reachable_node (node);
482 /* If not unit at a time, go ahead and emit everything we've found
483 to be reachable at this time. */
486 if (!cgraph_assemble_pending_functions ())
490 /* If we've not yet emitted decl, tell the debug info about it. */
491 if (!TREE_ASM_WRITTEN (decl))
492 (*debug_hooks->deferred_inline_function) (decl);
494 /* Possibly warn about unused parameters. */
495 if (warn_unused_parameter)
496 do_warn_unused_parameter (decl);
499 /* Walk tree and record all calls. Called via walk_tree. */
501 record_reference (tree *tp, int *walk_subtrees, void *data)
505 switch (TREE_CODE (t))
508 /* ??? Really, we should mark this decl as *potentially* referenced
509 by this function and re-examine whether the decl is actually used
510 after rtl has been generated. */
511 if (TREE_STATIC (t) || DECL_EXTERNAL (t))
513 cgraph_varpool_mark_needed_node (cgraph_varpool_node (t));
514 if (lang_hooks.callgraph.analyze_expr)
515 return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees,
522 if (flag_unit_at_a_time)
524 /* Record dereferences to the functions. This makes the
525 functions reachable unconditionally. */
526 tree decl = TREE_OPERAND (*tp, 0);
527 if (TREE_CODE (decl) == FUNCTION_DECL)
528 cgraph_mark_needed_node (cgraph_node (decl));
533 /* Save some cycles by not walking types and declaration as we
534 won't find anything useful there anyway. */
535 if (IS_TYPE_OR_DECL_P (*tp))
541 if ((unsigned int) TREE_CODE (t) >= LAST_AND_UNUSED_TREE_CODE)
542 return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees, data);
549 /* Create cgraph edges for function calls inside BODY from NODE. */
552 cgraph_create_edges (struct cgraph_node *node, tree body)
556 struct function *this_cfun = DECL_STRUCT_FUNCTION (body);
557 block_stmt_iterator bsi;
559 visited_nodes = pointer_set_create ();
561 /* Reach the trees by walking over the CFG, and note the
562 enclosing basic-blocks in the call edges. */
563 FOR_EACH_BB_FN (bb, this_cfun)
564 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
566 tree stmt = bsi_stmt (bsi);
567 tree call = get_call_expr_in (stmt);
570 if (call && (decl = get_callee_fndecl (call)))
572 cgraph_create_edge (node, cgraph_node (decl), stmt,
575 walk_tree (&TREE_OPERAND (call, 1),
576 record_reference, node, visited_nodes);
577 if (TREE_CODE (stmt) == MODIFY_EXPR)
578 walk_tree (&TREE_OPERAND (stmt, 0),
579 record_reference, node, visited_nodes);
582 walk_tree (bsi_stmt_ptr (bsi), record_reference, node, visited_nodes);
585 /* Look for initializers of constant variables and private statics. */
586 for (step = DECL_STRUCT_FUNCTION (body)->unexpanded_var_list;
588 step = TREE_CHAIN (step))
590 tree decl = TREE_VALUE (step);
591 if (TREE_CODE (decl) == VAR_DECL
592 && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl))
593 && flag_unit_at_a_time)
594 cgraph_varpool_finalize_decl (decl);
595 else if (TREE_CODE (decl) == VAR_DECL && DECL_INITIAL (decl))
596 walk_tree (&DECL_INITIAL (decl), record_reference, node, visited_nodes);
599 pointer_set_destroy (visited_nodes);
600 visited_nodes = NULL;
603 /* Give initial reasons why inlining would fail. Those gets
604 either NULLified or usually overwritten by more precise reason
607 initialize_inline_failed (struct cgraph_node *node)
609 struct cgraph_edge *e;
611 for (e = node->callers; e; e = e->next_caller)
613 gcc_assert (!e->callee->global.inlined_to);
614 gcc_assert (e->inline_failed);
615 if (node->local.redefined_extern_inline)
616 e->inline_failed = N_("redefined extern inline functions are not "
617 "considered for inlining");
618 else if (!node->local.inlinable)
619 e->inline_failed = N_("function not inlinable");
621 e->inline_failed = N_("function not considered for inlining");
625 /* Rebuild call edges from current function after a passes not aware
626 of cgraph updating. */
628 rebuild_cgraph_edges (void)
631 struct cgraph_node *node = cgraph_node (current_function_decl);
632 block_stmt_iterator bsi;
634 cgraph_node_remove_callees (node);
636 node->count = ENTRY_BLOCK_PTR->count;
639 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
641 tree stmt = bsi_stmt (bsi);
642 tree call = get_call_expr_in (stmt);
645 if (call && (decl = get_callee_fndecl (call)))
646 cgraph_create_edge (node, cgraph_node (decl), stmt,
650 initialize_inline_failed (node);
651 gcc_assert (!node->global.inlined_to);
655 struct tree_opt_pass pass_rebuild_cgraph_edges =
659 rebuild_cgraph_edges, /* execute */
662 0, /* static_pass_number */
664 PROP_cfg, /* properties_required */
665 0, /* properties_provided */
666 0, /* properties_destroyed */
667 0, /* todo_flags_start */
668 0, /* todo_flags_finish */
672 /* Verify cgraph nodes of given cgraph node. */
674 verify_cgraph_node (struct cgraph_node *node)
676 struct cgraph_edge *e;
677 struct cgraph_node *main_clone;
678 struct function *this_cfun = DECL_STRUCT_FUNCTION (node->decl);
679 basic_block this_block;
680 block_stmt_iterator bsi;
681 bool error_found = false;
683 timevar_push (TV_CGRAPH_VERIFY);
684 for (e = node->callees; e; e = e->next_callee)
687 error ("aux field set for edge %s->%s",
688 cgraph_node_name (e->caller), cgraph_node_name (e->callee));
693 error ("Execution count is negative");
696 for (e = node->callers; e; e = e->next_caller)
700 error ("caller edge count is negative");
703 if (!e->inline_failed)
705 if (node->global.inlined_to
706 != (e->caller->global.inlined_to
707 ? e->caller->global.inlined_to : e->caller))
709 error ("inlined_to pointer is wrong");
712 if (node->callers->next_caller)
714 error ("multiple inline callers");
719 if (node->global.inlined_to)
721 error ("inlined_to pointer set for noninline callers");
725 if (!node->callers && node->global.inlined_to)
727 error ("inlined_to pointer is set but no predecesors found");
730 if (node->global.inlined_to == node)
732 error ("inlined_to pointer refers to itself");
736 for (main_clone = cgraph_node (node->decl); main_clone;
737 main_clone = main_clone->next_clone)
738 if (main_clone == node)
740 if (!cgraph_node (node->decl))
742 error ("node not found in cgraph_hash");
747 && DECL_SAVED_TREE (node->decl) && !TREE_ASM_WRITTEN (node->decl)
748 && (!DECL_EXTERNAL (node->decl) || node->global.inlined_to))
752 /* The nodes we're interested in are never shared, so walk
753 the tree ignoring duplicates. */
754 visited_nodes = pointer_set_create ();
755 /* Reach the trees by walking over the CFG, and note the
756 enclosing basic-blocks in the call edges. */
757 FOR_EACH_BB_FN (this_block, this_cfun)
758 for (bsi = bsi_start (this_block); !bsi_end_p (bsi); bsi_next (&bsi))
760 tree stmt = bsi_stmt (bsi);
761 tree call = get_call_expr_in (stmt);
763 if (call && (decl = get_callee_fndecl (call)))
765 struct cgraph_edge *e = cgraph_edge (node, stmt);
770 error ("shared call_stmt:");
771 debug_generic_stmt (stmt);
774 if (e->callee->decl != cgraph_node (decl)->decl
777 error ("edge points to wrong declaration:");
778 debug_tree (e->callee->decl);
779 fprintf (stderr," Instead of:");
786 error ("missing callgraph edge for call stmt:");
787 debug_generic_stmt (stmt);
792 pointer_set_destroy (visited_nodes);
793 visited_nodes = NULL;
796 /* No CFG available?! */
799 for (e = node->callees; e; e = e->next_callee)
803 error ("edge %s->%s has no corresponding call_stmt",
804 cgraph_node_name (e->caller),
805 cgraph_node_name (e->callee));
806 debug_generic_stmt (e->call_stmt);
814 dump_cgraph_node (stderr, node);
815 internal_error ("verify_cgraph_node failed");
817 timevar_pop (TV_CGRAPH_VERIFY);
820 /* Verify whole cgraph structure. */
824 struct cgraph_node *node;
826 if (sorrycount || errorcount)
829 for (node = cgraph_nodes; node; node = node->next)
830 verify_cgraph_node (node);
833 /* Output one variable, if necessary. Return whether we output it. */
835 cgraph_varpool_assemble_decl (struct cgraph_varpool_node *node)
837 tree decl = node->decl;
839 if (!TREE_ASM_WRITTEN (decl)
841 && !DECL_EXTERNAL (decl)
842 && (TREE_CODE (decl) != VAR_DECL || !DECL_HAS_VALUE_EXPR_P (decl)))
844 assemble_variable (decl, 0, 1, 0);
845 /* Local static variables are never seen by check_global_declarations
846 so we need to output debug info by hand. */
847 if (DECL_CONTEXT (decl)
848 && (TREE_CODE (DECL_CONTEXT (decl)) == BLOCK
849 || TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
850 && errorcount == 0 && sorrycount == 0)
852 timevar_push (TV_SYMOUT);
853 (*debug_hooks->global_decl) (decl);
854 timevar_pop (TV_SYMOUT);
862 /* Output all variables enqueued to be assembled. */
864 cgraph_varpool_assemble_pending_decls (void)
866 bool changed = false;
868 if (errorcount || sorrycount)
871 /* EH might mark decls as needed during expansion. This should be safe since
872 we don't create references to new function, but it should not be used
874 cgraph_varpool_analyze_pending_decls ();
876 while (cgraph_varpool_nodes_queue)
878 struct cgraph_varpool_node *node = cgraph_varpool_nodes_queue;
880 cgraph_varpool_nodes_queue = cgraph_varpool_nodes_queue->next_needed;
881 if (cgraph_varpool_assemble_decl (node))
883 node->next_needed = NULL;
888 /* Output all asm statements we have stored up to be output. */
891 cgraph_output_pending_asms (void)
893 struct cgraph_asm_node *can;
895 if (errorcount || sorrycount)
898 for (can = cgraph_asm_nodes; can; can = can->next)
899 assemble_asm (can->asm_str);
900 cgraph_asm_nodes = NULL;
903 /* Analyze the function scheduled to be output. */
905 cgraph_analyze_function (struct cgraph_node *node)
907 tree decl = node->decl;
909 current_function_decl = decl;
910 push_cfun (DECL_STRUCT_FUNCTION (decl));
911 cgraph_lower_function (node);
913 /* First kill forward declaration so reverse inlining works properly. */
914 cgraph_create_edges (node, decl);
916 node->local.inlinable = tree_inlinable_function_p (decl);
917 node->local.self_insns = estimate_num_insns (decl);
918 if (node->local.inlinable)
919 node->local.disregard_inline_limits
920 = lang_hooks.tree_inlining.disregard_inline_limits (decl);
921 initialize_inline_failed (node);
922 if (flag_really_no_inline && !node->local.disregard_inline_limits)
923 node->local.inlinable = 0;
924 /* Inlining characteristics are maintained by the cgraph_mark_inline. */
925 node->global.insns = node->local.self_insns;
927 node->analyzed = true;
929 current_function_decl = NULL;
932 /* Analyze the whole compilation unit once it is parsed completely. */
935 cgraph_finalize_compilation_unit (void)
937 struct cgraph_node *node;
938 /* Keep track of already processed nodes when called multiple times for
939 intermodule optimization. */
940 static struct cgraph_node *first_analyzed;
944 if (!flag_unit_at_a_time)
946 cgraph_output_pending_asms ();
947 cgraph_assemble_pending_functions ();
953 fprintf (stderr, "\nAnalyzing compilation unit");
957 timevar_push (TV_CGRAPH);
958 cgraph_varpool_analyze_pending_decls ();
959 if (cgraph_dump_file)
961 fprintf (cgraph_dump_file, "Initial entry points:");
962 for (node = cgraph_nodes; node != first_analyzed; node = node->next)
963 if (node->needed && DECL_SAVED_TREE (node->decl))
964 fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
965 fprintf (cgraph_dump_file, "\n");
968 /* Propagate reachability flag and lower representation of all reachable
969 functions. In the future, lowering will introduce new functions and
970 new entry points on the way (by template instantiation and virtual
971 method table generation for instance). */
972 while (cgraph_nodes_queue)
974 struct cgraph_edge *edge;
975 tree decl = cgraph_nodes_queue->decl;
977 node = cgraph_nodes_queue;
978 cgraph_nodes_queue = cgraph_nodes_queue->next_needed;
979 node->next_needed = NULL;
981 /* ??? It is possible to create extern inline function and later using
982 weak alias attribute to kill its body. See
983 gcc.c-torture/compile/20011119-1.c */
984 if (!DECL_SAVED_TREE (decl))
986 cgraph_reset_node (node);
990 gcc_assert (!node->analyzed && node->reachable);
991 gcc_assert (DECL_SAVED_TREE (decl));
993 cgraph_analyze_function (node);
995 for (edge = node->callees; edge; edge = edge->next_callee)
996 if (!edge->callee->reachable)
997 cgraph_mark_reachable_node (edge->callee);
999 cgraph_varpool_analyze_pending_decls ();
1002 /* Collect entry points to the unit. */
1004 if (cgraph_dump_file)
1006 fprintf (cgraph_dump_file, "Unit entry points:");
1007 for (node = cgraph_nodes; node != first_analyzed; node = node->next)
1008 if (node->needed && DECL_SAVED_TREE (node->decl))
1009 fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
1010 fprintf (cgraph_dump_file, "\n\nInitial ");
1011 dump_cgraph (cgraph_dump_file);
1014 if (cgraph_dump_file)
1015 fprintf (cgraph_dump_file, "\nReclaiming functions:");
1017 for (node = cgraph_nodes; node != first_analyzed; node = node->next)
1019 tree decl = node->decl;
1021 if (node->local.finalized && !DECL_SAVED_TREE (decl))
1022 cgraph_reset_node (node);
1024 if (!node->reachable && DECL_SAVED_TREE (decl))
1026 if (cgraph_dump_file)
1027 fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
1028 cgraph_remove_node (node);
1032 node->next_needed = NULL;
1033 gcc_assert (!node->local.finalized || DECL_SAVED_TREE (decl));
1034 gcc_assert (node->analyzed == node->local.finalized);
1036 if (cgraph_dump_file)
1038 fprintf (cgraph_dump_file, "\n\nReclaimed ");
1039 dump_cgraph (cgraph_dump_file);
1041 first_analyzed = cgraph_nodes;
1043 timevar_pop (TV_CGRAPH);
1045 /* Figure out what functions we want to assemble. */
1048 cgraph_mark_functions_to_output (void)
1050 struct cgraph_node *node;
1052 for (node = cgraph_nodes; node; node = node->next)
1054 tree decl = node->decl;
1055 struct cgraph_edge *e;
1057 gcc_assert (!node->output);
1059 for (e = node->callers; e; e = e->next_caller)
1060 if (e->inline_failed)
1063 /* We need to output all local functions that are used and not
1064 always inlined, as well as those that are reachable from
1065 outside the current compilation unit. */
1066 if (DECL_SAVED_TREE (decl)
1067 && !node->global.inlined_to
1069 || (e && node->reachable))
1070 && !TREE_ASM_WRITTEN (decl)
1071 && !DECL_EXTERNAL (decl))
1075 /* We should've reclaimed all functions that are not needed. */
1076 #ifdef ENABLE_CHECKING
1077 if (!node->global.inlined_to && DECL_SAVED_TREE (decl)
1078 && !DECL_EXTERNAL (decl))
1080 dump_cgraph_node (stderr, node);
1081 internal_error ("failed to reclaim unneeded function");
1084 gcc_assert (node->global.inlined_to || !DECL_SAVED_TREE (decl)
1085 || DECL_EXTERNAL (decl));
1092 /* Expand function specified by NODE. */
1095 cgraph_expand_function (struct cgraph_node *node)
1097 tree decl = node->decl;
1099 /* We ought to not compile any inline clones. */
1100 gcc_assert (!node->global.inlined_to);
1102 if (flag_unit_at_a_time)
1103 announce_function (decl);
1105 cgraph_lower_function (node);
1107 /* Generate RTL for the body of DECL. */
1108 lang_hooks.callgraph.expand_function (decl);
1110 /* Make sure that BE didn't give up on compiling. */
1111 /* ??? Can happen with nested function of extern inline. */
1112 gcc_assert (TREE_ASM_WRITTEN (node->decl));
1114 current_function_decl = NULL;
1115 if (!cgraph_preserve_function_body_p (node->decl))
1117 DECL_SAVED_TREE (node->decl) = NULL;
1118 DECL_STRUCT_FUNCTION (node->decl) = NULL;
1119 DECL_INITIAL (node->decl) = error_mark_node;
1120 /* Eliminate all call edges. This is important so the call_expr no longer
1121 points to the dead function body. */
1122 cgraph_node_remove_callees (node);
1125 cgraph_function_flags_ready = true;
1128 /* Return true when CALLER_DECL should be inlined into CALLEE_DECL. */
1131 cgraph_inline_p (struct cgraph_edge *e, const char **reason)
1133 *reason = e->inline_failed;
1134 return !e->inline_failed;
1139 /* Expand all functions that must be output.
1141 Attempt to topologically sort the nodes so function is output when
1142 all called functions are already assembled to allow data to be
1143 propagated across the callgraph. Use a stack to get smaller distance
1144 between a function and its callees (later we may choose to use a more
1145 sophisticated algorithm for function reordering; we will likely want
1146 to use subsections to make the output functions appear in top-down
1150 cgraph_expand_all_functions (void)
1152 struct cgraph_node *node;
1153 struct cgraph_node **order = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
1154 int order_pos = 0, new_order_pos = 0;
1157 order_pos = cgraph_postorder (order);
1158 gcc_assert (order_pos == cgraph_n_nodes);
1160 /* Garbage collector may remove inline clones we eliminate during
1161 optimization. So we must be sure to not reference them. */
1162 for (i = 0; i < order_pos; i++)
1163 if (order[i]->output)
1164 order[new_order_pos++] = order[i];
1166 for (i = new_order_pos - 1; i >= 0; i--)
1171 gcc_assert (node->reachable);
1173 cgraph_expand_function (node);
1179 /* Process CGRAPH_EXPAND_QUEUE, these are functions created during
1180 the expansion process. Note that this queue may grow as its
1181 being processed, as the new functions may generate new ones. */
1182 while (cgraph_expand_queue)
1184 node = cgraph_expand_queue;
1185 cgraph_expand_queue = cgraph_expand_queue->next_needed;
1186 node->next_needed = NULL;
1188 node->lowered = DECL_STRUCT_FUNCTION (node->decl)->cfg != NULL;
1189 cgraph_expand_function (node);
1193 /* This is used to sort the node types by the cgraph order number. */
1195 struct cgraph_order_sort
1197 enum { ORDER_UNDEFINED = 0, ORDER_FUNCTION, ORDER_VAR, ORDER_ASM } kind;
1200 struct cgraph_node *f;
1201 struct cgraph_varpool_node *v;
1202 struct cgraph_asm_node *a;
1206 /* Output all functions, variables, and asm statements in the order
1207 according to their order fields, which is the order in which they
1208 appeared in the file. This implements -fno-toplevel-reorder. In
1209 this mode we may output functions and variables which don't really
1210 need to be output. */
1213 cgraph_output_in_order (void)
1217 struct cgraph_order_sort *nodes;
1219 struct cgraph_node *pf;
1220 struct cgraph_varpool_node *pv;
1221 struct cgraph_asm_node *pa;
1224 size = max * sizeof (struct cgraph_order_sort);
1225 nodes = (struct cgraph_order_sort *) alloca (size);
1226 memset (nodes, 0, size);
1228 cgraph_varpool_analyze_pending_decls ();
1230 for (pf = cgraph_nodes; pf; pf = pf->next)
1235 gcc_assert (nodes[i].kind == ORDER_UNDEFINED);
1236 nodes[i].kind = ORDER_FUNCTION;
1241 for (pv = cgraph_varpool_nodes_queue; pv; pv = pv->next_needed)
1244 gcc_assert (nodes[i].kind == ORDER_UNDEFINED);
1245 nodes[i].kind = ORDER_VAR;
1249 for (pa = cgraph_asm_nodes; pa; pa = pa->next)
1252 gcc_assert (nodes[i].kind == ORDER_UNDEFINED);
1253 nodes[i].kind = ORDER_ASM;
1257 for (i = 0; i < max; ++i)
1259 switch (nodes[i].kind)
1261 case ORDER_FUNCTION:
1262 nodes[i].u.f->output = 0;
1263 cgraph_expand_function (nodes[i].u.f);
1267 cgraph_varpool_assemble_decl (nodes[i].u.v);
1271 assemble_asm (nodes[i].u.a->asm_str);
1274 case ORDER_UNDEFINED:
1282 cgraph_asm_nodes = NULL;
1285 /* Mark visibility of all functions.
1287 A local function is one whose calls can occur only in the current
1288 compilation unit and all its calls are explicit, so we can change
1289 its calling convention. We simply mark all static functions whose
1290 address is not taken as local.
1292 We also change the TREE_PUBLIC flag of all declarations that are public
1293 in language point of view but we want to overwrite this default
1294 via visibilities for the backend point of view. */
1297 cgraph_function_and_variable_visibility (void)
1299 struct cgraph_node *node;
1300 struct cgraph_varpool_node *vnode;
1302 for (node = cgraph_nodes; node; node = node->next)
1305 && (DECL_COMDAT (node->decl)
1306 || (!flag_whole_program
1307 && TREE_PUBLIC (node->decl) && !DECL_EXTERNAL (node->decl))))
1308 node->local.externally_visible = true;
1309 if (!node->local.externally_visible && node->analyzed
1310 && !DECL_EXTERNAL (node->decl))
1312 gcc_assert (flag_whole_program || !TREE_PUBLIC (node->decl));
1313 TREE_PUBLIC (node->decl) = 0;
1315 node->local.local = (!node->needed
1317 && !DECL_EXTERNAL (node->decl)
1318 && !node->local.externally_visible);
1320 for (vnode = cgraph_varpool_nodes_queue; vnode; vnode = vnode->next_needed)
1323 && !flag_whole_program
1324 && (DECL_COMDAT (vnode->decl) || TREE_PUBLIC (vnode->decl)))
1325 vnode->externally_visible = 1;
1326 if (!vnode->externally_visible)
1328 gcc_assert (flag_whole_program || !TREE_PUBLIC (vnode->decl));
1329 TREE_PUBLIC (vnode->decl) = 0;
1331 gcc_assert (TREE_STATIC (vnode->decl));
1334 /* Because we have to be conservative on the boundaries of source
1335 level units, it is possible that we marked some functions in
1336 reachable just because they might be used later via external
1337 linkage, but after making them local they are really unreachable
1339 cgraph_remove_unreachable_nodes (true, cgraph_dump_file);
1341 if (cgraph_dump_file)
1343 fprintf (cgraph_dump_file, "\nMarking local functions:");
1344 for (node = cgraph_nodes; node; node = node->next)
1345 if (node->local.local)
1346 fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
1347 fprintf (cgraph_dump_file, "\n\n");
1348 fprintf (cgraph_dump_file, "\nMarking externally visible functions:");
1349 for (node = cgraph_nodes; node; node = node->next)
1350 if (node->local.externally_visible)
1351 fprintf (cgraph_dump_file, " %s", cgraph_node_name (node));
1352 fprintf (cgraph_dump_file, "\n\n");
1354 cgraph_function_flags_ready = true;
1357 /* Return true when function body of DECL still needs to be kept around
1358 for later re-use. */
1360 cgraph_preserve_function_body_p (tree decl)
1362 struct cgraph_node *node;
1363 if (!cgraph_global_info_ready)
1364 return (DECL_INLINE (decl) && !flag_really_no_inline);
1365 /* Look if there is any clone around. */
1366 for (node = cgraph_node (decl); node; node = node->next_clone)
1367 if (node->global.inlined_to)
1376 tree_register_cfg_hooks ();
1377 bitmap_obstack_initialize (NULL);
1378 execute_ipa_pass_list (all_ipa_passes);
1379 bitmap_obstack_release (NULL);
1382 /* Perform simple optimizations based on callgraph. */
1385 cgraph_optimize (void)
1387 #ifdef ENABLE_CHECKING
1390 if (!flag_unit_at_a_time)
1392 cgraph_output_pending_asms ();
1393 cgraph_varpool_assemble_pending_decls ();
1397 process_pending_assemble_externals ();
1399 /* Frontend may output common variables after the unit has been finalized.
1400 It is safe to deal with them here as they are always zero initialized. */
1401 cgraph_varpool_analyze_pending_decls ();
1403 timevar_push (TV_CGRAPHOPT);
1405 fprintf (stderr, "Performing intraprocedural optimizations\n");
1407 cgraph_function_and_variable_visibility ();
1408 if (cgraph_dump_file)
1410 fprintf (cgraph_dump_file, "Marked ");
1411 dump_cgraph (cgraph_dump_file);
1414 /* This pass remove bodies of extern inline functions we never inlined.
1415 Do this later so other IPA passes see what is really going on. */
1416 cgraph_remove_unreachable_nodes (false, dump_file);
1417 cgraph_global_info_ready = true;
1418 if (cgraph_dump_file)
1420 fprintf (cgraph_dump_file, "Optimized ");
1421 dump_cgraph (cgraph_dump_file);
1422 dump_varpool (cgraph_dump_file);
1424 timevar_pop (TV_CGRAPHOPT);
1426 /* Output everything. */
1428 fprintf (stderr, "Assembling functions:\n");
1429 #ifdef ENABLE_CHECKING
1433 cgraph_mark_functions_to_output ();
1435 if (!flag_toplevel_reorder)
1436 cgraph_output_in_order ();
1439 cgraph_output_pending_asms ();
1441 cgraph_expand_all_functions ();
1442 cgraph_varpool_remove_unreferenced_decls ();
1444 cgraph_varpool_assemble_pending_decls ();
1447 if (cgraph_dump_file)
1449 fprintf (cgraph_dump_file, "\nFinal ");
1450 dump_cgraph (cgraph_dump_file);
1452 #ifdef ENABLE_CHECKING
1454 /* Double check that all inline clones are gone and that all
1455 function bodies have been released from memory. */
1456 if (flag_unit_at_a_time
1457 && !dump_enabled_p (TDI_tree_all)
1458 && !(sorrycount || errorcount))
1460 struct cgraph_node *node;
1461 bool error_found = false;
1463 for (node = cgraph_nodes; node; node = node->next)
1465 && (node->global.inlined_to
1466 || DECL_SAVED_TREE (node->decl)))
1469 dump_cgraph_node (stderr, node);
1472 internal_error ("nodes with no released memory found");
1477 /* Generate and emit a static constructor or destructor. WHICH must be
1478 one of 'I' or 'D'. BODY should be a STATEMENT_LIST containing
1479 GENERIC statements. */
1482 cgraph_build_static_cdtor (char which, tree body, int priority)
1484 static int counter = 0;
1486 tree decl, name, resdecl;
1488 sprintf (which_buf, "%c_%d", which, counter++);
1489 name = get_file_function_name_long (which_buf);
1491 decl = build_decl (FUNCTION_DECL, name,
1492 build_function_type (void_type_node, void_list_node));
1493 current_function_decl = decl;
1495 resdecl = build_decl (RESULT_DECL, NULL_TREE, void_type_node);
1496 DECL_ARTIFICIAL (resdecl) = 1;
1497 DECL_IGNORED_P (resdecl) = 1;
1498 DECL_RESULT (decl) = resdecl;
1500 allocate_struct_function (decl);
1502 TREE_STATIC (decl) = 1;
1503 TREE_USED (decl) = 1;
1504 DECL_ARTIFICIAL (decl) = 1;
1505 DECL_IGNORED_P (decl) = 1;
1506 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
1507 DECL_SAVED_TREE (decl) = body;
1508 TREE_PUBLIC (decl) = ! targetm.have_ctors_dtors;
1509 DECL_UNINLINABLE (decl) = 1;
1511 DECL_INITIAL (decl) = make_node (BLOCK);
1512 TREE_USED (DECL_INITIAL (decl)) = 1;
1514 DECL_SOURCE_LOCATION (decl) = input_location;
1515 cfun->function_end_locus = input_location;
1520 DECL_STATIC_CONSTRUCTOR (decl) = 1;
1523 DECL_STATIC_DESTRUCTOR (decl) = 1;
1529 gimplify_function_tree (decl);
1531 /* ??? We will get called LATE in the compilation process. */
1532 if (cgraph_global_info_ready)
1534 tree_lowering_passes (decl);
1535 tree_rest_of_compilation (decl);
1538 cgraph_finalize_function (decl, 0);
1540 if (targetm.have_ctors_dtors)
1542 void (*fn) (rtx, int);
1545 fn = targetm.asm_out.constructor;
1547 fn = targetm.asm_out.destructor;
1548 fn (XEXP (DECL_RTL (decl), 0), priority);
1555 cgraph_dump_file = dump_begin (TDI_cgraph, NULL);
1558 /* The edges representing the callers of the NEW_VERSION node were
1559 fixed by cgraph_function_versioning (), now the call_expr in their
1560 respective tree code should be updated to call the NEW_VERSION. */
1563 update_call_expr (struct cgraph_node *new_version)
1565 struct cgraph_edge *e;
1567 gcc_assert (new_version);
1568 for (e = new_version->callers; e; e = e->next_caller)
1569 /* Update the call expr on the edges
1570 to call the new version. */
1571 TREE_OPERAND (TREE_OPERAND (get_call_expr_in (e->call_stmt), 0), 0) = new_version->decl;
1575 /* Create a new cgraph node which is the new version of
1576 OLD_VERSION node. REDIRECT_CALLERS holds the callers
1577 edges which should be redirected to point to
1578 NEW_VERSION. ALL the callees edges of OLD_VERSION
1579 are cloned to the new version node. Return the new
1582 static struct cgraph_node *
1583 cgraph_copy_node_for_versioning (struct cgraph_node *old_version,
1585 VEC(cgraph_edge_p,heap) *redirect_callers)
1587 struct cgraph_node *new_version;
1588 struct cgraph_edge *e, *new_e;
1589 struct cgraph_edge *next_callee;
1592 gcc_assert (old_version);
1594 new_version = cgraph_node (new_decl);
1596 new_version->analyzed = true;
1597 new_version->local = old_version->local;
1598 new_version->global = old_version->global;
1599 new_version->rtl = new_version->rtl;
1600 new_version->reachable = true;
1601 new_version->count = old_version->count;
1603 /* Clone the old node callees. Recursive calls are
1605 for (e = old_version->callees;e; e=e->next_callee)
1607 new_e = cgraph_clone_edge (e, new_version, e->call_stmt, 0, e->loop_nest, true);
1608 new_e->count = e->count;
1610 /* Fix recursive calls.
1611 If OLD_VERSION has a recursive call after the
1612 previous edge cloning, the new version will have an edge
1613 pointing to the old version, which is wrong;
1614 Redirect it to point to the new version. */
1615 for (e = new_version->callees ; e; e = next_callee)
1617 next_callee = e->next_callee;
1618 if (e->callee == old_version)
1619 cgraph_redirect_edge_callee (e, new_version);
1624 for (i = 0; VEC_iterate (cgraph_edge_p, redirect_callers, i, e); i++)
1626 /* Redirect calls to the old version node to point to its new
1628 cgraph_redirect_edge_callee (e, new_version);
1634 /* Perform function versioning.
1635 Function versioning includes copying of the tree and
1636 a callgraph update (creating a new cgraph node and updating
1637 its callees and callers).
1639 REDIRECT_CALLERS varray includes the edges to be redirected
1642 TREE_MAP is a mapping of tree nodes we want to replace with
1643 new ones (according to results of prior analysis).
1644 OLD_VERSION_NODE is the node that is versioned.
1645 It returns the new version's cgraph node. */
1647 struct cgraph_node *
1648 cgraph_function_versioning (struct cgraph_node *old_version_node,
1649 VEC(cgraph_edge_p,heap) *redirect_callers,
1650 varray_type tree_map)
1652 tree old_decl = old_version_node->decl;
1653 struct cgraph_node *new_version_node = NULL;
1656 if (!tree_versionable_function_p (old_decl))
1659 /* Make a new FUNCTION_DECL tree node for the
1661 new_decl = copy_node (old_decl);
1663 /* Create the new version's call-graph node.
1664 and update the edges of the new node. */
1666 cgraph_copy_node_for_versioning (old_version_node, new_decl,
1669 /* Copy the OLD_VERSION_NODE function tree to the new version. */
1670 tree_function_versioning (old_decl, new_decl, tree_map, false);
1671 /* Update the call_expr on the edges to call the new version node. */
1672 update_call_expr (new_version_node);
1674 /* Update the new version's properties.
1675 Make The new version visible only within this translation unit.
1676 ??? We cannot use COMDAT linkage because there is no
1677 ABI support for this. */
1678 DECL_EXTERNAL (new_version_node->decl) = 0;
1679 DECL_ONE_ONLY (new_version_node->decl) = 0;
1680 TREE_PUBLIC (new_version_node->decl) = 0;
1681 DECL_COMDAT (new_version_node->decl) = 0;
1682 new_version_node->local.externally_visible = 0;
1683 new_version_node->local.local = 1;
1684 new_version_node->lowered = true;
1685 return new_version_node;
1688 /* Produce separate function body for inline clones so the offline copy can be
1689 modified without affecting them. */
1690 struct cgraph_node *
1691 save_inline_function_body (struct cgraph_node *node)
1693 struct cgraph_node *first_clone;
1695 gcc_assert (node == cgraph_node (node->decl));
1697 cgraph_lower_function (node);
1699 /* In non-unit-at-a-time we construct full fledged clone we never output to
1700 assembly file. This clone is pointed out by inline_decl of original function
1701 and inlining infrastructure knows how to deal with this. */
1702 if (!flag_unit_at_a_time)
1704 struct cgraph_edge *e;
1706 first_clone = cgraph_clone_node (node, node->count, 0, false);
1707 first_clone->needed = 0;
1708 first_clone->reachable = 1;
1709 /* Recursively clone all bodies. */
1710 for (e = first_clone->callees; e; e = e->next_callee)
1711 if (!e->inline_failed)
1712 cgraph_clone_inlined_nodes (e, true, false);
1715 first_clone = node->next_clone;
1717 first_clone->decl = copy_node (node->decl);
1718 node->next_clone = NULL;
1719 if (!flag_unit_at_a_time)
1720 node->inline_decl = first_clone->decl;
1721 first_clone->prev_clone = NULL;
1722 cgraph_insert_node_to_hashtable (first_clone);
1723 gcc_assert (first_clone == cgraph_node (first_clone->decl));
1725 /* Copy the OLD_VERSION_NODE function tree to the new version. */
1726 tree_function_versioning (node->decl, first_clone->decl, NULL, true);
1728 DECL_EXTERNAL (first_clone->decl) = 0;
1729 DECL_ONE_ONLY (first_clone->decl) = 0;
1730 TREE_PUBLIC (first_clone->decl) = 0;
1731 DECL_COMDAT (first_clone->decl) = 0;
1733 for (node = first_clone->next_clone; node; node = node->next_clone)
1734 node->decl = first_clone->decl;
1735 #ifdef ENABLE_CHECKING
1736 verify_cgraph_node (first_clone);