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 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_store* ast_store_new(lex_ctx ctx, int op,
312 ast_value *dest, ast_expression *source)
314 ast_instantiate(ast_store, ctx, ast_store_delete);
315 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
319 self->source = source;
324 void ast_store_delete(ast_store *self)
326 ast_unref(self->dest);
327 ast_unref(self->source);
328 ast_expression_delete((ast_expression*)self);
332 ast_block* ast_block_new(lex_ctx ctx)
334 ast_instantiate(ast_block, ctx, ast_block_delete);
335 ast_expression_init((ast_expression*)self,
336 (ast_expression_codegen*)&ast_block_codegen);
338 MEM_VECTOR_INIT(self, locals);
339 MEM_VECTOR_INIT(self, exprs);
343 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
344 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
346 void ast_block_delete(ast_block *self)
349 for (i = 0; i < self->exprs_count; ++i)
350 ast_unref(self->exprs[i]);
351 MEM_VECTOR_CLEAR(self, exprs);
352 for (i = 0; i < self->locals_count; ++i)
353 ast_delete(self->locals[i]);
354 MEM_VECTOR_CLEAR(self, locals);
355 ast_expression_delete((ast_expression*)self);
359 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
361 ast_instantiate(ast_function, ctx, ast_function_delete);
365 vtype->expression.vtype != TYPE_FUNCTION)
372 self->name = name ? util_strdup(name) : NULL;
373 MEM_VECTOR_INIT(self, blocks);
375 self->labelcount = 0;
377 self->ir_func = NULL;
378 self->curblock = NULL;
380 self->breakblock = NULL;
381 self->continueblock = NULL;
383 vtype->isconst = true;
384 vtype->constval.vfunc = self;
389 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
391 void ast_function_delete(ast_function *self)
395 mem_d((void*)self->name);
397 /* ast_value_delete(self->vtype); */
398 self->vtype->isconst = false;
399 self->vtype->constval.vfunc = NULL;
400 /* We use unref - if it was stored in a global table it is supposed
401 * to be deleted from *there*
403 ast_unref(self->vtype);
405 for (i = 0; i < self->blocks_count; ++i)
406 ast_delete(self->blocks[i]);
407 MEM_VECTOR_CLEAR(self, blocks);
411 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
413 unsigned int base = 10;
414 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
415 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
424 int digit = num % base;
435 const char* ast_function_label(ast_function *self, const char *prefix)
437 size_t id = (self->labelcount++);
438 size_t len = strlen(prefix);
439 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
440 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
441 return self->labelbuf;
444 /*********************************************************************/
446 * by convention you must never pass NULL to the 'ir_value **out'
447 * parameter. If you really don't care about the output, pass a dummy.
448 * But I can't imagine a pituation where the output is truly unnecessary.
451 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
453 /* NOTE: This is the codegen for a variable used in an expression.
454 * It is not the codegen to generate the value. For this purpose,
455 * ast_local_codegen and ast_global_codegen are to be used before this
456 * is executed. ast_function_codegen should take care of its locals,
457 * and the ast-user should take care of ast_global_codegen to be used
458 * on all the globals.
466 bool ast_global_codegen(ast_value *self, ir_builder *ir)
469 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
471 ir_function *func = ir_builder_create_function(ir, self->name);
475 self->constval.vfunc->ir_func = func;
476 /* The function is filled later on ast_function_codegen... */
480 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
485 switch (self->expression.vtype)
488 if (!ir_value_set_float(v, self->constval.vfloat))
492 if (!ir_value_set_vector(v, self->constval.vvec))
496 if (!ir_value_set_string(v, self->constval.vstring))
500 /* Cannot generate an IR value for a function,
501 * need a pointer pointing to a function rather.
505 printf("TODO: global constant type %i\n", self->expression.vtype);
510 /* link us to the ir_value */
514 error: /* clean up */
519 bool ast_local_codegen(ast_value *self, ir_function *func)
522 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
524 /* Do we allow local functions? I think not...
525 * this is NOT a function pointer atm.
530 v = ir_function_create_local(func, self->name, self->expression.vtype);
534 /* A constant local... hmmm...
535 * I suppose the IR will have to deal with this
538 switch (self->expression.vtype)
541 if (!ir_value_set_float(v, self->constval.vfloat))
545 if (!ir_value_set_vector(v, self->constval.vvec))
549 if (!ir_value_set_string(v, self->constval.vstring))
553 printf("TODO: global constant type %i\n", self->expression.vtype);
558 /* link us to the ir_value */
562 error: /* clean up */
567 bool ast_function_codegen(ast_function *self, ir_builder *ir)
575 printf("ast_function's related ast_value was not generated yet\n");
579 self->curblock = ir_function_create_block(irf, "entry");
583 for (i = 0; i < self->blocks_count; ++i) {
584 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
585 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
589 /* TODO: check return types */
590 if (!self->curblock->is_return)
592 if (!self->vtype->expression.next ||
593 self->vtype->expression.next->expression.vtype == TYPE_VOID)
594 return ir_block_create_return(self->curblock, NULL);
597 /* error("missing return"); */
604 /* Note, you will not see ast_block_codegen generate ir_blocks.
605 * To the AST and the IR, blocks are 2 different things.
606 * In the AST it represents a block of code, usually enclosed in
607 * curly braces {...}.
608 * While in the IR it represents a block in terms of control-flow.
610 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
615 * Note: an ast-representation using the comma-operator
616 * of the form: (a, b, c) = x should not assign to c...
620 /* output is NULL at first, we'll have each expression
621 * assign to out output, thus, a comma-operator represention
622 * using an ast_block will return the last generated value,
623 * so: (b, c) + a executed both b and c, and returns c,
624 * which is then added to a.
628 /* generate locals */
629 for (i = 0; i < self->locals_count; ++i)
631 if (!ast_local_codegen(self->locals[i], func->ir_func))
635 for (i = 0; i < self->exprs_count; ++i)
637 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
638 if (!(*gen)(self->exprs[i], func, false, out))
645 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
647 ast_expression_codegen *cgen;
648 ir_value *left, *right;
650 cgen = self->dest->expression.codegen;
652 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
655 cgen = self->source->expression.codegen;
657 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
660 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
663 /* Theoretically, an assinment returns its left side as an
664 * lvalue, if we don't need an lvalue though, we return
665 * the right side as an rvalue, otherwise we have to
666 * somehow know whether or not we need to dereference the pointer
667 * on the left side - that is: OP_LOAD if it was an address.
668 * Also: in original QC we cannot OP_LOADP *anyway*.
670 *out = (lvalue ? left : right);
675 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
677 ast_expression_codegen *cgen;
678 ir_value *left, *right;
680 /* In the context of a binary operation, we can disregard
685 cgen = self->left->expression.codegen;
687 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
690 cgen = self->right->expression.codegen;
692 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
695 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
696 self->op, left, right);
703 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
705 ast_expression_codegen *cgen;
706 ir_value *ent, *field;
708 /* This function needs to take the 'lvalue' flag into account!
709 * As lvalue we provide a field-pointer, as rvalue we provide the
713 cgen = self->entity->expression.codegen;
714 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
717 cgen = self->field->expression.codegen;
718 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
723 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
726 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
727 ent, field, self->expression.vtype);
732 /* Hm that should be it... */
736 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
738 ast_expression_codegen *cgen;
743 ir_block *cond = func->curblock;
748 /* We don't output any value, thus also don't care about r/lvalue */
752 /* generate the condition */
753 func->curblock = cond;
754 cgen = self->cond->expression.codegen;
755 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
761 /* create on-true block */
762 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
766 /* enter the block */
767 func->curblock = ontrue;
770 cgen = self->on_true->expression.codegen;
771 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
777 if (self->on_false) {
778 /* create on-false block */
779 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
783 /* enter the block */
784 func->curblock = onfalse;
787 cgen = self->on_false->expression.codegen;
788 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
793 /* Merge block were they all merge in to */
794 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
798 /* add jumps ot the merge block */
799 if (ontrue && !ir_block_create_jump(ontrue, merge))
801 if (onfalse && !ir_block_create_jump(onfalse, merge))
804 /* we create the if here, that way all blocks are ordered :)
806 if (!ir_block_create_if(cond, condval,
807 (ontrue ? ontrue : merge),
808 (onfalse ? onfalse : merge)))
813 /* Now enter the merge block */
814 func->curblock = merge;
819 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
821 ast_expression_codegen *cgen;
824 ir_value *trueval, *falseval;
827 ir_block *cond = func->curblock;
832 /* In theory it shouldn't be possible to pass through a node twice, but
833 * in case we add any kind of optimization pass for the AST itself, it
834 * may still happen, thus we remember a created ir_value and simply return one
835 * if it already exists.
838 *out = self->phi_out;
842 /* Ternary can never create an lvalue... */
846 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
848 /* generate the condition */
849 func->curblock = cond;
850 cgen = self->cond->expression.codegen;
851 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
854 /* create on-true block */
855 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
860 /* enter the block */
861 func->curblock = ontrue;
864 cgen = self->on_true->expression.codegen;
865 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
869 /* create on-false block */
870 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
875 /* enter the block */
876 func->curblock = onfalse;
879 cgen = self->on_false->expression.codegen;
880 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
884 /* create merge block */
885 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
888 /* jump to merge block */
889 if (!ir_block_create_jump(ontrue, merge))
891 if (!ir_block_create_jump(onfalse, merge))
894 /* create if instruction */
895 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
898 /* Now enter the merge block */
899 func->curblock = merge;
901 /* Here, now, we need a PHI node
902 * but first some sanity checking...
904 if (trueval->vtype != falseval->vtype) {
905 /* error("ternary with different types on the two sides"); */
910 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
912 !ir_phi_add(phi, ontrue, trueval) ||
913 !ir_phi_add(phi, onfalse, falseval))
918 self->phi_out = ir_phi_value(phi);
919 *out = self->phi_out;
924 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
926 ast_expression_codegen *cgen;
932 /* Since we insert some jumps "late" so we have blocks
933 * ordered "nicely", we need to keep track of the actual end-blocks
934 * of expressions to add the jumps to.
936 ir_block *bbody, *end_bbody;
937 ir_block *bprecond, *end_bprecond;
938 ir_block *bpostcond, *end_bpostcond;
939 ir_block *bincrement, *end_bincrement;
940 ir_block *bout, *bin;
942 /* let's at least move the outgoing block to the end */
945 /* 'break' and 'continue' need to be able to find the right blocks */
946 ir_block *bcontinue = NULL;
947 ir_block *bbreak = NULL;
949 ir_block *old_bcontinue;
950 ir_block *old_bbreak;
956 * Should we ever need some kind of block ordering, better make this function
957 * move blocks around than write a block ordering algorithm later... after all
958 * the ast and ir should work together, not against each other.
961 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
962 * anyway if for example it contains a ternary.
966 cgen = self->initexpr->expression.codegen;
967 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
971 /* Store the block from which we enter this chaos */
972 bin = func->curblock;
974 /* The pre-loop condition needs its own block since we
975 * need to be able to jump to the start of that expression.
979 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
983 /* the pre-loop-condition the least important place to 'continue' at */
984 bcontinue = bprecond;
987 func->curblock = bprecond;
990 cgen = self->precond->expression.codegen;
991 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
994 end_bprecond = func->curblock;
996 bprecond = end_bprecond = NULL;
999 /* Now the next blocks won't be ordered nicely, but we need to
1000 * generate them this early for 'break' and 'continue'.
1002 if (self->increment) {
1003 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1006 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1008 bincrement = end_bincrement = NULL;
1011 if (self->postcond) {
1012 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1015 bcontinue = bpostcond; /* postcond comes before the increment */
1017 bpostcond = end_bpostcond = NULL;
1020 bout_id = func->ir_func->blocks_count;
1021 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1026 /* The loop body... */
1029 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1034 func->curblock = bbody;
1036 old_bbreak = func->breakblock;
1037 old_bcontinue = func->continueblock;
1038 func->breakblock = bbreak;
1039 func->continueblock = bcontinue;
1042 cgen = self->body->expression.codegen;
1043 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1046 end_bbody = func->curblock;
1047 func->breakblock = old_bbreak;
1048 func->continueblock = old_bcontinue;
1051 /* post-loop-condition */
1055 func->curblock = bpostcond;
1058 cgen = self->postcond->expression.codegen;
1059 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1062 end_bpostcond = func->curblock;
1065 /* The incrementor */
1066 if (self->increment)
1069 func->curblock = bincrement;
1072 cgen = self->increment->expression.codegen;
1073 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1076 end_bincrement = func->curblock;
1079 /* In any case now, we continue from the outgoing block */
1080 func->curblock = bout;
1082 /* Now all blocks are in place */
1083 /* From 'bin' we jump to whatever comes first */
1084 if (bprecond && !ir_block_create_jump(bin, bprecond))
1086 else if (bbody && !ir_block_create_jump(bin, bbody))
1088 else if (bpostcond && !ir_block_create_jump(bin, bpostcond))
1090 else if ( !ir_block_create_jump(bin, bout))
1096 ir_block *ontrue, *onfalse;
1097 if (bbody) ontrue = bbody;
1098 else if (bincrement) ontrue = bincrement;
1099 else if (bpostcond) ontrue = bpostcond;
1100 else ontrue = bprecond;
1102 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1109 if (bincrement && !ir_block_create_jump(end_bbody, bincrement))
1111 else if (bpostcond && !ir_block_create_jump(end_bbody, bpostcond))
1113 else if (bprecond && !ir_block_create_jump(end_bbody, bprecond))
1115 else if (!ir_block_create_jump(end_bbody, bout))
1119 /* from increment */
1122 if (bpostcond && !ir_block_create_jump(end_bincrement, bpostcond))
1124 else if (bprecond && !ir_block_create_jump(end_bincrement, bprecond))
1126 else if (bbody && !ir_block_create_jump(end_bincrement, bbody))
1128 else if (!ir_block_create_jump(end_bincrement, bout))
1135 ir_block *ontrue, *onfalse;
1136 if (bprecond) ontrue = bprecond;
1137 else if (bbody) ontrue = bbody;
1138 else if (bincrement) ontrue = bincrement;
1139 else ontrue = bpostcond;
1141 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1145 /* Move 'bout' to the end */
1146 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1147 !ir_function_blocks_add(func->ir_func, bout))
1149 ir_block_delete(bout);