Disk cache: First pass to make it possible to have...

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 49 matching lines @@
 namespace disk_cache {
 
 void Eviction::Init(BackendImpl* backend) {
   // We grab a bunch of info from the backend to make the code a little cleaner
   // when we're actually doing work.
   backend_ = backend;
   rankings_ = &backend->rankings_;
   header_ = &backend_->data_->header;
   max_size_ = LowWaterAdjust(backend_->max_size_);
   new_eviction_ = backend->new_eviction_;
+  first_trim_ = true;
 }
 
 void Eviction::TrimCache(bool empty) {
   if (new_eviction_)
     return TrimCacheV2(empty);
 
   Trace("*** Trim Cache ***");
   if (backend_->disabled_)
     return;
 
@@ skipping 54 matching lines @@
 
   rankings_->Remove(entry->rankings(), GetListForEntry(entry));
 }
 
 void Eviction::OnDestroyEntry(EntryImpl* entry) {
   if (new_eviction_)
     return OnDestroyEntryV2(entry);
 }
 
 void Eviction::ReportTrimTimes(EntryImpl* entry) {
-  static bool first_time = true;
-  if (first_time) {
-    first_time = false;
+  if (first_trim_) {
+    first_trim_ = false;
     if (backend_->ShouldReportAgain()) {
       std::string name(StringPrintf("DiskCache.TrimAge_%d",
                                     header_->experiment));
       UMA_HISTOGRAM_HOURS(name.c_str(),
                           (Time::Now() - entry->GetLastUsed()).InHours());
     }
 
     if (header_->create_time && !header_->lru.filled) {
       // This is the first entry that we have to evict, generate some noise.
       header_->lru.filled = 1;
@@ skipping 257 matching lines @@
                      header_->lru.sizes[Rankings::DELETED];
   // Start by having each list to be roughly the same size.
   if (header_->lru.sizes[0] > data_entries / 3)
     return 0;
   if (header_->lru.sizes[1] > data_entries / 3)
     return 1;
   return 2;
 }
 
 }  // namespace disk_cache