Home
last modified time | relevance | path

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

/external/pcre/dist2/src/
Dpcre2_study.c211 case OP_KETRMAX: in find_minlength()
1052 case OP_KETRMAX: in set_start_bits()
Dpcre2_jit_compile.c669 case OP_KETRMAX: 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()
7723 if (ket == OP_KETRMAX) in match_once_common()
7738 if (ket == OP_KETRMAX) in match_once_common()
7871 ket = OP_KETRMAX; in compile_bracket_matchingpath()
7877 SLJIT_ASSERT(ket == OP_KET || ket == OP_KETRMAX || ket == OP_KETRMIN); in compile_bracket_matchingpath()
7878 …ASSERT(!((bra == OP_BRAZERO && ket == OP_KETRMIN) || (bra == OP_BRAMINZERO && ket == OP_KETRMAX))); in compile_bracket_matchingpath()
7889 if (SLJIT_UNLIKELY(opcode == OP_COND) && (*cc == OP_KETRMAX || *cc == OP_KETRMIN)) in compile_bracket_matchingpath()
[all …]
Dpcre2_printint.c386 case OP_KETRMAX: in pcre2_printint()
Dpcre2_dfa_match.c716 case OP_KETRMAX: in internal_dfa_match()
2923 repeat_state_offset = (*end_subpattern == OP_KETRMAX || in internal_dfa_match()
Dpcre2_internal.h1520 OP_KETRMAX, /* 122 These two must remain together and in this */ enumerator
Dpcre2_compile.c1177 case OP_KETRMAX: in find_fixedlength()
1664 case OP_KETRMAX: in could_be_empty_branch()
5664 *ketcode = OP_KETRMAX + repeat_type; in compile_branch()
5740 else *ketcode = OP_KETRMAX + repeat_type; in compile_branch()
Dpcre2_match.c1984 case OP_KETRMAX: in match()
/external/pcre/dist2/
DHACKING447 and OP_KETRMAX are used for indefinite repetitions, minimally or maximally
462 minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX
475 OP_KETRMAX, and if so, to break the loop.