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);
399 MEM_VECTOR_INIT(self, params);
401 self->labelcount = 0;
404 self->ir_func = NULL;
405 self->curblock = NULL;
407 self->breakblock = NULL;
408 self->continueblock = NULL;
410 vtype->isconst = true;
411 vtype->constval.vfunc = self;
416 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
417 MEM_VEC_FUNCTIONS(ast_function, ast_value*, params)
419 void ast_function_delete(ast_function *self)
423 mem_d((void*)self->name);
425 /* ast_value_delete(self->vtype); */
426 self->vtype->isconst = false;
427 self->vtype->constval.vfunc = NULL;
428 /* We use unref - if it was stored in a global table it is supposed
429 * to be deleted from *there*
431 ast_unref(self->vtype);
433 for (i = 0; i < self->blocks_count; ++i)
434 ast_delete(self->blocks[i]);
435 MEM_VECTOR_CLEAR(self, blocks);
436 for (i = 0; i < self->params_count; ++i)
437 ast_delete(self->params[i]);
438 MEM_VECTOR_CLEAR(self, params);
442 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
444 unsigned int base = 10;
445 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
446 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
455 int digit = num % base;
466 const char* ast_function_label(ast_function *self, const char *prefix)
468 size_t id = (self->labelcount++);
469 size_t len = strlen(prefix);
470 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
471 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
472 return self->labelbuf;
475 /*********************************************************************/
477 * by convention you must never pass NULL to the 'ir_value **out'
478 * parameter. If you really don't care about the output, pass a dummy.
479 * But I can't imagine a pituation where the output is truly unnecessary.
482 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
484 /* NOTE: This is the codegen for a variable used in an expression.
485 * It is not the codegen to generate the value. For this purpose,
486 * ast_local_codegen and ast_global_codegen are to be used before this
487 * is executed. ast_function_codegen should take care of its locals,
488 * and the ast-user should take care of ast_global_codegen to be used
489 * on all the globals.
497 bool ast_global_codegen(ast_value *self, ir_builder *ir)
500 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
502 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
506 self->constval.vfunc->ir_func = func;
507 /* The function is filled later on ast_function_codegen... */
511 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
516 switch (self->expression.vtype)
519 if (!ir_value_set_float(v, self->constval.vfloat))
523 if (!ir_value_set_vector(v, self->constval.vvec))
527 if (!ir_value_set_string(v, self->constval.vstring))
531 printf("global of type function not properly generated\n");
533 /* Cannot generate an IR value for a function,
534 * need a pointer pointing to a function rather.
537 printf("TODO: global constant type %i\n", self->expression.vtype);
542 /* link us to the ir_value */
546 error: /* clean up */
551 bool ast_local_codegen(ast_value *self, ir_function *func)
554 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
556 /* Do we allow local functions? I think not...
557 * this is NOT a function pointer atm.
562 v = ir_function_create_local(func, self->name, self->expression.vtype);
566 /* A constant local... hmmm...
567 * I suppose the IR will have to deal with this
570 switch (self->expression.vtype)
573 if (!ir_value_set_float(v, self->constval.vfloat))
577 if (!ir_value_set_vector(v, self->constval.vvec))
581 if (!ir_value_set_string(v, self->constval.vstring))
585 printf("TODO: global constant type %i\n", self->expression.vtype);
590 /* link us to the ir_value */
594 error: /* clean up */
599 bool ast_function_codegen(ast_function *self, ir_builder *ir)
607 printf("ast_function's related ast_value was not generated yet\n");
611 for (i = 0; i < self->params_count; ++i)
613 if (!ir_function_params_add(irf, self->params[i]->expression.vtype))
618 irf->builtin = self->builtin;
622 self->curblock = ir_function_create_block(irf, "entry");
626 for (i = 0; i < self->blocks_count; ++i) {
627 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
628 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
632 /* TODO: check return types */
633 if (!self->curblock->is_return)
635 if (!self->vtype->expression.next ||
636 self->vtype->expression.next->expression.vtype == TYPE_VOID)
637 return ir_block_create_return(self->curblock, NULL);
640 /* error("missing return"); */
647 /* Note, you will not see ast_block_codegen generate ir_blocks.
648 * To the AST and the IR, blocks are 2 different things.
649 * In the AST it represents a block of code, usually enclosed in
650 * curly braces {...}.
651 * While in the IR it represents a block in terms of control-flow.
653 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
658 * Note: an ast-representation using the comma-operator
659 * of the form: (a, b, c) = x should not assign to c...
663 /* output is NULL at first, we'll have each expression
664 * assign to out output, thus, a comma-operator represention
665 * using an ast_block will return the last generated value,
666 * so: (b, c) + a executed both b and c, and returns c,
667 * which is then added to a.
671 /* generate locals */
672 for (i = 0; i < self->locals_count; ++i)
674 if (!ast_local_codegen(self->locals[i], func->ir_func))
678 for (i = 0; i < self->exprs_count; ++i)
680 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
681 if (!(*gen)(self->exprs[i], func, false, out))
688 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
690 ast_expression_codegen *cgen;
691 ir_value *left, *right;
693 cgen = self->dest->expression.codegen;
695 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
698 cgen = self->source->expression.codegen;
700 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
703 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
706 /* Theoretically, an assinment returns its left side as an
707 * lvalue, if we don't need an lvalue though, we return
708 * the right side as an rvalue, otherwise we have to
709 * somehow know whether or not we need to dereference the pointer
710 * on the left side - that is: OP_LOAD if it was an address.
711 * Also: in original QC we cannot OP_LOADP *anyway*.
713 *out = (lvalue ? left : right);
718 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
720 ast_expression_codegen *cgen;
721 ir_value *left, *right;
723 /* In the context of a binary operation, we can disregard
728 cgen = self->left->expression.codegen;
730 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
733 cgen = self->right->expression.codegen;
735 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
738 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
739 self->op, left, right);
746 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
748 ast_expression_codegen *cgen;
749 ir_value *ent, *field;
751 /* This function needs to take the 'lvalue' flag into account!
752 * As lvalue we provide a field-pointer, as rvalue we provide the
756 cgen = self->entity->expression.codegen;
757 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
760 cgen = self->field->expression.codegen;
761 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
766 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
769 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
770 ent, field, self->expression.vtype);
775 /* Hm that should be it... */
779 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
781 ast_expression_codegen *cgen;
786 ir_block *cond = func->curblock;
791 /* We don't output any value, thus also don't care about r/lvalue */
795 /* generate the condition */
796 func->curblock = cond;
797 cgen = self->cond->expression.codegen;
798 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
804 /* create on-true block */
805 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
809 /* enter the block */
810 func->curblock = ontrue;
813 cgen = self->on_true->expression.codegen;
814 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
820 if (self->on_false) {
821 /* create on-false block */
822 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
826 /* enter the block */
827 func->curblock = onfalse;
830 cgen = self->on_false->expression.codegen;
831 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
836 /* Merge block were they all merge in to */
837 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
841 /* add jumps ot the merge block */
842 if (ontrue && !ir_block_create_jump(ontrue, merge))
844 if (onfalse && !ir_block_create_jump(onfalse, merge))
847 /* we create the if here, that way all blocks are ordered :)
849 if (!ir_block_create_if(cond, condval,
850 (ontrue ? ontrue : merge),
851 (onfalse ? onfalse : merge)))
856 /* Now enter the merge block */
857 func->curblock = merge;
862 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
864 ast_expression_codegen *cgen;
867 ir_value *trueval, *falseval;
870 ir_block *cond = func->curblock;
875 /* In theory it shouldn't be possible to pass through a node twice, but
876 * in case we add any kind of optimization pass for the AST itself, it
877 * may still happen, thus we remember a created ir_value and simply return one
878 * if it already exists.
881 *out = self->phi_out;
885 /* Ternary can never create an lvalue... */
889 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
891 /* generate the condition */
892 func->curblock = cond;
893 cgen = self->cond->expression.codegen;
894 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
897 /* create on-true block */
898 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
903 /* enter the block */
904 func->curblock = ontrue;
907 cgen = self->on_true->expression.codegen;
908 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
912 /* create on-false block */
913 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
918 /* enter the block */
919 func->curblock = onfalse;
922 cgen = self->on_false->expression.codegen;
923 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
927 /* create merge block */
928 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
931 /* jump to merge block */
932 if (!ir_block_create_jump(ontrue, merge))
934 if (!ir_block_create_jump(onfalse, merge))
937 /* create if instruction */
938 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
941 /* Now enter the merge block */
942 func->curblock = merge;
944 /* Here, now, we need a PHI node
945 * but first some sanity checking...
947 if (trueval->vtype != falseval->vtype) {
948 /* error("ternary with different types on the two sides"); */
953 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
955 !ir_phi_add(phi, ontrue, trueval) ||
956 !ir_phi_add(phi, onfalse, falseval))
961 self->phi_out = ir_phi_value(phi);
962 *out = self->phi_out;
967 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
969 ast_expression_codegen *cgen;
971 ir_value *dummy = NULL;
972 ir_value *precond = NULL;
973 ir_value *postcond = NULL;
975 /* Since we insert some jumps "late" so we have blocks
976 * ordered "nicely", we need to keep track of the actual end-blocks
977 * of expressions to add the jumps to.
979 ir_block *bbody = NULL, *end_bbody = NULL;
980 ir_block *bprecond = NULL, *end_bprecond = NULL;
981 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
982 ir_block *bincrement = NULL, *end_bincrement = NULL;
983 ir_block *bout = NULL, *bin = NULL;
985 /* let's at least move the outgoing block to the end */
988 /* 'break' and 'continue' need to be able to find the right blocks */
989 ir_block *bcontinue = NULL;
990 ir_block *bbreak = NULL;
992 ir_block *old_bcontinue = NULL;
993 ir_block *old_bbreak = NULL;
995 ir_block *tmpblock = NULL;
1001 * Should we ever need some kind of block ordering, better make this function
1002 * move blocks around than write a block ordering algorithm later... after all
1003 * the ast and ir should work together, not against each other.
1006 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1007 * anyway if for example it contains a ternary.
1011 cgen = self->initexpr->expression.codegen;
1012 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1016 /* Store the block from which we enter this chaos */
1017 bin = func->curblock;
1019 /* The pre-loop condition needs its own block since we
1020 * need to be able to jump to the start of that expression.
1024 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1028 /* the pre-loop-condition the least important place to 'continue' at */
1029 bcontinue = bprecond;
1032 func->curblock = bprecond;
1035 cgen = self->precond->expression.codegen;
1036 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1039 end_bprecond = func->curblock;
1041 bprecond = end_bprecond = NULL;
1044 /* Now the next blocks won't be ordered nicely, but we need to
1045 * generate them this early for 'break' and 'continue'.
1047 if (self->increment) {
1048 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1051 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1053 bincrement = end_bincrement = NULL;
1056 if (self->postcond) {
1057 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1060 bcontinue = bpostcond; /* postcond comes before the increment */
1062 bpostcond = end_bpostcond = NULL;
1065 bout_id = func->ir_func->blocks_count;
1066 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1071 /* The loop body... */
1074 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1079 func->curblock = bbody;
1081 old_bbreak = func->breakblock;
1082 old_bcontinue = func->continueblock;
1083 func->breakblock = bbreak;
1084 func->continueblock = bcontinue;
1087 cgen = self->body->expression.codegen;
1088 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1091 end_bbody = func->curblock;
1092 func->breakblock = old_bbreak;
1093 func->continueblock = old_bcontinue;
1096 /* post-loop-condition */
1100 func->curblock = bpostcond;
1103 cgen = self->postcond->expression.codegen;
1104 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1107 end_bpostcond = func->curblock;
1110 /* The incrementor */
1111 if (self->increment)
1114 func->curblock = bincrement;
1117 cgen = self->increment->expression.codegen;
1118 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1121 end_bincrement = func->curblock;
1124 /* In any case now, we continue from the outgoing block */
1125 func->curblock = bout;
1127 /* Now all blocks are in place */
1128 /* From 'bin' we jump to whatever comes first */
1129 if (bprecond) tmpblock = bprecond;
1130 else if (bbody) tmpblock = bbody;
1131 else if (bpostcond) tmpblock = bpostcond;
1132 else tmpblock = bout;
1133 if (!ir_block_create_jump(bin, tmpblock))
1139 ir_block *ontrue, *onfalse;
1140 if (bbody) ontrue = bbody;
1141 else if (bincrement) ontrue = bincrement;
1142 else if (bpostcond) ontrue = bpostcond;
1143 else ontrue = bprecond;
1145 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1152 if (bincrement) tmpblock = bincrement;
1153 else if (bpostcond) tmpblock = bpostcond;
1154 else if (bprecond) tmpblock = bprecond;
1155 else tmpblock = bout;
1156 if (!ir_block_create_jump(end_bbody, tmpblock))
1160 /* from increment */
1163 if (bpostcond) tmpblock = bpostcond;
1164 else if (bprecond) tmpblock = bprecond;
1165 else if (bbody) tmpblock = bbody;
1166 else tmpblock = bout;
1167 if (!ir_block_create_jump(end_bincrement, tmpblock))
1174 ir_block *ontrue, *onfalse;
1175 if (bprecond) ontrue = bprecond;
1176 else if (bbody) ontrue = bbody;
1177 else if (bincrement) ontrue = bincrement;
1178 else ontrue = bpostcond;
1180 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1184 /* Move 'bout' to the end */
1185 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1186 !ir_function_blocks_add(func->ir_func, bout))
1188 ir_block_delete(bout);
1195 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1197 /* TODO: call ir codegen */
1198 ast_expression_codegen *cgen;
1199 ir_value_vector params;
1200 ir_instr *callinstr;
1203 ir_value *funval = NULL;
1205 /* return values are never rvalues */
1208 cgen = self->func->expression.codegen;
1209 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1214 MEM_VECTOR_INIT(¶ms, v);
1217 for (i = 0; i < self->params_count; ++i)
1220 ast_expression *expr = self->params[i];
1222 cgen = expr->expression.codegen;
1223 if (!(*cgen)(expr, func, false, ¶m))
1227 if (!ir_value_vector_v_add(¶ms, param))
1231 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1235 for (i = 0; i < params.v_count; ++i) {
1236 if (!ir_call_param(callinstr, params.v[i]))
1240 *out = ir_call_value(callinstr);
1244 MEM_VECTOR_CLEAR(¶ms, v);