Searched refs:OP_KETRMIN (Results 1 – 7 of 7) sorted by relevance
224 case OP_KETRMIN: in find_minlength()1104 case OP_KETRMIN: in set_start_bits()
387 case OP_KETRMIN: in pcre2_printint()
897 case OP_KETRMIN: in next_opcode()1593 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in set_private_data_ptrs()2181 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in get_recurse_data_length()2529 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in copy_recurse_data()10184 else if (ket == OP_KETRMIN) in match_once_common()10367 ket = OP_KETRMIN; in compile_bracket_matchingpath()10371 SLJIT_ASSERT(ket == OP_KET || ket == OP_KETRMAX || ket == OP_KETRMIN); in compile_bracket_matchingpath()10372 SLJIT_ASSERT(!((bra == OP_BRAZERO && ket == OP_KETRMIN) || (bra == OP_BRAMINZERO && ket == OP_KETRM… in compile_bracket_matchingpath()10383 if (SLJIT_UNLIKELY(opcode == OP_COND) && (*cc == OP_KETRMAX || *cc == OP_KETRMIN)) in compile_bracket_matchingpath()10415 if (ket == OP_KETRMAX || (ket == OP_KETRMIN && bra != OP_BRAMINZERO)) in compile_bracket_matchingpath()[all …]
863 case OP_KETRMIN: in internal_dfa_match()3071 *end_subpattern == OP_KETRMIN)? in internal_dfa_match()
1510 OP_KETRMIN, /* 123 order. They are for groups the repeat for ever. */ enumerator
5452 case OP_KETRMIN: in match()5596 if (Fop == OP_KETRMIN) in match()
664 used for subpatterns that do not repeat indefinitely, OP_KETRMIN and680 minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX692 that it needs to check for matching an empty string when it hits OP_KETRMIN or