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;
815 void ast_label_delete(ast_label *self)
817 mem_d((void*)self->name);
818 vec_free(self->gotos);
819 ast_expression_delete((ast_expression*)self);
823 void ast_label_register_goto(ast_label *self, ast_goto *g)
825 vec_push(self->gotos, g);
828 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
830 ast_instantiate(ast_goto, ctx, ast_goto_delete);
831 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
833 self->name = util_strdup(name);
835 self->irblock_from = NULL;
840 void ast_goto_delete(ast_goto *self)
842 mem_d((void*)self->name);
843 ast_expression_delete((ast_expression*)self);
847 void ast_goto_set_label(ast_goto *self, ast_label *label)
849 self->target = label;
852 ast_call* ast_call_new(lex_ctx ctx,
853 ast_expression *funcexpr)
855 ast_instantiate(ast_call, ctx, ast_call_delete);
856 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
858 ast_side_effects(self) = true;
861 self->func = funcexpr;
863 self->expression.vtype = funcexpr->expression.next->expression.vtype;
864 if (funcexpr->expression.next->expression.next)
865 self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
870 void ast_call_delete(ast_call *self)
873 for (i = 0; i < vec_size(self->params); ++i)
874 ast_unref(self->params[i]);
875 vec_free(self->params);
878 ast_unref(self->func);
880 ast_expression_delete((ast_expression*)self);
884 bool ast_call_check_types(ast_call *self)
888 const ast_expression *func = self->func;
889 size_t count = vec_size(self->params);
890 if (count > vec_size(func->expression.params))
891 count = vec_size(func->expression.params);
893 for (i = 0; i < count; ++i) {
894 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
897 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
898 ast_type_to_string((ast_expression*)func->expression.params[i], texp, sizeof(texp));
899 asterror(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
900 (unsigned int)(i+1), texp, tgot);
901 /* we don't immediately return */
908 ast_store* ast_store_new(lex_ctx ctx, int op,
909 ast_expression *dest, ast_expression *source)
911 ast_instantiate(ast_store, ctx, ast_store_delete);
912 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
914 ast_side_effects(self) = true;
918 self->source = source;
920 self->expression.vtype = dest->expression.vtype;
921 if (dest->expression.next) {
922 self->expression.next = ast_type_copy(ctx, dest);
923 if (!self->expression.next) {
929 self->expression.next = NULL;
934 void ast_store_delete(ast_store *self)
936 ast_unref(self->dest);
937 ast_unref(self->source);
938 ast_expression_delete((ast_expression*)self);
942 ast_block* ast_block_new(lex_ctx ctx)
944 ast_instantiate(ast_block, ctx, ast_block_delete);
945 ast_expression_init((ast_expression*)self,
946 (ast_expression_codegen*)&ast_block_codegen);
950 self->collect = NULL;
955 void ast_block_add_expr(ast_block *self, ast_expression *e)
957 ast_propagate_effects(self, e);
958 vec_push(self->exprs, e);
961 void ast_block_collect(ast_block *self, ast_expression *expr)
963 vec_push(self->collect, expr);
964 expr->expression.node.keep = true;
967 void ast_block_delete(ast_block *self)
970 for (i = 0; i < vec_size(self->exprs); ++i)
971 ast_unref(self->exprs[i]);
972 vec_free(self->exprs);
973 for (i = 0; i < vec_size(self->locals); ++i)
974 ast_delete(self->locals[i]);
975 vec_free(self->locals);
976 for (i = 0; i < vec_size(self->collect); ++i)
977 ast_delete(self->collect[i]);
978 vec_free(self->collect);
979 ast_expression_delete((ast_expression*)self);
983 bool ast_block_set_type(ast_block *self, ast_expression *from)
985 if (self->expression.next)
986 ast_delete(self->expression.next);
987 self->expression.vtype = from->expression.vtype;
988 if (from->expression.next) {
989 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
990 if (!self->expression.next)
994 self->expression.next = NULL;
998 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1000 ast_instantiate(ast_function, ctx, ast_function_delete);
1004 vtype->expression.vtype != TYPE_FUNCTION)
1006 asterror(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i",
1008 (int)vtype->hasvalue,
1009 vtype->expression.vtype);
1014 self->vtype = vtype;
1015 self->name = name ? util_strdup(name) : NULL;
1016 self->blocks = NULL;
1018 self->labelcount = 0;
1021 self->ir_func = NULL;
1022 self->curblock = NULL;
1024 self->breakblock = NULL;
1025 self->continueblock = NULL;
1027 vtype->hasvalue = true;
1028 vtype->constval.vfunc = self;
1033 void ast_function_delete(ast_function *self)
1037 mem_d((void*)self->name);
1039 /* ast_value_delete(self->vtype); */
1040 self->vtype->hasvalue = false;
1041 self->vtype->constval.vfunc = NULL;
1042 /* We use unref - if it was stored in a global table it is supposed
1043 * to be deleted from *there*
1045 ast_unref(self->vtype);
1047 for (i = 0; i < vec_size(self->blocks); ++i)
1048 ast_delete(self->blocks[i]);
1049 vec_free(self->blocks);
1053 const char* ast_function_label(ast_function *self, const char *prefix)
1059 if (!opts_dump && !opts_dumpfin)
1062 id = (self->labelcount++);
1063 len = strlen(prefix);
1065 from = self->labelbuf + sizeof(self->labelbuf)-1;
1068 unsigned int digit = id % 10;
1069 *from = digit + '0';
1072 memcpy(from - len, prefix, len);
1076 /*********************************************************************/
1078 * by convention you must never pass NULL to the 'ir_value **out'
1079 * parameter. If you really don't care about the output, pass a dummy.
1080 * But I can't imagine a pituation where the output is truly unnecessary.
1083 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1087 /* NOTE: This is the codegen for a variable used in an expression.
1088 * It is not the codegen to generate the value. For this purpose,
1089 * ast_local_codegen and ast_global_codegen are to be used before this
1090 * is executed. ast_function_codegen should take care of its locals,
1091 * and the ast-user should take care of ast_global_codegen to be used
1092 * on all the globals.
1095 char typename[1024];
1096 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
1097 asterror(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
1104 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1108 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1110 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
1113 func->context = ast_ctx(self);
1114 func->value->context = ast_ctx(self);
1116 self->constval.vfunc->ir_func = func;
1117 self->ir_v = func->value;
1118 /* The function is filled later on ast_function_codegen... */
1122 if (isfield && self->expression.vtype == TYPE_FIELD) {
1123 ast_expression *fieldtype = self->expression.next;
1125 if (self->hasvalue) {
1126 asterror(ast_ctx(self), "TODO: constant field pointers with value");
1130 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1135 ast_expression_common *elemtype;
1137 ast_value *array = (ast_value*)fieldtype;
1139 if (!ast_istype(fieldtype, ast_value)) {
1140 asterror(ast_ctx(self), "internal error: ast_value required");
1144 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1145 if (!array->expression.count || array->expression.count > opts_max_array_size)
1146 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1148 elemtype = &array->expression.next->expression;
1149 vtype = elemtype->vtype;
1151 v = ir_builder_create_field(ir, self->name, vtype);
1153 asterror(ast_ctx(self), "ir_builder_create_global failed");
1156 if (vtype == TYPE_FIELD)
1157 v->fieldtype = elemtype->next->expression.vtype;
1158 v->context = ast_ctx(self);
1159 array->ir_v = self->ir_v = v;
1161 namelen = strlen(self->name);
1162 name = (char*)mem_a(namelen + 16);
1163 strcpy(name, self->name);
1165 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1166 array->ir_values[0] = v;
1167 for (ai = 1; ai < array->expression.count; ++ai) {
1168 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1169 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1170 if (!array->ir_values[ai]) {
1172 asterror(ast_ctx(self), "ir_builder_create_global failed");
1175 if (vtype == TYPE_FIELD)
1176 array->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1177 array->ir_values[ai]->context = ast_ctx(self);
1183 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1186 v->context = ast_ctx(self);
1192 if (self->expression.vtype == TYPE_ARRAY) {
1197 ast_expression_common *elemtype = &self->expression.next->expression;
1198 int vtype = elemtype->vtype;
1200 /* same as with field arrays */
1201 if (!self->expression.count || self->expression.count > opts_max_array_size)
1202 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1204 v = ir_builder_create_global(ir, self->name, vtype);
1206 asterror(ast_ctx(self), "ir_builder_create_global failed");
1209 if (vtype == TYPE_FIELD)
1210 v->fieldtype = elemtype->next->expression.vtype;
1211 v->context = ast_ctx(self);
1213 namelen = strlen(self->name);
1214 name = (char*)mem_a(namelen + 16);
1215 strcpy(name, self->name);
1217 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1218 self->ir_values[0] = v;
1219 for (ai = 1; ai < self->expression.count; ++ai) {
1220 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1221 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1222 if (!self->ir_values[ai]) {
1224 asterror(ast_ctx(self), "ir_builder_create_global failed");
1227 if (vtype == TYPE_FIELD)
1228 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1229 self->ir_values[ai]->context = ast_ctx(self);
1235 /* Arrays don't do this since there's no "array" value which spans across the
1238 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1240 asterror(ast_ctx(self), "ir_builder_create_global failed");
1243 if (self->expression.vtype == TYPE_FIELD)
1244 v->fieldtype = self->expression.next->expression.vtype;
1245 v->context = ast_ctx(self);
1248 if (self->hasvalue) {
1249 switch (self->expression.vtype)
1252 if (!ir_value_set_float(v, self->constval.vfloat))
1256 if (!ir_value_set_vector(v, self->constval.vvec))
1260 if (!ir_value_set_string(v, self->constval.vstring))
1264 asterror(ast_ctx(self), "TODO: global constant array");
1267 asterror(ast_ctx(self), "global of type function not properly generated");
1269 /* Cannot generate an IR value for a function,
1270 * need a pointer pointing to a function rather.
1273 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1278 /* link us to the ir_value */
1282 error: /* clean up */
1287 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1290 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1292 /* Do we allow local functions? I think not...
1293 * this is NOT a function pointer atm.
1298 if (self->expression.vtype == TYPE_ARRAY) {
1303 ast_expression_common *elemtype = &self->expression.next->expression;
1304 int vtype = elemtype->vtype;
1307 asterror(ast_ctx(self), "array-parameters are not supported");
1311 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1312 if (!self->expression.count || self->expression.count > opts_max_array_size) {
1313 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1316 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1317 if (!self->ir_values) {
1318 asterror(ast_ctx(self), "failed to allocate array values");
1322 v = ir_function_create_local(func, self->name, vtype, param);
1324 asterror(ast_ctx(self), "ir_function_create_local failed");
1327 if (vtype == TYPE_FIELD)
1328 v->fieldtype = elemtype->next->expression.vtype;
1329 v->context = ast_ctx(self);
1331 namelen = strlen(self->name);
1332 name = (char*)mem_a(namelen + 16);
1333 strcpy(name, self->name);
1335 self->ir_values[0] = v;
1336 for (ai = 1; ai < self->expression.count; ++ai) {
1337 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1338 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1339 if (!self->ir_values[ai]) {
1340 asterror(ast_ctx(self), "ir_builder_create_global failed");
1343 if (vtype == TYPE_FIELD)
1344 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1345 self->ir_values[ai]->context = ast_ctx(self);
1350 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1353 if (self->expression.vtype == TYPE_FIELD)
1354 v->fieldtype = self->expression.next->expression.vtype;
1355 v->context = ast_ctx(self);
1358 /* A constant local... hmmm...
1359 * I suppose the IR will have to deal with this
1361 if (self->hasvalue) {
1362 switch (self->expression.vtype)
1365 if (!ir_value_set_float(v, self->constval.vfloat))
1369 if (!ir_value_set_vector(v, self->constval.vvec))
1373 if (!ir_value_set_string(v, self->constval.vstring))
1377 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1382 /* link us to the ir_value */
1386 if (!ast_global_codegen(self->setter, func->owner, false) ||
1387 !ast_function_codegen(self->setter->constval.vfunc, func->owner) ||
1388 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1392 if (!ast_global_codegen(self->getter, func->owner, false) ||
1393 !ast_function_codegen(self->getter->constval.vfunc, func->owner) ||
1394 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1399 error: /* clean up */
1404 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1408 ast_expression_common *ec;
1413 irf = self->ir_func;
1415 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1419 /* fill the parameter list */
1420 ec = &self->vtype->expression;
1421 for (i = 0; i < vec_size(ec->params); ++i)
1423 vec_push(irf->params, ec->params[i]->expression.vtype);
1424 if (!self->builtin) {
1425 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1430 if (self->builtin) {
1431 irf->builtin = self->builtin;
1435 if (!vec_size(self->blocks)) {
1436 asterror(ast_ctx(self), "function `%s` has no body", self->name);
1440 self->curblock = ir_function_create_block(irf, "entry");
1441 if (!self->curblock) {
1442 asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1446 for (i = 0; i < vec_size(self->blocks); ++i) {
1447 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1448 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1452 /* TODO: check return types */
1453 if (!self->curblock->is_return)
1455 return ir_block_create_return(self->curblock, NULL);
1456 /* From now on the parser has to handle this situation */
1458 if (!self->vtype->expression.next ||
1459 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1461 return ir_block_create_return(self->curblock, NULL);
1465 /* error("missing return"); */
1466 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
1474 /* Note, you will not see ast_block_codegen generate ir_blocks.
1475 * To the AST and the IR, blocks are 2 different things.
1476 * In the AST it represents a block of code, usually enclosed in
1477 * curly braces {...}.
1478 * While in the IR it represents a block in terms of control-flow.
1480 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1484 /* We don't use this
1485 * Note: an ast-representation using the comma-operator
1486 * of the form: (a, b, c) = x should not assign to c...
1489 asterror(ast_ctx(self), "not an l-value (code-block)");
1493 if (self->expression.outr) {
1494 *out = self->expression.outr;
1498 /* output is NULL at first, we'll have each expression
1499 * assign to out output, thus, a comma-operator represention
1500 * using an ast_block will return the last generated value,
1501 * so: (b, c) + a executed both b and c, and returns c,
1502 * which is then added to a.
1506 /* generate locals */
1507 for (i = 0; i < vec_size(self->locals); ++i)
1509 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1511 asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1516 for (i = 0; i < vec_size(self->exprs); ++i)
1518 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1519 if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1520 asterror(ast_ctx(self->exprs[i]), "unreachable statement");
1523 if (!(*gen)(self->exprs[i], func, false, out))
1527 self->expression.outr = *out;
1532 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1534 ast_expression_codegen *cgen;
1535 ir_value *left = NULL;
1536 ir_value *right = NULL;
1540 ast_array_index *ai = NULL;
1542 if (lvalue && self->expression.outl) {
1543 *out = self->expression.outl;
1547 if (!lvalue && self->expression.outr) {
1548 *out = self->expression.outr;
1552 if (ast_istype(self->dest, ast_array_index))
1555 ai = (ast_array_index*)self->dest;
1556 idx = (ast_value*)ai->index;
1558 if (ast_istype(ai->index, ast_value) && idx->hasvalue)
1563 /* we need to call the setter */
1564 ir_value *iridx, *funval;
1568 asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1572 arr = (ast_value*)ai->array;
1573 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1574 asterror(ast_ctx(self), "value has no setter (%s)", arr->name);
1578 cgen = idx->expression.codegen;
1579 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1582 cgen = arr->setter->expression.codegen;
1583 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1586 cgen = self->source->expression.codegen;
1587 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1590 call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval);
1593 ir_call_param(call, iridx);
1594 ir_call_param(call, right);
1595 self->expression.outr = right;
1601 cgen = self->dest->expression.codegen;
1603 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1605 self->expression.outl = left;
1607 cgen = self->source->expression.codegen;
1609 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1612 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1614 self->expression.outr = right;
1617 /* Theoretically, an assinment returns its left side as an
1618 * lvalue, if we don't need an lvalue though, we return
1619 * the right side as an rvalue, otherwise we have to
1620 * somehow know whether or not we need to dereference the pointer
1621 * on the left side - that is: OP_LOAD if it was an address.
1622 * Also: in original QC we cannot OP_LOADP *anyway*.
1624 *out = (lvalue ? left : right);
1629 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1631 ast_expression_codegen *cgen;
1632 ir_value *left, *right;
1634 /* A binary operation cannot yield an l-value */
1636 asterror(ast_ctx(self), "not an l-value (binop)");
1640 if (self->expression.outr) {
1641 *out = self->expression.outr;
1645 if (OPTS_FLAG(SHORT_LOGIC) &&
1646 (self->op == INSTR_AND || self->op == INSTR_OR))
1648 /* short circuit evaluation */
1649 ir_block *other, *merge;
1650 ir_block *from_left, *from_right;
1655 /* Note about casting to true boolean values:
1656 * We use a single NOT for sub expressions, and an
1657 * overall NOT at the end, and for that purpose swap
1658 * all the jump conditions in order for the NOT to get
1660 * ie: (a && b) usually becomes (!!a ? !!b : !!a)
1661 * but we translate this to (!(!a ? !a : !b))
1664 merge_id = vec_size(func->ir_func->blocks);
1665 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_merge"));
1667 cgen = self->left->expression.codegen;
1668 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1670 if (!OPTS_FLAG(PERL_LOGIC)) {
1671 notop = type_not_instr[left->vtype];
1672 if (notop == AINSTR_END) {
1673 asterror(ast_ctx(self), "don't know how to cast to bool...");
1676 left = ir_block_create_unary(func->curblock,
1677 ast_function_label(func, "sce_not"),
1681 from_left = func->curblock;
1683 other = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_other"));
1684 if ( !(self->op == INSTR_OR) != !OPTS_FLAG(PERL_LOGIC) ) {
1685 if (!ir_block_create_if(func->curblock, left, other, merge))
1688 if (!ir_block_create_if(func->curblock, left, merge, other))
1691 /* use the likely flag */
1692 vec_last(func->curblock->instr)->likely = true;
1694 func->curblock = other;
1695 cgen = self->right->expression.codegen;
1696 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1698 if (!OPTS_FLAG(PERL_LOGIC)) {
1699 notop = type_not_instr[right->vtype];
1700 if (notop == AINSTR_END) {
1701 asterror(ast_ctx(self), "don't know how to cast to bool...");
1704 right = ir_block_create_unary(func->curblock,
1705 ast_function_label(func, "sce_not"),
1709 from_right = func->curblock;
1711 if (!ir_block_create_jump(func->curblock, merge))
1714 vec_remove(func->ir_func->blocks, merge_id, 1);
1715 vec_push(func->ir_func->blocks, merge);
1717 func->curblock = merge;
1718 phi = ir_block_create_phi(func->curblock, ast_function_label(func, "sce_value"), TYPE_FLOAT);
1719 ir_phi_add(phi, from_left, left);
1720 ir_phi_add(phi, from_right, right);
1721 *out = ir_phi_value(phi);
1722 if (!OPTS_FLAG(PERL_LOGIC)) {
1723 notop = type_not_instr[(*out)->vtype];
1724 if (notop == AINSTR_END) {
1725 asterror(ast_ctx(self), "don't know how to cast to bool...");
1728 *out = ir_block_create_unary(func->curblock,
1729 ast_function_label(func, "sce_final_not"),
1735 self->expression.outr = *out;
1739 cgen = self->left->expression.codegen;
1740 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1743 cgen = self->right->expression.codegen;
1744 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1747 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1748 self->op, left, right);
1751 self->expression.outr = *out;
1756 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1758 ast_expression_codegen *cgen;
1759 ir_value *leftl = NULL, *leftr, *right, *bin;
1763 ast_array_index *ai = NULL;
1764 ir_value *iridx = NULL;
1766 if (lvalue && self->expression.outl) {
1767 *out = self->expression.outl;
1771 if (!lvalue && self->expression.outr) {
1772 *out = self->expression.outr;
1776 if (ast_istype(self->dest, ast_array_index))
1779 ai = (ast_array_index*)self->dest;
1780 idx = (ast_value*)ai->index;
1782 if (ast_istype(ai->index, ast_value) && idx->hasvalue)
1786 /* for a binstore we need both an lvalue and an rvalue for the left side */
1787 /* rvalue of destination! */
1789 cgen = idx->expression.codegen;
1790 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1793 cgen = self->dest->expression.codegen;
1794 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1797 /* source as rvalue only */
1798 cgen = self->source->expression.codegen;
1799 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1802 /* now the binary */
1803 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1804 self->opbin, leftr, right);
1805 self->expression.outr = bin;
1809 /* we need to call the setter */
1814 asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1818 arr = (ast_value*)ai->array;
1819 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1820 asterror(ast_ctx(self), "value has no setter (%s)", arr->name);
1824 cgen = arr->setter->expression.codegen;
1825 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1828 call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval);
1831 ir_call_param(call, iridx);
1832 ir_call_param(call, bin);
1833 self->expression.outr = bin;
1835 /* now store them */
1836 cgen = self->dest->expression.codegen;
1837 /* lvalue of destination */
1838 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1840 self->expression.outl = leftl;
1842 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1844 self->expression.outr = bin;
1847 /* Theoretically, an assinment returns its left side as an
1848 * lvalue, if we don't need an lvalue though, we return
1849 * the right side as an rvalue, otherwise we have to
1850 * somehow know whether or not we need to dereference the pointer
1851 * on the left side - that is: OP_LOAD if it was an address.
1852 * Also: in original QC we cannot OP_LOADP *anyway*.
1854 *out = (lvalue ? leftl : bin);
1859 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1861 ast_expression_codegen *cgen;
1864 /* An unary operation cannot yield an l-value */
1866 asterror(ast_ctx(self), "not an l-value (binop)");
1870 if (self->expression.outr) {
1871 *out = self->expression.outr;
1875 cgen = self->operand->expression.codegen;
1877 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1880 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1884 self->expression.outr = *out;
1889 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1891 ast_expression_codegen *cgen;
1896 /* In the context of a return operation, we don't actually return
1900 asterror(ast_ctx(self), "return-expression is not an l-value");
1904 if (self->expression.outr) {
1905 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1908 self->expression.outr = (ir_value*)1;
1910 if (self->operand) {
1911 cgen = self->operand->expression.codegen;
1913 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1916 if (!ir_block_create_return(func->curblock, operand))
1919 if (!ir_block_create_return(func->curblock, NULL))
1926 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1928 ast_expression_codegen *cgen;
1929 ir_value *ent, *field;
1931 /* This function needs to take the 'lvalue' flag into account!
1932 * As lvalue we provide a field-pointer, as rvalue we provide the
1936 if (lvalue && self->expression.outl) {
1937 *out = self->expression.outl;
1941 if (!lvalue && self->expression.outr) {
1942 *out = self->expression.outr;
1946 cgen = self->entity->expression.codegen;
1947 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1950 cgen = self->field->expression.codegen;
1951 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1956 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1959 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1960 ent, field, self->expression.vtype);
1963 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1964 (lvalue ? "ADDRESS" : "FIELD"),
1965 type_name[self->expression.vtype]);
1970 self->expression.outl = *out;
1972 self->expression.outr = *out;
1974 /* Hm that should be it... */
1978 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1980 ast_expression_codegen *cgen;
1983 /* in QC this is always an lvalue */
1985 if (self->expression.outl) {
1986 *out = self->expression.outl;
1990 cgen = self->owner->expression.codegen;
1991 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1994 if (vec->vtype != TYPE_VECTOR &&
1995 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
2000 *out = ir_value_vector_member(vec, self->field);
2001 self->expression.outl = *out;
2003 return (*out != NULL);
2006 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2011 if (!lvalue && self->expression.outr) {
2012 *out = self->expression.outr;
2014 if (lvalue && self->expression.outl) {
2015 *out = self->expression.outl;
2018 if (!ast_istype(self->array, ast_value)) {
2019 asterror(ast_ctx(self), "array indexing this way is not supported");
2020 /* note this would actually be pointer indexing because the left side is
2021 * not an actual array but (hopefully) an indexable expression.
2022 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2023 * support this path will be filled.
2028 arr = (ast_value*)self->array;
2029 idx = (ast_value*)self->index;
2031 if (!ast_istype(self->index, ast_value) || !idx->hasvalue) {
2032 /* Time to use accessor functions */
2033 ast_expression_codegen *cgen;
2034 ir_value *iridx, *funval;
2038 asterror(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2043 asterror(ast_ctx(self), "value has no getter, don't know how to index it");
2047 cgen = self->index->expression.codegen;
2048 if (!(*cgen)((ast_expression*)(self->index), func, true, &iridx))
2051 cgen = arr->getter->expression.codegen;
2052 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2055 call = ir_block_create_call(func->curblock, ast_function_label(func, "fetch"), funval);
2058 ir_call_param(call, iridx);
2060 *out = ir_call_value(call);
2061 self->expression.outr = *out;
2065 if (idx->expression.vtype == TYPE_FLOAT)
2066 *out = arr->ir_values[(int)idx->constval.vfloat];
2067 else if (idx->expression.vtype == TYPE_INTEGER)
2068 *out = arr->ir_values[idx->constval.vint];
2070 asterror(ast_ctx(self), "array indexing here needs an integer constant");
2076 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2078 ast_expression_codegen *cgen;
2083 ir_block *cond = func->curblock;
2086 ir_block *ontrue_endblock = NULL;
2087 ir_block *onfalse_endblock = NULL;
2090 /* We don't output any value, thus also don't care about r/lvalue */
2094 if (self->expression.outr) {
2095 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2098 self->expression.outr = (ir_value*)1;
2100 /* generate the condition */
2101 cgen = self->cond->expression.codegen;
2102 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2104 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2105 cond = func->curblock;
2109 if (self->on_true) {
2110 /* create on-true block */
2111 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
2115 /* enter the block */
2116 func->curblock = ontrue;
2119 cgen = self->on_true->expression.codegen;
2120 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2123 /* we now need to work from the current endpoint */
2124 ontrue_endblock = func->curblock;
2129 if (self->on_false) {
2130 /* create on-false block */
2131 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
2135 /* enter the block */
2136 func->curblock = onfalse;
2139 cgen = self->on_false->expression.codegen;
2140 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2143 /* we now need to work from the current endpoint */
2144 onfalse_endblock = func->curblock;
2148 /* Merge block were they all merge in to */
2149 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
2152 /* add jumps ot the merge block */
2153 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
2155 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
2158 /* we create the if here, that way all blocks are ordered :)
2160 if (!ir_block_create_if(cond, condval,
2161 (ontrue ? ontrue : merge),
2162 (onfalse ? onfalse : merge)))
2167 /* Now enter the merge block */
2168 func->curblock = merge;
2173 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2175 ast_expression_codegen *cgen;
2178 ir_value *trueval, *falseval;
2181 ir_block *cond = func->curblock;
2186 /* Ternary can never create an lvalue... */
2190 /* In theory it shouldn't be possible to pass through a node twice, but
2191 * in case we add any kind of optimization pass for the AST itself, it
2192 * may still happen, thus we remember a created ir_value and simply return one
2193 * if it already exists.
2195 if (self->expression.outr) {
2196 *out = self->expression.outr;
2200 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2202 /* generate the condition */
2203 func->curblock = cond;
2204 cgen = self->cond->expression.codegen;
2205 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2208 /* create on-true block */
2209 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
2214 /* enter the block */
2215 func->curblock = ontrue;
2218 cgen = self->on_true->expression.codegen;
2219 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2223 /* create on-false block */
2224 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
2229 /* enter the block */
2230 func->curblock = onfalse;
2233 cgen = self->on_false->expression.codegen;
2234 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2238 /* create merge block */
2239 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
2242 /* jump to merge block */
2243 if (!ir_block_create_jump(ontrue, merge))
2245 if (!ir_block_create_jump(onfalse, merge))
2248 /* create if instruction */
2249 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
2252 /* Now enter the merge block */
2253 func->curblock = merge;
2255 /* Here, now, we need a PHI node
2256 * but first some sanity checking...
2258 if (trueval->vtype != falseval->vtype) {
2259 /* error("ternary with different types on the two sides"); */
2264 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
2267 ir_phi_add(phi, ontrue, trueval);
2268 ir_phi_add(phi, onfalse, falseval);
2270 self->expression.outr = ir_phi_value(phi);
2271 *out = self->expression.outr;
2276 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2278 ast_expression_codegen *cgen;
2280 ir_value *dummy = NULL;
2281 ir_value *precond = NULL;
2282 ir_value *postcond = NULL;
2284 /* Since we insert some jumps "late" so we have blocks
2285 * ordered "nicely", we need to keep track of the actual end-blocks
2286 * of expressions to add the jumps to.
2288 ir_block *bbody = NULL, *end_bbody = NULL;
2289 ir_block *bprecond = NULL, *end_bprecond = NULL;
2290 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2291 ir_block *bincrement = NULL, *end_bincrement = NULL;
2292 ir_block *bout = NULL, *bin = NULL;
2294 /* let's at least move the outgoing block to the end */
2297 /* 'break' and 'continue' need to be able to find the right blocks */
2298 ir_block *bcontinue = NULL;
2299 ir_block *bbreak = NULL;
2301 ir_block *old_bcontinue = NULL;
2302 ir_block *old_bbreak = NULL;
2304 ir_block *tmpblock = NULL;
2309 if (self->expression.outr) {
2310 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2313 self->expression.outr = (ir_value*)1;
2316 * Should we ever need some kind of block ordering, better make this function
2317 * move blocks around than write a block ordering algorithm later... after all
2318 * the ast and ir should work together, not against each other.
2321 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2322 * anyway if for example it contains a ternary.
2326 cgen = self->initexpr->expression.codegen;
2327 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2331 /* Store the block from which we enter this chaos */
2332 bin = func->curblock;
2334 /* The pre-loop condition needs its own block since we
2335 * need to be able to jump to the start of that expression.
2339 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
2343 /* the pre-loop-condition the least important place to 'continue' at */
2344 bcontinue = bprecond;
2347 func->curblock = bprecond;
2350 cgen = self->precond->expression.codegen;
2351 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2354 end_bprecond = func->curblock;
2356 bprecond = end_bprecond = NULL;
2359 /* Now the next blocks won't be ordered nicely, but we need to
2360 * generate them this early for 'break' and 'continue'.
2362 if (self->increment) {
2363 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
2366 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2368 bincrement = end_bincrement = NULL;
2371 if (self->postcond) {
2372 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
2375 bcontinue = bpostcond; /* postcond comes before the increment */
2377 bpostcond = end_bpostcond = NULL;
2380 bout_id = vec_size(func->ir_func->blocks);
2381 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
2386 /* The loop body... */
2389 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
2394 func->curblock = bbody;
2396 old_bbreak = func->breakblock;
2397 old_bcontinue = func->continueblock;
2398 func->breakblock = bbreak;
2399 func->continueblock = bcontinue;
2402 cgen = self->body->expression.codegen;
2403 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2406 end_bbody = func->curblock;
2407 func->breakblock = old_bbreak;
2408 func->continueblock = old_bcontinue;
2411 /* post-loop-condition */
2415 func->curblock = bpostcond;
2418 cgen = self->postcond->expression.codegen;
2419 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2422 end_bpostcond = func->curblock;
2425 /* The incrementor */
2426 if (self->increment)
2429 func->curblock = bincrement;
2432 cgen = self->increment->expression.codegen;
2433 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2436 end_bincrement = func->curblock;
2439 /* In any case now, we continue from the outgoing block */
2440 func->curblock = bout;
2442 /* Now all blocks are in place */
2443 /* From 'bin' we jump to whatever comes first */
2444 if (bprecond) tmpblock = bprecond;
2445 else if (bbody) tmpblock = bbody;
2446 else if (bpostcond) tmpblock = bpostcond;
2447 else tmpblock = bout;
2448 if (!ir_block_create_jump(bin, tmpblock))
2454 ir_block *ontrue, *onfalse;
2455 if (bbody) ontrue = bbody;
2456 else if (bincrement) ontrue = bincrement;
2457 else if (bpostcond) ontrue = bpostcond;
2458 else ontrue = bprecond;
2460 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
2467 if (bincrement) tmpblock = bincrement;
2468 else if (bpostcond) tmpblock = bpostcond;
2469 else if (bprecond) tmpblock = bprecond;
2470 else tmpblock = bout;
2471 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
2475 /* from increment */
2478 if (bpostcond) tmpblock = bpostcond;
2479 else if (bprecond) tmpblock = bprecond;
2480 else if (bbody) tmpblock = bbody;
2481 else tmpblock = bout;
2482 if (!ir_block_create_jump(end_bincrement, tmpblock))
2489 ir_block *ontrue, *onfalse;
2490 if (bprecond) ontrue = bprecond;
2491 else if (bbody) ontrue = bbody;
2492 else if (bincrement) ontrue = bincrement;
2493 else ontrue = bpostcond;
2495 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
2499 /* Move 'bout' to the end */
2500 vec_remove(func->ir_func->blocks, bout_id, 1);
2501 vec_push(func->ir_func->blocks, bout);
2506 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2513 asterror(ast_ctx(self), "break/continue expression is not an l-value");
2517 if (self->expression.outr) {
2518 asterror(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2521 self->expression.outr = (ir_value*)1;
2523 if (self->is_continue)
2524 target = func->continueblock;
2526 target = func->breakblock;
2528 if (!ir_block_create_jump(func->curblock, target))
2533 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2535 ast_expression_codegen *cgen;
2537 ast_switch_case *def_case = NULL;
2538 ir_block *def_bfall = NULL;
2540 ir_value *dummy = NULL;
2541 ir_value *irop = NULL;
2542 ir_block *old_break = NULL;
2543 ir_block *bout = NULL;
2544 ir_block *bfall = NULL;
2552 asterror(ast_ctx(self), "switch expression is not an l-value");
2556 if (self->expression.outr) {
2557 asterror(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2560 self->expression.outr = (ir_value*)1;
2565 cgen = self->operand->expression.codegen;
2566 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2569 if (!vec_size(self->cases))
2572 cmpinstr = type_eq_instr[irop->vtype];
2573 if (cmpinstr >= AINSTR_END) {
2574 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2575 asterror(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2579 bout_id = vec_size(func->ir_func->blocks);
2580 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_switch"));
2584 /* setup the break block */
2585 old_break = func->breakblock;
2586 func->breakblock = bout;
2588 /* Now create all cases */
2589 for (c = 0; c < vec_size(self->cases); ++c) {
2590 ir_value *cond, *val;
2591 ir_block *bcase, *bnot;
2594 ast_switch_case *swcase = &self->cases[c];
2596 if (swcase->value) {
2597 /* A regular case */
2598 /* generate the condition operand */
2599 cgen = swcase->value->expression.codegen;
2600 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2602 /* generate the condition */
2603 cond = ir_block_create_binop(func->curblock, ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2607 bcase = ir_function_create_block(func->ir_func, ast_function_label(func, "case"));
2608 bnot_id = vec_size(func->ir_func->blocks);
2609 bnot = ir_function_create_block(func->ir_func, ast_function_label(func, "not_case"));
2610 if (!bcase || !bnot)
2612 if (!ir_block_create_if(func->curblock, cond, bcase, bnot))
2615 /* Make the previous case-end fall through */
2616 if (bfall && !bfall->final) {
2617 if (!ir_block_create_jump(bfall, bcase))
2621 /* enter the case */
2622 func->curblock = bcase;
2623 cgen = swcase->code->expression.codegen;
2624 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2627 /* remember this block to fall through from */
2628 bfall = func->curblock;
2630 /* enter the else and move it down */
2631 func->curblock = bnot;
2632 vec_remove(func->ir_func->blocks, bnot_id, 1);
2633 vec_push(func->ir_func->blocks, bnot);
2635 /* The default case */
2636 /* Remember where to fall through from: */
2639 /* remember which case it was */
2644 /* Jump from the last bnot to bout */
2645 if (bfall && !bfall->final && !ir_block_create_jump(bfall, bout)) {
2647 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2652 /* If there was a default case, put it down here */
2656 /* No need to create an extra block */
2657 bcase = func->curblock;
2659 /* Insert the fallthrough jump */
2660 if (def_bfall && !def_bfall->final) {
2661 if (!ir_block_create_jump(def_bfall, bcase))
2665 /* Now generate the default code */
2666 cgen = def_case->code->expression.codegen;
2667 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2671 /* Jump from the last bnot to bout */
2672 if (!func->curblock->final && !ir_block_create_jump(func->curblock, bout))
2674 /* enter the outgoing block */
2675 func->curblock = bout;
2677 /* restore the break block */
2678 func->breakblock = old_break;
2680 /* Move 'bout' to the end, it's nicer */
2681 vec_remove(func->ir_func->blocks, bout_id, 1);
2682 vec_push(func->ir_func->blocks, bout);
2687 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
2694 asterror(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
2698 /* simply create a new block and jump to it */
2699 self->irblock = ir_function_create_block(func->ir_func, self->name);
2700 if (!self->irblock) {
2701 asterror(ast_ctx(self), "failed to allocate label block `%s`", self->name);
2704 if (!func->curblock->final) {
2705 if (!ir_block_create_jump(func->curblock, self->irblock))
2709 /* enter the new block */
2710 func->curblock = self->irblock;
2712 /* Generate all the leftover gotos */
2713 for (i = 0; i < vec_size(self->gotos); ++i) {
2714 if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
2721 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
2725 asterror(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
2729 if (self->target->irblock) {
2730 if (self->irblock_from) {
2731 /* we already tried once, this is the callback */
2732 self->irblock_from->final = false;
2733 if (!ir_block_create_jump(self->irblock_from, self->target->irblock)) {
2734 asterror(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2740 if (!ir_block_create_jump(func->curblock, self->target->irblock)) {
2741 asterror(ast_ctx(self), "failed to generate goto to `%s`", self->name);
2748 /* the target has not yet been created...
2749 * close this block in a sneaky way:
2751 func->curblock->final = true;
2752 self->irblock_from = func->curblock;
2753 ast_label_register_goto(self->target, self);
2759 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2761 ast_expression_codegen *cgen;
2763 ir_instr *callinstr;
2766 ir_value *funval = NULL;
2768 /* return values are never lvalues */
2770 asterror(ast_ctx(self), "not an l-value (function call)");
2774 if (self->expression.outr) {
2775 *out = self->expression.outr;
2779 cgen = self->func->expression.codegen;
2780 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2788 for (i = 0; i < vec_size(self->params); ++i)
2791 ast_expression *expr = self->params[i];
2793 cgen = expr->expression.codegen;
2794 if (!(*cgen)(expr, func, false, ¶m))
2798 vec_push(params, param);
2801 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
2805 for (i = 0; i < vec_size(params); ++i) {
2806 ir_call_param(callinstr, params[i]);
2809 *out = ir_call_value(callinstr);
2810 self->expression.outr = *out;