Lines Matching full:on_success
1432 RegExpNode* on_success) { in SetRegister() argument
1434 new(on_success->zone()) ActionNode(SET_REGISTER, on_success); in SetRegister()
1441 ActionNode* ActionNode::IncrementRegister(int reg, RegExpNode* on_success) { in IncrementRegister() argument
1443 new(on_success->zone()) ActionNode(INCREMENT_REGISTER, on_success); in IncrementRegister()
1451 RegExpNode* on_success) { in StorePosition() argument
1453 new(on_success->zone()) ActionNode(STORE_POSITION, on_success); in StorePosition()
1461 RegExpNode* on_success) { in ClearCaptures() argument
1463 new(on_success->zone()) ActionNode(CLEAR_CAPTURES, on_success); in ClearCaptures()
1472 RegExpNode* on_success) { in BeginSubmatch() argument
1474 new(on_success->zone()) ActionNode(BEGIN_SUBMATCH, on_success); in BeginSubmatch()
1485 RegExpNode* on_success) { in PositiveSubmatchSuccess() argument
1487 new(on_success->zone()) ActionNode(POSITIVE_SUBMATCH_SUCCESS, on_success); in PositiveSubmatchSuccess()
1499 RegExpNode* on_success) { in EmptyMatchCheck() argument
1501 new(on_success->zone()) ActionNode(EMPTY_MATCH_CHECK, on_success); in EmptyMatchCheck()
2229 return on_success()->EatsAtLeast(still_to_find, in EatsAtLeast()
2238 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo()
2254 return on_success()->EatsAtLeast(still_to_find, in EatsAtLeast()
2264 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo()
2274 return on_success()->EatsAtLeast(still_to_find, in EatsAtLeast()
2288 return answer + on_success()->EatsAtLeast(still_to_find - answer, in EatsAtLeast()
2620 on_success()-> GetQuickCheckDetails(details, in GetQuickCheckDetails()
2948 RegExpNode* on_success, in EmitHat() argument
2977 on_success->Emit(compiler, &new_trace); in EmitHat()
3062 on_success()->Emit(compiler, &new_trace); in BacktrackIfPrevious()
3074 return on_success()->GetQuickCheckDetails(details, in GetQuickCheckDetails()
3100 on_success()->Emit(compiler, &at_start_trace); in Emit()
3106 EmitHat(compiler, on_success(), trace); in Emit()
3114 on_success()->Emit(compiler, trace); in Emit()
3252 RegExpNode* on_success, in CreateForCharacterRanges() argument
3259 return new (zone) TextNode(elms, read_backward, on_success); in CreateForCharacterRanges()
3265 RegExpNode* on_success, in CreateForSurrogatePair() argument
3276 return new (zone) TextNode(elms, read_backward, on_success); in CreateForSurrogatePair()
3327 on_success()->Emit(compiler, &successor_trace); in Emit()
3392 return ranges->length() == 0 ? on_success() : nullptr; in GetSuccessorOfOmnivorousTextNode()
3401 return ranges->at(0).IsEverything(max_char) ? on_success() : nullptr; in GetSuccessorOfOmnivorousTextNode()
3426 node = seq_node->on_success(); in GreedyLoopTextLengthForAlternative()
4216 on_success()->Emit(compiler, &new_trace); in Emit()
4224 on_success()->Emit(compiler, &new_trace); in Emit()
4232 on_success()->Emit(compiler, &new_trace); in Emit()
4241 on_success()->Emit(compiler, &new_trace); in Emit()
4252 on_success()->Emit(compiler, trace); in Emit()
4268 on_success()->Emit(compiler, trace); in Emit()
4284 on_success()->Emit(compiler, trace); in Emit()
4299 on_success()->Emit(compiler, trace); in Emit()
4306 on_success()->Emit(compiler, &new_trace); in Emit()
4350 on_success()->Emit(compiler, trace); in Emit()
4566 os_ << " n" << that << " -> n" << that->on_success() << ";\n"; in VisitText()
4567 Visit(that->on_success()); in VisitText()
4575 os_ << " n" << that << " -> n" << that->on_success() << ";\n"; in VisitBackReference()
4576 Visit(that->on_success()); in VisitBackReference()
4607 RegExpNode* successor = that->on_success(); in VisitAssertion()
4650 RegExpNode* successor = that->on_success(); in VisitAction()
4706 RegExpNode* on_success) { in ToNode() argument
4711 TextNode(elms, compiler->read_backward(), on_success); in ToNode()
4716 RegExpNode* on_success) { in ToNode() argument
4718 TextNode(elements(), compiler->read_backward(), on_success); in ToNode()
4871 RegExpNode* on_success, UnicodeRangeSplitter* splitter) { in AddBmpCharacters() argument
4876 compiler->zone(), bmp, compiler->read_backward(), on_success, in AddBmpCharacters()
4881 RegExpNode* on_success, in AddNonBmpSurrogatePairs() argument
4907 on_success, default_flags))); in AddNonBmpSurrogatePairs()
4915 compiler->read_backward(), on_success, default_flags))); in AddNonBmpSurrogatePairs()
4924 compiler->read_backward(), on_success, default_flags))); in AddNonBmpSurrogatePairs()
4933 compiler->read_backward(), on_success, default_flags))); in AddNonBmpSurrogatePairs()
4941 ZoneList<CharacterRange>* match, RegExpNode* on_success, bool read_backward, in NegativeLookaroundAgainstReadDirectionAndMatch() argument
4945 zone, match, read_backward, on_success, flags); in NegativeLookaroundAgainstReadDirectionAndMatch()
4957 ZoneList<CharacterRange>* lookahead, RegExpNode* on_success, in MatchAndNegativeLookaroundInReadDirection() argument
4962 RegExpLookaround::Builder lookaround(false, on_success, stack_register, in MatchAndNegativeLookaroundInReadDirection()
4971 RegExpNode* on_success, in AddLoneLeadSurrogates() argument
4986 compiler, trail_surrogates, lead_surrogates, on_success, true, in AddLoneLeadSurrogates()
4992 compiler, lead_surrogates, trail_surrogates, on_success, false, in AddLoneLeadSurrogates()
4999 RegExpNode* on_success, in AddLoneTrailSurrogates() argument
5014 compiler, trail_surrogates, lead_surrogates, on_success, true, in AddLoneTrailSurrogates()
5020 compiler, lead_surrogates, trail_surrogates, on_success, false, in AddLoneTrailSurrogates()
5027 RegExpNode* on_success) { in UnanchoredAdvance() argument
5038 return TextNode::CreateForCharacterRanges(zone, range, false, on_success, in UnanchoredAdvance()
5076 RegExpNode* on_success) { in ToNode() argument
5095 return new (zone) TextNode(fail, compiler->read_backward(), on_success); in ToNode()
5098 return UnanchoredAdvance(compiler, on_success); in ToNode()
5102 AddBmpCharacters(compiler, result, on_success, &splitter); in ToNode()
5103 AddNonBmpSurrogatePairs(compiler, result, on_success, &splitter); in ToNode()
5104 AddLoneLeadSurrogates(compiler, result, on_success, &splitter); in ToNode()
5105 AddLoneTrailSurrogates(compiler, result, on_success, &splitter); in ToNode()
5109 return new (zone) TextNode(this, compiler->read_backward(), on_success); in ToNode()
5362 RegExpNode* on_success) { in ToNode() argument
5370 return alternatives->at(0)->ToNode(compiler, on_success); in ToNode()
5380 on_success)); in ToNode()
5388 RegExpNode* on_success) { in ToNode() argument
5394 on_success); in ToNode()
5441 RegExpNode* on_success, in ToNode() argument
5465 if (max == 0) return on_success; // This can happen due to recursion. in ToNode()
5485 0, new_max, is_greedy, body, compiler, on_success, true); in ToNode()
5500 RegExpNode* answer = on_success; in ToNode()
5506 alternation->AddAlternative(GuardedAlternative(on_success)); in ToNode()
5508 alternation->AddAlternative(GuardedAlternative(on_success)); in ToNode()
5557 GuardedAlternative rest_alt(on_success); in ToNode()
5580 RegExpNode* on_success, in BoundaryAssertionAsLookaround() argument
5598 RegExpLookaround::Builder lookbehind(lookbehind_for_word, on_success, in BoundaryAssertionAsLookaround()
5615 RegExpNode* on_success) { in ToNode() argument
5621 return AssertionNode::AfterNewline(on_success); in ToNode()
5623 return AssertionNode::AtStart(on_success); in ToNode()
5626 ? BoundaryAssertionAsLookaround(compiler, on_success, BOUNDARY, in ToNode()
5628 : AssertionNode::AtBoundary(on_success); in ToNode()
5631 ? BoundaryAssertionAsLookaround(compiler, on_success, in ToNode()
5633 : AssertionNode::AtNonBoundary(on_success); in ToNode()
5635 return AssertionNode::AtEnd(on_success); in ToNode()
5656 on_success)); in ToNode()
5665 GuardedAlternative end_alternative(AssertionNode::AtEnd(on_success)); in ToNode()
5672 return on_success; in ToNode()
5677 RegExpNode* on_success) { in ToNode() argument
5681 compiler->read_backward(), on_success); in ToNode()
5686 RegExpNode* on_success) { in ToNode() argument
5687 return on_success; in ToNode()
5691 RegExpLookaround::Builder::Builder(bool is_positive, RegExpNode* on_success, in Builder() argument
5697 on_success_(on_success), in Builder()
5733 RegExpNode* on_success) { in ToNode() argument
5746 Builder builder(is_positive(), on_success, stack_pointer_register, in ToNode()
5756 RegExpNode* on_success) { in ToNode() argument
5757 return ToNode(body(), index(), compiler, on_success); in ToNode()
5764 RegExpNode* on_success) { in ToNode() argument
5769 RegExpNode* store_end = ActionNode::StorePosition(end_reg, true, on_success); in ToNode()
5776 RegExpNode* on_success) { in ToNode() argument
5778 RegExpNode* current = on_success; in ToNode()
6337 EnsureAnalyzed(that->on_success()); in VisitText()
6345 RegExpNode* target = that->on_success(); in VisitAction()
6388 EnsureAnalyzed(that->on_success()); in VisitBackReference()
6393 EnsureAnalyzed(that->on_success()); in VisitAssertion()
6480 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, in FillInBMInfo()
6538 RegExpNode* target = that->on_success(); in VisitAssertion()
6595 RegExpNode* target = that->on_success(); in VisitAction()
6600 RegExpNode* on_success, in OptionallyStepBackToLeadSurrogate() argument
6616 zone, lead_surrogates, true, on_success, flags); in OptionallyStepBackToLeadSurrogate()
6624 optional_step_back->AddAlternative(GuardedAlternative(on_success)); in OptionallyStepBackToLeadSurrogate()