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;
658 void ast_ternary_delete(ast_ternary *self)
660 ast_unref(self->cond);
661 ast_unref(self->on_true);
662 ast_unref(self->on_false);
663 ast_expression_delete((ast_expression*)self);
667 ast_loop* ast_loop_new(lex_ctx ctx,
668 ast_expression *initexpr,
669 ast_expression *precond,
670 ast_expression *postcond,
671 ast_expression *increment,
672 ast_expression *body)
674 ast_instantiate(ast_loop, ctx, ast_loop_delete);
675 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
677 self->initexpr = initexpr;
678 self->precond = precond;
679 self->postcond = postcond;
680 self->increment = increment;
686 void ast_loop_delete(ast_loop *self)
689 ast_unref(self->initexpr);
691 ast_unref(self->precond);
693 ast_unref(self->postcond);
695 ast_unref(self->increment);
697 ast_unref(self->body);
698 ast_expression_delete((ast_expression*)self);
702 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont)
704 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
705 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
707 self->is_continue = iscont;
712 void ast_breakcont_delete(ast_breakcont *self)
714 ast_expression_delete((ast_expression*)self);
718 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
720 ast_instantiate(ast_switch, ctx, ast_switch_delete);
721 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
729 void ast_switch_delete(ast_switch *self)
732 ast_unref(self->operand);
734 for (i = 0; i < vec_size(self->cases); ++i) {
735 if (self->cases[i].value)
736 ast_unref(self->cases[i].value);
737 ast_unref(self->cases[i].code);
739 vec_free(self->cases);
741 ast_expression_delete((ast_expression*)self);
745 ast_call* ast_call_new(lex_ctx ctx,
746 ast_expression *funcexpr)
748 ast_instantiate(ast_call, ctx, ast_call_delete);
749 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
752 self->func = funcexpr;
754 self->expression.vtype = funcexpr->expression.next->expression.vtype;
755 if (funcexpr->expression.next->expression.next)
756 self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
761 void ast_call_delete(ast_call *self)
764 for (i = 0; i < vec_size(self->params); ++i)
765 ast_unref(self->params[i]);
766 vec_free(self->params);
769 ast_unref(self->func);
771 ast_expression_delete((ast_expression*)self);
775 bool ast_call_check_types(ast_call *self)
779 const ast_expression *func = self->func;
780 size_t count = vec_size(self->params);
781 if (count > vec_size(func->expression.params))
782 count = vec_size(func->expression.params);
784 for (i = 0; i < count; ++i) {
785 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
786 asterror(ast_ctx(self), "invalid type for parameter %u in function call",
787 (unsigned int)(i+1));
788 /* we don't immediately return */
795 ast_store* ast_store_new(lex_ctx ctx, int op,
796 ast_expression *dest, ast_expression *source)
798 ast_instantiate(ast_store, ctx, ast_store_delete);
799 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
803 self->source = source;
805 self->expression.vtype = dest->expression.vtype;
806 if (dest->expression.next) {
807 self->expression.next = ast_type_copy(ctx, dest);
808 if (!self->expression.next) {
814 self->expression.next = NULL;
819 void ast_store_delete(ast_store *self)
821 ast_unref(self->dest);
822 ast_unref(self->source);
823 ast_expression_delete((ast_expression*)self);
827 ast_block* ast_block_new(lex_ctx ctx)
829 ast_instantiate(ast_block, ctx, ast_block_delete);
830 ast_expression_init((ast_expression*)self,
831 (ast_expression_codegen*)&ast_block_codegen);
835 self->collect = NULL;
840 void ast_block_collect(ast_block *self, ast_expression *expr)
842 vec_push(self->collect, expr);
843 expr->expression.node.keep = true;
846 void ast_block_delete(ast_block *self)
849 for (i = 0; i < vec_size(self->exprs); ++i)
850 ast_unref(self->exprs[i]);
851 vec_free(self->exprs);
852 for (i = 0; i < vec_size(self->locals); ++i)
853 ast_delete(self->locals[i]);
854 vec_free(self->locals);
855 for (i = 0; i < vec_size(self->collect); ++i)
856 ast_delete(self->collect[i]);
857 vec_free(self->collect);
858 ast_expression_delete((ast_expression*)self);
862 bool ast_block_set_type(ast_block *self, ast_expression *from)
864 if (self->expression.next)
865 ast_delete(self->expression.next);
866 self->expression.vtype = from->expression.vtype;
867 if (from->expression.next) {
868 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
869 if (!self->expression.next)
873 self->expression.next = NULL;
877 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
879 ast_instantiate(ast_function, ctx, ast_function_delete);
883 vtype->expression.vtype != TYPE_FUNCTION)
890 self->name = name ? util_strdup(name) : NULL;
893 self->labelcount = 0;
896 self->ir_func = NULL;
897 self->curblock = NULL;
899 self->breakblock = NULL;
900 self->continueblock = NULL;
902 vtype->isconst = true;
903 vtype->constval.vfunc = self;
908 void ast_function_delete(ast_function *self)
912 mem_d((void*)self->name);
914 /* ast_value_delete(self->vtype); */
915 self->vtype->isconst = false;
916 self->vtype->constval.vfunc = NULL;
917 /* We use unref - if it was stored in a global table it is supposed
918 * to be deleted from *there*
920 ast_unref(self->vtype);
922 for (i = 0; i < vec_size(self->blocks); ++i)
923 ast_delete(self->blocks[i]);
924 vec_free(self->blocks);
928 const char* ast_function_label(ast_function *self, const char *prefix)
937 id = (self->labelcount++);
938 len = strlen(prefix);
940 from = self->labelbuf + sizeof(self->labelbuf)-1;
943 unsigned int digit = id % 10;
947 memcpy(from - len, prefix, len);
951 /*********************************************************************/
953 * by convention you must never pass NULL to the 'ir_value **out'
954 * parameter. If you really don't care about the output, pass a dummy.
955 * But I can't imagine a pituation where the output is truly unnecessary.
958 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
960 /* NOTE: This is the codegen for a variable used in an expression.
961 * It is not the codegen to generate the value. For this purpose,
962 * ast_local_codegen and ast_global_codegen are to be used before this
963 * is executed. ast_function_codegen should take care of its locals,
964 * and the ast-user should take care of ast_global_codegen to be used
965 * on all the globals.
969 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
970 asterror(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
977 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
981 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
983 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
986 func->context = ast_ctx(self);
987 func->value->context = ast_ctx(self);
989 self->constval.vfunc->ir_func = func;
990 self->ir_v = func->value;
991 /* The function is filled later on ast_function_codegen... */
995 if (isfield && self->expression.vtype == TYPE_FIELD) {
996 ast_expression *fieldtype = self->expression.next;
999 asterror(ast_ctx(self), "TODO: constant field pointers with value");
1003 if (fieldtype->expression.vtype == TYPE_ARRAY) {
1008 ast_expression_common *elemtype;
1010 ast_value *array = (ast_value*)fieldtype;
1012 if (!ast_istype(fieldtype, ast_value)) {
1013 asterror(ast_ctx(self), "internal error: ast_value required");
1017 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1018 if (!array->expression.count || array->expression.count > opts_max_array_size)
1019 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1021 elemtype = &array->expression.next->expression;
1022 vtype = elemtype->vtype;
1024 v = ir_builder_create_field(ir, self->name, vtype);
1026 asterror(ast_ctx(self), "ir_builder_create_global failed");
1029 if (vtype == TYPE_FIELD)
1030 v->fieldtype = elemtype->next->expression.vtype;
1031 v->context = ast_ctx(self);
1032 array->ir_v = self->ir_v = v;
1034 namelen = strlen(self->name);
1035 name = (char*)mem_a(namelen + 16);
1036 strcpy(name, self->name);
1038 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1039 array->ir_values[0] = v;
1040 for (ai = 1; ai < array->expression.count; ++ai) {
1041 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1042 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1043 if (!array->ir_values[ai]) {
1045 asterror(ast_ctx(self), "ir_builder_create_global failed");
1048 if (vtype == TYPE_FIELD)
1049 array->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1050 array->ir_values[ai]->context = ast_ctx(self);
1056 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1059 v->context = ast_ctx(self);
1065 if (self->expression.vtype == TYPE_ARRAY) {
1070 ast_expression_common *elemtype = &self->expression.next->expression;
1071 int vtype = elemtype->vtype;
1073 /* same as with field arrays */
1074 if (!self->expression.count || self->expression.count > opts_max_array_size)
1075 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1077 v = ir_builder_create_global(ir, self->name, vtype);
1079 asterror(ast_ctx(self), "ir_builder_create_global failed");
1082 if (vtype == TYPE_FIELD)
1083 v->fieldtype = elemtype->next->expression.vtype;
1084 v->context = ast_ctx(self);
1086 namelen = strlen(self->name);
1087 name = (char*)mem_a(namelen + 16);
1088 strcpy(name, self->name);
1090 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1091 self->ir_values[0] = v;
1092 for (ai = 1; ai < self->expression.count; ++ai) {
1093 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1094 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1095 if (!self->ir_values[ai]) {
1097 asterror(ast_ctx(self), "ir_builder_create_global failed");
1100 if (vtype == TYPE_FIELD)
1101 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1102 self->ir_values[ai]->context = ast_ctx(self);
1108 /* Arrays don't do this since there's no "array" value which spans across the
1111 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1113 asterror(ast_ctx(self), "ir_builder_create_global failed");
1116 if (self->expression.vtype == TYPE_FIELD)
1117 v->fieldtype = self->expression.next->expression.vtype;
1118 v->context = ast_ctx(self);
1121 if (self->isconst) {
1122 switch (self->expression.vtype)
1125 if (!ir_value_set_float(v, self->constval.vfloat))
1129 if (!ir_value_set_vector(v, self->constval.vvec))
1133 if (!ir_value_set_string(v, self->constval.vstring))
1137 asterror(ast_ctx(self), "TODO: global constant array");
1140 asterror(ast_ctx(self), "global of type function not properly generated");
1142 /* Cannot generate an IR value for a function,
1143 * need a pointer pointing to a function rather.
1146 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1151 /* link us to the ir_value */
1155 error: /* clean up */
1160 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1163 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
1165 /* Do we allow local functions? I think not...
1166 * this is NOT a function pointer atm.
1171 if (self->expression.vtype == TYPE_ARRAY) {
1176 ast_expression_common *elemtype = &self->expression.next->expression;
1177 int vtype = elemtype->vtype;
1180 asterror(ast_ctx(self), "array-parameters are not supported");
1184 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1185 if (!self->expression.count || self->expression.count > opts_max_array_size) {
1186 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1189 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1190 if (!self->ir_values) {
1191 asterror(ast_ctx(self), "failed to allocate array values");
1195 v = ir_function_create_local(func, self->name, vtype, param);
1197 asterror(ast_ctx(self), "ir_function_create_local failed");
1200 if (vtype == TYPE_FIELD)
1201 v->fieldtype = elemtype->next->expression.vtype;
1202 v->context = ast_ctx(self);
1204 namelen = strlen(self->name);
1205 name = (char*)mem_a(namelen + 16);
1206 strcpy(name, self->name);
1208 self->ir_values[0] = v;
1209 for (ai = 1; ai < self->expression.count; ++ai) {
1210 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1211 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1212 if (!self->ir_values[ai]) {
1213 asterror(ast_ctx(self), "ir_builder_create_global failed");
1216 if (vtype == TYPE_FIELD)
1217 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1218 self->ir_values[ai]->context = ast_ctx(self);
1223 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1226 if (self->expression.vtype == TYPE_FIELD)
1227 v->fieldtype = self->expression.next->expression.vtype;
1228 v->context = ast_ctx(self);
1231 /* A constant local... hmmm...
1232 * I suppose the IR will have to deal with this
1234 if (self->isconst) {
1235 switch (self->expression.vtype)
1238 if (!ir_value_set_float(v, self->constval.vfloat))
1242 if (!ir_value_set_vector(v, self->constval.vvec))
1246 if (!ir_value_set_string(v, self->constval.vstring))
1250 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1255 /* link us to the ir_value */
1259 if (!ast_global_codegen(self->setter, func->owner, false) ||
1260 !ast_function_codegen(self->setter->constval.vfunc, func->owner) ||
1261 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1265 if (!ast_global_codegen(self->getter, func->owner, false) ||
1266 !ast_function_codegen(self->getter->constval.vfunc, func->owner) ||
1267 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1272 error: /* clean up */
1277 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1281 ast_expression_common *ec;
1284 irf = self->ir_func;
1286 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1290 /* fill the parameter list */
1291 ec = &self->vtype->expression;
1292 for (i = 0; i < vec_size(ec->params); ++i)
1294 vec_push(irf->params, ec->params[i]->expression.vtype);
1295 if (!self->builtin) {
1296 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1301 if (self->builtin) {
1302 irf->builtin = self->builtin;
1306 if (!vec_size(self->blocks)) {
1307 asterror(ast_ctx(self), "function `%s` has no body", self->name);
1311 self->curblock = ir_function_create_block(irf, "entry");
1312 if (!self->curblock) {
1313 asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1317 for (i = 0; i < vec_size(self->blocks); ++i) {
1318 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1319 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1323 /* TODO: check return types */
1324 if (!self->curblock->is_return)
1326 return ir_block_create_return(self->curblock, NULL);
1327 /* From now on the parser has to handle this situation */
1329 if (!self->vtype->expression.next ||
1330 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1332 return ir_block_create_return(self->curblock, NULL);
1336 /* error("missing return"); */
1337 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
1345 /* Note, you will not see ast_block_codegen generate ir_blocks.
1346 * To the AST and the IR, blocks are 2 different things.
1347 * In the AST it represents a block of code, usually enclosed in
1348 * curly braces {...}.
1349 * While in the IR it represents a block in terms of control-flow.
1351 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1355 /* We don't use this
1356 * Note: an ast-representation using the comma-operator
1357 * of the form: (a, b, c) = x should not assign to c...
1360 asterror(ast_ctx(self), "not an l-value (code-block)");
1364 if (self->expression.outr) {
1365 *out = self->expression.outr;
1369 /* output is NULL at first, we'll have each expression
1370 * assign to out output, thus, a comma-operator represention
1371 * using an ast_block will return the last generated value,
1372 * so: (b, c) + a executed both b and c, and returns c,
1373 * which is then added to a.
1377 /* generate locals */
1378 for (i = 0; i < vec_size(self->locals); ++i)
1380 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1382 asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1387 for (i = 0; i < vec_size(self->exprs); ++i)
1389 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1390 if (func->curblock->final) {
1391 asterror(ast_ctx(self->exprs[i]), "unreachable statement");
1394 if (!(*gen)(self->exprs[i], func, false, out))
1398 self->expression.outr = *out;
1403 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1405 ast_expression_codegen *cgen;
1406 ir_value *left, *right;
1410 ast_array_index *ai = NULL;
1412 if (lvalue && self->expression.outl) {
1413 *out = self->expression.outl;
1417 if (!lvalue && self->expression.outr) {
1418 *out = self->expression.outr;
1422 if (ast_istype(self->dest, ast_array_index))
1425 ai = (ast_array_index*)self->dest;
1426 idx = (ast_value*)ai->index;
1428 if (ast_istype(ai->index, ast_value) && idx->isconst)
1433 /* we need to call the setter */
1434 ir_value *iridx, *funval;
1438 asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1442 arr = (ast_value*)ai->array;
1443 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1444 asterror(ast_ctx(self), "value has no setter (%s)", arr->name);
1448 cgen = idx->expression.codegen;
1449 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1452 cgen = arr->setter->expression.codegen;
1453 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1456 cgen = self->source->expression.codegen;
1457 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1460 call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval);
1463 ir_call_param(call, iridx);
1464 ir_call_param(call, right);
1465 self->expression.outr = right;
1471 cgen = self->dest->expression.codegen;
1473 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1475 self->expression.outl = left;
1477 cgen = self->source->expression.codegen;
1479 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1482 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1484 self->expression.outr = right;
1487 /* Theoretically, an assinment returns its left side as an
1488 * lvalue, if we don't need an lvalue though, we return
1489 * the right side as an rvalue, otherwise we have to
1490 * somehow know whether or not we need to dereference the pointer
1491 * on the left side - that is: OP_LOAD if it was an address.
1492 * Also: in original QC we cannot OP_LOADP *anyway*.
1494 *out = (lvalue ? left : right);
1499 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1501 ast_expression_codegen *cgen;
1502 ir_value *left, *right;
1504 /* A binary operation cannot yield an l-value */
1506 asterror(ast_ctx(self), "not an l-value (binop)");
1510 if (self->expression.outr) {
1511 *out = self->expression.outr;
1515 if (OPTS_FLAG(SHORT_LOGIC) &&
1516 (self->op == INSTR_AND || self->op == INSTR_OR))
1518 /* short circuit evaluation */
1519 ir_block *other, *merge;
1520 ir_block *from_left, *from_right;
1525 /* Note about casting to true boolean values:
1526 * We use a single NOT for sub expressions, and an
1527 * overall NOT at the end, and for that purpose swap
1528 * all the jump conditions in order for the NOT to get
1530 * ie: (a && b) usually becomes (!!a ? !!b : !!a)
1531 * but we translate this to (!(!a ? !a : !b))
1534 merge_id = vec_size(func->ir_func->blocks);
1535 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_merge"));
1537 cgen = self->left->expression.codegen;
1538 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1540 if (!OPTS_FLAG(PERL_LOGIC)) {
1541 notop = type_not_instr[left->vtype];
1542 if (notop == AINSTR_END) {
1543 asterror(ast_ctx(self), "don't know how to cast to bool...");
1546 left = ir_block_create_unary(func->curblock,
1547 ast_function_label(func, "sce_not"),
1551 from_left = func->curblock;
1553 other = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_other"));
1554 if ( !(self->op == INSTR_OR) != !OPTS_FLAG(PERL_LOGIC) ) {
1555 if (!ir_block_create_if(func->curblock, left, other, merge))
1558 if (!ir_block_create_if(func->curblock, left, merge, other))
1561 /* use the likely flag */
1562 vec_last(func->curblock->instr)->likely = true;
1564 func->curblock = other;
1565 cgen = self->right->expression.codegen;
1566 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1568 if (!OPTS_FLAG(PERL_LOGIC)) {
1569 notop = type_not_instr[right->vtype];
1570 if (notop == AINSTR_END) {
1571 asterror(ast_ctx(self), "don't know how to cast to bool...");
1574 right = ir_block_create_unary(func->curblock,
1575 ast_function_label(func, "sce_not"),
1579 from_right = func->curblock;
1581 if (!ir_block_create_jump(func->curblock, merge))
1584 vec_remove(func->ir_func->blocks, merge_id, 1);
1585 vec_push(func->ir_func->blocks, merge);
1587 func->curblock = merge;
1588 phi = ir_block_create_phi(func->curblock, ast_function_label(func, "sce_value"), TYPE_FLOAT);
1589 ir_phi_add(phi, from_left, left);
1590 ir_phi_add(phi, from_right, right);
1591 *out = ir_phi_value(phi);
1592 if (!OPTS_FLAG(PERL_LOGIC)) {
1593 notop = type_not_instr[(*out)->vtype];
1594 if (notop == AINSTR_END) {
1595 asterror(ast_ctx(self), "don't know how to cast to bool...");
1598 *out = ir_block_create_unary(func->curblock,
1599 ast_function_label(func, "sce_final_not"),
1605 self->expression.outr = *out;
1609 cgen = self->left->expression.codegen;
1610 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1613 cgen = self->right->expression.codegen;
1614 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1617 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1618 self->op, left, right);
1621 self->expression.outr = *out;
1626 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1628 ast_expression_codegen *cgen;
1629 ir_value *leftl, *leftr, *right, *bin;
1631 if (lvalue && self->expression.outl) {
1632 *out = self->expression.outl;
1636 if (!lvalue && self->expression.outr) {
1637 *out = self->expression.outr;
1641 /* for a binstore we need both an lvalue and an rvalue for the left side */
1642 /* rvalue of destination! */
1643 cgen = self->dest->expression.codegen;
1644 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1647 /* source as rvalue only */
1648 cgen = self->source->expression.codegen;
1649 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1652 /* now the binary */
1653 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1654 self->opbin, leftr, right);
1655 self->expression.outr = bin;
1657 /* now store them */
1658 cgen = self->dest->expression.codegen;
1659 /* lvalue of destination */
1660 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1662 self->expression.outl = leftl;
1664 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1666 self->expression.outr = bin;
1668 /* Theoretically, an assinment returns its left side as an
1669 * lvalue, if we don't need an lvalue though, we return
1670 * the right side as an rvalue, otherwise we have to
1671 * somehow know whether or not we need to dereference the pointer
1672 * on the left side - that is: OP_LOAD if it was an address.
1673 * Also: in original QC we cannot OP_LOADP *anyway*.
1675 *out = (lvalue ? leftl : bin);
1680 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1682 ast_expression_codegen *cgen;
1685 /* An unary operation cannot yield an l-value */
1687 asterror(ast_ctx(self), "not an l-value (binop)");
1691 if (self->expression.outr) {
1692 *out = self->expression.outr;
1696 cgen = self->operand->expression.codegen;
1698 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1701 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1705 self->expression.outr = *out;
1710 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1712 ast_expression_codegen *cgen;
1715 /* In the context of a return operation, we don't actually return
1719 asterror(ast_ctx(self), "return-expression is not an l-value");
1723 if (self->expression.outr) {
1724 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1727 self->expression.outr = (ir_value*)1;
1729 if (self->operand) {
1730 cgen = self->operand->expression.codegen;
1732 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1735 if (!ir_block_create_return(func->curblock, operand))
1738 if (!ir_block_create_return(func->curblock, NULL))
1745 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1747 ast_expression_codegen *cgen;
1748 ir_value *ent, *field;
1750 /* This function needs to take the 'lvalue' flag into account!
1751 * As lvalue we provide a field-pointer, as rvalue we provide the
1755 if (lvalue && self->expression.outl) {
1756 *out = self->expression.outl;
1760 if (!lvalue && self->expression.outr) {
1761 *out = self->expression.outr;
1765 cgen = self->entity->expression.codegen;
1766 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1769 cgen = self->field->expression.codegen;
1770 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1775 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1778 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1779 ent, field, self->expression.vtype);
1782 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1783 (lvalue ? "ADDRESS" : "FIELD"),
1784 type_name[self->expression.vtype]);
1789 self->expression.outl = *out;
1791 self->expression.outr = *out;
1793 /* Hm that should be it... */
1797 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1799 ast_expression_codegen *cgen;
1802 /* in QC this is always an lvalue */
1804 if (self->expression.outl) {
1805 *out = self->expression.outl;
1809 cgen = self->owner->expression.codegen;
1810 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1813 if (vec->vtype != TYPE_VECTOR &&
1814 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1819 *out = ir_value_vector_member(vec, self->field);
1820 self->expression.outl = *out;
1822 return (*out != NULL);
1825 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
1830 if (!lvalue && self->expression.outr) {
1831 *out = self->expression.outr;
1833 if (lvalue && self->expression.outl) {
1834 *out = self->expression.outl;
1837 if (!ast_istype(self->array, ast_value)) {
1838 asterror(ast_ctx(self), "array indexing this way is not supported");
1839 /* note this would actually be pointer indexing because the left side is
1840 * not an actual array but (hopefully) an indexable expression.
1841 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
1842 * support this path will be filled.
1847 arr = (ast_value*)self->array;
1848 idx = (ast_value*)self->index;
1850 if (!ast_istype(self->index, ast_value) || !idx->isconst) {
1851 /* Time to use accessor functions */
1852 ast_expression_codegen *cgen;
1853 ir_value *iridx, *funval;
1857 asterror(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
1862 asterror(ast_ctx(self), "value has no getter, don't know how to index it");
1866 cgen = self->index->expression.codegen;
1867 if (!(*cgen)((ast_expression*)(self->index), func, true, &iridx))
1870 cgen = arr->getter->expression.codegen;
1871 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
1874 call = ir_block_create_call(func->curblock, ast_function_label(func, "fetch"), funval);
1877 ir_call_param(call, iridx);
1879 *out = ir_call_value(call);
1880 self->expression.outr = *out;
1884 if (idx->expression.vtype == TYPE_FLOAT)
1885 *out = arr->ir_values[(int)idx->constval.vfloat];
1886 else if (idx->expression.vtype == TYPE_INTEGER)
1887 *out = arr->ir_values[idx->constval.vint];
1889 asterror(ast_ctx(self), "array indexing here needs an integer constant");
1895 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1897 ast_expression_codegen *cgen;
1902 ir_block *cond = func->curblock;
1905 ir_block *ontrue_endblock = NULL;
1906 ir_block *onfalse_endblock = NULL;
1909 /* We don't output any value, thus also don't care about r/lvalue */
1913 if (self->expression.outr) {
1914 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
1917 self->expression.outr = (ir_value*)1;
1919 /* generate the condition */
1920 func->curblock = cond;
1921 cgen = self->cond->expression.codegen;
1922 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1927 if (self->on_true) {
1928 /* create on-true block */
1929 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1933 /* enter the block */
1934 func->curblock = ontrue;
1937 cgen = self->on_true->expression.codegen;
1938 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1941 /* we now need to work from the current endpoint */
1942 ontrue_endblock = func->curblock;
1947 if (self->on_false) {
1948 /* create on-false block */
1949 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1953 /* enter the block */
1954 func->curblock = onfalse;
1957 cgen = self->on_false->expression.codegen;
1958 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1961 /* we now need to work from the current endpoint */
1962 onfalse_endblock = func->curblock;
1966 /* Merge block were they all merge in to */
1967 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1971 /* add jumps ot the merge block */
1972 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
1974 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
1977 /* we create the if here, that way all blocks are ordered :)
1979 if (!ir_block_create_if(cond, condval,
1980 (ontrue ? ontrue : merge),
1981 (onfalse ? onfalse : merge)))
1986 /* Now enter the merge block */
1987 func->curblock = merge;
1992 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1994 ast_expression_codegen *cgen;
1997 ir_value *trueval, *falseval;
2000 ir_block *cond = func->curblock;
2005 /* Ternary can never create an lvalue... */
2009 /* In theory it shouldn't be possible to pass through a node twice, but
2010 * in case we add any kind of optimization pass for the AST itself, it
2011 * may still happen, thus we remember a created ir_value and simply return one
2012 * if it already exists.
2014 if (self->expression.outr) {
2015 *out = self->expression.outr;
2019 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2021 /* generate the condition */
2022 func->curblock = cond;
2023 cgen = self->cond->expression.codegen;
2024 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2027 /* create on-true block */
2028 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
2033 /* enter the block */
2034 func->curblock = ontrue;
2037 cgen = self->on_true->expression.codegen;
2038 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2042 /* create on-false block */
2043 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
2048 /* enter the block */
2049 func->curblock = onfalse;
2052 cgen = self->on_false->expression.codegen;
2053 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2057 /* create merge block */
2058 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
2061 /* jump to merge block */
2062 if (!ir_block_create_jump(ontrue, merge))
2064 if (!ir_block_create_jump(onfalse, merge))
2067 /* create if instruction */
2068 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
2071 /* Now enter the merge block */
2072 func->curblock = merge;
2074 /* Here, now, we need a PHI node
2075 * but first some sanity checking...
2077 if (trueval->vtype != falseval->vtype) {
2078 /* error("ternary with different types on the two sides"); */
2083 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
2086 ir_phi_add(phi, ontrue, trueval);
2087 ir_phi_add(phi, onfalse, falseval);
2089 self->expression.outr = ir_phi_value(phi);
2090 *out = self->expression.outr;
2095 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2097 ast_expression_codegen *cgen;
2099 ir_value *dummy = NULL;
2100 ir_value *precond = NULL;
2101 ir_value *postcond = NULL;
2103 /* Since we insert some jumps "late" so we have blocks
2104 * ordered "nicely", we need to keep track of the actual end-blocks
2105 * of expressions to add the jumps to.
2107 ir_block *bbody = NULL, *end_bbody = NULL;
2108 ir_block *bprecond = NULL, *end_bprecond = NULL;
2109 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2110 ir_block *bincrement = NULL, *end_bincrement = NULL;
2111 ir_block *bout = NULL, *bin = NULL;
2113 /* let's at least move the outgoing block to the end */
2116 /* 'break' and 'continue' need to be able to find the right blocks */
2117 ir_block *bcontinue = NULL;
2118 ir_block *bbreak = NULL;
2120 ir_block *old_bcontinue = NULL;
2121 ir_block *old_bbreak = NULL;
2123 ir_block *tmpblock = NULL;
2128 if (self->expression.outr) {
2129 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2132 self->expression.outr = (ir_value*)1;
2135 * Should we ever need some kind of block ordering, better make this function
2136 * move blocks around than write a block ordering algorithm later... after all
2137 * the ast and ir should work together, not against each other.
2140 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2141 * anyway if for example it contains a ternary.
2145 cgen = self->initexpr->expression.codegen;
2146 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2150 /* Store the block from which we enter this chaos */
2151 bin = func->curblock;
2153 /* The pre-loop condition needs its own block since we
2154 * need to be able to jump to the start of that expression.
2158 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
2162 /* the pre-loop-condition the least important place to 'continue' at */
2163 bcontinue = bprecond;
2166 func->curblock = bprecond;
2169 cgen = self->precond->expression.codegen;
2170 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2173 end_bprecond = func->curblock;
2175 bprecond = end_bprecond = NULL;
2178 /* Now the next blocks won't be ordered nicely, but we need to
2179 * generate them this early for 'break' and 'continue'.
2181 if (self->increment) {
2182 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
2185 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2187 bincrement = end_bincrement = NULL;
2190 if (self->postcond) {
2191 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
2194 bcontinue = bpostcond; /* postcond comes before the increment */
2196 bpostcond = end_bpostcond = NULL;
2199 bout_id = vec_size(func->ir_func->blocks);
2200 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
2205 /* The loop body... */
2208 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
2213 func->curblock = bbody;
2215 old_bbreak = func->breakblock;
2216 old_bcontinue = func->continueblock;
2217 func->breakblock = bbreak;
2218 func->continueblock = bcontinue;
2221 cgen = self->body->expression.codegen;
2222 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2225 end_bbody = func->curblock;
2226 func->breakblock = old_bbreak;
2227 func->continueblock = old_bcontinue;
2230 /* post-loop-condition */
2234 func->curblock = bpostcond;
2237 cgen = self->postcond->expression.codegen;
2238 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2241 end_bpostcond = func->curblock;
2244 /* The incrementor */
2245 if (self->increment)
2248 func->curblock = bincrement;
2251 cgen = self->increment->expression.codegen;
2252 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2255 end_bincrement = func->curblock;
2258 /* In any case now, we continue from the outgoing block */
2259 func->curblock = bout;
2261 /* Now all blocks are in place */
2262 /* From 'bin' we jump to whatever comes first */
2263 if (bprecond) tmpblock = bprecond;
2264 else if (bbody) tmpblock = bbody;
2265 else if (bpostcond) tmpblock = bpostcond;
2266 else tmpblock = bout;
2267 if (!ir_block_create_jump(bin, tmpblock))
2273 ir_block *ontrue, *onfalse;
2274 if (bbody) ontrue = bbody;
2275 else if (bincrement) ontrue = bincrement;
2276 else if (bpostcond) ontrue = bpostcond;
2277 else ontrue = bprecond;
2279 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
2286 if (bincrement) tmpblock = bincrement;
2287 else if (bpostcond) tmpblock = bpostcond;
2288 else if (bprecond) tmpblock = bprecond;
2289 else tmpblock = bout;
2290 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
2294 /* from increment */
2297 if (bpostcond) tmpblock = bpostcond;
2298 else if (bprecond) tmpblock = bprecond;
2299 else if (bbody) tmpblock = bbody;
2300 else tmpblock = bout;
2301 if (!ir_block_create_jump(end_bincrement, tmpblock))
2308 ir_block *ontrue, *onfalse;
2309 if (bprecond) ontrue = bprecond;
2310 else if (bbody) ontrue = bbody;
2311 else if (bincrement) ontrue = bincrement;
2312 else ontrue = bpostcond;
2314 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
2318 /* Move 'bout' to the end */
2319 vec_remove(func->ir_func->blocks, bout_id, 1);
2320 vec_push(func->ir_func->blocks, bout);
2325 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2330 asterror(ast_ctx(self), "break/continue expression is not an l-value");
2334 if (self->expression.outr) {
2335 asterror(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2338 self->expression.outr = (ir_value*)1;
2340 if (self->is_continue)
2341 target = func->continueblock;
2343 target = func->breakblock;
2345 if (!ir_block_create_jump(func->curblock, target))
2350 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2352 ast_expression_codegen *cgen;
2354 ast_switch_case *def_case = NULL;
2355 ir_block *def_bfall = NULL;
2357 ir_value *dummy = NULL;
2358 ir_value *irop = NULL;
2359 ir_block *old_break = NULL;
2360 ir_block *bout = NULL;
2361 ir_block *bfall = NULL;
2369 asterror(ast_ctx(self), "switch expression is not an l-value");
2373 if (self->expression.outr) {
2374 asterror(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2377 self->expression.outr = (ir_value*)1;
2382 cgen = self->operand->expression.codegen;
2383 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2386 if (!vec_size(self->cases))
2389 cmpinstr = type_eq_instr[irop->vtype];
2390 if (cmpinstr >= AINSTR_END) {
2391 ast_type_to_string(self->operand, typestr, sizeof(typestr));
2392 asterror(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2396 bout_id = vec_size(func->ir_func->blocks);
2397 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_switch"));
2401 /* setup the break block */
2402 old_break = func->breakblock;
2403 func->breakblock = bout;
2405 /* Now create all cases */
2406 for (c = 0; c < vec_size(self->cases); ++c) {
2407 ir_value *cond, *val;
2408 ir_block *bcase, *bnot;
2411 ast_switch_case *swcase = &self->cases[c];
2413 if (swcase->value) {
2414 /* A regular case */
2415 /* generate the condition operand */
2416 cgen = swcase->value->expression.codegen;
2417 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2419 /* generate the condition */
2420 cond = ir_block_create_binop(func->curblock, ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2424 bcase = ir_function_create_block(func->ir_func, ast_function_label(func, "case"));
2425 bnot_id = vec_size(func->ir_func->blocks);
2426 bnot = ir_function_create_block(func->ir_func, ast_function_label(func, "not_case"));
2427 if (!bcase || !bnot)
2429 if (!ir_block_create_if(func->curblock, cond, bcase, bnot))
2432 /* Make the previous case-end fall through */
2433 if (bfall && !bfall->final) {
2434 if (!ir_block_create_jump(bfall, bcase))
2438 /* enter the case */
2439 func->curblock = bcase;
2440 cgen = swcase->code->expression.codegen;
2441 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2444 /* remember this block to fall through from */
2445 bfall = func->curblock;
2447 /* enter the else and move it down */
2448 func->curblock = bnot;
2449 vec_remove(func->ir_func->blocks, bnot_id, 1);
2450 vec_push(func->ir_func->blocks, bnot);
2452 /* The default case */
2453 /* Remember where to fall through from: */
2456 /* remember which case it was */
2461 /* Jump from the last bnot to bout */
2462 if (bfall && !bfall->final && !ir_block_create_jump(bfall, bout)) {
2464 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2469 /* If there was a default case, put it down here */
2473 /* No need to create an extra block */
2474 bcase = func->curblock;
2476 /* Insert the fallthrough jump */
2477 if (def_bfall && !def_bfall->final) {
2478 if (!ir_block_create_jump(def_bfall, bcase))
2482 /* Now generate the default code */
2483 cgen = def_case->code->expression.codegen;
2484 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
2488 /* Jump from the last bnot to bout */
2489 if (!func->curblock->final && !ir_block_create_jump(func->curblock, bout))
2491 /* enter the outgoing block */
2492 func->curblock = bout;
2494 /* restore the break block */
2495 func->breakblock = old_break;
2497 /* Move 'bout' to the end, it's nicer */
2498 vec_remove(func->ir_func->blocks, bout_id, 1);
2499 vec_push(func->ir_func->blocks, bout);
2504 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2506 ast_expression_codegen *cgen;
2508 ir_instr *callinstr;
2511 ir_value *funval = NULL;
2513 /* return values are never lvalues */
2515 asterror(ast_ctx(self), "not an l-value (function call)");
2519 if (self->expression.outr) {
2520 *out = self->expression.outr;
2524 cgen = self->func->expression.codegen;
2525 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2533 for (i = 0; i < vec_size(self->params); ++i)
2536 ast_expression *expr = self->params[i];
2538 cgen = expr->expression.codegen;
2539 if (!(*cgen)(expr, func, false, ¶m))
2543 vec_push(params, param);
2546 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
2550 for (i = 0; i < vec_size(params); ++i) {
2551 ir_call_param(callinstr, params[i]);
2554 *out = ir_call_value(callinstr);
2555 self->expression.outr = *out;