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
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
|
/**
* This file generates x86-64 assembly code in NASM format from the parsed AST.
*/
#include "generator.h"
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <sys/syscall.h>
static int label_counter = 0;
static Node *current_function = NULL;
#define DEFER_STACK_SIZE 1024
static Node *defer_stack[DEFER_STACK_SIZE];
static i64 defer_stack_count = 0;
void make_syscall(i64 syscall_no, FILE *out) {
#if __APPLE__
syscall_no += 0x2000000;
#endif
fprintf(out, " mov rax, %lld\n", syscall_no);
fprintf(out, " syscall\n");
}
void generate_expr_into_rax(Node *expr, FILE *out);
void generate_func_call(Node *node, FILE *out)
{
assert(node->type == AST_FUNCCALL);
// FIXME: This seems like a big hack
i64 total_size = 0;
for (int i = node->call.num_args - 1; i >= 0; i--) {
Node *arg = node->call.args[i];
generate_expr_into_rax(arg, out);
fprintf(out, " push rax\n");
// TODO: Compute this for different types
// TODO: Also make sure of padding and stuff?
total_size += 8;
}
fprintf(out, " call func_%s\n", node->call.func->func.name);
fprintf(out, " add rsp, %lld\n", total_size);
}
// The evaluated expression is stored into `rax`
void generate_expr_into_rax(Node *expr, FILE *out)
{
// TODO: Different sized output for different types?
if (expr->type == AST_LITERAL) {
// TODO: More literal types
assert(expr->literal.type->type == TYPE_INT);
fprintf(out, " mov rax, %d\n", expr->literal.as_int);
} else if (expr->type == AST_FUNCCALL) {
generate_func_call(expr, out);
} else if (expr->type == AST_LOCAL_VAR) {
i64 offset = expr->variable->offset;
if (offset > 0)
fprintf(out, " mov rax, [rbp-%lld]\n", offset);
else
fprintf(out, " mov rax, [rbp+%lld]\n", -offset);
} else if (expr->type == AST_GLOBAL_VAR) {
i64 offset = expr->variable->offset;
fprintf(out, " mov rax, global_vars\n");
fprintf(out, " add rax, %lld\n", offset);
fprintf(out, " mov rax, [rax]\n");
} else if (expr->type == OP_ASSIGN) {
Node *var = expr->assign.var;
i64 offset = var->variable->offset;
generate_expr_into_rax(expr->assign.value, out);
if (var->type == AST_LOCAL_VAR) {
fprintf(out, " mov [rbp-%lld], rax\n", offset);
} else if (var->type == AST_GLOBAL_VAR) {
fprintf(out, " mov rbx, global_vars\n");
fprintf(out, " mov [rbx+%lld], rax\n", offset);
} else {
fprintf(stderr, "Unhandled assignment type: %s\n", node_type_to_str(var->type));
exit(1);
}
} else if (expr->type == OP_NEG) {
generate_expr_into_rax(expr->unary_expr, out);
fprintf(out, " neg rax\n");
} else if (expr->type == OP_NOT) {
generate_expr_into_rax(expr->unary_expr, out);
// Booleanize
fprintf(out, " cmp rax, 0\n");
fprintf(out, " sete al\n");
fprintf(out, " movzx rax, al\n");
} else if (expr->type == OP_BWINV) {
generate_expr_into_rax(expr->unary_expr, out);
fprintf(out, " not rax\n");
} else if (expr->type == OP_PLUS) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " add rax, rbx\n");
} else if (expr->type == OP_MINUS) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " sub rax, rbx\n");
} else if (expr->type == OP_DIV) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " cqo\n");
fprintf(out, " idiv rbx\n");
} else if (expr->type == OP_MUL) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " imul rbx\n");
// TODO: Compress these, there's barely any differences
} else if (expr->type == OP_EQ) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " cmp rax, rbx\n");
fprintf(out, " sete al\n");
fprintf(out, " movzx rax, al\n");
} else if (expr->type == OP_NEQ) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " cmp rax, rbx\n");
fprintf(out, " setne al\n");
fprintf(out, " movzx rax, al\n");
} else if (expr->type == OP_LT) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " cmp rax, rbx\n");
fprintf(out, " setl al\n");
fprintf(out, " movzx rax, al\n");
} else if (expr->type == OP_LEQ) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " cmp rax, rbx\n");
fprintf(out, " setle al\n");
fprintf(out, " movzx rax, al\n");
} else if (expr->type == OP_GT) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " cmp rax, rbx\n");
fprintf(out, " setg al\n");
fprintf(out, " movzx rax, al\n");
} else if (expr->type == OP_GEQ) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " cmp rax, rbx\n");
fprintf(out, " setge al\n");
fprintf(out, " movzx rax, al\n");
} else if (expr->type == OP_GEQ) {
generate_expr_into_rax(expr->binary.right, out);
fprintf(out, " push rax\n");
generate_expr_into_rax(expr->binary.left, out);
fprintf(out, " pop rbx\n");
fprintf(out, " cmp rax, rbx\n");
fprintf(out, " setge al\n");
fprintf(out, " movzx rax, al\n");
// Note: These are different because of short-circuit evaluation!
} else if (expr->type == OP_OR) {
generate_expr_into_rax(expr->binary.left, out);
// If left is true, we can short-circuit
fprintf(out, " cmp rax, 0\n");
fprintf(out, " je .or_right_%d\n", label_counter);
fprintf(out, " mov rax, 1\n");
fprintf(out, " jmp .or_end_%d\n", label_counter);
fprintf(out, ".or_right_%d:\n", label_counter);
generate_expr_into_rax(expr->binary.right, out);
// Booleanize the result
fprintf(out, " cmp rax, 0\n");
fprintf(out, " setne al\n");
fprintf(out, ".or_end_%d:\n", label_counter);
label_counter++;
} else if (expr->type == OP_AND) {
generate_expr_into_rax(expr->binary.left, out);
// If left is false, we can short-circuit
fprintf(out, " cmp rax, 0\n");
fprintf(out, " jne .and_right_%d\n", label_counter);
fprintf(out, " mov rax, 0\n");
fprintf(out, " jmp .and_end_%d\n", label_counter);
fprintf(out, ".and_right_%d:\n", label_counter);
generate_expr_into_rax(expr->binary.right, out);
// Booleanize the result
fprintf(out, " cmp rax, 0\n");
fprintf(out, " setne al\n");
fprintf(out, ".and_end_%d:\n", label_counter);
label_counter++;
} else if (expr->type == AST_CONDITIONAL) {
int cur_label = label_counter++;
generate_expr_into_rax(expr->conditional.cond, out);
// If left is false, we can short-circuit
fprintf(out, " cmp rax, 0\n");
fprintf(out, " je .cond_else_%d\n", cur_label);
generate_expr_into_rax(expr->conditional.do_then, out);
fprintf(out, " jmp .cond_end_%d\n", cur_label);
fprintf(out, ".cond_else_%d:\n", cur_label);
generate_expr_into_rax(expr->binary.right, out);
// Booleanize the result
generate_expr_into_rax(expr->conditional.do_else, out);
fprintf(out, ".cond_end_%d:\n", cur_label);
} else {
fprintf(stderr, "Unsupported expression type in generate_expr: `%s`\n", node_type_to_str(expr->type));
exit(1);
}
}
void generate_block(Node *block, FILE *out);
void generate_statement(Node *stmt, FILE *out)
{
if (stmt->type == AST_RETURN) {
generate_expr_into_rax(stmt->unary_expr, out);
fprintf(out, " push rax\n"); // Save the return value
// Run all the defer statements
i64 old_count = defer_stack_count;
while (defer_stack_count > 0)
generate_statement(defer_stack[--defer_stack_count], out);
defer_stack_count = old_count;
// TODO: Only do this if we have local variables
fprintf(out, " pop rax\n");
fprintf(out, " mov rsp, rbp\n");
fprintf(out, " pop rbp\n");
fprintf(out, " ret\n");
} else if (stmt->type == AST_VARDECL) {
if (stmt->var_decl.value) {
generate_expr_into_rax(stmt->var_decl.value, out);
i64 offset = stmt->var_decl.var.offset;
fprintf(out, " mov [rbp-%lld], rax\n", offset);
} else {
// Initialize to 0
i64 offset = stmt->var_decl.var.offset;
// TODO: Use correct size for the type
fprintf(out, " mov qword [rbp-%lld], 0\n", offset);
}
} else if (stmt->type == AST_IF) {
assert(stmt->conditional.cond);
assert(stmt->conditional.do_then);
int cur_label = label_counter++;
generate_expr_into_rax(stmt->conditional.cond, out);
// If we don't have an `else` clause, we can simplify
if (!stmt->conditional.do_else) {
fprintf(out, " cmp rax, 0\n");
fprintf(out, " je .if_end_%d\n", cur_label);
generate_statement(stmt->conditional.do_then, out);
fprintf(out, ".if_end_%d:\n", cur_label);
} else {
fprintf(out, " cmp rax, 0\n");
fprintf(out, " je .if_else_%d\n", cur_label);
generate_statement(stmt->conditional.do_then, out);
fprintf(out, " jmp .if_end_%d\n", cur_label);
fprintf(out, ".if_else_%d:\n", cur_label);
generate_statement(stmt->conditional.do_else, out);
fprintf(out, ".if_end_%d:\n", cur_label);
}
} else if (stmt->type == AST_WHILE) {
int cur_label = label_counter++;
fprintf(out, ".loop_start_%d:\n", cur_label);
fprintf(out, ".loop_continue_%d:\n", cur_label);
generate_expr_into_rax(stmt->loop.cond, out);
fprintf(out, " cmp rax, 0\n");
fprintf(out, " je .loop_end_%d\n", cur_label);
generate_statement(stmt->loop.body, out);
fprintf(out, " jmp .loop_start_%d\n", cur_label);
fprintf(out, ".loop_end_%d:\n", cur_label);
} else if (stmt->type == AST_FOR) {
int cur_label = label_counter++;
if (stmt->loop.init) {
generate_statement(stmt->loop.init, out);
}
fprintf(out, ".loop_start_%d:\n", cur_label);
if (stmt->loop.cond) {
generate_expr_into_rax(stmt->loop.cond, out);
fprintf(out, " cmp rax, 0\n");
fprintf(out, " je .loop_end_%d\n", cur_label);
}
generate_statement(stmt->loop.body, out);
fprintf(out, ".loop_continue_%d:\n", cur_label);
if (stmt->loop.step) {
generate_expr_into_rax(stmt->loop.step, out);
}
fprintf(out, " jmp .loop_start_%d\n", cur_label);
fprintf(out, ".loop_end_%d:\n", cur_label);
} else if (stmt->type == AST_BLOCK) {
generate_block(stmt, out);
} else if (stmt->type == AST_DEFER) {
assert(defer_stack_count < DEFER_STACK_SIZE);
defer_stack[defer_stack_count++] = stmt->unary_expr;
} else {
// Once again, default to an expression here...
generate_expr_into_rax(stmt, out);
}
}
void generate_block(Node *block, FILE *out)
{
int cur_defer_pos = defer_stack_count;
assert(block->type == AST_BLOCK);
for (int i = 0; i < block->block.num_children; i++)
generate_statement(block->block.children[i], out);
assert(defer_stack_count - cur_defer_pos >= 0);
while (defer_stack_count > cur_defer_pos) {
Node *deferred = defer_stack[--defer_stack_count];
generate_statement(deferred, out);
}
}
void generate_function_header(Node *func, FILE *out)
{
assert(func->type == AST_FUNC);
fprintf(out, "global func_%s\n", func->func.name);
fprintf(out, "func_%s:\n", func->func.name);
// TODO: Only do this if we have local variables
fprintf(out, " push rbp\n");
fprintf(out, " mov rbp, rsp\n");
// FIXME: Also account for arguments
fprintf(out, " sub rsp, %lld\n", func->func.max_locals_size);
}
void generate_function(Node *func, FILE *out)
{
assert(func->type == AST_FUNC);
current_function = func;
generate_function_header(func, out);
generate_block(func->func.body, out);
// TODO: This is a hack, we should make sure a function contains a return statement
// if it says it's going to return something
fprintf(out, " mov rsp, rbp\n");
fprintf(out, " pop rbp\n");
// Return 0 by default if we don't have a return statement
fprintf(out, " mov qword rax, 0\n");
fprintf(out, " ret\n");
}
void generate_builtins(FILE *out);
void generate_asm(Node *root, FILE *out)
{
assert(root->type == AST_PROGRAM);
for (int i = 0; i < root->block.num_children; i++) {
Node *child = root->block.children[i];
if (child->type == AST_FUNC) {
generate_function(child, out);
} else if (child->type == AST_VARDECL) {
// Do nothing, we don't need to generate global variables
} else {
fprintf(stderr, "Unsupported node type in generate_asm: %s\n", node_type_to_str(child->type));
exit(1);
}
}
// Call `main` from `_main` and return
#if __APPLE__
fprintf(out, "global _main\n");
fprintf(out, "_main:\n");
#else
fprintf(out, "global _start\n");
fprintf(out, "_start:\n");
#endif
fprintf(out, " call func_main\n");
fprintf(out, " mov rdi, rax\n");
make_syscall(SYS_exit, out);
// TODO: Don't generate code for functions that cannot get called.
// TODO: Add implementations of some primitives?
generate_builtins(out);
fprintf(out, "section .bss\n");
fprintf(out, " global_vars: resb %lld\n", root->block.locals_size);
}
void generate_builtins(FILE *out)
{
// Stolen shamelessly from tsoding/porth:
// https://gitlab.com/tsoding/porth
fprintf(out,
"func_print:\n"
" mov rdi, [rsp+8]\n"
" mov r9, -3689348814741910323\n"
" sub rsp, 40\n"
" mov BYTE [rsp+31], 10\n"
" lea rcx, [rsp+30]\n"
" mov qword rbx, 0\n"
".L2:\n"
" mov rax, rdi\n"
" lea r8, [rsp+32]\n"
" mul r9\n"
" mov rax, rdi\n"
" sub r8, rcx\n"
" shr rdx, 3\n"
" lea rsi, [rdx+rdx*4]\n"
" add rsi, rsi\n"
" sub rax, rsi\n"
" add eax, 48\n"
" mov BYTE [rcx], al\n"
" mov rax, rdi\n"
" mov rdi, rdx\n"
" mov rdx, rcx\n"
" sub rcx, 1\n"
" cmp rax, 9\n"
" ja .L2\n"
" lea rax, [rsp+32]\n"
" mov edi, 1\n"
" sub rdx, rax\n"
" xor eax, eax\n"
" lea rsi, [rsp+32+rdx]\n"
" mov rdx, r8\n"
);
make_syscall(SYS_write, out);
fprintf(out, " add rsp, 40\n");
fprintf(out, " ret\n");
/////////////////////////////////////////////////////////////////
// Print out a single character
fprintf(out,
"func_putc:\n"
" mov rdi, 1\n" // stdout
" mov rsi, rsp\n"
" add rsi, 8\n"
" mov rdx, 1\n" // 1 byte
);
make_syscall(SYS_write, out);
fprintf(out, " ret\n");
}
|