Try reducing and balance GC callback stack sizes.

Source/platform/heap/CallbackStack.cpp

 // 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 "config.h"
 #include "platform/heap/CallbackStack.h"
 
 #include "platform/heap/Heap.h"
 
 namespace blink {
 
+CallbackStack::Block::Block(Block* next, unsigned blockSize)
+{
+    m_buffer = new Item[blockSize];
+    m_limit = &(m_buffer[blockSize]);
+    m_current = &(m_buffer[0]);
+    m_next = next;
+#if ENABLE(ASSERT)
+    m_blockSize = blockSize;
+#endif
+    clearUnused();
+}
+
 void CallbackStack::Block::clear()
 {
     m_current = &m_buffer[0];
     m_next = 0;
     clearUnused();
 }
 
 void CallbackStack::Block::invokeEphemeronCallbacks(Visitor* visitor)
 {
     // This loop can tolerate entries being added by the callbacks after
@@ skipping 29 matching lines @@
         if (item->object() == object)
             return true;
     }
     return false;
 }
 #endif
 
 void CallbackStack::Block::clearUnused()
 {
 #if ENABLE(ASSERT)
-    for (size_t i = 0; i < blockSize; i++)
+    for (unsigned i = 0; i < m_blockSize; ++i)
         m_buffer[i] = Item(0, 0);
 #endif
 }
 
-CallbackStack::CallbackStack() : m_first(new Block(0)), m_last(m_first)
+CallbackStack::CallbackStack(unsigned blockSize)
+    : m_first(new Block(nullptr, blockSize))
+    , m_last(m_first)
+    , m_blockSize(blockSize)
 {
 }
 
 CallbackStack::~CallbackStack()
 {
     clear();
     delete m_first;
     m_first = 0;
     m_last = 0;
 }
@@ skipping 10 matching lines @@
 }
 
 bool CallbackStack::isEmpty() const
 {
     return hasJustOneBlock() && m_first->isEmptyBlock();
 }
 
 CallbackStack::Item* CallbackStack::allocateEntrySlow()
 {
     ASSERT(!m_first->allocateEntry());
-    m_first = new Block(m_first);
+    m_first = new Block(m_first, m_blockSize);
     return m_first->allocateEntry();
 }
 
 CallbackStack::Item* CallbackStack::popSlow()
 {
     ASSERT(m_first->isEmptyBlock());
 
     for (;;) {
         if (hasJustOneBlock()) {
 #if ENABLE(ASSERT)
@@ skipping 35 matching lines @@
     // Recurse first (blockSize at a time) so we get to the newly added entries last.
     invokeOldestCallbacks(from->next(), upto, visitor);
     from->invokeEphemeronCallbacks(visitor);
 }
 
 bool CallbackStack::hasJustOneBlock() const
 {
     return !m_first->next();
 }
 
-void CallbackStack::swap(CallbackStack* other)
-{
-    Block* tmp = m_first;
-    m_first = other->m_first;
-    other->m_first = tmp;
-    tmp = m_last;
-    m_last = other->m_last;
-    other->m_last = tmp;
-}
-
 #if ENABLE(ASSERT)
 bool CallbackStack::hasCallbackForObject(const void* object)
 {
     for (Block* current = m_first; current; current = current->next()) {
         if (current->hasCallbackForObject(object))
             return true;
     }
     return false;
 }
 #endif
 
 }