Lines Matching defs:number
102 so this number is very generous.
113 kicks in at the same number of forward references in all cases. */
121 workspace. The value is the number of slots in the list. */
233 the number of relocations when a shared library is dynamically linked. The
283 now all in a single string, to reduce the number of relocations when a shared
441 are passed to the outside world. Do not ever re-use any error number, because
444 the number of relocations needed when a shared library is loaded dynamically,
461 "number too big in {} quantifier\0"
486 "malformed number or name after (?(\0"
500 "number after (?C is > 255\0"
523 "\\g is not followed by a braced, angle-bracketed, or quoted name/number or by a plain number\0"
528 "number is too big\0"
533 "different names for subpatterns of the same number are not allowed\0"
892 Argument: the error number
914 /* This function is called during the second compiling phase, if the number of
920 Returns: 0 if all went well, else an error number
997 bracount number of previous extracting brackets
1051 /* A number of Perl escapes are not handled by PCRE. We give an explicit
1105 class, \g must be followed by one of a number of specific things:
1107 (1) A number, either plain or braced. If positive, it is an absolute
1117 number either in angle brackets or in single quotes. However, these are
1203 Outside a character class, the digits are read as a decimal number. If the
1204 number is less than 8 (used to be 10), or if there are that many previous
1212 8 or 9 or an octal number. */
1247 /* Handle a digit following \ when the number is not a back reference. If
1256 /* \0 always starts an octal number, but we may drop through to here with a
1334 /* Handle \x in Perl's style. \x{ddd} is a character number which can be
2069 capturing bracket with the given number, or, if the number is negative, an
2077 number the required bracket number or negative to find a lookbehind
2083 PRIV(find_bracket)(const pcre_uchar *code, BOOL utf, int number)
2101 if (number < 0) return (pcre_uchar *)code;
2111 if (n == number) return (pcre_uchar *)code;
4009 (which is a group number). After the group has been scanned, all the offsets in
4199 Returns: the number of < 256 characters added
4363 Returns: the number of < 256 characters added
4401 Returns: the number of < 256 characters added
4441 firstcharflagsptr place to put the first character flags, or a negative number
4443 reqcharflagsptr place to put the last required character flags, or a negative number
6039 data, whereas in other cases it appears the minimum number of times. For
6113 times as necessary, and adjust the maximum to the number of subsequent
6189 the number of additional copies needed. Again, we must remember to
6296 Then, if the minimum number of matches is 1 or 0, cancel the possessive
6646 PUT2INC(code, 0, oc->number);
6754 /* A condition can be an assertion, a number (referring to a numbered
6807 refsign = -1; /* => not a number */
6843 /* Handle a number */
6861 a name is one of a number of duplicates, a different opcode is used and
6892 *errorcodeptr = ERR26; /* Malformed number or name */
6901 reference. If refsign is not negative, it means we have a number in
6935 number. */
6977 specific group number. */
7144 necessary. Duplicates for the same number are skipped; other duplicates
7151 pcre_uint32 number = cd->bracount + 1;
7176 number is the same, break the loop, which causes the name to be
7178 If it is set, allow the name with a different number, but continue
7179 scanning in case this is a duplicate with the same number. For
7180 non-duplicate names, give an error if the number is duplicated. */
7188 if (ng->number == number) break;
7196 else if (ng->number == number)
7203 if (i >= cd->names_found) /* Not a duplicate with same number */
7229 cd->named_groups[cd->names_found].number = number;
7261 a dummy reference number, because it was not used in the first pass.
7263 we have to look for the number so that this state can be identified, as
7265 reference, the dummy number will do. */
7299 the reference may end up as the number of a group which we are
7305 another group with the same number might be created later. This
7312 existing named group with a different number (so apparently not
7314 current number. This can only happen if $(| has been previous
7322 so far in order to get the number. If the name is not found, leave
7339 recno = ng->number;
7343 if (oc->number == recno)
7426 if (oc->number == recno)
7464 the ... are a (signed) number, so that neither ERR63 nor ERR29 will
7560 offset below, what it actually inserted is the reference number
7731 skipbytes, /* Skip over bracket number */
7914 are negative the reference number. Only back references and those types
7942 is a subroutine call by number (Oniguruma syntax). In fact, the value
7959 fact, because we do the check for a number below, the paths that
7965 /* If it's not a signed or unsigned number, treat it as a name. */
7974 /* Signed or unsigned number (cf = ptr[1]) is known to be plus or minus
8033 if (oc->number == recno)
8250 firstcharflagsptr place to put the first character flags, or a negative number
8252 reqcharflagsptr place to put the last required character flags, or a negative number
8327 capitem.number = capnumber;
8520 /* Retain the highest bracket number, in case resetting was used. */
8602 this prevents the number of characters it matches from being adjusted.
8790 because the number of characters matched by .* cannot be adjusted inside
8901 * Add an entry to the name/number table *
8905 name/number table, maintaining alphabetical order. Checking for permitted
8912 groupno the group number
9370 /* Put in the magic number, and save the sizes, initial options, internal
9396 /* The starting points of the name/number translation table and of the code are
9419 /* If any named groups were found, create the name/number table from the list
9428 add_name(cd, ng->name, ng->length, ng->number);