-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcodegen.c
420 lines (377 loc) · 9.86 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
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
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
#include "compiler.h"
#include <stdarg.h>
#include <stdio.h>
#include "helpers/vector.h"
#include "assert.h"
static struct compile_process* current_process = NULL;
void
codegen_new_scope (int flags)
{
#warning "The resolver needs to exist for this to work."
}
void
codegen_finish_scope ()
{
#warning "The resolver needs to exist for this to work."
}
struct node*
codegen_node_next ()
{
return vector_peek_ptr (current_process->node_tree_vec);
}
void
asm_push_args (const char* insn, va_list args)
{
va_list args2;
va_copy (args2, args);
vfprintf (stdout, insn, args);
fprintf (stdout, "\n");
if (current_process->ofile)
{
vfprintf (current_process->ofile, insn, args2);
fprintf (current_process->ofile, "\n");
}
}
void
asm_push (const char* insn, ...)
{
va_list args;
va_start (args, insn);
asm_push_args (insn, args);
va_end (args);
}
void
asm_push_no_nl (const char* insn, ...)
{
va_list args;
va_start (args, insn);
vfprintf (stdout, insn, args);
va_end (args);
if (current_process->ofile)
{
va_list args;
va_start (args, insn);
vfprintf (current_process->ofile, insn, args);
va_end (args);
}
}
const char*
codegen_get_label_for_string (const char* str)
{
const char* result = NULL;
struct code_generator* generator = current_process->generator;
vector_set_peek_pointer (generator->string_table, 0);
struct string_table_element* current = \
vector_peek_ptr (generator->string_table);
while (current)
{
if (S_EQ (current->str, str))
{
result = current->label;
break;
}
current = vector_peek_ptr (generator->string_table);
}
return result;
}
const char*
codegen_register_string (const char* str)
{
const char* label = codegen_get_label_for_string (str);
if (label)
{
/* Already registered this string, just return
the label to the string memory. */
return label;
}
struct string_table_element* str_elem = \
calloc (1, sizeof (struct string_table_element));
int label_id = codegen_label_count ();
sprintf ((char*)str_elem->label, "str_%i", label_id);
str_elem->str = str;
vector_push (current_process->generator->string_table, &str_elem);
return str_elem->label;
}
struct code_generator*
codegenerator_new (struct compile_process* process)
{
struct code_generator* generator = \
calloc (1, sizeof (struct code_generator));
generator->string_table = \
vector_create (sizeof (struct string_table_element*));
generator->entry_points = \
vector_create (sizeof (struct codegen_entry_point*));
generator->exit_points = \
vector_create (sizeof (struct codegen_exit_point*));
return generator;
}
void
codegen_register_exit_point (int exit_point_id)
{
struct code_generator* gen = current_process->generator;
struct codegen_exit_point* exit_point = \
calloc (1, sizeof (struct codegen_exit_point));
exit_point->id = exit_point_id;
vector_push (gen->exit_points, &exit_point);
}
struct codegen_exit_point* codegen_current_exit_point ()
{
struct code_generator* gen = current_process->generator;
return vector_back_ptr_or_null (gen->exit_points);
}
int
codegen_label_count ()
{
static int count = 0;
return ++count;
}
void
codegen_begin_exit_point ()
{
int exit_point_id = codegen_label_count ();
codegen_register_exit_point (exit_point_id);
}
void
codegen_end_exit_point ()
{
struct code_generator* gen = current_process->generator;
struct codegen_exit_point* exit_point = codegen_current_exit_point ();
assert (exit_point);
asm_push (".exit_point_%i:", exit_point->id);
free (exit_point);
vector_pop (gen->exit_points);
}
void
codegen_goto_exit_point (struct node* node)
{
struct code_generator* gen = current_process->generator;
struct codegen_exit_point* exit_point = codegen_current_exit_point ();
asm_push ("jmp .exit_point_%i", exit_point->id);
}
void
codegen_register_entry_point (int entry_point_id)
{
struct code_generator* gen = current_process->generator;
struct codegen_entry_point* entry_point = \
calloc (1, sizeof (struct codegen_entry_point));
entry_point->id = entry_point_id;
vector_push (gen->entry_points, &entry_point);
}
struct codegen_entry_point*
codegen_current_entry_point ()
{
struct code_generator* gen = current_process->generator;
return vector_back_ptr_or_null (gen->entry_points);
}
void
codegen_begin_entry_point ()
{
int entry_point_id = codegen_label_count ();
codegen_register_entry_point (entry_point_id);
asm_push (".entry_point_%i", entry_point_id);
}
void
codegen_end_entry_point ()
{
struct code_generator* gen = current_process->generator;
struct codegen_entry_point* entry_point = codegen_current_entry_point ();
assert (entry_point);
free (entry_point);
vector_pop (gen->entry_points);
}
void
codegen_goto_entry_point (struct node* current_node)
{
struct code_generator* gen = current_process->generator;
struct codegen_entry_point* entry_point = codegen_current_entry_point ();
asm_push ("jmp .entry_point_%i", entry_point->id);
}
void
codegen_begin_entry_exit_point ()
{
codegen_begin_entry_point ();
codegen_begin_exit_point ();
}
void
codegen_end_entry_exit_point ()
{
codegen_end_entry_point ();
codegen_end_exit_point ();
}
static const char*
asm_keyword_for_size (size_t size, char* tmp_buf)
{
const char* keyword = NULL;
switch (size)
{
case DATA_SIZE_BYTE:
keyword = "db";
break;
case DATA_SIZE_WORD:
keyword = "dw";
break;
case DATA_SIZE_DWORD:
keyword = "dd";
break;
case DATA_SIZE_DDWORD:
keyword = "dq";
break;
default:
sprintf (tmp_buf, "times %lld db", (unsigned long) size);
return tmp_buf;
}
strcpy (tmp_buf, keyword);
return tmp_buf;
}
void
codegen_generate_global_variable_for_primitive (struct node* node)
{
char tmp_buf[256];
if (node->var.val != NULL)
{
/* Handle the value. */
if (node->var.val->type == NODE_TYPE_STRING)
{
#warning "Dont forget to handle the string value."
}
else
{
asm_push ("%s: %s %lld", node->var.name, \
asm_keyword_for_size (variable_size (node), tmp_buf), \
node->var.val->llnum);
}
}
else
{
asm_push ("%s: %s 0", node->var.name, \
asm_keyword_for_size (variable_size (node), tmp_buf));
}
}
void
codegen_generate_global_variable (struct node *node)
{
asm_push ("; %s %s", node->var.type.type_str, node->var.name);
switch (node->var.type.type)
{
case DATA_TYPE_VOID:
case DATA_TYPE_CHAR:
case DATA_TYPE_SHORT:
case DATA_TYPE_INTEGER:
case DATA_TYPE_LONG:
codegen_generate_global_variable_for_primitive (node);
break;
case DATA_TYPE_DOUBLE:
case DATA_TYPE_FLOAT:
compiler_error(current_process,
"Doubles and floats are not supported in our subset of C");
break;
}
}
void
codegen_generate_data_section_part (struct node* node)
{
/* Switch to process the global data.. */
switch (node->type)
{
case NODE_TYPE_VARIABLE:
codegen_generate_global_variable (node);
break;
}
}
void
codegen_generate_data_section ()
{
asm_push ("section .data");
struct node* node = NULL;
while ((node = codegen_node_next ()) != NULL)
{
codegen_generate_data_section_part (node);
}
}
void
codegen_generate_root_node (struct node* node)
{
/* Process any functions. */
}
void
codegen_generate_root ()
{
asm_push ("section .text");
struct node* node = NULL;
while ((node = codegen_node_next ()) != NULL)
{
codegen_generate_root_node (node);
}
}
bool
codegen_write_string_char_escaped (char c)
{
const char* c_out = NULL;
switch (c)
{
case '\n':
c_out = "10";
break;
case '\t':
c_out = "9";
break;
}
if (c_out)
{
asm_push_no_nl ("%s, ", c_out);
}
return c_out != NULL;
}
void
codegen_write_string (struct string_table_element* element)
{
asm_push_no_nl ("%s: db ", element->label);
size_t len = strlen (element->str);
for (int i = 0; i < len; i++)
{
char c = element->str[i];
bool handled = codegen_write_string_char_escaped (c);
if (handled)
{
continue;
}
asm_push_no_nl ("'%c', ", c);
}
asm_push_no_nl ("0");
asm_push ("");
}
void
codegen_write_strings ()
{
#warning "Loop through the string table and write all the strings"
struct code_generator* generator = current_process->generator;
vector_set_peek_pointer (generator->string_table, 0);
struct string_table_element* element = \
vector_peek_ptr (generator->string_table);
while (element)
{
codegen_write_string (element);
element = vector_peek_ptr (generator->string_table);
}
}
void
codegen_generate_readonly ()
{
asm_push ("section .rodata");
codegen_write_strings ();
}
int
codegen (struct compile_process* process)
{
current_process = process;
scope_create_root (process);
vector_set_peek_pointer (process->node_tree_vec, 0);
codegen_new_scope (0);
codegen_generate_data_section ();
vector_set_peek_pointer (process->node_tree_vec, 0);
codegen_generate_root ();
codegen_finish_scope ();
/* Generate read only data. */
codegen_generate_readonly ();
return 0;
}