-
Notifications
You must be signed in to change notification settings - Fork 87
Expand file tree
/
Copy pathprogram.cpp
More file actions
262 lines (235 loc) · 7.57 KB
/
program.cpp
File metadata and controls
262 lines (235 loc) · 7.57 KB
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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
#include "program.h"
#include "module_math.h"
#include "module_vec2.h"
#include "module_vec3.h"
#include "module_mat2.h"
#include "module_mat3.h"
using namespace febcode;
Program::Program()
{
// create (empty) AST
ast = std::make_unique<AST>();
// Add "main" function (must be the first function, so it gets index 0)
functions.push_back(FunctionInfo{
"main",
nullptr,
std::vector<Type>{},
0,
0,
false
});
// register built-in binary operators for basic types
binaryOps[BinaryOp::Plus] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Int () },
{ types.Double(), types.Double(), types.Double() },
{ types.Double(), types.Int (), types.Double() },
{ types.Int (), types.Double(), types.Double() },
};
binaryOps[BinaryOp::Minus] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Int () },
{ types.Double(), types.Double(), types.Double() },
{ types.Double(), types.Int (), types.Double() },
{ types.Int (), types.Double(), types.Double() },
};
binaryOps[BinaryOp::Multiply] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Int () },
{ types.Double(), types.Double(), types.Double() },
{ types.Double(), types.Int (), types.Double() },
{ types.Int (), types.Double(), types.Double() },
};
binaryOps[BinaryOp::Divide] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Int () },
{ types.Double(), types.Double(), types.Double() },
{ types.Double(), types.Int (), types.Double() },
{ types.Int (), types.Double(), types.Double() },
};
binaryOps[BinaryOp::Exponent] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Int () },
{ types.Double(), types.Double(), types.Double() },
{ types.Double(), types.Int (), types.Double() },
{ types.Int (), types.Double(), types.Double() },
};
binaryOps[BinaryOp::Greater] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Bool() },
{ types.Double(), types.Double(), types.Bool() },
{ types.Double(), types.Int (), types.Bool() },
{ types.Int (), types.Double(), types.Bool() },
};
binaryOps[BinaryOp::GreaterEqual] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Bool() },
{ types.Double(), types.Double(), types.Bool() },
{ types.Double(), types.Int (), types.Bool() },
{ types.Int (), types.Double(), types.Bool() },
};
binaryOps[BinaryOp::Less] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Bool() },
{ types.Double(), types.Double(), types.Bool() },
{ types.Double(), types.Int (), types.Bool() },
{ types.Int (), types.Double(), types.Bool() },
};
binaryOps[BinaryOp::LessEqual] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Bool() },
{ types.Double(), types.Double(), types.Bool() },
{ types.Double(), types.Int (), types.Bool() },
{ types.Int (), types.Double(), types.Bool() },
};
binaryOps[BinaryOp::EqualEqual] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Bool() },
{ types.Double(), types.Double(), types.Bool() },
{ types.Double(), types.Int (), types.Bool() },
{ types.Int (), types.Double(), types.Bool() },
};
binaryOps[BinaryOp::NotEqual] = {
// LHS RHS Result
{ types.Int (), types.Int (), types.Bool() },
{ types.Double(), types.Double(), types.Bool() },
{ types.Double(), types.Int (), types.Bool() },
{ types.Int (), types.Double(), types.Bool() },
};
binaryOps[BinaryOp::AndAnd] = {
// LHS RHS Result
{ types.Bool(), types.Bool(), types.Bool() },
};
binaryOps[BinaryOp::OrOr] = {
// LHS RHS Result
{ types.Bool(), types.Bool(), types.Bool() },
};
// register modules
MathModule mathModule;
mathModule.Register(*this);
Vec2Module vec2Module;
vec2Module.Register(*this);
Vec3Module vec3Module;
vec3Module.Register(*this);
Mat2Module mat2Module;
mat2Module.Register(*this);
Mat3Module mat3Module;
mat3Module.Register(*this);
}
int Program::addGlobal(const std::string& name, Type type)
{
// make sure the global variable name is unique
auto it = globalIndices.find(name);
if (it != globalIndices.end())
throw std::runtime_error("Global variable '" + name + "' is already defined.");
int slot = (int)globals.size();
globals.push_back({ type, (int)globalStackSize, false, 0 });
globalIndices[name] = slot;
globalStackSize += type->size(); // reserve stack slots for this global variable
return slot;
}
int Program::injectGlobal(const std::string& name, Type type)
{
// make sure the global variable name is unique
auto it = globalIndices.find(name);
if (it != globalIndices.end())
throw std::runtime_error("Global variable '" + name + "' is already defined.");
int slot = (int)globals.size();
globals.push_back({ type, (int)globalStackSize, true, 0 });
globalIndices[name] = slot;
globalStackSize += type->size(); // reserve stack slots for this global variable
return slot;
}
int Program::addInput(const std::string& name, Type type)
{
int slot = injectGlobal(name, type);
inputIndices[name] = inputs.size();
inputs.push_back({ type, name, slot });
return slot;
}
Type Program::RegisterStruct(const std::string& name, const std::vector<std::pair<Type, std::string>>& fields)
{
return types.defineStructType(name, fields);
}
Type Program::RegisterStruct(const std::string& name, const std::vector<std::pair<TypeKind, std::string>>& fields)
{
return types.defineStructType(name, fields);
}
void Program::registerNative(const std::string& name, Type returnType, std::vector<Type> argTypes, NativeFnc fn)
{
// calculate required stack size for arguments
int argSize = 0;
for (const auto& argType : argTypes)
{
argSize += (int)argType->size();
}
size_t slot = functions.size();
functions.push_back(FunctionInfo{
name,
returnType,
argTypes,
slot,
argSize,
true,
fn
});
}
void Program::registerNative(const std::string& name, double (*f)(double))
{
registerNative(
name,
types.Double(),
{ types.Double() },
[f](FuncArgs args) -> Value {
double arg = args.getDouble();
return f(arg);
});
}
Type Program::globalType(const std::string& name) const
{
auto it = globalIndices.find(name);
if (it == globalIndices.end())
throw std::runtime_error("Global variable '" + name + "' is not defined.");
size_t slot = it->second;
return globals[slot].type;
}
int Program::resolveFunction(const std::string& name, std::vector<Type> args)
{
for (int i = 0; i < (int)functions.size(); ++i)
{
if ((functions[i].name == name) && (functions[i].args == args))
{
return i;
}
}
return -1;
}
BinaryOpSignature Program::resolveBinaryOp(BinaryOp op, Type left, Type right)
{
auto it = binaryOps.find(op);
if (it != binaryOps.end())
{
for (const auto& sig : it->second)
{
if ((sig.leftType == left) && (sig.rightType == right))
{
return sig;
}
if (sig.leftType == left)
{
// try implicit conversion of right operand
Type convertedRight = coerce(right, sig.rightType);
if (convertedRight != nullptr)
return sig;
}
if (sig.rightType == right)
{
// try implicit conversion of left operand
Type convertedLeft = coerce(left, sig.leftType);
if (convertedLeft != nullptr)
return sig;
}
}
}
throw std::runtime_error("No matching binary operator found for operator '" + opToString(op) + "' with operand types '" + TypeToString(left) + "' and '" + TypeToString(right) + "'.");
}