Start incremental marking only if there are enough promoted objects since the last GC.

src/heap.h

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 1319 matching lines @@
 
   // Allocate uninitialized fixed array.
   MUST_USE_RESULT MaybeObject* AllocateRawFixedArray(int length);
   MUST_USE_RESULT MaybeObject* AllocateRawFixedArray(int length,
                                                      PretenureFlag pretenure);
 
   inline intptr_t PromotedTotalSize() {
     return PromotedSpaceSize() + PromotedExternalMemorySize();
   }
 
+  inline intptr_t PromotedTotalSizeOfObjects() {
+    return PromotedSpaceSizeOfObjects() + PromotedExternalMemorySize();
+  }
+
   // True if we have reached the allocation limit in the old generation that
   // should force the next GC (caused normally) to be a full one.
   inline bool OldGenerationPromotionLimitReached() {
     return PromotedTotalSize() > old_gen_promotion_limit_;
   }
 
   inline intptr_t OldGenerationSpaceAvailable() {
     return old_gen_allocation_limit_ - PromotedTotalSize();
   }
 
@@ skipping 83 matching lines @@
   // Check new space expansion criteria and expand semispaces if it was hit.
   void CheckNewSpaceExpansionCriteria();
 
   inline void IncrementYoungSurvivorsCounter(int survived) {
     ASSERT(survived >= 0);
     young_survivors_after_last_gc_ = survived;
     survived_since_last_expansion_ += survived;
   }
 
   inline bool NextGCIsLikelyToBeFull() {
+    const int kPromotionFraction = 8;
+
     if (FLAG_gc_global) return true;
 
+    intptr_t promoted_at_gc = total_promoted_at_last_old_space_gc_;
+    intptr_t promoted_since_gc = PromotedTotalSizeOfObjects() - promoted_at_gc;
+
+    if (promoted_since_gc < promoted_at_gc / kPromotionFraction) return false;
+
     intptr_t total_promoted = PromotedTotalSize();
 
     intptr_t adjusted_promotion_limit =
         old_gen_promotion_limit_ - new_space_.Capacity();
 
     if (total_promoted >= adjusted_promotion_limit) return true;
 
     intptr_t adjusted_allocation_limit =
         old_gen_allocation_limit_ - new_space_.Capacity() / 5;
 
@@ skipping 228 matching lines @@
   // every allocation in large object space.
   intptr_t old_gen_allocation_limit_;
 
   // Sometimes the heuristics dictate that those limits are increased.  This
   // variable records that fact.
   int old_gen_limit_factor_;
 
   // Used to adjust the limits that control the timing of the next GC.
   intptr_t size_of_old_gen_at_last_old_space_gc_;
 
+  intptr_t total_promoted_at_last_old_space_gc_;
+
   // Limit on the amount of externally allocated memory allowed
   // between global GCs. If reached a global GC is forced.
   intptr_t external_allocation_limit_;
 
   // The amount of external memory registered through the API kept alive
   // by global handles
   int amount_of_external_allocated_memory_;
 
   // Caches the amount of external memory registered at the last global gc.
   int amount_of_external_allocated_memory_at_last_global_gc_;
@@ skipping 989 matching lines @@
   AssertNoAllocation no_alloc;  // i.e. no gc allowed.
 
  private:
   DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer);
 };
 #endif  // DEBUG || LIVE_OBJECT_LIST
 
 } }  // namespace v8::internal
 
 #endif  // V8_HEAP_H_