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);
208 void ast_binary_delete(ast_binary *self)
210 ast_unref(self->left);
211 ast_unref(self->right);
212 ast_expression_delete((ast_expression*)self);
216 ast_unary* ast_unary_new(lex_ctx ctx, int op,
217 ast_expression *expr)
219 ast_instantiate(ast_unary, ctx, ast_unary_delete);
220 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
223 self->operand = expr;
228 void ast_unary_delete(ast_unary *self)
230 ast_unref(self->operand);
231 ast_expression_delete((ast_expression*)self);
235 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
237 ast_instantiate(ast_return, ctx, ast_return_delete);
238 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
240 self->operand = expr;
245 void ast_return_delete(ast_return *self)
247 ast_unref(self->operand);
248 ast_expression_delete((ast_expression*)self);
252 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
254 const ast_expression *outtype;
256 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
258 if (field->expression.vtype != TYPE_FIELD) {
263 outtype = field->expression.next;
266 /* Error: field has no type... */
270 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
272 self->expression.vtype = outtype->expression.vtype;
273 self->expression.next = ast_type_copy(ctx, outtype->expression.next);
275 self->entity = entity;
281 void ast_entfield_delete(ast_entfield *self)
283 ast_unref(self->entity);
284 ast_unref(self->field);
285 ast_expression_delete((ast_expression*)self);
289 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
291 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
292 if (!ontrue && !onfalse) {
293 /* because it is invalid */
297 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
300 self->on_true = ontrue;
301 self->on_false = onfalse;
306 void ast_ifthen_delete(ast_ifthen *self)
308 ast_unref(self->cond);
310 ast_unref(self->on_true);
312 ast_unref(self->on_false);
313 ast_expression_delete((ast_expression*)self);
317 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
319 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
320 /* This time NEITHER must be NULL */
321 if (!ontrue || !onfalse) {
325 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
328 self->on_true = ontrue;
329 self->on_false = onfalse;
330 self->phi_out = NULL;
335 void ast_ternary_delete(ast_ternary *self)
337 ast_unref(self->cond);
338 ast_unref(self->on_true);
339 ast_unref(self->on_false);
340 ast_expression_delete((ast_expression*)self);
344 ast_loop* ast_loop_new(lex_ctx ctx,
345 ast_expression *initexpr,
346 ast_expression *precond,
347 ast_expression *postcond,
348 ast_expression *increment,
349 ast_expression *body)
351 ast_instantiate(ast_loop, ctx, ast_loop_delete);
352 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
354 self->initexpr = initexpr;
355 self->precond = precond;
356 self->postcond = postcond;
357 self->increment = increment;
363 void ast_loop_delete(ast_loop *self)
366 ast_unref(self->initexpr);
368 ast_unref(self->precond);
370 ast_unref(self->postcond);
372 ast_unref(self->increment);
374 ast_unref(self->body);
375 ast_expression_delete((ast_expression*)self);
379 ast_call* ast_call_new(lex_ctx ctx,
380 ast_expression *funcexpr)
382 ast_instantiate(ast_call, ctx, ast_call_delete);
383 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
385 MEM_VECTOR_INIT(self, params);
387 self->func = funcexpr;
391 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
393 void ast_call_delete(ast_call *self)
396 for (i = 0; i < self->params_count; ++i)
397 ast_unref(self->params[i]);
398 MEM_VECTOR_CLEAR(self, params);
401 ast_unref(self->func);
403 ast_expression_delete((ast_expression*)self);
407 ast_store* ast_store_new(lex_ctx ctx, int op,
408 ast_expression *dest, ast_expression *source)
410 ast_instantiate(ast_store, ctx, ast_store_delete);
411 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
415 self->source = source;
420 void ast_store_delete(ast_store *self)
422 ast_unref(self->dest);
423 ast_unref(self->source);
424 ast_expression_delete((ast_expression*)self);
428 ast_block* ast_block_new(lex_ctx ctx)
430 ast_instantiate(ast_block, ctx, ast_block_delete);
431 ast_expression_init((ast_expression*)self,
432 (ast_expression_codegen*)&ast_block_codegen);
434 MEM_VECTOR_INIT(self, locals);
435 MEM_VECTOR_INIT(self, exprs);
439 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
440 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
442 void ast_block_delete(ast_block *self)
445 for (i = 0; i < self->exprs_count; ++i)
446 ast_unref(self->exprs[i]);
447 MEM_VECTOR_CLEAR(self, exprs);
448 for (i = 0; i < self->locals_count; ++i)
449 ast_delete(self->locals[i]);
450 MEM_VECTOR_CLEAR(self, locals);
451 ast_expression_delete((ast_expression*)self);
455 bool ast_block_set_type(ast_block *self, ast_expression *from)
457 if (self->expression.next)
458 ast_delete(self->expression.next);
459 self->expression.vtype = from->expression.vtype;
460 if (from->expression.next) {
461 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
462 if (!self->expression.next)
468 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
470 ast_instantiate(ast_function, ctx, ast_function_delete);
474 vtype->expression.vtype != TYPE_FUNCTION)
481 self->name = name ? util_strdup(name) : NULL;
482 MEM_VECTOR_INIT(self, blocks);
484 self->labelcount = 0;
487 self->ir_func = NULL;
488 self->curblock = NULL;
490 self->breakblock = NULL;
491 self->continueblock = NULL;
493 vtype->isconst = true;
494 vtype->constval.vfunc = self;
499 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
501 void ast_function_delete(ast_function *self)
505 mem_d((void*)self->name);
507 /* ast_value_delete(self->vtype); */
508 self->vtype->isconst = false;
509 self->vtype->constval.vfunc = NULL;
510 /* We use unref - if it was stored in a global table it is supposed
511 * to be deleted from *there*
513 ast_unref(self->vtype);
515 for (i = 0; i < self->blocks_count; ++i)
516 ast_delete(self->blocks[i]);
517 MEM_VECTOR_CLEAR(self, blocks);
521 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
523 unsigned int base = 10;
524 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
525 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
534 int digit = num % base;
545 const char* ast_function_label(ast_function *self, const char *prefix)
547 size_t id = (self->labelcount++);
548 size_t len = strlen(prefix);
549 strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
550 ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
551 return self->labelbuf;
554 /*********************************************************************/
556 * by convention you must never pass NULL to the 'ir_value **out'
557 * parameter. If you really don't care about the output, pass a dummy.
558 * But I can't imagine a pituation where the output is truly unnecessary.
561 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
563 /* NOTE: This is the codegen for a variable used in an expression.
564 * It is not the codegen to generate the value. For this purpose,
565 * ast_local_codegen and ast_global_codegen are to be used before this
566 * is executed. ast_function_codegen should take care of its locals,
567 * and the ast-user should take care of ast_global_codegen to be used
568 * on all the globals.
571 printf("ast_value used before generated (%s)\n", self->name);
578 bool ast_global_codegen(ast_value *self, ir_builder *ir)
581 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
583 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
587 self->constval.vfunc->ir_func = func;
588 self->ir_v = func->value;
589 /* The function is filled later on ast_function_codegen... */
593 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
598 switch (self->expression.vtype)
601 if (!ir_value_set_float(v, self->constval.vfloat))
605 if (!ir_value_set_vector(v, self->constval.vvec))
609 if (!ir_value_set_string(v, self->constval.vstring))
613 printf("global of type function not properly generated\n");
615 /* Cannot generate an IR value for a function,
616 * need a pointer pointing to a function rather.
619 printf("TODO: global constant type %i\n", self->expression.vtype);
624 /* link us to the ir_value */
628 error: /* clean up */
633 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
636 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
638 /* Do we allow local functions? I think not...
639 * this is NOT a function pointer atm.
644 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
648 /* A constant local... hmmm...
649 * I suppose the IR will have to deal with this
652 switch (self->expression.vtype)
655 if (!ir_value_set_float(v, self->constval.vfloat))
659 if (!ir_value_set_vector(v, self->constval.vvec))
663 if (!ir_value_set_string(v, self->constval.vstring))
667 printf("TODO: global constant type %i\n", self->expression.vtype);
672 /* link us to the ir_value */
676 error: /* clean up */
681 bool ast_function_codegen(ast_function *self, ir_builder *ir)
685 ast_expression_common *ec;
690 printf("ast_function's related ast_value was not generated yet\n");
694 /* fill the parameter list */
695 ec = &self->vtype->expression;
696 for (i = 0; i < ec->params_count; ++i)
698 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
700 if (!self->builtin) {
701 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
707 irf->builtin = self->builtin;
711 self->curblock = ir_function_create_block(irf, "entry");
715 for (i = 0; i < self->blocks_count; ++i) {
716 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
717 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
721 /* TODO: check return types */
722 if (!self->curblock->is_return)
724 if (!self->vtype->expression.next ||
725 self->vtype->expression.next->expression.vtype == TYPE_VOID)
727 return ir_block_create_return(self->curblock, NULL);
731 /* error("missing return"); */
738 /* Note, you will not see ast_block_codegen generate ir_blocks.
739 * To the AST and the IR, blocks are 2 different things.
740 * In the AST it represents a block of code, usually enclosed in
741 * curly braces {...}.
742 * While in the IR it represents a block in terms of control-flow.
744 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
749 * Note: an ast-representation using the comma-operator
750 * of the form: (a, b, c) = x should not assign to c...
754 /* output is NULL at first, we'll have each expression
755 * assign to out output, thus, a comma-operator represention
756 * using an ast_block will return the last generated value,
757 * so: (b, c) + a executed both b and c, and returns c,
758 * which is then added to a.
762 /* generate locals */
763 for (i = 0; i < self->locals_count; ++i)
765 if (!ast_local_codegen(self->locals[i], func->ir_func, false))
769 for (i = 0; i < self->exprs_count; ++i)
771 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
772 if (!(*gen)(self->exprs[i], func, false, out))
779 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
781 ast_expression_codegen *cgen;
782 ir_value *left, *right;
784 cgen = self->dest->expression.codegen;
786 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
789 cgen = self->source->expression.codegen;
791 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
794 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
797 /* Theoretically, an assinment returns its left side as an
798 * lvalue, if we don't need an lvalue though, we return
799 * the right side as an rvalue, otherwise we have to
800 * somehow know whether or not we need to dereference the pointer
801 * on the left side - that is: OP_LOAD if it was an address.
802 * Also: in original QC we cannot OP_LOADP *anyway*.
804 *out = (lvalue ? left : right);
809 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
811 ast_expression_codegen *cgen;
812 ir_value *left, *right;
814 /* In the context of a binary operation, we can disregard
819 cgen = self->left->expression.codegen;
821 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
824 cgen = self->right->expression.codegen;
826 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
829 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
830 self->op, left, right);
837 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
839 ast_expression_codegen *cgen;
842 /* In the context of a unary operation, we can disregard
847 cgen = self->operand->expression.codegen;
849 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
852 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
860 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
862 ast_expression_codegen *cgen;
865 /* In the context of a return operation, we can disregard
870 cgen = self->operand->expression.codegen;
872 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
875 if (!ir_block_create_return(func->curblock, operand))
881 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
883 ast_expression_codegen *cgen;
884 ir_value *ent, *field;
886 /* This function needs to take the 'lvalue' flag into account!
887 * As lvalue we provide a field-pointer, as rvalue we provide the
891 cgen = self->entity->expression.codegen;
892 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
895 cgen = self->field->expression.codegen;
896 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
901 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
904 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
905 ent, field, self->expression.vtype);
910 /* Hm that should be it... */
914 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
916 ast_expression_codegen *cgen;
921 ir_block *cond = func->curblock;
926 /* We don't output any value, thus also don't care about r/lvalue */
930 /* generate the condition */
931 func->curblock = cond;
932 cgen = self->cond->expression.codegen;
933 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
939 /* create on-true block */
940 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
944 /* enter the block */
945 func->curblock = ontrue;
948 cgen = self->on_true->expression.codegen;
949 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
955 if (self->on_false) {
956 /* create on-false block */
957 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
961 /* enter the block */
962 func->curblock = onfalse;
965 cgen = self->on_false->expression.codegen;
966 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
971 /* Merge block were they all merge in to */
972 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
976 /* add jumps ot the merge block */
977 if (ontrue && !ir_block_create_jump(ontrue, merge))
979 if (onfalse && !ir_block_create_jump(onfalse, merge))
982 /* we create the if here, that way all blocks are ordered :)
984 if (!ir_block_create_if(cond, condval,
985 (ontrue ? ontrue : merge),
986 (onfalse ? onfalse : merge)))
991 /* Now enter the merge block */
992 func->curblock = merge;
997 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
999 ast_expression_codegen *cgen;
1002 ir_value *trueval, *falseval;
1005 ir_block *cond = func->curblock;
1010 /* In theory it shouldn't be possible to pass through a node twice, but
1011 * in case we add any kind of optimization pass for the AST itself, it
1012 * may still happen, thus we remember a created ir_value and simply return one
1013 * if it already exists.
1015 if (self->phi_out) {
1016 *out = self->phi_out;
1020 /* Ternary can never create an lvalue... */
1024 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1026 /* generate the condition */
1027 func->curblock = cond;
1028 cgen = self->cond->expression.codegen;
1029 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1032 /* create on-true block */
1033 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1038 /* enter the block */
1039 func->curblock = ontrue;
1042 cgen = self->on_true->expression.codegen;
1043 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1047 /* create on-false block */
1048 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1053 /* enter the block */
1054 func->curblock = onfalse;
1057 cgen = self->on_false->expression.codegen;
1058 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1062 /* create merge block */
1063 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1066 /* jump to merge block */
1067 if (!ir_block_create_jump(ontrue, merge))
1069 if (!ir_block_create_jump(onfalse, merge))
1072 /* create if instruction */
1073 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1076 /* Now enter the merge block */
1077 func->curblock = merge;
1079 /* Here, now, we need a PHI node
1080 * but first some sanity checking...
1082 if (trueval->vtype != falseval->vtype) {
1083 /* error("ternary with different types on the two sides"); */
1088 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1090 !ir_phi_add(phi, ontrue, trueval) ||
1091 !ir_phi_add(phi, onfalse, falseval))
1096 self->phi_out = ir_phi_value(phi);
1097 *out = self->phi_out;
1102 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1104 ast_expression_codegen *cgen;
1106 ir_value *dummy = NULL;
1107 ir_value *precond = NULL;
1108 ir_value *postcond = NULL;
1110 /* Since we insert some jumps "late" so we have blocks
1111 * ordered "nicely", we need to keep track of the actual end-blocks
1112 * of expressions to add the jumps to.
1114 ir_block *bbody = NULL, *end_bbody = NULL;
1115 ir_block *bprecond = NULL, *end_bprecond = NULL;
1116 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1117 ir_block *bincrement = NULL, *end_bincrement = NULL;
1118 ir_block *bout = NULL, *bin = NULL;
1120 /* let's at least move the outgoing block to the end */
1123 /* 'break' and 'continue' need to be able to find the right blocks */
1124 ir_block *bcontinue = NULL;
1125 ir_block *bbreak = NULL;
1127 ir_block *old_bcontinue = NULL;
1128 ir_block *old_bbreak = NULL;
1130 ir_block *tmpblock = NULL;
1136 * Should we ever need some kind of block ordering, better make this function
1137 * move blocks around than write a block ordering algorithm later... after all
1138 * the ast and ir should work together, not against each other.
1141 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1142 * anyway if for example it contains a ternary.
1146 cgen = self->initexpr->expression.codegen;
1147 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1151 /* Store the block from which we enter this chaos */
1152 bin = func->curblock;
1154 /* The pre-loop condition needs its own block since we
1155 * need to be able to jump to the start of that expression.
1159 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1163 /* the pre-loop-condition the least important place to 'continue' at */
1164 bcontinue = bprecond;
1167 func->curblock = bprecond;
1170 cgen = self->precond->expression.codegen;
1171 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1174 end_bprecond = func->curblock;
1176 bprecond = end_bprecond = NULL;
1179 /* Now the next blocks won't be ordered nicely, but we need to
1180 * generate them this early for 'break' and 'continue'.
1182 if (self->increment) {
1183 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1186 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1188 bincrement = end_bincrement = NULL;
1191 if (self->postcond) {
1192 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1195 bcontinue = bpostcond; /* postcond comes before the increment */
1197 bpostcond = end_bpostcond = NULL;
1200 bout_id = func->ir_func->blocks_count;
1201 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1206 /* The loop body... */
1209 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1214 func->curblock = bbody;
1216 old_bbreak = func->breakblock;
1217 old_bcontinue = func->continueblock;
1218 func->breakblock = bbreak;
1219 func->continueblock = bcontinue;
1222 cgen = self->body->expression.codegen;
1223 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1226 end_bbody = func->curblock;
1227 func->breakblock = old_bbreak;
1228 func->continueblock = old_bcontinue;
1231 /* post-loop-condition */
1235 func->curblock = bpostcond;
1238 cgen = self->postcond->expression.codegen;
1239 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1242 end_bpostcond = func->curblock;
1245 /* The incrementor */
1246 if (self->increment)
1249 func->curblock = bincrement;
1252 cgen = self->increment->expression.codegen;
1253 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1256 end_bincrement = func->curblock;
1259 /* In any case now, we continue from the outgoing block */
1260 func->curblock = bout;
1262 /* Now all blocks are in place */
1263 /* From 'bin' we jump to whatever comes first */
1264 if (bprecond) tmpblock = bprecond;
1265 else if (bbody) tmpblock = bbody;
1266 else if (bpostcond) tmpblock = bpostcond;
1267 else tmpblock = bout;
1268 if (!ir_block_create_jump(bin, tmpblock))
1274 ir_block *ontrue, *onfalse;
1275 if (bbody) ontrue = bbody;
1276 else if (bincrement) ontrue = bincrement;
1277 else if (bpostcond) ontrue = bpostcond;
1278 else ontrue = bprecond;
1280 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1287 if (bincrement) tmpblock = bincrement;
1288 else if (bpostcond) tmpblock = bpostcond;
1289 else if (bprecond) tmpblock = bprecond;
1290 else tmpblock = bout;
1291 if (!ir_block_create_jump(end_bbody, tmpblock))
1295 /* from increment */
1298 if (bpostcond) tmpblock = bpostcond;
1299 else if (bprecond) tmpblock = bprecond;
1300 else if (bbody) tmpblock = bbody;
1301 else tmpblock = bout;
1302 if (!ir_block_create_jump(end_bincrement, tmpblock))
1309 ir_block *ontrue, *onfalse;
1310 if (bprecond) ontrue = bprecond;
1311 else if (bbody) ontrue = bbody;
1312 else if (bincrement) ontrue = bincrement;
1313 else ontrue = bpostcond;
1315 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1319 /* Move 'bout' to the end */
1320 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1321 !ir_function_blocks_add(func->ir_func, bout))
1323 ir_block_delete(bout);
1330 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1332 ast_expression_codegen *cgen;
1333 ir_value_vector params;
1334 ir_instr *callinstr;
1337 ir_value *funval = NULL;
1339 /* return values are never rvalues */
1342 cgen = self->func->expression.codegen;
1343 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1348 MEM_VECTOR_INIT(¶ms, v);
1351 for (i = 0; i < self->params_count; ++i)
1354 ast_expression *expr = self->params[i];
1356 cgen = expr->expression.codegen;
1357 if (!(*cgen)(expr, func, false, ¶m))
1361 if (!ir_value_vector_v_add(¶ms, param))
1365 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1369 for (i = 0; i < params.v_count; ++i) {
1370 if (!ir_call_param(callinstr, params.v[i]))
1374 *out = ir_call_value(callinstr);
1376 MEM_VECTOR_CLEAR(¶ms, v);
1379 MEM_VECTOR_CLEAR(¶ms, v);