-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcodegen.c
159 lines (139 loc) · 3.35 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
#include "9cc.h"
Node *new_node(NodeKind kind) {
Node *node = calloc(1, sizeof(Node));
node->kind = kind;
return node;
}
Node *new_binary(NodeKind kind, Node *lhs, Node *rhs) {
Node *node = new_node(kind);
node->lhs = lhs;
node->rhs = rhs;
return node;
}
Node *new_node_num(int val) {
Node *node = calloc(1, sizeof(Node));
node->kind = ND_NUM;
node->val = val;
return node;
}
// expr = equality
// equality = relational ("==" relational | "!=" relational)*
// relational = add ("<" add | "<=" add | ">" add | ">=" add)*
// add = mul ("+" mul | "-" mul)*
// mul = unary ("*" unary | "/" unary)*
// unary = ("+" | "-")? primary
// primary = num | "(" expr ")"
Node *expr() {
return equality();
}
Node *equality() {
Node *node = relational();
for(;;) {
if(consume("=="))
node = new_binary(ND_EQ, node, relational());
else if(consume("!="))
node = new_binary(ND_NE, node, relational());
else
return node;
}
}
Node *relational() {
Node *node = add();
for(;;) {
if(consume("<"))
node = new_binary(ND_LT, node, add());
else if(consume("<="))
node = new_binary(ND_LE, node, add());
else if(consume(">"))
node = new_binary(ND_LT, add(), node);
else if(consume(">="))
node = new_binary(ND_LE, add(), node);
else
return node;
}
}
Node *add() {
Node *node = mul();
for(;;) {
if(consume("+"))
node = new_binary(ND_ADD, node, mul());
else if(consume("-"))
node = new_binary(ND_SUB, node, mul());
else
return node;
}
}
Node *mul() {
Node *node = unary();
for(;;) {
if(consume("*"))
node = new_binary(ND_MUL, node, unary());
else if(consume("/"))
node = new_binary(ND_DIV, node, unary());
else
return node;
}
}
Node *unary() {
if(consume("+"))
return primary();
if(consume("-"))
return new_binary(ND_SUB, new_node_num(0), primary());
return primary();
}
Node *primary() {
// 次のトークンが"("なら、"(" expr ")"のはず
if(consume("(")) {
Node *node = expr();
expect(")");
return node;
}
// そうでなければ数値のはず
return new_node_num((expect_number()));
}
void gen(Node *node) {
if(node->kind == ND_NUM) {
printf(" push %d\n", node->val);
return;
}
gen(node->lhs);
gen(node->rhs);
printf(" pop rdi\n");
printf(" pop rax\n");
switch(node->kind) {
case ND_ADD:
printf(" add rax, rdi\n");
break;
case ND_SUB:
printf(" sub rax, rdi\n");
break;
case ND_MUL:
printf(" imul rax, rdi\n");
break;
case ND_DIV:
printf(" cqo\n");
printf(" idiv rdi\n");
break;
case ND_EQ:
printf(" cmp rax, rdi\n");
printf(" sete al\n");
printf(" movzb rax, al\n");
break;
case ND_NE:
printf(" cmp rax, rdi\n");
printf(" setne al\n");
printf(" movzb rax, al\n");
break;
case ND_LE:
printf(" cmp rax, rdi\n");
printf(" setle al\n");
printf(" movzb rax, al\n");
break;
case ND_LT:
printf(" cmp rax, rdi\n");
printf(" setl al\n");
printf(" movzb rax, al\n");
break;
}
printf(" push rax\n");
}