Commit 46e20ddb authored by Barry Perlman's avatar Barry Perlman Committed by Yoni Fogel

[t:2892] Added test of upgrading tree with deeply nested transactions.

git-svn-id: file:///svn/toku/tokudb@25702 c7de825b-a66e-492c-adef-691d508d4ae1
parent 20540c01
...@@ -61,7 +61,8 @@ int CACHESIZE=old_default_cachesize; ...@@ -61,7 +61,8 @@ int CACHESIZE=old_default_cachesize;
int ALLOW_DUPS=0; int ALLOW_DUPS=0;
// max depth of nested transactions for this test // max depth of nested transactions for this test
#define MAXDEPTH 128 //#define MAXDEPTH 128
#define MAXDEPTH 64
static void static void
nested_insert(DB ** dbs, uint depth, DB_TXN *parent_txn, uint k, uint generated_value); nested_insert(DB ** dbs, uint depth, DB_TXN *parent_txn, uint k, uint generated_value);
...@@ -251,10 +252,6 @@ static void run_test(void) ...@@ -251,10 +252,6 @@ static void run_test(void)
r = env->close(env, 0); CKERR(r); r = env->close(env, 0); CKERR(r);
toku_free(dbs); toku_free(dbs);
// reopen, then close environment to trim logfiles
r = db_env_create(&env, 0); CKERR(r);
r = env->open(env, env_dir, envflags, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
r = env->close(env, 0); CKERR(r);
} }
// ------------ infrastructure ---------- // ------------ infrastructure ----------
......
/* -*- mode: C; c-basic-offset: 4 -*- */
#ident "Copyright (c) 2010 Tokutek Inc. All rights reserved."
#ident "$Id$"
#define kv_pair_funcs 1 // pull in kv_pair generators from test.h
#include "test.h"
#include "toku_pthread.h"
#include "toku_atomic.h"
#include <db.h>
#include <sys/stat.h>
#include "ydb-internal.h"
#include "test_kv_gen.h"
/*
*/
DB_ENV *env;
enum {MAX_NAME=128};
int NUM_DBS=1;
int NUM_ROWS=50000;
int SRC_VERSION = 4;
#define MAXDEPTH 64
#define OLDDATADIR "../../../../tokudb.data/"
char *env_dir = ENVDIR; // the default env_dir.
char *db_v5_dir = "dir.preload-db-nested.c.tdb";
char *db_v4_dir = OLDDATADIR "env_preload.4.1.1.nested.cleanshutdown";
static void
check_results_nested(DB ** dbs, const uint num_rows) {
int num_dbs = 1; // maybe someday increase
for(int j=0;j<num_dbs;j++){
DBT key, val;
unsigned int k=0, v=0;
dbt_init(&key, &k, sizeof(unsigned int));
dbt_init(&val, &v, sizeof(unsigned int));
int r;
DB_TXN *txn;
r = env->txn_begin(env, NULL, &txn, 0);
CKERR(r);
DBC *cursor;
r = dbs[j]->cursor(dbs[j], txn, &cursor, 0);
CKERR(r);
for(uint i=0;i<num_rows;i++) {
if (i % MAXDEPTH) {
r = cursor->c_get(cursor, &key, &val, DB_NEXT);
CKERR(r);
uint observed_k = *(unsigned int*)key.data;
uint observed_v = *(unsigned int*)val.data;
uint expected_k = i;
uint generated_value = generate_val(i, 0);
uint expected_v = generated_value + (i%MAXDEPTH - 1);
if (verbose >= 3)
printf("expected key %d, observed key %d, expected val %d, observed val %d\n",
expected_k, observed_k, expected_v, observed_v);
// test that we have the expected keys and values
assert(observed_k == expected_k);
assert(observed_v == expected_v);
}
dbt_init(&key, NULL, sizeof(unsigned int));
dbt_init(&val, NULL, sizeof(unsigned int));
if ( verbose && (i%10000 == 0)) {printf("."); fflush(stdout);}
}
r = cursor->c_close(cursor);
CKERR(r);
r = txn->commit(txn, 0);
CKERR(r);
}
if ( verbose ) {printf("ok");fflush(stdout);}
}
static void upgrade_test_1(DB **dbs) {
int r;
// open the DBS
{
DBT desc;
dbt_init(&desc, "foo", sizeof("foo"));
char name[MAX_NAME*2];
int idx[MAX_DBS];
for(int i=0;i<NUM_DBS;i++) {
idx[i] = i;
r = db_create(&dbs[i], env, 0); CKERR(r);
r = dbs[i]->set_descriptor(dbs[i], 1, &desc); CKERR(r);
dbs[i]->app_private = &idx[i];
snprintf(name, sizeof(name), "db_%04x", i);
r = dbs[i]->open(dbs[i], NULL, name, NULL, DB_BTREE, DB_CREATE, 0666); CKERR(r);
}
}
// read and verify all rows
{
if ( verbose ) {printf("checking");fflush(stdout);}
check_results_nested(&dbs[0], NUM_ROWS);
if ( verbose) {printf("\ndone\n");fflush(stdout);}
}
// close
{
for(int i=0;i<NUM_DBS;i++) {
dbs[i]->close(dbs[i], 0); CKERR(r);
dbs[i] = NULL;
}
}
}
static void setup(void) {
int r;
int len = 256;
char syscmd[len];
char * src_db_dir;
if ( SRC_VERSION == 4 ) {
src_db_dir = db_v4_dir;
}
else if ( SRC_VERSION == 5 ) {
src_db_dir = db_v5_dir;
}
else {
fprintf(stderr, "unsupported TokuDB version %d to upgrade\n", SRC_VERSION);
assert(0);
}
r = snprintf(syscmd, len, "rm -rf %s", env_dir);
assert(r<len);
r = system(syscmd);
CKERR(r);
r = snprintf(syscmd, len, "cp -r %s %s", src_db_dir, env_dir);
assert(r<len);
r = system(syscmd);
CKERR(r);
generate_permute_tables();
}
static void run_test(void)
{
int r;
r = db_env_create(&env, 0); CKERR(r);
r = env->set_default_bt_compare(env, uint_dbt_cmp); CKERR(r);
r = env->set_cachesize(env, 0, 512*1024, 1); CKERR(r);
r = env->set_redzone(env, 0); CKERR(r);
int envflags = DB_INIT_LOCK | DB_INIT_LOG | DB_INIT_MPOOL | DB_INIT_TXN | DB_CREATE | DB_PRIVATE;
r = env->open(env, env_dir, envflags, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
env->set_errfile(env, stderr);
r = env->checkpointing_set_period(env, 1); CKERR(r);
DB **dbs = (DB**)toku_malloc(sizeof(DB*) * NUM_DBS);
assert(dbs != NULL);
// --------------------------
upgrade_test_1(dbs);
// --------------------------
if (verbose >= 2)
print_engine_status(env);
r = env->close(env, 0); CKERR(r);
toku_free(dbs);
}
// ------------ infrastructure ----------
static void do_args(int argc, char * const argv[]);
int test_main(int argc, char * const *argv) {
do_args(argc, argv);
setup();
run_test(); // read, upgrade, write back to disk
run_test(); // read and verify
return 0;
}
static void do_args(int argc, char * const argv[]) {
int resultcode;
char *cmd = argv[0];
argc--; argv++;
while (argc>0) {
if (strcmp(argv[0], "-v")==0) {
verbose++;
} else if (strcmp(argv[0],"-q")==0) {
verbose--;
if (verbose<0) verbose=0;
} else if (strcmp(argv[0], "-h")==0) {
resultcode=0;
do_usage:
fprintf(stderr, "Usage: -h -r <num_rows> %s\n", cmd);
exit(resultcode);
} else if (strcmp(argv[0], "-r")==0) {
argc--; argv++;
NUM_ROWS = atoi(argv[0]);
} else if (strcmp(argv[0], "-V")==0) {
argc--; argv++;
SRC_VERSION = atoi(argv[0]);
} else {
fprintf(stderr, "Unknown arg: %s\n", argv[0]);
resultcode=1;
goto do_usage;
}
argc--;
argv++;
}
}
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment