Disk Cache: Split some time histograms in groups based...

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 86 matching lines @@
       if (++deleted == 4 && !empty) {
 #if defined(OS_WIN)
         MessageLoop::current()->PostTask(FROM_HERE,
             factory_.NewRunnableMethod(&Eviction::TrimCache, false));
         break;
 #endif
       }
     }
   }
 
-  CACHE_UMA(AGE_MS, "TotalTrimTime", 0, start);
+  CACHE_UMA(AGE_MS, "TotalTrimTime", backend_->GetSizeGroup(), start);
   trimming_ = false;
   Trace("*** Trim Cache end ***");
   return;
 }
 
 void Eviction::UpdateRank(EntryImpl* entry, bool modified) {
   if (new_eviction_)
     return UpdateRankV2(entry, modified);
 
   rankings_->UpdateRank(entry->rankings(), modified, GetListForEntry(entry));
@@ skipping 151 matching lines @@
       list = kListsToSearch;
   }
 
   if (empty) {
     TrimDeleted(true);
   } else if (header_->lru.sizes[Rankings::DELETED] > header_->num_entries / 4) {
     MessageLoop::current()->PostTask(FROM_HERE,
         factory_.NewRunnableMethod(&Eviction::TrimDeleted, empty));
   }
 
-  CACHE_UMA(AGE_MS, "TotalTrimTime", 0, start);
+  CACHE_UMA(AGE_MS, "TotalTrimTime", backend_->GetSizeGroup(), start);
   Trace("*** Trim Cache end ***");
   trimming_ = false;
   return;
 }
 
 void Eviction::UpdateRankV2(EntryImpl* entry, bool modified) {
   rankings_->UpdateRank(entry->rankings(), modified, GetListForEntryV2(entry));
 }
 
 void Eviction::OnOpenEntryV2(EntryImpl* entry) {
@@ skipping 162 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