2 Copyright (C) 2003-2013 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 "tree-flow.h"
74 #include "tree-inline.h"
75 #include "langhooks.h"
76 #include "pointer-set.h"
83 #include "diagnostic.h"
89 #include "tree-iterator.h"
90 #include "tree-dump.h"
91 #include "gimple-pretty-print.h"
93 #include "ipa-inline.h"
94 #include "ipa-utils.h"
95 #include "lto-streamer.h"
98 /* Create clone of E in the node N represented by CALL_EXPR the callgraph. */
100 cgraph_clone_edge (struct cgraph_edge
*e
, struct cgraph_node
*n
,
101 gimple call_stmt
, unsigned stmt_uid
, gcov_type count_scale
,
102 int freq_scale
, bool update_original
)
104 struct cgraph_edge
*new_edge
;
105 gcov_type count
= apply_probability (e
->count
, count_scale
);
108 /* We do not want to ignore loop nest after frequency drops to 0. */
111 freq
= e
->frequency
* (gcov_type
) freq_scale
/ CGRAPH_FREQ_BASE
;
112 if (freq
> CGRAPH_FREQ_MAX
)
113 freq
= CGRAPH_FREQ_MAX
;
115 if (e
->indirect_unknown_callee
)
119 if (call_stmt
&& (decl
= gimple_call_fndecl (call_stmt
)))
121 struct cgraph_node
*callee
= cgraph_get_node (decl
);
122 gcc_checking_assert (callee
);
123 new_edge
= cgraph_create_edge (n
, callee
, call_stmt
, count
, freq
);
127 new_edge
= cgraph_create_indirect_edge (n
, call_stmt
,
128 e
->indirect_info
->ecf_flags
,
130 *new_edge
->indirect_info
= *e
->indirect_info
;
135 new_edge
= cgraph_create_edge (n
, e
->callee
, call_stmt
, count
, freq
);
136 if (e
->indirect_info
)
138 new_edge
->indirect_info
139 = ggc_alloc_cleared_cgraph_indirect_call_info ();
140 *new_edge
->indirect_info
= *e
->indirect_info
;
144 new_edge
->inline_failed
= e
->inline_failed
;
145 new_edge
->indirect_inlining_edge
= e
->indirect_inlining_edge
;
146 new_edge
->lto_stmt_uid
= stmt_uid
;
147 /* Clone flags that depend on call_stmt availability manually. */
148 new_edge
->can_throw_external
= e
->can_throw_external
;
149 new_edge
->call_stmt_cannot_inline_p
= e
->call_stmt_cannot_inline_p
;
152 e
->count
-= new_edge
->count
;
156 cgraph_call_edge_duplication_hooks (e
, new_edge
);
161 /* Create node representing clone of N executed COUNT times. Decrease
162 the execution counts from original node too.
163 The new clone will have decl set to DECL that may or may not be the same
166 When UPDATE_ORIGINAL is true, the counts are subtracted from the original
167 function's profile to reflect the fact that part of execution is handled
169 When CALL_DUPLICATOIN_HOOK is true, the ipa passes are acknowledged about
170 the new clone. Otherwise the caller is responsible for doing so later.
172 If the new node is being inlined into another one, NEW_INLINED_TO should be
173 the outline function the new one is (even indirectly) inlined to. All hooks
174 will see this in node's global.inlined_to, when invoked. Can be NULL if the
175 node is not inlined. */
178 cgraph_clone_node (struct cgraph_node
*n
, tree decl
, gcov_type count
, int freq
,
179 bool update_original
,
180 vec
<cgraph_edge_p
> redirect_callers
,
181 bool call_duplication_hook
,
182 struct cgraph_node
*new_inlined_to
)
184 struct cgraph_node
*new_node
= cgraph_create_empty_node ();
185 struct cgraph_edge
*e
;
186 gcov_type count_scale
;
189 new_node
->symbol
.decl
= decl
;
190 symtab_register_node ((symtab_node
)new_node
);
191 new_node
->origin
= n
->origin
;
192 new_node
->symbol
.lto_file_data
= n
->symbol
.lto_file_data
;
193 if (new_node
->origin
)
195 new_node
->next_nested
= new_node
->origin
->nested
;
196 new_node
->origin
->nested
= new_node
;
198 new_node
->symbol
.analyzed
= n
->symbol
.analyzed
;
199 new_node
->symbol
.definition
= n
->symbol
.definition
;
200 new_node
->local
= n
->local
;
201 new_node
->symbol
.externally_visible
= false;
202 new_node
->local
.local
= true;
203 new_node
->global
= n
->global
;
204 new_node
->global
.inlined_to
= new_inlined_to
;
205 new_node
->rtl
= n
->rtl
;
206 new_node
->count
= count
;
207 new_node
->frequency
= n
->frequency
;
208 new_node
->clone
= n
->clone
;
209 new_node
->clone
.tree_map
= NULL
;
212 if (new_node
->count
> n
->count
)
213 count_scale
= REG_BR_PROB_BASE
;
215 count_scale
= GCOV_COMPUTE_SCALE (new_node
->count
, n
->count
);
226 FOR_EACH_VEC_ELT (redirect_callers
, i
, e
)
228 /* Redirect calls to the old version node to point to its new
230 cgraph_redirect_edge_callee (e
, new_node
);
234 for (e
= n
->callees
;e
; e
=e
->next_callee
)
235 cgraph_clone_edge (e
, new_node
, e
->call_stmt
, e
->lto_stmt_uid
,
236 count_scale
, freq
, update_original
);
238 for (e
= n
->indirect_calls
; e
; e
= e
->next_callee
)
239 cgraph_clone_edge (e
, new_node
, e
->call_stmt
, e
->lto_stmt_uid
,
240 count_scale
, freq
, update_original
);
241 ipa_clone_references ((symtab_node
)new_node
, &n
->symbol
.ref_list
);
243 new_node
->next_sibling_clone
= n
->clones
;
245 n
->clones
->prev_sibling_clone
= new_node
;
246 n
->clones
= new_node
;
247 new_node
->clone_of
= n
;
249 if (call_duplication_hook
)
250 cgraph_call_node_duplication_hooks (n
, new_node
);
254 /* Create a new name for clone of DECL, add SUFFIX. Returns an identifier. */
256 static GTY(()) unsigned int clone_fn_id_num
;
259 clone_function_name (tree decl
, const char *suffix
)
261 tree name
= DECL_ASSEMBLER_NAME (decl
);
262 size_t len
= IDENTIFIER_LENGTH (name
);
263 char *tmp_name
, *prefix
;
265 prefix
= XALLOCAVEC (char, len
+ strlen (suffix
) + 2);
266 memcpy (prefix
, IDENTIFIER_POINTER (name
), len
);
267 strcpy (prefix
+ len
+ 1, suffix
);
268 #ifndef NO_DOT_IN_LABEL
270 #elif !defined NO_DOLLAR_IN_LABEL
275 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
, clone_fn_id_num
++);
276 return get_identifier (tmp_name
);
279 /* Create callgraph node clone with new declaration. The actual body will
280 be copied later at compilation stage.
282 TODO: after merging in ipa-sra use function call notes instead of args_to_skip
286 cgraph_create_virtual_clone (struct cgraph_node
*old_node
,
287 vec
<cgraph_edge_p
> redirect_callers
,
288 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
292 tree old_decl
= old_node
->symbol
.decl
;
293 struct cgraph_node
*new_node
= NULL
;
296 struct ipa_replace_map
*map
;
299 gcc_checking_assert (tree_versionable_function_p (old_decl
));
301 gcc_assert (old_node
->local
.can_change_signature
|| !args_to_skip
);
303 /* Make a new FUNCTION_DECL tree node */
305 new_decl
= copy_node (old_decl
);
307 new_decl
= build_function_decl_skip_args (old_decl
, args_to_skip
, false);
308 DECL_STRUCT_FUNCTION (new_decl
) = NULL
;
310 /* Generate a new name for the new version. */
311 DECL_NAME (new_decl
) = clone_function_name (old_decl
, suffix
);
312 SET_DECL_ASSEMBLER_NAME (new_decl
, DECL_NAME (new_decl
));
313 SET_DECL_RTL (new_decl
, NULL
);
315 new_node
= cgraph_clone_node (old_node
, new_decl
, old_node
->count
,
316 CGRAPH_FREQ_BASE
, false,
317 redirect_callers
, false, NULL
);
318 /* Update the properties.
319 Make clone visible only within this translation unit. Make sure
320 that is not weak also.
321 ??? We cannot use COMDAT linkage because there is no
322 ABI support for this. */
323 DECL_EXTERNAL (new_node
->symbol
.decl
) = 0;
324 if (DECL_ONE_ONLY (old_decl
))
325 DECL_SECTION_NAME (new_node
->symbol
.decl
) = NULL
;
326 DECL_COMDAT_GROUP (new_node
->symbol
.decl
) = 0;
327 TREE_PUBLIC (new_node
->symbol
.decl
) = 0;
328 DECL_COMDAT (new_node
->symbol
.decl
) = 0;
329 DECL_WEAK (new_node
->symbol
.decl
) = 0;
330 DECL_VIRTUAL_P (new_node
->symbol
.decl
) = 0;
331 DECL_STATIC_CONSTRUCTOR (new_node
->symbol
.decl
) = 0;
332 DECL_STATIC_DESTRUCTOR (new_node
->symbol
.decl
) = 0;
333 new_node
->clone
.tree_map
= tree_map
;
334 new_node
->clone
.args_to_skip
= args_to_skip
;
336 /* Clones of global symbols or symbols with unique names are unique. */
337 if ((TREE_PUBLIC (old_decl
)
338 && !DECL_EXTERNAL (old_decl
)
339 && !DECL_WEAK (old_decl
)
340 && !DECL_COMDAT (old_decl
))
342 new_node
->symbol
.unique_name
= true;
343 FOR_EACH_VEC_SAFE_ELT (tree_map
, i
, map
)
344 ipa_maybe_record_reference ((symtab_node
) new_node
, map
->new_tree
,
347 new_node
->clone
.combined_args_to_skip
= old_node
->clone
.combined_args_to_skip
;
348 else if (old_node
->clone
.combined_args_to_skip
)
350 int newi
= 0, oldi
= 0;
352 bitmap new_args_to_skip
= BITMAP_GGC_ALLOC ();
353 struct cgraph_node
*orig_node
;
354 for (orig_node
= old_node
; orig_node
->clone_of
; orig_node
= orig_node
->clone_of
)
356 for (arg
= DECL_ARGUMENTS (orig_node
->symbol
.decl
);
357 arg
; arg
= DECL_CHAIN (arg
), oldi
++)
359 if (bitmap_bit_p (old_node
->clone
.combined_args_to_skip
, oldi
))
361 bitmap_set_bit (new_args_to_skip
, oldi
);
364 if (bitmap_bit_p (args_to_skip
, newi
))
365 bitmap_set_bit (new_args_to_skip
, oldi
);
368 new_node
->clone
.combined_args_to_skip
= new_args_to_skip
;
371 new_node
->clone
.combined_args_to_skip
= args_to_skip
;
372 new_node
->symbol
.externally_visible
= 0;
373 new_node
->local
.local
= 1;
374 new_node
->lowered
= true;
376 cgraph_call_node_duplication_hooks (old_node
, new_node
);
382 /* NODE is being removed from symbol table; see if its entry can be replaced by
383 other inline clone. */
385 cgraph_find_replacement_node (struct cgraph_node
*node
)
387 struct cgraph_node
*next_inline_clone
, *replacement
;
389 for (next_inline_clone
= node
->clones
;
391 && next_inline_clone
->symbol
.decl
!= node
->symbol
.decl
;
392 next_inline_clone
= next_inline_clone
->next_sibling_clone
)
395 /* If there is inline clone of the node being removed, we need
396 to put it into the position of removed node and reorganize all
397 other clones to be based on it. */
398 if (next_inline_clone
)
400 struct cgraph_node
*n
;
401 struct cgraph_node
*new_clones
;
403 replacement
= next_inline_clone
;
405 /* Unlink inline clone from the list of clones of removed node. */
406 if (next_inline_clone
->next_sibling_clone
)
407 next_inline_clone
->next_sibling_clone
->prev_sibling_clone
408 = next_inline_clone
->prev_sibling_clone
;
409 if (next_inline_clone
->prev_sibling_clone
)
411 gcc_assert (node
->clones
!= next_inline_clone
);
412 next_inline_clone
->prev_sibling_clone
->next_sibling_clone
413 = next_inline_clone
->next_sibling_clone
;
417 gcc_assert (node
->clones
== next_inline_clone
);
418 node
->clones
= next_inline_clone
->next_sibling_clone
;
421 new_clones
= node
->clones
;
424 /* Copy clone info. */
425 next_inline_clone
->clone
= node
->clone
;
427 /* Now place it into clone tree at same level at NODE. */
428 next_inline_clone
->clone_of
= node
->clone_of
;
429 next_inline_clone
->prev_sibling_clone
= NULL
;
430 next_inline_clone
->next_sibling_clone
= NULL
;
433 if (node
->clone_of
->clones
)
434 node
->clone_of
->clones
->prev_sibling_clone
= next_inline_clone
;
435 next_inline_clone
->next_sibling_clone
= node
->clone_of
->clones
;
436 node
->clone_of
->clones
= next_inline_clone
;
439 /* Merge the clone list. */
442 if (!next_inline_clone
->clones
)
443 next_inline_clone
->clones
= new_clones
;
446 n
= next_inline_clone
->clones
;
447 while (n
->next_sibling_clone
)
448 n
= n
->next_sibling_clone
;
449 n
->next_sibling_clone
= new_clones
;
450 new_clones
->prev_sibling_clone
= n
;
454 /* Update clone_of pointers. */
458 n
->clone_of
= next_inline_clone
;
459 n
= n
->next_sibling_clone
;
467 /* Like cgraph_set_call_stmt but walk the clone tree and update all
468 clones sharing the same function body. */
471 cgraph_set_call_stmt_including_clones (struct cgraph_node
*orig
,
472 gimple old_stmt
, gimple new_stmt
)
474 struct cgraph_node
*node
;
475 struct cgraph_edge
*edge
= cgraph_edge (orig
, old_stmt
);
478 cgraph_set_call_stmt (edge
, new_stmt
);
484 struct cgraph_edge
*edge
= cgraph_edge (node
, old_stmt
);
486 cgraph_set_call_stmt (edge
, new_stmt
);
489 else if (node
->next_sibling_clone
)
490 node
= node
->next_sibling_clone
;
493 while (node
!= orig
&& !node
->next_sibling_clone
)
494 node
= node
->clone_of
;
496 node
= node
->next_sibling_clone
;
501 /* Like cgraph_create_edge walk the clone tree and update all clones sharing
502 same function body. If clones already have edge for OLD_STMT; only
503 update the edge same way as cgraph_set_call_stmt_including_clones does.
505 TODO: COUNT and LOOP_DEPTH should be properly distributed based on relative
506 frequencies of the clones. */
509 cgraph_create_edge_including_clones (struct cgraph_node
*orig
,
510 struct cgraph_node
*callee
,
512 gimple stmt
, gcov_type count
,
514 cgraph_inline_failed_t reason
)
516 struct cgraph_node
*node
;
517 struct cgraph_edge
*edge
;
519 if (!cgraph_edge (orig
, stmt
))
521 edge
= cgraph_create_edge (orig
, callee
, stmt
, count
, freq
);
522 edge
->inline_failed
= reason
;
529 struct cgraph_edge
*edge
= cgraph_edge (node
, old_stmt
);
531 /* It is possible that clones already contain the edge while
532 master didn't. Either we promoted indirect call into direct
533 call in the clone or we are processing clones of unreachable
534 master where edges has been removed. */
536 cgraph_set_call_stmt (edge
, stmt
);
537 else if (!cgraph_edge (node
, stmt
))
539 edge
= cgraph_create_edge (node
, callee
, stmt
, count
,
541 edge
->inline_failed
= reason
;
546 else if (node
->next_sibling_clone
)
547 node
= node
->next_sibling_clone
;
550 while (node
!= orig
&& !node
->next_sibling_clone
)
551 node
= node
->clone_of
;
553 node
= node
->next_sibling_clone
;
558 /* Remove the node from cgraph and all inline clones inlined into it.
559 Skip however removal of FORBIDDEN_NODE and return true if it needs to be
560 removed. This allows to call the function from outer loop walking clone
564 cgraph_remove_node_and_inline_clones (struct cgraph_node
*node
, struct cgraph_node
*forbidden_node
)
566 struct cgraph_edge
*e
, *next
;
569 if (node
== forbidden_node
)
571 cgraph_remove_edge (node
->callers
);
574 for (e
= node
->callees
; e
; e
= next
)
576 next
= e
->next_callee
;
577 if (!e
->inline_failed
)
578 found
|= cgraph_remove_node_and_inline_clones (e
->callee
, forbidden_node
);
580 cgraph_remove_node (node
);
584 /* The edges representing the callers of the NEW_VERSION node were
585 fixed by cgraph_function_versioning (), now the call_expr in their
586 respective tree code should be updated to call the NEW_VERSION. */
589 update_call_expr (struct cgraph_node
*new_version
)
591 struct cgraph_edge
*e
;
593 gcc_assert (new_version
);
595 /* Update the call expr on the edges to call the new version. */
596 for (e
= new_version
->callers
; e
; e
= e
->next_caller
)
598 struct function
*inner_function
= DECL_STRUCT_FUNCTION (e
->caller
->symbol
.decl
);
599 gimple_call_set_fndecl (e
->call_stmt
, new_version
->symbol
.decl
);
600 maybe_clean_eh_stmt_fn (inner_function
, e
->call_stmt
);
605 /* Create a new cgraph node which is the new version of
606 OLD_VERSION node. REDIRECT_CALLERS holds the callers
607 edges which should be redirected to point to
608 NEW_VERSION. ALL the callees edges of OLD_VERSION
609 are cloned to the new version node. Return the new
612 If non-NULL BLOCK_TO_COPY determine what basic blocks
613 was copied to prevent duplications of calls that are dead
617 cgraph_copy_node_for_versioning (struct cgraph_node
*old_version
,
619 vec
<cgraph_edge_p
> redirect_callers
,
622 struct cgraph_node
*new_version
;
623 struct cgraph_edge
*e
;
626 gcc_assert (old_version
);
628 new_version
= cgraph_create_node (new_decl
);
630 new_version
->symbol
.analyzed
= old_version
->symbol
.analyzed
;
631 new_version
->symbol
.definition
= old_version
->symbol
.definition
;
632 new_version
->local
= old_version
->local
;
633 new_version
->symbol
.externally_visible
= false;
634 new_version
->local
.local
= new_version
->symbol
.definition
;
635 new_version
->global
= old_version
->global
;
636 new_version
->rtl
= old_version
->rtl
;
637 new_version
->count
= old_version
->count
;
639 for (e
= old_version
->callees
; e
; e
=e
->next_callee
)
641 || bitmap_bit_p (bbs_to_copy
, gimple_bb (e
->call_stmt
)->index
))
642 cgraph_clone_edge (e
, new_version
, e
->call_stmt
,
643 e
->lto_stmt_uid
, REG_BR_PROB_BASE
,
646 for (e
= old_version
->indirect_calls
; e
; e
=e
->next_callee
)
648 || bitmap_bit_p (bbs_to_copy
, gimple_bb (e
->call_stmt
)->index
))
649 cgraph_clone_edge (e
, new_version
, e
->call_stmt
,
650 e
->lto_stmt_uid
, REG_BR_PROB_BASE
,
653 FOR_EACH_VEC_ELT (redirect_callers
, i
, e
)
655 /* Redirect calls to the old version node to point to its new
657 cgraph_redirect_edge_callee (e
, new_version
);
660 cgraph_call_node_duplication_hooks (old_version
, new_version
);
665 /* Perform function versioning.
666 Function versioning includes copying of the tree and
667 a callgraph update (creating a new cgraph node and updating
668 its callees and callers).
670 REDIRECT_CALLERS varray includes the edges to be redirected
673 TREE_MAP is a mapping of tree nodes we want to replace with
674 new ones (according to results of prior analysis).
675 OLD_VERSION_NODE is the node that is versioned.
677 If non-NULL ARGS_TO_SKIP determine function parameters to remove
679 If SKIP_RETURN is true, the new version will return void.
680 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
681 If non_NULL NEW_ENTRY determine new entry BB of the clone.
683 Return the new version's cgraph node. */
686 cgraph_function_versioning (struct cgraph_node
*old_version_node
,
687 vec
<cgraph_edge_p
> redirect_callers
,
688 vec
<ipa_replace_map_p
, va_gc
> *tree_map
,
692 basic_block new_entry_block
,
693 const char *clone_name
)
695 tree old_decl
= old_version_node
->symbol
.decl
;
696 struct cgraph_node
*new_version_node
= NULL
;
699 if (!tree_versionable_function_p (old_decl
))
702 gcc_assert (old_version_node
->local
.can_change_signature
|| !args_to_skip
);
704 /* Make a new FUNCTION_DECL tree node for the new version. */
705 if (!args_to_skip
&& !skip_return
)
706 new_decl
= copy_node (old_decl
);
709 = build_function_decl_skip_args (old_decl
, args_to_skip
, skip_return
);
711 /* Generate a new name for the new version. */
712 DECL_NAME (new_decl
) = clone_function_name (old_decl
, clone_name
);
713 SET_DECL_ASSEMBLER_NAME (new_decl
, DECL_NAME (new_decl
));
714 SET_DECL_RTL (new_decl
, NULL
);
716 /* When the old decl was a con-/destructor make sure the clone isn't. */
717 DECL_STATIC_CONSTRUCTOR(new_decl
) = 0;
718 DECL_STATIC_DESTRUCTOR(new_decl
) = 0;
720 /* Create the new version's call-graph node.
721 and update the edges of the new node. */
723 cgraph_copy_node_for_versioning (old_version_node
, new_decl
,
724 redirect_callers
, bbs_to_copy
);
726 /* Copy the OLD_VERSION_NODE function tree to the new version. */
727 tree_function_versioning (old_decl
, new_decl
, tree_map
, false, args_to_skip
,
728 skip_return
, bbs_to_copy
, new_entry_block
);
730 /* Update the new version's properties.
731 Make The new version visible only within this translation unit. Make sure
732 that is not weak also.
733 ??? We cannot use COMDAT linkage because there is no
734 ABI support for this. */
735 symtab_make_decl_local (new_version_node
->symbol
.decl
);
736 DECL_VIRTUAL_P (new_version_node
->symbol
.decl
) = 0;
737 new_version_node
->symbol
.externally_visible
= 0;
738 new_version_node
->local
.local
= 1;
739 new_version_node
->lowered
= true;
740 /* Clones of global symbols or symbols with unique names are unique. */
741 if ((TREE_PUBLIC (old_decl
)
742 && !DECL_EXTERNAL (old_decl
)
743 && !DECL_WEAK (old_decl
)
744 && !DECL_COMDAT (old_decl
))
746 new_version_node
->symbol
.unique_name
= true;
748 /* Update the call_expr on the edges to call the new version node. */
749 update_call_expr (new_version_node
);
751 cgraph_call_function_insertion_hooks (new_version_node
);
752 return new_version_node
;
755 /* Given virtual clone, turn it into actual clone. */
758 cgraph_materialize_clone (struct cgraph_node
*node
)
760 bitmap_obstack_initialize (NULL
);
761 node
->former_clone_of
= node
->clone_of
->symbol
.decl
;
762 if (node
->clone_of
->former_clone_of
)
763 node
->former_clone_of
= node
->clone_of
->former_clone_of
;
764 /* Copy the OLD_VERSION_NODE function tree to the new version. */
765 tree_function_versioning (node
->clone_of
->symbol
.decl
, node
->symbol
.decl
,
766 node
->clone
.tree_map
, true,
767 node
->clone
.args_to_skip
, false,
769 if (cgraph_dump_file
)
771 dump_function_to_file (node
->clone_of
->symbol
.decl
, cgraph_dump_file
, dump_flags
);
772 dump_function_to_file (node
->symbol
.decl
, cgraph_dump_file
, dump_flags
);
775 /* Function is no longer clone. */
776 if (node
->next_sibling_clone
)
777 node
->next_sibling_clone
->prev_sibling_clone
= node
->prev_sibling_clone
;
778 if (node
->prev_sibling_clone
)
779 node
->prev_sibling_clone
->next_sibling_clone
= node
->next_sibling_clone
;
781 node
->clone_of
->clones
= node
->next_sibling_clone
;
782 node
->next_sibling_clone
= NULL
;
783 node
->prev_sibling_clone
= NULL
;
784 if (!node
->clone_of
->symbol
.analyzed
&& !node
->clone_of
->clones
)
786 cgraph_release_function_body (node
->clone_of
);
787 cgraph_node_remove_callees (node
->clone_of
);
788 ipa_remove_all_references (&node
->clone_of
->symbol
.ref_list
);
790 node
->clone_of
= NULL
;
791 bitmap_obstack_release (NULL
);
794 /* Once all functions from compilation unit are in memory, produce all clones
795 and update all calls. We might also do this on demand if we don't want to
796 bring all functions to memory prior compilation, but current WHOPR
797 implementation does that and it is is bit easier to keep everything right in
801 cgraph_materialize_all_clones (void)
803 struct cgraph_node
*node
;
804 bool stabilized
= false;
806 if (cgraph_dump_file
)
807 fprintf (cgraph_dump_file
, "Materializing clones\n");
808 #ifdef ENABLE_CHECKING
812 /* We can also do topological order, but number of iterations should be
813 bounded by number of IPA passes since single IPA pass is probably not
814 going to create clones of clones it created itself. */
818 FOR_EACH_FUNCTION (node
)
820 if (node
->clone_of
&& node
->symbol
.decl
!= node
->clone_of
->symbol
.decl
821 && !gimple_has_body_p (node
->symbol
.decl
))
823 if (gimple_has_body_p (node
->clone_of
->symbol
.decl
))
825 if (cgraph_dump_file
)
827 fprintf (cgraph_dump_file
, "cloning %s to %s\n",
828 xstrdup (cgraph_node_name (node
->clone_of
)),
829 xstrdup (cgraph_node_name (node
)));
830 if (node
->clone
.tree_map
)
833 fprintf (cgraph_dump_file
, " replace map: ");
835 i
< vec_safe_length (node
->clone
.tree_map
);
838 struct ipa_replace_map
*replace_info
;
839 replace_info
= (*node
->clone
.tree_map
)[i
];
840 print_generic_expr (cgraph_dump_file
, replace_info
->old_tree
, 0);
841 fprintf (cgraph_dump_file
, " -> ");
842 print_generic_expr (cgraph_dump_file
, replace_info
->new_tree
, 0);
843 fprintf (cgraph_dump_file
, "%s%s;",
844 replace_info
->replace_p
? "(replace)":"",
845 replace_info
->ref_p
? "(ref)":"");
847 fprintf (cgraph_dump_file
, "\n");
849 if (node
->clone
.args_to_skip
)
851 fprintf (cgraph_dump_file
, " args_to_skip: ");
852 dump_bitmap (cgraph_dump_file
, node
->clone
.args_to_skip
);
854 if (node
->clone
.args_to_skip
)
856 fprintf (cgraph_dump_file
, " combined_args_to_skip:");
857 dump_bitmap (cgraph_dump_file
, node
->clone
.combined_args_to_skip
);
860 cgraph_materialize_clone (node
);
866 FOR_EACH_FUNCTION (node
)
867 if (!node
->symbol
.analyzed
&& node
->callees
)
868 cgraph_node_remove_callees (node
);
869 if (cgraph_dump_file
)
870 fprintf (cgraph_dump_file
, "Materialization Call site updates done.\n");
871 #ifdef ENABLE_CHECKING
874 symtab_remove_unreachable_nodes (false, cgraph_dump_file
);
877 #include "gt-cgraphclones.h"