6 * Permission is hereby granted, free of charge, to any person obtaining a copy of
7 * this software and associated documentation files (the "Software"), to deal in
8 * the Software without restriction, including without limitation the rights to
9 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
10 * of the Software, and to permit persons to whom the Software is furnished to do
11 * so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
31 #define ast_instantiate(T, ctx, destroyfn) \
32 T* self = (T*)mem_a(sizeof(T)); \
36 ast_node_init((ast_node*)self, ctx, TYPE_##T); \
37 ( (ast_node*)self )->node.destroy = (ast_node_delete*)destroyfn
40 /* It must not be possible to get here. */
41 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
44 con_err("ast node missing destroy()\n");
48 /* Initialize main ast node aprts */
49 static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
51 self->node.context = ctx;
52 self->node.destroy = &_ast_node_destroy;
53 self->node.keep = false;
54 self->node.nodetype = nodetype;
55 self->node.side_effects = false;
58 /* weight and side effects */
59 static void _ast_propagate_effects(ast_node *self, ast_node *other)
61 if (ast_side_effects(other))
62 ast_side_effects(self) = true;
64 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
66 /* General expression initialization */
67 static void ast_expression_init(ast_expression *self,
68 ast_expression_codegen *codegen)
70 self->expression.codegen = codegen;
71 self->expression.vtype = TYPE_VOID;
72 self->expression.next = NULL;
73 self->expression.outl = NULL;
74 self->expression.outr = NULL;
75 self->expression.params = NULL;
76 self->expression.count = 0;
77 self->expression.flags = 0;
80 static void ast_expression_delete(ast_expression *self)
83 if (self->expression.next)
84 ast_delete(self->expression.next);
85 for (i = 0; i < vec_size(self->expression.params); ++i) {
86 ast_delete(self->expression.params[i]);
88 vec_free(self->expression.params);
91 static void ast_expression_delete_full(ast_expression *self)
93 ast_expression_delete(self);
97 ast_value* ast_value_copy(const ast_value *self)
100 const ast_expression_common *fromex;
101 ast_expression_common *selfex;
102 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
103 if (self->expression.next) {
104 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
105 if (!cp->expression.next) {
106 ast_value_delete(cp);
110 fromex = &self->expression;
111 selfex = &cp->expression;
112 selfex->count = fromex->count;
113 selfex->flags = fromex->flags;
114 for (i = 0; i < vec_size(fromex->params); ++i) {
115 ast_value *v = ast_value_copy(fromex->params[i]);
117 ast_value_delete(cp);
120 vec_push(selfex->params, v);
125 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
128 const ast_expression_common *fromex;
129 ast_expression_common *selfex;
130 self->expression.vtype = other->expression.vtype;
131 if (other->expression.next) {
132 self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
133 if (!self->expression.next)
136 fromex = &other->expression;
137 selfex = &self->expression;
138 selfex->count = fromex->count;
139 selfex->flags = fromex->flags;
140 for (i = 0; i < vec_size(fromex->params); ++i) {
141 ast_value *v = ast_value_copy(fromex->params[i]);
144 vec_push(selfex->params, v);
149 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
151 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
152 ast_expression_init(self, NULL);
153 self->expression.codegen = NULL;
154 self->expression.next = NULL;
155 self->expression.vtype = vtype;
159 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
162 const ast_expression_common *fromex;
163 ast_expression_common *selfex;
169 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
170 ast_expression_init(self, NULL);
172 fromex = &ex->expression;
173 selfex = &self->expression;
175 /* This may never be codegen()d */
176 selfex->codegen = NULL;
178 selfex->vtype = fromex->vtype;
181 selfex->next = ast_type_copy(ctx, fromex->next);
183 ast_expression_delete_full(self);
190 selfex->count = fromex->count;
191 selfex->flags = fromex->flags;
192 for (i = 0; i < vec_size(fromex->params); ++i) {
193 ast_value *v = ast_value_copy(fromex->params[i]);
195 ast_expression_delete_full(self);
198 vec_push(selfex->params, v);
205 bool ast_compare_type(ast_expression *a, ast_expression *b)
207 if (a->expression.vtype != b->expression.vtype)
209 if (!a->expression.next != !b->expression.next)
211 if (vec_size(a->expression.params) != vec_size(b->expression.params))
213 if ((a->expression.flags & AST_FLAG_TYPE_MASK) !=
214 (b->expression.flags & AST_FLAG_TYPE_MASK) )
218 if (vec_size(a->expression.params)) {
220 for (i = 0; i < vec_size(a->expression.params); ++i) {
221 if (!ast_compare_type((ast_expression*)a->expression.params[i],
222 (ast_expression*)b->expression.params[i]))
226 if (a->expression.next)
227 return ast_compare_type(a->expression.next, b->expression.next);
231 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
238 if (pos + 6 >= bufsize)
240 strcpy(buf + pos, "(null)");
244 if (pos + 1 >= bufsize)
247 switch (e->expression.vtype) {
249 strcpy(buf + pos, "(variant)");
254 return ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
257 if (pos + 3 >= bufsize)
261 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
262 if (pos + 1 >= bufsize)
268 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
269 if (pos + 2 >= bufsize)
271 if (!vec_size(e->expression.params)) {
277 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[0]), buf, bufsize, pos);
278 for (i = 1; i < vec_size(e->expression.params); ++i) {
279 if (pos + 2 >= bufsize)
283 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[i]), buf, bufsize, pos);
285 if (pos + 1 >= bufsize)
291 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
292 if (pos + 1 >= bufsize)
295 pos += snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->expression.count);
296 if (pos + 1 >= bufsize)
302 typestr = type_name[e->expression.vtype];
303 typelen = strlen(typestr);
304 if (pos + typelen >= bufsize)
306 strcpy(buf + pos, typestr);
307 return pos + typelen;
311 buf[bufsize-3] = '.';
312 buf[bufsize-2] = '.';
313 buf[bufsize-1] = '.';
317 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
319 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
323 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
325 ast_instantiate(ast_value, ctx, ast_value_delete);
326 ast_expression_init((ast_expression*)self,
327 (ast_expression_codegen*)&ast_value_codegen);
328 self->expression.node.keep = true; /* keep */
330 self->name = name ? util_strdup(name) : NULL;
331 self->expression.vtype = t;
332 self->expression.next = NULL;
333 self->isfield = false;
335 self->hasvalue = false;
337 memset(&self->constval, 0, sizeof(self->constval));
340 self->ir_values = NULL;
341 self->ir_value_count = 0;
350 void ast_value_delete(ast_value* self)
353 mem_d((void*)self->name);
354 if (self->hasvalue) {
355 switch (self->expression.vtype)
358 mem_d((void*)self->constval.vstring);
361 /* unlink us from the function node */
362 self->constval.vfunc->vtype = NULL;
364 /* NOTE: delete function? currently collected in
365 * the parser structure
372 mem_d(self->ir_values);
377 ast_expression_delete((ast_expression*)self);
381 void ast_value_params_add(ast_value *self, ast_value *p)
383 vec_push(self->expression.params, p);
386 bool ast_value_set_name(ast_value *self, const char *name)
389 mem_d((void*)self->name);
390 self->name = util_strdup(name);
394 ast_binary* ast_binary_new(lex_ctx ctx, int op,
395 ast_expression* left, ast_expression* right)
397 ast_instantiate(ast_binary, ctx, ast_binary_delete);
398 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
404 ast_propagate_effects(self, left);
405 ast_propagate_effects(self, right);
407 if (op >= INSTR_EQ_F && op <= INSTR_GT)
408 self->expression.vtype = TYPE_FLOAT;
409 else if (op == INSTR_AND || op == INSTR_OR) {
410 if (OPTS_FLAG(PERL_LOGIC))
411 ast_type_adopt(self, right);
413 self->expression.vtype = TYPE_FLOAT;
415 else if (op == INSTR_BITAND || op == INSTR_BITOR)
416 self->expression.vtype = TYPE_FLOAT;
417 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
418 self->expression.vtype = TYPE_VECTOR;
419 else if (op == INSTR_MUL_V)
420 self->expression.vtype = TYPE_FLOAT;
422 self->expression.vtype = left->expression.vtype;
427 void ast_binary_delete(ast_binary *self)
429 ast_unref(self->left);
430 ast_unref(self->right);
431 ast_expression_delete((ast_expression*)self);
435 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
436 ast_expression* left, ast_expression* right)
438 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
439 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
441 ast_side_effects(self) = true;
443 self->opstore = storop;
446 self->source = right;
448 self->keep_dest = false;
450 if (!ast_type_adopt(self, left)) {
458 void ast_binstore_delete(ast_binstore *self)
460 if (!self->keep_dest)
461 ast_unref(self->dest);
462 ast_unref(self->source);
463 ast_expression_delete((ast_expression*)self);
467 ast_unary* ast_unary_new(lex_ctx ctx, int op,
468 ast_expression *expr)
470 ast_instantiate(ast_unary, ctx, ast_unary_delete);
471 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
474 self->operand = expr;
476 ast_propagate_effects(self, expr);
478 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
479 self->expression.vtype = TYPE_FLOAT;
481 compile_error(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
486 void ast_unary_delete(ast_unary *self)
488 if (self->operand) ast_unref(self->operand);
489 ast_expression_delete((ast_expression*)self);
493 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
495 ast_instantiate(ast_return, ctx, ast_return_delete);
496 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
498 self->operand = expr;
501 ast_propagate_effects(self, expr);
506 void ast_return_delete(ast_return *self)
509 ast_unref(self->operand);
510 ast_expression_delete((ast_expression*)self);
514 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
516 if (field->expression.vtype != TYPE_FIELD) {
517 compile_error(ctx, "ast_entfield_new with expression not of type field");
520 return ast_entfield_new_force(ctx, entity, field, field->expression.next);
523 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
525 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
529 /* Error: field has no type... */
533 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
535 self->entity = entity;
537 ast_propagate_effects(self, entity);
538 ast_propagate_effects(self, field);
540 if (!ast_type_adopt(self, outtype)) {
541 ast_entfield_delete(self);
548 void ast_entfield_delete(ast_entfield *self)
550 ast_unref(self->entity);
551 ast_unref(self->field);
552 ast_expression_delete((ast_expression*)self);
556 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field, const char *name)
558 ast_instantiate(ast_member, ctx, ast_member_delete);
564 if (owner->expression.vtype != TYPE_VECTOR &&
565 owner->expression.vtype != TYPE_FIELD) {
566 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
571 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
572 self->expression.node.keep = true; /* keep */
574 if (owner->expression.vtype == TYPE_VECTOR) {
575 self->expression.vtype = TYPE_FLOAT;
576 self->expression.next = NULL;
578 self->expression.vtype = TYPE_FIELD;
579 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
582 self->rvalue = false;
584 ast_propagate_effects(self, owner);
588 self->name = util_strdup(name);
595 void ast_member_delete(ast_member *self)
597 /* The owner is always an ast_value, which has .keep=true,
598 * also: ast_members are usually deleted after the owner, thus
599 * this will cause invalid access
600 ast_unref(self->owner);
601 * once we allow (expression).x to access a vector-member, we need
602 * to change this: preferably by creating an alternate ast node for this
603 * purpose that is not garbage-collected.
605 ast_expression_delete((ast_expression*)self);
609 bool ast_member_set_name(ast_member *self, const char *name)
612 mem_d((void*)self->name);
613 self->name = util_strdup(name);
617 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
619 ast_expression *outtype;
620 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
622 outtype = array->expression.next;
625 /* Error: field has no type... */
629 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
633 ast_propagate_effects(self, array);
634 ast_propagate_effects(self, index);
636 if (!ast_type_adopt(self, outtype)) {
637 ast_array_index_delete(self);
640 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
641 if (self->expression.vtype != TYPE_ARRAY) {
642 compile_error(ast_ctx(self), "array_index node on type");
643 ast_array_index_delete(self);
646 self->array = outtype;
647 self->expression.vtype = TYPE_FIELD;
653 void ast_array_index_delete(ast_array_index *self)
655 ast_unref(self->array);
656 ast_unref(self->index);
657 ast_expression_delete((ast_expression*)self);
661 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
663 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
664 if (!ontrue && !onfalse) {
665 /* because it is invalid */
669 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
672 self->on_true = ontrue;
673 self->on_false = onfalse;
674 ast_propagate_effects(self, cond);
676 ast_propagate_effects(self, ontrue);
678 ast_propagate_effects(self, onfalse);
683 void ast_ifthen_delete(ast_ifthen *self)
685 ast_unref(self->cond);
687 ast_unref(self->on_true);
689 ast_unref(self->on_false);
690 ast_expression_delete((ast_expression*)self);
694 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
696 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
697 /* This time NEITHER must be NULL */
698 if (!ontrue || !onfalse) {
702 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
705 self->on_true = ontrue;
706 self->on_false = onfalse;
707 ast_propagate_effects(self, cond);
708 ast_propagate_effects(self, ontrue);
709 ast_propagate_effects(self, onfalse);
711 if (!ast_type_adopt(self, ontrue)) {
712 ast_ternary_delete(self);
719 void ast_ternary_delete(ast_ternary *self)
721 ast_unref(self->cond);
722 ast_unref(self->on_true);
723 ast_unref(self->on_false);
724 ast_expression_delete((ast_expression*)self);
728 ast_loop* ast_loop_new(lex_ctx ctx,
729 ast_expression *initexpr,
730 ast_expression *precond, bool pre_not,
731 ast_expression *postcond, bool post_not,
732 ast_expression *increment,
733 ast_expression *body)
735 ast_instantiate(ast_loop, ctx, ast_loop_delete);
736 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
738 self->initexpr = initexpr;
739 self->precond = precond;
740 self->postcond = postcond;
741 self->increment = increment;
744 self->pre_not = pre_not;
745 self->post_not = post_not;
748 ast_propagate_effects(self, initexpr);
750 ast_propagate_effects(self, precond);
752 ast_propagate_effects(self, postcond);
754 ast_propagate_effects(self, increment);
756 ast_propagate_effects(self, body);
761 void ast_loop_delete(ast_loop *self)
764 ast_unref(self->initexpr);
766 ast_unref(self->precond);
768 ast_unref(self->postcond);
770 ast_unref(self->increment);
772 ast_unref(self->body);
773 ast_expression_delete((ast_expression*)self);
777 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont, unsigned int levels)
779 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
780 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
782 self->is_continue = iscont;
783 self->levels = levels;
788 void ast_breakcont_delete(ast_breakcont *self)
790 ast_expression_delete((ast_expression*)self);
794 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
796 ast_instantiate(ast_switch, ctx, ast_switch_delete);
797 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
802 ast_propagate_effects(self, op);
807 void ast_switch_delete(ast_switch *self)
810 ast_unref(self->operand);
812 for (i = 0; i < vec_size(self->cases); ++i) {
813 if (self->cases[i].value)
814 ast_unref(self->cases[i].value);
815 ast_unref(self->cases[i].code);
817 vec_free(self->cases);
819 ast_expression_delete((ast_expression*)self);
823 ast_label* ast_label_new(lex_ctx ctx, const char *name)
825 ast_instantiate(ast_label, ctx, ast_label_delete);
826 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
828 self->name = util_strdup(name);
829 self->irblock = NULL;
835 void ast_label_delete(ast_label *self)
837 mem_d((void*)self->name);
838 vec_free(self->gotos);
839 ast_expression_delete((ast_expression*)self);
843 void ast_label_register_goto(ast_label *self, ast_goto *g)
845 vec_push(self->gotos, g);
848 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
850 ast_instantiate(ast_goto, ctx, ast_goto_delete);
851 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
853 self->name = util_strdup(name);
855 self->irblock_from = NULL;
860 void ast_goto_delete(ast_goto *self)
862 mem_d((void*)self->name);
863 ast_expression_delete((ast_expression*)self);
867 void ast_goto_set_label(ast_goto *self, ast_label *label)
869 self->target = label;
872 ast_call* ast_call_new(lex_ctx ctx,
873 ast_expression *funcexpr)
875 ast_instantiate(ast_call, ctx, ast_call_delete);
876 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
878 ast_side_effects(self) = true;
881 self->func = funcexpr;
883 ast_type_adopt(self, funcexpr->expression.next);
888 void ast_call_delete(ast_call *self)
891 for (i = 0; i < vec_size(self->params); ++i)
892 ast_unref(self->params[i]);
893 vec_free(self->params);
896 ast_unref(self->func);
898 ast_expression_delete((ast_expression*)self);
902 bool ast_call_check_types(ast_call *self)
906 const ast_expression *func = self->func;
907 size_t count = vec_size(self->params);
908 if (count > vec_size(func->expression.params))
909 count = vec_size(func->expression.params);
911 for (i = 0; i < count; ++i) {
912 if (self->params[i]->expression.vtype != TYPE_NIL &&
913 !ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i])))
917 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
918 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
919 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
920 (unsigned int)(i+1), texp, tgot);
921 /* we don't immediately return */
928 ast_store* ast_store_new(lex_ctx ctx, int op,
929 ast_expression *dest, ast_expression *source)
931 ast_instantiate(ast_store, ctx, ast_store_delete);
932 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
934 ast_side_effects(self) = true;
938 self->source = source;
940 if (!ast_type_adopt(self, dest)) {
948 void ast_store_delete(ast_store *self)
950 ast_unref(self->dest);
951 ast_unref(self->source);
952 ast_expression_delete((ast_expression*)self);
956 ast_block* ast_block_new(lex_ctx ctx)
958 ast_instantiate(ast_block, ctx, ast_block_delete);
959 ast_expression_init((ast_expression*)self,
960 (ast_expression_codegen*)&ast_block_codegen);
964 self->collect = NULL;
969 bool ast_block_add_expr(ast_block *self, ast_expression *e)
971 ast_propagate_effects(self, e);
972 vec_push(self->exprs, e);
973 if (self->expression.next) {
974 ast_delete(self->expression.next);
975 self->expression.next = NULL;
977 if (!ast_type_adopt(self, e)) {
978 compile_error(ast_ctx(self), "internal error: failed to adopt type");
984 void ast_block_collect(ast_block *self, ast_expression *expr)
986 vec_push(self->collect, expr);
987 expr->expression.node.keep = true;
990 void ast_block_delete(ast_block *self)
993 for (i = 0; i < vec_size(self->exprs); ++i)
994 ast_unref(self->exprs[i]);
995 vec_free(self->exprs);
996 for (i = 0; i < vec_size(self->locals); ++i)
997 ast_delete(self->locals[i]);
998 vec_free(self->locals);
999 for (i = 0; i < vec_size(self->collect); ++i)
1000 ast_delete(self->collect[i]);
1001 vec_free(self->collect);
1002 ast_expression_delete((ast_expression*)self);
1006 bool ast_block_set_type(ast_block *self, ast_expression *from)
1008 if (self->expression.next)
1009 ast_delete(self->expression.next);
1010 if (!ast_type_adopt(self, from))
1015 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1017 ast_instantiate(ast_function, ctx, ast_function_delete);
1021 vtype->expression.vtype != TYPE_FUNCTION)
1023 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1025 (int)vtype->hasvalue,
1026 vtype->expression.vtype);
1031 self->vtype = vtype;
1032 self->name = name ? util_strdup(name) : NULL;
1033 self->blocks = NULL;
1035 self->labelcount = 0;
1038 self->ir_func = NULL;
1039 self->curblock = NULL;
1041 self->breakblocks = NULL;
1042 self->continueblocks = NULL;
1044 vtype->hasvalue = true;
1045 vtype->constval.vfunc = self;
1050 void ast_function_delete(ast_function *self)
1054 mem_d((void*)self->name);
1056 /* ast_value_delete(self->vtype); */
1057 self->vtype->hasvalue = false;
1058 self->vtype->constval.vfunc = NULL;
1059 /* We use unref - if it was stored in a global table it is supposed
1060 * to be deleted from *there*
1062 ast_unref(self->vtype);
1064 for (i = 0; i < vec_size(self->blocks); ++i)
1065 ast_delete(self->blocks[i]);
1066 vec_free(self->blocks);
1067 vec_free(self->breakblocks);
1068 vec_free(self->continueblocks);
1072 const char* ast_function_label(ast_function *self, const char *prefix)
1078 if (!opts.dump && !opts.dumpfin && !opts.debug)
1081 id = (self->labelcount++);
1082 len = strlen(prefix);
1084 from = self->labelbuf + sizeof(self->labelbuf)-1;
1087 *from-- = (id%10) + '0';
1091 memcpy(from - len, prefix, len);
1095 /*********************************************************************/
1097 * by convention you must never pass NULL to the 'ir_value **out'
1098 * parameter. If you really don't care about the output, pass a dummy.
1099 * But I can't imagine a pituation where the output is truly unnecessary.
1102 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1104 if (out->vtype == TYPE_FIELD)
1105 out->fieldtype = self->next->expression.vtype;
1106 if (out->vtype == TYPE_FUNCTION)
1107 out->outtype = self->next->expression.vtype;
1110 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1112 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1116 if (self->expression.vtype == TYPE_NIL) {
1117 *out = func->ir_func->owner->nil;
1120 /* NOTE: This is the codegen for a variable used in an expression.
1121 * It is not the codegen to generate the value. For this purpose,
1122 * ast_local_codegen and ast_global_codegen are to be used before this
1123 * is executed. ast_function_codegen should take care of its locals,
1124 * and the ast-user should take care of ast_global_codegen to be used
1125 * on all the globals.
1128 char tname[1024]; /* typename is reserved in C++ */
1129 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1130 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1137 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1141 if (self->expression.vtype == TYPE_NIL) {
1142 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1146 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1148 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1151 func->context = ast_ctx(self);
1152 func->value->context = ast_ctx(self);
1154 self->constval.vfunc->ir_func = func;
1155 self->ir_v = func->value;
1156 /* The function is filled later on ast_function_codegen... */
1160 if (isfield && self->expression.vtype == TYPE_FIELD) {
1161 ast_expression *fieldtype = self->expression.next;
1163 if (self->hasvalue) {
1164 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1168 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1173 ast_expression_common *elemtype;
1175 ast_value *array = (ast_value*)fieldtype;
1177 if (!ast_istype(fieldtype, ast_value)) {
1178 compile_error(ast_ctx(self), "internal error: ast_value required");
1182 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1183 if (!array->expression.count || array->expression.count > opts.max_array_size)
1184 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1186 elemtype = &array->expression.next->expression;
1187 vtype = elemtype->vtype;
1189 v = ir_builder_create_field(ir, self->name, vtype);
1191 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1194 v->context = ast_ctx(self);
1195 v->unique_life = true;
1197 array->ir_v = self->ir_v = v;
1199 namelen = strlen(self->name);
1200 name = (char*)mem_a(namelen + 16);
1201 strcpy(name, self->name);
1203 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1204 array->ir_values[0] = v;
1205 for (ai = 1; ai < array->expression.count; ++ai) {
1206 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1207 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1208 if (!array->ir_values[ai]) {
1210 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1213 array->ir_values[ai]->context = ast_ctx(self);
1214 array->ir_values[ai]->unique_life = true;
1215 array->ir_values[ai]->locked = true;
1221 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1224 v->context = ast_ctx(self);
1230 if (self->expression.vtype == TYPE_ARRAY) {
1235 ast_expression_common *elemtype = &self->expression.next->expression;
1236 int vtype = elemtype->vtype;
1238 /* same as with field arrays */
1239 if (!self->expression.count || self->expression.count > opts.max_array_size)
1240 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1242 v = ir_builder_create_global(ir, self->name, vtype);
1244 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1247 v->context = ast_ctx(self);
1248 v->unique_life = true;
1251 namelen = strlen(self->name);
1252 name = (char*)mem_a(namelen + 16);
1253 strcpy(name, self->name);
1255 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1256 self->ir_values[0] = v;
1257 for (ai = 1; ai < self->expression.count; ++ai) {
1258 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1259 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1260 if (!self->ir_values[ai]) {
1262 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1265 self->ir_values[ai]->context = ast_ctx(self);
1266 self->ir_values[ai]->unique_life = true;
1267 self->ir_values[ai]->locked = true;
1273 /* Arrays don't do this since there's no "array" value which spans across the
1276 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1278 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1281 codegen_output_type(self, v);
1282 v->context = ast_ctx(self);
1285 if (self->hasvalue) {
1286 switch (self->expression.vtype)
1289 if (!ir_value_set_float(v, self->constval.vfloat))
1293 if (!ir_value_set_vector(v, self->constval.vvec))
1297 if (!ir_value_set_string(v, self->constval.vstring))
1301 compile_error(ast_ctx(self), "TODO: global constant array");
1304 compile_error(ast_ctx(self), "global of type function not properly generated");
1306 /* Cannot generate an IR value for a function,
1307 * need a pointer pointing to a function rather.
1310 if (!self->constval.vfield) {
1311 compile_error(ast_ctx(self), "field constant without vfield set");
1314 if (!self->constval.vfield->ir_v) {
1315 compile_error(ast_ctx(self), "field constant generated before its field");
1318 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1322 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1327 /* link us to the ir_value */
1332 error: /* clean up */
1337 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1341 if (self->expression.vtype == TYPE_NIL) {
1342 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1346 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1348 /* Do we allow local functions? I think not...
1349 * this is NOT a function pointer atm.
1354 if (self->expression.vtype == TYPE_ARRAY) {
1359 ast_expression_common *elemtype = &self->expression.next->expression;
1360 int vtype = elemtype->vtype;
1362 func->flags |= IR_FLAG_HAS_ARRAYS;
1365 compile_error(ast_ctx(self), "array-parameters are not supported");
1369 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1370 if (!self->expression.count || self->expression.count > opts.max_array_size) {
1371 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1374 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1375 if (!self->ir_values) {
1376 compile_error(ast_ctx(self), "failed to allocate array values");
1380 v = ir_function_create_local(func, self->name, vtype, param);
1382 compile_error(ast_ctx(self), "ir_function_create_local failed");
1385 v->context = ast_ctx(self);
1386 v->unique_life = true;
1389 namelen = strlen(self->name);
1390 name = (char*)mem_a(namelen + 16);
1391 strcpy(name, self->name);
1393 self->ir_values[0] = v;
1394 for (ai = 1; ai < self->expression.count; ++ai) {
1395 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1396 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1397 if (!self->ir_values[ai]) {
1398 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1401 self->ir_values[ai]->context = ast_ctx(self);
1402 self->ir_values[ai]->unique_life = true;
1403 self->ir_values[ai]->locked = true;
1408 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1411 codegen_output_type(self, v);
1412 v->context = ast_ctx(self);
1415 /* A constant local... hmmm...
1416 * I suppose the IR will have to deal with this
1418 if (self->hasvalue) {
1419 switch (self->expression.vtype)
1422 if (!ir_value_set_float(v, self->constval.vfloat))
1426 if (!ir_value_set_vector(v, self->constval.vvec))
1430 if (!ir_value_set_string(v, self->constval.vstring))
1434 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1439 /* link us to the ir_value */
1443 if (!ast_generate_accessors(self, func->owner))
1447 error: /* clean up */
1452 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1455 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1456 if (!self->setter || !self->getter)
1458 for (i = 0; i < self->expression.count; ++i) {
1459 if (!self->ir_values) {
1460 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1463 if (!self->ir_values[i]) {
1464 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1467 if (self->ir_values[i]->life) {
1468 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1473 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1475 if (!ast_global_codegen (self->setter, ir, false) ||
1476 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1477 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1479 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1480 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1485 if (!ast_global_codegen (self->getter, ir, false) ||
1486 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1487 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1489 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1490 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1494 for (i = 0; i < self->expression.count; ++i) {
1495 vec_free(self->ir_values[i]->life);
1497 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1501 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1505 ast_expression_common *ec;
1510 irf = self->ir_func;
1512 compile_error(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1516 /* fill the parameter list */
1517 ec = &self->vtype->expression;
1518 for (i = 0; i < vec_size(ec->params); ++i)
1520 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1521 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1523 vec_push(irf->params, ec->params[i]->expression.vtype);
1524 if (!self->builtin) {
1525 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1530 if (self->builtin) {
1531 irf->builtin = self->builtin;
1535 if (!vec_size(self->blocks)) {
1536 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1540 self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1541 if (!self->curblock) {
1542 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1546 for (i = 0; i < vec_size(self->blocks); ++i) {
1547 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1548 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1552 /* TODO: check return types */
1553 if (!self->curblock->final)
1555 if (!self->vtype->expression.next ||
1556 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1558 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1560 else if (vec_size(self->curblock->entries))
1562 /* error("missing return"); */
1563 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1564 "control reaches end of non-void function (`%s`) via %s",
1565 self->name, self->curblock->label))
1569 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1575 /* Note, you will not see ast_block_codegen generate ir_blocks.
1576 * To the AST and the IR, blocks are 2 different things.
1577 * In the AST it represents a block of code, usually enclosed in
1578 * curly braces {...}.
1579 * While in the IR it represents a block in terms of control-flow.
1581 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1585 /* We don't use this
1586 * Note: an ast-representation using the comma-operator
1587 * of the form: (a, b, c) = x should not assign to c...
1590 compile_error(ast_ctx(self), "not an l-value (code-block)");
1594 if (self->expression.outr) {
1595 *out = self->expression.outr;
1599 /* output is NULL at first, we'll have each expression
1600 * assign to out output, thus, a comma-operator represention
1601 * using an ast_block will return the last generated value,
1602 * so: (b, c) + a executed both b and c, and returns c,
1603 * which is then added to a.
1607 /* generate locals */
1608 for (i = 0; i < vec_size(self->locals); ++i)
1610 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1612 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1617 for (i = 0; i < vec_size(self->exprs); ++i)
1619 ast_expression_codegen *gen;
1620 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1621 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1625 gen = self->exprs[i]->expression.codegen;
1626 if (!(*gen)(self->exprs[i], func, false, out))
1630 self->expression.outr = *out;
1635 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1637 ast_expression_codegen *cgen;
1638 ir_value *left = NULL;
1639 ir_value *right = NULL;
1643 ast_array_index *ai = NULL;
1645 if (lvalue && self->expression.outl) {
1646 *out = self->expression.outl;
1650 if (!lvalue && self->expression.outr) {
1651 *out = self->expression.outr;
1655 if (ast_istype(self->dest, ast_array_index))
1658 ai = (ast_array_index*)self->dest;
1659 idx = (ast_value*)ai->index;
1661 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1666 /* we need to call the setter */
1667 ir_value *iridx, *funval;
1671 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1675 arr = (ast_value*)ai->array;
1676 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1677 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1681 cgen = idx->expression.codegen;
1682 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1685 cgen = arr->setter->expression.codegen;
1686 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1689 cgen = self->source->expression.codegen;
1690 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1693 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1696 ir_call_param(call, iridx);
1697 ir_call_param(call, right);
1698 self->expression.outr = right;
1704 cgen = self->dest->expression.codegen;
1706 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1708 self->expression.outl = left;
1710 cgen = self->source->expression.codegen;
1712 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1715 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1717 self->expression.outr = right;
1720 /* Theoretically, an assinment returns its left side as an
1721 * lvalue, if we don't need an lvalue though, we return
1722 * the right side as an rvalue, otherwise we have to
1723 * somehow know whether or not we need to dereference the pointer
1724 * on the left side - that is: OP_LOAD if it was an address.
1725 * Also: in original QC we cannot OP_LOADP *anyway*.
1727 *out = (lvalue ? left : right);
1732 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1734 ast_expression_codegen *cgen;
1735 ir_value *left, *right;
1737 /* A binary operation cannot yield an l-value */
1739 compile_error(ast_ctx(self), "not an l-value (binop)");
1743 if (self->expression.outr) {
1744 *out = self->expression.outr;
1748 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1749 (self->op == INSTR_AND || self->op == INSTR_OR))
1751 /* short circuit evaluation */
1752 ir_block *other, *merge;
1753 ir_block *from_left, *from_right;
1757 /* prepare end-block */
1758 merge_id = vec_size(func->ir_func->blocks);
1759 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1761 /* generate the left expression */
1762 cgen = self->left->expression.codegen;
1763 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1765 /* remember the block */
1766 from_left = func->curblock;
1768 /* create a new block for the right expression */
1769 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1770 if (self->op == INSTR_AND) {
1771 /* on AND: left==true -> other */
1772 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1775 /* on OR: left==false -> other */
1776 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1779 /* use the likely flag */
1780 vec_last(func->curblock->instr)->likely = true;
1782 /* enter the right-expression's block */
1783 func->curblock = other;
1785 cgen = self->right->expression.codegen;
1786 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1788 /* remember block */
1789 from_right = func->curblock;
1791 /* jump to the merge block */
1792 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1795 vec_remove(func->ir_func->blocks, merge_id, 1);
1796 vec_push(func->ir_func->blocks, merge);
1798 func->curblock = merge;
1799 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1800 ast_function_label(func, "sce_value"),
1801 self->expression.vtype);
1802 ir_phi_add(phi, from_left, left);
1803 ir_phi_add(phi, from_right, right);
1804 *out = ir_phi_value(phi);
1808 if (!OPTS_FLAG(PERL_LOGIC)) {
1810 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1811 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1812 ast_function_label(func, "sce_bool_v"),
1816 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1817 ast_function_label(func, "sce_bool"),
1822 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
1823 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1824 ast_function_label(func, "sce_bool_s"),
1828 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1829 ast_function_label(func, "sce_bool"),
1835 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
1836 ast_function_label(func, "sce_bool"),
1837 INSTR_AND, *out, *out);
1843 self->expression.outr = *out;
1847 cgen = self->left->expression.codegen;
1848 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1851 cgen = self->right->expression.codegen;
1852 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1855 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1856 self->op, left, right);
1859 self->expression.outr = *out;
1864 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1866 ast_expression_codegen *cgen;
1867 ir_value *leftl = NULL, *leftr, *right, *bin;
1871 ast_array_index *ai = NULL;
1872 ir_value *iridx = NULL;
1874 if (lvalue && self->expression.outl) {
1875 *out = self->expression.outl;
1879 if (!lvalue && self->expression.outr) {
1880 *out = self->expression.outr;
1884 if (ast_istype(self->dest, ast_array_index))
1887 ai = (ast_array_index*)self->dest;
1888 idx = (ast_value*)ai->index;
1890 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1894 /* for a binstore we need both an lvalue and an rvalue for the left side */
1895 /* rvalue of destination! */
1897 cgen = idx->expression.codegen;
1898 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1901 cgen = self->dest->expression.codegen;
1902 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1905 /* source as rvalue only */
1906 cgen = self->source->expression.codegen;
1907 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1910 /* now the binary */
1911 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1912 self->opbin, leftr, right);
1913 self->expression.outr = bin;
1917 /* we need to call the setter */
1922 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1926 arr = (ast_value*)ai->array;
1927 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1928 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1932 cgen = arr->setter->expression.codegen;
1933 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1936 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1939 ir_call_param(call, iridx);
1940 ir_call_param(call, bin);
1941 self->expression.outr = bin;
1943 /* now store them */
1944 cgen = self->dest->expression.codegen;
1945 /* lvalue of destination */
1946 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1948 self->expression.outl = leftl;
1950 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
1952 self->expression.outr = bin;
1955 /* Theoretically, an assinment returns its left side as an
1956 * lvalue, if we don't need an lvalue though, we return
1957 * the right side as an rvalue, otherwise we have to
1958 * somehow know whether or not we need to dereference the pointer
1959 * on the left side - that is: OP_LOAD if it was an address.
1960 * Also: in original QC we cannot OP_LOADP *anyway*.
1962 *out = (lvalue ? leftl : bin);
1967 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1969 ast_expression_codegen *cgen;
1972 /* An unary operation cannot yield an l-value */
1974 compile_error(ast_ctx(self), "not an l-value (binop)");
1978 if (self->expression.outr) {
1979 *out = self->expression.outr;
1983 cgen = self->operand->expression.codegen;
1985 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1988 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
1992 self->expression.outr = *out;
1997 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1999 ast_expression_codegen *cgen;
2004 /* In the context of a return operation, we don't actually return
2008 compile_error(ast_ctx(self), "return-expression is not an l-value");
2012 if (self->expression.outr) {
2013 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2016 self->expression.outr = (ir_value*)1;
2018 if (self->operand) {
2019 cgen = self->operand->expression.codegen;
2021 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2024 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2027 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2034 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2036 ast_expression_codegen *cgen;
2037 ir_value *ent, *field;
2039 /* This function needs to take the 'lvalue' flag into account!
2040 * As lvalue we provide a field-pointer, as rvalue we provide the
2044 if (lvalue && self->expression.outl) {
2045 *out = self->expression.outl;
2049 if (!lvalue && self->expression.outr) {
2050 *out = self->expression.outr;
2054 cgen = self->entity->expression.codegen;
2055 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2058 cgen = self->field->expression.codegen;
2059 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2064 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2067 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2068 ent, field, self->expression.vtype);
2069 /* Done AFTER error checking:
2070 codegen_output_type(self, *out);
2074 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2075 (lvalue ? "ADDRESS" : "FIELD"),
2076 type_name[self->expression.vtype]);
2080 codegen_output_type(self, *out);
2083 self->expression.outl = *out;
2085 self->expression.outr = *out;
2087 /* Hm that should be it... */
2091 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2093 ast_expression_codegen *cgen;
2096 /* in QC this is always an lvalue */
2097 if (lvalue && self->rvalue) {
2098 compile_error(ast_ctx(self), "not an l-value (member access)");
2101 if (self->expression.outl) {
2102 *out = self->expression.outl;
2106 cgen = self->owner->expression.codegen;
2107 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2110 if (vec->vtype != TYPE_VECTOR &&
2111 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2116 *out = ir_value_vector_member(vec, self->field);
2117 self->expression.outl = *out;
2119 return (*out != NULL);
2122 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2127 if (!lvalue && self->expression.outr) {
2128 *out = self->expression.outr;
2130 if (lvalue && self->expression.outl) {
2131 *out = self->expression.outl;
2134 if (!ast_istype(self->array, ast_value)) {
2135 compile_error(ast_ctx(self), "array indexing this way is not supported");
2136 /* note this would actually be pointer indexing because the left side is
2137 * not an actual array but (hopefully) an indexable expression.
2138 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2139 * support this path will be filled.
2144 arr = (ast_value*)self->array;
2145 idx = (ast_value*)self->index;
2147 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2148 /* Time to use accessor functions */
2149 ast_expression_codegen *cgen;
2150 ir_value *iridx, *funval;
2154 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2159 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2163 cgen = self->index->expression.codegen;
2164 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2167 cgen = arr->getter->expression.codegen;
2168 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2171 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2174 ir_call_param(call, iridx);
2176 *out = ir_call_value(call);
2177 self->expression.outr = *out;
2181 if (idx->expression.vtype == TYPE_FLOAT) {
2182 unsigned int arridx = idx->constval.vfloat;
2183 if (arridx >= self->array->expression.count)
2185 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2188 *out = arr->ir_values[arridx];
2190 else if (idx->expression.vtype == TYPE_INTEGER) {
2191 unsigned int arridx = idx->constval.vint;
2192 if (arridx >= self->array->expression.count)
2194 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2197 *out = arr->ir_values[arridx];
2200 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2206 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2208 ast_expression_codegen *cgen;
2216 ir_block *ontrue_endblock = NULL;
2217 ir_block *onfalse_endblock = NULL;
2218 ir_block *merge = NULL;
2220 /* We don't output any value, thus also don't care about r/lvalue */
2224 if (self->expression.outr) {
2225 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2228 self->expression.outr = (ir_value*)1;
2230 /* generate the condition */
2231 cgen = self->cond->expression.codegen;
2232 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2234 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2235 cond = func->curblock;
2239 if (self->on_true) {
2240 /* create on-true block */
2241 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2245 /* enter the block */
2246 func->curblock = ontrue;
2249 cgen = self->on_true->expression.codegen;
2250 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2253 /* we now need to work from the current endpoint */
2254 ontrue_endblock = func->curblock;
2259 if (self->on_false) {
2260 /* create on-false block */
2261 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2265 /* enter the block */
2266 func->curblock = onfalse;
2269 cgen = self->on_false->expression.codegen;
2270 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2273 /* we now need to work from the current endpoint */
2274 onfalse_endblock = func->curblock;
2278 /* Merge block were they all merge in to */
2279 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2281 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2284 /* add jumps ot the merge block */
2285 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2287 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2290 /* Now enter the merge block */
2291 func->curblock = merge;
2294 /* we create the if here, that way all blocks are ordered :)
2296 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2297 (ontrue ? ontrue : merge),
2298 (onfalse ? onfalse : merge)))
2306 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2308 ast_expression_codegen *cgen;
2311 ir_value *trueval, *falseval;
2314 ir_block *cond = func->curblock;
2315 ir_block *cond_out = NULL;
2316 ir_block *ontrue, *ontrue_out = NULL;
2317 ir_block *onfalse, *onfalse_out = NULL;
2320 /* Ternary can never create an lvalue... */
2324 /* In theory it shouldn't be possible to pass through a node twice, but
2325 * in case we add any kind of optimization pass for the AST itself, it
2326 * may still happen, thus we remember a created ir_value and simply return one
2327 * if it already exists.
2329 if (self->expression.outr) {
2330 *out = self->expression.outr;
2334 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2336 /* generate the condition */
2337 func->curblock = cond;
2338 cgen = self->cond->expression.codegen;
2339 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2341 cond_out = func->curblock;
2343 /* create on-true block */
2344 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2349 /* enter the block */
2350 func->curblock = ontrue;
2353 cgen = self->on_true->expression.codegen;
2354 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2357 ontrue_out = func->curblock;
2360 /* create on-false block */
2361 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2366 /* enter the block */
2367 func->curblock = onfalse;
2370 cgen = self->on_false->expression.codegen;
2371 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2374 onfalse_out = func->curblock;
2377 /* create merge block */
2378 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2381 /* jump to merge block */
2382 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2384 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2387 /* create if instruction */
2388 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2391 /* Now enter the merge block */
2392 func->curblock = merge;
2394 /* Here, now, we need a PHI node
2395 * but first some sanity checking...
2397 if (trueval->vtype != falseval->vtype) {
2398 /* error("ternary with different types on the two sides"); */
2403 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), trueval->vtype);
2406 ir_phi_add(phi, ontrue_out, trueval);
2407 ir_phi_add(phi, onfalse_out, falseval);
2409 self->expression.outr = ir_phi_value(phi);
2410 *out = self->expression.outr;
2412 codegen_output_type(self, *out);
2417 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2419 ast_expression_codegen *cgen;
2421 ir_value *dummy = NULL;
2422 ir_value *precond = NULL;
2423 ir_value *postcond = NULL;
2425 /* Since we insert some jumps "late" so we have blocks
2426 * ordered "nicely", we need to keep track of the actual end-blocks
2427 * of expressions to add the jumps to.
2429 ir_block *bbody = NULL, *end_bbody = NULL;
2430 ir_block *bprecond = NULL, *end_bprecond = NULL;
2431 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2432 ir_block *bincrement = NULL, *end_bincrement = NULL;
2433 ir_block *bout = NULL, *bin = NULL;
2435 /* let's at least move the outgoing block to the end */
2438 /* 'break' and 'continue' need to be able to find the right blocks */
2439 ir_block *bcontinue = NULL;
2440 ir_block *bbreak = NULL;
2442 ir_block *tmpblock = NULL;
2447 if (self->expression.outr) {
2448 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2451 self->expression.outr = (ir_value*)1;
2454 * Should we ever need some kind of block ordering, better make this function
2455 * move blocks around than write a block ordering algorithm later... after all
2456 * the ast and ir should work together, not against each other.
2459 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2460 * anyway if for example it contains a ternary.
2464 cgen = self->initexpr->expression.codegen;
2465 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2469 /* Store the block from which we enter this chaos */
2470 bin = func->curblock;
2472 /* The pre-loop condition needs its own block since we
2473 * need to be able to jump to the start of that expression.
2477 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2481 /* the pre-loop-condition the least important place to 'continue' at */
2482 bcontinue = bprecond;
2485 func->curblock = bprecond;
2488 cgen = self->precond->expression.codegen;
2489 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2492 end_bprecond = func->curblock;
2494 bprecond = end_bprecond = NULL;
2497 /* Now the next blocks won't be ordered nicely, but we need to
2498 * generate them this early for 'break' and 'continue'.
2500 if (self->increment) {
2501 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2504 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2506 bincrement = end_bincrement = NULL;
2509 if (self->postcond) {
2510 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2513 bcontinue = bpostcond; /* postcond comes before the increment */
2515 bpostcond = end_bpostcond = NULL;
2518 bout_id = vec_size(func->ir_func->blocks);
2519 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2524 /* The loop body... */
2525 /* if (self->body) */
2527 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2532 func->curblock = bbody;
2534 vec_push(func->breakblocks, bbreak);
2536 vec_push(func->continueblocks, bcontinue);
2538 vec_push(func->continueblocks, bbody);
2542 cgen = self->body->expression.codegen;
2543 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2547 end_bbody = func->curblock;
2548 vec_pop(func->breakblocks);
2549 vec_pop(func->continueblocks);
2552 /* post-loop-condition */
2556 func->curblock = bpostcond;
2559 cgen = self->postcond->expression.codegen;
2560 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2563 end_bpostcond = func->curblock;
2566 /* The incrementor */
2567 if (self->increment)
2570 func->curblock = bincrement;
2573 cgen = self->increment->expression.codegen;
2574 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2577 end_bincrement = func->curblock;
2580 /* In any case now, we continue from the outgoing block */
2581 func->curblock = bout;
2583 /* Now all blocks are in place */
2584 /* From 'bin' we jump to whatever comes first */
2585 if (bprecond) tmpblock = bprecond;
2586 else if (bbody) tmpblock = bbody;
2587 else if (bpostcond) tmpblock = bpostcond;
2588 else tmpblock = bout;
2589 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2595 ir_block *ontrue, *onfalse;
2596 if (bbody) ontrue = bbody;
2597 else if (bincrement) ontrue = bincrement;
2598 else if (bpostcond) ontrue = bpostcond;
2599 else ontrue = bprecond;
2601 if (self->pre_not) {
2606 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2613 if (bincrement) tmpblock = bincrement;
2614 else if (bpostcond) tmpblock = bpostcond;
2615 else if (bprecond) tmpblock = bprecond;
2616 else tmpblock = bbody;
2617 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2621 /* from increment */
2624 if (bpostcond) tmpblock = bpostcond;
2625 else if (bprecond) tmpblock = bprecond;
2626 else if (bbody) tmpblock = bbody;
2627 else tmpblock = bout;
2628 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2635 ir_block *ontrue, *onfalse;
2636 if (bprecond) ontrue = bprecond;
2637 else if (bbody) ontrue = bbody;
2638 else if (bincrement) ontrue = bincrement;
2639 else ontrue = bpostcond;
2641 if (self->post_not) {
2646 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2650 /* Move 'bout' to the end */
2651 vec_remove(func->ir_func->blocks, bout_id, 1);
2652 vec_push(func->ir_func->blocks, bout);
2657 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2664 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2668 if (self->expression.outr) {
2669 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2672 self->expression.outr = (ir_value*)1;
2674 if (self->is_continue)
2675 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2677 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2680 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2684 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2689 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2691 ast_expression_codegen *cgen;
2693 ast_switch_case *def_case = NULL;
2694 ir_block *def_bfall = NULL;
2695 ir_block *def_bfall_to = NULL;
2696 bool set_def_bfall_to = false;
2698 ir_value *dummy = NULL;
2699 ir_value *irop = NULL;
2700 ir_block *bout = NULL;
2701 ir_block *bfall = NULL;
2709 compile_error(ast_ctx(self), "switch expression is not an l-value");
2713 if (self->expression.outr) {
2714 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2717 self->expression.outr = (ir_value*)1;
2722 cgen = self->operand->expression.codegen;
2723 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2726 if (!vec_size(self->cases))
2729 cmpinstr = type_eq_instr[irop->vtype];
2730 if (cmpinstr >= AINSTR_END) {
2731 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2732 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2736 bout_id = vec_size(func->ir_func->blocks);
2737 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2741 /* setup the break block */
2742 vec_push(func->breakblocks, bout);
2744 /* Now create all cases */
2745 for (c = 0; c < vec_size(self->cases); ++c) {
2746 ir_value *cond, *val;
2747 ir_block *bcase, *bnot;
2750 ast_switch_case *swcase = &self->cases[c];
2752 if (swcase->value) {
2753 /* A regular case */
2754 /* generate the condition operand */
2755 cgen = swcase->value->expression.codegen;
2756 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2758 /* generate the condition */
2759 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2763 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2764 bnot_id = vec_size(func->ir_func->blocks);
2765 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2766 if (!bcase || !bnot)
2768 if (set_def_bfall_to) {
2769 set_def_bfall_to = false;
2770 def_bfall_to = bcase;
2772 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2775 /* Make the previous case-end fall through */
2776 if (bfall && !bfall->final) {
2777 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2781 /* enter the case */
2782 func->curblock = bcase;
2783 cgen = swcase->code->expression.codegen;
2784 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2787 /* remember this block to fall through from */
2788 bfall = func->curblock;
2790 /* enter the else and move it down */
2791 func->curblock = bnot;
2792 vec_remove(func->ir_func->blocks, bnot_id, 1);
2793 vec_push(func->ir_func->blocks, bnot);
2795 /* The default case */
2796 /* Remember where to fall through from: */
2799 /* remember which case it was */
2801 /* And the next case will be remembered */
2802 set_def_bfall_to = true;
2806 /* Jump from the last bnot to bout */
2807 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2809 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2814 /* If there was a default case, put it down here */
2818 /* No need to create an extra block */
2819 bcase = func->curblock;
2821 /* Insert the fallthrough jump */
2822 if (def_bfall && !def_bfall->final) {
2823 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2827 /* Now generate the default code */
2828 cgen = def_case->code->expression.codegen;
2829 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2832 /* see if we need to fall through */
2833 if (def_bfall_to && !func->curblock->final)
2835 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2840 /* Jump from the last bnot to bout */
2841 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2843 /* enter the outgoing block */
2844 func->curblock = bout;
2846 /* restore the break block */
2847 vec_pop(func->breakblocks);
2849 /* Move 'bout' to the end, it's nicer */
2850 vec_remove(func->ir_func->blocks, bout_id, 1);
2851 vec_push(func->ir_func->blocks, bout);
2856 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2863 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2867 /* simply create a new block and jump to it */
2868 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2869 if (!self->irblock) {
2870 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2873 if (!func->curblock->final) {
2874 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2878 /* enter the new block */
2879 func->curblock = self->irblock;
2881 /* Generate all the leftover gotos */
2882 for (i = 0; i < vec_size(self->gotos); ++i) {
2883 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2890 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2894 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2898 if (self->target->irblock) {
2899 if (self->irblock_from) {
2900 /* we already tried once, this is the callback */
2901 self->irblock_from->final = false;
2902 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2903 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2909 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
2910 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2917 /* the target has not yet been created...
2918 * close this block in a sneaky way:
2920 func->curblock->final = true;
2921 self->irblock_from = func->curblock;
2922 ast_label_register_goto(self->target, self);
2928 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2930 ast_expression_codegen *cgen;
2932 ir_instr *callinstr;
2935 ir_value *funval = NULL;
2937 /* return values are never lvalues */
2939 compile_error(ast_ctx(self), "not an l-value (function call)");
2943 if (self->expression.outr) {
2944 *out = self->expression.outr;
2948 cgen = self->func->expression.codegen;
2949 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2957 for (i = 0; i < vec_size(self->params); ++i)
2960 ast_expression *expr = self->params[i];
2962 cgen = expr->expression.codegen;
2963 if (!(*cgen)(expr, func, false, ¶m))
2967 vec_push(params, param);
2970 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
2971 ast_function_label(func, "call"),
2972 funval, !!(self->func->expression.flags & AST_FLAG_NORETURN));
2976 for (i = 0; i < vec_size(params); ++i) {
2977 ir_call_param(callinstr, params[i]);
2980 *out = ir_call_value(callinstr);
2981 self->expression.outr = *out;
2983 codegen_output_type(self, *out);