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.params = NULL;
75 self->expression.count = 0;
76 self->expression.flags = 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->count = fromex->count;
112 selfex->flags = fromex->flags;
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->count = fromex->count;
138 selfex->flags = fromex->flags;
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->count = fromex->count;
190 selfex->flags = fromex->flags;
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.flags != b->expression.flags)
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 if (OPTS_FLAG(PERL_LOGIC))
402 ast_type_adopt(self, right);
404 self->expression.vtype = TYPE_FLOAT;
406 else if (op == INSTR_BITAND || op == INSTR_BITOR)
407 self->expression.vtype = TYPE_FLOAT;
408 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
409 self->expression.vtype = TYPE_VECTOR;
410 else if (op == INSTR_MUL_V)
411 self->expression.vtype = TYPE_FLOAT;
413 self->expression.vtype = left->expression.vtype;
418 void ast_binary_delete(ast_binary *self)
420 ast_unref(self->left);
421 ast_unref(self->right);
422 ast_expression_delete((ast_expression*)self);
426 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
427 ast_expression* left, ast_expression* right)
429 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
430 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
432 ast_side_effects(self) = true;
434 self->opstore = storop;
437 self->source = right;
439 self->keep_dest = false;
441 if (!ast_type_adopt(self, left)) {
449 void ast_binstore_delete(ast_binstore *self)
451 if (!self->keep_dest)
452 ast_unref(self->dest);
453 ast_unref(self->source);
454 ast_expression_delete((ast_expression*)self);
458 ast_unary* ast_unary_new(lex_ctx ctx, int op,
459 ast_expression *expr)
461 ast_instantiate(ast_unary, ctx, ast_unary_delete);
462 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
465 self->operand = expr;
467 ast_propagate_effects(self, expr);
469 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
470 self->expression.vtype = TYPE_FLOAT;
472 compile_error(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
477 void ast_unary_delete(ast_unary *self)
479 if (self->operand) ast_unref(self->operand);
480 ast_expression_delete((ast_expression*)self);
484 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
486 ast_instantiate(ast_return, ctx, ast_return_delete);
487 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
489 self->operand = expr;
492 ast_propagate_effects(self, expr);
497 void ast_return_delete(ast_return *self)
500 ast_unref(self->operand);
501 ast_expression_delete((ast_expression*)self);
505 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
507 if (field->expression.vtype != TYPE_FIELD) {
508 compile_error(ctx, "ast_entfield_new with expression not of type field");
511 return ast_entfield_new_force(ctx, entity, field, field->expression.next);
514 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
516 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
520 /* Error: field has no type... */
524 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
526 self->entity = entity;
528 ast_propagate_effects(self, entity);
529 ast_propagate_effects(self, field);
531 if (!ast_type_adopt(self, outtype)) {
532 ast_entfield_delete(self);
539 void ast_entfield_delete(ast_entfield *self)
541 ast_unref(self->entity);
542 ast_unref(self->field);
543 ast_expression_delete((ast_expression*)self);
547 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field, const char *name)
549 ast_instantiate(ast_member, ctx, ast_member_delete);
555 if (owner->expression.vtype != TYPE_VECTOR &&
556 owner->expression.vtype != TYPE_FIELD) {
557 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
562 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
563 self->expression.node.keep = true; /* keep */
565 if (owner->expression.vtype == TYPE_VECTOR) {
566 self->expression.vtype = TYPE_FLOAT;
567 self->expression.next = NULL;
569 self->expression.vtype = TYPE_FIELD;
570 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
574 ast_propagate_effects(self, owner);
578 self->name = util_strdup(name);
585 void ast_member_delete(ast_member *self)
587 /* The owner is always an ast_value, which has .keep=true,
588 * also: ast_members are usually deleted after the owner, thus
589 * this will cause invalid access
590 ast_unref(self->owner);
591 * once we allow (expression).x to access a vector-member, we need
592 * to change this: preferably by creating an alternate ast node for this
593 * purpose that is not garbage-collected.
595 ast_expression_delete((ast_expression*)self);
599 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
601 ast_expression *outtype;
602 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
604 outtype = array->expression.next;
607 /* Error: field has no type... */
611 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
615 ast_propagate_effects(self, array);
616 ast_propagate_effects(self, index);
618 if (!ast_type_adopt(self, outtype)) {
619 ast_array_index_delete(self);
622 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
623 if (self->expression.vtype != TYPE_ARRAY) {
624 compile_error(ast_ctx(self), "array_index node on type");
625 ast_array_index_delete(self);
628 self->array = outtype;
629 self->expression.vtype = TYPE_FIELD;
635 void ast_array_index_delete(ast_array_index *self)
637 ast_unref(self->array);
638 ast_unref(self->index);
639 ast_expression_delete((ast_expression*)self);
643 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
645 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
646 if (!ontrue && !onfalse) {
647 /* because it is invalid */
651 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
654 self->on_true = ontrue;
655 self->on_false = onfalse;
656 ast_propagate_effects(self, cond);
658 ast_propagate_effects(self, ontrue);
660 ast_propagate_effects(self, onfalse);
665 void ast_ifthen_delete(ast_ifthen *self)
667 ast_unref(self->cond);
669 ast_unref(self->on_true);
671 ast_unref(self->on_false);
672 ast_expression_delete((ast_expression*)self);
676 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
678 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
679 /* This time NEITHER must be NULL */
680 if (!ontrue || !onfalse) {
684 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
687 self->on_true = ontrue;
688 self->on_false = onfalse;
689 ast_propagate_effects(self, cond);
690 ast_propagate_effects(self, ontrue);
691 ast_propagate_effects(self, onfalse);
693 if (!ast_type_adopt(self, ontrue)) {
694 ast_ternary_delete(self);
701 void ast_ternary_delete(ast_ternary *self)
703 ast_unref(self->cond);
704 ast_unref(self->on_true);
705 ast_unref(self->on_false);
706 ast_expression_delete((ast_expression*)self);
710 ast_loop* ast_loop_new(lex_ctx ctx,
711 ast_expression *initexpr,
712 ast_expression *precond, bool pre_not,
713 ast_expression *postcond, bool post_not,
714 ast_expression *increment,
715 ast_expression *body)
717 ast_instantiate(ast_loop, ctx, ast_loop_delete);
718 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
720 self->initexpr = initexpr;
721 self->precond = precond;
722 self->postcond = postcond;
723 self->increment = increment;
726 self->pre_not = pre_not;
727 self->post_not = post_not;
730 ast_propagate_effects(self, initexpr);
732 ast_propagate_effects(self, precond);
734 ast_propagate_effects(self, postcond);
736 ast_propagate_effects(self, increment);
738 ast_propagate_effects(self, body);
743 void ast_loop_delete(ast_loop *self)
746 ast_unref(self->initexpr);
748 ast_unref(self->precond);
750 ast_unref(self->postcond);
752 ast_unref(self->increment);
754 ast_unref(self->body);
755 ast_expression_delete((ast_expression*)self);
759 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont)
761 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
762 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
764 self->is_continue = iscont;
769 void ast_breakcont_delete(ast_breakcont *self)
771 ast_expression_delete((ast_expression*)self);
775 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
777 ast_instantiate(ast_switch, ctx, ast_switch_delete);
778 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
783 ast_propagate_effects(self, op);
788 void ast_switch_delete(ast_switch *self)
791 ast_unref(self->operand);
793 for (i = 0; i < vec_size(self->cases); ++i) {
794 if (self->cases[i].value)
795 ast_unref(self->cases[i].value);
796 ast_unref(self->cases[i].code);
798 vec_free(self->cases);
800 ast_expression_delete((ast_expression*)self);
804 ast_label* ast_label_new(lex_ctx ctx, const char *name)
806 ast_instantiate(ast_label, ctx, ast_label_delete);
807 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
809 self->name = util_strdup(name);
810 self->irblock = NULL;
816 void ast_label_delete(ast_label *self)
818 mem_d((void*)self->name);
819 vec_free(self->gotos);
820 ast_expression_delete((ast_expression*)self);
824 void ast_label_register_goto(ast_label *self, ast_goto *g)
826 vec_push(self->gotos, g);
829 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
831 ast_instantiate(ast_goto, ctx, ast_goto_delete);
832 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
834 self->name = util_strdup(name);
836 self->irblock_from = NULL;
841 void ast_goto_delete(ast_goto *self)
843 mem_d((void*)self->name);
844 ast_expression_delete((ast_expression*)self);
848 void ast_goto_set_label(ast_goto *self, ast_label *label)
850 self->target = label;
853 ast_call* ast_call_new(lex_ctx ctx,
854 ast_expression *funcexpr)
856 ast_instantiate(ast_call, ctx, ast_call_delete);
857 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
859 ast_side_effects(self) = true;
862 self->func = funcexpr;
864 ast_type_adopt(self, funcexpr->expression.next);
869 void ast_call_delete(ast_call *self)
872 for (i = 0; i < vec_size(self->params); ++i)
873 ast_unref(self->params[i]);
874 vec_free(self->params);
877 ast_unref(self->func);
879 ast_expression_delete((ast_expression*)self);
883 bool ast_call_check_types(ast_call *self)
887 const ast_expression *func = self->func;
888 size_t count = vec_size(self->params);
889 if (count > vec_size(func->expression.params))
890 count = vec_size(func->expression.params);
892 for (i = 0; i < count; ++i) {
893 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
896 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
897 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
898 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
899 (unsigned int)(i+1), texp, tgot);
900 /* we don't immediately return */
907 ast_store* ast_store_new(lex_ctx ctx, int op,
908 ast_expression *dest, ast_expression *source)
910 ast_instantiate(ast_store, ctx, ast_store_delete);
911 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
913 ast_side_effects(self) = true;
917 self->source = source;
919 if (!ast_type_adopt(self, dest)) {
927 void ast_store_delete(ast_store *self)
929 ast_unref(self->dest);
930 ast_unref(self->source);
931 ast_expression_delete((ast_expression*)self);
935 ast_block* ast_block_new(lex_ctx ctx)
937 ast_instantiate(ast_block, ctx, ast_block_delete);
938 ast_expression_init((ast_expression*)self,
939 (ast_expression_codegen*)&ast_block_codegen);
943 self->collect = NULL;
948 bool ast_block_add_expr(ast_block *self, ast_expression *e)
950 ast_propagate_effects(self, e);
951 vec_push(self->exprs, e);
952 if (self->expression.next) {
953 ast_delete(self->expression.next);
954 self->expression.next = NULL;
956 if (!ast_type_adopt(self, e)) {
957 compile_error(ast_ctx(self), "internal error: failed to adopt type");
963 void ast_block_collect(ast_block *self, ast_expression *expr)
965 vec_push(self->collect, expr);
966 expr->expression.node.keep = true;
969 void ast_block_delete(ast_block *self)
972 for (i = 0; i < vec_size(self->exprs); ++i)
973 ast_unref(self->exprs[i]);
974 vec_free(self->exprs);
975 for (i = 0; i < vec_size(self->locals); ++i)
976 ast_delete(self->locals[i]);
977 vec_free(self->locals);
978 for (i = 0; i < vec_size(self->collect); ++i)
979 ast_delete(self->collect[i]);
980 vec_free(self->collect);
981 ast_expression_delete((ast_expression*)self);
985 bool ast_block_set_type(ast_block *self, ast_expression *from)
987 if (self->expression.next)
988 ast_delete(self->expression.next);
989 if (!ast_type_adopt(self, from))
994 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
996 ast_instantiate(ast_function, ctx, ast_function_delete);
1000 vtype->expression.vtype != TYPE_FUNCTION)
1002 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1004 (int)vtype->hasvalue,
1005 vtype->expression.vtype);
1010 self->vtype = vtype;
1011 self->name = name ? util_strdup(name) : NULL;
1012 self->blocks = NULL;
1014 self->labelcount = 0;
1017 self->ir_func = NULL;
1018 self->curblock = NULL;
1020 self->breakblock = NULL;
1021 self->continueblock = NULL;
1023 vtype->hasvalue = true;
1024 vtype->constval.vfunc = self;
1029 void ast_function_delete(ast_function *self)
1033 mem_d((void*)self->name);
1035 /* ast_value_delete(self->vtype); */
1036 self->vtype->hasvalue = false;
1037 self->vtype->constval.vfunc = NULL;
1038 /* We use unref - if it was stored in a global table it is supposed
1039 * to be deleted from *there*
1041 ast_unref(self->vtype);
1043 for (i = 0; i < vec_size(self->blocks); ++i)
1044 ast_delete(self->blocks[i]);
1045 vec_free(self->blocks);
1049 const char* ast_function_label(ast_function *self, const char *prefix)
1055 if (!opts.dump && !opts.dumpfin && !opts.debug)
1058 id = (self->labelcount++);
1059 len = strlen(prefix);
1061 from = self->labelbuf + sizeof(self->labelbuf)-1;
1064 *from-- = (id%10) + '0';
1068 memcpy(from - len, prefix, len);
1072 /*********************************************************************/
1074 * by convention you must never pass NULL to the 'ir_value **out'
1075 * parameter. If you really don't care about the output, pass a dummy.
1076 * But I can't imagine a pituation where the output is truly unnecessary.
1079 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1081 if (out->vtype == TYPE_FIELD)
1082 out->fieldtype = self->next->expression.vtype;
1083 if (out->vtype == TYPE_FUNCTION)
1084 out->outtype = self->next->expression.vtype;
1087 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1088 #define codegen_output_type_expr(a,o) (_ast_codegen_output_type(a,(o)))
1090 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1094 /* NOTE: This is the codegen for a variable used in an expression.
1095 * It is not the codegen to generate the value. For this purpose,
1096 * ast_local_codegen and ast_global_codegen are to be used before this
1097 * is executed. ast_function_codegen should take care of its locals,
1098 * and the ast-user should take care of ast_global_codegen to be used
1099 * on all the globals.
1102 char typename[1024];
1103 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
1104 compile_error(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
1111 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1115 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1117 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1120 func->context = ast_ctx(self);
1121 func->value->context = ast_ctx(self);
1123 self->constval.vfunc->ir_func = func;
1124 self->ir_v = func->value;
1125 /* The function is filled later on ast_function_codegen... */
1129 if (isfield && self->expression.vtype == TYPE_FIELD) {
1130 ast_expression *fieldtype = self->expression.next;
1132 if (self->hasvalue) {
1133 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1137 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1142 ast_expression_common *elemtype;
1144 ast_value *array = (ast_value*)fieldtype;
1146 if (!ast_istype(fieldtype, ast_value)) {
1147 compile_error(ast_ctx(self), "internal error: ast_value required");
1151 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1152 if (!array->expression.count || array->expression.count > opts.max_array_size)
1153 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1155 elemtype = &array->expression.next->expression;
1156 vtype = elemtype->vtype;
1158 v = ir_builder_create_field(ir, self->name, vtype);
1160 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1163 v->context = ast_ctx(self);
1164 v->unique_life = true;
1165 array->ir_v = self->ir_v = v;
1167 namelen = strlen(self->name);
1168 name = (char*)mem_a(namelen + 16);
1169 strcpy(name, self->name);
1171 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1172 array->ir_values[0] = v;
1173 for (ai = 1; ai < array->expression.count; ++ai) {
1174 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1175 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1176 if (!array->ir_values[ai]) {
1178 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1181 array->ir_values[ai]->context = ast_ctx(self);
1182 array->ir_values[ai]->unique_life = true;
1188 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1191 v->context = ast_ctx(self);
1197 if (self->expression.vtype == TYPE_ARRAY) {
1202 ast_expression_common *elemtype = &self->expression.next->expression;
1203 int vtype = elemtype->vtype;
1205 /* same as with field arrays */
1206 if (!self->expression.count || self->expression.count > opts.max_array_size)
1207 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1209 v = ir_builder_create_global(ir, self->name, vtype);
1211 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1214 v->context = ast_ctx(self);
1215 v->unique_life = true;
1217 namelen = strlen(self->name);
1218 name = (char*)mem_a(namelen + 16);
1219 strcpy(name, self->name);
1221 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1222 self->ir_values[0] = v;
1223 for (ai = 1; ai < self->expression.count; ++ai) {
1224 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1225 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1226 if (!self->ir_values[ai]) {
1228 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1231 self->ir_values[ai]->context = ast_ctx(self);
1232 self->ir_values[ai]->unique_life = true;
1238 /* Arrays don't do this since there's no "array" value which spans across the
1241 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1243 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1246 codegen_output_type(self, v);
1247 v->context = ast_ctx(self);
1250 if (self->hasvalue) {
1251 switch (self->expression.vtype)
1254 if (!ir_value_set_float(v, self->constval.vfloat))
1258 if (!ir_value_set_vector(v, self->constval.vvec))
1262 if (!ir_value_set_string(v, self->constval.vstring))
1266 compile_error(ast_ctx(self), "TODO: global constant array");
1269 compile_error(ast_ctx(self), "global of type function not properly generated");
1271 /* Cannot generate an IR value for a function,
1272 * need a pointer pointing to a function rather.
1275 if (!self->constval.vfield) {
1276 compile_error(ast_ctx(self), "field constant without vfield set");
1279 if (!self->constval.vfield->ir_v) {
1280 compile_error(ast_ctx(self), "field constant generated before its field");
1283 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1287 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1292 /* link us to the ir_value */
1297 error: /* clean up */
1302 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1305 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1307 /* Do we allow local functions? I think not...
1308 * this is NOT a function pointer atm.
1313 if (self->expression.vtype == TYPE_ARRAY) {
1318 ast_expression_common *elemtype = &self->expression.next->expression;
1319 int vtype = elemtype->vtype;
1322 compile_error(ast_ctx(self), "array-parameters are not supported");
1326 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1327 if (!self->expression.count || self->expression.count > opts.max_array_size) {
1328 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1331 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1332 if (!self->ir_values) {
1333 compile_error(ast_ctx(self), "failed to allocate array values");
1337 v = ir_function_create_local(func, self->name, vtype, param);
1339 compile_error(ast_ctx(self), "ir_function_create_local failed");
1342 v->context = ast_ctx(self);
1343 v->unique_life = true;
1345 namelen = strlen(self->name);
1346 name = (char*)mem_a(namelen + 16);
1347 strcpy(name, self->name);
1349 self->ir_values[0] = v;
1350 for (ai = 1; ai < self->expression.count; ++ai) {
1351 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1352 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1353 if (!self->ir_values[ai]) {
1354 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1357 self->ir_values[ai]->context = ast_ctx(self);
1358 self->ir_values[ai]->unique_life = true;
1363 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1366 codegen_output_type(self, v);
1367 v->context = ast_ctx(self);
1370 /* A constant local... hmmm...
1371 * I suppose the IR will have to deal with this
1373 if (self->hasvalue) {
1374 switch (self->expression.vtype)
1377 if (!ir_value_set_float(v, self->constval.vfloat))
1381 if (!ir_value_set_vector(v, self->constval.vvec))
1385 if (!ir_value_set_string(v, self->constval.vstring))
1389 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1394 /* link us to the ir_value */
1398 if (!ast_generate_accessors(self, func->owner))
1402 error: /* clean up */
1407 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1410 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1411 if (!self->setter || !self->getter)
1413 for (i = 0; i < self->expression.count; ++i) {
1414 if (!self->ir_values) {
1415 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1418 if (!self->ir_values[i]) {
1419 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1422 if (self->ir_values[i]->life) {
1423 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1428 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1430 if (!ast_global_codegen (self->setter, ir, false) ||
1431 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1432 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1434 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1435 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1440 if (!ast_global_codegen (self->getter, ir, false) ||
1441 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1442 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1444 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1445 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1449 for (i = 0; i < self->expression.count; ++i) {
1450 vec_free(self->ir_values[i]->life);
1452 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1456 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1460 ast_expression_common *ec;
1465 irf = self->ir_func;
1467 compile_error(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1471 /* fill the parameter list */
1472 ec = &self->vtype->expression;
1473 for (i = 0; i < vec_size(ec->params); ++i)
1475 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1476 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1478 vec_push(irf->params, ec->params[i]->expression.vtype);
1479 if (!self->builtin) {
1480 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1485 if (self->builtin) {
1486 irf->builtin = self->builtin;
1490 if (!vec_size(self->blocks)) {
1491 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1495 self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1496 if (!self->curblock) {
1497 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1501 for (i = 0; i < vec_size(self->blocks); ++i) {
1502 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1503 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1507 /* TODO: check return types */
1508 if (!self->curblock->final)
1510 if (!self->vtype->expression.next ||
1511 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1513 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1515 else if (vec_size(self->curblock->entries))
1517 /* error("missing return"); */
1518 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1519 "control reaches end of non-void function (`%s`) via %s",
1520 self->name, self->curblock->label))
1524 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1530 /* Note, you will not see ast_block_codegen generate ir_blocks.
1531 * To the AST and the IR, blocks are 2 different things.
1532 * In the AST it represents a block of code, usually enclosed in
1533 * curly braces {...}.
1534 * While in the IR it represents a block in terms of control-flow.
1536 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1540 /* We don't use this
1541 * Note: an ast-representation using the comma-operator
1542 * of the form: (a, b, c) = x should not assign to c...
1545 compile_error(ast_ctx(self), "not an l-value (code-block)");
1549 if (self->expression.outr) {
1550 *out = self->expression.outr;
1554 /* output is NULL at first, we'll have each expression
1555 * assign to out output, thus, a comma-operator represention
1556 * using an ast_block will return the last generated value,
1557 * so: (b, c) + a executed both b and c, and returns c,
1558 * which is then added to a.
1562 /* generate locals */
1563 for (i = 0; i < vec_size(self->locals); ++i)
1565 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1567 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1572 for (i = 0; i < vec_size(self->exprs); ++i)
1574 ast_expression_codegen *gen;
1575 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1576 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1580 gen = self->exprs[i]->expression.codegen;
1581 if (!(*gen)(self->exprs[i], func, false, out))
1585 self->expression.outr = *out;
1590 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1592 ast_expression_codegen *cgen;
1593 ir_value *left = NULL;
1594 ir_value *right = NULL;
1598 ast_array_index *ai = NULL;
1600 if (lvalue && self->expression.outl) {
1601 *out = self->expression.outl;
1605 if (!lvalue && self->expression.outr) {
1606 *out = self->expression.outr;
1610 if (ast_istype(self->dest, ast_array_index))
1613 ai = (ast_array_index*)self->dest;
1614 idx = (ast_value*)ai->index;
1616 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1621 /* we need to call the setter */
1622 ir_value *iridx, *funval;
1626 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1630 arr = (ast_value*)ai->array;
1631 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1632 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1636 cgen = idx->expression.codegen;
1637 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1640 cgen = arr->setter->expression.codegen;
1641 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1644 cgen = self->source->expression.codegen;
1645 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1648 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1651 ir_call_param(call, iridx);
1652 ir_call_param(call, right);
1653 self->expression.outr = right;
1659 cgen = self->dest->expression.codegen;
1661 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1663 self->expression.outl = left;
1665 cgen = self->source->expression.codegen;
1667 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1670 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1672 self->expression.outr = right;
1675 /* Theoretically, an assinment returns its left side as an
1676 * lvalue, if we don't need an lvalue though, we return
1677 * the right side as an rvalue, otherwise we have to
1678 * somehow know whether or not we need to dereference the pointer
1679 * on the left side - that is: OP_LOAD if it was an address.
1680 * Also: in original QC we cannot OP_LOADP *anyway*.
1682 *out = (lvalue ? left : right);
1687 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1689 ast_expression_codegen *cgen;
1690 ir_value *left, *right;
1692 /* A binary operation cannot yield an l-value */
1694 compile_error(ast_ctx(self), "not an l-value (binop)");
1698 if (self->expression.outr) {
1699 *out = self->expression.outr;
1703 if (OPTS_FLAG(SHORT_LOGIC) &&
1704 (self->op == INSTR_AND || self->op == INSTR_OR))
1706 /* short circuit evaluation */
1707 ir_block *other, *merge;
1708 ir_block *from_left, *from_right;
1713 /* Note about casting to true boolean values:
1714 * We use a single NOT for sub expressions, and an
1715 * overall NOT at the end, and for that purpose swap
1716 * all the jump conditions in order for the NOT to get
1718 * ie: (a && b) usually becomes (!!a ? !!b : !!a)
1719 * but we translate this to (!(!a ? !a : !b))
1722 merge_id = vec_size(func->ir_func->blocks);
1723 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1725 cgen = self->left->expression.codegen;
1726 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1728 if (!OPTS_FLAG(PERL_LOGIC)) {
1729 notop = type_not_instr[left->vtype];
1730 if (notop == AINSTR_END) {
1731 compile_error(ast_ctx(self), "don't know how to cast to bool...");
1734 left = ir_block_create_unary(func->curblock, ast_ctx(self),
1735 ast_function_label(func, "sce_not"),
1739 from_left = func->curblock;
1741 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1742 if ( !(self->op == INSTR_OR) != !OPTS_FLAG(PERL_LOGIC) ) {
1743 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1746 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1749 /* use the likely flag */
1750 vec_last(func->curblock->instr)->likely = true;
1752 func->curblock = other;
1753 cgen = self->right->expression.codegen;
1754 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1756 if (!OPTS_FLAG(PERL_LOGIC)) {
1757 notop = type_not_instr[right->vtype];
1758 if (notop == AINSTR_END) {
1759 compile_error(ast_ctx(self), "don't know how to cast to bool...");
1762 right = ir_block_create_unary(func->curblock, ast_ctx(self),
1763 ast_function_label(func, "sce_not"),
1767 from_right = func->curblock;
1769 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1772 vec_remove(func->ir_func->blocks, merge_id, 1);
1773 vec_push(func->ir_func->blocks, merge);
1775 func->curblock = merge;
1776 phi = ir_block_create_phi(func->curblock, ast_ctx(self), ast_function_label(func, "sce_value"), TYPE_FLOAT);
1777 ir_phi_add(phi, from_left, left);
1778 ir_phi_add(phi, from_right, right);
1779 *out = ir_phi_value(phi);
1780 if (!OPTS_FLAG(PERL_LOGIC)) {
1781 notop = type_not_instr[(*out)->vtype];
1782 if (notop == AINSTR_END) {
1783 compile_error(ast_ctx(self), "don't know how to cast to bool...");
1786 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1787 ast_function_label(func, "sce_final_not"),
1793 self->expression.outr = *out;
1797 cgen = self->left->expression.codegen;
1798 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1801 cgen = self->right->expression.codegen;
1802 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1805 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1806 self->op, left, right);
1809 self->expression.outr = *out;
1814 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1816 ast_expression_codegen *cgen;
1817 ir_value *leftl = NULL, *leftr, *right, *bin;
1821 ast_array_index *ai = NULL;
1822 ir_value *iridx = NULL;
1824 if (lvalue && self->expression.outl) {
1825 *out = self->expression.outl;
1829 if (!lvalue && self->expression.outr) {
1830 *out = self->expression.outr;
1834 if (ast_istype(self->dest, ast_array_index))
1837 ai = (ast_array_index*)self->dest;
1838 idx = (ast_value*)ai->index;
1840 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1844 /* for a binstore we need both an lvalue and an rvalue for the left side */
1845 /* rvalue of destination! */
1847 cgen = idx->expression.codegen;
1848 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1851 cgen = self->dest->expression.codegen;
1852 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1855 /* source as rvalue only */
1856 cgen = self->source->expression.codegen;
1857 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1860 /* now the binary */
1861 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1862 self->opbin, leftr, right);
1863 self->expression.outr = bin;
1867 /* we need to call the setter */
1872 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1876 arr = (ast_value*)ai->array;
1877 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1878 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1882 cgen = arr->setter->expression.codegen;
1883 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1886 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1889 ir_call_param(call, iridx);
1890 ir_call_param(call, bin);
1891 self->expression.outr = bin;
1893 /* now store them */
1894 cgen = self->dest->expression.codegen;
1895 /* lvalue of destination */
1896 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1898 self->expression.outl = leftl;
1900 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
1902 self->expression.outr = bin;
1905 /* Theoretically, an assinment returns its left side as an
1906 * lvalue, if we don't need an lvalue though, we return
1907 * the right side as an rvalue, otherwise we have to
1908 * somehow know whether or not we need to dereference the pointer
1909 * on the left side - that is: OP_LOAD if it was an address.
1910 * Also: in original QC we cannot OP_LOADP *anyway*.
1912 *out = (lvalue ? leftl : bin);
1917 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1919 ast_expression_codegen *cgen;
1922 /* An unary operation cannot yield an l-value */
1924 compile_error(ast_ctx(self), "not an l-value (binop)");
1928 if (self->expression.outr) {
1929 *out = self->expression.outr;
1933 cgen = self->operand->expression.codegen;
1935 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1938 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
1942 self->expression.outr = *out;
1947 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1949 ast_expression_codegen *cgen;
1954 /* In the context of a return operation, we don't actually return
1958 compile_error(ast_ctx(self), "return-expression is not an l-value");
1962 if (self->expression.outr) {
1963 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1966 self->expression.outr = (ir_value*)1;
1968 if (self->operand) {
1969 cgen = self->operand->expression.codegen;
1971 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1974 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
1977 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
1984 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1986 ast_expression_codegen *cgen;
1987 ir_value *ent, *field;
1989 /* This function needs to take the 'lvalue' flag into account!
1990 * As lvalue we provide a field-pointer, as rvalue we provide the
1994 if (lvalue && self->expression.outl) {
1995 *out = self->expression.outl;
1999 if (!lvalue && self->expression.outr) {
2000 *out = self->expression.outr;
2004 cgen = self->entity->expression.codegen;
2005 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2008 cgen = self->field->expression.codegen;
2009 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2014 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2017 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2018 ent, field, self->expression.vtype);
2019 /* Done AFTER error checking:
2020 codegen_output_type(self, *out);
2024 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2025 (lvalue ? "ADDRESS" : "FIELD"),
2026 type_name[self->expression.vtype]);
2030 codegen_output_type(self, *out);
2033 self->expression.outl = *out;
2035 self->expression.outr = *out;
2037 /* Hm that should be it... */
2041 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2043 ast_expression_codegen *cgen;
2046 /* in QC this is always an lvalue */
2048 if (self->expression.outl) {
2049 *out = self->expression.outl;
2053 cgen = self->owner->expression.codegen;
2054 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
2057 if (vec->vtype != TYPE_VECTOR &&
2058 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2063 *out = ir_value_vector_member(vec, self->field);
2064 self->expression.outl = *out;
2066 return (*out != NULL);
2069 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2074 if (!lvalue && self->expression.outr) {
2075 *out = self->expression.outr;
2077 if (lvalue && self->expression.outl) {
2078 *out = self->expression.outl;
2081 if (!ast_istype(self->array, ast_value)) {
2082 compile_error(ast_ctx(self), "array indexing this way is not supported");
2083 /* note this would actually be pointer indexing because the left side is
2084 * not an actual array but (hopefully) an indexable expression.
2085 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2086 * support this path will be filled.
2091 arr = (ast_value*)self->array;
2092 idx = (ast_value*)self->index;
2094 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2095 /* Time to use accessor functions */
2096 ast_expression_codegen *cgen;
2097 ir_value *iridx, *funval;
2101 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2106 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2110 cgen = self->index->expression.codegen;
2111 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2114 cgen = arr->getter->expression.codegen;
2115 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2118 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2121 ir_call_param(call, iridx);
2123 *out = ir_call_value(call);
2124 self->expression.outr = *out;
2128 if (idx->expression.vtype == TYPE_FLOAT) {
2129 unsigned int arridx = idx->constval.vfloat;
2130 if (arridx >= self->array->expression.count)
2132 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2135 *out = arr->ir_values[arridx];
2137 else if (idx->expression.vtype == TYPE_INTEGER) {
2138 unsigned int arridx = idx->constval.vint;
2139 if (arridx >= self->array->expression.count)
2141 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2144 *out = arr->ir_values[arridx];
2147 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2153 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2155 ast_expression_codegen *cgen;
2163 ir_block *ontrue_endblock = NULL;
2164 ir_block *onfalse_endblock = NULL;
2165 ir_block *merge = NULL;
2167 /* We don't output any value, thus also don't care about r/lvalue */
2171 if (self->expression.outr) {
2172 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2175 self->expression.outr = (ir_value*)1;
2177 /* generate the condition */
2178 cgen = self->cond->expression.codegen;
2179 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2181 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2182 cond = func->curblock;
2186 if (self->on_true) {
2187 /* create on-true block */
2188 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2192 /* enter the block */
2193 func->curblock = ontrue;
2196 cgen = self->on_true->expression.codegen;
2197 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2200 /* we now need to work from the current endpoint */
2201 ontrue_endblock = func->curblock;
2206 if (self->on_false) {
2207 /* create on-false block */
2208 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2212 /* enter the block */
2213 func->curblock = onfalse;
2216 cgen = self->on_false->expression.codegen;
2217 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2220 /* we now need to work from the current endpoint */
2221 onfalse_endblock = func->curblock;
2225 /* Merge block were they all merge in to */
2226 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2228 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2231 /* add jumps ot the merge block */
2232 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2234 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2237 /* Now enter the merge block */
2238 func->curblock = merge;
2241 /* we create the if here, that way all blocks are ordered :)
2243 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2244 (ontrue ? ontrue : merge),
2245 (onfalse ? onfalse : merge)))
2253 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2255 ast_expression_codegen *cgen;
2258 ir_value *trueval, *falseval;
2261 ir_block *cond = func->curblock;
2262 ir_block *cond_out = NULL;
2263 ir_block *ontrue, *ontrue_out = NULL;
2264 ir_block *onfalse, *onfalse_out = NULL;
2267 /* Ternary can never create an lvalue... */
2271 /* In theory it shouldn't be possible to pass through a node twice, but
2272 * in case we add any kind of optimization pass for the AST itself, it
2273 * may still happen, thus we remember a created ir_value and simply return one
2274 * if it already exists.
2276 if (self->expression.outr) {
2277 *out = self->expression.outr;
2281 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2283 /* generate the condition */
2284 func->curblock = cond;
2285 cgen = self->cond->expression.codegen;
2286 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2288 cond_out = func->curblock;
2290 /* create on-true block */
2291 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2296 /* enter the block */
2297 func->curblock = ontrue;
2300 cgen = self->on_true->expression.codegen;
2301 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2304 ontrue_out = func->curblock;
2307 /* create on-false block */
2308 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2313 /* enter the block */
2314 func->curblock = onfalse;
2317 cgen = self->on_false->expression.codegen;
2318 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2321 onfalse_out = func->curblock;
2324 /* create merge block */
2325 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2328 /* jump to merge block */
2329 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2331 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2334 /* create if instruction */
2335 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2338 /* Now enter the merge block */
2339 func->curblock = merge;
2341 /* Here, now, we need a PHI node
2342 * but first some sanity checking...
2344 if (trueval->vtype != falseval->vtype) {
2345 /* error("ternary with different types on the two sides"); */
2350 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), trueval->vtype);
2353 ir_phi_add(phi, ontrue_out, trueval);
2354 ir_phi_add(phi, onfalse_out, falseval);
2356 self->expression.outr = ir_phi_value(phi);
2357 *out = self->expression.outr;
2359 codegen_output_type(self, *out);
2364 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2366 ast_expression_codegen *cgen;
2368 ir_value *dummy = NULL;
2369 ir_value *precond = NULL;
2370 ir_value *postcond = NULL;
2372 /* Since we insert some jumps "late" so we have blocks
2373 * ordered "nicely", we need to keep track of the actual end-blocks
2374 * of expressions to add the jumps to.
2376 ir_block *bbody = NULL, *end_bbody = NULL;
2377 ir_block *bprecond = NULL, *end_bprecond = NULL;
2378 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2379 ir_block *bincrement = NULL, *end_bincrement = NULL;
2380 ir_block *bout = NULL, *bin = NULL;
2382 /* let's at least move the outgoing block to the end */
2385 /* 'break' and 'continue' need to be able to find the right blocks */
2386 ir_block *bcontinue = NULL;
2387 ir_block *bbreak = NULL;
2389 ir_block *old_bcontinue = NULL;
2390 ir_block *old_bbreak = NULL;
2392 ir_block *tmpblock = NULL;
2397 if (self->expression.outr) {
2398 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2401 self->expression.outr = (ir_value*)1;
2404 * Should we ever need some kind of block ordering, better make this function
2405 * move blocks around than write a block ordering algorithm later... after all
2406 * the ast and ir should work together, not against each other.
2409 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2410 * anyway if for example it contains a ternary.
2414 cgen = self->initexpr->expression.codegen;
2415 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2419 /* Store the block from which we enter this chaos */
2420 bin = func->curblock;
2422 /* The pre-loop condition needs its own block since we
2423 * need to be able to jump to the start of that expression.
2427 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2431 /* the pre-loop-condition the least important place to 'continue' at */
2432 bcontinue = bprecond;
2435 func->curblock = bprecond;
2438 cgen = self->precond->expression.codegen;
2439 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2442 end_bprecond = func->curblock;
2444 bprecond = end_bprecond = NULL;
2447 /* Now the next blocks won't be ordered nicely, but we need to
2448 * generate them this early for 'break' and 'continue'.
2450 if (self->increment) {
2451 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2454 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2456 bincrement = end_bincrement = NULL;
2459 if (self->postcond) {
2460 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2463 bcontinue = bpostcond; /* postcond comes before the increment */
2465 bpostcond = end_bpostcond = NULL;
2468 bout_id = vec_size(func->ir_func->blocks);
2469 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2474 /* The loop body... */
2475 /* if (self->body) */
2477 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2482 func->curblock = bbody;
2484 old_bbreak = func->breakblock;
2485 old_bcontinue = func->continueblock;
2486 func->breakblock = bbreak;
2487 func->continueblock = bcontinue;
2488 if (!func->continueblock)
2489 func->continueblock = bbody;
2493 cgen = self->body->expression.codegen;
2494 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2498 end_bbody = func->curblock;
2499 func->breakblock = old_bbreak;
2500 func->continueblock = old_bcontinue;
2503 /* post-loop-condition */
2507 func->curblock = bpostcond;
2510 cgen = self->postcond->expression.codegen;
2511 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2514 end_bpostcond = func->curblock;
2517 /* The incrementor */
2518 if (self->increment)
2521 func->curblock = bincrement;
2524 cgen = self->increment->expression.codegen;
2525 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2528 end_bincrement = func->curblock;
2531 /* In any case now, we continue from the outgoing block */
2532 func->curblock = bout;
2534 /* Now all blocks are in place */
2535 /* From 'bin' we jump to whatever comes first */
2536 if (bprecond) tmpblock = bprecond;
2537 else if (bbody) tmpblock = bbody;
2538 else if (bpostcond) tmpblock = bpostcond;
2539 else tmpblock = bout;
2540 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2546 ir_block *ontrue, *onfalse;
2547 if (bbody) ontrue = bbody;
2548 else if (bincrement) ontrue = bincrement;
2549 else if (bpostcond) ontrue = bpostcond;
2550 else ontrue = bprecond;
2552 if (self->pre_not) {
2557 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2564 if (bincrement) tmpblock = bincrement;
2565 else if (bpostcond) tmpblock = bpostcond;
2566 else if (bprecond) tmpblock = bprecond;
2567 else tmpblock = bbody;
2568 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2572 /* from increment */
2575 if (bpostcond) tmpblock = bpostcond;
2576 else if (bprecond) tmpblock = bprecond;
2577 else if (bbody) tmpblock = bbody;
2578 else tmpblock = bout;
2579 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2586 ir_block *ontrue, *onfalse;
2587 if (bprecond) ontrue = bprecond;
2588 else if (bbody) ontrue = bbody;
2589 else if (bincrement) ontrue = bincrement;
2590 else ontrue = bpostcond;
2592 if (self->post_not) {
2597 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2601 /* Move 'bout' to the end */
2602 vec_remove(func->ir_func->blocks, bout_id, 1);
2603 vec_push(func->ir_func->blocks, bout);
2608 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2615 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2619 if (self->expression.outr) {
2620 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2623 self->expression.outr = (ir_value*)1;
2625 if (self->is_continue)
2626 target = func->continueblock;
2628 target = func->breakblock;
2631 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2635 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2640 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2642 ast_expression_codegen *cgen;
2644 ast_switch_case *def_case = NULL;
2645 ir_block *def_bfall = NULL;
2646 ir_block *def_bfall_to = NULL;
2647 bool set_def_bfall_to = false;
2649 ir_value *dummy = NULL;
2650 ir_value *irop = NULL;
2651 ir_block *old_break = NULL;
2652 ir_block *bout = NULL;
2653 ir_block *bfall = NULL;
2661 compile_error(ast_ctx(self), "switch expression is not an l-value");
2665 if (self->expression.outr) {
2666 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2669 self->expression.outr = (ir_value*)1;
2674 cgen = self->operand->expression.codegen;
2675 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2678 if (!vec_size(self->cases))
2681 cmpinstr = type_eq_instr[irop->vtype];
2682 if (cmpinstr >= AINSTR_END) {
2683 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2684 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2688 bout_id = vec_size(func->ir_func->blocks);
2689 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2693 /* setup the break block */
2694 old_break = func->breakblock;
2695 func->breakblock = bout;
2697 /* Now create all cases */
2698 for (c = 0; c < vec_size(self->cases); ++c) {
2699 ir_value *cond, *val;
2700 ir_block *bcase, *bnot;
2703 ast_switch_case *swcase = &self->cases[c];
2705 if (swcase->value) {
2706 /* A regular case */
2707 /* generate the condition operand */
2708 cgen = swcase->value->expression.codegen;
2709 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2711 /* generate the condition */
2712 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2716 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2717 bnot_id = vec_size(func->ir_func->blocks);
2718 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2719 if (!bcase || !bnot)
2721 if (set_def_bfall_to) {
2722 set_def_bfall_to = false;
2723 def_bfall_to = bcase;
2725 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2728 /* Make the previous case-end fall through */
2729 if (bfall && !bfall->final) {
2730 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2734 /* enter the case */
2735 func->curblock = bcase;
2736 cgen = swcase->code->expression.codegen;
2737 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2740 /* remember this block to fall through from */
2741 bfall = func->curblock;
2743 /* enter the else and move it down */
2744 func->curblock = bnot;
2745 vec_remove(func->ir_func->blocks, bnot_id, 1);
2746 vec_push(func->ir_func->blocks, bnot);
2748 /* The default case */
2749 /* Remember where to fall through from: */
2752 /* remember which case it was */
2754 /* And the next case will be remembered */
2755 set_def_bfall_to = true;
2759 /* Jump from the last bnot to bout */
2760 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2762 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2767 /* If there was a default case, put it down here */
2771 /* No need to create an extra block */
2772 bcase = func->curblock;
2774 /* Insert the fallthrough jump */
2775 if (def_bfall && !def_bfall->final) {
2776 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2780 /* Now generate the default code */
2781 cgen = def_case->code->expression.codegen;
2782 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2785 /* see if we need to fall through */
2786 if (def_bfall_to && !func->curblock->final)
2788 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2793 /* Jump from the last bnot to bout */
2794 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2796 /* enter the outgoing block */
2797 func->curblock = bout;
2799 /* restore the break block */
2800 func->breakblock = old_break;
2802 /* Move 'bout' to the end, it's nicer */
2803 vec_remove(func->ir_func->blocks, bout_id, 1);
2804 vec_push(func->ir_func->blocks, bout);
2809 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2816 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2820 /* simply create a new block and jump to it */
2821 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2822 if (!self->irblock) {
2823 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2826 if (!func->curblock->final) {
2827 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2831 /* enter the new block */
2832 func->curblock = self->irblock;
2834 /* Generate all the leftover gotos */
2835 for (i = 0; i < vec_size(self->gotos); ++i) {
2836 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2843 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2847 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2851 if (self->target->irblock) {
2852 if (self->irblock_from) {
2853 /* we already tried once, this is the callback */
2854 self->irblock_from->final = false;
2855 if (!ir_block_create_jump(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2856 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2862 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->target->irblock)) {
2863 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2870 /* the target has not yet been created...
2871 * close this block in a sneaky way:
2873 func->curblock->final = true;
2874 self->irblock_from = func->curblock;
2875 ast_label_register_goto(self->target, self);
2881 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2883 ast_expression_codegen *cgen;
2885 ir_instr *callinstr;
2888 ir_value *funval = NULL;
2890 /* return values are never lvalues */
2892 compile_error(ast_ctx(self), "not an l-value (function call)");
2896 if (self->expression.outr) {
2897 *out = self->expression.outr;
2901 cgen = self->func->expression.codegen;
2902 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2910 for (i = 0; i < vec_size(self->params); ++i)
2913 ast_expression *expr = self->params[i];
2915 cgen = expr->expression.codegen;
2916 if (!(*cgen)(expr, func, false, ¶m))
2920 vec_push(params, param);
2923 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
2924 ast_function_label(func, "call"),
2925 funval, !!(self->func->expression.flags & AST_FLAG_NORETURN));
2929 for (i = 0; i < vec_size(params); ++i) {
2930 ir_call_param(callinstr, params[i]);
2933 *out = ir_call_value(callinstr);
2934 self->expression.outr = *out;
2936 codegen_output_type(self, *out);