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
checkpoint_var(DB_TXN * txn,ARG arg,void * operation_extra,void * stats_extra)75 static int checkpoint_var(DB_TXN *txn, ARG arg, void* operation_extra, void *stats_extra) {
76 int db_index = random() % arg->cli->num_DBs;
77 int r = 0;
78 int val_size = *(int *)operation_extra;
79 DB* db = arg->dbp[db_index];
80 char data[val_size];
81 memset(data, 0, sizeof(data));
82 int i;
83 for (i = 0; i < 10; i++) {
84 // do point queries
85 ptquery_and_maybe_check_op(db, txn, arg, false);
86 }
87 increment_counter(stats_extra, PTQUERIES, i);
88 for (i = 0; i < 20; i++) {
89 // do a random insertion
90 int rand_key = random() % arg->cli->num_elements;
91 DBT key, val;
92 r = db->put(
93 db,
94 txn,
95 dbt_init(&key, &rand_key, sizeof(rand_key)),
96 dbt_init(&val, data, sizeof(data)),
97 0);
98 if (r != 0) {
99 goto cleanup;
100 }
101 }
102 cleanup:
103 increment_counter(stats_extra, PUTS, i);
104 return r;
105 }
106
107
108 static void
stress_table(DB_ENV * env,DB ** dbp,struct cli_args * cli_args)109 stress_table(DB_ENV* env, DB** dbp, struct cli_args *cli_args) {
110 //
111 // the threads that we want:
112 // - some threads constantly updating random values
113 // - one thread doing table scan with bulk fetch
114 // - one thread doing table scan without bulk fetch
115 // - some threads doing random point queries
116 //
117
118 if (verbose) printf("starting creation of pthreads\n");
119 int val_size = cli_args->val_size;
120 const int num_threads = cli_args->num_ptquery_threads;
121 struct arg myargs[num_threads];
122 for (int i = 0; i < num_threads; i++) {
123 arg_init(&myargs[i], dbp, env, cli_args);
124 }
125 for (int i = 0; i < num_threads; i++) {
126 myargs[i].operation = checkpoint_var;
127 myargs[i].operation_extra = &val_size;
128 }
129 run_workers(myargs, num_threads, cli_args->num_seconds, false, cli_args);
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_for_perf();
135 args.env_args.checkpointing_period = 30;
136 args.num_DBs = 4;
137 args.num_ptquery_threads = 4;
138 args.crash_on_operation_failure = false;
139 parse_stress_test_args(argc, argv, &args);
140 stress_test_main(&args);
141 return 0;
142 }
143