Limit rate of full garbage collections triggered by idle notification.

test/unittests/heap/gc-idle-time-handler-unittest.cc

 // Copyright 2014 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.
 
 #include <limits>
 
 #include "src/heap/gc-idle-time-handler.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace v8 {
@@ skipping 16 matching lines @@
     result.incremental_marking_stopped = false;
     result.can_start_incremental_marking = true;
     result.sweeping_in_progress = false;
     result.mark_compact_speed_in_bytes_per_ms = kMarkCompactSpeed;
     result.incremental_marking_speed_in_bytes_per_ms = kMarkingSpeed;
     result.scavenge_speed_in_bytes_per_ms = kScavengeSpeed;
     result.used_new_space_size = 0;
     result.new_space_capacity = kNewSpaceCapacity;
     result.new_space_allocation_throughput_in_bytes_per_ms =
         kNewSpaceAllocationThroughput;
+    result.last_mark_compact_time = 0;
+    result.current_time = GCIdleTimeHandler::kMinTimeInBetweenMarkCompactsInMs;
     return result;
   }
 
   static const size_t kSizeOfObjects = 100 * MB;
   static const size_t kMarkCompactSpeed = 200 * KB;
   static const size_t kMarkingSpeed = 200 * KB;
   static const size_t kScavengeSpeed = 100 * KB;
   static const size_t kNewSpaceCapacity = 1 * MB;
   static const size_t kNewSpaceAllocationThroughput = 10 * KB;
 
@@ skipping 115 matching lines @@
   int idle_time_in_ms = 16;
   EXPECT_TRUE(GCIdleTimeHandler::ShouldDoScavenge(
       idle_time_in_ms, heap_state.new_space_capacity,
       heap_state.used_new_space_size, heap_state.scavenge_speed_in_bytes_per_ms,
       heap_state.new_space_allocation_throughput_in_bytes_per_ms));
 }
 
 
 TEST_F(GCIdleTimeHandlerTest, ShouldDoMarkCompact) {
   size_t idle_time_in_ms = 16;
-  EXPECT_TRUE(GCIdleTimeHandler::ShouldDoMarkCompact(idle_time_in_ms, 0, 0));
+  EXPECT_TRUE(GCIdleTimeHandler::ShouldDoMarkCompact(
+      idle_time_in_ms, 0, 0, 0,
+      GCIdleTimeHandler::kMinTimeInBetweenMarkCompactsInMs));
 }
 
 
 TEST_F(GCIdleTimeHandlerTest, DontDoMarkCompact) {
   size_t idle_time_in_ms = 1;
   EXPECT_FALSE(GCIdleTimeHandler::ShouldDoMarkCompact(
-      idle_time_in_ms, kSizeOfObjects, kMarkingSpeed));
+      idle_time_in_ms, kSizeOfObjects, kMarkingSpeed, 0,
+      GCIdleTimeHandler::kMinTimeInBetweenMarkCompactsInMs));
 }
 
 
+TEST_F(GCIdleTimeHandlerTest, DontDoMarkCompactRate) {
+  size_t idle_time_in_ms = 16;
+  EXPECT_FALSE(
+      GCIdleTimeHandler::ShouldDoMarkCompact(idle_time_in_ms, 0, 0, 0, 0));
+}
+
+
 TEST_F(GCIdleTimeHandlerTest, ShouldDoFinalIncrementalMarkCompact) {
   size_t idle_time_in_ms = 16;
   EXPECT_TRUE(GCIdleTimeHandler::ShouldDoFinalIncrementalMarkCompact(
       idle_time_in_ms, 0, 0));
 }
 
 
 TEST_F(GCIdleTimeHandlerTest, DontDoFinalIncrementalMarkCompact) {
   size_t idle_time_in_ms = 1;
   EXPECT_FALSE(GCIdleTimeHandler::ShouldDoFinalIncrementalMarkCompact(
@@ skipping 242 matching lines @@
   // Emulate mutator work.
   for (int i = 0; i < GCIdleTimeHandler::kIdleScavengeThreshold; i++) {
     handler()->NotifyScavenge();
   }
   action = handler()->Compute(0, heap_state);
   EXPECT_EQ(DO_NOTHING, action.type);
 }
 
 }  // namespace internal
 }  // namespace v8