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;
61 self->node.nodetype = nodetype;
64 /* General expression initialization */
65 static void ast_expression_init(ast_expression *self,
66 ast_expression_codegen *codegen)
68 self->expression.codegen = codegen;
69 self->expression.vtype = TYPE_VOID;
70 self->expression.next = NULL;
71 self->expression.outl = NULL;
72 self->expression.outr = NULL;
73 MEM_VECTOR_INIT(&self->expression, params);
76 static void ast_expression_delete(ast_expression *self)
79 if (self->expression.next)
80 ast_delete(self->expression.next);
81 for (i = 0; i < self->expression.params_count; ++i) {
82 ast_delete(self->expression.params[i]);
84 MEM_VECTOR_CLEAR(&self->expression, params);
87 static void ast_expression_delete_full(ast_expression *self)
89 ast_expression_delete(self);
93 MEM_VEC_FUNCTIONS(ast_expression_common, ast_value*, params)
95 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex);
96 static ast_value* ast_value_copy(const ast_value *self)
98 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
99 if (self->expression.next) {
100 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
101 if (!cp->expression.next) {
102 ast_value_delete(cp);
109 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
111 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
112 self->expression.codegen = NULL;
113 self->expression.next = NULL;
114 self->expression.vtype = vtype;
118 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
121 const ast_expression_common *fromex;
122 ast_expression_common *selfex;
128 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
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;
265 void ast_binary_delete(ast_binary *self)
267 ast_unref(self->left);
268 ast_unref(self->right);
269 ast_expression_delete((ast_expression*)self);
273 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
274 ast_expression* left, ast_expression* right)
276 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
277 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
279 self->opstore = storop;
282 self->source = right;
284 self->expression.vtype = left->expression.vtype;
285 if (left->expression.next) {
286 self->expression.next = ast_type_copy(ctx, left);
287 if (!self->expression.next) {
293 self->expression.next = NULL;
302 void ast_binstore_delete(ast_binstore *self)
304 ast_unref(self->dest);
305 ast_unref(self->source);
306 ast_expression_delete((ast_expression*)self);
310 ast_unary* ast_unary_new(lex_ctx ctx, int op,
311 ast_expression *expr)
313 ast_instantiate(ast_unary, ctx, ast_unary_delete);
314 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
317 self->operand = expr;
324 void ast_unary_delete(ast_unary *self)
326 ast_unref(self->operand);
327 ast_expression_delete((ast_expression*)self);
331 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
333 ast_instantiate(ast_return, ctx, ast_return_delete);
334 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
336 self->operand = expr;
343 void ast_return_delete(ast_return *self)
345 ast_unref(self->operand);
346 ast_expression_delete((ast_expression*)self);
350 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
352 const ast_expression *outtype;
354 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
356 if (field->expression.vtype != TYPE_FIELD) {
361 outtype = field->expression.next;
364 /* Error: field has no type... */
368 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
370 self->expression.vtype = outtype->expression.vtype;
371 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
373 self->entity = entity;
382 void ast_entfield_delete(ast_entfield *self)
384 ast_unref(self->entity);
385 ast_unref(self->field);
386 ast_expression_delete((ast_expression*)self);
390 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
392 ast_instantiate(ast_member, ctx, ast_member_delete);
398 if (owner->expression.vtype != TYPE_VECTOR &&
399 owner->expression.vtype != TYPE_FIELD) {
400 asterror(ctx, "member-access on an invalid owner of type %s\n", type_name[owner->expression.vtype]);
405 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
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);
423 void ast_member_delete(ast_member *self)
425 ast_unref(self->owner);
426 ast_expression_delete((ast_expression*)self);
430 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
432 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
433 if (!ontrue && !onfalse) {
434 /* because it is invalid */
438 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
441 self->on_true = ontrue;
442 self->on_false = onfalse;
445 if (ontrue) ast_use(ontrue);
446 if (onfalse) ast_use(onfalse);
451 void ast_ifthen_delete(ast_ifthen *self)
453 ast_unref(self->cond);
455 ast_unref(self->on_true);
457 ast_unref(self->on_false);
458 ast_expression_delete((ast_expression*)self);
462 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
464 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
465 /* This time NEITHER must be NULL */
466 if (!ontrue || !onfalse) {
470 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
473 self->on_true = ontrue;
474 self->on_false = onfalse;
475 self->phi_out = NULL;
484 void ast_ternary_delete(ast_ternary *self)
486 ast_unref(self->cond);
487 ast_unref(self->on_true);
488 ast_unref(self->on_false);
489 ast_expression_delete((ast_expression*)self);
493 ast_loop* ast_loop_new(lex_ctx ctx,
494 ast_expression *initexpr,
495 ast_expression *precond,
496 ast_expression *postcond,
497 ast_expression *increment,
498 ast_expression *body)
500 ast_instantiate(ast_loop, ctx, ast_loop_delete);
501 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
503 self->initexpr = initexpr;
504 self->precond = precond;
505 self->postcond = postcond;
506 self->increment = increment;
509 if (initexpr) ast_use(initexpr);
510 if (precond) ast_use(precond);
511 if (postcond) ast_use(postcond);
512 if (increment) ast_use(increment);
513 if (body) ast_use(body);
518 void ast_loop_delete(ast_loop *self)
521 ast_unref(self->initexpr);
523 ast_unref(self->precond);
525 ast_unref(self->postcond);
527 ast_unref(self->increment);
529 ast_unref(self->body);
530 ast_expression_delete((ast_expression*)self);
534 ast_call* ast_call_new(lex_ctx ctx,
535 ast_expression *funcexpr)
537 ast_instantiate(ast_call, ctx, ast_call_delete);
538 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
540 MEM_VECTOR_INIT(self, params);
542 self->func = funcexpr;
547 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
549 bool ast_call_add_param(ast_call *self, ast_expression *expr)
551 if (!ast_call_params_add(self, expr))
557 void ast_call_delete(ast_call *self)
560 for (i = 0; i < self->params_count; ++i)
561 ast_unref(self->params[i]);
562 MEM_VECTOR_CLEAR(self, params);
565 ast_unref(self->func);
567 ast_expression_delete((ast_expression*)self);
571 ast_store* ast_store_new(lex_ctx ctx, int op,
572 ast_expression *dest, ast_expression *source)
574 ast_instantiate(ast_store, ctx, ast_store_delete);
575 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
579 self->source = source;
587 void ast_store_delete(ast_store *self)
589 ast_unref(self->dest);
590 ast_unref(self->source);
591 ast_expression_delete((ast_expression*)self);
595 ast_block* ast_block_new(lex_ctx ctx)
597 ast_instantiate(ast_block, ctx, ast_block_delete);
598 ast_expression_init((ast_expression*)self,
599 (ast_expression_codegen*)&ast_block_codegen);
601 MEM_VECTOR_INIT(self, locals);
602 MEM_VECTOR_INIT(self, exprs);
606 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
607 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
609 bool ast_block_add_expr(ast_block *self, ast_expression *expr)
611 if (!ast_block_exprs_add(self, expr))
617 void ast_block_delete(ast_block *self)
620 for (i = 0; i < self->exprs_count; ++i)
621 ast_unref(self->exprs[i]);
622 MEM_VECTOR_CLEAR(self, exprs);
623 for (i = 0; i < self->locals_count; ++i)
624 ast_delete(self->locals[i]);
625 MEM_VECTOR_CLEAR(self, locals);
626 ast_expression_delete((ast_expression*)self);
630 bool ast_block_set_type(ast_block *self, ast_expression *from)
632 if (self->expression.next)
633 ast_delete(self->expression.next);
634 self->expression.vtype = from->expression.vtype;
635 if (from->expression.next) {
636 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
637 if (!self->expression.next)
643 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
645 ast_instantiate(ast_function, ctx, ast_function_delete);
649 vtype->expression.vtype != TYPE_FUNCTION)
656 self->name = name ? util_strdup(name) : NULL;
657 MEM_VECTOR_INIT(self, blocks);
659 self->labelcount = 0;
662 self->ir_func = NULL;
663 self->curblock = NULL;
665 self->breakblock = NULL;
666 self->continueblock = NULL;
668 vtype->isconst = true;
669 vtype->constval.vfunc = self;
674 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
676 void ast_function_delete(ast_function *self)
680 mem_d((void*)self->name);
682 /* ast_value_delete(self->vtype); */
683 self->vtype->isconst = false;
684 self->vtype->constval.vfunc = NULL;
685 /* We use unref - if it was stored in a global table it is supposed
686 * to be deleted from *there*
688 ast_unref(self->vtype);
690 for (i = 0; i < self->blocks_count; ++i)
691 ast_delete(self->blocks[i]);
692 MEM_VECTOR_CLEAR(self, blocks);
696 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
698 unsigned int base = 10;
699 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
700 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
709 int digit = num % base;
720 const char* ast_function_label(ast_function *self, const char *prefix)
722 size_t id = (self->labelcount++);
723 size_t len = strlen(prefix);
724 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
725 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
726 return self->labelbuf;
729 /*********************************************************************/
731 * by convention you must never pass NULL to the 'ir_value **out'
732 * parameter. If you really don't care about the output, pass a dummy.
733 * But I can't imagine a pituation where the output is truly unnecessary.
736 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
738 /* NOTE: This is the codegen for a variable used in an expression.
739 * It is not the codegen to generate the value. For this purpose,
740 * ast_local_codegen and ast_global_codegen are to be used before this
741 * is executed. ast_function_codegen should take care of its locals,
742 * and the ast-user should take care of ast_global_codegen to be used
743 * on all the globals.
746 asterror(ast_ctx(self), "ast_value used before generated (%s)\n", self->name);
753 bool ast_global_codegen(ast_value *self, ir_builder *ir)
756 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
758 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
762 self->constval.vfunc->ir_func = func;
763 self->ir_v = func->value;
764 /* The function is filled later on ast_function_codegen... */
768 if (self->expression.vtype == TYPE_FIELD) {
769 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
773 asterror(ast_ctx(self), "TODO: constant field pointers with value\n");
780 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
782 asterror(ast_ctx(self), "ir_builder_create_global failed\n");
787 switch (self->expression.vtype)
790 if (!ir_value_set_float(v, self->constval.vfloat))
794 if (!ir_value_set_vector(v, self->constval.vvec))
798 if (!ir_value_set_string(v, self->constval.vstring))
802 asterror(ast_ctx(self), "global of type function not properly generated\n");
804 /* Cannot generate an IR value for a function,
805 * need a pointer pointing to a function rather.
808 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
813 /* link us to the ir_value */
817 error: /* clean up */
822 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
825 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
827 /* Do we allow local functions? I think not...
828 * this is NOT a function pointer atm.
833 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
837 /* A constant local... hmmm...
838 * I suppose the IR will have to deal with this
841 switch (self->expression.vtype)
844 if (!ir_value_set_float(v, self->constval.vfloat))
848 if (!ir_value_set_vector(v, self->constval.vvec))
852 if (!ir_value_set_string(v, self->constval.vstring))
856 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
861 /* link us to the ir_value */
865 error: /* clean up */
870 bool ast_function_codegen(ast_function *self, ir_builder *ir)
874 ast_expression_common *ec;
879 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet\n");
883 /* fill the parameter list */
884 ec = &self->vtype->expression;
885 for (i = 0; i < ec->params_count; ++i)
887 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
889 if (!self->builtin) {
890 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
896 irf->builtin = self->builtin;
900 if (!self->blocks_count) {
901 asterror(ast_ctx(self), "function `%s` has no body", self->name);
905 self->curblock = ir_function_create_block(irf, "entry");
909 for (i = 0; i < self->blocks_count; ++i) {
910 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
911 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
915 /* TODO: check return types */
916 if (!self->curblock->is_return)
918 if (!self->vtype->expression.next ||
919 self->vtype->expression.next->expression.vtype == TYPE_VOID)
921 return ir_block_create_return(self->curblock, NULL);
925 /* error("missing return"); */
926 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
933 /* Note, you will not see ast_block_codegen generate ir_blocks.
934 * To the AST and the IR, blocks are 2 different things.
935 * In the AST it represents a block of code, usually enclosed in
936 * curly braces {...}.
937 * While in the IR it represents a block in terms of control-flow.
939 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
944 * Note: an ast-representation using the comma-operator
945 * of the form: (a, b, c) = x should not assign to c...
948 if (self->expression.outr) {
949 *out = self->expression.outr;
953 /* output is NULL at first, we'll have each expression
954 * assign to out output, thus, a comma-operator represention
955 * using an ast_block will return the last generated value,
956 * so: (b, c) + a executed both b and c, and returns c,
957 * which is then added to a.
961 /* generate locals */
962 for (i = 0; i < self->locals_count; ++i)
964 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
968 for (i = 0; i < self->exprs_count; ++i)
970 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
971 if (!(*gen)(self->exprs[i], func, false, out))
975 self->expression.outr = *out;
980 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
982 ast_expression_codegen *cgen;
983 ir_value *left, *right;
985 if (lvalue && self->expression.outl) {
986 *out = self->expression.outl;
990 if (!lvalue && self->expression.outr) {
991 *out = self->expression.outr;
995 cgen = self->dest->expression.codegen;
997 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
999 self->expression.outl = left;
1001 cgen = self->source->expression.codegen;
1003 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1006 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1008 self->expression.outr = right;
1010 /* Theoretically, an assinment returns its left side as an
1011 * lvalue, if we don't need an lvalue though, we return
1012 * the right side as an rvalue, otherwise we have to
1013 * somehow know whether or not we need to dereference the pointer
1014 * on the left side - that is: OP_LOAD if it was an address.
1015 * Also: in original QC we cannot OP_LOADP *anyway*.
1017 *out = (lvalue ? left : right);
1022 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1024 ast_expression_codegen *cgen;
1025 ir_value *left, *right;
1027 /* In the context of a binary operation, we can disregard
1031 if (self->expression.outr) {
1032 *out = self->expression.outr;
1036 cgen = self->left->expression.codegen;
1038 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1041 cgen = self->right->expression.codegen;
1043 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1046 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1047 self->op, left, right);
1050 self->expression.outr = *out;
1055 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1057 ast_expression_codegen *cgen;
1058 ir_value *leftl, *leftr, *right, *bin;
1060 if (lvalue && self->expression.outl) {
1061 *out = self->expression.outl;
1065 if (!lvalue && self->expression.outr) {
1066 *out = self->expression.outr;
1070 /* for a binstore we need both an lvalue and an rvalue for the left side */
1071 /* rvalue of destination! */
1072 cgen = self->dest->expression.codegen;
1073 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1076 /* source as rvalue only */
1077 cgen = self->source->expression.codegen;
1078 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1081 /* now the binary */
1082 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1083 self->opbin, leftr, right);
1084 self->expression.outr = bin;
1086 /* now store them */
1087 cgen = self->dest->expression.codegen;
1088 /* lvalue of destination */
1089 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1091 self->expression.outl = leftl;
1093 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1095 self->expression.outr = bin;
1097 /* Theoretically, an assinment returns its left side as an
1098 * lvalue, if we don't need an lvalue though, we return
1099 * the right side as an rvalue, otherwise we have to
1100 * somehow know whether or not we need to dereference the pointer
1101 * on the left side - that is: OP_LOAD if it was an address.
1102 * Also: in original QC we cannot OP_LOADP *anyway*.
1104 *out = (lvalue ? leftl : bin);
1109 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1111 ast_expression_codegen *cgen;
1114 /* In the context of a unary operation, we can disregard
1118 if (self->expression.outr) {
1119 *out = self->expression.outr;
1123 cgen = self->operand->expression.codegen;
1125 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1128 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1132 self->expression.outr = *out;
1137 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1139 ast_expression_codegen *cgen;
1142 /* In the context of a return operation, we can disregard
1146 if (self->expression.outr) {
1147 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!\n");
1150 self->expression.outr = (ir_value*)1;
1152 cgen = self->operand->expression.codegen;
1154 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1157 if (!ir_block_create_return(func->curblock, operand))
1163 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1165 ast_expression_codegen *cgen;
1166 ir_value *ent, *field;
1168 /* This function needs to take the 'lvalue' flag into account!
1169 * As lvalue we provide a field-pointer, as rvalue we provide the
1173 if (lvalue && self->expression.outl) {
1174 *out = self->expression.outl;
1178 if (!lvalue && self->expression.outr) {
1179 *out = self->expression.outr;
1183 cgen = self->entity->expression.codegen;
1184 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1187 cgen = self->field->expression.codegen;
1188 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1193 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1196 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1197 ent, field, self->expression.vtype);
1200 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1201 (lvalue ? "ADDRESS" : "FIELD"),
1202 type_name[self->expression.vtype]);
1207 self->expression.outl = *out;
1209 self->expression.outr = *out;
1211 /* Hm that should be it... */
1215 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1217 ast_expression_codegen *cgen;
1220 /* in QC this is always an lvalue */
1222 if (self->expression.outl) {
1223 *out = self->expression.outl;
1227 cgen = self->owner->expression.codegen;
1228 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1231 if (vec->vtype != TYPE_VECTOR &&
1232 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1237 *out = ir_value_vector_member(vec, self->field);
1238 self->expression.outl = *out;
1240 return (*out != NULL);
1243 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1245 ast_expression_codegen *cgen;
1250 ir_block *cond = func->curblock;
1255 /* We don't output any value, thus also don't care about r/lvalue */
1259 if (self->expression.outr) {
1260 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!\n");
1263 self->expression.outr = (ir_value*)1;
1265 /* generate the condition */
1266 func->curblock = cond;
1267 cgen = self->cond->expression.codegen;
1268 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1273 if (self->on_true) {
1274 /* create on-true block */
1275 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1279 /* enter the block */
1280 func->curblock = ontrue;
1283 cgen = self->on_true->expression.codegen;
1284 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1290 if (self->on_false) {
1291 /* create on-false block */
1292 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1296 /* enter the block */
1297 func->curblock = onfalse;
1300 cgen = self->on_false->expression.codegen;
1301 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1306 /* Merge block were they all merge in to */
1307 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1311 /* add jumps ot the merge block */
1312 if (ontrue && !ir_block_create_jump(ontrue, merge))
1314 if (onfalse && !ir_block_create_jump(onfalse, merge))
1317 /* we create the if here, that way all blocks are ordered :)
1319 if (!ir_block_create_if(cond, condval,
1320 (ontrue ? ontrue : merge),
1321 (onfalse ? onfalse : merge)))
1326 /* Now enter the merge block */
1327 func->curblock = merge;
1332 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1334 ast_expression_codegen *cgen;
1337 ir_value *trueval, *falseval;
1340 ir_block *cond = func->curblock;
1345 /* Ternary can never create an lvalue... */
1349 /* In theory it shouldn't be possible to pass through a node twice, but
1350 * in case we add any kind of optimization pass for the AST itself, it
1351 * may still happen, thus we remember a created ir_value and simply return one
1352 * if it already exists.
1354 if (self->phi_out) {
1355 *out = self->phi_out;
1359 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1361 /* generate the condition */
1362 func->curblock = cond;
1363 cgen = self->cond->expression.codegen;
1364 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1367 /* create on-true block */
1368 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1373 /* enter the block */
1374 func->curblock = ontrue;
1377 cgen = self->on_true->expression.codegen;
1378 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1382 /* create on-false block */
1383 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1388 /* enter the block */
1389 func->curblock = onfalse;
1392 cgen = self->on_false->expression.codegen;
1393 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1397 /* create merge block */
1398 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1401 /* jump to merge block */
1402 if (!ir_block_create_jump(ontrue, merge))
1404 if (!ir_block_create_jump(onfalse, merge))
1407 /* create if instruction */
1408 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1411 /* Now enter the merge block */
1412 func->curblock = merge;
1414 /* Here, now, we need a PHI node
1415 * but first some sanity checking...
1417 if (trueval->vtype != falseval->vtype) {
1418 /* error("ternary with different types on the two sides"); */
1423 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1425 !ir_phi_add(phi, ontrue, trueval) ||
1426 !ir_phi_add(phi, onfalse, falseval))
1431 self->phi_out = ir_phi_value(phi);
1432 *out = self->phi_out;
1437 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1439 ast_expression_codegen *cgen;
1441 ir_value *dummy = NULL;
1442 ir_value *precond = NULL;
1443 ir_value *postcond = NULL;
1445 /* Since we insert some jumps "late" so we have blocks
1446 * ordered "nicely", we need to keep track of the actual end-blocks
1447 * of expressions to add the jumps to.
1449 ir_block *bbody = NULL, *end_bbody = NULL;
1450 ir_block *bprecond = NULL, *end_bprecond = NULL;
1451 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1452 ir_block *bincrement = NULL, *end_bincrement = NULL;
1453 ir_block *bout = NULL, *bin = NULL;
1455 /* let's at least move the outgoing block to the end */
1458 /* 'break' and 'continue' need to be able to find the right blocks */
1459 ir_block *bcontinue = NULL;
1460 ir_block *bbreak = NULL;
1462 ir_block *old_bcontinue = NULL;
1463 ir_block *old_bbreak = NULL;
1465 ir_block *tmpblock = NULL;
1470 if (self->expression.outr) {
1471 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!\n");
1474 self->expression.outr = (ir_value*)1;
1477 * Should we ever need some kind of block ordering, better make this function
1478 * move blocks around than write a block ordering algorithm later... after all
1479 * the ast and ir should work together, not against each other.
1482 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1483 * anyway if for example it contains a ternary.
1487 cgen = self->initexpr->expression.codegen;
1488 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1492 /* Store the block from which we enter this chaos */
1493 bin = func->curblock;
1495 /* The pre-loop condition needs its own block since we
1496 * need to be able to jump to the start of that expression.
1500 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1504 /* the pre-loop-condition the least important place to 'continue' at */
1505 bcontinue = bprecond;
1508 func->curblock = bprecond;
1511 cgen = self->precond->expression.codegen;
1512 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1515 end_bprecond = func->curblock;
1517 bprecond = end_bprecond = NULL;
1520 /* Now the next blocks won't be ordered nicely, but we need to
1521 * generate them this early for 'break' and 'continue'.
1523 if (self->increment) {
1524 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1527 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1529 bincrement = end_bincrement = NULL;
1532 if (self->postcond) {
1533 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1536 bcontinue = bpostcond; /* postcond comes before the increment */
1538 bpostcond = end_bpostcond = NULL;
1541 bout_id = func->ir_func->blocks_count;
1542 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1547 /* The loop body... */
1550 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1555 func->curblock = bbody;
1557 old_bbreak = func->breakblock;
1558 old_bcontinue = func->continueblock;
1559 func->breakblock = bbreak;
1560 func->continueblock = bcontinue;
1563 cgen = self->body->expression.codegen;
1564 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1567 end_bbody = func->curblock;
1568 func->breakblock = old_bbreak;
1569 func->continueblock = old_bcontinue;
1572 /* post-loop-condition */
1576 func->curblock = bpostcond;
1579 cgen = self->postcond->expression.codegen;
1580 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1583 end_bpostcond = func->curblock;
1586 /* The incrementor */
1587 if (self->increment)
1590 func->curblock = bincrement;
1593 cgen = self->increment->expression.codegen;
1594 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1597 end_bincrement = func->curblock;
1600 /* In any case now, we continue from the outgoing block */
1601 func->curblock = bout;
1603 /* Now all blocks are in place */
1604 /* From 'bin' we jump to whatever comes first */
1605 if (bprecond) tmpblock = bprecond;
1606 else if (bbody) tmpblock = bbody;
1607 else if (bpostcond) tmpblock = bpostcond;
1608 else tmpblock = bout;
1609 if (!ir_block_create_jump(bin, tmpblock))
1615 ir_block *ontrue, *onfalse;
1616 if (bbody) ontrue = bbody;
1617 else if (bincrement) ontrue = bincrement;
1618 else if (bpostcond) ontrue = bpostcond;
1619 else ontrue = bprecond;
1621 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1628 if (bincrement) tmpblock = bincrement;
1629 else if (bpostcond) tmpblock = bpostcond;
1630 else if (bprecond) tmpblock = bprecond;
1631 else tmpblock = bout;
1632 if (!ir_block_create_jump(end_bbody, tmpblock))
1636 /* from increment */
1639 if (bpostcond) tmpblock = bpostcond;
1640 else if (bprecond) tmpblock = bprecond;
1641 else if (bbody) tmpblock = bbody;
1642 else tmpblock = bout;
1643 if (!ir_block_create_jump(end_bincrement, tmpblock))
1650 ir_block *ontrue, *onfalse;
1651 if (bprecond) ontrue = bprecond;
1652 else if (bbody) ontrue = bbody;
1653 else if (bincrement) ontrue = bincrement;
1654 else ontrue = bpostcond;
1656 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1660 /* Move 'bout' to the end */
1661 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1662 !ir_function_blocks_add(func->ir_func, bout))
1664 ir_block_delete(bout);
1671 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1673 ast_expression_codegen *cgen;
1674 ir_value_vector params;
1675 ir_instr *callinstr;
1678 ir_value *funval = NULL;
1680 /* return values are never lvalues */
1683 if (self->expression.outr) {
1684 *out = self->expression.outr;
1688 cgen = self->func->expression.codegen;
1689 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1694 MEM_VECTOR_INIT(¶ms, v);
1697 for (i = 0; i < self->params_count; ++i)
1700 ast_expression *expr = self->params[i];
1702 cgen = expr->expression.codegen;
1703 if (!(*cgen)(expr, func, false, ¶m))
1707 if (!ir_value_vector_v_add(¶ms, param))
1711 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1715 for (i = 0; i < params.v_count; ++i) {
1716 if (!ir_call_param(callinstr, params.v[i]))
1720 *out = ir_call_value(callinstr);
1721 self->expression.outr = *out;
1723 MEM_VECTOR_CLEAR(¶ms, v);
1726 MEM_VECTOR_CLEAR(¶ms, v);