main.c 8.1 KB
Newer Older
M
Matthew Wilcox 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <time.h>
#include <assert.h>

#include <linux/slab.h>
#include <linux/radix-tree.h>

#include "test.h"
#include "regression.h"

void __gang_check(unsigned long middle, long down, long up, int chunk, int hop)
{
	long idx;
	RADIX_TREE(tree, GFP_KERNEL);

	middle = 1 << 30;

	for (idx = -down; idx < up; idx++)
		item_insert(&tree, middle + idx);

	item_check_absent(&tree, middle - down - 1);
	for (idx = -down; idx < up; idx++)
		item_check_present(&tree, middle + idx);
	item_check_absent(&tree, middle + up);

	item_gang_check_present(&tree, middle - down,
			up + down, chunk, hop);
	item_full_scan(&tree, middle - down, down + up, chunk);
	item_kill_tree(&tree);
}

void gang_check(void)
{
	__gang_check(1 << 30, 128, 128, 35, 2);
	__gang_check(1 << 31, 128, 128, 32, 32);
	__gang_check(1 << 31, 128, 128, 32, 100);
	__gang_check(1 << 31, 128, 128, 17, 7);
	__gang_check(0xffff0000, 0, 65536, 17, 7);
	__gang_check(0xfffffffe, 1, 1, 17, 7);
}

void __big_gang_check(void)
{
	unsigned long start;
	int wrapped = 0;

	start = 0;
	do {
		unsigned long old_start;

//		printf("0x%08lx\n", start);
		__gang_check(start, rand() % 113 + 1, rand() % 71,
				rand() % 157, rand() % 91 + 1);
		old_start = start;
		start += rand() % 1000000;
		start %= 1ULL << 33;
		if (start < old_start)
			wrapped = 1;
	} while (!wrapped);
}

64
void big_gang_check(bool long_run)
M
Matthew Wilcox 已提交
65 66 67
{
	int i;

68
	for (i = 0; i < (long_run ? 1000 : 3); i++) {
M
Matthew Wilcox 已提交
69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207
		__big_gang_check();
		printf("%d ", i);
		fflush(stdout);
	}
}

void add_and_check(void)
{
	RADIX_TREE(tree, GFP_KERNEL);

	item_insert(&tree, 44);
	item_check_present(&tree, 44);
	item_check_absent(&tree, 43);
	item_kill_tree(&tree);
}

void dynamic_height_check(void)
{
	int i;
	RADIX_TREE(tree, GFP_KERNEL);
	tree_verify_min_height(&tree, 0);

	item_insert(&tree, 42);
	tree_verify_min_height(&tree, 42);

	item_insert(&tree, 1000000);
	tree_verify_min_height(&tree, 1000000);

	assert(item_delete(&tree, 1000000));
	tree_verify_min_height(&tree, 42);

	assert(item_delete(&tree, 42));
	tree_verify_min_height(&tree, 0);

	for (i = 0; i < 1000; i++) {
		item_insert(&tree, i);
		tree_verify_min_height(&tree, i);
	}

	i--;
	for (;;) {
		assert(item_delete(&tree, i));
		if (i == 0) {
			tree_verify_min_height(&tree, 0);
			break;
		}
		i--;
		tree_verify_min_height(&tree, i);
	}

	item_kill_tree(&tree);
}

void check_copied_tags(struct radix_tree_root *tree, unsigned long start, unsigned long end, unsigned long *idx, int count, int fromtag, int totag)
{
	int i;

	for (i = 0; i < count; i++) {
/*		if (i % 1000 == 0)
			putchar('.'); */
		if (idx[i] < start || idx[i] > end) {
			if (item_tag_get(tree, idx[i], totag)) {
				printf("%lu-%lu: %lu, tags %d-%d\n", start, end, idx[i], item_tag_get(tree, idx[i], fromtag), item_tag_get(tree, idx[i], totag));
			}
			assert(!item_tag_get(tree, idx[i], totag));
			continue;
		}
		if (item_tag_get(tree, idx[i], fromtag) ^
			item_tag_get(tree, idx[i], totag)) {
			printf("%lu-%lu: %lu, tags %d-%d\n", start, end, idx[i], item_tag_get(tree, idx[i], fromtag), item_tag_get(tree, idx[i], totag));
		}
		assert(!(item_tag_get(tree, idx[i], fromtag) ^
			 item_tag_get(tree, idx[i], totag)));
	}
}

#define ITEMS 50000

void copy_tag_check(void)
{
	RADIX_TREE(tree, GFP_KERNEL);
	unsigned long idx[ITEMS];
	unsigned long start, end, count = 0, tagged, cur, tmp;
	int i;

//	printf("generating radix tree indices...\n");
	start = rand();
	end = rand();
	if (start > end && (rand() % 10)) {
		cur = start;
		start = end;
		end = cur;
	}
	/* Specifically create items around the start and the end of the range
	 * with high probability to check for off by one errors */
	cur = rand();
	if (cur & 1) {
		item_insert(&tree, start);
		if (cur & 2) {
			if (start <= end)
				count++;
			item_tag_set(&tree, start, 0);
		}
	}
	if (cur & 4) {
		item_insert(&tree, start-1);
		if (cur & 8)
			item_tag_set(&tree, start-1, 0);
	}
	if (cur & 16) {
		item_insert(&tree, end);
		if (cur & 32) {
			if (start <= end)
				count++;
			item_tag_set(&tree, end, 0);
		}
	}
	if (cur & 64) {
		item_insert(&tree, end+1);
		if (cur & 128)
			item_tag_set(&tree, end+1, 0);
	}

	for (i = 0; i < ITEMS; i++) {
		do {
			idx[i] = rand();
		} while (item_lookup(&tree, idx[i]));

		item_insert(&tree, idx[i]);
		if (rand() & 1) {
			item_tag_set(&tree, idx[i], 0);
			if (idx[i] >= start && idx[i] <= end)
				count++;
		}
/*		if (i % 1000 == 0)
			putchar('.'); */
	}

//	printf("\ncopying tags...\n");
208
	tagged = tag_tagged_items(&tree, NULL, start, end, ITEMS, 0, 1);
M
Matthew Wilcox 已提交
209 210 211 212 213 214 215

//	printf("checking copied tags\n");
	assert(tagged == count);
	check_copied_tags(&tree, start, end, idx, ITEMS, 0, 1);

	/* Copy tags in several rounds */
//	printf("\ncopying tags...\n");
216 217 218
	tmp = rand() % (count / 10 + 2);
	tagged = tag_tagged_items(&tree, NULL, start, end, tmp, 0, 2);
	assert(tagged == count);
M
Matthew Wilcox 已提交
219 220 221 222 223 224 225 226 227 228 229

//	printf("%lu %lu %lu\n", tagged, tmp, count);
//	printf("checking copied tags\n");
	check_copied_tags(&tree, start, end, idx, ITEMS, 0, 2);
	verify_tag_consistency(&tree, 0);
	verify_tag_consistency(&tree, 1);
	verify_tag_consistency(&tree, 2);
//	printf("\n");
	item_kill_tree(&tree);
}

230
static void __locate_check(struct radix_tree_root *tree, unsigned long index,
231
			unsigned order)
232 233 234 235
{
	struct item *item;
	unsigned long index2;

236
	item_insert_order(tree, index, order);
237
	item = item_lookup(tree, index);
238
	index2 = find_item(tree, item);
239
	if (index != index2) {
240 241
		printf("index %ld order %d inserted; found %ld\n",
			index, order, index2);
242 243 244 245
		abort();
	}
}

246 247 248 249 250 251 252 253 254 255 256
static void __order_0_locate_check(void)
{
	RADIX_TREE(tree, GFP_KERNEL);
	int i;

	for (i = 0; i < 50; i++)
		__locate_check(&tree, rand() % INT_MAX, 0);

	item_kill_tree(&tree);
}

257 258 259
static void locate_check(void)
{
	RADIX_TREE(tree, GFP_KERNEL);
260
	unsigned order;
261 262
	unsigned long offset, index;

263 264
	__order_0_locate_check();

265 266 267 268 269 270 271
	for (order = 0; order < 20; order++) {
		for (offset = 0; offset < (1 << (order + 3));
		     offset += (1UL << order)) {
			for (index = 0; index < (1UL << (order + 5));
			     index += (1UL << order)) {
				__locate_check(&tree, index + offset, order);
			}
272
			if (find_item(&tree, &tree) != -1)
273
				abort();
274

275 276
			item_kill_tree(&tree);
		}
277 278
	}

279
	if (find_item(&tree, &tree) != -1)
280
		abort();
281
	__locate_check(&tree, -1, 0);
282
	if (find_item(&tree, &tree) != -1)
283 284 285 286
		abort();
	item_kill_tree(&tree);
}

287
static void single_thread_tests(bool long_run)
M
Matthew Wilcox 已提交
288 289 290
{
	int i;

291 292
	printf("starting single_thread_tests: %d allocated, preempt %d\n",
		nr_allocated, preempt_count);
293
	multiorder_checks();
294
	rcu_barrier();
295 296
	printf("after multiorder_check: %d allocated, preempt %d\n",
		nr_allocated, preempt_count);
297
	locate_check();
298
	rcu_barrier();
299 300
	printf("after locate_check: %d allocated, preempt %d\n",
		nr_allocated, preempt_count);
M
Matthew Wilcox 已提交
301
	tag_check();
302
	rcu_barrier();
303 304
	printf("after tag_check: %d allocated, preempt %d\n",
		nr_allocated, preempt_count);
M
Matthew Wilcox 已提交
305
	gang_check();
306
	rcu_barrier();
307 308
	printf("after gang_check: %d allocated, preempt %d\n",
		nr_allocated, preempt_count);
M
Matthew Wilcox 已提交
309
	add_and_check();
310
	rcu_barrier();
311 312
	printf("after add_and_check: %d allocated, preempt %d\n",
		nr_allocated, preempt_count);
M
Matthew Wilcox 已提交
313
	dynamic_height_check();
314
	rcu_barrier();
315 316
	printf("after dynamic_height_check: %d allocated, preempt %d\n",
		nr_allocated, preempt_count);
317
	big_gang_check(long_run);
318
	rcu_barrier();
319 320
	printf("after big_gang_check: %d allocated, preempt %d\n",
		nr_allocated, preempt_count);
321
	for (i = 0; i < (long_run ? 2000 : 3); i++) {
M
Matthew Wilcox 已提交
322 323 324 325
		copy_tag_check();
		printf("%d ", i);
		fflush(stdout);
	}
326
	rcu_barrier();
327 328
	printf("after copy_tag_check: %d allocated, preempt %d\n",
		nr_allocated, preempt_count);
M
Matthew Wilcox 已提交
329 330
}

331
int main(int argc, char **argv)
M
Matthew Wilcox 已提交
332
{
333 334
	bool long_run = false;
	int opt;
335
	unsigned int seed = time(NULL);
336

337
	while ((opt = getopt(argc, argv, "ls:")) != -1) {
338 339
		if (opt == 'l')
			long_run = true;
340 341
		else if (opt == 's')
			seed = strtoul(optarg, NULL, 0);
342 343
	}

344 345 346
	printf("random seed %u\n", seed);
	srand(seed);

M
Matthew Wilcox 已提交
347 348 349 350 351
	rcu_register_thread();
	radix_tree_init();

	regression1_test();
	regression2_test();
352
	regression3_test();
353
	iteration_test();
354
	single_thread_tests(long_run);
M
Matthew Wilcox 已提交
355

356 357 358
	/* Free any remaining preallocated nodes */
	radix_tree_cpu_dead(0);

359 360
	benchmark();

361 362
	rcu_barrier();
	printf("after rcu_barrier: %d allocated, preempt %d\n",
363
		nr_allocated, preempt_count);
M
Matthew Wilcox 已提交
364 365 366 367
	rcu_unregister_thread();

	exit(0);
}