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/tap/tap.h>
11 #define NUM_RECORDS 1000
13 /* We use the same seed which we saw a failure on. */
14 static uint64_t fixedhash(const void *key, size_t len, uint64_t seed, void *p)
16 return hash64_stable((const unsigned char *)key, len,
20 static bool store_records(struct tdb_context *tdb)
23 struct tdb_data key = { (unsigned char *)&i, sizeof(i) };
24 struct tdb_data data = { (unsigned char *)&i, sizeof(i) };
26 for (i = 0; i < NUM_RECORDS; i++)
27 if (tdb_store(tdb, key, data, TDB_REPLACE) != 0)
33 unsigned int calls, call_limit;
37 enum TDB_ERROR delete_error;
40 static int trav(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, void *p)
42 struct trav_data *td = p;
46 if (key.dsize != sizeof(val) || dbuf.dsize != sizeof(val)
47 || memcmp(key.dptr, dbuf.dptr, key.dsize) != 0) {
51 memcpy(&val, dbuf.dptr, dbuf.dsize);
59 if (tdb_delete(tdb, key) != 0) {
60 td->delete_error = tdb_error(tdb);
65 if (td->calls == td->call_limit)
70 struct trav_grow_data {
72 unsigned int num_large;
77 static int trav_grow(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf,
80 struct trav_grow_data *tgd = p;
82 unsigned char buffer[128] = { 0 };
85 if (key.dsize != sizeof(val) || dbuf.dsize < sizeof(val)
86 || memcmp(key.dptr, dbuf.dptr, key.dsize) != 0) {
91 if (dbuf.dsize > sizeof(val))
92 /* We must have seen this before! */
95 /* Make a big difference to the database. */
97 dbuf.dsize = sizeof(buffer);
98 if (tdb_append(tdb, key, dbuf) != 0) {
99 tgd->error = tdb_error(tdb);
105 int main(int argc, char *argv[])
110 struct trav_grow_data tgd;
111 struct tdb_context *tdb;
112 uint64_t seed = 16014841315512641303ULL;
113 int flags[] = { TDB_INTERNAL, TDB_DEFAULT, TDB_NOMMAP,
114 TDB_INTERNAL|TDB_CONVERT, TDB_CONVERT,
115 TDB_NOMMAP|TDB_CONVERT };
116 union tdb_attribute hattr = { .hash = { .base = { TDB_ATTRIBUTE_HASH },
117 .hash_fn = fixedhash,
118 .hash_private = &seed } };
120 hattr.base.next = &tap_log_attr;
122 plan_tests(sizeof(flags) / sizeof(flags[0]) * 50 + 1);
123 for (i = 0; i < sizeof(flags) / sizeof(flags[0]); i++) {
124 tdb = tdb_open("run-traverse.tdb", flags[i],
125 O_RDWR|O_CREAT|O_TRUNC, 0600, &hattr);
130 ok1(tdb_traverse_read(tdb, NULL, NULL) == 0);
131 ok1(tdb_traverse(tdb, NULL, NULL) == 0);
133 ok1(store_records(tdb));
134 num = tdb_traverse_read(tdb, NULL, NULL);
135 ok1(num == NUM_RECORDS);
136 num = tdb_traverse(tdb, NULL, NULL);
137 ok1(num == NUM_RECORDS);
139 /* Full traverse (read-only). */
141 td.call_limit = UINT_MAX;
147 num = tdb_traverse_read(tdb, trav, &td);
148 ok1(num == NUM_RECORDS);
150 ok1(td.calls == NUM_RECORDS);
152 ok1(td.high == NUM_RECORDS-1);
156 td.call_limit = UINT_MAX;
162 num = tdb_traverse(tdb, trav, &td);
163 ok1(num == NUM_RECORDS);
165 ok1(td.calls == NUM_RECORDS);
167 ok1(td.high == NUM_RECORDS-1);
169 /* Short traverse. */
171 td.call_limit = NUM_RECORDS / 2;
177 num = tdb_traverse(tdb, trav, &td);
178 ok1(num == NUM_RECORDS / 2);
180 ok1(td.calls == NUM_RECORDS / 2);
181 ok1(td.low <= NUM_RECORDS / 2);
182 ok1(td.high > NUM_RECORDS / 2);
183 ok1(tdb_check(tdb, NULL, NULL) == 0);
185 /* Growing traverse. Expect failure on r/o traverse. */
188 tgd.mismatch = false;
189 tgd.error = TDB_SUCCESS;
190 num = tdb_traverse_read(tdb, trav_grow, &tgd);
192 ok1(tgd.error == TDB_ERR_RDONLY);
195 ok1(tdb_check(tdb, NULL, NULL) == 0);
197 /* Deleting traverse. Expect failure on r/o traverse. */
199 td.call_limit = UINT_MAX;
204 td.delete_error = TDB_SUCCESS;
205 num = tdb_traverse_read(tdb, trav, &td);
207 ok1(td.delete_error == TDB_ERR_RDONLY);
210 ok1(td.low == td.high);
211 ok1(tdb_check(tdb, NULL, NULL) == 0);
213 /* Deleting traverse (delete everything). */
215 td.call_limit = UINT_MAX;
220 td.delete_error = TDB_SUCCESS;
221 num = tdb_traverse(tdb, trav, &td);
222 ok1(num == NUM_RECORDS);
223 ok1(td.delete_error == TDB_SUCCESS);
225 ok1(td.calls == NUM_RECORDS);
227 ok1(td.high == NUM_RECORDS - 1);
228 ok1(tdb_check(tdb, NULL, NULL) == 0);
230 /* Now it's empty! */
231 ok1(tdb_traverse_read(tdb, NULL, NULL) == 0);
232 ok1(tdb_traverse(tdb, NULL, NULL) == 0);
235 ok1(store_records(tdb));
236 ok1(tdb_traverse_read(tdb, NULL, NULL) == NUM_RECORDS);
237 ok1(tdb_check(tdb, NULL, NULL) == 0);
239 /* Grow. This will cause us to be reshuffled. */
242 tgd.mismatch = false;
243 tgd.error = TDB_SUCCESS;
244 ok1(tdb_traverse(tdb, trav_grow, &tgd) > 1);
247 ok1(tdb_check(tdb, NULL, NULL) == 0);
248 ok1(tgd.num_large < tgd.calls);
249 diag("growing db: %u calls, %u repeats",
250 tgd.calls, tgd.num_large);
255 ok1(tap_log_messages == 0);
256 return exit_status();