| blob | 1a85a20e67ab9be303845aa542fe50900cb691a8 |
1 /* Try to unroll loops, and split induction variables.
2 Copyright (C) 1992, 1993, 1994, 1995, 1997, 1998, 1999, 2000, 2001, 2002
3 Free Software Foundation, Inc.
4 Contributed by James E. Wilson, Cygnus Support/UC Berkeley.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
21 02111-1307, USA. */
23 /* Try to unroll a loop, and split induction variables.
25 Loops for which the number of iterations can be calculated exactly are
26 handled specially. If the number of iterations times the insn_count is
27 less than MAX_UNROLLED_INSNS, then the loop is unrolled completely.
28 Otherwise, we try to unroll the loop a number of times modulo the number
29 of iterations, so that only one exit test will be needed. It is unrolled
30 a number of times approximately equal to MAX_UNROLLED_INSNS divided by
31 the insn count.
33 Otherwise, if the number of iterations can be calculated exactly at
34 run time, and the loop is always entered at the top, then we try to
35 precondition the loop. That is, at run time, calculate how many times
36 the loop will execute, and then execute the loop body a few times so
37 that the remaining iterations will be some multiple of 4 (or 2 if the
38 loop is large). Then fall through to a loop unrolled 4 (or 2) times,
39 with only one exit test needed at the end of the loop.
41 Otherwise, if the number of iterations can not be calculated exactly,
42 not even at run time, then we still unroll the loop a number of times
43 approximately equal to MAX_UNROLLED_INSNS divided by the insn count,
44 but there must be an exit test after each copy of the loop body.
46 For each induction variable, which is dead outside the loop (replaceable)
47 or for which we can easily calculate the final value, if we can easily
48 calculate its value at each place where it is set as a function of the
49 current loop unroll count and the variable's value at loop entry, then
50 the induction variable is split into `N' different variables, one for
51 each copy of the loop body. One variable is live across the backward
52 branch, and the others are all calculated as a function of this variable.
53 This helps eliminate data dependencies, and leads to further opportunities
54 for cse. */
56 /* Possible improvements follow: */
58 /* ??? Add an extra pass somewhere to determine whether unrolling will
59 give any benefit. E.g. after generating all unrolled insns, compute the
60 cost of all insns and compare against cost of insns in rolled loop.
62 - On traditional architectures, unrolling a non-constant bound loop
63 is a win if there is a giv whose only use is in memory addresses, the
64 memory addresses can be split, and hence giv increments can be
65 eliminated.
66 - It is also a win if the loop is executed many times, and preconditioning
67 can be performed for the loop.
68 Add code to check for these and similar cases. */
70 /* ??? Improve control of which loops get unrolled. Could use profiling
71 info to only unroll the most commonly executed loops. Perhaps have
72 a user specifyable option to control the amount of code expansion,
73 or the percent of loops to consider for unrolling. Etc. */
75 /* ??? Look at the register copies inside the loop to see if they form a
76 simple permutation. If so, iterate the permutation until it gets back to
77 the start state. This is how many times we should unroll the loop, for
78 best results, because then all register copies can be eliminated.
79 For example, the lisp nreverse function should be unrolled 3 times
80 while (this)
81 {
82 next = this->cdr;
83 this->cdr = prev;
84 prev = this;
85 this = next;
86 }
88 ??? The number of times to unroll the loop may also be based on data
89 references in the loop. For example, if we have a loop that references
90 x[i-1], x[i], and x[i+1], we should unroll it a multiple of 3 times. */
92 /* ??? Add some simple linear equation solving capability so that we can
93 determine the number of loop iterations for more complex loops.
94 For example, consider this loop from gdb
95 #define SWAP_TARGET_AND_HOST(buffer,len)
96 {
97 char tmp;
98 char *p = (char *) buffer;
99 char *q = ((char *) buffer) + len - 1;
100 int iterations = (len + 1) >> 1;
101 int i;
102 for (p; p < q; p++, q--;)
103 {
104 tmp = *q;
105 *q = *p;
106 *p = tmp;
107 }
108 }
109 Note that:
110 start value = p = &buffer + current_iteration
111 end value = q = &buffer + len - 1 - current_iteration
112 Given the loop exit test of "p < q", then there must be "q - p" iterations,
113 set equal to zero and solve for number of iterations:
114 q - p = len - 1 - 2*current_iteration = 0
115 current_iteration = (len - 1) / 2
116 Hence, there are (len - 1) / 2 (rounded up to the nearest integer)
117 iterations of this loop. */
119 /* ??? Currently, no labels are marked as loop invariant when doing loop
120 unrolling. This is because an insn inside the loop, that loads the address
121 of a label inside the loop into a register, could be moved outside the loop
122 by the invariant code motion pass if labels were invariant. If the loop
123 is subsequently unrolled, the code will be wrong because each unrolled
124 body of the loop will use the same address, whereas each actually needs a
125 different address. A case where this happens is when a loop containing
126 a switch statement is unrolled.
128 It would be better to let labels be considered invariant. When we
129 unroll loops here, check to see if any insns using a label local to the
130 loop were moved before the loop. If so, then correct the problem, by
131 moving the insn back into the loop, or perhaps replicate the insn before
132 the loop, one copy for each time the loop is unrolled. */
152 /* The prime factors looked for when trying to unroll a loop by some
153 number which is modulo the total number of iterations. Just checking
154 for these 4 prime factors will find at least one factor for 75% of
155 all numbers theoretically. Practically speaking, this will succeed
156 almost all of the time since loops are generally a multiple of 2
157 and/or 5. */
159 #define NUM_FACTORS 4
164 /* Describes the different types of loop unrolling performed. */
166 enum unroll_types
167 {
168 UNROLL_COMPLETELY,
169 UNROLL_MODULO,
170 UNROLL_NAIVE
171 };
173 /* Indexed by register number, if non-zero, then it contains a pointer
174 to a struct induction for a DEST_REG giv which has been combined with
175 one of more address givs. This is needed because whenever such a DEST_REG
176 giv is modified, we must modify the value of all split address givs
177 that were combined with this DEST_REG giv. */
181 /* Indexed by register number, if this is a splittable induction variable,
182 then this will hold the current value of the register, which depends on the
183 iteration number. */
187 /* Indexed by register number, if this is a splittable induction variable,
188 then this will hold the number of instructions in the loop that modify
189 the induction variable. Used to ensure that only the last insn modifying
190 a split iv will update the original iv of the dest. */
194 /* Forward declarations. */
217 /* Try to unroll one loop and split induction variables in the loop.
219 The loop is described by the arguments LOOP and INSN_COUNT.
220 STRENGTH_REDUCTION_P indicates whether information generated in the
221 strength reduction pass is available.
223 This function is intended to be called from within `strength_reduce'
224 in loop.c. */
226 void
231 {
241 rtx insert_before;
248 rtx start_label;
253 rtx safety_label;
254 /* This points to the last real insn in the loop, which should be either
255 a JUMP_INSN (for conditional jumps) or a BARRIER (for unconditional
256 jumps). */
257 rtx last_loop_insn;
261 /* Don't bother unrolling huge loops. Since the minimum factor is
262 two, loops greater than one half of MAX_UNROLLED_INSNS will never
263 be unrolled. */
265 {
269 }
271 /* Determine type of unroll to perform. Depends on the number of iterations
272 and the size of the loop. */
274 /* If there is no strength reduce info, then set
275 loop_info->n_iterations to zero. This can happen if
276 strength_reduce can't find any bivs in the loop. A value of zero
277 indicates that the number of iterations could not be calculated. */
283 {
288 }
290 /* Find and save a pointer to the last nonnote insn in the loop. */
294 /* Calculate how many times to unroll the loop. Indicate whether or
295 not the loop is being completely unrolled. */
298 {
299 /* Handle the case where the loop begins with an unconditional
300 jump to the loop condition. Make sure to delete the jump
301 insn, otherwise the loop body will never execute. */
307 /* If number of iterations is exactly 1, then eliminate the compare and
308 branch at the end of the loop since they will never be taken.
309 Then return, since no other action is needed here. */
311 /* If the last instruction is not a BARRIER or a JUMP_INSN, then
312 don't do anything. */
315 {
316 /* Delete the jump insn. This will delete the barrier also. */
318 }
320 {
321 #ifdef HAVE_cc0
323 #endif
325 #ifdef HAVE_cc0
326 /* The immediately preceding insn may be a compare which must be
327 deleted. */
330 #endif
331 }
333 /* Remove the loop notes since this is no longer a loop. */
344 }
346 /* Avoid overflow in the next expression. */
349 {
352 }
354 {
355 /* Try to factor the number of iterations. Don't bother with the
356 general case, only using 2, 3, 5, and 7 will get 75% of all
357 numbers theoretically, and almost all in practice. */
365 {
368 }
370 /* Start with the larger factors first so that we generally
371 get lots of unrolling. */
377 {
379 {
382 }
383 else
385 }
387 /* If we couldn't find any factors, then unroll as in the normal
388 case. */
390 {
393 }
394 else
396 }
398 /* Default case, calculate number of times to unroll loop based on its
399 size. */
401 {
406 else
408 }
410 /* Now we know how many times to unroll the loop. */
416 {
417 /* Loops of these types can start with jump down to the exit condition
418 in rare circumstances.
420 Consider a pair of nested loops where the inner loop is part
421 of the exit code for the outer loop.
423 In this case jump.c will not duplicate the exit test for the outer
424 loop, so it will start with a jump to the exit code.
426 Then consider if the inner loop turns out to iterate once and
427 only once. We will end up deleting the jumps associated with
428 the inner loop. However, the loop notes are not removed from
429 the instruction stream.
431 And finally assume that we can compute the number of iterations
432 for the outer loop.
434 In this case unroll may want to unroll the outer loop even though
435 it starts with a jump to the outer loop's exit code.
437 We could try to optimize this case, but it hardly seems worth it.
438 Just return without unrolling the loop in such cases. */
445 }
448 {
449 /* Completely unrolling the loop: Delete the compare and branch at
450 the end (the last two instructions). This delete must done at the
451 very end of loop unrolling, to avoid problems with calls to
452 back_branch_in_range_p, which is called by find_splittable_regs.
453 All increments of splittable bivs/givs are changed to load constant
454 instructions. */
458 /* Set insert_before to the instruction immediately after the JUMP_INSN
459 (or BARRIER), so that any NOTEs between the JUMP_INSN and the end of
460 the loop will be correctly handled by copy_loop_body. */
463 /* Set copy_end to the insn before the jump at the end of the loop. */
467 {
469 #ifdef HAVE_cc0
470 /* The instruction immediately before the JUMP_INSN may be a compare
471 instruction which we do not want to copy. */
474 #endif
475 }
476 else
477 {
478 /* We currently can't unroll a loop if it doesn't end with a
479 JUMP_INSN. There would need to be a mechanism that recognizes
480 this case, and then inserts a jump after each loop body, which
481 jumps to after the last loop body. */
486 }
487 }
489 {
490 /* Partially unrolling the loop: The compare and branch at the end
491 (the last two instructions) must remain. Don't copy the compare
492 and branch instructions at the end of the loop. Insert the unrolled
493 code immediately before the compare/branch at the end so that the
494 code will fall through to them as before. */
498 /* Set insert_before to the jump insn at the end of the loop.
499 Set copy_end to before the jump insn at the end of the loop. */
501 {
504 }
506 {
508 #ifdef HAVE_cc0
509 /* The instruction immediately before the JUMP_INSN may be a compare
510 instruction which we do not want to copy or delete. */
513 #endif
515 }
516 else
517 {
518 /* We currently can't unroll a loop if it doesn't end with a
519 JUMP_INSN. There would need to be a mechanism that recognizes
520 this case, and then inserts a jump after each loop body, which
521 jumps to after the last loop body. */
526 }
527 }
528 else
529 {
530 /* Normal case: Must copy the compare and branch instructions at the
531 end of the loop. */
534 {
535 /* Loop ends with an unconditional jump and a barrier.
536 Handle this like above, don't copy jump and barrier.
537 This is not strictly necessary, but doing so prevents generating
538 unconditional jumps to an immediately following label.
540 This will be corrected below if the target of this jump is
541 not the start_label. */
545 }
547 {
548 /* Set insert_before to immediately after the JUMP_INSN, so that
549 NOTEs at the end of the loop will be correctly handled by
550 copy_loop_body. */
553 }
554 else
555 {
556 /* We currently can't unroll a loop if it doesn't end with a
557 JUMP_INSN. There would need to be a mechanism that recognizes
558 this case, and then inserts a jump after each loop body, which
559 jumps to after the last loop body. */
564 }
566 /* If copying exit test branches because they can not be eliminated,
567 then must convert the fall through case of the branch to a jump past
568 the end of the loop. Create a label to emit after the loop and save
569 it for later use. Do not use the label after the loop, if any, since
570 it might be used by insns outside the loop, or there might be insns
571 added before it later by final_[bg]iv_value which must be after
572 the real exit label. */
580 {
581 /* The loop starts with a jump down to the exit condition test.
582 Start copying the loop after the barrier following this
583 jump insn. */
586 /* Splitting induction variables doesn't work when the loop is
587 entered via a jump to the bottom, because then we end up doing
588 a comparison against a new register for a split variable, but
589 we did not execute the set insn for the new register because
590 it was skipped over. */
595 }
596 else
598 }
600 /* This should always be the first label in the loop. */
602 /* There may be a line number note and/or a loop continue note here. */
606 {
607 /* This can happen as a result of jump threading. If the first insns in
608 the loop test the same condition as the loop's backward jump, or the
609 opposite condition, then the backward jump will be modified to point
610 to elsewhere, and the loop's start label is deleted.
612 This case currently can not be handled by the loop unrolling code. */
618 }
620 {
621 /* The jump optimization pass must have combined the original start label
622 with a named label for a goto. We can't unroll this case because
623 jumps which go to the named label must be handled differently than
624 jumps to the loop start, and it is impossible to differentiate them
625 in this case. */
630 }
636 {
637 /* In this case, we must copy the jump and barrier, because they will
638 not be converted to jumps to an immediately following label. */
642 }
647 {
648 /* ??? The loop ends with a conditional branch that does not branch back
649 to the loop start label. In this case, we must emit an unconditional
650 branch to the loop exit after emitting the final branch.
651 copy_loop_body does not have support for this currently, so we
652 give up. It doesn't seem worthwhile to unroll anyways since
653 unrolling would increase the number of branch instructions
654 executed. */
659 }
661 /* Allocate a translation table for the labels and insn numbers.
662 They will be filled in as we copy the insns in the loop. */
667 /* Various paths through the unroll code may reach the "egress" label
668 without initializing fields within the map structure.
670 To be safe, we use xcalloc to zero the memory. */
673 /* Allocate the label map. */
676 {
679 }
681 /* Search the loop and mark all local labels, i.e. the ones which have to
682 be distinct labels when copied. For all labels which might be
683 non-local, set their label_map entries to point to themselves.
684 If they happen to be local their label_map entries will be overwritten
685 before the loop body is copied. The label_map entries for local labels
686 will be set to a different value each time the loop body is copied. */
689 {
690 rtx note;
695 {
702 {
706 rtx label;
709 {
712 }
713 }
714 }
718 }
720 /* Allocate space for the insn map. */
724 /* Set this to zero, to indicate that we are doing loop unrolling,
725 not function inlining. */
728 /* The register and constant maps depend on the number of registers
729 present, so the final maps can't be created until after
730 find_splittable_regs is called. However, they are needed for
731 preconditioning, so we create temporary maps when preconditioning
732 is performed. */
734 /* The preconditioning code may allocate two new pseudo registers. */
737 /* local_regno is only valid for regnos < max_local_regnum. */
740 /* Allocate and zero out the splittable_regs and addr_combined_regs
741 arrays. These must be zeroed here because they will be used if
742 loop preconditioning is performed, and must be zero for that case.
744 It is safe to do this here, since the extra registers created by the
745 preconditioning code and find_splittable_regs will never be used
746 to access the splittable_regs[] and addr_combined_regs[] arrays. */
750 addr_combined_regs
754 /* Mark all local registers, i.e. the ones which are referenced only
755 inside the loop. */
757 {
761 /* If a register is used in the jump insn, we must not duplicate it
762 since it will also be used outside the loop. */
764 copy_end_luid--;
766 /* If we have a target that uses cc0, then we also must not duplicate
767 the insn that sets cc0 before the jump insn, if one is present. */
768 #ifdef HAVE_cc0
771 copy_end_luid--;
772 #endif
774 /* If copy_start points to the NOTE that starts the loop, then we must
775 use the next luid, because invariant pseudo-regs moved out of the loop
776 have their lifetimes modified to start here, but they are not safe
777 to duplicate. */
779 copy_start_luid++;
781 /* If a pseudo's lifetime is entirely contained within this loop, then we
782 can use a different pseudo in each unrolled copy of the loop. This
783 results in better code. */
784 /* We must limit the generic test to max_reg_before_loop, because only
785 these pseudo registers have valid regno_first_uid info. */
791 {
792 /* However, we must also check for loop-carried dependencies.
793 If the value the pseudo has at the end of iteration X is
794 used by iteration X+1, then we can not use a different pseudo
795 for each unrolled copy of the loop. */
796 /* A pseudo is safe if regno_first_uid is a set, and this
797 set dominates all instructions from regno_first_uid to
798 regno_last_uid. */
799 /* ??? This check is simplistic. We would get better code if
800 this check was more sophisticated. */
806 {
809 else
811 r);
812 }
813 }
814 }
816 /* If this loop requires exit tests when unrolled, check to see if we
817 can precondition the loop so as to make the exit tests unnecessary.
818 Just like variable splitting, this is not safe if the loop is entered
819 via a jump to the bottom. Also, can not do this if no strength
820 reduce info, because precondition_loop_p uses this info. */
822 /* Must copy the loop body for preconditioning before the following
823 find_splittable_regs call since that will emit insns which need to
824 be after the preconditioned loop copies, but immediately before the
825 unrolled loop copies. */
827 /* Also, it is not safe to split induction variables for the preconditioned
828 copies of the loop body. If we split induction variables, then the code
829 assumes that each induction variable can be represented as a function
830 of its initial value and the loop iteration number. This is not true
831 in this case, because the last preconditioned copy of the loop body
832 could be any iteration from the first up to the `unroll_number-1'th,
833 depending on the initial value of the iteration variable. Therefore
834 we can not split induction variables here, because we can not calculate
835 their value. Hence, this code must occur before find_splittable_regs
836 is called. */
839 {
846 {
847 rtx diff;
862 /* Limit loop unrolling to 4, since this will make 7 copies of
863 the loop body. */
867 /* Save the absolute value of the increment, and also whether or
868 not it is negative. */
872 {
875 }
879 /* Final value may have form of (PLUS val1 const1_rtx). We need
880 to convert it into general operand, so compute the real value. */
883 {
888 }
892 /* Calculate the difference between the final and initial values.
893 Final value may be a (plus (reg x) (const_int 1)) rtx.
894 Let the following cse pass simplify this if initial value is
895 a constant.
897 We must copy the final and initial values here to avoid
898 improperly shared rtl.
900 We have to deal with for (i = 0; --i < 6;) type loops.
901 For such loops the real final value is the first time the
902 loop variable overflows, so the diff we calculate is the
903 distance from the overflow value. This is 0 or ~0 for
904 unsigned loops depending on the direction, or INT_MAX,
905 INT_MAX+1 for signed loops. We really do not need the
906 exact value, since we are only interested in the diff
907 modulo the increment, and the increment is a power of 2,
908 so we can pretend that the overflow value is 0/~0. */
913 OPTAB_LIB_WIDEN);
914 else
918 /* Now calculate (diff % (unroll * abs (increment))) by using an
919 and instruction. */
924 /* Now emit a sequence of branches to jump to the proper precond
925 loop entry point. */
931 /* Check for the case where the initial value is greater than or
932 equal to the final value. In that case, we want to execute
933 exactly one loop iteration. The code below will fail for this
934 case. This check does not apply if the loop has a NE
935 comparison at the end. */
938 {
939 rtx incremented_initval;
941 initial_value,
942 increment,
944 OPTAB_LIB_WIDEN);
949 TAKEN);
952 }
954 /* Assuming the unroll_number is 4, and the increment is 2, then
955 for a negative increment: for a positive increment:
956 diff = 0,1 precond 0 diff = 0,7 precond 0
957 diff = 2,3 precond 3 diff = 1,2 precond 1
958 diff = 4,5 precond 2 diff = 3,4 precond 2
959 diff = 6,7 precond 1 diff = 5,6 precond 3 */
961 /* We only need to emit (unroll_number - 1) branches here, the
962 last case just falls through to the following code. */
964 /* ??? This would give better code if we emitted a tree of branches
965 instead of the current linear list of branches. */
968 {
972 /* For negative increments, must invert the constant compared
973 against, except when comparing against zero. */
975 {
978 }
980 {
983 }
984 else
985 {
988 }
996 }
998 /* If the increment is greater than one, then we need another branch,
999 to handle other cases equivalent to 0. */
1001 /* ??? This should be merged into the code above somehow to help
1002 simplify the code here, and reduce the number of branches emitted.
1003 For the negative increment case, the branch here could easily
1004 be merged with the `0' case branch above. For the positive
1005 increment case, it is not clear how this can be simplified. */
1008 {
1013 {
1016 }
1017 else
1018 {
1021 }
1027 }
1033 /* Only the last copy of the loop body here needs the exit
1034 test, so set copy_end to exclude the compare/branch here,
1035 and then reset it inside the loop when get to the last
1036 copy. */
1041 {
1043 #ifdef HAVE_cc0
1044 /* The immediately preceding insn may be a compare which
1045 we do not want to copy. */
1048 #endif
1049 }
1050 else
1054 {
1070 {
1075 }
1076 /* The last copy needs the compare/branch insns at the end,
1077 so reset copy_end here if the loop ends with a conditional
1078 branch. */
1081 {
1084 else
1086 }
1088 /* None of the copies are the `last_iteration', so just
1089 pass zero for that parameter. */
1093 }
1097 {
1100 }
1101 else
1102 {
1104 #ifdef HAVE_cc0
1105 /* The instruction immediately before the JUMP_INSN may
1106 be a compare instruction which we do not want to copy
1107 or delete. */
1110 #endif
1112 }
1114 /* Set unroll type to MODULO now. */
1118 /* Clean up. */
1120 }
1121 }
1123 /* If reach here, and the loop type is UNROLL_NAIVE, then don't unroll
1124 the loop unless all loops are being unrolled. */
1126 {
1131 }
1133 /* At this point, we are guaranteed to unroll the loop. */
1135 /* Keep track of the unroll factor for the loop. */
1138 /* And whether the loop has been preconditioned. */
1141 /* For each biv and giv, determine whether it can be safely split into
1142 a different variable for each unrolled copy of the loop body.
1143 We precalculate and save this info here, since computing it is
1144 expensive.
1146 Do this before deleting any instructions from the loop, so that
1147 back_branch_in_range_p will work correctly. */
1151 else
1154 /* find_splittable_regs may have created some new registers, so must
1155 reallocate the reg_map with the new larger size, and must realloc
1156 the constant maps also. */
1169 /* Search the list of bivs and givs to find ones which need to be remapped
1170 when split, and set their reg_map entry appropriately. */
1173 {
1176 #if 0
1177 /* Currently, non-reduced/final-value givs are never split. */
1181 #endif
1182 }
1184 /* Use our current register alignment and pointer flags. */
1188 /* If the loop is being partially unrolled, and the iteration variables
1189 are being split, and are being renamed for the split, then must fix up
1190 the compare/jump instruction at the end of the loop to refer to the new
1191 registers. This compare isn't copied, so the registers used in it
1192 will never be replaced if it isn't done here. */
1195 {
1199 }
1201 /* For unroll_number times, make a copy of each instruction
1202 between copy_start and copy_end, and insert these new instructions
1203 before the end of the loop. */
1206 {
1218 {
1222 }
1224 /* If loop starts with a branch to the test, then fix it so that
1225 it points to the test of the first unrolled copy of the loop. */
1227 {
1232 CODE_LABEL_NUMBER
1236 /* Set the jump label so that it can be used by later loop unrolling
1237 passes. */
1240 }
1245 }
1247 /* Before deleting any insns, emit a CODE_LABEL immediately after the last
1248 insn to be deleted. This prevents any runaway delete_insn call from
1249 more insns that it should, as it always stops at a CODE_LABEL. */
1251 /* Delete the compare and branch at the end of the loop if completely
1252 unrolling the loop. Deleting the backward branch at the end also
1253 deletes the code label at the start of the loop. This is done at
1254 the very end to avoid problems with back_branch_in_range_p. */
1258 else
1261 /* Delete all of the original loop instructions. Don't delete the
1262 LOOP_BEG note, or the first code label in the loop. */
1266 {
1267 /* ??? Don't delete named code labels. They will be deleted when the
1268 jump that references them is deleted. Otherwise, we end up deleting
1269 them twice, which causes them to completely disappear instead of turn
1270 into NOTE_INSN_DELETED_LABEL notes. This in turn causes aborts in
1271 dwarfout.c/dwarf2out.c. We could perhaps fix the dwarf*out.c files
1272 to handle deleted labels instead. Or perhaps fix DECL_RTL of the
1273 associated LABEL_DECL to point to one of the new label instances. */
1274 /* ??? Likewise, we can't delete a NOTE_INSN_DELETED_LABEL note. */
1280 else
1282 }
1284 /* Can now delete the 'safety' label emitted to protect us from runaway
1285 delete_related_insns calls. */
1290 /* If exit_label exists, emit it after the loop. Doing the emit here
1291 forces it to have a higher INSN_UID than any insn in the unrolled loop.
1292 This is needed so that mostly_true_jump in reorg.c will treat jumps
1293 to this loop end label correctly, i.e. predict that they are usually
1294 not taken. */
1298 egress:
1300 {
1301 /* Remove the loop notes since this is no longer a loop. */
1310 }
1315 {
1318 }
1327 }
1328 \f
1329 /* Return true if the loop can be safely, and profitably, preconditioned
1330 so that the unrolled copies of the loop body don't need exit tests.
1332 This only works if final_value, initial_value and increment can be
1333 determined, and if increment is a constant power of 2.
1334 If increment is not a power of 2, then the preconditioning modulo
1335 operation would require a real modulo instead of a boolean AND, and this
1336 is not considered `profitable'. */
1338 /* ??? If the loop is known to be executed very many times, or the machine
1339 has a very cheap divide instruction, then preconditioning is a win even
1340 when the increment is not a power of 2. Use RTX_COST to compute
1341 whether divide is cheap.
1342 ??? A divide by constant doesn't actually need a divide, look at
1343 expand_divmod. The reduced cost of this optimized modulo is not
1344 reflected in RTX_COST. */
1346 int
1351 {
1356 {
1358 {
1362 }
1363 else
1364 {
1368 }
1372 {
1374 loop_dump_stream);
1378 }
1380 }
1383 {
1388 }
1390 {
1395 }
1397 {
1402 }
1404 {
1409 }
1412 {
1417 }
1419 /* Unsigned_compare and compare_dir can be ignored here, since they do
1420 not matter for preconditioning. */
1423 {
1428 }
1430 /* Must ensure that final_value is invariant, so call
1431 loop_invariant_p to check. Before doing so, must check regno
1432 against max_reg_before_loop to make sure that the register is in
1433 the range covered by loop_invariant_p. If it isn't, then it is
1434 most likely a biv/giv which by definition are not invariant. */
1440 {
1445 }
1447 /* Fail for floating point values, since the caller of this function
1448 does not have code to deal with them. */
1451 {
1456 }
1458 /* Fail if loop_info->iteration_var is not live before loop_start,
1459 since we need to test its value in the preconditioning code. */
1463 {
1468 }
1470 /* Note that loop_iterations biases the initial value for GIV iterators
1471 such as "while (i-- > 0)" so that we can calculate the number of
1472 iterations just like for BIV iterators.
1474 Also note that the absolute values of initial_value and
1475 final_value are unimportant as only their difference is used for
1476 calculating the number of loop iterations. */
1481 /* Decide what mode to do these calculations in. Choose the larger
1482 of final_value's mode and initial_value's mode, or a full-word if
1483 both are constants. */
1486 {
1490 }
1496 /* Success! */
1500 }
1502 /* All pseudo-registers must be mapped to themselves. Two hard registers
1503 must be mapped, VIRTUAL_STACK_VARS_REGNUM and VIRTUAL_INCOMING_ARGS_
1504 REGNUM, to avoid function-inlining specific conversions of these
1505 registers. All other hard regs can not be mapped because they may be
1506 used with different
1507 modes. */
1509 static void
1513 {
1518 /* Just clear the rest of the entries. */
1526 }
1527 \f
1528 /* Strength-reduction will often emit code for optimized biv/givs which
1529 calculates their value in a temporary register, and then copies the result
1530 to the iv. This procedure reconstructs the pattern computing the iv;
1531 verifying that all operands are of the proper form.
1533 PATTERN must be the result of single_set.
1534 The return value is the amount that the giv is incremented by. */
1536 static rtx
1540 {
1541 rtx increment;
1545 retry:
1546 /* Verify that we have an increment insn here. First check for a plus
1547 as the set source. */
1549 {
1550 /* SR sometimes computes the new giv value in a temp, then copies it
1551 to the new_reg. */
1557 /* The last insn emitted is not needed, so delete it to avoid confusing
1558 the second cse pass. This insn sets the giv unnecessarily. */
1560 }
1562 /* Verify that we have a constant as the second operand of the plus. */
1565 {
1566 /* SR sometimes puts the constant in a register, especially if it is
1567 too big to be an add immed operand. */
1570 /* SR may have used LO_SUM to compute the constant if it is too large
1571 for a load immed operand. In this case, the constant is in operand
1572 one of the LO_SUM rtx. */
1576 /* Some ports store large constants in memory and add a REG_EQUAL
1577 note to the store insn. */
1579 {
1583 }
1588 {
1589 /* The rs6000 port loads some constants with IOR.
1590 The alpha port loads some constants with ASHIFT and PLUS. */
1596 /* Don't need the last insn anymore. */
1607 else
1609 }
1614 /* The insn loading the constant into a register is no longer needed,
1615 so delete it. */
1617 }
1621 else
1624 /* Check that the source register is the same as the register we expected
1625 to see as the source. If not, something is seriously wrong. */
1628 {
1629 /* Some machines (e.g. the romp), may emit two add instructions for
1630 certain constants, so lets try looking for another add immediately
1631 before this one if we have only seen one add insn so far. */
1634 {
1635 tries++;
1643 }
1646 }
1649 }
1651 /* Copy REG_NOTES, except for insn references, because not all insn_map
1652 entries are valid yet. We do need to copy registers now though, because
1653 the reg_map entries can change during copying. */
1655 static rtx
1657 rtx notes;
1659 {
1660 rtx copy;
1671 /* Don't substitute for these yet. */
1673 else
1679 }
1681 /* Fixup insn references in copied REG_NOTES. */
1683 static void
1687 {
1689 {
1693 {
1694 /* Sometimes, we have a REG_WAS_0 note that points to a
1695 deleted instruction. In that case, we can just delete the
1696 note. */
1698 {
1701 }
1702 else
1703 {
1706 /* If we failed to remap the note, something is awry.
1707 Allow REG_LABEL as it may reference label outside
1708 the unrolled loop. */
1710 {
1713 }
1714 else
1716 }
1717 }
1720 }
1721 }
1723 /* Copy each instruction in the loop, substituting from map as appropriate.
1724 This is very similar to a loop in expand_inline_function. */
1726 static void
1729 copy_notes_from)
1733 rtx exit_label;
1737 {
1742 #ifdef HAVE_cc0
1744 #endif
1748 /* If this isn't the last iteration, then map any references to the
1749 start_label to final_label. Final label will then be emitted immediately
1750 after the end of this loop body if it was ever used.
1752 If this is the last iteration, then map references to the start_label
1753 to itself. */
1755 {
1758 }
1759 else
1765 do
1766 {
1772 {
1778 /* Check to see if this is a giv that has been combined with
1779 some split address givs. (Combined in the sense that
1780 `combine_givs' in loop.c has put two givs in the same register.)
1781 In this case, we must search all givs based on the same biv to
1782 find the address givs. Then split the address givs.
1783 Do this before splitting the giv, since that may map the
1784 SET_DEST to a new register. */
1789 {
1797 /* Although the giv_inc amount is not needed here, we must call
1798 calculate_giv_inc here since it might try to delete the
1799 last insn emitted. If we wait until later to call it,
1800 we might accidentally delete insns generated immediately
1801 below by emit_unrolled_add. */
1805 /* Now find all address giv's that were combined with this
1806 giv 'v'. */
1809 {
1812 /* If this DEST_ADDR giv was not split, then ignore it. */
1816 /* Scale this_giv_inc if the multiplicative factors of
1817 the two givs are different. */
1827 {
1828 /* Must emit an insn to increment the split address
1829 giv. Add in the const_adjust field in case there
1830 was a constant eliminated from the address. */
1833 /* tv->dest_reg will be either a bare register,
1834 or else a register plus a constant. */
1837 else
1840 /* Check for shared address givs, and avoid
1841 incrementing the shared pseudo reg more than
1842 once. */
1844 {
1845 /* tv->dest_reg may actually be a (PLUS (REG)
1846 (CONST)) here, so we must call plus_constant
1847 to add the const_adjust amount before calling
1848 emit_unrolled_add below. */
1853 {
1854 /* The constant could be too large for an add
1855 immediate, so can't directly emit an insn
1856 here. */
1859 }
1860 }
1862 /* Reset the giv to be just the register again, in case
1863 it is used after the set we have just emitted.
1864 We must subtract the const_adjust factor added in
1865 above. */
1869 }
1870 }
1871 }
1873 /* If this is a setting of a splittable variable, then determine
1874 how to split the variable, create a new set based on this split,
1875 and set up the reg_map so that later uses of the variable will
1876 use the new split variable. */
1883 {
1891 /* Compute the increment value for the giv, if it wasn't
1892 already computed above. */
1899 {
1900 /* Completely unrolling the loop. Set the induction
1901 variable to a known constant value. */
1903 /* The value in splittable_regs may be an invariant
1904 value, so we must use plus_constant here. */
1910 {
1913 }
1914 else
1915 {
1916 /* The splittable_regs value must be a REG or a
1917 CONST_INT, so put the entire value in the giv_src_reg
1918 variable. */
1921 }
1922 }
1923 else
1924 {
1925 /* Partially unrolling loop. Create a new pseudo
1926 register for the iteration variable, and set it to
1927 be a constant plus the original register. Except
1928 on the last iteration, when the result has to
1929 go back into the original iteration var register. */
1931 /* Handle bivs which must be mapped to a new register
1932 when split. This happens for bivs which need their
1933 final value set before loop entry. The new register
1934 for the biv was stored in the biv's first struct
1935 induction entry by find_splittable_regs. */
1939 {
1942 }
1944 #if 0
1945 /* If non-reduced/final-value givs were split, then
1946 this would have to remap those givs also. See
1947 find_splittable_regs. */
1948 #endif
1952 giv_inc,
1956 /* Now split the induction variable by changing the dest
1957 of this insn to a new register, and setting its
1958 reg_map entry to point to this new register.
1960 If this is the last iteration, and this is the last insn
1961 that will update the iv, then reuse the original dest,
1962 to ensure that the iv will have the proper value when
1963 the loop exits or repeats.
1965 Using splittable_regs_updates here like this is safe,
1966 because it can only be greater than one if all
1967 instructions modifying the iv are always executed in
1968 order. */
1972 {
1977 giv_inc == const0_rtx
1978 ? giv_src_reg
1982 }
1983 else
1985 }
1987 /* The constant being added could be too large for an add
1988 immediate, so can't directly emit an insn here. */
1992 }
1993 else
1994 {
1997 }
2001 #ifdef HAVE_cc0
2002 /* If this insn is setting CC0, it may need to look at
2003 the insn that uses CC0 to see what type of insn it is.
2004 In that case, the call to recog via validate_change will
2005 fail. So don't substitute constants here. Instead,
2006 do it when we emit the following insn.
2008 For example, see the pyr.md file. That machine has signed and
2009 unsigned compares. The compare patterns must check the
2010 following branch insn to see which what kind of compare to
2011 emit.
2013 If the previous insn set CC0, substitute constants on it as
2014 well. */
2017 else
2018 {
2023 }
2024 #else
2026 #endif
2028 /* Make split induction variable constants `permanent' since we
2029 know there are no backward branches across iteration variable
2030 settings which would invalidate this. */
2032 {
2039 }
2049 {
2051 CODE_LABEL_NUMBER
2054 }
2057 {
2059 /* This is a branch to the beginning of the loop; this is the
2060 last insn being copied; and this is not the last iteration.
2061 In this case, we want to change the original fall through
2062 case to be a branch past the end of the loop, and the
2063 original jump label case to fall_through. */
2066 {
2067 rtx jmp;
2069 /* Can't do it by reversing the jump (probably because we
2070 couldn't reverse the conditions), so emit a new
2071 jump_insn after COPY, and redirect the jump around
2072 that. */
2081 }
2082 }
2084 #ifdef HAVE_cc0
2088 #endif
2091 /* Set the jump label of COPY correctly to avoid problems with
2092 later passes of unroll_loop, if INSN had jump label set. */
2094 {
2097 /* Can't use the label_map for every insn, since this may be
2098 the backward branch, and hence the label was not mapped. */
2100 {
2105 {
2108 else
2110 }
2111 }
2115 else
2116 {
2117 /* An unrecognizable jump insn, probably the entry jump
2118 for a switch statement. This label must have been mapped,
2119 so just use the label_map to get the new jump label. */
2123 }
2125 /* If this is a non-local jump, then must increase the label
2126 use count so that the label will not be deleted when the
2127 original jump is deleted. */
2129 }
2132 {
2140 }
2142 /* If this used to be a conditional jump insn but whose branch
2143 direction is now known, we must do something special. */
2145 {
2146 #ifdef HAVE_cc0
2147 /* If the previous insn set cc0 for us, delete it. */
2150 #endif
2152 /* If this is now a no-op, delete it. */
2154 {
2157 }
2158 else
2159 /* Otherwise, this is unconditional jump so we must put a
2160 BARRIER after it. We could do some dead code elimination
2161 here, but jump.c will do it just as well. */
2163 }
2173 /* Because the USAGE information potentially contains objects other
2174 than hard registers, we need to copy it. */
2179 #ifdef HAVE_cc0
2183 #endif
2186 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
2192 /* If this is the loop start label, then we don't need to emit a
2193 copy of this label since no one will use it. */
2196 {
2200 }
2208 /* VTOP and CONT notes are valid only before the loop exit test.
2209 If placed anywhere else, loop may generate bad code. */
2210 /* BASIC_BLOCK notes exist to stabilize basic block structures with
2211 the associated rtl. We do not want to share the structure in
2212 this new block. */
2222 else
2228 }
2231 }
2234 /* Now finish coping the REG_NOTES. */
2236 do
2237 {
2243 }
2246 /* There may be notes between copy_notes_from and loop_end. Emit a copy of
2247 each of these notes here, since there may be some important ones, such as
2248 NOTE_INSN_BLOCK_END notes, in this group. We don't do this on the last
2249 iteration, because the original notes won't be deleted.
2251 We can't use insert_before here, because when from preconditioning,
2252 insert_before points before the loop. We can't use copy_end, because
2253 there may be insns already inserted after it (which we don't want to
2254 copy) when not from preconditioning code. */
2257 {
2259 {
2260 /* VTOP notes are valid only before the loop exit test.
2261 If placed anywhere else, loop may generate bad code.
2262 There is no need to test for NOTE_INSN_LOOP_CONT notes
2263 here, since COPY_NOTES_FROM will be at most one or two (for cc0)
2264 instructions before the last insn in the loop, and if the
2265 end test is that short, there will be a VTOP note between
2266 the CONT note and the test. */
2272 }
2273 }
2281 }
2282 \f
2283 /* Emit an insn, using the expand_binop to ensure that a valid insn is
2284 emitted. This will correctly handle the case where the increment value
2285 won't fit in the immediate field of a PLUS insns. */
2287 void
2290 {
2291 rtx result;
2298 }
2299 \f
2300 /* Searches the insns between INSN and LOOP->END. Returns 1 if there
2301 is a backward branch in that range that branches to somewhere between
2302 LOOP->START and INSN. Returns 0 otherwise. */
2304 /* ??? This is quadratic algorithm. Could be rewritten to be linear.
2305 In practice, this is not a problem, because this function is seldom called,
2306 and uses a negligible amount of CPU time on average. */
2308 int
2311 rtx insn;
2312 {
2318 /* Stop before we get to the backward branch at the end of the loop. */
2323 /* Check in case insn has been deleted, search forward for first non
2324 deleted insn following it. */
2328 /* Check for the case where insn is the last insn in the loop. Deal
2329 with the case where INSN was a deleted loop test insn, in which case
2330 it will now be the NOTE_LOOP_END. */
2335 {
2337 {
2340 /* Search from loop_start to insn, to see if one of them is
2341 the target_insn. We can't use INSN_LUID comparisons here,
2342 since insn may not have an LUID entry. */
2346 }
2347 }
2350 }
2352 /* Try to generate the simplest rtx for the expression
2353 (PLUS (MULT mult1 mult2) add1). This is used to calculate the initial
2354 value of giv's. */
2356 static rtx
2360 {
2362 rtx result;
2364 /* The modes must all be the same. This should always be true. For now,
2365 check to make sure. */
2371 /* Ensure that if at least one of mult1/mult2 are constant, then mult2
2372 will be a constant. */
2374 {
2378 }
2384 /* Again, put the constant second. */
2386 {
2390 }
2397 }
2399 /* Searches the list of induction struct's for the biv BL, to try to calculate
2400 the total increment value for one iteration of the loop as a constant.
2402 Returns the increment value as an rtx, simplified as much as possible,
2403 if it can be calculated. Otherwise, returns 0. */
2405 rtx
2408 {
2410 rtx result;
2412 /* For increment, must check every instruction that sets it. Each
2413 instruction must be executed only once each time through the loop.
2414 To verify this, we check that the insn is always executed, and that
2415 there are no backward branches after the insn that branch to before it.
2416 Also, the insn must have a mult_val of one (to make sure it really is
2417 an increment). */
2421 {
2425 else
2427 }
2430 }
2432 /* For each biv and giv, determine whether it can be safely split into
2433 a different variable for each unrolled copy of the loop body. If it
2434 is safe to split, then indicate that by saving some useful info
2435 in the splittable_regs array.
2437 If the loop is being completely unrolled, then splittable_regs will hold
2438 the current value of the induction variable while the loop is unrolled.
2439 It must be set to the initial value of the induction variable here.
2440 Otherwise, splittable_regs will hold the difference between the current
2441 value of the induction variable and the value the induction variable had
2442 at the top of the loop. It must be set to the value 0 here.
2444 Returns the total number of instructions that set registers that are
2445 splittable. */
2447 /* ?? If the loop is only unrolled twice, then most of the restrictions to
2448 constant values are unnecessary, since we can easily calculate increment
2449 values in this case even if nothing is constant. The increment value
2450 should not involve a multiply however. */
2452 /* ?? Even if the biv/giv increment values aren't constant, it may still
2453 be beneficial to split the variable if the loop is only unrolled a few
2454 times, since multiplies by small integers (1,2,3,4) are very cheap. */
2456 static int
2461 {
2466 rtx biv_final_value;
2471 {
2472 /* Biv_total_increment must return a constant value,
2473 otherwise we can not calculate the split values. */
2479 /* The loop must be unrolled completely, or else have a known number
2480 of iterations and only one exit, or else the biv must be dead
2481 outside the loop, or else the final value must be known. Otherwise,
2482 it is unsafe to split the biv since it may not have the proper
2483 value on loop exit. */
2485 /* loop_number_exit_count is non-zero if the loop has an exit other than
2486 a fall through at the end. */
2501 /* If any of the insns setting the BIV don't do so with a simple
2502 PLUS, we don't know how to split it. */
2510 /* If final value is non-zero, then must emit an instruction which sets
2511 the value of the biv to the proper value. This is done after
2512 handling all of the givs, since some of them may need to use the
2513 biv's value in their initialization code. */
2515 /* This biv is splittable. If completely unrolling the loop, save
2516 the biv's initial value. Otherwise, save the constant zero. */
2519 {
2521 {
2522 /* If the initial value of the biv is itself (i.e. it is too
2523 complicated for strength_reduce to compute), or is a hard
2524 register, or it isn't invariant, then we must create a new
2525 pseudo reg to hold the initial value of the biv. */
2531 {
2544 }
2545 else
2547 }
2548 else
2551 /* Save the number of instructions that modify the biv, so that
2552 we can treat the last one specially. */
2560 }
2562 /* Check every giv that depends on this biv to see whether it is
2563 splittable also. Even if the biv isn't splittable, givs which
2564 depend on it may be splittable if the biv is live outside the
2565 loop, and the givs aren't. */
2568 unroll_number);
2570 /* If final value is non-zero, then must emit an instruction which sets
2571 the value of the biv to the proper value. This is done after
2572 handling all of the givs, since some of them may need to use the
2573 biv's value in their initialization code. */
2575 {
2576 /* If the loop has multiple exits, emit the insns before the
2577 loop to ensure that it will always be executed no matter
2578 how the loop exits. Otherwise emit the insn after the loop,
2579 since this is slightly more efficient. */
2582 biv_final_value));
2583 else
2584 {
2585 /* Create a new register to hold the value of the biv, and then
2586 set the biv to its final value before the loop start. The biv
2587 is set to its final value before loop start to ensure that
2588 this insn will always be executed, no matter how the loop
2589 exits. */
2595 biv_final_value));
2601 /* Set up the mapping from the original biv register to the new
2602 register. */
2604 }
2605 }
2606 }
2608 }
2610 /* Return 1 if the first and last unrolled copy of the address giv V is valid
2611 for the instruction that is using it. Do not make any changes to that
2612 instruction. */
2614 static int
2617 rtx giv_inc;
2619 {
2625 /* First check to see if either address would fail. Handle the fact
2626 that we have may have a match_dup. */
2631 /* Now put things back the way they were before. This should always
2632 succeed. */
2637 }
2639 /* For every giv based on the biv BL, check to determine whether it is
2640 splittable. This is a subroutine to find_splittable_regs ().
2642 Return the number of instructions that set splittable registers. */
2644 static int
2649 rtx increment;
2651 {
2654 rtx final_value;
2655 rtx tem;
2658 /* Scan the list of givs, and set the same_insn field when there are
2659 multiple identical givs in the same insn. */
2667 {
2670 /* Only split the giv if it has already been reduced, or if the loop is
2671 being completely unrolled. */
2675 /* The giv can be split if the insn that sets the giv is executed once
2676 and only once on every iteration of the loop. */
2677 /* An address giv can always be split. v->insn is just a use not a set,
2678 and hence it does not matter whether it is always executed. All that
2679 matters is that all the biv increments are always executed, and we
2680 won't reach here if they aren't. */
2686 /* The giv increment value must be a constant. */
2692 /* The loop must be unrolled completely, or else have a known number of
2693 iterations and only one exit, or else the giv must be dead outside
2694 the loop, or else the final value of the giv must be known.
2695 Otherwise, it is not safe to split the giv since it may not have the
2696 proper value on loop exit. */
2698 /* The used outside loop test will fail for DEST_ADDR givs. They are
2699 never used outside the loop anyways, so it is always safe to split a
2700 DEST_ADDR giv. */
2706 /* The next part is true if the pseudo is used outside the loop.
2707 We assume that this is true for any pseudo created after loop
2708 starts, because we don't have a reg_n_info entry for them. */
2711 /* Check for the case where the pseudo is set by a shift/add
2712 sequence, in which case the first insn setting the pseudo
2713 is the first insn of the shift/add sequence. */
2717 /* Line above always fails if INSN was moved by loop opt. */
2723 #if 0
2724 /* Currently, non-reduced/final-value givs are never split. */
2725 /* Should emit insns after the loop if possible, as the biv final value
2726 code below does. */
2728 /* If the final value is non-zero, and the giv has not been reduced,
2729 then must emit an instruction to set the final value. */
2731 {
2732 /* Create a new register to hold the value of the giv, and then set
2733 the giv to its final value before the loop start. The giv is set
2734 to its final value before loop start to ensure that this insn
2735 will always be executed, no matter how we exit. */
2745 }
2746 #endif
2748 /* This giv is splittable. If completely unrolling the loop, save the
2749 giv's initial value. Otherwise, save the constant zero for it. */
2752 {
2753 /* It is not safe to use bl->initial_value here, because it may not
2754 be invariant. It is safe to use the initial value stored in
2755 the splittable_regs array if it is set. In rare cases, it won't
2756 be set, so then we do exactly the same thing as
2757 find_splittable_regs does to get a safe value. */
2758 rtx biv_initial_value;
2766 else
2767 {
2773 }
2777 }
2778 else
2782 {
2783 /* If a giv was combined with another giv, then we can only split
2784 this giv if the giv it was combined with was reduced. This
2785 is because the value of v->new_reg is meaningless in this
2786 case. */
2788 {
2793 }
2794 /* If the giv is an address destination, it could be something other
2795 than a simple register, these have to be treated differently. */
2797 {
2798 /* If value is not a constant, register, or register plus
2799 constant, then compute its value into a register before
2800 loop start. This prevents invalid rtx sharing, and should
2801 generate better code. We can use bl->initial_value here
2802 instead of splittable_regs[bl->regno] because this code
2803 is going before the loop start. */
2810 {
2816 }
2819 }
2820 else
2821 {
2822 /* Splitting address givs is useful since it will often allow us
2823 to eliminate some increment insns for the base giv as
2824 unnecessary. */
2826 /* If the addr giv is combined with a dest_reg giv, then all
2827 references to that dest reg will be remapped, which is NOT
2828 what we want for split addr regs. We always create a new
2829 register for the split addr giv, just to be safe. */
2831 /* If we have multiple identical address givs within a
2832 single instruction, then use a single pseudo reg for
2833 both. This is necessary in case one is a match_dup
2834 of the other. */
2839 {
2845 }
2846 /* If multiple address GIVs have been combined with the
2847 same dest_reg GIV, do not create a new register for
2848 each. */
2853 /* combine_givs_p may return true for some cases
2854 where the add and mult values are not equal.
2855 To share a register here, the values must be
2856 equal. */
2859 /* If the memory references have different modes,
2860 then the address may not be valid and we must
2861 not share registers. */
2863 {
2866 }
2868 {
2871 /* Check the resulting address for validity, and fail
2872 if the resulting address would be invalid. */
2874 {
2884 }
2885 }
2886 else
2889 /* Store the value of dest_reg into the insn. This sharing
2890 will not be a problem as this insn will always be copied
2891 later. */
2895 /* If this address giv is combined with a dest reg giv, then
2896 save the base giv's induction pointer so that we will be
2897 able to handle this address giv properly. The base giv
2898 itself does not have to be splittable. */
2904 {
2905 /* This giv maybe hasn't been combined with any others.
2906 Make sure that it's giv is marked as splittable here. */
2910 /* Make it appear to depend upon itself, so that the
2911 giv will be properly split in the main loop above. */
2913 {
2916 }
2917 }
2921 }
2922 }
2923 else
2924 {
2925 #if 0
2926 /* Currently, unreduced giv's can't be split. This is not too much
2927 of a problem since unreduced giv's are not live across loop
2928 iterations anyways. When unrolling a loop completely though,
2929 it makes sense to reduce&split givs when possible, as this will
2930 result in simpler instructions, and will not require that a reg
2931 be live across loop iterations. */
2936 #else
2938 #endif
2939 }
2941 /* Unreduced givs are only updated once by definition. Reduced givs
2942 are updated as many times as their biv is. Mark it so if this is
2943 a splittable register. Don't need to do anything for address givs
2944 where this may not be a register. */
2947 {
2953 }
2955 result++;
2958 {
2965 else
2969 }
2970 }
2973 }
2974 \f
2975 /* Try to prove that the register is dead after the loop exits. Trace every
2976 loop exit looking for an insn that will always be executed, which sets
2977 the register to some value, and appears before the first use of the register
2978 is found. If successful, then return 1, otherwise return 0. */
2980 /* ?? Could be made more intelligent in the handling of jumps, so that
2981 it can search past if statements and other similar structures. */
2983 static int
2986 rtx reg;
2987 {
2993 /* In addition to checking all exits of this loop, we must also check
2994 all exits of inner nested loops that would exit this loop. We don't
2995 have any way to identify those, so we just give up if there are any
2996 such inner loop exits. */
2999 label_count++;
3004 /* HACK: Must also search the loop fall through exit, create a label_ref
3005 here which points to the loop->end, and append the loop_number_exit_labels
3006 list to it. */
3011 {
3012 /* Succeed if find an insn which sets the biv or if reach end of
3013 function. Fail if find an insn that uses the biv, or if come to
3014 a conditional jump. */
3018 {
3021 {
3022 rtx set;
3030 }
3033 {
3037 /* Prevent infinite loop following infinite loops. */
3040 else
3042 }
3045 }
3046 }
3048 /* Success, the register is dead on all loop exits. */
3050 }
3052 /* Try to calculate the final value of the biv, the value it will have at
3053 the end of the loop. If we can do it, return that value. */
3055 rtx
3059 {
3063 /* ??? This only works for MODE_INT biv's. Reject all others for now. */
3068 /* The final value for reversed bivs must be calculated differently than
3069 for ordinary bivs. In this case, there is already an insn after the
3070 loop which sets this biv's final value (if necessary), and there are
3071 no other loop exits, so we can return any value. */
3073 {
3079 }
3081 /* Try to calculate the final value as initial value + (number of iterations
3082 * increment). For this to work, increment must be invariant, the only
3083 exit from the loop must be the fall through at the bottom (otherwise
3084 it may not have its final value when the loop exits), and the initial
3085 value of the biv must be invariant. */
3090 {
3094 {
3095 /* Can calculate the loop exit value, emit insns after loop
3096 end to calculate this value into a temporary register in
3097 case it is needed later. */
3109 }
3110 }
3112 /* Check to see if the biv is dead at all loop exits. */
3114 {
3121 }
3124 }
3126 /* Try to calculate the final value of the giv, the value it will have at
3127 the end of the loop. If we can do it, return that value. */
3129 rtx
3133 {
3136 rtx insn;
3138 rtx seq;
3144 /* The final value for givs which depend on reversed bivs must be calculated
3145 differently than for ordinary givs. In this case, there is already an
3146 insn after the loop which sets this giv's final value (if necessary),
3147 and there are no other loop exits, so we can return any value. */
3149 {
3155 }
3157 /* Try to calculate the final value as a function of the biv it depends
3158 upon. The only exit from the loop must be the fall through at the bottom
3159 and the insn that sets the giv must be executed on every iteration
3160 (otherwise the giv may not have its final value when the loop exits). */
3162 /* ??? Can calculate the final giv value by subtracting off the
3163 extra biv increments times the giv's mult_val. The loop must have
3164 only one exit for this to work, but the loop iterations does not need
3165 to be known. */
3170 {
3171 /* ?? It is tempting to use the biv's value here since these insns will
3172 be put after the loop, and hence the biv will have its final value
3173 then. However, this fails if the biv is subsequently eliminated.
3174 Perhaps determine whether biv's are eliminable before trying to
3175 determine whether giv's are replaceable so that we can use the
3176 biv value here if it is not eliminable. */
3178 /* We are emitting code after the end of the loop, so we must make
3179 sure that bl->initial_value is still valid then. It will still
3180 be valid if it is invariant. */
3186 {
3187 /* Can calculate the loop exit value of its biv as
3188 (n_iterations * increment) + initial_value */
3190 /* The loop exit value of the giv is then
3191 (final_biv_value - extra increments) * mult_val + add_val.
3192 The extra increments are any increments to the biv which
3193 occur in the loop after the giv's value is calculated.
3194 We must search from the insn that sets the giv to the end
3195 of the loop to calculate this value. */
3197 /* Put the final biv value in tem. */
3203 tem);
3205 /* Subtract off extra increments as we find them. */
3208 {
3213 {
3217 OPTAB_LIB_WIDEN);
3221 }
3222 }
3224 /* Now calculate the giv's final value. */
3233 }
3234 }
3236 /* Replaceable giv's should never reach here. */
3240 /* Check to see if the biv is dead at all loop exits. */
3242 {
3249 }
3252 }
3254 /* Look back before LOOP->START for the insn that sets REG and return
3255 the equivalent constant if there is a REG_EQUAL note otherwise just
3256 the SET_SRC of REG. */
3258 static rtx
3261 rtx reg;
3262 {
3265 rtx ret;
3269 {
3274 {
3275 /* We found the last insn before the loop that sets the register.
3276 If it sets the entire register, and has a REG_EQUAL note,
3277 then use the value of the REG_EQUAL note. */
3280 {
3283 /* Only use the REG_EQUAL note if it is a constant.
3284 Other things, divide in particular, will cause
3285 problems later if we use them. */
3289 else
3292 /* We cannot do this if it changes between the
3293 assignment and loop start though. */
3296 }
3298 }
3299 }
3301 }
3303 /* Return a simplified rtx for the expression OP - REG.
3305 REG must appear in OP, and OP must be a register or the sum of a register
3306 and a second term.
3308 Thus, the return value must be const0_rtx or the second term.
3310 The caller is responsible for verifying that REG appears in OP and OP has
3311 the proper form. */
3313 static rtx
3316 {
3320 {
3325 }
3326 /* OP does not contain REG as a term. */
3328 }
3330 /* Find and return register term common to both expressions OP0 and
3331 OP1 or NULL_RTX if no such term exists. Each expression must be a
3332 REG or a PLUS of a REG. */
3334 static rtx
3337 {
3340 {
3341 rtx op00;
3342 rtx op01;
3343 rtx op10;
3344 rtx op11;
3348 else
3353 else
3356 /* Find and return common register term if present. */
3361 }
3363 /* No common register term found. */
3365 }
3367 /* Determine the loop iterator and calculate the number of loop
3368 iterations. Returns the exact number of loop iterations if it can
3369 be calculated, otherwise returns zero. */
3371 unsigned HOST_WIDE_INT
3374 {
3380 HOST_WIDE_INT inc;
3386 rtx last_loop_insn;
3387 rtx reg_term;
3401 /* We used to use prev_nonnote_insn here, but that fails because it might
3402 accidentally get the branch for a contained loop if the branch for this
3403 loop was deleted. We can only trust branches immediately before the
3404 loop_end. */
3407 /* ??? We should probably try harder to find the jump insn
3408 at the end of the loop. The following code assumes that
3409 the last loop insn is a jump to the top of the loop. */
3411 {
3416 }
3418 /* If there is a more than a single jump to the top of the loop
3419 we cannot (easily) determine the iteration count. */
3421 {
3426 }
3428 /* If there are multiple conditionalized loop exit tests, they may jump
3429 back to differing CODE_LABELs. */
3431 {
3434 do
3435 {
3437 {
3438 /* There are some kinds of jumps we can't deal with easily. */
3440 {
3442 fprintf
3446 }
3449 covered by the uid_luid array. */
3451 /* Check if we jump back into the loop body. */
3454 {
3456 fprintf
3460 }
3461 }
3462 }
3464 }
3466 /* Find the iteration variable. If the last insn is a conditional
3467 branch, and the insn before tests a register value, make that the
3468 iteration variable. */
3472 {
3477 }
3479 /* ??? Get_condition may switch position of induction variable and
3480 invariant register when it canonicalizes the comparison. */
3487 {
3492 }
3494 /* The only new registers that are created before loop iterations
3495 are givs made from biv increments or registers created by
3496 load_mems. In the latter case, it is possible that try_copy_prop
3497 will propagate a new pseudo into the old iteration register but
3498 this will be marked by having the REG_USERVAR_P bit set. */
3504 /* Determine the initial value of the iteration variable, and the amount
3505 that it is incremented each loop. Use the tables constructed by
3506 the strength reduction pass to calculate these values. */
3508 /* Clear the result values, in case no answer can be found. */
3512 /* The iteration variable can be either a giv or a biv. Check to see
3513 which it is, and compute the variable's initial value, and increment
3514 value if possible. */
3516 /* If this is a new register, can't handle it since we don't have any
3517 reg_iv_type entry for it. */
3519 {
3524 }
3526 /* Reject iteration variables larger than the host wide int size, since they
3527 could result in a number of iterations greater than the range of our
3528 `unsigned HOST_WIDE_INT' variable loop_info->n_iterations. */
3531 {
3536 }
3538 {
3543 }
3545 {
3549 /* Grab initial value, only useful if it is a constant. */
3553 {
3558 }
3561 }
3563 {
3566 rtx biv_initial_value;
3572 {
3577 }
3581 /* Increment value is mult_val times the increment value of the biv. */
3585 {
3591 /* The caller assumes that one full increment has occurred at the
3592 first loop test. But that's not true when the biv is incremented
3593 after the giv is set (which is the usual case), e.g.:
3594 i = 6; do {;} while (i++ < 9) .
3595 Therefore, we bias the initial value by subtracting the amount of
3596 the increment that occurs between the giv set and the giv test. */
3598 {
3600 {
3602 {
3608 }
3611 }
3612 }
3613 }
3619 /* Initial value is mult_val times the biv's initial value plus
3620 add_val. Only useful if it is a constant. */
3622 initial_value
3626 }
3627 else
3628 {
3633 }
3641 {
3655 /* Cannot determine loop iterations with this case. */
3672 }
3674 /* If the comparison value is an invariant register, then try to find
3675 its value from the insns before the start of the loop. */
3680 {
3683 /* If we don't get an invariant final value, we are better
3684 off with the original register. */
3687 }
3689 /* Calculate the approximate final value of the induction variable
3690 (on the last successful iteration). The exact final value
3691 depends on the branch operator, and increment sign. It will be
3692 wrong if the iteration variable is not incremented by one each
3693 time through the loop and (comparison_value + off_by_one -
3694 initial_value) % increment != 0.
3695 ??? Note that the final_value may overflow and thus final_larger
3696 will be bogus. A potentially infinite loop will be classified
3697 as immediate, e.g. for (i = 0x7ffffff0; i <= 0x7fffffff; i++) */
3701 /* Save the calculated values describing this loop's bounds, in case
3702 precondition_loop_p will need them later. These values can not be
3703 recalculated inside precondition_loop_p because strength reduction
3704 optimizations may obscure the loop's structure.
3706 These values are only required by precondition_loop_p and insert_bct
3707 whenever the number of iterations cannot be computed at compile time.
3708 Only the difference between final_value and initial_value is
3709 important. Note that final_value is only approximate. */
3718 /* Try to determine the iteration count for loops such
3719 as (for i = init; i < init + const; i++). When running the
3720 loop optimization twice, the first pass often converts simple
3721 loops into this form. */
3724 {
3725 rtx reg1;
3726 rtx reg2;
3727 rtx const2;
3732 else
3735 /* Check for initial_value = reg1, final_value = reg2 + const2,
3736 where reg1 != reg2. */
3738 {
3739 rtx temp;
3741 /* Find what reg1 is equivalent to. Hopefully it will
3742 either be reg2 or reg2 plus a constant. */
3747 else
3748 {
3749 /* Find what reg2 is equivalent to. Hopefully it will
3750 either be reg1 or reg1 plus a constant. Let's ignore
3751 the latter case for now since it is not so common. */
3759 }
3760 }
3762 {
3763 rtx temp;
3765 /* When running the loop optimizer twice, check_dbra_loop
3766 further obfuscates reversible loops of the form:
3767 for (i = init; i < init + const; i++). We often end up with
3768 final_value = 0, initial_value = temp, temp = temp2 - init,
3769 where temp2 = init + const. If the loop has a vtop we
3770 can replace initial_value with const. */
3775 {
3781 }
3782 }
3783 }
3785 /* If have initial_value = reg + const1 and final_value = reg +
3786 const2, then replace initial_value with const1 and final_value
3787 with const2. This should be safe since we are protected by the
3788 initial comparison before entering the loop if we have a vtop.
3789 For example, a + b < a + c is not equivalent to b < c for all a
3790 when using modulo arithmetic.
3792 ??? Without a vtop we could still perform the optimization if we check
3793 the initial and final values carefully. */
3796 {
3799 }
3804 /* For EQ comparison loops, we don't have a valid final value.
3805 Check this now so that we won't leave an invalid value if we
3806 return early for any other reason. */
3811 {
3816 }
3819 {
3820 /* If we have a REG, check to see if REG holds a constant value. */
3821 /* ??? Other RTL, such as (neg (reg)) is possible here, but it isn't
3822 clear if it is worthwhile to try to handle such RTL. */
3827 {
3829 {
3834 }
3836 }
3838 }
3841 {
3843 {
3848 }
3850 }
3852 {
3854 {
3859 }
3861 }
3863 {
3864 rtx inc_once;
3873 {
3874 /* The iterator value once through the loop is equal to the
3875 comparision value. Either we have an infinite loop, or
3876 we'll loop twice. */
3880 }
3881 else
3885 loop_info->final_value
3889 else
3890 loop_info->final_value
3893 loop_info->final_equiv_value
3898 }
3900 /* Final_larger is 1 if final larger, 0 if they are equal, otherwise -1. */
3902 final_larger
3907 else
3915 else
3918 /* There are 27 different cases: compare_dir = -1, 0, 1;
3919 final_larger = -1, 0, 1; increment_dir = -1, 0, 1.
3920 There are 4 normal cases, 4 reverse cases (where the iteration variable
3921 will overflow before the loop exits), 4 infinite loop cases, and 15
3922 immediate exit (0 or 1 iteration depending on loop type) cases.
3923 Only try to optimize the normal cases. */
3925 /* (compare_dir/final_larger/increment_dir)
3926 Normal cases: (0/-1/-1), (0/1/1), (-1/-1/-1), (1/1/1)
3927 Reverse cases: (0/-1/1), (0/1/-1), (-1/-1/1), (1/1/-1)
3928 Infinite loops: (0/-1/0), (0/1/0), (-1/-1/0), (1/1/0)
3929 Immediate exit: (0/0/X), (-1/0/X), (-1/1/X), (1/0/X), (1/-1/X) */
3931 /* ?? If the meaning of reverse loops (where the iteration variable
3932 will overflow before the loop exits) is undefined, then could
3933 eliminate all of these special checks, and just always assume
3934 the loops are normal/immediate/infinite. Note that this means
3935 the sign of increment_dir does not have to be known. Also,
3936 since it does not really hurt if immediate exit loops or infinite loops
3937 are optimized, then that case could be ignored also, and hence all
3938 loops can be optimized.
3940 According to ANSI Spec, the reverse loop case result is undefined,
3941 because the action on overflow is undefined.
3943 See also the special test for NE loops below. */
3947 /* Normal case. */
3948 ;
3949 else
3950 {
3954 }
3956 /* Calculate the number of iterations, final_value is only an approximation,
3957 so correct for that. Note that abs_diff and n_iterations are
3958 unsigned, because they can be as large as 2^n - 1. */
3962 {
3965 }
3967 {
3970 }
3971 else
3974 /* Given that iteration_var is going to iterate over its own mode,
3975 not HOST_WIDE_INT, disregard higher bits that might have come
3976 into the picture due to sign extension of initial and final
3977 values. */
3982 /* For NE tests, make sure that the iteration variable won't miss
3983 the final value. If abs_diff mod abs_incr is not zero, then the
3984 iteration variable will overflow before the loop exits, and we
3985 can not calculate the number of iterations. */
3989 /* Note that the number of iterations could be calculated using
3990 (abs_diff + abs_inc - 1) / abs_inc, provided care was taken to
3991 handle potential overflow of the summation. */
3994 }
3996 /* Replace uses of split bivs with their split pseudo register. This is
3997 for original instructions which remain after loop unrolling without
3998 copying. */
4000 static rtx
4003 rtx x;
4004 {
4015 {
4027 #if 0
4028 /* If non-reduced/final-value givs were split, then this would also
4029 have to remap those givs also. */
4030 #endif
4038 }
4042 {
4046 {
4050 }
4051 }
4053 }
4055 /* If FIRST_UID is a set of REGNO, and FIRST_UID dominates LAST_UID (e.g.
4056 FIST_UID is always executed if LAST_UID is), then return 1. Otherwise
4057 return 0. COPY_START is where we can start looking for the insns
4058 FIRST_UID and LAST_UID. COPY_END is where we stop looking for these
4059 insns.
4061 If there is no JUMP_INSN between LOOP_START and FIRST_UID, then FIRST_UID
4062 must dominate LAST_UID.
4064 If there is a CODE_LABEL between FIRST_UID and LAST_UID, then FIRST_UID
4065 may not dominate LAST_UID.
4067 If there is no CODE_LABEL between FIRST_UID and LAST_UID, then FIRST_UID
4068 must dominate LAST_UID. */
4070 int
4075 rtx copy_start;
4076 rtx copy_end;
4077 {
4082 {
4085 /* Could not find FIRST_UID. */
4089 }
4091 /* Verify that FIRST_UID is an insn that entirely sets REGNO. */
4095 /* FIRST_UID is always executed. */
4100 {
4101 /* If we see a CODE_LABEL between FIRST_UID and LAST_UID, then we
4102 can not be sure that FIRST_UID dominates LAST_UID. */
4105 /* Could not find LAST_UID, but we reached the end of the loop, so
4106 it must be safe. */
4110 }
4112 /* FIRST_UID is always executed if LAST_UID is executed. */
4114 }
4116 /* This routine is called when the number of iterations for the unrolled
4117 loop is one. The goal is to identify a loop that begins with an
4118 unconditional branch to the loop continuation note (or a label just after).
4119 In this case, the unconditional branch that starts the loop needs to be
4120 deleted so that we execute the single iteration. */
4122 static rtx
4124 rtx loop_start;
4125 rtx loop_cont;
4126 {
4129 /* See if loop start, or the next insn is an unconditional jump. */
4140 /* Examine insn after loop continuation note. Return if not a label. */
4145 /* Return the loop start if the branch label matches the code label. */
4148 else
4150 }