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);
204 if (op >= INSTR_EQ_F && op <= INSTR_GT)
205 self->expression.vtype = TYPE_FLOAT;
206 else if (op == INSTR_AND || op == INSTR_OR ||
207 op == INSTR_BITAND || op == INSTR_BITOR)
208 self->expression.vtype = TYPE_FLOAT;
209 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
210 self->expression.vtype = TYPE_VECTOR;
211 else if (op == INSTR_MUL_V)
212 self->expression.vtype = TYPE_FLOAT;
214 self->expression.vtype = left->expression.vtype;
219 void ast_binary_delete(ast_binary *self)
221 ast_unref(self->left);
222 ast_unref(self->right);
223 ast_expression_delete((ast_expression*)self);
227 ast_unary* ast_unary_new(lex_ctx ctx, int op,
228 ast_expression *expr)
230 ast_instantiate(ast_unary, ctx, ast_unary_delete);
231 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
234 self->operand = expr;
239 void ast_unary_delete(ast_unary *self)
241 ast_unref(self->operand);
242 ast_expression_delete((ast_expression*)self);
246 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
248 ast_instantiate(ast_return, ctx, ast_return_delete);
249 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
251 self->operand = expr;
256 void ast_return_delete(ast_return *self)
258 ast_unref(self->operand);
259 ast_expression_delete((ast_expression*)self);
263 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
265 const ast_expression *outtype;
267 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
269 if (field->expression.vtype != TYPE_FIELD) {
274 outtype = field->expression.next;
277 /* Error: field has no type... */
281 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
283 self->expression.vtype = outtype->expression.vtype;
284 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
286 self->entity = entity;
292 void ast_entfield_delete(ast_entfield *self)
294 ast_unref(self->entity);
295 ast_unref(self->field);
296 ast_expression_delete((ast_expression*)self);
300 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
302 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
303 if (!ontrue && !onfalse) {
304 /* because it is invalid */
308 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
311 self->on_true = ontrue;
312 self->on_false = onfalse;
317 void ast_ifthen_delete(ast_ifthen *self)
319 ast_unref(self->cond);
321 ast_unref(self->on_true);
323 ast_unref(self->on_false);
324 ast_expression_delete((ast_expression*)self);
328 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
330 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
331 /* This time NEITHER must be NULL */
332 if (!ontrue || !onfalse) {
336 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
339 self->on_true = ontrue;
340 self->on_false = onfalse;
341 self->phi_out = NULL;
346 void ast_ternary_delete(ast_ternary *self)
348 ast_unref(self->cond);
349 ast_unref(self->on_true);
350 ast_unref(self->on_false);
351 ast_expression_delete((ast_expression*)self);
355 ast_loop* ast_loop_new(lex_ctx ctx,
356 ast_expression *initexpr,
357 ast_expression *precond,
358 ast_expression *postcond,
359 ast_expression *increment,
360 ast_expression *body)
362 ast_instantiate(ast_loop, ctx, ast_loop_delete);
363 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
365 self->initexpr = initexpr;
366 self->precond = precond;
367 self->postcond = postcond;
368 self->increment = increment;
374 void ast_loop_delete(ast_loop *self)
377 ast_unref(self->initexpr);
379 ast_unref(self->precond);
381 ast_unref(self->postcond);
383 ast_unref(self->increment);
385 ast_unref(self->body);
386 ast_expression_delete((ast_expression*)self);
390 ast_call* ast_call_new(lex_ctx ctx,
391 ast_expression *funcexpr)
393 ast_instantiate(ast_call, ctx, ast_call_delete);
394 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
396 MEM_VECTOR_INIT(self, params);
398 self->func = funcexpr;
402 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
404 void ast_call_delete(ast_call *self)
407 for (i = 0; i < self->params_count; ++i)
408 ast_unref(self->params[i]);
409 MEM_VECTOR_CLEAR(self, params);
412 ast_unref(self->func);
414 ast_expression_delete((ast_expression*)self);
418 ast_store* ast_store_new(lex_ctx ctx, int op,
419 ast_value *dest, ast_expression *source)
421 ast_instantiate(ast_store, ctx, ast_store_delete);
422 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
426 self->source = source;
431 void ast_store_delete(ast_store *self)
433 ast_unref(self->dest);
434 ast_unref(self->source);
435 ast_expression_delete((ast_expression*)self);
439 ast_block* ast_block_new(lex_ctx ctx)
441 ast_instantiate(ast_block, ctx, ast_block_delete);
442 ast_expression_init((ast_expression*)self,
443 (ast_expression_codegen*)&ast_block_codegen);
445 MEM_VECTOR_INIT(self, locals);
446 MEM_VECTOR_INIT(self, exprs);
450 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
451 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
453 void ast_block_delete(ast_block *self)
456 for (i = 0; i < self->exprs_count; ++i)
457 ast_unref(self->exprs[i]);
458 MEM_VECTOR_CLEAR(self, exprs);
459 for (i = 0; i < self->locals_count; ++i)
460 ast_delete(self->locals[i]);
461 MEM_VECTOR_CLEAR(self, locals);
462 ast_expression_delete((ast_expression*)self);
466 bool ast_block_set_type(ast_block *self, ast_expression *from)
468 if (self->expression.next)
469 ast_delete(self->expression.next);
470 self->expression.vtype = from->expression.vtype;
471 if (from->expression.next) {
472 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
473 if (!self->expression.next)
479 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
481 ast_instantiate(ast_function, ctx, ast_function_delete);
485 vtype->expression.vtype != TYPE_FUNCTION)
492 self->name = name ? util_strdup(name) : NULL;
493 MEM_VECTOR_INIT(self, blocks);
495 self->labelcount = 0;
498 self->ir_func = NULL;
499 self->curblock = NULL;
501 self->breakblock = NULL;
502 self->continueblock = NULL;
504 vtype->isconst = true;
505 vtype->constval.vfunc = self;
510 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
512 void ast_function_delete(ast_function *self)
516 mem_d((void*)self->name);
518 /* ast_value_delete(self->vtype); */
519 self->vtype->isconst = false;
520 self->vtype->constval.vfunc = NULL;
521 /* We use unref - if it was stored in a global table it is supposed
522 * to be deleted from *there*
524 ast_unref(self->vtype);
526 for (i = 0; i < self->blocks_count; ++i)
527 ast_delete(self->blocks[i]);
528 MEM_VECTOR_CLEAR(self, blocks);
532 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
534 unsigned int base = 10;
535 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
536 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
545 int digit = num % base;
556 const char* ast_function_label(ast_function *self, const char *prefix)
558 size_t id = (self->labelcount++);
559 size_t len = strlen(prefix);
560 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
561 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
562 return self->labelbuf;
565 /*********************************************************************/
567 * by convention you must never pass NULL to the 'ir_value **out'
568 * parameter. If you really don't care about the output, pass a dummy.
569 * But I can't imagine a pituation where the output is truly unnecessary.
572 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
574 /* NOTE: This is the codegen for a variable used in an expression.
575 * It is not the codegen to generate the value. For this purpose,
576 * ast_local_codegen and ast_global_codegen are to be used before this
577 * is executed. ast_function_codegen should take care of its locals,
578 * and the ast-user should take care of ast_global_codegen to be used
579 * on all the globals.
582 printf("ast_value used before generated (%s)\n", self->name);
589 bool ast_global_codegen(ast_value *self, ir_builder *ir)
592 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
594 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
598 self->constval.vfunc->ir_func = func;
599 self->ir_v = func->value;
600 /* The function is filled later on ast_function_codegen... */
604 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
606 printf("ir_builder_create_global failed\n");
611 switch (self->expression.vtype)
614 if (!ir_value_set_float(v, self->constval.vfloat))
618 if (!ir_value_set_vector(v, self->constval.vvec))
622 if (!ir_value_set_string(v, self->constval.vstring))
626 printf("global of type function not properly generated\n");
628 /* Cannot generate an IR value for a function,
629 * need a pointer pointing to a function rather.
632 printf("TODO: global constant type %i\n", self->expression.vtype);
637 /* link us to the ir_value */
641 error: /* clean up */
646 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
649 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
651 /* Do we allow local functions? I think not...
652 * this is NOT a function pointer atm.
657 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
661 /* A constant local... hmmm...
662 * I suppose the IR will have to deal with this
665 switch (self->expression.vtype)
668 if (!ir_value_set_float(v, self->constval.vfloat))
672 if (!ir_value_set_vector(v, self->constval.vvec))
676 if (!ir_value_set_string(v, self->constval.vstring))
680 printf("TODO: global constant type %i\n", self->expression.vtype);
685 /* link us to the ir_value */
689 error: /* clean up */
694 bool ast_function_codegen(ast_function *self, ir_builder *ir)
698 ast_expression_common *ec;
703 printf("ast_function's related ast_value was not generated yet\n");
707 /* fill the parameter list */
708 ec = &self->vtype->expression;
709 for (i = 0; i < ec->params_count; ++i)
711 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
713 if (!self->builtin) {
714 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
720 irf->builtin = self->builtin;
724 self->curblock = ir_function_create_block(irf, "entry");
728 for (i = 0; i < self->blocks_count; ++i) {
729 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
730 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
734 /* TODO: check return types */
735 if (!self->curblock->is_return)
737 if (!self->vtype->expression.next ||
738 self->vtype->expression.next->expression.vtype == TYPE_VOID)
740 return ir_block_create_return(self->curblock, NULL);
744 /* error("missing return"); */
751 /* Note, you will not see ast_block_codegen generate ir_blocks.
752 * To the AST and the IR, blocks are 2 different things.
753 * In the AST it represents a block of code, usually enclosed in
754 * curly braces {...}.
755 * While in the IR it represents a block in terms of control-flow.
757 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
762 * Note: an ast-representation using the comma-operator
763 * of the form: (a, b, c) = x should not assign to c...
767 /* output is NULL at first, we'll have each expression
768 * assign to out output, thus, a comma-operator represention
769 * using an ast_block will return the last generated value,
770 * so: (b, c) + a executed both b and c, and returns c,
771 * which is then added to a.
775 /* generate locals */
776 for (i = 0; i < self->locals_count; ++i)
778 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
782 for (i = 0; i < self->exprs_count; ++i)
784 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
785 if (!(*gen)(self->exprs[i], func, false, out))
792 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
794 ast_expression_codegen *cgen;
795 ir_value *left, *right;
797 cgen = self->dest->expression.codegen;
799 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
802 cgen = self->source->expression.codegen;
804 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
807 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
810 /* Theoretically, an assinment returns its left side as an
811 * lvalue, if we don't need an lvalue though, we return
812 * the right side as an rvalue, otherwise we have to
813 * somehow know whether or not we need to dereference the pointer
814 * on the left side - that is: OP_LOAD if it was an address.
815 * Also: in original QC we cannot OP_LOADP *anyway*.
817 *out = (lvalue ? left : right);
822 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
824 ast_expression_codegen *cgen;
825 ir_value *left, *right;
827 /* In the context of a binary operation, we can disregard
832 cgen = self->left->expression.codegen;
834 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
837 cgen = self->right->expression.codegen;
839 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
842 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
843 self->op, left, right);
850 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
852 ast_expression_codegen *cgen;
855 /* In the context of a unary operation, we can disregard
860 cgen = self->operand->expression.codegen;
862 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
865 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
873 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
875 ast_expression_codegen *cgen;
878 /* In the context of a return operation, we can disregard
883 cgen = self->operand->expression.codegen;
885 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
888 if (!ir_block_create_return(func->curblock, operand))
894 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
896 ast_expression_codegen *cgen;
897 ir_value *ent, *field;
899 /* This function needs to take the 'lvalue' flag into account!
900 * As lvalue we provide a field-pointer, as rvalue we provide the
904 cgen = self->entity->expression.codegen;
905 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
908 cgen = self->field->expression.codegen;
909 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
914 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
917 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
918 ent, field, self->expression.vtype);
923 /* Hm that should be it... */
927 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
929 ast_expression_codegen *cgen;
934 ir_block *cond = func->curblock;
939 /* We don't output any value, thus also don't care about r/lvalue */
943 /* generate the condition */
944 func->curblock = cond;
945 cgen = self->cond->expression.codegen;
946 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
952 /* create on-true block */
953 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
957 /* enter the block */
958 func->curblock = ontrue;
961 cgen = self->on_true->expression.codegen;
962 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
968 if (self->on_false) {
969 /* create on-false block */
970 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
974 /* enter the block */
975 func->curblock = onfalse;
978 cgen = self->on_false->expression.codegen;
979 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
984 /* Merge block were they all merge in to */
985 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
989 /* add jumps ot the merge block */
990 if (ontrue && !ir_block_create_jump(ontrue, merge))
992 if (onfalse && !ir_block_create_jump(onfalse, merge))
995 /* we create the if here, that way all blocks are ordered :)
997 if (!ir_block_create_if(cond, condval,
998 (ontrue ? ontrue : merge),
999 (onfalse ? onfalse : merge)))
1004 /* Now enter the merge block */
1005 func->curblock = merge;
1010 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1012 ast_expression_codegen *cgen;
1015 ir_value *trueval, *falseval;
1018 ir_block *cond = func->curblock;
1023 /* In theory it shouldn't be possible to pass through a node twice, but
1024 * in case we add any kind of optimization pass for the AST itself, it
1025 * may still happen, thus we remember a created ir_value and simply return one
1026 * if it already exists.
1028 if (self->phi_out) {
1029 *out = self->phi_out;
1033 /* Ternary can never create an lvalue... */
1037 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1039 /* generate the condition */
1040 func->curblock = cond;
1041 cgen = self->cond->expression.codegen;
1042 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1045 /* create on-true block */
1046 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1051 /* enter the block */
1052 func->curblock = ontrue;
1055 cgen = self->on_true->expression.codegen;
1056 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1060 /* create on-false block */
1061 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1066 /* enter the block */
1067 func->curblock = onfalse;
1070 cgen = self->on_false->expression.codegen;
1071 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1075 /* create merge block */
1076 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1079 /* jump to merge block */
1080 if (!ir_block_create_jump(ontrue, merge))
1082 if (!ir_block_create_jump(onfalse, merge))
1085 /* create if instruction */
1086 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1089 /* Now enter the merge block */
1090 func->curblock = merge;
1092 /* Here, now, we need a PHI node
1093 * but first some sanity checking...
1095 if (trueval->vtype != falseval->vtype) {
1096 /* error("ternary with different types on the two sides"); */
1101 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1103 !ir_phi_add(phi, ontrue, trueval) ||
1104 !ir_phi_add(phi, onfalse, falseval))
1109 self->phi_out = ir_phi_value(phi);
1110 *out = self->phi_out;
1115 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1117 ast_expression_codegen *cgen;
1119 ir_value *dummy = NULL;
1120 ir_value *precond = NULL;
1121 ir_value *postcond = NULL;
1123 /* Since we insert some jumps "late" so we have blocks
1124 * ordered "nicely", we need to keep track of the actual end-blocks
1125 * of expressions to add the jumps to.
1127 ir_block *bbody = NULL, *end_bbody = NULL;
1128 ir_block *bprecond = NULL, *end_bprecond = NULL;
1129 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1130 ir_block *bincrement = NULL, *end_bincrement = NULL;
1131 ir_block *bout = NULL, *bin = NULL;
1133 /* let's at least move the outgoing block to the end */
1136 /* 'break' and 'continue' need to be able to find the right blocks */
1137 ir_block *bcontinue = NULL;
1138 ir_block *bbreak = NULL;
1140 ir_block *old_bcontinue = NULL;
1141 ir_block *old_bbreak = NULL;
1143 ir_block *tmpblock = NULL;
1149 * Should we ever need some kind of block ordering, better make this function
1150 * move blocks around than write a block ordering algorithm later... after all
1151 * the ast and ir should work together, not against each other.
1154 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1155 * anyway if for example it contains a ternary.
1159 cgen = self->initexpr->expression.codegen;
1160 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1164 /* Store the block from which we enter this chaos */
1165 bin = func->curblock;
1167 /* The pre-loop condition needs its own block since we
1168 * need to be able to jump to the start of that expression.
1172 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1176 /* the pre-loop-condition the least important place to 'continue' at */
1177 bcontinue = bprecond;
1180 func->curblock = bprecond;
1183 cgen = self->precond->expression.codegen;
1184 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1187 end_bprecond = func->curblock;
1189 bprecond = end_bprecond = NULL;
1192 /* Now the next blocks won't be ordered nicely, but we need to
1193 * generate them this early for 'break' and 'continue'.
1195 if (self->increment) {
1196 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1199 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1201 bincrement = end_bincrement = NULL;
1204 if (self->postcond) {
1205 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1208 bcontinue = bpostcond; /* postcond comes before the increment */
1210 bpostcond = end_bpostcond = NULL;
1213 bout_id = func->ir_func->blocks_count;
1214 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1219 /* The loop body... */
1222 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1227 func->curblock = bbody;
1229 old_bbreak = func->breakblock;
1230 old_bcontinue = func->continueblock;
1231 func->breakblock = bbreak;
1232 func->continueblock = bcontinue;
1235 cgen = self->body->expression.codegen;
1236 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1239 end_bbody = func->curblock;
1240 func->breakblock = old_bbreak;
1241 func->continueblock = old_bcontinue;
1244 /* post-loop-condition */
1248 func->curblock = bpostcond;
1251 cgen = self->postcond->expression.codegen;
1252 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1255 end_bpostcond = func->curblock;
1258 /* The incrementor */
1259 if (self->increment)
1262 func->curblock = bincrement;
1265 cgen = self->increment->expression.codegen;
1266 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1269 end_bincrement = func->curblock;
1272 /* In any case now, we continue from the outgoing block */
1273 func->curblock = bout;
1275 /* Now all blocks are in place */
1276 /* From 'bin' we jump to whatever comes first */
1277 if (bprecond) tmpblock = bprecond;
1278 else if (bbody) tmpblock = bbody;
1279 else if (bpostcond) tmpblock = bpostcond;
1280 else tmpblock = bout;
1281 if (!ir_block_create_jump(bin, tmpblock))
1287 ir_block *ontrue, *onfalse;
1288 if (bbody) ontrue = bbody;
1289 else if (bincrement) ontrue = bincrement;
1290 else if (bpostcond) ontrue = bpostcond;
1291 else ontrue = bprecond;
1293 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1300 if (bincrement) tmpblock = bincrement;
1301 else if (bpostcond) tmpblock = bpostcond;
1302 else if (bprecond) tmpblock = bprecond;
1303 else tmpblock = bout;
1304 if (!ir_block_create_jump(end_bbody, tmpblock))
1308 /* from increment */
1311 if (bpostcond) tmpblock = bpostcond;
1312 else if (bprecond) tmpblock = bprecond;
1313 else if (bbody) tmpblock = bbody;
1314 else tmpblock = bout;
1315 if (!ir_block_create_jump(end_bincrement, tmpblock))
1322 ir_block *ontrue, *onfalse;
1323 if (bprecond) ontrue = bprecond;
1324 else if (bbody) ontrue = bbody;
1325 else if (bincrement) ontrue = bincrement;
1326 else ontrue = bpostcond;
1328 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1332 /* Move 'bout' to the end */
1333 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1334 !ir_function_blocks_add(func->ir_func, bout))
1336 ir_block_delete(bout);
1343 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1345 ast_expression_codegen *cgen;
1346 ir_value_vector params;
1347 ir_instr *callinstr;
1350 ir_value *funval = NULL;
1352 /* return values are never rvalues */
1355 cgen = self->func->expression.codegen;
1356 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1361 MEM_VECTOR_INIT(¶ms, v);
1364 for (i = 0; i < self->params_count; ++i)
1367 ast_expression *expr = self->params[i];
1369 cgen = expr->expression.codegen;
1370 if (!(*cgen)(expr, func, false, ¶m))
1374 if (!ir_value_vector_v_add(¶ms, param))
1378 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1382 for (i = 0; i < params.v_count; ++i) {
1383 if (!ir_call_param(callinstr, params.v[i]))
1387 *out = ir_call_value(callinstr);
1389 MEM_VECTOR_CLEAR(¶ms, v);
1392 MEM_VECTOR_CLEAR(¶ms, v);