Lines Matching refs:RegExpNode
949 RegExpNode* start, int capture_count,
952 inline void AddWork(RegExpNode* node) { in AddWork()
999 std::vector<RegExpNode*>* work_list_;
1053 Isolate* isolate, RegExpMacroAssembler* macro_assembler, RegExpNode* start, in Assemble()
1062 std::vector<RegExpNode*> work_list; in Assemble()
1071 RegExpNode* node = work_list.back(); in Assemble()
1307 void Trace::Flush(RegExpCompiler* compiler, RegExpNode* successor) { in Flush()
1432 RegExpNode* on_success) { in SetRegister()
1441 ActionNode* ActionNode::IncrementRegister(int reg, RegExpNode* on_success) { in IncrementRegister()
1451 RegExpNode* on_success) { in StorePosition()
1461 RegExpNode* on_success) { in ClearCaptures()
1472 RegExpNode* on_success) { in BeginSubmatch()
1485 RegExpNode* on_success) { in PositiveSubmatchSuccess()
1499 RegExpNode* on_success) { in EmptyMatchCheck()
2172 RegExpNode::~RegExpNode() { in ~RegExpNode()
2176 RegExpNode::LimitResult RegExpNode::LimitVersions(RegExpCompiler* compiler, in LimitVersions()
2218 bool RegExpNode::KeepRecursing(RegExpCompiler* compiler) { in KeepRecursing()
2299 RegExpNode* node = alternatives_->at(1).node(); in EatsAtLeast()
2309 RegExpNode* node = alternatives_->at(1).node(); in GetQuickCheckDetails()
2316 RegExpNode* ignore_this_node, in EatsAtLeastHelper()
2323 RegExpNode* node = alternatives_->at(i).node(); in EatsAtLeastHelper()
2386 bool RegExpNode::EmitQuickCheck(RegExpCompiler* compiler, in EmitQuickCheck()
2703 RegExpNode* SeqRegExpNode::FilterOneByte(int depth) { in FilterOneByte()
2711 RegExpNode* SeqRegExpNode::FilterSuccessor(int depth) { in FilterSuccessor()
2712 RegExpNode* next = on_success_->FilterOneByte(depth - 1); in FilterSuccessor()
2734 RegExpNode* TextNode::FilterOneByte(int depth) { in FilterOneByte()
2784 RegExpNode* LoopChoiceNode::FilterOneByte(int depth) { in FilterOneByte()
2791 RegExpNode* continue_replacement = continue_node_->FilterOneByte(depth - 1); in FilterOneByte()
2800 RegExpNode* ChoiceNode::FilterOneByte(int depth) { in FilterOneByte()
2817 RegExpNode* survivor = nullptr; in FilterOneByte()
2820 RegExpNode* replacement = alternative.node()->FilterOneByte(depth - 1); in FilterOneByte()
2839 RegExpNode* replacement = in FilterOneByte()
2850 RegExpNode* NegativeLookaroundChoiceNode::FilterOneByte(int depth) { in FilterOneByte()
2857 RegExpNode* node = alternatives_->at(1).node(); in FilterOneByte()
2858 RegExpNode* replacement = node->FilterOneByte(depth - 1); in FilterOneByte()
2862 RegExpNode* neg_node = alternatives_->at(0).node(); in FilterOneByte()
2863 RegExpNode* neg_replacement = neg_node->FilterOneByte(depth - 1); in FilterOneByte()
2910 RegExpNode* node = alternatives_->at(i).node(); in GetQuickCheckDetails()
2948 RegExpNode* on_success, in EmitHat()
3252 RegExpNode* on_success, in CreateForCharacterRanges()
3265 RegExpNode* on_success, in CreateForSurrogatePair()
3382 RegExpNode* TextNode::GetSuccessorOfOmnivorousTextNode( in GetSuccessorOfOmnivorousTextNode()
3412 RegExpNode* node = alternative->node(); in GreedyLoopTextLengthForAlternative()
4031 RegExpNode* eats_anything_node = alt1.node(); in EmitOptimizedUnanchoredSearch()
4366 void PrintNode(const char* label, RegExpNode* node);
4367 void Visit(RegExpNode* node);
4368 void PrintAttributes(RegExpNode* from);
4369 void PrintOnFailure(RegExpNode* from, RegExpNode* to);
4380 void DotPrinter::PrintNode(const char* label, RegExpNode* node) { in PrintNode()
4401 void DotPrinter::Visit(RegExpNode* node) { in Visit()
4408 void DotPrinter::PrintOnFailure(RegExpNode* from, RegExpNode* on_failure) { in PrintOnFailure()
4494 void DotPrinter::PrintAttributes(RegExpNode* that) { in PrintAttributes()
4607 RegExpNode* successor = that->on_success(); in VisitAssertion()
4650 RegExpNode* successor = that->on_success(); in VisitAction()
4691 RegExpNode* node, in DotPrint()
4705 RegExpNode* RegExpAtom::ToNode(RegExpCompiler* compiler, in ToNode()
4706 RegExpNode* on_success) { in ToNode()
4715 RegExpNode* RegExpText::ToNode(RegExpCompiler* compiler, in ToNode()
4716 RegExpNode* on_success) { in ToNode()
4871 RegExpNode* on_success, UnicodeRangeSplitter* splitter) { in AddBmpCharacters()
4881 RegExpNode* on_success, in AddNonBmpSurrogatePairs()
4939 RegExpNode* NegativeLookaroundAgainstReadDirectionAndMatch( in NegativeLookaroundAgainstReadDirectionAndMatch()
4941 ZoneList<CharacterRange>* match, RegExpNode* on_success, bool read_backward, in NegativeLookaroundAgainstReadDirectionAndMatch()
4944 RegExpNode* match_node = TextNode::CreateForCharacterRanges( in NegativeLookaroundAgainstReadDirectionAndMatch()
4950 RegExpNode* negative_match = TextNode::CreateForCharacterRanges( in NegativeLookaroundAgainstReadDirectionAndMatch()
4955 RegExpNode* MatchAndNegativeLookaroundInReadDirection( in MatchAndNegativeLookaroundInReadDirection()
4957 ZoneList<CharacterRange>* lookahead, RegExpNode* on_success, in MatchAndNegativeLookaroundInReadDirection()
4964 RegExpNode* negative_match = TextNode::CreateForCharacterRanges( in MatchAndNegativeLookaroundInReadDirection()
4971 RegExpNode* on_success, in AddLoneLeadSurrogates()
4981 RegExpNode* match; in AddLoneLeadSurrogates()
4999 RegExpNode* on_success, in AddLoneTrailSurrogates()
5009 RegExpNode* match; in AddLoneTrailSurrogates()
5026 RegExpNode* UnanchoredAdvance(RegExpCompiler* compiler, in UnanchoredAdvance()
5027 RegExpNode* on_success) { in UnanchoredAdvance()
5075 RegExpNode* RegExpCharacterClass::ToNode(RegExpCompiler* compiler, in ToNode()
5076 RegExpNode* on_success) { in ToNode()
5361 RegExpNode* RegExpDisjunction::ToNode(RegExpCompiler* compiler, in ToNode()
5362 RegExpNode* on_success) { in ToNode()
5387 RegExpNode* RegExpQuantifier::ToNode(RegExpCompiler* compiler, in ToNode()
5388 RegExpNode* on_success) { in ToNode()
5436 RegExpNode* RegExpQuantifier::ToNode(int min, in ToNode()
5441 RegExpNode* on_success, in ToNode()
5484 RegExpNode* answer = ToNode( in ToNode()
5500 RegExpNode* answer = on_success; in ToNode()
5530 RegExpNode* loop_return = needs_counter in ToNode()
5531 ? static_cast<RegExpNode*>(ActionNode::IncrementRegister(reg_ctr, center)) in ToNode()
5532 : static_cast<RegExpNode*>(center); in ToNode()
5541 RegExpNode* body_node = body->ToNode(compiler, loop_return); in ToNode()
5579 RegExpNode* BoundaryAssertionAsLookaround(RegExpCompiler* compiler, in BoundaryAssertionAsLookaround()
5580 RegExpNode* on_success, in BoundaryAssertionAsLookaround()
5600 RegExpNode* backward = TextNode::CreateForCharacterRanges( in BoundaryAssertionAsLookaround()
5606 RegExpNode* forward = TextNode::CreateForCharacterRanges( in BoundaryAssertionAsLookaround()
5614 RegExpNode* RegExpAssertion::ToNode(RegExpCompiler* compiler, in ToNode()
5615 RegExpNode* on_success) { in ToNode()
5658 RegExpNode* end_of_line = ActionNode::BeginSubmatch( in ToNode()
5676 RegExpNode* RegExpBackReference::ToNode(RegExpCompiler* compiler, in ToNode()
5677 RegExpNode* on_success) { in ToNode()
5685 RegExpNode* RegExpEmpty::ToNode(RegExpCompiler* compiler, in ToNode()
5686 RegExpNode* on_success) { in ToNode()
5691 RegExpLookaround::Builder::Builder(bool is_positive, RegExpNode* on_success, in Builder()
5713 RegExpNode* RegExpLookaround::Builder::ForMatch(RegExpNode* match) { in ForMatch()
5732 RegExpNode* RegExpLookaround::ToNode(RegExpCompiler* compiler, in ToNode()
5733 RegExpNode* on_success) { in ToNode()
5743 RegExpNode* result; in ToNode()
5748 RegExpNode* match = body_->ToNode(compiler, builder.on_match_success()); in ToNode()
5755 RegExpNode* RegExpCapture::ToNode(RegExpCompiler* compiler, in ToNode()
5756 RegExpNode* on_success) { in ToNode()
5761 RegExpNode* RegExpCapture::ToNode(RegExpTree* body, in ToNode()
5764 RegExpNode* on_success) { in ToNode()
5769 RegExpNode* store_end = ActionNode::StorePosition(end_reg, true, on_success); in ToNode()
5770 RegExpNode* body_node = body->ToNode(compiler, store_end); in ToNode()
5775 RegExpNode* RegExpAlternative::ToNode(RegExpCompiler* compiler, in ToNode()
5776 RegExpNode* on_success) { in ToNode()
5778 RegExpNode* current = on_success; in ToNode()
6302 void Analysis::EnsureAnalyzed(RegExpNode* that) { in EnsureAnalyzed()
6345 RegExpNode* target = that->on_success(); in VisitAction()
6358 RegExpNode* node = that->alternatives()->at(i).node(); in VisitChoice()
6371 RegExpNode* node = that->alternatives()->at(i).node(); in VisitLoopChoice()
6538 RegExpNode* target = that->on_success(); in VisitAssertion()
6595 RegExpNode* target = that->on_success(); in VisitAction()
6599 RegExpNode* OptionallyStepBackToLeadSurrogate(RegExpCompiler* compiler, in OptionallyStepBackToLeadSurrogate()
6600 RegExpNode* on_success, in OptionallyStepBackToLeadSurrogate()
6615 RegExpNode* step_back = TextNode::CreateForCharacterRanges( in OptionallyStepBackToLeadSurrogate()
6619 RegExpNode* match_trail = TextNode::CreateForCharacterRanges( in OptionallyStepBackToLeadSurrogate()
6658 RegExpNode* captured_body = RegExpCapture::ToNode(data->tree, in Compile()
6662 RegExpNode* node = captured_body; in Compile()
6670 RegExpNode* loop_node = RegExpQuantifier::ToNode( in Compile()