Revert of [Tracing] Adjust allocation register size for low-end devices

base/trace_event/heap_profiler_allocation_register.h

Index: base/trace_event/heap_profiler_allocation_register.h
diff --git a/base/trace_event/heap_profiler_allocation_register.h b/base/trace_event/heap_profiler_allocation_register.h
index 940fb5454bef3107152b42ceab95aa93567ea32d..7c4ba99cd22c05eac3000d5d2c7ec42775b28d59 100644
--- a/base/trace_event/heap_profiler_allocation_register.h
+++ b/base/trace_event/heap_profiler_allocation_register.h
@@ -60,8 +60,6 @@
   };
 
   AllocationRegister();
-  explicit AllocationRegister(uint32_t num_cells);
-
   ~AllocationRegister();
 
   // Inserts allocation details into the table. If the address was present
@@ -114,7 +112,7 @@
   // not an option). A value of ~3M entries is large enough to handle spikes in
   // the number of allocations, and modest enough to require no more than a few
   // dozens of MiB of address space.
-  static const uint32_t kNumCellsPerBucket = 10;
+  static const uint32_t kNumCells = kNumBuckets * 10;
 
   // Returns a value in the range [0, kNumBuckets - 1] (inclusive).
   static uint32_t Hash(void* address);
@@ -137,9 +135,6 @@
   // Takes a cell that is not being used to store an entry (either by recycling
   // from the free list or by taking a fresh cell) and returns its index.
   CellIndex GetFreeCell();
-
-  // The maximum number of cells which can be allocated.
-  uint32_t const num_cells_;
 
   // The array of cells. This array is backed by mmapped memory. Lower indices
   // are accessed first, higher indices are only accessed when required. In