Lines Matching defs:jump
51 3. At the end of the loop, the jump insn is replaced by the
63 somehow extremely lower than the cost of compare & jump, or unless the bct
70 if it is not a decrement and branch jump insn. */
92 by jump.c), and the second entry of the parallel must be a set of
224 additional jump around the loop to ensure an infinite loop.
280 rtx seq, jump, label;
297 jump = get_last_insn ();
298 if (!jump || !JUMP_P (jump))
300 /* The condition is always false and the jump was optimized out. */
308 /* There always is at least the jump insn in the sequence. */
314 if (any_uncondjump_p (jump))
317 delete_insn (jump);
322 JUMP_LABEL (jump) = label;
324 /* The jump is supposed to handle an unlikely special case. */
325 add_reg_note (jump, REG_BR_PROB, const0_rtx);
373 /* Discard original jump to continue loop. The original compare
540 conversion to use a low overhead looping instruction, replacing the jump
658 jump instruction. Also, a raw define_insn may yield a plain