Searched refs:OP_KETRMAX (Results 1 – 8 of 8) sorted by relevance
232 case OP_KETRMAX: in find_minlength()1150 case OP_KETRMAX: in set_start_bits()
386 case OP_KETRMAX: in pcre2_printint()
921 case OP_KETRMAX: in next_opcode()1817 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in set_private_data_ptrs()2407 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in get_recurse_data_length()2757 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in copy_recurse_data()10075 if (ket == OP_KETRMAX) in match_once_common()10090 if (ket == OP_KETRMAX) in match_once_common()10258 ket = OP_KETRMAX; in compile_bracket_matchingpath()10264 SLJIT_ASSERT(ket == OP_KET || ket == OP_KETRMAX || ket == OP_KETRMIN); in compile_bracket_matchingpath()10265 …ASSERT(!((bra == OP_BRAZERO && ket == OP_KETRMIN) || (bra == OP_BRAMINZERO && ket == OP_KETRMAX))); in compile_bracket_matchingpath()10276 if (SLJIT_UNLIKELY(opcode == OP_COND) && (*cc == OP_KETRMAX || *cc == OP_KETRMIN)) in compile_bracket_matchingpath()[all …]
1519 OP_KETRMAX, /* 122 These two must remain together and in this */ enumerator
869 case OP_KETRMAX: in internal_dfa_match()3077 repeat_state_offset = (*end_subpattern == OP_KETRMAX || in internal_dfa_match()
7316 *ketcode = OP_KETRMAX + repeat_type; in compile_branch()7372 else *ketcode = OP_KETRMAX + repeat_type; in compile_branch()
5527 case OP_KETRMAX: in match()
667 OP_KETRMAX are used for indefinite repetitions, minimally or maximally682 minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX695 OP_KETRMAX, and if so, to break the loop.