Lines Matching defs:LRU

147 /// An LRU cache of idle ASTs.
162     if (It == LRU.end() || !It->second)
171     assert(findByKey(K) == LRU.end());
173     LRU.insert(LRU.begin(), {K, std::move(V)});
174     if (LRU.size() <= MaxRetainedASTs)
177     std::unique_ptr<ParsedAST> ForCleanup = std::move(LRU.back().second);
178     LRU.pop_back();
193     if (Existing == LRU.end()) {
201     LRU.erase(Existing);
212     return llvm::find_if(LRU, [K](const KVPair &P) { return P.first == K; });
217   /// Items sorted in LRU order, i.e. first item is the most recently accessed
219   std::vector<KVPair> LRU; /* GUARDED_BY(Mut) */
1005     // Make sure we put the AST back into the LRU cache.