void case_setup()
{
int ret;
g_message("--enter fun %s", __func__);
fixture.cache_ctrl = dbcache_new();
g_assert(fixture.cache_ctrl != NULL);
ret = dbcache_init(fixture.cache_ctrl, BLOCK_SIZE, 1024, 1000, 80, 100);
g_assert(ret == 0);
}
CTEST(cursor, empty)
{
int ret;
struct options *opts;
struct status *status;
struct cache *cache;
struct tree *tree;
/* create */
opts = options_new();
status = status_new();
cache = dbcache_new(opts);
tree = tree_new(DBPATH0, opts, status, cache, 1);
/* cursor */
struct cursor *cur;
cur = cursor_new(tree);
/* first */
tree_cursor_first(cur);
ret = tree_cursor_valid(cur);
ASSERT_EQUAL(0, ret);
/* last */
tree_cursor_last(cur);
ret = tree_cursor_valid(cur);
ASSERT_EQUAL(0, ret);
/* next */
tree_cursor_next(cur);
ret = tree_cursor_valid(cur);
ASSERT_EQUAL(0, ret);
cursor_free(cur);
/* free */
dbcache_free(cache);
tree_free(tree);
options_free(opts);
status_free(status);
xcheck_all_free();
}
CTEST(cursor, 1leaf)
{
int i;
int ret;
int R = 1000;
char kbuf[KEY_SIZE];
char vbuf[VAL_SIZE];
struct options *opts;
struct status *status;
struct cache *cache;
struct tree *tree;
/* create */
opts = options_new();
status = status_new();
cache = dbcache_new(opts);
tree = tree_new(DBPATH1, opts, status, cache, 1);
/* insert to tree */
for (i = 0; i < R; i++) {
memset(kbuf, 0 , KEY_SIZE);
memset(vbuf, 0 , VAL_SIZE);
snprintf(kbuf, KEY_SIZE, "key-%d", i);
snprintf(vbuf, VAL_SIZE, "val-%d", i);
struct msg k = {.data = kbuf, .size = KEY_SIZE};
struct msg v = {.data = vbuf, .size = VAL_SIZE};
tree_put(tree, &k, &v, MSG_PUT, DUMMY_TXID);
}
