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
|
// Copyright 2014 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "cc/base/delayed_unique_notifier.h"
#include <utility>
#include "base/containers/circular_deque.h"
#include "base/functional/bind.h"
#include "base/functional/callback_helpers.h"
#include "base/task/sequenced_task_runner.h"
#include "base/test/test_pending_task.h"
#include "base/test/test_simple_task_runner.h"
#include "base/time/time.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace cc {
namespace {
class TestNotifier : public DelayedUniqueNotifier {
public:
TestNotifier(base::SequencedTaskRunner* task_runner,
base::RepeatingClosure closure,
const base::TimeDelta& delay)
: DelayedUniqueNotifier(task_runner, std::move(closure), delay) {}
~TestNotifier() override = default;
// Overridden from DelayedUniqueNotifier:
base::TimeTicks Now() const override { return now_; }
void SetNow(base::TimeTicks now) { now_ = now; }
private:
base::TimeTicks now_;
};
class DelayedUniqueNotifierTest : public testing::Test {
public:
DelayedUniqueNotifierTest() : notification_count_(0) {}
void SetUp() override {
notification_count_ = 0;
task_runner_ = base::MakeRefCounted<base::TestSimpleTaskRunner>();
}
void Notify() { ++notification_count_; }
int NotificationCount() const { return notification_count_; }
base::circular_deque<base::TestPendingTask> TakePendingTasks() {
return task_runner_->TakePendingTasks();
}
protected:
int notification_count_;
scoped_refptr<base::TestSimpleTaskRunner> task_runner_;
};
TEST_F(DelayedUniqueNotifierTest, SmallDelay) {
base::TimeDelta delay = base::Microseconds(20);
TestNotifier notifier(task_runner_.get(),
base::BindRepeating(&DelayedUniqueNotifierTest::Notify,
base::Unretained(this)),
delay);
EXPECT_EQ(0, NotificationCount());
// Basic schedule for |delay| from now (now: 30, run time: 50).
base::TimeTicks schedule_time = base::TimeTicks() + base::Microseconds(30);
notifier.SetNow(schedule_time);
notifier.Schedule();
base::circular_deque<base::TestPendingTask> tasks = TakePendingTasks();
ASSERT_EQ(1u, tasks.size());
EXPECT_EQ(base::TimeTicks() + delay, tasks[0].GetTimeToRun());
// It's not yet time to run, so we expect no notifications.
std::move(tasks[0].task).Run();
EXPECT_EQ(0, NotificationCount());
tasks = TakePendingTasks();
ASSERT_EQ(1u, tasks.size());
// Now the time should be delay minus whatever the value of now happens to be
// (now: 30, run time: 50).
base::TimeTicks scheduled_run_time = notifier.Now() + delay;
base::TimeTicks scheduled_delay =
base::TimeTicks() + (scheduled_run_time - notifier.Now());
EXPECT_EQ(scheduled_delay, tasks[0].GetTimeToRun());
// Move closer to the run time (time: 49, run time: 50).
notifier.SetNow(notifier.Now() + base::Microseconds(19));
// It's not yet time to run, so we expect no notifications.
std::move(tasks[0].task).Run();
EXPECT_EQ(0, NotificationCount());
tasks = TakePendingTasks();
ASSERT_EQ(1u, tasks.size());
// Now the time should be delay minus whatever the value of now happens to be.
scheduled_delay = base::TimeTicks() + (scheduled_run_time - notifier.Now());
EXPECT_EQ(scheduled_delay, tasks[0].GetTimeToRun());
// Move to exactly the run time (time: 50, run time: 50).
notifier.SetNow(notifier.Now() + base::Microseconds(1));
// It's time to run!
std::move(tasks[0].task).Run();
EXPECT_EQ(1, NotificationCount());
tasks = TakePendingTasks();
EXPECT_EQ(0u, tasks.size());
}
TEST_F(DelayedUniqueNotifierTest, RescheduleDelay) {
base::TimeDelta delay = base::Microseconds(20);
TestNotifier notifier(task_runner_.get(),
base::BindRepeating(&DelayedUniqueNotifierTest::Notify,
base::Unretained(this)),
delay);
base::TimeTicks schedule_time;
// Move time 19 units forward and reschedule, expecting that we still need to
// run in |delay| time and we don't get a notification.
for (int i = 0; i < 10; ++i) {
EXPECT_EQ(0, NotificationCount());
// Move time forward 19 units.
schedule_time = notifier.Now() + base::Microseconds(19);
notifier.SetNow(schedule_time);
notifier.Schedule();
base::circular_deque<base::TestPendingTask> tasks = TakePendingTasks();
ASSERT_EQ(1u, tasks.size());
EXPECT_EQ(base::TimeTicks() + delay, tasks[0].GetTimeToRun());
// It's not yet time to run, so we expect no notifications.
std::move(tasks[0].task).Run();
EXPECT_EQ(0, NotificationCount());
}
// Move time forward 20 units, expecting a notification.
schedule_time = notifier.Now() + base::Microseconds(20);
notifier.SetNow(schedule_time);
base::circular_deque<base::TestPendingTask> tasks = TakePendingTasks();
ASSERT_EQ(1u, tasks.size());
EXPECT_EQ(base::TimeTicks() + delay, tasks[0].GetTimeToRun());
// Time to run!
std::move(tasks[0].task).Run();
EXPECT_EQ(1, NotificationCount());
}
TEST_F(DelayedUniqueNotifierTest, CancelAndHasPendingNotification) {
base::TimeDelta delay = base::Microseconds(20);
TestNotifier notifier(task_runner_.get(),
base::BindRepeating(&DelayedUniqueNotifierTest::Notify,
base::Unretained(this)),
delay);
EXPECT_EQ(0, NotificationCount());
// Schedule for |delay| seconds from now.
base::TimeTicks schedule_time = notifier.Now() + base::Microseconds(10);
notifier.SetNow(schedule_time);
notifier.Schedule();
EXPECT_TRUE(notifier.HasPendingNotification());
// Cancel the run.
notifier.Cancel();
EXPECT_FALSE(notifier.HasPendingNotification());
base::circular_deque<base::TestPendingTask> tasks = TakePendingTasks();
ASSERT_EQ(1u, tasks.size());
EXPECT_EQ(base::TimeTicks() + delay, tasks[0].GetTimeToRun());
// Time to run, but a canceled task!
std::move(tasks[0].task).Run();
EXPECT_EQ(0, NotificationCount());
EXPECT_FALSE(notifier.HasPendingNotification());
tasks = TakePendingTasks();
EXPECT_EQ(0u, tasks.size());
notifier.Schedule();
EXPECT_TRUE(notifier.HasPendingNotification());
tasks = TakePendingTasks();
ASSERT_EQ(1u, tasks.size());
EXPECT_EQ(base::TimeTicks() + delay, tasks[0].GetTimeToRun());
// Advance the time.
notifier.SetNow(notifier.Now() + delay);
// This should run since it wasn't canceled.
std::move(tasks[0].task).Run();
EXPECT_EQ(1, NotificationCount());
EXPECT_FALSE(notifier.HasPendingNotification());
for (int i = 0; i < 10; ++i) {
notifier.Schedule();
EXPECT_TRUE(notifier.HasPendingNotification());
notifier.Cancel();
EXPECT_FALSE(notifier.HasPendingNotification());
}
tasks = TakePendingTasks();
ASSERT_EQ(1u, tasks.size());
EXPECT_EQ(base::TimeTicks() + delay, tasks[0].GetTimeToRun());
// Time to run, but a canceled task!
notifier.SetNow(notifier.Now() + delay);
std::move(tasks[0].task).Run();
EXPECT_EQ(1, NotificationCount());
tasks = TakePendingTasks();
EXPECT_EQ(0u, tasks.size());
EXPECT_FALSE(notifier.HasPendingNotification());
}
TEST_F(DelayedUniqueNotifierTest, ShutdownWithScheduledTask) {
base::TimeDelta delay = base::Microseconds(20);
TestNotifier notifier(task_runner_.get(),
base::BindRepeating(&DelayedUniqueNotifierTest::Notify,
base::Unretained(this)),
delay);
EXPECT_EQ(0, NotificationCount());
// Schedule for |delay| seconds from now.
base::TimeTicks schedule_time = notifier.Now() + base::Microseconds(10);
notifier.SetNow(schedule_time);
notifier.Schedule();
EXPECT_TRUE(notifier.HasPendingNotification());
// Shutdown the notifier.
notifier.Shutdown();
// The task is still there, but...
base::circular_deque<base::TestPendingTask> tasks = TakePendingTasks();
ASSERT_EQ(1u, tasks.size());
// Running the task after shutdown does nothing since it's cancelled.
std::move(tasks[0].task).Run();
EXPECT_EQ(0, NotificationCount());
tasks = TakePendingTasks();
EXPECT_EQ(0u, tasks.size());
// We are no longer able to schedule tasks.
notifier.Schedule();
tasks = TakePendingTasks();
ASSERT_EQ(0u, tasks.size());
// Verify after the scheduled time happens there is still no task.
notifier.SetNow(notifier.Now() + delay);
tasks = TakePendingTasks();
ASSERT_EQ(0u, tasks.size());
}
TEST_F(DelayedUniqueNotifierTest, ShutdownPreventsSchedule) {
base::TimeDelta delay = base::Microseconds(20);
TestNotifier notifier(task_runner_.get(),
base::BindRepeating(&DelayedUniqueNotifierTest::Notify,
base::Unretained(this)),
delay);
EXPECT_EQ(0, NotificationCount());
// Schedule for |delay| seconds from now.
base::TimeTicks schedule_time = notifier.Now() + base::Microseconds(10);
notifier.SetNow(schedule_time);
// Shutdown the notifier.
notifier.Shutdown();
// Scheduling a task no longer does anything.
notifier.Schedule();
base::circular_deque<base::TestPendingTask> tasks = TakePendingTasks();
ASSERT_EQ(0u, tasks.size());
// Verify after the scheduled time happens there is still no task.
notifier.SetNow(notifier.Now() + delay);
tasks = TakePendingTasks();
ASSERT_EQ(0u, tasks.size());
}
} // namespace
} // namespace cc
|
