Adding upstream version 1:10.5.12.upstream/1%10.5.12upstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 160 insertions, 0 deletions

diff --git a/storage/tokudb/PerconaFT/ft/tests/verify-dup-in-leaf.cc b/storage/tokudb/PerconaFT/ft/tests/verify-dup-in-leaf.cc
new file mode 100644
index 00000000..e31b13c4
--- /dev/null
+++ b/storage/tokudb/PerconaFT/ft/tests/verify-dup-in-leaf.cc
@@ -0,0 +1,160 @@
+/* -*- 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."
+
+// generate a tree with a single leaf node containing duplicate keys
+// check that ft verify finds them
+
+
+#include <ft-cachetable-wrappers.h>
+#include "test.h"
+
+static FTNODE
+make_node(FT_HANDLE ft, int height) {
+    FTNODE node = NULL;
+    int n_children = (height == 0) ? 1 : 0;
+    toku_create_new_ftnode(ft, &node, height, n_children);
+    if (n_children) BP_STATE(node,0) = PT_AVAIL;
+    return node;
+}
+
+static void
+append_leaf(FTNODE leafnode, void *key, size_t keylen, void *val, size_t vallen) {
+    assert(leafnode->height == 0);
+
+    DBT thekey; toku_fill_dbt(&thekey, key, keylen);
+    DBT theval; toku_fill_dbt(&theval, val, vallen);
+
+    // get an index that we can use to create a new leaf entry
+    uint32_t idx = BLB_DATA(leafnode, 0)->num_klpairs();
+
+    // apply an insert to the leaf node
+    MSN msn = next_dummymsn();
+    ft_msg msg(&thekey, &theval, FT_INSERT, msn, toku_xids_get_root_xids());
+    txn_gc_info gc_info(nullptr, TXNID_NONE, TXNID_NONE, false);
+    toku_ft_bn_apply_msg_once(
+        BLB(leafnode, 0),
+        msg,
+        idx,
+        keylen,
+        NULL,
+        &gc_info,
+        NULL,
+        NULL,
+        NULL);
+
+    // don't forget to dirty the node
+    leafnode->set_dirty();
+}
+
+static void 
+populate_leaf(FTNODE leafnode, int k, int v) {
+    append_leaf(leafnode, &k, sizeof k, &v, sizeof v);
+}
+
+static void 
+test_dup_in_leaf(int do_verify) {
+    int r;
+
+    // cleanup
+    const char *fname = TOKU_TEST_FILENAME;
+    r = unlink(fname);
+    assert(r == 0 || (r == -1 && errno == ENOENT));
+
+    // create a cachetable
+    CACHETABLE ct = NULL;
+    toku_cachetable_create(&ct, 0, ZERO_LSN, nullptr);
+
+    // create the ft
+    TOKUTXN null_txn = NULL;
+    FT_HANDLE ft = NULL;
+    r = toku_open_ft_handle(fname, 1, &ft, 1024, 256, TOKU_DEFAULT_COMPRESSION_METHOD, ct, null_txn, toku_builtin_compare_fun);
+    assert(r == 0);
+
+    // discard the old root block
+
+    FTNODE newroot = make_node(ft, 0);
+    populate_leaf(newroot, htonl(2), 1);
+    populate_leaf(newroot, htonl(2), 2);
+
+    // set the new root to point to the new tree
+    toku_ft_set_new_root_blocknum(ft->ft, newroot->blocknum);
+
+    // unpin the new root
+    toku_unpin_ftnode(ft->ft, newroot);
+
+    if (do_verify) {
+        r = toku_verify_ft(ft);
+        assert(r != 0);
+    }
+
+    // flush to the file system
+    r = toku_close_ft_handle_nolsn(ft, 0);     
+    assert(r == 0);
+
+    // shutdown the cachetable
+    toku_cachetable_close(&ct);
+}
+
+static int
+usage(void) {
+    return 1;
+}
+
+int
+test_main (int argc , const char *argv[]) {
+    int do_verify = 1;
+    initialize_dummymsn();
+    for (int i = 1; i < argc; i++) {
+        const char *arg = argv[i];
+        if (strcmp(arg, "-v") == 0) {
+            verbose++;
+            continue;
+        }
+        if (strcmp(arg, "-q") == 0) {
+            verbose = 0;
+            continue;
+        }
+        if (strcmp(arg, "--verify") == 0 && i+1 < argc) {
+            do_verify = atoi(argv[++i]);
+            continue;
+        }
+        return usage();
+    }
+    test_dup_in_leaf(do_verify);
+    return 0;
+}