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);
107 fromex = &self->expression;
108 selfex = &cp->expression;
109 selfex->count = fromex->count;
110 selfex->flags = fromex->flags;
111 for (i = 0; i < vec_size(fromex->params); ++i) {
112 ast_value *v = ast_value_copy(fromex->params[i]);
113 vec_push(selfex->params, v);
118 void ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
121 const ast_expression_common *fromex;
122 ast_expression_common *selfex;
123 self->expression.vtype = other->expression.vtype;
124 if (other->expression.next) {
125 self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
127 fromex = &other->expression;
128 selfex = &self->expression;
129 selfex->count = fromex->count;
130 selfex->flags = fromex->flags;
131 for (i = 0; i < vec_size(fromex->params); ++i) {
132 ast_value *v = ast_value_copy(fromex->params[i]);
133 vec_push(selfex->params, v);
137 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
139 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
140 ast_expression_init(self, NULL);
141 self->expression.codegen = NULL;
142 self->expression.next = NULL;
143 self->expression.vtype = vtype;
147 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
150 const ast_expression_common *fromex;
151 ast_expression_common *selfex;
157 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
158 ast_expression_init(self, NULL);
160 fromex = &ex->expression;
161 selfex = &self->expression;
163 /* This may never be codegen()d */
164 selfex->codegen = NULL;
166 selfex->vtype = fromex->vtype;
168 selfex->next = ast_type_copy(ctx, fromex->next);
172 selfex->count = fromex->count;
173 selfex->flags = fromex->flags;
174 for (i = 0; i < vec_size(fromex->params); ++i) {
175 ast_value *v = ast_value_copy(fromex->params[i]);
176 vec_push(selfex->params, v);
183 bool ast_compare_type(ast_expression *a, ast_expression *b)
185 if (a->expression.vtype == TYPE_NIL ||
186 b->expression.vtype == TYPE_NIL)
188 if (a->expression.vtype != b->expression.vtype)
190 if (!a->expression.next != !b->expression.next)
192 if (vec_size(a->expression.params) != vec_size(b->expression.params))
194 if ((a->expression.flags & AST_FLAG_TYPE_MASK) !=
195 (b->expression.flags & AST_FLAG_TYPE_MASK) )
199 if (vec_size(a->expression.params)) {
201 for (i = 0; i < vec_size(a->expression.params); ++i) {
202 if (!ast_compare_type((ast_expression*)a->expression.params[i],
203 (ast_expression*)b->expression.params[i]))
207 if (a->expression.next)
208 return ast_compare_type(a->expression.next, b->expression.next);
212 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
219 if (pos + 6 >= bufsize)
221 strncpy(buf + pos, "(null)", 6);
225 if (pos + 1 >= bufsize)
228 switch (e->expression.vtype) {
230 strncpy(buf + pos, "(variant)", 9);
235 return ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
238 if (pos + 3 >= bufsize)
242 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
243 if (pos + 1 >= bufsize)
249 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
250 if (pos + 2 >= bufsize)
252 if (!vec_size(e->expression.params)) {
258 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[0]), buf, bufsize, pos);
259 for (i = 1; i < vec_size(e->expression.params); ++i) {
260 if (pos + 2 >= bufsize)
264 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[i]), buf, bufsize, pos);
266 if (pos + 1 >= bufsize)
272 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
273 if (pos + 1 >= bufsize)
276 pos += snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->expression.count);
277 if (pos + 1 >= bufsize)
283 typestr = type_name[e->expression.vtype];
284 typelen = strlen(typestr);
285 if (pos + typelen >= bufsize)
287 strncpy(buf + pos, typestr, typelen);
288 return pos + typelen;
292 buf[bufsize-3] = '.';
293 buf[bufsize-2] = '.';
294 buf[bufsize-1] = '.';
298 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
300 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
304 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
306 ast_instantiate(ast_value, ctx, ast_value_delete);
307 ast_expression_init((ast_expression*)self,
308 (ast_expression_codegen*)&ast_value_codegen);
309 self->expression.node.keep = true; /* keep */
311 self->name = name ? util_strdup(name) : NULL;
312 self->expression.vtype = t;
313 self->expression.next = NULL;
314 self->isfield = false;
316 self->hasvalue = false;
318 memset(&self->constval, 0, sizeof(self->constval));
321 self->ir_values = NULL;
322 self->ir_value_count = 0;
328 self->argcounter = NULL;
333 void ast_value_delete(ast_value* self)
336 mem_d((void*)self->name);
337 if (self->argcounter)
338 mem_d((void*)self->argcounter);
339 if (self->hasvalue) {
340 switch (self->expression.vtype)
343 mem_d((void*)self->constval.vstring);
346 /* unlink us from the function node */
347 self->constval.vfunc->vtype = NULL;
349 /* NOTE: delete function? currently collected in
350 * the parser structure
357 mem_d(self->ir_values);
362 ast_expression_delete((ast_expression*)self);
366 void ast_value_params_add(ast_value *self, ast_value *p)
368 vec_push(self->expression.params, p);
371 bool ast_value_set_name(ast_value *self, const char *name)
374 mem_d((void*)self->name);
375 self->name = util_strdup(name);
379 ast_binary* ast_binary_new(lex_ctx ctx, int op,
380 ast_expression* left, ast_expression* right)
382 ast_instantiate(ast_binary, ctx, ast_binary_delete);
383 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
389 ast_propagate_effects(self, left);
390 ast_propagate_effects(self, right);
392 if (op >= INSTR_EQ_F && op <= INSTR_GT)
393 self->expression.vtype = TYPE_FLOAT;
394 else if (op == INSTR_AND || op == INSTR_OR) {
395 if (OPTS_FLAG(PERL_LOGIC))
396 ast_type_adopt(self, right);
398 self->expression.vtype = TYPE_FLOAT;
400 else if (op == INSTR_BITAND || op == INSTR_BITOR)
401 self->expression.vtype = TYPE_FLOAT;
402 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
403 self->expression.vtype = TYPE_VECTOR;
404 else if (op == INSTR_MUL_V)
405 self->expression.vtype = TYPE_FLOAT;
407 self->expression.vtype = left->expression.vtype;
410 self->refs = AST_REF_ALL;
415 void ast_binary_delete(ast_binary *self)
417 if (self->refs & AST_REF_LEFT) ast_unref(self->left);
418 if (self->refs & AST_REF_RIGHT) ast_unref(self->right);
420 ast_expression_delete((ast_expression*)self);
424 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
425 ast_expression* left, ast_expression* right)
427 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
428 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
430 ast_side_effects(self) = true;
432 self->opstore = storop;
435 self->source = right;
437 self->keep_dest = false;
439 ast_type_adopt(self, left);
443 void ast_binstore_delete(ast_binstore *self)
445 if (!self->keep_dest)
446 ast_unref(self->dest);
447 ast_unref(self->source);
448 ast_expression_delete((ast_expression*)self);
452 ast_unary* ast_unary_new(lex_ctx ctx, int op,
453 ast_expression *expr)
455 ast_instantiate(ast_unary, ctx, ast_unary_delete);
456 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
459 self->operand = expr;
461 ast_propagate_effects(self, expr);
463 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
464 self->expression.vtype = TYPE_FLOAT;
466 compile_error(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
471 void ast_unary_delete(ast_unary *self)
473 if (self->operand) ast_unref(self->operand);
474 ast_expression_delete((ast_expression*)self);
478 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
480 ast_instantiate(ast_return, ctx, ast_return_delete);
481 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
483 self->operand = expr;
486 ast_propagate_effects(self, expr);
491 void ast_return_delete(ast_return *self)
494 ast_unref(self->operand);
495 ast_expression_delete((ast_expression*)self);
499 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
501 if (field->expression.vtype != TYPE_FIELD) {
502 compile_error(ctx, "ast_entfield_new with expression not of type field");
505 return ast_entfield_new_force(ctx, entity, field, field->expression.next);
508 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
510 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
514 /* Error: field has no type... */
518 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
520 self->entity = entity;
522 ast_propagate_effects(self, entity);
523 ast_propagate_effects(self, field);
525 ast_type_adopt(self, outtype);
529 void ast_entfield_delete(ast_entfield *self)
531 ast_unref(self->entity);
532 ast_unref(self->field);
533 ast_expression_delete((ast_expression*)self);
537 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field, const char *name)
539 ast_instantiate(ast_member, ctx, ast_member_delete);
545 if (owner->expression.vtype != TYPE_VECTOR &&
546 owner->expression.vtype != TYPE_FIELD) {
547 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
552 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
553 self->expression.node.keep = true; /* keep */
555 if (owner->expression.vtype == TYPE_VECTOR) {
556 self->expression.vtype = TYPE_FLOAT;
557 self->expression.next = NULL;
559 self->expression.vtype = TYPE_FIELD;
560 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
563 self->rvalue = false;
565 ast_propagate_effects(self, owner);
569 self->name = util_strdup(name);
576 void ast_member_delete(ast_member *self)
578 /* The owner is always an ast_value, which has .keep=true,
579 * also: ast_members are usually deleted after the owner, thus
580 * this will cause invalid access
581 ast_unref(self->owner);
582 * once we allow (expression).x to access a vector-member, we need
583 * to change this: preferably by creating an alternate ast node for this
584 * purpose that is not garbage-collected.
586 ast_expression_delete((ast_expression*)self);
591 bool ast_member_set_name(ast_member *self, const char *name)
594 mem_d((void*)self->name);
595 self->name = util_strdup(name);
599 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
601 ast_expression *outtype;
602 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
604 outtype = array->expression.next;
607 /* Error: field has no type... */
611 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
615 ast_propagate_effects(self, array);
616 ast_propagate_effects(self, index);
618 ast_type_adopt(self, outtype);
619 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
620 if (self->expression.vtype != TYPE_ARRAY) {
621 compile_error(ast_ctx(self), "array_index node on type");
622 ast_array_index_delete(self);
625 self->array = outtype;
626 self->expression.vtype = TYPE_FIELD;
632 void ast_array_index_delete(ast_array_index *self)
635 ast_unref(self->array);
637 ast_unref(self->index);
638 ast_expression_delete((ast_expression*)self);
642 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
644 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
645 if (!ontrue && !onfalse) {
646 /* because it is invalid */
650 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
653 self->on_true = ontrue;
654 self->on_false = onfalse;
655 ast_propagate_effects(self, cond);
657 ast_propagate_effects(self, ontrue);
659 ast_propagate_effects(self, onfalse);
664 void ast_ifthen_delete(ast_ifthen *self)
666 ast_unref(self->cond);
668 ast_unref(self->on_true);
670 ast_unref(self->on_false);
671 ast_expression_delete((ast_expression*)self);
675 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
677 ast_expression *exprtype = ontrue;
678 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
679 /* This time NEITHER must be NULL */
680 if (!ontrue || !onfalse) {
684 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
687 self->on_true = ontrue;
688 self->on_false = onfalse;
689 ast_propagate_effects(self, cond);
690 ast_propagate_effects(self, ontrue);
691 ast_propagate_effects(self, onfalse);
693 if (ontrue->expression.vtype == TYPE_NIL)
695 ast_type_adopt(self, exprtype);
700 void ast_ternary_delete(ast_ternary *self)
702 /* the if()s are only there because computed-gotos can set them
705 if (self->cond) ast_unref(self->cond);
706 if (self->on_true) ast_unref(self->on_true);
707 if (self->on_false) ast_unref(self->on_false);
708 ast_expression_delete((ast_expression*)self);
712 ast_loop* ast_loop_new(lex_ctx ctx,
713 ast_expression *initexpr,
714 ast_expression *precond, bool pre_not,
715 ast_expression *postcond, bool post_not,
716 ast_expression *increment,
717 ast_expression *body)
719 ast_instantiate(ast_loop, ctx, ast_loop_delete);
720 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
722 self->initexpr = initexpr;
723 self->precond = precond;
724 self->postcond = postcond;
725 self->increment = increment;
728 self->pre_not = pre_not;
729 self->post_not = post_not;
732 ast_propagate_effects(self, initexpr);
734 ast_propagate_effects(self, precond);
736 ast_propagate_effects(self, postcond);
738 ast_propagate_effects(self, increment);
740 ast_propagate_effects(self, body);
745 void ast_loop_delete(ast_loop *self)
748 ast_unref(self->initexpr);
750 ast_unref(self->precond);
752 ast_unref(self->postcond);
754 ast_unref(self->increment);
756 ast_unref(self->body);
757 ast_expression_delete((ast_expression*)self);
761 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont, unsigned int levels)
763 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
764 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
766 self->is_continue = iscont;
767 self->levels = levels;
772 void ast_breakcont_delete(ast_breakcont *self)
774 ast_expression_delete((ast_expression*)self);
778 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
780 ast_instantiate(ast_switch, ctx, ast_switch_delete);
781 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
786 ast_propagate_effects(self, op);
791 void ast_switch_delete(ast_switch *self)
794 ast_unref(self->operand);
796 for (i = 0; i < vec_size(self->cases); ++i) {
797 if (self->cases[i].value)
798 ast_unref(self->cases[i].value);
799 ast_unref(self->cases[i].code);
801 vec_free(self->cases);
803 ast_expression_delete((ast_expression*)self);
807 ast_label* ast_label_new(lex_ctx ctx, const char *name, bool undefined)
809 ast_instantiate(ast_label, ctx, ast_label_delete);
810 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
812 self->expression.vtype = TYPE_NOEXPR;
814 self->name = util_strdup(name);
815 self->irblock = NULL;
817 self->undefined = undefined;
822 void ast_label_delete(ast_label *self)
824 mem_d((void*)self->name);
825 vec_free(self->gotos);
826 ast_expression_delete((ast_expression*)self);
830 void ast_label_register_goto(ast_label *self, ast_goto *g)
832 vec_push(self->gotos, g);
835 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
837 ast_instantiate(ast_goto, ctx, ast_goto_delete);
838 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
840 self->name = util_strdup(name);
842 self->irblock_from = NULL;
847 void ast_goto_delete(ast_goto *self)
849 mem_d((void*)self->name);
850 ast_expression_delete((ast_expression*)self);
854 void ast_goto_set_label(ast_goto *self, ast_label *label)
856 self->target = label;
859 ast_call* ast_call_new(lex_ctx ctx,
860 ast_expression *funcexpr)
862 ast_instantiate(ast_call, ctx, ast_call_delete);
863 if (!funcexpr->expression.next) {
864 compile_error(ctx, "not a function");
868 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
870 ast_side_effects(self) = true;
873 self->func = funcexpr;
874 self->va_count = NULL;
876 ast_type_adopt(self, funcexpr->expression.next);
881 void ast_call_delete(ast_call *self)
884 for (i = 0; i < vec_size(self->params); ++i)
885 ast_unref(self->params[i]);
886 vec_free(self->params);
889 ast_unref(self->func);
892 ast_unref(self->va_count);
894 ast_expression_delete((ast_expression*)self);
898 bool ast_call_check_types(ast_call *self)
904 const ast_expression *func = self->func;
905 size_t count = vec_size(self->params);
906 if (count > vec_size(func->expression.params))
907 count = vec_size(func->expression.params);
909 for (i = 0; i < count; ++i) {
910 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i])))
912 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
913 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
914 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
915 (unsigned int)(i+1), texp, tgot);
916 /* we don't immediately return */
920 count = vec_size(self->params);
921 if (count > vec_size(func->expression.params) && func->expression.varparam) {
922 for (; i < count; ++i) {
923 if (!ast_compare_type(self->params[i], func->expression.varparam))
925 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
926 ast_type_to_string(func->expression.varparam, texp, sizeof(texp));
927 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
928 (unsigned int)(i+1), texp, tgot);
929 /* we don't immediately return */
937 ast_store* ast_store_new(lex_ctx ctx, int op,
938 ast_expression *dest, ast_expression *source)
940 ast_instantiate(ast_store, ctx, ast_store_delete);
941 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
943 ast_side_effects(self) = true;
947 self->source = source;
949 ast_type_adopt(self, dest);
954 void ast_store_delete(ast_store *self)
956 ast_unref(self->dest);
957 ast_unref(self->source);
958 ast_expression_delete((ast_expression*)self);
962 ast_block* ast_block_new(lex_ctx ctx)
964 ast_instantiate(ast_block, ctx, ast_block_delete);
965 ast_expression_init((ast_expression*)self,
966 (ast_expression_codegen*)&ast_block_codegen);
970 self->collect = NULL;
975 bool ast_block_add_expr(ast_block *self, ast_expression *e)
977 ast_propagate_effects(self, e);
978 vec_push(self->exprs, e);
979 if (self->expression.next) {
980 ast_delete(self->expression.next);
981 self->expression.next = NULL;
983 ast_type_adopt(self, e);
987 void ast_block_collect(ast_block *self, ast_expression *expr)
989 vec_push(self->collect, expr);
990 expr->expression.node.keep = true;
993 void ast_block_delete(ast_block *self)
996 for (i = 0; i < vec_size(self->exprs); ++i)
997 ast_unref(self->exprs[i]);
998 vec_free(self->exprs);
999 for (i = 0; i < vec_size(self->locals); ++i)
1000 ast_delete(self->locals[i]);
1001 vec_free(self->locals);
1002 for (i = 0; i < vec_size(self->collect); ++i)
1003 ast_delete(self->collect[i]);
1004 vec_free(self->collect);
1005 ast_expression_delete((ast_expression*)self);
1009 void ast_block_set_type(ast_block *self, ast_expression *from)
1011 if (self->expression.next)
1012 ast_delete(self->expression.next);
1013 ast_type_adopt(self, from);
1016 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1018 ast_instantiate(ast_function, ctx, ast_function_delete);
1022 vtype->expression.vtype != TYPE_FUNCTION)
1024 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1026 (int)vtype->hasvalue,
1027 vtype->expression.vtype);
1032 self->vtype = vtype;
1033 self->name = name ? util_strdup(name) : NULL;
1034 self->blocks = NULL;
1036 self->labelcount = 0;
1039 self->ir_func = NULL;
1040 self->curblock = NULL;
1042 self->breakblocks = NULL;
1043 self->continueblocks = NULL;
1045 vtype->hasvalue = true;
1046 vtype->constval.vfunc = self;
1048 self->varargs = NULL;
1050 self->fixedparams = NULL;
1055 void ast_function_delete(ast_function *self)
1059 mem_d((void*)self->name);
1061 /* ast_value_delete(self->vtype); */
1062 self->vtype->hasvalue = false;
1063 self->vtype->constval.vfunc = NULL;
1064 /* We use unref - if it was stored in a global table it is supposed
1065 * to be deleted from *there*
1067 ast_unref(self->vtype);
1069 for (i = 0; i < vec_size(self->blocks); ++i)
1070 ast_delete(self->blocks[i]);
1071 vec_free(self->blocks);
1072 vec_free(self->breakblocks);
1073 vec_free(self->continueblocks);
1075 ast_delete(self->varargs);
1077 ast_delete(self->argc);
1078 if (self->fixedparams)
1079 ast_unref(self->fixedparams);
1083 const char* ast_function_label(ast_function *self, const char *prefix)
1089 if (!OPTS_OPTION_BOOL(OPTION_DUMP) &&
1090 !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
1091 !OPTS_OPTION_BOOL(OPTION_DEBUG))
1096 id = (self->labelcount++);
1097 len = strlen(prefix);
1099 from = self->labelbuf + sizeof(self->labelbuf)-1;
1102 *from-- = (id%10) + '0';
1106 memcpy(from - len, prefix, len);
1110 /*********************************************************************/
1112 * by convention you must never pass NULL to the 'ir_value **out'
1113 * parameter. If you really don't care about the output, pass a dummy.
1114 * But I can't imagine a pituation where the output is truly unnecessary.
1117 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1119 if (out->vtype == TYPE_FIELD)
1120 out->fieldtype = self->next->expression.vtype;
1121 if (out->vtype == TYPE_FUNCTION)
1122 out->outtype = self->next->expression.vtype;
1125 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1127 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1131 if (self->expression.vtype == TYPE_NIL) {
1132 *out = func->ir_func->owner->nil;
1135 /* NOTE: This is the codegen for a variable used in an expression.
1136 * It is not the codegen to generate the value. For this purpose,
1137 * ast_local_codegen and ast_global_codegen are to be used before this
1138 * is executed. ast_function_codegen should take care of its locals,
1139 * and the ast-user should take care of ast_global_codegen to be used
1140 * on all the globals.
1143 char tname[1024]; /* typename is reserved in C++ */
1144 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1145 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1152 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1156 if (self->expression.vtype == TYPE_NIL) {
1157 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1161 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1163 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1166 func->context = ast_ctx(self);
1167 func->value->context = ast_ctx(self);
1169 self->constval.vfunc->ir_func = func;
1170 self->ir_v = func->value;
1171 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1172 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1173 /* The function is filled later on ast_function_codegen... */
1177 if (isfield && self->expression.vtype == TYPE_FIELD) {
1178 ast_expression *fieldtype = self->expression.next;
1180 if (self->hasvalue) {
1181 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1185 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1190 ast_expression_common *elemtype;
1192 ast_value *array = (ast_value*)fieldtype;
1194 if (!ast_istype(fieldtype, ast_value)) {
1195 compile_error(ast_ctx(self), "internal error: ast_value required");
1199 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1200 if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1201 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1203 elemtype = &array->expression.next->expression;
1204 vtype = elemtype->vtype;
1206 v = ir_builder_create_field(ir, self->name, vtype);
1208 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1211 v->context = ast_ctx(self);
1212 v->unique_life = true;
1214 array->ir_v = self->ir_v = v;
1215 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1216 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1218 namelen = strlen(self->name);
1219 name = (char*)mem_a(namelen + 16);
1220 strncpy(name, self->name, namelen);
1222 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1223 array->ir_values[0] = v;
1224 for (ai = 1; ai < array->expression.count; ++ai) {
1225 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1226 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1227 if (!array->ir_values[ai]) {
1229 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1232 array->ir_values[ai]->context = ast_ctx(self);
1233 array->ir_values[ai]->unique_life = true;
1234 array->ir_values[ai]->locked = true;
1235 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1236 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1242 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1245 v->context = ast_ctx(self);
1247 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1248 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1253 if (self->expression.vtype == TYPE_ARRAY) {
1258 ast_expression_common *elemtype = &self->expression.next->expression;
1259 int vtype = elemtype->vtype;
1261 /* same as with field arrays */
1262 if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1263 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1265 v = ir_builder_create_global(ir, self->name, vtype);
1267 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1270 v->context = ast_ctx(self);
1271 v->unique_life = true;
1273 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1274 v->flags |= IR_FLAG_INCLUDE_DEF;
1276 namelen = strlen(self->name);
1277 name = (char*)mem_a(namelen + 16);
1278 strncpy(name, self->name, namelen);
1280 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1281 self->ir_values[0] = v;
1282 for (ai = 1; ai < self->expression.count; ++ai) {
1283 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1284 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1285 if (!self->ir_values[ai]) {
1287 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1290 self->ir_values[ai]->context = ast_ctx(self);
1291 self->ir_values[ai]->unique_life = true;
1292 self->ir_values[ai]->locked = true;
1293 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1294 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1300 /* Arrays don't do this since there's no "array" value which spans across the
1303 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1305 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1308 codegen_output_type(self, v);
1309 v->context = ast_ctx(self);
1312 if (self->hasvalue) {
1313 switch (self->expression.vtype)
1316 if (!ir_value_set_float(v, self->constval.vfloat))
1320 if (!ir_value_set_vector(v, self->constval.vvec))
1324 if (!ir_value_set_string(v, self->constval.vstring))
1328 compile_error(ast_ctx(self), "TODO: global constant array");
1331 compile_error(ast_ctx(self), "global of type function not properly generated");
1333 /* Cannot generate an IR value for a function,
1334 * need a pointer pointing to a function rather.
1337 if (!self->constval.vfield) {
1338 compile_error(ast_ctx(self), "field constant without vfield set");
1341 if (!self->constval.vfield->ir_v) {
1342 compile_error(ast_ctx(self), "field constant generated before its field");
1345 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1349 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1354 /* link us to the ir_value */
1357 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1358 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1361 error: /* clean up */
1366 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1370 if (self->expression.vtype == TYPE_NIL) {
1371 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1375 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1377 /* Do we allow local functions? I think not...
1378 * this is NOT a function pointer atm.
1383 if (self->expression.vtype == TYPE_ARRAY) {
1388 ast_expression_common *elemtype = &self->expression.next->expression;
1389 int vtype = elemtype->vtype;
1391 func->flags |= IR_FLAG_HAS_ARRAYS;
1393 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1394 compile_error(ast_ctx(self), "array-parameters are not supported");
1398 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1399 if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1400 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1403 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1404 if (!self->ir_values) {
1405 compile_error(ast_ctx(self), "failed to allocate array values");
1409 v = ir_function_create_local(func, self->name, vtype, param);
1411 compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1414 v->context = ast_ctx(self);
1415 v->unique_life = true;
1418 namelen = strlen(self->name);
1419 name = (char*)mem_a(namelen + 16);
1420 strncpy(name, self->name, namelen);
1422 self->ir_values[0] = v;
1423 for (ai = 1; ai < self->expression.count; ++ai) {
1424 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1425 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1426 if (!self->ir_values[ai]) {
1427 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1430 self->ir_values[ai]->context = ast_ctx(self);
1431 self->ir_values[ai]->unique_life = true;
1432 self->ir_values[ai]->locked = true;
1437 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1440 codegen_output_type(self, v);
1441 v->context = ast_ctx(self);
1444 /* A constant local... hmmm...
1445 * I suppose the IR will have to deal with this
1447 if (self->hasvalue) {
1448 switch (self->expression.vtype)
1451 if (!ir_value_set_float(v, self->constval.vfloat))
1455 if (!ir_value_set_vector(v, self->constval.vvec))
1459 if (!ir_value_set_string(v, self->constval.vstring))
1463 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1468 /* link us to the ir_value */
1472 if (!ast_generate_accessors(self, func->owner))
1476 error: /* clean up */
1481 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1484 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1485 if (!self->setter || !self->getter)
1487 for (i = 0; i < self->expression.count; ++i) {
1488 if (!self->ir_values) {
1489 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1492 if (!self->ir_values[i]) {
1493 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1496 if (self->ir_values[i]->life) {
1497 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1502 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1504 if (!ast_global_codegen (self->setter, ir, false) ||
1505 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1506 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1508 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1509 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1514 if (!ast_global_codegen (self->getter, ir, false) ||
1515 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1516 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1518 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1519 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1523 for (i = 0; i < self->expression.count; ++i) {
1524 vec_free(self->ir_values[i]->life);
1526 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1530 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1534 ast_expression_common *ec;
1535 ast_expression_codegen *cgen;
1540 irf = self->ir_func;
1542 compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1546 /* fill the parameter list */
1547 ec = &self->vtype->expression;
1548 for (i = 0; i < vec_size(ec->params); ++i)
1550 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1551 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1553 vec_push(irf->params, ec->params[i]->expression.vtype);
1554 if (!self->builtin) {
1555 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1560 if (self->varargs) {
1561 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1563 irf->max_varargs = self->varargs->expression.count;
1566 if (self->builtin) {
1567 irf->builtin = self->builtin;
1571 if (!vec_size(self->blocks)) {
1572 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1576 irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1577 if (!self->curblock) {
1578 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1586 if (!ast_local_codegen(self->argc, self->ir_func, true))
1588 cgen = self->argc->expression.codegen;
1589 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1591 cgen = self->fixedparams->expression.codegen;
1592 if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1594 sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1595 ast_function_label(self, "va_count"), INSTR_SUB_F,
1596 ir_builder_get_va_count(ir), fixed);
1599 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1606 for (i = 0; i < vec_size(self->blocks); ++i) {
1607 cgen = self->blocks[i]->expression.codegen;
1608 if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1612 /* TODO: check return types */
1613 if (!self->curblock->final)
1615 if (!self->vtype->expression.next ||
1616 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1618 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1620 else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1622 /* error("missing return"); */
1623 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1624 "control reaches end of non-void function (`%s`) via %s",
1625 self->name, self->curblock->label))
1629 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1635 /* Note, you will not see ast_block_codegen generate ir_blocks.
1636 * To the AST and the IR, blocks are 2 different things.
1637 * In the AST it represents a block of code, usually enclosed in
1638 * curly braces {...}.
1639 * While in the IR it represents a block in terms of control-flow.
1641 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1645 /* We don't use this
1646 * Note: an ast-representation using the comma-operator
1647 * of the form: (a, b, c) = x should not assign to c...
1650 compile_error(ast_ctx(self), "not an l-value (code-block)");
1654 if (self->expression.outr) {
1655 *out = self->expression.outr;
1659 /* output is NULL at first, we'll have each expression
1660 * assign to out output, thus, a comma-operator represention
1661 * using an ast_block will return the last generated value,
1662 * so: (b, c) + a executed both b and c, and returns c,
1663 * which is then added to a.
1667 /* generate locals */
1668 for (i = 0; i < vec_size(self->locals); ++i)
1670 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1671 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1672 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1677 for (i = 0; i < vec_size(self->exprs); ++i)
1679 ast_expression_codegen *gen;
1680 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1681 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1685 gen = self->exprs[i]->expression.codegen;
1686 if (!(*gen)(self->exprs[i], func, false, out))
1690 self->expression.outr = *out;
1695 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1697 ast_expression_codegen *cgen;
1698 ir_value *left = NULL;
1699 ir_value *right = NULL;
1703 ast_array_index *ai = NULL;
1705 if (lvalue && self->expression.outl) {
1706 *out = self->expression.outl;
1710 if (!lvalue && self->expression.outr) {
1711 *out = self->expression.outr;
1715 if (ast_istype(self->dest, ast_array_index))
1718 ai = (ast_array_index*)self->dest;
1719 idx = (ast_value*)ai->index;
1721 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1726 /* we need to call the setter */
1727 ir_value *iridx, *funval;
1731 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1735 arr = (ast_value*)ai->array;
1736 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1737 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1741 cgen = idx->expression.codegen;
1742 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1745 cgen = arr->setter->expression.codegen;
1746 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1749 cgen = self->source->expression.codegen;
1750 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1753 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1756 ir_call_param(call, iridx);
1757 ir_call_param(call, right);
1758 self->expression.outr = right;
1764 cgen = self->dest->expression.codegen;
1766 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1768 self->expression.outl = left;
1770 cgen = self->source->expression.codegen;
1772 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1775 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1777 self->expression.outr = right;
1780 /* Theoretically, an assinment returns its left side as an
1781 * lvalue, if we don't need an lvalue though, we return
1782 * the right side as an rvalue, otherwise we have to
1783 * somehow know whether or not we need to dereference the pointer
1784 * on the left side - that is: OP_LOAD if it was an address.
1785 * Also: in original QC we cannot OP_LOADP *anyway*.
1787 *out = (lvalue ? left : right);
1792 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1794 ast_expression_codegen *cgen;
1795 ir_value *left, *right;
1797 /* A binary operation cannot yield an l-value */
1799 compile_error(ast_ctx(self), "not an l-value (binop)");
1803 if (self->expression.outr) {
1804 *out = self->expression.outr;
1808 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1809 (self->op == INSTR_AND || self->op == INSTR_OR))
1811 /* short circuit evaluation */
1812 ir_block *other, *merge;
1813 ir_block *from_left, *from_right;
1817 /* prepare end-block */
1818 merge_id = vec_size(func->ir_func->blocks);
1819 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1821 /* generate the left expression */
1822 cgen = self->left->expression.codegen;
1823 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1825 /* remember the block */
1826 from_left = func->curblock;
1828 /* create a new block for the right expression */
1829 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1830 if (self->op == INSTR_AND) {
1831 /* on AND: left==true -> other */
1832 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1835 /* on OR: left==false -> other */
1836 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1839 /* use the likely flag */
1840 vec_last(func->curblock->instr)->likely = true;
1842 /* enter the right-expression's block */
1843 func->curblock = other;
1845 cgen = self->right->expression.codegen;
1846 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1848 /* remember block */
1849 from_right = func->curblock;
1851 /* jump to the merge block */
1852 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1855 vec_remove(func->ir_func->blocks, merge_id, 1);
1856 vec_push(func->ir_func->blocks, merge);
1858 func->curblock = merge;
1859 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1860 ast_function_label(func, "sce_value"),
1861 self->expression.vtype);
1862 ir_phi_add(phi, from_left, left);
1863 ir_phi_add(phi, from_right, right);
1864 *out = ir_phi_value(phi);
1868 if (!OPTS_FLAG(PERL_LOGIC)) {
1870 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1871 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1872 ast_function_label(func, "sce_bool_v"),
1876 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1877 ast_function_label(func, "sce_bool"),
1882 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
1883 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1884 ast_function_label(func, "sce_bool_s"),
1888 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1889 ast_function_label(func, "sce_bool"),
1895 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
1896 ast_function_label(func, "sce_bool"),
1897 INSTR_AND, *out, *out);
1903 self->expression.outr = *out;
1904 codegen_output_type(self, *out);
1908 cgen = self->left->expression.codegen;
1909 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1912 cgen = self->right->expression.codegen;
1913 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1916 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1917 self->op, left, right);
1920 self->expression.outr = *out;
1921 codegen_output_type(self, *out);
1926 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1928 ast_expression_codegen *cgen;
1929 ir_value *leftl = NULL, *leftr, *right, *bin;
1933 ast_array_index *ai = NULL;
1934 ir_value *iridx = NULL;
1936 if (lvalue && self->expression.outl) {
1937 *out = self->expression.outl;
1941 if (!lvalue && self->expression.outr) {
1942 *out = self->expression.outr;
1946 if (ast_istype(self->dest, ast_array_index))
1949 ai = (ast_array_index*)self->dest;
1950 idx = (ast_value*)ai->index;
1952 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1956 /* for a binstore we need both an lvalue and an rvalue for the left side */
1957 /* rvalue of destination! */
1959 cgen = idx->expression.codegen;
1960 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1963 cgen = self->dest->expression.codegen;
1964 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1967 /* source as rvalue only */
1968 cgen = self->source->expression.codegen;
1969 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1972 /* now the binary */
1973 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1974 self->opbin, leftr, right);
1975 self->expression.outr = bin;
1979 /* we need to call the setter */
1984 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1988 arr = (ast_value*)ai->array;
1989 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1990 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1994 cgen = arr->setter->expression.codegen;
1995 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1998 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2001 ir_call_param(call, iridx);
2002 ir_call_param(call, bin);
2003 self->expression.outr = bin;
2005 /* now store them */
2006 cgen = self->dest->expression.codegen;
2007 /* lvalue of destination */
2008 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2010 self->expression.outl = leftl;
2012 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2014 self->expression.outr = bin;
2017 /* Theoretically, an assinment returns its left side as an
2018 * lvalue, if we don't need an lvalue though, we return
2019 * the right side as an rvalue, otherwise we have to
2020 * somehow know whether or not we need to dereference the pointer
2021 * on the left side - that is: OP_LOAD if it was an address.
2022 * Also: in original QC we cannot OP_LOADP *anyway*.
2024 *out = (lvalue ? leftl : bin);
2029 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2031 ast_expression_codegen *cgen;
2034 /* An unary operation cannot yield an l-value */
2036 compile_error(ast_ctx(self), "not an l-value (binop)");
2040 if (self->expression.outr) {
2041 *out = self->expression.outr;
2045 cgen = self->operand->expression.codegen;
2047 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2050 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2054 self->expression.outr = *out;
2059 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2061 ast_expression_codegen *cgen;
2066 /* In the context of a return operation, we don't actually return
2070 compile_error(ast_ctx(self), "return-expression is not an l-value");
2074 if (self->expression.outr) {
2075 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2078 self->expression.outr = (ir_value*)1;
2080 if (self->operand) {
2081 cgen = self->operand->expression.codegen;
2083 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2086 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2089 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2096 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2098 ast_expression_codegen *cgen;
2099 ir_value *ent, *field;
2101 /* This function needs to take the 'lvalue' flag into account!
2102 * As lvalue we provide a field-pointer, as rvalue we provide the
2106 if (lvalue && self->expression.outl) {
2107 *out = self->expression.outl;
2111 if (!lvalue && self->expression.outr) {
2112 *out = self->expression.outr;
2116 cgen = self->entity->expression.codegen;
2117 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2120 cgen = self->field->expression.codegen;
2121 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2126 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2129 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2130 ent, field, self->expression.vtype);
2131 /* Done AFTER error checking:
2132 codegen_output_type(self, *out);
2136 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2137 (lvalue ? "ADDRESS" : "FIELD"),
2138 type_name[self->expression.vtype]);
2142 codegen_output_type(self, *out);
2145 self->expression.outl = *out;
2147 self->expression.outr = *out;
2149 /* Hm that should be it... */
2153 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2155 ast_expression_codegen *cgen;
2158 /* in QC this is always an lvalue */
2159 if (lvalue && self->rvalue) {
2160 compile_error(ast_ctx(self), "not an l-value (member access)");
2163 if (self->expression.outl) {
2164 *out = self->expression.outl;
2168 cgen = self->owner->expression.codegen;
2169 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2172 if (vec->vtype != TYPE_VECTOR &&
2173 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2178 *out = ir_value_vector_member(vec, self->field);
2179 self->expression.outl = *out;
2181 return (*out != NULL);
2184 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2189 if (!lvalue && self->expression.outr) {
2190 *out = self->expression.outr;
2193 if (lvalue && self->expression.outl) {
2194 *out = self->expression.outl;
2198 if (!ast_istype(self->array, ast_value)) {
2199 compile_error(ast_ctx(self), "array indexing this way is not supported");
2200 /* note this would actually be pointer indexing because the left side is
2201 * not an actual array but (hopefully) an indexable expression.
2202 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2203 * support this path will be filled.
2208 arr = (ast_value*)self->array;
2209 idx = (ast_value*)self->index;
2211 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2212 /* Time to use accessor functions */
2213 ast_expression_codegen *cgen;
2214 ir_value *iridx, *funval;
2218 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2223 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2227 cgen = self->index->expression.codegen;
2228 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2231 cgen = arr->getter->expression.codegen;
2232 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2235 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2238 ir_call_param(call, iridx);
2240 *out = ir_call_value(call);
2241 self->expression.outr = *out;
2242 (*out)->vtype = self->expression.vtype;
2243 codegen_output_type(self, *out);
2247 if (idx->expression.vtype == TYPE_FLOAT) {
2248 unsigned int arridx = idx->constval.vfloat;
2249 if (arridx >= self->array->expression.count)
2251 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2254 *out = arr->ir_values[arridx];
2256 else if (idx->expression.vtype == TYPE_INTEGER) {
2257 unsigned int arridx = idx->constval.vint;
2258 if (arridx >= self->array->expression.count)
2260 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2263 *out = arr->ir_values[arridx];
2266 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2269 (*out)->vtype = self->expression.vtype;
2270 codegen_output_type(self, *out);
2274 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2276 ast_expression_codegen *cgen;
2284 ir_block *ontrue_endblock = NULL;
2285 ir_block *onfalse_endblock = NULL;
2286 ir_block *merge = NULL;
2288 /* We don't output any value, thus also don't care about r/lvalue */
2292 if (self->expression.outr) {
2293 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2296 self->expression.outr = (ir_value*)1;
2298 /* generate the condition */
2299 cgen = self->cond->expression.codegen;
2300 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2302 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2303 cond = func->curblock;
2307 if (self->on_true) {
2308 /* create on-true block */
2309 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2313 /* enter the block */
2314 func->curblock = ontrue;
2317 cgen = self->on_true->expression.codegen;
2318 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2321 /* we now need to work from the current endpoint */
2322 ontrue_endblock = func->curblock;
2327 if (self->on_false) {
2328 /* create on-false block */
2329 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2333 /* enter the block */
2334 func->curblock = onfalse;
2337 cgen = self->on_false->expression.codegen;
2338 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2341 /* we now need to work from the current endpoint */
2342 onfalse_endblock = func->curblock;
2346 /* Merge block were they all merge in to */
2347 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2349 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2352 /* add jumps ot the merge block */
2353 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2355 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2358 /* Now enter the merge block */
2359 func->curblock = merge;
2362 /* we create the if here, that way all blocks are ordered :)
2364 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2365 (ontrue ? ontrue : merge),
2366 (onfalse ? onfalse : merge)))
2374 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2376 ast_expression_codegen *cgen;
2379 ir_value *trueval, *falseval;
2382 ir_block *cond = func->curblock;
2383 ir_block *cond_out = NULL;
2384 ir_block *ontrue, *ontrue_out = NULL;
2385 ir_block *onfalse, *onfalse_out = NULL;
2388 /* Ternary can never create an lvalue... */
2392 /* In theory it shouldn't be possible to pass through a node twice, but
2393 * in case we add any kind of optimization pass for the AST itself, it
2394 * may still happen, thus we remember a created ir_value and simply return one
2395 * if it already exists.
2397 if (self->expression.outr) {
2398 *out = self->expression.outr;
2402 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2404 /* generate the condition */
2405 func->curblock = cond;
2406 cgen = self->cond->expression.codegen;
2407 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2409 cond_out = func->curblock;
2411 /* create on-true block */
2412 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2417 /* enter the block */
2418 func->curblock = ontrue;
2421 cgen = self->on_true->expression.codegen;
2422 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2425 ontrue_out = func->curblock;
2428 /* create on-false block */
2429 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2434 /* enter the block */
2435 func->curblock = onfalse;
2438 cgen = self->on_false->expression.codegen;
2439 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2442 onfalse_out = func->curblock;
2445 /* create merge block */
2446 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2449 /* jump to merge block */
2450 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2452 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2455 /* create if instruction */
2456 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2459 /* Now enter the merge block */
2460 func->curblock = merge;
2462 /* Here, now, we need a PHI node
2463 * but first some sanity checking...
2465 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2466 /* error("ternary with different types on the two sides"); */
2467 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2472 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2474 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2477 ir_phi_add(phi, ontrue_out, trueval);
2478 ir_phi_add(phi, onfalse_out, falseval);
2480 self->expression.outr = ir_phi_value(phi);
2481 *out = self->expression.outr;
2483 codegen_output_type(self, *out);
2488 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2490 ast_expression_codegen *cgen;
2492 ir_value *dummy = NULL;
2493 ir_value *precond = NULL;
2494 ir_value *postcond = NULL;
2496 /* Since we insert some jumps "late" so we have blocks
2497 * ordered "nicely", we need to keep track of the actual end-blocks
2498 * of expressions to add the jumps to.
2500 ir_block *bbody = NULL, *end_bbody = NULL;
2501 ir_block *bprecond = NULL, *end_bprecond = NULL;
2502 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2503 ir_block *bincrement = NULL, *end_bincrement = NULL;
2504 ir_block *bout = NULL, *bin = NULL;
2506 /* let's at least move the outgoing block to the end */
2509 /* 'break' and 'continue' need to be able to find the right blocks */
2510 ir_block *bcontinue = NULL;
2511 ir_block *bbreak = NULL;
2513 ir_block *tmpblock = NULL;
2518 if (self->expression.outr) {
2519 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2522 self->expression.outr = (ir_value*)1;
2525 * Should we ever need some kind of block ordering, better make this function
2526 * move blocks around than write a block ordering algorithm later... after all
2527 * the ast and ir should work together, not against each other.
2530 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2531 * anyway if for example it contains a ternary.
2535 cgen = self->initexpr->expression.codegen;
2536 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2540 /* Store the block from which we enter this chaos */
2541 bin = func->curblock;
2543 /* The pre-loop condition needs its own block since we
2544 * need to be able to jump to the start of that expression.
2548 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2552 /* the pre-loop-condition the least important place to 'continue' at */
2553 bcontinue = bprecond;
2556 func->curblock = bprecond;
2559 cgen = self->precond->expression.codegen;
2560 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2563 end_bprecond = func->curblock;
2565 bprecond = end_bprecond = NULL;
2568 /* Now the next blocks won't be ordered nicely, but we need to
2569 * generate them this early for 'break' and 'continue'.
2571 if (self->increment) {
2572 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2575 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2577 bincrement = end_bincrement = NULL;
2580 if (self->postcond) {
2581 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2584 bcontinue = bpostcond; /* postcond comes before the increment */
2586 bpostcond = end_bpostcond = NULL;
2589 bout_id = vec_size(func->ir_func->blocks);
2590 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2595 /* The loop body... */
2596 /* if (self->body) */
2598 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2603 func->curblock = bbody;
2605 vec_push(func->breakblocks, bbreak);
2607 vec_push(func->continueblocks, bcontinue);
2609 vec_push(func->continueblocks, bbody);
2613 cgen = self->body->expression.codegen;
2614 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2618 end_bbody = func->curblock;
2619 vec_pop(func->breakblocks);
2620 vec_pop(func->continueblocks);
2623 /* post-loop-condition */
2627 func->curblock = bpostcond;
2630 cgen = self->postcond->expression.codegen;
2631 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2634 end_bpostcond = func->curblock;
2637 /* The incrementor */
2638 if (self->increment)
2641 func->curblock = bincrement;
2644 cgen = self->increment->expression.codegen;
2645 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2648 end_bincrement = func->curblock;
2651 /* In any case now, we continue from the outgoing block */
2652 func->curblock = bout;
2654 /* Now all blocks are in place */
2655 /* From 'bin' we jump to whatever comes first */
2656 if (bprecond) tmpblock = bprecond;
2657 else if (bbody) tmpblock = bbody;
2658 else if (bpostcond) tmpblock = bpostcond;
2659 else tmpblock = bout;
2660 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2666 ir_block *ontrue, *onfalse;
2667 if (bbody) ontrue = bbody;
2668 else if (bincrement) ontrue = bincrement;
2669 else if (bpostcond) ontrue = bpostcond;
2670 else ontrue = bprecond;
2672 if (self->pre_not) {
2677 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2684 if (bincrement) tmpblock = bincrement;
2685 else if (bpostcond) tmpblock = bpostcond;
2686 else if (bprecond) tmpblock = bprecond;
2687 else tmpblock = bbody;
2688 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2692 /* from increment */
2695 if (bpostcond) tmpblock = bpostcond;
2696 else if (bprecond) tmpblock = bprecond;
2697 else if (bbody) tmpblock = bbody;
2698 else tmpblock = bout;
2699 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2706 ir_block *ontrue, *onfalse;
2707 if (bprecond) ontrue = bprecond;
2708 else if (bbody) ontrue = bbody;
2709 else if (bincrement) ontrue = bincrement;
2710 else ontrue = bpostcond;
2712 if (self->post_not) {
2717 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2721 /* Move 'bout' to the end */
2722 vec_remove(func->ir_func->blocks, bout_id, 1);
2723 vec_push(func->ir_func->blocks, bout);
2728 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2735 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2739 if (self->expression.outr) {
2740 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2743 self->expression.outr = (ir_value*)1;
2745 if (self->is_continue)
2746 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2748 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2751 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2755 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2760 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2762 ast_expression_codegen *cgen;
2764 ast_switch_case *def_case = NULL;
2765 ir_block *def_bfall = NULL;
2766 ir_block *def_bfall_to = NULL;
2767 bool set_def_bfall_to = false;
2769 ir_value *dummy = NULL;
2770 ir_value *irop = NULL;
2771 ir_block *bout = NULL;
2772 ir_block *bfall = NULL;
2780 compile_error(ast_ctx(self), "switch expression is not an l-value");
2784 if (self->expression.outr) {
2785 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2788 self->expression.outr = (ir_value*)1;
2793 cgen = self->operand->expression.codegen;
2794 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2797 if (!vec_size(self->cases))
2800 cmpinstr = type_eq_instr[irop->vtype];
2801 if (cmpinstr >= VINSTR_END) {
2802 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2803 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2807 bout_id = vec_size(func->ir_func->blocks);
2808 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2812 /* setup the break block */
2813 vec_push(func->breakblocks, bout);
2815 /* Now create all cases */
2816 for (c = 0; c < vec_size(self->cases); ++c) {
2817 ir_value *cond, *val;
2818 ir_block *bcase, *bnot;
2821 ast_switch_case *swcase = &self->cases[c];
2823 if (swcase->value) {
2824 /* A regular case */
2825 /* generate the condition operand */
2826 cgen = swcase->value->expression.codegen;
2827 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2829 /* generate the condition */
2830 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2834 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2835 bnot_id = vec_size(func->ir_func->blocks);
2836 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2837 if (!bcase || !bnot)
2839 if (set_def_bfall_to) {
2840 set_def_bfall_to = false;
2841 def_bfall_to = bcase;
2843 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2846 /* Make the previous case-end fall through */
2847 if (bfall && !bfall->final) {
2848 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2852 /* enter the case */
2853 func->curblock = bcase;
2854 cgen = swcase->code->expression.codegen;
2855 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2858 /* remember this block to fall through from */
2859 bfall = func->curblock;
2861 /* enter the else and move it down */
2862 func->curblock = bnot;
2863 vec_remove(func->ir_func->blocks, bnot_id, 1);
2864 vec_push(func->ir_func->blocks, bnot);
2866 /* The default case */
2867 /* Remember where to fall through from: */
2870 /* remember which case it was */
2872 /* And the next case will be remembered */
2873 set_def_bfall_to = true;
2877 /* Jump from the last bnot to bout */
2878 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2880 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2885 /* If there was a default case, put it down here */
2889 /* No need to create an extra block */
2890 bcase = func->curblock;
2892 /* Insert the fallthrough jump */
2893 if (def_bfall && !def_bfall->final) {
2894 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2898 /* Now generate the default code */
2899 cgen = def_case->code->expression.codegen;
2900 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2903 /* see if we need to fall through */
2904 if (def_bfall_to && !func->curblock->final)
2906 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2911 /* Jump from the last bnot to bout */
2912 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2914 /* enter the outgoing block */
2915 func->curblock = bout;
2917 /* restore the break block */
2918 vec_pop(func->breakblocks);
2920 /* Move 'bout' to the end, it's nicer */
2921 vec_remove(func->ir_func->blocks, bout_id, 1);
2922 vec_push(func->ir_func->blocks, bout);
2927 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2932 if (self->undefined) {
2933 compile_error(ast_ctx(self), "internal error: ast_label never defined");
2939 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2943 /* simply create a new block and jump to it */
2944 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2945 if (!self->irblock) {
2946 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2949 if (!func->curblock->final) {
2950 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2954 /* enter the new block */
2955 func->curblock = self->irblock;
2957 /* Generate all the leftover gotos */
2958 for (i = 0; i < vec_size(self->gotos); ++i) {
2959 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2966 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2970 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2974 if (self->target->irblock) {
2975 if (self->irblock_from) {
2976 /* we already tried once, this is the callback */
2977 self->irblock_from->final = false;
2978 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2979 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2985 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
2986 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2993 /* the target has not yet been created...
2994 * close this block in a sneaky way:
2996 func->curblock->final = true;
2997 self->irblock_from = func->curblock;
2998 ast_label_register_goto(self->target, self);
3004 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3006 ast_expression_codegen *cgen;
3008 ir_instr *callinstr;
3011 ir_value *funval = NULL;
3013 /* return values are never lvalues */
3015 compile_error(ast_ctx(self), "not an l-value (function call)");
3019 if (self->expression.outr) {
3020 *out = self->expression.outr;
3024 cgen = self->func->expression.codegen;
3025 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3033 for (i = 0; i < vec_size(self->params); ++i)
3036 ast_expression *expr = self->params[i];
3038 cgen = expr->expression.codegen;
3039 if (!(*cgen)(expr, func, false, ¶m))
3043 vec_push(params, param);
3046 /* varargs counter */
3047 if (self->va_count) {
3049 ir_builder *builder = func->curblock->owner->owner;
3050 cgen = self->va_count->expression.codegen;
3051 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3053 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3054 ir_builder_get_va_count(builder), va_count))
3060 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3061 ast_function_label(func, "call"),
3062 funval, !!(self->func->expression.flags & AST_FLAG_NORETURN));
3066 for (i = 0; i < vec_size(params); ++i) {
3067 ir_call_param(callinstr, params[i]);
3070 *out = ir_call_value(callinstr);
3071 self->expression.outr = *out;
3073 codegen_output_type(self, *out);