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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "gtest/gtest.h"
#include "mozilla/dom/CCGCScheduler.h"
#include "mozilla/TimeStamp.h"
// This is a test for mozilla::CCGCScheduler.
using namespace mozilla;
static TimeDuration kOneSecond = TimeDuration::FromSeconds(1);
static TimeDuration kTenthSecond = TimeDuration::FromSeconds(0.1);
static TimeDuration kFrameDuration = TimeDuration::FromSeconds(1.0 / 60.0);
static mozilla::TimeStamp sNow = TimeStamp::Now();
static mozilla::TimeStamp AdvanceTime(TimeDuration aDuration) {
sNow += aDuration;
return sNow;
}
static TimeStamp Now() { return sNow; }
static uint32_t sSuspected = 0;
static uint32_t SuspectedCCObjects() { return sSuspected; }
static void SetNumSuspected(uint32_t n) { sSuspected = n; }
static void SuspectMore(uint32_t n) { sSuspected += n; }
using CCRunnerState = mozilla::CCGCScheduler::CCRunnerState;
class TestGC {
protected:
CCGCScheduler& mScheduler;
public:
explicit TestGC(CCGCScheduler& aScheduler) : mScheduler(aScheduler) {}
void Run(int aNumSlices);
};
void TestGC::Run(int aNumSlices) {
// Make the purple buffer nearly empty so it is itself not an adequate reason
// for wanting a CC.
static_assert(3 < mozilla::kCCPurpleLimit);
SetNumSuspected(3);
// Running the GC should not influence whether a CC is currently seen as
// needed. But the first time we run GC, it will be false; later, we will
// have run a GC and set it to true.
CCReason neededCCAtStartOfGC =
mScheduler.IsCCNeeded(Now(), SuspectedCCObjects());
mScheduler.NoteGCBegin(JS::GCReason::API);
for (int slice = 0; slice < aNumSlices; slice++) {
EXPECT_TRUE(mScheduler.InIncrementalGC());
TimeStamp idleDeadline = Now() + kTenthSecond;
js::SliceBudget budget =
mScheduler.ComputeInterSliceGCBudget(idleDeadline, Now());
TimeDuration budgetDuration =
TimeDuration::FromMilliseconds(budget.timeBudget());
EXPECT_NEAR(budgetDuration.ToSeconds(), 0.1, 1.e-6);
// Pretend the GC took exactly the budget.
AdvanceTime(budgetDuration);
EXPECT_EQ(mScheduler.IsCCNeeded(Now(), SuspectedCCObjects()),
neededCCAtStartOfGC);
// Mutator runs for 1 second.
AdvanceTime(kOneSecond);
}
mScheduler.NoteGCEnd();
mScheduler.SetNeedsFullGC(false);
}
class TestCC {
protected:
CCGCScheduler& mScheduler;
public:
explicit TestCC(CCGCScheduler& aScheduler) : mScheduler(aScheduler) {}
void Run(int aNumSlices) {
Prepare();
MaybePokeCC();
TimerFires(aNumSlices);
EndCycleCollectionCallback();
KillCCRunner();
}
virtual void Prepare() = 0;
virtual void MaybePokeCC();
virtual void TimerFires(int aNumSlices);
virtual void RunSlices(int aNumSlices);
virtual void RunSlice(TimeStamp aCCStartTime, TimeStamp aPrevSliceEnd,
int aSliceNum, int aNumSlices) = 0;
virtual void ForgetSkippable();
virtual void EndCycleCollectionCallback();
virtual void KillCCRunner();
};
void TestCC::MaybePokeCC() {
// nsJSContext::MaybePokeCC
// In all tests so far, we will be running this just after a GC.
CCReason reason = mScheduler.ShouldScheduleCC(Now(), SuspectedCCObjects());
EXPECT_EQ(reason, CCReason::GC_FINISHED);
mScheduler.InitCCRunnerStateMachine(CCRunnerState::ReducePurple, reason);
EXPECT_TRUE(mScheduler.IsEarlyForgetSkippable());
}
void TestCC::TimerFires(int aNumSlices) {
// Series of CCRunner timer fires.
CCRunnerStep step;
while (true) {
SuspectMore(1000);
TimeStamp idleDeadline = Now() + kOneSecond;
step =
mScheduler.AdvanceCCRunner(idleDeadline, Now(), SuspectedCCObjects());
// Should first see a series of ForgetSkippable actions.
if (step.mAction != CCRunnerAction::ForgetSkippable ||
step.mParam.mRemoveChildless != KeepChildless) {
break;
}
EXPECT_EQ(step.mYield, Yield);
ForgetSkippable();
}
while (step.mYield == Continue) {
TimeStamp idleDeadline = Now() + kOneSecond;
step =
mScheduler.AdvanceCCRunner(idleDeadline, Now(), SuspectedCCObjects());
}
EXPECT_EQ(step.mAction, CCRunnerAction::ForgetSkippable);
EXPECT_EQ(step.mParam.mRemoveChildless, RemoveChildless);
ForgetSkippable();
TimeStamp idleDeadline = Now() + kOneSecond;
step = mScheduler.AdvanceCCRunner(idleDeadline, Now(), SuspectedCCObjects());
EXPECT_EQ(step.mAction, CCRunnerAction::CleanupContentUnbinder);
step = mScheduler.AdvanceCCRunner(idleDeadline, Now(), SuspectedCCObjects());
EXPECT_EQ(step.mAction, CCRunnerAction::CleanupDeferred);
mScheduler.NoteCCBegin(CCReason::API, Now(), 0, sSuspected, 0);
RunSlices(aNumSlices);
}
void TestCC::ForgetSkippable() {
uint32_t suspectedBefore = sSuspected;
// ...ForgetSkippable would happen here...
js::SliceBudget budget =
mScheduler.ComputeForgetSkippableBudget(Now(), Now() + kTenthSecond);
EXPECT_NEAR(budget.timeBudget(), kTenthSecond.ToMilliseconds(), 1);
AdvanceTime(kTenthSecond);
mScheduler.NoteForgetSkippableComplete(Now(), suspectedBefore,
SuspectedCCObjects());
}
void TestCC::RunSlices(int aNumSlices) {
TimeStamp ccStartTime = Now();
TimeStamp prevSliceEnd = ccStartTime;
for (int ccslice = 0; ccslice < aNumSlices; ccslice++) {
RunSlice(ccStartTime, prevSliceEnd, ccslice, aNumSlices);
prevSliceEnd = Now();
}
SetNumSuspected(0);
}
void TestCC::EndCycleCollectionCallback() {
// nsJSContext::EndCycleCollectionCallback
CycleCollectorResults results;
results.mFreedGCed = 10;
results.mFreedJSZones = 2;
mScheduler.NoteCCEnd(results, Now(), TimeDuration());
// Because > 0 zones were freed.
EXPECT_TRUE(mScheduler.NeedsGCAfterCC());
}
void TestCC::KillCCRunner() {
// nsJSContext::KillCCRunner
mScheduler.KillCCRunner();
}
class TestIdleCC : public TestCC {
public:
explicit TestIdleCC(CCGCScheduler& aScheduler) : TestCC(aScheduler) {}
void Prepare() override;
void RunSlice(TimeStamp aCCStartTime, TimeStamp aPrevSliceEnd, int aSliceNum,
int aNumSlices) override;
};
void TestIdleCC::Prepare() { EXPECT_TRUE(!mScheduler.InIncrementalGC()); }
void TestIdleCC::RunSlice(TimeStamp aCCStartTime, TimeStamp aPrevSliceEnd,
int aSliceNum, int aNumSlices) {
CCRunnerStep step;
TimeStamp idleDeadline = Now() + kTenthSecond;
// The scheduler should request a CycleCollect slice.
step = mScheduler.AdvanceCCRunner(idleDeadline, Now(), SuspectedCCObjects());
EXPECT_EQ(step.mAction, CCRunnerAction::CycleCollect);
// nsJSContext::RunCycleCollectorSlice
EXPECT_FALSE(mScheduler.InIncrementalGC());
bool preferShorter;
js::SliceBudget budget = mScheduler.ComputeCCSliceBudget(
idleDeadline, aCCStartTime, aPrevSliceEnd, Now(), &preferShorter);
// The scheduler will set the budget to our deadline (0.1sec in the future).
EXPECT_NEAR(budget.timeBudget(), kTenthSecond.ToMilliseconds(), 1);
EXPECT_FALSE(preferShorter);
AdvanceTime(kTenthSecond);
}
class TestNonIdleCC : public TestCC {
public:
explicit TestNonIdleCC(CCGCScheduler& aScheduler) : TestCC(aScheduler) {}
void Prepare() override;
void RunSlice(TimeStamp aCCStartTime, TimeStamp aPrevSliceEnd, int aSliceNum,
int aNumSlices) override;
};
void TestNonIdleCC::Prepare() {
EXPECT_TRUE(!mScheduler.InIncrementalGC());
// Advance time by an hour to give time for a user event in the past.
AdvanceTime(TimeDuration::FromSeconds(3600));
}
void TestNonIdleCC::RunSlice(TimeStamp aCCStartTime, TimeStamp aPrevSliceEnd,
int aSliceNum, int aNumSlices) {
CCRunnerStep step;
TimeStamp nullDeadline;
// The scheduler should tell us to run a slice of cycle collection.
step = mScheduler.AdvanceCCRunner(nullDeadline, Now(), SuspectedCCObjects());
EXPECT_EQ(step.mAction, CCRunnerAction::CycleCollect);
// nsJSContext::RunCycleCollectorSlice
EXPECT_FALSE(mScheduler.InIncrementalGC());
bool preferShorter;
js::SliceBudget budget = mScheduler.ComputeCCSliceBudget(
nullDeadline, aCCStartTime, aPrevSliceEnd, Now(), &preferShorter);
if (aSliceNum == 0) {
// First slice of the CC, so always use the baseBudget which is
// kICCSliceBudget (3ms) for a non-idle slice.
EXPECT_NEAR(budget.timeBudget(), kICCSliceBudget.ToMilliseconds(), 0.1);
} else if (aSliceNum == 1) {
// Second slice still uses the baseBudget, since not much time has passed
// so none of the lengthening mechanisms have kicked in yet.
EXPECT_NEAR(budget.timeBudget(), kICCSliceBudget.ToMilliseconds(), 0.1);
} else if (aSliceNum == 2) {
// We're not overrunning kMaxICCDuration, so we don't go unlimited.
EXPECT_FALSE(budget.isUnlimited());
// This slice is delayed by twice the allowed amount. Slice time should be
// doubled.
EXPECT_NEAR(budget.timeBudget(), kICCSliceBudget.ToMilliseconds() * 2, 0.1);
} else {
// We're not overrunning kMaxICCDuration, so we don't go unlimited.
EXPECT_FALSE(budget.isUnlimited());
// These slices are not delayed, but enough time has passed that the
// dominating factor is now the linear ramp up to max slice time at the
// halfway point to kMaxICCDuration.
EXPECT_TRUE(budget.timeBudget() > kICCSliceBudget.ToMilliseconds());
EXPECT_TRUE(budget.timeBudget() <=
MainThreadIdlePeriod::GetLongIdlePeriod());
}
EXPECT_TRUE(preferShorter); // Non-idle prefers shorter slices
AdvanceTime(TimeDuration::FromMilliseconds(budget.timeBudget()));
if (aSliceNum == 1) {
// Delay the third slice (only).
AdvanceTime(kICCIntersliceDelay * 2);
}
}
// Do a GC then CC then GC.
static bool BasicScenario(CCGCScheduler& aScheduler, TestGC* aTestGC,
TestCC* aTestCC) {
// Run a 10-slice incremental GC.
aTestGC->Run(10);
// After a GC, the scheduler should decide to do a full CC regardless of the
// number of purple buffer entries.
SetNumSuspected(3);
EXPECT_EQ(aScheduler.IsCCNeeded(Now(), SuspectedCCObjects()),
CCReason::GC_FINISHED);
// Now we should want to CC.
EXPECT_EQ(aScheduler.ShouldScheduleCC(Now(), SuspectedCCObjects()),
CCReason::GC_FINISHED);
// Do a 5-slice CC.
aTestCC->Run(5);
// Not enough suspected objects to deserve a CC.
EXPECT_EQ(aScheduler.IsCCNeeded(Now(), SuspectedCCObjects()),
CCReason::NO_REASON);
EXPECT_EQ(aScheduler.ShouldScheduleCC(Now(), SuspectedCCObjects()),
CCReason::NO_REASON);
SetNumSuspected(10000);
// We shouldn't want to CC again yet, it's too soon.
EXPECT_EQ(aScheduler.ShouldScheduleCC(Now(), SuspectedCCObjects()),
CCReason::NO_REASON);
AdvanceTime(mozilla::kCCDelay);
// *Now* it's time for another CC.
EXPECT_EQ(aScheduler.ShouldScheduleCC(Now(), SuspectedCCObjects()),
CCReason::MANY_SUSPECTED);
// Run a 3-slice incremental GC.
EXPECT_TRUE(!aScheduler.InIncrementalGC());
aTestGC->Run(3);
return true;
}
static CCGCScheduler scheduler;
static TestGC gc(scheduler);
static TestIdleCC ccIdle(scheduler);
static TestNonIdleCC ccNonIdle(scheduler);
TEST(TestScheduler, Idle)
{
// Cannot CC until we GC once.
EXPECT_EQ(scheduler.ShouldScheduleCC(Now(), SuspectedCCObjects()),
CCReason::NO_REASON);
EXPECT_TRUE(BasicScenario(scheduler, &gc, &ccIdle));
}
TEST(TestScheduler, NonIdle)
{ EXPECT_TRUE(BasicScenario(scheduler, &gc, &ccNonIdle)); }
|