@ohos-ports/lmdb 2.5.3-beta.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/README.md +536 -0
- package/SECURITY.md +12 -0
- package/binding.gyp +111 -0
- package/build/Release/lmdb.node +0 -0
- package/caching.js +156 -0
- package/dependencies/lmdb/libraries/liblmdb/COPYRIGHT +20 -0
- package/dependencies/lmdb/libraries/liblmdb/Doxyfile +1631 -0
- package/dependencies/lmdb/libraries/liblmdb/LICENSE +47 -0
- package/dependencies/lmdb/libraries/liblmdb/Makefile +136 -0
- package/dependencies/lmdb/libraries/liblmdb/chacha8.c +183 -0
- package/dependencies/lmdb/libraries/liblmdb/chacha8.h +14 -0
- package/dependencies/lmdb/libraries/liblmdb/crypto.c +121 -0
- package/dependencies/lmdb/libraries/liblmdb/intro.doc +192 -0
- package/dependencies/lmdb/libraries/liblmdb/lmdb.h +1792 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb.c +12429 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_copy.1 +74 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_copy.c +106 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_drop.1 +53 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_drop.c +154 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_dump.1 +94 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_dump.c +333 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_load.1 +97 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_load.c +530 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_stat.1 +83 -0
- package/dependencies/lmdb/libraries/liblmdb/mdb_stat.c +276 -0
- package/dependencies/lmdb/libraries/liblmdb/midl.c +452 -0
- package/dependencies/lmdb/libraries/liblmdb/midl.h +208 -0
- package/dependencies/lmdb/libraries/liblmdb/module.c +101 -0
- package/dependencies/lmdb/libraries/liblmdb/module.h +16 -0
- package/dependencies/lmdb/libraries/liblmdb/mtest.c +178 -0
- package/dependencies/lmdb/libraries/liblmdb/mtest2.c +124 -0
- package/dependencies/lmdb/libraries/liblmdb/mtest3.c +133 -0
- package/dependencies/lmdb/libraries/liblmdb/mtest4.c +168 -0
- package/dependencies/lmdb/libraries/liblmdb/mtest5.c +135 -0
- package/dependencies/lmdb/libraries/liblmdb/mtest6.c +141 -0
- package/dependencies/lmdb/libraries/liblmdb/mtest_enc.c +190 -0
- package/dependencies/lmdb/libraries/liblmdb/mtest_enc2.c +189 -0
- package/dependencies/lmdb/libraries/liblmdb/mtest_remap.c +177 -0
- package/dependencies/lmdb/libraries/liblmdb/sample-bdb.txt +73 -0
- package/dependencies/lmdb/libraries/liblmdb/sample-mdb.txt +62 -0
- package/dependencies/lmdb/libraries/liblmdb/tooltag +27 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/COPYRIGHT +20 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/Doxyfile +1631 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/LICENSE +47 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/Makefile +118 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/intro.doc +192 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/lmdb.h +1653 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb.c +11359 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_copy.1 +61 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_copy.c +84 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_drop.1 +40 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_drop.c +135 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_dump.1 +81 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_dump.c +319 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_load.1 +84 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_load.c +492 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_stat.1 +70 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mdb_stat.c +264 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/midl.c +421 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/midl.h +200 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mtest.c +177 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mtest2.c +124 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mtest3.c +133 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mtest4.c +168 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mtest5.c +135 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/mtest6.c +141 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/sample-bdb.txt +73 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/sample-mdb.txt +62 -0
- package/dependencies/lmdb-data-v1/libraries/liblmdb/tooltag +27 -0
- package/dependencies/lz4/LICENSE +11 -0
- package/dependencies/lz4/lib/LICENSE +24 -0
- package/dependencies/lz4/lib/README.md +137 -0
- package/dependencies/lz4/lib/dll/example/README.md +69 -0
- package/dependencies/lz4/lib/dll/example/fullbench-dll.sln +25 -0
- package/dependencies/lz4/lib/dll/example/fullbench-dll.vcxproj +182 -0
- package/dependencies/lz4/lib/dll/liblz4.def +62 -0
- package/dependencies/lz4/lib/liblz4-dll.rc.in +35 -0
- package/dependencies/lz4/lib/liblz4.pc.in +14 -0
- package/dependencies/lz4/lib/lz4.c +2495 -0
- package/dependencies/lz4/lib/lz4.h +774 -0
- package/dependencies/lz4/lib/lz4frame.c +1899 -0
- package/dependencies/lz4/lib/lz4frame.h +623 -0
- package/dependencies/lz4/lib/lz4frame_static.h +47 -0
- package/dependencies/lz4/lib/lz4hc.c +1615 -0
- package/dependencies/lz4/lib/lz4hc.h +413 -0
- package/dependencies/lz4/lib/xxhash.c +1030 -0
- package/dependencies/lz4/lib/xxhash.h +328 -0
- package/dependencies/v8/v8-fast-api-calls-v16.h +791 -0
- package/dependencies/v8/v8-fast-api-calls.h +888 -0
- package/dict/dict.txt +1 -0
- package/dict/dict2.txt +1 -0
- package/dist/index.cjs +2478 -0
- package/dist/index.cjs.map +1 -0
- package/index.d.ts +385 -0
- package/index.js +37 -0
- package/keys.js +102 -0
- package/level.js +27 -0
- package/native.js +82 -0
- package/node-index.js +28 -0
- package/open.js +414 -0
- package/package.json +70 -0
- package/read.js +590 -0
- package/rollup.config.js +12 -0
- package/src/compression.cpp +222 -0
- package/src/cursor.cpp +344 -0
- package/src/dbi.cpp +344 -0
- package/src/env.cpp +762 -0
- package/src/lmdb-js.cpp +64 -0
- package/src/lmdb-js.h +599 -0
- package/src/misc.cpp +324 -0
- package/src/ordered-binary.cpp +46 -0
- package/src/txn.cpp +257 -0
- package/src/v8-functions.cpp +166 -0
- package/src/windows.c +35 -0
- package/src/writer.cpp +452 -0
- package/util/RangeIterable.js +141 -0
- package/util/set-optional-deps.cjs +10 -0
- package/util/when.js +8 -0
- package/write.js +882 -0
|
@@ -0,0 +1,190 @@
|
|
|
1
|
+
/* mtest_enc.c - memory-mapped database tester/toy with encryption */
|
|
2
|
+
/*
|
|
3
|
+
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
|
4
|
+
* All rights reserved.
|
|
5
|
+
*
|
|
6
|
+
* Redistribution and use in source and binary forms, with or without
|
|
7
|
+
* modification, are permitted only as authorized by the Symas
|
|
8
|
+
* Dual-Use License.
|
|
9
|
+
*
|
|
10
|
+
* A copy of this license is available in the file LICENSE in the
|
|
11
|
+
* source distribution.
|
|
12
|
+
*/
|
|
13
|
+
#include <stdio.h>
|
|
14
|
+
#include <stdlib.h>
|
|
15
|
+
#include <time.h>
|
|
16
|
+
#include "lmdb.h"
|
|
17
|
+
#include "chacha8.h"
|
|
18
|
+
|
|
19
|
+
#define E(expr) CHECK((rc = (expr)) == MDB_SUCCESS, #expr)
|
|
20
|
+
#define RES(err, expr) ((rc = expr) == (err) || (CHECK(!rc, #expr), 0))
|
|
21
|
+
#define CHECK(test, msg) ((test) ? (void)0 : ((void)fprintf(stderr, \
|
|
22
|
+
"%s:%d: %s: %s\n", __FILE__, __LINE__, msg, mdb_strerror(rc)), abort()))
|
|
23
|
+
|
|
24
|
+
static int encfunc(const MDB_val *src, MDB_val *dst, const MDB_val *key, int encdec)
|
|
25
|
+
{
|
|
26
|
+
chacha8(src->mv_data, src->mv_size, key[0].mv_data, key[1].mv_data, dst->mv_data);
|
|
27
|
+
return 0;
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
int main(int argc,char * argv[])
|
|
31
|
+
{
|
|
32
|
+
int i = 0, j = 0, rc;
|
|
33
|
+
MDB_env *env;
|
|
34
|
+
MDB_dbi dbi;
|
|
35
|
+
MDB_val key, data;
|
|
36
|
+
MDB_txn *txn;
|
|
37
|
+
MDB_stat mst;
|
|
38
|
+
MDB_cursor *cursor, *cur2;
|
|
39
|
+
MDB_cursor_op op;
|
|
40
|
+
MDB_val enckey;
|
|
41
|
+
int count;
|
|
42
|
+
int *values;
|
|
43
|
+
char sval[32] = "";
|
|
44
|
+
char ekey[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
|
|
45
|
+
17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32};
|
|
46
|
+
|
|
47
|
+
srand(time(NULL));
|
|
48
|
+
|
|
49
|
+
count = (rand()%384) + 64;
|
|
50
|
+
values = (int *)malloc(count*sizeof(int));
|
|
51
|
+
|
|
52
|
+
for(i = 0;i<count;i++) {
|
|
53
|
+
values[i] = rand()%1024;
|
|
54
|
+
}
|
|
55
|
+
|
|
56
|
+
enckey.mv_data = ekey;
|
|
57
|
+
enckey.mv_size = sizeof(ekey);
|
|
58
|
+
|
|
59
|
+
E(mdb_env_create(&env));
|
|
60
|
+
E(mdb_env_set_maxreaders(env, 1));
|
|
61
|
+
E(mdb_env_set_mapsize(env, 10485760));
|
|
62
|
+
E(mdb_env_set_encrypt(env, encfunc, &enckey, 0));
|
|
63
|
+
E(mdb_env_open(env, "./testdb", 0 /*|MDB_NOSYNC*/, 0664));
|
|
64
|
+
|
|
65
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
66
|
+
E(mdb_dbi_open(txn, NULL, 0, &dbi));
|
|
67
|
+
|
|
68
|
+
key.mv_size = sizeof(int);
|
|
69
|
+
key.mv_data = sval;
|
|
70
|
+
|
|
71
|
+
printf("Adding %d values\n", count);
|
|
72
|
+
for (i=0;i<count;i++) {
|
|
73
|
+
sprintf(sval, "%03x %d foo bar", values[i], values[i]);
|
|
74
|
+
/* Set <data> in each iteration, since MDB_NOOVERWRITE may modify it */
|
|
75
|
+
data.mv_size = sizeof(sval);
|
|
76
|
+
data.mv_data = sval;
|
|
77
|
+
if (RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NOOVERWRITE))) {
|
|
78
|
+
j++;
|
|
79
|
+
data.mv_size = sizeof(sval);
|
|
80
|
+
data.mv_data = sval;
|
|
81
|
+
}
|
|
82
|
+
}
|
|
83
|
+
if (j) printf("%d duplicates skipped\n", j);
|
|
84
|
+
E(mdb_txn_commit(txn));
|
|
85
|
+
E(mdb_env_stat(env, &mst));
|
|
86
|
+
|
|
87
|
+
E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
|
|
88
|
+
E(mdb_cursor_open(txn, dbi, &cursor));
|
|
89
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
|
|
90
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
91
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
92
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
93
|
+
}
|
|
94
|
+
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
|
|
95
|
+
mdb_cursor_close(cursor);
|
|
96
|
+
mdb_txn_abort(txn);
|
|
97
|
+
|
|
98
|
+
j=0;
|
|
99
|
+
key.mv_data = sval;
|
|
100
|
+
for (i= count - 1; i > -1; i-= (rand()%5)) {
|
|
101
|
+
j++;
|
|
102
|
+
txn=NULL;
|
|
103
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
104
|
+
sprintf(sval, "%03x ", values[i]);
|
|
105
|
+
if (RES(MDB_NOTFOUND, mdb_del(txn, dbi, &key, NULL))) {
|
|
106
|
+
j--;
|
|
107
|
+
mdb_txn_abort(txn);
|
|
108
|
+
} else {
|
|
109
|
+
E(mdb_txn_commit(txn));
|
|
110
|
+
}
|
|
111
|
+
}
|
|
112
|
+
free(values);
|
|
113
|
+
printf("Deleted %d values\n", j);
|
|
114
|
+
|
|
115
|
+
E(mdb_env_stat(env, &mst));
|
|
116
|
+
E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
|
|
117
|
+
E(mdb_cursor_open(txn, dbi, &cursor));
|
|
118
|
+
printf("Cursor next\n");
|
|
119
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
|
|
120
|
+
printf("key: %.*s, data: %.*s\n",
|
|
121
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
122
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
123
|
+
}
|
|
124
|
+
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
|
|
125
|
+
printf("Cursor last\n");
|
|
126
|
+
E(mdb_cursor_get(cursor, &key, &data, MDB_LAST));
|
|
127
|
+
printf("key: %.*s, data: %.*s\n",
|
|
128
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
129
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
130
|
+
printf("Cursor prev\n");
|
|
131
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_PREV)) == 0) {
|
|
132
|
+
printf("key: %.*s, data: %.*s\n",
|
|
133
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
134
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
135
|
+
}
|
|
136
|
+
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
|
|
137
|
+
printf("Cursor last/prev\n");
|
|
138
|
+
E(mdb_cursor_get(cursor, &key, &data, MDB_LAST));
|
|
139
|
+
printf("key: %.*s, data: %.*s\n",
|
|
140
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
141
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
142
|
+
E(mdb_cursor_get(cursor, &key, &data, MDB_PREV));
|
|
143
|
+
printf("key: %.*s, data: %.*s\n",
|
|
144
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
145
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
146
|
+
|
|
147
|
+
mdb_cursor_close(cursor);
|
|
148
|
+
mdb_txn_abort(txn);
|
|
149
|
+
|
|
150
|
+
printf("Deleting with cursor\n");
|
|
151
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
152
|
+
E(mdb_cursor_open(txn, dbi, &cur2));
|
|
153
|
+
for (i=0; i<50; i++) {
|
|
154
|
+
if (RES(MDB_NOTFOUND, mdb_cursor_get(cur2, &key, &data, MDB_NEXT)))
|
|
155
|
+
break;
|
|
156
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
157
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
158
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
159
|
+
E(mdb_del(txn, dbi, &key, NULL));
|
|
160
|
+
}
|
|
161
|
+
|
|
162
|
+
printf("Restarting cursor in txn\n");
|
|
163
|
+
for (op=MDB_FIRST, i=0; i<=32; op=MDB_NEXT, i++) {
|
|
164
|
+
if (RES(MDB_NOTFOUND, mdb_cursor_get(cur2, &key, &data, op)))
|
|
165
|
+
break;
|
|
166
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
167
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
168
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
169
|
+
}
|
|
170
|
+
mdb_cursor_close(cur2);
|
|
171
|
+
E(mdb_txn_commit(txn));
|
|
172
|
+
|
|
173
|
+
printf("Restarting cursor outside txn\n");
|
|
174
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
175
|
+
E(mdb_cursor_open(txn, dbi, &cursor));
|
|
176
|
+
for (op=MDB_FIRST, i=0; i<=32; op=MDB_NEXT, i++) {
|
|
177
|
+
if (RES(MDB_NOTFOUND, mdb_cursor_get(cursor, &key, &data, op)))
|
|
178
|
+
break;
|
|
179
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
180
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
181
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
182
|
+
}
|
|
183
|
+
mdb_cursor_close(cursor);
|
|
184
|
+
mdb_txn_abort(txn);
|
|
185
|
+
|
|
186
|
+
mdb_dbi_close(env, dbi);
|
|
187
|
+
mdb_env_close(env);
|
|
188
|
+
|
|
189
|
+
return 0;
|
|
190
|
+
}
|
|
@@ -0,0 +1,189 @@
|
|
|
1
|
+
/* mtest_enc.c - memory-mapped database tester/toy with encryption */
|
|
2
|
+
/*
|
|
3
|
+
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
|
4
|
+
* All rights reserved.
|
|
5
|
+
*
|
|
6
|
+
* Redistribution and use in source and binary forms, with or without
|
|
7
|
+
* modification, are permitted only as authorized by the Symas
|
|
8
|
+
* Dual-Use License.
|
|
9
|
+
*
|
|
10
|
+
* A copy of this license is available in the file LICENSE in the
|
|
11
|
+
* source distribution.
|
|
12
|
+
*/
|
|
13
|
+
#include <stdio.h>
|
|
14
|
+
#include <string.h>
|
|
15
|
+
#include <stdlib.h>
|
|
16
|
+
#include <time.h>
|
|
17
|
+
#include "lmdb.h"
|
|
18
|
+
#include "module.h"
|
|
19
|
+
|
|
20
|
+
#define E(expr) CHECK((rc = (expr)) == MDB_SUCCESS, #expr)
|
|
21
|
+
#define RES(err, expr) ((rc = expr) == (err) || (CHECK(!rc, #expr), 0))
|
|
22
|
+
#define CHECK(test, msg) ((test) ? (void)0 : ((void)fprintf(stderr, \
|
|
23
|
+
"%s:%d: %s: %s\n", __FILE__, __LINE__, msg, mdb_strerror(rc)), abort()))
|
|
24
|
+
|
|
25
|
+
MDB_crypto_funcs *cf;
|
|
26
|
+
|
|
27
|
+
int main(int argc,char * argv[])
|
|
28
|
+
{
|
|
29
|
+
int i = 0, j = 0, rc;
|
|
30
|
+
MDB_env *env;
|
|
31
|
+
MDB_dbi dbi;
|
|
32
|
+
MDB_val key, data;
|
|
33
|
+
MDB_txn *txn;
|
|
34
|
+
MDB_stat mst;
|
|
35
|
+
MDB_cursor *cursor, *cur2;
|
|
36
|
+
MDB_cursor_op op;
|
|
37
|
+
int count;
|
|
38
|
+
int *values;
|
|
39
|
+
char sval[32] = "";
|
|
40
|
+
char password[] = "This is my passphrase for now...";
|
|
41
|
+
void *mlm;
|
|
42
|
+
char *errmsg;
|
|
43
|
+
|
|
44
|
+
srand(time(NULL));
|
|
45
|
+
|
|
46
|
+
count = (rand()%384) + 64;
|
|
47
|
+
values = (int *)malloc(count*sizeof(int));
|
|
48
|
+
|
|
49
|
+
for(i = 0;i<count;i++) {
|
|
50
|
+
values[i] = rand()%1024;
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
E(mdb_env_create(&env));
|
|
54
|
+
mlm = mlm_setup(env, "./crypto.lm", password, &errmsg);
|
|
55
|
+
if (!mlm) {
|
|
56
|
+
fprintf(stderr,"Failed to load crypto module: %s\n", errmsg);
|
|
57
|
+
exit(1);
|
|
58
|
+
}
|
|
59
|
+
E(mdb_env_set_maxreaders(env, 1));
|
|
60
|
+
E(mdb_env_set_mapsize(env, 10485760));
|
|
61
|
+
E(mdb_env_open(env, "./testdb", 0 /*|MDB_NOSYNC*/, 0664));
|
|
62
|
+
|
|
63
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
64
|
+
E(mdb_dbi_open(txn, NULL, 0, &dbi));
|
|
65
|
+
|
|
66
|
+
key.mv_size = sizeof(int);
|
|
67
|
+
key.mv_data = sval;
|
|
68
|
+
|
|
69
|
+
printf("Adding %d values\n", count);
|
|
70
|
+
for (i=0;i<count;i++) {
|
|
71
|
+
sprintf(sval, "%03x %d foo bar", values[i], values[i]);
|
|
72
|
+
/* Set <data> in each iteration, since MDB_NOOVERWRITE may modify it */
|
|
73
|
+
data.mv_size = sizeof(sval);
|
|
74
|
+
data.mv_data = sval;
|
|
75
|
+
if (RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NOOVERWRITE))) {
|
|
76
|
+
j++;
|
|
77
|
+
data.mv_size = sizeof(sval);
|
|
78
|
+
data.mv_data = sval;
|
|
79
|
+
}
|
|
80
|
+
}
|
|
81
|
+
if (j) printf("%d duplicates skipped\n", j);
|
|
82
|
+
E(mdb_txn_commit(txn));
|
|
83
|
+
E(mdb_env_stat(env, &mst));
|
|
84
|
+
|
|
85
|
+
E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
|
|
86
|
+
E(mdb_cursor_open(txn, dbi, &cursor));
|
|
87
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
|
|
88
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
89
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
90
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
91
|
+
}
|
|
92
|
+
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
|
|
93
|
+
mdb_cursor_close(cursor);
|
|
94
|
+
mdb_txn_abort(txn);
|
|
95
|
+
|
|
96
|
+
j=0;
|
|
97
|
+
key.mv_data = sval;
|
|
98
|
+
for (i= count - 1; i > -1; i-= (rand()%5)) {
|
|
99
|
+
j++;
|
|
100
|
+
txn=NULL;
|
|
101
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
102
|
+
sprintf(sval, "%03x ", values[i]);
|
|
103
|
+
if (RES(MDB_NOTFOUND, mdb_del(txn, dbi, &key, NULL))) {
|
|
104
|
+
j--;
|
|
105
|
+
mdb_txn_abort(txn);
|
|
106
|
+
} else {
|
|
107
|
+
E(mdb_txn_commit(txn));
|
|
108
|
+
}
|
|
109
|
+
}
|
|
110
|
+
free(values);
|
|
111
|
+
printf("Deleted %d values\n", j);
|
|
112
|
+
|
|
113
|
+
E(mdb_env_stat(env, &mst));
|
|
114
|
+
E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
|
|
115
|
+
E(mdb_cursor_open(txn, dbi, &cursor));
|
|
116
|
+
printf("Cursor next\n");
|
|
117
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
|
|
118
|
+
printf("key: %.*s, data: %.*s\n",
|
|
119
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
120
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
121
|
+
}
|
|
122
|
+
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
|
|
123
|
+
printf("Cursor last\n");
|
|
124
|
+
E(mdb_cursor_get(cursor, &key, &data, MDB_LAST));
|
|
125
|
+
printf("key: %.*s, data: %.*s\n",
|
|
126
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
127
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
128
|
+
printf("Cursor prev\n");
|
|
129
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_PREV)) == 0) {
|
|
130
|
+
printf("key: %.*s, data: %.*s\n",
|
|
131
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
132
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
133
|
+
}
|
|
134
|
+
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
|
|
135
|
+
printf("Cursor last/prev\n");
|
|
136
|
+
E(mdb_cursor_get(cursor, &key, &data, MDB_LAST));
|
|
137
|
+
printf("key: %.*s, data: %.*s\n",
|
|
138
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
139
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
140
|
+
E(mdb_cursor_get(cursor, &key, &data, MDB_PREV));
|
|
141
|
+
printf("key: %.*s, data: %.*s\n",
|
|
142
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
143
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
144
|
+
|
|
145
|
+
mdb_cursor_close(cursor);
|
|
146
|
+
mdb_txn_abort(txn);
|
|
147
|
+
|
|
148
|
+
printf("Deleting with cursor\n");
|
|
149
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
150
|
+
E(mdb_cursor_open(txn, dbi, &cur2));
|
|
151
|
+
for (i=0; i<50; i++) {
|
|
152
|
+
if (RES(MDB_NOTFOUND, mdb_cursor_get(cur2, &key, &data, MDB_NEXT)))
|
|
153
|
+
break;
|
|
154
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
155
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
156
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
157
|
+
E(mdb_del(txn, dbi, &key, NULL));
|
|
158
|
+
}
|
|
159
|
+
|
|
160
|
+
printf("Restarting cursor in txn\n");
|
|
161
|
+
for (op=MDB_FIRST, i=0; i<=32; op=MDB_NEXT, i++) {
|
|
162
|
+
if (RES(MDB_NOTFOUND, mdb_cursor_get(cur2, &key, &data, op)))
|
|
163
|
+
break;
|
|
164
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
165
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
166
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
167
|
+
}
|
|
168
|
+
mdb_cursor_close(cur2);
|
|
169
|
+
E(mdb_txn_commit(txn));
|
|
170
|
+
|
|
171
|
+
printf("Restarting cursor outside txn\n");
|
|
172
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
173
|
+
E(mdb_cursor_open(txn, dbi, &cursor));
|
|
174
|
+
for (op=MDB_FIRST, i=0; i<=32; op=MDB_NEXT, i++) {
|
|
175
|
+
if (RES(MDB_NOTFOUND, mdb_cursor_get(cursor, &key, &data, op)))
|
|
176
|
+
break;
|
|
177
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
178
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
179
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
180
|
+
}
|
|
181
|
+
mdb_cursor_close(cursor);
|
|
182
|
+
mdb_txn_abort(txn);
|
|
183
|
+
|
|
184
|
+
mdb_dbi_close(env, dbi);
|
|
185
|
+
mdb_env_close(env);
|
|
186
|
+
mlm_unload(mlm);
|
|
187
|
+
|
|
188
|
+
return 0;
|
|
189
|
+
}
|
|
@@ -0,0 +1,177 @@
|
|
|
1
|
+
/* mtest_remap.c - memory-mapped database tester/toy with page remapping */
|
|
2
|
+
/*
|
|
3
|
+
* Copyright 2011-2021 Howard Chu, Symas Corp.
|
|
4
|
+
* All rights reserved.
|
|
5
|
+
*
|
|
6
|
+
* Redistribution and use in source and binary forms, with or without
|
|
7
|
+
* modification, are permitted only as authorized by the Symas
|
|
8
|
+
* Dual-Use License.
|
|
9
|
+
*
|
|
10
|
+
* A copy of this license is available in the file LICENSE in the
|
|
11
|
+
* source distribution.
|
|
12
|
+
*/
|
|
13
|
+
#include <stdio.h>
|
|
14
|
+
#include <stdlib.h>
|
|
15
|
+
#include <time.h>
|
|
16
|
+
#include "lmdb.h"
|
|
17
|
+
#include "chacha8.h"
|
|
18
|
+
|
|
19
|
+
#define E(expr) CHECK((rc = (expr)) == MDB_SUCCESS, #expr)
|
|
20
|
+
#define RES(err, expr) ((rc = expr) == (err) || (CHECK(!rc, #expr), 0))
|
|
21
|
+
#define CHECK(test, msg) ((test) ? (void)0 : ((void)fprintf(stderr, \
|
|
22
|
+
"%s:%d: %s: %s\n", __FILE__, __LINE__, msg, mdb_strerror(rc)), abort()))
|
|
23
|
+
|
|
24
|
+
int main(int argc,char * argv[])
|
|
25
|
+
{
|
|
26
|
+
int i = 0, j = 0, rc;
|
|
27
|
+
MDB_env *env;
|
|
28
|
+
MDB_dbi dbi;
|
|
29
|
+
MDB_val key, data;
|
|
30
|
+
MDB_txn *txn;
|
|
31
|
+
MDB_stat mst;
|
|
32
|
+
MDB_cursor *cursor, *cur2;
|
|
33
|
+
MDB_cursor_op op;
|
|
34
|
+
int count;
|
|
35
|
+
int *values;
|
|
36
|
+
char sval[32] = "";
|
|
37
|
+
|
|
38
|
+
srand(time(NULL));
|
|
39
|
+
|
|
40
|
+
count = (rand()%384) + 64;
|
|
41
|
+
values = (int *)malloc(count*sizeof(int));
|
|
42
|
+
|
|
43
|
+
for(i = 0;i<count;i++) {
|
|
44
|
+
values[i] = rand()%1024;
|
|
45
|
+
}
|
|
46
|
+
|
|
47
|
+
E(mdb_env_create(&env));
|
|
48
|
+
E(mdb_env_set_maxreaders(env, 1));
|
|
49
|
+
E(mdb_env_set_mapsize(env, 10485760));
|
|
50
|
+
E(mdb_env_open(env, "./testdb", MDB_REMAP_CHUNKS /*|MDB_NOSYNC*/, 0664));
|
|
51
|
+
|
|
52
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
53
|
+
E(mdb_dbi_open(txn, NULL, 0, &dbi));
|
|
54
|
+
|
|
55
|
+
key.mv_size = sizeof(int);
|
|
56
|
+
key.mv_data = sval;
|
|
57
|
+
|
|
58
|
+
printf("Adding %d values\n", count);
|
|
59
|
+
for (i=0;i<count;i++) {
|
|
60
|
+
sprintf(sval, "%03x %d foo bar", values[i], values[i]);
|
|
61
|
+
/* Set <data> in each iteration, since MDB_NOOVERWRITE may modify it */
|
|
62
|
+
data.mv_size = sizeof(sval);
|
|
63
|
+
data.mv_data = sval;
|
|
64
|
+
if (RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NOOVERWRITE))) {
|
|
65
|
+
j++;
|
|
66
|
+
data.mv_size = sizeof(sval);
|
|
67
|
+
data.mv_data = sval;
|
|
68
|
+
}
|
|
69
|
+
}
|
|
70
|
+
if (j) printf("%d duplicates skipped\n", j);
|
|
71
|
+
E(mdb_txn_commit(txn));
|
|
72
|
+
E(mdb_env_stat(env, &mst));
|
|
73
|
+
|
|
74
|
+
E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
|
|
75
|
+
E(mdb_cursor_open(txn, dbi, &cursor));
|
|
76
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
|
|
77
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
78
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
79
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
80
|
+
}
|
|
81
|
+
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
|
|
82
|
+
mdb_cursor_close(cursor);
|
|
83
|
+
mdb_txn_abort(txn);
|
|
84
|
+
|
|
85
|
+
j=0;
|
|
86
|
+
key.mv_data = sval;
|
|
87
|
+
for (i= count - 1; i > -1; i-= (rand()%5)) {
|
|
88
|
+
j++;
|
|
89
|
+
txn=NULL;
|
|
90
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
91
|
+
sprintf(sval, "%03x ", values[i]);
|
|
92
|
+
if (RES(MDB_NOTFOUND, mdb_del(txn, dbi, &key, NULL))) {
|
|
93
|
+
j--;
|
|
94
|
+
mdb_txn_abort(txn);
|
|
95
|
+
} else {
|
|
96
|
+
E(mdb_txn_commit(txn));
|
|
97
|
+
}
|
|
98
|
+
}
|
|
99
|
+
free(values);
|
|
100
|
+
printf("Deleted %d values\n", j);
|
|
101
|
+
|
|
102
|
+
E(mdb_env_stat(env, &mst));
|
|
103
|
+
E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
|
|
104
|
+
E(mdb_cursor_open(txn, dbi, &cursor));
|
|
105
|
+
printf("Cursor next\n");
|
|
106
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
|
|
107
|
+
printf("key: %.*s, data: %.*s\n",
|
|
108
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
109
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
110
|
+
}
|
|
111
|
+
CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
|
|
112
|
+
printf("Cursor last\n");
|
|
113
|
+
E(mdb_cursor_get(cursor, &key, &data, MDB_LAST));
|
|
114
|
+
printf("key: %.*s, data: %.*s\n",
|
|
115
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
116
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
117
|
+
printf("Cursor prev\n");
|
|
118
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_PREV)) == 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
|
+
printf("Cursor last/prev\n");
|
|
125
|
+
E(mdb_cursor_get(cursor, &key, &data, MDB_LAST));
|
|
126
|
+
printf("key: %.*s, data: %.*s\n",
|
|
127
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
128
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
129
|
+
E(mdb_cursor_get(cursor, &key, &data, MDB_PREV));
|
|
130
|
+
printf("key: %.*s, data: %.*s\n",
|
|
131
|
+
(int) key.mv_size, (char *) key.mv_data,
|
|
132
|
+
(int) data.mv_size, (char *) data.mv_data);
|
|
133
|
+
|
|
134
|
+
mdb_cursor_close(cursor);
|
|
135
|
+
mdb_txn_abort(txn);
|
|
136
|
+
|
|
137
|
+
printf("Deleting with cursor\n");
|
|
138
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
139
|
+
E(mdb_cursor_open(txn, dbi, &cur2));
|
|
140
|
+
for (i=0; i<50; i++) {
|
|
141
|
+
if (RES(MDB_NOTFOUND, mdb_cursor_get(cur2, &key, &data, MDB_NEXT)))
|
|
142
|
+
break;
|
|
143
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
144
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
145
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
146
|
+
E(mdb_del(txn, dbi, &key, NULL));
|
|
147
|
+
}
|
|
148
|
+
|
|
149
|
+
printf("Restarting cursor in txn\n");
|
|
150
|
+
for (op=MDB_FIRST, i=0; i<=32; op=MDB_NEXT, i++) {
|
|
151
|
+
if (RES(MDB_NOTFOUND, mdb_cursor_get(cur2, &key, &data, op)))
|
|
152
|
+
break;
|
|
153
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
154
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
155
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
156
|
+
}
|
|
157
|
+
mdb_cursor_close(cur2);
|
|
158
|
+
E(mdb_txn_commit(txn));
|
|
159
|
+
|
|
160
|
+
printf("Restarting cursor outside txn\n");
|
|
161
|
+
E(mdb_txn_begin(env, NULL, 0, &txn));
|
|
162
|
+
E(mdb_cursor_open(txn, dbi, &cursor));
|
|
163
|
+
for (op=MDB_FIRST, i=0; i<=32; op=MDB_NEXT, i++) {
|
|
164
|
+
if (RES(MDB_NOTFOUND, mdb_cursor_get(cursor, &key, &data, op)))
|
|
165
|
+
break;
|
|
166
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
167
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
168
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
169
|
+
}
|
|
170
|
+
mdb_cursor_close(cursor);
|
|
171
|
+
mdb_txn_abort(txn);
|
|
172
|
+
|
|
173
|
+
mdb_dbi_close(env, dbi);
|
|
174
|
+
mdb_env_close(env);
|
|
175
|
+
|
|
176
|
+
return 0;
|
|
177
|
+
}
|
|
@@ -0,0 +1,73 @@
|
|
|
1
|
+
/* sample-bdb.txt - BerkeleyDB toy/sample
|
|
2
|
+
*
|
|
3
|
+
* Do a line-by-line comparison of this and sample-mdb.txt
|
|
4
|
+
*/
|
|
5
|
+
/*
|
|
6
|
+
* Copyright 2012-2021 Howard Chu, Symas Corp.
|
|
7
|
+
* All rights reserved.
|
|
8
|
+
*
|
|
9
|
+
* Redistribution and use in source and binary forms, with or without
|
|
10
|
+
* modification, are permitted only as authorized by the OpenLDAP
|
|
11
|
+
* Public License.
|
|
12
|
+
*
|
|
13
|
+
* A copy of this license is available in the file LICENSE in the
|
|
14
|
+
* top-level directory of the distribution or, alternatively, at
|
|
15
|
+
* <http://www.OpenLDAP.org/license.html>.
|
|
16
|
+
*/
|
|
17
|
+
#include <stdio.h>
|
|
18
|
+
#include <string.h>
|
|
19
|
+
#include <db.h>
|
|
20
|
+
|
|
21
|
+
int main(int argc,char * argv[])
|
|
22
|
+
{
|
|
23
|
+
int rc;
|
|
24
|
+
DB_ENV *env;
|
|
25
|
+
DB *dbi;
|
|
26
|
+
DBT key, data;
|
|
27
|
+
DB_TXN *txn;
|
|
28
|
+
DBC *cursor;
|
|
29
|
+
char sval[32], kval[32];
|
|
30
|
+
|
|
31
|
+
/* Note: Most error checking omitted for simplicity */
|
|
32
|
+
|
|
33
|
+
#define FLAGS (DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_TXN|DB_INIT_MPOOL|DB_CREATE|DB_THREAD)
|
|
34
|
+
rc = db_env_create(&env, 0);
|
|
35
|
+
rc = env->open(env, "./testdb", FLAGS, 0664);
|
|
36
|
+
rc = db_create(&dbi, env, 0);
|
|
37
|
+
rc = env->txn_begin(env, NULL, &txn, 0);
|
|
38
|
+
rc = dbi->open(dbi, txn, "test.bdb", NULL, DB_BTREE, DB_CREATE, 0664);
|
|
39
|
+
|
|
40
|
+
memset(&key, 0, sizeof(DBT));
|
|
41
|
+
memset(&data, 0, sizeof(DBT));
|
|
42
|
+
key.size = sizeof(int);
|
|
43
|
+
key.data = sval;
|
|
44
|
+
data.size = sizeof(sval);
|
|
45
|
+
data.data = sval;
|
|
46
|
+
|
|
47
|
+
sprintf(sval, "%03x %d foo bar", 32, 3141592);
|
|
48
|
+
rc = dbi->put(dbi, txn, &key, &data, 0);
|
|
49
|
+
rc = txn->commit(txn, 0);
|
|
50
|
+
if (rc) {
|
|
51
|
+
fprintf(stderr, "txn->commit: (%d) %s\n", rc, db_strerror(rc));
|
|
52
|
+
goto leave;
|
|
53
|
+
}
|
|
54
|
+
rc = env->txn_begin(env, NULL, &txn, 0);
|
|
55
|
+
rc = dbi->cursor(dbi, txn, &cursor, 0);
|
|
56
|
+
key.flags = DB_DBT_USERMEM;
|
|
57
|
+
key.data = kval;
|
|
58
|
+
key.ulen = sizeof(kval);
|
|
59
|
+
data.flags = DB_DBT_USERMEM;
|
|
60
|
+
data.data = sval;
|
|
61
|
+
data.ulen = sizeof(sval);
|
|
62
|
+
while ((rc = cursor->c_get(cursor, &key, &data, DB_NEXT)) == 0) {
|
|
63
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
64
|
+
key.data, (int) key.size, (char *) key.data,
|
|
65
|
+
data.data, (int) data.size, (char *) data.data);
|
|
66
|
+
}
|
|
67
|
+
rc = cursor->c_close(cursor);
|
|
68
|
+
rc = txn->abort(txn);
|
|
69
|
+
leave:
|
|
70
|
+
rc = dbi->close(dbi, 0);
|
|
71
|
+
rc = env->close(env, 0);
|
|
72
|
+
return rc;
|
|
73
|
+
}
|
|
@@ -0,0 +1,62 @@
|
|
|
1
|
+
/* sample-mdb.txt - MDB toy/sample
|
|
2
|
+
*
|
|
3
|
+
* Do a line-by-line comparison of this and sample-bdb.txt
|
|
4
|
+
*/
|
|
5
|
+
/*
|
|
6
|
+
* Copyright 2012-2021 Howard Chu, Symas Corp.
|
|
7
|
+
* All rights reserved.
|
|
8
|
+
*
|
|
9
|
+
* Redistribution and use in source and binary forms, with or without
|
|
10
|
+
* modification, are permitted only as authorized by the OpenLDAP
|
|
11
|
+
* Public License.
|
|
12
|
+
*
|
|
13
|
+
* A copy of this license is available in the file LICENSE in the
|
|
14
|
+
* top-level directory of the distribution or, alternatively, at
|
|
15
|
+
* <http://www.OpenLDAP.org/license.html>.
|
|
16
|
+
*/
|
|
17
|
+
#include <stdio.h>
|
|
18
|
+
#include "lmdb.h"
|
|
19
|
+
|
|
20
|
+
int main(int argc,char * argv[])
|
|
21
|
+
{
|
|
22
|
+
int rc;
|
|
23
|
+
MDB_env *env;
|
|
24
|
+
MDB_dbi dbi;
|
|
25
|
+
MDB_val key, data;
|
|
26
|
+
MDB_txn *txn;
|
|
27
|
+
MDB_cursor *cursor;
|
|
28
|
+
char sval[32];
|
|
29
|
+
|
|
30
|
+
/* Note: Most error checking omitted for simplicity */
|
|
31
|
+
|
|
32
|
+
rc = mdb_env_create(&env);
|
|
33
|
+
rc = mdb_env_open(env, "./testdb", 0, 0664);
|
|
34
|
+
rc = mdb_txn_begin(env, NULL, 0, &txn);
|
|
35
|
+
rc = mdb_dbi_open(txn, NULL, 0, &dbi);
|
|
36
|
+
|
|
37
|
+
key.mv_size = sizeof(int);
|
|
38
|
+
key.mv_data = sval;
|
|
39
|
+
data.mv_size = sizeof(sval);
|
|
40
|
+
data.mv_data = sval;
|
|
41
|
+
|
|
42
|
+
sprintf(sval, "%03x %d foo bar", 32, 3141592);
|
|
43
|
+
rc = mdb_put(txn, dbi, &key, &data, 0);
|
|
44
|
+
rc = mdb_txn_commit(txn);
|
|
45
|
+
if (rc) {
|
|
46
|
+
fprintf(stderr, "mdb_txn_commit: (%d) %s\n", rc, mdb_strerror(rc));
|
|
47
|
+
goto leave;
|
|
48
|
+
}
|
|
49
|
+
rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
|
|
50
|
+
rc = mdb_cursor_open(txn, dbi, &cursor);
|
|
51
|
+
while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
|
|
52
|
+
printf("key: %p %.*s, data: %p %.*s\n",
|
|
53
|
+
key.mv_data, (int) key.mv_size, (char *) key.mv_data,
|
|
54
|
+
data.mv_data, (int) data.mv_size, (char *) data.mv_data);
|
|
55
|
+
}
|
|
56
|
+
mdb_cursor_close(cursor);
|
|
57
|
+
mdb_txn_abort(txn);
|
|
58
|
+
leave:
|
|
59
|
+
mdb_dbi_close(env, dbi);
|
|
60
|
+
mdb_env_close(env);
|
|
61
|
+
return 0;
|
|
62
|
+
}
|