1 #include <ccan/htable/htable_type.h>
2 #include <ccan/htable/htable.c>
3 #include <ccan/tap/tap.h>
8 #define NUM_VALS (1 << NUM_BITS)
11 /* Makes sure we don't try to treat and obj as a key or vice versa */
16 static const unsigned int *objkey(const struct obj *obj)
21 /* We use the number divided by two as the hash (for lots of
22 collisions), plus set all the higher bits so we can detect if they
23 don't get masked out. */
24 static size_t objhash(const unsigned int *key)
27 h |= -1UL << NUM_BITS;
31 static bool cmp(const struct obj *obj, const unsigned int *key)
33 return obj->key == *key;
36 HTABLE_DEFINE_TYPE(struct obj, objkey, objhash, cmp, htable_obj);
38 static void add_vals(struct htable_obj *ht,
39 struct obj val[], unsigned int num)
43 for (i = 0; i < num; i++) {
44 if (htable_obj_get(ht, &i)) {
45 fail("%u already in hash", i);
48 htable_obj_add(ht, &val[i]);
49 if (htable_obj_get(ht, &i) != &val[i]) {
50 fail("%u not added to hash", i);
54 pass("Added %u numbers to hash", i);
57 static void find_vals(const struct htable_obj *ht,
58 const struct obj val[], unsigned int num)
62 for (i = 0; i < num; i++) {
63 if (htable_obj_get(ht, &i) != &val[i]) {
64 fail("%u not found in hash", i);
68 ok1(htable_obj_count(ht) == i);
71 static void del_vals(struct htable_obj *ht,
72 const struct obj val[], unsigned int num)
76 for (i = 0; i < num; i++) {
77 if (!htable_obj_delkey(ht, &val[i].key)) {
78 fail("%u not deleted from hash", i);
82 pass("Deleted %u numbers in hash", i);
85 static void del_vals_bykey(struct htable_obj *ht,
86 const struct obj val[] UNNEEDED, unsigned int num)
90 for (i = 0; i < num; i++) {
91 if (!htable_obj_delkey(ht, &i)) {
92 fail("%u not deleted by key from hash", i);
96 pass("Deleted %u numbers by key from hash", i);
99 static bool check_mask(struct htable *ht, const struct obj val[], unsigned num)
103 for (i = 0; i < num; i++) {
104 if (((uintptr_t)&val[i] & ht->common_mask) != ht->common_bits)
113 struct htable_obj ht, ht2;
114 struct obj val[NUM_VALS], *result;
117 struct htable_obj_iter iter;
120 for (i = 0; i < NUM_VALS; i++)
124 htable_obj_init(&ht);
125 ok1(htable_obj_count(&ht) == 0);
126 ok1(ht_max(&ht.raw) == 0);
127 ok1(ht.raw.bits == 0);
129 /* We cannot find an entry which doesn't exist. */
130 ok1(!htable_obj_get(&ht, &dne));
132 /* Fill it, it should increase in size. */
133 add_vals(&ht, val, NUM_VALS);
134 ok1(ht.raw.bits == NUM_BITS + 1);
135 ok1(ht_max(&ht.raw) < (1 << ht.raw.bits));
137 /* Mask should be set. */
138 ok1(ht.raw.common_mask != 0);
139 ok1(ht.raw.common_mask != -1);
140 ok1(check_mask(&ht.raw, val, NUM_VALS));
143 find_vals(&ht, val, NUM_VALS);
144 ok1(!htable_obj_get(&ht, &dne));
146 /* Walk once, should get them all. */
148 for (p = htable_obj_first(&ht,&iter); p; p = htable_obj_next(&ht, &iter))
152 for (p = htable_obj_prev(&ht,&iter); p; p = htable_obj_prev(&ht, &iter))
157 del_vals(&ht, val, NUM_VALS);
158 ok1(!htable_obj_get(&ht, &val[0].key));
160 /* Worst case, a "pointer" which doesn't have any matching bits. */
161 htable_add(&ht.raw, 0, (void *)~(uintptr_t)&val[NUM_VALS-1]);
162 htable_obj_add(&ht, &val[NUM_VALS-1]);
163 ok1(ht.raw.common_mask == 0);
164 ok1(ht.raw.common_bits == 0);
165 /* Delete the bogus one before we trip over it. */
166 htable_del(&ht.raw, 0, (void *)~(uintptr_t)&val[NUM_VALS-1]);
169 add_vals(&ht, val, NUM_VALS-1);
171 /* Check we can find them all. */
172 find_vals(&ht, val, NUM_VALS);
173 ok1(!htable_obj_get(&ht, &dne));
176 ok1(htable_obj_copy(&ht2, &ht));
178 /* Delete them all by key. */
179 del_vals_bykey(&ht, val, NUM_VALS);
180 del_vals_bykey(&ht2, val, NUM_VALS);
182 /* Write two of the same value. */
184 htable_obj_add(&ht, &val[0]);
185 htable_obj_add(&ht, &val[1]);
188 result = htable_obj_getfirst(&ht, &i, &iter);
189 ok1(result == &val[0] || result == &val[1]);
190 if (result == &val[0]) {
191 ok1(htable_obj_getnext(&ht, &i, &iter) == &val[1]);
192 ok1(htable_obj_getnext(&ht, &i, &iter) == NULL);
194 /* Deleting first should make us iterate over the other. */
195 ok1(htable_obj_del(&ht, &val[0]));
196 ok1(htable_obj_getfirst(&ht, &i, &iter) == &val[1]);
197 ok1(htable_obj_getnext(&ht, &i, &iter) == NULL);
199 ok1(htable_obj_getnext(&ht, &i, &iter) == &val[0]);
200 ok1(htable_obj_getnext(&ht, &i, &iter) == NULL);
202 /* Deleting first should make us iterate over the other. */
203 ok1(htable_obj_del(&ht, &val[1]));
204 ok1(htable_obj_getfirst(&ht, &i, &iter) == &val[0]);
205 ok1(htable_obj_getnext(&ht, &i, &iter) == NULL);
208 htable_obj_clear(&ht);
209 ok1(htable_obj_count(&ht) == 0);
210 htable_obj_clear(&ht2);
211 ok1(htable_obj_count(&ht2) == 0);
212 return exit_status();