1 /* $NetBSD: mtest4.c,v 1.3 2021/08/14 16:14:57 christos Exp $ */
2
3 /* mtest4.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 with fixed-size keys */
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
main(int argc,char * argv[])29 int 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[8];
41 char kval[sizeof(int)];
42
43 memset(sval, 0, sizeof(sval));
44
45 count = 510;
46 values = (int *)malloc(count*sizeof(int));
47
48 for(i = 0;i<count;i++) {
49 values[i] = i*5;
50 }
51
52 E(mdb_env_create(&env));
53 E(mdb_env_set_mapsize(env, 10485760));
54 E(mdb_env_set_maxdbs(env, 4));
55 E(mdb_env_open(env, "./testdb", MDB_FIXEDMAP|MDB_NOSYNC, 0664));
56
57 E(mdb_txn_begin(env, NULL, 0, &txn));
58 E(mdb_dbi_open(txn, "id4", MDB_CREATE|MDB_DUPSORT|MDB_DUPFIXED, &dbi));
59
60 key.mv_size = sizeof(int);
61 key.mv_data = kval;
62 data.mv_size = sizeof(sval);
63 data.mv_data = sval;
64
65 printf("Adding %d values\n", count);
66 strcpy(kval, "001");
67 for (i=0;i<count;i++) {
68 sprintf(sval, "%07x", values[i]);
69 if (RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA)))
70 j++;
71 }
72 if (j) printf("%d duplicates skipped\n", j);
73 E(mdb_txn_commit(txn));
74 E(mdb_env_stat(env, &mst));
75
76 /* there should be one full page of dups now.
77 */
78 E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
79 E(mdb_cursor_open(txn, dbi, &cursor));
80 while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
81 printf("key: %p %.*s, data: %p %.*s\n",
82 key.mv_data, (int) key.mv_size, (char *) key.mv_data,
83 data.mv_data, (int) data.mv_size, (char *) data.mv_data);
84 }
85 CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
86 mdb_cursor_close(cursor);
87 mdb_txn_abort(txn);
88
89 /* test all 3 branches of split code:
90 * 1: new key in lower half
91 * 2: new key at split point
92 * 3: new key in upper half
93 */
94
95 key.mv_size = sizeof(int);
96 key.mv_data = kval;
97 data.mv_size = sizeof(sval);
98 data.mv_data = sval;
99
100 sprintf(sval, "%07x", values[3]+1);
101 E(mdb_txn_begin(env, NULL, 0, &txn));
102 (void)RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA));
103 mdb_txn_abort(txn);
104
105 sprintf(sval, "%07x", values[255]+1);
106 E(mdb_txn_begin(env, NULL, 0, &txn));
107 (void)RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA));
108 mdb_txn_abort(txn);
109
110 sprintf(sval, "%07x", values[500]+1);
111 E(mdb_txn_begin(env, NULL, 0, &txn));
112 (void)RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA));
113 E(mdb_txn_commit(txn));
114
115 /* Try MDB_NEXT_MULTIPLE */
116 E(mdb_txn_begin(env, NULL, 0, &txn));
117 E(mdb_cursor_open(txn, dbi, &cursor));
118 while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT_MULTIPLE)) == 0) {
119 printf("key: %.*s, data: %.*s\n",
120 (int) key.mv_size, (char *) key.mv_data,
121 (int) data.mv_size, (char *) data.mv_data);
122 }
123 CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
124 mdb_cursor_close(cursor);
125 mdb_txn_abort(txn);
126 j=0;
127
128 for (i= count - 1; i > -1; i-= (rand()%3)) {
129 j++;
130 txn=NULL;
131 E(mdb_txn_begin(env, NULL, 0, &txn));
132 sprintf(sval, "%07x", values[i]);
133 key.mv_size = sizeof(int);
134 key.mv_data = kval;
135 data.mv_size = sizeof(sval);
136 data.mv_data = sval;
137 if (RES(MDB_NOTFOUND, mdb_del(txn, dbi, &key, &data))) {
138 j--;
139 mdb_txn_abort(txn);
140 } else {
141 E(mdb_txn_commit(txn));
142 }
143 }
144 free(values);
145 printf("Deleted %d values\n", j);
146
147 E(mdb_env_stat(env, &mst));
148 E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
149 E(mdb_cursor_open(txn, dbi, &cursor));
150 printf("Cursor next\n");
151 while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
152 printf("key: %.*s, data: %.*s\n",
153 (int) key.mv_size, (char *) key.mv_data,
154 (int) data.mv_size, (char *) data.mv_data);
155 }
156 CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
157 printf("Cursor prev\n");
158 while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_PREV)) == 0) {
159 printf("key: %.*s, data: %.*s\n",
160 (int) key.mv_size, (char *) key.mv_data,
161 (int) data.mv_size, (char *) data.mv_data);
162 }
163 CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
164 mdb_cursor_close(cursor);
165 mdb_txn_abort(txn);
166
167 mdb_dbi_close(env, dbi);
168 mdb_env_close(env);
169 return 0;
170 }
171