Disk Cache: Add more corruption tracking histograms.

net/disk_cache/entry_impl.cc

 // Copyright (c) 2012 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/entry_impl.h"
 
 #include "base/message_loop.h"
 #include "base/metrics/histogram.h"
 #include "base/string_util.h"
 #include "net/base/io_buffer.h"
@@ skipping 559 matching lines @@
     return false;
 
   EntryStore* stored = entry_.Data();
   if (!stored->rankings_node || stored->key_len <= 0)
     return false;
 
   if (stored->reuse_count < 0 || stored->refetch_count < 0)
     return false;
 
   Addr rankings_addr(stored->rankings_node);
-  if (!rankings_addr.is_initialized() || rankings_addr.is_separate_file() ||
-      rankings_addr.file_type() != RANKINGS || rankings_addr.num_blocks() != 1)
+  if (!rankings_addr.SanityCheckForRankings())

[gavinp, 2012/04/26 15:46:54]

This is really good: the new function call makes what's happening a lot clearer
to a reader at the same time that it adds functionality.

     return false;
 
   Addr next_addr(stored->next);
-  if (next_addr.is_initialized() &&
-      (next_addr.is_separate_file() || next_addr.file_type() != BLOCK_256)) {
+  if (next_addr.is_initialized() && !next_addr.SanityCheckForEntry()) {
     STRESS_NOTREACHED();
     return false;
   }
   STRESS_DCHECK(next_addr.value() != entry_.address().value());
 
-  if (!rankings_addr.SanityCheck() || !next_addr.SanityCheck())
-    return false;
-
   if (stored->state > ENTRY_DOOMED || stored->state < ENTRY_NORMAL)
     return false;
 
   Addr key_addr(stored->long_key);
   if ((stored->key_len <= kMaxInternalKeyLength && key_addr.is_initialized()) ||
       (stored->key_len > kMaxInternalKeyLength && !key_addr.is_initialized()))
     return false;
 
   if (!key_addr.SanityCheck())
     return false;
@@ skipping 940 matching lines @@
   Trace("%s 0x%p 0x%x 0x%x", msg, reinterpret_cast<void*>(this),
         entry_.address().value(), node_.address().value());
 
   Trace("  data: 0x%x 0x%x 0x%x", entry_.Data()->data_addr[0],
         entry_.Data()->data_addr[1], entry_.Data()->long_key);
 
   Trace("  doomed: %d 0x%x", doomed_, dirty);
 }
 
 }  // namespace disk_cache