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 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1214 if (self->expression.vtype == TYPE_NIL) {
1215 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1219 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1221 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->vtype);
1224 func->context = ast_ctx(self);
1225 func->value->context = ast_ctx(self);
1227 self->constval.vfunc->ir_func = func;
1228 self->ir_v = func->value;
1229 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1230 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1231 /* The function is filled later on ast_function_codegen... */
1235 if (isfield && self->expression.vtype == TYPE_FIELD) {
1236 ast_expression *fieldtype = self->expression.next;
1238 if (self->hasvalue) {
1239 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1243 if (fieldtype->vtype == TYPE_ARRAY) {
1248 ast_expression *elemtype;
1250 ast_value *array = (ast_value*)fieldtype;
1252 if (!ast_istype(fieldtype, ast_value)) {
1253 compile_error(ast_ctx(self), "internal error: ast_value required");
1257 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1258 if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1259 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1261 elemtype = array->expression.next;
1262 vtype = elemtype->vtype;
1264 v = ir_builder_create_field(ir, self->name, vtype);
1266 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1269 v->context = ast_ctx(self);
1270 v->unique_life = true;
1272 array->ir_v = self->ir_v = v;
1273 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1274 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1276 namelen = strlen(self->name);
1277 name = (char*)mem_a(namelen + 16);
1278 util_strncpy(name, self->name, namelen);
1280 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1281 array->ir_values[0] = v;
1282 for (ai = 1; ai < array->expression.count; ++ai) {
1283 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1284 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1285 if (!array->ir_values[ai]) {
1287 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1290 array->ir_values[ai]->context = ast_ctx(self);
1291 array->ir_values[ai]->unique_life = true;
1292 array->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 v = ir_builder_create_field(ir, self->name, self->expression.next->vtype);
1303 v->context = ast_ctx(self);
1305 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1306 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1311 if (self->expression.vtype == TYPE_ARRAY) {
1316 ast_expression *elemtype = self->expression.next;
1317 int vtype = elemtype->vtype;
1319 /* same as with field arrays */
1320 if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1321 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1323 v = ir_builder_create_global(ir, self->name, vtype);
1325 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1328 v->context = ast_ctx(self);
1329 v->unique_life = true;
1331 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1332 v->flags |= IR_FLAG_INCLUDE_DEF;
1334 namelen = strlen(self->name);
1335 name = (char*)mem_a(namelen + 16);
1336 util_strncpy(name, self->name, namelen);
1338 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1339 self->ir_values[0] = v;
1340 for (ai = 1; ai < self->expression.count; ++ai) {
1341 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1342 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1343 if (!self->ir_values[ai]) {
1345 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1348 self->ir_values[ai]->context = ast_ctx(self);
1349 self->ir_values[ai]->unique_life = true;
1350 self->ir_values[ai]->locked = true;
1351 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1352 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1358 /* Arrays don't do this since there's no "array" value which spans across the
1361 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1363 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1366 codegen_output_type(self, v);
1367 v->context = ast_ctx(self);
1370 if (self->hasvalue) {
1371 switch (self->expression.vtype)
1374 if (!ir_value_set_float(v, self->constval.vfloat))
1378 if (!ir_value_set_vector(v, self->constval.vvec))
1382 if (!ir_value_set_string(v, self->constval.vstring))
1386 compile_error(ast_ctx(self), "TODO: global constant array");
1389 compile_error(ast_ctx(self), "global of type function not properly generated");
1391 /* Cannot generate an IR value for a function,
1392 * need a pointer pointing to a function rather.
1395 if (!self->constval.vfield) {
1396 compile_error(ast_ctx(self), "field constant without vfield set");
1399 if (!self->constval.vfield->ir_v) {
1400 compile_error(ast_ctx(self), "field constant generated before its field");
1403 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1407 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1412 /* link us to the ir_value */
1415 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1416 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1419 error: /* clean up */
1424 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1428 if (self->expression.vtype == TYPE_NIL) {
1429 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1433 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1435 /* Do we allow local functions? I think not...
1436 * this is NOT a function pointer atm.
1441 if (self->expression.vtype == TYPE_ARRAY) {
1446 ast_expression *elemtype = self->expression.next;
1447 int vtype = elemtype->vtype;
1449 func->flags |= IR_FLAG_HAS_ARRAYS;
1451 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1452 compile_error(ast_ctx(self), "array-parameters are not supported");
1456 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1457 if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1458 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1461 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1462 if (!self->ir_values) {
1463 compile_error(ast_ctx(self), "failed to allocate array values");
1467 v = ir_function_create_local(func, self->name, vtype, param);
1469 compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1472 v->context = ast_ctx(self);
1473 v->unique_life = true;
1476 namelen = strlen(self->name);
1477 name = (char*)mem_a(namelen + 16);
1478 util_strncpy(name, self->name, namelen);
1480 self->ir_values[0] = v;
1481 for (ai = 1; ai < self->expression.count; ++ai) {
1482 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1483 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1484 if (!self->ir_values[ai]) {
1485 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1488 self->ir_values[ai]->context = ast_ctx(self);
1489 self->ir_values[ai]->unique_life = true;
1490 self->ir_values[ai]->locked = true;
1496 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1499 codegen_output_type(self, v);
1500 v->context = ast_ctx(self);
1503 /* A constant local... hmmm...
1504 * I suppose the IR will have to deal with this
1506 if (self->hasvalue) {
1507 switch (self->expression.vtype)
1510 if (!ir_value_set_float(v, self->constval.vfloat))
1514 if (!ir_value_set_vector(v, self->constval.vvec))
1518 if (!ir_value_set_string(v, self->constval.vstring))
1522 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1527 /* link us to the ir_value */
1531 if (!ast_generate_accessors(self, func->owner))
1535 error: /* clean up */
1540 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1543 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1544 if (!self->setter || !self->getter)
1546 for (i = 0; i < self->expression.count; ++i) {
1547 if (!self->ir_values) {
1548 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1551 if (!self->ir_values[i]) {
1552 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1555 if (self->ir_values[i]->life) {
1556 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1561 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1563 if (!ast_global_codegen (self->setter, ir, false) ||
1564 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1565 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1567 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1568 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1573 if (!ast_global_codegen (self->getter, ir, false) ||
1574 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1575 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1577 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1578 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1582 for (i = 0; i < self->expression.count; ++i) {
1583 vec_free(self->ir_values[i]->life);
1585 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1589 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1594 ast_expression_codegen *cgen;
1599 irf = self->ir_func;
1601 compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1605 /* fill the parameter list */
1606 ec = &self->vtype->expression;
1607 for (i = 0; i < vec_size(ec->params); ++i)
1609 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1610 vec_push(irf->params, ec->params[i]->expression.next->vtype);
1612 vec_push(irf->params, ec->params[i]->expression.vtype);
1613 if (!self->builtin) {
1614 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1619 if (self->varargs) {
1620 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1622 irf->max_varargs = self->varargs->expression.count;
1625 if (self->builtin) {
1626 irf->builtin = self->builtin;
1630 /* have a local return value variable? */
1631 if (self->return_value) {
1632 if (!ast_local_codegen(self->return_value, self->ir_func, false))
1636 if (!vec_size(self->blocks)) {
1637 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1641 irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1642 if (!self->curblock) {
1643 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1651 if (!ast_local_codegen(self->argc, self->ir_func, true))
1653 cgen = self->argc->expression.codegen;
1654 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1656 cgen = self->fixedparams->expression.codegen;
1657 if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1659 sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1660 ast_function_label(self, "va_count"), INSTR_SUB_F,
1661 ir_builder_get_va_count(ir), fixed);
1664 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1671 for (i = 0; i < vec_size(self->blocks); ++i) {
1672 cgen = self->blocks[i]->expression.codegen;
1673 if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1677 /* TODO: check return types */
1678 if (!self->curblock->final)
1680 if (!self->vtype->expression.next ||
1681 self->vtype->expression.next->vtype == TYPE_VOID)
1683 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1685 else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1687 if (self->return_value) {
1688 cgen = self->return_value->expression.codegen;
1689 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1691 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1693 else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1694 "control reaches end of non-void function (`%s`) via %s",
1695 self->name, self->curblock->label))
1699 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1705 /* Note, you will not see ast_block_codegen generate ir_blocks.
1706 * To the AST and the IR, blocks are 2 different things.
1707 * In the AST it represents a block of code, usually enclosed in
1708 * curly braces {...}.
1709 * While in the IR it represents a block in terms of control-flow.
1711 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1715 /* We don't use this
1716 * Note: an ast-representation using the comma-operator
1717 * of the form: (a, b, c) = x should not assign to c...
1720 compile_error(ast_ctx(self), "not an l-value (code-block)");
1724 if (self->expression.outr) {
1725 *out = self->expression.outr;
1729 /* output is NULL at first, we'll have each expression
1730 * assign to out output, thus, a comma-operator represention
1731 * using an ast_block will return the last generated value,
1732 * so: (b, c) + a executed both b and c, and returns c,
1733 * which is then added to a.
1737 /* generate locals */
1738 for (i = 0; i < vec_size(self->locals); ++i)
1740 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1741 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1742 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1747 for (i = 0; i < vec_size(self->exprs); ++i)
1749 ast_expression_codegen *gen;
1750 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1751 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1755 gen = self->exprs[i]->codegen;
1756 if (!(*gen)(self->exprs[i], func, false, out))
1760 self->expression.outr = *out;
1765 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1767 ast_expression_codegen *cgen;
1768 ir_value *left = NULL;
1769 ir_value *right = NULL;
1773 ast_array_index *ai = NULL;
1775 if (lvalue && self->expression.outl) {
1776 *out = self->expression.outl;
1780 if (!lvalue && self->expression.outr) {
1781 *out = self->expression.outr;
1785 if (ast_istype(self->dest, ast_array_index))
1788 ai = (ast_array_index*)self->dest;
1789 idx = (ast_value*)ai->index;
1791 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1796 /* we need to call the setter */
1797 ir_value *iridx, *funval;
1801 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1805 arr = (ast_value*)ai->array;
1806 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1807 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1811 cgen = idx->expression.codegen;
1812 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1815 cgen = arr->setter->expression.codegen;
1816 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1819 cgen = self->source->codegen;
1820 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1823 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1826 ir_call_param(call, iridx);
1827 ir_call_param(call, right);
1828 self->expression.outr = right;
1834 cgen = self->dest->codegen;
1836 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1838 self->expression.outl = left;
1840 cgen = self->source->codegen;
1842 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1845 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1847 self->expression.outr = right;
1850 /* Theoretically, an assinment returns its left side as an
1851 * lvalue, if we don't need an lvalue though, we return
1852 * the right side as an rvalue, otherwise we have to
1853 * somehow know whether or not we need to dereference the pointer
1854 * on the left side - that is: OP_LOAD if it was an address.
1855 * Also: in original QC we cannot OP_LOADP *anyway*.
1857 *out = (lvalue ? left : right);
1862 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1864 ast_expression_codegen *cgen;
1865 ir_value *left, *right;
1867 /* A binary operation cannot yield an l-value */
1869 compile_error(ast_ctx(self), "not an l-value (binop)");
1873 if (self->expression.outr) {
1874 *out = self->expression.outr;
1878 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1879 (self->op == INSTR_AND || self->op == INSTR_OR))
1881 /* short circuit evaluation */
1882 ir_block *other, *merge;
1883 ir_block *from_left, *from_right;
1887 /* prepare end-block */
1888 merge_id = vec_size(func->ir_func->blocks);
1889 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1891 /* generate the left expression */
1892 cgen = self->left->codegen;
1893 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1895 /* remember the block */
1896 from_left = func->curblock;
1898 /* create a new block for the right expression */
1899 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1900 if (self->op == INSTR_AND) {
1901 /* on AND: left==true -> other */
1902 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1905 /* on OR: left==false -> other */
1906 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1909 /* use the likely flag */
1910 vec_last(func->curblock->instr)->likely = true;
1912 /* enter the right-expression's block */
1913 func->curblock = other;
1915 cgen = self->right->codegen;
1916 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1918 /* remember block */
1919 from_right = func->curblock;
1921 /* jump to the merge block */
1922 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1925 vec_remove(func->ir_func->blocks, merge_id, 1);
1926 vec_push(func->ir_func->blocks, merge);
1928 func->curblock = merge;
1929 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1930 ast_function_label(func, "sce_value"),
1931 self->expression.vtype);
1932 ir_phi_add(phi, from_left, left);
1933 ir_phi_add(phi, from_right, right);
1934 *out = ir_phi_value(phi);
1938 if (!OPTS_FLAG(PERL_LOGIC)) {
1940 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1941 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1942 ast_function_label(func, "sce_bool_v"),
1946 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1947 ast_function_label(func, "sce_bool"),
1952 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
1953 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1954 ast_function_label(func, "sce_bool_s"),
1958 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1959 ast_function_label(func, "sce_bool"),
1965 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
1966 ast_function_label(func, "sce_bool"),
1967 INSTR_AND, *out, *out);
1973 self->expression.outr = *out;
1974 codegen_output_type(self, *out);
1978 cgen = self->left->codegen;
1979 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1982 cgen = self->right->codegen;
1983 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1986 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1987 self->op, left, right);
1990 self->expression.outr = *out;
1991 codegen_output_type(self, *out);
1996 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1998 ast_expression_codegen *cgen;
1999 ir_value *leftl = NULL, *leftr, *right, *bin;
2003 ast_array_index *ai = NULL;
2004 ir_value *iridx = NULL;
2006 if (lvalue && self->expression.outl) {
2007 *out = self->expression.outl;
2011 if (!lvalue && self->expression.outr) {
2012 *out = self->expression.outr;
2016 if (ast_istype(self->dest, ast_array_index))
2019 ai = (ast_array_index*)self->dest;
2020 idx = (ast_value*)ai->index;
2022 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2026 /* for a binstore we need both an lvalue and an rvalue for the left side */
2027 /* rvalue of destination! */
2029 cgen = idx->expression.codegen;
2030 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2033 cgen = self->dest->codegen;
2034 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2037 /* source as rvalue only */
2038 cgen = self->source->codegen;
2039 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2042 /* now the binary */
2043 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2044 self->opbin, leftr, right);
2045 self->expression.outr = bin;
2049 /* we need to call the setter */
2054 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2058 arr = (ast_value*)ai->array;
2059 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2060 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2064 cgen = arr->setter->expression.codegen;
2065 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2068 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2071 ir_call_param(call, iridx);
2072 ir_call_param(call, bin);
2073 self->expression.outr = bin;
2075 /* now store them */
2076 cgen = self->dest->codegen;
2077 /* lvalue of destination */
2078 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2080 self->expression.outl = leftl;
2082 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2084 self->expression.outr = bin;
2087 /* Theoretically, an assinment returns its left side as an
2088 * lvalue, if we don't need an lvalue though, we return
2089 * the right side as an rvalue, otherwise we have to
2090 * somehow know whether or not we need to dereference the pointer
2091 * on the left side - that is: OP_LOAD if it was an address.
2092 * Also: in original QC we cannot OP_LOADP *anyway*.
2094 *out = (lvalue ? leftl : bin);
2099 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2101 ast_expression_codegen *cgen;
2104 /* An unary operation cannot yield an l-value */
2106 compile_error(ast_ctx(self), "not an l-value (binop)");
2110 if (self->expression.outr) {
2111 *out = self->expression.outr;
2115 cgen = self->operand->codegen;
2117 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2120 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2124 self->expression.outr = *out;
2129 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2131 ast_expression_codegen *cgen;
2136 /* In the context of a return operation, we don't actually return
2140 compile_error(ast_ctx(self), "return-expression is not an l-value");
2144 if (self->expression.outr) {
2145 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2148 self->expression.outr = (ir_value*)1;
2150 if (self->operand) {
2151 cgen = self->operand->codegen;
2153 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2156 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2159 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2166 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2168 ast_expression_codegen *cgen;
2169 ir_value *ent, *field;
2171 /* This function needs to take the 'lvalue' flag into account!
2172 * As lvalue we provide a field-pointer, as rvalue we provide the
2176 if (lvalue && self->expression.outl) {
2177 *out = self->expression.outl;
2181 if (!lvalue && self->expression.outr) {
2182 *out = self->expression.outr;
2186 cgen = self->entity->codegen;
2187 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2190 cgen = self->field->codegen;
2191 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2196 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2199 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2200 ent, field, self->expression.vtype);
2201 /* Done AFTER error checking:
2202 codegen_output_type(self, *out);
2206 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2207 (lvalue ? "ADDRESS" : "FIELD"),
2208 type_name[self->expression.vtype]);
2212 codegen_output_type(self, *out);
2215 self->expression.outl = *out;
2217 self->expression.outr = *out;
2219 /* Hm that should be it... */
2223 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2225 ast_expression_codegen *cgen;
2228 /* in QC this is always an lvalue */
2229 if (lvalue && self->rvalue) {
2230 compile_error(ast_ctx(self), "not an l-value (member access)");
2233 if (self->expression.outl) {
2234 *out = self->expression.outl;
2238 cgen = self->owner->codegen;
2239 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2242 if (vec->vtype != TYPE_VECTOR &&
2243 !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2248 *out = ir_value_vector_member(vec, self->field);
2249 self->expression.outl = *out;
2251 return (*out != NULL);
2254 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2259 if (!lvalue && self->expression.outr) {
2260 *out = self->expression.outr;
2263 if (lvalue && self->expression.outl) {
2264 *out = self->expression.outl;
2268 if (!ast_istype(self->array, ast_value)) {
2269 compile_error(ast_ctx(self), "array indexing this way is not supported");
2270 /* note this would actually be pointer indexing because the left side is
2271 * not an actual array but (hopefully) an indexable expression.
2272 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2273 * support this path will be filled.
2278 arr = (ast_value*)self->array;
2279 idx = (ast_value*)self->index;
2281 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2282 /* Time to use accessor functions */
2283 ast_expression_codegen *cgen;
2284 ir_value *iridx, *funval;
2288 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2293 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2297 cgen = self->index->codegen;
2298 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2301 cgen = arr->getter->expression.codegen;
2302 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2305 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2308 ir_call_param(call, iridx);
2310 *out = ir_call_value(call);
2311 self->expression.outr = *out;
2312 (*out)->vtype = self->expression.vtype;
2313 codegen_output_type(self, *out);
2317 if (idx->expression.vtype == TYPE_FLOAT) {
2318 unsigned int arridx = idx->constval.vfloat;
2319 if (arridx >= self->array->count)
2321 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2324 *out = arr->ir_values[arridx];
2326 else if (idx->expression.vtype == TYPE_INTEGER) {
2327 unsigned int arridx = idx->constval.vint;
2328 if (arridx >= self->array->count)
2330 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2333 *out = arr->ir_values[arridx];
2336 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2339 (*out)->vtype = self->expression.vtype;
2340 codegen_output_type(self, *out);
2344 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2346 ast_expression_codegen *cgen;
2354 ir_block *ontrue_endblock = NULL;
2355 ir_block *onfalse_endblock = NULL;
2356 ir_block *merge = NULL;
2358 /* We don't output any value, thus also don't care about r/lvalue */
2362 if (self->expression.outr) {
2363 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2366 self->expression.outr = (ir_value*)1;
2368 /* generate the condition */
2369 cgen = self->cond->codegen;
2370 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2372 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2373 cond = func->curblock;
2377 if (self->on_true) {
2378 /* create on-true block */
2379 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2383 /* enter the block */
2384 func->curblock = ontrue;
2387 cgen = self->on_true->codegen;
2388 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2391 /* we now need to work from the current endpoint */
2392 ontrue_endblock = func->curblock;
2397 if (self->on_false) {
2398 /* create on-false block */
2399 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2403 /* enter the block */
2404 func->curblock = onfalse;
2407 cgen = self->on_false->codegen;
2408 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2411 /* we now need to work from the current endpoint */
2412 onfalse_endblock = func->curblock;
2416 /* Merge block were they all merge in to */
2417 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2419 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2422 /* add jumps ot the merge block */
2423 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2425 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2428 /* Now enter the merge block */
2429 func->curblock = merge;
2432 /* we create the if here, that way all blocks are ordered :)
2434 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2435 (ontrue ? ontrue : merge),
2436 (onfalse ? onfalse : merge)))
2444 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2446 ast_expression_codegen *cgen;
2449 ir_value *trueval, *falseval;
2452 ir_block *cond = func->curblock;
2453 ir_block *cond_out = NULL;
2454 ir_block *ontrue, *ontrue_out = NULL;
2455 ir_block *onfalse, *onfalse_out = NULL;
2458 /* Ternary can never create an lvalue... */
2462 /* In theory it shouldn't be possible to pass through a node twice, but
2463 * in case we add any kind of optimization pass for the AST itself, it
2464 * may still happen, thus we remember a created ir_value and simply return one
2465 * if it already exists.
2467 if (self->expression.outr) {
2468 *out = self->expression.outr;
2472 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2474 /* generate the condition */
2475 func->curblock = cond;
2476 cgen = self->cond->codegen;
2477 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2479 cond_out = func->curblock;
2481 /* create on-true block */
2482 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2487 /* enter the block */
2488 func->curblock = ontrue;
2491 cgen = self->on_true->codegen;
2492 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2495 ontrue_out = func->curblock;
2498 /* create on-false block */
2499 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2504 /* enter the block */
2505 func->curblock = onfalse;
2508 cgen = self->on_false->codegen;
2509 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2512 onfalse_out = func->curblock;
2515 /* create merge block */
2516 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2519 /* jump to merge block */
2520 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2522 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2525 /* create if instruction */
2526 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2529 /* Now enter the merge block */
2530 func->curblock = merge;
2532 /* Here, now, we need a PHI node
2533 * but first some sanity checking...
2535 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2536 /* error("ternary with different types on the two sides"); */
2537 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2542 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2544 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2547 ir_phi_add(phi, ontrue_out, trueval);
2548 ir_phi_add(phi, onfalse_out, falseval);
2550 self->expression.outr = ir_phi_value(phi);
2551 *out = self->expression.outr;
2553 codegen_output_type(self, *out);
2558 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2560 ast_expression_codegen *cgen;
2562 ir_value *dummy = NULL;
2563 ir_value *precond = NULL;
2564 ir_value *postcond = NULL;
2566 /* Since we insert some jumps "late" so we have blocks
2567 * ordered "nicely", we need to keep track of the actual end-blocks
2568 * of expressions to add the jumps to.
2570 ir_block *bbody = NULL, *end_bbody = NULL;
2571 ir_block *bprecond = NULL, *end_bprecond = NULL;
2572 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2573 ir_block *bincrement = NULL, *end_bincrement = NULL;
2574 ir_block *bout = NULL, *bin = NULL;
2576 /* let's at least move the outgoing block to the end */
2579 /* 'break' and 'continue' need to be able to find the right blocks */
2580 ir_block *bcontinue = NULL;
2581 ir_block *bbreak = NULL;
2583 ir_block *tmpblock = NULL;
2588 if (self->expression.outr) {
2589 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2592 self->expression.outr = (ir_value*)1;
2595 * Should we ever need some kind of block ordering, better make this function
2596 * move blocks around than write a block ordering algorithm later... after all
2597 * the ast and ir should work together, not against each other.
2600 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2601 * anyway if for example it contains a ternary.
2605 cgen = self->initexpr->codegen;
2606 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2610 /* Store the block from which we enter this chaos */
2611 bin = func->curblock;
2613 /* The pre-loop condition needs its own block since we
2614 * need to be able to jump to the start of that expression.
2618 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2622 /* the pre-loop-condition the least important place to 'continue' at */
2623 bcontinue = bprecond;
2626 func->curblock = bprecond;
2629 cgen = self->precond->codegen;
2630 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2633 end_bprecond = func->curblock;
2635 bprecond = end_bprecond = NULL;
2638 /* Now the next blocks won't be ordered nicely, but we need to
2639 * generate them this early for 'break' and 'continue'.
2641 if (self->increment) {
2642 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2645 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2647 bincrement = end_bincrement = NULL;
2650 if (self->postcond) {
2651 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2654 bcontinue = bpostcond; /* postcond comes before the increment */
2656 bpostcond = end_bpostcond = NULL;
2659 bout_id = vec_size(func->ir_func->blocks);
2660 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2665 /* The loop body... */
2666 /* if (self->body) */
2668 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2673 func->curblock = bbody;
2675 vec_push(func->breakblocks, bbreak);
2677 vec_push(func->continueblocks, bcontinue);
2679 vec_push(func->continueblocks, bbody);
2683 cgen = self->body->codegen;
2684 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2688 end_bbody = func->curblock;
2689 vec_pop(func->breakblocks);
2690 vec_pop(func->continueblocks);
2693 /* post-loop-condition */
2697 func->curblock = bpostcond;
2700 cgen = self->postcond->codegen;
2701 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2704 end_bpostcond = func->curblock;
2707 /* The incrementor */
2708 if (self->increment)
2711 func->curblock = bincrement;
2714 cgen = self->increment->codegen;
2715 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2718 end_bincrement = func->curblock;
2721 /* In any case now, we continue from the outgoing block */
2722 func->curblock = bout;
2724 /* Now all blocks are in place */
2725 /* From 'bin' we jump to whatever comes first */
2726 if (bprecond) tmpblock = bprecond;
2727 else if (bbody) tmpblock = bbody;
2728 else if (bpostcond) tmpblock = bpostcond;
2729 else tmpblock = bout;
2730 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2736 ir_block *ontrue, *onfalse;
2737 if (bbody) ontrue = bbody;
2738 else if (bincrement) ontrue = bincrement;
2739 else if (bpostcond) ontrue = bpostcond;
2740 else ontrue = bprecond;
2742 if (self->pre_not) {
2747 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2754 if (bincrement) tmpblock = bincrement;
2755 else if (bpostcond) tmpblock = bpostcond;
2756 else if (bprecond) tmpblock = bprecond;
2757 else tmpblock = bbody;
2758 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2762 /* from increment */
2765 if (bpostcond) tmpblock = bpostcond;
2766 else if (bprecond) tmpblock = bprecond;
2767 else if (bbody) tmpblock = bbody;
2768 else tmpblock = bout;
2769 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2776 ir_block *ontrue, *onfalse;
2777 if (bprecond) ontrue = bprecond;
2778 else if (bbody) ontrue = bbody;
2779 else if (bincrement) ontrue = bincrement;
2780 else ontrue = bpostcond;
2782 if (self->post_not) {
2787 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2791 /* Move 'bout' to the end */
2792 vec_remove(func->ir_func->blocks, bout_id, 1);
2793 vec_push(func->ir_func->blocks, bout);
2798 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2805 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2809 if (self->expression.outr) {
2810 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2813 self->expression.outr = (ir_value*)1;
2815 if (self->is_continue)
2816 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2818 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2821 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2825 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2830 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2832 ast_expression_codegen *cgen;
2834 ast_switch_case *def_case = NULL;
2835 ir_block *def_bfall = NULL;
2836 ir_block *def_bfall_to = NULL;
2837 bool set_def_bfall_to = false;
2839 ir_value *dummy = NULL;
2840 ir_value *irop = NULL;
2841 ir_block *bout = NULL;
2842 ir_block *bfall = NULL;
2850 compile_error(ast_ctx(self), "switch expression is not an l-value");
2854 if (self->expression.outr) {
2855 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2858 self->expression.outr = (ir_value*)1;
2863 cgen = self->operand->codegen;
2864 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2867 if (!vec_size(self->cases))
2870 cmpinstr = type_eq_instr[irop->vtype];
2871 if (cmpinstr >= VINSTR_END) {
2872 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2873 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2877 bout_id = vec_size(func->ir_func->blocks);
2878 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2882 /* setup the break block */
2883 vec_push(func->breakblocks, bout);
2885 /* Now create all cases */
2886 for (c = 0; c < vec_size(self->cases); ++c) {
2887 ir_value *cond, *val;
2888 ir_block *bcase, *bnot;
2891 ast_switch_case *swcase = &self->cases[c];
2893 if (swcase->value) {
2894 /* A regular case */
2895 /* generate the condition operand */
2896 cgen = swcase->value->codegen;
2897 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2899 /* generate the condition */
2900 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2904 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2905 bnot_id = vec_size(func->ir_func->blocks);
2906 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2907 if (!bcase || !bnot)
2909 if (set_def_bfall_to) {
2910 set_def_bfall_to = false;
2911 def_bfall_to = bcase;
2913 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2916 /* Make the previous case-end fall through */
2917 if (bfall && !bfall->final) {
2918 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2922 /* enter the case */
2923 func->curblock = bcase;
2924 cgen = swcase->code->codegen;
2925 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2928 /* remember this block to fall through from */
2929 bfall = func->curblock;
2931 /* enter the else and move it down */
2932 func->curblock = bnot;
2933 vec_remove(func->ir_func->blocks, bnot_id, 1);
2934 vec_push(func->ir_func->blocks, bnot);
2936 /* The default case */
2937 /* Remember where to fall through from: */
2940 /* remember which case it was */
2942 /* And the next case will be remembered */
2943 set_def_bfall_to = true;
2947 /* Jump from the last bnot to bout */
2948 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2950 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2955 /* If there was a default case, put it down here */
2959 /* No need to create an extra block */
2960 bcase = func->curblock;
2962 /* Insert the fallthrough jump */
2963 if (def_bfall && !def_bfall->final) {
2964 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2968 /* Now generate the default code */
2969 cgen = def_case->code->codegen;
2970 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2973 /* see if we need to fall through */
2974 if (def_bfall_to && !func->curblock->final)
2976 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2981 /* Jump from the last bnot to bout */
2982 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2984 /* enter the outgoing block */
2985 func->curblock = bout;
2987 /* restore the break block */
2988 vec_pop(func->breakblocks);
2990 /* Move 'bout' to the end, it's nicer */
2991 vec_remove(func->ir_func->blocks, bout_id, 1);
2992 vec_push(func->ir_func->blocks, bout);
2997 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3002 if (self->undefined) {
3003 compile_error(ast_ctx(self), "internal error: ast_label never defined");
3009 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3013 /* simply create a new block and jump to it */
3014 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3015 if (!self->irblock) {
3016 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3019 if (!func->curblock->final) {
3020 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3024 /* enter the new block */
3025 func->curblock = self->irblock;
3027 /* Generate all the leftover gotos */
3028 for (i = 0; i < vec_size(self->gotos); ++i) {
3029 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
3036 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3040 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3044 if (self->target->irblock) {
3045 if (self->irblock_from) {
3046 /* we already tried once, this is the callback */
3047 self->irblock_from->final = false;
3048 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3049 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3055 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3056 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3063 /* the target has not yet been created...
3064 * close this block in a sneaky way:
3066 func->curblock->final = true;
3067 self->irblock_from = func->curblock;
3068 ast_label_register_goto(self->target, self);
3074 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3076 ast_expression_codegen *cgen;
3078 ir_instr *callinstr;
3081 ir_value *funval = NULL;
3083 /* return values are never lvalues */
3085 compile_error(ast_ctx(self), "not an l-value (function call)");
3089 if (self->expression.outr) {
3090 *out = self->expression.outr;
3094 cgen = self->func->codegen;
3095 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3103 for (i = 0; i < vec_size(self->params); ++i)
3106 ast_expression *expr = self->params[i];
3108 cgen = expr->codegen;
3109 if (!(*cgen)(expr, func, false, ¶m))
3113 vec_push(params, param);
3116 /* varargs counter */
3117 if (self->va_count) {
3119 ir_builder *builder = func->curblock->owner->owner;
3120 cgen = self->va_count->codegen;
3121 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3123 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3124 ir_builder_get_va_count(builder), va_count))
3130 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3131 ast_function_label(func, "call"),
3132 funval, !!(self->func->flags & AST_FLAG_NORETURN));
3136 for (i = 0; i < vec_size(params); ++i) {
3137 ir_call_param(callinstr, params[i]);
3140 *out = ir_call_value(callinstr);
3141 self->expression.outr = *out;
3143 codegen_output_type(self, *out);