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
|
/**
* Copyright (C) 2018-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/repl/oplog_applier_impl_test_fixture.h"
#include "mongo/db/catalog/document_validation.h"
#include "mongo/db/curop.h"
#include "mongo/db/db_raii.h"
#include "mongo/db/dbdirectclient.h"
#include "mongo/db/op_observer_registry.h"
#include "mongo/db/query/internal_plans.h"
#include "mongo/db/repl/drop_pending_collection_reaper.h"
#include "mongo/db/repl/oplog_applier.h"
#include "mongo/db/repl/replication_consistency_markers_mock.h"
#include "mongo/db/repl/replication_coordinator_mock.h"
#include "mongo/db/repl/replication_process.h"
#include "mongo/db/repl/replication_recovery_mock.h"
#include "mongo/db/repl/storage_interface.h"
#include "mongo/db/repl/storage_interface_impl.h"
#include "mongo/db/vector_clock_mutable.h"
namespace mongo {
namespace repl {
void OplogApplierImplOpObserver::onInserts(OperationContext* opCtx,
const NamespaceString& nss,
OptionalCollectionUUID uuid,
std::vector<InsertStatement>::const_iterator begin,
std::vector<InsertStatement>::const_iterator end,
bool fromMigrate) {
if (!onInsertsFn) {
return;
}
std::vector<BSONObj> docs;
for (auto it = begin; it != end; ++it) {
const InsertStatement& insertStatement = *it;
docs.push_back(insertStatement.doc.getOwned());
}
onInsertsFn(opCtx, nss, docs);
}
void OplogApplierImplOpObserver::onDelete(OperationContext* opCtx,
const NamespaceString& nss,
OptionalCollectionUUID uuid,
StmtId stmtId,
bool fromMigrate,
const boost::optional<BSONObj>& deletedDoc) {
if (!onDeleteFn) {
return;
}
onDeleteFn(opCtx, nss, uuid, stmtId, fromMigrate, deletedDoc);
}
void OplogApplierImplOpObserver::onUpdate(OperationContext* opCtx,
const OplogUpdateEntryArgs& args) {
if (!onUpdateFn) {
return;
}
onUpdateFn(opCtx, args);
}
void OplogApplierImplOpObserver::onCreateCollection(OperationContext* opCtx,
Collection* coll,
const NamespaceString& collectionName,
const CollectionOptions& options,
const BSONObj& idIndex,
const OplogSlot& createOpTime) {
if (!onCreateCollectionFn) {
return;
}
onCreateCollectionFn(opCtx, coll, collectionName, options, idIndex);
}
void OplogApplierImplTest::setUp() {
ServiceContextMongoDTest::setUp();
serviceContext = getServiceContext();
_opCtx = cc().makeOperationContext();
ReplicationCoordinator::set(serviceContext,
std::make_unique<ReplicationCoordinatorMock>(serviceContext));
ASSERT_OK(ReplicationCoordinator::get(_opCtx.get())->setFollowerMode(MemberState::RS_PRIMARY));
StorageInterface::set(serviceContext, std::make_unique<StorageInterfaceImpl>());
DropPendingCollectionReaper::set(
serviceContext, std::make_unique<DropPendingCollectionReaper>(getStorageInterface()));
repl::setOplogCollectionName(serviceContext);
repl::createOplog(_opCtx.get());
_consistencyMarkers = std::make_unique<ReplicationConsistencyMarkersMock>();
// Set up an OpObserver to track the documents OplogApplierImpl inserts.
auto opObserver = std::make_unique<OplogApplierImplOpObserver>();
_opObserver = opObserver.get();
auto opObserverRegistry = dynamic_cast<OpObserverRegistry*>(serviceContext->getOpObserver());
opObserverRegistry->addObserver(std::move(opObserver));
// Initialize the featureCompatibilityVersion server parameter. This is necessary because this
// test fixture does not create a featureCompatibilityVersion document from which to initialize
// the server parameter.
serverGlobalParams.featureCompatibility.setVersion(
ServerGlobalParams::FeatureCompatibility::Version::kFullyUpgradedTo46);
// This is necessary to generate ghost timestamps for index builds that are not 0, since 0 is an
// invalid timestamp.
VectorClockMutable::get(_opCtx.get())
->tickTo(VectorClock::Component::ClusterTime, LogicalTime(Timestamp(1, 0)));
}
void OplogApplierImplTest::tearDown() {
_opCtx.reset();
_consistencyMarkers = {};
DropPendingCollectionReaper::set(serviceContext, {});
StorageInterface::set(serviceContext, {});
ServiceContextMongoDTest::tearDown();
}
ReplicationConsistencyMarkers* OplogApplierImplTest::getConsistencyMarkers() const {
return _consistencyMarkers.get();
}
StorageInterface* OplogApplierImplTest::getStorageInterface() const {
return StorageInterface::get(serviceContext);
}
// Since applyOplogEntryOrGroupedInserts is being tested outside of its calling function
// (applyOplogBatchPerWorker), we recreate the necessary calling context.
Status OplogApplierImplTest::_applyOplogEntryOrGroupedInsertsWrapper(
OperationContext* opCtx,
const OplogEntryOrGroupedInserts& batch,
OplogApplication::Mode oplogApplicationMode) {
UnreplicatedWritesBlock uwb(opCtx);
DisableDocumentValidation validationDisabler(opCtx);
return applyOplogEntryOrGroupedInserts(opCtx, batch, oplogApplicationMode);
}
void OplogApplierImplTest::_testApplyOplogEntryOrGroupedInsertsCrudOperation(
ErrorCodes::Error expectedError, const OplogEntry& op, bool expectedApplyOpCalled) {
bool applyOpCalled = false;
auto checkOpCtx = [](OperationContext* opCtx) {
ASSERT_TRUE(opCtx);
ASSERT_TRUE(opCtx->lockState()->isDbLockedForMode("test", MODE_IX));
ASSERT_FALSE(opCtx->lockState()->isDbLockedForMode("test", MODE_X));
ASSERT_TRUE(
opCtx->lockState()->isCollectionLockedForMode(NamespaceString("test.t"), MODE_IX));
ASSERT_FALSE(opCtx->writesAreReplicated());
ASSERT_TRUE(documentValidationDisabled(opCtx));
};
_opObserver->onInsertsFn =
[&](OperationContext* opCtx, const NamespaceString& nss, const std::vector<BSONObj>& docs) {
applyOpCalled = true;
checkOpCtx(opCtx);
ASSERT_EQUALS(NamespaceString("test.t"), nss);
ASSERT_EQUALS(1U, docs.size());
// For upserts we don't know the intended value of the document.
if (op.getOpType() == repl::OpTypeEnum::kInsert) {
ASSERT_BSONOBJ_EQ(op.getObject(), docs[0]);
}
return Status::OK();
};
_opObserver->onDeleteFn = [&](OperationContext* opCtx,
const NamespaceString& nss,
OptionalCollectionUUID uuid,
StmtId stmtId,
bool fromMigrate,
const boost::optional<BSONObj>& deletedDoc) {
applyOpCalled = true;
checkOpCtx(opCtx);
ASSERT_EQUALS(NamespaceString("test.t"), nss);
ASSERT(deletedDoc);
ASSERT_BSONOBJ_EQ(op.getObject(), *deletedDoc);
return Status::OK();
};
_opObserver->onUpdateFn = [&](OperationContext* opCtx, const OplogUpdateEntryArgs& args) {
applyOpCalled = true;
checkOpCtx(opCtx);
ASSERT_EQUALS(NamespaceString("test.t"), args.nss);
return Status::OK();
};
ASSERT_EQ(_applyOplogEntryOrGroupedInsertsWrapper(
_opCtx.get(), &op, OplogApplication::Mode::kSecondary),
expectedError);
ASSERT_EQ(applyOpCalled, expectedApplyOpCalled);
}
Status failedApplyCommand(OperationContext* opCtx,
const BSONObj& theOperation,
OplogApplication::Mode) {
FAIL("applyCommand unexpectedly invoked.");
return Status::OK();
}
Status OplogApplierImplTest::runOpSteadyState(const OplogEntry& op) {
return runOpsSteadyState({op});
}
Status OplogApplierImplTest::runOpsSteadyState(std::vector<OplogEntry> ops) {
TestApplyOplogGroupApplier oplogApplier(
getConsistencyMarkers(),
getStorageInterface(),
repl::OplogApplier::Options(repl::OplogApplication::Mode::kSecondary));
std::vector<const OplogEntry*> opsPtrs;
for (auto& op : ops) {
opsPtrs.push_back(&op);
}
WorkerMultikeyPathInfo pathInfo;
return oplogApplier.applyOplogBatchPerWorker(_opCtx.get(), &opsPtrs, &pathInfo);
}
Status OplogApplierImplTest::runOpInitialSync(const OplogEntry& op) {
return runOpsInitialSync({op});
}
Status OplogApplierImplTest::runOpsInitialSync(std::vector<OplogEntry> ops) {
NoopOplogApplierObserver observer;
auto storageInterface = getStorageInterface();
auto writerPool = makeReplWriterPool();
OplogApplierImpl oplogApplier(
nullptr, // executor
nullptr, // oplogBuffer
&observer,
ReplicationCoordinator::get(_opCtx.get()),
getConsistencyMarkers(),
storageInterface,
repl::OplogApplier::Options(repl::OplogApplication::Mode::kInitialSync),
writerPool.get());
// Idempotency tests apply the same batch of oplog entries multiple times in a loop, which would
// result in out-of-order oplog inserts. So we truncate the oplog collection first before
// calling applyOplogBatch.
ASSERT_OK(
storageInterface->truncateCollection(_opCtx.get(), NamespaceString::kRsOplogNamespace));
// Apply each operation in a batch of one because 'ops' may contain a mix of commands and CRUD
// operations provided by idempotency tests. Applying operations in a batch of one is also
// necessary to work around oplog visibility issues. For example, idempotency tests may contain
// a prepare and a commit that we don't apply both in the same batch in production oplog
// application because the commit needs to read the prepare entry. So we apply each operation in
// its own batch and update oplog visibility after each batch to make sure all previously
// applied entries are visible to subsequent batches.
for (auto& op : ops) {
auto applyResult = oplogApplier.applyOplogBatch(_opCtx.get(), {op});
if (!applyResult.isOK()) {
std::vector<BSONObj> docsFromOps;
for (const auto& opForContext : ops) {
docsFromOps.push_back(opForContext.toBSON());
}
auto status = applyResult.getStatus();
return status.withContext(str::stream() << "failed to apply operation: " << op.toBSON()
<< ". " << BSON("ops" << docsFromOps));
}
auto lastApplied = applyResult.getValue();
const bool orderedCommit = true;
// Update oplog visibility by notifying the storage engine of the new oplog entries.
storageInterface->oplogDiskLocRegister(
_opCtx.get(), lastApplied.getTimestamp(), orderedCommit);
}
return Status::OK();
}
void checkTxnTable(OperationContext* opCtx,
const LogicalSessionId& lsid,
const TxnNumber& txnNum,
const repl::OpTime& expectedOpTime,
Date_t expectedWallClock,
boost::optional<repl::OpTime> expectedStartOpTime,
boost::optional<DurableTxnStateEnum> expectedState) {
DBDirectClient client(opCtx);
auto result = client.findOne(NamespaceString::kSessionTransactionsTableNamespace.ns(),
{BSON(SessionTxnRecord::kSessionIdFieldName << lsid.toBSON())});
ASSERT_FALSE(result.isEmpty());
auto txnRecord =
SessionTxnRecord::parse(IDLParserErrorContext("parse txn record for test"), result);
ASSERT_EQ(txnNum, txnRecord.getTxnNum());
ASSERT_EQ(expectedOpTime, txnRecord.getLastWriteOpTime());
ASSERT_EQ(expectedWallClock, txnRecord.getLastWriteDate());
if (expectedStartOpTime) {
ASSERT(txnRecord.getStartOpTime());
ASSERT_EQ(*expectedStartOpTime, *txnRecord.getStartOpTime());
} else {
ASSERT(!txnRecord.getStartOpTime());
}
if (expectedState) {
ASSERT(*expectedState == txnRecord.getState());
}
}
CollectionReader::CollectionReader(OperationContext* opCtx, const NamespaceString& nss)
: _collToScan(opCtx, nss),
_exec(InternalPlanner::collectionScan(opCtx,
nss.ns(),
_collToScan.getCollection(),
PlanExecutor::NO_YIELD,
InternalPlanner::FORWARD)) {}
StatusWith<BSONObj> CollectionReader::next() {
BSONObj obj;
auto state = _exec->getNext(&obj, nullptr);
if (state == PlanExecutor::IS_EOF) {
return {ErrorCodes::CollectionIsEmpty,
str::stream() << "no more documents in " << _collToScan.getNss()};
}
// PlanExecutors that do not yield should only return ADVANCED or EOF.
invariant(state == PlanExecutor::ADVANCED);
return obj;
}
bool docExists(OperationContext* opCtx, const NamespaceString& nss, const BSONObj& doc) {
DBDirectClient client(opCtx);
auto result = client.findOne(nss.ns(), {doc});
return !result.isEmpty();
}
} // namespace repl
} // namespace mongo
|