Lines Matching refs:number

61 /* Compute the minimum number of offsets that we need to reset each time. Doing
74 /* First, ensure the minimum number of matches are present. */
75 /* First, ensure the minimum number of matches are present. Use inline
76 /* First, ensure the minimum number of matches are present. We get back
80 /* For extended extraction brackets (large number), we have to fish out
81 /* For extended extraction brackets (large number), we have to fish out the
128 /* Reset the maximum number of extractions we might see. */
134 /* Skip over conditional reference data or large extraction number data if
174 DPRINTF (("bracket %d failed\n", number));
195 Returns:          > 0 => success; value is the number of elements filled in
405 group number back at the start and if necessary complete handling an
517 if (number > 0)
518 if (number > EXTRACT_BASIC_MAX) 
563 int number = *prev - OP_BRA;
564 int number = op - OP_BRA;
565 int offset = (ecode[1] << 9) | (ecode[2] << 1);		/* Doubled reference number */
566 int offset = (ecode[4] << 9) | (ecode[5] << 1);	/* Doubled reference number */
578 int save_offset3 = md->offset_vector[md->offset_end - number];
584 it as matched, any number of times (otherwise there could be infinite
591 length      number to print
638 maximum. Alternatively, if maximizing, find the maximum number of
651 md->offset_vector[md->offset_end - number] = eptr - md->start_subject;
652 md->offset_vector[md->offset_end - number] = save_offset3;
653 md->offset_vector[md->offset_end - number];
672 minimum number of matches are present. If min = max, continue at the same
684 number = (ecode[4] << 8) | ecode[5];
685 number = (prev[4] << 8) | prev[5];
686 number from a dummy opcode at the start. */
687 number, then move along the subject till after the recursive match,
694 offset = number << 1;
699 offsetcount     the number of elements in the vector
732 printf ("end bracket %d", number);
736 printf ("start bracket %d subject=", number);
753 repeat limits are compiled as a number of copies, with the optional ones
815 than the number of characters left in the string, so the match fails.
830 the minimum number of bytes before we start. */
831 the number from a dummy opcode at the start. */
852 up quickly if there are fewer than the minimum number of characters left in