2 * Copyright (C) 2012, 2013
6 * Permission is hereby granted, free of charge, to any person obtaining a copy of
7 * this software and associated documentation files (the "Software"), to deal in
8 * the Software without restriction, including without limitation the rights to
9 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
10 * of the Software, and to permit persons to whom the Software is furnished to do
11 * so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
31 #define ast_instantiate(T, ctx, destroyfn) \
32 T* self = (T*)mem_a(sizeof(T)); \
36 ast_node_init((ast_node*)self, ctx, TYPE_##T); \
37 ( (ast_node*)self )->destroy = (ast_node_delete*)destroyfn
40 * forward declarations, these need not be in ast.h for obvious
43 static bool ast_member_codegen(ast_member*, ast_function*, bool lvalue, ir_value**);
44 static void ast_array_index_delete(ast_array_index*);
45 static bool ast_array_index_codegen(ast_array_index*, ast_function*, bool lvalue, ir_value**);
46 static void ast_argpipe_delete(ast_argpipe*);
47 static bool ast_argpipe_codegen(ast_argpipe*, ast_function*, bool lvalue, ir_value**);
48 static void ast_store_delete(ast_store*);
49 static bool ast_store_codegen(ast_store*, ast_function*, bool lvalue, ir_value**);
50 static void ast_ifthen_delete(ast_ifthen*);
51 static bool ast_ifthen_codegen(ast_ifthen*, ast_function*, bool lvalue, ir_value**);
52 static void ast_ternary_delete(ast_ternary*);
53 static bool ast_ternary_codegen(ast_ternary*, ast_function*, bool lvalue, ir_value**);
54 static void ast_loop_delete(ast_loop*);
55 static bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**);
56 static void ast_breakcont_delete(ast_breakcont*);
57 static bool ast_breakcont_codegen(ast_breakcont*, ast_function*, bool lvalue, ir_value**);
58 static void ast_switch_delete(ast_switch*);
59 static bool ast_switch_codegen(ast_switch*, ast_function*, bool lvalue, ir_value**);
60 static void ast_label_delete(ast_label*);
61 static void ast_label_register_goto(ast_label*, ast_goto*);
62 static bool ast_label_codegen(ast_label*, ast_function*, bool lvalue, ir_value**);
63 static bool ast_goto_codegen(ast_goto*, ast_function*, bool lvalue, ir_value**);
64 static void ast_goto_delete(ast_goto*);
65 static void ast_call_delete(ast_call*);
66 static bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**);
67 static bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**);
68 static void ast_unary_delete(ast_unary*);
69 static bool ast_unary_codegen(ast_unary*, ast_function*, bool lvalue, ir_value**);
70 static void ast_entfield_delete(ast_entfield*);
71 static bool ast_entfield_codegen(ast_entfield*, ast_function*, bool lvalue, ir_value**);
72 static void ast_return_delete(ast_return*);
73 static bool ast_return_codegen(ast_return*, ast_function*, bool lvalue, ir_value**);
74 static void ast_binstore_delete(ast_binstore*);
75 static bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**);
76 static void ast_binary_delete(ast_binary*);
77 static bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**);
79 /* It must not be possible to get here. */
80 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
83 con_err("ast node missing destroy()\n");
87 /* Initialize main ast node aprts */
88 static void ast_node_init(ast_node *self, lex_ctx_t ctx, int nodetype)
91 self->destroy = &_ast_node_destroy;
93 self->nodetype = nodetype;
94 self->side_effects = false;
97 /* weight and side effects */
98 static void _ast_propagate_effects(ast_node *self, ast_node *other)
100 if (ast_side_effects(other))
101 ast_side_effects(self) = true;
103 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
105 /* General expression initialization */
106 static void ast_expression_init(ast_expression *self,
107 ast_expression_codegen *codegen)
109 self->codegen = codegen;
110 self->vtype = TYPE_VOID;
117 self->varparam = NULL;
120 static void ast_expression_delete(ast_expression *self)
124 ast_delete(self->next);
125 for (i = 0; i < vec_size(self->params); ++i) {
126 ast_delete(self->params[i]);
128 vec_free(self->params);
130 ast_delete(self->varparam);
133 static void ast_expression_delete_full(ast_expression *self)
135 ast_expression_delete(self);
139 ast_value* ast_value_copy(const ast_value *self)
142 const ast_expression *fromex;
143 ast_expression *selfex;
144 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
145 if (self->expression.next) {
146 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
148 fromex = &self->expression;
149 selfex = &cp->expression;
150 selfex->count = fromex->count;
151 selfex->flags = fromex->flags;
152 for (i = 0; i < vec_size(fromex->params); ++i) {
153 ast_value *v = ast_value_copy(fromex->params[i]);
154 vec_push(selfex->params, v);
159 void ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
162 const ast_expression *fromex;
163 ast_expression *selfex;
164 self->vtype = other->vtype;
166 self->next = (ast_expression*)ast_type_copy(ast_ctx(self), other->next);
170 selfex->count = fromex->count;
171 selfex->flags = fromex->flags;
172 for (i = 0; i < vec_size(fromex->params); ++i) {
173 ast_value *v = ast_value_copy(fromex->params[i]);
174 vec_push(selfex->params, v);
178 static ast_expression* ast_shallow_type(lex_ctx_t ctx, int vtype)
180 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
181 ast_expression_init(self, NULL);
182 self->codegen = NULL;
188 ast_expression* ast_type_copy(lex_ctx_t ctx, const ast_expression *ex)
191 const ast_expression *fromex;
192 ast_expression *selfex;
198 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
199 ast_expression_init(self, NULL);
204 /* This may never be codegen()d */
205 selfex->codegen = NULL;
207 selfex->vtype = fromex->vtype;
209 selfex->next = ast_type_copy(ctx, fromex->next);
213 selfex->count = fromex->count;
214 selfex->flags = fromex->flags;
215 for (i = 0; i < vec_size(fromex->params); ++i) {
216 ast_value *v = ast_value_copy(fromex->params[i]);
217 vec_push(selfex->params, v);
224 bool ast_compare_type(ast_expression *a, ast_expression *b)
226 if (a->vtype == TYPE_NIL ||
227 b->vtype == TYPE_NIL)
229 if (a->vtype != b->vtype)
231 if (!a->next != !b->next)
233 if (vec_size(a->params) != vec_size(b->params))
235 if ((a->flags & AST_FLAG_TYPE_MASK) !=
236 (b->flags & AST_FLAG_TYPE_MASK) )
240 if (vec_size(a->params)) {
242 for (i = 0; i < vec_size(a->params); ++i) {
243 if (!ast_compare_type((ast_expression*)a->params[i],
244 (ast_expression*)b->params[i]))
249 return ast_compare_type(a->next, b->next);
253 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
260 if (pos + 6 >= bufsize)
262 util_strncpy(buf + pos, "(null)", 6);
266 if (pos + 1 >= bufsize)
271 util_strncpy(buf + pos, "(variant)", 9);
276 return ast_type_to_string_impl(e->next, buf, bufsize, pos);
279 if (pos + 3 >= bufsize)
283 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
284 if (pos + 1 >= bufsize)
290 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
291 if (pos + 2 >= bufsize)
293 if (!vec_size(e->params)) {
299 pos = ast_type_to_string_impl((ast_expression*)(e->params[0]), buf, bufsize, pos);
300 for (i = 1; i < vec_size(e->params); ++i) {
301 if (pos + 2 >= bufsize)
305 pos = ast_type_to_string_impl((ast_expression*)(e->params[i]), buf, bufsize, pos);
307 if (pos + 1 >= bufsize)
313 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
314 if (pos + 1 >= bufsize)
317 pos += util_snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->count);
318 if (pos + 1 >= bufsize)
324 typestr = type_name[e->vtype];
325 typelen = strlen(typestr);
326 if (pos + typelen >= bufsize)
328 util_strncpy(buf + pos, typestr, typelen);
329 return pos + typelen;
333 buf[bufsize-3] = '.';
334 buf[bufsize-2] = '.';
335 buf[bufsize-1] = '.';
339 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
341 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
345 static bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out);
346 ast_value* ast_value_new(lex_ctx_t ctx, const char *name, int t)
348 ast_instantiate(ast_value, ctx, ast_value_delete);
349 ast_expression_init((ast_expression*)self,
350 (ast_expression_codegen*)&ast_value_codegen);
351 self->expression.node.keep = true; /* keep */
353 self->name = name ? util_strdup(name) : NULL;
354 self->expression.vtype = t;
355 self->expression.next = NULL;
356 self->isfield = false;
358 self->hasvalue = false;
361 memset(&self->constval, 0, sizeof(self->constval));
362 self->initlist = NULL;
365 self->ir_values = NULL;
366 self->ir_value_count = 0;
372 self->argcounter = NULL;
373 self->intrinsic = false;
378 void ast_value_delete(ast_value* self)
381 mem_d((void*)self->name);
382 if (self->argcounter)
383 mem_d((void*)self->argcounter);
384 if (self->hasvalue) {
385 switch (self->expression.vtype)
388 mem_d((void*)self->constval.vstring);
391 /* unlink us from the function node */
392 self->constval.vfunc->vtype = NULL;
394 /* NOTE: delete function? currently collected in
395 * the parser structure
402 mem_d(self->ir_values);
407 if (self->initlist) {
408 if (self->expression.next->vtype == TYPE_STRING) {
409 /* strings are allocated, free them */
410 size_t i, len = vec_size(self->initlist);
411 /* in theory, len should be expression.count
412 * but let's not take any chances */
413 for (i = 0; i < len; ++i) {
414 if (self->initlist[i].vstring)
415 mem_d(self->initlist[i].vstring);
418 vec_free(self->initlist);
421 ast_expression_delete((ast_expression*)self);
425 void ast_value_params_add(ast_value *self, ast_value *p)
427 vec_push(self->expression.params, p);
430 bool ast_value_set_name(ast_value *self, const char *name)
433 mem_d((void*)self->name);
434 self->name = util_strdup(name);
438 ast_binary* ast_binary_new(lex_ctx_t ctx, int op,
439 ast_expression* left, ast_expression* right)
442 ast_instantiate(ast_binary, ctx, ast_binary_delete);
443 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
448 self->right_first = false;
450 ast_propagate_effects(self, left);
451 ast_propagate_effects(self, right);
453 if (OPTS_OPTIMIZATION(OPTIM_PEEPHOLE) && (fold = (ast_binary*)fold_superfluous(left, right, op))) {
454 ast_binary_delete(self);
458 if (op >= INSTR_EQ_F && op <= INSTR_GT)
459 self->expression.vtype = TYPE_FLOAT;
460 else if (op == INSTR_AND || op == INSTR_OR) {
461 if (OPTS_FLAG(PERL_LOGIC))
462 ast_type_adopt(self, right);
464 self->expression.vtype = TYPE_FLOAT;
466 else if (op == INSTR_BITAND || op == INSTR_BITOR)
467 self->expression.vtype = TYPE_FLOAT;
468 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
469 self->expression.vtype = TYPE_VECTOR;
470 else if (op == INSTR_MUL_V)
471 self->expression.vtype = TYPE_FLOAT;
473 self->expression.vtype = left->vtype;
476 self->refs = AST_REF_ALL;
481 void ast_binary_delete(ast_binary *self)
483 if (self->refs & AST_REF_LEFT) ast_unref(self->left);
484 if (self->refs & AST_REF_RIGHT) ast_unref(self->right);
486 ast_expression_delete((ast_expression*)self);
490 ast_binstore* ast_binstore_new(lex_ctx_t ctx, int storop, int op,
491 ast_expression* left, ast_expression* right)
493 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
494 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
496 ast_side_effects(self) = true;
498 self->opstore = storop;
501 self->source = right;
503 self->keep_dest = false;
505 ast_type_adopt(self, left);
509 void ast_binstore_delete(ast_binstore *self)
511 if (!self->keep_dest)
512 ast_unref(self->dest);
513 ast_unref(self->source);
514 ast_expression_delete((ast_expression*)self);
518 ast_unary* ast_unary_new(lex_ctx_t ctx, int op,
519 ast_expression *expr)
521 ast_instantiate(ast_unary, ctx, ast_unary_delete);
522 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
525 self->operand = expr;
528 if (ast_istype(expr, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
529 ast_unary *prev = (ast_unary*)((ast_unary*)expr)->operand;
531 /* Handle for double negation */
532 if ((((ast_unary*)expr)->op == VINSTR_NEG_V && op == VINSTR_NEG_V) ||
533 (((ast_unary*)expr)->op == VINSTR_NEG_F && op == VINSTR_NEG_F)) {
534 prev = (ast_unary*)((ast_unary*)expr)->operand;
537 if (ast_istype(prev, ast_unary)) {
538 ast_expression_delete((ast_expression*)self);
540 ++opts_optimizationcount[OPTIM_PEEPHOLE];
545 ast_propagate_effects(self, expr);
547 if ((op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) || op == VINSTR_NEG_F) {
548 self->expression.vtype = TYPE_FLOAT;
549 } else if (op == VINSTR_NEG_V) {
550 self->expression.vtype = TYPE_VECTOR;
552 compile_error(ctx, "cannot determine type of unary operation %s", util_instr_str[op]);
558 void ast_unary_delete(ast_unary *self)
560 if (self->operand) ast_unref(self->operand);
561 ast_expression_delete((ast_expression*)self);
565 ast_return* ast_return_new(lex_ctx_t ctx, ast_expression *expr)
567 ast_instantiate(ast_return, ctx, ast_return_delete);
568 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
570 self->operand = expr;
573 ast_propagate_effects(self, expr);
578 void ast_return_delete(ast_return *self)
581 ast_unref(self->operand);
582 ast_expression_delete((ast_expression*)self);
586 ast_entfield* ast_entfield_new(lex_ctx_t ctx, ast_expression *entity, ast_expression *field)
588 if (field->vtype != TYPE_FIELD) {
589 compile_error(ctx, "ast_entfield_new with expression not of type field");
592 return ast_entfield_new_force(ctx, entity, field, field->next);
595 ast_entfield* ast_entfield_new_force(lex_ctx_t ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
597 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
601 /* Error: field has no type... */
605 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
607 self->entity = entity;
609 ast_propagate_effects(self, entity);
610 ast_propagate_effects(self, field);
612 ast_type_adopt(self, outtype);
616 void ast_entfield_delete(ast_entfield *self)
618 ast_unref(self->entity);
619 ast_unref(self->field);
620 ast_expression_delete((ast_expression*)self);
624 ast_member* ast_member_new(lex_ctx_t ctx, ast_expression *owner, unsigned int field, const char *name)
626 ast_instantiate(ast_member, ctx, ast_member_delete);
632 if (owner->vtype != TYPE_VECTOR &&
633 owner->vtype != TYPE_FIELD) {
634 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->vtype]);
639 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
640 self->expression.node.keep = true; /* keep */
642 if (owner->vtype == TYPE_VECTOR) {
643 self->expression.vtype = TYPE_FLOAT;
644 self->expression.next = NULL;
646 self->expression.vtype = TYPE_FIELD;
647 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
650 self->rvalue = false;
652 ast_propagate_effects(self, owner);
656 self->name = util_strdup(name);
663 void ast_member_delete(ast_member *self)
665 /* The owner is always an ast_value, which has .keep=true,
666 * also: ast_members are usually deleted after the owner, thus
667 * this will cause invalid access
668 ast_unref(self->owner);
669 * once we allow (expression).x to access a vector-member, we need
670 * to change this: preferably by creating an alternate ast node for this
671 * purpose that is not garbage-collected.
673 ast_expression_delete((ast_expression*)self);
678 bool ast_member_set_name(ast_member *self, const char *name)
681 mem_d((void*)self->name);
682 self->name = util_strdup(name);
686 ast_array_index* ast_array_index_new(lex_ctx_t ctx, ast_expression *array, ast_expression *index)
688 ast_expression *outtype;
689 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
691 outtype = array->next;
694 /* Error: field has no type... */
698 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
702 ast_propagate_effects(self, array);
703 ast_propagate_effects(self, index);
705 ast_type_adopt(self, outtype);
706 if (array->vtype == TYPE_FIELD && outtype->vtype == TYPE_ARRAY) {
707 if (self->expression.vtype != TYPE_ARRAY) {
708 compile_error(ast_ctx(self), "array_index node on type");
709 ast_array_index_delete(self);
712 self->array = outtype;
713 self->expression.vtype = TYPE_FIELD;
719 void ast_array_index_delete(ast_array_index *self)
722 ast_unref(self->array);
724 ast_unref(self->index);
725 ast_expression_delete((ast_expression*)self);
729 ast_argpipe* ast_argpipe_new(lex_ctx_t ctx, ast_expression *index)
731 ast_instantiate(ast_argpipe, ctx, ast_argpipe_delete);
732 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_argpipe_codegen);
734 self->expression.vtype = TYPE_NOEXPR;
738 void ast_argpipe_delete(ast_argpipe *self)
741 ast_unref(self->index);
742 ast_expression_delete((ast_expression*)self);
746 ast_ifthen* ast_ifthen_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
748 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
749 if (!ontrue && !onfalse) {
750 /* because it is invalid */
754 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
757 self->on_true = ontrue;
758 self->on_false = onfalse;
759 ast_propagate_effects(self, cond);
761 ast_propagate_effects(self, ontrue);
763 ast_propagate_effects(self, onfalse);
768 void ast_ifthen_delete(ast_ifthen *self)
770 ast_unref(self->cond);
772 ast_unref(self->on_true);
774 ast_unref(self->on_false);
775 ast_expression_delete((ast_expression*)self);
779 ast_ternary* ast_ternary_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
781 ast_expression *exprtype = ontrue;
782 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
783 /* This time NEITHER must be NULL */
784 if (!ontrue || !onfalse) {
788 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
791 self->on_true = ontrue;
792 self->on_false = onfalse;
793 ast_propagate_effects(self, cond);
794 ast_propagate_effects(self, ontrue);
795 ast_propagate_effects(self, onfalse);
797 if (ontrue->vtype == TYPE_NIL)
799 ast_type_adopt(self, exprtype);
804 void ast_ternary_delete(ast_ternary *self)
806 /* the if()s are only there because computed-gotos can set them
809 if (self->cond) ast_unref(self->cond);
810 if (self->on_true) ast_unref(self->on_true);
811 if (self->on_false) ast_unref(self->on_false);
812 ast_expression_delete((ast_expression*)self);
816 ast_loop* ast_loop_new(lex_ctx_t ctx,
817 ast_expression *initexpr,
818 ast_expression *precond, bool pre_not,
819 ast_expression *postcond, bool post_not,
820 ast_expression *increment,
821 ast_expression *body)
823 ast_instantiate(ast_loop, ctx, ast_loop_delete);
824 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
826 self->initexpr = initexpr;
827 self->precond = precond;
828 self->postcond = postcond;
829 self->increment = increment;
832 self->pre_not = pre_not;
833 self->post_not = post_not;
836 ast_propagate_effects(self, initexpr);
838 ast_propagate_effects(self, precond);
840 ast_propagate_effects(self, postcond);
842 ast_propagate_effects(self, increment);
844 ast_propagate_effects(self, body);
849 void ast_loop_delete(ast_loop *self)
852 ast_unref(self->initexpr);
854 ast_unref(self->precond);
856 ast_unref(self->postcond);
858 ast_unref(self->increment);
860 ast_unref(self->body);
861 ast_expression_delete((ast_expression*)self);
865 ast_breakcont* ast_breakcont_new(lex_ctx_t ctx, bool iscont, unsigned int levels)
867 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
868 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
870 self->is_continue = iscont;
871 self->levels = levels;
876 void ast_breakcont_delete(ast_breakcont *self)
878 ast_expression_delete((ast_expression*)self);
882 ast_switch* ast_switch_new(lex_ctx_t ctx, ast_expression *op)
884 ast_instantiate(ast_switch, ctx, ast_switch_delete);
885 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
890 ast_propagate_effects(self, op);
895 void ast_switch_delete(ast_switch *self)
898 ast_unref(self->operand);
900 for (i = 0; i < vec_size(self->cases); ++i) {
901 if (self->cases[i].value)
902 ast_unref(self->cases[i].value);
903 ast_unref(self->cases[i].code);
905 vec_free(self->cases);
907 ast_expression_delete((ast_expression*)self);
911 ast_label* ast_label_new(lex_ctx_t ctx, const char *name, bool undefined)
913 ast_instantiate(ast_label, ctx, ast_label_delete);
914 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
916 self->expression.vtype = TYPE_NOEXPR;
918 self->name = util_strdup(name);
919 self->irblock = NULL;
921 self->undefined = undefined;
926 void ast_label_delete(ast_label *self)
928 mem_d((void*)self->name);
929 vec_free(self->gotos);
930 ast_expression_delete((ast_expression*)self);
934 static void ast_label_register_goto(ast_label *self, ast_goto *g)
936 vec_push(self->gotos, g);
939 ast_goto* ast_goto_new(lex_ctx_t ctx, const char *name)
941 ast_instantiate(ast_goto, ctx, ast_goto_delete);
942 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
944 self->name = util_strdup(name);
946 self->irblock_from = NULL;
951 void ast_goto_delete(ast_goto *self)
953 mem_d((void*)self->name);
954 ast_expression_delete((ast_expression*)self);
958 void ast_goto_set_label(ast_goto *self, ast_label *label)
960 self->target = label;
963 ast_call* ast_call_new(lex_ctx_t ctx,
964 ast_expression *funcexpr)
966 ast_instantiate(ast_call, ctx, ast_call_delete);
967 if (!funcexpr->next) {
968 compile_error(ctx, "not a function");
972 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
974 ast_side_effects(self) = true;
977 self->func = funcexpr;
978 self->va_count = NULL;
980 ast_type_adopt(self, funcexpr->next);
985 void ast_call_delete(ast_call *self)
988 for (i = 0; i < vec_size(self->params); ++i)
989 ast_unref(self->params[i]);
990 vec_free(self->params);
993 ast_unref(self->func);
996 ast_unref(self->va_count);
998 ast_expression_delete((ast_expression*)self);
1002 static bool ast_call_check_vararg(ast_call *self, ast_expression *va_type, ast_expression *exp_type)
1008 if (!va_type || !ast_compare_type(va_type, exp_type))
1010 if (va_type && exp_type)
1012 ast_type_to_string(va_type, tgot, sizeof(tgot));
1013 ast_type_to_string(exp_type, texp, sizeof(texp));
1014 if (OPTS_FLAG(UNSAFE_VARARGS)) {
1015 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1016 "piped variadic argument differs in type: constrained to type %s, expected type %s",
1020 compile_error(ast_ctx(self),
1021 "piped variadic argument differs in type: constrained to type %s, expected type %s",
1028 ast_type_to_string(exp_type, texp, sizeof(texp));
1029 if (OPTS_FLAG(UNSAFE_VARARGS)) {
1030 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1031 "piped variadic argument may differ in type: expected type %s",
1035 compile_error(ast_ctx(self),
1036 "piped variadic argument may differ in type: expected type %s",
1045 bool ast_call_check_types(ast_call *self, ast_expression *va_type)
1051 const ast_expression *func = self->func;
1052 size_t count = vec_size(self->params);
1053 if (count > vec_size(func->params))
1054 count = vec_size(func->params);
1056 for (i = 0; i < count; ++i) {
1057 if (ast_istype(self->params[i], ast_argpipe)) {
1058 /* warn about type safety instead */
1060 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1063 if (!ast_call_check_vararg(self, va_type, (ast_expression*)func->params[i]))
1066 else if (!ast_compare_type(self->params[i], (ast_expression*)(func->params[i])))
1068 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1069 ast_type_to_string((ast_expression*)func->params[i], texp, sizeof(texp));
1070 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
1071 (unsigned int)(i+1), texp, tgot);
1072 /* we don't immediately return */
1076 count = vec_size(self->params);
1077 if (count > vec_size(func->params) && func->varparam) {
1078 for (; i < count; ++i) {
1079 if (ast_istype(self->params[i], ast_argpipe)) {
1080 /* warn about type safety instead */
1082 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1085 if (!ast_call_check_vararg(self, va_type, func->varparam))
1088 else if (!ast_compare_type(self->params[i], func->varparam))
1090 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1091 ast_type_to_string(func->varparam, texp, sizeof(texp));
1092 compile_error(ast_ctx(self), "invalid type for variadic parameter %u in function call: expected %s, got %s",
1093 (unsigned int)(i+1), texp, tgot);
1094 /* we don't immediately return */
1102 ast_store* ast_store_new(lex_ctx_t ctx, int op,
1103 ast_expression *dest, ast_expression *source)
1105 ast_instantiate(ast_store, ctx, ast_store_delete);
1106 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
1108 ast_side_effects(self) = true;
1112 self->source = source;
1114 ast_type_adopt(self, dest);
1119 void ast_store_delete(ast_store *self)
1121 ast_unref(self->dest);
1122 ast_unref(self->source);
1123 ast_expression_delete((ast_expression*)self);
1127 ast_block* ast_block_new(lex_ctx_t ctx)
1129 ast_instantiate(ast_block, ctx, ast_block_delete);
1130 ast_expression_init((ast_expression*)self,
1131 (ast_expression_codegen*)&ast_block_codegen);
1133 self->locals = NULL;
1135 self->collect = NULL;
1140 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1142 ast_propagate_effects(self, e);
1143 vec_push(self->exprs, e);
1144 if (self->expression.next) {
1145 ast_delete(self->expression.next);
1146 self->expression.next = NULL;
1148 ast_type_adopt(self, e);
1152 void ast_block_collect(ast_block *self, ast_expression *expr)
1154 vec_push(self->collect, expr);
1155 expr->node.keep = true;
1158 void ast_block_delete(ast_block *self)
1161 for (i = 0; i < vec_size(self->exprs); ++i)
1162 ast_unref(self->exprs[i]);
1163 vec_free(self->exprs);
1164 for (i = 0; i < vec_size(self->locals); ++i)
1165 ast_delete(self->locals[i]);
1166 vec_free(self->locals);
1167 for (i = 0; i < vec_size(self->collect); ++i)
1168 ast_delete(self->collect[i]);
1169 vec_free(self->collect);
1170 ast_expression_delete((ast_expression*)self);
1174 void ast_block_set_type(ast_block *self, ast_expression *from)
1176 if (self->expression.next)
1177 ast_delete(self->expression.next);
1178 ast_type_adopt(self, from);
1181 ast_function* ast_function_new(lex_ctx_t ctx, const char *name, ast_value *vtype)
1183 ast_instantiate(ast_function, ctx, ast_function_delete);
1186 compile_error(ast_ctx(self), "internal error: ast_function_new condition 0");
1188 } else if (vtype->hasvalue || vtype->expression.vtype != TYPE_FUNCTION) {
1189 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1191 (int)vtype->hasvalue,
1192 vtype->expression.vtype);
1196 self->vtype = vtype;
1197 self->name = name ? util_strdup(name) : NULL;
1198 self->blocks = NULL;
1200 self->labelcount = 0;
1203 self->ir_func = NULL;
1204 self->curblock = NULL;
1206 self->breakblocks = NULL;
1207 self->continueblocks = NULL;
1209 vtype->hasvalue = true;
1210 vtype->constval.vfunc = self;
1212 self->varargs = NULL;
1214 self->fixedparams = NULL;
1215 self->return_value = NULL;
1224 void ast_function_delete(ast_function *self)
1228 mem_d((void*)self->name);
1230 /* ast_value_delete(self->vtype); */
1231 self->vtype->hasvalue = false;
1232 self->vtype->constval.vfunc = NULL;
1233 /* We use unref - if it was stored in a global table it is supposed
1234 * to be deleted from *there*
1236 ast_unref(self->vtype);
1238 for (i = 0; i < vec_size(self->blocks); ++i)
1239 ast_delete(self->blocks[i]);
1240 vec_free(self->blocks);
1241 vec_free(self->breakblocks);
1242 vec_free(self->continueblocks);
1244 ast_delete(self->varargs);
1246 ast_delete(self->argc);
1247 if (self->fixedparams)
1248 ast_unref(self->fixedparams);
1249 if (self->return_value)
1250 ast_unref(self->return_value);
1254 const char* ast_function_label(ast_function *self, const char *prefix)
1260 if (!OPTS_OPTION_BOOL(OPTION_DUMP) &&
1261 !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
1262 !OPTS_OPTION_BOOL(OPTION_DEBUG))
1267 id = (self->labelcount++);
1268 len = strlen(prefix);
1270 from = self->labelbuf + sizeof(self->labelbuf)-1;
1273 *from-- = (id%10) + '0';
1277 memcpy(from - len, prefix, len);
1281 /*********************************************************************/
1283 * by convention you must never pass NULL to the 'ir_value **out'
1284 * parameter. If you really don't care about the output, pass a dummy.
1285 * But I can't imagine a pituation where the output is truly unnecessary.
1288 static void _ast_codegen_output_type(ast_expression *self, ir_value *out)
1290 if (out->vtype == TYPE_FIELD)
1291 out->fieldtype = self->next->vtype;
1292 if (out->vtype == TYPE_FUNCTION)
1293 out->outtype = self->next->vtype;
1296 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1298 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1302 if (self->expression.vtype == TYPE_NIL) {
1303 *out = func->ir_func->owner->nil;
1306 /* NOTE: This is the codegen for a variable used in an expression.
1307 * It is not the codegen to generate the value. For this purpose,
1308 * ast_local_codegen and ast_global_codegen are to be used before this
1309 * is executed. ast_function_codegen should take care of its locals,
1310 * and the ast-user should take care of ast_global_codegen to be used
1311 * on all the globals.
1314 char tname[1024]; /* typename is reserved in C++ */
1315 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1316 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1323 static bool ast_global_array_set(ast_value *self)
1325 size_t count = vec_size(self->initlist);
1328 if (count > self->expression.count) {
1329 compile_error(ast_ctx(self), "too many elements in initializer");
1330 count = self->expression.count;
1332 else if (count < self->expression.count) {
1334 compile_warning(ast_ctx(self), "not all elements are initialized");
1338 for (i = 0; i != count; ++i) {
1339 switch (self->expression.next->vtype) {
1341 if (!ir_value_set_float(self->ir_values[i], self->initlist[i].vfloat))
1345 if (!ir_value_set_vector(self->ir_values[i], self->initlist[i].vvec))
1349 if (!ir_value_set_string(self->ir_values[i], self->initlist[i].vstring))
1353 /* we don't support them in any other place yet either */
1354 compile_error(ast_ctx(self), "TODO: nested arrays");
1357 /* this requiers a bit more work - similar to the fields I suppose */
1358 compile_error(ast_ctx(self), "global of type function not properly generated");
1361 if (!self->initlist[i].vfield) {
1362 compile_error(ast_ctx(self), "field constant without vfield set");
1365 if (!self->initlist[i].vfield->ir_v) {
1366 compile_error(ast_ctx(self), "field constant generated before its field");
1369 if (!ir_value_set_field(self->ir_values[i], self->initlist[i].vfield->ir_v))
1373 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1380 static bool check_array(ast_value *self, ast_value *array)
1382 if (array->expression.flags & AST_FLAG_ARRAY_INIT && !array->initlist) {
1383 compile_error(ast_ctx(self), "array without size: %s", self->name);
1386 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1387 if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1388 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1394 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1398 if (self->expression.vtype == TYPE_NIL) {
1399 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1403 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1405 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->vtype);
1408 func->context = ast_ctx(self);
1409 func->value->context = ast_ctx(self);
1411 self->constval.vfunc->ir_func = func;
1412 self->ir_v = func->value;
1413 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1414 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1415 if (self->expression.flags & AST_FLAG_ERASEABLE)
1416 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1417 /* The function is filled later on ast_function_codegen... */
1421 if (isfield && self->expression.vtype == TYPE_FIELD) {
1422 ast_expression *fieldtype = self->expression.next;
1424 if (self->hasvalue) {
1425 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1429 if (fieldtype->vtype == TYPE_ARRAY) {
1434 ast_expression *elemtype;
1436 ast_value *array = (ast_value*)fieldtype;
1438 if (!ast_istype(fieldtype, ast_value)) {
1439 compile_error(ast_ctx(self), "internal error: ast_value required");
1443 if (!check_array(self, array))
1446 elemtype = array->expression.next;
1447 vtype = elemtype->vtype;
1449 v = ir_builder_create_field(ir, self->name, vtype);
1451 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1454 v->context = ast_ctx(self);
1455 v->unique_life = true;
1457 array->ir_v = self->ir_v = v;
1459 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1460 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1461 if (self->expression.flags & AST_FLAG_ERASEABLE)
1462 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1464 namelen = strlen(self->name);
1465 name = (char*)mem_a(namelen + 16);
1466 util_strncpy(name, self->name, namelen);
1468 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1469 array->ir_values[0] = v;
1470 for (ai = 1; ai < array->expression.count; ++ai) {
1471 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1472 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1473 if (!array->ir_values[ai]) {
1475 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1478 array->ir_values[ai]->context = ast_ctx(self);
1479 array->ir_values[ai]->unique_life = true;
1480 array->ir_values[ai]->locked = true;
1481 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1482 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1488 v = ir_builder_create_field(ir, self->name, self->expression.next->vtype);
1491 v->context = ast_ctx(self);
1493 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1494 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1496 if (self->expression.flags & AST_FLAG_ERASEABLE)
1497 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1502 if (self->expression.vtype == TYPE_ARRAY) {
1507 ast_expression *elemtype = self->expression.next;
1508 int vtype = elemtype->vtype;
1510 if (self->expression.flags & AST_FLAG_ARRAY_INIT && !self->expression.count) {
1511 compile_error(ast_ctx(self), "array `%s' has no size", self->name);
1515 /* same as with field arrays */
1516 if (!check_array(self, self))
1519 v = ir_builder_create_global(ir, self->name, vtype);
1521 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1524 v->context = ast_ctx(self);
1525 v->unique_life = true;
1528 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1529 v->flags |= IR_FLAG_INCLUDE_DEF;
1530 if (self->expression.flags & AST_FLAG_ERASEABLE)
1531 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1533 namelen = strlen(self->name);
1534 name = (char*)mem_a(namelen + 16);
1535 util_strncpy(name, self->name, namelen);
1537 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1538 self->ir_values[0] = v;
1539 for (ai = 1; ai < self->expression.count; ++ai) {
1540 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1541 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1542 if (!self->ir_values[ai]) {
1544 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1547 self->ir_values[ai]->context = ast_ctx(self);
1548 self->ir_values[ai]->unique_life = true;
1549 self->ir_values[ai]->locked = true;
1550 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1551 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1557 /* Arrays don't do this since there's no "array" value which spans across the
1560 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1562 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1565 codegen_output_type(self, v);
1566 v->context = ast_ctx(self);
1569 /* link us to the ir_value */
1573 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1574 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1575 if (self->expression.flags & AST_FLAG_ERASEABLE)
1576 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1579 if (self->hasvalue) {
1580 switch (self->expression.vtype)
1583 if (!ir_value_set_float(v, self->constval.vfloat))
1587 if (!ir_value_set_vector(v, self->constval.vvec))
1591 if (!ir_value_set_string(v, self->constval.vstring))
1595 ast_global_array_set(self);
1598 compile_error(ast_ctx(self), "global of type function not properly generated");
1600 /* Cannot generate an IR value for a function,
1601 * need a pointer pointing to a function rather.
1604 if (!self->constval.vfield) {
1605 compile_error(ast_ctx(self), "field constant without vfield set");
1608 if (!self->constval.vfield->ir_v) {
1609 compile_error(ast_ctx(self), "field constant generated before its field");
1612 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1616 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1622 error: /* clean up */
1623 if(v) ir_value_delete(v);
1627 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1631 if (self->expression.vtype == TYPE_NIL) {
1632 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1636 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1638 /* Do we allow local functions? I think not...
1639 * this is NOT a function pointer atm.
1644 if (self->expression.vtype == TYPE_ARRAY) {
1649 ast_expression *elemtype = self->expression.next;
1650 int vtype = elemtype->vtype;
1652 func->flags |= IR_FLAG_HAS_ARRAYS;
1654 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1655 compile_error(ast_ctx(self), "array-parameters are not supported");
1659 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1660 if (!check_array(self, self))
1663 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1664 if (!self->ir_values) {
1665 compile_error(ast_ctx(self), "failed to allocate array values");
1669 v = ir_function_create_local(func, self->name, vtype, param);
1671 compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1674 v->context = ast_ctx(self);
1675 v->unique_life = true;
1678 namelen = strlen(self->name);
1679 name = (char*)mem_a(namelen + 16);
1680 util_strncpy(name, self->name, namelen);
1682 self->ir_values[0] = v;
1683 for (ai = 1; ai < self->expression.count; ++ai) {
1684 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1685 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1686 if (!self->ir_values[ai]) {
1687 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1690 self->ir_values[ai]->context = ast_ctx(self);
1691 self->ir_values[ai]->unique_life = true;
1692 self->ir_values[ai]->locked = true;
1698 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1701 codegen_output_type(self, v);
1702 v->context = ast_ctx(self);
1705 /* A constant local... hmmm...
1706 * I suppose the IR will have to deal with this
1708 if (self->hasvalue) {
1709 switch (self->expression.vtype)
1712 if (!ir_value_set_float(v, self->constval.vfloat))
1716 if (!ir_value_set_vector(v, self->constval.vvec))
1720 if (!ir_value_set_string(v, self->constval.vstring))
1724 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1729 /* link us to the ir_value */
1733 if (!ast_generate_accessors(self, func->owner))
1737 error: /* clean up */
1742 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1745 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1746 if (!self->setter || !self->getter)
1748 for (i = 0; i < self->expression.count; ++i) {
1749 if (!self->ir_values) {
1750 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1753 if (!self->ir_values[i]) {
1754 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1757 if (self->ir_values[i]->life) {
1758 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1763 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1765 if (!ast_global_codegen (self->setter, ir, false) ||
1766 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1767 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1769 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1770 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1775 if (!ast_global_codegen (self->getter, ir, false) ||
1776 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1777 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1779 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1780 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1784 for (i = 0; i < self->expression.count; ++i) {
1785 vec_free(self->ir_values[i]->life);
1787 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1791 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1796 ast_expression_codegen *cgen;
1801 irf = self->ir_func;
1803 compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1807 /* fill the parameter list */
1808 ec = &self->vtype->expression;
1809 for (i = 0; i < vec_size(ec->params); ++i)
1811 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1812 vec_push(irf->params, ec->params[i]->expression.next->vtype);
1814 vec_push(irf->params, ec->params[i]->expression.vtype);
1815 if (!self->builtin) {
1816 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1821 if (self->varargs) {
1822 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1824 irf->max_varargs = self->varargs->expression.count;
1827 if (self->builtin) {
1828 irf->builtin = self->builtin;
1832 /* have a local return value variable? */
1833 if (self->return_value) {
1834 if (!ast_local_codegen(self->return_value, self->ir_func, false))
1838 if (!vec_size(self->blocks)) {
1839 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1843 irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1844 if (!self->curblock) {
1845 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1853 if (!ast_local_codegen(self->argc, self->ir_func, true))
1855 cgen = self->argc->expression.codegen;
1856 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1858 cgen = self->fixedparams->expression.codegen;
1859 if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1861 sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1862 ast_function_label(self, "va_count"), INSTR_SUB_F,
1863 ir_builder_get_va_count(ir), fixed);
1866 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1873 for (i = 0; i < vec_size(self->blocks); ++i) {
1874 cgen = self->blocks[i]->expression.codegen;
1875 if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1879 /* TODO: check return types */
1880 if (!self->curblock->final)
1882 if (!self->vtype->expression.next ||
1883 self->vtype->expression.next->vtype == TYPE_VOID)
1885 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1887 else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1889 if (self->return_value) {
1890 cgen = self->return_value->expression.codegen;
1891 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1893 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1895 else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1896 "control reaches end of non-void function (`%s`) via %s",
1897 self->name, self->curblock->label))
1901 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1907 static bool starts_a_label(ast_expression *ex)
1909 while (ex && ast_istype(ex, ast_block)) {
1910 ast_block *b = (ast_block*)ex;
1915 return ast_istype(ex, ast_label);
1918 /* Note, you will not see ast_block_codegen generate ir_blocks.
1919 * To the AST and the IR, blocks are 2 different things.
1920 * In the AST it represents a block of code, usually enclosed in
1921 * curly braces {...}.
1922 * While in the IR it represents a block in terms of control-flow.
1924 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1928 /* We don't use this
1929 * Note: an ast-representation using the comma-operator
1930 * of the form: (a, b, c) = x should not assign to c...
1933 compile_error(ast_ctx(self), "not an l-value (code-block)");
1937 if (self->expression.outr) {
1938 *out = self->expression.outr;
1942 /* output is NULL at first, we'll have each expression
1943 * assign to out output, thus, a comma-operator represention
1944 * using an ast_block will return the last generated value,
1945 * so: (b, c) + a executed both b and c, and returns c,
1946 * which is then added to a.
1950 /* generate locals */
1951 for (i = 0; i < vec_size(self->locals); ++i)
1953 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1954 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1955 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1960 for (i = 0; i < vec_size(self->exprs); ++i)
1962 ast_expression_codegen *gen;
1963 if (func->curblock->final && !starts_a_label(self->exprs[i])) {
1964 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1968 gen = self->exprs[i]->codegen;
1969 if (!(*gen)(self->exprs[i], func, false, out))
1973 self->expression.outr = *out;
1978 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1980 ast_expression_codegen *cgen;
1981 ir_value *left = NULL;
1982 ir_value *right = NULL;
1986 ast_array_index *ai = NULL;
1988 if (lvalue && self->expression.outl) {
1989 *out = self->expression.outl;
1993 if (!lvalue && self->expression.outr) {
1994 *out = self->expression.outr;
1998 if (ast_istype(self->dest, ast_array_index))
2001 ai = (ast_array_index*)self->dest;
2002 idx = (ast_value*)ai->index;
2004 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2009 /* we need to call the setter */
2010 ir_value *iridx, *funval;
2014 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2018 arr = (ast_value*)ai->array;
2019 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2020 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2024 cgen = idx->expression.codegen;
2025 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2028 cgen = arr->setter->expression.codegen;
2029 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2032 cgen = self->source->codegen;
2033 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2036 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2039 ir_call_param(call, iridx);
2040 ir_call_param(call, right);
2041 self->expression.outr = right;
2047 cgen = self->dest->codegen;
2049 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
2051 self->expression.outl = left;
2053 cgen = self->source->codegen;
2055 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2058 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
2060 self->expression.outr = right;
2063 /* Theoretically, an assinment returns its left side as an
2064 * lvalue, if we don't need an lvalue though, we return
2065 * the right side as an rvalue, otherwise we have to
2066 * somehow know whether or not we need to dereference the pointer
2067 * on the left side - that is: OP_LOAD if it was an address.
2068 * Also: in original QC we cannot OP_LOADP *anyway*.
2070 *out = (lvalue ? left : right);
2075 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
2077 ast_expression_codegen *cgen;
2078 ir_value *left, *right;
2080 /* A binary operation cannot yield an l-value */
2082 compile_error(ast_ctx(self), "not an l-value (binop)");
2086 if (self->expression.outr) {
2087 *out = self->expression.outr;
2091 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
2092 (self->op == INSTR_AND || self->op == INSTR_OR))
2094 /* NOTE: The short-logic path will ignore right_first */
2096 /* short circuit evaluation */
2097 ir_block *other, *merge;
2098 ir_block *from_left, *from_right;
2102 /* prepare end-block */
2103 merge_id = vec_size(func->ir_func->blocks);
2104 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
2106 /* generate the left expression */
2107 cgen = self->left->codegen;
2108 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2110 /* remember the block */
2111 from_left = func->curblock;
2113 /* create a new block for the right expression */
2114 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
2115 if (self->op == INSTR_AND) {
2116 /* on AND: left==true -> other */
2117 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
2120 /* on OR: left==false -> other */
2121 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
2124 /* use the likely flag */
2125 vec_last(func->curblock->instr)->likely = true;
2127 /* enter the right-expression's block */
2128 func->curblock = other;
2130 cgen = self->right->codegen;
2131 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2133 /* remember block */
2134 from_right = func->curblock;
2136 /* jump to the merge block */
2137 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
2140 vec_remove(func->ir_func->blocks, merge_id, 1);
2141 vec_push(func->ir_func->blocks, merge);
2143 func->curblock = merge;
2144 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
2145 ast_function_label(func, "sce_value"),
2146 self->expression.vtype);
2147 ir_phi_add(phi, from_left, left);
2148 ir_phi_add(phi, from_right, right);
2149 *out = ir_phi_value(phi);
2153 if (!OPTS_FLAG(PERL_LOGIC)) {
2155 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
2156 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2157 ast_function_label(func, "sce_bool_v"),
2161 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2162 ast_function_label(func, "sce_bool"),
2167 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
2168 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2169 ast_function_label(func, "sce_bool_s"),
2173 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2174 ast_function_label(func, "sce_bool"),
2180 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
2181 ast_function_label(func, "sce_bool"),
2182 INSTR_AND, *out, *out);
2188 self->expression.outr = *out;
2189 codegen_output_type(self, *out);
2193 if (self->right_first) {
2194 cgen = self->right->codegen;
2195 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2197 cgen = self->left->codegen;
2198 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2201 cgen = self->left->codegen;
2202 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2204 cgen = self->right->codegen;
2205 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2209 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
2210 self->op, left, right);
2213 self->expression.outr = *out;
2214 codegen_output_type(self, *out);
2219 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
2221 ast_expression_codegen *cgen;
2222 ir_value *leftl = NULL, *leftr, *right, *bin;
2226 ast_array_index *ai = NULL;
2227 ir_value *iridx = NULL;
2229 if (lvalue && self->expression.outl) {
2230 *out = self->expression.outl;
2234 if (!lvalue && self->expression.outr) {
2235 *out = self->expression.outr;
2239 if (ast_istype(self->dest, ast_array_index))
2242 ai = (ast_array_index*)self->dest;
2243 idx = (ast_value*)ai->index;
2245 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2249 /* for a binstore we need both an lvalue and an rvalue for the left side */
2250 /* rvalue of destination! */
2252 cgen = idx->expression.codegen;
2253 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2256 cgen = self->dest->codegen;
2257 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2260 /* source as rvalue only */
2261 cgen = self->source->codegen;
2262 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2265 /* now the binary */
2266 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2267 self->opbin, leftr, right);
2268 self->expression.outr = bin;
2272 /* we need to call the setter */
2277 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2281 arr = (ast_value*)ai->array;
2282 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2283 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2287 cgen = arr->setter->expression.codegen;
2288 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2291 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2294 ir_call_param(call, iridx);
2295 ir_call_param(call, bin);
2296 self->expression.outr = bin;
2298 /* now store them */
2299 cgen = self->dest->codegen;
2300 /* lvalue of destination */
2301 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2303 self->expression.outl = leftl;
2305 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2307 self->expression.outr = bin;
2310 /* Theoretically, an assinment returns its left side as an
2311 * lvalue, if we don't need an lvalue though, we return
2312 * the right side as an rvalue, otherwise we have to
2313 * somehow know whether or not we need to dereference the pointer
2314 * on the left side - that is: OP_LOAD if it was an address.
2315 * Also: in original QC we cannot OP_LOADP *anyway*.
2317 *out = (lvalue ? leftl : bin);
2322 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2324 ast_expression_codegen *cgen;
2327 /* An unary operation cannot yield an l-value */
2329 compile_error(ast_ctx(self), "not an l-value (binop)");
2333 if (self->expression.outr) {
2334 *out = self->expression.outr;
2338 cgen = self->operand->codegen;
2340 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2343 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2347 self->expression.outr = *out;
2352 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2354 ast_expression_codegen *cgen;
2359 /* In the context of a return operation, we don't actually return
2363 compile_error(ast_ctx(self), "return-expression is not an l-value");
2367 if (self->expression.outr) {
2368 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2371 self->expression.outr = (ir_value*)1;
2373 if (self->operand) {
2374 cgen = self->operand->codegen;
2376 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2379 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2382 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2389 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2391 ast_expression_codegen *cgen;
2392 ir_value *ent, *field;
2394 /* This function needs to take the 'lvalue' flag into account!
2395 * As lvalue we provide a field-pointer, as rvalue we provide the
2399 if (lvalue && self->expression.outl) {
2400 *out = self->expression.outl;
2404 if (!lvalue && self->expression.outr) {
2405 *out = self->expression.outr;
2409 cgen = self->entity->codegen;
2410 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2413 cgen = self->field->codegen;
2414 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2419 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2422 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2423 ent, field, self->expression.vtype);
2424 /* Done AFTER error checking:
2425 codegen_output_type(self, *out);
2429 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2430 (lvalue ? "ADDRESS" : "FIELD"),
2431 type_name[self->expression.vtype]);
2435 codegen_output_type(self, *out);
2438 self->expression.outl = *out;
2440 self->expression.outr = *out;
2442 /* Hm that should be it... */
2446 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2448 ast_expression_codegen *cgen;
2451 /* in QC this is always an lvalue */
2452 if (lvalue && self->rvalue) {
2453 compile_error(ast_ctx(self), "not an l-value (member access)");
2456 if (self->expression.outl) {
2457 *out = self->expression.outl;
2461 cgen = self->owner->codegen;
2462 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2465 if (vec->vtype != TYPE_VECTOR &&
2466 !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2471 *out = ir_value_vector_member(vec, self->field);
2472 self->expression.outl = *out;
2474 return (*out != NULL);
2477 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2482 if (!lvalue && self->expression.outr) {
2483 *out = self->expression.outr;
2486 if (lvalue && self->expression.outl) {
2487 *out = self->expression.outl;
2491 if (!ast_istype(self->array, ast_value)) {
2492 compile_error(ast_ctx(self), "array indexing this way is not supported");
2493 /* note this would actually be pointer indexing because the left side is
2494 * not an actual array but (hopefully) an indexable expression.
2495 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2496 * support this path will be filled.
2501 arr = (ast_value*)self->array;
2502 idx = (ast_value*)self->index;
2504 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2505 /* Time to use accessor functions */
2506 ast_expression_codegen *cgen;
2507 ir_value *iridx, *funval;
2511 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2516 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2520 cgen = self->index->codegen;
2521 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2524 cgen = arr->getter->expression.codegen;
2525 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2528 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2531 ir_call_param(call, iridx);
2533 *out = ir_call_value(call);
2534 self->expression.outr = *out;
2535 (*out)->vtype = self->expression.vtype;
2536 codegen_output_type(self, *out);
2540 if (idx->expression.vtype == TYPE_FLOAT) {
2541 unsigned int arridx = idx->constval.vfloat;
2542 if (arridx >= self->array->count)
2544 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2547 *out = arr->ir_values[arridx];
2549 else if (idx->expression.vtype == TYPE_INTEGER) {
2550 unsigned int arridx = idx->constval.vint;
2551 if (arridx >= self->array->count)
2553 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2556 *out = arr->ir_values[arridx];
2559 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2562 (*out)->vtype = self->expression.vtype;
2563 codegen_output_type(self, *out);
2567 bool ast_argpipe_codegen(ast_argpipe *self, ast_function *func, bool lvalue, ir_value **out)
2571 compile_error(ast_ctx(self), "argpipe node: not an lvalue");
2576 compile_error(ast_ctx(self), "TODO: argpipe codegen not implemented");
2580 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2582 ast_expression_codegen *cgen;
2590 ir_block *ontrue_endblock = NULL;
2591 ir_block *onfalse_endblock = NULL;
2592 ir_block *merge = NULL;
2595 /* We don't output any value, thus also don't care about r/lvalue */
2599 if (self->expression.outr) {
2600 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2603 self->expression.outr = (ir_value*)1;
2605 /* generate the condition */
2606 cgen = self->cond->codegen;
2607 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2609 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2610 cond = func->curblock;
2612 /* try constant folding away the condition */
2613 if ((fold = fold_cond_ifthen(condval, func, self)) != -1)
2616 if (self->on_true) {
2617 /* create on-true block */
2618 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2622 /* enter the block */
2623 func->curblock = ontrue;
2626 cgen = self->on_true->codegen;
2627 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2630 /* we now need to work from the current endpoint */
2631 ontrue_endblock = func->curblock;
2636 if (self->on_false) {
2637 /* create on-false block */
2638 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2642 /* enter the block */
2643 func->curblock = onfalse;
2646 cgen = self->on_false->codegen;
2647 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2650 /* we now need to work from the current endpoint */
2651 onfalse_endblock = func->curblock;
2655 /* Merge block were they all merge in to */
2656 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2658 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2661 /* add jumps ot the merge block */
2662 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2664 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2667 /* Now enter the merge block */
2668 func->curblock = merge;
2671 /* we create the if here, that way all blocks are ordered :)
2673 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2674 (ontrue ? ontrue : merge),
2675 (onfalse ? onfalse : merge)))
2683 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2685 ast_expression_codegen *cgen;
2688 ir_value *trueval, *falseval;
2691 ir_block *cond = func->curblock;
2692 ir_block *cond_out = NULL;
2693 ir_block *ontrue, *ontrue_out = NULL;
2694 ir_block *onfalse, *onfalse_out = NULL;
2698 /* Ternary can never create an lvalue... */
2702 /* In theory it shouldn't be possible to pass through a node twice, but
2703 * in case we add any kind of optimization pass for the AST itself, it
2704 * may still happen, thus we remember a created ir_value and simply return one
2705 * if it already exists.
2707 if (self->expression.outr) {
2708 *out = self->expression.outr;
2712 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2714 /* generate the condition */
2715 func->curblock = cond;
2716 cgen = self->cond->codegen;
2717 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2719 cond_out = func->curblock;
2721 /* try constant folding away the condition */
2722 if ((fold = fold_cond_ternary(condval, func, self)) != -1)
2725 /* create on-true block */
2726 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2731 /* enter the block */
2732 func->curblock = ontrue;
2735 cgen = self->on_true->codegen;
2736 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2739 ontrue_out = func->curblock;
2742 /* create on-false block */
2743 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2748 /* enter the block */
2749 func->curblock = onfalse;
2752 cgen = self->on_false->codegen;
2753 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2756 onfalse_out = func->curblock;
2759 /* create merge block */
2760 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2763 /* jump to merge block */
2764 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2766 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2769 /* create if instruction */
2770 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2773 /* Now enter the merge block */
2774 func->curblock = merge;
2776 /* Here, now, we need a PHI node
2777 * but first some sanity checking...
2779 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2780 /* error("ternary with different types on the two sides"); */
2781 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2786 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2788 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2791 ir_phi_add(phi, ontrue_out, trueval);
2792 ir_phi_add(phi, onfalse_out, falseval);
2794 self->expression.outr = ir_phi_value(phi);
2795 *out = self->expression.outr;
2797 codegen_output_type(self, *out);
2802 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2804 ast_expression_codegen *cgen;
2806 ir_value *dummy = NULL;
2807 ir_value *precond = NULL;
2808 ir_value *postcond = NULL;
2810 /* Since we insert some jumps "late" so we have blocks
2811 * ordered "nicely", we need to keep track of the actual end-blocks
2812 * of expressions to add the jumps to.
2814 ir_block *bbody = NULL, *end_bbody = NULL;
2815 ir_block *bprecond = NULL, *end_bprecond = NULL;
2816 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2817 ir_block *bincrement = NULL, *end_bincrement = NULL;
2818 ir_block *bout = NULL, *bin = NULL;
2820 /* let's at least move the outgoing block to the end */
2823 /* 'break' and 'continue' need to be able to find the right blocks */
2824 ir_block *bcontinue = NULL;
2825 ir_block *bbreak = NULL;
2827 ir_block *tmpblock = NULL;
2832 if (self->expression.outr) {
2833 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2836 self->expression.outr = (ir_value*)1;
2839 * Should we ever need some kind of block ordering, better make this function
2840 * move blocks around than write a block ordering algorithm later... after all
2841 * the ast and ir should work together, not against each other.
2844 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2845 * anyway if for example it contains a ternary.
2849 cgen = self->initexpr->codegen;
2850 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2854 /* Store the block from which we enter this chaos */
2855 bin = func->curblock;
2857 /* The pre-loop condition needs its own block since we
2858 * need to be able to jump to the start of that expression.
2862 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2866 /* the pre-loop-condition the least important place to 'continue' at */
2867 bcontinue = bprecond;
2870 func->curblock = bprecond;
2873 cgen = self->precond->codegen;
2874 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2877 end_bprecond = func->curblock;
2879 bprecond = end_bprecond = NULL;
2882 /* Now the next blocks won't be ordered nicely, but we need to
2883 * generate them this early for 'break' and 'continue'.
2885 if (self->increment) {
2886 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2889 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2891 bincrement = end_bincrement = NULL;
2894 if (self->postcond) {
2895 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2898 bcontinue = bpostcond; /* postcond comes before the increment */
2900 bpostcond = end_bpostcond = NULL;
2903 bout_id = vec_size(func->ir_func->blocks);
2904 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2909 /* The loop body... */
2910 /* if (self->body) */
2912 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2917 func->curblock = bbody;
2919 vec_push(func->breakblocks, bbreak);
2921 vec_push(func->continueblocks, bcontinue);
2923 vec_push(func->continueblocks, bbody);
2927 cgen = self->body->codegen;
2928 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2932 end_bbody = func->curblock;
2933 vec_pop(func->breakblocks);
2934 vec_pop(func->continueblocks);
2937 /* post-loop-condition */
2941 func->curblock = bpostcond;
2944 cgen = self->postcond->codegen;
2945 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2948 end_bpostcond = func->curblock;
2951 /* The incrementor */
2952 if (self->increment)
2955 func->curblock = bincrement;
2958 cgen = self->increment->codegen;
2959 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2962 end_bincrement = func->curblock;
2965 /* In any case now, we continue from the outgoing block */
2966 func->curblock = bout;
2968 /* Now all blocks are in place */
2969 /* From 'bin' we jump to whatever comes first */
2970 if (bprecond) tmpblock = bprecond;
2971 else tmpblock = bbody; /* can never be null */
2974 else if (bpostcond) tmpblock = bpostcond;
2975 else tmpblock = bout;
2978 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2984 ir_block *ontrue, *onfalse;
2985 ontrue = bbody; /* can never be null */
2987 /* all of this is dead code
2988 else if (bincrement) ontrue = bincrement;
2989 else ontrue = bpostcond;
2993 if (self->pre_not) {
2998 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
3005 if (bincrement) tmpblock = bincrement;
3006 else if (bpostcond) tmpblock = bpostcond;
3007 else if (bprecond) tmpblock = bprecond;
3008 else tmpblock = bbody;
3009 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
3013 /* from increment */
3016 if (bpostcond) tmpblock = bpostcond;
3017 else if (bprecond) tmpblock = bprecond;
3018 else if (bbody) tmpblock = bbody;
3019 else tmpblock = bout;
3020 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
3027 ir_block *ontrue, *onfalse;
3028 if (bprecond) ontrue = bprecond;
3029 else ontrue = bbody; /* can never be null */
3031 /* all of this is dead code
3032 else if (bincrement) ontrue = bincrement;
3033 else ontrue = bpostcond;
3037 if (self->post_not) {
3042 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
3046 /* Move 'bout' to the end */
3047 vec_remove(func->ir_func->blocks, bout_id, 1);
3048 vec_push(func->ir_func->blocks, bout);
3053 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
3060 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
3064 if (self->expression.outr) {
3065 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
3068 self->expression.outr = (ir_value*)1;
3070 if (self->is_continue)
3071 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
3073 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
3076 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
3080 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
3085 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
3087 ast_expression_codegen *cgen;
3089 ast_switch_case *def_case = NULL;
3090 ir_block *def_bfall = NULL;
3091 ir_block *def_bfall_to = NULL;
3092 bool set_def_bfall_to = false;
3094 ir_value *dummy = NULL;
3095 ir_value *irop = NULL;
3096 ir_block *bout = NULL;
3097 ir_block *bfall = NULL;
3105 compile_error(ast_ctx(self), "switch expression is not an l-value");
3109 if (self->expression.outr) {
3110 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
3113 self->expression.outr = (ir_value*)1;
3118 cgen = self->operand->codegen;
3119 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
3122 if (!vec_size(self->cases))
3125 cmpinstr = type_eq_instr[irop->vtype];
3126 if (cmpinstr >= VINSTR_END) {
3127 ast_type_to_string(self->operand, typestr, sizeof(typestr));
3128 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
3132 bout_id = vec_size(func->ir_func->blocks);
3133 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
3137 /* setup the break block */
3138 vec_push(func->breakblocks, bout);
3140 /* Now create all cases */
3141 for (c = 0; c < vec_size(self->cases); ++c) {
3142 ir_value *cond, *val;
3143 ir_block *bcase, *bnot;
3146 ast_switch_case *swcase = &self->cases[c];
3148 if (swcase->value) {
3149 /* A regular case */
3150 /* generate the condition operand */
3151 cgen = swcase->value->codegen;
3152 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
3154 /* generate the condition */
3155 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
3159 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
3160 bnot_id = vec_size(func->ir_func->blocks);
3161 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
3162 if (!bcase || !bnot)
3164 if (set_def_bfall_to) {
3165 set_def_bfall_to = false;
3166 def_bfall_to = bcase;
3168 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
3171 /* Make the previous case-end fall through */
3172 if (bfall && !bfall->final) {
3173 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
3177 /* enter the case */
3178 func->curblock = bcase;
3179 cgen = swcase->code->codegen;
3180 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
3183 /* remember this block to fall through from */
3184 bfall = func->curblock;
3186 /* enter the else and move it down */
3187 func->curblock = bnot;
3188 vec_remove(func->ir_func->blocks, bnot_id, 1);
3189 vec_push(func->ir_func->blocks, bnot);
3191 /* The default case */
3192 /* Remember where to fall through from: */
3195 /* remember which case it was */
3197 /* And the next case will be remembered */
3198 set_def_bfall_to = true;
3202 /* Jump from the last bnot to bout */
3203 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
3205 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
3210 /* If there was a default case, put it down here */
3214 /* No need to create an extra block */
3215 bcase = func->curblock;
3217 /* Insert the fallthrough jump */
3218 if (def_bfall && !def_bfall->final) {
3219 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
3223 /* Now generate the default code */
3224 cgen = def_case->code->codegen;
3225 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
3228 /* see if we need to fall through */
3229 if (def_bfall_to && !func->curblock->final)
3231 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
3236 /* Jump from the last bnot to bout */
3237 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
3239 /* enter the outgoing block */
3240 func->curblock = bout;
3242 /* restore the break block */
3243 vec_pop(func->breakblocks);
3245 /* Move 'bout' to the end, it's nicer */
3246 vec_remove(func->ir_func->blocks, bout_id, 1);
3247 vec_push(func->ir_func->blocks, bout);
3252 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3257 if (self->undefined) {
3258 compile_error(ast_ctx(self), "internal error: ast_label never defined");
3264 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3268 /* simply create a new block and jump to it */
3269 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3270 if (!self->irblock) {
3271 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3274 if (!func->curblock->final) {
3275 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3279 /* enter the new block */
3280 func->curblock = self->irblock;
3282 /* Generate all the leftover gotos */
3283 for (i = 0; i < vec_size(self->gotos); ++i) {
3284 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
3291 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3295 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3299 if (self->target->irblock) {
3300 if (self->irblock_from) {
3301 /* we already tried once, this is the callback */
3302 self->irblock_from->final = false;
3303 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3304 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3310 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3311 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3318 /* the target has not yet been created...
3319 * close this block in a sneaky way:
3321 func->curblock->final = true;
3322 self->irblock_from = func->curblock;
3323 ast_label_register_goto(self->target, self);
3329 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3331 ast_expression_codegen *cgen;
3333 ir_instr *callinstr;
3336 ir_value *funval = NULL;
3338 /* return values are never lvalues */
3340 compile_error(ast_ctx(self), "not an l-value (function call)");
3344 if (self->expression.outr) {
3345 *out = self->expression.outr;
3349 cgen = self->func->codegen;
3350 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3358 for (i = 0; i < vec_size(self->params); ++i)
3361 ast_expression *expr = self->params[i];
3363 cgen = expr->codegen;
3364 if (!(*cgen)(expr, func, false, ¶m))
3368 vec_push(params, param);
3371 /* varargs counter */
3372 if (self->va_count) {
3374 ir_builder *builder = func->curblock->owner->owner;
3375 cgen = self->va_count->codegen;
3376 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3378 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3379 ir_builder_get_va_count(builder), va_count))
3385 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3386 ast_function_label(func, "call"),
3387 funval, !!(self->func->flags & AST_FLAG_NORETURN));
3391 for (i = 0; i < vec_size(params); ++i) {
3392 ir_call_param(callinstr, params[i]);
3395 *out = ir_call_value(callinstr);
3396 self->expression.outr = *out;
3398 codegen_output_type(self, *out);