Lines Matching defs:jump
473 /* Followed by two byte relative address to which to jump. */
474 jump,
476 /* Same as jump, but marks the end of an alternative. */
488 /* Throw away latest failure point and then jump to following
494 match; otherwise change to jump. This is used to jump
495 back to the beginning of a repeat. If what follows this jump
507 of jump when compiling an alternative. */
516 After matching N times, jump to the address upon failure. */
977 case jump:
980 printf ("/jump to %td", p + mcnt - start);
982 printf ("/jump to %ld", (long int) (p + mcnt - start));
1986 /* Store a jump with opcode OP at LOC to location TO. We store a
1987 relative address offset by the three bytes the jump itself occupies. */
1991 /* Likewise, for a two-argument jump. */
2356 /* Address of the place where a forward jump should go to the end of
2358 last -- ends with a forward jump of this sort. */
2524 /* Are we optimizing this jump? */
2581 end a backward relative jump from `b' to before the next
2582 jump we're going to put in below (which jumps from
2583 laststart to after this jump).
2586 insert an unconditional jump backwards to the .,
2592 /* Allocate the space for the jump. */
2605 STORE_JUMP (jump, b, laststart);
2617 /* On failure, jump from laststart to b + 3, which will be the
2618 end of the buffer after this jump is inserted. */
3734 /* We allocated space for this jump when we assigned
3792 /* Insert before the previous alternative a jump which
3800 /* The alternative before this one has a jump after it
3802 jump so it will jump to this alternative's analogous
3803 jump (put in below, which in turn will jump to the next
3804 (if any) alternative's such jump, etc.). The last such
3805 jump jumps to the correct final destination. A picture:
3812 three-byte space after `a'. We'll put in the jump, set
3819 /* Mark and leave space for a jump after this alternative,
3896 all; jump from `laststart' to `b + 3', which will be
3897 the end of the buffer after we insert the jump. */
3903 INSERT_JUMP (jump, laststart, b + 1
3910 set_number_at <jump count> <upper bound>
3912 succeed_n <after jump addr> <succeed_n count>
3914 jump_n <succeed_n addr> <jump count>
3949 append a backward jump to the `succeed_n'
3954 jump back only `upper_bound - 1' times. */
4757 case jump:
4768 ordinary jump. For a * loop, it has pushed its failure
5760 REF (jump),
6785 case jump:
6797 /* If the next operation is a jump backwards in the pattern
6801 on_failure_jump's jump in the pattern, and d. */
7007 except the last ends with a jump that in effect jumps past
7008 the rest of the alternatives. (They really jump to the
7009 ending jump of the following alternative, because tensioning
7013 the repetition text and either the following jump or
7061 We change it to either `pop_failure_jump' or `jump'. */
7217 p[-1] = (UCHAR_T) jump;
7218 DEBUG_PRINT1 (" Match => jump.\n");
7256 /* Unconditionally jump (without popping any failure points). */
7257 CASE (jump):
7258 EXTRACT_NUMBER_AND_INCR (mcnt, p); /* Get the amount to jump. */
7259 DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt);
7260 p += mcnt; /* Do the jump. */
7346 /* Originally, this is how many times we CAN jump. */
7361 /* If don't have to jump any more, skip over the rest of command. */
7555 /* If failed to a backwards jump that's part of a repetition
7563 case jump:
7628 /* If the next operation is not a jump backwards in the
7635 The last alternative starts with only a jump,
7637 with a jump, e.g., here is the pattern for `a|b|c':
7796 /* If this is an optimized succeed_n for zero times, make the jump. */
7797 case jump: