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
|
/**
* Copyright (C) 2019-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the Server Side Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#include "mongo/bson/bsonobj.h"
#include "mongo/db/s/persistent_task_queue.h"
#include "mongo/s/shard_server_test_fixture.h"
#include "mongo/stdx/thread.h"
#include "mongo/unittest/barrier.h"
#include "mongo/unittest/unittest.h"
namespace mongo {
namespace {
using PersistentTaskQueueTest = ShardServerTestFixture;
struct TestTask {
std::string key;
int val;
TestTask() : val(0) {}
TestTask(std::string key, int val) : key(std::move(key)), val(val) {}
TestTask(BSONObj bson)
: key(bson.getField("key").String()), val(bson.getField("value").Int()) {}
static TestTask parse(IDLParserErrorContext, BSONObj bson) {
return TestTask{bson};
}
void serialize(BSONObjBuilder& builder) const {
builder.append("key", key);
builder.append("value", val);
}
BSONObj toBSON() const {
BSONObjBuilder builder;
serialize(builder);
return builder.obj();
}
};
void killOps(ServiceContext* serviceCtx) {
ServiceContext::LockedClientsCursor cursor(serviceCtx);
for (Client* client = cursor.next(); client != nullptr; client = cursor.next()) {
stdx::lock_guard<Client> lk(*client);
if (client->isFromSystemConnection() && !client->shouldKillSystemOperation(lk))
continue;
OperationContext* toKill = client->getOperationContext();
if (toKill && !toKill->isKillPending())
serviceCtx->killOperation(lk, toKill, ErrorCodes::Interrupted);
}
}
// Test that writes to the queue persist across instantiations.
TEST_F(PersistentTaskQueueTest, TestWritesPersistInstances) {
NamespaceString nss("test.foo");
auto opCtx = operationContext();
{
PersistentTaskQueue<TestTask> q(opCtx, nss);
ASSERT_EQ(q.size(opCtx), 0UL);
ASSERT_TRUE(q.empty(opCtx));
q.push(opCtx, {"age", 5});
ASSERT_EQ(q.size(opCtx), 1UL);
ASSERT_EQ(q.peek(opCtx).task.key, "age");
ASSERT_EQ(q.peek(opCtx).task.val, 5);
ASSERT_FALSE(q.empty(opCtx));
}
{
PersistentTaskQueue<TestTask> q(opCtx, nss);
ASSERT_EQ(q.size(opCtx), 1UL);
ASSERT_EQ(q.peek(opCtx).task.key, "age");
ASSERT_EQ(q.peek(opCtx).task.val, 5);
ASSERT_FALSE(q.empty(opCtx));
q.pop(opCtx);
ASSERT_EQ(q.size(opCtx), 0UL);
ASSERT_TRUE(q.empty(opCtx));
}
{
PersistentTaskQueue<TestTask> q(opCtx, nss);
ASSERT_EQ(q.size(opCtx), 0UL);
ASSERT_TRUE(q.empty(opCtx));
}
}
// Test that the FIFO order of elements is preserved across instances.
TEST_F(PersistentTaskQueueTest, TestFIFOPreservedAcrossInstances) {
NamespaceString nss("test.foo");
auto opCtx = operationContext();
{
PersistentTaskQueue<TestTask> q(opCtx, nss);
ASSERT_EQ(q.size(opCtx), 0UL);
ASSERT_TRUE(q.empty(opCtx));
for (int i = 5; i < 9; ++i) {
q.push(opCtx, TestTask{"age", i});
}
ASSERT_EQ(q.size(opCtx), 4UL);
ASSERT_EQ(q.peek(opCtx).task.val, 5);
ASSERT_FALSE(q.empty(opCtx));
}
{
PersistentTaskQueue<TestTask> q(opCtx, nss);
ASSERT_EQ(q.size(opCtx), 4UL);
ASSERT_FALSE(q.empty(opCtx));
for (int i = 5; i < 9; ++i) {
ASSERT_EQ(q.size(opCtx), 9UL - i);
auto cur = q.peek(opCtx);
ASSERT_EQ(cur.task.key, "age");
ASSERT_EQ(cur.task.val, i);
ASSERT_EQ(cur.id, i - 4LL);
q.pop(opCtx);
}
ASSERT_EQ(q.size(opCtx), 0UL);
ASSERT_TRUE(q.empty(opCtx));
}
}
// Test that ids are sequential across intances when items are in db.
TEST_F(PersistentTaskQueueTest, TestIdIsContinueAcrossInstances) {
NamespaceString nss("test.foo");
auto opCtx = operationContext();
{
PersistentTaskQueue<TestTask> q(opCtx, nss);
ASSERT_EQ(q.size(opCtx), 0UL);
ASSERT_TRUE(q.empty(opCtx));
auto id = q.push(opCtx, {"age", 5});
ASSERT_EQ(id, 1LL);
auto cur = q.peek(opCtx);
ASSERT_EQ(q.size(opCtx), 1UL);
ASSERT_EQ(cur.task.key, "age");
ASSERT_EQ(cur.task.val, 5);
ASSERT_EQ(id, cur.id);
ASSERT_FALSE(q.empty(opCtx));
}
{
PersistentTaskQueue<TestTask> q(opCtx, nss);
ASSERT_EQ(q.size(opCtx), 1UL);
ASSERT_EQ(q.peek(opCtx).task.val, 5);
ASSERT_EQ(q.peek(opCtx).id, 1LL);
ASSERT_FALSE(q.empty(opCtx));
q.pop(opCtx);
ASSERT_EQ(q.size(opCtx), 0UL);
ASSERT_TRUE(q.empty(opCtx));
auto id = q.push(opCtx, {"age", 5});
ASSERT_EQ(id, 2LL);
auto cur = q.peek(opCtx);
ASSERT_EQ(q.size(opCtx), 1UL);
ASSERT_EQ(cur.task.key, "age");
ASSERT_EQ(cur.task.val, 5);
ASSERT_EQ(id, cur.id);
ASSERT_FALSE(q.empty(opCtx));
}
{
PersistentTaskQueue<TestTask> q(opCtx, nss);
ASSERT_EQ(q.size(opCtx), 1UL);
ASSERT_FALSE(q.empty(opCtx));
}
}
// Test interrupting blocking peek call before it starts waiting on the condition variable.
TEST_F(PersistentTaskQueueTest, TestInterruptedBeforeWaitingOnCV) {
NamespaceString nss("test.foo");
PersistentTaskQueue<TestTask> q(operationContext(), nss);
// Set interrupted state before waiting on condition variable.
q.close(operationContext());
// Assert that wakeup is not lost.
ASSERT_THROWS(q.peek(operationContext()), ExceptionFor<ErrorCodes::Interrupted>);
}
// Test wakeup from wait on empty queue.
TEST_F(PersistentTaskQueueTest, TestWakeupOnEmptyQueue) {
NamespaceString nss("test.foo");
auto opCtx = operationContext();
PersistentTaskQueue<TestTask> q(opCtx, nss);
auto result = stdx::async(stdx::launch::async, [&q] {
ThreadClient tc("RangeDeletionService", getGlobalServiceContext());
auto opCtx = tc->makeOperationContext();
stdx::this_thread::sleep_for(stdx::chrono::milliseconds(500));
q.push(opCtx.get(), {"age", 5});
});
ASSERT_EQ(q.peek(opCtx).task.val, 5);
ASSERT_EQ(q.size(opCtx), 1UL);
ASSERT_FALSE(q.empty(opCtx));
}
// Test interrupting blocking peek call after it starts waiting on the condition variable.
TEST_F(PersistentTaskQueueTest, TestInterruptedWhileWaitingOnCV) {
NamespaceString nss("test.foo");
PersistentTaskQueue<TestTask> q(operationContext(), nss);
auto opCtx = operationContext();
unittest::Barrier barrier(2);
auto result = stdx::async(stdx::launch::async, [opCtx, &q, &barrier] {
ThreadClient tc("RangeDeletionService", getGlobalServiceContext());
auto opCtx = tc->makeOperationContext();
barrier.countDownAndWait();
q.peek(opCtx.get());
});
// Sleeps a little to make sure the thread calling peek has a chance to reach the condition
// variable.
barrier.countDownAndWait();
stdx::this_thread::sleep_for(stdx::chrono::milliseconds(100));
q.close(opCtx);
ASSERT_THROWS(result.get(), ExceptionFor<ErrorCodes::Interrupted>);
}
// Test that waiting on the condition variable is interrupted when the operation context is killed.
TEST_F(PersistentTaskQueueTest, TestKilledOperationContextWhileWaitingOnCV) {
NamespaceString nss("test.foo");
PersistentTaskQueue<TestTask> q(operationContext(), nss);
auto opCtx = operationContext();
unittest::Barrier barrier(2);
auto result = stdx::async(stdx::launch::async, [opCtx, &q, &barrier] {
ThreadClient tc("RangeDeletionService", getGlobalServiceContext());
{
stdx::lock_guard<Client> lk(*tc.get());
tc->setSystemOperationKillable(lk);
}
auto opCtx = tc->makeOperationContext();
barrier.countDownAndWait();
q.peek(opCtx.get());
});
// Sleeps a little to make sure the thread calling peek has a chance to reach the condition
// variable.
barrier.countDownAndWait();
stdx::this_thread::sleep_for(stdx::chrono::milliseconds(100));
killOps(getServiceContext());
ASSERT_THROWS(result.get(), ExceptionFor<ErrorCodes::Interrupted>);
}
// Test that pop throws if peek is not called.
TEST_F(PersistentTaskQueueTest, TestPopThrowsIfPeekNotCalled) {
NamespaceString nss("test.foo");
PersistentTaskQueue<TestTask> q(operationContext(), nss);
ASSERT_THROWS(q.pop(operationContext()), std::exception);
}
} // namespace
} // namespace mongo
|