Lines Matching refs:entry
93 void MemBackendImpl::InternalDoomEntry(MemEntryImpl* entry) {
95 DCHECK(entry->type() == MemEntryImpl::kParentEntry);
97 rankings_.Remove(entry);
98 EntryMap::iterator it = entries_.find(entry->GetKey());
104 entry->InternalDoom();
122 void MemBackendImpl::InsertIntoRankingList(MemEntryImpl* entry) {
123 rankings_.Insert(entry);
126 void MemBackendImpl::RemoveFromRankingList(MemEntryImpl* entry) {
127 rankings_.Remove(entry);
134 int MemBackendImpl::OpenEntry(const std::string& key, Entry** entry,
136 if (OpenEntry(key, entry))
142 int MemBackendImpl::CreateEntry(const std::string& key, Entry** entry,
144 if (CreateEntry(key, entry))
182 int MemBackendImpl::OpenNextEntry(void** iter, Entry** next_entry,
194 bool MemBackendImpl::OpenEntry(const std::string& key, Entry** entry) {
201 *entry = it->second;
205 bool MemBackendImpl::CreateEntry(const std::string& key, Entry** entry) {
212 delete entry;
219 *entry = cache_entry;
224 Entry* entry;
225 if (!OpenEntry(key, &entry))
228 entry->Doom();
229 entry->Close();
266 // Get the entry in the front.
267 Entry* entry = rankings_.GetNext(NULL);
269 // Break the loop when there are no more entries or the entry is too old.
270 if (!entry || entry->GetLastUsed() < initial_time)
272 entry->Doom();
276 bool MemBackendImpl::OpenNextEntry(void** iter, Entry** next_entry) {
279 // We should never return a child entry so iterate until we hit a parent
280 // entry.
