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 // - some threads constantly updating random values
80 // - one thread doing table scan with bulk fetch
81 // - one thread doing table scan without bulk fetch
82 // - some threads doing random point queries
83 //
84
85 if (verbose) printf("starting creation of pthreads\n");
86 const int num_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 myargs[i].operation = ptquery_op;
91 myargs[i].txn_flags |= DB_TXN_READ_ONLY;
92 }
93 run_workers(myargs, num_threads, cli_args->num_seconds, false, cli_args);
94 }
95
96 int
test_main(int argc,char * const argv[])97 test_main(int argc, char *const argv[]) {
98 struct cli_args args = get_default_args_for_perf();
99 parse_stress_test_args(argc, argv, &args);
100 perf_test_main(&args);
101 return 0;
102 }
103