Howard Chu
13 years ago
parent
ce9456d95c
commit
920115f747
@ -0,0 +1,127 @@ |
||||
/* mtest3.c - memory-mapped database tester/toy */ |
||||
/*
|
||||
* Copyright 2011 Howard Chu, Symas Corp. |
||||
* 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>.
|
||||
*/ |
||||
|
||||
/* Tests for sorted duplicate DBs */ |
||||
#define _XOPEN_SOURCE 500 /* srandom(), random() */ |
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
#include <string.h> |
||||
#include <time.h> |
||||
#include "mdb.h" |
||||
|
||||
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; |
||||
MDB_cursor *cursor; |
||||
int count; |
||||
int *values; |
||||
char sval[32]; |
||||
char kval[sizeof(int)]; |
||||
|
||||
srandom(time(NULL)); |
||||
|
||||
memset(sval, 0, sizeof(sval)); |
||||
|
||||
count = (random()%384) + 64; |
||||
values = (int *)malloc(count*sizeof(int)); |
||||
|
||||
for(i = 0;i<count;i++) { |
||||
values[i] = random()%1024; |
||||
} |
||||
|
||||
rc = mdbenv_create(&env); |
||||
rc = mdbenv_set_mapsize(env, 10485760); |
||||
rc = mdbenv_set_maxdbs(env, 4); |
||||
rc = mdbenv_open(env, "./testdb", MDB_FIXEDMAP|MDB_NOSYNC, 0664); |
||||
rc = mdb_txn_begin(env, 0, &txn); |
||||
rc = mdb_open(txn, "id2", MDB_CREATE|MDB_DUPSORT, &dbi); |
||||
|
||||
key.mv_size = sizeof(int); |
||||
key.mv_data = kval; |
||||
data.mv_size = sizeof(sval); |
||||
data.mv_data = sval; |
||||
|
||||
printf("Adding %d values\n", count); |
||||
for (i=0;i<count;i++) { |
||||
if (!(i & 0x0f)) |
||||
sprintf(kval, "%03x", values[i]); |
||||
sprintf(sval, "%03x %d foo bar", values[i], values[i]); |
||||
rc = mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA); |
||||
if (rc) j++; |
||||
} |
||||
if (j) printf("%d duplicates skipped\n", j); |
||||
rc = mdb_txn_commit(txn); |
||||
rc = mdbenv_stat(env, &mst); |
||||
|
||||
rc = mdb_txn_begin(env, 1, &txn); |
||||
rc = mdb_cursor_open(txn, dbi, &cursor); |
||||
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); |
||||
} |
||||
mdb_cursor_close(cursor); |
||||
mdb_txn_abort(txn); |
||||
|
||||
j=0; |
||||
|
||||
for (i= count - 1; i > -1; i-= (random()%5)) { |
||||
j++; |
||||
txn=NULL; |
||||
rc = mdb_txn_begin(env, 0, &txn); |
||||
sprintf(kval, "%03x", values[i & ~0x0f]); |
||||
sprintf(sval, "%03x %d foo bar", values[i], values[i]); |
||||
key.mv_size = sizeof(int); |
||||
key.mv_data = kval; |
||||
data.mv_size = sizeof(sval); |
||||
data.mv_data = sval; |
||||
rc = mdb_del(txn, dbi, &key, &data, MDB_DEL_DUP); |
||||
if (rc) { |
||||
j--; |
||||
mdb_txn_abort(txn); |
||||
} else { |
||||
rc = mdb_txn_commit(txn); |
||||
} |
||||
} |
||||
free(values); |
||||
printf("Deleted %d values\n", j); |
||||
|
||||
rc = mdbenv_stat(env, &mst); |
||||
rc = mdb_txn_begin(env, 1, &txn); |
||||
rc = mdb_cursor_open(txn, dbi, &cursor); |
||||
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); |
||||
} |
||||
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); |
||||
} |
||||
mdb_cursor_close(cursor); |
||||
mdb_close(txn, dbi); |
||||
|
||||
mdb_txn_abort(txn); |
||||
mdbenv_close(env); |
||||
|
||||
return 0; |
||||
} |
||||
Loading…
Reference in new issue