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/transaction.c>
7 #include <ccan/tdb2/traverse.c>
8 #include <ccan/tdb2/check.c>
9 #include <ccan/tap/tap.h>
12 static uint64_t badhash(const void *key, size_t len, uint64_t seed, void *priv)
17 static int trav(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, void *p)
20 return tdb_delete(tdb, key);
24 int main(int argc, char *argv[])
27 struct tdb_context *tdb;
28 struct tdb_data key = { (unsigned char *)&j, sizeof(j) };
29 struct tdb_data dbuf = { (unsigned char *)&j, sizeof(j) };
30 union tdb_attribute hattr = { .hash = { .base = { TDB_ATTRIBUTE_HASH },
31 .hash_fn = badhash } };
32 int flags[] = { TDB_INTERNAL, TDB_DEFAULT, TDB_NOMMAP,
33 TDB_INTERNAL|TDB_CONVERT, TDB_CONVERT,
34 TDB_NOMMAP|TDB_CONVERT,
37 hattr.base.next = &tap_log_attr;
40 for (i = 0; i < sizeof(flags) / sizeof(flags[0]); i++) {
43 tdb = tdb_open("run-25-hashoverload.tdb", flags[i],
44 O_RDWR|O_CREAT|O_TRUNC, 0600, &hattr);
50 for (j = 0; j < (1 << TDB_HASH_GROUP_BITS); j++) {
51 ok1(tdb_store(tdb, key, dbuf, TDB_INSERT) == 0);
53 ok1(tdb_check(tdb, NULL, NULL) == 0);
55 /* Now store one last value: should form chain. */
56 ok1(tdb_store(tdb, key, dbuf, TDB_INSERT) == 0);
57 ok1(tdb_check(tdb, NULL, NULL) == 0);
59 /* Check we can find them all. */
60 for (j = 0; j < (1 << TDB_HASH_GROUP_BITS) + 1; j++) {
61 ok1(tdb_fetch(tdb, key, &d) == TDB_SUCCESS);
62 ok1(d.dsize == sizeof(j));
64 ok1(d.dptr && memcmp(d.dptr, &j, d.dsize) == 0);
68 /* Now add a *lot* more. */
69 for (j = (1 << TDB_HASH_GROUP_BITS) + 1;
70 j < (16 << TDB_HASH_GROUP_BITS);
72 ok1(tdb_store(tdb, key, dbuf, TDB_INSERT) == 0);
73 ok1(tdb_fetch(tdb, key, &d) == TDB_SUCCESS);
74 ok1(d.dsize == sizeof(j));
76 ok1(d.dptr && memcmp(d.dptr, &j, d.dsize) == 0);
79 ok1(tdb_check(tdb, NULL, NULL) == 0);
81 /* Traverse through them. */
82 ok1(tdb_traverse(tdb, trav, NULL) == j);
84 /* Empty the first chain-worth. */
85 for (j = 0; j < (1 << TDB_HASH_GROUP_BITS); j++)
86 ok1(tdb_delete(tdb, key) == 0);
88 ok1(tdb_check(tdb, NULL, NULL) == 0);
90 for (j = (1 << TDB_HASH_GROUP_BITS);
91 j < (16 << TDB_HASH_GROUP_BITS);
93 ok1(tdb_fetch(tdb, key, &d) == TDB_SUCCESS);
94 ok1(d.dsize == sizeof(j));
96 ok1(d.dptr && memcmp(d.dptr, &j, d.dsize) == 0);
100 /* Traverse through them. */
101 ok1(tdb_traverse(tdb, trav, NULL)
102 == (15 << TDB_HASH_GROUP_BITS));
105 for (j = 0; j < (1 << TDB_HASH_GROUP_BITS); j++) {
106 ok1(tdb_store(tdb, key, dbuf, TDB_INSERT) == 0);
108 ok1(tdb_check(tdb, NULL, NULL) == 0);
110 /* Now try deleting as we go. */
111 ok1(tdb_traverse(tdb, trav, trav)
112 == (16 << TDB_HASH_GROUP_BITS));
113 ok1(tdb_check(tdb, NULL, NULL) == 0);
114 ok1(tdb_traverse(tdb, trav, NULL) == 0);
118 ok1(tap_log_messages == 0);
119 return exit_status();