mirror of
https://github.com/MariaDB/server.git
synced 2025-11-04 04:46:15 +01:00
342 lines
10 KiB
C++
342 lines
10 KiB
C++
/* -*- 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."
|
|
|
|
/* The goal of this test. Make sure that inserts stay behind deletes. */
|
|
|
|
|
|
#include "test.h"
|
|
|
|
#include <ft-cachetable-wrappers.h>
|
|
|
|
#include "ft-flusher.h"
|
|
#include "ft-flusher-internal.h"
|
|
#include "cachetable/checkpoint.h"
|
|
|
|
static TOKUTXN const null_txn = 0;
|
|
|
|
enum { NODESIZE = 1024, KSIZE=NODESIZE-100, TOKU_PSIZE=20 };
|
|
|
|
CACHETABLE ct;
|
|
FT_HANDLE t;
|
|
const char *fname = TOKU_TEST_FILENAME;
|
|
|
|
int curr_child_to_flush;
|
|
int num_flushes_called;
|
|
|
|
static int child_to_flush(FT UU(h), FTNODE parent, void* UU(extra)) {
|
|
// internal node has 2 children
|
|
if (parent->height == 1) {
|
|
assert(parent->n_children == 2);
|
|
return curr_child_to_flush;
|
|
}
|
|
// root has 1 child
|
|
else if (parent->height == 2) {
|
|
assert(parent->n_children == 1);
|
|
return 0;
|
|
}
|
|
else {
|
|
assert(false);
|
|
}
|
|
return curr_child_to_flush;
|
|
}
|
|
|
|
static void update_status(FTNODE UU(child), int UU(dirtied), void* UU(extra)) {
|
|
num_flushes_called++;
|
|
}
|
|
|
|
|
|
|
|
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 recursively_flush_should_not_happen(FTNODE UU(child), void* UU(extra)) {
|
|
assert(false);
|
|
}
|
|
|
|
static bool always_flush(FTNODE UU(child), void* UU(extra)) {
|
|
return true;
|
|
}
|
|
|
|
|
|
static void
|
|
doit (void) {
|
|
BLOCKNUM node_internal, node_root;
|
|
BLOCKNUM node_leaf[2];
|
|
int r;
|
|
|
|
toku_cachetable_create(&ct, 500*1024*1024, ZERO_LSN, nullptr);
|
|
unlink(fname);
|
|
r = toku_open_ft_handle(fname, 1, &t, NODESIZE, NODESIZE/2, TOKU_DEFAULT_COMPRESSION_METHOD, ct, null_txn, toku_builtin_compare_fun);
|
|
assert(r==0);
|
|
|
|
toku_testsetup_initialize(); // must precede any other toku_testsetup calls
|
|
|
|
r = toku_testsetup_leaf(t, &node_leaf[0], 1, NULL, NULL);
|
|
assert(r==0);
|
|
r = toku_testsetup_leaf(t, &node_leaf[1], 1, NULL, NULL);
|
|
assert(r==0);
|
|
|
|
char* pivots[1];
|
|
pivots[0] = toku_strdup("kkkkk");
|
|
int pivot_len = 6;
|
|
r = toku_testsetup_nonleaf(t, 1, &node_internal, 2, node_leaf, pivots, &pivot_len);
|
|
assert(r==0);
|
|
|
|
r = toku_testsetup_nonleaf(t, 2, &node_root, 1, &node_internal, 0, 0);
|
|
assert(r==0);
|
|
|
|
r = toku_testsetup_root(t, node_root);
|
|
assert(r==0);
|
|
|
|
char filler[900-2*bn_data::HEADER_LENGTH];
|
|
memset(filler, 0, sizeof(filler));
|
|
// now we insert filler data so that a merge does not happen
|
|
r = toku_testsetup_insert_to_leaf (
|
|
t,
|
|
node_leaf[0],
|
|
"b", // key
|
|
2, // keylen
|
|
filler,
|
|
sizeof(filler)
|
|
);
|
|
assert(r==0);
|
|
r = toku_testsetup_insert_to_leaf (
|
|
t,
|
|
node_leaf[1],
|
|
"y", // key
|
|
2, // keylen
|
|
filler,
|
|
sizeof(filler)
|
|
);
|
|
assert(r==0);
|
|
|
|
// make buffers in internal node non-empty
|
|
r = toku_testsetup_insert_to_nonleaf(
|
|
t,
|
|
node_internal,
|
|
FT_INSERT,
|
|
"a",
|
|
2,
|
|
NULL,
|
|
0
|
|
);
|
|
assert_zero(r);
|
|
r = toku_testsetup_insert_to_nonleaf(
|
|
t,
|
|
node_internal,
|
|
FT_INSERT,
|
|
"z",
|
|
2,
|
|
NULL,
|
|
0
|
|
);
|
|
assert_zero(r);
|
|
|
|
//
|
|
// now run a checkpoint to get everything clean
|
|
//
|
|
CHECKPOINTER cp = toku_cachetable_get_checkpointer(ct);
|
|
r = toku_checkpoint(cp, NULL, NULL, NULL, NULL, NULL, CLIENT_CHECKPOINT);
|
|
assert_zero(r);
|
|
|
|
// now with setup done, start the test
|
|
// test that if toku_ft_flush_some_child properly honors
|
|
// what we say and flushes the child we pick
|
|
FTNODE node = NULL;
|
|
toku_pin_node_with_min_bfe(&node, node_internal, t);
|
|
toku_ftnode_assert_fully_in_memory(node);
|
|
assert(node->n_children == 2);
|
|
assert(!node->dirty());
|
|
assert(toku_bnc_n_entries(node->bp[0].ptr.u.nonleaf) > 0);
|
|
assert(toku_bnc_n_entries(node->bp[1].ptr.u.nonleaf) > 0);
|
|
|
|
struct flusher_advice fa;
|
|
flusher_advice_init(
|
|
&fa,
|
|
child_to_flush,
|
|
dont_destroy_bn,
|
|
recursively_flush_should_not_happen,
|
|
merge_should_not_happen,
|
|
update_status,
|
|
default_pick_child_after_split,
|
|
NULL
|
|
);
|
|
curr_child_to_flush = 0;
|
|
num_flushes_called = 0;
|
|
toku_ft_flush_some_child(t->ft, node, &fa);
|
|
assert(num_flushes_called == 1);
|
|
|
|
toku_pin_node_with_min_bfe(&node, node_internal, t);
|
|
toku_ftnode_assert_fully_in_memory(node);
|
|
assert(node->dirty());
|
|
assert(node->n_children == 2);
|
|
// child 0 should have empty buffer because it flushed
|
|
// child 1 should still have message in buffer
|
|
assert(toku_bnc_n_entries(node->bp[0].ptr.u.nonleaf) == 0);
|
|
assert(toku_bnc_n_entries(node->bp[1].ptr.u.nonleaf) > 0);
|
|
toku_unpin_ftnode(t->ft, node);
|
|
r = toku_checkpoint(cp, NULL, NULL, NULL, NULL, NULL, CLIENT_CHECKPOINT);
|
|
assert_zero(r);
|
|
toku_pin_node_with_min_bfe(&node, node_internal, t);
|
|
assert(!node->dirty());
|
|
curr_child_to_flush = 1;
|
|
num_flushes_called = 0;
|
|
toku_ft_flush_some_child(t->ft, node, &fa);
|
|
assert(num_flushes_called == 1);
|
|
|
|
toku_pin_node_with_min_bfe(&node, node_internal, t);
|
|
assert(node->dirty());
|
|
toku_ftnode_assert_fully_in_memory(node);
|
|
assert(node->n_children == 2);
|
|
// both buffers should be empty now
|
|
assert(toku_bnc_n_entries(node->bp[0].ptr.u.nonleaf) == 0);
|
|
assert(toku_bnc_n_entries(node->bp[1].ptr.u.nonleaf) == 0);
|
|
// now let's do a flush with an empty buffer, make sure it is ok
|
|
toku_unpin_ftnode(t->ft, node);
|
|
r = toku_checkpoint(cp, NULL, NULL, NULL, NULL, NULL, CLIENT_CHECKPOINT);
|
|
assert_zero(r);
|
|
toku_pin_node_with_min_bfe(&node, node_internal, t);
|
|
assert(!node->dirty());
|
|
curr_child_to_flush = 0;
|
|
num_flushes_called = 0;
|
|
toku_ft_flush_some_child(t->ft, node, &fa);
|
|
assert(num_flushes_called == 1);
|
|
|
|
toku_pin_node_with_min_bfe(&node, node_internal, t);
|
|
assert(node->dirty()); // nothing was flushed, but since we were trying to flush to a leaf, both become dirty
|
|
toku_ftnode_assert_fully_in_memory(node);
|
|
assert(node->n_children == 2);
|
|
// both buffers should be empty now
|
|
assert(toku_bnc_n_entries(node->bp[0].ptr.u.nonleaf) == 0);
|
|
assert(toku_bnc_n_entries(node->bp[1].ptr.u.nonleaf) == 0);
|
|
toku_unpin_ftnode(t->ft, node);
|
|
|
|
// now let's start a flush from the root, that always recursively flushes
|
|
flusher_advice_init(
|
|
&fa,
|
|
child_to_flush,
|
|
dont_destroy_bn,
|
|
always_flush,
|
|
merge_should_not_happen,
|
|
update_status,
|
|
default_pick_child_after_split,
|
|
NULL
|
|
);
|
|
// use a for loop so to get us down both paths
|
|
for (int i = 0; i < 2; i++) {
|
|
toku_pin_node_with_min_bfe(&node, node_root, t);
|
|
toku_ftnode_assert_fully_in_memory(node); // entire root is in memory
|
|
curr_child_to_flush = i;
|
|
num_flushes_called = 0;
|
|
toku_ft_flush_some_child(t->ft, node, &fa);
|
|
assert(num_flushes_called == 2);
|
|
|
|
toku_pin_node_with_min_bfe(&node, node_internal, t);
|
|
assert(node->dirty());
|
|
toku_unpin_ftnode(t->ft, node);
|
|
toku_pin_node_with_min_bfe(&node, node_leaf[0], t);
|
|
assert(node->dirty());
|
|
toku_unpin_ftnode(t->ft, node);
|
|
toku_pin_node_with_min_bfe(&node, node_leaf[1], t);
|
|
if (i == 0) {
|
|
assert(!node->dirty());
|
|
}
|
|
else {
|
|
assert(node->dirty());
|
|
}
|
|
toku_unpin_ftnode(t->ft, node);
|
|
}
|
|
|
|
// now one more test to show a bug was fixed
|
|
// if there is nothing to flush from parent to child,
|
|
// and child is not fully in memory, we used to crash
|
|
// so, to make sure that is fixed, let's get internal to not
|
|
// be fully in memory, and make sure the above test works
|
|
|
|
// a hack to get internal compressed
|
|
r = toku_testsetup_insert_to_nonleaf(
|
|
t,
|
|
node_internal,
|
|
FT_INSERT,
|
|
"c",
|
|
2,
|
|
NULL,
|
|
0
|
|
);
|
|
assert_zero(r);
|
|
r = toku_checkpoint(cp, NULL, NULL, NULL, NULL, NULL, CLIENT_CHECKPOINT);
|
|
assert_zero(r);
|
|
toku_pin_node_with_min_bfe(&node, node_internal, t);
|
|
for (int i = 0; i < 20; i++) {
|
|
toku_ftnode_pe_callback(node, make_pair_attr(0xffffffff), t->ft, def_pe_finalize_impl, nullptr);
|
|
}
|
|
assert(BP_STATE(node,0) == PT_COMPRESSED);
|
|
toku_unpin_ftnode(t->ft, node);
|
|
|
|
//now let's do the same test as above
|
|
toku_pin_node_with_min_bfe(&node, node_root, t);
|
|
toku_ftnode_assert_fully_in_memory(node); // entire root is in memory
|
|
curr_child_to_flush = 0;
|
|
num_flushes_called = 0;
|
|
toku_ft_flush_some_child(t->ft, node, &fa);
|
|
assert(num_flushes_called == 2);
|
|
|
|
r = toku_close_ft_handle_nolsn(t, 0); assert(r==0);
|
|
toku_cachetable_close(&ct);
|
|
|
|
toku_free(pivots[0]);
|
|
}
|
|
|
|
int
|
|
test_main (int argc __attribute__((__unused__)), const char *argv[] __attribute__((__unused__))) {
|
|
doit();
|
|
return 0;
|
|
}
|