Adding discardable memory dump provider.

content/common/discardable_shared_memory_heap_unittest.cc

 // Copyright 2014 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 "content/common/discardable_shared_memory_heap.h"
 
 #include "base/bind.h"
 #include "base/memory/discardable_shared_memory.h"
 #include "base/process/process_metrics.h"
 #include "testing/gtest/include/gtest/gtest.h"
@@ skipping 19 matching lines @@
 
   const size_t kBlocks = 10;
   size_t memory_size = block_size * kBlocks;
 
   scoped_ptr<base::DiscardableSharedMemory> memory(
       new base::DiscardableSharedMemory);
   ASSERT_TRUE(memory->CreateAndMap(memory_size));
 
   // Create new span for memory.
   scoped_ptr<DiscardableSharedMemoryHeap::Span> new_span(
-      heap.Grow(memory.Pass(), memory_size, base::Bind(NullTask)));
+      heap.Grow(memory.Pass(), memory_size, 0, base::Bind(NullTask)));
 
   // Size should match |memory_size|.
   EXPECT_EQ(memory_size, heap.GetSize());
 
   // Size of free lists should still be 0.
   EXPECT_EQ(0u, heap.GetSizeOfFreeLists());
 
   // Free list should still be empty as |new_span| is currently in use.
   EXPECT_FALSE(heap.SearchFreeLists(1, 0));
 
@@ skipping 22 matching lines @@
   size_t block_size = base::GetPageSize();
   DiscardableSharedMemoryHeap heap(block_size);
 
   const size_t kBlocks = 6;
   size_t memory_size = block_size * kBlocks;
 
   scoped_ptr<base::DiscardableSharedMemory> memory(
       new base::DiscardableSharedMemory);
   ASSERT_TRUE(memory->CreateAndMap(memory_size));
   scoped_ptr<DiscardableSharedMemoryHeap::Span> new_span(
-      heap.Grow(memory.Pass(), memory_size, base::Bind(NullTask)));
+      heap.Grow(memory.Pass(), memory_size, 0, base::Bind(NullTask)));
 
   // Split span into two.
   scoped_ptr<DiscardableSharedMemoryHeap::Span> leftover =
       heap.Split(new_span.get(), 3);
   ASSERT_TRUE(leftover);
 
   // Merge |leftover| into free lists.
   heap.MergeIntoFreeLists(leftover.Pass());
 
   // Some of the memory is still in use.
@@ skipping 34 matching lines @@
   size_t block_size = base::GetPageSize();
   DiscardableSharedMemoryHeap heap(block_size);
 
   const size_t kBlocks = 6;
   size_t memory_size = block_size * kBlocks;
 
   scoped_ptr<base::DiscardableSharedMemory> memory(
       new base::DiscardableSharedMemory);
   ASSERT_TRUE(memory->CreateAndMap(memory_size));
   scoped_ptr<DiscardableSharedMemoryHeap::Span> new_span(
-      heap.Grow(memory.Pass(), memory_size, base::Bind(NullTask)));
+      heap.Grow(memory.Pass(), memory_size, 0, base::Bind(NullTask)));
 
   // Split span into two.
   scoped_ptr<DiscardableSharedMemoryHeap::Span> leftover =
       heap.Split(new_span.get(), 5);
   ASSERT_TRUE(leftover);
 
   // Merge |new_span| into free lists.
   heap.MergeIntoFreeLists(new_span.Pass());
 
   // Merge |leftover| into free lists.
   heap.MergeIntoFreeLists(leftover.Pass());
 }
 
 TEST(DiscardableSharedMemoryHeapTest, Grow) {
   size_t block_size = base::GetPageSize();
   DiscardableSharedMemoryHeap heap(block_size);
 
   scoped_ptr<base::DiscardableSharedMemory> memory1(
       new base::DiscardableSharedMemory);
   ASSERT_TRUE(memory1->CreateAndMap(block_size));
   heap.MergeIntoFreeLists(
-      heap.Grow(memory1.Pass(), block_size, base::Bind(NullTask)).Pass());
+      heap.Grow(memory1.Pass(), block_size, 0, base::Bind(NullTask)).Pass());
 
   // Remove a span from free lists.
   scoped_ptr<DiscardableSharedMemoryHeap::Span> span1 =
       heap.SearchFreeLists(1, 0);
   EXPECT_TRUE(span1);
 
   // No more memory available.
   EXPECT_FALSE(heap.SearchFreeLists(1, 0));
 
   // Grow free lists using new memory.
   scoped_ptr<base::DiscardableSharedMemory> memory2(
       new base::DiscardableSharedMemory);
   ASSERT_TRUE(memory2->CreateAndMap(block_size));
   heap.MergeIntoFreeLists(
-      heap.Grow(memory2.Pass(), block_size, base::Bind(NullTask)).Pass());
+      heap.Grow(memory2.Pass(), block_size, 1, base::Bind(NullTask)).Pass());
 
   // Memory should now be available.
   scoped_ptr<DiscardableSharedMemoryHeap::Span> span2 =
       heap.SearchFreeLists(1, 0);
   EXPECT_TRUE(span2);
 
   // Merge spans into the free lists again.
   heap.MergeIntoFreeLists(span1.Pass());
   heap.MergeIntoFreeLists(span2.Pass());
 }
 
 TEST(DiscardableSharedMemoryHeapTest, ReleaseFreeMemory) {
   size_t block_size = base::GetPageSize();
   DiscardableSharedMemoryHeap heap(block_size);
 
   scoped_ptr<base::DiscardableSharedMemory> memory(
       new base::DiscardableSharedMemory);
   ASSERT_TRUE(memory->CreateAndMap(block_size));
   scoped_ptr<DiscardableSharedMemoryHeap::Span> span =
-      heap.Grow(memory.Pass(), block_size, base::Bind(NullTask));
+      heap.Grow(memory.Pass(), block_size, 0, base::Bind(NullTask));
 
   // Free lists should be empty.
   EXPECT_EQ(0u, heap.GetSizeOfFreeLists());
 
   heap.ReleaseFreeMemory();
 
   // Size should still match |block_size|.
   EXPECT_EQ(block_size, heap.GetSize());
 
   heap.MergeIntoFreeLists(span.Pass());
   heap.ReleaseFreeMemory();
 
   // Memory should have been released.
   EXPECT_EQ(0u, heap.GetSize());
   EXPECT_EQ(0u, heap.GetSizeOfFreeLists());
 }
 
 TEST(DiscardableSharedMemoryHeapTest, ReleasePurgedMemory) {
   size_t block_size = base::GetPageSize();
   DiscardableSharedMemoryHeap heap(block_size);
 
   scoped_ptr<base::DiscardableSharedMemory> memory(
       new base::DiscardableSharedMemory);
   ASSERT_TRUE(memory->CreateAndMap(block_size));
   scoped_ptr<DiscardableSharedMemoryHeap::Span> span =
-      heap.Grow(memory.Pass(), block_size, base::Bind(NullTask));
+      heap.Grow(memory.Pass(), block_size, 0, base::Bind(NullTask));
 
   // Unlock memory so it can be purged.
   span->shared_memory()->Unlock(0, 0);
 
   // Purge and release shared memory.
   bool rv = span->shared_memory()->Purge(base::Time::Now());
   EXPECT_TRUE(rv);
   heap.ReleasePurgedMemory();
 
   // Shared memory backing for |span| should be gone.
   EXPECT_FALSE(span->shared_memory());
 
   // Size should be 0.
   EXPECT_EQ(0u, heap.GetSize());
 }
 
 TEST(DiscardableSharedMemoryHeapTest, Slack) {
   size_t block_size = base::GetPageSize();
   DiscardableSharedMemoryHeap heap(block_size);
 
   const size_t kBlocks = 6;
   size_t memory_size = block_size * kBlocks;
 
   scoped_ptr<base::DiscardableSharedMemory> memory(
       new base::DiscardableSharedMemory);
   ASSERT_TRUE(memory->CreateAndMap(memory_size));
   heap.MergeIntoFreeLists(
-      heap.Grow(memory.Pass(), memory_size, base::Bind(NullTask)).Pass());
+      heap.Grow(memory.Pass(), memory_size, 0, base::Bind(NullTask)).Pass());
 
   // No free span that is less or equal to 3 + 1.
   EXPECT_FALSE(heap.SearchFreeLists(3, 1));
 
   // No free span that is less or equal to 3 + 2.
   EXPECT_FALSE(heap.SearchFreeLists(3, 2));
 
   // No free span that is less or equal to 1 + 4.
   EXPECT_FALSE(heap.SearchFreeLists(1, 4));
 
@@ skipping 10 matching lines @@
 
 TEST(DiscardableSharedMemoryHeapTest, DeletedCallback) {
   size_t block_size = base::GetPageSize();
   DiscardableSharedMemoryHeap heap(block_size);
 
   scoped_ptr<base::DiscardableSharedMemory> memory(
       new base::DiscardableSharedMemory);
   ASSERT_TRUE(memory->CreateAndMap(block_size));
   bool deleted = false;
   scoped_ptr<DiscardableSharedMemoryHeap::Span> span =
-      heap.Grow(memory.Pass(), block_size,
+      heap.Grow(memory.Pass(), block_size, 0,
                 base::Bind(OnDeleted, base::Unretained(&deleted)));
 
   heap.MergeIntoFreeLists(span.Pass());
   heap.ReleaseFreeMemory();
 
   EXPECT_TRUE(deleted);
 }
 
 }  // namespace
 }  // namespace content