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_call* ast_call_new(lex_ctx ctx,
704 ast_expression *funcexpr)
706 ast_instantiate(ast_call, ctx, ast_call_delete);
707 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
710 self->func = funcexpr;
712 self->expression.vtype = funcexpr->expression.next->expression.vtype;
713 if (funcexpr->expression.next->expression.next)
714 self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
719 void ast_call_delete(ast_call *self)
722 for (i = 0; i < vec_size(self->params); ++i)
723 ast_unref(self->params[i]);
724 vec_free(self->params);
727 ast_unref(self->func);
729 ast_expression_delete((ast_expression*)self);
733 bool ast_call_check_types(ast_call *self)
737 const ast_expression *func = self->func;
738 size_t count = vec_size(self->params);
739 if (count > vec_size(func->expression.params))
740 count = vec_size(func->expression.params);
742 for (i = 0; i < count; ++i) {
743 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
744 asterror(ast_ctx(self), "invalid type for parameter %u in function call",
745 (unsigned int)(i+1));
746 /* we don't immediately return */
753 ast_store* ast_store_new(lex_ctx ctx, int op,
754 ast_expression *dest, ast_expression *source)
756 ast_instantiate(ast_store, ctx, ast_store_delete);
757 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
761 self->source = source;
763 self->expression.vtype = dest->expression.vtype;
764 if (dest->expression.next) {
765 self->expression.next = ast_type_copy(ctx, dest);
766 if (!self->expression.next) {
772 self->expression.next = NULL;
777 void ast_store_delete(ast_store *self)
779 ast_unref(self->dest);
780 ast_unref(self->source);
781 ast_expression_delete((ast_expression*)self);
785 ast_block* ast_block_new(lex_ctx ctx)
787 ast_instantiate(ast_block, ctx, ast_block_delete);
788 ast_expression_init((ast_expression*)self,
789 (ast_expression_codegen*)&ast_block_codegen);
793 self->collect = NULL;
798 void ast_block_collect(ast_block *self, ast_expression *expr)
800 vec_push(self->collect, expr);
801 expr->expression.node.keep = true;
804 void ast_block_delete(ast_block *self)
807 for (i = 0; i < vec_size(self->exprs); ++i)
808 ast_unref(self->exprs[i]);
809 vec_free(self->exprs);
810 for (i = 0; i < vec_size(self->locals); ++i)
811 ast_delete(self->locals[i]);
812 vec_free(self->locals);
813 for (i = 0; i < vec_size(self->collect); ++i)
814 ast_delete(self->collect[i]);
815 vec_free(self->collect);
816 ast_expression_delete((ast_expression*)self);
820 bool ast_block_set_type(ast_block *self, ast_expression *from)
822 if (self->expression.next)
823 ast_delete(self->expression.next);
824 self->expression.vtype = from->expression.vtype;
825 if (from->expression.next) {
826 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
827 if (!self->expression.next)
831 self->expression.next = NULL;
835 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
837 ast_instantiate(ast_function, ctx, ast_function_delete);
841 vtype->expression.vtype != TYPE_FUNCTION)
848 self->name = name ? util_strdup(name) : NULL;
851 self->labelcount = 0;
854 self->ir_func = NULL;
855 self->curblock = NULL;
857 self->breakblock = NULL;
858 self->continueblock = NULL;
860 vtype->isconst = true;
861 vtype->constval.vfunc = self;
866 void ast_function_delete(ast_function *self)
870 mem_d((void*)self->name);
872 /* ast_value_delete(self->vtype); */
873 self->vtype->isconst = false;
874 self->vtype->constval.vfunc = NULL;
875 /* We use unref - if it was stored in a global table it is supposed
876 * to be deleted from *there*
878 ast_unref(self->vtype);
880 for (i = 0; i < vec_size(self->blocks); ++i)
881 ast_delete(self->blocks[i]);
882 vec_free(self->blocks);
886 const char* ast_function_label(ast_function *self, const char *prefix)
895 id = (self->labelcount++);
896 len = strlen(prefix);
898 from = self->labelbuf + sizeof(self->labelbuf)-1;
901 unsigned int digit = id % 10;
905 memcpy(from - len, prefix, len);
909 /*********************************************************************/
911 * by convention you must never pass NULL to the 'ir_value **out'
912 * parameter. If you really don't care about the output, pass a dummy.
913 * But I can't imagine a pituation where the output is truly unnecessary.
916 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
918 /* NOTE: This is the codegen for a variable used in an expression.
919 * It is not the codegen to generate the value. For this purpose,
920 * ast_local_codegen and ast_global_codegen are to be used before this
921 * is executed. ast_function_codegen should take care of its locals,
922 * and the ast-user should take care of ast_global_codegen to be used
923 * on all the globals.
927 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
928 asterror(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
935 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
939 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
941 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
944 func->context = ast_ctx(self);
945 func->value->context = ast_ctx(self);
947 self->constval.vfunc->ir_func = func;
948 self->ir_v = func->value;
949 /* The function is filled later on ast_function_codegen... */
953 if (isfield && self->expression.vtype == TYPE_FIELD) {
954 ast_expression *fieldtype = self->expression.next;
957 asterror(ast_ctx(self), "TODO: constant field pointers with value");
961 if (fieldtype->expression.vtype == TYPE_ARRAY) {
966 ast_expression_common *elemtype;
968 ast_value *array = (ast_value*)fieldtype;
970 if (!ast_istype(fieldtype, ast_value)) {
971 asterror(ast_ctx(self), "internal error: ast_value required");
975 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
976 if (!array->expression.count || array->expression.count > opts_max_array_size)
977 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
979 elemtype = &array->expression.next->expression;
980 vtype = elemtype->vtype;
982 v = ir_builder_create_field(ir, self->name, vtype);
984 asterror(ast_ctx(self), "ir_builder_create_global failed");
987 if (vtype == TYPE_FIELD)
988 v->fieldtype = elemtype->next->expression.vtype;
989 v->context = ast_ctx(self);
990 array->ir_v = self->ir_v = v;
992 namelen = strlen(self->name);
993 name = (char*)mem_a(namelen + 16);
994 strcpy(name, self->name);
996 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
997 array->ir_values[0] = v;
998 for (ai = 1; ai < array->expression.count; ++ai) {
999 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1000 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1001 if (!array->ir_values[ai]) {
1003 asterror(ast_ctx(self), "ir_builder_create_global failed");
1006 if (vtype == TYPE_FIELD)
1007 array->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1008 array->ir_values[ai]->context = ast_ctx(self);
1014 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1017 v->context = ast_ctx(self);
1023 if (self->expression.vtype == TYPE_ARRAY) {
1028 ast_expression_common *elemtype = &self->expression.next->expression;
1029 int vtype = elemtype->vtype;
1031 /* same as with field arrays */
1032 if (!self->expression.count || self->expression.count > opts_max_array_size)
1033 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1035 v = ir_builder_create_global(ir, self->name, vtype);
1037 asterror(ast_ctx(self), "ir_builder_create_global failed");
1040 if (vtype == TYPE_FIELD)
1041 v->fieldtype = elemtype->next->expression.vtype;
1042 v->context = ast_ctx(self);
1044 namelen = strlen(self->name);
1045 name = (char*)mem_a(namelen + 16);
1046 strcpy(name, self->name);
1048 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1049 self->ir_values[0] = v;
1050 for (ai = 1; ai < self->expression.count; ++ai) {
1051 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1052 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1053 if (!self->ir_values[ai]) {
1055 asterror(ast_ctx(self), "ir_builder_create_global failed");
1058 if (vtype == TYPE_FIELD)
1059 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1060 self->ir_values[ai]->context = ast_ctx(self);
1066 /* Arrays don't do this since there's no "array" value which spans across the
1069 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1071 asterror(ast_ctx(self), "ir_builder_create_global failed");
1074 if (self->expression.vtype == TYPE_FIELD)
1075 v->fieldtype = self->expression.next->expression.vtype;
1076 v->context = ast_ctx(self);
1079 if (self->isconst) {
1080 switch (self->expression.vtype)
1083 if (!ir_value_set_float(v, self->constval.vfloat))
1087 if (!ir_value_set_vector(v, self->constval.vvec))
1091 if (!ir_value_set_string(v, self->constval.vstring))
1095 asterror(ast_ctx(self), "TODO: global constant array");
1098 asterror(ast_ctx(self), "global of type function not properly generated");
1100 /* Cannot generate an IR value for a function,
1101 * need a pointer pointing to a function rather.
1104 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1109 /* link us to the ir_value */
1113 error: /* clean up */
1118 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1121 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
1123 /* Do we allow local functions? I think not...
1124 * this is NOT a function pointer atm.
1129 if (self->expression.vtype == TYPE_ARRAY) {
1134 ast_expression_common *elemtype = &self->expression.next->expression;
1135 int vtype = elemtype->vtype;
1138 asterror(ast_ctx(self), "array-parameters are not supported");
1142 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1143 if (!self->expression.count || self->expression.count > opts_max_array_size) {
1144 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1147 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1148 if (!self->ir_values) {
1149 asterror(ast_ctx(self), "failed to allocate array values");
1153 v = ir_function_create_local(func, self->name, vtype, param);
1155 asterror(ast_ctx(self), "ir_function_create_local failed");
1158 if (vtype == TYPE_FIELD)
1159 v->fieldtype = elemtype->next->expression.vtype;
1160 v->context = ast_ctx(self);
1162 namelen = strlen(self->name);
1163 name = (char*)mem_a(namelen + 16);
1164 strcpy(name, self->name);
1166 self->ir_values[0] = v;
1167 for (ai = 1; ai < self->expression.count; ++ai) {
1168 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1169 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1170 if (!self->ir_values[ai]) {
1171 asterror(ast_ctx(self), "ir_builder_create_global failed");
1174 if (vtype == TYPE_FIELD)
1175 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1176 self->ir_values[ai]->context = ast_ctx(self);
1181 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1184 if (self->expression.vtype == TYPE_FIELD)
1185 v->fieldtype = self->expression.next->expression.vtype;
1186 v->context = ast_ctx(self);
1189 /* A constant local... hmmm...
1190 * I suppose the IR will have to deal with this
1192 if (self->isconst) {
1193 switch (self->expression.vtype)
1196 if (!ir_value_set_float(v, self->constval.vfloat))
1200 if (!ir_value_set_vector(v, self->constval.vvec))
1204 if (!ir_value_set_string(v, self->constval.vstring))
1208 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1213 /* link us to the ir_value */
1217 if (!ast_global_codegen(self->setter, func->owner, false) ||
1218 !ast_function_codegen(self->setter->constval.vfunc, func->owner) ||
1219 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1223 if (!ast_global_codegen(self->getter, func->owner, false) ||
1224 !ast_function_codegen(self->getter->constval.vfunc, func->owner) ||
1225 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1230 error: /* clean up */
1235 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1239 ast_expression_common *ec;
1242 irf = self->ir_func;
1244 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1248 /* fill the parameter list */
1249 ec = &self->vtype->expression;
1250 for (i = 0; i < vec_size(ec->params); ++i)
1252 vec_push(irf->params, ec->params[i]->expression.vtype);
1253 if (!self->builtin) {
1254 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1259 if (self->builtin) {
1260 irf->builtin = self->builtin;
1264 if (!vec_size(self->blocks)) {
1265 asterror(ast_ctx(self), "function `%s` has no body", self->name);
1269 self->curblock = ir_function_create_block(irf, "entry");
1270 if (!self->curblock) {
1271 asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1275 for (i = 0; i < vec_size(self->blocks); ++i) {
1276 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1277 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1281 /* TODO: check return types */
1282 if (!self->curblock->is_return)
1284 return ir_block_create_return(self->curblock, NULL);
1285 /* From now on the parser has to handle this situation */
1287 if (!self->vtype->expression.next ||
1288 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1290 return ir_block_create_return(self->curblock, NULL);
1294 /* error("missing return"); */
1295 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
1303 /* Note, you will not see ast_block_codegen generate ir_blocks.
1304 * To the AST and the IR, blocks are 2 different things.
1305 * In the AST it represents a block of code, usually enclosed in
1306 * curly braces {...}.
1307 * While in the IR it represents a block in terms of control-flow.
1309 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1313 /* We don't use this
1314 * Note: an ast-representation using the comma-operator
1315 * of the form: (a, b, c) = x should not assign to c...
1318 asterror(ast_ctx(self), "not an l-value (code-block)");
1322 if (self->expression.outr) {
1323 *out = self->expression.outr;
1327 /* output is NULL at first, we'll have each expression
1328 * assign to out output, thus, a comma-operator represention
1329 * using an ast_block will return the last generated value,
1330 * so: (b, c) + a executed both b and c, and returns c,
1331 * which is then added to a.
1335 /* generate locals */
1336 for (i = 0; i < vec_size(self->locals); ++i)
1338 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1340 asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1345 for (i = 0; i < vec_size(self->exprs); ++i)
1347 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1348 if (!(*gen)(self->exprs[i], func, false, out))
1352 self->expression.outr = *out;
1357 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1359 ast_expression_codegen *cgen;
1360 ir_value *left, *right;
1364 ast_array_index *ai = NULL;
1366 if (lvalue && self->expression.outl) {
1367 *out = self->expression.outl;
1371 if (!lvalue && self->expression.outr) {
1372 *out = self->expression.outr;
1376 if (ast_istype(self->dest, ast_array_index))
1379 ai = (ast_array_index*)self->dest;
1380 idx = (ast_value*)ai->index;
1382 if (ast_istype(ai->index, ast_value) && idx->isconst)
1387 /* we need to call the setter */
1388 ir_value *iridx, *funval;
1392 asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1396 arr = (ast_value*)ai->array;
1397 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1398 asterror(ast_ctx(self), "value has no setter (%s)", arr->name);
1402 cgen = idx->expression.codegen;
1403 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1406 cgen = arr->setter->expression.codegen;
1407 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1410 cgen = self->source->expression.codegen;
1411 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1414 call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval);
1417 ir_call_param(call, iridx);
1418 ir_call_param(call, right);
1419 self->expression.outr = right;
1425 cgen = self->dest->expression.codegen;
1427 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1429 self->expression.outl = left;
1431 cgen = self->source->expression.codegen;
1433 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1436 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1438 self->expression.outr = right;
1441 /* Theoretically, an assinment returns its left side as an
1442 * lvalue, if we don't need an lvalue though, we return
1443 * the right side as an rvalue, otherwise we have to
1444 * somehow know whether or not we need to dereference the pointer
1445 * on the left side - that is: OP_LOAD if it was an address.
1446 * Also: in original QC we cannot OP_LOADP *anyway*.
1448 *out = (lvalue ? left : right);
1453 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1455 ast_expression_codegen *cgen;
1456 ir_value *left, *right;
1458 /* A binary operation cannot yield an l-value */
1460 asterror(ast_ctx(self), "not an l-value (binop)");
1464 if (self->expression.outr) {
1465 *out = self->expression.outr;
1469 cgen = self->left->expression.codegen;
1471 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1474 cgen = self->right->expression.codegen;
1476 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1479 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1480 self->op, left, right);
1483 self->expression.outr = *out;
1488 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1490 ast_expression_codegen *cgen;
1491 ir_value *leftl, *leftr, *right, *bin;
1493 if (lvalue && self->expression.outl) {
1494 *out = self->expression.outl;
1498 if (!lvalue && self->expression.outr) {
1499 *out = self->expression.outr;
1503 /* for a binstore we need both an lvalue and an rvalue for the left side */
1504 /* rvalue of destination! */
1505 cgen = self->dest->expression.codegen;
1506 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1509 /* source as rvalue only */
1510 cgen = self->source->expression.codegen;
1511 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1514 /* now the binary */
1515 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1516 self->opbin, leftr, right);
1517 self->expression.outr = bin;
1519 /* now store them */
1520 cgen = self->dest->expression.codegen;
1521 /* lvalue of destination */
1522 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1524 self->expression.outl = leftl;
1526 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1528 self->expression.outr = bin;
1530 /* Theoretically, an assinment returns its left side as an
1531 * lvalue, if we don't need an lvalue though, we return
1532 * the right side as an rvalue, otherwise we have to
1533 * somehow know whether or not we need to dereference the pointer
1534 * on the left side - that is: OP_LOAD if it was an address.
1535 * Also: in original QC we cannot OP_LOADP *anyway*.
1537 *out = (lvalue ? leftl : bin);
1542 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1544 ast_expression_codegen *cgen;
1547 /* An unary operation cannot yield an l-value */
1549 asterror(ast_ctx(self), "not an l-value (binop)");
1553 if (self->expression.outr) {
1554 *out = self->expression.outr;
1558 cgen = self->operand->expression.codegen;
1560 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1563 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1567 self->expression.outr = *out;
1572 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1574 ast_expression_codegen *cgen;
1577 /* In the context of a return operation, we don't actually return
1581 asterror(ast_ctx(self), "return-expression is not an l-value");
1585 if (self->expression.outr) {
1586 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1589 self->expression.outr = (ir_value*)1;
1591 if (self->operand) {
1592 cgen = self->operand->expression.codegen;
1594 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1597 if (!ir_block_create_return(func->curblock, operand))
1600 if (!ir_block_create_return(func->curblock, NULL))
1607 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1609 ast_expression_codegen *cgen;
1610 ir_value *ent, *field;
1612 /* This function needs to take the 'lvalue' flag into account!
1613 * As lvalue we provide a field-pointer, as rvalue we provide the
1617 if (lvalue && self->expression.outl) {
1618 *out = self->expression.outl;
1622 if (!lvalue && self->expression.outr) {
1623 *out = self->expression.outr;
1627 cgen = self->entity->expression.codegen;
1628 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1631 cgen = self->field->expression.codegen;
1632 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1637 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1640 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1641 ent, field, self->expression.vtype);
1644 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1645 (lvalue ? "ADDRESS" : "FIELD"),
1646 type_name[self->expression.vtype]);
1651 self->expression.outl = *out;
1653 self->expression.outr = *out;
1655 /* Hm that should be it... */
1659 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1661 ast_expression_codegen *cgen;
1664 /* in QC this is always an lvalue */
1666 if (self->expression.outl) {
1667 *out = self->expression.outl;
1671 cgen = self->owner->expression.codegen;
1672 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1675 if (vec->vtype != TYPE_VECTOR &&
1676 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1681 *out = ir_value_vector_member(vec, self->field);
1682 self->expression.outl = *out;
1684 return (*out != NULL);
1687 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
1692 if (!lvalue && self->expression.outr) {
1693 *out = self->expression.outr;
1695 if (lvalue && self->expression.outl) {
1696 *out = self->expression.outl;
1699 if (!ast_istype(self->array, ast_value)) {
1700 asterror(ast_ctx(self), "array indexing this way is not supported");
1701 /* note this would actually be pointer indexing because the left side is
1702 * not an actual array but (hopefully) an indexable expression.
1703 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
1704 * support this path will be filled.
1709 arr = (ast_value*)self->array;
1710 idx = (ast_value*)self->index;
1712 if (!ast_istype(self->index, ast_value) || !idx->isconst) {
1713 /* Time to use accessor functions */
1714 ast_expression_codegen *cgen;
1715 ir_value *iridx, *funval;
1719 asterror(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
1724 asterror(ast_ctx(self), "value has no getter, don't know how to index it");
1728 cgen = self->index->expression.codegen;
1729 if (!(*cgen)((ast_expression*)(self->index), func, true, &iridx))
1732 cgen = arr->getter->expression.codegen;
1733 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
1736 call = ir_block_create_call(func->curblock, ast_function_label(func, "fetch"), funval);
1739 ir_call_param(call, iridx);
1741 *out = ir_call_value(call);
1742 self->expression.outr = *out;
1746 if (idx->expression.vtype == TYPE_FLOAT)
1747 *out = arr->ir_values[(int)idx->constval.vfloat];
1748 else if (idx->expression.vtype == TYPE_INTEGER)
1749 *out = arr->ir_values[idx->constval.vint];
1751 asterror(ast_ctx(self), "array indexing here needs an integer constant");
1757 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1759 ast_expression_codegen *cgen;
1764 ir_block *cond = func->curblock;
1767 ir_block *ontrue_endblock = NULL;
1768 ir_block *onfalse_endblock = NULL;
1771 /* We don't output any value, thus also don't care about r/lvalue */
1775 if (self->expression.outr) {
1776 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
1779 self->expression.outr = (ir_value*)1;
1781 /* generate the condition */
1782 func->curblock = cond;
1783 cgen = self->cond->expression.codegen;
1784 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1789 if (self->on_true) {
1790 /* create on-true block */
1791 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1795 /* enter the block */
1796 func->curblock = ontrue;
1799 cgen = self->on_true->expression.codegen;
1800 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1803 /* we now need to work from the current endpoint */
1804 ontrue_endblock = func->curblock;
1809 if (self->on_false) {
1810 /* create on-false block */
1811 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1815 /* enter the block */
1816 func->curblock = onfalse;
1819 cgen = self->on_false->expression.codegen;
1820 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1823 /* we now need to work from the current endpoint */
1824 onfalse_endblock = func->curblock;
1828 /* Merge block were they all merge in to */
1829 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1833 /* add jumps ot the merge block */
1834 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
1836 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
1839 /* we create the if here, that way all blocks are ordered :)
1841 if (!ir_block_create_if(cond, condval,
1842 (ontrue ? ontrue : merge),
1843 (onfalse ? onfalse : merge)))
1848 /* Now enter the merge block */
1849 func->curblock = merge;
1854 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1856 ast_expression_codegen *cgen;
1859 ir_value *trueval, *falseval;
1862 ir_block *cond = func->curblock;
1867 /* Ternary can never create an lvalue... */
1871 /* In theory it shouldn't be possible to pass through a node twice, but
1872 * in case we add any kind of optimization pass for the AST itself, it
1873 * may still happen, thus we remember a created ir_value and simply return one
1874 * if it already exists.
1876 if (self->phi_out) {
1877 *out = self->phi_out;
1881 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1883 /* generate the condition */
1884 func->curblock = cond;
1885 cgen = self->cond->expression.codegen;
1886 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1889 /* create on-true block */
1890 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1895 /* enter the block */
1896 func->curblock = ontrue;
1899 cgen = self->on_true->expression.codegen;
1900 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1904 /* create on-false block */
1905 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1910 /* enter the block */
1911 func->curblock = onfalse;
1914 cgen = self->on_false->expression.codegen;
1915 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1919 /* create merge block */
1920 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1923 /* jump to merge block */
1924 if (!ir_block_create_jump(ontrue, merge))
1926 if (!ir_block_create_jump(onfalse, merge))
1929 /* create if instruction */
1930 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1933 /* Now enter the merge block */
1934 func->curblock = merge;
1936 /* Here, now, we need a PHI node
1937 * but first some sanity checking...
1939 if (trueval->vtype != falseval->vtype) {
1940 /* error("ternary with different types on the two sides"); */
1945 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1948 ir_phi_add(phi, ontrue, trueval);
1949 ir_phi_add(phi, onfalse, falseval);
1951 self->phi_out = ir_phi_value(phi);
1952 *out = self->phi_out;
1957 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1959 ast_expression_codegen *cgen;
1961 ir_value *dummy = NULL;
1962 ir_value *precond = NULL;
1963 ir_value *postcond = NULL;
1965 /* Since we insert some jumps "late" so we have blocks
1966 * ordered "nicely", we need to keep track of the actual end-blocks
1967 * of expressions to add the jumps to.
1969 ir_block *bbody = NULL, *end_bbody = NULL;
1970 ir_block *bprecond = NULL, *end_bprecond = NULL;
1971 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1972 ir_block *bincrement = NULL, *end_bincrement = NULL;
1973 ir_block *bout = NULL, *bin = NULL;
1975 /* let's at least move the outgoing block to the end */
1978 /* 'break' and 'continue' need to be able to find the right blocks */
1979 ir_block *bcontinue = NULL;
1980 ir_block *bbreak = NULL;
1982 ir_block *old_bcontinue = NULL;
1983 ir_block *old_bbreak = NULL;
1985 ir_block *tmpblock = NULL;
1990 if (self->expression.outr) {
1991 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
1994 self->expression.outr = (ir_value*)1;
1997 * Should we ever need some kind of block ordering, better make this function
1998 * move blocks around than write a block ordering algorithm later... after all
1999 * the ast and ir should work together, not against each other.
2002 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2003 * anyway if for example it contains a ternary.
2007 cgen = self->initexpr->expression.codegen;
2008 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2012 /* Store the block from which we enter this chaos */
2013 bin = func->curblock;
2015 /* The pre-loop condition needs its own block since we
2016 * need to be able to jump to the start of that expression.
2020 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
2024 /* the pre-loop-condition the least important place to 'continue' at */
2025 bcontinue = bprecond;
2028 func->curblock = bprecond;
2031 cgen = self->precond->expression.codegen;
2032 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2035 end_bprecond = func->curblock;
2037 bprecond = end_bprecond = NULL;
2040 /* Now the next blocks won't be ordered nicely, but we need to
2041 * generate them this early for 'break' and 'continue'.
2043 if (self->increment) {
2044 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
2047 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2049 bincrement = end_bincrement = NULL;
2052 if (self->postcond) {
2053 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
2056 bcontinue = bpostcond; /* postcond comes before the increment */
2058 bpostcond = end_bpostcond = NULL;
2061 bout_id = vec_size(func->ir_func->blocks);
2062 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
2067 /* The loop body... */
2070 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
2075 func->curblock = bbody;
2077 old_bbreak = func->breakblock;
2078 old_bcontinue = func->continueblock;
2079 func->breakblock = bbreak;
2080 func->continueblock = bcontinue;
2083 cgen = self->body->expression.codegen;
2084 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2087 end_bbody = func->curblock;
2088 func->breakblock = old_bbreak;
2089 func->continueblock = old_bcontinue;
2092 /* post-loop-condition */
2096 func->curblock = bpostcond;
2099 cgen = self->postcond->expression.codegen;
2100 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2103 end_bpostcond = func->curblock;
2106 /* The incrementor */
2107 if (self->increment)
2110 func->curblock = bincrement;
2113 cgen = self->increment->expression.codegen;
2114 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2117 end_bincrement = func->curblock;
2120 /* In any case now, we continue from the outgoing block */
2121 func->curblock = bout;
2123 /* Now all blocks are in place */
2124 /* From 'bin' we jump to whatever comes first */
2125 if (bprecond) tmpblock = bprecond;
2126 else if (bbody) tmpblock = bbody;
2127 else if (bpostcond) tmpblock = bpostcond;
2128 else tmpblock = bout;
2129 if (!ir_block_create_jump(bin, tmpblock))
2135 ir_block *ontrue, *onfalse;
2136 if (bbody) ontrue = bbody;
2137 else if (bincrement) ontrue = bincrement;
2138 else if (bpostcond) ontrue = bpostcond;
2139 else ontrue = bprecond;
2141 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
2148 if (bincrement) tmpblock = bincrement;
2149 else if (bpostcond) tmpblock = bpostcond;
2150 else if (bprecond) tmpblock = bprecond;
2151 else tmpblock = bout;
2152 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
2156 /* from increment */
2159 if (bpostcond) tmpblock = bpostcond;
2160 else if (bprecond) tmpblock = bprecond;
2161 else if (bbody) tmpblock = bbody;
2162 else tmpblock = bout;
2163 if (!ir_block_create_jump(end_bincrement, tmpblock))
2170 ir_block *ontrue, *onfalse;
2171 if (bprecond) ontrue = bprecond;
2172 else if (bbody) ontrue = bbody;
2173 else if (bincrement) ontrue = bincrement;
2174 else ontrue = bpostcond;
2176 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
2180 /* Move 'bout' to the end */
2181 vec_remove(func->ir_func->blocks, bout_id, 1);
2182 vec_push(func->ir_func->blocks, bout);
2187 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2189 ast_expression_codegen *cgen;
2191 ir_instr *callinstr;
2194 ir_value *funval = NULL;
2196 /* return values are never lvalues */
2198 asterror(ast_ctx(self), "not an l-value (function call)");
2202 if (self->expression.outr) {
2203 *out = self->expression.outr;
2207 cgen = self->func->expression.codegen;
2208 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2216 for (i = 0; i < vec_size(self->params); ++i)
2219 ast_expression *expr = self->params[i];
2221 cgen = expr->expression.codegen;
2222 if (!(*cgen)(expr, func, false, ¶m))
2226 vec_push(params, param);
2229 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
2233 for (i = 0; i < vec_size(params); ++i) {
2234 ir_call_param(callinstr, params[i]);
2237 *out = ir_call_value(callinstr);
2238 self->expression.outr = *out;