Home
last modified time | relevance | path

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

/external/pcre/dist2/src/
Dpcre2_study.c142 if (*cs != OP_ALT) in find_minlength()
172 do cc += GET(cc, 1); while (*cc == OP_ALT); in find_minlength()
193 do cc += GET(cc, 1); while (*cc == OP_ALT); in find_minlength()
209 case OP_ALT: in find_minlength()
217 if (op != OP_ALT) return length; in find_minlength()
229 do cc += GET(cc, 1); while (*cc == OP_ALT); in find_minlength()
266 do cc += GET(cc, 1); while (*cc == OP_ALT); in find_minlength()
465 do ce += GET(ce, 1); while (*ce == OP_ALT); in find_minlength()
508 do ce += GET(ce, 1); while (*ce == OP_ALT); in find_minlength()
590 do ce += GET(ce, 1); while (*ce == OP_ALT); in find_minlength()
[all …]
Dpcre2_match.c514 while (*callpat == OP_ALT); /* Loop for the alternatives */ in op_recurse_ovecsave()
935 (*ecode == OP_ALT || *next_ecode == OP_ALT)) in match()
943 while (*ecode == OP_ALT); in match()
947 if (*ecode != OP_ONCE_NC && *ecode != OP_ALT) RRETURN(MATCH_NOMATCH); in match()
952 do ecode += GET(ecode, 1); while (*ecode == OP_ALT); in match()
1039 (*ecode == OP_ALT || *next_ecode == OP_ALT)) in match()
1049 if (*ecode != OP_ALT) break; in match()
1100 else if (!mb->hasthen && ecode[GET(ecode, 1)] != OP_ALT) in match()
1120 (*ecode == OP_ALT || *next_ecode == OP_ALT)) in match()
1131 while (*scode == OP_ALT) scode += GET(scode, 1); in match()
[all …]
Dpcre2_dfa_match.c446 while (*end_code == OP_ALT); in internal_dfa_match()
492 while (*end_code == OP_ALT); in internal_dfa_match()
509 do { end_code += GET(end_code, 1); } while (*end_code == OP_ALT); in internal_dfa_match()
529 while (*end_code == OP_ALT); in internal_dfa_match()
754 case OP_ALT: in internal_dfa_match()
755 do { code += GET(code, 1); } while (*code == OP_ALT); in internal_dfa_match()
767 while (*code == OP_ALT); in internal_dfa_match()
775 while (*code == OP_ALT) in internal_dfa_match()
787 while (*code == OP_ALT) code += GET(code, 1); in internal_dfa_match()
794 while (*code == OP_ALT) code += GET(code, 1); in internal_dfa_match()
[all …]
Dpcre2_auto_possess.c561 if (c == OP_ALT) in compare_opcodes()
563 do code += GET(code, 1); while (*code == OP_ALT); in compare_opcodes()
609 while (*next_code == OP_ALT) in compare_opcodes()
627 do next_code += GET(next_code, 1); while (*next_code == OP_ALT); in compare_opcodes()
Dpcre2_compile.c955 do cc += GET(cc, 1); while (*cc == OP_ALT); in find_fixedlength()
965 case OP_ALT: in find_fixedlength()
972 if (*cc != OP_ALT) in find_fixedlength()
992 do ce += GET(ce, 1); while (*ce == OP_ALT); /* End subpattern */ in find_fixedlength()
1018 do cc += GET(cc, 1); while (*cc == OP_ALT); in find_fixedlength()
1300 do code += GET(code, 1); while (*code == OP_ALT); in first_significant_code()
1416 do code += GET(code, 1); while (*code == OP_ALT); in could_be_empty_branch()
1443 do endgroup += GET(endgroup, 1); while (*endgroup == OP_ALT); in could_be_empty_branch()
1472 while (*scode == OP_ALT); in could_be_empty_branch()
1484 do code += GET(code, 1); while (*code == OP_ALT); in could_be_empty_branch()
[all …]
Dpcre2_jit_compile.c583 do cc += GET(cc, 1); while (*cc == OP_ALT); in bracketend()
598 while (*cc == OP_ALT); in no_alternatives()
667 case OP_ALT: in next_opcode()
1118 while (*cc == OP_ALT); in detect_fast_fail()
2229 BOOL has_alternatives = cc[GET(cc, 1)] == OP_ALT; in set_then_offsets()
2248 if (*cc == OP_ALT && has_alternatives) in set_then_offsets()
3580 case OP_ALT: in scan_prefix()
3591 while (*alternative == OP_ALT) in scan_prefix()
7265 case OP_ALT: in assert_needs_str_ptr_saving()
7404 if (*ccbegin == OP_ALT && extrasize > 0) in compile_assert_matchingpath()
[all …]
Dpcre2_printint.c389 case OP_ALT: in pcre2_printint()
Dpcre2_internal.h1518 OP_ALT, /* 120 Start of alternation */ enumerator
/external/pcre/dist2/
DHACKING441 next alternative OP_ALT or, if there aren't any branches, to the matching
442 OP_KET opcode. Each OP_ALT is followed by a LINK_SIZE value giving the offset