2 * Copyright (C) 2012, 2013
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;
78 self->expression.varparam = NULL;
81 static void ast_expression_delete(ast_expression *self)
84 if (self->expression.next)
85 ast_delete(self->expression.next);
86 for (i = 0; i < vec_size(self->expression.params); ++i) {
87 ast_delete(self->expression.params[i]);
89 vec_free(self->expression.params);
92 static void ast_expression_delete_full(ast_expression *self)
94 ast_expression_delete(self);
98 ast_value* ast_value_copy(const ast_value *self)
101 const ast_expression_common *fromex;
102 ast_expression_common *selfex;
103 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
104 if (self->expression.next) {
105 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
106 if (!cp->expression.next) {
107 ast_value_delete(cp);
111 fromex = &self->expression;
112 selfex = &cp->expression;
113 selfex->count = fromex->count;
114 selfex->flags = fromex->flags;
115 for (i = 0; i < vec_size(fromex->params); ++i) {
116 ast_value *v = ast_value_copy(fromex->params[i]);
118 ast_value_delete(cp);
121 vec_push(selfex->params, v);
126 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
129 const ast_expression_common *fromex;
130 ast_expression_common *selfex;
131 self->expression.vtype = other->expression.vtype;
132 if (other->expression.next) {
133 self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
134 if (!self->expression.next)
137 fromex = &other->expression;
138 selfex = &self->expression;
139 selfex->count = fromex->count;
140 selfex->flags = fromex->flags;
141 for (i = 0; i < vec_size(fromex->params); ++i) {
142 ast_value *v = ast_value_copy(fromex->params[i]);
145 vec_push(selfex->params, v);
150 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
152 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
153 ast_expression_init(self, NULL);
154 self->expression.codegen = NULL;
155 self->expression.next = NULL;
156 self->expression.vtype = vtype;
160 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
163 const ast_expression_common *fromex;
164 ast_expression_common *selfex;
170 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
171 ast_expression_init(self, NULL);
173 fromex = &ex->expression;
174 selfex = &self->expression;
176 /* This may never be codegen()d */
177 selfex->codegen = NULL;
179 selfex->vtype = fromex->vtype;
182 selfex->next = ast_type_copy(ctx, fromex->next);
184 ast_expression_delete_full(self);
191 selfex->count = fromex->count;
192 selfex->flags = fromex->flags;
193 for (i = 0; i < vec_size(fromex->params); ++i) {
194 ast_value *v = ast_value_copy(fromex->params[i]);
196 ast_expression_delete_full(self);
199 vec_push(selfex->params, v);
206 bool ast_compare_type(ast_expression *a, ast_expression *b)
208 if (a->expression.vtype == TYPE_NIL ||
209 b->expression.vtype == TYPE_NIL)
211 if (a->expression.vtype != b->expression.vtype)
213 if (!a->expression.next != !b->expression.next)
215 if (vec_size(a->expression.params) != vec_size(b->expression.params))
217 if ((a->expression.flags & AST_FLAG_TYPE_MASK) !=
218 (b->expression.flags & AST_FLAG_TYPE_MASK) )
222 if (vec_size(a->expression.params)) {
224 for (i = 0; i < vec_size(a->expression.params); ++i) {
225 if (!ast_compare_type((ast_expression*)a->expression.params[i],
226 (ast_expression*)b->expression.params[i]))
230 if (a->expression.next)
231 return ast_compare_type(a->expression.next, b->expression.next);
235 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
242 if (pos + 6 >= bufsize)
244 strcpy(buf + pos, "(null)");
248 if (pos + 1 >= bufsize)
251 switch (e->expression.vtype) {
253 strcpy(buf + pos, "(variant)");
258 return ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
261 if (pos + 3 >= bufsize)
265 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
266 if (pos + 1 >= bufsize)
272 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
273 if (pos + 2 >= bufsize)
275 if (!vec_size(e->expression.params)) {
281 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[0]), buf, bufsize, pos);
282 for (i = 1; i < vec_size(e->expression.params); ++i) {
283 if (pos + 2 >= bufsize)
287 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[i]), buf, bufsize, pos);
289 if (pos + 1 >= bufsize)
295 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
296 if (pos + 1 >= bufsize)
299 pos += snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->expression.count);
300 if (pos + 1 >= bufsize)
306 typestr = type_name[e->expression.vtype];
307 typelen = strlen(typestr);
308 if (pos + typelen >= bufsize)
310 strcpy(buf + pos, typestr);
311 return pos + typelen;
315 buf[bufsize-3] = '.';
316 buf[bufsize-2] = '.';
317 buf[bufsize-1] = '.';
321 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
323 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
327 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
329 ast_instantiate(ast_value, ctx, ast_value_delete);
330 ast_expression_init((ast_expression*)self,
331 (ast_expression_codegen*)&ast_value_codegen);
332 self->expression.node.keep = true; /* keep */
334 self->name = name ? util_strdup(name) : NULL;
335 self->expression.vtype = t;
336 self->expression.next = NULL;
337 self->isfield = false;
339 self->hasvalue = false;
341 memset(&self->constval, 0, sizeof(self->constval));
344 self->ir_values = NULL;
345 self->ir_value_count = 0;
351 self->argcounter = NULL;
356 void ast_value_delete(ast_value* self)
359 mem_d((void*)self->name);
360 if (self->argcounter)
361 mem_d((void*)self->argcounter);
362 if (self->hasvalue) {
363 switch (self->expression.vtype)
366 mem_d((void*)self->constval.vstring);
369 /* unlink us from the function node */
370 self->constval.vfunc->vtype = NULL;
372 /* NOTE: delete function? currently collected in
373 * the parser structure
380 mem_d(self->ir_values);
385 ast_expression_delete((ast_expression*)self);
389 void ast_value_params_add(ast_value *self, ast_value *p)
391 vec_push(self->expression.params, p);
394 bool ast_value_set_name(ast_value *self, const char *name)
397 mem_d((void*)self->name);
398 self->name = util_strdup(name);
402 ast_binary* ast_binary_new(lex_ctx ctx, int op,
403 ast_expression* left, ast_expression* right)
405 ast_instantiate(ast_binary, ctx, ast_binary_delete);
406 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
412 ast_propagate_effects(self, left);
413 ast_propagate_effects(self, right);
415 if (op >= INSTR_EQ_F && op <= INSTR_GT)
416 self->expression.vtype = TYPE_FLOAT;
417 else if (op == INSTR_AND || op == INSTR_OR) {
418 if (OPTS_FLAG(PERL_LOGIC))
419 ast_type_adopt(self, right);
421 self->expression.vtype = TYPE_FLOAT;
423 else if (op == INSTR_BITAND || op == INSTR_BITOR)
424 self->expression.vtype = TYPE_FLOAT;
425 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
426 self->expression.vtype = TYPE_VECTOR;
427 else if (op == INSTR_MUL_V)
428 self->expression.vtype = TYPE_FLOAT;
430 self->expression.vtype = left->expression.vtype;
435 void ast_binary_delete(ast_binary *self)
437 ast_unref(self->left);
438 ast_unref(self->right);
439 ast_expression_delete((ast_expression*)self);
443 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
444 ast_expression* left, ast_expression* right)
446 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
447 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
449 ast_side_effects(self) = true;
451 self->opstore = storop;
454 self->source = right;
456 self->keep_dest = false;
458 if (!ast_type_adopt(self, left)) {
466 void ast_binstore_delete(ast_binstore *self)
468 if (!self->keep_dest)
469 ast_unref(self->dest);
470 ast_unref(self->source);
471 ast_expression_delete((ast_expression*)self);
475 ast_unary* ast_unary_new(lex_ctx ctx, int op,
476 ast_expression *expr)
478 ast_instantiate(ast_unary, ctx, ast_unary_delete);
479 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
482 self->operand = expr;
484 ast_propagate_effects(self, expr);
486 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
487 self->expression.vtype = TYPE_FLOAT;
489 compile_error(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
494 void ast_unary_delete(ast_unary *self)
496 if (self->operand) ast_unref(self->operand);
497 ast_expression_delete((ast_expression*)self);
501 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
503 ast_instantiate(ast_return, ctx, ast_return_delete);
504 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
506 self->operand = expr;
509 ast_propagate_effects(self, expr);
514 void ast_return_delete(ast_return *self)
517 ast_unref(self->operand);
518 ast_expression_delete((ast_expression*)self);
522 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
524 if (field->expression.vtype != TYPE_FIELD) {
525 compile_error(ctx, "ast_entfield_new with expression not of type field");
528 return ast_entfield_new_force(ctx, entity, field, field->expression.next);
531 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
533 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
537 /* Error: field has no type... */
541 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
543 self->entity = entity;
545 ast_propagate_effects(self, entity);
546 ast_propagate_effects(self, field);
548 if (!ast_type_adopt(self, outtype)) {
549 ast_entfield_delete(self);
556 void ast_entfield_delete(ast_entfield *self)
558 ast_unref(self->entity);
559 ast_unref(self->field);
560 ast_expression_delete((ast_expression*)self);
564 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field, const char *name)
566 ast_instantiate(ast_member, ctx, ast_member_delete);
572 if (owner->expression.vtype != TYPE_VECTOR &&
573 owner->expression.vtype != TYPE_FIELD) {
574 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
579 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
580 self->expression.node.keep = true; /* keep */
582 if (owner->expression.vtype == TYPE_VECTOR) {
583 self->expression.vtype = TYPE_FLOAT;
584 self->expression.next = NULL;
586 self->expression.vtype = TYPE_FIELD;
587 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
590 self->rvalue = false;
592 ast_propagate_effects(self, owner);
596 self->name = util_strdup(name);
603 void ast_member_delete(ast_member *self)
605 /* The owner is always an ast_value, which has .keep=true,
606 * also: ast_members are usually deleted after the owner, thus
607 * this will cause invalid access
608 ast_unref(self->owner);
609 * once we allow (expression).x to access a vector-member, we need
610 * to change this: preferably by creating an alternate ast node for this
611 * purpose that is not garbage-collected.
613 ast_expression_delete((ast_expression*)self);
617 bool ast_member_set_name(ast_member *self, const char *name)
620 mem_d((void*)self->name);
621 self->name = util_strdup(name);
625 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
627 ast_expression *outtype;
628 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
630 outtype = array->expression.next;
633 /* Error: field has no type... */
637 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
641 ast_propagate_effects(self, array);
642 ast_propagate_effects(self, index);
644 if (!ast_type_adopt(self, outtype)) {
645 ast_array_index_delete(self);
648 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
649 if (self->expression.vtype != TYPE_ARRAY) {
650 compile_error(ast_ctx(self), "array_index node on type");
651 ast_array_index_delete(self);
654 self->array = outtype;
655 self->expression.vtype = TYPE_FIELD;
661 void ast_array_index_delete(ast_array_index *self)
663 ast_unref(self->array);
664 ast_unref(self->index);
665 ast_expression_delete((ast_expression*)self);
669 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
671 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
672 if (!ontrue && !onfalse) {
673 /* because it is invalid */
677 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
680 self->on_true = ontrue;
681 self->on_false = onfalse;
682 ast_propagate_effects(self, cond);
684 ast_propagate_effects(self, ontrue);
686 ast_propagate_effects(self, onfalse);
691 void ast_ifthen_delete(ast_ifthen *self)
693 ast_unref(self->cond);
695 ast_unref(self->on_true);
697 ast_unref(self->on_false);
698 ast_expression_delete((ast_expression*)self);
702 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
704 ast_expression *exprtype = ontrue;
705 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
706 /* This time NEITHER must be NULL */
707 if (!ontrue || !onfalse) {
711 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
714 self->on_true = ontrue;
715 self->on_false = onfalse;
716 ast_propagate_effects(self, cond);
717 ast_propagate_effects(self, ontrue);
718 ast_propagate_effects(self, onfalse);
720 if (ontrue->expression.vtype == TYPE_NIL)
722 if (!ast_type_adopt(self, exprtype)) {
723 ast_ternary_delete(self);
730 void ast_ternary_delete(ast_ternary *self)
732 /* the if()s are only there because computed-gotos can set them
735 if (self->cond) ast_unref(self->cond);
736 if (self->on_true) ast_unref(self->on_true);
737 if (self->on_false) ast_unref(self->on_false);
738 ast_expression_delete((ast_expression*)self);
742 ast_loop* ast_loop_new(lex_ctx ctx,
743 ast_expression *initexpr,
744 ast_expression *precond, bool pre_not,
745 ast_expression *postcond, bool post_not,
746 ast_expression *increment,
747 ast_expression *body)
749 ast_instantiate(ast_loop, ctx, ast_loop_delete);
750 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
752 self->initexpr = initexpr;
753 self->precond = precond;
754 self->postcond = postcond;
755 self->increment = increment;
758 self->pre_not = pre_not;
759 self->post_not = post_not;
762 ast_propagate_effects(self, initexpr);
764 ast_propagate_effects(self, precond);
766 ast_propagate_effects(self, postcond);
768 ast_propagate_effects(self, increment);
770 ast_propagate_effects(self, body);
775 void ast_loop_delete(ast_loop *self)
778 ast_unref(self->initexpr);
780 ast_unref(self->precond);
782 ast_unref(self->postcond);
784 ast_unref(self->increment);
786 ast_unref(self->body);
787 ast_expression_delete((ast_expression*)self);
791 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont, unsigned int levels)
793 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
794 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
796 self->is_continue = iscont;
797 self->levels = levels;
802 void ast_breakcont_delete(ast_breakcont *self)
804 ast_expression_delete((ast_expression*)self);
808 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
810 ast_instantiate(ast_switch, ctx, ast_switch_delete);
811 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
816 ast_propagate_effects(self, op);
821 void ast_switch_delete(ast_switch *self)
824 ast_unref(self->operand);
826 for (i = 0; i < vec_size(self->cases); ++i) {
827 if (self->cases[i].value)
828 ast_unref(self->cases[i].value);
829 ast_unref(self->cases[i].code);
831 vec_free(self->cases);
833 ast_expression_delete((ast_expression*)self);
837 ast_label* ast_label_new(lex_ctx ctx, const char *name, bool undefined)
839 ast_instantiate(ast_label, ctx, ast_label_delete);
840 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
842 self->expression.vtype = TYPE_NOEXPR;
844 self->name = util_strdup(name);
845 self->irblock = NULL;
847 self->undefined = undefined;
852 void ast_label_delete(ast_label *self)
854 mem_d((void*)self->name);
855 vec_free(self->gotos);
856 ast_expression_delete((ast_expression*)self);
860 void ast_label_register_goto(ast_label *self, ast_goto *g)
862 vec_push(self->gotos, g);
865 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
867 ast_instantiate(ast_goto, ctx, ast_goto_delete);
868 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
870 self->name = util_strdup(name);
872 self->irblock_from = NULL;
877 void ast_goto_delete(ast_goto *self)
879 mem_d((void*)self->name);
880 ast_expression_delete((ast_expression*)self);
884 void ast_goto_set_label(ast_goto *self, ast_label *label)
886 self->target = label;
889 ast_call* ast_call_new(lex_ctx ctx,
890 ast_expression *funcexpr)
892 ast_instantiate(ast_call, ctx, ast_call_delete);
893 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
895 ast_side_effects(self) = true;
898 self->func = funcexpr;
900 ast_type_adopt(self, funcexpr->expression.next);
905 void ast_call_delete(ast_call *self)
908 for (i = 0; i < vec_size(self->params); ++i)
909 ast_unref(self->params[i]);
910 vec_free(self->params);
913 ast_unref(self->func);
915 ast_expression_delete((ast_expression*)self);
919 bool ast_call_check_types(ast_call *self)
925 const ast_expression *func = self->func;
926 size_t count = vec_size(self->params);
927 if (count > vec_size(func->expression.params))
928 count = vec_size(func->expression.params);
930 for (i = 0; i < count; ++i) {
931 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i])))
933 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
934 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
935 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
936 (unsigned int)(i+1), texp, tgot);
937 /* we don't immediately return */
941 count = vec_size(self->params);
942 if (count > vec_size(func->expression.params) && func->expression.varparam) {
943 for (; i < count; ++i) {
944 if (!ast_compare_type(self->params[i], func->expression.varparam))
946 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
947 ast_type_to_string(func->expression.varparam, texp, sizeof(texp));
948 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
949 (unsigned int)(i+1), texp, tgot);
950 /* we don't immediately return */
958 ast_store* ast_store_new(lex_ctx ctx, int op,
959 ast_expression *dest, ast_expression *source)
961 ast_instantiate(ast_store, ctx, ast_store_delete);
962 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
964 ast_side_effects(self) = true;
968 self->source = source;
970 if (!ast_type_adopt(self, dest)) {
978 void ast_store_delete(ast_store *self)
980 ast_unref(self->dest);
981 ast_unref(self->source);
982 ast_expression_delete((ast_expression*)self);
986 ast_block* ast_block_new(lex_ctx ctx)
988 ast_instantiate(ast_block, ctx, ast_block_delete);
989 ast_expression_init((ast_expression*)self,
990 (ast_expression_codegen*)&ast_block_codegen);
994 self->collect = NULL;
999 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1001 ast_propagate_effects(self, e);
1002 vec_push(self->exprs, e);
1003 if (self->expression.next) {
1004 ast_delete(self->expression.next);
1005 self->expression.next = NULL;
1007 if (!ast_type_adopt(self, e)) {
1008 compile_error(ast_ctx(self), "internal error: failed to adopt type");
1014 void ast_block_collect(ast_block *self, ast_expression *expr)
1016 vec_push(self->collect, expr);
1017 expr->expression.node.keep = true;
1020 void ast_block_delete(ast_block *self)
1023 for (i = 0; i < vec_size(self->exprs); ++i)
1024 ast_unref(self->exprs[i]);
1025 vec_free(self->exprs);
1026 for (i = 0; i < vec_size(self->locals); ++i)
1027 ast_delete(self->locals[i]);
1028 vec_free(self->locals);
1029 for (i = 0; i < vec_size(self->collect); ++i)
1030 ast_delete(self->collect[i]);
1031 vec_free(self->collect);
1032 ast_expression_delete((ast_expression*)self);
1036 bool ast_block_set_type(ast_block *self, ast_expression *from)
1038 if (self->expression.next)
1039 ast_delete(self->expression.next);
1040 if (!ast_type_adopt(self, from))
1045 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1047 ast_instantiate(ast_function, ctx, ast_function_delete);
1051 vtype->expression.vtype != TYPE_FUNCTION)
1053 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1055 (int)vtype->hasvalue,
1056 vtype->expression.vtype);
1061 self->vtype = vtype;
1062 self->name = name ? util_strdup(name) : NULL;
1063 self->blocks = NULL;
1065 self->labelcount = 0;
1068 self->ir_func = NULL;
1069 self->curblock = NULL;
1071 self->breakblocks = NULL;
1072 self->continueblocks = NULL;
1074 vtype->hasvalue = true;
1075 vtype->constval.vfunc = self;
1077 self->varargs = NULL;
1082 void ast_function_delete(ast_function *self)
1086 mem_d((void*)self->name);
1088 /* ast_value_delete(self->vtype); */
1089 self->vtype->hasvalue = false;
1090 self->vtype->constval.vfunc = NULL;
1091 /* We use unref - if it was stored in a global table it is supposed
1092 * to be deleted from *there*
1094 ast_unref(self->vtype);
1096 for (i = 0; i < vec_size(self->blocks); ++i)
1097 ast_delete(self->blocks[i]);
1098 vec_free(self->blocks);
1099 vec_free(self->breakblocks);
1100 vec_free(self->continueblocks);
1102 ast_delete(self->varargs);
1106 const char* ast_function_label(ast_function *self, const char *prefix)
1112 if (!opts.dump && !opts.dumpfin && !opts.debug)
1115 id = (self->labelcount++);
1116 len = strlen(prefix);
1118 from = self->labelbuf + sizeof(self->labelbuf)-1;
1121 *from-- = (id%10) + '0';
1125 memcpy(from - len, prefix, len);
1129 /*********************************************************************/
1131 * by convention you must never pass NULL to the 'ir_value **out'
1132 * parameter. If you really don't care about the output, pass a dummy.
1133 * But I can't imagine a pituation where the output is truly unnecessary.
1136 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1138 if (out->vtype == TYPE_FIELD)
1139 out->fieldtype = self->next->expression.vtype;
1140 if (out->vtype == TYPE_FUNCTION)
1141 out->outtype = self->next->expression.vtype;
1144 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1146 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1150 if (self->expression.vtype == TYPE_NIL) {
1151 *out = func->ir_func->owner->nil;
1154 /* NOTE: This is the codegen for a variable used in an expression.
1155 * It is not the codegen to generate the value. For this purpose,
1156 * ast_local_codegen and ast_global_codegen are to be used before this
1157 * is executed. ast_function_codegen should take care of its locals,
1158 * and the ast-user should take care of ast_global_codegen to be used
1159 * on all the globals.
1162 char tname[1024]; /* typename is reserved in C++ */
1163 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1164 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1171 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1175 if (self->expression.vtype == TYPE_NIL) {
1176 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1180 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1182 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1185 func->context = ast_ctx(self);
1186 func->value->context = ast_ctx(self);
1188 self->constval.vfunc->ir_func = func;
1189 self->ir_v = func->value;
1190 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1191 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1192 /* The function is filled later on ast_function_codegen... */
1196 if (isfield && self->expression.vtype == TYPE_FIELD) {
1197 ast_expression *fieldtype = self->expression.next;
1199 if (self->hasvalue) {
1200 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1204 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1209 ast_expression_common *elemtype;
1211 ast_value *array = (ast_value*)fieldtype;
1213 if (!ast_istype(fieldtype, ast_value)) {
1214 compile_error(ast_ctx(self), "internal error: ast_value required");
1218 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1219 if (!array->expression.count || array->expression.count > opts.max_array_size)
1220 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1222 elemtype = &array->expression.next->expression;
1223 vtype = elemtype->vtype;
1225 v = ir_builder_create_field(ir, self->name, vtype);
1227 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1230 v->context = ast_ctx(self);
1231 v->unique_life = true;
1233 array->ir_v = self->ir_v = v;
1234 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1235 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1237 namelen = strlen(self->name);
1238 name = (char*)mem_a(namelen + 16);
1239 strcpy(name, self->name);
1241 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1242 array->ir_values[0] = v;
1243 for (ai = 1; ai < array->expression.count; ++ai) {
1244 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1245 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1246 if (!array->ir_values[ai]) {
1248 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1251 array->ir_values[ai]->context = ast_ctx(self);
1252 array->ir_values[ai]->unique_life = true;
1253 array->ir_values[ai]->locked = true;
1254 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1255 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1261 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1264 v->context = ast_ctx(self);
1266 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1267 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1272 if (self->expression.vtype == TYPE_ARRAY) {
1277 ast_expression_common *elemtype = &self->expression.next->expression;
1278 int vtype = elemtype->vtype;
1280 /* same as with field arrays */
1281 if (!self->expression.count || self->expression.count > opts.max_array_size)
1282 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1284 v = ir_builder_create_global(ir, self->name, vtype);
1286 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1289 v->context = ast_ctx(self);
1290 v->unique_life = true;
1292 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1293 v->flags |= IR_FLAG_INCLUDE_DEF;
1295 namelen = strlen(self->name);
1296 name = (char*)mem_a(namelen + 16);
1297 strcpy(name, self->name);
1299 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1300 self->ir_values[0] = v;
1301 for (ai = 1; ai < self->expression.count; ++ai) {
1302 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1303 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1304 if (!self->ir_values[ai]) {
1306 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1309 self->ir_values[ai]->context = ast_ctx(self);
1310 self->ir_values[ai]->unique_life = true;
1311 self->ir_values[ai]->locked = true;
1312 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1313 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1319 /* Arrays don't do this since there's no "array" value which spans across the
1322 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1324 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1327 codegen_output_type(self, v);
1328 v->context = ast_ctx(self);
1331 if (self->hasvalue) {
1332 switch (self->expression.vtype)
1335 if (!ir_value_set_float(v, self->constval.vfloat))
1339 if (!ir_value_set_vector(v, self->constval.vvec))
1343 if (!ir_value_set_string(v, self->constval.vstring))
1347 compile_error(ast_ctx(self), "TODO: global constant array");
1350 compile_error(ast_ctx(self), "global of type function not properly generated");
1352 /* Cannot generate an IR value for a function,
1353 * need a pointer pointing to a function rather.
1356 if (!self->constval.vfield) {
1357 compile_error(ast_ctx(self), "field constant without vfield set");
1360 if (!self->constval.vfield->ir_v) {
1361 compile_error(ast_ctx(self), "field constant generated before its field");
1364 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1368 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1373 /* link us to the ir_value */
1376 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1377 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1380 error: /* clean up */
1385 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1389 if (self->expression.vtype == TYPE_NIL) {
1390 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1394 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1396 /* Do we allow local functions? I think not...
1397 * this is NOT a function pointer atm.
1402 if (self->expression.vtype == TYPE_ARRAY) {
1407 ast_expression_common *elemtype = &self->expression.next->expression;
1408 int vtype = elemtype->vtype;
1410 func->flags |= IR_FLAG_HAS_ARRAYS;
1412 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1413 compile_error(ast_ctx(self), "array-parameters are not supported");
1417 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1418 if (!self->expression.count || self->expression.count > opts.max_array_size) {
1419 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1422 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1423 if (!self->ir_values) {
1424 compile_error(ast_ctx(self), "failed to allocate array values");
1428 v = ir_function_create_local(func, self->name, vtype, param);
1430 compile_error(ast_ctx(self), "ir_function_create_local failed");
1433 v->context = ast_ctx(self);
1434 v->unique_life = true;
1437 namelen = strlen(self->name);
1438 name = (char*)mem_a(namelen + 16);
1439 strcpy(name, self->name);
1441 self->ir_values[0] = v;
1442 for (ai = 1; ai < self->expression.count; ++ai) {
1443 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1444 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1445 if (!self->ir_values[ai]) {
1446 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1449 self->ir_values[ai]->context = ast_ctx(self);
1450 self->ir_values[ai]->unique_life = true;
1451 self->ir_values[ai]->locked = true;
1456 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1459 codegen_output_type(self, v);
1460 v->context = ast_ctx(self);
1463 /* A constant local... hmmm...
1464 * I suppose the IR will have to deal with this
1466 if (self->hasvalue) {
1467 switch (self->expression.vtype)
1470 if (!ir_value_set_float(v, self->constval.vfloat))
1474 if (!ir_value_set_vector(v, self->constval.vvec))
1478 if (!ir_value_set_string(v, self->constval.vstring))
1482 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1487 /* link us to the ir_value */
1491 if (!ast_generate_accessors(self, func->owner))
1495 error: /* clean up */
1500 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1503 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1504 if (!self->setter || !self->getter)
1506 for (i = 0; i < self->expression.count; ++i) {
1507 if (!self->ir_values) {
1508 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1511 if (!self->ir_values[i]) {
1512 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1515 if (self->ir_values[i]->life) {
1516 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1521 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1523 if (!ast_global_codegen (self->setter, ir, false) ||
1524 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1525 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1527 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1528 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1533 if (!ast_global_codegen (self->getter, ir, false) ||
1534 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1535 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1537 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1538 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1542 for (i = 0; i < self->expression.count; ++i) {
1543 vec_free(self->ir_values[i]->life);
1545 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1549 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1553 ast_expression_common *ec;
1558 irf = self->ir_func;
1560 compile_error(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1564 /* fill the parameter list */
1565 ec = &self->vtype->expression;
1566 for (i = 0; i < vec_size(ec->params); ++i)
1568 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1569 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1571 vec_push(irf->params, ec->params[i]->expression.vtype);
1572 if (!self->builtin) {
1573 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1578 if (self->varargs) {
1579 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1583 if (self->builtin) {
1584 irf->builtin = self->builtin;
1588 if (!vec_size(self->blocks)) {
1589 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1593 self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1594 if (!self->curblock) {
1595 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1599 for (i = 0; i < vec_size(self->blocks); ++i) {
1600 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1601 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1605 /* TODO: check return types */
1606 if (!self->curblock->final)
1608 if (!self->vtype->expression.next ||
1609 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1611 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1613 else if (vec_size(self->curblock->entries))
1615 /* error("missing return"); */
1616 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1617 "control reaches end of non-void function (`%s`) via %s",
1618 self->name, self->curblock->label))
1622 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1628 /* Note, you will not see ast_block_codegen generate ir_blocks.
1629 * To the AST and the IR, blocks are 2 different things.
1630 * In the AST it represents a block of code, usually enclosed in
1631 * curly braces {...}.
1632 * While in the IR it represents a block in terms of control-flow.
1634 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1638 /* We don't use this
1639 * Note: an ast-representation using the comma-operator
1640 * of the form: (a, b, c) = x should not assign to c...
1643 compile_error(ast_ctx(self), "not an l-value (code-block)");
1647 if (self->expression.outr) {
1648 *out = self->expression.outr;
1652 /* output is NULL at first, we'll have each expression
1653 * assign to out output, thus, a comma-operator represention
1654 * using an ast_block will return the last generated value,
1655 * so: (b, c) + a executed both b and c, and returns c,
1656 * which is then added to a.
1660 /* generate locals */
1661 for (i = 0; i < vec_size(self->locals); ++i)
1663 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1665 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1670 for (i = 0; i < vec_size(self->exprs); ++i)
1672 ast_expression_codegen *gen;
1673 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1674 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1678 gen = self->exprs[i]->expression.codegen;
1679 if (!(*gen)(self->exprs[i], func, false, out))
1683 self->expression.outr = *out;
1688 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1690 ast_expression_codegen *cgen;
1691 ir_value *left = NULL;
1692 ir_value *right = NULL;
1696 ast_array_index *ai = NULL;
1698 if (lvalue && self->expression.outl) {
1699 *out = self->expression.outl;
1703 if (!lvalue && self->expression.outr) {
1704 *out = self->expression.outr;
1708 if (ast_istype(self->dest, ast_array_index))
1711 ai = (ast_array_index*)self->dest;
1712 idx = (ast_value*)ai->index;
1714 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1719 /* we need to call the setter */
1720 ir_value *iridx, *funval;
1724 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1728 arr = (ast_value*)ai->array;
1729 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1730 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1734 cgen = idx->expression.codegen;
1735 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1738 cgen = arr->setter->expression.codegen;
1739 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1742 cgen = self->source->expression.codegen;
1743 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1746 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1749 ir_call_param(call, iridx);
1750 ir_call_param(call, right);
1751 self->expression.outr = right;
1757 cgen = self->dest->expression.codegen;
1759 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1761 self->expression.outl = left;
1763 cgen = self->source->expression.codegen;
1765 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1768 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1770 self->expression.outr = right;
1773 /* Theoretically, an assinment returns its left side as an
1774 * lvalue, if we don't need an lvalue though, we return
1775 * the right side as an rvalue, otherwise we have to
1776 * somehow know whether or not we need to dereference the pointer
1777 * on the left side - that is: OP_LOAD if it was an address.
1778 * Also: in original QC we cannot OP_LOADP *anyway*.
1780 *out = (lvalue ? left : right);
1785 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1787 ast_expression_codegen *cgen;
1788 ir_value *left, *right;
1790 /* A binary operation cannot yield an l-value */
1792 compile_error(ast_ctx(self), "not an l-value (binop)");
1796 if (self->expression.outr) {
1797 *out = self->expression.outr;
1801 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1802 (self->op == INSTR_AND || self->op == INSTR_OR))
1804 /* short circuit evaluation */
1805 ir_block *other, *merge;
1806 ir_block *from_left, *from_right;
1810 /* prepare end-block */
1811 merge_id = vec_size(func->ir_func->blocks);
1812 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1814 /* generate the left expression */
1815 cgen = self->left->expression.codegen;
1816 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1818 /* remember the block */
1819 from_left = func->curblock;
1821 /* create a new block for the right expression */
1822 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1823 if (self->op == INSTR_AND) {
1824 /* on AND: left==true -> other */
1825 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1828 /* on OR: left==false -> other */
1829 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1832 /* use the likely flag */
1833 vec_last(func->curblock->instr)->likely = true;
1835 /* enter the right-expression's block */
1836 func->curblock = other;
1838 cgen = self->right->expression.codegen;
1839 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1841 /* remember block */
1842 from_right = func->curblock;
1844 /* jump to the merge block */
1845 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1848 vec_remove(func->ir_func->blocks, merge_id, 1);
1849 vec_push(func->ir_func->blocks, merge);
1851 func->curblock = merge;
1852 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1853 ast_function_label(func, "sce_value"),
1854 self->expression.vtype);
1855 ir_phi_add(phi, from_left, left);
1856 ir_phi_add(phi, from_right, right);
1857 *out = ir_phi_value(phi);
1861 if (!OPTS_FLAG(PERL_LOGIC)) {
1863 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1864 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1865 ast_function_label(func, "sce_bool_v"),
1869 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1870 ast_function_label(func, "sce_bool"),
1875 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
1876 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1877 ast_function_label(func, "sce_bool_s"),
1881 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1882 ast_function_label(func, "sce_bool"),
1888 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
1889 ast_function_label(func, "sce_bool"),
1890 INSTR_AND, *out, *out);
1896 self->expression.outr = *out;
1897 codegen_output_type(self, *out);
1901 cgen = self->left->expression.codegen;
1902 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1905 cgen = self->right->expression.codegen;
1906 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1909 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1910 self->op, left, right);
1913 self->expression.outr = *out;
1914 codegen_output_type(self, *out);
1919 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1921 ast_expression_codegen *cgen;
1922 ir_value *leftl = NULL, *leftr, *right, *bin;
1926 ast_array_index *ai = NULL;
1927 ir_value *iridx = NULL;
1929 if (lvalue && self->expression.outl) {
1930 *out = self->expression.outl;
1934 if (!lvalue && self->expression.outr) {
1935 *out = self->expression.outr;
1939 if (ast_istype(self->dest, ast_array_index))
1942 ai = (ast_array_index*)self->dest;
1943 idx = (ast_value*)ai->index;
1945 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1949 /* for a binstore we need both an lvalue and an rvalue for the left side */
1950 /* rvalue of destination! */
1952 cgen = idx->expression.codegen;
1953 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1956 cgen = self->dest->expression.codegen;
1957 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1960 /* source as rvalue only */
1961 cgen = self->source->expression.codegen;
1962 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1965 /* now the binary */
1966 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1967 self->opbin, leftr, right);
1968 self->expression.outr = bin;
1972 /* we need to call the setter */
1977 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1981 arr = (ast_value*)ai->array;
1982 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1983 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1987 cgen = arr->setter->expression.codegen;
1988 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1991 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1994 ir_call_param(call, iridx);
1995 ir_call_param(call, bin);
1996 self->expression.outr = bin;
1998 /* now store them */
1999 cgen = self->dest->expression.codegen;
2000 /* lvalue of destination */
2001 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2003 self->expression.outl = leftl;
2005 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2007 self->expression.outr = bin;
2010 /* Theoretically, an assinment returns its left side as an
2011 * lvalue, if we don't need an lvalue though, we return
2012 * the right side as an rvalue, otherwise we have to
2013 * somehow know whether or not we need to dereference the pointer
2014 * on the left side - that is: OP_LOAD if it was an address.
2015 * Also: in original QC we cannot OP_LOADP *anyway*.
2017 *out = (lvalue ? leftl : bin);
2022 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2024 ast_expression_codegen *cgen;
2027 /* An unary operation cannot yield an l-value */
2029 compile_error(ast_ctx(self), "not an l-value (binop)");
2033 if (self->expression.outr) {
2034 *out = self->expression.outr;
2038 cgen = self->operand->expression.codegen;
2040 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2043 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2047 self->expression.outr = *out;
2052 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2054 ast_expression_codegen *cgen;
2059 /* In the context of a return operation, we don't actually return
2063 compile_error(ast_ctx(self), "return-expression is not an l-value");
2067 if (self->expression.outr) {
2068 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2071 self->expression.outr = (ir_value*)1;
2073 if (self->operand) {
2074 cgen = self->operand->expression.codegen;
2076 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2079 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2082 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2089 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2091 ast_expression_codegen *cgen;
2092 ir_value *ent, *field;
2094 /* This function needs to take the 'lvalue' flag into account!
2095 * As lvalue we provide a field-pointer, as rvalue we provide the
2099 if (lvalue && self->expression.outl) {
2100 *out = self->expression.outl;
2104 if (!lvalue && self->expression.outr) {
2105 *out = self->expression.outr;
2109 cgen = self->entity->expression.codegen;
2110 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2113 cgen = self->field->expression.codegen;
2114 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2119 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2122 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2123 ent, field, self->expression.vtype);
2124 /* Done AFTER error checking:
2125 codegen_output_type(self, *out);
2129 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2130 (lvalue ? "ADDRESS" : "FIELD"),
2131 type_name[self->expression.vtype]);
2135 codegen_output_type(self, *out);
2138 self->expression.outl = *out;
2140 self->expression.outr = *out;
2142 /* Hm that should be it... */
2146 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2148 ast_expression_codegen *cgen;
2151 /* in QC this is always an lvalue */
2152 if (lvalue && self->rvalue) {
2153 compile_error(ast_ctx(self), "not an l-value (member access)");
2156 if (self->expression.outl) {
2157 *out = self->expression.outl;
2161 cgen = self->owner->expression.codegen;
2162 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2165 if (vec->vtype != TYPE_VECTOR &&
2166 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2171 *out = ir_value_vector_member(vec, self->field);
2172 self->expression.outl = *out;
2174 return (*out != NULL);
2177 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2182 if (!lvalue && self->expression.outr) {
2183 *out = self->expression.outr;
2185 if (lvalue && self->expression.outl) {
2186 *out = self->expression.outl;
2189 if (!ast_istype(self->array, ast_value)) {
2190 compile_error(ast_ctx(self), "array indexing this way is not supported");
2191 /* note this would actually be pointer indexing because the left side is
2192 * not an actual array but (hopefully) an indexable expression.
2193 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2194 * support this path will be filled.
2199 arr = (ast_value*)self->array;
2200 idx = (ast_value*)self->index;
2202 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2203 /* Time to use accessor functions */
2204 ast_expression_codegen *cgen;
2205 ir_value *iridx, *funval;
2209 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2214 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2218 cgen = self->index->expression.codegen;
2219 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2222 cgen = arr->getter->expression.codegen;
2223 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2226 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2229 ir_call_param(call, iridx);
2231 *out = ir_call_value(call);
2232 self->expression.outr = *out;
2236 if (idx->expression.vtype == TYPE_FLOAT) {
2237 unsigned int arridx = idx->constval.vfloat;
2238 if (arridx >= self->array->expression.count)
2240 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2243 *out = arr->ir_values[arridx];
2245 else if (idx->expression.vtype == TYPE_INTEGER) {
2246 unsigned int arridx = idx->constval.vint;
2247 if (arridx >= self->array->expression.count)
2249 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2252 *out = arr->ir_values[arridx];
2255 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2261 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2263 ast_expression_codegen *cgen;
2271 ir_block *ontrue_endblock = NULL;
2272 ir_block *onfalse_endblock = NULL;
2273 ir_block *merge = NULL;
2275 /* We don't output any value, thus also don't care about r/lvalue */
2279 if (self->expression.outr) {
2280 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2283 self->expression.outr = (ir_value*)1;
2285 /* generate the condition */
2286 cgen = self->cond->expression.codegen;
2287 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2289 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2290 cond = func->curblock;
2294 if (self->on_true) {
2295 /* create on-true block */
2296 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2300 /* enter the block */
2301 func->curblock = ontrue;
2304 cgen = self->on_true->expression.codegen;
2305 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2308 /* we now need to work from the current endpoint */
2309 ontrue_endblock = func->curblock;
2314 if (self->on_false) {
2315 /* create on-false block */
2316 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2320 /* enter the block */
2321 func->curblock = onfalse;
2324 cgen = self->on_false->expression.codegen;
2325 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2328 /* we now need to work from the current endpoint */
2329 onfalse_endblock = func->curblock;
2333 /* Merge block were they all merge in to */
2334 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2336 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2339 /* add jumps ot the merge block */
2340 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2342 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2345 /* Now enter the merge block */
2346 func->curblock = merge;
2349 /* we create the if here, that way all blocks are ordered :)
2351 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2352 (ontrue ? ontrue : merge),
2353 (onfalse ? onfalse : merge)))
2361 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2363 ast_expression_codegen *cgen;
2366 ir_value *trueval, *falseval;
2369 ir_block *cond = func->curblock;
2370 ir_block *cond_out = NULL;
2371 ir_block *ontrue, *ontrue_out = NULL;
2372 ir_block *onfalse, *onfalse_out = NULL;
2375 /* Ternary can never create an lvalue... */
2379 /* In theory it shouldn't be possible to pass through a node twice, but
2380 * in case we add any kind of optimization pass for the AST itself, it
2381 * may still happen, thus we remember a created ir_value and simply return one
2382 * if it already exists.
2384 if (self->expression.outr) {
2385 *out = self->expression.outr;
2389 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2391 /* generate the condition */
2392 func->curblock = cond;
2393 cgen = self->cond->expression.codegen;
2394 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2396 cond_out = func->curblock;
2398 /* create on-true block */
2399 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2404 /* enter the block */
2405 func->curblock = ontrue;
2408 cgen = self->on_true->expression.codegen;
2409 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2412 ontrue_out = func->curblock;
2415 /* create on-false block */
2416 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2421 /* enter the block */
2422 func->curblock = onfalse;
2425 cgen = self->on_false->expression.codegen;
2426 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2429 onfalse_out = func->curblock;
2432 /* create merge block */
2433 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2436 /* jump to merge block */
2437 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2439 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2442 /* create if instruction */
2443 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2446 /* Now enter the merge block */
2447 func->curblock = merge;
2449 /* Here, now, we need a PHI node
2450 * but first some sanity checking...
2452 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2453 /* error("ternary with different types on the two sides"); */
2454 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2459 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2461 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2464 ir_phi_add(phi, ontrue_out, trueval);
2465 ir_phi_add(phi, onfalse_out, falseval);
2467 self->expression.outr = ir_phi_value(phi);
2468 *out = self->expression.outr;
2470 codegen_output_type(self, *out);
2475 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2477 ast_expression_codegen *cgen;
2479 ir_value *dummy = NULL;
2480 ir_value *precond = NULL;
2481 ir_value *postcond = NULL;
2483 /* Since we insert some jumps "late" so we have blocks
2484 * ordered "nicely", we need to keep track of the actual end-blocks
2485 * of expressions to add the jumps to.
2487 ir_block *bbody = NULL, *end_bbody = NULL;
2488 ir_block *bprecond = NULL, *end_bprecond = NULL;
2489 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2490 ir_block *bincrement = NULL, *end_bincrement = NULL;
2491 ir_block *bout = NULL, *bin = NULL;
2493 /* let's at least move the outgoing block to the end */
2496 /* 'break' and 'continue' need to be able to find the right blocks */
2497 ir_block *bcontinue = NULL;
2498 ir_block *bbreak = NULL;
2500 ir_block *tmpblock = NULL;
2505 if (self->expression.outr) {
2506 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2509 self->expression.outr = (ir_value*)1;
2512 * Should we ever need some kind of block ordering, better make this function
2513 * move blocks around than write a block ordering algorithm later... after all
2514 * the ast and ir should work together, not against each other.
2517 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2518 * anyway if for example it contains a ternary.
2522 cgen = self->initexpr->expression.codegen;
2523 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2527 /* Store the block from which we enter this chaos */
2528 bin = func->curblock;
2530 /* The pre-loop condition needs its own block since we
2531 * need to be able to jump to the start of that expression.
2535 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2539 /* the pre-loop-condition the least important place to 'continue' at */
2540 bcontinue = bprecond;
2543 func->curblock = bprecond;
2546 cgen = self->precond->expression.codegen;
2547 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2550 end_bprecond = func->curblock;
2552 bprecond = end_bprecond = NULL;
2555 /* Now the next blocks won't be ordered nicely, but we need to
2556 * generate them this early for 'break' and 'continue'.
2558 if (self->increment) {
2559 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2562 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2564 bincrement = end_bincrement = NULL;
2567 if (self->postcond) {
2568 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2571 bcontinue = bpostcond; /* postcond comes before the increment */
2573 bpostcond = end_bpostcond = NULL;
2576 bout_id = vec_size(func->ir_func->blocks);
2577 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2582 /* The loop body... */
2583 /* if (self->body) */
2585 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2590 func->curblock = bbody;
2592 vec_push(func->breakblocks, bbreak);
2594 vec_push(func->continueblocks, bcontinue);
2596 vec_push(func->continueblocks, bbody);
2600 cgen = self->body->expression.codegen;
2601 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2605 end_bbody = func->curblock;
2606 vec_pop(func->breakblocks);
2607 vec_pop(func->continueblocks);
2610 /* post-loop-condition */
2614 func->curblock = bpostcond;
2617 cgen = self->postcond->expression.codegen;
2618 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2621 end_bpostcond = func->curblock;
2624 /* The incrementor */
2625 if (self->increment)
2628 func->curblock = bincrement;
2631 cgen = self->increment->expression.codegen;
2632 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2635 end_bincrement = func->curblock;
2638 /* In any case now, we continue from the outgoing block */
2639 func->curblock = bout;
2641 /* Now all blocks are in place */
2642 /* From 'bin' we jump to whatever comes first */
2643 if (bprecond) tmpblock = bprecond;
2644 else if (bbody) tmpblock = bbody;
2645 else if (bpostcond) tmpblock = bpostcond;
2646 else tmpblock = bout;
2647 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2653 ir_block *ontrue, *onfalse;
2654 if (bbody) ontrue = bbody;
2655 else if (bincrement) ontrue = bincrement;
2656 else if (bpostcond) ontrue = bpostcond;
2657 else ontrue = bprecond;
2659 if (self->pre_not) {
2664 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2671 if (bincrement) tmpblock = bincrement;
2672 else if (bpostcond) tmpblock = bpostcond;
2673 else if (bprecond) tmpblock = bprecond;
2674 else tmpblock = bbody;
2675 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2679 /* from increment */
2682 if (bpostcond) tmpblock = bpostcond;
2683 else if (bprecond) tmpblock = bprecond;
2684 else if (bbody) tmpblock = bbody;
2685 else tmpblock = bout;
2686 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2693 ir_block *ontrue, *onfalse;
2694 if (bprecond) ontrue = bprecond;
2695 else if (bbody) ontrue = bbody;
2696 else if (bincrement) ontrue = bincrement;
2697 else ontrue = bpostcond;
2699 if (self->post_not) {
2704 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2708 /* Move 'bout' to the end */
2709 vec_remove(func->ir_func->blocks, bout_id, 1);
2710 vec_push(func->ir_func->blocks, bout);
2715 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2722 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2726 if (self->expression.outr) {
2727 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2730 self->expression.outr = (ir_value*)1;
2732 if (self->is_continue)
2733 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2735 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2738 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2742 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2747 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2749 ast_expression_codegen *cgen;
2751 ast_switch_case *def_case = NULL;
2752 ir_block *def_bfall = NULL;
2753 ir_block *def_bfall_to = NULL;
2754 bool set_def_bfall_to = false;
2756 ir_value *dummy = NULL;
2757 ir_value *irop = NULL;
2758 ir_block *bout = NULL;
2759 ir_block *bfall = NULL;
2767 compile_error(ast_ctx(self), "switch expression is not an l-value");
2771 if (self->expression.outr) {
2772 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2775 self->expression.outr = (ir_value*)1;
2780 cgen = self->operand->expression.codegen;
2781 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2784 if (!vec_size(self->cases))
2787 cmpinstr = type_eq_instr[irop->vtype];
2788 if (cmpinstr >= AINSTR_END) {
2789 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2790 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2794 bout_id = vec_size(func->ir_func->blocks);
2795 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2799 /* setup the break block */
2800 vec_push(func->breakblocks, bout);
2802 /* Now create all cases */
2803 for (c = 0; c < vec_size(self->cases); ++c) {
2804 ir_value *cond, *val;
2805 ir_block *bcase, *bnot;
2808 ast_switch_case *swcase = &self->cases[c];
2810 if (swcase->value) {
2811 /* A regular case */
2812 /* generate the condition operand */
2813 cgen = swcase->value->expression.codegen;
2814 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2816 /* generate the condition */
2817 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2821 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2822 bnot_id = vec_size(func->ir_func->blocks);
2823 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2824 if (!bcase || !bnot)
2826 if (set_def_bfall_to) {
2827 set_def_bfall_to = false;
2828 def_bfall_to = bcase;
2830 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2833 /* Make the previous case-end fall through */
2834 if (bfall && !bfall->final) {
2835 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2839 /* enter the case */
2840 func->curblock = bcase;
2841 cgen = swcase->code->expression.codegen;
2842 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2845 /* remember this block to fall through from */
2846 bfall = func->curblock;
2848 /* enter the else and move it down */
2849 func->curblock = bnot;
2850 vec_remove(func->ir_func->blocks, bnot_id, 1);
2851 vec_push(func->ir_func->blocks, bnot);
2853 /* The default case */
2854 /* Remember where to fall through from: */
2857 /* remember which case it was */
2859 /* And the next case will be remembered */
2860 set_def_bfall_to = true;
2864 /* Jump from the last bnot to bout */
2865 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2867 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2872 /* If there was a default case, put it down here */
2876 /* No need to create an extra block */
2877 bcase = func->curblock;
2879 /* Insert the fallthrough jump */
2880 if (def_bfall && !def_bfall->final) {
2881 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2885 /* Now generate the default code */
2886 cgen = def_case->code->expression.codegen;
2887 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2890 /* see if we need to fall through */
2891 if (def_bfall_to && !func->curblock->final)
2893 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2898 /* Jump from the last bnot to bout */
2899 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2901 /* enter the outgoing block */
2902 func->curblock = bout;
2904 /* restore the break block */
2905 vec_pop(func->breakblocks);
2907 /* Move 'bout' to the end, it's nicer */
2908 vec_remove(func->ir_func->blocks, bout_id, 1);
2909 vec_push(func->ir_func->blocks, bout);
2914 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2919 if (self->undefined) {
2920 compile_error(ast_ctx(self), "internal error: ast_label never defined");
2926 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2930 /* simply create a new block and jump to it */
2931 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2932 if (!self->irblock) {
2933 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2936 if (!func->curblock->final) {
2937 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2941 /* enter the new block */
2942 func->curblock = self->irblock;
2944 /* Generate all the leftover gotos */
2945 for (i = 0; i < vec_size(self->gotos); ++i) {
2946 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2953 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2957 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2961 if (self->target->irblock) {
2962 if (self->irblock_from) {
2963 /* we already tried once, this is the callback */
2964 self->irblock_from->final = false;
2965 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2966 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2972 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
2973 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2980 /* the target has not yet been created...
2981 * close this block in a sneaky way:
2983 func->curblock->final = true;
2984 self->irblock_from = func->curblock;
2985 ast_label_register_goto(self->target, self);
2991 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2993 ast_expression_codegen *cgen;
2995 ir_instr *callinstr;
2998 ir_value *funval = NULL;
3000 /* return values are never lvalues */
3002 compile_error(ast_ctx(self), "not an l-value (function call)");
3006 if (self->expression.outr) {
3007 *out = self->expression.outr;
3011 cgen = self->func->expression.codegen;
3012 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3020 for (i = 0; i < vec_size(self->params); ++i)
3023 ast_expression *expr = self->params[i];
3025 cgen = expr->expression.codegen;
3026 if (!(*cgen)(expr, func, false, ¶m))
3030 vec_push(params, param);
3033 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3034 ast_function_label(func, "call"),
3035 funval, !!(self->func->expression.flags & AST_FLAG_NORETURN));
3039 for (i = 0; i < vec_size(params); ++i) {
3040 ir_call_param(callinstr, params[i]);
3043 *out = ir_call_value(callinstr);
3044 self->expression.outr = *out;
3046 codegen_output_type(self, *out);