Searched refs:OP_KETRMIN (Results 1 – 7 of 7) sorted by relevance
160 case OP_KETRMIN: in find_minlength()996 case OP_KETRMIN: in set_start_bits()
654 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 …]
405 case OP_KETRMIN: in pcre_printint()
414 OP_KET is used for subpatterns that do not repeat indefinitely, and OP_KETRMIN430 minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX442 that it needs to check for matching an empty string when it hits OP_KETRMIN or
926 if (*ecode == OP_KETRMIN) in match()1910 case OP_KETRMIN: in match()2040 if (*ecode == OP_KETRMIN) in match()
2061 OP_KETRMIN, /* 122 order. They are for groups the repeat for ever. */ enumerator
1976 case OP_KETRMIN: in find_fixedlength()2666 case OP_KETRMIN: in could_be_empty_branch()
Completed in 78 milliseconds