[counting_allocator] Chrome changes.

base/trace_event/heap_profiler_allocation_register.h

 // 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.
 
 #ifndef BASE_TRACE_EVENT_HEAP_PROFILER_ALLOCATION_REGISTER_H_
 #define BASE_TRACE_EVENT_HEAP_PROFILER_ALLOCATION_REGISTER_H_
 
 #include <stddef.h>
 #include <stdint.h>
 
@@ skipping 298 matching lines @@
   static const size_t kAllocationBuckets = 1 << 18;
   static const size_t kAllocationCapacity = 1500000;
 #else
   static const size_t kAllocationBuckets = 1 << 19;
   static const size_t kAllocationCapacity = 5000000;
 #endif
 
   // 2^16 works well with BacktraceHasher. When increasing this number make
   // sure BacktraceHasher still produces low number of collisions.
   static const size_t kBacktraceBuckets = 1 << 16;
-#if defined(OS_ANDROID)
-  static const size_t kBacktraceCapacity = 32000;  // 22K was observed
-#else
-  static const size_t kBacktraceCapacity = 55000;  // 45K was observed on Linux
-#endif
+  static const size_t kBacktraceCapacity = 60000;
 
   struct BacktraceHasher {
     size_t operator () (const Backtrace& backtrace) const;
   };
 
   using BacktraceMap = internal::FixedHashMap<
       kBacktraceBuckets,
       Backtrace,
       size_t, // Number of references to the backtrace (the key). Incremented
               // when an allocation that references the backtrace is inserted,
@@ skipping 25 matching lines @@
   AllocationMap allocations_;
   BacktraceMap backtraces_;
 
   DISALLOW_COPY_AND_ASSIGN(AllocationRegister);
 };
 
 }  // namespace trace_event
 }  // namespace base
 
 #endif  // BASE_TRACE_EVENT_HEAP_PROFILER_ALLOCATION_REGISTER_H_