Calculate the size of all cache entries between two points in time.

net/disk_cache/memory/mem_backend_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/memory/mem_backend_impl.h"
 
 #include <algorithm>
 #include <functional>
 #include <utility>
 
@@ skipping 188 matching lines @@
 int MemBackendImpl::DoomEntriesSince(Time initial_time,
                                      const CompletionCallback& callback) {
   return DoomEntriesBetween(initial_time, Time::Max(), callback);
 }
 
 int MemBackendImpl::CalculateSizeOfAllEntries(
     const CompletionCallback& callback) {
   return current_size_;
 }
 
+int MemBackendImpl::CalculateSizeOfEntriesBetween(
+    base::Time initial_time,
+    base::Time end_time,
+    const CompletionCallback& callback) {
+  if (end_time.is_null())
+    end_time = Time::Max();

[gavinp, 2017/01/12 16:07:36]

If you're going to cut and paste from DoomEntriesBetween above, might as well
match the vertical spacing. I think you're right to remove this vertical
whitespace, but why not go fix it up above while we're here so the two match
completely?

[dullweber, 2017/01/12 17:03:15]

Done.

+  DCHECK_GE(end_time, initial_time);
+
+  int size = 0;
+  base::LinkNode<MemEntryImpl>* node = lru_list_.head();
+  while (node != lru_list_.end() && node->value()->GetLastUsed() < initial_time)
+    node = node->next();
+  while (node != lru_list_.end() && node->value()->GetLastUsed() < end_time) {
+    MemEntryImpl* entry = node->value();
+    size += entry->GetStorageSize();
+    node = node->next();
+  }
+  return size;
+}
+
 class MemBackendImpl::MemIterator final : public Backend::Iterator {
  public:
   explicit MemIterator(base::WeakPtr<MemBackendImpl> backend)
       : backend_(backend) {}
 
   int OpenNextEntry(Entry** next_entry,
                     const CompletionCallback& callback) override {
     if (!backend_)
       return net::ERR_FAILED;
 
@@ skipping 54 matching lines @@
   base::LinkNode<MemEntryImpl>* entry = lru_list_.head();
   while (current_size_ > target_size && entry != lru_list_.end()) {
     MemEntryImpl* to_doom = entry->value();
     entry = entry->next();
     if (!to_doom->InUse())
       to_doom->Doom();
   }
 }
 
 }  // namespace disk_cache