openldap/libraries/liblmdb/mtest2.c

124 lines
3.3 KiB
C
Raw Normal View History

2011-08-12 04:43:01 +08:00
/* mtest2.c - memory-mapped database tester/toy */
2011-08-11 15:33:27 +08:00
/*
2015-02-13 01:17:59 +08:00
* Copyright 2011-2015 Howard Chu, Symas Corp.
2011-08-11 15:33:27 +08:00
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted only as authorized by the OpenLDAP
* Public License.
*
* A copy of this license is available in the file LICENSE in the
* top-level directory of the distribution or, alternatively, at
* <http://www.OpenLDAP.org/license.html>.
*/
2011-08-12 04:43:01 +08:00
/* Just like mtest.c, but using a subDB instead of the main DB */
2011-08-11 15:33:27 +08:00
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "lmdb.h"
2011-08-11 15:33:27 +08:00
#define E(expr) CHECK((rc = (expr)) == MDB_SUCCESS, #expr)
#define RES(err, expr) ((rc = expr) == (err) || (CHECK(!rc, #expr), 0))
#define CHECK(test, msg) ((test) ? (void)0 : ((void)fprintf(stderr, \
"%s:%d: %s: %s\n", __FILE__, __LINE__, msg, mdb_strerror(rc)), abort()))
2011-08-11 15:33:27 +08:00
int main(int argc,char * argv[])
{
int i = 0, j = 0, rc;
MDB_env *env;
MDB_dbi dbi;
MDB_val key, data;
MDB_txn *txn;
MDB_stat mst;
2011-08-11 19:46:14 +08:00
MDB_cursor *cursor;
2011-08-11 15:33:27 +08:00
int count;
int *values;
char sval[32] = "";
2011-08-11 15:33:27 +08:00
srand(time(NULL));
2011-08-11 15:33:27 +08:00
count = (rand()%384) + 64;
2011-08-11 15:33:27 +08:00
values = (int *)malloc(count*sizeof(int));
for(i = 0;i<count;i++) {
values[i] = rand()%1024;
2011-08-11 15:33:27 +08:00
}
E(mdb_env_create(&env));
E(mdb_env_set_mapsize(env, 10485760));
E(mdb_env_set_maxdbs(env, 4));
E(mdb_env_open(env, "./testdb", MDB_FIXEDMAP|MDB_NOSYNC, 0664));
E(mdb_txn_begin(env, NULL, 0, &txn));
E(mdb_open(txn, "id1", MDB_CREATE, &dbi));
2011-08-11 15:33:27 +08:00
key.mv_size = sizeof(int);
key.mv_data = sval;
data.mv_size = sizeof(sval);
data.mv_data = sval;
printf("Adding %d values\n", count);
for (i=0;i<count;i++) {
sprintf(sval, "%03x %d foo bar", values[i], values[i]);
if (RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NOOVERWRITE)))
j++;
2011-08-11 15:33:27 +08:00
}
if (j) printf("%d duplicates skipped\n", j);
E(mdb_txn_commit(txn));
E(mdb_env_stat(env, &mst));
2011-08-11 15:33:27 +08:00
E(mdb_txn_begin(env, NULL, 1, &txn));
E(mdb_cursor_open(txn, dbi, &cursor));
2011-08-11 15:33:27 +08:00
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
printf("key: %p %.*s, data: %p %.*s\n",
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
}
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
2011-08-11 15:33:27 +08:00
mdb_cursor_close(cursor);
mdb_txn_abort(txn);
j=0;
key.mv_data = sval;
for (i= count - 1; i > -1; i-= (rand()%5)) {
2011-08-11 15:33:27 +08:00
j++;
txn=NULL;
E(mdb_txn_begin(env, NULL, 0, &txn));
2011-08-11 15:33:27 +08:00
sprintf(sval, "%03x ", values[i]);
if (RES(MDB_NOTFOUND, mdb_del(txn, dbi, &key, NULL))) {
2011-08-11 15:33:27 +08:00
j--;
mdb_txn_abort(txn);
} else {
E(mdb_txn_commit(txn));
2011-08-11 15:33:27 +08:00
}
}
free(values);
printf("Deleted %d values\n", j);
E(mdb_env_stat(env, &mst));
E(mdb_txn_begin(env, NULL, 1, &txn));
E(mdb_cursor_open(txn, dbi, &cursor));
2011-08-11 15:33:27 +08:00
printf("Cursor next\n");
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
printf("key: %.*s, data: %.*s\n",
(int) key.mv_size, (char *) key.mv_data,
(int) data.mv_size, (char *) data.mv_data);
}
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
2011-08-11 15:33:27 +08:00
printf("Cursor prev\n");
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_PREV)) == 0) {
printf("key: %.*s, data: %.*s\n",
(int) key.mv_size, (char *) key.mv_data,
(int) data.mv_size, (char *) data.mv_data);
}
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
2011-08-11 15:33:27 +08:00
mdb_cursor_close(cursor);
mdb_close(env, dbi);
2011-08-11 15:33:27 +08:00
mdb_txn_abort(txn);
2011-08-12 12:14:29 +08:00
mdb_env_close(env);
2011-08-11 15:33:27 +08:00
return 0;
}