]>
Commit | Line | Data |
---|---|---|
2abae5f1 | 1 | /* Single entry single exit control flow regions. |
d1e082c2 | 2 | Copyright (C) 2008-2013 Free Software Foundation, Inc. |
2abae5f1 SP |
3 | Contributed by Jan Sjodin <jan.sjodin@amd.com> and |
4 | Sebastian Pop <sebastian.pop@amd.com>. | |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify | |
9 | it under the terms of the GNU General Public License as published by | |
10 | the Free Software Foundation; either version 3, or (at your option) | |
11 | any later version. | |
12 | ||
13 | GCC is distributed in the hope that it will be useful, | |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with GCC; see the file COPYING3. If not see | |
20 | <http://www.gnu.org/licenses/>. */ | |
21 | ||
22 | #include "config.h" | |
23 | #include "system.h" | |
24 | #include "coretypes.h" | |
4a8fb1a1 | 25 | #include "hash-table.h" |
cf2d1b38 | 26 | #include "tree.h" |
cf835838 | 27 | #include "tree-pretty-print.h" |
45b0be94 | 28 | #include "gimplify.h" |
5be5c238 | 29 | #include "gimple-iterator.h" |
442b4905 AM |
30 | #include "gimple-ssa.h" |
31 | #include "tree-cfg.h" | |
32 | #include "tree-phinodes.h" | |
33 | #include "ssa-iterators.h" | |
34 | #include "tree-ssanames.h" | |
35 | #include "tree-ssa-loop.h" | |
36 | #include "tree-into-ssa.h" | |
2abae5f1 SP |
37 | #include "cfgloop.h" |
38 | #include "tree-chrec.h" | |
39 | #include "tree-data-ref.h" | |
40 | #include "tree-scalar-evolution.h" | |
41 | #include "tree-pass.h" | |
2abae5f1 | 42 | #include "value-prof.h" |
2abae5f1 | 43 | #include "sese.h" |
744730a4 | 44 | #include "tree-ssa-propagate.h" |
2abae5f1 SP |
45 | |
46 | /* Print to stderr the element ELT. */ | |
47 | ||
48 | static void | |
49 | debug_rename_elt (rename_map_elt elt) | |
50 | { | |
51 | fprintf (stderr, "("); | |
52 | print_generic_expr (stderr, elt->old_name, 0); | |
53 | fprintf (stderr, ", "); | |
54 | print_generic_expr (stderr, elt->expr, 0); | |
55 | fprintf (stderr, ")\n"); | |
56 | } | |
57 | ||
58 | /* Helper function for debug_rename_map. */ | |
59 | ||
4a8fb1a1 LC |
60 | int |
61 | debug_rename_map_1 (rename_map_elt_s **slot, void *s ATTRIBUTE_UNUSED) | |
2abae5f1 | 62 | { |
4a8fb1a1 | 63 | struct rename_map_elt_s *entry = *slot; |
2abae5f1 SP |
64 | debug_rename_elt (entry); |
65 | return 1; | |
66 | } | |
4a8fb1a1 LC |
67 | \f |
68 | ||
69 | /* Hashtable helpers. */ | |
70 | ||
71 | struct rename_map_hasher : typed_free_remove <rename_map_elt_s> | |
72 | { | |
73 | typedef rename_map_elt_s value_type; | |
74 | typedef rename_map_elt_s compare_type; | |
75 | static inline hashval_t hash (const value_type *); | |
76 | static inline bool equal (const value_type *, const compare_type *); | |
77 | }; | |
78 | ||
79 | /* Computes a hash function for database element ELT. */ | |
80 | ||
81 | inline hashval_t | |
82 | rename_map_hasher::hash (const value_type *elt) | |
83 | { | |
84 | return SSA_NAME_VERSION (elt->old_name); | |
85 | } | |
86 | ||
87 | /* Compares database elements E1 and E2. */ | |
88 | ||
89 | inline bool | |
90 | rename_map_hasher::equal (const value_type *elt1, const compare_type *elt2) | |
91 | { | |
92 | return (elt1->old_name == elt2->old_name); | |
93 | } | |
94 | ||
95 | typedef hash_table <rename_map_hasher> rename_map_type; | |
96 | \f | |
2abae5f1 | 97 | |
32e68db9 | 98 | /* Print to stderr all the elements of RENAME_MAP. */ |
2abae5f1 | 99 | |
24e47c76 | 100 | DEBUG_FUNCTION void |
4a8fb1a1 | 101 | debug_rename_map (rename_map_type rename_map) |
2abae5f1 | 102 | { |
4a8fb1a1 | 103 | rename_map.traverse <void *, debug_rename_map_1> (NULL); |
2abae5f1 SP |
104 | } |
105 | ||
106 | /* Computes a hash function for database element ELT. */ | |
107 | ||
108 | hashval_t | |
109 | rename_map_elt_info (const void *elt) | |
110 | { | |
617531d9 | 111 | return SSA_NAME_VERSION (((const struct rename_map_elt_s *) elt)->old_name); |
2abae5f1 SP |
112 | } |
113 | ||
114 | /* Compares database elements E1 and E2. */ | |
115 | ||
116 | int | |
117 | eq_rename_map_elts (const void *e1, const void *e2) | |
118 | { | |
119 | const struct rename_map_elt_s *elt1 = (const struct rename_map_elt_s *) e1; | |
120 | const struct rename_map_elt_s *elt2 = (const struct rename_map_elt_s *) e2; | |
121 | ||
122 | return (elt1->old_name == elt2->old_name); | |
123 | } | |
124 | ||
125 | \f | |
126 | ||
073a8998 | 127 | /* Record LOOP as occurring in REGION. */ |
2abae5f1 SP |
128 | |
129 | static void | |
130 | sese_record_loop (sese region, loop_p loop) | |
131 | { | |
132 | if (sese_contains_loop (region, loop)) | |
133 | return; | |
134 | ||
135 | bitmap_set_bit (SESE_LOOPS (region), loop->num); | |
9771b263 | 136 | SESE_LOOP_NEST (region).safe_push (loop); |
2abae5f1 SP |
137 | } |
138 | ||
139 | /* Build the loop nests contained in REGION. Returns true when the | |
140 | operation was successful. */ | |
141 | ||
142 | void | |
143 | build_sese_loop_nests (sese region) | |
144 | { | |
145 | unsigned i; | |
146 | basic_block bb; | |
147 | struct loop *loop0, *loop1; | |
148 | ||
149 | FOR_EACH_BB (bb) | |
150 | if (bb_in_sese_p (bb, region)) | |
151 | { | |
152 | struct loop *loop = bb->loop_father; | |
153 | ||
154 | /* Only add loops if they are completely contained in the SCoP. */ | |
155 | if (loop->header == bb | |
156 | && bb_in_sese_p (loop->latch, region)) | |
157 | sese_record_loop (region, loop); | |
158 | } | |
159 | ||
160 | /* Make sure that the loops in the SESE_LOOP_NEST are ordered. It | |
161 | can be the case that an inner loop is inserted before an outer | |
162 | loop. To avoid this, semi-sort once. */ | |
9771b263 | 163 | FOR_EACH_VEC_ELT (SESE_LOOP_NEST (region), i, loop0) |
2abae5f1 | 164 | { |
9771b263 | 165 | if (SESE_LOOP_NEST (region).length () == i + 1) |
2abae5f1 SP |
166 | break; |
167 | ||
9771b263 | 168 | loop1 = SESE_LOOP_NEST (region)[i + 1]; |
2abae5f1 SP |
169 | if (loop0->num > loop1->num) |
170 | { | |
9771b263 DN |
171 | SESE_LOOP_NEST (region)[i] = loop1; |
172 | SESE_LOOP_NEST (region)[i + 1] = loop0; | |
2abae5f1 SP |
173 | } |
174 | } | |
175 | } | |
176 | ||
177 | /* For a USE in BB, if BB is outside REGION, mark the USE in the | |
178 | LIVEOUTS set. */ | |
179 | ||
180 | static void | |
181 | sese_build_liveouts_use (sese region, bitmap liveouts, basic_block bb, | |
182 | tree use) | |
183 | { | |
184 | unsigned ver; | |
185 | basic_block def_bb; | |
186 | ||
187 | if (TREE_CODE (use) != SSA_NAME) | |
188 | return; | |
189 | ||
190 | ver = SSA_NAME_VERSION (use); | |
191 | def_bb = gimple_bb (SSA_NAME_DEF_STMT (use)); | |
192 | ||
193 | if (!def_bb | |
194 | || !bb_in_sese_p (def_bb, region) | |
195 | || bb_in_sese_p (bb, region)) | |
196 | return; | |
197 | ||
198 | bitmap_set_bit (liveouts, ver); | |
199 | } | |
200 | ||
201 | /* Marks for rewrite all the SSA_NAMES defined in REGION and that are | |
202 | used in BB that is outside of the REGION. */ | |
203 | ||
204 | static void | |
205 | sese_build_liveouts_bb (sese region, bitmap liveouts, basic_block bb) | |
206 | { | |
207 | gimple_stmt_iterator bsi; | |
208 | edge e; | |
209 | edge_iterator ei; | |
210 | ssa_op_iter iter; | |
211 | use_operand_p use_p; | |
212 | ||
213 | FOR_EACH_EDGE (e, ei, bb->succs) | |
214 | for (bsi = gsi_start_phis (e->dest); !gsi_end_p (bsi); gsi_next (&bsi)) | |
215 | sese_build_liveouts_use (region, liveouts, bb, | |
216 | PHI_ARG_DEF_FROM_EDGE (gsi_stmt (bsi), e)); | |
217 | ||
218 | for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi)) | |
a3201927 AO |
219 | { |
220 | gimple stmt = gsi_stmt (bsi); | |
221 | ||
222 | if (is_gimple_debug (stmt)) | |
223 | continue; | |
224 | ||
225 | FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_ALL_USES) | |
226 | sese_build_liveouts_use (region, liveouts, bb, USE_FROM_PTR (use_p)); | |
227 | } | |
228 | } | |
229 | ||
230 | /* For a USE in BB, return true if BB is outside REGION and it's not | |
231 | in the LIVEOUTS set. */ | |
232 | ||
233 | static bool | |
234 | sese_bad_liveouts_use (sese region, bitmap liveouts, basic_block bb, | |
235 | tree use) | |
236 | { | |
237 | unsigned ver; | |
238 | basic_block def_bb; | |
239 | ||
240 | if (TREE_CODE (use) != SSA_NAME) | |
241 | return false; | |
242 | ||
243 | ver = SSA_NAME_VERSION (use); | |
244 | ||
245 | /* If it's in liveouts, the variable will get a new PHI node, and | |
246 | the debug use will be properly adjusted. */ | |
247 | if (bitmap_bit_p (liveouts, ver)) | |
248 | return false; | |
249 | ||
250 | def_bb = gimple_bb (SSA_NAME_DEF_STMT (use)); | |
251 | ||
252 | if (!def_bb | |
253 | || !bb_in_sese_p (def_bb, region) | |
254 | || bb_in_sese_p (bb, region)) | |
255 | return false; | |
256 | ||
257 | return true; | |
258 | } | |
259 | ||
260 | /* Reset debug stmts that reference SSA_NAMES defined in REGION that | |
261 | are not marked as liveouts. */ | |
262 | ||
263 | static void | |
264 | sese_reset_debug_liveouts_bb (sese region, bitmap liveouts, basic_block bb) | |
265 | { | |
266 | gimple_stmt_iterator bsi; | |
267 | ssa_op_iter iter; | |
268 | use_operand_p use_p; | |
269 | ||
270 | for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi)) | |
271 | { | |
272 | gimple stmt = gsi_stmt (bsi); | |
273 | ||
274 | if (!is_gimple_debug (stmt)) | |
275 | continue; | |
276 | ||
277 | FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_ALL_USES) | |
278 | if (sese_bad_liveouts_use (region, liveouts, bb, | |
279 | USE_FROM_PTR (use_p))) | |
280 | { | |
281 | gimple_debug_bind_reset_value (stmt); | |
282 | update_stmt (stmt); | |
283 | break; | |
284 | } | |
285 | } | |
2abae5f1 SP |
286 | } |
287 | ||
288 | /* Build the LIVEOUTS of REGION: the set of variables defined inside | |
289 | and used outside the REGION. */ | |
290 | ||
291 | static void | |
292 | sese_build_liveouts (sese region, bitmap liveouts) | |
293 | { | |
294 | basic_block bb; | |
295 | ||
296 | FOR_EACH_BB (bb) | |
297 | sese_build_liveouts_bb (region, liveouts, bb); | |
1c1ad7bb | 298 | if (MAY_HAVE_DEBUG_STMTS) |
a3201927 AO |
299 | FOR_EACH_BB (bb) |
300 | sese_reset_debug_liveouts_bb (region, liveouts, bb); | |
2abae5f1 SP |
301 | } |
302 | ||
303 | /* Builds a new SESE region from edges ENTRY and EXIT. */ | |
304 | ||
305 | sese | |
306 | new_sese (edge entry, edge exit) | |
307 | { | |
308 | sese region = XNEW (struct sese_s); | |
309 | ||
310 | SESE_ENTRY (region) = entry; | |
311 | SESE_EXIT (region) = exit; | |
312 | SESE_LOOPS (region) = BITMAP_ALLOC (NULL); | |
9771b263 | 313 | SESE_LOOP_NEST (region).create (3); |
2abae5f1 | 314 | SESE_ADD_PARAMS (region) = true; |
9771b263 | 315 | SESE_PARAMS (region).create (3); |
2abae5f1 SP |
316 | |
317 | return region; | |
318 | } | |
319 | ||
320 | /* Deletes REGION. */ | |
321 | ||
322 | void | |
323 | free_sese (sese region) | |
324 | { | |
325 | if (SESE_LOOPS (region)) | |
326 | SESE_LOOPS (region) = BITMAP_ALLOC (NULL); | |
327 | ||
9771b263 DN |
328 | SESE_PARAMS (region).release (); |
329 | SESE_LOOP_NEST (region).release (); | |
2abae5f1 | 330 | |
2abae5f1 SP |
331 | XDELETE (region); |
332 | } | |
333 | ||
334 | /* Add exit phis for USE on EXIT. */ | |
335 | ||
336 | static void | |
337 | sese_add_exit_phis_edge (basic_block exit, tree use, edge false_e, edge true_e) | |
338 | { | |
dcc748dd RG |
339 | gimple phi = create_phi_node (NULL_TREE, exit); |
340 | create_new_def_for (use, phi, gimple_phi_result_ptr (phi)); | |
9e227d60 DC |
341 | add_phi_arg (phi, use, false_e, UNKNOWN_LOCATION); |
342 | add_phi_arg (phi, use, true_e, UNKNOWN_LOCATION); | |
2abae5f1 SP |
343 | } |
344 | ||
345 | /* Insert in the block BB phi nodes for variables defined in REGION | |
346 | and used outside the REGION. The code generation moves REGION in | |
347 | the else clause of an "if (1)" and generates code in the then | |
348 | clause that is at this point empty: | |
349 | ||
350 | | if (1) | |
351 | | empty; | |
352 | | else | |
353 | | REGION; | |
354 | */ | |
355 | ||
356 | void | |
357 | sese_insert_phis_for_liveouts (sese region, basic_block bb, | |
358 | edge false_e, edge true_e) | |
359 | { | |
360 | unsigned i; | |
361 | bitmap_iterator bi; | |
362 | bitmap liveouts = BITMAP_ALLOC (NULL); | |
363 | ||
364 | update_ssa (TODO_update_ssa); | |
365 | ||
366 | sese_build_liveouts (region, liveouts); | |
367 | EXECUTE_IF_SET_IN_BITMAP (liveouts, 0, i, bi) | |
368 | sese_add_exit_phis_edge (bb, ssa_name (i), false_e, true_e); | |
369 | BITMAP_FREE (liveouts); | |
370 | ||
371 | update_ssa (TODO_update_ssa); | |
372 | } | |
373 | ||
2e286fd2 SP |
374 | /* Returns the first successor edge of BB with EDGE_TRUE_VALUE flag set. */ |
375 | ||
376 | edge | |
377 | get_true_edge_from_guard_bb (basic_block bb) | |
378 | { | |
379 | edge e; | |
380 | edge_iterator ei; | |
381 | ||
382 | FOR_EACH_EDGE (e, ei, bb->succs) | |
383 | if (e->flags & EDGE_TRUE_VALUE) | |
384 | return e; | |
385 | ||
386 | gcc_unreachable (); | |
387 | return NULL; | |
388 | } | |
389 | ||
390 | /* Returns the first successor edge of BB with EDGE_TRUE_VALUE flag cleared. */ | |
391 | ||
392 | edge | |
393 | get_false_edge_from_guard_bb (basic_block bb) | |
394 | { | |
395 | edge e; | |
396 | edge_iterator ei; | |
397 | ||
398 | FOR_EACH_EDGE (e, ei, bb->succs) | |
399 | if (!(e->flags & EDGE_TRUE_VALUE)) | |
400 | return e; | |
401 | ||
402 | gcc_unreachable (); | |
403 | return NULL; | |
404 | } | |
405 | ||
32e68db9 | 406 | /* Returns the expression associated to OLD_NAME in RENAME_MAP. */ |
2abae5f1 SP |
407 | |
408 | static tree | |
4a8fb1a1 | 409 | get_rename (rename_map_type rename_map, tree old_name) |
2abae5f1 SP |
410 | { |
411 | struct rename_map_elt_s tmp; | |
4a8fb1a1 | 412 | rename_map_elt_s **slot; |
2abae5f1 | 413 | |
c3382979 | 414 | gcc_assert (TREE_CODE (old_name) == SSA_NAME); |
2abae5f1 | 415 | tmp.old_name = old_name; |
4a8fb1a1 | 416 | slot = rename_map.find_slot (&tmp, NO_INSERT); |
2abae5f1 SP |
417 | |
418 | if (slot && *slot) | |
4a8fb1a1 | 419 | return (*slot)->expr; |
2abae5f1 | 420 | |
2e286fd2 | 421 | return NULL_TREE; |
2abae5f1 SP |
422 | } |
423 | ||
32e68db9 | 424 | /* Register in RENAME_MAP the rename tuple (OLD_NAME, EXPR). */ |
2abae5f1 | 425 | |
2e286fd2 | 426 | static void |
4a8fb1a1 | 427 | set_rename (rename_map_type rename_map, tree old_name, tree expr) |
2abae5f1 SP |
428 | { |
429 | struct rename_map_elt_s tmp; | |
4a8fb1a1 | 430 | rename_map_elt_s **slot; |
2abae5f1 SP |
431 | |
432 | if (old_name == expr) | |
433 | return; | |
434 | ||
435 | tmp.old_name = old_name; | |
4a8fb1a1 | 436 | slot = rename_map.find_slot (&tmp, INSERT); |
2abae5f1 SP |
437 | |
438 | if (!slot) | |
439 | return; | |
440 | ||
04695783 | 441 | free (*slot); |
2abae5f1 SP |
442 | |
443 | *slot = new_rename_map_elt (old_name, expr); | |
444 | } | |
445 | ||
2e286fd2 SP |
446 | /* Renames the scalar uses of the statement COPY, using the |
447 | substitution map RENAME_MAP, inserting the gimplification code at | |
448 | GSI_TGT, for the translation REGION, with the original copied | |
449 | statement in LOOP, and using the induction variable renaming map | |
bd4a54da SP |
450 | IV_MAP. Returns true when something has been renamed. GLOOG_ERROR |
451 | is set when the code generation cannot continue. */ | |
2abae5f1 | 452 | |
fd66ea1a | 453 | static bool |
4a8fb1a1 LC |
454 | rename_uses (gimple copy, rename_map_type rename_map, |
455 | gimple_stmt_iterator *gsi_tgt, | |
9771b263 | 456 | sese region, loop_p loop, vec<tree> iv_map, |
bd4a54da | 457 | bool *gloog_error) |
2abae5f1 | 458 | { |
2abae5f1 | 459 | use_operand_p use_p; |
2e286fd2 | 460 | ssa_op_iter op_iter; |
fd66ea1a | 461 | bool changed = false; |
2abae5f1 | 462 | |
a0dd1502 SP |
463 | if (is_gimple_debug (copy)) |
464 | { | |
465 | if (gimple_debug_bind_p (copy)) | |
466 | gimple_debug_bind_reset_value (copy); | |
ddb555ed JJ |
467 | else if (gimple_debug_source_bind_p (copy)) |
468 | return false; | |
a0dd1502 SP |
469 | else |
470 | gcc_unreachable (); | |
471 | ||
fd66ea1a | 472 | return false; |
a0dd1502 SP |
473 | } |
474 | ||
ea057359 | 475 | FOR_EACH_SSA_USE_OPERAND (use_p, copy, op_iter, SSA_OP_USE) |
2abae5f1 | 476 | { |
2e286fd2 SP |
477 | tree old_name = USE_FROM_PTR (use_p); |
478 | tree new_expr, scev; | |
2abae5f1 SP |
479 | gimple_seq stmts; |
480 | ||
2e286fd2 | 481 | if (TREE_CODE (old_name) != SSA_NAME |
2e286fd2 | 482 | || SSA_NAME_IS_DEFAULT_DEF (old_name)) |
2abae5f1 SP |
483 | continue; |
484 | ||
fd66ea1a | 485 | changed = true; |
2e286fd2 SP |
486 | new_expr = get_rename (rename_map, old_name); |
487 | if (new_expr) | |
2abae5f1 | 488 | { |
2e286fd2 SP |
489 | tree type_old_name = TREE_TYPE (old_name); |
490 | tree type_new_expr = TREE_TYPE (new_expr); | |
a3201927 | 491 | |
2e286fd2 | 492 | if (type_old_name != type_new_expr |
ea057359 | 493 | || TREE_CODE (new_expr) != SSA_NAME) |
a3201927 | 494 | { |
a0dd1502 | 495 | tree var = create_tmp_var (type_old_name, "var"); |
a3201927 | 496 | |
2ad728d2 | 497 | if (!useless_type_conversion_p (type_old_name, type_new_expr)) |
2e286fd2 | 498 | new_expr = fold_convert (type_old_name, new_expr); |
a3201927 | 499 | |
2ad728d2 | 500 | new_expr = force_gimple_operand (new_expr, &stmts, true, var); |
2e286fd2 SP |
501 | gsi_insert_seq_before (gsi_tgt, stmts, GSI_SAME_STMT); |
502 | } | |
2abae5f1 | 503 | |
2e286fd2 SP |
504 | replace_exp (use_p, new_expr); |
505 | continue; | |
2abae5f1 SP |
506 | } |
507 | ||
2e286fd2 | 508 | scev = scalar_evolution_in_region (region, loop, old_name); |
2abae5f1 | 509 | |
2e286fd2 SP |
510 | /* At this point we should know the exact scev for each |
511 | scalar SSA_NAME used in the scop: all the other scalar | |
512 | SSA_NAMEs should have been translated out of SSA using | |
513 | arrays with one element. */ | |
bd4a54da SP |
514 | if (chrec_contains_undetermined (scev)) |
515 | { | |
516 | *gloog_error = true; | |
60cf26cc | 517 | new_expr = build_zero_cst (TREE_TYPE (old_name)); |
bd4a54da | 518 | } |
60cf26cc SP |
519 | else |
520 | new_expr = chrec_apply_map (scev, iv_map); | |
2abae5f1 | 521 | |
2e286fd2 SP |
522 | /* The apply should produce an expression tree containing |
523 | the uses of the new induction variables. We should be | |
524 | able to use new_expr instead of the old_name in the newly | |
525 | generated loop nest. */ | |
bd4a54da SP |
526 | if (chrec_contains_undetermined (new_expr) |
527 | || tree_contains_chrecs (new_expr, NULL)) | |
528 | { | |
529 | *gloog_error = true; | |
60cf26cc | 530 | new_expr = build_zero_cst (TREE_TYPE (old_name)); |
bd4a54da | 531 | } |
60cf26cc SP |
532 | else |
533 | /* Replace the old_name with the new_expr. */ | |
534 | new_expr = force_gimple_operand (unshare_expr (new_expr), &stmts, | |
535 | true, NULL_TREE); | |
b8698a0f | 536 | |
2e286fd2 SP |
537 | gsi_insert_seq_before (gsi_tgt, stmts, GSI_SAME_STMT); |
538 | replace_exp (use_p, new_expr); | |
c8f91fcc | 539 | |
fd66ea1a RG |
540 | if (TREE_CODE (new_expr) == INTEGER_CST |
541 | && is_gimple_assign (copy)) | |
c8f91fcc | 542 | { |
c8f91fcc SP |
543 | tree rhs = gimple_assign_rhs1 (copy); |
544 | ||
c8f91fcc SP |
545 | if (TREE_CODE (rhs) == ADDR_EXPR) |
546 | recompute_tree_invariant_for_addr_expr (rhs); | |
547 | } | |
548 | ||
2e286fd2 | 549 | set_rename (rename_map, old_name, new_expr); |
2abae5f1 | 550 | } |
fd66ea1a RG |
551 | |
552 | return changed; | |
2abae5f1 SP |
553 | } |
554 | ||
2e286fd2 | 555 | /* Duplicates the statements of basic block BB into basic block NEW_BB |
bd4a54da SP |
556 | and compute the new induction variables according to the IV_MAP. |
557 | GLOOG_ERROR is set when the code generation cannot continue. */ | |
2abae5f1 | 558 | |
b8698a0f | 559 | static void |
2e286fd2 | 560 | graphite_copy_stmts_from_block (basic_block bb, basic_block new_bb, |
4a8fb1a1 | 561 | rename_map_type rename_map, |
9771b263 | 562 | vec<tree> iv_map, sese region, |
bd4a54da | 563 | bool *gloog_error) |
2abae5f1 SP |
564 | { |
565 | gimple_stmt_iterator gsi, gsi_tgt; | |
2e286fd2 | 566 | loop_p loop = bb->loop_father; |
2abae5f1 SP |
567 | |
568 | gsi_tgt = gsi_start_bb (new_bb); | |
569 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
570 | { | |
571 | def_operand_p def_p; | |
572 | ssa_op_iter op_iter; | |
2abae5f1 SP |
573 | gimple stmt = gsi_stmt (gsi); |
574 | gimple copy; | |
2e286fd2 SP |
575 | tree lhs; |
576 | ||
577 | /* Do not copy labels or conditions. */ | |
578 | if (gimple_code (stmt) == GIMPLE_LABEL | |
579 | || gimple_code (stmt) == GIMPLE_COND) | |
580 | continue; | |
2abae5f1 | 581 | |
2e286fd2 SP |
582 | /* Do not copy induction variables. */ |
583 | if (is_gimple_assign (stmt) | |
584 | && (lhs = gimple_assign_lhs (stmt)) | |
585 | && TREE_CODE (lhs) == SSA_NAME | |
586 | && is_gimple_reg (lhs) | |
587 | && scev_analyzable_p (lhs, region)) | |
2abae5f1 SP |
588 | continue; |
589 | ||
590 | /* Create a new copy of STMT and duplicate STMT's virtual | |
591 | operands. */ | |
592 | copy = gimple_copy (stmt); | |
593 | gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT); | |
2abae5f1 | 594 | |
1d65f45c | 595 | maybe_duplicate_eh_stmt (copy, stmt); |
2abae5f1 SP |
596 | gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt); |
597 | ||
598 | /* Create new names for all the definitions created by COPY and | |
599 | add replacement mappings for each new name. */ | |
600 | FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS) | |
2e286fd2 SP |
601 | { |
602 | tree old_name = DEF_FROM_PTR (def_p); | |
603 | tree new_name = create_new_def_for (old_name, copy, def_p); | |
32e68db9 | 604 | set_rename (rename_map, old_name, new_name); |
2e286fd2 SP |
605 | } |
606 | ||
bd4a54da SP |
607 | if (rename_uses (copy, rename_map, &gsi_tgt, region, loop, iv_map, |
608 | gloog_error)) | |
59401b92 RG |
609 | { |
610 | gcc_assert (gsi_stmt (gsi_tgt) == copy); | |
611 | fold_stmt_inplace (&gsi_tgt); | |
612 | } | |
2e286fd2 SP |
613 | |
614 | update_stmt (copy); | |
2abae5f1 SP |
615 | } |
616 | } | |
617 | ||
618 | /* Copies BB and includes in the copied BB all the statements that can | |
619 | be reached following the use-def chains from the memory accesses, | |
bd4a54da SP |
620 | and returns the next edge following this new block. GLOOG_ERROR is |
621 | set when the code generation cannot continue. */ | |
b8698a0f | 622 | |
2abae5f1 SP |
623 | edge |
624 | copy_bb_and_scalar_dependences (basic_block bb, sese region, | |
9771b263 | 625 | edge next_e, vec<tree> iv_map, |
bd4a54da | 626 | bool *gloog_error) |
2abae5f1 SP |
627 | { |
628 | basic_block new_bb = split_edge (next_e); | |
4a8fb1a1 LC |
629 | rename_map_type rename_map; |
630 | rename_map.create (10); | |
2abae5f1 SP |
631 | |
632 | next_e = single_succ_edge (new_bb); | |
bd4a54da SP |
633 | graphite_copy_stmts_from_block (bb, new_bb, rename_map, iv_map, region, |
634 | gloog_error); | |
2abae5f1 | 635 | remove_phi_nodes (new_bb); |
4a8fb1a1 | 636 | rename_map.dispose (); |
2abae5f1 SP |
637 | |
638 | return next_e; | |
639 | } | |
640 | ||
641 | /* Returns the outermost loop in SCOP that contains BB. */ | |
642 | ||
643 | struct loop * | |
644 | outermost_loop_in_sese (sese region, basic_block bb) | |
645 | { | |
646 | struct loop *nest; | |
647 | ||
648 | nest = bb->loop_father; | |
649 | while (loop_outer (nest) | |
650 | && loop_in_sese_p (loop_outer (nest), region)) | |
651 | nest = loop_outer (nest); | |
652 | ||
653 | return nest; | |
654 | } | |
655 | ||
656 | /* Sets the false region of an IF_REGION to REGION. */ | |
657 | ||
658 | void | |
659 | if_region_set_false_region (ifsese if_region, sese region) | |
660 | { | |
661 | basic_block condition = if_region_get_condition_block (if_region); | |
662 | edge false_edge = get_false_edge_from_guard_bb (condition); | |
663 | basic_block dummy = false_edge->dest; | |
664 | edge entry_region = SESE_ENTRY (region); | |
665 | edge exit_region = SESE_EXIT (region); | |
666 | basic_block before_region = entry_region->src; | |
667 | basic_block last_in_region = exit_region->src; | |
668 | void **slot = htab_find_slot_with_hash (current_loops->exits, exit_region, | |
669 | htab_hash_pointer (exit_region), | |
670 | NO_INSERT); | |
671 | ||
672 | entry_region->flags = false_edge->flags; | |
673 | false_edge->flags = exit_region->flags; | |
674 | ||
675 | redirect_edge_pred (entry_region, condition); | |
676 | redirect_edge_pred (exit_region, before_region); | |
677 | redirect_edge_pred (false_edge, last_in_region); | |
678 | redirect_edge_succ (false_edge, single_succ (dummy)); | |
679 | delete_basic_block (dummy); | |
680 | ||
681 | exit_region->flags = EDGE_FALLTHRU; | |
682 | recompute_all_dominators (); | |
683 | ||
684 | SESE_EXIT (region) = false_edge; | |
8c54631d | 685 | |
04695783 | 686 | free (if_region->false_region); |
2abae5f1 SP |
687 | if_region->false_region = region; |
688 | ||
689 | if (slot) | |
690 | { | |
a9429e29 | 691 | struct loop_exit *loop_exit = ggc_alloc_cleared_loop_exit (); |
2abae5f1 SP |
692 | |
693 | memcpy (loop_exit, *((struct loop_exit **) slot), sizeof (struct loop_exit)); | |
694 | htab_clear_slot (current_loops->exits, slot); | |
695 | ||
696 | slot = htab_find_slot_with_hash (current_loops->exits, false_edge, | |
697 | htab_hash_pointer (false_edge), | |
698 | INSERT); | |
699 | loop_exit->e = false_edge; | |
700 | *slot = loop_exit; | |
701 | false_edge->src->loop_father->exits->next = loop_exit; | |
702 | } | |
703 | } | |
704 | ||
705 | /* Creates an IFSESE with CONDITION on edge ENTRY. */ | |
706 | ||
086058c2 | 707 | static ifsese |
2abae5f1 SP |
708 | create_if_region_on_edge (edge entry, tree condition) |
709 | { | |
710 | edge e; | |
711 | edge_iterator ei; | |
8c54631d SP |
712 | sese sese_region = XNEW (struct sese_s); |
713 | sese true_region = XNEW (struct sese_s); | |
714 | sese false_region = XNEW (struct sese_s); | |
715 | ifsese if_region = XNEW (struct ifsese_s); | |
2abae5f1 SP |
716 | edge exit = create_empty_if_region_on_edge (entry, condition); |
717 | ||
718 | if_region->region = sese_region; | |
719 | if_region->region->entry = entry; | |
720 | if_region->region->exit = exit; | |
721 | ||
722 | FOR_EACH_EDGE (e, ei, entry->dest->succs) | |
723 | { | |
724 | if (e->flags & EDGE_TRUE_VALUE) | |
725 | { | |
726 | true_region->entry = e; | |
727 | true_region->exit = single_succ_edge (e->dest); | |
728 | if_region->true_region = true_region; | |
729 | } | |
730 | else if (e->flags & EDGE_FALSE_VALUE) | |
731 | { | |
732 | false_region->entry = e; | |
733 | false_region->exit = single_succ_edge (e->dest); | |
734 | if_region->false_region = false_region; | |
735 | } | |
736 | } | |
737 | ||
738 | return if_region; | |
739 | } | |
740 | ||
741 | /* Moves REGION in a condition expression: | |
742 | | if (1) | |
743 | | ; | |
744 | | else | |
745 | | REGION; | |
746 | */ | |
747 | ||
748 | ifsese | |
749 | move_sese_in_condition (sese region) | |
750 | { | |
751 | basic_block pred_block = split_edge (SESE_ENTRY (region)); | |
8c54631d | 752 | ifsese if_region; |
2abae5f1 SP |
753 | |
754 | SESE_ENTRY (region) = single_succ_edge (pred_block); | |
755 | if_region = create_if_region_on_edge (single_pred_edge (pred_block), integer_one_node); | |
756 | if_region_set_false_region (if_region, region); | |
757 | ||
758 | return if_region; | |
759 | } | |
760 | ||
3c7c0158 SP |
761 | /* Replaces the condition of the IF_REGION with CONDITION: |
762 | | if (CONDITION) | |
763 | | true_region; | |
764 | | else | |
765 | | false_region; | |
766 | */ | |
767 | ||
768 | void | |
769 | set_ifsese_condition (ifsese if_region, tree condition) | |
770 | { | |
771 | sese region = if_region->region; | |
772 | edge entry = region->entry; | |
773 | basic_block bb = entry->dest; | |
774 | gimple last = last_stmt (bb); | |
775 | gimple_stmt_iterator gsi = gsi_last_bb (bb); | |
776 | gimple cond_stmt; | |
777 | ||
778 | gcc_assert (gimple_code (last) == GIMPLE_COND); | |
779 | ||
780 | gsi_remove (&gsi, true); | |
781 | gsi = gsi_last_bb (bb); | |
782 | condition = force_gimple_operand_gsi (&gsi, condition, true, NULL, | |
783 | false, GSI_NEW_STMT); | |
784 | cond_stmt = gimple_build_cond_from_tree (condition, NULL_TREE, NULL_TREE); | |
785 | gsi = gsi_last_bb (bb); | |
786 | gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT); | |
787 | } | |
788 | ||
2abae5f1 SP |
789 | /* Returns the scalar evolution of T in REGION. Every variable that |
790 | is not defined in the REGION is considered a parameter. */ | |
791 | ||
792 | tree | |
793 | scalar_evolution_in_region (sese region, loop_p loop, tree t) | |
794 | { | |
795 | gimple def; | |
796 | struct loop *def_loop; | |
797 | basic_block before = block_before_sese (region); | |
798 | ||
05575a46 SP |
799 | /* SCOP parameters. */ |
800 | if (TREE_CODE (t) == SSA_NAME | |
801 | && !defined_in_sese_p (t, region)) | |
802 | return t; | |
803 | ||
2abae5f1 SP |
804 | if (TREE_CODE (t) != SSA_NAME |
805 | || loop_in_sese_p (loop, region)) | |
806 | return instantiate_scev (before, loop, | |
807 | analyze_scalar_evolution (loop, t)); | |
808 | ||
2abae5f1 SP |
809 | def = SSA_NAME_DEF_STMT (t); |
810 | def_loop = loop_containing_stmt (def); | |
811 | ||
812 | if (loop_in_sese_p (def_loop, region)) | |
813 | { | |
814 | t = analyze_scalar_evolution (def_loop, t); | |
815 | def_loop = superloop_at_depth (def_loop, loop_depth (loop) + 1); | |
816 | t = compute_overall_effect_of_inner_loop (def_loop, t); | |
817 | return t; | |
818 | } | |
819 | else | |
820 | return instantiate_scev (before, loop, t); | |
821 | } |