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 // stress test for update broadcast. 10M 8-byte keys should be 2, maybe 3
40 // levels of treeness, makes sure flushes work
41
42 #include "test.h"
43
44 const int envflags = DB_INIT_MPOOL|DB_CREATE|DB_THREAD |DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_TXN|DB_PRIVATE;
45
46 DB_ENV *env;
47
48 const unsigned int NUM_KEYS = 10000000;
49 const unsigned int MAGIC_EXTRA = 0x4ac0ffee;
50
_v(const unsigned int i)51 static inline unsigned int _v(const unsigned int i) { return 10 - i; }
_e(const unsigned int i)52 static inline unsigned int _e(const unsigned int i) { return i + 4; }
_u(const unsigned int v,const unsigned int e)53 static inline unsigned int _u(const unsigned int v, const unsigned int e) { return v + 2 * e; }
54
update_fun(DB * UU (db),const DBT * key,const DBT * old_val,const DBT * extra,void (* set_val)(const DBT * new_val,void * set_extra),void * set_extra)55 static int update_fun(DB *UU(db),
56 const DBT *key,
57 const DBT *old_val, const DBT *extra,
58 void (*set_val)(const DBT *new_val,
59 void *set_extra),
60 void *set_extra) {
61 unsigned int *k, *ov, *e, v;
62 assert(key->size == sizeof(*k));
63 CAST_FROM_VOIDP(k, key->data);
64 assert(old_val->size == sizeof(*ov));
65 CAST_FROM_VOIDP(ov, old_val->data);
66 assert(extra->size == sizeof(*e));
67 CAST_FROM_VOIDP(e, extra->data);
68 assert(*e == MAGIC_EXTRA);
69 v = _u(*ov, _e(*k));
70
71 {
72 DBT newval;
73 set_val(dbt_init(&newval, &v, sizeof(v)), set_extra);
74 }
75
76 return 0;
77 }
78
79 static int
int_cmp(DB * UU (db),const DBT * a,const DBT * b)80 int_cmp(DB *UU(db), const DBT *a, const DBT *b) {
81 unsigned int *ap, *bp;
82 assert(a->size == sizeof(*ap));
83 CAST_FROM_VOIDP(ap, a->data);
84 assert(b->size == sizeof(*bp));
85 CAST_FROM_VOIDP(bp, b->data);
86 return (*ap > *bp) - (*ap < *bp);
87 }
88
setup(void)89 static void setup (void) {
90 toku_os_recursive_delete(TOKU_TEST_FILENAME);
91 { int chk_r = toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(chk_r); }
92 { int chk_r = db_env_create(&env, 0); CKERR(chk_r); }
93 env->set_errfile(env, stderr);
94 env->set_update(env, update_fun);
95 { int chk_r = env->set_default_bt_compare(env, int_cmp); CKERR(chk_r); }
96 { int chk_r = env->open(env, TOKU_TEST_FILENAME, envflags, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(chk_r); }
97 }
98
cleanup(void)99 static void cleanup (void) {
100 { int chk_r = env->close(env, 0); CKERR(chk_r); }
101 }
102
do_inserts(DB_TXN * txn,DB * db)103 static int do_inserts(DB_TXN *txn, DB *db) {
104 int r = 0;
105 DBT key, val;
106 unsigned int i, v;
107 DBT *keyp = dbt_init(&key, &i, sizeof(i));
108 DBT *valp = dbt_init(&val, &v, sizeof(v));
109 for (i = 0; i < NUM_KEYS; ++i) {
110 v = _v(i);
111 r = db->put(db, txn, keyp, valp, 0); CKERR(r);
112 }
113 return r;
114 }
115
do_updates(DB_TXN * txn,DB * db)116 static int do_updates(DB_TXN *txn, DB *db) {
117 DBT extra;
118 unsigned int e = MAGIC_EXTRA;
119 DBT *extrap = dbt_init(&extra, &e, sizeof(e));
120 int r = db->update_broadcast(db, txn, extrap, 0); CKERR(r);
121 return r;
122 }
123
chk_updated(const unsigned int k,const unsigned int v)124 static void chk_updated(const unsigned int k, const unsigned int v) {
125 assert(v == _u(_v(k), _e(k)));
126 }
127
chk_original(const unsigned int k,const unsigned int v)128 static void chk_original(const unsigned int k, const unsigned int v) {
129 assert(v == _v(k));
130 }
131
do_verify_results(DB_TXN * txn,DB * db,void (* check_val)(const unsigned int k,const unsigned int v))132 static int do_verify_results(DB_TXN *txn, DB *db, void (*check_val)(const unsigned int k, const unsigned int v)) {
133 int r = 0;
134 DBT key, val;
135 unsigned int i, *vp;
136 DBT *keyp = dbt_init(&key, &i, sizeof(i));
137 DBT *valp = dbt_init(&val, NULL, 0);
138 for (i = 0; i < NUM_KEYS; ++i) {
139 r = db->get(db, txn, keyp, valp, 0); CKERR(r);
140 assert(val.size == sizeof(*vp));
141 CAST_FROM_VOIDP(vp, val.data);
142 check_val(i, *vp);
143 }
144 return r;
145 }
146
test_main(int argc,char * const argv[])147 int test_main(int argc, char * const argv[]) {
148 parse_args(argc, argv);
149 setup();
150
151 DB *db;
152
153 IN_TXN_COMMIT(env, NULL, txn_1, 0, {
154 { int chk_r = db_create(&db, env, 0); CKERR(chk_r); }
155 { int chk_r = db->open(db, txn_1, "foo.db", NULL, DB_BTREE, DB_CREATE, 0666); CKERR(chk_r); }
156
157 { int chk_r = do_inserts(txn_1, db); CKERR(chk_r); }
158 });
159
160 IN_TXN_ABORT(env, NULL, txn_2, 0, {
161 { int chk_r = do_updates(txn_2, db); CKERR(chk_r); }
162
163 IN_TXN_COMMIT(env, txn_2, txn_21, 0, {
164 { int chk_r = do_verify_results(txn_21, db, chk_updated); CKERR(chk_r); }
165 });
166 });
167
168 IN_TXN_COMMIT(env, NULL, txn_3, 0, {
169 { int chk_r = do_verify_results(txn_3, db, chk_original); CKERR(chk_r); }
170 });
171
172 { int chk_r = db->close(db, 0); CKERR(chk_r); }
173
174 cleanup();
175
176 return 0;
177 }
178