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, TYPE_##T); \
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, int nodetype)
48 self->node.context = ctx;
49 self->node.destroy = &_ast_node_destroy;
50 self->node.keep = false;
51 self->node.nodetype = nodetype;
54 /* General expression initialization */
55 static void ast_expression_init(ast_expression *self,
56 ast_expression_codegen *codegen)
58 self->expression.codegen = codegen;
59 self->expression.vtype = TYPE_VOID;
60 self->expression.next = NULL;
61 MEM_VECTOR_INIT(&self->expression, params);
64 static void ast_expression_delete(ast_expression *self)
67 if (self->expression.next)
68 ast_delete(self->expression.next);
69 for (i = 0; i < self->expression.params_count; ++i) {
70 ast_delete(self->expression.params[i]);
72 MEM_VECTOR_CLEAR(&self->expression, params);
75 static void ast_expression_delete_full(ast_expression *self)
77 ast_expression_delete(self);
81 MEM_VEC_FUNCTIONS(ast_expression_common, ast_value*, params)
83 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex);
84 static ast_value* ast_value_copy(const ast_value *self)
86 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
87 if (self->expression.next) {
88 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
89 if (!cp->expression.next) {
97 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
100 const ast_expression_common *fromex;
101 ast_expression_common *selfex;
107 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
109 fromex = &ex->expression;
110 selfex = &self->expression;
112 /* This may never be codegen()d */
113 selfex->codegen = NULL;
115 selfex->vtype = fromex->vtype;
118 selfex->next = ast_type_copy(ctx, fromex->next);
120 ast_expression_delete_full(self);
127 for (i = 0; i < fromex->params_count; ++i) {
128 ast_value *v = ast_value_copy(fromex->params[i]);
129 if (!v || !ast_expression_common_params_add(selfex, v)) {
130 ast_expression_delete_full(self);
139 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
141 ast_instantiate(ast_value, ctx, ast_value_delete);
142 ast_expression_init((ast_expression*)self,
143 (ast_expression_codegen*)&ast_value_codegen);
144 self->expression.node.keep = true; /* keep */
146 self->name = name ? util_strdup(name) : NULL;
147 self->expression.vtype = t;
148 self->expression.next = NULL;
149 self->isconst = false;
150 memset(&self->constval, 0, sizeof(self->constval));
157 void ast_value_delete(ast_value* self)
160 mem_d((void*)self->name);
162 switch (self->expression.vtype)
165 mem_d((void*)self->constval.vstring);
168 /* unlink us from the function node */
169 self->constval.vfunc->vtype = NULL;
171 /* NOTE: delete function? currently collected in
172 * the parser structure
178 ast_expression_delete((ast_expression*)self);
182 bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
184 return ast_expression_common_params_add(&self->expression, p);
187 bool ast_value_set_name(ast_value *self, const char *name)
190 mem_d((void*)self->name);
191 self->name = util_strdup(name);
195 ast_binary* ast_binary_new(lex_ctx ctx, int op,
196 ast_expression* left, ast_expression* right)
198 ast_instantiate(ast_binary, ctx, ast_binary_delete);
199 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
205 if (op >= INSTR_EQ_F && op <= INSTR_GT)
206 self->expression.vtype = TYPE_FLOAT;
207 else if (op == INSTR_AND || op == INSTR_OR ||
208 op == INSTR_BITAND || op == INSTR_BITOR)
209 self->expression.vtype = TYPE_FLOAT;
210 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
211 self->expression.vtype = TYPE_VECTOR;
212 else if (op == INSTR_MUL_V)
213 self->expression.vtype = TYPE_FLOAT;
215 self->expression.vtype = left->expression.vtype;
220 void ast_binary_delete(ast_binary *self)
222 ast_unref(self->left);
223 ast_unref(self->right);
224 ast_expression_delete((ast_expression*)self);
228 ast_unary* ast_unary_new(lex_ctx ctx, int op,
229 ast_expression *expr)
231 ast_instantiate(ast_unary, ctx, ast_unary_delete);
232 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
235 self->operand = expr;
240 void ast_unary_delete(ast_unary *self)
242 ast_unref(self->operand);
243 ast_expression_delete((ast_expression*)self);
247 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
249 ast_instantiate(ast_return, ctx, ast_return_delete);
250 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
252 self->operand = expr;
257 void ast_return_delete(ast_return *self)
259 ast_unref(self->operand);
260 ast_expression_delete((ast_expression*)self);
264 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
266 const ast_expression *outtype;
268 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
270 if (field->expression.vtype != TYPE_FIELD) {
275 outtype = field->expression.next;
278 /* Error: field has no type... */
282 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
284 self->expression.vtype = outtype->expression.vtype;
285 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
287 self->entity = entity;
293 void ast_entfield_delete(ast_entfield *self)
295 ast_unref(self->entity);
296 ast_unref(self->field);
297 ast_expression_delete((ast_expression*)self);
301 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
303 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
304 if (!ontrue && !onfalse) {
305 /* because it is invalid */
309 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
312 self->on_true = ontrue;
313 self->on_false = onfalse;
318 void ast_ifthen_delete(ast_ifthen *self)
320 ast_unref(self->cond);
322 ast_unref(self->on_true);
324 ast_unref(self->on_false);
325 ast_expression_delete((ast_expression*)self);
329 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
331 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
332 /* This time NEITHER must be NULL */
333 if (!ontrue || !onfalse) {
337 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
340 self->on_true = ontrue;
341 self->on_false = onfalse;
342 self->phi_out = NULL;
347 void ast_ternary_delete(ast_ternary *self)
349 ast_unref(self->cond);
350 ast_unref(self->on_true);
351 ast_unref(self->on_false);
352 ast_expression_delete((ast_expression*)self);
356 ast_loop* ast_loop_new(lex_ctx ctx,
357 ast_expression *initexpr,
358 ast_expression *precond,
359 ast_expression *postcond,
360 ast_expression *increment,
361 ast_expression *body)
363 ast_instantiate(ast_loop, ctx, ast_loop_delete);
364 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
366 self->initexpr = initexpr;
367 self->precond = precond;
368 self->postcond = postcond;
369 self->increment = increment;
375 void ast_loop_delete(ast_loop *self)
378 ast_unref(self->initexpr);
380 ast_unref(self->precond);
382 ast_unref(self->postcond);
384 ast_unref(self->increment);
386 ast_unref(self->body);
387 ast_expression_delete((ast_expression*)self);
391 ast_call* ast_call_new(lex_ctx ctx,
392 ast_expression *funcexpr)
394 ast_instantiate(ast_call, ctx, ast_call_delete);
395 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
397 MEM_VECTOR_INIT(self, params);
399 self->func = funcexpr;
403 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
405 void ast_call_delete(ast_call *self)
408 for (i = 0; i < self->params_count; ++i)
409 ast_unref(self->params[i]);
410 MEM_VECTOR_CLEAR(self, params);
413 ast_unref(self->func);
415 ast_expression_delete((ast_expression*)self);
419 ast_store* ast_store_new(lex_ctx ctx, int op,
420 ast_expression *dest, ast_expression *source)
422 ast_instantiate(ast_store, ctx, ast_store_delete);
423 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
427 self->source = source;
432 void ast_store_delete(ast_store *self)
434 ast_unref(self->dest);
435 ast_unref(self->source);
436 ast_expression_delete((ast_expression*)self);
440 ast_block* ast_block_new(lex_ctx ctx)
442 ast_instantiate(ast_block, ctx, ast_block_delete);
443 ast_expression_init((ast_expression*)self,
444 (ast_expression_codegen*)&ast_block_codegen);
446 MEM_VECTOR_INIT(self, locals);
447 MEM_VECTOR_INIT(self, exprs);
451 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
452 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
454 void ast_block_delete(ast_block *self)
457 for (i = 0; i < self->exprs_count; ++i)
458 ast_unref(self->exprs[i]);
459 MEM_VECTOR_CLEAR(self, exprs);
460 for (i = 0; i < self->locals_count; ++i)
461 ast_delete(self->locals[i]);
462 MEM_VECTOR_CLEAR(self, locals);
463 ast_expression_delete((ast_expression*)self);
467 bool ast_block_set_type(ast_block *self, ast_expression *from)
469 if (self->expression.next)
470 ast_delete(self->expression.next);
471 self->expression.vtype = from->expression.vtype;
472 if (from->expression.next) {
473 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
474 if (!self->expression.next)
480 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
482 ast_instantiate(ast_function, ctx, ast_function_delete);
486 vtype->expression.vtype != TYPE_FUNCTION)
493 self->name = name ? util_strdup(name) : NULL;
494 MEM_VECTOR_INIT(self, blocks);
496 self->labelcount = 0;
499 self->ir_func = NULL;
500 self->curblock = NULL;
502 self->breakblock = NULL;
503 self->continueblock = NULL;
505 vtype->isconst = true;
506 vtype->constval.vfunc = self;
511 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
513 void ast_function_delete(ast_function *self)
517 mem_d((void*)self->name);
519 /* ast_value_delete(self->vtype); */
520 self->vtype->isconst = false;
521 self->vtype->constval.vfunc = NULL;
522 /* We use unref - if it was stored in a global table it is supposed
523 * to be deleted from *there*
525 ast_unref(self->vtype);
527 for (i = 0; i < self->blocks_count; ++i)
528 ast_delete(self->blocks[i]);
529 MEM_VECTOR_CLEAR(self, blocks);
533 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
535 unsigned int base = 10;
536 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
537 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
546 int digit = num % base;
557 const char* ast_function_label(ast_function *self, const char *prefix)
559 size_t id = (self->labelcount++);
560 size_t len = strlen(prefix);
561 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
562 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
563 return self->labelbuf;
566 /*********************************************************************/
568 * by convention you must never pass NULL to the 'ir_value **out'
569 * parameter. If you really don't care about the output, pass a dummy.
570 * But I can't imagine a pituation where the output is truly unnecessary.
573 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
575 /* NOTE: This is the codegen for a variable used in an expression.
576 * It is not the codegen to generate the value. For this purpose,
577 * ast_local_codegen and ast_global_codegen are to be used before this
578 * is executed. ast_function_codegen should take care of its locals,
579 * and the ast-user should take care of ast_global_codegen to be used
580 * on all the globals.
583 printf("ast_value used before generated (%s)\n", self->name);
590 bool ast_global_codegen(ast_value *self, ir_builder *ir)
593 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
595 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
599 self->constval.vfunc->ir_func = func;
600 self->ir_v = func->value;
601 /* The function is filled later on ast_function_codegen... */
605 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
607 printf("ir_builder_create_global failed\n");
612 switch (self->expression.vtype)
615 if (!ir_value_set_float(v, self->constval.vfloat))
619 if (!ir_value_set_vector(v, self->constval.vvec))
623 if (!ir_value_set_string(v, self->constval.vstring))
627 printf("global of type function not properly generated\n");
629 /* Cannot generate an IR value for a function,
630 * need a pointer pointing to a function rather.
633 printf("TODO: global constant type %i\n", self->expression.vtype);
638 /* link us to the ir_value */
642 error: /* clean up */
647 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
650 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
652 /* Do we allow local functions? I think not...
653 * this is NOT a function pointer atm.
658 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
662 /* A constant local... hmmm...
663 * I suppose the IR will have to deal with this
666 switch (self->expression.vtype)
669 if (!ir_value_set_float(v, self->constval.vfloat))
673 if (!ir_value_set_vector(v, self->constval.vvec))
677 if (!ir_value_set_string(v, self->constval.vstring))
681 printf("TODO: global constant type %i\n", self->expression.vtype);
686 /* link us to the ir_value */
690 error: /* clean up */
695 bool ast_function_codegen(ast_function *self, ir_builder *ir)
699 ast_expression_common *ec;
704 printf("ast_function's related ast_value was not generated yet\n");
708 /* fill the parameter list */
709 ec = &self->vtype->expression;
710 for (i = 0; i < ec->params_count; ++i)
712 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
714 if (!self->builtin) {
715 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
721 irf->builtin = self->builtin;
725 self->curblock = ir_function_create_block(irf, "entry");
729 for (i = 0; i < self->blocks_count; ++i) {
730 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
731 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
735 /* TODO: check return types */
736 if (!self->curblock->is_return)
738 if (!self->vtype->expression.next ||
739 self->vtype->expression.next->expression.vtype == TYPE_VOID)
741 return ir_block_create_return(self->curblock, NULL);
745 /* error("missing return"); */
752 /* Note, you will not see ast_block_codegen generate ir_blocks.
753 * To the AST and the IR, blocks are 2 different things.
754 * In the AST it represents a block of code, usually enclosed in
755 * curly braces {...}.
756 * While in the IR it represents a block in terms of control-flow.
758 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
763 * Note: an ast-representation using the comma-operator
764 * of the form: (a, b, c) = x should not assign to c...
768 /* output is NULL at first, we'll have each expression
769 * assign to out output, thus, a comma-operator represention
770 * using an ast_block will return the last generated value,
771 * so: (b, c) + a executed both b and c, and returns c,
772 * which is then added to a.
776 /* generate locals */
777 for (i = 0; i < self->locals_count; ++i)
779 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
783 for (i = 0; i < self->exprs_count; ++i)
785 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
786 if (!(*gen)(self->exprs[i], func, false, out))
793 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
795 ast_expression_codegen *cgen;
796 ir_value *left, *right;
798 cgen = self->dest->expression.codegen;
800 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
803 cgen = self->source->expression.codegen;
805 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
808 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
811 /* Theoretically, an assinment returns its left side as an
812 * lvalue, if we don't need an lvalue though, we return
813 * the right side as an rvalue, otherwise we have to
814 * somehow know whether or not we need to dereference the pointer
815 * on the left side - that is: OP_LOAD if it was an address.
816 * Also: in original QC we cannot OP_LOADP *anyway*.
818 *out = (lvalue ? left : right);
823 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
825 ast_expression_codegen *cgen;
826 ir_value *left, *right;
828 /* In the context of a binary operation, we can disregard
833 cgen = self->left->expression.codegen;
835 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
838 cgen = self->right->expression.codegen;
840 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
843 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
844 self->op, left, right);
851 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
853 ast_expression_codegen *cgen;
856 /* In the context of a unary operation, we can disregard
861 cgen = self->operand->expression.codegen;
863 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
866 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
874 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
876 ast_expression_codegen *cgen;
879 /* In the context of a return operation, we can disregard
884 cgen = self->operand->expression.codegen;
886 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
889 if (!ir_block_create_return(func->curblock, operand))
895 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
897 ast_expression_codegen *cgen;
898 ir_value *ent, *field;
900 /* This function needs to take the 'lvalue' flag into account!
901 * As lvalue we provide a field-pointer, as rvalue we provide the
905 cgen = self->entity->expression.codegen;
906 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
909 cgen = self->field->expression.codegen;
910 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
915 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
918 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
919 ent, field, self->expression.vtype);
924 /* Hm that should be it... */
928 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
930 ast_expression_codegen *cgen;
935 ir_block *cond = func->curblock;
940 /* We don't output any value, thus also don't care about r/lvalue */
944 /* generate the condition */
945 func->curblock = cond;
946 cgen = self->cond->expression.codegen;
947 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
953 /* create on-true block */
954 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
958 /* enter the block */
959 func->curblock = ontrue;
962 cgen = self->on_true->expression.codegen;
963 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
969 if (self->on_false) {
970 /* create on-false block */
971 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
975 /* enter the block */
976 func->curblock = onfalse;
979 cgen = self->on_false->expression.codegen;
980 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
985 /* Merge block were they all merge in to */
986 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
990 /* add jumps ot the merge block */
991 if (ontrue && !ir_block_create_jump(ontrue, merge))
993 if (onfalse && !ir_block_create_jump(onfalse, merge))
996 /* we create the if here, that way all blocks are ordered :)
998 if (!ir_block_create_if(cond, condval,
999 (ontrue ? ontrue : merge),
1000 (onfalse ? onfalse : merge)))
1005 /* Now enter the merge block */
1006 func->curblock = merge;
1011 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1013 ast_expression_codegen *cgen;
1016 ir_value *trueval, *falseval;
1019 ir_block *cond = func->curblock;
1024 /* In theory it shouldn't be possible to pass through a node twice, but
1025 * in case we add any kind of optimization pass for the AST itself, it
1026 * may still happen, thus we remember a created ir_value and simply return one
1027 * if it already exists.
1029 if (self->phi_out) {
1030 *out = self->phi_out;
1034 /* Ternary can never create an lvalue... */
1038 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1040 /* generate the condition */
1041 func->curblock = cond;
1042 cgen = self->cond->expression.codegen;
1043 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1046 /* create on-true block */
1047 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1052 /* enter the block */
1053 func->curblock = ontrue;
1056 cgen = self->on_true->expression.codegen;
1057 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1061 /* create on-false block */
1062 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1067 /* enter the block */
1068 func->curblock = onfalse;
1071 cgen = self->on_false->expression.codegen;
1072 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1076 /* create merge block */
1077 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1080 /* jump to merge block */
1081 if (!ir_block_create_jump(ontrue, merge))
1083 if (!ir_block_create_jump(onfalse, merge))
1086 /* create if instruction */
1087 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1090 /* Now enter the merge block */
1091 func->curblock = merge;
1093 /* Here, now, we need a PHI node
1094 * but first some sanity checking...
1096 if (trueval->vtype != falseval->vtype) {
1097 /* error("ternary with different types on the two sides"); */
1102 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1104 !ir_phi_add(phi, ontrue, trueval) ||
1105 !ir_phi_add(phi, onfalse, falseval))
1110 self->phi_out = ir_phi_value(phi);
1111 *out = self->phi_out;
1116 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1118 ast_expression_codegen *cgen;
1120 ir_value *dummy = NULL;
1121 ir_value *precond = NULL;
1122 ir_value *postcond = NULL;
1124 /* Since we insert some jumps "late" so we have blocks
1125 * ordered "nicely", we need to keep track of the actual end-blocks
1126 * of expressions to add the jumps to.
1128 ir_block *bbody = NULL, *end_bbody = NULL;
1129 ir_block *bprecond = NULL, *end_bprecond = NULL;
1130 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1131 ir_block *bincrement = NULL, *end_bincrement = NULL;
1132 ir_block *bout = NULL, *bin = NULL;
1134 /* let's at least move the outgoing block to the end */
1137 /* 'break' and 'continue' need to be able to find the right blocks */
1138 ir_block *bcontinue = NULL;
1139 ir_block *bbreak = NULL;
1141 ir_block *old_bcontinue = NULL;
1142 ir_block *old_bbreak = NULL;
1144 ir_block *tmpblock = NULL;
1150 * Should we ever need some kind of block ordering, better make this function
1151 * move blocks around than write a block ordering algorithm later... after all
1152 * the ast and ir should work together, not against each other.
1155 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1156 * anyway if for example it contains a ternary.
1160 cgen = self->initexpr->expression.codegen;
1161 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1165 /* Store the block from which we enter this chaos */
1166 bin = func->curblock;
1168 /* The pre-loop condition needs its own block since we
1169 * need to be able to jump to the start of that expression.
1173 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1177 /* the pre-loop-condition the least important place to 'continue' at */
1178 bcontinue = bprecond;
1181 func->curblock = bprecond;
1184 cgen = self->precond->expression.codegen;
1185 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1188 end_bprecond = func->curblock;
1190 bprecond = end_bprecond = NULL;
1193 /* Now the next blocks won't be ordered nicely, but we need to
1194 * generate them this early for 'break' and 'continue'.
1196 if (self->increment) {
1197 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1200 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1202 bincrement = end_bincrement = NULL;
1205 if (self->postcond) {
1206 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1209 bcontinue = bpostcond; /* postcond comes before the increment */
1211 bpostcond = end_bpostcond = NULL;
1214 bout_id = func->ir_func->blocks_count;
1215 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1220 /* The loop body... */
1223 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1228 func->curblock = bbody;
1230 old_bbreak = func->breakblock;
1231 old_bcontinue = func->continueblock;
1232 func->breakblock = bbreak;
1233 func->continueblock = bcontinue;
1236 cgen = self->body->expression.codegen;
1237 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1240 end_bbody = func->curblock;
1241 func->breakblock = old_bbreak;
1242 func->continueblock = old_bcontinue;
1245 /* post-loop-condition */
1249 func->curblock = bpostcond;
1252 cgen = self->postcond->expression.codegen;
1253 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1256 end_bpostcond = func->curblock;
1259 /* The incrementor */
1260 if (self->increment)
1263 func->curblock = bincrement;
1266 cgen = self->increment->expression.codegen;
1267 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1270 end_bincrement = func->curblock;
1273 /* In any case now, we continue from the outgoing block */
1274 func->curblock = bout;
1276 /* Now all blocks are in place */
1277 /* From 'bin' we jump to whatever comes first */
1278 if (bprecond) tmpblock = bprecond;
1279 else if (bbody) tmpblock = bbody;
1280 else if (bpostcond) tmpblock = bpostcond;
1281 else tmpblock = bout;
1282 if (!ir_block_create_jump(bin, tmpblock))
1288 ir_block *ontrue, *onfalse;
1289 if (bbody) ontrue = bbody;
1290 else if (bincrement) ontrue = bincrement;
1291 else if (bpostcond) ontrue = bpostcond;
1292 else ontrue = bprecond;
1294 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1301 if (bincrement) tmpblock = bincrement;
1302 else if (bpostcond) tmpblock = bpostcond;
1303 else if (bprecond) tmpblock = bprecond;
1304 else tmpblock = bout;
1305 if (!ir_block_create_jump(end_bbody, tmpblock))
1309 /* from increment */
1312 if (bpostcond) tmpblock = bpostcond;
1313 else if (bprecond) tmpblock = bprecond;
1314 else if (bbody) tmpblock = bbody;
1315 else tmpblock = bout;
1316 if (!ir_block_create_jump(end_bincrement, tmpblock))
1323 ir_block *ontrue, *onfalse;
1324 if (bprecond) ontrue = bprecond;
1325 else if (bbody) ontrue = bbody;
1326 else if (bincrement) ontrue = bincrement;
1327 else ontrue = bpostcond;
1329 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1333 /* Move 'bout' to the end */
1334 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1335 !ir_function_blocks_add(func->ir_func, bout))
1337 ir_block_delete(bout);
1344 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1346 ast_expression_codegen *cgen;
1347 ir_value_vector params;
1348 ir_instr *callinstr;
1351 ir_value *funval = NULL;
1353 /* return values are never rvalues */
1356 cgen = self->func->expression.codegen;
1357 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1362 MEM_VECTOR_INIT(¶ms, v);
1365 for (i = 0; i < self->params_count; ++i)
1368 ast_expression *expr = self->params[i];
1370 cgen = expr->expression.codegen;
1371 if (!(*cgen)(expr, func, false, ¶m))
1375 if (!ir_value_vector_v_add(¶ms, param))
1379 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1383 for (i = 0; i < params.v_count; ++i) {
1384 if (!ir_call_param(callinstr, params.v[i]))
1388 *out = ir_call_value(callinstr);
1390 MEM_VECTOR_CLEAR(¶ms, v);
1393 MEM_VECTOR_CLEAR(¶ms, v);