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 sets the cache size to be small and then inserts enough data
92
// to make some basement nodes get evicted. Then sends a broadcast update
93
// and checks all the data. If the msns for evicted basement nodes and
94
// leaf nodes are not managed properly, this test should fail (because the
95
// broadcast message will not be applied to basement nodes being brought
100
const int envflags = DB_INIT_MPOOL|DB_CREATE|DB_THREAD |DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_TXN|DB_PRIVATE;
104
const unsigned int NUM_KEYS = (1<<17);
105
const unsigned int MAGIC_EXTRA = 0x4ac0ffee;
107
const char original_data[] = "original: ha.rpbkasrkcabkshtabksraghpkars3cbkarpcpktkpbarkca.hpbtkvaekragptknbnsaotbknotbkaontekhba";
108
const char updated_data[] = "updated: crkphi30bi8a9hpckbrap.k98a.pkrh3miachpk0[alr3s4nmubrp8.9girhp,bgoekhrl,nurbperk8ochk,bktoe";
110
static int update_fun(DB *UU(db),
112
const DBT *old_val, const DBT *extra,
113
void (*set_val)(const DBT *new_val,
117
assert(extra->size == sizeof(*e));
118
CAST_FROM_VOIDP(e, extra->data);
119
assert(*e == MAGIC_EXTRA);
120
assert(old_val->size == sizeof(original_data));
121
assert(memcmp(old_val->data, original_data, sizeof(original_data)) == 0);
125
set_val(dbt_init(&newval, updated_data, sizeof(updated_data)), set_extra);
132
int_cmp(DB *UU(db), const DBT *a, const DBT *b) {
133
unsigned int *ap, *bp;
134
assert(a->size == sizeof(*ap));
135
CAST_FROM_VOIDP(ap, a->data);
136
assert(b->size == sizeof(*bp));
137
CAST_FROM_VOIDP(bp, b->data);
138
return (*ap > *bp) - (*ap < *bp);
141
static void setup (void) {
142
toku_os_recursive_delete(TOKU_TEST_FILENAME);
143
{ int chk_r = toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(chk_r); }
144
{ int chk_r = db_env_create(&env, 0); CKERR(chk_r); }
145
env->set_errfile(env, stderr);
146
env->set_update(env, update_fun);
147
env->set_cachesize(env, 0, 10*(1<<20), 1);
148
{ int chk_r = env->set_default_bt_compare(env, int_cmp); CKERR(chk_r); }
149
{ int chk_r = env->open(env, TOKU_TEST_FILENAME, envflags, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(chk_r); }
152
static void cleanup (void) {
153
{ int chk_r = env->close(env, 0); CKERR(chk_r); }
156
static int do_inserts(DB_TXN *txn, DB *db) {
160
DBT *keyp = dbt_init(&key, &i, sizeof(i));
161
DBT *valp = dbt_init(&val, original_data, sizeof(original_data));
162
for (i = 0; i < NUM_KEYS; ++i) {
163
r = db->put(db, txn, keyp, valp, 0); CKERR(r);
168
static int do_updates(DB_TXN *txn, DB *db) {
170
unsigned int e = MAGIC_EXTRA;
171
DBT *extrap = dbt_init(&extra, &e, sizeof(e));
172
int r = db->update_broadcast(db, txn, extrap, 0); CKERR(r);
176
static int do_verify_results(DB_TXN *txn, DB *db) {
180
DBT *keyp = dbt_init(&key, &i, sizeof(i));
181
DBT *valp = dbt_init(&val, NULL, 0);
182
for (i = 0; i < NUM_KEYS; ++i) {
183
r = db->get(db, txn, keyp, valp, 0); CKERR(r);
184
assert(val.size == sizeof(updated_data));
185
assert(memcmp(val.data, updated_data, sizeof(updated_data)) == 0);
190
static int run_test(bool shutdown_before_update, bool shutdown_before_verify) {
195
{ int chk_r = db_create(&db, env, 0); CKERR(chk_r); }
196
db->set_pagesize(db, 256*1024);
197
IN_TXN_COMMIT(env, NULL, txn_1, 0, {
198
{ int chk_r = db->open(db, txn_1, "foo.db", NULL, DB_BTREE, DB_CREATE, 0666); CKERR(chk_r); }
200
{ int chk_r = do_inserts(txn_1, db); CKERR(chk_r); }
203
if (shutdown_before_update) {
204
{ int chk_r = db->close(db, 0); CKERR(chk_r); }
205
{ int chk_r = db_create(&db, env, 0); CKERR(chk_r); }
206
IN_TXN_COMMIT(env, NULL, txn_reopen, 0, {
207
{ int chk_r = db->open(db, txn_reopen, "foo.db", NULL, DB_BTREE, DB_CREATE, 0666); CKERR(chk_r); }
211
IN_TXN_COMMIT(env, NULL, txn_2, 0, {
212
{ int chk_r = do_updates(txn_2, db); CKERR(chk_r); }
215
if (shutdown_before_verify) {
216
{ int chk_r = db->close(db, 0); CKERR(chk_r); }
217
{ int chk_r = db_create(&db, env, 0); CKERR(chk_r); }
218
IN_TXN_COMMIT(env, NULL, txn_reopen, 0, {
219
{ int chk_r = db->open(db, txn_reopen, "foo.db", NULL, DB_BTREE, DB_CREATE, 0666); CKERR(chk_r); }
223
IN_TXN_COMMIT(env, NULL, txn_3, 0, {
224
{ int chk_r = do_verify_results(txn_3, db); CKERR(chk_r); }
227
{ int chk_r = db->close(db, 0); CKERR(chk_r); }
234
int test_main(int argc, char * const argv[]) {
235
parse_args(argc, argv);
237
run_test(false, false);
238
run_test(false, true);
239
run_test(true, false);
240
run_test(true, true);