Lines Matching defs:match
224 // Could delay this until the first match call that
356 if (!re.Match(*str, 0, str->size(), UNANCHORED, vec, nvec))
383 if (!re.Match(*str, p - str->data(), str->size(), UNANCHORED, vec, nvec))
388 // Disallow empty match at end of last match: skip ahead.
418 if (!re.Match(text, 0, text.size(), UNANCHORED, vec, nvec))
525 bool RE2::Match(const StringPiece& text,
547 // Use DFAs to find exact location of match, filter out non-matches.
551 StringPiece match;
552 StringPiece* matchp = &match;
620 LOG(INFO) << "Match " << trunc(pattern_)
626 LOG(INFO) << "Match " << trunc(pattern_)
628 << " used DFA - no match.";
632 LOG(INFO) << "Match " << trunc(pattern_)
634 << " used DFA - match";
637 // SearchDFA set match[0].end() but didn't know where the
638 // match started. Run the regexp backward from match[0].end()
639 // to find the longest possible match -- that's where it started.
643 if (!prog->SearchDFA(match, text, Prog::kAnchored,
644 Prog::kLongestMatch, &match, &dfa_failed, NULL)) {
649 LOG(INFO) << "Match " << trunc(pattern_)
655 LOG(INFO) << "Match " << trunc(pattern_)
663 LOG(INFO) << "Match " << trunc(pattern_)
685 LOG(INFO) << "Match " << trunc(pattern_)
693 LOG(INFO) << "Match " << trunc(pattern_)
700 &match, &dfa_failed, NULL)) {
703 LOG(INFO) << "Match " << trunc(pattern_)
710 LOG(INFO) << "Match " << trunc(pattern_)
712 << " used DFA - no match.";
721 submatch[0] = match;
729 // DFA found the exact match location:
730 // let NFA run an anchored, full match search
732 subtext1 = match;
739 LOG(INFO) << "Match " << trunc(pattern_)
749 LOG(INFO) << "Match " << trunc(pattern_)
760 LOG(INFO) << "Match " << trunc(pattern_)
771 // Adjust overall match for required prefix that we stripped off.
782 // Internal matcher - like Match() but takes Args not StringPieces.
812 if (!Match(text, 0, text.size(), anchor, vec, nvec)) {
