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;
1087 void ast_function_delete(ast_function *self)
1091 mem_d((void*)self->name);
1093 /* ast_value_delete(self->vtype); */
1094 self->vtype->hasvalue = false;
1095 self->vtype->constval.vfunc = NULL;
1096 /* We use unref - if it was stored in a global table it is supposed
1097 * to be deleted from *there*
1099 ast_unref(self->vtype);
1101 for (i = 0; i < vec_size(self->blocks); ++i)
1102 ast_delete(self->blocks[i]);
1103 vec_free(self->blocks);
1104 vec_free(self->breakblocks);
1105 vec_free(self->continueblocks);
1107 ast_delete(self->varargs);
1109 ast_delete(self->argc);
1113 const char* ast_function_label(ast_function *self, const char *prefix)
1119 if (!opts.dump && !opts.dumpfin && !opts.debug)
1122 id = (self->labelcount++);
1123 len = strlen(prefix);
1125 from = self->labelbuf + sizeof(self->labelbuf)-1;
1128 *from-- = (id%10) + '0';
1132 memcpy(from - len, prefix, len);
1136 /*********************************************************************/
1138 * by convention you must never pass NULL to the 'ir_value **out'
1139 * parameter. If you really don't care about the output, pass a dummy.
1140 * But I can't imagine a pituation where the output is truly unnecessary.
1143 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1145 if (out->vtype == TYPE_FIELD)
1146 out->fieldtype = self->next->expression.vtype;
1147 if (out->vtype == TYPE_FUNCTION)
1148 out->outtype = self->next->expression.vtype;
1151 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1153 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1157 if (self->expression.vtype == TYPE_NIL) {
1158 *out = func->ir_func->owner->nil;
1161 /* NOTE: This is the codegen for a variable used in an expression.
1162 * It is not the codegen to generate the value. For this purpose,
1163 * ast_local_codegen and ast_global_codegen are to be used before this
1164 * is executed. ast_function_codegen should take care of its locals,
1165 * and the ast-user should take care of ast_global_codegen to be used
1166 * on all the globals.
1169 char tname[1024]; /* typename is reserved in C++ */
1170 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1171 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1178 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1182 if (self->expression.vtype == TYPE_NIL) {
1183 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1187 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1189 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1192 func->context = ast_ctx(self);
1193 func->value->context = ast_ctx(self);
1195 self->constval.vfunc->ir_func = func;
1196 self->ir_v = func->value;
1197 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1198 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1199 /* The function is filled later on ast_function_codegen... */
1203 if (isfield && self->expression.vtype == TYPE_FIELD) {
1204 ast_expression *fieldtype = self->expression.next;
1206 if (self->hasvalue) {
1207 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1211 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1216 ast_expression_common *elemtype;
1218 ast_value *array = (ast_value*)fieldtype;
1220 if (!ast_istype(fieldtype, ast_value)) {
1221 compile_error(ast_ctx(self), "internal error: ast_value required");
1225 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1226 if (!array->expression.count || array->expression.count > opts.max_array_size)
1227 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1229 elemtype = &array->expression.next->expression;
1230 vtype = elemtype->vtype;
1232 v = ir_builder_create_field(ir, self->name, vtype);
1234 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1237 v->context = ast_ctx(self);
1238 v->unique_life = true;
1240 array->ir_v = self->ir_v = v;
1241 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1242 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1244 namelen = strlen(self->name);
1245 name = (char*)mem_a(namelen + 16);
1246 strcpy(name, self->name);
1248 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1249 array->ir_values[0] = v;
1250 for (ai = 1; ai < array->expression.count; ++ai) {
1251 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1252 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1253 if (!array->ir_values[ai]) {
1255 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1258 array->ir_values[ai]->context = ast_ctx(self);
1259 array->ir_values[ai]->unique_life = true;
1260 array->ir_values[ai]->locked = true;
1261 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1262 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1268 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1271 v->context = ast_ctx(self);
1273 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1274 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1279 if (self->expression.vtype == TYPE_ARRAY) {
1284 ast_expression_common *elemtype = &self->expression.next->expression;
1285 int vtype = elemtype->vtype;
1287 /* same as with field arrays */
1288 if (!self->expression.count || self->expression.count > opts.max_array_size)
1289 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1291 v = ir_builder_create_global(ir, self->name, vtype);
1293 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1296 v->context = ast_ctx(self);
1297 v->unique_life = true;
1299 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1300 v->flags |= IR_FLAG_INCLUDE_DEF;
1302 namelen = strlen(self->name);
1303 name = (char*)mem_a(namelen + 16);
1304 strcpy(name, self->name);
1306 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1307 self->ir_values[0] = v;
1308 for (ai = 1; ai < self->expression.count; ++ai) {
1309 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1310 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1311 if (!self->ir_values[ai]) {
1313 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1316 self->ir_values[ai]->context = ast_ctx(self);
1317 self->ir_values[ai]->unique_life = true;
1318 self->ir_values[ai]->locked = true;
1319 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1320 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1326 /* Arrays don't do this since there's no "array" value which spans across the
1329 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1331 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1334 codegen_output_type(self, v);
1335 v->context = ast_ctx(self);
1338 if (self->hasvalue) {
1339 switch (self->expression.vtype)
1342 if (!ir_value_set_float(v, self->constval.vfloat))
1346 if (!ir_value_set_vector(v, self->constval.vvec))
1350 if (!ir_value_set_string(v, self->constval.vstring))
1354 compile_error(ast_ctx(self), "TODO: global constant array");
1357 compile_error(ast_ctx(self), "global of type function not properly generated");
1359 /* Cannot generate an IR value for a function,
1360 * need a pointer pointing to a function rather.
1363 if (!self->constval.vfield) {
1364 compile_error(ast_ctx(self), "field constant without vfield set");
1367 if (!self->constval.vfield->ir_v) {
1368 compile_error(ast_ctx(self), "field constant generated before its field");
1371 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1375 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1380 /* link us to the ir_value */
1383 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1384 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1387 error: /* clean up */
1392 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1396 if (self->expression.vtype == TYPE_NIL) {
1397 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1401 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1403 /* Do we allow local functions? I think not...
1404 * this is NOT a function pointer atm.
1409 if (self->expression.vtype == TYPE_ARRAY) {
1414 ast_expression_common *elemtype = &self->expression.next->expression;
1415 int vtype = elemtype->vtype;
1417 func->flags |= IR_FLAG_HAS_ARRAYS;
1419 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1420 compile_error(ast_ctx(self), "array-parameters are not supported");
1424 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1425 if (!self->expression.count || self->expression.count > opts.max_array_size) {
1426 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1429 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1430 if (!self->ir_values) {
1431 compile_error(ast_ctx(self), "failed to allocate array values");
1435 v = ir_function_create_local(func, self->name, vtype, param);
1437 compile_error(ast_ctx(self), "ir_function_create_local failed");
1440 v->context = ast_ctx(self);
1441 v->unique_life = true;
1444 namelen = strlen(self->name);
1445 name = (char*)mem_a(namelen + 16);
1446 strcpy(name, self->name);
1448 self->ir_values[0] = v;
1449 for (ai = 1; ai < self->expression.count; ++ai) {
1450 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1451 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1452 if (!self->ir_values[ai]) {
1453 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1456 self->ir_values[ai]->context = ast_ctx(self);
1457 self->ir_values[ai]->unique_life = true;
1458 self->ir_values[ai]->locked = true;
1463 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1466 codegen_output_type(self, v);
1467 v->context = ast_ctx(self);
1470 /* A constant local... hmmm...
1471 * I suppose the IR will have to deal with this
1473 if (self->hasvalue) {
1474 switch (self->expression.vtype)
1477 if (!ir_value_set_float(v, self->constval.vfloat))
1481 if (!ir_value_set_vector(v, self->constval.vvec))
1485 if (!ir_value_set_string(v, self->constval.vstring))
1489 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1494 /* link us to the ir_value */
1498 if (!ast_generate_accessors(self, func->owner))
1502 error: /* clean up */
1507 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1510 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1511 if (!self->setter || !self->getter)
1513 for (i = 0; i < self->expression.count; ++i) {
1514 if (!self->ir_values) {
1515 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1518 if (!self->ir_values[i]) {
1519 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1522 if (self->ir_values[i]->life) {
1523 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1528 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1530 if (!ast_global_codegen (self->setter, ir, false) ||
1531 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1532 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1534 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1535 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1540 if (!ast_global_codegen (self->getter, ir, false) ||
1541 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1542 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1544 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1545 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1549 for (i = 0; i < self->expression.count; ++i) {
1550 vec_free(self->ir_values[i]->life);
1552 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1556 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1560 ast_expression_common *ec;
1561 ast_expression_codegen *cgen;
1566 irf = self->ir_func;
1568 compile_error(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1572 /* fill the parameter list */
1573 ec = &self->vtype->expression;
1574 for (i = 0; i < vec_size(ec->params); ++i)
1576 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1577 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1579 vec_push(irf->params, ec->params[i]->expression.vtype);
1580 if (!self->builtin) {
1581 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1586 if (self->varargs) {
1587 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1589 irf->max_varargs = self->varargs->expression.count;
1592 if (self->builtin) {
1593 irf->builtin = self->builtin;
1597 if (!vec_size(self->blocks)) {
1598 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1602 self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1603 if (!self->curblock) {
1604 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1610 if (!ast_local_codegen(self->argc, self->ir_func, true))
1612 cgen = self->argc->expression.codegen;
1613 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1615 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1616 va_count, ir_builder_get_va_count(ir)))
1622 for (i = 0; i < vec_size(self->blocks); ++i) {
1623 cgen = self->blocks[i]->expression.codegen;
1624 if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1628 /* TODO: check return types */
1629 if (!self->curblock->final)
1631 if (!self->vtype->expression.next ||
1632 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1634 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1636 else if (vec_size(self->curblock->entries))
1638 /* error("missing return"); */
1639 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1640 "control reaches end of non-void function (`%s`) via %s",
1641 self->name, self->curblock->label))
1645 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1651 /* Note, you will not see ast_block_codegen generate ir_blocks.
1652 * To the AST and the IR, blocks are 2 different things.
1653 * In the AST it represents a block of code, usually enclosed in
1654 * curly braces {...}.
1655 * While in the IR it represents a block in terms of control-flow.
1657 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1661 /* We don't use this
1662 * Note: an ast-representation using the comma-operator
1663 * of the form: (a, b, c) = x should not assign to c...
1666 compile_error(ast_ctx(self), "not an l-value (code-block)");
1670 if (self->expression.outr) {
1671 *out = self->expression.outr;
1675 /* output is NULL at first, we'll have each expression
1676 * assign to out output, thus, a comma-operator represention
1677 * using an ast_block will return the last generated value,
1678 * so: (b, c) + a executed both b and c, and returns c,
1679 * which is then added to a.
1683 /* generate locals */
1684 for (i = 0; i < vec_size(self->locals); ++i)
1686 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1688 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1693 for (i = 0; i < vec_size(self->exprs); ++i)
1695 ast_expression_codegen *gen;
1696 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1697 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1701 gen = self->exprs[i]->expression.codegen;
1702 if (!(*gen)(self->exprs[i], func, false, out))
1706 self->expression.outr = *out;
1711 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1713 ast_expression_codegen *cgen;
1714 ir_value *left = NULL;
1715 ir_value *right = NULL;
1719 ast_array_index *ai = NULL;
1721 if (lvalue && self->expression.outl) {
1722 *out = self->expression.outl;
1726 if (!lvalue && self->expression.outr) {
1727 *out = self->expression.outr;
1731 if (ast_istype(self->dest, ast_array_index))
1734 ai = (ast_array_index*)self->dest;
1735 idx = (ast_value*)ai->index;
1737 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1742 /* we need to call the setter */
1743 ir_value *iridx, *funval;
1747 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1751 arr = (ast_value*)ai->array;
1752 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1753 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1757 cgen = idx->expression.codegen;
1758 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1761 cgen = arr->setter->expression.codegen;
1762 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1765 cgen = self->source->expression.codegen;
1766 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1769 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1772 ir_call_param(call, iridx);
1773 ir_call_param(call, right);
1774 self->expression.outr = right;
1780 cgen = self->dest->expression.codegen;
1782 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1784 self->expression.outl = left;
1786 cgen = self->source->expression.codegen;
1788 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1791 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1793 self->expression.outr = right;
1796 /* Theoretically, an assinment returns its left side as an
1797 * lvalue, if we don't need an lvalue though, we return
1798 * the right side as an rvalue, otherwise we have to
1799 * somehow know whether or not we need to dereference the pointer
1800 * on the left side - that is: OP_LOAD if it was an address.
1801 * Also: in original QC we cannot OP_LOADP *anyway*.
1803 *out = (lvalue ? left : right);
1808 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1810 ast_expression_codegen *cgen;
1811 ir_value *left, *right;
1813 /* A binary operation cannot yield an l-value */
1815 compile_error(ast_ctx(self), "not an l-value (binop)");
1819 if (self->expression.outr) {
1820 *out = self->expression.outr;
1824 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1825 (self->op == INSTR_AND || self->op == INSTR_OR))
1827 /* short circuit evaluation */
1828 ir_block *other, *merge;
1829 ir_block *from_left, *from_right;
1833 /* prepare end-block */
1834 merge_id = vec_size(func->ir_func->blocks);
1835 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1837 /* generate the left expression */
1838 cgen = self->left->expression.codegen;
1839 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1841 /* remember the block */
1842 from_left = func->curblock;
1844 /* create a new block for the right expression */
1845 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1846 if (self->op == INSTR_AND) {
1847 /* on AND: left==true -> other */
1848 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1851 /* on OR: left==false -> other */
1852 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1855 /* use the likely flag */
1856 vec_last(func->curblock->instr)->likely = true;
1858 /* enter the right-expression's block */
1859 func->curblock = other;
1861 cgen = self->right->expression.codegen;
1862 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1864 /* remember block */
1865 from_right = func->curblock;
1867 /* jump to the merge block */
1868 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1871 vec_remove(func->ir_func->blocks, merge_id, 1);
1872 vec_push(func->ir_func->blocks, merge);
1874 func->curblock = merge;
1875 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1876 ast_function_label(func, "sce_value"),
1877 self->expression.vtype);
1878 ir_phi_add(phi, from_left, left);
1879 ir_phi_add(phi, from_right, right);
1880 *out = ir_phi_value(phi);
1884 if (!OPTS_FLAG(PERL_LOGIC)) {
1886 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1887 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1888 ast_function_label(func, "sce_bool_v"),
1892 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1893 ast_function_label(func, "sce_bool"),
1898 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
1899 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1900 ast_function_label(func, "sce_bool_s"),
1904 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1905 ast_function_label(func, "sce_bool"),
1911 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
1912 ast_function_label(func, "sce_bool"),
1913 INSTR_AND, *out, *out);
1919 self->expression.outr = *out;
1920 codegen_output_type(self, *out);
1924 cgen = self->left->expression.codegen;
1925 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1928 cgen = self->right->expression.codegen;
1929 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1932 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1933 self->op, left, right);
1936 self->expression.outr = *out;
1937 codegen_output_type(self, *out);
1942 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1944 ast_expression_codegen *cgen;
1945 ir_value *leftl = NULL, *leftr, *right, *bin;
1949 ast_array_index *ai = NULL;
1950 ir_value *iridx = NULL;
1952 if (lvalue && self->expression.outl) {
1953 *out = self->expression.outl;
1957 if (!lvalue && self->expression.outr) {
1958 *out = self->expression.outr;
1962 if (ast_istype(self->dest, ast_array_index))
1965 ai = (ast_array_index*)self->dest;
1966 idx = (ast_value*)ai->index;
1968 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1972 /* for a binstore we need both an lvalue and an rvalue for the left side */
1973 /* rvalue of destination! */
1975 cgen = idx->expression.codegen;
1976 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1979 cgen = self->dest->expression.codegen;
1980 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1983 /* source as rvalue only */
1984 cgen = self->source->expression.codegen;
1985 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1988 /* now the binary */
1989 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1990 self->opbin, leftr, right);
1991 self->expression.outr = bin;
1995 /* we need to call the setter */
2000 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2004 arr = (ast_value*)ai->array;
2005 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2006 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2010 cgen = arr->setter->expression.codegen;
2011 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2014 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2017 ir_call_param(call, iridx);
2018 ir_call_param(call, bin);
2019 self->expression.outr = bin;
2021 /* now store them */
2022 cgen = self->dest->expression.codegen;
2023 /* lvalue of destination */
2024 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2026 self->expression.outl = leftl;
2028 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2030 self->expression.outr = bin;
2033 /* Theoretically, an assinment returns its left side as an
2034 * lvalue, if we don't need an lvalue though, we return
2035 * the right side as an rvalue, otherwise we have to
2036 * somehow know whether or not we need to dereference the pointer
2037 * on the left side - that is: OP_LOAD if it was an address.
2038 * Also: in original QC we cannot OP_LOADP *anyway*.
2040 *out = (lvalue ? leftl : bin);
2045 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2047 ast_expression_codegen *cgen;
2050 /* An unary operation cannot yield an l-value */
2052 compile_error(ast_ctx(self), "not an l-value (binop)");
2056 if (self->expression.outr) {
2057 *out = self->expression.outr;
2061 cgen = self->operand->expression.codegen;
2063 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2066 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2070 self->expression.outr = *out;
2075 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2077 ast_expression_codegen *cgen;
2082 /* In the context of a return operation, we don't actually return
2086 compile_error(ast_ctx(self), "return-expression is not an l-value");
2090 if (self->expression.outr) {
2091 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2094 self->expression.outr = (ir_value*)1;
2096 if (self->operand) {
2097 cgen = self->operand->expression.codegen;
2099 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2102 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2105 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2112 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2114 ast_expression_codegen *cgen;
2115 ir_value *ent, *field;
2117 /* This function needs to take the 'lvalue' flag into account!
2118 * As lvalue we provide a field-pointer, as rvalue we provide the
2122 if (lvalue && self->expression.outl) {
2123 *out = self->expression.outl;
2127 if (!lvalue && self->expression.outr) {
2128 *out = self->expression.outr;
2132 cgen = self->entity->expression.codegen;
2133 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2136 cgen = self->field->expression.codegen;
2137 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2142 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2145 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2146 ent, field, self->expression.vtype);
2147 /* Done AFTER error checking:
2148 codegen_output_type(self, *out);
2152 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2153 (lvalue ? "ADDRESS" : "FIELD"),
2154 type_name[self->expression.vtype]);
2158 codegen_output_type(self, *out);
2161 self->expression.outl = *out;
2163 self->expression.outr = *out;
2165 /* Hm that should be it... */
2169 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2171 ast_expression_codegen *cgen;
2174 /* in QC this is always an lvalue */
2175 if (lvalue && self->rvalue) {
2176 compile_error(ast_ctx(self), "not an l-value (member access)");
2179 if (self->expression.outl) {
2180 *out = self->expression.outl;
2184 cgen = self->owner->expression.codegen;
2185 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2188 if (vec->vtype != TYPE_VECTOR &&
2189 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2194 *out = ir_value_vector_member(vec, self->field);
2195 self->expression.outl = *out;
2197 return (*out != NULL);
2200 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2205 if (!lvalue && self->expression.outr) {
2206 *out = self->expression.outr;
2208 if (lvalue && self->expression.outl) {
2209 *out = self->expression.outl;
2212 if (!ast_istype(self->array, ast_value)) {
2213 compile_error(ast_ctx(self), "array indexing this way is not supported");
2214 /* note this would actually be pointer indexing because the left side is
2215 * not an actual array but (hopefully) an indexable expression.
2216 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2217 * support this path will be filled.
2222 arr = (ast_value*)self->array;
2223 idx = (ast_value*)self->index;
2225 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2226 /* Time to use accessor functions */
2227 ast_expression_codegen *cgen;
2228 ir_value *iridx, *funval;
2232 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2237 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2241 cgen = self->index->expression.codegen;
2242 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2245 cgen = arr->getter->expression.codegen;
2246 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2249 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2252 ir_call_param(call, iridx);
2254 *out = ir_call_value(call);
2255 self->expression.outr = *out;
2259 if (idx->expression.vtype == TYPE_FLOAT) {
2260 unsigned int arridx = idx->constval.vfloat;
2261 if (arridx >= self->array->expression.count)
2263 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2266 *out = arr->ir_values[arridx];
2268 else if (idx->expression.vtype == TYPE_INTEGER) {
2269 unsigned int arridx = idx->constval.vint;
2270 if (arridx >= self->array->expression.count)
2272 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2275 *out = arr->ir_values[arridx];
2278 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2284 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2286 ast_expression_codegen *cgen;
2294 ir_block *ontrue_endblock = NULL;
2295 ir_block *onfalse_endblock = NULL;
2296 ir_block *merge = NULL;
2298 /* We don't output any value, thus also don't care about r/lvalue */
2302 if (self->expression.outr) {
2303 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2306 self->expression.outr = (ir_value*)1;
2308 /* generate the condition */
2309 cgen = self->cond->expression.codegen;
2310 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2312 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2313 cond = func->curblock;
2317 if (self->on_true) {
2318 /* create on-true block */
2319 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2323 /* enter the block */
2324 func->curblock = ontrue;
2327 cgen = self->on_true->expression.codegen;
2328 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2331 /* we now need to work from the current endpoint */
2332 ontrue_endblock = func->curblock;
2337 if (self->on_false) {
2338 /* create on-false block */
2339 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2343 /* enter the block */
2344 func->curblock = onfalse;
2347 cgen = self->on_false->expression.codegen;
2348 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2351 /* we now need to work from the current endpoint */
2352 onfalse_endblock = func->curblock;
2356 /* Merge block were they all merge in to */
2357 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2359 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2362 /* add jumps ot the merge block */
2363 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2365 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2368 /* Now enter the merge block */
2369 func->curblock = merge;
2372 /* we create the if here, that way all blocks are ordered :)
2374 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2375 (ontrue ? ontrue : merge),
2376 (onfalse ? onfalse : merge)))
2384 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2386 ast_expression_codegen *cgen;
2389 ir_value *trueval, *falseval;
2392 ir_block *cond = func->curblock;
2393 ir_block *cond_out = NULL;
2394 ir_block *ontrue, *ontrue_out = NULL;
2395 ir_block *onfalse, *onfalse_out = NULL;
2398 /* Ternary can never create an lvalue... */
2402 /* In theory it shouldn't be possible to pass through a node twice, but
2403 * in case we add any kind of optimization pass for the AST itself, it
2404 * may still happen, thus we remember a created ir_value and simply return one
2405 * if it already exists.
2407 if (self->expression.outr) {
2408 *out = self->expression.outr;
2412 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2414 /* generate the condition */
2415 func->curblock = cond;
2416 cgen = self->cond->expression.codegen;
2417 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2419 cond_out = func->curblock;
2421 /* create on-true block */
2422 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2427 /* enter the block */
2428 func->curblock = ontrue;
2431 cgen = self->on_true->expression.codegen;
2432 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2435 ontrue_out = func->curblock;
2438 /* create on-false block */
2439 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2444 /* enter the block */
2445 func->curblock = onfalse;
2448 cgen = self->on_false->expression.codegen;
2449 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2452 onfalse_out = func->curblock;
2455 /* create merge block */
2456 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2459 /* jump to merge block */
2460 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2462 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2465 /* create if instruction */
2466 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2469 /* Now enter the merge block */
2470 func->curblock = merge;
2472 /* Here, now, we need a PHI node
2473 * but first some sanity checking...
2475 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2476 /* error("ternary with different types on the two sides"); */
2477 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2482 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2484 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2487 ir_phi_add(phi, ontrue_out, trueval);
2488 ir_phi_add(phi, onfalse_out, falseval);
2490 self->expression.outr = ir_phi_value(phi);
2491 *out = self->expression.outr;
2493 codegen_output_type(self, *out);
2498 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2500 ast_expression_codegen *cgen;
2502 ir_value *dummy = NULL;
2503 ir_value *precond = NULL;
2504 ir_value *postcond = NULL;
2506 /* Since we insert some jumps "late" so we have blocks
2507 * ordered "nicely", we need to keep track of the actual end-blocks
2508 * of expressions to add the jumps to.
2510 ir_block *bbody = NULL, *end_bbody = NULL;
2511 ir_block *bprecond = NULL, *end_bprecond = NULL;
2512 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2513 ir_block *bincrement = NULL, *end_bincrement = NULL;
2514 ir_block *bout = NULL, *bin = NULL;
2516 /* let's at least move the outgoing block to the end */
2519 /* 'break' and 'continue' need to be able to find the right blocks */
2520 ir_block *bcontinue = NULL;
2521 ir_block *bbreak = NULL;
2523 ir_block *tmpblock = NULL;
2528 if (self->expression.outr) {
2529 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2532 self->expression.outr = (ir_value*)1;
2535 * Should we ever need some kind of block ordering, better make this function
2536 * move blocks around than write a block ordering algorithm later... after all
2537 * the ast and ir should work together, not against each other.
2540 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2541 * anyway if for example it contains a ternary.
2545 cgen = self->initexpr->expression.codegen;
2546 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2550 /* Store the block from which we enter this chaos */
2551 bin = func->curblock;
2553 /* The pre-loop condition needs its own block since we
2554 * need to be able to jump to the start of that expression.
2558 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2562 /* the pre-loop-condition the least important place to 'continue' at */
2563 bcontinue = bprecond;
2566 func->curblock = bprecond;
2569 cgen = self->precond->expression.codegen;
2570 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2573 end_bprecond = func->curblock;
2575 bprecond = end_bprecond = NULL;
2578 /* Now the next blocks won't be ordered nicely, but we need to
2579 * generate them this early for 'break' and 'continue'.
2581 if (self->increment) {
2582 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2585 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2587 bincrement = end_bincrement = NULL;
2590 if (self->postcond) {
2591 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2594 bcontinue = bpostcond; /* postcond comes before the increment */
2596 bpostcond = end_bpostcond = NULL;
2599 bout_id = vec_size(func->ir_func->blocks);
2600 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2605 /* The loop body... */
2606 /* if (self->body) */
2608 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2613 func->curblock = bbody;
2615 vec_push(func->breakblocks, bbreak);
2617 vec_push(func->continueblocks, bcontinue);
2619 vec_push(func->continueblocks, bbody);
2623 cgen = self->body->expression.codegen;
2624 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2628 end_bbody = func->curblock;
2629 vec_pop(func->breakblocks);
2630 vec_pop(func->continueblocks);
2633 /* post-loop-condition */
2637 func->curblock = bpostcond;
2640 cgen = self->postcond->expression.codegen;
2641 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2644 end_bpostcond = func->curblock;
2647 /* The incrementor */
2648 if (self->increment)
2651 func->curblock = bincrement;
2654 cgen = self->increment->expression.codegen;
2655 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2658 end_bincrement = func->curblock;
2661 /* In any case now, we continue from the outgoing block */
2662 func->curblock = bout;
2664 /* Now all blocks are in place */
2665 /* From 'bin' we jump to whatever comes first */
2666 if (bprecond) tmpblock = bprecond;
2667 else if (bbody) tmpblock = bbody;
2668 else if (bpostcond) tmpblock = bpostcond;
2669 else tmpblock = bout;
2670 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2676 ir_block *ontrue, *onfalse;
2677 if (bbody) ontrue = bbody;
2678 else if (bincrement) ontrue = bincrement;
2679 else if (bpostcond) ontrue = bpostcond;
2680 else ontrue = bprecond;
2682 if (self->pre_not) {
2687 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2694 if (bincrement) tmpblock = bincrement;
2695 else if (bpostcond) tmpblock = bpostcond;
2696 else if (bprecond) tmpblock = bprecond;
2697 else tmpblock = bbody;
2698 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2702 /* from increment */
2705 if (bpostcond) tmpblock = bpostcond;
2706 else if (bprecond) tmpblock = bprecond;
2707 else if (bbody) tmpblock = bbody;
2708 else tmpblock = bout;
2709 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2716 ir_block *ontrue, *onfalse;
2717 if (bprecond) ontrue = bprecond;
2718 else if (bbody) ontrue = bbody;
2719 else if (bincrement) ontrue = bincrement;
2720 else ontrue = bpostcond;
2722 if (self->post_not) {
2727 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2731 /* Move 'bout' to the end */
2732 vec_remove(func->ir_func->blocks, bout_id, 1);
2733 vec_push(func->ir_func->blocks, bout);
2738 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2745 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2749 if (self->expression.outr) {
2750 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2753 self->expression.outr = (ir_value*)1;
2755 if (self->is_continue)
2756 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2758 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2761 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2765 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2770 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2772 ast_expression_codegen *cgen;
2774 ast_switch_case *def_case = NULL;
2775 ir_block *def_bfall = NULL;
2776 ir_block *def_bfall_to = NULL;
2777 bool set_def_bfall_to = false;
2779 ir_value *dummy = NULL;
2780 ir_value *irop = NULL;
2781 ir_block *bout = NULL;
2782 ir_block *bfall = NULL;
2790 compile_error(ast_ctx(self), "switch expression is not an l-value");
2794 if (self->expression.outr) {
2795 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2798 self->expression.outr = (ir_value*)1;
2803 cgen = self->operand->expression.codegen;
2804 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2807 if (!vec_size(self->cases))
2810 cmpinstr = type_eq_instr[irop->vtype];
2811 if (cmpinstr >= AINSTR_END) {
2812 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2813 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2817 bout_id = vec_size(func->ir_func->blocks);
2818 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2822 /* setup the break block */
2823 vec_push(func->breakblocks, bout);
2825 /* Now create all cases */
2826 for (c = 0; c < vec_size(self->cases); ++c) {
2827 ir_value *cond, *val;
2828 ir_block *bcase, *bnot;
2831 ast_switch_case *swcase = &self->cases[c];
2833 if (swcase->value) {
2834 /* A regular case */
2835 /* generate the condition operand */
2836 cgen = swcase->value->expression.codegen;
2837 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2839 /* generate the condition */
2840 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2844 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2845 bnot_id = vec_size(func->ir_func->blocks);
2846 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2847 if (!bcase || !bnot)
2849 if (set_def_bfall_to) {
2850 set_def_bfall_to = false;
2851 def_bfall_to = bcase;
2853 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2856 /* Make the previous case-end fall through */
2857 if (bfall && !bfall->final) {
2858 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2862 /* enter the case */
2863 func->curblock = bcase;
2864 cgen = swcase->code->expression.codegen;
2865 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2868 /* remember this block to fall through from */
2869 bfall = func->curblock;
2871 /* enter the else and move it down */
2872 func->curblock = bnot;
2873 vec_remove(func->ir_func->blocks, bnot_id, 1);
2874 vec_push(func->ir_func->blocks, bnot);
2876 /* The default case */
2877 /* Remember where to fall through from: */
2880 /* remember which case it was */
2882 /* And the next case will be remembered */
2883 set_def_bfall_to = true;
2887 /* Jump from the last bnot to bout */
2888 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2890 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2895 /* If there was a default case, put it down here */
2899 /* No need to create an extra block */
2900 bcase = func->curblock;
2902 /* Insert the fallthrough jump */
2903 if (def_bfall && !def_bfall->final) {
2904 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2908 /* Now generate the default code */
2909 cgen = def_case->code->expression.codegen;
2910 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2913 /* see if we need to fall through */
2914 if (def_bfall_to && !func->curblock->final)
2916 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2921 /* Jump from the last bnot to bout */
2922 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2924 /* enter the outgoing block */
2925 func->curblock = bout;
2927 /* restore the break block */
2928 vec_pop(func->breakblocks);
2930 /* Move 'bout' to the end, it's nicer */
2931 vec_remove(func->ir_func->blocks, bout_id, 1);
2932 vec_push(func->ir_func->blocks, bout);
2937 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2942 if (self->undefined) {
2943 compile_error(ast_ctx(self), "internal error: ast_label never defined");
2949 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2953 /* simply create a new block and jump to it */
2954 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2955 if (!self->irblock) {
2956 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2959 if (!func->curblock->final) {
2960 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2964 /* enter the new block */
2965 func->curblock = self->irblock;
2967 /* Generate all the leftover gotos */
2968 for (i = 0; i < vec_size(self->gotos); ++i) {
2969 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2976 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2980 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2984 if (self->target->irblock) {
2985 if (self->irblock_from) {
2986 /* we already tried once, this is the callback */
2987 self->irblock_from->final = false;
2988 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2989 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2995 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
2996 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3003 /* the target has not yet been created...
3004 * close this block in a sneaky way:
3006 func->curblock->final = true;
3007 self->irblock_from = func->curblock;
3008 ast_label_register_goto(self->target, self);
3014 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3016 ast_expression_codegen *cgen;
3018 ir_instr *callinstr;
3021 ir_value *funval = NULL;
3023 /* return values are never lvalues */
3025 compile_error(ast_ctx(self), "not an l-value (function call)");
3029 if (self->expression.outr) {
3030 *out = self->expression.outr;
3034 cgen = self->func->expression.codegen;
3035 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3043 for (i = 0; i < vec_size(self->params); ++i)
3046 ast_expression *expr = self->params[i];
3048 cgen = expr->expression.codegen;
3049 if (!(*cgen)(expr, func, false, ¶m))
3053 vec_push(params, param);
3056 /* varargs counter */
3057 if (self->va_count) {
3059 ir_builder *builder = func->curblock->owner->owner;
3060 cgen = self->va_count->expression.codegen;
3061 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3063 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3064 ir_builder_get_va_count(builder), va_count))
3070 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3071 ast_function_label(func, "call"),
3072 funval, !!(self->func->expression.flags & AST_FLAG_NORETURN));
3076 for (i = 0; i < vec_size(params); ++i) {
3077 ir_call_param(callinstr, params[i]);
3080 *out = ir_call_value(callinstr);
3081 self->expression.outr = *out;
3083 codegen_output_type(self, *out);