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
39 static void asterror(lex_ctx ctx, const char *msg, ...)
43 con_cvprintmsg((void*)&ctx, LVL_ERROR, "error", msg, ap);
47 /* It must not be possible to get here. */
48 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
50 con_err("ast node missing destroy()\n");
54 /* Initialize main ast node aprts */
55 static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
57 self->node.context = ctx;
58 self->node.destroy = &_ast_node_destroy;
59 self->node.keep = false;
60 self->node.nodetype = nodetype;
63 /* General expression initialization */
64 static void ast_expression_init(ast_expression *self,
65 ast_expression_codegen *codegen)
67 self->expression.codegen = codegen;
68 self->expression.vtype = TYPE_VOID;
69 self->expression.next = NULL;
70 self->expression.outl = NULL;
71 self->expression.outr = NULL;
72 self->expression.variadic = false;
73 self->expression.params = NULL;
76 static void ast_expression_delete(ast_expression *self)
79 if (self->expression.next)
80 ast_delete(self->expression.next);
81 for (i = 0; i < vec_size(self->expression.params); ++i) {
82 ast_delete(self->expression.params[i]);
84 vec_free(self->expression.params);
87 static void ast_expression_delete_full(ast_expression *self)
89 ast_expression_delete(self);
93 ast_value* ast_value_copy(const ast_value *self)
96 const ast_expression_common *fromex;
97 ast_expression_common *selfex;
98 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
99 if (self->expression.next) {
100 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
101 if (!cp->expression.next) {
102 ast_value_delete(cp);
106 fromex = &self->expression;
107 selfex = &cp->expression;
108 selfex->variadic = fromex->variadic;
109 for (i = 0; i < vec_size(fromex->params); ++i) {
110 ast_value *v = ast_value_copy(fromex->params[i]);
112 ast_value_delete(cp);
115 vec_push(selfex->params, v);
120 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
123 const ast_expression_common *fromex;
124 ast_expression_common *selfex;
125 self->expression.vtype = other->expression.vtype;
126 if (other->expression.next) {
127 self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
128 if (!self->expression.next)
131 fromex = &other->expression;
132 selfex = &self->expression;
133 selfex->variadic = fromex->variadic;
134 for (i = 0; i < vec_size(fromex->params); ++i) {
135 ast_value *v = ast_value_copy(fromex->params[i]);
138 vec_push(selfex->params, v);
143 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
145 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
146 ast_expression_init(self, NULL);
147 self->expression.codegen = NULL;
148 self->expression.next = NULL;
149 self->expression.vtype = vtype;
153 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
156 const ast_expression_common *fromex;
157 ast_expression_common *selfex;
163 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
164 ast_expression_init(self, NULL);
166 fromex = &ex->expression;
167 selfex = &self->expression;
169 /* This may never be codegen()d */
170 selfex->codegen = NULL;
172 selfex->vtype = fromex->vtype;
175 selfex->next = ast_type_copy(ctx, fromex->next);
177 ast_expression_delete_full(self);
184 selfex->variadic = fromex->variadic;
185 for (i = 0; i < vec_size(fromex->params); ++i) {
186 ast_value *v = ast_value_copy(fromex->params[i]);
188 ast_expression_delete_full(self);
191 vec_push(selfex->params, v);
198 bool ast_compare_type(ast_expression *a, ast_expression *b)
200 if (a->expression.vtype != b->expression.vtype)
202 if (!a->expression.next != !b->expression.next)
204 if (vec_size(a->expression.params) != vec_size(b->expression.params))
206 if (a->expression.variadic != b->expression.variadic)
208 if (vec_size(a->expression.params)) {
210 for (i = 0; i < vec_size(a->expression.params); ++i) {
211 if (!ast_compare_type((ast_expression*)a->expression.params[i],
212 (ast_expression*)b->expression.params[i]))
216 if (a->expression.next)
217 return ast_compare_type(a->expression.next, b->expression.next);
221 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
228 if (pos + 6 >= bufsize)
230 strcpy(buf + pos, "(null)");
234 if (pos + 1 >= bufsize)
237 switch (e->expression.vtype) {
239 strcpy(buf + pos, "(variant)");
244 return ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
247 if (pos + 3 >= bufsize)
251 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
252 if (pos + 1 >= bufsize)
258 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
259 if (pos + 2 >= bufsize)
261 if (!vec_size(e->expression.params)) {
267 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[0]), buf, bufsize, pos);
268 for (i = 1; i < vec_size(e->expression.params); ++i) {
269 if (pos + 2 >= bufsize)
273 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[i]), buf, bufsize, pos);
275 if (pos + 1 >= bufsize)
281 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
282 if (pos + 1 >= bufsize)
285 pos += snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->expression.count);
286 if (pos + 1 >= bufsize)
292 typestr = type_name[e->expression.vtype];
293 typelen = strlen(typestr);
294 if (pos + typelen >= bufsize)
296 strcpy(buf + pos, typestr);
297 return pos + typelen;
301 buf[bufsize-3] = '.';
302 buf[bufsize-2] = '.';
303 buf[bufsize-1] = '.';
307 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
309 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
313 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
315 ast_instantiate(ast_value, ctx, ast_value_delete);
316 ast_expression_init((ast_expression*)self,
317 (ast_expression_codegen*)&ast_value_codegen);
318 self->expression.node.keep = true; /* keep */
320 self->name = name ? util_strdup(name) : NULL;
321 self->expression.vtype = t;
322 self->expression.next = NULL;
323 self->isconst = false;
325 memset(&self->constval, 0, sizeof(self->constval));
328 self->ir_values = NULL;
329 self->ir_value_count = 0;
337 void ast_value_delete(ast_value* self)
340 mem_d((void*)self->name);
342 switch (self->expression.vtype)
345 mem_d((void*)self->constval.vstring);
348 /* unlink us from the function node */
349 self->constval.vfunc->vtype = NULL;
351 /* NOTE: delete function? currently collected in
352 * the parser structure
359 mem_d(self->ir_values);
360 ast_expression_delete((ast_expression*)self);
364 void ast_value_params_add(ast_value *self, ast_value *p)
366 vec_push(self->expression.params, p);
369 bool ast_value_set_name(ast_value *self, const char *name)
372 mem_d((void*)self->name);
373 self->name = util_strdup(name);
377 ast_binary* ast_binary_new(lex_ctx ctx, int op,
378 ast_expression* left, ast_expression* right)
380 ast_instantiate(ast_binary, ctx, ast_binary_delete);
381 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
387 if (op >= INSTR_EQ_F && op <= INSTR_GT)
388 self->expression.vtype = TYPE_FLOAT;
389 else if (op == INSTR_AND || op == INSTR_OR ||
390 op == INSTR_BITAND || op == INSTR_BITOR)
391 self->expression.vtype = TYPE_FLOAT;
392 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
393 self->expression.vtype = TYPE_VECTOR;
394 else if (op == INSTR_MUL_V)
395 self->expression.vtype = TYPE_FLOAT;
397 self->expression.vtype = left->expression.vtype;
402 void ast_binary_delete(ast_binary *self)
404 ast_unref(self->left);
405 ast_unref(self->right);
406 ast_expression_delete((ast_expression*)self);
410 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
411 ast_expression* left, ast_expression* right)
413 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
414 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
416 self->opstore = storop;
419 self->source = right;
421 self->expression.vtype = left->expression.vtype;
422 if (left->expression.next) {
423 self->expression.next = ast_type_copy(ctx, left);
424 if (!self->expression.next) {
430 self->expression.next = NULL;
435 void ast_binstore_delete(ast_binstore *self)
437 ast_unref(self->dest);
438 ast_unref(self->source);
439 ast_expression_delete((ast_expression*)self);
443 ast_unary* ast_unary_new(lex_ctx ctx, int op,
444 ast_expression *expr)
446 ast_instantiate(ast_unary, ctx, ast_unary_delete);
447 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
450 self->operand = expr;
452 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
453 self->expression.vtype = TYPE_FLOAT;
455 asterror(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
460 void ast_unary_delete(ast_unary *self)
462 ast_unref(self->operand);
463 ast_expression_delete((ast_expression*)self);
467 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
469 ast_instantiate(ast_return, ctx, ast_return_delete);
470 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
472 self->operand = expr;
477 void ast_return_delete(ast_return *self)
480 ast_unref(self->operand);
481 ast_expression_delete((ast_expression*)self);
485 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
487 if (field->expression.vtype != TYPE_FIELD) {
488 asterror(ctx, "ast_entfield_new with expression not of type field");
491 return ast_entfield_new_force(ctx, entity, field, field->expression.next);
494 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
496 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
500 /* Error: field has no type... */
504 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
506 self->entity = entity;
509 if (!ast_type_adopt(self, outtype)) {
510 ast_entfield_delete(self);
517 void ast_entfield_delete(ast_entfield *self)
519 ast_unref(self->entity);
520 ast_unref(self->field);
521 ast_expression_delete((ast_expression*)self);
525 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
527 ast_instantiate(ast_member, ctx, ast_member_delete);
533 if (owner->expression.vtype != TYPE_VECTOR &&
534 owner->expression.vtype != TYPE_FIELD) {
535 asterror(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
540 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
541 self->expression.node.keep = true; /* keep */
543 if (owner->expression.vtype == TYPE_VECTOR) {
544 self->expression.vtype = TYPE_FLOAT;
545 self->expression.next = NULL;
547 self->expression.vtype = TYPE_FIELD;
548 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
557 void ast_member_delete(ast_member *self)
559 /* The owner is always an ast_value, which has .keep=true,
560 * also: ast_members are usually deleted after the owner, thus
561 * this will cause invalid access
562 ast_unref(self->owner);
563 * once we allow (expression).x to access a vector-member, we need
564 * to change this: preferably by creating an alternate ast node for this
565 * purpose that is not garbage-collected.
567 ast_expression_delete((ast_expression*)self);
571 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
573 ast_expression *outtype;
574 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
576 outtype = array->expression.next;
579 /* Error: field has no type... */
583 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
588 if (!ast_type_adopt(self, outtype)) {
589 ast_array_index_delete(self);
592 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
593 if (self->expression.vtype != TYPE_ARRAY) {
594 asterror(ast_ctx(self), "array_index node on type");
595 ast_array_index_delete(self);
598 self->array = outtype;
599 self->expression.vtype = TYPE_FIELD;
605 void ast_array_index_delete(ast_array_index *self)
607 ast_unref(self->array);
608 ast_unref(self->index);
609 ast_expression_delete((ast_expression*)self);
613 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
615 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
616 if (!ontrue && !onfalse) {
617 /* because it is invalid */
621 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
624 self->on_true = ontrue;
625 self->on_false = onfalse;
630 void ast_ifthen_delete(ast_ifthen *self)
632 ast_unref(self->cond);
634 ast_unref(self->on_true);
636 ast_unref(self->on_false);
637 ast_expression_delete((ast_expression*)self);
641 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
643 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
644 /* This time NEITHER must be NULL */
645 if (!ontrue || !onfalse) {
649 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
652 self->on_true = ontrue;
653 self->on_false = onfalse;
654 self->phi_out = NULL;
659 void ast_ternary_delete(ast_ternary *self)
661 ast_unref(self->cond);
662 ast_unref(self->on_true);
663 ast_unref(self->on_false);
664 ast_expression_delete((ast_expression*)self);
668 ast_loop* ast_loop_new(lex_ctx ctx,
669 ast_expression *initexpr,
670 ast_expression *precond,
671 ast_expression *postcond,
672 ast_expression *increment,
673 ast_expression *body)
675 ast_instantiate(ast_loop, ctx, ast_loop_delete);
676 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
678 self->initexpr = initexpr;
679 self->precond = precond;
680 self->postcond = postcond;
681 self->increment = increment;
687 void ast_loop_delete(ast_loop *self)
690 ast_unref(self->initexpr);
692 ast_unref(self->precond);
694 ast_unref(self->postcond);
696 ast_unref(self->increment);
698 ast_unref(self->body);
699 ast_expression_delete((ast_expression*)self);
703 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont)
705 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
706 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
708 self->is_continue = iscont;
713 void ast_breakcont_delete(ast_breakcont *self)
715 ast_expression_delete((ast_expression*)self);
719 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
721 ast_instantiate(ast_switch, ctx, ast_switch_delete);
722 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
730 void ast_switch_delete(ast_switch *self)
733 ast_unref(self->operand);
735 for (i = 0; i < vec_size(self->cases); ++i) {
736 if (self->cases[i].value)
737 ast_unref(self->cases[i].value);
738 ast_unref(self->cases[i].code);
740 vec_free(self->cases);
742 ast_expression_delete((ast_expression*)self);
746 ast_call* ast_call_new(lex_ctx ctx,
747 ast_expression *funcexpr)
749 ast_instantiate(ast_call, ctx, ast_call_delete);
750 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
753 self->func = funcexpr;
755 self->expression.vtype = funcexpr->expression.next->expression.vtype;
756 if (funcexpr->expression.next->expression.next)
757 self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
762 void ast_call_delete(ast_call *self)
765 for (i = 0; i < vec_size(self->params); ++i)
766 ast_unref(self->params[i]);
767 vec_free(self->params);
770 ast_unref(self->func);
772 ast_expression_delete((ast_expression*)self);
776 bool ast_call_check_types(ast_call *self)
780 const ast_expression *func = self->func;
781 size_t count = vec_size(self->params);
782 if (count > vec_size(func->expression.params))
783 count = vec_size(func->expression.params);
785 for (i = 0; i < count; ++i) {
786 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
787 asterror(ast_ctx(self), "invalid type for parameter %u in function call",
788 (unsigned int)(i+1));
789 /* we don't immediately return */
796 ast_store* ast_store_new(lex_ctx ctx, int op,
797 ast_expression *dest, ast_expression *source)
799 ast_instantiate(ast_store, ctx, ast_store_delete);
800 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
804 self->source = source;
806 self->expression.vtype = dest->expression.vtype;
807 if (dest->expression.next) {
808 self->expression.next = ast_type_copy(ctx, dest);
809 if (!self->expression.next) {
815 self->expression.next = NULL;
820 void ast_store_delete(ast_store *self)
822 ast_unref(self->dest);
823 ast_unref(self->source);
824 ast_expression_delete((ast_expression*)self);
828 ast_block* ast_block_new(lex_ctx ctx)
830 ast_instantiate(ast_block, ctx, ast_block_delete);
831 ast_expression_init((ast_expression*)self,
832 (ast_expression_codegen*)&ast_block_codegen);
836 self->collect = NULL;
841 void ast_block_collect(ast_block *self, ast_expression *expr)
843 vec_push(self->collect, expr);
844 expr->expression.node.keep = true;
847 void ast_block_delete(ast_block *self)
850 for (i = 0; i < vec_size(self->exprs); ++i)
851 ast_unref(self->exprs[i]);
852 vec_free(self->exprs);
853 for (i = 0; i < vec_size(self->locals); ++i)
854 ast_delete(self->locals[i]);
855 vec_free(self->locals);
856 for (i = 0; i < vec_size(self->collect); ++i)
857 ast_delete(self->collect[i]);
858 vec_free(self->collect);
859 ast_expression_delete((ast_expression*)self);
863 bool ast_block_set_type(ast_block *self, ast_expression *from)
865 if (self->expression.next)
866 ast_delete(self->expression.next);
867 self->expression.vtype = from->expression.vtype;
868 if (from->expression.next) {
869 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
870 if (!self->expression.next)
874 self->expression.next = NULL;
878 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
880 ast_instantiate(ast_function, ctx, ast_function_delete);
884 vtype->expression.vtype != TYPE_FUNCTION)
891 self->name = name ? util_strdup(name) : NULL;
894 self->labelcount = 0;
897 self->ir_func = NULL;
898 self->curblock = NULL;
900 self->breakblock = NULL;
901 self->continueblock = NULL;
903 vtype->isconst = true;
904 vtype->constval.vfunc = self;
909 void ast_function_delete(ast_function *self)
913 mem_d((void*)self->name);
915 /* ast_value_delete(self->vtype); */
916 self->vtype->isconst = false;
917 self->vtype->constval.vfunc = NULL;
918 /* We use unref - if it was stored in a global table it is supposed
919 * to be deleted from *there*
921 ast_unref(self->vtype);
923 for (i = 0; i < vec_size(self->blocks); ++i)
924 ast_delete(self->blocks[i]);
925 vec_free(self->blocks);
929 const char* ast_function_label(ast_function *self, const char *prefix)
938 id = (self->labelcount++);
939 len = strlen(prefix);
941 from = self->labelbuf + sizeof(self->labelbuf)-1;
944 unsigned int digit = id % 10;
948 memcpy(from - len, prefix, len);
952 /*********************************************************************/
954 * by convention you must never pass NULL to the 'ir_value **out'
955 * parameter. If you really don't care about the output, pass a dummy.
956 * But I can't imagine a pituation where the output is truly unnecessary.
959 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
961 /* NOTE: This is the codegen for a variable used in an expression.
962 * It is not the codegen to generate the value. For this purpose,
963 * ast_local_codegen and ast_global_codegen are to be used before this
964 * is executed. ast_function_codegen should take care of its locals,
965 * and the ast-user should take care of ast_global_codegen to be used
966 * on all the globals.
970 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
971 asterror(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
978 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
982 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
984 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
987 func->context = ast_ctx(self);
988 func->value->context = ast_ctx(self);
990 self->constval.vfunc->ir_func = func;
991 self->ir_v = func->value;
992 /* The function is filled later on ast_function_codegen... */
996 if (isfield && self->expression.vtype == TYPE_FIELD) {
997 ast_expression *fieldtype = self->expression.next;
1000 asterror(ast_ctx(self), "TODO: constant field pointers with value");
1004 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1009 ast_expression_common *elemtype;
1011 ast_value *array = (ast_value*)fieldtype;
1013 if (!ast_istype(fieldtype, ast_value)) {
1014 asterror(ast_ctx(self), "internal error: ast_value required");
1018 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1019 if (!array->expression.count || array->expression.count > opts_max_array_size)
1020 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1022 elemtype = &array->expression.next->expression;
1023 vtype = elemtype->vtype;
1025 v = ir_builder_create_field(ir, self->name, vtype);
1027 asterror(ast_ctx(self), "ir_builder_create_global failed");
1030 if (vtype == TYPE_FIELD)
1031 v->fieldtype = elemtype->next->expression.vtype;
1032 v->context = ast_ctx(self);
1033 array->ir_v = self->ir_v = v;
1035 namelen = strlen(self->name);
1036 name = (char*)mem_a(namelen + 16);
1037 strcpy(name, self->name);
1039 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1040 array->ir_values[0] = v;
1041 for (ai = 1; ai < array->expression.count; ++ai) {
1042 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1043 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1044 if (!array->ir_values[ai]) {
1046 asterror(ast_ctx(self), "ir_builder_create_global failed");
1049 if (vtype == TYPE_FIELD)
1050 array->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1051 array->ir_values[ai]->context = ast_ctx(self);
1057 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1060 v->context = ast_ctx(self);
1066 if (self->expression.vtype == TYPE_ARRAY) {
1071 ast_expression_common *elemtype = &self->expression.next->expression;
1072 int vtype = elemtype->vtype;
1074 /* same as with field arrays */
1075 if (!self->expression.count || self->expression.count > opts_max_array_size)
1076 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1078 v = ir_builder_create_global(ir, self->name, vtype);
1080 asterror(ast_ctx(self), "ir_builder_create_global failed");
1083 if (vtype == TYPE_FIELD)
1084 v->fieldtype = elemtype->next->expression.vtype;
1085 v->context = ast_ctx(self);
1087 namelen = strlen(self->name);
1088 name = (char*)mem_a(namelen + 16);
1089 strcpy(name, self->name);
1091 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1092 self->ir_values[0] = v;
1093 for (ai = 1; ai < self->expression.count; ++ai) {
1094 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1095 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1096 if (!self->ir_values[ai]) {
1098 asterror(ast_ctx(self), "ir_builder_create_global failed");
1101 if (vtype == TYPE_FIELD)
1102 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1103 self->ir_values[ai]->context = ast_ctx(self);
1109 /* Arrays don't do this since there's no "array" value which spans across the
1112 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1114 asterror(ast_ctx(self), "ir_builder_create_global failed");
1117 if (self->expression.vtype == TYPE_FIELD)
1118 v->fieldtype = self->expression.next->expression.vtype;
1119 v->context = ast_ctx(self);
1122 if (self->isconst) {
1123 switch (self->expression.vtype)
1126 if (!ir_value_set_float(v, self->constval.vfloat))
1130 if (!ir_value_set_vector(v, self->constval.vvec))
1134 if (!ir_value_set_string(v, self->constval.vstring))
1138 asterror(ast_ctx(self), "TODO: global constant array");
1141 asterror(ast_ctx(self), "global of type function not properly generated");
1143 /* Cannot generate an IR value for a function,
1144 * need a pointer pointing to a function rather.
1147 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1152 /* link us to the ir_value */
1156 error: /* clean up */
1161 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1164 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
1166 /* Do we allow local functions? I think not...
1167 * this is NOT a function pointer atm.
1172 if (self->expression.vtype == TYPE_ARRAY) {
1177 ast_expression_common *elemtype = &self->expression.next->expression;
1178 int vtype = elemtype->vtype;
1181 asterror(ast_ctx(self), "array-parameters are not supported");
1185 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1186 if (!self->expression.count || self->expression.count > opts_max_array_size) {
1187 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1190 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1191 if (!self->ir_values) {
1192 asterror(ast_ctx(self), "failed to allocate array values");
1196 v = ir_function_create_local(func, self->name, vtype, param);
1198 asterror(ast_ctx(self), "ir_function_create_local failed");
1201 if (vtype == TYPE_FIELD)
1202 v->fieldtype = elemtype->next->expression.vtype;
1203 v->context = ast_ctx(self);
1205 namelen = strlen(self->name);
1206 name = (char*)mem_a(namelen + 16);
1207 strcpy(name, self->name);
1209 self->ir_values[0] = v;
1210 for (ai = 1; ai < self->expression.count; ++ai) {
1211 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1212 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1213 if (!self->ir_values[ai]) {
1214 asterror(ast_ctx(self), "ir_builder_create_global failed");
1217 if (vtype == TYPE_FIELD)
1218 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1219 self->ir_values[ai]->context = ast_ctx(self);
1224 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1227 if (self->expression.vtype == TYPE_FIELD)
1228 v->fieldtype = self->expression.next->expression.vtype;
1229 v->context = ast_ctx(self);
1232 /* A constant local... hmmm...
1233 * I suppose the IR will have to deal with this
1235 if (self->isconst) {
1236 switch (self->expression.vtype)
1239 if (!ir_value_set_float(v, self->constval.vfloat))
1243 if (!ir_value_set_vector(v, self->constval.vvec))
1247 if (!ir_value_set_string(v, self->constval.vstring))
1251 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1256 /* link us to the ir_value */
1260 if (!ast_global_codegen(self->setter, func->owner, false) ||
1261 !ast_function_codegen(self->setter->constval.vfunc, func->owner) ||
1262 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1266 if (!ast_global_codegen(self->getter, func->owner, false) ||
1267 !ast_function_codegen(self->getter->constval.vfunc, func->owner) ||
1268 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1273 error: /* clean up */
1278 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1282 ast_expression_common *ec;
1285 irf = self->ir_func;
1287 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1291 /* fill the parameter list */
1292 ec = &self->vtype->expression;
1293 for (i = 0; i < vec_size(ec->params); ++i)
1295 vec_push(irf->params, ec->params[i]->expression.vtype);
1296 if (!self->builtin) {
1297 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1302 if (self->builtin) {
1303 irf->builtin = self->builtin;
1307 if (!vec_size(self->blocks)) {
1308 asterror(ast_ctx(self), "function `%s` has no body", self->name);
1312 self->curblock = ir_function_create_block(irf, "entry");
1313 if (!self->curblock) {
1314 asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1318 for (i = 0; i < vec_size(self->blocks); ++i) {
1319 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1320 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1324 /* TODO: check return types */
1325 if (!self->curblock->is_return)
1327 return ir_block_create_return(self->curblock, NULL);
1328 /* From now on the parser has to handle this situation */
1330 if (!self->vtype->expression.next ||
1331 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1333 return ir_block_create_return(self->curblock, NULL);
1337 /* error("missing return"); */
1338 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
1346 /* Note, you will not see ast_block_codegen generate ir_blocks.
1347 * To the AST and the IR, blocks are 2 different things.
1348 * In the AST it represents a block of code, usually enclosed in
1349 * curly braces {...}.
1350 * While in the IR it represents a block in terms of control-flow.
1352 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1356 /* We don't use this
1357 * Note: an ast-representation using the comma-operator
1358 * of the form: (a, b, c) = x should not assign to c...
1361 asterror(ast_ctx(self), "not an l-value (code-block)");
1365 if (self->expression.outr) {
1366 *out = self->expression.outr;
1370 /* output is NULL at first, we'll have each expression
1371 * assign to out output, thus, a comma-operator represention
1372 * using an ast_block will return the last generated value,
1373 * so: (b, c) + a executed both b and c, and returns c,
1374 * which is then added to a.
1378 /* generate locals */
1379 for (i = 0; i < vec_size(self->locals); ++i)
1381 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1383 asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1388 for (i = 0; i < vec_size(self->exprs); ++i)
1390 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1391 if (func->curblock->final) {
1392 asterror(ast_ctx(self->exprs[i]), "unreachable statement");
1395 if (!(*gen)(self->exprs[i], func, false, out))
1399 self->expression.outr = *out;
1404 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1406 ast_expression_codegen *cgen;
1407 ir_value *left, *right;
1411 ast_array_index *ai = NULL;
1413 if (lvalue && self->expression.outl) {
1414 *out = self->expression.outl;
1418 if (!lvalue && self->expression.outr) {
1419 *out = self->expression.outr;
1423 if (ast_istype(self->dest, ast_array_index))
1426 ai = (ast_array_index*)self->dest;
1427 idx = (ast_value*)ai->index;
1429 if (ast_istype(ai->index, ast_value) && idx->isconst)
1434 /* we need to call the setter */
1435 ir_value *iridx, *funval;
1439 asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1443 arr = (ast_value*)ai->array;
1444 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1445 asterror(ast_ctx(self), "value has no setter (%s)", arr->name);
1449 cgen = idx->expression.codegen;
1450 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1453 cgen = arr->setter->expression.codegen;
1454 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1457 cgen = self->source->expression.codegen;
1458 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1461 call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval);
1464 ir_call_param(call, iridx);
1465 ir_call_param(call, right);
1466 self->expression.outr = right;
1472 cgen = self->dest->expression.codegen;
1474 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1476 self->expression.outl = left;
1478 cgen = self->source->expression.codegen;
1480 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1483 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1485 self->expression.outr = right;
1488 /* Theoretically, an assinment returns its left side as an
1489 * lvalue, if we don't need an lvalue though, we return
1490 * the right side as an rvalue, otherwise we have to
1491 * somehow know whether or not we need to dereference the pointer
1492 * on the left side - that is: OP_LOAD if it was an address.
1493 * Also: in original QC we cannot OP_LOADP *anyway*.
1495 *out = (lvalue ? left : right);
1500 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1502 ast_expression_codegen *cgen;
1503 ir_value *left, *right;
1505 /* A binary operation cannot yield an l-value */
1507 asterror(ast_ctx(self), "not an l-value (binop)");
1511 if (self->expression.outr) {
1512 *out = self->expression.outr;
1516 if (OPTS_FLAG(SHORT_LOGIC) &&
1517 (self->op == INSTR_AND || self->op == INSTR_OR))
1519 /* short circuit evaluation */
1520 ir_block *other, *merge;
1521 ir_block *from_left, *from_right;
1525 merge_id = vec_size(func->blocks);
1526 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_merge"));
1528 cgen = self->left->expression.codegen;
1529 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1532 from_left = func->curblock;
1533 other = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_other"));
1534 if (self->op == INSTR_AND) {
1535 if (!ir_block_create_if(func->curblock, left, other, merge))
1538 if (!ir_block_create_if(func->curblock, left, merge, other))
1542 func->curblock = other;
1543 cgen = self->right->expression.codegen;
1544 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1546 from_right = func->curblock;
1548 if (!ir_block_create_jump(func->curblock, merge))
1551 vec_remove(func->ir_func->blocks, merge_id, 1);
1552 vec_push(func->ir_func->blocks, merge);
1554 func->curblock = merge;
1555 phi = ir_block_create_phi(func->curblock, ast_function_label(func, "sce_value"), TYPE_FLOAT);
1556 ir_phi_add(phi, from_left, left);
1557 ir_phi_add(phi, from_right, right);
1558 *out = ir_phi_value(phi);
1559 self->expression.outr = *out;
1563 cgen = self->left->expression.codegen;
1564 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1567 cgen = self->right->expression.codegen;
1568 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1571 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1572 self->op, left, right);
1575 self->expression.outr = *out;
1580 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1582 ast_expression_codegen *cgen;
1583 ir_value *leftl, *leftr, *right, *bin;
1585 if (lvalue && self->expression.outl) {
1586 *out = self->expression.outl;
1590 if (!lvalue && self->expression.outr) {
1591 *out = self->expression.outr;
1595 /* for a binstore we need both an lvalue and an rvalue for the left side */
1596 /* rvalue of destination! */
1597 cgen = self->dest->expression.codegen;
1598 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1601 /* source as rvalue only */
1602 cgen = self->source->expression.codegen;
1603 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1606 /* now the binary */
1607 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1608 self->opbin, leftr, right);
1609 self->expression.outr = bin;
1611 /* now store them */
1612 cgen = self->dest->expression.codegen;
1613 /* lvalue of destination */
1614 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1616 self->expression.outl = leftl;
1618 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1620 self->expression.outr = bin;
1622 /* Theoretically, an assinment returns its left side as an
1623 * lvalue, if we don't need an lvalue though, we return
1624 * the right side as an rvalue, otherwise we have to
1625 * somehow know whether or not we need to dereference the pointer
1626 * on the left side - that is: OP_LOAD if it was an address.
1627 * Also: in original QC we cannot OP_LOADP *anyway*.
1629 *out = (lvalue ? leftl : bin);
1634 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1636 ast_expression_codegen *cgen;
1639 /* An unary operation cannot yield an l-value */
1641 asterror(ast_ctx(self), "not an l-value (binop)");
1645 if (self->expression.outr) {
1646 *out = self->expression.outr;
1650 cgen = self->operand->expression.codegen;
1652 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1655 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1659 self->expression.outr = *out;
1664 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1666 ast_expression_codegen *cgen;
1669 /* In the context of a return operation, we don't actually return
1673 asterror(ast_ctx(self), "return-expression is not an l-value");
1677 if (self->expression.outr) {
1678 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1681 self->expression.outr = (ir_value*)1;
1683 if (self->operand) {
1684 cgen = self->operand->expression.codegen;
1686 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1689 if (!ir_block_create_return(func->curblock, operand))
1692 if (!ir_block_create_return(func->curblock, NULL))
1699 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1701 ast_expression_codegen *cgen;
1702 ir_value *ent, *field;
1704 /* This function needs to take the 'lvalue' flag into account!
1705 * As lvalue we provide a field-pointer, as rvalue we provide the
1709 if (lvalue && self->expression.outl) {
1710 *out = self->expression.outl;
1714 if (!lvalue && self->expression.outr) {
1715 *out = self->expression.outr;
1719 cgen = self->entity->expression.codegen;
1720 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1723 cgen = self->field->expression.codegen;
1724 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1729 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1732 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1733 ent, field, self->expression.vtype);
1736 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1737 (lvalue ? "ADDRESS" : "FIELD"),
1738 type_name[self->expression.vtype]);
1743 self->expression.outl = *out;
1745 self->expression.outr = *out;
1747 /* Hm that should be it... */
1751 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1753 ast_expression_codegen *cgen;
1756 /* in QC this is always an lvalue */
1758 if (self->expression.outl) {
1759 *out = self->expression.outl;
1763 cgen = self->owner->expression.codegen;
1764 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1767 if (vec->vtype != TYPE_VECTOR &&
1768 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1773 *out = ir_value_vector_member(vec, self->field);
1774 self->expression.outl = *out;
1776 return (*out != NULL);
1779 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
1784 if (!lvalue && self->expression.outr) {
1785 *out = self->expression.outr;
1787 if (lvalue && self->expression.outl) {
1788 *out = self->expression.outl;
1791 if (!ast_istype(self->array, ast_value)) {
1792 asterror(ast_ctx(self), "array indexing this way is not supported");
1793 /* note this would actually be pointer indexing because the left side is
1794 * not an actual array but (hopefully) an indexable expression.
1795 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
1796 * support this path will be filled.
1801 arr = (ast_value*)self->array;
1802 idx = (ast_value*)self->index;
1804 if (!ast_istype(self->index, ast_value) || !idx->isconst) {
1805 /* Time to use accessor functions */
1806 ast_expression_codegen *cgen;
1807 ir_value *iridx, *funval;
1811 asterror(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
1816 asterror(ast_ctx(self), "value has no getter, don't know how to index it");
1820 cgen = self->index->expression.codegen;
1821 if (!(*cgen)((ast_expression*)(self->index), func, true, &iridx))
1824 cgen = arr->getter->expression.codegen;
1825 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
1828 call = ir_block_create_call(func->curblock, ast_function_label(func, "fetch"), funval);
1831 ir_call_param(call, iridx);
1833 *out = ir_call_value(call);
1834 self->expression.outr = *out;
1838 if (idx->expression.vtype == TYPE_FLOAT)
1839 *out = arr->ir_values[(int)idx->constval.vfloat];
1840 else if (idx->expression.vtype == TYPE_INTEGER)
1841 *out = arr->ir_values[idx->constval.vint];
1843 asterror(ast_ctx(self), "array indexing here needs an integer constant");
1849 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1851 ast_expression_codegen *cgen;
1856 ir_block *cond = func->curblock;
1859 ir_block *ontrue_endblock = NULL;
1860 ir_block *onfalse_endblock = NULL;
1863 /* We don't output any value, thus also don't care about r/lvalue */
1867 if (self->expression.outr) {
1868 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
1871 self->expression.outr = (ir_value*)1;
1873 /* generate the condition */
1874 func->curblock = cond;
1875 cgen = self->cond->expression.codegen;
1876 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1881 if (self->on_true) {
1882 /* create on-true block */
1883 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1887 /* enter the block */
1888 func->curblock = ontrue;
1891 cgen = self->on_true->expression.codegen;
1892 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1895 /* we now need to work from the current endpoint */
1896 ontrue_endblock = func->curblock;
1901 if (self->on_false) {
1902 /* create on-false block */
1903 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1907 /* enter the block */
1908 func->curblock = onfalse;
1911 cgen = self->on_false->expression.codegen;
1912 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1915 /* we now need to work from the current endpoint */
1916 onfalse_endblock = func->curblock;
1920 /* Merge block were they all merge in to */
1921 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1925 /* add jumps ot the merge block */
1926 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
1928 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
1931 /* we create the if here, that way all blocks are ordered :)
1933 if (!ir_block_create_if(cond, condval,
1934 (ontrue ? ontrue : merge),
1935 (onfalse ? onfalse : merge)))
1940 /* Now enter the merge block */
1941 func->curblock = merge;
1946 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1948 ast_expression_codegen *cgen;
1951 ir_value *trueval, *falseval;
1954 ir_block *cond = func->curblock;
1959 /* Ternary can never create an lvalue... */
1963 /* In theory it shouldn't be possible to pass through a node twice, but
1964 * in case we add any kind of optimization pass for the AST itself, it
1965 * may still happen, thus we remember a created ir_value and simply return one
1966 * if it already exists.
1968 if (self->phi_out) {
1969 *out = self->phi_out;
1973 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1975 /* generate the condition */
1976 func->curblock = cond;
1977 cgen = self->cond->expression.codegen;
1978 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1981 /* create on-true block */
1982 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1987 /* enter the block */
1988 func->curblock = ontrue;
1991 cgen = self->on_true->expression.codegen;
1992 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1996 /* create on-false block */
1997 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
2002 /* enter the block */
2003 func->curblock = onfalse;
2006 cgen = self->on_false->expression.codegen;
2007 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2011 /* create merge block */
2012 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
2015 /* jump to merge block */
2016 if (!ir_block_create_jump(ontrue, merge))
2018 if (!ir_block_create_jump(onfalse, merge))
2021 /* create if instruction */
2022 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
2025 /* Now enter the merge block */
2026 func->curblock = merge;
2028 /* Here, now, we need a PHI node
2029 * but first some sanity checking...
2031 if (trueval->vtype != falseval->vtype) {
2032 /* error("ternary with different types on the two sides"); */
2037 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
2040 ir_phi_add(phi, ontrue, trueval);
2041 ir_phi_add(phi, onfalse, falseval);
2043 self->phi_out = ir_phi_value(phi);
2044 *out = self->phi_out;
2049 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2051 ast_expression_codegen *cgen;
2053 ir_value *dummy = NULL;
2054 ir_value *precond = NULL;
2055 ir_value *postcond = NULL;
2057 /* Since we insert some jumps "late" so we have blocks
2058 * ordered "nicely", we need to keep track of the actual end-blocks
2059 * of expressions to add the jumps to.
2061 ir_block *bbody = NULL, *end_bbody = NULL;
2062 ir_block *bprecond = NULL, *end_bprecond = NULL;
2063 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2064 ir_block *bincrement = NULL, *end_bincrement = NULL;
2065 ir_block *bout = NULL, *bin = NULL;
2067 /* let's at least move the outgoing block to the end */
2070 /* 'break' and 'continue' need to be able to find the right blocks */
2071 ir_block *bcontinue = NULL;
2072 ir_block *bbreak = NULL;
2074 ir_block *old_bcontinue = NULL;
2075 ir_block *old_bbreak = NULL;
2077 ir_block *tmpblock = NULL;
2082 if (self->expression.outr) {
2083 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2086 self->expression.outr = (ir_value*)1;
2089 * Should we ever need some kind of block ordering, better make this function
2090 * move blocks around than write a block ordering algorithm later... after all
2091 * the ast and ir should work together, not against each other.
2094 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2095 * anyway if for example it contains a ternary.
2099 cgen = self->initexpr->expression.codegen;
2100 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2104 /* Store the block from which we enter this chaos */
2105 bin = func->curblock;
2107 /* The pre-loop condition needs its own block since we
2108 * need to be able to jump to the start of that expression.
2112 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
2116 /* the pre-loop-condition the least important place to 'continue' at */
2117 bcontinue = bprecond;
2120 func->curblock = bprecond;
2123 cgen = self->precond->expression.codegen;
2124 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2127 end_bprecond = func->curblock;
2129 bprecond = end_bprecond = NULL;
2132 /* Now the next blocks won't be ordered nicely, but we need to
2133 * generate them this early for 'break' and 'continue'.
2135 if (self->increment) {
2136 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
2139 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2141 bincrement = end_bincrement = NULL;
2144 if (self->postcond) {
2145 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
2148 bcontinue = bpostcond; /* postcond comes before the increment */
2150 bpostcond = end_bpostcond = NULL;
2153 bout_id = vec_size(func->ir_func->blocks);
2154 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
2159 /* The loop body... */
2162 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
2167 func->curblock = bbody;
2169 old_bbreak = func->breakblock;
2170 old_bcontinue = func->continueblock;
2171 func->breakblock = bbreak;
2172 func->continueblock = bcontinue;
2175 cgen = self->body->expression.codegen;
2176 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2179 end_bbody = func->curblock;
2180 func->breakblock = old_bbreak;
2181 func->continueblock = old_bcontinue;
2184 /* post-loop-condition */
2188 func->curblock = bpostcond;
2191 cgen = self->postcond->expression.codegen;
2192 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2195 end_bpostcond = func->curblock;
2198 /* The incrementor */
2199 if (self->increment)
2202 func->curblock = bincrement;
2205 cgen = self->increment->expression.codegen;
2206 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2209 end_bincrement = func->curblock;
2212 /* In any case now, we continue from the outgoing block */
2213 func->curblock = bout;
2215 /* Now all blocks are in place */
2216 /* From 'bin' we jump to whatever comes first */
2217 if (bprecond) tmpblock = bprecond;
2218 else if (bbody) tmpblock = bbody;
2219 else if (bpostcond) tmpblock = bpostcond;
2220 else tmpblock = bout;
2221 if (!ir_block_create_jump(bin, tmpblock))
2227 ir_block *ontrue, *onfalse;
2228 if (bbody) ontrue = bbody;
2229 else if (bincrement) ontrue = bincrement;
2230 else if (bpostcond) ontrue = bpostcond;
2231 else ontrue = bprecond;
2233 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
2240 if (bincrement) tmpblock = bincrement;
2241 else if (bpostcond) tmpblock = bpostcond;
2242 else if (bprecond) tmpblock = bprecond;
2243 else tmpblock = bout;
2244 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
2248 /* from increment */
2251 if (bpostcond) tmpblock = bpostcond;
2252 else if (bprecond) tmpblock = bprecond;
2253 else if (bbody) tmpblock = bbody;
2254 else tmpblock = bout;
2255 if (!ir_block_create_jump(end_bincrement, tmpblock))
2262 ir_block *ontrue, *onfalse;
2263 if (bprecond) ontrue = bprecond;
2264 else if (bbody) ontrue = bbody;
2265 else if (bincrement) ontrue = bincrement;
2266 else ontrue = bpostcond;
2268 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
2272 /* Move 'bout' to the end */
2273 vec_remove(func->ir_func->blocks, bout_id, 1);
2274 vec_push(func->ir_func->blocks, bout);
2279 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2284 asterror(ast_ctx(self), "break/continue expression is not an l-value");
2288 if (self->expression.outr) {
2289 asterror(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2292 self->expression.outr = (ir_value*)1;
2294 if (self->is_continue)
2295 target = func->continueblock;
2297 target = func->breakblock;
2299 if (!ir_block_create_jump(func->curblock, target))
2304 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2306 ast_expression_codegen *cgen;
2308 ast_switch_case *def_case = NULL;
2309 ir_block *def_bfall = NULL;
2311 ir_value *dummy = NULL;
2312 ir_value *irop = NULL;
2313 ir_block *old_break = NULL;
2314 ir_block *bout = NULL;
2315 ir_block *bfall = NULL;
2323 asterror(ast_ctx(self), "switch expression is not an l-value");
2327 if (self->expression.outr) {
2328 asterror(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2331 self->expression.outr = (ir_value*)1;
2336 cgen = self->operand->expression.codegen;
2337 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2340 if (!vec_size(self->cases))
2343 cmpinstr = type_eq_instr[irop->vtype];
2344 if (cmpinstr >= AINSTR_END) {
2345 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2346 asterror(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2350 bout_id = vec_size(func->ir_func->blocks);
2351 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_switch"));
2355 /* setup the break block */
2356 old_break = func->breakblock;
2357 func->breakblock = bout;
2359 /* Now create all cases */
2360 for (c = 0; c < vec_size(self->cases); ++c) {
2361 ir_value *cond, *val;
2362 ir_block *bcase, *bnot;
2365 ast_switch_case *swcase = &self->cases[c];
2367 if (swcase->value) {
2368 /* A regular case */
2369 /* generate the condition operand */
2370 cgen = swcase->value->expression.codegen;
2371 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2373 /* generate the condition */
2374 cond = ir_block_create_binop(func->curblock, ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2378 bcase = ir_function_create_block(func->ir_func, ast_function_label(func, "case"));
2379 bnot_id = vec_size(func->ir_func->blocks);
2380 bnot = ir_function_create_block(func->ir_func, ast_function_label(func, "not_case"));
2381 if (!bcase || !bnot)
2383 if (!ir_block_create_if(func->curblock, cond, bcase, bnot))
2386 /* Make the previous case-end fall through */
2387 if (bfall && !bfall->final) {
2388 if (!ir_block_create_jump(bfall, bcase))
2392 /* enter the case */
2393 func->curblock = bcase;
2394 cgen = swcase->code->expression.codegen;
2395 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2398 /* remember this block to fall through from */
2399 bfall = func->curblock;
2401 /* enter the else and move it down */
2402 func->curblock = bnot;
2403 vec_remove(func->ir_func->blocks, bnot_id, 1);
2404 vec_push(func->ir_func->blocks, bnot);
2406 /* The default case */
2407 /* Remember where to fall through from: */
2410 /* remember which case it was */
2415 /* Jump from the last bnot to bout */
2416 if (bfall && !bfall->final && !ir_block_create_jump(bfall, bout)) {
2418 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2423 /* If there was a default case, put it down here */
2427 /* No need to create an extra block */
2428 bcase = func->curblock;
2430 /* Insert the fallthrough jump */
2431 if (def_bfall && !def_bfall->final) {
2432 if (!ir_block_create_jump(def_bfall, bcase))
2436 /* Now generate the default code */
2437 cgen = def_case->code->expression.codegen;
2438 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2442 /* Jump from the last bnot to bout */
2443 if (!func->curblock->final && !ir_block_create_jump(func->curblock, bout))
2445 /* enter the outgoing block */
2446 func->curblock = bout;
2448 /* restore the break block */
2449 func->breakblock = old_break;
2451 /* Move 'bout' to the end, it's nicer */
2452 vec_remove(func->ir_func->blocks, bout_id, 1);
2453 vec_push(func->ir_func->blocks, bout);
2458 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2460 ast_expression_codegen *cgen;
2462 ir_instr *callinstr;
2465 ir_value *funval = NULL;
2467 /* return values are never lvalues */
2469 asterror(ast_ctx(self), "not an l-value (function call)");
2473 if (self->expression.outr) {
2474 *out = self->expression.outr;
2478 cgen = self->func->expression.codegen;
2479 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2487 for (i = 0; i < vec_size(self->params); ++i)
2490 ast_expression *expr = self->params[i];
2492 cgen = expr->expression.codegen;
2493 if (!(*cgen)(expr, func, false, ¶m))
2497 vec_push(params, param);
2500 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
2504 for (i = 0; i < vec_size(params); ++i) {
2505 ir_call_param(callinstr, params[i]);
2508 *out = ir_call_value(callinstr);
2509 self->expression.outr = *out;