Home
last modified time | relevance | path

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

/PHP-5.4/ext/pcre/pcrelib/
H A Dpcre_jit_compile.c639 case OP_KETRMIN: in next_opcode()
6842 else if (ket == OP_KETRMIN) in match_once_common()
6990 ket = OP_KETRMIN; in compile_bracket_matchingpath()
7065 if (ket != OP_KETRMIN) in compile_bracket_matchingpath()
7109 if (ket == OP_KETRMIN) in compile_bracket_matchingpath()
7132 if (ket == OP_KETRMIN) in compile_bracket_matchingpath()
7156 if (ket == OP_KETRMIN) in compile_bracket_matchingpath()
8861 ket = OP_KETRMIN; in compile_bracket_backtrackingpath()
8904 else if (ket == OP_KETRMIN) in compile_bracket_backtrackingpath()
9226 else if (ket == OP_KETRMIN) in compile_bracket_backtrackingpath()
[all …]
H A Dpcre_study.c156 case OP_KETRMIN: in find_minlength()
990 case OP_KETRMIN: in set_start_bits()
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.h2057 OP_KETRMIN, /* 122 order. They are for groups the repeat for ever. */ enumerator
H A Dpcre_compile.c1956 case OP_KETRMIN: in find_fixedlength()
2646 case OP_KETRMIN: in could_be_empty_branch()

Completed in 80 milliseconds