1 /* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2 // vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
3 #ident "$Id$"
4 /*======
5 This file is part of PerconaFT.
6
7
8 Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved.
9
10 PerconaFT is free software: you can redistribute it and/or modify
11 it under the terms of the GNU General Public License, version 2,
12 as published by the Free Software Foundation.
13
14 PerconaFT is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
21
22 ----------------------------------------
23
24 PerconaFT is free software: you can redistribute it and/or modify
25 it under the terms of the GNU Affero General Public License, version 3,
26 as published by the Free Software Foundation.
27
28 PerconaFT is distributed in the hope that it will be useful,
29 but WITHOUT ANY WARRANTY; without even the implied warranty of
30 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
31 GNU Affero General Public License for more details.
32
33 You should have received a copy of the GNU Affero General Public License
34 along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
35 ======= */
36
37 #ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved."
38
39 #include "test.h"
40
41 #include <stdio.h>
42 #include <stdlib.h>
43
44 #include <toku_pthread.h>
45 #include <unistd.h>
46 #include <memory.h>
47 #include <sys/stat.h>
48 #include <db.h>
49
50 #include "threaded_stress_test_helpers.h"
51
52 //
53 // This test is a form of stress that does operations on a single dictionary:
54 // We create a dictionary bigger than the cachetable (around 4x greater).
55 // Then, we spawn a bunch of pthreads that do the following:
56 // - scan dictionary forward with bulk fetch
57 // - scan dictionary forward slowly
58 // - scan dictionary backward with bulk fetch
59 // - scan dictionary backward slowly
60 // - Grow the dictionary with insertions
61 // - do random point queries into the dictionary
62 // With the small cachetable, this should produce quite a bit of churn in reading in and evicting nodes.
63 // If the test runs to completion without crashing, we consider it a success. It also tests that snapshots
64 // work correctly by verifying that table scans sum their vals to 0.
65 //
66 // This does NOT test:
67 // - splits and merges
68 // - multiple DBs
69 //
70 // Variables that are interesting to tweak and run:
71 // - small cachetable
72 // - number of elements
73 //
74
75 static void
stress_table(DB_ENV * env,DB ** dbp,struct cli_args * cli_args)76 stress_table(DB_ENV *env, DB **dbp, struct cli_args *cli_args) {
77 //
78 // the threads that we want:
79 // - one thread constantly updating random values
80 // - one thread doing table scan with bulk fetch
81 // - one thread doing table scan without bulk fetch
82 // - one thread doing random point queries
83 //
84
85 if (verbose) printf("starting creation of pthreads\n");
86 const int num_threads = 4 + cli_args->num_update_threads + cli_args->num_ptquery_threads;
87 struct arg myargs[num_threads];
88 for (int i = 0; i < num_threads; i++) {
89 arg_init(&myargs[i], dbp, env, cli_args);
90 }
91 struct scan_op_extra soe[4];
92
93 // make the forward fast scanner
94 soe[0].fast = true;
95 soe[0].fwd = true;
96 soe[0].prefetch = false;
97 myargs[0].operation_extra = &soe[0];
98 myargs[0].operation = scan_op;
99
100 // make the forward slow scanner
101 soe[1].fast = false;
102 soe[1].fwd = true;
103 soe[1].prefetch = false;
104 myargs[1].operation_extra = &soe[1];
105 myargs[1].operation = scan_op;
106
107 // make the backward fast scanner
108 soe[2].fast = true;
109 soe[2].fwd = false;
110 soe[2].prefetch = false;
111 myargs[2].operation_extra = &soe[2];
112 myargs[2].operation = scan_op;
113
114 // make the backward slow scanner
115 soe[3].fast = false;
116 soe[3].fwd = false;
117 soe[3].prefetch = false;
118 myargs[3].operation_extra = &soe[3];
119 myargs[3].operation = scan_op;
120
121 struct update_op_args uoe = get_update_op_args(cli_args, NULL);
122 // make the guy that updates the db
123 for (int i = 4; i < 4 + cli_args->num_update_threads; ++i) {
124 myargs[i].operation_extra = &uoe;
125 myargs[i].operation = update_op;
126 myargs[i].do_prepare = true;
127 }
128
129 // make the guy that does point queries
130 for (int i = 4 + cli_args->num_update_threads; i < num_threads; i++) {
131 myargs[i].operation = ptquery_op;
132 myargs[i].do_prepare = true;
133 }
134
135 int num_seconds = random() % cli_args->num_seconds;
136 run_workers(myargs, num_threads, num_seconds, true, cli_args);
137 }
138
139 int
test_main(int argc,char * const argv[])140 test_main(int argc, char *const argv[]) {
141 struct cli_args args = get_default_args();
142 args.env_args.checkpointing_period = 1;
143 parse_stress_test_args(argc, argv, &args);
144 if (args.do_test_and_crash) {
145 stress_test_main(&args);
146 }
147 if (args.do_recover) {
148 stress_recover(&args);
149 }
150 return 0;
151 }
152