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,
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);
59 td->delete_error = tdb_delete(tdb, key);
60 if (td->delete_error != TDB_SUCCESS) {
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,
78 struct trav_grow_data *tgd)
81 unsigned char buffer[128] = { 0 };
84 if (key.dsize != sizeof(val) || dbuf.dsize < sizeof(val)
85 || memcmp(key.dptr, dbuf.dptr, key.dsize) != 0) {
90 if (dbuf.dsize > sizeof(val))
91 /* We must have seen this before! */
94 /* Make a big difference to the database. */
96 dbuf.dsize = sizeof(buffer);
97 tgd->error = tdb_append(tdb, key, dbuf);
98 if (tgd->error != TDB_SUCCESS) {
104 int main(int argc, char *argv[])
109 struct trav_grow_data tgd;
110 struct tdb_context *tdb;
111 uint64_t seed = 16014841315512641303ULL;
112 int flags[] = { TDB_INTERNAL, TDB_DEFAULT, TDB_NOMMAP,
113 TDB_INTERNAL|TDB_CONVERT, TDB_CONVERT,
114 TDB_NOMMAP|TDB_CONVERT };
115 union tdb_attribute hattr = { .hash = { .base = { TDB_ATTRIBUTE_HASH },
116 .hash_fn = fixedhash,
117 .hash_private = &seed } };
119 hattr.base.next = &tap_log_attr;
121 plan_tests(sizeof(flags) / sizeof(flags[0]) * 32 + 1);
122 for (i = 0; i < sizeof(flags) / sizeof(flags[0]); i++) {
123 tdb = tdb_open("run-traverse.tdb", flags[i],
124 O_RDWR|O_CREAT|O_TRUNC, 0600, &hattr);
129 ok1(tdb_traverse(tdb, NULL, NULL) == 0);
131 ok1(store_records(tdb));
132 num = tdb_traverse(tdb, NULL, NULL);
133 ok1(num == NUM_RECORDS);
137 td.call_limit = UINT_MAX;
143 num = tdb_traverse(tdb, trav, &td);
144 ok1(num == NUM_RECORDS);
146 ok1(td.calls == NUM_RECORDS);
148 ok1(td.high == NUM_RECORDS-1);
150 /* Short traverse. */
152 td.call_limit = NUM_RECORDS / 2;
158 num = tdb_traverse(tdb, trav, &td);
159 ok1(num == NUM_RECORDS / 2);
161 ok1(td.calls == NUM_RECORDS / 2);
162 ok1(td.low <= NUM_RECORDS / 2);
163 ok1(td.high > NUM_RECORDS / 2);
164 ok1(tdb_check(tdb, NULL, NULL) == 0);
165 ok1(tap_log_messages == 0);
167 /* Deleting traverse (delete everything). */
169 td.call_limit = UINT_MAX;
174 td.delete_error = TDB_SUCCESS;
175 num = tdb_traverse(tdb, trav, &td);
176 ok1(num == NUM_RECORDS);
177 ok1(td.delete_error == TDB_SUCCESS);
179 ok1(td.calls == NUM_RECORDS);
181 ok1(td.high == NUM_RECORDS - 1);
182 ok1(tdb_check(tdb, NULL, NULL) == 0);
184 /* Now it's empty! */
185 ok1(tdb_traverse(tdb, NULL, NULL) == 0);
188 ok1(store_records(tdb));
189 ok1(tdb_traverse(tdb, NULL, NULL) == NUM_RECORDS);
190 ok1(tdb_check(tdb, NULL, NULL) == 0);
192 /* Grow. This will cause us to be reshuffled. */
195 tgd.mismatch = false;
196 tgd.error = TDB_SUCCESS;
197 ok1(tdb_traverse(tdb, trav_grow, &tgd) > 1);
200 ok1(tdb_check(tdb, NULL, NULL) == 0);
201 ok1(tgd.num_large < tgd.calls);
202 diag("growing db: %u calls, %u repeats",
203 tgd.calls, tgd.num_large);
208 ok1(tap_log_messages == 0);
209 return exit_status();