mtest3.c revision 1.3 
1/*	$NetBSD: mtest3.c,v 1.3 2021/08/14 16:14:57 christos Exp $	*/
2
3/* mtest3.c - memory-mapped database tester/toy */
4/*
5 * Copyright 2011-2021 Howard Chu, Symas Corp.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
10 * Public License.
11 *
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
15 */
16
17/* Tests for sorted duplicate DBs */
18#include <stdio.h>
19#include <stdlib.h>
20#include <string.h>
21#include <time.h>
22#include "lmdb.h"
23
24#define E(expr) CHECK((rc = (expr)) == MDB_SUCCESS, #expr)
25#define RES(err, expr) ((rc = expr) == (err) || (CHECK(!rc, #expr), 0))
26#define CHECK(test, msg) ((test) ? (void)0 : ((void)fprintf(stderr, \
27	"%s:%d: %s: %s\n", __FILE__, __LINE__, msg, mdb_strerror(rc)), abort()))
28
29int main(int argc,char * argv[])
30{
31	int i = 0, j = 0, rc;
32	MDB_env *env;
33	MDB_dbi dbi;
34	MDB_val key, data;
35	MDB_txn *txn;
36	MDB_stat mst;
37	MDB_cursor *cursor;
38	int count;
39	int *values;
40	char sval[32];
41	char kval[sizeof(int)];
42
43	srand(time(NULL));
44
45	memset(sval, 0, sizeof(sval));
46
47	count = (rand()%384) + 64;
48	values = (int *)malloc(count*sizeof(int));
49
50	for(i = 0;i<count;i++) {
51		values[i] = rand()%1024;
52	}
53
54	E(mdb_env_create(&env));
55	E(mdb_env_set_mapsize(env, 10485760));
56	E(mdb_env_set_maxdbs(env, 4));
57	E(mdb_env_open(env, "./testdb", MDB_FIXEDMAP|MDB_NOSYNC, 0664));
58
59	E(mdb_txn_begin(env, NULL, 0, &txn));
60	E(mdb_dbi_open(txn, "id2", MDB_CREATE|MDB_DUPSORT, &dbi));
61
62	key.mv_size = sizeof(int);
63	key.mv_data = kval;
64	data.mv_size = sizeof(sval);
65	data.mv_data = sval;
66
67	printf("Adding %d values\n", count);
68	for (i=0;i<count;i++) {
69		if (!(i & 0x0f))
70			sprintf(kval, "%03x", values[i]);
71		sprintf(sval, "%03x %d foo bar", values[i], values[i]);
72		if (RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA)))
73			j++;
74	}
75	if (j) printf("%d duplicates skipped\n", j);
76	E(mdb_txn_commit(txn));
77	E(mdb_env_stat(env, &mst));
78
79	E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
80	E(mdb_cursor_open(txn, dbi, &cursor));
81	while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
82		printf("key: %p %.*s, data: %p %.*s\n",
83			key.mv_data,  (int) key.mv_size,  (char *) key.mv_data,
84			data.mv_data, (int) data.mv_size, (char *) data.mv_data);
85	}
86	CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
87	mdb_cursor_close(cursor);
88	mdb_txn_abort(txn);
89
90	j=0;
91
92	for (i= count - 1; i > -1; i-= (rand()%5)) {
93		j++;
94		txn=NULL;
95		E(mdb_txn_begin(env, NULL, 0, &txn));
96		sprintf(kval, "%03x", values[i & ~0x0f]);
97		sprintf(sval, "%03x %d foo bar", values[i], values[i]);
98		key.mv_size = sizeof(int);
99		key.mv_data = kval;
100		data.mv_size = sizeof(sval);
101		data.mv_data = sval;
102		if (RES(MDB_NOTFOUND, mdb_del(txn, dbi, &key, &data))) {
103			j--;
104			mdb_txn_abort(txn);
105		} else {
106			E(mdb_txn_commit(txn));
107		}
108	}
109	free(values);
110	printf("Deleted %d values\n", j);
111
112	E(mdb_env_stat(env, &mst));
113	E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
114	E(mdb_cursor_open(txn, dbi, &cursor));
115	printf("Cursor next\n");
116	while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
117		printf("key: %.*s, data: %.*s\n",
118			(int) key.mv_size,  (char *) key.mv_data,
119			(int) data.mv_size, (char *) data.mv_data);
120	}
121	CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
122	printf("Cursor prev\n");
123	while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_PREV)) == 0) {
124		printf("key: %.*s, data: %.*s\n",
125			(int) key.mv_size,  (char *) key.mv_data,
126			(int) data.mv_size, (char *) data.mv_data);
127	}
128	CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
129	mdb_cursor_close(cursor);
130	mdb_txn_abort(txn);
131
132	mdb_dbi_close(env, dbi);
133	mdb_env_close(env);
134	return 0;
135}
136