Home
last modified time | relevance | path

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

/third_party/pcre2/pcre2/src/
Dpcre2_study.c172 if (cc[1+LINK_SIZE] == OP_RECURSE && cc[2*(1+LINK_SIZE)] == OP_KET) in find_minlength()
231 case OP_KET: in find_minlength()
1149 case OP_KET: in set_start_bits()
Dpcre2_jit_compile.c841 SLJIT_ASSERT(*cc >= OP_KET && *cc <= OP_KETRPOS); in bracketend()
856 SLJIT_ASSERT(*cc >= OP_KET && *cc <= OP_KETRPOS); in no_alternatives()
925 case OP_KET: in next_opcode()
1494 …if (*end != OP_KET || (*cc == OP_CBRA && common->optimized_cbracket[GET2(cc, 1 + LINK_SIZE)] == 0)) in detect_early_fail()
1509 case OP_KET: in detect_early_fail()
1568 if (*cc != OP_ALT && *cc != OP_KET) in detect_early_fail()
1624 if (end[-(1 + LINK_SIZE)] != OP_KET || PRIVATE_DATA(begin) != 0) in detect_repeat()
1670 if (*next_end != OP_KET) in detect_repeat()
1783 case OP_KET: in set_private_data_ptrs()
1927 if (end[-1 - LINK_SIZE] == OP_KET) in set_private_data_ptrs()
[all …]
Dpcre2_printint.c421 case OP_KET: in pcre2_printint()
Dpcre2_auto_possess.c609 case OP_KET: in compare_opcodes()
Dpcre2_compile.c4887 code[GET(code, 1)] != OP_KET) /* More than one branch */ in first_significant_code()
6611 while (*tc != OP_KET); in compile_branch()
6662 *code++ = OP_KET; in compile_branch()
7150 previous[2 + 2*LINK_SIZE] = OP_KET; in compile_branch()
7385 *code++ = OP_KET; in compile_branch()
7737 *code++ = OP_KET; in compile_branch()
8290 *code = OP_KET; in compile_regex()
Dpcre2_dfa_match.c867 case OP_KET: in internal_dfa_match()
874 if (codevalue != OP_KET) in internal_dfa_match()
Dpcre2_internal.h1543 OP_KET, /* 121 End of group that doesn't have an unbounded repeat */ enumerator
Dpcre2_match.c5720 case OP_KET: in match()
5874 if (Fop != OP_KET && (P == NULL || Feptr != P->eptr)) in match()
/third_party/pcre2/pcre2/
DHACKING666 There are several opcodes that mark the end of a subpattern group. OP_KET is