Lines Matching refs:match
58 // Explores from instruction ip at string position p looking for a match.
67 bool longest_; // whether search wants leftmost-longest match
140 if (Visit(prog_->start(), p)) // Match must be leftmost; done.
146 // Explores from instruction ip at string position p looking for a match.
150 // either it didn't match or it did but we're hoping for a better match.
160 // have to explore in hope of finishing a match. Use impossible byte -1.
207 // We found a match. If it's the best so far, record the
212 if (submatch_[0].data() == NULL || // First match so far ...
213 (longest_ && p > submatch_[0].end())) { // ... or better match
229 StringPiece* match,
231 // If full match, we ask for an anchored longest match
232 // and then check that match[0] == text.
233 // So make sure match[0] exists.
238 match = &sp0;
247 if (!b.Search(text, context, anchored, longest, match, nmatch))
249 if (kind == kFullMatch && match[0].end() != text.end())
