1 /* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2 // vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
3 #ident "$Id$"
4 /*======
5 This file is part of PerconaFT.
6
7
8 Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved.
9
10 PerconaFT is free software: you can redistribute it and/or modify
11 it under the terms of the GNU General Public License, version 2,
12 as published by the Free Software Foundation.
13
14 PerconaFT is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
21
22 ----------------------------------------
23
24 PerconaFT is free software: you can redistribute it and/or modify
25 it under the terms of the GNU Affero General Public License, version 3,
26 as published by the Free Software Foundation.
27
28 PerconaFT is distributed in the hope that it will be useful,
29 but WITHOUT ANY WARRANTY; without even the implied warranty of
30 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
31 GNU Affero General Public License for more details.
32
33 You should have received a copy of the GNU Affero General Public License
34 along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
35 ======= */
36
37 #ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved."
38
39 /* The goal of this test. Make sure that inserts stay behind deletes. */
40
41
42 #include "test.h"
43
44
45 static TOKUTXN const null_txn = 0;
46
47 enum { NODESIZE = 1024, KSIZE=NODESIZE-100, TOKU_PSIZE=20 };
48
49 CACHETABLE ct;
50 FT_HANDLE t;
51 const char *fname = TOKU_TEST_FILENAME;
52
53 static void
doit(void)54 doit (void) {
55 BLOCKNUM nodea,nodeb;
56
57 int r;
58
59 toku_cachetable_create(&ct, 16*1024, ZERO_LSN, nullptr);
60 unlink(fname);
61 r = toku_open_ft_handle(fname, 1, &t, NODESIZE, NODESIZE, TOKU_DEFAULT_COMPRESSION_METHOD, ct, null_txn, toku_builtin_compare_fun);
62 assert(r==0);
63
64 toku_testsetup_initialize(); // must precede any other toku_testsetup calls
65
66 r = toku_testsetup_leaf(t, &nodea, 1, NULL, NULL);
67 assert(r==0);
68
69 r = toku_testsetup_nonleaf(t, 1, &nodeb, 1, &nodea, 0, 0);
70 assert(r==0);
71
72 r = toku_testsetup_insert_to_nonleaf(t, nodeb, FT_DELETE_ANY, "hello", 6, 0, 0);
73 assert(r==0);
74
75 r = toku_testsetup_root(t, nodeb);
76 assert(r==0);
77
78 DBT k,v;
79 toku_ft_insert(t,
80 toku_fill_dbt(&k, "hello", 6),
81 toku_fill_dbt(&v, "there", 6),
82 null_txn);
83
84 memset(&v, 0, sizeof(v));
85 struct check_pair pair = {6, "hello", 6, "there", 0};
86 r = toku_ft_lookup(t, &k, lookup_checkf, &pair);
87 assert(r==0);
88 assert(pair.call_count == 1);
89
90 r = toku_close_ft_handle_nolsn(t, 0); assert(r==0);
91 toku_cachetable_close(&ct);
92 }
93
94 int
test_main(int argc,const char * argv[])95 test_main (int argc __attribute__((__unused__)), const char *argv[] __attribute__((__unused__))) {
96 doit();
97 return 0;
98 }
99