/*
 * test-action.c -- test actions
 *
 * Copyright (c) 2020 David Demelier <markand@malikania.fr>
 *
 * Permission to use, copy, modify, and/or distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#define GREATEST_USE_ABBREVS 0
#include <greatest.h>

#include <core/drawable.h>
#include <core/event.h>

struct invokes {
	bool update;
	bool draw;
	bool end;
	bool finish;
};

#define INIT(dat, up) {         \
        .data = (dat),          \
        .update = (up),         \
        .draw = my_draw,        \
        .end = my_end,          \
        .finish = my_finish     \
}

static bool
my_update_false(struct drawable *dw, unsigned int ticks)
{
	(void)ticks;

	((struct invokes *)dw->data)->update = true;

	return false;
}

static bool
my_update_true(struct drawable *dw, unsigned int ticks)
{
	(void)ticks;

	((struct invokes *)dw->data)->update = true;

	return true;
}

static void
my_draw(struct drawable *dw)
{
	((struct invokes *)dw->data)->draw = true;
}

static void
my_end(struct drawable *dw)
{
	((struct invokes *)dw->data)->end = true;
}

static void
my_finish(struct drawable *dw)
{
	((struct invokes *)dw->data)->finish = true;
}

GREATEST_TEST
basics_update(void)
{
	struct {
		struct invokes inv;
		struct drawable dw;
	} table[] = {
		{ .dw = INIT(&table[0], my_update_true)        },
		{ .dw = INIT(&table[1], my_update_false)       }
	};

	/* True version. */
	GREATEST_ASSERT(drawable_update(&table[0].dw, 0));
	GREATEST_ASSERT(table[0].inv.update);
	GREATEST_ASSERT(!table[0].inv.draw);
	GREATEST_ASSERT(!table[0].inv.end);
	GREATEST_ASSERT(!table[0].inv.finish);

	/* False version. */
	GREATEST_ASSERT(!drawable_update(&table[1].dw, 0));
	GREATEST_ASSERT(table[1].inv.update);
	GREATEST_ASSERT(!table[1].inv.draw);
	GREATEST_ASSERT(!table[1].inv.end);
	GREATEST_ASSERT(!table[1].inv.finish);
	
	GREATEST_PASS();
}

GREATEST_TEST
basics_draw(void)
{
	struct invokes inv = {0};
	struct drawable dw = INIT(&inv, my_update_true);

	drawable_draw(&dw);

	GREATEST_ASSERT(!inv.update);
	GREATEST_ASSERT(inv.draw);
	GREATEST_ASSERT(!inv.end);
	GREATEST_ASSERT(!inv.finish);
	GREATEST_PASS();
}

GREATEST_TEST
basics_end(void)
{
	struct invokes inv = {0};
	struct drawable dw = INIT(&inv, my_update_true);

	drawable_end(&dw);

	GREATEST_ASSERT(!inv.update);
	GREATEST_ASSERT(!inv.draw);
	GREATEST_ASSERT(inv.end);
	GREATEST_ASSERT(!inv.finish);
	GREATEST_PASS();
}

GREATEST_TEST
basics_finish(void)
{
	struct invokes inv = {0};
	struct drawable dw = INIT(&inv, my_update_true);

	drawable_finish(&dw);

	GREATEST_ASSERT(!inv.update);
	GREATEST_ASSERT(!inv.draw);
	GREATEST_ASSERT(!inv.end);
	GREATEST_ASSERT(inv.finish);
	GREATEST_PASS();
}

GREATEST_SUITE(suite_basics)
{
	GREATEST_RUN_TEST(basics_update);
	GREATEST_RUN_TEST(basics_draw);
	GREATEST_RUN_TEST(basics_end);
	GREATEST_RUN_TEST(basics_finish);
}

GREATEST_TEST
stack_add(void)
{
	struct drawable_stack st = {0};
	struct drawable dw = {0};

	GREATEST_ASSERT(drawable_stack_add(&st, &dw));

	/* Now fill up. */
	for (int i = 0; i < DRAWABLE_STACK_MAX - 1; ++i)
		GREATEST_ASSERT(drawable_stack_add(&st, &dw));

	/* This one should not fit in. */
	GREATEST_ASSERT(!drawable_stack_add(&st, &dw));

	GREATEST_PASS();
}

GREATEST_TEST
stack_update(void)
{
	struct {
		struct invokes inv;
		struct drawable dw;
	} table[] = {
		{ .dw = INIT(&table[0], my_update_false)       },
		{ .dw = INIT(&table[1], my_update_true)        },
		{ .dw = INIT(&table[2], my_update_false)       },
		{ .dw = INIT(&table[3], my_update_false)       },
		{ .dw = INIT(&table[4], my_update_true)        },
		{ .dw = INIT(&table[5], my_update_true)        },
		{ .dw = INIT(&table[6], my_update_false)	},
	};

	struct drawable_stack st = {0};

	drawable_stack_add(&st, &table[0].dw);
	drawable_stack_add(&st, &table[1].dw);
	drawable_stack_add(&st, &table[2].dw);
	drawable_stack_add(&st, &table[3].dw);
	drawable_stack_add(&st, &table[4].dw);
	drawable_stack_add(&st, &table[5].dw);
	drawable_stack_add(&st, &table[6].dw);

	GREATEST_ASSERT(!drawable_stack_update(&st, 0));

	GREATEST_ASSERT(table[0].inv.update);
	GREATEST_ASSERT(table[1].inv.update);
	GREATEST_ASSERT(table[2].inv.update);
	GREATEST_ASSERT(table[3].inv.update);
	GREATEST_ASSERT(table[4].inv.update);
	GREATEST_ASSERT(table[5].inv.update);
	GREATEST_ASSERT(table[6].inv.update);

	GREATEST_ASSERT(!table[0].inv.draw);
	GREATEST_ASSERT(!table[1].inv.draw);
	GREATEST_ASSERT(!table[2].inv.draw);
	GREATEST_ASSERT(!table[3].inv.draw);
	GREATEST_ASSERT(!table[4].inv.draw);
	GREATEST_ASSERT(!table[5].inv.draw);
	GREATEST_ASSERT(!table[6].inv.draw);

	GREATEST_ASSERT(!table[0].inv.end);
	GREATEST_ASSERT(table[1].inv.end);
	GREATEST_ASSERT(!table[2].inv.end);
	GREATEST_ASSERT(!table[3].inv.end);
	GREATEST_ASSERT(table[4].inv.end);
	GREATEST_ASSERT(table[5].inv.end);
	GREATEST_ASSERT(!table[6].inv.end);

	GREATEST_ASSERT(!table[0].inv.finish);
	GREATEST_ASSERT(table[1].inv.finish);
	GREATEST_ASSERT(!table[2].inv.finish);
	GREATEST_ASSERT(!table[3].inv.finish);
	GREATEST_ASSERT(table[4].inv.finish);
	GREATEST_ASSERT(table[5].inv.finish);
	GREATEST_ASSERT(!table[6].inv.finish);

	/* The following must still be there. */
	GREATEST_ASSERT_EQ(st.objects[0], &table[0].dw);
	GREATEST_ASSERT_EQ(st.objects[2], &table[2].dw);
	GREATEST_ASSERT_EQ(st.objects[3], &table[3].dw);
	GREATEST_ASSERT_EQ(st.objects[6], &table[6].dw);

	/* The following must have been NULL-ed. */
	GREATEST_ASSERT_EQ(st.objects[1], NULL);
	GREATEST_ASSERT_EQ(st.objects[4], NULL);
	GREATEST_ASSERT_EQ(st.objects[5], NULL);
	
	/*
	 * Now make all actions to return true and check if it cleans the stack.
	 */
	table[0].dw.update =
	    table[2].dw.update =
	    table[3].dw.update =
	    table[6].dw.update = my_update_true;

	GREATEST_ASSERT(drawable_stack_update(&st, 0));
	GREATEST_ASSERT_EQ(st.objects[0], NULL);
	GREATEST_ASSERT_EQ(st.objects[1], NULL);
	GREATEST_ASSERT_EQ(st.objects[2], NULL);
	GREATEST_ASSERT_EQ(st.objects[3], NULL);
	GREATEST_ASSERT_EQ(st.objects[4], NULL);
	GREATEST_ASSERT_EQ(st.objects[5], NULL);
	GREATEST_ASSERT_EQ(st.objects[6], NULL);

	GREATEST_PASS();
}

GREATEST_TEST
stack_finish(void)
{
	struct {
		struct invokes inv;
		struct drawable dw;
	} table[] = {
		{ .dw = INIT(&table[0], my_update_true)        },
		{ .dw = INIT(&table[0], my_update_false)       },
	};
	struct drawable_stack st = {0};

	drawable_stack_add(&st, &table[0].dw);
	drawable_stack_add(&st, &table[1].dw);
	drawable_stack_finish(&st);

	GREATEST_ASSERT(!table[0].inv.update);
	GREATEST_ASSERT(!table[0].inv.draw);
	GREATEST_ASSERT(table[0].inv.end);
	GREATEST_ASSERT(table[0].inv.finish);

	GREATEST_ASSERT(!table[0].inv.update);
	GREATEST_ASSERT(!table[0].inv.draw);
	GREATEST_ASSERT(table[0].inv.end);
	GREATEST_ASSERT(table[0].inv.finish);

	/* They should also be NULL'ed. */
	GREATEST_ASSERT_EQ(st.objects[0], NULL);
	GREATEST_ASSERT_EQ(st.objects[1], NULL);

	GREATEST_PASS();
}

GREATEST_SUITE(suite_stack)
{
	GREATEST_RUN_TEST(stack_add);
	GREATEST_RUN_TEST(stack_update);
	GREATEST_RUN_TEST(stack_finish);
}

GREATEST_MAIN_DEFS();

int
main(int argc, char **argv)
{
	GREATEST_MAIN_BEGIN();
	GREATEST_RUN_SUITE(suite_basics);
	GREATEST_RUN_SUITE(suite_stack);
	GREATEST_MAIN_END();

	return 0;
}