Searched refs:OP_KETRMIN (Results 1 – 8 of 8) sorted by relevance
212 case OP_KETRMIN: in find_minlength()1053 case OP_KETRMIN: in set_start_bits()
670 case OP_KETRMIN: in next_opcode()1356 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in set_private_data_ptrs()1831 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in get_private_data_copy_length()2018 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in copy_private_data()7725 else if (ket == OP_KETRMIN) in match_once_common()7873 ket = OP_KETRMIN; in compile_bracket_matchingpath()7877 SLJIT_ASSERT(ket == OP_KET || ket == OP_KETRMAX || ket == OP_KETRMIN); in compile_bracket_matchingpath()7878 SLJIT_ASSERT(!((bra == OP_BRAZERO && ket == OP_KETRMIN) || (bra == OP_BRAMINZERO && ket == OP_KETRM… in compile_bracket_matchingpath()7889 if (SLJIT_UNLIKELY(opcode == OP_COND) && (*cc == OP_KETRMAX || *cc == OP_KETRMIN)) in compile_bracket_matchingpath()7923 if (ket == OP_KETRMAX || (ket == OP_KETRMIN && bra != OP_BRAMINZERO)) in compile_bracket_matchingpath()[all …]
387 case OP_KETRMIN: in pcre2_printint()
715 case OP_KETRMIN: in internal_dfa_match()2924 *end_subpattern == OP_KETRMIN)? in internal_dfa_match()
1521 OP_KETRMIN, /* 123 order. They are for groups the repeat for ever. */ enumerator
972 if (*ecode == OP_KETRMIN) in match()1983 case OP_KETRMIN: in match()2110 if (*ecode == OP_KETRMIN) in match()
1178 case OP_KETRMIN: in find_fixedlength()1665 case OP_KETRMIN: in could_be_empty_branch()
446 OP_KET is used for subpatterns that do not repeat indefinitely, and OP_KETRMIN462 minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX474 that it needs to check for matching an empty string when it hits OP_KETRMIN or