Adding discardable memory dump provider.

content/common/discardable_shared_memory_heap_perftest.cc

 // Copyright 2015 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 <algorithm>
 #include <cmath>
 #include <cstdlib>
 
@@ skipping 14 matching lines @@
 void NullTask() {
 }
 
 TEST(DiscardableSharedMemoryHeapTest, SearchFreeLists) {
   size_t block_size = base::GetPageSize();
   DiscardableSharedMemoryHeap heap(block_size);
 
   const size_t kBlocks = 4096;
   const size_t kSegments = 16;
   size_t segment_size = block_size * kBlocks;
+  int next_discardable_shared_memory_id = 0;
 
   for (size_t i = 0; i < kSegments; ++i) {
     scoped_ptr<base::DiscardableSharedMemory> memory(
         new base::DiscardableSharedMemory);
     ASSERT_TRUE(memory->CreateAndMap(segment_size));
-    heap.MergeIntoFreeLists(
-        heap.Grow(memory.Pass(), segment_size, base::Bind(NullTask)).Pass());
+    heap.MergeIntoFreeLists(heap.Grow(memory.Pass(), segment_size,
+                                      next_discardable_shared_memory_id++,
+                                      base::Bind(NullTask)).Pass());
   }
 
   unsigned kSeed = 1;
   // Use kSeed as seed for random number generator.
   srand(kSeed);
 
   // Pre-compute random values.
   int random_span[kTimeCheckInterval];
   size_t random_blocks[kTimeCheckInterval];
   for (int i = 0; i < kTimeCheckInterval; ++i) {
@@ skipping 36 matching lines @@
   }
 
   spans.clear();
 
   perf_test::PrintResult("search_free_list", "", "",
                          count / accumulator.InSecondsF(), "runs/s", true);
 }
 
 }  // namespace
 }  // namespace content