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
|
// Copyright 2014 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/sync/model_impl/attachments/task_queue.h"
#include <vector>
#include "base/memory/ptr_util.h"
#include "base/message_loop/message_loop.h"
#include "base/run_loop.h"
#include "base/timer/mock_timer.h"
#include "testing/gtest/include/gtest/gtest.h"
using base::TimeDelta;
namespace syncer {
namespace {
const TimeDelta kZero;
} // namespace
class TaskQueueTest : public testing::Test {
protected:
TaskQueueTest() : weak_ptr_factory_(this) {
queue_ = base::MakeUnique<TaskQueue<int>>(
base::Bind(&TaskQueueTest::Process, weak_ptr_factory_.GetWeakPtr()),
TimeDelta::FromMinutes(1), TimeDelta::FromMinutes(8));
}
void RunLoop() {
base::RunLoop run_loop;
run_loop.RunUntilIdle();
}
void Process(const int& task) { dispatched_.push_back(task); }
base::MessageLoop message_loop_;
std::unique_ptr<TaskQueue<int>> queue_;
std::vector<int> dispatched_;
base::WeakPtrFactory<TaskQueueTest> weak_ptr_factory_;
};
// See that at most one task is dispatched at a time.
TEST_F(TaskQueueTest, AddToQueue_NoConcurrentTasks) {
queue_->AddToQueue(1);
queue_->AddToQueue(2);
RunLoop();
// Only one has been dispatched.
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(1, dispatched_.front());
RunLoop();
// Still only one.
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(1, dispatched_.front());
dispatched_.clear();
queue_->MarkAsSucceeded(1);
RunLoop();
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(2, dispatched_.front());
dispatched_.clear();
queue_->MarkAsSucceeded(2);
RunLoop();
ASSERT_TRUE(dispatched_.empty());
}
// See that that the queue ignores duplicate adds.
TEST_F(TaskQueueTest, AddToQueue_NoDuplicates) {
queue_->AddToQueue(1);
queue_->AddToQueue(1);
queue_->AddToQueue(2);
queue_->AddToQueue(1);
ASSERT_TRUE(dispatched_.empty());
RunLoop();
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(1, dispatched_.front());
dispatched_.clear();
queue_->MarkAsSucceeded(1);
RunLoop();
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(2, dispatched_.front());
dispatched_.clear();
queue_->MarkAsSucceeded(2);
RunLoop();
ASSERT_TRUE(dispatched_.empty());
}
// See that Retry works as expected.
TEST_F(TaskQueueTest, Retry) {
std::unique_ptr<base::MockTimer> timer_to_pass(
new base::MockTimer(false, false));
base::MockTimer* mock_timer = timer_to_pass.get();
queue_->SetTimerForTest(std::move(timer_to_pass));
// 1st attempt.
queue_->AddToQueue(1);
ASSERT_TRUE(mock_timer->IsRunning());
ASSERT_EQ(kZero, mock_timer->GetCurrentDelay());
TimeDelta last_delay = mock_timer->GetCurrentDelay();
mock_timer->Fire();
RunLoop();
// 2nd attempt.
ASSERT_FALSE(mock_timer->IsRunning());
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(1, dispatched_.front());
dispatched_.clear();
queue_->MarkAsFailed(1);
queue_->AddToQueue(1);
ASSERT_TRUE(mock_timer->IsRunning());
EXPECT_GT(mock_timer->GetCurrentDelay(), last_delay);
EXPECT_LE(mock_timer->GetCurrentDelay(), TimeDelta::FromMinutes(1));
last_delay = mock_timer->GetCurrentDelay();
mock_timer->Fire();
RunLoop();
// 3rd attempt.
ASSERT_FALSE(mock_timer->IsRunning());
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(1, dispatched_.front());
dispatched_.clear();
queue_->MarkAsFailed(1);
queue_->AddToQueue(1);
ASSERT_TRUE(mock_timer->IsRunning());
EXPECT_GT(mock_timer->GetCurrentDelay(), last_delay);
last_delay = mock_timer->GetCurrentDelay();
mock_timer->Fire();
RunLoop();
// Give up.
ASSERT_FALSE(mock_timer->IsRunning());
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(1, dispatched_.front());
dispatched_.clear();
queue_->Cancel(1);
ASSERT_FALSE(mock_timer->IsRunning());
// Try a different task. See the timer remains unchanged because the previous
// task was cancelled.
ASSERT_TRUE(dispatched_.empty());
queue_->AddToQueue(2);
ASSERT_TRUE(mock_timer->IsRunning());
EXPECT_GE(last_delay, mock_timer->GetCurrentDelay());
last_delay = mock_timer->GetCurrentDelay();
mock_timer->Fire();
RunLoop();
// Mark this one as succeeding, which will clear the backoff delay.
ASSERT_FALSE(mock_timer->IsRunning());
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(2, dispatched_.front());
dispatched_.clear();
queue_->MarkAsSucceeded(2);
ASSERT_FALSE(mock_timer->IsRunning());
// Add one last task and see that it's dispatched without delay because the
// previous one succeeded.
ASSERT_TRUE(dispatched_.empty());
queue_->AddToQueue(3);
ASSERT_TRUE(mock_timer->IsRunning());
EXPECT_LT(mock_timer->GetCurrentDelay(), last_delay);
last_delay = mock_timer->GetCurrentDelay();
mock_timer->Fire();
RunLoop();
// Clean up.
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(3, dispatched_.front());
dispatched_.clear();
queue_->MarkAsSucceeded(3);
ASSERT_FALSE(mock_timer->IsRunning());
}
TEST_F(TaskQueueTest, Cancel) {
queue_->AddToQueue(1);
RunLoop();
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(1, dispatched_.front());
dispatched_.clear();
queue_->Cancel(1);
RunLoop();
ASSERT_TRUE(dispatched_.empty());
}
// See that ResetBackoff resets the backoff delay.
TEST_F(TaskQueueTest, ResetBackoff) {
std::unique_ptr<base::MockTimer> timer_to_pass(
new base::MockTimer(false, false));
base::MockTimer* mock_timer = timer_to_pass.get();
queue_->SetTimerForTest(std::move(timer_to_pass));
// Add an item, mark it as failed, re-add it and see that we now have a
// backoff delay.
queue_->AddToQueue(1);
ASSERT_TRUE(mock_timer->IsRunning());
ASSERT_EQ(kZero, mock_timer->GetCurrentDelay());
mock_timer->Fire();
RunLoop();
ASSERT_FALSE(mock_timer->IsRunning());
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(1, dispatched_.front());
dispatched_.clear();
queue_->MarkAsFailed(1);
queue_->AddToQueue(1);
ASSERT_TRUE(mock_timer->IsRunning());
EXPECT_GT(mock_timer->GetCurrentDelay(), kZero);
EXPECT_LE(mock_timer->GetCurrentDelay(), TimeDelta::FromMinutes(1));
// Call ResetBackoff and see that there is no longer a delay.
queue_->ResetBackoff();
ASSERT_TRUE(mock_timer->IsRunning());
ASSERT_EQ(kZero, mock_timer->GetCurrentDelay());
mock_timer->Fire();
RunLoop();
ASSERT_FALSE(mock_timer->IsRunning());
ASSERT_EQ(1U, dispatched_.size());
EXPECT_EQ(1, dispatched_.front());
dispatched_.clear();
queue_->MarkAsSucceeded(1);
}
} // namespace syncer
|
