]>
Commit | Line | Data |
---|---|---|
3e485f62 | 1 | /* Function splitting pass |
5624e564 | 2 | Copyright (C) 2010-2015 Free Software Foundation, Inc. |
3e485f62 JH |
3 | Contributed by Jan Hubicka <jh@suse.cz> |
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 | /* The purpose of this pass is to split function bodies to improve | |
22 | inlining. I.e. for function of the form: | |
23 | ||
24 | func (...) | |
25 | { | |
26 | if (cheap_test) | |
27 | something_small | |
28 | else | |
29 | something_big | |
30 | } | |
31 | ||
32 | Produce: | |
33 | ||
34 | func.part (...) | |
35 | { | |
36 | something_big | |
37 | } | |
38 | ||
39 | func (...) | |
40 | { | |
41 | if (cheap_test) | |
42 | something_small | |
43 | else | |
44 | func.part (...); | |
45 | } | |
46 | ||
47 | When func becomes inlinable and when cheap_test is often true, inlining func, | |
ed7656f6 | 48 | but not fund.part leads to performance improvement similar as inlining |
3e485f62 JH |
49 | original func while the code size growth is smaller. |
50 | ||
51 | The pass is organized in three stages: | |
52 | 1) Collect local info about basic block into BB_INFO structure and | |
53 | compute function body estimated size and time. | |
54 | 2) Via DFS walk find all possible basic blocks where we can split | |
55 | and chose best one. | |
56 | 3) If split point is found, split at the specified BB by creating a clone | |
57 | and updating function to call it. | |
58 | ||
59 | The decisions what functions to split are in execute_split_functions | |
60 | and consider_split. | |
61 | ||
62 | There are several possible future improvements for this pass including: | |
63 | ||
64 | 1) Splitting to break up large functions | |
65 | 2) Splitting to reduce stack frame usage | |
66 | 3) Allow split part of function to use values computed in the header part. | |
67 | The values needs to be passed to split function, perhaps via same | |
68 | interface as for nested functions or as argument. | |
69 | 4) Support for simple rematerialization. I.e. when split part use | |
70 | value computed in header from function parameter in very cheap way, we | |
71 | can just recompute it. | |
72 | 5) Support splitting of nested functions. | |
73 | 6) Support non-SSA arguments. | |
74 | 7) There is nothing preventing us from producing multiple parts of single function | |
75 | when needed or splitting also the parts. */ | |
76 | ||
77 | #include "config.h" | |
78 | #include "system.h" | |
79 | #include "coretypes.h" | |
40e23961 | 80 | #include "alias.h" |
c7131fb2 | 81 | #include "backend.h" |
9fdcd34e | 82 | #include "cfghooks.h" |
40e23961 | 83 | #include "tree.h" |
c7131fb2 AM |
84 | #include "gimple.h" |
85 | #include "rtl.h" | |
86 | #include "ssa.h" | |
87 | #include "options.h" | |
40e23961 | 88 | #include "fold-const.h" |
60393bbc | 89 | #include "cfganal.h" |
2fb9a547 | 90 | #include "internal-fn.h" |
36566b39 | 91 | #include "flags.h" |
36566b39 PK |
92 | #include "insn-config.h" |
93 | #include "expmed.h" | |
94 | #include "dojump.h" | |
95 | #include "explow.h" | |
d8a2d370 | 96 | #include "calls.h" |
36566b39 PK |
97 | #include "emit-rtl.h" |
98 | #include "varasm.h" | |
99 | #include "stmt.h" | |
100 | #include "expr.h" | |
45b0be94 | 101 | #include "gimplify.h" |
5be5c238 | 102 | #include "gimple-iterator.h" |
18f429e2 | 103 | #include "gimplify-me.h" |
5be5c238 | 104 | #include "gimple-walk.h" |
3e485f62 | 105 | #include "target.h" |
c582198b AM |
106 | #include "cgraph.h" |
107 | #include "alloc-pool.h" | |
dd912cb8 | 108 | #include "symbol-summary.h" |
3e485f62 | 109 | #include "ipa-prop.h" |
442b4905 | 110 | #include "tree-cfg.h" |
442b4905 AM |
111 | #include "tree-into-ssa.h" |
112 | #include "tree-dfa.h" | |
3e485f62 | 113 | #include "tree-pass.h" |
3e485f62 JH |
114 | #include "diagnostic.h" |
115 | #include "tree-dump.h" | |
116 | #include "tree-inline.h" | |
3e485f62 JH |
117 | #include "params.h" |
118 | #include "gimple-pretty-print.h" | |
e7f23018 | 119 | #include "ipa-inline.h" |
a9e0d843 | 120 | #include "cfgloop.h" |
d5e254e1 | 121 | #include "tree-chkp.h" |
3e485f62 JH |
122 | |
123 | /* Per basic block info. */ | |
124 | ||
50686850 | 125 | struct split_bb_info |
3e485f62 JH |
126 | { |
127 | unsigned int size; | |
128 | unsigned int time; | |
50686850 | 129 | }; |
3e485f62 | 130 | |
11478306 | 131 | static vec<split_bb_info> bb_info_vec; |
3e485f62 JH |
132 | |
133 | /* Description of split point. */ | |
134 | ||
135 | struct split_point | |
136 | { | |
137 | /* Size of the partitions. */ | |
138 | unsigned int header_time, header_size, split_time, split_size; | |
139 | ||
ed7656f6 | 140 | /* SSA names that need to be passed into spit function. */ |
3e485f62 JH |
141 | bitmap ssa_names_to_pass; |
142 | ||
143 | /* Basic block where we split (that will become entry point of new function. */ | |
144 | basic_block entry_bb; | |
145 | ||
146 | /* Basic blocks we are splitting away. */ | |
147 | bitmap split_bbs; | |
241a2b9e JH |
148 | |
149 | /* True when return value is computed on split part and thus it needs | |
150 | to be returned. */ | |
151 | bool split_part_set_retval; | |
3e485f62 JH |
152 | }; |
153 | ||
154 | /* Best split point found. */ | |
155 | ||
156 | struct split_point best_split_point; | |
157 | ||
b2e25729 BS |
158 | /* Set of basic blocks that are not allowed to dominate a split point. */ |
159 | ||
160 | static bitmap forbidden_dominators; | |
161 | ||
241a2b9e | 162 | static tree find_retval (basic_block return_bb); |
d5e254e1 | 163 | static tree find_retbnd (basic_block return_bb); |
241a2b9e | 164 | |
1802378d | 165 | /* Callback for walk_stmt_load_store_addr_ops. If T is non-SSA automatic |
3e485f62 JH |
166 | variable, check it if it is present in bitmap passed via DATA. */ |
167 | ||
168 | static bool | |
355fe088 | 169 | test_nonssa_use (gimple *, tree t, tree, void *data) |
3e485f62 JH |
170 | { |
171 | t = get_base_address (t); | |
172 | ||
1802378d EB |
173 | if (!t || is_gimple_reg (t)) |
174 | return false; | |
175 | ||
176 | if (TREE_CODE (t) == PARM_DECL | |
177 | || (TREE_CODE (t) == VAR_DECL | |
3e485f62 | 178 | && auto_var_in_fn_p (t, current_function_decl)) |
1802378d | 179 | || TREE_CODE (t) == RESULT_DECL |
412c4af7 JH |
180 | /* Normal labels are part of CFG and will be handled gratefuly. |
181 | Forced labels however can be used directly by statements and | |
182 | need to stay in one partition along with their uses. */ | |
183 | || (TREE_CODE (t) == LABEL_DECL | |
184 | && FORCED_LABEL (t))) | |
3e485f62 | 185 | return bitmap_bit_p ((bitmap)data, DECL_UID (t)); |
241a2b9e | 186 | |
1802378d EB |
187 | /* For DECL_BY_REFERENCE, the return value is actually a pointer. We want |
188 | to pretend that the value pointed to is actual result decl. */ | |
189 | if ((TREE_CODE (t) == MEM_REF || INDIRECT_REF_P (t)) | |
241a2b9e | 190 | && TREE_CODE (TREE_OPERAND (t, 0)) == SSA_NAME |
70b5e7dc | 191 | && SSA_NAME_VAR (TREE_OPERAND (t, 0)) |
241a2b9e JH |
192 | && TREE_CODE (SSA_NAME_VAR (TREE_OPERAND (t, 0))) == RESULT_DECL |
193 | && DECL_BY_REFERENCE (DECL_RESULT (current_function_decl))) | |
1802378d EB |
194 | return |
195 | bitmap_bit_p ((bitmap)data, | |
196 | DECL_UID (DECL_RESULT (current_function_decl))); | |
197 | ||
3e485f62 JH |
198 | return false; |
199 | } | |
200 | ||
201 | /* Dump split point CURRENT. */ | |
202 | ||
203 | static void | |
204 | dump_split_point (FILE * file, struct split_point *current) | |
205 | { | |
206 | fprintf (file, | |
cfef45c8 RG |
207 | "Split point at BB %i\n" |
208 | " header time: %i header size: %i\n" | |
209 | " split time: %i split size: %i\n bbs: ", | |
3e485f62 JH |
210 | current->entry_bb->index, current->header_time, |
211 | current->header_size, current->split_time, current->split_size); | |
212 | dump_bitmap (file, current->split_bbs); | |
213 | fprintf (file, " SSA names to pass: "); | |
214 | dump_bitmap (file, current->ssa_names_to_pass); | |
215 | } | |
216 | ||
1802378d EB |
217 | /* Look for all BBs in header that might lead to the split part and verify |
218 | that they are not defining any non-SSA var used by the split part. | |
2094f1fc JH |
219 | Parameters are the same as for consider_split. */ |
220 | ||
221 | static bool | |
222 | verify_non_ssa_vars (struct split_point *current, bitmap non_ssa_vars, | |
223 | basic_block return_bb) | |
224 | { | |
225 | bitmap seen = BITMAP_ALLOC (NULL); | |
6e1aa848 | 226 | vec<basic_block> worklist = vNULL; |
2094f1fc JH |
227 | edge e; |
228 | edge_iterator ei; | |
229 | bool ok = true; | |
412c4af7 | 230 | basic_block bb; |
1802378d | 231 | |
2094f1fc | 232 | FOR_EACH_EDGE (e, ei, current->entry_bb->preds) |
fefa31b5 | 233 | if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun) |
2094f1fc JH |
234 | && !bitmap_bit_p (current->split_bbs, e->src->index)) |
235 | { | |
9771b263 | 236 | worklist.safe_push (e->src); |
2094f1fc JH |
237 | bitmap_set_bit (seen, e->src->index); |
238 | } | |
1802378d | 239 | |
9771b263 | 240 | while (!worklist.is_empty ()) |
2094f1fc | 241 | { |
412c4af7 | 242 | bb = worklist.pop (); |
2094f1fc | 243 | FOR_EACH_EDGE (e, ei, bb->preds) |
fefa31b5 | 244 | if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun) |
fcaa4ca4 | 245 | && bitmap_set_bit (seen, e->src->index)) |
2094f1fc JH |
246 | { |
247 | gcc_checking_assert (!bitmap_bit_p (current->split_bbs, | |
248 | e->src->index)); | |
9771b263 | 249 | worklist.safe_push (e->src); |
2094f1fc | 250 | } |
538dd0b7 DM |
251 | for (gimple_stmt_iterator bsi = gsi_start_bb (bb); !gsi_end_p (bsi); |
252 | gsi_next (&bsi)) | |
2094f1fc | 253 | { |
355fe088 | 254 | gimple *stmt = gsi_stmt (bsi); |
1802378d | 255 | if (is_gimple_debug (stmt)) |
2094f1fc JH |
256 | continue; |
257 | if (walk_stmt_load_store_addr_ops | |
1802378d EB |
258 | (stmt, non_ssa_vars, test_nonssa_use, test_nonssa_use, |
259 | test_nonssa_use)) | |
2094f1fc JH |
260 | { |
261 | ok = false; | |
262 | goto done; | |
263 | } | |
538dd0b7 DM |
264 | if (glabel *label_stmt = dyn_cast <glabel *> (stmt)) |
265 | if (test_nonssa_use (stmt, gimple_label_label (label_stmt), | |
266 | NULL_TREE, non_ssa_vars)) | |
267 | { | |
268 | ok = false; | |
269 | goto done; | |
270 | } | |
2094f1fc | 271 | } |
538dd0b7 DM |
272 | for (gphi_iterator bsi = gsi_start_phis (bb); !gsi_end_p (bsi); |
273 | gsi_next (&bsi)) | |
2094f1fc JH |
274 | { |
275 | if (walk_stmt_load_store_addr_ops | |
1802378d EB |
276 | (gsi_stmt (bsi), non_ssa_vars, test_nonssa_use, test_nonssa_use, |
277 | test_nonssa_use)) | |
2094f1fc JH |
278 | { |
279 | ok = false; | |
280 | goto done; | |
281 | } | |
282 | } | |
283 | FOR_EACH_EDGE (e, ei, bb->succs) | |
284 | { | |
285 | if (e->dest != return_bb) | |
286 | continue; | |
538dd0b7 DM |
287 | for (gphi_iterator bsi = gsi_start_phis (return_bb); |
288 | !gsi_end_p (bsi); | |
2094f1fc JH |
289 | gsi_next (&bsi)) |
290 | { | |
538dd0b7 | 291 | gphi *stmt = bsi.phi (); |
2094f1fc JH |
292 | tree op = gimple_phi_arg_def (stmt, e->dest_idx); |
293 | ||
ea057359 | 294 | if (virtual_operand_p (gimple_phi_result (stmt))) |
2094f1fc JH |
295 | continue; |
296 | if (TREE_CODE (op) != SSA_NAME | |
9f1363cd | 297 | && test_nonssa_use (stmt, op, op, non_ssa_vars)) |
2094f1fc JH |
298 | { |
299 | ok = false; | |
300 | goto done; | |
301 | } | |
302 | } | |
303 | } | |
304 | } | |
412c4af7 JH |
305 | |
306 | /* Verify that the rest of function does not define any label | |
307 | used by the split part. */ | |
308 | FOR_EACH_BB_FN (bb, cfun) | |
309 | if (!bitmap_bit_p (current->split_bbs, bb->index) | |
310 | && !bitmap_bit_p (seen, bb->index)) | |
311 | { | |
312 | gimple_stmt_iterator bsi; | |
313 | for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi)) | |
538dd0b7 | 314 | if (glabel *label_stmt = dyn_cast <glabel *> (gsi_stmt (bsi))) |
412c4af7 | 315 | { |
538dd0b7 DM |
316 | if (test_nonssa_use (label_stmt, |
317 | gimple_label_label (label_stmt), | |
318 | NULL_TREE, non_ssa_vars)) | |
319 | { | |
320 | ok = false; | |
321 | goto done; | |
322 | } | |
412c4af7 | 323 | } |
538dd0b7 | 324 | else |
412c4af7 JH |
325 | break; |
326 | } | |
327 | ||
2094f1fc JH |
328 | done: |
329 | BITMAP_FREE (seen); | |
9771b263 | 330 | worklist.release (); |
2094f1fc JH |
331 | return ok; |
332 | } | |
333 | ||
b2e25729 BS |
334 | /* If STMT is a call, check the callee against a list of forbidden |
335 | predicate functions. If a match is found, look for uses of the | |
336 | call result in condition statements that compare against zero. | |
337 | For each such use, find the block targeted by the condition | |
338 | statement for the nonzero result, and set the bit for this block | |
339 | in the forbidden dominators bitmap. The purpose of this is to avoid | |
340 | selecting a split point where we are likely to lose the chance | |
341 | to optimize away an unused function call. */ | |
342 | ||
343 | static void | |
355fe088 | 344 | check_forbidden_calls (gimple *stmt) |
b2e25729 BS |
345 | { |
346 | imm_use_iterator use_iter; | |
347 | use_operand_p use_p; | |
348 | tree lhs; | |
349 | ||
350 | /* At the moment, __builtin_constant_p is the only forbidden | |
351 | predicate function call (see PR49642). */ | |
352 | if (!gimple_call_builtin_p (stmt, BUILT_IN_CONSTANT_P)) | |
353 | return; | |
354 | ||
355 | lhs = gimple_call_lhs (stmt); | |
356 | ||
357 | if (!lhs || TREE_CODE (lhs) != SSA_NAME) | |
358 | return; | |
359 | ||
360 | FOR_EACH_IMM_USE_FAST (use_p, use_iter, lhs) | |
361 | { | |
362 | tree op1; | |
363 | basic_block use_bb, forbidden_bb; | |
364 | enum tree_code code; | |
365 | edge true_edge, false_edge; | |
538dd0b7 | 366 | gcond *use_stmt; |
b2e25729 | 367 | |
538dd0b7 DM |
368 | use_stmt = dyn_cast <gcond *> (USE_STMT (use_p)); |
369 | if (!use_stmt) | |
b2e25729 BS |
370 | continue; |
371 | ||
372 | /* Assuming canonical form for GIMPLE_COND here, with constant | |
373 | in second position. */ | |
374 | op1 = gimple_cond_rhs (use_stmt); | |
375 | code = gimple_cond_code (use_stmt); | |
376 | use_bb = gimple_bb (use_stmt); | |
377 | ||
378 | extract_true_false_edges_from_block (use_bb, &true_edge, &false_edge); | |
379 | ||
380 | /* We're only interested in comparisons that distinguish | |
381 | unambiguously from zero. */ | |
382 | if (!integer_zerop (op1) || code == LE_EXPR || code == GE_EXPR) | |
383 | continue; | |
384 | ||
385 | if (code == EQ_EXPR) | |
386 | forbidden_bb = false_edge->dest; | |
387 | else | |
388 | forbidden_bb = true_edge->dest; | |
389 | ||
390 | bitmap_set_bit (forbidden_dominators, forbidden_bb->index); | |
391 | } | |
392 | } | |
393 | ||
394 | /* If BB is dominated by any block in the forbidden dominators set, | |
395 | return TRUE; else FALSE. */ | |
396 | ||
397 | static bool | |
398 | dominated_by_forbidden (basic_block bb) | |
399 | { | |
400 | unsigned dom_bb; | |
401 | bitmap_iterator bi; | |
402 | ||
403 | EXECUTE_IF_SET_IN_BITMAP (forbidden_dominators, 1, dom_bb, bi) | |
404 | { | |
06e28de2 DM |
405 | if (dominated_by_p (CDI_DOMINATORS, bb, |
406 | BASIC_BLOCK_FOR_FN (cfun, dom_bb))) | |
b2e25729 BS |
407 | return true; |
408 | } | |
409 | ||
410 | return false; | |
411 | } | |
412 | ||
d5e254e1 IE |
413 | /* For give split point CURRENT and return block RETURN_BB return 1 |
414 | if ssa name VAL is set by split part and 0 otherwise. */ | |
415 | static bool | |
416 | split_part_set_ssa_name_p (tree val, struct split_point *current, | |
417 | basic_block return_bb) | |
418 | { | |
419 | if (TREE_CODE (val) != SSA_NAME) | |
420 | return false; | |
421 | ||
422 | return (!SSA_NAME_IS_DEFAULT_DEF (val) | |
423 | && (bitmap_bit_p (current->split_bbs, | |
424 | gimple_bb (SSA_NAME_DEF_STMT (val))->index) | |
425 | || gimple_bb (SSA_NAME_DEF_STMT (val)) == return_bb)); | |
426 | } | |
427 | ||
3e485f62 JH |
428 | /* We found an split_point CURRENT. NON_SSA_VARS is bitmap of all non ssa |
429 | variables used and RETURN_BB is return basic block. | |
430 | See if we can split function here. */ | |
431 | ||
432 | static void | |
433 | consider_split (struct split_point *current, bitmap non_ssa_vars, | |
434 | basic_block return_bb) | |
435 | { | |
436 | tree parm; | |
437 | unsigned int num_args = 0; | |
438 | unsigned int call_overhead; | |
439 | edge e; | |
440 | edge_iterator ei; | |
538dd0b7 | 441 | gphi_iterator bsi; |
8b3057b3 | 442 | unsigned int i; |
ed7656f6 | 443 | int incoming_freq = 0; |
241a2b9e | 444 | tree retval; |
d5e254e1 | 445 | tree retbnd; |
e70670cf | 446 | bool back_edge = false; |
8b3057b3 | 447 | |
3e485f62 JH |
448 | if (dump_file && (dump_flags & TDF_DETAILS)) |
449 | dump_split_point (dump_file, current); | |
450 | ||
8b3057b3 | 451 | FOR_EACH_EDGE (e, ei, current->entry_bb->preds) |
e70670cf JH |
452 | { |
453 | if (e->flags & EDGE_DFS_BACK) | |
454 | back_edge = true; | |
455 | if (!bitmap_bit_p (current->split_bbs, e->src->index)) | |
456 | incoming_freq += EDGE_FREQUENCY (e); | |
457 | } | |
8b3057b3 | 458 | |
3e485f62 | 459 | /* Do not split when we would end up calling function anyway. */ |
ed7656f6 | 460 | if (incoming_freq |
fefa31b5 | 461 | >= (ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency |
3e485f62 JH |
462 | * PARAM_VALUE (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY) / 100)) |
463 | { | |
e70670cf JH |
464 | /* When profile is guessed, we can not expect it to give us |
465 | realistic estimate on likelyness of function taking the | |
466 | complex path. As a special case, when tail of the function is | |
467 | a loop, enable splitting since inlining code skipping the loop | |
468 | is likely noticeable win. */ | |
469 | if (back_edge | |
0a6a6ac9 | 470 | && profile_status_for_fn (cfun) != PROFILE_READ |
fefa31b5 | 471 | && incoming_freq < ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency) |
e70670cf JH |
472 | { |
473 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
474 | fprintf (dump_file, | |
475 | " Split before loop, accepting despite low frequencies %i %i.\n", | |
476 | incoming_freq, | |
fefa31b5 | 477 | ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency); |
e70670cf JH |
478 | } |
479 | else | |
480 | { | |
481 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
482 | fprintf (dump_file, | |
483 | " Refused: incoming frequency is too large.\n"); | |
484 | return; | |
485 | } | |
3e485f62 JH |
486 | } |
487 | ||
488 | if (!current->header_size) | |
489 | { | |
490 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
491 | fprintf (dump_file, " Refused: header empty\n"); | |
3e485f62 JH |
492 | return; |
493 | } | |
494 | ||
ed7656f6 JJ |
495 | /* Verify that PHI args on entry are either virtual or all their operands |
496 | incoming from header are the same. */ | |
8b3057b3 | 497 | for (bsi = gsi_start_phis (current->entry_bb); !gsi_end_p (bsi); gsi_next (&bsi)) |
3e485f62 | 498 | { |
538dd0b7 | 499 | gphi *stmt = bsi.phi (); |
8b3057b3 JH |
500 | tree val = NULL; |
501 | ||
ea057359 | 502 | if (virtual_operand_p (gimple_phi_result (stmt))) |
8b3057b3 JH |
503 | continue; |
504 | for (i = 0; i < gimple_phi_num_args (stmt); i++) | |
505 | { | |
506 | edge e = gimple_phi_arg_edge (stmt, i); | |
507 | if (!bitmap_bit_p (current->split_bbs, e->src->index)) | |
508 | { | |
509 | tree edge_val = gimple_phi_arg_def (stmt, i); | |
510 | if (val && edge_val != val) | |
511 | { | |
512 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
513 | fprintf (dump_file, | |
514 | " Refused: entry BB has PHI with multiple variants\n"); | |
515 | return; | |
516 | } | |
517 | val = edge_val; | |
518 | } | |
519 | } | |
3e485f62 JH |
520 | } |
521 | ||
522 | ||
523 | /* See what argument we will pass to the split function and compute | |
524 | call overhead. */ | |
525 | call_overhead = eni_size_weights.call_cost; | |
526 | for (parm = DECL_ARGUMENTS (current_function_decl); parm; | |
910ad8de | 527 | parm = DECL_CHAIN (parm)) |
3e485f62 JH |
528 | { |
529 | if (!is_gimple_reg (parm)) | |
530 | { | |
531 | if (bitmap_bit_p (non_ssa_vars, DECL_UID (parm))) | |
532 | { | |
533 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
534 | fprintf (dump_file, | |
535 | " Refused: need to pass non-ssa param values\n"); | |
536 | return; | |
537 | } | |
538 | } | |
32244553 | 539 | else |
3e485f62 | 540 | { |
32244553 RG |
541 | tree ddef = ssa_default_def (cfun, parm); |
542 | if (ddef | |
543 | && bitmap_bit_p (current->ssa_names_to_pass, | |
544 | SSA_NAME_VERSION (ddef))) | |
545 | { | |
546 | if (!VOID_TYPE_P (TREE_TYPE (parm))) | |
b4c9af96 | 547 | call_overhead += estimate_move_cost (TREE_TYPE (parm), false); |
32244553 RG |
548 | num_args++; |
549 | } | |
3e485f62 JH |
550 | } |
551 | } | |
552 | if (!VOID_TYPE_P (TREE_TYPE (current_function_decl))) | |
b4c9af96 RB |
553 | call_overhead += estimate_move_cost (TREE_TYPE (current_function_decl), |
554 | false); | |
3e485f62 JH |
555 | |
556 | if (current->split_size <= call_overhead) | |
557 | { | |
558 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
559 | fprintf (dump_file, | |
560 | " Refused: split size is smaller than call overhead\n"); | |
561 | return; | |
562 | } | |
563 | if (current->header_size + call_overhead | |
564 | >= (unsigned int)(DECL_DECLARED_INLINE_P (current_function_decl) | |
565 | ? MAX_INLINE_INSNS_SINGLE | |
566 | : MAX_INLINE_INSNS_AUTO)) | |
567 | { | |
568 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
569 | fprintf (dump_file, | |
570 | " Refused: header size is too large for inline candidate\n"); | |
571 | return; | |
572 | } | |
573 | ||
7a161d5b JH |
574 | /* Splitting functions brings the target out of comdat group; this will |
575 | lead to code duplication if the function is reused by other unit. | |
576 | Limit this duplication. This is consistent with limit in tree-sra.c | |
577 | FIXME: with LTO we ought to be able to do better! */ | |
578 | if (DECL_ONE_ONLY (current_function_decl) | |
579 | && current->split_size >= (unsigned int) MAX_INLINE_INSNS_AUTO) | |
580 | { | |
581 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
582 | fprintf (dump_file, | |
583 | " Refused: function is COMDAT and tail is too large\n"); | |
584 | return; | |
585 | } | |
586 | /* For comdat functions also reject very small tails; those will likely get | |
587 | inlined back and we do not want to risk the duplication overhead. | |
588 | FIXME: with LTO we ought to be able to do better! */ | |
589 | if (DECL_ONE_ONLY (current_function_decl) | |
590 | && current->split_size | |
591 | <= (unsigned int) PARAM_VALUE (PARAM_EARLY_INLINING_INSNS) / 2) | |
592 | { | |
593 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
594 | fprintf (dump_file, | |
595 | " Refused: function is COMDAT and tail is too small\n"); | |
596 | return; | |
597 | } | |
598 | ||
3e485f62 | 599 | /* FIXME: we currently can pass only SSA function parameters to the split |
d402c33d | 600 | arguments. Once parm_adjustment infrastructure is supported by cloning, |
3e485f62 JH |
601 | we can pass more than that. */ |
602 | if (num_args != bitmap_count_bits (current->ssa_names_to_pass)) | |
603 | { | |
8b3057b3 | 604 | |
3e485f62 JH |
605 | if (dump_file && (dump_flags & TDF_DETAILS)) |
606 | fprintf (dump_file, | |
607 | " Refused: need to pass non-param values\n"); | |
608 | return; | |
609 | } | |
610 | ||
611 | /* When there are non-ssa vars used in the split region, see if they | |
612 | are used in the header region. If so, reject the split. | |
613 | FIXME: we can use nested function support to access both. */ | |
2094f1fc JH |
614 | if (!bitmap_empty_p (non_ssa_vars) |
615 | && !verify_non_ssa_vars (current, non_ssa_vars, return_bb)) | |
3e485f62 | 616 | { |
2094f1fc JH |
617 | if (dump_file && (dump_flags & TDF_DETAILS)) |
618 | fprintf (dump_file, | |
619 | " Refused: split part has non-ssa uses\n"); | |
3e485f62 JH |
620 | return; |
621 | } | |
b2e25729 BS |
622 | |
623 | /* If the split point is dominated by a forbidden block, reject | |
624 | the split. */ | |
625 | if (!bitmap_empty_p (forbidden_dominators) | |
626 | && dominated_by_forbidden (current->entry_bb)) | |
627 | { | |
628 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
629 | fprintf (dump_file, | |
630 | " Refused: split point dominated by forbidden block\n"); | |
631 | return; | |
632 | } | |
633 | ||
241a2b9e JH |
634 | /* See if retval used by return bb is computed by header or split part. |
635 | When it is computed by split part, we need to produce return statement | |
636 | in the split part and add code to header to pass it around. | |
637 | ||
638 | This is bit tricky to test: | |
639 | 1) When there is no return_bb or no return value, we always pass | |
640 | value around. | |
641 | 2) Invariants are always computed by caller. | |
642 | 3) For SSA we need to look if defining statement is in header or split part | |
643 | 4) For non-SSA we need to look where the var is computed. */ | |
644 | retval = find_retval (return_bb); | |
645 | if (!retval) | |
646 | current->split_part_set_retval = true; | |
647 | else if (is_gimple_min_invariant (retval)) | |
648 | current->split_part_set_retval = false; | |
649 | /* Special case is value returned by reference we record as if it was non-ssa | |
650 | set to result_decl. */ | |
651 | else if (TREE_CODE (retval) == SSA_NAME | |
70b5e7dc | 652 | && SSA_NAME_VAR (retval) |
241a2b9e JH |
653 | && TREE_CODE (SSA_NAME_VAR (retval)) == RESULT_DECL |
654 | && DECL_BY_REFERENCE (DECL_RESULT (current_function_decl))) | |
655 | current->split_part_set_retval | |
656 | = bitmap_bit_p (non_ssa_vars, DECL_UID (SSA_NAME_VAR (retval))); | |
657 | else if (TREE_CODE (retval) == SSA_NAME) | |
658 | current->split_part_set_retval | |
d5e254e1 | 659 | = split_part_set_ssa_name_p (retval, current, return_bb); |
241a2b9e JH |
660 | else if (TREE_CODE (retval) == PARM_DECL) |
661 | current->split_part_set_retval = false; | |
662 | else if (TREE_CODE (retval) == VAR_DECL | |
663 | || TREE_CODE (retval) == RESULT_DECL) | |
664 | current->split_part_set_retval | |
665 | = bitmap_bit_p (non_ssa_vars, DECL_UID (retval)); | |
666 | else | |
667 | current->split_part_set_retval = true; | |
668 | ||
d5e254e1 IE |
669 | /* See if retbnd used by return bb is computed by header or split part. */ |
670 | retbnd = find_retbnd (return_bb); | |
671 | if (retbnd) | |
672 | { | |
673 | bool split_part_set_retbnd | |
674 | = split_part_set_ssa_name_p (retbnd, current, return_bb); | |
675 | ||
676 | /* If we have both return value and bounds then keep their definitions | |
677 | in a single function. We use SSA names to link returned bounds and | |
678 | value and therefore do not handle cases when result is passed by | |
679 | reference (which should not be our case anyway since bounds are | |
680 | returned for pointers only). */ | |
681 | if ((DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)) | |
682 | && current->split_part_set_retval) | |
683 | || split_part_set_retbnd != current->split_part_set_retval) | |
684 | { | |
685 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
686 | fprintf (dump_file, | |
687 | " Refused: split point splits return value and bounds\n"); | |
688 | return; | |
689 | } | |
690 | } | |
691 | ||
28fc44f3 JJ |
692 | /* split_function fixes up at most one PHI non-virtual PHI node in return_bb, |
693 | for the return value. If there are other PHIs, give up. */ | |
fefa31b5 | 694 | if (return_bb != EXIT_BLOCK_PTR_FOR_FN (cfun)) |
28fc44f3 | 695 | { |
538dd0b7 | 696 | gphi_iterator psi; |
28fc44f3 JJ |
697 | |
698 | for (psi = gsi_start_phis (return_bb); !gsi_end_p (psi); gsi_next (&psi)) | |
538dd0b7 | 699 | if (!virtual_operand_p (gimple_phi_result (psi.phi ())) |
28fc44f3 JJ |
700 | && !(retval |
701 | && current->split_part_set_retval | |
702 | && TREE_CODE (retval) == SSA_NAME | |
703 | && !DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)) | |
538dd0b7 | 704 | && SSA_NAME_DEF_STMT (retval) == psi.phi ())) |
28fc44f3 JJ |
705 | { |
706 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
707 | fprintf (dump_file, | |
708 | " Refused: return bb has extra PHIs\n"); | |
709 | return; | |
710 | } | |
711 | } | |
712 | ||
713 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
714 | fprintf (dump_file, " Accepted!\n"); | |
715 | ||
3e485f62 JH |
716 | /* At the moment chose split point with lowest frequency and that leaves |
717 | out smallest size of header. | |
718 | In future we might re-consider this heuristics. */ | |
719 | if (!best_split_point.split_bbs | |
720 | || best_split_point.entry_bb->frequency > current->entry_bb->frequency | |
721 | || (best_split_point.entry_bb->frequency == current->entry_bb->frequency | |
722 | && best_split_point.split_size < current->split_size)) | |
723 | ||
724 | { | |
725 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
726 | fprintf (dump_file, " New best split point!\n"); | |
727 | if (best_split_point.ssa_names_to_pass) | |
728 | { | |
729 | BITMAP_FREE (best_split_point.ssa_names_to_pass); | |
730 | BITMAP_FREE (best_split_point.split_bbs); | |
731 | } | |
732 | best_split_point = *current; | |
733 | best_split_point.ssa_names_to_pass = BITMAP_ALLOC (NULL); | |
734 | bitmap_copy (best_split_point.ssa_names_to_pass, | |
735 | current->ssa_names_to_pass); | |
736 | best_split_point.split_bbs = BITMAP_ALLOC (NULL); | |
737 | bitmap_copy (best_split_point.split_bbs, current->split_bbs); | |
738 | } | |
739 | } | |
740 | ||
2094f1fc JH |
741 | /* Return basic block containing RETURN statement. We allow basic blocks |
742 | of the form: | |
743 | <retval> = tmp_var; | |
744 | return <retval> | |
bfd71482 JJ |
745 | but return_bb can not be more complex than this (except for |
746 | -fsanitize=thread we allow TSAN_FUNC_EXIT () internal call in there). | |
6626665f | 747 | If nothing is found, return the exit block. |
2094f1fc | 748 | |
3e485f62 JH |
749 | When there are multiple RETURN statement, chose one with return value, |
750 | since that one is more likely shared by multiple code paths. | |
2094f1fc JH |
751 | |
752 | Return BB is special, because for function splitting it is the only | |
753 | basic block that is duplicated in between header and split part of the | |
754 | function. | |
755 | ||
3e485f62 JH |
756 | TODO: We might support multiple return blocks. */ |
757 | ||
758 | static basic_block | |
759 | find_return_bb (void) | |
760 | { | |
761 | edge e; | |
fefa31b5 | 762 | basic_block return_bb = EXIT_BLOCK_PTR_FOR_FN (cfun); |
68457901 JJ |
763 | gimple_stmt_iterator bsi; |
764 | bool found_return = false; | |
765 | tree retval = NULL_TREE; | |
3e485f62 | 766 | |
fefa31b5 | 767 | if (!single_pred_p (EXIT_BLOCK_PTR_FOR_FN (cfun))) |
68457901 JJ |
768 | return return_bb; |
769 | ||
fefa31b5 | 770 | e = single_pred_edge (EXIT_BLOCK_PTR_FOR_FN (cfun)); |
68457901 JJ |
771 | for (bsi = gsi_last_bb (e->src); !gsi_end_p (bsi); gsi_prev (&bsi)) |
772 | { | |
355fe088 | 773 | gimple *stmt = gsi_stmt (bsi); |
a348dc7f JJ |
774 | if (gimple_code (stmt) == GIMPLE_LABEL |
775 | || is_gimple_debug (stmt) | |
776 | || gimple_clobber_p (stmt)) | |
68457901 JJ |
777 | ; |
778 | else if (gimple_code (stmt) == GIMPLE_ASSIGN | |
779 | && found_return | |
780 | && gimple_assign_single_p (stmt) | |
781 | && (auto_var_in_fn_p (gimple_assign_rhs1 (stmt), | |
782 | current_function_decl) | |
783 | || is_gimple_min_invariant (gimple_assign_rhs1 (stmt))) | |
784 | && retval == gimple_assign_lhs (stmt)) | |
785 | ; | |
538dd0b7 | 786 | else if (greturn *return_stmt = dyn_cast <greturn *> (stmt)) |
68457901 JJ |
787 | { |
788 | found_return = true; | |
538dd0b7 | 789 | retval = gimple_return_retval (return_stmt); |
68457901 | 790 | } |
bfd71482 JJ |
791 | /* For -fsanitize=thread, allow also TSAN_FUNC_EXIT () in the return |
792 | bb. */ | |
793 | else if ((flag_sanitize & SANITIZE_THREAD) | |
794 | && is_gimple_call (stmt) | |
795 | && gimple_call_internal_p (stmt) | |
796 | && gimple_call_internal_fn (stmt) == IFN_TSAN_FUNC_EXIT) | |
797 | ; | |
68457901 JJ |
798 | else |
799 | break; | |
800 | } | |
801 | if (gsi_end_p (bsi) && found_return) | |
802 | return_bb = e->src; | |
3e485f62 | 803 | |
3e485f62 JH |
804 | return return_bb; |
805 | } | |
806 | ||
ed7656f6 | 807 | /* Given return basic block RETURN_BB, see where return value is really |
2094f1fc JH |
808 | stored. */ |
809 | static tree | |
810 | find_retval (basic_block return_bb) | |
811 | { | |
812 | gimple_stmt_iterator bsi; | |
813 | for (bsi = gsi_start_bb (return_bb); !gsi_end_p (bsi); gsi_next (&bsi)) | |
538dd0b7 DM |
814 | if (greturn *return_stmt = dyn_cast <greturn *> (gsi_stmt (bsi))) |
815 | return gimple_return_retval (return_stmt); | |
a348dc7f JJ |
816 | else if (gimple_code (gsi_stmt (bsi)) == GIMPLE_ASSIGN |
817 | && !gimple_clobber_p (gsi_stmt (bsi))) | |
2094f1fc JH |
818 | return gimple_assign_rhs1 (gsi_stmt (bsi)); |
819 | return NULL; | |
820 | } | |
821 | ||
d5e254e1 IE |
822 | /* Given return basic block RETURN_BB, see where return bounds are really |
823 | stored. */ | |
824 | static tree | |
825 | find_retbnd (basic_block return_bb) | |
826 | { | |
827 | gimple_stmt_iterator bsi; | |
828 | for (bsi = gsi_last_bb (return_bb); !gsi_end_p (bsi); gsi_prev (&bsi)) | |
829 | if (gimple_code (gsi_stmt (bsi)) == GIMPLE_RETURN) | |
830 | return gimple_return_retbnd (gsi_stmt (bsi)); | |
831 | return NULL; | |
832 | } | |
833 | ||
1802378d EB |
834 | /* Callback for walk_stmt_load_store_addr_ops. If T is non-SSA automatic |
835 | variable, mark it as used in bitmap passed via DATA. | |
3e485f62 JH |
836 | Return true when access to T prevents splitting the function. */ |
837 | ||
838 | static bool | |
355fe088 | 839 | mark_nonssa_use (gimple *, tree t, tree, void *data) |
3e485f62 JH |
840 | { |
841 | t = get_base_address (t); | |
842 | ||
843 | if (!t || is_gimple_reg (t)) | |
844 | return false; | |
845 | ||
846 | /* At present we can't pass non-SSA arguments to split function. | |
847 | FIXME: this can be relaxed by passing references to arguments. */ | |
848 | if (TREE_CODE (t) == PARM_DECL) | |
849 | { | |
850 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1802378d EB |
851 | fprintf (dump_file, |
852 | "Cannot split: use of non-ssa function parameter.\n"); | |
3e485f62 JH |
853 | return true; |
854 | } | |
855 | ||
1802378d EB |
856 | if ((TREE_CODE (t) == VAR_DECL |
857 | && auto_var_in_fn_p (t, current_function_decl)) | |
858 | || TREE_CODE (t) == RESULT_DECL | |
412c4af7 JH |
859 | || (TREE_CODE (t) == LABEL_DECL |
860 | && FORCED_LABEL (t))) | |
3e485f62 | 861 | bitmap_set_bit ((bitmap)data, DECL_UID (t)); |
241a2b9e | 862 | |
1802378d EB |
863 | /* For DECL_BY_REFERENCE, the return value is actually a pointer. We want |
864 | to pretend that the value pointed to is actual result decl. */ | |
865 | if ((TREE_CODE (t) == MEM_REF || INDIRECT_REF_P (t)) | |
241a2b9e | 866 | && TREE_CODE (TREE_OPERAND (t, 0)) == SSA_NAME |
70b5e7dc | 867 | && SSA_NAME_VAR (TREE_OPERAND (t, 0)) |
241a2b9e JH |
868 | && TREE_CODE (SSA_NAME_VAR (TREE_OPERAND (t, 0))) == RESULT_DECL |
869 | && DECL_BY_REFERENCE (DECL_RESULT (current_function_decl))) | |
1802378d EB |
870 | return |
871 | bitmap_bit_p ((bitmap)data, | |
872 | DECL_UID (DECL_RESULT (current_function_decl))); | |
873 | ||
3e485f62 JH |
874 | return false; |
875 | } | |
876 | ||
877 | /* Compute local properties of basic block BB we collect when looking for | |
878 | split points. We look for ssa defs and store them in SET_SSA_NAMES, | |
879 | for ssa uses and store them in USED_SSA_NAMES and for any non-SSA automatic | |
880 | vars stored in NON_SSA_VARS. | |
881 | ||
882 | When BB has edge to RETURN_BB, collect uses in RETURN_BB too. | |
883 | ||
884 | Return false when BB contains something that prevents it from being put into | |
885 | split function. */ | |
886 | ||
887 | static bool | |
888 | visit_bb (basic_block bb, basic_block return_bb, | |
889 | bitmap set_ssa_names, bitmap used_ssa_names, | |
890 | bitmap non_ssa_vars) | |
891 | { | |
3e485f62 JH |
892 | edge e; |
893 | edge_iterator ei; | |
894 | bool can_split = true; | |
895 | ||
538dd0b7 DM |
896 | for (gimple_stmt_iterator bsi = gsi_start_bb (bb); !gsi_end_p (bsi); |
897 | gsi_next (&bsi)) | |
3e485f62 | 898 | { |
355fe088 | 899 | gimple *stmt = gsi_stmt (bsi); |
3e485f62 JH |
900 | tree op; |
901 | ssa_op_iter iter; | |
902 | tree decl; | |
903 | ||
904 | if (is_gimple_debug (stmt)) | |
905 | continue; | |
906 | ||
a348dc7f JJ |
907 | if (gimple_clobber_p (stmt)) |
908 | continue; | |
909 | ||
3e485f62 JH |
910 | /* FIXME: We can split regions containing EH. We can not however |
911 | split RESX, EH_DISPATCH and EH_POINTER referring to same region | |
912 | into different partitions. This would require tracking of | |
913 | EH regions and checking in consider_split_point if they | |
914 | are not used elsewhere. */ | |
1da7d8c0 | 915 | if (gimple_code (stmt) == GIMPLE_RESX) |
3e485f62 JH |
916 | { |
917 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1da7d8c0 | 918 | fprintf (dump_file, "Cannot split: resx.\n"); |
3e485f62 JH |
919 | can_split = false; |
920 | } | |
921 | if (gimple_code (stmt) == GIMPLE_EH_DISPATCH) | |
922 | { | |
923 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1802378d | 924 | fprintf (dump_file, "Cannot split: eh dispatch.\n"); |
3e485f62 JH |
925 | can_split = false; |
926 | } | |
927 | ||
928 | /* Check builtins that prevent splitting. */ | |
929 | if (gimple_code (stmt) == GIMPLE_CALL | |
930 | && (decl = gimple_call_fndecl (stmt)) != NULL_TREE | |
931 | && DECL_BUILT_IN (decl) | |
932 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL) | |
933 | switch (DECL_FUNCTION_CODE (decl)) | |
934 | { | |
935 | /* FIXME: once we will allow passing non-parm values to split part, | |
936 | we need to be sure to handle correct builtin_stack_save and | |
937 | builtin_stack_restore. At the moment we are safe; there is no | |
938 | way to store builtin_stack_save result in non-SSA variable | |
939 | since all calls to those are compiler generated. */ | |
940 | case BUILT_IN_APPLY: | |
61e03ffc | 941 | case BUILT_IN_APPLY_ARGS: |
3e485f62 JH |
942 | case BUILT_IN_VA_START: |
943 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1802378d EB |
944 | fprintf (dump_file, |
945 | "Cannot split: builtin_apply and va_start.\n"); | |
3e485f62 JH |
946 | can_split = false; |
947 | break; | |
948 | case BUILT_IN_EH_POINTER: | |
949 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1802378d | 950 | fprintf (dump_file, "Cannot split: builtin_eh_pointer.\n"); |
3e485f62 JH |
951 | can_split = false; |
952 | break; | |
953 | default: | |
954 | break; | |
955 | } | |
956 | ||
957 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_DEF) | |
958 | bitmap_set_bit (set_ssa_names, SSA_NAME_VERSION (op)); | |
959 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_USE) | |
960 | bitmap_set_bit (used_ssa_names, SSA_NAME_VERSION (op)); | |
961 | can_split &= !walk_stmt_load_store_addr_ops (stmt, non_ssa_vars, | |
962 | mark_nonssa_use, | |
963 | mark_nonssa_use, | |
964 | mark_nonssa_use); | |
965 | } | |
538dd0b7 DM |
966 | for (gphi_iterator bsi = gsi_start_phis (bb); !gsi_end_p (bsi); |
967 | gsi_next (&bsi)) | |
3e485f62 | 968 | { |
538dd0b7 | 969 | gphi *stmt = bsi.phi (); |
8b3057b3 | 970 | unsigned int i; |
3e485f62 | 971 | |
ea057359 | 972 | if (virtual_operand_p (gimple_phi_result (stmt))) |
3e485f62 | 973 | continue; |
8b3057b3 JH |
974 | bitmap_set_bit (set_ssa_names, |
975 | SSA_NAME_VERSION (gimple_phi_result (stmt))); | |
976 | for (i = 0; i < gimple_phi_num_args (stmt); i++) | |
977 | { | |
978 | tree op = gimple_phi_arg_def (stmt, i); | |
979 | if (TREE_CODE (op) == SSA_NAME) | |
980 | bitmap_set_bit (used_ssa_names, SSA_NAME_VERSION (op)); | |
981 | } | |
3e485f62 JH |
982 | can_split &= !walk_stmt_load_store_addr_ops (stmt, non_ssa_vars, |
983 | mark_nonssa_use, | |
984 | mark_nonssa_use, | |
985 | mark_nonssa_use); | |
986 | } | |
ed7656f6 | 987 | /* Record also uses coming from PHI operand in return BB. */ |
3e485f62 JH |
988 | FOR_EACH_EDGE (e, ei, bb->succs) |
989 | if (e->dest == return_bb) | |
990 | { | |
538dd0b7 DM |
991 | for (gphi_iterator bsi = gsi_start_phis (return_bb); |
992 | !gsi_end_p (bsi); | |
993 | gsi_next (&bsi)) | |
3e485f62 | 994 | { |
538dd0b7 | 995 | gphi *stmt = bsi.phi (); |
3e485f62 JH |
996 | tree op = gimple_phi_arg_def (stmt, e->dest_idx); |
997 | ||
ea057359 | 998 | if (virtual_operand_p (gimple_phi_result (stmt))) |
3e485f62 | 999 | continue; |
3e485f62 JH |
1000 | if (TREE_CODE (op) == SSA_NAME) |
1001 | bitmap_set_bit (used_ssa_names, SSA_NAME_VERSION (op)); | |
1002 | else | |
9f1363cd | 1003 | can_split &= !mark_nonssa_use (stmt, op, op, non_ssa_vars); |
3e485f62 | 1004 | } |
3e485f62 JH |
1005 | } |
1006 | return can_split; | |
1007 | } | |
1008 | ||
1009 | /* Stack entry for recursive DFS walk in find_split_point. */ | |
1010 | ||
50686850 | 1011 | struct stack_entry |
3e485f62 JH |
1012 | { |
1013 | /* Basic block we are examining. */ | |
1014 | basic_block bb; | |
1015 | ||
1016 | /* SSA names set and used by the BB and all BBs reachable | |
1017 | from it via DFS walk. */ | |
1018 | bitmap set_ssa_names, used_ssa_names; | |
1019 | bitmap non_ssa_vars; | |
1020 | ||
1021 | /* All BBS visited from this BB via DFS walk. */ | |
1022 | bitmap bbs_visited; | |
1023 | ||
1024 | /* Last examined edge in DFS walk. Since we walk unoriented graph, | |
ed7656f6 | 1025 | the value is up to sum of incoming and outgoing edges of BB. */ |
3e485f62 JH |
1026 | unsigned int edge_num; |
1027 | ||
1028 | /* Stack entry index of earliest BB reachable from current BB | |
ed7656f6 | 1029 | or any BB visited later in DFS walk. */ |
3e485f62 JH |
1030 | int earliest; |
1031 | ||
1032 | /* Overall time and size of all BBs reached from this BB in DFS walk. */ | |
1033 | int overall_time, overall_size; | |
1034 | ||
1035 | /* When false we can not split on this BB. */ | |
1036 | bool can_split; | |
50686850 | 1037 | }; |
3e485f62 JH |
1038 | |
1039 | ||
1040 | /* Find all articulations and call consider_split on them. | |
1041 | OVERALL_TIME and OVERALL_SIZE is time and size of the function. | |
1042 | ||
1043 | We perform basic algorithm for finding an articulation in a graph | |
1044 | created from CFG by considering it to be an unoriented graph. | |
1045 | ||
1046 | The articulation is discovered via DFS walk. We collect earliest | |
1047 | basic block on stack that is reachable via backward edge. Articulation | |
1048 | is any basic block such that there is no backward edge bypassing it. | |
1049 | To reduce stack usage we maintain heap allocated stack in STACK vector. | |
1050 | AUX pointer of BB is set to index it appears in the stack or -1 once | |
1051 | it is visited and popped off the stack. | |
1052 | ||
1053 | The algorithm finds articulation after visiting the whole component | |
1054 | reachable by it. This makes it convenient to collect information about | |
1055 | the component used by consider_split. */ | |
1056 | ||
1057 | static void | |
bfd71482 | 1058 | find_split_points (basic_block return_bb, int overall_time, int overall_size) |
3e485f62 JH |
1059 | { |
1060 | stack_entry first; | |
6e1aa848 | 1061 | vec<stack_entry> stack = vNULL; |
3e485f62 | 1062 | basic_block bb; |
3e485f62 JH |
1063 | struct split_point current; |
1064 | ||
1065 | current.header_time = overall_time; | |
1066 | current.header_size = overall_size; | |
1067 | current.split_time = 0; | |
1068 | current.split_size = 0; | |
1069 | current.ssa_names_to_pass = BITMAP_ALLOC (NULL); | |
1070 | ||
fefa31b5 | 1071 | first.bb = ENTRY_BLOCK_PTR_FOR_FN (cfun); |
3e485f62 JH |
1072 | first.edge_num = 0; |
1073 | first.overall_time = 0; | |
1074 | first.overall_size = 0; | |
1075 | first.earliest = INT_MAX; | |
1076 | first.set_ssa_names = 0; | |
1077 | first.used_ssa_names = 0; | |
e15eb172 | 1078 | first.non_ssa_vars = 0; |
3e485f62 | 1079 | first.bbs_visited = 0; |
e15eb172 | 1080 | first.can_split = false; |
9771b263 | 1081 | stack.safe_push (first); |
fefa31b5 | 1082 | ENTRY_BLOCK_PTR_FOR_FN (cfun)->aux = (void *)(intptr_t)-1; |
3e485f62 | 1083 | |
9771b263 | 1084 | while (!stack.is_empty ()) |
3e485f62 | 1085 | { |
9771b263 | 1086 | stack_entry *entry = &stack.last (); |
3e485f62 JH |
1087 | |
1088 | /* We are walking an acyclic graph, so edge_num counts | |
1089 | succ and pred edges together. However when considering | |
1090 | articulation, we want to have processed everything reachable | |
1091 | from articulation but nothing that reaches into it. */ | |
1092 | if (entry->edge_num == EDGE_COUNT (entry->bb->succs) | |
fefa31b5 | 1093 | && entry->bb != ENTRY_BLOCK_PTR_FOR_FN (cfun)) |
3e485f62 | 1094 | { |
9771b263 | 1095 | int pos = stack.length (); |
3e485f62 JH |
1096 | entry->can_split &= visit_bb (entry->bb, return_bb, |
1097 | entry->set_ssa_names, | |
1098 | entry->used_ssa_names, | |
1099 | entry->non_ssa_vars); | |
1100 | if (pos <= entry->earliest && !entry->can_split | |
1101 | && dump_file && (dump_flags & TDF_DETAILS)) | |
1102 | fprintf (dump_file, | |
1103 | "found articulation at bb %i but can not split\n", | |
1104 | entry->bb->index); | |
1105 | if (pos <= entry->earliest && entry->can_split) | |
1106 | { | |
1107 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1108 | fprintf (dump_file, "found articulation at bb %i\n", | |
1109 | entry->bb->index); | |
1110 | current.entry_bb = entry->bb; | |
1111 | current.ssa_names_to_pass = BITMAP_ALLOC (NULL); | |
1112 | bitmap_and_compl (current.ssa_names_to_pass, | |
1113 | entry->used_ssa_names, entry->set_ssa_names); | |
1114 | current.header_time = overall_time - entry->overall_time; | |
1115 | current.header_size = overall_size - entry->overall_size; | |
1116 | current.split_time = entry->overall_time; | |
1117 | current.split_size = entry->overall_size; | |
1118 | current.split_bbs = entry->bbs_visited; | |
1119 | consider_split (¤t, entry->non_ssa_vars, return_bb); | |
1120 | BITMAP_FREE (current.ssa_names_to_pass); | |
1121 | } | |
1122 | } | |
1123 | /* Do actual DFS walk. */ | |
1124 | if (entry->edge_num | |
1125 | < (EDGE_COUNT (entry->bb->succs) | |
1126 | + EDGE_COUNT (entry->bb->preds))) | |
1127 | { | |
1128 | edge e; | |
1129 | basic_block dest; | |
1130 | if (entry->edge_num < EDGE_COUNT (entry->bb->succs)) | |
1131 | { | |
1132 | e = EDGE_SUCC (entry->bb, entry->edge_num); | |
1133 | dest = e->dest; | |
1134 | } | |
1135 | else | |
1136 | { | |
1137 | e = EDGE_PRED (entry->bb, entry->edge_num | |
1138 | - EDGE_COUNT (entry->bb->succs)); | |
1139 | dest = e->src; | |
1140 | } | |
1141 | ||
1142 | entry->edge_num++; | |
1143 | ||
1144 | /* New BB to visit, push it to the stack. */ | |
fefa31b5 | 1145 | if (dest != return_bb && dest != EXIT_BLOCK_PTR_FOR_FN (cfun) |
3e485f62 JH |
1146 | && !dest->aux) |
1147 | { | |
1148 | stack_entry new_entry; | |
1149 | ||
1150 | new_entry.bb = dest; | |
1151 | new_entry.edge_num = 0; | |
1152 | new_entry.overall_time | |
9771b263 | 1153 | = bb_info_vec[dest->index].time; |
3e485f62 | 1154 | new_entry.overall_size |
9771b263 | 1155 | = bb_info_vec[dest->index].size; |
3e485f62 JH |
1156 | new_entry.earliest = INT_MAX; |
1157 | new_entry.set_ssa_names = BITMAP_ALLOC (NULL); | |
1158 | new_entry.used_ssa_names = BITMAP_ALLOC (NULL); | |
1159 | new_entry.bbs_visited = BITMAP_ALLOC (NULL); | |
1160 | new_entry.non_ssa_vars = BITMAP_ALLOC (NULL); | |
1161 | new_entry.can_split = true; | |
1162 | bitmap_set_bit (new_entry.bbs_visited, dest->index); | |
9771b263 DN |
1163 | stack.safe_push (new_entry); |
1164 | dest->aux = (void *)(intptr_t)stack.length (); | |
3e485f62 JH |
1165 | } |
1166 | /* Back edge found, record the earliest point. */ | |
1167 | else if ((intptr_t)dest->aux > 0 | |
1168 | && (intptr_t)dest->aux < entry->earliest) | |
1169 | entry->earliest = (intptr_t)dest->aux; | |
1170 | } | |
ed7656f6 JJ |
1171 | /* We are done with examining the edges. Pop off the value from stack |
1172 | and merge stuff we accumulate during the walk. */ | |
fefa31b5 | 1173 | else if (entry->bb != ENTRY_BLOCK_PTR_FOR_FN (cfun)) |
3e485f62 | 1174 | { |
9771b263 | 1175 | stack_entry *prev = &stack[stack.length () - 2]; |
3e485f62 JH |
1176 | |
1177 | entry->bb->aux = (void *)(intptr_t)-1; | |
1178 | prev->can_split &= entry->can_split; | |
1179 | if (prev->set_ssa_names) | |
1180 | { | |
1181 | bitmap_ior_into (prev->set_ssa_names, entry->set_ssa_names); | |
1182 | bitmap_ior_into (prev->used_ssa_names, entry->used_ssa_names); | |
1183 | bitmap_ior_into (prev->bbs_visited, entry->bbs_visited); | |
1184 | bitmap_ior_into (prev->non_ssa_vars, entry->non_ssa_vars); | |
1185 | } | |
1186 | if (prev->earliest > entry->earliest) | |
1187 | prev->earliest = entry->earliest; | |
1188 | prev->overall_time += entry->overall_time; | |
1189 | prev->overall_size += entry->overall_size; | |
1190 | BITMAP_FREE (entry->set_ssa_names); | |
1191 | BITMAP_FREE (entry->used_ssa_names); | |
1192 | BITMAP_FREE (entry->bbs_visited); | |
1193 | BITMAP_FREE (entry->non_ssa_vars); | |
9771b263 | 1194 | stack.pop (); |
3e485f62 JH |
1195 | } |
1196 | else | |
9771b263 | 1197 | stack.pop (); |
3e485f62 | 1198 | } |
fefa31b5 | 1199 | ENTRY_BLOCK_PTR_FOR_FN (cfun)->aux = NULL; |
11cd3bed | 1200 | FOR_EACH_BB_FN (bb, cfun) |
3e485f62 | 1201 | bb->aux = NULL; |
9771b263 | 1202 | stack.release (); |
3e485f62 JH |
1203 | BITMAP_FREE (current.ssa_names_to_pass); |
1204 | } | |
1205 | ||
1206 | /* Split function at SPLIT_POINT. */ | |
1207 | ||
1208 | static void | |
bfd71482 JJ |
1209 | split_function (basic_block return_bb, struct split_point *split_point, |
1210 | bool add_tsan_func_exit) | |
3e485f62 | 1211 | { |
6e1aa848 | 1212 | vec<tree> args_to_pass = vNULL; |
201176d3 | 1213 | bitmap args_to_skip; |
3e485f62 JH |
1214 | tree parm; |
1215 | int num = 0; | |
d52f5295 | 1216 | cgraph_node *node, *cur_node = cgraph_node::get (current_function_decl); |
3e485f62 | 1217 | basic_block call_bb; |
bfd71482 | 1218 | gcall *call, *tsan_func_exit_call = NULL; |
3e485f62 JH |
1219 | edge e; |
1220 | edge_iterator ei; | |
d5e254e1 | 1221 | tree retval = NULL, real_retval = NULL, retbnd = NULL; |
3e485f62 | 1222 | bool split_part_return_p = false; |
d5e254e1 | 1223 | bool with_bounds = chkp_function_instrumented_p (current_function_decl); |
355fe088 | 1224 | gimple *last_stmt = NULL; |
371556ee | 1225 | unsigned int i; |
32244553 | 1226 | tree arg, ddef; |
9771b263 | 1227 | vec<tree, va_gc> **debug_args = NULL; |
3e485f62 JH |
1228 | |
1229 | if (dump_file) | |
1230 | { | |
1231 | fprintf (dump_file, "\n\nSplitting function at:\n"); | |
1232 | dump_split_point (dump_file, split_point); | |
1233 | } | |
1234 | ||
201176d3 MJ |
1235 | if (cur_node->local.can_change_signature) |
1236 | args_to_skip = BITMAP_ALLOC (NULL); | |
1237 | else | |
1238 | args_to_skip = NULL; | |
1239 | ||
3e485f62 JH |
1240 | /* Collect the parameters of new function and args_to_skip bitmap. */ |
1241 | for (parm = DECL_ARGUMENTS (current_function_decl); | |
910ad8de | 1242 | parm; parm = DECL_CHAIN (parm), num++) |
201176d3 MJ |
1243 | if (args_to_skip |
1244 | && (!is_gimple_reg (parm) | |
32244553 | 1245 | || (ddef = ssa_default_def (cfun, parm)) == NULL_TREE |
201176d3 | 1246 | || !bitmap_bit_p (split_point->ssa_names_to_pass, |
32244553 | 1247 | SSA_NAME_VERSION (ddef)))) |
3e485f62 JH |
1248 | bitmap_set_bit (args_to_skip, num); |
1249 | else | |
371556ee | 1250 | { |
86814190 MJ |
1251 | /* This parm might not have been used up to now, but is going to be |
1252 | used, hence register it. */ | |
86814190 | 1253 | if (is_gimple_reg (parm)) |
32244553 | 1254 | arg = get_or_create_ssa_default_def (cfun, parm); |
86814190 MJ |
1255 | else |
1256 | arg = parm; | |
201176d3 | 1257 | |
2b3c0885 RG |
1258 | if (!useless_type_conversion_p (DECL_ARG_TYPE (parm), TREE_TYPE (arg))) |
1259 | arg = fold_convert (DECL_ARG_TYPE (parm), arg); | |
9771b263 | 1260 | args_to_pass.safe_push (arg); |
371556ee | 1261 | } |
3e485f62 JH |
1262 | |
1263 | /* See if the split function will return. */ | |
1264 | FOR_EACH_EDGE (e, ei, return_bb->preds) | |
1265 | if (bitmap_bit_p (split_point->split_bbs, e->src->index)) | |
1266 | break; | |
1267 | if (e) | |
1268 | split_part_return_p = true; | |
1269 | ||
241a2b9e JH |
1270 | /* Add return block to what will become the split function. |
1271 | We do not return; no return block is needed. */ | |
1272 | if (!split_part_return_p) | |
1273 | ; | |
1274 | /* We have no return block, so nothing is needed. */ | |
fefa31b5 | 1275 | else if (return_bb == EXIT_BLOCK_PTR_FOR_FN (cfun)) |
241a2b9e JH |
1276 | ; |
1277 | /* When we do not want to return value, we need to construct | |
1278 | new return block with empty return statement. | |
1279 | FIXME: Once we are able to change return type, we should change function | |
1280 | to return void instead of just outputting function with undefined return | |
1281 | value. For structures this affects quality of codegen. */ | |
1282 | else if (!split_point->split_part_set_retval | |
1283 | && find_retval (return_bb)) | |
1284 | { | |
1285 | bool redirected = true; | |
1286 | basic_block new_return_bb = create_basic_block (NULL, 0, return_bb); | |
1287 | gimple_stmt_iterator gsi = gsi_start_bb (new_return_bb); | |
1288 | gsi_insert_after (&gsi, gimple_build_return (NULL), GSI_NEW_STMT); | |
1289 | while (redirected) | |
1290 | { | |
1291 | redirected = false; | |
1292 | FOR_EACH_EDGE (e, ei, return_bb->preds) | |
1293 | if (bitmap_bit_p (split_point->split_bbs, e->src->index)) | |
1294 | { | |
1295 | new_return_bb->count += e->count; | |
1296 | new_return_bb->frequency += EDGE_FREQUENCY (e); | |
1297 | redirect_edge_and_branch (e, new_return_bb); | |
1298 | redirected = true; | |
1299 | break; | |
1300 | } | |
1301 | } | |
fefa31b5 | 1302 | e = make_edge (new_return_bb, EXIT_BLOCK_PTR_FOR_FN (cfun), 0); |
241a2b9e JH |
1303 | e->probability = REG_BR_PROB_BASE; |
1304 | e->count = new_return_bb->count; | |
726338f4 | 1305 | add_bb_to_loop (new_return_bb, current_loops->tree_root); |
241a2b9e | 1306 | bitmap_set_bit (split_point->split_bbs, new_return_bb->index); |
2e5e346d JL |
1307 | } |
1308 | /* When we pass around the value, use existing return block. */ | |
1309 | else | |
1310 | bitmap_set_bit (split_point->split_bbs, return_bb->index); | |
1311 | ||
1312 | /* If RETURN_BB has virtual operand PHIs, they must be removed and the | |
1313 | virtual operand marked for renaming as we change the CFG in a way that | |
cfef45c8 | 1314 | tree-inline is not able to compensate for. |
2e5e346d JL |
1315 | |
1316 | Note this can happen whether or not we have a return value. If we have | |
1317 | a return value, then RETURN_BB may have PHIs for real operands too. */ | |
fefa31b5 | 1318 | if (return_bb != EXIT_BLOCK_PTR_FOR_FN (cfun)) |
2e5e346d | 1319 | { |
cfef45c8 | 1320 | bool phi_p = false; |
538dd0b7 DM |
1321 | for (gphi_iterator gsi = gsi_start_phis (return_bb); |
1322 | !gsi_end_p (gsi);) | |
241a2b9e | 1323 | { |
538dd0b7 | 1324 | gphi *stmt = gsi.phi (); |
ea057359 | 1325 | if (!virtual_operand_p (gimple_phi_result (stmt))) |
2e5e346d JL |
1326 | { |
1327 | gsi_next (&gsi); | |
1328 | continue; | |
1329 | } | |
6b8c9df8 RG |
1330 | mark_virtual_phi_result_for_renaming (stmt); |
1331 | remove_phi_node (&gsi, true); | |
cfef45c8 | 1332 | phi_p = true; |
241a2b9e | 1333 | } |
cfef45c8 RG |
1334 | /* In reality we have to rename the reaching definition of the |
1335 | virtual operand at return_bb as we will eventually release it | |
1336 | when we remove the code region we outlined. | |
1337 | So we have to rename all immediate virtual uses of that region | |
1338 | if we didn't see a PHI definition yet. */ | |
1339 | /* ??? In real reality we want to set the reaching vdef of the | |
1340 | entry of the SESE region as the vuse of the call and the reaching | |
1341 | vdef of the exit of the SESE region as the vdef of the call. */ | |
1342 | if (!phi_p) | |
538dd0b7 DM |
1343 | for (gimple_stmt_iterator gsi = gsi_start_bb (return_bb); |
1344 | !gsi_end_p (gsi); | |
1345 | gsi_next (&gsi)) | |
cfef45c8 | 1346 | { |
355fe088 | 1347 | gimple *stmt = gsi_stmt (gsi); |
cfef45c8 RG |
1348 | if (gimple_vuse (stmt)) |
1349 | { | |
1350 | gimple_set_vuse (stmt, NULL_TREE); | |
1351 | update_stmt (stmt); | |
1352 | } | |
1353 | if (gimple_vdef (stmt)) | |
1354 | break; | |
1355 | } | |
241a2b9e | 1356 | } |
3e485f62 JH |
1357 | |
1358 | /* Now create the actual clone. */ | |
3dafb85c | 1359 | cgraph_edge::rebuild_edges (); |
d52f5295 ML |
1360 | node = cur_node->create_version_clone_with_body |
1361 | (vNULL, NULL, args_to_skip, !split_part_return_p, split_point->split_bbs, | |
1362 | split_point->entry_bb, "part"); | |
9cec31f4 | 1363 | |
41f669d8 JH |
1364 | node->split_part = true; |
1365 | ||
9cec31f4 ML |
1366 | /* Let's take a time profile for splitted function. */ |
1367 | node->tp_first_run = cur_node->tp_first_run + 1; | |
1368 | ||
d402c33d JH |
1369 | /* For usual cloning it is enough to clear builtin only when signature |
1370 | changes. For partial inlining we however can not expect the part | |
1371 | of builtin implementation to have same semantic as the whole. */ | |
67348ccc | 1372 | if (DECL_BUILT_IN (node->decl)) |
d402c33d | 1373 | { |
67348ccc DM |
1374 | DECL_BUILT_IN_CLASS (node->decl) = NOT_BUILT_IN; |
1375 | DECL_FUNCTION_CODE (node->decl) = (enum built_in_function) 0; | |
d402c33d | 1376 | } |
d5e254e1 IE |
1377 | |
1378 | /* If the original function is instrumented then it's | |
1379 | part is also instrumented. */ | |
1380 | if (with_bounds) | |
1381 | chkp_function_mark_instrumented (node->decl); | |
1382 | ||
9a6af450 EB |
1383 | /* If the original function is declared inline, there is no point in issuing |
1384 | a warning for the non-inlinable part. */ | |
67348ccc | 1385 | DECL_NO_INLINE_WARNING_P (node->decl) = 1; |
d52f5295 | 1386 | cur_node->remove_callees (); |
d122681a | 1387 | cur_node->remove_all_references (); |
3e485f62 | 1388 | if (!split_part_return_p) |
67348ccc | 1389 | TREE_THIS_VOLATILE (node->decl) = 1; |
3e485f62 | 1390 | if (dump_file) |
67348ccc | 1391 | dump_function_to_file (node->decl, dump_file, dump_flags); |
3e485f62 JH |
1392 | |
1393 | /* Create the basic block we place call into. It is the entry basic block | |
1394 | split after last label. */ | |
1395 | call_bb = split_point->entry_bb; | |
538dd0b7 | 1396 | for (gimple_stmt_iterator gsi = gsi_start_bb (call_bb); !gsi_end_p (gsi);) |
3e485f62 JH |
1397 | if (gimple_code (gsi_stmt (gsi)) == GIMPLE_LABEL) |
1398 | { | |
1399 | last_stmt = gsi_stmt (gsi); | |
1400 | gsi_next (&gsi); | |
1401 | } | |
1402 | else | |
1403 | break; | |
1404 | e = split_block (split_point->entry_bb, last_stmt); | |
1405 | remove_edge (e); | |
1406 | ||
1407 | /* Produce the call statement. */ | |
538dd0b7 | 1408 | gimple_stmt_iterator gsi = gsi_last_bb (call_bb); |
9771b263 | 1409 | FOR_EACH_VEC_ELT (args_to_pass, i, arg) |
2b3c0885 RG |
1410 | if (!is_gimple_val (arg)) |
1411 | { | |
1412 | arg = force_gimple_operand_gsi (&gsi, arg, true, NULL_TREE, | |
f6e52e91 | 1413 | false, GSI_CONTINUE_LINKING); |
9771b263 | 1414 | args_to_pass[i] = arg; |
2b3c0885 | 1415 | } |
67348ccc | 1416 | call = gimple_build_call_vec (node->decl, args_to_pass); |
d5e254e1 | 1417 | gimple_call_set_with_bounds (call, with_bounds); |
3e485f62 | 1418 | gimple_set_block (call, DECL_INITIAL (current_function_decl)); |
9771b263 | 1419 | args_to_pass.release (); |
3e485f62 | 1420 | |
878eef4a JJ |
1421 | /* For optimized away parameters, add on the caller side |
1422 | before the call | |
1423 | DEBUG D#X => parm_Y(D) | |
1424 | stmts and associate D#X with parm in decl_debug_args_lookup | |
1425 | vector to say for debug info that if parameter parm had been passed, | |
1426 | it would have value parm_Y(D). */ | |
1427 | if (args_to_skip) | |
1428 | for (parm = DECL_ARGUMENTS (current_function_decl), num = 0; | |
1429 | parm; parm = DECL_CHAIN (parm), num++) | |
1430 | if (bitmap_bit_p (args_to_skip, num) | |
1431 | && is_gimple_reg (parm)) | |
1432 | { | |
1433 | tree ddecl; | |
355fe088 | 1434 | gimple *def_temp; |
878eef4a JJ |
1435 | |
1436 | /* This needs to be done even without MAY_HAVE_DEBUG_STMTS, | |
1437 | otherwise if it didn't exist before, we'd end up with | |
1438 | different SSA_NAME_VERSIONs between -g and -g0. */ | |
1439 | arg = get_or_create_ssa_default_def (cfun, parm); | |
1440 | if (!MAY_HAVE_DEBUG_STMTS) | |
1441 | continue; | |
1442 | ||
1443 | if (debug_args == NULL) | |
67348ccc | 1444 | debug_args = decl_debug_args_insert (node->decl); |
878eef4a JJ |
1445 | ddecl = make_node (DEBUG_EXPR_DECL); |
1446 | DECL_ARTIFICIAL (ddecl) = 1; | |
1447 | TREE_TYPE (ddecl) = TREE_TYPE (parm); | |
1448 | DECL_MODE (ddecl) = DECL_MODE (parm); | |
9771b263 DN |
1449 | vec_safe_push (*debug_args, DECL_ORIGIN (parm)); |
1450 | vec_safe_push (*debug_args, ddecl); | |
878eef4a JJ |
1451 | def_temp = gimple_build_debug_bind (ddecl, unshare_expr (arg), |
1452 | call); | |
1453 | gsi_insert_after (&gsi, def_temp, GSI_NEW_STMT); | |
1454 | } | |
1455 | /* And on the callee side, add | |
1456 | DEBUG D#Y s=> parm | |
1457 | DEBUG var => D#Y | |
1458 | stmts to the first bb where var is a VAR_DECL created for the | |
1459 | optimized away parameter in DECL_INITIAL block. This hints | |
1460 | in the debug info that var (whole DECL_ORIGIN is the parm PARM_DECL) | |
1461 | is optimized away, but could be looked up at the call site | |
1462 | as value of D#X there. */ | |
1463 | if (debug_args != NULL) | |
1464 | { | |
1465 | unsigned int i; | |
1466 | tree var, vexpr; | |
1467 | gimple_stmt_iterator cgsi; | |
355fe088 | 1468 | gimple *def_temp; |
878eef4a | 1469 | |
67348ccc DM |
1470 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); |
1471 | var = BLOCK_VARS (DECL_INITIAL (node->decl)); | |
9771b263 | 1472 | i = vec_safe_length (*debug_args); |
fefa31b5 | 1473 | cgsi = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun))); |
878eef4a JJ |
1474 | do |
1475 | { | |
1476 | i -= 2; | |
1477 | while (var != NULL_TREE | |
9771b263 | 1478 | && DECL_ABSTRACT_ORIGIN (var) != (**debug_args)[i]) |
878eef4a JJ |
1479 | var = TREE_CHAIN (var); |
1480 | if (var == NULL_TREE) | |
1481 | break; | |
1482 | vexpr = make_node (DEBUG_EXPR_DECL); | |
9771b263 | 1483 | parm = (**debug_args)[i]; |
878eef4a JJ |
1484 | DECL_ARTIFICIAL (vexpr) = 1; |
1485 | TREE_TYPE (vexpr) = TREE_TYPE (parm); | |
1486 | DECL_MODE (vexpr) = DECL_MODE (parm); | |
1487 | def_temp = gimple_build_debug_source_bind (vexpr, parm, | |
1488 | NULL); | |
1489 | gsi_insert_before (&cgsi, def_temp, GSI_SAME_STMT); | |
1490 | def_temp = gimple_build_debug_bind (var, vexpr, NULL); | |
1491 | gsi_insert_before (&cgsi, def_temp, GSI_SAME_STMT); | |
1492 | } | |
1493 | while (i); | |
1494 | pop_cfun (); | |
1495 | } | |
1496 | ||
556e9ba0 JH |
1497 | /* We avoid address being taken on any variable used by split part, |
1498 | so return slot optimization is always possible. Moreover this is | |
1499 | required to make DECL_BY_REFERENCE work. */ | |
1500 | if (aggregate_value_p (DECL_RESULT (current_function_decl), | |
22110e6c EB |
1501 | TREE_TYPE (current_function_decl)) |
1502 | && (!is_gimple_reg_type (TREE_TYPE (DECL_RESULT (current_function_decl))) | |
1503 | || DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))) | |
556e9ba0 JH |
1504 | gimple_call_set_return_slot_opt (call, true); |
1505 | ||
bfd71482 JJ |
1506 | if (add_tsan_func_exit) |
1507 | tsan_func_exit_call = gimple_build_call_internal (IFN_TSAN_FUNC_EXIT, 0); | |
1508 | ||
3e485f62 JH |
1509 | /* Update return value. This is bit tricky. When we do not return, |
1510 | do nothing. When we return we might need to update return_bb | |
1511 | or produce a new return statement. */ | |
1512 | if (!split_part_return_p) | |
bfd71482 JJ |
1513 | { |
1514 | gsi_insert_after (&gsi, call, GSI_NEW_STMT); | |
1515 | if (tsan_func_exit_call) | |
1516 | gsi_insert_after (&gsi, tsan_func_exit_call, GSI_NEW_STMT); | |
1517 | } | |
3e485f62 JH |
1518 | else |
1519 | { | |
1520 | e = make_edge (call_bb, return_bb, | |
fefa31b5 DM |
1521 | return_bb == EXIT_BLOCK_PTR_FOR_FN (cfun) |
1522 | ? 0 : EDGE_FALLTHRU); | |
3e485f62 JH |
1523 | e->count = call_bb->count; |
1524 | e->probability = REG_BR_PROB_BASE; | |
6938f93f JH |
1525 | |
1526 | /* If there is return basic block, see what value we need to store | |
1527 | return value into and put call just before it. */ | |
fefa31b5 | 1528 | if (return_bb != EXIT_BLOCK_PTR_FOR_FN (cfun)) |
3e485f62 | 1529 | { |
2094f1fc | 1530 | real_retval = retval = find_retval (return_bb); |
d5e254e1 | 1531 | retbnd = find_retbnd (return_bb); |
6938f93f | 1532 | |
241a2b9e | 1533 | if (real_retval && split_point->split_part_set_retval) |
3e485f62 | 1534 | { |
538dd0b7 | 1535 | gphi_iterator psi; |
3e485f62 | 1536 | |
6938f93f JH |
1537 | /* See if we need new SSA_NAME for the result. |
1538 | When DECL_BY_REFERENCE is true, retval is actually pointer to | |
1539 | return value and it is constant in whole function. */ | |
1540 | if (TREE_CODE (retval) == SSA_NAME | |
1541 | && !DECL_BY_REFERENCE (DECL_RESULT (current_function_decl))) | |
3e485f62 | 1542 | { |
070ecdfd | 1543 | retval = copy_ssa_name (retval, call); |
6938f93f JH |
1544 | |
1545 | /* See if there is PHI defining return value. */ | |
1546 | for (psi = gsi_start_phis (return_bb); | |
1547 | !gsi_end_p (psi); gsi_next (&psi)) | |
538dd0b7 | 1548 | if (!virtual_operand_p (gimple_phi_result (psi.phi ()))) |
6938f93f JH |
1549 | break; |
1550 | ||
1551 | /* When there is PHI, just update its value. */ | |
3e485f62 JH |
1552 | if (TREE_CODE (retval) == SSA_NAME |
1553 | && !gsi_end_p (psi)) | |
538dd0b7 | 1554 | add_phi_arg (psi.phi (), retval, e, UNKNOWN_LOCATION); |
6938f93f JH |
1555 | /* Otherwise update the return BB itself. |
1556 | find_return_bb allows at most one assignment to return value, | |
1557 | so update first statement. */ | |
1558 | else | |
3e485f62 | 1559 | { |
2094f1fc JH |
1560 | gimple_stmt_iterator bsi; |
1561 | for (bsi = gsi_start_bb (return_bb); !gsi_end_p (bsi); | |
1562 | gsi_next (&bsi)) | |
538dd0b7 DM |
1563 | if (greturn *return_stmt |
1564 | = dyn_cast <greturn *> (gsi_stmt (bsi))) | |
2094f1fc | 1565 | { |
538dd0b7 | 1566 | gimple_return_set_retval (return_stmt, retval); |
2094f1fc JH |
1567 | break; |
1568 | } | |
2e216592 JJ |
1569 | else if (gimple_code (gsi_stmt (bsi)) == GIMPLE_ASSIGN |
1570 | && !gimple_clobber_p (gsi_stmt (bsi))) | |
2094f1fc JH |
1571 | { |
1572 | gimple_assign_set_rhs1 (gsi_stmt (bsi), retval); | |
1573 | break; | |
1574 | } | |
1575 | update_stmt (gsi_stmt (bsi)); | |
3e485f62 | 1576 | } |
d5e254e1 IE |
1577 | |
1578 | /* Replace retbnd with new one. */ | |
1579 | if (retbnd) | |
1580 | { | |
1581 | gimple_stmt_iterator bsi; | |
1582 | for (bsi = gsi_last_bb (return_bb); !gsi_end_p (bsi); | |
1583 | gsi_prev (&bsi)) | |
1584 | if (gimple_code (gsi_stmt (bsi)) == GIMPLE_RETURN) | |
1585 | { | |
1586 | retbnd = copy_ssa_name (retbnd, call); | |
1587 | gimple_return_set_retbnd (gsi_stmt (bsi), retbnd); | |
1588 | update_stmt (gsi_stmt (bsi)); | |
1589 | break; | |
1590 | } | |
1591 | } | |
3e485f62 | 1592 | } |
556e9ba0 | 1593 | if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl))) |
42b05b6e RG |
1594 | { |
1595 | gimple_call_set_lhs (call, build_simple_mem_ref (retval)); | |
1596 | gsi_insert_after (&gsi, call, GSI_NEW_STMT); | |
1597 | } | |
556e9ba0 | 1598 | else |
42b05b6e RG |
1599 | { |
1600 | tree restype; | |
1601 | restype = TREE_TYPE (DECL_RESULT (current_function_decl)); | |
1602 | gsi_insert_after (&gsi, call, GSI_NEW_STMT); | |
1603 | if (!useless_type_conversion_p (TREE_TYPE (retval), restype)) | |
1604 | { | |
355fe088 | 1605 | gimple *cpy; |
b731b390 | 1606 | tree tem = create_tmp_reg (restype); |
42b05b6e | 1607 | tem = make_ssa_name (tem, call); |
0d0e4a03 | 1608 | cpy = gimple_build_assign (retval, NOP_EXPR, tem); |
42b05b6e RG |
1609 | gsi_insert_after (&gsi, cpy, GSI_NEW_STMT); |
1610 | retval = tem; | |
1611 | } | |
d5e254e1 IE |
1612 | /* Build bndret call to obtain returned bounds. */ |
1613 | if (retbnd) | |
4f5a53cc | 1614 | chkp_insert_retbnd_call (retbnd, retval, &gsi); |
42b05b6e RG |
1615 | gimple_call_set_lhs (call, retval); |
1616 | update_stmt (call); | |
1617 | } | |
3e485f62 | 1618 | } |
42b05b6e RG |
1619 | else |
1620 | gsi_insert_after (&gsi, call, GSI_NEW_STMT); | |
bfd71482 JJ |
1621 | if (tsan_func_exit_call) |
1622 | gsi_insert_after (&gsi, tsan_func_exit_call, GSI_NEW_STMT); | |
3e485f62 | 1623 | } |
6938f93f JH |
1624 | /* We don't use return block (there is either no return in function or |
1625 | multiple of them). So create new basic block with return statement. | |
1626 | */ | |
3e485f62 JH |
1627 | else |
1628 | { | |
538dd0b7 | 1629 | greturn *ret; |
241a2b9e JH |
1630 | if (split_point->split_part_set_retval |
1631 | && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))) | |
3e485f62 | 1632 | { |
4021f4a1 | 1633 | retval = DECL_RESULT (current_function_decl); |
8a9c1ae6 | 1634 | |
d5e254e1 IE |
1635 | if (chkp_function_instrumented_p (current_function_decl) |
1636 | && BOUNDED_P (retval)) | |
b731b390 | 1637 | retbnd = create_tmp_reg (pointer_bounds_type_node); |
d5e254e1 | 1638 | |
8a9c1ae6 JH |
1639 | /* We use temporary register to hold value when aggregate_value_p |
1640 | is false. Similarly for DECL_BY_REFERENCE we must avoid extra | |
1641 | copy. */ | |
1642 | if (!aggregate_value_p (retval, TREE_TYPE (current_function_decl)) | |
1643 | && !DECL_BY_REFERENCE (retval)) | |
b731b390 | 1644 | retval = create_tmp_reg (TREE_TYPE (retval)); |
3e485f62 | 1645 | if (is_gimple_reg (retval)) |
6938f93f JH |
1646 | { |
1647 | /* When returning by reference, there is only one SSA name | |
1648 | assigned to RESULT_DECL (that is pointer to return value). | |
1649 | Look it up or create new one if it is missing. */ | |
1650 | if (DECL_BY_REFERENCE (retval)) | |
32244553 | 1651 | retval = get_or_create_ssa_default_def (cfun, retval); |
6938f93f JH |
1652 | /* Otherwise produce new SSA name for return value. */ |
1653 | else | |
1654 | retval = make_ssa_name (retval, call); | |
1655 | } | |
556e9ba0 JH |
1656 | if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl))) |
1657 | gimple_call_set_lhs (call, build_simple_mem_ref (retval)); | |
1658 | else | |
1659 | gimple_call_set_lhs (call, retval); | |
3e485f62 JH |
1660 | } |
1661 | gsi_insert_after (&gsi, call, GSI_NEW_STMT); | |
d5e254e1 IE |
1662 | /* Build bndret call to obtain returned bounds. */ |
1663 | if (retbnd) | |
4f5a53cc | 1664 | chkp_insert_retbnd_call (retbnd, retval, &gsi); |
bfd71482 JJ |
1665 | if (tsan_func_exit_call) |
1666 | gsi_insert_after (&gsi, tsan_func_exit_call, GSI_NEW_STMT); | |
3e485f62 JH |
1667 | ret = gimple_build_return (retval); |
1668 | gsi_insert_after (&gsi, ret, GSI_NEW_STMT); | |
1669 | } | |
1670 | } | |
1671 | free_dominance_info (CDI_DOMINATORS); | |
1672 | free_dominance_info (CDI_POST_DOMINATORS); | |
632b4f8e | 1673 | compute_inline_parameters (node, true); |
3e485f62 JH |
1674 | } |
1675 | ||
1676 | /* Execute function splitting pass. */ | |
1677 | ||
1678 | static unsigned int | |
1679 | execute_split_functions (void) | |
1680 | { | |
1681 | gimple_stmt_iterator bsi; | |
1682 | basic_block bb; | |
1683 | int overall_time = 0, overall_size = 0; | |
1684 | int todo = 0; | |
d52f5295 | 1685 | struct cgraph_node *node = cgraph_node::get (current_function_decl); |
3e485f62 | 1686 | |
b2d2adc6 RG |
1687 | if (flags_from_decl_or_type (current_function_decl) |
1688 | & (ECF_NORETURN|ECF_MALLOC)) | |
3e485f62 JH |
1689 | { |
1690 | if (dump_file) | |
b2d2adc6 | 1691 | fprintf (dump_file, "Not splitting: noreturn/malloc function.\n"); |
3e485f62 JH |
1692 | return 0; |
1693 | } | |
1694 | if (MAIN_NAME_P (DECL_NAME (current_function_decl))) | |
1695 | { | |
1696 | if (dump_file) | |
1697 | fprintf (dump_file, "Not splitting: main function.\n"); | |
1698 | return 0; | |
1699 | } | |
1700 | /* This can be relaxed; function might become inlinable after splitting | |
1701 | away the uninlinable part. */ | |
9771b263 | 1702 | if (inline_edge_summary_vec.exists () |
9a1e784a | 1703 | && !inline_summaries->get (node)->inlinable) |
3e485f62 JH |
1704 | { |
1705 | if (dump_file) | |
1706 | fprintf (dump_file, "Not splitting: not inlinable.\n"); | |
1707 | return 0; | |
1708 | } | |
67348ccc | 1709 | if (DECL_DISREGARD_INLINE_LIMITS (node->decl)) |
3e485f62 JH |
1710 | { |
1711 | if (dump_file) | |
ed7656f6 | 1712 | fprintf (dump_file, "Not splitting: disregarding inline limits.\n"); |
3e485f62 JH |
1713 | return 0; |
1714 | } | |
1715 | /* This can be relaxed; most of versioning tests actually prevents | |
1716 | a duplication. */ | |
1717 | if (!tree_versionable_function_p (current_function_decl)) | |
1718 | { | |
1719 | if (dump_file) | |
1720 | fprintf (dump_file, "Not splitting: not versionable.\n"); | |
1721 | return 0; | |
1722 | } | |
1723 | /* FIXME: we could support this. */ | |
1724 | if (DECL_STRUCT_FUNCTION (current_function_decl)->static_chain_decl) | |
1725 | { | |
1726 | if (dump_file) | |
1727 | fprintf (dump_file, "Not splitting: nested function.\n"); | |
1728 | return 0; | |
1729 | } | |
3e485f62 JH |
1730 | |
1731 | /* See if it makes sense to try to split. | |
1732 | It makes sense to split if we inline, that is if we have direct calls to | |
1733 | handle or direct calls are possibly going to appear as result of indirect | |
cf9712cc JH |
1734 | inlining or LTO. Also handle -fprofile-generate as LTO to allow non-LTO |
1735 | training for LTO -fprofile-use build. | |
1736 | ||
3e485f62 JH |
1737 | Note that we are not completely conservative about disqualifying functions |
1738 | called once. It is possible that the caller is called more then once and | |
1739 | then inlining would still benefit. */ | |
c91061e6 JH |
1740 | if ((!node->callers |
1741 | /* Local functions called once will be completely inlined most of time. */ | |
1742 | || (!node->callers->next_caller && node->local.local)) | |
67348ccc | 1743 | && !node->address_taken |
42685f72 | 1744 | && !node->has_aliases_p () |
67348ccc | 1745 | && (!flag_lto || !node->externally_visible)) |
3e485f62 JH |
1746 | { |
1747 | if (dump_file) | |
1748 | fprintf (dump_file, "Not splitting: not called directly " | |
1749 | "or called once.\n"); | |
1750 | return 0; | |
1751 | } | |
1752 | ||
1753 | /* FIXME: We can actually split if splitting reduces call overhead. */ | |
1754 | if (!flag_inline_small_functions | |
1755 | && !DECL_DECLARED_INLINE_P (current_function_decl)) | |
1756 | { | |
1757 | if (dump_file) | |
1758 | fprintf (dump_file, "Not splitting: not autoinlining and function" | |
1759 | " is not inline.\n"); | |
1760 | return 0; | |
1761 | } | |
1762 | ||
e70670cf JH |
1763 | /* We enforce splitting after loop headers when profile info is not |
1764 | available. */ | |
0a6a6ac9 | 1765 | if (profile_status_for_fn (cfun) != PROFILE_READ) |
e70670cf JH |
1766 | mark_dfs_back_edges (); |
1767 | ||
b2e25729 BS |
1768 | /* Initialize bitmap to track forbidden calls. */ |
1769 | forbidden_dominators = BITMAP_ALLOC (NULL); | |
1770 | calculate_dominance_info (CDI_DOMINATORS); | |
1771 | ||
3e485f62 | 1772 | /* Compute local info about basic blocks and determine function size/time. */ |
8b1c6fd7 | 1773 | bb_info_vec.safe_grow_cleared (last_basic_block_for_fn (cfun) + 1); |
3e485f62 | 1774 | memset (&best_split_point, 0, sizeof (best_split_point)); |
bfd71482 JJ |
1775 | basic_block return_bb = find_return_bb (); |
1776 | int tsan_exit_found = -1; | |
11cd3bed | 1777 | FOR_EACH_BB_FN (bb, cfun) |
3e485f62 JH |
1778 | { |
1779 | int time = 0; | |
1780 | int size = 0; | |
1781 | int freq = compute_call_stmt_bb_frequency (current_function_decl, bb); | |
1782 | ||
1783 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1784 | fprintf (dump_file, "Basic block %i\n", bb->index); | |
1785 | ||
1786 | for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi)) | |
1787 | { | |
1788 | int this_time, this_size; | |
355fe088 | 1789 | gimple *stmt = gsi_stmt (bsi); |
3e485f62 JH |
1790 | |
1791 | this_size = estimate_num_insns (stmt, &eni_size_weights); | |
1792 | this_time = estimate_num_insns (stmt, &eni_time_weights) * freq; | |
1793 | size += this_size; | |
1794 | time += this_time; | |
b2e25729 | 1795 | check_forbidden_calls (stmt); |
3e485f62 JH |
1796 | |
1797 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1798 | { | |
1799 | fprintf (dump_file, " freq:%6i size:%3i time:%3i ", | |
1800 | freq, this_size, this_time); | |
1801 | print_gimple_stmt (dump_file, stmt, 0, 0); | |
1802 | } | |
bfd71482 JJ |
1803 | |
1804 | if ((flag_sanitize & SANITIZE_THREAD) | |
1805 | && is_gimple_call (stmt) | |
1806 | && gimple_call_internal_p (stmt) | |
1807 | && gimple_call_internal_fn (stmt) == IFN_TSAN_FUNC_EXIT) | |
1808 | { | |
1809 | /* We handle TSAN_FUNC_EXIT for splitting either in the | |
1810 | return_bb, or in its immediate predecessors. */ | |
1811 | if ((bb != return_bb && !find_edge (bb, return_bb)) | |
1812 | || (tsan_exit_found != -1 | |
1813 | && tsan_exit_found != (bb != return_bb))) | |
1814 | { | |
1815 | if (dump_file) | |
1816 | fprintf (dump_file, "Not splitting: TSAN_FUNC_EXIT" | |
1817 | " in unexpected basic block.\n"); | |
1818 | BITMAP_FREE (forbidden_dominators); | |
1819 | bb_info_vec.release (); | |
1820 | return 0; | |
1821 | } | |
1822 | tsan_exit_found = bb != return_bb; | |
1823 | } | |
3e485f62 JH |
1824 | } |
1825 | overall_time += time; | |
1826 | overall_size += size; | |
9771b263 DN |
1827 | bb_info_vec[bb->index].time = time; |
1828 | bb_info_vec[bb->index].size = size; | |
3e485f62 | 1829 | } |
bfd71482 | 1830 | find_split_points (return_bb, overall_time, overall_size); |
3e485f62 JH |
1831 | if (best_split_point.split_bbs) |
1832 | { | |
bfd71482 | 1833 | split_function (return_bb, &best_split_point, tsan_exit_found == 1); |
3e485f62 JH |
1834 | BITMAP_FREE (best_split_point.ssa_names_to_pass); |
1835 | BITMAP_FREE (best_split_point.split_bbs); | |
1836 | todo = TODO_update_ssa | TODO_cleanup_cfg; | |
1837 | } | |
b2e25729 | 1838 | BITMAP_FREE (forbidden_dominators); |
9771b263 | 1839 | bb_info_vec.release (); |
3e485f62 JH |
1840 | return todo; |
1841 | } | |
1842 | ||
27a4cd48 DM |
1843 | namespace { |
1844 | ||
1845 | const pass_data pass_data_split_functions = | |
3e485f62 | 1846 | { |
27a4cd48 DM |
1847 | GIMPLE_PASS, /* type */ |
1848 | "fnsplit", /* name */ | |
1849 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
1850 | TV_IPA_FNSPLIT, /* tv_id */ |
1851 | PROP_cfg, /* properties_required */ | |
1852 | 0, /* properties_provided */ | |
1853 | 0, /* properties_destroyed */ | |
1854 | 0, /* todo_flags_start */ | |
3bea341f | 1855 | 0, /* todo_flags_finish */ |
3e485f62 | 1856 | }; |
cf9712cc | 1857 | |
27a4cd48 DM |
1858 | class pass_split_functions : public gimple_opt_pass |
1859 | { | |
1860 | public: | |
c3284718 RS |
1861 | pass_split_functions (gcc::context *ctxt) |
1862 | : gimple_opt_pass (pass_data_split_functions, ctxt) | |
27a4cd48 DM |
1863 | {} |
1864 | ||
1865 | /* opt_pass methods: */ | |
1a3d085c | 1866 | virtual bool gate (function *); |
be55bfe6 TS |
1867 | virtual unsigned int execute (function *) |
1868 | { | |
1869 | return execute_split_functions (); | |
1870 | } | |
27a4cd48 DM |
1871 | |
1872 | }; // class pass_split_functions | |
1873 | ||
1a3d085c TS |
1874 | bool |
1875 | pass_split_functions::gate (function *) | |
1876 | { | |
1877 | /* When doing profile feedback, we want to execute the pass after profiling | |
1878 | is read. So disable one in early optimization. */ | |
1879 | return (flag_partial_inlining | |
1880 | && !profile_arc_flag && !flag_branch_probabilities); | |
1881 | } | |
1882 | ||
27a4cd48 DM |
1883 | } // anon namespace |
1884 | ||
1885 | gimple_opt_pass * | |
1886 | make_pass_split_functions (gcc::context *ctxt) | |
1887 | { | |
1888 | return new pass_split_functions (ctxt); | |
1889 | } | |
1890 | ||
cf9712cc JH |
1891 | /* Execute function splitting pass. */ |
1892 | ||
1893 | static unsigned int | |
1894 | execute_feedback_split_functions (void) | |
1895 | { | |
1896 | unsigned int retval = execute_split_functions (); | |
1897 | if (retval) | |
1898 | retval |= TODO_rebuild_cgraph_edges; | |
1899 | return retval; | |
1900 | } | |
1901 | ||
27a4cd48 DM |
1902 | namespace { |
1903 | ||
1904 | const pass_data pass_data_feedback_split_functions = | |
cf9712cc | 1905 | { |
27a4cd48 DM |
1906 | GIMPLE_PASS, /* type */ |
1907 | "feedback_fnsplit", /* name */ | |
1908 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
1909 | TV_IPA_FNSPLIT, /* tv_id */ |
1910 | PROP_cfg, /* properties_required */ | |
1911 | 0, /* properties_provided */ | |
1912 | 0, /* properties_destroyed */ | |
1913 | 0, /* todo_flags_start */ | |
3bea341f | 1914 | 0, /* todo_flags_finish */ |
cf9712cc | 1915 | }; |
27a4cd48 DM |
1916 | |
1917 | class pass_feedback_split_functions : public gimple_opt_pass | |
1918 | { | |
1919 | public: | |
c3284718 RS |
1920 | pass_feedback_split_functions (gcc::context *ctxt) |
1921 | : gimple_opt_pass (pass_data_feedback_split_functions, ctxt) | |
27a4cd48 DM |
1922 | {} |
1923 | ||
1924 | /* opt_pass methods: */ | |
1a3d085c | 1925 | virtual bool gate (function *); |
be55bfe6 TS |
1926 | virtual unsigned int execute (function *) |
1927 | { | |
1928 | return execute_feedback_split_functions (); | |
1929 | } | |
27a4cd48 DM |
1930 | |
1931 | }; // class pass_feedback_split_functions | |
1932 | ||
1a3d085c TS |
1933 | bool |
1934 | pass_feedback_split_functions::gate (function *) | |
1935 | { | |
1936 | /* We don't need to split when profiling at all, we are producing | |
1937 | lousy code anyway. */ | |
1938 | return (flag_partial_inlining | |
1939 | && flag_branch_probabilities); | |
1940 | } | |
1941 | ||
27a4cd48 DM |
1942 | } // anon namespace |
1943 | ||
1944 | gimple_opt_pass * | |
1945 | make_pass_feedback_split_functions (gcc::context *ctxt) | |
1946 | { | |
1947 | return new pass_feedback_split_functions (ctxt); | |
1948 | } |