Lines Matching refs:kind
57 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem);
60 Prog::MatchKind kind() { return kind_; }
232 Prog::MatchKind kind,
342 Prog::MatchKind kind_; // The kind of DFA.
434 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem)
436 kind_(kind),
911 Prog::MatchKind kind,
944 if (kind == Prog::kFirstMatch) {
1764 fprintf(stderr, "text %s anchored=%d earliest=%d fwd=%d kind %d\n",
1813 DFA* Prog::GetDFA(MatchKind kind) {
1815 if (kind == kFirstMatch || kind == kManyMatch) {
1818 kind = kLongestMatch;
1842 if (kind == kLongestMatch || kind == kManyMatch)
1847 dfa = new DFA(this, kind, m);
1870 Anchor anchor, MatchKind kind,
1891 bool anchored = anchor == kAnchored || anchor_start() || kind == kFullMatch;
1893 if (kind == kManyMatch) {
1895 } else if (kind == kFullMatch || anchor_end()) {
1897 kind = kLongestMatch;
1906 kind = kLongestMatch;
1909 DFA* dfa = GetDFA(kind);
1967 // Build out all states in DFA for kind. Returns number of states.
1968 int Prog::BuildEntireDFA(MatchKind kind) {
1970 return GetDFA(kind)->BuildAllStates();
