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
39 /* It must not be possible to get here. */
40 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
43 con_err("ast node missing destroy()\n");
47 /* Initialize main ast node aprts */
48 static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
50 self->node.context = ctx;
51 self->node.destroy = &_ast_node_destroy;
52 self->node.keep = false;
53 self->node.nodetype = nodetype;
54 self->node.side_effects = false;
57 /* weight and side effects */
58 static void _ast_propagate_effects(ast_node *self, ast_node *other)
60 if (ast_side_effects(other))
61 ast_side_effects(self) = true;
63 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
65 /* General expression initialization */
66 static void ast_expression_init(ast_expression *self,
67 ast_expression_codegen *codegen)
69 self->expression.codegen = codegen;
70 self->expression.vtype = TYPE_VOID;
71 self->expression.next = NULL;
72 self->expression.outl = NULL;
73 self->expression.outr = NULL;
74 self->expression.variadic = false;
75 self->expression.params = NULL;
76 self->expression.count = 0;
79 static void ast_expression_delete(ast_expression *self)
82 if (self->expression.next)
83 ast_delete(self->expression.next);
84 for (i = 0; i < vec_size(self->expression.params); ++i) {
85 ast_delete(self->expression.params[i]);
87 vec_free(self->expression.params);
90 static void ast_expression_delete_full(ast_expression *self)
92 ast_expression_delete(self);
96 ast_value* ast_value_copy(const ast_value *self)
99 const ast_expression_common *fromex;
100 ast_expression_common *selfex;
101 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
102 if (self->expression.next) {
103 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
104 if (!cp->expression.next) {
105 ast_value_delete(cp);
109 fromex = &self->expression;
110 selfex = &cp->expression;
111 selfex->variadic = fromex->variadic;
112 selfex->count = fromex->count;
113 for (i = 0; i < vec_size(fromex->params); ++i) {
114 ast_value *v = ast_value_copy(fromex->params[i]);
116 ast_value_delete(cp);
119 vec_push(selfex->params, v);
124 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
127 const ast_expression_common *fromex;
128 ast_expression_common *selfex;
129 self->expression.vtype = other->expression.vtype;
130 if (other->expression.next) {
131 self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
132 if (!self->expression.next)
135 fromex = &other->expression;
136 selfex = &self->expression;
137 selfex->variadic = fromex->variadic;
138 selfex->count = fromex->count;
139 for (i = 0; i < vec_size(fromex->params); ++i) {
140 ast_value *v = ast_value_copy(fromex->params[i]);
143 vec_push(selfex->params, v);
148 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
150 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
151 ast_expression_init(self, NULL);
152 self->expression.codegen = NULL;
153 self->expression.next = NULL;
154 self->expression.vtype = vtype;
158 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
161 const ast_expression_common *fromex;
162 ast_expression_common *selfex;
168 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
169 ast_expression_init(self, NULL);
171 fromex = &ex->expression;
172 selfex = &self->expression;
174 /* This may never be codegen()d */
175 selfex->codegen = NULL;
177 selfex->vtype = fromex->vtype;
180 selfex->next = ast_type_copy(ctx, fromex->next);
182 ast_expression_delete_full(self);
189 selfex->variadic = fromex->variadic;
190 selfex->count = fromex->count;
191 for (i = 0; i < vec_size(fromex->params); ++i) {
192 ast_value *v = ast_value_copy(fromex->params[i]);
194 ast_expression_delete_full(self);
197 vec_push(selfex->params, v);
204 bool ast_compare_type(ast_expression *a, ast_expression *b)
206 if (a->expression.vtype != b->expression.vtype)
208 if (!a->expression.next != !b->expression.next)
210 if (vec_size(a->expression.params) != vec_size(b->expression.params))
212 if (a->expression.variadic != b->expression.variadic)
214 if (vec_size(a->expression.params)) {
216 for (i = 0; i < vec_size(a->expression.params); ++i) {
217 if (!ast_compare_type((ast_expression*)a->expression.params[i],
218 (ast_expression*)b->expression.params[i]))
222 if (a->expression.next)
223 return ast_compare_type(a->expression.next, b->expression.next);
227 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
234 if (pos + 6 >= bufsize)
236 strcpy(buf + pos, "(null)");
240 if (pos + 1 >= bufsize)
243 switch (e->expression.vtype) {
245 strcpy(buf + pos, "(variant)");
250 return ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
253 if (pos + 3 >= bufsize)
257 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
258 if (pos + 1 >= bufsize)
264 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
265 if (pos + 2 >= bufsize)
267 if (!vec_size(e->expression.params)) {
273 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[0]), buf, bufsize, pos);
274 for (i = 1; i < vec_size(e->expression.params); ++i) {
275 if (pos + 2 >= bufsize)
279 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[i]), buf, bufsize, pos);
281 if (pos + 1 >= bufsize)
287 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
288 if (pos + 1 >= bufsize)
291 pos += snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->expression.count);
292 if (pos + 1 >= bufsize)
298 typestr = type_name[e->expression.vtype];
299 typelen = strlen(typestr);
300 if (pos + typelen >= bufsize)
302 strcpy(buf + pos, typestr);
303 return pos + typelen;
307 buf[bufsize-3] = '.';
308 buf[bufsize-2] = '.';
309 buf[bufsize-1] = '.';
313 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
315 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
319 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
321 ast_instantiate(ast_value, ctx, ast_value_delete);
322 ast_expression_init((ast_expression*)self,
323 (ast_expression_codegen*)&ast_value_codegen);
324 self->expression.node.keep = true; /* keep */
326 self->name = name ? util_strdup(name) : NULL;
327 self->expression.vtype = t;
328 self->expression.next = NULL;
329 self->isfield = false;
331 self->hasvalue = false;
333 memset(&self->constval, 0, sizeof(self->constval));
336 self->ir_values = NULL;
337 self->ir_value_count = 0;
345 void ast_value_delete(ast_value* self)
348 mem_d((void*)self->name);
349 if (self->hasvalue) {
350 switch (self->expression.vtype)
353 mem_d((void*)self->constval.vstring);
356 /* unlink us from the function node */
357 self->constval.vfunc->vtype = NULL;
359 /* NOTE: delete function? currently collected in
360 * the parser structure
367 mem_d(self->ir_values);
368 ast_expression_delete((ast_expression*)self);
372 void ast_value_params_add(ast_value *self, ast_value *p)
374 vec_push(self->expression.params, p);
377 bool ast_value_set_name(ast_value *self, const char *name)
380 mem_d((void*)self->name);
381 self->name = util_strdup(name);
385 ast_binary* ast_binary_new(lex_ctx ctx, int op,
386 ast_expression* left, ast_expression* right)
388 ast_instantiate(ast_binary, ctx, ast_binary_delete);
389 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
395 ast_propagate_effects(self, left);
396 ast_propagate_effects(self, right);
398 if (op >= INSTR_EQ_F && op <= INSTR_GT)
399 self->expression.vtype = TYPE_FLOAT;
400 else if (op == INSTR_AND || op == INSTR_OR ||
401 op == INSTR_BITAND || op == INSTR_BITOR)
402 self->expression.vtype = TYPE_FLOAT;
403 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
404 self->expression.vtype = TYPE_VECTOR;
405 else if (op == INSTR_MUL_V)
406 self->expression.vtype = TYPE_FLOAT;
408 self->expression.vtype = left->expression.vtype;
413 void ast_binary_delete(ast_binary *self)
415 ast_unref(self->left);
416 ast_unref(self->right);
417 ast_expression_delete((ast_expression*)self);
421 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
422 ast_expression* left, ast_expression* right)
424 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
425 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
427 ast_side_effects(self) = true;
429 self->opstore = storop;
432 self->source = right;
434 self->keep_dest = false;
436 if (!ast_type_adopt(self, left)) {
444 void ast_binstore_delete(ast_binstore *self)
446 if (!self->keep_dest)
447 ast_unref(self->dest);
448 ast_unref(self->source);
449 ast_expression_delete((ast_expression*)self);
453 ast_unary* ast_unary_new(lex_ctx ctx, int op,
454 ast_expression *expr)
456 ast_instantiate(ast_unary, ctx, ast_unary_delete);
457 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
460 self->operand = expr;
462 ast_propagate_effects(self, expr);
464 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
465 self->expression.vtype = TYPE_FLOAT;
467 compile_error(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
472 void ast_unary_delete(ast_unary *self)
474 ast_unref(self->operand);
475 ast_expression_delete((ast_expression*)self);
479 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
481 ast_instantiate(ast_return, ctx, ast_return_delete);
482 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
484 self->operand = expr;
487 ast_propagate_effects(self, expr);
492 void ast_return_delete(ast_return *self)
495 ast_unref(self->operand);
496 ast_expression_delete((ast_expression*)self);
500 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
502 if (field->expression.vtype != TYPE_FIELD) {
503 compile_error(ctx, "ast_entfield_new with expression not of type field");
506 return ast_entfield_new_force(ctx, entity, field, field->expression.next);
509 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
511 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
515 /* Error: field has no type... */
519 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
521 self->entity = entity;
523 ast_propagate_effects(self, entity);
524 ast_propagate_effects(self, field);
526 if (!ast_type_adopt(self, outtype)) {
527 ast_entfield_delete(self);
534 void ast_entfield_delete(ast_entfield *self)
536 ast_unref(self->entity);
537 ast_unref(self->field);
538 ast_expression_delete((ast_expression*)self);
542 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field, const char *name)
544 ast_instantiate(ast_member, ctx, ast_member_delete);
550 if (owner->expression.vtype != TYPE_VECTOR &&
551 owner->expression.vtype != TYPE_FIELD) {
552 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
557 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
558 self->expression.node.keep = true; /* keep */
560 if (owner->expression.vtype == TYPE_VECTOR) {
561 self->expression.vtype = TYPE_FLOAT;
562 self->expression.next = NULL;
564 self->expression.vtype = TYPE_FIELD;
565 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
569 ast_propagate_effects(self, owner);
573 self->name = util_strdup(name);
580 void ast_member_delete(ast_member *self)
582 /* The owner is always an ast_value, which has .keep=true,
583 * also: ast_members are usually deleted after the owner, thus
584 * this will cause invalid access
585 ast_unref(self->owner);
586 * once we allow (expression).x to access a vector-member, we need
587 * to change this: preferably by creating an alternate ast node for this
588 * purpose that is not garbage-collected.
590 ast_expression_delete((ast_expression*)self);
594 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
596 ast_expression *outtype;
597 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
599 outtype = array->expression.next;
602 /* Error: field has no type... */
606 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
610 ast_propagate_effects(self, array);
611 ast_propagate_effects(self, index);
613 if (!ast_type_adopt(self, outtype)) {
614 ast_array_index_delete(self);
617 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
618 if (self->expression.vtype != TYPE_ARRAY) {
619 compile_error(ast_ctx(self), "array_index node on type");
620 ast_array_index_delete(self);
623 self->array = outtype;
624 self->expression.vtype = TYPE_FIELD;
630 void ast_array_index_delete(ast_array_index *self)
632 ast_unref(self->array);
633 ast_unref(self->index);
634 ast_expression_delete((ast_expression*)self);
638 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
640 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
641 if (!ontrue && !onfalse) {
642 /* because it is invalid */
646 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
649 self->on_true = ontrue;
650 self->on_false = onfalse;
651 ast_propagate_effects(self, cond);
653 ast_propagate_effects(self, ontrue);
655 ast_propagate_effects(self, onfalse);
660 void ast_ifthen_delete(ast_ifthen *self)
662 ast_unref(self->cond);
664 ast_unref(self->on_true);
666 ast_unref(self->on_false);
667 ast_expression_delete((ast_expression*)self);
671 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
673 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
674 /* This time NEITHER must be NULL */
675 if (!ontrue || !onfalse) {
679 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
682 self->on_true = ontrue;
683 self->on_false = onfalse;
684 ast_propagate_effects(self, cond);
685 ast_propagate_effects(self, ontrue);
686 ast_propagate_effects(self, onfalse);
688 if (!ast_type_adopt(self, ontrue)) {
689 ast_ternary_delete(self);
696 void ast_ternary_delete(ast_ternary *self)
698 ast_unref(self->cond);
699 ast_unref(self->on_true);
700 ast_unref(self->on_false);
701 ast_expression_delete((ast_expression*)self);
705 ast_loop* ast_loop_new(lex_ctx ctx,
706 ast_expression *initexpr,
707 ast_expression *precond,
708 ast_expression *postcond,
709 ast_expression *increment,
710 ast_expression *body)
712 ast_instantiate(ast_loop, ctx, ast_loop_delete);
713 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
715 self->initexpr = initexpr;
716 self->precond = precond;
717 self->postcond = postcond;
718 self->increment = increment;
722 ast_propagate_effects(self, initexpr);
724 ast_propagate_effects(self, precond);
726 ast_propagate_effects(self, postcond);
728 ast_propagate_effects(self, increment);
730 ast_propagate_effects(self, body);
735 void ast_loop_delete(ast_loop *self)
738 ast_unref(self->initexpr);
740 ast_unref(self->precond);
742 ast_unref(self->postcond);
744 ast_unref(self->increment);
746 ast_unref(self->body);
747 ast_expression_delete((ast_expression*)self);
751 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont)
753 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
754 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
756 self->is_continue = iscont;
761 void ast_breakcont_delete(ast_breakcont *self)
763 ast_expression_delete((ast_expression*)self);
767 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
769 ast_instantiate(ast_switch, ctx, ast_switch_delete);
770 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
775 ast_propagate_effects(self, op);
780 void ast_switch_delete(ast_switch *self)
783 ast_unref(self->operand);
785 for (i = 0; i < vec_size(self->cases); ++i) {
786 if (self->cases[i].value)
787 ast_unref(self->cases[i].value);
788 ast_unref(self->cases[i].code);
790 vec_free(self->cases);
792 ast_expression_delete((ast_expression*)self);
796 ast_label* ast_label_new(lex_ctx ctx, const char *name)
798 ast_instantiate(ast_label, ctx, ast_label_delete);
799 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
801 self->name = util_strdup(name);
802 self->irblock = NULL;
808 void ast_label_delete(ast_label *self)
810 mem_d((void*)self->name);
811 vec_free(self->gotos);
812 ast_expression_delete((ast_expression*)self);
816 void ast_label_register_goto(ast_label *self, ast_goto *g)
818 vec_push(self->gotos, g);
821 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
823 ast_instantiate(ast_goto, ctx, ast_goto_delete);
824 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
826 self->name = util_strdup(name);
828 self->irblock_from = NULL;
833 void ast_goto_delete(ast_goto *self)
835 mem_d((void*)self->name);
836 ast_expression_delete((ast_expression*)self);
840 void ast_goto_set_label(ast_goto *self, ast_label *label)
842 self->target = label;
845 ast_call* ast_call_new(lex_ctx ctx,
846 ast_expression *funcexpr)
848 ast_instantiate(ast_call, ctx, ast_call_delete);
849 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
851 ast_side_effects(self) = true;
854 self->func = funcexpr;
856 ast_type_adopt(self, funcexpr->expression.next);
861 void ast_call_delete(ast_call *self)
864 for (i = 0; i < vec_size(self->params); ++i)
865 ast_unref(self->params[i]);
866 vec_free(self->params);
869 ast_unref(self->func);
871 ast_expression_delete((ast_expression*)self);
875 bool ast_call_check_types(ast_call *self)
879 const ast_expression *func = self->func;
880 size_t count = vec_size(self->params);
881 if (count > vec_size(func->expression.params))
882 count = vec_size(func->expression.params);
884 for (i = 0; i < count; ++i) {
885 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
888 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
889 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
890 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
891 (unsigned int)(i+1), texp, tgot);
892 /* we don't immediately return */
899 ast_store* ast_store_new(lex_ctx ctx, int op,
900 ast_expression *dest, ast_expression *source)
902 ast_instantiate(ast_store, ctx, ast_store_delete);
903 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
905 ast_side_effects(self) = true;
909 self->source = source;
911 if (!ast_type_adopt(self, dest)) {
919 void ast_store_delete(ast_store *self)
921 ast_unref(self->dest);
922 ast_unref(self->source);
923 ast_expression_delete((ast_expression*)self);
927 ast_block* ast_block_new(lex_ctx ctx)
929 ast_instantiate(ast_block, ctx, ast_block_delete);
930 ast_expression_init((ast_expression*)self,
931 (ast_expression_codegen*)&ast_block_codegen);
935 self->collect = NULL;
940 bool ast_block_add_expr(ast_block *self, ast_expression *e)
942 ast_propagate_effects(self, e);
943 vec_push(self->exprs, e);
944 if (self->expression.next) {
945 ast_delete(self->expression.next);
946 self->expression.next = NULL;
948 if (!ast_type_adopt(self, e)) {
949 compile_error(ast_ctx(self), "internal error: failed to adopt type");
955 void ast_block_collect(ast_block *self, ast_expression *expr)
957 vec_push(self->collect, expr);
958 expr->expression.node.keep = true;
961 void ast_block_delete(ast_block *self)
964 for (i = 0; i < vec_size(self->exprs); ++i)
965 ast_unref(self->exprs[i]);
966 vec_free(self->exprs);
967 for (i = 0; i < vec_size(self->locals); ++i)
968 ast_delete(self->locals[i]);
969 vec_free(self->locals);
970 for (i = 0; i < vec_size(self->collect); ++i)
971 ast_delete(self->collect[i]);
972 vec_free(self->collect);
973 ast_expression_delete((ast_expression*)self);
977 bool ast_block_set_type(ast_block *self, ast_expression *from)
979 if (self->expression.next)
980 ast_delete(self->expression.next);
981 if (!ast_type_adopt(self, from))
986 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
988 ast_instantiate(ast_function, ctx, ast_function_delete);
992 vtype->expression.vtype != TYPE_FUNCTION)
994 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
996 (int)vtype->hasvalue,
997 vtype->expression.vtype);
1002 self->vtype = vtype;
1003 self->name = name ? util_strdup(name) : NULL;
1004 self->blocks = NULL;
1006 self->labelcount = 0;
1009 self->ir_func = NULL;
1010 self->curblock = NULL;
1012 self->breakblock = NULL;
1013 self->continueblock = NULL;
1015 vtype->hasvalue = true;
1016 vtype->constval.vfunc = self;
1021 void ast_function_delete(ast_function *self)
1025 mem_d((void*)self->name);
1027 /* ast_value_delete(self->vtype); */
1028 self->vtype->hasvalue = false;
1029 self->vtype->constval.vfunc = NULL;
1030 /* We use unref - if it was stored in a global table it is supposed
1031 * to be deleted from *there*
1033 ast_unref(self->vtype);
1035 for (i = 0; i < vec_size(self->blocks); ++i)
1036 ast_delete(self->blocks[i]);
1037 vec_free(self->blocks);
1041 const char* ast_function_label(ast_function *self, const char *prefix)
1047 if (!opts.dump && !opts.dumpfin)
1050 id = (self->labelcount++);
1051 len = strlen(prefix);
1053 from = self->labelbuf + sizeof(self->labelbuf)-1;
1056 unsigned int digit = id % 10;
1057 *from = digit + '0';
1060 memcpy(from - len, prefix, len);
1064 /*********************************************************************/
1066 * by convention you must never pass NULL to the 'ir_value **out'
1067 * parameter. If you really don't care about the output, pass a dummy.
1068 * But I can't imagine a pituation where the output is truly unnecessary.
1071 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1073 if (out->vtype == TYPE_FIELD)
1074 out->fieldtype = self->next->expression.vtype;
1075 if (out->vtype == TYPE_FUNCTION)
1076 out->outtype = self->next->expression.vtype;
1079 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1080 #define codegen_output_type_expr(a,o) (_ast_codegen_output_type(a,(o)))
1082 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1086 /* NOTE: This is the codegen for a variable used in an expression.
1087 * It is not the codegen to generate the value. For this purpose,
1088 * ast_local_codegen and ast_global_codegen are to be used before this
1089 * is executed. ast_function_codegen should take care of its locals,
1090 * and the ast-user should take care of ast_global_codegen to be used
1091 * on all the globals.
1094 char typename[1024];
1095 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
1096 compile_error(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
1103 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1107 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1109 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1112 func->context = ast_ctx(self);
1113 func->value->context = ast_ctx(self);
1115 self->constval.vfunc->ir_func = func;
1116 self->ir_v = func->value;
1117 /* The function is filled later on ast_function_codegen... */
1121 if (isfield && self->expression.vtype == TYPE_FIELD) {
1122 ast_expression *fieldtype = self->expression.next;
1124 if (self->hasvalue) {
1125 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1129 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1134 ast_expression_common *elemtype;
1136 ast_value *array = (ast_value*)fieldtype;
1138 if (!ast_istype(fieldtype, ast_value)) {
1139 compile_error(ast_ctx(self), "internal error: ast_value required");
1143 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1144 if (!array->expression.count || array->expression.count > opts.max_array_size)
1145 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1147 elemtype = &array->expression.next->expression;
1148 vtype = elemtype->vtype;
1150 v = ir_builder_create_field(ir, self->name, vtype);
1152 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1155 v->context = ast_ctx(self);
1156 v->unique_life = true;
1157 array->ir_v = self->ir_v = v;
1159 namelen = strlen(self->name);
1160 name = (char*)mem_a(namelen + 16);
1161 strcpy(name, self->name);
1163 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1164 array->ir_values[0] = v;
1165 for (ai = 1; ai < array->expression.count; ++ai) {
1166 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1167 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1168 if (!array->ir_values[ai]) {
1170 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1173 array->ir_values[ai]->context = ast_ctx(self);
1174 array->ir_values[ai]->unique_life = true;
1180 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1183 v->context = ast_ctx(self);
1189 if (self->expression.vtype == TYPE_ARRAY) {
1194 ast_expression_common *elemtype = &self->expression.next->expression;
1195 int vtype = elemtype->vtype;
1197 /* same as with field arrays */
1198 if (!self->expression.count || self->expression.count > opts.max_array_size)
1199 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1201 v = ir_builder_create_global(ir, self->name, vtype);
1203 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1206 v->context = ast_ctx(self);
1207 v->unique_life = true;
1209 namelen = strlen(self->name);
1210 name = (char*)mem_a(namelen + 16);
1211 strcpy(name, self->name);
1213 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1214 self->ir_values[0] = v;
1215 for (ai = 1; ai < self->expression.count; ++ai) {
1216 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1217 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1218 if (!self->ir_values[ai]) {
1220 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1223 self->ir_values[ai]->context = ast_ctx(self);
1224 self->ir_values[ai]->unique_life = true;
1230 /* Arrays don't do this since there's no "array" value which spans across the
1233 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1235 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1238 codegen_output_type(self, v);
1239 v->context = ast_ctx(self);
1242 if (self->hasvalue) {
1243 switch (self->expression.vtype)
1246 if (!ir_value_set_float(v, self->constval.vfloat))
1250 if (!ir_value_set_vector(v, self->constval.vvec))
1254 if (!ir_value_set_string(v, self->constval.vstring))
1258 compile_error(ast_ctx(self), "TODO: global constant array");
1261 compile_error(ast_ctx(self), "global of type function not properly generated");
1263 /* Cannot generate an IR value for a function,
1264 * need a pointer pointing to a function rather.
1267 if (!self->constval.vfield) {
1268 compile_error(ast_ctx(self), "field constant without vfield set");
1271 if (!self->constval.vfield->ir_v) {
1272 compile_error(ast_ctx(self), "field constant generated before its field");
1275 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1279 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1284 /* link us to the ir_value */
1289 error: /* clean up */
1294 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1297 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1299 /* Do we allow local functions? I think not...
1300 * this is NOT a function pointer atm.
1305 if (self->expression.vtype == TYPE_ARRAY) {
1310 ast_expression_common *elemtype = &self->expression.next->expression;
1311 int vtype = elemtype->vtype;
1314 compile_error(ast_ctx(self), "array-parameters are not supported");
1318 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1319 if (!self->expression.count || self->expression.count > opts.max_array_size) {
1320 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1323 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1324 if (!self->ir_values) {
1325 compile_error(ast_ctx(self), "failed to allocate array values");
1329 v = ir_function_create_local(func, self->name, vtype, param);
1331 compile_error(ast_ctx(self), "ir_function_create_local failed");
1334 v->context = ast_ctx(self);
1335 v->unique_life = true;
1337 namelen = strlen(self->name);
1338 name = (char*)mem_a(namelen + 16);
1339 strcpy(name, self->name);
1341 self->ir_values[0] = v;
1342 for (ai = 1; ai < self->expression.count; ++ai) {
1343 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1344 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1345 if (!self->ir_values[ai]) {
1346 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1349 self->ir_values[ai]->context = ast_ctx(self);
1350 self->ir_values[ai]->unique_life = true;
1355 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1358 codegen_output_type(self, v);
1359 v->context = ast_ctx(self);
1362 /* A constant local... hmmm...
1363 * I suppose the IR will have to deal with this
1365 if (self->hasvalue) {
1366 switch (self->expression.vtype)
1369 if (!ir_value_set_float(v, self->constval.vfloat))
1373 if (!ir_value_set_vector(v, self->constval.vvec))
1377 if (!ir_value_set_string(v, self->constval.vstring))
1381 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1386 /* link us to the ir_value */
1390 if (!ast_generate_accessors(self, func->owner))
1394 error: /* clean up */
1399 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1402 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1403 if (!self->setter || !self->getter)
1405 for (i = 0; i < self->expression.count; ++i) {
1406 if (!self->ir_values) {
1407 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1410 if (!self->ir_values[i]) {
1411 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1414 if (self->ir_values[i]->life) {
1415 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1420 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1422 if (!ast_global_codegen (self->setter, ir, false) ||
1423 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1424 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1426 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1427 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1432 if (!ast_global_codegen (self->getter, ir, false) ||
1433 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1434 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1436 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1437 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1441 for (i = 0; i < self->expression.count; ++i) {
1442 vec_free(self->ir_values[i]->life);
1444 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1448 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1452 ast_expression_common *ec;
1457 irf = self->ir_func;
1459 compile_error(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1463 /* fill the parameter list */
1464 ec = &self->vtype->expression;
1465 for (i = 0; i < vec_size(ec->params); ++i)
1467 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1468 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1470 vec_push(irf->params, ec->params[i]->expression.vtype);
1471 if (!self->builtin) {
1472 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1477 if (self->builtin) {
1478 irf->builtin = self->builtin;
1482 if (!vec_size(self->blocks)) {
1483 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1487 self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1488 if (!self->curblock) {
1489 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1493 for (i = 0; i < vec_size(self->blocks); ++i) {
1494 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1495 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1499 /* TODO: check return types */
1500 if (!self->curblock->is_return)
1502 if (!self->vtype->expression.next ||
1503 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1505 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1507 else if (vec_size(self->curblock->entries))
1509 /* error("missing return"); */
1510 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1511 "control reaches end of non-void function (`%s`) via %s",
1512 self->name, self->curblock->label))
1516 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1522 /* Note, you will not see ast_block_codegen generate ir_blocks.
1523 * To the AST and the IR, blocks are 2 different things.
1524 * In the AST it represents a block of code, usually enclosed in
1525 * curly braces {...}.
1526 * While in the IR it represents a block in terms of control-flow.
1528 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1532 /* We don't use this
1533 * Note: an ast-representation using the comma-operator
1534 * of the form: (a, b, c) = x should not assign to c...
1537 compile_error(ast_ctx(self), "not an l-value (code-block)");
1541 if (self->expression.outr) {
1542 *out = self->expression.outr;
1546 /* output is NULL at first, we'll have each expression
1547 * assign to out output, thus, a comma-operator represention
1548 * using an ast_block will return the last generated value,
1549 * so: (b, c) + a executed both b and c, and returns c,
1550 * which is then added to a.
1554 /* generate locals */
1555 for (i = 0; i < vec_size(self->locals); ++i)
1557 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1559 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1564 for (i = 0; i < vec_size(self->exprs); ++i)
1566 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1567 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1568 compile_error(ast_ctx(self->exprs[i]), "unreachable statement");
1571 if (!(*gen)(self->exprs[i], func, false, out))
1575 self->expression.outr = *out;
1580 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1582 ast_expression_codegen *cgen;
1583 ir_value *left = NULL;
1584 ir_value *right = NULL;
1588 ast_array_index *ai = NULL;
1590 if (lvalue && self->expression.outl) {
1591 *out = self->expression.outl;
1595 if (!lvalue && self->expression.outr) {
1596 *out = self->expression.outr;
1600 if (ast_istype(self->dest, ast_array_index))
1603 ai = (ast_array_index*)self->dest;
1604 idx = (ast_value*)ai->index;
1606 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1611 /* we need to call the setter */
1612 ir_value *iridx, *funval;
1616 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1620 arr = (ast_value*)ai->array;
1621 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1622 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1626 cgen = idx->expression.codegen;
1627 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1630 cgen = arr->setter->expression.codegen;
1631 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1634 cgen = self->source->expression.codegen;
1635 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1638 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval);
1641 ir_call_param(call, iridx);
1642 ir_call_param(call, right);
1643 self->expression.outr = right;
1649 cgen = self->dest->expression.codegen;
1651 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1653 self->expression.outl = left;
1655 cgen = self->source->expression.codegen;
1657 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1660 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1662 self->expression.outr = right;
1665 /* Theoretically, an assinment returns its left side as an
1666 * lvalue, if we don't need an lvalue though, we return
1667 * the right side as an rvalue, otherwise we have to
1668 * somehow know whether or not we need to dereference the pointer
1669 * on the left side - that is: OP_LOAD if it was an address.
1670 * Also: in original QC we cannot OP_LOADP *anyway*.
1672 *out = (lvalue ? left : right);
1677 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1679 ast_expression_codegen *cgen;
1680 ir_value *left, *right;
1682 /* A binary operation cannot yield an l-value */
1684 compile_error(ast_ctx(self), "not an l-value (binop)");
1688 if (self->expression.outr) {
1689 *out = self->expression.outr;
1693 if (OPTS_FLAG(SHORT_LOGIC) &&
1694 (self->op == INSTR_AND || self->op == INSTR_OR))
1696 /* short circuit evaluation */
1697 ir_block *other, *merge;
1698 ir_block *from_left, *from_right;
1703 /* Note about casting to true boolean values:
1704 * We use a single NOT for sub expressions, and an
1705 * overall NOT at the end, and for that purpose swap
1706 * all the jump conditions in order for the NOT to get
1708 * ie: (a && b) usually becomes (!!a ? !!b : !!a)
1709 * but we translate this to (!(!a ? !a : !b))
1712 merge_id = vec_size(func->ir_func->blocks);
1713 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1715 cgen = self->left->expression.codegen;
1716 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1718 if (!OPTS_FLAG(PERL_LOGIC)) {
1719 notop = type_not_instr[left->vtype];
1720 if (notop == AINSTR_END) {
1721 compile_error(ast_ctx(self), "don't know how to cast to bool...");
1724 left = ir_block_create_unary(func->curblock, ast_ctx(self),
1725 ast_function_label(func, "sce_not"),
1729 from_left = func->curblock;
1731 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1732 if ( !(self->op == INSTR_OR) != !OPTS_FLAG(PERL_LOGIC) ) {
1733 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1736 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1739 /* use the likely flag */
1740 vec_last(func->curblock->instr)->likely = true;
1742 func->curblock = other;
1743 cgen = self->right->expression.codegen;
1744 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1746 if (!OPTS_FLAG(PERL_LOGIC)) {
1747 notop = type_not_instr[right->vtype];
1748 if (notop == AINSTR_END) {
1749 compile_error(ast_ctx(self), "don't know how to cast to bool...");
1752 right = ir_block_create_unary(func->curblock, ast_ctx(self),
1753 ast_function_label(func, "sce_not"),
1757 from_right = func->curblock;
1759 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1762 vec_remove(func->ir_func->blocks, merge_id, 1);
1763 vec_push(func->ir_func->blocks, merge);
1765 func->curblock = merge;
1766 phi = ir_block_create_phi(func->curblock, ast_ctx(self), ast_function_label(func, "sce_value"), TYPE_FLOAT);
1767 ir_phi_add(phi, from_left, left);
1768 ir_phi_add(phi, from_right, right);
1769 *out = ir_phi_value(phi);
1770 if (!OPTS_FLAG(PERL_LOGIC)) {
1771 notop = type_not_instr[(*out)->vtype];
1772 if (notop == AINSTR_END) {
1773 compile_error(ast_ctx(self), "don't know how to cast to bool...");
1776 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1777 ast_function_label(func, "sce_final_not"),
1783 self->expression.outr = *out;
1787 cgen = self->left->expression.codegen;
1788 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1791 cgen = self->right->expression.codegen;
1792 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1795 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1796 self->op, left, right);
1799 self->expression.outr = *out;
1804 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1806 ast_expression_codegen *cgen;
1807 ir_value *leftl = NULL, *leftr, *right, *bin;
1811 ast_array_index *ai = NULL;
1812 ir_value *iridx = NULL;
1814 if (lvalue && self->expression.outl) {
1815 *out = self->expression.outl;
1819 if (!lvalue && self->expression.outr) {
1820 *out = self->expression.outr;
1824 if (ast_istype(self->dest, ast_array_index))
1827 ai = (ast_array_index*)self->dest;
1828 idx = (ast_value*)ai->index;
1830 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1834 /* for a binstore we need both an lvalue and an rvalue for the left side */
1835 /* rvalue of destination! */
1837 cgen = idx->expression.codegen;
1838 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1841 cgen = self->dest->expression.codegen;
1842 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1845 /* source as rvalue only */
1846 cgen = self->source->expression.codegen;
1847 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1850 /* now the binary */
1851 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1852 self->opbin, leftr, right);
1853 self->expression.outr = bin;
1857 /* we need to call the setter */
1862 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1866 arr = (ast_value*)ai->array;
1867 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1868 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1872 cgen = arr->setter->expression.codegen;
1873 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1876 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval);
1879 ir_call_param(call, iridx);
1880 ir_call_param(call, bin);
1881 self->expression.outr = bin;
1883 /* now store them */
1884 cgen = self->dest->expression.codegen;
1885 /* lvalue of destination */
1886 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1888 self->expression.outl = leftl;
1890 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
1892 self->expression.outr = bin;
1895 /* Theoretically, an assinment returns its left side as an
1896 * lvalue, if we don't need an lvalue though, we return
1897 * the right side as an rvalue, otherwise we have to
1898 * somehow know whether or not we need to dereference the pointer
1899 * on the left side - that is: OP_LOAD if it was an address.
1900 * Also: in original QC we cannot OP_LOADP *anyway*.
1902 *out = (lvalue ? leftl : bin);
1907 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1909 ast_expression_codegen *cgen;
1912 /* An unary operation cannot yield an l-value */
1914 compile_error(ast_ctx(self), "not an l-value (binop)");
1918 if (self->expression.outr) {
1919 *out = self->expression.outr;
1923 cgen = self->operand->expression.codegen;
1925 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1928 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
1932 self->expression.outr = *out;
1937 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1939 ast_expression_codegen *cgen;
1944 /* In the context of a return operation, we don't actually return
1948 compile_error(ast_ctx(self), "return-expression is not an l-value");
1952 if (self->expression.outr) {
1953 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1956 self->expression.outr = (ir_value*)1;
1958 if (self->operand) {
1959 cgen = self->operand->expression.codegen;
1961 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1964 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
1967 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
1974 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1976 ast_expression_codegen *cgen;
1977 ir_value *ent, *field;
1979 /* This function needs to take the 'lvalue' flag into account!
1980 * As lvalue we provide a field-pointer, as rvalue we provide the
1984 if (lvalue && self->expression.outl) {
1985 *out = self->expression.outl;
1989 if (!lvalue && self->expression.outr) {
1990 *out = self->expression.outr;
1994 cgen = self->entity->expression.codegen;
1995 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1998 cgen = self->field->expression.codegen;
1999 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2004 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2007 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2008 ent, field, self->expression.vtype);
2009 /* Done AFTER error checking:
2010 codegen_output_type(self, *out);
2014 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2015 (lvalue ? "ADDRESS" : "FIELD"),
2016 type_name[self->expression.vtype]);
2020 codegen_output_type(self, *out);
2023 self->expression.outl = *out;
2025 self->expression.outr = *out;
2027 /* Hm that should be it... */
2031 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2033 ast_expression_codegen *cgen;
2036 /* in QC this is always an lvalue */
2038 if (self->expression.outl) {
2039 *out = self->expression.outl;
2043 cgen = self->owner->expression.codegen;
2044 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
2047 if (vec->vtype != TYPE_VECTOR &&
2048 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2053 *out = ir_value_vector_member(vec, self->field);
2054 self->expression.outl = *out;
2056 return (*out != NULL);
2059 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2064 if (!lvalue && self->expression.outr) {
2065 *out = self->expression.outr;
2067 if (lvalue && self->expression.outl) {
2068 *out = self->expression.outl;
2071 if (!ast_istype(self->array, ast_value)) {
2072 compile_error(ast_ctx(self), "array indexing this way is not supported");
2073 /* note this would actually be pointer indexing because the left side is
2074 * not an actual array but (hopefully) an indexable expression.
2075 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2076 * support this path will be filled.
2081 arr = (ast_value*)self->array;
2082 idx = (ast_value*)self->index;
2084 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2085 /* Time to use accessor functions */
2086 ast_expression_codegen *cgen;
2087 ir_value *iridx, *funval;
2091 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2096 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2100 cgen = self->index->expression.codegen;
2101 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2104 cgen = arr->getter->expression.codegen;
2105 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2108 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval);
2111 ir_call_param(call, iridx);
2113 *out = ir_call_value(call);
2114 self->expression.outr = *out;
2118 if (idx->expression.vtype == TYPE_FLOAT) {
2119 unsigned int arridx = idx->constval.vfloat;
2120 if (arridx >= self->array->expression.count)
2122 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2125 *out = arr->ir_values[arridx];
2127 else if (idx->expression.vtype == TYPE_INTEGER) {
2128 unsigned int arridx = idx->constval.vint;
2129 if (arridx >= self->array->expression.count)
2131 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2134 *out = arr->ir_values[arridx];
2137 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2143 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2145 ast_expression_codegen *cgen;
2150 ir_block *cond = func->curblock;
2153 ir_block *ontrue_endblock = NULL;
2154 ir_block *onfalse_endblock = NULL;
2155 ir_block *merge = NULL;
2157 /* We don't output any value, thus also don't care about r/lvalue */
2161 if (self->expression.outr) {
2162 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2165 self->expression.outr = (ir_value*)1;
2167 /* generate the condition */
2168 cgen = self->cond->expression.codegen;
2169 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2171 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2172 cond = func->curblock;
2176 if (self->on_true) {
2177 /* create on-true block */
2178 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2182 /* enter the block */
2183 func->curblock = ontrue;
2186 cgen = self->on_true->expression.codegen;
2187 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2190 /* we now need to work from the current endpoint */
2191 ontrue_endblock = func->curblock;
2196 if (self->on_false) {
2197 /* create on-false block */
2198 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2202 /* enter the block */
2203 func->curblock = onfalse;
2206 cgen = self->on_false->expression.codegen;
2207 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2210 /* we now need to work from the current endpoint */
2211 onfalse_endblock = func->curblock;
2215 /* Merge block were they all merge in to */
2216 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2218 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2221 /* add jumps ot the merge block */
2222 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2224 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2227 /* Now enter the merge block */
2228 func->curblock = merge;
2231 /* we create the if here, that way all blocks are ordered :)
2233 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2234 (ontrue ? ontrue : merge),
2235 (onfalse ? onfalse : merge)))
2243 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2245 ast_expression_codegen *cgen;
2248 ir_value *trueval, *falseval;
2251 ir_block *cond = func->curblock;
2252 ir_block *cond_out = NULL;
2253 ir_block *ontrue, *ontrue_out = NULL;
2254 ir_block *onfalse, *onfalse_out = NULL;
2257 /* Ternary can never create an lvalue... */
2261 /* In theory it shouldn't be possible to pass through a node twice, but
2262 * in case we add any kind of optimization pass for the AST itself, it
2263 * may still happen, thus we remember a created ir_value and simply return one
2264 * if it already exists.
2266 if (self->expression.outr) {
2267 *out = self->expression.outr;
2271 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2273 /* generate the condition */
2274 func->curblock = cond;
2275 cgen = self->cond->expression.codegen;
2276 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2278 cond_out = func->curblock;
2280 /* create on-true block */
2281 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2286 /* enter the block */
2287 func->curblock = ontrue;
2290 cgen = self->on_true->expression.codegen;
2291 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2294 ontrue_out = func->curblock;
2297 /* create on-false block */
2298 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2303 /* enter the block */
2304 func->curblock = onfalse;
2307 cgen = self->on_false->expression.codegen;
2308 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2311 onfalse_out = func->curblock;
2314 /* create merge block */
2315 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2318 /* jump to merge block */
2319 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2321 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2324 /* create if instruction */
2325 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2328 /* Now enter the merge block */
2329 func->curblock = merge;
2331 /* Here, now, we need a PHI node
2332 * but first some sanity checking...
2334 if (trueval->vtype != falseval->vtype) {
2335 /* error("ternary with different types on the two sides"); */
2340 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), trueval->vtype);
2343 ir_phi_add(phi, ontrue_out, trueval);
2344 ir_phi_add(phi, onfalse_out, falseval);
2346 self->expression.outr = ir_phi_value(phi);
2347 *out = self->expression.outr;
2349 codegen_output_type(self, *out);
2354 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2356 ast_expression_codegen *cgen;
2358 ir_value *dummy = NULL;
2359 ir_value *precond = NULL;
2360 ir_value *postcond = NULL;
2362 /* Since we insert some jumps "late" so we have blocks
2363 * ordered "nicely", we need to keep track of the actual end-blocks
2364 * of expressions to add the jumps to.
2366 ir_block *bbody = NULL, *end_bbody = NULL;
2367 ir_block *bprecond = NULL, *end_bprecond = NULL;
2368 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2369 ir_block *bincrement = NULL, *end_bincrement = NULL;
2370 ir_block *bout = NULL, *bin = NULL;
2372 /* let's at least move the outgoing block to the end */
2375 /* 'break' and 'continue' need to be able to find the right blocks */
2376 ir_block *bcontinue = NULL;
2377 ir_block *bbreak = NULL;
2379 ir_block *old_bcontinue = NULL;
2380 ir_block *old_bbreak = NULL;
2382 ir_block *tmpblock = NULL;
2387 if (self->expression.outr) {
2388 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2391 self->expression.outr = (ir_value*)1;
2394 * Should we ever need some kind of block ordering, better make this function
2395 * move blocks around than write a block ordering algorithm later... after all
2396 * the ast and ir should work together, not against each other.
2399 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2400 * anyway if for example it contains a ternary.
2404 cgen = self->initexpr->expression.codegen;
2405 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2409 /* Store the block from which we enter this chaos */
2410 bin = func->curblock;
2412 /* The pre-loop condition needs its own block since we
2413 * need to be able to jump to the start of that expression.
2417 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2421 /* the pre-loop-condition the least important place to 'continue' at */
2422 bcontinue = bprecond;
2425 func->curblock = bprecond;
2428 cgen = self->precond->expression.codegen;
2429 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2432 end_bprecond = func->curblock;
2434 bprecond = end_bprecond = NULL;
2437 /* Now the next blocks won't be ordered nicely, but we need to
2438 * generate them this early for 'break' and 'continue'.
2440 if (self->increment) {
2441 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2444 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2446 bincrement = end_bincrement = NULL;
2449 if (self->postcond) {
2450 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2453 bcontinue = bpostcond; /* postcond comes before the increment */
2455 bpostcond = end_bpostcond = NULL;
2458 bout_id = vec_size(func->ir_func->blocks);
2459 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2464 /* The loop body... */
2465 /* if (self->body) */
2467 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2472 func->curblock = bbody;
2474 old_bbreak = func->breakblock;
2475 old_bcontinue = func->continueblock;
2476 func->breakblock = bbreak;
2477 func->continueblock = bcontinue;
2478 if (!func->continueblock)
2479 func->continueblock = bbody;
2483 cgen = self->body->expression.codegen;
2484 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2488 end_bbody = func->curblock;
2489 func->breakblock = old_bbreak;
2490 func->continueblock = old_bcontinue;
2493 /* post-loop-condition */
2497 func->curblock = bpostcond;
2500 cgen = self->postcond->expression.codegen;
2501 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2504 end_bpostcond = func->curblock;
2507 /* The incrementor */
2508 if (self->increment)
2511 func->curblock = bincrement;
2514 cgen = self->increment->expression.codegen;
2515 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2518 end_bincrement = func->curblock;
2521 /* In any case now, we continue from the outgoing block */
2522 func->curblock = bout;
2524 /* Now all blocks are in place */
2525 /* From 'bin' we jump to whatever comes first */
2526 if (bprecond) tmpblock = bprecond;
2527 else if (bbody) tmpblock = bbody;
2528 else if (bpostcond) tmpblock = bpostcond;
2529 else tmpblock = bout;
2530 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2536 ir_block *ontrue, *onfalse;
2537 if (bbody) ontrue = bbody;
2538 else if (bincrement) ontrue = bincrement;
2539 else if (bpostcond) ontrue = bpostcond;
2540 else ontrue = bprecond;
2542 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2549 if (bincrement) tmpblock = bincrement;
2550 else if (bpostcond) tmpblock = bpostcond;
2551 else if (bprecond) tmpblock = bprecond;
2552 else tmpblock = bbody;
2553 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2557 /* from increment */
2560 if (bpostcond) tmpblock = bpostcond;
2561 else if (bprecond) tmpblock = bprecond;
2562 else if (bbody) tmpblock = bbody;
2563 else tmpblock = bout;
2564 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2571 ir_block *ontrue, *onfalse;
2572 if (bprecond) ontrue = bprecond;
2573 else if (bbody) ontrue = bbody;
2574 else if (bincrement) ontrue = bincrement;
2575 else ontrue = bpostcond;
2577 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2581 /* Move 'bout' to the end */
2582 vec_remove(func->ir_func->blocks, bout_id, 1);
2583 vec_push(func->ir_func->blocks, bout);
2588 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2595 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2599 if (self->expression.outr) {
2600 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2603 self->expression.outr = (ir_value*)1;
2605 if (self->is_continue)
2606 target = func->continueblock;
2608 target = func->breakblock;
2611 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2615 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2620 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2622 ast_expression_codegen *cgen;
2624 ast_switch_case *def_case = NULL;
2625 ir_block *def_bfall = NULL;
2626 ir_block *def_bfall_to = NULL;
2627 bool set_def_bfall_to = false;
2629 ir_value *dummy = NULL;
2630 ir_value *irop = NULL;
2631 ir_block *old_break = NULL;
2632 ir_block *bout = NULL;
2633 ir_block *bfall = NULL;
2641 compile_error(ast_ctx(self), "switch expression is not an l-value");
2645 if (self->expression.outr) {
2646 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2649 self->expression.outr = (ir_value*)1;
2654 cgen = self->operand->expression.codegen;
2655 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2658 if (!vec_size(self->cases))
2661 cmpinstr = type_eq_instr[irop->vtype];
2662 if (cmpinstr >= AINSTR_END) {
2663 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2664 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2668 bout_id = vec_size(func->ir_func->blocks);
2669 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2673 /* setup the break block */
2674 old_break = func->breakblock;
2675 func->breakblock = bout;
2677 /* Now create all cases */
2678 for (c = 0; c < vec_size(self->cases); ++c) {
2679 ir_value *cond, *val;
2680 ir_block *bcase, *bnot;
2683 ast_switch_case *swcase = &self->cases[c];
2685 if (swcase->value) {
2686 /* A regular case */
2687 /* generate the condition operand */
2688 cgen = swcase->value->expression.codegen;
2689 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2691 /* generate the condition */
2692 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2696 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2697 bnot_id = vec_size(func->ir_func->blocks);
2698 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2699 if (!bcase || !bnot)
2701 if (set_def_bfall_to) {
2702 set_def_bfall_to = false;
2703 def_bfall_to = bcase;
2705 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2708 /* Make the previous case-end fall through */
2709 if (bfall && !bfall->final) {
2710 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2714 /* enter the case */
2715 func->curblock = bcase;
2716 cgen = swcase->code->expression.codegen;
2717 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2720 /* remember this block to fall through from */
2721 bfall = func->curblock;
2723 /* enter the else and move it down */
2724 func->curblock = bnot;
2725 vec_remove(func->ir_func->blocks, bnot_id, 1);
2726 vec_push(func->ir_func->blocks, bnot);
2728 /* The default case */
2729 /* Remember where to fall through from: */
2732 /* remember which case it was */
2734 /* And the next case will be remembered */
2735 set_def_bfall_to = true;
2739 /* Jump from the last bnot to bout */
2740 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2742 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2747 /* If there was a default case, put it down here */
2751 /* No need to create an extra block */
2752 bcase = func->curblock;
2754 /* Insert the fallthrough jump */
2755 if (def_bfall && !def_bfall->final) {
2756 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2760 /* Now generate the default code */
2761 cgen = def_case->code->expression.codegen;
2762 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2765 /* see if we need to fall through */
2766 if (def_bfall_to && !func->curblock->final)
2768 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2773 /* Jump from the last bnot to bout */
2774 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2776 /* enter the outgoing block */
2777 func->curblock = bout;
2779 /* restore the break block */
2780 func->breakblock = old_break;
2782 /* Move 'bout' to the end, it's nicer */
2783 vec_remove(func->ir_func->blocks, bout_id, 1);
2784 vec_push(func->ir_func->blocks, bout);
2789 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2796 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2800 /* simply create a new block and jump to it */
2801 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2802 if (!self->irblock) {
2803 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2806 if (!func->curblock->final) {
2807 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2811 /* enter the new block */
2812 func->curblock = self->irblock;
2814 /* Generate all the leftover gotos */
2815 for (i = 0; i < vec_size(self->gotos); ++i) {
2816 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2823 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2827 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2831 if (self->target->irblock) {
2832 if (self->irblock_from) {
2833 /* we already tried once, this is the callback */
2834 self->irblock_from->final = false;
2835 if (!ir_block_create_jump(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2836 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2842 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->target->irblock)) {
2843 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2850 /* the target has not yet been created...
2851 * close this block in a sneaky way:
2853 func->curblock->final = true;
2854 self->irblock_from = func->curblock;
2855 ast_label_register_goto(self->target, self);
2861 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2863 ast_expression_codegen *cgen;
2865 ir_instr *callinstr;
2868 ir_value *funval = NULL;
2870 /* return values are never lvalues */
2872 compile_error(ast_ctx(self), "not an l-value (function call)");
2876 if (self->expression.outr) {
2877 *out = self->expression.outr;
2881 cgen = self->func->expression.codegen;
2882 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2890 for (i = 0; i < vec_size(self->params); ++i)
2893 ast_expression *expr = self->params[i];
2895 cgen = expr->expression.codegen;
2896 if (!(*cgen)(expr, func, false, ¶m))
2900 vec_push(params, param);
2903 callinstr = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "call"), funval);
2907 for (i = 0; i < vec_size(params); ++i) {
2908 ir_call_param(callinstr, params[i]);
2911 *out = ir_call_value(callinstr);
2912 self->expression.outr = *out;
2914 codegen_output_type(self, *out);