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