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
|
/**
* Copyright (C) 2012 10gen Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* 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
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* 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 GNU Affero General 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.
*/
#define MONGO_LOG_DEFAULT_COMPONENT ::mongo::logger::LogComponent::kDefault
#include "mongo/platform/basic.h"
#include <stdexcept>
#include <string>
#include <vector>
#include "mongo/stdx/functional.h"
#include "mongo/stdx/thread.h"
#include "mongo/unittest/unittest.h"
#include "mongo/util/fail_point.h"
#include "mongo/util/log.h"
#include "mongo/util/time_support.h"
using mongo::FailPoint;
namespace stdx = mongo::stdx;
namespace mongo_test {
TEST(FailPoint, InitialState) {
FailPoint failPoint;
ASSERT_FALSE(failPoint.shouldFail());
}
TEST(FailPoint, AlwaysOn) {
FailPoint failPoint;
failPoint.setMode(FailPoint::alwaysOn);
ASSERT(failPoint.shouldFail());
MONGO_FAIL_POINT_BLOCK(failPoint, scopedFp) {
ASSERT(scopedFp.getData().isEmpty());
}
for (size_t x = 0; x < 50; x++) {
ASSERT(failPoint.shouldFail());
}
}
TEST(FailPoint, NTimes) {
FailPoint failPoint;
failPoint.setMode(FailPoint::nTimes, 4);
ASSERT(failPoint.shouldFail());
ASSERT(failPoint.shouldFail());
ASSERT(failPoint.shouldFail());
ASSERT(failPoint.shouldFail());
for (size_t x = 0; x < 50; x++) {
ASSERT_FALSE(failPoint.shouldFail());
}
}
TEST(FailPoint, BlockOff) {
FailPoint failPoint;
bool called = false;
MONGO_FAIL_POINT_BLOCK(failPoint, scopedFp) {
called = true;
}
ASSERT_FALSE(called);
}
TEST(FailPoint, BlockAlwaysOn) {
FailPoint failPoint;
failPoint.setMode(FailPoint::alwaysOn);
bool called = false;
MONGO_FAIL_POINT_BLOCK(failPoint, scopedFp) {
called = true;
}
ASSERT(called);
}
TEST(FailPoint, BlockNTimes) {
FailPoint failPoint;
failPoint.setMode(FailPoint::nTimes, 1);
size_t counter = 0;
for (size_t x = 0; x < 10; x++) {
MONGO_FAIL_POINT_BLOCK(failPoint, scopedFp) {
counter++;
}
}
ASSERT_EQUALS(1U, counter);
}
TEST(FailPoint, BlockWithException) {
FailPoint failPoint;
failPoint.setMode(FailPoint::alwaysOn);
bool threw = false;
try {
MONGO_FAIL_POINT_BLOCK(failPoint, scopedFp) {
throw std::logic_error("BlockWithException threw");
}
}
catch (const std::logic_error &) {
threw = true;
}
ASSERT(threw);
// This will get into an infinite loop if reference counter was not
// properly decremented
failPoint.setMode(FailPoint::off);
}
TEST(FailPoint, SetGetParam) {
FailPoint failPoint;
failPoint.setMode(FailPoint::alwaysOn, 0, BSON("x" << 20));
MONGO_FAIL_POINT_BLOCK(failPoint, scopedFp) {
ASSERT_EQUALS(20, scopedFp.getData()["x"].numberInt());
}
}
TEST(FailPoint, SetInvalidMode) {
FailPoint failPoint;
ASSERT_THROWS(failPoint.setMode(static_cast<FailPoint::Mode>(9999)),
mongo::UserException);
ASSERT_FALSE(failPoint.shouldFail());
ASSERT_THROWS(failPoint.setMode(static_cast<FailPoint::Mode>(-1)),
mongo::UserException);
ASSERT_FALSE(failPoint.shouldFail());
}
class FailPointStress: public mongo::unittest::Test {
public:
void setUp() {
_fp.setMode(FailPoint::alwaysOn, 0, BSON("a" << 44));
}
void tearDown() {
// Note: This can loop indefinitely if reference counter was off
_fp.setMode(FailPoint::off, 0, BSON("a" << 66));
}
void startTest() {
ASSERT_EQUALS(0U, _tasks.size());
_tasks.emplace_back(&FailPointStress::blockTask, this);
_tasks.emplace_back(&FailPointStress::blockWithExceptionTask, this);
_tasks.emplace_back(&FailPointStress::simpleTask, this);
_tasks.emplace_back(&FailPointStress::flipTask, this);
}
void stopTest() {
{
stdx::lock_guard<stdx::mutex> lk(_mutex);
_inShutdown = true;
}
for (auto& t : _tasks) {
t.join();
}
_tasks.clear();
}
private:
void blockTask() {
while (true) {
MONGO_FAIL_POINT_BLOCK(_fp, scopedFp) {
const mongo::BSONObj& data = scopedFp.getData();
// Expanded ASSERT_EQUALS since the error is not being
// printed out properly
if (data["a"].numberInt() != 44) {
mongo::error() << "blockTask thread detected anomaly"
<< " - data: " << data << std::endl;
ASSERT(false);
}
}
stdx::lock_guard<stdx::mutex> lk(_mutex);
if (_inShutdown)
break;
}
}
void blockWithExceptionTask() {
while (true) {
try {
MONGO_FAIL_POINT_BLOCK(_fp, scopedFp) {
const mongo::BSONObj& data = scopedFp.getData();
if (data["a"].numberInt() != 44) {
mongo::error() << "blockWithExceptionTask thread detected anomaly"
<< " - data: " << data << std::endl;
ASSERT(false);
}
throw std::logic_error("blockWithExceptionTask threw");
}
}
catch (const std::logic_error&) {
}
stdx::lock_guard<stdx::mutex> lk(_mutex);
if (_inShutdown)
break;
}
}
void simpleTask() {
while (true) {
static_cast<void>(MONGO_FAIL_POINT(_fp));
stdx::lock_guard<stdx::mutex> lk(_mutex);
if (_inShutdown)
break;
}
}
void flipTask() {
while (true) {
if(_fp.shouldFail()) {
_fp.setMode(FailPoint::off, 0);
}
else {
_fp.setMode(FailPoint::alwaysOn, 0, BSON("a" << 44));
}
stdx::lock_guard<stdx::mutex> lk(_mutex);
if (_inShutdown)
break;
}
}
FailPoint _fp;
std::vector<stdx::thread> _tasks;
stdx::mutex _mutex;
bool _inShutdown = false;
};
TEST_F(FailPointStress, Basic) {
startTest();
mongo::sleepsecs(30);
stopTest();
}
static void parallelFailPointTestThread(FailPoint* fp,
const int64_t numIterations,
const int32_t seed,
int64_t* outNumActivations) {
fp->setThreadPRNGSeed(seed);
int64_t numActivations = 0;
for (int64_t i = 0; i < numIterations; ++i) {
if (fp->shouldFail()) {
++numActivations;
}
}
*outNumActivations = numActivations;
}
/**
* Encounters a failpoint with the given fpMode and fpVal numEncountersPerThread
* times in each of numThreads parallel threads, and returns the number of total
* times that the failpoint was activiated.
*/
static int64_t runParallelFailPointTest(
FailPoint::Mode fpMode,
FailPoint::ValType fpVal,
const int32_t numThreads,
const int32_t numEncountersPerThread) {
ASSERT_GT(numThreads, 0);
ASSERT_GT(numEncountersPerThread, 0);
FailPoint failPoint;
failPoint.setMode(fpMode, fpVal);
std::vector<stdx::thread*> tasks;
std::vector<int64_t> counts(numThreads, 0);
ASSERT_EQUALS(static_cast<uint32_t>(numThreads), counts.size());
for (int32_t i = 0; i < numThreads; ++i) {
tasks.push_back(new stdx::thread(parallelFailPointTestThread,
&failPoint,
numEncountersPerThread,
i, // hardcoded seed, different for each thread.
&counts[i]));
}
int64_t totalActivations = 0;
for (int32_t i = 0; i < numThreads; ++i) {
tasks[i]->join();
delete tasks[i];
totalActivations += counts[i];
}
return totalActivations;
}
TEST(FailPoint, RandomActivationP0) {
ASSERT_EQUALS(0, runParallelFailPointTest(FailPoint::random, 0, 1, 1000000));
}
TEST(FailPoint, RandomActivationP5) {
ASSERT_APPROX_EQUAL(
500000,
runParallelFailPointTest(FailPoint::random,
std::numeric_limits<int32_t>::max() / 2,
10,
100000),
500);
}
TEST(FailPoint, RandomActivationP01) {
ASSERT_APPROX_EQUAL(
10000,
runParallelFailPointTest(FailPoint::random,
std::numeric_limits<int32_t>::max() / 100,
10,
100000),
500);
}
TEST(FailPoint, RandomActivationP001) {
ASSERT_APPROX_EQUAL(
1000,
runParallelFailPointTest(FailPoint::random,
std::numeric_limits<int32_t>::max() / 1000,
10,
100000),
500);
}
}
|