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
|
/**
* 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/catalog/index_catalog.h"
#include "mongo/db/db_raii.h"
#include "mongo/db/dbhelpers.h"
#include "mongo/db/query/index_bounds.h"
#include "mongo/db/query/internal_plans.h"
#include "mongo/db/query/plan_executor.h"
#include "mongo/db/repl/idempotency_document_structure.h"
#include "mongo/db/repl/idempotency_test_fixture.h"
#include "mongo/db/repl/idempotency_update_sequence.h"
#include "mongo/db/repl/replication_coordinator.h"
#include "mongo/db/server_options.h"
#include "mongo/unittest/unittest.h"
namespace mongo {
namespace repl {
namespace {
class RandomizedIdempotencyTest : public IdempotencyTest {
protected:
const int kDocId = 1;
const BSONObj kDocIdQuery = BSON("_id" << kDocId);
std::vector<OplogEntry> createUpdateSequence(const UpdateSequenceGenerator& generator,
const size_t length);
BSONObj canonicalizeDocumentForDataHash(const BSONObj& obj) override;
BSONObj getDoc();
std::string getStateString(const CollectionState& state1,
const CollectionState& state2,
const std::vector<OplogEntry>& ops) override;
Status resetState() override;
void runIdempotencyTestCase();
std::vector<OplogEntry> initOps;
int64_t seed;
};
BSONObj RandomizedIdempotencyTest::canonicalizeDocumentForDataHash(const BSONObj& obj) {
BSONObjBuilder objBuilder;
BSONObjIteratorSorted iter(obj);
while (iter.more()) {
auto elem = iter.next();
if (elem.isABSONObj()) {
if (elem.type() == mongo::Array) {
objBuilder.append(elem.fieldName(), obj);
} else {
// If it is a sub object, we'll have to sort it as well before we append it.
auto sortedObj = canonicalizeDocumentForDataHash(elem.Obj());
objBuilder.append(elem.fieldName(), sortedObj);
}
} else {
// If it is not a sub object, just append it and move on.
objBuilder.append(elem);
}
}
return objBuilder.obj();
}
BSONObj RandomizedIdempotencyTest::getDoc() {
AutoGetCollectionForReadCommand autoColl(_opCtx.get(), nss);
BSONObj doc;
Helpers::findById(_opCtx.get(), autoColl.getDb(), nss.ns(), kDocIdQuery, doc);
return doc.getOwned();
}
std::vector<OplogEntry> RandomizedIdempotencyTest::createUpdateSequence(
const UpdateSequenceGenerator& generator, const size_t length) {
// for each document enumerated & inserted generate a sequence of updates to apply to it.
std::vector<OplogEntry> updateSequence;
updateSequence.reserve(length);
for (size_t i = 0; i < length; i++) {
updateSequence.push_back(update(kDocId, generator.generateUpdate()));
}
return updateSequence;
}
std::string RandomizedIdempotencyTest::getStateString(const CollectionState& state1,
const CollectionState& state2,
const std::vector<OplogEntry>& ops) {
unittest::log() << IdempotencyTest::getStateString(state1, state2, ops);
StringBuilder sb;
sb << "Ran update ops: ";
sb << "[ ";
bool firstIter = true;
for (auto op : ops) {
if (!firstIter) {
sb << ", ";
} else {
firstIter = false;
}
sb << op.toString();
}
sb << " ]\n";
ASSERT_OK(resetState());
sb << "Start: " << getDoc() << "\n";
for (auto op : ops) {
ASSERT_OK(runOpInitialSync(op));
sb << "Apply: " << op.getObject() << "\n ==> " << getDoc() << "\n";
}
sb << "Found from the seed: " << this->seed;
return sb.str();
}
Status RandomizedIdempotencyTest::resetState() {
Status dropStatus = runOpInitialSync(dropCollection());
if (!dropStatus.isOK()) {
return dropStatus;
}
return runOpsInitialSync(initOps);
}
void RandomizedIdempotencyTest::runIdempotencyTestCase() {
ASSERT_OK(
ReplicationCoordinator::get(_opCtx.get())->setFollowerMode(MemberState::RS_RECOVERING));
std::set<StringData> fields{"a", "b"};
size_t depth = 1;
size_t length = 1;
// Eliminate the chance of a sub array, because they cause theoretically valid sequences that
// cause idempotency issues.
const double kScalarProbability = 0.375;
const double kDocProbability = 0.375;
const double kArrProbability = 0.0;
this->seed = SecureRandom::create()->nextInt64();
PseudoRandom seedGenerator(this->seed);
RandomizedScalarGenerator scalarGenerator{PseudoRandom(seedGenerator.nextInt64())};
UpdateSequenceGenerator updateGenerator(
{fields, depth, length, kScalarProbability, kDocProbability, kArrProbability},
PseudoRandom{seedGenerator.nextInt64()},
&scalarGenerator);
const bool kSkipDocs = kDocProbability == 0.0;
const bool kSkipArrs = kArrProbability == 0.0;
DocumentStructureEnumerator enumerator({fields, depth, length, kSkipDocs, kSkipArrs},
&scalarGenerator);
const size_t kUpdateSequenceLength = 5;
// For the sake of keeping the speed of iteration sane and feasible.
const size_t kNumUpdateSequencesPerDoc = 2;
for (auto doc : enumerator) {
BSONObj docWithId = (BSONObjBuilder(doc) << "_id" << kDocId).obj();
this->initOps = std::vector<OplogEntry>{createCollection(), insert(docWithId)};
for (size_t i = 0; i < kNumUpdateSequencesPerDoc; i++) {
std::vector<OplogEntry> updateSequence =
createUpdateSequence(updateGenerator, kUpdateSequenceLength);
testOpsAreIdempotent(updateSequence, SequenceType::kAnyPrefixOrSuffix);
}
}
}
TEST_F(RandomizedIdempotencyTest, CheckUpdateSequencesAreIdempotent) {
runIdempotencyTestCase();
}
} // namespace
} // namespace repl
} // namespace mongo
|
