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_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
205 ast_instantiate(ast_return, ctx, ast_return_delete);
206 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
208 self->operand = expr;
213 void ast_return_delete(ast_return *self)
215 ast_unref(self->operand);
216 ast_expression_delete((ast_expression*)self);
220 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
222 const ast_expression *outtype;
224 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
226 if (field->expression.vtype != TYPE_FIELD) {
231 outtype = field->expression.next;
234 /* Error: field has no type... */
238 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
240 self->expression.vtype = outtype->expression.vtype;
241 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
243 self->entity = entity;
249 void ast_entfield_delete(ast_entfield *self)
251 ast_unref(self->entity);
252 ast_unref(self->field);
253 ast_expression_delete((ast_expression*)self);
257 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
259 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
260 if (!ontrue && !onfalse) {
261 /* because it is invalid */
265 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
268 self->on_true = ontrue;
269 self->on_false = onfalse;
274 void ast_ifthen_delete(ast_ifthen *self)
276 ast_unref(self->cond);
278 ast_unref(self->on_true);
280 ast_unref(self->on_false);
281 ast_expression_delete((ast_expression*)self);
285 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
287 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
288 /* This time NEITHER must be NULL */
289 if (!ontrue || !onfalse) {
293 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
296 self->on_true = ontrue;
297 self->on_false = onfalse;
298 self->phi_out = NULL;
303 void ast_ternary_delete(ast_ternary *self)
305 ast_unref(self->cond);
306 ast_unref(self->on_true);
307 ast_unref(self->on_false);
308 ast_expression_delete((ast_expression*)self);
312 ast_loop* ast_loop_new(lex_ctx ctx,
313 ast_expression *initexpr,
314 ast_expression *precond,
315 ast_expression *postcond,
316 ast_expression *increment,
317 ast_expression *body)
319 ast_instantiate(ast_loop, ctx, ast_loop_delete);
320 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
322 self->initexpr = initexpr;
323 self->precond = precond;
324 self->postcond = postcond;
325 self->increment = increment;
331 void ast_loop_delete(ast_loop *self)
334 ast_unref(self->initexpr);
336 ast_unref(self->precond);
338 ast_unref(self->postcond);
340 ast_unref(self->increment);
342 ast_unref(self->body);
343 ast_expression_delete((ast_expression*)self);
347 ast_call* ast_call_new(lex_ctx ctx,
348 ast_expression *funcexpr)
350 ast_instantiate(ast_call, ctx, ast_call_delete);
351 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
353 MEM_VECTOR_INIT(self, params);
355 self->func = funcexpr;
359 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
361 void ast_call_delete(ast_call *self)
364 for (i = 0; i < self->params_count; ++i)
365 ast_unref(self->params[i]);
366 MEM_VECTOR_CLEAR(self, params);
369 ast_unref(self->func);
371 ast_expression_delete((ast_expression*)self);
375 ast_store* ast_store_new(lex_ctx ctx, int op,
376 ast_value *dest, ast_expression *source)
378 ast_instantiate(ast_store, ctx, ast_store_delete);
379 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
383 self->source = source;
388 void ast_store_delete(ast_store *self)
390 ast_unref(self->dest);
391 ast_unref(self->source);
392 ast_expression_delete((ast_expression*)self);
396 ast_block* ast_block_new(lex_ctx ctx)
398 ast_instantiate(ast_block, ctx, ast_block_delete);
399 ast_expression_init((ast_expression*)self,
400 (ast_expression_codegen*)&ast_block_codegen);
402 MEM_VECTOR_INIT(self, locals);
403 MEM_VECTOR_INIT(self, exprs);
407 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
408 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
410 void ast_block_delete(ast_block *self)
413 for (i = 0; i < self->exprs_count; ++i)
414 ast_unref(self->exprs[i]);
415 MEM_VECTOR_CLEAR(self, exprs);
416 for (i = 0; i < self->locals_count; ++i)
417 ast_delete(self->locals[i]);
418 MEM_VECTOR_CLEAR(self, locals);
419 ast_expression_delete((ast_expression*)self);
423 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
425 ast_instantiate(ast_function, ctx, ast_function_delete);
429 vtype->expression.vtype != TYPE_FUNCTION)
436 self->name = name ? util_strdup(name) : NULL;
437 MEM_VECTOR_INIT(self, blocks);
439 self->labelcount = 0;
442 self->ir_func = NULL;
443 self->curblock = NULL;
445 self->breakblock = NULL;
446 self->continueblock = NULL;
448 vtype->isconst = true;
449 vtype->constval.vfunc = self;
454 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
456 void ast_function_delete(ast_function *self)
460 mem_d((void*)self->name);
462 /* ast_value_delete(self->vtype); */
463 self->vtype->isconst = false;
464 self->vtype->constval.vfunc = NULL;
465 /* We use unref - if it was stored in a global table it is supposed
466 * to be deleted from *there*
468 ast_unref(self->vtype);
470 for (i = 0; i < self->blocks_count; ++i)
471 ast_delete(self->blocks[i]);
472 MEM_VECTOR_CLEAR(self, blocks);
476 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
478 unsigned int base = 10;
479 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
480 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
489 int digit = num % base;
500 const char* ast_function_label(ast_function *self, const char *prefix)
502 size_t id = (self->labelcount++);
503 size_t len = strlen(prefix);
504 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
505 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
506 return self->labelbuf;
509 /*********************************************************************/
511 * by convention you must never pass NULL to the 'ir_value **out'
512 * parameter. If you really don't care about the output, pass a dummy.
513 * But I can't imagine a pituation where the output is truly unnecessary.
516 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
518 /* NOTE: This is the codegen for a variable used in an expression.
519 * It is not the codegen to generate the value. For this purpose,
520 * ast_local_codegen and ast_global_codegen are to be used before this
521 * is executed. ast_function_codegen should take care of its locals,
522 * and the ast-user should take care of ast_global_codegen to be used
523 * on all the globals.
526 printf("ast_value used before generated (%s)\n", self->name);
533 bool ast_global_codegen(ast_value *self, ir_builder *ir)
536 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
538 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
542 self->constval.vfunc->ir_func = func;
543 self->ir_v = func->value;
544 /* The function is filled later on ast_function_codegen... */
548 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
553 switch (self->expression.vtype)
556 if (!ir_value_set_float(v, self->constval.vfloat))
560 if (!ir_value_set_vector(v, self->constval.vvec))
564 if (!ir_value_set_string(v, self->constval.vstring))
568 printf("global of type function not properly generated\n");
570 /* Cannot generate an IR value for a function,
571 * need a pointer pointing to a function rather.
574 printf("TODO: global constant type %i\n", self->expression.vtype);
579 /* link us to the ir_value */
583 error: /* clean up */
588 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
591 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
593 /* Do we allow local functions? I think not...
594 * this is NOT a function pointer atm.
599 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
603 /* A constant local... hmmm...
604 * I suppose the IR will have to deal with this
607 switch (self->expression.vtype)
610 if (!ir_value_set_float(v, self->constval.vfloat))
614 if (!ir_value_set_vector(v, self->constval.vvec))
618 if (!ir_value_set_string(v, self->constval.vstring))
622 printf("TODO: global constant type %i\n", self->expression.vtype);
627 /* link us to the ir_value */
631 error: /* clean up */
636 bool ast_function_codegen(ast_function *self, ir_builder *ir)
644 printf("ast_function's related ast_value was not generated yet\n");
648 /* fill the parameter list */
649 for (i = 0; i < self->vtype->params_count; ++i)
651 if (!ir_function_params_add(irf, self->vtype->params[i]->expression.vtype))
653 if (!self->builtin) {
654 if (!ast_local_codegen(self->vtype->params[i], self->ir_func, true))
660 irf->builtin = self->builtin;
664 self->curblock = ir_function_create_block(irf, "entry");
668 for (i = 0; i < self->blocks_count; ++i) {
669 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
670 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
674 /* TODO: check return types */
675 if (!self->curblock->is_return)
677 if (!self->vtype->expression.next ||
678 self->vtype->expression.next->expression.vtype == TYPE_VOID)
680 return ir_block_create_return(self->curblock, NULL);
684 /* error("missing return"); */
691 /* Note, you will not see ast_block_codegen generate ir_blocks.
692 * To the AST and the IR, blocks are 2 different things.
693 * In the AST it represents a block of code, usually enclosed in
694 * curly braces {...}.
695 * While in the IR it represents a block in terms of control-flow.
697 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
702 * Note: an ast-representation using the comma-operator
703 * of the form: (a, b, c) = x should not assign to c...
707 /* output is NULL at first, we'll have each expression
708 * assign to out output, thus, a comma-operator represention
709 * using an ast_block will return the last generated value,
710 * so: (b, c) + a executed both b and c, and returns c,
711 * which is then added to a.
715 /* generate locals */
716 for (i = 0; i < self->locals_count; ++i)
718 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
722 for (i = 0; i < self->exprs_count; ++i)
724 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
725 if (!(*gen)(self->exprs[i], func, false, out))
732 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
734 ast_expression_codegen *cgen;
735 ir_value *left, *right;
737 cgen = self->dest->expression.codegen;
739 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
742 cgen = self->source->expression.codegen;
744 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
747 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
750 /* Theoretically, an assinment returns its left side as an
751 * lvalue, if we don't need an lvalue though, we return
752 * the right side as an rvalue, otherwise we have to
753 * somehow know whether or not we need to dereference the pointer
754 * on the left side - that is: OP_LOAD if it was an address.
755 * Also: in original QC we cannot OP_LOADP *anyway*.
757 *out = (lvalue ? left : right);
762 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
764 ast_expression_codegen *cgen;
765 ir_value *left, *right;
767 /* In the context of a binary operation, we can disregard
772 cgen = self->left->expression.codegen;
774 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
777 cgen = self->right->expression.codegen;
779 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
782 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
783 self->op, left, right);
790 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
792 ast_expression_codegen *cgen;
795 /* In the context of a unary operation, we can disregard
800 cgen = self->operand->expression.codegen;
802 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
805 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
813 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
815 ast_expression_codegen *cgen;
818 /* In the context of a return operation, we can disregard
823 cgen = self->operand->expression.codegen;
825 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
828 if (!ir_block_create_return(func->curblock, operand))
834 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
836 ast_expression_codegen *cgen;
837 ir_value *ent, *field;
839 /* This function needs to take the 'lvalue' flag into account!
840 * As lvalue we provide a field-pointer, as rvalue we provide the
844 cgen = self->entity->expression.codegen;
845 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
848 cgen = self->field->expression.codegen;
849 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
854 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
857 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
858 ent, field, self->expression.vtype);
863 /* Hm that should be it... */
867 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
869 ast_expression_codegen *cgen;
874 ir_block *cond = func->curblock;
879 /* We don't output any value, thus also don't care about r/lvalue */
883 /* generate the condition */
884 func->curblock = cond;
885 cgen = self->cond->expression.codegen;
886 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
892 /* create on-true block */
893 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
897 /* enter the block */
898 func->curblock = ontrue;
901 cgen = self->on_true->expression.codegen;
902 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
908 if (self->on_false) {
909 /* create on-false block */
910 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
914 /* enter the block */
915 func->curblock = onfalse;
918 cgen = self->on_false->expression.codegen;
919 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
924 /* Merge block were they all merge in to */
925 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
929 /* add jumps ot the merge block */
930 if (ontrue && !ir_block_create_jump(ontrue, merge))
932 if (onfalse && !ir_block_create_jump(onfalse, merge))
935 /* we create the if here, that way all blocks are ordered :)
937 if (!ir_block_create_if(cond, condval,
938 (ontrue ? ontrue : merge),
939 (onfalse ? onfalse : merge)))
944 /* Now enter the merge block */
945 func->curblock = merge;
950 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
952 ast_expression_codegen *cgen;
955 ir_value *trueval, *falseval;
958 ir_block *cond = func->curblock;
963 /* In theory it shouldn't be possible to pass through a node twice, but
964 * in case we add any kind of optimization pass for the AST itself, it
965 * may still happen, thus we remember a created ir_value and simply return one
966 * if it already exists.
969 *out = self->phi_out;
973 /* Ternary can never create an lvalue... */
977 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
979 /* generate the condition */
980 func->curblock = cond;
981 cgen = self->cond->expression.codegen;
982 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
985 /* create on-true block */
986 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
991 /* enter the block */
992 func->curblock = ontrue;
995 cgen = self->on_true->expression.codegen;
996 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1000 /* create on-false block */
1001 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1006 /* enter the block */
1007 func->curblock = onfalse;
1010 cgen = self->on_false->expression.codegen;
1011 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1015 /* create merge block */
1016 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1019 /* jump to merge block */
1020 if (!ir_block_create_jump(ontrue, merge))
1022 if (!ir_block_create_jump(onfalse, merge))
1025 /* create if instruction */
1026 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1029 /* Now enter the merge block */
1030 func->curblock = merge;
1032 /* Here, now, we need a PHI node
1033 * but first some sanity checking...
1035 if (trueval->vtype != falseval->vtype) {
1036 /* error("ternary with different types on the two sides"); */
1041 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1043 !ir_phi_add(phi, ontrue, trueval) ||
1044 !ir_phi_add(phi, onfalse, falseval))
1049 self->phi_out = ir_phi_value(phi);
1050 *out = self->phi_out;
1055 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1057 ast_expression_codegen *cgen;
1059 ir_value *dummy = NULL;
1060 ir_value *precond = NULL;
1061 ir_value *postcond = NULL;
1063 /* Since we insert some jumps "late" so we have blocks
1064 * ordered "nicely", we need to keep track of the actual end-blocks
1065 * of expressions to add the jumps to.
1067 ir_block *bbody = NULL, *end_bbody = NULL;
1068 ir_block *bprecond = NULL, *end_bprecond = NULL;
1069 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1070 ir_block *bincrement = NULL, *end_bincrement = NULL;
1071 ir_block *bout = NULL, *bin = NULL;
1073 /* let's at least move the outgoing block to the end */
1076 /* 'break' and 'continue' need to be able to find the right blocks */
1077 ir_block *bcontinue = NULL;
1078 ir_block *bbreak = NULL;
1080 ir_block *old_bcontinue = NULL;
1081 ir_block *old_bbreak = NULL;
1083 ir_block *tmpblock = NULL;
1089 * Should we ever need some kind of block ordering, better make this function
1090 * move blocks around than write a block ordering algorithm later... after all
1091 * the ast and ir should work together, not against each other.
1094 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1095 * anyway if for example it contains a ternary.
1099 cgen = self->initexpr->expression.codegen;
1100 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1104 /* Store the block from which we enter this chaos */
1105 bin = func->curblock;
1107 /* The pre-loop condition needs its own block since we
1108 * need to be able to jump to the start of that expression.
1112 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1116 /* the pre-loop-condition the least important place to 'continue' at */
1117 bcontinue = bprecond;
1120 func->curblock = bprecond;
1123 cgen = self->precond->expression.codegen;
1124 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1127 end_bprecond = func->curblock;
1129 bprecond = end_bprecond = NULL;
1132 /* Now the next blocks won't be ordered nicely, but we need to
1133 * generate them this early for 'break' and 'continue'.
1135 if (self->increment) {
1136 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1139 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1141 bincrement = end_bincrement = NULL;
1144 if (self->postcond) {
1145 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1148 bcontinue = bpostcond; /* postcond comes before the increment */
1150 bpostcond = end_bpostcond = NULL;
1153 bout_id = func->ir_func->blocks_count;
1154 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1159 /* The loop body... */
1162 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1167 func->curblock = bbody;
1169 old_bbreak = func->breakblock;
1170 old_bcontinue = func->continueblock;
1171 func->breakblock = bbreak;
1172 func->continueblock = bcontinue;
1175 cgen = self->body->expression.codegen;
1176 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1179 end_bbody = func->curblock;
1180 func->breakblock = old_bbreak;
1181 func->continueblock = old_bcontinue;
1184 /* post-loop-condition */
1188 func->curblock = bpostcond;
1191 cgen = self->postcond->expression.codegen;
1192 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1195 end_bpostcond = func->curblock;
1198 /* The incrementor */
1199 if (self->increment)
1202 func->curblock = bincrement;
1205 cgen = self->increment->expression.codegen;
1206 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1209 end_bincrement = func->curblock;
1212 /* In any case now, we continue from the outgoing block */
1213 func->curblock = bout;
1215 /* Now all blocks are in place */
1216 /* From 'bin' we jump to whatever comes first */
1217 if (bprecond) tmpblock = bprecond;
1218 else if (bbody) tmpblock = bbody;
1219 else if (bpostcond) tmpblock = bpostcond;
1220 else tmpblock = bout;
1221 if (!ir_block_create_jump(bin, tmpblock))
1227 ir_block *ontrue, *onfalse;
1228 if (bbody) ontrue = bbody;
1229 else if (bincrement) ontrue = bincrement;
1230 else if (bpostcond) ontrue = bpostcond;
1231 else ontrue = bprecond;
1233 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1240 if (bincrement) tmpblock = bincrement;
1241 else if (bpostcond) tmpblock = bpostcond;
1242 else if (bprecond) tmpblock = bprecond;
1243 else tmpblock = bout;
1244 if (!ir_block_create_jump(end_bbody, tmpblock))
1248 /* from increment */
1251 if (bpostcond) tmpblock = bpostcond;
1252 else if (bprecond) tmpblock = bprecond;
1253 else if (bbody) tmpblock = bbody;
1254 else tmpblock = bout;
1255 if (!ir_block_create_jump(end_bincrement, tmpblock))
1262 ir_block *ontrue, *onfalse;
1263 if (bprecond) ontrue = bprecond;
1264 else if (bbody) ontrue = bbody;
1265 else if (bincrement) ontrue = bincrement;
1266 else ontrue = bpostcond;
1268 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1272 /* Move 'bout' to the end */
1273 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1274 !ir_function_blocks_add(func->ir_func, bout))
1276 ir_block_delete(bout);
1283 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1285 ast_expression_codegen *cgen;
1286 ir_value_vector params;
1287 ir_instr *callinstr;
1290 ir_value *funval = NULL;
1292 /* return values are never rvalues */
1295 cgen = self->func->expression.codegen;
1296 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1301 MEM_VECTOR_INIT(¶ms, v);
1304 for (i = 0; i < self->params_count; ++i)
1307 ast_expression *expr = self->params[i];
1309 cgen = expr->expression.codegen;
1310 if (!(*cgen)(expr, func, false, ¶m))
1314 if (!ir_value_vector_v_add(¶ms, param))
1318 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1322 for (i = 0; i < params.v_count; ++i) {
1323 if (!ir_call_param(callinstr, params.v[i]))
1327 *out = ir_call_value(callinstr);
1331 MEM_VECTOR_CLEAR(¶ms, v);