Lines Matching refs:on_success
34 RegExpNode* on_success) {
39 on_success);
43 RegExpNode* on_success) {
45 on_success);
208 RegExpNode* on_success, UnicodeRangeSplitter* splitter) {
213 compiler->zone(), bmp, compiler->read_backward(), on_success)));
228 RegExpNode* on_success,
312 compiler->read_backward(), on_success)));
321 on_success)));
327 ZoneList<CharacterRange>* match, RegExpNode* on_success,
331 zone, match, read_backward, on_success);
343 ZoneList<CharacterRange>* lookahead, RegExpNode* on_success,
348 RegExpLookaround::Builder lookaround(false, on_success, stack_register,
357 RegExpNode* on_success,
372 compiler, trail_surrogates, lead_surrogates, on_success, true);
377 compiler, lead_surrogates, trail_surrogates, on_success, false);
383 RegExpNode* on_success,
398 compiler, trail_surrogates, lead_surrogates, on_success, true);
403 compiler, lead_surrogates, trail_surrogates, on_success, false);
409 RegExpNode* on_success) {
419 return TextNode::CreateForCharacterRanges(zone, range, false, on_success);
458 RegExpNode* on_success) {
469 return zone->New<TextNode>(this, compiler->read_backward(), on_success);
482 return zone->New<TextNode>(fail, compiler->read_backward(), on_success);
487 return UnanchoredAdvance(compiler, on_success);
497 AddBmpCharacters(compiler, result, on_success, &splitter);
498 AddNonBmpSurrogatePairs(compiler, result, on_success, &splitter);
499 AddLoneLeadSurrogates(compiler, result, on_success, &splitter);
500 AddLoneTrailSurrogates(compiler, result, on_success, &splitter);
819 RegExpNode* on_success) {
829 return alternatives->at(0)->ToNode(compiler, on_success);
839 alternatives->at(i)->ToNode(compiler, on_success));
846 RegExpNode* on_success) {
847 return ToNode(min(), max(), is_greedy(), body(), compiler, on_success);
854 RegExpNode* on_success,
873 RegExpLookaround::Builder lookbehind(lookbehind_for_word, on_success,
890 RegExpNode* on_success) {
896 return AssertionNode::AfterNewline(on_success);
898 return AssertionNode::AtStart(on_success);
902 compiler, on_success, Type::BOUNDARY, compiler->flags())
903 : AssertionNode::AtBoundary(on_success);
906 ? BoundaryAssertionAsLookaround(compiler, on_success,
909 : AssertionNode::AtNonBoundary(on_success);
911 return AssertionNode::AtEnd(on_success);
933 on_success));
940 GuardedAlternative end_alternative(AssertionNode::AtEnd(on_success));
950 RegExpNode* on_success) {
954 on_success);
958 RegExpNode* on_success) {
959 return on_success;
963 RegExpNode* on_success) {
964 return body_->ToNode(compiler, on_success);
967 RegExpLookaround::Builder::Builder(bool is_positive, RegExpNode* on_success,
973 on_success_(on_success),
1007 RegExpNode* on_success) {
1020 Builder builder(is_positive(), on_success, stack_pointer_register,
1029 RegExpNode* on_success) {
1030 return ToNode(body(), index(), compiler, on_success);
1035 RegExpNode* on_success) {
1040 RegExpNode* store_end = ActionNode::StorePosition(end_reg, true, on_success);
1132 RegExpNode* on_success) {
1139 RegExpNode* current = on_success;
1590 RegExpNode* on_success,
1614 if (max == 0) return on_success; // This can happen due to recursion.
1633 ToNode(0, new_max, is_greedy, body, compiler, on_success, true);
1648 RegExpNode* answer = on_success;
1654 alternation->AddAlternative(GuardedAlternative(on_success));
1656 alternation->AddAlternative(GuardedAlternative(on_success));
1702 GuardedAlternative rest_alt(on_success);