Lines Matching refs:RegExpNode

33 RegExpNode* RegExpAtom::ToNode(RegExpCompiler* compiler,
34                                RegExpNode* on_success) {
42 RegExpNode* RegExpText::ToNode(RegExpCompiler* compiler,
43                                RegExpNode* on_success) {
208                       RegExpNode* on_success, UnicodeRangeSplitter* splitter) {
228                              RegExpNode* on_success,
325 RegExpNode* NegativeLookaroundAgainstReadDirectionAndMatch(
327     ZoneList<CharacterRange>* match, RegExpNode* on_success,
330   RegExpNode* match_node = TextNode::CreateForCharacterRanges(
336   RegExpNode* negative_match = TextNode::CreateForCharacterRanges(
341 RegExpNode* MatchAndNegativeLookaroundInReadDirection(
343     ZoneList<CharacterRange>* lookahead, RegExpNode* on_success,
350   RegExpNode* negative_match = TextNode::CreateForCharacterRanges(
357                            RegExpNode* on_success,
367   RegExpNode* match;
383                             RegExpNode* on_success,
393   RegExpNode* match;
408 RegExpNode* UnanchoredAdvance(RegExpCompiler* compiler,
409                               RegExpNode* on_success) {
457 RegExpNode* RegExpCharacterClass::ToNode(RegExpCompiler* compiler,
458                                          RegExpNode* on_success) {
818 RegExpNode* RegExpDisjunction::ToNode(RegExpCompiler* compiler,
819                                       RegExpNode* on_success) {
845 RegExpNode* RegExpQuantifier::ToNode(RegExpCompiler* compiler,
846                                      RegExpNode* on_success) {
853 RegExpNode* BoundaryAssertionAsLookaround(RegExpCompiler* compiler,
854                                           RegExpNode* on_success,
875     RegExpNode* backward = TextNode::CreateForCharacterRanges(
881     RegExpNode* forward = TextNode::CreateForCharacterRanges(
889 RegExpNode* RegExpAssertion::ToNode(RegExpCompiler* compiler,
890                                     RegExpNode* on_success) {
935       RegExpNode* end_of_line = ActionNode::BeginPositiveSubmatch(
949 RegExpNode* RegExpBackReference::ToNode(RegExpCompiler* compiler,
950                                         RegExpNode* on_success) {
957 RegExpNode* RegExpEmpty::ToNode(RegExpCompiler* compiler,
958                                 RegExpNode* on_success) {
962 RegExpNode* RegExpGroup::ToNode(RegExpCompiler* compiler,
963                                 RegExpNode* on_success) {
967 RegExpLookaround::Builder::Builder(bool is_positive, RegExpNode* on_success,
988 RegExpNode* RegExpLookaround::Builder::ForMatch(RegExpNode* match) {
1006 RegExpNode* RegExpLookaround::ToNode(RegExpCompiler* compiler,
1007                                      RegExpNode* on_success) {
1017   RegExpNode* result;
1022   RegExpNode* match = body_->ToNode(compiler, builder.on_match_success());
1028 RegExpNode* RegExpCapture::ToNode(RegExpCompiler* compiler,
1029                                   RegExpNode* on_success) {
1033 RegExpNode* RegExpCapture::ToNode(RegExpTree* body, int index,
1035                                   RegExpNode* on_success) {
1040   RegExpNode* store_end = ActionNode::StorePosition(end_reg, true, on_success);
1041   RegExpNode* body_node = body->ToNode(compiler, store_end);
1131 RegExpNode* RegExpAlternative::ToNode(RegExpCompiler* compiler,
1132                                       RegExpNode* on_success) {
1139   RegExpNode* current = on_success;
1588 RegExpNode* RegExpQuantifier::ToNode(int min, int max, bool is_greedy,
1590                                      RegExpNode* on_success,
1632         RegExpNode* answer =
1648         RegExpNode* answer = on_success;
1677   RegExpNode* loop_return =
1678       needs_counter ? static_cast<RegExpNode*>(
1680                     : static_cast<RegExpNode*>(center);
1687   RegExpNode* body_node = body->ToNode(compiler, loop_return);