5 #include "../lib/lfsr.h"
6 #include "../lib/axmap.h"
8 static int test_regular(size_t size, int seed)
16 printf("Using %llu entries...", (unsigned long long) size);
19 lfsr_init(&lfsr, size, seed, seed & 0xF);
20 map = axmap_new(size);
27 if (lfsr_next(&lfsr, &val)) {
28 printf("lfsr: short loop\n");
32 if (axmap_isset(map, val)) {
33 printf("bit already set\n");
38 if (!axmap_isset(map, val)) {
39 printf("bit not set\n");
48 ff = axmap_next_free(map, osize);
49 if (ff != (uint64_t) -1ULL) {
50 printf("axmap_next_free broken: got %llu\n", (unsigned long long) ff);
59 static int test_multi(size_t size, unsigned int bit_off)
61 unsigned int map_size = size;
63 uint64_t val = bit_off;
66 printf("Test multi %llu entries %u offset...", (unsigned long long) size, bit_off);
69 map = axmap_new(map_size);
70 while (val + 128 <= map_size) {
72 for (i = val; i < val + 128; i++) {
73 if (axmap_isset(map, val + i)) {
74 printf("bit already set\n");
83 err = axmap_set_nr(map, val, 128);
85 printf("only set %u bits\n", err);
90 for (i = 0; i < 128; i++) {
91 if (!axmap_isset(map, val + i)) {
92 printf("bit not set: %llu\n", (unsigned long long) val + i);
110 struct overlap_test {
116 static int test_overlap(void)
118 struct overlap_test tests[] = {
219 int entries, i, ret, err = 0;
222 for (i = 0; tests[i].start != -1U; i++) {
223 unsigned int this = tests[i].start + tests[i].nr;
229 printf("Test overlaps...");
232 map = axmap_new(entries);
234 for (i = 0; tests[i].start != -1U; i++) {
235 struct overlap_test *t = &tests[i];
237 ret = axmap_set_nr(map, t->start, t->nr);
240 printf("start=%u, nr=%d, ret=%d: %d\n", t->start, t->nr,
253 int main(int argc, char *argv[])
255 size_t size = (1UL << 23) - 200;
259 size = strtoul(argv[1], NULL, 10);
261 seed = strtoul(argv[2], NULL, 10);
264 if (test_regular(size, seed))
266 if (test_multi(size, 0))
268 if (test_multi(size, 17))