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 #include "test.h"
40 #include "cachetable-test.h"
41 
42 //
43 // simple tests for maybe_get_and_pin(_clean)
44 //
45 
46 static void
cachetable_test(void)47 cachetable_test (void) {
48     const int test_limit = 12;
49     int r;
50     CACHETABLE ct;
51     toku_cachetable_create(&ct, test_limit, ZERO_LSN, nullptr);
52     const char *fname1 = TOKU_TEST_FILENAME;
53     unlink(fname1);
54     CACHEFILE f1;
55     r = toku_cachetable_openf(&f1, ct, fname1, O_RDWR|O_CREAT, S_IRWXU|S_IRWXG|S_IRWXO); assert(r == 0);
56     create_dummy_functions(f1);
57     CACHETABLE_WRITE_CALLBACK wc = def_write_callback(NULL);
58 
59     void* v1;
60     // nothing in cachetable, so this should fail
61     r = toku_cachetable_maybe_get_and_pin(f1, make_blocknum(1), 1, PL_WRITE_EXPENSIVE, &v1);
62     assert(r==-1);
63     r = toku_cachetable_get_and_pin(f1, make_blocknum(1), 1, &v1, wc, def_fetch, def_pf_req_callback, def_pf_callback, true, NULL);
64     r = toku_test_cachetable_unpin(f1, make_blocknum(1), 1, CACHETABLE_CLEAN, make_pair_attr(8));
65 
66     // maybe_get_and_pin_clean should succeed, maybe_get_and_pin should fail
67     r = toku_cachetable_maybe_get_and_pin(f1, make_blocknum(1), 1, PL_WRITE_EXPENSIVE, &v1);
68     assert(r==-1);
69     r = toku_cachetable_maybe_get_and_pin_clean(f1, make_blocknum(1), 1, PL_WRITE_EXPENSIVE, &v1);
70     assert(r == 0);
71     r = toku_test_cachetable_unpin(f1, make_blocknum(1), 1, CACHETABLE_DIRTY, make_pair_attr(8));
72     // maybe_get_and_pin_clean should succeed, maybe_get_and_pin should fail
73     r = toku_cachetable_maybe_get_and_pin(f1, make_blocknum(1), 1, PL_WRITE_EXPENSIVE, &v1);
74     assert(r==0);
75     // now these calls should fail because the node is already pinned, and therefore in use
76     r = toku_cachetable_maybe_get_and_pin(f1, make_blocknum(1), 1, PL_WRITE_EXPENSIVE, &v1);
77     assert(r==-1);
78     r = toku_cachetable_maybe_get_and_pin_clean(f1, make_blocknum(1), 1, PL_WRITE_EXPENSIVE, &v1);
79     assert(r==-1);
80     r = toku_test_cachetable_unpin(f1, make_blocknum(1), 1, CACHETABLE_DIRTY, make_pair_attr(8));
81 
82     // sanity check, this should still succeed, because the PAIR is dirty
83     r = toku_cachetable_maybe_get_and_pin(f1, make_blocknum(1), 1, PL_WRITE_EXPENSIVE, &v1);
84     assert(r==0);
85     r = toku_test_cachetable_unpin(f1, make_blocknum(1), 1, CACHETABLE_DIRTY, make_pair_attr(8));
86     CHECKPOINTER cp = toku_cachetable_get_checkpointer(ct);
87     toku_cachetable_begin_checkpoint(cp, NULL);
88     // now these should fail, because the node should be pending a checkpoint
89     r = toku_cachetable_maybe_get_and_pin(f1, make_blocknum(1), 1, PL_WRITE_EXPENSIVE, &v1);
90     assert(r==-1);
91     r = toku_cachetable_maybe_get_and_pin(f1, make_blocknum(1), 1, PL_WRITE_EXPENSIVE, &v1);
92     assert(r==-1);
93     toku_cachetable_end_checkpoint(
94         cp,
95         NULL,
96         NULL,
97         NULL
98         );
99 
100     toku_cachetable_verify(ct);
101     toku_cachefile_close(&f1, false, ZERO_LSN);
102     toku_cachetable_close(&ct);
103 }
104 
105 int
test_main(int argc,const char * argv[])106 test_main(int argc, const char *argv[]) {
107   default_parse_args(argc, argv);
108   cachetable_test();
109   return 0;
110 }
111