]>
Commit | Line | Data |
---|---|---|
9d9c740d BS |
1 | /* Code to analyze doloop loops in order for targets to perform late |
2 | optimizations converting doloops to other forms of hardware loops. | |
23a5b65a | 3 | Copyright (C) 2011-2014 Free Software Foundation, Inc. |
9d9c740d BS |
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 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
24 | #include "tm.h" | |
25 | #include "rtl.h" | |
26 | #include "flags.h" | |
27 | #include "expr.h" | |
28 | #include "hard-reg-set.h" | |
29 | #include "regs.h" | |
30 | #include "basic-block.h" | |
31 | #include "tm_p.h" | |
32 | #include "df.h" | |
9d9c740d | 33 | #include "cfgloop.h" |
9d9c740d BS |
34 | #include "recog.h" |
35 | #include "target.h" | |
36 | #include "hw-doloop.h" | |
7ee2468b | 37 | #include "dumpfile.h" |
9d9c740d BS |
38 | |
39 | #ifdef HAVE_doloop_end | |
40 | ||
41 | /* Dump information collected in LOOPS. */ | |
42 | static void | |
43 | dump_hwloops (hwloop_info loops) | |
44 | { | |
45 | hwloop_info loop; | |
46 | ||
47 | for (loop = loops; loop; loop = loop->next) | |
48 | { | |
49 | hwloop_info i; | |
50 | basic_block b; | |
51 | unsigned ix; | |
52 | ||
53 | fprintf (dump_file, ";; loop %d: ", loop->loop_no); | |
54 | if (loop->bad) | |
55 | fprintf (dump_file, "(bad) "); | |
56 | fprintf (dump_file, "{head:%d, depth:%d, reg:%u}", | |
57 | loop->head == NULL ? -1 : loop->head->index, | |
58 | loop->depth, REGNO (loop->iter_reg)); | |
59 | ||
60 | fprintf (dump_file, " blocks: [ "); | |
9771b263 | 61 | for (ix = 0; loop->blocks.iterate (ix, &b); ix++) |
9d9c740d BS |
62 | fprintf (dump_file, "%d ", b->index); |
63 | fprintf (dump_file, "] "); | |
64 | ||
65 | fprintf (dump_file, " inner loops: [ "); | |
9771b263 | 66 | for (ix = 0; loop->loops.iterate (ix, &i); ix++) |
9d9c740d BS |
67 | fprintf (dump_file, "%d ", i->loop_no); |
68 | fprintf (dump_file, "]\n"); | |
69 | } | |
70 | fprintf (dump_file, "\n"); | |
71 | } | |
72 | ||
73 | /* Return true if BB is part of LOOP. */ | |
74 | static bool | |
75 | bb_in_loop_p (hwloop_info loop, basic_block bb) | |
76 | { | |
77 | return bitmap_bit_p (loop->block_bitmap, bb->index); | |
78 | } | |
79 | ||
80 | /* Scan the blocks of LOOP (and its inferiors), and record things such as | |
81 | hard registers set, jumps out of and within the loop. */ | |
82 | static void | |
83 | scan_loop (hwloop_info loop) | |
84 | { | |
85 | unsigned ix; | |
86 | basic_block bb; | |
87 | ||
88 | if (loop->bad) | |
89 | return; | |
90 | ||
91 | if (REGNO_REG_SET_P (df_get_live_in (loop->successor), | |
92 | REGNO (loop->iter_reg))) | |
93 | loop->iter_reg_used_outside = true; | |
94 | ||
9771b263 | 95 | for (ix = 0; loop->blocks.iterate (ix, &bb); ix++) |
9d9c740d | 96 | { |
da76d746 | 97 | rtx_insn *insn; |
9d9c740d BS |
98 | edge e; |
99 | edge_iterator ei; | |
100 | ||
101 | if (bb != loop->tail) | |
102 | FOR_EACH_EDGE (e, ei, bb->succs) | |
103 | { | |
104 | if (bb_in_loop_p (loop, e->dest)) | |
105 | { | |
106 | if (!(e->flags & EDGE_FALLTHRU)) | |
107 | loop->jumps_within = true; | |
108 | } | |
109 | else | |
110 | { | |
111 | loop->jumps_outof = true; | |
112 | if (!loop->bad) | |
113 | gcc_assert (!REGNO_REG_SET_P (df_get_live_in (e->dest), | |
114 | REGNO (loop->iter_reg))); | |
115 | } | |
116 | } | |
117 | ||
118 | for (insn = BB_HEAD (bb); | |
119 | insn != NEXT_INSN (BB_END (bb)); | |
120 | insn = NEXT_INSN (insn)) | |
121 | { | |
bfac633a | 122 | df_ref def; |
9d9c740d BS |
123 | HARD_REG_SET set_this_insn; |
124 | ||
f27a3d37 | 125 | if (!NONDEBUG_INSN_P (insn)) |
9d9c740d BS |
126 | continue; |
127 | ||
128 | if (recog_memoized (insn) < 0 | |
129 | && (GET_CODE (PATTERN (insn)) == ASM_INPUT | |
130 | || asm_noperands (PATTERN (insn)) >= 0)) | |
131 | loop->has_asm = true; | |
132 | ||
133 | CLEAR_HARD_REG_SET (set_this_insn); | |
bfac633a | 134 | FOR_EACH_INSN_DEF (def, insn) |
9d9c740d | 135 | { |
bfac633a | 136 | rtx dreg = DF_REF_REG (def); |
9d9c740d BS |
137 | |
138 | if (!REG_P (dreg)) | |
139 | continue; | |
140 | ||
141 | add_to_hard_reg_set (&set_this_insn, GET_MODE (dreg), | |
142 | REGNO (dreg)); | |
143 | } | |
144 | ||
145 | if (insn == loop->loop_end) | |
146 | CLEAR_HARD_REG_BIT (set_this_insn, REGNO (loop->iter_reg)); | |
147 | else if (reg_mentioned_p (loop->iter_reg, PATTERN (insn))) | |
148 | loop->iter_reg_used = true; | |
149 | IOR_HARD_REG_SET (loop->regs_set_in_loop, set_this_insn); | |
150 | } | |
151 | } | |
152 | } | |
153 | ||
154 | /* Compute the incoming_dest and incoming_src members of LOOP by | |
155 | identifying the edges that jump into the loop. If there is more | |
156 | than one block that jumps into the loop, incoming_src will be set | |
157 | to NULL; likewise, if there is more than one block in the loop that | |
158 | is the destination of an incoming edge, incoming_dest will be NULL. | |
159 | ||
160 | Return true if either of these two fields is nonnull, false | |
161 | otherwise. */ | |
162 | static bool | |
163 | process_incoming_edges (hwloop_info loop) | |
164 | { | |
165 | edge e; | |
166 | edge_iterator ei; | |
167 | bool first = true; | |
168 | ||
169 | FOR_EACH_EDGE (e, ei, loop->incoming) | |
170 | { | |
171 | if (first) | |
172 | { | |
173 | loop->incoming_src = e->src; | |
174 | loop->incoming_dest = e->dest; | |
175 | first = false; | |
176 | } | |
177 | else | |
178 | { | |
179 | if (e->dest != loop->incoming_dest) | |
180 | loop->incoming_dest = NULL; | |
181 | if (e->src != loop->incoming_src) | |
182 | loop->incoming_src = NULL; | |
183 | } | |
184 | } | |
185 | if (loop->incoming_src == NULL && loop->incoming_dest == NULL) | |
186 | return false; | |
187 | ||
188 | return true; | |
189 | } | |
190 | ||
191 | /* Try to identify a forwarder block that jump into LOOP, and add it to | |
192 | the set of blocks in the loop, updating the vector of incoming blocks as | |
193 | well. This transformation gives a second chance to loops we couldn't | |
194 | otherwise handle by increasing the chance that we'll end up with one | |
195 | incoming_src block. | |
196 | Return true if we made a change, false otherwise. */ | |
197 | static bool | |
198 | add_forwarder_blocks (hwloop_info loop) | |
199 | { | |
200 | edge e; | |
201 | edge_iterator ei; | |
202 | ||
203 | FOR_EACH_EDGE (e, ei, loop->incoming) | |
204 | { | |
205 | if (forwarder_block_p (e->src)) | |
206 | { | |
207 | edge e2; | |
208 | edge_iterator ei2; | |
209 | ||
210 | if (dump_file) | |
211 | fprintf (dump_file, | |
212 | ";; Adding forwarder block %d to loop %d and retrying\n", | |
213 | e->src->index, loop->loop_no); | |
9771b263 | 214 | loop->blocks.safe_push (e->src); |
9d9c740d BS |
215 | bitmap_set_bit (loop->block_bitmap, e->src->index); |
216 | FOR_EACH_EDGE (e2, ei2, e->src->preds) | |
9771b263 DN |
217 | vec_safe_push (loop->incoming, e2); |
218 | loop->incoming->unordered_remove (ei.index); | |
9d9c740d BS |
219 | return true; |
220 | } | |
221 | } | |
222 | return false; | |
223 | } | |
224 | ||
225 | /* Called from reorg_loops when a potential loop end is found. LOOP is | |
226 | a newly set up structure describing the loop, it is this function's | |
227 | responsibility to fill most of it. TAIL_BB and TAIL_INSN point to the | |
228 | loop_end insn and its enclosing basic block. REG is the loop counter | |
229 | register. | |
230 | For our purposes, a loop is defined by the set of blocks reachable from | |
231 | the loop head in which the loop counter register is live. This matches | |
232 | the expected use; targets that call into this code usually replace the | |
233 | loop counter with a different special register. */ | |
234 | static void | |
da76d746 | 235 | discover_loop (hwloop_info loop, basic_block tail_bb, rtx_insn *tail_insn, rtx reg) |
9d9c740d BS |
236 | { |
237 | bool found_tail; | |
238 | unsigned dwork = 0; | |
239 | basic_block bb; | |
9d9c740d BS |
240 | |
241 | loop->tail = tail_bb; | |
242 | loop->loop_end = tail_insn; | |
243 | loop->iter_reg = reg; | |
9771b263 | 244 | vec_alloc (loop->incoming, 2); |
ce1ce33a | 245 | loop->start_label = as_a <rtx_insn *> (JUMP_LABEL (tail_insn)); |
9d9c740d BS |
246 | |
247 | if (EDGE_COUNT (tail_bb->succs) != 2) | |
248 | { | |
249 | loop->bad = true; | |
250 | return; | |
251 | } | |
252 | loop->head = BRANCH_EDGE (tail_bb)->dest; | |
253 | loop->successor = FALLTHRU_EDGE (tail_bb)->dest; | |
254 | ||
00f96dc9 | 255 | auto_vec<basic_block, 20> works; |
9771b263 | 256 | works.safe_push (loop->head); |
9d9c740d BS |
257 | |
258 | found_tail = false; | |
9771b263 | 259 | for (dwork = 0; works.iterate (dwork, &bb); dwork++) |
9d9c740d BS |
260 | { |
261 | edge e; | |
262 | edge_iterator ei; | |
fefa31b5 | 263 | if (bb == EXIT_BLOCK_PTR_FOR_FN (cfun)) |
9d9c740d BS |
264 | { |
265 | /* We've reached the exit block. The loop must be bad. */ | |
266 | if (dump_file) | |
267 | fprintf (dump_file, | |
268 | ";; Loop is bad - reached exit block while scanning\n"); | |
269 | loop->bad = true; | |
270 | break; | |
271 | } | |
272 | ||
273 | if (bitmap_bit_p (loop->block_bitmap, bb->index)) | |
274 | continue; | |
275 | ||
276 | /* We've not seen this block before. Add it to the loop's | |
277 | list and then add each successor to the work list. */ | |
278 | ||
9771b263 | 279 | loop->blocks.safe_push (bb); |
9d9c740d BS |
280 | bitmap_set_bit (loop->block_bitmap, bb->index); |
281 | ||
282 | if (bb == tail_bb) | |
283 | found_tail = true; | |
284 | else | |
285 | { | |
286 | FOR_EACH_EDGE (e, ei, bb->succs) | |
287 | { | |
288 | basic_block succ = EDGE_SUCC (bb, ei.index)->dest; | |
289 | if (REGNO_REG_SET_P (df_get_live_in (succ), | |
290 | REGNO (loop->iter_reg))) | |
9771b263 | 291 | works.safe_push (succ); |
9d9c740d BS |
292 | } |
293 | } | |
294 | } | |
295 | ||
296 | if (!found_tail) | |
297 | loop->bad = true; | |
298 | ||
299 | /* Find the predecessor, and make sure nothing else jumps into this loop. */ | |
300 | if (!loop->bad) | |
301 | { | |
9771b263 | 302 | FOR_EACH_VEC_ELT (loop->blocks, dwork, bb) |
9d9c740d BS |
303 | { |
304 | edge e; | |
305 | edge_iterator ei; | |
306 | FOR_EACH_EDGE (e, ei, bb->preds) | |
307 | { | |
308 | basic_block pred = e->src; | |
309 | ||
310 | if (!bb_in_loop_p (loop, pred)) | |
311 | { | |
312 | if (dump_file) | |
313 | fprintf (dump_file, ";; Loop %d: incoming edge %d -> %d\n", | |
314 | loop->loop_no, pred->index, | |
315 | e->dest->index); | |
9771b263 | 316 | vec_safe_push (loop->incoming, e); |
9d9c740d BS |
317 | } |
318 | } | |
319 | } | |
320 | ||
321 | if (!process_incoming_edges (loop)) | |
322 | { | |
323 | if (dump_file) | |
324 | fprintf (dump_file, | |
325 | ";; retrying loop %d with forwarder blocks\n", | |
326 | loop->loop_no); | |
327 | if (!add_forwarder_blocks (loop)) | |
328 | { | |
329 | if (dump_file) | |
330 | fprintf (dump_file, ";; No forwarder blocks found\n"); | |
331 | loop->bad = true; | |
332 | } | |
333 | else if (!process_incoming_edges (loop)) | |
334 | { | |
335 | if (dump_file) | |
336 | fprintf (dump_file, | |
337 | ";; can't find suitable entry for loop %d\n", | |
338 | loop->loop_no); | |
339 | } | |
340 | } | |
341 | } | |
9d9c740d BS |
342 | } |
343 | ||
344 | /* Analyze the structure of the loops in the current function. Use | |
0823efed | 345 | LOOP_STACK for bitmap allocations. Returns all the valid candidates for |
9d9c740d BS |
346 | hardware loops found in this function. HOOKS is the argument |
347 | passed to reorg_loops, used here to find the iteration registers | |
348 | from a loop_end pattern. */ | |
349 | static hwloop_info | |
0823efed | 350 | discover_loops (bitmap_obstack *loop_stack, struct hw_doloop_hooks *hooks) |
9d9c740d BS |
351 | { |
352 | hwloop_info loops = NULL; | |
353 | hwloop_info loop; | |
354 | basic_block bb; | |
355 | int nloops = 0; | |
356 | ||
357 | /* Find all the possible loop tails. This means searching for every | |
358 | loop_end instruction. For each one found, create a hwloop_info | |
359 | structure and add the head block to the work list. */ | |
11cd3bed | 360 | FOR_EACH_BB_FN (bb, cfun) |
9d9c740d | 361 | { |
da76d746 | 362 | rtx_insn *tail = BB_END (bb); |
b32d5189 DM |
363 | rtx_insn *insn; |
364 | rtx reg; | |
9d9c740d | 365 | |
b64925dc | 366 | while (tail && NOTE_P (tail) && tail != BB_HEAD (bb)) |
9d9c740d BS |
367 | tail = PREV_INSN (tail); |
368 | ||
369 | if (tail == NULL_RTX) | |
370 | continue; | |
371 | ||
372 | if (!JUMP_P (tail)) | |
373 | continue; | |
374 | reg = hooks->end_pattern_reg (tail); | |
375 | if (reg == NULL_RTX) | |
376 | continue; | |
377 | ||
378 | /* A possible loop end */ | |
379 | ||
380 | /* There's a degenerate case we can handle - an empty loop consisting | |
381 | of only a back branch. Handle that by deleting the branch. */ | |
b32d5189 | 382 | insn = JUMP_LABEL_AS_INSN (tail); |
9d9c740d BS |
383 | while (insn && !NONDEBUG_INSN_P (insn)) |
384 | insn = NEXT_INSN (insn); | |
385 | if (insn == tail) | |
386 | { | |
387 | basic_block succ = FALLTHRU_EDGE (bb)->dest; | |
388 | if (dump_file) | |
389 | { | |
390 | fprintf (dump_file, ";; degenerate loop ending at\n"); | |
391 | print_rtl_single (dump_file, tail); | |
392 | } | |
393 | if (!REGNO_REG_SET_P (df_get_live_in (succ), REGNO (reg))) | |
394 | { | |
395 | if (dump_file) | |
396 | fprintf (dump_file, ";; deleting it\n"); | |
397 | delete_insn_and_edges (tail); | |
398 | continue; | |
399 | } | |
400 | } | |
401 | ||
402 | loop = XCNEW (struct hwloop_info_d); | |
403 | loop->next = loops; | |
404 | loops = loop; | |
405 | loop->loop_no = nloops++; | |
9771b263 | 406 | loop->blocks.create (20); |
0823efed | 407 | loop->block_bitmap = BITMAP_ALLOC (loop_stack); |
9d9c740d BS |
408 | |
409 | if (dump_file) | |
410 | { | |
411 | fprintf (dump_file, ";; potential loop %d ending at\n", | |
412 | loop->loop_no); | |
413 | print_rtl_single (dump_file, tail); | |
414 | } | |
415 | ||
416 | discover_loop (loop, bb, tail, reg); | |
417 | } | |
418 | ||
419 | /* Compute loop nestings. Given two loops A and B, either the sets | |
420 | of their blocks don't intersect at all, or one is the subset of | |
421 | the other, or the blocks don't form a good nesting structure. */ | |
422 | for (loop = loops; loop; loop = loop->next) | |
423 | { | |
424 | hwloop_info other; | |
425 | ||
426 | if (loop->bad) | |
427 | continue; | |
428 | ||
429 | for (other = loops; other; other = other->next) | |
430 | { | |
431 | if (other->bad) | |
432 | continue; | |
433 | ||
434 | if (!bitmap_intersect_p (other->block_bitmap, loop->block_bitmap)) | |
435 | continue; | |
436 | if (!bitmap_intersect_compl_p (other->block_bitmap, | |
437 | loop->block_bitmap)) | |
9771b263 | 438 | loop->loops.safe_push (other); |
9d9c740d BS |
439 | else if (!bitmap_intersect_compl_p (loop->block_bitmap, |
440 | other->block_bitmap)) | |
9771b263 | 441 | other->loops.safe_push (loop); |
9d9c740d BS |
442 | else |
443 | { | |
444 | if (dump_file) | |
445 | fprintf (dump_file, | |
446 | ";; can't find suitable nesting for loops %d and %d\n", | |
447 | loop->loop_no, other->loop_no); | |
448 | loop->bad = other->bad = true; | |
449 | } | |
450 | } | |
451 | } | |
452 | ||
453 | if (dump_file) | |
454 | dump_hwloops (loops); | |
455 | ||
456 | return loops; | |
457 | } | |
458 | ||
459 | /* Free up the loop structures in LOOPS. */ | |
460 | static void | |
461 | free_loops (hwloop_info loops) | |
462 | { | |
463 | while (loops) | |
464 | { | |
465 | hwloop_info loop = loops; | |
466 | loops = loop->next; | |
9771b263 DN |
467 | loop->loops.release (); |
468 | loop->blocks.release (); | |
9d9c740d BS |
469 | BITMAP_FREE (loop->block_bitmap); |
470 | XDELETE (loop); | |
471 | } | |
472 | } | |
473 | ||
474 | #define BB_AUX_INDEX(BB) ((intptr_t) (BB)->aux) | |
475 | ||
476 | /* Initialize the aux fields to give ascending indices to basic blocks. */ | |
477 | static void | |
478 | set_bb_indices (void) | |
479 | { | |
480 | basic_block bb; | |
481 | intptr_t index; | |
482 | ||
483 | index = 0; | |
11cd3bed | 484 | FOR_EACH_BB_FN (bb, cfun) |
9d9c740d BS |
485 | bb->aux = (void *) index++; |
486 | } | |
487 | ||
488 | /* The taken-branch edge from the loop end can actually go forward. | |
489 | If the target's hardware loop support requires that the loop end be | |
490 | after the loop start, try to reorder a loop's basic blocks when we | |
491 | find such a case. | |
492 | This is not very aggressive; it only moves at most one block. It | |
493 | does not introduce new branches into loops; it may remove them, or | |
494 | it may switch fallthru/jump edges. */ | |
495 | static void | |
496 | reorder_loops (hwloop_info loops) | |
497 | { | |
498 | basic_block bb; | |
499 | hwloop_info loop; | |
500 | ||
501 | cfg_layout_initialize (0); | |
502 | ||
503 | set_bb_indices (); | |
504 | ||
505 | for (loop = loops; loop; loop = loop->next) | |
506 | { | |
507 | edge e; | |
508 | edge_iterator ei; | |
509 | ||
510 | if (loop->bad) | |
511 | continue; | |
512 | ||
513 | if (BB_AUX_INDEX (loop->head) <= BB_AUX_INDEX (loop->tail)) | |
514 | continue; | |
515 | ||
516 | FOR_EACH_EDGE (e, ei, loop->head->succs) | |
517 | { | |
518 | if (bitmap_bit_p (loop->block_bitmap, e->dest->index) | |
519 | && BB_AUX_INDEX (e->dest) < BB_AUX_INDEX (loop->tail)) | |
520 | { | |
521 | basic_block start_bb = e->dest; | |
522 | basic_block start_prev_bb = start_bb->prev_bb; | |
523 | ||
524 | if (dump_file) | |
525 | fprintf (dump_file, ";; Moving block %d before block %d\n", | |
526 | loop->head->index, start_bb->index); | |
527 | loop->head->prev_bb->next_bb = loop->head->next_bb; | |
528 | loop->head->next_bb->prev_bb = loop->head->prev_bb; | |
529 | ||
530 | loop->head->prev_bb = start_prev_bb; | |
531 | loop->head->next_bb = start_bb; | |
532 | start_prev_bb->next_bb = start_bb->prev_bb = loop->head; | |
533 | ||
534 | set_bb_indices (); | |
535 | break; | |
536 | } | |
537 | } | |
538 | loops = loops->next; | |
539 | } | |
540 | ||
11cd3bed | 541 | FOR_EACH_BB_FN (bb, cfun) |
9d9c740d | 542 | { |
fefa31b5 | 543 | if (bb->next_bb != EXIT_BLOCK_PTR_FOR_FN (cfun)) |
9d9c740d BS |
544 | bb->aux = bb->next_bb; |
545 | else | |
546 | bb->aux = NULL; | |
547 | } | |
548 | cfg_layout_finalize (); | |
549 | clear_aux_for_blocks (); | |
550 | df_analyze (); | |
551 | } | |
552 | ||
553 | /* Call the OPT function for LOOP and all of its sub-loops. This is | |
554 | done in a depth-first search; innermost loops are visited first. | |
555 | OPTIMIZE and FAIL are the functions passed to reorg_loops by the | |
556 | target's reorg pass. */ | |
557 | static void | |
558 | optimize_loop (hwloop_info loop, struct hw_doloop_hooks *hooks) | |
559 | { | |
560 | int ix; | |
561 | hwloop_info inner; | |
562 | int inner_depth = 0; | |
563 | ||
564 | if (loop->visited) | |
565 | return; | |
566 | ||
567 | loop->visited = 1; | |
568 | ||
569 | if (loop->bad) | |
570 | { | |
571 | if (dump_file) | |
572 | fprintf (dump_file, ";; loop %d bad when found\n", loop->loop_no); | |
573 | goto bad_loop; | |
574 | } | |
575 | ||
576 | /* Every loop contains in its list of inner loops every loop nested inside | |
577 | it, even if there are intermediate loops. This works because we're doing | |
578 | a depth-first search here and never visit a loop more than once. | |
579 | Recursion depth is effectively limited by the number of available | |
580 | hardware registers. */ | |
9771b263 | 581 | for (ix = 0; loop->loops.iterate (ix, &inner); ix++) |
9d9c740d BS |
582 | { |
583 | optimize_loop (inner, hooks); | |
584 | ||
585 | if (!inner->bad && inner_depth < inner->depth) | |
586 | inner_depth = inner->depth; | |
587 | /* The set of registers may be changed while optimizing the inner | |
588 | loop. */ | |
589 | IOR_HARD_REG_SET (loop->regs_set_in_loop, inner->regs_set_in_loop); | |
590 | } | |
591 | ||
592 | loop->depth = inner_depth + 1; | |
593 | ||
594 | if (hooks->opt (loop)) | |
595 | return; | |
596 | ||
597 | bad_loop: | |
598 | if (dump_file) | |
599 | fprintf (dump_file, ";; loop %d is bad\n", loop->loop_no); | |
600 | ||
601 | loop->bad = true; | |
602 | hooks->fail (loop); | |
603 | } | |
604 | ||
605 | /* This function can be used from a port's machine_dependent_reorg to | |
606 | find and analyze loops that end in loop_end instructions. It uses | |
607 | a set of function pointers in HOOKS to call back into the | |
608 | target-specific functions to perform the actual machine-specific | |
609 | transformations. | |
610 | ||
611 | Such transformations typically involve additional set-up | |
612 | instructions before the loop, to define loop bounds or set up a | |
613 | special loop counter register. | |
614 | ||
615 | DO_REORDER should be set to true if we should try to use the | |
616 | reorder_loops function to ensure the loop end occurs after the loop | |
617 | start. This is for use by targets where the loop hardware requires | |
618 | this condition. | |
619 | ||
620 | HOOKS is used to pass in target specific hooks; see | |
621 | hw-doloop.h. */ | |
622 | void | |
623 | reorg_loops (bool do_reorder, struct hw_doloop_hooks *hooks) | |
624 | { | |
625 | hwloop_info loops = NULL; | |
626 | hwloop_info loop; | |
0823efed | 627 | bitmap_obstack loop_stack; |
9d9c740d BS |
628 | |
629 | df_live_add_problem (); | |
630 | df_live_set_all_dirty (); | |
631 | df_analyze (); | |
632 | ||
0823efed | 633 | bitmap_obstack_initialize (&loop_stack); |
9d9c740d BS |
634 | |
635 | if (dump_file) | |
636 | fprintf (dump_file, ";; Find loops, first pass\n\n"); | |
637 | ||
0823efed | 638 | loops = discover_loops (&loop_stack, hooks); |
9d9c740d | 639 | |
8a9e6b45 BS |
640 | /* We can't enter cfglayout mode anymore if basic block partitioning |
641 | already happened. */ | |
642 | if (do_reorder && !flag_reorder_blocks_and_partition) | |
9d9c740d BS |
643 | { |
644 | reorder_loops (loops); | |
645 | free_loops (loops); | |
646 | ||
647 | if (dump_file) | |
648 | fprintf (dump_file, ";; Find loops, second pass\n\n"); | |
649 | ||
0823efed | 650 | loops = discover_loops (&loop_stack, hooks); |
9d9c740d BS |
651 | } |
652 | ||
653 | for (loop = loops; loop; loop = loop->next) | |
654 | scan_loop (loop); | |
655 | ||
656 | /* Now apply the optimizations. */ | |
657 | for (loop = loops; loop; loop = loop->next) | |
658 | optimize_loop (loop, hooks); | |
659 | ||
660 | if (dump_file) | |
661 | { | |
662 | fprintf (dump_file, ";; After hardware loops optimization:\n\n"); | |
663 | dump_hwloops (loops); | |
664 | } | |
665 | ||
666 | free_loops (loops); | |
955b33ed | 667 | bitmap_obstack_release (&loop_stack); |
9d9c740d BS |
668 | |
669 | if (dump_file) | |
670 | print_rtl (dump_file, get_insns ()); | |
671 | } | |
672 | #endif |