| blob | b27786380a36fb70c7e63b86f4955fc7a1fcf967 |
1 /* Optimize jump instructions, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 91-96, 1997 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
9 any later version.
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This is the jump-optimization pass of the compiler.
23 It is run two or three times: once before cse, sometimes once after cse,
24 and once after reload (before final).
26 jump_optimize deletes unreachable code and labels that are not used.
27 It also deletes jumps that jump to the following insn,
28 and simplifies jumps around unconditional jumps and jumps
29 to unconditional jumps.
31 Each CODE_LABEL has a count of the times it is used
32 stored in the LABEL_NUSES internal field, and each JUMP_INSN
33 has one label that it refers to stored in the
34 JUMP_LABEL internal field. With this we can detect labels that
35 become unused because of the deletion of all the jumps that
36 formerly used them. The JUMP_LABEL info is sometimes looked
37 at by later passes.
39 Optionally, cross-jumping can be done. Currently it is done
40 only the last time (when after reload and before final).
41 In fact, the code for cross-jumping now assumes that register
42 allocation has been done, since it uses `rtx_renumbered_equal_p'.
44 Jump optimization is done after cse when cse's constant-propagation
45 causes jumps to become unconditional or to be deleted.
47 Unreachable loops are not detected here, because the labels
48 have references and the insns appear reachable from the labels.
49 find_basic_blocks in flow.c finds and deletes such loops.
51 The subroutines delete_insn, redirect_jump, and invert_jump are used
52 from other passes as well. */
65 /* ??? Eventually must record somehow the labels used by jumps
66 from nested functions. */
67 /* Pre-record the next or previous real insn for each label?
68 No, this pass is very fast anyway. */
69 /* Condense consecutive labels?
70 This would make life analysis faster, maybe. */
71 /* Optimize jump y; x: ... y: jumpif... x?
72 Don't know if it is worth bothering with. */
73 /* Optimize two cases of conditional jump to conditional jump?
74 This can never delete any instruction or make anything dead,
75 or even change what is live at any point.
76 So perhaps let combiner do it. */
78 /* Vector indexed by uid.
79 For each CODE_LABEL, index by its uid to get first unconditional jump
80 that jumps to the label.
81 For each JUMP_INSN, index by its uid to get the next unconditional jump
82 that jumps to the same label.
83 Element 0 is the start of a chain of all return insns.
84 (It is safe to use element 0 because insn uid 0 is not used. */
88 /* List of labels referred to from initializers.
89 These can never be deleted. */
90 rtx forced_labels;
92 /* Maximum index in jump_chain. */
96 /* Set nonzero by jump_optimize if control can fall through
97 to the end of the function. */
100 /* Indicates whether death notes are significant in cross jump analysis.
101 Normally they are not significant, because of A and B jump to C,
102 and R dies in A, it must die in B. But this might not be true after
103 stack register conversion, and we must compare death notes in that
104 case. */
118 \f
119 /* Delete no-op jumps and optimize jumps to jumps
120 and jumps around jumps.
121 Delete unused labels and unreachable code.
123 If CROSS_JUMP is 1, detect matching code
124 before a jump and its destination and unify them.
125 If CROSS_JUMP is 2, do cross-jumping, but pay attention to death notes.
127 If NOOP_MOVES is nonzero, delete no-op move insns.
129 If AFTER_REGSCAN is nonzero, then this jump pass is being run immediately
130 after regscan, and it is safe to use regno_first_uid and regno_last_uid.
132 If `optimize' is zero, don't change any code,
133 just determine whether control drops off the end of the function.
134 This case occurs when we have -W and not -O.
135 It works because `delete_insn' checks the value of `optimize'
136 and refrains from actually deleting when that is 0. */
138 void
140 rtx f;
144 {
149 rtx last_insn;
153 /* Initialize LABEL_NUSES and JUMP_LABEL fields. Delete any REG_LABEL
154 notes whose labels don't occur in the insn any more. */
157 {
164 {
169 }
173 }
175 max_uid++;
177 /* Delete insns following barriers, up to next label. */
180 {
182 {
185 {
189 else
191 }
192 /* INSN is now the code_label. */
193 }
194 else
196 }
198 /* Leave some extra room for labels and duplicate exit test insns
199 we make. */
204 /* Mark the label each jump jumps to.
205 Combine consecutive labels, and count uses of labels.
207 For each label, make a chain (using `jump_chain')
208 of all the *unconditional* jumps that jump to it;
209 also make a chain of all returns. */
214 {
217 {
219 {
223 }
225 {
228 }
229 }
230 }
232 /* Keep track of labels used from static data;
233 they cannot ever be deleted. */
240 /* Keep track of labels used for marking handlers for exception
241 regions; they cannot usually be deleted. */
248 /* Delete all labels already not referenced.
249 Also find the last insn. */
253 {
256 else
257 {
260 }
261 }
264 {
265 /* See if there is still a NOTE_INSN_FUNCTION_END in this function.
266 If so record that this function can drop off the end. */
269 {
272 /* One label can follow the end-note: the return label. */
274 /* Ordinary insns can follow it if returning a structure. */
276 /* If machine uses explicit RETURN insns, no epilogue,
277 then one of them follows the note. */
280 /* A barrier can follow the return insn. */
282 /* Other kinds of notes can follow also. */
286 }
288 /* Report if control can fall through at the end of the function. */
294 /* Zero the "deleted" flag of all the "deleted" insns. */
298 }
300 #ifdef HAVE_return
302 {
303 /* If we fall through to the epilogue, see if we can insert a RETURN insn
304 in front of it. If the machine allows it at this point (we might be
305 after reload for a leaf routine), it will improve optimization for it
306 to be there. */
312 {
315 }
316 }
317 #endif
321 {
325 {
328 /* Combine stack_adjusts with following push_insns. */
329 #ifdef PUSH_ROUNDING
336 {
337 rtx p;
343 /* Find all successive push insns. */
345 /* Don't convert more than three pushes;
346 that starts adding too many displaced addresses
347 and the whole thing starts becoming a losing
348 proposition. */
350 {
359 /* Allow a no-op move between the adjust and the push. */
368 pushes++;
373 }
375 /* Discard the amount pushed from the stack adjust;
376 maybe eliminate it entirely. */
378 {
381 }
382 else
386 /* Change the appropriate push insns to ordinary stores. */
389 {
403 /* If this push doesn't fully fit in the space
404 of the stack adjust that we deleted,
405 make another stack adjust here for what we
406 didn't use up. There should be peepholes
407 to recognize the resulting sequence of insns. */
409 {
412 p);
414 }
417 }
418 }
419 #endif
421 /* Detect and delete no-op move instructions
422 resulting from not allocating a parameter in a register. */
435 /* Detect and ignore no-op move instructions
436 resulting from smart or fortuitous register allocation. */
439 {
446 {
447 rtx trial;
454 {
455 /* DREG may have been the target of a REG_DEAD note in
456 the insn which makes INSN redundant. If so, reorg
457 would still think it is dead. So search for such a
458 note and delete it if we find it. */
464 {
467 }
468 #ifdef PRESERVE_DEATH_INFO_REGNO_P
469 /* Deleting insn could lose a death-note for SREG
470 so don't do it if final needs accurate
471 death-notes. */
474 {
475 /* Change this into a USE so that we won't emit
476 code for it, but still can keep the note. */
480 /* Remove all reg notes but the REG_DEAD one. */
483 }
484 else
485 #endif
487 }
488 }
493 {
494 /* This handles the case where we have two consecutive
495 assignments of the same constant to pseudos that didn't
496 get a hard reg. Each SET from the constant will be
497 converted into a SET of the spill register and an
498 output reload will be made following it. This produces
499 two loads of the same constant into the same spill
500 register. */
504 /* Look back for a death note for the first reg.
505 If there is one, it is no longer accurate. */
507 {
511 {
514 }
516 }
518 /* Delete the second load of the value. */
520 }
521 }
523 {
524 /* If each part is a set between two identical registers or
525 a USE or CLOBBER, delete the insn. */
527 rtx tem;
530 {
540 }
544 }
545 /* Also delete insns to store bit fields if they are no-ops. */
546 /* Not worth the hair to detect this in the big-endian case. */
555 }
557 }
559 /* If we haven't yet gotten to reload and we have just run regscan,
560 delete any insn that sets a register that isn't used elsewhere.
561 This helps some of the optimizations below by having less insns
562 being jumped around. */
566 {
574 /* We use regno_last_note_uid so as not to delete the setting
575 of a reg that's used in notes. A subsequent optimization
576 might arrange to use that reg for real. */
581 }
583 /* Now iterate optimizing jumps until nothing changes over one pass. */
586 {
590 {
591 rtx reallabelprev;
593 rtx nlabel;
596 #if 0
597 /* If NOT the first iteration, if this is the last jump pass
598 (just before final), do the special peephole optimizations.
599 Avoiding the first iteration gives ordinary jump opts
600 a chance to work before peephole opts. */
605 #endif
607 /* That could have deleted some insns after INSN, so check now
608 what the following insn is. */
612 /* See if this is a NOTE_INSN_LOOP_BEG followed by an unconditional
613 jump. Try to optimize by duplicating the loop exit test if so.
614 This is only safe immediately after regscan, because it uses
615 the values of regno_first_uid and regno_last_uid. */
620 {
623 {
627 }
628 }
637 /* Tension the labels in dispatch tables. */
644 /* If a dispatch table always goes to the same place,
645 get rid of it and replace the insn that uses it. */
649 {
664 /* Don't mess with a casesi insn. */
669 {
673 }
674 }
678 /* If a jump references the end of the function, try to turn
679 it into a RETURN insn, possibly a conditional one. */
686 /* Detect jump to following insn. */
688 {
693 }
695 /* If we have an unconditional jump preceded by a USE, try to put
696 the USE before the target and jump there. This simplifies many
697 of the optimizations below since we don't have to worry about
698 dealing with these USE insns. We only do this if the label
699 being branch to already has the identical USE or if code
700 never falls through to that label. */
709 /* Don't do this optimization if we have a loop containing only
710 the USE instruction, and the loop start label has a usage
711 count of 1. This is because we will redo this optimization
712 everytime through the outer loop, and jump opt will never
713 exit. */
717 {
719 {
722 }
728 }
730 /* Simplify if (...) x = a; else x = b; by converting it
731 to x = b; if (...) x = a;
732 if B is sufficiently simple, the test doesn't involve X,
733 and nothing in the test modifies B or X.
735 If we have small register classes, we also can't do this if X
736 is a hard register.
738 If the "x = b;" insn has any REG_NOTES, we don't do this because
739 of the possibility that we are running after CSE and there is a
740 REG_EQUAL note that is only valid if the branch has already been
741 taken. If we move the insn with the REG_EQUAL note, we may
742 fold the comparison to always be false in a later CSE pass.
743 (We could also delete the REG_NOTES when moving the insn, but it
744 seems simpler to not move it.) An exception is that we can move
745 the insn if the only note is a REG_EQUAL or REG_EQUIV whose
746 value is the same as "b".
748 INSN is the branch over the `else' part.
750 We set:
752 TEMP to the jump insn preceding "x = a;"
753 TEMP1 to X
754 TEMP2 to the insn that sets "x = b;"
755 TEMP3 to the insn that sets "x = a;"
756 TEMP4 to the set of "x = b"; */
763 #ifdef SMALL_REGISTER_CLASSES
764 && (! SMALL_REGISTER_CLASSES
766 #endif
782 /* TEMP must skip over the "x = a;" insn */
785 /* There must be no other entries to the "x = b;" insn. */
787 /* INSN must either branch to the insn after TEMP2 or the insn
788 after TEMP2 must branch to the same place as INSN. */
793 {
794 /* The test expression, X, may be a complicated test with
795 multiple branches. See if we can find all the uses of
796 the label that TEMP branches to without hitting a CALL_INSN
797 or a jump to somewhere else. */
802 /* Set P to the first jump insn that goes around "x = a;". */
804 {
806 {
809 {
810 nuses--;
813 }
814 else
816 }
819 }
821 #ifdef HAVE_cc0
822 /* We cannot insert anything between a set of cc and its use
823 so if P uses cc0, we must back up to the previous insn. */
828 #endif
833 /* If we found all the uses and there was no data conflict, we
834 can move the assignment unless we can branch into the middle
835 from somewhere. */
842 {
846 /* Set NEXT to an insn that we know won't go away. */
849 /* Delete the jump around the set. Note that we must do
850 this before we redirect the test jumps so that it won't
851 delete the code immediately following the assignment
852 we moved (which might be a jump). */
856 /* We either have two consecutive labels or a jump to
857 a jump, so adjust all the JUMP_INSNs to branch to where
858 INSN branches to. */
865 }
866 }
868 /* Simplify if (...) { x = a; goto l; } x = b; by converting it
869 to x = a; if (...) goto l; x = b;
870 if A is sufficiently simple, the test doesn't involve X,
871 and nothing in the test modifies A or X.
873 If we have small register classes, we also can't do this if X
874 is a hard register.
876 If the "x = a;" insn has any REG_NOTES, we don't do this because
877 of the possibility that we are running after CSE and there is a
878 REG_EQUAL note that is only valid if the branch has already been
879 taken. If we move the insn with the REG_EQUAL note, we may
880 fold the comparison to always be false in a later CSE pass.
881 (We could also delete the REG_NOTES when moving the insn, but it
882 seems simpler to not move it.) An exception is that we can move
883 the insn if the only note is a REG_EQUAL or REG_EQUIV whose
884 value is the same as "a".
886 INSN is the goto.
888 We set:
890 TEMP to the jump insn preceding "x = a;"
891 TEMP1 to X
892 TEMP2 to the insn that sets "x = b;"
893 TEMP3 to the insn that sets "x = a;"
894 TEMP4 to the set of "x = a"; */
901 #ifdef SMALL_REGISTER_CLASSES
902 && (! SMALL_REGISTER_CLASSES
904 #endif
921 /* TEMP must skip over the "x = a;" insn */
924 {
928 #ifdef HAVE_cc0
929 /* We cannot insert anything between a set of cc and its use. */
933 #endif
946 {
951 /* Set NEXT to an insn that we know won't go away. */
954 }
959 }
961 #ifndef HAVE_cc0
962 /* If we have if (...) x = exp; and branches are expensive,
963 EXP is a single insn, does not have any side effects, cannot
964 trap, and is not too costly, convert this to
965 t = exp; if (...) x = t;
967 Don't do this when we have CC0 because it is unlikely to help
968 and we'd need to worry about where to place the new insn and
969 the potential for conflicts. We also can't do this when we have
970 notes on the insn for the same reason as above.
972 We set:
974 TEMP to the "x = exp;" insn.
975 TEMP1 to the single set in the "x = exp; insn.
976 TEMP2 to "x". */
991 #ifdef SMALL_REGISTER_CLASSES
992 && (! SMALL_REGISTER_CLASSES
994 #endif
1001 {
1005 {
1011 }
1012 }
1014 /* Similarly, if it takes two insns to compute EXP but they
1015 have the same destination. Here TEMP3 will be the second
1016 insn and TEMP4 the SET from that insn. */
1034 #ifdef SMALL_REGISTER_CLASSES
1035 && (! SMALL_REGISTER_CLASSES
1037 #endif
1046 {
1050 {
1054 emit_insn_after_with_line_notes
1060 }
1061 }
1063 /* Finally, handle the case where two insns are used to
1064 compute EXP but a temporary register is used. Here we must
1065 ensure that the temporary register is not used anywhere else. */
1068 && after_regscan
1096 #ifdef SMALL_REGISTER_CLASSES
1097 && (! SMALL_REGISTER_CLASSES
1099 #endif
1104 {
1108 {
1117 }
1118 }
1121 /* Try to use a conditional move (if the target has them), or a
1122 store-flag insn. The general case is:
1124 1) x = a; if (...) x = b; and
1125 2) if (...) x = b;
1127 If the jump would be faster, the machine should not have defined
1128 the movcc or scc insns!. These cases are often made by the
1129 previous optimization.
1131 The second case is treated as x = x; if (...) x = b;.
1133 INSN here is the jump around the store. We set:
1135 TEMP to the "x = b;" insn.
1136 TEMP1 to X.
1137 TEMP2 to B.
1138 TEMP3 to A (X in the second case).
1139 TEMP4 to the condition being tested.
1140 TEMP5 to the earliest insn used to find the condition. */
1143 ! reload_completed
1145 /* Set TEMP to the "x = b;" insn. */
1150 #ifdef SMALL_REGISTER_CLASSES
1151 && (! SMALL_REGISTER_CLASSES
1153 #endif
1156 /* ??? How about floating point constants? */
1158 /* Allow either form, but prefer the former if both apply.
1159 There is no point in using the old value of TEMP1 if
1160 it is a register, since cse will alias them. It can
1161 lose if the old value were a hard register since CSE
1162 won't replace hard registers. */
1164 /* Make the latter case look like x = x; if (...) x = b; */
1166 /* INSN must either branch to the insn after TEMP or the insn
1167 after TEMP must branch to the same place as INSN. */
1173 /* We must be comparing objects whose modes imply the size.
1174 We could handle BLKmode if (1) emit_store_flag could
1175 and (2) we could find the size reliably. */
1177 /* Even if branches are cheap, the store_flag optimization
1178 can win when the operation to be performed can be
1179 expressed directly. */
1180 #ifdef HAVE_cc0
1181 /* If the previous insn sets CC0 and something else, we can't
1182 do this since we are going to delete that insn. */
1189 #endif
1190 )
1191 {
1192 #ifdef HAVE_conditional_move
1193 /* First try a conditional move. */
1194 {
1198 rtx target;
1200 /* Copy the compared variables into cond0 and cond1, so that
1201 any side effects performed in or after the old comparison,
1202 will not affect our compare which will come later. */
1203 /* ??? Is it possible to just use the comparison in the jump
1204 insn? After all, we're going to delete it. We'd have
1205 to modify emit_conditional_move to take a comparison rtx
1206 instead or write a new function. */
1208 /* We want the target to be able to simplify comparisons with
1209 zero (and maybe other constants as well), so don't create
1210 pseudos for them. There's no need to either. */
1214 else
1228 {
1231 /* Save the conditional move sequence but don't emit it
1232 yet. On some machines, like the alpha, it is possible
1233 that temp5 == insn, so next generate the sequence that
1234 saves the compared values and then emit both
1235 sequences ensuring seq1 occurs before seq2. */
1239 /* Now that we can't fail, generate the copy insns that
1240 preserve the compared values. */
1249 /* Insert conditional move after insn, to be sure that
1250 the jump and a possible compare won't be separated */
1253 /* ??? We can also delete the insn that sets X to A.
1254 Flow will do it too though. */
1260 }
1261 else
1263 }
1264 #endif
1266 /* That didn't work, try a store-flag insn.
1268 We further divide the cases into:
1270 1) x = a; if (...) x = b; and either A or B is zero,
1271 2) if (...) x = 0; and jumps are expensive,
1272 3) x = a; if (...) x = b; and A and B are constants where all
1273 the set bits in A are also set in B and jumps are expensive,
1274 4) x = a; if (...) x = b; and A and B non-zero, and jumps are
1275 more expensive, and
1276 5) if (...) x = b; if jumps are even more expensive. */
1280 /* Make the latter case look like
1281 x = x; if (...) x = 0; */
1286 /* If B is zero, OK; if A is zero, can only do (1) if we
1287 can reverse the condition. See if (3) applies possibly
1288 by reversing the condition. Prefer reversing to (4) when
1289 branches are very expensive. */
1293 /* Check that the mask is a power of two,
1294 so that it can probably be generated
1295 with a shift. */
1310 insn)))))
1312 )
1313 {
1317 rtx target;
1319 /* If necessary, reverse the condition. */
1322 else
1325 /* If CVAL is non-zero, normalize to -1. Otherwise, if UVAL
1326 is the constant 1, it is best to just compute the result
1327 directly. If UVAL is constant and STORE_FLAG_VALUE
1328 includes all of its bits, it is best to compute the flag
1329 value unnormalized and `and' it with UVAL. Otherwise,
1330 normalize to -1 and `and' with UVAL. */
1337 /* We will be putting the store-flag insn immediately in
1338 front of the comparison that was originally being done,
1339 so we know all the variables in TEMP4 will be valid.
1340 However, this might be in front of the assignment of
1341 A to VAR. If it is, it would clobber the store-flag
1342 we will be emitting.
1344 Therefore, emit into a temporary which will be copied to
1345 VAR immediately after TEMP. */
1350 VOIDmode,
1353 normalizep);
1355 {
1356 rtx seq;
1362 /* Put the store-flag insns in front of the first insn
1363 used to compute the condition to ensure that we
1364 use the same values of them as the current
1365 comparison. However, the remainder of the insns we
1366 generate will be placed directly in front of the
1367 jump insn, in case any of the pseudos we use
1368 are modified earlier. */
1374 /* Both CVAL and UVAL are non-zero. */
1376 {
1384 else
1385 {
1391 }
1393 /* If we usually make new pseudos, do so here. This
1394 turns out to help machines that have conditional
1395 move insns. */
1396 /* ??? Conditional moves have already been handled.
1397 This may be obsolete. */
1405 }
1407 {
1408 /* We know that either CVAL or UVAL is zero. If
1409 UVAL is zero, negate TARGET and `and' with CVAL.
1410 Otherwise, `and' with UVAL. */
1412 {
1416 }
1422 }
1427 #ifdef HAVE_cc0
1428 /* If INSN uses CC0, we must not separate it from the
1429 insn that sets cc0. */
1432 #endif
1440 }
1441 else
1443 }
1444 }
1446 /* If branches are expensive, convert
1447 if (foo) bar++; to bar += (foo != 0);
1448 and similarly for "bar--;"
1450 INSN is the conditional branch around the arithmetic. We set:
1452 TEMP is the arithmetic insn.
1453 TEMP1 is the SET doing the arithmetic.
1454 TEMP2 is the operand being incremented or decremented.
1455 TEMP3 to the condition being tested.
1456 TEMP4 to the earliest insn used to find the condition. */
1459 #ifdef HAVE_incscc
1460 || HAVE_incscc
1461 #endif
1462 #ifdef HAVE_decscc
1463 || HAVE_decscc
1464 #endif
1465 )
1466 && ! reload_completed
1478 /* INSN must either branch to the insn after TEMP or the insn
1479 after TEMP must branch to the same place as INSN. */
1485 /* We must be comparing objects whose modes imply the size.
1486 We could handle BLKmode if (1) emit_store_flag could
1487 and (2) we could find the size reliably. */
1490 {
1496 /* It must be the case that TEMP2 is not modified in the range
1497 [TEMP4, INSN). The one exception we make is if the insn
1498 before INSN sets TEMP2 to something which is also unchanged
1499 in that range. In that case, we can move the initialization
1500 into our sequence. */
1510 {
1514 }
1520 VOIDmode,
1524 /* If we can do the store-flag, do the addition or
1525 subtraction. */
1534 {
1535 /* Put the result back in temp2 in case it isn't already.
1536 Then replace the jump, possible a CC0-setting insn in
1537 front of the jump, and TEMP, with the sequence we have
1538 made. */
1553 #ifdef HAVE_cc0
1555 #endif
1559 }
1560 else
1562 }
1564 /* Simplify if (...) x = 1; else {...} if (x) ...
1565 We recognize this case scanning backwards as well.
1567 TEMP is the assignment to x;
1568 TEMP1 is the label at the head of the second if. */
1569 /* ?? This should call get_condition to find the values being
1570 compared, instead of looking for a COMPARE insn when HAVE_cc0
1571 is not defined. This would allow it to work on the m88k. */
1572 /* ?? This optimization is only safe before cse is run if HAVE_cc0
1573 is not defined and the condition is tested by a separate compare
1574 insn. This is because the code below assumes that the result
1575 of the compare dies in the following branch.
1577 Not only that, but there might be other insns between the
1578 compare and branch whose results are live. Those insns need
1579 to be executed.
1581 A way to fix this is to move the insns at JUMP_LABEL (insn)
1582 to before INSN. If we are running before flow, they will
1583 be deleted if they aren't needed. But this doesn't work
1584 well after flow.
1586 This is really a special-case of jump threading, anyway. The
1587 right thing to do is to replace this and jump threading with
1588 much simpler code in cse.
1590 This code has been turned off in the non-cc0 case in the
1591 meantime. */
1593 #ifdef HAVE_cc0
1595 /* Safe to skip USE and CLOBBER insns here
1596 since they will not be deleted. */
1604 /* If we find that the next value tested is `x'
1605 (TEMP1 is the insn where this happens), win. */
1608 #ifdef HAVE_cc0
1609 /* Does temp1 `tst' the value of x? */
1613 #else
1614 /* Does temp1 compare the value of x against zero? */
1621 #endif
1623 {
1624 /* Get the if_then_else from the condjump. */
1627 {
1630 rtx cond
1633 rtx ultimate;
1639 else
1649 }
1650 }
1651 #endif
1653 #if 0
1654 /* @@ This needs a bit of work before it will be right.
1656 Any type of comparison can be accepted for the first and
1657 second compare. When rewriting the first jump, we must
1658 compute the what conditions can reach label3, and use the
1659 appropriate code. We can not simply reverse/swap the code
1660 of the first jump. In some cases, the second jump must be
1661 rewritten also.
1663 For example,
1664 < == converts to > ==
1665 < != converts to == >
1666 etc.
1668 If the code is written to only accept an '==' test for the second
1669 compare, then all that needs to be done is to swap the condition
1670 of the first branch.
1672 It is questionable whether we want this optimization anyways,
1673 since if the user wrote code like this because he/she knew that
1674 the jump to label1 is taken most of the time, then rewriting
1675 this gives slower code. */
1676 /* @@ This should call get_condition to find the values being
1677 compared, instead of looking for a COMPARE insn when HAVE_cc0
1678 is not defined. This would allow it to work on the m88k. */
1679 /* @@ This optimization is only safe before cse is run if HAVE_cc0
1680 is not defined and the condition is tested by a separate compare
1681 insn. This is because the code below assumes that the result
1682 of the compare dies in the following branch. */
1684 /* Simplify test a ~= b
1685 condjump label1;
1686 test a == b
1687 condjump label2;
1688 jump label3;
1689 label1:
1691 rewriting as
1692 test a ~~= b
1693 condjump label3
1694 test a == b
1695 condjump label2
1696 label1:
1698 where ~= is an inequality, e.g. >, and ~~= is the swapped
1699 inequality, e.g. <.
1701 We recognize this case scanning backwards.
1703 TEMP is the conditional jump to `label2';
1704 TEMP1 is the test for `a == b';
1705 TEMP2 is the conditional jump to `label1';
1706 TEMP3 is the test for `a ~= b'. */
1715 #ifdef HAVE_cc0
1717 #else
1721 #endif
1735 {
1740 {
1743 }
1747 }
1748 #endif
1749 /* Simplify if (...) {... x = 1;} if (x) ...
1751 We recognize this case backwards.
1753 TEMP is the test of `x';
1754 TEMP1 is the assignment to `x' at the end of the
1755 previous statement. */
1756 /* @@ This should call get_condition to find the values being
1757 compared, instead of looking for a COMPARE insn when HAVE_cc0
1758 is not defined. This would allow it to work on the m88k. */
1759 /* @@ This optimization is only safe before cse is run if HAVE_cc0
1760 is not defined and the condition is tested by a separate compare
1761 insn. This is because the code below assumes that the result
1762 of the compare dies in the following branch. */
1764 /* ??? This has to be turned off. The problem is that the
1765 unconditional jump might indirectly end up branching to the
1766 label between TEMP1 and TEMP. We can't detect this, in general,
1767 since it may become a jump to there after further optimizations.
1768 If that jump is done, it will be deleted, so we will retry
1769 this optimization in the next pass, thus an infinite loop.
1771 The present code prevents this by putting the jump after the
1772 label, but this is not logically correct. */
1773 #if 0
1775 /* Safe to skip USE and CLOBBER insns here
1776 since they will not be deleted. */
1781 #ifdef HAVE_cc0
1784 #else
1785 /* Temp must be a compare insn, we can not accept a register
1786 to register move here, since it may not be simply a
1787 tst insn. */
1793 #endif
1794 /* May skip USE or CLOBBER insns here
1795 for checking for opportunity, since we
1796 take care of them later. */
1800 #ifdef HAVE_cc0
1802 #else
1805 #endif
1807 /* If this isn't true, cse will do the job. */
1809 {
1810 /* Get the if_then_else from the condjump. */
1815 {
1817 rtx last_insn;
1818 rtx ultimate;
1819 rtx p;
1821 /* Get the place that condjump will jump to
1822 if it is reached from here. */
1826 else
1828 /* Get it as a CODE_LABEL. */
1831 else
1832 /* Get the label out of the LABEL_REF. */
1835 /* Insert the jump immediately before TEMP, specifically
1836 after the label that is between TEMP1 and TEMP. */
1839 /* If we would be branching to the next insn, the jump
1840 would immediately be deleted and the re-inserted in
1841 a subsequent pass over the code. So don't do anything
1842 in that case. */
1845 {
1848 last_insn);
1853 {
1857 }
1860 }
1861 }
1862 }
1863 #endif
1864 /* Detect a conditional jump going to the same place
1865 as an immediately following unconditional jump. */
1871 {
1874 /* ??? Optional. Disables some optimizations, but makes
1875 gcov output more accurate with -O. */
1882 {
1886 }
1887 }
1888 /* Detect a conditional jump jumping over an unconditional jump. */
1891 && ! this_is_simplejump
1897 {
1898 /* When we invert the unconditional jump, we will be
1899 decrementing the usage count of its old label.
1900 Make sure that we don't delete it now because that
1901 might cause the following code to be deleted. */
1909 {
1910 /* It is very likely that if there are USE insns before
1911 this jump, they hold REG_DEAD notes. These REG_DEAD
1912 notes are no longer valid due to this optimization,
1913 and will cause the life-analysis that following passes
1914 (notably delayed-branch scheduling) to think that
1915 these registers are dead when they are not.
1917 To prevent this trouble, we just remove the USE insns
1918 from the insn chain. */
1922 {
1926 }
1931 }
1933 /* We can now safely delete the label if it is unreferenced
1934 since the delete_insn above has deleted the BARRIER. */
1938 }
1939 else
1940 {
1941 /* Detect a jump to a jump. */
1946 {
1949 }
1951 /* Look for if (foo) bar; else break; */
1952 /* The insns look like this:
1953 insn = condjump label1;
1954 ...range1 (some insns)...
1955 jump label2;
1956 label1:
1957 ...range2 (some insns)...
1958 jump somewhere unconditionally
1959 label2: */
1960 {
1963 /* Don't do this optimization on the first round, so that
1964 jump-around-a-jump gets simplified before we ask here
1965 whether a jump is unconditional.
1967 Also don't do it when we are called after reload since
1968 it will confuse reorg. */
1971 /* Make sure INSN is something we can invert. */
1978 {
1985 /* Invert the jump condition, so we
1986 still execute the same insns in each case. */
1988 {
1993 rtx rangenext;
1995 /* Include in each range any notes before it, to be
1996 sure that we get the line number note if any, even
1997 if there are other notes here. */
2006 /* Don't move NOTEs for blocks or loops; shift them
2007 outside the ranges, where they'll stay put. */
2011 /* Get current surrounds of the 2 ranges. */
2017 /* Splice range2 where range1 was. */
2022 /* Splice range1 where range2 was. */
2028 /* Check for a loop end note between the end of
2029 range2, and the next code label. If there is one,
2030 then what we have really seen is
2031 if (foo) break; end_of_loop;
2032 and moved the break sequence outside the loop.
2033 We must move the LOOP_END note to where the
2034 loop really ends now, or we will confuse loop
2035 optimization. Stop if we find a LOOP_BEG note
2036 first, since we don't want to move the LOOP_END
2037 note in that case. */
2039 {
2042 {
2045 {
2056 }
2060 }
2061 }
2064 }
2065 }
2066 }
2068 /* Now that the jump has been tensioned,
2069 try cross jumping: check for identical code
2070 before the jump and before its target label. */
2072 /* First, cross jumping of conditional jumps: */
2075 {
2079 /* A conditional jump may be crossjumped
2080 only if the place it jumps to follows
2081 an opposing jump that comes back here. */
2084 /* We have no opposing jump;
2085 cannot cross jump this insn. */
2089 /* TARGET is nonzero if it is ok to cross jump
2090 to code before TARGET. If so, see if matches. */
2096 {
2098 /* Make the old conditional jump
2099 into an unconditional one. */
2104 /* Add to jump_chain unless this is a new label
2105 whose UID is too large. */
2107 {
2111 }
2114 }
2115 }
2117 /* Cross jumping of unconditional jumps:
2118 a few differences. */
2121 {
2123 rtx target;
2127 /* TARGET is nonzero if it is ok to cross jump
2128 to code before TARGET. If so, see if matches. */
2132 /* If cannot cross jump to code before the label,
2133 see if we can cross jump to another jump to
2134 the same label. */
2135 /* Try each other jump to this label. */
2142 /* Ignore TARGET if it's deleted. */
2148 {
2152 }
2153 }
2155 /* This code was dead in the previous jump.c! */
2157 {
2158 /* Return insns all "jump to the same place"
2159 so we can cross-jump between any two of them. */
2165 /* If cannot cross jump to code before the label,
2166 see if we can cross jump to another jump to
2167 the same label. */
2168 /* Try each other jump to this label. */
2179 {
2183 }
2184 }
2185 }
2186 }
2189 }
2191 /* Delete extraneous line number notes.
2192 Note that two consecutive notes for different lines are not really
2193 extraneous. There should be some indication where that line belonged,
2194 even if it became empty. */
2196 {
2201 {
2202 /* Delete this note if it is identical to previous note. */
2206 {
2209 }
2212 }
2213 }
2215 #ifdef HAVE_return
2217 {
2218 /* If we fall through to the epilogue, see if we can insert a RETURN insn
2219 in front of it. If the machine allows it at this point (we might be
2220 after reload for a leaf routine), it will improve optimization for it
2221 to be there. We do this both here and at the start of this pass since
2222 the RETURN might have been deleted by some of our optimizations. */
2228 {
2231 }
2232 }
2233 #endif
2235 /* See if there is still a NOTE_INSN_FUNCTION_END in this function.
2236 If so, delete it, and record that this function can drop off the end. */
2239 {
2242 /* One label can follow the end-note: the return label. */
2244 /* Ordinary insns can follow it if returning a structure. */
2246 /* If machine uses explicit RETURN insns, no epilogue,
2247 then one of them follows the note. */
2250 /* A barrier can follow the return insn. */
2252 /* Other kinds of notes can follow also. */
2256 }
2258 /* Report if control can fall through at the end of the function. */
2261 {
2264 }
2266 /* Show JUMP_CHAIN no longer valid. */
2268 }
2269 \f
2270 /* LOOP_START is a NOTE_INSN_LOOP_BEG note that is followed by an unconditional
2271 jump. Assume that this unconditional jump is to the exit test code. If
2272 the code is sufficiently simple, make a copy of it before INSN,
2273 followed by a jump to the exit of the loop. Then delete the unconditional
2274 jump after INSN.
2276 Return 1 if we made the change, else 0.
2278 This is only safe immediately after a regscan pass because it uses the
2279 values of regno_first_uid and regno_last_uid. */
2281 static int
2283 rtx loop_start;
2284 {
2289 rtx lastexit;
2293 /* Scan the exit code. We do not perform this optimization if any insn:
2295 is a CALL_INSN
2296 is a CODE_LABEL
2297 has a REG_RETVAL or REG_LIBCALL note (hard to adjust)
2298 is a NOTE_INSN_LOOP_BEG because this means we have a nested loop
2299 is a NOTE_INSN_BLOCK_{BEG,END} because duplicating these notes
2300 are not valid
2302 Also, don't do this if the exit code is more than 20 insns. */
2305 insn
2309 {
2311 {
2316 /* We could be in front of the wrong NOTE_INSN_LOOP_END if there is
2317 a jump immediately after the loop start that branches outside
2318 the loop but within an outer loop, near the exit test.
2319 If we copied this exit test and created a phony
2320 NOTE_INSN_LOOP_VTOP, this could make instructions immediately
2321 before the exit test look like these could be safely moved
2322 out of the loop even if they actually may be never executed.
2323 This can be avoided by checking here for NOTE_INSN_LOOP_CONT. */
2338 }
2339 }
2341 /* Unless INSN is zero, we can do the optimization. */
2347 /* See if any insn sets a register only used in the loop exit code and
2348 not a user variable. If so, replace it with a new register. */
2357 {
2363 {
2364 /* We can do the replacement. Allocate reg_map if this is the
2365 first replacement we found. */
2367 {
2370 }
2375 }
2376 }
2378 /* Now copy each insn. */
2381 {
2386 /* Only copy line-number notes. */
2388 {
2391 }
2401 /* Copy all REG_NOTES except REG_LABEL since mark_jump_label will
2402 make them. */
2418 {
2422 }
2424 /* If this is a simple jump, add it to the jump chain. */
2428 {
2432 }
2437 }
2439 /* Now clean up by emitting a jump to the end label and deleting the jump
2440 at the start of the loop. */
2442 {
2444 loop_start);
2448 {
2452 }
2454 }
2456 /* Mark the exit code as the virtual top of the converted loop. */
2462 }
2463 \f
2464 /* Move all block-beg, block-end, loop-beg, loop-cont, loop-vtop, and
2465 loop-end notes between START and END out before START. Assume that
2466 END is not such a note. START may be such a note. Returns the value
2467 of the new starting insn, which may be different if the original start
2468 was such a note. */
2470 rtx
2473 {
2474 rtx insn;
2475 rtx next;
2478 {
2487 {
2490 else
2491 {
2499 }
2500 }
2501 }
2504 }
2505 \f
2506 /* Compare the instructions before insn E1 with those before E2
2507 to find an opportunity for cross jumping.
2508 (This means detecting identical sequences of insns followed by
2509 jumps to the same place, or followed by a label and a jump
2510 to that label, and replacing one with a jump to the other.)
2512 Assume E1 is a jump that jumps to label E2
2513 (that is not always true but it might as well be).
2514 Find the longest possible equivalent sequences
2515 and store the first insns of those sequences into *F1 and *F2.
2516 Store zero there if no equivalent preceding instructions are found.
2518 We give up if we find a label in stream 1.
2519 Actually we could transfer that label into stream 2. */
2521 static void
2526 {
2533 rtx prev1;
2539 {
2549 /* Don't allow the range of insns preceding E1 or E2
2550 to include the other (E2 or E1). */
2554 /* If we will get to this code by jumping, those jumps will be
2555 tensioned to go directly to the new label (before I2),
2556 so this cross-jumping won't cost extra. So reduce the minimum. */
2558 {
2561 }
2569 /* If this is a CALL_INSN, compare register usage information.
2570 If we don't check this on stack register machines, the two
2571 CALL_INSNs might be merged leaving reg-stack.c with mismatching
2572 numbers of stack registers in the same basic block.
2573 If we don't check this on machines with delay slots, a delay slot may
2574 be filled that clobbers a parameter expected by the subroutine.
2576 ??? We take the simple route for now and assume that if they're
2577 equal, they were constructed identically. */
2584 #ifdef STACK_REGS
2585 /* If cross_jump_death_matters is not 0, the insn's mode
2586 indicates whether or not the insn contains any stack-like
2587 regs. */
2590 {
2591 /* If register stack conversion has already been done, then
2592 death notes must also be compared before it is certain that
2593 the two instruction streams match. */
2595 rtx note;
2615 done:
2616 ;
2617 }
2618 #endif
2620 /* Don't allow old-style asm or volatile extended asms to be accepted
2621 for cross jumping purposes. It is conceptually correct to allow
2622 them, since cross-jumping preserves the dynamic instruction order
2623 even though it is changing the static instruction order. However,
2624 if an asm is being used to emit an assembler pseudo-op, such as
2625 the MIPS `.set reorder' pseudo-op, then the static instruction order
2626 matters and it must be preserved. */
2634 {
2635 /* The following code helps take care of G++ cleanups. */
2636 rtx equiv1;
2637 rtx equiv2;
2644 /* If the equivalences are not to a constant, they may
2645 reference pseudos that no longer exist, so we can't
2646 use them. */
2649 {
2654 {
2661 }
2662 }
2664 /* Insns fail to match; cross jumping is limited to the following
2665 insns. */
2667 #ifdef HAVE_cc0
2668 /* Don't allow the insn after a compare to be shared by
2669 cross-jumping unless the compare is also shared.
2670 Here, if either of these non-matching insns is a compare,
2671 exclude the following insn from possible cross-jumping. */
2674 #endif
2676 /* If cross-jumping here will feed a jump-around-jump
2677 optimization, this jump won't cost extra, so reduce
2678 the minimum. */
2684 }
2686 win:
2688 {
2689 /* Ok, this insn is potentially includable in a cross-jump here. */
2692 }
2693 }
2697 }
2699 static void
2702 {
2703 /* Find an existing label at this point
2704 or make a new one if there is none. */
2707 /* Make the same jump insn jump to the new point. */
2709 {
2710 /* Remove from jump chain of returns. */
2712 /* Change the insn. */
2717 /* Add to new the jump chain. */
2720 {
2723 }
2724 }
2725 else
2728 /* Delete the matching insns before the jump. Also, remove any REG_EQUAL
2729 or REG_EQUIV note in the NEWLPOS stream that isn't also present in
2730 the NEWJPOS stream. */
2733 {
2734 rtx lnote;
2746 }
2747 }
2748 \f
2749 /* Return the label before INSN, or put a new label there. */
2751 rtx
2753 rtx insn;
2754 {
2755 rtx label;
2757 /* Find an existing label at this point
2758 or make a new one if there is none. */
2762 {
2768 }
2770 }
2772 /* Return the label after INSN, or put a new label there. */
2774 rtx
2776 rtx insn;
2777 {
2778 rtx label;
2780 /* Find an existing label at this point
2781 or make a new one if there is none. */
2785 {
2789 }
2791 }
2792 \f
2793 /* Return 1 if INSN is a jump that jumps to right after TARGET
2794 only on the condition that TARGET itself would drop through.
2795 Assumes that TARGET is a conditional jump. */
2797 static int
2800 {
2816 {
2820 }
2823 {
2827 }
2832 }
2833 \f
2834 /* Given a comparison, COMPARISON, inside a conditional jump insn, INSN,
2835 return non-zero if it is safe to reverse this comparison. It is if our
2836 floating-point is not IEEE, if this is an NE or EQ comparison, or if
2837 this is known to be an integer comparison. */
2839 int
2841 rtx comparison;
2842 rtx insn;
2843 {
2844 rtx arg0;
2846 /* If this is not actually a comparison, we can't reverse it. */
2851 /* If this is an NE comparison, it is safe to reverse it to an EQ
2852 comparison and vice versa, even for floating point. If no operands
2853 are NaNs, the reversal is valid. If some operand is a NaN, EQ is
2854 always false and NE is always true, so the reversal is also valid. */
2855 || flag_fast_math
2862 /* Make sure ARG0 is one of the actual objects being compared. If we
2863 can't do this, we can't be sure the comparison can be reversed.
2865 Handle cc0 and a MODE_CC register. */
2867 #ifdef HAVE_cc0
2869 #endif
2870 )
2871 {
2882 }
2884 /* We can reverse this if ARG0 is a CONST_INT or if its mode is
2885 not VOIDmode and neither a MODE_CC nor MODE_FLOAT type. */
2890 }
2892 /* Given an rtx-code for a comparison, return the code
2893 for the negated comparison.
2894 WATCH OUT! reverse_condition is not safe to use on a jump
2895 that might be acting on the results of an IEEE floating point comparison,
2896 because of the special treatment of non-signaling nans in comparisons.
2897 Use can_reverse_comparison_p to be sure. */
2899 enum rtx_code
2902 {
2904 {
2938 }
2939 }
2941 /* Similar, but return the code when two operands of a comparison are swapped.
2942 This IS safe for IEEE floating-point. */
2944 enum rtx_code
2947 {
2949 {
2981 }
2982 }
2984 /* Given a comparison CODE, return the corresponding unsigned comparison.
2985 If CODE is an equality comparison or already an unsigned comparison,
2986 CODE is returned. */
2988 enum rtx_code
2991 {
2993 {
3016 }
3017 }
3019 /* Similarly, return the signed version of a comparison. */
3021 enum rtx_code
3024 {
3026 {
3049 }
3050 }
3051 \f
3052 /* Return non-zero if CODE1 is more strict than CODE2, i.e., if the
3053 truth of CODE1 implies the truth of CODE2. */
3055 int
3058 {
3063 {
3088 }
3091 }
3092 \f
3093 /* Return 1 if INSN is an unconditional jump and nothing else. */
3095 int
3097 rtx insn;
3098 {
3103 }
3105 /* Return nonzero if INSN is a (possibly) conditional jump
3106 and nothing more. */
3108 int
3110 rtx insn;
3111 {
3130 }
3132 /* Return nonzero if INSN is a (possibly) conditional jump
3133 and nothing more. */
3135 int
3137 rtx insn;
3138 {
3143 else
3163 }
3165 /* Return 1 if X is an RTX that does nothing but set the condition codes
3166 and CLOBBER or USE registers.
3167 Return -1 if X does explicitly set the condition codes,
3168 but also does other things. */
3170 int
3172 rtx x;
3173 {
3174 #ifdef HAVE_cc0
3178 {
3183 {
3189 }
3191 }
3193 #else
3195 #endif
3196 }
3197 \f
3198 /* Follow any unconditional jump at LABEL;
3199 return the ultimate label reached by any such chain of jumps.
3200 If LABEL is not followed by a jump, return LABEL.
3201 If the chain loops or we can't find end, return LABEL,
3202 since that tells caller to avoid changing the insn.
3204 If RELOAD_COMPLETED is 0, we do not chain across a NOTE_INSN_LOOP_BEG or
3205 a USE or CLOBBER. */
3207 rtx
3209 rtx label;
3210 {
3224 depth++)
3225 {
3226 /* Don't chain through the insn that jumps into a loop
3227 from outside the loop,
3228 since that would create multiple loop entry jumps
3229 and prevent loop optimization. */
3230 rtx tem;
3235 /* ??? Optional. Disables some optimizations, but makes
3236 gcov output more accurate with -O. */
3240 /* If we have found a cycle, make the insn jump to itself. */
3250 }
3254 }
3256 /* Assuming that field IDX of X is a vector of label_refs,
3257 replace each of them by the ultimate label reached by it.
3258 Return nonzero if a change is made.
3259 If IGNORE_LOOPS is 0, we do not chain across a NOTE_INSN_LOOP_BEG. */
3261 static int
3265 {
3269 {
3273 {
3279 }
3280 }
3282 }
3283 \f
3284 /* Find all CODE_LABELs referred to in X, and increment their use counts.
3285 If INSN is a JUMP_INSN and there is at least one CODE_LABEL referenced
3286 in INSN, then store one of them in JUMP_LABEL (INSN).
3287 If INSN is an INSN or a CALL_INSN and there is at least one CODE_LABEL
3288 referenced in INSN, add a REG_LABEL note containing that label to INSN.
3289 Also, when there are consecutive labels, canonicalize on the last of them.
3291 Note that two labels separated by a loop-beginning note
3292 must be kept distinct if we have not yet done loop-optimization,
3293 because the gap between them is where loop-optimize
3294 will want to move invariant code to. CROSS_JUMP tells us
3295 that loop-optimization is done with.
3297 Once reload has completed (CROSS_JUMP non-zero), we need not consider
3298 two labels distinct if they are separated by only USE or CLOBBER insns. */
3300 static void
3303 rtx insn;
3305 {
3311 {
3324 /* If this is a constant-pool reference, see if it is a label. */
3331 {
3334 rtx note;
3335 rtx next;
3340 /* Ignore references to labels of containing functions. */
3344 /* If there are other labels following this one,
3345 replace it with the last of the consecutive labels. */
3347 {
3359 /* ??? Optional. Disables some optimizations, but
3360 makes gcov output more accurate with -O. */
3363 }
3369 {
3373 /* If we've changed OLABEL and we had a REG_LABEL note
3374 for it, update it as well. */
3379 /* Otherwise, add a REG_LABEL note for LABEL unless there already
3380 is one. */
3382 {
3384 /* Don't record labels that refer to dispatch tables.
3385 This is not necessary, since the tablejump
3386 references the same label.
3387 And if we did record them, flow.c would make worse code. */
3394 }
3395 }
3397 }
3399 /* Do walk the labels in a vector, but not the first operand of an
3400 ADDR_DIFF_VEC. Don't set the JUMP_LABEL of a vector. */
3403 {
3409 }
3410 }
3414 {
3418 {
3422 }
3423 }
3424 }
3426 /* If all INSN does is set the pc, delete it,
3427 and delete the insn that set the condition codes for it
3428 if that's what the previous thing was. */
3430 void
3432 rtx insn;
3433 {
3438 }
3440 /* Delete INSN and recursively delete insns that compute values used only
3441 by INSN. This uses the REG_DEAD notes computed during flow analysis.
3442 If we are running before flow.c, we need do nothing since flow.c will
3443 delete dead code. We also can't know if the registers being used are
3444 dead or not at this point.
3446 Otherwise, look at all our REG_DEAD notes. If a previous insn does
3447 nothing other than set a register that dies in this insn, we can delete
3448 that insn as well.
3450 On machines with CC0, if CC0 is used in this insn, we may be able to
3451 delete the insn that set it. */
3453 static void
3455 rtx insn;
3456 {
3459 #ifdef HAVE_cc0
3461 {
3463 /* We assume that at this stage
3464 CC's are always set explicitly
3465 and always immediately before the jump that
3466 will use them. So if the previous insn
3467 exists to set the CC's, delete it
3468 (unless it performs auto-increments, etc.). */
3471 {
3475 else
3476 /* Otherwise, show that cc0 won't be used. */
3479 }
3480 }
3481 #endif
3484 {
3485 rtx our_prev;
3490 /* Verify that the REG_NOTE is legitimate. */
3497 {
3498 /* If we reach a SEQUENCE, it is too complex to try to
3499 do anything with it, so give up. */
3505 /* reorg creates USEs that look like this. We leave them
3506 alone because reorg needs them for its own purposes. */
3510 {
3515 {
3516 /* If we find a SET of something else, we can't
3517 delete the insn. */
3522 {
3528 }
3532 }
3538 }
3540 /* If OUR_PREV references the register that dies here, it is an
3541 additional use. Hence any prior SET isn't dead. However, this
3542 insn becomes the new place for the REG_DEAD note. */
3545 {
3549 }
3550 }
3551 }
3554 }
3555 \f
3556 /* Delete insn INSN from the chain of insns and update label ref counts.
3557 May delete some following insns as a consequence; may even delete
3558 a label elsewhere and insns that follow it.
3560 Returns the first insn after INSN that was not deleted. */
3562 rtx
3565 {
3574 /* This insn is already deleted => return first following nondeleted. */
3578 /* Don't delete user-declared labels. Convert them to special NOTEs
3579 instead. */
3582 {
3587 }
3588 else
3589 /* Mark this insn as deleted. */
3592 /* If this is an unconditional jump, delete it from the jump chain. */
3596 /* If instruction is followed by a barrier,
3597 delete the barrier too. */
3600 {
3603 }
3605 /* Patch out INSN (and the barrier if any) */
3608 {
3610 {
3615 }
3618 {
3622 }
3626 }
3628 /* If deleting a jump, decrement the count of the label,
3629 and delete the label if it is now unused. */
3633 {
3634 /* This can delete NEXT or PREV,
3635 either directly if NEXT is JUMP_LABEL (INSN),
3636 or indirectly through more levels of jumps. */
3638 /* I feel a little doubtful about this loop,
3639 but I see no clean and sure alternative way
3640 to find the first insn after INSN that is not now deleted.
3641 I hope this works. */
3645 }
3647 /* Likewise if we're deleting a dispatch table. */
3652 {
3663 }
3668 /* If INSN was a label and a dispatch table follows it,
3669 delete the dispatch table. The tablejump must have gone already.
3670 It isn't useful to fall through into a table. */
3679 /* If INSN was a label, delete insns following it if now unreachable. */
3682 {
3688 {
3692 /* Keep going past other deleted labels to delete what follows. */
3695 else
3696 /* Note: if this deletes a jump, it can cause more
3697 deletion of unreachable code, after a different label.
3698 As long as the value from this recursive call is correct,
3699 this invocation functions correctly. */
3701 }
3702 }
3705 }
3707 /* Advance from INSN till reaching something not deleted
3708 then return that. May return INSN itself. */
3710 rtx
3712 rtx insn;
3713 {
3717 }
3718 \f
3719 /* Delete a range of insns from FROM to TO, inclusive.
3720 This is for the sake of peephole optimization, so assume
3721 that whatever these insns do will still be done by a new
3722 peephole insn that will replace them. */
3724 void
3727 {
3731 {
3736 {
3739 /* Patch this insn out of the chain. */
3740 /* We don't do this all at once, because we
3741 must preserve all NOTEs. */
3747 }
3752 }
3754 /* Note that if TO is an unconditional jump
3755 we *do not* delete the BARRIER that follows,
3756 since the peephole that replaces this sequence
3757 is also an unconditional jump in that case. */
3758 }
3759 \f
3760 /* Invert the condition of the jump JUMP, and make it jump
3761 to label NLABEL instead of where it jumps now. */
3763 int
3766 {
3767 /* We have to either invert the condition and change the label or
3768 do neither. Either operation could fail. We first try to invert
3769 the jump. If that succeeds, we try changing the label. If that fails,
3770 we invert the jump back to what it was. */
3776 {
3778 {
3781 /* An inverted jump means that a probability taken becomes a
3782 probability not taken. Subtract the branch probability from the
3783 probability base to convert it back to a taken probability.
3784 (We don't flip the probability on a branch that's never taken. */
3787 }
3790 }
3793 /* This should just be putting it back the way it was. */
3797 }
3799 /* Invert the jump condition of rtx X contained in jump insn, INSN.
3801 Return 1 if we can do so, 0 if we cannot find a way to do so that
3802 matches a pattern. */
3804 int
3806 rtx x;
3807 rtx insn;
3808 {
3816 {
3820 /* We can do this in two ways: The preferable way, which can only
3821 be done if this is not an integer comparison, is to reverse
3822 the comparison code. Otherwise, swap the THEN-part and ELSE-part
3823 of the IF_THEN_ELSE. If we can't do either, fail. */
3836 }
3840 {
3845 {
3850 }
3851 }
3854 }
3855 \f
3856 /* Make jump JUMP jump to label NLABEL instead of where it jumps now.
3857 If the old jump target label is unused as a result,
3858 it and the code following it may be deleted.
3860 If NLABEL is zero, we are to turn the jump into a (possibly conditional)
3861 RETURN insn.
3863 The return value will be 1 if the change was made, 0 if it wasn't (this
3864 can only occur for NLABEL == 0). */
3866 int
3869 {
3878 /* If this is an unconditional branch, delete it from the jump_chain of
3879 OLABEL and add it to the jump_chain of NLABEL (assuming both labels
3880 have UID's in range and JUMP_CHAIN is valid). */
3883 {
3889 {
3892 }
3893 }
3903 }
3905 /* Delete the instruction JUMP from any jump chain it might be on. */
3907 static void
3909 rtx jump;
3910 {
3914 /* Handle unconditional jumps. */
3919 /* Handle return insns. */
3926 else
3927 {
3928 rtx insn;
3934 {
3937 }
3938 }
3939 }
3941 /* If NLABEL is nonzero, throughout the rtx at LOC,
3942 alter (LABEL_REF OLABEL) to (LABEL_REF NLABEL). If OLABEL is
3943 zero, alter (RETURN) to (LABEL_REF NLABEL).
3945 If NLABEL is zero, alter (LABEL_REF OLABEL) to (RETURN) and check
3946 validity with validate_change. Convert (set (pc) (label_ref olabel))
3947 to (return).
3949 Return 0 if we found a change we would like to make but it is invalid.
3950 Otherwise, return 1. */
3952 int
3956 rtx insn;
3957 {
3964 {
3966 {
3969 else
3972 }
3973 }
3975 {
3980 }
3989 {
3994 {
3999 }
4000 }
4003 }
4004 \f
4005 /* Make jump JUMP jump to label NLABEL, assuming it used to be a tablejump.
4007 If the old jump target label (before the dispatch table) becomes unused,
4008 it and the dispatch table may be deleted. In that case, find the insn
4009 before the jump references that label and delete it and logical successors
4010 too. */
4012 static void
4015 {
4018 /* Add this jump to the jump_chain of NLABEL. */
4021 {
4024 }
4032 {
4035 }
4036 }
4038 /* Find the insn referencing LABEL that is a logical predecessor of INSN.
4039 If we found one, delete it and then delete this insn if DELETE_THIS is
4040 non-zero. Return non-zero if INSN or a predecessor references LABEL. */
4042 static int
4046 {
4048 rtx link;
4052 {
4054 {
4057 }
4058 else
4060 }
4064 {
4066 {
4069 }
4070 else
4072 }
4075 }
4076 \f
4077 /* Like rtx_equal_p except that it considers two REGs as equal
4078 if they renumber to the same value and considers two commutative
4079 operations to be the same if the order of the operands has been
4080 reversed. */
4082 int
4085 {
4096 {
4103 /* If we haven't done any renumbering, don't
4104 make any assumptions. */
4109 {
4114 {
4117 }
4118 }
4120 else
4121 {
4125 }
4128 {
4133 {
4136 }
4137 }
4139 else
4140 {
4144 }
4147 }
4149 /* Now we have disposed of all the cases
4150 in which different rtx codes can match. */
4155 {
4166 /* We can't assume nonlocal labels have their following insns yet. */
4170 /* Two label-refs are equivalent if they point at labels
4171 in the same position in the instruction stream. */
4177 }
4179 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent. */
4184 /* For commutative operations, the RTX match if the operand match in any
4185 order. Also handle the simple binary and unary cases without a loop. */
4197 /* Compare the elements. If any pair of corresponding elements
4198 fail to match, return 0 for the whole things. */
4202 {
4205 {
4229 /* fall through. */
4243 }
4244 }
4246 }
4247 \f
4248 /* If X is a hard register or equivalent to one or a subregister of one,
4249 return the hard register number. If X is a pseudo register that was not
4250 assigned a hard register, return the pseudo register number. Otherwise,
4251 return -1. Any rtx is valid for X. */
4253 int
4255 rtx x;
4256 {
4258 {
4262 }
4264 {
4268 }
4270 }
4271 \f
4272 /* Optimize code of the form:
4274 for (x = a[i]; x; ...)
4275 ...
4276 for (x = a[i]; x; ...)
4277 ...
4278 foo:
4280 Loop optimize will change the above code into
4282 if (x = a[i])
4283 for (;;)
4284 { ...; if (! (x = ...)) break; }
4285 if (x = a[i])
4286 for (;;)
4287 { ...; if (! (x = ...)) break; }
4288 foo:
4290 In general, if the first test fails, the program can branch
4291 directly to `foo' and skip the second try which is doomed to fail.
4292 We run this after loop optimization and before flow analysis. */
4294 /* When comparing the insn patterns, we track the fact that different
4295 pseudo-register numbers may have been used in each computation.
4296 The following array stores an equivalence -- same_regs[I] == J means
4297 that pseudo register I was used in the first set of tests in a context
4298 where J was used in the second set. We also count the number of such
4299 pending equivalences. If nonzero, the expressions really aren't the
4300 same. */
4306 /* Track any registers modified between the target of the first jump and
4307 the second jump. They never compare equal. */
4311 /* Record if memory was modified. */
4315 /* Called via note_stores on each insn between the target of the first
4316 branch and the second branch. It marks any changed registers. */
4318 static void
4320 rtx dest;
4321 rtx x;
4322 {
4337 else
4340 }
4342 /* F is the first insn in the chain of insns. */
4344 void
4346 rtx f;
4349 {
4350 /* Basic algorithm is to find a conditional branch,
4351 the label it may branch to, and the branch after
4352 that label. If the two branches test the same condition,
4353 walk back from both branch paths until the insn patterns
4354 differ, or code labels are hit. If we make it back to
4355 the target of the first branch, then we know that the first branch
4356 will either always succeed or always fail depending on the relative
4357 senses of the two branches. So adjust the first branch accordingly
4358 in this case. */
4367 /* Allocate register tables and quick-reset table. */
4375 {
4379 {
4380 /* Get to a candidate branch insn. */
4395 /* Look for a branch after the target. Record any registers and
4396 memory modified between the target and the branch. Stop when we
4397 get to a label since we can't know what was changed there. */
4399 {
4404 {
4405 /* If this is an unconditional jump and is the only use of
4406 its target label, we can follow it. */
4410 {
4413 }
4414 else
4416 }
4422 {
4431 }
4434 }
4436 /* Check the next candidate branch insn from the label
4437 of the first. */
4445 /* Get the comparison codes and operands, reversing the
4446 codes if appropriate. If we don't have comparison codes,
4447 we can't do anything. */
4460 /* If they test the same things and knowing that B1 branches
4461 tells us whether or not B2 branches, check if we
4462 can thread the branch. */
4467 {
4472 {
4474 {
4475 /* We have reached the target of the first branch.
4476 If there are no pending register equivalents,
4477 we know that this branch will either always
4478 succeed (if the senses of the two branches are
4479 the same) or always fail (if not). */
4480 rtx new_label;
4487 else
4491 {
4496 {
4497 /* Don't thread to the loop label. If a loop
4498 label is reused, loop optimization will
4499 be disabled for that loop. */
4502 }
4504 }
4506 }
4508 /* If either of these is not a normal insn (it might be
4509 a JUMP_INSN, CALL_INSN, or CODE_LABEL) we fail. (NOTEs
4510 have already been skipped above.) Similarly, fail
4511 if the insns are different. */
4520 }
4521 }
4522 }
4523 }
4524 }
4525 \f
4526 /* This is like RTX_EQUAL_P except that it knows about our handling of
4527 possibly equivalent registers and knows to consider volatile and
4528 modified objects as not equal.
4530 YINSN is the insn containing Y. */
4532 int
4535 rtx yinsn;
4536 {
4543 /* Rtx's of different codes cannot be equal. */
4547 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.
4548 (REG:SI x) and (REG:HI x) are NOT equivalent. */
4553 /* For floating-point, consider everything unequal. This is a bit
4554 pessimistic, but this pass would only rarely do anything for FP
4555 anyway. */
4560 /* For commutative operations, the RTX match if the operand match in any
4561 order. Also handle the simple binary and unary cases without a loop. */
4573 /* Handle special-cases first. */
4575 {
4580 /* If neither is user variable or hard register, check for possible
4581 equivalence. */
4588 {
4590 num_same_regs++;
4592 /* If this is the first time we are seeing a register on the `Y'
4593 side, see if it is the last use. If not, we can't thread the
4594 jump, so mark it as not equivalent. */
4599 }
4600 else
4606 /* If memory modified or either volatile, not equivalent.
4607 Else, check address. */
4620 /* Cancel a pending `same_regs' if setting equivalenced registers.
4621 Then process source. */
4624 {
4626 {
4628 num_same_regs--;
4629 }
4632 }
4633 else
4644 }
4651 {
4653 {
4667 /* Two vectors must have the same length. */
4671 /* And the corresponding elements must match. */
4690 /* These are just backpointers, so they don't matter. */
4696 /* It is believed that rtx's at this level will never
4697 contain anything but integers and other rtx's,
4698 except for within LABEL_REFs and SYMBOL_REFs. */
4701 }
4702 }
4704 }