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 static ast_value* ast_value_copy(const ast_value *self)
97 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
98 if (self->expression.next) {
99 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
100 if (!cp->expression.next) {
101 ast_value_delete(cp);
108 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
110 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
111 self->expression.codegen = NULL;
112 self->expression.next = NULL;
113 self->expression.vtype = vtype;
117 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
120 const ast_expression_common *fromex;
121 ast_expression_common *selfex;
127 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
129 fromex = &ex->expression;
130 selfex = &self->expression;
132 /* This may never be codegen()d */
133 selfex->codegen = NULL;
135 selfex->vtype = fromex->vtype;
138 selfex->next = ast_type_copy(ctx, fromex->next);
140 ast_expression_delete_full(self);
147 for (i = 0; i < fromex->params_count; ++i) {
148 ast_value *v = ast_value_copy(fromex->params[i]);
149 if (!v || !ast_expression_common_params_add(selfex, v)) {
150 ast_expression_delete_full(self);
159 bool ast_compare_type(ast_expression *a, ast_expression *b)
161 if (a->expression.vtype != b->expression.vtype)
163 if (!a->expression.next != !b->expression.next)
165 if (a->expression.params_count != b->expression.params_count)
167 if (a->expression.params_count) {
169 for (i = 0; i < a->expression.params_count; ++i) {
170 if (!ast_compare_type((ast_expression*)a->expression.params[i],
171 (ast_expression*)b->expression.params[i]))
175 if (a->expression.next)
176 return ast_compare_type(a->expression.next, b->expression.next);
180 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
182 ast_instantiate(ast_value, ctx, ast_value_delete);
183 ast_expression_init((ast_expression*)self,
184 (ast_expression_codegen*)&ast_value_codegen);
185 self->expression.node.keep = true; /* keep */
187 self->name = name ? util_strdup(name) : NULL;
188 self->expression.vtype = t;
189 self->expression.next = NULL;
190 self->isconst = false;
191 memset(&self->constval, 0, sizeof(self->constval));
198 void ast_value_delete(ast_value* self)
201 mem_d((void*)self->name);
203 switch (self->expression.vtype)
206 mem_d((void*)self->constval.vstring);
209 /* unlink us from the function node */
210 self->constval.vfunc->vtype = NULL;
212 /* NOTE: delete function? currently collected in
213 * the parser structure
219 ast_expression_delete((ast_expression*)self);
223 bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
225 return ast_expression_common_params_add(&self->expression, p);
228 bool ast_value_set_name(ast_value *self, const char *name)
231 mem_d((void*)self->name);
232 self->name = util_strdup(name);
236 ast_binary* ast_binary_new(lex_ctx ctx, int op,
237 ast_expression* left, ast_expression* right)
239 ast_instantiate(ast_binary, ctx, ast_binary_delete);
240 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
246 if (op >= INSTR_EQ_F && op <= INSTR_GT)
247 self->expression.vtype = TYPE_FLOAT;
248 else if (op == INSTR_AND || op == INSTR_OR ||
249 op == INSTR_BITAND || op == INSTR_BITOR)
250 self->expression.vtype = TYPE_FLOAT;
251 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
252 self->expression.vtype = TYPE_VECTOR;
253 else if (op == INSTR_MUL_V)
254 self->expression.vtype = TYPE_FLOAT;
256 self->expression.vtype = left->expression.vtype;
261 void ast_binary_delete(ast_binary *self)
263 ast_unref(self->left);
264 ast_unref(self->right);
265 ast_expression_delete((ast_expression*)self);
269 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
270 ast_expression* left, ast_expression* right)
272 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
273 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
275 self->opstore = storop;
278 self->source = right;
280 self->expression.vtype = left->expression.vtype;
281 if (left->expression.next) {
282 self->expression.next = ast_type_copy(ctx, left);
283 if (!self->expression.next) {
289 self->expression.next = NULL;
294 void ast_binstore_delete(ast_binstore *self)
296 ast_unref(self->dest);
297 ast_unref(self->source);
298 ast_expression_delete((ast_expression*)self);
302 ast_unary* ast_unary_new(lex_ctx ctx, int op,
303 ast_expression *expr)
305 ast_instantiate(ast_unary, ctx, ast_unary_delete);
306 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
309 self->operand = expr;
314 void ast_unary_delete(ast_unary *self)
316 ast_unref(self->operand);
317 ast_expression_delete((ast_expression*)self);
321 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
323 ast_instantiate(ast_return, ctx, ast_return_delete);
324 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
326 self->operand = expr;
331 void ast_return_delete(ast_return *self)
333 ast_unref(self->operand);
334 ast_expression_delete((ast_expression*)self);
338 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
340 const ast_expression *outtype;
342 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
344 if (field->expression.vtype != TYPE_FIELD) {
349 outtype = field->expression.next;
352 /* Error: field has no type... */
356 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
358 self->expression.vtype = outtype->expression.vtype;
359 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
361 self->entity = entity;
367 void ast_entfield_delete(ast_entfield *self)
369 ast_unref(self->entity);
370 ast_unref(self->field);
371 ast_expression_delete((ast_expression*)self);
375 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
377 ast_instantiate(ast_member, ctx, ast_member_delete);
383 if (owner->expression.vtype != TYPE_VECTOR &&
384 owner->expression.vtype != TYPE_FIELD) {
385 asterror(ctx, "member-access on an invalid owner of type %s\n", type_name[owner->expression.vtype]);
390 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
392 if (owner->expression.vtype == TYPE_VECTOR) {
393 self->expression.vtype = TYPE_FLOAT;
394 self->expression.next = NULL;
396 self->expression.vtype = TYPE_FIELD;
397 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
406 void ast_member_delete(ast_member *self)
408 ast_unref(self->owner);
409 ast_expression_delete((ast_expression*)self);
413 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
415 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
416 if (!ontrue && !onfalse) {
417 /* because it is invalid */
421 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
424 self->on_true = ontrue;
425 self->on_false = onfalse;
430 void ast_ifthen_delete(ast_ifthen *self)
432 ast_unref(self->cond);
434 ast_unref(self->on_true);
436 ast_unref(self->on_false);
437 ast_expression_delete((ast_expression*)self);
441 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
443 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
444 /* This time NEITHER must be NULL */
445 if (!ontrue || !onfalse) {
449 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
452 self->on_true = ontrue;
453 self->on_false = onfalse;
454 self->phi_out = NULL;
459 void ast_ternary_delete(ast_ternary *self)
461 ast_unref(self->cond);
462 ast_unref(self->on_true);
463 ast_unref(self->on_false);
464 ast_expression_delete((ast_expression*)self);
468 ast_loop* ast_loop_new(lex_ctx ctx,
469 ast_expression *initexpr,
470 ast_expression *precond,
471 ast_expression *postcond,
472 ast_expression *increment,
473 ast_expression *body)
475 ast_instantiate(ast_loop, ctx, ast_loop_delete);
476 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
478 self->initexpr = initexpr;
479 self->precond = precond;
480 self->postcond = postcond;
481 self->increment = increment;
487 void ast_loop_delete(ast_loop *self)
490 ast_unref(self->initexpr);
492 ast_unref(self->precond);
494 ast_unref(self->postcond);
496 ast_unref(self->increment);
498 ast_unref(self->body);
499 ast_expression_delete((ast_expression*)self);
503 ast_call* ast_call_new(lex_ctx ctx,
504 ast_expression *funcexpr)
506 ast_instantiate(ast_call, ctx, ast_call_delete);
507 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
509 MEM_VECTOR_INIT(self, params);
511 self->func = funcexpr;
515 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
517 void ast_call_delete(ast_call *self)
520 for (i = 0; i < self->params_count; ++i)
521 ast_unref(self->params[i]);
522 MEM_VECTOR_CLEAR(self, params);
525 ast_unref(self->func);
527 ast_expression_delete((ast_expression*)self);
531 ast_store* ast_store_new(lex_ctx ctx, int op,
532 ast_expression *dest, ast_expression *source)
534 ast_instantiate(ast_store, ctx, ast_store_delete);
535 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
539 self->source = source;
544 void ast_store_delete(ast_store *self)
546 ast_unref(self->dest);
547 ast_unref(self->source);
548 ast_expression_delete((ast_expression*)self);
552 ast_block* ast_block_new(lex_ctx ctx)
554 ast_instantiate(ast_block, ctx, ast_block_delete);
555 ast_expression_init((ast_expression*)self,
556 (ast_expression_codegen*)&ast_block_codegen);
558 MEM_VECTOR_INIT(self, locals);
559 MEM_VECTOR_INIT(self, exprs);
563 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
564 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
566 void ast_block_delete(ast_block *self)
569 for (i = 0; i < self->exprs_count; ++i)
570 ast_unref(self->exprs[i]);
571 MEM_VECTOR_CLEAR(self, exprs);
572 for (i = 0; i < self->locals_count; ++i)
573 ast_delete(self->locals[i]);
574 MEM_VECTOR_CLEAR(self, locals);
575 ast_expression_delete((ast_expression*)self);
579 bool ast_block_set_type(ast_block *self, ast_expression *from)
581 if (self->expression.next)
582 ast_delete(self->expression.next);
583 self->expression.vtype = from->expression.vtype;
584 if (from->expression.next) {
585 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
586 if (!self->expression.next)
592 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
594 ast_instantiate(ast_function, ctx, ast_function_delete);
598 vtype->expression.vtype != TYPE_FUNCTION)
605 self->name = name ? util_strdup(name) : NULL;
606 MEM_VECTOR_INIT(self, blocks);
608 self->labelcount = 0;
611 self->ir_func = NULL;
612 self->curblock = NULL;
614 self->breakblock = NULL;
615 self->continueblock = NULL;
617 vtype->isconst = true;
618 vtype->constval.vfunc = self;
623 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
625 void ast_function_delete(ast_function *self)
629 mem_d((void*)self->name);
631 /* ast_value_delete(self->vtype); */
632 self->vtype->isconst = false;
633 self->vtype->constval.vfunc = NULL;
634 /* We use unref - if it was stored in a global table it is supposed
635 * to be deleted from *there*
637 ast_unref(self->vtype);
639 for (i = 0; i < self->blocks_count; ++i)
640 ast_delete(self->blocks[i]);
641 MEM_VECTOR_CLEAR(self, blocks);
645 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
647 unsigned int base = 10;
648 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
649 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
658 int digit = num % base;
669 const char* ast_function_label(ast_function *self, const char *prefix)
671 size_t id = (self->labelcount++);
672 size_t len = strlen(prefix);
673 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
674 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
675 return self->labelbuf;
678 /*********************************************************************/
680 * by convention you must never pass NULL to the 'ir_value **out'
681 * parameter. If you really don't care about the output, pass a dummy.
682 * But I can't imagine a pituation where the output is truly unnecessary.
685 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
687 /* NOTE: This is the codegen for a variable used in an expression.
688 * It is not the codegen to generate the value. For this purpose,
689 * ast_local_codegen and ast_global_codegen are to be used before this
690 * is executed. ast_function_codegen should take care of its locals,
691 * and the ast-user should take care of ast_global_codegen to be used
692 * on all the globals.
695 asterror(ast_ctx(self), "ast_value used before generated (%s)\n", self->name);
702 bool ast_global_codegen(ast_value *self, ir_builder *ir)
705 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
707 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
711 self->constval.vfunc->ir_func = func;
712 self->ir_v = func->value;
713 /* The function is filled later on ast_function_codegen... */
717 if (self->expression.vtype == TYPE_FIELD) {
718 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
722 asterror(ast_ctx(self), "TODO: constant field pointers with value\n");
729 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
731 asterror(ast_ctx(self), "ir_builder_create_global failed\n");
736 switch (self->expression.vtype)
739 if (!ir_value_set_float(v, self->constval.vfloat))
743 if (!ir_value_set_vector(v, self->constval.vvec))
747 if (!ir_value_set_string(v, self->constval.vstring))
751 asterror(ast_ctx(self), "global of type function not properly generated\n");
753 /* Cannot generate an IR value for a function,
754 * need a pointer pointing to a function rather.
757 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
762 /* link us to the ir_value */
766 error: /* clean up */
771 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
774 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
776 /* Do we allow local functions? I think not...
777 * this is NOT a function pointer atm.
782 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
786 /* A constant local... hmmm...
787 * I suppose the IR will have to deal with this
790 switch (self->expression.vtype)
793 if (!ir_value_set_float(v, self->constval.vfloat))
797 if (!ir_value_set_vector(v, self->constval.vvec))
801 if (!ir_value_set_string(v, self->constval.vstring))
805 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
810 /* link us to the ir_value */
814 error: /* clean up */
819 bool ast_function_codegen(ast_function *self, ir_builder *ir)
823 ast_expression_common *ec;
828 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet\n");
832 /* fill the parameter list */
833 ec = &self->vtype->expression;
834 for (i = 0; i < ec->params_count; ++i)
836 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
838 if (!self->builtin) {
839 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
845 irf->builtin = self->builtin;
849 if (!self->blocks_count) {
850 asterror(ast_ctx(self), "function `%s` has no body", self->name);
854 self->curblock = ir_function_create_block(irf, "entry");
858 for (i = 0; i < self->blocks_count; ++i) {
859 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
860 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
864 /* TODO: check return types */
865 if (!self->curblock->is_return)
867 if (!self->vtype->expression.next ||
868 self->vtype->expression.next->expression.vtype == TYPE_VOID)
870 return ir_block_create_return(self->curblock, NULL);
874 /* error("missing return"); */
875 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
882 /* Note, you will not see ast_block_codegen generate ir_blocks.
883 * To the AST and the IR, blocks are 2 different things.
884 * In the AST it represents a block of code, usually enclosed in
885 * curly braces {...}.
886 * While in the IR it represents a block in terms of control-flow.
888 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
893 * Note: an ast-representation using the comma-operator
894 * of the form: (a, b, c) = x should not assign to c...
897 if (self->expression.outr) {
898 *out = self->expression.outr;
902 /* output is NULL at first, we'll have each expression
903 * assign to out output, thus, a comma-operator represention
904 * using an ast_block will return the last generated value,
905 * so: (b, c) + a executed both b and c, and returns c,
906 * which is then added to a.
910 /* generate locals */
911 for (i = 0; i < self->locals_count; ++i)
913 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
917 for (i = 0; i < self->exprs_count; ++i)
919 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
920 if (!(*gen)(self->exprs[i], func, false, out))
924 self->expression.outr = *out;
929 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
931 ast_expression_codegen *cgen;
932 ir_value *left, *right;
934 if (lvalue && self->expression.outl) {
935 *out = self->expression.outl;
939 if (!lvalue && self->expression.outr) {
940 *out = self->expression.outr;
944 cgen = self->dest->expression.codegen;
946 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
948 self->expression.outl = left;
950 cgen = self->source->expression.codegen;
952 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
955 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
957 self->expression.outr = right;
959 /* Theoretically, an assinment returns its left side as an
960 * lvalue, if we don't need an lvalue though, we return
961 * the right side as an rvalue, otherwise we have to
962 * somehow know whether or not we need to dereference the pointer
963 * on the left side - that is: OP_LOAD if it was an address.
964 * Also: in original QC we cannot OP_LOADP *anyway*.
966 *out = (lvalue ? left : right);
971 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
973 ast_expression_codegen *cgen;
974 ir_value *left, *right;
976 /* In the context of a binary operation, we can disregard
980 if (self->expression.outr) {
981 *out = self->expression.outr;
985 cgen = self->left->expression.codegen;
987 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
990 cgen = self->right->expression.codegen;
992 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
995 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
996 self->op, left, right);
999 self->expression.outr = *out;
1004 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1006 ast_expression_codegen *cgen;
1007 ir_value *leftl, *leftr, *right, *bin;
1009 if (lvalue && self->expression.outl) {
1010 *out = self->expression.outl;
1014 if (!lvalue && self->expression.outr) {
1015 *out = self->expression.outr;
1019 /* for a binstore we need both an lvalue and an rvalue for the left side */
1020 /* rvalue of destination! */
1021 cgen = self->dest->expression.codegen;
1022 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1025 /* source as rvalue only */
1026 cgen = self->source->expression.codegen;
1027 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1030 /* now the binary */
1031 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1032 self->opbin, leftr, right);
1033 self->expression.outr = bin;
1035 /* now store them */
1036 cgen = self->dest->expression.codegen;
1037 /* lvalue of destination */
1038 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1040 self->expression.outl = leftl;
1042 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1044 self->expression.outr = bin;
1046 /* Theoretically, an assinment returns its left side as an
1047 * lvalue, if we don't need an lvalue though, we return
1048 * the right side as an rvalue, otherwise we have to
1049 * somehow know whether or not we need to dereference the pointer
1050 * on the left side - that is: OP_LOAD if it was an address.
1051 * Also: in original QC we cannot OP_LOADP *anyway*.
1053 *out = (lvalue ? leftl : bin);
1058 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1060 ast_expression_codegen *cgen;
1063 /* In the context of a unary operation, we can disregard
1067 if (self->expression.outr) {
1068 *out = self->expression.outr;
1072 cgen = self->operand->expression.codegen;
1074 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1077 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1081 self->expression.outr = *out;
1086 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1088 ast_expression_codegen *cgen;
1091 /* In the context of a return operation, we can disregard
1095 if (self->expression.outr) {
1096 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!\n");
1099 self->expression.outr = (ir_value*)1;
1101 cgen = self->operand->expression.codegen;
1103 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1106 if (!ir_block_create_return(func->curblock, operand))
1112 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1114 ast_expression_codegen *cgen;
1115 ir_value *ent, *field;
1117 /* This function needs to take the 'lvalue' flag into account!
1118 * As lvalue we provide a field-pointer, as rvalue we provide the
1122 if (lvalue && self->expression.outl) {
1123 *out = self->expression.outl;
1127 if (!lvalue && self->expression.outr) {
1128 *out = self->expression.outr;
1132 cgen = self->entity->expression.codegen;
1133 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1136 cgen = self->field->expression.codegen;
1137 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1142 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1145 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1146 ent, field, self->expression.vtype);
1152 self->expression.outl = *out;
1154 self->expression.outr = *out;
1156 /* Hm that should be it... */
1160 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1162 ast_expression_codegen *cgen;
1165 /* in QC this is always an lvalue */
1167 if (self->expression.outl) {
1168 *out = self->expression.outl;
1172 cgen = self->owner->expression.codegen;
1173 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1176 if (vec->vtype != TYPE_VECTOR &&
1177 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1182 *out = ir_value_vector_member(vec, self->field);
1183 self->expression.outl = *out;
1185 return (*out != NULL);
1188 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1190 ast_expression_codegen *cgen;
1195 ir_block *cond = func->curblock;
1200 /* We don't output any value, thus also don't care about r/lvalue */
1204 if (self->expression.outr) {
1205 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!\n");
1208 self->expression.outr = (ir_value*)1;
1210 /* generate the condition */
1211 func->curblock = cond;
1212 cgen = self->cond->expression.codegen;
1213 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1218 if (self->on_true) {
1219 /* create on-true block */
1220 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1224 /* enter the block */
1225 func->curblock = ontrue;
1228 cgen = self->on_true->expression.codegen;
1229 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1235 if (self->on_false) {
1236 /* create on-false block */
1237 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1241 /* enter the block */
1242 func->curblock = onfalse;
1245 cgen = self->on_false->expression.codegen;
1246 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1251 /* Merge block were they all merge in to */
1252 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1256 /* add jumps ot the merge block */
1257 if (ontrue && !ir_block_create_jump(ontrue, merge))
1259 if (onfalse && !ir_block_create_jump(onfalse, merge))
1262 /* we create the if here, that way all blocks are ordered :)
1264 if (!ir_block_create_if(cond, condval,
1265 (ontrue ? ontrue : merge),
1266 (onfalse ? onfalse : merge)))
1271 /* Now enter the merge block */
1272 func->curblock = merge;
1277 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1279 ast_expression_codegen *cgen;
1282 ir_value *trueval, *falseval;
1285 ir_block *cond = func->curblock;
1290 /* Ternary can never create an lvalue... */
1294 /* In theory it shouldn't be possible to pass through a node twice, but
1295 * in case we add any kind of optimization pass for the AST itself, it
1296 * may still happen, thus we remember a created ir_value and simply return one
1297 * if it already exists.
1299 if (self->phi_out) {
1300 *out = self->phi_out;
1304 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1306 /* generate the condition */
1307 func->curblock = cond;
1308 cgen = self->cond->expression.codegen;
1309 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1312 /* create on-true block */
1313 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1318 /* enter the block */
1319 func->curblock = ontrue;
1322 cgen = self->on_true->expression.codegen;
1323 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1327 /* create on-false block */
1328 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1333 /* enter the block */
1334 func->curblock = onfalse;
1337 cgen = self->on_false->expression.codegen;
1338 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1342 /* create merge block */
1343 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1346 /* jump to merge block */
1347 if (!ir_block_create_jump(ontrue, merge))
1349 if (!ir_block_create_jump(onfalse, merge))
1352 /* create if instruction */
1353 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1356 /* Now enter the merge block */
1357 func->curblock = merge;
1359 /* Here, now, we need a PHI node
1360 * but first some sanity checking...
1362 if (trueval->vtype != falseval->vtype) {
1363 /* error("ternary with different types on the two sides"); */
1368 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1370 !ir_phi_add(phi, ontrue, trueval) ||
1371 !ir_phi_add(phi, onfalse, falseval))
1376 self->phi_out = ir_phi_value(phi);
1377 *out = self->phi_out;
1382 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1384 ast_expression_codegen *cgen;
1386 ir_value *dummy = NULL;
1387 ir_value *precond = NULL;
1388 ir_value *postcond = NULL;
1390 /* Since we insert some jumps "late" so we have blocks
1391 * ordered "nicely", we need to keep track of the actual end-blocks
1392 * of expressions to add the jumps to.
1394 ir_block *bbody = NULL, *end_bbody = NULL;
1395 ir_block *bprecond = NULL, *end_bprecond = NULL;
1396 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1397 ir_block *bincrement = NULL, *end_bincrement = NULL;
1398 ir_block *bout = NULL, *bin = NULL;
1400 /* let's at least move the outgoing block to the end */
1403 /* 'break' and 'continue' need to be able to find the right blocks */
1404 ir_block *bcontinue = NULL;
1405 ir_block *bbreak = NULL;
1407 ir_block *old_bcontinue = NULL;
1408 ir_block *old_bbreak = NULL;
1410 ir_block *tmpblock = NULL;
1415 if (self->expression.outr) {
1416 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!\n");
1419 self->expression.outr = (ir_value*)1;
1422 * Should we ever need some kind of block ordering, better make this function
1423 * move blocks around than write a block ordering algorithm later... after all
1424 * the ast and ir should work together, not against each other.
1427 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1428 * anyway if for example it contains a ternary.
1432 cgen = self->initexpr->expression.codegen;
1433 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1437 /* Store the block from which we enter this chaos */
1438 bin = func->curblock;
1440 /* The pre-loop condition needs its own block since we
1441 * need to be able to jump to the start of that expression.
1445 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1449 /* the pre-loop-condition the least important place to 'continue' at */
1450 bcontinue = bprecond;
1453 func->curblock = bprecond;
1456 cgen = self->precond->expression.codegen;
1457 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1460 end_bprecond = func->curblock;
1462 bprecond = end_bprecond = NULL;
1465 /* Now the next blocks won't be ordered nicely, but we need to
1466 * generate them this early for 'break' and 'continue'.
1468 if (self->increment) {
1469 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1472 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1474 bincrement = end_bincrement = NULL;
1477 if (self->postcond) {
1478 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1481 bcontinue = bpostcond; /* postcond comes before the increment */
1483 bpostcond = end_bpostcond = NULL;
1486 bout_id = func->ir_func->blocks_count;
1487 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1492 /* The loop body... */
1495 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1500 func->curblock = bbody;
1502 old_bbreak = func->breakblock;
1503 old_bcontinue = func->continueblock;
1504 func->breakblock = bbreak;
1505 func->continueblock = bcontinue;
1508 cgen = self->body->expression.codegen;
1509 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1512 end_bbody = func->curblock;
1513 func->breakblock = old_bbreak;
1514 func->continueblock = old_bcontinue;
1517 /* post-loop-condition */
1521 func->curblock = bpostcond;
1524 cgen = self->postcond->expression.codegen;
1525 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1528 end_bpostcond = func->curblock;
1531 /* The incrementor */
1532 if (self->increment)
1535 func->curblock = bincrement;
1538 cgen = self->increment->expression.codegen;
1539 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1542 end_bincrement = func->curblock;
1545 /* In any case now, we continue from the outgoing block */
1546 func->curblock = bout;
1548 /* Now all blocks are in place */
1549 /* From 'bin' we jump to whatever comes first */
1550 if (bprecond) tmpblock = bprecond;
1551 else if (bbody) tmpblock = bbody;
1552 else if (bpostcond) tmpblock = bpostcond;
1553 else tmpblock = bout;
1554 if (!ir_block_create_jump(bin, tmpblock))
1560 ir_block *ontrue, *onfalse;
1561 if (bbody) ontrue = bbody;
1562 else if (bincrement) ontrue = bincrement;
1563 else if (bpostcond) ontrue = bpostcond;
1564 else ontrue = bprecond;
1566 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1573 if (bincrement) tmpblock = bincrement;
1574 else if (bpostcond) tmpblock = bpostcond;
1575 else if (bprecond) tmpblock = bprecond;
1576 else tmpblock = bout;
1577 if (!ir_block_create_jump(end_bbody, tmpblock))
1581 /* from increment */
1584 if (bpostcond) tmpblock = bpostcond;
1585 else if (bprecond) tmpblock = bprecond;
1586 else if (bbody) tmpblock = bbody;
1587 else tmpblock = bout;
1588 if (!ir_block_create_jump(end_bincrement, tmpblock))
1595 ir_block *ontrue, *onfalse;
1596 if (bprecond) ontrue = bprecond;
1597 else if (bbody) ontrue = bbody;
1598 else if (bincrement) ontrue = bincrement;
1599 else ontrue = bpostcond;
1601 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1605 /* Move 'bout' to the end */
1606 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1607 !ir_function_blocks_add(func->ir_func, bout))
1609 ir_block_delete(bout);
1616 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1618 ast_expression_codegen *cgen;
1619 ir_value_vector params;
1620 ir_instr *callinstr;
1623 ir_value *funval = NULL;
1625 /* return values are never lvalues */
1628 if (self->expression.outr) {
1629 *out = self->expression.outr;
1633 cgen = self->func->expression.codegen;
1634 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1639 MEM_VECTOR_INIT(¶ms, v);
1642 for (i = 0; i < self->params_count; ++i)
1645 ast_expression *expr = self->params[i];
1647 cgen = expr->expression.codegen;
1648 if (!(*cgen)(expr, func, false, ¶m))
1652 if (!ir_value_vector_v_add(¶ms, param))
1656 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1660 for (i = 0; i < params.v_count; ++i) {
1661 if (!ir_call_param(callinstr, params.v[i]))
1665 *out = ir_call_value(callinstr);
1666 self->expression.outr = *out;
1668 MEM_VECTOR_CLEAR(¶ms, v);
1671 MEM_VECTOR_CLEAR(¶ms, v);