X-Git-Url: https://git.kernel.dk/?p=fio.git;a=blobdiff_plain;f=t%2Faxmap.c;h=7a0f308064089141589792b342a8dba4ecab48e7;hp=61e3220729d38da5a4246ab9e611082f5ecbae66;hb=2baa609db2c00b98081f51dec5fa5b0d199a23ca;hpb=5ffbb6258baaadff19496403c89d0bf7ccf0bf79

diff --git a/t/axmap.c b/t/axmap.c
index 61e32207..7a0f3080 100644
--- a/t/axmap.c
+++ b/t/axmap.c
@@ -1,66 +1,244 @@
 #include <stdio.h>
 #include <stdlib.h>
-#include <fcntl.h>
-#include <string.h>
-#include <unistd.h>
 #include <inttypes.h>
 
 #include "../lib/lfsr.h"
 #include "../lib/axmap.h"
 
-void *smalloc(size_t size)
-{
-	return malloc(size);
-}
-
-void sfree(void *ptr)
-{
-	free(ptr);
-}
-
-int main(int argc, char *argv[])
+static int test_regular(size_t size, int seed)
 {
 	struct fio_lfsr lfsr;
-	size_t osize, size = (1UL << 28) - 200;
 	struct axmap *map;
+	size_t osize;
 	uint64_t ff;
-	int seed = 1;
+	int err;
 
-	if (argc > 1) {
-		size = strtoul(argv[1], NULL, 10);
-		if (argc > 2)
-			seed = strtoul(argv[2], NULL, 10);
-	}
+	printf("Using %llu entries...", (unsigned long long) size);
+	fflush(stdout);
 
-	printf("Using %llu entries\n", (unsigned long long) size);
-
-	lfsr_init(&lfsr, size, seed);
+	lfsr_init(&lfsr, size, seed, seed & 0xF);
 	map = axmap_new(size);
 	osize = size;
+	err = 0;
 
 	while (size--) {
 		uint64_t val;
 
-		if (lfsr_next(&lfsr, &val, osize)) {
+		if (lfsr_next(&lfsr, &val)) {
 			printf("lfsr: short loop\n");
+			err = 1;
 			break;
 		}
 		if (axmap_isset(map, val)) {
 			printf("bit already set\n");
+			err = 1;
 			break;
 		}
 		axmap_set(map, val);
 		if (!axmap_isset(map, val)) {
 			printf("bit not set\n");
+			err = 1;
 			break;
 		}
 	}
 
+	if (err)
+		return err;
+
 	ff = axmap_next_free(map, osize);
 	if (ff != (uint64_t) -1ULL) {
 		printf("axmap_next_free broken: got %llu\n", (unsigned long long) ff);
 		return 1;
 	}
 
+	printf("pass!\n");
+	axmap_free(map);
+	return 0;
+}
+
+static int test_multi(size_t size, unsigned int bit_off)
+{
+	unsigned int map_size = size;
+	struct axmap *map;
+	uint64_t val = bit_off;
+	int i, err;
+
+	printf("Test multi %llu entries %u offset...", (unsigned long long) size, bit_off);
+	fflush(stdout);
+
+	map = axmap_new(map_size);
+	while (val + 128 <= map_size) {
+		err = 0;
+		for (i = val; i < val + 128; i++) {
+			if (axmap_isset(map, val + i)) {
+				printf("bit already set\n");
+				err = 1;
+				break;
+			}
+		}
+
+		if (err)
+			break;
+
+		err = axmap_set_nr(map, val, 128);
+		if (err != 128) {
+			printf("only set %u bits\n", err);
+			break;
+		}
+
+		err = 0;
+		for (i = 0; i < 128; i++) {
+			if (!axmap_isset(map, val + i)) {
+				printf("bit not set: %llu\n", (unsigned long long) val + i);
+				err = 1;
+				break;
+			}
+		}
+
+		val += 128;
+		if (err)
+			break;
+	}
+
+	if (!err)
+		printf("pass!\n");
+
+	axmap_free(map);
+	return err;
+}
+
+struct overlap_test {
+	unsigned int start;
+	unsigned int nr;
+	unsigned int ret;
+};
+
+static int test_overlap(void)
+{
+	struct overlap_test tests[] = {
+		{
+			.start	= 16,
+			.nr	= 16,
+			.ret	= 16,
+		},
+		{
+			.start	= 0,
+			.nr	= 32,
+			.ret	= 16,
+		},
+		{
+			.start	= 48,
+			.nr	= 32,
+			.ret	= 32,
+		},
+		{
+			.start	= 32,
+			.nr	= 32,
+			.ret	= 16,
+		},
+		{
+			.start	= 79,
+			.nr	= 1,
+			.ret	= 0,
+		},
+		{
+			.start	= 80,
+			.nr	= 21,
+			.ret	= 21,
+		},
+		{
+			.start	= 102,
+			.nr	= 1,
+			.ret	= 1,
+		},
+		{
+			.start	= 101,
+			.nr	= 3,
+			.ret	= 1,
+		},
+		{
+			.start	= 106,
+			.nr	= 4,
+			.ret	= 4,
+		},
+		{
+			.start	= 105,
+			.nr	= 3,
+			.ret	= 1,
+		},
+		{
+			.start	= 120,
+			.nr	= 4,
+			.ret	= 4,
+		},
+		{
+			.start	= 118,
+			.nr	= 2,
+			.ret	= 2,
+		},
+		{
+			.start	= 118,
+			.nr	= 2,
+			.ret	= 0,
+		},
+		{
+			.start	= -1U,
+		},
+	};
+	struct axmap *map;
+	int entries, i, ret, err = 0;
+
+	entries = 0;
+	for (i = 0; tests[i].start != 1U; i++) {
+		unsigned int this = tests[i].start + tests[i].nr;
+
+		if (this > entries)
+			entries = this;
+	}
+
+	printf("Test overlaps...");
+	fflush(stdout);
+
+	map = axmap_new(entries);
+
+	for (i = 0; tests[i].start != -1U; i++) {
+		struct overlap_test *t = &tests[i];
+
+		ret = axmap_set_nr(map, t->start, t->nr);
+		if (ret != t->ret) {
+			printf("fail\n");
+			printf("start=%u, nr=%d, ret=%d: %d\n", t->start, t->nr,
+								t->ret, ret);
+			err = 1;
+			break;
+		}
+	}
+
+	if (!err)
+		printf("pass!\n");
+	axmap_free(map);
+	return err;
+}
+
+int main(int argc, char *argv[])
+{
+	size_t size = (1UL << 23) - 200;
+	int seed = 1;
+
+	if (argc > 1) {
+		size = strtoul(argv[1], NULL, 10);
+		if (argc > 2)
+			seed = strtoul(argv[2], NULL, 10);
+	}
+
+	if (test_regular(size, seed))
+		return 1;
+	if (test_multi(size, 0))
+		return 2;
+	if (test_multi(size, 17))
+		return 3;
+	if (test_overlap())
+		return 4;
+
 	return 0;
 }