/* Final validation after constant folding.
   Copyright (C) 2025 Free Software Foundation, Inc.

GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.

GCC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3.  If not see
<http://www.gnu.org/licenses/>.  */

#include "elna/boot/validation.h"

#include <unordered_map>

namespace elna::boot
{
    validation_error::validation_error(const source_position position, source_position first)
        : diagnostic(position), first(first)
    {
    }

    std::string validation_error::what() const
    {
        return "Duplicate case label";
    }

    std::optional<std::pair<std::string, source_position>> validation_error::note() const
    {
        return previous_declaration_note(this->first, "Previous label here");
    }

    validation_visitor::validation_visitor(symbol_bag& bag, const target_info& target)
        : bag(bag), constant_evaluator(this->bag, target)
    {
    }

    void validation_visitor::visit(assign_statement *)
    {
    }

    void validation_visitor::visit(if_statement *)
    {
    }

    void validation_visitor::visit(while_statement *)
    {
    }

    void validation_visitor::visit(repeat_statement *)
    {
    }

    void validation_visitor::visit(for_statement *)
    {
    }

    void validation_visitor::visit(defer_statement *)
    {
    }

    void validation_visitor::visit(empty_statement *)
    {
    }

    void validation_visitor::visit(procedure_call *)
    {
    }

    void validation_visitor::visit(unit *unit)
    {
        for (procedure_declaration *procedure : unit->procedures)
        {
            procedure->accept(this);
        }
        for (auto *entry_statement : unit->entry_point)
        {
            entry_statement->accept(this);
        }
    }

    void validation_visitor::visit(procedure_declaration *declaration)
    {
        if (declaration->body.has_value())
        {
            auto procedure = this->bag.lookup(declaration->identifier.name())->is_procedure();
            this->bag.enter(procedure->scope);
            for (auto *statement : declaration->body.value().entry_point)
            {
                statement->accept(this);
            }
            this->bag.leave();
        }
    }

    void validation_visitor::visit(case_statement *statement)
    {
        for (const switch_case& case_block : statement->cases)
        {
            for (auto *block_statement : case_block.statements)
            {
                block_statement->accept(this);
            }
        }
        if (statement->alternative != nullptr)
        {
            for (auto *block_statement : *statement->alternative)
            {
                block_statement->accept(this);
            }
        }

        std::unordered_map<constant_value, source_position, constant_value_hash> seen;
        for (const auto& case_block : statement->cases)
        {
            for (auto *label : case_block.labels)
            {
                auto value = this->constant_evaluator.evaluate(*label);
                if (!value.has_value())
                {
                    add_error<non_constant_expression_error>(label->position(),
                            non_constant_expression_error::case_label{});
                    continue;
                }
                auto [case_position, inserted] = seen.try_emplace(value.value(), label->position());
                if (!inserted)
                {
                    add_error<validation_error>(label->position(), case_position->second);
                }
            }
        }
    }
}