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-2014 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) 2014 Tokutek Inc. All rights reserved."
94
#include <ft/ft-cachetable-wrappers.h>
96
// Each FT maintains a sequential insert heuristic to determine if its
97
// worth trying to insert directly into a well-known rightmost leaf node.
99
// The heuristic is only maintained when a rightmost leaf node is known.
101
// This test verifies that sequential inserts increase the seqinsert score
102
// and that a single non-sequential insert resets the score.
104
static void test_seqinsert_heuristic(void) {
106
char name[TOKU_PATH_MAX + 1];
107
toku_path_join(name, 2, TOKU_TEST_FILENAME, "ftdata");
108
toku_os_recursive_delete(TOKU_TEST_FILENAME);
109
r = toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU); CKERR(r);
113
toku_cachetable_create(&ct, 0, ZERO_LSN, NULL_LOGGER);
114
r = toku_open_ft_handle(name, 1, &ft_handle,
115
4*1024*1024, 64*1024,
116
TOKU_DEFAULT_COMPRESSION_METHOD, ct, NULL,
117
toku_builtin_compare_fun); CKERR(r);
118
FT ft = ft_handle->ft;
122
const int val_size = 1024 * 1024;
123
char *XMALLOC_N(val_size, val_buf);
124
memset(val_buf, 'x', val_size);
125
toku_fill_dbt(&val, val_buf, val_size);
127
// Insert many rows sequentially. This is enough data to:
128
// - force the root to split (the righmost leaf will then be known)
129
// - raise the seqinsert score high enough to enable direct rightmost injections
130
const int rows_to_insert = 200;
131
for (int i = 0; i < rows_to_insert; i++) {
133
toku_fill_dbt(&key, &k, sizeof(k));
134
toku_ft_insert(ft_handle, &key, &val, NULL);
136
invariant(ft->rightmost_blocknum.b != RESERVED_BLOCKNUM_NULL);
137
invariant(ft->seqinsert_score == FT_SEQINSERT_SCORE_THRESHOLD);
139
// Insert on the left extreme. The seq insert score is high enough
140
// that we will attempt to insert into the rightmost leaf. We won't
141
// be successful because key 0 won't be in the bounds of the rightmost leaf.
142
// This failure should reset the seqinsert score back to 0.
144
toku_fill_dbt(&key, &k, sizeof(k));
145
toku_ft_insert(ft_handle, &key, &val, NULL);
146
invariant(ft->seqinsert_score == 0);
148
// Insert in the middle. The score should not go up.
149
k = toku_htonl(rows_to_insert / 2);
150
toku_fill_dbt(&key, &k, sizeof(k));
151
toku_ft_insert(ft_handle, &key, &val, NULL);
152
invariant(ft->seqinsert_score == 0);
154
// Insert on the right extreme. The score should go up.
155
k = toku_htonl(rows_to_insert);
156
toku_fill_dbt(&key, &k, sizeof(k));
157
toku_ft_insert(ft_handle, &key, &val, NULL);
158
invariant(ft->seqinsert_score == 1);
160
// Insert again on the right extreme again, the score should go up.
161
k = toku_htonl(rows_to_insert + 1);
162
toku_fill_dbt(&key, &k, sizeof(k));
163
toku_ft_insert(ft_handle, &key, &val, NULL);
164
invariant(ft->seqinsert_score == 2);
166
// Insert close to, but not at, the right extreme. The score should reset.
167
// -- the magic number 4 derives from the fact that vals are 1mb and nodes are 4mb
168
k = toku_htonl(rows_to_insert - 4);
169
toku_fill_dbt(&key, &k, sizeof(k));
170
toku_ft_insert(ft_handle, &key, &val, NULL);
171
invariant(ft->seqinsert_score == 0);
174
toku_ft_handle_close(ft_handle);
175
toku_cachetable_close(&ct);
176
toku_os_recursive_delete(TOKU_TEST_FILENAME);
179
int test_main(int argc, const char *argv[]) {
180
default_parse_args(argc, argv);
181
test_seqinsert_heuristic();