| blob | ee3f01770671cf9333890cb708b37a9cb2ded7a5 |
1 /* Optimize jump instructions, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 91, 92, 93, 1994 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, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* This is the jump-optimization pass of the compiler.
22 It is run two or three times: once before cse, sometimes once after cse,
23 and once after reload (before final).
25 jump_optimize deletes unreachable code and labels that are not used.
26 It also deletes jumps that jump to the following insn,
27 and simplifies jumps around unconditional jumps and jumps
28 to unconditional jumps.
30 Each CODE_LABEL has a count of the times it is used
31 stored in the LABEL_NUSES internal field, and each JUMP_INSN
32 has one label that it refers to stored in the
33 JUMP_LABEL internal field. With this we can detect labels that
34 become unused because of the deletion of all the jumps that
35 formerly used them. The JUMP_LABEL info is sometimes looked
36 at by later passes.
38 Optionally, cross-jumping can be done. Currently it is done
39 only the last time (when after reload and before final).
40 In fact, the code for cross-jumping now assumes that register
41 allocation has been done, since it uses `rtx_renumbered_equal_p'.
43 Jump optimization is done after cse when cse's constant-propagation
44 causes jumps to become unconditional or to be deleted.
46 Unreachable loops are not detected here, because the labels
47 have references and the insns appear reachable from the labels.
48 find_basic_blocks in flow.c finds and deletes such loops.
50 The subroutines delete_insn, redirect_jump, and invert_jump are used
51 from other passes as well. */
63 /* ??? Eventually must record somehow the labels used by jumps
64 from nested functions. */
65 /* Pre-record the next or previous real insn for each label?
66 No, this pass is very fast anyway. */
67 /* Condense consecutive labels?
68 This would make life analysis faster, maybe. */
69 /* Optimize jump y; x: ... y: jumpif... x?
70 Don't know if it is worth bothering with. */
71 /* Optimize two cases of conditional jump to conditional jump?
72 This can never delete any instruction or make anything dead,
73 or even change what is live at any point.
74 So perhaps let combiner do it. */
76 /* Vector indexed by uid.
77 For each CODE_LABEL, index by its uid to get first unconditional jump
78 that jumps to the label.
79 For each JUMP_INSN, index by its uid to get the next unconditional jump
80 that jumps to the same label.
81 Element 0 is the start of a chain of all return insns.
82 (It is safe to use element 0 because insn uid 0 is not used. */
86 /* List of labels referred to from initializers.
87 These can never be deleted. */
88 rtx forced_labels;
90 /* Maximum index in jump_chain. */
94 /* Set nonzero by jump_optimize if control can fall through
95 to the end of the function. */
98 /* Indicates whether death notes are significant in cross jump analysis.
99 Normally they are not significant, because of A and B jump to C,
100 and R dies in A, it must die in B. But this might not be true after
101 stack register conversion, and we must compare death notes in that
102 case. */
116 \f
117 /* Delete no-op jumps and optimize jumps to jumps
118 and jumps around jumps.
119 Delete unused labels and unreachable code.
121 If CROSS_JUMP is 1, detect matching code
122 before a jump and its destination and unify them.
123 If CROSS_JUMP is 2, do cross-jumping, but pay attention to death notes.
125 If NOOP_MOVES is nonzero, delete no-op move insns.
127 If AFTER_REGSCAN is nonzero, then this jump pass is being run immediately
128 after regscan, and it is safe to use regno_first_uid and regno_last_uid.
130 If `optimize' is zero, don't change any code,
131 just determine whether control drops off the end of the function.
132 This case occurs when we have -W and not -O.
133 It works because `delete_insn' checks the value of `optimize'
134 and refrains from actually deleting when that is 0. */
136 void
138 rtx f;
142 {
147 rtx last_insn;
151 /* Initialize LABEL_NUSES and JUMP_LABEL fields. Delete any REG_LABEL
152 notes whose labels don't occur in the insn any more. */
155 {
162 {
167 }
171 }
173 max_uid++;
175 /* Delete insns following barriers, up to next label. */
178 {
180 {
183 {
187 else
189 }
190 /* INSN is now the code_label. */
191 }
192 else
194 }
196 /* Leave some extra room for labels and duplicate exit test insns
197 we make. */
202 /* Mark the label each jump jumps to.
203 Combine consecutive labels, and count uses of labels.
205 For each label, make a chain (using `jump_chain')
206 of all the *unconditional* jumps that jump to it;
207 also make a chain of all returns. */
212 {
215 {
217 {
221 }
223 {
226 }
227 }
228 }
230 /* Keep track of labels used from static data;
231 they cannot ever be deleted. */
236 /* Delete all labels already not referenced.
237 Also find the last insn. */
241 {
244 else
245 {
248 }
249 }
252 {
253 /* See if there is still a NOTE_INSN_FUNCTION_END in this function.
254 If so record that this function can drop off the end. */
257 {
260 /* One label can follow the end-note: the return label. */
262 /* Ordinary insns can follow it if returning a structure. */
264 /* If machine uses explicit RETURN insns, no epilogue,
265 then one of them follows the note. */
268 /* Other kinds of notes can follow also. */
272 }
274 /* Report if control can fall through at the end of the function. */
280 /* Zero the "deleted" flag of all the "deleted" insns. */
284 }
286 #ifdef HAVE_return
288 {
289 /* If we fall through to the epilogue, see if we can insert a RETURN insn
290 in front of it. If the machine allows it at this point (we might be
291 after reload for a leaf routine), it will improve optimization for it
292 to be there. */
298 {
301 }
302 }
303 #endif
307 {
311 {
314 /* Combine stack_adjusts with following push_insns. */
315 #ifdef PUSH_ROUNDING
322 {
323 rtx p;
329 /* Find all successive push insns. */
331 /* Don't convert more than three pushes;
332 that starts adding too many displaced addresses
333 and the whole thing starts becoming a losing
334 proposition. */
336 {
345 /* Allow a no-op move between the adjust and the push. */
354 pushes++;
359 }
361 /* Discard the amount pushed from the stack adjust;
362 maybe eliminate it entirely. */
364 {
367 }
368 else
372 /* Change the appropriate push insns to ordinary stores. */
375 {
389 /* If this push doesn't fully fit in the space
390 of the stack adjust that we deleted,
391 make another stack adjust here for what we
392 didn't use up. There should be peepholes
393 to recognize the resulting sequence of insns. */
395 {
398 p);
400 }
403 }
404 }
405 #endif
407 /* Detect and delete no-op move instructions
408 resulting from not allocating a parameter in a register. */
421 /* Detect and ignore no-op move instructions
422 resulting from smart or fortuitous register allocation. */
425 {
432 {
433 rtx trial;
438 #ifdef PRESERVE_DEATH_INFO_REGNO_P
439 /* Deleting insn could lose a death-note for SREG or DREG
440 so don't do it if final needs accurate death-notes. */
443 #endif
444 {
445 /* DREG may have been the target of a REG_DEAD note in
446 the insn which makes INSN redundant. If so, reorg
447 would still think it is dead. So search for such a
448 note and delete it if we find it. */
453 {
456 }
461 }
462 }
467 {
468 /* This handles the case where we have two consecutive
469 assignments of the same constant to pseudos that didn't
470 get a hard reg. Each SET from the constant will be
471 converted into a SET of the spill register and an
472 output reload will be made following it. This produces
473 two loads of the same constant into the same spill
474 register. */
478 /* Look back for a death note for the first reg.
479 If there is one, it is no longer accurate. */
481 {
485 {
488 }
490 }
492 /* Delete the second load of the value. */
494 }
495 }
497 {
498 /* If each part is a set between two identical registers or
499 a USE or CLOBBER, delete the insn. */
501 rtx tem;
504 {
514 }
518 }
519 /* Also delete insns to store bit fields if they are no-ops. */
520 /* Not worth the hair to detect this in the big-endian case. */
529 }
531 }
533 /* If we haven't yet gotten to reload and we have just run regscan,
534 delete any insn that sets a register that isn't used elsewhere.
535 This helps some of the optimizations below by having less insns
536 being jumped around. */
540 {
548 /* We use regno_last_note_uid so as not to delete the setting
549 of a reg that's used in notes. A subsequent optimization
550 might arrange to use that reg for real. */
555 }
557 /* Now iterate optimizing jumps until nothing changes over one pass. */
560 {
564 {
565 rtx reallabelprev;
567 rtx nlabel;
570 #if 0
571 /* If NOT the first iteration, if this is the last jump pass
572 (just before final), do the special peephole optimizations.
573 Avoiding the first iteration gives ordinary jump opts
574 a chance to work before peephole opts. */
579 #endif
581 /* That could have deleted some insns after INSN, so check now
582 what the following insn is. */
586 /* See if this is a NOTE_INSN_LOOP_BEG followed by an unconditional
587 jump. Try to optimize by duplicating the loop exit test if so.
588 This is only safe immediately after regscan, because it uses
589 the values of regno_first_uid and regno_last_uid. */
594 {
597 {
601 }
602 }
611 /* Tension the labels in dispatch tables. */
618 /* If a dispatch table always goes to the same place,
619 get rid of it and replace the insn that uses it. */
623 {
638 /* Don't mess with a casesi insn. */
643 {
647 }
648 }
652 /* If a jump references the end of the function, try to turn
653 it into a RETURN insn, possibly a conditional one. */
660 /* Detect jump to following insn. */
662 {
667 }
669 /* If we have an unconditional jump preceded by a USE, try to put
670 the USE before the target and jump there. This simplifies many
671 of the optimizations below since we don't have to worry about
672 dealing with these USE insns. We only do this if the label
673 being branch to already has the identical USE or if code
674 never falls through to that label. */
683 {
685 {
688 }
694 }
696 /* Simplify if (...) x = a; else x = b; by converting it
697 to x = b; if (...) x = a;
698 if B is sufficiently simple, the test doesn't involve X,
699 and nothing in the test modifies B or X.
701 If we have small register classes, we also can't do this if X
702 is a hard register.
704 If the "x = b;" insn has any REG_NOTES, we don't do this because
705 of the possibility that we are running after CSE and there is a
706 REG_EQUAL note that is only valid if the branch has already been
707 taken. If we move the insn with the REG_EQUAL note, we may
708 fold the comparison to always be false in a later CSE pass.
709 (We could also delete the REG_NOTES when moving the insn, but it
710 seems simpler to not move it.) An exception is that we can move
711 the insn if the only note is a REG_EQUAL or REG_EQUIV whose
712 value is the same as "b".
714 INSN is the branch over the `else' part.
716 We set:
718 TEMP to the jump insn preceding "x = a;"
719 TEMP1 to X
720 TEMP2 to the insn that sets "x = b;"
721 TEMP3 to the insn that sets "x = a;"
722 TEMP4 to the set of "x = b"; */
729 #ifdef SMALL_REGISTER_CLASSES
731 #endif
747 /* TEMP must skip over the "x = a;" insn */
750 /* There must be no other entries to the "x = b;" insn. */
752 /* INSN must either branch to the insn after TEMP2 or the insn
753 after TEMP2 must branch to the same place as INSN. */
758 {
759 /* The test expression, X, may be a complicated test with
760 multiple branches. See if we can find all the uses of
761 the label that TEMP branches to without hitting a CALL_INSN
762 or a jump to somewhere else. */
767 /* Set P to the first jump insn that goes around "x = a;". */
769 {
771 {
774 {
775 nuses--;
778 }
779 else
781 }
784 }
786 #ifdef HAVE_cc0
787 /* We cannot insert anything between a set of cc and its use
788 so if P uses cc0, we must back up to the previous insn. */
793 #endif
798 /* If we found all the uses and there was no data conflict, we
799 can move the assignment unless we can branch into the middle
800 from somewhere. */
807 {
811 /* Set NEXT to an insn that we know won't go away. */
814 /* Delete the jump around the set. Note that we must do
815 this before we redirect the test jumps so that it won't
816 delete the code immediately following the assignment
817 we moved (which might be a jump). */
821 /* We either have two consecutive labels or a jump to
822 a jump, so adjust all the JUMP_INSNs to branch to where
823 INSN branches to. */
830 }
831 }
833 #ifndef HAVE_cc0
834 /* If we have if (...) x = exp; and branches are expensive,
835 EXP is a single insn, does not have any side effects, cannot
836 trap, and is not too costly, convert this to
837 t = exp; if (...) x = t;
839 Don't do this when we have CC0 because it is unlikely to help
840 and we'd need to worry about where to place the new insn and
841 the potential for conflicts. We also can't do this when we have
842 notes on the insn for the same reason as above.
844 We set:
846 TEMP to the "x = exp;" insn.
847 TEMP1 to the single set in the "x = exp; insn.
848 TEMP2 to "x". */
863 #ifdef SMALL_REGISTER_CLASSES
865 #endif
872 {
876 {
882 }
883 }
885 /* Similarly, if it takes two insns to compute EXP but they
886 have the same destination. Here TEMP3 will be the second
887 insn and TEMP4 the SET from that insn. */
905 #ifdef SMALL_REGISTER_CLASSES
907 #endif
916 {
920 {
924 emit_insn_after_with_line_notes
930 }
931 }
933 /* Finally, handle the case where two insns are used to
934 compute EXP but a temporary register is used. Here we must
935 ensure that the temporary register is not used anywhere else. */
938 && after_regscan
966 #ifdef SMALL_REGISTER_CLASSES
968 #endif
973 {
977 {
986 }
987 }
990 /* We deal with four cases:
992 1) x = a; if (...) x = b; and either A or B is zero,
993 2) if (...) x = 0; and jumps are expensive,
994 3) x = a; if (...) x = b; and A and B are constants where all the
995 set bits in A are also set in B and jumps are expensive, and
996 4) x = a; if (...) x = b; and A and B non-zero, and jumps are
997 more expensive.
998 5) if (...) x = b; if jumps are even more expensive.
1000 In each of these try to use a store-flag insn to avoid the jump.
1001 (If the jump would be faster, the machine should not have
1002 defined the scc insns!). These cases are often made by the
1003 previous optimization.
1005 INSN here is the jump around the store. We set:
1007 TEMP to the "x = b;" insn.
1008 TEMP1 to X.
1009 TEMP2 to B (const0_rtx in the second case).
1010 TEMP3 to A (X in the second case).
1011 TEMP4 to the condition being tested.
1012 TEMP5 to the earliest insn used to find the condition. */
1015 ! reload_completed
1017 /* Set TEMP to the "x = b;" insn. */
1022 #ifdef SMALL_REGISTER_CLASSES
1024 #endif
1029 /* Allow either form, but prefer the former if both apply.
1030 There is no point in using the old value of TEMP1 if
1031 it is a register, since cse will alias them. It can
1032 lose if the old value were a hard register since CSE
1033 won't replace hard registers. */
1036 /* Make the latter case look like x = x; if (...) x = 0; */
1040 #ifdef HAVE_conditional_move
1041 || HAVE_conditional_move
1042 #endif
1044 /* INSN must either branch to the insn after TEMP or the insn
1045 after TEMP must branch to the same place as INSN. */
1051 /* We must be comparing objects whose modes imply the size.
1052 We could handle BLKmode if (1) emit_store_flag could
1053 and (2) we could find the size reliably. */
1056 /* If B is zero, OK; if A is zero, can only do (1) if we
1057 can reverse the condition. See if (3) applies possibly
1058 by reversing the condition. Prefer reversing to (4) when
1059 branches are very expensive. */
1069 insn)))))
1070 #ifdef HAVE_conditional_move
1071 || HAVE_conditional_move
1072 #endif
1074 #ifdef HAVE_cc0
1075 /* If the previous insn sets CC0 and something else, we can't
1076 do this since we are going to delete that insn. */
1083 #endif
1084 )
1085 {
1089 rtx target;
1091 /* If necessary, reverse the condition. */
1094 else
1097 /* See if we can do this with a store-flag insn. */
1100 /* If CVAL is non-zero, normalize to -1. Otherwise,
1101 if UVAL is the constant 1, it is best to just compute
1102 the result directly. If UVAL is constant and STORE_FLAG_VALUE
1103 includes all of its bits, it is best to compute the flag
1104 value unnormalized and `and' it with UVAL. Otherwise,
1105 normalize to -1 and `and' with UVAL. */
1112 /* We will be putting the store-flag insn immediately in
1113 front of the comparison that was originally being done,
1114 so we know all the variables in TEMP4 will be valid.
1115 However, this might be in front of the assignment of
1116 A to VAR. If it is, it would clobber the store-flag
1117 we will be emitting.
1119 Therefore, emit into a temporary which will be copied to
1120 VAR immediately after TEMP. */
1124 VOIDmode,
1127 normalizep);
1129 {
1131 rtx seq;
1133 /* Put the store-flag insns in front of the first insn
1134 used to compute the condition to ensure that we
1135 use the same values of them as the current
1136 comparison. However, the remainder of the insns we
1137 generate will be placed directly in front of the
1138 jump insn, in case any of the pseudos we use
1139 are modified earlier. */
1148 /* Both CVAL and UVAL are non-zero. */
1150 {
1158 else
1159 {
1165 }
1167 /* If we usually make new pseudos, do so here. This
1168 turns out to help machines that have conditional
1169 move insns. */
1177 }
1179 {
1180 /* We know that either CVAL or UVAL is zero. If
1181 UVAL is zero, negate TARGET and `and' with CVAL.
1182 Otherwise, `and' with UVAL. */
1184 {
1188 }
1194 }
1200 #ifdef HAVE_cc0
1201 /* If INSN uses CC0, we must not separate it from the
1202 insn that sets cc0. */
1206 #endif
1216 }
1217 else
1219 }
1221 /* If branches are expensive, convert
1222 if (foo) bar++; to bar += (foo != 0);
1223 and similarly for "bar--;"
1225 INSN is the conditional branch around the arithmetic. We set:
1227 TEMP is the arithmetic insn.
1228 TEMP1 is the SET doing the arithmetic.
1229 TEMP2 is the operand being incremented or decremented.
1230 TEMP3 to the condition being tested.
1231 TEMP4 to the earliest insn used to find the condition. */
1234 #ifdef HAVE_incscc
1235 || HAVE_incscc
1236 #endif
1237 #ifdef HAVE_decscc
1238 || HAVE_decscc
1239 #endif
1240 )
1241 && ! reload_completed
1253 /* INSN must either branch to the insn after TEMP or the insn
1254 after TEMP must branch to the same place as INSN. */
1260 /* We must be comparing objects whose modes imply the size.
1261 We could handle BLKmode if (1) emit_store_flag could
1262 and (2) we could find the size reliably. */
1265 {
1271 /* It must be the case that TEMP2 is not modified in the range
1272 [TEMP4, INSN). The one exception we make is if the insn
1273 before INSN sets TEMP2 to something which is also unchanged
1274 in that range. In that case, we can move the initialization
1275 into our sequence. */
1284 {
1288 }
1294 VOIDmode,
1298 /* If we can do the store-flag, do the addition or
1299 subtraction. */
1308 {
1309 /* Put the result back in temp2 in case it isn't already.
1310 Then replace the jump, possible a CC0-setting insn in
1311 front of the jump, and TEMP, with the sequence we have
1312 made. */
1327 #ifdef HAVE_cc0
1329 #endif
1333 }
1334 else
1336 }
1338 /* Simplify if (...) x = 1; else {...} if (x) ...
1339 We recognize this case scanning backwards as well.
1341 TEMP is the assignment to x;
1342 TEMP1 is the label at the head of the second if. */
1343 /* ?? This should call get_condition to find the values being
1344 compared, instead of looking for a COMPARE insn when HAVE_cc0
1345 is not defined. This would allow it to work on the m88k. */
1346 /* ?? This optimization is only safe before cse is run if HAVE_cc0
1347 is not defined and the condition is tested by a separate compare
1348 insn. This is because the code below assumes that the result
1349 of the compare dies in the following branch.
1351 Not only that, but there might be other insns between the
1352 compare and branch whose results are live. Those insns need
1353 to be executed.
1355 A way to fix this is to move the insns at JUMP_LABEL (insn)
1356 to before INSN. If we are running before flow, they will
1357 be deleted if they aren't needed. But this doesn't work
1358 well after flow.
1360 This is really a special-case of jump threading, anyway. The
1361 right thing to do is to replace this and jump threading with
1362 much simpler code in cse.
1364 This code has been turned off in the non-cc0 case in the
1365 meantime. */
1367 #ifdef HAVE_cc0
1369 /* Safe to skip USE and CLOBBER insns here
1370 since they will not be deleted. */
1378 /* If we find that the next value tested is `x'
1379 (TEMP1 is the insn where this happens), win. */
1382 #ifdef HAVE_cc0
1383 /* Does temp1 `tst' the value of x? */
1387 #else
1388 /* Does temp1 compare the value of x against zero? */
1395 #endif
1397 {
1398 /* Get the if_then_else from the condjump. */
1401 {
1404 rtx cond
1407 rtx ultimate;
1413 else
1423 }
1424 }
1425 #endif
1427 #if 0
1428 /* @@ This needs a bit of work before it will be right.
1430 Any type of comparison can be accepted for the first and
1431 second compare. When rewriting the first jump, we must
1432 compute the what conditions can reach label3, and use the
1433 appropriate code. We can not simply reverse/swap the code
1434 of the first jump. In some cases, the second jump must be
1435 rewritten also.
1437 For example,
1438 < == converts to > ==
1439 < != converts to == >
1440 etc.
1442 If the code is written to only accept an '==' test for the second
1443 compare, then all that needs to be done is to swap the condition
1444 of the first branch.
1446 It is questionable whether we want this optimization anyways,
1447 since if the user wrote code like this because he/she knew that
1448 the jump to label1 is taken most of the time, then rewriting
1449 this gives slower code. */
1450 /* @@ This should call get_condition to find the values being
1451 compared, instead of looking for a COMPARE insn when HAVE_cc0
1452 is not defined. This would allow it to work on the m88k. */
1453 /* @@ This optimization is only safe before cse is run if HAVE_cc0
1454 is not defined and the condition is tested by a separate compare
1455 insn. This is because the code below assumes that the result
1456 of the compare dies in the following branch. */
1458 /* Simplify test a ~= b
1459 condjump label1;
1460 test a == b
1461 condjump label2;
1462 jump label3;
1463 label1:
1465 rewriting as
1466 test a ~~= b
1467 condjump label3
1468 test a == b
1469 condjump label2
1470 label1:
1472 where ~= is an inequality, e.g. >, and ~~= is the swapped
1473 inequality, e.g. <.
1475 We recognize this case scanning backwards.
1477 TEMP is the conditional jump to `label2';
1478 TEMP1 is the test for `a == b';
1479 TEMP2 is the conditional jump to `label1';
1480 TEMP3 is the test for `a ~= b'. */
1489 #ifdef HAVE_cc0
1491 #else
1495 #endif
1509 {
1514 {
1517 }
1521 }
1522 #endif
1523 /* Simplify if (...) {... x = 1;} if (x) ...
1525 We recognize this case backwards.
1527 TEMP is the test of `x';
1528 TEMP1 is the assignment to `x' at the end of the
1529 previous statement. */
1530 /* @@ This should call get_condition to find the values being
1531 compared, instead of looking for a COMPARE insn when HAVE_cc0
1532 is not defined. This would allow it to work on the m88k. */
1533 /* @@ This optimization is only safe before cse is run if HAVE_cc0
1534 is not defined and the condition is tested by a separate compare
1535 insn. This is because the code below assumes that the result
1536 of the compare dies in the following branch. */
1538 /* ??? This has to be turned off. The problem is that the
1539 unconditional jump might indirectly end up branching to the
1540 label between TEMP1 and TEMP. We can't detect this, in general,
1541 since it may become a jump to there after further optimizations.
1542 If that jump is done, it will be deleted, so we will retry
1543 this optimization in the next pass, thus an infinite loop.
1545 The present code prevents this by putting the jump after the
1546 label, but this is not logically correct. */
1547 #if 0
1549 /* Safe to skip USE and CLOBBER insns here
1550 since they will not be deleted. */
1555 #ifdef HAVE_cc0
1558 #else
1559 /* Temp must be a compare insn, we can not accept a register
1560 to register move here, since it may not be simply a
1561 tst insn. */
1567 #endif
1568 /* May skip USE or CLOBBER insns here
1569 for checking for opportunity, since we
1570 take care of them later. */
1574 #ifdef HAVE_cc0
1576 #else
1579 #endif
1581 /* If this isn't true, cse will do the job. */
1583 {
1584 /* Get the if_then_else from the condjump. */
1589 {
1591 rtx last_insn;
1592 rtx ultimate;
1593 rtx p;
1595 /* Get the place that condjump will jump to
1596 if it is reached from here. */
1600 else
1602 /* Get it as a CODE_LABEL. */
1605 else
1606 /* Get the label out of the LABEL_REF. */
1609 /* Insert the jump immediately before TEMP, specifically
1610 after the label that is between TEMP1 and TEMP. */
1613 /* If we would be branching to the next insn, the jump
1614 would immediately be deleted and the re-inserted in
1615 a subsequent pass over the code. So don't do anything
1616 in that case. */
1619 {
1622 last_insn);
1627 {
1631 }
1634 }
1635 }
1636 }
1637 #endif
1638 /* Detect a conditional jump going to the same place
1639 as an immediately following unconditional jump. */
1645 {
1649 }
1650 /* Detect a conditional jump jumping over an unconditional jump. */
1653 && ! this_is_simplejump
1659 {
1660 /* When we invert the unconditional jump, we will be
1661 decrementing the usage count of its old label.
1662 Make sure that we don't delete it now because that
1663 might cause the following code to be deleted. */
1671 {
1672 /* It is very likely that if there are USE insns before
1673 this jump, they hold REG_DEAD notes. These REG_DEAD
1674 notes are no longer valid due to this optimization,
1675 and will cause the life-analysis that following passes
1676 (notably delayed-branch scheduling) to think that
1677 these registers are dead when they are not.
1679 To prevent this trouble, we just remove the USE insns
1680 from the insn chain. */
1684 {
1688 }
1693 }
1695 /* We can now safely delete the label if it is unreferenced
1696 since the delete_insn above has deleted the BARRIER. */
1700 }
1701 else
1702 {
1703 /* Detect a jump to a jump. */
1708 {
1711 }
1713 /* Look for if (foo) bar; else break; */
1714 /* The insns look like this:
1715 insn = condjump label1;
1716 ...range1 (some insns)...
1717 jump label2;
1718 label1:
1719 ...range2 (some insns)...
1720 jump somewhere unconditionally
1721 label2: */
1722 {
1725 /* Don't do this optimization on the first round, so that
1726 jump-around-a-jump gets simplified before we ask here
1727 whether a jump is unconditional.
1729 Also don't do it when we are called after reload since
1730 it will confuse reorg. */
1733 /* Make sure INSN is something we can invert. */
1740 {
1747 /* Invert the jump condition, so we
1748 still execute the same insns in each case. */
1750 {
1755 rtx rangenext;
1757 /* Include in each range any notes before it, to be
1758 sure that we get the line number note if any, even
1759 if there are other notes here. */
1768 /* Don't move NOTEs for blocks or loops; shift them
1769 outside the ranges, where they'll stay put. */
1773 /* Get current surrounds of the 2 ranges. */
1779 /* Splice range2 where range1 was. */
1784 /* Splice range1 where range2 was. */
1790 /* Check for a loop end note between the end of
1791 range2, and the next code label. If there is one,
1792 then what we have really seen is
1793 if (foo) break; end_of_loop;
1794 and moved the break sequence outside the loop.
1795 We must move the LOOP_END note to where the
1796 loop really ends now, or we will confuse loop
1797 optimization. */
1799 {
1804 {
1815 }
1816 }
1819 }
1820 }
1821 }
1823 /* Now that the jump has been tensioned,
1824 try cross jumping: check for identical code
1825 before the jump and before its target label. */
1827 /* First, cross jumping of conditional jumps: */
1830 {
1834 /* A conditional jump may be crossjumped
1835 only if the place it jumps to follows
1836 an opposing jump that comes back here. */
1839 /* We have no opposing jump;
1840 cannot cross jump this insn. */
1844 /* TARGET is nonzero if it is ok to cross jump
1845 to code before TARGET. If so, see if matches. */
1851 {
1853 /* Make the old conditional jump
1854 into an unconditional one. */
1859 /* Add to jump_chain unless this is a new label
1860 whose UID is too large. */
1862 {
1866 }
1869 }
1870 }
1872 /* Cross jumping of unconditional jumps:
1873 a few differences. */
1876 {
1878 rtx target;
1882 /* TARGET is nonzero if it is ok to cross jump
1883 to code before TARGET. If so, see if matches. */
1887 /* If cannot cross jump to code before the label,
1888 see if we can cross jump to another jump to
1889 the same label. */
1890 /* Try each other jump to this label. */
1897 /* Ignore TARGET if it's deleted. */
1903 {
1907 }
1908 }
1910 /* This code was dead in the previous jump.c! */
1912 {
1913 /* Return insns all "jump to the same place"
1914 so we can cross-jump between any two of them. */
1920 /* If cannot cross jump to code before the label,
1921 see if we can cross jump to another jump to
1922 the same label. */
1923 /* Try each other jump to this label. */
1934 {
1938 }
1939 }
1940 }
1941 }
1944 }
1946 /* Delete extraneous line number notes.
1947 Note that two consecutive notes for different lines are not really
1948 extraneous. There should be some indication where that line belonged,
1949 even if it became empty. */
1951 {
1956 {
1957 /* Delete this note if it is identical to previous note. */
1961 {
1964 }
1967 }
1968 }
1970 #ifdef HAVE_return
1972 {
1973 /* If we fall through to the epilogue, see if we can insert a RETURN insn
1974 in front of it. If the machine allows it at this point (we might be
1975 after reload for a leaf routine), it will improve optimization for it
1976 to be there. We do this both here and at the start of this pass since
1977 the RETURN might have been deleted by some of our optimizations. */
1983 {
1986 }
1987 }
1988 #endif
1990 /* See if there is still a NOTE_INSN_FUNCTION_END in this function.
1991 If so, delete it, and record that this function can drop off the end. */
1994 {
1997 /* One label can follow the end-note: the return label. */
1999 /* Ordinary insns can follow it if returning a structure. */
2001 /* If machine uses explicit RETURN insns, no epilogue,
2002 then one of them follows the note. */
2005 /* Other kinds of notes can follow also. */
2009 }
2011 /* Report if control can fall through at the end of the function. */
2014 {
2017 }
2019 /* Show JUMP_CHAIN no longer valid. */
2021 }
2022 \f
2023 /* LOOP_START is a NOTE_INSN_LOOP_BEG note that is followed by an unconditional
2024 jump. Assume that this unconditional jump is to the exit test code. If
2025 the code is sufficiently simple, make a copy of it before INSN,
2026 followed by a jump to the exit of the loop. Then delete the unconditional
2027 jump after INSN.
2029 Note that it is possible we can get confused here if the jump immediately
2030 after the loop start branches outside the loop but within an outer loop.
2031 If we are near the exit of that loop, we will copy its exit test. This
2032 will not generate incorrect code, but could suppress some optimizations.
2033 However, such cases are degenerate loops anyway.
2035 Return 1 if we made the change, else 0.
2037 This is only safe immediately after a regscan pass because it uses the
2038 values of regno_first_uid and regno_last_uid. */
2040 static int
2042 rtx loop_start;
2043 {
2048 rtx lastexit;
2052 /* Scan the exit code. We do not perform this optimization if any insn:
2054 is a CALL_INSN
2055 is a CODE_LABEL
2056 has a REG_RETVAL or REG_LIBCALL note (hard to adjust)
2057 is a NOTE_INSN_LOOP_BEG because this means we have a nested loop
2058 is a NOTE_INSN_BLOCK_{BEG,END} because duplicating these notes
2059 are not valid
2061 Also, don't do this if the exit code is more than 20 insns. */
2064 insn
2068 {
2070 {
2087 }
2088 }
2090 /* Unless INSN is zero, we can do the optimization. */
2096 /* See if any insn sets a register only used in the loop exit code and
2097 not a user variable. If so, replace it with a new register. */
2106 {
2112 {
2113 /* We can do the replacement. Allocate reg_map if this is the
2114 first replacement we found. */
2116 {
2119 }
2124 }
2125 }
2127 /* Now copy each insn. */
2130 {
2135 /* Only copy line-number notes. */
2137 {
2140 }
2150 /* Copy all REG_NOTES except REG_LABEL since mark_jump_label will
2151 make them. */
2167 {
2171 }
2173 /* If this is a simple jump, add it to the jump chain. */
2177 {
2181 }
2186 }
2188 /* Now clean up by emitting a jump to the end label and deleting the jump
2189 at the start of the loop. */
2191 {
2193 loop_start);
2197 {
2201 }
2203 }
2205 /* Mark the exit code as the virtual top of the converted loop. */
2211 }
2212 \f
2213 /* Move all block-beg, block-end, loop-beg, loop-cont, loop-vtop, and
2214 loop-end notes between START and END out before START. Assume that
2215 END is not such a note. START may be such a note. Returns the value
2216 of the new starting insn, which may be different if the original start
2217 was such a note. */
2219 rtx
2222 {
2223 rtx insn;
2224 rtx next;
2227 {
2236 {
2239 else
2240 {
2248 }
2249 }
2250 }
2253 }
2254 \f
2255 /* Compare the instructions before insn E1 with those before E2
2256 to find an opportunity for cross jumping.
2257 (This means detecting identical sequences of insns followed by
2258 jumps to the same place, or followed by a label and a jump
2259 to that label, and replacing one with a jump to the other.)
2261 Assume E1 is a jump that jumps to label E2
2262 (that is not always true but it might as well be).
2263 Find the longest possible equivalent sequences
2264 and store the first insns of those sequences into *F1 and *F2.
2265 Store zero there if no equivalent preceding instructions are found.
2267 We give up if we find a label in stream 1.
2268 Actually we could transfer that label into stream 2. */
2270 static void
2275 {
2282 rtx prev1;
2288 {
2298 /* Don't allow the range of insns preceding E1 or E2
2299 to include the other (E2 or E1). */
2303 /* If we will get to this code by jumping, those jumps will be
2304 tensioned to go directly to the new label (before I2),
2305 so this cross-jumping won't cost extra. So reduce the minimum. */
2307 {
2310 }
2318 /* If this is a CALL_INSN, compare register usage information.
2319 If we don't check this on stack register machines, the two
2320 CALL_INSNs might be merged leaving reg-stack.c with mismatching
2321 numbers of stack registers in the same basic block.
2322 If we don't check this on machines with delay slots, a delay slot may
2323 be filled that clobbers a parameter expected by the subroutine.
2325 ??? We take the simple route for now and assume that if they're
2326 equal, they were constructed identically. */
2333 #ifdef STACK_REGS
2334 /* If cross_jump_death_matters is not 0, the insn's mode
2335 indicates whether or not the insn contains any stack-like
2336 regs. */
2339 {
2340 /* If register stack conversion has already been done, then
2341 death notes must also be compared before it is certain that
2342 the two instruction streams match. */
2344 rtx note;
2364 done:
2365 ;
2366 }
2367 #endif
2371 {
2372 /* The following code helps take care of G++ cleanups. */
2373 rtx equiv1;
2374 rtx equiv2;
2381 /* If the equivalences are not to a constant, they may
2382 reference pseudos that no longer exist, so we can't
2383 use them. */
2386 {
2391 {
2398 }
2399 }
2401 /* Insns fail to match; cross jumping is limited to the following
2402 insns. */
2404 #ifdef HAVE_cc0
2405 /* Don't allow the insn after a compare to be shared by
2406 cross-jumping unless the compare is also shared.
2407 Here, if either of these non-matching insns is a compare,
2408 exclude the following insn from possible cross-jumping. */
2411 #endif
2413 /* If cross-jumping here will feed a jump-around-jump
2414 optimization, this jump won't cost extra, so reduce
2415 the minimum. */
2421 }
2423 win:
2425 {
2426 /* Ok, this insn is potentially includable in a cross-jump here. */
2429 }
2430 }
2434 }
2436 static void
2439 {
2440 /* Find an existing label at this point
2441 or make a new one if there is none. */
2444 /* Make the same jump insn jump to the new point. */
2446 {
2447 /* Remove from jump chain of returns. */
2449 /* Change the insn. */
2454 /* Add to new the jump chain. */
2457 {
2460 }
2461 }
2462 else
2465 /* Delete the matching insns before the jump. Also, remove any REG_EQUAL
2466 or REG_EQUIV note in the NEWLPOS stream that isn't also present in
2467 the NEWJPOS stream. */
2470 {
2471 rtx lnote;
2483 }
2484 }
2485 \f
2486 /* Return the label before INSN, or put a new label there. */
2488 rtx
2490 rtx insn;
2491 {
2492 rtx label;
2494 /* Find an existing label at this point
2495 or make a new one if there is none. */
2499 {
2505 }
2507 }
2509 /* Return the label after INSN, or put a new label there. */
2511 rtx
2513 rtx insn;
2514 {
2515 rtx label;
2517 /* Find an existing label at this point
2518 or make a new one if there is none. */
2522 {
2526 }
2528 }
2529 \f
2530 /* Return 1 if INSN is a jump that jumps to right after TARGET
2531 only on the condition that TARGET itself would drop through.
2532 Assumes that TARGET is a conditional jump. */
2534 static int
2537 {
2553 {
2557 }
2560 {
2564 }
2569 }
2570 \f
2571 /* Given a comparison, COMPARISON, inside a conditional jump insn, INSN,
2572 return non-zero if it is safe to reverse this comparison. It is if our
2573 floating-point is not IEEE, if this is an NE or EQ comparison, or if
2574 this is known to be an integer comparison. */
2576 int
2578 rtx comparison;
2579 rtx insn;
2580 {
2581 rtx arg0;
2583 /* If this is not actually a comparison, we can't reverse it. */
2588 /* If this is an NE comparison, it is safe to reverse it to an EQ
2589 comparison and vice versa, even for floating point. If no operands
2590 are NaNs, the reversal is valid. If some operand is a NaN, EQ is
2591 always false and NE is always true, so the reversal is also valid. */
2592 || flag_fast_math
2599 /* Make sure ARG0 is one of the actual objects being compared. If we
2600 can't do this, we can't be sure the comparison can be reversed.
2602 Handle cc0 and a MODE_CC register. */
2604 #ifdef HAVE_cc0
2606 #endif
2607 )
2608 {
2619 }
2621 /* We can reverse this if ARG0 is a CONST_INT or if its mode is
2622 not VOIDmode and neither a MODE_CC nor MODE_FLOAT type. */
2627 }
2629 /* Given an rtx-code for a comparison, return the code
2630 for the negated comparison.
2631 WATCH OUT! reverse_condition is not safe to use on a jump
2632 that might be acting on the results of an IEEE floating point comparison,
2633 because of the special treatment of non-signaling nans in comparisons.
2634 Use can_reverse_comparison_p to be sure. */
2636 enum rtx_code
2639 {
2641 {
2675 }
2676 }
2678 /* Similar, but return the code when two operands of a comparison are swapped.
2679 This IS safe for IEEE floating-point. */
2681 enum rtx_code
2684 {
2686 {
2718 }
2719 }
2721 /* Given a comparison CODE, return the corresponding unsigned comparison.
2722 If CODE is an equality comparison or already an unsigned comparison,
2723 CODE is returned. */
2725 enum rtx_code
2728 {
2730 {
2753 }
2754 }
2756 /* Similarly, return the signed version of a comparison. */
2758 enum rtx_code
2761 {
2763 {
2786 }
2787 }
2788 \f
2789 /* Return non-zero if CODE1 is more strict than CODE2, i.e., if the
2790 truth of CODE1 implies the truth of CODE2. */
2792 int
2795 {
2800 {
2825 }
2828 }
2829 \f
2830 /* Return 1 if INSN is an unconditional jump and nothing else. */
2832 int
2834 rtx insn;
2835 {
2840 }
2842 /* Return nonzero if INSN is a (possibly) conditional jump
2843 and nothing more. */
2845 int
2847 rtx insn;
2848 {
2867 }
2869 /* Return nonzero if INSN is a (possibly) conditional jump
2870 and nothing more. */
2872 int
2874 rtx insn;
2875 {
2880 else
2900 }
2902 /* Return 1 if X is an RTX that does nothing but set the condition codes
2903 and CLOBBER or USE registers.
2904 Return -1 if X does explicitly set the condition codes,
2905 but also does other things. */
2907 int
2909 rtx x;
2910 {
2911 #ifdef HAVE_cc0
2915 {
2920 {
2926 }
2928 }
2930 #else
2932 #endif
2933 }
2934 \f
2935 /* Follow any unconditional jump at LABEL;
2936 return the ultimate label reached by any such chain of jumps.
2937 If LABEL is not followed by a jump, return LABEL.
2938 If the chain loops or we can't find end, return LABEL,
2939 since that tells caller to avoid changing the insn.
2941 If RELOAD_COMPLETED is 0, we do not chain across a NOTE_INSN_LOOP_BEG or
2942 a USE or CLOBBER. */
2944 rtx
2946 rtx label;
2947 {
2960 depth++)
2961 {
2962 /* Don't chain through the insn that jumps into a loop
2963 from outside the loop,
2964 since that would create multiple loop entry jumps
2965 and prevent loop optimization. */
2966 rtx tem;
2973 /* If we have found a cycle, make the insn jump to itself. */
2983 }
2987 }
2989 /* Assuming that field IDX of X is a vector of label_refs,
2990 replace each of them by the ultimate label reached by it.
2991 Return nonzero if a change is made.
2992 If IGNORE_LOOPS is 0, we do not chain across a NOTE_INSN_LOOP_BEG. */
2994 static int
2998 {
3002 {
3006 {
3012 }
3013 }
3015 }
3016 \f
3017 /* Find all CODE_LABELs referred to in X, and increment their use counts.
3018 If INSN is a JUMP_INSN and there is at least one CODE_LABEL referenced
3019 in INSN, then store one of them in JUMP_LABEL (INSN).
3020 If INSN is an INSN or a CALL_INSN and there is at least one CODE_LABEL
3021 referenced in INSN, add a REG_LABEL note containing that label to INSN.
3022 Also, when there are consecutive labels, canonicalize on the last of them.
3024 Note that two labels separated by a loop-beginning note
3025 must be kept distinct if we have not yet done loop-optimization,
3026 because the gap between them is where loop-optimize
3027 will want to move invariant code to. CROSS_JUMP tells us
3028 that loop-optimization is done with.
3030 Once reload has completed (CROSS_JUMP non-zero), we need not consider
3031 two labels distinct if they are separated by only USE or CLOBBER insns. */
3033 static void
3036 rtx insn;
3038 {
3044 {
3057 /* If this is a constant-pool reference, see if it is a label. */
3064 {
3067 rtx note;
3068 rtx next;
3073 /* Ignore references to labels of containing functions. */
3077 /* If there are other labels following this one,
3078 replace it with the last of the consecutive labels. */
3080 {
3093 }
3099 {
3103 /* If we've changed OLABEL and we had a REG_LABEL note
3104 for it, update it as well. */
3109 /* Otherwise, add a REG_LABEL note for LABEL unless there already
3110 is one. */
3112 {
3114 /* Don't record labels that refer to dispatch tables.
3115 This is not necessary, since the tablejump
3116 references the same label.
3117 And if we did record them, flow.c would make worse code. */
3124 }
3125 }
3127 }
3129 /* Do walk the labels in a vector, but not the first operand of an
3130 ADDR_DIFF_VEC. Don't set the JUMP_LABEL of a vector. */
3133 {
3139 }
3140 }
3144 {
3148 {
3152 }
3153 }
3154 }
3156 /* If all INSN does is set the pc, delete it,
3157 and delete the insn that set the condition codes for it
3158 if that's what the previous thing was. */
3160 void
3162 rtx insn;
3163 {
3168 }
3170 /* Delete INSN and recursively delete insns that compute values used only
3171 by INSN. This uses the REG_DEAD notes computed during flow analysis.
3172 If we are running before flow.c, we need do nothing since flow.c will
3173 delete dead code. We also can't know if the registers being used are
3174 dead or not at this point.
3176 Otherwise, look at all our REG_DEAD notes. If a previous insn does
3177 nothing other than set a register that dies in this insn, we can delete
3178 that insn as well.
3180 On machines with CC0, if CC0 is used in this insn, we may be able to
3181 delete the insn that set it. */
3183 static void
3185 rtx insn;
3186 {
3189 #ifdef HAVE_cc0
3191 {
3193 /* We assume that at this stage
3194 CC's are always set explicitly
3195 and always immediately before the jump that
3196 will use them. So if the previous insn
3197 exists to set the CC's, delete it
3198 (unless it performs auto-increments, etc.). */
3201 {
3205 else
3206 /* Otherwise, show that cc0 won't be used. */
3209 }
3210 }
3211 #endif
3214 {
3215 rtx our_prev;
3220 /* Verify that the REG_NOTE is legitimate. */
3227 {
3228 /* If we reach a SEQUENCE, it is too complex to try to
3229 do anything with it, so give up. */
3235 /* reorg creates USEs that look like this. We leave them
3236 alone because reorg needs them for its own purposes. */
3240 {
3245 {
3246 /* If we find a SET of something else, we can't
3247 delete the insn. */
3252 {
3258 }
3262 }
3268 }
3270 /* If OUR_PREV references the register that dies here, it is an
3271 additional use. Hence any prior SET isn't dead. However, this
3272 insn becomes the new place for the REG_DEAD note. */
3275 {
3279 }
3280 }
3281 }
3284 }
3285 \f
3286 /* Delete insn INSN from the chain of insns and update label ref counts.
3287 May delete some following insns as a consequence; may even delete
3288 a label elsewhere and insns that follow it.
3290 Returns the first insn after INSN that was not deleted. */
3292 rtx
3295 {
3304 /* This insn is already deleted => return first following nondeleted. */
3308 /* Don't delete user-declared labels. Convert them to special NOTEs
3309 instead. */
3312 {
3317 }
3318 else
3319 /* Mark this insn as deleted. */
3322 /* If this is an unconditional jump, delete it from the jump chain. */
3326 /* If instruction is followed by a barrier,
3327 delete the barrier too. */
3330 {
3333 }
3335 /* Patch out INSN (and the barrier if any) */
3338 {
3340 {
3345 }
3348 {
3352 }
3356 }
3358 /* If deleting a jump, decrement the count of the label,
3359 and delete the label if it is now unused. */
3363 {
3364 /* This can delete NEXT or PREV,
3365 either directly if NEXT is JUMP_LABEL (INSN),
3366 or indirectly through more levels of jumps. */
3368 /* I feel a little doubtful about this loop,
3369 but I see no clean and sure alternative way
3370 to find the first insn after INSN that is not now deleted.
3371 I hope this works. */
3375 }
3377 /* Likewise if we're deleting a dispatch table. */
3382 {
3393 }
3398 /* If INSN was a label and a dispatch table follows it,
3399 delete the dispatch table. The tablejump must have gone already.
3400 It isn't useful to fall through into a table. */
3409 /* If INSN was a label, delete insns following it if now unreachable. */
3412 {
3418 {
3422 /* Keep going past other deleted labels to delete what follows. */
3425 else
3426 /* Note: if this deletes a jump, it can cause more
3427 deletion of unreachable code, after a different label.
3428 As long as the value from this recursive call is correct,
3429 this invocation functions correctly. */
3431 }
3432 }
3435 }
3437 /* Advance from INSN till reaching something not deleted
3438 then return that. May return INSN itself. */
3440 rtx
3442 rtx insn;
3443 {
3447 }
3448 \f
3449 /* Delete a range of insns from FROM to TO, inclusive.
3450 This is for the sake of peephole optimization, so assume
3451 that whatever these insns do will still be done by a new
3452 peephole insn that will replace them. */
3454 void
3457 {
3461 {
3466 {
3469 /* Patch this insn out of the chain. */
3470 /* We don't do this all at once, because we
3471 must preserve all NOTEs. */
3477 }
3482 }
3484 /* Note that if TO is an unconditional jump
3485 we *do not* delete the BARRIER that follows,
3486 since the peephole that replaces this sequence
3487 is also an unconditional jump in that case. */
3488 }
3489 \f
3490 /* Invert the condition of the jump JUMP, and make it jump
3491 to label NLABEL instead of where it jumps now. */
3493 int
3496 {
3497 /* We have to either invert the condition and change the label or
3498 do neither. Either operation could fail. We first try to invert
3499 the jump. If that succeeds, we try changing the label. If that fails,
3500 we invert the jump back to what it was. */
3509 /* This should just be putting it back the way it was. */
3513 }
3515 /* Invert the jump condition of rtx X contained in jump insn, INSN.
3517 Return 1 if we can do so, 0 if we cannot find a way to do so that
3518 matches a pattern. */
3520 int
3522 rtx x;
3523 rtx insn;
3524 {
3532 {
3536 /* We can do this in two ways: The preferable way, which can only
3537 be done if this is not an integer comparison, is to reverse
3538 the comparison code. Otherwise, swap the THEN-part and ELSE-part
3539 of the IF_THEN_ELSE. If we can't do either, fail. */
3552 }
3556 {
3561 {
3566 }
3567 }
3570 }
3571 \f
3572 /* Make jump JUMP jump to label NLABEL instead of where it jumps now.
3573 If the old jump target label is unused as a result,
3574 it and the code following it may be deleted.
3576 If NLABEL is zero, we are to turn the jump into a (possibly conditional)
3577 RETURN insn.
3579 The return value will be 1 if the change was made, 0 if it wasn't (this
3580 can only occur for NLABEL == 0). */
3582 int
3585 {
3594 /* If this is an unconditional branch, delete it from the jump_chain of
3595 OLABEL and add it to the jump_chain of NLABEL (assuming both labels
3596 have UID's in range and JUMP_CHAIN is valid). */
3599 {
3605 {
3608 }
3609 }
3619 }
3621 /* Delete the instruction JUMP from any jump chain it might be on. */
3623 static void
3625 rtx jump;
3626 {
3630 /* Handle unconditional jumps. */
3635 /* Handle return insns. */
3642 else
3643 {
3644 rtx insn;
3650 {
3653 }
3654 }
3655 }
3657 /* If NLABEL is nonzero, throughout the rtx at LOC,
3658 alter (LABEL_REF OLABEL) to (LABEL_REF NLABEL). If OLABEL is
3659 zero, alter (RETURN) to (LABEL_REF NLABEL).
3661 If NLABEL is zero, alter (LABEL_REF OLABEL) to (RETURN) and check
3662 validity with validate_change. Convert (set (pc) (label_ref olabel))
3663 to (return).
3665 Return 0 if we found a change we would like to make but it is invalid.
3666 Otherwise, return 1. */
3668 int
3672 rtx insn;
3673 {
3680 {
3682 {
3685 else
3688 }
3689 }
3691 {
3696 }
3705 {
3710 {
3715 }
3716 }
3719 }
3720 \f
3721 /* Make jump JUMP jump to label NLABEL, assuming it used to be a tablejump.
3723 If the old jump target label (before the dispatch table) becomes unused,
3724 it and the dispatch table may be deleted. In that case, find the insn
3725 before the jump references that label and delete it and logical successors
3726 too. */
3728 static void
3731 {
3734 /* Add this jump to the jump_chain of NLABEL. */
3737 {
3740 }
3748 {
3751 }
3752 }
3754 /* Find the insn referencing LABEL that is a logical predecessor of INSN.
3755 If we found one, delete it and then delete this insn if DELETE_THIS is
3756 non-zero. Return non-zero if INSN or a predecessor references LABEL. */
3758 static int
3762 {
3764 rtx link;
3768 {
3770 {
3773 }
3774 else
3776 }
3780 {
3782 {
3785 }
3786 else
3788 }
3791 }
3792 \f
3793 /* Like rtx_equal_p except that it considers two REGs as equal
3794 if they renumber to the same value and considers two commutative
3795 operations to be the same if the order of the operands has been
3796 reversed. */
3798 int
3801 {
3812 {
3819 /* If we haven't done any renumbering, don't
3820 make any assumptions. */
3825 {
3830 {
3833 }
3834 }
3836 else
3837 {
3841 }
3844 {
3849 {
3852 }
3853 }
3855 else
3856 {
3860 }
3863 }
3865 /* Now we have disposed of all the cases
3866 in which different rtx codes can match. */
3871 {
3882 /* We can't assume nonlocal labels have their following insns yet. */
3886 /* Two label-refs are equivalent if they point at labels
3887 in the same position in the instruction stream. */
3893 }
3895 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent. */
3900 /* For commutative operations, the RTX match if the operand match in any
3901 order. Also handle the simple binary and unary cases without a loop. */
3913 /* Compare the elements. If any pair of corresponding elements
3914 fail to match, return 0 for the whole things. */
3918 {
3921 {
3945 /* fall through. */
3959 }
3960 }
3962 }
3963 \f
3964 /* If X is a hard register or equivalent to one or a subregister of one,
3965 return the hard register number. If X is a pseudo register that was not
3966 assigned a hard register, return the pseudo register number. Otherwise,
3967 return -1. Any rtx is valid for X. */
3969 int
3971 rtx x;
3972 {
3974 {
3978 }
3980 {
3984 }
3986 }
3987 \f
3988 /* Optimize code of the form:
3990 for (x = a[i]; x; ...)
3991 ...
3992 for (x = a[i]; x; ...)
3993 ...
3994 foo:
3996 Loop optimize will change the above code into
3998 if (x = a[i])
3999 for (;;)
4000 { ...; if (! (x = ...)) break; }
4001 if (x = a[i])
4002 for (;;)
4003 { ...; if (! (x = ...)) break; }
4004 foo:
4006 In general, if the first test fails, the program can branch
4007 directly to `foo' and skip the second try which is doomed to fail.
4008 We run this after loop optimization and before flow analysis. */
4010 /* When comparing the insn patterns, we track the fact that different
4011 pseudo-register numbers may have been used in each computation.
4012 The following array stores an equivalence -- same_regs[I] == J means
4013 that pseudo register I was used in the first set of tests in a context
4014 where J was used in the second set. We also count the number of such
4015 pending equivalences. If nonzero, the expressions really aren't the
4016 same. */
4022 /* Track any registers modified between the target of the first jump and
4023 the second jump. They never compare equal. */
4027 /* Record if memory was modified. */
4031 /* Called via note_stores on each insn between the target of the first
4032 branch and the second branch. It marks any changed registers. */
4034 static void
4036 rtx dest;
4037 rtx x;
4038 {
4053 else
4056 }
4058 /* F is the first insn in the chain of insns. */
4060 void
4062 rtx f;
4065 {
4066 /* Basic algorithm is to find a conditional branch,
4067 the label it may branch to, and the branch after
4068 that label. If the two branches test the same condition,
4069 walk back from both branch paths until the insn patterns
4070 differ, or code labels are hit. If we make it back to
4071 the target of the first branch, then we know that the first branch
4072 will either always succeed or always fail depending on the relative
4073 senses of the two branches. So adjust the first branch accordingly
4074 in this case. */
4083 /* Allocate register tables and quick-reset table. */
4091 {
4095 {
4096 /* Get to a candidate branch insn. */
4111 /* Look for a branch after the target. Record any registers and
4112 memory modified between the target and the branch. Stop when we
4113 get to a label since we can't know what was changed there. */
4115 {
4120 {
4121 /* If this is an unconditional jump and is the only use of
4122 its target label, we can follow it. */
4126 {
4129 }
4130 else
4132 }
4138 {
4147 }
4150 }
4152 /* Check the next candidate branch insn from the label
4153 of the first. */
4161 /* Get the comparison codes and operands, reversing the
4162 codes if appropriate. If we don't have comparison codes,
4163 we can't do anything. */
4176 /* If they test the same things and knowing that B1 branches
4177 tells us whether or not B2 branches, check if we
4178 can thread the branch. */
4183 {
4188 {
4190 {
4191 /* We have reached the target of the first branch.
4192 If there are no pending register equivalents,
4193 we know that this branch will either always
4194 succeed (if the senses of the two branches are
4195 the same) or always fail (if not). */
4196 rtx new_label;
4203 else
4207 {
4212 {
4213 /* Don't thread to the loop label. If a loop
4214 label is reused, loop optimization will
4215 be disabled for that loop. */
4218 }
4220 }
4222 }
4224 /* If either of these is not a normal insn (it might be
4225 a JUMP_INSN, CALL_INSN, or CODE_LABEL) we fail. (NOTEs
4226 have already been skipped above.) Similarly, fail
4227 if the insns are different. */
4236 }
4237 }
4238 }
4239 }
4240 }
4241 \f
4242 /* This is like RTX_EQUAL_P except that it knows about our handling of
4243 possibly equivalent registers and knows to consider volatile and
4244 modified objects as not equal.
4246 YINSN is the insn containing Y. */
4248 int
4251 rtx yinsn;
4252 {
4259 /* Rtx's of different codes cannot be equal. */
4263 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.
4264 (REG:SI x) and (REG:HI x) are NOT equivalent. */
4269 /* For commutative operations, the RTX match if the operand match in any
4270 order. Also handle the simple binary and unary cases without a loop. */
4282 /* Handle special-cases first. */
4284 {
4289 /* If neither is user variable or hard register, check for possible
4290 equivalence. */
4297 {
4299 num_same_regs++;
4301 /* If this is the first time we are seeing a register on the `Y'
4302 side, see if it is the last use. If not, we can't thread the
4303 jump, so mark it as not equivalent. */
4308 }
4309 else
4315 /* If memory modified or either volatile, not equivalent.
4316 Else, check address. */
4329 /* Cancel a pending `same_regs' if setting equivalenced registers.
4330 Then process source. */
4333 {
4335 {
4337 num_same_regs--;
4338 }
4341 }
4342 else
4353 }
4360 {
4362 {
4376 /* Two vectors must have the same length. */
4380 /* And the corresponding elements must match. */
4399 /* These are just backpointers, so they don't matter. */
4405 /* It is believed that rtx's at this level will never
4406 contain anything but integers and other rtx's,
4407 except for within LABEL_REFs and SYMBOL_REFs. */
4410 }
4411 }
4413 }