1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/*
* 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, bool is_executable)
{
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)
{
if( ty.second )
{
codegen->emit_type_proto(ty.first);
}
else
{
TU_IFLET( ::HIR::TypeRef::Data, ty.first.m_data, Path, te,
TU_MATCHA( (te.binding), (tpb),
(Unbound, throw ""; ),
(Opaque, throw ""; ),
(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.first);
}
}
for(const auto& ty : list.m_typeids)
{
codegen->emit_type_id(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 proto " << ent.first);
assert(ent.second->ptr);
const auto& stat = *ent.second->ptr;
if( ! stat.m_value_res.is_Invalid() )
{
codegen->emit_static_proto(ent.first, stat, ent.second->pp);
}
else
{
codegen->emit_static_ext(ent.first, stat, ent.second->pp);
}
}
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_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 )
{
const auto& path = ent.first;
const auto& fcn = *ent.second->ptr;
const auto& pp = ent.second->pp;
TRACE_FUNCTION_F(path);
DEBUG("FUNCTION CODE " << path);
// 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( pp.has_types() || is_method )
{
::StaticTraitResolve resolve { crate };
auto ret_type = pp.monomorph(resolve, fcn.m_return);
::HIR::Function::args_t args;
for(const auto& a : fcn.m_args)
args.push_back(::std::make_pair( ::HIR::Pattern{}, pp.monomorph(resolve, a.second) ));
auto mir = Trans_Monomorphise(resolve, 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_Optimise(resolve, ::HIR::ItemPath(""), *mir, args, ret_type);
MIR_Validate(resolve, ::HIR::ItemPath(""), *mir, args, ret_type);
codegen->emit_function_code(path, fcn, ent.second->pp, mir);
}
else {
codegen->emit_function_code(path, fcn, pp, fcn.m_code.m_mir);
}
}
}
codegen->finalise(is_executable);
}
|
