Disk cache: Remove remaining uses of RankingsNode.pointer....

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/field_trial.h"
 #include "base/file_path.h"
 #include "base/file_util.h"
 #include "base/histogram.h"
@@ skipping 744 matching lines @@
   DecreaseNumEntries();
 }
 
 void BackendImpl::CacheEntryDestroyed(Addr address) {
   EntriesMap::iterator it = open_entries_.find(address.value());
   if (it != open_entries_.end())
     open_entries_.erase(it);
   DecreaseNumRefs();
 }
 
-bool BackendImpl::IsOpen(CacheRankingsBlock* rankings) const {
+EntryImpl* BackendImpl::GetOpenEntry(CacheRankingsBlock* rankings) const {
   DCHECK(rankings->HasData());
   EntriesMap::const_iterator it =
       open_entries_.find(rankings->Data()->contents);
   if (it != open_entries_.end()) {
     // We have this entry in memory.
-    return rankings->Data()->pointer == it->second;
+    return it->second;
   }
 
-  return false;
+  return NULL;
 }
 
 int32 BackendImpl::GetCurrentEntryId() const {
   return data_->header.this_id;
 }
 
 int BackendImpl::MaxFileSize() const {
   return max_size_ / 8;
 }
 
@@ skipping 849 matching lines @@
   if (num_entries + num_dirty != data_->header.num_entries) {
     LOG(ERROR) << "Number of entries mismatch";
     return ERR_NUM_ENTRIES_MISMATCH;
   }
 
   return num_dirty;
 }
 
 bool BackendImpl::CheckEntry(EntryImpl* cache_entry) {
   RankingsNode* rankings = cache_entry->rankings()->Data();
-  return !rankings->pointer;
+  return !rankings->dummy;
 }
 
 }  // namespace disk_cache