DFA 59 third_party/re2/re2/dfa.cc DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem); DFA 60 third_party/re2/re2/dfa.cc ~DFA(); DFA 436 third_party/re2/re2/dfa.cc DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) DFA 456 third_party/re2/re2/dfa.cc mem_budget_ -= sizeof(DFA); DFA 487 third_party/re2/re2/dfa.cc DFA::~DFA() { DFA 509 third_party/re2/re2/dfa.cc string DFA::DumpWorkq(Workq* q) { DFA 512 third_party/re2/re2/dfa.cc for (DFA::Workq::iterator it = q->begin(); it != q->end(); ++it) { DFA 525 third_party/re2/re2/dfa.cc string DFA::DumpState(State* state) { DFA 606 third_party/re2/re2/dfa.cc DFA::State* DFA::WorkqToCachedState(Workq* q, uint flag) { DFA 739 third_party/re2/re2/dfa.cc DFA::State* DFA::CachedState(int* inst, int ninst, uint flag) { DFA 783 third_party/re2/re2/dfa.cc void DFA::ClearCache() { DFA 797 third_party/re2/re2/dfa.cc void DFA::StateToWorkq(State* s, Workq* q) { DFA 809 third_party/re2/re2/dfa.cc void DFA::AddToQueue(Workq* q, int id, uint flag) { DFA 897 third_party/re2/re2/dfa.cc void DFA::RunWorkqOnEmptyString(Workq* oldq, Workq* newq, uint flag) { DFA 911 third_party/re2/re2/dfa.cc void DFA::RunWorkqOnByte(Workq* oldq, Workq* newq, DFA 961 third_party/re2/re2/dfa.cc DFA::State* DFA::RunStateOnByteUnlocked(State* state, int c) { DFA 969 third_party/re2/re2/dfa.cc DFA::State* DFA::RunStateOnByte(State* state, int c) { DFA 1118 third_party/re2/re2/dfa.cc DFA::RWLocker::RWLocker(Mutex* mu) DFA 1126 third_party/re2/re2/dfa.cc void DFA::RWLocker::LockForWriting() NO_THREAD_SAFETY_ANALYSIS { DFA 1134 third_party/re2/re2/dfa.cc DFA::RWLocker::~RWLocker() { DFA 1153 third_party/re2/re2/dfa.cc void DFA::ResetCache(RWLocker* cache_lock) { DFA 1196 third_party/re2/re2/dfa.cc explicit StateSaver(DFA* dfa, State* state); DFA 1208 third_party/re2/re2/dfa.cc DFA* dfa_; // the DFA to use DFA 1218 third_party/re2/re2/dfa.cc DFA::StateSaver::StateSaver(DFA* dfa, State* state) { DFA 1236 third_party/re2/re2/dfa.cc DFA::StateSaver::~StateSaver() { DFA 1241 third_party/re2/re2/dfa.cc DFA::State* DFA::StateSaver::Restore() { DFA 1320 third_party/re2/re2/dfa.cc inline bool DFA::InlinedSearchLoop(SearchParams* params, DFA 1530 third_party/re2/re2/dfa.cc bool DFA::SearchFFF(SearchParams* params) { DFA 1533 third_party/re2/re2/dfa.cc bool DFA::SearchFFT(SearchParams* params) { DFA 1536 third_party/re2/re2/dfa.cc bool DFA::SearchFTF(SearchParams* params) { DFA 1539 third_party/re2/re2/dfa.cc bool DFA::SearchFTT(SearchParams* params) { DFA 1542 third_party/re2/re2/dfa.cc bool DFA::SearchTFF(SearchParams* params) { DFA 1545 third_party/re2/re2/dfa.cc bool DFA::SearchTFT(SearchParams* params) { DFA 1548 third_party/re2/re2/dfa.cc bool DFA::SearchTTF(SearchParams* params) { DFA 1551 third_party/re2/re2/dfa.cc bool DFA::SearchTTT(SearchParams* params) { DFA 1556 third_party/re2/re2/dfa.cc bool DFA::SlowSearchLoop(SearchParams* params) { DFA 1565 third_party/re2/re2/dfa.cc bool DFA::FastSearchLoop(SearchParams* params) { DFA 1568 third_party/re2/re2/dfa.cc static bool (DFA::*Searches[])(SearchParams*) = { DFA 1569 third_party/re2/re2/dfa.cc &DFA::SearchFFF, DFA 1570 third_party/re2/re2/dfa.cc &DFA::SearchFFT, DFA 1571 third_party/re2/re2/dfa.cc &DFA::SearchFTF, DFA 1572 third_party/re2/re2/dfa.cc &DFA::SearchFTT, DFA 1573 third_party/re2/re2/dfa.cc &DFA::SearchTFF, DFA 1574 third_party/re2/re2/dfa.cc &DFA::SearchTFT, DFA 1575 third_party/re2/re2/dfa.cc &DFA::SearchTTF, DFA 1576 third_party/re2/re2/dfa.cc &DFA::SearchTTT, DFA 1613 third_party/re2/re2/dfa.cc bool DFA::AnalyzeSearch(SearchParams* params) { DFA 1684 third_party/re2/re2/dfa.cc bool DFA::AnalyzeSearchHelper(SearchParams* params, StartInfo* info, DFA 1749 third_party/re2/re2/dfa.cc bool DFA::Search(const StringPiece& text, DFA 1811 third_party/re2/re2/dfa.cc static void DeleteDFA(DFA* dfa) { DFA 1815 third_party/re2/re2/dfa.cc DFA* Prog::GetDFA(MatchKind kind) { DFA 1816 third_party/re2/re2/dfa.cc DFA*volatile* pdfa; DFA 1825 third_party/re2/re2/dfa.cc DFA *dfa = ANNOTATE_UNPROTECTED_READ(*pdfa); DFA 1849 third_party/re2/re2/dfa.cc dfa = new DFA(this, kind, m); DFA 1911 third_party/re2/re2/dfa.cc DFA* dfa = GetDFA(kind); DFA 1936 third_party/re2/re2/dfa.cc int DFA::BuildAllStates() { DFA 1977 third_party/re2/re2/dfa.cc bool DFA::PossibleMatchRange(string* min, string* max, int maxlen) { DFA 2120 third_party/re2/re2/dfa.cc DFA* dfa = NULL; DFA 2126 third_party/re2/re2/dfa.cc dfa_longest_ = new DFA(this, Prog::kLongestMatch, dfa_mem_/2); DFA 74 third_party/re2/re2/prog.h class DFA; DFA 340 third_party/re2/re2/prog.h DFA* GetDFA(MatchKind kind); DFA 358 third_party/re2/re2/prog.h DFA* volatile dfa_first_; // DFA cached for kFirstMatch DFA 359 third_party/re2/re2/prog.h DFA* volatile dfa_longest_; // DFA cached for kLongestMatch and kFullMatch DFA 361 third_party/re2/re2/prog.h void (*delete_dfa_)(DFA* dfa); DFA 324 third_party/re2/re2/testing/dfa_test.cc TEST(DFA, ReverseMatch) {