Home
last modified time | relevance | path

Searched refs:dfa_mem_ (Results 1 – 8 of 8) sorted by relevance

/external/chromium_org/third_party/re2/re2/
Dprog.h208 void set_dfa_mem(int64 dfa_mem) { dfa_mem_ = dfa_mem; } in set_dfa_mem()
209 int64 dfa_mem() { return dfa_mem_; } in dfa_mem()
360 int64 dfa_mem_; // Maximum memory for DFAs. variable
Donepass.cc392 if (maxnodes >= 65000 || dfa_mem_ / 4 / statesize < maxnodes) in IsOnePass()
601 dfa_mem_ -= nalloc*statesize; in IsOnePass()
Dprog.cc108 dfa_mem_(0), in Prog()
Ddfa.cc1842 int64 m = dfa_mem_/2; in GetDFA()
1845 m = dfa_mem_; in GetDFA()
2126 dfa_longest_ = new DFA(this, Prog::kLongestMatch, dfa_mem_/2); in PossibleMatchRange()
/external/regex-re2/re2/
Dprog.h208 void set_dfa_mem(int64 dfa_mem) { dfa_mem_ = dfa_mem; } in set_dfa_mem()
209 int64 dfa_mem() { return dfa_mem_; } in dfa_mem()
360 int64 dfa_mem_; // Maximum memory for DFAs. variable
Donepass.cc392 if (maxnodes >= 65000 || dfa_mem_ / 4 / statesize < maxnodes) in IsOnePass()
601 dfa_mem_ -= nalloc*statesize; in IsOnePass()
Dprog.cc108 dfa_mem_(0), in Prog()
Ddfa.cc1840 int64 m = dfa_mem_/2; in GetDFA()
1843 m = dfa_mem_; in GetDFA()
2124 dfa_longest_ = new DFA(this, Prog::kLongestMatch, dfa_mem_/2); in PossibleMatchRange()