Lines Matching refs:RegExpNode
995 RegExpNode* start,
999 inline void AddWork(RegExpNode* node) { in AddWork()
1048 List<RegExpNode*>* work_list_;
1106 RegExpNode* start, in Assemble()
1118 List <RegExpNode*> work_list(0); in Assemble()
1127 RegExpNode* node = work_list.RemoveLast(); in Assemble()
1366 void Trace::Flush(RegExpCompiler* compiler, RegExpNode* successor) { in Flush()
1492 RegExpNode* on_success) { in SetRegister()
1501 ActionNode* ActionNode::IncrementRegister(int reg, RegExpNode* on_success) { in IncrementRegister()
1511 RegExpNode* on_success) { in StorePosition()
1521 RegExpNode* on_success) { in ClearCaptures()
1532 RegExpNode* on_success) { in BeginSubmatch()
1545 RegExpNode* on_success) { in PositiveSubmatchSuccess()
1559 RegExpNode* on_success) { in EmptyMatchCheck()
2233 RegExpNode::~RegExpNode() { in ~RegExpNode()
2237 RegExpNode::LimitResult RegExpNode::LimitVersions(RegExpCompiler* compiler, in LimitVersions()
2279 bool RegExpNode::KeepRecursing(RegExpCompiler* compiler) { in KeepRecursing()
2362 RegExpNode* node = alternatives_->at(1).node(); in EatsAtLeast()
2372 RegExpNode* node = alternatives_->at(1).node(); in GetQuickCheckDetails()
2379 RegExpNode* ignore_this_node, in EatsAtLeastHelper()
2386 RegExpNode* node = alternatives_->at(i).node(); in EatsAtLeastHelper()
2452 bool RegExpNode::EmitQuickCheck(RegExpCompiler* compiler, in EmitQuickCheck()
2769 RegExpNode* SeqRegExpNode::FilterOneByte(int depth, bool ignore_case) { in FilterOneByte()
2778 RegExpNode* SeqRegExpNode::FilterSuccessor(int depth, bool ignore_case) { in FilterSuccessor()
2779 RegExpNode* next = on_success_->FilterOneByte(depth - 1, ignore_case); in FilterSuccessor()
2803 RegExpNode* TextNode::FilterOneByte(int depth, bool ignore_case) { in FilterOneByte()
2855 RegExpNode* LoopChoiceNode::FilterOneByte(int depth, bool ignore_case) { in FilterOneByte()
2862 RegExpNode* continue_replacement = in FilterOneByte()
2873 RegExpNode* ChoiceNode::FilterOneByte(int depth, bool ignore_case) { in FilterOneByte()
2889 RegExpNode* survivor = NULL; in FilterOneByte()
2892 RegExpNode* replacement = in FilterOneByte()
2912 RegExpNode* replacement = in FilterOneByte()
2924 RegExpNode* NegativeLookaroundChoiceNode::FilterOneByte(int depth, in FilterOneByte()
2932 RegExpNode* node = alternatives_->at(1).node(); in FilterOneByte()
2933 RegExpNode* replacement = node->FilterOneByte(depth - 1, ignore_case); in FilterOneByte()
2937 RegExpNode* neg_node = alternatives_->at(0).node(); in FilterOneByte()
2938 RegExpNode* neg_replacement = neg_node->FilterOneByte(depth - 1, ignore_case); in FilterOneByte()
2985 RegExpNode* node = alternatives_->at(i).node(); in GetQuickCheckDetails()
3023 RegExpNode* on_success, in EmitHat()
3322 RegExpNode* on_success) { in CreateForCharacterRanges()
3335 RegExpNode* on_success) { in CreateForSurrogatePair()
3454 RegExpNode* TextNode::GetSuccessorOfOmnivorousTextNode( in GetSuccessorOfOmnivorousTextNode()
3484 RegExpNode* node = alternative->node(); in GreedyLoopTextLengthForAlternative()
4103 RegExpNode* eats_anything_node = alt1.node(); in EmitOptimizedUnanchoredSearch()
4440 void PrintNode(const char* label, RegExpNode* node);
4441 void Visit(RegExpNode* node);
4442 void PrintAttributes(RegExpNode* from);
4443 void PrintOnFailure(RegExpNode* from, RegExpNode* to);
4454 void DotPrinter::PrintNode(const char* label, RegExpNode* node) { in PrintNode()
4475 void DotPrinter::Visit(RegExpNode* node) { in Visit()
4482 void DotPrinter::PrintOnFailure(RegExpNode* from, RegExpNode* on_failure) { in PrintOnFailure()
4568 void DotPrinter::PrintAttributes(RegExpNode* that) { in PrintAttributes()
4681 RegExpNode* successor = that->on_success(); in VisitAssertion()
4724 RegExpNode* successor = that->on_success(); in VisitAction()
4765 RegExpNode* node, in DotPrint()
4779 RegExpNode* RegExpAtom::ToNode(RegExpCompiler* compiler, in ToNode()
4780 RegExpNode* on_success) { in ToNode()
4789 RegExpNode* RegExpText::ToNode(RegExpCompiler* compiler, in ToNode()
4790 RegExpNode* on_success) { in ToNode()
4945 RegExpNode* on_success, UnicodeRangeSplitter* splitter) { in AddBmpCharacters()
4954 RegExpNode* on_success, in AddNonBmpSurrogatePairs()
5013 RegExpNode* NegativeLookaroundAgainstReadDirectionAndMatch( in NegativeLookaroundAgainstReadDirectionAndMatch()
5015 ZoneList<CharacterRange>* match, RegExpNode* on_success, in NegativeLookaroundAgainstReadDirectionAndMatch()
5018 RegExpNode* match_node = TextNode::CreateForCharacterRanges( in NegativeLookaroundAgainstReadDirectionAndMatch()
5024 RegExpNode* negative_match = TextNode::CreateForCharacterRanges( in NegativeLookaroundAgainstReadDirectionAndMatch()
5030 RegExpNode* MatchAndNegativeLookaroundInReadDirection( in MatchAndNegativeLookaroundInReadDirection()
5032 ZoneList<CharacterRange>* lookahead, RegExpNode* on_success, in MatchAndNegativeLookaroundInReadDirection()
5039 RegExpNode* negative_match = TextNode::CreateForCharacterRanges( in MatchAndNegativeLookaroundInReadDirection()
5047 RegExpNode* on_success, in AddLoneLeadSurrogates()
5056 RegExpNode* match; in AddLoneLeadSurrogates()
5073 RegExpNode* on_success, in AddLoneTrailSurrogates()
5082 RegExpNode* match; in AddLoneTrailSurrogates()
5097 RegExpNode* UnanchoredAdvance(RegExpCompiler* compiler, in UnanchoredAdvance()
5098 RegExpNode* on_success) { in UnanchoredAdvance()
5143 RegExpNode* RegExpCharacterClass::ToNode(RegExpCompiler* compiler, in ToNode()
5144 RegExpNode* on_success) { in ToNode()
5407 RegExpNode* RegExpDisjunction::ToNode(RegExpCompiler* compiler, in ToNode()
5408 RegExpNode* on_success) { in ToNode()
5433 RegExpNode* RegExpQuantifier::ToNode(RegExpCompiler* compiler, in ToNode()
5434 RegExpNode* on_success) { in ToNode()
5482 RegExpNode* RegExpQuantifier::ToNode(int min, in ToNode()
5487 RegExpNode* on_success, in ToNode()
5530 RegExpNode* answer = ToNode( in ToNode()
5546 RegExpNode* answer = on_success; in ToNode()
5576 RegExpNode* loop_return = needs_counter in ToNode()
5577 ? static_cast<RegExpNode*>(ActionNode::IncrementRegister(reg_ctr, center)) in ToNode()
5578 : static_cast<RegExpNode*>(center); in ToNode()
5587 RegExpNode* body_node = body->ToNode(compiler, loop_return); in ToNode()
5623 RegExpNode* RegExpAssertion::ToNode(RegExpCompiler* compiler, in ToNode()
5624 RegExpNode* on_success) { in ToNode()
5659 RegExpNode* end_of_line = ActionNode::BeginSubmatch( in ToNode()
5677 RegExpNode* RegExpBackReference::ToNode(RegExpCompiler* compiler, in ToNode()
5678 RegExpNode* on_success) { in ToNode()
5686 RegExpNode* RegExpEmpty::ToNode(RegExpCompiler* compiler, in ToNode()
5687 RegExpNode* on_success) { in ToNode()
5692 RegExpLookaround::Builder::Builder(bool is_positive, RegExpNode* on_success, in Builder()
5714 RegExpNode* RegExpLookaround::Builder::ForMatch(RegExpNode* match) { in ForMatch()
5733 RegExpNode* RegExpLookaround::ToNode(RegExpCompiler* compiler, in ToNode()
5734 RegExpNode* on_success) { in ToNode()
5744 RegExpNode* result; in ToNode()
5749 RegExpNode* match = body_->ToNode(compiler, builder.on_match_success()); in ToNode()
5756 RegExpNode* RegExpCapture::ToNode(RegExpCompiler* compiler, in ToNode()
5757 RegExpNode* on_success) { in ToNode()
5762 RegExpNode* RegExpCapture::ToNode(RegExpTree* body, in ToNode()
5765 RegExpNode* on_success) { in ToNode()
5770 RegExpNode* store_end = ActionNode::StorePosition(end_reg, true, on_success); in ToNode()
5771 RegExpNode* body_node = body->ToNode(compiler, store_end); in ToNode()
5776 RegExpNode* RegExpAlternative::ToNode(RegExpCompiler* compiler, in ToNode()
5777 RegExpNode* on_success) { in ToNode()
5779 RegExpNode* current = on_success; in ToNode()
6282 void Analysis::EnsureAnalyzed(RegExpNode* that) { in EnsureAnalyzed()
6327 RegExpNode* target = that->on_success(); in VisitAction()
6340 RegExpNode* node = that->alternatives()->at(i).node(); in VisitChoice()
6353 RegExpNode* node = that->alternatives()->at(i).node(); in VisitLoopChoice()
6520 RegExpNode* target = that->on_success(); in VisitAssertion()
6577 RegExpNode* target = that->on_success(); in VisitAction()
6582 RegExpNode* OptionallyStepBackToLeadSurrogate(RegExpCompiler* compiler, in OptionallyStepBackToLeadSurrogate()
6583 RegExpNode* on_success) { in OptionallyStepBackToLeadSurrogate()
6597 RegExpNode* step_back = TextNode::CreateForCharacterRanges( in OptionallyStepBackToLeadSurrogate()
6601 RegExpNode* match_trail = TextNode::CreateForCharacterRanges( in OptionallyStepBackToLeadSurrogate()
6641 RegExpNode* captured_body = RegExpCapture::ToNode(data->tree, in Compile()
6645 RegExpNode* node = captured_body; in Compile()
6652 RegExpNode* loop_node = RegExpQuantifier::ToNode( in Compile()