1 #include <ccan/tdb2/tdb.c>
2 #include <ccan/tdb2/free.c>
3 #include <ccan/tdb2/lock.c>
4 #include <ccan/tdb2/io.c>
5 #include <ccan/tdb2/hash.c>
6 #include <ccan/tdb2/check.c>
7 #include <ccan/tdb2/traverse.c>
8 #include <ccan/tdb2/transaction.c>
9 #include <ccan/tap/tap.h>
12 #define NUM_RECORDS 1000
14 /* We use the same seed which we saw a failure on. */
15 static uint64_t fixedhash(const void *key, size_t len, uint64_t seed, void *p)
17 return hash64_stable((const unsigned char *)key, len,
21 static bool store_records(struct tdb_context *tdb)
24 struct tdb_data key = { (unsigned char *)&i, sizeof(i) };
25 struct tdb_data data = { (unsigned char *)&i, sizeof(i) };
27 for (i = 0; i < NUM_RECORDS; i++)
28 if (tdb_store(tdb, key, data, TDB_REPLACE) != 0)
34 unsigned int calls, call_limit;
38 enum TDB_ERROR delete_error;
41 static int trav(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, void *p)
43 struct trav_data *td = p;
47 if (key.dsize != sizeof(val) || dbuf.dsize != sizeof(val)
48 || memcmp(key.dptr, dbuf.dptr, key.dsize) != 0) {
52 memcpy(&val, dbuf.dptr, dbuf.dsize);
60 if (tdb_delete(tdb, key) != 0) {
61 td->delete_error = tdb_error(tdb);
66 if (td->calls == td->call_limit)
71 struct trav_grow_data {
73 unsigned int num_large;
78 static int trav_grow(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf,
81 struct trav_grow_data *tgd = p;
83 unsigned char buffer[128] = { 0 };
86 if (key.dsize != sizeof(val) || dbuf.dsize < sizeof(val)
87 || memcmp(key.dptr, dbuf.dptr, key.dsize) != 0) {
92 if (dbuf.dsize > sizeof(val))
93 /* We must have seen this before! */
96 /* Make a big difference to the database. */
98 dbuf.dsize = sizeof(buffer);
99 if (tdb_append(tdb, key, dbuf) != 0) {
100 tgd->error = tdb_error(tdb);
106 int main(int argc, char *argv[])
111 struct trav_grow_data tgd;
112 struct tdb_context *tdb;
113 uint64_t seed = 16014841315512641303ULL;
114 int flags[] = { TDB_INTERNAL, TDB_DEFAULT, TDB_NOMMAP,
115 TDB_INTERNAL|TDB_CONVERT, TDB_CONVERT,
116 TDB_NOMMAP|TDB_CONVERT };
117 union tdb_attribute hattr = { .hash = { .base = { TDB_ATTRIBUTE_HASH },
118 .hash_fn = fixedhash,
119 .hash_private = &seed } };
121 hattr.base.next = &tap_log_attr;
123 plan_tests(sizeof(flags) / sizeof(flags[0]) * 50 + 1);
124 for (i = 0; i < sizeof(flags) / sizeof(flags[0]); i++) {
125 tdb = tdb_open("run-traverse.tdb", flags[i],
126 O_RDWR|O_CREAT|O_TRUNC, 0600, &hattr);
131 ok1(tdb_traverse_read(tdb, NULL, NULL) == 0);
132 ok1(tdb_traverse(tdb, NULL, NULL) == 0);
134 ok1(store_records(tdb));
135 num = tdb_traverse_read(tdb, NULL, NULL);
136 ok1(num == NUM_RECORDS);
137 num = tdb_traverse(tdb, NULL, NULL);
138 ok1(num == NUM_RECORDS);
140 /* Full traverse (read-only). */
142 td.call_limit = UINT_MAX;
148 num = tdb_traverse_read(tdb, trav, &td);
149 ok1(num == NUM_RECORDS);
151 ok1(td.calls == NUM_RECORDS);
153 ok1(td.high == NUM_RECORDS-1);
157 td.call_limit = UINT_MAX;
163 num = tdb_traverse(tdb, trav, &td);
164 ok1(num == NUM_RECORDS);
166 ok1(td.calls == NUM_RECORDS);
168 ok1(td.high == NUM_RECORDS-1);
170 /* Short traverse. */
172 td.call_limit = NUM_RECORDS / 2;
178 num = tdb_traverse(tdb, trav, &td);
179 ok1(num == NUM_RECORDS / 2);
181 ok1(td.calls == NUM_RECORDS / 2);
182 ok1(td.low <= NUM_RECORDS / 2);
183 ok1(td.high > NUM_RECORDS / 2);
184 ok1(tdb_check(tdb, NULL, NULL) == 0);
186 /* Growing traverse. Expect failure on r/o traverse. */
189 tgd.mismatch = false;
190 tgd.error = TDB_SUCCESS;
191 num = tdb_traverse_read(tdb, trav_grow, &tgd);
193 ok1(tgd.error == TDB_ERR_RDONLY);
196 ok1(tdb_check(tdb, NULL, NULL) == 0);
198 /* Deleting traverse. Expect failure on r/o traverse. */
200 td.call_limit = UINT_MAX;
205 td.delete_error = TDB_SUCCESS;
206 num = tdb_traverse_read(tdb, trav, &td);
208 ok1(td.delete_error == TDB_ERR_RDONLY);
211 ok1(td.low == td.high);
212 ok1(tdb_check(tdb, NULL, NULL) == 0);
214 /* Deleting traverse (delete everything). */
216 td.call_limit = UINT_MAX;
221 td.delete_error = TDB_SUCCESS;
222 num = tdb_traverse(tdb, trav, &td);
223 ok1(num == NUM_RECORDS);
224 ok1(td.delete_error == TDB_SUCCESS);
226 ok1(td.calls == NUM_RECORDS);
228 ok1(td.high == NUM_RECORDS - 1);
229 ok1(tdb_check(tdb, NULL, NULL) == 0);
231 /* Now it's empty! */
232 ok1(tdb_traverse_read(tdb, NULL, NULL) == 0);
233 ok1(tdb_traverse(tdb, NULL, NULL) == 0);
236 ok1(store_records(tdb));
237 ok1(tdb_traverse_read(tdb, NULL, NULL) == NUM_RECORDS);
238 ok1(tdb_check(tdb, NULL, NULL) == 0);
240 /* Grow. This will cause us to be reshuffled. */
243 tgd.mismatch = false;
244 tgd.error = TDB_SUCCESS;
245 ok1(tdb_traverse(tdb, trav_grow, &tgd) > 1);
248 ok1(tdb_check(tdb, NULL, NULL) == 0);
249 ok1(tgd.num_large < tgd.calls);
250 diag("growing db: %u calls, %u repeats",
251 tgd.calls, tgd.num_large);
256 ok1(tap_log_messages == 0);
257 return exit_status();