-
Notifications
You must be signed in to change notification settings - Fork 1
/
codegen.c
197 lines (172 loc) · 4.43 KB
/
codegen.c
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
#include "jcc.h"
//
// Code generator
//
static int depth;
static void gen_expr(Node *node);
static int count(void) {
static int i = 1;
return i++;
}
static void push(void) {
printf(" push %%rax\n");
depth++;
}
static void pop(char *arg) {
printf(" pop %s\n", arg);
depth--;
}
/* Round up 'n' to the nearest multiple of 'align', For istance,
* align_to(5, 8) returns 8 and align_to(11, 8) returns 16.
*/
static int align_to(int n, int align) {
return ((n + align -1) / align) * align;
}
// Compute the absolute address of a given node.
// Tt's an error if a given node does not reside in memory
static void gen_addr(Node *node) {
switch (node->kind) {
case ND_VAR:
printf(" lea %d(%%rbp), %%rax\n", node->var->offset);
return;
case ND_DEREF:
gen_expr(node->lhs);
return;
}
error_tok(node->tok, "not an lvalue");
}
static void gen_expr(Node *node) {
switch (node->kind) {
case ND_NUM:
printf(" mov $%d, %%rax\n", node->val);
return;
case ND_NEG:
gen_expr(node->lhs);
printf(" neg %%rax\n");
return;
case ND_VAR:
gen_addr(node);
printf(" mov (%%rax), %%rax\n");
return;
case ND_DEREF:
gen_expr(node->lhs);
printf(" mov (%%rax), %%rax\n");
return;
case ND_ADDR:
gen_addr(node->lhs);
return;
case ND_ASSIGN:
gen_addr(node->lhs);
push();
gen_expr(node->rhs);
pop("%rdi");
printf(" mov %%rax, (%%rdi)\n");
return;
}
gen_expr(node->rhs);
push();
gen_expr(node->lhs);
pop("%rdi");
switch (node->kind) {
case ND_ADD:
printf(" add %%rdi, %%rax\n");
return;
case ND_SUB:
printf(" sub %%rdi, %%rax\n");
return;
case ND_MUL:
printf(" imul %%rdi, %%rax\n");
return;
case ND_DIV:
printf(" cqo\n");
printf(" idiv %%rdi\n");
return;
case ND_EQ:
case ND_NE:
case ND_LT:
case ND_LE:
printf(" cmp %%rdi, %%rax\n");
if (node->kind == ND_EQ)
printf(" sete %%al\n");
else if (node->kind == ND_NE)
printf(" setne %%al\n");
else if (node->kind == ND_LT)
printf(" setl %%al\n");
else if (node->kind == ND_LE)
printf(" setle %%al\n");
printf(" movzb %%al, %%rax\n");
return;
}
error_tok(node->tok, "invalid expression");
}
static void gen_stmt(Node *node){
switch (node->kind) {
case ND_RETURN:
gen_expr(node->lhs);
printf(" jmp .L.return\n");
return;
case ND_EXPR_STMT:
gen_expr(node->lhs);
return;
case ND_IF:{
int c = count();
gen_expr(node->cond);
printf(" cmp $0, %%rax\n");
printf(" je .L.else.%d\n", c);
gen_stmt(node->then);
printf(" jmp .L.end.%d\n", c);
printf(".L.else.%d:\n", c);
if (node->els)
gen_stmt(node->els);
printf(".L.end.%d:\n", c);
return;
}
case ND_FOR: {
int c = count();
if(node->init)
gen_stmt(node->init);
printf(".L.begin.%d:\n", c);
if(node->cond) {
gen_expr(node->cond);
printf(" cmp $0, %%rax\n");
printf(" je .L.end.%d\n", c);
}
gen_stmt(node->then);
if(node->inc)
gen_expr(node->inc);
printf(" jmp .L.begin.%d\n", c);
printf(".L.end.%d:\n", c);
return ;
}
case ND_BLOCK:
for(Node *n = node->body; n; n = n->next)
gen_stmt(n);
return;
}
error_tok(node->tok, "invalid statment");
}
/* Assign offset to local variables.
*/
static void assign_lvar_offsets(Fuction *prog) {
int offset = 0;
for(Obj *var = prog->locals; var; var = var->next) {
offset += 8;
var->offset = -offset;
}
prog->stack_size = align_to(offset, 16);
}
void codegen(Fuction *prog) {
assign_lvar_offsets(prog);
printf(".globl main\n");
printf("main:\n");
// Prologue
printf(" push %%rbp\n");
printf(" mov %%rsp, %%rbp\n");
printf(" sub $%d, %%rsp\n", prog->stack_size);
gen_stmt(prog->body);
assert(depth == 0);
printf(".L.return:\n");
printf(" mov %%rbp, %%rsp\n");
pop("%rbp");
printf(" ret\n");
}