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 == op)
533 prev = (ast_unary*)((ast_unary*)expr)->operand;
535 if (ast_istype(prev, ast_unary)) {
536 ast_expression_delete((ast_expression*)self);
538 ++opts_optimizationcount[OPTIM_PEEPHOLE];
543 ast_propagate_effects(self, expr);
545 if ((op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) || op == VINSTR_NEG_F) {
546 self->expression.vtype = TYPE_FLOAT;
547 } else if (op == VINSTR_NEG_V) {
548 self->expression.vtype = TYPE_VECTOR;
550 compile_error(ctx, "cannot determine type of unary operation %s", util_instr_str[op]);
556 void ast_unary_delete(ast_unary *self)
558 if (self->operand) ast_unref(self->operand);
559 ast_expression_delete((ast_expression*)self);
563 ast_return* ast_return_new(lex_ctx_t ctx, ast_expression *expr)
565 ast_instantiate(ast_return, ctx, ast_return_delete);
566 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
568 self->operand = expr;
571 ast_propagate_effects(self, expr);
576 void ast_return_delete(ast_return *self)
579 ast_unref(self->operand);
580 ast_expression_delete((ast_expression*)self);
584 ast_entfield* ast_entfield_new(lex_ctx_t ctx, ast_expression *entity, ast_expression *field)
586 if (field->vtype != TYPE_FIELD) {
587 compile_error(ctx, "ast_entfield_new with expression not of type field");
590 return ast_entfield_new_force(ctx, entity, field, field->next);
593 ast_entfield* ast_entfield_new_force(lex_ctx_t ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
595 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
599 /* Error: field has no type... */
603 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
605 self->entity = entity;
607 ast_propagate_effects(self, entity);
608 ast_propagate_effects(self, field);
610 ast_type_adopt(self, outtype);
614 void ast_entfield_delete(ast_entfield *self)
616 ast_unref(self->entity);
617 ast_unref(self->field);
618 ast_expression_delete((ast_expression*)self);
622 ast_member* ast_member_new(lex_ctx_t ctx, ast_expression *owner, unsigned int field, const char *name)
624 ast_instantiate(ast_member, ctx, ast_member_delete);
630 if (owner->vtype != TYPE_VECTOR &&
631 owner->vtype != TYPE_FIELD) {
632 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->vtype]);
637 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
638 self->expression.node.keep = true; /* keep */
640 if (owner->vtype == TYPE_VECTOR) {
641 self->expression.vtype = TYPE_FLOAT;
642 self->expression.next = NULL;
644 self->expression.vtype = TYPE_FIELD;
645 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
648 self->rvalue = false;
650 ast_propagate_effects(self, owner);
654 self->name = util_strdup(name);
661 void ast_member_delete(ast_member *self)
663 /* The owner is always an ast_value, which has .keep=true,
664 * also: ast_members are usually deleted after the owner, thus
665 * this will cause invalid access
666 ast_unref(self->owner);
667 * once we allow (expression).x to access a vector-member, we need
668 * to change this: preferably by creating an alternate ast node for this
669 * purpose that is not garbage-collected.
671 ast_expression_delete((ast_expression*)self);
676 bool ast_member_set_name(ast_member *self, const char *name)
679 mem_d((void*)self->name);
680 self->name = util_strdup(name);
684 ast_array_index* ast_array_index_new(lex_ctx_t ctx, ast_expression *array, ast_expression *index)
686 ast_expression *outtype;
687 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
689 outtype = array->next;
692 /* Error: field has no type... */
696 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
700 ast_propagate_effects(self, array);
701 ast_propagate_effects(self, index);
703 ast_type_adopt(self, outtype);
704 if (array->vtype == TYPE_FIELD && outtype->vtype == TYPE_ARRAY) {
705 if (self->expression.vtype != TYPE_ARRAY) {
706 compile_error(ast_ctx(self), "array_index node on type");
707 ast_array_index_delete(self);
710 self->array = outtype;
711 self->expression.vtype = TYPE_FIELD;
717 void ast_array_index_delete(ast_array_index *self)
720 ast_unref(self->array);
722 ast_unref(self->index);
723 ast_expression_delete((ast_expression*)self);
727 ast_argpipe* ast_argpipe_new(lex_ctx_t ctx, ast_expression *index)
729 ast_instantiate(ast_argpipe, ctx, ast_argpipe_delete);
730 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_argpipe_codegen);
732 self->expression.vtype = TYPE_NOEXPR;
736 void ast_argpipe_delete(ast_argpipe *self)
739 ast_unref(self->index);
740 ast_expression_delete((ast_expression*)self);
744 ast_ifthen* ast_ifthen_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
746 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
747 if (!ontrue && !onfalse) {
748 /* because it is invalid */
752 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
755 self->on_true = ontrue;
756 self->on_false = onfalse;
757 ast_propagate_effects(self, cond);
759 ast_propagate_effects(self, ontrue);
761 ast_propagate_effects(self, onfalse);
766 void ast_ifthen_delete(ast_ifthen *self)
768 ast_unref(self->cond);
770 ast_unref(self->on_true);
772 ast_unref(self->on_false);
773 ast_expression_delete((ast_expression*)self);
777 ast_ternary* ast_ternary_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
779 ast_expression *exprtype = ontrue;
780 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
781 /* This time NEITHER must be NULL */
782 if (!ontrue || !onfalse) {
786 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
789 self->on_true = ontrue;
790 self->on_false = onfalse;
791 ast_propagate_effects(self, cond);
792 ast_propagate_effects(self, ontrue);
793 ast_propagate_effects(self, onfalse);
795 if (ontrue->vtype == TYPE_NIL)
797 ast_type_adopt(self, exprtype);
802 void ast_ternary_delete(ast_ternary *self)
804 /* the if()s are only there because computed-gotos can set them
807 if (self->cond) ast_unref(self->cond);
808 if (self->on_true) ast_unref(self->on_true);
809 if (self->on_false) ast_unref(self->on_false);
810 ast_expression_delete((ast_expression*)self);
814 ast_loop* ast_loop_new(lex_ctx_t ctx,
815 ast_expression *initexpr,
816 ast_expression *precond, bool pre_not,
817 ast_expression *postcond, bool post_not,
818 ast_expression *increment,
819 ast_expression *body)
821 ast_instantiate(ast_loop, ctx, ast_loop_delete);
822 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
824 self->initexpr = initexpr;
825 self->precond = precond;
826 self->postcond = postcond;
827 self->increment = increment;
830 self->pre_not = pre_not;
831 self->post_not = post_not;
834 ast_propagate_effects(self, initexpr);
836 ast_propagate_effects(self, precond);
838 ast_propagate_effects(self, postcond);
840 ast_propagate_effects(self, increment);
842 ast_propagate_effects(self, body);
847 void ast_loop_delete(ast_loop *self)
850 ast_unref(self->initexpr);
852 ast_unref(self->precond);
854 ast_unref(self->postcond);
856 ast_unref(self->increment);
858 ast_unref(self->body);
859 ast_expression_delete((ast_expression*)self);
863 ast_breakcont* ast_breakcont_new(lex_ctx_t ctx, bool iscont, unsigned int levels)
865 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
866 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
868 self->is_continue = iscont;
869 self->levels = levels;
874 void ast_breakcont_delete(ast_breakcont *self)
876 ast_expression_delete((ast_expression*)self);
880 ast_switch* ast_switch_new(lex_ctx_t ctx, ast_expression *op)
882 ast_instantiate(ast_switch, ctx, ast_switch_delete);
883 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
888 ast_propagate_effects(self, op);
893 void ast_switch_delete(ast_switch *self)
896 ast_unref(self->operand);
898 for (i = 0; i < vec_size(self->cases); ++i) {
899 if (self->cases[i].value)
900 ast_unref(self->cases[i].value);
901 ast_unref(self->cases[i].code);
903 vec_free(self->cases);
905 ast_expression_delete((ast_expression*)self);
909 ast_label* ast_label_new(lex_ctx_t ctx, const char *name, bool undefined)
911 ast_instantiate(ast_label, ctx, ast_label_delete);
912 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
914 self->expression.vtype = TYPE_NOEXPR;
916 self->name = util_strdup(name);
917 self->irblock = NULL;
919 self->undefined = undefined;
924 void ast_label_delete(ast_label *self)
926 mem_d((void*)self->name);
927 vec_free(self->gotos);
928 ast_expression_delete((ast_expression*)self);
932 static void ast_label_register_goto(ast_label *self, ast_goto *g)
934 vec_push(self->gotos, g);
937 ast_goto* ast_goto_new(lex_ctx_t ctx, const char *name)
939 ast_instantiate(ast_goto, ctx, ast_goto_delete);
940 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
942 self->name = util_strdup(name);
944 self->irblock_from = NULL;
949 void ast_goto_delete(ast_goto *self)
951 mem_d((void*)self->name);
952 ast_expression_delete((ast_expression*)self);
956 void ast_goto_set_label(ast_goto *self, ast_label *label)
958 self->target = label;
961 ast_call* ast_call_new(lex_ctx_t ctx,
962 ast_expression *funcexpr)
964 ast_instantiate(ast_call, ctx, ast_call_delete);
965 if (!funcexpr->next) {
966 compile_error(ctx, "not a function");
970 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
972 ast_side_effects(self) = true;
975 self->func = funcexpr;
976 self->va_count = NULL;
978 ast_type_adopt(self, funcexpr->next);
983 void ast_call_delete(ast_call *self)
986 for (i = 0; i < vec_size(self->params); ++i)
987 ast_unref(self->params[i]);
988 vec_free(self->params);
991 ast_unref(self->func);
994 ast_unref(self->va_count);
996 ast_expression_delete((ast_expression*)self);
1000 static bool ast_call_check_vararg(ast_call *self, ast_expression *va_type, ast_expression *exp_type)
1006 if (!va_type || !ast_compare_type(va_type, exp_type))
1008 if (va_type && exp_type)
1010 ast_type_to_string(va_type, tgot, sizeof(tgot));
1011 ast_type_to_string(exp_type, texp, sizeof(texp));
1012 if (OPTS_FLAG(UNSAFE_VARARGS)) {
1013 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1014 "piped variadic argument differs in type: constrained to type %s, expected type %s",
1018 compile_error(ast_ctx(self),
1019 "piped variadic argument differs in type: constrained to type %s, expected type %s",
1026 ast_type_to_string(exp_type, texp, sizeof(texp));
1027 if (OPTS_FLAG(UNSAFE_VARARGS)) {
1028 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1029 "piped variadic argument may differ in type: expected type %s",
1033 compile_error(ast_ctx(self),
1034 "piped variadic argument may differ in type: expected type %s",
1043 bool ast_call_check_types(ast_call *self, ast_expression *va_type)
1049 const ast_expression *func = self->func;
1050 size_t count = vec_size(self->params);
1051 if (count > vec_size(func->params))
1052 count = vec_size(func->params);
1054 for (i = 0; i < count; ++i) {
1055 if (ast_istype(self->params[i], ast_argpipe)) {
1056 /* warn about type safety instead */
1058 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1061 if (!ast_call_check_vararg(self, va_type, (ast_expression*)func->params[i]))
1064 else if (!ast_compare_type(self->params[i], (ast_expression*)(func->params[i])))
1066 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1067 ast_type_to_string((ast_expression*)func->params[i], texp, sizeof(texp));
1068 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
1069 (unsigned int)(i+1), texp, tgot);
1070 /* we don't immediately return */
1074 count = vec_size(self->params);
1075 if (count > vec_size(func->params) && func->varparam) {
1076 for (; i < count; ++i) {
1077 if (ast_istype(self->params[i], ast_argpipe)) {
1078 /* warn about type safety instead */
1080 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1083 if (!ast_call_check_vararg(self, va_type, func->varparam))
1086 else if (!ast_compare_type(self->params[i], func->varparam))
1088 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1089 ast_type_to_string(func->varparam, texp, sizeof(texp));
1090 compile_error(ast_ctx(self), "invalid type for variadic parameter %u in function call: expected %s, got %s",
1091 (unsigned int)(i+1), texp, tgot);
1092 /* we don't immediately return */
1100 ast_store* ast_store_new(lex_ctx_t ctx, int op,
1101 ast_expression *dest, ast_expression *source)
1103 ast_instantiate(ast_store, ctx, ast_store_delete);
1104 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
1106 ast_side_effects(self) = true;
1110 self->source = source;
1112 ast_type_adopt(self, dest);
1117 void ast_store_delete(ast_store *self)
1119 ast_unref(self->dest);
1120 ast_unref(self->source);
1121 ast_expression_delete((ast_expression*)self);
1125 ast_block* ast_block_new(lex_ctx_t ctx)
1127 ast_instantiate(ast_block, ctx, ast_block_delete);
1128 ast_expression_init((ast_expression*)self,
1129 (ast_expression_codegen*)&ast_block_codegen);
1131 self->locals = NULL;
1133 self->collect = NULL;
1138 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1140 ast_propagate_effects(self, e);
1141 vec_push(self->exprs, e);
1142 if (self->expression.next) {
1143 ast_delete(self->expression.next);
1144 self->expression.next = NULL;
1146 ast_type_adopt(self, e);
1150 void ast_block_collect(ast_block *self, ast_expression *expr)
1152 vec_push(self->collect, expr);
1153 expr->node.keep = true;
1156 void ast_block_delete(ast_block *self)
1159 for (i = 0; i < vec_size(self->exprs); ++i)
1160 ast_unref(self->exprs[i]);
1161 vec_free(self->exprs);
1162 for (i = 0; i < vec_size(self->locals); ++i)
1163 ast_delete(self->locals[i]);
1164 vec_free(self->locals);
1165 for (i = 0; i < vec_size(self->collect); ++i)
1166 ast_delete(self->collect[i]);
1167 vec_free(self->collect);
1168 ast_expression_delete((ast_expression*)self);
1172 void ast_block_set_type(ast_block *self, ast_expression *from)
1174 if (self->expression.next)
1175 ast_delete(self->expression.next);
1176 ast_type_adopt(self, from);
1179 ast_function* ast_function_new(lex_ctx_t ctx, const char *name, ast_value *vtype)
1181 ast_instantiate(ast_function, ctx, ast_function_delete);
1184 compile_error(ast_ctx(self), "internal error: ast_function_new condition 0");
1186 } else if (vtype->hasvalue || vtype->expression.vtype != TYPE_FUNCTION) {
1187 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1189 (int)vtype->hasvalue,
1190 vtype->expression.vtype);
1194 self->vtype = vtype;
1195 self->name = name ? util_strdup(name) : NULL;
1196 self->blocks = NULL;
1198 self->labelcount = 0;
1201 self->ir_func = NULL;
1202 self->curblock = NULL;
1204 self->breakblocks = NULL;
1205 self->continueblocks = NULL;
1207 vtype->hasvalue = true;
1208 vtype->constval.vfunc = self;
1210 self->varargs = NULL;
1212 self->fixedparams = NULL;
1213 self->return_value = NULL;
1222 void ast_function_delete(ast_function *self)
1226 mem_d((void*)self->name);
1228 /* ast_value_delete(self->vtype); */
1229 self->vtype->hasvalue = false;
1230 self->vtype->constval.vfunc = NULL;
1231 /* We use unref - if it was stored in a global table it is supposed
1232 * to be deleted from *there*
1234 ast_unref(self->vtype);
1236 for (i = 0; i < vec_size(self->blocks); ++i)
1237 ast_delete(self->blocks[i]);
1238 vec_free(self->blocks);
1239 vec_free(self->breakblocks);
1240 vec_free(self->continueblocks);
1242 ast_delete(self->varargs);
1244 ast_delete(self->argc);
1245 if (self->fixedparams)
1246 ast_unref(self->fixedparams);
1247 if (self->return_value)
1248 ast_unref(self->return_value);
1252 const char* ast_function_label(ast_function *self, const char *prefix)
1258 if (!OPTS_OPTION_BOOL(OPTION_DUMP) &&
1259 !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
1260 !OPTS_OPTION_BOOL(OPTION_DEBUG))
1265 id = (self->labelcount++);
1266 len = strlen(prefix);
1268 from = self->labelbuf + sizeof(self->labelbuf)-1;
1271 *from-- = (id%10) + '0';
1275 memcpy(from - len, prefix, len);
1279 /*********************************************************************/
1281 * by convention you must never pass NULL to the 'ir_value **out'
1282 * parameter. If you really don't care about the output, pass a dummy.
1283 * But I can't imagine a pituation where the output is truly unnecessary.
1286 static void _ast_codegen_output_type(ast_expression *self, ir_value *out)
1288 if (out->vtype == TYPE_FIELD)
1289 out->fieldtype = self->next->vtype;
1290 if (out->vtype == TYPE_FUNCTION)
1291 out->outtype = self->next->vtype;
1294 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1296 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1300 if (self->expression.vtype == TYPE_NIL) {
1301 *out = func->ir_func->owner->nil;
1304 /* NOTE: This is the codegen for a variable used in an expression.
1305 * It is not the codegen to generate the value. For this purpose,
1306 * ast_local_codegen and ast_global_codegen are to be used before this
1307 * is executed. ast_function_codegen should take care of its locals,
1308 * and the ast-user should take care of ast_global_codegen to be used
1309 * on all the globals.
1312 char tname[1024]; /* typename is reserved in C++ */
1313 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1314 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1321 static bool ast_global_array_set(ast_value *self)
1323 size_t count = vec_size(self->initlist);
1326 if (count > self->expression.count) {
1327 compile_error(ast_ctx(self), "too many elements in initializer");
1328 count = self->expression.count;
1330 else if (count < self->expression.count) {
1332 compile_warning(ast_ctx(self), "not all elements are initialized");
1336 for (i = 0; i != count; ++i) {
1337 switch (self->expression.next->vtype) {
1339 if (!ir_value_set_float(self->ir_values[i], self->initlist[i].vfloat))
1343 if (!ir_value_set_vector(self->ir_values[i], self->initlist[i].vvec))
1347 if (!ir_value_set_string(self->ir_values[i], self->initlist[i].vstring))
1351 /* we don't support them in any other place yet either */
1352 compile_error(ast_ctx(self), "TODO: nested arrays");
1355 /* this requiers a bit more work - similar to the fields I suppose */
1356 compile_error(ast_ctx(self), "global of type function not properly generated");
1359 if (!self->initlist[i].vfield) {
1360 compile_error(ast_ctx(self), "field constant without vfield set");
1363 if (!self->initlist[i].vfield->ir_v) {
1364 compile_error(ast_ctx(self), "field constant generated before its field");
1367 if (!ir_value_set_field(self->ir_values[i], self->initlist[i].vfield->ir_v))
1371 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1378 static bool check_array(ast_value *self, ast_value *array)
1380 if (array->expression.flags & AST_FLAG_ARRAY_INIT && !array->initlist) {
1381 compile_error(ast_ctx(self), "array without size: %s", self->name);
1384 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1385 if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1386 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1392 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1396 if (self->expression.vtype == TYPE_NIL) {
1397 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1401 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1403 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->vtype);
1406 func->context = ast_ctx(self);
1407 func->value->context = ast_ctx(self);
1409 self->constval.vfunc->ir_func = func;
1410 self->ir_v = func->value;
1411 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1412 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1413 if (self->expression.flags & AST_FLAG_ERASEABLE)
1414 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1415 /* The function is filled later on ast_function_codegen... */
1419 if (isfield && self->expression.vtype == TYPE_FIELD) {
1420 ast_expression *fieldtype = self->expression.next;
1422 if (self->hasvalue) {
1423 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1427 if (fieldtype->vtype == TYPE_ARRAY) {
1432 ast_expression *elemtype;
1434 ast_value *array = (ast_value*)fieldtype;
1436 if (!ast_istype(fieldtype, ast_value)) {
1437 compile_error(ast_ctx(self), "internal error: ast_value required");
1441 if (!check_array(self, array))
1444 elemtype = array->expression.next;
1445 vtype = elemtype->vtype;
1447 v = ir_builder_create_field(ir, self->name, vtype);
1449 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1452 v->context = ast_ctx(self);
1453 v->unique_life = true;
1455 array->ir_v = self->ir_v = v;
1457 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1458 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1459 if (self->expression.flags & AST_FLAG_ERASEABLE)
1460 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1462 namelen = strlen(self->name);
1463 name = (char*)mem_a(namelen + 16);
1464 util_strncpy(name, self->name, namelen);
1466 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1467 array->ir_values[0] = v;
1468 for (ai = 1; ai < array->expression.count; ++ai) {
1469 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1470 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1471 if (!array->ir_values[ai]) {
1473 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1476 array->ir_values[ai]->context = ast_ctx(self);
1477 array->ir_values[ai]->unique_life = true;
1478 array->ir_values[ai]->locked = true;
1479 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1480 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1486 v = ir_builder_create_field(ir, self->name, self->expression.next->vtype);
1489 v->context = ast_ctx(self);
1491 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1492 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1494 if (self->expression.flags & AST_FLAG_ERASEABLE)
1495 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1500 if (self->expression.vtype == TYPE_ARRAY) {
1505 ast_expression *elemtype = self->expression.next;
1506 int vtype = elemtype->vtype;
1508 if (self->expression.flags & AST_FLAG_ARRAY_INIT && !self->expression.count) {
1509 compile_error(ast_ctx(self), "array `%s' has no size", self->name);
1513 /* same as with field arrays */
1514 if (!check_array(self, self))
1517 v = ir_builder_create_global(ir, self->name, vtype);
1519 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1522 v->context = ast_ctx(self);
1523 v->unique_life = true;
1526 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1527 v->flags |= IR_FLAG_INCLUDE_DEF;
1528 if (self->expression.flags & AST_FLAG_ERASEABLE)
1529 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1531 namelen = strlen(self->name);
1532 name = (char*)mem_a(namelen + 16);
1533 util_strncpy(name, self->name, namelen);
1535 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1536 self->ir_values[0] = v;
1537 for (ai = 1; ai < self->expression.count; ++ai) {
1538 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1539 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1540 if (!self->ir_values[ai]) {
1542 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1545 self->ir_values[ai]->context = ast_ctx(self);
1546 self->ir_values[ai]->unique_life = true;
1547 self->ir_values[ai]->locked = true;
1548 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1549 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1555 /* Arrays don't do this since there's no "array" value which spans across the
1558 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1560 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1563 codegen_output_type(self, v);
1564 v->context = ast_ctx(self);
1567 /* link us to the ir_value */
1571 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1572 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1573 if (self->expression.flags & AST_FLAG_ERASEABLE)
1574 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1577 if (self->hasvalue) {
1578 switch (self->expression.vtype)
1581 if (!ir_value_set_float(v, self->constval.vfloat))
1585 if (!ir_value_set_vector(v, self->constval.vvec))
1589 if (!ir_value_set_string(v, self->constval.vstring))
1593 ast_global_array_set(self);
1596 compile_error(ast_ctx(self), "global of type function not properly generated");
1598 /* Cannot generate an IR value for a function,
1599 * need a pointer pointing to a function rather.
1602 if (!self->constval.vfield) {
1603 compile_error(ast_ctx(self), "field constant without vfield set");
1606 if (!self->constval.vfield->ir_v) {
1607 compile_error(ast_ctx(self), "field constant generated before its field");
1610 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1614 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1620 error: /* clean up */
1621 if(v) ir_value_delete(v);
1625 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1629 if (self->expression.vtype == TYPE_NIL) {
1630 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1634 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1636 /* Do we allow local functions? I think not...
1637 * this is NOT a function pointer atm.
1642 if (self->expression.vtype == TYPE_ARRAY) {
1647 ast_expression *elemtype = self->expression.next;
1648 int vtype = elemtype->vtype;
1650 func->flags |= IR_FLAG_HAS_ARRAYS;
1652 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1653 compile_error(ast_ctx(self), "array-parameters are not supported");
1657 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1658 if (!check_array(self, self))
1661 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1662 if (!self->ir_values) {
1663 compile_error(ast_ctx(self), "failed to allocate array values");
1667 v = ir_function_create_local(func, self->name, vtype, param);
1669 compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1672 v->context = ast_ctx(self);
1673 v->unique_life = true;
1676 namelen = strlen(self->name);
1677 name = (char*)mem_a(namelen + 16);
1678 util_strncpy(name, self->name, namelen);
1680 self->ir_values[0] = v;
1681 for (ai = 1; ai < self->expression.count; ++ai) {
1682 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1683 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1684 if (!self->ir_values[ai]) {
1685 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1688 self->ir_values[ai]->context = ast_ctx(self);
1689 self->ir_values[ai]->unique_life = true;
1690 self->ir_values[ai]->locked = true;
1696 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1699 codegen_output_type(self, v);
1700 v->context = ast_ctx(self);
1703 /* A constant local... hmmm...
1704 * I suppose the IR will have to deal with this
1706 if (self->hasvalue) {
1707 switch (self->expression.vtype)
1710 if (!ir_value_set_float(v, self->constval.vfloat))
1714 if (!ir_value_set_vector(v, self->constval.vvec))
1718 if (!ir_value_set_string(v, self->constval.vstring))
1722 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1727 /* link us to the ir_value */
1731 if (!ast_generate_accessors(self, func->owner))
1735 error: /* clean up */
1740 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1743 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1744 if (!self->setter || !self->getter)
1746 for (i = 0; i < self->expression.count; ++i) {
1747 if (!self->ir_values) {
1748 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1751 if (!self->ir_values[i]) {
1752 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1755 if (self->ir_values[i]->life) {
1756 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1761 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1763 if (!ast_global_codegen (self->setter, ir, false) ||
1764 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1765 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1767 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1768 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1773 if (!ast_global_codegen (self->getter, ir, false) ||
1774 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1775 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1777 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1778 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1782 for (i = 0; i < self->expression.count; ++i) {
1783 vec_free(self->ir_values[i]->life);
1785 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1789 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1794 ast_expression_codegen *cgen;
1799 irf = self->ir_func;
1801 compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1805 /* fill the parameter list */
1806 ec = &self->vtype->expression;
1807 for (i = 0; i < vec_size(ec->params); ++i)
1809 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1810 vec_push(irf->params, ec->params[i]->expression.next->vtype);
1812 vec_push(irf->params, ec->params[i]->expression.vtype);
1813 if (!self->builtin) {
1814 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1819 if (self->varargs) {
1820 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1822 irf->max_varargs = self->varargs->expression.count;
1825 if (self->builtin) {
1826 irf->builtin = self->builtin;
1830 /* have a local return value variable? */
1831 if (self->return_value) {
1832 if (!ast_local_codegen(self->return_value, self->ir_func, false))
1836 if (!vec_size(self->blocks)) {
1837 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1841 irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1842 if (!self->curblock) {
1843 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1851 if (!ast_local_codegen(self->argc, self->ir_func, true))
1853 cgen = self->argc->expression.codegen;
1854 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1856 cgen = self->fixedparams->expression.codegen;
1857 if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1859 sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1860 ast_function_label(self, "va_count"), INSTR_SUB_F,
1861 ir_builder_get_va_count(ir), fixed);
1864 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1871 for (i = 0; i < vec_size(self->blocks); ++i) {
1872 cgen = self->blocks[i]->expression.codegen;
1873 if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1877 /* TODO: check return types */
1878 if (!self->curblock->final)
1880 if (!self->vtype->expression.next ||
1881 self->vtype->expression.next->vtype == TYPE_VOID)
1883 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1885 else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1887 if (self->return_value) {
1888 cgen = self->return_value->expression.codegen;
1889 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1891 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1893 else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1894 "control reaches end of non-void function (`%s`) via %s",
1895 self->name, self->curblock->label))
1899 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1905 static bool starts_a_label(ast_expression *ex)
1907 while (ex && ast_istype(ex, ast_block)) {
1908 ast_block *b = (ast_block*)ex;
1913 return ast_istype(ex, ast_label);
1916 /* Note, you will not see ast_block_codegen generate ir_blocks.
1917 * To the AST and the IR, blocks are 2 different things.
1918 * In the AST it represents a block of code, usually enclosed in
1919 * curly braces {...}.
1920 * While in the IR it represents a block in terms of control-flow.
1922 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1926 /* We don't use this
1927 * Note: an ast-representation using the comma-operator
1928 * of the form: (a, b, c) = x should not assign to c...
1931 compile_error(ast_ctx(self), "not an l-value (code-block)");
1935 if (self->expression.outr) {
1936 *out = self->expression.outr;
1940 /* output is NULL at first, we'll have each expression
1941 * assign to out output, thus, a comma-operator represention
1942 * using an ast_block will return the last generated value,
1943 * so: (b, c) + a executed both b and c, and returns c,
1944 * which is then added to a.
1948 /* generate locals */
1949 for (i = 0; i < vec_size(self->locals); ++i)
1951 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1952 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1953 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1958 for (i = 0; i < vec_size(self->exprs); ++i)
1960 ast_expression_codegen *gen;
1961 if (func->curblock->final && !starts_a_label(self->exprs[i])) {
1962 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1966 gen = self->exprs[i]->codegen;
1967 if (!(*gen)(self->exprs[i], func, false, out))
1971 self->expression.outr = *out;
1976 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1978 ast_expression_codegen *cgen;
1979 ir_value *left = NULL;
1980 ir_value *right = NULL;
1984 ast_array_index *ai = NULL;
1986 if (lvalue && self->expression.outl) {
1987 *out = self->expression.outl;
1991 if (!lvalue && self->expression.outr) {
1992 *out = self->expression.outr;
1996 if (ast_istype(self->dest, ast_array_index))
1999 ai = (ast_array_index*)self->dest;
2000 idx = (ast_value*)ai->index;
2002 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2007 /* we need to call the setter */
2008 ir_value *iridx, *funval;
2012 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2016 arr = (ast_value*)ai->array;
2017 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2018 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2022 cgen = idx->expression.codegen;
2023 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2026 cgen = arr->setter->expression.codegen;
2027 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2030 cgen = self->source->codegen;
2031 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2034 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2037 ir_call_param(call, iridx);
2038 ir_call_param(call, right);
2039 self->expression.outr = right;
2045 cgen = self->dest->codegen;
2047 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
2049 self->expression.outl = left;
2051 cgen = self->source->codegen;
2053 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2056 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
2058 self->expression.outr = right;
2061 /* Theoretically, an assinment returns its left side as an
2062 * lvalue, if we don't need an lvalue though, we return
2063 * the right side as an rvalue, otherwise we have to
2064 * somehow know whether or not we need to dereference the pointer
2065 * on the left side - that is: OP_LOAD if it was an address.
2066 * Also: in original QC we cannot OP_LOADP *anyway*.
2068 *out = (lvalue ? left : right);
2073 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
2075 ast_expression_codegen *cgen;
2076 ir_value *left, *right;
2078 /* A binary operation cannot yield an l-value */
2080 compile_error(ast_ctx(self), "not an l-value (binop)");
2084 if (self->expression.outr) {
2085 *out = self->expression.outr;
2089 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
2090 (self->op == INSTR_AND || self->op == INSTR_OR))
2092 /* NOTE: The short-logic path will ignore right_first */
2094 /* short circuit evaluation */
2095 ir_block *other, *merge;
2096 ir_block *from_left, *from_right;
2100 /* prepare end-block */
2101 merge_id = vec_size(func->ir_func->blocks);
2102 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
2104 /* generate the left expression */
2105 cgen = self->left->codegen;
2106 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2108 /* remember the block */
2109 from_left = func->curblock;
2111 /* create a new block for the right expression */
2112 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
2113 if (self->op == INSTR_AND) {
2114 /* on AND: left==true -> other */
2115 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
2118 /* on OR: left==false -> other */
2119 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
2122 /* use the likely flag */
2123 vec_last(func->curblock->instr)->likely = true;
2125 /* enter the right-expression's block */
2126 func->curblock = other;
2128 cgen = self->right->codegen;
2129 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2131 /* remember block */
2132 from_right = func->curblock;
2134 /* jump to the merge block */
2135 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
2138 vec_remove(func->ir_func->blocks, merge_id, 1);
2139 vec_push(func->ir_func->blocks, merge);
2141 func->curblock = merge;
2142 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
2143 ast_function_label(func, "sce_value"),
2144 self->expression.vtype);
2145 ir_phi_add(phi, from_left, left);
2146 ir_phi_add(phi, from_right, right);
2147 *out = ir_phi_value(phi);
2151 if (!OPTS_FLAG(PERL_LOGIC)) {
2153 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
2154 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2155 ast_function_label(func, "sce_bool_v"),
2159 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2160 ast_function_label(func, "sce_bool"),
2165 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
2166 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2167 ast_function_label(func, "sce_bool_s"),
2171 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2172 ast_function_label(func, "sce_bool"),
2178 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
2179 ast_function_label(func, "sce_bool"),
2180 INSTR_AND, *out, *out);
2186 self->expression.outr = *out;
2187 codegen_output_type(self, *out);
2191 if (self->right_first) {
2192 cgen = self->right->codegen;
2193 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2195 cgen = self->left->codegen;
2196 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2199 cgen = self->left->codegen;
2200 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2202 cgen = self->right->codegen;
2203 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2207 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
2208 self->op, left, right);
2211 self->expression.outr = *out;
2212 codegen_output_type(self, *out);
2217 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
2219 ast_expression_codegen *cgen;
2220 ir_value *leftl = NULL, *leftr, *right, *bin;
2224 ast_array_index *ai = NULL;
2225 ir_value *iridx = NULL;
2227 if (lvalue && self->expression.outl) {
2228 *out = self->expression.outl;
2232 if (!lvalue && self->expression.outr) {
2233 *out = self->expression.outr;
2237 if (ast_istype(self->dest, ast_array_index))
2240 ai = (ast_array_index*)self->dest;
2241 idx = (ast_value*)ai->index;
2243 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2247 /* for a binstore we need both an lvalue and an rvalue for the left side */
2248 /* rvalue of destination! */
2250 cgen = idx->expression.codegen;
2251 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2254 cgen = self->dest->codegen;
2255 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2258 /* source as rvalue only */
2259 cgen = self->source->codegen;
2260 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2263 /* now the binary */
2264 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2265 self->opbin, leftr, right);
2266 self->expression.outr = bin;
2270 /* we need to call the setter */
2275 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2279 arr = (ast_value*)ai->array;
2280 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2281 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2285 cgen = arr->setter->expression.codegen;
2286 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2289 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2292 ir_call_param(call, iridx);
2293 ir_call_param(call, bin);
2294 self->expression.outr = bin;
2296 /* now store them */
2297 cgen = self->dest->codegen;
2298 /* lvalue of destination */
2299 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2301 self->expression.outl = leftl;
2303 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2305 self->expression.outr = bin;
2308 /* Theoretically, an assinment returns its left side as an
2309 * lvalue, if we don't need an lvalue though, we return
2310 * the right side as an rvalue, otherwise we have to
2311 * somehow know whether or not we need to dereference the pointer
2312 * on the left side - that is: OP_LOAD if it was an address.
2313 * Also: in original QC we cannot OP_LOADP *anyway*.
2315 *out = (lvalue ? leftl : bin);
2320 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2322 ast_expression_codegen *cgen;
2325 /* An unary operation cannot yield an l-value */
2327 compile_error(ast_ctx(self), "not an l-value (binop)");
2331 if (self->expression.outr) {
2332 *out = self->expression.outr;
2336 cgen = self->operand->codegen;
2338 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2341 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2345 self->expression.outr = *out;
2350 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2352 ast_expression_codegen *cgen;
2357 /* In the context of a return operation, we don't actually return
2361 compile_error(ast_ctx(self), "return-expression is not an l-value");
2365 if (self->expression.outr) {
2366 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2369 self->expression.outr = (ir_value*)1;
2371 if (self->operand) {
2372 cgen = self->operand->codegen;
2374 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2377 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2380 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2387 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2389 ast_expression_codegen *cgen;
2390 ir_value *ent, *field;
2392 /* This function needs to take the 'lvalue' flag into account!
2393 * As lvalue we provide a field-pointer, as rvalue we provide the
2397 if (lvalue && self->expression.outl) {
2398 *out = self->expression.outl;
2402 if (!lvalue && self->expression.outr) {
2403 *out = self->expression.outr;
2407 cgen = self->entity->codegen;
2408 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2411 cgen = self->field->codegen;
2412 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2417 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2420 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2421 ent, field, self->expression.vtype);
2422 /* Done AFTER error checking:
2423 codegen_output_type(self, *out);
2427 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2428 (lvalue ? "ADDRESS" : "FIELD"),
2429 type_name[self->expression.vtype]);
2433 codegen_output_type(self, *out);
2436 self->expression.outl = *out;
2438 self->expression.outr = *out;
2440 /* Hm that should be it... */
2444 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2446 ast_expression_codegen *cgen;
2449 /* in QC this is always an lvalue */
2450 if (lvalue && self->rvalue) {
2451 compile_error(ast_ctx(self), "not an l-value (member access)");
2454 if (self->expression.outl) {
2455 *out = self->expression.outl;
2459 cgen = self->owner->codegen;
2460 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2463 if (vec->vtype != TYPE_VECTOR &&
2464 !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2469 *out = ir_value_vector_member(vec, self->field);
2470 self->expression.outl = *out;
2472 return (*out != NULL);
2475 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2480 if (!lvalue && self->expression.outr) {
2481 *out = self->expression.outr;
2484 if (lvalue && self->expression.outl) {
2485 *out = self->expression.outl;
2489 if (!ast_istype(self->array, ast_value)) {
2490 compile_error(ast_ctx(self), "array indexing this way is not supported");
2491 /* note this would actually be pointer indexing because the left side is
2492 * not an actual array but (hopefully) an indexable expression.
2493 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2494 * support this path will be filled.
2499 arr = (ast_value*)self->array;
2500 idx = (ast_value*)self->index;
2502 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2503 /* Time to use accessor functions */
2504 ast_expression_codegen *cgen;
2505 ir_value *iridx, *funval;
2509 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2514 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2518 cgen = self->index->codegen;
2519 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2522 cgen = arr->getter->expression.codegen;
2523 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2526 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2529 ir_call_param(call, iridx);
2531 *out = ir_call_value(call);
2532 self->expression.outr = *out;
2533 (*out)->vtype = self->expression.vtype;
2534 codegen_output_type(self, *out);
2538 if (idx->expression.vtype == TYPE_FLOAT) {
2539 unsigned int arridx = idx->constval.vfloat;
2540 if (arridx >= self->array->count)
2542 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2545 *out = arr->ir_values[arridx];
2547 else if (idx->expression.vtype == TYPE_INTEGER) {
2548 unsigned int arridx = idx->constval.vint;
2549 if (arridx >= self->array->count)
2551 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2554 *out = arr->ir_values[arridx];
2557 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2560 (*out)->vtype = self->expression.vtype;
2561 codegen_output_type(self, *out);
2565 bool ast_argpipe_codegen(ast_argpipe *self, ast_function *func, bool lvalue, ir_value **out)
2569 compile_error(ast_ctx(self), "argpipe node: not an lvalue");
2574 compile_error(ast_ctx(self), "TODO: argpipe codegen not implemented");
2578 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2580 ast_expression_codegen *cgen;
2588 ir_block *ontrue_endblock = NULL;
2589 ir_block *onfalse_endblock = NULL;
2590 ir_block *merge = NULL;
2593 /* We don't output any value, thus also don't care about r/lvalue */
2597 if (self->expression.outr) {
2598 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2601 self->expression.outr = (ir_value*)1;
2603 /* generate the condition */
2604 cgen = self->cond->codegen;
2605 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2607 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2608 cond = func->curblock;
2610 /* try constant folding away the condition */
2611 if ((fold = fold_cond_ifthen(condval, func, self)) != -1)
2614 if (self->on_true) {
2615 /* create on-true block */
2616 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2620 /* enter the block */
2621 func->curblock = ontrue;
2624 cgen = self->on_true->codegen;
2625 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2628 /* we now need to work from the current endpoint */
2629 ontrue_endblock = func->curblock;
2634 if (self->on_false) {
2635 /* create on-false block */
2636 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2640 /* enter the block */
2641 func->curblock = onfalse;
2644 cgen = self->on_false->codegen;
2645 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2648 /* we now need to work from the current endpoint */
2649 onfalse_endblock = func->curblock;
2653 /* Merge block were they all merge in to */
2654 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2656 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2659 /* add jumps ot the merge block */
2660 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2662 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2665 /* Now enter the merge block */
2666 func->curblock = merge;
2669 /* we create the if here, that way all blocks are ordered :)
2671 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2672 (ontrue ? ontrue : merge),
2673 (onfalse ? onfalse : merge)))
2681 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2683 ast_expression_codegen *cgen;
2686 ir_value *trueval, *falseval;
2689 ir_block *cond = func->curblock;
2690 ir_block *cond_out = NULL;
2691 ir_block *ontrue, *ontrue_out = NULL;
2692 ir_block *onfalse, *onfalse_out = NULL;
2696 /* Ternary can never create an lvalue... */
2700 /* In theory it shouldn't be possible to pass through a node twice, but
2701 * in case we add any kind of optimization pass for the AST itself, it
2702 * may still happen, thus we remember a created ir_value and simply return one
2703 * if it already exists.
2705 if (self->expression.outr) {
2706 *out = self->expression.outr;
2710 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2712 /* generate the condition */
2713 func->curblock = cond;
2714 cgen = self->cond->codegen;
2715 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2717 cond_out = func->curblock;
2719 /* try constant folding away the condition */
2720 if ((fold = fold_cond_ternary(condval, func, self)) != -1)
2723 /* create on-true block */
2724 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2729 /* enter the block */
2730 func->curblock = ontrue;
2733 cgen = self->on_true->codegen;
2734 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2737 ontrue_out = func->curblock;
2740 /* create on-false block */
2741 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2746 /* enter the block */
2747 func->curblock = onfalse;
2750 cgen = self->on_false->codegen;
2751 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2754 onfalse_out = func->curblock;
2757 /* create merge block */
2758 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2761 /* jump to merge block */
2762 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2764 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2767 /* create if instruction */
2768 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2771 /* Now enter the merge block */
2772 func->curblock = merge;
2774 /* Here, now, we need a PHI node
2775 * but first some sanity checking...
2777 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2778 /* error("ternary with different types on the two sides"); */
2779 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2784 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2786 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2789 ir_phi_add(phi, ontrue_out, trueval);
2790 ir_phi_add(phi, onfalse_out, falseval);
2792 self->expression.outr = ir_phi_value(phi);
2793 *out = self->expression.outr;
2795 codegen_output_type(self, *out);
2800 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2802 ast_expression_codegen *cgen;
2804 ir_value *dummy = NULL;
2805 ir_value *precond = NULL;
2806 ir_value *postcond = NULL;
2808 /* Since we insert some jumps "late" so we have blocks
2809 * ordered "nicely", we need to keep track of the actual end-blocks
2810 * of expressions to add the jumps to.
2812 ir_block *bbody = NULL, *end_bbody = NULL;
2813 ir_block *bprecond = NULL, *end_bprecond = NULL;
2814 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2815 ir_block *bincrement = NULL, *end_bincrement = NULL;
2816 ir_block *bout = NULL, *bin = NULL;
2818 /* let's at least move the outgoing block to the end */
2821 /* 'break' and 'continue' need to be able to find the right blocks */
2822 ir_block *bcontinue = NULL;
2823 ir_block *bbreak = NULL;
2825 ir_block *tmpblock = NULL;
2830 if (self->expression.outr) {
2831 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2834 self->expression.outr = (ir_value*)1;
2837 * Should we ever need some kind of block ordering, better make this function
2838 * move blocks around than write a block ordering algorithm later... after all
2839 * the ast and ir should work together, not against each other.
2842 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2843 * anyway if for example it contains a ternary.
2847 cgen = self->initexpr->codegen;
2848 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2852 /* Store the block from which we enter this chaos */
2853 bin = func->curblock;
2855 /* The pre-loop condition needs its own block since we
2856 * need to be able to jump to the start of that expression.
2860 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2864 /* the pre-loop-condition the least important place to 'continue' at */
2865 bcontinue = bprecond;
2868 func->curblock = bprecond;
2871 cgen = self->precond->codegen;
2872 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2875 end_bprecond = func->curblock;
2877 bprecond = end_bprecond = NULL;
2880 /* Now the next blocks won't be ordered nicely, but we need to
2881 * generate them this early for 'break' and 'continue'.
2883 if (self->increment) {
2884 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2887 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2889 bincrement = end_bincrement = NULL;
2892 if (self->postcond) {
2893 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2896 bcontinue = bpostcond; /* postcond comes before the increment */
2898 bpostcond = end_bpostcond = NULL;
2901 bout_id = vec_size(func->ir_func->blocks);
2902 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2907 /* The loop body... */
2908 /* if (self->body) */
2910 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2915 func->curblock = bbody;
2917 vec_push(func->breakblocks, bbreak);
2919 vec_push(func->continueblocks, bcontinue);
2921 vec_push(func->continueblocks, bbody);
2925 cgen = self->body->codegen;
2926 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2930 end_bbody = func->curblock;
2931 vec_pop(func->breakblocks);
2932 vec_pop(func->continueblocks);
2935 /* post-loop-condition */
2939 func->curblock = bpostcond;
2942 cgen = self->postcond->codegen;
2943 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2946 end_bpostcond = func->curblock;
2949 /* The incrementor */
2950 if (self->increment)
2953 func->curblock = bincrement;
2956 cgen = self->increment->codegen;
2957 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2960 end_bincrement = func->curblock;
2963 /* In any case now, we continue from the outgoing block */
2964 func->curblock = bout;
2966 /* Now all blocks are in place */
2967 /* From 'bin' we jump to whatever comes first */
2968 if (bprecond) tmpblock = bprecond;
2969 else tmpblock = bbody; /* can never be null */
2972 else if (bpostcond) tmpblock = bpostcond;
2973 else tmpblock = bout;
2976 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2982 ir_block *ontrue, *onfalse;
2983 ontrue = bbody; /* can never be null */
2985 /* all of this is dead code
2986 else if (bincrement) ontrue = bincrement;
2987 else ontrue = bpostcond;
2991 if (self->pre_not) {
2996 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
3003 if (bincrement) tmpblock = bincrement;
3004 else if (bpostcond) tmpblock = bpostcond;
3005 else if (bprecond) tmpblock = bprecond;
3006 else tmpblock = bbody;
3007 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
3011 /* from increment */
3014 if (bpostcond) tmpblock = bpostcond;
3015 else if (bprecond) tmpblock = bprecond;
3016 else if (bbody) tmpblock = bbody;
3017 else tmpblock = bout;
3018 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
3025 ir_block *ontrue, *onfalse;
3026 if (bprecond) ontrue = bprecond;
3027 else ontrue = bbody; /* can never be null */
3029 /* all of this is dead code
3030 else if (bincrement) ontrue = bincrement;
3031 else ontrue = bpostcond;
3035 if (self->post_not) {
3040 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
3044 /* Move 'bout' to the end */
3045 vec_remove(func->ir_func->blocks, bout_id, 1);
3046 vec_push(func->ir_func->blocks, bout);
3051 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
3058 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
3062 if (self->expression.outr) {
3063 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
3066 self->expression.outr = (ir_value*)1;
3068 if (self->is_continue)
3069 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
3071 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
3074 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
3078 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
3083 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
3085 ast_expression_codegen *cgen;
3087 ast_switch_case *def_case = NULL;
3088 ir_block *def_bfall = NULL;
3089 ir_block *def_bfall_to = NULL;
3090 bool set_def_bfall_to = false;
3092 ir_value *dummy = NULL;
3093 ir_value *irop = NULL;
3094 ir_block *bout = NULL;
3095 ir_block *bfall = NULL;
3103 compile_error(ast_ctx(self), "switch expression is not an l-value");
3107 if (self->expression.outr) {
3108 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
3111 self->expression.outr = (ir_value*)1;
3116 cgen = self->operand->codegen;
3117 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
3120 if (!vec_size(self->cases))
3123 cmpinstr = type_eq_instr[irop->vtype];
3124 if (cmpinstr >= VINSTR_END) {
3125 ast_type_to_string(self->operand, typestr, sizeof(typestr));
3126 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
3130 bout_id = vec_size(func->ir_func->blocks);
3131 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
3135 /* setup the break block */
3136 vec_push(func->breakblocks, bout);
3138 /* Now create all cases */
3139 for (c = 0; c < vec_size(self->cases); ++c) {
3140 ir_value *cond, *val;
3141 ir_block *bcase, *bnot;
3144 ast_switch_case *swcase = &self->cases[c];
3146 if (swcase->value) {
3147 /* A regular case */
3148 /* generate the condition operand */
3149 cgen = swcase->value->codegen;
3150 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
3152 /* generate the condition */
3153 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
3157 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
3158 bnot_id = vec_size(func->ir_func->blocks);
3159 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
3160 if (!bcase || !bnot)
3162 if (set_def_bfall_to) {
3163 set_def_bfall_to = false;
3164 def_bfall_to = bcase;
3166 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
3169 /* Make the previous case-end fall through */
3170 if (bfall && !bfall->final) {
3171 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
3175 /* enter the case */
3176 func->curblock = bcase;
3177 cgen = swcase->code->codegen;
3178 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
3181 /* remember this block to fall through from */
3182 bfall = func->curblock;
3184 /* enter the else and move it down */
3185 func->curblock = bnot;
3186 vec_remove(func->ir_func->blocks, bnot_id, 1);
3187 vec_push(func->ir_func->blocks, bnot);
3189 /* The default case */
3190 /* Remember where to fall through from: */
3193 /* remember which case it was */
3195 /* And the next case will be remembered */
3196 set_def_bfall_to = true;
3200 /* Jump from the last bnot to bout */
3201 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
3203 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
3208 /* If there was a default case, put it down here */
3212 /* No need to create an extra block */
3213 bcase = func->curblock;
3215 /* Insert the fallthrough jump */
3216 if (def_bfall && !def_bfall->final) {
3217 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
3221 /* Now generate the default code */
3222 cgen = def_case->code->codegen;
3223 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
3226 /* see if we need to fall through */
3227 if (def_bfall_to && !func->curblock->final)
3229 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
3234 /* Jump from the last bnot to bout */
3235 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
3237 /* enter the outgoing block */
3238 func->curblock = bout;
3240 /* restore the break block */
3241 vec_pop(func->breakblocks);
3243 /* Move 'bout' to the end, it's nicer */
3244 vec_remove(func->ir_func->blocks, bout_id, 1);
3245 vec_push(func->ir_func->blocks, bout);
3250 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3255 if (self->undefined) {
3256 compile_error(ast_ctx(self), "internal error: ast_label never defined");
3262 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3266 /* simply create a new block and jump to it */
3267 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3268 if (!self->irblock) {
3269 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3272 if (!func->curblock->final) {
3273 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3277 /* enter the new block */
3278 func->curblock = self->irblock;
3280 /* Generate all the leftover gotos */
3281 for (i = 0; i < vec_size(self->gotos); ++i) {
3282 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
3289 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3293 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3297 if (self->target->irblock) {
3298 if (self->irblock_from) {
3299 /* we already tried once, this is the callback */
3300 self->irblock_from->final = false;
3301 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3302 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3308 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3309 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3316 /* the target has not yet been created...
3317 * close this block in a sneaky way:
3319 func->curblock->final = true;
3320 self->irblock_from = func->curblock;
3321 ast_label_register_goto(self->target, self);
3327 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3329 ast_expression_codegen *cgen;
3331 ir_instr *callinstr;
3334 ir_value *funval = NULL;
3336 /* return values are never lvalues */
3338 compile_error(ast_ctx(self), "not an l-value (function call)");
3342 if (self->expression.outr) {
3343 *out = self->expression.outr;
3347 cgen = self->func->codegen;
3348 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3356 for (i = 0; i < vec_size(self->params); ++i)
3359 ast_expression *expr = self->params[i];
3361 cgen = expr->codegen;
3362 if (!(*cgen)(expr, func, false, ¶m))
3366 vec_push(params, param);
3369 /* varargs counter */
3370 if (self->va_count) {
3372 ir_builder *builder = func->curblock->owner->owner;
3373 cgen = self->va_count->codegen;
3374 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3376 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3377 ir_builder_get_va_count(builder), va_count))
3383 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3384 ast_function_label(func, "call"),
3385 funval, !!(self->func->flags & AST_FLAG_NORETURN));
3389 for (i = 0; i < vec_size(params); ++i) {
3390 ir_call_param(callinstr, params[i]);
3393 *out = ir_call_value(callinstr);
3394 self->expression.outr = *out;
3396 codegen_output_type(self, *out);