mirror of
https://github.com/MariaDB/server.git
synced 2025-11-04 04:46:15 +01:00
112 lines
4.1 KiB
C++
112 lines
4.1 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."
|
|
|
|
// it used to be the case that we copied the left and right keys of a
|
|
// range to be prelocked but never freed them, this test checks that they
|
|
// are freed (as of this time, this happens in ftnode_fetch_extra::destroy())
|
|
|
|
#include "test.h"
|
|
|
|
|
|
|
|
static const char *fname = TOKU_TEST_FILENAME;
|
|
|
|
static TOKUTXN const null_txn = 0;
|
|
static int const nodesize = 1<<12, basementnodesize = 1<<9;
|
|
static const enum toku_compression_method compression_method = TOKU_DEFAULT_COMPRESSION_METHOD;
|
|
static int const count = 1000;
|
|
|
|
static int
|
|
string_cmp(DB* UU(db), const DBT *a, const DBT *b)
|
|
{
|
|
return strcmp((char*)a->data, (char*)b->data);
|
|
}
|
|
|
|
static int
|
|
found(uint32_t UU(keylen), const void *key, uint32_t UU(vallen), const void *UU(val), void *UU(extra), bool lock_only)
|
|
{
|
|
assert(key != NULL && !lock_only);
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
test_main (int argc __attribute__((__unused__)), const char *argv[] __attribute__((__unused__))) {
|
|
|
|
CACHETABLE ct;
|
|
FT_HANDLE t;
|
|
|
|
toku_cachetable_create(&ct, 0, ZERO_LSN, nullptr);
|
|
unlink(fname);
|
|
int r = toku_open_ft_handle(fname, 1, &t, nodesize, basementnodesize, compression_method, ct, null_txn, string_cmp); assert(r==0);
|
|
|
|
for (int i = 0; i < count; ++i) {
|
|
char key[100],val[100];
|
|
DBT k,v;
|
|
snprintf(key, 100, "hello%d", i);
|
|
snprintf(val, 100, "there%d", i);
|
|
toku_ft_insert(t, toku_fill_dbt(&k, key, 1+strlen(key)), toku_fill_dbt(&v, val, 1+strlen(val)), null_txn);
|
|
}
|
|
r = toku_close_ft_handle_nolsn(t, 0); assert(r == 0);
|
|
toku_cachetable_close(&ct);
|
|
|
|
toku_cachetable_create(&ct, 0, ZERO_LSN, nullptr);
|
|
r = toku_open_ft_handle(fname, 1, &t, nodesize, basementnodesize, compression_method, ct, null_txn, string_cmp); assert(r == 0);
|
|
|
|
for (int n = 0; n < count/100; ++n) {
|
|
int i = n * 100;
|
|
FT_CURSOR c;
|
|
char lkey[100],rkey[100];
|
|
DBT lk, rk;
|
|
r = toku_ft_cursor(t, &c, null_txn, false, false); assert(r == 0);
|
|
snprintf(lkey, 100, "hello%d", i);
|
|
snprintf(rkey, 100, "hello%d", i + 100);
|
|
toku_ft_cursor_set_range_lock(c, toku_fill_dbt(&lk, lkey, 1+strlen(lkey)),
|
|
toku_fill_dbt(&rk, rkey, 1+strlen(rkey)),
|
|
false, false, 0);
|
|
r = toku_ft_cursor_set(c, &lk, found, NULL); assert(r == 0);
|
|
for (int j = 0; j < 100; ++j) {
|
|
r = toku_ft_cursor_next(c, found, NULL); assert(r == 0);
|
|
}
|
|
toku_ft_cursor_close(c);
|
|
}
|
|
|
|
r = toku_close_ft_handle_nolsn(t, 0); assert(r == 0);
|
|
toku_cachetable_close(&ct);
|
|
|
|
return 0;
|
|
}
|