/*
 * Copyright (c) 2025 Quinn Stephens and the OSMORA team.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 * 3. Neither the name of the copyright holder nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS”
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include <stdbool.h>
#include <stddef.h>
#include <string.h>
#include "hash.h"
#include "lexer/keywords.h"
#include "log.h"

#define KEYWORD_COUNT 2

#define KEYWORD_MAP_ROWS 16

static struct list map_rows[KEYWORD_MAP_ROWS];
static struct hashmap map;

static struct {
    const char *str;
    enum token_kind tok_kind;
    uint8_t tok_flags;
} info[KEYWORD_COUNT] = {
    { "void", TK_VOID, TF_BUILTIN_TYPE },
    { "int" , TK_INT , TF_BUILTIN_TYPE }
};

static void
add_keyword(const char *str, enum token_kind tok_kind, uint8_t tok_flags)
{
    struct keyword *kwd;

    kwd = malloc(sizeof(struct keyword));
    if (kwd == NULL) {
        log_error("Failed to allocate memory for keyword \"%s\"\n", str);
        return;
    }

    kwd->len = strlen(str);
    kwd->tok_kind = tok_kind;
    kwd->tok_flags = tok_flags;

    kwd->hashmap_entry.hash = hash(str, kwd->len);
    hashmap_add(map, &kwd->hashmap_entry);
}

struct keyword *
keywords_find(struct token *tok)
{
    struct keyword *kwd;

    kwd = (struct keyword *)hashmap_find(map, tok->hash);

    /* Check that the lengths match just in case */
    if (kwd != NULL && kwd->len == tok->len) {
        return kwd;
    }

    return NULL;
}

void
keywords_init(void)
{
    log_debug("Initializing keywords...\n");

    /* Intiailize hashmap */
    map.rows = map_rows;
    map.row_count = KEYWORD_MAP_ROWS;
    hashmap_init(map);

    /* Register all keywords */
    for (int k = 0; k < KEYWORD_COUNT; k++) {
        add_keyword(info[k].str, info[k].tok_kind, info[k].tok_flags);
    }
}