1 /* Optimize jump instructions, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1991 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)
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
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. */
56 #include "hard-reg-set.h"
59 #include "insn-config.h"
60 #include "insn-flags.h"
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. */
84 static rtx *jump_chain;
86 /* List of labels referred to from initializers.
87 These can never be deleted. */
90 /* Maximum index in jump_chain. */
92 static int max_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
104 static int cross_jump_death_matters = 0;
106 static int duplicate_loop_exit_test ();
108 int redirect_jump ();
109 static int redirect_exp ();
110 void redirect_tablejump ();
111 static int delete_labelref_insn ();
113 static int invert_exp ();
117 extern rtx gen_jump ();
119 static void mark_jump_label ();
121 static void delete_from_jump_chain ();
122 static int tension_vector_labels ();
123 static void find_cross_jump ();
124 static void do_cross_jump ();
125 static int jump_back_p ();
127 /* Delete no-op jumps and optimize jumps to jumps
128 and jumps around jumps.
129 Delete unused labels and unreachable code.
131 If CROSS_JUMP is 1, detect matching code
132 before a jump and its destination and unify them.
133 If CROSS_JUMP is 2, do cross-jumping, but pay attention to death notes.
135 If NOOP_MOVES is nonzero, delete no-op move insns.
137 If AFTER_REGSCAN is nonzero, then this jump pass is being run immediately
138 after regscan, and it is safe to use regno_first_uid and regno_last_uid.
140 If `optimize' is zero, don't change any code,
141 just determine whether control drops off the end of the function.
142 This case occurs when we have -W and not -O.
143 It works because `delete_insn' checks the value of `optimize'
144 and refrains from actually deleting when that is 0. */
147 jump_optimize (f, cross_jump, noop_moves, after_regscan)
159 cross_jump_death_matters = (cross_jump == 2);
161 /* Initialize LABEL_NUSES and JUMP_LABEL fields. */
163 for (insn = f; insn; insn = NEXT_INSN (insn))
165 if (GET_CODE (insn) == CODE_LABEL)
166 LABEL_NUSES (insn) = (LABEL_PRESERVE_P (insn) != 0);
167 else if (GET_CODE (insn) == JUMP_INSN)
168 JUMP_LABEL (insn) = 0;
169 if (INSN_UID (insn) > max_uid)
170 max_uid = INSN_UID (insn);
175 /* Delete insns following barriers, up to next label. */
177 for (insn = f; insn;)
179 if (GET_CODE (insn) == BARRIER)
181 insn = NEXT_INSN (insn);
182 while (insn != 0 && GET_CODE (insn) != CODE_LABEL)
184 if (GET_CODE (insn) == NOTE
185 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END)
186 insn = NEXT_INSN (insn);
188 insn = delete_insn (insn);
190 /* INSN is now the code_label. */
193 insn = NEXT_INSN (insn);
196 /* Leave some extra room for labels and duplicate exit test insns
198 max_jump_chain = max_uid * 14 / 10;
199 jump_chain = (rtx *) alloca (max_jump_chain * sizeof (rtx));
200 bzero (jump_chain, max_jump_chain * sizeof (rtx));
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. */
209 for (insn = f; insn; insn = NEXT_INSN (insn))
210 if ((GET_CODE (insn) == JUMP_INSN || GET_CODE (insn) == INSN
211 || GET_CODE (insn) == CALL_INSN)
212 && ! INSN_DELETED_P (insn))
214 mark_jump_label (PATTERN (insn), insn, cross_jump);
215 if (GET_CODE (insn) == JUMP_INSN)
217 if (JUMP_LABEL (insn) != 0 && simplejump_p (insn))
219 jump_chain[INSN_UID (insn)]
220 = jump_chain[INSN_UID (JUMP_LABEL (insn))];
221 jump_chain[INSN_UID (JUMP_LABEL (insn))] = insn;
223 if (GET_CODE (PATTERN (insn)) == RETURN)
225 jump_chain[INSN_UID (insn)] = jump_chain[0];
226 jump_chain[0] = insn;
231 /* Keep track of labels used from static data;
232 they cannot ever be deleted. */
234 for (insn = forced_labels; insn; insn = XEXP (insn, 1))
235 LABEL_NUSES (XEXP (insn, 0))++;
237 /* Delete all labels already not referenced.
238 Also find the last insn. */
241 for (insn = f; insn; )
243 if (GET_CODE (insn) == CODE_LABEL && LABEL_NUSES (insn) == 0)
244 insn = delete_insn (insn);
248 insn = NEXT_INSN (insn);
254 /* See if there is still a NOTE_INSN_FUNCTION_END in this function.
255 If so record that this function can drop off the end. */
261 /* One label can follow the end-note: the return label. */
262 && ((GET_CODE (insn) == CODE_LABEL && n_labels-- > 0)
263 /* Ordinary insns can follow it if returning a structure. */
264 || GET_CODE (insn) == INSN
265 /* If machine uses explicit RETURN insns, no epilogue,
266 then one of them follows the note. */
267 || (GET_CODE (insn) == JUMP_INSN
268 && GET_CODE (PATTERN (insn)) == RETURN)
269 /* Other kinds of notes can follow also. */
270 || (GET_CODE (insn) == NOTE
271 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END)))
272 insn = PREV_INSN (insn);
275 /* Report if control can fall through at the end of the function. */
276 if (insn && GET_CODE (insn) == NOTE
277 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END
278 && ! INSN_DELETED_P (insn))
281 /* Zero the "deleted" flag of all the "deleted" insns. */
282 for (insn = f; insn; insn = NEXT_INSN (insn))
283 INSN_DELETED_P (insn) = 0;
290 /* If we fall through to the epilogue, see if we can insert a RETURN insn
291 in front of it. If the machine allows it at this point (we might be
292 after reload for a leaf routine), it will improve optimization for it
294 insn = get_last_insn ();
295 while (insn && GET_CODE (insn) == NOTE)
296 insn = PREV_INSN (insn);
298 if (insn && GET_CODE (insn) != BARRIER)
300 emit_jump_insn (gen_return ());
307 for (insn = f; insn; )
309 register rtx next = NEXT_INSN (insn);
311 if (GET_CODE (insn) == INSN)
313 register rtx body = PATTERN (insn);
315 /* Combine stack_adjusts with following push_insns. */
317 if (GET_CODE (body) == SET
318 && SET_DEST (body) == stack_pointer_rtx
319 && GET_CODE (SET_SRC (body)) == PLUS
320 && XEXP (SET_SRC (body), 0) == stack_pointer_rtx
321 && GET_CODE (XEXP (SET_SRC (body), 1)) == CONST_INT
322 && INTVAL (XEXP (SET_SRC (body), 1)) > 0)
325 rtx stack_adjust_insn = insn;
326 int stack_adjust_amount = INTVAL (XEXP (SET_SRC (body), 1));
327 int total_pushed = 0;
330 /* Find all successive push insns. */
332 /* Don't convert more than three pushes;
333 that starts adding too many displaced addresses
334 and the whole thing starts becoming a losing
339 p = next_nonnote_insn (p);
340 if (p == 0 || GET_CODE (p) != INSN)
343 if (GET_CODE (pbody) != SET)
345 dest = SET_DEST (pbody);
346 /* Allow a no-op move between the adjust and the push. */
347 if (GET_CODE (dest) == REG
348 && GET_CODE (SET_SRC (pbody)) == REG
349 && REGNO (dest) == REGNO (SET_SRC (pbody)))
351 if (! (GET_CODE (dest) == MEM
352 && GET_CODE (XEXP (dest, 0)) == POST_INC
353 && XEXP (XEXP (dest, 0), 0) == stack_pointer_rtx))
356 if (total_pushed + GET_MODE_SIZE (SET_DEST (pbody))
357 > stack_adjust_amount)
359 total_pushed += GET_MODE_SIZE (SET_DEST (pbody));
362 /* Discard the amount pushed from the stack adjust;
363 maybe eliminate it entirely. */
364 if (total_pushed >= stack_adjust_amount)
366 delete_insn (stack_adjust_insn);
367 total_pushed = stack_adjust_amount;
370 XEXP (SET_SRC (PATTERN (stack_adjust_insn)), 1)
371 = gen_rtx (CONST_INT, VOIDmode,
372 stack_adjust_amount - total_pushed);
374 /* Change the appropriate push insns to ordinary stores. */
376 while (total_pushed > 0)
379 p = next_nonnote_insn (p);
380 if (GET_CODE (p) != INSN)
383 if (GET_CODE (pbody) == SET)
385 dest = SET_DEST (pbody);
386 if (! (GET_CODE (dest) == MEM
387 && GET_CODE (XEXP (dest, 0)) == POST_INC
388 && XEXP (XEXP (dest, 0), 0) == stack_pointer_rtx))
390 total_pushed -= GET_MODE_SIZE (SET_DEST (pbody));
391 /* If this push doesn't fully fit in the space
392 of the stack adjust that we deleted,
393 make another stack adjust here for what we
394 didn't use up. There should be peepholes
395 to recognize the resulting sequence of insns. */
396 if (total_pushed < 0)
398 emit_insn_before (gen_add2_insn (stack_pointer_rtx,
399 gen_rtx (CONST_INT, VOIDmode, - total_pushed)),
404 = plus_constant (stack_pointer_rtx, total_pushed);
409 /* Detect and delete no-op move instructions
410 resulting from not allocating a parameter in a register. */
412 if (GET_CODE (body) == SET
413 && (SET_DEST (body) == SET_SRC (body)
414 || (GET_CODE (SET_DEST (body)) == MEM
415 && GET_CODE (SET_SRC (body)) == MEM
416 && rtx_equal_p (SET_SRC (body), SET_DEST (body))))
417 && ! (GET_CODE (SET_DEST (body)) == MEM
418 && MEM_VOLATILE_P (SET_DEST (body)))
419 && ! (GET_CODE (SET_SRC (body)) == MEM
420 && MEM_VOLATILE_P (SET_SRC (body))))
423 /* Detect and ignore no-op move instructions
424 resulting from smart or fortuitous register allocation. */
426 else if (GET_CODE (body) == SET)
428 int sreg = true_regnum (SET_SRC (body));
429 int dreg = true_regnum (SET_DEST (body));
431 if (sreg == dreg && sreg >= 0)
433 else if (sreg >= 0 && dreg >= 0)
436 rtx tem = find_equiv_reg (0, insn, 0,
438 GET_MODE (SET_SRC (body)));
440 #ifdef PRESERVE_DEATH_INFO_REGNO_P
441 /* Deleting insn could lose a death-note for SREG or DREG
442 so don't do it if final needs accurate death-notes. */
443 if (! PRESERVE_DEATH_INFO_REGNO_P (sreg)
444 && ! PRESERVE_DEATH_INFO_REGNO_P (dreg))
447 /* DREG may have been the target of a REG_DEAD note in
448 the insn which makes INSN redundant. If so, reorg
449 would still think it is dead. So search for such a
450 note and delete it if we find it. */
451 for (trial = prev_nonnote_insn (insn);
452 trial && GET_CODE (trial) != CODE_LABEL;
453 trial = prev_nonnote_insn (trial))
454 if (find_regno_note (trial, REG_DEAD, dreg))
456 remove_death (dreg, trial);
461 && GET_MODE (tem) == GET_MODE (SET_DEST (body)))
465 else if (dreg >= 0 && CONSTANT_P (SET_SRC (body))
466 && find_equiv_reg (SET_SRC (body), insn, 0, dreg, 0,
467 0, GET_MODE (SET_DEST (body))))
469 /* This handles the case where we have two consecutive
470 assignments of the same constant to pseudos that didn't
471 get a hard reg. Each SET from the constant will be
472 converted into a SET of the spill register and an
473 output reload will be made following it. This produces
474 two loads of the same constant into the same spill
479 /* Look back for a death note for the first reg.
480 If there is one, it is no longer accurate. */
481 while (in_insn && GET_CODE (in_insn) != CODE_LABEL)
483 if ((GET_CODE (in_insn) == INSN
484 || GET_CODE (in_insn) == JUMP_INSN)
485 && find_regno_note (in_insn, REG_DEAD, dreg))
487 remove_death (dreg, in_insn);
490 in_insn = PREV_INSN (in_insn);
493 /* Delete the second load of the value. */
497 else if (GET_CODE (body) == PARALLEL)
499 /* If each part is a set between two identical registers or
500 a USE or CLOBBER, delete the insn. */
504 for (i = XVECLEN (body, 0) - 1; i >= 0; i--)
506 tem = XVECEXP (body, 0, i);
507 if (GET_CODE (tem) == USE || GET_CODE (tem) == CLOBBER)
510 if (GET_CODE (tem) != SET
511 || (sreg = true_regnum (SET_SRC (tem))) < 0
512 || (dreg = true_regnum (SET_DEST (tem))) < 0
520 #if !BYTES_BIG_ENDIAN /* Not worth the hair to detect this
521 in the big-endian case. */
522 /* Also delete insns to store bit fields if they are no-ops. */
523 else if (GET_CODE (body) == SET
524 && GET_CODE (SET_DEST (body)) == ZERO_EXTRACT
525 && XEXP (SET_DEST (body), 2) == const0_rtx
526 && XEXP (SET_DEST (body), 0) == SET_SRC (body)
527 && ! (GET_CODE (SET_SRC (body)) == MEM
528 && MEM_VOLATILE_P (SET_SRC (body))))
530 #endif /* not BYTES_BIG_ENDIAN */
535 /* Now iterate optimizing jumps until nothing changes over one pass. */
542 for (insn = f; insn; insn = next)
545 rtx temp, temp1, temp2, temp3, temp4, temp5;
547 int this_is_simplejump, this_is_condjump;
549 /* If NOT the first iteration, if this is the last jump pass
550 (just before final), do the special peephole optimizations.
551 Avoiding the first iteration gives ordinary jump opts
552 a chance to work before peephole opts. */
554 if (reload_completed && !first && !flag_no_peephole)
555 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN)
559 /* That could have deleted some insns after INSN, so check now
560 what the following insn is. */
562 next = NEXT_INSN (insn);
564 /* See if this is a NOTE_INSN_LOOP_BEG followed by an unconditional
565 jump. Try to optimize by duplicating the loop exit test if so.
566 This is only safe immediately after regscan, because it uses
567 the values of regno_first_uid and regno_last_uid. */
568 if (after_regscan && GET_CODE (insn) == NOTE
569 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG
570 && (temp1 = next_nonnote_insn (insn)) != 0
571 && simplejump_p (temp1))
573 temp = PREV_INSN (insn);
574 if (duplicate_loop_exit_test (insn))
577 next = NEXT_INSN (temp);
582 if (GET_CODE (insn) != JUMP_INSN)
585 this_is_simplejump = simplejump_p (insn);
586 this_is_condjump = condjump_p (insn);
588 /* Tension the labels in dispatch tables. */
590 if (GET_CODE (PATTERN (insn)) == ADDR_VEC)
591 changed |= tension_vector_labels (PATTERN (insn), 0);
592 if (GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
593 changed |= tension_vector_labels (PATTERN (insn), 1);
595 /* If a dispatch table always goes to the same place,
596 get rid of it and replace the insn that uses it. */
598 if (GET_CODE (PATTERN (insn)) == ADDR_VEC
599 || GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
602 rtx pat = PATTERN (insn);
603 int diff_vec_p = GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC;
604 int len = XVECLEN (pat, diff_vec_p);
605 rtx dispatch = prev_real_insn (insn);
607 for (i = 0; i < len; i++)
608 if (XEXP (XVECEXP (pat, diff_vec_p, i), 0)
609 != XEXP (XVECEXP (pat, diff_vec_p, 0), 0))
612 && GET_CODE (dispatch) == JUMP_INSN
613 && JUMP_LABEL (dispatch) != 0
614 /* Don't mess with a casesi insn. */
615 && !(GET_CODE (PATTERN (dispatch)) == SET
616 && (GET_CODE (SET_SRC (PATTERN (dispatch)))
618 && next_real_insn (JUMP_LABEL (dispatch)) == insn)
620 redirect_tablejump (dispatch,
621 XEXP (XVECEXP (pat, diff_vec_p, 0), 0));
626 reallabelprev = prev_active_insn (JUMP_LABEL (insn));
628 /* If a jump references the end of the function, try to turn
629 it into a RETURN insn, possibly a conditional one. */
630 if (JUMP_LABEL (insn)
631 && next_active_insn (JUMP_LABEL (insn)) == 0)
632 changed |= redirect_jump (insn, 0);
634 /* Detect jump to following insn. */
635 if (reallabelprev == insn && condjump_p (insn))
642 /* If we have an unconditional jump preceded by a USE, try to put
643 the USE before the target and jump there. This simplifies many
644 of the optimizations below since we don't have to worry about
645 dealing with these USE insns. We only do this if the label
646 being branch to already has the identical USE or if code
647 never falls through to that label. */
649 if (this_is_simplejump
650 && (temp = prev_nonnote_insn (insn)) != 0
651 && GET_CODE (temp) == INSN && GET_CODE (PATTERN (temp)) == USE
652 && (temp1 = prev_nonnote_insn (JUMP_LABEL (insn))) != 0
653 && (GET_CODE (temp1) == BARRIER
654 || (GET_CODE (temp1) == INSN
655 && rtx_equal_p (PATTERN (temp), PATTERN (temp1)))))
657 if (GET_CODE (temp1) == BARRIER)
659 reorder_insns (temp, temp, temp1);
660 temp1 = NEXT_INSN (temp1);
665 redirect_jump (insn, get_label_before (temp1));
666 reallabelprev = prev_real_insn (temp1);
670 /* Simplify if (...) x = a; else x = b; by converting it
671 to x = b; if (...) x = a;
672 if B is sufficiently simple, the test doesn't involve X,
673 and nothing in the test modifies B or X.
675 If we have small register classes, we also can't do this if X
678 If the "x = b;" insn has any REG_NOTES, we don't do this because
679 of the possibility that we are running after CSE and there is a
680 REG_EQUAL note that is only valid if the branch has already been
681 taken. If we move the insn with the REG_EQUAL note, we may
682 fold the comparison to always be false in a later CSE pass.
683 (We could also delete the REG_NOTES when moving the insn, but it
684 seems simpler to not move it.) An exception is that we can move
685 the insn if the only note is a REG_EQUAL or REG_EQUIV whose
686 value is the same as "b".
688 INSN is the branch over the `else' part.
692 TEMP to the jump insn preceding "x = a;"
694 TEMP2 to the insn that sets "x = b;"
695 TEMP3 to the insn that sets "x = a;" */
697 if (this_is_simplejump
698 && (temp3 = prev_active_insn (insn)) != 0
699 && GET_CODE (temp3) == INSN
700 && GET_CODE (PATTERN (temp3)) == SET
701 && GET_CODE (temp1 = SET_DEST (PATTERN (temp3))) == REG
702 #ifdef SMALL_REGISTER_CLASSES
703 && REGNO (temp1) >= FIRST_PSEUDO_REGISTER
705 && (temp2 = next_active_insn (insn)) != 0
706 && GET_CODE (temp2) == INSN
707 && GET_CODE (PATTERN (temp2)) == SET
708 && rtx_equal_p (SET_DEST (PATTERN (temp2)), temp1)
709 && (GET_CODE (SET_SRC (PATTERN (temp2))) == REG
710 || CONSTANT_P (SET_SRC (PATTERN (temp2))))
711 && (REG_NOTES (temp2) == 0
712 || ((REG_NOTE_KIND (REG_NOTES (temp2)) == REG_EQUAL
713 || REG_NOTE_KIND (REG_NOTES (temp2)) == REG_EQUIV)
714 && XEXP (REG_NOTES (temp2), 1) == 0
715 && rtx_equal_p (XEXP (REG_NOTES (temp2), 0),
716 SET_SRC (PATTERN (temp2)))))
717 && (temp = prev_active_insn (temp3)) != 0
718 && condjump_p (temp) && ! simplejump_p (temp)
719 /* TEMP must skip over the "x = a;" insn */
720 && prev_real_insn (JUMP_LABEL (temp)) == insn
721 && no_labels_between_p (insn, JUMP_LABEL (temp))
722 /* There must be no other entries to the "x = b;" insn. */
723 && no_labels_between_p (JUMP_LABEL (temp), temp2)
724 /* INSN must either branch to the insn after TEMP2 or the insn
725 after TEMP2 must branch to the same place as INSN. */
726 && (reallabelprev == temp2
727 || ((temp4 = next_active_insn (temp2)) != 0
728 && simplejump_p (temp4)
729 && JUMP_LABEL (temp4) == JUMP_LABEL (insn))))
731 /* The test expression, X, may be a complicated test with
732 multiple branches. See if we can find all the uses of
733 the label that TEMP branches to without hitting a CALL_INSN
734 or a jump to somewhere else. */
735 rtx target = JUMP_LABEL (temp);
736 int nuses = LABEL_NUSES (target);
739 /* Set P to the first jump insn that goes around "x = a;". */
740 for (p = temp; nuses && p; p = prev_nonnote_insn (p))
742 if (GET_CODE (p) == JUMP_INSN)
744 if (condjump_p (p) && ! simplejump_p (p)
745 && JUMP_LABEL (p) == target)
754 else if (GET_CODE (p) == CALL_INSN)
759 /* We cannot insert anything between a set of cc and its use
760 so if P uses cc0, we must back up to the previous insn. */
761 q = prev_nonnote_insn (p);
762 if (q && GET_RTX_CLASS (GET_CODE (q)) == 'i'
763 && sets_cc0_p (PATTERN (q)))
770 /* If we found all the uses and there was no data conflict, we
771 can move the assignment unless we can branch into the middle
774 && no_labels_between_p (p, insn)
775 && ! reg_referenced_between_p (temp1, p, NEXT_INSN (temp3))
776 && ! reg_set_between_p (temp1, p, temp3)
777 && (GET_CODE (SET_SRC (PATTERN (temp2))) == CONST_INT
778 || ! reg_set_between_p (SET_SRC (PATTERN (temp2)),
781 reorder_insns_with_line_notes (temp2, temp2, p);
783 /* Set NEXT to an insn that we know won't go away. */
784 next = next_active_insn (insn);
786 /* Delete the jump around the set. Note that we must do
787 this before we redirect the test jumps so that it won't
788 delete the code immediately following the assignment
789 we moved (which might be a jump). */
793 /* We either have two consecutive labels or a jump to
794 a jump, so adjust all the JUMP_INSNs to branch to where
796 for (p = NEXT_INSN (p); p != next; p = NEXT_INSN (p))
797 if (GET_CODE (p) == JUMP_INSN)
798 redirect_jump (p, target);
805 /* If we have x = a; if (...) x = b;
806 and either A or B is zero, or if we have if (...) x = 0;
807 and jumps are expensive, try to use a store-flag insn to
808 avoid the jump. (If the jump would be faster, the machine
809 should not have defined the scc insns!). These cases are often
810 made by the previous optimization.
812 INSN here is the jump around the store. We set:
814 TEMP to the "x = b;" insn.
816 TEMP2 to B (const0_rtx in the second case).
817 TEMP3 to A (X in the second case).
818 TEMP4 to the condition being tested.
819 TEMP5 to the earliest insn used to find the condition. */
821 if (/* We can't do this after reload has completed. */
823 && this_is_condjump && ! this_is_simplejump
824 /* Set TEMP to the "x = b;" insn. */
825 && (temp = next_nonnote_insn (insn)) != 0
826 && GET_CODE (temp) == INSN
827 && GET_CODE (PATTERN (temp)) == SET
828 && GET_CODE (temp1 = SET_DEST (PATTERN (temp))) == REG
829 #ifdef SMALL_REGISTER_CLASSES
830 && REGNO (temp1) >= FIRST_PSEUDO_REGISTER
832 && GET_MODE_CLASS (GET_MODE (temp1)) == MODE_INT
833 && (GET_CODE (temp2 = SET_SRC (PATTERN (temp))) == REG
834 || GET_CODE (temp2) == CONST_INT)
835 /* Allow either form, but prefer the former if both apply. */
836 && (((temp3 = reg_set_last (temp1, insn)) != 0
837 && ((GET_CODE (temp3) == REG
838 #ifdef SMALL_REGISTER_CLASSES
839 && REGNO (temp3) >= FIRST_PSEUDO_REGISTER
842 || GET_CODE (temp3) == CONST_INT))
843 /* Make the latter case look like x = x; if (...) x = 0; */
844 || ((temp3 = temp1, BRANCH_COST > 1)
845 && temp2 == const0_rtx))
846 /* INSN must either branch to the insn after TEMP or the insn
847 after TEMP must branch to the same place as INSN. */
848 && (reallabelprev == temp
849 || ((temp4 = next_active_insn (temp)) != 0
850 && simplejump_p (temp4)
851 && JUMP_LABEL (temp4) == JUMP_LABEL (insn)))
852 && (temp4 = get_condition (insn, &temp5)) != 0
854 /* If B is zero, OK; if A is zero, can only do this if we
855 can reverse the condition. */
856 && (temp2 == const0_rtx
857 || (temp3 == const0_rtx
858 && (can_reverse_comparison_p (temp4, insn)))))
860 enum rtx_code code = GET_CODE (temp4);
861 rtx yes = temp3, var = temp1;
865 /* If necessary, reverse the condition. */
866 if (temp3 == const0_rtx)
867 code = reverse_condition (code), yes = temp2;
869 /* See if we can do this with a store-flag insn. */
872 /* If YES is the constant 1, it is best to just compute
873 the result directly. If YES is constant and STORE_FLAG_VALUE
874 includes all of its bits, it is best to compute the flag
875 value unnormalized and `and' it with YES. Otherwise,
876 normalize to -1 and `and' with YES. */
877 normalizep = (yes == const1_rtx ? 1
878 : (GET_CODE (yes) == CONST_INT
879 && (INTVAL (yes) & ~ STORE_FLAG_VALUE) == 0) ? 0
882 /* We will be putting the store-flag insn immediately in
883 front of the comparison that was originally being done,
884 so we know all the variables in TEMP4 will be valid.
885 However, this might be in front of the assignment of
886 A to VAR. If it is, it would clobber the store-flag
889 Therefore, emit into a temporary which will be copied to
890 VAR immediately after TEMP. */
892 target = emit_store_flag (gen_reg_rtx (GET_MODE (var)), code,
893 XEXP (temp4, 0), XEXP (temp4, 1),
895 (code == LTU || code == LEU
896 || code == GEU || code == GTU),
903 target = expand_and (yes, target,
904 (GET_CODE (target) == REG
906 seq = gen_sequence ();
908 emit_insn_before (seq, temp5);
909 emit_insn_after (gen_move_insn (var, target), insn);
911 next = NEXT_INSN (insn);
913 delete_insn (prev_nonnote_insn (insn));
923 /* If branches are expensive, convert
924 if (foo) bar++; to bar += (foo != 0);
925 and similarly for "bar--;"
927 INSN is the conditional branch around the arithmetic. We set:
929 TEMP is the arithmetic insn.
930 TEMP1 is the SET doing the arthmetic.
931 TEMP2 is the operand being incremented or decremented.
932 TEMP3 to the condition being tested.
933 TEMP4 to the earliest insn used to find the condition. */
936 && ! reload_completed
937 && this_is_condjump && ! this_is_simplejump
938 && (temp = next_nonnote_insn (insn)) != 0
939 && (temp1 = single_set (temp)) != 0
940 && (temp2 = SET_DEST (temp1),
941 GET_MODE_CLASS (GET_MODE (temp2)) == MODE_INT)
942 && GET_CODE (SET_SRC (temp1)) == PLUS
943 && (XEXP (SET_SRC (temp1), 1) == const1_rtx
944 || XEXP (SET_SRC (temp1), 1) == constm1_rtx)
945 && rtx_equal_p (temp2, XEXP (SET_SRC (temp1), 0))
946 /* INSN must either branch to the insn after TEMP or the insn
947 after TEMP must branch to the same place as INSN. */
948 && (reallabelprev == temp
949 || ((temp3 = next_active_insn (temp)) != 0
950 && simplejump_p (temp3)
951 && JUMP_LABEL (temp3) == JUMP_LABEL (insn)))
952 && (temp3 = get_condition (insn, &temp4)) != 0
953 && can_reverse_comparison_p (temp3, insn))
956 enum rtx_code code = reverse_condition (GET_CODE (temp3));
960 target = emit_store_flag (gen_reg_rtx (GET_MODE (temp2)), code,
961 XEXP (temp3, 0), XEXP (temp3, 1),
963 (code == LTU || code == LEU
964 || code == GTU || code == GEU), 1);
966 /* If we can do the store-flag, do the addition or
970 target = expand_binop (GET_MODE (temp2),
971 (XEXP (SET_SRC (temp1), 1) == const1_rtx
972 ? add_optab : sub_optab),
973 temp2, target, temp2, OPTAB_WIDEN);
977 /* Put the result back in temp2 in case it isn't already.
978 Then replace the jump, possible a CC0-setting insn in
979 front of the jump, and TEMP, with the sequence we have
983 emit_move_insn (temp2, target);
988 emit_insns_before (seq, temp4);
990 next = NEXT_INSN (insn);
992 delete_insn (prev_nonnote_insn (insn));
1002 /* Simplify if (...) x = 1; else {...} if (x) ...
1003 We recognize this case scanning backwards as well.
1005 TEMP is the assignment to x;
1006 TEMP1 is the label at the head of the second if. */
1007 /* ?? This should call get_condition to find the values being
1008 compared, instead of looking for a COMPARE insn when HAVE_cc0
1009 is not defined. This would allow it to work on the m88k. */
1010 /* ?? This optimization is only safe before cse is run if HAVE_cc0
1011 is not defined and the condition is tested by a separate compare
1012 insn. This is because the code below assumes that the result
1013 of the compare dies in the following branch.
1015 Not only that, but there might be other insns between the
1016 compare and branch whose results are live. Those insns need
1019 A way to fix this is to move the insns at JUMP_LABEL (insn)
1020 to before INSN. If we are running before flow, they will
1021 be deleted if they aren't needed. But this doesn't work
1024 This is really a special-case of jump threading, anyway. The
1025 right thing to do is to replace this and jump threading with
1026 much simpler code in cse.
1028 This code has been turned off in the non-cc0 case in the
1032 else if (this_is_simplejump
1033 /* Safe to skip USE and CLOBBER insns here
1034 since they will not be deleted. */
1035 && (temp = prev_active_insn (insn))
1036 && no_labels_between_p (temp, insn)
1037 && GET_CODE (temp) == INSN
1038 && GET_CODE (PATTERN (temp)) == SET
1039 && GET_CODE (SET_DEST (PATTERN (temp))) == REG
1040 && CONSTANT_P (SET_SRC (PATTERN (temp)))
1041 && (temp1 = next_active_insn (JUMP_LABEL (insn)))
1042 /* If we find that the next value tested is `x'
1043 (TEMP1 is the insn where this happens), win. */
1044 && GET_CODE (temp1) == INSN
1045 && GET_CODE (PATTERN (temp1)) == SET
1047 /* Does temp1 `tst' the value of x? */
1048 && SET_SRC (PATTERN (temp1)) == SET_DEST (PATTERN (temp))
1049 && SET_DEST (PATTERN (temp1)) == cc0_rtx
1050 && (temp1 = next_nonnote_insn (temp1))
1052 /* Does temp1 compare the value of x against zero? */
1053 && GET_CODE (SET_SRC (PATTERN (temp1))) == COMPARE
1054 && XEXP (SET_SRC (PATTERN (temp1)), 1) == const0_rtx
1055 && (XEXP (SET_SRC (PATTERN (temp1)), 0)
1056 == SET_DEST (PATTERN (temp)))
1057 && GET_CODE (SET_DEST (PATTERN (temp1))) == REG
1058 && (temp1 = find_next_ref (SET_DEST (PATTERN (temp1)), temp1))
1060 && condjump_p (temp1))
1062 /* Get the if_then_else from the condjump. */
1063 rtx choice = SET_SRC (PATTERN (temp1));
1064 if (GET_CODE (choice) == IF_THEN_ELSE)
1066 enum rtx_code code = GET_CODE (XEXP (choice, 0));
1067 rtx val = SET_SRC (PATTERN (temp));
1069 = simplify_relational_operation (code, GET_MODE (SET_DEST (PATTERN (temp))),
1073 if (cond == const_true_rtx)
1074 ultimate = XEXP (choice, 1);
1075 else if (cond == const0_rtx)
1076 ultimate = XEXP (choice, 2);
1080 if (ultimate == pc_rtx)
1081 ultimate = get_label_after (temp1);
1082 else if (ultimate && GET_CODE (ultimate) != RETURN)
1083 ultimate = XEXP (ultimate, 0);
1086 changed |= redirect_jump (insn, ultimate);
1092 /* @@ This needs a bit of work before it will be right.
1094 Any type of comparison can be accepted for the first and
1095 second compare. When rewriting the first jump, we must
1096 compute the what conditions can reach label3, and use the
1097 appropriate code. We can not simply reverse/swap the code
1098 of the first jump. In some cases, the second jump must be
1102 < == converts to > ==
1103 < != converts to == >
1106 If the code is written to only accept an '==' test for the second
1107 compare, then all that needs to be done is to swap the condition
1108 of the first branch.
1110 It is questionable whether we want this optimization anyways,
1111 since if the user wrote code like this because he/she knew that
1112 the jump to label1 is taken most of the time, then rewritting
1113 this gives slower code. */
1114 /* @@ This should call get_condition to find the values being
1115 compared, instead of looking for a COMPARE insn when HAVE_cc0
1116 is not defined. This would allow it to work on the m88k. */
1117 /* @@ This optimization is only safe before cse is run if HAVE_cc0
1118 is not defined and the condition is tested by a separate compare
1119 insn. This is because the code below assumes that the result
1120 of the compare dies in the following branch. */
1122 /* Simplify test a ~= b
1136 where ~= is an inequality, e.g. >, and ~~= is the swapped
1139 We recognize this case scanning backwards.
1141 TEMP is the conditional jump to `label2';
1142 TEMP1 is the test for `a == b';
1143 TEMP2 is the conditional jump to `label1';
1144 TEMP3 is the test for `a ~= b'. */
1145 else if (this_is_simplejump
1146 && (temp = prev_active_insn (insn))
1147 && no_labels_between_p (temp, insn)
1148 && condjump_p (temp)
1149 && (temp1 = prev_active_insn (temp))
1150 && no_labels_between_p (temp1, temp)
1151 && GET_CODE (temp1) == INSN
1152 && GET_CODE (PATTERN (temp1)) == SET
1154 && sets_cc0_p (PATTERN (temp1)) == 1
1156 && GET_CODE (SET_SRC (PATTERN (temp1))) == COMPARE
1157 && GET_CODE (SET_DEST (PATTERN (temp1))) == REG
1158 && (temp == find_next_ref (SET_DEST (PATTERN (temp1)), temp1))
1160 && (temp2 = prev_active_insn (temp1))
1161 && no_labels_between_p (temp2, temp1)
1162 && condjump_p (temp2)
1163 && JUMP_LABEL (temp2) == next_nonnote_insn (NEXT_INSN (insn))
1164 && (temp3 = prev_active_insn (temp2))
1165 && no_labels_between_p (temp3, temp2)
1166 && GET_CODE (PATTERN (temp3)) == SET
1167 && rtx_equal_p (SET_DEST (PATTERN (temp3)),
1168 SET_DEST (PATTERN (temp1)))
1169 && rtx_equal_p (SET_SRC (PATTERN (temp1)),
1170 SET_SRC (PATTERN (temp3)))
1171 && ! inequality_comparisons_p (PATTERN (temp))
1172 && inequality_comparisons_p (PATTERN (temp2)))
1174 rtx fallthrough_label = JUMP_LABEL (temp2);
1176 ++LABEL_NUSES (fallthrough_label);
1177 if (swap_jump (temp2, JUMP_LABEL (insn)))
1183 if (--LABEL_NUSES (fallthrough_label) == 0)
1184 delete_insn (fallthrough_label);
1187 /* Simplify if (...) {... x = 1;} if (x) ...
1189 We recognize this case backwards.
1191 TEMP is the test of `x';
1192 TEMP1 is the assignment to `x' at the end of the
1193 previous statement. */
1194 /* @@ This should call get_condition to find the values being
1195 compared, instead of looking for a COMPARE insn when HAVE_cc0
1196 is not defined. This would allow it to work on the m88k. */
1197 /* @@ This optimization is only safe before cse is run if HAVE_cc0
1198 is not defined and the condition is tested by a separate compare
1199 insn. This is because the code below assumes that the result
1200 of the compare dies in the following branch. */
1202 /* ??? This has to be turned off. The problem is that the
1203 unconditional jump might indirectly end up branching to the
1204 label between TEMP1 and TEMP. We can't detect this, in general,
1205 since it may become a jump to there after further optimizations.
1206 If that jump is done, it will be deleted, so we will retry
1207 this optimization in the next pass, thus an infinite loop.
1209 The present code prevents this by putting the jump after the
1210 label, but this is not logically correct. */
1212 else if (this_is_condjump
1213 /* Safe to skip USE and CLOBBER insns here
1214 since they will not be deleted. */
1215 && (temp = prev_active_insn (insn))
1216 && no_labels_between_p (temp, insn)
1217 && GET_CODE (temp) == INSN
1218 && GET_CODE (PATTERN (temp)) == SET
1220 && sets_cc0_p (PATTERN (temp)) == 1
1221 && GET_CODE (SET_SRC (PATTERN (temp))) == REG
1223 /* Temp must be a compare insn, we can not accept a register
1224 to register move here, since it may not be simply a
1226 && GET_CODE (SET_SRC (PATTERN (temp))) == COMPARE
1227 && XEXP (SET_SRC (PATTERN (temp)), 1) == const0_rtx
1228 && GET_CODE (XEXP (SET_SRC (PATTERN (temp)), 0)) == REG
1229 && GET_CODE (SET_DEST (PATTERN (temp))) == REG
1230 && insn == find_next_ref (SET_DEST (PATTERN (temp)), temp)
1232 /* May skip USE or CLOBBER insns here
1233 for checking for opportunity, since we
1234 take care of them later. */
1235 && (temp1 = prev_active_insn (temp))
1236 && GET_CODE (temp1) == INSN
1237 && GET_CODE (PATTERN (temp1)) == SET
1239 && SET_SRC (PATTERN (temp)) == SET_DEST (PATTERN (temp1))
1241 && (XEXP (SET_SRC (PATTERN (temp)), 0)
1242 == SET_DEST (PATTERN (temp1)))
1244 && CONSTANT_P (SET_SRC (PATTERN (temp1)))
1245 /* If this isn't true, cse will do the job. */
1246 && ! no_labels_between_p (temp1, temp))
1248 /* Get the if_then_else from the condjump. */
1249 rtx choice = SET_SRC (PATTERN (insn));
1250 if (GET_CODE (choice) == IF_THEN_ELSE
1251 && (GET_CODE (XEXP (choice, 0)) == EQ
1252 || GET_CODE (XEXP (choice, 0)) == NE))
1254 int want_nonzero = (GET_CODE (XEXP (choice, 0)) == NE);
1259 /* Get the place that condjump will jump to
1260 if it is reached from here. */
1261 if ((SET_SRC (PATTERN (temp1)) != const0_rtx)
1263 ultimate = XEXP (choice, 1);
1265 ultimate = XEXP (choice, 2);
1266 /* Get it as a CODE_LABEL. */
1267 if (ultimate == pc_rtx)
1268 ultimate = get_label_after (insn);
1270 /* Get the label out of the LABEL_REF. */
1271 ultimate = XEXP (ultimate, 0);
1273 /* Insert the jump immediately before TEMP, specifically
1274 after the label that is between TEMP1 and TEMP. */
1275 last_insn = PREV_INSN (temp);
1277 /* If we would be branching to the next insn, the jump
1278 would immediately be deleted and the re-inserted in
1279 a subsequent pass over the code. So don't do anything
1281 if (next_active_insn (last_insn)
1282 != next_active_insn (ultimate))
1284 emit_barrier_after (last_insn);
1285 p = emit_jump_insn_after (gen_jump (ultimate),
1287 JUMP_LABEL (p) = ultimate;
1288 ++LABEL_NUSES (ultimate);
1289 if (INSN_UID (ultimate) < max_jump_chain
1290 && INSN_CODE (p) < max_jump_chain)
1292 jump_chain[INSN_UID (p)]
1293 = jump_chain[INSN_UID (ultimate)];
1294 jump_chain[INSN_UID (ultimate)] = p;
1302 /* Detect a conditional jump going to the same place
1303 as an immediately following unconditional jump. */
1304 else if (this_is_condjump
1305 && (temp = next_active_insn (insn)) != 0
1306 && simplejump_p (temp)
1307 && (next_active_insn (JUMP_LABEL (insn))
1308 == next_active_insn (JUMP_LABEL (temp))))
1314 /* Detect a conditional jump jumping over an unconditional jump. */
1316 else if (this_is_condjump && ! this_is_simplejump
1317 && reallabelprev != 0
1318 && GET_CODE (reallabelprev) == JUMP_INSN
1319 && prev_active_insn (reallabelprev) == insn
1320 && no_labels_between_p (insn, reallabelprev)
1321 && simplejump_p (reallabelprev))
1323 /* When we invert the unconditional jump, we will be
1324 decrementing the usage count of its old label.
1325 Make sure that we don't delete it now because that
1326 might cause the following code to be deleted. */
1327 rtx prev_uses = prev_nonnote_insn (reallabelprev);
1328 rtx prev_label = JUMP_LABEL (insn);
1330 ++LABEL_NUSES (prev_label);
1332 if (invert_jump (insn, JUMP_LABEL (reallabelprev)))
1334 /* It is very likely that if there are USE insns before
1335 this jump, they hold REG_DEAD notes. These REG_DEAD
1336 notes are no longer valid due to this optimization,
1337 and will cause the life-analysis that following passes
1338 (notably delayed-branch scheduling) to think that
1339 these registers are dead when they are not.
1341 To prevent this trouble, we just remove the USE insns
1342 from the insn chain. */
1344 while (prev_uses && GET_CODE (prev_uses) == INSN
1345 && GET_CODE (PATTERN (prev_uses)) == USE)
1347 rtx useless = prev_uses;
1348 prev_uses = prev_nonnote_insn (prev_uses);
1349 delete_insn (useless);
1352 delete_insn (reallabelprev);
1357 /* We can now safely delete the label if it is unreferenced
1358 since the delete_insn above has deleted the BARRIER. */
1359 if (--LABEL_NUSES (prev_label) == 0)
1360 delete_insn (prev_label);
1365 /* Detect a jump to a jump. */
1367 nlabel = follow_jumps (JUMP_LABEL (insn));
1368 if (nlabel != JUMP_LABEL (insn)
1369 && redirect_jump (insn, nlabel))
1375 /* Look for if (foo) bar; else break; */
1376 /* The insns look like this:
1377 insn = condjump label1;
1378 ...range1 (some insns)...
1381 ...range2 (some insns)...
1382 jump somewhere unconditionally
1385 rtx label1 = next_label (insn);
1386 rtx range1end = label1 ? prev_active_insn (label1) : 0;
1387 /* Don't do this optimization on the first round, so that
1388 jump-around-a-jump gets simplified before we ask here
1389 whether a jump is unconditional.
1391 Also don't do it when we are called after reload since
1392 it will confuse reorg. */
1394 && (reload_completed ? ! flag_delayed_branch : 1)
1395 /* Make sure INSN is something we can invert. */
1396 && condjump_p (insn)
1398 && JUMP_LABEL (insn) == label1
1399 && LABEL_NUSES (label1) == 1
1400 && GET_CODE (range1end) == JUMP_INSN
1401 && simplejump_p (range1end))
1403 rtx label2 = next_label (label1);
1404 rtx range2end = label2 ? prev_active_insn (label2) : 0;
1405 if (range1end != range2end
1406 && JUMP_LABEL (range1end) == label2
1407 && GET_CODE (range2end) == JUMP_INSN
1408 && GET_CODE (NEXT_INSN (range2end)) == BARRIER
1409 /* Invert the jump condition, so we
1410 still execute the same insns in each case. */
1411 && invert_jump (insn, label1))
1413 rtx range1beg = next_active_insn (insn);
1414 rtx range2beg = next_active_insn (label1);
1415 rtx range1after, range2after;
1416 rtx range1before, range2before;
1418 /* Include in each range any line number before it. */
1419 while (PREV_INSN (range1beg)
1420 && GET_CODE (PREV_INSN (range1beg)) == NOTE
1421 && NOTE_LINE_NUMBER (PREV_INSN (range1beg)) > 0)
1422 range1beg = PREV_INSN (range1beg);
1424 while (PREV_INSN (range2beg)
1425 && GET_CODE (PREV_INSN (range2beg)) == NOTE
1426 && NOTE_LINE_NUMBER (PREV_INSN (range2beg)) > 0)
1427 range2beg = PREV_INSN (range2beg);
1429 /* Don't move NOTEs for blocks or loops; shift them
1430 outside the ranges, where they'll stay put. */
1431 range1beg = squeeze_notes (range1beg, range1end);
1432 range2beg = squeeze_notes (range2beg, range2end);
1434 /* Get current surrounds of the 2 ranges. */
1435 range1before = PREV_INSN (range1beg);
1436 range2before = PREV_INSN (range2beg);
1437 range1after = NEXT_INSN (range1end);
1438 range2after = NEXT_INSN (range2end);
1440 /* Splice range2 where range1 was. */
1441 NEXT_INSN (range1before) = range2beg;
1442 PREV_INSN (range2beg) = range1before;
1443 NEXT_INSN (range2end) = range1after;
1444 PREV_INSN (range1after) = range2end;
1445 /* Splice range1 where range2 was. */
1446 NEXT_INSN (range2before) = range1beg;
1447 PREV_INSN (range1beg) = range2before;
1448 NEXT_INSN (range1end) = range2after;
1449 PREV_INSN (range2after) = range1end;
1456 /* Now that the jump has been tensioned,
1457 try cross jumping: check for identical code
1458 before the jump and before its target label. */
1460 /* First, cross jumping of conditional jumps: */
1462 if (cross_jump && condjump_p (insn))
1464 rtx newjpos, newlpos;
1465 rtx x = prev_real_insn (JUMP_LABEL (insn));
1467 /* A conditional jump may be crossjumped
1468 only if the place it jumps to follows
1469 an opposing jump that comes back here. */
1471 if (x != 0 && ! jump_back_p (x, insn))
1472 /* We have no opposing jump;
1473 cannot cross jump this insn. */
1477 /* TARGET is nonzero if it is ok to cross jump
1478 to code before TARGET. If so, see if matches. */
1480 find_cross_jump (insn, x, 2,
1481 &newjpos, &newlpos);
1485 do_cross_jump (insn, newjpos, newlpos);
1486 /* Make the old conditional jump
1487 into an unconditional one. */
1488 SET_SRC (PATTERN (insn))
1489 = gen_rtx (LABEL_REF, VOIDmode, JUMP_LABEL (insn));
1490 INSN_CODE (insn) = -1;
1491 emit_barrier_after (insn);
1492 /* Add to jump_chain unless this is a new label
1493 whose UID is too large. */
1494 if (INSN_UID (JUMP_LABEL (insn)) < max_jump_chain)
1496 jump_chain[INSN_UID (insn)]
1497 = jump_chain[INSN_UID (JUMP_LABEL (insn))];
1498 jump_chain[INSN_UID (JUMP_LABEL (insn))] = insn;
1505 /* Cross jumping of unconditional jumps:
1506 a few differences. */
1508 if (cross_jump && simplejump_p (insn))
1510 rtx newjpos, newlpos;
1515 /* TARGET is nonzero if it is ok to cross jump
1516 to code before TARGET. If so, see if matches. */
1517 find_cross_jump (insn, JUMP_LABEL (insn), 1,
1518 &newjpos, &newlpos);
1520 /* If cannot cross jump to code before the label,
1521 see if we can cross jump to another jump to
1523 /* Try each other jump to this label. */
1524 if (INSN_UID (JUMP_LABEL (insn)) < max_uid)
1525 for (target = jump_chain[INSN_UID (JUMP_LABEL (insn))];
1526 target != 0 && newjpos == 0;
1527 target = jump_chain[INSN_UID (target)])
1529 && JUMP_LABEL (target) == JUMP_LABEL (insn)
1530 /* Ignore TARGET if it's deleted. */
1531 && ! INSN_DELETED_P (target))
1532 find_cross_jump (insn, target, 2,
1533 &newjpos, &newlpos);
1537 do_cross_jump (insn, newjpos, newlpos);
1543 /* This code was dead in the previous jump.c! */
1544 if (cross_jump && GET_CODE (PATTERN (insn)) == RETURN)
1546 /* Return insns all "jump to the same place"
1547 so we can cross-jump between any two of them. */
1549 rtx newjpos, newlpos, target;
1553 /* If cannot cross jump to code before the label,
1554 see if we can cross jump to another jump to
1556 /* Try each other jump to this label. */
1557 for (target = jump_chain[0];
1558 target != 0 && newjpos == 0;
1559 target = jump_chain[INSN_UID (target)])
1561 && ! INSN_DELETED_P (target)
1562 && GET_CODE (PATTERN (target)) == RETURN)
1563 find_cross_jump (insn, target, 2,
1564 &newjpos, &newlpos);
1568 do_cross_jump (insn, newjpos, newlpos);
1579 /* Delete extraneous line number notes.
1580 Note that two consecutive notes for different lines are not really
1581 extraneous. There should be some indication where that line belonged,
1582 even if it became empty. */
1587 for (insn = f; insn; insn = NEXT_INSN (insn))
1588 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) >= 0)
1590 /* Delete this note if it is identical to previous note. */
1592 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last_note)
1593 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last_note))
1603 /* See if there is still a NOTE_INSN_FUNCTION_END in this function.
1604 If so, delete it, and record that this function can drop off the end. */
1610 /* One label can follow the end-note: the return label. */
1611 && ((GET_CODE (insn) == CODE_LABEL && n_labels-- > 0)
1612 /* Ordinary insns can follow it if returning a structure. */
1613 || GET_CODE (insn) == INSN
1614 /* If machine uses explicit RETURN insns, no epilogue,
1615 then one of them follows the note. */
1616 || (GET_CODE (insn) == JUMP_INSN
1617 && GET_CODE (PATTERN (insn)) == RETURN)
1618 /* Other kinds of notes can follow also. */
1619 || (GET_CODE (insn) == NOTE
1620 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END)))
1621 insn = PREV_INSN (insn);
1624 /* Report if control can fall through at the end of the function. */
1625 if (insn && GET_CODE (insn) == NOTE
1626 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END)
1632 /* Show JUMP_CHAIN no longer valid. */
1636 /* LOOP_START is a NOTE_INSN_LOOP_BEG note that is followed by an unconditional
1637 jump. Assume that this unconditional jump is to the exit test code. If
1638 the code is sufficiently simple, make a copy of it before INSN,
1639 followed by a jump to the exit of the loop. Then delete the unconditional
1642 Note that it is possible we can get confused here if the jump immediately
1643 after the loop start branches outside the loop but within an outer loop.
1644 If we are near the exit of that loop, we will copy its exit test. This
1645 will not generate incorrect code, but could suppress some optimizations.
1646 However, such cases are degenerate loops anyway.
1648 Return 1 if we made the change, else 0.
1650 This is only safe immediately after a regscan pass because it uses the
1651 values of regno_first_uid and regno_last_uid. */
1654 duplicate_loop_exit_test (loop_start)
1660 rtx exitcode = NEXT_INSN (JUMP_LABEL (next_nonnote_insn (loop_start)));
1662 int max_reg = max_reg_num ();
1665 /* Scan the exit code. We do not perform this optimization if any insn:
1669 has a REG_RETVAL or REG_LIBCALL note (hard to adjust)
1670 is a NOTE_INSN_LOOP_BEG because this means we have a nested loop
1671 is a NOTE_INSN_BLOCK_{BEG,END} because duplicating these notes
1674 Also, don't do this if the exit code is more than 20 insns. */
1676 for (insn = exitcode;
1678 && ! (GET_CODE (insn) == NOTE
1679 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END);
1680 insn = NEXT_INSN (insn))
1682 switch (GET_CODE (insn))
1688 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG
1689 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
1690 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
1695 if (++num_insns > 20
1696 || find_reg_note (insn, REG_RETVAL, 0)
1697 || find_reg_note (insn, REG_LIBCALL, 0))
1703 /* Unless INSN is zero, we can do the optimization. */
1709 /* See if any insn sets a register only used in the loop exit code and
1710 not a user variable. If so, replace it with a new register. */
1711 for (insn = exitcode; insn != lastexit; insn = NEXT_INSN (insn))
1712 if (GET_CODE (insn) == INSN
1713 && (set = single_set (insn)) != 0
1714 && GET_CODE (SET_DEST (set)) == REG
1715 && REGNO (SET_DEST (set)) >= FIRST_PSEUDO_REGISTER
1716 && regno_first_uid[REGNO (SET_DEST (set))] == INSN_UID (insn))
1718 for (p = NEXT_INSN (insn); p != lastexit; p = NEXT_INSN (p))
1719 if (regno_last_uid[REGNO (SET_DEST (set))] == INSN_UID (p))
1724 /* We can do the replacement. Allocate reg_map if this is the
1725 first replacement we found. */
1728 reg_map = (rtx *) alloca (max_reg * sizeof (rtx));
1729 bzero (reg_map, max_reg * sizeof (rtx));
1732 REG_LOOP_TEST_P (SET_DEST (set)) = 1;
1734 reg_map[REGNO (SET_DEST (set))]
1735 = gen_reg_rtx (GET_MODE (SET_DEST (set)));
1739 /* Now copy each insn. */
1740 for (insn = exitcode; insn != lastexit; insn = NEXT_INSN (insn))
1741 switch (GET_CODE (insn))
1744 copy = emit_barrier_before (loop_start);
1747 /* Only copy line-number notes. */
1748 if (NOTE_LINE_NUMBER (insn) >= 0)
1750 copy = emit_note_before (NOTE_LINE_NUMBER (insn), loop_start);
1751 NOTE_SOURCE_FILE (copy) = NOTE_SOURCE_FILE (insn);
1756 copy = emit_insn_before (copy_rtx (PATTERN (insn)), loop_start);
1758 replace_regs (PATTERN (copy), reg_map, max_reg, 1);
1760 mark_jump_label (PATTERN (copy), copy, 0);
1762 /* Copy all REG_NOTES except REG_LABEL since mark_jump_label will
1764 for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
1765 if (REG_NOTE_KIND (link) != REG_LABEL)
1767 = copy_rtx (gen_rtx (EXPR_LIST, REG_NOTE_KIND (link),
1768 XEXP (link, 0), REG_NOTES (copy)));
1769 if (reg_map && REG_NOTES (copy))
1770 replace_regs (REG_NOTES (copy), reg_map, max_reg, 1);
1774 copy = emit_jump_insn_before (copy_rtx (PATTERN (insn)), loop_start);
1776 replace_regs (PATTERN (copy), reg_map, max_reg, 1);
1777 mark_jump_label (PATTERN (copy), copy, 0);
1778 if (REG_NOTES (insn))
1780 REG_NOTES (copy) = copy_rtx (REG_NOTES (insn));
1782 replace_regs (REG_NOTES (copy), reg_map, max_reg, 1);
1785 /* If this is a simple jump, add it to the jump chain. */
1787 if (INSN_UID (copy) < max_jump_chain && JUMP_LABEL (copy)
1788 && simplejump_p (copy))
1790 jump_chain[INSN_UID (copy)]
1791 = jump_chain[INSN_UID (JUMP_LABEL (copy))];
1792 jump_chain[INSN_UID (JUMP_LABEL (copy))] = copy;
1800 /* Now clean up by emitting a jump to the end label and deleting the jump
1801 at the start of the loop. */
1802 if (GET_CODE (copy) != BARRIER)
1804 copy = emit_jump_insn_before (gen_jump (get_label_after (insn)),
1806 mark_jump_label (PATTERN (copy), copy, 0);
1807 if (INSN_UID (copy) < max_jump_chain
1808 && INSN_UID (JUMP_LABEL (copy)) < max_jump_chain)
1810 jump_chain[INSN_UID (copy)]
1811 = jump_chain[INSN_UID (JUMP_LABEL (copy))];
1812 jump_chain[INSN_UID (JUMP_LABEL (copy))] = copy;
1814 emit_barrier_before (loop_start);
1817 delete_insn (next_nonnote_insn (loop_start));
1819 /* Mark the exit code as the virtual top of the converted loop. */
1820 emit_note_before (NOTE_INSN_LOOP_VTOP, exitcode);
1825 /* Move all block-beg, block-end, loop-beg, loop-cont, loop-vtop, and
1826 loop-end notes between START and END out before START. Assume that
1827 END is not such a note. START may be such a note. Returns the value
1828 of the new starting insn, which may be different if the original start
1832 squeeze_notes (start, end)
1838 for (insn = start; insn != end; insn = next)
1840 next = NEXT_INSN (insn);
1841 if (GET_CODE (insn) == NOTE
1842 && (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
1843 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
1844 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG
1845 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END
1846 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_CONT
1847 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_VTOP))
1853 rtx prev = PREV_INSN (insn);
1854 PREV_INSN (insn) = PREV_INSN (start);
1855 NEXT_INSN (insn) = start;
1856 NEXT_INSN (PREV_INSN (insn)) = insn;
1857 PREV_INSN (NEXT_INSN (insn)) = insn;
1858 NEXT_INSN (prev) = next;
1859 PREV_INSN (next) = prev;
1867 /* Compare the instructions before insn E1 with those before E2
1868 to find an opportunity for cross jumping.
1869 (This means detecting identical sequences of insns followed by
1870 jumps to the same place, or followed by a label and a jump
1871 to that label, and replacing one with a jump to the other.)
1873 Assume E1 is a jump that jumps to label E2
1874 (that is not always true but it might as well be).
1875 Find the longest possible equivalent sequences
1876 and store the first insns of those sequences into *F1 and *F2.
1877 Store zero there if no equivalent preceding instructions are found.
1879 We give up if we find a label in stream 1.
1880 Actually we could transfer that label into stream 2. */
1883 find_cross_jump (e1, e2, minimum, f1, f2)
1888 register rtx i1 = e1, i2 = e2;
1889 register rtx p1, p2;
1892 rtx last1 = 0, last2 = 0;
1893 rtx afterlast1 = 0, afterlast2 = 0;
1901 i1 = prev_nonnote_insn (i1);
1903 i2 = PREV_INSN (i2);
1904 while (i2 && (GET_CODE (i2) == NOTE || GET_CODE (i2) == CODE_LABEL))
1905 i2 = PREV_INSN (i2);
1910 /* Don't allow the range of insns preceding E1 or E2
1911 to include the other (E2 or E1). */
1912 if (i2 == e1 || i1 == e2)
1915 /* If we will get to this code by jumping, those jumps will be
1916 tensioned to go directly to the new label (before I2),
1917 so this cross-jumping won't cost extra. So reduce the minimum. */
1918 if (GET_CODE (i1) == CODE_LABEL)
1924 if (i2 == 0 || GET_CODE (i1) != GET_CODE (i2))
1931 /* If cross_jump_death_matters is not 0, the insn's mode
1932 indicates whether or not the insn contains any stack-like
1935 if (cross_jump_death_matters && GET_MODE (i1) == QImode)
1937 /* If register stack conversion has already been done, then
1938 death notes must also be compared before it is certain that
1939 the two instruction streams match. */
1942 HARD_REG_SET i1_regset, i2_regset;
1944 CLEAR_HARD_REG_SET (i1_regset);
1945 CLEAR_HARD_REG_SET (i2_regset);
1947 for (note = REG_NOTES (i1); note; note = XEXP (note, 1))
1948 if (REG_NOTE_KIND (note) == REG_DEAD
1949 && STACK_REG_P (XEXP (note, 0)))
1950 SET_HARD_REG_BIT (i1_regset, REGNO (XEXP (note, 0)));
1952 for (note = REG_NOTES (i2); note; note = XEXP (note, 1))
1953 if (REG_NOTE_KIND (note) == REG_DEAD
1954 && STACK_REG_P (XEXP (note, 0)))
1955 SET_HARD_REG_BIT (i2_regset, REGNO (XEXP (note, 0)));
1957 GO_IF_HARD_REG_EQUAL (i1_regset, i2_regset, done);
1966 if (lose || GET_CODE (p1) != GET_CODE (p2)
1967 || ! rtx_renumbered_equal_p (p1, p2))
1969 /* The following code helps take care of G++ cleanups. */
1973 if (!lose && GET_CODE (p1) == GET_CODE (p2)
1974 && ((equiv1 = find_reg_note (i1, REG_EQUAL, 0)) != 0
1975 || (equiv1 = find_reg_note (i1, REG_EQUIV, 0)) != 0)
1976 && ((equiv2 = find_reg_note (i2, REG_EQUAL, 0)) != 0
1977 || (equiv2 = find_reg_note (i2, REG_EQUIV, 0)) != 0)
1978 /* If the equivalences are not to a constant, they may
1979 reference pseudos that no longer exist, so we can't
1981 && CONSTANT_P (XEXP (equiv1, 0))
1982 && rtx_equal_p (XEXP (equiv1, 0), XEXP (equiv2, 0)))
1984 rtx s1 = single_set (i1);
1985 rtx s2 = single_set (i2);
1986 if (s1 != 0 && s2 != 0
1987 && rtx_renumbered_equal_p (SET_DEST (s1), SET_DEST (s2)))
1989 validate_change (i1, &SET_SRC (s1), XEXP (equiv1, 0), 1);
1990 validate_change (i2, &SET_SRC (s2), XEXP (equiv2, 0), 1);
1991 if (! rtx_renumbered_equal_p (p1, p2))
1993 else if (apply_change_group ())
1998 /* Insns fail to match; cross jumping is limited to the following
2002 /* Don't allow the insn after a compare to be shared by
2003 cross-jumping unless the compare is also shared.
2004 Here, if either of these non-matching insns is a compare,
2005 exclude the following insn from possible cross-jumping. */
2006 if (sets_cc0_p (p1) || sets_cc0_p (p2))
2007 last1 = afterlast1, last2 = afterlast2, ++minimum;
2010 /* If cross-jumping here will feed a jump-around-jump
2011 optimization, this jump won't cost extra, so reduce
2013 if (GET_CODE (i1) == JUMP_INSN
2015 && prev_real_insn (JUMP_LABEL (i1)) == e1)
2021 if (GET_CODE (p1) != USE && GET_CODE (p1) != CLOBBER)
2023 /* Ok, this insn is potentially includable in a cross-jump here. */
2024 afterlast1 = last1, afterlast2 = last2;
2025 last1 = i1, last2 = i2, --minimum;
2029 /* We have to be careful that we do not cross-jump into the middle of
2030 USE-CALL_INSN-CLOBBER sequence. This sequence is used instead of
2031 putting the USE and CLOBBERs inside the CALL_INSN. The delay slot
2032 scheduler needs to know what registers are used and modified by the
2033 CALL_INSN and needs the adjacent USE and CLOBBERs to do so.
2035 ??? At some point we should probably change this so that these are
2036 part of the CALL_INSN. The way we are doing it now is a kludge that
2037 is now causing trouble. */
2039 if (last1 != 0 && GET_CODE (last1) == CALL_INSN
2040 && (prev1 = prev_nonnote_insn (last1))
2041 && GET_CODE (prev1) == INSN
2042 && GET_CODE (PATTERN (prev1)) == USE)
2044 /* Remove this CALL_INSN from the range we can cross-jump. */
2045 last1 = next_real_insn (last1);
2046 last2 = next_real_insn (last2);
2051 /* Skip past CLOBBERS since they may be right after a CALL_INSN. It
2052 isn't worth checking for the CALL_INSN. */
2053 while (last1 != 0 && GET_CODE (PATTERN (last1)) == CLOBBER)
2054 last1 = next_real_insn (last1), last2 = next_real_insn (last2);
2056 if (minimum <= 0 && last1 != 0 && last1 != e1)
2057 *f1 = last1, *f2 = last2;
2061 do_cross_jump (insn, newjpos, newlpos)
2062 rtx insn, newjpos, newlpos;
2064 /* Find an existing label at this point
2065 or make a new one if there is none. */
2066 register rtx label = get_label_before (newlpos);
2068 /* Make the same jump insn jump to the new point. */
2069 if (GET_CODE (PATTERN (insn)) == RETURN)
2071 /* Remove from jump chain of returns. */
2072 delete_from_jump_chain (insn);
2073 /* Change the insn. */
2074 PATTERN (insn) = gen_jump (label);
2075 INSN_CODE (insn) = -1;
2076 JUMP_LABEL (insn) = label;
2077 LABEL_NUSES (label)++;
2078 /* Add to new the jump chain. */
2079 if (INSN_UID (label) < max_jump_chain
2080 && INSN_UID (insn) < max_jump_chain)
2082 jump_chain[INSN_UID (insn)] = jump_chain[INSN_UID (label)];
2083 jump_chain[INSN_UID (label)] = insn;
2087 redirect_jump (insn, label);
2089 /* Delete the matching insns before the jump. Also, remove any REG_EQUAL
2090 or REG_EQUIV note in the NEWLPOS stream that isn't also present in
2091 the NEWJPOS stream. */
2093 while (newjpos != insn)
2097 for (lnote = REG_NOTES (newlpos); lnote; lnote = XEXP (lnote, 1))
2098 if ((REG_NOTE_KIND (lnote) == REG_EQUAL
2099 || REG_NOTE_KIND (lnote) == REG_EQUIV)
2100 && ! find_reg_note (newjpos, REG_EQUAL, XEXP (lnote, 0))
2101 && ! find_reg_note (newjpos, REG_EQUIV, XEXP (lnote, 0)))
2102 remove_note (newlpos, lnote);
2104 delete_insn (newjpos);
2105 newjpos = next_real_insn (newjpos);
2106 newlpos = next_real_insn (newlpos);
2110 /* Return the label before INSN, or put a new label there. */
2113 get_label_before (insn)
2118 /* Find an existing label at this point
2119 or make a new one if there is none. */
2120 label = prev_nonnote_insn (insn);
2122 if (label == 0 || GET_CODE (label) != CODE_LABEL)
2124 rtx prev = PREV_INSN (insn);
2126 /* Don't put a label between a CALL_INSN and USE insns that preceed
2129 if (GET_CODE (insn) == CALL_INSN
2130 || (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE
2131 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN))
2132 while (GET_CODE (prev) == INSN && GET_CODE (PATTERN (prev)) == USE)
2133 prev = PREV_INSN (prev);
2135 label = gen_label_rtx ();
2136 emit_label_after (label, prev);
2137 LABEL_NUSES (label) = 0;
2142 /* Return the label after INSN, or put a new label there. */
2145 get_label_after (insn)
2150 /* Find an existing label at this point
2151 or make a new one if there is none. */
2152 label = next_nonnote_insn (insn);
2154 if (label == 0 || GET_CODE (label) != CODE_LABEL)
2156 /* Don't put a label between a CALL_INSN and CLOBBER insns
2159 if (GET_CODE (insn) == CALL_INSN
2160 || (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE
2161 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN))
2162 while (GET_CODE (NEXT_INSN (insn)) == INSN
2163 && GET_CODE (PATTERN (NEXT_INSN (insn))) == CLOBBER)
2164 insn = NEXT_INSN (insn);
2166 label = gen_label_rtx ();
2167 emit_label_after (label, insn);
2168 LABEL_NUSES (label) = 0;
2173 /* Return 1 if INSN is a jump that jumps to right after TARGET
2174 only on the condition that TARGET itself would drop through.
2175 Assumes that TARGET is a conditional jump. */
2178 jump_back_p (insn, target)
2182 enum rtx_code codei, codet;
2184 if (simplejump_p (insn) || ! condjump_p (insn)
2185 || simplejump_p (target)
2186 || target != prev_real_insn (JUMP_LABEL (insn)))
2189 cinsn = XEXP (SET_SRC (PATTERN (insn)), 0);
2190 ctarget = XEXP (SET_SRC (PATTERN (target)), 0);
2192 codei = GET_CODE (cinsn);
2193 codet = GET_CODE (ctarget);
2195 if (XEXP (SET_SRC (PATTERN (insn)), 1) == pc_rtx)
2197 if (! can_reverse_comparison_p (cinsn, insn))
2199 codei = reverse_condition (codei);
2202 if (XEXP (SET_SRC (PATTERN (target)), 2) == pc_rtx)
2204 if (! can_reverse_comparison_p (ctarget, target))
2206 codet = reverse_condition (codet);
2209 return (codei == codet
2210 && rtx_renumbered_equal_p (XEXP (cinsn, 0), XEXP (ctarget, 0))
2211 && rtx_renumbered_equal_p (XEXP (cinsn, 1), XEXP (ctarget, 1)));
2214 /* Given a comparison, COMPARISON, inside a conditional jump insn, INSN,
2215 return non-zero if it is safe to reverse this comparison. It is if our
2216 floating-point is not IEEE, if this is an NE or EQ comparison, or if
2217 this is known to be an integer comparison. */
2220 can_reverse_comparison_p (comparison, insn)
2226 /* If this is not actually a comparison, we can't reverse it. */
2227 if (GET_RTX_CLASS (GET_CODE (comparison)) != '<')
2230 if (TARGET_FLOAT_FORMAT != IEEE_FLOAT_FORMAT
2231 /* If this is an NE comparison, it is safe to reverse it to an EQ
2232 comparison and vice versa, even for floating point. If no operands
2233 are NaNs, the reversal is valid. If some operand is a NaN, EQ is
2234 always false and NE is always true, so the reversal is also valid. */
2235 || GET_CODE (comparison) == NE
2236 || GET_CODE (comparison) == EQ)
2239 arg0 = XEXP (comparison, 0);
2241 /* Make sure ARG0 is one of the actual objects being compared. If we
2242 can't do this, we can't be sure the comparison can be reversed.
2244 Handle cc0 and a MODE_CC register. */
2245 if ((GET_CODE (arg0) == REG && GET_MODE_CLASS (GET_MODE (arg0)) == MODE_CC)
2251 rtx prev = prev_nonnote_insn (insn);
2252 rtx set = single_set (prev);
2254 if (set == 0 || SET_DEST (set) != arg0)
2257 arg0 = SET_SRC (set);
2259 if (GET_CODE (arg0) == COMPARE)
2260 arg0 = XEXP (arg0, 0);
2263 /* We can reverse this if ARG0 is a CONST_INT or if its mode is
2264 not VOIDmode and neither a MODE_CC nor MODE_FLOAT type. */
2265 return (GET_CODE (arg0) == CONST_INT
2266 || (GET_MODE (arg0) != VOIDmode
2267 && GET_MODE_CLASS (GET_MODE (arg0)) != MODE_CC
2268 && GET_MODE_CLASS (GET_MODE (arg0)) != MODE_FLOAT));
2271 /* Given an rtx-code for a comparison, return the code
2272 for the negated comparison.
2273 WATCH OUT! reverse_condition is not safe to use on a jump
2274 that might be acting on the results of an IEEE floating point comparison,
2275 because of the special treatment of non-signaling nans in comparisons.
2276 Use can_reverse_comparison_p to be sure. */
2279 reverse_condition (code)
2320 /* Similar, but return the code when two operands of a comparison are swapped.
2321 This IS safe for IEEE floating-point. */
2324 swap_condition (code)
2363 /* Given a comparison CODE, return the corresponding unsigned comparison.
2364 If CODE is an equality comparison or already an unsigned comparison,
2365 CODE is returned. */
2368 unsigned_condition (code)
2398 /* Similarly, return the signed version of a comparison. */
2401 signed_condition (code)
2431 /* Return non-zero if CODE1 is more strict than CODE2, i.e., if the
2432 truth of CODE1 implies the truth of CODE2. */
2435 comparison_dominates_p (code1, code2)
2436 enum rtx_code code1, code2;
2444 if (code2 == LE || code2 == LEU || code2 == GE || code2 == GEU)
2472 /* Return 1 if INSN is an unconditional jump and nothing else. */
2478 return (GET_CODE (insn) == JUMP_INSN
2479 && GET_CODE (PATTERN (insn)) == SET
2480 && GET_CODE (SET_DEST (PATTERN (insn))) == PC
2481 && GET_CODE (SET_SRC (PATTERN (insn))) == LABEL_REF);
2484 /* Return nonzero if INSN is a (possibly) conditional jump
2485 and nothing more. */
2491 register rtx x = PATTERN (insn);
2492 if (GET_CODE (x) != SET)
2494 if (GET_CODE (SET_DEST (x)) != PC)
2496 if (GET_CODE (SET_SRC (x)) == LABEL_REF)
2498 if (GET_CODE (SET_SRC (x)) != IF_THEN_ELSE)
2500 if (XEXP (SET_SRC (x), 2) == pc_rtx
2501 && (GET_CODE (XEXP (SET_SRC (x), 1)) == LABEL_REF
2502 || GET_CODE (XEXP (SET_SRC (x), 1)) == RETURN))
2504 if (XEXP (SET_SRC (x), 1) == pc_rtx
2505 && (GET_CODE (XEXP (SET_SRC (x), 2)) == LABEL_REF
2506 || GET_CODE (XEXP (SET_SRC (x), 2)) == RETURN))
2511 /* Return 1 if X is an RTX that does nothing but set the condition codes
2512 and CLOBBER or USE registers.
2513 Return -1 if X does explicitly set the condition codes,
2514 but also does other things. */
2521 if (GET_CODE (x) == SET && SET_DEST (x) == cc0_rtx)
2523 if (GET_CODE (x) == PARALLEL)
2527 int other_things = 0;
2528 for (i = XVECLEN (x, 0) - 1; i >= 0; i--)
2530 if (GET_CODE (XVECEXP (x, 0, i)) == SET
2531 && SET_DEST (XVECEXP (x, 0, i)) == cc0_rtx)
2533 else if (GET_CODE (XVECEXP (x, 0, i)) == SET)
2536 return ! sets_cc0 ? 0 : other_things ? -1 : 1;
2544 /* Follow any unconditional jump at LABEL;
2545 return the ultimate label reached by any such chain of jumps.
2546 If LABEL is not followed by a jump, return LABEL.
2547 If the chain loops or we can't find end, return LABEL,
2548 since that tells caller to avoid changing the insn.
2550 If RELOAD_COMPLETED is 0, we do not chain across a NOTE_INSN_LOOP_BEG or
2551 a USE or CLOBBER. */
2554 follow_jumps (label)
2559 register rtx value = label;
2564 && (insn = next_active_insn (value)) != 0
2565 && GET_CODE (insn) == JUMP_INSN
2566 && (JUMP_LABEL (insn) != 0 || GET_CODE (PATTERN (insn)) == RETURN)
2567 && (next = NEXT_INSN (insn))
2568 && GET_CODE (next) == BARRIER);
2571 /* Don't chain through the insn that jumps into a loop
2572 from outside the loop,
2573 since that would create multiple loop entry jumps
2574 and prevent loop optimization. */
2576 if (!reload_completed)
2577 for (tem = value; tem != insn; tem = NEXT_INSN (tem))
2578 if (GET_CODE (tem) == NOTE
2579 && NOTE_LINE_NUMBER (tem) == NOTE_INSN_LOOP_BEG)
2582 /* If we have found a cycle, make the insn jump to itself. */
2583 if (JUMP_LABEL (insn) == label)
2585 value = JUMP_LABEL (insn);
2592 /* Assuming that field IDX of X is a vector of label_refs,
2593 replace each of them by the ultimate label reached by it.
2594 Return nonzero if a change is made.
2595 If IGNORE_LOOPS is 0, we do not chain across a NOTE_INSN_LOOP_BEG. */
2598 tension_vector_labels (x, idx)
2604 for (i = XVECLEN (x, idx) - 1; i >= 0; i--)
2606 register rtx olabel = XEXP (XVECEXP (x, idx, i), 0);
2607 register rtx nlabel = follow_jumps (olabel);
2608 if (nlabel && nlabel != olabel)
2610 XEXP (XVECEXP (x, idx, i), 0) = nlabel;
2611 ++LABEL_NUSES (nlabel);
2612 if (--LABEL_NUSES (olabel) == 0)
2613 delete_insn (olabel);
2620 /* Find all CODE_LABELs referred to in X, and increment their use counts.
2621 If INSN is a JUMP_INSN and there is at least one CODE_LABEL referenced
2622 in INSN, then store one of them in JUMP_LABEL (INSN).
2623 If INSN is an INSN or a CALL_INSN and there is at least one CODE_LABEL
2624 referenced in INSN, add a REG_LABEL note containing that label to INSN.
2625 Also, when there are consecutive labels, canonicalize on the last of them.
2627 Note that two labels separated by a loop-beginning note
2628 must be kept distinct if we have not yet done loop-optimization,
2629 because the gap between them is where loop-optimize
2630 will want to move invariant code to. CROSS_JUMP tells us
2631 that loop-optimization is done with.
2633 Once reload has completed (CROSS_JUMP non-zero), we need not consider
2634 two labels distinct if they are separated by only USE or CLOBBER insns. */
2637 mark_jump_label (x, insn, cross_jump)
2642 register RTX_CODE code = GET_CODE (x);
2661 register rtx label = XEXP (x, 0);
2663 if (GET_CODE (label) != CODE_LABEL)
2665 /* If there are other labels following this one,
2666 replace it with the last of the consecutive labels. */
2667 for (next = NEXT_INSN (label); next; next = NEXT_INSN (next))
2669 if (GET_CODE (next) == CODE_LABEL)
2671 else if (cross_jump && GET_CODE (next) == INSN
2672 && (GET_CODE (PATTERN (next)) == USE
2673 || GET_CODE (PATTERN (next)) == CLOBBER))
2675 else if (GET_CODE (next) != NOTE)
2677 else if (! cross_jump
2678 && (NOTE_LINE_NUMBER (next) == NOTE_INSN_LOOP_BEG
2679 || NOTE_LINE_NUMBER (next) == NOTE_INSN_FUNCTION_END))
2682 XEXP (x, 0) = label;
2683 ++LABEL_NUSES (label);
2686 if (GET_CODE (insn) == JUMP_INSN)
2687 JUMP_LABEL (insn) = label;
2688 else if (! find_reg_note (insn, REG_LABEL, label))
2690 rtx next = next_real_insn (label);
2691 /* Don't record labels that refer to dispatch tables.
2692 This is not necessary, since the tablejump
2693 references the same label.
2694 And if we did record them, flow.c would make worse code. */
2696 || ! (GET_CODE (next) == JUMP_INSN
2697 && (GET_CODE (PATTERN (next)) == ADDR_VEC
2698 || GET_CODE (PATTERN (next)) == ADDR_DIFF_VEC)))
2699 REG_NOTES (insn) = gen_rtx (EXPR_LIST, REG_LABEL, label,
2706 /* Do walk the labels in a vector, but not the first operand of an
2707 ADDR_DIFF_VEC. Don't set the JUMP_LABEL of a vector. */
2711 int eltnum = code == ADDR_DIFF_VEC ? 1 : 0;
2713 for (i = 0; i < XVECLEN (x, eltnum); i++)
2714 mark_jump_label (XVECEXP (x, eltnum, i), 0, cross_jump);
2719 fmt = GET_RTX_FORMAT (code);
2720 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2723 mark_jump_label (XEXP (x, i), insn, cross_jump);
2724 else if (fmt[i] == 'E')
2727 for (j = 0; j < XVECLEN (x, i); j++)
2728 mark_jump_label (XVECEXP (x, i, j), insn, cross_jump);
2733 /* If all INSN does is set the pc, delete it,
2734 and delete the insn that set the condition codes for it
2735 if that's what the previous thing was. */
2741 register rtx x = PATTERN (insn);
2744 if (GET_CODE (x) == SET
2745 && GET_CODE (SET_DEST (x)) == PC)
2747 prev = prev_nonnote_insn (insn);
2749 /* We assume that at this stage
2750 CC's are always set explicitly
2751 and always immediately before the jump that
2752 will use them. So if the previous insn
2753 exists to set the CC's, delete it
2754 (unless it performs auto-increments, etc.). */
2755 if (prev && GET_CODE (prev) == INSN
2756 && sets_cc0_p (PATTERN (prev)))
2758 if (sets_cc0_p (PATTERN (prev)) > 0
2759 && !FIND_REG_INC_NOTE (prev, 0))
2762 /* Otherwise, show that cc0 won't be used. */
2763 REG_NOTES (prev) = gen_rtx (EXPR_LIST, REG_UNUSED,
2764 cc0_rtx, REG_NOTES (prev));
2770 /* If we are running before flow.c, we need do nothing since flow.c
2771 will delete the set of the condition code if it is dead. We also
2772 can't know if the register being used as the condition code is
2773 dead or not at this point.
2775 Otherwise, look at all our REG_DEAD notes. If a previous insn
2776 does nothing other than set a register that dies in this jump,
2777 we can delete the insn. */
2779 for (note = REG_NOTES (insn); note; note = XEXP (note, 1))
2783 if (REG_NOTE_KIND (note) != REG_DEAD
2784 /* Verify that the REG_NOTE has a legal value. */
2785 || GET_CODE (XEXP (note, 0)) != REG)
2788 for (our_prev = prev_nonnote_insn (insn);
2789 our_prev && GET_CODE (our_prev) == INSN;
2790 our_prev = prev_nonnote_insn (our_prev))
2792 /* If we reach a SEQUENCE, it is too complex to try to
2793 do anything with it, so give up. */
2794 if (GET_CODE (PATTERN (our_prev)) == SEQUENCE)
2797 if (GET_CODE (PATTERN (our_prev)) == USE
2798 && GET_CODE (XEXP (PATTERN (our_prev), 0)) == INSN)
2799 /* reorg creates USEs that look like this. We leave them
2800 alone because reorg needs them for its own purposes. */
2803 if (reg_set_p (XEXP (note, 0), PATTERN (our_prev)))
2805 if (FIND_REG_INC_NOTE (our_prev, 0))
2808 if (GET_CODE (PATTERN (our_prev)) == PARALLEL)
2810 /* If we find a SET of something else, we can't
2815 for (i = 0; i < XVECLEN (PATTERN (our_prev), 0); i++)
2817 rtx part = XVECEXP (PATTERN (our_prev), 0, i);
2819 if (GET_CODE (part) == SET
2820 && SET_DEST (part) != XEXP (note, 0))
2824 if (i == XVECLEN (PATTERN (our_prev), 0))
2825 delete_insn (our_prev);
2827 else if (GET_CODE (PATTERN (our_prev)) == SET
2828 && SET_DEST (PATTERN (our_prev)) == XEXP (note, 0))
2829 delete_insn (our_prev);
2834 /* If OUR_PREV references the register that dies here,
2835 it is an additional use. Hence any prior SET isn't
2837 if (reg_overlap_mentioned_p (XEXP (note, 0),
2838 PATTERN (our_prev)))
2844 /* Now delete the jump insn itself. */
2849 /* Delete insn INSN from the chain of insns and update label ref counts.
2850 May delete some following insns as a consequence; may even delete
2851 a label elsewhere and insns that follow it.
2853 Returns the first insn after INSN that was not deleted. */
2859 register rtx next = NEXT_INSN (insn);
2860 register rtx prev = PREV_INSN (insn);
2862 while (next && INSN_DELETED_P (next))
2863 next = NEXT_INSN (next);
2865 /* This insn is already deleted => return first following nondeleted. */
2866 if (INSN_DELETED_P (insn))
2869 /* Mark this insn as deleted. */
2871 INSN_DELETED_P (insn) = 1;
2873 /* If this is an unconditional jump, delete it from the jump chain. */
2874 if (simplejump_p (insn))
2875 delete_from_jump_chain (insn);
2877 /* If instruction is followed by a barrier,
2878 delete the barrier too. */
2880 if (next != 0 && GET_CODE (next) == BARRIER)
2882 INSN_DELETED_P (next) = 1;
2883 next = NEXT_INSN (next);
2886 /* Patch out INSN (and the barrier if any) */
2892 NEXT_INSN (prev) = next;
2893 if (GET_CODE (prev) == INSN && GET_CODE (PATTERN (prev)) == SEQUENCE)
2894 NEXT_INSN (XVECEXP (PATTERN (prev), 0,
2895 XVECLEN (PATTERN (prev), 0) - 1)) = next;
2900 PREV_INSN (next) = prev;
2901 if (GET_CODE (next) == INSN && GET_CODE (PATTERN (next)) == SEQUENCE)
2902 PREV_INSN (XVECEXP (PATTERN (next), 0, 0)) = prev;
2905 if (prev && NEXT_INSN (prev) == 0)
2906 set_last_insn (prev);
2909 /* If deleting a jump, decrement the count of the label,
2910 and delete the label if it is now unused. */
2912 if (GET_CODE (insn) == JUMP_INSN && JUMP_LABEL (insn))
2913 if (--LABEL_NUSES (JUMP_LABEL (insn)) == 0)
2915 /* This can delete NEXT or PREV,
2916 either directly if NEXT is JUMP_LABEL (INSN),
2917 or indirectly through more levels of jumps. */
2918 delete_insn (JUMP_LABEL (insn));
2919 /* I feel a little doubtful about this loop,
2920 but I see no clean and sure alternative way
2921 to find the first insn after INSN that is not now deleted.
2922 I hope this works. */
2923 while (next && INSN_DELETED_P (next))
2924 next = NEXT_INSN (next);
2928 while (prev && (INSN_DELETED_P (prev) || GET_CODE (prev) == NOTE))
2929 prev = PREV_INSN (prev);
2931 /* If INSN was a label and a dispatch table follows it,
2932 delete the dispatch table. The tablejump must have gone already.
2933 It isn't useful to fall through into a table. */
2935 if (GET_CODE (insn) == CODE_LABEL
2936 && NEXT_INSN (insn) != 0
2937 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN
2938 && (GET_CODE (PATTERN (NEXT_INSN (insn))) == ADDR_VEC
2939 || GET_CODE (PATTERN (NEXT_INSN (insn))) == ADDR_DIFF_VEC))
2940 next = delete_insn (NEXT_INSN (insn));
2942 /* If INSN was a label, delete insns following it if now unreachable. */
2944 if (GET_CODE (insn) == CODE_LABEL && prev
2945 && GET_CODE (prev) == BARRIER)
2947 register RTX_CODE code;
2949 && ((code = GET_CODE (next)) == INSN
2950 || code == JUMP_INSN || code == CALL_INSN
2952 || (code == CODE_LABEL && INSN_DELETED_P (next))))
2955 && NOTE_LINE_NUMBER (next) != NOTE_INSN_FUNCTION_END)
2956 next = NEXT_INSN (next);
2957 /* Keep going past other deleted labels to delete what follows. */
2958 else if (code == CODE_LABEL && INSN_DELETED_P (next))
2959 next = NEXT_INSN (next);
2961 /* Note: if this deletes a jump, it can cause more
2962 deletion of unreachable code, after a different label.
2963 As long as the value from this recursive call is correct,
2964 this invocation functions correctly. */
2965 next = delete_insn (next);
2972 /* Advance from INSN till reaching something not deleted
2973 then return that. May return INSN itself. */
2976 next_nondeleted_insn (insn)
2979 while (INSN_DELETED_P (insn))
2980 insn = NEXT_INSN (insn);
2984 /* Delete a range of insns from FROM to TO, inclusive.
2985 This is for the sake of peephole optimization, so assume
2986 that whatever these insns do will still be done by a new
2987 peephole insn that will replace them. */
2990 delete_for_peephole (from, to)
2991 register rtx from, to;
2993 register rtx insn = from;
2997 register rtx next = NEXT_INSN (insn);
2998 register rtx prev = PREV_INSN (insn);
3000 if (GET_CODE (insn) != NOTE)
3002 INSN_DELETED_P (insn) = 1;
3004 /* Patch this insn out of the chain. */
3005 /* We don't do this all at once, because we
3006 must preserve all NOTEs. */
3008 NEXT_INSN (prev) = next;
3011 PREV_INSN (next) = prev;
3019 /* Note that if TO is an unconditional jump
3020 we *do not* delete the BARRIER that follows,
3021 since the peephole that replaces this sequence
3022 is also an unconditional jump in that case. */
3025 /* Invert the condition of the jump JUMP, and make it jump
3026 to label NLABEL instead of where it jumps now. */
3029 invert_jump (jump, nlabel)
3032 register rtx olabel = JUMP_LABEL (jump);
3034 /* We have to either invert the condition and change the label or
3035 do neither. Either operation could fail. We first try to invert
3036 the jump. If that succeeds, we try changing the label. If that fails,
3037 we invert the jump back to what it was. */
3039 if (! invert_exp (PATTERN (jump), jump))
3042 if (redirect_jump (jump, nlabel))
3045 if (! invert_exp (PATTERN (jump), jump))
3046 /* This should just be putting it back the way it was. */
3052 /* Invert the jump condition of rtx X contained in jump insn, INSN.
3054 Return 1 if we can do so, 0 if we cannot find a way to do so that
3055 matches a pattern. */
3058 invert_exp (x, insn)
3062 register RTX_CODE code;
3066 code = GET_CODE (x);
3068 if (code == IF_THEN_ELSE)
3070 register rtx comp = XEXP (x, 0);
3073 /* We can do this in two ways: The preferable way, which can only
3074 be done if this is not an integer comparison, is to reverse
3075 the comparison code. Otherwise, swap the THEN-part and ELSE-part
3076 of the IF_THEN_ELSE. If we can't do either, fail. */
3078 if (can_reverse_comparison_p (comp, insn)
3079 && validate_change (insn, &XEXP (x, 0),
3080 gen_rtx (reverse_condition (GET_CODE (comp)),
3081 GET_MODE (comp), XEXP (comp, 0),
3082 XEXP (comp, 1)), 0))
3086 validate_change (insn, &XEXP (x, 1), XEXP (x, 2), 1);
3087 validate_change (insn, &XEXP (x, 2), tem, 1);
3088 return apply_change_group ();
3091 fmt = GET_RTX_FORMAT (code);
3092 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3095 if (! invert_exp (XEXP (x, i), insn))
3100 for (j = 0; j < XVECLEN (x, i); j++)
3101 if (!invert_exp (XVECEXP (x, i, j), insn))
3109 /* Make jump JUMP jump to label NLABEL instead of where it jumps now.
3110 If the old jump target label is unused as a result,
3111 it and the code following it may be deleted.
3113 If NLABEL is zero, we are to turn the jump into a (possibly conditional)
3116 The return value will be 1 if the change was made, 0 if it wasn't (this
3117 can only occur for NLABEL == 0). */
3120 redirect_jump (jump, nlabel)
3123 register rtx olabel = JUMP_LABEL (jump);
3125 if (nlabel == olabel)
3128 if (! redirect_exp (&PATTERN (jump), olabel, nlabel, jump))
3131 /* If this is an unconditional branch, delete it from the jump_chain of
3132 OLABEL and add it to the jump_chain of NLABEL (assuming both labels
3133 have UID's in range and JUMP_CHAIN is valid). */
3134 if (jump_chain && (simplejump_p (jump)
3135 || GET_CODE (PATTERN (jump)) == RETURN))
3137 int label_index = nlabel ? INSN_UID (nlabel) : 0;
3139 delete_from_jump_chain (jump);
3140 if (label_index < max_jump_chain
3141 && INSN_UID (jump) < max_jump_chain)
3143 jump_chain[INSN_UID (jump)] = jump_chain[label_index];
3144 jump_chain[label_index] = jump;
3148 JUMP_LABEL (jump) = nlabel;
3150 ++LABEL_NUSES (nlabel);
3152 if (olabel && --LABEL_NUSES (olabel) == 0)
3153 delete_insn (olabel);
3158 /* Delete the instruction JUMP from any jump chain it might be on. */
3161 delete_from_jump_chain (jump)
3165 rtx olabel = JUMP_LABEL (jump);
3167 /* Handle unconditional jumps. */
3168 if (jump_chain && olabel != 0
3169 && INSN_UID (olabel) < max_jump_chain
3170 && simplejump_p (jump))
3171 index = INSN_UID (olabel);
3172 /* Handle return insns. */
3173 else if (jump_chain && GET_CODE (PATTERN (jump)) == RETURN)
3177 if (jump_chain[index] == jump)
3178 jump_chain[index] = jump_chain[INSN_UID (jump)];
3183 for (insn = jump_chain[index];
3185 insn = jump_chain[INSN_UID (insn)])
3186 if (jump_chain[INSN_UID (insn)] == jump)
3188 jump_chain[INSN_UID (insn)] = jump_chain[INSN_UID (jump)];
3194 /* If NLABEL is nonzero, throughout the rtx at LOC,
3195 alter (LABEL_REF OLABEL) to (LABEL_REF NLABEL). If OLABEL is
3196 zero, alter (RETURN) to (LABEL_REF NLABEL).
3198 If NLABEL is zero, alter (LABEL_REF OLABEL) to (RETURN) and check
3199 validity with validate_change. Convert (set (pc) (label_ref olabel))
3202 Return 0 if we found a change we would like to make but it is invalid.
3203 Otherwise, return 1. */
3206 redirect_exp (loc, olabel, nlabel, insn)
3211 register rtx x = *loc;
3212 register RTX_CODE code = GET_CODE (x);
3216 if (code == LABEL_REF)
3218 if (XEXP (x, 0) == olabel)
3221 XEXP (x, 0) = nlabel;
3223 return validate_change (insn, loc, gen_rtx (RETURN, VOIDmode), 0);
3227 else if (code == RETURN && olabel == 0)
3229 x = gen_rtx (LABEL_REF, VOIDmode, nlabel);
3230 if (loc == &PATTERN (insn))
3231 x = gen_rtx (SET, VOIDmode, pc_rtx, x);
3232 return validate_change (insn, loc, x, 0);
3235 if (code == SET && nlabel == 0 && SET_DEST (x) == pc_rtx
3236 && GET_CODE (SET_SRC (x)) == LABEL_REF
3237 && XEXP (SET_SRC (x), 0) == olabel)
3238 return validate_change (insn, loc, gen_rtx (RETURN, VOIDmode), 0);
3240 fmt = GET_RTX_FORMAT (code);
3241 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3244 if (! redirect_exp (&XEXP (x, i), olabel, nlabel, insn))
3249 for (j = 0; j < XVECLEN (x, i); j++)
3250 if (! redirect_exp (&XVECEXP (x, i, j), olabel, nlabel, insn))
3258 /* Make jump JUMP jump to label NLABEL, assuming it used to be a tablejump.
3260 If the old jump target label (before the dispatch table) becomes unused,
3261 it and the dispatch table may be deleted. In that case, find the insn
3262 before the jump references that label and delete it and logical sucessors
3266 redirect_tablejump (jump, nlabel)
3269 register rtx olabel = JUMP_LABEL (jump);
3271 /* Add this jump to the jump_chain of NLABEL. */
3272 if (jump_chain && INSN_UID (nlabel) < max_jump_chain
3273 && INSN_UID (jump) < max_jump_chain)
3275 jump_chain[INSN_UID (jump)] = jump_chain[INSN_UID (nlabel)];
3276 jump_chain[INSN_UID (nlabel)] = jump;
3279 PATTERN (jump) = gen_jump (nlabel);
3280 JUMP_LABEL (jump) = nlabel;
3281 ++LABEL_NUSES (nlabel);
3282 INSN_CODE (jump) = -1;
3284 if (--LABEL_NUSES (olabel) == 0)
3286 delete_labelref_insn (jump, olabel, 0);
3287 delete_insn (olabel);
3291 /* Find the insn referencing LABEL that is a logical predecessor of INSN.
3292 If we found one, delete it and then delete this insn if DELETE_THIS is
3293 non-zero. Return non-zero if INSN or a predecessor references LABEL. */
3296 delete_labelref_insn (insn, label, delete_this)
3303 if (GET_CODE (insn) != NOTE
3304 && reg_mentioned_p (label, PATTERN (insn)))
3315 for (link = LOG_LINKS (insn); link; link = XEXP (link, 1))
3316 if (delete_labelref_insn (XEXP (link, 0), label, 1))
3330 /* Like rtx_equal_p except that it considers two REGs as equal
3331 if they renumber to the same value. */
3334 rtx_renumbered_equal_p (x, y)
3338 register RTX_CODE code = GET_CODE (x);
3343 if ((code == REG || (code == SUBREG && GET_CODE (SUBREG_REG (x)) == REG))
3344 && (GET_CODE (y) == REG || (GET_CODE (y) == SUBREG
3345 && GET_CODE (SUBREG_REG (y)) == REG)))
3349 if (GET_MODE (x) != GET_MODE (y))
3352 /* If we haven't done any renumbering, don't
3353 make any assumptions. */
3354 if (reg_renumber == 0)
3355 return rtx_equal_p (x, y);
3359 i = REGNO (SUBREG_REG (x));
3360 if (reg_renumber[i] >= 0)
3361 i = reg_renumber[i];
3362 i += SUBREG_WORD (x);
3367 if (reg_renumber[i] >= 0)
3368 i = reg_renumber[i];
3370 if (GET_CODE (y) == SUBREG)
3372 j = REGNO (SUBREG_REG (y));
3373 if (reg_renumber[j] >= 0)
3374 j = reg_renumber[j];
3375 j += SUBREG_WORD (y);
3380 if (reg_renumber[j] >= 0)
3381 j = reg_renumber[j];
3385 /* Now we have disposed of all the cases
3386 in which different rtx codes can match. */
3387 if (code != GET_CODE (y))
3398 return XINT (x, 0) == XINT (y, 0);
3401 /* Two label-refs are equivalent if they point at labels
3402 in the same position in the instruction stream. */
3403 return (next_real_insn (XEXP (x, 0))
3404 == next_real_insn (XEXP (y, 0)));
3407 return XSTR (x, 0) == XSTR (y, 0);
3410 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent. */
3412 if (GET_MODE (x) != GET_MODE (y))
3415 /* Compare the elements. If any pair of corresponding elements
3416 fail to match, return 0 for the whole things. */
3418 fmt = GET_RTX_FORMAT (code);
3419 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3425 if (XINT (x, i) != XINT (y, i))
3430 if (strcmp (XSTR (x, i), XSTR (y, i)))
3435 if (! rtx_renumbered_equal_p (XEXP (x, i), XEXP (y, i)))
3440 if (XEXP (x, i) != XEXP (y, i))
3447 if (XVECLEN (x, i) != XVECLEN (y, i))
3449 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
3450 if (!rtx_renumbered_equal_p (XVECEXP (x, i, j), XVECEXP (y, i, j)))
3461 /* If X is a hard register or equivalent to one or a subregister of one,
3462 return the hard register number. If X is a pseudo register that was not
3463 assigned a hard register, return the pseudo register number. Otherwise,
3464 return -1. Any rtx is valid for X. */
3470 if (GET_CODE (x) == REG)
3472 if (REGNO (x) >= FIRST_PSEUDO_REGISTER && reg_renumber[REGNO (x)] >= 0)
3473 return reg_renumber[REGNO (x)];
3476 if (GET_CODE (x) == SUBREG)
3478 int base = true_regnum (SUBREG_REG (x));
3479 if (base >= 0 && base < FIRST_PSEUDO_REGISTER)
3480 return SUBREG_WORD (x) + base;
3485 /* Optimize code of the form:
3487 for (x = a[i]; x; ...)
3489 for (x = a[i]; x; ...)
3493 Loop optimize will change the above code into
3497 { ...; if (! (x = ...)) break; }
3500 { ...; if (! (x = ...)) break; }
3503 In general, if the first test fails, the program can branch
3504 directly to `foo' and skip the second try which is doomed to fail.
3505 We run this after loop optimization and before flow analysis. */
3507 /* When comparing the insn patterns, we track the fact that different
3508 pseudo-register numbers may have been used in each computation.
3509 The following array stores an equivalence -- same_regs[I] == J means
3510 that pseudo register I was used in the first set of tests in a context
3511 where J was used in the second set. We also count the number of such
3512 pending equivalences. If nonzero, the expressions really aren't the
3515 static short *same_regs;
3517 static int num_same_regs;
3519 /* Track any registers modified between the target of the first jump and
3520 the second jump. They never compare equal. */
3522 static char *modified_regs;
3524 /* Record if memory was modified. */
3526 static int modified_mem;
3528 /* Called via note_stores on each insn between the target of the first
3529 branch and the second branch. It marks any changed registers. */
3532 mark_modified_reg (dest, x)
3538 if (GET_CODE (dest) == SUBREG)
3539 dest = SUBREG_REG (dest);
3541 if (GET_CODE (dest) == MEM)
3544 if (GET_CODE (dest) != REG)
3547 regno = REGNO (dest);
3548 if (regno >= FIRST_PSEUDO_REGISTER)
3549 modified_regs[regno] = 1;
3551 for (i = 0; i < HARD_REGNO_NREGS (regno, GET_MODE (dest)); i++)
3552 modified_regs[regno + i] = 1;
3555 /* F is the first insn in the chain of insns. */
3558 thread_jumps (f, max_reg, verbose)
3563 /* Basic algorithm is to find a conditional branch,
3564 the label it may branch to, and the branch after
3565 that label. If the two branches test the same condition,
3566 walk back from both branch paths until the insn patterns
3567 differ, or code labels are hit. If we make it back to
3568 the target of the first branch, then we know that the first branch
3569 will either always succeed or always fail depending on the relative
3570 senses of the two branches. So adjust the first branch accordingly
3573 rtx label, b1, b2, t1, t2;
3574 enum rtx_code code1, code2;
3575 rtx b1op0, b1op1, b2op0, b2op1;
3580 /* Allocate register tables and quick-reset table. */
3581 modified_regs = (char *) alloca (max_reg * sizeof (char));
3582 same_regs = (short *) alloca (max_reg * sizeof (short));
3583 all_reset = (short *) alloca (max_reg * sizeof (short));
3584 for (i = 0; i < max_reg; i++)
3591 for (b1 = f; b1; b1 = NEXT_INSN (b1))
3593 /* Get to a candidate branch insn. */
3594 if (GET_CODE (b1) != JUMP_INSN
3595 || ! condjump_p (b1) || simplejump_p (b1)
3596 || JUMP_LABEL (b1) == 0)
3599 bzero (modified_regs, max_reg * sizeof (char));
3602 bcopy (all_reset, same_regs, max_reg * sizeof (short));
3605 label = JUMP_LABEL (b1);
3607 /* Look for a branch after the target. Record any registers and
3608 memory modified between the target and the branch. Stop when we
3609 get to a label since we can't know what was changed there. */
3610 for (b2 = NEXT_INSN (label); b2; b2 = NEXT_INSN (b2))
3612 if (GET_CODE (b2) == CODE_LABEL)
3615 else if (GET_CODE (b2) == JUMP_INSN)
3617 /* If this is an unconditional jump and is the only use of
3618 its target label, we can follow it. */
3619 if (simplejump_p (b2)
3620 && JUMP_LABEL (b2) != 0
3621 && LABEL_NUSES (JUMP_LABEL (b2)) == 1)
3623 b2 = JUMP_LABEL (b2);
3630 if (GET_CODE (b2) != CALL_INSN && GET_CODE (b2) != INSN)
3633 if (GET_CODE (b2) == CALL_INSN)
3636 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3637 if (call_used_regs[i] && ! fixed_regs[i]
3638 && i != STACK_POINTER_REGNUM
3639 && i != FRAME_POINTER_REGNUM
3640 && i != ARG_POINTER_REGNUM)
3641 modified_regs[i] = 1;
3644 note_stores (PATTERN (b2), mark_modified_reg);
3647 /* Check the next candidate branch insn from the label
3650 || GET_CODE (b2) != JUMP_INSN
3652 || ! condjump_p (b2)
3653 || simplejump_p (b2))
3656 /* Get the comparison codes and operands, reversing the
3657 codes if appropriate. If we don't have comparison codes,
3658 we can't do anything. */
3659 b1op0 = XEXP (XEXP (SET_SRC (PATTERN (b1)), 0), 0);
3660 b1op1 = XEXP (XEXP (SET_SRC (PATTERN (b1)), 0), 1);
3661 code1 = GET_CODE (XEXP (SET_SRC (PATTERN (b1)), 0));
3662 if (XEXP (SET_SRC (PATTERN (b1)), 1) == pc_rtx)
3663 code1 = reverse_condition (code1);
3665 b2op0 = XEXP (XEXP (SET_SRC (PATTERN (b2)), 0), 0);
3666 b2op1 = XEXP (XEXP (SET_SRC (PATTERN (b2)), 0), 1);
3667 code2 = GET_CODE (XEXP (SET_SRC (PATTERN (b2)), 0));
3668 if (XEXP (SET_SRC (PATTERN (b2)), 1) == pc_rtx)
3669 code2 = reverse_condition (code2);
3671 /* If they test the same things and knowing that B1 branches
3672 tells us whether or not B2 branches, check if we
3673 can thread the branch. */
3674 if (rtx_equal_for_thread_p (b1op0, b2op0, b2)
3675 && rtx_equal_for_thread_p (b1op1, b2op1, b2)
3676 && (comparison_dominates_p (code1, code2)
3677 || comparison_dominates_p (code1, reverse_condition (code2))))
3679 t1 = prev_nonnote_insn (b1);
3680 t2 = prev_nonnote_insn (b2);
3682 while (t1 != 0 && t2 != 0)
3684 if (t1 == 0 || t2 == 0)
3689 /* We have reached the target of the first branch.
3690 If there are no pending register equivalents,
3691 we know that this branch will either always
3692 succeed (if the senses of the two branches are
3693 the same) or always fail (if not). */
3696 if (num_same_regs != 0)
3699 if (comparison_dominates_p (code1, code2))
3700 new_label = JUMP_LABEL (b2);
3702 new_label = get_label_after (b2);
3704 if (JUMP_LABEL (b1) != new_label
3705 && redirect_jump (b1, new_label))
3710 /* If either of these is not a normal insn (it might be
3711 a JUMP_INSN, CALL_INSN, or CODE_LABEL) we fail. (NOTEs
3712 have already been skipped above.) Similarly, fail
3713 if the insns are different. */
3714 if (GET_CODE (t1) != INSN || GET_CODE (t2) != INSN
3715 || recog_memoized (t1) != recog_memoized (t2)
3716 || ! rtx_equal_for_thread_p (PATTERN (t1),
3720 t1 = prev_nonnote_insn (t1);
3721 t2 = prev_nonnote_insn (t2);
3728 /* This is like RTX_EQUAL_P except that it knows about our handling of
3729 possibly equivalent registers and knows to consider volatile and
3730 modified objects as not equal.
3732 YINSN is the insn containing Y. */
3735 rtx_equal_for_thread_p (x, y, yinsn)
3741 register enum rtx_code code;
3744 code = GET_CODE (x);
3745 /* Rtx's of different codes cannot be equal. */
3746 if (code != GET_CODE (y))
3749 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.
3750 (REG:SI x) and (REG:HI x) are NOT equivalent. */
3752 if (GET_MODE (x) != GET_MODE (y))
3755 /* Handle special-cases first. */
3759 if (REGNO (x) == REGNO (y) && ! modified_regs[REGNO (x)])
3762 /* If neither is user variable or hard register, check for possible
3764 if (REG_USERVAR_P (x) || REG_USERVAR_P (y)
3765 || REGNO (x) < FIRST_PSEUDO_REGISTER
3766 || REGNO (y) < FIRST_PSEUDO_REGISTER)
3769 if (same_regs[REGNO (x)] == -1)
3771 same_regs[REGNO (x)] = REGNO (y);
3774 /* If this is the first time we are seeing a register on the `Y'
3775 side, see if it is the last use. If not, we can't thread the
3776 jump, so mark it as not equivalent. */
3777 if (regno_last_uid[REGNO (y)] != INSN_UID (yinsn))
3783 return (same_regs[REGNO (x)] == REGNO (y));
3788 /* If memory modified or either volatile, not eqivalent.
3789 Else, check address. */
3790 if (modified_mem || MEM_VOLATILE_P (x) || MEM_VOLATILE_P (y))
3793 return rtx_equal_for_thread_p (XEXP (x, 0), XEXP (y, 0), yinsn);
3796 if (MEM_VOLATILE_P (x) || MEM_VOLATILE_P (y))
3802 /* Cancel a pending `same_regs' if setting equivalenced registers.
3803 Then process source. */
3804 if (GET_CODE (SET_DEST (x)) == REG
3805 && GET_CODE (SET_DEST (y)) == REG)
3807 if (same_regs[REGNO (SET_DEST (x))] == REGNO (SET_DEST (y)))
3809 same_regs[REGNO (SET_DEST (x))] = -1;
3812 else if (REGNO (SET_DEST (x)) != REGNO (SET_DEST (y)))
3816 if (rtx_equal_for_thread_p (SET_DEST (x), SET_DEST (y), yinsn) == 0)
3819 return rtx_equal_for_thread_p (SET_SRC (x), SET_SRC (y), yinsn);
3822 return XEXP (x, 0) == XEXP (y, 0);
3825 return XSTR (x, 0) == XSTR (y, 0);
3831 fmt = GET_RTX_FORMAT (code);
3832 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3838 if (XINT (x, i) != XINT (y, i))
3844 /* Two vectors must have the same length. */
3845 if (XVECLEN (x, i) != XVECLEN (y, i))
3848 /* And the corresponding elements must match. */
3849 for (j = 0; j < XVECLEN (x, i); j++)
3850 if (rtx_equal_for_thread_p (XVECEXP (x, i, j),
3851 XVECEXP (y, i, j), yinsn) == 0)
3856 if (rtx_equal_for_thread_p (XEXP (x, i), XEXP (y, i), yinsn) == 0)
3862 if (strcmp (XSTR (x, i), XSTR (y, i)))
3867 /* These are just backpointers, so they don't matter. */
3873 /* It is believed that rtx's at this level will never
3874 contain anything but integers and other rtx's,
3875 except for within LABEL_REFs and SYMBOL_REFs. */