#include <stdio.h>
#include <stddef.h>
#include <stdlib.h>
#include <inttypes.h>
#include <time.h>
#include <assert.h>
#include <sys/mman.h>
#include <socks/types.h>
#include <socks/queue.h>
#include <socks/memblock.h>
#include <socks/vm.h>

#define NR_QUEUE_ITEMS 32

struct q_item {
	queue_entry_t base;
	unsigned int key;
};

static struct q_item *find(queue_t *q, unsigned int key)
{
	queue_foreach (struct q_item, item, q, base) {
		if (item->key == key) {
			return item;
		}
	}

	return NULL;
}

int queue_test(void)
{
	queue_t q = {};
	struct q_item *items = calloc(NR_QUEUE_ITEMS, sizeof *items);

	for (int i = 0; i < NR_QUEUE_ITEMS; i++) {
		items[i].key = i;
		printf(" - item %d: %u\n", i, items[i].key);
	}

	for (int i = 0; i < NR_QUEUE_ITEMS; i++) {
		printf("#######################\n");
		printf("inserting items #%d: %u\n", i, items[i].key);

		queue_push_back(&q, &items[i].base);
		printf("#######################\n");

		for (int ii = 0; ii < NR_QUEUE_ITEMS; ii++) {
			struct q_item *n = find(&q, items[ii].key);

			if (ii <= i) {
				assert(n && n->key == items[ii].key);
			} else {
				assert(!n);
			}
		}
	}

	printf("in-order traversal:\n");
	queue_foreach (struct q_item, item, &q, base) {
		printf(" - %u\n", item->key);
	}

	printf("reverse-order traversal:\n");
	queue_foreach_r (struct q_item, item, &q, base) {
		printf(" - %u\n", item->key);
	}

	for (int i = 0; i < NR_QUEUE_ITEMS; i++) {
		printf("#######################\n");
		printf("deleting node #%d: %u\n", i, items[i].key);
		printf("#######################\n");

		queue_delete(&q, &items[i].base);

		for (int ii = 0; ii < NR_QUEUE_ITEMS; ii++) {
			struct q_item *n = find(&q, items[ii].key);

			if (ii <= i) {
				assert(!n);
			} else {
				assert(n && n->key == items[ii].key);
			}
		}
	}

	free(items);
	return 0;
}