| OLD | NEW |
| 1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include <limits> | 5 #include <limits> |
| 6 | 6 |
| 7 #include "src/heap/gc-idle-time-handler.h" | 7 #include "src/heap/gc-idle-time-handler.h" |
| 8 #include "testing/gtest/include/gtest/gtest.h" | 8 #include "testing/gtest/include/gtest/gtest.h" |
| 9 | 9 |
| 10 namespace v8 { | 10 namespace v8 { |
| (...skipping 11 matching lines...) Expand all Loading... |
| 22 GCIdleTimeHandler::HeapState DefaultHeapState() { | 22 GCIdleTimeHandler::HeapState DefaultHeapState() { |
| 23 GCIdleTimeHandler::HeapState result; | 23 GCIdleTimeHandler::HeapState result; |
| 24 result.contexts_disposed = 0; | 24 result.contexts_disposed = 0; |
| 25 result.size_of_objects = kSizeOfObjects; | 25 result.size_of_objects = kSizeOfObjects; |
| 26 result.incremental_marking_stopped = false; | 26 result.incremental_marking_stopped = false; |
| 27 result.can_start_incremental_marking = true; | 27 result.can_start_incremental_marking = true; |
| 28 result.sweeping_in_progress = false; | 28 result.sweeping_in_progress = false; |
| 29 result.mark_compact_speed_in_bytes_per_ms = kMarkCompactSpeed; | 29 result.mark_compact_speed_in_bytes_per_ms = kMarkCompactSpeed; |
| 30 result.incremental_marking_speed_in_bytes_per_ms = kMarkingSpeed; | 30 result.incremental_marking_speed_in_bytes_per_ms = kMarkingSpeed; |
| 31 result.scavenge_speed_in_bytes_per_ms = kScavengeSpeed; | 31 result.scavenge_speed_in_bytes_per_ms = kScavengeSpeed; |
| 32 result.available_new_space_memory = kNewSpaceCapacity; | 32 result.used_new_space_size = 0; |
| 33 result.new_space_capacity = kNewSpaceCapacity; | 33 result.new_space_capacity = kNewSpaceCapacity; |
| 34 result.new_space_allocation_throughput_in_bytes_per_ms = | 34 result.new_space_allocation_throughput_in_bytes_per_ms = |
| 35 kNewSpaceAllocationThroughput; | 35 kNewSpaceAllocationThroughput; |
| 36 return result; | 36 return result; |
| 37 } | 37 } |
| 38 | 38 |
| 39 static const size_t kSizeOfObjects = 100 * MB; | 39 static const size_t kSizeOfObjects = 100 * MB; |
| 40 static const size_t kMarkCompactSpeed = 200 * KB; | 40 static const size_t kMarkCompactSpeed = 200 * KB; |
| 41 static const size_t kMarkingSpeed = 200 * KB; | 41 static const size_t kMarkingSpeed = 200 * KB; |
| 42 static const size_t kScavengeSpeed = 100 * KB; | 42 static const size_t kScavengeSpeed = 100 * KB; |
| (...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 102 | 102 |
| 103 | 103 |
| 104 TEST(GCIdleTimeHandler, EstimateMarkCompactTimeMax) { | 104 TEST(GCIdleTimeHandler, EstimateMarkCompactTimeMax) { |
| 105 size_t size = std::numeric_limits<size_t>::max(); | 105 size_t size = std::numeric_limits<size_t>::max(); |
| 106 size_t speed = 1; | 106 size_t speed = 1; |
| 107 size_t time = GCIdleTimeHandler::EstimateMarkCompactTime(size, speed); | 107 size_t time = GCIdleTimeHandler::EstimateMarkCompactTime(size, speed); |
| 108 EXPECT_EQ(GCIdleTimeHandler::kMaxMarkCompactTimeInMs, time); | 108 EXPECT_EQ(GCIdleTimeHandler::kMaxMarkCompactTimeInMs, time); |
| 109 } | 109 } |
| 110 | 110 |
| 111 | 111 |
| 112 TEST(GCIdleTimeHandler, EstimateScavengeTimeInitial) { | |
| 113 size_t size = 1 * MB; | |
| 114 size_t time = GCIdleTimeHandler::EstimateScavengeTime(size, 0); | |
| 115 EXPECT_EQ(size / GCIdleTimeHandler::kInitialConservativeScavengeSpeed, time); | |
| 116 } | |
| 117 | |
| 118 | |
| 119 TEST(GCIdleTimeHandler, EstimateScavengeTimeNonZero) { | |
| 120 size_t size = 1 * MB; | |
| 121 size_t speed = 1 * MB; | |
| 122 size_t time = GCIdleTimeHandler::EstimateScavengeTime(size, speed); | |
| 123 EXPECT_EQ(size / speed, time); | |
| 124 } | |
| 125 | |
| 126 | |
| 127 TEST(GCIdleTimeHandler, ScavangeMayHappenSoonInitial) { | |
| 128 size_t available = 100 * KB; | |
| 129 EXPECT_FALSE(GCIdleTimeHandler::ScavangeMayHappenSoon(available, 0)); | |
| 130 } | |
| 131 | |
| 132 | |
| 133 TEST(GCIdleTimeHandler, ScavangeMayHappenSoonNonZeroFalse) { | |
| 134 size_t available = (GCIdleTimeHandler::kMaxFrameRenderingIdleTime + 1) * KB; | |
| 135 size_t speed = 1 * KB; | |
| 136 EXPECT_FALSE(GCIdleTimeHandler::ScavangeMayHappenSoon(available, speed)); | |
| 137 } | |
| 138 | |
| 139 | |
| 140 TEST(GCIdleTimeHandler, ScavangeMayHappenSoonNonZeroTrue) { | |
| 141 size_t available = GCIdleTimeHandler::kMaxFrameRenderingIdleTime * KB; | |
| 142 size_t speed = 1 * KB; | |
| 143 EXPECT_TRUE(GCIdleTimeHandler::ScavangeMayHappenSoon(available, speed)); | |
| 144 } | |
| 145 | |
| 146 | |
| 147 TEST_F(GCIdleTimeHandlerTest, AfterContextDisposeLargeIdleTime) { | 112 TEST_F(GCIdleTimeHandlerTest, AfterContextDisposeLargeIdleTime) { |
| 148 GCIdleTimeHandler::HeapState heap_state = DefaultHeapState(); | 113 GCIdleTimeHandler::HeapState heap_state = DefaultHeapState(); |
| 149 heap_state.contexts_disposed = 1; | 114 heap_state.contexts_disposed = 1; |
| 150 heap_state.incremental_marking_stopped = true; | 115 heap_state.incremental_marking_stopped = true; |
| 151 size_t speed = heap_state.mark_compact_speed_in_bytes_per_ms; | 116 size_t speed = heap_state.mark_compact_speed_in_bytes_per_ms; |
| 152 int idle_time_ms = | 117 int idle_time_ms = |
| 153 static_cast<int>((heap_state.size_of_objects + speed - 1) / speed); | 118 static_cast<int>((heap_state.size_of_objects + speed - 1) / speed); |
| 154 GCIdleTimeAction action = handler()->Compute(idle_time_ms, heap_state); | 119 GCIdleTimeAction action = handler()->Compute(idle_time_ms, heap_state); |
| 155 EXPECT_EQ(DO_FULL_GC, action.type); | 120 EXPECT_EQ(DO_FULL_GC, action.type); |
| 156 } | 121 } |
| (...skipping 130 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 287 } | 252 } |
| 288 heap_state.can_start_incremental_marking = true; | 253 heap_state.can_start_incremental_marking = true; |
| 289 action = handler()->Compute(idle_time_ms, heap_state); | 254 action = handler()->Compute(idle_time_ms, heap_state); |
| 290 EXPECT_EQ(DO_INCREMENTAL_MARKING, action.type); | 255 EXPECT_EQ(DO_INCREMENTAL_MARKING, action.type); |
| 291 } | 256 } |
| 292 | 257 |
| 293 | 258 |
| 294 TEST_F(GCIdleTimeHandlerTest, Scavenge) { | 259 TEST_F(GCIdleTimeHandlerTest, Scavenge) { |
| 295 GCIdleTimeHandler::HeapState heap_state = DefaultHeapState(); | 260 GCIdleTimeHandler::HeapState heap_state = DefaultHeapState(); |
| 296 int idle_time_ms = 10; | 261 int idle_time_ms = 10; |
| 297 heap_state.available_new_space_memory = | 262 heap_state.used_new_space_size = |
| 298 kNewSpaceAllocationThroughput * idle_time_ms; | 263 heap_state.new_space_capacity - |
| 264 (kNewSpaceAllocationThroughput * idle_time_ms); |
| 299 GCIdleTimeAction action = handler()->Compute(idle_time_ms, heap_state); | 265 GCIdleTimeAction action = handler()->Compute(idle_time_ms, heap_state); |
| 300 EXPECT_EQ(DO_SCAVENGE, action.type); | 266 EXPECT_EQ(DO_SCAVENGE, action.type); |
| 301 } | 267 } |
| 302 | 268 |
| 303 | 269 |
| 304 TEST_F(GCIdleTimeHandlerTest, ScavengeAndDone) { | 270 TEST_F(GCIdleTimeHandlerTest, ScavengeAndDone) { |
| 305 GCIdleTimeHandler::HeapState heap_state = DefaultHeapState(); | 271 GCIdleTimeHandler::HeapState heap_state = DefaultHeapState(); |
| 306 int idle_time_ms = 10; | 272 int idle_time_ms = 10; |
| 307 heap_state.can_start_incremental_marking = false; | 273 heap_state.can_start_incremental_marking = false; |
| 308 heap_state.incremental_marking_stopped = true; | 274 heap_state.incremental_marking_stopped = true; |
| 309 heap_state.available_new_space_memory = | 275 heap_state.used_new_space_size = |
| 310 kNewSpaceAllocationThroughput * idle_time_ms; | 276 heap_state.new_space_capacity - |
| 277 (kNewSpaceAllocationThroughput * idle_time_ms); |
| 311 GCIdleTimeAction action = handler()->Compute(idle_time_ms, heap_state); | 278 GCIdleTimeAction action = handler()->Compute(idle_time_ms, heap_state); |
| 312 EXPECT_EQ(DO_SCAVENGE, action.type); | 279 EXPECT_EQ(DO_SCAVENGE, action.type); |
| 313 heap_state.available_new_space_memory = kNewSpaceCapacity; | 280 heap_state.used_new_space_size = 0; |
| 314 action = handler()->Compute(idle_time_ms, heap_state); | 281 action = handler()->Compute(idle_time_ms, heap_state); |
| 315 EXPECT_EQ(DO_NOTHING, action.type); | 282 EXPECT_EQ(DO_NOTHING, action.type); |
| 316 } | 283 } |
| 317 | 284 |
| 318 | 285 |
| 319 TEST_F(GCIdleTimeHandlerTest, ZeroIdleTimeNothingToDo) { | 286 TEST_F(GCIdleTimeHandlerTest, ZeroIdleTimeNothingToDo) { |
| 320 GCIdleTimeHandler::HeapState heap_state = DefaultHeapState(); | 287 GCIdleTimeHandler::HeapState heap_state = DefaultHeapState(); |
| 321 int idle_time_ms = 0; | 288 int idle_time_ms = 0; |
| 322 GCIdleTimeAction action = handler()->Compute(idle_time_ms, heap_state); | 289 GCIdleTimeAction action = handler()->Compute(idle_time_ms, heap_state); |
| 323 EXPECT_EQ(DO_NOTHING, action.type); | 290 EXPECT_EQ(DO_NOTHING, action.type); |
| (...skipping 15 matching lines...) Expand all Loading... |
| 339 // Emulate mutator work. | 306 // Emulate mutator work. |
| 340 for (int i = 0; i < GCIdleTimeHandler::kIdleScavengeThreshold; i++) { | 307 for (int i = 0; i < GCIdleTimeHandler::kIdleScavengeThreshold; i++) { |
| 341 handler()->NotifyScavenge(); | 308 handler()->NotifyScavenge(); |
| 342 } | 309 } |
| 343 action = handler()->Compute(0, heap_state); | 310 action = handler()->Compute(0, heap_state); |
| 344 EXPECT_EQ(DO_NOTHING, action.type); | 311 EXPECT_EQ(DO_NOTHING, action.type); |
| 345 } | 312 } |
| 346 | 313 |
| 347 } // namespace internal | 314 } // namespace internal |
| 348 } // namespace v8 | 315 } // namespace v8 |
| OLD | NEW |