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
30 #define ast_instantiate(T, ctx, destroyfn) \
31 T* self = (T*)mem_a(sizeof(T)); \
35 ast_node_init((ast_node*)self, ctx, TYPE_##T); \
36 ( (ast_node*)self )->destroy = (ast_node_delete*)destroyfn
39 * forward declarations, these need not be in ast.h for obvious
42 static bool ast_member_codegen(ast_member*, ast_function*, bool lvalue, ir_value**);
43 static void ast_array_index_delete(ast_array_index*);
44 static bool ast_array_index_codegen(ast_array_index*, ast_function*, bool lvalue, ir_value**);
45 static void ast_store_delete(ast_store*);
46 static bool ast_store_codegen(ast_store*, ast_function*, bool lvalue, ir_value**);
47 static void ast_ifthen_delete(ast_ifthen*);
48 static bool ast_ifthen_codegen(ast_ifthen*, ast_function*, bool lvalue, ir_value**);
49 static void ast_ternary_delete(ast_ternary*);
50 static bool ast_ternary_codegen(ast_ternary*, ast_function*, bool lvalue, ir_value**);
51 static void ast_loop_delete(ast_loop*);
52 static bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**);
53 static void ast_breakcont_delete(ast_breakcont*);
54 static bool ast_breakcont_codegen(ast_breakcont*, ast_function*, bool lvalue, ir_value**);
55 static void ast_switch_delete(ast_switch*);
56 static bool ast_switch_codegen(ast_switch*, ast_function*, bool lvalue, ir_value**);
57 static void ast_label_delete(ast_label*);
58 static void ast_label_register_goto(ast_label*, ast_goto*);
59 static bool ast_label_codegen(ast_label*, ast_function*, bool lvalue, ir_value**);
60 static bool ast_goto_codegen(ast_goto*, ast_function*, bool lvalue, ir_value**);
61 static void ast_goto_delete(ast_goto*);
62 static void ast_call_delete(ast_call*);
63 static bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**);
64 static bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**);
65 static void ast_unary_delete(ast_unary*);
66 static bool ast_unary_codegen(ast_unary*, ast_function*, bool lvalue, ir_value**);
67 static void ast_entfield_delete(ast_entfield*);
68 static bool ast_entfield_codegen(ast_entfield*, ast_function*, bool lvalue, ir_value**);
69 static void ast_return_delete(ast_return*);
70 static bool ast_return_codegen(ast_return*, ast_function*, bool lvalue, ir_value**);
71 static void ast_binstore_delete(ast_binstore*);
72 static bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**);
73 static void ast_binary_delete(ast_binary*);
74 static bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**);
76 /* It must not be possible to get here. */
77 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
80 con_err("ast node missing destroy()\n");
84 /* Initialize main ast node aprts */
85 static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
88 self->destroy = &_ast_node_destroy;
90 self->nodetype = nodetype;
91 self->side_effects = false;
94 /* weight and side effects */
95 static void _ast_propagate_effects(ast_node *self, ast_node *other)
97 if (ast_side_effects(other))
98 ast_side_effects(self) = true;
100 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
102 /* General expression initialization */
103 static void ast_expression_init(ast_expression *self,
104 ast_expression_codegen *codegen)
106 self->codegen = codegen;
107 self->vtype = TYPE_VOID;
114 self->varparam = NULL;
117 static void ast_expression_delete(ast_expression *self)
121 ast_delete(self->next);
122 for (i = 0; i < vec_size(self->params); ++i) {
123 ast_delete(self->params[i]);
125 vec_free(self->params);
127 ast_delete(self->varparam);
130 static void ast_expression_delete_full(ast_expression *self)
132 ast_expression_delete(self);
136 ast_value* ast_value_copy(const ast_value *self)
139 const ast_expression *fromex;
140 ast_expression *selfex;
141 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
142 if (self->expression.next) {
143 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
145 fromex = &self->expression;
146 selfex = &cp->expression;
147 selfex->count = fromex->count;
148 selfex->flags = fromex->flags;
149 for (i = 0; i < vec_size(fromex->params); ++i) {
150 ast_value *v = ast_value_copy(fromex->params[i]);
151 vec_push(selfex->params, v);
156 void ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
159 const ast_expression *fromex;
160 ast_expression *selfex;
161 self->vtype = other->vtype;
163 self->next = (ast_expression*)ast_type_copy(ast_ctx(self), other->next);
167 selfex->count = fromex->count;
168 selfex->flags = fromex->flags;
169 for (i = 0; i < vec_size(fromex->params); ++i) {
170 ast_value *v = ast_value_copy(fromex->params[i]);
171 vec_push(selfex->params, v);
175 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
177 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
178 ast_expression_init(self, NULL);
179 self->codegen = NULL;
185 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
188 const ast_expression *fromex;
189 ast_expression *selfex;
195 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
196 ast_expression_init(self, NULL);
201 /* This may never be codegen()d */
202 selfex->codegen = NULL;
204 selfex->vtype = fromex->vtype;
206 selfex->next = ast_type_copy(ctx, fromex->next);
210 selfex->count = fromex->count;
211 selfex->flags = fromex->flags;
212 for (i = 0; i < vec_size(fromex->params); ++i) {
213 ast_value *v = ast_value_copy(fromex->params[i]);
214 vec_push(selfex->params, v);
221 bool ast_compare_type(ast_expression *a, ast_expression *b)
223 if (a->vtype == TYPE_NIL ||
224 b->vtype == TYPE_NIL)
226 if (a->vtype != b->vtype)
228 if (!a->next != !b->next)
230 if (vec_size(a->params) != vec_size(b->params))
232 if ((a->flags & AST_FLAG_TYPE_MASK) !=
233 (b->flags & AST_FLAG_TYPE_MASK) )
237 if (vec_size(a->params)) {
239 for (i = 0; i < vec_size(a->params); ++i) {
240 if (!ast_compare_type((ast_expression*)a->params[i],
241 (ast_expression*)b->params[i]))
246 return ast_compare_type(a->next, b->next);
250 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
257 if (pos + 6 >= bufsize)
259 util_strncpy(buf + pos, "(null)", 6);
263 if (pos + 1 >= bufsize)
268 util_strncpy(buf + pos, "(variant)", 9);
273 return ast_type_to_string_impl(e->next, buf, bufsize, pos);
276 if (pos + 3 >= bufsize)
280 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
281 if (pos + 1 >= bufsize)
287 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
288 if (pos + 2 >= bufsize)
290 if (!vec_size(e->params)) {
296 pos = ast_type_to_string_impl((ast_expression*)(e->params[0]), buf, bufsize, pos);
297 for (i = 1; i < vec_size(e->params); ++i) {
298 if (pos + 2 >= bufsize)
302 pos = ast_type_to_string_impl((ast_expression*)(e->params[i]), buf, bufsize, pos);
304 if (pos + 1 >= bufsize)
310 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
311 if (pos + 1 >= bufsize)
314 pos += util_snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->count);
315 if (pos + 1 >= bufsize)
321 typestr = type_name[e->vtype];
322 typelen = strlen(typestr);
323 if (pos + typelen >= bufsize)
325 util_strncpy(buf + pos, typestr, typelen);
326 return pos + typelen;
330 buf[bufsize-3] = '.';
331 buf[bufsize-2] = '.';
332 buf[bufsize-1] = '.';
336 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
338 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
342 static bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out);
343 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
345 ast_instantiate(ast_value, ctx, ast_value_delete);
346 ast_expression_init((ast_expression*)self,
347 (ast_expression_codegen*)&ast_value_codegen);
348 self->expression.node.keep = true; /* keep */
350 self->name = name ? util_strdup(name) : NULL;
351 self->expression.vtype = t;
352 self->expression.next = NULL;
353 self->isfield = false;
355 self->hasvalue = false;
358 memset(&self->constval, 0, sizeof(self->constval));
359 self->initlist = NULL;
362 self->ir_values = NULL;
363 self->ir_value_count = 0;
369 self->argcounter = NULL;
374 void ast_value_delete(ast_value* self)
377 mem_d((void*)self->name);
378 if (self->argcounter)
379 mem_d((void*)self->argcounter);
380 if (self->hasvalue) {
381 switch (self->expression.vtype)
384 mem_d((void*)self->constval.vstring);
387 /* unlink us from the function node */
388 self->constval.vfunc->vtype = NULL;
390 /* NOTE: delete function? currently collected in
391 * the parser structure
398 mem_d(self->ir_values);
403 if (self->initlist) {
404 if (self->expression.next->vtype == TYPE_STRING) {
405 /* strings are allocated, free them */
406 size_t i, len = vec_size(self->initlist);
407 /* in theory, len should be expression.count
408 * but let's not take any chances */
409 for (i = 0; i < len; ++i) {
410 if (self->initlist[i].vstring)
411 mem_d(self->initlist[i].vstring);
414 vec_free(self->initlist);
417 ast_expression_delete((ast_expression*)self);
421 void ast_value_params_add(ast_value *self, ast_value *p)
423 vec_push(self->expression.params, p);
426 bool ast_value_set_name(ast_value *self, const char *name)
429 mem_d((void*)self->name);
430 self->name = util_strdup(name);
434 ast_binary* ast_binary_new(lex_ctx ctx, int op,
435 ast_expression* left, ast_expression* right)
437 ast_instantiate(ast_binary, ctx, ast_binary_delete);
438 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
444 ast_propagate_effects(self, left);
445 ast_propagate_effects(self, right);
447 if (op >= INSTR_EQ_F && op <= INSTR_GT)
448 self->expression.vtype = TYPE_FLOAT;
449 else if (op == INSTR_AND || op == INSTR_OR) {
450 if (OPTS_FLAG(PERL_LOGIC))
451 ast_type_adopt(self, right);
453 self->expression.vtype = TYPE_FLOAT;
455 else if (op == INSTR_BITAND || op == INSTR_BITOR)
456 self->expression.vtype = TYPE_FLOAT;
457 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
458 self->expression.vtype = TYPE_VECTOR;
459 else if (op == INSTR_MUL_V)
460 self->expression.vtype = TYPE_FLOAT;
462 self->expression.vtype = left->vtype;
465 self->refs = AST_REF_ALL;
470 void ast_binary_delete(ast_binary *self)
472 if (self->refs & AST_REF_LEFT) ast_unref(self->left);
473 if (self->refs & AST_REF_RIGHT) ast_unref(self->right);
475 ast_expression_delete((ast_expression*)self);
479 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
480 ast_expression* left, ast_expression* right)
482 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
483 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
485 ast_side_effects(self) = true;
487 self->opstore = storop;
490 self->source = right;
492 self->keep_dest = false;
494 ast_type_adopt(self, left);
498 void ast_binstore_delete(ast_binstore *self)
500 if (!self->keep_dest)
501 ast_unref(self->dest);
502 ast_unref(self->source);
503 ast_expression_delete((ast_expression*)self);
507 ast_unary* ast_unary_new(lex_ctx ctx, int op,
508 ast_expression *expr)
510 ast_instantiate(ast_unary, ctx, ast_unary_delete);
511 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
514 self->operand = expr;
516 ast_propagate_effects(self, expr);
518 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
519 self->expression.vtype = TYPE_FLOAT;
521 compile_error(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
526 void ast_unary_delete(ast_unary *self)
528 if (self->operand) ast_unref(self->operand);
529 ast_expression_delete((ast_expression*)self);
533 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
535 ast_instantiate(ast_return, ctx, ast_return_delete);
536 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
538 self->operand = expr;
541 ast_propagate_effects(self, expr);
546 void ast_return_delete(ast_return *self)
549 ast_unref(self->operand);
550 ast_expression_delete((ast_expression*)self);
554 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
556 if (field->vtype != TYPE_FIELD) {
557 compile_error(ctx, "ast_entfield_new with expression not of type field");
560 return ast_entfield_new_force(ctx, entity, field, field->next);
563 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
565 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
569 /* Error: field has no type... */
573 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
575 self->entity = entity;
577 ast_propagate_effects(self, entity);
578 ast_propagate_effects(self, field);
580 ast_type_adopt(self, outtype);
584 void ast_entfield_delete(ast_entfield *self)
586 ast_unref(self->entity);
587 ast_unref(self->field);
588 ast_expression_delete((ast_expression*)self);
592 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field, const char *name)
594 ast_instantiate(ast_member, ctx, ast_member_delete);
600 if (owner->vtype != TYPE_VECTOR &&
601 owner->vtype != TYPE_FIELD) {
602 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->vtype]);
607 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
608 self->expression.node.keep = true; /* keep */
610 if (owner->vtype == TYPE_VECTOR) {
611 self->expression.vtype = TYPE_FLOAT;
612 self->expression.next = NULL;
614 self->expression.vtype = TYPE_FIELD;
615 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
618 self->rvalue = false;
620 ast_propagate_effects(self, owner);
624 self->name = util_strdup(name);
631 void ast_member_delete(ast_member *self)
633 /* The owner is always an ast_value, which has .keep=true,
634 * also: ast_members are usually deleted after the owner, thus
635 * this will cause invalid access
636 ast_unref(self->owner);
637 * once we allow (expression).x to access a vector-member, we need
638 * to change this: preferably by creating an alternate ast node for this
639 * purpose that is not garbage-collected.
641 ast_expression_delete((ast_expression*)self);
646 bool ast_member_set_name(ast_member *self, const char *name)
649 mem_d((void*)self->name);
650 self->name = util_strdup(name);
654 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
656 ast_expression *outtype;
657 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
659 outtype = array->next;
662 /* Error: field has no type... */
666 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
670 ast_propagate_effects(self, array);
671 ast_propagate_effects(self, index);
673 ast_type_adopt(self, outtype);
674 if (array->vtype == TYPE_FIELD && outtype->vtype == TYPE_ARRAY) {
675 if (self->expression.vtype != TYPE_ARRAY) {
676 compile_error(ast_ctx(self), "array_index node on type");
677 ast_array_index_delete(self);
680 self->array = outtype;
681 self->expression.vtype = TYPE_FIELD;
687 void ast_array_index_delete(ast_array_index *self)
690 ast_unref(self->array);
692 ast_unref(self->index);
693 ast_expression_delete((ast_expression*)self);
697 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
699 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
700 if (!ontrue && !onfalse) {
701 /* because it is invalid */
705 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
708 self->on_true = ontrue;
709 self->on_false = onfalse;
710 ast_propagate_effects(self, cond);
712 ast_propagate_effects(self, ontrue);
714 ast_propagate_effects(self, onfalse);
719 void ast_ifthen_delete(ast_ifthen *self)
721 ast_unref(self->cond);
723 ast_unref(self->on_true);
725 ast_unref(self->on_false);
726 ast_expression_delete((ast_expression*)self);
730 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
732 ast_expression *exprtype = ontrue;
733 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
734 /* This time NEITHER must be NULL */
735 if (!ontrue || !onfalse) {
739 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
742 self->on_true = ontrue;
743 self->on_false = onfalse;
744 ast_propagate_effects(self, cond);
745 ast_propagate_effects(self, ontrue);
746 ast_propagate_effects(self, onfalse);
748 if (ontrue->vtype == TYPE_NIL)
750 ast_type_adopt(self, exprtype);
755 void ast_ternary_delete(ast_ternary *self)
757 /* the if()s are only there because computed-gotos can set them
760 if (self->cond) ast_unref(self->cond);
761 if (self->on_true) ast_unref(self->on_true);
762 if (self->on_false) ast_unref(self->on_false);
763 ast_expression_delete((ast_expression*)self);
767 ast_loop* ast_loop_new(lex_ctx ctx,
768 ast_expression *initexpr,
769 ast_expression *precond, bool pre_not,
770 ast_expression *postcond, bool post_not,
771 ast_expression *increment,
772 ast_expression *body)
774 ast_instantiate(ast_loop, ctx, ast_loop_delete);
775 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
777 self->initexpr = initexpr;
778 self->precond = precond;
779 self->postcond = postcond;
780 self->increment = increment;
783 self->pre_not = pre_not;
784 self->post_not = post_not;
787 ast_propagate_effects(self, initexpr);
789 ast_propagate_effects(self, precond);
791 ast_propagate_effects(self, postcond);
793 ast_propagate_effects(self, increment);
795 ast_propagate_effects(self, body);
800 void ast_loop_delete(ast_loop *self)
803 ast_unref(self->initexpr);
805 ast_unref(self->precond);
807 ast_unref(self->postcond);
809 ast_unref(self->increment);
811 ast_unref(self->body);
812 ast_expression_delete((ast_expression*)self);
816 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont, unsigned int levels)
818 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
819 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
821 self->is_continue = iscont;
822 self->levels = levels;
827 void ast_breakcont_delete(ast_breakcont *self)
829 ast_expression_delete((ast_expression*)self);
833 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
835 ast_instantiate(ast_switch, ctx, ast_switch_delete);
836 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
841 ast_propagate_effects(self, op);
846 void ast_switch_delete(ast_switch *self)
849 ast_unref(self->operand);
851 for (i = 0; i < vec_size(self->cases); ++i) {
852 if (self->cases[i].value)
853 ast_unref(self->cases[i].value);
854 ast_unref(self->cases[i].code);
856 vec_free(self->cases);
858 ast_expression_delete((ast_expression*)self);
862 ast_label* ast_label_new(lex_ctx ctx, const char *name, bool undefined)
864 ast_instantiate(ast_label, ctx, ast_label_delete);
865 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
867 self->expression.vtype = TYPE_NOEXPR;
869 self->name = util_strdup(name);
870 self->irblock = NULL;
872 self->undefined = undefined;
877 void ast_label_delete(ast_label *self)
879 mem_d((void*)self->name);
880 vec_free(self->gotos);
881 ast_expression_delete((ast_expression*)self);
885 static void ast_label_register_goto(ast_label *self, ast_goto *g)
887 vec_push(self->gotos, g);
890 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
892 ast_instantiate(ast_goto, ctx, ast_goto_delete);
893 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
895 self->name = util_strdup(name);
897 self->irblock_from = NULL;
902 void ast_goto_delete(ast_goto *self)
904 mem_d((void*)self->name);
905 ast_expression_delete((ast_expression*)self);
909 void ast_goto_set_label(ast_goto *self, ast_label *label)
911 self->target = label;
914 ast_call* ast_call_new(lex_ctx ctx,
915 ast_expression *funcexpr)
917 ast_instantiate(ast_call, ctx, ast_call_delete);
918 if (!funcexpr->next) {
919 compile_error(ctx, "not a function");
923 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
925 ast_side_effects(self) = true;
928 self->func = funcexpr;
929 self->va_count = NULL;
931 ast_type_adopt(self, funcexpr->next);
936 void ast_call_delete(ast_call *self)
939 for (i = 0; i < vec_size(self->params); ++i)
940 ast_unref(self->params[i]);
941 vec_free(self->params);
944 ast_unref(self->func);
947 ast_unref(self->va_count);
949 ast_expression_delete((ast_expression*)self);
953 bool ast_call_check_types(ast_call *self)
959 const ast_expression *func = self->func;
960 size_t count = vec_size(self->params);
961 if (count > vec_size(func->params))
962 count = vec_size(func->params);
964 for (i = 0; i < count; ++i) {
965 if (!ast_compare_type(self->params[i], (ast_expression*)(func->params[i])))
967 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
968 ast_type_to_string((ast_expression*)func->params[i], texp, sizeof(texp));
969 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
970 (unsigned int)(i+1), texp, tgot);
971 /* we don't immediately return */
975 count = vec_size(self->params);
976 if (count > vec_size(func->params) && func->varparam) {
977 for (; i < count; ++i) {
978 if (!ast_compare_type(self->params[i], func->varparam))
980 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
981 ast_type_to_string(func->varparam, texp, sizeof(texp));
982 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
983 (unsigned int)(i+1), texp, tgot);
984 /* we don't immediately return */
992 ast_store* ast_store_new(lex_ctx ctx, int op,
993 ast_expression *dest, ast_expression *source)
995 ast_instantiate(ast_store, ctx, ast_store_delete);
996 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
998 ast_side_effects(self) = true;
1002 self->source = source;
1004 ast_type_adopt(self, dest);
1009 void ast_store_delete(ast_store *self)
1011 ast_unref(self->dest);
1012 ast_unref(self->source);
1013 ast_expression_delete((ast_expression*)self);
1017 ast_block* ast_block_new(lex_ctx ctx)
1019 ast_instantiate(ast_block, ctx, ast_block_delete);
1020 ast_expression_init((ast_expression*)self,
1021 (ast_expression_codegen*)&ast_block_codegen);
1023 self->locals = NULL;
1025 self->collect = NULL;
1030 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1032 ast_propagate_effects(self, e);
1033 vec_push(self->exprs, e);
1034 if (self->expression.next) {
1035 ast_delete(self->expression.next);
1036 self->expression.next = NULL;
1038 ast_type_adopt(self, e);
1042 void ast_block_collect(ast_block *self, ast_expression *expr)
1044 vec_push(self->collect, expr);
1045 expr->node.keep = true;
1048 void ast_block_delete(ast_block *self)
1051 for (i = 0; i < vec_size(self->exprs); ++i)
1052 ast_unref(self->exprs[i]);
1053 vec_free(self->exprs);
1054 for (i = 0; i < vec_size(self->locals); ++i)
1055 ast_delete(self->locals[i]);
1056 vec_free(self->locals);
1057 for (i = 0; i < vec_size(self->collect); ++i)
1058 ast_delete(self->collect[i]);
1059 vec_free(self->collect);
1060 ast_expression_delete((ast_expression*)self);
1064 void ast_block_set_type(ast_block *self, ast_expression *from)
1066 if (self->expression.next)
1067 ast_delete(self->expression.next);
1068 ast_type_adopt(self, from);
1071 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1073 ast_instantiate(ast_function, ctx, ast_function_delete);
1077 vtype->expression.vtype != TYPE_FUNCTION)
1079 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1081 (int)vtype->hasvalue,
1082 vtype->expression.vtype);
1087 self->vtype = vtype;
1088 self->name = name ? util_strdup(name) : NULL;
1089 self->blocks = NULL;
1091 self->labelcount = 0;
1094 self->ir_func = NULL;
1095 self->curblock = NULL;
1097 self->breakblocks = NULL;
1098 self->continueblocks = NULL;
1100 vtype->hasvalue = true;
1101 vtype->constval.vfunc = self;
1103 self->varargs = NULL;
1105 self->fixedparams = NULL;
1106 self->return_value = NULL;
1111 void ast_function_delete(ast_function *self)
1115 mem_d((void*)self->name);
1117 /* ast_value_delete(self->vtype); */
1118 self->vtype->hasvalue = false;
1119 self->vtype->constval.vfunc = NULL;
1120 /* We use unref - if it was stored in a global table it is supposed
1121 * to be deleted from *there*
1123 ast_unref(self->vtype);
1125 for (i = 0; i < vec_size(self->blocks); ++i)
1126 ast_delete(self->blocks[i]);
1127 vec_free(self->blocks);
1128 vec_free(self->breakblocks);
1129 vec_free(self->continueblocks);
1131 ast_delete(self->varargs);
1133 ast_delete(self->argc);
1134 if (self->fixedparams)
1135 ast_unref(self->fixedparams);
1136 if (self->return_value)
1137 ast_unref(self->return_value);
1141 static const char* ast_function_label(ast_function *self, const char *prefix)
1147 if (!OPTS_OPTION_BOOL(OPTION_DUMP) &&
1148 !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
1149 !OPTS_OPTION_BOOL(OPTION_DEBUG))
1154 id = (self->labelcount++);
1155 len = strlen(prefix);
1157 from = self->labelbuf + sizeof(self->labelbuf)-1;
1160 *from-- = (id%10) + '0';
1164 memcpy(from - len, prefix, len);
1168 /*********************************************************************/
1170 * by convention you must never pass NULL to the 'ir_value **out'
1171 * parameter. If you really don't care about the output, pass a dummy.
1172 * But I can't imagine a pituation where the output is truly unnecessary.
1175 static void _ast_codegen_output_type(ast_expression *self, ir_value *out)
1177 if (out->vtype == TYPE_FIELD)
1178 out->fieldtype = self->next->vtype;
1179 if (out->vtype == TYPE_FUNCTION)
1180 out->outtype = self->next->vtype;
1183 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1185 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1189 if (self->expression.vtype == TYPE_NIL) {
1190 *out = func->ir_func->owner->nil;
1193 /* NOTE: This is the codegen for a variable used in an expression.
1194 * It is not the codegen to generate the value. For this purpose,
1195 * ast_local_codegen and ast_global_codegen are to be used before this
1196 * is executed. ast_function_codegen should take care of its locals,
1197 * and the ast-user should take care of ast_global_codegen to be used
1198 * on all the globals.
1201 char tname[1024]; /* typename is reserved in C++ */
1202 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1203 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1210 static bool ast_global_array_set(ast_value *self)
1212 size_t count = vec_size(self->initlist);
1215 if (count > self->expression.count) {
1216 compile_error(ast_ctx(self), "too many elements in initializer");
1217 count = self->expression.count;
1219 else if (count < self->expression.count) {
1221 compile_warning(ast_ctx(self), "not all elements are initialized");
1225 for (i = 0; i != count; ++i) {
1226 switch (self->expression.next->vtype) {
1228 if (!ir_value_set_float(self->ir_values[i], self->initlist[i].vfloat))
1232 if (!ir_value_set_vector(self->ir_values[i], self->initlist[i].vvec))
1236 if (!ir_value_set_string(self->ir_values[i], self->initlist[i].vstring))
1240 /* we don't support them in any other place yet either */
1241 compile_error(ast_ctx(self), "TODO: nested arrays");
1244 /* this requiers a bit more work - similar to the fields I suppose */
1245 compile_error(ast_ctx(self), "global of type function not properly generated");
1248 if (!self->initlist[i].vfield) {
1249 compile_error(ast_ctx(self), "field constant without vfield set");
1252 if (!self->initlist[i].vfield->ir_v) {
1253 compile_error(ast_ctx(self), "field constant generated before its field");
1256 if (!ir_value_set_field(self->ir_values[i], self->initlist[i].vfield->ir_v))
1260 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1267 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1271 if (self->expression.vtype == TYPE_NIL) {
1272 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1276 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1278 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->vtype);
1281 func->context = ast_ctx(self);
1282 func->value->context = ast_ctx(self);
1284 self->constval.vfunc->ir_func = func;
1285 self->ir_v = func->value;
1286 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1287 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1288 /* The function is filled later on ast_function_codegen... */
1292 if (isfield && self->expression.vtype == TYPE_FIELD) {
1293 ast_expression *fieldtype = self->expression.next;
1295 if (self->hasvalue) {
1296 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1300 if (fieldtype->vtype == TYPE_ARRAY) {
1305 ast_expression *elemtype;
1307 ast_value *array = (ast_value*)fieldtype;
1309 if (!ast_istype(fieldtype, ast_value)) {
1310 compile_error(ast_ctx(self), "internal error: ast_value required");
1314 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1315 if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1316 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1318 elemtype = array->expression.next;
1319 vtype = elemtype->vtype;
1321 v = ir_builder_create_field(ir, self->name, vtype);
1323 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1326 v->context = ast_ctx(self);
1327 v->unique_life = true;
1329 array->ir_v = self->ir_v = v;
1330 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1331 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1333 namelen = strlen(self->name);
1334 name = (char*)mem_a(namelen + 16);
1335 util_strncpy(name, self->name, namelen);
1337 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1338 array->ir_values[0] = v;
1339 for (ai = 1; ai < array->expression.count; ++ai) {
1340 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1341 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1342 if (!array->ir_values[ai]) {
1344 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1347 array->ir_values[ai]->context = ast_ctx(self);
1348 array->ir_values[ai]->unique_life = true;
1349 array->ir_values[ai]->locked = true;
1350 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1351 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1357 v = ir_builder_create_field(ir, self->name, self->expression.next->vtype);
1360 v->context = ast_ctx(self);
1362 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1363 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1368 if (self->expression.vtype == TYPE_ARRAY) {
1373 ast_expression *elemtype = self->expression.next;
1374 int vtype = elemtype->vtype;
1376 if (self->expression.flags & AST_FLAG_ARRAY_INIT && !self->expression.count) {
1377 compile_error(ast_ctx(self), "array `%s' has no size", self->name);
1381 /* same as with field arrays */
1382 if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1383 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1385 v = ir_builder_create_global(ir, self->name, vtype);
1387 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1390 v->context = ast_ctx(self);
1391 v->unique_life = true;
1393 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1394 v->flags |= IR_FLAG_INCLUDE_DEF;
1396 namelen = strlen(self->name);
1397 name = (char*)mem_a(namelen + 16);
1398 util_strncpy(name, self->name, namelen);
1400 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1401 self->ir_values[0] = v;
1402 for (ai = 1; ai < self->expression.count; ++ai) {
1403 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1404 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1405 if (!self->ir_values[ai]) {
1407 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1410 self->ir_values[ai]->context = ast_ctx(self);
1411 self->ir_values[ai]->unique_life = true;
1412 self->ir_values[ai]->locked = true;
1413 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1414 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1420 /* Arrays don't do this since there's no "array" value which spans across the
1423 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1425 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1428 codegen_output_type(self, v);
1429 v->context = ast_ctx(self);
1432 /* link us to the ir_value */
1435 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1436 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1439 if (self->hasvalue) {
1440 switch (self->expression.vtype)
1443 if (!ir_value_set_float(v, self->constval.vfloat))
1447 if (!ir_value_set_vector(v, self->constval.vvec))
1451 if (!ir_value_set_string(v, self->constval.vstring))
1455 ast_global_array_set(self);
1458 compile_error(ast_ctx(self), "global of type function not properly generated");
1460 /* Cannot generate an IR value for a function,
1461 * need a pointer pointing to a function rather.
1464 if (!self->constval.vfield) {
1465 compile_error(ast_ctx(self), "field constant without vfield set");
1468 if (!self->constval.vfield->ir_v) {
1469 compile_error(ast_ctx(self), "field constant generated before its field");
1472 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1476 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1482 error: /* clean up */
1487 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1491 if (self->expression.vtype == TYPE_NIL) {
1492 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1496 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1498 /* Do we allow local functions? I think not...
1499 * this is NOT a function pointer atm.
1504 if (self->expression.vtype == TYPE_ARRAY) {
1509 ast_expression *elemtype = self->expression.next;
1510 int vtype = elemtype->vtype;
1512 func->flags |= IR_FLAG_HAS_ARRAYS;
1514 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1515 compile_error(ast_ctx(self), "array-parameters are not supported");
1519 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1520 if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1521 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1524 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1525 if (!self->ir_values) {
1526 compile_error(ast_ctx(self), "failed to allocate array values");
1530 v = ir_function_create_local(func, self->name, vtype, param);
1532 compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1535 v->context = ast_ctx(self);
1536 v->unique_life = true;
1539 namelen = strlen(self->name);
1540 name = (char*)mem_a(namelen + 16);
1541 util_strncpy(name, self->name, namelen);
1543 self->ir_values[0] = v;
1544 for (ai = 1; ai < self->expression.count; ++ai) {
1545 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1546 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1547 if (!self->ir_values[ai]) {
1548 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1551 self->ir_values[ai]->context = ast_ctx(self);
1552 self->ir_values[ai]->unique_life = true;
1553 self->ir_values[ai]->locked = true;
1559 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1562 codegen_output_type(self, v);
1563 v->context = ast_ctx(self);
1566 /* A constant local... hmmm...
1567 * I suppose the IR will have to deal with this
1569 if (self->hasvalue) {
1570 switch (self->expression.vtype)
1573 if (!ir_value_set_float(v, self->constval.vfloat))
1577 if (!ir_value_set_vector(v, self->constval.vvec))
1581 if (!ir_value_set_string(v, self->constval.vstring))
1585 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1590 /* link us to the ir_value */
1594 if (!ast_generate_accessors(self, func->owner))
1598 error: /* clean up */
1603 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1606 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1607 if (!self->setter || !self->getter)
1609 for (i = 0; i < self->expression.count; ++i) {
1610 if (!self->ir_values) {
1611 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1614 if (!self->ir_values[i]) {
1615 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1618 if (self->ir_values[i]->life) {
1619 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1624 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1626 if (!ast_global_codegen (self->setter, ir, false) ||
1627 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1628 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1630 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1631 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1636 if (!ast_global_codegen (self->getter, ir, false) ||
1637 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1638 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1640 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1641 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1645 for (i = 0; i < self->expression.count; ++i) {
1646 vec_free(self->ir_values[i]->life);
1648 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1652 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1657 ast_expression_codegen *cgen;
1662 irf = self->ir_func;
1664 compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1668 /* fill the parameter list */
1669 ec = &self->vtype->expression;
1670 for (i = 0; i < vec_size(ec->params); ++i)
1672 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1673 vec_push(irf->params, ec->params[i]->expression.next->vtype);
1675 vec_push(irf->params, ec->params[i]->expression.vtype);
1676 if (!self->builtin) {
1677 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1682 if (self->varargs) {
1683 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1685 irf->max_varargs = self->varargs->expression.count;
1688 if (self->builtin) {
1689 irf->builtin = self->builtin;
1693 /* have a local return value variable? */
1694 if (self->return_value) {
1695 if (!ast_local_codegen(self->return_value, self->ir_func, false))
1699 if (!vec_size(self->blocks)) {
1700 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1704 irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1705 if (!self->curblock) {
1706 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1714 if (!ast_local_codegen(self->argc, self->ir_func, true))
1716 cgen = self->argc->expression.codegen;
1717 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1719 cgen = self->fixedparams->expression.codegen;
1720 if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1722 sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1723 ast_function_label(self, "va_count"), INSTR_SUB_F,
1724 ir_builder_get_va_count(ir), fixed);
1727 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1734 for (i = 0; i < vec_size(self->blocks); ++i) {
1735 cgen = self->blocks[i]->expression.codegen;
1736 if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1740 /* TODO: check return types */
1741 if (!self->curblock->final)
1743 if (!self->vtype->expression.next ||
1744 self->vtype->expression.next->vtype == TYPE_VOID)
1746 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1748 else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1750 if (self->return_value) {
1751 cgen = self->return_value->expression.codegen;
1752 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1754 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1756 else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1757 "control reaches end of non-void function (`%s`) via %s",
1758 self->name, self->curblock->label))
1762 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1768 /* Note, you will not see ast_block_codegen generate ir_blocks.
1769 * To the AST and the IR, blocks are 2 different things.
1770 * In the AST it represents a block of code, usually enclosed in
1771 * curly braces {...}.
1772 * While in the IR it represents a block in terms of control-flow.
1774 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1778 /* We don't use this
1779 * Note: an ast-representation using the comma-operator
1780 * of the form: (a, b, c) = x should not assign to c...
1783 compile_error(ast_ctx(self), "not an l-value (code-block)");
1787 if (self->expression.outr) {
1788 *out = self->expression.outr;
1792 /* output is NULL at first, we'll have each expression
1793 * assign to out output, thus, a comma-operator represention
1794 * using an ast_block will return the last generated value,
1795 * so: (b, c) + a executed both b and c, and returns c,
1796 * which is then added to a.
1800 /* generate locals */
1801 for (i = 0; i < vec_size(self->locals); ++i)
1803 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1804 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1805 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1810 for (i = 0; i < vec_size(self->exprs); ++i)
1812 ast_expression_codegen *gen;
1813 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1814 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1818 gen = self->exprs[i]->codegen;
1819 if (!(*gen)(self->exprs[i], func, false, out))
1823 self->expression.outr = *out;
1828 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1830 ast_expression_codegen *cgen;
1831 ir_value *left = NULL;
1832 ir_value *right = NULL;
1836 ast_array_index *ai = NULL;
1838 if (lvalue && self->expression.outl) {
1839 *out = self->expression.outl;
1843 if (!lvalue && self->expression.outr) {
1844 *out = self->expression.outr;
1848 if (ast_istype(self->dest, ast_array_index))
1851 ai = (ast_array_index*)self->dest;
1852 idx = (ast_value*)ai->index;
1854 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1859 /* we need to call the setter */
1860 ir_value *iridx, *funval;
1864 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1868 arr = (ast_value*)ai->array;
1869 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1870 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1874 cgen = idx->expression.codegen;
1875 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1878 cgen = arr->setter->expression.codegen;
1879 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1882 cgen = self->source->codegen;
1883 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1886 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1889 ir_call_param(call, iridx);
1890 ir_call_param(call, right);
1891 self->expression.outr = right;
1897 cgen = self->dest->codegen;
1899 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1901 self->expression.outl = left;
1903 cgen = self->source->codegen;
1905 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1908 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1910 self->expression.outr = right;
1913 /* Theoretically, an assinment returns its left side as an
1914 * lvalue, if we don't need an lvalue though, we return
1915 * the right side as an rvalue, otherwise we have to
1916 * somehow know whether or not we need to dereference the pointer
1917 * on the left side - that is: OP_LOAD if it was an address.
1918 * Also: in original QC we cannot OP_LOADP *anyway*.
1920 *out = (lvalue ? left : right);
1925 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1927 ast_expression_codegen *cgen;
1928 ir_value *left, *right;
1930 /* A binary operation cannot yield an l-value */
1932 compile_error(ast_ctx(self), "not an l-value (binop)");
1936 if (self->expression.outr) {
1937 *out = self->expression.outr;
1941 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1942 (self->op == INSTR_AND || self->op == INSTR_OR))
1944 /* short circuit evaluation */
1945 ir_block *other, *merge;
1946 ir_block *from_left, *from_right;
1950 /* prepare end-block */
1951 merge_id = vec_size(func->ir_func->blocks);
1952 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1954 /* generate the left expression */
1955 cgen = self->left->codegen;
1956 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1958 /* remember the block */
1959 from_left = func->curblock;
1961 /* create a new block for the right expression */
1962 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1963 if (self->op == INSTR_AND) {
1964 /* on AND: left==true -> other */
1965 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1968 /* on OR: left==false -> other */
1969 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1972 /* use the likely flag */
1973 vec_last(func->curblock->instr)->likely = true;
1975 /* enter the right-expression's block */
1976 func->curblock = other;
1978 cgen = self->right->codegen;
1979 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1981 /* remember block */
1982 from_right = func->curblock;
1984 /* jump to the merge block */
1985 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1988 vec_remove(func->ir_func->blocks, merge_id, 1);
1989 vec_push(func->ir_func->blocks, merge);
1991 func->curblock = merge;
1992 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1993 ast_function_label(func, "sce_value"),
1994 self->expression.vtype);
1995 ir_phi_add(phi, from_left, left);
1996 ir_phi_add(phi, from_right, right);
1997 *out = ir_phi_value(phi);
2001 if (!OPTS_FLAG(PERL_LOGIC)) {
2003 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
2004 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2005 ast_function_label(func, "sce_bool_v"),
2009 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2010 ast_function_label(func, "sce_bool"),
2015 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
2016 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2017 ast_function_label(func, "sce_bool_s"),
2021 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2022 ast_function_label(func, "sce_bool"),
2028 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
2029 ast_function_label(func, "sce_bool"),
2030 INSTR_AND, *out, *out);
2036 self->expression.outr = *out;
2037 codegen_output_type(self, *out);
2041 cgen = self->left->codegen;
2042 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2045 cgen = self->right->codegen;
2046 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2049 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
2050 self->op, left, right);
2053 self->expression.outr = *out;
2054 codegen_output_type(self, *out);
2059 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
2061 ast_expression_codegen *cgen;
2062 ir_value *leftl = NULL, *leftr, *right, *bin;
2066 ast_array_index *ai = NULL;
2067 ir_value *iridx = NULL;
2069 if (lvalue && self->expression.outl) {
2070 *out = self->expression.outl;
2074 if (!lvalue && self->expression.outr) {
2075 *out = self->expression.outr;
2079 if (ast_istype(self->dest, ast_array_index))
2082 ai = (ast_array_index*)self->dest;
2083 idx = (ast_value*)ai->index;
2085 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2089 /* for a binstore we need both an lvalue and an rvalue for the left side */
2090 /* rvalue of destination! */
2092 cgen = idx->expression.codegen;
2093 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2096 cgen = self->dest->codegen;
2097 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2100 /* source as rvalue only */
2101 cgen = self->source->codegen;
2102 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2105 /* now the binary */
2106 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2107 self->opbin, leftr, right);
2108 self->expression.outr = bin;
2112 /* we need to call the setter */
2117 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2121 arr = (ast_value*)ai->array;
2122 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2123 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2127 cgen = arr->setter->expression.codegen;
2128 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2131 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2134 ir_call_param(call, iridx);
2135 ir_call_param(call, bin);
2136 self->expression.outr = bin;
2138 /* now store them */
2139 cgen = self->dest->codegen;
2140 /* lvalue of destination */
2141 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2143 self->expression.outl = leftl;
2145 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2147 self->expression.outr = bin;
2150 /* Theoretically, an assinment returns its left side as an
2151 * lvalue, if we don't need an lvalue though, we return
2152 * the right side as an rvalue, otherwise we have to
2153 * somehow know whether or not we need to dereference the pointer
2154 * on the left side - that is: OP_LOAD if it was an address.
2155 * Also: in original QC we cannot OP_LOADP *anyway*.
2157 *out = (lvalue ? leftl : bin);
2162 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2164 ast_expression_codegen *cgen;
2167 /* An unary operation cannot yield an l-value */
2169 compile_error(ast_ctx(self), "not an l-value (binop)");
2173 if (self->expression.outr) {
2174 *out = self->expression.outr;
2178 cgen = self->operand->codegen;
2180 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2183 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2187 self->expression.outr = *out;
2192 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2194 ast_expression_codegen *cgen;
2199 /* In the context of a return operation, we don't actually return
2203 compile_error(ast_ctx(self), "return-expression is not an l-value");
2207 if (self->expression.outr) {
2208 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2211 self->expression.outr = (ir_value*)1;
2213 if (self->operand) {
2214 cgen = self->operand->codegen;
2216 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2219 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2222 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2229 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2231 ast_expression_codegen *cgen;
2232 ir_value *ent, *field;
2234 /* This function needs to take the 'lvalue' flag into account!
2235 * As lvalue we provide a field-pointer, as rvalue we provide the
2239 if (lvalue && self->expression.outl) {
2240 *out = self->expression.outl;
2244 if (!lvalue && self->expression.outr) {
2245 *out = self->expression.outr;
2249 cgen = self->entity->codegen;
2250 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2253 cgen = self->field->codegen;
2254 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2259 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2262 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2263 ent, field, self->expression.vtype);
2264 /* Done AFTER error checking:
2265 codegen_output_type(self, *out);
2269 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2270 (lvalue ? "ADDRESS" : "FIELD"),
2271 type_name[self->expression.vtype]);
2275 codegen_output_type(self, *out);
2278 self->expression.outl = *out;
2280 self->expression.outr = *out;
2282 /* Hm that should be it... */
2286 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2288 ast_expression_codegen *cgen;
2291 /* in QC this is always an lvalue */
2292 if (lvalue && self->rvalue) {
2293 compile_error(ast_ctx(self), "not an l-value (member access)");
2296 if (self->expression.outl) {
2297 *out = self->expression.outl;
2301 cgen = self->owner->codegen;
2302 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2305 if (vec->vtype != TYPE_VECTOR &&
2306 !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2311 *out = ir_value_vector_member(vec, self->field);
2312 self->expression.outl = *out;
2314 return (*out != NULL);
2317 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2322 if (!lvalue && self->expression.outr) {
2323 *out = self->expression.outr;
2326 if (lvalue && self->expression.outl) {
2327 *out = self->expression.outl;
2331 if (!ast_istype(self->array, ast_value)) {
2332 compile_error(ast_ctx(self), "array indexing this way is not supported");
2333 /* note this would actually be pointer indexing because the left side is
2334 * not an actual array but (hopefully) an indexable expression.
2335 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2336 * support this path will be filled.
2341 arr = (ast_value*)self->array;
2342 idx = (ast_value*)self->index;
2344 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2345 /* Time to use accessor functions */
2346 ast_expression_codegen *cgen;
2347 ir_value *iridx, *funval;
2351 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2356 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2360 cgen = self->index->codegen;
2361 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2364 cgen = arr->getter->expression.codegen;
2365 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2368 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2371 ir_call_param(call, iridx);
2373 *out = ir_call_value(call);
2374 self->expression.outr = *out;
2375 (*out)->vtype = self->expression.vtype;
2376 codegen_output_type(self, *out);
2380 if (idx->expression.vtype == TYPE_FLOAT) {
2381 unsigned int arridx = idx->constval.vfloat;
2382 if (arridx >= self->array->count)
2384 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2387 *out = arr->ir_values[arridx];
2389 else if (idx->expression.vtype == TYPE_INTEGER) {
2390 unsigned int arridx = idx->constval.vint;
2391 if (arridx >= self->array->count)
2393 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2396 *out = arr->ir_values[arridx];
2399 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2402 (*out)->vtype = self->expression.vtype;
2403 codegen_output_type(self, *out);
2407 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2409 ast_expression_codegen *cgen;
2417 ir_block *ontrue_endblock = NULL;
2418 ir_block *onfalse_endblock = NULL;
2419 ir_block *merge = NULL;
2421 /* We don't output any value, thus also don't care about r/lvalue */
2425 if (self->expression.outr) {
2426 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2429 self->expression.outr = (ir_value*)1;
2431 /* generate the condition */
2432 cgen = self->cond->codegen;
2433 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2435 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2436 cond = func->curblock;
2440 if (self->on_true) {
2441 /* create on-true block */
2442 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2446 /* enter the block */
2447 func->curblock = ontrue;
2450 cgen = self->on_true->codegen;
2451 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2454 /* we now need to work from the current endpoint */
2455 ontrue_endblock = func->curblock;
2460 if (self->on_false) {
2461 /* create on-false block */
2462 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2466 /* enter the block */
2467 func->curblock = onfalse;
2470 cgen = self->on_false->codegen;
2471 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2474 /* we now need to work from the current endpoint */
2475 onfalse_endblock = func->curblock;
2479 /* Merge block were they all merge in to */
2480 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2482 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2485 /* add jumps ot the merge block */
2486 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2488 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2491 /* Now enter the merge block */
2492 func->curblock = merge;
2495 /* we create the if here, that way all blocks are ordered :)
2497 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2498 (ontrue ? ontrue : merge),
2499 (onfalse ? onfalse : merge)))
2507 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2509 ast_expression_codegen *cgen;
2512 ir_value *trueval, *falseval;
2515 ir_block *cond = func->curblock;
2516 ir_block *cond_out = NULL;
2517 ir_block *ontrue, *ontrue_out = NULL;
2518 ir_block *onfalse, *onfalse_out = NULL;
2521 /* Ternary can never create an lvalue... */
2525 /* In theory it shouldn't be possible to pass through a node twice, but
2526 * in case we add any kind of optimization pass for the AST itself, it
2527 * may still happen, thus we remember a created ir_value and simply return one
2528 * if it already exists.
2530 if (self->expression.outr) {
2531 *out = self->expression.outr;
2535 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2537 /* generate the condition */
2538 func->curblock = cond;
2539 cgen = self->cond->codegen;
2540 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2542 cond_out = func->curblock;
2544 /* create on-true block */
2545 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2550 /* enter the block */
2551 func->curblock = ontrue;
2554 cgen = self->on_true->codegen;
2555 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2558 ontrue_out = func->curblock;
2561 /* create on-false block */
2562 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2567 /* enter the block */
2568 func->curblock = onfalse;
2571 cgen = self->on_false->codegen;
2572 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2575 onfalse_out = func->curblock;
2578 /* create merge block */
2579 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2582 /* jump to merge block */
2583 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2585 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2588 /* create if instruction */
2589 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2592 /* Now enter the merge block */
2593 func->curblock = merge;
2595 /* Here, now, we need a PHI node
2596 * but first some sanity checking...
2598 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2599 /* error("ternary with different types on the two sides"); */
2600 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2605 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2607 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2610 ir_phi_add(phi, ontrue_out, trueval);
2611 ir_phi_add(phi, onfalse_out, falseval);
2613 self->expression.outr = ir_phi_value(phi);
2614 *out = self->expression.outr;
2616 codegen_output_type(self, *out);
2621 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2623 ast_expression_codegen *cgen;
2625 ir_value *dummy = NULL;
2626 ir_value *precond = NULL;
2627 ir_value *postcond = NULL;
2629 /* Since we insert some jumps "late" so we have blocks
2630 * ordered "nicely", we need to keep track of the actual end-blocks
2631 * of expressions to add the jumps to.
2633 ir_block *bbody = NULL, *end_bbody = NULL;
2634 ir_block *bprecond = NULL, *end_bprecond = NULL;
2635 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2636 ir_block *bincrement = NULL, *end_bincrement = NULL;
2637 ir_block *bout = NULL, *bin = NULL;
2639 /* let's at least move the outgoing block to the end */
2642 /* 'break' and 'continue' need to be able to find the right blocks */
2643 ir_block *bcontinue = NULL;
2644 ir_block *bbreak = NULL;
2646 ir_block *tmpblock = NULL;
2651 if (self->expression.outr) {
2652 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2655 self->expression.outr = (ir_value*)1;
2658 * Should we ever need some kind of block ordering, better make this function
2659 * move blocks around than write a block ordering algorithm later... after all
2660 * the ast and ir should work together, not against each other.
2663 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2664 * anyway if for example it contains a ternary.
2668 cgen = self->initexpr->codegen;
2669 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2673 /* Store the block from which we enter this chaos */
2674 bin = func->curblock;
2676 /* The pre-loop condition needs its own block since we
2677 * need to be able to jump to the start of that expression.
2681 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2685 /* the pre-loop-condition the least important place to 'continue' at */
2686 bcontinue = bprecond;
2689 func->curblock = bprecond;
2692 cgen = self->precond->codegen;
2693 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2696 end_bprecond = func->curblock;
2698 bprecond = end_bprecond = NULL;
2701 /* Now the next blocks won't be ordered nicely, but we need to
2702 * generate them this early for 'break' and 'continue'.
2704 if (self->increment) {
2705 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2708 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2710 bincrement = end_bincrement = NULL;
2713 if (self->postcond) {
2714 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2717 bcontinue = bpostcond; /* postcond comes before the increment */
2719 bpostcond = end_bpostcond = NULL;
2722 bout_id = vec_size(func->ir_func->blocks);
2723 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2728 /* The loop body... */
2729 /* if (self->body) */
2731 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2736 func->curblock = bbody;
2738 vec_push(func->breakblocks, bbreak);
2740 vec_push(func->continueblocks, bcontinue);
2742 vec_push(func->continueblocks, bbody);
2746 cgen = self->body->codegen;
2747 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2751 end_bbody = func->curblock;
2752 vec_pop(func->breakblocks);
2753 vec_pop(func->continueblocks);
2756 /* post-loop-condition */
2760 func->curblock = bpostcond;
2763 cgen = self->postcond->codegen;
2764 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2767 end_bpostcond = func->curblock;
2770 /* The incrementor */
2771 if (self->increment)
2774 func->curblock = bincrement;
2777 cgen = self->increment->codegen;
2778 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2781 end_bincrement = func->curblock;
2784 /* In any case now, we continue from the outgoing block */
2785 func->curblock = bout;
2787 /* Now all blocks are in place */
2788 /* From 'bin' we jump to whatever comes first */
2789 if (bprecond) tmpblock = bprecond;
2790 else if (bbody) tmpblock = bbody;
2791 else if (bpostcond) tmpblock = bpostcond;
2792 else tmpblock = bout;
2793 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2799 ir_block *ontrue, *onfalse;
2800 if (bbody) ontrue = bbody;
2801 else if (bincrement) ontrue = bincrement;
2802 else if (bpostcond) ontrue = bpostcond;
2803 else ontrue = bprecond;
2805 if (self->pre_not) {
2810 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2817 if (bincrement) tmpblock = bincrement;
2818 else if (bpostcond) tmpblock = bpostcond;
2819 else if (bprecond) tmpblock = bprecond;
2820 else tmpblock = bbody;
2821 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2825 /* from increment */
2828 if (bpostcond) tmpblock = bpostcond;
2829 else if (bprecond) tmpblock = bprecond;
2830 else if (bbody) tmpblock = bbody;
2831 else tmpblock = bout;
2832 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2839 ir_block *ontrue, *onfalse;
2840 if (bprecond) ontrue = bprecond;
2841 else if (bbody) ontrue = bbody;
2842 else if (bincrement) ontrue = bincrement;
2843 else ontrue = bpostcond;
2845 if (self->post_not) {
2850 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2854 /* Move 'bout' to the end */
2855 vec_remove(func->ir_func->blocks, bout_id, 1);
2856 vec_push(func->ir_func->blocks, bout);
2861 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2868 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2872 if (self->expression.outr) {
2873 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2876 self->expression.outr = (ir_value*)1;
2878 if (self->is_continue)
2879 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2881 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2884 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2888 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2893 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2895 ast_expression_codegen *cgen;
2897 ast_switch_case *def_case = NULL;
2898 ir_block *def_bfall = NULL;
2899 ir_block *def_bfall_to = NULL;
2900 bool set_def_bfall_to = false;
2902 ir_value *dummy = NULL;
2903 ir_value *irop = NULL;
2904 ir_block *bout = NULL;
2905 ir_block *bfall = NULL;
2913 compile_error(ast_ctx(self), "switch expression is not an l-value");
2917 if (self->expression.outr) {
2918 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2921 self->expression.outr = (ir_value*)1;
2926 cgen = self->operand->codegen;
2927 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2930 if (!vec_size(self->cases))
2933 cmpinstr = type_eq_instr[irop->vtype];
2934 if (cmpinstr >= VINSTR_END) {
2935 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2936 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2940 bout_id = vec_size(func->ir_func->blocks);
2941 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2945 /* setup the break block */
2946 vec_push(func->breakblocks, bout);
2948 /* Now create all cases */
2949 for (c = 0; c < vec_size(self->cases); ++c) {
2950 ir_value *cond, *val;
2951 ir_block *bcase, *bnot;
2954 ast_switch_case *swcase = &self->cases[c];
2956 if (swcase->value) {
2957 /* A regular case */
2958 /* generate the condition operand */
2959 cgen = swcase->value->codegen;
2960 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2962 /* generate the condition */
2963 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2967 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2968 bnot_id = vec_size(func->ir_func->blocks);
2969 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2970 if (!bcase || !bnot)
2972 if (set_def_bfall_to) {
2973 set_def_bfall_to = false;
2974 def_bfall_to = bcase;
2976 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2979 /* Make the previous case-end fall through */
2980 if (bfall && !bfall->final) {
2981 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2985 /* enter the case */
2986 func->curblock = bcase;
2987 cgen = swcase->code->codegen;
2988 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2991 /* remember this block to fall through from */
2992 bfall = func->curblock;
2994 /* enter the else and move it down */
2995 func->curblock = bnot;
2996 vec_remove(func->ir_func->blocks, bnot_id, 1);
2997 vec_push(func->ir_func->blocks, bnot);
2999 /* The default case */
3000 /* Remember where to fall through from: */
3003 /* remember which case it was */
3005 /* And the next case will be remembered */
3006 set_def_bfall_to = true;
3010 /* Jump from the last bnot to bout */
3011 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
3013 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
3018 /* If there was a default case, put it down here */
3022 /* No need to create an extra block */
3023 bcase = func->curblock;
3025 /* Insert the fallthrough jump */
3026 if (def_bfall && !def_bfall->final) {
3027 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
3031 /* Now generate the default code */
3032 cgen = def_case->code->codegen;
3033 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
3036 /* see if we need to fall through */
3037 if (def_bfall_to && !func->curblock->final)
3039 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
3044 /* Jump from the last bnot to bout */
3045 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
3047 /* enter the outgoing block */
3048 func->curblock = bout;
3050 /* restore the break block */
3051 vec_pop(func->breakblocks);
3053 /* Move 'bout' to the end, it's nicer */
3054 vec_remove(func->ir_func->blocks, bout_id, 1);
3055 vec_push(func->ir_func->blocks, bout);
3060 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3065 if (self->undefined) {
3066 compile_error(ast_ctx(self), "internal error: ast_label never defined");
3072 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3076 /* simply create a new block and jump to it */
3077 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3078 if (!self->irblock) {
3079 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3082 if (!func->curblock->final) {
3083 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3087 /* enter the new block */
3088 func->curblock = self->irblock;
3090 /* Generate all the leftover gotos */
3091 for (i = 0; i < vec_size(self->gotos); ++i) {
3092 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
3099 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3103 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3107 if (self->target->irblock) {
3108 if (self->irblock_from) {
3109 /* we already tried once, this is the callback */
3110 self->irblock_from->final = false;
3111 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3112 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3118 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3119 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3126 /* the target has not yet been created...
3127 * close this block in a sneaky way:
3129 func->curblock->final = true;
3130 self->irblock_from = func->curblock;
3131 ast_label_register_goto(self->target, self);
3137 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3139 ast_expression_codegen *cgen;
3141 ir_instr *callinstr;
3144 ir_value *funval = NULL;
3146 /* return values are never lvalues */
3148 compile_error(ast_ctx(self), "not an l-value (function call)");
3152 if (self->expression.outr) {
3153 *out = self->expression.outr;
3157 cgen = self->func->codegen;
3158 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3166 for (i = 0; i < vec_size(self->params); ++i)
3169 ast_expression *expr = self->params[i];
3171 cgen = expr->codegen;
3172 if (!(*cgen)(expr, func, false, ¶m))
3176 vec_push(params, param);
3179 /* varargs counter */
3180 if (self->va_count) {
3182 ir_builder *builder = func->curblock->owner->owner;
3183 cgen = self->va_count->codegen;
3184 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3186 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3187 ir_builder_get_va_count(builder), va_count))
3193 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3194 ast_function_label(func, "call"),
3195 funval, !!(self->func->flags & AST_FLAG_NORETURN));
3199 for (i = 0; i < vec_size(params); ++i) {
3200 ir_call_param(callinstr, params[i]);
3203 *out = ir_call_value(callinstr);
3204 self->expression.outr = *out;
3206 codegen_output_type(self, *out);