Repository navigation
Expand file tree
/
Copy pathcodegen.c
More file actions
307 lines (266 loc) · 6.68 KB
/
Copy pathcodegen.c
File metadata and controls
307 lines (266 loc) · 6.68 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
#include "9cc.h"
#include "util.h"
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
static void gen_lval(Node *);
static void gen(Node *);
static int label = 0;
static int rsp_cur;
static char *arg_rg[] = {"rdi", "rsi", "rdx", "rcx", "r8", "r9", NULL};
static void gen_lval(Node *node) {
if (node->ty != ND_IDENT) {
error("変数ではありません\n");
}
SYM_REC *rec = query_var(node->name);
if (rec == NULL) {
error("未宣言の変数: %s\n", node->name);
}
printf("\tmov rax, rbp\n");
printf("\tsub rax, %d\n", rec->addr);
printf("\tpush rax\n");
}
static void gen_func_def(Node *node) {
int len;
rsp_cur = 0;
sym_tab = (SYM_TAB *)map_get(sym_tab->children, node->name);
// print function name in label.
printf("%s:\n", node->name);
// print pro-logue
printf("\tpush rbp\n");
printf("\tmov rbp, rsp\n");
printf("\tsub rsp, %d\n", sym_tab->var_cnt * 8);
rsp_cur -= sym_tab->var_cnt * 8;
// function params
len = node->params->len;
for (int i = 0; i < len; i++) {
gen_lval((Node *)vec_at(node->params, i));
printf("\tpush %s\n", arg_rg[i]);
printf("\tpop rdi\n");
printf("\tpop rax\n");
printf("\tmov [rax], rdi\n");
}
// function body
gen(node->body);
// epi-logue
printf("\tmov rsp, rbp\n");
printf("\tpop rbp\n");
printf("\tret\n");
printf("\tpush rax\n");
sym_tab = sym_tab->parent;
}
static void gen_func_call(Node *node) {
int len = node->args->len;
for (int i = 0; i < len; i++) {
if (arg_rg[i] == NULL)
error("too match args");
printf("\tpush %s\n", arg_rg[i]);
rsp_cur -= 8;
}
for (int i = 0; i < len; i++) {
gen((Node *)vec_at(node->args, i));
printf("\tpop %s\n", arg_rg[i]);
}
int offset = 16 - abs(rsp_cur % 16);
if (offset % 16 != 0)
printf("\tsub rsp, %d\n", offset);
printf("\tcall %s\n", node->name);
if (offset % 16 != 0)
printf("\tadd rsp, %d\n", offset);
for (int i = 0; i < len; i++) {
printf("\tpop %s\n", arg_rg[len - i - 1]);
rsp_cur += 8;
}
printf("\tpush rax\n");
}
static void gen_if(Node *node) {
// ラベルの作成 l
int l0 = label++;
int l1 = label++;
// cond
gen(node->cond);
// スタックトップの値でlへ条件分岐
printf("\tpop rdi\n");
printf("\tcmp rdi,0\n");
printf("\tje L%d\n", l0); // L0 - lelse
// then
gen(node->then);
printf("\tpop rax\n");
printf("\tjmp L%d\n", l1); // L1 l lthen
// ラベルの印字
printf("L%d:\n", l0); // L0
if (node->els != NULL) {
gen(node->els);
printf("\tpop rax\n");
}
printf("L%d:\n", l1); // L1
printf("\tpush rax\n");
}
static void gen_while(Node *node) {
// ラベルの作成 l
node->label_head = malloc((3 + 1) * sizeof(char));
node->label_tail = malloc((3 + 1) * sizeof(char));
sprintf(node->label_head, "L%02d", label++); // L0
sprintf(node->label_tail, "L%02d", label++); // L1
printf("%s:\n", node->label_head); // L0
// cond
gen(node->cond);
// スタックトップの値でlへ条件分岐
printf("\tpop rdi\n");
printf("\tcmp rdi,0\n");
printf("\tje %s\n", node->label_tail); // L1
// body
gen(node->body);
printf("\tpop rax\n");
printf("\tjmp %s\n", node->label_head); // L0
printf("%s:\n", node->label_tail); // L1
printf("\tpush rax\n");
}
static void gen_return(Node *node) {
gen(node->lhs);
printf("\tpop rax\n");
printf("\tmov rsp, rbp\n");
printf("\tpop rbp\n");
printf("\tret\n");
printf("\tpush rax\n");
}
/**
*
*/
static void gen(Node *node) {
switch (node->ty) {
case ND_FUNC_CALL:
gen_func_call(node);
return;
case ND_VAR_DEF:
printf("\tpush rax\n");
return;
case ND_FUNC_DEF:
gen_func_def(node);
return;
case ND_WHILE:
gen_while(node);
return;
case ND_CONTINUE:
printf("\tjmp %s\n", node->target->label_head);
printf("\tpush rax\n");
return;
case ND_BREAK:
printf("\tjmp %s\n", node->target->label_tail);
printf("\tpush rax\n");
return;
case ND_IF:
gen_if(node);
return;
case ND_RETURN:
gen_return(node);
return;
case ND_COMP_STMT:
for (int i = 0; i < node->stmts->len; i++) {
gen((Node *)vec_at(node->stmts, i));
printf("\tpop rax\n");
}
printf("\tpush rax\n");
return;
case ND_UNARY_MINUS:
gen(node->lhs);
printf("\tpop rax\n");
printf("\tneg rax\n");
printf("\tpush rax\n");
return;
case ND_SIZEOF:
if (node->lhs->c_ty->ty == INT)
printf("\tpush 4\n");
else if (node->lhs->c_ty->ty == PTR)
printf("\tpush 8\n");
else
error("sizeof operand unknown type(%d)\n", node->lhs->c_ty->ty);
return;
case ND_NUM:
printf("\tpush %d\n", node->val);
return;
case ND_IDENT:
gen_lval(node);
printf("\tpop rax\n");
printf("\tmov rax, [rax]\n");
printf("\tpush rax\n");
return;
case ND_ADDRESS_OF:
// TODO: test
gen_lval(node->lhs);
return;
case ND_DEREFERENCE: // *ptr
// TODO: test
gen(node->lhs);
// gen_lval(node->lhs);
printf("\tpop rax\n");
// printf("\tmov rax, [rax]\n");
printf("\tmov rax, [rax]\n");
printf("\tpush rax\n");
return;
case '=':
gen_lval(node->lhs);
gen(node->rhs);
printf("\tpop rdi\n");
printf("\tpop rax\n");
printf("\tmov [rax], rdi\n");
printf("\tpush rdi\n");
return;
case '+':
case '-':
case '*':
case '/':
case ND_EQ:
case ND_NE:
gen(node->lhs);
gen(node->rhs);
printf("\tpop rdi\n");
printf("\tpop rax\n");
switch (node->ty) {
case '+':
printf("\tadd rax, rdi\n");
break;
case '-':
printf("\tsub rax, rdi\n");
break;
case '*':
printf("\tmul rdi\n");
break;
case '/':
printf("\tmov rdx, 0\n");
printf("\tdiv rdi\n");
break;
case ND_EQ:
printf("\tcmp rdi, rax\n");
printf("\tsete al\n");
printf("\tmovzb rax, al\n");
break;
case ND_NE:
printf("\tcmp rdi, rax\n");
printf("\tsetne al\n");
printf("\tmovzb rax, al\n");
break;
}
printf("\tpush rax\n");
return;
default:
error("unexpected type of node(%d)\n", node->ty);
}
}
void gen_x86(Vector *code) {
// print preamble.
printf(".intel_syntax noprefix\n");
// print global function names.
printf(".global ");
Vector *keys = map_keys(sym_tab->children);
for (int i = 0; i < keys->len - 1; i++)
printf("%s, ", (char *)vec_at(keys, i));
printf("%s\n", (char *)vec_at(keys, keys->len - 1));
// print each node.
for (int i = 0; i < code->len; i++) {
gen((Node *)vec_at(code, i));
// 式の評価結果としてスタックに一つの値が残っているはずなので
// スタックが溢れないようにポップしておく
printf("\tpop rax\n");
}
}