Lines Matching refs:Prog
57 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem);
60 Prog::MatchKind kind() { return kind_; } in kind()
232 Prog::MatchKind kind,
341 Prog* prog_; // The regular expression program to run.
342 Prog::MatchKind kind_; // The kind of DFA.
434 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) in DFA()
447 if (kind_ == Prog::kLongestMatch) { in DFA()
621 if (sawmatch && (kind_ == Prog::kFirstMatch || q->is_mark(id))) in WorkqToCachedState()
630 Prog::Inst* ip = prog_->inst(id); in WorkqToCachedState()
637 if (kind_ != Prog::kManyMatch && in WorkqToCachedState()
638 (kind_ != Prog::kFirstMatch || in WorkqToCachedState()
640 (kind_ != Prog::kLongestMatch || !sawmark) && in WorkqToCachedState()
712 if (kind_ == Prog::kLongestMatch) { in WorkqToCachedState()
842 Prog::Inst* ip = prog_->inst(id); in AddToQueue()
911 Prog::MatchKind kind, in RunWorkqOnByte()
925 Prog::Inst* ip = prog_->inst(id); in RunWorkqOnByte()
944 if (kind == Prog::kFirstMatch) { in RunWorkqOnByte()
1024 bool isword = (c != kByteEndText && Prog::IsWordChar(c)); in RunStateOnByte()
1047 if (c != kByteEndText || kind_ != Prog::kManyMatch) in RunStateOnByte()
1510 if (params->matches && kind_ == Prog::kManyMatch) { in InlinedSearchLoop()
1514 Prog::Inst* ip = prog_->inst(s->inst_[i]); in InlinedSearchLoop()
1632 } else if (Prog::IsWordChar(text.begin()[-1] & 0xFF)) { in AnalyzeSearch()
1646 } else if (Prog::IsWordChar(text.end()[0] & 0xFF)) { in AnalyzeSearch()
1813 DFA* Prog::GetDFA(MatchKind kind) { in GetDFA()
1869 bool Prog::SearchDFA(const StringPiece& text, const StringPiece& const_context, in SearchDFA()
1968 int Prog::BuildEntireDFA(MatchKind kind) { in BuildEntireDFA()
2117 bool Prog::PossibleMatchRange(string* min, string* max, int maxlen) { in PossibleMatchRange()
2124 dfa_longest_ = new DFA(this, Prog::kLongestMatch, dfa_mem_/2); in PossibleMatchRange()