Inform disk cache of WebKit memory cache hits.

net/disk_cache/entry_impl.cc

 // Copyright (c) 2011 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 378 matching lines @@
     return;
 
   sparse_->CancelIO();
 }
 
 int EntryImpl::ReadyForSparseIOImpl(CompletionCallback* callback) {
   DCHECK(sparse_.get());
   return sparse_->ReadyToUse(callback);
 }
 
+void EntryImpl::UpdateRankForExternalCacheHitImpl() {
+  UpdateRank(false);
+}
+
 uint32 EntryImpl::GetHash() {
   return entry_.Data()->hash;
 }
 
 bool EntryImpl::CreateEntry(Addr node_address, const std::string& key,
                             uint32 hash) {
   Trace("Create entry In");
   EntryStore* entry_store = entry_.Data();
   RankingsNode* node = node_.Data();
   memset(entry_store, 0, sizeof(EntryStore) * entry_.address().num_blocks());
@@ skipping 417 matching lines @@
 }
 
 int EntryImpl::ReadyForSparseIO(net::CompletionCallback* callback) {
   if (!sparse_.get())
     return net::OK;
 
   backend_->background_queue()->ReadyForSparseIO(this, callback);
   return net::ERR_IO_PENDING;
 }
 
+void EntryImpl::UpdateRankForExternalCacheHit() {
+  backend_->background_queue()->UpdateRankForExternalCacheHit(this);
+}
+
 // When an entry is deleted from the cache, we clean up all the data associated
 // with it for two reasons: to simplify the reuse of the block (we know that any
 // unused block is filled with zeros), and to simplify the handling of write /
 // read partial information from an entry (don't have to worry about returning
 // data related to a previous cache entry because the range was not fully
 // written before).
 EntryImpl::~EntryImpl() {
   Log("~EntryImpl in");
 
   // Save the sparse info to disk. This will generate IO for this entry and
@@ skipping 580 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