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 typestr = type_name[e->expression.vtype];
281 typelen = strlen(typestr);
282 if (pos + typelen >= bufsize)
284 strcpy(buf + pos, typestr);
285 return pos + typelen;
289 buf[bufsize-3] = '.';
290 buf[bufsize-2] = '.';
291 buf[bufsize-1] = '.';
295 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
297 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
301 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
303 ast_instantiate(ast_value, ctx, ast_value_delete);
304 ast_expression_init((ast_expression*)self,
305 (ast_expression_codegen*)&ast_value_codegen);
306 self->expression.node.keep = true; /* keep */
308 self->name = name ? util_strdup(name) : NULL;
309 self->expression.vtype = t;
310 self->expression.next = NULL;
311 self->isconst = false;
313 memset(&self->constval, 0, sizeof(self->constval));
320 void ast_value_delete(ast_value* self)
323 mem_d((void*)self->name);
325 switch (self->expression.vtype)
328 mem_d((void*)self->constval.vstring);
331 /* unlink us from the function node */
332 self->constval.vfunc->vtype = NULL;
334 /* NOTE: delete function? currently collected in
335 * the parser structure
341 ast_expression_delete((ast_expression*)self);
345 bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
347 return ast_expression_common_params_add(&self->expression, p);
350 bool ast_value_set_name(ast_value *self, const char *name)
353 mem_d((void*)self->name);
354 self->name = util_strdup(name);
358 ast_binary* ast_binary_new(lex_ctx ctx, int op,
359 ast_expression* left, ast_expression* right)
361 ast_instantiate(ast_binary, ctx, ast_binary_delete);
362 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
368 if (op >= INSTR_EQ_F && op <= INSTR_GT)
369 self->expression.vtype = TYPE_FLOAT;
370 else if (op == INSTR_AND || op == INSTR_OR ||
371 op == INSTR_BITAND || op == INSTR_BITOR)
372 self->expression.vtype = TYPE_FLOAT;
373 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
374 self->expression.vtype = TYPE_VECTOR;
375 else if (op == INSTR_MUL_V)
376 self->expression.vtype = TYPE_FLOAT;
378 self->expression.vtype = left->expression.vtype;
383 void ast_binary_delete(ast_binary *self)
385 ast_unref(self->left);
386 ast_unref(self->right);
387 ast_expression_delete((ast_expression*)self);
391 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
392 ast_expression* left, ast_expression* right)
394 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
395 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
397 self->opstore = storop;
400 self->source = right;
402 self->expression.vtype = left->expression.vtype;
403 if (left->expression.next) {
404 self->expression.next = ast_type_copy(ctx, left);
405 if (!self->expression.next) {
411 self->expression.next = NULL;
416 void ast_binstore_delete(ast_binstore *self)
418 ast_unref(self->dest);
419 ast_unref(self->source);
420 ast_expression_delete((ast_expression*)self);
424 ast_unary* ast_unary_new(lex_ctx ctx, int op,
425 ast_expression *expr)
427 ast_instantiate(ast_unary, ctx, ast_unary_delete);
428 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
431 self->operand = expr;
433 if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
434 self->expression.vtype = TYPE_FLOAT;
436 asterror(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
441 void ast_unary_delete(ast_unary *self)
443 ast_unref(self->operand);
444 ast_expression_delete((ast_expression*)self);
448 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
450 ast_instantiate(ast_return, ctx, ast_return_delete);
451 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
453 self->operand = expr;
458 void ast_return_delete(ast_return *self)
461 ast_unref(self->operand);
462 ast_expression_delete((ast_expression*)self);
466 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
468 const ast_expression *outtype;
470 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
472 if (field->expression.vtype != TYPE_FIELD) {
477 outtype = field->expression.next;
480 /* Error: field has no type... */
484 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
486 self->entity = entity;
489 if (!ast_type_adopt(self, outtype)) {
490 ast_entfield_delete(self);
497 void ast_entfield_delete(ast_entfield *self)
499 ast_unref(self->entity);
500 ast_unref(self->field);
501 ast_expression_delete((ast_expression*)self);
505 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
507 ast_instantiate(ast_member, ctx, ast_member_delete);
513 if (owner->expression.vtype != TYPE_VECTOR &&
514 owner->expression.vtype != TYPE_FIELD) {
515 asterror(ctx, "member-access on an invalid owner of type %s", type_name[owner->expression.vtype]);
520 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
521 self->expression.node.keep = true; /* keep */
523 if (owner->expression.vtype == TYPE_VECTOR) {
524 self->expression.vtype = TYPE_FLOAT;
525 self->expression.next = NULL;
527 self->expression.vtype = TYPE_FIELD;
528 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
537 void ast_member_delete(ast_member *self)
539 /* The owner is always an ast_value, which has .keep=true,
540 * also: ast_members are usually deleted after the owner, thus
541 * this will cause invalid access
542 ast_unref(self->owner);
543 * once we allow (expression).x to access a vector-member, we need
544 * to change this: preferably by creating an alternate ast node for this
545 * purpose that is not garbage-collected.
547 ast_expression_delete((ast_expression*)self);
551 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
553 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
554 if (!ontrue && !onfalse) {
555 /* because it is invalid */
559 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
562 self->on_true = ontrue;
563 self->on_false = onfalse;
568 void ast_ifthen_delete(ast_ifthen *self)
570 ast_unref(self->cond);
572 ast_unref(self->on_true);
574 ast_unref(self->on_false);
575 ast_expression_delete((ast_expression*)self);
579 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
581 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
582 /* This time NEITHER must be NULL */
583 if (!ontrue || !onfalse) {
587 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
590 self->on_true = ontrue;
591 self->on_false = onfalse;
592 self->phi_out = NULL;
597 void ast_ternary_delete(ast_ternary *self)
599 ast_unref(self->cond);
600 ast_unref(self->on_true);
601 ast_unref(self->on_false);
602 ast_expression_delete((ast_expression*)self);
606 ast_loop* ast_loop_new(lex_ctx ctx,
607 ast_expression *initexpr,
608 ast_expression *precond,
609 ast_expression *postcond,
610 ast_expression *increment,
611 ast_expression *body)
613 ast_instantiate(ast_loop, ctx, ast_loop_delete);
614 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
616 self->initexpr = initexpr;
617 self->precond = precond;
618 self->postcond = postcond;
619 self->increment = increment;
625 void ast_loop_delete(ast_loop *self)
628 ast_unref(self->initexpr);
630 ast_unref(self->precond);
632 ast_unref(self->postcond);
634 ast_unref(self->increment);
636 ast_unref(self->body);
637 ast_expression_delete((ast_expression*)self);
641 ast_call* ast_call_new(lex_ctx ctx,
642 ast_expression *funcexpr)
644 ast_instantiate(ast_call, ctx, ast_call_delete);
645 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
647 MEM_VECTOR_INIT(self, params);
649 self->func = funcexpr;
651 self->expression.vtype = funcexpr->expression.next->expression.vtype;
652 if (funcexpr->expression.next->expression.next)
653 self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
657 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
659 void ast_call_delete(ast_call *self)
662 for (i = 0; i < self->params_count; ++i)
663 ast_unref(self->params[i]);
664 MEM_VECTOR_CLEAR(self, params);
667 ast_unref(self->func);
669 ast_expression_delete((ast_expression*)self);
673 bool ast_call_check_types(ast_call *self)
677 const ast_expression *func = self->func;
678 size_t count = self->params_count;
679 if (count > func->expression.params_count)
680 count = func->expression.params_count;
682 for (i = 0; i < count; ++i) {
683 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
684 asterror(ast_ctx(self), "invalid type for parameter %u in function call",
685 (unsigned int)(i+1));
686 /* we don't immediately return */
693 ast_store* ast_store_new(lex_ctx ctx, int op,
694 ast_expression *dest, ast_expression *source)
696 ast_instantiate(ast_store, ctx, ast_store_delete);
697 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
701 self->source = source;
703 self->expression.vtype = dest->expression.vtype;
704 if (dest->expression.next) {
705 self->expression.next = ast_type_copy(ctx, dest);
706 if (!self->expression.next) {
712 self->expression.next = NULL;
717 void ast_store_delete(ast_store *self)
719 ast_unref(self->dest);
720 ast_unref(self->source);
721 ast_expression_delete((ast_expression*)self);
725 ast_block* ast_block_new(lex_ctx ctx)
727 ast_instantiate(ast_block, ctx, ast_block_delete);
728 ast_expression_init((ast_expression*)self,
729 (ast_expression_codegen*)&ast_block_codegen);
731 MEM_VECTOR_INIT(self, locals);
732 MEM_VECTOR_INIT(self, exprs);
733 MEM_VECTOR_INIT(self, collect);
737 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
738 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
739 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, collect)
741 bool ast_block_collect(ast_block *self, ast_expression *expr)
743 if (!ast_block_collect_add(self, expr))
745 expr->expression.node.keep = true;
749 void ast_block_delete(ast_block *self)
752 for (i = 0; i < self->exprs_count; ++i)
753 ast_unref(self->exprs[i]);
754 MEM_VECTOR_CLEAR(self, exprs);
755 for (i = 0; i < self->locals_count; ++i)
756 ast_delete(self->locals[i]);
757 MEM_VECTOR_CLEAR(self, locals);
758 for (i = 0; i < self->collect_count; ++i)
759 ast_delete(self->collect[i]);
760 MEM_VECTOR_CLEAR(self, collect);
761 ast_expression_delete((ast_expression*)self);
765 bool ast_block_set_type(ast_block *self, ast_expression *from)
767 if (self->expression.next)
768 ast_delete(self->expression.next);
769 self->expression.vtype = from->expression.vtype;
770 if (from->expression.next) {
771 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
772 if (!self->expression.next)
776 self->expression.next = NULL;
780 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
782 ast_instantiate(ast_function, ctx, ast_function_delete);
786 vtype->expression.vtype != TYPE_FUNCTION)
793 self->name = name ? util_strdup(name) : NULL;
794 MEM_VECTOR_INIT(self, blocks);
796 self->labelcount = 0;
799 self->ir_func = NULL;
800 self->curblock = NULL;
802 self->breakblock = NULL;
803 self->continueblock = NULL;
805 vtype->isconst = true;
806 vtype->constval.vfunc = self;
811 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
813 void ast_function_delete(ast_function *self)
817 mem_d((void*)self->name);
819 /* ast_value_delete(self->vtype); */
820 self->vtype->isconst = false;
821 self->vtype->constval.vfunc = NULL;
822 /* We use unref - if it was stored in a global table it is supposed
823 * to be deleted from *there*
825 ast_unref(self->vtype);
827 for (i = 0; i < self->blocks_count; ++i)
828 ast_delete(self->blocks[i]);
829 MEM_VECTOR_CLEAR(self, blocks);
833 const char* ast_function_label(ast_function *self, const char *prefix)
842 id = (self->labelcount++);
843 len = strlen(prefix);
845 from = self->labelbuf + sizeof(self->labelbuf)-1;
848 unsigned int digit = id % 10;
852 memcpy(from - len, prefix, len);
856 /*********************************************************************/
858 * by convention you must never pass NULL to the 'ir_value **out'
859 * parameter. If you really don't care about the output, pass a dummy.
860 * But I can't imagine a pituation where the output is truly unnecessary.
863 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
865 /* NOTE: This is the codegen for a variable used in an expression.
866 * It is not the codegen to generate the value. For this purpose,
867 * ast_local_codegen and ast_global_codegen are to be used before this
868 * is executed. ast_function_codegen should take care of its locals,
869 * and the ast-user should take care of ast_global_codegen to be used
870 * on all the globals.
873 asterror(ast_ctx(self), "ast_value used before generated (%s)", self->name);
880 bool ast_global_codegen(ast_value *self, ir_builder *ir)
883 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
885 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
888 func->context = ast_ctx(self);
889 func->value->context = ast_ctx(self);
891 self->constval.vfunc->ir_func = func;
892 self->ir_v = func->value;
893 /* The function is filled later on ast_function_codegen... */
897 if (self->expression.vtype == TYPE_FIELD) {
898 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
901 v->context = ast_ctx(self);
903 asterror(ast_ctx(self), "TODO: constant field pointers with value");
910 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
912 asterror(ast_ctx(self), "ir_builder_create_global failed");
915 v->context = ast_ctx(self);
918 switch (self->expression.vtype)
921 if (!ir_value_set_float(v, self->constval.vfloat))
925 if (!ir_value_set_vector(v, self->constval.vvec))
929 if (!ir_value_set_string(v, self->constval.vstring))
933 asterror(ast_ctx(self), "global of type function not properly generated");
935 /* Cannot generate an IR value for a function,
936 * need a pointer pointing to a function rather.
939 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
944 /* link us to the ir_value */
948 error: /* clean up */
953 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
956 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
958 /* Do we allow local functions? I think not...
959 * this is NOT a function pointer atm.
964 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
967 v->context = ast_ctx(self);
969 /* A constant local... hmmm...
970 * I suppose the IR will have to deal with this
973 switch (self->expression.vtype)
976 if (!ir_value_set_float(v, self->constval.vfloat))
980 if (!ir_value_set_vector(v, self->constval.vvec))
984 if (!ir_value_set_string(v, self->constval.vstring))
988 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
993 /* link us to the ir_value */
997 error: /* clean up */
1002 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1006 ast_expression_common *ec;
1009 irf = self->ir_func;
1011 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1015 /* fill the parameter list */
1016 ec = &self->vtype->expression;
1017 for (i = 0; i < ec->params_count; ++i)
1019 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
1021 if (!self->builtin) {
1022 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1027 if (self->builtin) {
1028 irf->builtin = self->builtin;
1032 if (!self->blocks_count) {
1033 asterror(ast_ctx(self), "function `%s` has no body", self->name);
1037 self->curblock = ir_function_create_block(irf, "entry");
1038 if (!self->curblock) {
1039 asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1043 for (i = 0; i < self->blocks_count; ++i) {
1044 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1045 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1049 /* TODO: check return types */
1050 if (!self->curblock->is_return)
1052 return ir_block_create_return(self->curblock, NULL);
1053 /* From now on the parser has to handle this situation */
1055 if (!self->vtype->expression.next ||
1056 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1058 return ir_block_create_return(self->curblock, NULL);
1062 /* error("missing return"); */
1063 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
1071 /* Note, you will not see ast_block_codegen generate ir_blocks.
1072 * To the AST and the IR, blocks are 2 different things.
1073 * In the AST it represents a block of code, usually enclosed in
1074 * curly braces {...}.
1075 * While in the IR it represents a block in terms of control-flow.
1077 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1081 /* We don't use this
1082 * Note: an ast-representation using the comma-operator
1083 * of the form: (a, b, c) = x should not assign to c...
1086 asterror(ast_ctx(self), "not an l-value (code-block)");
1090 if (self->expression.outr) {
1091 *out = self->expression.outr;
1095 /* output is NULL at first, we'll have each expression
1096 * assign to out output, thus, a comma-operator represention
1097 * using an ast_block will return the last generated value,
1098 * so: (b, c) + a executed both b and c, and returns c,
1099 * which is then added to a.
1103 /* generate locals */
1104 for (i = 0; i < self->locals_count; ++i)
1106 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1108 asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1113 for (i = 0; i < self->exprs_count; ++i)
1115 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1116 if (!(*gen)(self->exprs[i], func, false, out))
1120 self->expression.outr = *out;
1125 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1127 ast_expression_codegen *cgen;
1128 ir_value *left, *right;
1130 if (lvalue && self->expression.outl) {
1131 *out = self->expression.outl;
1135 if (!lvalue && self->expression.outr) {
1136 *out = self->expression.outr;
1140 cgen = self->dest->expression.codegen;
1142 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1144 self->expression.outl = left;
1146 cgen = self->source->expression.codegen;
1148 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1151 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1153 self->expression.outr = right;
1155 /* Theoretically, an assinment returns its left side as an
1156 * lvalue, if we don't need an lvalue though, we return
1157 * the right side as an rvalue, otherwise we have to
1158 * somehow know whether or not we need to dereference the pointer
1159 * on the left side - that is: OP_LOAD if it was an address.
1160 * Also: in original QC we cannot OP_LOADP *anyway*.
1162 *out = (lvalue ? left : right);
1167 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1169 ast_expression_codegen *cgen;
1170 ir_value *left, *right;
1172 /* A binary operation cannot yield an l-value */
1174 asterror(ast_ctx(self), "not an l-value (binop)");
1178 if (self->expression.outr) {
1179 *out = self->expression.outr;
1183 cgen = self->left->expression.codegen;
1185 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1188 cgen = self->right->expression.codegen;
1190 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1193 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1194 self->op, left, right);
1197 self->expression.outr = *out;
1202 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1204 ast_expression_codegen *cgen;
1205 ir_value *leftl, *leftr, *right, *bin;
1207 if (lvalue && self->expression.outl) {
1208 *out = self->expression.outl;
1212 if (!lvalue && self->expression.outr) {
1213 *out = self->expression.outr;
1217 /* for a binstore we need both an lvalue and an rvalue for the left side */
1218 /* rvalue of destination! */
1219 cgen = self->dest->expression.codegen;
1220 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1223 /* source as rvalue only */
1224 cgen = self->source->expression.codegen;
1225 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1228 /* now the binary */
1229 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1230 self->opbin, leftr, right);
1231 self->expression.outr = bin;
1233 /* now store them */
1234 cgen = self->dest->expression.codegen;
1235 /* lvalue of destination */
1236 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1238 self->expression.outl = leftl;
1240 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1242 self->expression.outr = bin;
1244 /* Theoretically, an assinment returns its left side as an
1245 * lvalue, if we don't need an lvalue though, we return
1246 * the right side as an rvalue, otherwise we have to
1247 * somehow know whether or not we need to dereference the pointer
1248 * on the left side - that is: OP_LOAD if it was an address.
1249 * Also: in original QC we cannot OP_LOADP *anyway*.
1251 *out = (lvalue ? leftl : bin);
1256 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1258 ast_expression_codegen *cgen;
1261 /* An unary operation cannot yield an l-value */
1263 asterror(ast_ctx(self), "not an l-value (binop)");
1267 if (self->expression.outr) {
1268 *out = self->expression.outr;
1272 cgen = self->operand->expression.codegen;
1274 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1277 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1281 self->expression.outr = *out;
1286 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1288 ast_expression_codegen *cgen;
1291 /* In the context of a return operation, we don't actually return
1295 asterror(ast_ctx(self), "return-expression is not an l-value");
1299 if (self->expression.outr) {
1300 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1303 self->expression.outr = (ir_value*)1;
1305 if (self->operand) {
1306 cgen = self->operand->expression.codegen;
1308 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1311 if (!ir_block_create_return(func->curblock, operand))
1314 if (!ir_block_create_return(func->curblock, NULL))
1321 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1323 ast_expression_codegen *cgen;
1324 ir_value *ent, *field;
1326 /* This function needs to take the 'lvalue' flag into account!
1327 * As lvalue we provide a field-pointer, as rvalue we provide the
1331 if (lvalue && self->expression.outl) {
1332 *out = self->expression.outl;
1336 if (!lvalue && self->expression.outr) {
1337 *out = self->expression.outr;
1341 cgen = self->entity->expression.codegen;
1342 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1345 cgen = self->field->expression.codegen;
1346 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1351 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1354 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1355 ent, field, self->expression.vtype);
1358 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1359 (lvalue ? "ADDRESS" : "FIELD"),
1360 type_name[self->expression.vtype]);
1365 self->expression.outl = *out;
1367 self->expression.outr = *out;
1369 /* Hm that should be it... */
1373 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1375 ast_expression_codegen *cgen;
1378 /* in QC this is always an lvalue */
1380 if (self->expression.outl) {
1381 *out = self->expression.outl;
1385 cgen = self->owner->expression.codegen;
1386 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1389 if (vec->vtype != TYPE_VECTOR &&
1390 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1395 *out = ir_value_vector_member(vec, self->field);
1396 self->expression.outl = *out;
1398 return (*out != NULL);
1401 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1403 ast_expression_codegen *cgen;
1408 ir_block *cond = func->curblock;
1411 ir_block *ontrue_endblock = NULL;
1412 ir_block *onfalse_endblock = NULL;
1415 /* We don't output any value, thus also don't care about r/lvalue */
1419 if (self->expression.outr) {
1420 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
1423 self->expression.outr = (ir_value*)1;
1425 /* generate the condition */
1426 func->curblock = cond;
1427 cgen = self->cond->expression.codegen;
1428 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1433 if (self->on_true) {
1434 /* create on-true block */
1435 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1439 /* enter the block */
1440 func->curblock = ontrue;
1443 cgen = self->on_true->expression.codegen;
1444 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1447 /* we now need to work from the current endpoint */
1448 ontrue_endblock = func->curblock;
1453 if (self->on_false) {
1454 /* create on-false block */
1455 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1459 /* enter the block */
1460 func->curblock = onfalse;
1463 cgen = self->on_false->expression.codegen;
1464 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1467 /* we now need to work from the current endpoint */
1468 onfalse_endblock = func->curblock;
1472 /* Merge block were they all merge in to */
1473 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1477 /* add jumps ot the merge block */
1478 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
1480 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
1483 /* we create the if here, that way all blocks are ordered :)
1485 if (!ir_block_create_if(cond, condval,
1486 (ontrue ? ontrue : merge),
1487 (onfalse ? onfalse : merge)))
1492 /* Now enter the merge block */
1493 func->curblock = merge;
1498 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1500 ast_expression_codegen *cgen;
1503 ir_value *trueval, *falseval;
1506 ir_block *cond = func->curblock;
1511 /* Ternary can never create an lvalue... */
1515 /* In theory it shouldn't be possible to pass through a node twice, but
1516 * in case we add any kind of optimization pass for the AST itself, it
1517 * may still happen, thus we remember a created ir_value and simply return one
1518 * if it already exists.
1520 if (self->phi_out) {
1521 *out = self->phi_out;
1525 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1527 /* generate the condition */
1528 func->curblock = cond;
1529 cgen = self->cond->expression.codegen;
1530 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1533 /* create on-true block */
1534 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1539 /* enter the block */
1540 func->curblock = ontrue;
1543 cgen = self->on_true->expression.codegen;
1544 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1548 /* create on-false block */
1549 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1554 /* enter the block */
1555 func->curblock = onfalse;
1558 cgen = self->on_false->expression.codegen;
1559 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1563 /* create merge block */
1564 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1567 /* jump to merge block */
1568 if (!ir_block_create_jump(ontrue, merge))
1570 if (!ir_block_create_jump(onfalse, merge))
1573 /* create if instruction */
1574 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1577 /* Now enter the merge block */
1578 func->curblock = merge;
1580 /* Here, now, we need a PHI node
1581 * but first some sanity checking...
1583 if (trueval->vtype != falseval->vtype) {
1584 /* error("ternary with different types on the two sides"); */
1589 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1591 !ir_phi_add(phi, ontrue, trueval) ||
1592 !ir_phi_add(phi, onfalse, falseval))
1597 self->phi_out = ir_phi_value(phi);
1598 *out = self->phi_out;
1603 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1605 ast_expression_codegen *cgen;
1607 ir_value *dummy = NULL;
1608 ir_value *precond = NULL;
1609 ir_value *postcond = NULL;
1611 /* Since we insert some jumps "late" so we have blocks
1612 * ordered "nicely", we need to keep track of the actual end-blocks
1613 * of expressions to add the jumps to.
1615 ir_block *bbody = NULL, *end_bbody = NULL;
1616 ir_block *bprecond = NULL, *end_bprecond = NULL;
1617 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1618 ir_block *bincrement = NULL, *end_bincrement = NULL;
1619 ir_block *bout = NULL, *bin = NULL;
1621 /* let's at least move the outgoing block to the end */
1624 /* 'break' and 'continue' need to be able to find the right blocks */
1625 ir_block *bcontinue = NULL;
1626 ir_block *bbreak = NULL;
1628 ir_block *old_bcontinue = NULL;
1629 ir_block *old_bbreak = NULL;
1631 ir_block *tmpblock = NULL;
1636 if (self->expression.outr) {
1637 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
1640 self->expression.outr = (ir_value*)1;
1643 * Should we ever need some kind of block ordering, better make this function
1644 * move blocks around than write a block ordering algorithm later... after all
1645 * the ast and ir should work together, not against each other.
1648 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1649 * anyway if for example it contains a ternary.
1653 cgen = self->initexpr->expression.codegen;
1654 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1658 /* Store the block from which we enter this chaos */
1659 bin = func->curblock;
1661 /* The pre-loop condition needs its own block since we
1662 * need to be able to jump to the start of that expression.
1666 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1670 /* the pre-loop-condition the least important place to 'continue' at */
1671 bcontinue = bprecond;
1674 func->curblock = bprecond;
1677 cgen = self->precond->expression.codegen;
1678 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1681 end_bprecond = func->curblock;
1683 bprecond = end_bprecond = NULL;
1686 /* Now the next blocks won't be ordered nicely, but we need to
1687 * generate them this early for 'break' and 'continue'.
1689 if (self->increment) {
1690 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1693 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1695 bincrement = end_bincrement = NULL;
1698 if (self->postcond) {
1699 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1702 bcontinue = bpostcond; /* postcond comes before the increment */
1704 bpostcond = end_bpostcond = NULL;
1707 bout_id = func->ir_func->blocks_count;
1708 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1713 /* The loop body... */
1716 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1721 func->curblock = bbody;
1723 old_bbreak = func->breakblock;
1724 old_bcontinue = func->continueblock;
1725 func->breakblock = bbreak;
1726 func->continueblock = bcontinue;
1729 cgen = self->body->expression.codegen;
1730 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1733 end_bbody = func->curblock;
1734 func->breakblock = old_bbreak;
1735 func->continueblock = old_bcontinue;
1738 /* post-loop-condition */
1742 func->curblock = bpostcond;
1745 cgen = self->postcond->expression.codegen;
1746 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1749 end_bpostcond = func->curblock;
1752 /* The incrementor */
1753 if (self->increment)
1756 func->curblock = bincrement;
1759 cgen = self->increment->expression.codegen;
1760 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1763 end_bincrement = func->curblock;
1766 /* In any case now, we continue from the outgoing block */
1767 func->curblock = bout;
1769 /* Now all blocks are in place */
1770 /* From 'bin' we jump to whatever comes first */
1771 if (bprecond) tmpblock = bprecond;
1772 else if (bbody) tmpblock = bbody;
1773 else if (bpostcond) tmpblock = bpostcond;
1774 else tmpblock = bout;
1775 if (!ir_block_create_jump(bin, tmpblock))
1781 ir_block *ontrue, *onfalse;
1782 if (bbody) ontrue = bbody;
1783 else if (bincrement) ontrue = bincrement;
1784 else if (bpostcond) ontrue = bpostcond;
1785 else ontrue = bprecond;
1787 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1794 if (bincrement) tmpblock = bincrement;
1795 else if (bpostcond) tmpblock = bpostcond;
1796 else if (bprecond) tmpblock = bprecond;
1797 else tmpblock = bout;
1798 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
1802 /* from increment */
1805 if (bpostcond) tmpblock = bpostcond;
1806 else if (bprecond) tmpblock = bprecond;
1807 else if (bbody) tmpblock = bbody;
1808 else tmpblock = bout;
1809 if (!ir_block_create_jump(end_bincrement, tmpblock))
1816 ir_block *ontrue, *onfalse;
1817 if (bprecond) ontrue = bprecond;
1818 else if (bbody) ontrue = bbody;
1819 else if (bincrement) ontrue = bincrement;
1820 else ontrue = bpostcond;
1822 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1826 /* Move 'bout' to the end */
1827 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1828 !ir_function_blocks_add(func->ir_func, bout))
1830 ir_block_delete(bout);
1837 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1839 ast_expression_codegen *cgen;
1840 ir_value_vector params;
1841 ir_instr *callinstr;
1844 ir_value *funval = NULL;
1846 /* return values are never lvalues */
1848 asterror(ast_ctx(self), "not an l-value (function call)");
1852 if (self->expression.outr) {
1853 *out = self->expression.outr;
1857 cgen = self->func->expression.codegen;
1858 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1863 MEM_VECTOR_INIT(¶ms, v);
1866 for (i = 0; i < self->params_count; ++i)
1869 ast_expression *expr = self->params[i];
1871 cgen = expr->expression.codegen;
1872 if (!(*cgen)(expr, func, false, ¶m))
1876 if (!ir_value_vector_v_add(¶ms, param))
1880 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1884 for (i = 0; i < params.v_count; ++i) {
1885 if (!ir_call_param(callinstr, params.v[i]))
1889 *out = ir_call_value(callinstr);
1890 self->expression.outr = *out;
1892 MEM_VECTOR_CLEAR(¶ms, v);
1895 MEM_VECTOR_CLEAR(¶ms, v);