mirror of
https://github.com/MariaDB/server.git
synced 2025-01-24 07:44:22 +01:00
223 lines
9.4 KiB
C++
223 lines
9.4 KiB
C++
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
|
|
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
|
|
#ident "$Id$"
|
|
/*
|
|
COPYING CONDITIONS NOTICE:
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of version 2 of the GNU General Public License as
|
|
published by the Free Software Foundation, and provided that the
|
|
following conditions are met:
|
|
|
|
* Redistributions of source code must retain this COPYING
|
|
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
|
|
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
|
|
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
|
|
GRANT (below).
|
|
|
|
* Redistributions in binary form must reproduce this COPYING
|
|
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
|
|
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
|
|
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
|
|
GRANT (below) in the documentation and/or other materials
|
|
provided with the distribution.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
|
02110-1301, USA.
|
|
|
|
COPYRIGHT NOTICE:
|
|
|
|
TokuDB, Tokutek Fractal Tree Indexing Library.
|
|
Copyright (C) 2007-2013 Tokutek, Inc.
|
|
|
|
DISCLAIMER:
|
|
|
|
This program 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.
|
|
|
|
UNIVERSITY PATENT NOTICE:
|
|
|
|
The technology is licensed by the Massachusetts Institute of
|
|
Technology, Rutgers State University of New Jersey, and the Research
|
|
Foundation of State University of New York at Stony Brook under
|
|
United States of America Serial No. 11/760379 and to the patents
|
|
and/or patent applications resulting from it.
|
|
|
|
PATENT MARKING NOTICE:
|
|
|
|
This software is covered by US Patent No. 8,185,551.
|
|
|
|
PATENT RIGHTS GRANT:
|
|
|
|
"THIS IMPLEMENTATION" means the copyrightable works distributed by
|
|
Tokutek as part of the Fractal Tree project.
|
|
|
|
"PATENT CLAIMS" means the claims of patents that are owned or
|
|
licensable by Tokutek, both currently or in the future; and that in
|
|
the absence of this license would be infringed by THIS
|
|
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
|
|
|
|
"PATENT CHALLENGE" shall mean a challenge to the validity,
|
|
patentability, enforceability and/or non-infringement of any of the
|
|
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
|
|
|
|
Tokutek hereby grants to you, for the term and geographical scope of
|
|
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
|
|
irrevocable (except as stated in this section) patent license to
|
|
make, have made, use, offer to sell, sell, import, transfer, and
|
|
otherwise run, modify, and propagate the contents of THIS
|
|
IMPLEMENTATION, where such license applies only to the PATENT
|
|
CLAIMS. This grant does not include claims that would be infringed
|
|
only as a consequence of further modifications of THIS
|
|
IMPLEMENTATION. If you or your agent or licensee institute or order
|
|
or agree to the institution of patent litigation against any entity
|
|
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
|
THIS IMPLEMENTATION constitutes direct or contributory patent
|
|
infringement, or inducement of patent infringement, then any rights
|
|
granted to you under this License shall terminate as of the date
|
|
such litigation is filed. If you or your agent or exclusive
|
|
licensee institute or order or agree to the institution of a PATENT
|
|
CHALLENGE, then Tokutek may terminate any rights granted to you
|
|
under this License.
|
|
*/
|
|
|
|
#ident "Copyright (c) 2007-2013 Tokutek Inc. All rights reserved."
|
|
#include "test.h"
|
|
|
|
//
|
|
// This test verifies that the cleaner thread doesn't call the callback if
|
|
// nothing needs flushing.
|
|
//
|
|
|
|
toku_mutex_t attr_mutex;
|
|
|
|
// used to access engine status variables
|
|
#define STATUS_VALUE(x) ct_status.status[x].value.num
|
|
|
|
const PAIR_ATTR attrs[] = {
|
|
{ .size = 20, .nonleaf_size = 13, .leaf_size = 900, .rollback_size = 123, .cache_pressure_size = 403, .is_valid = true },
|
|
{ .size = 21, .nonleaf_size = 16, .leaf_size = 910, .rollback_size = 113, .cache_pressure_size = 401, .is_valid = true },
|
|
{ .size = 22, .nonleaf_size = 17, .leaf_size = 940, .rollback_size = 133, .cache_pressure_size = 402, .is_valid = true },
|
|
{ .size = 23, .nonleaf_size = 18, .leaf_size = 931, .rollback_size = 153, .cache_pressure_size = 404, .is_valid = true },
|
|
{ .size = 25, .nonleaf_size = 19, .leaf_size = 903, .rollback_size = 173, .cache_pressure_size = 413, .is_valid = true },
|
|
{ .size = 26, .nonleaf_size = 10, .leaf_size = 903, .rollback_size = 193, .cache_pressure_size = 423, .is_valid = true },
|
|
{ .size = 20, .nonleaf_size = 11, .leaf_size = 902, .rollback_size = 103, .cache_pressure_size = 433, .is_valid = true },
|
|
{ .size = 29, .nonleaf_size = 12, .leaf_size = 909, .rollback_size = 113, .cache_pressure_size = 443, .is_valid = true }
|
|
};
|
|
const int n_pairs = (sizeof attrs) / (sizeof attrs[0]);
|
|
|
|
static void
|
|
flush (CACHEFILE f __attribute__((__unused__)),
|
|
int UU(fd),
|
|
CACHEKEY k __attribute__((__unused__)),
|
|
void *v __attribute__((__unused__)),
|
|
void** UU(dd),
|
|
void *e __attribute__((__unused__)),
|
|
PAIR_ATTR s __attribute__((__unused__)),
|
|
PAIR_ATTR* new_size __attribute__((__unused__)),
|
|
bool w __attribute__((__unused__)),
|
|
bool keep __attribute__((__unused__)),
|
|
bool c __attribute__((__unused__)),
|
|
bool UU(is_clone)
|
|
) {
|
|
PAIR_ATTR *CAST_FROM_VOIDP(expect, e);
|
|
if (!keep) {
|
|
toku_mutex_lock(&attr_mutex); // purpose is to make this function single-threaded
|
|
expect->size -= s.size;
|
|
expect->nonleaf_size -= s.nonleaf_size;
|
|
expect->leaf_size -= s.leaf_size;
|
|
expect->rollback_size -= s.rollback_size;
|
|
expect->cache_pressure_size -= s.cache_pressure_size;
|
|
toku_mutex_unlock(&attr_mutex);
|
|
}
|
|
}
|
|
|
|
static void
|
|
run_test (void) {
|
|
const int test_limit = 1000;
|
|
int r;
|
|
CACHETABLE ct;
|
|
toku_mutex_init(&attr_mutex, NULL);
|
|
toku_cachetable_create(&ct, test_limit, ZERO_LSN, NULL_LOGGER);
|
|
|
|
const char *fname1 = TOKU_TEST_FILENAME;
|
|
unlink(fname1);
|
|
CACHEFILE f1;
|
|
r = toku_cachetable_openf(&f1, ct, fname1, O_RDWR|O_CREAT, S_IRWXU|S_IRWXG|S_IRWXO); assert(r == 0);
|
|
|
|
CACHETABLE_STATUS_S ct_status;
|
|
toku_cachetable_get_status(ct, &ct_status);
|
|
assert(STATUS_VALUE(CT_SIZE_NONLEAF) == 0);
|
|
assert(STATUS_VALUE(CT_SIZE_LEAF) == 0);
|
|
assert(STATUS_VALUE(CT_SIZE_ROLLBACK) == 0);
|
|
assert(STATUS_VALUE(CT_SIZE_CACHEPRESSURE) == 0);
|
|
|
|
void* vs[n_pairs];
|
|
//void* v2;
|
|
long ss[n_pairs];
|
|
//long s2;
|
|
PAIR_ATTR expect = { .size = 0, .nonleaf_size = 0, .leaf_size = 0, .rollback_size = 0, .cache_pressure_size = 0 };
|
|
CACHETABLE_WRITE_CALLBACK wc = def_write_callback(NULL);
|
|
wc.flush_callback = flush;
|
|
wc.write_extraargs = &expect;
|
|
for (int i = 0; i < n_pairs; ++i) {
|
|
r = toku_cachetable_get_and_pin(f1, make_blocknum(i+1), i+1, &vs[i], &ss[i],
|
|
wc,
|
|
def_fetch,
|
|
def_pf_req_callback,
|
|
def_pf_callback,
|
|
true,
|
|
&expect);
|
|
assert_zero(r);
|
|
r = toku_test_cachetable_unpin(f1, make_blocknum(i+1), i+1, CACHETABLE_DIRTY, attrs[i]);
|
|
assert_zero(r);
|
|
expect.size += attrs[i].size;
|
|
expect.nonleaf_size += attrs[i].nonleaf_size;
|
|
expect.leaf_size += attrs[i].leaf_size;
|
|
expect.rollback_size += attrs[i].rollback_size;
|
|
expect.cache_pressure_size += attrs[i].cache_pressure_size;
|
|
}
|
|
|
|
toku_cachetable_get_status(ct, &ct_status);
|
|
assert(STATUS_VALUE(CT_SIZE_NONLEAF ) == (uint64_t) expect.nonleaf_size);
|
|
assert(STATUS_VALUE(CT_SIZE_LEAF ) == (uint64_t) expect.leaf_size);
|
|
assert(STATUS_VALUE(CT_SIZE_ROLLBACK ) == (uint64_t) expect.rollback_size);
|
|
assert(STATUS_VALUE(CT_SIZE_CACHEPRESSURE) == (uint64_t) expect.cache_pressure_size);
|
|
|
|
void *big_v;
|
|
long big_s;
|
|
r = toku_cachetable_get_and_pin(f1, make_blocknum(n_pairs + 1), n_pairs + 1, &big_v, &big_s,
|
|
wc,
|
|
def_fetch,
|
|
def_pf_req_callback,
|
|
def_pf_callback,
|
|
true,
|
|
&expect);
|
|
toku_test_cachetable_unpin(f1, make_blocknum(n_pairs + 1), n_pairs + 1, CACHETABLE_CLEAN,
|
|
make_pair_attr(test_limit - expect.size + 20));
|
|
|
|
usleep(2*1024*1024);
|
|
|
|
toku_cachetable_get_status(ct, &ct_status);
|
|
assert(STATUS_VALUE(CT_SIZE_NONLEAF ) == (uint64_t) expect.nonleaf_size);
|
|
assert(STATUS_VALUE(CT_SIZE_LEAF ) == (uint64_t) expect.leaf_size);
|
|
assert(STATUS_VALUE(CT_SIZE_ROLLBACK ) == (uint64_t) expect.rollback_size);
|
|
assert(STATUS_VALUE(CT_SIZE_CACHEPRESSURE) == (uint64_t) expect.cache_pressure_size);
|
|
|
|
toku_cachetable_verify(ct);
|
|
toku_cachefile_close(&f1, false, ZERO_LSN);
|
|
toku_cachetable_close(&ct);
|
|
}
|
|
|
|
int
|
|
test_main(int argc, const char *argv[]) {
|
|
default_parse_args(argc, argv);
|
|
run_test();
|
|
return 0;
|
|
}
|
|
|
|
#undef STATUS_VALUE
|