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_unary* ast_unary_new(lex_ctx ctx, int op,
197 ast_expression *expr)
199 ast_instantiate(ast_unary, ctx, ast_unary_delete);
200 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
203 self->operand = expr;
208 void ast_unary_delete(ast_unary *self)
210 ast_unref(self->operand);
211 ast_expression_delete((ast_expression*)self);
215 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
217 ast_instantiate(ast_return, ctx, ast_return_delete);
218 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
220 self->operand = expr;
225 void ast_return_delete(ast_return *self)
227 ast_unref(self->operand);
228 ast_expression_delete((ast_expression*)self);
232 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
234 const ast_expression *outtype;
236 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
238 if (field->expression.vtype != TYPE_FIELD) {
243 outtype = field->expression.next;
246 /* Error: field has no type... */
250 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
252 self->expression.vtype = outtype->expression.vtype;
253 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
255 self->entity = entity;
261 void ast_entfield_delete(ast_entfield *self)
263 ast_unref(self->entity);
264 ast_unref(self->field);
265 ast_expression_delete((ast_expression*)self);
269 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
271 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
272 if (!ontrue && !onfalse) {
273 /* because it is invalid */
277 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
280 self->on_true = ontrue;
281 self->on_false = onfalse;
286 void ast_ifthen_delete(ast_ifthen *self)
288 ast_unref(self->cond);
290 ast_unref(self->on_true);
292 ast_unref(self->on_false);
293 ast_expression_delete((ast_expression*)self);
297 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
299 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
300 /* This time NEITHER must be NULL */
301 if (!ontrue || !onfalse) {
305 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
308 self->on_true = ontrue;
309 self->on_false = onfalse;
310 self->phi_out = NULL;
315 void ast_ternary_delete(ast_ternary *self)
317 ast_unref(self->cond);
318 ast_unref(self->on_true);
319 ast_unref(self->on_false);
320 ast_expression_delete((ast_expression*)self);
324 ast_loop* ast_loop_new(lex_ctx ctx,
325 ast_expression *initexpr,
326 ast_expression *precond,
327 ast_expression *postcond,
328 ast_expression *increment,
329 ast_expression *body)
331 ast_instantiate(ast_loop, ctx, ast_loop_delete);
332 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
334 self->initexpr = initexpr;
335 self->precond = precond;
336 self->postcond = postcond;
337 self->increment = increment;
343 void ast_loop_delete(ast_loop *self)
346 ast_unref(self->initexpr);
348 ast_unref(self->precond);
350 ast_unref(self->postcond);
352 ast_unref(self->increment);
354 ast_unref(self->body);
355 ast_expression_delete((ast_expression*)self);
359 ast_call* ast_call_new(lex_ctx ctx,
360 ast_expression *funcexpr)
362 ast_instantiate(ast_call, ctx, ast_call_delete);
363 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
365 MEM_VECTOR_INIT(self, params);
367 self->func = funcexpr;
371 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
373 void ast_call_delete(ast_call *self)
376 for (i = 0; i < self->params_count; ++i)
377 ast_unref(self->params[i]);
378 MEM_VECTOR_CLEAR(self, params);
381 ast_unref(self->func);
383 ast_expression_delete((ast_expression*)self);
387 ast_store* ast_store_new(lex_ctx ctx, int op,
388 ast_value *dest, ast_expression *source)
390 ast_instantiate(ast_store, ctx, ast_store_delete);
391 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
395 self->source = source;
400 void ast_store_delete(ast_store *self)
402 ast_unref(self->dest);
403 ast_unref(self->source);
404 ast_expression_delete((ast_expression*)self);
408 ast_block* ast_block_new(lex_ctx ctx)
410 ast_instantiate(ast_block, ctx, ast_block_delete);
411 ast_expression_init((ast_expression*)self,
412 (ast_expression_codegen*)&ast_block_codegen);
414 MEM_VECTOR_INIT(self, locals);
415 MEM_VECTOR_INIT(self, exprs);
419 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
420 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
422 void ast_block_delete(ast_block *self)
425 for (i = 0; i < self->exprs_count; ++i)
426 ast_unref(self->exprs[i]);
427 MEM_VECTOR_CLEAR(self, exprs);
428 for (i = 0; i < self->locals_count; ++i)
429 ast_delete(self->locals[i]);
430 MEM_VECTOR_CLEAR(self, locals);
431 ast_expression_delete((ast_expression*)self);
435 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
437 ast_instantiate(ast_function, ctx, ast_function_delete);
441 vtype->expression.vtype != TYPE_FUNCTION)
448 self->name = name ? util_strdup(name) : NULL;
449 MEM_VECTOR_INIT(self, blocks);
451 self->labelcount = 0;
454 self->ir_func = NULL;
455 self->curblock = NULL;
457 self->breakblock = NULL;
458 self->continueblock = NULL;
460 vtype->isconst = true;
461 vtype->constval.vfunc = self;
466 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
468 void ast_function_delete(ast_function *self)
472 mem_d((void*)self->name);
474 /* ast_value_delete(self->vtype); */
475 self->vtype->isconst = false;
476 self->vtype->constval.vfunc = NULL;
477 /* We use unref - if it was stored in a global table it is supposed
478 * to be deleted from *there*
480 ast_unref(self->vtype);
482 for (i = 0; i < self->blocks_count; ++i)
483 ast_delete(self->blocks[i]);
484 MEM_VECTOR_CLEAR(self, blocks);
488 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
490 unsigned int base = 10;
491 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
492 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
501 int digit = num % base;
512 const char* ast_function_label(ast_function *self, const char *prefix)
514 size_t id = (self->labelcount++);
515 size_t len = strlen(prefix);
516 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
517 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
518 return self->labelbuf;
521 /*********************************************************************/
523 * by convention you must never pass NULL to the 'ir_value **out'
524 * parameter. If you really don't care about the output, pass a dummy.
525 * But I can't imagine a pituation where the output is truly unnecessary.
528 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
530 /* NOTE: This is the codegen for a variable used in an expression.
531 * It is not the codegen to generate the value. For this purpose,
532 * ast_local_codegen and ast_global_codegen are to be used before this
533 * is executed. ast_function_codegen should take care of its locals,
534 * and the ast-user should take care of ast_global_codegen to be used
535 * on all the globals.
538 printf("ast_value used before generated (%s)\n", self->name);
545 bool ast_global_codegen(ast_value *self, ir_builder *ir)
548 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
550 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
554 self->constval.vfunc->ir_func = func;
555 self->ir_v = func->value;
556 /* The function is filled later on ast_function_codegen... */
560 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
562 printf("ir_builder_create_global failed\n");
567 switch (self->expression.vtype)
570 if (!ir_value_set_float(v, self->constval.vfloat))
574 if (!ir_value_set_vector(v, self->constval.vvec))
578 if (!ir_value_set_string(v, self->constval.vstring))
582 printf("global of type function not properly generated\n");
584 /* Cannot generate an IR value for a function,
585 * need a pointer pointing to a function rather.
588 printf("TODO: global constant type %i\n", self->expression.vtype);
593 /* link us to the ir_value */
597 error: /* clean up */
602 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
605 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
607 /* Do we allow local functions? I think not...
608 * this is NOT a function pointer atm.
613 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
617 /* A constant local... hmmm...
618 * I suppose the IR will have to deal with this
621 switch (self->expression.vtype)
624 if (!ir_value_set_float(v, self->constval.vfloat))
628 if (!ir_value_set_vector(v, self->constval.vvec))
632 if (!ir_value_set_string(v, self->constval.vstring))
636 printf("TODO: global constant type %i\n", self->expression.vtype);
641 /* link us to the ir_value */
645 error: /* clean up */
650 bool ast_function_codegen(ast_function *self, ir_builder *ir)
658 printf("ast_function's related ast_value was not generated yet\n");
662 /* fill the parameter list */
663 for (i = 0; i < self->vtype->params_count; ++i)
665 if (!ir_function_params_add(irf, self->vtype->params[i]->expression.vtype))
667 if (!self->builtin) {
668 if (!ast_local_codegen(self->vtype->params[i], self->ir_func, true))
674 irf->builtin = self->builtin;
678 self->curblock = ir_function_create_block(irf, "entry");
682 for (i = 0; i < self->blocks_count; ++i) {
683 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
684 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
688 /* TODO: check return types */
689 if (!self->curblock->is_return)
691 if (!self->vtype->expression.next ||
692 self->vtype->expression.next->expression.vtype == TYPE_VOID)
694 return ir_block_create_return(self->curblock, NULL);
698 /* error("missing return"); */
705 /* Note, you will not see ast_block_codegen generate ir_blocks.
706 * To the AST and the IR, blocks are 2 different things.
707 * In the AST it represents a block of code, usually enclosed in
708 * curly braces {...}.
709 * While in the IR it represents a block in terms of control-flow.
711 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
716 * Note: an ast-representation using the comma-operator
717 * of the form: (a, b, c) = x should not assign to c...
721 /* output is NULL at first, we'll have each expression
722 * assign to out output, thus, a comma-operator represention
723 * using an ast_block will return the last generated value,
724 * so: (b, c) + a executed both b and c, and returns c,
725 * which is then added to a.
729 /* generate locals */
730 for (i = 0; i < self->locals_count; ++i)
732 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
736 for (i = 0; i < self->exprs_count; ++i)
738 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
739 if (!(*gen)(self->exprs[i], func, false, out))
746 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
748 ast_expression_codegen *cgen;
749 ir_value *left, *right;
751 cgen = self->dest->expression.codegen;
753 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
756 cgen = self->source->expression.codegen;
758 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
761 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
764 /* Theoretically, an assinment returns its left side as an
765 * lvalue, if we don't need an lvalue though, we return
766 * the right side as an rvalue, otherwise we have to
767 * somehow know whether or not we need to dereference the pointer
768 * on the left side - that is: OP_LOAD if it was an address.
769 * Also: in original QC we cannot OP_LOADP *anyway*.
771 *out = (lvalue ? left : right);
776 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
778 ast_expression_codegen *cgen;
779 ir_value *left, *right;
781 /* In the context of a binary operation, we can disregard
786 cgen = self->left->expression.codegen;
788 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
791 cgen = self->right->expression.codegen;
793 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
796 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
797 self->op, left, right);
804 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
806 ast_expression_codegen *cgen;
809 /* In the context of a unary operation, we can disregard
814 cgen = self->operand->expression.codegen;
816 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
819 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
827 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
829 ast_expression_codegen *cgen;
832 /* In the context of a return operation, we can disregard
837 cgen = self->operand->expression.codegen;
839 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
842 if (!ir_block_create_return(func->curblock, operand))
848 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
850 ast_expression_codegen *cgen;
851 ir_value *ent, *field;
853 /* This function needs to take the 'lvalue' flag into account!
854 * As lvalue we provide a field-pointer, as rvalue we provide the
858 cgen = self->entity->expression.codegen;
859 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
862 cgen = self->field->expression.codegen;
863 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
868 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
871 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
872 ent, field, self->expression.vtype);
877 /* Hm that should be it... */
881 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
883 ast_expression_codegen *cgen;
888 ir_block *cond = func->curblock;
893 /* We don't output any value, thus also don't care about r/lvalue */
897 /* generate the condition */
898 func->curblock = cond;
899 cgen = self->cond->expression.codegen;
900 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
906 /* create on-true block */
907 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
911 /* enter the block */
912 func->curblock = ontrue;
915 cgen = self->on_true->expression.codegen;
916 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
922 if (self->on_false) {
923 /* create on-false block */
924 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
928 /* enter the block */
929 func->curblock = onfalse;
932 cgen = self->on_false->expression.codegen;
933 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
938 /* Merge block were they all merge in to */
939 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
943 /* add jumps ot the merge block */
944 if (ontrue && !ir_block_create_jump(ontrue, merge))
946 if (onfalse && !ir_block_create_jump(onfalse, merge))
949 /* we create the if here, that way all blocks are ordered :)
951 if (!ir_block_create_if(cond, condval,
952 (ontrue ? ontrue : merge),
953 (onfalse ? onfalse : merge)))
958 /* Now enter the merge block */
959 func->curblock = merge;
964 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
966 ast_expression_codegen *cgen;
969 ir_value *trueval, *falseval;
972 ir_block *cond = func->curblock;
977 /* In theory it shouldn't be possible to pass through a node twice, but
978 * in case we add any kind of optimization pass for the AST itself, it
979 * may still happen, thus we remember a created ir_value and simply return one
980 * if it already exists.
983 *out = self->phi_out;
987 /* Ternary can never create an lvalue... */
991 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
993 /* generate the condition */
994 func->curblock = cond;
995 cgen = self->cond->expression.codegen;
996 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
999 /* create on-true block */
1000 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1005 /* enter the block */
1006 func->curblock = ontrue;
1009 cgen = self->on_true->expression.codegen;
1010 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1014 /* create on-false block */
1015 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1020 /* enter the block */
1021 func->curblock = onfalse;
1024 cgen = self->on_false->expression.codegen;
1025 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1029 /* create merge block */
1030 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1033 /* jump to merge block */
1034 if (!ir_block_create_jump(ontrue, merge))
1036 if (!ir_block_create_jump(onfalse, merge))
1039 /* create if instruction */
1040 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1043 /* Now enter the merge block */
1044 func->curblock = merge;
1046 /* Here, now, we need a PHI node
1047 * but first some sanity checking...
1049 if (trueval->vtype != falseval->vtype) {
1050 /* error("ternary with different types on the two sides"); */
1055 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1057 !ir_phi_add(phi, ontrue, trueval) ||
1058 !ir_phi_add(phi, onfalse, falseval))
1063 self->phi_out = ir_phi_value(phi);
1064 *out = self->phi_out;
1069 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1071 ast_expression_codegen *cgen;
1073 ir_value *dummy = NULL;
1074 ir_value *precond = NULL;
1075 ir_value *postcond = NULL;
1077 /* Since we insert some jumps "late" so we have blocks
1078 * ordered "nicely", we need to keep track of the actual end-blocks
1079 * of expressions to add the jumps to.
1081 ir_block *bbody = NULL, *end_bbody = NULL;
1082 ir_block *bprecond = NULL, *end_bprecond = NULL;
1083 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1084 ir_block *bincrement = NULL, *end_bincrement = NULL;
1085 ir_block *bout = NULL, *bin = NULL;
1087 /* let's at least move the outgoing block to the end */
1090 /* 'break' and 'continue' need to be able to find the right blocks */
1091 ir_block *bcontinue = NULL;
1092 ir_block *bbreak = NULL;
1094 ir_block *old_bcontinue = NULL;
1095 ir_block *old_bbreak = NULL;
1097 ir_block *tmpblock = NULL;
1103 * Should we ever need some kind of block ordering, better make this function
1104 * move blocks around than write a block ordering algorithm later... after all
1105 * the ast and ir should work together, not against each other.
1108 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1109 * anyway if for example it contains a ternary.
1113 cgen = self->initexpr->expression.codegen;
1114 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1118 /* Store the block from which we enter this chaos */
1119 bin = func->curblock;
1121 /* The pre-loop condition needs its own block since we
1122 * need to be able to jump to the start of that expression.
1126 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1130 /* the pre-loop-condition the least important place to 'continue' at */
1131 bcontinue = bprecond;
1134 func->curblock = bprecond;
1137 cgen = self->precond->expression.codegen;
1138 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1141 end_bprecond = func->curblock;
1143 bprecond = end_bprecond = NULL;
1146 /* Now the next blocks won't be ordered nicely, but we need to
1147 * generate them this early for 'break' and 'continue'.
1149 if (self->increment) {
1150 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1153 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1155 bincrement = end_bincrement = NULL;
1158 if (self->postcond) {
1159 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1162 bcontinue = bpostcond; /* postcond comes before the increment */
1164 bpostcond = end_bpostcond = NULL;
1167 bout_id = func->ir_func->blocks_count;
1168 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1173 /* The loop body... */
1176 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1181 func->curblock = bbody;
1183 old_bbreak = func->breakblock;
1184 old_bcontinue = func->continueblock;
1185 func->breakblock = bbreak;
1186 func->continueblock = bcontinue;
1189 cgen = self->body->expression.codegen;
1190 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1193 end_bbody = func->curblock;
1194 func->breakblock = old_bbreak;
1195 func->continueblock = old_bcontinue;
1198 /* post-loop-condition */
1202 func->curblock = bpostcond;
1205 cgen = self->postcond->expression.codegen;
1206 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1209 end_bpostcond = func->curblock;
1212 /* The incrementor */
1213 if (self->increment)
1216 func->curblock = bincrement;
1219 cgen = self->increment->expression.codegen;
1220 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1223 end_bincrement = func->curblock;
1226 /* In any case now, we continue from the outgoing block */
1227 func->curblock = bout;
1229 /* Now all blocks are in place */
1230 /* From 'bin' we jump to whatever comes first */
1231 if (bprecond) tmpblock = bprecond;
1232 else if (bbody) tmpblock = bbody;
1233 else if (bpostcond) tmpblock = bpostcond;
1234 else tmpblock = bout;
1235 if (!ir_block_create_jump(bin, tmpblock))
1241 ir_block *ontrue, *onfalse;
1242 if (bbody) ontrue = bbody;
1243 else if (bincrement) ontrue = bincrement;
1244 else if (bpostcond) ontrue = bpostcond;
1245 else ontrue = bprecond;
1247 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1254 if (bincrement) tmpblock = bincrement;
1255 else if (bpostcond) tmpblock = bpostcond;
1256 else if (bprecond) tmpblock = bprecond;
1257 else tmpblock = bout;
1258 if (!ir_block_create_jump(end_bbody, tmpblock))
1262 /* from increment */
1265 if (bpostcond) tmpblock = bpostcond;
1266 else if (bprecond) tmpblock = bprecond;
1267 else if (bbody) tmpblock = bbody;
1268 else tmpblock = bout;
1269 if (!ir_block_create_jump(end_bincrement, tmpblock))
1276 ir_block *ontrue, *onfalse;
1277 if (bprecond) ontrue = bprecond;
1278 else if (bbody) ontrue = bbody;
1279 else if (bincrement) ontrue = bincrement;
1280 else ontrue = bpostcond;
1282 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1286 /* Move 'bout' to the end */
1287 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1288 !ir_function_blocks_add(func->ir_func, bout))
1290 ir_block_delete(bout);
1297 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1299 ast_expression_codegen *cgen;
1300 ir_value_vector params;
1301 ir_instr *callinstr;
1304 ir_value *funval = NULL;
1306 /* return values are never rvalues */
1309 cgen = self->func->expression.codegen;
1310 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1315 MEM_VECTOR_INIT(¶ms, v);
1318 for (i = 0; i < self->params_count; ++i)
1321 ast_expression *expr = self->params[i];
1323 cgen = expr->expression.codegen;
1324 if (!(*cgen)(expr, func, false, ¶m))
1328 if (!ir_value_vector_v_add(¶ms, param))
1332 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1336 for (i = 0; i < params.v_count; ++i) {
1337 if (!ir_call_param(callinstr, params.v[i]))
1341 *out = ir_call_value(callinstr);
1345 MEM_VECTOR_CLEAR(¶ms, v);