1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
// 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 "src/utils.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;
expected_size = Max(expected_size, ScavengeJob::kMinAllocationLimit);
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 + 1, 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
|
