forked from chromium/chromium
-
Notifications
You must be signed in to change notification settings - Fork 0
/
drive_operation_queue_unittest.cc
300 lines (230 loc) · 9.65 KB
/
drive_operation_queue_unittest.cc
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
// Copyright 2018 The Chromium 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 "components/drive/chromeos/drive_operation_queue.h"
#include "base/bind.h"
#include "base/memory/weak_ptr.h"
#include "base/test/bind_test_util.h"
#include "base/test/test_mock_time_task_runner.h"
#include "components/drive/file_errors.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace drive {
namespace internal {
namespace {
constexpr int kDesiredQPS = 5;
constexpr base::TimeDelta kTokenRefreshRate =
base::TimeDelta::FromSeconds(1) / kDesiredQPS;
class FakeDriveOperation {
public:
FakeDriveOperation() : weak_ptr_factory_(this) {}
base::WeakPtr<FakeDriveOperation> GetWeakPtr() {
return weak_ptr_factory_.GetWeakPtr();
}
void FakeOperation(const FileOperationCallback& callback) {
DCHECK_CALLED_ON_VALID_SEQUENCE(sequence_checker_);
CHECK(!task_has_executed);
task_has_executed = true;
callback.Run(FILE_ERROR_OK);
}
bool HasTaskExecuted() const { return task_has_executed; }
private:
bool task_has_executed = false;
SEQUENCE_CHECKER(sequence_checker_);
base::WeakPtrFactory<FakeDriveOperation> weak_ptr_factory_;
DISALLOW_COPY_AND_ASSIGN(FakeDriveOperation);
};
} // namespace
class DriveOperationQueueTest : public testing::Test {
protected:
using OperationQueue = DriveBackgroundOperationQueue<FakeDriveOperation>;
void SetUp() override {
task_runner_ = base::MakeRefCounted<base::TestMockTimeTaskRunner>(
base::TestMockTimeTaskRunner::Type::kBoundToThread);
operation_queue_ =
std::make_unique<DriveBackgroundOperationQueue<FakeDriveOperation>>(
kDesiredQPS, task_runner_->GetMockTickClock());
}
scoped_refptr<base::TestMockTimeTaskRunner> task_runner_;
std::unique_ptr<OperationQueue> operation_queue_;
};
// Put up to |kDesiredQPS| entries in queue, all should run without the timer
// needing to advance.
TEST_F(DriveOperationQueueTest, BurstMode) {
std::vector<std::unique_ptr<FakeDriveOperation>> operations;
for (int i = 0; i < kDesiredQPS; ++i) {
operations.emplace_back(std::make_unique<FakeDriveOperation>());
}
int callbacks_run = 0;
for (auto& operation : operations) {
operation_queue_->AddOperation(
operation->GetWeakPtr(),
base::BindOnce(&FakeDriveOperation::FakeOperation,
operation->GetWeakPtr()),
base::BindLambdaForTesting(
[&callbacks_run](drive::FileError error) { ++callbacks_run; }));
}
// Execute all pending tasks without advancing virtual time.
task_runner_->RunUntilIdle();
ASSERT_EQ(callbacks_run, kDesiredQPS);
for (auto& operation : operations) {
ASSERT_TRUE(operation->HasTaskExecuted());
}
}
// Ensure that tokens are refilled as the timer advances.
TEST_F(DriveOperationQueueTest, RefillTokens) {
constexpr int kAdditionalTasks = 5;
constexpr int kTasksToQueue = kDesiredQPS + kAdditionalTasks;
std::vector<std::unique_ptr<FakeDriveOperation>> operations;
for (int i = 0; i < kTasksToQueue; ++i) {
operations.emplace_back(std::make_unique<FakeDriveOperation>());
}
int callbacks_run = 0;
for (int i = 0; i < kTasksToQueue; ++i) {
operation_queue_->AddOperation(
operations[i]->GetWeakPtr(),
base::BindOnce(&FakeDriveOperation::FakeOperation,
operations[i]->GetWeakPtr()),
base::BindLambdaForTesting(
[&callbacks_run](drive::FileError) { ++callbacks_run; }));
}
// Execute all pending tasks without advancing virtual time.
task_runner_->RunUntilIdle();
// We should only have advanced through the burst mode tasks.
ASSERT_EQ(callbacks_run, kDesiredQPS);
// Move time forward, should cause a token to be refreshed and an operation to
// run.
int last_callbacks_run = callbacks_run;
for (int i = kDesiredQPS; i < kTasksToQueue; ++i) {
ASSERT_FALSE(operations[i]->HasTaskExecuted());
task_runner_->FastForwardBy(kTokenRefreshRate);
ASSERT_EQ(callbacks_run, last_callbacks_run + 1);
ASSERT_TRUE(operations[i]->HasTaskExecuted());
last_callbacks_run = callbacks_run;
}
ASSERT_EQ(kTasksToQueue, callbacks_run);
}
// Ensure that invalidated tasks are not run, but also do not block the queue.
TEST_F(DriveOperationQueueTest, InvalidateTasks) {
constexpr int kTasksToInvalidate = kDesiredQPS * 2;
constexpr int kAdditionalTasks = 5;
constexpr int kTasksToQueue =
kDesiredQPS + kAdditionalTasks + kTasksToInvalidate;
std::vector<std::unique_ptr<FakeDriveOperation>> operations;
for (int i = 0; i < kTasksToQueue; ++i) {
operations.emplace_back(std::make_unique<FakeDriveOperation>());
}
int callbacks_run = 0;
for (int i = 0; i < kTasksToQueue; ++i) {
operation_queue_->AddOperation(
operations[i]->GetWeakPtr(),
base::BindOnce(&FakeDriveOperation::FakeOperation,
operations[i]->GetWeakPtr()),
base::BindLambdaForTesting(
[&callbacks_run](drive::FileError) { ++callbacks_run; }));
}
// Execute all pending tasks without advancing virtual time.
task_runner_->RunUntilIdle();
// We should only have advanced through the burst mode tasks.
ASSERT_EQ(callbacks_run, kDesiredQPS);
// Erase tasks from the queue, which will invalidate their weak ptrs and
// prevent callbacks from being run.
operations.erase(operations.begin(),
operations.begin() + callbacks_run + kTasksToInvalidate);
// Fast forward until all tasks have been executed.
int last_callbacks_run = callbacks_run;
task_runner_->FastForwardUntilNoTasksRemain();
// All expected tasks should now have been run.
ASSERT_EQ(last_callbacks_run + kAdditionalTasks, callbacks_run);
}
// Ensure that tasks added after burst mode has finished are only executed
// at the desired QPS.
TEST_F(DriveOperationQueueTest, DoNotRepeatBurstMode) {
constexpr int kTasksToCreate = kDesiredQPS * 2;
std::vector<std::unique_ptr<FakeDriveOperation>> operations;
for (int i = 0; i < kTasksToCreate; ++i) {
operations.emplace_back(std::make_unique<FakeDriveOperation>());
}
int callbacks_run = 0;
// Only run the burst mode tasks.
for (int i = 0; i < kDesiredQPS; ++i) {
operation_queue_->AddOperation(
operations[i]->GetWeakPtr(),
base::BindOnce(&FakeDriveOperation::FakeOperation,
operations[i]->GetWeakPtr()),
base::BindLambdaForTesting(
[&callbacks_run](drive::FileError error) { ++callbacks_run; }));
}
// Execute all pending tasks without advancing virtual time.
task_runner_->FastForwardBy(kTokenRefreshRate);
ASSERT_EQ(callbacks_run, kDesiredQPS);
// Add the remaining tasks to the queue, only the first should run as we've
// only advanced 1 refresh period.
for (int i = kDesiredQPS; i < kTasksToCreate; ++i) {
operation_queue_->AddOperation(
operations[i]->GetWeakPtr(),
base::BindOnce(&FakeDriveOperation::FakeOperation,
operations[i]->GetWeakPtr()),
base::BindLambdaForTesting(
[&callbacks_run](drive::FileError error) { ++callbacks_run; }));
}
int last_callbacks_run = callbacks_run;
// Just run the tasks that are scheduled now.
task_runner_->RunUntilIdle();
ASSERT_EQ(last_callbacks_run + 1, callbacks_run);
// Run the rest of the tasks.
task_runner_->FastForwardUntilNoTasksRemain();
ASSERT_EQ(kTasksToCreate, callbacks_run);
}
// Ensure that burst mode is re-enabled if more than 1 second has advanced since
// the last task finished.
TEST_F(DriveOperationQueueTest, RepeatBurstMode) {
constexpr int kTasksToCreate = kDesiredQPS * 3;
std::vector<std::unique_ptr<FakeDriveOperation>> operations;
for (int i = 0; i < kTasksToCreate; ++i) {
operations.emplace_back(std::make_unique<FakeDriveOperation>());
}
int callbacks_run = 0;
// Only run the burst mode tasks.
for (int i = 0; i < kDesiredQPS; ++i) {
operation_queue_->AddOperation(
operations[i]->GetWeakPtr(),
base::BindOnce(&FakeDriveOperation::FakeOperation,
operations[i]->GetWeakPtr()),
base::BindLambdaForTesting(
[&callbacks_run](drive::FileError error) { ++callbacks_run; }));
}
// Execute all pending tasks.
task_runner_->FastForwardUntilNoTasksRemain();
ASSERT_EQ(kDesiredQPS, callbacks_run);
// Move forward two seconds, so that we should reset burst mode.
task_runner_->FastForwardBy(base::TimeDelta::FromSeconds(2));
// Add the remaining tasks to the queue, all should run in burst mode.
for (int i = kDesiredQPS; i < kTasksToCreate; ++i) {
operation_queue_->AddOperation(
operations[i]->GetWeakPtr(),
base::BindOnce(&FakeDriveOperation::FakeOperation,
operations[i]->GetWeakPtr()),
base::BindLambdaForTesting(
[&callbacks_run](drive::FileError error) { ++callbacks_run; }));
}
callbacks_run = 0;
// Execute all pending tasks without advancing virtual time.
task_runner_->RunUntilIdle();
// We should only have advanced through the burst mode tasks.
ASSERT_EQ(kDesiredQPS, callbacks_run);
// The last tasks should not have been run yet.
for (int i = 2 * kDesiredQPS; i < kTasksToCreate; ++i) {
ASSERT_FALSE(operations[i]->HasTaskExecuted());
}
// Run the remaining tasks, which should happen at desired qps
base::TimeTicks start_ticks = task_runner_->NowTicks();
task_runner_->FastForwardUntilNoTasksRemain();
ASSERT_LE(base::TimeDelta::FromSeconds(1),
task_runner_->NowTicks() - start_ticks);
// All tasks have been run.
for (auto& operation : operations) {
ASSERT_TRUE(operation->HasTaskExecuted());
}
}
} // namespace internal
} // namespace drive