]>
Commit | Line | Data |
---|---|---|
564fe867 | 1 | /* Callgraph clones |
5624e564 | 2 | Copyright (C) 2003-2015 Free Software Foundation, Inc. |
564fe867 JH |
3 | Contributed by Jan Hubicka |
4 | ||
5 | This file is part of GCC. | |
6 | ||
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 | |
10 | version. | |
11 | ||
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 | |
15 | for more details. | |
16 | ||
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/>. */ | |
20 | ||
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. | |
24 | ||
25 | To allow whole program optimization without actual presence of function | |
26 | bodies, an additional infrastructure is provided for so-called virtual | |
27 | clones | |
28 | ||
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). | |
32 | ||
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. | |
38 | ||
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. | |
42 | ||
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 | |
49 | a given function. | |
50 | ||
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. | |
54 | ||
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. | |
61 | ||
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. */ | |
66 | ||
67 | #include "config.h" | |
68 | #include "system.h" | |
69 | #include "coretypes.h" | |
70 | #include "tm.h" | |
d8a2d370 | 71 | #include "rtl.h" |
83685514 | 72 | #include "hash-set.h" |
83685514 | 73 | #include "machmode.h" |
40e23961 MC |
74 | #include "vec.h" |
75 | #include "double-int.h" | |
76 | #include "input.h" | |
77 | #include "alias.h" | |
78 | #include "symtab.h" | |
79 | #include "wide-int.h" | |
80 | #include "inchash.h" | |
81 | #include "tree.h" | |
82 | #include "fold-const.h" | |
83 | #include "stringpool.h" | |
83685514 AM |
84 | #include "hard-reg-set.h" |
85 | #include "input.h" | |
d8a2d370 DN |
86 | #include "function.h" |
87 | #include "emit-rtl.h" | |
60393bbc | 88 | #include "predict.h" |
2fb9a547 AM |
89 | #include "basic-block.h" |
90 | #include "tree-ssa-alias.h" | |
91 | #include "internal-fn.h" | |
92 | #include "tree-eh.h" | |
93 | #include "gimple-expr.h" | |
94 | #include "is-a.h" | |
8e9055ae | 95 | #include "gimple.h" |
442b4905 AM |
96 | #include "bitmap.h" |
97 | #include "tree-cfg.h" | |
564fe867 JH |
98 | #include "tree-inline.h" |
99 | #include "langhooks.h" | |
564fe867 JH |
100 | #include "toplev.h" |
101 | #include "flags.h" | |
564fe867 JH |
102 | #include "debug.h" |
103 | #include "target.h" | |
564fe867 | 104 | #include "diagnostic.h" |
564fe867 | 105 | #include "params.h" |
564fe867 | 106 | #include "intl.h" |
c582198b AM |
107 | #include "hash-map.h" |
108 | #include "plugin-api.h" | |
109 | #include "ipa-ref.h" | |
110 | #include "cgraph.h" | |
111 | #include "alloc-pool.h" | |
dd912cb8 | 112 | #include "symbol-summary.h" |
564fe867 | 113 | #include "ipa-prop.h" |
564fe867 | 114 | #include "tree-iterator.h" |
564fe867 JH |
115 | #include "tree-dump.h" |
116 | #include "gimple-pretty-print.h" | |
564fe867 | 117 | #include "coverage.h" |
564fe867 JH |
118 | #include "ipa-inline.h" |
119 | #include "ipa-utils.h" | |
120 | #include "lto-streamer.h" | |
121 | #include "except.h" | |
122 | ||
3dafb85c ML |
123 | /* Create clone of edge in the node N represented by CALL_EXPR |
124 | the callgraph. */ | |
125 | ||
126 | cgraph_edge * | |
538dd0b7 | 127 | cgraph_edge::clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid, |
3dafb85c | 128 | gcov_type count_scale, int freq_scale, bool update_original) |
564fe867 | 129 | { |
3dafb85c ML |
130 | cgraph_edge *new_edge; |
131 | gcov_type gcov_count = apply_probability (count, count_scale); | |
564fe867 JH |
132 | gcov_type freq; |
133 | ||
134 | /* We do not want to ignore loop nest after frequency drops to 0. */ | |
135 | if (!freq_scale) | |
136 | freq_scale = 1; | |
3dafb85c | 137 | freq = frequency * (gcov_type) freq_scale / CGRAPH_FREQ_BASE; |
564fe867 JH |
138 | if (freq > CGRAPH_FREQ_MAX) |
139 | freq = CGRAPH_FREQ_MAX; | |
140 | ||
3dafb85c | 141 | if (indirect_unknown_callee) |
564fe867 JH |
142 | { |
143 | tree decl; | |
144 | ||
e57872ee JH |
145 | if (call_stmt && (decl = gimple_call_fndecl (call_stmt)) |
146 | /* When the call is speculative, we need to resolve it | |
147 | via cgraph_resolve_speculation and not here. */ | |
3dafb85c | 148 | && !speculative) |
564fe867 | 149 | { |
3dafb85c | 150 | cgraph_node *callee = cgraph_node::get (decl); |
564fe867 | 151 | gcc_checking_assert (callee); |
3dafb85c | 152 | new_edge = n->create_edge (callee, call_stmt, gcov_count, freq); |
564fe867 JH |
153 | } |
154 | else | |
155 | { | |
d52f5295 | 156 | new_edge = n->create_indirect_edge (call_stmt, |
3dafb85c | 157 | indirect_info->ecf_flags, |
d34af022 | 158 | count, freq, false); |
3dafb85c | 159 | *new_edge->indirect_info = *indirect_info; |
564fe867 JH |
160 | } |
161 | } | |
162 | else | |
163 | { | |
3dafb85c ML |
164 | new_edge = n->create_edge (callee, call_stmt, gcov_count, freq); |
165 | if (indirect_info) | |
564fe867 JH |
166 | { |
167 | new_edge->indirect_info | |
766090c2 | 168 | = ggc_cleared_alloc<cgraph_indirect_call_info> (); |
3dafb85c | 169 | *new_edge->indirect_info = *indirect_info; |
564fe867 JH |
170 | } |
171 | } | |
172 | ||
3dafb85c ML |
173 | new_edge->inline_failed = inline_failed; |
174 | new_edge->indirect_inlining_edge = indirect_inlining_edge; | |
564fe867 JH |
175 | new_edge->lto_stmt_uid = stmt_uid; |
176 | /* Clone flags that depend on call_stmt availability manually. */ | |
3dafb85c ML |
177 | new_edge->can_throw_external = can_throw_external; |
178 | new_edge->call_stmt_cannot_inline_p = call_stmt_cannot_inline_p; | |
179 | new_edge->speculative = speculative; | |
f9bb202b | 180 | new_edge->in_polymorphic_cdtor = in_polymorphic_cdtor; |
564fe867 JH |
181 | if (update_original) |
182 | { | |
3dafb85c ML |
183 | count -= new_edge->count; |
184 | if (count < 0) | |
185 | count = 0; | |
564fe867 | 186 | } |
3dafb85c | 187 | symtab->call_edge_duplication_hooks (this, new_edge); |
564fe867 JH |
188 | return new_edge; |
189 | } | |
190 | ||
610c8ef0 MJ |
191 | /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the |
192 | return value if SKIP_RETURN is true. */ | |
193 | ||
194 | static tree | |
195 | build_function_type_skip_args (tree orig_type, bitmap args_to_skip, | |
196 | bool skip_return) | |
197 | { | |
198 | tree new_type = NULL; | |
5ae5a238 | 199 | tree args, new_args = NULL; |
610c8ef0 MJ |
200 | tree new_reversed; |
201 | int i = 0; | |
202 | ||
203 | for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node; | |
204 | args = TREE_CHAIN (args), i++) | |
205 | if (!args_to_skip || !bitmap_bit_p (args_to_skip, i)) | |
206 | new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args); | |
207 | ||
208 | new_reversed = nreverse (new_args); | |
209 | if (args) | |
210 | { | |
211 | if (new_reversed) | |
212 | TREE_CHAIN (new_args) = void_list_node; | |
213 | else | |
214 | new_reversed = void_list_node; | |
215 | } | |
216 | ||
217 | /* Use copy_node to preserve as much as possible from original type | |
218 | (debug info, attribute lists etc.) | |
219 | Exception is METHOD_TYPEs must have THIS argument. | |
220 | When we are asked to remove it, we need to build new FUNCTION_TYPE | |
221 | instead. */ | |
222 | if (TREE_CODE (orig_type) != METHOD_TYPE | |
223 | || !args_to_skip | |
224 | || !bitmap_bit_p (args_to_skip, 0)) | |
225 | { | |
226 | new_type = build_distinct_type_copy (orig_type); | |
227 | TYPE_ARG_TYPES (new_type) = new_reversed; | |
228 | } | |
229 | else | |
230 | { | |
231 | new_type | |
232 | = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type), | |
233 | new_reversed)); | |
234 | TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type); | |
235 | } | |
236 | ||
237 | if (skip_return) | |
238 | TREE_TYPE (new_type) = void_type_node; | |
239 | ||
610c8ef0 MJ |
240 | return new_type; |
241 | } | |
242 | ||
243 | /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the | |
244 | return value if SKIP_RETURN is true. | |
245 | ||
246 | Arguments from DECL_ARGUMENTS list can't be removed now, since they are | |
247 | linked by TREE_CHAIN directly. The caller is responsible for eliminating | |
248 | them when they are being duplicated (i.e. copy_arguments_for_versioning). */ | |
249 | ||
250 | static tree | |
251 | build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip, | |
252 | bool skip_return) | |
253 | { | |
254 | tree new_decl = copy_node (orig_decl); | |
255 | tree new_type; | |
256 | ||
257 | new_type = TREE_TYPE (orig_decl); | |
258 | if (prototype_p (new_type) | |
259 | || (skip_return && !VOID_TYPE_P (TREE_TYPE (new_type)))) | |
260 | new_type | |
261 | = build_function_type_skip_args (new_type, args_to_skip, skip_return); | |
262 | TREE_TYPE (new_decl) = new_type; | |
263 | ||
264 | /* For declarations setting DECL_VINDEX (i.e. methods) | |
265 | we expect first argument to be THIS pointer. */ | |
266 | if (args_to_skip && bitmap_bit_p (args_to_skip, 0)) | |
267 | DECL_VINDEX (new_decl) = NULL_TREE; | |
268 | ||
269 | /* When signature changes, we need to clear builtin info. */ | |
270 | if (DECL_BUILT_IN (new_decl) | |
271 | && args_to_skip | |
272 | && !bitmap_empty_p (args_to_skip)) | |
273 | { | |
274 | DECL_BUILT_IN_CLASS (new_decl) = NOT_BUILT_IN; | |
275 | DECL_FUNCTION_CODE (new_decl) = (enum built_in_function) 0; | |
276 | } | |
277 | /* The FE might have information and assumptions about the other | |
278 | arguments. */ | |
279 | DECL_LANG_SPECIFIC (new_decl) = NULL; | |
280 | return new_decl; | |
281 | } | |
282 | ||
283 | /* Set flags of NEW_NODE and its decl. NEW_NODE is a newly created private | |
284 | clone or its thunk. */ | |
285 | ||
286 | static void | |
287 | set_new_clone_decl_and_node_flags (cgraph_node *new_node) | |
288 | { | |
289 | DECL_EXTERNAL (new_node->decl) = 0; | |
610c8ef0 MJ |
290 | TREE_PUBLIC (new_node->decl) = 0; |
291 | DECL_COMDAT (new_node->decl) = 0; | |
292 | DECL_WEAK (new_node->decl) = 0; | |
293 | DECL_VIRTUAL_P (new_node->decl) = 0; | |
294 | DECL_STATIC_CONSTRUCTOR (new_node->decl) = 0; | |
295 | DECL_STATIC_DESTRUCTOR (new_node->decl) = 0; | |
296 | ||
297 | new_node->externally_visible = 0; | |
298 | new_node->local.local = 1; | |
299 | new_node->lowered = true; | |
300 | } | |
301 | ||
302 | /* Duplicate thunk THUNK if necessary but make it to refer to NODE. | |
303 | ARGS_TO_SKIP, if non-NULL, determines which parameters should be omitted. | |
304 | Function can return NODE if no thunk is necessary, which can happen when | |
305 | thunk is this_adjusting but we are removing this parameter. */ | |
306 | ||
307 | static cgraph_node * | |
d284e1b8 | 308 | duplicate_thunk_for_node (cgraph_node *thunk, cgraph_node *node) |
610c8ef0 MJ |
309 | { |
310 | cgraph_node *new_thunk, *thunk_of; | |
d52f5295 | 311 | thunk_of = thunk->callees->callee->ultimate_alias_target (); |
610c8ef0 MJ |
312 | |
313 | if (thunk_of->thunk.thunk_p) | |
d284e1b8 | 314 | node = duplicate_thunk_for_node (thunk_of, node); |
610c8ef0 | 315 | |
48fb6d40 | 316 | if (!DECL_ARGUMENTS (thunk->decl)) |
70486010 | 317 | thunk->get_untransformed_body (); |
48fb6d40 | 318 | |
3dafb85c | 319 | cgraph_edge *cs; |
610c8ef0 MJ |
320 | for (cs = node->callers; cs; cs = cs->next_caller) |
321 | if (cs->caller->thunk.thunk_p | |
322 | && cs->caller->thunk.this_adjusting == thunk->thunk.this_adjusting | |
323 | && cs->caller->thunk.fixed_offset == thunk->thunk.fixed_offset | |
324 | && cs->caller->thunk.virtual_offset_p == thunk->thunk.virtual_offset_p | |
325 | && cs->caller->thunk.virtual_value == thunk->thunk.virtual_value) | |
326 | return cs->caller; | |
327 | ||
328 | tree new_decl; | |
d284e1b8 | 329 | if (!node->clone.args_to_skip) |
610c8ef0 MJ |
330 | new_decl = copy_node (thunk->decl); |
331 | else | |
332 | { | |
333 | /* We do not need to duplicate this_adjusting thunks if we have removed | |
334 | this. */ | |
335 | if (thunk->thunk.this_adjusting | |
d284e1b8 | 336 | && bitmap_bit_p (node->clone.args_to_skip, 0)) |
610c8ef0 MJ |
337 | return node; |
338 | ||
d284e1b8 MJ |
339 | new_decl = build_function_decl_skip_args (thunk->decl, |
340 | node->clone.args_to_skip, | |
610c8ef0 MJ |
341 | false); |
342 | } | |
bec63208 MJ |
343 | |
344 | tree *link = &DECL_ARGUMENTS (new_decl); | |
345 | int i = 0; | |
346 | for (tree pd = DECL_ARGUMENTS (thunk->decl); pd; pd = DECL_CHAIN (pd), i++) | |
347 | { | |
348 | if (!node->clone.args_to_skip | |
349 | || !bitmap_bit_p (node->clone.args_to_skip, i)) | |
350 | { | |
351 | tree nd = copy_node (pd); | |
352 | DECL_CONTEXT (nd) = new_decl; | |
353 | *link = nd; | |
354 | link = &DECL_CHAIN (nd); | |
355 | } | |
356 | } | |
357 | *link = NULL_TREE; | |
358 | ||
610c8ef0 MJ |
359 | gcc_checking_assert (!DECL_STRUCT_FUNCTION (new_decl)); |
360 | gcc_checking_assert (!DECL_INITIAL (new_decl)); | |
361 | gcc_checking_assert (!DECL_RESULT (new_decl)); | |
362 | gcc_checking_assert (!DECL_RTL_SET_P (new_decl)); | |
363 | ||
364 | DECL_NAME (new_decl) = clone_function_name (thunk->decl, "artificial_thunk"); | |
365 | SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl)); | |
610c8ef0 | 366 | |
d52f5295 | 367 | new_thunk = cgraph_node::create (new_decl); |
610c8ef0 MJ |
368 | set_new_clone_decl_and_node_flags (new_thunk); |
369 | new_thunk->definition = true; | |
370 | new_thunk->thunk = thunk->thunk; | |
371 | new_thunk->unique_name = in_lto_p; | |
372 | new_thunk->former_clone_of = thunk->decl; | |
d284e1b8 MJ |
373 | new_thunk->clone.args_to_skip = node->clone.args_to_skip; |
374 | new_thunk->clone.combined_args_to_skip = node->clone.combined_args_to_skip; | |
610c8ef0 | 375 | |
3dafb85c | 376 | cgraph_edge *e = new_thunk->create_edge (node, NULL, 0, |
d52f5295 | 377 | CGRAPH_FREQ_BASE); |
610c8ef0 | 378 | e->call_stmt_cannot_inline_p = true; |
3dafb85c | 379 | symtab->call_edge_duplication_hooks (thunk->callees, e); |
3dafb85c | 380 | symtab->call_cgraph_duplication_hooks (thunk, new_thunk); |
610c8ef0 MJ |
381 | return new_thunk; |
382 | } | |
383 | ||
384 | /* If E does not lead to a thunk, simply redirect it to N. Otherwise create | |
385 | one or more equivalent thunks for N and redirect E to the first in the | |
6a4bad95 MJ |
386 | chain. Note that it is then necessary to call |
387 | n->expand_all_artificial_thunks once all callers are redirected. */ | |
610c8ef0 MJ |
388 | |
389 | void | |
6a4bad95 | 390 | cgraph_edge::redirect_callee_duplicating_thunks (cgraph_node *n) |
610c8ef0 | 391 | { |
6a4bad95 | 392 | cgraph_node *orig_to = callee->ultimate_alias_target (); |
610c8ef0 | 393 | if (orig_to->thunk.thunk_p) |
d284e1b8 | 394 | n = duplicate_thunk_for_node (orig_to, n); |
610c8ef0 | 395 | |
6a4bad95 MJ |
396 | redirect_callee (n); |
397 | } | |
398 | ||
399 | /* Call expand_thunk on all callers that are thunks and if analyze those nodes | |
400 | that were expanded. */ | |
401 | ||
402 | void | |
403 | cgraph_node::expand_all_artificial_thunks () | |
404 | { | |
405 | cgraph_edge *e; | |
406 | for (e = callers; e;) | |
407 | if (e->caller->thunk.thunk_p) | |
408 | { | |
409 | cgraph_node *thunk = e->caller; | |
410 | ||
411 | e = e->next_caller; | |
412 | if (thunk->expand_thunk (false, false)) | |
413 | { | |
414 | thunk->thunk.thunk_p = false; | |
415 | thunk->analyze (); | |
416 | } | |
417 | thunk->expand_all_artificial_thunks (); | |
418 | } | |
419 | else | |
420 | e = e->next_caller; | |
610c8ef0 | 421 | } |
564fe867 JH |
422 | |
423 | /* Create node representing clone of N executed COUNT times. Decrease | |
424 | the execution counts from original node too. | |
425 | The new clone will have decl set to DECL that may or may not be the same | |
426 | as decl of N. | |
427 | ||
428 | When UPDATE_ORIGINAL is true, the counts are subtracted from the original | |
429 | function's profile to reflect the fact that part of execution is handled | |
430 | by node. | |
431 | When CALL_DUPLICATOIN_HOOK is true, the ipa passes are acknowledged about | |
44a60244 MJ |
432 | the new clone. Otherwise the caller is responsible for doing so later. |
433 | ||
434 | If the new node is being inlined into another one, NEW_INLINED_TO should be | |
435 | the outline function the new one is (even indirectly) inlined to. All hooks | |
436 | will see this in node's global.inlined_to, when invoked. Can be NULL if the | |
437 | node is not inlined. */ | |
564fe867 | 438 | |
d52f5295 ML |
439 | cgraph_node * |
440 | cgraph_node::create_clone (tree decl, gcov_type gcov_count, int freq, | |
441 | bool update_original, | |
442 | vec<cgraph_edge *> redirect_callers, | |
443 | bool call_duplication_hook, | |
3dafb85c | 444 | cgraph_node *new_inlined_to, |
d52f5295 | 445 | bitmap args_to_skip) |
564fe867 | 446 | { |
3dafb85c ML |
447 | cgraph_node *new_node = symtab->create_empty (); |
448 | cgraph_edge *e; | |
564fe867 JH |
449 | gcov_type count_scale; |
450 | unsigned i; | |
451 | ||
67348ccc | 452 | new_node->decl = decl; |
d52f5295 ML |
453 | new_node->register_symbol (); |
454 | new_node->origin = origin; | |
455 | new_node->lto_file_data = lto_file_data; | |
564fe867 JH |
456 | if (new_node->origin) |
457 | { | |
458 | new_node->next_nested = new_node->origin->nested; | |
459 | new_node->origin->nested = new_node; | |
460 | } | |
d52f5295 ML |
461 | new_node->analyzed = analyzed; |
462 | new_node->definition = definition; | |
463 | new_node->local = local; | |
67348ccc | 464 | new_node->externally_visible = false; |
7861b648 | 465 | new_node->no_reorder = no_reorder; |
564fe867 | 466 | new_node->local.local = true; |
d52f5295 | 467 | new_node->global = global; |
44a60244 | 468 | new_node->global.inlined_to = new_inlined_to; |
d52f5295 | 469 | new_node->rtl = rtl; |
564fe867 | 470 | new_node->count = count; |
d52f5295 ML |
471 | new_node->frequency = frequency; |
472 | new_node->tp_first_run = tp_first_run; | |
9d6171dc | 473 | new_node->tm_clone = tm_clone; |
0a7246ee JH |
474 | new_node->icf_merged = icf_merged; |
475 | new_node->merged = merged; | |
d284e1b8 MJ |
476 | |
477 | new_node->clone.tree_map = NULL; | |
478 | new_node->clone.args_to_skip = args_to_skip; | |
479 | if (!args_to_skip) | |
d52f5295 ML |
480 | new_node->clone.combined_args_to_skip = clone.combined_args_to_skip; |
481 | else if (clone.combined_args_to_skip) | |
d284e1b8 MJ |
482 | { |
483 | new_node->clone.combined_args_to_skip = BITMAP_GGC_ALLOC (); | |
484 | bitmap_ior (new_node->clone.combined_args_to_skip, | |
d52f5295 | 485 | clone.combined_args_to_skip, args_to_skip); |
d284e1b8 MJ |
486 | } |
487 | else | |
488 | new_node->clone.combined_args_to_skip = args_to_skip; | |
489 | ||
d52f5295 | 490 | if (count) |
564fe867 | 491 | { |
d52f5295 | 492 | if (new_node->count > count) |
564fe867 JH |
493 | count_scale = REG_BR_PROB_BASE; |
494 | else | |
d52f5295 | 495 | count_scale = GCOV_COMPUTE_SCALE (new_node->count, count); |
564fe867 JH |
496 | } |
497 | else | |
498 | count_scale = 0; | |
499 | if (update_original) | |
500 | { | |
d52f5295 ML |
501 | count -= gcov_count; |
502 | if (count < 0) | |
503 | count = 0; | |
564fe867 JH |
504 | } |
505 | ||
9771b263 | 506 | FOR_EACH_VEC_ELT (redirect_callers, i, e) |
564fe867 JH |
507 | { |
508 | /* Redirect calls to the old version node to point to its new | |
9de6f6c3 JH |
509 | version. The only exception is when the edge was proved to |
510 | be unreachable during the clonning procedure. */ | |
511 | if (!e->callee | |
512 | || DECL_BUILT_IN_CLASS (e->callee->decl) != BUILT_IN_NORMAL | |
513 | || DECL_FUNCTION_CODE (e->callee->decl) != BUILT_IN_UNREACHABLE) | |
6a4bad95 | 514 | e->redirect_callee_duplicating_thunks (new_node); |
564fe867 | 515 | } |
6a4bad95 | 516 | new_node->expand_all_artificial_thunks (); |
564fe867 | 517 | |
d52f5295 | 518 | for (e = callees;e; e=e->next_callee) |
3dafb85c ML |
519 | e->clone (new_node, e->call_stmt, e->lto_stmt_uid, count_scale, |
520 | freq, update_original); | |
564fe867 | 521 | |
d52f5295 | 522 | for (e = indirect_calls; e; e = e->next_callee) |
3dafb85c ML |
523 | e->clone (new_node, e->call_stmt, e->lto_stmt_uid, |
524 | count_scale, freq, update_original); | |
d52f5295 | 525 | new_node->clone_references (this); |
564fe867 | 526 | |
d52f5295 ML |
527 | new_node->next_sibling_clone = clones; |
528 | if (clones) | |
529 | clones->prev_sibling_clone = new_node; | |
530 | clones = new_node; | |
531 | new_node->clone_of = this; | |
564fe867 JH |
532 | |
533 | if (call_duplication_hook) | |
3dafb85c | 534 | symtab->call_cgraph_duplication_hooks (this, new_node); |
564fe867 JH |
535 | return new_node; |
536 | } | |
537 | ||
564fe867 JH |
538 | static GTY(()) unsigned int clone_fn_id_num; |
539 | ||
9816367c BS |
540 | /* Return a new assembler name for a clone with SUFFIX of a decl named |
541 | NAME. */ | |
542 | ||
564fe867 | 543 | tree |
9816367c | 544 | clone_function_name_1 (const char *name, const char *suffix) |
564fe867 | 545 | { |
9816367c | 546 | size_t len = strlen (name); |
564fe867 JH |
547 | char *tmp_name, *prefix; |
548 | ||
549 | prefix = XALLOCAVEC (char, len + strlen (suffix) + 2); | |
9816367c | 550 | memcpy (prefix, name, len); |
564fe867 JH |
551 | strcpy (prefix + len + 1, suffix); |
552 | #ifndef NO_DOT_IN_LABEL | |
553 | prefix[len] = '.'; | |
554 | #elif !defined NO_DOLLAR_IN_LABEL | |
555 | prefix[len] = '$'; | |
556 | #else | |
557 | prefix[len] = '_'; | |
558 | #endif | |
559 | ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix, clone_fn_id_num++); | |
560 | return get_identifier (tmp_name); | |
561 | } | |
562 | ||
9816367c BS |
563 | /* Return a new assembler name for a clone of DECL with SUFFIX. */ |
564 | ||
565 | tree | |
566 | clone_function_name (tree decl, const char *suffix) | |
567 | { | |
568 | tree name = DECL_ASSEMBLER_NAME (decl); | |
569 | return clone_function_name_1 (IDENTIFIER_POINTER (name), suffix); | |
570 | } | |
571 | ||
572 | ||
564fe867 JH |
573 | /* Create callgraph node clone with new declaration. The actual body will |
574 | be copied later at compilation stage. | |
575 | ||
576 | TODO: after merging in ipa-sra use function call notes instead of args_to_skip | |
577 | bitmap interface. | |
578 | */ | |
3dafb85c | 579 | cgraph_node * |
d52f5295 ML |
580 | cgraph_node::create_virtual_clone (vec<cgraph_edge *> redirect_callers, |
581 | vec<ipa_replace_map *, va_gc> *tree_map, | |
582 | bitmap args_to_skip, const char * suffix) | |
564fe867 | 583 | { |
d52f5295 | 584 | tree old_decl = decl; |
3dafb85c | 585 | cgraph_node *new_node = NULL; |
564fe867 | 586 | tree new_decl; |
440a5082 | 587 | size_t len, i; |
3dafb85c | 588 | ipa_replace_map *map; |
440a5082 | 589 | char *name; |
564fe867 | 590 | |
a2e2a668 | 591 | if (!in_lto_p) |
ed89033d | 592 | gcc_checking_assert (tree_versionable_function_p (old_decl)); |
564fe867 | 593 | |
d52f5295 | 594 | gcc_assert (local.can_change_signature || !args_to_skip); |
564fe867 JH |
595 | |
596 | /* Make a new FUNCTION_DECL tree node */ | |
597 | if (!args_to_skip) | |
598 | new_decl = copy_node (old_decl); | |
599 | else | |
600 | new_decl = build_function_decl_skip_args (old_decl, args_to_skip, false); | |
49bde175 JH |
601 | |
602 | /* These pointers represent function body and will be populated only when clone | |
603 | is materialized. */ | |
604 | gcc_assert (new_decl != old_decl); | |
564fe867 | 605 | DECL_STRUCT_FUNCTION (new_decl) = NULL; |
49bde175 JH |
606 | DECL_ARGUMENTS (new_decl) = NULL; |
607 | DECL_INITIAL (new_decl) = NULL; | |
608 | DECL_RESULT (new_decl) = NULL; | |
609 | /* We can not do DECL_RESULT (new_decl) = NULL; here because of LTO partitioning | |
610 | sometimes storing only clone decl instead of original. */ | |
564fe867 JH |
611 | |
612 | /* Generate a new name for the new version. */ | |
440a5082 EB |
613 | len = IDENTIFIER_LENGTH (DECL_NAME (old_decl)); |
614 | name = XALLOCAVEC (char, len + strlen (suffix) + 2); | |
615 | memcpy (name, IDENTIFIER_POINTER (DECL_NAME (old_decl)), len); | |
616 | strcpy (name + len + 1, suffix); | |
617 | name[len] = '.'; | |
618 | DECL_NAME (new_decl) = get_identifier (name); | |
619 | SET_DECL_ASSEMBLER_NAME (new_decl, clone_function_name (old_decl, suffix)); | |
564fe867 JH |
620 | SET_DECL_RTL (new_decl, NULL); |
621 | ||
d52f5295 ML |
622 | new_node = create_clone (new_decl, count, CGRAPH_FREQ_BASE, false, |
623 | redirect_callers, false, NULL, args_to_skip); | |
624 | ||
564fe867 JH |
625 | /* Update the properties. |
626 | Make clone visible only within this translation unit. Make sure | |
627 | that is not weak also. | |
628 | ??? We cannot use COMDAT linkage because there is no | |
629 | ABI support for this. */ | |
610c8ef0 | 630 | set_new_clone_decl_and_node_flags (new_node); |
564fe867 | 631 | new_node->clone.tree_map = tree_map; |
4ab26ee0 | 632 | if (!implicit_section) |
ed89033d | 633 | new_node->set_section (get_section ()); |
702d8703 JH |
634 | |
635 | /* Clones of global symbols or symbols with unique names are unique. */ | |
636 | if ((TREE_PUBLIC (old_decl) | |
637 | && !DECL_EXTERNAL (old_decl) | |
638 | && !DECL_WEAK (old_decl) | |
639 | && !DECL_COMDAT (old_decl)) | |
640 | || in_lto_p) | |
67348ccc | 641 | new_node->unique_name = true; |
9771b263 | 642 | FOR_EACH_VEC_SAFE_ELT (tree_map, i, map) |
3dafb85c | 643 | new_node->maybe_create_reference (map->new_tree, IPA_REF_ADDR, NULL); |
d284e1b8 | 644 | |
d52f5295 | 645 | if (ipa_transforms_to_apply.exists ()) |
ca860d03 | 646 | new_node->ipa_transforms_to_apply |
d52f5295 | 647 | = ipa_transforms_to_apply.copy (); |
564fe867 | 648 | |
3dafb85c | 649 | symtab->call_cgraph_duplication_hooks (this, new_node); |
564fe867 JH |
650 | |
651 | return new_node; | |
652 | } | |
653 | ||
d52f5295 ML |
654 | /* callgraph node being removed from symbol table; see if its entry can be |
655 | replaced by other inline clone. */ | |
656 | cgraph_node * | |
657 | cgraph_node::find_replacement (void) | |
564fe867 | 658 | { |
3dafb85c | 659 | cgraph_node *next_inline_clone, *replacement; |
564fe867 | 660 | |
d52f5295 | 661 | for (next_inline_clone = clones; |
564fe867 | 662 | next_inline_clone |
d52f5295 | 663 | && next_inline_clone->decl != decl; |
564fe867 JH |
664 | next_inline_clone = next_inline_clone->next_sibling_clone) |
665 | ; | |
666 | ||
667 | /* If there is inline clone of the node being removed, we need | |
668 | to put it into the position of removed node and reorganize all | |
669 | other clones to be based on it. */ | |
670 | if (next_inline_clone) | |
671 | { | |
3dafb85c ML |
672 | cgraph_node *n; |
673 | cgraph_node *new_clones; | |
564fe867 JH |
674 | |
675 | replacement = next_inline_clone; | |
676 | ||
677 | /* Unlink inline clone from the list of clones of removed node. */ | |
678 | if (next_inline_clone->next_sibling_clone) | |
679 | next_inline_clone->next_sibling_clone->prev_sibling_clone | |
680 | = next_inline_clone->prev_sibling_clone; | |
681 | if (next_inline_clone->prev_sibling_clone) | |
682 | { | |
d52f5295 | 683 | gcc_assert (clones != next_inline_clone); |
564fe867 JH |
684 | next_inline_clone->prev_sibling_clone->next_sibling_clone |
685 | = next_inline_clone->next_sibling_clone; | |
686 | } | |
687 | else | |
688 | { | |
d52f5295 ML |
689 | gcc_assert (clones == next_inline_clone); |
690 | clones = next_inline_clone->next_sibling_clone; | |
564fe867 JH |
691 | } |
692 | ||
d52f5295 ML |
693 | new_clones = clones; |
694 | clones = NULL; | |
564fe867 JH |
695 | |
696 | /* Copy clone info. */ | |
d52f5295 | 697 | next_inline_clone->clone = clone; |
564fe867 JH |
698 | |
699 | /* Now place it into clone tree at same level at NODE. */ | |
d52f5295 | 700 | next_inline_clone->clone_of = clone_of; |
564fe867 JH |
701 | next_inline_clone->prev_sibling_clone = NULL; |
702 | next_inline_clone->next_sibling_clone = NULL; | |
d52f5295 | 703 | if (clone_of) |
564fe867 | 704 | { |
d52f5295 ML |
705 | if (clone_of->clones) |
706 | clone_of->clones->prev_sibling_clone = next_inline_clone; | |
707 | next_inline_clone->next_sibling_clone = clone_of->clones; | |
708 | clone_of->clones = next_inline_clone; | |
564fe867 JH |
709 | } |
710 | ||
711 | /* Merge the clone list. */ | |
712 | if (new_clones) | |
713 | { | |
714 | if (!next_inline_clone->clones) | |
715 | next_inline_clone->clones = new_clones; | |
716 | else | |
717 | { | |
718 | n = next_inline_clone->clones; | |
719 | while (n->next_sibling_clone) | |
d52f5295 | 720 | n = n->next_sibling_clone; |
564fe867 JH |
721 | n->next_sibling_clone = new_clones; |
722 | new_clones->prev_sibling_clone = n; | |
723 | } | |
724 | } | |
725 | ||
726 | /* Update clone_of pointers. */ | |
727 | n = new_clones; | |
728 | while (n) | |
729 | { | |
730 | n->clone_of = next_inline_clone; | |
731 | n = n->next_sibling_clone; | |
732 | } | |
733 | return replacement; | |
734 | } | |
735 | else | |
736 | return NULL; | |
737 | } | |
738 | ||
739 | /* Like cgraph_set_call_stmt but walk the clone tree and update all | |
042ae7d2 JH |
740 | clones sharing the same function body. |
741 | When WHOLE_SPECULATIVE_EDGES is true, all three components of | |
742 | speculative edge gets updated. Otherwise we update only direct | |
743 | call. */ | |
564fe867 JH |
744 | |
745 | void | |
538dd0b7 DM |
746 | cgraph_node::set_call_stmt_including_clones (gimple old_stmt, |
747 | gcall *new_stmt, | |
d52f5295 | 748 | bool update_speculative) |
564fe867 | 749 | { |
3dafb85c ML |
750 | cgraph_node *node; |
751 | cgraph_edge *edge = get_edge (old_stmt); | |
564fe867 JH |
752 | |
753 | if (edge) | |
3dafb85c | 754 | edge->set_call_stmt (new_stmt, update_speculative); |
564fe867 | 755 | |
d52f5295 | 756 | node = clones; |
564fe867 | 757 | if (node) |
d52f5295 | 758 | while (node != this) |
564fe867 | 759 | { |
3dafb85c | 760 | cgraph_edge *edge = node->get_edge (old_stmt); |
564fe867 | 761 | if (edge) |
042ae7d2 | 762 | { |
3dafb85c | 763 | edge->set_call_stmt (new_stmt, update_speculative); |
042ae7d2 JH |
764 | /* If UPDATE_SPECULATIVE is false, it means that we are turning |
765 | speculative call into a real code sequence. Update the | |
766 | callgraph edges. */ | |
767 | if (edge->speculative && !update_speculative) | |
768 | { | |
3dafb85c ML |
769 | cgraph_edge *direct, *indirect; |
770 | ipa_ref *ref; | |
042ae7d2 JH |
771 | |
772 | gcc_assert (!edge->indirect_unknown_callee); | |
3dafb85c | 773 | edge->speculative_call_info (direct, indirect, ref); |
042ae7d2 JH |
774 | direct->speculative = false; |
775 | indirect->speculative = false; | |
776 | ref->speculative = false; | |
777 | } | |
778 | } | |
564fe867 JH |
779 | if (node->clones) |
780 | node = node->clones; | |
781 | else if (node->next_sibling_clone) | |
782 | node = node->next_sibling_clone; | |
783 | else | |
784 | { | |
d52f5295 | 785 | while (node != this && !node->next_sibling_clone) |
564fe867 | 786 | node = node->clone_of; |
d52f5295 | 787 | if (node != this) |
564fe867 JH |
788 | node = node->next_sibling_clone; |
789 | } | |
790 | } | |
791 | } | |
792 | ||
793 | /* Like cgraph_create_edge walk the clone tree and update all clones sharing | |
794 | same function body. If clones already have edge for OLD_STMT; only | |
795 | update the edge same way as cgraph_set_call_stmt_including_clones does. | |
796 | ||
797 | TODO: COUNT and LOOP_DEPTH should be properly distributed based on relative | |
798 | frequencies of the clones. */ | |
799 | ||
800 | void | |
3dafb85c | 801 | cgraph_node::create_edge_including_clones (cgraph_node *callee, |
538dd0b7 | 802 | gimple old_stmt, gcall *stmt, |
d52f5295 ML |
803 | gcov_type count, |
804 | int freq, | |
805 | cgraph_inline_failed_t reason) | |
564fe867 | 806 | { |
3dafb85c ML |
807 | cgraph_node *node; |
808 | cgraph_edge *edge; | |
564fe867 | 809 | |
d52f5295 | 810 | if (!get_edge (stmt)) |
564fe867 | 811 | { |
d52f5295 | 812 | edge = create_edge (callee, stmt, count, freq); |
564fe867 JH |
813 | edge->inline_failed = reason; |
814 | } | |
815 | ||
d52f5295 | 816 | node = clones; |
564fe867 | 817 | if (node) |
d52f5295 | 818 | while (node != this) |
564fe867 | 819 | { |
3dafb85c | 820 | cgraph_edge *edge = node->get_edge (old_stmt); |
564fe867 JH |
821 | |
822 | /* It is possible that clones already contain the edge while | |
823 | master didn't. Either we promoted indirect call into direct | |
824 | call in the clone or we are processing clones of unreachable | |
825 | master where edges has been removed. */ | |
826 | if (edge) | |
3dafb85c | 827 | edge->set_call_stmt (stmt); |
d52f5295 | 828 | else if (! node->get_edge (stmt)) |
564fe867 | 829 | { |
d52f5295 | 830 | edge = node->create_edge (callee, stmt, count, freq); |
564fe867 JH |
831 | edge->inline_failed = reason; |
832 | } | |
833 | ||
834 | if (node->clones) | |
835 | node = node->clones; | |
836 | else if (node->next_sibling_clone) | |
837 | node = node->next_sibling_clone; | |
838 | else | |
839 | { | |
d52f5295 | 840 | while (node != this && !node->next_sibling_clone) |
564fe867 | 841 | node = node->clone_of; |
d52f5295 | 842 | if (node != this) |
564fe867 JH |
843 | node = node->next_sibling_clone; |
844 | } | |
845 | } | |
846 | } | |
847 | ||
848 | /* Remove the node from cgraph and all inline clones inlined into it. | |
849 | Skip however removal of FORBIDDEN_NODE and return true if it needs to be | |
850 | removed. This allows to call the function from outer loop walking clone | |
851 | tree. */ | |
852 | ||
853 | bool | |
d52f5295 | 854 | cgraph_node::remove_symbol_and_inline_clones (cgraph_node *forbidden_node) |
564fe867 | 855 | { |
3dafb85c | 856 | cgraph_edge *e, *next; |
564fe867 JH |
857 | bool found = false; |
858 | ||
d52f5295 | 859 | if (this == forbidden_node) |
39f9719e | 860 | { |
3dafb85c | 861 | callers->remove (); |
39f9719e JH |
862 | return true; |
863 | } | |
d52f5295 | 864 | for (e = callees; e; e = next) |
564fe867 JH |
865 | { |
866 | next = e->next_callee; | |
867 | if (!e->inline_failed) | |
d52f5295 | 868 | found |= e->callee->remove_symbol_and_inline_clones (forbidden_node); |
564fe867 | 869 | } |
d52f5295 | 870 | remove (); |
564fe867 JH |
871 | return found; |
872 | } | |
873 | ||
874 | /* The edges representing the callers of the NEW_VERSION node were | |
875 | fixed by cgraph_function_versioning (), now the call_expr in their | |
876 | respective tree code should be updated to call the NEW_VERSION. */ | |
877 | ||
878 | static void | |
3dafb85c | 879 | update_call_expr (cgraph_node *new_version) |
564fe867 | 880 | { |
3dafb85c | 881 | cgraph_edge *e; |
564fe867 JH |
882 | |
883 | gcc_assert (new_version); | |
884 | ||
885 | /* Update the call expr on the edges to call the new version. */ | |
886 | for (e = new_version->callers; e; e = e->next_caller) | |
887 | { | |
3dafb85c | 888 | function *inner_function = DECL_STRUCT_FUNCTION (e->caller->decl); |
67348ccc | 889 | gimple_call_set_fndecl (e->call_stmt, new_version->decl); |
564fe867 JH |
890 | maybe_clean_eh_stmt_fn (inner_function, e->call_stmt); |
891 | } | |
892 | } | |
893 | ||
894 | ||
895 | /* Create a new cgraph node which is the new version of | |
d52f5295 | 896 | callgraph node. REDIRECT_CALLERS holds the callers |
564fe867 | 897 | edges which should be redirected to point to |
d52f5295 | 898 | NEW_VERSION. ALL the callees edges of the node |
564fe867 JH |
899 | are cloned to the new version node. Return the new |
900 | version node. | |
901 | ||
902 | If non-NULL BLOCK_TO_COPY determine what basic blocks | |
903 | was copied to prevent duplications of calls that are dead | |
904 | in the clone. */ | |
905 | ||
d52f5295 ML |
906 | cgraph_node * |
907 | cgraph_node::create_version_clone (tree new_decl, | |
908 | vec<cgraph_edge *> redirect_callers, | |
909 | bitmap bbs_to_copy) | |
564fe867 | 910 | { |
3dafb85c ML |
911 | cgraph_node *new_version; |
912 | cgraph_edge *e; | |
564fe867 JH |
913 | unsigned i; |
914 | ||
d52f5295 | 915 | new_version = cgraph_node::create (new_decl); |
564fe867 | 916 | |
d52f5295 ML |
917 | new_version->analyzed = analyzed; |
918 | new_version->definition = definition; | |
919 | new_version->local = local; | |
67348ccc | 920 | new_version->externally_visible = false; |
7861b648 | 921 | new_version->no_reorder = no_reorder; |
67348ccc | 922 | new_version->local.local = new_version->definition; |
d52f5295 ML |
923 | new_version->global = global; |
924 | new_version->rtl = rtl; | |
925 | new_version->count = count; | |
564fe867 | 926 | |
d52f5295 | 927 | for (e = callees; e; e=e->next_callee) |
564fe867 JH |
928 | if (!bbs_to_copy |
929 | || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index)) | |
3dafb85c ML |
930 | e->clone (new_version, e->call_stmt, |
931 | e->lto_stmt_uid, REG_BR_PROB_BASE, | |
932 | CGRAPH_FREQ_BASE, | |
933 | true); | |
d52f5295 | 934 | for (e = indirect_calls; e; e=e->next_callee) |
564fe867 JH |
935 | if (!bbs_to_copy |
936 | || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index)) | |
3dafb85c ML |
937 | e->clone (new_version, e->call_stmt, |
938 | e->lto_stmt_uid, REG_BR_PROB_BASE, | |
939 | CGRAPH_FREQ_BASE, | |
940 | true); | |
9771b263 | 941 | FOR_EACH_VEC_ELT (redirect_callers, i, e) |
564fe867 JH |
942 | { |
943 | /* Redirect calls to the old version node to point to its new | |
944 | version. */ | |
3dafb85c | 945 | e->redirect_callee (new_version); |
564fe867 JH |
946 | } |
947 | ||
3dafb85c | 948 | symtab->call_cgraph_duplication_hooks (this, new_version); |
564fe867 JH |
949 | |
950 | return new_version; | |
951 | } | |
952 | ||
953 | /* Perform function versioning. | |
954 | Function versioning includes copying of the tree and | |
955 | a callgraph update (creating a new cgraph node and updating | |
956 | its callees and callers). | |
957 | ||
958 | REDIRECT_CALLERS varray includes the edges to be redirected | |
959 | to the new version. | |
960 | ||
961 | TREE_MAP is a mapping of tree nodes we want to replace with | |
962 | new ones (according to results of prior analysis). | |
564fe867 JH |
963 | |
964 | If non-NULL ARGS_TO_SKIP determine function parameters to remove | |
965 | from new version. | |
966 | If SKIP_RETURN is true, the new version will return void. | |
967 | If non-NULL BLOCK_TO_COPY determine what basic blocks to copy. | |
968 | If non_NULL NEW_ENTRY determine new entry BB of the clone. | |
969 | ||
970 | Return the new version's cgraph node. */ | |
971 | ||
d52f5295 ML |
972 | cgraph_node * |
973 | cgraph_node::create_version_clone_with_body | |
974 | (vec<cgraph_edge *> redirect_callers, | |
975 | vec<ipa_replace_map *, va_gc> *tree_map, bitmap args_to_skip, | |
976 | bool skip_return, bitmap bbs_to_copy, basic_block new_entry_block, | |
977 | const char *clone_name) | |
564fe867 | 978 | { |
d52f5295 | 979 | tree old_decl = decl; |
3dafb85c | 980 | cgraph_node *new_version_node = NULL; |
564fe867 JH |
981 | tree new_decl; |
982 | ||
983 | if (!tree_versionable_function_p (old_decl)) | |
984 | return NULL; | |
985 | ||
d52f5295 | 986 | gcc_assert (local.can_change_signature || !args_to_skip); |
564fe867 JH |
987 | |
988 | /* Make a new FUNCTION_DECL tree node for the new version. */ | |
989 | if (!args_to_skip && !skip_return) | |
990 | new_decl = copy_node (old_decl); | |
991 | else | |
992 | new_decl | |
993 | = build_function_decl_skip_args (old_decl, args_to_skip, skip_return); | |
994 | ||
995 | /* Generate a new name for the new version. */ | |
996 | DECL_NAME (new_decl) = clone_function_name (old_decl, clone_name); | |
997 | SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl)); | |
998 | SET_DECL_RTL (new_decl, NULL); | |
999 | ||
1000 | /* When the old decl was a con-/destructor make sure the clone isn't. */ | |
c3284718 RS |
1001 | DECL_STATIC_CONSTRUCTOR (new_decl) = 0; |
1002 | DECL_STATIC_DESTRUCTOR (new_decl) = 0; | |
564fe867 JH |
1003 | |
1004 | /* Create the new version's call-graph node. | |
1005 | and update the edges of the new node. */ | |
d52f5295 ML |
1006 | new_version_node = create_version_clone (new_decl, redirect_callers, |
1007 | bbs_to_copy); | |
564fe867 | 1008 | |
d52f5295 | 1009 | if (ipa_transforms_to_apply.exists ()) |
c6d43074 | 1010 | new_version_node->ipa_transforms_to_apply |
d52f5295 | 1011 | = ipa_transforms_to_apply.copy (); |
564fe867 JH |
1012 | /* Copy the OLD_VERSION_NODE function tree to the new version. */ |
1013 | tree_function_versioning (old_decl, new_decl, tree_map, false, args_to_skip, | |
1014 | skip_return, bbs_to_copy, new_entry_block); | |
1015 | ||
1016 | /* Update the new version's properties. | |
1017 | Make The new version visible only within this translation unit. Make sure | |
1018 | that is not weak also. | |
1019 | ??? We cannot use COMDAT linkage because there is no | |
1020 | ABI support for this. */ | |
d52f5295 | 1021 | new_version_node->make_decl_local (); |
67348ccc DM |
1022 | DECL_VIRTUAL_P (new_version_node->decl) = 0; |
1023 | new_version_node->externally_visible = 0; | |
564fe867 JH |
1024 | new_version_node->local.local = 1; |
1025 | new_version_node->lowered = true; | |
4ab26ee0 JJ |
1026 | if (!implicit_section) |
1027 | new_version_node->set_section (get_section ()); | |
702d8703 JH |
1028 | /* Clones of global symbols or symbols with unique names are unique. */ |
1029 | if ((TREE_PUBLIC (old_decl) | |
1030 | && !DECL_EXTERNAL (old_decl) | |
1031 | && !DECL_WEAK (old_decl) | |
1032 | && !DECL_COMDAT (old_decl)) | |
1033 | || in_lto_p) | |
67348ccc | 1034 | new_version_node->unique_name = true; |
564fe867 JH |
1035 | |
1036 | /* Update the call_expr on the edges to call the new version node. */ | |
1037 | update_call_expr (new_version_node); | |
1038 | ||
3dafb85c | 1039 | symtab->call_cgraph_insertion_hooks (this); |
564fe867 JH |
1040 | return new_version_node; |
1041 | } | |
1042 | ||
1043 | /* Given virtual clone, turn it into actual clone. */ | |
1044 | ||
1045 | static void | |
3dafb85c | 1046 | cgraph_materialize_clone (cgraph_node *node) |
564fe867 JH |
1047 | { |
1048 | bitmap_obstack_initialize (NULL); | |
67348ccc | 1049 | node->former_clone_of = node->clone_of->decl; |
564fe867 JH |
1050 | if (node->clone_of->former_clone_of) |
1051 | node->former_clone_of = node->clone_of->former_clone_of; | |
1052 | /* Copy the OLD_VERSION_NODE function tree to the new version. */ | |
67348ccc | 1053 | tree_function_versioning (node->clone_of->decl, node->decl, |
564fe867 JH |
1054 | node->clone.tree_map, true, |
1055 | node->clone.args_to_skip, false, | |
1056 | NULL, NULL); | |
3dafb85c | 1057 | if (symtab->dump_file) |
564fe867 | 1058 | { |
3dafb85c ML |
1059 | dump_function_to_file (node->clone_of->decl, symtab->dump_file, |
1060 | dump_flags); | |
1061 | dump_function_to_file (node->decl, symtab->dump_file, dump_flags); | |
564fe867 JH |
1062 | } |
1063 | ||
1064 | /* Function is no longer clone. */ | |
1065 | if (node->next_sibling_clone) | |
1066 | node->next_sibling_clone->prev_sibling_clone = node->prev_sibling_clone; | |
1067 | if (node->prev_sibling_clone) | |
1068 | node->prev_sibling_clone->next_sibling_clone = node->next_sibling_clone; | |
1069 | else | |
1070 | node->clone_of->clones = node->next_sibling_clone; | |
1071 | node->next_sibling_clone = NULL; | |
1072 | node->prev_sibling_clone = NULL; | |
67348ccc | 1073 | if (!node->clone_of->analyzed && !node->clone_of->clones) |
564fe867 | 1074 | { |
d52f5295 ML |
1075 | node->clone_of->release_body (); |
1076 | node->clone_of->remove_callees (); | |
d122681a | 1077 | node->clone_of->remove_all_references (); |
564fe867 JH |
1078 | } |
1079 | node->clone_of = NULL; | |
1080 | bitmap_obstack_release (NULL); | |
1081 | } | |
1082 | ||
1083 | /* Once all functions from compilation unit are in memory, produce all clones | |
1084 | and update all calls. We might also do this on demand if we don't want to | |
1085 | bring all functions to memory prior compilation, but current WHOPR | |
1086 | implementation does that and it is is bit easier to keep everything right in | |
1087 | this order. */ | |
1088 | ||
1089 | void | |
3dafb85c | 1090 | symbol_table::materialize_all_clones (void) |
564fe867 | 1091 | { |
3dafb85c | 1092 | cgraph_node *node; |
564fe867 | 1093 | bool stabilized = false; |
042ae7d2 | 1094 | |
564fe867 | 1095 | |
3dafb85c ML |
1096 | if (symtab->dump_file) |
1097 | fprintf (symtab->dump_file, "Materializing clones\n"); | |
564fe867 | 1098 | #ifdef ENABLE_CHECKING |
d52f5295 | 1099 | cgraph_node::verify_cgraph_nodes (); |
564fe867 JH |
1100 | #endif |
1101 | ||
1102 | /* We can also do topological order, but number of iterations should be | |
1103 | bounded by number of IPA passes since single IPA pass is probably not | |
1104 | going to create clones of clones it created itself. */ | |
1105 | while (!stabilized) | |
1106 | { | |
1107 | stabilized = true; | |
1108 | FOR_EACH_FUNCTION (node) | |
1109 | { | |
67348ccc DM |
1110 | if (node->clone_of && node->decl != node->clone_of->decl |
1111 | && !gimple_has_body_p (node->decl)) | |
564fe867 | 1112 | { |
a2e2a668 | 1113 | if (!node->clone_of->clone_of) |
70486010 | 1114 | node->clone_of->get_untransformed_body (); |
67348ccc | 1115 | if (gimple_has_body_p (node->clone_of->decl)) |
564fe867 | 1116 | { |
3dafb85c | 1117 | if (symtab->dump_file) |
564fe867 | 1118 | { |
3dafb85c | 1119 | fprintf (symtab->dump_file, "cloning %s to %s\n", |
2a72a953 DM |
1120 | xstrdup_for_dump (node->clone_of->name ()), |
1121 | xstrdup_for_dump (node->name ())); | |
564fe867 JH |
1122 | if (node->clone.tree_map) |
1123 | { | |
1124 | unsigned int i; | |
3dafb85c | 1125 | fprintf (symtab->dump_file, " replace map: "); |
9771b263 DN |
1126 | for (i = 0; |
1127 | i < vec_safe_length (node->clone.tree_map); | |
1128 | i++) | |
564fe867 | 1129 | { |
3dafb85c | 1130 | ipa_replace_map *replace_info; |
9771b263 | 1131 | replace_info = (*node->clone.tree_map)[i]; |
3dafb85c ML |
1132 | print_generic_expr (symtab->dump_file, replace_info->old_tree, 0); |
1133 | fprintf (symtab->dump_file, " -> "); | |
1134 | print_generic_expr (symtab->dump_file, replace_info->new_tree, 0); | |
1135 | fprintf (symtab->dump_file, "%s%s;", | |
564fe867 JH |
1136 | replace_info->replace_p ? "(replace)":"", |
1137 | replace_info->ref_p ? "(ref)":""); | |
1138 | } | |
3dafb85c | 1139 | fprintf (symtab->dump_file, "\n"); |
564fe867 JH |
1140 | } |
1141 | if (node->clone.args_to_skip) | |
1142 | { | |
3dafb85c ML |
1143 | fprintf (symtab->dump_file, " args_to_skip: "); |
1144 | dump_bitmap (symtab->dump_file, | |
1145 | node->clone.args_to_skip); | |
564fe867 JH |
1146 | } |
1147 | if (node->clone.args_to_skip) | |
1148 | { | |
3dafb85c ML |
1149 | fprintf (symtab->dump_file, " combined_args_to_skip:"); |
1150 | dump_bitmap (symtab->dump_file, node->clone.combined_args_to_skip); | |
564fe867 JH |
1151 | } |
1152 | } | |
1153 | cgraph_materialize_clone (node); | |
1154 | stabilized = false; | |
1155 | } | |
1156 | } | |
1157 | } | |
1158 | } | |
1159 | FOR_EACH_FUNCTION (node) | |
67348ccc | 1160 | if (!node->analyzed && node->callees) |
71cafea9 | 1161 | { |
d52f5295 | 1162 | node->remove_callees (); |
d122681a | 1163 | node->remove_all_references (); |
71cafea9 JH |
1164 | } |
1165 | else | |
d122681a | 1166 | node->clear_stmts_in_references (); |
3dafb85c ML |
1167 | if (symtab->dump_file) |
1168 | fprintf (symtab->dump_file, "Materialization Call site updates done.\n"); | |
564fe867 | 1169 | #ifdef ENABLE_CHECKING |
d52f5295 | 1170 | cgraph_node::verify_cgraph_nodes (); |
564fe867 | 1171 | #endif |
17e0fc92 | 1172 | symtab->remove_unreachable_nodes (symtab->dump_file); |
564fe867 JH |
1173 | } |
1174 | ||
1175 | #include "gt-cgraphclones.h" |