Add a size estimation mechanism to StoragePartitionHttpCacheDataRemover.

net/disk_cache/blockfile/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/blockfile/entry_impl.h"
 
 #include "base/hash.h"
 #include "base/message_loop/message_loop.h"
 #include "base/strings/string_util.h"
 #include "net/base/io_buffer.h"
@@ skipping 728 matching lines @@
   // The longest key that can be stored using one block.
   int key1_len =
       static_cast<int>(sizeof(EntryStore) - offsetof(EntryStore, key));
 
   if (key_size < key1_len || key_size > kMaxInternalKeyLength)
     return 1;
 
   return ((key_size - key1_len) / 256 + 2);
 }
 
+int EntryImpl::GetEntrySize() const {
+  int result = 0;
+  for (int i = 0; i < kNumStreams; ++i) {
+    result += GetDataSize(i);
+  }
+  return result;
+}
+
 // ------------------------------------------------------------------------
 
 void EntryImpl::Doom() {
   if (background_queue_.get())
     background_queue_->DoomEntryImpl(this);
 }
 
 void EntryImpl::Close() {
   if (background_queue_.get())
     background_queue_->CloseEntryImpl(this);
@@ skipping 785 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