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
|
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
#ident "$Id$"
/*======
This file is part of PerconaFT.
Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved.
PerconaFT is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2,
as published by the Free Software Foundation.
PerconaFT 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
----------------------------------------
PerconaFT 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.
PerconaFT 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 PerconaFT. If not, see <http://www.gnu.org/licenses/>.
======= */
#ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved."
#include "test.h"
#include "toku_pthread.h"
#include <db.h>
#include <sys/stat.h>
#include "checkpoint_test.h"
static const uint64_t max_cachesize = 256 << 20;
static const int NUM_DICTIONARIES = 1;
static const int OPER_STEPS = 6;
static const int ITERATIONS_PER_CRASH_IN_RECOVERY = 7;
typedef enum __recovery_stress_steps
{
PRE_PRE_STEP = 0,
PRE_CP_STEP,
PRE_POST_STEP,
CP_CP_STEP,
CP_POST_STEP,
POST_POST_STEP
} STEP;
//const int OPER_PER_STEP = 331;
const int OPER_PER_STEP = 43;
#define OPER_PER_ITER ( OPER_STEPS * OPER_PER_STEP )
#define DBG(str) if (verbose) printf("%s:%25s: %s\n", __FILE__, __FUNCTION__, str)
#define iDBG(iter) if (verbose) printf("%s:%25s: iter = %d\n", __FILE__, __FUNCTION__, iter)
static int firstkey(int iter, int step) { return (iter * OPER_PER_ITER) + (step * OPER_PER_STEP); }
//static toku_pthread_t thread;
static void
drop_dead(void) {
// deliberate zerodivide or sigsegv
#if 0
fprintf(stderr, "HAPPY CRASH\n");
#endif
fflush(stdout);
fflush(stderr);
int zero = 0;
int infinity = 1/zero;
printf("Survived zerodivide!\n");
fflush(stdout);
printf("Infinity = %d\n", infinity);
fflush(stdout);
void * intothevoid = NULL;
(*(int*)intothevoid)++;
printf("intothevoid = %p, infinity = %d\n", intothevoid, infinity);
printf("This line should never be printed\n");
fflush(stdout);
}
static void drop_dead_callback_f(void *dummy UU()) {
drop_dead();
}
static void verify (DICTIONARY dictionaries, int iter) {
int i, key;
DB *db;
// iDBG(iter);
for (i=0;i<NUM_DICTIONARIES;i++) {
db = dictionaries[i].db;
if (iter == 1) {
key = firstkey(iter - 1, 0);
verify_sequential_rows(db, key, OPER_PER_ITER);
}
else if (iter == 2) {
key = firstkey(iter - 2, 0);
verify_sequential_rows(db, key, OPER_PER_ITER * 2);
}
else if (iter == 3) {
key = firstkey(iter - 3, 0);
verify_sequential_rows(db, key, OPER_PER_ITER * 3);
}
else if (iter > 3) {
key = firstkey(iter - 4, 0);
verify_sequential_rows(db, key, OPER_PER_ITER * 4);
}
}
return;
}
struct iteration_spec {
DICTIONARY dictionaries;
int iter;
STEP step;
DB_TXN *pre_pre_insert_commit;
DB_TXN *pre_cp_insert_commit;
DB_TXN *pre_post_insert_commit;
DB_TXN *cp_cp_insert_commit;
DB_TXN *cp_post_insert_commit;
DB_TXN *post_post_insert_commit;
DB_TXN *pre_pre_insert_abort;
DB_TXN *pre_cp_insert_abort;
DB_TXN *pre_post_insert_abort;
DB_TXN *cp_cp_insert_abort;
DB_TXN *cp_post_insert_abort;
DB_TXN *post_post_insert_abort;
DB_TXN *pre_insert_incmplt;
DB_TXN *cp_insert_incmplt;
DB_TXN *post_insert_incmplt;
DB_TXN *pre_pre_delete_commit;
DB_TXN *pre_cp_delete_commit;
DB_TXN *pre_post_delete_commit;
DB_TXN *cp_cp_delete_commit;
DB_TXN *cp_post_delete_commit;
DB_TXN *post_post_delete_commit;
DB_TXN *pre_pre_delete_abort;
DB_TXN *pre_cp_delete_abort;
DB_TXN *pre_post_delete_abort;
DB_TXN *cp_cp_delete_abort;
DB_TXN *cp_post_delete_abort;
DB_TXN *post_post_delete_abort;
DB_TXN *pre_delete_incmplt;
DB_TXN *cp_delete_incmplt;
DB_TXN *post_delete_incmplt;
};
typedef struct iteration_spec *ITER_SPEC;
static void pre_checkpoint_acts(ITER_SPEC spec) {
int i;
DB *db;
DICTIONARY dictionaries = spec->dictionaries;
int iter = spec->iter;
assert(spec->step == PRE_PRE_STEP);
int key;
int r;
// iDBG(iter);
for (i=0;i<NUM_DICTIONARIES;i++) {
db = dictionaries[i].db;
// ---- GOOD INSERTIONS FOR THIS ITERATION ----
// begin pre, commit pre
key = firstkey(iter, PRE_PRE_STEP);
r = env->txn_begin(env, NULL, &spec->pre_pre_insert_commit, 0); CKERR(r);
insert_n_fixed(db, NULL, spec->pre_pre_insert_commit, key, OPER_PER_STEP);
r = spec->pre_pre_insert_commit->commit(spec->pre_pre_insert_commit, 0); CKERR(r);
// begin pre, commit cp, post
key = firstkey(iter, PRE_CP_STEP);
r = env->txn_begin(env, NULL, &spec->pre_cp_insert_commit, 0); CKERR(r);
insert_n_fixed(db, NULL, spec->pre_cp_insert_commit, key, OPER_PER_STEP);
key = firstkey(iter, PRE_POST_STEP);
r = env->txn_begin(env, NULL, &spec->pre_post_insert_commit, 0); CKERR(r);
insert_n_fixed(db, NULL, spec->pre_post_insert_commit, key, OPER_PER_STEP);
// ---- ABORTED INSERTIONS THAT WOULD OVERWRITE PREVIOUS ITERATION ----
if ( iter > 0 ) {
// begin pre, abort pre
key = firstkey(iter - 1, PRE_PRE_STEP);
r = env->txn_begin(env, NULL, &spec->pre_pre_insert_abort, 0); CKERR(r);
insert_n_broken(db, NULL, spec->pre_pre_insert_abort, key, OPER_PER_STEP);
r = spec->pre_pre_insert_abort->abort(spec->pre_pre_insert_abort); CKERR(r);
// begin pre, abort cp, post
key = firstkey(iter - 1, PRE_CP_STEP);
r = env->txn_begin(env, NULL, &spec->pre_cp_insert_abort, 0); CKERR(r);
insert_n_broken(db, NULL, spec->pre_cp_insert_abort, key, OPER_PER_STEP);
key = firstkey(iter - 1, PRE_POST_STEP);
r = env->txn_begin(env, NULL, &spec->pre_post_insert_abort, 0); CKERR(r);
insert_n_broken(db, NULL, spec->pre_post_insert_abort, key, OPER_PER_STEP);
}
// ---- INCOMPLETE INSERTIONS THAT WOULD OVERWRITE I-2 ITERATIONS AGO ----
if ( iter > 1 ) {
// begin pre, incomplete
key = firstkey(iter - 2, PRE_PRE_STEP);
r = env->txn_begin(env, NULL, &spec->pre_insert_incmplt, 0); CKERR(r);
insert_n_broken(db, NULL, spec->pre_insert_incmplt, key, OPER_PER_STEP);
}
// ---- ABORTED DELETES THAT WOULD DELETE I-3 ITERATIONS AGO ----
if ( iter > 2 ) {
// begin pre, abort pre
key = firstkey(iter - 3, PRE_PRE_STEP);
r = env->txn_begin(env, NULL, &spec->pre_pre_delete_abort, 0); CKERR(r);
delete_n(db, NULL, spec->pre_pre_delete_abort, key, OPER_PER_STEP, 0);
r = spec->pre_pre_delete_abort->abort(spec->pre_pre_delete_abort); CKERR(r);
// begin pre, abort cp, post
key = firstkey(iter - 3, PRE_CP_STEP);
r = env->txn_begin(env, NULL, &spec->pre_cp_delete_abort, 0); CKERR(r);
insert_n_broken(db, NULL, spec->pre_cp_delete_abort, key, OPER_PER_STEP);
key = firstkey(iter - 3, PRE_POST_STEP);
r = env->txn_begin(env, NULL, &spec->pre_post_delete_abort, 0); CKERR(r);
insert_n_broken(db, NULL, spec->pre_post_delete_abort, key, OPER_PER_STEP);
}
// ---- INCOMPLETE DELETES THAT WOULD DELETE I-4 ITERATIONS AGO ----
if ( iter > 3 ) {
// begin pre, incomplete
key = firstkey(iter - 4, PRE_PRE_STEP);
r = env->txn_begin(env, NULL, &spec->pre_delete_incmplt, 0); CKERR(r);
delete_n(db, NULL, spec->pre_delete_incmplt, key, OPER_PER_STEP, 0);
}
// ---- GOOD DELETES THAT REMOVE I-5 ITERATIONS AGO ----
if ( iter > 4 ) {
// begin pre, commit pre
key = firstkey(iter - 5, PRE_PRE_STEP);
r = env->txn_begin(env, NULL, &spec->pre_pre_delete_commit, 0); CKERR(r);
delete_n(db, NULL, spec->pre_pre_delete_commit, key, OPER_PER_STEP, 0);
r = spec->pre_pre_delete_commit->commit(spec->pre_pre_delete_commit, 0); CKERR(r);
// begin pre, commit cp, post
key = firstkey(iter - 5, PRE_CP_STEP);
r = env->txn_begin(env, NULL, &spec->pre_cp_delete_commit, 0); CKERR(r);
delete_n(db, NULL, spec->pre_cp_delete_commit, key, OPER_PER_STEP, 0);
key = firstkey(iter - 5, PRE_POST_STEP);
r = env->txn_begin(env, NULL, &spec->pre_post_delete_commit, 0); CKERR(r);
delete_n(db, NULL, spec->pre_post_delete_commit, key, OPER_PER_STEP, 0);
}
}
return;
}
static void checkpoint_acts(ITER_SPEC spec) {
int i, r, key;
DB *db;
int iter = spec->iter;
DICTIONARY dictionaries = spec->dictionaries;
assert(spec->step == CP_CP_STEP);
// iDBG(iter);
for (i=0;i<NUM_DICTIONARIES;i++) {
db = dictionaries[i].db;
// ---- GOOD INSERTIONS FOR THIS ITERATION ----
// begin pre, commit cp
r = spec->pre_cp_insert_commit->commit(spec->pre_cp_insert_commit, 0); CKERR(r);
// begin cp, commit cp
key = firstkey(iter, CP_CP_STEP);
r = env->txn_begin(env, NULL, &spec->cp_cp_insert_commit, 0); CKERR(r);
insert_n_fixed(db, NULL, spec->cp_cp_insert_commit, key, OPER_PER_STEP);
r = spec->cp_cp_insert_commit->commit(spec->cp_cp_insert_commit, 0); CKERR(r);
// begin cp, commit post
key = firstkey(iter, CP_POST_STEP);
r = env->txn_begin(env, NULL, &spec->cp_post_insert_commit, 0); CKERR(r);
insert_n_fixed(db, NULL, spec->cp_post_insert_commit, key, OPER_PER_STEP);
// ---- ABORTED INSERTIONS THAT WOULD OVERWRITE PREVIOUS ITERATION ----
if ( iter > 0 ) {
// begin pre, abort cp
r = spec->pre_cp_insert_abort->abort(spec->pre_cp_insert_abort); CKERR(r);
// begin cp, abort cp
key = firstkey(iter - 1, CP_CP_STEP);
r = env->txn_begin(env, NULL, &spec->cp_cp_insert_abort, 0); CKERR(r);
insert_n_broken(db, NULL, spec->cp_cp_insert_abort, key, OPER_PER_STEP);
r = spec->cp_cp_insert_abort->abort(spec->cp_cp_insert_abort); CKERR(r);
// begin cp, abort post
key = firstkey(iter - 1, CP_POST_STEP);
r = env->txn_begin(env, NULL, &spec->cp_post_insert_abort, 0); CKERR(r);
insert_n_broken(db, NULL, spec->cp_post_insert_abort, key, OPER_PER_STEP);
}
// ---- INCOMPLETE INSERTIONS THAT WOULD OVERWRITE I-2 ITERATIONS AGO ----
if ( iter > 1 ) {
// begin cp, incomplete
key = firstkey(iter - 2, CP_CP_STEP);
r = env->txn_begin(env, NULL, &spec->cp_insert_incmplt, 0); CKERR(r);
insert_n_broken(db, NULL, spec->cp_insert_incmplt, key, OPER_PER_STEP);
}
// ---- ABORTED DELETES THAT WOULD DELETE I-3 ITERATIONS AGO ----
if ( iter > 2 ) {
// begin pre, abort cp
r = spec->pre_cp_delete_abort->abort(spec->pre_cp_delete_abort); CKERR(r);
// begin cp, abort cp
key = firstkey(iter - 3, CP_CP_STEP);
r = env->txn_begin(env, NULL, &spec->cp_cp_delete_abort, 0); CKERR(r);
delete_n(db, NULL, spec->cp_cp_delete_abort, key, OPER_PER_STEP, 0);
r = spec->cp_cp_delete_abort->abort(spec->cp_cp_delete_abort); CKERR(r);
// begin cp, abort post
key = firstkey(iter - 3, CP_POST_STEP);
r = env->txn_begin(env, NULL, &spec->cp_post_delete_abort, 0); CKERR(r);
insert_n_broken(db, NULL, spec->cp_post_delete_abort, key, OPER_PER_STEP);
}
// ---- INCOMPLETE DELETES THAT WOULD DELETE I-4 ITERATIONS AGO ----
if ( iter > 3 ) {
// begin pre, incomplete
key = firstkey(iter - 4, CP_CP_STEP);
r = env->txn_begin(env, NULL, &spec->cp_delete_incmplt, 0); CKERR(r);
delete_n(db, NULL, spec->cp_delete_incmplt, key, OPER_PER_STEP, 0);
}
// ---- GOOD DELETES THAT REMOVE I-5 ITERATIONS AGO ----
if ( iter > 4 ) {
// begin pre, commit cp
r = spec->pre_cp_delete_commit->commit(spec->pre_cp_delete_commit, 0); CKERR(r);
// begin cp, commit cp
key = firstkey(iter - 5, CP_CP_STEP);
r = env->txn_begin(env, NULL, &spec->cp_cp_delete_commit, 0); CKERR(r);
delete_n(db, NULL, spec->cp_cp_delete_commit, key, OPER_PER_STEP, 0);
r = spec->cp_cp_delete_commit->commit(spec->cp_cp_delete_commit, 0); CKERR(r);
// begin cp, commit post
key = firstkey(iter - 5, CP_POST_STEP);
r = env->txn_begin(env, NULL, &spec->cp_post_delete_commit, 0); CKERR(r);
delete_n(db, NULL, spec->cp_post_delete_commit, key, OPER_PER_STEP, 0);
}
}
return;
}
static void post_checkpoint_acts(ITER_SPEC spec) {
int i, r, key;
DB *db;
int iter = spec->iter;
DICTIONARY dictionaries = spec->dictionaries;
assert(spec->step == POST_POST_STEP);
// iDBG(iter);
for (i=0;i<NUM_DICTIONARIES;i++) {
db = dictionaries[i].db;
// ---- GOOD INSERTIONS FOR THIS ITERATION ----
// begin pre, commit post
r = spec->pre_post_insert_commit->commit(spec->pre_post_insert_commit, 0); CKERR(r);
// begin cp, commit post
r = spec->cp_post_insert_commit->commit(spec->cp_post_insert_commit, 0); CKERR(r);
// begin post, commit post
key = firstkey(iter, POST_POST_STEP);
r = env->txn_begin(env, NULL, &spec->post_post_insert_commit, 0); CKERR(r);
insert_n_fixed(db, NULL, spec->post_post_insert_commit, key, OPER_PER_STEP);
r = spec->post_post_insert_commit->commit(spec->post_post_insert_commit, 0); CKERR(r);
// ---- ABORTED INSERTIONS THAT WOULD OVERWRITE PREVIOUS ITERATION ----
if ( iter > 0 ) {
// begin pre, abort post
r = spec->pre_post_insert_abort->abort(spec->pre_post_insert_abort); CKERR(r);
// begin cp, abort post
r = spec->cp_post_insert_abort->abort(spec->cp_post_insert_abort); CKERR(r);
// begin post, abort post
key = firstkey(iter - 1, POST_POST_STEP);
r = env->txn_begin(env, NULL, &spec->post_post_insert_abort, 0); CKERR(r);
insert_n_broken(db, NULL, spec->post_post_insert_abort, key, OPER_PER_STEP);
r = spec->post_post_insert_abort->abort(spec->post_post_insert_abort); CKERR(r);
}
// ---- INCOMPLETE INSERTIONS THAT WOULD OVERWRITE I-2 ITERATIONS AGO ----
if ( iter > 1 ) {
// begin post, incomplete
key = firstkey(iter - 2, POST_POST_STEP);
r = env->txn_begin(env, NULL, &spec->post_insert_incmplt, 0); CKERR(r);
insert_n_broken(db, NULL, spec->post_insert_incmplt, key, OPER_PER_STEP);
}
// ---- ABORTED DELETES THAT WOULD DELETE I-3 ITERATIONS AGO ----
if ( iter > 2 ) {
// begin pre, abort post
r = spec->pre_post_delete_abort->abort(spec->pre_post_delete_abort); CKERR(r);
// begin cp, abort post
r = spec->cp_post_delete_abort->abort(spec->cp_post_delete_abort); CKERR(r);
// begin post, abort post
key = firstkey(iter - 3, POST_POST_STEP);
r = env->txn_begin(env, NULL, &spec->post_post_delete_abort, 0); CKERR(r);
delete_n(db, NULL, spec->post_post_delete_abort, key, OPER_PER_STEP, 0);
r = spec->post_post_delete_abort->abort(spec->post_post_delete_abort); CKERR(r);
}
// ---- INCOMPLETE DELETES THAT WOULD DELETE I-4 ITERATIONS AGO ----
if ( iter > 3 ) {
// begin post, incomplete
key = firstkey(iter - 4, POST_POST_STEP);
r = env->txn_begin(env, NULL, &spec->post_delete_incmplt, 0); CKERR(r);
delete_n(db, NULL, spec->post_delete_incmplt, key, OPER_PER_STEP, 0);
}
// ---- GOOD DELETES THAT REMOVE I-5 ITERATIONS AGO ----
if ( iter > 4 ) {
// begin pre, commit post
r = spec->pre_post_delete_commit->commit(spec->pre_post_delete_commit, 0); CKERR(r);
// begin cp, commit post
r = spec->cp_post_delete_commit->commit(spec->cp_post_delete_commit, 0); CKERR(r);
// begin post, commit post
key = firstkey(iter - 5, CP_CP_STEP);
r = env->txn_begin(env, NULL, &spec->post_post_delete_commit, 0); CKERR(r);
delete_n(db, NULL, spec->post_post_delete_commit, key, OPER_PER_STEP, 0);
r = spec->post_post_delete_commit->commit(spec->post_post_delete_commit, 0); CKERR(r);
}
}
return;
}
static void run_test (int iter) {
uint32_t flags = 0;
int i, r;
if (iter == 0)
dir_create(TOKU_TEST_FILENAME); // create directory if first time through
// Run with cachesize of 256 bytes per iteration
// to force lots of disk I/O
// (each iteration inserts about 4K rows/dictionary, 16 bytes/row, 4 dictionaries = 256K bytes inserted per iteration)
uint64_t cachebytes = 0; // 0 => use default size
const int32_t K256 = 256 * 1024;
cachebytes = K256 * (iter + 1) - (128 * 1024);
if (cachebytes > max_cachesize)
cachebytes = 0;
if (iter & 2) cachebytes = 0; // use default cachesize half the time
if (verbose) printf("%s: iter = %d\n", __FILE__, iter);
int recovery_flags = DB_INIT_LOG|DB_INIT_TXN;
if ( iter != 0 )
recovery_flags += DB_RECOVER;
// crash somewhat frequently during recovery
// first, wait until after the system is primed
if ( iter > ITERATIONS_PER_CRASH_IN_RECOVERY + 5 ) {
// every N cycles, crash in recovery
if ( (iter % ITERATIONS_PER_CRASH_IN_RECOVERY) == 0 ) {
// crash at different places in recovery
if ( iter & 1 )
db_env_set_recover_callback(drop_dead_callback_f, NULL);
else
db_env_set_recover_callback2(drop_dead_callback_f, NULL);
}
}
env_startup(TOKU_TEST_FILENAME, cachebytes, recovery_flags);
// logic below counts on a mapping of 'iter' to dictionary values
// since crashes in recovery do not modify dictionary values
// need to adjust 'iter' to be iter of successful recoveries
int crashes_in_recovery = (iter / ITERATIONS_PER_CRASH_IN_RECOVERY) - ( ( ITERATIONS_PER_CRASH_IN_RECOVERY + 5 ) / ITERATIONS_PER_CRASH_IN_RECOVERY );
if ( crashes_in_recovery > 0 ) {
iter = iter - crashes_in_recovery;
}
// create array of dictionaries
// for each dictionary verify previous iterations and perform new inserts
DICTIONARY_S dictionaries[NUM_DICTIONARIES];
for (i = 0; i < NUM_DICTIONARIES; i++) {
char name[32];
sprintf(name, "stress_%d", i);
init_dictionary(&dictionaries[i], flags, name);
db_startup(&dictionaries[i], NULL);
}
// verify previous results
verify(dictionaries, iter);
struct iteration_spec spec;
spec.iter = iter;
spec.dictionaries = dictionaries;
spec.step = PRE_PRE_STEP;
// perform pre-checkpoint actions
pre_checkpoint_acts(&spec);
// perform checkpoint acts
spec.step = CP_CP_STEP;
if ( iter & 1 )
db_env_set_checkpoint_callback((void (*)(void*))checkpoint_acts, &spec);
else
db_env_set_checkpoint_callback2((void (*)(void*))checkpoint_acts, &spec);
r = env->txn_checkpoint(env, 0, 0, 0);
CKERR(r);
db_env_set_checkpoint_callback(NULL, NULL);
db_env_set_checkpoint_callback2(NULL, NULL);
// post checkpoint acts
spec.step = POST_POST_STEP;
post_checkpoint_acts(&spec);
// if requesting crash, randomly do other non-committed acts, then "drop_dead"
if (iter > 0) {
if (verbose)
printf("dying\n");
uint32_t delay = myrandom();
delay &= 0xFFF; // select lower 12 bits, shifted up 8 for random number ...
delay = delay << 8; // ... uniformly distributed between 0 and 1M ...
usleep(delay); // ... to sleep up to one second (1M usec)
drop_dead();
}
for (i = 0; i < NUM_DICTIONARIES; i++) {
db_shutdown(&dictionaries[i]);
}
r = env->close(env, 0);
assert((r == 0) || (r == EINVAL)); // OK to have open transactions prior to close
}
// ------------ infrastructure ----------
static void do_args(int argc, char *const argv[]);
static int iter_arg = 0;
int test_main(int argc, char *const*argv) {
do_args(argc, argv);
run_test(iter_arg);
return 0;
}
static void do_args(int argc, char *const argv[]) {
int resultcode;
char *cmd = argv[0];
argc--; argv++;
while (argc>0) {
if (strcmp(argv[0], "-v") == 0) {
verbose++;
} else if (strcmp(argv[0],"-q")==0) {
verbose--;
if (verbose<0) verbose=0;
} else if (strcmp(argv[0], "-h")==0) {
resultcode=0;
do_usage:
fprintf(stderr, "Usage:\n%s [-v|-q]* [-h] [-i] [-C] \n", cmd);
exit(resultcode);
} else if (strcmp(argv[0], "-i")==0) {
argc--; argv++;
iter_arg = atoi(argv[0]);
} else {
fprintf(stderr, "Unknown arg: %s\n", argv[0]);
resultcode=1;
goto do_usage;
}
argc--;
argv++;
}
}
|