]>
Commit | Line | Data |
---|---|---|
564fe867 | 1 | /* Callgraph clones |
99dee823 | 2 | Copyright (C) 2003-2021 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 | ||
dfea3d6f | 21 | /* This module provide facilities for cloning functions. I.e. creating |
564fe867 JH |
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" | |
c7131fb2 | 70 | #include "backend.h" |
957060b5 AM |
71 | #include "target.h" |
72 | #include "rtl.h" | |
c7131fb2 AM |
73 | #include "tree.h" |
74 | #include "gimple.h" | |
40e23961 | 75 | #include "stringpool.h" |
957060b5 | 76 | #include "cgraph.h" |
957060b5 | 77 | #include "lto-streamer.h" |
2fb9a547 | 78 | #include "tree-eh.h" |
442b4905 | 79 | #include "tree-cfg.h" |
564fe867 | 80 | #include "tree-inline.h" |
c24e924f | 81 | #include "dumpfile.h" |
564fe867 | 82 | #include "gimple-pretty-print.h" |
68188fff MJ |
83 | #include "alloc-pool.h" |
84 | #include "symbol-summary.h" | |
85 | #include "tree-vrp.h" | |
86 | #include "ipa-prop.h" | |
87 | #include "ipa-fnsummary.h" | |
67f3791f | 88 | #include "symtab-thunks.h" |
ae7a23a3 | 89 | #include "symtab-clones.h" |
564fe867 | 90 | |
3dafb85c ML |
91 | /* Create clone of edge in the node N represented by CALL_EXPR |
92 | the callgraph. */ | |
93 | ||
94 | cgraph_edge * | |
538dd0b7 | 95 | cgraph_edge::clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid, |
1511c8c0 | 96 | profile_count num, profile_count den, |
1bad9c18 | 97 | bool update_original) |
564fe867 | 98 | { |
3dafb85c | 99 | cgraph_edge *new_edge; |
1bad9c18 | 100 | profile_count::adjust_for_ipa_scaling (&num, &den); |
517048ce | 101 | profile_count prof_count = count.apply_scale (num, den); |
564fe867 | 102 | |
3dafb85c | 103 | if (indirect_unknown_callee) |
564fe867 JH |
104 | { |
105 | tree decl; | |
106 | ||
e57872ee JH |
107 | if (call_stmt && (decl = gimple_call_fndecl (call_stmt)) |
108 | /* When the call is speculative, we need to resolve it | |
109 | via cgraph_resolve_speculation and not here. */ | |
3dafb85c | 110 | && !speculative) |
564fe867 | 111 | { |
3dafb85c | 112 | cgraph_node *callee = cgraph_node::get (decl); |
564fe867 | 113 | gcc_checking_assert (callee); |
3187c8a5 | 114 | new_edge = n->create_edge (callee, call_stmt, prof_count, true); |
564fe867 JH |
115 | } |
116 | else | |
117 | { | |
d52f5295 | 118 | new_edge = n->create_indirect_edge (call_stmt, |
3dafb85c | 119 | indirect_info->ecf_flags, |
3187c8a5 | 120 | prof_count, true); |
3dafb85c | 121 | *new_edge->indirect_info = *indirect_info; |
564fe867 JH |
122 | } |
123 | } | |
124 | else | |
125 | { | |
3187c8a5 | 126 | new_edge = n->create_edge (callee, call_stmt, prof_count, true); |
3dafb85c | 127 | if (indirect_info) |
564fe867 JH |
128 | { |
129 | new_edge->indirect_info | |
766090c2 | 130 | = ggc_cleared_alloc<cgraph_indirect_call_info> (); |
3dafb85c | 131 | *new_edge->indirect_info = *indirect_info; |
564fe867 JH |
132 | } |
133 | } | |
134 | ||
3dafb85c ML |
135 | new_edge->inline_failed = inline_failed; |
136 | new_edge->indirect_inlining_edge = indirect_inlining_edge; | |
118aa5e3 JH |
137 | if (!call_stmt) |
138 | new_edge->lto_stmt_uid = stmt_uid; | |
f1ba88b1 | 139 | new_edge->speculative_id = speculative_id; |
564fe867 | 140 | /* Clone flags that depend on call_stmt availability manually. */ |
3dafb85c ML |
141 | new_edge->can_throw_external = can_throw_external; |
142 | new_edge->call_stmt_cannot_inline_p = call_stmt_cannot_inline_p; | |
143 | new_edge->speculative = speculative; | |
f9bb202b | 144 | new_edge->in_polymorphic_cdtor = in_polymorphic_cdtor; |
1bad9c18 JH |
145 | |
146 | /* Update IPA profile. Local profiles need no updating in original. */ | |
517048ce | 147 | if (update_original) |
b49d29d7 JH |
148 | count = count.combine_with_ipa_count_within (count.ipa () |
149 | - new_edge->count.ipa (), | |
150 | caller->count); | |
3dafb85c | 151 | symtab->call_edge_duplication_hooks (this, new_edge); |
564fe867 JH |
152 | return new_edge; |
153 | } | |
154 | ||
610c8ef0 MJ |
155 | /* Set flags of NEW_NODE and its decl. NEW_NODE is a newly created private |
156 | clone or its thunk. */ | |
157 | ||
158 | static void | |
159 | set_new_clone_decl_and_node_flags (cgraph_node *new_node) | |
160 | { | |
161 | DECL_EXTERNAL (new_node->decl) = 0; | |
610c8ef0 MJ |
162 | TREE_PUBLIC (new_node->decl) = 0; |
163 | DECL_COMDAT (new_node->decl) = 0; | |
164 | DECL_WEAK (new_node->decl) = 0; | |
165 | DECL_VIRTUAL_P (new_node->decl) = 0; | |
166 | DECL_STATIC_CONSTRUCTOR (new_node->decl) = 0; | |
167 | DECL_STATIC_DESTRUCTOR (new_node->decl) = 0; | |
fe8e21fd ML |
168 | DECL_SET_IS_OPERATOR_NEW (new_node->decl, 0); |
169 | DECL_SET_IS_OPERATOR_DELETE (new_node->decl, 0); | |
d7a65edb | 170 | DECL_IS_REPLACEABLE_OPERATOR (new_node->decl) = 0; |
610c8ef0 MJ |
171 | |
172 | new_node->externally_visible = 0; | |
87f94429 | 173 | new_node->local = 1; |
610c8ef0 MJ |
174 | new_node->lowered = true; |
175 | } | |
176 | ||
177 | /* Duplicate thunk THUNK if necessary but make it to refer to NODE. | |
178 | ARGS_TO_SKIP, if non-NULL, determines which parameters should be omitted. | |
179 | Function can return NODE if no thunk is necessary, which can happen when | |
180 | thunk is this_adjusting but we are removing this parameter. */ | |
181 | ||
182 | static cgraph_node * | |
d284e1b8 | 183 | duplicate_thunk_for_node (cgraph_node *thunk, cgraph_node *node) |
610c8ef0 MJ |
184 | { |
185 | cgraph_node *new_thunk, *thunk_of; | |
d52f5295 | 186 | thunk_of = thunk->callees->callee->ultimate_alias_target (); |
610c8ef0 | 187 | |
67f3791f | 188 | if (thunk_of->thunk) |
d284e1b8 | 189 | node = duplicate_thunk_for_node (thunk_of, node); |
610c8ef0 | 190 | |
48fb6d40 | 191 | if (!DECL_ARGUMENTS (thunk->decl)) |
70486010 | 192 | thunk->get_untransformed_body (); |
48fb6d40 | 193 | |
67f3791f | 194 | thunk_info *i = thunk_info::get (thunk); |
3dafb85c | 195 | cgraph_edge *cs; |
610c8ef0 | 196 | for (cs = node->callers; cs; cs = cs->next_caller) |
67f3791f JH |
197 | if (cs->caller->thunk) |
198 | { | |
199 | thunk_info *i2 = thunk_info::get (cs->caller); | |
200 | if (*i2 == *i) | |
201 | return cs->caller; | |
202 | } | |
610c8ef0 MJ |
203 | |
204 | tree new_decl; | |
ae7a23a3 JH |
205 | clone_info *info = clone_info::get (node); |
206 | if (info && info->param_adjustments) | |
610c8ef0 MJ |
207 | { |
208 | /* We do not need to duplicate this_adjusting thunks if we have removed | |
209 | this. */ | |
67f3791f | 210 | if (i->this_adjusting |
ae7a23a3 | 211 | && !info->param_adjustments->first_param_intact_p ()) |
610c8ef0 MJ |
212 | return node; |
213 | ||
ff6686d2 | 214 | new_decl = copy_node (thunk->decl); |
ae7a23a3 | 215 | ipa_param_body_adjustments body_adj (info->param_adjustments, |
ff6686d2 MJ |
216 | new_decl); |
217 | body_adj.modify_formal_parameters (); | |
bec63208 | 218 | } |
ff6686d2 MJ |
219 | else |
220 | new_decl = copy_node (thunk->decl); | |
bec63208 | 221 | |
610c8ef0 MJ |
222 | gcc_checking_assert (!DECL_STRUCT_FUNCTION (new_decl)); |
223 | gcc_checking_assert (!DECL_INITIAL (new_decl)); | |
224 | gcc_checking_assert (!DECL_RESULT (new_decl)); | |
225 | gcc_checking_assert (!DECL_RTL_SET_P (new_decl)); | |
226 | ||
7958186b MP |
227 | DECL_NAME (new_decl) = clone_function_name_numbered (thunk->decl, |
228 | "artificial_thunk"); | |
610c8ef0 | 229 | SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl)); |
610c8ef0 | 230 | |
67124cb6 EB |
231 | /* We need to force DECL_IGNORED_P because the new thunk is created after |
232 | early debug was run. */ | |
233 | DECL_IGNORED_P (new_decl) = 1; | |
234 | ||
d52f5295 | 235 | new_thunk = cgraph_node::create (new_decl); |
610c8ef0 MJ |
236 | set_new_clone_decl_and_node_flags (new_thunk); |
237 | new_thunk->definition = true; | |
87f94429 | 238 | new_thunk->can_change_signature = node->can_change_signature; |
610c8ef0 MJ |
239 | new_thunk->thunk = thunk->thunk; |
240 | new_thunk->unique_name = in_lto_p; | |
241 | new_thunk->former_clone_of = thunk->decl; | |
a2058f58 | 242 | if (info && info->param_adjustments) |
ae7a23a3 JH |
243 | clone_info::get_create (new_thunk)->param_adjustments |
244 | = info->param_adjustments; | |
b74d8dc4 JH |
245 | new_thunk->unit_id = thunk->unit_id; |
246 | new_thunk->merged_comdat = thunk->merged_comdat; | |
247 | new_thunk->merged_extern_inline = thunk->merged_extern_inline; | |
610c8ef0 | 248 | |
1bad9c18 | 249 | cgraph_edge *e = new_thunk->create_edge (node, NULL, new_thunk->count); |
3dafb85c | 250 | symtab->call_edge_duplication_hooks (thunk->callees, e); |
3dafb85c | 251 | symtab->call_cgraph_duplication_hooks (thunk, new_thunk); |
610c8ef0 MJ |
252 | return new_thunk; |
253 | } | |
254 | ||
255 | /* If E does not lead to a thunk, simply redirect it to N. Otherwise create | |
256 | one or more equivalent thunks for N and redirect E to the first in the | |
6a4bad95 MJ |
257 | chain. Note that it is then necessary to call |
258 | n->expand_all_artificial_thunks once all callers are redirected. */ | |
610c8ef0 MJ |
259 | |
260 | void | |
6a4bad95 | 261 | cgraph_edge::redirect_callee_duplicating_thunks (cgraph_node *n) |
610c8ef0 | 262 | { |
6a4bad95 | 263 | cgraph_node *orig_to = callee->ultimate_alias_target (); |
67f3791f | 264 | if (orig_to->thunk) |
d284e1b8 | 265 | n = duplicate_thunk_for_node (orig_to, n); |
610c8ef0 | 266 | |
6a4bad95 MJ |
267 | redirect_callee (n); |
268 | } | |
269 | ||
270 | /* Call expand_thunk on all callers that are thunks and if analyze those nodes | |
271 | that were expanded. */ | |
272 | ||
273 | void | |
274 | cgraph_node::expand_all_artificial_thunks () | |
275 | { | |
276 | cgraph_edge *e; | |
277 | for (e = callers; e;) | |
67f3791f | 278 | if (e->caller->thunk) |
6a4bad95 MJ |
279 | { |
280 | cgraph_node *thunk = e->caller; | |
281 | ||
282 | e = e->next_caller; | |
67f3791f | 283 | if (expand_thunk (thunk, false, false)) |
6a4bad95 | 284 | { |
67f3791f | 285 | thunk->thunk = false; |
6a4bad95 | 286 | thunk->analyze (); |
68188fff MJ |
287 | ipa_analyze_node (thunk); |
288 | inline_analyze_function (thunk); | |
6a4bad95 MJ |
289 | } |
290 | thunk->expand_all_artificial_thunks (); | |
291 | } | |
292 | else | |
293 | e = e->next_caller; | |
610c8ef0 | 294 | } |
564fe867 | 295 | |
0bdad123 ML |
296 | void |
297 | dump_callgraph_transformation (const cgraph_node *original, | |
298 | const cgraph_node *clone, | |
299 | const char *suffix) | |
300 | { | |
301 | if (symtab->ipa_clones_dump_file) | |
302 | { | |
303 | fprintf (symtab->ipa_clones_dump_file, | |
304 | "Callgraph clone;%s;%d;%s;%d;%d;%s;%d;%s;%d;%d;%s\n", | |
305 | original->asm_name (), original->order, | |
306 | DECL_SOURCE_FILE (original->decl), | |
307 | DECL_SOURCE_LINE (original->decl), | |
308 | DECL_SOURCE_COLUMN (original->decl), clone->asm_name (), | |
309 | clone->order, DECL_SOURCE_FILE (clone->decl), | |
310 | DECL_SOURCE_LINE (clone->decl), DECL_SOURCE_COLUMN (clone->decl), | |
311 | suffix); | |
312 | ||
313 | symtab->cloned_nodes.add (original); | |
314 | symtab->cloned_nodes.add (clone); | |
315 | } | |
316 | } | |
317 | ||
34fbe3f0 JH |
318 | /* Turn profile of N to local profile. */ |
319 | ||
320 | static void | |
321 | localize_profile (cgraph_node *n) | |
322 | { | |
323 | n->count = n->count.guessed_local (); | |
324 | for (cgraph_edge *e = n->callees; e; e=e->next_callee) | |
325 | { | |
326 | e->count = e->count.guessed_local (); | |
327 | if (!e->inline_failed) | |
328 | localize_profile (e->callee); | |
329 | } | |
330 | for (cgraph_edge *e = n->indirect_calls; e; e=e->next_callee) | |
331 | e->count = e->count.guessed_local (); | |
332 | } | |
333 | ||
564fe867 JH |
334 | /* Create node representing clone of N executed COUNT times. Decrease |
335 | the execution counts from original node too. | |
336 | The new clone will have decl set to DECL that may or may not be the same | |
337 | as decl of N. | |
338 | ||
339 | When UPDATE_ORIGINAL is true, the counts are subtracted from the original | |
340 | function's profile to reflect the fact that part of execution is handled | |
341 | by node. | |
dfea3d6f | 342 | When CALL_DUPLICATION_HOOK is true, the ipa passes are acknowledged about |
44a60244 MJ |
343 | the new clone. Otherwise the caller is responsible for doing so later. |
344 | ||
345 | If the new node is being inlined into another one, NEW_INLINED_TO should be | |
346 | the outline function the new one is (even indirectly) inlined to. All hooks | |
a62bfab5 | 347 | will see this in node's inlined_to, when invoked. Can be NULL if the |
ff6686d2 MJ |
348 | node is not inlined. |
349 | ||
350 | If PARAM_ADJUSTMENTS is non-NULL, the parameter manipulation information | |
351 | will be overwritten by the new structure. Otherwise the new node will | |
352 | share parameter manipulation information with the original node. */ | |
564fe867 | 353 | |
d52f5295 | 354 | cgraph_node * |
1bad9c18 | 355 | cgraph_node::create_clone (tree new_decl, profile_count prof_count, |
d52f5295 ML |
356 | bool update_original, |
357 | vec<cgraph_edge *> redirect_callers, | |
358 | bool call_duplication_hook, | |
3dafb85c | 359 | cgraph_node *new_inlined_to, |
ff6686d2 MJ |
360 | ipa_param_adjustments *param_adjustments, |
361 | const char *suffix) | |
564fe867 | 362 | { |
3dafb85c ML |
363 | cgraph_node *new_node = symtab->create_empty (); |
364 | cgraph_edge *e; | |
564fe867 | 365 | unsigned i; |
1bad9c18 | 366 | profile_count old_count = count; |
34fbe3f0 | 367 | bool nonzero = count.ipa ().nonzero_p (); |
564fe867 | 368 | |
0bdad123 ML |
369 | if (new_inlined_to) |
370 | dump_callgraph_transformation (this, new_inlined_to, "inlining to"); | |
371 | ||
8f58dbd1 JH |
372 | /* When inlining we scale precisely to prof_count, when cloning we can |
373 | preserve local profile. */ | |
374 | if (!new_inlined_to) | |
375 | prof_count = count.combine_with_ipa_count (prof_count); | |
3995f3a2 | 376 | new_node->count = prof_count; |
1bad9c18 JH |
377 | |
378 | /* Update IPA profile. Local profiles need no updating in original. */ | |
517048ce | 379 | if (update_original) |
b49d29d7 JH |
380 | { |
381 | if (inlined_to) | |
382 | count = count.combine_with_ipa_count_within (count.ipa () | |
383 | - prof_count.ipa (), | |
384 | inlined_to->count); | |
385 | else | |
386 | count = count.combine_with_ipa_count (count.ipa () - prof_count.ipa ()); | |
387 | } | |
ed6ef490 | 388 | new_node->decl = new_decl; |
d52f5295 | 389 | new_node->register_symbol (); |
d52f5295 | 390 | new_node->lto_file_data = lto_file_data; |
d52f5295 ML |
391 | new_node->analyzed = analyzed; |
392 | new_node->definition = definition; | |
87f94429 ML |
393 | new_node->versionable = versionable; |
394 | new_node->can_change_signature = can_change_signature; | |
395 | new_node->redefined_extern_inline = redefined_extern_inline; | |
396 | new_node->tm_may_enter_irr = tm_may_enter_irr; | |
67348ccc | 397 | new_node->externally_visible = false; |
7861b648 | 398 | new_node->no_reorder = no_reorder; |
87f94429 | 399 | new_node->local = true; |
a62bfab5 | 400 | new_node->inlined_to = new_inlined_to; |
d52f5295 | 401 | new_node->rtl = rtl; |
d52f5295 ML |
402 | new_node->frequency = frequency; |
403 | new_node->tp_first_run = tp_first_run; | |
9d6171dc | 404 | new_node->tm_clone = tm_clone; |
0a7246ee | 405 | new_node->icf_merged = icf_merged; |
6bbf39b7 | 406 | new_node->thunk = thunk; |
b74d8dc4 JH |
407 | new_node->unit_id = unit_id; |
408 | new_node->merged_comdat = merged_comdat; | |
409 | new_node->merged_extern_inline = merged_extern_inline; | |
ae7a23a3 | 410 | clone_info *info = clone_info::get (this); |
d284e1b8 | 411 | |
ff6686d2 | 412 | if (param_adjustments) |
ae7a23a3 JH |
413 | clone_info::get_create (new_node)->param_adjustments = param_adjustments; |
414 | else if (info && info->param_adjustments) | |
415 | clone_info::get_create (new_node)->param_adjustments | |
416 | = info->param_adjustments; | |
ed6ef490 | 417 | new_node->split_part = split_part; |
d284e1b8 | 418 | |
9771b263 | 419 | FOR_EACH_VEC_ELT (redirect_callers, i, e) |
564fe867 JH |
420 | { |
421 | /* Redirect calls to the old version node to point to its new | |
9de6f6c3 | 422 | version. The only exception is when the edge was proved to |
dfea3d6f | 423 | be unreachable during the cloning procedure. */ |
9de6f6c3 | 424 | if (!e->callee |
3d78e008 | 425 | || !fndecl_built_in_p (e->callee->decl, BUILT_IN_UNREACHABLE)) |
6a4bad95 | 426 | e->redirect_callee_duplicating_thunks (new_node); |
564fe867 | 427 | } |
6a4bad95 | 428 | new_node->expand_all_artificial_thunks (); |
564fe867 | 429 | |
d52f5295 | 430 | for (e = callees;e; e=e->next_callee) |
1bad9c18 JH |
431 | e->clone (new_node, e->call_stmt, e->lto_stmt_uid, new_node->count, old_count, |
432 | update_original); | |
564fe867 | 433 | |
d52f5295 | 434 | for (e = indirect_calls; e; e = e->next_callee) |
3dafb85c | 435 | e->clone (new_node, e->call_stmt, e->lto_stmt_uid, |
1bad9c18 | 436 | new_node->count, old_count, update_original); |
d52f5295 | 437 | new_node->clone_references (this); |
564fe867 | 438 | |
d52f5295 ML |
439 | new_node->next_sibling_clone = clones; |
440 | if (clones) | |
441 | clones->prev_sibling_clone = new_node; | |
442 | clones = new_node; | |
443 | new_node->clone_of = this; | |
564fe867 JH |
444 | |
445 | if (call_duplication_hook) | |
3dafb85c | 446 | symtab->call_cgraph_duplication_hooks (this, new_node); |
34fbe3f0 JH |
447 | /* With partial train run we do not want to assume that original's |
448 | count is zero whenever we redurect all executed edges to clone. | |
449 | Simply drop profile to local one in this case. */ | |
450 | if (update_original | |
451 | && opt_for_fn (decl, flag_profile_partial_training) | |
452 | && nonzero | |
453 | && count.ipa_p () | |
f7f6be76 JH |
454 | && !count.ipa ().nonzero_p () |
455 | && !inlined_to) | |
34fbe3f0 | 456 | localize_profile (this); |
0bdad123 ML |
457 | |
458 | if (!new_inlined_to) | |
459 | dump_callgraph_transformation (this, new_node, suffix); | |
460 | ||
564fe867 JH |
461 | return new_node; |
462 | } | |
463 | ||
b75255a9 | 464 | static GTY(()) hash_map<const char *, unsigned> *clone_fn_ids; |
564fe867 | 465 | |
7958186b MP |
466 | /* Return a new assembler name for a clone of decl named NAME. Apart |
467 | from the string SUFFIX, the new name will end with a unique (for | |
468 | each NAME) unspecified number. If clone numbering is not needed | |
469 | then the two argument clone_function_name should be used instead. | |
470 | Should not be called directly except for by | |
471 | lto-partition.c:privatize_symbol_name_1. */ | |
9816367c | 472 | |
564fe867 | 473 | tree |
7958186b MP |
474 | clone_function_name_numbered (const char *name, const char *suffix) |
475 | { | |
b75255a9 MP |
476 | /* Initialize the function->counter mapping the first time it's |
477 | needed. */ | |
478 | if (!clone_fn_ids) | |
479 | clone_fn_ids = hash_map<const char *, unsigned int>::create_ggc (64); | |
480 | unsigned int &suffix_counter = clone_fn_ids->get_or_insert ( | |
481 | IDENTIFIER_POINTER (get_identifier (name))); | |
482 | return clone_function_name (name, suffix, suffix_counter++); | |
7958186b MP |
483 | } |
484 | ||
485 | /* Return a new assembler name for a clone of DECL. Apart from string | |
486 | SUFFIX, the new name will end with a unique (for each DECL | |
487 | assembler name) unspecified number. If clone numbering is not | |
488 | needed then the two argument clone_function_name should be used | |
489 | instead. */ | |
490 | ||
491 | tree | |
492 | clone_function_name_numbered (tree decl, const char *suffix) | |
493 | { | |
494 | tree name = DECL_ASSEMBLER_NAME (decl); | |
495 | return clone_function_name_numbered (IDENTIFIER_POINTER (name), | |
496 | suffix); | |
497 | } | |
498 | ||
499 | /* Return a new assembler name for a clone of decl named NAME. Apart | |
500 | from the string SUFFIX, the new name will end with the specified | |
501 | NUMBER. If clone numbering is not needed then the two argument | |
502 | clone_function_name should be used instead. */ | |
503 | ||
504 | tree | |
505 | clone_function_name (const char *name, const char *suffix, | |
506 | unsigned long number) | |
564fe867 | 507 | { |
9816367c | 508 | size_t len = strlen (name); |
564fe867 JH |
509 | char *tmp_name, *prefix; |
510 | ||
511 | prefix = XALLOCAVEC (char, len + strlen (suffix) + 2); | |
9816367c | 512 | memcpy (prefix, name, len); |
564fe867 | 513 | strcpy (prefix + len + 1, suffix); |
f8a1abf8 | 514 | prefix[len] = symbol_table::symbol_suffix_separator (); |
7958186b | 515 | ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix, number); |
564fe867 JH |
516 | return get_identifier (tmp_name); |
517 | } | |
518 | ||
53aedcce MP |
519 | /* Return a new assembler name for a clone of DECL. Apart from the |
520 | string SUFFIX, the new name will end with the specified NUMBER. If | |
521 | clone numbering is not needed then the two argument | |
522 | clone_function_name should be used instead. */ | |
523 | ||
524 | tree | |
525 | clone_function_name (tree decl, const char *suffix, | |
526 | unsigned long number) | |
527 | { | |
528 | return clone_function_name ( | |
529 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)), suffix, number); | |
530 | } | |
531 | ||
7958186b MP |
532 | /* Return a new assembler name ending with the string SUFFIX for a |
533 | clone of DECL. */ | |
9816367c BS |
534 | |
535 | tree | |
536 | clone_function_name (tree decl, const char *suffix) | |
537 | { | |
7958186b MP |
538 | tree identifier = DECL_ASSEMBLER_NAME (decl); |
539 | /* For consistency this needs to behave the same way as | |
540 | ASM_FORMAT_PRIVATE_NAME does, but without the final number | |
541 | suffix. */ | |
542 | char *separator = XALLOCAVEC (char, 2); | |
543 | separator[0] = symbol_table::symbol_suffix_separator (); | |
544 | separator[1] = 0; | |
545 | #if defined (NO_DOT_IN_LABEL) && defined (NO_DOLLAR_IN_LABEL) | |
546 | const char *prefix = "__"; | |
547 | #else | |
548 | const char *prefix = ""; | |
549 | #endif | |
550 | char *result = ACONCAT ((prefix, | |
551 | IDENTIFIER_POINTER (identifier), | |
552 | separator, | |
553 | suffix, | |
554 | (char*)0)); | |
555 | return get_identifier (result); | |
9816367c BS |
556 | } |
557 | ||
558 | ||
53aedcce MP |
559 | /* Create callgraph node clone with new declaration. The actual body will be |
560 | copied later at compilation stage. The name of the new clone will be | |
561 | constructed from the name of the original node, SUFFIX and NUM_SUFFIX. | |
564fe867 JH |
562 | |
563 | TODO: after merging in ipa-sra use function call notes instead of args_to_skip | |
564 | bitmap interface. | |
565 | */ | |
3dafb85c | 566 | cgraph_node * |
00dcc88a | 567 | cgraph_node::create_virtual_clone (const vec<cgraph_edge *> &redirect_callers, |
d52f5295 | 568 | vec<ipa_replace_map *, va_gc> *tree_map, |
ff6686d2 MJ |
569 | ipa_param_adjustments *param_adjustments, |
570 | const char * suffix, unsigned num_suffix) | |
564fe867 | 571 | { |
d52f5295 | 572 | tree old_decl = decl; |
3dafb85c | 573 | cgraph_node *new_node = NULL; |
564fe867 | 574 | tree new_decl; |
440a5082 | 575 | size_t len, i; |
3dafb85c | 576 | ipa_replace_map *map; |
440a5082 | 577 | char *name; |
564fe867 | 578 | |
87f94429 | 579 | gcc_checking_assert (versionable); |
ff6686d2 MJ |
580 | /* TODO: It would be nice if we could recognize that param_adjustments do not |
581 | actually perform any changes, but at the moment let's require it simply | |
582 | does not exist. */ | |
87f94429 | 583 | gcc_assert (can_change_signature || !param_adjustments); |
564fe867 JH |
584 | |
585 | /* Make a new FUNCTION_DECL tree node */ | |
ff6686d2 | 586 | if (!param_adjustments) |
564fe867 JH |
587 | new_decl = copy_node (old_decl); |
588 | else | |
ff6686d2 | 589 | new_decl = param_adjustments->adjust_decl (old_decl); |
49bde175 JH |
590 | |
591 | /* These pointers represent function body and will be populated only when clone | |
592 | is materialized. */ | |
593 | gcc_assert (new_decl != old_decl); | |
564fe867 | 594 | DECL_STRUCT_FUNCTION (new_decl) = NULL; |
49bde175 JH |
595 | DECL_ARGUMENTS (new_decl) = NULL; |
596 | DECL_INITIAL (new_decl) = NULL; | |
597 | DECL_RESULT (new_decl) = NULL; | |
67914693 | 598 | /* We cannot do DECL_RESULT (new_decl) = NULL; here because of LTO partitioning |
49bde175 | 599 | sometimes storing only clone decl instead of original. */ |
564fe867 JH |
600 | |
601 | /* Generate a new name for the new version. */ | |
440a5082 EB |
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); | |
53aedcce MP |
608 | SET_DECL_ASSEMBLER_NAME (new_decl, |
609 | clone_function_name (old_decl, suffix, num_suffix)); | |
564fe867 JH |
610 | SET_DECL_RTL (new_decl, NULL); |
611 | ||
1bad9c18 | 612 | new_node = create_clone (new_decl, count, false, |
ff6686d2 MJ |
613 | redirect_callers, false, NULL, param_adjustments, |
614 | suffix); | |
d52f5295 | 615 | |
564fe867 JH |
616 | /* Update the properties. |
617 | Make clone visible only within this translation unit. Make sure | |
618 | that is not weak also. | |
619 | ??? We cannot use COMDAT linkage because there is no | |
620 | ABI support for this. */ | |
610c8ef0 | 621 | set_new_clone_decl_and_node_flags (new_node); |
6cf67b62 | 622 | new_node->ipcp_clone = ipcp_clone; |
ae7a23a3 JH |
623 | if (tree_map) |
624 | clone_info::get_create (new_node)->tree_map = tree_map; | |
4ab26ee0 | 625 | if (!implicit_section) |
8b9a92f7 | 626 | new_node->set_section (*this); |
702d8703 JH |
627 | |
628 | /* Clones of global symbols or symbols with unique names are unique. */ | |
629 | if ((TREE_PUBLIC (old_decl) | |
630 | && !DECL_EXTERNAL (old_decl) | |
631 | && !DECL_WEAK (old_decl) | |
632 | && !DECL_COMDAT (old_decl)) | |
633 | || in_lto_p) | |
67348ccc | 634 | new_node->unique_name = true; |
9771b263 | 635 | FOR_EACH_VEC_SAFE_ELT (tree_map, i, map) |
2d8d3ae2 | 636 | new_node->maybe_create_reference (map->new_tree, NULL); |
d284e1b8 | 637 | |
d52f5295 | 638 | if (ipa_transforms_to_apply.exists ()) |
ca860d03 | 639 | new_node->ipa_transforms_to_apply |
d52f5295 | 640 | = ipa_transforms_to_apply.copy (); |
564fe867 | 641 | |
3dafb85c | 642 | symtab->call_cgraph_duplication_hooks (this, new_node); |
564fe867 JH |
643 | |
644 | return new_node; | |
645 | } | |
646 | ||
d52f5295 | 647 | /* callgraph node being removed from symbol table; see if its entry can be |
ab4664eb JH |
648 | replaced by other inline clone. |
649 | INFO is clone info to attach to the new root. */ | |
d52f5295 | 650 | cgraph_node * |
ab4664eb | 651 | cgraph_node::find_replacement (clone_info *info) |
564fe867 | 652 | { |
3dafb85c | 653 | cgraph_node *next_inline_clone, *replacement; |
564fe867 | 654 | |
d52f5295 | 655 | for (next_inline_clone = clones; |
564fe867 | 656 | next_inline_clone |
d52f5295 | 657 | && next_inline_clone->decl != decl; |
564fe867 JH |
658 | next_inline_clone = next_inline_clone->next_sibling_clone) |
659 | ; | |
660 | ||
661 | /* If there is inline clone of the node being removed, we need | |
662 | to put it into the position of removed node and reorganize all | |
663 | other clones to be based on it. */ | |
664 | if (next_inline_clone) | |
665 | { | |
3dafb85c ML |
666 | cgraph_node *n; |
667 | cgraph_node *new_clones; | |
564fe867 JH |
668 | |
669 | replacement = next_inline_clone; | |
670 | ||
671 | /* Unlink inline clone from the list of clones of removed node. */ | |
672 | if (next_inline_clone->next_sibling_clone) | |
673 | next_inline_clone->next_sibling_clone->prev_sibling_clone | |
674 | = next_inline_clone->prev_sibling_clone; | |
675 | if (next_inline_clone->prev_sibling_clone) | |
676 | { | |
d52f5295 | 677 | gcc_assert (clones != next_inline_clone); |
564fe867 JH |
678 | next_inline_clone->prev_sibling_clone->next_sibling_clone |
679 | = next_inline_clone->next_sibling_clone; | |
680 | } | |
681 | else | |
682 | { | |
d52f5295 ML |
683 | gcc_assert (clones == next_inline_clone); |
684 | clones = next_inline_clone->next_sibling_clone; | |
564fe867 JH |
685 | } |
686 | ||
d52f5295 ML |
687 | new_clones = clones; |
688 | clones = NULL; | |
564fe867 JH |
689 | |
690 | /* Copy clone info. */ | |
ae7a23a3 JH |
691 | if (info) |
692 | *clone_info::get_create (next_inline_clone) = *info; | |
564fe867 JH |
693 | |
694 | /* Now place it into clone tree at same level at NODE. */ | |
d52f5295 | 695 | next_inline_clone->clone_of = clone_of; |
564fe867 JH |
696 | next_inline_clone->prev_sibling_clone = NULL; |
697 | next_inline_clone->next_sibling_clone = NULL; | |
d52f5295 | 698 | if (clone_of) |
564fe867 | 699 | { |
d52f5295 ML |
700 | if (clone_of->clones) |
701 | clone_of->clones->prev_sibling_clone = next_inline_clone; | |
702 | next_inline_clone->next_sibling_clone = clone_of->clones; | |
703 | clone_of->clones = next_inline_clone; | |
564fe867 JH |
704 | } |
705 | ||
706 | /* Merge the clone list. */ | |
707 | if (new_clones) | |
708 | { | |
709 | if (!next_inline_clone->clones) | |
710 | next_inline_clone->clones = new_clones; | |
711 | else | |
712 | { | |
713 | n = next_inline_clone->clones; | |
714 | while (n->next_sibling_clone) | |
d52f5295 | 715 | n = n->next_sibling_clone; |
564fe867 JH |
716 | n->next_sibling_clone = new_clones; |
717 | new_clones->prev_sibling_clone = n; | |
718 | } | |
719 | } | |
720 | ||
721 | /* Update clone_of pointers. */ | |
722 | n = new_clones; | |
723 | while (n) | |
724 | { | |
725 | n->clone_of = next_inline_clone; | |
726 | n = n->next_sibling_clone; | |
727 | } | |
3c56d8d8 ML |
728 | |
729 | /* Update order in order to be able to find a LTO section | |
730 | with function body. */ | |
731 | replacement->order = order; | |
732 | ||
564fe867 JH |
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 | |
355fe088 | 746 | cgraph_node::set_call_stmt_including_clones (gimple *old_stmt, |
538dd0b7 | 747 | gcall *new_stmt, |
d52f5295 | 748 | bool update_speculative) |
564fe867 | 749 | { |
3dafb85c | 750 | cgraph_node *node; |
27c5a177 | 751 | cgraph_edge *master_edge = get_edge (old_stmt); |
564fe867 | 752 | |
27c5a177 MJ |
753 | if (master_edge) |
754 | cgraph_edge::set_call_stmt (master_edge, 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 | { |
27c5a177 MJ |
763 | edge = cgraph_edge::set_call_stmt (edge, new_stmt, |
764 | update_speculative); | |
042ae7d2 JH |
765 | /* If UPDATE_SPECULATIVE is false, it means that we are turning |
766 | speculative call into a real code sequence. Update the | |
767 | callgraph edges. */ | |
768 | if (edge->speculative && !update_speculative) | |
769 | { | |
845bb366 JH |
770 | cgraph_edge *indirect = edge->speculative_call_indirect_edge (); |
771 | ||
772 | for (cgraph_edge *next, *direct | |
773 | = edge->first_speculative_call_target (); | |
774 | direct; | |
775 | direct = next) | |
776 | { | |
777 | next = direct->next_speculative_call_target (); | |
778 | direct->speculative_call_target_ref ()->speculative = false; | |
779 | direct->speculative = false; | |
780 | } | |
042ae7d2 | 781 | indirect->speculative = false; |
042ae7d2 JH |
782 | } |
783 | } | |
564fe867 JH |
784 | if (node->clones) |
785 | node = node->clones; | |
786 | else if (node->next_sibling_clone) | |
787 | node = node->next_sibling_clone; | |
788 | else | |
789 | { | |
d52f5295 | 790 | while (node != this && !node->next_sibling_clone) |
564fe867 | 791 | node = node->clone_of; |
d52f5295 | 792 | if (node != this) |
564fe867 JH |
793 | node = node->next_sibling_clone; |
794 | } | |
795 | } | |
796 | } | |
797 | ||
798 | /* Like cgraph_create_edge walk the clone tree and update all clones sharing | |
799 | same function body. If clones already have edge for OLD_STMT; only | |
800 | update the edge same way as cgraph_set_call_stmt_including_clones does. | |
801 | ||
802 | TODO: COUNT and LOOP_DEPTH should be properly distributed based on relative | |
803 | frequencies of the clones. */ | |
804 | ||
805 | void | |
3dafb85c | 806 | cgraph_node::create_edge_including_clones (cgraph_node *callee, |
355fe088 | 807 | gimple *old_stmt, gcall *stmt, |
3995f3a2 | 808 | profile_count count, |
d52f5295 | 809 | cgraph_inline_failed_t reason) |
564fe867 | 810 | { |
3dafb85c | 811 | cgraph_node *node; |
564fe867 | 812 | |
d52f5295 | 813 | if (!get_edge (stmt)) |
564fe867 | 814 | { |
27c5a177 | 815 | cgraph_edge *edge = create_edge (callee, stmt, count); |
564fe867 JH |
816 | edge->inline_failed = reason; |
817 | } | |
818 | ||
d52f5295 | 819 | node = clones; |
564fe867 | 820 | if (node) |
d52f5295 | 821 | while (node != this) |
ec6a1e35 | 822 | /* Thunk clones do not get updated while copying inline function body. */ |
67f3791f | 823 | if (!node->thunk) |
ec6a1e35 JH |
824 | { |
825 | cgraph_edge *edge = node->get_edge (old_stmt); | |
826 | ||
827 | /* It is possible that clones already contain the edge while | |
828 | master didn't. Either we promoted indirect call into direct | |
829 | call in the clone or we are processing clones of unreachable | |
830 | master where edges has been removed. */ | |
831 | if (edge) | |
27c5a177 | 832 | edge = cgraph_edge::set_call_stmt (edge, stmt); |
ec6a1e35 JH |
833 | else if (! node->get_edge (stmt)) |
834 | { | |
1bad9c18 | 835 | edge = node->create_edge (callee, stmt, count); |
ec6a1e35 JH |
836 | edge->inline_failed = reason; |
837 | } | |
564fe867 | 838 | |
ec6a1e35 JH |
839 | if (node->clones) |
840 | node = node->clones; | |
841 | else if (node->next_sibling_clone) | |
842 | node = node->next_sibling_clone; | |
843 | else | |
844 | { | |
845 | while (node != this && !node->next_sibling_clone) | |
846 | node = node->clone_of; | |
847 | if (node != this) | |
848 | node = node->next_sibling_clone; | |
849 | } | |
850 | } | |
564fe867 JH |
851 | } |
852 | ||
853 | /* Remove the node from cgraph and all inline clones inlined into it. | |
854 | Skip however removal of FORBIDDEN_NODE and return true if it needs to be | |
855 | removed. This allows to call the function from outer loop walking clone | |
856 | tree. */ | |
857 | ||
858 | bool | |
d52f5295 | 859 | cgraph_node::remove_symbol_and_inline_clones (cgraph_node *forbidden_node) |
564fe867 | 860 | { |
3dafb85c | 861 | cgraph_edge *e, *next; |
564fe867 JH |
862 | bool found = false; |
863 | ||
d52f5295 | 864 | if (this == forbidden_node) |
39f9719e | 865 | { |
27c5a177 | 866 | cgraph_edge::remove (callers); |
39f9719e JH |
867 | return true; |
868 | } | |
d52f5295 | 869 | for (e = callees; e; e = next) |
564fe867 JH |
870 | { |
871 | next = e->next_callee; | |
872 | if (!e->inline_failed) | |
d52f5295 | 873 | found |= e->callee->remove_symbol_and_inline_clones (forbidden_node); |
564fe867 | 874 | } |
d52f5295 | 875 | remove (); |
564fe867 JH |
876 | return found; |
877 | } | |
878 | ||
879 | /* The edges representing the callers of the NEW_VERSION node were | |
880 | fixed by cgraph_function_versioning (), now the call_expr in their | |
881 | respective tree code should be updated to call the NEW_VERSION. */ | |
882 | ||
883 | static void | |
3dafb85c | 884 | update_call_expr (cgraph_node *new_version) |
564fe867 | 885 | { |
3dafb85c | 886 | cgraph_edge *e; |
564fe867 JH |
887 | |
888 | gcc_assert (new_version); | |
889 | ||
890 | /* Update the call expr on the edges to call the new version. */ | |
891 | for (e = new_version->callers; e; e = e->next_caller) | |
892 | { | |
3dafb85c | 893 | function *inner_function = DECL_STRUCT_FUNCTION (e->caller->decl); |
67348ccc | 894 | gimple_call_set_fndecl (e->call_stmt, new_version->decl); |
564fe867 JH |
895 | maybe_clean_eh_stmt_fn (inner_function, e->call_stmt); |
896 | } | |
897 | } | |
898 | ||
899 | ||
900 | /* Create a new cgraph node which is the new version of | |
d52f5295 | 901 | callgraph node. REDIRECT_CALLERS holds the callers |
564fe867 | 902 | edges which should be redirected to point to |
d52f5295 | 903 | NEW_VERSION. ALL the callees edges of the node |
564fe867 JH |
904 | are cloned to the new version node. Return the new |
905 | version node. | |
906 | ||
907 | If non-NULL BLOCK_TO_COPY determine what basic blocks | |
908 | was copied to prevent duplications of calls that are dead | |
909 | in the clone. */ | |
910 | ||
d52f5295 ML |
911 | cgraph_node * |
912 | cgraph_node::create_version_clone (tree new_decl, | |
913 | vec<cgraph_edge *> redirect_callers, | |
0bdad123 ML |
914 | bitmap bbs_to_copy, |
915 | const char *suffix) | |
564fe867 | 916 | { |
3dafb85c ML |
917 | cgraph_node *new_version; |
918 | cgraph_edge *e; | |
564fe867 JH |
919 | unsigned i; |
920 | ||
d52f5295 | 921 | new_version = cgraph_node::create (new_decl); |
564fe867 | 922 | |
d52f5295 ML |
923 | new_version->analyzed = analyzed; |
924 | new_version->definition = definition; | |
925 | new_version->local = local; | |
67348ccc | 926 | new_version->externally_visible = false; |
7861b648 | 927 | new_version->no_reorder = no_reorder; |
87f94429 | 928 | new_version->local = new_version->definition; |
a62bfab5 | 929 | new_version->inlined_to = inlined_to; |
d52f5295 ML |
930 | new_version->rtl = rtl; |
931 | new_version->count = count; | |
b74d8dc4 JH |
932 | new_version->unit_id = unit_id; |
933 | new_version->merged_comdat = merged_comdat; | |
934 | new_version->merged_extern_inline = merged_extern_inline; | |
564fe867 | 935 | |
d52f5295 | 936 | for (e = callees; e; e=e->next_callee) |
564fe867 JH |
937 | if (!bbs_to_copy |
938 | || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index)) | |
3dafb85c | 939 | e->clone (new_version, e->call_stmt, |
1511c8c0 | 940 | e->lto_stmt_uid, count, count, |
3dafb85c | 941 | true); |
d52f5295 | 942 | for (e = indirect_calls; e; e=e->next_callee) |
564fe867 JH |
943 | if (!bbs_to_copy |
944 | || bitmap_bit_p (bbs_to_copy, gimple_bb (e->call_stmt)->index)) | |
3dafb85c | 945 | e->clone (new_version, e->call_stmt, |
1511c8c0 | 946 | e->lto_stmt_uid, count, count, |
3dafb85c | 947 | true); |
9771b263 | 948 | FOR_EACH_VEC_ELT (redirect_callers, i, e) |
564fe867 JH |
949 | { |
950 | /* Redirect calls to the old version node to point to its new | |
951 | version. */ | |
3dafb85c | 952 | e->redirect_callee (new_version); |
564fe867 JH |
953 | } |
954 | ||
0bdad123 ML |
955 | dump_callgraph_transformation (this, new_version, suffix); |
956 | ||
564fe867 JH |
957 | return new_version; |
958 | } | |
959 | ||
960 | /* Perform function versioning. | |
961 | Function versioning includes copying of the tree and | |
962 | a callgraph update (creating a new cgraph node and updating | |
963 | its callees and callers). | |
964 | ||
965 | REDIRECT_CALLERS varray includes the edges to be redirected | |
966 | to the new version. | |
967 | ||
968 | TREE_MAP is a mapping of tree nodes we want to replace with | |
969 | new ones (according to results of prior analysis). | |
564fe867 JH |
970 | |
971 | If non-NULL ARGS_TO_SKIP determine function parameters to remove | |
972 | from new version. | |
973 | If SKIP_RETURN is true, the new version will return void. | |
974 | If non-NULL BLOCK_TO_COPY determine what basic blocks to copy. | |
975 | If non_NULL NEW_ENTRY determine new entry BB of the clone. | |
976 | ||
5928bc2e ML |
977 | If TARGET_ATTRIBUTES is non-null, when creating a new declaration, |
978 | add the attributes to DECL_ATTRIBUTES. And call valid_attribute_p | |
979 | that will promote value of the attribute DECL_FUNCTION_SPECIFIC_TARGET | |
980 | of the declaration. | |
981 | ||
564fe867 JH |
982 | Return the new version's cgraph node. */ |
983 | ||
d52f5295 ML |
984 | cgraph_node * |
985 | cgraph_node::create_version_clone_with_body | |
986 | (vec<cgraph_edge *> redirect_callers, | |
ff6686d2 MJ |
987 | vec<ipa_replace_map *, va_gc> *tree_map, |
988 | ipa_param_adjustments *param_adjustments, | |
989 | bitmap bbs_to_copy, basic_block new_entry_block, const char *suffix, | |
990 | tree target_attributes) | |
564fe867 | 991 | { |
d52f5295 | 992 | tree old_decl = decl; |
3dafb85c | 993 | cgraph_node *new_version_node = NULL; |
564fe867 JH |
994 | tree new_decl; |
995 | ||
996 | if (!tree_versionable_function_p (old_decl)) | |
997 | return NULL; | |
998 | ||
ff6686d2 | 999 | /* TODO: Restore an assert that we do not change signature if |
87f94429 | 1000 | can_change_signature is false. We cannot just check that |
ff6686d2 MJ |
1001 | param_adjustments is NULL because unfortunately ipa-split removes return |
1002 | values from such functions. */ | |
564fe867 JH |
1003 | |
1004 | /* Make a new FUNCTION_DECL tree node for the new version. */ | |
ff6686d2 MJ |
1005 | if (param_adjustments) |
1006 | new_decl = param_adjustments->adjust_decl (old_decl); | |
564fe867 | 1007 | else |
ff6686d2 | 1008 | new_decl = copy_node (old_decl); |
564fe867 JH |
1009 | |
1010 | /* Generate a new name for the new version. */ | |
7958186b | 1011 | DECL_NAME (new_decl) = clone_function_name_numbered (old_decl, suffix); |
564fe867 JH |
1012 | SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl)); |
1013 | SET_DECL_RTL (new_decl, NULL); | |
1014 | ||
97ae2126 JH |
1015 | DECL_VIRTUAL_P (new_decl) = 0; |
1016 | ||
5928bc2e ML |
1017 | if (target_attributes) |
1018 | { | |
1019 | DECL_ATTRIBUTES (new_decl) = target_attributes; | |
1020 | ||
1021 | location_t saved_loc = input_location; | |
1022 | tree v = TREE_VALUE (target_attributes); | |
1023 | input_location = DECL_SOURCE_LOCATION (new_decl); | |
cc2a672a | 1024 | bool r = targetm.target_option.valid_attribute_p (new_decl, NULL, v, 1); |
5928bc2e ML |
1025 | input_location = saved_loc; |
1026 | if (!r) | |
1027 | return NULL; | |
1028 | } | |
1029 | ||
564fe867 | 1030 | /* When the old decl was a con-/destructor make sure the clone isn't. */ |
c3284718 RS |
1031 | DECL_STATIC_CONSTRUCTOR (new_decl) = 0; |
1032 | DECL_STATIC_DESTRUCTOR (new_decl) = 0; | |
fe8e21fd ML |
1033 | DECL_SET_IS_OPERATOR_NEW (new_decl, 0); |
1034 | DECL_SET_IS_OPERATOR_DELETE (new_decl, 0); | |
d7a65edb | 1035 | DECL_IS_REPLACEABLE_OPERATOR (new_decl) = 0; |
564fe867 JH |
1036 | |
1037 | /* Create the new version's call-graph node. | |
1038 | and update the edges of the new node. */ | |
d52f5295 | 1039 | new_version_node = create_version_clone (new_decl, redirect_callers, |
0bdad123 | 1040 | bbs_to_copy, suffix); |
564fe867 | 1041 | |
d52f5295 | 1042 | if (ipa_transforms_to_apply.exists ()) |
c6d43074 | 1043 | new_version_node->ipa_transforms_to_apply |
d52f5295 | 1044 | = ipa_transforms_to_apply.copy (); |
564fe867 | 1045 | /* Copy the OLD_VERSION_NODE function tree to the new version. */ |
ff6686d2 MJ |
1046 | tree_function_versioning (old_decl, new_decl, tree_map, param_adjustments, |
1047 | false, bbs_to_copy, new_entry_block); | |
564fe867 JH |
1048 | |
1049 | /* Update the new version's properties. | |
1050 | Make The new version visible only within this translation unit. Make sure | |
1051 | that is not weak also. | |
1052 | ??? We cannot use COMDAT linkage because there is no | |
1053 | ABI support for this. */ | |
d52f5295 | 1054 | new_version_node->make_decl_local (); |
67348ccc DM |
1055 | DECL_VIRTUAL_P (new_version_node->decl) = 0; |
1056 | new_version_node->externally_visible = 0; | |
87f94429 | 1057 | new_version_node->local = 1; |
564fe867 | 1058 | new_version_node->lowered = true; |
4ab26ee0 | 1059 | if (!implicit_section) |
8b9a92f7 | 1060 | new_version_node->set_section (*this); |
702d8703 JH |
1061 | /* Clones of global symbols or symbols with unique names are unique. */ |
1062 | if ((TREE_PUBLIC (old_decl) | |
1063 | && !DECL_EXTERNAL (old_decl) | |
1064 | && !DECL_WEAK (old_decl) | |
1065 | && !DECL_COMDAT (old_decl)) | |
1066 | || in_lto_p) | |
67348ccc | 1067 | new_version_node->unique_name = true; |
564fe867 JH |
1068 | |
1069 | /* Update the call_expr on the edges to call the new version node. */ | |
1070 | update_call_expr (new_version_node); | |
1071 | ||
cbb4e4ca | 1072 | symtab->call_cgraph_insertion_hooks (new_version_node); |
564fe867 JH |
1073 | return new_version_node; |
1074 | } | |
1075 | ||
d0b1b67a MJ |
1076 | /* Remove the node from the tree of virtual and inline clones and make it a |
1077 | standalone node - not a clone any more. */ | |
1078 | ||
1079 | void cgraph_node::remove_from_clone_tree () | |
1080 | { | |
1081 | if (next_sibling_clone) | |
1082 | next_sibling_clone->prev_sibling_clone = prev_sibling_clone; | |
1083 | if (prev_sibling_clone) | |
1084 | prev_sibling_clone->next_sibling_clone = next_sibling_clone; | |
1085 | else | |
1086 | clone_of->clones = next_sibling_clone; | |
1087 | next_sibling_clone = NULL; | |
1088 | prev_sibling_clone = NULL; | |
1089 | clone_of = NULL; | |
1090 | } | |
1091 | ||
564fe867 JH |
1092 | /* Given virtual clone, turn it into actual clone. */ |
1093 | ||
564fe867 | 1094 | void |
0e590b68 | 1095 | cgraph_node::materialize_clone () |
564fe867 | 1096 | { |
ae7a23a3 | 1097 | clone_info *info = clone_info::get (this); |
0e590b68 JH |
1098 | clone_of->get_untransformed_body (); |
1099 | former_clone_of = clone_of->decl; | |
1100 | if (clone_of->former_clone_of) | |
1101 | former_clone_of = clone_of->former_clone_of; | |
3dafb85c | 1102 | if (symtab->dump_file) |
564fe867 | 1103 | { |
0e590b68 JH |
1104 | fprintf (symtab->dump_file, "cloning %s to %s\n", |
1105 | clone_of->dump_name (), | |
1106 | dump_name ()); | |
25a0d08b | 1107 | if (info && info->tree_map) |
564fe867 | 1108 | { |
0e590b68 JH |
1109 | fprintf (symtab->dump_file, " replace map:"); |
1110 | for (unsigned int i = 0; | |
ae7a23a3 | 1111 | i < vec_safe_length (info->tree_map); |
0e590b68 | 1112 | i++) |
564fe867 | 1113 | { |
0e590b68 | 1114 | ipa_replace_map *replace_info; |
ae7a23a3 | 1115 | replace_info = (*info->tree_map)[i]; |
0e590b68 JH |
1116 | fprintf (symtab->dump_file, "%s %i -> ", |
1117 | i ? "," : "", replace_info->parm_num); | |
1118 | print_generic_expr (symtab->dump_file, | |
1119 | replace_info->new_tree); | |
564fe867 | 1120 | } |
0e590b68 | 1121 | fprintf (symtab->dump_file, "\n"); |
564fe867 | 1122 | } |
25a0d08b | 1123 | if (info && info->param_adjustments) |
ae7a23a3 | 1124 | info->param_adjustments->dump (symtab->dump_file); |
564fe867 | 1125 | } |
783dc02d | 1126 | clear_stmts_in_references (); |
0e590b68 JH |
1127 | /* Copy the OLD_VERSION_NODE function tree to the new version. */ |
1128 | tree_function_versioning (clone_of->decl, decl, | |
ae7a23a3 JH |
1129 | info ? info->tree_map : NULL, |
1130 | info ? info->param_adjustments : NULL, | |
0e590b68 | 1131 | true, NULL, NULL); |
3dafb85c | 1132 | if (symtab->dump_file) |
0e590b68 JH |
1133 | { |
1134 | dump_function_to_file (clone_of->decl, symtab->dump_file, | |
1135 | dump_flags); | |
1136 | dump_function_to_file (decl, symtab->dump_file, dump_flags); | |
1137 | } | |
b2b29377 | 1138 | |
0e590b68 JH |
1139 | cgraph_node *this_clone_of = clone_of; |
1140 | /* Function is no longer clone. */ | |
1141 | remove_from_clone_tree (); | |
1142 | if (!this_clone_of->analyzed && !this_clone_of->clones) | |
d7145b4b | 1143 | this_clone_of->release_body (); |
564fe867 JH |
1144 | } |
1145 | ||
1146 | #include "gt-cgraphclones.h" |