Update from https://crrev.com/306655

net/disk_cache/simple/simple_backend_impl.cc

 // Copyright (c) 2013 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/simple/simple_backend_impl.h"
 
 #include <algorithm>
 #include <cstdlib>
 #include <functional>
 
@@ skipping 253 matching lines @@
       FROM_HERE,
       base::Bind(
           &SimpleBackendImpl::InitCacheStructureOnDisk, path_, orig_max_size_),
       base::Bind(&SimpleBackendImpl::InitializeIndex,
                  AsWeakPtr(),
                  completion_callback));
   return net::ERR_IO_PENDING;
 }
 
 bool SimpleBackendImpl::SetMaxSize(int max_bytes) {
+  if (max_bytes < 0)
+    return false;
   orig_max_size_ = max_bytes;
-  return index_->SetMaxSize(max_bytes);
+  index_->SetMaxSize(max_bytes);
+  return true;
 }
 
 int SimpleBackendImpl::GetMaxFileSize() const {
-  return index_->max_size() / kMaxFileRatio;
+  return static_cast<int>(index_->max_size() / kMaxFileRatio);
 }
 
 void SimpleBackendImpl::OnDoomStart(uint64 entry_hash) {
   DCHECK_EQ(0u, entries_pending_doom_.count(entry_hash));
   entries_pending_doom_.insert(
       std::make_pair(entry_hash, std::vector<Closure>()));
 }
 
 void SimpleBackendImpl::OnDoomComplete(uint64 entry_hash) {
   DCHECK_EQ(1u, entries_pending_doom_.count(entry_hash));
@@ skipping 439 matching lines @@
                    this));
   callback.Run(result);
 }
 
 void SimpleBackendImpl::FlushWorkerPoolForTesting() {
   if (g_sequenced_worker_pool)
     g_sequenced_worker_pool->FlushForTesting();
 }
 
 }  // namespace disk_cache