Disk cache v3 ref2

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/hash.h"
 #include "base/message_loop/message_loop.h"
 #include "base/metrics/histogram.h"
 #include "base/strings/string_util.h"
@@ skipping 78 matching lines @@
 // anywhere in the first 16KB of the file (kMaxBlockSize), we set the offset to
 // zero. The buffer grows up to a size determined by the backend, to keep the
 // total memory used under control.
 class EntryImpl::UserBuffer {
  public:
   explicit UserBuffer(BackendImpl* backend)
       : backend_(backend->GetWeakPtr()), offset_(0), grow_allowed_(true) {
     buffer_.reserve(kMaxBlockSize);
   }
   ~UserBuffer() {
-    if (backend_.get())
+    if (backend_)
       backend_->BufferDeleted(capacity() - kMaxBlockSize);
   }
 
   // Returns true if we can handle writing |len| bytes to |offset|.
   bool PreWrite(int offset, int len);
 
   // Truncates the buffer to |offset| bytes.
   void Truncate(int offset);
 
   // Writes |len| bytes from |buf| at the given |offset|.
@@ skipping 136 matching lines @@
   int available = Size() - start;
   DCHECK_GE(start, 0);
   DCHECK_GE(available, 0);
   len = std::min(len, available);
   memcpy(buf->data() + clean_bytes, &buffer_[start], len);
   return len + clean_bytes;
 }
 
 void EntryImpl::UserBuffer::Reset() {
   if (!grow_allowed_) {
-    if (backend_.get())
+    if (backend_)
       backend_->BufferDeleted(capacity() - kMaxBlockSize);
     grow_allowed_ = true;
     std::vector<char> tmp;
     buffer_.swap(tmp);
     buffer_.reserve(kMaxBlockSize);
   }
   offset_ = 0;
   buffer_.clear();
 }
 
 bool EntryImpl::UserBuffer::GrowBuffer(int required, int limit) {
   DCHECK_GE(required, 0);
   int current_size = capacity();
   if (required <= current_size)
     return true;
 
   if (required > limit)
     return false;
 
-  if (!backend_.get())
+  if (!backend_)
     return false;
 
   int to_add = std::max(required - current_size, kMaxBlockSize * 4);
   to_add = std::max(current_size, to_add);
   required = std::min(current_size + to_add, limit);
 
   grow_allowed_ = backend_->IsAllocAllowed(current_size, required);
   if (!grow_allowed_)
     return false;
 
   DVLOG(3) << "Buffer grow to " << required;
 
   buffer_.reserve(required);
   return true;
 }
 
 // ------------------------------------------------------------------------
 
 EntryImpl::EntryImpl(BackendImpl* backend, Addr address, bool read_only)
     : entry_(NULL, Addr(0)), node_(NULL, Addr(0)),
       backend_(backend->GetWeakPtr()), doomed_(false), read_only_(read_only),
       dirty_(false) {
   entry_.LazyInit(backend->File(address), address);
   for (int i = 0; i < kNumStreams; i++) {
     unreported_size_[i] = 0;
   }
 }
 
 void EntryImpl::DoomImpl() {
-  if (doomed_ || !backend_.get())
+  if (doomed_ || !backend_)
     return;
 
   SetPointerForInvalidEntry(backend_->GetCurrentEntryId());
   backend_->InternalDoomEntry(this);
 }
 
 int EntryImpl::ReadDataImpl(int index, int offset, IOBuffer* buf, int buf_len,
                             const CompletionCallback& callback) {
   if (net_log_.IsLoggingAllEvents()) {
     net_log_.BeginEvent(
@@ skipping 349 matching lines @@
       stored->data_size[i] = 0;
   }
   entry_.Store();
 }
 
 void EntryImpl::IncrementIoCount() {
   backend_->IncrementIoCount();
 }
 
 void EntryImpl::DecrementIoCount() {
-  if (backend_.get())
+  if (backend_)
     backend_->DecrementIoCount();
 }
 
 void EntryImpl::OnEntryCreated(BackendImpl* backend) {
   // Just grab a reference to the backround queue.
   background_queue_ = backend->GetBackgroundQueue();
 }
 
 void EntryImpl::SetTimes(base::Time last_used, base::Time last_modified) {
   node_.Data()->last_used = last_used.ToInternalValue();
   node_.Data()->last_modified = last_modified.ToInternalValue();
   node_.set_modified();
 }
 
 void EntryImpl::ReportIOTime(Operation op, const base::TimeTicks& start) {
-  if (!backend_.get())
+  if (!backend_)
     return;
 
   switch (op) {
     case kRead:
       CACHE_UMA(AGE_MS, "ReadTime", 0, start);
       break;
     case kWrite:
       CACHE_UMA(AGE_MS, "WriteTime", 0, start);
       break;
     case kSparseRead:
@@ skipping 37 matching lines @@
 
   if (key_size < key1_len || key_size > kMaxInternalKeyLength)
     return 1;
 
   return ((key_size - key1_len) / 256 + 2);
 }
 
 // ------------------------------------------------------------------------
 
 void EntryImpl::Doom() {
-  if (background_queue_.get())
+  if (background_queue_)
     background_queue_->DoomEntryImpl(this);
 }
 
 void EntryImpl::Close() {
-  if (background_queue_.get())
+  if (background_queue_)
     background_queue_->CloseEntryImpl(this);
 }
 
 std::string EntryImpl::GetKey() const {
   CacheEntryBlock* entry = const_cast<CacheEntryBlock*>(&entry_);
   int key_len = entry->Data()->key_len;
   if (key_len <= kMaxInternalKeyLength)
     return std::string(entry->Data()->key);
 
   // We keep a copy of the key so that we can always return it, even if the
@@ skipping 49 matching lines @@
   if (index < 0 || index >= kNumStreams)
     return net::ERR_INVALID_ARGUMENT;
 
   int entry_size = entry_.Data()->data_size[index];
   if (offset >= entry_size || offset < 0 || !buf_len)
     return 0;
 
   if (buf_len < 0)
     return net::ERR_INVALID_ARGUMENT;
 
-  if (!background_queue_.get())
+  if (!background_queue_)
     return net::ERR_UNEXPECTED;
 
   background_queue_->ReadData(this, index, offset, buf, buf_len, callback);
   return net::ERR_IO_PENDING;
 }
 
 int EntryImpl::WriteData(int index, int offset, IOBuffer* buf, int buf_len,
                          const CompletionCallback& callback, bool truncate) {
   if (callback.is_null())
     return WriteDataImpl(index, offset, buf, buf_len, callback, truncate);
 
   DCHECK(node_.Data()->dirty || read_only_);
   if (index < 0 || index >= kNumStreams)
     return net::ERR_INVALID_ARGUMENT;
 
   if (offset < 0 || buf_len < 0)
     return net::ERR_INVALID_ARGUMENT;
 
-  if (!background_queue_.get())
+  if (!background_queue_)
     return net::ERR_UNEXPECTED;
 
   background_queue_->WriteData(this, index, offset, buf, buf_len, truncate,
                                callback);
   return net::ERR_IO_PENDING;
 }
 
 int EntryImpl::ReadSparseData(int64 offset, IOBuffer* buf, int buf_len,
                               const CompletionCallback& callback) {
   if (callback.is_null())
     return ReadSparseDataImpl(offset, buf, buf_len, callback);
 
-  if (!background_queue_.get())
+  if (!background_queue_)
     return net::ERR_UNEXPECTED;
 
   background_queue_->ReadSparseData(this, offset, buf, buf_len, callback);
   return net::ERR_IO_PENDING;
 }
 
 int EntryImpl::WriteSparseData(int64 offset, IOBuffer* buf, int buf_len,
                                const CompletionCallback& callback) {
   if (callback.is_null())
     return WriteSparseDataImpl(offset, buf, buf_len, callback);
 
-  if (!background_queue_.get())
+  if (!background_queue_)
     return net::ERR_UNEXPECTED;
 
   background_queue_->WriteSparseData(this, offset, buf, buf_len, callback);
   return net::ERR_IO_PENDING;
 }
 
 int EntryImpl::GetAvailableRange(int64 offset, int len, int64* start,
                                  const CompletionCallback& callback) {
-  if (!background_queue_.get())
+  if (!background_queue_)
     return net::ERR_UNEXPECTED;
 
   background_queue_->GetAvailableRange(this, offset, len, start, callback);
   return net::ERR_IO_PENDING;
 }
 
 bool EntryImpl::CouldBeSparse() const {
   if (sparse_.get())
     return true;
 
   scoped_ptr<SparseControl> sparse;
   sparse.reset(new SparseControl(const_cast<EntryImpl*>(this)));
   return sparse->CouldBeSparse();
 }
 
 void EntryImpl::CancelSparseIO() {
-  if (background_queue_.get())
+  if (background_queue_)
     background_queue_->CancelSparseIO(this);
 }
 
 int EntryImpl::ReadyForSparseIO(const CompletionCallback& callback) {
   if (!sparse_.get())
     return net::OK;
 
-  if (!background_queue_.get())
+  if (!background_queue_)
     return net::ERR_UNEXPECTED;
 
   background_queue_->ReadyForSparseIO(this, callback);
   return net::ERR_IO_PENDING;
 }
 
 // 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() {
-  if (!backend_.get()) {
+  if (!backend_) {
     entry_.clear_modified();
     node_.clear_modified();
     return;
   }
   Log("~EntryImpl in");
 
   // Save the sparse info to disk. This will generate IO for this entry and
   // maybe for a child entry, so it is important to do it before deleting this
   // entry.
   sparse_.reset();
@@ skipping 47 matching lines @@
   if (index < 0 || index >= kNumStreams)
     return net::ERR_INVALID_ARGUMENT;
 
   int entry_size = entry_.Data()->data_size[index];
   if (offset >= entry_size || offset < 0 || !buf_len)
     return 0;
 
   if (buf_len < 0)
     return net::ERR_INVALID_ARGUMENT;
 
-  if (!backend_.get())
+  if (!backend_)
     return net::ERR_UNEXPECTED;
 
   TimeTicks start = TimeTicks::Now();
 
   if (offset + buf_len > entry_size)
     buf_len = entry_size - offset;
 
   UpdateRank(false);
 
   backend_->OnEvent(Stats::READ_DATA);
@@ skipping 61 matching lines @@
                                  const CompletionCallback& callback,
                                  bool truncate) {
   DCHECK(node_.Data()->dirty || read_only_);
   DVLOG(2) << "Write to " << index << " at " << offset << " : " << buf_len;
   if (index < 0 || index >= kNumStreams)
     return net::ERR_INVALID_ARGUMENT;
 
   if (offset < 0 || buf_len < 0)
     return net::ERR_INVALID_ARGUMENT;
 
-  if (!backend_.get())
+  if (!backend_)
     return net::ERR_UNEXPECTED;
 
   int max_file_size = backend_->MaxFileSize();
 
   // offset or buf_len could be negative numbers.
   if (offset > max_file_size || buf_len > max_file_size ||
       offset + buf_len > max_file_size) {
     int size = offset + buf_len;
     if (size <= max_file_size)
       size = kint32max;
@@ skipping 87 matching lines @@
   if (!CreateBlock(size, &address))
     return false;
 
   entry_.Data()->data_addr[index] = address.value();
   entry_.Store();
   return true;
 }
 
 bool EntryImpl::CreateBlock(int size, Addr* address) {
   DCHECK(!address->is_initialized());
-  if (!backend_.get())
+  if (!backend_)
     return false;
 
   FileType file_type = Addr::RequiredFileType(size);
   if (EXTERNAL == file_type) {
     if (size > backend_->MaxFileSize())
       return false;
     if (!backend_->CreateExternalFile(address))
       return false;
   } else {
     int num_blocks = Addr::RequiredBlocks(size, file_type);
 
     if (!backend_->CreateBlock(file_type, num_blocks, address))
       return false;
   }
   return true;
 }
 
 // Note that this method may end up modifying a block file so upon return the
 // involved block will be free, and could be reused for something else. If there
 // is a crash after that point (and maybe before returning to the caller), the
 // entry will be left dirty... and at some point it will be discarded; it is
 // important that the entry doesn't keep a reference to this address, or we'll
 // end up deleting the contents of |address| once again.
 void EntryImpl::DeleteData(Addr address, int index) {
-  DCHECK(backend_.get());
+  DCHECK(backend_);
   if (!address.is_initialized())
     return;
   if (address.is_separate_file()) {
     int failure = !DeleteCacheFile(backend_->GetFileName(address));
     CACHE_UMA(COUNTS, "DeleteFailed", 0, failure);
     if (failure) {
       LOG(ERROR) << "Failed to delete " <<
           backend_->GetFileName(address).value() << " from the cache.";
     }
-    if (files_[index].get())
+    if (files_[index])
       files_[index] = NULL;  // Releases the object.
   } else {
     backend_->DeleteBlock(address, true);
   }
 }
 
 void EntryImpl::UpdateRank(bool modified) {
-  if (!backend_.get())
+  if (!backend_)
     return;
 
   if (!doomed_) {
     // Everything is handled by the backend.
     backend_->UpdateRank(this, modified);
     return;
   }
 
   Time current = Time::Now();
   node_.Data()->last_used = current.ToInternalValue();
 
   if (modified)
     node_.Data()->last_modified = current.ToInternalValue();
 }
 
 File* EntryImpl::GetBackingFile(Addr address, int index) {
-  if (!backend_.get())
+  if (!backend_)
     return NULL;
 
   File* file;
   if (address.is_separate_file())
     file = GetExternalFile(address, index);
   else
     file = backend_->File(address);
   return file;
 }
 
@@ skipping 253 matching lines @@
 void EntryImpl::SetEntryFlags(uint32 flags) {
   entry_.Data()->flags |= flags;
   entry_.set_modified();
 }
 
 uint32 EntryImpl::GetEntryFlags() {
   return entry_.Data()->flags;
 }
 
 void EntryImpl::GetData(int index, char** buffer, Addr* address) {
-  DCHECK(backend_.get());
+  DCHECK(backend_);
   if (user_buffers_[index].get() && user_buffers_[index]->Size() &&
       !user_buffers_[index]->Start()) {
     // The data is already in memory, just copy it and we're done.
     int data_len = entry_.Data()->data_size[index];
     if (data_len <= user_buffers_[index]->Size()) {
       DCHECK(!user_buffers_[index]->Start());
       *buffer = new char[data_len];
       memcpy(*buffer, user_buffers_[index]->Data(), data_len);
       return;
     }
@@ skipping 21 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