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
|
// Copyright 2017 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/policy/core/common/policy_scheduler.h"
#include <memory>
#include "base/functional/bind.h"
#include "base/run_loop.h"
#include "base/task/single_thread_task_runner.h"
#include "base/test/task_environment.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace policy {
class PolicySchedulerTest : public testing::Test {
public:
void DoTask(PolicyScheduler::TaskCallback callback) {
do_counter_++;
base::SingleThreadTaskRunner::GetCurrentDefault()->PostTask(
FROM_HERE, base::BindOnce(std::move(callback), true));
}
void OnTaskDone(bool success) {
done_counter_++;
// Terminate PolicyScheduler after 5 iterations.
if (done_counter_ >= 5) {
base::SingleThreadTaskRunner::GetCurrentDefault()->PostTask(
FROM_HERE, base::BindOnce(&PolicySchedulerTest::Terminate,
base::Unretained(this)));
}
}
// To simulate a slow task the callback is captured instead of running it.
void CaptureCallbackForSlowTask(PolicyScheduler::TaskCallback callback) {
do_counter_++;
slow_callback_ = std::move(callback);
}
// Runs the captured callback to simulate the end of the slow task.
void PostSlowTaskCallback() {
base::SingleThreadTaskRunner::GetCurrentDefault()->PostTask(
FROM_HERE, base::BindOnce(std::move(slow_callback_), true));
}
void Terminate() { scheduler_.reset(); }
protected:
int do_counter_ = 0;
int done_counter_ = 0;
std::unique_ptr<PolicyScheduler> scheduler_;
PolicyScheduler::TaskCallback slow_callback_;
base::test::TaskEnvironment task_environment_;
};
TEST_F(PolicySchedulerTest, Run) {
scheduler_ = std::make_unique<PolicyScheduler>(
base::BindRepeating(&PolicySchedulerTest::DoTask, base::Unretained(this)),
base::BindRepeating(&PolicySchedulerTest::OnTaskDone,
base::Unretained(this)),
base::TimeDelta::Max());
base::RunLoop().RunUntilIdle();
EXPECT_EQ(1, done_counter_);
}
TEST_F(PolicySchedulerTest, Loop) {
scheduler_ = std::make_unique<PolicyScheduler>(
base::BindRepeating(&PolicySchedulerTest::DoTask, base::Unretained(this)),
base::BindRepeating(&PolicySchedulerTest::OnTaskDone,
base::Unretained(this)),
base::TimeDelta());
base::RunLoop().RunUntilIdle();
EXPECT_EQ(5, done_counter_);
}
TEST_F(PolicySchedulerTest, Reschedule) {
scheduler_ = std::make_unique<PolicyScheduler>(
base::BindRepeating(&PolicySchedulerTest::DoTask, base::Unretained(this)),
base::BindRepeating(&PolicySchedulerTest::OnTaskDone,
base::Unretained(this)),
base::TimeDelta::Max());
base::RunLoop().RunUntilIdle();
EXPECT_EQ(1, done_counter_);
// Delayed action is not run.
base::RunLoop().RunUntilIdle();
EXPECT_EQ(1, done_counter_);
// Rescheduling with 0 delay causes it to run.
scheduler_->ScheduleTaskNow();
base::RunLoop().RunUntilIdle();
EXPECT_EQ(2, done_counter_);
}
TEST_F(PolicySchedulerTest, OverlappingTasks) {
scheduler_ = std::make_unique<PolicyScheduler>(
base::BindRepeating(&PolicySchedulerTest::CaptureCallbackForSlowTask,
base::Unretained(this)),
base::BindRepeating(&PolicySchedulerTest::OnTaskDone,
base::Unretained(this)),
base::TimeDelta::Max());
base::RunLoop().RunUntilIdle();
EXPECT_EQ(1, do_counter_);
EXPECT_EQ(0, done_counter_);
// Second action doesn't start while first is still pending.
scheduler_->ScheduleTaskNow();
base::RunLoop().RunUntilIdle();
EXPECT_EQ(1, do_counter_);
EXPECT_EQ(0, done_counter_);
// After first action has finished, the second is started.
PostSlowTaskCallback();
base::RunLoop().RunUntilIdle();
EXPECT_EQ(2, do_counter_);
EXPECT_EQ(1, done_counter_);
// Let the second action finish.
PostSlowTaskCallback();
base::RunLoop().RunUntilIdle();
EXPECT_EQ(2, do_counter_);
EXPECT_EQ(2, done_counter_);
}
} // namespace policy
|
