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 cvprintmsg(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 fprintf(stderr, "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 MEM_VECTOR_INIT(&self->expression, params);
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 < self->expression.params_count; ++i) {
82 ast_delete(self->expression.params[i]);
84 MEM_VECTOR_CLEAR(&self->expression, params);
87 static void ast_expression_delete_full(ast_expression *self)
89 ast_expression_delete(self);
93 MEM_VEC_FUNCTIONS(ast_expression_common, ast_value*, params)
95 ast_value* ast_value_copy(const ast_value *self)
98 const ast_expression_common *fromex;
99 ast_expression_common *selfex;
100 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
101 if (self->expression.next) {
102 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
103 if (!cp->expression.next) {
104 ast_value_delete(cp);
108 fromex = &self->expression;
109 selfex = &cp->expression;
110 selfex->variadic = fromex->variadic;
111 for (i = 0; i < fromex->params_count; ++i) {
112 ast_value *v = ast_value_copy(fromex->params[i]);
113 if (!v || !ast_expression_common_params_add(selfex, v)) {
114 ast_value_delete(cp);
121 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
124 const ast_expression_common *fromex;
125 ast_expression_common *selfex;
126 self->expression.vtype = other->expression.vtype;
127 if (other->expression.next) {
128 self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
129 if (!self->expression.next)
132 fromex = &other->expression;
133 selfex = &self->expression;
134 selfex->variadic = fromex->variadic;
135 for (i = 0; i < fromex->params_count; ++i) {
136 ast_value *v = ast_value_copy(fromex->params[i]);
137 if (!v || !ast_expression_common_params_add(selfex, 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 < fromex->params_count; ++i) {
186 ast_value *v = ast_value_copy(fromex->params[i]);
187 if (!v || !ast_expression_common_params_add(selfex, v)) {
188 ast_expression_delete_full(self);
197 bool ast_compare_type(ast_expression *a, ast_expression *b)
199 if (a->expression.vtype != b->expression.vtype)
201 if (!a->expression.next != !b->expression.next)
203 if (a->expression.params_count != b->expression.params_count)
205 if (a->expression.variadic != b->expression.variadic)
207 if (a->expression.params_count) {
209 for (i = 0; i < a->expression.params_count; ++i) {
210 if (!ast_compare_type((ast_expression*)a->expression.params[i],
211 (ast_expression*)b->expression.params[i]))
215 if (a->expression.next)
216 return ast_compare_type(a->expression.next, b->expression.next);
220 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
227 if (pos + 6 >= bufsize)
229 strcpy(buf + pos, "(null)");
233 if (pos + 1 >= bufsize)
236 switch (e->expression.vtype) {
238 strcpy(buf + pos, "(variant)");
243 return ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
246 if (pos + 3 >= bufsize)
250 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
251 if (pos + 1 >= bufsize)
257 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
258 if (pos + 2 >= bufsize)
260 if (e->expression.params_count == 0) {
266 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[0]), buf, bufsize, pos);
267 for (i = 1; i < e->expression.params_count; ++i) {
268 if (pos + 2 >= bufsize)
272 pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[i]), buf, bufsize, pos);
274 if (pos + 1 >= bufsize)
280 pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
281 if (pos + 1 >= bufsize)
284 pos += snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->expression.count);
285 if (pos + 1 >= bufsize)
291 typestr = type_name[e->expression.vtype];
292 typelen = strlen(typestr);
293 if (pos + typelen >= bufsize)
295 strcpy(buf + pos, typestr);
296 return pos + typelen;
300 buf[bufsize-3] = '.';
301 buf[bufsize-2] = '.';
302 buf[bufsize-1] = '.';
306 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
308 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
312 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
314 ast_instantiate(ast_value, ctx, ast_value_delete);
315 ast_expression_init((ast_expression*)self,
316 (ast_expression_codegen*)&ast_value_codegen);
317 self->expression.node.keep = true; /* keep */
319 self->name = name ? util_strdup(name) : NULL;
320 self->expression.vtype = t;
321 self->expression.next = NULL;
322 self->isconst = false;
324 memset(&self->constval, 0, sizeof(self->constval));
327 self->ir_values = NULL;
328 self->ir_value_count = 0;
336 void ast_value_delete(ast_value* self)
339 mem_d((void*)self->name);
341 switch (self->expression.vtype)
344 mem_d((void*)self->constval.vstring);
347 /* unlink us from the function node */
348 self->constval.vfunc->vtype = NULL;
350 /* NOTE: delete function? currently collected in
351 * the parser structure
358 mem_d(self->ir_values);
359 ast_expression_delete((ast_expression*)self);
363 bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
365 return ast_expression_common_params_add(&self->expression, p);
368 bool ast_value_set_name(ast_value *self, const char *name)
371 mem_d((void*)self->name);
372 self->name = util_strdup(name);
376 ast_binary* ast_binary_new(lex_ctx ctx, int op,
377 ast_expression* left, ast_expression* right)
379 ast_instantiate(ast_binary, ctx, ast_binary_delete);
380 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
386 if (op >= INSTR_EQ_F && op <= INSTR_GT)
387 self->expression.vtype = TYPE_FLOAT;
388 else if (op == INSTR_AND || op == INSTR_OR ||
389 op == INSTR_BITAND || op == INSTR_BITOR)
390 self->expression.vtype = TYPE_FLOAT;
391 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
392 self->expression.vtype = TYPE_VECTOR;
393 else if (op == INSTR_MUL_V)
394 self->expression.vtype = TYPE_FLOAT;
396 self->expression.vtype = left->expression.vtype;
401 void ast_binary_delete(ast_binary *self)
403 ast_unref(self->left);
404 ast_unref(self->right);
405 ast_expression_delete((ast_expression*)self);
409 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
410 ast_expression* left, ast_expression* right)
412 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
413 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
415 self->opstore = storop;
418 self->source = right;
420 self->expression.vtype = left->expression.vtype;
421 if (left->expression.next) {
422 self->expression.next = ast_type_copy(ctx, left);
423 if (!self->expression.next) {
429 self->expression.next = NULL;
434 void ast_binstore_delete(ast_binstore *self)
436 ast_unref(self->dest);
437 ast_unref(self->source);
438 ast_expression_delete((ast_expression*)self);
442 ast_unary* ast_unary_new(lex_ctx ctx, int op,
443 ast_expression *expr)
445 ast_instantiate(ast_unary, ctx, ast_unary_delete);
446 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
449 self->operand = expr;
451 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
452 self->expression.vtype = TYPE_FLOAT;
454 asterror(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
459 void ast_unary_delete(ast_unary *self)
461 ast_unref(self->operand);
462 ast_expression_delete((ast_expression*)self);
466 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
468 ast_instantiate(ast_return, ctx, ast_return_delete);
469 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
471 self->operand = expr;
476 void ast_return_delete(ast_return *self)
479 ast_unref(self->operand);
480 ast_expression_delete((ast_expression*)self);
484 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
486 if (field->expression.vtype != TYPE_FIELD) {
487 asterror(ctx, "ast_entfield_new with expression not of type field");
490 return ast_entfield_new_force(ctx, entity, field, field->expression.next);
493 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
495 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
499 /* Error: field has no type... */
503 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
505 self->entity = entity;
508 if (!ast_type_adopt(self, outtype)) {
509 ast_entfield_delete(self);
516 void ast_entfield_delete(ast_entfield *self)
518 ast_unref(self->entity);
519 ast_unref(self->field);
520 ast_expression_delete((ast_expression*)self);
524 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
526 ast_instantiate(ast_member, ctx, ast_member_delete);
532 if (owner->expression.vtype != TYPE_VECTOR &&
533 owner->expression.vtype != TYPE_FIELD) {
534 asterror(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
539 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
540 self->expression.node.keep = true; /* keep */
542 if (owner->expression.vtype == TYPE_VECTOR) {
543 self->expression.vtype = TYPE_FLOAT;
544 self->expression.next = NULL;
546 self->expression.vtype = TYPE_FIELD;
547 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
556 void ast_member_delete(ast_member *self)
558 /* The owner is always an ast_value, which has .keep=true,
559 * also: ast_members are usually deleted after the owner, thus
560 * this will cause invalid access
561 ast_unref(self->owner);
562 * once we allow (expression).x to access a vector-member, we need
563 * to change this: preferably by creating an alternate ast node for this
564 * purpose that is not garbage-collected.
566 ast_expression_delete((ast_expression*)self);
570 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
572 ast_expression *outtype;
573 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
575 outtype = array->expression.next;
578 /* Error: field has no type... */
582 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
587 if (!ast_type_adopt(self, outtype)) {
588 ast_array_index_delete(self);
591 if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) {
592 if (self->expression.vtype != TYPE_ARRAY) {
593 asterror(ast_ctx(self), "array_index node on type");
594 ast_array_index_delete(self);
597 self->array = outtype;
598 self->expression.vtype = TYPE_FIELD;
604 void ast_array_index_delete(ast_array_index *self)
606 ast_unref(self->array);
607 ast_unref(self->index);
608 ast_expression_delete((ast_expression*)self);
612 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
614 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
615 if (!ontrue && !onfalse) {
616 /* because it is invalid */
620 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
623 self->on_true = ontrue;
624 self->on_false = onfalse;
629 void ast_ifthen_delete(ast_ifthen *self)
631 ast_unref(self->cond);
633 ast_unref(self->on_true);
635 ast_unref(self->on_false);
636 ast_expression_delete((ast_expression*)self);
640 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
642 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
643 /* This time NEITHER must be NULL */
644 if (!ontrue || !onfalse) {
648 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
651 self->on_true = ontrue;
652 self->on_false = onfalse;
653 self->phi_out = NULL;
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_call* ast_call_new(lex_ctx ctx,
703 ast_expression *funcexpr)
705 ast_instantiate(ast_call, ctx, ast_call_delete);
706 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
708 MEM_VECTOR_INIT(self, params);
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);
718 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
720 void ast_call_delete(ast_call *self)
723 for (i = 0; i < self->params_count; ++i)
724 ast_unref(self->params[i]);
725 MEM_VECTOR_CLEAR(self, params);
728 ast_unref(self->func);
730 ast_expression_delete((ast_expression*)self);
734 bool ast_call_check_types(ast_call *self)
738 const ast_expression *func = self->func;
739 size_t count = self->params_count;
740 if (count > func->expression.params_count)
741 count = func->expression.params_count;
743 for (i = 0; i < count; ++i) {
744 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
745 asterror(ast_ctx(self), "invalid type for parameter %u in function call",
746 (unsigned int)(i+1));
747 /* we don't immediately return */
754 ast_store* ast_store_new(lex_ctx ctx, int op,
755 ast_expression *dest, ast_expression *source)
757 ast_instantiate(ast_store, ctx, ast_store_delete);
758 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
762 self->source = source;
764 self->expression.vtype = dest->expression.vtype;
765 if (dest->expression.next) {
766 self->expression.next = ast_type_copy(ctx, dest);
767 if (!self->expression.next) {
773 self->expression.next = NULL;
778 void ast_store_delete(ast_store *self)
780 ast_unref(self->dest);
781 ast_unref(self->source);
782 ast_expression_delete((ast_expression*)self);
786 ast_block* ast_block_new(lex_ctx ctx)
788 ast_instantiate(ast_block, ctx, ast_block_delete);
789 ast_expression_init((ast_expression*)self,
790 (ast_expression_codegen*)&ast_block_codegen);
792 MEM_VECTOR_INIT(self, locals);
793 MEM_VECTOR_INIT(self, exprs);
794 MEM_VECTOR_INIT(self, collect);
798 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
799 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
800 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, collect)
802 bool ast_block_collect(ast_block *self, ast_expression *expr)
804 if (!ast_block_collect_add(self, expr))
806 expr->expression.node.keep = true;
810 void ast_block_delete(ast_block *self)
813 for (i = 0; i < self->exprs_count; ++i)
814 ast_unref(self->exprs[i]);
815 MEM_VECTOR_CLEAR(self, exprs);
816 for (i = 0; i < self->locals_count; ++i)
817 ast_delete(self->locals[i]);
818 MEM_VECTOR_CLEAR(self, locals);
819 for (i = 0; i < self->collect_count; ++i)
820 ast_delete(self->collect[i]);
821 MEM_VECTOR_CLEAR(self, collect);
822 ast_expression_delete((ast_expression*)self);
826 bool ast_block_set_type(ast_block *self, ast_expression *from)
828 if (self->expression.next)
829 ast_delete(self->expression.next);
830 self->expression.vtype = from->expression.vtype;
831 if (from->expression.next) {
832 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
833 if (!self->expression.next)
837 self->expression.next = NULL;
841 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
843 ast_instantiate(ast_function, ctx, ast_function_delete);
847 vtype->expression.vtype != TYPE_FUNCTION)
854 self->name = name ? util_strdup(name) : NULL;
855 MEM_VECTOR_INIT(self, blocks);
857 self->labelcount = 0;
860 self->ir_func = NULL;
861 self->curblock = NULL;
863 self->breakblock = NULL;
864 self->continueblock = NULL;
866 vtype->isconst = true;
867 vtype->constval.vfunc = self;
872 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
874 void ast_function_delete(ast_function *self)
878 mem_d((void*)self->name);
880 /* ast_value_delete(self->vtype); */
881 self->vtype->isconst = false;
882 self->vtype->constval.vfunc = NULL;
883 /* We use unref - if it was stored in a global table it is supposed
884 * to be deleted from *there*
886 ast_unref(self->vtype);
888 for (i = 0; i < self->blocks_count; ++i)
889 ast_delete(self->blocks[i]);
890 MEM_VECTOR_CLEAR(self, blocks);
894 const char* ast_function_label(ast_function *self, const char *prefix)
903 id = (self->labelcount++);
904 len = strlen(prefix);
906 from = self->labelbuf + sizeof(self->labelbuf)-1;
909 unsigned int digit = id % 10;
913 memcpy(from - len, prefix, len);
917 /*********************************************************************/
919 * by convention you must never pass NULL to the 'ir_value **out'
920 * parameter. If you really don't care about the output, pass a dummy.
921 * But I can't imagine a pituation where the output is truly unnecessary.
924 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
926 /* NOTE: This is the codegen for a variable used in an expression.
927 * It is not the codegen to generate the value. For this purpose,
928 * ast_local_codegen and ast_global_codegen are to be used before this
929 * is executed. ast_function_codegen should take care of its locals,
930 * and the ast-user should take care of ast_global_codegen to be used
931 * on all the globals.
935 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
936 asterror(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
943 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
947 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
949 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
952 func->context = ast_ctx(self);
953 func->value->context = ast_ctx(self);
955 self->constval.vfunc->ir_func = func;
956 self->ir_v = func->value;
957 /* The function is filled later on ast_function_codegen... */
961 if (isfield && self->expression.vtype == TYPE_FIELD) {
962 ast_expression *fieldtype = self->expression.next;
965 asterror(ast_ctx(self), "TODO: constant field pointers with value");
969 if (fieldtype->expression.vtype == TYPE_ARRAY) {
974 ast_expression_common *elemtype;
976 ast_value *array = (ast_value*)fieldtype;
978 if (!ast_istype(fieldtype, ast_value)) {
979 asterror(ast_ctx(self), "internal error: ast_value required");
983 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
984 if (!array->expression.count || array->expression.count > opts_max_array_size)
985 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
987 elemtype = &array->expression.next->expression;
988 vtype = elemtype->vtype;
990 v = ir_builder_create_field(ir, self->name, vtype);
992 asterror(ast_ctx(self), "ir_builder_create_global failed");
995 if (vtype == TYPE_FIELD)
996 v->fieldtype = elemtype->next->expression.vtype;
997 v->context = ast_ctx(self);
998 array->ir_v = self->ir_v = v;
1000 namelen = strlen(self->name);
1001 name = (char*)mem_a(namelen + 16);
1002 strcpy(name, self->name);
1004 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1005 array->ir_values[0] = v;
1006 for (ai = 1; ai < array->expression.count; ++ai) {
1007 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1008 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1009 if (!array->ir_values[ai]) {
1011 asterror(ast_ctx(self), "ir_builder_create_global failed");
1014 if (vtype == TYPE_FIELD)
1015 array->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1016 array->ir_values[ai]->context = ast_ctx(self);
1022 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1025 v->context = ast_ctx(self);
1031 if (self->expression.vtype == TYPE_ARRAY) {
1036 ast_expression_common *elemtype = &self->expression.next->expression;
1037 int vtype = elemtype->vtype;
1039 /* same as with field arrays */
1040 if (!self->expression.count || self->expression.count > opts_max_array_size)
1041 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1043 v = ir_builder_create_global(ir, self->name, vtype);
1045 asterror(ast_ctx(self), "ir_builder_create_global failed");
1048 if (vtype == TYPE_FIELD)
1049 v->fieldtype = elemtype->next->expression.vtype;
1050 v->context = ast_ctx(self);
1052 namelen = strlen(self->name);
1053 name = (char*)mem_a(namelen + 16);
1054 strcpy(name, self->name);
1056 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1057 self->ir_values[0] = v;
1058 for (ai = 1; ai < self->expression.count; ++ai) {
1059 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1060 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1061 if (!self->ir_values[ai]) {
1063 asterror(ast_ctx(self), "ir_builder_create_global failed");
1066 if (vtype == TYPE_FIELD)
1067 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1068 self->ir_values[ai]->context = ast_ctx(self);
1074 /* Arrays don't do this since there's no "array" value which spans across the
1077 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1079 asterror(ast_ctx(self), "ir_builder_create_global failed");
1082 if (self->expression.vtype == TYPE_FIELD)
1083 v->fieldtype = self->expression.next->expression.vtype;
1084 v->context = ast_ctx(self);
1087 if (self->isconst) {
1088 switch (self->expression.vtype)
1091 if (!ir_value_set_float(v, self->constval.vfloat))
1095 if (!ir_value_set_vector(v, self->constval.vvec))
1099 if (!ir_value_set_string(v, self->constval.vstring))
1103 asterror(ast_ctx(self), "TODO: global constant array");
1106 asterror(ast_ctx(self), "global of type function not properly generated");
1108 /* Cannot generate an IR value for a function,
1109 * need a pointer pointing to a function rather.
1112 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1117 /* link us to the ir_value */
1121 error: /* clean up */
1126 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1129 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
1131 /* Do we allow local functions? I think not...
1132 * this is NOT a function pointer atm.
1137 if (self->expression.vtype == TYPE_ARRAY) {
1142 ast_expression_common *elemtype = &self->expression.next->expression;
1143 int vtype = elemtype->vtype;
1146 asterror(ast_ctx(self), "array-parameters are not supported");
1150 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1151 if (!self->expression.count || self->expression.count > opts_max_array_size) {
1152 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1155 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1156 if (!self->ir_values) {
1157 asterror(ast_ctx(self), "failed to allocate array values");
1161 v = ir_function_create_local(func, self->name, vtype, param);
1163 asterror(ast_ctx(self), "ir_function_create_local failed");
1166 if (vtype == TYPE_FIELD)
1167 v->fieldtype = elemtype->next->expression.vtype;
1168 v->context = ast_ctx(self);
1170 namelen = strlen(self->name);
1171 name = (char*)mem_a(namelen + 16);
1172 strcpy(name, self->name);
1174 self->ir_values[0] = v;
1175 for (ai = 1; ai < self->expression.count; ++ai) {
1176 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1177 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1178 if (!self->ir_values[ai]) {
1179 asterror(ast_ctx(self), "ir_builder_create_global failed");
1182 if (vtype == TYPE_FIELD)
1183 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1184 self->ir_values[ai]->context = ast_ctx(self);
1189 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1192 if (self->expression.vtype == TYPE_FIELD)
1193 v->fieldtype = self->expression.next->expression.vtype;
1194 v->context = ast_ctx(self);
1197 /* A constant local... hmmm...
1198 * I suppose the IR will have to deal with this
1200 if (self->isconst) {
1201 switch (self->expression.vtype)
1204 if (!ir_value_set_float(v, self->constval.vfloat))
1208 if (!ir_value_set_vector(v, self->constval.vvec))
1212 if (!ir_value_set_string(v, self->constval.vstring))
1216 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1221 /* link us to the ir_value */
1225 if (!ast_global_codegen(self->setter, func->owner, false) ||
1226 !ast_function_codegen(self->setter->constval.vfunc, func->owner) ||
1227 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1231 if (!ast_global_codegen(self->getter, func->owner, false) ||
1232 !ast_function_codegen(self->getter->constval.vfunc, func->owner) ||
1233 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1238 error: /* clean up */
1243 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1247 ast_expression_common *ec;
1250 irf = self->ir_func;
1252 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1256 /* fill the parameter list */
1257 ec = &self->vtype->expression;
1258 for (i = 0; i < ec->params_count; ++i)
1260 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
1262 if (!self->builtin) {
1263 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1268 if (self->builtin) {
1269 irf->builtin = self->builtin;
1273 if (!self->blocks_count) {
1274 asterror(ast_ctx(self), "function `%s` has no body", self->name);
1278 self->curblock = ir_function_create_block(irf, "entry");
1279 if (!self->curblock) {
1280 asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1284 for (i = 0; i < self->blocks_count; ++i) {
1285 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1286 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1290 /* TODO: check return types */
1291 if (!self->curblock->is_return)
1293 return ir_block_create_return(self->curblock, NULL);
1294 /* From now on the parser has to handle this situation */
1296 if (!self->vtype->expression.next ||
1297 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1299 return ir_block_create_return(self->curblock, NULL);
1303 /* error("missing return"); */
1304 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
1312 /* Note, you will not see ast_block_codegen generate ir_blocks.
1313 * To the AST and the IR, blocks are 2 different things.
1314 * In the AST it represents a block of code, usually enclosed in
1315 * curly braces {...}.
1316 * While in the IR it represents a block in terms of control-flow.
1318 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1322 /* We don't use this
1323 * Note: an ast-representation using the comma-operator
1324 * of the form: (a, b, c) = x should not assign to c...
1327 asterror(ast_ctx(self), "not an l-value (code-block)");
1331 if (self->expression.outr) {
1332 *out = self->expression.outr;
1336 /* output is NULL at first, we'll have each expression
1337 * assign to out output, thus, a comma-operator represention
1338 * using an ast_block will return the last generated value,
1339 * so: (b, c) + a executed both b and c, and returns c,
1340 * which is then added to a.
1344 /* generate locals */
1345 for (i = 0; i < self->locals_count; ++i)
1347 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1349 asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1354 for (i = 0; i < self->exprs_count; ++i)
1356 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1357 if (!(*gen)(self->exprs[i], func, false, out))
1361 self->expression.outr = *out;
1366 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1368 ast_expression_codegen *cgen;
1369 ir_value *left, *right;
1373 ast_array_index *ai = NULL;
1375 if (lvalue && self->expression.outl) {
1376 *out = self->expression.outl;
1380 if (!lvalue && self->expression.outr) {
1381 *out = self->expression.outr;
1385 if (ast_istype(self->dest, ast_array_index))
1388 ai = (ast_array_index*)self->dest;
1389 idx = (ast_value*)ai->index;
1391 if (ast_istype(ai->index, ast_value) && idx->isconst)
1396 /* we need to call the setter */
1397 ir_value *iridx, *funval;
1401 asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1405 arr = (ast_value*)ai->array;
1406 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1407 asterror(ast_ctx(self), "value has no setter (%s)", arr->name);
1411 cgen = idx->expression.codegen;
1412 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1415 cgen = arr->setter->expression.codegen;
1416 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1419 cgen = self->source->expression.codegen;
1420 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1423 call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval);
1426 if (!ir_call_param(call, iridx))
1428 if (!ir_call_param(call, right))
1430 self->expression.outr = right;
1436 cgen = self->dest->expression.codegen;
1438 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1440 self->expression.outl = left;
1442 cgen = self->source->expression.codegen;
1444 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1447 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1449 self->expression.outr = right;
1452 /* Theoretically, an assinment returns its left side as an
1453 * lvalue, if we don't need an lvalue though, we return
1454 * the right side as an rvalue, otherwise we have to
1455 * somehow know whether or not we need to dereference the pointer
1456 * on the left side - that is: OP_LOAD if it was an address.
1457 * Also: in original QC we cannot OP_LOADP *anyway*.
1459 *out = (lvalue ? left : right);
1464 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1466 ast_expression_codegen *cgen;
1467 ir_value *left, *right;
1469 /* A binary operation cannot yield an l-value */
1471 asterror(ast_ctx(self), "not an l-value (binop)");
1475 if (self->expression.outr) {
1476 *out = self->expression.outr;
1480 cgen = self->left->expression.codegen;
1482 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1485 cgen = self->right->expression.codegen;
1487 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1490 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1491 self->op, left, right);
1494 self->expression.outr = *out;
1499 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1501 ast_expression_codegen *cgen;
1502 ir_value *leftl, *leftr, *right, *bin;
1504 if (lvalue && self->expression.outl) {
1505 *out = self->expression.outl;
1509 if (!lvalue && self->expression.outr) {
1510 *out = self->expression.outr;
1514 /* for a binstore we need both an lvalue and an rvalue for the left side */
1515 /* rvalue of destination! */
1516 cgen = self->dest->expression.codegen;
1517 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1520 /* source as rvalue only */
1521 cgen = self->source->expression.codegen;
1522 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1525 /* now the binary */
1526 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1527 self->opbin, leftr, right);
1528 self->expression.outr = bin;
1530 /* now store them */
1531 cgen = self->dest->expression.codegen;
1532 /* lvalue of destination */
1533 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1535 self->expression.outl = leftl;
1537 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1539 self->expression.outr = bin;
1541 /* Theoretically, an assinment returns its left side as an
1542 * lvalue, if we don't need an lvalue though, we return
1543 * the right side as an rvalue, otherwise we have to
1544 * somehow know whether or not we need to dereference the pointer
1545 * on the left side - that is: OP_LOAD if it was an address.
1546 * Also: in original QC we cannot OP_LOADP *anyway*.
1548 *out = (lvalue ? leftl : bin);
1553 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1555 ast_expression_codegen *cgen;
1558 /* An unary operation cannot yield an l-value */
1560 asterror(ast_ctx(self), "not an l-value (binop)");
1564 if (self->expression.outr) {
1565 *out = self->expression.outr;
1569 cgen = self->operand->expression.codegen;
1571 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1574 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1578 self->expression.outr = *out;
1583 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1585 ast_expression_codegen *cgen;
1588 /* In the context of a return operation, we don't actually return
1592 asterror(ast_ctx(self), "return-expression is not an l-value");
1596 if (self->expression.outr) {
1597 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1600 self->expression.outr = (ir_value*)1;
1602 if (self->operand) {
1603 cgen = self->operand->expression.codegen;
1605 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1608 if (!ir_block_create_return(func->curblock, operand))
1611 if (!ir_block_create_return(func->curblock, NULL))
1618 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1620 ast_expression_codegen *cgen;
1621 ir_value *ent, *field;
1623 /* This function needs to take the 'lvalue' flag into account!
1624 * As lvalue we provide a field-pointer, as rvalue we provide the
1628 if (lvalue && self->expression.outl) {
1629 *out = self->expression.outl;
1633 if (!lvalue && self->expression.outr) {
1634 *out = self->expression.outr;
1638 cgen = self->entity->expression.codegen;
1639 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1642 cgen = self->field->expression.codegen;
1643 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1648 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1651 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1652 ent, field, self->expression.vtype);
1655 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1656 (lvalue ? "ADDRESS" : "FIELD"),
1657 type_name[self->expression.vtype]);
1662 self->expression.outl = *out;
1664 self->expression.outr = *out;
1666 /* Hm that should be it... */
1670 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1672 ast_expression_codegen *cgen;
1675 /* in QC this is always an lvalue */
1677 if (self->expression.outl) {
1678 *out = self->expression.outl;
1682 cgen = self->owner->expression.codegen;
1683 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1686 if (vec->vtype != TYPE_VECTOR &&
1687 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1692 *out = ir_value_vector_member(vec, self->field);
1693 self->expression.outl = *out;
1695 return (*out != NULL);
1698 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
1703 if (!lvalue && self->expression.outr) {
1704 *out = self->expression.outr;
1706 if (lvalue && self->expression.outl) {
1707 *out = self->expression.outl;
1710 if (!ast_istype(self->array, ast_value)) {
1711 asterror(ast_ctx(self), "array indexing this way is not supported");
1712 /* note this would actually be pointer indexing because the left side is
1713 * not an actual array but (hopefully) an indexable expression.
1714 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
1715 * support this path will be filled.
1720 arr = (ast_value*)self->array;
1721 idx = (ast_value*)self->index;
1723 if (!ast_istype(self->index, ast_value) || !idx->isconst) {
1724 /* Time to use accessor functions */
1725 ast_expression_codegen *cgen;
1726 ir_value *iridx, *funval;
1730 asterror(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
1735 asterror(ast_ctx(self), "value has no getter, don't know how to index it");
1739 cgen = self->index->expression.codegen;
1740 if (!(*cgen)((ast_expression*)(self->index), func, true, &iridx))
1743 cgen = arr->getter->expression.codegen;
1744 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
1747 call = ir_block_create_call(func->curblock, ast_function_label(func, "fetch"), funval);
1750 if (!ir_call_param(call, iridx))
1753 *out = ir_call_value(call);
1754 self->expression.outr = *out;
1758 if (idx->expression.vtype == TYPE_FLOAT)
1759 *out = arr->ir_values[(int)idx->constval.vfloat];
1760 else if (idx->expression.vtype == TYPE_INTEGER)
1761 *out = arr->ir_values[idx->constval.vint];
1763 asterror(ast_ctx(self), "array indexing here needs an integer constant");
1769 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1771 ast_expression_codegen *cgen;
1776 ir_block *cond = func->curblock;
1779 ir_block *ontrue_endblock = NULL;
1780 ir_block *onfalse_endblock = NULL;
1783 /* We don't output any value, thus also don't care about r/lvalue */
1787 if (self->expression.outr) {
1788 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
1791 self->expression.outr = (ir_value*)1;
1793 /* generate the condition */
1794 func->curblock = cond;
1795 cgen = self->cond->expression.codegen;
1796 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1801 if (self->on_true) {
1802 /* create on-true block */
1803 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1807 /* enter the block */
1808 func->curblock = ontrue;
1811 cgen = self->on_true->expression.codegen;
1812 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1815 /* we now need to work from the current endpoint */
1816 ontrue_endblock = func->curblock;
1821 if (self->on_false) {
1822 /* create on-false block */
1823 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1827 /* enter the block */
1828 func->curblock = onfalse;
1831 cgen = self->on_false->expression.codegen;
1832 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1835 /* we now need to work from the current endpoint */
1836 onfalse_endblock = func->curblock;
1840 /* Merge block were they all merge in to */
1841 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1845 /* add jumps ot the merge block */
1846 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
1848 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
1851 /* we create the if here, that way all blocks are ordered :)
1853 if (!ir_block_create_if(cond, condval,
1854 (ontrue ? ontrue : merge),
1855 (onfalse ? onfalse : merge)))
1860 /* Now enter the merge block */
1861 func->curblock = merge;
1866 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1868 ast_expression_codegen *cgen;
1871 ir_value *trueval, *falseval;
1874 ir_block *cond = func->curblock;
1879 /* Ternary can never create an lvalue... */
1883 /* In theory it shouldn't be possible to pass through a node twice, but
1884 * in case we add any kind of optimization pass for the AST itself, it
1885 * may still happen, thus we remember a created ir_value and simply return one
1886 * if it already exists.
1888 if (self->phi_out) {
1889 *out = self->phi_out;
1893 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1895 /* generate the condition */
1896 func->curblock = cond;
1897 cgen = self->cond->expression.codegen;
1898 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1901 /* create on-true block */
1902 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1907 /* enter the block */
1908 func->curblock = ontrue;
1911 cgen = self->on_true->expression.codegen;
1912 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1916 /* create on-false block */
1917 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1922 /* enter the block */
1923 func->curblock = onfalse;
1926 cgen = self->on_false->expression.codegen;
1927 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1931 /* create merge block */
1932 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1935 /* jump to merge block */
1936 if (!ir_block_create_jump(ontrue, merge))
1938 if (!ir_block_create_jump(onfalse, merge))
1941 /* create if instruction */
1942 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1945 /* Now enter the merge block */
1946 func->curblock = merge;
1948 /* Here, now, we need a PHI node
1949 * but first some sanity checking...
1951 if (trueval->vtype != falseval->vtype) {
1952 /* error("ternary with different types on the two sides"); */
1957 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1959 !ir_phi_add(phi, ontrue, trueval) ||
1960 !ir_phi_add(phi, onfalse, falseval))
1965 self->phi_out = ir_phi_value(phi);
1966 *out = self->phi_out;
1971 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1973 ast_expression_codegen *cgen;
1975 ir_value *dummy = NULL;
1976 ir_value *precond = NULL;
1977 ir_value *postcond = NULL;
1979 /* Since we insert some jumps "late" so we have blocks
1980 * ordered "nicely", we need to keep track of the actual end-blocks
1981 * of expressions to add the jumps to.
1983 ir_block *bbody = NULL, *end_bbody = NULL;
1984 ir_block *bprecond = NULL, *end_bprecond = NULL;
1985 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1986 ir_block *bincrement = NULL, *end_bincrement = NULL;
1987 ir_block *bout = NULL, *bin = NULL;
1989 /* let's at least move the outgoing block to the end */
1992 /* 'break' and 'continue' need to be able to find the right blocks */
1993 ir_block *bcontinue = NULL;
1994 ir_block *bbreak = NULL;
1996 ir_block *old_bcontinue = NULL;
1997 ir_block *old_bbreak = NULL;
1999 ir_block *tmpblock = NULL;
2004 if (self->expression.outr) {
2005 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2008 self->expression.outr = (ir_value*)1;
2011 * Should we ever need some kind of block ordering, better make this function
2012 * move blocks around than write a block ordering algorithm later... after all
2013 * the ast and ir should work together, not against each other.
2016 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2017 * anyway if for example it contains a ternary.
2021 cgen = self->initexpr->expression.codegen;
2022 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2026 /* Store the block from which we enter this chaos */
2027 bin = func->curblock;
2029 /* The pre-loop condition needs its own block since we
2030 * need to be able to jump to the start of that expression.
2034 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
2038 /* the pre-loop-condition the least important place to 'continue' at */
2039 bcontinue = bprecond;
2042 func->curblock = bprecond;
2045 cgen = self->precond->expression.codegen;
2046 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2049 end_bprecond = func->curblock;
2051 bprecond = end_bprecond = NULL;
2054 /* Now the next blocks won't be ordered nicely, but we need to
2055 * generate them this early for 'break' and 'continue'.
2057 if (self->increment) {
2058 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
2061 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2063 bincrement = end_bincrement = NULL;
2066 if (self->postcond) {
2067 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
2070 bcontinue = bpostcond; /* postcond comes before the increment */
2072 bpostcond = end_bpostcond = NULL;
2075 bout_id = func->ir_func->blocks_count;
2076 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
2081 /* The loop body... */
2084 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
2089 func->curblock = bbody;
2091 old_bbreak = func->breakblock;
2092 old_bcontinue = func->continueblock;
2093 func->breakblock = bbreak;
2094 func->continueblock = bcontinue;
2097 cgen = self->body->expression.codegen;
2098 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2101 end_bbody = func->curblock;
2102 func->breakblock = old_bbreak;
2103 func->continueblock = old_bcontinue;
2106 /* post-loop-condition */
2110 func->curblock = bpostcond;
2113 cgen = self->postcond->expression.codegen;
2114 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2117 end_bpostcond = func->curblock;
2120 /* The incrementor */
2121 if (self->increment)
2124 func->curblock = bincrement;
2127 cgen = self->increment->expression.codegen;
2128 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2131 end_bincrement = func->curblock;
2134 /* In any case now, we continue from the outgoing block */
2135 func->curblock = bout;
2137 /* Now all blocks are in place */
2138 /* From 'bin' we jump to whatever comes first */
2139 if (bprecond) tmpblock = bprecond;
2140 else if (bbody) tmpblock = bbody;
2141 else if (bpostcond) tmpblock = bpostcond;
2142 else tmpblock = bout;
2143 if (!ir_block_create_jump(bin, tmpblock))
2149 ir_block *ontrue, *onfalse;
2150 if (bbody) ontrue = bbody;
2151 else if (bincrement) ontrue = bincrement;
2152 else if (bpostcond) ontrue = bpostcond;
2153 else ontrue = bprecond;
2155 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
2162 if (bincrement) tmpblock = bincrement;
2163 else if (bpostcond) tmpblock = bpostcond;
2164 else if (bprecond) tmpblock = bprecond;
2165 else tmpblock = bout;
2166 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
2170 /* from increment */
2173 if (bpostcond) tmpblock = bpostcond;
2174 else if (bprecond) tmpblock = bprecond;
2175 else if (bbody) tmpblock = bbody;
2176 else tmpblock = bout;
2177 if (!ir_block_create_jump(end_bincrement, tmpblock))
2184 ir_block *ontrue, *onfalse;
2185 if (bprecond) ontrue = bprecond;
2186 else if (bbody) ontrue = bbody;
2187 else if (bincrement) ontrue = bincrement;
2188 else ontrue = bpostcond;
2190 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
2194 /* Move 'bout' to the end */
2195 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
2196 !ir_function_blocks_add(func->ir_func, bout))
2198 ir_block_delete(bout);
2205 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2207 ast_expression_codegen *cgen;
2208 ir_value_vector params;
2209 ir_instr *callinstr;
2212 ir_value *funval = NULL;
2214 /* return values are never lvalues */
2216 asterror(ast_ctx(self), "not an l-value (function call)");
2220 if (self->expression.outr) {
2221 *out = self->expression.outr;
2225 cgen = self->func->expression.codegen;
2226 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2231 MEM_VECTOR_INIT(¶ms, v);
2234 for (i = 0; i < self->params_count; ++i)
2237 ast_expression *expr = self->params[i];
2239 cgen = expr->expression.codegen;
2240 if (!(*cgen)(expr, func, false, ¶m))
2244 if (!ir_value_vector_v_add(¶ms, param))
2248 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
2252 for (i = 0; i < params.v_count; ++i) {
2253 if (!ir_call_param(callinstr, params.v[i]))
2257 *out = ir_call_value(callinstr);
2258 self->expression.outr = *out;
2260 MEM_VECTOR_CLEAR(¶ms, v);
2263 MEM_VECTOR_CLEAR(¶ms, v);