Home
last modified time | relevance | path

Searched refs:OP_KETRMAX (Results 1 – 8 of 8) sorted by relevance

/third_party/pcre2/pcre2/src/
Dpcre2_study.c232 case OP_KETRMAX: in find_minlength()
1150 case OP_KETRMAX: in set_start_bits()
Dpcre2_jit_compile.c926 case OP_KETRMAX: 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()
10306 if (ket == OP_KETRMAX) in match_once_common()
10321 if (ket == OP_KETRMAX) in match_once_common()
10489 ket = OP_KETRMAX; in compile_bracket_matchingpath()
10495 SLJIT_ASSERT(ket == OP_KET || ket == OP_KETRMAX || ket == OP_KETRMIN); in compile_bracket_matchingpath()
10496 …ASSERT(!((bra == OP_BRAZERO && ket == OP_KETRMIN) || (bra == OP_BRAMINZERO && ket == OP_KETRMAX))); in compile_bracket_matchingpath()
10507 if (SLJIT_UNLIKELY(opcode == OP_COND) && (*cc == OP_KETRMAX || *cc == OP_KETRMIN)) in compile_bracket_matchingpath()
[all …]
Dpcre2_printint.c417 case OP_KETRMAX: in pcre2_printint()
Dpcre2_dfa_match.c869 case OP_KETRMAX: in internal_dfa_match()
3134 repeat_state_offset = (*end_subpattern == OP_KETRMAX || in internal_dfa_match()
Dpcre2_internal.h1544 OP_KETRMAX, /* 122 These two must remain together and in this */ enumerator
Dpcre2_compile.c7430 *ketcode = OP_KETRMAX + repeat_type; in compile_branch()
7486 else *ketcode = OP_KETRMAX + repeat_type; in compile_branch()
Dpcre2_match.c5722 case OP_KETRMAX: in match()
/third_party/pcre2/pcre2/
DHACKING668 OP_KETRMAX are used for indefinite repetitions, minimally or maximally
683 minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX
696 OP_KETRMAX, and if so, to break the loop.