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 const ast_expression *outtype;
488 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
490 if (field->expression.vtype != TYPE_FIELD) {
495 outtype = field->expression.next;
498 /* Error: field has no type... */
502 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
504 self->entity = entity;
507 if (!ast_type_adopt(self, outtype)) {
508 ast_entfield_delete(self);
515 void ast_entfield_delete(ast_entfield *self)
517 ast_unref(self->entity);
518 ast_unref(self->field);
519 ast_expression_delete((ast_expression*)self);
523 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
525 ast_instantiate(ast_member, ctx, ast_member_delete);
531 if (owner->expression.vtype != TYPE_VECTOR &&
532 owner->expression.vtype != TYPE_FIELD) {
533 asterror(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
538 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
539 self->expression.node.keep = true; /* keep */
541 if (owner->expression.vtype == TYPE_VECTOR) {
542 self->expression.vtype = TYPE_FLOAT;
543 self->expression.next = NULL;
545 self->expression.vtype = TYPE_FIELD;
546 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
555 void ast_member_delete(ast_member *self)
557 /* The owner is always an ast_value, which has .keep=true,
558 * also: ast_members are usually deleted after the owner, thus
559 * this will cause invalid access
560 ast_unref(self->owner);
561 * once we allow (expression).x to access a vector-member, we need
562 * to change this: preferably by creating an alternate ast node for this
563 * purpose that is not garbage-collected.
565 ast_expression_delete((ast_expression*)self);
569 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
571 const ast_expression *outtype;
572 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
574 outtype = array->expression.next;
577 /* Error: field has no type... */
581 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
586 if (!ast_type_adopt(self, outtype)) {
587 ast_array_index_delete(self);
594 void ast_array_index_delete(ast_array_index *self)
596 ast_unref(self->array);
597 ast_unref(self->index);
598 ast_expression_delete((ast_expression*)self);
602 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
604 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
605 if (!ontrue && !onfalse) {
606 /* because it is invalid */
610 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
613 self->on_true = ontrue;
614 self->on_false = onfalse;
619 void ast_ifthen_delete(ast_ifthen *self)
621 ast_unref(self->cond);
623 ast_unref(self->on_true);
625 ast_unref(self->on_false);
626 ast_expression_delete((ast_expression*)self);
630 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
632 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
633 /* This time NEITHER must be NULL */
634 if (!ontrue || !onfalse) {
638 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
641 self->on_true = ontrue;
642 self->on_false = onfalse;
643 self->phi_out = NULL;
648 void ast_ternary_delete(ast_ternary *self)
650 ast_unref(self->cond);
651 ast_unref(self->on_true);
652 ast_unref(self->on_false);
653 ast_expression_delete((ast_expression*)self);
657 ast_loop* ast_loop_new(lex_ctx ctx,
658 ast_expression *initexpr,
659 ast_expression *precond,
660 ast_expression *postcond,
661 ast_expression *increment,
662 ast_expression *body)
664 ast_instantiate(ast_loop, ctx, ast_loop_delete);
665 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
667 self->initexpr = initexpr;
668 self->precond = precond;
669 self->postcond = postcond;
670 self->increment = increment;
676 void ast_loop_delete(ast_loop *self)
679 ast_unref(self->initexpr);
681 ast_unref(self->precond);
683 ast_unref(self->postcond);
685 ast_unref(self->increment);
687 ast_unref(self->body);
688 ast_expression_delete((ast_expression*)self);
692 ast_call* ast_call_new(lex_ctx ctx,
693 ast_expression *funcexpr)
695 ast_instantiate(ast_call, ctx, ast_call_delete);
696 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
698 MEM_VECTOR_INIT(self, params);
700 self->func = funcexpr;
702 self->expression.vtype = funcexpr->expression.next->expression.vtype;
703 if (funcexpr->expression.next->expression.next)
704 self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
708 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
710 void ast_call_delete(ast_call *self)
713 for (i = 0; i < self->params_count; ++i)
714 ast_unref(self->params[i]);
715 MEM_VECTOR_CLEAR(self, params);
718 ast_unref(self->func);
720 ast_expression_delete((ast_expression*)self);
724 bool ast_call_check_types(ast_call *self)
728 const ast_expression *func = self->func;
729 size_t count = self->params_count;
730 if (count > func->expression.params_count)
731 count = func->expression.params_count;
733 for (i = 0; i < count; ++i) {
734 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
735 asterror(ast_ctx(self), "invalid type for parameter %u in function call",
736 (unsigned int)(i+1));
737 /* we don't immediately return */
744 ast_store* ast_store_new(lex_ctx ctx, int op,
745 ast_expression *dest, ast_expression *source)
747 ast_instantiate(ast_store, ctx, ast_store_delete);
748 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
752 self->source = source;
754 self->expression.vtype = dest->expression.vtype;
755 if (dest->expression.next) {
756 self->expression.next = ast_type_copy(ctx, dest);
757 if (!self->expression.next) {
763 self->expression.next = NULL;
768 void ast_store_delete(ast_store *self)
770 ast_unref(self->dest);
771 ast_unref(self->source);
772 ast_expression_delete((ast_expression*)self);
776 ast_block* ast_block_new(lex_ctx ctx)
778 ast_instantiate(ast_block, ctx, ast_block_delete);
779 ast_expression_init((ast_expression*)self,
780 (ast_expression_codegen*)&ast_block_codegen);
782 MEM_VECTOR_INIT(self, locals);
783 MEM_VECTOR_INIT(self, exprs);
784 MEM_VECTOR_INIT(self, collect);
788 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
789 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
790 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, collect)
792 bool ast_block_collect(ast_block *self, ast_expression *expr)
794 if (!ast_block_collect_add(self, expr))
796 expr->expression.node.keep = true;
800 void ast_block_delete(ast_block *self)
803 for (i = 0; i < self->exprs_count; ++i)
804 ast_unref(self->exprs[i]);
805 MEM_VECTOR_CLEAR(self, exprs);
806 for (i = 0; i < self->locals_count; ++i)
807 ast_delete(self->locals[i]);
808 MEM_VECTOR_CLEAR(self, locals);
809 for (i = 0; i < self->collect_count; ++i)
810 ast_delete(self->collect[i]);
811 MEM_VECTOR_CLEAR(self, collect);
812 ast_expression_delete((ast_expression*)self);
816 bool ast_block_set_type(ast_block *self, ast_expression *from)
818 if (self->expression.next)
819 ast_delete(self->expression.next);
820 self->expression.vtype = from->expression.vtype;
821 if (from->expression.next) {
822 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
823 if (!self->expression.next)
827 self->expression.next = NULL;
831 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
833 ast_instantiate(ast_function, ctx, ast_function_delete);
837 vtype->expression.vtype != TYPE_FUNCTION)
844 self->name = name ? util_strdup(name) : NULL;
845 MEM_VECTOR_INIT(self, blocks);
847 self->labelcount = 0;
850 self->ir_func = NULL;
851 self->curblock = NULL;
853 self->breakblock = NULL;
854 self->continueblock = NULL;
856 vtype->isconst = true;
857 vtype->constval.vfunc = self;
862 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
864 void ast_function_delete(ast_function *self)
868 mem_d((void*)self->name);
870 /* ast_value_delete(self->vtype); */
871 self->vtype->isconst = false;
872 self->vtype->constval.vfunc = NULL;
873 /* We use unref - if it was stored in a global table it is supposed
874 * to be deleted from *there*
876 ast_unref(self->vtype);
878 for (i = 0; i < self->blocks_count; ++i)
879 ast_delete(self->blocks[i]);
880 MEM_VECTOR_CLEAR(self, blocks);
884 const char* ast_function_label(ast_function *self, const char *prefix)
893 id = (self->labelcount++);
894 len = strlen(prefix);
896 from = self->labelbuf + sizeof(self->labelbuf)-1;
899 unsigned int digit = id % 10;
903 memcpy(from - len, prefix, len);
907 /*********************************************************************/
909 * by convention you must never pass NULL to the 'ir_value **out'
910 * parameter. If you really don't care about the output, pass a dummy.
911 * But I can't imagine a pituation where the output is truly unnecessary.
914 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
916 /* NOTE: This is the codegen for a variable used in an expression.
917 * It is not the codegen to generate the value. For this purpose,
918 * ast_local_codegen and ast_global_codegen are to be used before this
919 * is executed. ast_function_codegen should take care of its locals,
920 * and the ast-user should take care of ast_global_codegen to be used
921 * on all the globals.
925 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
926 asterror(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
933 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
937 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
939 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
942 func->context = ast_ctx(self);
943 func->value->context = ast_ctx(self);
945 self->constval.vfunc->ir_func = func;
946 self->ir_v = func->value;
947 /* The function is filled later on ast_function_codegen... */
951 if (isfield && self->expression.vtype == TYPE_FIELD) {
952 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
955 v->context = ast_ctx(self);
957 asterror(ast_ctx(self), "TODO: constant field pointers with value");
964 if (self->expression.vtype == TYPE_ARRAY) {
969 ast_expression_common *elemtype = &self->expression.next->expression;
970 int vtype = elemtype->vtype;
971 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
972 if (!self->expression.count || self->expression.count > opts_max_array_size) {
973 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
976 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
977 if (!self->ir_values) {
978 asterror(ast_ctx(self), "failed to allocate array values");
982 v = ir_builder_create_global(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);
991 namelen = strlen(self->name);
992 name = (char*)mem_a(namelen + 16);
993 strcpy(name, self->name);
995 self->ir_values[0] = v;
996 for (ai = 1; ai < self->expression.count; ++ai) {
997 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
998 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
999 if (!self->ir_values[ai]) {
1000 asterror(ast_ctx(self), "ir_builder_create_global failed");
1003 if (vtype == TYPE_FIELD)
1004 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1005 self->ir_values[ai]->context = ast_ctx(self);
1010 /* Arrays don't do this since there's no "array" value which spans across the
1013 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1015 asterror(ast_ctx(self), "ir_builder_create_global failed");
1018 if (self->expression.vtype == TYPE_FIELD)
1019 v->fieldtype = self->expression.next->expression.vtype;
1020 v->context = ast_ctx(self);
1023 if (self->isconst) {
1024 switch (self->expression.vtype)
1027 if (!ir_value_set_float(v, self->constval.vfloat))
1031 if (!ir_value_set_vector(v, self->constval.vvec))
1035 if (!ir_value_set_string(v, self->constval.vstring))
1039 asterror(ast_ctx(self), "TODO: global constant array");
1042 asterror(ast_ctx(self), "global of type function not properly generated");
1044 /* Cannot generate an IR value for a function,
1045 * need a pointer pointing to a function rather.
1048 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1053 /* link us to the ir_value */
1057 error: /* clean up */
1062 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1065 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
1067 /* Do we allow local functions? I think not...
1068 * this is NOT a function pointer atm.
1073 if (self->expression.vtype == TYPE_ARRAY)
1075 asterror(ast_ctx(self), "TODO: ast_local_codgen for TYPE_ARRAY");
1079 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1082 if (self->expression.vtype == TYPE_FIELD)
1083 v->fieldtype = self->expression.next->expression.vtype;
1084 v->context = ast_ctx(self);
1086 /* A constant local... hmmm...
1087 * I suppose the IR will have to deal with this
1089 if (self->isconst) {
1090 switch (self->expression.vtype)
1093 if (!ir_value_set_float(v, self->constval.vfloat))
1097 if (!ir_value_set_vector(v, self->constval.vvec))
1101 if (!ir_value_set_string(v, self->constval.vstring))
1105 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1110 /* link us to the ir_value */
1114 error: /* clean up */
1119 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1123 ast_expression_common *ec;
1126 irf = self->ir_func;
1128 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1132 /* fill the parameter list */
1133 ec = &self->vtype->expression;
1134 for (i = 0; i < ec->params_count; ++i)
1136 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
1138 if (!self->builtin) {
1139 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1144 if (self->builtin) {
1145 irf->builtin = self->builtin;
1149 if (!self->blocks_count) {
1150 asterror(ast_ctx(self), "function `%s` has no body", self->name);
1154 self->curblock = ir_function_create_block(irf, "entry");
1155 if (!self->curblock) {
1156 asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1160 for (i = 0; i < self->blocks_count; ++i) {
1161 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1162 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1166 /* TODO: check return types */
1167 if (!self->curblock->is_return)
1169 return ir_block_create_return(self->curblock, NULL);
1170 /* From now on the parser has to handle this situation */
1172 if (!self->vtype->expression.next ||
1173 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1175 return ir_block_create_return(self->curblock, NULL);
1179 /* error("missing return"); */
1180 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
1188 /* Note, you will not see ast_block_codegen generate ir_blocks.
1189 * To the AST and the IR, blocks are 2 different things.
1190 * In the AST it represents a block of code, usually enclosed in
1191 * curly braces {...}.
1192 * While in the IR it represents a block in terms of control-flow.
1194 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1198 /* We don't use this
1199 * Note: an ast-representation using the comma-operator
1200 * of the form: (a, b, c) = x should not assign to c...
1203 asterror(ast_ctx(self), "not an l-value (code-block)");
1207 if (self->expression.outr) {
1208 *out = self->expression.outr;
1212 /* output is NULL at first, we'll have each expression
1213 * assign to out output, thus, a comma-operator represention
1214 * using an ast_block will return the last generated value,
1215 * so: (b, c) + a executed both b and c, and returns c,
1216 * which is then added to a.
1220 /* generate locals */
1221 for (i = 0; i < self->locals_count; ++i)
1223 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1225 asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1230 for (i = 0; i < self->exprs_count; ++i)
1232 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1233 if (!(*gen)(self->exprs[i], func, false, out))
1237 self->expression.outr = *out;
1242 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1244 ast_expression_codegen *cgen;
1245 ir_value *left, *right;
1247 if (lvalue && self->expression.outl) {
1248 *out = self->expression.outl;
1252 if (!lvalue && self->expression.outr) {
1253 *out = self->expression.outr;
1257 cgen = self->dest->expression.codegen;
1259 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1261 self->expression.outl = left;
1263 cgen = self->source->expression.codegen;
1265 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1268 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1270 self->expression.outr = right;
1272 /* Theoretically, an assinment returns its left side as an
1273 * lvalue, if we don't need an lvalue though, we return
1274 * the right side as an rvalue, otherwise we have to
1275 * somehow know whether or not we need to dereference the pointer
1276 * on the left side - that is: OP_LOAD if it was an address.
1277 * Also: in original QC we cannot OP_LOADP *anyway*.
1279 *out = (lvalue ? left : right);
1284 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1286 ast_expression_codegen *cgen;
1287 ir_value *left, *right;
1289 /* A binary operation cannot yield an l-value */
1291 asterror(ast_ctx(self), "not an l-value (binop)");
1295 if (self->expression.outr) {
1296 *out = self->expression.outr;
1300 cgen = self->left->expression.codegen;
1302 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1305 cgen = self->right->expression.codegen;
1307 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1310 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1311 self->op, left, right);
1314 self->expression.outr = *out;
1319 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1321 ast_expression_codegen *cgen;
1322 ir_value *leftl, *leftr, *right, *bin;
1324 if (lvalue && self->expression.outl) {
1325 *out = self->expression.outl;
1329 if (!lvalue && self->expression.outr) {
1330 *out = self->expression.outr;
1334 /* for a binstore we need both an lvalue and an rvalue for the left side */
1335 /* rvalue of destination! */
1336 cgen = self->dest->expression.codegen;
1337 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1340 /* source as rvalue only */
1341 cgen = self->source->expression.codegen;
1342 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1345 /* now the binary */
1346 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1347 self->opbin, leftr, right);
1348 self->expression.outr = bin;
1350 /* now store them */
1351 cgen = self->dest->expression.codegen;
1352 /* lvalue of destination */
1353 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1355 self->expression.outl = leftl;
1357 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1359 self->expression.outr = bin;
1361 /* Theoretically, an assinment returns its left side as an
1362 * lvalue, if we don't need an lvalue though, we return
1363 * the right side as an rvalue, otherwise we have to
1364 * somehow know whether or not we need to dereference the pointer
1365 * on the left side - that is: OP_LOAD if it was an address.
1366 * Also: in original QC we cannot OP_LOADP *anyway*.
1368 *out = (lvalue ? leftl : bin);
1373 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1375 ast_expression_codegen *cgen;
1378 /* An unary operation cannot yield an l-value */
1380 asterror(ast_ctx(self), "not an l-value (binop)");
1384 if (self->expression.outr) {
1385 *out = self->expression.outr;
1389 cgen = self->operand->expression.codegen;
1391 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1394 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1398 self->expression.outr = *out;
1403 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1405 ast_expression_codegen *cgen;
1408 /* In the context of a return operation, we don't actually return
1412 asterror(ast_ctx(self), "return-expression is not an l-value");
1416 if (self->expression.outr) {
1417 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1420 self->expression.outr = (ir_value*)1;
1422 if (self->operand) {
1423 cgen = self->operand->expression.codegen;
1425 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1428 if (!ir_block_create_return(func->curblock, operand))
1431 if (!ir_block_create_return(func->curblock, NULL))
1438 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1440 ast_expression_codegen *cgen;
1441 ir_value *ent, *field;
1443 /* This function needs to take the 'lvalue' flag into account!
1444 * As lvalue we provide a field-pointer, as rvalue we provide the
1448 if (lvalue && self->expression.outl) {
1449 *out = self->expression.outl;
1453 if (!lvalue && self->expression.outr) {
1454 *out = self->expression.outr;
1458 cgen = self->entity->expression.codegen;
1459 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1462 cgen = self->field->expression.codegen;
1463 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1468 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1471 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1472 ent, field, self->expression.vtype);
1475 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1476 (lvalue ? "ADDRESS" : "FIELD"),
1477 type_name[self->expression.vtype]);
1482 self->expression.outl = *out;
1484 self->expression.outr = *out;
1486 /* Hm that should be it... */
1490 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1492 ast_expression_codegen *cgen;
1495 /* in QC this is always an lvalue */
1497 if (self->expression.outl) {
1498 *out = self->expression.outl;
1502 cgen = self->owner->expression.codegen;
1503 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1506 if (vec->vtype != TYPE_VECTOR &&
1507 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1512 *out = ir_value_vector_member(vec, self->field);
1513 self->expression.outl = *out;
1515 return (*out != NULL);
1518 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
1523 if (!lvalue && self->expression.outr) {
1524 *out = self->expression.outr;
1526 if (lvalue && self->expression.outl) {
1527 *out = self->expression.outl;
1530 if (!ast_istype(self->array, ast_value)) {
1531 asterror(ast_ctx(self), "array indexing this way is not supported");
1532 /* note this would actually be pointer indexing because the left side is
1533 * not an actual array but (hopefully) an indexable expression.
1534 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
1535 * support this path will be filled.
1540 arr = (ast_value*)self->array;
1541 idx = (ast_value*)self->index;
1543 if (!ast_istype(self->index, ast_value) || !idx->isconst) {
1544 /* Time to use accessor functions */
1545 ast_expression_codegen *cgen;
1546 ir_value *iridx, *funval;
1550 asterror(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
1555 asterror(ast_ctx(self), "value has no getter, don't know how to index it");
1559 cgen = self->index->expression.codegen;
1560 if (!(*cgen)((ast_expression*)(self->index), func, true, &iridx))
1563 cgen = arr->getter->expression.codegen;
1564 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
1567 call = ir_block_create_call(func->curblock, ast_function_label(func, "fetch"), funval);
1570 if (!ir_call_param(call, iridx))
1573 *out = ir_call_value(call);
1574 self->expression.outr = *out;
1578 if (idx->expression.vtype == TYPE_FLOAT)
1579 *out = arr->ir_values[(int)idx->constval.vfloat];
1580 else if (idx->expression.vtype == TYPE_INTEGER)
1581 *out = arr->ir_values[idx->constval.vint];
1583 asterror(ast_ctx(self), "array indexing here needs an integer constant");
1589 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1591 ast_expression_codegen *cgen;
1596 ir_block *cond = func->curblock;
1599 ir_block *ontrue_endblock = NULL;
1600 ir_block *onfalse_endblock = NULL;
1603 /* We don't output any value, thus also don't care about r/lvalue */
1607 if (self->expression.outr) {
1608 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
1611 self->expression.outr = (ir_value*)1;
1613 /* generate the condition */
1614 func->curblock = cond;
1615 cgen = self->cond->expression.codegen;
1616 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1621 if (self->on_true) {
1622 /* create on-true block */
1623 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1627 /* enter the block */
1628 func->curblock = ontrue;
1631 cgen = self->on_true->expression.codegen;
1632 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1635 /* we now need to work from the current endpoint */
1636 ontrue_endblock = func->curblock;
1641 if (self->on_false) {
1642 /* create on-false block */
1643 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1647 /* enter the block */
1648 func->curblock = onfalse;
1651 cgen = self->on_false->expression.codegen;
1652 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1655 /* we now need to work from the current endpoint */
1656 onfalse_endblock = func->curblock;
1660 /* Merge block were they all merge in to */
1661 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1665 /* add jumps ot the merge block */
1666 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
1668 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
1671 /* we create the if here, that way all blocks are ordered :)
1673 if (!ir_block_create_if(cond, condval,
1674 (ontrue ? ontrue : merge),
1675 (onfalse ? onfalse : merge)))
1680 /* Now enter the merge block */
1681 func->curblock = merge;
1686 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1688 ast_expression_codegen *cgen;
1691 ir_value *trueval, *falseval;
1694 ir_block *cond = func->curblock;
1699 /* Ternary can never create an lvalue... */
1703 /* In theory it shouldn't be possible to pass through a node twice, but
1704 * in case we add any kind of optimization pass for the AST itself, it
1705 * may still happen, thus we remember a created ir_value and simply return one
1706 * if it already exists.
1708 if (self->phi_out) {
1709 *out = self->phi_out;
1713 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1715 /* generate the condition */
1716 func->curblock = cond;
1717 cgen = self->cond->expression.codegen;
1718 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1721 /* create on-true block */
1722 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1727 /* enter the block */
1728 func->curblock = ontrue;
1731 cgen = self->on_true->expression.codegen;
1732 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1736 /* create on-false block */
1737 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1742 /* enter the block */
1743 func->curblock = onfalse;
1746 cgen = self->on_false->expression.codegen;
1747 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1751 /* create merge block */
1752 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1755 /* jump to merge block */
1756 if (!ir_block_create_jump(ontrue, merge))
1758 if (!ir_block_create_jump(onfalse, merge))
1761 /* create if instruction */
1762 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1765 /* Now enter the merge block */
1766 func->curblock = merge;
1768 /* Here, now, we need a PHI node
1769 * but first some sanity checking...
1771 if (trueval->vtype != falseval->vtype) {
1772 /* error("ternary with different types on the two sides"); */
1777 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1779 !ir_phi_add(phi, ontrue, trueval) ||
1780 !ir_phi_add(phi, onfalse, falseval))
1785 self->phi_out = ir_phi_value(phi);
1786 *out = self->phi_out;
1791 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1793 ast_expression_codegen *cgen;
1795 ir_value *dummy = NULL;
1796 ir_value *precond = NULL;
1797 ir_value *postcond = NULL;
1799 /* Since we insert some jumps "late" so we have blocks
1800 * ordered "nicely", we need to keep track of the actual end-blocks
1801 * of expressions to add the jumps to.
1803 ir_block *bbody = NULL, *end_bbody = NULL;
1804 ir_block *bprecond = NULL, *end_bprecond = NULL;
1805 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1806 ir_block *bincrement = NULL, *end_bincrement = NULL;
1807 ir_block *bout = NULL, *bin = NULL;
1809 /* let's at least move the outgoing block to the end */
1812 /* 'break' and 'continue' need to be able to find the right blocks */
1813 ir_block *bcontinue = NULL;
1814 ir_block *bbreak = NULL;
1816 ir_block *old_bcontinue = NULL;
1817 ir_block *old_bbreak = NULL;
1819 ir_block *tmpblock = NULL;
1824 if (self->expression.outr) {
1825 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
1828 self->expression.outr = (ir_value*)1;
1831 * Should we ever need some kind of block ordering, better make this function
1832 * move blocks around than write a block ordering algorithm later... after all
1833 * the ast and ir should work together, not against each other.
1836 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1837 * anyway if for example it contains a ternary.
1841 cgen = self->initexpr->expression.codegen;
1842 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1846 /* Store the block from which we enter this chaos */
1847 bin = func->curblock;
1849 /* The pre-loop condition needs its own block since we
1850 * need to be able to jump to the start of that expression.
1854 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1858 /* the pre-loop-condition the least important place to 'continue' at */
1859 bcontinue = bprecond;
1862 func->curblock = bprecond;
1865 cgen = self->precond->expression.codegen;
1866 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1869 end_bprecond = func->curblock;
1871 bprecond = end_bprecond = NULL;
1874 /* Now the next blocks won't be ordered nicely, but we need to
1875 * generate them this early for 'break' and 'continue'.
1877 if (self->increment) {
1878 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1881 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1883 bincrement = end_bincrement = NULL;
1886 if (self->postcond) {
1887 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1890 bcontinue = bpostcond; /* postcond comes before the increment */
1892 bpostcond = end_bpostcond = NULL;
1895 bout_id = func->ir_func->blocks_count;
1896 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1901 /* The loop body... */
1904 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1909 func->curblock = bbody;
1911 old_bbreak = func->breakblock;
1912 old_bcontinue = func->continueblock;
1913 func->breakblock = bbreak;
1914 func->continueblock = bcontinue;
1917 cgen = self->body->expression.codegen;
1918 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1921 end_bbody = func->curblock;
1922 func->breakblock = old_bbreak;
1923 func->continueblock = old_bcontinue;
1926 /* post-loop-condition */
1930 func->curblock = bpostcond;
1933 cgen = self->postcond->expression.codegen;
1934 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1937 end_bpostcond = func->curblock;
1940 /* The incrementor */
1941 if (self->increment)
1944 func->curblock = bincrement;
1947 cgen = self->increment->expression.codegen;
1948 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1951 end_bincrement = func->curblock;
1954 /* In any case now, we continue from the outgoing block */
1955 func->curblock = bout;
1957 /* Now all blocks are in place */
1958 /* From 'bin' we jump to whatever comes first */
1959 if (bprecond) tmpblock = bprecond;
1960 else if (bbody) tmpblock = bbody;
1961 else if (bpostcond) tmpblock = bpostcond;
1962 else tmpblock = bout;
1963 if (!ir_block_create_jump(bin, tmpblock))
1969 ir_block *ontrue, *onfalse;
1970 if (bbody) ontrue = bbody;
1971 else if (bincrement) ontrue = bincrement;
1972 else if (bpostcond) ontrue = bpostcond;
1973 else ontrue = bprecond;
1975 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1982 if (bincrement) tmpblock = bincrement;
1983 else if (bpostcond) tmpblock = bpostcond;
1984 else if (bprecond) tmpblock = bprecond;
1985 else tmpblock = bout;
1986 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
1990 /* from increment */
1993 if (bpostcond) tmpblock = bpostcond;
1994 else if (bprecond) tmpblock = bprecond;
1995 else if (bbody) tmpblock = bbody;
1996 else tmpblock = bout;
1997 if (!ir_block_create_jump(end_bincrement, tmpblock))
2004 ir_block *ontrue, *onfalse;
2005 if (bprecond) ontrue = bprecond;
2006 else if (bbody) ontrue = bbody;
2007 else if (bincrement) ontrue = bincrement;
2008 else ontrue = bpostcond;
2010 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
2014 /* Move 'bout' to the end */
2015 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
2016 !ir_function_blocks_add(func->ir_func, bout))
2018 ir_block_delete(bout);
2025 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2027 ast_expression_codegen *cgen;
2028 ir_value_vector params;
2029 ir_instr *callinstr;
2032 ir_value *funval = NULL;
2034 /* return values are never lvalues */
2036 asterror(ast_ctx(self), "not an l-value (function call)");
2040 if (self->expression.outr) {
2041 *out = self->expression.outr;
2045 cgen = self->func->expression.codegen;
2046 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2051 MEM_VECTOR_INIT(¶ms, v);
2054 for (i = 0; i < self->params_count; ++i)
2057 ast_expression *expr = self->params[i];
2059 cgen = expr->expression.codegen;
2060 if (!(*cgen)(expr, func, false, ¶m))
2064 if (!ir_value_vector_v_add(¶ms, param))
2068 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
2072 for (i = 0; i < params.v_count; ++i) {
2073 if (!ir_call_param(callinstr, params.v[i]))
2077 *out = ir_call_value(callinstr);
2078 self->expression.outr = *out;
2080 MEM_VECTOR_CLEAR(¶ms, v);
2083 MEM_VECTOR_CLEAR(¶ms, v);