]>
Commit | Line | Data |
---|---|---|
9fa26457 | 1 | /* Loop optimizer initialization routines and RTL loop optimization passes. |
aeee4812 | 2 | Copyright (C) 2002-2023 Free Software Foundation, Inc. |
617b465c ZD |
3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify it under | |
7 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 8 | Software Foundation; either version 3, or (at your option) any later |
617b465c ZD |
9 | version. |
10 | ||
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
617b465c ZD |
19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
c7131fb2 | 23 | #include "backend.h" |
957060b5 | 24 | #include "target.h" |
617b465c | 25 | #include "rtl.h" |
957060b5 AM |
26 | #include "tree.h" |
27 | #include "cfghooks.h" | |
c7131fb2 | 28 | #include "df.h" |
532aafad | 29 | #include "regs.h" |
60393bbc | 30 | #include "cfgcleanup.h" |
617b465c | 31 | #include "cfgloop.h" |
ef330312 | 32 | #include "tree-pass.h" |
e28030cf | 33 | #include "tree-ssa-loop-niter.h" |
dd637013 | 34 | #include "loop-unroll.h" |
b0dd8c90 | 35 | #include "tree-scalar-evolution.h" |
d87ee7f1 | 36 | #include "tree-cfgcleanup.h" |
617b465c | 37 | |
9fa26457 | 38 | \f |
0375167b | 39 | /* Apply FLAGS to the loop state. */ |
617b465c | 40 | |
0375167b RB |
41 | static void |
42 | apply_loop_flags (unsigned flags) | |
617b465c | 43 | { |
89f8f30f ZD |
44 | if (flags & LOOPS_MAY_HAVE_MULTIPLE_LATCHES) |
45 | { | |
46 | /* If the loops may have multiple latches, we cannot canonicalize | |
47 | them further (and most of the loop manipulation functions will | |
48 | not work). However, we avoid modifying cfg, which some | |
49 | passes may want. */ | |
50 | gcc_assert ((flags & ~(LOOPS_MAY_HAVE_MULTIPLE_LATCHES | |
dfef1164 RB |
51 | | LOOPS_HAVE_RECORDED_EXITS |
52 | | LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS)) == 0); | |
f87000d0 | 53 | loops_state_set (LOOPS_MAY_HAVE_MULTIPLE_LATCHES); |
89f8f30f ZD |
54 | } |
55 | else | |
56 | disambiguate_loops_with_multiple_latches (); | |
57 | ||
617b465c | 58 | /* Create pre-headers. */ |
d78f3f78 | 59 | if (flags & LOOPS_HAVE_PREHEADERS) |
e855c69d AB |
60 | { |
61 | int cp_flags = CP_SIMPLE_PREHEADERS; | |
62 | ||
63 | if (flags & LOOPS_HAVE_FALLTHRU_PREHEADERS) | |
64 | cp_flags |= CP_FALLTHRU_PREHEADERS; | |
b8698a0f | 65 | |
e855c69d AB |
66 | create_preheaders (cp_flags); |
67 | } | |
617b465c ZD |
68 | |
69 | /* Force all latches to have only single successor. */ | |
d78f3f78 | 70 | if (flags & LOOPS_HAVE_SIMPLE_LATCHES) |
d73be268 | 71 | force_single_succ_latches (); |
617b465c ZD |
72 | |
73 | /* Mark irreducible loops. */ | |
d78f3f78 | 74 | if (flags & LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS) |
d73be268 | 75 | mark_irreducible_loops (); |
d78f3f78 | 76 | |
6270df4c ZD |
77 | if (flags & LOOPS_HAVE_RECORDED_EXITS) |
78 | record_loop_exits (); | |
0375167b RB |
79 | } |
80 | ||
81 | /* Initialize loop structures. This is used by the tree and RTL loop | |
82 | optimizers. FLAGS specify what properties to compute and/or ensure for | |
83 | loops. */ | |
84 | ||
85 | void | |
86 | loop_optimizer_init (unsigned flags) | |
87 | { | |
88 | timevar_push (TV_LOOP_INIT); | |
89 | ||
90 | if (!current_loops) | |
91 | { | |
92 | gcc_assert (!(cfun->curr_properties & PROP_loops)); | |
93 | ||
94 | /* Find the loops. */ | |
95 | current_loops = flow_loops_find (NULL); | |
96 | } | |
97 | else | |
98 | { | |
a9e0d843 | 99 | bool recorded_exits = loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS); |
92562f88 | 100 | bool needs_fixup = loops_state_satisfies_p (LOOPS_NEED_FIXUP); |
a9e0d843 | 101 | |
0375167b RB |
102 | gcc_assert (cfun->curr_properties & PROP_loops); |
103 | ||
104 | /* Ensure that the dominators are computed, like flow_loops_find does. */ | |
105 | calculate_dominance_info (CDI_DOMINATORS); | |
106 | ||
92562f88 | 107 | if (!needs_fixup) |
b2b29377 | 108 | checking_verify_loop_structure (); |
c1874a87 RB |
109 | |
110 | /* Clear all flags. */ | |
a9e0d843 | 111 | if (recorded_exits) |
61183076 | 112 | release_recorded_exits (cfun); |
c1874a87 | 113 | loops_state_clear (~0U); |
92562f88 RB |
114 | |
115 | if (needs_fixup) | |
116 | { | |
117 | /* Apply LOOPS_MAY_HAVE_MULTIPLE_LATCHES early as fix_loop_structure | |
118 | re-applies flags. */ | |
119 | loops_state_set (flags & LOOPS_MAY_HAVE_MULTIPLE_LATCHES); | |
120 | fix_loop_structure (NULL); | |
121 | } | |
0375167b RB |
122 | } |
123 | ||
124 | /* Apply flags to loops. */ | |
125 | apply_loop_flags (flags); | |
617b465c ZD |
126 | |
127 | /* Dump loops. */ | |
d73be268 | 128 | flow_loops_dump (dump_file, NULL, 1); |
617b465c | 129 | |
b2b29377 | 130 | checking_verify_loop_structure (); |
63ef63bf SB |
131 | |
132 | timevar_pop (TV_LOOP_INIT); | |
617b465c ZD |
133 | } |
134 | ||
598ec7bd ZD |
135 | /* Finalize loop structures. */ |
136 | ||
617b465c | 137 | void |
d87ee7f1 | 138 | loop_optimizer_finalize (struct function *fn, bool clean_loop_closed_phi) |
617b465c | 139 | { |
598ec7bd | 140 | basic_block bb; |
617b465c | 141 | |
63ef63bf SB |
142 | timevar_push (TV_LOOP_FINI); |
143 | ||
d87ee7f1 | 144 | if (clean_loop_closed_phi && loops_state_satisfies_p (fn, LOOP_CLOSED_SSA)) |
145 | { | |
146 | clean_up_loop_closed_phi (fn); | |
147 | loops_state_clear (fn, LOOP_CLOSED_SSA); | |
148 | } | |
149 | ||
61183076 RB |
150 | if (loops_state_satisfies_p (fn, LOOPS_HAVE_RECORDED_EXITS)) |
151 | release_recorded_exits (fn); | |
7d776ee2 | 152 | |
61183076 | 153 | free_numbers_of_iterations_estimates (fn); |
ea78906a | 154 | |
7d776ee2 RG |
155 | /* If we should preserve loop structure, do not free it but clear |
156 | flags that advanced properties are there as we are not preserving | |
157 | that in full. */ | |
61183076 | 158 | if (fn->curr_properties & PROP_loops) |
7d776ee2 | 159 | { |
61183076 | 160 | loops_state_clear (fn, LOOP_CLOSED_SSA |
7d776ee2 RG |
161 | | LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS |
162 | | LOOPS_HAVE_PREHEADERS | |
163 | | LOOPS_HAVE_SIMPLE_LATCHES | |
164 | | LOOPS_HAVE_FALLTHRU_PREHEADERS); | |
61183076 | 165 | loops_state_set (fn, LOOPS_MAY_HAVE_MULTIPLE_LATCHES); |
63ef63bf | 166 | goto loop_fini_done; |
7d776ee2 RG |
167 | } |
168 | ||
e41ba804 | 169 | for (auto loop : loops_list (fn, 0)) |
f0bd40b1 | 170 | free_simple_loop_desc (loop); |
617b465c | 171 | |
617b465c | 172 | /* Clean up. */ |
61183076 RB |
173 | flow_loops_free (loops_for_fn (fn)); |
174 | ggc_free (loops_for_fn (fn)); | |
175 | set_loops_for_fn (fn, NULL); | |
598ec7bd | 176 | |
61183076 | 177 | FOR_ALL_BB_FN (bb, fn) |
598ec7bd ZD |
178 | { |
179 | bb->loop_father = NULL; | |
180 | } | |
63ef63bf SB |
181 | |
182 | loop_fini_done: | |
183 | timevar_pop (TV_LOOP_FINI); | |
617b465c | 184 | } |
9fa26457 | 185 | |
0375167b RB |
186 | /* The structure of loops might have changed. Some loops might get removed |
187 | (and their headers and latches were set to NULL), loop exists might get | |
188 | removed (thus the loop nesting may be wrong), and some blocks and edges | |
189 | were changed (so the information about bb --> loop mapping does not have | |
190 | to be correct). But still for the remaining loops the header dominates | |
191 | the latch, and loops did not get new subloops (new loops might possibly | |
192 | get created, but we are not interested in them). Fix up the mess. | |
193 | ||
8e89b5b5 RB |
194 | If CHANGED_BBS is not NULL, basic blocks whose loop depth has changed are |
195 | marked in it. | |
0375167b | 196 | |
b55284f4 | 197 | Returns the number of new discovered plus the number of removed loops. */ |
8e89b5b5 RB |
198 | |
199 | unsigned | |
0375167b RB |
200 | fix_loop_structure (bitmap changed_bbs) |
201 | { | |
202 | basic_block bb; | |
203 | int record_exits = 0; | |
5e7f1aef | 204 | unsigned old_nloops, i; |
0375167b RB |
205 | |
206 | timevar_push (TV_LOOP_INIT); | |
207 | ||
b0dd8c90 RB |
208 | if (dump_file && (dump_flags & TDF_DETAILS)) |
209 | fprintf (dump_file, "fix_loop_structure: fixing up loops for function\n"); | |
210 | ||
0375167b RB |
211 | /* We need exact and fast dominance info to be available. */ |
212 | gcc_assert (dom_info_state (CDI_DOMINATORS) == DOM_OK); | |
213 | ||
214 | if (loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS)) | |
215 | { | |
61183076 | 216 | release_recorded_exits (cfun); |
0375167b RB |
217 | record_exits = LOOPS_HAVE_RECORDED_EXITS; |
218 | } | |
219 | ||
220 | /* Remember the depth of the blocks in the loop hierarchy, so that we can | |
221 | recognize blocks whose loop nesting relationship has changed. */ | |
222 | if (changed_bbs) | |
11cd3bed | 223 | FOR_EACH_BB_FN (bb, cfun) |
0375167b RB |
224 | bb->aux = (void *) (size_t) loop_depth (bb->loop_father); |
225 | ||
226 | /* Remove the dead loops from structures. We start from the innermost | |
227 | loops, so that when we remove the loops, we know that the loops inside | |
228 | are preserved, and do not waste time relinking loops that will be | |
229 | removed later. */ | |
e41ba804 | 230 | for (auto loop : loops_list (cfun, LI_FROM_INNERMOST)) |
0375167b RB |
231 | { |
232 | /* Detect the case that the loop is no longer present even though | |
233 | it wasn't marked for removal. | |
234 | ??? If we do that we can get away with not marking loops for | |
235 | removal at all. And possibly avoid some spurious removals. */ | |
236 | if (loop->header | |
237 | && bb_loop_header_p (loop->header)) | |
238 | continue; | |
239 | ||
240 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
241 | fprintf (dump_file, "fix_loop_structure: removing loop %d\n", | |
242 | loop->num); | |
243 | ||
244 | while (loop->inner) | |
245 | { | |
99b1c316 | 246 | class loop *ploop = loop->inner; |
0375167b RB |
247 | flow_loop_tree_node_remove (ploop); |
248 | flow_loop_tree_node_add (loop_outer (loop), ploop); | |
249 | } | |
250 | ||
5e7f1aef | 251 | /* Remove the loop. */ |
e4ca2139 RB |
252 | if (loop->header) |
253 | loop->former_header = loop->header; | |
254 | else | |
255 | gcc_assert (loop->former_header != NULL); | |
5e7f1aef RB |
256 | loop->header = NULL; |
257 | flow_loop_tree_node_remove (loop); | |
0375167b RB |
258 | } |
259 | ||
8e89b5b5 RB |
260 | /* Remember the number of loops so we can return how many new loops |
261 | flow_loops_find discovered. */ | |
0fc822d0 | 262 | old_nloops = number_of_loops (cfun); |
8e89b5b5 | 263 | |
0375167b RB |
264 | /* Re-compute loop structure in-place. */ |
265 | flow_loops_find (current_loops); | |
266 | ||
267 | /* Mark the blocks whose loop has changed. */ | |
268 | if (changed_bbs) | |
269 | { | |
11cd3bed | 270 | FOR_EACH_BB_FN (bb, cfun) |
0375167b RB |
271 | { |
272 | if ((void *) (size_t) loop_depth (bb->loop_father) != bb->aux) | |
273 | bitmap_set_bit (changed_bbs, bb->index); | |
274 | ||
275 | bb->aux = NULL; | |
276 | } | |
277 | } | |
278 | ||
5e7f1aef | 279 | /* Finally free deleted loops. */ |
b55284f4 | 280 | unsigned n_deleted = 0; |
9e026da7 | 281 | class loop *loop; |
0fc822d0 | 282 | FOR_EACH_VEC_ELT (*get_loops (cfun), i, loop) |
5e7f1aef RB |
283 | if (loop && loop->header == NULL) |
284 | { | |
e4ca2139 RB |
285 | if (dump_file |
286 | && ((unsigned) loop->former_header->index | |
287 | < basic_block_info_for_fn (cfun)->length ())) | |
288 | { | |
289 | basic_block former_header | |
290 | = BASIC_BLOCK_FOR_FN (cfun, loop->former_header->index); | |
291 | /* If the old header still exists we want to check if the | |
292 | original loop is re-discovered or the old header is now | |
293 | part of a newly discovered loop. | |
294 | In both cases we should have avoided removing the loop. */ | |
295 | if (former_header == loop->former_header) | |
296 | { | |
297 | if (former_header->loop_father->header == former_header) | |
298 | fprintf (dump_file, "fix_loop_structure: rediscovered " | |
299 | "removed loop %d as loop %d with old header %d\n", | |
300 | loop->num, former_header->loop_father->num, | |
301 | former_header->index); | |
302 | else if ((unsigned) former_header->loop_father->num | |
303 | >= old_nloops) | |
304 | fprintf (dump_file, "fix_loop_structure: header %d of " | |
305 | "removed loop %d is part of the newly " | |
306 | "discovered loop %d with header %d\n", | |
307 | former_header->index, loop->num, | |
308 | former_header->loop_father->num, | |
309 | former_header->loop_father->header->index); | |
310 | } | |
311 | } | |
0fc822d0 | 312 | (*get_loops (cfun))[i] = NULL; |
5e7f1aef | 313 | flow_loop_free (loop); |
b55284f4 | 314 | n_deleted++; |
5e7f1aef RB |
315 | } |
316 | ||
b0dd8c90 RB |
317 | /* If we deleted loops then the cached scalar evolutions refering to |
318 | those loops become invalid. */ | |
b55284f4 | 319 | if (n_deleted > 0 && scev_initialized_p ()) |
b0dd8c90 RB |
320 | scev_reset_htab (); |
321 | ||
0375167b RB |
322 | loops_state_clear (LOOPS_NEED_FIXUP); |
323 | ||
324 | /* Apply flags to loops. */ | |
325 | apply_loop_flags (current_loops->state | record_exits); | |
326 | ||
b2b29377 | 327 | checking_verify_loop_structure (); |
0375167b RB |
328 | |
329 | timevar_pop (TV_LOOP_INIT); | |
8e89b5b5 | 330 | |
b55284f4 | 331 | return number_of_loops (cfun) - old_nloops + n_deleted; |
0375167b | 332 | } |
ef330312 | 333 | \f |
e53b6e56 | 334 | /* The RTL loop superpass. The actual passes are subpasses. See passes.cc for |
1a3d085c | 335 | more on that. */ |
ef330312 | 336 | |
27a4cd48 DM |
337 | namespace { |
338 | ||
339 | const pass_data pass_data_loop2 = | |
340 | { | |
341 | RTL_PASS, /* type */ | |
342 | "loop2", /* name */ | |
343 | OPTGROUP_LOOP, /* optinfo_flags */ | |
27a4cd48 DM |
344 | TV_LOOP, /* tv_id */ |
345 | 0, /* properties_required */ | |
346 | 0, /* properties_provided */ | |
347 | 0, /* properties_destroyed */ | |
348 | 0, /* todo_flags_start */ | |
349 | 0, /* todo_flags_finish */ | |
9fa26457 | 350 | }; |
ef330312 | 351 | |
27a4cd48 DM |
352 | class pass_loop2 : public rtl_opt_pass |
353 | { | |
354 | public: | |
c3284718 RS |
355 | pass_loop2 (gcc::context *ctxt) |
356 | : rtl_opt_pass (pass_data_loop2, ctxt) | |
27a4cd48 DM |
357 | {} |
358 | ||
359 | /* opt_pass methods: */ | |
725793af | 360 | bool gate (function *) final override; |
27a4cd48 DM |
361 | |
362 | }; // class pass_loop2 | |
363 | ||
1a3d085c TS |
364 | bool |
365 | pass_loop2::gate (function *fun) | |
366 | { | |
367 | if (optimize > 0 | |
368 | && (flag_move_loop_invariants | |
369 | || flag_unswitch_loops | |
1a3d085c | 370 | || flag_unroll_loops |
ac9effed EB |
371 | || (flag_branch_on_count_reg && targetm.have_doloop_end ()) |
372 | || cfun->has_unroll)) | |
1a3d085c TS |
373 | return true; |
374 | else | |
375 | { | |
376 | /* No longer preserve loops, remove them now. */ | |
377 | fun->curr_properties &= ~PROP_loops; | |
378 | if (current_loops) | |
379 | loop_optimizer_finalize (); | |
380 | return false; | |
381 | } | |
382 | } | |
383 | ||
27a4cd48 DM |
384 | } // anon namespace |
385 | ||
386 | rtl_opt_pass * | |
387 | make_pass_loop2 (gcc::context *ctxt) | |
388 | { | |
389 | return new pass_loop2 (ctxt); | |
390 | } | |
391 | ||
9fa26457 SB |
392 | \f |
393 | /* Initialization of the RTL loop passes. */ | |
c2924966 | 394 | static unsigned int |
9fa26457 SB |
395 | rtl_loop_init (void) |
396 | { | |
ad21dab7 | 397 | gcc_assert (current_ir_type () == IR_RTL_CFGLAYOUT); |
b8698a0f | 398 | |
ef330312 | 399 | if (dump_file) |
532aafad SB |
400 | { |
401 | dump_reg_info (dump_file); | |
402 | dump_flow_info (dump_file, dump_flags); | |
403 | } | |
ef330312 | 404 | |
46bd784b | 405 | loop_optimizer_init (LOOPS_NORMAL | LOOPS_HAVE_RECORDED_EXITS); |
c2924966 | 406 | return 0; |
9fa26457 | 407 | } |
ef330312 | 408 | |
27a4cd48 DM |
409 | namespace { |
410 | ||
411 | const pass_data pass_data_rtl_loop_init = | |
412 | { | |
413 | RTL_PASS, /* type */ | |
414 | "loop2_init", /* name */ | |
415 | OPTGROUP_LOOP, /* optinfo_flags */ | |
27a4cd48 DM |
416 | TV_LOOP, /* tv_id */ |
417 | 0, /* properties_required */ | |
418 | 0, /* properties_provided */ | |
419 | 0, /* properties_destroyed */ | |
420 | 0, /* todo_flags_start */ | |
3bea341f | 421 | 0, /* todo_flags_finish */ |
9fa26457 | 422 | }; |
ef330312 | 423 | |
27a4cd48 DM |
424 | class pass_rtl_loop_init : public rtl_opt_pass |
425 | { | |
426 | public: | |
c3284718 RS |
427 | pass_rtl_loop_init (gcc::context *ctxt) |
428 | : rtl_opt_pass (pass_data_rtl_loop_init, ctxt) | |
27a4cd48 DM |
429 | {} |
430 | ||
431 | /* opt_pass methods: */ | |
725793af | 432 | unsigned int execute (function *) final override { return rtl_loop_init (); } |
27a4cd48 DM |
433 | |
434 | }; // class pass_rtl_loop_init | |
435 | ||
436 | } // anon namespace | |
437 | ||
438 | rtl_opt_pass * | |
439 | make_pass_rtl_loop_init (gcc::context *ctxt) | |
440 | { | |
441 | return new pass_rtl_loop_init (ctxt); | |
442 | } | |
443 | ||
9fa26457 SB |
444 | \f |
445 | /* Finalization of the RTL loop passes. */ | |
598ec7bd | 446 | |
27a4cd48 DM |
447 | namespace { |
448 | ||
449 | const pass_data pass_data_rtl_loop_done = | |
450 | { | |
451 | RTL_PASS, /* type */ | |
452 | "loop2_done", /* name */ | |
453 | OPTGROUP_LOOP, /* optinfo_flags */ | |
27a4cd48 DM |
454 | TV_LOOP, /* tv_id */ |
455 | 0, /* properties_required */ | |
456 | 0, /* properties_provided */ | |
457 | PROP_loops, /* properties_destroyed */ | |
458 | 0, /* todo_flags_start */ | |
3bea341f | 459 | 0, /* todo_flags_finish */ |
9fa26457 SB |
460 | }; |
461 | ||
27a4cd48 DM |
462 | class pass_rtl_loop_done : public rtl_opt_pass |
463 | { | |
464 | public: | |
c3284718 RS |
465 | pass_rtl_loop_done (gcc::context *ctxt) |
466 | : rtl_opt_pass (pass_data_rtl_loop_done, ctxt) | |
27a4cd48 DM |
467 | {} |
468 | ||
469 | /* opt_pass methods: */ | |
725793af | 470 | unsigned int execute (function *) final override; |
27a4cd48 DM |
471 | |
472 | }; // class pass_rtl_loop_done | |
473 | ||
be55bfe6 TS |
474 | unsigned int |
475 | pass_rtl_loop_done::execute (function *fun) | |
476 | { | |
477 | /* No longer preserve loops, remove them now. */ | |
478 | fun->curr_properties &= ~PROP_loops; | |
479 | loop_optimizer_finalize (); | |
480 | free_dominance_info (CDI_DOMINATORS); | |
481 | ||
482 | cleanup_cfg (0); | |
483 | if (dump_file) | |
484 | { | |
485 | dump_reg_info (dump_file); | |
486 | dump_flow_info (dump_file, dump_flags); | |
487 | } | |
488 | ||
489 | return 0; | |
490 | } | |
491 | ||
27a4cd48 DM |
492 | } // anon namespace |
493 | ||
494 | rtl_opt_pass * | |
495 | make_pass_rtl_loop_done (gcc::context *ctxt) | |
496 | { | |
497 | return new pass_rtl_loop_done (ctxt); | |
498 | } | |
499 | ||
9fa26457 SB |
500 | \f |
501 | /* Loop invariant code motion. */ | |
9fa26457 | 502 | |
27a4cd48 DM |
503 | namespace { |
504 | ||
505 | const pass_data pass_data_rtl_move_loop_invariants = | |
506 | { | |
507 | RTL_PASS, /* type */ | |
508 | "loop2_invariant", /* name */ | |
509 | OPTGROUP_LOOP, /* optinfo_flags */ | |
27a4cd48 DM |
510 | TV_LOOP_MOVE_INVARIANTS, /* tv_id */ |
511 | 0, /* properties_required */ | |
512 | 0, /* properties_provided */ | |
513 | 0, /* properties_destroyed */ | |
514 | 0, /* todo_flags_start */ | |
3bea341f | 515 | ( TODO_df_verify | TODO_df_finish ), /* todo_flags_finish */ |
9fa26457 SB |
516 | }; |
517 | ||
27a4cd48 DM |
518 | class pass_rtl_move_loop_invariants : public rtl_opt_pass |
519 | { | |
520 | public: | |
c3284718 RS |
521 | pass_rtl_move_loop_invariants (gcc::context *ctxt) |
522 | : rtl_opt_pass (pass_data_rtl_move_loop_invariants, ctxt) | |
27a4cd48 DM |
523 | {} |
524 | ||
525 | /* opt_pass methods: */ | |
725793af DM |
526 | bool gate (function *) final override { return flag_move_loop_invariants; } |
527 | unsigned int execute (function *fun) final override | |
be55bfe6 TS |
528 | { |
529 | if (number_of_loops (fun) > 1) | |
530 | move_loop_invariants (); | |
531 | return 0; | |
532 | } | |
27a4cd48 DM |
533 | |
534 | }; // class pass_rtl_move_loop_invariants | |
535 | ||
536 | } // anon namespace | |
537 | ||
538 | rtl_opt_pass * | |
539 | make_pass_rtl_move_loop_invariants (gcc::context *ctxt) | |
540 | { | |
541 | return new pass_rtl_move_loop_invariants (ctxt); | |
542 | } | |
543 | ||
9fa26457 | 544 | \f |
27a4cd48 DM |
545 | namespace { |
546 | ||
f8934be7 | 547 | const pass_data pass_data_rtl_unroll_loops = |
27a4cd48 DM |
548 | { |
549 | RTL_PASS, /* type */ | |
550 | "loop2_unroll", /* name */ | |
551 | OPTGROUP_LOOP, /* optinfo_flags */ | |
27a4cd48 DM |
552 | TV_LOOP_UNROLL, /* tv_id */ |
553 | 0, /* properties_required */ | |
554 | 0, /* properties_provided */ | |
555 | 0, /* properties_destroyed */ | |
556 | 0, /* todo_flags_start */ | |
3bea341f | 557 | 0, /* todo_flags_finish */ |
9fa26457 SB |
558 | }; |
559 | ||
f8934be7 | 560 | class pass_rtl_unroll_loops : public rtl_opt_pass |
27a4cd48 DM |
561 | { |
562 | public: | |
f8934be7 JH |
563 | pass_rtl_unroll_loops (gcc::context *ctxt) |
564 | : rtl_opt_pass (pass_data_rtl_unroll_loops, ctxt) | |
27a4cd48 DM |
565 | {} |
566 | ||
567 | /* opt_pass methods: */ | |
8caf155a | 568 | bool gate (function *) final override |
1a3d085c | 569 | { |
8caf155a HW |
570 | return (flag_unroll_loops || flag_unroll_all_loops |
571 | || cfun->has_unroll); | |
1a3d085c TS |
572 | } |
573 | ||
725793af | 574 | unsigned int execute (function *) final override; |
27a4cd48 | 575 | |
f8934be7 | 576 | }; // class pass_rtl_unroll_loops |
27a4cd48 | 577 | |
be55bfe6 | 578 | unsigned int |
f8934be7 | 579 | pass_rtl_unroll_loops::execute (function *fun) |
be55bfe6 TS |
580 | { |
581 | if (number_of_loops (fun) > 1) | |
582 | { | |
583 | int flags = 0; | |
584 | if (dump_file) | |
585 | df_dump (dump_file); | |
586 | ||
8caf155a | 587 | if (flag_unroll_loops) |
be55bfe6 TS |
588 | flags |= UAP_UNROLL; |
589 | if (flag_unroll_all_loops) | |
590 | flags |= UAP_UNROLL_ALL; | |
591 | ||
f8934be7 | 592 | unroll_loops (flags); |
be55bfe6 TS |
593 | } |
594 | return 0; | |
595 | } | |
596 | ||
27a4cd48 DM |
597 | } // anon namespace |
598 | ||
599 | rtl_opt_pass * | |
f8934be7 | 600 | make_pass_rtl_unroll_loops (gcc::context *ctxt) |
27a4cd48 | 601 | { |
f8934be7 | 602 | return new pass_rtl_unroll_loops (ctxt); |
27a4cd48 DM |
603 | } |
604 | ||
9fa26457 | 605 | \f |
27a4cd48 DM |
606 | namespace { |
607 | ||
608 | const pass_data pass_data_rtl_doloop = | |
609 | { | |
610 | RTL_PASS, /* type */ | |
611 | "loop2_doloop", /* name */ | |
612 | OPTGROUP_LOOP, /* optinfo_flags */ | |
27a4cd48 DM |
613 | TV_LOOP_DOLOOP, /* tv_id */ |
614 | 0, /* properties_required */ | |
615 | 0, /* properties_provided */ | |
616 | 0, /* properties_destroyed */ | |
617 | 0, /* todo_flags_start */ | |
3bea341f | 618 | 0, /* todo_flags_finish */ |
ef330312 | 619 | }; |
27a4cd48 DM |
620 | |
621 | class pass_rtl_doloop : public rtl_opt_pass | |
622 | { | |
623 | public: | |
c3284718 RS |
624 | pass_rtl_doloop (gcc::context *ctxt) |
625 | : rtl_opt_pass (pass_data_rtl_doloop, ctxt) | |
27a4cd48 DM |
626 | {} |
627 | ||
628 | /* opt_pass methods: */ | |
725793af DM |
629 | bool gate (function *) final override; |
630 | unsigned int execute (function *) final override; | |
27a4cd48 DM |
631 | |
632 | }; // class pass_rtl_doloop | |
633 | ||
1a3d085c TS |
634 | bool |
635 | pass_rtl_doloop::gate (function *) | |
636 | { | |
89f7b21f | 637 | return (flag_branch_on_count_reg && targetm.have_doloop_end ()); |
1a3d085c TS |
638 | } |
639 | ||
be55bfe6 | 640 | unsigned int |
89f7b21f | 641 | pass_rtl_doloop::execute (function *fun) |
be55bfe6 | 642 | { |
be55bfe6 TS |
643 | if (number_of_loops (fun) > 1) |
644 | doloop_optimize_loops (); | |
be55bfe6 TS |
645 | return 0; |
646 | } | |
647 | ||
27a4cd48 DM |
648 | } // anon namespace |
649 | ||
650 | rtl_opt_pass * | |
651 | make_pass_rtl_doloop (gcc::context *ctxt) | |
652 | { | |
653 | return new pass_rtl_doloop (ctxt); | |
654 | } |