6 * Permission is hereby granted, free of charge, to any person obtaining a copy of
7 * this software and associated documentation files (the "Software"), to deal in
8 * the Software without restriction, including without limitation the rights to
9 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
10 * of the Software, and to permit persons to whom the Software is furnished to do
11 * so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
31 #define ast_instantiate(T, ctx, destroyfn) \
32 T* self = (T*)mem_a(sizeof(T)); \
36 ast_node_init((ast_node*)self, ctx, TYPE_##T); \
37 ( (ast_node*)self )->node.destroy = (ast_node_delete*)destroyfn
40 /* It must not be possible to get here. */
41 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
44 con_err("ast node missing destroy()\n");
48 /* Initialize main ast node aprts */
49 static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
51 self->node.context = ctx;
52 self->node.destroy = &_ast_node_destroy;
53 self->node.keep = false;
54 self->node.nodetype = nodetype;
55 self->node.side_effects = false;
58 /* weight and side effects */
59 static void _ast_propagate_effects(ast_node *self, ast_node *other)
61 if (ast_side_effects(other))
62 ast_side_effects(self) = true;
64 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
66 /* General expression initialization */
67 static void ast_expression_init(ast_expression *self,
68 ast_expression_codegen *codegen)
70 self->expression.codegen = codegen;
71 self->expression.vtype = TYPE_VOID;
72 self->expression.next = NULL;
73 self->expression.outl = NULL;
74 self->expression.outr = NULL;
75 self->expression.params = NULL;
76 self->expression.count = 0;
77 self->expression.flags = 0;
80 static void ast_expression_delete(ast_expression *self)
83 if (self->expression.next)
84 ast_delete(self->expression.next);
85 for (i = 0; i < vec_size(self->expression.params); ++i) {
86 ast_delete(self->expression.params[i]);
88 vec_free(self->expression.params);
91 static void ast_expression_delete_full(ast_expression *self)
93 ast_expression_delete(self);
97 ast_value* ast_value_copy(const ast_value *self)
100 const ast_expression_common *fromex;
101 ast_expression_common *selfex;
102 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
103 if (self->expression.next) {
104 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
105 if (!cp->expression.next) {
106 ast_value_delete(cp);
110 fromex = &self->expression;
111 selfex = &cp->expression;
112 selfex->count = fromex->count;
113 selfex->flags = fromex->flags;
114 for (i = 0; i < vec_size(fromex->params); ++i) {
115 ast_value *v = ast_value_copy(fromex->params[i]);
117 ast_value_delete(cp);
120 vec_push(selfex->params, v);
125 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
128 const ast_expression_common *fromex;
129 ast_expression_common *selfex;
130 self->expression.vtype = other->expression.vtype;
131 if (other->expression.next) {
132 self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
133 if (!self->expression.next)
136 fromex = &other->expression;
137 selfex = &self->expression;
138 selfex->count = fromex->count;
139 selfex->flags = fromex->flags;
140 for (i = 0; i < vec_size(fromex->params); ++i) {
141 ast_value *v = ast_value_copy(fromex->params[i]);
144 vec_push(selfex->params, v);
149 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
151 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
152 ast_expression_init(self, NULL);
153 self->expression.codegen = NULL;
154 self->expression.next = NULL;
155 self->expression.vtype = vtype;
159 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
162 const ast_expression_common *fromex;
163 ast_expression_common *selfex;
169 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
170 ast_expression_init(self, NULL);
172 fromex = &ex->expression;
173 selfex = &self->expression;
175 /* This may never be codegen()d */
176 selfex->codegen = NULL;
178 selfex->vtype = fromex->vtype;
181 selfex->next = ast_type_copy(ctx, fromex->next);
183 ast_expression_delete_full(self);
190 selfex->count = fromex->count;
191 selfex->flags = fromex->flags;
192 for (i = 0; i < vec_size(fromex->params); ++i) {
193 ast_value *v = ast_value_copy(fromex->params[i]);
195 ast_expression_delete_full(self);
198 vec_push(selfex->params, v);
205 bool ast_compare_type(ast_expression *a, ast_expression *b)
207 if (a->expression.vtype == TYPE_NIL ||
208 b->expression.vtype == TYPE_NIL)
210 if (a->expression.vtype != b->expression.vtype)
212 if (!a->expression.next != !b->expression.next)
214 if (vec_size(a->expression.params) != vec_size(b->expression.params))
216 if ((a->expression.flags & AST_FLAG_TYPE_MASK) !=
217 (b->expression.flags & AST_FLAG_TYPE_MASK) )
221 if (vec_size(a->expression.params)) {
223 for (i = 0; i < vec_size(a->expression.params); ++i) {
224 if (!ast_compare_type((ast_expression*)a->expression.params[i],
225 (ast_expression*)b->expression.params[i]))
229 if (a->expression.next)
230 return ast_compare_type(a->expression.next, b->expression.next);
234 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
241 if (pos + 6 >= bufsize)
243 strcpy(buf + pos, "(null)");
247 if (pos + 1 >= bufsize)
250 switch (e->expression.vtype) {
252 strcpy(buf + pos, "(variant)");
257 return ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
260 if (pos + 3 >= bufsize)
264 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
265 if (pos + 1 >= bufsize)
271 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
272 if (pos + 2 >= bufsize)
274 if (!vec_size(e->expression.params)) {
280 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[0]), buf, bufsize, pos);
281 for (i = 1; i < vec_size(e->expression.params); ++i) {
282 if (pos + 2 >= bufsize)
286 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[i]), buf, bufsize, pos);
288 if (pos + 1 >= bufsize)
294 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
295 if (pos + 1 >= bufsize)
298 pos += snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->expression.count);
299 if (pos + 1 >= bufsize)
305 typestr = type_name[e->expression.vtype];
306 typelen = strlen(typestr);
307 if (pos + typelen >= bufsize)
309 strcpy(buf + pos, typestr);
310 return pos + typelen;
314 buf[bufsize-3] = '.';
315 buf[bufsize-2] = '.';
316 buf[bufsize-1] = '.';
320 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
322 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
326 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
328 ast_instantiate(ast_value, ctx, ast_value_delete);
329 ast_expression_init((ast_expression*)self,
330 (ast_expression_codegen*)&ast_value_codegen);
331 self->expression.node.keep = true; /* keep */
333 self->name = name ? util_strdup(name) : NULL;
334 self->expression.vtype = t;
335 self->expression.next = NULL;
336 self->isfield = false;
338 self->hasvalue = false;
340 memset(&self->constval, 0, sizeof(self->constval));
343 self->ir_values = NULL;
344 self->ir_value_count = 0;
353 void ast_value_delete(ast_value* self)
356 mem_d((void*)self->name);
357 if (self->hasvalue) {
358 switch (self->expression.vtype)
361 mem_d((void*)self->constval.vstring);
364 /* unlink us from the function node */
365 self->constval.vfunc->vtype = NULL;
367 /* NOTE: delete function? currently collected in
368 * the parser structure
375 mem_d(self->ir_values);
380 ast_expression_delete((ast_expression*)self);
384 void ast_value_params_add(ast_value *self, ast_value *p)
386 vec_push(self->expression.params, p);
389 bool ast_value_set_name(ast_value *self, const char *name)
392 mem_d((void*)self->name);
393 self->name = util_strdup(name);
397 ast_binary* ast_binary_new(lex_ctx ctx, int op,
398 ast_expression* left, ast_expression* right)
400 ast_instantiate(ast_binary, ctx, ast_binary_delete);
401 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
407 ast_propagate_effects(self, left);
408 ast_propagate_effects(self, right);
410 if (op >= INSTR_EQ_F && op <= INSTR_GT)
411 self->expression.vtype = TYPE_FLOAT;
412 else if (op == INSTR_AND || op == INSTR_OR) {
413 if (OPTS_FLAG(PERL_LOGIC))
414 ast_type_adopt(self, right);
416 self->expression.vtype = TYPE_FLOAT;
418 else if (op == INSTR_BITAND || op == INSTR_BITOR)
419 self->expression.vtype = TYPE_FLOAT;
420 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
421 self->expression.vtype = TYPE_VECTOR;
422 else if (op == INSTR_MUL_V)
423 self->expression.vtype = TYPE_FLOAT;
425 self->expression.vtype = left->expression.vtype;
430 void ast_binary_delete(ast_binary *self)
432 ast_unref(self->left);
433 ast_unref(self->right);
434 ast_expression_delete((ast_expression*)self);
438 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
439 ast_expression* left, ast_expression* right)
441 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
442 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
444 ast_side_effects(self) = true;
446 self->opstore = storop;
449 self->source = right;
451 self->keep_dest = false;
453 if (!ast_type_adopt(self, left)) {
461 void ast_binstore_delete(ast_binstore *self)
463 if (!self->keep_dest)
464 ast_unref(self->dest);
465 ast_unref(self->source);
466 ast_expression_delete((ast_expression*)self);
470 ast_unary* ast_unary_new(lex_ctx ctx, int op,
471 ast_expression *expr)
473 ast_instantiate(ast_unary, ctx, ast_unary_delete);
474 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
477 self->operand = expr;
479 ast_propagate_effects(self, expr);
481 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
482 self->expression.vtype = TYPE_FLOAT;
484 compile_error(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
489 void ast_unary_delete(ast_unary *self)
491 if (self->operand) ast_unref(self->operand);
492 ast_expression_delete((ast_expression*)self);
496 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
498 ast_instantiate(ast_return, ctx, ast_return_delete);
499 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
501 self->operand = expr;
504 ast_propagate_effects(self, expr);
509 void ast_return_delete(ast_return *self)
512 ast_unref(self->operand);
513 ast_expression_delete((ast_expression*)self);
517 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
519 if (field->expression.vtype != TYPE_FIELD) {
520 compile_error(ctx, "ast_entfield_new with expression not of type field");
523 return ast_entfield_new_force(ctx, entity, field, field->expression.next);
526 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
528 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
532 /* Error: field has no type... */
536 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
538 self->entity = entity;
540 ast_propagate_effects(self, entity);
541 ast_propagate_effects(self, field);
543 if (!ast_type_adopt(self, outtype)) {
544 ast_entfield_delete(self);
551 void ast_entfield_delete(ast_entfield *self)
553 ast_unref(self->entity);
554 ast_unref(self->field);
555 ast_expression_delete((ast_expression*)self);
559 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field, const char *name)
561 ast_instantiate(ast_member, ctx, ast_member_delete);
567 if (owner->expression.vtype != TYPE_VECTOR &&
568 owner->expression.vtype != TYPE_FIELD) {
569 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
574 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
575 self->expression.node.keep = true; /* keep */
577 if (owner->expression.vtype == TYPE_VECTOR) {
578 self->expression.vtype = TYPE_FLOAT;
579 self->expression.next = NULL;
581 self->expression.vtype = TYPE_FIELD;
582 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
585 self->rvalue = false;
587 ast_propagate_effects(self, owner);
591 self->name = util_strdup(name);
598 void ast_member_delete(ast_member *self)
600 /* The owner is always an ast_value, which has .keep=true,
601 * also: ast_members are usually deleted after the owner, thus
602 * this will cause invalid access
603 ast_unref(self->owner);
604 * once we allow (expression).x to access a vector-member, we need
605 * to change this: preferably by creating an alternate ast node for this
606 * purpose that is not garbage-collected.
608 ast_expression_delete((ast_expression*)self);
612 bool ast_member_set_name(ast_member *self, const char *name)
615 mem_d((void*)self->name);
616 self->name = util_strdup(name);
620 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
622 ast_expression *outtype;
623 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
625 outtype = array->expression.next;
628 /* Error: field has no type... */
632 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
636 ast_propagate_effects(self, array);
637 ast_propagate_effects(self, index);
639 if (!ast_type_adopt(self, outtype)) {
640 ast_array_index_delete(self);
643 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
644 if (self->expression.vtype != TYPE_ARRAY) {
645 compile_error(ast_ctx(self), "array_index node on type");
646 ast_array_index_delete(self);
649 self->array = outtype;
650 self->expression.vtype = TYPE_FIELD;
656 void ast_array_index_delete(ast_array_index *self)
658 ast_unref(self->array);
659 ast_unref(self->index);
660 ast_expression_delete((ast_expression*)self);
664 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
666 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
667 if (!ontrue && !onfalse) {
668 /* because it is invalid */
672 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
675 self->on_true = ontrue;
676 self->on_false = onfalse;
677 ast_propagate_effects(self, cond);
679 ast_propagate_effects(self, ontrue);
681 ast_propagate_effects(self, onfalse);
686 void ast_ifthen_delete(ast_ifthen *self)
688 ast_unref(self->cond);
690 ast_unref(self->on_true);
692 ast_unref(self->on_false);
693 ast_expression_delete((ast_expression*)self);
697 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
699 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
700 /* This time NEITHER must be NULL */
701 if (!ontrue || !onfalse) {
705 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
708 self->on_true = ontrue;
709 self->on_false = onfalse;
710 ast_propagate_effects(self, cond);
711 ast_propagate_effects(self, ontrue);
712 ast_propagate_effects(self, onfalse);
714 if (!ast_type_adopt(self, ontrue)) {
715 ast_ternary_delete(self);
722 void ast_ternary_delete(ast_ternary *self)
724 ast_unref(self->cond);
725 ast_unref(self->on_true);
726 ast_unref(self->on_false);
727 ast_expression_delete((ast_expression*)self);
731 ast_loop* ast_loop_new(lex_ctx ctx,
732 ast_expression *initexpr,
733 ast_expression *precond, bool pre_not,
734 ast_expression *postcond, bool post_not,
735 ast_expression *increment,
736 ast_expression *body)
738 ast_instantiate(ast_loop, ctx, ast_loop_delete);
739 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
741 self->initexpr = initexpr;
742 self->precond = precond;
743 self->postcond = postcond;
744 self->increment = increment;
747 self->pre_not = pre_not;
748 self->post_not = post_not;
751 ast_propagate_effects(self, initexpr);
753 ast_propagate_effects(self, precond);
755 ast_propagate_effects(self, postcond);
757 ast_propagate_effects(self, increment);
759 ast_propagate_effects(self, body);
764 void ast_loop_delete(ast_loop *self)
767 ast_unref(self->initexpr);
769 ast_unref(self->precond);
771 ast_unref(self->postcond);
773 ast_unref(self->increment);
775 ast_unref(self->body);
776 ast_expression_delete((ast_expression*)self);
780 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont, unsigned int levels)
782 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
783 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
785 self->is_continue = iscont;
786 self->levels = levels;
791 void ast_breakcont_delete(ast_breakcont *self)
793 ast_expression_delete((ast_expression*)self);
797 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
799 ast_instantiate(ast_switch, ctx, ast_switch_delete);
800 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
805 ast_propagate_effects(self, op);
810 void ast_switch_delete(ast_switch *self)
813 ast_unref(self->operand);
815 for (i = 0; i < vec_size(self->cases); ++i) {
816 if (self->cases[i].value)
817 ast_unref(self->cases[i].value);
818 ast_unref(self->cases[i].code);
820 vec_free(self->cases);
822 ast_expression_delete((ast_expression*)self);
826 ast_label* ast_label_new(lex_ctx ctx, const char *name)
828 ast_instantiate(ast_label, ctx, ast_label_delete);
829 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
831 self->name = util_strdup(name);
832 self->irblock = NULL;
838 void ast_label_delete(ast_label *self)
840 mem_d((void*)self->name);
841 vec_free(self->gotos);
842 ast_expression_delete((ast_expression*)self);
846 void ast_label_register_goto(ast_label *self, ast_goto *g)
848 vec_push(self->gotos, g);
851 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
853 ast_instantiate(ast_goto, ctx, ast_goto_delete);
854 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
856 self->name = util_strdup(name);
858 self->irblock_from = NULL;
863 void ast_goto_delete(ast_goto *self)
865 mem_d((void*)self->name);
866 ast_expression_delete((ast_expression*)self);
870 void ast_goto_set_label(ast_goto *self, ast_label *label)
872 self->target = label;
875 ast_call* ast_call_new(lex_ctx ctx,
876 ast_expression *funcexpr)
878 ast_instantiate(ast_call, ctx, ast_call_delete);
879 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
881 ast_side_effects(self) = true;
884 self->func = funcexpr;
886 ast_type_adopt(self, funcexpr->expression.next);
891 void ast_call_delete(ast_call *self)
894 for (i = 0; i < vec_size(self->params); ++i)
895 ast_unref(self->params[i]);
896 vec_free(self->params);
899 ast_unref(self->func);
901 ast_expression_delete((ast_expression*)self);
905 bool ast_call_check_types(ast_call *self)
909 const ast_expression *func = self->func;
910 size_t count = vec_size(self->params);
911 if (count > vec_size(func->expression.params))
912 count = vec_size(func->expression.params);
914 for (i = 0; i < count; ++i) {
915 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i])))
919 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
920 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
921 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
922 (unsigned int)(i+1), texp, tgot);
923 /* we don't immediately return */
930 ast_store* ast_store_new(lex_ctx ctx, int op,
931 ast_expression *dest, ast_expression *source)
933 ast_instantiate(ast_store, ctx, ast_store_delete);
934 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
936 ast_side_effects(self) = true;
940 self->source = source;
942 if (!ast_type_adopt(self, dest)) {
950 void ast_store_delete(ast_store *self)
952 ast_unref(self->dest);
953 ast_unref(self->source);
954 ast_expression_delete((ast_expression*)self);
958 ast_block* ast_block_new(lex_ctx ctx)
960 ast_instantiate(ast_block, ctx, ast_block_delete);
961 ast_expression_init((ast_expression*)self,
962 (ast_expression_codegen*)&ast_block_codegen);
966 self->collect = NULL;
971 bool ast_block_add_expr(ast_block *self, ast_expression *e)
973 ast_propagate_effects(self, e);
974 vec_push(self->exprs, e);
975 if (self->expression.next) {
976 ast_delete(self->expression.next);
977 self->expression.next = NULL;
979 if (!ast_type_adopt(self, e)) {
980 compile_error(ast_ctx(self), "internal error: failed to adopt type");
986 void ast_block_collect(ast_block *self, ast_expression *expr)
988 vec_push(self->collect, expr);
989 expr->expression.node.keep = true;
992 void ast_block_delete(ast_block *self)
995 for (i = 0; i < vec_size(self->exprs); ++i)
996 ast_unref(self->exprs[i]);
997 vec_free(self->exprs);
998 for (i = 0; i < vec_size(self->locals); ++i)
999 ast_delete(self->locals[i]);
1000 vec_free(self->locals);
1001 for (i = 0; i < vec_size(self->collect); ++i)
1002 ast_delete(self->collect[i]);
1003 vec_free(self->collect);
1004 ast_expression_delete((ast_expression*)self);
1008 bool ast_block_set_type(ast_block *self, ast_expression *from)
1010 if (self->expression.next)
1011 ast_delete(self->expression.next);
1012 if (!ast_type_adopt(self, from))
1017 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1019 ast_instantiate(ast_function, ctx, ast_function_delete);
1023 vtype->expression.vtype != TYPE_FUNCTION)
1025 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1027 (int)vtype->hasvalue,
1028 vtype->expression.vtype);
1033 self->vtype = vtype;
1034 self->name = name ? util_strdup(name) : NULL;
1035 self->blocks = NULL;
1037 self->labelcount = 0;
1040 self->ir_func = NULL;
1041 self->curblock = NULL;
1043 self->breakblocks = NULL;
1044 self->continueblocks = NULL;
1046 vtype->hasvalue = true;
1047 vtype->constval.vfunc = self;
1052 void ast_function_delete(ast_function *self)
1056 mem_d((void*)self->name);
1058 /* ast_value_delete(self->vtype); */
1059 self->vtype->hasvalue = false;
1060 self->vtype->constval.vfunc = NULL;
1061 /* We use unref - if it was stored in a global table it is supposed
1062 * to be deleted from *there*
1064 ast_unref(self->vtype);
1066 for (i = 0; i < vec_size(self->blocks); ++i)
1067 ast_delete(self->blocks[i]);
1068 vec_free(self->blocks);
1069 vec_free(self->breakblocks);
1070 vec_free(self->continueblocks);
1074 const char* ast_function_label(ast_function *self, const char *prefix)
1080 if (!opts.dump && !opts.dumpfin && !opts.debug)
1083 id = (self->labelcount++);
1084 len = strlen(prefix);
1086 from = self->labelbuf + sizeof(self->labelbuf)-1;
1089 *from-- = (id%10) + '0';
1093 memcpy(from - len, prefix, len);
1097 /*********************************************************************/
1099 * by convention you must never pass NULL to the 'ir_value **out'
1100 * parameter. If you really don't care about the output, pass a dummy.
1101 * But I can't imagine a pituation where the output is truly unnecessary.
1104 void _ast_codegen_output_type(ast_expression_common *self, ir_value *out)
1106 if (out->vtype == TYPE_FIELD)
1107 out->fieldtype = self->next->expression.vtype;
1108 if (out->vtype == TYPE_FUNCTION)
1109 out->outtype = self->next->expression.vtype;
1112 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1114 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1118 if (self->expression.vtype == TYPE_NIL) {
1119 *out = func->ir_func->owner->nil;
1122 /* NOTE: This is the codegen for a variable used in an expression.
1123 * It is not the codegen to generate the value. For this purpose,
1124 * ast_local_codegen and ast_global_codegen are to be used before this
1125 * is executed. ast_function_codegen should take care of its locals,
1126 * and the ast-user should take care of ast_global_codegen to be used
1127 * on all the globals.
1130 char tname[1024]; /* typename is reserved in C++ */
1131 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1132 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1139 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1143 if (self->expression.vtype == TYPE_NIL) {
1144 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1148 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1150 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1153 func->context = ast_ctx(self);
1154 func->value->context = ast_ctx(self);
1156 self->constval.vfunc->ir_func = func;
1157 self->ir_v = func->value;
1158 /* The function is filled later on ast_function_codegen... */
1162 if (isfield && self->expression.vtype == TYPE_FIELD) {
1163 ast_expression *fieldtype = self->expression.next;
1165 if (self->hasvalue) {
1166 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1170 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1175 ast_expression_common *elemtype;
1177 ast_value *array = (ast_value*)fieldtype;
1179 if (!ast_istype(fieldtype, ast_value)) {
1180 compile_error(ast_ctx(self), "internal error: ast_value required");
1184 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1185 if (!array->expression.count || array->expression.count > opts.max_array_size)
1186 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1188 elemtype = &array->expression.next->expression;
1189 vtype = elemtype->vtype;
1191 v = ir_builder_create_field(ir, self->name, vtype);
1193 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1196 v->context = ast_ctx(self);
1197 v->unique_life = true;
1199 array->ir_v = self->ir_v = v;
1201 namelen = strlen(self->name);
1202 name = (char*)mem_a(namelen + 16);
1203 strcpy(name, self->name);
1205 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1206 array->ir_values[0] = v;
1207 for (ai = 1; ai < array->expression.count; ++ai) {
1208 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1209 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1210 if (!array->ir_values[ai]) {
1212 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1215 array->ir_values[ai]->context = ast_ctx(self);
1216 array->ir_values[ai]->unique_life = true;
1217 array->ir_values[ai]->locked = true;
1223 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1226 v->context = ast_ctx(self);
1232 if (self->expression.vtype == TYPE_ARRAY) {
1237 ast_expression_common *elemtype = &self->expression.next->expression;
1238 int vtype = elemtype->vtype;
1240 /* same as with field arrays */
1241 if (!self->expression.count || self->expression.count > opts.max_array_size)
1242 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1244 v = ir_builder_create_global(ir, self->name, vtype);
1246 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1249 v->context = ast_ctx(self);
1250 v->unique_life = true;
1253 namelen = strlen(self->name);
1254 name = (char*)mem_a(namelen + 16);
1255 strcpy(name, self->name);
1257 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1258 self->ir_values[0] = v;
1259 for (ai = 1; ai < self->expression.count; ++ai) {
1260 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1261 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1262 if (!self->ir_values[ai]) {
1264 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1267 self->ir_values[ai]->context = ast_ctx(self);
1268 self->ir_values[ai]->unique_life = true;
1269 self->ir_values[ai]->locked = true;
1275 /* Arrays don't do this since there's no "array" value which spans across the
1278 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1280 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1283 codegen_output_type(self, v);
1284 v->context = ast_ctx(self);
1287 if (self->hasvalue) {
1288 switch (self->expression.vtype)
1291 if (!ir_value_set_float(v, self->constval.vfloat))
1295 if (!ir_value_set_vector(v, self->constval.vvec))
1299 if (!ir_value_set_string(v, self->constval.vstring))
1303 compile_error(ast_ctx(self), "TODO: global constant array");
1306 compile_error(ast_ctx(self), "global of type function not properly generated");
1308 /* Cannot generate an IR value for a function,
1309 * need a pointer pointing to a function rather.
1312 if (!self->constval.vfield) {
1313 compile_error(ast_ctx(self), "field constant without vfield set");
1316 if (!self->constval.vfield->ir_v) {
1317 compile_error(ast_ctx(self), "field constant generated before its field");
1320 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1324 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1329 /* link us to the ir_value */
1334 error: /* clean up */
1339 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1343 if (self->expression.vtype == TYPE_NIL) {
1344 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1348 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1350 /* Do we allow local functions? I think not...
1351 * this is NOT a function pointer atm.
1356 if (self->expression.vtype == TYPE_ARRAY) {
1361 ast_expression_common *elemtype = &self->expression.next->expression;
1362 int vtype = elemtype->vtype;
1364 func->flags |= IR_FLAG_HAS_ARRAYS;
1367 compile_error(ast_ctx(self), "array-parameters are not supported");
1371 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1372 if (!self->expression.count || self->expression.count > opts.max_array_size) {
1373 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1376 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1377 if (!self->ir_values) {
1378 compile_error(ast_ctx(self), "failed to allocate array values");
1382 v = ir_function_create_local(func, self->name, vtype, param);
1384 compile_error(ast_ctx(self), "ir_function_create_local failed");
1387 v->context = ast_ctx(self);
1388 v->unique_life = true;
1391 namelen = strlen(self->name);
1392 name = (char*)mem_a(namelen + 16);
1393 strcpy(name, self->name);
1395 self->ir_values[0] = v;
1396 for (ai = 1; ai < self->expression.count; ++ai) {
1397 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1398 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1399 if (!self->ir_values[ai]) {
1400 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1403 self->ir_values[ai]->context = ast_ctx(self);
1404 self->ir_values[ai]->unique_life = true;
1405 self->ir_values[ai]->locked = true;
1410 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1413 codegen_output_type(self, v);
1414 v->context = ast_ctx(self);
1417 /* A constant local... hmmm...
1418 * I suppose the IR will have to deal with this
1420 if (self->hasvalue) {
1421 switch (self->expression.vtype)
1424 if (!ir_value_set_float(v, self->constval.vfloat))
1428 if (!ir_value_set_vector(v, self->constval.vvec))
1432 if (!ir_value_set_string(v, self->constval.vstring))
1436 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1441 /* link us to the ir_value */
1445 if (!ast_generate_accessors(self, func->owner))
1449 error: /* clean up */
1454 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1457 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1458 if (!self->setter || !self->getter)
1460 for (i = 0; i < self->expression.count; ++i) {
1461 if (!self->ir_values) {
1462 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1465 if (!self->ir_values[i]) {
1466 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1469 if (self->ir_values[i]->life) {
1470 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1475 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1477 if (!ast_global_codegen (self->setter, ir, false) ||
1478 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1479 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1481 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1482 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1487 if (!ast_global_codegen (self->getter, ir, false) ||
1488 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1489 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1491 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1492 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1496 for (i = 0; i < self->expression.count; ++i) {
1497 vec_free(self->ir_values[i]->life);
1499 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1503 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1507 ast_expression_common *ec;
1512 irf = self->ir_func;
1514 compile_error(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1518 /* fill the parameter list */
1519 ec = &self->vtype->expression;
1520 for (i = 0; i < vec_size(ec->params); ++i)
1522 if (ec->params[i]->expression.vtype == TYPE_FIELD)
1523 vec_push(irf->params, ec->params[i]->expression.next->expression.vtype);
1525 vec_push(irf->params, ec->params[i]->expression.vtype);
1526 if (!self->builtin) {
1527 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1532 if (self->builtin) {
1533 irf->builtin = self->builtin;
1537 if (!vec_size(self->blocks)) {
1538 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1542 self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1543 if (!self->curblock) {
1544 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1548 for (i = 0; i < vec_size(self->blocks); ++i) {
1549 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1550 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1554 /* TODO: check return types */
1555 if (!self->curblock->final)
1557 if (!self->vtype->expression.next ||
1558 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1560 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1562 else if (vec_size(self->curblock->entries))
1564 /* error("missing return"); */
1565 if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1566 "control reaches end of non-void function (`%s`) via %s",
1567 self->name, self->curblock->label))
1571 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1577 /* Note, you will not see ast_block_codegen generate ir_blocks.
1578 * To the AST and the IR, blocks are 2 different things.
1579 * In the AST it represents a block of code, usually enclosed in
1580 * curly braces {...}.
1581 * While in the IR it represents a block in terms of control-flow.
1583 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1587 /* We don't use this
1588 * Note: an ast-representation using the comma-operator
1589 * of the form: (a, b, c) = x should not assign to c...
1592 compile_error(ast_ctx(self), "not an l-value (code-block)");
1596 if (self->expression.outr) {
1597 *out = self->expression.outr;
1601 /* output is NULL at first, we'll have each expression
1602 * assign to out output, thus, a comma-operator represention
1603 * using an ast_block will return the last generated value,
1604 * so: (b, c) + a executed both b and c, and returns c,
1605 * which is then added to a.
1609 /* generate locals */
1610 for (i = 0; i < vec_size(self->locals); ++i)
1612 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1614 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1619 for (i = 0; i < vec_size(self->exprs); ++i)
1621 ast_expression_codegen *gen;
1622 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1623 if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1627 gen = self->exprs[i]->expression.codegen;
1628 if (!(*gen)(self->exprs[i], func, false, out))
1632 self->expression.outr = *out;
1637 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1639 ast_expression_codegen *cgen;
1640 ir_value *left = NULL;
1641 ir_value *right = NULL;
1645 ast_array_index *ai = NULL;
1647 if (lvalue && self->expression.outl) {
1648 *out = self->expression.outl;
1652 if (!lvalue && self->expression.outr) {
1653 *out = self->expression.outr;
1657 if (ast_istype(self->dest, ast_array_index))
1660 ai = (ast_array_index*)self->dest;
1661 idx = (ast_value*)ai->index;
1663 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1668 /* we need to call the setter */
1669 ir_value *iridx, *funval;
1673 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1677 arr = (ast_value*)ai->array;
1678 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1679 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1683 cgen = idx->expression.codegen;
1684 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1687 cgen = arr->setter->expression.codegen;
1688 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1691 cgen = self->source->expression.codegen;
1692 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1695 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1698 ir_call_param(call, iridx);
1699 ir_call_param(call, right);
1700 self->expression.outr = right;
1706 cgen = self->dest->expression.codegen;
1708 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1710 self->expression.outl = left;
1712 cgen = self->source->expression.codegen;
1714 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1717 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1719 self->expression.outr = right;
1722 /* Theoretically, an assinment returns its left side as an
1723 * lvalue, if we don't need an lvalue though, we return
1724 * the right side as an rvalue, otherwise we have to
1725 * somehow know whether or not we need to dereference the pointer
1726 * on the left side - that is: OP_LOAD if it was an address.
1727 * Also: in original QC we cannot OP_LOADP *anyway*.
1729 *out = (lvalue ? left : right);
1734 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1736 ast_expression_codegen *cgen;
1737 ir_value *left, *right;
1739 /* A binary operation cannot yield an l-value */
1741 compile_error(ast_ctx(self), "not an l-value (binop)");
1745 if (self->expression.outr) {
1746 *out = self->expression.outr;
1750 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1751 (self->op == INSTR_AND || self->op == INSTR_OR))
1753 /* short circuit evaluation */
1754 ir_block *other, *merge;
1755 ir_block *from_left, *from_right;
1759 /* prepare end-block */
1760 merge_id = vec_size(func->ir_func->blocks);
1761 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1763 /* generate the left expression */
1764 cgen = self->left->expression.codegen;
1765 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1767 /* remember the block */
1768 from_left = func->curblock;
1770 /* create a new block for the right expression */
1771 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1772 if (self->op == INSTR_AND) {
1773 /* on AND: left==true -> other */
1774 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1777 /* on OR: left==false -> other */
1778 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1781 /* use the likely flag */
1782 vec_last(func->curblock->instr)->likely = true;
1784 /* enter the right-expression's block */
1785 func->curblock = other;
1787 cgen = self->right->expression.codegen;
1788 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1790 /* remember block */
1791 from_right = func->curblock;
1793 /* jump to the merge block */
1794 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1797 vec_remove(func->ir_func->blocks, merge_id, 1);
1798 vec_push(func->ir_func->blocks, merge);
1800 func->curblock = merge;
1801 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1802 ast_function_label(func, "sce_value"),
1803 self->expression.vtype);
1804 ir_phi_add(phi, from_left, left);
1805 ir_phi_add(phi, from_right, right);
1806 *out = ir_phi_value(phi);
1810 if (!OPTS_FLAG(PERL_LOGIC)) {
1812 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1813 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1814 ast_function_label(func, "sce_bool_v"),
1818 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1819 ast_function_label(func, "sce_bool"),
1824 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
1825 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1826 ast_function_label(func, "sce_bool_s"),
1830 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1831 ast_function_label(func, "sce_bool"),
1837 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
1838 ast_function_label(func, "sce_bool"),
1839 INSTR_AND, *out, *out);
1845 self->expression.outr = *out;
1849 cgen = self->left->expression.codegen;
1850 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1853 cgen = self->right->expression.codegen;
1854 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1857 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
1858 self->op, left, right);
1861 self->expression.outr = *out;
1866 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1868 ast_expression_codegen *cgen;
1869 ir_value *leftl = NULL, *leftr, *right, *bin;
1873 ast_array_index *ai = NULL;
1874 ir_value *iridx = NULL;
1876 if (lvalue && self->expression.outl) {
1877 *out = self->expression.outl;
1881 if (!lvalue && self->expression.outr) {
1882 *out = self->expression.outr;
1886 if (ast_istype(self->dest, ast_array_index))
1889 ai = (ast_array_index*)self->dest;
1890 idx = (ast_value*)ai->index;
1892 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1896 /* for a binstore we need both an lvalue and an rvalue for the left side */
1897 /* rvalue of destination! */
1899 cgen = idx->expression.codegen;
1900 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1903 cgen = self->dest->expression.codegen;
1904 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1907 /* source as rvalue only */
1908 cgen = self->source->expression.codegen;
1909 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1912 /* now the binary */
1913 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
1914 self->opbin, leftr, right);
1915 self->expression.outr = bin;
1919 /* we need to call the setter */
1924 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1928 arr = (ast_value*)ai->array;
1929 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1930 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1934 cgen = arr->setter->expression.codegen;
1935 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1938 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1941 ir_call_param(call, iridx);
1942 ir_call_param(call, bin);
1943 self->expression.outr = bin;
1945 /* now store them */
1946 cgen = self->dest->expression.codegen;
1947 /* lvalue of destination */
1948 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1950 self->expression.outl = leftl;
1952 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
1954 self->expression.outr = bin;
1957 /* Theoretically, an assinment returns its left side as an
1958 * lvalue, if we don't need an lvalue though, we return
1959 * the right side as an rvalue, otherwise we have to
1960 * somehow know whether or not we need to dereference the pointer
1961 * on the left side - that is: OP_LOAD if it was an address.
1962 * Also: in original QC we cannot OP_LOADP *anyway*.
1964 *out = (lvalue ? leftl : bin);
1969 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1971 ast_expression_codegen *cgen;
1974 /* An unary operation cannot yield an l-value */
1976 compile_error(ast_ctx(self), "not an l-value (binop)");
1980 if (self->expression.outr) {
1981 *out = self->expression.outr;
1985 cgen = self->operand->expression.codegen;
1987 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1990 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
1994 self->expression.outr = *out;
1999 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2001 ast_expression_codegen *cgen;
2006 /* In the context of a return operation, we don't actually return
2010 compile_error(ast_ctx(self), "return-expression is not an l-value");
2014 if (self->expression.outr) {
2015 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2018 self->expression.outr = (ir_value*)1;
2020 if (self->operand) {
2021 cgen = self->operand->expression.codegen;
2023 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2026 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2029 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2036 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2038 ast_expression_codegen *cgen;
2039 ir_value *ent, *field;
2041 /* This function needs to take the 'lvalue' flag into account!
2042 * As lvalue we provide a field-pointer, as rvalue we provide the
2046 if (lvalue && self->expression.outl) {
2047 *out = self->expression.outl;
2051 if (!lvalue && self->expression.outr) {
2052 *out = self->expression.outr;
2056 cgen = self->entity->expression.codegen;
2057 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2060 cgen = self->field->expression.codegen;
2061 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2066 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2069 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2070 ent, field, self->expression.vtype);
2071 /* Done AFTER error checking:
2072 codegen_output_type(self, *out);
2076 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2077 (lvalue ? "ADDRESS" : "FIELD"),
2078 type_name[self->expression.vtype]);
2082 codegen_output_type(self, *out);
2085 self->expression.outl = *out;
2087 self->expression.outr = *out;
2089 /* Hm that should be it... */
2093 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2095 ast_expression_codegen *cgen;
2098 /* in QC this is always an lvalue */
2099 if (lvalue && self->rvalue) {
2100 compile_error(ast_ctx(self), "not an l-value (member access)");
2103 if (self->expression.outl) {
2104 *out = self->expression.outl;
2108 cgen = self->owner->expression.codegen;
2109 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2112 if (vec->vtype != TYPE_VECTOR &&
2113 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2118 *out = ir_value_vector_member(vec, self->field);
2119 self->expression.outl = *out;
2121 return (*out != NULL);
2124 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2129 if (!lvalue && self->expression.outr) {
2130 *out = self->expression.outr;
2132 if (lvalue && self->expression.outl) {
2133 *out = self->expression.outl;
2136 if (!ast_istype(self->array, ast_value)) {
2137 compile_error(ast_ctx(self), "array indexing this way is not supported");
2138 /* note this would actually be pointer indexing because the left side is
2139 * not an actual array but (hopefully) an indexable expression.
2140 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2141 * support this path will be filled.
2146 arr = (ast_value*)self->array;
2147 idx = (ast_value*)self->index;
2149 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2150 /* Time to use accessor functions */
2151 ast_expression_codegen *cgen;
2152 ir_value *iridx, *funval;
2156 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2161 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2165 cgen = self->index->expression.codegen;
2166 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2169 cgen = arr->getter->expression.codegen;
2170 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2173 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2176 ir_call_param(call, iridx);
2178 *out = ir_call_value(call);
2179 self->expression.outr = *out;
2183 if (idx->expression.vtype == TYPE_FLOAT) {
2184 unsigned int arridx = idx->constval.vfloat;
2185 if (arridx >= self->array->expression.count)
2187 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2190 *out = arr->ir_values[arridx];
2192 else if (idx->expression.vtype == TYPE_INTEGER) {
2193 unsigned int arridx = idx->constval.vint;
2194 if (arridx >= self->array->expression.count)
2196 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2199 *out = arr->ir_values[arridx];
2202 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2208 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2210 ast_expression_codegen *cgen;
2218 ir_block *ontrue_endblock = NULL;
2219 ir_block *onfalse_endblock = NULL;
2220 ir_block *merge = NULL;
2222 /* We don't output any value, thus also don't care about r/lvalue */
2226 if (self->expression.outr) {
2227 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2230 self->expression.outr = (ir_value*)1;
2232 /* generate the condition */
2233 cgen = self->cond->expression.codegen;
2234 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2236 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2237 cond = func->curblock;
2241 if (self->on_true) {
2242 /* create on-true block */
2243 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2247 /* enter the block */
2248 func->curblock = ontrue;
2251 cgen = self->on_true->expression.codegen;
2252 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2255 /* we now need to work from the current endpoint */
2256 ontrue_endblock = func->curblock;
2261 if (self->on_false) {
2262 /* create on-false block */
2263 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2267 /* enter the block */
2268 func->curblock = onfalse;
2271 cgen = self->on_false->expression.codegen;
2272 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2275 /* we now need to work from the current endpoint */
2276 onfalse_endblock = func->curblock;
2280 /* Merge block were they all merge in to */
2281 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2283 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2286 /* add jumps ot the merge block */
2287 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2289 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2292 /* Now enter the merge block */
2293 func->curblock = merge;
2296 /* we create the if here, that way all blocks are ordered :)
2298 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2299 (ontrue ? ontrue : merge),
2300 (onfalse ? onfalse : merge)))
2308 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2310 ast_expression_codegen *cgen;
2313 ir_value *trueval, *falseval;
2316 ir_block *cond = func->curblock;
2317 ir_block *cond_out = NULL;
2318 ir_block *ontrue, *ontrue_out = NULL;
2319 ir_block *onfalse, *onfalse_out = NULL;
2322 /* Ternary can never create an lvalue... */
2326 /* In theory it shouldn't be possible to pass through a node twice, but
2327 * in case we add any kind of optimization pass for the AST itself, it
2328 * may still happen, thus we remember a created ir_value and simply return one
2329 * if it already exists.
2331 if (self->expression.outr) {
2332 *out = self->expression.outr;
2336 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2338 /* generate the condition */
2339 func->curblock = cond;
2340 cgen = self->cond->expression.codegen;
2341 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2343 cond_out = func->curblock;
2345 /* create on-true block */
2346 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2351 /* enter the block */
2352 func->curblock = ontrue;
2355 cgen = self->on_true->expression.codegen;
2356 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2359 ontrue_out = func->curblock;
2362 /* create on-false block */
2363 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2368 /* enter the block */
2369 func->curblock = onfalse;
2372 cgen = self->on_false->expression.codegen;
2373 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2376 onfalse_out = func->curblock;
2379 /* create merge block */
2380 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2383 /* jump to merge block */
2384 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2386 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2389 /* create if instruction */
2390 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2393 /* Now enter the merge block */
2394 func->curblock = merge;
2396 /* Here, now, we need a PHI node
2397 * but first some sanity checking...
2399 if (trueval->vtype != falseval->vtype) {
2400 /* error("ternary with different types on the two sides"); */
2405 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), trueval->vtype);
2408 ir_phi_add(phi, ontrue_out, trueval);
2409 ir_phi_add(phi, onfalse_out, falseval);
2411 self->expression.outr = ir_phi_value(phi);
2412 *out = self->expression.outr;
2414 codegen_output_type(self, *out);
2419 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2421 ast_expression_codegen *cgen;
2423 ir_value *dummy = NULL;
2424 ir_value *precond = NULL;
2425 ir_value *postcond = NULL;
2427 /* Since we insert some jumps "late" so we have blocks
2428 * ordered "nicely", we need to keep track of the actual end-blocks
2429 * of expressions to add the jumps to.
2431 ir_block *bbody = NULL, *end_bbody = NULL;
2432 ir_block *bprecond = NULL, *end_bprecond = NULL;
2433 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2434 ir_block *bincrement = NULL, *end_bincrement = NULL;
2435 ir_block *bout = NULL, *bin = NULL;
2437 /* let's at least move the outgoing block to the end */
2440 /* 'break' and 'continue' need to be able to find the right blocks */
2441 ir_block *bcontinue = NULL;
2442 ir_block *bbreak = NULL;
2444 ir_block *tmpblock = NULL;
2449 if (self->expression.outr) {
2450 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2453 self->expression.outr = (ir_value*)1;
2456 * Should we ever need some kind of block ordering, better make this function
2457 * move blocks around than write a block ordering algorithm later... after all
2458 * the ast and ir should work together, not against each other.
2461 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2462 * anyway if for example it contains a ternary.
2466 cgen = self->initexpr->expression.codegen;
2467 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2471 /* Store the block from which we enter this chaos */
2472 bin = func->curblock;
2474 /* The pre-loop condition needs its own block since we
2475 * need to be able to jump to the start of that expression.
2479 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2483 /* the pre-loop-condition the least important place to 'continue' at */
2484 bcontinue = bprecond;
2487 func->curblock = bprecond;
2490 cgen = self->precond->expression.codegen;
2491 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2494 end_bprecond = func->curblock;
2496 bprecond = end_bprecond = NULL;
2499 /* Now the next blocks won't be ordered nicely, but we need to
2500 * generate them this early for 'break' and 'continue'.
2502 if (self->increment) {
2503 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2506 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2508 bincrement = end_bincrement = NULL;
2511 if (self->postcond) {
2512 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2515 bcontinue = bpostcond; /* postcond comes before the increment */
2517 bpostcond = end_bpostcond = NULL;
2520 bout_id = vec_size(func->ir_func->blocks);
2521 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2526 /* The loop body... */
2527 /* if (self->body) */
2529 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2534 func->curblock = bbody;
2536 vec_push(func->breakblocks, bbreak);
2538 vec_push(func->continueblocks, bcontinue);
2540 vec_push(func->continueblocks, bbody);
2544 cgen = self->body->expression.codegen;
2545 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2549 end_bbody = func->curblock;
2550 vec_pop(func->breakblocks);
2551 vec_pop(func->continueblocks);
2554 /* post-loop-condition */
2558 func->curblock = bpostcond;
2561 cgen = self->postcond->expression.codegen;
2562 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2565 end_bpostcond = func->curblock;
2568 /* The incrementor */
2569 if (self->increment)
2572 func->curblock = bincrement;
2575 cgen = self->increment->expression.codegen;
2576 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2579 end_bincrement = func->curblock;
2582 /* In any case now, we continue from the outgoing block */
2583 func->curblock = bout;
2585 /* Now all blocks are in place */
2586 /* From 'bin' we jump to whatever comes first */
2587 if (bprecond) tmpblock = bprecond;
2588 else if (bbody) tmpblock = bbody;
2589 else if (bpostcond) tmpblock = bpostcond;
2590 else tmpblock = bout;
2591 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2597 ir_block *ontrue, *onfalse;
2598 if (bbody) ontrue = bbody;
2599 else if (bincrement) ontrue = bincrement;
2600 else if (bpostcond) ontrue = bpostcond;
2601 else ontrue = bprecond;
2603 if (self->pre_not) {
2608 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2615 if (bincrement) tmpblock = bincrement;
2616 else if (bpostcond) tmpblock = bpostcond;
2617 else if (bprecond) tmpblock = bprecond;
2618 else tmpblock = bbody;
2619 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2623 /* from increment */
2626 if (bpostcond) tmpblock = bpostcond;
2627 else if (bprecond) tmpblock = bprecond;
2628 else if (bbody) tmpblock = bbody;
2629 else tmpblock = bout;
2630 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2637 ir_block *ontrue, *onfalse;
2638 if (bprecond) ontrue = bprecond;
2639 else if (bbody) ontrue = bbody;
2640 else if (bincrement) ontrue = bincrement;
2641 else ontrue = bpostcond;
2643 if (self->post_not) {
2648 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2652 /* Move 'bout' to the end */
2653 vec_remove(func->ir_func->blocks, bout_id, 1);
2654 vec_push(func->ir_func->blocks, bout);
2659 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2666 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2670 if (self->expression.outr) {
2671 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2674 self->expression.outr = (ir_value*)1;
2676 if (self->is_continue)
2677 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2679 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2682 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2686 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2691 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2693 ast_expression_codegen *cgen;
2695 ast_switch_case *def_case = NULL;
2696 ir_block *def_bfall = NULL;
2697 ir_block *def_bfall_to = NULL;
2698 bool set_def_bfall_to = false;
2700 ir_value *dummy = NULL;
2701 ir_value *irop = NULL;
2702 ir_block *bout = NULL;
2703 ir_block *bfall = NULL;
2711 compile_error(ast_ctx(self), "switch expression is not an l-value");
2715 if (self->expression.outr) {
2716 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2719 self->expression.outr = (ir_value*)1;
2724 cgen = self->operand->expression.codegen;
2725 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2728 if (!vec_size(self->cases))
2731 cmpinstr = type_eq_instr[irop->vtype];
2732 if (cmpinstr >= AINSTR_END) {
2733 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2734 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2738 bout_id = vec_size(func->ir_func->blocks);
2739 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2743 /* setup the break block */
2744 vec_push(func->breakblocks, bout);
2746 /* Now create all cases */
2747 for (c = 0; c < vec_size(self->cases); ++c) {
2748 ir_value *cond, *val;
2749 ir_block *bcase, *bnot;
2752 ast_switch_case *swcase = &self->cases[c];
2754 if (swcase->value) {
2755 /* A regular case */
2756 /* generate the condition operand */
2757 cgen = swcase->value->expression.codegen;
2758 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2760 /* generate the condition */
2761 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2765 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2766 bnot_id = vec_size(func->ir_func->blocks);
2767 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2768 if (!bcase || !bnot)
2770 if (set_def_bfall_to) {
2771 set_def_bfall_to = false;
2772 def_bfall_to = bcase;
2774 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2777 /* Make the previous case-end fall through */
2778 if (bfall && !bfall->final) {
2779 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2783 /* enter the case */
2784 func->curblock = bcase;
2785 cgen = swcase->code->expression.codegen;
2786 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2789 /* remember this block to fall through from */
2790 bfall = func->curblock;
2792 /* enter the else and move it down */
2793 func->curblock = bnot;
2794 vec_remove(func->ir_func->blocks, bnot_id, 1);
2795 vec_push(func->ir_func->blocks, bnot);
2797 /* The default case */
2798 /* Remember where to fall through from: */
2801 /* remember which case it was */
2803 /* And the next case will be remembered */
2804 set_def_bfall_to = true;
2808 /* Jump from the last bnot to bout */
2809 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2811 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2816 /* If there was a default case, put it down here */
2820 /* No need to create an extra block */
2821 bcase = func->curblock;
2823 /* Insert the fallthrough jump */
2824 if (def_bfall && !def_bfall->final) {
2825 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
2829 /* Now generate the default code */
2830 cgen = def_case->code->expression.codegen;
2831 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2834 /* see if we need to fall through */
2835 if (def_bfall_to && !func->curblock->final)
2837 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
2842 /* Jump from the last bnot to bout */
2843 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
2845 /* enter the outgoing block */
2846 func->curblock = bout;
2848 /* restore the break block */
2849 vec_pop(func->breakblocks);
2851 /* Move 'bout' to the end, it's nicer */
2852 vec_remove(func->ir_func->blocks, bout_id, 1);
2853 vec_push(func->ir_func->blocks, bout);
2858 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2865 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2869 /* simply create a new block and jump to it */
2870 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
2871 if (!self->irblock) {
2872 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2875 if (!func->curblock->final) {
2876 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
2880 /* enter the new block */
2881 func->curblock = self->irblock;
2883 /* Generate all the leftover gotos */
2884 for (i = 0; i < vec_size(self->gotos); ++i) {
2885 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2892 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2896 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2900 if (self->target->irblock) {
2901 if (self->irblock_from) {
2902 /* we already tried once, this is the callback */
2903 self->irblock_from->final = false;
2904 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
2905 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2911 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
2912 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2919 /* the target has not yet been created...
2920 * close this block in a sneaky way:
2922 func->curblock->final = true;
2923 self->irblock_from = func->curblock;
2924 ast_label_register_goto(self->target, self);
2930 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2932 ast_expression_codegen *cgen;
2934 ir_instr *callinstr;
2937 ir_value *funval = NULL;
2939 /* return values are never lvalues */
2941 compile_error(ast_ctx(self), "not an l-value (function call)");
2945 if (self->expression.outr) {
2946 *out = self->expression.outr;
2950 cgen = self->func->expression.codegen;
2951 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2959 for (i = 0; i < vec_size(self->params); ++i)
2962 ast_expression *expr = self->params[i];
2964 cgen = expr->expression.codegen;
2965 if (!(*cgen)(expr, func, false, ¶m))
2969 vec_push(params, param);
2972 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
2973 ast_function_label(func, "call"),
2974 funval, !!(self->func->expression.flags & AST_FLAG_NORETURN));
2978 for (i = 0; i < vec_size(params); ++i) {
2979 ir_call_param(callinstr, params[i]);
2982 *out = ir_call_value(callinstr);
2983 self->expression.outr = *out;
2985 codegen_output_type(self, *out);