/*
 * MRustC - Rust Compiler
 * - By John Hodge (Mutabah/thePowersGang)
 *
 * trans/codegen.cpp
 * - Wrapper for translation
 */
#include "main_bindings.hpp"
#include "trans_list.hpp"
#include <hir/hir.hpp>
#include <mir/mir.hpp>
#include <mir/operations.hpp>

#include "codegen.hpp"
#include "monomorphise.hpp"

void Trans_Codegen(const ::std::string& outfile, const ::HIR::Crate& crate, const TransList& list)
{
    static Span sp;
    auto codegen = Trans_Codegen_GetGeneratorC(crate, outfile);
    
    // 1. Emit structure/type definitions.
    // - Emit in the order they're needed.
    for(const auto& ty : list.m_types)
    {
        TU_IFLET( ::HIR::TypeRef::Data, ty.m_data, Path, te,
            TU_MATCHA( (te.binding), (tpb),
            (Unbound,   ),
            (Opaque,   ),
            (Struct,
                codegen->emit_struct(sp, te.path.m_data.as_Generic(), *tpb);
                ),
            (Union,
                codegen->emit_union(sp, te.path.m_data.as_Generic(), *tpb);
                ),
            (Enum,
                codegen->emit_enum(sp, te.path.m_data.as_Generic(), *tpb);
                )
            )
        )
        codegen->emit_type(ty);
    }
    
    // 2. Emit function prototypes
    for(const auto& ent : list.m_functions)
    {
        DEBUG("FUNCTION " << ent.first);
        assert( ent.second->ptr );
        if( ent.second->ptr->m_code.m_mir ) {
            codegen->emit_function_proto(ent.first, *ent.second->ptr, ent.second->pp);
        }
        else {
            codegen->emit_function_ext(ent.first, *ent.second->ptr, ent.second->pp);
        }
    }
    // 3. Emit statics
    for(const auto& ent : list.m_statics)
    {
        DEBUG("STATIC " << ent.first);
        assert(ent.second->ptr);
        const auto& stat = *ent.second->ptr;
        
        if( stat.m_value_res.is_Invalid() )
        {
            codegen->emit_static_ext(ent.first, stat, ent.second->pp);
        }
        else
        {
            codegen->emit_static_local(ent.first, stat, ent.second->pp);
        }
    }
    
    for(const auto& ent : list.m_vtables)
    {
        const auto& trait = ent.first.m_data.as_UfcsKnown().trait;
        const auto& type = *ent.first.m_data.as_UfcsKnown().type;
        DEBUG("VTABLE " << trait << " for " << type);
        
        codegen->emit_vtable(ent.first, crate.get_trait_by_path(Span(), trait.m_path));
    }
    
    
    // 4. Emit function code
    for(const auto& ent : list.m_functions)
    {
        if( ent.second->ptr && ent.second->ptr->m_code.m_mir )
        {
            TRACE_FUNCTION_F(ent.first);
            DEBUG("FUNCTION CODE " << ent.first);
            const auto& fcn = *ent.second->ptr;
            // TODO: If this is a provided trait method, it needs to be monomorphised too.
            bool is_method = ( fcn.m_args.size() > 0 && visit_ty_with(fcn.m_args[0].second, [&](const auto& x){return x == ::HIR::TypeRef("Self",0xFFFF);}) );
            if( ent.second->pp.has_types() || is_method )
            {
                ::StaticTraitResolve    resolve { crate };
                auto ret_type = ent.second->pp.monomorph(crate, fcn.m_return);
                ::HIR::Function::args_t args;
                for(const auto& a : fcn.m_args)
                    args.push_back(::std::make_pair( ::HIR::Pattern{}, ent.second->pp.monomorph(crate, a.second) ));
                auto mir = Trans_Monomorphise(crate, ent.second->pp, fcn.m_code.m_mir);
                MIR_Validate(resolve, ::HIR::ItemPath(), *mir, args, ret_type);
                MIR_Cleanup(resolve, ::HIR::ItemPath(), *mir, args, ret_type);
                // TODO: MIR Optimisation
                MIR_Validate(resolve, ::HIR::ItemPath(), *mir, args, ret_type);
                codegen->emit_function_code(ent.first, fcn, ent.second->pp,  mir);
            }
            else {
                codegen->emit_function_code(ent.first, fcn, ent.second->pp,  fcn.m_code.m_mir);
            }
        }
    }
    
    codegen->finalise();
}