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); \
36 ( (ast_node*)self )->node.destroy = (ast_node_delete*)destroyfn
38 /* It must not be possible to get here. */
39 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
41 fprintf(stderr, "ast node missing destroy()\n");
45 /* Initialize main ast node aprts */
46 static void ast_node_init(ast_node *self, lex_ctx ctx)
48 self->node.context = ctx;
49 self->node.destroy = &_ast_node_destroy;
50 self->node.keep = false;
53 /* General expression initialization */
54 static void ast_expression_init(ast_expression *self,
55 ast_expression_codegen *codegen)
57 self->expression.codegen = codegen;
58 self->expression.vtype = TYPE_VOID;
59 self->expression.next = NULL;
62 static void ast_expression_delete(ast_expression *self)
64 if (self->expression.next)
65 ast_delete(self->expression.next);
68 static void ast_expression_delete_full(ast_expression *self)
70 ast_expression_delete(self);
74 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
76 const ast_expression_common *cpex;
77 ast_expression_common *selfex;
83 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
85 cpex = &ex->expression;
86 selfex = &self->expression;
88 selfex->vtype = cpex->vtype;
91 selfex->next = ast_type_copy(ctx, cpex->next);
100 /* This may never be codegen()d */
101 selfex->codegen = NULL;
106 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
108 ast_instantiate(ast_value, ctx, ast_value_delete);
109 ast_expression_init((ast_expression*)self,
110 (ast_expression_codegen*)&ast_value_codegen);
111 self->expression.node.keep = true; /* keep */
113 self->name = name ? util_strdup(name) : NULL;
114 self->expression.vtype = t;
115 self->expression.next = NULL;
116 MEM_VECTOR_INIT(self, params);
117 self->isconst = false;
118 memset(&self->constval, 0, sizeof(self->constval));
124 MEM_VEC_FUNCTIONS(ast_value, ast_value*, params)
126 void ast_value_delete(ast_value* self)
130 mem_d((void*)self->name);
131 for (i = 0; i < self->params_count; ++i)
132 ast_value_delete(self->params[i]); /* delete, the ast_function is expected to die first */
133 MEM_VECTOR_CLEAR(self, params);
135 switch (self->expression.vtype)
138 mem_d((void*)self->constval.vstring);
141 /* unlink us from the function node */
142 self->constval.vfunc->vtype = NULL;
144 /* NOTE: delete function? currently collected in
145 * the parser structure
151 ast_expression_delete((ast_expression*)self);
155 bool ast_value_set_name(ast_value *self, const char *name)
158 mem_d((void*)self->name);
159 self->name = util_strdup(name);
163 ast_binary* ast_binary_new(lex_ctx ctx, int op,
164 ast_expression* left, ast_expression* right)
166 ast_instantiate(ast_binary, ctx, ast_binary_delete);
167 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
176 void ast_binary_delete(ast_binary *self)
178 ast_unref(self->left);
179 ast_unref(self->right);
180 ast_expression_delete((ast_expression*)self);
184 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
186 const ast_expression *outtype;
188 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
190 if (field->expression.vtype != TYPE_FIELD) {
195 outtype = field->expression.next;
198 /* Error: field has no type... */
202 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
204 self->expression.vtype = outtype->expression.vtype;
205 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
207 self->entity = entity;
213 void ast_entfield_delete(ast_entfield *self)
215 ast_unref(self->entity);
216 ast_unref(self->field);
217 ast_expression_delete((ast_expression*)self);
221 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
223 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
224 if (!ontrue && !onfalse) {
225 /* because it is invalid */
229 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
232 self->on_true = ontrue;
233 self->on_false = onfalse;
238 void ast_ifthen_delete(ast_ifthen *self)
240 ast_unref(self->cond);
242 ast_unref(self->on_true);
244 ast_unref(self->on_false);
245 ast_expression_delete((ast_expression*)self);
249 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
251 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
252 /* This time NEITHER must be NULL */
253 if (!ontrue || !onfalse) {
257 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
260 self->on_true = ontrue;
261 self->on_false = onfalse;
262 self->phi_out = NULL;
267 void ast_ternary_delete(ast_ternary *self)
269 ast_unref(self->cond);
270 ast_unref(self->on_true);
271 ast_unref(self->on_false);
272 ast_expression_delete((ast_expression*)self);
276 ast_loop* ast_loop_new(lex_ctx ctx,
277 ast_expression *initexpr,
278 ast_expression *precond,
279 ast_expression *postcond,
280 ast_expression *increment,
281 ast_expression *body)
283 ast_instantiate(ast_loop, ctx, ast_loop_delete);
284 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
286 self->initexpr = initexpr;
287 self->precond = precond;
288 self->postcond = postcond;
289 self->increment = increment;
295 void ast_loop_delete(ast_loop *self)
298 ast_unref(self->initexpr);
300 ast_unref(self->precond);
302 ast_unref(self->postcond);
304 ast_unref(self->increment);
306 ast_unref(self->body);
307 ast_expression_delete((ast_expression*)self);
311 ast_call* ast_call_new(lex_ctx ctx,
312 ast_expression *funcexpr)
314 ast_instantiate(ast_call, ctx, ast_call_delete);
315 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
317 MEM_VECTOR_INIT(self, params);
322 void ast_call_delete(ast_call *self)
325 for (i = 0; i < self->params_count; ++i)
326 ast_unref(self->params[i]);
327 MEM_VECTOR_CLEAR(self, params);
330 ast_unref(self->func);
332 ast_expression_delete((ast_expression*)self);
336 ast_store* ast_store_new(lex_ctx ctx, int op,
337 ast_value *dest, ast_expression *source)
339 ast_instantiate(ast_store, ctx, ast_store_delete);
340 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
344 self->source = source;
349 void ast_store_delete(ast_store *self)
351 ast_unref(self->dest);
352 ast_unref(self->source);
353 ast_expression_delete((ast_expression*)self);
357 ast_block* ast_block_new(lex_ctx ctx)
359 ast_instantiate(ast_block, ctx, ast_block_delete);
360 ast_expression_init((ast_expression*)self,
361 (ast_expression_codegen*)&ast_block_codegen);
363 MEM_VECTOR_INIT(self, locals);
364 MEM_VECTOR_INIT(self, exprs);
368 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
369 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
371 void ast_block_delete(ast_block *self)
374 for (i = 0; i < self->exprs_count; ++i)
375 ast_unref(self->exprs[i]);
376 MEM_VECTOR_CLEAR(self, exprs);
377 for (i = 0; i < self->locals_count; ++i)
378 ast_delete(self->locals[i]);
379 MEM_VECTOR_CLEAR(self, locals);
380 ast_expression_delete((ast_expression*)self);
384 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
386 ast_instantiate(ast_function, ctx, ast_function_delete);
390 vtype->expression.vtype != TYPE_FUNCTION)
397 self->name = name ? util_strdup(name) : NULL;
398 MEM_VECTOR_INIT(self, blocks);
400 self->labelcount = 0;
402 self->ir_func = NULL;
403 self->curblock = NULL;
405 self->breakblock = NULL;
406 self->continueblock = NULL;
408 vtype->isconst = true;
409 vtype->constval.vfunc = self;
414 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
416 void ast_function_delete(ast_function *self)
420 mem_d((void*)self->name);
422 /* ast_value_delete(self->vtype); */
423 self->vtype->isconst = false;
424 self->vtype->constval.vfunc = NULL;
425 /* We use unref - if it was stored in a global table it is supposed
426 * to be deleted from *there*
428 ast_unref(self->vtype);
430 for (i = 0; i < self->blocks_count; ++i)
431 ast_delete(self->blocks[i]);
432 MEM_VECTOR_CLEAR(self, blocks);
436 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
438 unsigned int base = 10;
439 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
440 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
449 int digit = num % base;
460 const char* ast_function_label(ast_function *self, const char *prefix)
462 size_t id = (self->labelcount++);
463 size_t len = strlen(prefix);
464 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
465 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
466 return self->labelbuf;
469 /*********************************************************************/
471 * by convention you must never pass NULL to the 'ir_value **out'
472 * parameter. If you really don't care about the output, pass a dummy.
473 * But I can't imagine a pituation where the output is truly unnecessary.
476 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
478 /* NOTE: This is the codegen for a variable used in an expression.
479 * It is not the codegen to generate the value. For this purpose,
480 * ast_local_codegen and ast_global_codegen are to be used before this
481 * is executed. ast_function_codegen should take care of its locals,
482 * and the ast-user should take care of ast_global_codegen to be used
483 * on all the globals.
491 bool ast_global_codegen(ast_value *self, ir_builder *ir)
494 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
496 ir_function *func = ir_builder_create_function(ir, self->name);
500 self->constval.vfunc->ir_func = func;
501 /* The function is filled later on ast_function_codegen... */
505 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
510 switch (self->expression.vtype)
513 if (!ir_value_set_float(v, self->constval.vfloat))
517 if (!ir_value_set_vector(v, self->constval.vvec))
521 if (!ir_value_set_string(v, self->constval.vstring))
525 /* Cannot generate an IR value for a function,
526 * need a pointer pointing to a function rather.
530 printf("TODO: global constant type %i\n", self->expression.vtype);
535 /* link us to the ir_value */
539 error: /* clean up */
544 bool ast_local_codegen(ast_value *self, ir_function *func)
547 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
549 /* Do we allow local functions? I think not...
550 * this is NOT a function pointer atm.
555 v = ir_function_create_local(func, self->name, self->expression.vtype);
559 /* A constant local... hmmm...
560 * I suppose the IR will have to deal with this
563 switch (self->expression.vtype)
566 if (!ir_value_set_float(v, self->constval.vfloat))
570 if (!ir_value_set_vector(v, self->constval.vvec))
574 if (!ir_value_set_string(v, self->constval.vstring))
578 printf("TODO: global constant type %i\n", self->expression.vtype);
583 /* link us to the ir_value */
587 error: /* clean up */
592 bool ast_function_codegen(ast_function *self, ir_builder *ir)
600 printf("ast_function's related ast_value was not generated yet\n");
604 self->curblock = ir_function_create_block(irf, "entry");
608 for (i = 0; i < self->blocks_count; ++i) {
609 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
610 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
614 /* TODO: check return types */
615 if (!self->curblock->is_return)
617 if (!self->vtype->expression.next ||
618 self->vtype->expression.next->expression.vtype == TYPE_VOID)
619 return ir_block_create_return(self->curblock, NULL);
622 /* error("missing return"); */
629 /* Note, you will not see ast_block_codegen generate ir_blocks.
630 * To the AST and the IR, blocks are 2 different things.
631 * In the AST it represents a block of code, usually enclosed in
632 * curly braces {...}.
633 * While in the IR it represents a block in terms of control-flow.
635 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
640 * Note: an ast-representation using the comma-operator
641 * of the form: (a, b, c) = x should not assign to c...
645 /* output is NULL at first, we'll have each expression
646 * assign to out output, thus, a comma-operator represention
647 * using an ast_block will return the last generated value,
648 * so: (b, c) + a executed both b and c, and returns c,
649 * which is then added to a.
653 /* generate locals */
654 for (i = 0; i < self->locals_count; ++i)
656 if (!ast_local_codegen(self->locals[i], func->ir_func))
660 for (i = 0; i < self->exprs_count; ++i)
662 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
663 if (!(*gen)(self->exprs[i], func, false, out))
670 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
672 ast_expression_codegen *cgen;
673 ir_value *left, *right;
675 cgen = self->dest->expression.codegen;
677 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
680 cgen = self->source->expression.codegen;
682 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
685 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
688 /* Theoretically, an assinment returns its left side as an
689 * lvalue, if we don't need an lvalue though, we return
690 * the right side as an rvalue, otherwise we have to
691 * somehow know whether or not we need to dereference the pointer
692 * on the left side - that is: OP_LOAD if it was an address.
693 * Also: in original QC we cannot OP_LOADP *anyway*.
695 *out = (lvalue ? left : right);
700 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
702 ast_expression_codegen *cgen;
703 ir_value *left, *right;
705 /* In the context of a binary operation, we can disregard
710 cgen = self->left->expression.codegen;
712 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
715 cgen = self->right->expression.codegen;
717 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
720 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
721 self->op, left, right);
728 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
730 ast_expression_codegen *cgen;
731 ir_value *ent, *field;
733 /* This function needs to take the 'lvalue' flag into account!
734 * As lvalue we provide a field-pointer, as rvalue we provide the
738 cgen = self->entity->expression.codegen;
739 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
742 cgen = self->field->expression.codegen;
743 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
748 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
751 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
752 ent, field, self->expression.vtype);
757 /* Hm that should be it... */
761 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
763 ast_expression_codegen *cgen;
768 ir_block *cond = func->curblock;
773 /* We don't output any value, thus also don't care about r/lvalue */
777 /* generate the condition */
778 func->curblock = cond;
779 cgen = self->cond->expression.codegen;
780 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
786 /* create on-true block */
787 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
791 /* enter the block */
792 func->curblock = ontrue;
795 cgen = self->on_true->expression.codegen;
796 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
802 if (self->on_false) {
803 /* create on-false block */
804 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
808 /* enter the block */
809 func->curblock = onfalse;
812 cgen = self->on_false->expression.codegen;
813 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
818 /* Merge block were they all merge in to */
819 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
823 /* add jumps ot the merge block */
824 if (ontrue && !ir_block_create_jump(ontrue, merge))
826 if (onfalse && !ir_block_create_jump(onfalse, merge))
829 /* we create the if here, that way all blocks are ordered :)
831 if (!ir_block_create_if(cond, condval,
832 (ontrue ? ontrue : merge),
833 (onfalse ? onfalse : merge)))
838 /* Now enter the merge block */
839 func->curblock = merge;
844 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
846 ast_expression_codegen *cgen;
849 ir_value *trueval, *falseval;
852 ir_block *cond = func->curblock;
857 /* In theory it shouldn't be possible to pass through a node twice, but
858 * in case we add any kind of optimization pass for the AST itself, it
859 * may still happen, thus we remember a created ir_value and simply return one
860 * if it already exists.
863 *out = self->phi_out;
867 /* Ternary can never create an lvalue... */
871 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
873 /* generate the condition */
874 func->curblock = cond;
875 cgen = self->cond->expression.codegen;
876 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
879 /* create on-true block */
880 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
885 /* enter the block */
886 func->curblock = ontrue;
889 cgen = self->on_true->expression.codegen;
890 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
894 /* create on-false block */
895 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
900 /* enter the block */
901 func->curblock = onfalse;
904 cgen = self->on_false->expression.codegen;
905 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
909 /* create merge block */
910 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
913 /* jump to merge block */
914 if (!ir_block_create_jump(ontrue, merge))
916 if (!ir_block_create_jump(onfalse, merge))
919 /* create if instruction */
920 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
923 /* Now enter the merge block */
924 func->curblock = merge;
926 /* Here, now, we need a PHI node
927 * but first some sanity checking...
929 if (trueval->vtype != falseval->vtype) {
930 /* error("ternary with different types on the two sides"); */
935 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
937 !ir_phi_add(phi, ontrue, trueval) ||
938 !ir_phi_add(phi, onfalse, falseval))
943 self->phi_out = ir_phi_value(phi);
944 *out = self->phi_out;
949 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
951 ast_expression_codegen *cgen;
953 ir_value *dummy = NULL;
954 ir_value *precond = NULL;
955 ir_value *postcond = NULL;
957 /* Since we insert some jumps "late" so we have blocks
958 * ordered "nicely", we need to keep track of the actual end-blocks
959 * of expressions to add the jumps to.
961 ir_block *bbody = NULL, *end_bbody = NULL;
962 ir_block *bprecond = NULL, *end_bprecond = NULL;
963 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
964 ir_block *bincrement = NULL, *end_bincrement = NULL;
965 ir_block *bout = NULL, *bin = NULL;
967 /* let's at least move the outgoing block to the end */
970 /* 'break' and 'continue' need to be able to find the right blocks */
971 ir_block *bcontinue = NULL;
972 ir_block *bbreak = NULL;
974 ir_block *old_bcontinue = NULL;
975 ir_block *old_bbreak = NULL;
977 ir_block *tmpblock = NULL;
983 * Should we ever need some kind of block ordering, better make this function
984 * move blocks around than write a block ordering algorithm later... after all
985 * the ast and ir should work together, not against each other.
988 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
989 * anyway if for example it contains a ternary.
993 cgen = self->initexpr->expression.codegen;
994 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
998 /* Store the block from which we enter this chaos */
999 bin = func->curblock;
1001 /* The pre-loop condition needs its own block since we
1002 * need to be able to jump to the start of that expression.
1006 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1010 /* the pre-loop-condition the least important place to 'continue' at */
1011 bcontinue = bprecond;
1014 func->curblock = bprecond;
1017 cgen = self->precond->expression.codegen;
1018 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1021 end_bprecond = func->curblock;
1023 bprecond = end_bprecond = NULL;
1026 /* Now the next blocks won't be ordered nicely, but we need to
1027 * generate them this early for 'break' and 'continue'.
1029 if (self->increment) {
1030 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1033 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1035 bincrement = end_bincrement = NULL;
1038 if (self->postcond) {
1039 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1042 bcontinue = bpostcond; /* postcond comes before the increment */
1044 bpostcond = end_bpostcond = NULL;
1047 bout_id = func->ir_func->blocks_count;
1048 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1053 /* The loop body... */
1056 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1061 func->curblock = bbody;
1063 old_bbreak = func->breakblock;
1064 old_bcontinue = func->continueblock;
1065 func->breakblock = bbreak;
1066 func->continueblock = bcontinue;
1069 cgen = self->body->expression.codegen;
1070 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1073 end_bbody = func->curblock;
1074 func->breakblock = old_bbreak;
1075 func->continueblock = old_bcontinue;
1078 /* post-loop-condition */
1082 func->curblock = bpostcond;
1085 cgen = self->postcond->expression.codegen;
1086 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1089 end_bpostcond = func->curblock;
1092 /* The incrementor */
1093 if (self->increment)
1096 func->curblock = bincrement;
1099 cgen = self->increment->expression.codegen;
1100 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1103 end_bincrement = func->curblock;
1106 /* In any case now, we continue from the outgoing block */
1107 func->curblock = bout;
1109 /* Now all blocks are in place */
1110 /* From 'bin' we jump to whatever comes first */
1111 if (bprecond) tmpblock = bprecond;
1112 else if (bbody) tmpblock = bbody;
1113 else if (bpostcond) tmpblock = bpostcond;
1114 else tmpblock = bout;
1115 if (!ir_block_create_jump(bin, tmpblock))
1121 ir_block *ontrue, *onfalse;
1122 if (bbody) ontrue = bbody;
1123 else if (bincrement) ontrue = bincrement;
1124 else if (bpostcond) ontrue = bpostcond;
1125 else ontrue = bprecond;
1127 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1134 if (bincrement) tmpblock = bincrement;
1135 else if (bpostcond) tmpblock = bpostcond;
1136 else if (bprecond) tmpblock = bprecond;
1137 else tmpblock = bout;
1138 if (!ir_block_create_jump(end_bbody, tmpblock))
1142 /* from increment */
1145 if (bpostcond) tmpblock = bpostcond;
1146 else if (bprecond) tmpblock = bprecond;
1147 else if (bbody) tmpblock = bbody;
1148 else tmpblock = bout;
1149 if (!ir_block_create_jump(end_bincrement, tmpblock))
1156 ir_block *ontrue, *onfalse;
1157 if (bprecond) ontrue = bprecond;
1158 else if (bbody) ontrue = bbody;
1159 else if (bincrement) ontrue = bincrement;
1160 else ontrue = bpostcond;
1162 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1166 /* Move 'bout' to the end */
1167 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1168 !ir_function_blocks_add(func->ir_func, bout))
1170 ir_block_delete(bout);
1177 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1179 /* TODO: call ir codegen */
1180 ast_expression_codegen *cgen;
1181 ir_value_vector params;
1182 ir_instr *callinstr;
1185 ir_value *funval = NULL;
1187 /* return values are never rvalues */
1190 cgen = self->func->expression.codegen;
1191 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1196 MEM_VECTOR_INIT(¶ms, v);
1199 for (i = 0; i < self->params_count; ++i)
1202 ast_expression *expr = self->params[i];
1204 cgen = expr->expression.codegen;
1205 if (!(*cgen)(expr, func, false, ¶m))
1209 if (!ir_value_vector_v_add(¶ms, param))
1213 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1217 for (i = 0; i < params.v_count; ++i) {
1218 if (!ir_call_param(callinstr, params.v[i]))
1222 *out = ir_call_value(callinstr);
1226 MEM_VECTOR_CLEAR(¶ms, v);