#include "node.h"

#include <ivy/lang/ast.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>

extern struct ast_node_type unit_node_ops;
extern struct ast_node_type unit_package_node_ops;

static const struct ast_node_type *node_ops[] = {
	[IVY_AST_UNIT] = &unit_node_ops,
	[IVY_AST_UNIT_PACKAGE] = &unit_package_node_ops,
};
static const size_t nr_node_ops = sizeof node_ops / sizeof node_ops[0];

const struct ast_node_type *get_ast_node_type(enum ivy_ast_node_type type)
{
	if (type >= nr_node_ops) {
		return NULL;
	}

	return node_ops[type];
}

token_parse_function get_token_parser(
	struct ivy_ast_node *context, struct ivy_token *tok)
{
	const struct ast_node_type *type = get_ast_node_type(context->n_type);
	if (!type) {
		return NULL;
	}
	token_parse_function generic_parser = type->n_token_parsers[tok->t_type];
	token_parse_function better_parser = NULL;

	switch (tok->t_type) {
	case IVY_TOK_KEYWORD:
		better_parser = type->n_keyword_parsers[tok->t_keyword];
		break;
	case IVY_TOK_SYMBOL:
		better_parser = type->n_symbol_parsers[tok->t_symbol];
		break;
	default:
		break;
	}

	return better_parser ? better_parser : generic_parser;
}

struct ivy_ast_node *ast_node_create_with_size(
	enum ivy_ast_node_type type, size_t size)
{
	struct ivy_ast_node *node = malloc(size);
	if (!node) {
		return NULL;
	}

	memset(node, 0x0, size);

	node->n_type = type;

	return node;
}

enum ivy_status ast_node_add_child(
	struct ivy_ast_node *parent, struct ivy_ast_node *child)
{
	const struct ast_node_type *ops = get_ast_node_type(parent->n_type);
	if (!ops) {
		return IVY_ERR_NOT_SUPPORTED;
	}

	enum ivy_status (*add_child)(struct ivy_ast_node *, struct ivy_ast_node *)
		= ops->n_add_child;

	if (!add_child) {
		return IVY_ERR_NOT_SUPPORTED;
	}

	return add_child(parent, child);
}

static enum ivy_status node_print(struct ivy_ast_node *node, struct ivy_ast_node_iterator *it)
{
	for (unsigned int i = 0; i < node->n_it.it_depth; i++) {
		fputs("  ", stdout);
	}

	const struct ast_node_type *type = get_ast_node_type(node->n_type);
	if (type && type->n_print) {
		type->n_print(node);
	} else {
		printf("%s\n", ivy_ast_node_type_to_string(node->n_type));
	}

	return IVY_OK;
}

void ivy_ast_node_print(struct ivy_ast_node *node)
{
	struct ivy_ast_node_iterator it = {0};
	ivy_ast_node_iterate(node, &it, node_print);
}

void ivy_ast_node_destroy(struct ivy_ast_node *node)
{
}

#define ENUM_STR(x)                                                            \
	case x:                                                                \
		return #x

const char *ivy_ast_node_type_to_string(enum ivy_ast_node_type v)
{
	switch (v) {
		ENUM_STR(IVY_AST_NONE);
		ENUM_STR(IVY_AST_UNIT);
		ENUM_STR(IVY_AST_OP);
		ENUM_STR(IVY_AST_MSG);
		ENUM_STR(IVY_AST_CLASS);
		ENUM_STR(IVY_AST_MSGH);
		ENUM_STR(IVY_AST_PROPERTY);
		ENUM_STR(IVY_AST_LAMBDA);
		ENUM_STR(IVY_AST_UNIT_PACKAGE);
		ENUM_STR(IVY_AST_UNIT_IMPORT);
		ENUM_STR(IVY_AST_INT);
		ENUM_STR(IVY_AST_DOUBLE);
		ENUM_STR(IVY_AST_STRING);
		ENUM_STR(IVY_AST_FSTRING);
		ENUM_STR(IVY_AST_ATOM);
		ENUM_STR(IVY_AST_IDENT);
		ENUM_STR(IVY_AST_FOR_LOOP);
		ENUM_STR(IVY_AST_WHILE_LOOP);
		ENUM_STR(IVY_AST_COND_GROUP);
		ENUM_STR(IVY_AST_COND);
		ENUM_STR(IVY_AST_TUPLE);
		ENUM_STR(IVY_AST_DO);
		ENUM_STR(IVY_AST_TYPE_COUNT);
	default:
		return "";
	}
}

const char *ivy_ast_op_to_string(enum ivy_ast_op v)
{
	switch (v) {
		ENUM_STR(IVY_OP_NONE);
		ENUM_STR(IVY_OP_ASSIGN);
		ENUM_STR(IVY_OP_ADD);
		ENUM_STR(IVY_OP_SUBTRACT);
		ENUM_STR(IVY_OP_MULTIPLY);
		ENUM_STR(IVY_OP_DIVIDE);
		ENUM_STR(IVY_OP_LESS_THAN);
		ENUM_STR(IVY_OP_GREATER_THAN);
		ENUM_STR(IVY_OP_EQUAL);
		ENUM_STR(IVY_OP_NOT_EQUAL);
		ENUM_STR(IVY_OP_LESS_EQUAL);
		ENUM_STR(IVY_OP_GREATER_EQUAL);
		ENUM_STR(IVY_OP_AND);
		ENUM_STR(IVY_OP_OR);
		ENUM_STR(IVY_OP_IS);
		ENUM_STR(IVY_OP_NOT);
	default:
		return "";
	}
}

const char *ivy_ast_msgh_recipient_type_to_string(enum ivy_ast_op v)
{
	switch (v) {
		ENUM_STR(IVY_AST_MSGH_NONE);
		ENUM_STR(IVY_AST_MSGH_OBJECT);
		ENUM_STR(IVY_AST_MSGH_CLASS);
	default:
		return "";
	}
}