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."
91
// this test makes sure the LSN filtering is used during recovery of put_multiple
97
const int envflags = DB_INIT_MPOOL|DB_CREATE|DB_THREAD |DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_TXN|DB_PRIVATE;
99
const char *namea="a.db";
100
const char *nameb="b.db";
102
static DBT dest_keys[num_dbs];
103
static DBT dest_vals[num_dbs];
105
bool do_test=false, do_recover=false;
108
put_multiple_generate(DB *dest_db, DB *src_db, DBT_ARRAY *dest_key_arrays, DBT_ARRAY *dest_val_arrays, const DBT *src_key, const DBT *src_val) {
109
toku_dbt_array_resize(dest_key_arrays, 1);
110
toku_dbt_array_resize(dest_val_arrays, 1);
111
DBT *dest_key = &dest_key_arrays->dbts[0];
112
DBT *dest_val = &dest_val_arrays->dbts[0];
113
assert(src_db != NULL);
114
assert(dest_db->descriptor->dbt.size == 4);
115
uint32_t which = *(uint32_t*)dest_db->descriptor->dbt.data;
116
assert(which < num_dbs);
118
if (dest_key->data) toku_free(dest_key->data);
119
if (dest_val->data) toku_free(dest_val->data);
120
dest_key->data = toku_xmemdup (src_key->data, src_key->size);
121
dest_key->size = src_key->size;
122
dest_val->data = toku_xmemdup (src_val->data, src_val->size);
123
dest_val->size = src_val->size;
127
static void run_test (void) {
130
toku_os_recursive_delete(TOKU_TEST_FILENAME);
131
toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO);
134
r = db_env_create(&env, 0); CKERR(r);
135
r = env->set_generate_row_callback_for_put(env, put_multiple_generate);
137
r = env->open(env, TOKU_TEST_FILENAME, envflags, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
139
// create a txn that never closes, forcing recovery to run from the beginning of the log
141
DB_TXN *oldest_living_txn;
142
r = env->txn_begin(env, NULL, &oldest_living_txn, 0); CKERR(r);
147
for (which = 0; which < num_dbs; which++) {
148
dbt_init_realloc(&dest_keys[which]);
149
dbt_init_realloc(&dest_vals[which]);
151
dbt_init(&descriptor, &which, sizeof(which));
154
r = db_create(&dba, env, 0); CKERR(r);
155
r = db_create(&dbb, env, 0); CKERR(r);
156
r = dba->open(dba, NULL, namea, NULL, DB_BTREE, DB_AUTO_COMMIT|DB_CREATE, 0666); CKERR(r);
158
IN_TXN_COMMIT(env, NULL, txn_desc, 0, {
159
{ int chk_r = dba->change_descriptor(dba, txn_desc, &descriptor, 0); CKERR(chk_r); }
161
r = dbb->open(dbb, NULL, nameb, NULL, DB_BTREE, DB_AUTO_COMMIT|DB_CREATE, 0666); CKERR(r);
163
IN_TXN_COMMIT(env, NULL, txn_desc, 0, {
164
{ int chk_r = dbb->change_descriptor(dbb, txn_desc, &descriptor, 0); CKERR(chk_r); }
167
r = env->txn_checkpoint(env, 0, 0, 0); CKERR(r);
169
DB *dbs[num_dbs] = {dba, dbb};
170
uint32_t flags[num_dbs] = {0, 0};
171
// txn_begin; insert <a,a>; txn_abort
174
r = env->txn_begin(env, NULL, &txn, 0); CKERR(r);
176
dbt_init(&k, "a", 2);
177
dbt_init(&v, "b", 2);
179
r = env_put_multiple_test_no_array(env, num_dbs > 0 ? dbs[0] : NULL, txn, &k, &v, num_dbs, dbs, dest_keys, dest_vals, flags);
181
r = txn->abort(txn); CKERR(r);
183
r = dbb->close(dbb, 0); CKERR(r);
184
r = db_create(&dbb, env, 0); CKERR(r);
185
r = dbb->open(dbb, NULL, nameb, NULL, DB_BTREE, DB_AUTO_COMMIT, 0666); CKERR(r);
188
// txn_begin; insert <a,b>;
191
r = env->txn_begin(env, NULL, &txn, 0); CKERR(r);
193
dbt_init(&k, "a", 2);
194
dbt_init(&v, "b", 2);
196
r = env_put_multiple_test_no_array(env, num_dbs > 0 ? dbs[0] : NULL, txn, &k, &v, num_dbs, dbs, dest_keys, dest_vals, flags);
198
r = txn->commit(txn, 0); CKERR(r);
202
r = env->txn_begin(env, NULL, &txn, 0); CKERR(r);
203
r = dba->close(dba, 0); CKERR(r);
204
r = env->dbremove(env, txn, namea, NULL, 0); CKERR(r);
205
r = dbb->close(dbb, 0); CKERR(r);
206
r = env->dbremove(env, txn, nameb, NULL, 0); CKERR(r);
207
r = txn->commit(txn, 0); CKERR(r);
210
r = env->log_flush(env, NULL); CKERR(r);
212
toku_hard_crash_on_purpose();
216
static void run_recover (void) {
220
// Recovery starts from oldest_living_txn, which is older than any inserts done in run_test,
221
// so recovery always runs over the entire log.
224
r = db_env_create(&env, 0); CKERR(r);
225
r = env->set_generate_row_callback_for_put(env, put_multiple_generate);
227
r = env->open(env, TOKU_TEST_FILENAME, envflags + DB_RECOVER, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
232
r = db_create(&db, env, 0); CKERR(r);
233
r = db->open(db, NULL, namea, NULL, DB_UNKNOWN, DB_AUTO_COMMIT, 0666); CKERR2(r, ENOENT);
234
r = db->close(db, 0); CKERR(r);
238
r = db_create(&db, env, 0); CKERR(r);
239
r = db->open(db, NULL, nameb, NULL, DB_UNKNOWN, DB_AUTO_COMMIT, 0666); CKERR2(r, ENOENT);
240
r = db->close(db, 0); CKERR(r);
242
r = env->close(env, 0); CKERR(r);
248
static void test_parse_args (int argc, char * const argv[]) {
253
if (strcmp(argv[0], "-v") == 0) {
255
} else if (strcmp(argv[0],"-q")==0) {
257
if (verbose<0) verbose=0;
258
} else if (strcmp(argv[0], "--test")==0) {
260
} else if (strcmp(argv[0], "--recover") == 0) {
262
} else if (strcmp(argv[0], "-h")==0) {
265
fprintf(stderr, "Usage:\n%s [-v|-q]* [-h] {--test | --recover } \n", cmd);
268
fprintf(stderr, "Unknown arg: %s\n", argv[0]);
277
int test_main (int argc, char * const argv[]) {
278
test_parse_args(argc, argv);
281
} else if (do_recover) {