Searched refs:kRegexpEmptyMatch (Results 1 – 8 of 8) sorted by relevance
46 case kRegexpEmptyMatch: in ComputeSimple()85 case kRegexpEmptyMatch: in ComputeSimple()180 case kRegexpEmptyMatch: in PostVisit()248 if (newsub->op() == kRegexpEmptyMatch) in PostVisit()274 if (newsub->op() == kRegexpEmptyMatch) in PostVisit()338 return new Regexp(kRegexpEmptyMatch, f); in SimplifyRepeat()
82 case kRegexpEmptyMatch: in PostVisit()145 case kRegexpEmptyMatch: // always empty in PostVisit()
643 if (re->op() == kRegexpEmptyMatch) in LeadingRegexp()647 if (sub[0]->op() == kRegexpEmptyMatch) in LeadingRegexp()659 if (re->op() == kRegexpEmptyMatch) in RemoveLeadingRegexp()663 if (sub[0]->op() == kRegexpEmptyMatch) in RemoveLeadingRegexp()681 return new Regexp(kRegexpEmptyMatch, pf); in RemoveLeadingRegexp()727 re->op_ = kRegexpEmptyMatch; in RemoveLeadingString()733 re->op_ = kRegexpEmptyMatch; in RemoveLeadingString()751 if (sub[0]->op() == kRegexpEmptyMatch) { in RemoveLeadingString()761 re->op_ = kRegexpEmptyMatch; in RemoveLeadingString()982 sub[i]->op() == kRegexpEmptyMatch && in FactorAlternationRecursive()[all …]
67 case kRegexpEmptyMatch: in PreVisit()149 case kRegexpEmptyMatch: in PostVisit()
291 return new Regexp(kRegexpEmptyMatch, flags); in LiteralString()322 case kRegexpEmptyMatch: in TopEqual()681 re = new Regexp(kRegexpEmptyMatch, parse_flags()); in RequiredPrefix()
100 kRegexpEmptyMatch, enumerator
547 case kRegexpEmptyMatch: // anywhere in PostVisit()
729 case kRegexpEmptyMatch: in PostVisit()