Introduce an option to do regular new space growing for a while

src/heap/spaces.h

 // Copyright 2011 the V8 project 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 V8_HEAP_SPACES_H_
 #define V8_HEAP_SPACES_H_
 
 #include "src/allocation.h"
 #include "src/base/atomicops.h"
 #include "src/base/bits.h"
@@ skipping 2321 matching lines @@
 // forwards most functions to the appropriate semispace.
 
 class NewSpace : public Space {
  public:
   // Constructor.
   explicit NewSpace(Heap* heap)
       : Space(heap, NEW_SPACE, NOT_EXECUTABLE),
         to_space_(heap, kToSpace),
         from_space_(heap, kFromSpace),
         reservation_(),
-        inline_allocation_limit_step_(0) {}
+        inline_allocation_limit_step_(0),
+        grow_to_target_capacity_(false) {}
 
   // Sets up the new space using the given chunk.
   bool SetUp(int reserved_semispace_size_, int max_semi_space_size);
 
   // Tears down the space.  Heap memory was not allocated by the space, so it
   // is not deallocated here.
   void TearDown();
 
   // True if the space has been set up but not torn down.
   bool HasBeenSetUp() {
@@ skipping 209 matching lines @@
     if (!from_space_.is_committed()) return true;
     return from_space_.Uncommit();
   }
 
   inline intptr_t inline_allocation_limit_step() {
     return inline_allocation_limit_step_;
   }
 
   SemiSpace* active_space() { return &to_space_; }
 
+  void set_grow_to_target_capacity(bool grow_to_target_capacity) {
+    grow_to_target_capacity_ = grow_to_target_capacity;
+  }
+
  private:
   // Update allocation info to match the current to-space page.
   void UpdateAllocationInfo();
 
   Address chunk_base_;
   uintptr_t chunk_size_;
 
   // The semispaces.
   SemiSpace to_space_;
   SemiSpace from_space_;
@@ skipping 11 matching lines @@
   AllocationInfo allocation_info_;
 
   // When incremental marking is active we will set allocation_info_.limit
   // to be lower than actual limit and then will gradually increase it
   // in steps to guarantee that we do incremental marking steps even
   // when all allocation is performed from inlined generated code.
   intptr_t inline_allocation_limit_step_;
 
   Address top_on_previous_step_;
 
+  // True if the new space should be expanded up to the target capacity
+  // when the current page is full.
+  bool grow_to_target_capacity_;
+
   HistogramInfo* allocated_histogram_;
   HistogramInfo* promoted_histogram_;
 
   MUST_USE_RESULT AllocationResult SlowAllocateRaw(int size_in_bytes);
 
   friend class SemiSpaceIterator;
 
  public:
   TRACK_MEMORY("NewSpace")
 };
@@ skipping 292 matching lines @@
     count = 0;
   }
   // Must be small, since an iteration is used for lookup.
   static const int kMaxComments = 64;
 };
 #endif
 }
 }  // namespace v8::internal
 
 #endif  // V8_HEAP_SPACES_H_