Home
last modified time | relevance | path

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

/external/pcre/dist/
Dpcre_study.c154 case OP_KETRMAX: in find_minlength()
953 case OP_KETRMAX: in set_start_bits()
Dpcre_jit_compile.c642 case OP_KETRMAX: in next_opcode()
1136 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in set_private_data_ptrs()
1584 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in get_private_data_copy_length()
1769 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN) in copy_private_data()
6825 if (ket == OP_KETRMAX) in match_once_common()
6840 if (ket == OP_KETRMAX) in match_once_common()
6973 ket = OP_KETRMAX; in compile_bracket_matchingpath()
6986 SLJIT_ASSERT(ket == OP_KET || ket == OP_KETRMAX || ket == OP_KETRMIN); in compile_bracket_matchingpath()
6987 …ASSERT(!((bra == OP_BRAZERO && ket == OP_KETRMIN) || (bra == OP_BRAMINZERO && ket == OP_KETRMAX))); in compile_bracket_matchingpath()
6994 if (SLJIT_UNLIKELY(opcode == OP_COND) && (*cc == OP_KETRMAX || *cc == OP_KETRMIN)) in compile_bracket_matchingpath()
[all …]
Dpcre_printint.c404 case OP_KETRMAX: in pcre_printint()
DHACKING415 and OP_KETRMAX are used for indefinite repetitions, minimally or maximally
430 minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX
443 OP_KETRMAX, and if so, to break the loop.
Dpcre_dfa_exec.c773 case OP_KETRMAX: in internal_dfa_exec()
2992 repeat_state_offset = (*end_subpattern == OP_KETRMAX || in internal_dfa_exec()
Dpcre_compile.c1944 case OP_KETRMAX: in find_fixedlength()
2611 case OP_KETRMAX: in could_be_empty_branch()
6174 *ketcode = OP_KETRMAX + repeat_type; in compile_branch()
6238 else *ketcode = OP_KETRMAX + repeat_type; in compile_branch()
Dpcre_internal.h2052 OP_KETRMAX, /* 121 These two must remain together and in this */ enumerator
Dpcre_exec.c1904 case OP_KETRMAX: in match()