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"
78 #include "hard-reg-set.h"
83 #include "basic-block.h"
84 #include "tree-ssa-alias.h"
85 #include "internal-fn.h"
87 #include "gimple-expr.h"
92 #include "tree-inline.h"
93 #include "langhooks.h"
98 #include "diagnostic.h"
101 #include "hash-map.h"
102 #include "plugin-api.h"
105 #include "alloc-pool.h"
106 #include "ipa-prop.h"
107 #include "tree-iterator.h"
108 #include "tree-dump.h"
109 #include "gimple-pretty-print.h"
110 #include "coverage.h"
111 #include "ipa-inline.h"
112 #include "ipa-utils.h"
113 #include "lto-streamer.h"
116 /* Create clone of edge in the node N represented by CALL_EXPR
120 cgraph_edge::clone (cgraph_node
*n
, gcall
*call_stmt
, unsigned stmt_uid
,
121 gcov_type count_scale
, int freq_scale
, bool update_original
)
123 cgraph_edge
*new_edge
;
124 gcov_type gcov_count
= apply_probability (count
, count_scale
);
127 /* We do not want to ignore loop nest after frequency drops to 0. */
130 freq
= frequency
* (gcov_type
) freq_scale
/ CGRAPH_FREQ_BASE
;
131 if (freq
> CGRAPH_FREQ_MAX
)
132 freq
= CGRAPH_FREQ_MAX
;
134 if (indirect_unknown_callee
)
138 if (call_stmt
&& (decl
= gimple_call_fndecl (call_stmt
))
139 /* When the call is speculative, we need to resolve it
140 via cgraph_resolve_speculation and not here. */
143 cgraph_node
*callee
= cgraph_node::get (decl
);
144 gcc_checking_assert (callee
);
145 new_edge
= n
->create_edge (callee
, call_stmt
, gcov_count
, freq
);
149 new_edge
= n
->create_indirect_edge (call_stmt
,
150 indirect_info
->ecf_flags
,
152 *new_edge
->indirect_info
= *indirect_info
;
157 new_edge
= n
->create_edge (callee
, call_stmt
, gcov_count
, freq
);
160 new_edge
->indirect_info
161 = ggc_cleared_alloc
<cgraph_indirect_call_info
> ();
162 *new_edge
->indirect_info
= *indirect_info
;
166 new_edge
->inline_failed
= inline_failed
;
167 new_edge
->indirect_inlining_edge
= indirect_inlining_edge
;
168 new_edge
->lto_stmt_uid
= stmt_uid
;
169 /* Clone flags that depend on call_stmt availability manually. */
170 new_edge
->can_throw_external
= can_throw_external
;
171 new_edge
->call_stmt_cannot_inline_p
= call_stmt_cannot_inline_p
;
172 new_edge
->speculative
= speculative
;
173 new_edge
->in_polymorphic_cdtor
= in_polymorphic_cdtor
;
176 count
-= new_edge
->count
;
180 symtab
->call_edge_duplication_hooks (this, new_edge
);
184 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
185 return value if SKIP_RETURN is true. */
188 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
191 tree new_type
= NULL
;
192 tree args
, new_args
= NULL
;
196 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
197 args
= TREE_CHAIN (args
), i
++)
198 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
199 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
201 new_reversed
= nreverse (new_args
);
205 TREE_CHAIN (new_args
) = void_list_node
;
207 new_reversed
= void_list_node
;
210 /* Use copy_node to preserve as much as possible from original type
211 (debug info, attribute lists etc.)
212 Exception is METHOD_TYPEs must have THIS argument.
213 When we are asked to remove it, we need to build new FUNCTION_TYPE
215 if (TREE_CODE (orig_type
) != METHOD_TYPE
217 || !bitmap_bit_p (args_to_skip
, 0))
219 new_type
= build_distinct_type_copy (orig_type
);
220 TYPE_ARG_TYPES (new_type
) = new_reversed
;
225 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
227 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
231 TREE_TYPE (new_type
) = void_type_node
;
236 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
237 return value if SKIP_RETURN is true.
239 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
240 linked by TREE_CHAIN directly. The caller is responsible for eliminating
241 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
244 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
247 tree new_decl
= copy_node (orig_decl
);
250 new_type
= TREE_TYPE (orig_decl
);
251 if (prototype_p (new_type
)
252 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
254 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
255 TREE_TYPE (new_decl
) = new_type
;
257 /* For declarations setting DECL_VINDEX (i.e. methods)
258 we expect first argument to be THIS pointer. */
259 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
260 DECL_VINDEX (new_decl
) = NULL_TREE
;
262 /* When signature changes, we need to clear builtin info. */
263 if (DECL_BUILT_IN (new_decl
)
265 && !bitmap_empty_p (args_to_skip
))
267 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
268 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
270 /* The FE might have information and assumptions about the other
272 DECL_LANG_SPECIFIC (new_decl
) = NULL
;
276 /* Set flags of NEW_NODE and its decl. NEW_NODE is a newly created private
277 clone or its thunk. */
280 set_new_clone_decl_and_node_flags (cgraph_node
*new_node
)
282 DECL_EXTERNAL (new_node
->decl
) = 0;
283 TREE_PUBLIC (new_node
->decl
) = 0;
284 DECL_COMDAT (new_node
->decl
) = 0;
285 DECL_WEAK (new_node
->decl
) = 0;
286 DECL_VIRTUAL_P (new_node
->decl
) = 0;
287 DECL_STATIC_CONSTRUCTOR (new_node
->decl
) = 0;
288 DECL_STATIC_DESTRUCTOR (new_node
->decl
) = 0;
290 new_node
->externally_visible
= 0;
291 new_node
->local
.local
= 1;
292 new_node
->lowered
= true;
295 /* Duplicate thunk THUNK if necessary but make it to refer to NODE.
296 ARGS_TO_SKIP, if non-NULL, determines which parameters should be omitted.
297 Function can return NODE if no thunk is necessary, which can happen when
298 thunk is this_adjusting but we are removing this parameter. */
301 duplicate_thunk_for_node (cgraph_node
*thunk
, cgraph_node
*node
)
303 cgraph_node
*new_thunk
, *thunk_of
;
304 thunk_of
= thunk
->callees
->callee
->ultimate_alias_target ();
306 if (thunk_of
->thunk
.thunk_p
)
307 node
= duplicate_thunk_for_node (thunk_of
, node
);
309 if (!DECL_ARGUMENTS (thunk
->decl
))
310 thunk
->get_untransformed_body ();
313 for (cs
= node
->callers
; cs
; cs
= cs
->next_caller
)
314 if (cs
->caller
->thunk
.thunk_p
315 && cs
->caller
->thunk
.this_adjusting
== thunk
->thunk
.this_adjusting
316 && cs
->caller
->thunk
.fixed_offset
== thunk
->thunk
.fixed_offset
317 && cs
->caller
->thunk
.virtual_offset_p
== thunk
->thunk
.virtual_offset_p
318 && cs
->caller
->thunk
.virtual_value
== thunk
->thunk
.virtual_value
)
322 if (!node
->clone
.args_to_skip
)
323 new_decl
= copy_node (thunk
->decl
);
326 /* We do not need to duplicate this_adjusting thunks if we have removed
328 if (thunk
->thunk
.this_adjusting
329 && bitmap_bit_p (node
->clone
.args_to_skip
, 0))
332 new_decl
= build_function_decl_skip_args (thunk
->decl
,
333 node
->clone
.args_to_skip
,
337 tree
*link
= &DECL_ARGUMENTS (new_decl
);
339 for (tree pd
= DECL_ARGUMENTS (thunk
->decl
); pd
; pd
= DECL_CHAIN (pd
), i
++)
341 if (!node
->clone
.args_to_skip
342 || !bitmap_bit_p (node
->clone
.args_to_skip
, i
))
344 tree nd
= copy_node (pd
);
345 DECL_CONTEXT (nd
) = new_decl
;
347 link
= &DECL_CHAIN (nd
);
352 gcc_checking_assert (!DECL_STRUCT_FUNCTION (new_decl
));
353 gcc_checking_assert (!DECL_INITIAL (new_decl
));
354 gcc_checking_assert (!DECL_RESULT (new_decl
));
355 gcc_checking_assert (!DECL_RTL_SET_P (new_decl
));
357 DECL_NAME (new_decl
) = clone_function_name (thunk
->decl
, "artificial_thunk");
358 SET_DECL_ASSEMBLER_NAME (new_decl
, DECL_NAME (new_decl
));
360 new_thunk
= cgraph_node::create (new_decl
);
361 set_new_clone_decl_and_node_flags (new_thunk
);
362 new_thunk
->definition
= true;
363 new_thunk
->thunk
= thunk
->thunk
;
364 new_thunk
->unique_name
= in_lto_p
;
365 new_thunk
->former_clone_of
= thunk
->decl
;
366 new_thunk
->clone
.args_to_skip
= node
->clone
.args_to_skip
;
367 new_thunk
->clone
.combined_args_to_skip
= node
->clone
.combined_args_to_skip
;
369 cgraph_edge
*e
= new_thunk
->create_edge (node
, NULL
, 0,
371 e
->call_stmt_cannot_inline_p
= true;
372 symtab
->call_edge_duplication_hooks (thunk
->callees
, e
);
373 if (new_thunk
->expand_thunk (false, false))
375 new_thunk
->thunk
.thunk_p
= false;
376 new_thunk
->analyze ();
379 symtab
->call_cgraph_duplication_hooks (thunk
, new_thunk
);
383 /* If E does not lead to a thunk, simply redirect it to N. Otherwise create
384 one or more equivalent thunks for N and redirect E to the first in the
388 redirect_edge_duplicating_thunks (cgraph_edge
*e
, cgraph_node
*n
)
390 cgraph_node
*orig_to
= e
->callee
->ultimate_alias_target ();
391 if (orig_to
->thunk
.thunk_p
)
392 n
= duplicate_thunk_for_node (orig_to
, n
);
394 e
->redirect_callee (n
);
397 /* Create node representing clone of N executed COUNT times. Decrease
398 the execution counts from original node too.
399 The new clone will have decl set to DECL that may or may not be the same
402 When UPDATE_ORIGINAL is true, the counts are subtracted from the original
403 function's profile to reflect the fact that part of execution is handled
405 When CALL_DUPLICATOIN_HOOK is true, the ipa passes are acknowledged about
406 the new clone. Otherwise the caller is responsible for doing so later.
408 If the new node is being inlined into another one, NEW_INLINED_TO should be
409 the outline function the new one is (even indirectly) inlined to. All hooks
410 will see this in node's global.inlined_to, when invoked. Can be NULL if the
411 node is not inlined. */
414 cgraph_node::create_clone (tree decl
, gcov_type gcov_count
, int freq
,
415 bool update_original
,
416 vec
<cgraph_edge
*> redirect_callers
,
417 bool call_duplication_hook
,
418 cgraph_node
*new_inlined_to
,
421 cgraph_node
*new_node
= symtab
->create_empty ();
423 gcov_type count_scale
;
426 new_node
->decl
= decl
;
427 new_node
->register_symbol ();
428 new_node
->origin
= origin
;
429 new_node
->lto_file_data
= lto_file_data
;
430 if (new_node
->origin
)
432 new_node
->next_nested
= new_node
->origin
->nested
;
433 new_node
->origin
->nested
= new_node
;
435 new_node
->analyzed
= analyzed
;
436 new_node
->definition
= definition
;
437 new_node
->local
= local
;
438 new_node
->externally_visible
= false;
439 new_node
->no_reorder
= no_reorder
;
440 new_node
->local
.local
= true;
441 new_node
->global
= global
;
442 new_node
->global
.inlined_to
= new_inlined_to
;
444 new_node
->count
= count
;
445 new_node
->frequency
= frequency
;
446 new_node
->tp_first_run
= tp_first_run
;
447 new_node
->tm_clone
= tm_clone
;
449 new_node
->clone
.tree_map
= NULL
;
450 new_node
->clone
.args_to_skip
= args_to_skip
;
452 new_node
->clone
.combined_args_to_skip
= clone
.combined_args_to_skip
;
453 else if (clone
.combined_args_to_skip
)
455 new_node
->clone
.combined_args_to_skip
= BITMAP_GGC_ALLOC ();
456 bitmap_ior (new_node
->clone
.combined_args_to_skip
,
457 clone
.combined_args_to_skip
, args_to_skip
);
460 new_node
->clone
.combined_args_to_skip
= args_to_skip
;
464 if (new_node
->count
> count
)
465 count_scale
= REG_BR_PROB_BASE
;
467 count_scale
= GCOV_COMPUTE_SCALE (new_node
->count
, count
);
478 FOR_EACH_VEC_ELT (redirect_callers
, i
, e
)
480 /* Redirect calls to the old version node to point to its new
481 version. The only exception is when the edge was proved to
482 be unreachable during the clonning procedure. */
484 || DECL_BUILT_IN_CLASS (e
->callee
->decl
) != BUILT_IN_NORMAL
485 || DECL_FUNCTION_CODE (e
->callee
->decl
) != BUILT_IN_UNREACHABLE
)
486 redirect_edge_duplicating_thunks (e
, new_node
);
489 for (e
= callees
;e
; e
=e
->next_callee
)
490 e
->clone (new_node
, e
->call_stmt
, e
->lto_stmt_uid
, count_scale
,
491 freq
, update_original
);
493 for (e
= indirect_calls
; e
; e
= e
->next_callee
)
494 e
->clone (new_node
, e
->call_stmt
, e
->lto_stmt_uid
,
495 count_scale
, freq
, update_original
);
496 new_node
->clone_references (this);
498 new_node
->next_sibling_clone
= clones
;
500 clones
->prev_sibling_clone
= new_node
;
502 new_node
->clone_of
= this;
504 if (call_duplication_hook
)
505 symtab
->call_cgraph_duplication_hooks (this, new_node
);
509 /* Return a new assembler name for a clone of DECL with SUFFIX. */
511 static GTY(()) unsigned int clone_fn_id_num
;
514 clone_function_name (tree decl
, const char *suffix
)
516 tree name
= DECL_ASSEMBLER_NAME (decl
);
517 size_t len
= IDENTIFIER_LENGTH (name
);
518 char *tmp_name
, *prefix
;
520 prefix
= XALLOCAVEC (char, len
+ strlen (suffix
) + 2);
521 memcpy (prefix
, IDENTIFIER_POINTER (name
), len
);
522 strcpy (prefix
+ len
+ 1, suffix
);
523 #ifndef NO_DOT_IN_LABEL
525 #elif !defined NO_DOLLAR_IN_LABEL
530 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
, clone_fn_id_num
++);
531 return get_identifier (tmp_name
);
534 /* Create callgraph node clone with new declaration. The actual body will
535 be copied later at compilation stage.
537 TODO: after merging in ipa-sra use function call notes instead of args_to_skip
541 cgraph_node::create_virtual_clone (vec
<cgraph_edge
*> redirect_callers
,
542 vec
<ipa_replace_map
*, va_gc
> *tree_map
,
543 bitmap args_to_skip
, const char * suffix
)
545 tree old_decl
= decl
;
546 cgraph_node
*new_node
= NULL
;
549 ipa_replace_map
*map
;
553 gcc_checking_assert (tree_versionable_function_p (old_decl
));
555 gcc_assert (local
.can_change_signature
|| !args_to_skip
);
557 /* Make a new FUNCTION_DECL tree node */
559 new_decl
= copy_node (old_decl
);
561 new_decl
= build_function_decl_skip_args (old_decl
, args_to_skip
, false);
563 /* These pointers represent function body and will be populated only when clone
565 gcc_assert (new_decl
!= old_decl
);
566 DECL_STRUCT_FUNCTION (new_decl
) = NULL
;
567 DECL_ARGUMENTS (new_decl
) = NULL
;
568 DECL_INITIAL (new_decl
) = NULL
;
569 DECL_RESULT (new_decl
) = NULL
;
570 /* We can not do DECL_RESULT (new_decl) = NULL; here because of LTO partitioning
571 sometimes storing only clone decl instead of original. */
573 /* Generate a new name for the new version. */
574 len
= IDENTIFIER_LENGTH (DECL_NAME (old_decl
));
575 name
= XALLOCAVEC (char, len
+ strlen (suffix
) + 2);
576 memcpy (name
, IDENTIFIER_POINTER (DECL_NAME (old_decl
)), len
);
577 strcpy (name
+ len
+ 1, suffix
);
579 DECL_NAME (new_decl
) = get_identifier (name
);
580 SET_DECL_ASSEMBLER_NAME (new_decl
, clone_function_name (old_decl
, suffix
));
581 SET_DECL_RTL (new_decl
, NULL
);
583 new_node
= create_clone (new_decl
, count
, CGRAPH_FREQ_BASE
, false,
584 redirect_callers
, false, NULL
, args_to_skip
);
586 /* Update the properties.
587 Make clone visible only within this translation unit. Make sure
588 that is not weak also.
589 ??? We cannot use COMDAT linkage because there is no
590 ABI support for this. */
591 set_new_clone_decl_and_node_flags (new_node
);
592 new_node
->clone
.tree_map
= tree_map
;
594 /* Clones of global symbols or symbols with unique names are unique. */
595 if ((TREE_PUBLIC (old_decl
)
596 && !DECL_EXTERNAL (old_decl
)
597 && !DECL_WEAK (old_decl
)
598 && !DECL_COMDAT (old_decl
))
600 new_node
->unique_name
= true;
601 FOR_EACH_VEC_SAFE_ELT (tree_map
, i
, map
)
602 new_node
->maybe_create_reference (map
->new_tree
, IPA_REF_ADDR
, NULL
);
604 if (ipa_transforms_to_apply
.exists ())
605 new_node
->ipa_transforms_to_apply
606 = ipa_transforms_to_apply
.copy ();
608 symtab
->call_cgraph_duplication_hooks (this, new_node
);
613 /* callgraph node being removed from symbol table; see if its entry can be
614 replaced by other inline clone. */
616 cgraph_node::find_replacement (void)
618 cgraph_node
*next_inline_clone
, *replacement
;
620 for (next_inline_clone
= clones
;
622 && next_inline_clone
->decl
!= decl
;
623 next_inline_clone
= next_inline_clone
->next_sibling_clone
)
626 /* If there is inline clone of the node being removed, we need
627 to put it into the position of removed node and reorganize all
628 other clones to be based on it. */
629 if (next_inline_clone
)
632 cgraph_node
*new_clones
;
634 replacement
= next_inline_clone
;
636 /* Unlink inline clone from the list of clones of removed node. */
637 if (next_inline_clone
->next_sibling_clone
)
638 next_inline_clone
->next_sibling_clone
->prev_sibling_clone
639 = next_inline_clone
->prev_sibling_clone
;
640 if (next_inline_clone
->prev_sibling_clone
)
642 gcc_assert (clones
!= next_inline_clone
);
643 next_inline_clone
->prev_sibling_clone
->next_sibling_clone
644 = next_inline_clone
->next_sibling_clone
;
648 gcc_assert (clones
== next_inline_clone
);
649 clones
= next_inline_clone
->next_sibling_clone
;
655 /* Copy clone info. */
656 next_inline_clone
->clone
= clone
;
658 /* Now place it into clone tree at same level at NODE. */
659 next_inline_clone
->clone_of
= clone_of
;
660 next_inline_clone
->prev_sibling_clone
= NULL
;
661 next_inline_clone
->next_sibling_clone
= NULL
;
664 if (clone_of
->clones
)
665 clone_of
->clones
->prev_sibling_clone
= next_inline_clone
;
666 next_inline_clone
->next_sibling_clone
= clone_of
->clones
;
667 clone_of
->clones
= next_inline_clone
;
670 /* Merge the clone list. */
673 if (!next_inline_clone
->clones
)
674 next_inline_clone
->clones
= new_clones
;
677 n
= next_inline_clone
->clones
;
678 while (n
->next_sibling_clone
)
679 n
= n
->next_sibling_clone
;
680 n
->next_sibling_clone
= new_clones
;
681 new_clones
->prev_sibling_clone
= n
;
685 /* Update clone_of pointers. */
689 n
->clone_of
= next_inline_clone
;
690 n
= n
->next_sibling_clone
;
698 /* Like cgraph_set_call_stmt but walk the clone tree and update all
699 clones sharing the same function body.
700 When WHOLE_SPECULATIVE_EDGES is true, all three components of
701 speculative edge gets updated. Otherwise we update only direct
705 cgraph_node::set_call_stmt_including_clones (gimple old_stmt
,
707 bool update_speculative
)
710 cgraph_edge
*edge
= get_edge (old_stmt
);
713 edge
->set_call_stmt (new_stmt
, update_speculative
);
719 cgraph_edge
*edge
= node
->get_edge (old_stmt
);
722 edge
->set_call_stmt (new_stmt
, update_speculative
);
723 /* If UPDATE_SPECULATIVE is false, it means that we are turning
724 speculative call into a real code sequence. Update the
726 if (edge
->speculative
&& !update_speculative
)
728 cgraph_edge
*direct
, *indirect
;
731 gcc_assert (!edge
->indirect_unknown_callee
);
732 edge
->speculative_call_info (direct
, indirect
, ref
);
733 direct
->speculative
= false;
734 indirect
->speculative
= false;
735 ref
->speculative
= false;
740 else if (node
->next_sibling_clone
)
741 node
= node
->next_sibling_clone
;
744 while (node
!= this && !node
->next_sibling_clone
)
745 node
= node
->clone_of
;
747 node
= node
->next_sibling_clone
;
752 /* Like cgraph_create_edge walk the clone tree and update all clones sharing
753 same function body. If clones already have edge for OLD_STMT; only
754 update the edge same way as cgraph_set_call_stmt_including_clones does.
756 TODO: COUNT and LOOP_DEPTH should be properly distributed based on relative
757 frequencies of the clones. */
760 cgraph_node::create_edge_including_clones (cgraph_node
*callee
,
761 gimple old_stmt
, gcall
*stmt
,
764 cgraph_inline_failed_t reason
)
769 if (!get_edge (stmt
))
771 edge
= create_edge (callee
, stmt
, count
, freq
);
772 edge
->inline_failed
= reason
;
779 cgraph_edge
*edge
= node
->get_edge (old_stmt
);
781 /* It is possible that clones already contain the edge while
782 master didn't. Either we promoted indirect call into direct
783 call in the clone or we are processing clones of unreachable
784 master where edges has been removed. */
786 edge
->set_call_stmt (stmt
);
787 else if (! node
->get_edge (stmt
))
789 edge
= node
->create_edge (callee
, stmt
, count
, freq
);
790 edge
->inline_failed
= reason
;
795 else if (node
->next_sibling_clone
)
796 node
= node
->next_sibling_clone
;
799 while (node
!= this && !node
->next_sibling_clone
)
800 node
= node
->clone_of
;
802 node
= node
->next_sibling_clone
;
807 /* Remove the node from cgraph and all inline clones inlined into it.
808 Skip however removal of FORBIDDEN_NODE and return true if it needs to be
809 removed. This allows to call the function from outer loop walking clone
813 cgraph_node::remove_symbol_and_inline_clones (cgraph_node
*forbidden_node
)
815 cgraph_edge
*e
, *next
;
818 if (this == forbidden_node
)
823 for (e
= callees
; e
; e
= next
)
825 next
= e
->next_callee
;
826 if (!e
->inline_failed
)
827 found
|= e
->callee
->remove_symbol_and_inline_clones (forbidden_node
);
833 /* The edges representing the callers of the NEW_VERSION node were
834 fixed by cgraph_function_versioning (), now the call_expr in their
835 respective tree code should be updated to call the NEW_VERSION. */
838 update_call_expr (cgraph_node
*new_version
)
842 gcc_assert (new_version
);
844 /* Update the call expr on the edges to call the new version. */
845 for (e
= new_version
->callers
; e
; e
= e
->next_caller
)
847 function
*inner_function
= DECL_STRUCT_FUNCTION (e
->caller
->decl
);
848 gimple_call_set_fndecl (e
->call_stmt
, new_version
->decl
);
849 maybe_clean_eh_stmt_fn (inner_function
, e
->call_stmt
);
854 /* Create a new cgraph node which is the new version of
855 callgraph node. REDIRECT_CALLERS holds the callers
856 edges which should be redirected to point to
857 NEW_VERSION. ALL the callees edges of the node
858 are cloned to the new version node. Return the new
861 If non-NULL BLOCK_TO_COPY determine what basic blocks
862 was copied to prevent duplications of calls that are dead
866 cgraph_node::create_version_clone (tree new_decl
,
867 vec
<cgraph_edge
*> redirect_callers
,
870 cgraph_node
*new_version
;
874 new_version
= cgraph_node::create (new_decl
);
876 new_version
->analyzed
= analyzed
;
877 new_version
->definition
= definition
;
878 new_version
->local
= local
;
879 new_version
->externally_visible
= false;
880 new_version
->no_reorder
= no_reorder
;
881 new_version
->local
.local
= new_version
->definition
;
882 new_version
->global
= global
;
883 new_version
->rtl
= rtl
;
884 new_version
->count
= count
;
886 for (e
= callees
; e
; e
=e
->next_callee
)
888 || bitmap_bit_p (bbs_to_copy
, gimple_bb (e
->call_stmt
)->index
))
889 e
->clone (new_version
, e
->call_stmt
,
890 e
->lto_stmt_uid
, REG_BR_PROB_BASE
,
893 for (e
= indirect_calls
; e
; e
=e
->next_callee
)
895 || bitmap_bit_p (bbs_to_copy
, gimple_bb (e
->call_stmt
)->index
))
896 e
->clone (new_version
, e
->call_stmt
,
897 e
->lto_stmt_uid
, REG_BR_PROB_BASE
,
900 FOR_EACH_VEC_ELT (redirect_callers
, i
, e
)
902 /* Redirect calls to the old version node to point to its new
904 e
->redirect_callee (new_version
);
907 symtab
->call_cgraph_duplication_hooks (this, new_version
);
912 /* Perform function versioning.
913 Function versioning includes copying of the tree and
914 a callgraph update (creating a new cgraph node and updating
915 its callees and callers).
917 REDIRECT_CALLERS varray includes the edges to be redirected
920 TREE_MAP is a mapping of tree nodes we want to replace with
921 new ones (according to results of prior analysis).
923 If non-NULL ARGS_TO_SKIP determine function parameters to remove
925 If SKIP_RETURN is true, the new version will return void.
926 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
927 If non_NULL NEW_ENTRY determine new entry BB of the clone.
929 Return the new version's cgraph node. */
932 cgraph_node::create_version_clone_with_body
933 (vec
<cgraph_edge
*> redirect_callers
,
934 vec
<ipa_replace_map
*, va_gc
> *tree_map
, bitmap args_to_skip
,
935 bool skip_return
, bitmap bbs_to_copy
, basic_block new_entry_block
,
936 const char *clone_name
)
938 tree old_decl
= decl
;
939 cgraph_node
*new_version_node
= NULL
;
942 if (!tree_versionable_function_p (old_decl
))
945 gcc_assert (local
.can_change_signature
|| !args_to_skip
);
947 /* Make a new FUNCTION_DECL tree node for the new version. */
948 if (!args_to_skip
&& !skip_return
)
949 new_decl
= copy_node (old_decl
);
952 = build_function_decl_skip_args (old_decl
, args_to_skip
, skip_return
);
954 /* Generate a new name for the new version. */
955 DECL_NAME (new_decl
) = clone_function_name (old_decl
, clone_name
);
956 SET_DECL_ASSEMBLER_NAME (new_decl
, DECL_NAME (new_decl
));
957 SET_DECL_RTL (new_decl
, NULL
);
959 /* When the old decl was a con-/destructor make sure the clone isn't. */
960 DECL_STATIC_CONSTRUCTOR (new_decl
) = 0;
961 DECL_STATIC_DESTRUCTOR (new_decl
) = 0;
963 /* Create the new version's call-graph node.
964 and update the edges of the new node. */
965 new_version_node
= create_version_clone (new_decl
, redirect_callers
,
968 if (ipa_transforms_to_apply
.exists ())
969 new_version_node
->ipa_transforms_to_apply
970 = ipa_transforms_to_apply
.copy ();
971 /* Copy the OLD_VERSION_NODE function tree to the new version. */
972 tree_function_versioning (old_decl
, new_decl
, tree_map
, false, args_to_skip
,
973 skip_return
, bbs_to_copy
, new_entry_block
);
975 /* Update the new version's properties.
976 Make The new version visible only within this translation unit. Make sure
977 that is not weak also.
978 ??? We cannot use COMDAT linkage because there is no
979 ABI support for this. */
980 new_version_node
->make_decl_local ();
981 DECL_VIRTUAL_P (new_version_node
->decl
) = 0;
982 new_version_node
->externally_visible
= 0;
983 new_version_node
->local
.local
= 1;
984 new_version_node
->lowered
= true;
985 /* Clones of global symbols or symbols with unique names are unique. */
986 if ((TREE_PUBLIC (old_decl
)
987 && !DECL_EXTERNAL (old_decl
)
988 && !DECL_WEAK (old_decl
)
989 && !DECL_COMDAT (old_decl
))
991 new_version_node
->unique_name
= true;
993 /* Update the call_expr on the edges to call the new version node. */
994 update_call_expr (new_version_node
);
996 symtab
->call_cgraph_insertion_hooks (this);
997 return new_version_node
;
1000 /* Given virtual clone, turn it into actual clone. */
1003 cgraph_materialize_clone (cgraph_node
*node
)
1005 bitmap_obstack_initialize (NULL
);
1006 node
->former_clone_of
= node
->clone_of
->decl
;
1007 if (node
->clone_of
->former_clone_of
)
1008 node
->former_clone_of
= node
->clone_of
->former_clone_of
;
1009 /* Copy the OLD_VERSION_NODE function tree to the new version. */
1010 tree_function_versioning (node
->clone_of
->decl
, node
->decl
,
1011 node
->clone
.tree_map
, true,
1012 node
->clone
.args_to_skip
, false,
1014 if (symtab
->dump_file
)
1016 dump_function_to_file (node
->clone_of
->decl
, symtab
->dump_file
,
1018 dump_function_to_file (node
->decl
, symtab
->dump_file
, dump_flags
);
1021 /* Function is no longer clone. */
1022 if (node
->next_sibling_clone
)
1023 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
1024 if (node
->prev_sibling_clone
)
1025 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
1027 node
->clone_of
->clones
= node
->next_sibling_clone
;
1028 node
->next_sibling_clone
= NULL
;
1029 node
->prev_sibling_clone
= NULL
;
1030 if (!node
->clone_of
->analyzed
&& !node
->clone_of
->clones
)
1032 node
->clone_of
->release_body ();
1033 node
->clone_of
->remove_callees ();
1034 node
->clone_of
->remove_all_references ();
1036 node
->clone_of
= NULL
;
1037 bitmap_obstack_release (NULL
);
1040 /* Once all functions from compilation unit are in memory, produce all clones
1041 and update all calls. We might also do this on demand if we don't want to
1042 bring all functions to memory prior compilation, but current WHOPR
1043 implementation does that and it is is bit easier to keep everything right in
1047 symbol_table::materialize_all_clones (void)
1050 bool stabilized
= false;
1053 if (symtab
->dump_file
)
1054 fprintf (symtab
->dump_file
, "Materializing clones\n");
1055 #ifdef ENABLE_CHECKING
1056 cgraph_node::verify_cgraph_nodes ();
1059 /* We can also do topological order, but number of iterations should be
1060 bounded by number of IPA passes since single IPA pass is probably not
1061 going to create clones of clones it created itself. */
1065 FOR_EACH_FUNCTION (node
)
1067 if (node
->clone_of
&& node
->decl
!= node
->clone_of
->decl
1068 && !gimple_has_body_p (node
->decl
))
1070 if (!node
->clone_of
->clone_of
)
1071 node
->clone_of
->get_untransformed_body ();
1072 if (gimple_has_body_p (node
->clone_of
->decl
))
1074 if (symtab
->dump_file
)
1076 fprintf (symtab
->dump_file
, "cloning %s to %s\n",
1077 xstrdup (node
->clone_of
->name ()),
1078 xstrdup (node
->name ()));
1079 if (node
->clone
.tree_map
)
1082 fprintf (symtab
->dump_file
, " replace map: ");
1084 i
< vec_safe_length (node
->clone
.tree_map
);
1087 ipa_replace_map
*replace_info
;
1088 replace_info
= (*node
->clone
.tree_map
)[i
];
1089 print_generic_expr (symtab
->dump_file
, replace_info
->old_tree
, 0);
1090 fprintf (symtab
->dump_file
, " -> ");
1091 print_generic_expr (symtab
->dump_file
, replace_info
->new_tree
, 0);
1092 fprintf (symtab
->dump_file
, "%s%s;",
1093 replace_info
->replace_p
? "(replace)":"",
1094 replace_info
->ref_p
? "(ref)":"");
1096 fprintf (symtab
->dump_file
, "\n");
1098 if (node
->clone
.args_to_skip
)
1100 fprintf (symtab
->dump_file
, " args_to_skip: ");
1101 dump_bitmap (symtab
->dump_file
,
1102 node
->clone
.args_to_skip
);
1104 if (node
->clone
.args_to_skip
)
1106 fprintf (symtab
->dump_file
, " combined_args_to_skip:");
1107 dump_bitmap (symtab
->dump_file
, node
->clone
.combined_args_to_skip
);
1110 cgraph_materialize_clone (node
);
1116 FOR_EACH_FUNCTION (node
)
1117 if (!node
->analyzed
&& node
->callees
)
1119 node
->remove_callees ();
1120 node
->remove_all_references ();
1123 node
->clear_stmts_in_references ();
1124 if (symtab
->dump_file
)
1125 fprintf (symtab
->dump_file
, "Materialization Call site updates done.\n");
1126 #ifdef ENABLE_CHECKING
1127 cgraph_node::verify_cgraph_nodes ();
1129 symtab
->remove_unreachable_nodes (false, symtab
->dump_file
);
1132 #include "gt-cgraphclones.h"