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
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
|
/**
* Copyright (C) 2020-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/platform/basic.h"
#include "mongo/db/db_raii.h"
#include "mongo/db/dbdirectclient.h"
#include "mongo/db/s/collection_sharding_runtime.h"
#include "mongo/db/s/metadata_manager.h"
#include "mongo/db/s/persistent_task_store.h"
#include "mongo/db/s/range_deletion_task_gen.h"
#include "mongo/db/s/range_deletion_util.h"
#include "mongo/db/s/sharding_runtime_d_params_gen.h"
#include "mongo/db/s/wait_for_majority_service.h"
#include "mongo/s/shard_server_test_fixture.h"
#include "mongo/unittest/death_test.h"
#include "mongo/unittest/unittest.h"
#include "mongo/util/fail_point.h"
namespace mongo {
namespace {
const NamespaceString kNss = NamespaceString("foo", "bar");
const std::string kShardKey = "_id";
const BSONObj kShardKeyPattern = BSON(kShardKey << 1);
class RangeDeleterTest : public ShardServerTestFixture {
public:
// Needed because UUID default constructor is private
RangeDeleterTest() : _uuid(UUID::gen()) {}
void setUp() override {
ShardServerTestFixture::setUp();
WaitForMajorityService::get(getServiceContext()).setUp(getServiceContext());
// Set up replication coordinator to be primary and have no replication delay.
auto replCoord = std::make_unique<repl::ReplicationCoordinatorMock>(getServiceContext());
replCoord->setCanAcceptNonLocalWrites(true);
std::ignore = replCoord->setFollowerMode(repl::MemberState::RS_PRIMARY);
// Make waitForWriteConcern return immediately.
replCoord->setAwaitReplicationReturnValueFunction([this](OperationContext* opCtx,
const repl::OpTime& opTime) {
return repl::ReplicationCoordinator::StatusAndDuration(Status::OK(), Milliseconds(0));
});
repl::ReplicationCoordinator::set(getServiceContext(), std::move(replCoord));
DBDirectClient client(operationContext());
client.createCollection(kNss.ns());
AutoGetCollection autoColl(operationContext(), kNss, MODE_IX);
_uuid = autoColl.getCollection()->uuid();
}
void tearDown() override {
DBDirectClient client(operationContext());
client.dropCollection(kNss.ns());
WaitForMajorityService::get(getServiceContext()).shutDown();
ShardServerTestFixture::tearDown();
}
void setFilteringMetadataWithUUID(const UUID& uuid) {
const OID epoch = OID::gen();
auto rt = RoutingTableHistory::makeNew(
kNss,
uuid,
kShardKeyPattern,
nullptr,
false,
epoch,
{ChunkType{kNss,
ChunkRange{BSON(kShardKey << MINKEY), BSON(kShardKey << MAXKEY)},
ChunkVersion(1, 0, epoch),
ShardId("dummyShardId")}});
std::shared_ptr<ChunkManager> cm = std::make_shared<ChunkManager>(rt, boost::none);
Lock::CollectionLock collLock(operationContext(), kNss, MODE_IX);
CollectionShardingRuntime::get(operationContext(), kNss)
->setFilteringMetadata(operationContext(),
CollectionMetadata(cm, ShardId("dummyShardId")));
}
UUID uuid() const {
return _uuid;
}
private:
UUID _uuid;
};
// Helper function to count number of documents in config.rangeDeletions.
int countDocsInConfigRangeDeletions(PersistentTaskStore<RangeDeletionTask>& store,
OperationContext* opCtx) {
auto numDocsInRangeDeletionsCollection = 0;
store.forEach(opCtx, BSONObj(), [&](const RangeDeletionTask&) {
++numDocsInRangeDeletionsCollection;
return true;
});
return numDocsInRangeDeletionsCollection;
};
TEST_F(RangeDeleterTest,
RemoveDocumentsInRangeRemovesAllDocumentsInRangeWhenAllDocumentsFitInSingleBatch) {
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
const int numDocsToRemovePerBatch = 10;
auto queriesComplete = SemiFuture<void>::makeReady();
DBDirectClient dbclient(operationContext());
dbclient.insert(kNss.toString(), BSON(kShardKey << 5));
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
numDocsToRemovePerBatch,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete*/,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), 0);
}
TEST_F(RangeDeleterTest,
RemoveDocumentsInRangeRemovesAllDocumentsInRangeWhenSeveralBatchesAreRequired) {
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
// More documents than the batch size.
const auto numDocsToInsert = 3;
const auto numDocsToRemovePerBatch = 1;
auto queriesComplete = SemiFuture<void>::makeReady();
// Insert documents in range.
DBDirectClient dbclient(operationContext());
for (auto i = 0; i < numDocsToInsert; ++i) {
dbclient.insert(kNss.toString(), BSON(kShardKey << i));
}
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
numDocsToRemovePerBatch,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete*/,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), 0);
}
TEST_F(RangeDeleterTest, RemoveDocumentsInRangeInsertsDocumentToNotifySecondariesOfRangeDeletion) {
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
const int numDocsToRemovePerBatch = 10;
auto queriesComplete = SemiFuture<void>::makeReady();
DBDirectClient dbclient(operationContext());
dbclient.insert(kNss.toString(), BSON(kShardKey << 5));
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
numDocsToRemovePerBatch,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete*/,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(NamespaceString::kServerConfigurationNamespace,
BSON(kShardKey << "startRangeDeletion")),
1);
}
TEST_F(
RangeDeleterTest,
RemoveDocumentsInRangeOnlyInsertsStartRangeDeletionDocumentOnceWhenSeveralBatchesAreRequired) {
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
// More documents than the batch size.
const auto numDocsToInsert = 3;
const auto numDocsToRemovePerBatch = 1;
auto queriesComplete = SemiFuture<void>::makeReady();
// Insert documents in range.
DBDirectClient dbclient(operationContext());
for (auto i = 0; i < numDocsToInsert; ++i) {
dbclient.insert(kNss.toString(), BSON(kShardKey << i));
}
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
numDocsToRemovePerBatch,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete*/,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(NamespaceString::kServerConfigurationNamespace,
BSON(kShardKey << "startRangeDeletion")),
1);
}
TEST_F(RangeDeleterTest,
RemoveDocumentsInRangeDoesNotRemoveDocumentsWithKeysLowerThanMinKeyOfRange) {
const auto numDocsToInsert = 3;
const auto minKey = 0;
const auto range = ChunkRange(BSON(kShardKey << minKey), BSON(kShardKey << 10));
auto queriesComplete = SemiFuture<void>::makeReady();
DBDirectClient dbclient(operationContext());
// All documents below the range.
for (auto i = minKey - numDocsToInsert; i < minKey; ++i) {
dbclient.insert(kNss.toString(), BSON(kShardKey << i));
}
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
1 /* numDocsToRemovePerBatch */,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete*/,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
// No documents should have been deleted.
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), numDocsToInsert);
}
TEST_F(RangeDeleterTest,
RemoveDocumentsInRangeDoesNotRemoveDocumentsWithKeysGreaterThanOrEqualToMaxKeyOfRange) {
const auto numDocsToInsert = 3;
const auto maxKey = 10;
const auto range = ChunkRange(BSON(kShardKey << 0), BSON(kShardKey << maxKey));
auto queriesComplete = SemiFuture<void>::makeReady();
DBDirectClient dbclient(operationContext());
// All documents greater than or equal to the range.
for (auto i = maxKey; i < maxKey + numDocsToInsert; ++i) {
dbclient.insert(kNss.toString(), BSON(kShardKey << i));
}
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
1 /* numDocsToRemovePerBatch */,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete*/,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
// No documents should have been deleted.
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), numDocsToInsert);
}
TEST_F(RangeDeleterTest,
RemoveDocumentsInRangeDoesNotRemoveDocumentsForCollectionWithSameNamespaceAndDifferentUUID) {
const auto numDocsToInsert = 3;
DBDirectClient dbclient(operationContext());
for (auto i = 0; i < numDocsToInsert; ++i) {
dbclient.insert(kNss.toString(), BSON(kShardKey << i));
}
auto queriesComplete = SemiFuture<void>::makeReady();
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
// Use a different UUID from the collection UUID.
UUID::gen(),
kShardKeyPattern,
ChunkRange(BSON(kShardKey << 0), BSON(kShardKey << 10)),
10 /* numDocsToRemovePerBatch*/,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete*/,
Milliseconds(0) /* delayBetweenBatches */);
ASSERT_THROWS_CODE(cleanupComplete.get(),
DBException,
ErrorCodes::RangeDeletionAbandonedBecauseCollectionWithUUIDDoesNotExist);
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), numDocsToInsert);
}
TEST_F(RangeDeleterTest, RemoveDocumentsInRangeThrowsErrorWhenCollectionDoesNotExist) {
auto queriesComplete = SemiFuture<void>::makeReady();
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
NamespaceString("someFake", "namespace"),
UUID::gen(),
kShardKeyPattern,
ChunkRange(BSON(kShardKey << 0), BSON(kShardKey << 10)),
10 /* numDocsToRemovePerBatch*/,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete*/,
Milliseconds(0) /* delayBetweenBatches */);
ASSERT_THROWS_CODE(cleanupComplete.get(),
DBException,
ErrorCodes::RangeDeletionAbandonedBecauseCollectionWithUUIDDoesNotExist);
}
TEST_F(RangeDeleterTest, RemoveDocumentsInRangeWaitsForReplicationAfterDeletingSingleBatch) {
auto replCoord = checked_cast<repl::ReplicationCoordinatorMock*>(
repl::ReplicationCoordinator::get(getServiceContext()));
int numTimesWaitedForReplication = 0;
// Override special handler for waiting for replication to count the number of times we wait for
// replication.
replCoord->setAwaitReplicationReturnValueFunction(
[&](OperationContext* opCtx, const repl::OpTime& opTime) {
++numTimesWaitedForReplication;
return repl::ReplicationCoordinator::StatusAndDuration(Status::OK(), Milliseconds(0));
});
const auto numDocsToInsert = 3;
const auto numDocsToRemovePerBatch = 10;
const auto numBatches = ceil((double)numDocsToInsert / numDocsToRemovePerBatch);
const auto expectedNumTimesWaitedForReplication =
numBatches + 1 /* for deleting range deletion task */;
DBDirectClient dbclient(operationContext());
for (auto i = 0; i < numDocsToInsert; ++i) {
dbclient.insert(kNss.toString(), BSON(kShardKey << i));
}
auto queriesComplete = SemiFuture<void>::makeReady();
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
ChunkRange(BSON(kShardKey << 0), BSON(kShardKey << 10)),
numDocsToRemovePerBatch,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete*/,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), 0);
ASSERT_EQ(numTimesWaitedForReplication, expectedNumTimesWaitedForReplication);
}
TEST_F(RangeDeleterTest, RemoveDocumentsInRangeWaitsForReplicationAfterDeletingEveryBatch) {
auto replCoord = checked_cast<repl::ReplicationCoordinatorMock*>(
repl::ReplicationCoordinator::get(getServiceContext()));
int numTimesWaitedForReplication = 0;
// Set special handler for waiting for replication.
replCoord->setAwaitReplicationReturnValueFunction(
[&](OperationContext* opCtx, const repl::OpTime& opTime) {
++numTimesWaitedForReplication;
return repl::ReplicationCoordinator::StatusAndDuration(Status::OK(), Milliseconds(0));
});
const auto numDocsToInsert = 3;
const auto numDocsToRemovePerBatch = 1;
const auto numBatches = ceil((double)numDocsToInsert / numDocsToRemovePerBatch);
const auto expectedNumTimesWaitedForReplication =
numBatches + 1 /* for deleting range deletion task */;
DBDirectClient dbclient(operationContext());
for (auto i = 0; i < numDocsToInsert; ++i) {
dbclient.insert(kNss.toString(), BSON(kShardKey << i));
}
auto queriesComplete = SemiFuture<void>::makeReady();
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
ChunkRange(BSON(kShardKey << 0), BSON(kShardKey << 10)),
numDocsToRemovePerBatch,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete */,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), 0);
ASSERT_EQ(numTimesWaitedForReplication, expectedNumTimesWaitedForReplication);
}
TEST_F(RangeDeleterTest, RemoveDocumentsInRangeRetriesOnWriteConflictException) {
// Enable fail point to throw WriteConflictException.
globalFailPointRegistry()
.find("throwWriteConflictExceptionInDeleteRange")
->setMode(FailPoint::nTimes, 3 /* Throw a few times before disabling. */);
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
auto queriesComplete = SemiFuture<void>::makeReady();
DBDirectClient dbclient(operationContext());
dbclient.insert(kNss.toString(), BSON(kShardKey << 5));
// Insert range deletion task for this collection and range.
setFilteringMetadataWithUUID(uuid());
PersistentTaskStore<RangeDeletionTask> store(operationContext(),
NamespaceString::kRangeDeletionNamespace);
RangeDeletionTask t(
UUID::gen(), kNss, uuid(), ShardId("donor"), range, CleanWhenEnum::kDelayed);
store.add(operationContext(), t);
// Document should be in the store.
ASSERT_EQUALS(countDocsInConfigRangeDeletions(store, operationContext()), 1);
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
10 /*numDocsToRemovePerBatch*/,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete */,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), 0);
}
TEST_F(RangeDeleterTest, RemoveDocumentsInRangeRetriesOnUnexpectedError) {
// Enable fail point to throw InternalError.
globalFailPointRegistry()
.find("throwInternalErrorInDeleteRange")
->setMode(FailPoint::nTimes, 3 /* Throw a few times before disabling. */);
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
auto queriesComplete = SemiFuture<void>::makeReady();
DBDirectClient dbclient(operationContext());
dbclient.insert(kNss.toString(), BSON(kShardKey << 5));
// Insert range deletion task for this collection and range.
setFilteringMetadataWithUUID(uuid());
PersistentTaskStore<RangeDeletionTask> store(operationContext(),
NamespaceString::kRangeDeletionNamespace);
RangeDeletionTask t(
UUID::gen(), kNss, uuid(), ShardId("donor"), range, CleanWhenEnum::kDelayed);
store.add(operationContext(), t);
// Document should be in the store.
ASSERT_EQUALS(countDocsInConfigRangeDeletions(store, operationContext()), 1);
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
10 /*numDocsToRemovePerBatch*/,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete */,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), 0);
}
TEST_F(RangeDeleterTest, RemoveDocumentsInRangeRespectsDelayInBetweenBatches) {
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
// More documents than the batch size.
const auto numDocsToInsert = 3;
const auto numDocsToRemovePerBatch = 1;
const auto delayBetweenBatches = Milliseconds(10);
auto queriesComplete = SemiFuture<void>::makeReady();
// Insert documents in range.
DBDirectClient dbclient(operationContext());
for (auto i = 0; i < numDocsToInsert; ++i) {
dbclient.insert(kNss.toString(), BSON(kShardKey << i));
}
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
numDocsToRemovePerBatch,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete */,
delayBetweenBatches);
// A best-effort check that cleanup has not completed without advancing the clock.
sleepsecs(1);
ASSERT_FALSE(cleanupComplete.isReady());
// Advance the time until cleanup is complete. This explicit advancement of the clock is
// required in order to allow the delay between batches to complete. This cannot be made exact
// because there's no way to tell when the sleep operation gets hit exactly, so instead we
// incrementally advance time until it's ready.
while (!cleanupComplete.isReady()) {
executor::NetworkInterfaceMock::InNetworkGuard guard(network());
network()->advanceTime(network()->now() + Milliseconds(1));
}
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), 0);
}
TEST_F(RangeDeleterTest, RemoveDocumentsInRangeRespectsOrphanCleanupDelay) {
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
// More documents than the batch size.
const auto numDocsToInsert = 3;
const auto numDocsToRemovePerBatch = 1;
const auto orphanCleanupDelay = Seconds(10);
auto queriesComplete = SemiFuture<void>::makeReady();
// Insert documents in range.
DBDirectClient dbclient(operationContext());
for (auto i = 0; i < numDocsToInsert; ++i) {
dbclient.insert(kNss.toString(), BSON(kShardKey << i));
}
auto cleanupComplete = removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
numDocsToRemovePerBatch,
orphanCleanupDelay,
Milliseconds(0) /* delayBetweenBatches */);
// A best-effort check that cleanup has not completed without advancing the clock.
sleepsecs(1);
ASSERT_FALSE(cleanupComplete.isReady());
// Advance the time past the delay until cleanup is complete. This cannot be made exact because
// there's no way to tell when the sleep operation gets hit exactly, so instead we incrementally
// advance time until it's ready.
while (!cleanupComplete.isReady()) {
executor::NetworkInterfaceMock::InNetworkGuard guard(network());
network()->advanceTime(network()->now() + orphanCleanupDelay);
}
cleanupComplete.get();
ASSERT_EQUALS(dbclient.count(kNss, BSONObj()), 0);
}
TEST_F(RangeDeleterTest, RemoveDocumentsInRangeRemovesRangeDeletionTaskOnSuccess) {
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
auto queriesComplete = SemiFuture<void>::makeReady();
DBDirectClient dbclient(operationContext());
dbclient.insert(kNss.toString(), BSON(kShardKey << 5));
// Insert range deletion task for this collection and range.
setFilteringMetadataWithUUID(uuid());
PersistentTaskStore<RangeDeletionTask> store(operationContext(),
NamespaceString::kRangeDeletionNamespace);
RangeDeletionTask t(
UUID::gen(), kNss, uuid(), ShardId("donor"), range, CleanWhenEnum::kDelayed);
store.add(operationContext(), t);
// Document should be in the store.
ASSERT_EQUALS(countDocsInConfigRangeDeletions(store, operationContext()), 1);
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
10 /*numDocsToRemovePerBatch*/,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete */,
Milliseconds(0) /* delayBetweenBatches */);
cleanupComplete.get();
// Document should have been deleted.
ASSERT_EQUALS(countDocsInConfigRangeDeletions(store, operationContext()), 0);
}
TEST_F(RangeDeleterTest,
RemoveDocumentsInRangeRemovesRangeDeletionTaskOnCollectionDroppedErrorWhenStillPrimary) {
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
auto queriesComplete = SemiFuture<void>::makeReady();
auto fakeUuid = UUID::gen();
DBDirectClient dbclient(operationContext());
dbclient.insert(kNss.toString(), BSON(kShardKey << 5));
// Insert range deletion task for this collection and range.
setFilteringMetadataWithUUID(fakeUuid);
PersistentTaskStore<RangeDeletionTask> store(operationContext(),
NamespaceString::kRangeDeletionNamespace);
RangeDeletionTask t(
UUID::gen(), kNss, fakeUuid, ShardId("donor"), range, CleanWhenEnum::kDelayed);
store.add(operationContext(), t);
// Document should be in the store.
ASSERT_EQUALS(countDocsInConfigRangeDeletions(store, operationContext()), 1);
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
fakeUuid,
kShardKeyPattern,
range,
10 /*numDocsToRemovePerBatch*/,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete */,
Milliseconds(0) /* delayBetweenBatches */);
ASSERT_THROWS_CODE(cleanupComplete.get(),
DBException,
ErrorCodes::RangeDeletionAbandonedBecauseCollectionWithUUIDDoesNotExist);
// Document should have been deleted.
ASSERT_EQUALS(countDocsInConfigRangeDeletions(store, operationContext()), 0);
}
TEST_F(RangeDeleterTest,
RemoveDocumentsInRangeDoesNotRemoveRangeDeletionTaskOnErrorWhenNotStillPrimary) {
const ChunkRange range(BSON(kShardKey << 0), BSON(kShardKey << 10));
auto queriesComplete = SemiFuture<void>::makeReady();
DBDirectClient dbclient(operationContext());
dbclient.insert(kNss.toString(), BSON(kShardKey << 5));
// Insert range deletion task for this collection and range.
setFilteringMetadataWithUUID(uuid());
PersistentTaskStore<RangeDeletionTask> store(operationContext(),
NamespaceString::kRangeDeletionNamespace);
RangeDeletionTask t(
UUID::gen(), kNss, uuid(), ShardId("donor"), range, CleanWhenEnum::kDelayed);
store.add(operationContext(), t);
// Document should be in the store.
ASSERT_EQUALS(countDocsInConfigRangeDeletions(store, operationContext()), 1);
// Pretend we stepped down.
auto replCoord = checked_cast<repl::ReplicationCoordinatorMock*>(
repl::ReplicationCoordinator::get(getServiceContext()));
replCoord->setCanAcceptNonLocalWrites(false);
std::ignore = replCoord->setFollowerMode(repl::MemberState::RS_SECONDARY);
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move(queriesComplete),
kNss,
uuid(),
kShardKeyPattern,
range,
10 /*numDocsToRemovePerBatch*/,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete */,
Milliseconds(0) /* delayBetweenBatches */);
ASSERT_THROWS_CODE(cleanupComplete.get(), DBException, ErrorCodes::PrimarySteppedDown);
// Pretend we stepped back up so we can read the task store.
replCoord->setCanAcceptNonLocalWrites(true);
std::ignore = replCoord->setFollowerMode(repl::MemberState::RS_PRIMARY);
// Document should not have been deleted.
ASSERT_EQUALS(countDocsInConfigRangeDeletions(store, operationContext()), 1);
}
// The input future should never have an error.
DEATH_TEST_F(RangeDeleterTest, RemoveDocumentsInRangeCrashesIfInputFutureHasError, "invariant") {
DBDirectClient dbclient(operationContext());
dbclient.insert(kNss.toString(), BSON(kShardKey << 5));
auto queriesCompletePf = makePromiseFuture<void>();
auto cleanupComplete =
removeDocumentsInRange(executor(),
std::move((queriesCompletePf.future)).semi(),
kNss,
uuid(),
kShardKeyPattern,
ChunkRange(BSON(kShardKey << 0), BSON(kShardKey << 10)),
10 /* numDocsToRemovePerBatch */,
Seconds(0) /* delayForActiveQueriesOnSecondariesToComplete */,
Milliseconds(0) /* delayBetweenBatches */);
// Should cause an invariant failure.
queriesCompletePf.promise.setError(Status(ErrorCodes::InternalError, "Some unexpected error"));
}
} // namespace
} // namespace mongo
|