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, TYPE_##T); \
36 ( (ast_node*)self )->node.destroy = (ast_node_delete*)destroyfn
39 static void asterror(lex_ctx ctx, const char *msg, ...)
43 cvprintmsg(ctx, LVL_ERROR, "error", msg, ap);
47 /* It must not be possible to get here. */
48 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
50 fprintf(stderr, "ast node missing destroy()\n");
54 /* Initialize main ast node aprts */
55 static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
57 self->node.context = ctx;
58 self->node.destroy = &_ast_node_destroy;
59 self->node.keep = false;
60 self->node.nodetype = nodetype;
63 /* General expression initialization */
64 static void ast_expression_init(ast_expression *self,
65 ast_expression_codegen *codegen)
67 self->expression.codegen = codegen;
68 self->expression.vtype = TYPE_VOID;
69 self->expression.next = NULL;
70 self->expression.outl = NULL;
71 self->expression.outr = NULL;
72 MEM_VECTOR_INIT(&self->expression, params);
75 static void ast_expression_delete(ast_expression *self)
78 if (self->expression.next)
79 ast_delete(self->expression.next);
80 for (i = 0; i < self->expression.params_count; ++i) {
81 ast_delete(self->expression.params[i]);
83 MEM_VECTOR_CLEAR(&self->expression, params);
86 static void ast_expression_delete_full(ast_expression *self)
88 ast_expression_delete(self);
92 MEM_VEC_FUNCTIONS(ast_expression_common, ast_value*, params)
94 ast_value* ast_value_copy(const ast_value *self)
97 const ast_expression_common *fromex;
98 ast_expression_common *selfex;
99 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
100 if (self->expression.next) {
101 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
102 if (!cp->expression.next) {
103 ast_value_delete(cp);
107 fromex = &self->expression;
108 selfex = &cp->expression;
109 for (i = 0; i < fromex->params_count; ++i) {
110 ast_value *v = ast_value_copy(fromex->params[i]);
111 if (!v || !ast_expression_common_params_add(selfex, v)) {
112 ast_value_delete(cp);
119 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
122 const ast_expression_common *fromex;
123 ast_expression_common *selfex;
124 self->expression.vtype = other->expression.vtype;
125 if (other->expression.next) {
126 self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
127 if (!self->expression.next)
130 fromex = &other->expression;
131 selfex = &self->expression;
132 for (i = 0; i < fromex->params_count; ++i) {
133 ast_value *v = ast_value_copy(fromex->params[i]);
134 if (!v || !ast_expression_common_params_add(selfex, v))
140 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
142 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
143 ast_expression_init(self, NULL);
144 self->expression.codegen = NULL;
145 self->expression.next = NULL;
146 self->expression.vtype = vtype;
150 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
153 const ast_expression_common *fromex;
154 ast_expression_common *selfex;
160 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
161 ast_expression_init(self, NULL);
163 fromex = &ex->expression;
164 selfex = &self->expression;
166 /* This may never be codegen()d */
167 selfex->codegen = NULL;
169 selfex->vtype = fromex->vtype;
172 selfex->next = ast_type_copy(ctx, fromex->next);
174 ast_expression_delete_full(self);
181 for (i = 0; i < fromex->params_count; ++i) {
182 ast_value *v = ast_value_copy(fromex->params[i]);
183 if (!v || !ast_expression_common_params_add(selfex, v)) {
184 ast_expression_delete_full(self);
193 bool ast_compare_type(ast_expression *a, ast_expression *b)
195 if (a->expression.vtype != b->expression.vtype)
197 if (!a->expression.next != !b->expression.next)
199 if (a->expression.params_count != b->expression.params_count)
201 if (a->expression.params_count) {
203 for (i = 0; i < a->expression.params_count; ++i) {
204 if (!ast_compare_type((ast_expression*)a->expression.params[i],
205 (ast_expression*)b->expression.params[i]))
209 if (a->expression.next)
210 return ast_compare_type(a->expression.next, b->expression.next);
214 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
216 ast_instantiate(ast_value, ctx, ast_value_delete);
217 ast_expression_init((ast_expression*)self,
218 (ast_expression_codegen*)&ast_value_codegen);
219 self->expression.node.keep = true; /* keep */
221 self->name = name ? util_strdup(name) : NULL;
222 self->expression.vtype = t;
223 self->expression.next = NULL;
224 self->isconst = false;
225 memset(&self->constval, 0, sizeof(self->constval));
232 void ast_value_delete(ast_value* self)
235 mem_d((void*)self->name);
237 switch (self->expression.vtype)
240 mem_d((void*)self->constval.vstring);
243 /* unlink us from the function node */
244 self->constval.vfunc->vtype = NULL;
246 /* NOTE: delete function? currently collected in
247 * the parser structure
253 ast_expression_delete((ast_expression*)self);
257 bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
259 return ast_expression_common_params_add(&self->expression, p);
262 bool ast_value_set_name(ast_value *self, const char *name)
265 mem_d((void*)self->name);
266 self->name = util_strdup(name);
270 ast_binary* ast_binary_new(lex_ctx ctx, int op,
271 ast_expression* left, ast_expression* right)
273 ast_instantiate(ast_binary, ctx, ast_binary_delete);
274 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
280 if (op >= INSTR_EQ_F && op <= INSTR_GT)
281 self->expression.vtype = TYPE_FLOAT;
282 else if (op == INSTR_AND || op == INSTR_OR ||
283 op == INSTR_BITAND || op == INSTR_BITOR)
284 self->expression.vtype = TYPE_FLOAT;
285 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
286 self->expression.vtype = TYPE_VECTOR;
287 else if (op == INSTR_MUL_V)
288 self->expression.vtype = TYPE_FLOAT;
290 self->expression.vtype = left->expression.vtype;
295 void ast_binary_delete(ast_binary *self)
297 ast_unref(self->left);
298 ast_unref(self->right);
299 ast_expression_delete((ast_expression*)self);
303 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
304 ast_expression* left, ast_expression* right)
306 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
307 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
309 self->opstore = storop;
312 self->source = right;
314 self->expression.vtype = left->expression.vtype;
315 if (left->expression.next) {
316 self->expression.next = ast_type_copy(ctx, left);
317 if (!self->expression.next) {
323 self->expression.next = NULL;
328 void ast_binstore_delete(ast_binstore *self)
330 ast_unref(self->dest);
331 ast_unref(self->source);
332 ast_expression_delete((ast_expression*)self);
336 ast_unary* ast_unary_new(lex_ctx ctx, int op,
337 ast_expression *expr)
339 ast_instantiate(ast_unary, ctx, ast_unary_delete);
340 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
343 self->operand = expr;
345 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
346 self->expression.vtype = TYPE_FLOAT;
348 asterror(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
353 void ast_unary_delete(ast_unary *self)
355 ast_unref(self->operand);
356 ast_expression_delete((ast_expression*)self);
360 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
362 ast_instantiate(ast_return, ctx, ast_return_delete);
363 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
365 self->operand = expr;
370 void ast_return_delete(ast_return *self)
373 ast_unref(self->operand);
374 ast_expression_delete((ast_expression*)self);
378 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
380 const ast_expression *outtype;
382 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
384 if (field->expression.vtype != TYPE_FIELD) {
389 outtype = field->expression.next;
392 /* Error: field has no type... */
396 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
398 self->entity = entity;
401 if (!ast_type_adopt(self, outtype)) {
402 ast_entfield_delete(self);
409 void ast_entfield_delete(ast_entfield *self)
411 ast_unref(self->entity);
412 ast_unref(self->field);
413 ast_expression_delete((ast_expression*)self);
417 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
419 ast_instantiate(ast_member, ctx, ast_member_delete);
425 if (owner->expression.vtype != TYPE_VECTOR &&
426 owner->expression.vtype != TYPE_FIELD) {
427 asterror(ctx, "member-access on an invalid owner of type %s\n", type_name[owner->expression.vtype]);
432 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
433 self->expression.node.keep = true; /* keep */
435 if (owner->expression.vtype == TYPE_VECTOR) {
436 self->expression.vtype = TYPE_FLOAT;
437 self->expression.next = NULL;
439 self->expression.vtype = TYPE_FIELD;
440 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
449 void ast_member_delete(ast_member *self)
451 /* The owner is always an ast_value, which has .keep=true,
452 * also: ast_members are usually deleted after the owner, thus
453 * this will cause invalid access
454 ast_unref(self->owner);
455 * once we allow (expression).x to access a vector-member, we need
456 * to change this: preferably by creating an alternate ast node for this
457 * purpose that is not garbage-collected.
459 ast_expression_delete((ast_expression*)self);
463 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
465 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
466 if (!ontrue && !onfalse) {
467 /* because it is invalid */
471 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
474 self->on_true = ontrue;
475 self->on_false = onfalse;
480 void ast_ifthen_delete(ast_ifthen *self)
482 ast_unref(self->cond);
484 ast_unref(self->on_true);
486 ast_unref(self->on_false);
487 ast_expression_delete((ast_expression*)self);
491 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
493 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
494 /* This time NEITHER must be NULL */
495 if (!ontrue || !onfalse) {
499 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
502 self->on_true = ontrue;
503 self->on_false = onfalse;
504 self->phi_out = NULL;
509 void ast_ternary_delete(ast_ternary *self)
511 ast_unref(self->cond);
512 ast_unref(self->on_true);
513 ast_unref(self->on_false);
514 ast_expression_delete((ast_expression*)self);
518 ast_loop* ast_loop_new(lex_ctx ctx,
519 ast_expression *initexpr,
520 ast_expression *precond,
521 ast_expression *postcond,
522 ast_expression *increment,
523 ast_expression *body)
525 ast_instantiate(ast_loop, ctx, ast_loop_delete);
526 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
528 self->initexpr = initexpr;
529 self->precond = precond;
530 self->postcond = postcond;
531 self->increment = increment;
537 void ast_loop_delete(ast_loop *self)
540 ast_unref(self->initexpr);
542 ast_unref(self->precond);
544 ast_unref(self->postcond);
546 ast_unref(self->increment);
548 ast_unref(self->body);
549 ast_expression_delete((ast_expression*)self);
553 ast_call* ast_call_new(lex_ctx ctx,
554 ast_expression *funcexpr)
556 ast_instantiate(ast_call, ctx, ast_call_delete);
557 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
559 MEM_VECTOR_INIT(self, params);
561 self->func = funcexpr;
563 self->expression.vtype = funcexpr->expression.next->expression.vtype;
564 if (funcexpr->expression.next->expression.next)
565 self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
569 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
571 void ast_call_delete(ast_call *self)
574 for (i = 0; i < self->params_count; ++i)
575 ast_unref(self->params[i]);
576 MEM_VECTOR_CLEAR(self, params);
579 ast_unref(self->func);
581 ast_expression_delete((ast_expression*)self);
585 ast_store* ast_store_new(lex_ctx ctx, int op,
586 ast_expression *dest, ast_expression *source)
588 ast_instantiate(ast_store, ctx, ast_store_delete);
589 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
593 self->source = source;
598 void ast_store_delete(ast_store *self)
600 ast_unref(self->dest);
601 ast_unref(self->source);
602 ast_expression_delete((ast_expression*)self);
606 ast_block* ast_block_new(lex_ctx ctx)
608 ast_instantiate(ast_block, ctx, ast_block_delete);
609 ast_expression_init((ast_expression*)self,
610 (ast_expression_codegen*)&ast_block_codegen);
612 MEM_VECTOR_INIT(self, locals);
613 MEM_VECTOR_INIT(self, exprs);
614 MEM_VECTOR_INIT(self, collect);
618 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
619 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
620 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, collect)
622 bool ast_block_collect(ast_block *self, ast_expression *expr)
624 if (!ast_block_collect_add(self, expr))
626 expr->expression.node.keep = true;
630 void ast_block_delete(ast_block *self)
633 for (i = 0; i < self->exprs_count; ++i)
634 ast_unref(self->exprs[i]);
635 MEM_VECTOR_CLEAR(self, exprs);
636 for (i = 0; i < self->locals_count; ++i)
637 ast_delete(self->locals[i]);
638 MEM_VECTOR_CLEAR(self, locals);
639 for (i = 0; i < self->collect_count; ++i)
640 ast_delete(self->collect[i]);
641 MEM_VECTOR_CLEAR(self, collect);
642 ast_expression_delete((ast_expression*)self);
646 bool ast_block_set_type(ast_block *self, ast_expression *from)
648 if (self->expression.next)
649 ast_delete(self->expression.next);
650 self->expression.vtype = from->expression.vtype;
651 if (from->expression.next) {
652 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
653 if (!self->expression.next)
657 self->expression.next = NULL;
661 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
663 ast_instantiate(ast_function, ctx, ast_function_delete);
667 vtype->expression.vtype != TYPE_FUNCTION)
674 self->name = name ? util_strdup(name) : NULL;
675 MEM_VECTOR_INIT(self, blocks);
677 self->labelcount = 0;
680 self->ir_func = NULL;
681 self->curblock = NULL;
683 self->breakblock = NULL;
684 self->continueblock = NULL;
686 vtype->isconst = true;
687 vtype->constval.vfunc = self;
692 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
694 void ast_function_delete(ast_function *self)
698 mem_d((void*)self->name);
700 /* ast_value_delete(self->vtype); */
701 self->vtype->isconst = false;
702 self->vtype->constval.vfunc = NULL;
703 /* We use unref - if it was stored in a global table it is supposed
704 * to be deleted from *there*
706 ast_unref(self->vtype);
708 for (i = 0; i < self->blocks_count; ++i)
709 ast_delete(self->blocks[i]);
710 MEM_VECTOR_CLEAR(self, blocks);
714 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
716 unsigned int base = 10;
717 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
718 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
727 int digit = num % base;
738 const char* ast_function_label(ast_function *self, const char *prefix)
740 size_t id = (self->labelcount++);
741 size_t len = strlen(prefix);
742 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
743 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
744 return self->labelbuf;
747 /*********************************************************************/
749 * by convention you must never pass NULL to the 'ir_value **out'
750 * parameter. If you really don't care about the output, pass a dummy.
751 * But I can't imagine a pituation where the output is truly unnecessary.
754 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
756 /* NOTE: This is the codegen for a variable used in an expression.
757 * It is not the codegen to generate the value. For this purpose,
758 * ast_local_codegen and ast_global_codegen are to be used before this
759 * is executed. ast_function_codegen should take care of its locals,
760 * and the ast-user should take care of ast_global_codegen to be used
761 * on all the globals.
764 asterror(ast_ctx(self), "ast_value used before generated (%s)\n", self->name);
771 bool ast_global_codegen(ast_value *self, ir_builder *ir)
774 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
776 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
779 func->context = ast_ctx(self);
781 self->constval.vfunc->ir_func = func;
782 self->ir_v = func->value;
783 /* The function is filled later on ast_function_codegen... */
787 if (self->expression.vtype == TYPE_FIELD) {
788 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
791 v->context = ast_ctx(self);
793 asterror(ast_ctx(self), "TODO: constant field pointers with value\n");
800 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
802 asterror(ast_ctx(self), "ir_builder_create_global failed\n");
805 v->context = ast_ctx(self);
808 switch (self->expression.vtype)
811 if (!ir_value_set_float(v, self->constval.vfloat))
815 if (!ir_value_set_vector(v, self->constval.vvec))
819 if (!ir_value_set_string(v, self->constval.vstring))
823 asterror(ast_ctx(self), "global of type function not properly generated\n");
825 /* Cannot generate an IR value for a function,
826 * need a pointer pointing to a function rather.
829 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
834 /* link us to the ir_value */
838 error: /* clean up */
843 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
846 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
848 /* Do we allow local functions? I think not...
849 * this is NOT a function pointer atm.
854 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
857 v->context = ast_ctx(self);
859 /* A constant local... hmmm...
860 * I suppose the IR will have to deal with this
863 switch (self->expression.vtype)
866 if (!ir_value_set_float(v, self->constval.vfloat))
870 if (!ir_value_set_vector(v, self->constval.vvec))
874 if (!ir_value_set_string(v, self->constval.vstring))
878 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
883 /* link us to the ir_value */
887 error: /* clean up */
892 bool ast_function_codegen(ast_function *self, ir_builder *ir)
896 ast_expression_common *ec;
901 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet\n");
905 /* fill the parameter list */
906 ec = &self->vtype->expression;
907 for (i = 0; i < ec->params_count; ++i)
909 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
911 if (!self->builtin) {
912 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
918 irf->builtin = self->builtin;
922 if (!self->blocks_count) {
923 asterror(ast_ctx(self), "function `%s` has no body", self->name);
927 self->curblock = ir_function_create_block(irf, "entry");
931 for (i = 0; i < self->blocks_count; ++i) {
932 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
933 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
937 /* TODO: check return types */
938 if (!self->curblock->is_return)
940 return ir_block_create_return(self->curblock, NULL);
941 /* From now on the parser has to handle this situation */
943 if (!self->vtype->expression.next ||
944 self->vtype->expression.next->expression.vtype == TYPE_VOID)
946 return ir_block_create_return(self->curblock, NULL);
950 /* error("missing return"); */
951 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
959 /* Note, you will not see ast_block_codegen generate ir_blocks.
960 * To the AST and the IR, blocks are 2 different things.
961 * In the AST it represents a block of code, usually enclosed in
962 * curly braces {...}.
963 * While in the IR it represents a block in terms of control-flow.
965 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
970 * Note: an ast-representation using the comma-operator
971 * of the form: (a, b, c) = x should not assign to c...
974 if (self->expression.outr) {
975 *out = self->expression.outr;
979 /* output is NULL at first, we'll have each expression
980 * assign to out output, thus, a comma-operator represention
981 * using an ast_block will return the last generated value,
982 * so: (b, c) + a executed both b and c, and returns c,
983 * which is then added to a.
987 /* generate locals */
988 for (i = 0; i < self->locals_count; ++i)
990 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
994 for (i = 0; i < self->exprs_count; ++i)
996 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
997 if (!(*gen)(self->exprs[i], func, false, out))
1001 self->expression.outr = *out;
1006 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1008 ast_expression_codegen *cgen;
1009 ir_value *left, *right;
1011 if (lvalue && self->expression.outl) {
1012 *out = self->expression.outl;
1016 if (!lvalue && self->expression.outr) {
1017 *out = self->expression.outr;
1021 cgen = self->dest->expression.codegen;
1023 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1025 self->expression.outl = left;
1027 cgen = self->source->expression.codegen;
1029 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1032 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1034 self->expression.outr = right;
1036 /* Theoretically, an assinment returns its left side as an
1037 * lvalue, if we don't need an lvalue though, we return
1038 * the right side as an rvalue, otherwise we have to
1039 * somehow know whether or not we need to dereference the pointer
1040 * on the left side - that is: OP_LOAD if it was an address.
1041 * Also: in original QC we cannot OP_LOADP *anyway*.
1043 *out = (lvalue ? left : right);
1048 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1050 ast_expression_codegen *cgen;
1051 ir_value *left, *right;
1053 /* In the context of a binary operation, we can disregard
1057 if (self->expression.outr) {
1058 *out = self->expression.outr;
1062 cgen = self->left->expression.codegen;
1064 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1067 cgen = self->right->expression.codegen;
1069 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1072 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1073 self->op, left, right);
1076 self->expression.outr = *out;
1081 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1083 ast_expression_codegen *cgen;
1084 ir_value *leftl, *leftr, *right, *bin;
1086 if (lvalue && self->expression.outl) {
1087 *out = self->expression.outl;
1091 if (!lvalue && self->expression.outr) {
1092 *out = self->expression.outr;
1096 /* for a binstore we need both an lvalue and an rvalue for the left side */
1097 /* rvalue of destination! */
1098 cgen = self->dest->expression.codegen;
1099 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1102 /* source as rvalue only */
1103 cgen = self->source->expression.codegen;
1104 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1107 /* now the binary */
1108 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1109 self->opbin, leftr, right);
1110 self->expression.outr = bin;
1112 /* now store them */
1113 cgen = self->dest->expression.codegen;
1114 /* lvalue of destination */
1115 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1117 self->expression.outl = leftl;
1119 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1121 self->expression.outr = bin;
1123 /* Theoretically, an assinment returns its left side as an
1124 * lvalue, if we don't need an lvalue though, we return
1125 * the right side as an rvalue, otherwise we have to
1126 * somehow know whether or not we need to dereference the pointer
1127 * on the left side - that is: OP_LOAD if it was an address.
1128 * Also: in original QC we cannot OP_LOADP *anyway*.
1130 *out = (lvalue ? leftl : bin);
1135 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1137 ast_expression_codegen *cgen;
1140 /* In the context of a unary operation, we can disregard
1144 if (self->expression.outr) {
1145 *out = self->expression.outr;
1149 cgen = self->operand->expression.codegen;
1151 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1154 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1158 self->expression.outr = *out;
1163 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1165 ast_expression_codegen *cgen;
1168 /* In the context of a return operation, we can disregard
1172 if (self->expression.outr) {
1173 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!\n");
1176 self->expression.outr = (ir_value*)1;
1178 if (self->operand) {
1179 cgen = self->operand->expression.codegen;
1181 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1184 if (!ir_block_create_return(func->curblock, operand))
1187 if (!ir_block_create_return(func->curblock, NULL))
1194 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1196 ast_expression_codegen *cgen;
1197 ir_value *ent, *field;
1199 /* This function needs to take the 'lvalue' flag into account!
1200 * As lvalue we provide a field-pointer, as rvalue we provide the
1204 if (lvalue && self->expression.outl) {
1205 *out = self->expression.outl;
1209 if (!lvalue && self->expression.outr) {
1210 *out = self->expression.outr;
1214 cgen = self->entity->expression.codegen;
1215 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1218 cgen = self->field->expression.codegen;
1219 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1224 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1227 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1228 ent, field, self->expression.vtype);
1231 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1232 (lvalue ? "ADDRESS" : "FIELD"),
1233 type_name[self->expression.vtype]);
1238 self->expression.outl = *out;
1240 self->expression.outr = *out;
1242 /* Hm that should be it... */
1246 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1248 ast_expression_codegen *cgen;
1251 /* in QC this is always an lvalue */
1253 if (self->expression.outl) {
1254 *out = self->expression.outl;
1258 cgen = self->owner->expression.codegen;
1259 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1262 if (vec->vtype != TYPE_VECTOR &&
1263 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1268 *out = ir_value_vector_member(vec, self->field);
1269 self->expression.outl = *out;
1271 return (*out != NULL);
1274 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1276 ast_expression_codegen *cgen;
1281 ir_block *cond = func->curblock;
1284 ir_block *ontrue_endblock;
1285 ir_block *onfalse_endblock;
1288 /* We don't output any value, thus also don't care about r/lvalue */
1292 if (self->expression.outr) {
1293 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!\n");
1296 self->expression.outr = (ir_value*)1;
1298 /* generate the condition */
1299 func->curblock = cond;
1300 cgen = self->cond->expression.codegen;
1301 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1306 if (self->on_true) {
1307 /* create on-true block */
1308 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1312 /* enter the block */
1313 func->curblock = ontrue;
1316 cgen = self->on_true->expression.codegen;
1317 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1320 /* we now need to work from the current endpoint */
1321 ontrue_endblock = func->curblock;
1326 if (self->on_false) {
1327 /* create on-false block */
1328 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1332 /* enter the block */
1333 func->curblock = onfalse;
1336 cgen = self->on_false->expression.codegen;
1337 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1340 /* we now need to work from the current endpoint */
1341 onfalse_endblock = func->curblock;
1345 /* Merge block were they all merge in to */
1346 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1350 /* add jumps ot the merge block */
1351 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
1353 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
1356 /* we create the if here, that way all blocks are ordered :)
1358 if (!ir_block_create_if(cond, condval,
1359 (ontrue ? ontrue : merge),
1360 (onfalse ? onfalse : merge)))
1365 /* Now enter the merge block */
1366 func->curblock = merge;
1371 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1373 ast_expression_codegen *cgen;
1376 ir_value *trueval, *falseval;
1379 ir_block *cond = func->curblock;
1384 /* Ternary can never create an lvalue... */
1388 /* In theory it shouldn't be possible to pass through a node twice, but
1389 * in case we add any kind of optimization pass for the AST itself, it
1390 * may still happen, thus we remember a created ir_value and simply return one
1391 * if it already exists.
1393 if (self->phi_out) {
1394 *out = self->phi_out;
1398 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1400 /* generate the condition */
1401 func->curblock = cond;
1402 cgen = self->cond->expression.codegen;
1403 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1406 /* create on-true block */
1407 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1412 /* enter the block */
1413 func->curblock = ontrue;
1416 cgen = self->on_true->expression.codegen;
1417 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1421 /* create on-false block */
1422 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1427 /* enter the block */
1428 func->curblock = onfalse;
1431 cgen = self->on_false->expression.codegen;
1432 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1436 /* create merge block */
1437 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1440 /* jump to merge block */
1441 if (!ir_block_create_jump(ontrue, merge))
1443 if (!ir_block_create_jump(onfalse, merge))
1446 /* create if instruction */
1447 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1450 /* Now enter the merge block */
1451 func->curblock = merge;
1453 /* Here, now, we need a PHI node
1454 * but first some sanity checking...
1456 if (trueval->vtype != falseval->vtype) {
1457 /* error("ternary with different types on the two sides"); */
1462 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1464 !ir_phi_add(phi, ontrue, trueval) ||
1465 !ir_phi_add(phi, onfalse, falseval))
1470 self->phi_out = ir_phi_value(phi);
1471 *out = self->phi_out;
1476 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1478 ast_expression_codegen *cgen;
1480 ir_value *dummy = NULL;
1481 ir_value *precond = NULL;
1482 ir_value *postcond = NULL;
1484 /* Since we insert some jumps "late" so we have blocks
1485 * ordered "nicely", we need to keep track of the actual end-blocks
1486 * of expressions to add the jumps to.
1488 ir_block *bbody = NULL, *end_bbody = NULL;
1489 ir_block *bprecond = NULL, *end_bprecond = NULL;
1490 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1491 ir_block *bincrement = NULL, *end_bincrement = NULL;
1492 ir_block *bout = NULL, *bin = NULL;
1494 /* let's at least move the outgoing block to the end */
1497 /* 'break' and 'continue' need to be able to find the right blocks */
1498 ir_block *bcontinue = NULL;
1499 ir_block *bbreak = NULL;
1501 ir_block *old_bcontinue = NULL;
1502 ir_block *old_bbreak = NULL;
1504 ir_block *tmpblock = NULL;
1509 if (self->expression.outr) {
1510 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!\n");
1513 self->expression.outr = (ir_value*)1;
1516 * Should we ever need some kind of block ordering, better make this function
1517 * move blocks around than write a block ordering algorithm later... after all
1518 * the ast and ir should work together, not against each other.
1521 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1522 * anyway if for example it contains a ternary.
1526 cgen = self->initexpr->expression.codegen;
1527 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1531 /* Store the block from which we enter this chaos */
1532 bin = func->curblock;
1534 /* The pre-loop condition needs its own block since we
1535 * need to be able to jump to the start of that expression.
1539 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1543 /* the pre-loop-condition the least important place to 'continue' at */
1544 bcontinue = bprecond;
1547 func->curblock = bprecond;
1550 cgen = self->precond->expression.codegen;
1551 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1554 end_bprecond = func->curblock;
1556 bprecond = end_bprecond = NULL;
1559 /* Now the next blocks won't be ordered nicely, but we need to
1560 * generate them this early for 'break' and 'continue'.
1562 if (self->increment) {
1563 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1566 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1568 bincrement = end_bincrement = NULL;
1571 if (self->postcond) {
1572 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1575 bcontinue = bpostcond; /* postcond comes before the increment */
1577 bpostcond = end_bpostcond = NULL;
1580 bout_id = func->ir_func->blocks_count;
1581 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1586 /* The loop body... */
1589 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1594 func->curblock = bbody;
1596 old_bbreak = func->breakblock;
1597 old_bcontinue = func->continueblock;
1598 func->breakblock = bbreak;
1599 func->continueblock = bcontinue;
1602 cgen = self->body->expression.codegen;
1603 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1606 end_bbody = func->curblock;
1607 func->breakblock = old_bbreak;
1608 func->continueblock = old_bcontinue;
1611 /* post-loop-condition */
1615 func->curblock = bpostcond;
1618 cgen = self->postcond->expression.codegen;
1619 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1622 end_bpostcond = func->curblock;
1625 /* The incrementor */
1626 if (self->increment)
1629 func->curblock = bincrement;
1632 cgen = self->increment->expression.codegen;
1633 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1636 end_bincrement = func->curblock;
1639 /* In any case now, we continue from the outgoing block */
1640 func->curblock = bout;
1642 /* Now all blocks are in place */
1643 /* From 'bin' we jump to whatever comes first */
1644 if (bprecond) tmpblock = bprecond;
1645 else if (bbody) tmpblock = bbody;
1646 else if (bpostcond) tmpblock = bpostcond;
1647 else tmpblock = bout;
1648 if (!ir_block_create_jump(bin, tmpblock))
1654 ir_block *ontrue, *onfalse;
1655 if (bbody) ontrue = bbody;
1656 else if (bincrement) ontrue = bincrement;
1657 else if (bpostcond) ontrue = bpostcond;
1658 else ontrue = bprecond;
1660 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1667 if (bincrement) tmpblock = bincrement;
1668 else if (bpostcond) tmpblock = bpostcond;
1669 else if (bprecond) tmpblock = bprecond;
1670 else tmpblock = bout;
1671 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
1675 /* from increment */
1678 if (bpostcond) tmpblock = bpostcond;
1679 else if (bprecond) tmpblock = bprecond;
1680 else if (bbody) tmpblock = bbody;
1681 else tmpblock = bout;
1682 if (!ir_block_create_jump(end_bincrement, tmpblock))
1689 ir_block *ontrue, *onfalse;
1690 if (bprecond) ontrue = bprecond;
1691 else if (bbody) ontrue = bbody;
1692 else if (bincrement) ontrue = bincrement;
1693 else ontrue = bpostcond;
1695 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1699 /* Move 'bout' to the end */
1700 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1701 !ir_function_blocks_add(func->ir_func, bout))
1703 ir_block_delete(bout);
1710 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1712 ast_expression_codegen *cgen;
1713 ir_value_vector params;
1714 ir_instr *callinstr;
1717 ir_value *funval = NULL;
1719 /* return values are never lvalues */
1722 if (self->expression.outr) {
1723 *out = self->expression.outr;
1727 cgen = self->func->expression.codegen;
1728 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1733 MEM_VECTOR_INIT(¶ms, v);
1736 for (i = 0; i < self->params_count; ++i)
1739 ast_expression *expr = self->params[i];
1741 cgen = expr->expression.codegen;
1742 if (!(*cgen)(expr, func, false, ¶m))
1746 if (!ir_value_vector_v_add(¶ms, param))
1750 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1754 for (i = 0; i < params.v_count; ++i) {
1755 if (!ir_call_param(callinstr, params.v[i]))
1759 *out = ir_call_value(callinstr);
1760 self->expression.outr = *out;
1762 MEM_VECTOR_CLEAR(¶ms, v);
1765 MEM_VECTOR_CLEAR(¶ms, v);