Revert of Leak reports collect information about the last uptrend

components/metrics/leak_detector/leak_detector_impl_unittest.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 "components/metrics/leak_detector/leak_detector_impl.h"
 
 #include <math.h>
 #include <stddef.h>
 #include <stdint.h>
 
@@ skipping 166 matching lines @@
     detector_->RecordAlloc(ptr, size, stack.depth,
                            reinterpret_cast<const void* const*>(stack.stack));
 
     EXPECT_TRUE(alloced_ptrs_.find(ptr) == alloced_ptrs_.end());
     alloced_ptrs_.insert(ptr);
 
     ++total_num_allocs_;
     total_alloced_size_ += size;
     if (total_alloced_size_ >= next_analysis_total_alloced_size_) {
       InternalVector<InternalLeakReport> reports;
-      detector_->TestForLeaks(&reports, 1024);
+      detector_->TestForLeaks(&reports);
       for (const InternalLeakReport& report : reports) {
         auto iter = stored_reports_.find(report);
         if (iter == stored_reports_.end()) {
           stored_reports_.insert(report);
         } else {
           // InternalLeakReports are uniquely identified by |alloc_size_bytes_|
           // and |call_stack_|. See InternalLeakReport::operator<().
           // If a report with the same size and call stack already exists,
           // overwrite it with the new report, which has a newer history.
           stored_reports_.erase(iter);
@@ skipping 544 matching lines @@
 
   EXPECT_GT(counts_by_size[size_1_index], counts_by_size[size_0_index] * 10);
   EXPECT_GT(counts_by_size[size_2_index], counts_by_size[size_0_index] * 10);
 
   // |report1| and |report2| do not necessarily have the same allocation history
   // due to the different rates at which they were generated.
 }
 
 }  // namespace leak_detector
 }  // namespace metrics