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_unary* ast_unary_new(lex_ctx ctx, int op,
185 ast_expression *expr)
187 ast_instantiate(ast_unary, ctx, ast_unary_delete);
188 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
191 self->operand = expr;
196 void ast_unary_delete(ast_unary *self)
198 ast_unref(self->operand);
199 ast_expression_delete((ast_expression*)self);
203 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
205 const ast_expression *outtype;
207 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
209 if (field->expression.vtype != TYPE_FIELD) {
214 outtype = field->expression.next;
217 /* Error: field has no type... */
221 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
223 self->expression.vtype = outtype->expression.vtype;
224 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
226 self->entity = entity;
232 void ast_entfield_delete(ast_entfield *self)
234 ast_unref(self->entity);
235 ast_unref(self->field);
236 ast_expression_delete((ast_expression*)self);
240 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
242 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
243 if (!ontrue && !onfalse) {
244 /* because it is invalid */
248 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
251 self->on_true = ontrue;
252 self->on_false = onfalse;
257 void ast_ifthen_delete(ast_ifthen *self)
259 ast_unref(self->cond);
261 ast_unref(self->on_true);
263 ast_unref(self->on_false);
264 ast_expression_delete((ast_expression*)self);
268 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
270 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
271 /* This time NEITHER must be NULL */
272 if (!ontrue || !onfalse) {
276 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
279 self->on_true = ontrue;
280 self->on_false = onfalse;
281 self->phi_out = NULL;
286 void ast_ternary_delete(ast_ternary *self)
288 ast_unref(self->cond);
289 ast_unref(self->on_true);
290 ast_unref(self->on_false);
291 ast_expression_delete((ast_expression*)self);
295 ast_loop* ast_loop_new(lex_ctx ctx,
296 ast_expression *initexpr,
297 ast_expression *precond,
298 ast_expression *postcond,
299 ast_expression *increment,
300 ast_expression *body)
302 ast_instantiate(ast_loop, ctx, ast_loop_delete);
303 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
305 self->initexpr = initexpr;
306 self->precond = precond;
307 self->postcond = postcond;
308 self->increment = increment;
314 void ast_loop_delete(ast_loop *self)
317 ast_unref(self->initexpr);
319 ast_unref(self->precond);
321 ast_unref(self->postcond);
323 ast_unref(self->increment);
325 ast_unref(self->body);
326 ast_expression_delete((ast_expression*)self);
330 ast_call* ast_call_new(lex_ctx ctx,
331 ast_expression *funcexpr)
333 ast_instantiate(ast_call, ctx, ast_call_delete);
334 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
336 MEM_VECTOR_INIT(self, params);
338 self->func = funcexpr;
342 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
344 void ast_call_delete(ast_call *self)
347 for (i = 0; i < self->params_count; ++i)
348 ast_unref(self->params[i]);
349 MEM_VECTOR_CLEAR(self, params);
352 ast_unref(self->func);
354 ast_expression_delete((ast_expression*)self);
358 ast_store* ast_store_new(lex_ctx ctx, int op,
359 ast_value *dest, ast_expression *source)
361 ast_instantiate(ast_store, ctx, ast_store_delete);
362 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
366 self->source = source;
371 void ast_store_delete(ast_store *self)
373 ast_unref(self->dest);
374 ast_unref(self->source);
375 ast_expression_delete((ast_expression*)self);
379 ast_block* ast_block_new(lex_ctx ctx)
381 ast_instantiate(ast_block, ctx, ast_block_delete);
382 ast_expression_init((ast_expression*)self,
383 (ast_expression_codegen*)&ast_block_codegen);
385 MEM_VECTOR_INIT(self, locals);
386 MEM_VECTOR_INIT(self, exprs);
390 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
391 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
393 void ast_block_delete(ast_block *self)
396 for (i = 0; i < self->exprs_count; ++i)
397 ast_unref(self->exprs[i]);
398 MEM_VECTOR_CLEAR(self, exprs);
399 for (i = 0; i < self->locals_count; ++i)
400 ast_delete(self->locals[i]);
401 MEM_VECTOR_CLEAR(self, locals);
402 ast_expression_delete((ast_expression*)self);
406 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
408 ast_instantiate(ast_function, ctx, ast_function_delete);
412 vtype->expression.vtype != TYPE_FUNCTION)
419 self->name = name ? util_strdup(name) : NULL;
420 MEM_VECTOR_INIT(self, blocks);
422 self->labelcount = 0;
425 self->ir_func = NULL;
426 self->curblock = NULL;
428 self->breakblock = NULL;
429 self->continueblock = NULL;
431 vtype->isconst = true;
432 vtype->constval.vfunc = self;
437 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
439 void ast_function_delete(ast_function *self)
443 mem_d((void*)self->name);
445 /* ast_value_delete(self->vtype); */
446 self->vtype->isconst = false;
447 self->vtype->constval.vfunc = NULL;
448 /* We use unref - if it was stored in a global table it is supposed
449 * to be deleted from *there*
451 ast_unref(self->vtype);
453 for (i = 0; i < self->blocks_count; ++i)
454 ast_delete(self->blocks[i]);
455 MEM_VECTOR_CLEAR(self, blocks);
459 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
461 unsigned int base = 10;
462 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
463 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
472 int digit = num % base;
483 const char* ast_function_label(ast_function *self, const char *prefix)
485 size_t id = (self->labelcount++);
486 size_t len = strlen(prefix);
487 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
488 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
489 return self->labelbuf;
492 /*********************************************************************/
494 * by convention you must never pass NULL to the 'ir_value **out'
495 * parameter. If you really don't care about the output, pass a dummy.
496 * But I can't imagine a pituation where the output is truly unnecessary.
499 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
501 /* NOTE: This is the codegen for a variable used in an expression.
502 * It is not the codegen to generate the value. For this purpose,
503 * ast_local_codegen and ast_global_codegen are to be used before this
504 * is executed. ast_function_codegen should take care of its locals,
505 * and the ast-user should take care of ast_global_codegen to be used
506 * on all the globals.
509 printf("ast_value used before generated (%s)\n", self->name);
516 bool ast_global_codegen(ast_value *self, ir_builder *ir)
519 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
521 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
525 self->constval.vfunc->ir_func = func;
526 self->ir_v = func->value;
527 /* The function is filled later on ast_function_codegen... */
531 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
536 switch (self->expression.vtype)
539 if (!ir_value_set_float(v, self->constval.vfloat))
543 if (!ir_value_set_vector(v, self->constval.vvec))
547 if (!ir_value_set_string(v, self->constval.vstring))
551 printf("global of type function not properly generated\n");
553 /* Cannot generate an IR value for a function,
554 * need a pointer pointing to a function rather.
557 printf("TODO: global constant type %i\n", self->expression.vtype);
562 /* link us to the ir_value */
566 error: /* clean up */
571 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
574 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
576 /* Do we allow local functions? I think not...
577 * this is NOT a function pointer atm.
582 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
586 /* A constant local... hmmm...
587 * I suppose the IR will have to deal with this
590 switch (self->expression.vtype)
593 if (!ir_value_set_float(v, self->constval.vfloat))
597 if (!ir_value_set_vector(v, self->constval.vvec))
601 if (!ir_value_set_string(v, self->constval.vstring))
605 printf("TODO: global constant type %i\n", self->expression.vtype);
610 /* link us to the ir_value */
614 error: /* clean up */
619 bool ast_function_codegen(ast_function *self, ir_builder *ir)
627 printf("ast_function's related ast_value was not generated yet\n");
631 /* fill the parameter list */
632 for (i = 0; i < self->vtype->params_count; ++i)
634 if (!ir_function_params_add(irf, self->vtype->params[i]->expression.vtype))
636 if (!self->builtin) {
637 if (!ast_local_codegen(self->vtype->params[i], self->ir_func, true))
643 irf->builtin = self->builtin;
647 self->curblock = ir_function_create_block(irf, "entry");
651 for (i = 0; i < self->blocks_count; ++i) {
652 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
653 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
657 /* TODO: check return types */
658 if (!self->curblock->is_return)
660 if (!self->vtype->expression.next ||
661 self->vtype->expression.next->expression.vtype == TYPE_VOID)
663 return ir_block_create_return(self->curblock, NULL);
667 /* error("missing return"); */
674 /* Note, you will not see ast_block_codegen generate ir_blocks.
675 * To the AST and the IR, blocks are 2 different things.
676 * In the AST it represents a block of code, usually enclosed in
677 * curly braces {...}.
678 * While in the IR it represents a block in terms of control-flow.
680 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
685 * Note: an ast-representation using the comma-operator
686 * of the form: (a, b, c) = x should not assign to c...
690 /* output is NULL at first, we'll have each expression
691 * assign to out output, thus, a comma-operator represention
692 * using an ast_block will return the last generated value,
693 * so: (b, c) + a executed both b and c, and returns c,
694 * which is then added to a.
698 /* generate locals */
699 for (i = 0; i < self->locals_count; ++i)
701 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
705 for (i = 0; i < self->exprs_count; ++i)
707 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
708 if (!(*gen)(self->exprs[i], func, false, out))
715 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
717 ast_expression_codegen *cgen;
718 ir_value *left, *right;
720 cgen = self->dest->expression.codegen;
722 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
725 cgen = self->source->expression.codegen;
727 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
730 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
733 /* Theoretically, an assinment returns its left side as an
734 * lvalue, if we don't need an lvalue though, we return
735 * the right side as an rvalue, otherwise we have to
736 * somehow know whether or not we need to dereference the pointer
737 * on the left side - that is: OP_LOAD if it was an address.
738 * Also: in original QC we cannot OP_LOADP *anyway*.
740 *out = (lvalue ? left : right);
745 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
747 ast_expression_codegen *cgen;
748 ir_value *left, *right;
750 /* In the context of a binary operation, we can disregard
755 cgen = self->left->expression.codegen;
757 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
760 cgen = self->right->expression.codegen;
762 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
765 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
766 self->op, left, right);
773 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
775 ast_expression_codegen *cgen;
778 /* In the context of a unary operation, we can disregard
783 cgen = self->operand->expression.codegen;
785 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
788 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "bin"),
796 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
798 ast_expression_codegen *cgen;
799 ir_value *ent, *field;
801 /* This function needs to take the 'lvalue' flag into account!
802 * As lvalue we provide a field-pointer, as rvalue we provide the
806 cgen = self->entity->expression.codegen;
807 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
810 cgen = self->field->expression.codegen;
811 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
816 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
819 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
820 ent, field, self->expression.vtype);
825 /* Hm that should be it... */
829 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
831 ast_expression_codegen *cgen;
836 ir_block *cond = func->curblock;
841 /* We don't output any value, thus also don't care about r/lvalue */
845 /* generate the condition */
846 func->curblock = cond;
847 cgen = self->cond->expression.codegen;
848 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, "ontrue"));
859 /* enter the block */
860 func->curblock = ontrue;
863 cgen = self->on_true->expression.codegen;
864 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
870 if (self->on_false) {
871 /* create on-false block */
872 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
876 /* enter the block */
877 func->curblock = onfalse;
880 cgen = self->on_false->expression.codegen;
881 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
886 /* Merge block were they all merge in to */
887 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
891 /* add jumps ot the merge block */
892 if (ontrue && !ir_block_create_jump(ontrue, merge))
894 if (onfalse && !ir_block_create_jump(onfalse, merge))
897 /* we create the if here, that way all blocks are ordered :)
899 if (!ir_block_create_if(cond, condval,
900 (ontrue ? ontrue : merge),
901 (onfalse ? onfalse : merge)))
906 /* Now enter the merge block */
907 func->curblock = merge;
912 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
914 ast_expression_codegen *cgen;
917 ir_value *trueval, *falseval;
920 ir_block *cond = func->curblock;
925 /* In theory it shouldn't be possible to pass through a node twice, but
926 * in case we add any kind of optimization pass for the AST itself, it
927 * may still happen, thus we remember a created ir_value and simply return one
928 * if it already exists.
931 *out = self->phi_out;
935 /* Ternary can never create an lvalue... */
939 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
941 /* generate the condition */
942 func->curblock = cond;
943 cgen = self->cond->expression.codegen;
944 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
947 /* create on-true block */
948 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
953 /* enter the block */
954 func->curblock = ontrue;
957 cgen = self->on_true->expression.codegen;
958 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
962 /* create on-false block */
963 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
968 /* enter the block */
969 func->curblock = onfalse;
972 cgen = self->on_false->expression.codegen;
973 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
977 /* create merge block */
978 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
981 /* jump to merge block */
982 if (!ir_block_create_jump(ontrue, merge))
984 if (!ir_block_create_jump(onfalse, merge))
987 /* create if instruction */
988 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
991 /* Now enter the merge block */
992 func->curblock = merge;
994 /* Here, now, we need a PHI node
995 * but first some sanity checking...
997 if (trueval->vtype != falseval->vtype) {
998 /* error("ternary with different types on the two sides"); */
1003 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1005 !ir_phi_add(phi, ontrue, trueval) ||
1006 !ir_phi_add(phi, onfalse, falseval))
1011 self->phi_out = ir_phi_value(phi);
1012 *out = self->phi_out;
1017 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1019 ast_expression_codegen *cgen;
1021 ir_value *dummy = NULL;
1022 ir_value *precond = NULL;
1023 ir_value *postcond = NULL;
1025 /* Since we insert some jumps "late" so we have blocks
1026 * ordered "nicely", we need to keep track of the actual end-blocks
1027 * of expressions to add the jumps to.
1029 ir_block *bbody = NULL, *end_bbody = NULL;
1030 ir_block *bprecond = NULL, *end_bprecond = NULL;
1031 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1032 ir_block *bincrement = NULL, *end_bincrement = NULL;
1033 ir_block *bout = NULL, *bin = NULL;
1035 /* let's at least move the outgoing block to the end */
1038 /* 'break' and 'continue' need to be able to find the right blocks */
1039 ir_block *bcontinue = NULL;
1040 ir_block *bbreak = NULL;
1042 ir_block *old_bcontinue = NULL;
1043 ir_block *old_bbreak = NULL;
1045 ir_block *tmpblock = NULL;
1051 * Should we ever need some kind of block ordering, better make this function
1052 * move blocks around than write a block ordering algorithm later... after all
1053 * the ast and ir should work together, not against each other.
1056 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1057 * anyway if for example it contains a ternary.
1061 cgen = self->initexpr->expression.codegen;
1062 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1066 /* Store the block from which we enter this chaos */
1067 bin = func->curblock;
1069 /* The pre-loop condition needs its own block since we
1070 * need to be able to jump to the start of that expression.
1074 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1078 /* the pre-loop-condition the least important place to 'continue' at */
1079 bcontinue = bprecond;
1082 func->curblock = bprecond;
1085 cgen = self->precond->expression.codegen;
1086 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1089 end_bprecond = func->curblock;
1091 bprecond = end_bprecond = NULL;
1094 /* Now the next blocks won't be ordered nicely, but we need to
1095 * generate them this early for 'break' and 'continue'.
1097 if (self->increment) {
1098 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1101 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1103 bincrement = end_bincrement = NULL;
1106 if (self->postcond) {
1107 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1110 bcontinue = bpostcond; /* postcond comes before the increment */
1112 bpostcond = end_bpostcond = NULL;
1115 bout_id = func->ir_func->blocks_count;
1116 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1121 /* The loop body... */
1124 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1129 func->curblock = bbody;
1131 old_bbreak = func->breakblock;
1132 old_bcontinue = func->continueblock;
1133 func->breakblock = bbreak;
1134 func->continueblock = bcontinue;
1137 cgen = self->body->expression.codegen;
1138 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1141 end_bbody = func->curblock;
1142 func->breakblock = old_bbreak;
1143 func->continueblock = old_bcontinue;
1146 /* post-loop-condition */
1150 func->curblock = bpostcond;
1153 cgen = self->postcond->expression.codegen;
1154 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1157 end_bpostcond = func->curblock;
1160 /* The incrementor */
1161 if (self->increment)
1164 func->curblock = bincrement;
1167 cgen = self->increment->expression.codegen;
1168 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1171 end_bincrement = func->curblock;
1174 /* In any case now, we continue from the outgoing block */
1175 func->curblock = bout;
1177 /* Now all blocks are in place */
1178 /* From 'bin' we jump to whatever comes first */
1179 if (bprecond) tmpblock = bprecond;
1180 else if (bbody) tmpblock = bbody;
1181 else if (bpostcond) tmpblock = bpostcond;
1182 else tmpblock = bout;
1183 if (!ir_block_create_jump(bin, tmpblock))
1189 ir_block *ontrue, *onfalse;
1190 if (bbody) ontrue = bbody;
1191 else if (bincrement) ontrue = bincrement;
1192 else if (bpostcond) ontrue = bpostcond;
1193 else ontrue = bprecond;
1195 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1202 if (bincrement) tmpblock = bincrement;
1203 else if (bpostcond) tmpblock = bpostcond;
1204 else if (bprecond) tmpblock = bprecond;
1205 else tmpblock = bout;
1206 if (!ir_block_create_jump(end_bbody, tmpblock))
1210 /* from increment */
1213 if (bpostcond) tmpblock = bpostcond;
1214 else if (bprecond) tmpblock = bprecond;
1215 else if (bbody) tmpblock = bbody;
1216 else tmpblock = bout;
1217 if (!ir_block_create_jump(end_bincrement, tmpblock))
1224 ir_block *ontrue, *onfalse;
1225 if (bprecond) ontrue = bprecond;
1226 else if (bbody) ontrue = bbody;
1227 else if (bincrement) ontrue = bincrement;
1228 else ontrue = bpostcond;
1230 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1234 /* Move 'bout' to the end */
1235 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1236 !ir_function_blocks_add(func->ir_func, bout))
1238 ir_block_delete(bout);
1245 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1247 ast_expression_codegen *cgen;
1248 ir_value_vector params;
1249 ir_instr *callinstr;
1252 ir_value *funval = NULL;
1254 /* return values are never rvalues */
1257 cgen = self->func->expression.codegen;
1258 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1263 MEM_VECTOR_INIT(¶ms, v);
1266 for (i = 0; i < self->params_count; ++i)
1269 ast_expression *expr = self->params[i];
1271 cgen = expr->expression.codegen;
1272 if (!(*cgen)(expr, func, false, ¶m))
1276 if (!ir_value_vector_v_add(¶ms, param))
1280 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1284 for (i = 0; i < params.v_count; ++i) {
1285 if (!ir_call_param(callinstr, params.v[i]))
1289 *out = ir_call_value(callinstr);
1293 MEM_VECTOR_CLEAR(¶ms, v);