mirror of
https://github.com/MariaDB/server.git
synced 2025-01-21 22:34:18 +01:00
193 lines
7 KiB
C++
193 lines
7 KiB
C++
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
|
|
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
|
|
// test sub block compression and decompression
|
|
#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:
|
|
|
|
TokuFT, 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.
|
|
This software is covered by US Patent No. 8,489,638.
|
|
|
|
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 <toku_portability.h>
|
|
#include "test.h"
|
|
#include <stdio.h>
|
|
#include <errno.h>
|
|
#include <string.h>
|
|
|
|
#include "serialize/sub_block.h"
|
|
|
|
static void
|
|
test_sub_block_compression(void *buf, int total_size, int my_max_sub_blocks, int n_cores, enum toku_compression_method method) {
|
|
if (verbose)
|
|
printf("%s:%d %d %d\n", __FUNCTION__, __LINE__, total_size, my_max_sub_blocks);
|
|
|
|
int r;
|
|
|
|
int sub_block_size, n_sub_blocks;
|
|
r = choose_sub_block_size(total_size, my_max_sub_blocks, &sub_block_size, &n_sub_blocks);
|
|
assert(r == 0);
|
|
if (verbose)
|
|
printf("%s:%d %d %d\n", __FUNCTION__, __LINE__, sub_block_size, n_sub_blocks);
|
|
|
|
struct sub_block sub_blocks[n_sub_blocks];
|
|
set_all_sub_block_sizes(total_size, sub_block_size, n_sub_blocks, sub_blocks);
|
|
|
|
size_t cbuf_size_bound = get_sum_compressed_size_bound(n_sub_blocks, sub_blocks, method);
|
|
void *cbuf = toku_malloc(cbuf_size_bound);
|
|
assert(cbuf);
|
|
|
|
size_t cbuf_size = compress_all_sub_blocks(n_sub_blocks, sub_blocks, (char*)buf, (char*)cbuf, n_cores, NULL, method);
|
|
assert(cbuf_size <= cbuf_size_bound);
|
|
|
|
void *ubuf = toku_malloc(total_size);
|
|
assert(ubuf);
|
|
|
|
r = decompress_all_sub_blocks(n_sub_blocks, sub_blocks, (unsigned char*)cbuf, (unsigned char*)ubuf, n_cores, NULL);
|
|
assert(r == 0);
|
|
|
|
assert(memcmp(buf, ubuf, total_size) == 0);
|
|
|
|
toku_free(ubuf);
|
|
toku_free(cbuf);
|
|
}
|
|
|
|
static void
|
|
set_random(void *buf, int total_size) {
|
|
char *bp = (char *) buf;
|
|
for (int i = 0; i < total_size; i++)
|
|
bp[i] = random();
|
|
}
|
|
|
|
static void
|
|
run_test(int total_size, int n_cores, enum toku_compression_method method) {
|
|
void *buf = toku_malloc(total_size);
|
|
assert(buf);
|
|
|
|
for (int my_max_sub_blocks = 1; my_max_sub_blocks <= max_sub_blocks; my_max_sub_blocks++) {
|
|
memset(buf, 0, total_size);
|
|
test_sub_block_compression(buf, total_size, my_max_sub_blocks, n_cores, method);
|
|
|
|
set_random(buf, total_size);
|
|
test_sub_block_compression(buf, total_size, my_max_sub_blocks, n_cores, method);
|
|
}
|
|
|
|
toku_free(buf);
|
|
}
|
|
int
|
|
test_main (int argc, const char *argv[]) {
|
|
int n_cores = 1;
|
|
int e = 1;
|
|
|
|
for (int i = 1; i < argc; i++) {
|
|
const char *arg = argv[i];
|
|
if (strcmp(arg, "-v") == 0 || strcmp(arg, "--verbose") == 0) {
|
|
verbose++;
|
|
continue;
|
|
}
|
|
if (strcmp(arg, "-n") == 0) {
|
|
if (i+1 < argc) {
|
|
n_cores = atoi(argv[++i]);
|
|
continue;
|
|
}
|
|
}
|
|
if (strcmp(arg, "-e") == 0) {
|
|
if (i+1 < argc) {
|
|
e = atoi(argv[++i]);
|
|
continue;
|
|
}
|
|
}
|
|
}
|
|
|
|
for (int total_size = 256*1024; total_size <= 4*1024*1024; total_size *= 2) {
|
|
for (int size = total_size - e; size <= total_size + e; size++) {
|
|
run_test(size, n_cores, TOKU_NO_COMPRESSION);
|
|
run_test(size, n_cores, TOKU_ZLIB_METHOD);
|
|
run_test(size, n_cores, TOKU_ZLIB_WITHOUT_CHECKSUM_METHOD);
|
|
run_test(size, n_cores, TOKU_QUICKLZ_METHOD);
|
|
run_test(size, n_cores, TOKU_LZMA_METHOD);
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|