• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zebra/lib/

Lines Matching refs:jump

456         /* Followed by two byte relative address to which to jump.  */
457 jump,
459 /* Same as jump, but marks the end of an alternative. */
470 /* Throw away latest failure point and then jump to following
475 match; otherwise change to jump. This is used to jump
476 back to the beginning of a repeat. If what follows this jump
487 of jump when compiling an alternative. */
495 After matching N times, jump to the address upon failure. */
811 case jump:
813 printf ("/jump to %d", p + mcnt - start);
1658 /* Store a jump with opcode OP at LOC to location TO. We store a
1659 relative address offset by the three bytes the jump itself occupies. */
1663 /* Likewise, for a two-argument jump. */
1942 /* Address of the place where a forward jump should go to the end of
1944 last -- ends with a forward jump of this sort. */
2063 /* Are we optimizing this jump? */
2120 end a backward relative jump from `b' to before the next
2121 jump we're going to put in below (which jumps from
2122 laststart to after this jump).
2125 insert an unconditional jump backwards to the .,
2131 /* Allocate the space for the jump. */
2144 STORE_JUMP (jump, b, laststart);
2155 /* On failure, jump from laststart to b + 3, which will be the
2156 end of the buffer after this jump is inserted. */
2522 /* We allocated space for this jump when we assigned
2580 /* Insert before the previous alternative a jump which
2587 /* The alternative before this one has a jump after it
2589 jump so it will jump to this alternative's analogous
2590 jump (put in below, which in turn will jump to the next
2591 (if any) alternative's such jump, etc.). The last such
2592 jump jumps to the correct final destination. A picture:
2599 three-byte space after `a'. We'll put in the jump, set
2606 /* Mark and leave space for a jump after this alternative,
2693 all; jump from `laststart' to `b + 3', which will be
2694 the end of the buffer after we insert the jump. */
2698 INSERT_JUMP (jump, laststart, b + 3);
2704 set_number_at <jump count> <upper bound>
2706 succeed_n <after jump addr> <succeed_n count>
2708 jump_n <succeed_n addr> <jump count>
2737 append a backward jump to the `succeed_n'
2742 jump back only `upper_bound - 1' times. */
3386 case jump:
3397 ordinary jump. For a * loop, it has pushed its failure
4504 case jump:
4516 /* If the next operation is a jump backwards in the pattern
4520 on_failure_jump's jump in the pattern, and d. */
4715 except the last ends with a jump that in effect jumps past
4716 the rest of the alternatives. (They really jump to the
4717 ending jump of the following alternative, because tensioning
4721 the repetition text and either the following jump or
4769 We change it to either `pop_failure_jump' or `jump'. */
4916 p[-1] = (unsigned char) jump;
4917 DEBUG_PRINT1 (" Match => jump.\n");
4955 /* Unconditionally jump (without popping any failure points). */
4956 case jump:
4957 EXTRACT_NUMBER_AND_INCR (mcnt, p); /* Get the amount to jump. */
4958 DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt);
4959 p += mcnt; /* Do the jump. */
5036 /* Originally, this is how many times we CAN jump. */
5048 /* If don't have to jump any more, skip over the rest of command. */
5229 /* If failed to a backwards jump that's part of a repetition
5237 case jump:
5303 /* If the next operation is not a jump backwards in the
5310 The last alternative starts with only a jump,
5312 with a jump, e.g., here is the pattern for `a|b|c':
5470 /* If this is an optimized succeed_n for zero times, make the jump. */
5471 case jump: