Lines Matching refs:zero
278 library is dynamically loaded. The list of lengths is terminated by a zero
518 "a numbered reference must not be zero\0"
700 zero because property types are handled separately in the code. The last four
815 versions as a result of an explicit possessive quantifier such as ++. A zero
992 Returns: zero => a data character
1017 in a table. A non-zero result is something that can be returned immediately.
1190 starting with one that is not zero is not straightforward. Perl has changed
1239 the first digit is 8 or 9, Perl used to generate a binary zero byte and
1241 changed so as not to insert the binary zero. */
1329 that, for example \x{zz} matches a binary zero. This seems crazy, so PCRE
1588 current ptr on error, with errorcodeptr set non-zero
2064 the table is zero; the actual length is stored in the compiled code. */
2199 the table is zero; the actual length is stored in the compiled code. */
2433 /* Groups with zero repeats can of course be empty; skip them. */
2494 high-valued characters. The length in PRIV(OP_lengths)[] is zero; the
2857 list[1] will be non-zero if this opcode
3090 (represented by a non-zero value) quantifier. This is a different from
3092 matches to an empty string (also represented by a non-zero value). */
3936 optional (i.e. the minimum quantifier is zero), OP_BRAZERO or OP_SKIPZERO is
4097 range, which is either the end of the input range, or a character that has zero
4382 FALSE, with *errorcodeptr set non-zero on error
4460 When we hit a repeat whose minimum is zero, we may have to adjust these values
4461 to take the zero repeat into account. This is implemented by setting them to
4469 or zero, according to the current setting of the caseless flag. The
4533 case of a zero quantifier after a class (e.g. [ab]{0}). At compile time,
4836 class_has_8bitchar will be non-zero if the class contains at least one <
5531 firstchar = zerofirstchar; /* Adjust for zero repeat */
5699 /* If the maximum is zero then the minimum must also be zero; Perl allows
5708 /* A minimum of zero is handled either as the special case * or ?, or as
5888 if the minimum is greater than zero, just ignore the repeat. If the
5889 maximum is not zero or one, set it to 1. */
5897 /* The case of a zero minimum is special because of the need to stick
5902 minimum is zero. */
5906 /* If the maximum is also zero, we used to just omit the group from the
5947 that is common with the non-zero minimum case below. We have to
5972 /* If the minimum is greater than zero, replicate the group as many
6046 /* This code is common to both the zero and non-zero minimum cases. If
6048 remembering the bracket starts on a stack. In the case of a zero minimum,
6233 /* If the minimum is zero, mark it as possessive, then unset the
6281 remains is greater than zero, there's a further opcode that can be
6336 than OP_CALLOUT. A zero entry means there is no possessified version.
7615 zero repeat, we have to back off. Hence the definition of zeroreqchar and
7630 no firstchar, set "none" for the whole branch. In both cases, a zero
7715 /* Set values to reset to if this is followed by a zero repeat. */
7946 byte, set it from this character, but revert to none on a zero repeat.
7947 Otherwise, leave the firstchar value alone, and don't change it on a zero
8107 /* Offset is set zero to mark that this bracket is still open */
8325 zero offset until it is closed, making it possible to detect recursion. */
8588 char (recurse ad lib), then we return that char, with the flags set to zero or
8589 REQ_CASELESS; otherwise return zero with REQ_NONE in the flags.
8855 /* Check that all undefined public option bits are zero */
9101 /* Now do the pre-compile. On error, errorcode will be set non-zero, so we
9211 error, errorcode will be set non-zero, so we don't need to look at the result
9312 of zero, but that is a pathological case, and it does no harm.) When we find