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);
173 if (op >= INSTR_EQ_F && op <= INSTR_GT)
174 self->expression.vtype = TYPE_FLOAT;
175 else if (op == INSTR_AND || op == INSTR_OR ||
176 op == INSTR_BITAND || op == INSTR_BITOR)
177 self->expression.vtype = TYPE_FLOAT;
178 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
179 self->expression.vtype = TYPE_VECTOR;
180 else if (op == INSTR_MUL_V)
181 self->expression.vtype = TYPE_FLOAT;
183 self->expression.vtype = left->expression.vtype;
188 void ast_binary_delete(ast_binary *self)
190 ast_unref(self->left);
191 ast_unref(self->right);
192 ast_expression_delete((ast_expression*)self);
196 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
198 const ast_expression *outtype;
200 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
202 if (field->expression.vtype != TYPE_FIELD) {
207 outtype = field->expression.next;
210 /* Error: field has no type... */
214 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
216 self->expression.vtype = outtype->expression.vtype;
217 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
219 self->entity = entity;
225 void ast_entfield_delete(ast_entfield *self)
227 ast_unref(self->entity);
228 ast_unref(self->field);
229 ast_expression_delete((ast_expression*)self);
233 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
235 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
236 if (!ontrue && !onfalse) {
237 /* because it is invalid */
241 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
244 self->on_true = ontrue;
245 self->on_false = onfalse;
250 void ast_ifthen_delete(ast_ifthen *self)
252 ast_unref(self->cond);
254 ast_unref(self->on_true);
256 ast_unref(self->on_false);
257 ast_expression_delete((ast_expression*)self);
261 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
263 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
264 /* This time NEITHER must be NULL */
265 if (!ontrue || !onfalse) {
269 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
272 self->on_true = ontrue;
273 self->on_false = onfalse;
274 self->phi_out = NULL;
279 void ast_ternary_delete(ast_ternary *self)
281 ast_unref(self->cond);
282 ast_unref(self->on_true);
283 ast_unref(self->on_false);
284 ast_expression_delete((ast_expression*)self);
288 ast_loop* ast_loop_new(lex_ctx ctx,
289 ast_expression *initexpr,
290 ast_expression *precond,
291 ast_expression *postcond,
292 ast_expression *increment,
293 ast_expression *body)
295 ast_instantiate(ast_loop, ctx, ast_loop_delete);
296 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
298 self->initexpr = initexpr;
299 self->precond = precond;
300 self->postcond = postcond;
301 self->increment = increment;
307 void ast_loop_delete(ast_loop *self)
310 ast_unref(self->initexpr);
312 ast_unref(self->precond);
314 ast_unref(self->postcond);
316 ast_unref(self->increment);
318 ast_unref(self->body);
319 ast_expression_delete((ast_expression*)self);
323 ast_call* ast_call_new(lex_ctx ctx,
324 ast_expression *funcexpr)
326 ast_instantiate(ast_call, ctx, ast_call_delete);
327 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
329 MEM_VECTOR_INIT(self, params);
331 self->func = funcexpr;
335 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
337 void ast_call_delete(ast_call *self)
340 for (i = 0; i < self->params_count; ++i)
341 ast_unref(self->params[i]);
342 MEM_VECTOR_CLEAR(self, params);
345 ast_unref(self->func);
347 ast_expression_delete((ast_expression*)self);
351 ast_store* ast_store_new(lex_ctx ctx, int op,
352 ast_value *dest, ast_expression *source)
354 ast_instantiate(ast_store, ctx, ast_store_delete);
355 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
359 self->source = source;
364 void ast_store_delete(ast_store *self)
366 ast_unref(self->dest);
367 ast_unref(self->source);
368 ast_expression_delete((ast_expression*)self);
372 ast_block* ast_block_new(lex_ctx ctx)
374 ast_instantiate(ast_block, ctx, ast_block_delete);
375 ast_expression_init((ast_expression*)self,
376 (ast_expression_codegen*)&ast_block_codegen);
378 MEM_VECTOR_INIT(self, locals);
379 MEM_VECTOR_INIT(self, exprs);
383 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
384 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
386 void ast_block_delete(ast_block *self)
389 for (i = 0; i < self->exprs_count; ++i)
390 ast_unref(self->exprs[i]);
391 MEM_VECTOR_CLEAR(self, exprs);
392 for (i = 0; i < self->locals_count; ++i)
393 ast_delete(self->locals[i]);
394 MEM_VECTOR_CLEAR(self, locals);
395 ast_expression_delete((ast_expression*)self);
399 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
401 ast_instantiate(ast_function, ctx, ast_function_delete);
405 vtype->expression.vtype != TYPE_FUNCTION)
412 self->name = name ? util_strdup(name) : NULL;
413 MEM_VECTOR_INIT(self, blocks);
415 self->labelcount = 0;
418 self->ir_func = NULL;
419 self->curblock = NULL;
421 self->breakblock = NULL;
422 self->continueblock = NULL;
424 vtype->isconst = true;
425 vtype->constval.vfunc = self;
430 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
432 void ast_function_delete(ast_function *self)
436 mem_d((void*)self->name);
438 /* ast_value_delete(self->vtype); */
439 self->vtype->isconst = false;
440 self->vtype->constval.vfunc = NULL;
441 /* We use unref - if it was stored in a global table it is supposed
442 * to be deleted from *there*
444 ast_unref(self->vtype);
446 for (i = 0; i < self->blocks_count; ++i)
447 ast_delete(self->blocks[i]);
448 MEM_VECTOR_CLEAR(self, blocks);
452 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
454 unsigned int base = 10;
455 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
456 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
465 int digit = num % base;
476 const char* ast_function_label(ast_function *self, const char *prefix)
478 size_t id = (self->labelcount++);
479 size_t len = strlen(prefix);
480 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
481 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
482 return self->labelbuf;
485 /*********************************************************************/
487 * by convention you must never pass NULL to the 'ir_value **out'
488 * parameter. If you really don't care about the output, pass a dummy.
489 * But I can't imagine a pituation where the output is truly unnecessary.
492 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
494 /* NOTE: This is the codegen for a variable used in an expression.
495 * It is not the codegen to generate the value. For this purpose,
496 * ast_local_codegen and ast_global_codegen are to be used before this
497 * is executed. ast_function_codegen should take care of its locals,
498 * and the ast-user should take care of ast_global_codegen to be used
499 * on all the globals.
502 printf("ast_value used before generated (%s)\n", self->name);
509 bool ast_global_codegen(ast_value *self, ir_builder *ir)
512 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
514 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
518 self->constval.vfunc->ir_func = func;
519 self->ir_v = func->value;
520 /* The function is filled later on ast_function_codegen... */
524 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
526 printf("ir_builder_create_global failed\n");
531 switch (self->expression.vtype)
534 if (!ir_value_set_float(v, self->constval.vfloat))
538 if (!ir_value_set_vector(v, self->constval.vvec))
542 if (!ir_value_set_string(v, self->constval.vstring))
546 printf("global of type function not properly generated\n");
548 /* Cannot generate an IR value for a function,
549 * need a pointer pointing to a function rather.
552 printf("TODO: global constant type %i\n", self->expression.vtype);
557 /* link us to the ir_value */
561 error: /* clean up */
566 bool ast_local_codegen(ast_value *self, ir_function *func)
569 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
571 /* Do we allow local functions? I think not...
572 * this is NOT a function pointer atm.
577 v = ir_function_create_local(func, self->name, self->expression.vtype);
581 /* A constant local... hmmm...
582 * I suppose the IR will have to deal with this
585 switch (self->expression.vtype)
588 if (!ir_value_set_float(v, self->constval.vfloat))
592 if (!ir_value_set_vector(v, self->constval.vvec))
596 if (!ir_value_set_string(v, self->constval.vstring))
600 printf("TODO: global constant type %i\n", self->expression.vtype);
605 /* link us to the ir_value */
609 error: /* clean up */
614 bool ast_function_codegen(ast_function *self, ir_builder *ir)
622 printf("ast_function's related ast_value was not generated yet\n");
626 for (i = 0; i < self->vtype->params_count; ++i)
628 if (!ir_function_params_add(irf, self->vtype->params[i]->expression.vtype))
633 irf->builtin = self->builtin;
637 self->curblock = ir_function_create_block(irf, "entry");
641 for (i = 0; i < self->blocks_count; ++i) {
642 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
643 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
647 /* TODO: check return types */
648 if (!self->curblock->is_return)
650 if (!self->vtype->expression.next ||
651 self->vtype->expression.next->expression.vtype == TYPE_VOID)
653 return ir_block_create_return(self->curblock, NULL);
657 /* error("missing return"); */
664 /* Note, you will not see ast_block_codegen generate ir_blocks.
665 * To the AST and the IR, blocks are 2 different things.
666 * In the AST it represents a block of code, usually enclosed in
667 * curly braces {...}.
668 * While in the IR it represents a block in terms of control-flow.
670 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
675 * Note: an ast-representation using the comma-operator
676 * of the form: (a, b, c) = x should not assign to c...
680 /* output is NULL at first, we'll have each expression
681 * assign to out output, thus, a comma-operator represention
682 * using an ast_block will return the last generated value,
683 * so: (b, c) + a executed both b and c, and returns c,
684 * which is then added to a.
688 /* generate locals */
689 for (i = 0; i < self->locals_count; ++i)
691 if (!ast_local_codegen(self->locals[i], func->ir_func))
695 for (i = 0; i < self->exprs_count; ++i)
697 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
698 if (!(*gen)(self->exprs[i], func, false, out))
705 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
707 ast_expression_codegen *cgen;
708 ir_value *left, *right;
710 cgen = self->dest->expression.codegen;
712 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
715 cgen = self->source->expression.codegen;
717 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
720 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
723 /* Theoretically, an assinment returns its left side as an
724 * lvalue, if we don't need an lvalue though, we return
725 * the right side as an rvalue, otherwise we have to
726 * somehow know whether or not we need to dereference the pointer
727 * on the left side - that is: OP_LOAD if it was an address.
728 * Also: in original QC we cannot OP_LOADP *anyway*.
730 *out = (lvalue ? left : right);
735 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
737 ast_expression_codegen *cgen;
738 ir_value *left, *right;
740 /* In the context of a binary operation, we can disregard
745 cgen = self->left->expression.codegen;
747 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
750 cgen = self->right->expression.codegen;
752 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
755 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
756 self->op, left, right);
763 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
765 ast_expression_codegen *cgen;
766 ir_value *ent, *field;
768 /* This function needs to take the 'lvalue' flag into account!
769 * As lvalue we provide a field-pointer, as rvalue we provide the
773 cgen = self->entity->expression.codegen;
774 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
777 cgen = self->field->expression.codegen;
778 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
783 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
786 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
787 ent, field, self->expression.vtype);
792 /* Hm that should be it... */
796 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
798 ast_expression_codegen *cgen;
803 ir_block *cond = func->curblock;
808 /* We don't output any value, thus also don't care about r/lvalue */
812 /* generate the condition */
813 func->curblock = cond;
814 cgen = self->cond->expression.codegen;
815 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
821 /* create on-true block */
822 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
826 /* enter the block */
827 func->curblock = ontrue;
830 cgen = self->on_true->expression.codegen;
831 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
837 if (self->on_false) {
838 /* create on-false block */
839 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
843 /* enter the block */
844 func->curblock = onfalse;
847 cgen = self->on_false->expression.codegen;
848 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
853 /* Merge block were they all merge in to */
854 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
858 /* add jumps ot the merge block */
859 if (ontrue && !ir_block_create_jump(ontrue, merge))
861 if (onfalse && !ir_block_create_jump(onfalse, merge))
864 /* we create the if here, that way all blocks are ordered :)
866 if (!ir_block_create_if(cond, condval,
867 (ontrue ? ontrue : merge),
868 (onfalse ? onfalse : merge)))
873 /* Now enter the merge block */
874 func->curblock = merge;
879 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
881 ast_expression_codegen *cgen;
884 ir_value *trueval, *falseval;
887 ir_block *cond = func->curblock;
892 /* In theory it shouldn't be possible to pass through a node twice, but
893 * in case we add any kind of optimization pass for the AST itself, it
894 * may still happen, thus we remember a created ir_value and simply return one
895 * if it already exists.
898 *out = self->phi_out;
902 /* Ternary can never create an lvalue... */
906 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
908 /* generate the condition */
909 func->curblock = cond;
910 cgen = self->cond->expression.codegen;
911 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
914 /* create on-true block */
915 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
920 /* enter the block */
921 func->curblock = ontrue;
924 cgen = self->on_true->expression.codegen;
925 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
929 /* create on-false block */
930 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
935 /* enter the block */
936 func->curblock = onfalse;
939 cgen = self->on_false->expression.codegen;
940 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
944 /* create merge block */
945 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
948 /* jump to merge block */
949 if (!ir_block_create_jump(ontrue, merge))
951 if (!ir_block_create_jump(onfalse, merge))
954 /* create if instruction */
955 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
958 /* Now enter the merge block */
959 func->curblock = merge;
961 /* Here, now, we need a PHI node
962 * but first some sanity checking...
964 if (trueval->vtype != falseval->vtype) {
965 /* error("ternary with different types on the two sides"); */
970 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
972 !ir_phi_add(phi, ontrue, trueval) ||
973 !ir_phi_add(phi, onfalse, falseval))
978 self->phi_out = ir_phi_value(phi);
979 *out = self->phi_out;
984 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
986 ast_expression_codegen *cgen;
988 ir_value *dummy = NULL;
989 ir_value *precond = NULL;
990 ir_value *postcond = NULL;
992 /* Since we insert some jumps "late" so we have blocks
993 * ordered "nicely", we need to keep track of the actual end-blocks
994 * of expressions to add the jumps to.
996 ir_block *bbody = NULL, *end_bbody = NULL;
997 ir_block *bprecond = NULL, *end_bprecond = NULL;
998 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
999 ir_block *bincrement = NULL, *end_bincrement = NULL;
1000 ir_block *bout = NULL, *bin = NULL;
1002 /* let's at least move the outgoing block to the end */
1005 /* 'break' and 'continue' need to be able to find the right blocks */
1006 ir_block *bcontinue = NULL;
1007 ir_block *bbreak = NULL;
1009 ir_block *old_bcontinue = NULL;
1010 ir_block *old_bbreak = NULL;
1012 ir_block *tmpblock = NULL;
1018 * Should we ever need some kind of block ordering, better make this function
1019 * move blocks around than write a block ordering algorithm later... after all
1020 * the ast and ir should work together, not against each other.
1023 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1024 * anyway if for example it contains a ternary.
1028 cgen = self->initexpr->expression.codegen;
1029 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1033 /* Store the block from which we enter this chaos */
1034 bin = func->curblock;
1036 /* The pre-loop condition needs its own block since we
1037 * need to be able to jump to the start of that expression.
1041 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1045 /* the pre-loop-condition the least important place to 'continue' at */
1046 bcontinue = bprecond;
1049 func->curblock = bprecond;
1052 cgen = self->precond->expression.codegen;
1053 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1056 end_bprecond = func->curblock;
1058 bprecond = end_bprecond = NULL;
1061 /* Now the next blocks won't be ordered nicely, but we need to
1062 * generate them this early for 'break' and 'continue'.
1064 if (self->increment) {
1065 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1068 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1070 bincrement = end_bincrement = NULL;
1073 if (self->postcond) {
1074 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1077 bcontinue = bpostcond; /* postcond comes before the increment */
1079 bpostcond = end_bpostcond = NULL;
1082 bout_id = func->ir_func->blocks_count;
1083 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1088 /* The loop body... */
1091 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1096 func->curblock = bbody;
1098 old_bbreak = func->breakblock;
1099 old_bcontinue = func->continueblock;
1100 func->breakblock = bbreak;
1101 func->continueblock = bcontinue;
1104 cgen = self->body->expression.codegen;
1105 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1108 end_bbody = func->curblock;
1109 func->breakblock = old_bbreak;
1110 func->continueblock = old_bcontinue;
1113 /* post-loop-condition */
1117 func->curblock = bpostcond;
1120 cgen = self->postcond->expression.codegen;
1121 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1124 end_bpostcond = func->curblock;
1127 /* The incrementor */
1128 if (self->increment)
1131 func->curblock = bincrement;
1134 cgen = self->increment->expression.codegen;
1135 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1138 end_bincrement = func->curblock;
1141 /* In any case now, we continue from the outgoing block */
1142 func->curblock = bout;
1144 /* Now all blocks are in place */
1145 /* From 'bin' we jump to whatever comes first */
1146 if (bprecond) tmpblock = bprecond;
1147 else if (bbody) tmpblock = bbody;
1148 else if (bpostcond) tmpblock = bpostcond;
1149 else tmpblock = bout;
1150 if (!ir_block_create_jump(bin, tmpblock))
1156 ir_block *ontrue, *onfalse;
1157 if (bbody) ontrue = bbody;
1158 else if (bincrement) ontrue = bincrement;
1159 else if (bpostcond) ontrue = bpostcond;
1160 else ontrue = bprecond;
1162 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1169 if (bincrement) tmpblock = bincrement;
1170 else if (bpostcond) tmpblock = bpostcond;
1171 else if (bprecond) tmpblock = bprecond;
1172 else tmpblock = bout;
1173 if (!ir_block_create_jump(end_bbody, tmpblock))
1177 /* from increment */
1180 if (bpostcond) tmpblock = bpostcond;
1181 else if (bprecond) tmpblock = bprecond;
1182 else if (bbody) tmpblock = bbody;
1183 else tmpblock = bout;
1184 if (!ir_block_create_jump(end_bincrement, tmpblock))
1191 ir_block *ontrue, *onfalse;
1192 if (bprecond) ontrue = bprecond;
1193 else if (bbody) ontrue = bbody;
1194 else if (bincrement) ontrue = bincrement;
1195 else ontrue = bpostcond;
1197 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1201 /* Move 'bout' to the end */
1202 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1203 !ir_function_blocks_add(func->ir_func, bout))
1205 ir_block_delete(bout);
1212 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1214 ast_expression_codegen *cgen;
1215 ir_value_vector params;
1216 ir_instr *callinstr;
1219 ir_value *funval = NULL;
1221 /* return values are never rvalues */
1224 cgen = self->func->expression.codegen;
1225 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1230 MEM_VECTOR_INIT(¶ms, v);
1233 for (i = 0; i < self->params_count; ++i)
1236 ast_expression *expr = self->params[i];
1238 cgen = expr->expression.codegen;
1239 if (!(*cgen)(expr, func, false, ¶m))
1243 if (!ir_value_vector_v_add(¶ms, param))
1247 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1251 for (i = 0; i < params.v_count; ++i) {
1252 if (!ir_call_param(callinstr, params.v[i]))
1256 *out = ir_call_value(callinstr);
1260 MEM_VECTOR_CLEAR(¶ms, v);