Fix a few broken histograms.

net/disk_cache/backend_impl.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.
 
 #include "net/disk_cache/backend_impl.h"
 
 #include "base/file_path.h"
 #include "base/file_util.h"
 #include "base/histogram.h"
 #include "base/message_loop.h"
@@ skipping 762 matching lines @@
   int avg_size = data_->header.num_bytes / GetEntryCount();
   CACHE_UMA(COUNTS, "FirstEntrySize", 0, avg_size);
 
   int large_entries_bytes = stats_.GetLargeEntriesSize();
   int large_ratio = large_entries_bytes * 100 / data_->header.num_bytes;
   CACHE_UMA(PERCENTAGE, "FirstLargeEntriesRatio", 0, large_ratio);
 
   if (data_->header.experiment == 8) {
     CACHE_UMA(PERCENTAGE, "FirstResurrectRatio", 8, stats_.GetResurrectRatio());
     CACHE_UMA(PERCENTAGE, "FirstNoUseRatio", 8,
-              data_->header.lru.sizes[0] / data_->header.num_entries);
+              data_->header.lru.sizes[0] * 100 / data_->header.num_entries);
     CACHE_UMA(PERCENTAGE, "FirstLowUseRatio", 8,
-              data_->header.lru.sizes[1] / data_->header.num_entries);
+              data_->header.lru.sizes[1] * 100 / data_->header.num_entries);
     CACHE_UMA(PERCENTAGE, "FirstHighUseRatio", 8,
-              data_->header.lru.sizes[2] / data_->header.num_entries);
-    CACHE_UMA(PERCENTAGE, "FirstDeletedRatio", 8,
-              data_->header.lru.sizes[4] / data_->header.num_entries);
+              data_->header.lru.sizes[2] * 100 / data_->header.num_entries);
   }
 
   stats_.ResetRatios();
 }
 
 void BackendImpl::CriticalError(int error) {
   LOG(ERROR) << "Critical error found " << error;
   if (disabled_)
     return;
 
@@ skipping 575 matching lines @@
   CACHE_UMA(COUNTS, "EntrySize", data_->header.experiment, avg_size);
 
   int large_entries_bytes = stats_.GetLargeEntriesSize();
   int large_ratio = large_entries_bytes * 100 / data_->header.num_bytes;
   CACHE_UMA(PERCENTAGE, "LargeEntriesRatio", 0, large_ratio);
 
   if (new_eviction_) {
     CACHE_UMA(PERCENTAGE, "ResurrectRatio", data_->header.experiment,
               stats_.GetResurrectRatio());
     CACHE_UMA(PERCENTAGE, "NoUseRatio", data_->header.experiment,
-              data_->header.lru.sizes[0] / data_->header.num_entries);
+              data_->header.lru.sizes[0] * 100 / data_->header.num_entries);
     CACHE_UMA(PERCENTAGE, "LowUseRatio", data_->header.experiment,
-              data_->header.lru.sizes[1] / data_->header.num_entries);
+              data_->header.lru.sizes[1] * 100 / data_->header.num_entries);
     CACHE_UMA(PERCENTAGE, "HighUseRatio", data_->header.experiment,
-              data_->header.lru.sizes[2] / data_->header.num_entries);
+              data_->header.lru.sizes[2] * 100 / data_->header.num_entries);
     CACHE_UMA(PERCENTAGE, "DeletedRatio", data_->header.experiment,
-              data_->header.lru.sizes[4] / data_->header.num_entries);
+              data_->header.lru.sizes[4] * 100 / data_->header.num_entries);
   }
 
   stats_.ResetRatios();
   stats_.SetCounter(Stats::TRIM_ENTRY, 0);
 }
 
 void BackendImpl::UpgradeTo2_1() {
   // 2.1 is basically the same as 2.0, except that new fields are actually
   // updated by the new eviction algorithm.
   DCHECK(0x20000 == data_->header.version);
@@ skipping 101 matching lines @@
 
   return num_dirty;
 }
 
 bool BackendImpl::CheckEntry(EntryImpl* cache_entry) {
   RankingsNode* rankings = cache_entry->rankings()->Data();
   return !rankings->pointer;
 }
 
 }  // namespace disk_cache