| blob | 2f9621f47f52b6fce8c65147131a5352d9254535 |
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 }
520 in the big-endian case. */
521 /* Also delete insns to store bit fields if they are no-ops. */
530 }
532 }
534 /* If we haven't yet gotten to reload and we have just run regscan,
535 delete any insn that sets a register that isn't used elsewhere.
536 This helps some of the optimizations below by having less insns
537 being jumped around. */
541 {
549 /* We use regno_last_note_uid so as not to delete the setting
550 of a reg that's used in notes. A subsequent optimization
551 might arrange to use that reg for real. */
556 }
558 /* Now iterate optimizing jumps until nothing changes over one pass. */
561 {
565 {
566 rtx reallabelprev;
568 rtx nlabel;
571 #if 0
572 /* If NOT the first iteration, if this is the last jump pass
573 (just before final), do the special peephole optimizations.
574 Avoiding the first iteration gives ordinary jump opts
575 a chance to work before peephole opts. */
580 #endif
582 /* That could have deleted some insns after INSN, so check now
583 what the following insn is. */
587 /* See if this is a NOTE_INSN_LOOP_BEG followed by an unconditional
588 jump. Try to optimize by duplicating the loop exit test if so.
589 This is only safe immediately after regscan, because it uses
590 the values of regno_first_uid and regno_last_uid. */
595 {
598 {
602 }
603 }
612 /* Tension the labels in dispatch tables. */
619 /* If a dispatch table always goes to the same place,
620 get rid of it and replace the insn that uses it. */
624 {
639 /* Don't mess with a casesi insn. */
644 {
648 }
649 }
653 /* If a jump references the end of the function, try to turn
654 it into a RETURN insn, possibly a conditional one. */
661 /* Detect jump to following insn. */
663 {
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
1251 /* INSN must either branch to the insn after TEMP or the insn
1252 after TEMP must branch to the same place as INSN. */
1258 /* We must be comparing objects whose modes imply the size.
1259 We could handle BLKmode if (1) emit_store_flag could
1260 and (2) we could find the size reliably. */
1263 {
1269 /* It must be the case that TEMP2 is not modified in the range
1270 [TEMP4, INSN). The one exception we make is if the insn
1271 before INSN sets TEMP2 to something which is also unchanged
1272 in that range. In that case, we can move the initialization
1273 into our sequence. */
1282 {
1286 }
1292 VOIDmode,
1296 /* If we can do the store-flag, do the addition or
1297 subtraction. */
1306 {
1307 /* Put the result back in temp2 in case it isn't already.
1308 Then replace the jump, possible a CC0-setting insn in
1309 front of the jump, and TEMP, with the sequence we have
1310 made. */
1325 #ifdef HAVE_cc0
1327 #endif
1331 }
1332 else
1334 }
1336 /* Simplify if (...) x = 1; else {...} if (x) ...
1337 We recognize this case scanning backwards as well.
1339 TEMP is the assignment to x;
1340 TEMP1 is the label at the head of the second if. */
1341 /* ?? This should call get_condition to find the values being
1342 compared, instead of looking for a COMPARE insn when HAVE_cc0
1343 is not defined. This would allow it to work on the m88k. */
1344 /* ?? This optimization is only safe before cse is run if HAVE_cc0
1345 is not defined and the condition is tested by a separate compare
1346 insn. This is because the code below assumes that the result
1347 of the compare dies in the following branch.
1349 Not only that, but there might be other insns between the
1350 compare and branch whose results are live. Those insns need
1351 to be executed.
1353 A way to fix this is to move the insns at JUMP_LABEL (insn)
1354 to before INSN. If we are running before flow, they will
1355 be deleted if they aren't needed. But this doesn't work
1356 well after flow.
1358 This is really a special-case of jump threading, anyway. The
1359 right thing to do is to replace this and jump threading with
1360 much simpler code in cse.
1362 This code has been turned off in the non-cc0 case in the
1363 meantime. */
1365 #ifdef HAVE_cc0
1367 /* Safe to skip USE and CLOBBER insns here
1368 since they will not be deleted. */
1376 /* If we find that the next value tested is `x'
1377 (TEMP1 is the insn where this happens), win. */
1380 #ifdef HAVE_cc0
1381 /* Does temp1 `tst' the value of x? */
1385 #else
1386 /* Does temp1 compare the value of x against zero? */
1393 #endif
1395 {
1396 /* Get the if_then_else from the condjump. */
1399 {
1402 rtx cond
1405 rtx ultimate;
1411 else
1421 }
1422 }
1423 #endif
1425 #if 0
1426 /* @@ This needs a bit of work before it will be right.
1428 Any type of comparison can be accepted for the first and
1429 second compare. When rewriting the first jump, we must
1430 compute the what conditions can reach label3, and use the
1431 appropriate code. We can not simply reverse/swap the code
1432 of the first jump. In some cases, the second jump must be
1433 rewritten also.
1435 For example,
1436 < == converts to > ==
1437 < != converts to == >
1438 etc.
1440 If the code is written to only accept an '==' test for the second
1441 compare, then all that needs to be done is to swap the condition
1442 of the first branch.
1444 It is questionable whether we want this optimization anyways,
1445 since if the user wrote code like this because he/she knew that
1446 the jump to label1 is taken most of the time, then rewriting
1447 this gives slower code. */
1448 /* @@ This should call get_condition to find the values being
1449 compared, instead of looking for a COMPARE insn when HAVE_cc0
1450 is not defined. This would allow it to work on the m88k. */
1451 /* @@ This optimization is only safe before cse is run if HAVE_cc0
1452 is not defined and the condition is tested by a separate compare
1453 insn. This is because the code below assumes that the result
1454 of the compare dies in the following branch. */
1456 /* Simplify test a ~= b
1457 condjump label1;
1458 test a == b
1459 condjump label2;
1460 jump label3;
1461 label1:
1463 rewriting as
1464 test a ~~= b
1465 condjump label3
1466 test a == b
1467 condjump label2
1468 label1:
1470 where ~= is an inequality, e.g. >, and ~~= is the swapped
1471 inequality, e.g. <.
1473 We recognize this case scanning backwards.
1475 TEMP is the conditional jump to `label2';
1476 TEMP1 is the test for `a == b';
1477 TEMP2 is the conditional jump to `label1';
1478 TEMP3 is the test for `a ~= b'. */
1487 #ifdef HAVE_cc0
1489 #else
1493 #endif
1507 {
1512 {
1515 }
1519 }
1520 #endif
1521 /* Simplify if (...) {... x = 1;} if (x) ...
1523 We recognize this case backwards.
1525 TEMP is the test of `x';
1526 TEMP1 is the assignment to `x' at the end of the
1527 previous statement. */
1528 /* @@ This should call get_condition to find the values being
1529 compared, instead of looking for a COMPARE insn when HAVE_cc0
1530 is not defined. This would allow it to work on the m88k. */
1531 /* @@ This optimization is only safe before cse is run if HAVE_cc0
1532 is not defined and the condition is tested by a separate compare
1533 insn. This is because the code below assumes that the result
1534 of the compare dies in the following branch. */
1536 /* ??? This has to be turned off. The problem is that the
1537 unconditional jump might indirectly end up branching to the
1538 label between TEMP1 and TEMP. We can't detect this, in general,
1539 since it may become a jump to there after further optimizations.
1540 If that jump is done, it will be deleted, so we will retry
1541 this optimization in the next pass, thus an infinite loop.
1543 The present code prevents this by putting the jump after the
1544 label, but this is not logically correct. */
1545 #if 0
1547 /* Safe to skip USE and CLOBBER insns here
1548 since they will not be deleted. */
1553 #ifdef HAVE_cc0
1556 #else
1557 /* Temp must be a compare insn, we can not accept a register
1558 to register move here, since it may not be simply a
1559 tst insn. */
1565 #endif
1566 /* May skip USE or CLOBBER insns here
1567 for checking for opportunity, since we
1568 take care of them later. */
1572 #ifdef HAVE_cc0
1574 #else
1577 #endif
1579 /* If this isn't true, cse will do the job. */
1581 {
1582 /* Get the if_then_else from the condjump. */
1587 {
1589 rtx last_insn;
1590 rtx ultimate;
1591 rtx p;
1593 /* Get the place that condjump will jump to
1594 if it is reached from here. */
1598 else
1600 /* Get it as a CODE_LABEL. */
1603 else
1604 /* Get the label out of the LABEL_REF. */
1607 /* Insert the jump immediately before TEMP, specifically
1608 after the label that is between TEMP1 and TEMP. */
1611 /* If we would be branching to the next insn, the jump
1612 would immediately be deleted and the re-inserted in
1613 a subsequent pass over the code. So don't do anything
1614 in that case. */
1617 {
1620 last_insn);
1625 {
1629 }
1632 }
1633 }
1634 }
1635 #endif
1636 /* Detect a conditional jump going to the same place
1637 as an immediately following unconditional jump. */
1643 {
1647 }
1648 /* Detect a conditional jump jumping over an unconditional jump. */
1651 && ! this_is_simplejump
1657 {
1658 /* When we invert the unconditional jump, we will be
1659 decrementing the usage count of its old label.
1660 Make sure that we don't delete it now because that
1661 might cause the following code to be deleted. */
1669 {
1670 /* It is very likely that if there are USE insns before
1671 this jump, they hold REG_DEAD notes. These REG_DEAD
1672 notes are no longer valid due to this optimization,
1673 and will cause the life-analysis that following passes
1674 (notably delayed-branch scheduling) to think that
1675 these registers are dead when they are not.
1677 To prevent this trouble, we just remove the USE insns
1678 from the insn chain. */
1682 {
1686 }
1691 }
1693 /* We can now safely delete the label if it is unreferenced
1694 since the delete_insn above has deleted the BARRIER. */
1698 }
1699 else
1700 {
1701 /* Detect a jump to a jump. */
1706 {
1709 }
1711 /* Look for if (foo) bar; else break; */
1712 /* The insns look like this:
1713 insn = condjump label1;
1714 ...range1 (some insns)...
1715 jump label2;
1716 label1:
1717 ...range2 (some insns)...
1718 jump somewhere unconditionally
1719 label2: */
1720 {
1723 /* Don't do this optimization on the first round, so that
1724 jump-around-a-jump gets simplified before we ask here
1725 whether a jump is unconditional.
1727 Also don't do it when we are called after reload since
1728 it will confuse reorg. */
1731 /* Make sure INSN is something we can invert. */
1738 {
1745 /* Invert the jump condition, so we
1746 still execute the same insns in each case. */
1748 {
1753 rtx rangenext;
1755 /* Include in each range any notes before it, to be
1756 sure that we get the line number note if any, even
1757 if there are other notes here. */
1766 /* Don't move NOTEs for blocks or loops; shift them
1767 outside the ranges, where they'll stay put. */
1771 /* Get current surrounds of the 2 ranges. */
1777 /* Splice range2 where range1 was. */
1782 /* Splice range1 where range2 was. */
1788 /* Check for a loop end note between the end of
1789 range2, and the next code label. If there is one,
1790 then what we have really seen is
1791 if (foo) break; end_of_loop;
1792 and moved the break sequence outside the loop.
1793 We must move the LOOP_END note to where the
1794 loop really ends now, or we will confuse loop
1795 optimization. */
1797 {
1802 {
1813 }
1814 }
1817 }
1818 }
1819 }
1821 /* Now that the jump has been tensioned,
1822 try cross jumping: check for identical code
1823 before the jump and before its target label. */
1825 /* First, cross jumping of conditional jumps: */
1828 {
1832 /* A conditional jump may be crossjumped
1833 only if the place it jumps to follows
1834 an opposing jump that comes back here. */
1837 /* We have no opposing jump;
1838 cannot cross jump this insn. */
1842 /* TARGET is nonzero if it is ok to cross jump
1843 to code before TARGET. If so, see if matches. */
1849 {
1851 /* Make the old conditional jump
1852 into an unconditional one. */
1857 /* Add to jump_chain unless this is a new label
1858 whose UID is too large. */
1860 {
1864 }
1867 }
1868 }
1870 /* Cross jumping of unconditional jumps:
1871 a few differences. */
1874 {
1876 rtx target;
1880 /* TARGET is nonzero if it is ok to cross jump
1881 to code before TARGET. If so, see if matches. */
1885 /* If cannot cross jump to code before the label,
1886 see if we can cross jump to another jump to
1887 the same label. */
1888 /* Try each other jump to this label. */
1895 /* Ignore TARGET if it's deleted. */
1901 {
1905 }
1906 }
1908 /* This code was dead in the previous jump.c! */
1910 {
1911 /* Return insns all "jump to the same place"
1912 so we can cross-jump between any two of them. */
1918 /* If cannot cross jump to code before the label,
1919 see if we can cross jump to another jump to
1920 the same label. */
1921 /* Try each other jump to this label. */
1932 {
1936 }
1937 }
1938 }
1939 }
1942 }
1944 /* Delete extraneous line number notes.
1945 Note that two consecutive notes for different lines are not really
1946 extraneous. There should be some indication where that line belonged,
1947 even if it became empty. */
1949 {
1954 {
1955 /* Delete this note if it is identical to previous note. */
1959 {
1962 }
1965 }
1966 }
1968 #ifdef HAVE_return
1970 {
1971 /* If we fall through to the epilogue, see if we can insert a RETURN insn
1972 in front of it. If the machine allows it at this point (we might be
1973 after reload for a leaf routine), it will improve optimization for it
1974 to be there. We do this both here and at the start of this pass since
1975 the RETURN might have been deleted by some of our optimizations. */
1981 {
1984 }
1985 }
1986 #endif
1988 /* See if there is still a NOTE_INSN_FUNCTION_END in this function.
1989 If so, delete it, and record that this function can drop off the end. */
1992 {
1995 /* One label can follow the end-note: the return label. */
1997 /* Ordinary insns can follow it if returning a structure. */
1999 /* If machine uses explicit RETURN insns, no epilogue,
2000 then one of them follows the note. */
2003 /* Other kinds of notes can follow also. */
2007 }
2009 /* Report if control can fall through at the end of the function. */
2012 {
2015 }
2017 /* Show JUMP_CHAIN no longer valid. */
2019 }
2020 \f
2021 /* LOOP_START is a NOTE_INSN_LOOP_BEG note that is followed by an unconditional
2022 jump. Assume that this unconditional jump is to the exit test code. If
2023 the code is sufficiently simple, make a copy of it before INSN,
2024 followed by a jump to the exit of the loop. Then delete the unconditional
2025 jump after INSN.
2027 Note that it is possible we can get confused here if the jump immediately
2028 after the loop start branches outside the loop but within an outer loop.
2029 If we are near the exit of that loop, we will copy its exit test. This
2030 will not generate incorrect code, but could suppress some optimizations.
2031 However, such cases are degenerate loops anyway.
2033 Return 1 if we made the change, else 0.
2035 This is only safe immediately after a regscan pass because it uses the
2036 values of regno_first_uid and regno_last_uid. */
2038 static int
2040 rtx loop_start;
2041 {
2046 rtx lastexit;
2050 /* Scan the exit code. We do not perform this optimization if any insn:
2052 is a CALL_INSN
2053 is a CODE_LABEL
2054 has a REG_RETVAL or REG_LIBCALL note (hard to adjust)
2055 is a NOTE_INSN_LOOP_BEG because this means we have a nested loop
2056 is a NOTE_INSN_BLOCK_{BEG,END} because duplicating these notes
2057 are not valid
2059 Also, don't do this if the exit code is more than 20 insns. */
2062 insn
2066 {
2068 {
2085 }
2086 }
2088 /* Unless INSN is zero, we can do the optimization. */
2094 /* See if any insn sets a register only used in the loop exit code and
2095 not a user variable. If so, replace it with a new register. */
2102 {
2108 {
2109 /* We can do the replacement. Allocate reg_map if this is the
2110 first replacement we found. */
2112 {
2115 }
2121 }
2122 }
2124 /* Now copy each insn. */
2127 {
2132 /* Only copy line-number notes. */
2134 {
2137 }
2147 /* Copy all REG_NOTES except REG_LABEL since mark_jump_label will
2148 make them. */
2164 {
2168 }
2170 /* If this is a simple jump, add it to the jump chain. */
2174 {
2178 }
2183 }
2185 /* Now clean up by emitting a jump to the end label and deleting the jump
2186 at the start of the loop. */
2188 {
2190 loop_start);
2194 {
2198 }
2200 }
2204 /* Mark the exit code as the virtual top of the converted loop. */
2208 }
2209 \f
2210 /* Move all block-beg, block-end, loop-beg, loop-cont, loop-vtop, and
2211 loop-end notes between START and END out before START. Assume that
2212 END is not such a note. START may be such a note. Returns the value
2213 of the new starting insn, which may be different if the original start
2214 was such a note. */
2216 rtx
2219 {
2220 rtx insn;
2221 rtx next;
2224 {
2233 {
2236 else
2237 {
2245 }
2246 }
2247 }
2250 }
2251 \f
2252 /* Compare the instructions before insn E1 with those before E2
2253 to find an opportunity for cross jumping.
2254 (This means detecting identical sequences of insns followed by
2255 jumps to the same place, or followed by a label and a jump
2256 to that label, and replacing one with a jump to the other.)
2258 Assume E1 is a jump that jumps to label E2
2259 (that is not always true but it might as well be).
2260 Find the longest possible equivalent sequences
2261 and store the first insns of those sequences into *F1 and *F2.
2262 Store zero there if no equivalent preceding instructions are found.
2264 We give up if we find a label in stream 1.
2265 Actually we could transfer that label into stream 2. */
2267 static void
2272 {
2279 rtx prev1;
2285 {
2295 /* Don't allow the range of insns preceding E1 or E2
2296 to include the other (E2 or E1). */
2300 /* If we will get to this code by jumping, those jumps will be
2301 tensioned to go directly to the new label (before I2),
2302 so this cross-jumping won't cost extra. So reduce the minimum. */
2304 {
2307 }
2315 /* If this is a CALL_INSN, compare register usage information.
2316 If we don't check this on stack register machines, the two
2317 CALL_INSNs might be merged leaving reg-stack.c with mismatching
2318 numbers of stack registers in the same basic block.
2319 If we don't check this on machines with delay slots, a delay slot may
2320 be filled that clobbers a parameter expected by the subroutine.
2322 ??? We take the simple route for now and assume that if they're
2323 equal, they were constructed identically. */
2330 #ifdef STACK_REGS
2331 /* If cross_jump_death_matters is not 0, the insn's mode
2332 indicates whether or not the insn contains any stack-like
2333 regs. */
2336 {
2337 /* If register stack conversion has already been done, then
2338 death notes must also be compared before it is certain that
2339 the two instruction streams match. */
2341 rtx note;
2361 done:
2362 ;
2363 }
2364 #endif
2368 {
2369 /* The following code helps take care of G++ cleanups. */
2370 rtx equiv1;
2371 rtx equiv2;
2378 /* If the equivalences are not to a constant, they may
2379 reference pseudos that no longer exist, so we can't
2380 use them. */
2383 {
2388 {
2395 }
2396 }
2398 /* Insns fail to match; cross jumping is limited to the following
2399 insns. */
2401 #ifdef HAVE_cc0
2402 /* Don't allow the insn after a compare to be shared by
2403 cross-jumping unless the compare is also shared.
2404 Here, if either of these non-matching insns is a compare,
2405 exclude the following insn from possible cross-jumping. */
2408 #endif
2410 /* If cross-jumping here will feed a jump-around-jump
2411 optimization, this jump won't cost extra, so reduce
2412 the minimum. */
2418 }
2420 win:
2422 {
2423 /* Ok, this insn is potentially includable in a cross-jump here. */
2426 }
2427 }
2431 }
2433 static void
2436 {
2437 /* Find an existing label at this point
2438 or make a new one if there is none. */
2441 /* Make the same jump insn jump to the new point. */
2443 {
2444 /* Remove from jump chain of returns. */
2446 /* Change the insn. */
2451 /* Add to new the jump chain. */
2454 {
2457 }
2458 }
2459 else
2462 /* Delete the matching insns before the jump. Also, remove any REG_EQUAL
2463 or REG_EQUIV note in the NEWLPOS stream that isn't also present in
2464 the NEWJPOS stream. */
2467 {
2468 rtx lnote;
2480 }
2481 }
2482 \f
2483 /* Return the label before INSN, or put a new label there. */
2485 rtx
2487 rtx insn;
2488 {
2489 rtx label;
2491 /* Find an existing label at this point
2492 or make a new one if there is none. */
2496 {
2502 }
2504 }
2506 /* Return the label after INSN, or put a new label there. */
2508 rtx
2510 rtx insn;
2511 {
2512 rtx label;
2514 /* Find an existing label at this point
2515 or make a new one if there is none. */
2519 {
2523 }
2525 }
2526 \f
2527 /* Return 1 if INSN is a jump that jumps to right after TARGET
2528 only on the condition that TARGET itself would drop through.
2529 Assumes that TARGET is a conditional jump. */
2531 static int
2534 {
2550 {
2554 }
2557 {
2561 }
2566 }
2567 \f
2568 /* Given a comparison, COMPARISON, inside a conditional jump insn, INSN,
2569 return non-zero if it is safe to reverse this comparison. It is if our
2570 floating-point is not IEEE, if this is an NE or EQ comparison, or if
2571 this is known to be an integer comparison. */
2573 int
2575 rtx comparison;
2576 rtx insn;
2577 {
2578 rtx arg0;
2580 /* If this is not actually a comparison, we can't reverse it. */
2585 /* If this is an NE comparison, it is safe to reverse it to an EQ
2586 comparison and vice versa, even for floating point. If no operands
2587 are NaNs, the reversal is valid. If some operand is a NaN, EQ is
2588 always false and NE is always true, so the reversal is also valid. */
2589 || flag_fast_math
2596 /* Make sure ARG0 is one of the actual objects being compared. If we
2597 can't do this, we can't be sure the comparison can be reversed.
2599 Handle cc0 and a MODE_CC register. */
2601 #ifdef HAVE_cc0
2603 #endif
2604 )
2605 {
2616 }
2618 /* We can reverse this if ARG0 is a CONST_INT or if its mode is
2619 not VOIDmode and neither a MODE_CC nor MODE_FLOAT type. */
2624 }
2626 /* Given an rtx-code for a comparison, return the code
2627 for the negated comparison.
2628 WATCH OUT! reverse_condition is not safe to use on a jump
2629 that might be acting on the results of an IEEE floating point comparison,
2630 because of the special treatment of non-signaling nans in comparisons.
2631 Use can_reverse_comparison_p to be sure. */
2633 enum rtx_code
2636 {
2638 {
2672 }
2673 }
2675 /* Similar, but return the code when two operands of a comparison are swapped.
2676 This IS safe for IEEE floating-point. */
2678 enum rtx_code
2681 {
2683 {
2715 }
2716 }
2718 /* Given a comparison CODE, return the corresponding unsigned comparison.
2719 If CODE is an equality comparison or already an unsigned comparison,
2720 CODE is returned. */
2722 enum rtx_code
2725 {
2727 {
2750 }
2751 }
2753 /* Similarly, return the signed version of a comparison. */
2755 enum rtx_code
2758 {
2760 {
2783 }
2784 }
2785 \f
2786 /* Return non-zero if CODE1 is more strict than CODE2, i.e., if the
2787 truth of CODE1 implies the truth of CODE2. */
2789 int
2792 {
2797 {
2822 }
2825 }
2826 \f
2827 /* Return 1 if INSN is an unconditional jump and nothing else. */
2829 int
2831 rtx insn;
2832 {
2837 }
2839 /* Return nonzero if INSN is a (possibly) conditional jump
2840 and nothing more. */
2842 int
2844 rtx insn;
2845 {
2864 }
2866 /* Return nonzero if INSN is a (possibly) conditional jump
2867 and nothing more. */
2869 int
2871 rtx insn;
2872 {
2877 else
2897 }
2899 /* Return 1 if X is an RTX that does nothing but set the condition codes
2900 and CLOBBER or USE registers.
2901 Return -1 if X does explicitly set the condition codes,
2902 but also does other things. */
2904 int
2906 rtx x;
2907 {
2908 #ifdef HAVE_cc0
2912 {
2917 {
2923 }
2925 }
2927 #else
2929 #endif
2930 }
2931 \f
2932 /* Follow any unconditional jump at LABEL;
2933 return the ultimate label reached by any such chain of jumps.
2934 If LABEL is not followed by a jump, return LABEL.
2935 If the chain loops or we can't find end, return LABEL,
2936 since that tells caller to avoid changing the insn.
2938 If RELOAD_COMPLETED is 0, we do not chain across a NOTE_INSN_LOOP_BEG or
2939 a USE or CLOBBER. */
2941 rtx
2943 rtx label;
2944 {
2957 depth++)
2958 {
2959 /* Don't chain through the insn that jumps into a loop
2960 from outside the loop,
2961 since that would create multiple loop entry jumps
2962 and prevent loop optimization. */
2963 rtx tem;
2970 /* If we have found a cycle, make the insn jump to itself. */
2980 }
2984 }
2986 /* Assuming that field IDX of X is a vector of label_refs,
2987 replace each of them by the ultimate label reached by it.
2988 Return nonzero if a change is made.
2989 If IGNORE_LOOPS is 0, we do not chain across a NOTE_INSN_LOOP_BEG. */
2991 static int
2995 {
2999 {
3003 {
3009 }
3010 }
3012 }
3013 \f
3014 /* Find all CODE_LABELs referred to in X, and increment their use counts.
3015 If INSN is a JUMP_INSN and there is at least one CODE_LABEL referenced
3016 in INSN, then store one of them in JUMP_LABEL (INSN).
3017 If INSN is an INSN or a CALL_INSN and there is at least one CODE_LABEL
3018 referenced in INSN, add a REG_LABEL note containing that label to INSN.
3019 Also, when there are consecutive labels, canonicalize on the last of them.
3021 Note that two labels separated by a loop-beginning note
3022 must be kept distinct if we have not yet done loop-optimization,
3023 because the gap between them is where loop-optimize
3024 will want to move invariant code to. CROSS_JUMP tells us
3025 that loop-optimization is done with.
3027 Once reload has completed (CROSS_JUMP non-zero), we need not consider
3028 two labels distinct if they are separated by only USE or CLOBBER insns. */
3030 static void
3033 rtx insn;
3035 {
3041 {
3054 /* If this is a constant-pool reference, see if it is a label. */
3061 {
3064 rtx note;
3065 rtx next;
3070 /* Ignore references to labels of containing functions. */
3074 /* If there are other labels following this one,
3075 replace it with the last of the consecutive labels. */
3077 {
3090 }
3096 {
3100 /* If we've changed OLABEL and we had a REG_LABEL note
3101 for it, update it as well. */
3106 /* Otherwise, add a REG_LABEL note for LABEL unless there already
3107 is one. */
3109 {
3111 /* Don't record labels that refer to dispatch tables.
3112 This is not necessary, since the tablejump
3113 references the same label.
3114 And if we did record them, flow.c would make worse code. */
3121 }
3122 }
3124 }
3126 /* Do walk the labels in a vector, but not the first operand of an
3127 ADDR_DIFF_VEC. Don't set the JUMP_LABEL of a vector. */
3130 {
3136 }
3137 }
3141 {
3145 {
3149 }
3150 }
3151 }
3153 /* If all INSN does is set the pc, delete it,
3154 and delete the insn that set the condition codes for it
3155 if that's what the previous thing was. */
3157 void
3159 rtx insn;
3160 {
3165 }
3167 /* Delete INSN and recursively delete insns that compute values used only
3168 by INSN. This uses the REG_DEAD notes computed during flow analysis.
3169 If we are running before flow.c, we need do nothing since flow.c will
3170 delete dead code. We also can't know if the registers being used are
3171 dead or not at this point.
3173 Otherwise, look at all our REG_DEAD notes. If a previous insn does
3174 nothing other than set a register that dies in this insn, we can delete
3175 that insn as well.
3177 On machines with CC0, if CC0 is used in this insn, we may be able to
3178 delete the insn that set it. */
3180 static void
3182 rtx insn;
3183 {
3186 #ifdef HAVE_cc0
3188 {
3190 /* We assume that at this stage
3191 CC's are always set explicitly
3192 and always immediately before the jump that
3193 will use them. So if the previous insn
3194 exists to set the CC's, delete it
3195 (unless it performs auto-increments, etc.). */
3198 {
3202 else
3203 /* Otherwise, show that cc0 won't be used. */
3206 }
3207 }
3208 #endif
3211 {
3212 rtx our_prev;
3217 /* Verify that the REG_NOTE is legitimate. */
3224 {
3225 /* If we reach a SEQUENCE, it is too complex to try to
3226 do anything with it, so give up. */
3232 /* reorg creates USEs that look like this. We leave them
3233 alone because reorg needs them for its own purposes. */
3237 {
3242 {
3243 /* If we find a SET of something else, we can't
3244 delete the insn. */
3249 {
3255 }
3259 }
3265 }
3267 /* If OUR_PREV references the register that dies here, it is an
3268 additional use. Hence any prior SET isn't dead. However, this
3269 insn becomes the new place for the REG_DEAD note. */
3272 {
3276 }
3277 }
3278 }
3281 }
3282 \f
3283 /* Delete insn INSN from the chain of insns and update label ref counts.
3284 May delete some following insns as a consequence; may even delete
3285 a label elsewhere and insns that follow it.
3287 Returns the first insn after INSN that was not deleted. */
3289 rtx
3292 {
3301 /* This insn is already deleted => return first following nondeleted. */
3305 /* Don't delete user-declared labels. Convert them to special NOTEs
3306 instead. */
3309 {
3314 }
3315 else
3316 /* Mark this insn as deleted. */
3319 /* If this is an unconditional jump, delete it from the jump chain. */
3323 /* If instruction is followed by a barrier,
3324 delete the barrier too. */
3327 {
3330 }
3332 /* Patch out INSN (and the barrier if any) */
3335 {
3337 {
3342 }
3345 {
3349 }
3353 }
3355 /* If deleting a jump, decrement the count of the label,
3356 and delete the label if it is now unused. */
3360 {
3361 /* This can delete NEXT or PREV,
3362 either directly if NEXT is JUMP_LABEL (INSN),
3363 or indirectly through more levels of jumps. */
3365 /* I feel a little doubtful about this loop,
3366 but I see no clean and sure alternative way
3367 to find the first insn after INSN that is not now deleted.
3368 I hope this works. */
3372 }
3377 /* If INSN was a label and a dispatch table follows it,
3378 delete the dispatch table. The tablejump must have gone already.
3379 It isn't useful to fall through into a table. */
3388 /* If INSN was a label, delete insns following it if now unreachable. */
3391 {
3397 {
3401 /* Keep going past other deleted labels to delete what follows. */
3404 else
3405 /* Note: if this deletes a jump, it can cause more
3406 deletion of unreachable code, after a different label.
3407 As long as the value from this recursive call is correct,
3408 this invocation functions correctly. */
3410 }
3411 }
3414 }
3416 /* Advance from INSN till reaching something not deleted
3417 then return that. May return INSN itself. */
3419 rtx
3421 rtx insn;
3422 {
3426 }
3427 \f
3428 /* Delete a range of insns from FROM to TO, inclusive.
3429 This is for the sake of peephole optimization, so assume
3430 that whatever these insns do will still be done by a new
3431 peephole insn that will replace them. */
3433 void
3436 {
3440 {
3445 {
3448 /* Patch this insn out of the chain. */
3449 /* We don't do this all at once, because we
3450 must preserve all NOTEs. */
3456 }
3461 }
3463 /* Note that if TO is an unconditional jump
3464 we *do not* delete the BARRIER that follows,
3465 since the peephole that replaces this sequence
3466 is also an unconditional jump in that case. */
3467 }
3468 \f
3469 /* Invert the condition of the jump JUMP, and make it jump
3470 to label NLABEL instead of where it jumps now. */
3472 int
3475 {
3476 /* We have to either invert the condition and change the label or
3477 do neither. Either operation could fail. We first try to invert
3478 the jump. If that succeeds, we try changing the label. If that fails,
3479 we invert the jump back to what it was. */
3488 /* This should just be putting it back the way it was. */
3492 }
3494 /* Invert the jump condition of rtx X contained in jump insn, INSN.
3496 Return 1 if we can do so, 0 if we cannot find a way to do so that
3497 matches a pattern. */
3499 int
3501 rtx x;
3502 rtx insn;
3503 {
3511 {
3515 /* We can do this in two ways: The preferable way, which can only
3516 be done if this is not an integer comparison, is to reverse
3517 the comparison code. Otherwise, swap the THEN-part and ELSE-part
3518 of the IF_THEN_ELSE. If we can't do either, fail. */
3531 }
3535 {
3540 {
3545 }
3546 }
3549 }
3550 \f
3551 /* Make jump JUMP jump to label NLABEL instead of where it jumps now.
3552 If the old jump target label is unused as a result,
3553 it and the code following it may be deleted.
3555 If NLABEL is zero, we are to turn the jump into a (possibly conditional)
3556 RETURN insn.
3558 The return value will be 1 if the change was made, 0 if it wasn't (this
3559 can only occur for NLABEL == 0). */
3561 int
3564 {
3573 /* If this is an unconditional branch, delete it from the jump_chain of
3574 OLABEL and add it to the jump_chain of NLABEL (assuming both labels
3575 have UID's in range and JUMP_CHAIN is valid). */
3578 {
3584 {
3587 }
3588 }
3598 }
3600 /* Delete the instruction JUMP from any jump chain it might be on. */
3602 static void
3604 rtx jump;
3605 {
3609 /* Handle unconditional jumps. */
3614 /* Handle return insns. */
3621 else
3622 {
3623 rtx insn;
3629 {
3632 }
3633 }
3634 }
3636 /* If NLABEL is nonzero, throughout the rtx at LOC,
3637 alter (LABEL_REF OLABEL) to (LABEL_REF NLABEL). If OLABEL is
3638 zero, alter (RETURN) to (LABEL_REF NLABEL).
3640 If NLABEL is zero, alter (LABEL_REF OLABEL) to (RETURN) and check
3641 validity with validate_change. Convert (set (pc) (label_ref olabel))
3642 to (return).
3644 Return 0 if we found a change we would like to make but it is invalid.
3645 Otherwise, return 1. */
3647 int
3651 rtx insn;
3652 {
3659 {
3661 {
3664 else
3667 }
3668 }
3670 {
3675 }
3684 {
3689 {
3694 }
3695 }
3698 }
3699 \f
3700 /* Make jump JUMP jump to label NLABEL, assuming it used to be a tablejump.
3702 If the old jump target label (before the dispatch table) becomes unused,
3703 it and the dispatch table may be deleted. In that case, find the insn
3704 before the jump references that label and delete it and logical successors
3705 too. */
3707 static void
3710 {
3713 /* Add this jump to the jump_chain of NLABEL. */
3716 {
3719 }
3727 {
3730 }
3731 }
3733 /* Find the insn referencing LABEL that is a logical predecessor of INSN.
3734 If we found one, delete it and then delete this insn if DELETE_THIS is
3735 non-zero. Return non-zero if INSN or a predecessor references LABEL. */
3737 static int
3741 {
3743 rtx link;
3747 {
3749 {
3752 }
3753 else
3755 }
3759 {
3761 {
3764 }
3765 else
3767 }
3770 }
3771 \f
3772 /* Like rtx_equal_p except that it considers two REGs as equal
3773 if they renumber to the same value and considers two commutative
3774 operations to be the same if the order of the operands has been
3775 reversed. */
3777 int
3780 {
3791 {
3798 /* If we haven't done any renumbering, don't
3799 make any assumptions. */
3804 {
3809 {
3812 }
3813 }
3815 else
3816 {
3820 }
3823 {
3828 {
3831 }
3832 }
3834 else
3835 {
3839 }
3842 }
3844 /* Now we have disposed of all the cases
3845 in which different rtx codes can match. */
3850 {
3861 /* We can't assume nonlocal labels have their following insns yet. */
3865 /* Two label-refs are equivalent if they point at labels
3866 in the same position in the instruction stream. */
3872 }
3874 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent. */
3879 /* For commutative operations, the RTX match if the operand match in any
3880 order. Also handle the simple binary and unary cases without a loop. */
3892 /* Compare the elements. If any pair of corresponding elements
3893 fail to match, return 0 for the whole things. */
3897 {
3900 {
3924 /* fall through. */
3938 }
3939 }
3941 }
3942 \f
3943 /* If X is a hard register or equivalent to one or a subregister of one,
3944 return the hard register number. If X is a pseudo register that was not
3945 assigned a hard register, return the pseudo register number. Otherwise,
3946 return -1. Any rtx is valid for X. */
3948 int
3950 rtx x;
3951 {
3953 {
3957 }
3959 {
3963 }
3965 }
3966 \f
3967 /* Optimize code of the form:
3969 for (x = a[i]; x; ...)
3970 ...
3971 for (x = a[i]; x; ...)
3972 ...
3973 foo:
3975 Loop optimize will change the above code into
3977 if (x = a[i])
3978 for (;;)
3979 { ...; if (! (x = ...)) break; }
3980 if (x = a[i])
3981 for (;;)
3982 { ...; if (! (x = ...)) break; }
3983 foo:
3985 In general, if the first test fails, the program can branch
3986 directly to `foo' and skip the second try which is doomed to fail.
3987 We run this after loop optimization and before flow analysis. */
3989 /* When comparing the insn patterns, we track the fact that different
3990 pseudo-register numbers may have been used in each computation.
3991 The following array stores an equivalence -- same_regs[I] == J means
3992 that pseudo register I was used in the first set of tests in a context
3993 where J was used in the second set. We also count the number of such
3994 pending equivalences. If nonzero, the expressions really aren't the
3995 same. */
4001 /* Track any registers modified between the target of the first jump and
4002 the second jump. They never compare equal. */
4006 /* Record if memory was modified. */
4010 /* Called via note_stores on each insn between the target of the first
4011 branch and the second branch. It marks any changed registers. */
4013 static void
4015 rtx dest;
4016 rtx x;
4017 {
4032 else
4035 }
4037 /* F is the first insn in the chain of insns. */
4039 void
4041 rtx f;
4044 {
4045 /* Basic algorithm is to find a conditional branch,
4046 the label it may branch to, and the branch after
4047 that label. If the two branches test the same condition,
4048 walk back from both branch paths until the insn patterns
4049 differ, or code labels are hit. If we make it back to
4050 the target of the first branch, then we know that the first branch
4051 will either always succeed or always fail depending on the relative
4052 senses of the two branches. So adjust the first branch accordingly
4053 in this case. */
4062 /* Allocate register tables and quick-reset table. */
4070 {
4074 {
4075 /* Get to a candidate branch insn. */
4090 /* Look for a branch after the target. Record any registers and
4091 memory modified between the target and the branch. Stop when we
4092 get to a label since we can't know what was changed there. */
4094 {
4099 {
4100 /* If this is an unconditional jump and is the only use of
4101 its target label, we can follow it. */
4105 {
4108 }
4109 else
4111 }
4117 {
4126 }
4129 }
4131 /* Check the next candidate branch insn from the label
4132 of the first. */
4140 /* Get the comparison codes and operands, reversing the
4141 codes if appropriate. If we don't have comparison codes,
4142 we can't do anything. */
4155 /* If they test the same things and knowing that B1 branches
4156 tells us whether or not B2 branches, check if we
4157 can thread the branch. */
4162 {
4167 {
4169 {
4170 /* We have reached the target of the first branch.
4171 If there are no pending register equivalents,
4172 we know that this branch will either always
4173 succeed (if the senses of the two branches are
4174 the same) or always fail (if not). */
4175 rtx new_label;
4182 else
4186 {
4191 {
4192 /* Don't thread to the loop label. If a loop
4193 label is reused, loop optimization will
4194 be disabled for that loop. */
4197 }
4199 }
4201 }
4203 /* If either of these is not a normal insn (it might be
4204 a JUMP_INSN, CALL_INSN, or CODE_LABEL) we fail. (NOTEs
4205 have already been skipped above.) Similarly, fail
4206 if the insns are different. */
4215 }
4216 }
4217 }
4218 }
4219 }
4220 \f
4221 /* This is like RTX_EQUAL_P except that it knows about our handling of
4222 possibly equivalent registers and knows to consider volatile and
4223 modified objects as not equal.
4225 YINSN is the insn containing Y. */
4227 int
4230 rtx yinsn;
4231 {
4238 /* Rtx's of different codes cannot be equal. */
4242 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.
4243 (REG:SI x) and (REG:HI x) are NOT equivalent. */
4248 /* For commutative operations, the RTX match if the operand match in any
4249 order. Also handle the simple binary and unary cases without a loop. */
4261 /* Handle special-cases first. */
4263 {
4268 /* If neither is user variable or hard register, check for possible
4269 equivalence. */
4276 {
4278 num_same_regs++;
4280 /* If this is the first time we are seeing a register on the `Y'
4281 side, see if it is the last use. If not, we can't thread the
4282 jump, so mark it as not equivalent. */
4287 }
4288 else
4294 /* If memory modified or either volatile, not equivalent.
4295 Else, check address. */
4308 /* Cancel a pending `same_regs' if setting equivalenced registers.
4309 Then process source. */
4312 {
4314 {
4316 num_same_regs--;
4317 }
4320 }
4321 else
4332 }
4339 {
4341 {
4355 /* Two vectors must have the same length. */
4359 /* And the corresponding elements must match. */
4378 /* These are just backpointers, so they don't matter. */
4384 /* It is believed that rtx's at this level will never
4385 contain anything but integers and other rtx's,
4386 except for within LABEL_REFs and SYMBOL_REFs. */
4389 }
4390 }
4392 }