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."
94
fetch (CACHEFILE f __attribute__((__unused__)),
97
CACHEKEY k __attribute__((__unused__)),
98
uint32_t fullhash __attribute__((__unused__)),
99
void **value __attribute__((__unused__)),
101
PAIR_ATTR *sizep __attribute__((__unused__)),
102
int *dirtyp __attribute__((__unused__)),
103
void *extraargs __attribute__((__unused__))
106
*sizep = make_pair_attr(0);
110
// test simple unpin and remove
112
cachetable_unpin_and_remove_test (int n) {
113
if (verbose) printf("%s %d\n", __FUNCTION__, n);
114
const int table_limit = 2*n;
119
toku_cachetable_create(&ct, table_limit, ZERO_LSN, NULL_LOGGER);
120
const char *fname1 = TOKU_TEST_FILENAME;
123
r = toku_cachetable_openf(&f1, ct, fname1, O_RDWR|O_CREAT, 0777); assert(r == 0);
124
CACHETABLE_WRITE_CALLBACK wc = def_write_callback(NULL);
126
// generate some random keys
127
CACHEKEY keys[n]; int nkeys = n;
128
for (i=0; i<n; i++) {
129
keys[i].b = random();
132
// put the keys into the cachetable
133
for (i=0; i<n; i++) {
134
uint32_t hi = toku_cachetable_hash(f1, make_blocknum(keys[i].b));
135
toku_cachetable_put(f1, make_blocknum(keys[i].b), hi, (void *)(long) keys[i].b, make_pair_attr(1),wc, put_callback_nop);
139
CACHEKEY testkeys[n];
140
for (i=0; i<n; i++) testkeys[i] = keys[i];
142
i = random() % nkeys;
143
uint32_t hi = toku_cachetable_hash(f1, make_blocknum(testkeys[i].b));
144
r = toku_test_cachetable_unpin_and_remove(f1, testkeys[i], NULL, NULL);
147
toku_cachefile_verify(f1);
149
// verify that k is removed
151
r = toku_cachetable_maybe_get_and_pin(f1, make_blocknum(testkeys[i].b), hi, PL_WRITE_EXPENSIVE, &v);
154
testkeys[i] = testkeys[nkeys-1]; nkeys -= 1;
157
// verify that the cachtable is empty
159
toku_cachetable_get_state(ct, &nentries, NULL, NULL, NULL);
160
assert(nentries == 0);
162
toku_cachefile_close(&f1, false, ZERO_LSN);
163
toku_cachetable_close(&ct);
166
// test remove when the pair in being written
168
cachetable_put_evict_remove_test (int n) {
169
if (verbose) printf("%s %d\n", __FUNCTION__, n);
170
const int table_limit = n-1;
175
toku_cachetable_create(&ct, table_limit, ZERO_LSN, NULL_LOGGER);
176
const char *fname1 = TOKU_TEST_FILENAME;
179
r = toku_cachetable_openf(&f1, ct, fname1, O_RDWR|O_CREAT, 0777); assert(r == 0);
180
CACHETABLE_WRITE_CALLBACK wc = def_write_callback(NULL);
184
hi[i] = toku_cachetable_hash(f1, make_blocknum(i));
186
// put 0, 1, 2, ... should evict 0
187
for (i=0; i<n; i++) {
188
toku_cachetable_put(f1, make_blocknum(i), hi[i], (void *)(long)i, make_pair_attr(1), wc, put_callback_nop);
189
r = toku_test_cachetable_unpin(f1, make_blocknum(i), hi[i], CACHETABLE_CLEAN, make_pair_attr(1));
195
r = toku_cachetable_get_and_pin(f1, make_blocknum(0), hi[0], &v, &s, wc, fetch, def_pf_req_callback, def_pf_callback, true, 0);
199
r = toku_test_cachetable_unpin_and_remove(f1, make_blocknum(0), NULL, NULL);
202
toku_cachefile_close(&f1, false, ZERO_LSN);
203
toku_cachetable_close(&ct);
207
test_main(int argc, const char *argv[]) {
208
default_parse_args(argc, argv);
209
cachetable_unpin_and_remove_test(8);
210
cachetable_put_evict_remove_test(4);