/* -*- mode: C; c-basic-offset: 4; indent-tabs-mode: nil -*- */ // vim: expandtab:ts=8:sw=4:softtabstop=4: #ident "Copyright (c) 2007-2010 Tokutek Inc. All rights reserved." #include #include #include // Define BDB if you want to compile this to use Berkeley DB #include #include #ifdef BDB #include #include #define DIRSUF bdb #else #include #define DIRSUF tokudb #endif #include #include #include #include #include static inline float toku_tdiff (struct timeval *a, struct timeval *b) { return (a->tv_sec - b->tv_sec) +1e-6*(a->tv_usec - b->tv_usec); } #if !defined(DB_PRELOCKED_WRITE) #define NO_DB_PRELOCKED #define DB_PRELOCKED_WRITE 0 #endif int verbose=1; enum { SERIAL_SPACING = 1<<6 }; enum { DEFAULT_ITEMS_TO_INSERT_PER_ITERATION = 1<<20 }; enum { DEFAULT_ITEMS_PER_TRANSACTION = 1<<14 }; static void insert (long long v); #define CKERR(r) ({ int __r = r; if (__r!=0) fprintf(stderr, "%s:%d error %d %s\n", __FILE__, __LINE__, __r, db_strerror(r)); assert(__r==0); }) #define CKERR2(r,rexpect) if (r!=rexpect) fprintf(stderr, "%s:%d error %d %s\n", __FILE__, __LINE__, r, db_strerror(r)); assert(r==rexpect); /* default test parameters */ int keysize = sizeof (long long); int valsize = sizeof (long long); int pagesize = 0; long long cachesize = 128*1024*1024; int do_1514_point_query = 0; int dupflags = 0; int noserial = 0; // Don't do the serial stuff int norandom = 0; // Don't do the random stuff int prelock = 0; int prelockflag = 0; int items_per_transaction = DEFAULT_ITEMS_PER_TRANSACTION; int items_per_iteration = DEFAULT_ITEMS_TO_INSERT_PER_ITERATION; int finish_child_first = 0; // Commit or abort child first (before doing so to the parent). No effect if child does not exist. int singlex_child = 0; // Do a single transaction, but do all work with a child int singlex = 0; // Do a single transaction int singlex_create = 0; // Create the db using the single transaction (only valid if singlex) int insert1first = 0; // insert 1 before doing the rest int check_small_rollback = 0; // verify that the rollback logs are small (only valid if singlex) int do_transactions = 0; int if_transactions_do_logging = DB_INIT_LOG; // set this to zero if we want no logging when transactions are used int do_abort = 0; int n_insertions_since_txn_began=0; int env_open_flags = DB_CREATE|DB_PRIVATE|DB_INIT_MPOOL; u_int32_t put_flags = 0; double compressibility = -1; // -1 means make it very compressible. 1 means use random bits everywhere. 2 means half the bits are random. int do_append = 0; int do_checkpoint_period = 0; u_int32_t checkpoint_period = 0; static void do_prelock(DB* db, DB_TXN* txn) { if (prelock) { #if !defined(NO_DB_PRELOCKED) int r = db->pre_acquire_table_lock(db, txn); assert(r==0); #else db = db; txn = txn; #endif } } #define STRINGIFY2(s) #s #define STRINGIFY(s) STRINGIFY2(s) const char *dbdir = "./bench." STRINGIFY(DIRSUF); char *dbfilename = "bench.db"; char *dbname; DB_ENV *dbenv; DB *db; DB_TXN *parenttid=0; DB_TXN *tid=0; static void benchmark_setup (void) { int r; if (!do_append) { char unlink_cmd[strlen(dbdir) + strlen("rm -rf ") + 1]; snprintf(unlink_cmd, sizeof(unlink_cmd), "rm -rf %s", dbdir); //printf("unlink_cmd=%s\n", unlink_cmd); system(unlink_cmd); if (strcmp(dbdir, ".") != 0) { r = mkdir(dbdir,S_IRWXU|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH); assert(r == 0); } } r = db_env_create(&dbenv, 0); assert(r == 0); #if DB_VERSION_MAJOR == 4 && DB_VERSION_MINOR <= 4 if (dbenv->set_lk_max) { r = dbenv->set_lk_max(dbenv, items_per_transaction*2); assert(r==0); } #endif if (dbenv->set_lk_max_locks) { r = dbenv->set_lk_max_locks(dbenv, items_per_transaction*2); assert(r == 0); } if (dbenv->set_cachesize) { r = dbenv->set_cachesize(dbenv, cachesize / (1024*1024*1024), cachesize % (1024*1024*1024), 1); if (r != 0) printf("WARNING: set_cachesize %d\n", r); } { r = dbenv->open(dbenv, dbdir, env_open_flags, S_IRUSR|S_IWUSR|S_IRGRP|S_IROTH); assert(r == 0); } #if defined(TOKUDB) if (do_checkpoint_period) { r = dbenv->checkpointing_set_period(dbenv, checkpoint_period); assert(r == 0); u_int32_t period; r = dbenv->checkpointing_get_period(dbenv, &period); assert(r == 0 && period == checkpoint_period); } #endif r = db_create(&db, dbenv, 0); assert(r == 0); if (do_transactions) { r=dbenv->txn_begin(dbenv, 0, &tid, 0); CKERR(r); } if (pagesize && db->set_pagesize) { r = db->set_pagesize(db, pagesize); assert(r == 0); } if (dupflags) { r = db->set_flags(db, dupflags); assert(r == 0); } r = db->open(db, tid, dbfilename, NULL, DB_BTREE, DB_CREATE, S_IRUSR|S_IWUSR|S_IRGRP|S_IROTH); if (r!=0) fprintf(stderr, "errno=%d, %s\n", errno, strerror(errno)); assert(r == 0); if (insert1first) { if (do_transactions) { r=tid->commit(tid, 0); assert(r==0); tid = NULL; r=dbenv->txn_begin(dbenv, 0, &tid, 0); CKERR(r); } insert(-1); if (singlex) { r=tid->commit(tid, 0); assert(r==0); tid = NULL; r=dbenv->txn_begin(dbenv, 0, &tid, 0); CKERR(r); } } else if (singlex && !singlex_create) { r=tid->commit(tid, 0); assert(r==0); tid = NULL; r=dbenv->txn_begin(dbenv, 0, &tid, 0); CKERR(r); } if (do_transactions) { if (singlex) do_prelock(db, tid); else { r=tid->commit(tid, 0); assert(r==0); tid = NULL; } } if (singlex_child) { parenttid = tid; tid = NULL; r=dbenv->txn_begin(dbenv, parenttid, &tid, 0); CKERR(r); } } static void benchmark_shutdown (void) { int r; if (do_transactions && singlex && !insert1first && (singlex_create || prelock)) { #if defined(TOKUDB) //There should be a single 'truncate' in the rollback instead of many 'insert' entries. struct txn_stat *s; r = tid->txn_stat(tid, &s); assert(r==0); //TODO: #1125 Always do the test after performance testing is done. if (singlex_child) fprintf(stderr, "SKIPPED 'small rollback' test for child txn\n"); else assert(s->rollback_raw_count < 100); // gross test, not worth investigating details free(s); //system("ls -l bench.tokudb"); #endif } if (do_transactions && singlex) { if (!singlex_child || finish_child_first) { assert(tid); r = (do_abort ? tid->abort(tid) : tid->commit(tid, 0)); assert(r==0); tid = NULL; } if (singlex_child) { assert(parenttid); r = (do_abort ? parenttid->abort(parenttid) : parenttid->commit(parenttid, 0)); assert(r==0); parenttid = NULL; } else assert(!parenttid); } assert(!tid); assert(!parenttid); r = db->close(db, 0); assert(r == 0); r = dbenv->close(dbenv, 0); assert(r == 0); } static void long_long_to_array (unsigned char *a, int array_size, unsigned long long l) { int i; for (i=0; i<8 && i>(56-8*i))&0xff; } static DBT *fill_dbt(DBT *dbt, const void *data, int size) { memset(dbt, 0, sizeof *dbt); dbt->size = size; dbt->data = (void *) data; return dbt; } // Fill array with 0's if compressibilty==-1, otherwise fill array with data that is likely to compress by a factor of compressibility. static void fill_array (unsigned char *data, int size) { memset(data, 0, size); if (compressibility>0) { int i; for (i=0; iput(db, tid, fill_dbt(&kt, kc, keysize), fill_dbt(&vt, vc, valsize), put_flags); CKERR(r); if (do_transactions) { if (n_insertions_since_txn_began>=items_per_transaction && !singlex) { n_insertions_since_txn_began=0; r = tid->commit(tid, 0); assert(r==0); tid = NULL; r=dbenv->txn_begin(dbenv, 0, &tid, 0); assert(r==0); do_prelock(db, tid); n_insertions_since_txn_began=0; } n_insertions_since_txn_began++; } } static void serial_insert_from (long long from) { long long i; if (do_transactions && !singlex) { int r = dbenv->txn_begin(dbenv, 0, &tid, 0); assert(r==0); do_prelock(db, tid); { DBT k,v; r=db->put(db, tid, fill_dbt(&k, "a", 1), fill_dbt(&v, "b", 1), put_flags); CKERR(r); } } for (i=0; icommit(tid, 0); assert(r==0); tid=NULL; } } static long long llrandom (void) { return (((long long)(random()))<<32) + random(); } static void random_insert_below (long long below) { long long i; if (do_transactions && !singlex) { int r = dbenv->txn_begin(dbenv, 0, &tid, 0); assert(r==0); do_prelock(db, tid); } for (i=0; icommit(tid, 0); assert(r==0); tid=NULL; } } static void biginsert (long long n_elements, struct timeval *starttime) { long long i; struct timeval t1,t2; int iteration; for (i=0, iteration=0; i= argc) return print_usage(argv[0]); items_per_transaction = strtoll(argv[++i], &endptr, 10); assert(*endptr == 0); } else if (strcmp(arg, "--abort") == 0) { do_abort = 1; } else if (strcmp(arg, "--periter") == 0) { if (i+1 >= argc) return print_usage(argv[0]); items_per_iteration = strtoll(argv[++i], &endptr, 10); assert(*endptr == 0); } else if (strcmp(arg, "--cachesize") == 0) { if (i+1 >= argc) return print_usage(argv[0]); cachesize = strtoll(argv[++i], &endptr, 10); assert(*endptr == 0); } else if (strcmp(arg, "--keysize") == 0) { if (i+1 >= argc) return print_usage(argv[0]); keysize = atoi(argv[++i]); } else if (strcmp(arg, "--valsize") == 0) { if (i+1 >= argc) return print_usage(argv[0]); valsize = atoi(argv[++i]); } else if (strcmp(arg, "--pagesize") == 0) { if (i+1 >= argc) return print_usage(argv[0]); pagesize = atoi(argv[++i]); } else if (strcmp(arg, "--env") == 0) { if (i+1 >= argc) return print_usage(argv[0]); dbdir = argv[++i]; #if defined(TOKUDB) } else if (strcmp(arg, "--1514") == 0) { do_1514_point_query=1; #endif } else if (strcmp(arg, "--prelock") == 0) { prelock=1; } else if (strcmp(arg, "--prelockflag") == 0) { prelock=1; prelockflag=1; } else if (strcmp(arg, "--srandom") == 0) { if (i+1 >= argc) return print_usage(argv[0]); srandom(atoi(argv[++i])); } else if (strcmp(arg, "--append") == 0) { do_append = 1; } else if (strcmp(arg, "--checkpoint-period") == 0) { if (i+1 >= argc) return print_usage(argv[9]); do_checkpoint_period = 1; checkpoint_period = (u_int32_t) atoi(argv[++i]); } else if (strcmp(arg, "--unique_checks") == 0) { if (i+1 >= argc) return print_usage(argv[0]); int unique_checks = atoi(argv[++i]); if (unique_checks) put_flags = DB_NOOVERWRITE; else put_flags = 0; } else { return print_usage(argv[0]); } } if (do_transactions) { env_open_flags |= DB_INIT_TXN | if_transactions_do_logging | DB_INIT_LOCK; } if (do_transactions && prelockflag) { put_flags |= DB_PRELOCKED_WRITE; } if (i