Commit 68eaf4d3 authored by Rich Prohaska's avatar Rich Prohaska

DB-548 generate dirty upgrade test cases with old rollback nodes

parent 014dfc3e
...@@ -2593,13 +2593,13 @@ deserialize_rollback_log_from_rbuf (BLOCKNUM blocknum, ROLLBACK_LOG_NODE *log_p, ...@@ -2593,13 +2593,13 @@ deserialize_rollback_log_from_rbuf (BLOCKNUM blocknum, ROLLBACK_LOG_NODE *log_p,
return r; return r;
} }
//printf("Deserializing %lld datasize=%d\n", off, datasize);
const void *magic; const void *magic;
rbuf_literal_bytes(rb, &magic, 8); rbuf_literal_bytes(rb, &magic, 8);
lazy_assert(!memcmp(magic, "tokuroll", 8)); lazy_assert(!memcmp(magic, "tokuroll", 8));
result->layout_version = rbuf_int(rb); result->layout_version = rbuf_int(rb);
lazy_assert(result->layout_version == FT_LAYOUT_VERSION); lazy_assert((FT_LAYOUT_VERSION_25 <= result->layout_version && result->layout_version <= FT_LAYOUT_VERSION_27) ||
(result->layout_version == FT_LAYOUT_VERSION));
result->layout_version_original = rbuf_int(rb); result->layout_version_original = rbuf_int(rb);
result->layout_version_read_from_disk = result->layout_version; result->layout_version_read_from_disk = result->layout_version;
result->build_id = rbuf_int(rb); result->build_id = rbuf_int(rb);
...@@ -2659,7 +2659,7 @@ deserialize_rollback_log_from_rbuf_versioned (uint32_t version, BLOCKNUM blocknu ...@@ -2659,7 +2659,7 @@ deserialize_rollback_log_from_rbuf_versioned (uint32_t version, BLOCKNUM blocknu
struct rbuf *rb) { struct rbuf *rb) {
int r = 0; int r = 0;
ROLLBACK_LOG_NODE rollback_log_node = NULL; ROLLBACK_LOG_NODE rollback_log_node = NULL;
invariant(version==FT_LAYOUT_VERSION); //Rollback log nodes do not survive version changes. invariant((FT_LAYOUT_VERSION_25 <= version && version <= FT_LAYOUT_VERSION_27) || version == FT_LAYOUT_VERSION);
r = deserialize_rollback_log_from_rbuf(blocknum, &rollback_log_node, rb); r = deserialize_rollback_log_from_rbuf(blocknum, &rollback_log_node, rb);
if (r==0) { if (r==0) {
*log = rollback_log_node; *log = rollback_log_node;
...@@ -2756,17 +2756,14 @@ decompress_from_raw_block_into_rbuf(uint8_t *raw_block, size_t raw_block_size, s ...@@ -2756,17 +2756,14 @@ decompress_from_raw_block_into_rbuf(uint8_t *raw_block, size_t raw_block_size, s
return r; return r;
} }
static int static int decompress_from_raw_block_into_rbuf_versioned(uint32_t version, uint8_t *raw_block, size_t raw_block_size, struct rbuf *rb, BLOCKNUM blocknum) {
decompress_from_raw_block_into_rbuf_versioned(uint32_t version, uint8_t *raw_block, size_t raw_block_size, struct rbuf *rb, BLOCKNUM blocknum) {
// This function exists solely to accomodate future changes in compression. // This function exists solely to accomodate future changes in compression.
int r = 0; int r = 0;
switch (version) { if ((version == FT_LAYOUT_VERSION_13 || version == FT_LAYOUT_VERSION_14) ||
case FT_LAYOUT_VERSION_13: (FT_LAYOUT_VERSION_25 <= version && version <= FT_LAYOUT_VERSION_27) ||
case FT_LAYOUT_VERSION_14: version == FT_LAYOUT_VERSION) {
case FT_LAYOUT_VERSION:
r = decompress_from_raw_block_into_rbuf(raw_block, raw_block_size, rb, blocknum); r = decompress_from_raw_block_into_rbuf(raw_block, raw_block_size, rb, blocknum);
break; } else {
default:
abort(); abort();
} }
return r; return r;
......
...@@ -123,7 +123,7 @@ static void run_recovery(const char *testdir) { ...@@ -123,7 +123,7 @@ static void run_recovery(const char *testdir) {
r = tokuft_needs_recovery(testdir, false); r = tokuft_needs_recovery(testdir, false);
if (strcmp(shutdown, "clean") == 0) { if (strcmp(shutdown, "clean") == 0) {
CKERR(r); // clean does not need recovery CKERR(r); // clean does not need recovery
} else if (strcmp(shutdown, "dirty") == 0) { } else if (strncmp(shutdown, "dirty", 5) == 0) {
CKERR2(r, 1); // dirty needs recovery CKERR2(r, 1); // dirty needs recovery
} else { } else {
CKERR(EINVAL); CKERR(EINVAL);
......
/* -*- 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.
This software is covered by US Patent No. 8,489,638.
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."
#ident "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."
// Test dirty upgrade.
// Generate a rollback log that requires recovery.
#include "test.h"
// Insert max_rows key/val pairs into the db
static void do_inserts(DB_TXN *txn, DB *db, uint64_t max_rows, size_t val_size) {
char val_data[val_size]; memset(val_data, 0, val_size);
int r;
for (uint64_t i = 0; i < max_rows; i++) {
// pick a sequential key but it does not matter for this test.
uint64_t k[2] = {
htonl(i), random64(),
};
DBT key = { .data = k, .size = sizeof k };
DBT val = { .data = val_data, .size = (uint32_t) val_size };
r = db->put(db, txn, &key, &val, 0);
CKERR(r);
}
}
static void run_test(uint64_t num_rows, size_t val_size, bool do_crash) {
int r;
DB_ENV *env = nullptr;
r = db_env_create(&env, 0);
CKERR(r);
r = env->set_cachesize(env, 8, 0, 1);
CKERR(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);
CKERR(r);
DB *db = nullptr;
r = db_create(&db, env, 0);
CKERR(r);
r = db->open(db, nullptr, "foo.db", 0, DB_BTREE, DB_CREATE, S_IRWXU+S_IRWXG+S_IRWXO);
CKERR(r);
r = env->txn_checkpoint(env, 0, 0, 0);
CKERR(r);
DB_TXN *txn = nullptr;
r = env->txn_begin(env, nullptr, &txn, 0);
CKERR(r);
do_inserts(txn, db, num_rows, val_size);
r = env->txn_checkpoint(env, 0, 0, 0);
CKERR(r);
r = txn->commit(txn, 0);
CKERR(r);
if (do_crash)
assert(0); // crash on purpose
r = db->close(db, 0);
CKERR(r);
r = env->close(env, 0);
CKERR(r);
}
static void do_verify(DB_ENV *env, DB *db, uint64_t num_rows, size_t val_size UU()) {
int r;
DB_TXN *txn = nullptr;
r = env->txn_begin(env, nullptr, &txn, 0);
CKERR(r);
DBC *c = nullptr;
r = db->cursor(db, txn, &c, 0);
CKERR(r);
uint64_t i = 0;
while (1) {
DBT key = {};
DBT val = {};
r = c->c_get(c, &key, &val, DB_NEXT);
if (r == DB_NOTFOUND)
break;
CKERR(r);
assert(key.size == 16);
uint64_t k[2];
memcpy(k, key.data, key.size);
assert(htonl(k[0]) == i);
assert(val.size == val_size);
i++;
}
assert(i == num_rows);
r = c->c_close(c);
CKERR(r);
r = txn->commit(txn, 0);
CKERR(r);
}
static void run_recover(uint64_t num_rows, size_t val_size) {
int r;
DB_ENV *env = nullptr;
r = db_env_create(&env, 0);
CKERR(r);
r = env->set_cachesize(env, 8, 0, 1);
CKERR(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 | DB_RECOVER,
S_IRWXU+S_IRWXG+S_IRWXO);
CKERR(r);
DB *db = nullptr;
r = db_create(&db, env, 0);
CKERR(r);
r = db->open(db, nullptr, "foo.db", 0, DB_BTREE, 0, S_IRWXU+S_IRWXG+S_IRWXO);
CKERR(r);
do_verify(env, db, num_rows, val_size);
r = db->close(db, 0);
CKERR(r);
r = env->close(env, 0);
CKERR(r);
}
int test_main (int argc, char *const argv[]) {
bool do_test = false;
bool do_recover = false;
bool do_crash = true;
uint64_t num_rows = 1;
size_t val_size = 1;
for (int i = 1; i < argc; i++) {
if (strcmp(argv[i], "-v") == 0) {
verbose++;
continue;
}
if (strcmp(argv[i], "-q") == 0) {
if (verbose > 0) verbose--;
continue;
}
if (strcmp(argv[i], "--test") == 0) {
do_test = true;
continue;
}
if (strcmp(argv[i], "--recover") == 0) {
do_recover = true;
continue;
}
if (strcmp(argv[i], "--crash") == 0 && i+1 < argc) {
do_crash = atoi(argv[++i]);
continue;
}
}
if (do_test) {
// init the env directory
toku_os_recursive_delete(TOKU_TEST_FILENAME);
int r = toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO);
CKERR(r);
run_test(num_rows, val_size, do_crash);
}
if (do_recover) {
run_recover(num_rows, val_size);
}
return 0;
}
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