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 bool ast_member_set_name(ast_member *self, const char *name)
602 mem_d((void*)self->name);
603 self->name = util_strdup(name);
607 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
609 ast_expression *outtype;
610 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
612 outtype = array->expression.next;
615 /* Error: field has no type... */
619 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
623 ast_propagate_effects(self, array);
624 ast_propagate_effects(self, index);
626 if (!ast_type_adopt(self, outtype)) {
627 ast_array_index_delete(self);
630 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
631 if (self->expression.vtype != TYPE_ARRAY) {
632 compile_error(ast_ctx(self), "array_index node on type");
633 ast_array_index_delete(self);
636 self->array = outtype;
637 self->expression.vtype = TYPE_FIELD;
643 void ast_array_index_delete(ast_array_index *self)
645 ast_unref(self->array);
646 ast_unref(self->index);
647 ast_expression_delete((ast_expression*)self);
651 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
653 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
654 if (!ontrue && !onfalse) {
655 /* because it is invalid */
659 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
662 self->on_true = ontrue;
663 self->on_false = onfalse;
664 ast_propagate_effects(self, cond);
666 ast_propagate_effects(self, ontrue);
668 ast_propagate_effects(self, onfalse);
673 void ast_ifthen_delete(ast_ifthen *self)
675 ast_unref(self->cond);
677 ast_unref(self->on_true);
679 ast_unref(self->on_false);
680 ast_expression_delete((ast_expression*)self);
684 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
686 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
687 /* This time NEITHER must be NULL */
688 if (!ontrue || !onfalse) {
692 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
695 self->on_true = ontrue;
696 self->on_false = onfalse;
697 ast_propagate_effects(self, cond);
698 ast_propagate_effects(self, ontrue);
699 ast_propagate_effects(self, onfalse);
701 if (!ast_type_adopt(self, ontrue)) {
702 ast_ternary_delete(self);
709 void ast_ternary_delete(ast_ternary *self)
711 ast_unref(self->cond);
712 ast_unref(self->on_true);
713 ast_unref(self->on_false);
714 ast_expression_delete((ast_expression*)self);
718 ast_loop* ast_loop_new(lex_ctx ctx,
719 ast_expression *initexpr,
720 ast_expression *precond, bool pre_not,
721 ast_expression *postcond, bool post_not,
722 ast_expression *increment,
723 ast_expression *body)
725 ast_instantiate(ast_loop, ctx, ast_loop_delete);
726 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
728 self->initexpr = initexpr;
729 self->precond = precond;
730 self->postcond = postcond;
731 self->increment = increment;
734 self->pre_not = pre_not;
735 self->post_not = post_not;
738 ast_propagate_effects(self, initexpr);
740 ast_propagate_effects(self, precond);
742 ast_propagate_effects(self, postcond);
744 ast_propagate_effects(self, increment);
746 ast_propagate_effects(self, body);
751 void ast_loop_delete(ast_loop *self)
754 ast_unref(self->initexpr);
756 ast_unref(self->precond);
758 ast_unref(self->postcond);
760 ast_unref(self->increment);
762 ast_unref(self->body);
763 ast_expression_delete((ast_expression*)self);
767 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont, unsigned int levels)
769 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
770 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
772 self->is_continue = iscont;
773 self->levels = levels;
778 void ast_breakcont_delete(ast_breakcont *self)
780 ast_expression_delete((ast_expression*)self);
784 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
786 ast_instantiate(ast_switch, ctx, ast_switch_delete);
787 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
792 ast_propagate_effects(self, op);
797 void ast_switch_delete(ast_switch *self)
800 ast_unref(self->operand);
802 for (i = 0; i < vec_size(self->cases); ++i) {
803 if (self->cases[i].value)
804 ast_unref(self->cases[i].value);
805 ast_unref(self->cases[i].code);
807 vec_free(self->cases);
809 ast_expression_delete((ast_expression*)self);
813 ast_label* ast_label_new(lex_ctx ctx, const char *name)
815 ast_instantiate(ast_label, ctx, ast_label_delete);
816 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
818 self->name = util_strdup(name);
819 self->irblock = NULL;
825 void ast_label_delete(ast_label *self)
827 mem_d((void*)self->name);
828 vec_free(self->gotos);
829 ast_expression_delete((ast_expression*)self);
833 void ast_label_register_goto(ast_label *self, ast_goto *g)
835 vec_push(self->gotos, g);
838 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
840 ast_instantiate(ast_goto, ctx, ast_goto_delete);
841 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
843 self->name = util_strdup(name);
845 self->irblock_from = NULL;
850 void ast_goto_delete(ast_goto *self)
852 mem_d((void*)self->name);
853 ast_expression_delete((ast_expression*)self);
857 void ast_goto_set_label(ast_goto *self, ast_label *label)
859 self->target = label;
862 ast_call* ast_call_new(lex_ctx ctx,
863 ast_expression *funcexpr)
865 ast_instantiate(ast_call, ctx, ast_call_delete);
866 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
868 ast_side_effects(self) = true;
871 self->func = funcexpr;
873 ast_type_adopt(self, funcexpr->expression.next);
878 void ast_call_delete(ast_call *self)
881 for (i = 0; i < vec_size(self->params); ++i)
882 ast_unref(self->params[i]);
883 vec_free(self->params);
886 ast_unref(self->func);
888 ast_expression_delete((ast_expression*)self);
892 bool ast_call_check_types(ast_call *self)
896 const ast_expression *func = self->func;
897 size_t count = vec_size(self->params);
898 if (count > vec_size(func->expression.params))
899 count = vec_size(func->expression.params);
901 for (i = 0; i < count; ++i) {
902 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
905 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
906 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
907 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
908 (unsigned int)(i+1), texp, tgot);
909 /* we don't immediately return */
916 ast_store* ast_store_new(lex_ctx ctx, int op,
917 ast_expression *dest, ast_expression *source)
919 ast_instantiate(ast_store, ctx, ast_store_delete);
920 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
922 ast_side_effects(self) = true;
926 self->source = source;
928 if (!ast_type_adopt(self, dest)) {
936 void ast_store_delete(ast_store *self)
938 ast_unref(self->dest);
939 ast_unref(self->source);
940 ast_expression_delete((ast_expression*)self);
944 ast_block* ast_block_new(lex_ctx ctx)
946 ast_instantiate(ast_block, ctx, ast_block_delete);
947 ast_expression_init((ast_expression*)self,
948 (ast_expression_codegen*)&ast_block_codegen);
952 self->collect = NULL;
957 bool ast_block_add_expr(ast_block *self, ast_expression *e)
959 ast_propagate_effects(self, e);
960 vec_push(self->exprs, e);
961 if (self->expression.next) {
962 ast_delete(self->expression.next);
963 self->expression.next = NULL;
965 if (!ast_type_adopt(self, e)) {
966 compile_error(ast_ctx(self), "internal error: failed to adopt type");
972 void ast_block_collect(ast_block *self, ast_expression *expr)
974 vec_push(self->collect, expr);
975 expr->expression.node.keep = true;
978 void ast_block_delete(ast_block *self)
981 for (i = 0; i < vec_size(self->exprs); ++i)
982 ast_unref(self->exprs[i]);
983 vec_free(self->exprs);
984 for (i = 0; i < vec_size(self->locals); ++i)
985 ast_delete(self->locals[i]);
986 vec_free(self->locals);
987 for (i = 0; i < vec_size(self->collect); ++i)
988 ast_delete(self->collect[i]);
989 vec_free(self->collect);
990 ast_expression_delete((ast_expression*)self);
994 bool ast_block_set_type(ast_block *self, ast_expression *from)
996 if (self->expression.next)
997 ast_delete(self->expression.next);
998 if (!ast_type_adopt(self, from))
1003 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1005 ast_instantiate(ast_function, ctx, ast_function_delete);
1009 vtype->expression.vtype != TYPE_FUNCTION)
1011 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1013 (int)vtype->hasvalue,
1014 vtype->expression.vtype);
1019 self->vtype = vtype;
1020 self->name = name ? util_strdup(name) : NULL;
1021 self->blocks = NULL;
1023 self->labelcount = 0;
1026 self->ir_func = NULL;
1027 self->curblock = NULL;
1029 self->breakblock = NULL;
1030 self->continueblock = NULL;
1032 vtype->hasvalue = true;
1033 vtype->constval.vfunc = self;
1038 void ast_function_delete(ast_function *self)
1042 mem_d((void*)self->name);
1044 /* ast_value_delete(self->vtype); */
1045 self->vtype->hasvalue = false;
1046 self->vtype->constval.vfunc = NULL;
1047 /* We use unref - if it was stored in a global table it is supposed
1048 * to be deleted from *there*
1050 ast_unref(self->vtype);
1052 for (i = 0; i < vec_size(self->blocks); ++i)
1053 ast_delete(self->blocks[i]);
1054 vec_free(self->blocks);
1058 const char* ast_function_label(ast_function *self, const char *prefix)
1064 if (!opts.dump && !opts.dumpfin && !opts.debug)
1067 id = (self->labelcount++);
1068 len = strlen(prefix);
1070 from = self->labelbuf + sizeof(self->labelbuf)-1;
1073 *from-- = (id%10) + '0';
1077 memcpy(from - len, prefix, len);
1081 /*********************************************************************/
1083 * by convention you must never pass NULL to the 'ir_value **out'
1084 * parameter. If you really don't care about the output, pass a dummy.
1085 * But I can't imagine a pituation where the output is truly unnecessary.
1088 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1090 if (out->vtype == TYPE_FIELD)
1091 out->fieldtype = self->next->expression.vtype;
1092 if (out->vtype == TYPE_FUNCTION)
1093 out->outtype = self->next->expression.vtype;
1096 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1098 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1102 /* NOTE: This is the codegen for a variable used in an expression.
1103 * It is not the codegen to generate the value. For this purpose,
1104 * ast_local_codegen and ast_global_codegen are to be used before this
1105 * is executed. ast_function_codegen should take care of its locals,
1106 * and the ast-user should take care of ast_global_codegen to be used
1107 * on all the globals.
1110 char tname[1024]; /* typename is reserved in C++ */
1111 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1112 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1119 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1123 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1125 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1128 func->context = ast_ctx(self);
1129 func->value->context = ast_ctx(self);
1131 self->constval.vfunc->ir_func = func;
1132 self->ir_v = func->value;
1133 /* The function is filled later on ast_function_codegen... */
1137 if (isfield && self->expression.vtype == TYPE_FIELD) {
1138 ast_expression *fieldtype = self->expression.next;
1140 if (self->hasvalue) {
1141 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1145 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1150 ast_expression_common *elemtype;
1152 ast_value *array = (ast_value*)fieldtype;
1154 if (!ast_istype(fieldtype, ast_value)) {
1155 compile_error(ast_ctx(self), "internal error: ast_value required");
1159 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1160 if (!array->expression.count || array->expression.count > opts.max_array_size)
1161 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1163 elemtype = &array->expression.next->expression;
1164 vtype = elemtype->vtype;
1166 v = ir_builder_create_field(ir, self->name, vtype);
1168 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1171 v->context = ast_ctx(self);
1172 v->unique_life = true;
1174 array->ir_v = self->ir_v = v;
1176 namelen = strlen(self->name);
1177 name = (char*)mem_a(namelen + 16);
1178 strcpy(name, self->name);
1180 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1181 array->ir_values[0] = v;
1182 for (ai = 1; ai < array->expression.count; ++ai) {
1183 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1184 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1185 if (!array->ir_values[ai]) {
1187 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1190 array->ir_values[ai]->context = ast_ctx(self);
1191 array->ir_values[ai]->unique_life = true;
1192 array->ir_values[ai]->locked = true;
1198 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1201 v->context = ast_ctx(self);
1207 if (self->expression.vtype == TYPE_ARRAY) {
1212 ast_expression_common *elemtype = &self->expression.next->expression;
1213 int vtype = elemtype->vtype;
1215 /* same as with field arrays */
1216 if (!self->expression.count || self->expression.count > opts.max_array_size)
1217 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1219 v = ir_builder_create_global(ir, self->name, vtype);
1221 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1224 v->context = ast_ctx(self);
1225 v->unique_life = true;
1228 namelen = strlen(self->name);
1229 name = (char*)mem_a(namelen + 16);
1230 strcpy(name, self->name);
1232 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1233 self->ir_values[0] = v;
1234 for (ai = 1; ai < self->expression.count; ++ai) {
1235 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1236 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1237 if (!self->ir_values[ai]) {
1239 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1242 self->ir_values[ai]->context = ast_ctx(self);
1243 self->ir_values[ai]->unique_life = true;
1244 self->ir_values[ai]->locked = true;
1250 /* Arrays don't do this since there's no "array" value which spans across the
1253 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1255 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1258 codegen_output_type(self, v);
1259 v->context = ast_ctx(self);
1262 if (self->hasvalue) {
1263 switch (self->expression.vtype)
1266 if (!ir_value_set_float(v, self->constval.vfloat))
1270 if (!ir_value_set_vector(v, self->constval.vvec))
1274 if (!ir_value_set_string(v, self->constval.vstring))
1278 compile_error(ast_ctx(self), "TODO: global constant array");
1281 compile_error(ast_ctx(self), "global of type function not properly generated");
1283 /* Cannot generate an IR value for a function,
1284 * need a pointer pointing to a function rather.
1287 if (!self->constval.vfield) {
1288 compile_error(ast_ctx(self), "field constant without vfield set");
1291 if (!self->constval.vfield->ir_v) {
1292 compile_error(ast_ctx(self), "field constant generated before its field");
1295 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1299 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1304 /* link us to the ir_value */
1309 error: /* clean up */
1314 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1317 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1319 /* Do we allow local functions? I think not...
1320 * this is NOT a function pointer atm.
1325 if (self->expression.vtype == TYPE_ARRAY) {
1330 ast_expression_common *elemtype = &self->expression.next->expression;
1331 int vtype = elemtype->vtype;
1333 func->flags |= IR_FLAG_HAS_ARRAYS;
1336 compile_error(ast_ctx(self), "array-parameters are not supported");
1340 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1341 if (!self->expression.count || self->expression.count > opts.max_array_size) {
1342 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1345 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1346 if (!self->ir_values) {
1347 compile_error(ast_ctx(self), "failed to allocate array values");
1351 v = ir_function_create_local(func, self->name, vtype, param);
1353 compile_error(ast_ctx(self), "ir_function_create_local failed");
1356 v->context = ast_ctx(self);
1357 v->unique_life = true;
1360 namelen = strlen(self->name);
1361 name = (char*)mem_a(namelen + 16);
1362 strcpy(name, self->name);
1364 self->ir_values[0] = v;
1365 for (ai = 1; ai < self->expression.count; ++ai) {
1366 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1367 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1368 if (!self->ir_values[ai]) {
1369 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1372 self->ir_values[ai]->context = ast_ctx(self);
1373 self->ir_values[ai]->unique_life = true;
1374 self->ir_values[ai]->locked = true;
1379 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1382 codegen_output_type(self, v);
1383 v->context = ast_ctx(self);
1386 /* A constant local... hmmm...
1387 * I suppose the IR will have to deal with this
1389 if (self->hasvalue) {
1390 switch (self->expression.vtype)
1393 if (!ir_value_set_float(v, self->constval.vfloat))
1397 if (!ir_value_set_vector(v, self->constval.vvec))
1401 if (!ir_value_set_string(v, self->constval.vstring))
1405 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1410 /* link us to the ir_value */
1414 if (!ast_generate_accessors(self, func->owner))
1418 error: /* clean up */
1423 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1426 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1427 if (!self->setter || !self->getter)
1429 for (i = 0; i < self->expression.count; ++i) {
1430 if (!self->ir_values) {
1431 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1434 if (!self->ir_values[i]) {
1435 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1438 if (self->ir_values[i]->life) {
1439 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1444 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1446 if (!ast_global_codegen (self->setter, ir, false) ||
1447 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1448 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1450 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1451 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1456 if (!ast_global_codegen (self->getter, ir, false) ||
1457 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1458 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1460 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1461 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1465 for (i = 0; i < self->expression.count; ++i) {
1466 vec_free(self->ir_values[i]->life);
1468 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1472 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1476 ast_expression_common *ec;
1481 irf = self->ir_func;
1483 compile_error(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1487 /* fill the parameter list */
1488 ec = &self->vtype->expression;
1489 for (i = 0; i < vec_size(ec->params); ++i)
1491 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1492 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1494 vec_push(irf->params, ec->params[i]->expression.vtype);
1495 if (!self->builtin) {
1496 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1501 if (self->builtin) {
1502 irf->builtin = self->builtin;
1506 if (!vec_size(self->blocks)) {
1507 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1511 self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1512 if (!self->curblock) {
1513 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1517 for (i = 0; i < vec_size(self->blocks); ++i) {
1518 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1519 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1523 /* TODO: check return types */
1524 if (!self->curblock->final)
1526 if (!self->vtype->expression.next ||
1527 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1529 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1531 else if (vec_size(self->curblock->entries))
1533 /* error("missing return"); */
1534 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1535 "control reaches end of non-void function (`%s`) via %s",
1536 self->name, self->curblock->label))
1540 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1546 /* Note, you will not see ast_block_codegen generate ir_blocks.
1547 * To the AST and the IR, blocks are 2 different things.
1548 * In the AST it represents a block of code, usually enclosed in
1549 * curly braces {...}.
1550 * While in the IR it represents a block in terms of control-flow.
1552 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1556 /* We don't use this
1557 * Note: an ast-representation using the comma-operator
1558 * of the form: (a, b, c) = x should not assign to c...
1561 compile_error(ast_ctx(self), "not an l-value (code-block)");
1565 if (self->expression.outr) {
1566 *out = self->expression.outr;
1570 /* output is NULL at first, we'll have each expression
1571 * assign to out output, thus, a comma-operator represention
1572 * using an ast_block will return the last generated value,
1573 * so: (b, c) + a executed both b and c, and returns c,
1574 * which is then added to a.
1578 /* generate locals */
1579 for (i = 0; i < vec_size(self->locals); ++i)
1581 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1583 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1588 for (i = 0; i < vec_size(self->exprs); ++i)
1590 ast_expression_codegen *gen;
1591 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1592 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1596 gen = self->exprs[i]->expression.codegen;
1597 if (!(*gen)(self->exprs[i], func, false, out))
1601 self->expression.outr = *out;
1606 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1608 ast_expression_codegen *cgen;
1609 ir_value *left = NULL;
1610 ir_value *right = NULL;
1614 ast_array_index *ai = NULL;
1616 if (lvalue && self->expression.outl) {
1617 *out = self->expression.outl;
1621 if (!lvalue && self->expression.outr) {
1622 *out = self->expression.outr;
1626 if (ast_istype(self->dest, ast_array_index))
1629 ai = (ast_array_index*)self->dest;
1630 idx = (ast_value*)ai->index;
1632 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1637 /* we need to call the setter */
1638 ir_value *iridx, *funval;
1642 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1646 arr = (ast_value*)ai->array;
1647 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1648 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1652 cgen = idx->expression.codegen;
1653 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1656 cgen = arr->setter->expression.codegen;
1657 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1660 cgen = self->source->expression.codegen;
1661 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1664 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1667 ir_call_param(call, iridx);
1668 ir_call_param(call, right);
1669 self->expression.outr = right;
1675 cgen = self->dest->expression.codegen;
1677 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1679 self->expression.outl = left;
1681 cgen = self->source->expression.codegen;
1683 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1686 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1688 self->expression.outr = right;
1691 /* Theoretically, an assinment returns its left side as an
1692 * lvalue, if we don't need an lvalue though, we return
1693 * the right side as an rvalue, otherwise we have to
1694 * somehow know whether or not we need to dereference the pointer
1695 * on the left side - that is: OP_LOAD if it was an address.
1696 * Also: in original QC we cannot OP_LOADP *anyway*.
1698 *out = (lvalue ? left : right);
1703 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1705 ast_expression_codegen *cgen;
1706 ir_value *left, *right;
1708 /* A binary operation cannot yield an l-value */
1710 compile_error(ast_ctx(self), "not an l-value (binop)");
1714 if (self->expression.outr) {
1715 *out = self->expression.outr;
1719 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1720 (self->op == INSTR_AND || self->op == INSTR_OR))
1722 /* short circuit evaluation */
1723 ir_block *other, *merge;
1724 ir_block *from_left, *from_right;
1728 /* prepare end-block */
1729 merge_id = vec_size(func->ir_func->blocks);
1730 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1732 /* generate the left expression */
1733 cgen = self->left->expression.codegen;
1734 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1736 /* remember the block */
1737 from_left = func->curblock;
1739 /* create a new block for the right expression */
1740 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1741 if (self->op == INSTR_AND) {
1742 /* on AND: left==true -> other */
1743 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1746 /* on OR: left==false -> other */
1747 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1750 /* use the likely flag */
1751 vec_last(func->curblock->instr)->likely = true;
1753 /* enter the right-expression's block */
1754 func->curblock = other;
1756 cgen = self->right->expression.codegen;
1757 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1759 /* remember block */
1760 from_right = func->curblock;
1762 /* jump to the merge block */
1763 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1766 vec_remove(func->ir_func->blocks, merge_id, 1);
1767 vec_push(func->ir_func->blocks, merge);
1769 func->curblock = merge;
1770 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1771 ast_function_label(func, "sce_value"),
1772 self->expression.vtype);
1773 ir_phi_add(phi, from_left, left);
1774 ir_phi_add(phi, from_right, right);
1775 *out = ir_phi_value(phi);
1779 if (!OPTS_FLAG(PERL_LOGIC)) {
1781 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1782 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1783 ast_function_label(func, "sce_bool_v"),
1787 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1788 ast_function_label(func, "sce_bool"),
1793 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
1794 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1795 ast_function_label(func, "sce_bool_s"),
1799 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1800 ast_function_label(func, "sce_bool"),
1806 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
1807 ast_function_label(func, "sce_bool"),
1808 INSTR_AND, *out, *out);
1814 self->expression.outr = *out;
1818 cgen = self->left->expression.codegen;
1819 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1822 cgen = self->right->expression.codegen;
1823 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1826 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1827 self->op, left, right);
1830 self->expression.outr = *out;
1835 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1837 ast_expression_codegen *cgen;
1838 ir_value *leftl = NULL, *leftr, *right, *bin;
1842 ast_array_index *ai = NULL;
1843 ir_value *iridx = NULL;
1845 if (lvalue && self->expression.outl) {
1846 *out = self->expression.outl;
1850 if (!lvalue && self->expression.outr) {
1851 *out = self->expression.outr;
1855 if (ast_istype(self->dest, ast_array_index))
1858 ai = (ast_array_index*)self->dest;
1859 idx = (ast_value*)ai->index;
1861 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1865 /* for a binstore we need both an lvalue and an rvalue for the left side */
1866 /* rvalue of destination! */
1868 cgen = idx->expression.codegen;
1869 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1872 cgen = self->dest->expression.codegen;
1873 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1876 /* source as rvalue only */
1877 cgen = self->source->expression.codegen;
1878 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1881 /* now the binary */
1882 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1883 self->opbin, leftr, right);
1884 self->expression.outr = bin;
1888 /* we need to call the setter */
1893 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1897 arr = (ast_value*)ai->array;
1898 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1899 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1903 cgen = arr->setter->expression.codegen;
1904 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1907 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1910 ir_call_param(call, iridx);
1911 ir_call_param(call, bin);
1912 self->expression.outr = bin;
1914 /* now store them */
1915 cgen = self->dest->expression.codegen;
1916 /* lvalue of destination */
1917 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1919 self->expression.outl = leftl;
1921 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
1923 self->expression.outr = bin;
1926 /* Theoretically, an assinment returns its left side as an
1927 * lvalue, if we don't need an lvalue though, we return
1928 * the right side as an rvalue, otherwise we have to
1929 * somehow know whether or not we need to dereference the pointer
1930 * on the left side - that is: OP_LOAD if it was an address.
1931 * Also: in original QC we cannot OP_LOADP *anyway*.
1933 *out = (lvalue ? leftl : bin);
1938 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1940 ast_expression_codegen *cgen;
1943 /* An unary operation cannot yield an l-value */
1945 compile_error(ast_ctx(self), "not an l-value (binop)");
1949 if (self->expression.outr) {
1950 *out = self->expression.outr;
1954 cgen = self->operand->expression.codegen;
1956 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1959 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
1963 self->expression.outr = *out;
1968 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1970 ast_expression_codegen *cgen;
1975 /* In the context of a return operation, we don't actually return
1979 compile_error(ast_ctx(self), "return-expression is not an l-value");
1983 if (self->expression.outr) {
1984 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1987 self->expression.outr = (ir_value*)1;
1989 if (self->operand) {
1990 cgen = self->operand->expression.codegen;
1992 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1995 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
1998 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2005 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2007 ast_expression_codegen *cgen;
2008 ir_value *ent, *field;
2010 /* This function needs to take the 'lvalue' flag into account!
2011 * As lvalue we provide a field-pointer, as rvalue we provide the
2015 if (lvalue && self->expression.outl) {
2016 *out = self->expression.outl;
2020 if (!lvalue && self->expression.outr) {
2021 *out = self->expression.outr;
2025 cgen = self->entity->expression.codegen;
2026 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2029 cgen = self->field->expression.codegen;
2030 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2035 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2038 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2039 ent, field, self->expression.vtype);
2040 /* Done AFTER error checking:
2041 codegen_output_type(self, *out);
2045 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2046 (lvalue ? "ADDRESS" : "FIELD"),
2047 type_name[self->expression.vtype]);
2051 codegen_output_type(self, *out);
2054 self->expression.outl = *out;
2056 self->expression.outr = *out;
2058 /* Hm that should be it... */
2062 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2064 ast_expression_codegen *cgen;
2067 /* in QC this is always an lvalue */
2069 if (self->expression.outl) {
2070 *out = self->expression.outl;
2074 cgen = self->owner->expression.codegen;
2075 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
2078 if (vec->vtype != TYPE_VECTOR &&
2079 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2084 *out = ir_value_vector_member(vec, self->field);
2085 self->expression.outl = *out;
2087 return (*out != NULL);
2090 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2095 if (!lvalue && self->expression.outr) {
2096 *out = self->expression.outr;
2098 if (lvalue && self->expression.outl) {
2099 *out = self->expression.outl;
2102 if (!ast_istype(self->array, ast_value)) {
2103 compile_error(ast_ctx(self), "array indexing this way is not supported");
2104 /* note this would actually be pointer indexing because the left side is
2105 * not an actual array but (hopefully) an indexable expression.
2106 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2107 * support this path will be filled.
2112 arr = (ast_value*)self->array;
2113 idx = (ast_value*)self->index;
2115 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2116 /* Time to use accessor functions */
2117 ast_expression_codegen *cgen;
2118 ir_value *iridx, *funval;
2122 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2127 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2131 cgen = self->index->expression.codegen;
2132 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2135 cgen = arr->getter->expression.codegen;
2136 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2139 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2142 ir_call_param(call, iridx);
2144 *out = ir_call_value(call);
2145 self->expression.outr = *out;
2149 if (idx->expression.vtype == TYPE_FLOAT) {
2150 unsigned int arridx = idx->constval.vfloat;
2151 if (arridx >= self->array->expression.count)
2153 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2156 *out = arr->ir_values[arridx];
2158 else if (idx->expression.vtype == TYPE_INTEGER) {
2159 unsigned int arridx = idx->constval.vint;
2160 if (arridx >= self->array->expression.count)
2162 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2165 *out = arr->ir_values[arridx];
2168 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2174 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2176 ast_expression_codegen *cgen;
2184 ir_block *ontrue_endblock = NULL;
2185 ir_block *onfalse_endblock = NULL;
2186 ir_block *merge = NULL;
2188 /* We don't output any value, thus also don't care about r/lvalue */
2192 if (self->expression.outr) {
2193 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2196 self->expression.outr = (ir_value*)1;
2198 /* generate the condition */
2199 cgen = self->cond->expression.codegen;
2200 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2202 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2203 cond = func->curblock;
2207 if (self->on_true) {
2208 /* create on-true block */
2209 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2213 /* enter the block */
2214 func->curblock = ontrue;
2217 cgen = self->on_true->expression.codegen;
2218 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2221 /* we now need to work from the current endpoint */
2222 ontrue_endblock = func->curblock;
2227 if (self->on_false) {
2228 /* create on-false block */
2229 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2233 /* enter the block */
2234 func->curblock = onfalse;
2237 cgen = self->on_false->expression.codegen;
2238 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2241 /* we now need to work from the current endpoint */
2242 onfalse_endblock = func->curblock;
2246 /* Merge block were they all merge in to */
2247 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2249 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2252 /* add jumps ot the merge block */
2253 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2255 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2258 /* Now enter the merge block */
2259 func->curblock = merge;
2262 /* we create the if here, that way all blocks are ordered :)
2264 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2265 (ontrue ? ontrue : merge),
2266 (onfalse ? onfalse : merge)))
2274 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2276 ast_expression_codegen *cgen;
2279 ir_value *trueval, *falseval;
2282 ir_block *cond = func->curblock;
2283 ir_block *cond_out = NULL;
2284 ir_block *ontrue, *ontrue_out = NULL;
2285 ir_block *onfalse, *onfalse_out = NULL;
2288 /* Ternary can never create an lvalue... */
2292 /* In theory it shouldn't be possible to pass through a node twice, but
2293 * in case we add any kind of optimization pass for the AST itself, it
2294 * may still happen, thus we remember a created ir_value and simply return one
2295 * if it already exists.
2297 if (self->expression.outr) {
2298 *out = self->expression.outr;
2302 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2304 /* generate the condition */
2305 func->curblock = cond;
2306 cgen = self->cond->expression.codegen;
2307 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2309 cond_out = func->curblock;
2311 /* create on-true block */
2312 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2317 /* enter the block */
2318 func->curblock = ontrue;
2321 cgen = self->on_true->expression.codegen;
2322 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2325 ontrue_out = func->curblock;
2328 /* create on-false block */
2329 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2334 /* enter the block */
2335 func->curblock = onfalse;
2338 cgen = self->on_false->expression.codegen;
2339 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2342 onfalse_out = func->curblock;
2345 /* create merge block */
2346 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2349 /* jump to merge block */
2350 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2352 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2355 /* create if instruction */
2356 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2359 /* Now enter the merge block */
2360 func->curblock = merge;
2362 /* Here, now, we need a PHI node
2363 * but first some sanity checking...
2365 if (trueval->vtype != falseval->vtype) {
2366 /* error("ternary with different types on the two sides"); */
2371 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), trueval->vtype);
2374 ir_phi_add(phi, ontrue_out, trueval);
2375 ir_phi_add(phi, onfalse_out, falseval);
2377 self->expression.outr = ir_phi_value(phi);
2378 *out = self->expression.outr;
2380 codegen_output_type(self, *out);
2385 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2387 ast_expression_codegen *cgen;
2389 ir_value *dummy = NULL;
2390 ir_value *precond = NULL;
2391 ir_value *postcond = NULL;
2393 /* Since we insert some jumps "late" so we have blocks
2394 * ordered "nicely", we need to keep track of the actual end-blocks
2395 * of expressions to add the jumps to.
2397 ir_block *bbody = NULL, *end_bbody = NULL;
2398 ir_block *bprecond = NULL, *end_bprecond = NULL;
2399 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2400 ir_block *bincrement = NULL, *end_bincrement = NULL;
2401 ir_block *bout = NULL, *bin = NULL;
2403 /* let's at least move the outgoing block to the end */
2406 /* 'break' and 'continue' need to be able to find the right blocks */
2407 ir_block *bcontinue = NULL;
2408 ir_block *bbreak = NULL;
2410 ir_block *old_bcontinue = NULL;
2411 ir_block *old_bbreak = NULL;
2413 ir_block *tmpblock = NULL;
2418 if (self->expression.outr) {
2419 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2422 self->expression.outr = (ir_value*)1;
2425 * Should we ever need some kind of block ordering, better make this function
2426 * move blocks around than write a block ordering algorithm later... after all
2427 * the ast and ir should work together, not against each other.
2430 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2431 * anyway if for example it contains a ternary.
2435 cgen = self->initexpr->expression.codegen;
2436 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2440 /* Store the block from which we enter this chaos */
2441 bin = func->curblock;
2443 /* The pre-loop condition needs its own block since we
2444 * need to be able to jump to the start of that expression.
2448 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2452 /* the pre-loop-condition the least important place to 'continue' at */
2453 bcontinue = bprecond;
2456 func->curblock = bprecond;
2459 cgen = self->precond->expression.codegen;
2460 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2463 end_bprecond = func->curblock;
2465 bprecond = end_bprecond = NULL;
2468 /* Now the next blocks won't be ordered nicely, but we need to
2469 * generate them this early for 'break' and 'continue'.
2471 if (self->increment) {
2472 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2475 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2477 bincrement = end_bincrement = NULL;
2480 if (self->postcond) {
2481 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2484 bcontinue = bpostcond; /* postcond comes before the increment */
2486 bpostcond = end_bpostcond = NULL;
2489 bout_id = vec_size(func->ir_func->blocks);
2490 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2495 /* The loop body... */
2496 /* if (self->body) */
2498 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2503 func->curblock = bbody;
2505 old_bbreak = func->breakblock;
2506 old_bcontinue = func->continueblock;
2507 func->breakblock = bbreak;
2508 func->continueblock = bcontinue;
2509 if (!func->continueblock)
2510 func->continueblock = bbody;
2514 cgen = self->body->expression.codegen;
2515 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2519 end_bbody = func->curblock;
2520 func->breakblock = old_bbreak;
2521 func->continueblock = old_bcontinue;
2524 /* post-loop-condition */
2528 func->curblock = bpostcond;
2531 cgen = self->postcond->expression.codegen;
2532 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2535 end_bpostcond = func->curblock;
2538 /* The incrementor */
2539 if (self->increment)
2542 func->curblock = bincrement;
2545 cgen = self->increment->expression.codegen;
2546 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2549 end_bincrement = func->curblock;
2552 /* In any case now, we continue from the outgoing block */
2553 func->curblock = bout;
2555 /* Now all blocks are in place */
2556 /* From 'bin' we jump to whatever comes first */
2557 if (bprecond) tmpblock = bprecond;
2558 else if (bbody) tmpblock = bbody;
2559 else if (bpostcond) tmpblock = bpostcond;
2560 else tmpblock = bout;
2561 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2567 ir_block *ontrue, *onfalse;
2568 if (bbody) ontrue = bbody;
2569 else if (bincrement) ontrue = bincrement;
2570 else if (bpostcond) ontrue = bpostcond;
2571 else ontrue = bprecond;
2573 if (self->pre_not) {
2578 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2585 if (bincrement) tmpblock = bincrement;
2586 else if (bpostcond) tmpblock = bpostcond;
2587 else if (bprecond) tmpblock = bprecond;
2588 else tmpblock = bbody;
2589 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2593 /* from increment */
2596 if (bpostcond) tmpblock = bpostcond;
2597 else if (bprecond) tmpblock = bprecond;
2598 else if (bbody) tmpblock = bbody;
2599 else tmpblock = bout;
2600 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2607 ir_block *ontrue, *onfalse;
2608 if (bprecond) ontrue = bprecond;
2609 else if (bbody) ontrue = bbody;
2610 else if (bincrement) ontrue = bincrement;
2611 else ontrue = bpostcond;
2613 if (self->post_not) {
2618 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2622 /* Move 'bout' to the end */
2623 vec_remove(func->ir_func->blocks, bout_id, 1);
2624 vec_push(func->ir_func->blocks, bout);
2629 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2636 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2640 if (self->expression.outr) {
2641 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2644 self->expression.outr = (ir_value*)1;
2646 if (self->is_continue)
2647 target = func->continueblock;
2649 target = func->breakblock;
2652 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2656 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2661 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2663 ast_expression_codegen *cgen;
2665 ast_switch_case *def_case = NULL;
2666 ir_block *def_bfall = NULL;
2667 ir_block *def_bfall_to = NULL;
2668 bool set_def_bfall_to = false;
2670 ir_value *dummy = NULL;
2671 ir_value *irop = NULL;
2672 ir_block *old_break = NULL;
2673 ir_block *bout = NULL;
2674 ir_block *bfall = NULL;
2682 compile_error(ast_ctx(self), "switch expression is not an l-value");
2686 if (self->expression.outr) {
2687 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2690 self->expression.outr = (ir_value*)1;
2695 cgen = self->operand->expression.codegen;
2696 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2699 if (!vec_size(self->cases))
2702 cmpinstr = type_eq_instr[irop->vtype];
2703 if (cmpinstr >= AINSTR_END) {
2704 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2705 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2709 bout_id = vec_size(func->ir_func->blocks);
2710 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2714 /* setup the break block */
2715 old_break = func->breakblock;
2716 func->breakblock = bout;
2718 /* Now create all cases */
2719 for (c = 0; c < vec_size(self->cases); ++c) {
2720 ir_value *cond, *val;
2721 ir_block *bcase, *bnot;
2724 ast_switch_case *swcase = &self->cases[c];
2726 if (swcase->value) {
2727 /* A regular case */
2728 /* generate the condition operand */
2729 cgen = swcase->value->expression.codegen;
2730 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2732 /* generate the condition */
2733 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2737 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2738 bnot_id = vec_size(func->ir_func->blocks);
2739 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2740 if (!bcase || !bnot)
2742 if (set_def_bfall_to) {
2743 set_def_bfall_to = false;
2744 def_bfall_to = bcase;
2746 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2749 /* Make the previous case-end fall through */
2750 if (bfall && !bfall->final) {
2751 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2755 /* enter the case */
2756 func->curblock = bcase;
2757 cgen = swcase->code->expression.codegen;
2758 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2761 /* remember this block to fall through from */
2762 bfall = func->curblock;
2764 /* enter the else and move it down */
2765 func->curblock = bnot;
2766 vec_remove(func->ir_func->blocks, bnot_id, 1);
2767 vec_push(func->ir_func->blocks, bnot);
2769 /* The default case */
2770 /* Remember where to fall through from: */
2773 /* remember which case it was */
2775 /* And the next case will be remembered */
2776 set_def_bfall_to = true;
2780 /* Jump from the last bnot to bout */
2781 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2783 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2788 /* If there was a default case, put it down here */
2792 /* No need to create an extra block */
2793 bcase = func->curblock;
2795 /* Insert the fallthrough jump */
2796 if (def_bfall && !def_bfall->final) {
2797 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2801 /* Now generate the default code */
2802 cgen = def_case->code->expression.codegen;
2803 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2806 /* see if we need to fall through */
2807 if (def_bfall_to && !func->curblock->final)
2809 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2814 /* Jump from the last bnot to bout */
2815 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2817 /* enter the outgoing block */
2818 func->curblock = bout;
2820 /* restore the break block */
2821 func->breakblock = old_break;
2823 /* Move 'bout' to the end, it's nicer */
2824 vec_remove(func->ir_func->blocks, bout_id, 1);
2825 vec_push(func->ir_func->blocks, bout);
2830 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2837 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2841 /* simply create a new block and jump to it */
2842 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2843 if (!self->irblock) {
2844 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2847 if (!func->curblock->final) {
2848 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2852 /* enter the new block */
2853 func->curblock = self->irblock;
2855 /* Generate all the leftover gotos */
2856 for (i = 0; i < vec_size(self->gotos); ++i) {
2857 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2864 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2868 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2872 if (self->target->irblock) {
2873 if (self->irblock_from) {
2874 /* we already tried once, this is the callback */
2875 self->irblock_from->final = false;
2876 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2877 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2883 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
2884 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2891 /* the target has not yet been created...
2892 * close this block in a sneaky way:
2894 func->curblock->final = true;
2895 self->irblock_from = func->curblock;
2896 ast_label_register_goto(self->target, self);
2902 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2904 ast_expression_codegen *cgen;
2906 ir_instr *callinstr;
2909 ir_value *funval = NULL;
2911 /* return values are never lvalues */
2913 compile_error(ast_ctx(self), "not an l-value (function call)");
2917 if (self->expression.outr) {
2918 *out = self->expression.outr;
2922 cgen = self->func->expression.codegen;
2923 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2931 for (i = 0; i < vec_size(self->params); ++i)
2934 ast_expression *expr = self->params[i];
2936 cgen = expr->expression.codegen;
2937 if (!(*cgen)(expr, func, false, ¶m))
2941 vec_push(params, param);
2944 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
2945 ast_function_label(func, "call"),
2946 funval, !!(self->func->expression.flags & AST_FLAG_NORETURN));
2950 for (i = 0; i < vec_size(params); ++i) {
2951 ir_call_param(callinstr, params[i]);
2954 *out = ir_call_value(callinstr);
2955 self->expression.outr = *out;
2957 codegen_output_type(self, *out);