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);
128 ast_expression_init(self, NULL);
130 fromex = &ex->expression;
131 selfex = &self->expression;
133 /* This may never be codegen()d */
134 selfex->codegen = NULL;
136 selfex->vtype = fromex->vtype;
139 selfex->next = ast_type_copy(ctx, fromex->next);
141 ast_expression_delete_full(self);
148 for (i = 0; i < fromex->params_count; ++i) {
149 ast_value *v = ast_value_copy(fromex->params[i]);
150 if (!v || !ast_expression_common_params_add(selfex, v)) {
151 ast_expression_delete_full(self);
160 bool ast_compare_type(ast_expression *a, ast_expression *b)
162 if (a->expression.vtype != b->expression.vtype)
164 if (!a->expression.next != !b->expression.next)
166 if (a->expression.params_count != b->expression.params_count)
168 if (a->expression.params_count) {
170 for (i = 0; i < a->expression.params_count; ++i) {
171 if (!ast_compare_type((ast_expression*)a->expression.params[i],
172 (ast_expression*)b->expression.params[i]))
176 if (a->expression.next)
177 return ast_compare_type(a->expression.next, b->expression.next);
181 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
183 ast_instantiate(ast_value, ctx, ast_value_delete);
184 ast_expression_init((ast_expression*)self,
185 (ast_expression_codegen*)&ast_value_codegen);
186 self->expression.node.keep = true; /* keep */
188 self->name = name ? util_strdup(name) : NULL;
189 self->expression.vtype = t;
190 self->expression.next = NULL;
191 self->isconst = false;
192 memset(&self->constval, 0, sizeof(self->constval));
199 void ast_value_delete(ast_value* self)
202 mem_d((void*)self->name);
204 switch (self->expression.vtype)
207 mem_d((void*)self->constval.vstring);
210 /* unlink us from the function node */
211 self->constval.vfunc->vtype = NULL;
213 /* NOTE: delete function? currently collected in
214 * the parser structure
220 ast_expression_delete((ast_expression*)self);
224 bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
226 return ast_expression_common_params_add(&self->expression, p);
229 bool ast_value_set_name(ast_value *self, const char *name)
232 mem_d((void*)self->name);
233 self->name = util_strdup(name);
237 ast_binary* ast_binary_new(lex_ctx ctx, int op,
238 ast_expression* left, ast_expression* right)
240 ast_instantiate(ast_binary, ctx, ast_binary_delete);
241 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
247 if (op >= INSTR_EQ_F && op <= INSTR_GT)
248 self->expression.vtype = TYPE_FLOAT;
249 else if (op == INSTR_AND || op == INSTR_OR ||
250 op == INSTR_BITAND || op == INSTR_BITOR)
251 self->expression.vtype = TYPE_FLOAT;
252 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
253 self->expression.vtype = TYPE_VECTOR;
254 else if (op == INSTR_MUL_V)
255 self->expression.vtype = TYPE_FLOAT;
257 self->expression.vtype = left->expression.vtype;
262 void ast_binary_delete(ast_binary *self)
264 ast_unref(self->left);
265 ast_unref(self->right);
266 ast_expression_delete((ast_expression*)self);
270 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
271 ast_expression* left, ast_expression* right)
273 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
274 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
276 self->opstore = storop;
279 self->source = right;
281 self->expression.vtype = left->expression.vtype;
282 if (left->expression.next) {
283 self->expression.next = ast_type_copy(ctx, left);
284 if (!self->expression.next) {
290 self->expression.next = NULL;
295 void ast_binstore_delete(ast_binstore *self)
297 ast_unref(self->dest);
298 ast_unref(self->source);
299 ast_expression_delete((ast_expression*)self);
303 ast_unary* ast_unary_new(lex_ctx ctx, int op,
304 ast_expression *expr)
306 ast_instantiate(ast_unary, ctx, ast_unary_delete);
307 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
310 self->operand = expr;
315 void ast_unary_delete(ast_unary *self)
317 ast_unref(self->operand);
318 ast_expression_delete((ast_expression*)self);
322 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
324 ast_instantiate(ast_return, ctx, ast_return_delete);
325 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
327 self->operand = expr;
332 void ast_return_delete(ast_return *self)
334 ast_unref(self->operand);
335 ast_expression_delete((ast_expression*)self);
339 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
341 const ast_expression *outtype;
343 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
345 if (field->expression.vtype != TYPE_FIELD) {
350 outtype = field->expression.next;
353 /* Error: field has no type... */
357 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
359 self->expression.vtype = outtype->expression.vtype;
360 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
362 self->entity = entity;
368 void ast_entfield_delete(ast_entfield *self)
370 ast_unref(self->entity);
371 ast_unref(self->field);
372 ast_expression_delete((ast_expression*)self);
376 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
378 ast_instantiate(ast_member, ctx, ast_member_delete);
384 if (owner->expression.vtype != TYPE_VECTOR &&
385 owner->expression.vtype != TYPE_FIELD) {
386 asterror(ctx, "member-access on an invalid owner of type %s\n", type_name[owner->expression.vtype]);
391 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
392 self->expression.node.keep = true; /* keep */
394 if (owner->expression.vtype == TYPE_VECTOR) {
395 self->expression.vtype = TYPE_FLOAT;
396 self->expression.next = NULL;
398 self->expression.vtype = TYPE_FIELD;
399 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
408 void ast_member_delete(ast_member *self)
410 /* The owner is always an ast_value, which has .keep=true,
411 * also: ast_members are usually deleted after the owner, thus
412 * this will cause invalid access
413 ast_unref(self->owner);
414 * once we allow (expression).x to access a vector-member, we need
415 * to change this: preferably by creating an alternate ast node for this
416 * purpose that is not garbage-collected.
418 ast_expression_delete((ast_expression*)self);
422 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
424 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
425 if (!ontrue && !onfalse) {
426 /* because it is invalid */
430 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
433 self->on_true = ontrue;
434 self->on_false = onfalse;
439 void ast_ifthen_delete(ast_ifthen *self)
441 ast_unref(self->cond);
443 ast_unref(self->on_true);
445 ast_unref(self->on_false);
446 ast_expression_delete((ast_expression*)self);
450 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
452 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
453 /* This time NEITHER must be NULL */
454 if (!ontrue || !onfalse) {
458 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
461 self->on_true = ontrue;
462 self->on_false = onfalse;
463 self->phi_out = NULL;
468 void ast_ternary_delete(ast_ternary *self)
470 ast_unref(self->cond);
471 ast_unref(self->on_true);
472 ast_unref(self->on_false);
473 ast_expression_delete((ast_expression*)self);
477 ast_loop* ast_loop_new(lex_ctx ctx,
478 ast_expression *initexpr,
479 ast_expression *precond,
480 ast_expression *postcond,
481 ast_expression *increment,
482 ast_expression *body)
484 ast_instantiate(ast_loop, ctx, ast_loop_delete);
485 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
487 self->initexpr = initexpr;
488 self->precond = precond;
489 self->postcond = postcond;
490 self->increment = increment;
496 void ast_loop_delete(ast_loop *self)
499 ast_unref(self->initexpr);
501 ast_unref(self->precond);
503 ast_unref(self->postcond);
505 ast_unref(self->increment);
507 ast_unref(self->body);
508 ast_expression_delete((ast_expression*)self);
512 ast_call* ast_call_new(lex_ctx ctx,
513 ast_expression *funcexpr)
515 ast_instantiate(ast_call, ctx, ast_call_delete);
516 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
518 MEM_VECTOR_INIT(self, params);
520 self->func = funcexpr;
524 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
526 void ast_call_delete(ast_call *self)
529 for (i = 0; i < self->params_count; ++i)
530 ast_unref(self->params[i]);
531 MEM_VECTOR_CLEAR(self, params);
534 ast_unref(self->func);
536 ast_expression_delete((ast_expression*)self);
540 ast_store* ast_store_new(lex_ctx ctx, int op,
541 ast_expression *dest, ast_expression *source)
543 ast_instantiate(ast_store, ctx, ast_store_delete);
544 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
548 self->source = source;
553 void ast_store_delete(ast_store *self)
555 ast_unref(self->dest);
556 ast_unref(self->source);
557 ast_expression_delete((ast_expression*)self);
561 ast_block* ast_block_new(lex_ctx ctx)
563 ast_instantiate(ast_block, ctx, ast_block_delete);
564 ast_expression_init((ast_expression*)self,
565 (ast_expression_codegen*)&ast_block_codegen);
567 MEM_VECTOR_INIT(self, locals);
568 MEM_VECTOR_INIT(self, exprs);
569 MEM_VECTOR_INIT(self, collect);
573 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
574 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
575 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, collect)
577 bool ast_block_collect(ast_block *self, ast_expression *expr)
579 if (!ast_block_collect_add(self, expr))
581 expr->expression.node.keep = true;
585 void ast_block_delete(ast_block *self)
588 for (i = 0; i < self->exprs_count; ++i)
589 ast_unref(self->exprs[i]);
590 MEM_VECTOR_CLEAR(self, exprs);
591 for (i = 0; i < self->locals_count; ++i)
592 ast_delete(self->locals[i]);
593 MEM_VECTOR_CLEAR(self, locals);
594 for (i = 0; i < self->collect_count; ++i)
595 ast_delete(self->collect[i]);
596 MEM_VECTOR_CLEAR(self, collect);
597 ast_expression_delete((ast_expression*)self);
601 bool ast_block_set_type(ast_block *self, ast_expression *from)
603 if (self->expression.next)
604 ast_delete(self->expression.next);
605 self->expression.vtype = from->expression.vtype;
606 if (from->expression.next) {
607 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
608 if (!self->expression.next)
614 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
616 ast_instantiate(ast_function, ctx, ast_function_delete);
620 vtype->expression.vtype != TYPE_FUNCTION)
627 self->name = name ? util_strdup(name) : NULL;
628 MEM_VECTOR_INIT(self, blocks);
630 self->labelcount = 0;
633 self->ir_func = NULL;
634 self->curblock = NULL;
636 self->breakblock = NULL;
637 self->continueblock = NULL;
639 vtype->isconst = true;
640 vtype->constval.vfunc = self;
645 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
647 void ast_function_delete(ast_function *self)
651 mem_d((void*)self->name);
653 /* ast_value_delete(self->vtype); */
654 self->vtype->isconst = false;
655 self->vtype->constval.vfunc = NULL;
656 /* We use unref - if it was stored in a global table it is supposed
657 * to be deleted from *there*
659 ast_unref(self->vtype);
661 for (i = 0; i < self->blocks_count; ++i)
662 ast_delete(self->blocks[i]);
663 MEM_VECTOR_CLEAR(self, blocks);
667 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
669 unsigned int base = 10;
670 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
671 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
680 int digit = num % base;
691 const char* ast_function_label(ast_function *self, const char *prefix)
693 size_t id = (self->labelcount++);
694 size_t len = strlen(prefix);
695 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
696 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
697 return self->labelbuf;
700 /*********************************************************************/
702 * by convention you must never pass NULL to the 'ir_value **out'
703 * parameter. If you really don't care about the output, pass a dummy.
704 * But I can't imagine a pituation where the output is truly unnecessary.
707 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
709 /* NOTE: This is the codegen for a variable used in an expression.
710 * It is not the codegen to generate the value. For this purpose,
711 * ast_local_codegen and ast_global_codegen are to be used before this
712 * is executed. ast_function_codegen should take care of its locals,
713 * and the ast-user should take care of ast_global_codegen to be used
714 * on all the globals.
717 asterror(ast_ctx(self), "ast_value used before generated (%s)\n", self->name);
724 bool ast_global_codegen(ast_value *self, ir_builder *ir)
727 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
729 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
733 self->constval.vfunc->ir_func = func;
734 self->ir_v = func->value;
735 /* The function is filled later on ast_function_codegen... */
739 if (self->expression.vtype == TYPE_FIELD) {
740 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
744 asterror(ast_ctx(self), "TODO: constant field pointers with value\n");
751 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
753 asterror(ast_ctx(self), "ir_builder_create_global failed\n");
758 switch (self->expression.vtype)
761 if (!ir_value_set_float(v, self->constval.vfloat))
765 if (!ir_value_set_vector(v, self->constval.vvec))
769 if (!ir_value_set_string(v, self->constval.vstring))
773 asterror(ast_ctx(self), "global of type function not properly generated\n");
775 /* Cannot generate an IR value for a function,
776 * need a pointer pointing to a function rather.
779 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
784 /* link us to the ir_value */
788 error: /* clean up */
793 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
796 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
798 /* Do we allow local functions? I think not...
799 * this is NOT a function pointer atm.
804 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
808 /* A constant local... hmmm...
809 * I suppose the IR will have to deal with this
812 switch (self->expression.vtype)
815 if (!ir_value_set_float(v, self->constval.vfloat))
819 if (!ir_value_set_vector(v, self->constval.vvec))
823 if (!ir_value_set_string(v, self->constval.vstring))
827 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
832 /* link us to the ir_value */
836 error: /* clean up */
841 bool ast_function_codegen(ast_function *self, ir_builder *ir)
845 ast_expression_common *ec;
850 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet\n");
854 /* fill the parameter list */
855 ec = &self->vtype->expression;
856 for (i = 0; i < ec->params_count; ++i)
858 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
860 if (!self->builtin) {
861 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
867 irf->builtin = self->builtin;
871 if (!self->blocks_count) {
872 asterror(ast_ctx(self), "function `%s` has no body", self->name);
876 self->curblock = ir_function_create_block(irf, "entry");
880 for (i = 0; i < self->blocks_count; ++i) {
881 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
882 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
886 /* TODO: check return types */
887 if (!self->curblock->is_return)
889 if (!self->vtype->expression.next ||
890 self->vtype->expression.next->expression.vtype == TYPE_VOID)
892 return ir_block_create_return(self->curblock, NULL);
896 /* error("missing return"); */
897 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
904 /* Note, you will not see ast_block_codegen generate ir_blocks.
905 * To the AST and the IR, blocks are 2 different things.
906 * In the AST it represents a block of code, usually enclosed in
907 * curly braces {...}.
908 * While in the IR it represents a block in terms of control-flow.
910 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
915 * Note: an ast-representation using the comma-operator
916 * of the form: (a, b, c) = x should not assign to c...
919 if (self->expression.outr) {
920 *out = self->expression.outr;
924 /* output is NULL at first, we'll have each expression
925 * assign to out output, thus, a comma-operator represention
926 * using an ast_block will return the last generated value,
927 * so: (b, c) + a executed both b and c, and returns c,
928 * which is then added to a.
932 /* generate locals */
933 for (i = 0; i < self->locals_count; ++i)
935 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
939 for (i = 0; i < self->exprs_count; ++i)
941 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
942 if (!(*gen)(self->exprs[i], func, false, out))
946 self->expression.outr = *out;
951 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
953 ast_expression_codegen *cgen;
954 ir_value *left, *right;
956 if (lvalue && self->expression.outl) {
957 *out = self->expression.outl;
961 if (!lvalue && self->expression.outr) {
962 *out = self->expression.outr;
966 cgen = self->dest->expression.codegen;
968 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
970 self->expression.outl = left;
972 cgen = self->source->expression.codegen;
974 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
977 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
979 self->expression.outr = right;
981 /* Theoretically, an assinment returns its left side as an
982 * lvalue, if we don't need an lvalue though, we return
983 * the right side as an rvalue, otherwise we have to
984 * somehow know whether or not we need to dereference the pointer
985 * on the left side - that is: OP_LOAD if it was an address.
986 * Also: in original QC we cannot OP_LOADP *anyway*.
988 *out = (lvalue ? left : right);
993 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
995 ast_expression_codegen *cgen;
996 ir_value *left, *right;
998 /* In the context of a binary operation, we can disregard
1002 if (self->expression.outr) {
1003 *out = self->expression.outr;
1007 cgen = self->left->expression.codegen;
1009 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1012 cgen = self->right->expression.codegen;
1014 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1017 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1018 self->op, left, right);
1021 self->expression.outr = *out;
1026 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1028 ast_expression_codegen *cgen;
1029 ir_value *leftl, *leftr, *right, *bin;
1031 if (lvalue && self->expression.outl) {
1032 *out = self->expression.outl;
1036 if (!lvalue && self->expression.outr) {
1037 *out = self->expression.outr;
1041 /* for a binstore we need both an lvalue and an rvalue for the left side */
1042 /* rvalue of destination! */
1043 cgen = self->dest->expression.codegen;
1044 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1047 /* source as rvalue only */
1048 cgen = self->source->expression.codegen;
1049 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1052 /* now the binary */
1053 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1054 self->opbin, leftr, right);
1055 self->expression.outr = bin;
1057 /* now store them */
1058 cgen = self->dest->expression.codegen;
1059 /* lvalue of destination */
1060 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1062 self->expression.outl = leftl;
1064 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1066 self->expression.outr = bin;
1068 /* Theoretically, an assinment returns its left side as an
1069 * lvalue, if we don't need an lvalue though, we return
1070 * the right side as an rvalue, otherwise we have to
1071 * somehow know whether or not we need to dereference the pointer
1072 * on the left side - that is: OP_LOAD if it was an address.
1073 * Also: in original QC we cannot OP_LOADP *anyway*.
1075 *out = (lvalue ? leftl : bin);
1080 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1082 ast_expression_codegen *cgen;
1085 /* In the context of a unary operation, we can disregard
1089 if (self->expression.outr) {
1090 *out = self->expression.outr;
1094 cgen = self->operand->expression.codegen;
1096 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1099 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1103 self->expression.outr = *out;
1108 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1110 ast_expression_codegen *cgen;
1113 /* In the context of a return operation, we can disregard
1117 if (self->expression.outr) {
1118 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!\n");
1121 self->expression.outr = (ir_value*)1;
1123 cgen = self->operand->expression.codegen;
1125 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1128 if (!ir_block_create_return(func->curblock, operand))
1134 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1136 ast_expression_codegen *cgen;
1137 ir_value *ent, *field;
1139 /* This function needs to take the 'lvalue' flag into account!
1140 * As lvalue we provide a field-pointer, as rvalue we provide the
1144 if (lvalue && self->expression.outl) {
1145 *out = self->expression.outl;
1149 if (!lvalue && self->expression.outr) {
1150 *out = self->expression.outr;
1154 cgen = self->entity->expression.codegen;
1155 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1158 cgen = self->field->expression.codegen;
1159 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1164 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1167 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1168 ent, field, self->expression.vtype);
1171 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1172 (lvalue ? "ADDRESS" : "FIELD"),
1173 type_name[self->expression.vtype]);
1178 self->expression.outl = *out;
1180 self->expression.outr = *out;
1182 /* Hm that should be it... */
1186 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1188 ast_expression_codegen *cgen;
1191 /* in QC this is always an lvalue */
1193 if (self->expression.outl) {
1194 *out = self->expression.outl;
1198 cgen = self->owner->expression.codegen;
1199 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1202 if (vec->vtype != TYPE_VECTOR &&
1203 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1208 *out = ir_value_vector_member(vec, self->field);
1209 self->expression.outl = *out;
1211 return (*out != NULL);
1214 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1216 ast_expression_codegen *cgen;
1221 ir_block *cond = func->curblock;
1226 /* We don't output any value, thus also don't care about r/lvalue */
1230 if (self->expression.outr) {
1231 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!\n");
1234 self->expression.outr = (ir_value*)1;
1236 /* generate the condition */
1237 func->curblock = cond;
1238 cgen = self->cond->expression.codegen;
1239 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1244 if (self->on_true) {
1245 /* create on-true block */
1246 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1250 /* enter the block */
1251 func->curblock = ontrue;
1254 cgen = self->on_true->expression.codegen;
1255 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1261 if (self->on_false) {
1262 /* create on-false block */
1263 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1267 /* enter the block */
1268 func->curblock = onfalse;
1271 cgen = self->on_false->expression.codegen;
1272 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1277 /* Merge block were they all merge in to */
1278 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1282 /* add jumps ot the merge block */
1283 if (ontrue && !ir_block_create_jump(ontrue, merge))
1285 if (onfalse && !ir_block_create_jump(onfalse, merge))
1288 /* we create the if here, that way all blocks are ordered :)
1290 if (!ir_block_create_if(cond, condval,
1291 (ontrue ? ontrue : merge),
1292 (onfalse ? onfalse : merge)))
1297 /* Now enter the merge block */
1298 func->curblock = merge;
1303 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1305 ast_expression_codegen *cgen;
1308 ir_value *trueval, *falseval;
1311 ir_block *cond = func->curblock;
1316 /* Ternary can never create an lvalue... */
1320 /* In theory it shouldn't be possible to pass through a node twice, but
1321 * in case we add any kind of optimization pass for the AST itself, it
1322 * may still happen, thus we remember a created ir_value and simply return one
1323 * if it already exists.
1325 if (self->phi_out) {
1326 *out = self->phi_out;
1330 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1332 /* generate the condition */
1333 func->curblock = cond;
1334 cgen = self->cond->expression.codegen;
1335 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1338 /* create on-true block */
1339 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1344 /* enter the block */
1345 func->curblock = ontrue;
1348 cgen = self->on_true->expression.codegen;
1349 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1353 /* create on-false block */
1354 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1359 /* enter the block */
1360 func->curblock = onfalse;
1363 cgen = self->on_false->expression.codegen;
1364 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1368 /* create merge block */
1369 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1372 /* jump to merge block */
1373 if (!ir_block_create_jump(ontrue, merge))
1375 if (!ir_block_create_jump(onfalse, merge))
1378 /* create if instruction */
1379 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1382 /* Now enter the merge block */
1383 func->curblock = merge;
1385 /* Here, now, we need a PHI node
1386 * but first some sanity checking...
1388 if (trueval->vtype != falseval->vtype) {
1389 /* error("ternary with different types on the two sides"); */
1394 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1396 !ir_phi_add(phi, ontrue, trueval) ||
1397 !ir_phi_add(phi, onfalse, falseval))
1402 self->phi_out = ir_phi_value(phi);
1403 *out = self->phi_out;
1408 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1410 ast_expression_codegen *cgen;
1412 ir_value *dummy = NULL;
1413 ir_value *precond = NULL;
1414 ir_value *postcond = NULL;
1416 /* Since we insert some jumps "late" so we have blocks
1417 * ordered "nicely", we need to keep track of the actual end-blocks
1418 * of expressions to add the jumps to.
1420 ir_block *bbody = NULL, *end_bbody = NULL;
1421 ir_block *bprecond = NULL, *end_bprecond = NULL;
1422 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1423 ir_block *bincrement = NULL, *end_bincrement = NULL;
1424 ir_block *bout = NULL, *bin = NULL;
1426 /* let's at least move the outgoing block to the end */
1429 /* 'break' and 'continue' need to be able to find the right blocks */
1430 ir_block *bcontinue = NULL;
1431 ir_block *bbreak = NULL;
1433 ir_block *old_bcontinue = NULL;
1434 ir_block *old_bbreak = NULL;
1436 ir_block *tmpblock = NULL;
1441 if (self->expression.outr) {
1442 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!\n");
1445 self->expression.outr = (ir_value*)1;
1448 * Should we ever need some kind of block ordering, better make this function
1449 * move blocks around than write a block ordering algorithm later... after all
1450 * the ast and ir should work together, not against each other.
1453 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1454 * anyway if for example it contains a ternary.
1458 cgen = self->initexpr->expression.codegen;
1459 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1463 /* Store the block from which we enter this chaos */
1464 bin = func->curblock;
1466 /* The pre-loop condition needs its own block since we
1467 * need to be able to jump to the start of that expression.
1471 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1475 /* the pre-loop-condition the least important place to 'continue' at */
1476 bcontinue = bprecond;
1479 func->curblock = bprecond;
1482 cgen = self->precond->expression.codegen;
1483 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1486 end_bprecond = func->curblock;
1488 bprecond = end_bprecond = NULL;
1491 /* Now the next blocks won't be ordered nicely, but we need to
1492 * generate them this early for 'break' and 'continue'.
1494 if (self->increment) {
1495 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1498 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1500 bincrement = end_bincrement = NULL;
1503 if (self->postcond) {
1504 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1507 bcontinue = bpostcond; /* postcond comes before the increment */
1509 bpostcond = end_bpostcond = NULL;
1512 bout_id = func->ir_func->blocks_count;
1513 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1518 /* The loop body... */
1521 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1526 func->curblock = bbody;
1528 old_bbreak = func->breakblock;
1529 old_bcontinue = func->continueblock;
1530 func->breakblock = bbreak;
1531 func->continueblock = bcontinue;
1534 cgen = self->body->expression.codegen;
1535 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1538 end_bbody = func->curblock;
1539 func->breakblock = old_bbreak;
1540 func->continueblock = old_bcontinue;
1543 /* post-loop-condition */
1547 func->curblock = bpostcond;
1550 cgen = self->postcond->expression.codegen;
1551 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1554 end_bpostcond = func->curblock;
1557 /* The incrementor */
1558 if (self->increment)
1561 func->curblock = bincrement;
1564 cgen = self->increment->expression.codegen;
1565 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1568 end_bincrement = func->curblock;
1571 /* In any case now, we continue from the outgoing block */
1572 func->curblock = bout;
1574 /* Now all blocks are in place */
1575 /* From 'bin' we jump to whatever comes first */
1576 if (bprecond) tmpblock = bprecond;
1577 else if (bbody) tmpblock = bbody;
1578 else if (bpostcond) tmpblock = bpostcond;
1579 else tmpblock = bout;
1580 if (!ir_block_create_jump(bin, tmpblock))
1586 ir_block *ontrue, *onfalse;
1587 if (bbody) ontrue = bbody;
1588 else if (bincrement) ontrue = bincrement;
1589 else if (bpostcond) ontrue = bpostcond;
1590 else ontrue = bprecond;
1592 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1599 if (bincrement) tmpblock = bincrement;
1600 else if (bpostcond) tmpblock = bpostcond;
1601 else if (bprecond) tmpblock = bprecond;
1602 else tmpblock = bout;
1603 if (!ir_block_create_jump(end_bbody, tmpblock))
1607 /* from increment */
1610 if (bpostcond) tmpblock = bpostcond;
1611 else if (bprecond) tmpblock = bprecond;
1612 else if (bbody) tmpblock = bbody;
1613 else tmpblock = bout;
1614 if (!ir_block_create_jump(end_bincrement, tmpblock))
1621 ir_block *ontrue, *onfalse;
1622 if (bprecond) ontrue = bprecond;
1623 else if (bbody) ontrue = bbody;
1624 else if (bincrement) ontrue = bincrement;
1625 else ontrue = bpostcond;
1627 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1631 /* Move 'bout' to the end */
1632 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1633 !ir_function_blocks_add(func->ir_func, bout))
1635 ir_block_delete(bout);
1642 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1644 ast_expression_codegen *cgen;
1645 ir_value_vector params;
1646 ir_instr *callinstr;
1649 ir_value *funval = NULL;
1651 /* return values are never lvalues */
1654 if (self->expression.outr) {
1655 *out = self->expression.outr;
1659 cgen = self->func->expression.codegen;
1660 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1665 MEM_VECTOR_INIT(¶ms, v);
1668 for (i = 0; i < self->params_count; ++i)
1671 ast_expression *expr = self->params[i];
1673 cgen = expr->expression.codegen;
1674 if (!(*cgen)(expr, func, false, ¶m))
1678 if (!ir_value_vector_v_add(¶ms, param))
1682 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1686 for (i = 0; i < params.v_count; ++i) {
1687 if (!ir_call_param(callinstr, params.v[i]))
1691 *out = ir_call_value(callinstr);
1692 self->expression.outr = *out;
1694 MEM_VECTOR_CLEAR(¶ms, v);
1697 MEM_VECTOR_CLEAR(¶ms, v);