mariadb/newbrt/tests/brt-test3.c
Rich Prohaska 35a46f2e5e #3853 make the lock tree memory accounting more accurate refs[t:3853]
git-svn-id: file:///svn/toku/tokudb@36278 c7de825b-a66e-492c-adef-691d508d4ae1
2013-04-16 23:59:53 -04:00

77 lines
1.9 KiB
C

/* -*- mode: C; c-basic-offset: 4 -*- */
#ident "$Id$"
#ident "Copyright (c) 2007, 2008 Tokutek Inc. All rights reserved."
#include "includes.h"
#include "test.h"
#include "toku_time.h"
static const char fname[]= __FILE__ ".brt";
static TOKUTXN const null_txn = 0;
static DB * const null_db = 0;
static void test3 (int nodesize, int basementnodesize, int count) {
BRT t;
int r;
struct timeval t0,t1;
int i;
CACHETABLE ct;
r = toku_brt_create_cachetable(&ct, 0, ZERO_LSN, NULL_LOGGER); assert(r==0);
gettimeofday(&t0, 0);
unlink(fname);
r = toku_open_brt(fname, 1, &t, nodesize, basementnodesize, ct, null_txn, toku_builtin_compare_fun, null_db);
assert(r==0);
for (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);
r = toku_brt_insert(t, toku_fill_dbt(&k, key, 1+strlen(key)), toku_fill_dbt(&v, val, 1+strlen(val)), null_txn);
assert(r==0);
}
r = toku_verify_brt(t); assert(r==0);
r = toku_close_brt(t, 0); assert(r==0);
r = toku_cachetable_close(&ct); assert(r==0);
gettimeofday(&t1, 0);
{
double diff = toku_tdiff(&t1, &t0);
if (verbose) printf("serial insertions: blocksize=%d %d insertions in %.3f seconds, %.2f insertions/second\n", nodesize, count, diff, count/diff);
}
}
static void brt_blackbox_test (void) {
if (verbose) printf("test3 slow\n");
test3(2048, 512, 1<<15);
if (verbose) printf("test3 fast\n");
//if (verbose) toku_pma_show_stats();
test3(1<<15, 1<<12, 1024);
if (verbose) printf("test3 fast\n");
test3(1<<18, 1<<15, 1<<20);
// test3(1<<19, 1<<16, 1<<20);
// test3(1<<20, 1<<17, 1<<20);
// test3(1<<20, 1<<17, 1<<21);
// test3(1<<20, 1<<17, 1<<22);
}
int
test_main (int argc , const char *argv[]) {
default_parse_args(argc, argv);
brt_blackbox_test();
if (verbose) printf("test ok\n");
return 0;
}