token.c

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "tl2/list.h"
#include "token.h"

extern char *ret_val;

void tl_add_token(list *prog, char *tok, int index) {
	token *tk = NULL;
	list *last = NULL;

	// create token
	tk = (token*)malloc(sizeof(token));
	tk->val = malloc(strlen(tok) + 1);
	tk->ret = NULL;
	tk->index = index;
	tk->eval_me = 1;

	strcpy(tk->val, tok);

	// add to list
	list_add_node(prog);

	last = list_get_last(prog);
	list_set_data(last, tk);
}

void tl_free_token(list *prog) {
	token *tk = NULL;

	tk = (token*)prog->data;
	if (!tk)
		return;

	if (tk->val)
		free(tk->val);
	if (tk->ret)
		free(tk->ret);
	free(tk);
}

void tl_show(list *prog) {
	token *tk = NULL;

	tk = (token*)prog->data;
	if (tk)
		printf("[%d] %s | %s (%d)\n", tk->index, tk->val, tk->ret, tk->eval_me);
}

void tl_crawl_list(list *prog, void (*func)(list*)) {
	list *node = NULL, *next = NULL;

	node = prog;
	while (node) {
		next = node->next;

		(*func)(node);

		node = next;
	}
}

void tl_free_list(list *prog) {
	list *node = NULL, *next = NULL;

	node = prog;
	while (node) {
		next = node->next;

		if (node->next)
			node->next = NULL;

		if (node->prev)
			free(node);

		node = next;
	}
}

void tl_crawl_list_reverse(list *prog, void (*func)(list*)) {
	list *last = NULL, *node = NULL, *prev = NULL;

	last = list_get_last(prog);

	node = last;
	while (node) {
		prev = node->prev;

		if (node->data)
			(*func)(node);

		node = prev;
	}
}

list *__tl_get_next(list *prog, int level) {
	list *node = NULL;
	token *tk = NULL;

	node = prog;
	while (node) {
		tk = (token*)node->data;
		if (!tk) {
			node = node->next;

			continue;
		}

		if (tk->index == level)
			return node;
		else if (tk->index < level)
			break;

		node = node->next;
	}

	return NULL;
}

int __tl_is_sub_tree(list *prog) {
	token *tk, *next_tk;
	
	tk = (token*)prog->data;

	if (prog->next)
		next_tk = (token*)prog->next->data;
	else
		next_tk = NULL;

	if (!tk || !next_tk)
		return 0;
	if (tk->index == (next_tk->index - 1))
		return 1;
	return 0;
}

void tl_crawl_list_level(list *prog, int level, void (*func)(list*)) {
	list *node = NULL, *next = NULL;
	token *tk = NULL;

	node = prog;
	while (node) {
		tk = (token*)node->data;
		if (!tk) {
			node = node->next;

			continue;
		}

		if (ret_val)
			return ;

		if (tk->index == level) {
			if (__tl_is_sub_tree(node)) {
				tl_crawl_list_level(node->next, level + 1, func);
				next = __tl_get_next(node->next, level);
			}
			else
				next = node->next;

			(*func)(node);

			node = next;
			continue;
		}
		else
			return ;
	}
}