1 #include "tdb2-source.h"
2 #include <ccan/tap/tap.h>
5 #define NUM_RECORDS 1000
7 static bool store_records(struct tdb_context *tdb)
10 struct tdb_data key = { (unsigned char *)&i, sizeof(i) };
11 struct tdb_data data = { (unsigned char *)&i, sizeof(i) };
13 for (i = 0; i < NUM_RECORDS; i++)
14 if (tdb_store(tdb, key, data, TDB_REPLACE) != 0)
20 unsigned int records[NUM_RECORDS];
24 static int trav(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, void *p)
26 struct trav_data *td = p;
29 memcpy(&val, dbuf.dptr, dbuf.dsize);
30 td->records[td->calls++] = val;
34 /* Since tdb_nextkey frees dptr, we need to clone it. */
35 static TDB_DATA dup_key(TDB_DATA key)
37 void *p = malloc(key.dsize);
38 memcpy(p, key.dptr, key.dsize);
43 int main(int argc, char *argv[])
49 struct tdb_context *tdb;
50 union tdb_attribute seed_attr;
53 int flags[] = { TDB_INTERNAL, TDB_DEFAULT, TDB_NOMMAP,
54 TDB_INTERNAL|TDB_CONVERT, TDB_CONVERT,
55 TDB_NOMMAP|TDB_CONVERT };
57 seed_attr.base.attr = TDB_ATTRIBUTE_SEED;
58 seed_attr.base.next = &tap_log_attr;
59 seed_attr.seed.seed = 6334326220117065685ULL;
61 plan_tests(sizeof(flags) / sizeof(flags[0])
62 * (NUM_RECORDS*6 + (NUM_RECORDS-1)*3 + 22) + 1);
63 for (i = 0; i < sizeof(flags) / sizeof(flags[0]); i++) {
64 tdb = tdb_open("run-traverse.tdb", flags[i],
65 O_RDWR|O_CREAT|O_TRUNC, 0600, &seed_attr);
70 ok1(tdb_firstkey(tdb, &k) == TDB_ERR_NOEXIST);
73 k.dptr = (unsigned char *)#
74 k.dsize = sizeof(num);
76 ok1(tdb_store(tdb, k, k, TDB_INSERT) == 0);
77 ok1(tdb_firstkey(tdb, &k) == TDB_SUCCESS);
78 ok1(k.dsize == sizeof(num));
79 ok1(memcmp(k.dptr, &num, sizeof(num)) == 0);
80 ok1(tdb_nextkey(tdb, &k) == TDB_ERR_NOEXIST);
83 k.dptr = (unsigned char *)#
84 k.dsize = sizeof(num);
86 ok1(tdb_store(tdb, k, k, TDB_INSERT) == 0);
87 ok1(tdb_firstkey(tdb, &k) == TDB_SUCCESS);
88 ok1(k.dsize == sizeof(num));
89 memcpy(&num, k.dptr, sizeof(num));
90 ok1(num == 0 || num == 1);
91 ok1(tdb_nextkey(tdb, &k) == TDB_SUCCESS);
92 ok1(k.dsize == sizeof(j));
93 memcpy(&j, k.dptr, sizeof(j));
94 ok1(j == 0 || j == 1);
96 ok1(tdb_nextkey(tdb, &k) == TDB_ERR_NOEXIST);
99 k.dptr = (unsigned char *)#
100 k.dsize = sizeof(num);
102 ok1(tdb_delete(tdb, k) == 0);
104 ok1(tdb_delete(tdb, k) == 0);
106 /* Now lots of records. */
107 ok1(store_records(tdb));
110 num = tdb_traverse(tdb, trav, &td);
111 ok1(num == NUM_RECORDS);
112 ok1(td.calls == NUM_RECORDS);
114 /* Simple loop should match tdb_traverse */
115 for (j = 0, ecode = tdb_firstkey(tdb, &k); j < td.calls; j++) {
118 ok1(ecode == TDB_SUCCESS);
119 ok1(k.dsize == sizeof(val));
120 memcpy(&val, k.dptr, k.dsize);
121 ok1(td.records[j] == val);
122 ecode = tdb_nextkey(tdb, &k);
125 /* But arbitrary orderings should work too. */
126 for (j = td.calls-1; j > 0; j--) {
127 k.dptr = (unsigned char *)&td.records[j-1];
128 k.dsize = sizeof(td.records[j-1]);
130 ok1(tdb_nextkey(tdb, &k) == TDB_SUCCESS);
131 ok1(k.dsize == sizeof(td.records[j]));
132 ok1(memcmp(k.dptr, &td.records[j], k.dsize) == 0);
136 /* Even delete should work. */
137 for (j = 0, ecode = tdb_firstkey(tdb, &k);
138 ecode != TDB_ERR_NOEXIST;
140 ok1(ecode == TDB_SUCCESS);
142 ok1(tdb_delete(tdb, k) == 0);
143 ecode = tdb_nextkey(tdb, &k);
146 diag("delete using first/nextkey gave %u of %u records",
148 ok1(j == NUM_RECORDS);
152 ok1(tap_log_messages == 0);
153 return exit_status();