1 /* Callgraph based interprocedural optimizations.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
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 module implements main driver of compilation process as well as
23 few basic interprocedural 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
38 - varpool_finalize_variable
40 This function has same behavior as the above but is used for static
43 - cgraph_finalize_compilation_unit
45 This function is called once (source level) compilation unit is finalized
46 and it will no longer change.
48 In the the call-graph construction and local function
49 analysis takes place here. Bodies of unreachable functions are released
50 to conserve memory usage.
52 The function can be called multiple times when multiple source level
53 compilation units are combined (such as in C frontend)
57 In this unit-at-a-time compilation the intra procedural analysis takes
58 place here. In particular the static functions whose address is never
59 taken are marked as local. Backend can then use this information to
60 modify calling conventions, do better inlining or similar optimizations.
62 - cgraph_mark_needed_node
63 - varpool_mark_needed_node
65 When function or variable is referenced by some hidden way the call-graph
66 data structure must be updated accordingly by this function.
67 There should be little need to call this function and all the references
68 should be made explicit to cgraph code. At present these functions are
69 used by C++ frontend to explicitly mark the keyed methods.
71 - analyze_expr callback
73 This function is responsible for lowering tree nodes not understood by
74 generic code into understandable ones or alternatively marking
75 callgraph and varpool nodes referenced by the as needed.
77 ??? On the tree-ssa genericizing should take place here and we will avoid
78 need for these hooks (replacing them by genericizing hook)
80 Analyzing of all functions is deferred
81 to cgraph_finalize_compilation_unit and expansion into cgraph_optimize.
83 In cgraph_finalize_compilation_unit the reachable functions are
84 analyzed. During analysis the call-graph edges from reachable
85 functions are constructed and their destinations are marked as
86 reachable. References to functions and variables are discovered too
87 and variables found to be needed output to the assembly file. Via
88 mark_referenced call in assemble_variable functions referenced by
89 static variables are noticed too.
91 The intra-procedural information is produced and its existence
92 indicated by global_info_ready. Once this flag is set it is impossible
93 to change function from !reachable to reachable and thus
94 assemble_variable no longer call mark_referenced.
96 Finally the call-graph is topologically sorted and all reachable functions
97 that has not been completely inlined or are not external are output.
99 ??? It is possible that reference to function or variable is optimized
100 out. We can not deal with this nicely because topological order is not
101 suitable for it. For tree-ssa we may consider another pass doing
102 optimization and re-discovering reachable functions.
104 ??? Reorganize code so variables are output very last and only if they
105 really has been referenced by produced code, so we catch more cases
106 where reference has been optimized out. */
111 #include "coretypes.h"
115 #include "tree-flow.h"
116 #include "tree-inline.h"
117 #include "langhooks.h"
118 #include "pointer-set.h"
125 #include "diagnostic.h"
130 #include "function.h"
131 #include "ipa-prop.h"
133 #include "tree-iterator.h"
134 #include "tree-pass.h"
136 #include "coverage.h"
138 static void cgraph_expand_all_functions (void);
139 static void cgraph_mark_functions_to_output (void);
140 static void cgraph_expand_function (struct cgraph_node
*);
141 static void cgraph_output_pending_asms (void);
143 static FILE *cgraph_dump_file
;
145 /* A vector of FUNCTION_DECLs declared as static constructors. */
146 static GTY (()) VEC(tree
, gc
) *static_ctors
;
147 /* A vector of FUNCTION_DECLs declared as static destructors. */
148 static GTY (()) VEC(tree
, gc
) *static_dtors
;
150 /* When target does not have ctors and dtors, we call all constructor
151 and destructor by special initialization/destruction function
152 recognized by collect2.
154 When we are going to build this function, collect all constructors and
155 destructors and turn them into normal functions. */
158 record_cdtor_fn (tree fndecl
)
160 struct cgraph_node
*node
;
161 if (targetm
.have_ctors_dtors
162 || (!DECL_STATIC_CONSTRUCTOR (fndecl
)
163 && !DECL_STATIC_DESTRUCTOR (fndecl
)))
166 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
168 VEC_safe_push (tree
, gc
, static_ctors
, fndecl
);
169 DECL_STATIC_CONSTRUCTOR (fndecl
) = 0;
171 if (DECL_STATIC_DESTRUCTOR (fndecl
))
173 VEC_safe_push (tree
, gc
, static_dtors
, fndecl
);
174 DECL_STATIC_DESTRUCTOR (fndecl
) = 0;
176 node
= cgraph_node (fndecl
);
177 node
->local
.disregard_inline_limits
= 1;
178 cgraph_mark_reachable_node (node
);
181 /* Define global constructors/destructor functions for the CDTORS, of
182 which they are LEN. The CDTORS are sorted by initialization
183 priority. If CTOR_P is true, these are constructors; otherwise,
184 they are destructors. */
187 build_cdtor (bool ctor_p
, tree
*cdtors
, size_t len
)
196 priority_type priority
;
200 /* Find the next batch of constructors/destructors with the same
201 initialization priority. */
206 p
= ctor_p
? DECL_INIT_PRIORITY (fn
) : DECL_FINI_PRIORITY (fn
);
209 else if (p
!= priority
)
211 append_to_statement_list (build_function_call_expr (fn
, 0),
216 gcc_assert (body
!= NULL_TREE
);
217 /* Generate a function to call all the function of like
219 cgraph_build_static_cdtor (ctor_p
? 'I' : 'D', body
, priority
);
223 /* Comparison function for qsort. P1 and P2 are actually of type
224 "tree *" and point to static constructors. DECL_INIT_PRIORITY is
225 used to determine the sort order. */
228 compare_ctor (const void *p1
, const void *p2
)
235 f1
= *(const tree
*)p1
;
236 f2
= *(const tree
*)p2
;
237 priority1
= DECL_INIT_PRIORITY (f1
);
238 priority2
= DECL_INIT_PRIORITY (f2
);
240 if (priority1
< priority2
)
242 else if (priority1
> priority2
)
245 /* Ensure a stable sort. */
246 return (const tree
*)p1
- (const tree
*)p2
;
249 /* Comparison function for qsort. P1 and P2 are actually of type
250 "tree *" and point to static destructors. DECL_FINI_PRIORITY is
251 used to determine the sort order. */
254 compare_dtor (const void *p1
, const void *p2
)
261 f1
= *(const tree
*)p1
;
262 f2
= *(const tree
*)p2
;
263 priority1
= DECL_FINI_PRIORITY (f1
);
264 priority2
= DECL_FINI_PRIORITY (f2
);
266 if (priority1
< priority2
)
268 else if (priority1
> priority2
)
271 /* Ensure a stable sort. */
272 return (const tree
*)p1
- (const tree
*)p2
;
275 /* Generate functions to call static constructors and destructors
276 for targets that do not support .ctors/.dtors sections. These
277 functions have magic names which are detected by collect2. */
280 cgraph_build_cdtor_fns (void)
282 if (!VEC_empty (tree
, static_ctors
))
284 gcc_assert (!targetm
.have_ctors_dtors
);
285 qsort (VEC_address (tree
, static_ctors
),
286 VEC_length (tree
, static_ctors
),
289 build_cdtor (/*ctor_p=*/true,
290 VEC_address (tree
, static_ctors
),
291 VEC_length (tree
, static_ctors
));
292 VEC_truncate (tree
, static_ctors
, 0);
295 if (!VEC_empty (tree
, static_dtors
))
297 gcc_assert (!targetm
.have_ctors_dtors
);
298 qsort (VEC_address (tree
, static_dtors
),
299 VEC_length (tree
, static_dtors
),
302 build_cdtor (/*ctor_p=*/false,
303 VEC_address (tree
, static_dtors
),
304 VEC_length (tree
, static_dtors
));
305 VEC_truncate (tree
, static_dtors
, 0);
309 /* Determine if function DECL is needed. That is, visible to something
310 either outside this translation unit, something magic in the system
314 decide_is_function_needed (struct cgraph_node
*node
, tree decl
)
316 if (MAIN_NAME_P (DECL_NAME (decl
))
317 && TREE_PUBLIC (decl
))
319 node
->local
.externally_visible
= true;
323 /* If the user told us it is used, then it must be so. */
324 if (node
->local
.externally_visible
)
327 /* ??? If the assembler name is set by hand, it is possible to assemble
328 the name later after finalizing the function and the fact is noticed
329 in assemble_name then. This is arguably a bug. */
330 if (DECL_ASSEMBLER_NAME_SET_P (decl
)
331 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
)))
334 /* With -fkeep-inline-functions we are keeping all inline functions except
335 for extern inline ones. */
336 if (flag_keep_inline_functions
337 && DECL_DECLARED_INLINE_P (decl
)
338 && !DECL_EXTERNAL (decl
)
339 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (decl
)))
342 /* If we decided it was needed before, but at the time we didn't have
343 the body of the function available, then it's still needed. We have
344 to go back and re-check its dependencies now. */
348 /* Externally visible functions must be output. The exception is
349 COMDAT functions that must be output only when they are needed.
351 When not optimizing, also output the static functions. (see
352 PR24561), but don't do so for always_inline functions, functions
353 declared inline and nested functions. These was optimized out
354 in the original implementation and it is unclear whether we want
355 to change the behavior here. */
356 if (((TREE_PUBLIC (decl
)
357 || (!optimize
&& !node
->local
.disregard_inline_limits
358 && !DECL_DECLARED_INLINE_P (decl
)
360 && !flag_whole_program
)
361 && !DECL_COMDAT (decl
) && !DECL_EXTERNAL (decl
))
364 /* Constructors and destructors are reachable from the runtime by
366 if (DECL_STATIC_CONSTRUCTOR (decl
) || DECL_STATIC_DESTRUCTOR (decl
))
372 /* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these
373 functions into callgraph in a way so they look like ordinary reachable
374 functions inserted into callgraph already at construction time. */
377 cgraph_process_new_functions (void)
381 struct cgraph_node
*node
;
383 /* Note that this queue may grow as its being processed, as the new
384 functions may generate new ones. */
385 while (cgraph_new_nodes
)
387 node
= cgraph_new_nodes
;
389 cgraph_new_nodes
= cgraph_new_nodes
->next_needed
;
390 switch (cgraph_state
)
392 case CGRAPH_STATE_CONSTRUCTION
:
393 /* At construction time we just need to finalize function and move
394 it into reachable functions list. */
396 node
->next_needed
= NULL
;
397 cgraph_finalize_function (fndecl
, false);
398 cgraph_mark_reachable_node (node
);
402 case CGRAPH_STATE_IPA
:
403 case CGRAPH_STATE_IPA_SSA
:
404 /* When IPA optimization already started, do all essential
405 transformations that has been already performed on the whole
406 cgraph but not on this function. */
408 gimple_register_cfg_hooks ();
410 cgraph_analyze_function (node
);
411 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
412 current_function_decl
= fndecl
;
413 compute_inline_parameters (node
);
414 if ((cgraph_state
== CGRAPH_STATE_IPA_SSA
415 && !gimple_in_ssa_p (DECL_STRUCT_FUNCTION (fndecl
)))
416 /* When not optimizing, be sure we run early local passes anyway
419 execute_pass_list (pass_early_local_passes
.pass
.sub
);
420 free_dominance_info (CDI_POST_DOMINATORS
);
421 free_dominance_info (CDI_DOMINATORS
);
423 current_function_decl
= NULL
;
426 case CGRAPH_STATE_EXPANSION
:
427 /* Functions created during expansion shall be compiled
430 cgraph_expand_function (node
);
437 cgraph_call_function_insertion_hooks (node
);
442 /* As an GCC extension we allow redefinition of the function. The
443 semantics when both copies of bodies differ is not well defined.
444 We replace the old body with new body so in unit at a time mode
445 we always use new body, while in normal mode we may end up with
446 old body inlined into some functions and new body expanded and
449 ??? It may make more sense to use one body for inlining and other
450 body for expanding the function but this is difficult to do. */
453 cgraph_reset_node (struct cgraph_node
*node
)
455 /* If node->process is set, then we have already begun whole-unit analysis.
456 This is *not* testing for whether we've already emitted the function.
457 That case can be sort-of legitimately seen with real function redefinition
458 errors. I would argue that the front end should never present us with
459 such a case, but don't enforce that for now. */
460 gcc_assert (!node
->process
);
462 /* Reset our data structures so we can analyze the function again. */
463 memset (&node
->local
, 0, sizeof (node
->local
));
464 memset (&node
->global
, 0, sizeof (node
->global
));
465 memset (&node
->rtl
, 0, sizeof (node
->rtl
));
466 node
->analyzed
= false;
467 node
->local
.redefined_extern_inline
= true;
468 node
->local
.finalized
= false;
470 cgraph_node_remove_callees (node
);
472 /* We may need to re-queue the node for assembling in case
473 we already proceeded it and ignored as not needed or got
474 a re-declaration in IMA mode. */
477 struct cgraph_node
*n
;
479 for (n
= cgraph_nodes_queue
; n
; n
= n
->next_needed
)
488 cgraph_lower_function (struct cgraph_node
*node
)
492 tree_lowering_passes (node
->decl
);
493 node
->lowered
= true;
496 /* DECL has been parsed. Take it, queue it, compile it at the whim of the
497 logic in effect. If NESTED is true, then our caller cannot stand to have
498 the garbage collector run at the moment. We would need to either create
499 a new GC context, or just not compile right now. */
502 cgraph_finalize_function (tree decl
, bool nested
)
504 struct cgraph_node
*node
= cgraph_node (decl
);
506 if (node
->local
.finalized
)
507 cgraph_reset_node (node
);
509 node
->pid
= cgraph_max_pid
++;
510 notice_global_symbol (decl
);
511 node
->local
.finalized
= true;
512 node
->lowered
= DECL_STRUCT_FUNCTION (decl
)->cfg
!= NULL
;
513 record_cdtor_fn (node
->decl
);
515 lower_nested_functions (decl
);
516 gcc_assert (!node
->nested
);
518 if (decide_is_function_needed (node
, decl
))
519 cgraph_mark_needed_node (node
);
521 /* Since we reclaim unreachable nodes at the end of every language
522 level unit, we need to be conservative about possible entry points
524 if ((TREE_PUBLIC (decl
) && !DECL_COMDAT (decl
) && !DECL_EXTERNAL (decl
)))
525 cgraph_mark_reachable_node (node
);
527 /* If we've not yet emitted decl, tell the debug info about it. */
528 if (!TREE_ASM_WRITTEN (decl
))
529 (*debug_hooks
->deferred_inline_function
) (decl
);
531 /* Possibly warn about unused parameters. */
532 if (warn_unused_parameter
)
533 do_warn_unused_parameter (decl
);
539 /* C99 extern inline keywords allow changing of declaration after function
540 has been finalized. We need to re-decide if we want to mark the function as
544 cgraph_mark_if_needed (tree decl
)
546 struct cgraph_node
*node
= cgraph_node (decl
);
547 if (node
->local
.finalized
&& decide_is_function_needed (node
, decl
))
548 cgraph_mark_needed_node (node
);
551 /* Return TRUE if NODE2 is equivalent to NODE or its clone. */
553 clone_of_p (struct cgraph_node
*node
, struct cgraph_node
*node2
)
555 while (node
!= node2
&& node2
)
556 node2
= node2
->clone_of
;
557 return node2
!= NULL
;
560 /* Verify cgraph nodes of given cgraph node. */
562 verify_cgraph_node (struct cgraph_node
*node
)
564 struct cgraph_edge
*e
;
565 struct function
*this_cfun
= DECL_STRUCT_FUNCTION (node
->decl
);
566 struct function
*saved_cfun
= cfun
;
567 basic_block this_block
;
568 gimple_stmt_iterator gsi
;
569 bool error_found
= false;
571 if (errorcount
|| sorrycount
)
574 timevar_push (TV_CGRAPH_VERIFY
);
575 /* debug_generic_stmt needs correct cfun */
576 set_cfun (this_cfun
);
577 for (e
= node
->callees
; e
; e
= e
->next_callee
)
580 error ("aux field set for edge %s->%s",
581 identifier_to_locale (cgraph_node_name (e
->caller
)),
582 identifier_to_locale (cgraph_node_name (e
->callee
)));
587 error ("Execution count is negative");
590 for (e
= node
->callers
; e
; e
= e
->next_caller
)
594 error ("caller edge count is negative");
597 if (e
->frequency
< 0)
599 error ("caller edge frequency is negative");
602 if (e
->frequency
> CGRAPH_FREQ_MAX
)
604 error ("caller edge frequency is too large");
607 if (!e
->inline_failed
)
609 if (node
->global
.inlined_to
610 != (e
->caller
->global
.inlined_to
611 ? e
->caller
->global
.inlined_to
: e
->caller
))
613 error ("inlined_to pointer is wrong");
616 if (node
->callers
->next_caller
)
618 error ("multiple inline callers");
623 if (node
->global
.inlined_to
)
625 error ("inlined_to pointer set for noninline callers");
629 if (!node
->callers
&& node
->global
.inlined_to
)
631 error ("inlined_to pointer is set but no predecessors found");
634 if (node
->global
.inlined_to
== node
)
636 error ("inlined_to pointer refers to itself");
640 if (!cgraph_node (node
->decl
))
642 error ("node not found in cgraph_hash");
648 struct cgraph_node
*n
;
649 for (n
= node
->clone_of
->clones
; n
; n
= n
->next_sibling_clone
)
654 error ("node has wrong clone_of");
660 struct cgraph_node
*n
;
661 for (n
= node
->clones
; n
; n
= n
->next_sibling_clone
)
662 if (n
->clone_of
!= node
)
666 error ("node has wrong clone list");
670 if ((node
->prev_sibling_clone
|| node
->next_sibling_clone
) && !node
->clone_of
)
672 error ("node is in clone list but it is not clone");
675 if (!node
->prev_sibling_clone
&& node
->clone_of
&& node
->clone_of
->clones
!= node
)
677 error ("node has wrong prev_clone pointer");
680 if (node
->prev_sibling_clone
&& node
->prev_sibling_clone
->next_sibling_clone
!= node
)
682 error ("double linked list of clones corrupted");
686 if (node
->analyzed
&& gimple_has_body_p (node
->decl
)
687 && !TREE_ASM_WRITTEN (node
->decl
)
688 && (!DECL_EXTERNAL (node
->decl
) || node
->global
.inlined_to
))
692 /* The nodes we're interested in are never shared, so walk
693 the tree ignoring duplicates. */
694 struct pointer_set_t
*visited_nodes
= pointer_set_create ();
695 /* Reach the trees by walking over the CFG, and note the
696 enclosing basic-blocks in the call edges. */
697 FOR_EACH_BB_FN (this_block
, this_cfun
)
698 for (gsi
= gsi_start_bb (this_block
);
702 gimple stmt
= gsi_stmt (gsi
);
704 if (is_gimple_call (stmt
) && (decl
= gimple_call_fndecl (stmt
)))
706 struct cgraph_edge
*e
= cgraph_edge (node
, stmt
);
711 error ("shared call_stmt:");
712 debug_gimple_stmt (stmt
);
715 if (!clone_of_p (cgraph_node (decl
), e
->callee
)
716 && !e
->callee
->global
.inlined_to
)
718 error ("edge points to wrong declaration:");
719 debug_tree (e
->callee
->decl
);
720 fprintf (stderr
," Instead of:");
727 error ("missing callgraph edge for call stmt:");
728 debug_gimple_stmt (stmt
);
733 pointer_set_destroy (visited_nodes
);
736 /* No CFG available?! */
739 for (e
= node
->callees
; e
; e
= e
->next_callee
)
741 if (!e
->aux
&& !e
->indirect_call
)
743 error ("edge %s->%s has no corresponding call_stmt",
744 identifier_to_locale (cgraph_node_name (e
->caller
)),
745 identifier_to_locale (cgraph_node_name (e
->callee
)));
746 debug_gimple_stmt (e
->call_stmt
);
754 dump_cgraph_node (stderr
, node
);
755 internal_error ("verify_cgraph_node failed");
757 set_cfun (saved_cfun
);
758 timevar_pop (TV_CGRAPH_VERIFY
);
761 /* Verify whole cgraph structure. */
765 struct cgraph_node
*node
;
767 if (sorrycount
|| errorcount
)
770 for (node
= cgraph_nodes
; node
; node
= node
->next
)
771 verify_cgraph_node (node
);
774 /* Output all asm statements we have stored up to be output. */
777 cgraph_output_pending_asms (void)
779 struct cgraph_asm_node
*can
;
781 if (errorcount
|| sorrycount
)
784 for (can
= cgraph_asm_nodes
; can
; can
= can
->next
)
785 assemble_asm (can
->asm_str
);
786 cgraph_asm_nodes
= NULL
;
789 /* Analyze the function scheduled to be output. */
791 cgraph_analyze_function (struct cgraph_node
*node
)
793 tree decl
= node
->decl
;
795 current_function_decl
= decl
;
796 push_cfun (DECL_STRUCT_FUNCTION (decl
));
797 cgraph_lower_function (node
);
798 node
->analyzed
= true;
801 current_function_decl
= NULL
;
804 /* Look for externally_visible and used attributes and mark cgraph nodes
807 We cannot mark the nodes at the point the attributes are processed (in
808 handle_*_attribute) because the copy of the declarations available at that
809 point may not be canonical. For example, in:
812 void f() __attribute__((used));
814 the declaration we see in handle_used_attribute will be the second
815 declaration -- but the front end will subsequently merge that declaration
816 with the original declaration and discard the second declaration.
818 Furthermore, we can't mark these nodes in cgraph_finalize_function because:
821 void f() __attribute__((externally_visible));
825 So, we walk the nodes at the end of the translation unit, applying the
826 attributes at that point. */
829 process_function_and_variable_attributes (struct cgraph_node
*first
,
830 struct varpool_node
*first_var
)
832 struct cgraph_node
*node
;
833 struct varpool_node
*vnode
;
835 for (node
= cgraph_nodes
; node
!= first
; node
= node
->next
)
837 tree decl
= node
->decl
;
838 if (lookup_attribute ("used", DECL_ATTRIBUTES (decl
)))
840 mark_decl_referenced (decl
);
841 if (node
->local
.finalized
)
842 cgraph_mark_needed_node (node
);
844 if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl
)))
846 if (! TREE_PUBLIC (node
->decl
))
847 warning (OPT_Wattributes
,
848 "%J%<externally_visible%> attribute have effect only on public objects",
852 if (node
->local
.finalized
)
853 cgraph_mark_needed_node (node
);
854 node
->local
.externally_visible
= true;
858 for (vnode
= varpool_nodes
; vnode
!= first_var
; vnode
= vnode
->next
)
860 tree decl
= vnode
->decl
;
861 if (lookup_attribute ("used", DECL_ATTRIBUTES (decl
)))
863 mark_decl_referenced (decl
);
864 if (vnode
->finalized
)
865 varpool_mark_needed_node (vnode
);
867 if (lookup_attribute ("externally_visible", DECL_ATTRIBUTES (decl
)))
869 if (! TREE_PUBLIC (vnode
->decl
))
870 warning (OPT_Wattributes
,
871 "%J%<externally_visible%> attribute have effect only on public objects",
875 if (vnode
->finalized
)
876 varpool_mark_needed_node (vnode
);
877 vnode
->externally_visible
= true;
883 /* Process CGRAPH_NODES_NEEDED queue, analyze each function (and transitively
884 each reachable functions) and build cgraph.
885 The function can be called multiple times after inserting new nodes
886 into beginning of queue. Just the new part of queue is re-scanned then. */
889 cgraph_analyze_functions (void)
891 /* Keep track of already processed nodes when called multiple times for
892 intermodule optimization. */
893 static struct cgraph_node
*first_analyzed
;
894 struct cgraph_node
*first_processed
= first_analyzed
;
895 static struct varpool_node
*first_analyzed_var
;
896 struct cgraph_node
*node
, *next
;
898 process_function_and_variable_attributes (first_processed
,
900 first_processed
= cgraph_nodes
;
901 first_analyzed_var
= varpool_nodes
;
902 varpool_analyze_pending_decls ();
903 if (cgraph_dump_file
)
905 fprintf (cgraph_dump_file
, "Initial entry points:");
906 for (node
= cgraph_nodes
; node
!= first_analyzed
; node
= node
->next
)
908 fprintf (cgraph_dump_file
, " %s", cgraph_node_name (node
));
909 fprintf (cgraph_dump_file
, "\n");
911 cgraph_process_new_functions ();
913 /* Propagate reachability flag and lower representation of all reachable
914 functions. In the future, lowering will introduce new functions and
915 new entry points on the way (by template instantiation and virtual
916 method table generation for instance). */
917 while (cgraph_nodes_queue
)
919 struct cgraph_edge
*edge
;
920 tree decl
= cgraph_nodes_queue
->decl
;
922 node
= cgraph_nodes_queue
;
923 cgraph_nodes_queue
= cgraph_nodes_queue
->next_needed
;
924 node
->next_needed
= NULL
;
926 /* ??? It is possible to create extern inline function and later using
927 weak alias attribute to kill its body. See
928 gcc.c-torture/compile/20011119-1.c */
929 if (!DECL_STRUCT_FUNCTION (decl
))
931 cgraph_reset_node (node
);
935 gcc_assert (!node
->analyzed
&& node
->reachable
);
936 gcc_assert (gimple_body (decl
));
938 cgraph_analyze_function (node
);
940 for (edge
= node
->callees
; edge
; edge
= edge
->next_callee
)
941 if (!edge
->callee
->reachable
)
942 cgraph_mark_reachable_node (edge
->callee
);
944 /* If decl is a clone of an abstract function, mark that abstract
945 function so that we don't release its body. The DECL_INITIAL() of that
946 abstract function declaration will be later needed to output debug info. */
947 if (DECL_ABSTRACT_ORIGIN (decl
))
949 struct cgraph_node
*origin_node
= cgraph_node (DECL_ABSTRACT_ORIGIN (decl
));
950 origin_node
->abstract_and_needed
= true;
953 /* We finalize local static variables during constructing callgraph
954 edges. Process their attributes too. */
955 process_function_and_variable_attributes (first_processed
,
957 first_processed
= cgraph_nodes
;
958 first_analyzed_var
= varpool_nodes
;
959 varpool_analyze_pending_decls ();
960 cgraph_process_new_functions ();
963 /* Collect entry points to the unit. */
964 if (cgraph_dump_file
)
966 fprintf (cgraph_dump_file
, "Unit entry points:");
967 for (node
= cgraph_nodes
; node
!= first_analyzed
; node
= node
->next
)
969 fprintf (cgraph_dump_file
, " %s", cgraph_node_name (node
));
970 fprintf (cgraph_dump_file
, "\n\nInitial ");
971 dump_cgraph (cgraph_dump_file
);
974 if (cgraph_dump_file
)
975 fprintf (cgraph_dump_file
, "\nReclaiming functions:");
977 for (node
= cgraph_nodes
; node
!= first_analyzed
; node
= next
)
979 tree decl
= node
->decl
;
982 if (node
->local
.finalized
&& !gimple_has_body_p (decl
))
983 cgraph_reset_node (node
);
985 if (!node
->reachable
&& gimple_has_body_p (decl
))
987 if (cgraph_dump_file
)
988 fprintf (cgraph_dump_file
, " %s", cgraph_node_name (node
));
989 cgraph_remove_node (node
);
993 node
->next_needed
= NULL
;
994 gcc_assert (!node
->local
.finalized
|| gimple_has_body_p (decl
));
995 gcc_assert (node
->analyzed
== node
->local
.finalized
);
997 if (cgraph_dump_file
)
999 fprintf (cgraph_dump_file
, "\n\nReclaimed ");
1000 dump_cgraph (cgraph_dump_file
);
1002 first_analyzed
= cgraph_nodes
;
1006 /* Analyze the whole compilation unit once it is parsed completely. */
1009 cgraph_finalize_compilation_unit (void)
1011 if (errorcount
|| sorrycount
)
1014 finish_aliases_1 ();
1018 fprintf (stderr
, "\nAnalyzing compilation unit\n");
1022 timevar_push (TV_CGRAPH
);
1023 cgraph_analyze_functions ();
1024 timevar_pop (TV_CGRAPH
);
1028 /* Figure out what functions we want to assemble. */
1031 cgraph_mark_functions_to_output (void)
1033 struct cgraph_node
*node
;
1035 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1037 tree decl
= node
->decl
;
1038 struct cgraph_edge
*e
;
1040 gcc_assert (!node
->process
);
1042 for (e
= node
->callers
; e
; e
= e
->next_caller
)
1043 if (e
->inline_failed
)
1046 /* We need to output all local functions that are used and not
1047 always inlined, as well as those that are reachable from
1048 outside the current compilation unit. */
1050 && !node
->global
.inlined_to
1052 || (e
&& node
->reachable
))
1053 && !TREE_ASM_WRITTEN (decl
)
1054 && !DECL_EXTERNAL (decl
))
1058 /* We should've reclaimed all functions that are not needed. */
1059 #ifdef ENABLE_CHECKING
1060 if (!node
->global
.inlined_to
1061 && gimple_has_body_p (decl
)
1062 && !DECL_EXTERNAL (decl
))
1064 dump_cgraph_node (stderr
, node
);
1065 internal_error ("failed to reclaim unneeded function");
1068 gcc_assert (node
->global
.inlined_to
1069 || !gimple_has_body_p (decl
)
1070 || DECL_EXTERNAL (decl
));
1077 /* Expand function specified by NODE. */
1080 cgraph_expand_function (struct cgraph_node
*node
)
1082 tree decl
= node
->decl
;
1084 /* We ought to not compile any inline clones. */
1085 gcc_assert (!node
->global
.inlined_to
);
1087 announce_function (decl
);
1090 gcc_assert (node
->lowered
);
1092 /* Generate RTL for the body of DECL. */
1093 if (lang_hooks
.callgraph
.emit_associated_thunks
)
1094 lang_hooks
.callgraph
.emit_associated_thunks (decl
);
1095 tree_rest_of_compilation (decl
);
1097 /* Make sure that BE didn't give up on compiling. */
1098 gcc_assert (TREE_ASM_WRITTEN (decl
));
1099 current_function_decl
= NULL
;
1100 gcc_assert (!cgraph_preserve_function_body_p (decl
));
1101 cgraph_release_function_body (node
);
1102 /* Eliminate all call edges. This is important so the GIMPLE_CALL no longer
1103 points to the dead function body. */
1104 cgraph_node_remove_callees (node
);
1106 cgraph_function_flags_ready
= true;
1109 /* Return true when CALLER_DECL should be inlined into CALLEE_DECL. */
1112 cgraph_inline_p (struct cgraph_edge
*e
, cgraph_inline_failed_t
*reason
)
1114 *reason
= e
->inline_failed
;
1115 return !e
->inline_failed
;
1120 /* Expand all functions that must be output.
1122 Attempt to topologically sort the nodes so function is output when
1123 all called functions are already assembled to allow data to be
1124 propagated across the callgraph. Use a stack to get smaller distance
1125 between a function and its callees (later we may choose to use a more
1126 sophisticated algorithm for function reordering; we will likely want
1127 to use subsections to make the output functions appear in top-down
1131 cgraph_expand_all_functions (void)
1133 struct cgraph_node
*node
;
1134 struct cgraph_node
**order
= XCNEWVEC (struct cgraph_node
*, cgraph_n_nodes
);
1135 int order_pos
, new_order_pos
= 0;
1138 order_pos
= cgraph_postorder (order
);
1139 gcc_assert (order_pos
== cgraph_n_nodes
);
1141 /* Garbage collector may remove inline clones we eliminate during
1142 optimization. So we must be sure to not reference them. */
1143 for (i
= 0; i
< order_pos
; i
++)
1144 if (order
[i
]->process
)
1145 order
[new_order_pos
++] = order
[i
];
1147 for (i
= new_order_pos
- 1; i
>= 0; i
--)
1152 gcc_assert (node
->reachable
);
1154 cgraph_expand_function (node
);
1157 cgraph_process_new_functions ();
1163 /* This is used to sort the node types by the cgraph order number. */
1165 enum cgraph_order_sort_kind
1167 ORDER_UNDEFINED
= 0,
1173 struct cgraph_order_sort
1175 enum cgraph_order_sort_kind kind
;
1178 struct cgraph_node
*f
;
1179 struct varpool_node
*v
;
1180 struct cgraph_asm_node
*a
;
1184 /* Output all functions, variables, and asm statements in the order
1185 according to their order fields, which is the order in which they
1186 appeared in the file. This implements -fno-toplevel-reorder. In
1187 this mode we may output functions and variables which don't really
1188 need to be output. */
1191 cgraph_output_in_order (void)
1195 struct cgraph_order_sort
*nodes
;
1197 struct cgraph_node
*pf
;
1198 struct varpool_node
*pv
;
1199 struct cgraph_asm_node
*pa
;
1202 size
= max
* sizeof (struct cgraph_order_sort
);
1203 nodes
= (struct cgraph_order_sort
*) alloca (size
);
1204 memset (nodes
, 0, size
);
1206 varpool_analyze_pending_decls ();
1208 for (pf
= cgraph_nodes
; pf
; pf
= pf
->next
)
1213 gcc_assert (nodes
[i
].kind
== ORDER_UNDEFINED
);
1214 nodes
[i
].kind
= ORDER_FUNCTION
;
1219 for (pv
= varpool_nodes_queue
; pv
; pv
= pv
->next_needed
)
1222 gcc_assert (nodes
[i
].kind
== ORDER_UNDEFINED
);
1223 nodes
[i
].kind
= ORDER_VAR
;
1227 for (pa
= cgraph_asm_nodes
; pa
; pa
= pa
->next
)
1230 gcc_assert (nodes
[i
].kind
== ORDER_UNDEFINED
);
1231 nodes
[i
].kind
= ORDER_ASM
;
1235 /* In toplevel reorder mode we output all statics; mark them as needed. */
1236 for (i
= 0; i
< max
; ++i
)
1238 if (nodes
[i
].kind
== ORDER_VAR
)
1240 varpool_mark_needed_node (nodes
[i
].u
.v
);
1243 varpool_empty_needed_queue ();
1245 for (i
= 0; i
< max
; ++i
)
1247 switch (nodes
[i
].kind
)
1249 case ORDER_FUNCTION
:
1250 nodes
[i
].u
.f
->process
= 0;
1251 cgraph_expand_function (nodes
[i
].u
.f
);
1255 varpool_assemble_decl (nodes
[i
].u
.v
);
1259 assemble_asm (nodes
[i
].u
.a
->asm_str
);
1262 case ORDER_UNDEFINED
:
1270 cgraph_asm_nodes
= NULL
;
1273 /* Return true when function body of DECL still needs to be kept around
1274 for later re-use. */
1276 cgraph_preserve_function_body_p (tree decl
)
1278 struct cgraph_node
*node
;
1280 gcc_assert (cgraph_global_info_ready
);
1281 /* Look if there is any clone around. */
1282 node
= cgraph_node (decl
);
1292 current_function_decl
= NULL
;
1293 gimple_register_cfg_hooks ();
1294 bitmap_obstack_initialize (NULL
);
1295 execute_ipa_pass_list (all_ipa_passes
);
1297 /* Generate coverage variables and constructors. */
1300 /* Process new functions added. */
1302 current_function_decl
= NULL
;
1303 cgraph_process_new_functions ();
1305 bitmap_obstack_release (NULL
);
1308 /* Perform simple optimizations based on callgraph. */
1311 cgraph_optimize (void)
1313 if (errorcount
|| sorrycount
)
1316 #ifdef ENABLE_CHECKING
1320 /* Call functions declared with the "constructor" or "destructor"
1322 cgraph_build_cdtor_fns ();
1324 /* Frontend may output common variables after the unit has been finalized.
1325 It is safe to deal with them here as they are always zero initialized. */
1326 varpool_analyze_pending_decls ();
1327 cgraph_analyze_functions ();
1329 timevar_push (TV_CGRAPHOPT
);
1330 if (pre_ipa_mem_report
)
1332 fprintf (stderr
, "Memory consumption before IPA\n");
1333 dump_memory_report (false);
1336 fprintf (stderr
, "Performing interprocedural optimizations\n");
1337 cgraph_state
= CGRAPH_STATE_IPA
;
1339 /* Don't run the IPA passes if there was any error or sorry messages. */
1340 if (errorcount
== 0 && sorrycount
== 0)
1343 /* This pass remove bodies of extern inline functions we never inlined.
1344 Do this later so other IPA passes see what is really going on. */
1345 cgraph_remove_unreachable_nodes (false, dump_file
);
1346 cgraph_global_info_ready
= true;
1347 if (cgraph_dump_file
)
1349 fprintf (cgraph_dump_file
, "Optimized ");
1350 dump_cgraph (cgraph_dump_file
);
1351 dump_varpool (cgraph_dump_file
);
1353 if (post_ipa_mem_report
)
1355 fprintf (stderr
, "Memory consumption after IPA\n");
1356 dump_memory_report (false);
1358 timevar_pop (TV_CGRAPHOPT
);
1360 /* Output everything. */
1362 fprintf (stderr
, "Assembling functions:\n");
1363 #ifdef ENABLE_CHECKING
1367 cgraph_materialize_all_clones ();
1368 cgraph_mark_functions_to_output ();
1370 cgraph_state
= CGRAPH_STATE_EXPANSION
;
1371 if (!flag_toplevel_reorder
)
1372 cgraph_output_in_order ();
1375 cgraph_output_pending_asms ();
1377 cgraph_expand_all_functions ();
1378 varpool_remove_unreferenced_decls ();
1380 varpool_assemble_pending_decls ();
1382 cgraph_process_new_functions ();
1383 cgraph_state
= CGRAPH_STATE_FINISHED
;
1385 if (cgraph_dump_file
)
1387 fprintf (cgraph_dump_file
, "\nFinal ");
1388 dump_cgraph (cgraph_dump_file
);
1390 #ifdef ENABLE_CHECKING
1392 /* Double check that all inline clones are gone and that all
1393 function bodies have been released from memory. */
1394 if (!(sorrycount
|| errorcount
))
1396 struct cgraph_node
*node
;
1397 bool error_found
= false;
1399 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1401 && (node
->global
.inlined_to
1402 || gimple_has_body_p (node
->decl
)))
1405 dump_cgraph_node (stderr
, node
);
1408 internal_error ("nodes with unreleased memory found");
1412 /* Generate and emit a static constructor or destructor. WHICH must
1413 be one of 'I' (for a constructor) or 'D' (for a destructor). BODY
1414 is a STATEMENT_LIST containing GENERIC statements. PRIORITY is the
1415 initialization priority for this constructor or destructor. */
1418 cgraph_build_static_cdtor (char which
, tree body
, int priority
)
1420 static int counter
= 0;
1422 tree decl
, name
, resdecl
;
1424 /* The priority is encoded in the constructor or destructor name.
1425 collect2 will sort the names and arrange that they are called at
1427 sprintf (which_buf
, "%c_%.5d_%d", which
, priority
, counter
++);
1428 name
= get_file_function_name (which_buf
);
1430 decl
= build_decl (FUNCTION_DECL
, name
,
1431 build_function_type (void_type_node
, void_list_node
));
1432 current_function_decl
= decl
;
1434 resdecl
= build_decl (RESULT_DECL
, NULL_TREE
, void_type_node
);
1435 DECL_ARTIFICIAL (resdecl
) = 1;
1436 DECL_RESULT (decl
) = resdecl
;
1437 DECL_CONTEXT (resdecl
) = decl
;
1439 allocate_struct_function (decl
, false);
1441 TREE_STATIC (decl
) = 1;
1442 TREE_USED (decl
) = 1;
1443 DECL_ARTIFICIAL (decl
) = 1;
1444 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
1445 DECL_SAVED_TREE (decl
) = body
;
1446 TREE_PUBLIC (decl
) = ! targetm
.have_ctors_dtors
;
1447 DECL_UNINLINABLE (decl
) = 1;
1449 DECL_INITIAL (decl
) = make_node (BLOCK
);
1450 TREE_USED (DECL_INITIAL (decl
)) = 1;
1452 DECL_SOURCE_LOCATION (decl
) = input_location
;
1453 cfun
->function_end_locus
= input_location
;
1458 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
1459 decl_init_priority_insert (decl
, priority
);
1462 DECL_STATIC_DESTRUCTOR (decl
) = 1;
1463 decl_fini_priority_insert (decl
, priority
);
1469 gimplify_function_tree (decl
);
1471 cgraph_add_new_function (decl
, false);
1472 cgraph_mark_needed_node (cgraph_node (decl
));
1479 cgraph_dump_file
= dump_begin (TDI_cgraph
, NULL
);
1482 /* The edges representing the callers of the NEW_VERSION node were
1483 fixed by cgraph_function_versioning (), now the call_expr in their
1484 respective tree code should be updated to call the NEW_VERSION. */
1487 update_call_expr (struct cgraph_node
*new_version
)
1489 struct cgraph_edge
*e
;
1491 gcc_assert (new_version
);
1493 /* Update the call expr on the edges to call the new version. */
1494 for (e
= new_version
->callers
; e
; e
= e
->next_caller
)
1496 struct function
*inner_function
= DECL_STRUCT_FUNCTION (e
->caller
->decl
);
1497 gimple_call_set_fndecl (e
->call_stmt
, new_version
->decl
);
1498 /* Update EH information too, just in case. */
1499 if (!stmt_could_throw_p (e
->call_stmt
)
1500 && lookup_stmt_eh_region_fn (inner_function
, e
->call_stmt
))
1501 remove_stmt_from_eh_region_fn (inner_function
, e
->call_stmt
);
1506 /* Create a new cgraph node which is the new version of
1507 OLD_VERSION node. REDIRECT_CALLERS holds the callers
1508 edges which should be redirected to point to
1509 NEW_VERSION. ALL the callees edges of OLD_VERSION
1510 are cloned to the new version node. Return the new
1513 static struct cgraph_node
*
1514 cgraph_copy_node_for_versioning (struct cgraph_node
*old_version
,
1516 VEC(cgraph_edge_p
,heap
) *redirect_callers
)
1518 struct cgraph_node
*new_version
;
1519 struct cgraph_edge
*e
, *new_e
;
1520 struct cgraph_edge
*next_callee
;
1523 gcc_assert (old_version
);
1525 new_version
= cgraph_node (new_decl
);
1527 new_version
->analyzed
= true;
1528 new_version
->local
= old_version
->local
;
1529 new_version
->global
= old_version
->global
;
1530 new_version
->rtl
= new_version
->rtl
;
1531 new_version
->reachable
= true;
1532 new_version
->count
= old_version
->count
;
1534 /* Clone the old node callees. Recursive calls are
1536 for (e
= old_version
->callees
;e
; e
=e
->next_callee
)
1538 new_e
= cgraph_clone_edge (e
, new_version
, e
->call_stmt
, 0, e
->frequency
,
1539 e
->loop_nest
, true);
1540 new_e
->count
= e
->count
;
1542 /* Fix recursive calls.
1543 If OLD_VERSION has a recursive call after the
1544 previous edge cloning, the new version will have an edge
1545 pointing to the old version, which is wrong;
1546 Redirect it to point to the new version. */
1547 for (e
= new_version
->callees
; e
; e
= next_callee
)
1549 next_callee
= e
->next_callee
;
1550 if (e
->callee
== old_version
)
1551 cgraph_redirect_edge_callee (e
, new_version
);
1556 for (i
= 0; VEC_iterate (cgraph_edge_p
, redirect_callers
, i
, e
); i
++)
1558 /* Redirect calls to the old version node to point to its new
1560 cgraph_redirect_edge_callee (e
, new_version
);
1566 /* Perform function versioning.
1567 Function versioning includes copying of the tree and
1568 a callgraph update (creating a new cgraph node and updating
1569 its callees and callers).
1571 REDIRECT_CALLERS varray includes the edges to be redirected
1574 TREE_MAP is a mapping of tree nodes we want to replace with
1575 new ones (according to results of prior analysis).
1576 OLD_VERSION_NODE is the node that is versioned.
1577 It returns the new version's cgraph node.
1578 ARGS_TO_SKIP lists arguments to be omitted from functions
1581 struct cgraph_node
*
1582 cgraph_function_versioning (struct cgraph_node
*old_version_node
,
1583 VEC(cgraph_edge_p
,heap
) *redirect_callers
,
1584 VEC (ipa_replace_map_p
,gc
)* tree_map
,
1585 bitmap args_to_skip
)
1587 tree old_decl
= old_version_node
->decl
;
1588 struct cgraph_node
*new_version_node
= NULL
;
1591 if (!tree_versionable_function_p (old_decl
))
1594 /* Make a new FUNCTION_DECL tree node for the
1597 new_decl
= copy_node (old_decl
);
1599 new_decl
= build_function_decl_skip_args (old_decl
, args_to_skip
);
1601 /* Create the new version's call-graph node.
1602 and update the edges of the new node. */
1604 cgraph_copy_node_for_versioning (old_version_node
, new_decl
,
1607 /* Copy the OLD_VERSION_NODE function tree to the new version. */
1608 tree_function_versioning (old_decl
, new_decl
, tree_map
, false, args_to_skip
);
1610 /* Update the new version's properties.
1611 Make The new version visible only within this translation unit. Make sure
1612 that is not weak also.
1613 ??? We cannot use COMDAT linkage because there is no
1614 ABI support for this. */
1615 DECL_EXTERNAL (new_version_node
->decl
) = 0;
1616 DECL_ONE_ONLY (new_version_node
->decl
) = 0;
1617 TREE_PUBLIC (new_version_node
->decl
) = 0;
1618 DECL_COMDAT (new_version_node
->decl
) = 0;
1619 DECL_WEAK (new_version_node
->decl
) = 0;
1620 DECL_VIRTUAL_P (new_version_node
->decl
) = 0;
1621 new_version_node
->local
.externally_visible
= 0;
1622 new_version_node
->local
.local
= 1;
1623 new_version_node
->lowered
= true;
1625 /* Update the call_expr on the edges to call the new version node. */
1626 update_call_expr (new_version_node
);
1628 cgraph_call_function_insertion_hooks (new_version_node
);
1629 return new_version_node
;
1632 /* Produce separate function body for inline clones so the offline copy can be
1633 modified without affecting them. */
1634 struct cgraph_node
*
1635 save_inline_function_body (struct cgraph_node
*node
)
1637 struct cgraph_node
*first_clone
, *n
;
1639 gcc_assert (node
== cgraph_node (node
->decl
));
1641 cgraph_lower_function (node
);
1643 first_clone
= node
->clones
;
1645 first_clone
->decl
= copy_node (node
->decl
);
1646 cgraph_insert_node_to_hashtable (first_clone
);
1647 gcc_assert (first_clone
== cgraph_node (first_clone
->decl
));
1648 if (first_clone
->next_sibling_clone
)
1650 for (n
= first_clone
->next_sibling_clone
; n
->next_sibling_clone
; n
= n
->next_sibling_clone
)
1651 n
->clone_of
= first_clone
;
1652 n
->clone_of
= first_clone
;
1653 n
->next_sibling_clone
= first_clone
->clones
;
1654 if (first_clone
->clones
)
1655 first_clone
->clones
->prev_sibling_clone
= n
;
1656 first_clone
->clones
= first_clone
->next_sibling_clone
;
1657 first_clone
->next_sibling_clone
->prev_sibling_clone
= NULL
;
1658 first_clone
->next_sibling_clone
= NULL
;
1659 gcc_assert (!first_clone
->prev_sibling_clone
);
1661 first_clone
->clone_of
= NULL
;
1662 node
->clones
= NULL
;
1664 if (first_clone
->clones
)
1665 for (n
= first_clone
->clones
; n
!= first_clone
;)
1667 gcc_assert (n
->decl
== node
->decl
);
1668 n
->decl
= first_clone
->decl
;
1671 else if (n
->next_sibling_clone
)
1672 n
= n
->next_sibling_clone
;
1675 while (n
!= first_clone
&& !n
->next_sibling_clone
)
1677 if (n
!= first_clone
)
1678 n
= n
->next_sibling_clone
;
1682 /* Copy the OLD_VERSION_NODE function tree to the new version. */
1683 tree_function_versioning (node
->decl
, first_clone
->decl
, NULL
, true, NULL
);
1685 DECL_EXTERNAL (first_clone
->decl
) = 0;
1686 DECL_ONE_ONLY (first_clone
->decl
) = 0;
1687 TREE_PUBLIC (first_clone
->decl
) = 0;
1688 DECL_COMDAT (first_clone
->decl
) = 0;
1690 #ifdef ENABLE_CHECKING
1691 verify_cgraph_node (first_clone
);
1696 /* Given virtual clone, turn it into actual clone. */
1698 cgraph_materialize_clone (struct cgraph_node
*node
)
1700 bitmap_obstack_initialize (NULL
);
1701 /* Copy the OLD_VERSION_NODE function tree to the new version. */
1702 tree_function_versioning (node
->clone_of
->decl
, node
->decl
,
1703 node
->clone
.tree_map
, true,
1704 node
->clone
.args_to_skip
);
1706 /* Function is no longer clone. */
1707 if (node
->next_sibling_clone
)
1708 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
1709 if (node
->prev_sibling_clone
)
1710 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
1712 node
->clone_of
->clones
= node
->next_sibling_clone
;
1713 node
->next_sibling_clone
= NULL
;
1714 node
->prev_sibling_clone
= NULL
;
1715 node
->clone_of
= NULL
;
1716 bitmap_obstack_release (NULL
);
1719 /* Once all functions from compilation unit are in memory, produce all clones
1720 and update all calls.
1721 We might also do this on demand if we don't want to bring all functions to
1722 memory prior compilation, but current WHOPR implementation does that and it is
1723 is bit easier to keep everything right in this order. */
1725 cgraph_materialize_all_clones (void)
1727 struct cgraph_node
*node
;
1728 bool stabilized
= false;
1730 if (cgraph_dump_file
)
1731 fprintf (cgraph_dump_file
, "Materializing clones\n");
1732 #ifdef ENABLE_CHECKING
1736 /* We can also do topological order, but number of iterations should be
1737 bounded by number of IPA passes since single IPA pass is probably not
1738 going to create clones of clones it created itself. */
1742 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1744 if (node
->clone_of
&& node
->decl
!= node
->clone_of
->decl
1745 && !gimple_has_body_p (node
->decl
))
1747 if (gimple_has_body_p (node
->clone_of
->decl
))
1749 if (cgraph_dump_file
)
1750 fprintf (cgraph_dump_file
, " clonning %s to %s",
1751 cgraph_node_name (node
->clone_of
),
1752 cgraph_node_name (node
));
1753 cgraph_materialize_clone (node
);
1760 if (cgraph_dump_file
)
1761 fprintf (cgraph_dump_file
, "Updating call sites\n");
1762 for (node
= cgraph_nodes
; node
; node
= node
->next
)
1763 if (node
->analyzed
&& gimple_has_body_p (node
->decl
)
1764 && (!node
->clone_of
|| node
->clone_of
->decl
!= node
->decl
))
1766 struct cgraph_edge
*e
;
1768 current_function_decl
= node
->decl
;
1769 push_cfun (DECL_STRUCT_FUNCTION (node
->decl
));
1770 for (e
= node
->callees
; e
; e
= e
->next_callee
)
1772 tree decl
= gimple_call_fndecl (e
->call_stmt
);
1773 /* When function gets inlined, indirect inlining might've invented
1774 new edge for orginally indirect stmt. Since we are not
1775 preserving clones in the original form, we must not update here
1776 since other inline clones don't need to contain call to the same
1777 call. Inliner will do the substitution for us later. */
1778 if (decl
&& decl
!= e
->callee
->decl
)
1781 gimple_stmt_iterator gsi
;
1783 if (cgraph_dump_file
)
1785 fprintf (cgraph_dump_file
, "updating call of %s in %s:",
1786 cgraph_node_name (node
),
1787 cgraph_node_name (e
->callee
));
1788 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1791 if (e
->callee
->clone
.args_to_skip
)
1792 new_stmt
= gimple_call_copy_skip_args (e
->call_stmt
,
1793 e
->callee
->clone
.args_to_skip
);
1795 new_stmt
= e
->call_stmt
;
1796 if (gimple_vdef (new_stmt
)
1797 && TREE_CODE (gimple_vdef (new_stmt
)) == SSA_NAME
)
1798 SSA_NAME_DEF_STMT (gimple_vdef (new_stmt
)) = new_stmt
;
1799 gimple_call_set_fndecl (new_stmt
, e
->callee
->decl
);
1801 gsi
= gsi_for_stmt (e
->call_stmt
);
1802 gsi_replace (&gsi
, new_stmt
, true);
1804 /* Update EH information too, just in case. */
1805 if (!stmt_could_throw_p (new_stmt
)
1806 && lookup_stmt_eh_region (new_stmt
))
1807 remove_stmt_from_eh_region (new_stmt
);
1809 cgraph_set_call_stmt_including_clones (node
, e
->call_stmt
, new_stmt
);
1811 if (cgraph_dump_file
)
1813 fprintf (cgraph_dump_file
, " updated to:");
1814 print_gimple_stmt (cgraph_dump_file
, e
->call_stmt
, 0, dump_flags
);
1819 current_function_decl
= NULL
;
1820 #ifdef ENABLE_CHECKING
1821 verify_cgraph_node (node
);
1824 #ifdef ENABLE_CHECKING
1827 cgraph_remove_unreachable_nodes (false, cgraph_dump_file
);
1830 #include "gt-cgraphunit.h"