Keep track of byte usage of the memory cache backend

base/trace_event/memory_usage_estimator.h

Index: base/trace_event/memory_usage_estimator.h
diff --git a/base/trace_event/memory_usage_estimator.h b/base/trace_event/memory_usage_estimator.h
index 1f4132bdcb2dcf29cd0396fe7c2ac691b0e6769b..6f02bb93bbbcd155764945f67ab5a1a6056dc6d5 100644
--- a/base/trace_event/memory_usage_estimator.h
+++ b/base/trace_event/memory_usage_estimator.h
@@ -22,6 +22,7 @@
 #include <vector>
 
 #include "base/base_export.h"
+#include "base/containers/linked_list.h"
 #include "base/strings/string16.h"
 #include "base/template_util.h"
 
@@ -111,6 +112,9 @@ size_t EstimateMemoryUsage(const std::vector<T, A>& vector);
 template <class T, class A>
 size_t EstimateMemoryUsage(const std::list<T, A>& list);
 
+template <class T>
+size_t EstimateMemoryUsage(const base::LinkedList<T>& list);
+
 template <class T, class C, class A>
 size_t EstimateMemoryUsage(const std::set<T, C, A>& set);
 
@@ -352,6 +356,18 @@ size_t EstimateMemoryUsage(const std::list<T, A>& list) {
          EstimateIterableMemoryUsage(list);
 }
 
+template <class T>
+size_t EstimateMemoryUsage(const base::LinkedList<T>& list) {
+  size_t memory_usage = 0u;
+  for (base::LinkNode<T>* node = list.head(); node != list.end();
+       node = node->next()) {
+    // Since we increment by calling node = node->next() we know that node
+    // isn't nullptr.
+    memory_usage += EstimateMemoryUsage(*node->value()) + sizeof(T);
+  }
+  return memory_usage;
+}
+
 // Tree containers
 
 template <class V>