diffutils/lib/regex.c

578   succeed_n,
1053         case succeed_n:
1058 	  printf ("/succeed_n to %td, %d times", p1 - start, mcnt2);
1060 	  printf ("/succeed_n to %ld, %d times",
3984                       set_number_at <succeed_n count> <lower bound>
3985                       succeed_n <after jump addr> <succeed_n count>
3987                       jump_n <succeed_n addr> <jump count>
3998                      /* Initialize lower bound of the `succeed_n', even
4003                      INSERT_JUMP2 (succeed_n, laststart,
4010                         before the `succeed_n'.  The `5' is the last two
4012                         the following `succeed_n'.  */
4015 			of the following `succeed_n'.  */
4022                             append a backward jump to the `succeed_n'
4688   /* We aren't doing a `succeed_n' to begin with.  */
4869              `on_failure_jump' or `succeed_n'.  Just treat it like an
4873 	      && (re_opcode_t) *p != succeed_n)
4920 	case succeed_n:
5886     REF (succeed_n),
6325         /* Ignore these.  Used to ignore the n of succeed_n's which
7155              the result of a completed succeed_n, as in \(a\)\{1,3\}b\1
7419         CASE (succeed_n):
7421           DEBUG_PRINT2 ("EXECUTING succeed_n %d.\n", mcnt);
7684                   if ((is_a_jump_n && (re_opcode_t) *p1 == succeed_n)
7915     /* If this is an optimized succeed_n for zero times, make the jump.  */
7924     case succeed_n: