diff options
Diffstat (limited to 'storage/tokudb/PerconaFT/ft/tests/test-oldest-referenced-xid-flush.cc')
| -rw-r--r-- | storage/tokudb/PerconaFT/ft/tests/test-oldest-referenced-xid-flush.cc | 190 |
1 files changed, 190 insertions, 0 deletions
diff --git a/storage/tokudb/PerconaFT/ft/tests/test-oldest-referenced-xid-flush.cc b/storage/tokudb/PerconaFT/ft/tests/test-oldest-referenced-xid-flush.cc new file mode 100644 index 00000000..71357a1e --- /dev/null +++ b/storage/tokudb/PerconaFT/ft/tests/test-oldest-referenced-xid-flush.cc @@ -0,0 +1,190 @@ +/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */ +// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4: +#ident "$Id$" +/*====== +This file is part of PerconaFT. + + +Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved. + + PerconaFT is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License, version 2, + as published by the Free Software Foundation. + + PerconaFT is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with PerconaFT. If not, see <http://www.gnu.org/licenses/>. + +---------------------------------------- + + PerconaFT is free software: you can redistribute it and/or modify + it under the terms of the GNU Affero General Public License, version 3, + as published by the Free Software Foundation. + + PerconaFT is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU Affero General Public License for more details. + + You should have received a copy of the GNU Affero General Public License + along with PerconaFT. If not, see <http://www.gnu.org/licenses/>. +======= */ + +#ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved." + +#include "test.h" + +#include "ft-cachetable-wrappers.h" +#include "ft-flusher.h" +#include "ft-flusher-internal.h" + +static bool +dont_destroy_bn(void* UU(extra)) { + return false; +} + +static void merge_should_not_happen(struct flusher_advice* UU(fa), + FT UU(h), + FTNODE UU(parent), + int UU(childnum), + FTNODE UU(child), + void* UU(extra)) +{ + assert(false); +} + +static bool dont_recursively_flush(FTNODE UU(child), void* UU(extra)) { + return false; +} + +static int child_to_flush(FT UU(h), FTNODE parent, void* UU(extra)) { + assert(parent->height == 2); + assert(parent->n_children == 1); + return 0; +} + +static void dummy_update_status(FTNODE UU(child), int UU(dirtied), void* UU(extra)) { +} + +enum { NODESIZE = 1024, KSIZE=NODESIZE-100, TOKU_PSIZE=20 }; + +static void test_oldest_referenced_xid_gets_propagated(void) { + int r; + CACHETABLE ct; + FT_HANDLE t; + BLOCKNUM grandchild_leaf_blocknum, child_nonleaf_blocknum, root_blocknum; + + toku_cachetable_create(&ct, 500*1024*1024, ZERO_LSN, nullptr); + unlink("foo1.ft_handle"); + r = toku_open_ft_handle("foo1.ft_handle", 1, &t, NODESIZE, NODESIZE/2, TOKU_DEFAULT_COMPRESSION_METHOD, ct, nullptr, toku_builtin_compare_fun); + assert(r==0); + + toku_testsetup_initialize(); // must precede any other toku_testsetup calls + + // This test flushes from a nonleaf root to a nonleaf child, without any leaf nodes. + + r = toku_testsetup_leaf(t, &grandchild_leaf_blocknum, 1, NULL, NULL); + assert(r==0); + + r = toku_testsetup_nonleaf(t, 1, &child_nonleaf_blocknum, 1, &grandchild_leaf_blocknum, NULL, NULL); + assert(r==0); + + r = toku_testsetup_nonleaf(t, 2, &root_blocknum, 1, &child_nonleaf_blocknum, NULL, NULL); + assert(r==0); + + r = toku_testsetup_root(t, root_blocknum); + assert(r==0); + + r = toku_testsetup_insert_to_nonleaf( + t, + root_blocknum, + FT_INSERT, + "a", + 2, + NULL, + 0 + ); + + // Verify that both the root and its child start with TXNID_NONE + // for the oldest referenced xid + + // first verify the child + FTNODE node = NULL; + ftnode_fetch_extra bfe; + bfe.create_for_min_read(t->ft); + toku_pin_ftnode( + t->ft, + child_nonleaf_blocknum, + toku_cachetable_hash(t->ft->cf, child_nonleaf_blocknum), + &bfe, + PL_WRITE_EXPENSIVE, + &node, + true + ); + assert(node->height == 1); + assert(node->n_children == 1); + assert(BP_BLOCKNUM(node, 0).b == grandchild_leaf_blocknum.b); + assert(node->oldest_referenced_xid_known == TXNID_NONE); + toku_unpin_ftnode(t->ft, node); + + // now verify the root - keep it pinned so we can flush it below + toku_pin_ftnode( + t->ft, + root_blocknum, + toku_cachetable_hash(t->ft->cf, root_blocknum), + &bfe, + PL_WRITE_EXPENSIVE, + &node, + true + ); + assert(node->height == 2); + assert(node->n_children == 1); + assert(BP_BLOCKNUM(node, 0).b == child_nonleaf_blocknum.b); + assert(toku_bnc_nbytesinbuf(BNC(node, 0)) > 0); + assert(node->oldest_referenced_xid_known == TXNID_NONE); + + // set the root's oldest referenced xid to something special + const TXNID flush_xid = 25000; + node->oldest_referenced_xid_known = flush_xid; + + // do the flush + struct flusher_advice fa; + flusher_advice_init( + &fa, + child_to_flush, + dont_destroy_bn, + dont_recursively_flush, + merge_should_not_happen, + dummy_update_status, + default_pick_child_after_split, + NULL + ); + toku_ft_flush_some_child(t->ft, node, &fa); + + // pin the child, verify that oldest referenced xid was + // propagated from parent to child during the flush + toku_pin_ftnode( + t->ft, + child_nonleaf_blocknum, + toku_cachetable_hash(t->ft->cf, child_nonleaf_blocknum), + &bfe, + PL_WRITE_EXPENSIVE, + &node, + true + ); + assert(node->oldest_referenced_xid_known == flush_xid); + + toku_unpin_ftnode(t->ft, node); + r = toku_close_ft_handle_nolsn(t, 0); assert(r==0); + toku_cachetable_close(&ct); +} + +int test_main(int argc __attribute__((__unused__)), const char *argv[] __attribute__((__unused__))) { + default_parse_args(argc, argv); + test_oldest_referenced_xid_gets_propagated(); + return 0; +} |