/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */ // vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4: #ident "$Id$" /* COPYING CONDITIONS NOTICE: This program is free software; you can redistribute it and/or modify it under the terms of version 2 of the GNU General Public License as published by the Free Software Foundation, and provided that the following conditions are met: * Redistributions of source code must retain this COPYING CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the PATENT MARKING NOTICE (below), and the PATENT RIGHTS GRANT (below). * Redistributions in binary form must reproduce this COPYING CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the PATENT MARKING NOTICE (below), and the PATENT RIGHTS GRANT (below) in the documentation and/or other materials provided with the distribution. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. COPYRIGHT NOTICE: TokuDB, Tokutek Fractal Tree Indexing Library. Copyright (C) 2007-2013 Tokutek, Inc. DISCLAIMER: This program 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. UNIVERSITY PATENT NOTICE: The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it. PATENT MARKING NOTICE: This software is covered by US Patent No. 8,185,551. PATENT RIGHTS GRANT: "THIS IMPLEMENTATION" means the copyrightable works distributed by Tokutek as part of the Fractal Tree project. "PATENT CLAIMS" means the claims of patents that are owned or licensable by Tokutek, both currently or in the future; and that in the absence of this license would be infringed by THIS IMPLEMENTATION or by using or running THIS IMPLEMENTATION. "PATENT CHALLENGE" shall mean a challenge to the validity, patentability, enforceability and/or non-infringement of any of the PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS. Tokutek hereby grants to you, for the term and geographical scope of the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, transfer, and otherwise run, modify, and propagate the contents of THIS IMPLEMENTATION, where such license applies only to the PATENT CLAIMS. This grant does not include claims that would be infringed only as a consequence of further modifications of THIS IMPLEMENTATION. If you or your agent or licensee institute or order or agree to the institution of patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that THIS IMPLEMENTATION constitutes direct or contributory patent infringement, or inducement of patent infringement, then any rights granted to you under this License shall terminate as of the date such litigation is filed. If you or your agent or exclusive licensee institute or order or agree to the institution of a PATENT CHALLENGE, then Tokutek may terminate any rights granted to you under this License. */ #ident "Copyright (c) 2007-2013 Tokutek Inc. All rights reserved." #include "test.h" //Verify aborting transactions works properly when transaction //starts with an empty db and a table lock. #include #include #include #include #include #include #include DB_ENV *env; DB *db; DB_TXN *null_txn = NULL; DB_TXN *txn; uint32_t find_num; long closemode = -1; // must be set to 0 or 1 on command line long logsize = -2; // must be set to a number from -1 to 20 inclusive, on command line. static void init(void) { int r; toku_os_recursive_delete(TOKU_TEST_FILENAME); ; r=toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r); r=db_env_create(&env, 0); CKERR(r); r=env->open(env, TOKU_TEST_FILENAME, DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_MPOOL|DB_INIT_TXN|DB_PRIVATE|DB_CREATE, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r); r=db_create(&db, env, 0); CKERR(r); r=db->open(db, null_txn, "foo.db", 0, DB_BTREE, DB_CREATE|DB_EXCL, S_IRWXU|S_IRWXG|S_IRWXO); CKERR(r); r=db->close(db, 0); CKERR(r); r=db_create(&db, env, 0); CKERR(r); r=db->open(db, null_txn, "foo.db", 0, DB_BTREE, 0, S_IRWXU|S_IRWXG|S_IRWXO); CKERR(r); r=env->txn_begin(env, 0, &txn, 0); CKERR(r); r=db->pre_acquire_table_lock(db, txn); CKERR(r); } static void tear_down(void) { int r; r = db->close(db, 0); CKERR(r); r = env->close(env, 0); CKERR(r); } static void abort_txn(void) { find_num = 0; int r = txn->abort(txn); CKERR(r); txn = NULL; } static void put(uint32_t k, uint32_t v) { int r; DBT key,val; dbt_init(&key, &k, sizeof(k)); dbt_init(&val, &v, sizeof(v)); r = db->put(db, txn, &key, &val, 0); CKERR(r); } static void test_insert_and_abort(uint32_t num_to_insert) { find_num = 0; uint32_t k; uint32_t v; uint32_t i; for (i=0; i < num_to_insert; i++) { k = htonl(i); v = htonl(i+num_to_insert); put(k, v); } abort_txn(); } static void test_insert_and_abort_and_insert(uint32_t num_to_insert) { test_insert_and_abort(num_to_insert); find_num = num_to_insert / 2; uint32_t k, v; uint32_t i; int r; r=env->txn_begin(env, 0, &txn, 0); CKERR(r); r=db->pre_acquire_table_lock(db, txn); CKERR(r); for (i=0; i < find_num; i++) { k = htonl(i); v = htonl(i+5); put(k, v); } txn->commit(txn, 0); txn = NULL; } #define bit0 (1<<0) #define bit1 (1<<1) static int do_nothing(DBT const *UU(a), DBT const *UU(b), void *UU(c)) { return 0; } static void verify_and_tear_down(int close_first) { int r; { char *filename; #if USE_TDB { DBT dname; DBT iname; dbt_init(&dname, "foo.db", sizeof("foo.db")); dbt_init(&iname, NULL, 0); iname.flags |= DB_DBT_MALLOC; r = env->get_iname(env, &dname, &iname); CKERR(r); CAST_FROM_VOIDP(filename, iname.data); assert(filename); } #else filename = toku_xstrdup("foo.db"); #endif toku_struct_stat statbuf; char fullfile[TOKU_PATH_MAX+1]; r = toku_stat(toku_path_join(fullfile, 2, TOKU_TEST_FILENAME, filename), &statbuf); assert(r==0); toku_free(filename); } CKERR(r); if (close_first) { r=db->close(db, 0); CKERR(r); r=db_create(&db, env, 0); CKERR(r); r=db->open(db, null_txn, "foo.db", 0, DB_BTREE, 0, S_IRWXU|S_IRWXG|S_IRWXO); CKERR(r); } DBC *cursor; r=env->txn_begin(env, 0, &txn, 0); CKERR(r); r = db->cursor(db, txn, &cursor, 0); CKERR(r); uint32_t found = 0; do { r = cursor->c_getf_next(cursor, 0, do_nothing, NULL); if (r==0) found++; } while (r==0); CKERR2(r, DB_NOTFOUND); cursor->c_close(cursor); txn->commit(txn, 0); assert(found==find_num); tear_down(); } static void runtests(void) { int close_first = closemode; if (logsize == -1) { init(); abort_txn(); verify_and_tear_down(close_first); } else { uint32_t n = 1<1) { int resultcode=0; if (strcmp(argv[1], "-v")==0) { verbose++; } else if (strcmp(argv[1],"-q")==0) { verbose--; if (verbose<0) verbose=0; } else if (strcmp(argv[1],"-c") == 0 && argc > 2) { argc--; argv++; closemode = parseint(argv[1]); } else if (strcmp(argv[1],"-l") == 0 && argc > 2) { argc--; argv++; logsize = parseint(argv[1]); } else if (strcmp(argv[1], "-h")==0) { do_usage: fprintf(stderr, "Usage:\n%s [-v|-q] [-h] -c -l \n", argv0); exit(resultcode); } else { resultcode=1; goto do_usage; } argc--; argv++; } assert(closemode==0 || closemode==1); assert(logsize >= -1 && logsize <=20); } int test_main(int argc, char *const argv[]) { parse_my_args(argc, argv); runtests(); return 0; }