mirror of
https://github.com/MariaDB/server.git
synced 2025-01-22 14:54:20 +01:00
293 lines
7.9 KiB
C
293 lines
7.9 KiB
C
/* -*- mode: C; c-basic-offset: 4 -*- */
|
|
#ident "$Id$"
|
|
#ident "Copyright (c) 2010 Tokutek Inc. All rights reserved."
|
|
|
|
// test the LE_CURSOR is_key_right_of_le_cursor function
|
|
// - LE_CURSOR at neg infinity
|
|
// - LE_CURSOR at pos infinity
|
|
// - LE_CURSOR somewhere else
|
|
|
|
#include "includes.h"
|
|
#include "checkpoint.h"
|
|
#include "le-cursor.h"
|
|
#include "test.h"
|
|
|
|
static TOKUTXN const null_txn = 0;
|
|
static DB * const null_db = 0;
|
|
|
|
static int
|
|
test_keycompare(DB *UU(db), const DBT *a, const DBT *b) {
|
|
return toku_keycompare(a->data, a->size, b->data, b->size);
|
|
}
|
|
|
|
static void
|
|
txn_yield(voidfp UU(f), void *UU(fv), void *UU(v)) {
|
|
if (f)
|
|
f(fv);
|
|
}
|
|
|
|
// create a tree and populate it with n rows
|
|
static void
|
|
create_populate_tree(const char *logdir, const char *fname, int n) {
|
|
if (verbose) fprintf(stderr, "%s %s %s %d\n", __FUNCTION__, logdir, fname, n);
|
|
int error;
|
|
|
|
TOKULOGGER logger = NULL;
|
|
error = toku_logger_create(&logger);
|
|
assert(error == 0);
|
|
error = toku_logger_open(logdir, logger);
|
|
assert(error == 0);
|
|
CACHETABLE ct = NULL;
|
|
error = toku_brt_create_cachetable(&ct, 0, ZERO_LSN, logger);
|
|
assert(error == 0);
|
|
toku_logger_set_cachetable(logger, ct);
|
|
error = toku_logger_open_rollback(logger, ct, TRUE);
|
|
assert(error == 0);
|
|
|
|
TOKUTXN txn = NULL;
|
|
error = toku_txn_begin_txn(NULL, NULL, &txn, logger, TXN_SNAPSHOT_NONE);
|
|
assert(error == 0);
|
|
|
|
BRT brt = NULL;
|
|
error = toku_open_brt(fname, 1, &brt, 1<<12, 1<<9, ct, txn, test_keycompare, null_db);
|
|
assert(error == 0);
|
|
|
|
error = toku_txn_commit_txn(txn, TRUE, txn_yield, NULL, NULL, NULL);
|
|
assert(error == 0);
|
|
toku_txn_close_txn(txn);
|
|
|
|
txn = NULL;
|
|
error = toku_txn_begin_txn(NULL, NULL, &txn, logger, TXN_SNAPSHOT_NONE);
|
|
assert(error == 0);
|
|
|
|
// insert keys 0, 1, 2, .. (n-1)
|
|
for (int i = 0; i < n; i++) {
|
|
int k = toku_htonl(i);
|
|
int v = i;
|
|
DBT key;
|
|
toku_fill_dbt(&key, &k, sizeof k);
|
|
DBT val;
|
|
toku_fill_dbt(&val, &v, sizeof v);
|
|
error = toku_brt_insert(brt, &key, &val, txn);
|
|
assert(error == 0);
|
|
}
|
|
|
|
error = toku_txn_commit_txn(txn, TRUE, txn_yield, NULL, NULL, NULL);
|
|
assert(error == 0);
|
|
toku_txn_close_txn(txn);
|
|
|
|
error = toku_close_brt(brt, NULL);
|
|
assert(error == 0);
|
|
|
|
error = toku_checkpoint(ct, logger, NULL, NULL, NULL, NULL);
|
|
assert(error == 0);
|
|
error = toku_logger_close_rollback(logger, FALSE);
|
|
assert(error == 0);
|
|
error = toku_logger_close(&logger);
|
|
assert(error == 0);
|
|
|
|
error = toku_cachetable_close(&ct);
|
|
assert(error == 0);
|
|
}
|
|
|
|
// test is_key_right_of_le_cursor when the LE_CURSOR is positioned at -infinity
|
|
static void
|
|
test_neg_infinity(const char *fname, int n) {
|
|
if (verbose) fprintf(stderr, "%s %s %d\n", __FUNCTION__, fname, n);
|
|
int error;
|
|
|
|
CACHETABLE ct = NULL;
|
|
error = toku_brt_create_cachetable(&ct, 0, ZERO_LSN, NULL_LOGGER);
|
|
assert(error == 0);
|
|
|
|
BRT brt = NULL;
|
|
error = toku_open_brt(fname, 1, &brt, 1<<12, 1<<9, ct, null_txn, test_keycompare, null_db);
|
|
assert(error == 0);
|
|
|
|
// position the cursor at -infinity
|
|
LE_CURSOR cursor = NULL;
|
|
error = le_cursor_create(&cursor, brt, NULL);
|
|
assert(error == 0);
|
|
|
|
for (int i = 0; i < 2*n; i++) {
|
|
int k = toku_htonl(i);
|
|
DBT key;
|
|
toku_fill_dbt(&key, &k, sizeof k);
|
|
int right = is_key_right_of_le_cursor(cursor, &key, null_db);
|
|
assert(right == TRUE);
|
|
}
|
|
|
|
error = le_cursor_close(cursor);
|
|
assert(error == 0);
|
|
|
|
error = toku_close_brt(brt, 0);
|
|
assert(error == 0);
|
|
|
|
error = toku_cachetable_close(&ct);
|
|
assert(error == 0);
|
|
}
|
|
|
|
// test is_key_right_of_le_cursor when the LE_CURSOR is positioned at +infinity
|
|
static void
|
|
test_pos_infinity(const char *fname, int n) {
|
|
if (verbose) fprintf(stderr, "%s %s %d\n", __FUNCTION__, fname, n);
|
|
int error;
|
|
|
|
CACHETABLE ct = NULL;
|
|
error = toku_brt_create_cachetable(&ct, 0, ZERO_LSN, NULL_LOGGER);
|
|
assert(error == 0);
|
|
|
|
BRT brt = NULL;
|
|
error = toku_open_brt(fname, 1, &brt, 1<<12, 1<<9, ct, null_txn, test_keycompare, null_db);
|
|
assert(error == 0);
|
|
|
|
// position the LE_CURSOR at +infinity
|
|
LE_CURSOR cursor = NULL;
|
|
error = le_cursor_create(&cursor, brt, NULL);
|
|
assert(error == 0);
|
|
|
|
DBT key;
|
|
toku_init_dbt(&key); key.flags = DB_DBT_REALLOC;
|
|
DBT val;
|
|
toku_init_dbt(&val); val.flags = DB_DBT_REALLOC;
|
|
|
|
int i;
|
|
for (i = 0; ; i++) {
|
|
error = le_cursor_next(cursor, &val);
|
|
if (error != 0)
|
|
break;
|
|
|
|
LEAFENTRY le = (LEAFENTRY) val.data;
|
|
assert(le->type == LE_MVCC);
|
|
assert(le->keylen == sizeof (int));
|
|
int ii;
|
|
memcpy(&ii, le->u.mvcc.key_xrs, le->keylen);
|
|
assert((int) toku_htonl(i) == ii);
|
|
|
|
}
|
|
assert(i == n);
|
|
|
|
toku_destroy_dbt(&key);
|
|
toku_destroy_dbt(&val);
|
|
|
|
for (i = 0; i < 2*n; i++) {
|
|
int k = toku_htonl(i);
|
|
DBT key2;
|
|
toku_fill_dbt(&key2, &k, sizeof k);
|
|
int right = is_key_right_of_le_cursor(cursor, &key2, null_db);
|
|
assert(right == FALSE);
|
|
}
|
|
|
|
error = le_cursor_close(cursor);
|
|
assert(error == 0);
|
|
|
|
error = toku_close_brt(brt, 0);
|
|
assert(error == 0);
|
|
|
|
error = toku_cachetable_close(&ct);
|
|
assert(error == 0);
|
|
}
|
|
|
|
// test is_key_right_of_le_cursor when the LE_CURSOR is positioned in between -infinity and +infinity
|
|
static void
|
|
test_between(const char *fname, int n) {
|
|
if (verbose) fprintf(stderr, "%s %s %d\n", __FUNCTION__, fname, n);
|
|
int error;
|
|
|
|
CACHETABLE ct = NULL;
|
|
error = toku_brt_create_cachetable(&ct, 0, ZERO_LSN, NULL_LOGGER);
|
|
assert(error == 0);
|
|
|
|
BRT brt = NULL;
|
|
error = toku_open_brt(fname, 1, &brt, 1<<12, 1<<9, ct, null_txn, test_keycompare, null_db);
|
|
assert(error == 0);
|
|
|
|
// position the LE_CURSOR at +infinity
|
|
LE_CURSOR cursor = NULL;
|
|
error = le_cursor_create(&cursor, brt, NULL);
|
|
assert(error == 0);
|
|
|
|
DBT key;
|
|
toku_init_dbt(&key); key.flags = DB_DBT_REALLOC;
|
|
DBT val;
|
|
toku_init_dbt(&val); val.flags = DB_DBT_REALLOC;
|
|
|
|
int i;
|
|
for (i = 0; ; i++) {
|
|
// move the LE_CURSOR forward
|
|
error = le_cursor_next(cursor, &val);
|
|
if (error != 0)
|
|
break;
|
|
|
|
LEAFENTRY le = (LEAFENTRY) val.data;
|
|
assert(le->type == LE_MVCC);
|
|
assert(le->keylen == sizeof (int));
|
|
int ii;
|
|
memcpy(&ii, le->u.mvcc.key_xrs, le->keylen);
|
|
assert((int) toku_htonl(i) == ii);
|
|
|
|
// test that 0 .. i is not right of the cursor
|
|
for (int j = 0; j <= i; j++) {
|
|
int k = toku_htonl(j);
|
|
DBT key2;
|
|
toku_fill_dbt(&key2, &k, sizeof k);
|
|
int right = is_key_right_of_le_cursor(cursor, &key2, null_db);
|
|
assert(right == FALSE);
|
|
}
|
|
|
|
// test that i+1 .. n is left of the cursor
|
|
for (int j = i + 1; j <= n; j++) {
|
|
int k = toku_htonl(j);
|
|
DBT key2;
|
|
toku_fill_dbt(&key2, &k, sizeof k);
|
|
int right = is_key_right_of_le_cursor(cursor, &key2, null_db);
|
|
assert(right == TRUE);
|
|
}
|
|
|
|
}
|
|
assert(i == n);
|
|
|
|
toku_destroy_dbt(&key);
|
|
toku_destroy_dbt(&val);
|
|
|
|
error = le_cursor_close(cursor);
|
|
assert(error == 0);
|
|
|
|
error = toku_close_brt(brt, 0);
|
|
assert(error == 0);
|
|
|
|
error = toku_cachetable_close(&ct);
|
|
assert(error == 0);
|
|
}
|
|
|
|
static void
|
|
init_logdir(const char *logdir) {
|
|
int error;
|
|
|
|
char cmd[32+strlen(logdir)];
|
|
sprintf(cmd, "rm -rf %s", logdir);
|
|
error = system(cmd);
|
|
assert(error == 0);
|
|
|
|
error = toku_os_mkdir(logdir, 0777);
|
|
assert(error == 0);
|
|
}
|
|
|
|
int
|
|
test_main (int argc , const char *argv[]) {
|
|
default_parse_args(argc, argv);
|
|
|
|
const char *logdir = "dir." __FILE__;
|
|
init_logdir(logdir);
|
|
int error = chdir(logdir);
|
|
assert(error == 0);
|
|
|
|
const int n = 10;
|
|
const char *brtfile = __FILE__ ".brt";
|
|
create_populate_tree(".", brtfile, n);
|
|
test_neg_infinity(brtfile, n);
|
|
test_pos_infinity(brtfile, n);
|
|
test_between(brtfile, n);
|
|
|
|
return 0;
|
|
}
|