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 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex);
95 ast_value* ast_value_copy(const ast_value *self)
98 const ast_expression_common *fromex;
99 ast_expression_common *selfex;
100 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
101 if (self->expression.next) {
102 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
103 if (!cp->expression.next) {
104 ast_value_delete(cp);
108 fromex = &self->expression;
109 selfex = &cp->expression;
110 for (i = 0; i < fromex->params_count; ++i) {
111 ast_value *v = ast_value_copy(fromex->params[i]);
112 if (!v || !ast_expression_common_params_add(selfex, v)) {
113 ast_value_delete(cp);
120 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
122 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
123 ast_expression_init(self, NULL);
124 self->expression.codegen = NULL;
125 self->expression.next = NULL;
126 self->expression.vtype = vtype;
130 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
133 const ast_expression_common *fromex;
134 ast_expression_common *selfex;
140 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
141 ast_expression_init(self, NULL);
143 fromex = &ex->expression;
144 selfex = &self->expression;
146 /* This may never be codegen()d */
147 selfex->codegen = NULL;
149 selfex->vtype = fromex->vtype;
152 selfex->next = ast_type_copy(ctx, fromex->next);
154 ast_expression_delete_full(self);
161 for (i = 0; i < fromex->params_count; ++i) {
162 ast_value *v = ast_value_copy(fromex->params[i]);
163 if (!v || !ast_expression_common_params_add(selfex, v)) {
164 ast_expression_delete_full(self);
173 bool ast_compare_type(ast_expression *a, ast_expression *b)
175 if (a->expression.vtype != b->expression.vtype)
177 if (!a->expression.next != !b->expression.next)
179 if (a->expression.params_count != b->expression.params_count)
181 if (a->expression.params_count) {
183 for (i = 0; i < a->expression.params_count; ++i) {
184 if (!ast_compare_type((ast_expression*)a->expression.params[i],
185 (ast_expression*)b->expression.params[i]))
189 if (a->expression.next)
190 return ast_compare_type(a->expression.next, b->expression.next);
194 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
196 ast_instantiate(ast_value, ctx, ast_value_delete);
197 ast_expression_init((ast_expression*)self,
198 (ast_expression_codegen*)&ast_value_codegen);
199 self->expression.node.keep = true; /* keep */
201 self->name = name ? util_strdup(name) : NULL;
202 self->expression.vtype = t;
203 self->expression.next = NULL;
204 self->isconst = false;
205 memset(&self->constval, 0, sizeof(self->constval));
212 void ast_value_delete(ast_value* self)
215 mem_d((void*)self->name);
217 switch (self->expression.vtype)
220 mem_d((void*)self->constval.vstring);
223 /* unlink us from the function node */
224 self->constval.vfunc->vtype = NULL;
226 /* NOTE: delete function? currently collected in
227 * the parser structure
233 ast_expression_delete((ast_expression*)self);
237 bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
239 return ast_expression_common_params_add(&self->expression, p);
242 bool ast_value_set_name(ast_value *self, const char *name)
245 mem_d((void*)self->name);
246 self->name = util_strdup(name);
250 ast_binary* ast_binary_new(lex_ctx ctx, int op,
251 ast_expression* left, ast_expression* right)
253 ast_instantiate(ast_binary, ctx, ast_binary_delete);
254 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
260 if (op >= INSTR_EQ_F && op <= INSTR_GT)
261 self->expression.vtype = TYPE_FLOAT;
262 else if (op == INSTR_AND || op == INSTR_OR ||
263 op == INSTR_BITAND || op == INSTR_BITOR)
264 self->expression.vtype = TYPE_FLOAT;
265 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
266 self->expression.vtype = TYPE_VECTOR;
267 else if (op == INSTR_MUL_V)
268 self->expression.vtype = TYPE_FLOAT;
270 self->expression.vtype = left->expression.vtype;
275 void ast_binary_delete(ast_binary *self)
277 ast_unref(self->left);
278 ast_unref(self->right);
279 ast_expression_delete((ast_expression*)self);
283 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
284 ast_expression* left, ast_expression* right)
286 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
287 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
289 self->opstore = storop;
292 self->source = right;
294 self->expression.vtype = left->expression.vtype;
295 if (left->expression.next) {
296 self->expression.next = ast_type_copy(ctx, left);
297 if (!self->expression.next) {
303 self->expression.next = NULL;
308 void ast_binstore_delete(ast_binstore *self)
310 ast_unref(self->dest);
311 ast_unref(self->source);
312 ast_expression_delete((ast_expression*)self);
316 ast_unary* ast_unary_new(lex_ctx ctx, int op,
317 ast_expression *expr)
319 ast_instantiate(ast_unary, ctx, ast_unary_delete);
320 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
323 self->operand = expr;
328 void ast_unary_delete(ast_unary *self)
330 ast_unref(self->operand);
331 ast_expression_delete((ast_expression*)self);
335 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
337 ast_instantiate(ast_return, ctx, ast_return_delete);
338 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
340 self->operand = expr;
345 void ast_return_delete(ast_return *self)
347 ast_unref(self->operand);
348 ast_expression_delete((ast_expression*)self);
352 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
354 const ast_expression *outtype;
356 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
358 if (field->expression.vtype != TYPE_FIELD) {
363 outtype = field->expression.next;
366 /* Error: field has no type... */
370 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
372 self->expression.vtype = outtype->expression.vtype;
373 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
375 self->entity = entity;
381 void ast_entfield_delete(ast_entfield *self)
383 ast_unref(self->entity);
384 ast_unref(self->field);
385 ast_expression_delete((ast_expression*)self);
389 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
391 ast_instantiate(ast_member, ctx, ast_member_delete);
397 if (owner->expression.vtype != TYPE_VECTOR &&
398 owner->expression.vtype != TYPE_FIELD) {
399 asterror(ctx, "member-access on an invalid owner of type %s\n", type_name[owner->expression.vtype]);
404 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
405 self->expression.node.keep = true; /* keep */
407 if (owner->expression.vtype == TYPE_VECTOR) {
408 self->expression.vtype = TYPE_FLOAT;
409 self->expression.next = NULL;
411 self->expression.vtype = TYPE_FIELD;
412 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
421 void ast_member_delete(ast_member *self)
423 /* The owner is always an ast_value, which has .keep=true,
424 * also: ast_members are usually deleted after the owner, thus
425 * this will cause invalid access
426 ast_unref(self->owner);
427 * once we allow (expression).x to access a vector-member, we need
428 * to change this: preferably by creating an alternate ast node for this
429 * purpose that is not garbage-collected.
431 ast_expression_delete((ast_expression*)self);
435 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
437 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
438 if (!ontrue && !onfalse) {
439 /* because it is invalid */
443 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
446 self->on_true = ontrue;
447 self->on_false = onfalse;
452 void ast_ifthen_delete(ast_ifthen *self)
454 ast_unref(self->cond);
456 ast_unref(self->on_true);
458 ast_unref(self->on_false);
459 ast_expression_delete((ast_expression*)self);
463 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
465 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
466 /* This time NEITHER must be NULL */
467 if (!ontrue || !onfalse) {
471 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
474 self->on_true = ontrue;
475 self->on_false = onfalse;
476 self->phi_out = NULL;
481 void ast_ternary_delete(ast_ternary *self)
483 ast_unref(self->cond);
484 ast_unref(self->on_true);
485 ast_unref(self->on_false);
486 ast_expression_delete((ast_expression*)self);
490 ast_loop* ast_loop_new(lex_ctx ctx,
491 ast_expression *initexpr,
492 ast_expression *precond,
493 ast_expression *postcond,
494 ast_expression *increment,
495 ast_expression *body)
497 ast_instantiate(ast_loop, ctx, ast_loop_delete);
498 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
500 self->initexpr = initexpr;
501 self->precond = precond;
502 self->postcond = postcond;
503 self->increment = increment;
509 void ast_loop_delete(ast_loop *self)
512 ast_unref(self->initexpr);
514 ast_unref(self->precond);
516 ast_unref(self->postcond);
518 ast_unref(self->increment);
520 ast_unref(self->body);
521 ast_expression_delete((ast_expression*)self);
525 ast_call* ast_call_new(lex_ctx ctx,
526 ast_expression *funcexpr)
528 ast_instantiate(ast_call, ctx, ast_call_delete);
529 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
531 MEM_VECTOR_INIT(self, params);
533 self->func = funcexpr;
537 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
539 void ast_call_delete(ast_call *self)
542 for (i = 0; i < self->params_count; ++i)
543 ast_unref(self->params[i]);
544 MEM_VECTOR_CLEAR(self, params);
547 ast_unref(self->func);
549 ast_expression_delete((ast_expression*)self);
553 ast_store* ast_store_new(lex_ctx ctx, int op,
554 ast_expression *dest, ast_expression *source)
556 ast_instantiate(ast_store, ctx, ast_store_delete);
557 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
561 self->source = source;
566 void ast_store_delete(ast_store *self)
568 ast_unref(self->dest);
569 ast_unref(self->source);
570 ast_expression_delete((ast_expression*)self);
574 ast_block* ast_block_new(lex_ctx ctx)
576 ast_instantiate(ast_block, ctx, ast_block_delete);
577 ast_expression_init((ast_expression*)self,
578 (ast_expression_codegen*)&ast_block_codegen);
580 MEM_VECTOR_INIT(self, locals);
581 MEM_VECTOR_INIT(self, exprs);
582 MEM_VECTOR_INIT(self, collect);
586 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
587 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
588 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, collect)
590 bool ast_block_collect(ast_block *self, ast_expression *expr)
592 if (!ast_block_collect_add(self, expr))
594 expr->expression.node.keep = true;
598 void ast_block_delete(ast_block *self)
601 for (i = 0; i < self->exprs_count; ++i)
602 ast_unref(self->exprs[i]);
603 MEM_VECTOR_CLEAR(self, exprs);
604 for (i = 0; i < self->locals_count; ++i)
605 ast_delete(self->locals[i]);
606 MEM_VECTOR_CLEAR(self, locals);
607 for (i = 0; i < self->collect_count; ++i)
608 ast_delete(self->collect[i]);
609 MEM_VECTOR_CLEAR(self, collect);
610 ast_expression_delete((ast_expression*)self);
614 bool ast_block_set_type(ast_block *self, ast_expression *from)
616 if (self->expression.next)
617 ast_delete(self->expression.next);
618 self->expression.vtype = from->expression.vtype;
619 if (from->expression.next) {
620 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
621 if (!self->expression.next)
625 self->expression.next = NULL;
629 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
631 ast_instantiate(ast_function, ctx, ast_function_delete);
635 vtype->expression.vtype != TYPE_FUNCTION)
642 self->name = name ? util_strdup(name) : NULL;
643 MEM_VECTOR_INIT(self, blocks);
645 self->labelcount = 0;
648 self->ir_func = NULL;
649 self->curblock = NULL;
651 self->breakblock = NULL;
652 self->continueblock = NULL;
654 vtype->isconst = true;
655 vtype->constval.vfunc = self;
660 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
662 void ast_function_delete(ast_function *self)
666 mem_d((void*)self->name);
668 /* ast_value_delete(self->vtype); */
669 self->vtype->isconst = false;
670 self->vtype->constval.vfunc = NULL;
671 /* We use unref - if it was stored in a global table it is supposed
672 * to be deleted from *there*
674 ast_unref(self->vtype);
676 for (i = 0; i < self->blocks_count; ++i)
677 ast_delete(self->blocks[i]);
678 MEM_VECTOR_CLEAR(self, blocks);
682 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
684 unsigned int base = 10;
685 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
686 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
695 int digit = num % base;
706 const char* ast_function_label(ast_function *self, const char *prefix)
708 size_t id = (self->labelcount++);
709 size_t len = strlen(prefix);
710 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
711 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
712 return self->labelbuf;
715 /*********************************************************************/
717 * by convention you must never pass NULL to the 'ir_value **out'
718 * parameter. If you really don't care about the output, pass a dummy.
719 * But I can't imagine a pituation where the output is truly unnecessary.
722 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
724 /* NOTE: This is the codegen for a variable used in an expression.
725 * It is not the codegen to generate the value. For this purpose,
726 * ast_local_codegen and ast_global_codegen are to be used before this
727 * is executed. ast_function_codegen should take care of its locals,
728 * and the ast-user should take care of ast_global_codegen to be used
729 * on all the globals.
732 asterror(ast_ctx(self), "ast_value used before generated (%s)\n", self->name);
739 bool ast_global_codegen(ast_value *self, ir_builder *ir)
742 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
744 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
748 self->constval.vfunc->ir_func = func;
749 self->ir_v = func->value;
750 /* The function is filled later on ast_function_codegen... */
754 if (self->expression.vtype == TYPE_FIELD) {
755 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
759 asterror(ast_ctx(self), "TODO: constant field pointers with value\n");
766 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
768 asterror(ast_ctx(self), "ir_builder_create_global failed\n");
773 switch (self->expression.vtype)
776 if (!ir_value_set_float(v, self->constval.vfloat))
780 if (!ir_value_set_vector(v, self->constval.vvec))
784 if (!ir_value_set_string(v, self->constval.vstring))
788 asterror(ast_ctx(self), "global of type function not properly generated\n");
790 /* Cannot generate an IR value for a function,
791 * need a pointer pointing to a function rather.
794 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
799 /* link us to the ir_value */
803 error: /* clean up */
808 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
811 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
813 /* Do we allow local functions? I think not...
814 * this is NOT a function pointer atm.
819 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
823 /* A constant local... hmmm...
824 * I suppose the IR will have to deal with this
827 switch (self->expression.vtype)
830 if (!ir_value_set_float(v, self->constval.vfloat))
834 if (!ir_value_set_vector(v, self->constval.vvec))
838 if (!ir_value_set_string(v, self->constval.vstring))
842 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
847 /* link us to the ir_value */
851 error: /* clean up */
856 bool ast_function_codegen(ast_function *self, ir_builder *ir)
860 ast_expression_common *ec;
865 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet\n");
869 /* fill the parameter list */
870 ec = &self->vtype->expression;
871 for (i = 0; i < ec->params_count; ++i)
873 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
875 if (!self->builtin) {
876 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
882 irf->builtin = self->builtin;
886 if (!self->blocks_count) {
887 asterror(ast_ctx(self), "function `%s` has no body", self->name);
891 self->curblock = ir_function_create_block(irf, "entry");
895 for (i = 0; i < self->blocks_count; ++i) {
896 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
897 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
901 /* TODO: check return types */
902 if (!self->curblock->is_return)
904 if (!self->vtype->expression.next ||
905 self->vtype->expression.next->expression.vtype == TYPE_VOID)
907 return ir_block_create_return(self->curblock, NULL);
911 /* error("missing return"); */
912 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
919 /* Note, you will not see ast_block_codegen generate ir_blocks.
920 * To the AST and the IR, blocks are 2 different things.
921 * In the AST it represents a block of code, usually enclosed in
922 * curly braces {...}.
923 * While in the IR it represents a block in terms of control-flow.
925 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
930 * Note: an ast-representation using the comma-operator
931 * of the form: (a, b, c) = x should not assign to c...
934 if (self->expression.outr) {
935 *out = self->expression.outr;
939 /* output is NULL at first, we'll have each expression
940 * assign to out output, thus, a comma-operator represention
941 * using an ast_block will return the last generated value,
942 * so: (b, c) + a executed both b and c, and returns c,
943 * which is then added to a.
947 /* generate locals */
948 for (i = 0; i < self->locals_count; ++i)
950 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
954 for (i = 0; i < self->exprs_count; ++i)
956 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
957 if (!(*gen)(self->exprs[i], func, false, out))
961 self->expression.outr = *out;
966 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
968 ast_expression_codegen *cgen;
969 ir_value *left, *right;
971 if (lvalue && self->expression.outl) {
972 *out = self->expression.outl;
976 if (!lvalue && self->expression.outr) {
977 *out = self->expression.outr;
981 cgen = self->dest->expression.codegen;
983 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
985 self->expression.outl = left;
987 cgen = self->source->expression.codegen;
989 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
992 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
994 self->expression.outr = right;
996 /* Theoretically, an assinment returns its left side as an
997 * lvalue, if we don't need an lvalue though, we return
998 * the right side as an rvalue, otherwise we have to
999 * somehow know whether or not we need to dereference the pointer
1000 * on the left side - that is: OP_LOAD if it was an address.
1001 * Also: in original QC we cannot OP_LOADP *anyway*.
1003 *out = (lvalue ? left : right);
1008 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1010 ast_expression_codegen *cgen;
1011 ir_value *left, *right;
1013 /* In the context of a binary operation, we can disregard
1017 if (self->expression.outr) {
1018 *out = self->expression.outr;
1022 cgen = self->left->expression.codegen;
1024 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1027 cgen = self->right->expression.codegen;
1029 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1032 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1033 self->op, left, right);
1036 self->expression.outr = *out;
1041 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1043 ast_expression_codegen *cgen;
1044 ir_value *leftl, *leftr, *right, *bin;
1046 if (lvalue && self->expression.outl) {
1047 *out = self->expression.outl;
1051 if (!lvalue && self->expression.outr) {
1052 *out = self->expression.outr;
1056 /* for a binstore we need both an lvalue and an rvalue for the left side */
1057 /* rvalue of destination! */
1058 cgen = self->dest->expression.codegen;
1059 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1062 /* source as rvalue only */
1063 cgen = self->source->expression.codegen;
1064 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1067 /* now the binary */
1068 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1069 self->opbin, leftr, right);
1070 self->expression.outr = bin;
1072 /* now store them */
1073 cgen = self->dest->expression.codegen;
1074 /* lvalue of destination */
1075 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1077 self->expression.outl = leftl;
1079 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1081 self->expression.outr = bin;
1083 /* Theoretically, an assinment returns its left side as an
1084 * lvalue, if we don't need an lvalue though, we return
1085 * the right side as an rvalue, otherwise we have to
1086 * somehow know whether or not we need to dereference the pointer
1087 * on the left side - that is: OP_LOAD if it was an address.
1088 * Also: in original QC we cannot OP_LOADP *anyway*.
1090 *out = (lvalue ? leftl : bin);
1095 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1097 ast_expression_codegen *cgen;
1100 /* In the context of a unary operation, we can disregard
1104 if (self->expression.outr) {
1105 *out = self->expression.outr;
1109 cgen = self->operand->expression.codegen;
1111 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1114 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1118 self->expression.outr = *out;
1123 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1125 ast_expression_codegen *cgen;
1128 /* In the context of a return operation, we can disregard
1132 if (self->expression.outr) {
1133 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!\n");
1136 self->expression.outr = (ir_value*)1;
1138 cgen = self->operand->expression.codegen;
1140 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1143 if (!ir_block_create_return(func->curblock, operand))
1149 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1151 ast_expression_codegen *cgen;
1152 ir_value *ent, *field;
1154 /* This function needs to take the 'lvalue' flag into account!
1155 * As lvalue we provide a field-pointer, as rvalue we provide the
1159 if (lvalue && self->expression.outl) {
1160 *out = self->expression.outl;
1164 if (!lvalue && self->expression.outr) {
1165 *out = self->expression.outr;
1169 cgen = self->entity->expression.codegen;
1170 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1173 cgen = self->field->expression.codegen;
1174 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1179 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1182 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1183 ent, field, self->expression.vtype);
1186 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1187 (lvalue ? "ADDRESS" : "FIELD"),
1188 type_name[self->expression.vtype]);
1193 self->expression.outl = *out;
1195 self->expression.outr = *out;
1197 /* Hm that should be it... */
1201 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1203 ast_expression_codegen *cgen;
1206 /* in QC this is always an lvalue */
1208 if (self->expression.outl) {
1209 *out = self->expression.outl;
1213 cgen = self->owner->expression.codegen;
1214 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1217 if (vec->vtype != TYPE_VECTOR &&
1218 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1223 *out = ir_value_vector_member(vec, self->field);
1224 self->expression.outl = *out;
1226 return (*out != NULL);
1229 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1231 ast_expression_codegen *cgen;
1236 ir_block *cond = func->curblock;
1241 /* We don't output any value, thus also don't care about r/lvalue */
1245 if (self->expression.outr) {
1246 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!\n");
1249 self->expression.outr = (ir_value*)1;
1251 /* generate the condition */
1252 func->curblock = cond;
1253 cgen = self->cond->expression.codegen;
1254 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1259 if (self->on_true) {
1260 /* create on-true block */
1261 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1265 /* enter the block */
1266 func->curblock = ontrue;
1269 cgen = self->on_true->expression.codegen;
1270 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1276 if (self->on_false) {
1277 /* create on-false block */
1278 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1282 /* enter the block */
1283 func->curblock = onfalse;
1286 cgen = self->on_false->expression.codegen;
1287 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1292 /* Merge block were they all merge in to */
1293 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1297 /* add jumps ot the merge block */
1298 if (ontrue && !ir_block_create_jump(ontrue, merge))
1300 if (onfalse && !ir_block_create_jump(onfalse, merge))
1303 /* we create the if here, that way all blocks are ordered :)
1305 if (!ir_block_create_if(cond, condval,
1306 (ontrue ? ontrue : merge),
1307 (onfalse ? onfalse : merge)))
1312 /* Now enter the merge block */
1313 func->curblock = merge;
1318 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1320 ast_expression_codegen *cgen;
1323 ir_value *trueval, *falseval;
1326 ir_block *cond = func->curblock;
1331 /* Ternary can never create an lvalue... */
1335 /* In theory it shouldn't be possible to pass through a node twice, but
1336 * in case we add any kind of optimization pass for the AST itself, it
1337 * may still happen, thus we remember a created ir_value and simply return one
1338 * if it already exists.
1340 if (self->phi_out) {
1341 *out = self->phi_out;
1345 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1347 /* generate the condition */
1348 func->curblock = cond;
1349 cgen = self->cond->expression.codegen;
1350 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1353 /* create on-true block */
1354 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1359 /* enter the block */
1360 func->curblock = ontrue;
1363 cgen = self->on_true->expression.codegen;
1364 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1368 /* create on-false block */
1369 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1374 /* enter the block */
1375 func->curblock = onfalse;
1378 cgen = self->on_false->expression.codegen;
1379 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1383 /* create merge block */
1384 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1387 /* jump to merge block */
1388 if (!ir_block_create_jump(ontrue, merge))
1390 if (!ir_block_create_jump(onfalse, merge))
1393 /* create if instruction */
1394 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1397 /* Now enter the merge block */
1398 func->curblock = merge;
1400 /* Here, now, we need a PHI node
1401 * but first some sanity checking...
1403 if (trueval->vtype != falseval->vtype) {
1404 /* error("ternary with different types on the two sides"); */
1409 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1411 !ir_phi_add(phi, ontrue, trueval) ||
1412 !ir_phi_add(phi, onfalse, falseval))
1417 self->phi_out = ir_phi_value(phi);
1418 *out = self->phi_out;
1423 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1425 ast_expression_codegen *cgen;
1427 ir_value *dummy = NULL;
1428 ir_value *precond = NULL;
1429 ir_value *postcond = NULL;
1431 /* Since we insert some jumps "late" so we have blocks
1432 * ordered "nicely", we need to keep track of the actual end-blocks
1433 * of expressions to add the jumps to.
1435 ir_block *bbody = NULL, *end_bbody = NULL;
1436 ir_block *bprecond = NULL, *end_bprecond = NULL;
1437 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1438 ir_block *bincrement = NULL, *end_bincrement = NULL;
1439 ir_block *bout = NULL, *bin = NULL;
1441 /* let's at least move the outgoing block to the end */
1444 /* 'break' and 'continue' need to be able to find the right blocks */
1445 ir_block *bcontinue = NULL;
1446 ir_block *bbreak = NULL;
1448 ir_block *old_bcontinue = NULL;
1449 ir_block *old_bbreak = NULL;
1451 ir_block *tmpblock = NULL;
1456 if (self->expression.outr) {
1457 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!\n");
1460 self->expression.outr = (ir_value*)1;
1463 * Should we ever need some kind of block ordering, better make this function
1464 * move blocks around than write a block ordering algorithm later... after all
1465 * the ast and ir should work together, not against each other.
1468 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1469 * anyway if for example it contains a ternary.
1473 cgen = self->initexpr->expression.codegen;
1474 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1478 /* Store the block from which we enter this chaos */
1479 bin = func->curblock;
1481 /* The pre-loop condition needs its own block since we
1482 * need to be able to jump to the start of that expression.
1486 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1490 /* the pre-loop-condition the least important place to 'continue' at */
1491 bcontinue = bprecond;
1494 func->curblock = bprecond;
1497 cgen = self->precond->expression.codegen;
1498 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1501 end_bprecond = func->curblock;
1503 bprecond = end_bprecond = NULL;
1506 /* Now the next blocks won't be ordered nicely, but we need to
1507 * generate them this early for 'break' and 'continue'.
1509 if (self->increment) {
1510 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1513 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1515 bincrement = end_bincrement = NULL;
1518 if (self->postcond) {
1519 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1522 bcontinue = bpostcond; /* postcond comes before the increment */
1524 bpostcond = end_bpostcond = NULL;
1527 bout_id = func->ir_func->blocks_count;
1528 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1533 /* The loop body... */
1536 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1541 func->curblock = bbody;
1543 old_bbreak = func->breakblock;
1544 old_bcontinue = func->continueblock;
1545 func->breakblock = bbreak;
1546 func->continueblock = bcontinue;
1549 cgen = self->body->expression.codegen;
1550 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1553 end_bbody = func->curblock;
1554 func->breakblock = old_bbreak;
1555 func->continueblock = old_bcontinue;
1558 /* post-loop-condition */
1562 func->curblock = bpostcond;
1565 cgen = self->postcond->expression.codegen;
1566 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1569 end_bpostcond = func->curblock;
1572 /* The incrementor */
1573 if (self->increment)
1576 func->curblock = bincrement;
1579 cgen = self->increment->expression.codegen;
1580 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1583 end_bincrement = func->curblock;
1586 /* In any case now, we continue from the outgoing block */
1587 func->curblock = bout;
1589 /* Now all blocks are in place */
1590 /* From 'bin' we jump to whatever comes first */
1591 if (bprecond) tmpblock = bprecond;
1592 else if (bbody) tmpblock = bbody;
1593 else if (bpostcond) tmpblock = bpostcond;
1594 else tmpblock = bout;
1595 if (!ir_block_create_jump(bin, tmpblock))
1601 ir_block *ontrue, *onfalse;
1602 if (bbody) ontrue = bbody;
1603 else if (bincrement) ontrue = bincrement;
1604 else if (bpostcond) ontrue = bpostcond;
1605 else ontrue = bprecond;
1607 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1614 if (bincrement) tmpblock = bincrement;
1615 else if (bpostcond) tmpblock = bpostcond;
1616 else if (bprecond) tmpblock = bprecond;
1617 else tmpblock = bout;
1618 if (!ir_block_create_jump(end_bbody, tmpblock))
1622 /* from increment */
1625 if (bpostcond) tmpblock = bpostcond;
1626 else if (bprecond) tmpblock = bprecond;
1627 else if (bbody) tmpblock = bbody;
1628 else tmpblock = bout;
1629 if (!ir_block_create_jump(end_bincrement, tmpblock))
1636 ir_block *ontrue, *onfalse;
1637 if (bprecond) ontrue = bprecond;
1638 else if (bbody) ontrue = bbody;
1639 else if (bincrement) ontrue = bincrement;
1640 else ontrue = bpostcond;
1642 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1646 /* Move 'bout' to the end */
1647 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1648 !ir_function_blocks_add(func->ir_func, bout))
1650 ir_block_delete(bout);
1657 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1659 ast_expression_codegen *cgen;
1660 ir_value_vector params;
1661 ir_instr *callinstr;
1664 ir_value *funval = NULL;
1666 /* return values are never lvalues */
1669 if (self->expression.outr) {
1670 *out = self->expression.outr;
1674 cgen = self->func->expression.codegen;
1675 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1680 MEM_VECTOR_INIT(¶ms, v);
1683 for (i = 0; i < self->params_count; ++i)
1686 ast_expression *expr = self->params[i];
1688 cgen = expr->expression.codegen;
1689 if (!(*cgen)(expr, func, false, ¶m))
1693 if (!ir_value_vector_v_add(¶ms, param))
1697 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1701 for (i = 0; i < params.v_count; ++i) {
1702 if (!ir_call_param(callinstr, params.v[i]))
1706 *out = ir_call_value(callinstr);
1707 self->expression.outr = *out;
1709 MEM_VECTOR_CLEAR(¶ms, v);
1712 MEM_VECTOR_CLEAR(¶ms, v);