Searched refs:kRegexpEmptyMatch (Results 1 – 16 of 16) sorted by relevance
| /external/chromium_org/third_party/re2/re2/ |
| D | simplify.cc | 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()
|
| D | mimics_pcre.cc | 82 case kRegexpEmptyMatch: in PostVisit()
145 case kRegexpEmptyMatch: // always empty in PostVisit()
|
| D | parse.cc | 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 …]
|
| D | tostring.cc | 67 case kRegexpEmptyMatch: in PreVisit()
149 case kRegexpEmptyMatch: in PostVisit()
|
| D | regexp.cc | 291 return new Regexp(kRegexpEmptyMatch, flags); in LiteralString()
322 case kRegexpEmptyMatch: in TopEqual()
681 re = new Regexp(kRegexpEmptyMatch, parse_flags()); in RequiredPrefix()
|
| D | regexp.h | 100 kRegexpEmptyMatch, enumerator
|
| D | prefilter.cc | 539 case kRegexpEmptyMatch: // anywhere in PostVisit()
|
| D | compile.cc | 730 case kRegexpEmptyMatch: in PostVisit()
|
| /external/regex-re2/re2/ |
| D | simplify.cc | 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()
|
| D | mimics_pcre.cc | 82 case kRegexpEmptyMatch: in PostVisit()
145 case kRegexpEmptyMatch: // always empty in PostVisit()
|
| D | parse.cc | 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 …]
|
| D | tostring.cc | 67 case kRegexpEmptyMatch: in PreVisit()
149 case kRegexpEmptyMatch: in PostVisit()
|
| D | regexp.cc | 291 return new Regexp(kRegexpEmptyMatch, flags); in LiteralString()
322 case kRegexpEmptyMatch: in TopEqual()
681 re = new Regexp(kRegexpEmptyMatch, parse_flags()); in RequiredPrefix()
|
| D | regexp.h | 100 kRegexpEmptyMatch, enumerator
|
| D | prefilter.cc | 547 case kRegexpEmptyMatch: // anywhere in PostVisit()
|
| D | compile.cc | 729 case kRegexpEmptyMatch: in PostVisit()
|