1 #include <ccan/tdb2/tdb.c>
2 #include <ccan/tdb2/open.c>
3 #include <ccan/tdb2/free.c>
4 #include <ccan/tdb2/lock.c>
5 #include <ccan/tdb2/io.c>
6 #include <ccan/tdb2/hash.c>
7 #include <ccan/tdb2/check.c>
8 #include <ccan/tdb2/traverse.c>
9 #include <ccan/tdb2/transaction.c>
10 #include <ccan/tap/tap.h>
13 #define NUM_RECORDS 1000
15 /* We use the same seed which we saw a failure on. */
16 static uint64_t fixedhash(const void *key, size_t len, uint64_t seed, void *p)
18 return hash64_stable((const unsigned char *)key, len,
22 static bool store_records(struct tdb_context *tdb)
25 struct tdb_data key = { (unsigned char *)&i, sizeof(i) };
26 struct tdb_data data = { (unsigned char *)&i, sizeof(i) };
28 for (i = 0; i < NUM_RECORDS; i++)
29 if (tdb_store(tdb, key, data, TDB_REPLACE) != 0)
35 unsigned int calls, call_limit;
39 enum TDB_ERROR delete_error;
42 static int trav(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf,
48 if (key.dsize != sizeof(val) || dbuf.dsize != sizeof(val)
49 || memcmp(key.dptr, dbuf.dptr, key.dsize) != 0) {
53 memcpy(&val, dbuf.dptr, dbuf.dsize);
60 td->delete_error = tdb_delete(tdb, key);
61 if (td->delete_error != TDB_SUCCESS) {
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,
79 struct trav_grow_data *tgd)
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 tgd->error = tdb_append(tdb, key, dbuf);
99 if (tgd->error != TDB_SUCCESS) {
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 },
120 hattr.base.next = &tap_log_attr;
122 plan_tests(sizeof(flags) / sizeof(flags[0]) * 32 + 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(tdb, NULL, NULL) == 0);
132 ok1(store_records(tdb));
133 num = tdb_traverse(tdb, NULL, NULL);
134 ok1(num == NUM_RECORDS);
138 td.call_limit = UINT_MAX;
144 num = tdb_traverse(tdb, trav, &td);
145 ok1(num == NUM_RECORDS);
147 ok1(td.calls == NUM_RECORDS);
149 ok1(td.high == NUM_RECORDS-1);
151 /* Short traverse. */
153 td.call_limit = NUM_RECORDS / 2;
159 num = tdb_traverse(tdb, trav, &td);
160 ok1(num == NUM_RECORDS / 2);
162 ok1(td.calls == NUM_RECORDS / 2);
163 ok1(td.low <= NUM_RECORDS / 2);
164 ok1(td.high > NUM_RECORDS / 2);
165 ok1(tdb_check(tdb, NULL, NULL) == 0);
166 ok1(tap_log_messages == 0);
168 /* Deleting traverse (delete everything). */
170 td.call_limit = UINT_MAX;
175 td.delete_error = TDB_SUCCESS;
176 num = tdb_traverse(tdb, trav, &td);
177 ok1(num == NUM_RECORDS);
178 ok1(td.delete_error == TDB_SUCCESS);
180 ok1(td.calls == NUM_RECORDS);
182 ok1(td.high == NUM_RECORDS - 1);
183 ok1(tdb_check(tdb, NULL, NULL) == 0);
185 /* Now it's empty! */
186 ok1(tdb_traverse(tdb, NULL, NULL) == 0);
189 ok1(store_records(tdb));
190 ok1(tdb_traverse(tdb, NULL, NULL) == NUM_RECORDS);
191 ok1(tdb_check(tdb, NULL, NULL) == 0);
193 /* Grow. This will cause us to be reshuffled. */
196 tgd.mismatch = false;
197 tgd.error = TDB_SUCCESS;
198 ok1(tdb_traverse(tdb, trav_grow, &tgd) > 1);
201 ok1(tdb_check(tdb, NULL, NULL) == 0);
202 ok1(tgd.num_large < tgd.calls);
203 diag("growing db: %u calls, %u repeats",
204 tgd.calls, tgd.num_large);
209 ok1(tap_log_messages == 0);
210 return exit_status();