-
Notifications
You must be signed in to change notification settings - Fork 0
/
codegen_tools.c
240 lines (174 loc) · 5.29 KB
/
codegen_tools.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
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "decl.h"
#include "codegen.h"
#include "smalltools.h"
#include "codegen_tools.h"
extern struct hash_table* string_store;
const int SCRATCH_S = 7;
const char* name[] = {"rbx", "r10", "r11", "r12", "r13", "r14", "r15"};
const char* namelow8[] = {"bl", "r10b", "r11b", "r12b", "r13b", "r14b", "r15b"};
reg_use inuse[] = {FREE, FREE, FREE, FREE, FREE, FREE, FREE, FREE};
const int ARG_REGS_S = 6;
const char* argregnames[] = {"rdi", "rsi", "rdx", "rcx", "r8", "r9"};
int label_counter = 0;
int regname_to_number(const char* rname) {
for (int i = 0; i < SCRATCH_S; ++i) {
if (!strcmp(rname, argregnames[i])) return i;
}
assert(0);
return -1;
}
const char* argreg_name(int r) {
if (r >= 0 && r < ARG_REGS_S) return argregnames[r];
int rbppos = (r - 6)*8 + 16;
char* nlab = calloc((get_number_of_positions(r) + 5), sizeof(char));
strcpy(nlab, "rbp+");
sprintf(nlab + 4, "%d", rbppos);
return nlab;
}
int scratch_alloc() {
for (int i = 0; i < SCRATCH_S; ++i) {
if (inuse[i] == FREE) {
inuse[i]= INUSE;
return i;
}
}
printf("Error (for now): out of scratch registers.\n");
exit(1);
return -1;
}
void scratch_free(int r) {
if (r == -1) return;
if (r < -1 || r >= SCRATCH_S) {
printf("Error in scratch free: no register numbered %d.\n", r);
exit(1);
}
inuse[r] = FREE;
}
const char* scratch_name(int r) {
if (r < 0 || r >= SCRATCH_S) {
printf("Error in scratch name: no register numbered %d.\n", r);
exit(1);
}
return name[r];
}
const char* scratch_name_low8(int r) {
if (r < 0 || r >= SCRATCH_S) {
printf("Error in scratch name low: no register numbered %d.\n", r);
exit(1);
}
return namelow8[r];
}
int label_create() {
return label_counter++;
}
const char* label_name(int label, char fletter) {
char* nlab = calloc((get_number_of_positions(label)+2), sizeof(char));
nlab[0] = fletter;
sprintf(nlab+1, "%d", label);
return nlab;
}
void codegen_array_element_reference(expr* e) {
//load the address of the beginning of the array
expr_codegen(e->left);
//the right node is the offset
expr_codegen(e->right);
//compute offset
type* arrtype = e->left->symbol->type->subtype;
int offset = type_size(arrtype);
int tempreg = scratch_alloc();
printf("imul %s, %s, %d\n", scratch_name(tempreg), scratch_name(e->right->reg), offset);
printf("add %s, %s\n", scratch_name(e->left->reg), scratch_name(tempreg));
e->reg = e->left->reg;
scratch_free(tempreg);
scratch_free(e->right->reg);
//at the exit, e->reg contains the address of array element
}
void codegen_variable_reference(expr* e) {
e->reg = scratch_alloc();
switch (e->symbol->kind) {
case SYMBOL_LOCAL:
printf("lea %s, %s\n", scratch_name(e->reg), symbol_codegen(e->symbol, 1));
break;
case SYMBOL_GLOBAL:
printf("mov %s, %s\n", scratch_name(e->reg), symbol_codegen(e->symbol, 0));
break;
case SYMBOL_PARAM:
if (is_param_on_stack(e->symbol)) {
printf("lea %s, %s\n", scratch_name(e->reg), symbol_codegen(e->symbol, 1));
} else {
e->reg = regname_to_number(symbol_codegen(e->symbol, 0));
}
break;
}
//at the exit, e->reg contains the address of the name (var)
}
int count_args(expr* e) {
expr* arg = e->right;
int i = 0;
while (arg != NULL) {
arg = arg->right;
++i;
}
return i;
}
void print_global_array_elts(decl* d) {
type_t kind = d->type->subtype->kind;
if (kind != TYPE_INTEGER && kind != TYPE_CHARACTER && kind != TYPE_STRING && kind != TYPE_BOOLEAN) {
printf("Error: currently can init arrays with only literal strings, chars, bools, and ints. Cowardly exiting.\n");
exit(1);
}
expr* elt = d->value;
if (kind == TYPE_CHARACTER || kind == TYPE_BOOLEAN) printf("%s db ", d->name);
else printf("%s dq ", d->name);
int fst = 0;
while (elt != NULL) {
print_comma_unless_first_entry(&fst);
if (kind == TYPE_INTEGER || kind == TYPE_BOOLEAN) printf("%d", elt->left->literal_value);
else if (kind == TYPE_CHARACTER) printf("'%c'", (char) elt->left->literal_value);
else if (kind == TYPE_STRING) {
//linear search in string store...
char* key = NULL;
int* value = NULL;
hash_table_firstkey(string_store);
while (hash_table_nextkey(string_store, &key, (void**) &value)) {
if (!strcmp(key, elt->left->string_literal))
printf("%s", string_literal_codegen(key));
}
}
elt = elt->right;
}
printf("\n");
}
const char* rbp_offset(int offset) {
char* nlab = calloc((get_number_of_positions(offset) + 2), sizeof(char));
strcpy(nlab, "rbp");
if (offset == 0) return nlab;
if (offset > 0) {
nlab[3] = '+';
sprintf(nlab + 4, "%d", offset);
}
sprintf(nlab + 3, "%d", offset);
return nlab;
}
void codegen_program_preamble() {
printf("section .data\n");
printf("EXIT_SUCCESS equ 0\n");
printf("SYS_exit equ 60\n");
}
void codegen_program_epilogue() {
printf("last:\n");
printf("mov rax, SYS_exit\n");
printf("mov rdi, EXIT_SUCCESS\n");
printf("syscall\n");
}
void codegen_program_externs() {
printf("extern integer_power\n");
printf("extern print_integer\n");
printf("extern print_string\n");
printf("extern print_boolean\n");
printf("extern print_character\n");
}