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."
92
* Test that unique inserts work correctly. This exercises the rightmost leaf inject optimization.
95
#include <portability/toku_random.h>
99
static char random_buf[8];
100
static struct random_data random_data;
102
static void test_simple_unique_insert(DB_ENV *env) {
105
r = db_create(&db, env, 0); CKERR(r);
106
r = db->open(db, NULL, "db", NULL, DB_BTREE, DB_CREATE, 0644); CKERR(r);
108
DBT key1, key2, key3;
109
dbt_init(&key1, "a", sizeof("a"));
110
dbt_init(&key2, "b", sizeof("b"));
111
dbt_init(&key3, "c", sizeof("c"));
112
r = db->put(db, NULL, &key1, &key1, DB_NOOVERWRITE); CKERR(r);
113
r = db->put(db, NULL, &key1, &key1, DB_NOOVERWRITE); CKERR2(r, DB_KEYEXIST);
114
r = db->put(db, NULL, &key3, &key3, DB_NOOVERWRITE); CKERR(r);
115
r = db->put(db, NULL, &key3, &key3, DB_NOOVERWRITE); CKERR2(r, DB_KEYEXIST);
116
r = db->put(db, NULL, &key2, &key2, DB_NOOVERWRITE); CKERR(r);
117
r = db->put(db, NULL, &key2, &key2, DB_NOOVERWRITE); CKERR2(r, DB_KEYEXIST);
119
r = db->put(db, NULL, &key1, &key1, DB_NOOVERWRITE); CKERR2(r, DB_KEYEXIST);
120
r = db->put(db, NULL, &key1, &key3, DB_NOOVERWRITE); CKERR2(r, DB_KEYEXIST);
122
r = db->close(db, 0); CKERR(r);
123
r = env->dbremove(env, NULL, "db", NULL, 0); CKERR(r);
126
static void test_large_sequential_insert_unique(DB_ENV *env) {
129
r = db_create(&db, env, 0); CKERR(r);
131
// very small nodes/basements to make a taller tree
132
r = db->set_pagesize(db, 8 * 1024); CKERR(r);
133
r = db->set_readpagesize(db, 2 * 1024); CKERR(r);
134
r = db->open(db, NULL, "db", NULL, DB_BTREE, DB_CREATE, 0644); CKERR(r);
136
const int val_size = 1024;
137
char *XMALLOC_N(val_size, val_buf);
138
memset(val_buf, 'k', val_size);
140
dbt_init(&val, val_buf, val_size);
142
// grow a tree to about depth 3, taking sanity checks along the way
143
const int start_num_rows = (64 * 1024 * 1024) / val_size;
144
for (int i = 0; i < start_num_rows; i++) {
146
int k = toku_htonl(i);
147
dbt_init(&key, &k, sizeof(k));
148
r = db->put(db, NULL, &key, &val, DB_NOOVERWRITE); CKERR(r);
150
// sanity check - should not be able to insert this key twice in a row
151
r = db->put(db, NULL, &key, &val, DB_NOOVERWRITE); CKERR2(r, DB_KEYEXIST);
153
// .. but re-inserting is okay, if we provisionally deleted the row
155
r = env->txn_begin(env, NULL, &txn, 0); CKERR(r);
156
r = db->del(db, NULL, &key, DB_DELETE_ANY); CKERR(r);
157
r = db->put(db, NULL, &key, &val, DB_NOOVERWRITE); CKERR(r);
158
r = txn->commit(txn, 0); CKERR(r);
160
if (i > 0 && i % 250 == 0) {
161
// sanity check - unique checks on random keys we already inserted should
162
// fail (exercises middle-of-the-tree checks)
163
for (int check_i = 0; check_i < 4; check_i++) {
165
int rand_k = toku_htonl(myrandom_r(&random_data) % i);
166
dbt_init(&rand_key, &rand_k, sizeof(rand_k));
167
r = db->put(db, NULL, &rand_key, &val, DB_NOOVERWRITE); CKERR2(r, DB_KEYEXIST);
173
r = db->close(db, 0); CKERR(r);
174
r = env->dbremove(env, NULL, "db", NULL, 0); CKERR(r);
178
int test_main(int argc, char * const argv[]) {
179
default_parse_args(argc, argv);
182
const int envflags = DB_INIT_MPOOL | DB_CREATE | DB_THREAD |
183
DB_INIT_LOCK | DB_INIT_LOG | DB_INIT_TXN | DB_PRIVATE;
187
toku_os_recursive_delete(TOKU_TEST_FILENAME);
188
r = toku_os_mkdir(TOKU_TEST_FILENAME, 0755); CKERR(r);
189
r = db_env_create(&env, 0); CKERR(r);
190
r = env->open(env, TOKU_TEST_FILENAME, envflags, 0755);
192
r = myinitstate_r(random(), random_buf, 8, &random_data); CKERR(r);
194
test_simple_unique_insert(env);
195
test_large_sequential_insert_unique(env);
198
r = env->close(env, 0); CKERR(r);