5 * Permission is hereby granted, free of charge, to any person obtaining a copy of
6 * this software and associated documentation files (the "Software"), to deal in
7 * the Software without restriction, including without limitation the rights to
8 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
9 * of the Software, and to permit persons to whom the Software is furnished to do
10 * so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in all
13 * copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30 #define ast_instantiate(T, ctx, destroyfn) \
31 T* self = (T*)mem_a(sizeof(T)); \
35 ast_node_init((ast_node*)self, ctx); \
36 ( (ast_node*)self )->node.destroy = (ast_node_delete*)destroyfn
38 /* It must not be possible to get here. */
39 static void _ast_node_destroy(ast_node *self)
41 fprintf(stderr, "ast node missing destroy()\n");
45 /* Initialize main ast node aprts */
46 static void ast_node_init(ast_node *self, lex_ctx ctx)
48 self->node.context = ctx;
49 self->node.destroy = &_ast_node_destroy;
50 self->node.keep = false;
53 /* General expression initialization */
54 static void ast_expression_init(ast_expression *self,
55 ast_expression_codegen *codegen)
57 self->expression.codegen = codegen;
58 self->expression.vtype = TYPE_VOID;
59 self->expression.next = NULL;
62 static void ast_expression_delete(ast_expression *self)
64 if (self->expression.next)
65 ast_delete(self->expression.next);
68 static void ast_expression_delete_full(ast_expression *self)
70 ast_expression_delete(self);
74 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
76 const ast_expression_common *cpex;
77 ast_expression_common *selfex;
83 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
85 cpex = &ex->expression;
86 selfex = &self->expression;
88 selfex->vtype = cpex->vtype;
91 selfex->next = ast_type_copy(ctx, cpex->next);
100 /* This may never be codegen()d */
101 selfex->codegen = NULL;
106 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
108 ast_instantiate(ast_value, ctx, ast_value_delete);
109 ast_expression_init((ast_expression*)self,
110 (ast_expression_codegen*)&ast_value_codegen);
111 self->expression.node.keep = true; /* keep */
113 self->name = name ? util_strdup(name) : NULL;
114 self->expression.vtype = t;
115 self->expression.next = NULL;
116 MEM_VECTOR_INIT(self, params);
117 self->isconst = false;
118 memset(&self->constval, 0, sizeof(self->constval));
124 MEM_VEC_FUNCTIONS(ast_value, ast_value*, params)
126 void ast_value_delete(ast_value* self)
130 mem_d((void*)self->name);
131 for (i = 0; i < self->params_count; ++i)
132 ast_value_delete(self->params[i]); /* delete, the ast_function is expected to die first */
133 MEM_VECTOR_CLEAR(self, params);
135 switch (self->expression.vtype)
138 mem_d((void*)self->constval.vstring);
141 /* unlink us from the function node */
142 self->constval.vfunc->vtype = NULL;
144 /* NOTE: delete function? currently collected in
145 * the parser structure
151 ast_expression_delete((ast_expression*)self);
155 bool ast_value_set_name(ast_value *self, const char *name)
158 mem_d((void*)self->name);
159 self->name = util_strdup(name);
163 ast_binary* ast_binary_new(lex_ctx ctx, int op,
164 ast_expression* left, ast_expression* right)
166 ast_instantiate(ast_binary, ctx, ast_binary_delete);
167 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
176 void ast_binary_delete(ast_binary *self)
178 ast_unref(self->left);
179 ast_unref(self->right);
180 ast_expression_delete((ast_expression*)self);
184 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
186 const ast_expression *outtype;
188 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
190 if (field->expression.vtype != TYPE_FIELD) {
195 outtype = field->expression.next;
198 /* Error: field has no type... */
202 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
204 self->expression.vtype = outtype->expression.vtype;
205 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
207 self->entity = entity;
213 void ast_entfield_delete(ast_entfield *self)
215 ast_unref(self->entity);
216 ast_unref(self->field);
217 ast_expression_delete((ast_expression*)self);
221 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
223 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
224 if (!ontrue && !onfalse) {
225 /* because it is invalid */
229 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
232 self->on_true = ontrue;
233 self->on_false = onfalse;
238 void ast_ifthen_delete(ast_ifthen *self)
240 ast_unref(self->cond);
242 ast_unref(self->on_true);
244 ast_unref(self->on_false);
245 ast_expression_delete((ast_expression*)self);
249 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
251 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
252 /* This time NEITHER must be NULL */
253 if (!ontrue || !onfalse) {
257 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
260 self->on_true = ontrue;
261 self->on_false = onfalse;
262 self->phi_out = NULL;
267 void ast_ternary_delete(ast_ternary *self)
269 ast_unref(self->cond);
270 ast_unref(self->on_true);
271 ast_unref(self->on_false);
272 ast_expression_delete((ast_expression*)self);
276 ast_loop* ast_loop_new(lex_ctx ctx,
277 ast_expression *initexpr,
278 ast_expression *precond,
279 ast_expression *postcond,
280 ast_expression *increment)
282 ast_instantiate(ast_loop, ctx, ast_loop_delete);
283 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
285 self->initexpr = initexpr;
286 self->precond = precond;
287 self->postcond = postcond;
288 self->increment = increment;
293 void ast_loop_delete(ast_loop *self)
296 ast_unref(self->initexpr);
298 ast_unref(self->precond);
300 ast_unref(self->postcond);
302 ast_unref(self->increment);
303 ast_expression_delete((ast_expression*)self);
307 ast_store* ast_store_new(lex_ctx ctx, int op,
308 ast_value *dest, ast_expression *source)
310 ast_instantiate(ast_store, ctx, ast_store_delete);
311 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
315 self->source = source;
320 void ast_store_delete(ast_store *self)
322 ast_unref(self->dest);
323 ast_unref(self->source);
324 ast_expression_delete((ast_expression*)self);
328 ast_block* ast_block_new(lex_ctx ctx)
330 ast_instantiate(ast_block, ctx, ast_block_delete);
331 ast_expression_init((ast_expression*)self,
332 (ast_expression_codegen*)&ast_block_codegen);
334 MEM_VECTOR_INIT(self, locals);
335 MEM_VECTOR_INIT(self, exprs);
339 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
340 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
342 void ast_block_delete(ast_block *self)
345 for (i = 0; i < self->exprs_count; ++i)
346 ast_unref(self->exprs[i]);
347 MEM_VECTOR_CLEAR(self, exprs);
348 for (i = 0; i < self->locals_count; ++i)
349 ast_delete(self->locals[i]);
350 MEM_VECTOR_CLEAR(self, locals);
351 ast_expression_delete((ast_expression*)self);
355 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
357 ast_instantiate(ast_function, ctx, ast_function_delete);
361 vtype->expression.vtype != TYPE_FUNCTION)
368 self->name = name ? util_strdup(name) : NULL;
369 MEM_VECTOR_INIT(self, blocks);
371 self->labelcount = 0;
373 self->ir_func = NULL;
374 self->curblock = NULL;
376 vtype->isconst = true;
377 vtype->constval.vfunc = self;
382 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
384 void ast_function_delete(ast_function *self)
388 mem_d((void*)self->name);
390 /* ast_value_delete(self->vtype); */
391 self->vtype->isconst = false;
392 self->vtype->constval.vfunc = NULL;
393 /* We use unref - if it was stored in a global table it is supposed
394 * to be deleted from *there*
396 ast_unref(self->vtype);
398 for (i = 0; i < self->blocks_count; ++i)
399 ast_delete(self->blocks[i]);
400 MEM_VECTOR_CLEAR(self, blocks);
404 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
406 unsigned int base = 10;
407 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
408 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
417 int digit = num % base;
428 const char* ast_function_label(ast_function *self, const char *prefix)
430 size_t id = (self->labelcount++);
431 size_t len = strlen(prefix);
432 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
433 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
434 return self->labelbuf;
437 /*********************************************************************/
439 * by convention you must never pass NULL to the 'ir_value **out'
440 * parameter. If you really don't care about the output, pass a dummy.
441 * But I can't imagine a pituation where the output is truly unnecessary.
444 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
446 /* NOTE: This is the codegen for a variable used in an expression.
447 * It is not the codegen to generate the value. For this purpose,
448 * ast_local_codegen and ast_global_codegen are to be used before this
449 * is executed. ast_function_codegen should take care of its locals,
450 * and the ast-user should take care of ast_global_codegen to be used
451 * on all the globals.
459 bool ast_global_codegen(ast_value *self, ir_builder *ir)
462 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
464 ir_function *func = ir_builder_create_function(ir, self->name);
468 self->constval.vfunc->ir_func = func;
469 /* The function is filled later on ast_function_codegen... */
473 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
478 switch (self->expression.vtype)
481 if (!ir_value_set_float(v, self->constval.vfloat))
485 if (!ir_value_set_vector(v, self->constval.vvec))
489 if (!ir_value_set_string(v, self->constval.vstring))
493 /* Cannot generate an IR value for a function,
494 * need a pointer pointing to a function rather.
498 printf("TODO: global constant type %i\n", self->expression.vtype);
503 /* link us to the ir_value */
507 error: /* clean up */
512 bool ast_local_codegen(ast_value *self, ir_function *func)
515 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
517 /* Do we allow local functions? I think not...
518 * this is NOT a function pointer atm.
523 v = ir_function_create_local(func, self->name, self->expression.vtype);
527 /* A constant local... hmmm...
528 * I suppose the IR will have to deal with this
531 switch (self->expression.vtype)
534 if (!ir_value_set_float(v, self->constval.vfloat))
538 if (!ir_value_set_vector(v, self->constval.vvec))
542 if (!ir_value_set_string(v, self->constval.vstring))
546 printf("TODO: global constant type %i\n", self->expression.vtype);
551 /* link us to the ir_value */
555 error: /* clean up */
560 bool ast_function_codegen(ast_function *self, ir_builder *ir)
568 printf("ast_function's related ast_value was not generated yet\n");
572 self->curblock = ir_function_create_block(irf, "entry");
576 for (i = 0; i < self->blocks_count; ++i) {
577 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
578 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
582 /* TODO: check return types */
583 if (!self->curblock->is_return)
585 if (!self->vtype->expression.next ||
586 self->vtype->expression.next->expression.vtype == TYPE_VOID)
587 return ir_block_create_return(self->curblock, NULL);
590 /* error("missing return"); */
597 /* Note, you will not see ast_block_codegen generate ir_blocks.
598 * To the AST and the IR, blocks are 2 different things.
599 * In the AST it represents a block of code, usually enclosed in
600 * curly braces {...}.
601 * While in the IR it represents a block in terms of control-flow.
603 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
608 * Note: an ast-representation using the comma-operator
609 * of the form: (a, b, c) = x should not assign to c...
613 /* output is NULL at first, we'll have each expression
614 * assign to out output, thus, a comma-operator represention
615 * using an ast_block will return the last generated value,
616 * so: (b, c) + a executed both b and c, and returns c,
617 * which is then added to a.
621 /* generate locals */
622 for (i = 0; i < self->locals_count; ++i)
624 if (!ast_local_codegen(self->locals[i], func->ir_func))
628 for (i = 0; i < self->exprs_count; ++i)
630 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
631 if (!(*gen)(self->exprs[i], func, false, out))
638 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
640 ast_expression_codegen *cgen;
641 ir_value *left, *right;
643 cgen = self->dest->expression.codegen;
645 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
648 cgen = self->source->expression.codegen;
650 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
653 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
656 /* Theoretically, an assinment returns its left side as an
657 * lvalue, if we don't need an lvalue though, we return
658 * the right side as an rvalue, otherwise we have to
659 * somehow know whether or not we need to dereference the pointer
660 * on the left side - that is: OP_LOAD if it was an address.
661 * Also: in original QC we cannot OP_LOADP *anyway*.
663 *out = (lvalue ? left : right);
668 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
670 ast_expression_codegen *cgen;
671 ir_value *left, *right;
673 /* In the context of a binary operation, we can disregard
678 cgen = self->left->expression.codegen;
680 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
683 cgen = self->right->expression.codegen;
685 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
688 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
689 self->op, left, right);
696 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
698 ast_expression_codegen *cgen;
699 ir_value *ent, *field;
701 /* This function needs to take the 'lvalue' flag into account!
702 * As lvalue we provide a field-pointer, as rvalue we provide the
706 cgen = self->entity->expression.codegen;
707 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
710 cgen = self->field->expression.codegen;
711 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
716 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
719 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
720 ent, field, self->expression.vtype);
725 /* Hm that should be it... */
729 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
731 ast_expression_codegen *cgen;
736 ir_block *cond = func->curblock;
741 /* We don't output any value, thus also don't care about r/lvalue */
745 /* generate the condition */
746 func->curblock = cond;
747 cgen = self->cond->expression.codegen;
748 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
754 /* create on-true block */
755 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
759 /* enter the block */
760 func->curblock = ontrue;
763 cgen = self->on_true->expression.codegen;
764 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
770 if (self->on_false) {
771 /* create on-false block */
772 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
776 /* enter the block */
777 func->curblock = onfalse;
780 cgen = self->on_false->expression.codegen;
781 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
786 /* Merge block were they all merge in to */
787 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
791 /* add jumps ot the merge block */
792 if (ontrue && !ir_block_create_jump(ontrue, merge))
794 if (onfalse && !ir_block_create_jump(onfalse, merge))
797 /* we create the if here, that way all blocks are ordered :)
799 if (!ir_block_create_if(cond, condval,
800 (ontrue ? ontrue : merge),
801 (onfalse ? onfalse : merge)))
806 /* Now enter the merge block */
807 func->curblock = merge;
812 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
814 ast_expression_codegen *cgen;
817 ir_value *trueval, *falseval;
820 ir_block *cond = func->curblock;
825 /* In theory it shouldn't be possible to pass through a node twice, but
826 * in case we add any kind of optimization pass for the AST itself, it
827 * may still happen, thus we remember a created ir_value and simply return one
828 * if it already exists.
831 *out = self->phi_out;
835 /* Ternary can never create an lvalue... */
839 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
841 /* create on-true block */
842 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
846 /* create on-false block */
847 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
851 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
855 /* generate the condition */
856 func->curblock = cond;
857 cgen = self->cond->expression.codegen;
858 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
861 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
865 /* enter the block */
866 func->curblock = ontrue;
869 cgen = self->on_true->expression.codegen;
870 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
873 /* jump to merge block */
874 if (!ir_block_create_jump(ontrue, merge))
878 /* enter the block */
879 func->curblock = onfalse;
882 cgen = self->on_false->expression.codegen;
883 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
886 /* jump to merge block */
887 if (!ir_block_create_jump(ontrue, merge))
890 /* Now enter the merge block */
891 func->curblock = merge;
893 /* Here, now, we need a PHI node
894 * but first some sanity checking...
896 if (trueval->vtype != falseval->vtype) {
897 /* error("ternary with different types on the two sides"); */
902 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
904 !ir_phi_add(phi, ontrue, trueval) ||
905 !ir_phi_add(phi, onfalse, falseval))
910 self->phi_out = ir_phi_value(phi);
911 *out = self->phi_out;
916 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
918 ast_expression_codegen *cgen;
926 ir_block *bincrement;