-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexpression.c
More file actions
309 lines (303 loc) · 9.6 KB
/
expression.c
File metadata and controls
309 lines (303 loc) · 9.6 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
#include <stdint.h>
#include <inttypes.h>
#include <stdlib.h>
#include "main.h"
#include "expression.h"
#include "hashmap.h"
#include "statement.h"
#include "emitter.h"
/**
* This preprocesses the expression by removing any literals that it can
*/
expression* preprocess_expression(expression *e)
{
switch (e->type)
{
case t_not:
//TODO: FIx this for some reason
return e;
case t_num:
case t_var:
case t_func:
case t_print:
return e;
default:
{
e->left = preprocess_expression(e->left);
e->right = preprocess_expression(e->right);
if(e->left->type == t_num && e->right->type == t_num)
{
uint64_t result = eval_expr(NULL, NULL, e);
free_expression(e->right);
free_expression(e->left);
e->character = malloc(sizeof(character));
e->character->value = result;
e->type = t_num;
}
return e;
}
}
//TODO: add more cases
}
/**
* This compiles the expression into assembly through recursion, its values are then stroed onto the top of the stack
*/
void compile_expression(emitter_t *emitter, expression *e)
{
switch (e->type)
{
case t_not:
compile_expression(emitter, e->left);
pop_register(emitter, "rax");
emit(emitter, "movq $0, %rbx");
emit(emitter, "cmp \%rbx, \%rax");
emit(emitter, "sete \%al");
emit(emitter, "movzbq \%al, \%rax");
push_register(emitter, "rax");
break;
case t_star:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rax");
pop_register(emitter, "rbx");
emit(emitter, "mul \%rbx");
push_register(emitter, "rax");
break;
case t_divide:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rbx");
pop_register(emitter, "rax");
emit(emitter, "movq $0, %rdx");
emit(emitter, "div \%rbx");
push_register(emitter, "rax");
break;
case t_mod:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rbx");
pop_register(emitter, "rax");
emit(emitter, "movq $0, %rdx");
emit(emitter, "div \%rbx");
push_register(emitter, "rdx");
break;
case t_plus:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rax");
pop_register(emitter, "rbx");
emit(emitter, "add \%rbx, \%rax");
push_register(emitter, "rax");
break;
case t_minus:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rbx");
pop_register(emitter, "rax");
emit(emitter, "sub \%rbx, \%rax");
push_register(emitter, "rax");
break;
case t_l:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rbx");
pop_register(emitter, "rax");
emit(emitter, "cmp \%rbx, \%rax");
emit(emitter, "setb \%al");
emit(emitter, "movzbq \%al, \%rax");
push_register(emitter, "rax");
break;
case t_g:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rbx");
pop_register(emitter, "rax");
emit(emitter, "cmp \%rbx, \%rax");
emit(emitter, "seta \%al");
emit(emitter, "movzbq \%al, \%rax");
push_register(emitter, "rax");
break;
case t_lt:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rbx");
pop_register(emitter, "rax");
emit(emitter, "cmp \%rbx, \%rax");
emit(emitter, "setbe \%al");
emit(emitter, "movzbq \%al, \%rax");
push_register(emitter, "rax");
break;
case t_gt:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rbx");
pop_register(emitter, "rax");
emit(emitter, "cmp \%rbx, \%rax");
emit(emitter, "setae \%al");
emit(emitter, "movzbq \%al, \%rax");
push_register(emitter, "rax");
break;
case t_eq:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rbx");
pop_register(emitter, "rax");
emit(emitter, "cmp \%rbx, \%rax");
emit(emitter, "sete \%al");
emit(emitter, "movzbq \%al, \%rax");
push_register(emitter, "rax");
break;
case t_neq:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rbx");
pop_register(emitter, "rax");
emit(emitter, "cmp \%rbx, \%rax");
emit(emitter, "setne \%al");
emit(emitter, "movzbq \%al, \%rax");
push_register(emitter, "rax");
break;
case t_and:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rax");
pop_register(emitter, "rbx");
emit(emitter, "cmp $0, \%rax");
emit(emitter, "seta \%al");
emit(emitter, "cmp $0, \%rbx");
emit(emitter, "seta \%bl");
emit(emitter, "and \%bl, \%al");
emit(emitter, "movzbq \%al, \%rax");
push_register(emitter, "rax");
break;
case t_or:
compile_expression(emitter, e->left);
compile_expression(emitter, e->right);
pop_register(emitter, "rax");
pop_register(emitter, "rbx");
emit(emitter, "cmp $0, \%rax");
emit(emitter, "seta \%al");
emit(emitter, "cmp $0, \%rbx");
emit(emitter, "seta \%bl");
emit(emitter, "or \%bl, \%al");
emit(emitter, "movzbq \%al, \%rax");
push_register(emitter, "rax");
break;
case t_num:
emit_number(emitter, "movq $%lu, \%rax", e->character->value);
push_register(emitter, "rax");
break;
case t_var:
emit_number(emitter, "movq %d(\%rbp), \%rax", get_offset(emitter, e->character->name));
push_register(emitter, "rax");
break;
case t_func:
call_function(emitter, e->character->function);
push_register(emitter, "rax");
break;
case t_print:
compile_expression(emitter, e->left);
pop_register(emitter, "rax");
emit(emitter, "mov %rax, %rsi");
emit(emitter, "mov $0, %rax");
bool change = align_stack(emitter);
emit(emitter, "lea format_(%rip),%rdi");
emit(emitter, ".extern printf");
emit(emitter, "call printf");
emit(emitter, "mov $0, %rax");
realign_stack(emitter, change);
push_register(emitter, "rax");
break;
default:
emit(emitter, "implement later");
break;
}
}
/**
* Recursively frees up expression memory
*/
void free_expression(expression *e)
{
switch (e->type)
{
case t_not:
free_expression(e->left);
break;
case t_print:
free_expression(e->left);
free(e->character);
break;
case t_num:
free(e->character);
break;
case t_var:
free(e->character->name);
free(e->character);
break;
case t_func:
free_function(e->character->function);
free(e->character);
break;
default:
free_expression(e->left);
free_expression(e->right);
break;
}
free(e);
}
/**
* Recursively evaluates an expression
*/
uint64_t eval_expr(Interpreter *in, struct map *map, expression *e)
{
switch (e->type)
{
case t_not:
return !eval_expr(in, map, e->left);
case t_star:
return eval_expr(in, map, e->left) * eval_expr(in, map, e->right);
case t_divide:
return eval_expr(in, map, e->left) / eval_expr(in, map, e->right);
case t_mod:
return eval_expr(in, map, e->left) % eval_expr(in, map, e->right);
case t_plus:
return eval_expr(in, map, e->left) + eval_expr(in, map, e->right);
case t_minus:
return eval_expr(in, map, e->left) - eval_expr(in, map, e->right);
case t_l:
return eval_expr(in, map, e->left) < eval_expr(in, map, e->right);
case t_lt:
return eval_expr(in, map, e->left) <= eval_expr(in, map, e->right);
case t_g:
return eval_expr(in, map, e->left) > eval_expr(in, map, e->right);
case t_gt:
return eval_expr(in, map, e->left) >= eval_expr(in, map, e->right);
case t_eq:
return eval_expr(in, map, e->left) == eval_expr(in, map, e->right);
case t_neq:
return eval_expr(in, map, e->left) != eval_expr(in, map, e->right);
case t_and:
{
uint64_t a = eval_expr(in, map, e->left);
uint64_t b = eval_expr(in, map, e->right); // I HAD TO REMOVE SHORT CIRCITING :(
return a && b;
}
case t_or:
{
uint64_t c = eval_expr(in, map, e->left);
uint64_t d = eval_expr(in, map, e->right);
return c || d;
}
case t_num:
return e->character->value;
case t_var:
return getSymbol(in, map, e->character->name);
case t_func:
return evaluate_function(in, map, e->character->function, get_function(in, e->character->function->name));
case t_print:
printf("%" PRIu64 "\n", eval_expr(in, map, e->left));
return 0;
default:
return 0;
}
}