-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathByteCode.cpp
More file actions
387 lines (376 loc) · 17.7 KB
/
ByteCode.cpp
File metadata and controls
387 lines (376 loc) · 17.7 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
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
#include "pch.h"
#include "ByteCode.h"
#include "ByteCodeDefines.h"
#include "AST.h"
class LocalVarIDAllocator {
public:
LocalVarIDAllocator(int initLocalIdx):
m_initLocalIdx(initLocalIdx), m_curLocalIdx(initLocalIdx), m_maxLocalIdx(initLocalIdx){
}
int getMaxLocalIdx() { return m_maxLocalIdx; }
int allocID() {
int id = VarID::fromLocal(m_curLocalIdx).getInt();
m_maxLocalIdx = max(++m_curLocalIdx, m_maxLocalIdx);
return id;
}
void freeID(int id) {
ASSERT(VarID(id).getLocal() == m_curLocalIdx - 1);
--m_curLocalIdx;
}
vector<int> allocIDs(int n) {
vector<int> r;
while (--n >= 0) r.push_back(allocID());
return r;
}
void freeIDs(vector<int>& ids) {
for (auto iter = ids.rbegin(); iter != ids.rend(); ++iter) freeID(*iter);
ids.clear();
}
private:
int m_initLocalIdx;
int m_curLocalIdx;
int m_maxLocalIdx;
};
#define EMIT(codeType, ...) {m_ip2line.push_back(node->line); m_codes.push_back(0); ByteCodeHandler<codeType>::emitCode(m_codes.back(), __VA_ARGS__);}
#define PRE_EMIT(off) m_ip2line.push_back(node->line); int off = CUR_CODE_OFF; m_codes.push_back(0);
#define POST_EMIT(off, codeType, ...) { ByteCodeHandler<codeType>::emitCode(m_codes[off], __VA_ARGS__); }
#define CUR_CODE_OFF int(m_codes.size())
#define POST_EMIT_JUMPS(jumpType) {\
for (auto &jump : m_jumps##jumpType) {\
POST_EMIT(jump, BC_Jump, CUR_CODE_OFF);\
}\
m_jumps##jumpType.clear();\
}
class ExprNodeVisitor_CodEmitor:
public IExprNodeVisitor {
public:
ExprNodeVisitor_CodEmitor(const FuncMetaPtr& meta, LocalVarIDAllocator* allocator, const ExprNodePtr &node, int varID = -1)
: m_meta(meta), m_codes(meta->codes), m_ip2line(meta->ip2line), m_varID(varID), m_isAlloced(false), m_allocator(allocator) {
node->acceptVisitor(this);
}
~ExprNodeVisitor_CodEmitor() {
if (m_isAlloced) {
m_allocator->freeID(m_varID);
}
}
int getVarID() {
ASSERT(m_varID != -1);
return m_varID;
}
bool isAllocated() const { return m_isAlloced; }
private:
virtual void visit(ExprNode_Global* node) {
makesureValidVarID();
EMIT(BC_GetGlobal, m_varID, VarID::fromConst(node->constIdx).getInt());
}
virtual void visit(ExprNode_Local* node) {
int localID = VarID::fromLocal(node->localIdx).getInt();
if (m_varID == -1) m_varID = localID;
else EMIT(BC_Move, m_varID, localID);
}
virtual void visit(ExprNode_Const* node) {
int constID = VarID::fromConst(node->constIdx).getInt();
if (m_varID == -1) m_varID = constID;
else EMIT(BC_Move, m_varID, constID);
}
virtual void visit(ExprNode_Lambda* node) {
makesureValidVarID();
EMIT(BC_NewFunction, m_varID, node->metaIdx);
}
virtual void visit(ExprNode_ArrayConstructor* node) {
makesureValidVarID();
vector<int> ids;
for (int i = 0; i < (int)node->exprs.size(); ++i) {
ids.push_back(m_allocator->allocID());
ExprNodeVisitor_CodEmitor(m_meta, m_allocator, node->exprs[i], ids.back());
}
if (ids.empty()) ids.push_back(m_allocator->allocID());
EMIT(BC_NewArray, m_varID, ids.front(), (int)node->exprs.size());
m_allocator->freeIDs(ids);
}
virtual void visit(ExprNode_IndexOf* node) {
makesureValidVarID();
ExprNodeVisitor_CodEmitor arrayExpr(m_meta, m_allocator, node->array);
int kID = ExprNodeVisitor_CodEmitor(m_meta, m_allocator, node->index).getVarID();
EMIT(BC_GetArray, m_varID, arrayExpr.getVarID(), kID);
}
virtual void visit(ExprNode_Call* node) {
makesureValidVarID();
ExprNodeVisitor_CodEmitor funcExpr(m_meta, m_allocator, node->func);
vector<int> ids;
for (int i = 0; i < (int)node->params.size(); ++i) {
ids.push_back(m_allocator->allocID());
ExprNodeVisitor_CodEmitor(m_meta, m_allocator, node->params[i], ids.back());
}
if (ids.empty()) ids.push_back(m_allocator->allocID());
EMIT(BC_Call, funcExpr.getVarID(), ids.front(), (int)node->params.size());
EMIT(BC_Move, m_varID, ids.front());
m_allocator->freeIDs(ids);
}
virtual void visit(ExprNode_UnaryOp* node) {
makesureValidVarID();
int exprID = ExprNodeVisitor_CodEmitor(m_meta, m_allocator, node->expr).getVarID();
switch (node->op) {
case ExprNode_UnaryOp::OT_Not: EMIT(BC_Not, m_varID, exprID); break;
case ExprNode_UnaryOp::OT_Minus: EMIT(BC_Minus, m_varID, exprID); break;
case ExprNode_UnaryOp::OT_Len: EMIT(BC_Len, m_varID, exprID); break;
default: ASSERT(0); break;
}
}
virtual void visit(ExprNode_BinaryOp* node) {
makesureValidVarID();
if (node->op == ExprNode_BinaryOp::OT_And || node->op == ExprNode_BinaryOp::OT_Or) {
/*
m_varID<-lexpr
fjump m_varID l_end // tjump m_varID l_end
m_varID<-rexpr
l_end:
* */
ExprNodeVisitor_CodEmitor(m_meta, m_allocator, node->lexpr, m_varID);
PRE_EMIT(jump_end);
ExprNodeVisitor_CodEmitor(m_meta, m_allocator, node->rexpr, m_varID);
if (node->op == ExprNode_BinaryOp::OT_And) {
POST_EMIT(jump_end, BC_FalseJump, m_varID, CUR_CODE_OFF);
} else {
POST_EMIT(jump_end, BC_TrueJump, m_varID, CUR_CODE_OFF);
}
return;
}
ExprNodeVisitor_CodEmitor lexpr(m_meta, m_allocator, node->lexpr);
int rexprID = ExprNodeVisitor_CodEmitor(m_meta, m_allocator, node->rexpr).getVarID();
switch (node->op) {
case ExprNode_BinaryOp::OT_And: ASSERT(0); break;
case ExprNode_BinaryOp::OT_Or: ASSERT(0); break;
case ExprNode_BinaryOp::OT_Less: EMIT(BC_Less, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_LessEq: EMIT(BC_LessEq, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_Greater: EMIT(BC_Greater, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_GreaterEq: EMIT(BC_GreaterEq, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_Equal: EMIT(BC_Equal, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_NEqual: EMIT(BC_NEqual, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_Add: EMIT(BC_Add, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_Sub: EMIT(BC_Sub, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_Mul: EMIT(BC_Mul, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_Div: EMIT(BC_Div, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_Mod: EMIT(BC_Mod, m_varID, lexpr.getVarID(), rexprID); break;
case ExprNode_BinaryOp::OT_Pow: EMIT(BC_Pow, m_varID, lexpr.getVarID(), rexprID); break;
default: ASSERT(0); break;
}
}
private:
void makesureValidVarID() {
if (m_varID == -1) {
m_isAlloced = true;
m_varID = m_allocator->allocID();
}
}
private:
FuncMetaPtr m_meta;
vector<int> &m_codes, &m_ip2line;
int m_varID;
bool m_isAlloced;
LocalVarIDAllocator *m_allocator;
};
class StmtNodeVisitor_CodeEmitor:
public IStmtNodeVisitor {
public:
StmtNodeVisitor_CodeEmitor(const FuncMetaPtr& meta, const StmtNodePtr& node):
m_meta(meta), m_codes(meta->codes), m_ip2line(meta->ip2line), m_allocator(meta->localCount) {
node->acceptVisitor(this);
{
int retID = VarID::fromLocal(0).getInt();
EMIT(BC_Move, retID, VarID::fromConst(m_meta->getConstIdx(JSValue::NIL)).getInt());
POST_EMIT_JUMPS(Return);
}
meta->tempCount = m_allocator.getMaxLocalIdx();
}
private:
virtual void visit(StmtNode_Assign *node) {
if (auto local = dynamic_cast<ExprNode_Local*>(node->left.get())) {
ExprNodeVisitor_CodEmitor(m_meta, &m_allocator, node->right, VarID::fromLocal(local->localIdx).getInt());
} else if (auto indexOf = dynamic_cast<ExprNode_IndexOf*>(node->left.get())) {
ExprNodeVisitor_CodEmitor arrayExpr(m_meta, &m_allocator, indexOf->array);
ExprNodeVisitor_CodEmitor indexExpr(m_meta, &m_allocator, indexOf->index);
int vID = ExprNodeVisitor_CodEmitor(m_meta, &m_allocator, node->right).getVarID();
EMIT(BC_SetArray, arrayExpr.getVarID(), indexExpr.getVarID(), vID);
} else if (auto global = dynamic_cast<ExprNode_Global*>(node->left.get())) {
int vID = ExprNodeVisitor_CodEmitor(m_meta, &m_allocator, node->right).getVarID();
EMIT(BC_SetGlobal, VarID::fromConst(global->constIdx).getInt(), vID);
} else {
ASSERT(0);
}
}
virtual void visit(StmtNode_Call *node) {
ExprNodeVisitor_CodEmitor(m_meta, &m_allocator, node->callExpr);
}
virtual void visit(StmtNode_Block *node) {
for (auto &stmt : node->stmts) stmt->acceptVisitor(this);
}
virtual void visit(StmtNode_If *node) {
/*
exprID<-expr
tjump exprID l_if
gen elseStmt
jump l_end
l_if:
gen ifStmt
l_end:
* */
int exprID = ExprNodeVisitor_CodEmitor(m_meta, &m_allocator, node->expr).getVarID();
PRE_EMIT(jump_if);
if (node->elseStmt) node->elseStmt->acceptVisitor(this);
PRE_EMIT(jump_end);
POST_EMIT(jump_if, BC_TrueJump, exprID, CUR_CODE_OFF);
if (node->ifStmt) node->ifStmt->acceptVisitor(this);
POST_EMIT(jump_end, BC_Jump, CUR_CODE_OFF);
}
virtual void visit(StmtNode_For *node) {
/*
gen first
l_loop:
expr<-second
fjump expr l_break
gen body
l_continue:
gen last
jump l_loop
l_break:
* */
if (node->first != NULL) node->first->acceptVisitor(this);
int l_loop = CUR_CODE_OFF;
int exprID = ExprNodeVisitor_CodEmitor(m_meta, &m_allocator, node->second).getVarID();
PRE_EMIT(jump_break);
if (node->body != NULL) node->body->acceptVisitor(this);
POST_EMIT_JUMPS(Continue);
if (node->last != NULL) node->last->acceptVisitor(this);
EMIT(BC_Jump, l_loop);
POST_EMIT(jump_break, BC_FalseJump, exprID, CUR_CODE_OFF);
POST_EMIT_JUMPS(Break);
}
virtual void visit(StmtNode_Break *node) {
PRE_EMIT(jump_break);
m_jumpsBreak.push_back(jump_break);
}
virtual void visit(StmtNode_Continue *node) {
PRE_EMIT(jump_continue);
m_jumpsContinue.push_back(jump_continue);
}
virtual void visit(StmtNode_Return *node) {
int retID = VarID::fromLocal(0).getInt();
if (node->expr != NULL) {
ExprNodeVisitor_CodEmitor(m_meta, &m_allocator, node->expr, retID);
} else {
EMIT(BC_Move, retID, VarID::fromConst(m_meta->getConstIdx(JSValue::NIL)).getInt());
}
PRE_EMIT(jump_return);
m_jumpsReturn.push_back(jump_return);
}
private:
FuncMetaPtr m_meta;
vector<int> &m_codes, &m_ip2line;
LocalVarIDAllocator m_allocator;
vector<int> m_jumpsBreak, m_jumpsContinue, m_jumpsReturn;
};
void emitCode(const FuncMetaPtr &meta) {
StmtNodeVisitor_CodeEmitor(meta, meta->stmt);
}
static void _execute(StackFrame *stopFrame) {
auto vm = JSVM::instance();
for (auto frame = vm->topFrame(); frame != stopFrame; frame = vm->topFrame()) {
auto maxIp = (int)frame->func->meta->codes.size();
auto codes = &frame->func->meta->codes[0];
while (frame->ip < maxIp) {
int code = codes[frame->ip];
switch (code & 0xff) {
case BC_NewFunction: ByteCodeHandler<BC_NewFunction>::execute(code, frame); break;
case BC_NewArray: ByteCodeHandler<BC_NewArray>::execute(code, frame); break;
case BC_Move: ByteCodeHandler<BC_Move>::execute(code, frame); break;
case BC_Not: ByteCodeHandler<BC_Not>::execute(code, frame); break;
case BC_Minus: ByteCodeHandler<BC_Minus>::execute(code, frame); break;
case BC_Len: ByteCodeHandler<BC_Len>::execute(code, frame); break;
case BC_SetGlobal: ByteCodeHandler<BC_SetGlobal>::execute(code, frame); break;
case BC_GetGlobal: ByteCodeHandler<BC_GetGlobal>::execute(code, frame); break;
case BC_Add: ByteCodeHandler<BC_Add>::execute(code, frame); break;
case BC_Sub: ByteCodeHandler<BC_Sub>::execute(code, frame); break;
case BC_Mul: ByteCodeHandler<BC_Mul>::execute(code, frame); break;
case BC_Div: ByteCodeHandler<BC_Div>::execute(code, frame); break;
case BC_Mod: ByteCodeHandler<BC_Mod>::execute(code, frame); break;
case BC_Pow: ByteCodeHandler<BC_Pow>::execute(code, frame); break;
case BC_Less: ByteCodeHandler<BC_Less>::execute(code, frame); break;
case BC_LessEq: ByteCodeHandler<BC_LessEq>::execute(code, frame); break;
case BC_Greater: ByteCodeHandler<BC_Greater>::execute(code, frame); break;
case BC_GreaterEq: ByteCodeHandler<BC_GreaterEq>::execute(code, frame); break;
case BC_Equal: ByteCodeHandler<BC_Equal>::execute(code, frame); break;
case BC_NEqual: ByteCodeHandler<BC_NEqual>::execute(code, frame); break;
case BC_SetArray: ByteCodeHandler<BC_SetArray>::execute(code, frame); break;
case BC_GetArray: ByteCodeHandler<BC_GetArray>::execute(code, frame); break;
case BC_Jump: ByteCodeHandler<BC_Jump>::execute(code, frame); break;
case BC_TrueJump: ByteCodeHandler<BC_TrueJump>::execute(code, frame); break;
case BC_FalseJump: ByteCodeHandler<BC_FalseJump>::execute(code, frame); break;
case BC_Call: ByteCodeHandler<BC_Call>::execute(code, frame);
++frame->ip;
goto l_endWhile;
default: ASSERT(0); break;
}
++frame->ip;
}
l_endWhile:
if (frame->ip == maxIp) {
vm->popFrame();
}
}
}
void execute(StackFrame *stopFrame) {
try {
_execute(stopFrame);
} catch(Exception& e) {
for (;;) {
auto frame = JSVM::instance()->topFrame();
if (frame == stopFrame) break;
auto meta = frame->func->meta;
int line = meta->ip2line[frame->ip];
e.addLine(format("%s(%d):", meta->fileName.c_str(), line));
JSVM::instance()->popFrame();
}
throw;
}
}
void disassemble(ostream& so, const FuncMetaPtr &meta, int depth) {
for (int i = 0; i < (int)meta->codes.size(); ++i) {
int code = meta->codes[i];
so << format("%s%3d:", tabString(depth).c_str(), i + 1);
string str;
switch (code & 0xff) {
case BC_NewFunction: str = ByteCodeHandler<BC_NewFunction>::disassemble(code, meta.get()); break;
case BC_NewArray: str = ByteCodeHandler<BC_NewArray>::disassemble(code, meta.get()); break;
case BC_Move: str = ByteCodeHandler<BC_Move>::disassemble(code, meta.get()); break;
case BC_Not: str = ByteCodeHandler<BC_Not>::disassemble(code, meta.get()); break;
case BC_Minus: str = ByteCodeHandler<BC_Minus>::disassemble(code, meta.get()); break;
case BC_Len: str = ByteCodeHandler<BC_Len>::disassemble(code, meta.get()); break;
case BC_SetGlobal: str = ByteCodeHandler<BC_SetGlobal>::disassemble(code, meta.get()); break;
case BC_GetGlobal: str = ByteCodeHandler<BC_GetGlobal>::disassemble(code, meta.get()); break;
case BC_Add: str = ByteCodeHandler<BC_Add>::disassemble(code, meta.get()); break;
case BC_Sub: str = ByteCodeHandler<BC_Sub>::disassemble(code, meta.get()); break;
case BC_Mul: str = ByteCodeHandler<BC_Mul>::disassemble(code, meta.get()); break;
case BC_Div: str = ByteCodeHandler<BC_Div>::disassemble(code, meta.get()); break;
case BC_Mod: str = ByteCodeHandler<BC_Mod>::disassemble(code, meta.get()); break;
case BC_Pow: str = ByteCodeHandler<BC_Pow>::disassemble(code, meta.get()); break;
case BC_Less: str = ByteCodeHandler<BC_Less>::disassemble(code, meta.get()); break;
case BC_LessEq: str = ByteCodeHandler<BC_LessEq>::disassemble(code, meta.get()); break;
case BC_Greater: str = ByteCodeHandler<BC_Greater>::disassemble(code, meta.get()); break;
case BC_GreaterEq: str = ByteCodeHandler<BC_GreaterEq>::disassemble(code, meta.get()); break;
case BC_Equal: str = ByteCodeHandler<BC_Equal>::disassemble(code, meta.get()); break;
case BC_NEqual: str = ByteCodeHandler<BC_NEqual>::disassemble(code, meta.get()); break;
case BC_SetArray: str = ByteCodeHandler<BC_SetArray>::disassemble(code, meta.get()); break;
case BC_GetArray: str = ByteCodeHandler<BC_GetArray>::disassemble(code, meta.get()); break;
case BC_Jump: str = ByteCodeHandler<BC_Jump>::disassemble(code, meta.get()); break;
case BC_TrueJump: str = ByteCodeHandler<BC_TrueJump>::disassemble(code, meta.get()); break;
case BC_FalseJump: str = ByteCodeHandler<BC_FalseJump>::disassemble(code, meta.get()); break;
case BC_Call: str = ByteCodeHandler<BC_Call>::disassemble(code, meta.get()); break;
default: ASSERT(0); break;
}
so << str << endl;
if ((code & 0xff) == BC_NewFunction) {
disassemble(so, ByteCodeHandler<BC_NewFunction>::getMetaFromCode(code), depth + 1);
}
}
}