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 // - update existing values in the dictionary with db->put(DB_YESOVERWRITE)
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.
64 //
65 // This test differs from stress2 in that it verifies the last value on an update.
66 //
67
68 static void
stress_table(DB_ENV * env,DB ** dbp,struct cli_args * cli_args)69 stress_table(DB_ENV *env, DB **dbp, struct cli_args *cli_args) {
70 int n = cli_args->num_elements;
71 //
72 // the threads that we want:
73 // - one thread constantly updating random values
74 // - one thread doing table scan with bulk fetch
75 // - one thread doing table scan without bulk fetch
76 // - one thread doing random point queries
77 //
78 if (verbose) printf("starting creation of pthreads\n");
79 const int num_threads = 4 + cli_args->num_update_threads + cli_args->num_ptquery_threads;
80 struct arg myargs[num_threads];
81 for (int i = 0; i < num_threads; i++) {
82 arg_init(&myargs[i], dbp, env, cli_args);
83 }
84
85 struct scan_op_extra soe[4];
86
87 // make the forward fast scanner
88 soe[0].fast = true;
89 soe[0].fwd = true;
90 soe[0].prefetch = false;
91 myargs[0].operation_extra = &soe[0];
92 myargs[0].operation = scan_op_no_check;
93
94 // make the forward slow scanner
95 soe[1].fast = false;
96 soe[1].fwd = true;
97 soe[1].prefetch = false;
98 myargs[1].operation_extra = &soe[1];
99 myargs[1].operation = scan_op_no_check;
100
101 // make the backward fast scanner
102 soe[2].fast = true;
103 soe[2].fwd = false;
104 soe[2].prefetch = false;
105 myargs[2].operation_extra = &soe[2];
106 myargs[2].operation = scan_op_no_check;
107
108 // make the backward slow scanner
109 soe[3].fast = false;
110 soe[3].fwd = false;
111 soe[3].prefetch = false;
112 myargs[3].operation_extra = &soe[3];
113 myargs[3].operation = scan_op_no_check;
114
115 // make the guy that updates the db
116 invariant(cli_args->num_update_threads == 1);
117 int *XCALLOC_N(n, update_history_buffer);
118 struct update_op_args uoe = get_update_op_args(cli_args, update_history_buffer);
119 myargs[4].operation = update_with_history_op;
120 myargs[4].operation_extra = &uoe;
121
122 // make the guys that do point queries
123 for (int i = 5; i < num_threads; i++) {
124 myargs[i].operation = ptquery_op;
125 }
126
127 run_workers(myargs, num_threads, cli_args->num_seconds, false, cli_args);
128
129 toku_free(update_history_buffer);
130 }
131
132 int
test_main(int argc,char * const argv[])133 test_main(int argc, char *const argv[]) {
134 struct cli_args args = get_default_args();
135 parse_stress_test_args(argc, argv, &args);
136 args.num_update_threads = 1; // if we had more than 1 update thread, we would need locking for the update_history_buffer.
137 stress_test_main(&args);
138 return 0;
139 }
140