Disk cache: Keep a map of all open entries....

net/disk_cache/eviction.cc

 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // The eviction policy is a very simple pure LRU, so the elements at the end of
 // the list are evicted until kCleanUpMargin free space is available. There is
 // only one list in use (Rankings::NO_USE), and elements are sent to the front
 // of the list whenever they are accessed.
 
 // The new (in-development) eviction policy ads re-use as a factor to evict
@@ skipping 164 matching lines @@
 
 bool Eviction::EvictEntry(CacheRankingsBlock* node, bool empty) {
   EntryImpl* entry;
   bool dirty;
   if (backend_->NewEntry(Addr(node->Data()->contents), &entry, &dirty)) {
     Trace("NewEntry failed on Trim 0x%x", node->address().value());
     return false;
   }
 
   if (node->Data()->pointer) {
-    entry = EntryImpl::Update(entry);
+    // We ignore the failure; we're removing the entry anyway.
+    entry->Update();
   }
   ReportTrimTimes(entry);
   if (empty || !new_eviction_) {
     entry->Doom();
   } else {
     entry->DeleteEntryData(false);
     EntryStore* info = entry->entry()->Data();
     DCHECK(ENTRY_NORMAL == info->state);
 
     rankings_->Remove(entry->rankings(), GetListForEntryV2(entry));
@@ skipping 197 matching lines @@
 
 bool Eviction::RemoveDeletedNode(CacheRankingsBlock* node) {
   EntryImpl* entry;
   bool dirty;
   if (backend_->NewEntry(Addr(node->Data()->contents), &entry, &dirty)) {
     Trace("NewEntry failed on Trim 0x%x", node->address().value());
     return false;
   }
 
   if (node->Data()->pointer) {
-    entry = EntryImpl::Update(entry);
+    // We ignore the failure; we're removing the entry anyway.
+    entry->Update();
   }
   entry->entry()->Data()->state = ENTRY_DOOMED;
   entry->Doom();
   entry->Release();
   return true;
 }
 
 bool Eviction::NodeIsOldEnough(CacheRankingsBlock* node, int list) {
   if (!node)
     return false;
@@ skipping 38 matching lines @@
               Time::FromInternalValue(last2.get()->Data()->last_used));
   if (last3.get())
     CACHE_UMA(AGE, "HighUseAge", header_->experiment,
               Time::FromInternalValue(last3.get()->Data()->last_used));
   if (last4.get())
     CACHE_UMA(AGE, "DeletedAge", header_->experiment,
               Time::FromInternalValue(last4.get()->Data()->last_used));
 }
 
 }  // namespace disk_cache