2 Copyright (C) 2003-2014 Free Software Foundation, Inc.
3 Contributed by Jan Hubicka
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This module provide facilities for clonning functions. I.e. creating
22 new functions based on existing functions with simple modifications,
23 such as replacement of parameters.
25 To allow whole program optimization without actual presence of function
26 bodies, an additional infrastructure is provided for so-called virtual
29 A virtual clone in the callgraph is a function that has no
30 associated body, just a description of how to create its body based
31 on a different function (which itself may be a virtual clone).
33 The description of function modifications includes adjustments to
34 the function's signature (which allows, for example, removing or
35 adding function arguments), substitutions to perform on the
36 function body, and, for inlined functions, a pointer to the
37 function that it will be inlined into.
39 It is also possible to redirect any edge of the callgraph from a
40 function to its virtual clone. This implies updating of the call
41 site to adjust for the new function signature.
43 Most of the transformations performed by inter-procedural
44 optimizations can be represented via virtual clones. For
45 instance, a constant propagation pass can produce a virtual clone
46 of the function which replaces one of its arguments by a
47 constant. The inliner can represent its decisions by producing a
48 clone of a function whose body will be later integrated into
51 Using virtual clones, the program can be easily updated
52 during the Execute stage, solving most of pass interactions
53 problems that would otherwise occur during Transform.
55 Virtual clones are later materialized in the LTRANS stage and
56 turned into real functions. Passes executed after the virtual
57 clone were introduced also perform their Transform stage
58 on new functions, so for a pass there is no significant
59 difference between operating on a real function or a virtual
60 clone introduced before its Execute stage.
62 Optimization passes then work on virtual clones introduced before
63 their Execute stage as if they were real functions. The
64 only difference is that clones are not visible during the
65 Generate Summary stage. */
69 #include "coretypes.h"
73 #include "stringpool.h"
76 #include "basic-block.h"
77 #include "tree-ssa-alias.h"
78 #include "internal-fn.h"
80 #include "gimple-expr.h"
85 #include "tree-inline.h"
86 #include "langhooks.h"
91 #include "diagnostic.h"
96 #include "tree-iterator.h"
97 #include "tree-dump.h"
98 #include "gimple-pretty-print.h"
100 #include "ipa-inline.h"
101 #include "ipa-utils.h"
102 #include "lto-streamer.h"
105 /* Create clone of E in the node N represented by CALL_EXPR the callgraph. */
107 cgraph_clone_edge (struct cgraph_edge
*e
, struct cgraph_node
*n
,
108 gimple call_stmt
, unsigned stmt_uid
, gcov_type count_scale
,
109 int freq_scale
, bool update_original
)
111 struct cgraph_edge
*new_edge
;
112 gcov_type count
= apply_probability (e
->count
, count_scale
);
115 /* We do not want to ignore loop nest after frequency drops to 0. */
118 freq
= e
->frequency
* (gcov_type
) freq_scale
/ CGRAPH_FREQ_BASE
;
119 if (freq
> CGRAPH_FREQ_MAX
)
120 freq
= CGRAPH_FREQ_MAX
;
122 if (e
->indirect_unknown_callee
)
126 if (call_stmt
&& (decl
= gimple_call_fndecl (call_stmt
))
127 /* When the call is speculative, we need to resolve it
128 via cgraph_resolve_speculation and not here. */
131 struct cgraph_node
*callee
= cgraph_get_node (decl
);
132 gcc_checking_assert (callee
);
133 new_edge
= cgraph_create_edge (n
, callee
, call_stmt
, count
, freq
);
137 new_edge
= cgraph_create_indirect_edge (n
, call_stmt
,
138 e
->indirect_info
->ecf_flags
,
140 *new_edge
->indirect_info
= *e
->indirect_info
;
145 new_edge
= cgraph_create_edge (n
, e
->callee
, call_stmt
, count
, freq
);
146 if (e
->indirect_info
)
148 new_edge
->indirect_info
149 = ggc_alloc_cleared_cgraph_indirect_call_info ();
150 *new_edge
->indirect_info
= *e
->indirect_info
;
154 new_edge
->inline_failed
= e
->inline_failed
;
155 new_edge
->indirect_inlining_edge
= e
->indirect_inlining_edge
;
156 new_edge
->lto_stmt_uid
= stmt_uid
;
157 /* Clone flags that depend on call_stmt availability manually. */
158 new_edge
->can_throw_external
= e
->can_throw_external
;
159 new_edge
->call_stmt_cannot_inline_p
= e
->call_stmt_cannot_inline_p
;
160 new_edge
->speculative
= e
->speculative
;
163 e
->count
-= new_edge
->count
;
167 cgraph_call_edge_duplication_hooks (e
, new_edge
);
172 /* Create node representing clone of N executed COUNT times. Decrease
173 the execution counts from original node too.
174 The new clone will have decl set to DECL that may or may not be the same
177 When UPDATE_ORIGINAL is true, the counts are subtracted from the original
178 function's profile to reflect the fact that part of execution is handled
180 When CALL_DUPLICATOIN_HOOK is true, the ipa passes are acknowledged about
181 the new clone. Otherwise the caller is responsible for doing so later.
183 If the new node is being inlined into another one, NEW_INLINED_TO should be
184 the outline function the new one is (even indirectly) inlined to. All hooks
185 will see this in node's global.inlined_to, when invoked. Can be NULL if the
186 node is not inlined. */
189 cgraph_clone_node (struct cgraph_node
*n
, tree decl
, gcov_type count
, int freq
,
190 bool update_original
,
191 vec
<cgraph_edge_p
> redirect_callers
,
192 bool call_duplication_hook
,
193 struct cgraph_node
*new_inlined_to
)
195 struct cgraph_node
*new_node
= cgraph_create_empty_node ();
196 struct cgraph_edge
*e
;
197 gcov_type count_scale
;
200 new_node
->decl
= decl
;
201 symtab_register_node (new_node
);
202 new_node
->origin
= n
->origin
;
203 new_node
->lto_file_data
= n
->lto_file_data
;
204 if (new_node
->origin
)
206 new_node
->next_nested
= new_node
->origin
->nested
;
207 new_node
->origin
->nested
= new_node
;
209 new_node
->analyzed
= n
->analyzed
;
210 new_node
->definition
= n
->definition
;
211 new_node
->local
= n
->local
;
212 new_node
->externally_visible
= false;
213 new_node
->local
.local
= true;
214 new_node
->global
= n
->global
;
215 new_node
->global
.inlined_to
= new_inlined_to
;
216 new_node
->rtl
= n
->rtl
;
217 new_node
->count
= count
;
218 new_node
->frequency
= n
->frequency
;
219 new_node
->clone
= n
->clone
;
220 new_node
->clone
.tree_map
= NULL
;
221 new_node
->tp_first_run
= n
->tp_first_run
;
224 if (new_node
->count
> n
->count
)
225 count_scale
= REG_BR_PROB_BASE
;
227 count_scale
= GCOV_COMPUTE_SCALE (new_node
->count
, n
->count
);
238 FOR_EACH_VEC_ELT (redirect_callers
, i
, e
)
240 /* Redirect calls to the old version node to point to its new
242 cgraph_redirect_edge_callee (e
, new_node
);
246 for (e
= n
->callees
;e
; e
=e
->next_callee
)
247 cgraph_clone_edge (e
, new_node
, e
->call_stmt
, e
->lto_stmt_uid
,
248 count_scale
, freq
, update_original
);
250 for (e
= n
->indirect_calls
; e
; e
= e
->next_callee
)
251 cgraph_clone_edge (e
, new_node
, e
->call_stmt
, e
->lto_stmt_uid
,
252 count_scale
, freq
, update_original
);
253 ipa_clone_references (new_node
, &n
->ref_list
);
255 new_node
->next_sibling_clone
= n
->clones
;
257 n
->clones
->prev_sibling_clone
= new_node
;
258 n
->clones
= new_node
;
259 new_node
->clone_of
= n
;
261 if (call_duplication_hook
)
262 cgraph_call_node_duplication_hooks (n
, new_node
);
266 /* Return a new assembler name for a clone of DECL with SUFFIX. */
268 static GTY(()) unsigned int clone_fn_id_num
;
271 clone_function_name (tree decl
, const char *suffix
)
273 tree name
= DECL_ASSEMBLER_NAME (decl
);
274 size_t len
= IDENTIFIER_LENGTH (name
);
275 char *tmp_name
, *prefix
;
277 prefix
= XALLOCAVEC (char, len
+ strlen (suffix
) + 2);
278 memcpy (prefix
, IDENTIFIER_POINTER (name
), len
);
279 strcpy (prefix
+ len
+ 1, suffix
);
280 #ifndef NO_DOT_IN_LABEL
282 #elif !defined NO_DOLLAR_IN_LABEL
287 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
, clone_fn_id_num
++);
288 return get_identifier (tmp_name
);
291 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
292 return value if SKIP_RETURN is true. */
295 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
298 tree new_type
= NULL
;
299 tree args
, new_args
= NULL
, t
;
303 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
304 args
= TREE_CHAIN (args
), i
++)
305 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
306 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
308 new_reversed
= nreverse (new_args
);
312 TREE_CHAIN (new_args
) = void_list_node
;
314 new_reversed
= void_list_node
;
317 /* Use copy_node to preserve as much as possible from original type
318 (debug info, attribute lists etc.)
319 Exception is METHOD_TYPEs must have THIS argument.
320 When we are asked to remove it, we need to build new FUNCTION_TYPE
322 if (TREE_CODE (orig_type
) != METHOD_TYPE
324 || !bitmap_bit_p (args_to_skip
, 0))
326 new_type
= build_distinct_type_copy (orig_type
);
327 TYPE_ARG_TYPES (new_type
) = new_reversed
;
332 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
334 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
338 TREE_TYPE (new_type
) = void_type_node
;
340 /* This is a new type, not a copy of an old type. Need to reassociate
341 variants. We can handle everything except the main variant lazily. */
342 t
= TYPE_MAIN_VARIANT (orig_type
);
345 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
346 TYPE_MAIN_VARIANT (new_type
) = t
;
347 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
348 TYPE_NEXT_VARIANT (t
) = new_type
;
352 TYPE_MAIN_VARIANT (new_type
) = new_type
;
353 TYPE_NEXT_VARIANT (new_type
) = NULL
;
359 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
360 return value if SKIP_RETURN is true.
362 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
363 linked by TREE_CHAIN directly. The caller is responsible for eliminating
364 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
367 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
370 tree new_decl
= copy_node (orig_decl
);
373 new_type
= TREE_TYPE (orig_decl
);
374 if (prototype_p (new_type
)
375 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
377 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
378 TREE_TYPE (new_decl
) = new_type
;
380 /* For declarations setting DECL_VINDEX (i.e. methods)
381 we expect first argument to be THIS pointer. */
382 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
383 DECL_VINDEX (new_decl
) = NULL_TREE
;
385 /* When signature changes, we need to clear builtin info. */
386 if (DECL_BUILT_IN (new_decl
)
388 && !bitmap_empty_p (args_to_skip
))
390 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
391 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
396 /* Create callgraph node clone with new declaration. The actual body will
397 be copied later at compilation stage.
399 TODO: after merging in ipa-sra use function call notes instead of args_to_skip
403 cgraph_create_virtual_clone (struct cgraph_node
*old_node
,
404 vec
<cgraph_edge_p
> redirect_callers
,
405 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
409 tree old_decl
= old_node
->decl
;
410 struct cgraph_node
*new_node
= NULL
;
413 struct ipa_replace_map
*map
;
417 gcc_checking_assert (tree_versionable_function_p (old_decl
));
419 gcc_assert (old_node
->local
.can_change_signature
|| !args_to_skip
);
421 /* Make a new FUNCTION_DECL tree node */
423 new_decl
= copy_node (old_decl
);
425 new_decl
= build_function_decl_skip_args (old_decl
, args_to_skip
, false);
427 /* These pointers represent function body and will be populated only when clone
429 gcc_assert (new_decl
!= old_decl
);
430 DECL_STRUCT_FUNCTION (new_decl
) = NULL
;
431 DECL_ARGUMENTS (new_decl
) = NULL
;
432 DECL_INITIAL (new_decl
) = NULL
;
433 DECL_RESULT (new_decl
) = NULL
;
434 /* We can not do DECL_RESULT (new_decl) = NULL; here because of LTO partitioning
435 sometimes storing only clone decl instead of original. */
437 /* Generate a new name for the new version. */
438 len
= IDENTIFIER_LENGTH (DECL_NAME (old_decl
));
439 name
= XALLOCAVEC (char, len
+ strlen (suffix
) + 2);
440 memcpy (name
, IDENTIFIER_POINTER (DECL_NAME (old_decl
)), len
);
441 strcpy (name
+ len
+ 1, suffix
);
443 DECL_NAME (new_decl
) = get_identifier (name
);
444 SET_DECL_ASSEMBLER_NAME (new_decl
, clone_function_name (old_decl
, suffix
));
445 SET_DECL_RTL (new_decl
, NULL
);
447 new_node
= cgraph_clone_node (old_node
, new_decl
, old_node
->count
,
448 CGRAPH_FREQ_BASE
, false,
449 redirect_callers
, false, NULL
);
450 /* Update the properties.
451 Make clone visible only within this translation unit. Make sure
452 that is not weak also.
453 ??? We cannot use COMDAT linkage because there is no
454 ABI support for this. */
455 DECL_EXTERNAL (new_node
->decl
) = 0;
456 if (DECL_ONE_ONLY (old_decl
))
457 DECL_SECTION_NAME (new_node
->decl
) = NULL
;
458 DECL_COMDAT_GROUP (new_node
->decl
) = 0;
459 TREE_PUBLIC (new_node
->decl
) = 0;
460 DECL_COMDAT (new_node
->decl
) = 0;
461 DECL_WEAK (new_node
->decl
) = 0;
462 DECL_VIRTUAL_P (new_node
->decl
) = 0;
463 DECL_STATIC_CONSTRUCTOR (new_node
->decl
) = 0;
464 DECL_STATIC_DESTRUCTOR (new_node
->decl
) = 0;
465 new_node
->clone
.tree_map
= tree_map
;
466 new_node
->clone
.args_to_skip
= args_to_skip
;
468 /* Clones of global symbols or symbols with unique names are unique. */
469 if ((TREE_PUBLIC (old_decl
)
470 && !DECL_EXTERNAL (old_decl
)
471 && !DECL_WEAK (old_decl
)
472 && !DECL_COMDAT (old_decl
))
474 new_node
->unique_name
= true;
475 FOR_EACH_VEC_SAFE_ELT (tree_map
, i
, map
)
476 ipa_maybe_record_reference (new_node
, map
->new_tree
,
479 new_node
->clone
.combined_args_to_skip
= old_node
->clone
.combined_args_to_skip
;
480 else if (old_node
->clone
.combined_args_to_skip
)
482 int newi
= 0, oldi
= 0;
484 bitmap new_args_to_skip
= BITMAP_GGC_ALLOC ();
485 struct cgraph_node
*orig_node
;
486 for (orig_node
= old_node
; orig_node
->clone_of
; orig_node
= orig_node
->clone_of
)
488 for (arg
= DECL_ARGUMENTS (orig_node
->decl
);
489 arg
; arg
= DECL_CHAIN (arg
), oldi
++)
491 if (bitmap_bit_p (old_node
->clone
.combined_args_to_skip
, oldi
))
493 bitmap_set_bit (new_args_to_skip
, oldi
);
496 if (bitmap_bit_p (args_to_skip
, newi
))
497 bitmap_set_bit (new_args_to_skip
, oldi
);
500 new_node
->clone
.combined_args_to_skip
= new_args_to_skip
;
503 new_node
->clone
.combined_args_to_skip
= args_to_skip
;
504 new_node
->externally_visible
= 0;
505 new_node
->local
.local
= 1;
506 new_node
->lowered
= true;
508 cgraph_call_node_duplication_hooks (old_node
, new_node
);
514 /* NODE is being removed from symbol table; see if its entry can be replaced by
515 other inline clone. */
517 cgraph_find_replacement_node (struct cgraph_node
*node
)
519 struct cgraph_node
*next_inline_clone
, *replacement
;
521 for (next_inline_clone
= node
->clones
;
523 && next_inline_clone
->decl
!= node
->decl
;
524 next_inline_clone
= next_inline_clone
->next_sibling_clone
)
527 /* If there is inline clone of the node being removed, we need
528 to put it into the position of removed node and reorganize all
529 other clones to be based on it. */
530 if (next_inline_clone
)
532 struct cgraph_node
*n
;
533 struct cgraph_node
*new_clones
;
535 replacement
= next_inline_clone
;
537 /* Unlink inline clone from the list of clones of removed node. */
538 if (next_inline_clone
->next_sibling_clone
)
539 next_inline_clone
->next_sibling_clone
->prev_sibling_clone
540 = next_inline_clone
->prev_sibling_clone
;
541 if (next_inline_clone
->prev_sibling_clone
)
543 gcc_assert (node
->clones
!= next_inline_clone
);
544 next_inline_clone
->prev_sibling_clone
->next_sibling_clone
545 = next_inline_clone
->next_sibling_clone
;
549 gcc_assert (node
->clones
== next_inline_clone
);
550 node
->clones
= next_inline_clone
->next_sibling_clone
;
553 new_clones
= node
->clones
;
556 /* Copy clone info. */
557 next_inline_clone
->clone
= node
->clone
;
559 /* Now place it into clone tree at same level at NODE. */
560 next_inline_clone
->clone_of
= node
->clone_of
;
561 next_inline_clone
->prev_sibling_clone
= NULL
;
562 next_inline_clone
->next_sibling_clone
= NULL
;
565 if (node
->clone_of
->clones
)
566 node
->clone_of
->clones
->prev_sibling_clone
= next_inline_clone
;
567 next_inline_clone
->next_sibling_clone
= node
->clone_of
->clones
;
568 node
->clone_of
->clones
= next_inline_clone
;
571 /* Merge the clone list. */
574 if (!next_inline_clone
->clones
)
575 next_inline_clone
->clones
= new_clones
;
578 n
= next_inline_clone
->clones
;
579 while (n
->next_sibling_clone
)
580 n
= n
->next_sibling_clone
;
581 n
->next_sibling_clone
= new_clones
;
582 new_clones
->prev_sibling_clone
= n
;
586 /* Update clone_of pointers. */
590 n
->clone_of
= next_inline_clone
;
591 n
= n
->next_sibling_clone
;
599 /* Like cgraph_set_call_stmt but walk the clone tree and update all
600 clones sharing the same function body.
601 When WHOLE_SPECULATIVE_EDGES is true, all three components of
602 speculative edge gets updated. Otherwise we update only direct
606 cgraph_set_call_stmt_including_clones (struct cgraph_node
*orig
,
607 gimple old_stmt
, gimple new_stmt
,
608 bool update_speculative
)
610 struct cgraph_node
*node
;
611 struct cgraph_edge
*edge
= cgraph_edge (orig
, old_stmt
);
614 cgraph_set_call_stmt (edge
, new_stmt
, update_speculative
);
620 struct cgraph_edge
*edge
= cgraph_edge (node
, old_stmt
);
623 cgraph_set_call_stmt (edge
, new_stmt
, update_speculative
);
624 /* If UPDATE_SPECULATIVE is false, it means that we are turning
625 speculative call into a real code sequence. Update the
627 if (edge
->speculative
&& !update_speculative
)
629 struct cgraph_edge
*direct
, *indirect
;
632 gcc_assert (!edge
->indirect_unknown_callee
);
633 cgraph_speculative_call_info (edge
, direct
, indirect
, ref
);
634 direct
->speculative
= false;
635 indirect
->speculative
= false;
636 ref
->speculative
= false;
641 else if (node
->next_sibling_clone
)
642 node
= node
->next_sibling_clone
;
645 while (node
!= orig
&& !node
->next_sibling_clone
)
646 node
= node
->clone_of
;
648 node
= node
->next_sibling_clone
;
653 /* Like cgraph_create_edge walk the clone tree and update all clones sharing
654 same function body. If clones already have edge for OLD_STMT; only
655 update the edge same way as cgraph_set_call_stmt_including_clones does.
657 TODO: COUNT and LOOP_DEPTH should be properly distributed based on relative
658 frequencies of the clones. */
661 cgraph_create_edge_including_clones (struct cgraph_node
*orig
,
662 struct cgraph_node
*callee
,
664 gimple stmt
, gcov_type count
,
666 cgraph_inline_failed_t reason
)
668 struct cgraph_node
*node
;
669 struct cgraph_edge
*edge
;
671 if (!cgraph_edge (orig
, stmt
))
673 edge
= cgraph_create_edge (orig
, callee
, stmt
, count
, freq
);
674 edge
->inline_failed
= reason
;
681 struct cgraph_edge
*edge
= cgraph_edge (node
, old_stmt
);
683 /* It is possible that clones already contain the edge while
684 master didn't. Either we promoted indirect call into direct
685 call in the clone or we are processing clones of unreachable
686 master where edges has been removed. */
688 cgraph_set_call_stmt (edge
, stmt
);
689 else if (!cgraph_edge (node
, stmt
))
691 edge
= cgraph_create_edge (node
, callee
, stmt
, count
,
693 edge
->inline_failed
= reason
;
698 else if (node
->next_sibling_clone
)
699 node
= node
->next_sibling_clone
;
702 while (node
!= orig
&& !node
->next_sibling_clone
)
703 node
= node
->clone_of
;
705 node
= node
->next_sibling_clone
;
710 /* Remove the node from cgraph and all inline clones inlined into it.
711 Skip however removal of FORBIDDEN_NODE and return true if it needs to be
712 removed. This allows to call the function from outer loop walking clone
716 cgraph_remove_node_and_inline_clones (struct cgraph_node
*node
, struct cgraph_node
*forbidden_node
)
718 struct cgraph_edge
*e
, *next
;
721 if (node
== forbidden_node
)
723 cgraph_remove_edge (node
->callers
);
726 for (e
= node
->callees
; e
; e
= next
)
728 next
= e
->next_callee
;
729 if (!e
->inline_failed
)
730 found
|= cgraph_remove_node_and_inline_clones (e
->callee
, forbidden_node
);
732 cgraph_remove_node (node
);
736 /* The edges representing the callers of the NEW_VERSION node were
737 fixed by cgraph_function_versioning (), now the call_expr in their
738 respective tree code should be updated to call the NEW_VERSION. */
741 update_call_expr (struct cgraph_node
*new_version
)
743 struct cgraph_edge
*e
;
745 gcc_assert (new_version
);
747 /* Update the call expr on the edges to call the new version. */
748 for (e
= new_version
->callers
; e
; e
= e
->next_caller
)
750 struct function
*inner_function
= DECL_STRUCT_FUNCTION (e
->caller
->decl
);
751 gimple_call_set_fndecl (e
->call_stmt
, new_version
->decl
);
752 maybe_clean_eh_stmt_fn (inner_function
, e
->call_stmt
);
757 /* Create a new cgraph node which is the new version of
758 OLD_VERSION node. REDIRECT_CALLERS holds the callers
759 edges which should be redirected to point to
760 NEW_VERSION. ALL the callees edges of OLD_VERSION
761 are cloned to the new version node. Return the new
764 If non-NULL BLOCK_TO_COPY determine what basic blocks
765 was copied to prevent duplications of calls that are dead
769 cgraph_copy_node_for_versioning (struct cgraph_node
*old_version
,
771 vec
<cgraph_edge_p
> redirect_callers
,
774 struct cgraph_node
*new_version
;
775 struct cgraph_edge
*e
;
778 gcc_assert (old_version
);
780 new_version
= cgraph_create_node (new_decl
);
782 new_version
->analyzed
= old_version
->analyzed
;
783 new_version
->definition
= old_version
->definition
;
784 new_version
->local
= old_version
->local
;
785 new_version
->externally_visible
= false;
786 new_version
->local
.local
= new_version
->definition
;
787 new_version
->global
= old_version
->global
;
788 new_version
->rtl
= old_version
->rtl
;
789 new_version
->count
= old_version
->count
;
791 for (e
= old_version
->callees
; e
; e
=e
->next_callee
)
793 || bitmap_bit_p (bbs_to_copy
, gimple_bb (e
->call_stmt
)->index
))
794 cgraph_clone_edge (e
, new_version
, e
->call_stmt
,
795 e
->lto_stmt_uid
, REG_BR_PROB_BASE
,
798 for (e
= old_version
->indirect_calls
; e
; e
=e
->next_callee
)
800 || bitmap_bit_p (bbs_to_copy
, gimple_bb (e
->call_stmt
)->index
))
801 cgraph_clone_edge (e
, new_version
, e
->call_stmt
,
802 e
->lto_stmt_uid
, REG_BR_PROB_BASE
,
805 FOR_EACH_VEC_ELT (redirect_callers
, i
, e
)
807 /* Redirect calls to the old version node to point to its new
809 cgraph_redirect_edge_callee (e
, new_version
);
812 cgraph_call_node_duplication_hooks (old_version
, new_version
);
817 /* Perform function versioning.
818 Function versioning includes copying of the tree and
819 a callgraph update (creating a new cgraph node and updating
820 its callees and callers).
822 REDIRECT_CALLERS varray includes the edges to be redirected
825 TREE_MAP is a mapping of tree nodes we want to replace with
826 new ones (according to results of prior analysis).
827 OLD_VERSION_NODE is the node that is versioned.
829 If non-NULL ARGS_TO_SKIP determine function parameters to remove
831 If SKIP_RETURN is true, the new version will return void.
832 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
833 If non_NULL NEW_ENTRY determine new entry BB of the clone.
835 Return the new version's cgraph node. */
838 cgraph_function_versioning (struct cgraph_node
*old_version_node
,
839 vec
<cgraph_edge_p
> redirect_callers
,
840 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
844 basic_block new_entry_block
,
845 const char *clone_name
)
847 tree old_decl
= old_version_node
->decl
;
848 struct cgraph_node
*new_version_node
= NULL
;
851 if (!tree_versionable_function_p (old_decl
))
854 gcc_assert (old_version_node
->local
.can_change_signature
|| !args_to_skip
);
856 /* Make a new FUNCTION_DECL tree node for the new version. */
857 if (!args_to_skip
&& !skip_return
)
858 new_decl
= copy_node (old_decl
);
861 = build_function_decl_skip_args (old_decl
, args_to_skip
, skip_return
);
863 /* Generate a new name for the new version. */
864 DECL_NAME (new_decl
) = clone_function_name (old_decl
, clone_name
);
865 SET_DECL_ASSEMBLER_NAME (new_decl
, DECL_NAME (new_decl
));
866 SET_DECL_RTL (new_decl
, NULL
);
868 /* When the old decl was a con-/destructor make sure the clone isn't. */
869 DECL_STATIC_CONSTRUCTOR (new_decl
) = 0;
870 DECL_STATIC_DESTRUCTOR (new_decl
) = 0;
872 /* Create the new version's call-graph node.
873 and update the edges of the new node. */
875 cgraph_copy_node_for_versioning (old_version_node
, new_decl
,
876 redirect_callers
, bbs_to_copy
);
878 /* Copy the OLD_VERSION_NODE function tree to the new version. */
879 tree_function_versioning (old_decl
, new_decl
, tree_map
, false, args_to_skip
,
880 skip_return
, bbs_to_copy
, new_entry_block
);
882 /* Update the new version's properties.
883 Make The new version visible only within this translation unit. Make sure
884 that is not weak also.
885 ??? We cannot use COMDAT linkage because there is no
886 ABI support for this. */
887 symtab_make_decl_local (new_version_node
->decl
);
888 DECL_VIRTUAL_P (new_version_node
->decl
) = 0;
889 new_version_node
->externally_visible
= 0;
890 new_version_node
->local
.local
= 1;
891 new_version_node
->lowered
= true;
892 /* Clones of global symbols or symbols with unique names are unique. */
893 if ((TREE_PUBLIC (old_decl
)
894 && !DECL_EXTERNAL (old_decl
)
895 && !DECL_WEAK (old_decl
)
896 && !DECL_COMDAT (old_decl
))
898 new_version_node
->unique_name
= true;
900 /* Update the call_expr on the edges to call the new version node. */
901 update_call_expr (new_version_node
);
903 cgraph_call_function_insertion_hooks (new_version_node
);
904 return new_version_node
;
907 /* Given virtual clone, turn it into actual clone. */
910 cgraph_materialize_clone (struct cgraph_node
*node
)
912 bitmap_obstack_initialize (NULL
);
913 node
->former_clone_of
= node
->clone_of
->decl
;
914 if (node
->clone_of
->former_clone_of
)
915 node
->former_clone_of
= node
->clone_of
->former_clone_of
;
916 /* Copy the OLD_VERSION_NODE function tree to the new version. */
917 tree_function_versioning (node
->clone_of
->decl
, node
->decl
,
918 node
->clone
.tree_map
, true,
919 node
->clone
.args_to_skip
, false,
921 if (cgraph_dump_file
)
923 dump_function_to_file (node
->clone_of
->decl
, cgraph_dump_file
, dump_flags
);
924 dump_function_to_file (node
->decl
, cgraph_dump_file
, dump_flags
);
927 /* Function is no longer clone. */
928 if (node
->next_sibling_clone
)
929 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
930 if (node
->prev_sibling_clone
)
931 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
933 node
->clone_of
->clones
= node
->next_sibling_clone
;
934 node
->next_sibling_clone
= NULL
;
935 node
->prev_sibling_clone
= NULL
;
936 if (!node
->clone_of
->analyzed
&& !node
->clone_of
->clones
)
938 cgraph_release_function_body (node
->clone_of
);
939 cgraph_node_remove_callees (node
->clone_of
);
940 ipa_remove_all_references (&node
->clone_of
->ref_list
);
942 node
->clone_of
= NULL
;
943 bitmap_obstack_release (NULL
);
946 /* Once all functions from compilation unit are in memory, produce all clones
947 and update all calls. We might also do this on demand if we don't want to
948 bring all functions to memory prior compilation, but current WHOPR
949 implementation does that and it is is bit easier to keep everything right in
953 cgraph_materialize_all_clones (void)
955 struct cgraph_node
*node
;
956 bool stabilized
= false;
959 if (cgraph_dump_file
)
960 fprintf (cgraph_dump_file
, "Materializing clones\n");
961 #ifdef ENABLE_CHECKING
965 /* We can also do topological order, but number of iterations should be
966 bounded by number of IPA passes since single IPA pass is probably not
967 going to create clones of clones it created itself. */
971 FOR_EACH_FUNCTION (node
)
973 if (node
->clone_of
&& node
->decl
!= node
->clone_of
->decl
974 && !gimple_has_body_p (node
->decl
))
976 if (!node
->clone_of
->clone_of
)
977 cgraph_get_body (node
->clone_of
);
978 if (gimple_has_body_p (node
->clone_of
->decl
))
980 if (cgraph_dump_file
)
982 fprintf (cgraph_dump_file
, "cloning %s to %s\n",
983 xstrdup (node
->clone_of
->name ()),
984 xstrdup (node
->name ()));
985 if (node
->clone
.tree_map
)
988 fprintf (cgraph_dump_file
, " replace map: ");
990 i
< vec_safe_length (node
->clone
.tree_map
);
993 struct ipa_replace_map
*replace_info
;
994 replace_info
= (*node
->clone
.tree_map
)[i
];
995 print_generic_expr (cgraph_dump_file
, replace_info
->old_tree
, 0);
996 fprintf (cgraph_dump_file
, " -> ");
997 print_generic_expr (cgraph_dump_file
, replace_info
->new_tree
, 0);
998 fprintf (cgraph_dump_file
, "%s%s;",
999 replace_info
->replace_p
? "(replace)":"",
1000 replace_info
->ref_p
? "(ref)":"");
1002 fprintf (cgraph_dump_file
, "\n");
1004 if (node
->clone
.args_to_skip
)
1006 fprintf (cgraph_dump_file
, " args_to_skip: ");
1007 dump_bitmap (cgraph_dump_file
, node
->clone
.args_to_skip
);
1009 if (node
->clone
.args_to_skip
)
1011 fprintf (cgraph_dump_file
, " combined_args_to_skip:");
1012 dump_bitmap (cgraph_dump_file
, node
->clone
.combined_args_to_skip
);
1015 cgraph_materialize_clone (node
);
1021 FOR_EACH_FUNCTION (node
)
1022 if (!node
->analyzed
&& node
->callees
)
1024 cgraph_node_remove_callees (node
);
1025 ipa_remove_all_references (&node
->ref_list
);
1028 ipa_clear_stmts_in_references (node
);
1029 if (cgraph_dump_file
)
1030 fprintf (cgraph_dump_file
, "Materialization Call site updates done.\n");
1031 #ifdef ENABLE_CHECKING
1034 symtab_remove_unreachable_nodes (false, cgraph_dump_file
);
1037 #include "gt-cgraphclones.h"