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 sends periodic update broadcasts.
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     //
71     // the threads that we want:
72     //   - one thread constantly updating random values
73     //   - one thread doing table scan with bulk fetch
74     //   - one thread doing table scan without bulk fetch
75     //   - one thread doing random point queries
76     //
77     if (verbose) printf("starting creation of pthreads\n");
78     const int num_threads = 5 + cli_args->num_update_threads + cli_args->num_ptquery_threads;
79     struct arg myargs[num_threads];
80     for (int i = 0; i < num_threads; i++) {
81         arg_init(&myargs[i], dbp, env, cli_args);
82     }
83 
84     struct scan_op_extra soe[4];
85 
86     // make the forward fast scanner
87     soe[0].fast = true;
88     soe[0].fwd = true;
89     soe[0].prefetch = false;
90     myargs[0].operation_extra = &soe[0];
91     myargs[0].operation = scan_op;
92 
93     // make the forward slow scanner
94     soe[1].fast = false;
95     soe[1].fwd = true;
96     soe[1].prefetch = false;
97     myargs[1].operation_extra = &soe[1];
98     myargs[1].operation = scan_op;
99     myargs[1].txn_flags = DB_TXN_SNAPSHOT | DB_TXN_READ_ONLY;
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;
107     myargs[2].txn_flags = DB_TXN_SNAPSHOT | DB_TXN_READ_ONLY;
108 
109     // make the backward slow scanner
110     soe[3].fast = false;
111     soe[3].fwd = false;
112     soe[3].prefetch = false;
113     myargs[3].operation_extra = &soe[3];
114     myargs[3].operation = scan_op;
115 
116     struct update_op_args uoe = get_update_op_args(cli_args, NULL);
117     // make the guy that updates the db
118     for (int i = 4; i < 4 + cli_args->num_update_threads; ++i) {
119         myargs[i].operation_extra = &uoe;
120         myargs[i].lock_type = STRESS_LOCK_SHARED;
121         myargs[i].operation = update_op;
122     }
123 
124     // make the guy that sends update broadcasts
125     myargs[4 + cli_args->num_update_threads].lock_type = STRESS_LOCK_EXCL;
126     myargs[4 + cli_args->num_update_threads].sleep_ms = cli_args->update_broadcast_period_ms;
127     myargs[4 + cli_args->num_update_threads].operation = update_broadcast_op;
128 
129     // make the guys that do point queries
130     for (int i = 5 + cli_args->num_update_threads; i < num_threads; i++) {
131         myargs[i].operation = ptquery_op;
132     }
133 
134     run_workers(myargs, num_threads, cli_args->num_seconds, false, cli_args);
135 }
136 
137 int
test_main(int argc,char * const argv[])138 test_main(int argc, char *const argv[]) {
139     struct cli_args args = get_default_args();
140     parse_stress_test_args(argc, argv, &args);
141     stress_test_main(&args);
142     return 0;
143 }
144