Lines Matching refs:RegExpNode
959 RegExpNode* start,
963 inline void AddWork(RegExpNode* node) { in AddWork()
1009 List<RegExpNode*>* work_list_;
1065 RegExpNode* start, in Assemble()
1078 List <RegExpNode*> work_list(0); in Assemble()
1087 RegExpNode* node = work_list.RemoveLast(); in Assemble()
1326 void Trace::Flush(RegExpCompiler* compiler, RegExpNode* successor) { in Flush()
1452 RegExpNode* on_success) { in SetRegister()
1461 ActionNode* ActionNode::IncrementRegister(int reg, RegExpNode* on_success) { in IncrementRegister()
1471 RegExpNode* on_success) { in StorePosition()
1481 RegExpNode* on_success) { in ClearCaptures()
1492 RegExpNode* on_success) { in BeginSubmatch()
1505 RegExpNode* on_success) { in PositiveSubmatchSuccess()
1519 RegExpNode* on_success) { in EmptyMatchCheck()
2206 RegExpNode::~RegExpNode() { in ~RegExpNode()
2210 RegExpNode::LimitResult RegExpNode::LimitVersions(RegExpCompiler* compiler, in LimitVersions()
2252 bool RegExpNode::KeepRecursing(RegExpCompiler* compiler) { in KeepRecursing()
2335 RegExpNode* node = alternatives_->at(1).node(); in EatsAtLeast()
2345 RegExpNode* node = alternatives_->at(1).node(); in GetQuickCheckDetails()
2352 RegExpNode* ignore_this_node, in EatsAtLeastHelper()
2359 RegExpNode* node = alternatives_->at(i).node(); in EatsAtLeastHelper()
2425 bool RegExpNode::EmitQuickCheck(RegExpCompiler* compiler, in EmitQuickCheck()
2740 RegExpNode* SeqRegExpNode::FilterOneByte(int depth, bool ignore_case) { in FilterOneByte()
2749 RegExpNode* SeqRegExpNode::FilterSuccessor(int depth, bool ignore_case) { in FilterSuccessor()
2750 RegExpNode* next = on_success_->FilterOneByte(depth - 1, ignore_case); in FilterSuccessor()
2774 RegExpNode* TextNode::FilterOneByte(int depth, bool ignore_case) { in FilterOneByte()
2828 RegExpNode* LoopChoiceNode::FilterOneByte(int depth, bool ignore_case) { in FilterOneByte()
2835 RegExpNode* continue_replacement = in FilterOneByte()
2846 RegExpNode* ChoiceNode::FilterOneByte(int depth, bool ignore_case) { in FilterOneByte()
2862 RegExpNode* survivor = NULL; in FilterOneByte()
2865 RegExpNode* replacement = in FilterOneByte()
2885 RegExpNode* replacement = in FilterOneByte()
2897 RegExpNode* NegativeLookaroundChoiceNode::FilterOneByte(int depth, in FilterOneByte()
2905 RegExpNode* node = alternatives_->at(1).node(); in FilterOneByte()
2906 RegExpNode* replacement = node->FilterOneByte(depth - 1, ignore_case); in FilterOneByte()
2910 RegExpNode* neg_node = alternatives_->at(0).node(); in FilterOneByte()
2911 RegExpNode* neg_replacement = neg_node->FilterOneByte(depth - 1, ignore_case); in FilterOneByte()
2958 RegExpNode* node = alternatives_->at(i).node(); in GetQuickCheckDetails()
2996 RegExpNode* on_success, in EmitHat()
3400 RegExpNode* TextNode::GetSuccessorOfOmnivorousTextNode( in GetSuccessorOfOmnivorousTextNode()
3432 RegExpNode* node = alternative->node(); in GreedyLoopTextLengthForAlternative()
4044 RegExpNode* eats_anything_node = alt1.node(); in EmitOptimizedUnanchoredSearch()
4376 void PrintNode(const char* label, RegExpNode* node);
4377 void Visit(RegExpNode* node);
4378 void PrintAttributes(RegExpNode* from);
4379 void PrintOnFailure(RegExpNode* from, RegExpNode* to);
4390 void DotPrinter::PrintNode(const char* label, RegExpNode* node) { in PrintNode()
4411 void DotPrinter::Visit(RegExpNode* node) { in Visit()
4418 void DotPrinter::PrintOnFailure(RegExpNode* from, RegExpNode* on_failure) { in PrintOnFailure()
4504 void DotPrinter::PrintAttributes(RegExpNode* that) { in PrintAttributes()
4617 RegExpNode* successor = that->on_success(); in VisitAssertion()
4660 RegExpNode* successor = that->on_success(); in VisitAction()
4701 RegExpNode* node, in DotPrint()
4715 RegExpNode* RegExpAtom::ToNode(RegExpCompiler* compiler, in ToNode()
4716 RegExpNode* on_success) { in ToNode()
4725 RegExpNode* RegExpText::ToNode(RegExpCompiler* compiler, in ToNode()
4726 RegExpNode* on_success) { in ToNode()
4823 RegExpNode* RegExpCharacterClass::ToNode(RegExpCompiler* compiler, in ToNode()
4824 RegExpNode* on_success) { in ToNode()
5056 RegExpNode* RegExpDisjunction::ToNode(RegExpCompiler* compiler, in ToNode()
5057 RegExpNode* on_success) { in ToNode()
5082 RegExpNode* RegExpQuantifier::ToNode(RegExpCompiler* compiler, in ToNode()
5083 RegExpNode* on_success) { in ToNode()
5131 RegExpNode* RegExpQuantifier::ToNode(int min, in ToNode()
5136 RegExpNode* on_success, in ToNode()
5179 RegExpNode* answer = ToNode( in ToNode()
5195 RegExpNode* answer = on_success; in ToNode()
5225 RegExpNode* loop_return = needs_counter in ToNode()
5226 ? static_cast<RegExpNode*>(ActionNode::IncrementRegister(reg_ctr, center)) in ToNode()
5227 : static_cast<RegExpNode*>(center); in ToNode()
5236 RegExpNode* body_node = body->ToNode(compiler, loop_return); in ToNode()
5272 RegExpNode* RegExpAssertion::ToNode(RegExpCompiler* compiler, in ToNode()
5273 RegExpNode* on_success) { in ToNode()
5308 RegExpNode* end_of_line = ActionNode::BeginSubmatch( in ToNode()
5326 RegExpNode* RegExpBackReference::ToNode(RegExpCompiler* compiler, in ToNode()
5327 RegExpNode* on_success) { in ToNode()
5335 RegExpNode* RegExpEmpty::ToNode(RegExpCompiler* compiler, in ToNode()
5336 RegExpNode* on_success) { in ToNode()
5341 RegExpNode* RegExpLookaround::ToNode(RegExpCompiler* compiler, in ToNode()
5342 RegExpNode* on_success) { in ToNode()
5352 RegExpNode* result; in ToNode()
5389 RegExpNode* RegExpCapture::ToNode(RegExpCompiler* compiler, in ToNode()
5390 RegExpNode* on_success) { in ToNode()
5395 RegExpNode* RegExpCapture::ToNode(RegExpTree* body, in ToNode()
5398 RegExpNode* on_success) { in ToNode()
5403 RegExpNode* store_end = ActionNode::StorePosition(end_reg, true, on_success); in ToNode()
5404 RegExpNode* body_node = body->ToNode(compiler, store_end); in ToNode()
5409 RegExpNode* RegExpAlternative::ToNode(RegExpCompiler* compiler, in ToNode()
5410 RegExpNode* on_success) { in ToNode()
5412 RegExpNode* current = on_success; in ToNode()
5959 void Analysis::EnsureAnalyzed(RegExpNode* that) { in EnsureAnalyzed()
6004 RegExpNode* target = that->on_success(); in VisitAction()
6017 RegExpNode* node = that->alternatives()->at(i).node(); in VisitChoice()
6030 RegExpNode* node = that->alternatives()->at(i).node(); in VisitLoopChoice()
6198 RegExpNode* target = that->on_success(); in VisitAssertion()
6255 RegExpNode* target = that->on_success(); in VisitAction()
6285 RegExpNode* captured_body = RegExpCapture::ToNode(data->tree, in Compile()
6289 RegExpNode* node = captured_body; in Compile()
6296 RegExpNode* loop_node = RegExpQuantifier::ToNode( in Compile()