mirror of
				https://github.com/MariaDB/server.git
				synced 2025-10-31 02:46:29 +01:00 
			
		
		
		
	
		
			
				
	
	
		
			142 lines
		
	
	
	
		
			4.7 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			142 lines
		
	
	
	
		
			4.7 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."
 | |
| 
 | |
| // test sub block compression and decompression
 | |
| 
 | |
| #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;
 | |
| }
 | 
