Add stats-table counters to the disk cache so we can expose stats through...

net/disk_cache/backend_impl.cc

 // Copyright (c) 2010 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/message_loop.h"
 #include "base/metrics/field_trial.h"
 #include "base/metrics/histogram.h"
+#include "base/metrics/stats_counters.h"
 #include "base/rand_util.h"
 #include "base/string_util.h"
 #include "base/stringprintf.h"
 #include "base/sys_info.h"
 #include "base/threading/worker_pool.h"
 #include "base/threading/thread_restrictions.h"
 #include "base/time.h"
 #include "base/timer.h"
 #include "net/base/net_errors.h"
 #include "net/disk_cache/cache_util.h"
@@ skipping 669 matching lines @@
     cache_entry->Release();
     stats_.OnEvent(Stats::OPEN_MISS);
     return NULL;
   }
 
   eviction_.OnOpenEntry(cache_entry);
   entry_count_++;
 
   CACHE_UMA(AGE_MS, "OpenTime", GetSizeGroup(), start);
   stats_.OnEvent(Stats::OPEN_HIT);
+  SIMPLE_STATS_COUNTER("disk_cache.hit");
   return cache_entry;
 }
 
 EntryImpl* BackendImpl::CreateEntryImpl(const std::string& key) {
   if (disabled_ || key.empty())
     return NULL;
 
   TimeTicks start = TimeTicks::Now();
   uint32 hash = Hash(key);
   Trace("Create hash 0x%x", hash);
@@ skipping 65 matching lines @@
   block_files_.GetFile(node_address)->Store(cache_entry->rankings());
 
   IncreaseNumEntries();
   eviction_.OnCreateEntry(cache_entry);
   entry_count_++;
   if (!parent.get())
     data_->table[hash & mask_] = entry_address.value();
 
   CACHE_UMA(AGE_MS, "CreateTime", GetSizeGroup(), start);
   stats_.OnEvent(Stats::CREATE_HIT);
+  SIMPLE_STATS_COUNTER("disk_cache.miss");
   Trace("create entry hit ");
   return cache_entry.release();
 }
 
 EntryImpl* BackendImpl::OpenNextEntryImpl(void** iter) {
   return OpenFollowingEntry(true, iter);
 }
 
 EntryImpl* BackendImpl::OpenPrevEntryImpl(void** iter) {
   return OpenFollowingEntry(false, iter);
@@ skipping 1344 matching lines @@
     if (total_memory > kMaxBuffersSize || total_memory <= 0)
       total_memory = kMaxBuffersSize;
 
     done = true;
   }
 
   return static_cast<int>(total_memory);
 }
 
 }  // namespace disk_cache