Home
last modified time | relevance | path

Searched refs:OP_KET (Results 1 – 9 of 9) sorted by relevance

/external/pcre/dist2/src/
Dpcre2_study.c165 if (cc[1+LINK_SIZE] == OP_RECURSE && cc[2*(1+LINK_SIZE)] == OP_KET) in find_minlength()
221 case OP_KET: in find_minlength()
1100 case OP_KET: in set_start_bits()
Dpcre2_jit_compile.c625 SLJIT_ASSERT(*cc >= OP_KET && *cc <= OP_KETRPOS); in bracketend()
640 SLJIT_ASSERT(*cc >= OP_KET && *cc <= OP_KETRPOS); in no_alternatives()
709 case OP_KET: in next_opcode()
1079 if (*end != OP_KET || PRIVATE_DATA(end) != 0) in detect_fast_forward_skip()
1110 if (*next_alt != OP_KET || PRIVATE_DATA(next_alt) != 0) in detect_fast_fail()
1206 if (end[-(1 + LINK_SIZE)] != OP_KET) in detect_repeat()
1251 if (*next_end != OP_KET) in detect_repeat()
1363 case OP_KET: in set_private_data_ptrs()
1503 if (end[-1 - LINK_SIZE] == OP_KET) in set_private_data_ptrs()
1939 case OP_KET: in get_recurse_data_length()
[all …]
Dpcre2_compile.c4419 code[GET(code, 1)] != OP_KET) /* More than one branch */ in first_significant_code()
6071 while (*tc != OP_KET); in compile_branch()
6122 *code++ = OP_KET; in compile_branch()
6614 previous[2 + 2*LINK_SIZE] = OP_KET; in compile_branch()
6840 *code++ = OP_KET; in compile_branch()
7188 *code++ = OP_KET; in compile_branch()
7712 *code = OP_KET; in compile_regex()
7729 *code = OP_KET; in compile_regex()
Dpcre2_printint.c390 case OP_KET: in pcre2_printint()
Dpcre2_auto_possess.c588 case OP_KET: in compare_opcodes()
Dpcre2_dfa_match.c855 case OP_KET: in internal_dfa_match()
862 if (codevalue != OP_KET) in internal_dfa_match()
Dpcre2_internal.h1474 OP_KET, /* 121 End of group that doesn't have an unbounded repeat */ enumerator
Dpcre2_match.c5449 case OP_KET: in match()
5584 if (Fop != OP_KET && (P == NULL || Feptr != P->eptr)) in match()
/external/pcre/dist2/
DHACKING663 There are several opcodes that mark the end of a subpattern group. OP_KET is