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
|
/**
* 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/db/s/range_deletion_util.h"
#include <algorithm>
#include <boost/optional.hpp>
#include <utility>
#include "mongo/db/catalog_raii.h"
#include "mongo/db/client.h"
#include "mongo/db/concurrency/exception_util.h"
#include "mongo/db/dbhelpers.h"
#include "mongo/db/exec/delete_stage.h"
#include "mongo/db/exec/working_set_common.h"
#include "mongo/db/index/index_descriptor.h"
#include "mongo/db/keypattern.h"
#include "mongo/db/operation_context.h"
#include "mongo/db/persistent_task_store.h"
#include "mongo/db/query/internal_plans.h"
#include "mongo/db/query/plan_yield_policy.h"
#include "mongo/db/query/query_knobs_gen.h"
#include "mongo/db/query/query_planner.h"
#include "mongo/db/repl/repl_client_info.h"
#include "mongo/db/repl/wait_for_majority_service.h"
#include "mongo/db/s/migration_util.h"
#include "mongo/db/s/shard_key_index_util.h"
#include "mongo/db/s/sharding_runtime_d_params_gen.h"
#include "mongo/db/s/sharding_statistics.h"
#include "mongo/db/service_context.h"
#include "mongo/db/storage/remove_saver.h"
#include "mongo/db/write_concern.h"
#include "mongo/executor/task_executor.h"
#include "mongo/logv2/log.h"
#include "mongo/s/catalog/sharding_catalog_client.h"
#include "mongo/util/cancellation.h"
#include "mongo/util/future_util.h"
#define MONGO_LOGV2_DEFAULT_COMPONENT ::mongo::logv2::LogComponent::kShardingRangeDeleter
namespace mongo {
namespace {
MONGO_FAIL_POINT_DEFINE(hangBeforeDoingDeletion);
MONGO_FAIL_POINT_DEFINE(hangAfterDoingDeletion);
MONGO_FAIL_POINT_DEFINE(suspendRangeDeletion);
MONGO_FAIL_POINT_DEFINE(throwWriteConflictExceptionInDeleteRange);
MONGO_FAIL_POINT_DEFINE(throwInternalErrorInDeleteRange);
/**
* Performs the deletion of up to numDocsToRemovePerBatch entries within the range in progress. Must
* be called under the collection lock.
*
* Returns the number of documents deleted, 0 if done with the range, or bad status if deleting
* the range failed.
*/
StatusWith<int> deleteNextBatch(OperationContext* opCtx,
const CollectionPtr& collection,
BSONObj const& keyPattern,
ChunkRange const& range,
int numDocsToRemovePerBatch) {
invariant(collection);
auto const nss = collection->ns();
// The IndexChunk has a keyPattern that may apply to more than one index - we need to
// select the index and get the full index keyPattern here.
auto shardKeyIdx = findShardKeyPrefixedIndex(
opCtx, collection, collection->getIndexCatalog(), keyPattern, /*requireSingleKey=*/false);
if (!shardKeyIdx) {
LOGV2_ERROR_OPTIONS(23765,
{logv2::UserAssertAfterLog(ErrorCodes::InternalError)},
"Unable to find shard key index for {keyPattern} in {namespace}",
"Unable to find shard key index",
"keyPattern"_attr = keyPattern,
"namespace"_attr = nss.ns());
}
// Extend bounds to match the index we found
const KeyPattern indexKeyPattern(shardKeyIdx->keyPattern());
const auto extend = [&](const auto& key) {
return Helpers::toKeyFormat(indexKeyPattern.extendRangeBound(key, false));
};
const auto min = extend(range.getMin());
const auto max = extend(range.getMax());
LOGV2_DEBUG(23766,
1,
"Begin removal of {min} to {max} in {namespace}",
"Begin removal of range",
"min"_attr = min,
"max"_attr = max,
"namespace"_attr = nss.ns());
auto deleteStageParams = std::make_unique<DeleteStageParams>();
deleteStageParams->fromMigrate = true;
deleteStageParams->isMulti = true;
deleteStageParams->returnDeleted = true;
if (serverGlobalParams.moveParanoia) {
deleteStageParams->removeSaver =
std::make_unique<RemoveSaver>("moveChunk", nss.ns(), "cleaning");
}
auto exec =
InternalPlanner::deleteWithShardKeyIndexScan(opCtx,
&collection,
std::move(deleteStageParams),
*shardKeyIdx,
min,
max,
BoundInclusion::kIncludeStartKeyOnly,
PlanYieldPolicy::YieldPolicy::YIELD_AUTO,
InternalPlanner::FORWARD);
if (MONGO_unlikely(hangBeforeDoingDeletion.shouldFail())) {
LOGV2(23768, "Hit hangBeforeDoingDeletion failpoint");
hangBeforeDoingDeletion.pauseWhileSet(opCtx);
}
int numDeleted = 0;
do {
BSONObj deletedObj;
if (throwWriteConflictExceptionInDeleteRange.shouldFail()) {
throwWriteConflictException();
}
if (throwInternalErrorInDeleteRange.shouldFail()) {
uasserted(ErrorCodes::InternalError, "Failing for test");
}
PlanExecutor::ExecState state;
try {
state = exec->getNext(&deletedObj, nullptr);
} catch (const DBException& ex) {
auto&& explainer = exec->getPlanExplainer();
auto&& [stats, _] =
explainer.getWinningPlanStats(ExplainOptions::Verbosity::kExecStats);
LOGV2_WARNING(23776,
"Cursor error while trying to delete {min} to {max} in {namespace}, "
"stats: {stats}, error: {error}",
"Cursor error while trying to delete range",
"min"_attr = redact(min),
"max"_attr = redact(max),
"namespace"_attr = nss,
"stats"_attr = redact(stats),
"error"_attr = redact(ex.toStatus()));
throw;
}
if (state == PlanExecutor::IS_EOF) {
break;
}
invariant(PlanExecutor::ADVANCED == state);
ShardingStatistics::get(opCtx).countDocsDeletedOnDonor.addAndFetch(1);
} while (++numDeleted < numDocsToRemovePerBatch);
return numDeleted;
}
template <typename Callable>
auto withTemporaryOperationContext(Callable&& callable, const NamespaceString& nss) {
ThreadClient tc(migrationutil::kRangeDeletionThreadName, getGlobalServiceContext());
{
stdx::lock_guard<Client> lk(*tc.get());
tc->setSystemOperationKillableByStepdown(lk);
}
auto uniqueOpCtx = Client::getCurrent()->makeOperationContext();
auto opCtx = uniqueOpCtx.get();
// Ensure that this operation will be killed by the RstlKillOpThread during step-up or stepdown.
opCtx->setAlwaysInterruptAtStepDownOrUp_UNSAFE();
invariant(opCtx->shouldAlwaysInterruptAtStepDownOrUp());
{
auto replCoord = repl::ReplicationCoordinator::get(opCtx);
Lock::GlobalLock lock(opCtx, MODE_IX);
uassert(ErrorCodes::PrimarySteppedDown,
str::stream() << "Not primary while running range deletion task for collection"
<< nss,
replCoord->getReplicationMode() == repl::ReplicationCoordinator::modeReplSet &&
replCoord->canAcceptWritesFor(opCtx, nss));
}
return callable(opCtx);
}
void ensureRangeDeletionTaskStillExists(OperationContext* opCtx, const UUID& migrationId) {
// While at this point we are guaranteed for our operation context to be killed if there is a
// step-up or stepdown, it is still possible that a stepdown and a subsequent step-up happened
// prior to acquiring the global IX lock. The range deletion task document prevents a moveChunk
// operation from migrating an overlapping range to this shard. If the range deletion task
// document has already been deleted, then it is possible for the range in the user collection
// to now be owned by this shard and for proceeding with the range deletion to result in data
// corruption. The scheme for checking whether the range deletion task document still exists
// relies on the executor only having a single thread and that thread being solely responsible
// for deleting the range deletion task document.
PersistentTaskStore<RangeDeletionTask> store(NamespaceString::kRangeDeletionNamespace);
auto count = store.count(opCtx,
BSON(RangeDeletionTask::kIdFieldName
<< migrationId << RangeDeletionTask::kPendingFieldName
<< BSON("$exists" << false)));
invariant(count == 0 || count == 1, "found duplicate range deletion tasks");
uassert(ErrorCodes::RangeDeletionAbandonedBecauseTaskDocumentDoesNotExist,
"Range deletion task no longer exists",
count == 1);
// We are now guaranteed that either (a) the range deletion task document will continue to exist
// for the lifetime of this operation context, or (b) this operation context will be killed if
// it is possible for the range deletion task document to have been deleted while we weren't
// holding any locks.
}
void markRangeDeletionTaskAsProcessing(OperationContext* opCtx, const UUID& migrationId) {
PersistentTaskStore<RangeDeletionTask> store(NamespaceString::kRangeDeletionNamespace);
auto query = BSON(RangeDeletionTask::kIdFieldName << migrationId);
static const auto update =
BSON("$set" << BSON(RangeDeletionTask::kProcessingFieldName
<< true << RangeDeletionTask::kWhenToCleanFieldName
<< CleanWhen_serializer(CleanWhenEnum::kNow)));
try {
store.update(opCtx, query, update, WriteConcerns::kLocalWriteConcern);
} catch (const ExceptionFor<ErrorCodes::NoMatchingDocument>&) {
// The collection may have been dropped or the document could have been manually deleted
}
}
/**
* Delete the range in a sequence of batches until there are no more documents to delete or deletion
* returns an error.
*/
ExecutorFuture<void> deleteRangeInBatchesWithExecutor(
const std::shared_ptr<executor::TaskExecutor>& executor,
const NamespaceString& nss,
const UUID& collectionUuid,
const BSONObj& keyPattern,
const ChunkRange& range,
const UUID& migrationId) {
return ExecutorFuture<void>(executor).then([=] {
return withTemporaryOperationContext(
[=](OperationContext* opCtx) {
return deleteRangeInBatches(
opCtx, nss.db(), collectionUuid, keyPattern, range, migrationId);
},
nss);
});
}
void removePersistentRangeDeletionTask(const NamespaceString& nss, UUID migrationId) {
withTemporaryOperationContext(
[&](OperationContext* opCtx) {
PersistentTaskStore<RangeDeletionTask> store(NamespaceString::kRangeDeletionNamespace);
store.remove(opCtx, BSON(RangeDeletionTask::kIdFieldName << migrationId));
},
nss);
}
ExecutorFuture<void> waitForDeletionsToMajorityReplicate(
const std::shared_ptr<executor::TaskExecutor>& executor,
const NamespaceString& nss,
const UUID& collectionUuid,
const ChunkRange& range) {
return withTemporaryOperationContext(
[=](OperationContext* opCtx) {
repl::ReplClientInfo::forClient(opCtx->getClient()).setLastOpToSystemLastOpTime(opCtx);
auto clientOpTime = repl::ReplClientInfo::forClient(opCtx->getClient()).getLastOp();
LOGV2_DEBUG(5346202,
1,
"Waiting for majority replication of local deletions",
"namespace"_attr = nss.ns(),
"collectionUUID"_attr = collectionUuid,
"range"_attr = redact(range.toString()),
"clientOpTime"_attr = clientOpTime);
// Asynchronously wait for majority write concern.
return WaitForMajorityService::get(opCtx->getServiceContext())
.waitUntilMajority(clientOpTime, CancellationToken::uncancelable())
.thenRunOn(executor);
},
nss);
}
std::vector<RangeDeletionTask> getPersistentRangeDeletionTasks(OperationContext* opCtx,
const NamespaceString& nss) {
std::vector<RangeDeletionTask> tasks;
PersistentTaskStore<RangeDeletionTask> store(NamespaceString::kRangeDeletionNamespace);
auto query = BSON(RangeDeletionTask::kNssFieldName << nss.ns());
store.forEach(opCtx, query, [&](const RangeDeletionTask& deletionTask) {
tasks.push_back(std::move(deletionTask));
return true;
});
return tasks;
}
} // namespace
Status deleteRangeInBatches(OperationContext* opCtx,
const DatabaseName& dbName,
const UUID& collectionUuid,
const BSONObj& keyPattern,
const ChunkRange& range,
const UUID& migrationId) {
bool allDocsRemoved = false;
// Delete all batches in this range unless a stepdown error occurs. Do not yield the
// executor to ensure that this range is fully deleted before another range is
// processed.
while (!allDocsRemoved) {
try {
int numDocsToRemovePerBatch = rangeDeleterBatchSize.load();
if (numDocsToRemovePerBatch <= 0) {
numDocsToRemovePerBatch = kRangeDeleterBatchSizeDefault;
}
Milliseconds delayBetweenBatches(rangeDeleterBatchDelayMS.load());
ensureRangeDeletionTaskStillExists(opCtx, migrationId);
markRangeDeletionTaskAsProcessing(opCtx, migrationId);
int numDeleted;
const auto nss = [&]() {
try {
AutoGetCollection collection(
opCtx, NamespaceStringOrUUID{dbName.toString(), collectionUuid}, MODE_IX);
LOGV2_DEBUG(6777800,
1,
"Starting batch deletion",
"namespace"_attr = collection.getNss(),
"collectionUUID"_attr = collectionUuid,
"range"_attr = redact(range.toString()),
"numDocsToRemovePerBatch"_attr = numDocsToRemovePerBatch,
"delayBetweenBatches"_attr = delayBetweenBatches);
numDeleted = uassertStatusOK(deleteNextBatch(opCtx,
collection.getCollection(),
keyPattern,
range,
numDocsToRemovePerBatch));
return collection.getNss();
} catch (const ExceptionFor<ErrorCodes::NamespaceNotFound>&) {
// Throw specific error code that stops range deletions in case of errors
uasserted(
ErrorCodes::RangeDeletionAbandonedBecauseCollectionWithUUIDDoesNotExist,
"Collection has been dropped since enqueuing this range "
"deletion task. No need to delete documents.");
}
}();
migrationutil::persistUpdatedNumOrphans(
opCtx, migrationId, collectionUuid, -numDeleted);
if (MONGO_unlikely(hangAfterDoingDeletion.shouldFail())) {
hangAfterDoingDeletion.pauseWhileSet(opCtx);
}
LOGV2_DEBUG(23769,
1,
"Deleted documents in pass",
"numDeleted"_attr = numDeleted,
"namespace"_attr = nss.ns(),
"collectionUUID"_attr = collectionUuid,
"range"_attr = range.toString());
if (numDeleted > 0) {
// (SERVER-62368) The range-deleter executor is mono-threaded, so
// sleeping synchronously for `delayBetweenBatches` ensures that no
// other batch is going to be cleared up before the expected delay.
opCtx->sleepFor(delayBetweenBatches);
}
allDocsRemoved = numDeleted < numDocsToRemovePerBatch;
} catch (const DBException& ex) {
// Errors other than those indicating stepdown and those that indicate that the
// range deletion can no longer occur should be retried.
auto errorCode = ex.code();
if (errorCode ==
ErrorCodes::RangeDeletionAbandonedBecauseCollectionWithUUIDDoesNotExist ||
errorCode == ErrorCodes::RangeDeletionAbandonedBecauseTaskDocumentDoesNotExist ||
errorCode == ErrorCodes::KeyPatternShorterThanBound ||
ErrorCodes::isShutdownError(errorCode) ||
ErrorCodes::isNotPrimaryError(errorCode)) {
return ex.toStatus();
};
}
}
return Status::OK();
}
void snapshotRangeDeletionsForRename(OperationContext* opCtx,
const NamespaceString& fromNss,
const NamespaceString& toNss) {
// Clear out eventual snapshots associated with the target collection: always restart from a
// clean state in case of stepdown or primary killed.
PersistentTaskStore<RangeDeletionTask> store(NamespaceString::kRangeDeletionForRenameNamespace);
store.remove(opCtx, BSON(RangeDeletionTask::kNssFieldName << toNss.ns()));
auto rangeDeletionTasks = getPersistentRangeDeletionTasks(opCtx, fromNss);
for (auto& task : rangeDeletionTasks) {
// Associate task to the new namespace
task.setNss(toNss);
// Assign a new id to prevent duplicate key conflicts with the source range deletion task
task.setId(UUID::gen());
store.add(opCtx, task);
}
}
void restoreRangeDeletionTasksForRename(OperationContext* opCtx, const NamespaceString& nss) {
PersistentTaskStore<RangeDeletionTask> rangeDeletionsForRenameStore(
NamespaceString::kRangeDeletionForRenameNamespace);
PersistentTaskStore<RangeDeletionTask> rangeDeletionsStore(
NamespaceString::kRangeDeletionNamespace);
const auto query = BSON(RangeDeletionTask::kNssFieldName << nss.ns());
rangeDeletionsForRenameStore.forEach(opCtx, query, [&](const RangeDeletionTask& deletionTask) {
try {
rangeDeletionsStore.add(opCtx, deletionTask);
} catch (const ExceptionFor<ErrorCodes::DuplicateKey>&) {
// Task already scheduled in a previous call of this method
}
return true;
});
}
void deleteRangeDeletionTasksForRename(OperationContext* opCtx,
const NamespaceString& fromNss,
const NamespaceString& toNss) {
// Delete range deletion tasks associated to the source collection
PersistentTaskStore<RangeDeletionTask> rangeDeletionsStore(
NamespaceString::kRangeDeletionNamespace);
rangeDeletionsStore.remove(opCtx, BSON(RangeDeletionTask::kNssFieldName << fromNss.ns()));
// Delete already restored snapshots associated to the target collection
PersistentTaskStore<RangeDeletionTask> rangeDeletionsForRenameStore(
NamespaceString::kRangeDeletionForRenameNamespace);
rangeDeletionsForRenameStore.remove(opCtx,
BSON(RangeDeletionTask::kNssFieldName << toNss.ns()));
}
SharedSemiFuture<void> removeDocumentsInRange(
const std::shared_ptr<executor::TaskExecutor>& executor,
SemiFuture<void> waitForActiveQueriesToComplete,
const NamespaceString& nss,
const UUID& collectionUuid,
const BSONObj& keyPattern,
const ChunkRange& range,
const UUID& migrationId,
Seconds delayForActiveQueriesOnSecondariesToComplete) {
return std::move(waitForActiveQueriesToComplete)
.thenRunOn(executor)
.onError([&](Status s) {
// The code does not expect the input future to have an error set on it, so we
// invariant here to prevent future misuse (no pun intended).
invariant(s.isOK());
})
.then([=]() mutable {
suspendRangeDeletion.pauseWhileSet();
// Wait for possibly ongoing queries on secondaries to complete.
return sleepUntil(executor,
executor->now() + delayForActiveQueriesOnSecondariesToComplete);
})
.then([=]() mutable {
LOGV2_DEBUG(23772,
1,
"Beginning deletion of documents",
"namespace"_attr = nss.ns(),
"range"_attr = redact(range.toString()));
return deleteRangeInBatchesWithExecutor(
executor, nss, collectionUuid, keyPattern, range, migrationId)
.onCompletion([=](Status s) {
if (!s.isOK() &&
s.code() !=
ErrorCodes::RangeDeletionAbandonedBecauseTaskDocumentDoesNotExist) {
// Propagate any errors to the onCompletion() handler below.
return ExecutorFuture<void>(executor, s);
}
// We wait for majority write concern even if the range deletion task document
// doesn't exist to guarantee the deletion (which must have happened earlier) is
// visible to the caller at non-local read concerns.
return waitForDeletionsToMajorityReplicate(executor, nss, collectionUuid, range)
.then([=] {
LOGV2_DEBUG(5346201,
1,
"Finished waiting for majority for deleted batch",
"namespace"_attr = nss,
"range"_attr = redact(range.toString()));
// Propagate any errors to the onCompletion() handler below.
return s;
});
});
})
.onCompletion([=](Status s) {
if (s.isOK()) {
LOGV2_DEBUG(23773,
1,
"Completed deletion of documents in {namespace} range {range}",
"Completed deletion of documents",
"namespace"_attr = nss.ns(),
"range"_attr = redact(range.toString()));
} else {
LOGV2(23774,
"Failed to delete documents in {namespace} range {range} due to {error}",
"Failed to delete documents",
"namespace"_attr = nss.ns(),
"range"_attr = redact(range.toString()),
"error"_attr = redact(s));
}
if (s.code() == ErrorCodes::RangeDeletionAbandonedBecauseTaskDocumentDoesNotExist) {
return Status::OK();
}
if (!s.isOK() &&
s.code() !=
ErrorCodes::RangeDeletionAbandonedBecauseCollectionWithUUIDDoesNotExist) {
// Propagate any errors to callers waiting on the result.
return s;
}
try {
removePersistentRangeDeletionTask(nss, migrationId);
} catch (const DBException& e) {
LOGV2_ERROR(23770,
"Failed to delete range deletion task for range {range} in collection "
"{namespace} due to {error}",
"Failed to delete range deletion task",
"range"_attr = range,
"namespace"_attr = nss,
"error"_attr = e.what());
return e.toStatus();
}
LOGV2_DEBUG(23775,
1,
"Completed removal of persistent range deletion task for {namespace} "
"range {range}",
"Completed removal of persistent range deletion task",
"namespace"_attr = nss.ns(),
"range"_attr = redact(range.toString()));
// Propagate any errors to callers waiting on the result.
return s;
})
.semi()
.share();
}
} // namespace mongo
|