Searched refs:OP_KETRMIN (Results 1 – 7 of 7) sorted by relevance
233 case OP_KETRMIN: in find_minlength()1151 case OP_KETRMIN: in set_start_bits()
927 case OP_KETRMIN: in next_opcode()1821 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in set_private_data_ptrs()2453 …if ((*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) && recurse_check_bit(common, PRIVAT… in get_recurse_data_length()2827 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in copy_recurse_data()10308 else if (ket == OP_KETRMIN) in match_once_common()10491 ket = OP_KETRMIN; in compile_bracket_matchingpath()10495 SLJIT_ASSERT(ket == OP_KET || ket == OP_KETRMAX || ket == OP_KETRMIN); in compile_bracket_matchingpath()10496 SLJIT_ASSERT(!((bra == OP_BRAZERO && ket == OP_KETRMIN) || (bra == OP_BRAMINZERO && ket == OP_KETRM… in compile_bracket_matchingpath()10507 if (SLJIT_UNLIKELY(opcode == OP_COND) && (*cc == OP_KETRMAX || *cc == OP_KETRMIN)) in compile_bracket_matchingpath()10539 if (ket == OP_KETRMAX || (ket == OP_KETRMIN && bra != OP_BRAMINZERO)) in compile_bracket_matchingpath()[all …]
418 case OP_KETRMIN: in pcre2_printint()
868 case OP_KETRMIN: in internal_dfa_match()3135 *end_subpattern == OP_KETRMIN)? in internal_dfa_match()
1545 OP_KETRMIN, /* 123 order. They are for groups the repeat for ever. */ enumerator
5721 case OP_KETRMIN: in match()5876 if (Fop == OP_KETRMIN) in match()
667 used for subpatterns that do not repeat indefinitely, OP_KETRMIN and683 minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX695 that it needs to check for matching an empty string when it hits OP_KETRMIN or