#include "keyword.h"

//构建关键字树

static void keyword_alloc(vector_t* keyword_vec, const char *string, HANDLER_CALLBACK handler) {
    keyword_t* keyword = (keyword_t*)MALLOC(sizeof(keyword_t));

    keyword->string = string;
    keyword->handler = handler;
    keyword->sub = NULL;

    vector_alloc_slot(keyword_vec);

    vector_set_slot(keyword_vec, keyword);
}

static void keyword_alloc_sub(keyword_root_t* root, const char *string, HANDLER_CALLBACK handler) {
    keyword_t *keyword;

    keyword = (keyword_t*)vector_slot_last(root->keyword);

    for(int i=0;i<root->curlevel;++i) {
        keyword = (keyword_t*)vector_slot_last(keyword->sub);
    }

    if(!keyword->sub)
        keyword->sub = vector_alloc();

    keyword_alloc(keyword->sub, string, handler);
}

//在root根下添加一个slot
void install_keyword_root(keyword_root_t* root, const char *string, HANDLER_CALLBACK handler) {
	keyword_alloc(root->keyword, string, handler);
}

//在root根下添加一层
void install_keyword(keyword_root_t* root, const char *string, HANDLER_CALLBACK handler) {
	keyword_alloc_sub(root, string, handler);
}

//记录层数++
void install_sublevel(keyword_root_t* root) {
    root->curlevel++;
}

//记录层数--
void install_sublevel_end(keyword_root_t* root) {
    root->curlevel--;
}

void keywords_free(vector_t* keyword_vec) {
    if(!keyword_vec)
        return;

    keyword_t* keyword = NULL;

    for(int i=0; i<vector_size(keyword_vec); ++i) {
        keyword = ((keyword_t*)vector_slot(keyword_vec,i));
        
        keywords_free(keyword->sub);

        FREE(keyword);
    }

    vector_free(keyword_vec);
}

#ifdef KP_PARSER_DEBUG
void keywords_show(vector_t* keyword_vec, int level) {
    if(!keyword_vec)
        return;

    keyword_t* keyword = NULL;
    for(int i=0; i<vector_size(keyword_vec); ++i) {
        
        for(int j=0; j<level; ++j)
            putchar('\t');

        keyword_t* cur = ((keyword_t*)vector_slot(keyword_vec,i));
 
        if(cur)
            puts(cur->string);

        keywords_show(cur->sub, level+1);
    }
}
#endif