Home
last modified time | relevance | path

Searched refs:nrunes (Results 1 – 7 of 7) sorted by relevance

/third_party/re2/re2/testing/
Ddump.cc79 for (int i = 0; i < re->nrunes(); i++) { in DumpRegexpAppending()
105 for (int i = 0; i < re->nrunes(); i++) { in DumpRegexpAppending()
/third_party/re2/re2/
Dregexp.cc321 Regexp* Regexp::LiteralString(Rune* runes, int nrunes, ParseFlags flags) { in LiteralString() argument
322 if (nrunes <= 0) in LiteralString()
324 if (nrunes == 1) in LiteralString()
327 for (int i = 0; i < nrunes; i++) in LiteralString()
376 return a->nrunes() == b->nrunes() && in TopEqual()
379 a->nrunes() * sizeof a->runes()[0]) == 0; in TopEqual()
Dsimplify.cc412 while (n < r2->nrunes() && r2->runes()[n] == r) in DoCoalesce()
417 if (n == r2->nrunes()) in DoCoalesce()
421 &r2->runes()[n], r2->nrunes() - n, r2->parse_flags()); in DoCoalesce()
Dregexp.h341 int nrunes() { DCHECK_EQ(op_, kRegexpLiteralString); return nrunes_; } in nrunes() function
403 static Regexp* LiteralString(Rune* runes, int nrunes, ParseFlags flags);
Dprefilter.cc564 if (re->nrunes() == 0) { in PostVisit()
570 for (int i = 1; i < re->nrunes(); i++) { in PostVisit()
575 for (int i = 1; i < re->nrunes(); i++) { in PostVisit()
Dtostring.cc170 for (int i = 0; i < re->nrunes(); i++) in PostVisit()
Dcompile.cc913 if (re->nrunes() == 0) in PostVisit()
916 for (int i = 0; i < re->nrunes(); i++) { in PostVisit()