Lines Matching full:on_success
1492 RegExpNode* on_success) { in SetRegister() argument
1494 new(on_success->zone()) ActionNode(SET_REGISTER, on_success); in SetRegister()
1501 ActionNode* ActionNode::IncrementRegister(int reg, RegExpNode* on_success) { in IncrementRegister() argument
1503 new(on_success->zone()) ActionNode(INCREMENT_REGISTER, on_success); in IncrementRegister()
1511 RegExpNode* on_success) { in StorePosition() argument
1513 new(on_success->zone()) ActionNode(STORE_POSITION, on_success); in StorePosition()
1521 RegExpNode* on_success) { in ClearCaptures() argument
1523 new(on_success->zone()) ActionNode(CLEAR_CAPTURES, on_success); in ClearCaptures()
1532 RegExpNode* on_success) { in BeginSubmatch() argument
1534 new(on_success->zone()) ActionNode(BEGIN_SUBMATCH, on_success); in BeginSubmatch()
1545 RegExpNode* on_success) { in PositiveSubmatchSuccess() argument
1547 new(on_success->zone()) ActionNode(POSITIVE_SUBMATCH_SUCCESS, on_success); in PositiveSubmatchSuccess()
1559 RegExpNode* on_success) { in EmptyMatchCheck() argument
1561 new(on_success->zone()) ActionNode(EMPTY_MATCH_CHECK, on_success); in EmptyMatchCheck()
2290 return on_success()->EatsAtLeast(still_to_find, in EatsAtLeast()
2301 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo()
2317 return on_success()->EatsAtLeast(still_to_find, in EatsAtLeast()
2327 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo()
2337 return on_success()->EatsAtLeast(still_to_find, in EatsAtLeast()
2351 return answer + on_success()->EatsAtLeast(still_to_find - answer, in EatsAtLeast()
2685 on_success()-> GetQuickCheckDetails(details, in GetQuickCheckDetails()
3023 RegExpNode* on_success, in EmitHat() argument
3052 on_success->Emit(compiler, &new_trace); in EmitHat()
3137 on_success()->Emit(compiler, &new_trace); in BacktrackIfPrevious()
3149 return on_success()->GetQuickCheckDetails(details, in GetQuickCheckDetails()
3175 on_success()->Emit(compiler, &at_start_trace); in Emit()
3181 EmitHat(compiler, on_success(), trace); in Emit()
3189 on_success()->Emit(compiler, trace); in Emit()
3322 RegExpNode* on_success) { in CreateForCharacterRanges() argument
3328 return new (zone) TextNode(elms, read_backward, on_success); in CreateForCharacterRanges()
3335 RegExpNode* on_success) { in CreateForSurrogatePair() argument
3345 return new (zone) TextNode(elms, read_backward, on_success); in CreateForSurrogatePair()
3408 on_success()->Emit(compiler, &successor_trace); in Emit()
3464 return ranges->length() == 0 ? on_success() : NULL; in GetSuccessorOfOmnivorousTextNode()
3473 return ranges->at(0).IsEverything(max_char) ? on_success() : NULL; in GetSuccessorOfOmnivorousTextNode()
3498 node = seq_node->on_success(); in GreedyLoopTextLengthForAlternative()
4290 on_success()->Emit(compiler, &new_trace); in Emit()
4298 on_success()->Emit(compiler, &new_trace); in Emit()
4306 on_success()->Emit(compiler, &new_trace); in Emit()
4315 on_success()->Emit(compiler, &new_trace); in Emit()
4326 on_success()->Emit(compiler, trace); in Emit()
4342 on_success()->Emit(compiler, trace); in Emit()
4358 on_success()->Emit(compiler, trace); in Emit()
4373 on_success()->Emit(compiler, trace); in Emit()
4380 on_success()->Emit(compiler, &new_trace); in Emit()
4424 on_success()->Emit(compiler, trace); in Emit()
4640 os_ << " n" << that << " -> n" << that->on_success() << ";\n"; in VisitText()
4641 Visit(that->on_success()); in VisitText()
4649 os_ << " n" << that << " -> n" << that->on_success() << ";\n"; in VisitBackReference()
4650 Visit(that->on_success()); in VisitBackReference()
4681 RegExpNode* successor = that->on_success(); in VisitAssertion()
4724 RegExpNode* successor = that->on_success(); in VisitAction()
4780 RegExpNode* on_success) { in ToNode() argument
4785 TextNode(elms, compiler->read_backward(), on_success); in ToNode()
4790 RegExpNode* on_success) { in ToNode() argument
4792 TextNode(elements(), compiler->read_backward(), on_success); in ToNode()
4945 RegExpNode* on_success, UnicodeRangeSplitter* splitter) { in AddBmpCharacters() argument
4949 compiler->zone(), bmp, compiler->read_backward(), on_success))); in AddBmpCharacters()
4954 RegExpNode* on_success, in AddNonBmpSurrogatePairs() argument
4980 on_success))); in AddNonBmpSurrogatePairs()
4988 compiler->read_backward(), on_success))); in AddNonBmpSurrogatePairs()
4997 compiler->read_backward(), on_success))); in AddNonBmpSurrogatePairs()
5006 compiler->read_backward(), on_success))); in AddNonBmpSurrogatePairs()
5015 ZoneList<CharacterRange>* match, RegExpNode* on_success, in NegativeLookaroundAgainstReadDirectionAndMatch() argument
5019 zone, match, read_backward, on_success); in NegativeLookaroundAgainstReadDirectionAndMatch()
5032 ZoneList<CharacterRange>* lookahead, RegExpNode* on_success, in MatchAndNegativeLookaroundInReadDirection() argument
5037 RegExpLookaround::Builder lookaround(false, on_success, stack_register, in MatchAndNegativeLookaroundInReadDirection()
5047 RegExpNode* on_success, in AddLoneLeadSurrogates() argument
5061 compiler, trail_surrogates, lead_surrogates, on_success, true); in AddLoneLeadSurrogates()
5066 compiler, lead_surrogates, trail_surrogates, on_success, false); in AddLoneLeadSurrogates()
5073 RegExpNode* on_success, in AddLoneTrailSurrogates() argument
5087 compiler, trail_surrogates, lead_surrogates, on_success, true); in AddLoneTrailSurrogates()
5092 compiler, lead_surrogates, trail_surrogates, on_success, false); in AddLoneTrailSurrogates()
5098 RegExpNode* on_success) { in UnanchoredAdvance() argument
5108 return TextNode::CreateForCharacterRanges(zone, range, false, on_success); in UnanchoredAdvance()
5144 RegExpNode* on_success) { in ToNode() argument
5162 return new (zone) TextNode(fail, compiler->read_backward(), on_success); in ToNode()
5165 return UnanchoredAdvance(compiler, on_success); in ToNode()
5169 AddBmpCharacters(compiler, result, on_success, &splitter); in ToNode()
5170 AddNonBmpSurrogatePairs(compiler, result, on_success, &splitter); in ToNode()
5171 AddLoneLeadSurrogates(compiler, result, on_success, &splitter); in ToNode()
5172 AddLoneTrailSurrogates(compiler, result, on_success, &splitter); in ToNode()
5176 return new (zone) TextNode(this, compiler->read_backward(), on_success); in ToNode()
5408 RegExpNode* on_success) { in ToNode() argument
5416 return alternatives->at(0)->ToNode(compiler, on_success); in ToNode()
5426 on_success)); in ToNode()
5434 RegExpNode* on_success) { in ToNode() argument
5440 on_success); in ToNode()
5487 RegExpNode* on_success, in ToNode() argument
5511 if (max == 0) return on_success; // This can happen due to recursion. in ToNode()
5531 0, new_max, is_greedy, body, compiler, on_success, true); in ToNode()
5546 RegExpNode* answer = on_success; in ToNode()
5552 alternation->AddAlternative(GuardedAlternative(on_success)); in ToNode()
5554 alternation->AddAlternative(GuardedAlternative(on_success)); in ToNode()
5603 GuardedAlternative rest_alt(on_success); in ToNode()
5624 RegExpNode* on_success) { in ToNode() argument
5630 return AssertionNode::AfterNewline(on_success); in ToNode()
5632 return AssertionNode::AtStart(on_success); in ToNode()
5634 return AssertionNode::AtBoundary(on_success); in ToNode()
5636 return AssertionNode::AtNonBoundary(on_success); in ToNode()
5638 return AssertionNode::AtEnd(on_success); in ToNode()
5657 on_success)); in ToNode()
5666 GuardedAlternative end_alternative(AssertionNode::AtEnd(on_success)); in ToNode()
5673 return on_success; in ToNode()
5678 RegExpNode* on_success) { in ToNode() argument
5682 compiler->read_backward(), on_success); in ToNode()
5687 RegExpNode* on_success) { in ToNode() argument
5688 return on_success; in ToNode()
5692 RegExpLookaround::Builder::Builder(bool is_positive, RegExpNode* on_success, in Builder() argument
5698 on_success_(on_success), in Builder()
5734 RegExpNode* on_success) { in ToNode() argument
5747 Builder builder(is_positive(), on_success, stack_pointer_register, in ToNode()
5757 RegExpNode* on_success) { in ToNode() argument
5758 return ToNode(body(), index(), compiler, on_success); in ToNode()
5765 RegExpNode* on_success) { in ToNode() argument
5770 RegExpNode* store_end = ActionNode::StorePosition(end_reg, true, on_success); in ToNode()
5777 RegExpNode* on_success) { in ToNode() argument
5779 RegExpNode* current = on_success; in ToNode()
6319 EnsureAnalyzed(that->on_success()); in VisitText()
6327 RegExpNode* target = that->on_success(); in VisitAction()
6370 EnsureAnalyzed(that->on_success()); in VisitBackReference()
6375 EnsureAnalyzed(that->on_success()); in VisitAssertion()
6462 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, in FillInBMInfo()
6520 RegExpNode* target = that->on_success(); in VisitAssertion()
6577 RegExpNode* target = that->on_success(); in VisitAction()
6583 RegExpNode* on_success) { in OptionallyStepBackToLeadSurrogate() argument
6598 zone, lead_surrogates, true, on_success); in OptionallyStepBackToLeadSurrogate()
6606 optional_step_back->AddAlternative(GuardedAlternative(on_success)); in OptionallyStepBackToLeadSurrogate()