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 if (!funcexpr->expression.next) {
894 compile_error(ctx, "not a function");
898 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
900 ast_side_effects(self) = true;
903 self->func = funcexpr;
904 self->va_count = NULL;
906 ast_type_adopt(self, funcexpr->expression.next);
911 void ast_call_delete(ast_call *self)
914 for (i = 0; i < vec_size(self->params); ++i)
915 ast_unref(self->params[i]);
916 vec_free(self->params);
919 ast_unref(self->func);
922 ast_unref(self->va_count);
924 ast_expression_delete((ast_expression*)self);
928 bool ast_call_check_types(ast_call *self)
934 const ast_expression *func = self->func;
935 size_t count = vec_size(self->params);
936 if (count > vec_size(func->expression.params))
937 count = vec_size(func->expression.params);
939 for (i = 0; i < count; ++i) {
940 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i])))
942 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
943 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
944 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
945 (unsigned int)(i+1), texp, tgot);
946 /* we don't immediately return */
950 count = vec_size(self->params);
951 if (count > vec_size(func->expression.params) && func->expression.varparam) {
952 for (; i < count; ++i) {
953 if (!ast_compare_type(self->params[i], func->expression.varparam))
955 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
956 ast_type_to_string(func->expression.varparam, texp, sizeof(texp));
957 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
958 (unsigned int)(i+1), texp, tgot);
959 /* we don't immediately return */
967 ast_store* ast_store_new(lex_ctx ctx, int op,
968 ast_expression *dest, ast_expression *source)
970 ast_instantiate(ast_store, ctx, ast_store_delete);
971 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
973 ast_side_effects(self) = true;
977 self->source = source;
979 if (!ast_type_adopt(self, dest)) {
987 void ast_store_delete(ast_store *self)
989 ast_unref(self->dest);
990 ast_unref(self->source);
991 ast_expression_delete((ast_expression*)self);
995 ast_block* ast_block_new(lex_ctx ctx)
997 ast_instantiate(ast_block, ctx, ast_block_delete);
998 ast_expression_init((ast_expression*)self,
999 (ast_expression_codegen*)&ast_block_codegen);
1001 self->locals = NULL;
1003 self->collect = NULL;
1008 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1010 ast_propagate_effects(self, e);
1011 vec_push(self->exprs, e);
1012 if (self->expression.next) {
1013 ast_delete(self->expression.next);
1014 self->expression.next = NULL;
1016 if (!ast_type_adopt(self, e)) {
1017 compile_error(ast_ctx(self), "internal error: failed to adopt type");
1023 void ast_block_collect(ast_block *self, ast_expression *expr)
1025 vec_push(self->collect, expr);
1026 expr->expression.node.keep = true;
1029 void ast_block_delete(ast_block *self)
1032 for (i = 0; i < vec_size(self->exprs); ++i)
1033 ast_unref(self->exprs[i]);
1034 vec_free(self->exprs);
1035 for (i = 0; i < vec_size(self->locals); ++i)
1036 ast_delete(self->locals[i]);
1037 vec_free(self->locals);
1038 for (i = 0; i < vec_size(self->collect); ++i)
1039 ast_delete(self->collect[i]);
1040 vec_free(self->collect);
1041 ast_expression_delete((ast_expression*)self);
1045 bool ast_block_set_type(ast_block *self, ast_expression *from)
1047 if (self->expression.next)
1048 ast_delete(self->expression.next);
1049 if (!ast_type_adopt(self, from))
1054 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1056 ast_instantiate(ast_function, ctx, ast_function_delete);
1060 vtype->expression.vtype != TYPE_FUNCTION)
1062 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1064 (int)vtype->hasvalue,
1065 vtype->expression.vtype);
1070 self->vtype = vtype;
1071 self->name = name ? util_strdup(name) : NULL;
1072 self->blocks = NULL;
1074 self->labelcount = 0;
1077 self->ir_func = NULL;
1078 self->curblock = NULL;
1080 self->breakblocks = NULL;
1081 self->continueblocks = NULL;
1083 vtype->hasvalue = true;
1084 vtype->constval.vfunc = self;
1086 self->varargs = NULL;
1092 void ast_function_delete(ast_function *self)
1096 mem_d((void*)self->name);
1098 /* ast_value_delete(self->vtype); */
1099 self->vtype->hasvalue = false;
1100 self->vtype->constval.vfunc = NULL;
1101 /* We use unref - if it was stored in a global table it is supposed
1102 * to be deleted from *there*
1104 ast_unref(self->vtype);
1106 for (i = 0; i < vec_size(self->blocks); ++i)
1107 ast_delete(self->blocks[i]);
1108 vec_free(self->blocks);
1109 vec_free(self->breakblocks);
1110 vec_free(self->continueblocks);
1112 ast_delete(self->varargs);
1114 ast_delete(self->argc);
1118 const char* ast_function_label(ast_function *self, const char *prefix)
1124 if (!opts.dump && !opts.dumpfin && !opts.debug)
1127 id = (self->labelcount++);
1128 len = strlen(prefix);
1130 from = self->labelbuf + sizeof(self->labelbuf)-1;
1133 *from-- = (id%10) + '0';
1137 memcpy(from - len, prefix, len);
1141 /*********************************************************************/
1143 * by convention you must never pass NULL to the 'ir_value **out'
1144 * parameter. If you really don't care about the output, pass a dummy.
1145 * But I can't imagine a pituation where the output is truly unnecessary.
1148 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1150 if (out->vtype == TYPE_FIELD)
1151 out->fieldtype = self->next->expression.vtype;
1152 if (out->vtype == TYPE_FUNCTION)
1153 out->outtype = self->next->expression.vtype;
1156 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1158 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1162 if (self->expression.vtype == TYPE_NIL) {
1163 *out = func->ir_func->owner->nil;
1166 /* NOTE: This is the codegen for a variable used in an expression.
1167 * It is not the codegen to generate the value. For this purpose,
1168 * ast_local_codegen and ast_global_codegen are to be used before this
1169 * is executed. ast_function_codegen should take care of its locals,
1170 * and the ast-user should take care of ast_global_codegen to be used
1171 * on all the globals.
1174 char tname[1024]; /* typename is reserved in C++ */
1175 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1176 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1183 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1187 if (self->expression.vtype == TYPE_NIL) {
1188 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1192 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1194 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1197 func->context = ast_ctx(self);
1198 func->value->context = ast_ctx(self);
1200 self->constval.vfunc->ir_func = func;
1201 self->ir_v = func->value;
1202 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1203 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1204 /* The function is filled later on ast_function_codegen... */
1208 if (isfield && self->expression.vtype == TYPE_FIELD) {
1209 ast_expression *fieldtype = self->expression.next;
1211 if (self->hasvalue) {
1212 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1216 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1221 ast_expression_common *elemtype;
1223 ast_value *array = (ast_value*)fieldtype;
1225 if (!ast_istype(fieldtype, ast_value)) {
1226 compile_error(ast_ctx(self), "internal error: ast_value required");
1230 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1231 if (!array->expression.count || array->expression.count > opts.max_array_size)
1232 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1234 elemtype = &array->expression.next->expression;
1235 vtype = elemtype->vtype;
1237 v = ir_builder_create_field(ir, self->name, vtype);
1239 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1242 v->context = ast_ctx(self);
1243 v->unique_life = true;
1245 array->ir_v = self->ir_v = v;
1246 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1247 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1249 namelen = strlen(self->name);
1250 name = (char*)mem_a(namelen + 16);
1251 strcpy(name, self->name);
1253 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1254 array->ir_values[0] = v;
1255 for (ai = 1; ai < array->expression.count; ++ai) {
1256 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1257 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1258 if (!array->ir_values[ai]) {
1260 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1263 array->ir_values[ai]->context = ast_ctx(self);
1264 array->ir_values[ai]->unique_life = true;
1265 array->ir_values[ai]->locked = true;
1266 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1267 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1273 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1276 v->context = ast_ctx(self);
1278 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1279 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1284 if (self->expression.vtype == TYPE_ARRAY) {
1289 ast_expression_common *elemtype = &self->expression.next->expression;
1290 int vtype = elemtype->vtype;
1292 /* same as with field arrays */
1293 if (!self->expression.count || self->expression.count > opts.max_array_size)
1294 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1296 v = ir_builder_create_global(ir, self->name, vtype);
1298 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1301 v->context = ast_ctx(self);
1302 v->unique_life = true;
1304 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1305 v->flags |= IR_FLAG_INCLUDE_DEF;
1307 namelen = strlen(self->name);
1308 name = (char*)mem_a(namelen + 16);
1309 strcpy(name, self->name);
1311 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1312 self->ir_values[0] = v;
1313 for (ai = 1; ai < self->expression.count; ++ai) {
1314 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1315 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1316 if (!self->ir_values[ai]) {
1318 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1321 self->ir_values[ai]->context = ast_ctx(self);
1322 self->ir_values[ai]->unique_life = true;
1323 self->ir_values[ai]->locked = true;
1324 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1325 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1331 /* Arrays don't do this since there's no "array" value which spans across the
1334 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1336 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1339 codegen_output_type(self, v);
1340 v->context = ast_ctx(self);
1343 if (self->hasvalue) {
1344 switch (self->expression.vtype)
1347 if (!ir_value_set_float(v, self->constval.vfloat))
1351 if (!ir_value_set_vector(v, self->constval.vvec))
1355 if (!ir_value_set_string(v, self->constval.vstring))
1359 compile_error(ast_ctx(self), "TODO: global constant array");
1362 compile_error(ast_ctx(self), "global of type function not properly generated");
1364 /* Cannot generate an IR value for a function,
1365 * need a pointer pointing to a function rather.
1368 if (!self->constval.vfield) {
1369 compile_error(ast_ctx(self), "field constant without vfield set");
1372 if (!self->constval.vfield->ir_v) {
1373 compile_error(ast_ctx(self), "field constant generated before its field");
1376 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1380 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1385 /* link us to the ir_value */
1388 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1389 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1392 error: /* clean up */
1397 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1401 if (self->expression.vtype == TYPE_NIL) {
1402 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1406 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1408 /* Do we allow local functions? I think not...
1409 * this is NOT a function pointer atm.
1414 if (self->expression.vtype == TYPE_ARRAY) {
1419 ast_expression_common *elemtype = &self->expression.next->expression;
1420 int vtype = elemtype->vtype;
1422 func->flags |= IR_FLAG_HAS_ARRAYS;
1424 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1425 compile_error(ast_ctx(self), "array-parameters are not supported");
1429 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1430 if (!self->expression.count || self->expression.count > opts.max_array_size) {
1431 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1434 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1435 if (!self->ir_values) {
1436 compile_error(ast_ctx(self), "failed to allocate array values");
1440 v = ir_function_create_local(func, self->name, vtype, param);
1442 compile_error(ast_ctx(self), "ir_function_create_local failed");
1445 v->context = ast_ctx(self);
1446 v->unique_life = true;
1449 namelen = strlen(self->name);
1450 name = (char*)mem_a(namelen + 16);
1451 strcpy(name, self->name);
1453 self->ir_values[0] = v;
1454 for (ai = 1; ai < self->expression.count; ++ai) {
1455 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1456 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1457 if (!self->ir_values[ai]) {
1458 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1461 self->ir_values[ai]->context = ast_ctx(self);
1462 self->ir_values[ai]->unique_life = true;
1463 self->ir_values[ai]->locked = true;
1468 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1471 codegen_output_type(self, v);
1472 v->context = ast_ctx(self);
1475 /* A constant local... hmmm...
1476 * I suppose the IR will have to deal with this
1478 if (self->hasvalue) {
1479 switch (self->expression.vtype)
1482 if (!ir_value_set_float(v, self->constval.vfloat))
1486 if (!ir_value_set_vector(v, self->constval.vvec))
1490 if (!ir_value_set_string(v, self->constval.vstring))
1494 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1499 /* link us to the ir_value */
1503 if (!ast_generate_accessors(self, func->owner))
1507 error: /* clean up */
1512 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1515 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1516 if (!self->setter || !self->getter)
1518 for (i = 0; i < self->expression.count; ++i) {
1519 if (!self->ir_values) {
1520 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1523 if (!self->ir_values[i]) {
1524 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1527 if (self->ir_values[i]->life) {
1528 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1533 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1535 if (!ast_global_codegen (self->setter, ir, false) ||
1536 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1537 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1539 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1540 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1545 if (!ast_global_codegen (self->getter, ir, false) ||
1546 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1547 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1549 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1550 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1554 for (i = 0; i < self->expression.count; ++i) {
1555 vec_free(self->ir_values[i]->life);
1557 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1561 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1565 ast_expression_common *ec;
1566 ast_expression_codegen *cgen;
1571 irf = self->ir_func;
1573 compile_error(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1577 /* fill the parameter list */
1578 ec = &self->vtype->expression;
1579 for (i = 0; i < vec_size(ec->params); ++i)
1581 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1582 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1584 vec_push(irf->params, ec->params[i]->expression.vtype);
1585 if (!self->builtin) {
1586 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1591 if (self->varargs) {
1592 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1594 irf->max_varargs = self->varargs->expression.count;
1597 if (self->builtin) {
1598 irf->builtin = self->builtin;
1602 if (!vec_size(self->blocks)) {
1603 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1607 irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1608 if (!self->curblock) {
1609 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1615 if (!ast_local_codegen(self->argc, self->ir_func, true))
1617 cgen = self->argc->expression.codegen;
1618 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1620 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1621 va_count, ir_builder_get_va_count(ir)))
1627 for (i = 0; i < vec_size(self->blocks); ++i) {
1628 cgen = self->blocks[i]->expression.codegen;
1629 if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1633 /* TODO: check return types */
1634 if (!self->curblock->final)
1636 if (!self->vtype->expression.next ||
1637 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1639 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1641 else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1643 /* error("missing return"); */
1644 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1645 "control reaches end of non-void function (`%s`) via %s",
1646 self->name, self->curblock->label))
1650 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1656 /* Note, you will not see ast_block_codegen generate ir_blocks.
1657 * To the AST and the IR, blocks are 2 different things.
1658 * In the AST it represents a block of code, usually enclosed in
1659 * curly braces {...}.
1660 * While in the IR it represents a block in terms of control-flow.
1662 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1666 /* We don't use this
1667 * Note: an ast-representation using the comma-operator
1668 * of the form: (a, b, c) = x should not assign to c...
1671 compile_error(ast_ctx(self), "not an l-value (code-block)");
1675 if (self->expression.outr) {
1676 *out = self->expression.outr;
1680 /* output is NULL at first, we'll have each expression
1681 * assign to out output, thus, a comma-operator represention
1682 * using an ast_block will return the last generated value,
1683 * so: (b, c) + a executed both b and c, and returns c,
1684 * which is then added to a.
1688 /* generate locals */
1689 for (i = 0; i < vec_size(self->locals); ++i)
1691 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1693 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1698 for (i = 0; i < vec_size(self->exprs); ++i)
1700 ast_expression_codegen *gen;
1701 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1702 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1706 gen = self->exprs[i]->expression.codegen;
1707 if (!(*gen)(self->exprs[i], func, false, out))
1711 self->expression.outr = *out;
1716 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1718 ast_expression_codegen *cgen;
1719 ir_value *left = NULL;
1720 ir_value *right = NULL;
1724 ast_array_index *ai = NULL;
1726 if (lvalue && self->expression.outl) {
1727 *out = self->expression.outl;
1731 if (!lvalue && self->expression.outr) {
1732 *out = self->expression.outr;
1736 if (ast_istype(self->dest, ast_array_index))
1739 ai = (ast_array_index*)self->dest;
1740 idx = (ast_value*)ai->index;
1742 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1747 /* we need to call the setter */
1748 ir_value *iridx, *funval;
1752 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1756 arr = (ast_value*)ai->array;
1757 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1758 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1762 cgen = idx->expression.codegen;
1763 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1766 cgen = arr->setter->expression.codegen;
1767 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1770 cgen = self->source->expression.codegen;
1771 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1774 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1777 ir_call_param(call, iridx);
1778 ir_call_param(call, right);
1779 self->expression.outr = right;
1785 cgen = self->dest->expression.codegen;
1787 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1789 self->expression.outl = left;
1791 cgen = self->source->expression.codegen;
1793 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1796 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1798 self->expression.outr = right;
1801 /* Theoretically, an assinment returns its left side as an
1802 * lvalue, if we don't need an lvalue though, we return
1803 * the right side as an rvalue, otherwise we have to
1804 * somehow know whether or not we need to dereference the pointer
1805 * on the left side - that is: OP_LOAD if it was an address.
1806 * Also: in original QC we cannot OP_LOADP *anyway*.
1808 *out = (lvalue ? left : right);
1813 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1815 ast_expression_codegen *cgen;
1816 ir_value *left, *right;
1818 /* A binary operation cannot yield an l-value */
1820 compile_error(ast_ctx(self), "not an l-value (binop)");
1824 if (self->expression.outr) {
1825 *out = self->expression.outr;
1829 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1830 (self->op == INSTR_AND || self->op == INSTR_OR))
1832 /* short circuit evaluation */
1833 ir_block *other, *merge;
1834 ir_block *from_left, *from_right;
1838 /* prepare end-block */
1839 merge_id = vec_size(func->ir_func->blocks);
1840 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1842 /* generate the left expression */
1843 cgen = self->left->expression.codegen;
1844 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1846 /* remember the block */
1847 from_left = func->curblock;
1849 /* create a new block for the right expression */
1850 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1851 if (self->op == INSTR_AND) {
1852 /* on AND: left==true -> other */
1853 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1856 /* on OR: left==false -> other */
1857 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1860 /* use the likely flag */
1861 vec_last(func->curblock->instr)->likely = true;
1863 /* enter the right-expression's block */
1864 func->curblock = other;
1866 cgen = self->right->expression.codegen;
1867 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1869 /* remember block */
1870 from_right = func->curblock;
1872 /* jump to the merge block */
1873 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1876 vec_remove(func->ir_func->blocks, merge_id, 1);
1877 vec_push(func->ir_func->blocks, merge);
1879 func->curblock = merge;
1880 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1881 ast_function_label(func, "sce_value"),
1882 self->expression.vtype);
1883 ir_phi_add(phi, from_left, left);
1884 ir_phi_add(phi, from_right, right);
1885 *out = ir_phi_value(phi);
1889 if (!OPTS_FLAG(PERL_LOGIC)) {
1891 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1892 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1893 ast_function_label(func, "sce_bool_v"),
1897 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1898 ast_function_label(func, "sce_bool"),
1903 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
1904 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1905 ast_function_label(func, "sce_bool_s"),
1909 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1910 ast_function_label(func, "sce_bool"),
1916 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
1917 ast_function_label(func, "sce_bool"),
1918 INSTR_AND, *out, *out);
1924 self->expression.outr = *out;
1925 codegen_output_type(self, *out);
1929 cgen = self->left->expression.codegen;
1930 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1933 cgen = self->right->expression.codegen;
1934 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1937 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1938 self->op, left, right);
1941 self->expression.outr = *out;
1942 codegen_output_type(self, *out);
1947 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1949 ast_expression_codegen *cgen;
1950 ir_value *leftl = NULL, *leftr, *right, *bin;
1954 ast_array_index *ai = NULL;
1955 ir_value *iridx = NULL;
1957 if (lvalue && self->expression.outl) {
1958 *out = self->expression.outl;
1962 if (!lvalue && self->expression.outr) {
1963 *out = self->expression.outr;
1967 if (ast_istype(self->dest, ast_array_index))
1970 ai = (ast_array_index*)self->dest;
1971 idx = (ast_value*)ai->index;
1973 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1977 /* for a binstore we need both an lvalue and an rvalue for the left side */
1978 /* rvalue of destination! */
1980 cgen = idx->expression.codegen;
1981 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1984 cgen = self->dest->expression.codegen;
1985 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1988 /* source as rvalue only */
1989 cgen = self->source->expression.codegen;
1990 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1993 /* now the binary */
1994 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1995 self->opbin, leftr, right);
1996 self->expression.outr = bin;
2000 /* we need to call the setter */
2005 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2009 arr = (ast_value*)ai->array;
2010 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2011 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2015 cgen = arr->setter->expression.codegen;
2016 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2019 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2022 ir_call_param(call, iridx);
2023 ir_call_param(call, bin);
2024 self->expression.outr = bin;
2026 /* now store them */
2027 cgen = self->dest->expression.codegen;
2028 /* lvalue of destination */
2029 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2031 self->expression.outl = leftl;
2033 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2035 self->expression.outr = bin;
2038 /* Theoretically, an assinment returns its left side as an
2039 * lvalue, if we don't need an lvalue though, we return
2040 * the right side as an rvalue, otherwise we have to
2041 * somehow know whether or not we need to dereference the pointer
2042 * on the left side - that is: OP_LOAD if it was an address.
2043 * Also: in original QC we cannot OP_LOADP *anyway*.
2045 *out = (lvalue ? leftl : bin);
2050 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2052 ast_expression_codegen *cgen;
2055 /* An unary operation cannot yield an l-value */
2057 compile_error(ast_ctx(self), "not an l-value (binop)");
2061 if (self->expression.outr) {
2062 *out = self->expression.outr;
2066 cgen = self->operand->expression.codegen;
2068 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2071 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2075 self->expression.outr = *out;
2080 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2082 ast_expression_codegen *cgen;
2087 /* In the context of a return operation, we don't actually return
2091 compile_error(ast_ctx(self), "return-expression is not an l-value");
2095 if (self->expression.outr) {
2096 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2099 self->expression.outr = (ir_value*)1;
2101 if (self->operand) {
2102 cgen = self->operand->expression.codegen;
2104 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2107 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2110 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2117 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2119 ast_expression_codegen *cgen;
2120 ir_value *ent, *field;
2122 /* This function needs to take the 'lvalue' flag into account!
2123 * As lvalue we provide a field-pointer, as rvalue we provide the
2127 if (lvalue && self->expression.outl) {
2128 *out = self->expression.outl;
2132 if (!lvalue && self->expression.outr) {
2133 *out = self->expression.outr;
2137 cgen = self->entity->expression.codegen;
2138 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2141 cgen = self->field->expression.codegen;
2142 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2147 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2150 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2151 ent, field, self->expression.vtype);
2152 /* Done AFTER error checking:
2153 codegen_output_type(self, *out);
2157 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2158 (lvalue ? "ADDRESS" : "FIELD"),
2159 type_name[self->expression.vtype]);
2163 codegen_output_type(self, *out);
2166 self->expression.outl = *out;
2168 self->expression.outr = *out;
2170 /* Hm that should be it... */
2174 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2176 ast_expression_codegen *cgen;
2179 /* in QC this is always an lvalue */
2180 if (lvalue && self->rvalue) {
2181 compile_error(ast_ctx(self), "not an l-value (member access)");
2184 if (self->expression.outl) {
2185 *out = self->expression.outl;
2189 cgen = self->owner->expression.codegen;
2190 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2193 if (vec->vtype != TYPE_VECTOR &&
2194 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2199 *out = ir_value_vector_member(vec, self->field);
2200 self->expression.outl = *out;
2202 return (*out != NULL);
2205 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2210 if (!lvalue && self->expression.outr) {
2211 *out = self->expression.outr;
2213 if (lvalue && self->expression.outl) {
2214 *out = self->expression.outl;
2217 if (!ast_istype(self->array, ast_value)) {
2218 compile_error(ast_ctx(self), "array indexing this way is not supported");
2219 /* note this would actually be pointer indexing because the left side is
2220 * not an actual array but (hopefully) an indexable expression.
2221 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2222 * support this path will be filled.
2227 arr = (ast_value*)self->array;
2228 idx = (ast_value*)self->index;
2230 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2231 /* Time to use accessor functions */
2232 ast_expression_codegen *cgen;
2233 ir_value *iridx, *funval;
2237 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2242 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2246 cgen = self->index->expression.codegen;
2247 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2250 cgen = arr->getter->expression.codegen;
2251 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2254 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2257 ir_call_param(call, iridx);
2259 *out = ir_call_value(call);
2260 self->expression.outr = *out;
2261 (*out)->vtype = self->expression.vtype;
2262 codegen_output_type(self, *out);
2266 if (idx->expression.vtype == TYPE_FLOAT) {
2267 unsigned int arridx = idx->constval.vfloat;
2268 if (arridx >= self->array->expression.count)
2270 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2273 *out = arr->ir_values[arridx];
2275 else if (idx->expression.vtype == TYPE_INTEGER) {
2276 unsigned int arridx = idx->constval.vint;
2277 if (arridx >= self->array->expression.count)
2279 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2282 *out = arr->ir_values[arridx];
2285 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2288 (*out)->vtype = self->expression.vtype;
2289 codegen_output_type(self, *out);
2293 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2295 ast_expression_codegen *cgen;
2303 ir_block *ontrue_endblock = NULL;
2304 ir_block *onfalse_endblock = NULL;
2305 ir_block *merge = NULL;
2307 /* We don't output any value, thus also don't care about r/lvalue */
2311 if (self->expression.outr) {
2312 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2315 self->expression.outr = (ir_value*)1;
2317 /* generate the condition */
2318 cgen = self->cond->expression.codegen;
2319 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2321 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2322 cond = func->curblock;
2326 if (self->on_true) {
2327 /* create on-true block */
2328 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2332 /* enter the block */
2333 func->curblock = ontrue;
2336 cgen = self->on_true->expression.codegen;
2337 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2340 /* we now need to work from the current endpoint */
2341 ontrue_endblock = func->curblock;
2346 if (self->on_false) {
2347 /* create on-false block */
2348 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2352 /* enter the block */
2353 func->curblock = onfalse;
2356 cgen = self->on_false->expression.codegen;
2357 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2360 /* we now need to work from the current endpoint */
2361 onfalse_endblock = func->curblock;
2365 /* Merge block were they all merge in to */
2366 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2368 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2371 /* add jumps ot the merge block */
2372 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2374 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2377 /* Now enter the merge block */
2378 func->curblock = merge;
2381 /* we create the if here, that way all blocks are ordered :)
2383 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2384 (ontrue ? ontrue : merge),
2385 (onfalse ? onfalse : merge)))
2393 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2395 ast_expression_codegen *cgen;
2398 ir_value *trueval, *falseval;
2401 ir_block *cond = func->curblock;
2402 ir_block *cond_out = NULL;
2403 ir_block *ontrue, *ontrue_out = NULL;
2404 ir_block *onfalse, *onfalse_out = NULL;
2407 /* Ternary can never create an lvalue... */
2411 /* In theory it shouldn't be possible to pass through a node twice, but
2412 * in case we add any kind of optimization pass for the AST itself, it
2413 * may still happen, thus we remember a created ir_value and simply return one
2414 * if it already exists.
2416 if (self->expression.outr) {
2417 *out = self->expression.outr;
2421 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2423 /* generate the condition */
2424 func->curblock = cond;
2425 cgen = self->cond->expression.codegen;
2426 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2428 cond_out = func->curblock;
2430 /* create on-true block */
2431 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2436 /* enter the block */
2437 func->curblock = ontrue;
2440 cgen = self->on_true->expression.codegen;
2441 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2444 ontrue_out = func->curblock;
2447 /* create on-false block */
2448 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2453 /* enter the block */
2454 func->curblock = onfalse;
2457 cgen = self->on_false->expression.codegen;
2458 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2461 onfalse_out = func->curblock;
2464 /* create merge block */
2465 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2468 /* jump to merge block */
2469 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2471 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2474 /* create if instruction */
2475 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2478 /* Now enter the merge block */
2479 func->curblock = merge;
2481 /* Here, now, we need a PHI node
2482 * but first some sanity checking...
2484 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2485 /* error("ternary with different types on the two sides"); */
2486 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2491 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2493 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2496 ir_phi_add(phi, ontrue_out, trueval);
2497 ir_phi_add(phi, onfalse_out, falseval);
2499 self->expression.outr = ir_phi_value(phi);
2500 *out = self->expression.outr;
2502 codegen_output_type(self, *out);
2507 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2509 ast_expression_codegen *cgen;
2511 ir_value *dummy = NULL;
2512 ir_value *precond = NULL;
2513 ir_value *postcond = NULL;
2515 /* Since we insert some jumps "late" so we have blocks
2516 * ordered "nicely", we need to keep track of the actual end-blocks
2517 * of expressions to add the jumps to.
2519 ir_block *bbody = NULL, *end_bbody = NULL;
2520 ir_block *bprecond = NULL, *end_bprecond = NULL;
2521 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2522 ir_block *bincrement = NULL, *end_bincrement = NULL;
2523 ir_block *bout = NULL, *bin = NULL;
2525 /* let's at least move the outgoing block to the end */
2528 /* 'break' and 'continue' need to be able to find the right blocks */
2529 ir_block *bcontinue = NULL;
2530 ir_block *bbreak = NULL;
2532 ir_block *tmpblock = NULL;
2537 if (self->expression.outr) {
2538 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2541 self->expression.outr = (ir_value*)1;
2544 * Should we ever need some kind of block ordering, better make this function
2545 * move blocks around than write a block ordering algorithm later... after all
2546 * the ast and ir should work together, not against each other.
2549 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2550 * anyway if for example it contains a ternary.
2554 cgen = self->initexpr->expression.codegen;
2555 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2559 /* Store the block from which we enter this chaos */
2560 bin = func->curblock;
2562 /* The pre-loop condition needs its own block since we
2563 * need to be able to jump to the start of that expression.
2567 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2571 /* the pre-loop-condition the least important place to 'continue' at */
2572 bcontinue = bprecond;
2575 func->curblock = bprecond;
2578 cgen = self->precond->expression.codegen;
2579 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2582 end_bprecond = func->curblock;
2584 bprecond = end_bprecond = NULL;
2587 /* Now the next blocks won't be ordered nicely, but we need to
2588 * generate them this early for 'break' and 'continue'.
2590 if (self->increment) {
2591 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2594 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2596 bincrement = end_bincrement = NULL;
2599 if (self->postcond) {
2600 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2603 bcontinue = bpostcond; /* postcond comes before the increment */
2605 bpostcond = end_bpostcond = NULL;
2608 bout_id = vec_size(func->ir_func->blocks);
2609 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2614 /* The loop body... */
2615 /* if (self->body) */
2617 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2622 func->curblock = bbody;
2624 vec_push(func->breakblocks, bbreak);
2626 vec_push(func->continueblocks, bcontinue);
2628 vec_push(func->continueblocks, bbody);
2632 cgen = self->body->expression.codegen;
2633 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2637 end_bbody = func->curblock;
2638 vec_pop(func->breakblocks);
2639 vec_pop(func->continueblocks);
2642 /* post-loop-condition */
2646 func->curblock = bpostcond;
2649 cgen = self->postcond->expression.codegen;
2650 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2653 end_bpostcond = func->curblock;
2656 /* The incrementor */
2657 if (self->increment)
2660 func->curblock = bincrement;
2663 cgen = self->increment->expression.codegen;
2664 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2667 end_bincrement = func->curblock;
2670 /* In any case now, we continue from the outgoing block */
2671 func->curblock = bout;
2673 /* Now all blocks are in place */
2674 /* From 'bin' we jump to whatever comes first */
2675 if (bprecond) tmpblock = bprecond;
2676 else if (bbody) tmpblock = bbody;
2677 else if (bpostcond) tmpblock = bpostcond;
2678 else tmpblock = bout;
2679 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2685 ir_block *ontrue, *onfalse;
2686 if (bbody) ontrue = bbody;
2687 else if (bincrement) ontrue = bincrement;
2688 else if (bpostcond) ontrue = bpostcond;
2689 else ontrue = bprecond;
2691 if (self->pre_not) {
2696 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2703 if (bincrement) tmpblock = bincrement;
2704 else if (bpostcond) tmpblock = bpostcond;
2705 else if (bprecond) tmpblock = bprecond;
2706 else tmpblock = bbody;
2707 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2711 /* from increment */
2714 if (bpostcond) tmpblock = bpostcond;
2715 else if (bprecond) tmpblock = bprecond;
2716 else if (bbody) tmpblock = bbody;
2717 else tmpblock = bout;
2718 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2725 ir_block *ontrue, *onfalse;
2726 if (bprecond) ontrue = bprecond;
2727 else if (bbody) ontrue = bbody;
2728 else if (bincrement) ontrue = bincrement;
2729 else ontrue = bpostcond;
2731 if (self->post_not) {
2736 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2740 /* Move 'bout' to the end */
2741 vec_remove(func->ir_func->blocks, bout_id, 1);
2742 vec_push(func->ir_func->blocks, bout);
2747 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2754 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2758 if (self->expression.outr) {
2759 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2762 self->expression.outr = (ir_value*)1;
2764 if (self->is_continue)
2765 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2767 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2770 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2774 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2779 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2781 ast_expression_codegen *cgen;
2783 ast_switch_case *def_case = NULL;
2784 ir_block *def_bfall = NULL;
2785 ir_block *def_bfall_to = NULL;
2786 bool set_def_bfall_to = false;
2788 ir_value *dummy = NULL;
2789 ir_value *irop = NULL;
2790 ir_block *bout = NULL;
2791 ir_block *bfall = NULL;
2799 compile_error(ast_ctx(self), "switch expression is not an l-value");
2803 if (self->expression.outr) {
2804 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2807 self->expression.outr = (ir_value*)1;
2812 cgen = self->operand->expression.codegen;
2813 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2816 if (!vec_size(self->cases))
2819 cmpinstr = type_eq_instr[irop->vtype];
2820 if (cmpinstr >= AINSTR_END) {
2821 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2822 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2826 bout_id = vec_size(func->ir_func->blocks);
2827 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2831 /* setup the break block */
2832 vec_push(func->breakblocks, bout);
2834 /* Now create all cases */
2835 for (c = 0; c < vec_size(self->cases); ++c) {
2836 ir_value *cond, *val;
2837 ir_block *bcase, *bnot;
2840 ast_switch_case *swcase = &self->cases[c];
2842 if (swcase->value) {
2843 /* A regular case */
2844 /* generate the condition operand */
2845 cgen = swcase->value->expression.codegen;
2846 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2848 /* generate the condition */
2849 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2853 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2854 bnot_id = vec_size(func->ir_func->blocks);
2855 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2856 if (!bcase || !bnot)
2858 if (set_def_bfall_to) {
2859 set_def_bfall_to = false;
2860 def_bfall_to = bcase;
2862 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2865 /* Make the previous case-end fall through */
2866 if (bfall && !bfall->final) {
2867 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2871 /* enter the case */
2872 func->curblock = bcase;
2873 cgen = swcase->code->expression.codegen;
2874 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2877 /* remember this block to fall through from */
2878 bfall = func->curblock;
2880 /* enter the else and move it down */
2881 func->curblock = bnot;
2882 vec_remove(func->ir_func->blocks, bnot_id, 1);
2883 vec_push(func->ir_func->blocks, bnot);
2885 /* The default case */
2886 /* Remember where to fall through from: */
2889 /* remember which case it was */
2891 /* And the next case will be remembered */
2892 set_def_bfall_to = true;
2896 /* Jump from the last bnot to bout */
2897 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2899 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2904 /* If there was a default case, put it down here */
2908 /* No need to create an extra block */
2909 bcase = func->curblock;
2911 /* Insert the fallthrough jump */
2912 if (def_bfall && !def_bfall->final) {
2913 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2917 /* Now generate the default code */
2918 cgen = def_case->code->expression.codegen;
2919 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2922 /* see if we need to fall through */
2923 if (def_bfall_to && !func->curblock->final)
2925 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2930 /* Jump from the last bnot to bout */
2931 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2933 /* enter the outgoing block */
2934 func->curblock = bout;
2936 /* restore the break block */
2937 vec_pop(func->breakblocks);
2939 /* Move 'bout' to the end, it's nicer */
2940 vec_remove(func->ir_func->blocks, bout_id, 1);
2941 vec_push(func->ir_func->blocks, bout);
2946 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2951 if (self->undefined) {
2952 compile_error(ast_ctx(self), "internal error: ast_label never defined");
2958 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2962 /* simply create a new block and jump to it */
2963 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2964 if (!self->irblock) {
2965 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2968 if (!func->curblock->final) {
2969 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2973 /* enter the new block */
2974 func->curblock = self->irblock;
2976 /* Generate all the leftover gotos */
2977 for (i = 0; i < vec_size(self->gotos); ++i) {
2978 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2985 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2989 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2993 if (self->target->irblock) {
2994 if (self->irblock_from) {
2995 /* we already tried once, this is the callback */
2996 self->irblock_from->final = false;
2997 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2998 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3004 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3005 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3012 /* the target has not yet been created...
3013 * close this block in a sneaky way:
3015 func->curblock->final = true;
3016 self->irblock_from = func->curblock;
3017 ast_label_register_goto(self->target, self);
3023 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3025 ast_expression_codegen *cgen;
3027 ir_instr *callinstr;
3030 ir_value *funval = NULL;
3032 /* return values are never lvalues */
3034 compile_error(ast_ctx(self), "not an l-value (function call)");
3038 if (self->expression.outr) {
3039 *out = self->expression.outr;
3043 cgen = self->func->expression.codegen;
3044 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3052 for (i = 0; i < vec_size(self->params); ++i)
3055 ast_expression *expr = self->params[i];
3057 cgen = expr->expression.codegen;
3058 if (!(*cgen)(expr, func, false, ¶m))
3062 vec_push(params, param);
3065 /* varargs counter */
3066 if (self->va_count) {
3068 ir_builder *builder = func->curblock->owner->owner;
3069 cgen = self->va_count->expression.codegen;
3070 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3072 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3073 ir_builder_get_va_count(builder), va_count))
3079 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3080 ast_function_label(func, "call"),
3081 funval, !!(self->func->expression.flags & AST_FLAG_NORETURN));
3085 for (i = 0; i < vec_size(params); ++i) {
3086 ir_call_param(callinstr, params[i]);
3089 *out = ir_call_value(callinstr);
3090 self->expression.outr = *out;
3092 codegen_output_type(self, *out);