Home
last modified time | relevance | path

Searched refs:OP_KETRMIN (Results 1 – 7 of 7) sorted by relevance

/PHP-7.2/ext/pcre/pcrelib/
H A Dpcre_study.c160 case OP_KETRMIN: in find_minlength()
996 case OP_KETRMIN: in set_start_bits()
H A Dpcre_jit_compile.c654 case OP_KETRMIN: in next_opcode()
7701 else if (ket == OP_KETRMIN) in match_once_common()
7849 ket = OP_KETRMIN; in compile_bracket_matchingpath()
7924 if (ket != OP_KETRMIN) in compile_bracket_matchingpath()
7968 if (ket == OP_KETRMIN) in compile_bracket_matchingpath()
7991 if (ket == OP_KETRMIN) in compile_bracket_matchingpath()
8015 if (ket == OP_KETRMIN) in compile_bracket_matchingpath()
9911 ket = OP_KETRMIN; in compile_bracket_backtrackingpath()
9954 else if (ket == OP_KETRMIN) in compile_bracket_backtrackingpath()
10278 else if (ket == OP_KETRMIN) in compile_bracket_backtrackingpath()
[all …]
H A Dpcre_printint.c405 case OP_KETRMIN: in pcre_printint()
H A DHACKING414 OP_KET is used for subpatterns that do not repeat indefinitely, and OP_KETRMIN
430 minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX
442 that it needs to check for matching an empty string when it hits OP_KETRMIN or
H A Dpcre_exec.c926 if (*ecode == OP_KETRMIN) in match()
1910 case OP_KETRMIN: in match()
2040 if (*ecode == OP_KETRMIN) in match()
H A Dpcre_internal.h2061 OP_KETRMIN, /* 122 order. They are for groups the repeat for ever. */ enumerator
H A Dpcre_compile.c1976 case OP_KETRMIN: in find_fixedlength()
2666 case OP_KETRMIN: in could_be_empty_branch()

Completed in 78 milliseconds