/* -*- 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 . ---------------------------------------- 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 . ======= */ #ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved." #include "test.h" // verify that update_multiple where we change the data in row[i] col[j] from x to x+1 static int get_key(int i, int dbnum) { return htonl(2*(i + dbnum)); } static int get_new_key(int i, int dbnum) { return htonl(2*(i + dbnum) + 1); } static void get_data(int *v, int i, int ndbs) { for (int dbnum = 0; dbnum < ndbs; dbnum++) { v[dbnum] = get_key(i, dbnum); } } static void get_new_data(int *v, int i, int ndbs) { for (int dbnum = 0; dbnum < ndbs; dbnum++) { if ((i % ndbs) == dbnum) v[dbnum] = get_new_key(i, dbnum); else v[dbnum] = get_key(i, dbnum); } } static int put_callback(DB *dest_db, DB *src_db, DBT_ARRAY *dest_key_arrays, DBT_ARRAY *dest_val_arrays, const DBT *src_key, const DBT *src_val) { toku_dbt_array_resize(dest_key_arrays, 1); DBT *dest_key = &dest_key_arrays->dbts[0]; DBT *dest_val = NULL; if (dest_val_arrays) { toku_dbt_array_resize(dest_val_arrays, 1); dest_val = &dest_val_arrays->dbts[0]; } (void) dest_db; (void) src_db; (void) dest_key; (void) dest_val; (void) src_key; (void) src_val; unsigned int dbnum; assert(dest_db->descriptor->dbt.size == sizeof dbnum); memcpy(&dbnum, dest_db->descriptor->dbt.data, sizeof dbnum); assert(dbnum < src_val->size / sizeof (int)); int *pri_key = (int *) src_key->data; int *pri_data = (int *) src_val->data; switch (dest_key->flags) { case 0: dest_key->size = sizeof (int); dest_key->data = dbnum == 0 ? &pri_key[dbnum] : &pri_data[dbnum]; break; case DB_DBT_REALLOC: dest_key->size = sizeof (int); dest_key->data = toku_realloc(dest_key->data, dest_key->size); memcpy(dest_key->data, dbnum == 0 ? &pri_key[dbnum] : &pri_data[dbnum], dest_key->size); break; default: assert(0); } if (dest_val) { switch (dest_val->flags) { case 0: if (dbnum == 0) { dest_val->size = src_val->size; dest_val->data = src_val->data; } else dest_val->size = 0; break; case DB_DBT_REALLOC: if (dbnum == 0) { dest_val->size = src_val->size; dest_val->data = toku_realloc(dest_val->data, dest_val->size); memcpy(dest_val->data, src_val->data, dest_val->size); } else dest_val->size = 0; break; default: assert(0); } } return 0; } static int del_callback(DB *dest_db, DB *src_db, DBT_ARRAY *dest_key_arrays, const DBT *src_key, const DBT *src_data) { return put_callback(dest_db, src_db, dest_key_arrays, NULL, src_key, src_data); } #if 0 static void verify_locked(DB_ENV *env, DB *db, int k) { int r; DB_TXN *txn = NULL; r = env->txn_begin(env, NULL, &txn, 0); assert_zero(r); DBT key; dbt_init(&key, &k, sizeof k); r = db->del(db, txn, &key, DB_DELETE_ANY); assert(r == DB_LOCK_NOTGRANTED); r = txn->abort(txn); assert_zero(r); } static void verify_empty(DB_ENV *env, DB *db) { int r; DB_TXN *txn = NULL; r = env->txn_begin(env, NULL, &txn, 0); assert_zero(r); DBC *cursor = NULL; r = db->cursor(db, txn, &cursor, 0); assert_zero(r); int i; for (i = 0; ; i++) { DBT key; memset(&key, 0, sizeof key); DBT val; memset(&val, 0, sizeof val); r = cursor->c_get(cursor, &key, &val, DB_NEXT); if (r != 0) break; } assert_zero(i); r = cursor->c_close(cursor); assert_zero(r); r = txn->commit(txn, 0); assert_zero(r); } #endif static void verify_seq(DB_ENV *env, DB *db, int dbnum, int ndbs, int nrows) { int r; DB_TXN *txn = NULL; r = env->txn_begin(env, NULL, &txn, 0); assert_zero(r); DBC *cursor = NULL; r = db->cursor(db, txn, &cursor, 0); assert_zero(r); int i; for (i = 0; ; i++) { DBT key; memset(&key, 0, sizeof key); DBT val; memset(&val, 0, sizeof val); r = cursor->c_get(cursor, &key, &val, DB_NEXT); if (r != 0) break; int k; int expectk; if (dbnum == 0 || (i % ndbs) != dbnum) expectk = get_key(i, dbnum); else expectk = get_new_key(i, dbnum); assert(key.size == sizeof k); memcpy(&k, key.data, key.size); assert(k == expectk); if (dbnum == 0) { assert(val.size == ndbs * sizeof (int)); int v[ndbs]; get_new_data(v, i, ndbs); assert(memcmp(val.data, v, val.size) == 0); } else assert(val.size == 0); } assert(i == nrows); // if (i != nrows) printf("%s:%d %d %d\n", __FUNCTION__, __LINE__, i, nrows); // assert(i == nrows); r = cursor->c_close(cursor); assert_zero(r); r = txn->commit(txn, 0); assert_zero(r); } static void update_diagonal(DB_ENV *env, DB *db[], int ndbs, int nrows) { assert(ndbs > 0); int r; DB_TXN *txn = NULL; r = env->txn_begin(env, NULL, &txn, 0); assert_zero(r); for (int i = 0; i < nrows; i++) { // update the data i % ndbs col from x to x+1 int k = get_key(i, 0); DBT old_key; dbt_init(&old_key, &k, sizeof k); DBT new_key = old_key; int v[ndbs]; get_data(v, i, ndbs); DBT old_data; dbt_init(&old_data, &v[0], sizeof v); int newv[ndbs]; get_new_data(newv, i, ndbs); DBT new_data; dbt_init(&new_data, &newv[0], sizeof newv); int ndbts = 2 * ndbs; DBT keys[ndbts]; memset(keys, 0, sizeof keys); DBT vals[ndbts]; memset(vals, 0, sizeof vals); uint32_t flags_array[ndbs]; memset(flags_array, 0, sizeof(flags_array)); r = env_update_multiple_test_no_array(env, ndbs > 0 ? db[0] : NULL, txn, &old_key, &old_data, &new_key, &new_data, ndbs, db, flags_array, ndbts, keys, ndbts, vals); assert_zero(r); } r = txn->commit(txn, 0); assert_zero(r); } static void populate_primary(DB_ENV *env, DB *db, int ndbs, int nrows) { int r; DB_TXN *txn = NULL; r = env->txn_begin(env, NULL, &txn, 0); assert_zero(r); // populate for (int i = 0; i < nrows; i++) { int k = get_key(i, 0); int v[ndbs]; get_data(v, i, ndbs); DBT key; dbt_init(&key, &k, sizeof k); DBT val; dbt_init(&val, &v[0], sizeof v); r = db->put(db, txn, &key, &val, 0); assert_zero(r); } r = txn->commit(txn, 0); assert_zero(r); } static void populate_secondary(DB_ENV *env, DB *db, int dbnum, int nrows) { int r; DB_TXN *txn = NULL; r = env->txn_begin(env, NULL, &txn, 0); assert_zero(r); // populate for (int i = 0; i < nrows; i++) { int k = get_key(i, dbnum); DBT key; dbt_init(&key, &k, sizeof k); DBT val; dbt_init(&val, NULL, 0); r = db->put(db, txn, &key, &val, 0); assert_zero(r); } r = txn->commit(txn, 0); assert_zero(r); } static void run_test(int ndbs, int nrows) { int r; DB_ENV *env = NULL; r = db_env_create(&env, 0); assert_zero(r); r = env->set_generate_row_callback_for_put(env, put_callback); assert_zero(r); r = env->set_generate_row_callback_for_del(env, del_callback); assert_zero(r); r = env->open(env, TOKU_TEST_FILENAME, DB_INIT_MPOOL|DB_CREATE|DB_THREAD |DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_TXN|DB_PRIVATE, S_IRWXU+S_IRWXG+S_IRWXO); assert_zero(r); DB *db[ndbs]; for (int dbnum = 0; dbnum < ndbs; dbnum++) { r = db_create(&db[dbnum], env, 0); assert_zero(r); DBT dbt_dbnum; dbt_init(&dbt_dbnum, &dbnum, sizeof dbnum); char dbname[32]; sprintf(dbname, "%d.tdb", dbnum); r = db[dbnum]->open(db[dbnum], NULL, dbname, NULL, DB_BTREE, DB_AUTO_COMMIT+DB_CREATE, S_IRWXU+S_IRWXG+S_IRWXO); assert_zero(r); IN_TXN_COMMIT(env, NULL, txn_desc, 0, { { int chk_r = db[dbnum]->change_descriptor(db[dbnum], txn_desc, &dbt_dbnum, 0); CKERR(chk_r); } }); } for (int dbnum = 0; dbnum < ndbs-1; dbnum++) { if (dbnum == 0) populate_primary(env, db[dbnum], ndbs, nrows); else populate_secondary(env, db[dbnum], dbnum, nrows); } DB_TXN *indexer_txn = NULL; r = env->txn_begin(env, NULL, &indexer_txn, 0); assert_zero(r); DB_INDEXER *indexer = NULL; uint32_t db_flags = 0; r = env->create_indexer(env, indexer_txn, &indexer, db[0], 1, &db[ndbs-1], &db_flags, 0); assert_zero(r); update_diagonal(env, db, ndbs, nrows); r = indexer->build(indexer); assert_zero(r); r = indexer->close(indexer); assert_zero(r); r = indexer_txn->commit(indexer_txn, 0); assert_zero(r); for (int dbnum = 0; dbnum < ndbs; dbnum++) verify_seq(env, db[dbnum], dbnum, ndbs, nrows); for (int dbnum = 0; dbnum < ndbs; dbnum++) r = db[dbnum]->close(db[dbnum], 0); assert_zero(r); r = env->close(env, 0); assert_zero(r); } int test_main(int argc, char * const argv[]) { int r; int ndbs = 2; int nrows = 2; // parse_args(argc, argv); for (int i = 1; i < argc; i++) { char * const arg = argv[i]; if (strcmp(arg, "-v") == 0) { verbose++; continue; } if (strcmp(arg, "-q") == 0) { verbose = 0; continue; } if (strcmp(arg, "--ndbs") == 0 && i+1 < argc) { ndbs = atoi(argv[++i]); continue; } if (strcmp(arg, "--nrows") == 0 && i+1 < argc) { nrows = atoi(argv[++i]); continue; } } toku_os_recursive_delete(TOKU_TEST_FILENAME); r = toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO); assert_zero(r); run_test(ndbs, nrows); return 0; }