1
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
5
COPYING CONDITIONS NOTICE:
7
This program is free software; you can redistribute it and/or modify
8
it under the terms of version 2 of the GNU General Public License as
9
published by the Free Software Foundation, and provided that the
10
following conditions are met:
12
* Redistributions of source code must retain this COPYING
13
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
14
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
15
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
18
* Redistributions in binary form must reproduce this COPYING
19
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
20
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
21
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
22
GRANT (below) in the documentation and/or other materials
23
provided with the distribution.
25
You should have received a copy of the GNU General Public License
26
along with this program; if not, write to the Free Software
27
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
32
TokuDB, Tokutek Fractal Tree Indexing Library.
33
Copyright (C) 2007-2013 Tokutek, Inc.
37
This program is distributed in the hope that it will be useful, but
38
WITHOUT ANY WARRANTY; without even the implied warranty of
39
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
40
General Public License for more details.
42
UNIVERSITY PATENT NOTICE:
44
The technology is licensed by the Massachusetts Institute of
45
Technology, Rutgers State University of New Jersey, and the Research
46
Foundation of State University of New York at Stony Brook under
47
United States of America Serial No. 11/760379 and to the patents
48
and/or patent applications resulting from it.
50
PATENT MARKING NOTICE:
52
This software is covered by US Patent No. 8,185,551.
53
This software is covered by US Patent No. 8,489,638.
57
"THIS IMPLEMENTATION" means the copyrightable works distributed by
58
Tokutek as part of the Fractal Tree project.
60
"PATENT CLAIMS" means the claims of patents that are owned or
61
licensable by Tokutek, both currently or in the future; and that in
62
the absence of this license would be infringed by THIS
63
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
65
"PATENT CHALLENGE" shall mean a challenge to the validity,
66
patentability, enforceability and/or non-infringement of any of the
67
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
69
Tokutek hereby grants to you, for the term and geographical scope of
70
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
71
irrevocable (except as stated in this section) patent license to
72
make, have made, use, offer to sell, sell, import, transfer, and
73
otherwise run, modify, and propagate the contents of THIS
74
IMPLEMENTATION, where such license applies only to the PATENT
75
CLAIMS. This grant does not include claims that would be infringed
76
only as a consequence of further modifications of THIS
77
IMPLEMENTATION. If you or your agent or licensee institute or order
78
or agree to the institution of patent litigation against any entity
79
(including a cross-claim or counterclaim in a lawsuit) alleging that
80
THIS IMPLEMENTATION constitutes direct or contributory patent
81
infringement, or inducement of patent infringement, then any rights
82
granted to you under this License shall terminate as of the date
83
such litigation is filed. If you or your agent or exclusive
84
licensee institute or order or agree to the institution of a PATENT
85
CHALLENGE, then Tokutek may terminate any rights granted to you
89
#ident "Copyright (c) 2007-2013 Tokutek Inc. All rights reserved."
90
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."
93
// verify recovery of an update log entry which changes values at keys
95
static const int envflags = DB_INIT_MPOOL|DB_CREATE|DB_THREAD|DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_TXN|DB_PRIVATE;
96
static const unsigned int NUM_KEYS = 100;
98
static inline bool should_update(const unsigned int k) { return k % 3 == 0; }
100
static inline unsigned int _v(const unsigned int k) { return 10 - k; }
101
static inline unsigned int _e(const unsigned int k) { return k + 4; }
102
static inline unsigned int _u(const unsigned int v, const unsigned int e) { return v * v * e; }
104
static int update_fun(DB *UU(db),
106
const DBT *old_val, const DBT *extra,
107
void (*set_val)(const DBT *new_val,
111
unsigned int *k, *ov, *e, v;
112
assert(key->size == sizeof(*k));
113
CAST_FROM_VOIDP(k, key->data);
114
assert(old_val->size == sizeof(*ov));
115
CAST_FROM_VOIDP(ov, old_val->data);
116
assert(extra->size == sizeof(*e));
117
CAST_FROM_VOIDP(e, extra->data);
122
set_val(dbt_init(&newval, &v, sizeof(v)), set_extra);
128
static int do_inserts(DB_TXN *txn, DB *db)
133
DBT *keyp = dbt_init(&key, &i, sizeof(i));
134
DBT *valp = dbt_init(&val, &v, sizeof(v));
135
for (i = 0; i < NUM_KEYS; ++i) {
137
r = db->put(db, txn, keyp, valp, 0);
143
static int do_updates(DB_TXN *txn, DB *db) {
147
DBT *keyp = dbt_init(&key, &i, sizeof(i));
148
DBT *extrap = dbt_init(&extra, &e, sizeof(e));
149
for (i = 0; i < NUM_KEYS; ++i) {
150
if (should_update(i)) {
152
r = db->update(db, txn, keyp, extrap, 0);
159
static void run_test(void)
164
toku_os_recursive_delete(TOKU_TEST_FILENAME);
165
{ int chk_r = toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(chk_r); }
166
{ int chk_r = db_env_create(&env, 0); CKERR(chk_r); }
167
env->set_errfile(env, stderr);
168
env->set_update(env, update_fun);
169
{ int chk_r = env->open(env, TOKU_TEST_FILENAME, envflags, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(chk_r); }
171
IN_TXN_COMMIT(env, NULL, txn_1, 0, {
172
{ int chk_r = db_create(&db, env, 0); CKERR(chk_r); }
173
{ int chk_r = db->open(db, txn_1, "foo.db", NULL, DB_BTREE, DB_CREATE, 0666); CKERR(chk_r); }
175
{ int chk_r = do_inserts(txn_1, db); CKERR(chk_r); }
178
IN_TXN_ABORT(env, NULL, txn_2, 0, {
179
{ int chk_r = do_updates(txn_2, db); CKERR(chk_r); }
182
{ int chk_r = db->close(db,0); CKERR(chk_r); }
184
toku_hard_crash_on_purpose();
187
static int verify_unchanged(DB_ENV *env, DB *db)
192
DBT *keyp = dbt_init(&key, &i, sizeof(i));
193
DBT *valp = dbt_init(&val, NULL, 0);
195
IN_TXN_COMMIT(env, NULL, txn_1, 0, {
196
for (i = 0; i < NUM_KEYS; ++i) {
197
r = db->get(db, txn_1, keyp, valp, 0);
199
assert(val.size == sizeof(*vp));
200
CAST_FROM_VOIDP(vp, val.data);
201
assert(*vp == _v(i));
208
static void run_recover(void)
213
{ int chk_r = db_env_create(&env, 0); CKERR(chk_r); }
214
env->set_errfile(env, stderr);
215
env->set_update(env, update_fun);
216
{ int chk_r = env->open(env, TOKU_TEST_FILENAME, envflags|DB_RECOVER, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(chk_r); }
217
{ int chk_r = db_create(&db, env, 0); CKERR(chk_r); }
218
{ int chk_r = db->open(db, NULL, "foo.db", NULL, DB_BTREE, DB_AUTO_COMMIT, 0666); CKERR(chk_r); }
219
{ int chk_r = verify_unchanged(env, db); CKERR(chk_r); }
220
{ int chk_r = db->close(db, 0); CKERR(chk_r); }
221
{ int chk_r = env->close(env, 0); CKERR(chk_r); }
224
static int usage(void)
229
int test_main(int argc, char * const argv[])
231
bool do_test = false;
232
bool do_recover = false;
234
for (int i = 1; i < argc; i++) {
235
char * const arg = argv[i];
236
if (strcmp(arg, "-v") == 0) {
240
if (strcmp(arg, "-q") == 0) {
246
if (strcmp(arg, "--test") == 0) {
250
if (strcmp(arg, "--recover") == 0) {
254
if (strcmp(arg, "--help") == 0) {