mirror of
https://github.com/nodejs/node.git
synced 2025-05-19 04:51:50 +00:00
8a43a3d761
Pick up the latest branch head for V8 4.7:
be169f8df0
Full change history for the 4.7 branch:
https://chromium.googlesource.com/v8/v8.git/+log/branch-heads/4.7
V8 blog post about what is new on V8 4.7:
http://v8project.blogspot.de/2015/10/v8-release-47.html
PR-URL: https://github.com/nodejs/node/pull/4106
Reviewed-By: bnoordhuis - Ben Noordhuis <info@bnoordhuis.nl>
Reviewed-By: targos - Michaël Zasso <mic.besace@gmail.com>
Reviewed-By: rvagg - Rod Vagg <rod@vagg.org>
112 lines
4.2 KiB
C++
112 lines
4.2 KiB
C++
// 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/globals.h"
|
|
#include "src/heap/scavenge-job.h"
|
|
#include "testing/gtest/include/gtest/gtest.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
const size_t kScavengeSpeedInBytesPerMs = 500 * KB;
|
|
const size_t kNewSpaceCapacity = 8 * MB;
|
|
|
|
|
|
TEST(ScavengeJob, AllocationLimitEmptyNewSpace) {
|
|
EXPECT_FALSE(ScavengeJob::ReachedIdleAllocationLimit(
|
|
kScavengeSpeedInBytesPerMs, 0, kNewSpaceCapacity));
|
|
}
|
|
|
|
|
|
TEST(ScavengeJob, AllocationLimitFullNewSpace) {
|
|
EXPECT_TRUE(ScavengeJob::ReachedIdleAllocationLimit(
|
|
kScavengeSpeedInBytesPerMs, kNewSpaceCapacity, kNewSpaceCapacity));
|
|
}
|
|
|
|
|
|
TEST(ScavengeJob, AllocationLimitUnknownScavengeSpeed) {
|
|
size_t expected_size = ScavengeJob::kInitialScavengeSpeedInBytesPerMs *
|
|
ScavengeJob::kAverageIdleTimeMs -
|
|
ScavengeJob::kBytesAllocatedBeforeNextIdleTask;
|
|
EXPECT_FALSE(ScavengeJob::ReachedIdleAllocationLimit(0, expected_size - 1,
|
|
kNewSpaceCapacity));
|
|
EXPECT_TRUE(ScavengeJob::ReachedIdleAllocationLimit(0, expected_size,
|
|
kNewSpaceCapacity));
|
|
}
|
|
|
|
|
|
TEST(ScavengeJob, AllocationLimitLowScavengeSpeed) {
|
|
size_t scavenge_speed = 1 * KB;
|
|
EXPECT_FALSE(ScavengeJob::ReachedIdleAllocationLimit(
|
|
scavenge_speed, ScavengeJob::kMinAllocationLimit - 1, kNewSpaceCapacity));
|
|
EXPECT_TRUE(ScavengeJob::ReachedIdleAllocationLimit(
|
|
scavenge_speed, ScavengeJob::kMinAllocationLimit, kNewSpaceCapacity));
|
|
}
|
|
|
|
|
|
TEST(ScavengeJob, AllocationLimitAverageScavengeSpeed) {
|
|
size_t expected_size =
|
|
kScavengeSpeedInBytesPerMs * ScavengeJob::kAverageIdleTimeMs -
|
|
ScavengeJob::kBytesAllocatedBeforeNextIdleTask;
|
|
EXPECT_FALSE(ScavengeJob::ReachedIdleAllocationLimit(
|
|
kScavengeSpeedInBytesPerMs, ScavengeJob::kMinAllocationLimit,
|
|
kNewSpaceCapacity));
|
|
EXPECT_FALSE(ScavengeJob::ReachedIdleAllocationLimit(
|
|
kScavengeSpeedInBytesPerMs, expected_size - 1, kNewSpaceCapacity));
|
|
EXPECT_TRUE(ScavengeJob::ReachedIdleAllocationLimit(
|
|
kScavengeSpeedInBytesPerMs, expected_size, kNewSpaceCapacity));
|
|
}
|
|
|
|
|
|
TEST(ScavengeJob, AllocationLimitHighScavengeSpeed) {
|
|
size_t scavenge_speed = kNewSpaceCapacity;
|
|
size_t expected_size =
|
|
static_cast<size_t>(
|
|
kNewSpaceCapacity *
|
|
ScavengeJob::kMaxAllocationLimitAsFractionOfNewSpace) -
|
|
ScavengeJob::kBytesAllocatedBeforeNextIdleTask;
|
|
EXPECT_FALSE(ScavengeJob::ReachedIdleAllocationLimit(
|
|
scavenge_speed, expected_size - 1, kNewSpaceCapacity));
|
|
EXPECT_TRUE(ScavengeJob::ReachedIdleAllocationLimit(
|
|
scavenge_speed, expected_size, kNewSpaceCapacity));
|
|
}
|
|
|
|
|
|
TEST(ScavengeJob, EnoughIdleTimeForScavengeUnknownScavengeSpeed) {
|
|
size_t scavenge_speed = ScavengeJob::kInitialScavengeSpeedInBytesPerMs;
|
|
size_t new_space_size = 1 * MB;
|
|
size_t expected_time = (new_space_size + scavenge_speed - 1) / scavenge_speed;
|
|
EXPECT_TRUE(
|
|
ScavengeJob::EnoughIdleTimeForScavenge(expected_time, 0, new_space_size));
|
|
EXPECT_FALSE(ScavengeJob::EnoughIdleTimeForScavenge(expected_time - 1, 0,
|
|
new_space_size));
|
|
}
|
|
|
|
|
|
TEST(ScavengeJob, EnoughIdleTimeForScavengeLowScavengeSpeed) {
|
|
size_t scavenge_speed = 1 * KB;
|
|
size_t new_space_size = 1 * MB;
|
|
size_t expected_time = (new_space_size + scavenge_speed - 1) / scavenge_speed;
|
|
EXPECT_TRUE(ScavengeJob::EnoughIdleTimeForScavenge(
|
|
expected_time, scavenge_speed, new_space_size));
|
|
EXPECT_FALSE(ScavengeJob::EnoughIdleTimeForScavenge(
|
|
expected_time - 1, scavenge_speed, new_space_size));
|
|
}
|
|
|
|
|
|
TEST(ScavengeJob, EnoughIdleTimeForScavengeHighScavengeSpeed) {
|
|
size_t scavenge_speed = kNewSpaceCapacity;
|
|
size_t new_space_size = 1 * MB;
|
|
size_t expected_time = (new_space_size + scavenge_speed - 1) / scavenge_speed;
|
|
EXPECT_TRUE(ScavengeJob::EnoughIdleTimeForScavenge(
|
|
expected_time, scavenge_speed, new_space_size));
|
|
EXPECT_FALSE(ScavengeJob::EnoughIdleTimeForScavenge(
|
|
expected_time - 1, scavenge_speed, new_space_size));
|
|
}
|
|
|
|
} // namespace internal
|
|
} // namespace v8
|