5 * Permission is hereby granted, free of charge, to any person obtaining a copy of
6 * this software and associated documentation files (the "Software"), to deal in
7 * the Software without restriction, including without limitation the rights to
8 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
9 * of the Software, and to permit persons to whom the Software is furnished to do
10 * so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in all
13 * copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30 #define ast_instantiate(T, ctx, destroyfn) \
31 T* self = (T*)mem_a(sizeof(T)); \
35 ast_node_init((ast_node*)self, ctx, TYPE_##T); \
36 ( (ast_node*)self )->node.destroy = (ast_node_delete*)destroyfn
40 static void asterror(lex_ctx ctx, const char *msg, ...)
44 con_cvprintmsg((void*)&ctx, LVL_ERROR, "error", msg, ap);
48 /* It must not be possible to get here. */
49 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
52 con_err("ast node missing destroy()\n");
56 /* Initialize main ast node aprts */
57 static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
59 self->node.context = ctx;
60 self->node.destroy = &_ast_node_destroy;
61 self->node.keep = false;
62 self->node.nodetype = nodetype;
63 self->node.side_effects = false;
66 /* weight and side effects */
67 static void _ast_propagate_effects(ast_node *self, ast_node *other)
69 if (ast_side_effects(other))
70 ast_side_effects(self) = true;
72 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
74 /* General expression initialization */
75 static void ast_expression_init(ast_expression *self,
76 ast_expression_codegen *codegen)
78 self->expression.codegen = codegen;
79 self->expression.vtype = TYPE_VOID;
80 self->expression.next = NULL;
81 self->expression.outl = NULL;
82 self->expression.outr = NULL;
83 self->expression.variadic = false;
84 self->expression.params = NULL;
87 static void ast_expression_delete(ast_expression *self)
90 if (self->expression.next)
91 ast_delete(self->expression.next);
92 for (i = 0; i < vec_size(self->expression.params); ++i) {
93 ast_delete(self->expression.params[i]);
95 vec_free(self->expression.params);
98 static void ast_expression_delete_full(ast_expression *self)
100 ast_expression_delete(self);
104 ast_value* ast_value_copy(const ast_value *self)
107 const ast_expression_common *fromex;
108 ast_expression_common *selfex;
109 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
110 if (self->expression.next) {
111 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
112 if (!cp->expression.next) {
113 ast_value_delete(cp);
117 fromex = &self->expression;
118 selfex = &cp->expression;
119 selfex->variadic = fromex->variadic;
120 for (i = 0; i < vec_size(fromex->params); ++i) {
121 ast_value *v = ast_value_copy(fromex->params[i]);
123 ast_value_delete(cp);
126 vec_push(selfex->params, v);
131 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
134 const ast_expression_common *fromex;
135 ast_expression_common *selfex;
136 self->expression.vtype = other->expression.vtype;
137 if (other->expression.next) {
138 self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
139 if (!self->expression.next)
142 fromex = &other->expression;
143 selfex = &self->expression;
144 selfex->variadic = fromex->variadic;
145 for (i = 0; i < vec_size(fromex->params); ++i) {
146 ast_value *v = ast_value_copy(fromex->params[i]);
149 vec_push(selfex->params, v);
154 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
156 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
157 ast_expression_init(self, NULL);
158 self->expression.codegen = NULL;
159 self->expression.next = NULL;
160 self->expression.vtype = vtype;
164 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
167 const ast_expression_common *fromex;
168 ast_expression_common *selfex;
174 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
175 ast_expression_init(self, NULL);
177 fromex = &ex->expression;
178 selfex = &self->expression;
180 /* This may never be codegen()d */
181 selfex->codegen = NULL;
183 selfex->vtype = fromex->vtype;
186 selfex->next = ast_type_copy(ctx, fromex->next);
188 ast_expression_delete_full(self);
195 selfex->variadic = fromex->variadic;
196 for (i = 0; i < vec_size(fromex->params); ++i) {
197 ast_value *v = ast_value_copy(fromex->params[i]);
199 ast_expression_delete_full(self);
202 vec_push(selfex->params, v);
209 bool ast_compare_type(ast_expression *a, ast_expression *b)
211 if (a->expression.vtype != b->expression.vtype)
213 if (!a->expression.next != !b->expression.next)
215 if (vec_size(a->expression.params) != vec_size(b->expression.params))
217 if (a->expression.variadic != b->expression.variadic)
219 if (vec_size(a->expression.params)) {
221 for (i = 0; i < vec_size(a->expression.params); ++i) {
222 if (!ast_compare_type((ast_expression*)a->expression.params[i],
223 (ast_expression*)b->expression.params[i]))
227 if (a->expression.next)
228 return ast_compare_type(a->expression.next, b->expression.next);
232 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
239 if (pos + 6 >= bufsize)
241 strcpy(buf + pos, "(null)");
245 if (pos + 1 >= bufsize)
248 switch (e->expression.vtype) {
250 strcpy(buf + pos, "(variant)");
255 return ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
258 if (pos + 3 >= bufsize)
262 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
263 if (pos + 1 >= bufsize)
269 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
270 if (pos + 2 >= bufsize)
272 if (!vec_size(e->expression.params)) {
278 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[0]), buf, bufsize, pos);
279 for (i = 1; i < vec_size(e->expression.params); ++i) {
280 if (pos + 2 >= bufsize)
284 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[i]), buf, bufsize, pos);
286 if (pos + 1 >= bufsize)
292 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
293 if (pos + 1 >= bufsize)
296 pos += snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->expression.count);
297 if (pos + 1 >= bufsize)
303 typestr = type_name[e->expression.vtype];
304 typelen = strlen(typestr);
305 if (pos + typelen >= bufsize)
307 strcpy(buf + pos, typestr);
308 return pos + typelen;
312 buf[bufsize-3] = '.';
313 buf[bufsize-2] = '.';
314 buf[bufsize-1] = '.';
318 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
320 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
324 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
326 ast_instantiate(ast_value, ctx, ast_value_delete);
327 ast_expression_init((ast_expression*)self,
328 (ast_expression_codegen*)&ast_value_codegen);
329 self->expression.node.keep = true; /* keep */
331 self->name = name ? util_strdup(name) : NULL;
332 self->expression.vtype = t;
333 self->expression.next = NULL;
334 self->constant = false;
335 self->hasvalue = false;
337 memset(&self->constval, 0, sizeof(self->constval));
340 self->ir_values = NULL;
341 self->ir_value_count = 0;
349 void ast_value_delete(ast_value* self)
352 mem_d((void*)self->name);
353 if (self->hasvalue) {
354 switch (self->expression.vtype)
357 mem_d((void*)self->constval.vstring);
360 /* unlink us from the function node */
361 self->constval.vfunc->vtype = NULL;
363 /* NOTE: delete function? currently collected in
364 * the parser structure
371 mem_d(self->ir_values);
372 ast_expression_delete((ast_expression*)self);
376 void ast_value_params_add(ast_value *self, ast_value *p)
378 vec_push(self->expression.params, p);
381 bool ast_value_set_name(ast_value *self, const char *name)
384 mem_d((void*)self->name);
385 self->name = util_strdup(name);
389 ast_binary* ast_binary_new(lex_ctx ctx, int op,
390 ast_expression* left, ast_expression* right)
392 ast_instantiate(ast_binary, ctx, ast_binary_delete);
393 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
399 ast_propagate_effects(self, left);
400 ast_propagate_effects(self, right);
402 if (op >= INSTR_EQ_F && op <= INSTR_GT)
403 self->expression.vtype = TYPE_FLOAT;
404 else if (op == INSTR_AND || op == INSTR_OR ||
405 op == INSTR_BITAND || op == INSTR_BITOR)
406 self->expression.vtype = TYPE_FLOAT;
407 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
408 self->expression.vtype = TYPE_VECTOR;
409 else if (op == INSTR_MUL_V)
410 self->expression.vtype = TYPE_FLOAT;
412 self->expression.vtype = left->expression.vtype;
417 void ast_binary_delete(ast_binary *self)
419 ast_unref(self->left);
420 ast_unref(self->right);
421 ast_expression_delete((ast_expression*)self);
425 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
426 ast_expression* left, ast_expression* right)
428 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
429 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
431 ast_side_effects(self) = true;
433 self->opstore = storop;
436 self->source = right;
438 self->expression.vtype = left->expression.vtype;
439 if (left->expression.next) {
440 self->expression.next = ast_type_copy(ctx, left);
441 if (!self->expression.next) {
447 self->expression.next = NULL;
452 void ast_binstore_delete(ast_binstore *self)
454 ast_unref(self->dest);
455 ast_unref(self->source);
456 ast_expression_delete((ast_expression*)self);
460 ast_unary* ast_unary_new(lex_ctx ctx, int op,
461 ast_expression *expr)
463 ast_instantiate(ast_unary, ctx, ast_unary_delete);
464 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
467 self->operand = expr;
469 ast_propagate_effects(self, expr);
471 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
472 self->expression.vtype = TYPE_FLOAT;
474 asterror(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
479 void ast_unary_delete(ast_unary *self)
481 ast_unref(self->operand);
482 ast_expression_delete((ast_expression*)self);
486 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
488 ast_instantiate(ast_return, ctx, ast_return_delete);
489 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
491 self->operand = expr;
494 ast_propagate_effects(self, expr);
499 void ast_return_delete(ast_return *self)
502 ast_unref(self->operand);
503 ast_expression_delete((ast_expression*)self);
507 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
509 if (field->expression.vtype != TYPE_FIELD) {
510 asterror(ctx, "ast_entfield_new with expression not of type field");
513 return ast_entfield_new_force(ctx, entity, field, field->expression.next);
516 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
518 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
522 /* Error: field has no type... */
526 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
528 self->entity = entity;
530 ast_propagate_effects(self, entity);
531 ast_propagate_effects(self, field);
533 if (!ast_type_adopt(self, outtype)) {
534 ast_entfield_delete(self);
541 void ast_entfield_delete(ast_entfield *self)
543 ast_unref(self->entity);
544 ast_unref(self->field);
545 ast_expression_delete((ast_expression*)self);
549 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field, const char *name)
551 ast_instantiate(ast_member, ctx, ast_member_delete);
557 if (owner->expression.vtype != TYPE_VECTOR &&
558 owner->expression.vtype != TYPE_FIELD) {
559 asterror(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
564 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
565 self->expression.node.keep = true; /* keep */
567 if (owner->expression.vtype == TYPE_VECTOR) {
568 self->expression.vtype = TYPE_FLOAT;
569 self->expression.next = NULL;
571 self->expression.vtype = TYPE_FIELD;
572 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
576 ast_propagate_effects(self, owner);
580 self->name = util_strdup(name);
587 void ast_member_delete(ast_member *self)
589 /* The owner is always an ast_value, which has .keep=true,
590 * also: ast_members are usually deleted after the owner, thus
591 * this will cause invalid access
592 ast_unref(self->owner);
593 * once we allow (expression).x to access a vector-member, we need
594 * to change this: preferably by creating an alternate ast node for this
595 * purpose that is not garbage-collected.
597 ast_expression_delete((ast_expression*)self);
601 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
603 ast_expression *outtype;
604 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
606 outtype = array->expression.next;
609 /* Error: field has no type... */
613 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
617 ast_propagate_effects(self, array);
618 ast_propagate_effects(self, index);
620 if (!ast_type_adopt(self, outtype)) {
621 ast_array_index_delete(self);
624 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
625 if (self->expression.vtype != TYPE_ARRAY) {
626 asterror(ast_ctx(self), "array_index node on type");
627 ast_array_index_delete(self);
630 self->array = outtype;
631 self->expression.vtype = TYPE_FIELD;
637 void ast_array_index_delete(ast_array_index *self)
639 ast_unref(self->array);
640 ast_unref(self->index);
641 ast_expression_delete((ast_expression*)self);
645 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
647 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
648 if (!ontrue && !onfalse) {
649 /* because it is invalid */
653 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
656 self->on_true = ontrue;
657 self->on_false = onfalse;
658 ast_propagate_effects(self, cond);
660 ast_propagate_effects(self, ontrue);
662 ast_propagate_effects(self, onfalse);
667 void ast_ifthen_delete(ast_ifthen *self)
669 ast_unref(self->cond);
671 ast_unref(self->on_true);
673 ast_unref(self->on_false);
674 ast_expression_delete((ast_expression*)self);
678 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
680 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
681 /* This time NEITHER must be NULL */
682 if (!ontrue || !onfalse) {
686 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
689 self->on_true = ontrue;
690 self->on_false = onfalse;
691 ast_propagate_effects(self, cond);
692 ast_propagate_effects(self, ontrue);
693 ast_propagate_effects(self, onfalse);
695 if (!ast_type_adopt(self, ontrue)) {
696 ast_ternary_delete(self);
703 void ast_ternary_delete(ast_ternary *self)
705 ast_unref(self->cond);
706 ast_unref(self->on_true);
707 ast_unref(self->on_false);
708 ast_expression_delete((ast_expression*)self);
712 ast_loop* ast_loop_new(lex_ctx ctx,
713 ast_expression *initexpr,
714 ast_expression *precond,
715 ast_expression *postcond,
716 ast_expression *increment,
717 ast_expression *body)
719 ast_instantiate(ast_loop, ctx, ast_loop_delete);
720 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
722 self->initexpr = initexpr;
723 self->precond = precond;
724 self->postcond = postcond;
725 self->increment = increment;
729 ast_propagate_effects(self, initexpr);
731 ast_propagate_effects(self, precond);
733 ast_propagate_effects(self, postcond);
735 ast_propagate_effects(self, increment);
737 ast_propagate_effects(self, body);
742 void ast_loop_delete(ast_loop *self)
745 ast_unref(self->initexpr);
747 ast_unref(self->precond);
749 ast_unref(self->postcond);
751 ast_unref(self->increment);
753 ast_unref(self->body);
754 ast_expression_delete((ast_expression*)self);
758 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont)
760 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
761 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
763 self->is_continue = iscont;
768 void ast_breakcont_delete(ast_breakcont *self)
770 ast_expression_delete((ast_expression*)self);
774 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
776 ast_instantiate(ast_switch, ctx, ast_switch_delete);
777 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
782 ast_propagate_effects(self, op);
787 void ast_switch_delete(ast_switch *self)
790 ast_unref(self->operand);
792 for (i = 0; i < vec_size(self->cases); ++i) {
793 if (self->cases[i].value)
794 ast_unref(self->cases[i].value);
795 ast_unref(self->cases[i].code);
797 vec_free(self->cases);
799 ast_expression_delete((ast_expression*)self);
803 ast_label* ast_label_new(lex_ctx ctx, const char *name)
805 ast_instantiate(ast_label, ctx, ast_label_delete);
806 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
808 self->name = util_strdup(name);
809 self->irblock = NULL;
814 void ast_label_delete(ast_label *self)
816 mem_d((void*)self->name);
817 ast_expression_delete((ast_expression*)self);
821 ast_call* ast_call_new(lex_ctx ctx,
822 ast_expression *funcexpr)
824 ast_instantiate(ast_call, ctx, ast_call_delete);
825 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
827 ast_side_effects(self) = true;
830 self->func = funcexpr;
832 self->expression.vtype = funcexpr->expression.next->expression.vtype;
833 if (funcexpr->expression.next->expression.next)
834 self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
839 void ast_call_delete(ast_call *self)
842 for (i = 0; i < vec_size(self->params); ++i)
843 ast_unref(self->params[i]);
844 vec_free(self->params);
847 ast_unref(self->func);
849 ast_expression_delete((ast_expression*)self);
853 bool ast_call_check_types(ast_call *self)
857 const ast_expression *func = self->func;
858 size_t count = vec_size(self->params);
859 if (count > vec_size(func->expression.params))
860 count = vec_size(func->expression.params);
862 for (i = 0; i < count; ++i) {
863 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
866 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
867 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
868 asterror(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
869 (unsigned int)(i+1), texp, tgot);
870 /* we don't immediately return */
877 ast_store* ast_store_new(lex_ctx ctx, int op,
878 ast_expression *dest, ast_expression *source)
880 ast_instantiate(ast_store, ctx, ast_store_delete);
881 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
883 ast_side_effects(self) = true;
887 self->source = source;
889 self->expression.vtype = dest->expression.vtype;
890 if (dest->expression.next) {
891 self->expression.next = ast_type_copy(ctx, dest);
892 if (!self->expression.next) {
898 self->expression.next = NULL;
903 void ast_store_delete(ast_store *self)
905 ast_unref(self->dest);
906 ast_unref(self->source);
907 ast_expression_delete((ast_expression*)self);
911 ast_block* ast_block_new(lex_ctx ctx)
913 ast_instantiate(ast_block, ctx, ast_block_delete);
914 ast_expression_init((ast_expression*)self,
915 (ast_expression_codegen*)&ast_block_codegen);
919 self->collect = NULL;
924 void ast_block_add_expr(ast_block *self, ast_expression *e)
926 ast_propagate_effects(self, e);
927 vec_push(self->exprs, e);
930 void ast_block_collect(ast_block *self, ast_expression *expr)
932 vec_push(self->collect, expr);
933 expr->expression.node.keep = true;
936 void ast_block_delete(ast_block *self)
939 for (i = 0; i < vec_size(self->exprs); ++i)
940 ast_unref(self->exprs[i]);
941 vec_free(self->exprs);
942 for (i = 0; i < vec_size(self->locals); ++i)
943 ast_delete(self->locals[i]);
944 vec_free(self->locals);
945 for (i = 0; i < vec_size(self->collect); ++i)
946 ast_delete(self->collect[i]);
947 vec_free(self->collect);
948 ast_expression_delete((ast_expression*)self);
952 bool ast_block_set_type(ast_block *self, ast_expression *from)
954 if (self->expression.next)
955 ast_delete(self->expression.next);
956 self->expression.vtype = from->expression.vtype;
957 if (from->expression.next) {
958 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
959 if (!self->expression.next)
963 self->expression.next = NULL;
967 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
969 ast_instantiate(ast_function, ctx, ast_function_delete);
973 vtype->expression.vtype != TYPE_FUNCTION)
975 asterror(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i",
977 (int)vtype->hasvalue,
978 vtype->expression.vtype);
984 self->name = name ? util_strdup(name) : NULL;
987 self->labelcount = 0;
990 self->ir_func = NULL;
991 self->curblock = NULL;
993 self->breakblock = NULL;
994 self->continueblock = NULL;
996 vtype->hasvalue = true;
997 vtype->constval.vfunc = self;
1002 void ast_function_delete(ast_function *self)
1006 mem_d((void*)self->name);
1008 /* ast_value_delete(self->vtype); */
1009 self->vtype->hasvalue = false;
1010 self->vtype->constval.vfunc = NULL;
1011 /* We use unref - if it was stored in a global table it is supposed
1012 * to be deleted from *there*
1014 ast_unref(self->vtype);
1016 for (i = 0; i < vec_size(self->blocks); ++i)
1017 ast_delete(self->blocks[i]);
1018 vec_free(self->blocks);
1022 const char* ast_function_label(ast_function *self, const char *prefix)
1028 if (!opts_dump && !opts_dumpfin)
1031 id = (self->labelcount++);
1032 len = strlen(prefix);
1034 from = self->labelbuf + sizeof(self->labelbuf)-1;
1037 unsigned int digit = id % 10;
1038 *from = digit + '0';
1041 memcpy(from - len, prefix, len);
1045 /*********************************************************************/
1047 * by convention you must never pass NULL to the 'ir_value **out'
1048 * parameter. If you really don't care about the output, pass a dummy.
1049 * But I can't imagine a pituation where the output is truly unnecessary.
1052 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1056 /* NOTE: This is the codegen for a variable used in an expression.
1057 * It is not the codegen to generate the value. For this purpose,
1058 * ast_local_codegen and ast_global_codegen are to be used before this
1059 * is executed. ast_function_codegen should take care of its locals,
1060 * and the ast-user should take care of ast_global_codegen to be used
1061 * on all the globals.
1064 char typename[1024];
1065 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
1066 asterror(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
1073 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1077 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1079 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1082 func->context = ast_ctx(self);
1083 func->value->context = ast_ctx(self);
1085 self->constval.vfunc->ir_func = func;
1086 self->ir_v = func->value;
1087 /* The function is filled later on ast_function_codegen... */
1091 if (isfield && self->expression.vtype == TYPE_FIELD) {
1092 ast_expression *fieldtype = self->expression.next;
1094 if (self->hasvalue) {
1095 asterror(ast_ctx(self), "TODO: constant field pointers with value");
1099 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1104 ast_expression_common *elemtype;
1106 ast_value *array = (ast_value*)fieldtype;
1108 if (!ast_istype(fieldtype, ast_value)) {
1109 asterror(ast_ctx(self), "internal error: ast_value required");
1113 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1114 if (!array->expression.count || array->expression.count > opts_max_array_size)
1115 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1117 elemtype = &array->expression.next->expression;
1118 vtype = elemtype->vtype;
1120 v = ir_builder_create_field(ir, self->name, vtype);
1122 asterror(ast_ctx(self), "ir_builder_create_global failed");
1125 if (vtype == TYPE_FIELD)
1126 v->fieldtype = elemtype->next->expression.vtype;
1127 v->context = ast_ctx(self);
1128 array->ir_v = self->ir_v = v;
1130 namelen = strlen(self->name);
1131 name = (char*)mem_a(namelen + 16);
1132 strcpy(name, self->name);
1134 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1135 array->ir_values[0] = v;
1136 for (ai = 1; ai < array->expression.count; ++ai) {
1137 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1138 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1139 if (!array->ir_values[ai]) {
1141 asterror(ast_ctx(self), "ir_builder_create_global failed");
1144 if (vtype == TYPE_FIELD)
1145 array->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1146 array->ir_values[ai]->context = ast_ctx(self);
1152 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1155 v->context = ast_ctx(self);
1161 if (self->expression.vtype == TYPE_ARRAY) {
1166 ast_expression_common *elemtype = &self->expression.next->expression;
1167 int vtype = elemtype->vtype;
1169 /* same as with field arrays */
1170 if (!self->expression.count || self->expression.count > opts_max_array_size)
1171 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1173 v = ir_builder_create_global(ir, self->name, vtype);
1175 asterror(ast_ctx(self), "ir_builder_create_global failed");
1178 if (vtype == TYPE_FIELD)
1179 v->fieldtype = elemtype->next->expression.vtype;
1180 v->context = ast_ctx(self);
1182 namelen = strlen(self->name);
1183 name = (char*)mem_a(namelen + 16);
1184 strcpy(name, self->name);
1186 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1187 self->ir_values[0] = v;
1188 for (ai = 1; ai < self->expression.count; ++ai) {
1189 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1190 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1191 if (!self->ir_values[ai]) {
1193 asterror(ast_ctx(self), "ir_builder_create_global failed");
1196 if (vtype == TYPE_FIELD)
1197 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1198 self->ir_values[ai]->context = ast_ctx(self);
1204 /* Arrays don't do this since there's no "array" value which spans across the
1207 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1209 asterror(ast_ctx(self), "ir_builder_create_global failed");
1212 if (self->expression.vtype == TYPE_FIELD)
1213 v->fieldtype = self->expression.next->expression.vtype;
1214 v->context = ast_ctx(self);
1217 if (self->hasvalue) {
1218 switch (self->expression.vtype)
1221 if (!ir_value_set_float(v, self->constval.vfloat))
1225 if (!ir_value_set_vector(v, self->constval.vvec))
1229 if (!ir_value_set_string(v, self->constval.vstring))
1233 asterror(ast_ctx(self), "TODO: global constant array");
1236 asterror(ast_ctx(self), "global of type function not properly generated");
1238 /* Cannot generate an IR value for a function,
1239 * need a pointer pointing to a function rather.
1242 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1247 /* link us to the ir_value */
1251 error: /* clean up */
1256 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1259 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1261 /* Do we allow local functions? I think not...
1262 * this is NOT a function pointer atm.
1267 if (self->expression.vtype == TYPE_ARRAY) {
1272 ast_expression_common *elemtype = &self->expression.next->expression;
1273 int vtype = elemtype->vtype;
1276 asterror(ast_ctx(self), "array-parameters are not supported");
1280 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1281 if (!self->expression.count || self->expression.count > opts_max_array_size) {
1282 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1285 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1286 if (!self->ir_values) {
1287 asterror(ast_ctx(self), "failed to allocate array values");
1291 v = ir_function_create_local(func, self->name, vtype, param);
1293 asterror(ast_ctx(self), "ir_function_create_local failed");
1296 if (vtype == TYPE_FIELD)
1297 v->fieldtype = elemtype->next->expression.vtype;
1298 v->context = ast_ctx(self);
1300 namelen = strlen(self->name);
1301 name = (char*)mem_a(namelen + 16);
1302 strcpy(name, self->name);
1304 self->ir_values[0] = v;
1305 for (ai = 1; ai < self->expression.count; ++ai) {
1306 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1307 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1308 if (!self->ir_values[ai]) {
1309 asterror(ast_ctx(self), "ir_builder_create_global failed");
1312 if (vtype == TYPE_FIELD)
1313 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1314 self->ir_values[ai]->context = ast_ctx(self);
1319 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1322 if (self->expression.vtype == TYPE_FIELD)
1323 v->fieldtype = self->expression.next->expression.vtype;
1324 v->context = ast_ctx(self);
1327 /* A constant local... hmmm...
1328 * I suppose the IR will have to deal with this
1330 if (self->hasvalue) {
1331 switch (self->expression.vtype)
1334 if (!ir_value_set_float(v, self->constval.vfloat))
1338 if (!ir_value_set_vector(v, self->constval.vvec))
1342 if (!ir_value_set_string(v, self->constval.vstring))
1346 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1351 /* link us to the ir_value */
1355 if (!ast_global_codegen(self->setter, func->owner, false) ||
1356 !ast_function_codegen(self->setter->constval.vfunc, func->owner) ||
1357 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1361 if (!ast_global_codegen(self->getter, func->owner, false) ||
1362 !ast_function_codegen(self->getter->constval.vfunc, func->owner) ||
1363 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1368 error: /* clean up */
1373 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1377 ast_expression_common *ec;
1382 irf = self->ir_func;
1384 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1388 /* fill the parameter list */
1389 ec = &self->vtype->expression;
1390 for (i = 0; i < vec_size(ec->params); ++i)
1392 vec_push(irf->params, ec->params[i]->expression.vtype);
1393 if (!self->builtin) {
1394 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1399 if (self->builtin) {
1400 irf->builtin = self->builtin;
1404 if (!vec_size(self->blocks)) {
1405 asterror(ast_ctx(self), "function `%s` has no body", self->name);
1409 self->curblock = ir_function_create_block(irf, "entry");
1410 if (!self->curblock) {
1411 asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1415 for (i = 0; i < vec_size(self->blocks); ++i) {
1416 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1417 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1421 /* TODO: check return types */
1422 if (!self->curblock->is_return)
1424 return ir_block_create_return(self->curblock, NULL);
1425 /* From now on the parser has to handle this situation */
1427 if (!self->vtype->expression.next ||
1428 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1430 return ir_block_create_return(self->curblock, NULL);
1434 /* error("missing return"); */
1435 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
1443 /* Note, you will not see ast_block_codegen generate ir_blocks.
1444 * To the AST and the IR, blocks are 2 different things.
1445 * In the AST it represents a block of code, usually enclosed in
1446 * curly braces {...}.
1447 * While in the IR it represents a block in terms of control-flow.
1449 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1453 /* We don't use this
1454 * Note: an ast-representation using the comma-operator
1455 * of the form: (a, b, c) = x should not assign to c...
1458 asterror(ast_ctx(self), "not an l-value (code-block)");
1462 if (self->expression.outr) {
1463 *out = self->expression.outr;
1467 /* output is NULL at first, we'll have each expression
1468 * assign to out output, thus, a comma-operator represention
1469 * using an ast_block will return the last generated value,
1470 * so: (b, c) + a executed both b and c, and returns c,
1471 * which is then added to a.
1475 /* generate locals */
1476 for (i = 0; i < vec_size(self->locals); ++i)
1478 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1480 asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1485 for (i = 0; i < vec_size(self->exprs); ++i)
1487 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1488 if (func->curblock->final) {
1489 asterror(ast_ctx(self->exprs[i]), "unreachable statement");
1492 if (!(*gen)(self->exprs[i], func, false, out))
1496 self->expression.outr = *out;
1501 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1503 ast_expression_codegen *cgen;
1504 ir_value *left = NULL;
1505 ir_value *right = NULL;
1509 ast_array_index *ai = NULL;
1511 if (lvalue && self->expression.outl) {
1512 *out = self->expression.outl;
1516 if (!lvalue && self->expression.outr) {
1517 *out = self->expression.outr;
1521 if (ast_istype(self->dest, ast_array_index))
1524 ai = (ast_array_index*)self->dest;
1525 idx = (ast_value*)ai->index;
1527 if (ast_istype(ai->index, ast_value) && idx->hasvalue)
1532 /* we need to call the setter */
1533 ir_value *iridx, *funval;
1537 asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1541 arr = (ast_value*)ai->array;
1542 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1543 asterror(ast_ctx(self), "value has no setter (%s)", arr->name);
1547 cgen = idx->expression.codegen;
1548 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1551 cgen = arr->setter->expression.codegen;
1552 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1555 cgen = self->source->expression.codegen;
1556 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1559 call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval);
1562 ir_call_param(call, iridx);
1563 ir_call_param(call, right);
1564 self->expression.outr = right;
1570 cgen = self->dest->expression.codegen;
1572 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1574 self->expression.outl = left;
1576 cgen = self->source->expression.codegen;
1578 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1581 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1583 self->expression.outr = right;
1586 /* Theoretically, an assinment returns its left side as an
1587 * lvalue, if we don't need an lvalue though, we return
1588 * the right side as an rvalue, otherwise we have to
1589 * somehow know whether or not we need to dereference the pointer
1590 * on the left side - that is: OP_LOAD if it was an address.
1591 * Also: in original QC we cannot OP_LOADP *anyway*.
1593 *out = (lvalue ? left : right);
1598 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1600 ast_expression_codegen *cgen;
1601 ir_value *left, *right;
1603 /* A binary operation cannot yield an l-value */
1605 asterror(ast_ctx(self), "not an l-value (binop)");
1609 if (self->expression.outr) {
1610 *out = self->expression.outr;
1614 if (OPTS_FLAG(SHORT_LOGIC) &&
1615 (self->op == INSTR_AND || self->op == INSTR_OR))
1617 /* short circuit evaluation */
1618 ir_block *other, *merge;
1619 ir_block *from_left, *from_right;
1624 /* Note about casting to true boolean values:
1625 * We use a single NOT for sub expressions, and an
1626 * overall NOT at the end, and for that purpose swap
1627 * all the jump conditions in order for the NOT to get
1629 * ie: (a && b) usually becomes (!!a ? !!b : !!a)
1630 * but we translate this to (!(!a ? !a : !b))
1633 merge_id = vec_size(func->ir_func->blocks);
1634 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_merge"));
1636 cgen = self->left->expression.codegen;
1637 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1639 if (!OPTS_FLAG(PERL_LOGIC)) {
1640 notop = type_not_instr[left->vtype];
1641 if (notop == AINSTR_END) {
1642 asterror(ast_ctx(self), "don't know how to cast to bool...");
1645 left = ir_block_create_unary(func->curblock,
1646 ast_function_label(func, "sce_not"),
1650 from_left = func->curblock;
1652 other = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_other"));
1653 if ( !(self->op == INSTR_OR) != !OPTS_FLAG(PERL_LOGIC) ) {
1654 if (!ir_block_create_if(func->curblock, left, other, merge))
1657 if (!ir_block_create_if(func->curblock, left, merge, other))
1660 /* use the likely flag */
1661 vec_last(func->curblock->instr)->likely = true;
1663 func->curblock = other;
1664 cgen = self->right->expression.codegen;
1665 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1667 if (!OPTS_FLAG(PERL_LOGIC)) {
1668 notop = type_not_instr[right->vtype];
1669 if (notop == AINSTR_END) {
1670 asterror(ast_ctx(self), "don't know how to cast to bool...");
1673 right = ir_block_create_unary(func->curblock,
1674 ast_function_label(func, "sce_not"),
1678 from_right = func->curblock;
1680 if (!ir_block_create_jump(func->curblock, merge))
1683 vec_remove(func->ir_func->blocks, merge_id, 1);
1684 vec_push(func->ir_func->blocks, merge);
1686 func->curblock = merge;
1687 phi = ir_block_create_phi(func->curblock, ast_function_label(func, "sce_value"), TYPE_FLOAT);
1688 ir_phi_add(phi, from_left, left);
1689 ir_phi_add(phi, from_right, right);
1690 *out = ir_phi_value(phi);
1691 if (!OPTS_FLAG(PERL_LOGIC)) {
1692 notop = type_not_instr[(*out)->vtype];
1693 if (notop == AINSTR_END) {
1694 asterror(ast_ctx(self), "don't know how to cast to bool...");
1697 *out = ir_block_create_unary(func->curblock,
1698 ast_function_label(func, "sce_final_not"),
1704 self->expression.outr = *out;
1708 cgen = self->left->expression.codegen;
1709 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1712 cgen = self->right->expression.codegen;
1713 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1716 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1717 self->op, left, right);
1720 self->expression.outr = *out;
1725 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1727 ast_expression_codegen *cgen;
1728 ir_value *leftl = NULL, *leftr, *right, *bin;
1732 ast_array_index *ai = NULL;
1733 ir_value *iridx = NULL;
1735 if (lvalue && self->expression.outl) {
1736 *out = self->expression.outl;
1740 if (!lvalue && self->expression.outr) {
1741 *out = self->expression.outr;
1745 if (ast_istype(self->dest, ast_array_index))
1748 ai = (ast_array_index*)self->dest;
1749 idx = (ast_value*)ai->index;
1751 if (ast_istype(ai->index, ast_value) && idx->hasvalue)
1755 /* for a binstore we need both an lvalue and an rvalue for the left side */
1756 /* rvalue of destination! */
1758 cgen = idx->expression.codegen;
1759 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1762 cgen = self->dest->expression.codegen;
1763 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1766 /* source as rvalue only */
1767 cgen = self->source->expression.codegen;
1768 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1771 /* now the binary */
1772 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1773 self->opbin, leftr, right);
1774 self->expression.outr = bin;
1778 /* we need to call the setter */
1783 asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1787 arr = (ast_value*)ai->array;
1788 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1789 asterror(ast_ctx(self), "value has no setter (%s)", arr->name);
1793 cgen = arr->setter->expression.codegen;
1794 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1797 call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval);
1800 ir_call_param(call, iridx);
1801 ir_call_param(call, bin);
1802 self->expression.outr = bin;
1804 /* now store them */
1805 cgen = self->dest->expression.codegen;
1806 /* lvalue of destination */
1807 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1809 self->expression.outl = leftl;
1811 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1813 self->expression.outr = bin;
1816 /* Theoretically, an assinment returns its left side as an
1817 * lvalue, if we don't need an lvalue though, we return
1818 * the right side as an rvalue, otherwise we have to
1819 * somehow know whether or not we need to dereference the pointer
1820 * on the left side - that is: OP_LOAD if it was an address.
1821 * Also: in original QC we cannot OP_LOADP *anyway*.
1823 *out = (lvalue ? leftl : bin);
1828 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1830 ast_expression_codegen *cgen;
1833 /* An unary operation cannot yield an l-value */
1835 asterror(ast_ctx(self), "not an l-value (binop)");
1839 if (self->expression.outr) {
1840 *out = self->expression.outr;
1844 cgen = self->operand->expression.codegen;
1846 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1849 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1853 self->expression.outr = *out;
1858 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1860 ast_expression_codegen *cgen;
1865 /* In the context of a return operation, we don't actually return
1869 asterror(ast_ctx(self), "return-expression is not an l-value");
1873 if (self->expression.outr) {
1874 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1877 self->expression.outr = (ir_value*)1;
1879 if (self->operand) {
1880 cgen = self->operand->expression.codegen;
1882 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1885 if (!ir_block_create_return(func->curblock, operand))
1888 if (!ir_block_create_return(func->curblock, NULL))
1895 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1897 ast_expression_codegen *cgen;
1898 ir_value *ent, *field;
1900 /* This function needs to take the 'lvalue' flag into account!
1901 * As lvalue we provide a field-pointer, as rvalue we provide the
1905 if (lvalue && self->expression.outl) {
1906 *out = self->expression.outl;
1910 if (!lvalue && self->expression.outr) {
1911 *out = self->expression.outr;
1915 cgen = self->entity->expression.codegen;
1916 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1919 cgen = self->field->expression.codegen;
1920 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1925 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1928 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1929 ent, field, self->expression.vtype);
1932 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1933 (lvalue ? "ADDRESS" : "FIELD"),
1934 type_name[self->expression.vtype]);
1939 self->expression.outl = *out;
1941 self->expression.outr = *out;
1943 /* Hm that should be it... */
1947 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1949 ast_expression_codegen *cgen;
1952 /* in QC this is always an lvalue */
1954 if (self->expression.outl) {
1955 *out = self->expression.outl;
1959 cgen = self->owner->expression.codegen;
1960 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1963 if (vec->vtype != TYPE_VECTOR &&
1964 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1969 *out = ir_value_vector_member(vec, self->field);
1970 self->expression.outl = *out;
1972 return (*out != NULL);
1975 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
1980 if (!lvalue && self->expression.outr) {
1981 *out = self->expression.outr;
1983 if (lvalue && self->expression.outl) {
1984 *out = self->expression.outl;
1987 if (!ast_istype(self->array, ast_value)) {
1988 asterror(ast_ctx(self), "array indexing this way is not supported");
1989 /* note this would actually be pointer indexing because the left side is
1990 * not an actual array but (hopefully) an indexable expression.
1991 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
1992 * support this path will be filled.
1997 arr = (ast_value*)self->array;
1998 idx = (ast_value*)self->index;
2000 if (!ast_istype(self->index, ast_value) || !idx->hasvalue) {
2001 /* Time to use accessor functions */
2002 ast_expression_codegen *cgen;
2003 ir_value *iridx, *funval;
2007 asterror(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2012 asterror(ast_ctx(self), "value has no getter, don't know how to index it");
2016 cgen = self->index->expression.codegen;
2017 if (!(*cgen)((ast_expression*)(self->index), func, true, &iridx))
2020 cgen = arr->getter->expression.codegen;
2021 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2024 call = ir_block_create_call(func->curblock, ast_function_label(func, "fetch"), funval);
2027 ir_call_param(call, iridx);
2029 *out = ir_call_value(call);
2030 self->expression.outr = *out;
2034 if (idx->expression.vtype == TYPE_FLOAT)
2035 *out = arr->ir_values[(int)idx->constval.vfloat];
2036 else if (idx->expression.vtype == TYPE_INTEGER)
2037 *out = arr->ir_values[idx->constval.vint];
2039 asterror(ast_ctx(self), "array indexing here needs an integer constant");
2045 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2047 ast_expression_codegen *cgen;
2052 ir_block *cond = func->curblock;
2055 ir_block *ontrue_endblock = NULL;
2056 ir_block *onfalse_endblock = NULL;
2059 /* We don't output any value, thus also don't care about r/lvalue */
2063 if (self->expression.outr) {
2064 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2067 self->expression.outr = (ir_value*)1;
2069 /* generate the condition */
2070 cgen = self->cond->expression.codegen;
2071 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2073 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2074 cond = func->curblock;
2078 if (self->on_true) {
2079 /* create on-true block */
2080 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
2084 /* enter the block */
2085 func->curblock = ontrue;
2088 cgen = self->on_true->expression.codegen;
2089 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2092 /* we now need to work from the current endpoint */
2093 ontrue_endblock = func->curblock;
2098 if (self->on_false) {
2099 /* create on-false block */
2100 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
2104 /* enter the block */
2105 func->curblock = onfalse;
2108 cgen = self->on_false->expression.codegen;
2109 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2112 /* we now need to work from the current endpoint */
2113 onfalse_endblock = func->curblock;
2117 /* Merge block were they all merge in to */
2118 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
2121 /* add jumps ot the merge block */
2122 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
2124 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
2127 /* we create the if here, that way all blocks are ordered :)
2129 if (!ir_block_create_if(cond, condval,
2130 (ontrue ? ontrue : merge),
2131 (onfalse ? onfalse : merge)))
2136 /* Now enter the merge block */
2137 func->curblock = merge;
2142 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2144 ast_expression_codegen *cgen;
2147 ir_value *trueval, *falseval;
2150 ir_block *cond = func->curblock;
2155 /* Ternary can never create an lvalue... */
2159 /* In theory it shouldn't be possible to pass through a node twice, but
2160 * in case we add any kind of optimization pass for the AST itself, it
2161 * may still happen, thus we remember a created ir_value and simply return one
2162 * if it already exists.
2164 if (self->expression.outr) {
2165 *out = self->expression.outr;
2169 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2171 /* generate the condition */
2172 func->curblock = cond;
2173 cgen = self->cond->expression.codegen;
2174 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2177 /* create on-true block */
2178 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
2183 /* enter the block */
2184 func->curblock = ontrue;
2187 cgen = self->on_true->expression.codegen;
2188 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2192 /* create on-false block */
2193 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
2198 /* enter the block */
2199 func->curblock = onfalse;
2202 cgen = self->on_false->expression.codegen;
2203 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2207 /* create merge block */
2208 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
2211 /* jump to merge block */
2212 if (!ir_block_create_jump(ontrue, merge))
2214 if (!ir_block_create_jump(onfalse, merge))
2217 /* create if instruction */
2218 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
2221 /* Now enter the merge block */
2222 func->curblock = merge;
2224 /* Here, now, we need a PHI node
2225 * but first some sanity checking...
2227 if (trueval->vtype != falseval->vtype) {
2228 /* error("ternary with different types on the two sides"); */
2233 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
2236 ir_phi_add(phi, ontrue, trueval);
2237 ir_phi_add(phi, onfalse, falseval);
2239 self->expression.outr = ir_phi_value(phi);
2240 *out = self->expression.outr;
2245 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2247 ast_expression_codegen *cgen;
2249 ir_value *dummy = NULL;
2250 ir_value *precond = NULL;
2251 ir_value *postcond = NULL;
2253 /* Since we insert some jumps "late" so we have blocks
2254 * ordered "nicely", we need to keep track of the actual end-blocks
2255 * of expressions to add the jumps to.
2257 ir_block *bbody = NULL, *end_bbody = NULL;
2258 ir_block *bprecond = NULL, *end_bprecond = NULL;
2259 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2260 ir_block *bincrement = NULL, *end_bincrement = NULL;
2261 ir_block *bout = NULL, *bin = NULL;
2263 /* let's at least move the outgoing block to the end */
2266 /* 'break' and 'continue' need to be able to find the right blocks */
2267 ir_block *bcontinue = NULL;
2268 ir_block *bbreak = NULL;
2270 ir_block *old_bcontinue = NULL;
2271 ir_block *old_bbreak = NULL;
2273 ir_block *tmpblock = NULL;
2278 if (self->expression.outr) {
2279 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2282 self->expression.outr = (ir_value*)1;
2285 * Should we ever need some kind of block ordering, better make this function
2286 * move blocks around than write a block ordering algorithm later... after all
2287 * the ast and ir should work together, not against each other.
2290 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2291 * anyway if for example it contains a ternary.
2295 cgen = self->initexpr->expression.codegen;
2296 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2300 /* Store the block from which we enter this chaos */
2301 bin = func->curblock;
2303 /* The pre-loop condition needs its own block since we
2304 * need to be able to jump to the start of that expression.
2308 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
2312 /* the pre-loop-condition the least important place to 'continue' at */
2313 bcontinue = bprecond;
2316 func->curblock = bprecond;
2319 cgen = self->precond->expression.codegen;
2320 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2323 end_bprecond = func->curblock;
2325 bprecond = end_bprecond = NULL;
2328 /* Now the next blocks won't be ordered nicely, but we need to
2329 * generate them this early for 'break' and 'continue'.
2331 if (self->increment) {
2332 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
2335 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2337 bincrement = end_bincrement = NULL;
2340 if (self->postcond) {
2341 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
2344 bcontinue = bpostcond; /* postcond comes before the increment */
2346 bpostcond = end_bpostcond = NULL;
2349 bout_id = vec_size(func->ir_func->blocks);
2350 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
2355 /* The loop body... */
2358 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
2363 func->curblock = bbody;
2365 old_bbreak = func->breakblock;
2366 old_bcontinue = func->continueblock;
2367 func->breakblock = bbreak;
2368 func->continueblock = bcontinue;
2371 cgen = self->body->expression.codegen;
2372 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2375 end_bbody = func->curblock;
2376 func->breakblock = old_bbreak;
2377 func->continueblock = old_bcontinue;
2380 /* post-loop-condition */
2384 func->curblock = bpostcond;
2387 cgen = self->postcond->expression.codegen;
2388 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2391 end_bpostcond = func->curblock;
2394 /* The incrementor */
2395 if (self->increment)
2398 func->curblock = bincrement;
2401 cgen = self->increment->expression.codegen;
2402 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2405 end_bincrement = func->curblock;
2408 /* In any case now, we continue from the outgoing block */
2409 func->curblock = bout;
2411 /* Now all blocks are in place */
2412 /* From 'bin' we jump to whatever comes first */
2413 if (bprecond) tmpblock = bprecond;
2414 else if (bbody) tmpblock = bbody;
2415 else if (bpostcond) tmpblock = bpostcond;
2416 else tmpblock = bout;
2417 if (!ir_block_create_jump(bin, tmpblock))
2423 ir_block *ontrue, *onfalse;
2424 if (bbody) ontrue = bbody;
2425 else if (bincrement) ontrue = bincrement;
2426 else if (bpostcond) ontrue = bpostcond;
2427 else ontrue = bprecond;
2429 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
2436 if (bincrement) tmpblock = bincrement;
2437 else if (bpostcond) tmpblock = bpostcond;
2438 else if (bprecond) tmpblock = bprecond;
2439 else tmpblock = bout;
2440 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
2444 /* from increment */
2447 if (bpostcond) tmpblock = bpostcond;
2448 else if (bprecond) tmpblock = bprecond;
2449 else if (bbody) tmpblock = bbody;
2450 else tmpblock = bout;
2451 if (!ir_block_create_jump(end_bincrement, tmpblock))
2458 ir_block *ontrue, *onfalse;
2459 if (bprecond) ontrue = bprecond;
2460 else if (bbody) ontrue = bbody;
2461 else if (bincrement) ontrue = bincrement;
2462 else ontrue = bpostcond;
2464 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
2468 /* Move 'bout' to the end */
2469 vec_remove(func->ir_func->blocks, bout_id, 1);
2470 vec_push(func->ir_func->blocks, bout);
2475 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2482 asterror(ast_ctx(self), "break/continue expression is not an l-value");
2486 if (self->expression.outr) {
2487 asterror(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2490 self->expression.outr = (ir_value*)1;
2492 if (self->is_continue)
2493 target = func->continueblock;
2495 target = func->breakblock;
2497 if (!ir_block_create_jump(func->curblock, target))
2502 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2504 ast_expression_codegen *cgen;
2506 ast_switch_case *def_case = NULL;
2507 ir_block *def_bfall = NULL;
2509 ir_value *dummy = NULL;
2510 ir_value *irop = NULL;
2511 ir_block *old_break = NULL;
2512 ir_block *bout = NULL;
2513 ir_block *bfall = NULL;
2521 asterror(ast_ctx(self), "switch expression is not an l-value");
2525 if (self->expression.outr) {
2526 asterror(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2529 self->expression.outr = (ir_value*)1;
2534 cgen = self->operand->expression.codegen;
2535 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2538 if (!vec_size(self->cases))
2541 cmpinstr = type_eq_instr[irop->vtype];
2542 if (cmpinstr >= AINSTR_END) {
2543 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2544 asterror(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2548 bout_id = vec_size(func->ir_func->blocks);
2549 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_switch"));
2553 /* setup the break block */
2554 old_break = func->breakblock;
2555 func->breakblock = bout;
2557 /* Now create all cases */
2558 for (c = 0; c < vec_size(self->cases); ++c) {
2559 ir_value *cond, *val;
2560 ir_block *bcase, *bnot;
2563 ast_switch_case *swcase = &self->cases[c];
2565 if (swcase->value) {
2566 /* A regular case */
2567 /* generate the condition operand */
2568 cgen = swcase->value->expression.codegen;
2569 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2571 /* generate the condition */
2572 cond = ir_block_create_binop(func->curblock, ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2576 bcase = ir_function_create_block(func->ir_func, ast_function_label(func, "case"));
2577 bnot_id = vec_size(func->ir_func->blocks);
2578 bnot = ir_function_create_block(func->ir_func, ast_function_label(func, "not_case"));
2579 if (!bcase || !bnot)
2581 if (!ir_block_create_if(func->curblock, cond, bcase, bnot))
2584 /* Make the previous case-end fall through */
2585 if (bfall && !bfall->final) {
2586 if (!ir_block_create_jump(bfall, bcase))
2590 /* enter the case */
2591 func->curblock = bcase;
2592 cgen = swcase->code->expression.codegen;
2593 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2596 /* remember this block to fall through from */
2597 bfall = func->curblock;
2599 /* enter the else and move it down */
2600 func->curblock = bnot;
2601 vec_remove(func->ir_func->blocks, bnot_id, 1);
2602 vec_push(func->ir_func->blocks, bnot);
2604 /* The default case */
2605 /* Remember where to fall through from: */
2608 /* remember which case it was */
2613 /* Jump from the last bnot to bout */
2614 if (bfall && !bfall->final && !ir_block_create_jump(bfall, bout)) {
2616 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2621 /* If there was a default case, put it down here */
2625 /* No need to create an extra block */
2626 bcase = func->curblock;
2628 /* Insert the fallthrough jump */
2629 if (def_bfall && !def_bfall->final) {
2630 if (!ir_block_create_jump(def_bfall, bcase))
2634 /* Now generate the default code */
2635 cgen = def_case->code->expression.codegen;
2636 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2640 /* Jump from the last bnot to bout */
2641 if (!func->curblock->final && !ir_block_create_jump(func->curblock, bout))
2643 /* enter the outgoing block */
2644 func->curblock = bout;
2646 /* restore the break block */
2647 func->breakblock = old_break;
2649 /* Move 'bout' to the end, it's nicer */
2650 vec_remove(func->ir_func->blocks, bout_id, 1);
2651 vec_push(func->ir_func->blocks, bout);
2656 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2660 asterror(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2664 /* simply create a new block and jump to it */
2665 self->irblock = ir_function_create_block(func->ir_func, self->name);
2666 if (!self->irblock) {
2667 asterror(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2670 if (!func->curblock->final) {
2671 if (!ir_block_create_jump(func->curblock, self->irblock))
2675 /* enter the new block */
2676 func->curblock = self->irblock;
2680 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2682 ast_expression_codegen *cgen;
2684 ir_instr *callinstr;
2687 ir_value *funval = NULL;
2689 /* return values are never lvalues */
2691 asterror(ast_ctx(self), "not an l-value (function call)");
2695 if (self->expression.outr) {
2696 *out = self->expression.outr;
2700 cgen = self->func->expression.codegen;
2701 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2709 for (i = 0; i < vec_size(self->params); ++i)
2712 ast_expression *expr = self->params[i];
2714 cgen = expr->expression.codegen;
2715 if (!(*cgen)(expr, func, false, ¶m))
2719 vec_push(params, param);
2722 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
2726 for (i = 0; i < vec_size(params); ++i) {
2727 ir_call_param(callinstr, params[i]);
2730 *out = ir_call_value(callinstr);
2731 self->expression.outr = *out;