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;
899 self->va_count = NULL;
901 ast_type_adopt(self, funcexpr->expression.next);
906 void ast_call_delete(ast_call *self)
909 for (i = 0; i < vec_size(self->params); ++i)
910 ast_unref(self->params[i]);
911 vec_free(self->params);
914 ast_unref(self->func);
917 ast_unref(self->va_count);
919 ast_expression_delete((ast_expression*)self);
923 bool ast_call_check_types(ast_call *self)
929 const ast_expression *func = self->func;
930 size_t count = vec_size(self->params);
931 if (count > vec_size(func->expression.params))
932 count = vec_size(func->expression.params);
934 for (i = 0; i < count; ++i) {
935 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i])))
937 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
938 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
939 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
940 (unsigned int)(i+1), texp, tgot);
941 /* we don't immediately return */
945 count = vec_size(self->params);
946 if (count > vec_size(func->expression.params) && func->expression.varparam) {
947 for (; i < count; ++i) {
948 if (!ast_compare_type(self->params[i], func->expression.varparam))
950 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
951 ast_type_to_string(func->expression.varparam, texp, sizeof(texp));
952 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
953 (unsigned int)(i+1), texp, tgot);
954 /* we don't immediately return */
962 ast_store* ast_store_new(lex_ctx ctx, int op,
963 ast_expression *dest, ast_expression *source)
965 ast_instantiate(ast_store, ctx, ast_store_delete);
966 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
968 ast_side_effects(self) = true;
972 self->source = source;
974 if (!ast_type_adopt(self, dest)) {
982 void ast_store_delete(ast_store *self)
984 ast_unref(self->dest);
985 ast_unref(self->source);
986 ast_expression_delete((ast_expression*)self);
990 ast_block* ast_block_new(lex_ctx ctx)
992 ast_instantiate(ast_block, ctx, ast_block_delete);
993 ast_expression_init((ast_expression*)self,
994 (ast_expression_codegen*)&ast_block_codegen);
998 self->collect = NULL;
1003 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1005 ast_propagate_effects(self, e);
1006 vec_push(self->exprs, e);
1007 if (self->expression.next) {
1008 ast_delete(self->expression.next);
1009 self->expression.next = NULL;
1011 if (!ast_type_adopt(self, e)) {
1012 compile_error(ast_ctx(self), "internal error: failed to adopt type");
1018 void ast_block_collect(ast_block *self, ast_expression *expr)
1020 vec_push(self->collect, expr);
1021 expr->expression.node.keep = true;
1024 void ast_block_delete(ast_block *self)
1027 for (i = 0; i < vec_size(self->exprs); ++i)
1028 ast_unref(self->exprs[i]);
1029 vec_free(self->exprs);
1030 for (i = 0; i < vec_size(self->locals); ++i)
1031 ast_delete(self->locals[i]);
1032 vec_free(self->locals);
1033 for (i = 0; i < vec_size(self->collect); ++i)
1034 ast_delete(self->collect[i]);
1035 vec_free(self->collect);
1036 ast_expression_delete((ast_expression*)self);
1040 bool ast_block_set_type(ast_block *self, ast_expression *from)
1042 if (self->expression.next)
1043 ast_delete(self->expression.next);
1044 if (!ast_type_adopt(self, from))
1049 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1051 ast_instantiate(ast_function, ctx, ast_function_delete);
1055 vtype->expression.vtype != TYPE_FUNCTION)
1057 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1059 (int)vtype->hasvalue,
1060 vtype->expression.vtype);
1065 self->vtype = vtype;
1066 self->name = name ? util_strdup(name) : NULL;
1067 self->blocks = NULL;
1069 self->labelcount = 0;
1072 self->ir_func = NULL;
1073 self->curblock = NULL;
1075 self->breakblocks = NULL;
1076 self->continueblocks = NULL;
1078 vtype->hasvalue = true;
1079 vtype->constval.vfunc = self;
1081 self->varargs = NULL;
1086 void ast_function_delete(ast_function *self)
1090 mem_d((void*)self->name);
1092 /* ast_value_delete(self->vtype); */
1093 self->vtype->hasvalue = false;
1094 self->vtype->constval.vfunc = NULL;
1095 /* We use unref - if it was stored in a global table it is supposed
1096 * to be deleted from *there*
1098 ast_unref(self->vtype);
1100 for (i = 0; i < vec_size(self->blocks); ++i)
1101 ast_delete(self->blocks[i]);
1102 vec_free(self->blocks);
1103 vec_free(self->breakblocks);
1104 vec_free(self->continueblocks);
1106 ast_delete(self->varargs);
1110 const char* ast_function_label(ast_function *self, const char *prefix)
1116 if (!opts.dump && !opts.dumpfin && !opts.debug)
1119 id = (self->labelcount++);
1120 len = strlen(prefix);
1122 from = self->labelbuf + sizeof(self->labelbuf)-1;
1125 *from-- = (id%10) + '0';
1129 memcpy(from - len, prefix, len);
1133 /*********************************************************************/
1135 * by convention you must never pass NULL to the 'ir_value **out'
1136 * parameter. If you really don't care about the output, pass a dummy.
1137 * But I can't imagine a pituation where the output is truly unnecessary.
1140 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1142 if (out->vtype == TYPE_FIELD)
1143 out->fieldtype = self->next->expression.vtype;
1144 if (out->vtype == TYPE_FUNCTION)
1145 out->outtype = self->next->expression.vtype;
1148 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1150 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1154 if (self->expression.vtype == TYPE_NIL) {
1155 *out = func->ir_func->owner->nil;
1158 /* NOTE: This is the codegen for a variable used in an expression.
1159 * It is not the codegen to generate the value. For this purpose,
1160 * ast_local_codegen and ast_global_codegen are to be used before this
1161 * is executed. ast_function_codegen should take care of its locals,
1162 * and the ast-user should take care of ast_global_codegen to be used
1163 * on all the globals.
1166 char tname[1024]; /* typename is reserved in C++ */
1167 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1168 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1175 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1179 if (self->expression.vtype == TYPE_NIL) {
1180 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1184 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1186 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1189 func->context = ast_ctx(self);
1190 func->value->context = ast_ctx(self);
1192 self->constval.vfunc->ir_func = func;
1193 self->ir_v = func->value;
1194 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1195 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1196 /* The function is filled later on ast_function_codegen... */
1200 if (isfield && self->expression.vtype == TYPE_FIELD) {
1201 ast_expression *fieldtype = self->expression.next;
1203 if (self->hasvalue) {
1204 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1208 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1213 ast_expression_common *elemtype;
1215 ast_value *array = (ast_value*)fieldtype;
1217 if (!ast_istype(fieldtype, ast_value)) {
1218 compile_error(ast_ctx(self), "internal error: ast_value required");
1222 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1223 if (!array->expression.count || array->expression.count > opts.max_array_size)
1224 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1226 elemtype = &array->expression.next->expression;
1227 vtype = elemtype->vtype;
1229 v = ir_builder_create_field(ir, self->name, vtype);
1231 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1234 v->context = ast_ctx(self);
1235 v->unique_life = true;
1237 array->ir_v = self->ir_v = v;
1238 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1239 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1241 namelen = strlen(self->name);
1242 name = (char*)mem_a(namelen + 16);
1243 strcpy(name, self->name);
1245 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1246 array->ir_values[0] = v;
1247 for (ai = 1; ai < array->expression.count; ++ai) {
1248 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1249 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1250 if (!array->ir_values[ai]) {
1252 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1255 array->ir_values[ai]->context = ast_ctx(self);
1256 array->ir_values[ai]->unique_life = true;
1257 array->ir_values[ai]->locked = true;
1258 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1259 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1265 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1268 v->context = ast_ctx(self);
1270 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1271 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1276 if (self->expression.vtype == TYPE_ARRAY) {
1281 ast_expression_common *elemtype = &self->expression.next->expression;
1282 int vtype = elemtype->vtype;
1284 /* same as with field arrays */
1285 if (!self->expression.count || self->expression.count > opts.max_array_size)
1286 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1288 v = ir_builder_create_global(ir, self->name, vtype);
1290 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1293 v->context = ast_ctx(self);
1294 v->unique_life = true;
1296 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1297 v->flags |= IR_FLAG_INCLUDE_DEF;
1299 namelen = strlen(self->name);
1300 name = (char*)mem_a(namelen + 16);
1301 strcpy(name, self->name);
1303 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1304 self->ir_values[0] = v;
1305 for (ai = 1; ai < self->expression.count; ++ai) {
1306 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1307 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1308 if (!self->ir_values[ai]) {
1310 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1313 self->ir_values[ai]->context = ast_ctx(self);
1314 self->ir_values[ai]->unique_life = true;
1315 self->ir_values[ai]->locked = true;
1316 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1317 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1323 /* Arrays don't do this since there's no "array" value which spans across the
1326 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1328 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1331 codegen_output_type(self, v);
1332 v->context = ast_ctx(self);
1335 if (self->hasvalue) {
1336 switch (self->expression.vtype)
1339 if (!ir_value_set_float(v, self->constval.vfloat))
1343 if (!ir_value_set_vector(v, self->constval.vvec))
1347 if (!ir_value_set_string(v, self->constval.vstring))
1351 compile_error(ast_ctx(self), "TODO: global constant array");
1354 compile_error(ast_ctx(self), "global of type function not properly generated");
1356 /* Cannot generate an IR value for a function,
1357 * need a pointer pointing to a function rather.
1360 if (!self->constval.vfield) {
1361 compile_error(ast_ctx(self), "field constant without vfield set");
1364 if (!self->constval.vfield->ir_v) {
1365 compile_error(ast_ctx(self), "field constant generated before its field");
1368 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1372 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1377 /* link us to the ir_value */
1380 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1381 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1384 error: /* clean up */
1389 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1393 if (self->expression.vtype == TYPE_NIL) {
1394 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1398 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1400 /* Do we allow local functions? I think not...
1401 * this is NOT a function pointer atm.
1406 if (self->expression.vtype == TYPE_ARRAY) {
1411 ast_expression_common *elemtype = &self->expression.next->expression;
1412 int vtype = elemtype->vtype;
1414 func->flags |= IR_FLAG_HAS_ARRAYS;
1416 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1417 compile_error(ast_ctx(self), "array-parameters are not supported");
1421 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1422 if (!self->expression.count || self->expression.count > opts.max_array_size) {
1423 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1426 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1427 if (!self->ir_values) {
1428 compile_error(ast_ctx(self), "failed to allocate array values");
1432 v = ir_function_create_local(func, self->name, vtype, param);
1434 compile_error(ast_ctx(self), "ir_function_create_local failed");
1437 v->context = ast_ctx(self);
1438 v->unique_life = true;
1441 namelen = strlen(self->name);
1442 name = (char*)mem_a(namelen + 16);
1443 strcpy(name, self->name);
1445 self->ir_values[0] = v;
1446 for (ai = 1; ai < self->expression.count; ++ai) {
1447 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1448 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1449 if (!self->ir_values[ai]) {
1450 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1453 self->ir_values[ai]->context = ast_ctx(self);
1454 self->ir_values[ai]->unique_life = true;
1455 self->ir_values[ai]->locked = true;
1460 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1463 codegen_output_type(self, v);
1464 v->context = ast_ctx(self);
1467 /* A constant local... hmmm...
1468 * I suppose the IR will have to deal with this
1470 if (self->hasvalue) {
1471 switch (self->expression.vtype)
1474 if (!ir_value_set_float(v, self->constval.vfloat))
1478 if (!ir_value_set_vector(v, self->constval.vvec))
1482 if (!ir_value_set_string(v, self->constval.vstring))
1486 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1491 /* link us to the ir_value */
1495 if (!ast_generate_accessors(self, func->owner))
1499 error: /* clean up */
1504 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1507 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1508 if (!self->setter || !self->getter)
1510 for (i = 0; i < self->expression.count; ++i) {
1511 if (!self->ir_values) {
1512 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1515 if (!self->ir_values[i]) {
1516 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1519 if (self->ir_values[i]->life) {
1520 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1525 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1527 if (!ast_global_codegen (self->setter, ir, false) ||
1528 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1529 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1531 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1532 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1537 if (!ast_global_codegen (self->getter, ir, false) ||
1538 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1539 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1541 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1542 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1546 for (i = 0; i < self->expression.count; ++i) {
1547 vec_free(self->ir_values[i]->life);
1549 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1553 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1557 ast_expression_common *ec;
1562 irf = self->ir_func;
1564 compile_error(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1568 /* fill the parameter list */
1569 ec = &self->vtype->expression;
1570 for (i = 0; i < vec_size(ec->params); ++i)
1572 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1573 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1575 vec_push(irf->params, ec->params[i]->expression.vtype);
1576 if (!self->builtin) {
1577 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1582 if (self->varargs) {
1583 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1585 irf->max_varargs = self->varargs->expression.count;
1588 if (self->builtin) {
1589 irf->builtin = self->builtin;
1593 if (!vec_size(self->blocks)) {
1594 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1598 self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1599 if (!self->curblock) {
1600 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1604 for (i = 0; i < vec_size(self->blocks); ++i) {
1605 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1606 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1610 /* TODO: check return types */
1611 if (!self->curblock->final)
1613 if (!self->vtype->expression.next ||
1614 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1616 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1618 else if (vec_size(self->curblock->entries))
1620 /* error("missing return"); */
1621 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1622 "control reaches end of non-void function (`%s`) via %s",
1623 self->name, self->curblock->label))
1627 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1633 /* Note, you will not see ast_block_codegen generate ir_blocks.
1634 * To the AST and the IR, blocks are 2 different things.
1635 * In the AST it represents a block of code, usually enclosed in
1636 * curly braces {...}.
1637 * While in the IR it represents a block in terms of control-flow.
1639 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1643 /* We don't use this
1644 * Note: an ast-representation using the comma-operator
1645 * of the form: (a, b, c) = x should not assign to c...
1648 compile_error(ast_ctx(self), "not an l-value (code-block)");
1652 if (self->expression.outr) {
1653 *out = self->expression.outr;
1657 /* output is NULL at first, we'll have each expression
1658 * assign to out output, thus, a comma-operator represention
1659 * using an ast_block will return the last generated value,
1660 * so: (b, c) + a executed both b and c, and returns c,
1661 * which is then added to a.
1665 /* generate locals */
1666 for (i = 0; i < vec_size(self->locals); ++i)
1668 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1670 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1675 for (i = 0; i < vec_size(self->exprs); ++i)
1677 ast_expression_codegen *gen;
1678 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1679 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1683 gen = self->exprs[i]->expression.codegen;
1684 if (!(*gen)(self->exprs[i], func, false, out))
1688 self->expression.outr = *out;
1693 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1695 ast_expression_codegen *cgen;
1696 ir_value *left = NULL;
1697 ir_value *right = NULL;
1701 ast_array_index *ai = NULL;
1703 if (lvalue && self->expression.outl) {
1704 *out = self->expression.outl;
1708 if (!lvalue && self->expression.outr) {
1709 *out = self->expression.outr;
1713 if (ast_istype(self->dest, ast_array_index))
1716 ai = (ast_array_index*)self->dest;
1717 idx = (ast_value*)ai->index;
1719 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1724 /* we need to call the setter */
1725 ir_value *iridx, *funval;
1729 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1733 arr = (ast_value*)ai->array;
1734 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1735 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1739 cgen = idx->expression.codegen;
1740 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1743 cgen = arr->setter->expression.codegen;
1744 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1747 cgen = self->source->expression.codegen;
1748 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1751 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1754 ir_call_param(call, iridx);
1755 ir_call_param(call, right);
1756 self->expression.outr = right;
1762 cgen = self->dest->expression.codegen;
1764 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1766 self->expression.outl = left;
1768 cgen = self->source->expression.codegen;
1770 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1773 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1775 self->expression.outr = right;
1778 /* Theoretically, an assinment returns its left side as an
1779 * lvalue, if we don't need an lvalue though, we return
1780 * the right side as an rvalue, otherwise we have to
1781 * somehow know whether or not we need to dereference the pointer
1782 * on the left side - that is: OP_LOAD if it was an address.
1783 * Also: in original QC we cannot OP_LOADP *anyway*.
1785 *out = (lvalue ? left : right);
1790 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1792 ast_expression_codegen *cgen;
1793 ir_value *left, *right;
1795 /* A binary operation cannot yield an l-value */
1797 compile_error(ast_ctx(self), "not an l-value (binop)");
1801 if (self->expression.outr) {
1802 *out = self->expression.outr;
1806 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1807 (self->op == INSTR_AND || self->op == INSTR_OR))
1809 /* short circuit evaluation */
1810 ir_block *other, *merge;
1811 ir_block *from_left, *from_right;
1815 /* prepare end-block */
1816 merge_id = vec_size(func->ir_func->blocks);
1817 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1819 /* generate the left expression */
1820 cgen = self->left->expression.codegen;
1821 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1823 /* remember the block */
1824 from_left = func->curblock;
1826 /* create a new block for the right expression */
1827 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1828 if (self->op == INSTR_AND) {
1829 /* on AND: left==true -> other */
1830 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1833 /* on OR: left==false -> other */
1834 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1837 /* use the likely flag */
1838 vec_last(func->curblock->instr)->likely = true;
1840 /* enter the right-expression's block */
1841 func->curblock = other;
1843 cgen = self->right->expression.codegen;
1844 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1846 /* remember block */
1847 from_right = func->curblock;
1849 /* jump to the merge block */
1850 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1853 vec_remove(func->ir_func->blocks, merge_id, 1);
1854 vec_push(func->ir_func->blocks, merge);
1856 func->curblock = merge;
1857 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1858 ast_function_label(func, "sce_value"),
1859 self->expression.vtype);
1860 ir_phi_add(phi, from_left, left);
1861 ir_phi_add(phi, from_right, right);
1862 *out = ir_phi_value(phi);
1866 if (!OPTS_FLAG(PERL_LOGIC)) {
1868 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1869 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1870 ast_function_label(func, "sce_bool_v"),
1874 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1875 ast_function_label(func, "sce_bool"),
1880 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
1881 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1882 ast_function_label(func, "sce_bool_s"),
1886 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1887 ast_function_label(func, "sce_bool"),
1893 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
1894 ast_function_label(func, "sce_bool"),
1895 INSTR_AND, *out, *out);
1901 self->expression.outr = *out;
1902 codegen_output_type(self, *out);
1906 cgen = self->left->expression.codegen;
1907 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1910 cgen = self->right->expression.codegen;
1911 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1914 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1915 self->op, left, right);
1918 self->expression.outr = *out;
1919 codegen_output_type(self, *out);
1924 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1926 ast_expression_codegen *cgen;
1927 ir_value *leftl = NULL, *leftr, *right, *bin;
1931 ast_array_index *ai = NULL;
1932 ir_value *iridx = NULL;
1934 if (lvalue && self->expression.outl) {
1935 *out = self->expression.outl;
1939 if (!lvalue && self->expression.outr) {
1940 *out = self->expression.outr;
1944 if (ast_istype(self->dest, ast_array_index))
1947 ai = (ast_array_index*)self->dest;
1948 idx = (ast_value*)ai->index;
1950 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1954 /* for a binstore we need both an lvalue and an rvalue for the left side */
1955 /* rvalue of destination! */
1957 cgen = idx->expression.codegen;
1958 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1961 cgen = self->dest->expression.codegen;
1962 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1965 /* source as rvalue only */
1966 cgen = self->source->expression.codegen;
1967 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1970 /* now the binary */
1971 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1972 self->opbin, leftr, right);
1973 self->expression.outr = bin;
1977 /* we need to call the setter */
1982 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1986 arr = (ast_value*)ai->array;
1987 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1988 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1992 cgen = arr->setter->expression.codegen;
1993 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1996 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1999 ir_call_param(call, iridx);
2000 ir_call_param(call, bin);
2001 self->expression.outr = bin;
2003 /* now store them */
2004 cgen = self->dest->expression.codegen;
2005 /* lvalue of destination */
2006 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2008 self->expression.outl = leftl;
2010 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2012 self->expression.outr = bin;
2015 /* Theoretically, an assinment returns its left side as an
2016 * lvalue, if we don't need an lvalue though, we return
2017 * the right side as an rvalue, otherwise we have to
2018 * somehow know whether or not we need to dereference the pointer
2019 * on the left side - that is: OP_LOAD if it was an address.
2020 * Also: in original QC we cannot OP_LOADP *anyway*.
2022 *out = (lvalue ? leftl : bin);
2027 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2029 ast_expression_codegen *cgen;
2032 /* An unary operation cannot yield an l-value */
2034 compile_error(ast_ctx(self), "not an l-value (binop)");
2038 if (self->expression.outr) {
2039 *out = self->expression.outr;
2043 cgen = self->operand->expression.codegen;
2045 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2048 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2052 self->expression.outr = *out;
2057 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2059 ast_expression_codegen *cgen;
2064 /* In the context of a return operation, we don't actually return
2068 compile_error(ast_ctx(self), "return-expression is not an l-value");
2072 if (self->expression.outr) {
2073 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2076 self->expression.outr = (ir_value*)1;
2078 if (self->operand) {
2079 cgen = self->operand->expression.codegen;
2081 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2084 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2087 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2094 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2096 ast_expression_codegen *cgen;
2097 ir_value *ent, *field;
2099 /* This function needs to take the 'lvalue' flag into account!
2100 * As lvalue we provide a field-pointer, as rvalue we provide the
2104 if (lvalue && self->expression.outl) {
2105 *out = self->expression.outl;
2109 if (!lvalue && self->expression.outr) {
2110 *out = self->expression.outr;
2114 cgen = self->entity->expression.codegen;
2115 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2118 cgen = self->field->expression.codegen;
2119 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2124 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2127 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2128 ent, field, self->expression.vtype);
2129 /* Done AFTER error checking:
2130 codegen_output_type(self, *out);
2134 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2135 (lvalue ? "ADDRESS" : "FIELD"),
2136 type_name[self->expression.vtype]);
2140 codegen_output_type(self, *out);
2143 self->expression.outl = *out;
2145 self->expression.outr = *out;
2147 /* Hm that should be it... */
2151 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2153 ast_expression_codegen *cgen;
2156 /* in QC this is always an lvalue */
2157 if (lvalue && self->rvalue) {
2158 compile_error(ast_ctx(self), "not an l-value (member access)");
2161 if (self->expression.outl) {
2162 *out = self->expression.outl;
2166 cgen = self->owner->expression.codegen;
2167 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2170 if (vec->vtype != TYPE_VECTOR &&
2171 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2176 *out = ir_value_vector_member(vec, self->field);
2177 self->expression.outl = *out;
2179 return (*out != NULL);
2182 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2187 if (!lvalue && self->expression.outr) {
2188 *out = self->expression.outr;
2190 if (lvalue && self->expression.outl) {
2191 *out = self->expression.outl;
2194 if (!ast_istype(self->array, ast_value)) {
2195 compile_error(ast_ctx(self), "array indexing this way is not supported");
2196 /* note this would actually be pointer indexing because the left side is
2197 * not an actual array but (hopefully) an indexable expression.
2198 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2199 * support this path will be filled.
2204 arr = (ast_value*)self->array;
2205 idx = (ast_value*)self->index;
2207 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2208 /* Time to use accessor functions */
2209 ast_expression_codegen *cgen;
2210 ir_value *iridx, *funval;
2214 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2219 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2223 cgen = self->index->expression.codegen;
2224 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2227 cgen = arr->getter->expression.codegen;
2228 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2231 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2234 ir_call_param(call, iridx);
2236 *out = ir_call_value(call);
2237 self->expression.outr = *out;
2241 if (idx->expression.vtype == TYPE_FLOAT) {
2242 unsigned int arridx = idx->constval.vfloat;
2243 if (arridx >= self->array->expression.count)
2245 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2248 *out = arr->ir_values[arridx];
2250 else if (idx->expression.vtype == TYPE_INTEGER) {
2251 unsigned int arridx = idx->constval.vint;
2252 if (arridx >= self->array->expression.count)
2254 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2257 *out = arr->ir_values[arridx];
2260 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2266 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2268 ast_expression_codegen *cgen;
2276 ir_block *ontrue_endblock = NULL;
2277 ir_block *onfalse_endblock = NULL;
2278 ir_block *merge = NULL;
2280 /* We don't output any value, thus also don't care about r/lvalue */
2284 if (self->expression.outr) {
2285 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2288 self->expression.outr = (ir_value*)1;
2290 /* generate the condition */
2291 cgen = self->cond->expression.codegen;
2292 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2294 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2295 cond = func->curblock;
2299 if (self->on_true) {
2300 /* create on-true block */
2301 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2305 /* enter the block */
2306 func->curblock = ontrue;
2309 cgen = self->on_true->expression.codegen;
2310 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2313 /* we now need to work from the current endpoint */
2314 ontrue_endblock = func->curblock;
2319 if (self->on_false) {
2320 /* create on-false block */
2321 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2325 /* enter the block */
2326 func->curblock = onfalse;
2329 cgen = self->on_false->expression.codegen;
2330 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2333 /* we now need to work from the current endpoint */
2334 onfalse_endblock = func->curblock;
2338 /* Merge block were they all merge in to */
2339 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2341 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2344 /* add jumps ot the merge block */
2345 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2347 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2350 /* Now enter the merge block */
2351 func->curblock = merge;
2354 /* we create the if here, that way all blocks are ordered :)
2356 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2357 (ontrue ? ontrue : merge),
2358 (onfalse ? onfalse : merge)))
2366 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2368 ast_expression_codegen *cgen;
2371 ir_value *trueval, *falseval;
2374 ir_block *cond = func->curblock;
2375 ir_block *cond_out = NULL;
2376 ir_block *ontrue, *ontrue_out = NULL;
2377 ir_block *onfalse, *onfalse_out = NULL;
2380 /* Ternary can never create an lvalue... */
2384 /* In theory it shouldn't be possible to pass through a node twice, but
2385 * in case we add any kind of optimization pass for the AST itself, it
2386 * may still happen, thus we remember a created ir_value and simply return one
2387 * if it already exists.
2389 if (self->expression.outr) {
2390 *out = self->expression.outr;
2394 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2396 /* generate the condition */
2397 func->curblock = cond;
2398 cgen = self->cond->expression.codegen;
2399 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2401 cond_out = func->curblock;
2403 /* create on-true block */
2404 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2409 /* enter the block */
2410 func->curblock = ontrue;
2413 cgen = self->on_true->expression.codegen;
2414 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2417 ontrue_out = func->curblock;
2420 /* create on-false block */
2421 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2426 /* enter the block */
2427 func->curblock = onfalse;
2430 cgen = self->on_false->expression.codegen;
2431 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2434 onfalse_out = func->curblock;
2437 /* create merge block */
2438 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2441 /* jump to merge block */
2442 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2444 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2447 /* create if instruction */
2448 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2451 /* Now enter the merge block */
2452 func->curblock = merge;
2454 /* Here, now, we need a PHI node
2455 * but first some sanity checking...
2457 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2458 /* error("ternary with different types on the two sides"); */
2459 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2464 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2466 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2469 ir_phi_add(phi, ontrue_out, trueval);
2470 ir_phi_add(phi, onfalse_out, falseval);
2472 self->expression.outr = ir_phi_value(phi);
2473 *out = self->expression.outr;
2475 codegen_output_type(self, *out);
2480 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2482 ast_expression_codegen *cgen;
2484 ir_value *dummy = NULL;
2485 ir_value *precond = NULL;
2486 ir_value *postcond = NULL;
2488 /* Since we insert some jumps "late" so we have blocks
2489 * ordered "nicely", we need to keep track of the actual end-blocks
2490 * of expressions to add the jumps to.
2492 ir_block *bbody = NULL, *end_bbody = NULL;
2493 ir_block *bprecond = NULL, *end_bprecond = NULL;
2494 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2495 ir_block *bincrement = NULL, *end_bincrement = NULL;
2496 ir_block *bout = NULL, *bin = NULL;
2498 /* let's at least move the outgoing block to the end */
2501 /* 'break' and 'continue' need to be able to find the right blocks */
2502 ir_block *bcontinue = NULL;
2503 ir_block *bbreak = NULL;
2505 ir_block *tmpblock = NULL;
2510 if (self->expression.outr) {
2511 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2514 self->expression.outr = (ir_value*)1;
2517 * Should we ever need some kind of block ordering, better make this function
2518 * move blocks around than write a block ordering algorithm later... after all
2519 * the ast and ir should work together, not against each other.
2522 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2523 * anyway if for example it contains a ternary.
2527 cgen = self->initexpr->expression.codegen;
2528 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2532 /* Store the block from which we enter this chaos */
2533 bin = func->curblock;
2535 /* The pre-loop condition needs its own block since we
2536 * need to be able to jump to the start of that expression.
2540 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2544 /* the pre-loop-condition the least important place to 'continue' at */
2545 bcontinue = bprecond;
2548 func->curblock = bprecond;
2551 cgen = self->precond->expression.codegen;
2552 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2555 end_bprecond = func->curblock;
2557 bprecond = end_bprecond = NULL;
2560 /* Now the next blocks won't be ordered nicely, but we need to
2561 * generate them this early for 'break' and 'continue'.
2563 if (self->increment) {
2564 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2567 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2569 bincrement = end_bincrement = NULL;
2572 if (self->postcond) {
2573 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2576 bcontinue = bpostcond; /* postcond comes before the increment */
2578 bpostcond = end_bpostcond = NULL;
2581 bout_id = vec_size(func->ir_func->blocks);
2582 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2587 /* The loop body... */
2588 /* if (self->body) */
2590 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2595 func->curblock = bbody;
2597 vec_push(func->breakblocks, bbreak);
2599 vec_push(func->continueblocks, bcontinue);
2601 vec_push(func->continueblocks, bbody);
2605 cgen = self->body->expression.codegen;
2606 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2610 end_bbody = func->curblock;
2611 vec_pop(func->breakblocks);
2612 vec_pop(func->continueblocks);
2615 /* post-loop-condition */
2619 func->curblock = bpostcond;
2622 cgen = self->postcond->expression.codegen;
2623 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2626 end_bpostcond = func->curblock;
2629 /* The incrementor */
2630 if (self->increment)
2633 func->curblock = bincrement;
2636 cgen = self->increment->expression.codegen;
2637 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2640 end_bincrement = func->curblock;
2643 /* In any case now, we continue from the outgoing block */
2644 func->curblock = bout;
2646 /* Now all blocks are in place */
2647 /* From 'bin' we jump to whatever comes first */
2648 if (bprecond) tmpblock = bprecond;
2649 else if (bbody) tmpblock = bbody;
2650 else if (bpostcond) tmpblock = bpostcond;
2651 else tmpblock = bout;
2652 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2658 ir_block *ontrue, *onfalse;
2659 if (bbody) ontrue = bbody;
2660 else if (bincrement) ontrue = bincrement;
2661 else if (bpostcond) ontrue = bpostcond;
2662 else ontrue = bprecond;
2664 if (self->pre_not) {
2669 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2676 if (bincrement) tmpblock = bincrement;
2677 else if (bpostcond) tmpblock = bpostcond;
2678 else if (bprecond) tmpblock = bprecond;
2679 else tmpblock = bbody;
2680 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2684 /* from increment */
2687 if (bpostcond) tmpblock = bpostcond;
2688 else if (bprecond) tmpblock = bprecond;
2689 else if (bbody) tmpblock = bbody;
2690 else tmpblock = bout;
2691 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2698 ir_block *ontrue, *onfalse;
2699 if (bprecond) ontrue = bprecond;
2700 else if (bbody) ontrue = bbody;
2701 else if (bincrement) ontrue = bincrement;
2702 else ontrue = bpostcond;
2704 if (self->post_not) {
2709 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2713 /* Move 'bout' to the end */
2714 vec_remove(func->ir_func->blocks, bout_id, 1);
2715 vec_push(func->ir_func->blocks, bout);
2720 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2727 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2731 if (self->expression.outr) {
2732 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2735 self->expression.outr = (ir_value*)1;
2737 if (self->is_continue)
2738 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2740 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2743 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2747 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2752 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2754 ast_expression_codegen *cgen;
2756 ast_switch_case *def_case = NULL;
2757 ir_block *def_bfall = NULL;
2758 ir_block *def_bfall_to = NULL;
2759 bool set_def_bfall_to = false;
2761 ir_value *dummy = NULL;
2762 ir_value *irop = NULL;
2763 ir_block *bout = NULL;
2764 ir_block *bfall = NULL;
2772 compile_error(ast_ctx(self), "switch expression is not an l-value");
2776 if (self->expression.outr) {
2777 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2780 self->expression.outr = (ir_value*)1;
2785 cgen = self->operand->expression.codegen;
2786 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2789 if (!vec_size(self->cases))
2792 cmpinstr = type_eq_instr[irop->vtype];
2793 if (cmpinstr >= AINSTR_END) {
2794 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2795 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2799 bout_id = vec_size(func->ir_func->blocks);
2800 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2804 /* setup the break block */
2805 vec_push(func->breakblocks, bout);
2807 /* Now create all cases */
2808 for (c = 0; c < vec_size(self->cases); ++c) {
2809 ir_value *cond, *val;
2810 ir_block *bcase, *bnot;
2813 ast_switch_case *swcase = &self->cases[c];
2815 if (swcase->value) {
2816 /* A regular case */
2817 /* generate the condition operand */
2818 cgen = swcase->value->expression.codegen;
2819 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2821 /* generate the condition */
2822 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2826 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2827 bnot_id = vec_size(func->ir_func->blocks);
2828 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2829 if (!bcase || !bnot)
2831 if (set_def_bfall_to) {
2832 set_def_bfall_to = false;
2833 def_bfall_to = bcase;
2835 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2838 /* Make the previous case-end fall through */
2839 if (bfall && !bfall->final) {
2840 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2844 /* enter the case */
2845 func->curblock = bcase;
2846 cgen = swcase->code->expression.codegen;
2847 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2850 /* remember this block to fall through from */
2851 bfall = func->curblock;
2853 /* enter the else and move it down */
2854 func->curblock = bnot;
2855 vec_remove(func->ir_func->blocks, bnot_id, 1);
2856 vec_push(func->ir_func->blocks, bnot);
2858 /* The default case */
2859 /* Remember where to fall through from: */
2862 /* remember which case it was */
2864 /* And the next case will be remembered */
2865 set_def_bfall_to = true;
2869 /* Jump from the last bnot to bout */
2870 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2872 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2877 /* If there was a default case, put it down here */
2881 /* No need to create an extra block */
2882 bcase = func->curblock;
2884 /* Insert the fallthrough jump */
2885 if (def_bfall && !def_bfall->final) {
2886 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2890 /* Now generate the default code */
2891 cgen = def_case->code->expression.codegen;
2892 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2895 /* see if we need to fall through */
2896 if (def_bfall_to && !func->curblock->final)
2898 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2903 /* Jump from the last bnot to bout */
2904 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2906 /* enter the outgoing block */
2907 func->curblock = bout;
2909 /* restore the break block */
2910 vec_pop(func->breakblocks);
2912 /* Move 'bout' to the end, it's nicer */
2913 vec_remove(func->ir_func->blocks, bout_id, 1);
2914 vec_push(func->ir_func->blocks, bout);
2919 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2924 if (self->undefined) {
2925 compile_error(ast_ctx(self), "internal error: ast_label never defined");
2931 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2935 /* simply create a new block and jump to it */
2936 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2937 if (!self->irblock) {
2938 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2941 if (!func->curblock->final) {
2942 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2946 /* enter the new block */
2947 func->curblock = self->irblock;
2949 /* Generate all the leftover gotos */
2950 for (i = 0; i < vec_size(self->gotos); ++i) {
2951 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2958 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2962 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2966 if (self->target->irblock) {
2967 if (self->irblock_from) {
2968 /* we already tried once, this is the callback */
2969 self->irblock_from->final = false;
2970 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2971 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2977 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
2978 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2985 /* the target has not yet been created...
2986 * close this block in a sneaky way:
2988 func->curblock->final = true;
2989 self->irblock_from = func->curblock;
2990 ast_label_register_goto(self->target, self);
2996 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2998 ast_expression_codegen *cgen;
3000 ir_instr *callinstr;
3003 ir_value *funval = NULL;
3005 /* return values are never lvalues */
3007 compile_error(ast_ctx(self), "not an l-value (function call)");
3011 if (self->expression.outr) {
3012 *out = self->expression.outr;
3016 cgen = self->func->expression.codegen;
3017 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3025 for (i = 0; i < vec_size(self->params); ++i)
3028 ast_expression *expr = self->params[i];
3030 cgen = expr->expression.codegen;
3031 if (!(*cgen)(expr, func, false, ¶m))
3035 vec_push(params, param);
3038 /* varargs counter */
3039 if (self->va_count) {
3041 ir_builder *builder = func->curblock->owner->owner;
3042 cgen = self->va_count->expression.codegen;
3043 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3045 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3046 ir_builder_get_va_count(builder), va_count))
3052 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3053 ast_function_label(func, "call"),
3054 funval, !!(self->func->expression.flags & AST_FLAG_NORETURN));
3058 for (i = 0; i < vec_size(params); ++i) {
3059 ir_call_param(callinstr, params[i]);
3062 *out = ir_call_value(callinstr);
3063 self->expression.outr = *out;
3065 codegen_output_type(self, *out);