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;
60 MEM_VECTOR_INIT(&self->expression, params);
63 static void ast_expression_delete(ast_expression *self)
66 if (self->expression.next)
67 ast_delete(self->expression.next);
68 for (i = 0; i < self->expression.params_count; ++i) {
69 ast_delete(self->expression.params[i]);
71 MEM_VECTOR_CLEAR(&self->expression, params);
74 static void ast_expression_delete_full(ast_expression *self)
76 ast_expression_delete(self);
80 MEM_VEC_FUNCTIONS(ast_expression_common, ast_value*, params)
82 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex);
83 static ast_value* ast_value_copy(const ast_value *self)
85 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
86 if (self->expression.next) {
87 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
88 if (!cp->expression.next) {
96 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
99 const ast_expression_common *fromex;
100 ast_expression_common *selfex;
106 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
108 fromex = &ex->expression;
109 selfex = &self->expression;
111 /* This may never be codegen()d */
112 selfex->codegen = NULL;
114 selfex->vtype = fromex->vtype;
117 selfex->next = ast_type_copy(ctx, fromex->next);
119 ast_expression_delete_full(self);
126 for (i = 0; i < fromex->params_count; ++i) {
127 ast_value *v = ast_value_copy(fromex->params[i]);
128 if (!v || !ast_expression_common_params_add(selfex, v)) {
129 ast_expression_delete_full(self);
138 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
140 ast_instantiate(ast_value, ctx, ast_value_delete);
141 ast_expression_init((ast_expression*)self,
142 (ast_expression_codegen*)&ast_value_codegen);
143 self->expression.node.keep = true; /* keep */
145 self->name = name ? util_strdup(name) : NULL;
146 self->expression.vtype = t;
147 self->expression.next = NULL;
148 self->isconst = false;
149 memset(&self->constval, 0, sizeof(self->constval));
156 void ast_value_delete(ast_value* self)
159 mem_d((void*)self->name);
161 switch (self->expression.vtype)
164 mem_d((void*)self->constval.vstring);
167 /* unlink us from the function node */
168 self->constval.vfunc->vtype = NULL;
170 /* NOTE: delete function? currently collected in
171 * the parser structure
177 ast_expression_delete((ast_expression*)self);
181 bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
183 return ast_expression_common_params_add(&self->expression, p);
186 bool ast_value_set_name(ast_value *self, const char *name)
189 mem_d((void*)self->name);
190 self->name = util_strdup(name);
194 ast_binary* ast_binary_new(lex_ctx ctx, int op,
195 ast_expression* left, ast_expression* right)
197 ast_instantiate(ast_binary, ctx, ast_binary_delete);
198 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
207 void ast_binary_delete(ast_binary *self)
209 ast_unref(self->left);
210 ast_unref(self->right);
211 ast_expression_delete((ast_expression*)self);
215 ast_unary* ast_unary_new(lex_ctx ctx, int op,
216 ast_expression *expr)
218 ast_instantiate(ast_unary, ctx, ast_unary_delete);
219 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
222 self->operand = expr;
227 void ast_unary_delete(ast_unary *self)
229 ast_unref(self->operand);
230 ast_expression_delete((ast_expression*)self);
234 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
236 ast_instantiate(ast_return, ctx, ast_return_delete);
237 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
239 self->operand = expr;
244 void ast_return_delete(ast_return *self)
246 ast_unref(self->operand);
247 ast_expression_delete((ast_expression*)self);
251 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
253 const ast_expression *outtype;
255 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
257 if (field->expression.vtype != TYPE_FIELD) {
262 outtype = field->expression.next;
265 /* Error: field has no type... */
269 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
271 self->expression.vtype = outtype->expression.vtype;
272 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
274 self->entity = entity;
280 void ast_entfield_delete(ast_entfield *self)
282 ast_unref(self->entity);
283 ast_unref(self->field);
284 ast_expression_delete((ast_expression*)self);
288 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
290 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
291 if (!ontrue && !onfalse) {
292 /* because it is invalid */
296 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
299 self->on_true = ontrue;
300 self->on_false = onfalse;
305 void ast_ifthen_delete(ast_ifthen *self)
307 ast_unref(self->cond);
309 ast_unref(self->on_true);
311 ast_unref(self->on_false);
312 ast_expression_delete((ast_expression*)self);
316 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
318 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
319 /* This time NEITHER must be NULL */
320 if (!ontrue || !onfalse) {
324 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
327 self->on_true = ontrue;
328 self->on_false = onfalse;
329 self->phi_out = NULL;
334 void ast_ternary_delete(ast_ternary *self)
336 ast_unref(self->cond);
337 ast_unref(self->on_true);
338 ast_unref(self->on_false);
339 ast_expression_delete((ast_expression*)self);
343 ast_loop* ast_loop_new(lex_ctx ctx,
344 ast_expression *initexpr,
345 ast_expression *precond,
346 ast_expression *postcond,
347 ast_expression *increment,
348 ast_expression *body)
350 ast_instantiate(ast_loop, ctx, ast_loop_delete);
351 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
353 self->initexpr = initexpr;
354 self->precond = precond;
355 self->postcond = postcond;
356 self->increment = increment;
362 void ast_loop_delete(ast_loop *self)
365 ast_unref(self->initexpr);
367 ast_unref(self->precond);
369 ast_unref(self->postcond);
371 ast_unref(self->increment);
373 ast_unref(self->body);
374 ast_expression_delete((ast_expression*)self);
378 ast_call* ast_call_new(lex_ctx ctx,
379 ast_expression *funcexpr)
381 ast_instantiate(ast_call, ctx, ast_call_delete);
382 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
384 MEM_VECTOR_INIT(self, params);
386 self->func = funcexpr;
390 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
392 void ast_call_delete(ast_call *self)
395 for (i = 0; i < self->params_count; ++i)
396 ast_unref(self->params[i]);
397 MEM_VECTOR_CLEAR(self, params);
400 ast_unref(self->func);
402 ast_expression_delete((ast_expression*)self);
406 ast_store* ast_store_new(lex_ctx ctx, int op,
407 ast_value *dest, ast_expression *source)
409 ast_instantiate(ast_store, ctx, ast_store_delete);
410 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
414 self->source = source;
419 void ast_store_delete(ast_store *self)
421 ast_unref(self->dest);
422 ast_unref(self->source);
423 ast_expression_delete((ast_expression*)self);
427 ast_block* ast_block_new(lex_ctx ctx)
429 ast_instantiate(ast_block, ctx, ast_block_delete);
430 ast_expression_init((ast_expression*)self,
431 (ast_expression_codegen*)&ast_block_codegen);
433 MEM_VECTOR_INIT(self, locals);
434 MEM_VECTOR_INIT(self, exprs);
438 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
439 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
441 void ast_block_delete(ast_block *self)
444 for (i = 0; i < self->exprs_count; ++i)
445 ast_unref(self->exprs[i]);
446 MEM_VECTOR_CLEAR(self, exprs);
447 for (i = 0; i < self->locals_count; ++i)
448 ast_delete(self->locals[i]);
449 MEM_VECTOR_CLEAR(self, locals);
450 ast_expression_delete((ast_expression*)self);
454 bool ast_block_set_type(ast_block *self, ast_expression *from)
456 if (self->expression.next)
457 ast_delete(self->expression.next);
458 self->expression.vtype = from->expression.vtype;
459 if (from->expression.next) {
460 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
461 if (!self->expression.next)
467 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
469 ast_instantiate(ast_function, ctx, ast_function_delete);
473 vtype->expression.vtype != TYPE_FUNCTION)
480 self->name = name ? util_strdup(name) : NULL;
481 MEM_VECTOR_INIT(self, blocks);
483 self->labelcount = 0;
486 self->ir_func = NULL;
487 self->curblock = NULL;
489 self->breakblock = NULL;
490 self->continueblock = NULL;
492 vtype->isconst = true;
493 vtype->constval.vfunc = self;
498 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
500 void ast_function_delete(ast_function *self)
504 mem_d((void*)self->name);
506 /* ast_value_delete(self->vtype); */
507 self->vtype->isconst = false;
508 self->vtype->constval.vfunc = NULL;
509 /* We use unref - if it was stored in a global table it is supposed
510 * to be deleted from *there*
512 ast_unref(self->vtype);
514 for (i = 0; i < self->blocks_count; ++i)
515 ast_delete(self->blocks[i]);
516 MEM_VECTOR_CLEAR(self, blocks);
520 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
522 unsigned int base = 10;
523 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
524 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
533 int digit = num % base;
544 const char* ast_function_label(ast_function *self, const char *prefix)
546 size_t id = (self->labelcount++);
547 size_t len = strlen(prefix);
548 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
549 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
550 return self->labelbuf;
553 /*********************************************************************/
555 * by convention you must never pass NULL to the 'ir_value **out'
556 * parameter. If you really don't care about the output, pass a dummy.
557 * But I can't imagine a pituation where the output is truly unnecessary.
560 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
562 /* NOTE: This is the codegen for a variable used in an expression.
563 * It is not the codegen to generate the value. For this purpose,
564 * ast_local_codegen and ast_global_codegen are to be used before this
565 * is executed. ast_function_codegen should take care of its locals,
566 * and the ast-user should take care of ast_global_codegen to be used
567 * on all the globals.
570 printf("ast_value used before generated (%s)\n", self->name);
577 bool ast_global_codegen(ast_value *self, ir_builder *ir)
580 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
582 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
586 self->constval.vfunc->ir_func = func;
587 self->ir_v = func->value;
588 /* The function is filled later on ast_function_codegen... */
592 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
597 switch (self->expression.vtype)
600 if (!ir_value_set_float(v, self->constval.vfloat))
604 if (!ir_value_set_vector(v, self->constval.vvec))
608 if (!ir_value_set_string(v, self->constval.vstring))
612 printf("global of type function not properly generated\n");
614 /* Cannot generate an IR value for a function,
615 * need a pointer pointing to a function rather.
618 printf("TODO: global constant type %i\n", self->expression.vtype);
623 /* link us to the ir_value */
627 error: /* clean up */
632 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
635 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
637 /* Do we allow local functions? I think not...
638 * this is NOT a function pointer atm.
643 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
647 /* A constant local... hmmm...
648 * I suppose the IR will have to deal with this
651 switch (self->expression.vtype)
654 if (!ir_value_set_float(v, self->constval.vfloat))
658 if (!ir_value_set_vector(v, self->constval.vvec))
662 if (!ir_value_set_string(v, self->constval.vstring))
666 printf("TODO: global constant type %i\n", self->expression.vtype);
671 /* link us to the ir_value */
675 error: /* clean up */
680 bool ast_function_codegen(ast_function *self, ir_builder *ir)
684 ast_expression_common *ec;
689 printf("ast_function's related ast_value was not generated yet\n");
693 /* fill the parameter list */
694 ec = &self->vtype->expression;
695 for (i = 0; i < ec->params_count; ++i)
697 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
699 if (!self->builtin) {
700 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
706 irf->builtin = self->builtin;
710 self->curblock = ir_function_create_block(irf, "entry");
714 for (i = 0; i < self->blocks_count; ++i) {
715 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
716 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
720 /* TODO: check return types */
721 if (!self->curblock->is_return)
723 if (!self->vtype->expression.next ||
724 self->vtype->expression.next->expression.vtype == TYPE_VOID)
726 return ir_block_create_return(self->curblock, NULL);
730 /* error("missing return"); */
737 /* Note, you will not see ast_block_codegen generate ir_blocks.
738 * To the AST and the IR, blocks are 2 different things.
739 * In the AST it represents a block of code, usually enclosed in
740 * curly braces {...}.
741 * While in the IR it represents a block in terms of control-flow.
743 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
748 * Note: an ast-representation using the comma-operator
749 * of the form: (a, b, c) = x should not assign to c...
753 /* output is NULL at first, we'll have each expression
754 * assign to out output, thus, a comma-operator represention
755 * using an ast_block will return the last generated value,
756 * so: (b, c) + a executed both b and c, and returns c,
757 * which is then added to a.
761 /* generate locals */
762 for (i = 0; i < self->locals_count; ++i)
764 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
768 for (i = 0; i < self->exprs_count; ++i)
770 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
771 if (!(*gen)(self->exprs[i], func, false, out))
778 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
780 ast_expression_codegen *cgen;
781 ir_value *left, *right;
783 cgen = self->dest->expression.codegen;
785 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
788 cgen = self->source->expression.codegen;
790 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
793 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
796 /* Theoretically, an assinment returns its left side as an
797 * lvalue, if we don't need an lvalue though, we return
798 * the right side as an rvalue, otherwise we have to
799 * somehow know whether or not we need to dereference the pointer
800 * on the left side - that is: OP_LOAD if it was an address.
801 * Also: in original QC we cannot OP_LOADP *anyway*.
803 *out = (lvalue ? left : right);
808 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
810 ast_expression_codegen *cgen;
811 ir_value *left, *right;
813 /* In the context of a binary operation, we can disregard
818 cgen = self->left->expression.codegen;
820 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
823 cgen = self->right->expression.codegen;
825 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
828 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
829 self->op, left, right);
836 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
838 ast_expression_codegen *cgen;
841 /* In the context of a unary operation, we can disregard
846 cgen = self->operand->expression.codegen;
848 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
851 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
859 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
861 ast_expression_codegen *cgen;
864 /* In the context of a return operation, we can disregard
869 cgen = self->operand->expression.codegen;
871 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
874 if (!ir_block_create_return(func->curblock, operand))
880 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
882 ast_expression_codegen *cgen;
883 ir_value *ent, *field;
885 /* This function needs to take the 'lvalue' flag into account!
886 * As lvalue we provide a field-pointer, as rvalue we provide the
890 cgen = self->entity->expression.codegen;
891 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
894 cgen = self->field->expression.codegen;
895 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
900 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
903 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
904 ent, field, self->expression.vtype);
909 /* Hm that should be it... */
913 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
915 ast_expression_codegen *cgen;
920 ir_block *cond = func->curblock;
925 /* We don't output any value, thus also don't care about r/lvalue */
929 /* generate the condition */
930 func->curblock = cond;
931 cgen = self->cond->expression.codegen;
932 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
938 /* create on-true block */
939 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
943 /* enter the block */
944 func->curblock = ontrue;
947 cgen = self->on_true->expression.codegen;
948 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
954 if (self->on_false) {
955 /* create on-false block */
956 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
960 /* enter the block */
961 func->curblock = onfalse;
964 cgen = self->on_false->expression.codegen;
965 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
970 /* Merge block were they all merge in to */
971 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
975 /* add jumps ot the merge block */
976 if (ontrue && !ir_block_create_jump(ontrue, merge))
978 if (onfalse && !ir_block_create_jump(onfalse, merge))
981 /* we create the if here, that way all blocks are ordered :)
983 if (!ir_block_create_if(cond, condval,
984 (ontrue ? ontrue : merge),
985 (onfalse ? onfalse : merge)))
990 /* Now enter the merge block */
991 func->curblock = merge;
996 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
998 ast_expression_codegen *cgen;
1001 ir_value *trueval, *falseval;
1004 ir_block *cond = func->curblock;
1009 /* In theory it shouldn't be possible to pass through a node twice, but
1010 * in case we add any kind of optimization pass for the AST itself, it
1011 * may still happen, thus we remember a created ir_value and simply return one
1012 * if it already exists.
1014 if (self->phi_out) {
1015 *out = self->phi_out;
1019 /* Ternary can never create an lvalue... */
1023 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1025 /* generate the condition */
1026 func->curblock = cond;
1027 cgen = self->cond->expression.codegen;
1028 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1031 /* create on-true block */
1032 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1037 /* enter the block */
1038 func->curblock = ontrue;
1041 cgen = self->on_true->expression.codegen;
1042 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1046 /* create on-false block */
1047 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1052 /* enter the block */
1053 func->curblock = onfalse;
1056 cgen = self->on_false->expression.codegen;
1057 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1061 /* create merge block */
1062 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1065 /* jump to merge block */
1066 if (!ir_block_create_jump(ontrue, merge))
1068 if (!ir_block_create_jump(onfalse, merge))
1071 /* create if instruction */
1072 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1075 /* Now enter the merge block */
1076 func->curblock = merge;
1078 /* Here, now, we need a PHI node
1079 * but first some sanity checking...
1081 if (trueval->vtype != falseval->vtype) {
1082 /* error("ternary with different types on the two sides"); */
1087 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1089 !ir_phi_add(phi, ontrue, trueval) ||
1090 !ir_phi_add(phi, onfalse, falseval))
1095 self->phi_out = ir_phi_value(phi);
1096 *out = self->phi_out;
1101 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1103 ast_expression_codegen *cgen;
1105 ir_value *dummy = NULL;
1106 ir_value *precond = NULL;
1107 ir_value *postcond = NULL;
1109 /* Since we insert some jumps "late" so we have blocks
1110 * ordered "nicely", we need to keep track of the actual end-blocks
1111 * of expressions to add the jumps to.
1113 ir_block *bbody = NULL, *end_bbody = NULL;
1114 ir_block *bprecond = NULL, *end_bprecond = NULL;
1115 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1116 ir_block *bincrement = NULL, *end_bincrement = NULL;
1117 ir_block *bout = NULL, *bin = NULL;
1119 /* let's at least move the outgoing block to the end */
1122 /* 'break' and 'continue' need to be able to find the right blocks */
1123 ir_block *bcontinue = NULL;
1124 ir_block *bbreak = NULL;
1126 ir_block *old_bcontinue = NULL;
1127 ir_block *old_bbreak = NULL;
1129 ir_block *tmpblock = NULL;
1135 * Should we ever need some kind of block ordering, better make this function
1136 * move blocks around than write a block ordering algorithm later... after all
1137 * the ast and ir should work together, not against each other.
1140 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1141 * anyway if for example it contains a ternary.
1145 cgen = self->initexpr->expression.codegen;
1146 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1150 /* Store the block from which we enter this chaos */
1151 bin = func->curblock;
1153 /* The pre-loop condition needs its own block since we
1154 * need to be able to jump to the start of that expression.
1158 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1162 /* the pre-loop-condition the least important place to 'continue' at */
1163 bcontinue = bprecond;
1166 func->curblock = bprecond;
1169 cgen = self->precond->expression.codegen;
1170 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1173 end_bprecond = func->curblock;
1175 bprecond = end_bprecond = NULL;
1178 /* Now the next blocks won't be ordered nicely, but we need to
1179 * generate them this early for 'break' and 'continue'.
1181 if (self->increment) {
1182 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1185 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1187 bincrement = end_bincrement = NULL;
1190 if (self->postcond) {
1191 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1194 bcontinue = bpostcond; /* postcond comes before the increment */
1196 bpostcond = end_bpostcond = NULL;
1199 bout_id = func->ir_func->blocks_count;
1200 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1205 /* The loop body... */
1208 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1213 func->curblock = bbody;
1215 old_bbreak = func->breakblock;
1216 old_bcontinue = func->continueblock;
1217 func->breakblock = bbreak;
1218 func->continueblock = bcontinue;
1221 cgen = self->body->expression.codegen;
1222 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1225 end_bbody = func->curblock;
1226 func->breakblock = old_bbreak;
1227 func->continueblock = old_bcontinue;
1230 /* post-loop-condition */
1234 func->curblock = bpostcond;
1237 cgen = self->postcond->expression.codegen;
1238 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1241 end_bpostcond = func->curblock;
1244 /* The incrementor */
1245 if (self->increment)
1248 func->curblock = bincrement;
1251 cgen = self->increment->expression.codegen;
1252 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1255 end_bincrement = func->curblock;
1258 /* In any case now, we continue from the outgoing block */
1259 func->curblock = bout;
1261 /* Now all blocks are in place */
1262 /* From 'bin' we jump to whatever comes first */
1263 if (bprecond) tmpblock = bprecond;
1264 else if (bbody) tmpblock = bbody;
1265 else if (bpostcond) tmpblock = bpostcond;
1266 else tmpblock = bout;
1267 if (!ir_block_create_jump(bin, tmpblock))
1273 ir_block *ontrue, *onfalse;
1274 if (bbody) ontrue = bbody;
1275 else if (bincrement) ontrue = bincrement;
1276 else if (bpostcond) ontrue = bpostcond;
1277 else ontrue = bprecond;
1279 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1286 if (bincrement) tmpblock = bincrement;
1287 else if (bpostcond) tmpblock = bpostcond;
1288 else if (bprecond) tmpblock = bprecond;
1289 else tmpblock = bout;
1290 if (!ir_block_create_jump(end_bbody, tmpblock))
1294 /* from increment */
1297 if (bpostcond) tmpblock = bpostcond;
1298 else if (bprecond) tmpblock = bprecond;
1299 else if (bbody) tmpblock = bbody;
1300 else tmpblock = bout;
1301 if (!ir_block_create_jump(end_bincrement, tmpblock))
1308 ir_block *ontrue, *onfalse;
1309 if (bprecond) ontrue = bprecond;
1310 else if (bbody) ontrue = bbody;
1311 else if (bincrement) ontrue = bincrement;
1312 else ontrue = bpostcond;
1314 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1318 /* Move 'bout' to the end */
1319 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1320 !ir_function_blocks_add(func->ir_func, bout))
1322 ir_block_delete(bout);
1329 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1331 ast_expression_codegen *cgen;
1332 ir_value_vector params;
1333 ir_instr *callinstr;
1336 ir_value *funval = NULL;
1338 /* return values are never rvalues */
1341 cgen = self->func->expression.codegen;
1342 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1347 MEM_VECTOR_INIT(¶ms, v);
1350 for (i = 0; i < self->params_count; ++i)
1353 ast_expression *expr = self->params[i];
1355 cgen = expr->expression.codegen;
1356 if (!(*cgen)(expr, func, false, ¶m))
1360 if (!ir_value_vector_v_add(¶ms, param))
1364 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1368 for (i = 0; i < params.v_count; ++i) {
1369 if (!ir_call_param(callinstr, params.v[i]))
1373 *out = ir_call_value(callinstr);
1375 MEM_VECTOR_CLEAR(¶ms, v);
1378 MEM_VECTOR_CLEAR(¶ms, v);