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) {
491 asterror(ctx, "ast_entfield_new with expression not of type field");
496 outtype = field->expression.next;
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 const 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);
595 void ast_array_index_delete(ast_array_index *self)
597 ast_unref(self->array);
598 ast_unref(self->index);
599 ast_expression_delete((ast_expression*)self);
603 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
605 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
606 if (!ontrue && !onfalse) {
607 /* because it is invalid */
611 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
614 self->on_true = ontrue;
615 self->on_false = onfalse;
620 void ast_ifthen_delete(ast_ifthen *self)
622 ast_unref(self->cond);
624 ast_unref(self->on_true);
626 ast_unref(self->on_false);
627 ast_expression_delete((ast_expression*)self);
631 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
633 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
634 /* This time NEITHER must be NULL */
635 if (!ontrue || !onfalse) {
639 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
642 self->on_true = ontrue;
643 self->on_false = onfalse;
644 self->phi_out = NULL;
649 void ast_ternary_delete(ast_ternary *self)
651 ast_unref(self->cond);
652 ast_unref(self->on_true);
653 ast_unref(self->on_false);
654 ast_expression_delete((ast_expression*)self);
658 ast_loop* ast_loop_new(lex_ctx ctx,
659 ast_expression *initexpr,
660 ast_expression *precond,
661 ast_expression *postcond,
662 ast_expression *increment,
663 ast_expression *body)
665 ast_instantiate(ast_loop, ctx, ast_loop_delete);
666 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
668 self->initexpr = initexpr;
669 self->precond = precond;
670 self->postcond = postcond;
671 self->increment = increment;
677 void ast_loop_delete(ast_loop *self)
680 ast_unref(self->initexpr);
682 ast_unref(self->precond);
684 ast_unref(self->postcond);
686 ast_unref(self->increment);
688 ast_unref(self->body);
689 ast_expression_delete((ast_expression*)self);
693 ast_call* ast_call_new(lex_ctx ctx,
694 ast_expression *funcexpr)
696 ast_instantiate(ast_call, ctx, ast_call_delete);
697 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
699 MEM_VECTOR_INIT(self, params);
701 self->func = funcexpr;
703 self->expression.vtype = funcexpr->expression.next->expression.vtype;
704 if (funcexpr->expression.next->expression.next)
705 self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
709 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
711 void ast_call_delete(ast_call *self)
714 for (i = 0; i < self->params_count; ++i)
715 ast_unref(self->params[i]);
716 MEM_VECTOR_CLEAR(self, params);
719 ast_unref(self->func);
721 ast_expression_delete((ast_expression*)self);
725 bool ast_call_check_types(ast_call *self)
729 const ast_expression *func = self->func;
730 size_t count = self->params_count;
731 if (count > func->expression.params_count)
732 count = func->expression.params_count;
734 for (i = 0; i < count; ++i) {
735 if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
736 asterror(ast_ctx(self), "invalid type for parameter %u in function call",
737 (unsigned int)(i+1));
738 /* we don't immediately return */
745 ast_store* ast_store_new(lex_ctx ctx, int op,
746 ast_expression *dest, ast_expression *source)
748 ast_instantiate(ast_store, ctx, ast_store_delete);
749 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
753 self->source = source;
755 self->expression.vtype = dest->expression.vtype;
756 if (dest->expression.next) {
757 self->expression.next = ast_type_copy(ctx, dest);
758 if (!self->expression.next) {
764 self->expression.next = NULL;
769 void ast_store_delete(ast_store *self)
771 ast_unref(self->dest);
772 ast_unref(self->source);
773 ast_expression_delete((ast_expression*)self);
777 ast_block* ast_block_new(lex_ctx ctx)
779 ast_instantiate(ast_block, ctx, ast_block_delete);
780 ast_expression_init((ast_expression*)self,
781 (ast_expression_codegen*)&ast_block_codegen);
783 MEM_VECTOR_INIT(self, locals);
784 MEM_VECTOR_INIT(self, exprs);
785 MEM_VECTOR_INIT(self, collect);
789 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
790 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
791 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, collect)
793 bool ast_block_collect(ast_block *self, ast_expression *expr)
795 if (!ast_block_collect_add(self, expr))
797 expr->expression.node.keep = true;
801 void ast_block_delete(ast_block *self)
804 for (i = 0; i < self->exprs_count; ++i)
805 ast_unref(self->exprs[i]);
806 MEM_VECTOR_CLEAR(self, exprs);
807 for (i = 0; i < self->locals_count; ++i)
808 ast_delete(self->locals[i]);
809 MEM_VECTOR_CLEAR(self, locals);
810 for (i = 0; i < self->collect_count; ++i)
811 ast_delete(self->collect[i]);
812 MEM_VECTOR_CLEAR(self, collect);
813 ast_expression_delete((ast_expression*)self);
817 bool ast_block_set_type(ast_block *self, ast_expression *from)
819 if (self->expression.next)
820 ast_delete(self->expression.next);
821 self->expression.vtype = from->expression.vtype;
822 if (from->expression.next) {
823 self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
824 if (!self->expression.next)
828 self->expression.next = NULL;
832 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
834 ast_instantiate(ast_function, ctx, ast_function_delete);
838 vtype->expression.vtype != TYPE_FUNCTION)
845 self->name = name ? util_strdup(name) : NULL;
846 MEM_VECTOR_INIT(self, blocks);
848 self->labelcount = 0;
851 self->ir_func = NULL;
852 self->curblock = NULL;
854 self->breakblock = NULL;
855 self->continueblock = NULL;
857 vtype->isconst = true;
858 vtype->constval.vfunc = self;
863 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
865 void ast_function_delete(ast_function *self)
869 mem_d((void*)self->name);
871 /* ast_value_delete(self->vtype); */
872 self->vtype->isconst = false;
873 self->vtype->constval.vfunc = NULL;
874 /* We use unref - if it was stored in a global table it is supposed
875 * to be deleted from *there*
877 ast_unref(self->vtype);
879 for (i = 0; i < self->blocks_count; ++i)
880 ast_delete(self->blocks[i]);
881 MEM_VECTOR_CLEAR(self, blocks);
885 const char* ast_function_label(ast_function *self, const char *prefix)
894 id = (self->labelcount++);
895 len = strlen(prefix);
897 from = self->labelbuf + sizeof(self->labelbuf)-1;
900 unsigned int digit = id % 10;
904 memcpy(from - len, prefix, len);
908 /*********************************************************************/
910 * by convention you must never pass NULL to the 'ir_value **out'
911 * parameter. If you really don't care about the output, pass a dummy.
912 * But I can't imagine a pituation where the output is truly unnecessary.
915 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
917 /* NOTE: This is the codegen for a variable used in an expression.
918 * It is not the codegen to generate the value. For this purpose,
919 * ast_local_codegen and ast_global_codegen are to be used before this
920 * is executed. ast_function_codegen should take care of its locals,
921 * and the ast-user should take care of ast_global_codegen to be used
922 * on all the globals.
926 ast_type_to_string((ast_expression*)self, typename, sizeof(typename));
927 asterror(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name);
934 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
938 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
940 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
943 func->context = ast_ctx(self);
944 func->value->context = ast_ctx(self);
946 self->constval.vfunc->ir_func = func;
947 self->ir_v = func->value;
948 /* The function is filled later on ast_function_codegen... */
952 if (isfield && self->expression.vtype == TYPE_FIELD) {
953 ast_expression *fieldtype = self->expression.next;
956 asterror(ast_ctx(self), "TODO: constant field pointers with value");
960 if (fieldtype->expression.vtype == TYPE_ARRAY) {
965 ast_expression_common *elemtype;
967 ast_value *array = (ast_value*)fieldtype;
969 if (!ast_istype(fieldtype, ast_value)) {
970 asterror(ast_ctx(self), "internal error: ast_value required");
974 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
975 if (!array->expression.count || array->expression.count > opts_max_array_size)
976 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
978 elemtype = &array->expression.next->expression;
979 vtype = elemtype->vtype;
981 v = ir_builder_create_field(ir, self->name, vtype);
983 asterror(ast_ctx(self), "ir_builder_create_global failed");
986 if (vtype == TYPE_FIELD)
987 v->fieldtype = elemtype->next->expression.vtype;
988 v->context = ast_ctx(self);
989 array->ir_v = self->ir_v = v;
991 namelen = strlen(self->name);
992 name = (char*)mem_a(namelen + 16);
993 strcpy(name, self->name);
995 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
996 array->ir_values[0] = v;
997 for (ai = 1; ai < array->expression.count; ++ai) {
998 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
999 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1000 if (!array->ir_values[ai]) {
1002 asterror(ast_ctx(self), "ir_builder_create_global failed");
1005 if (vtype == TYPE_FIELD)
1006 array->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1007 array->ir_values[ai]->context = ast_ctx(self);
1013 v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
1016 v->context = ast_ctx(self);
1022 if (self->expression.vtype == TYPE_ARRAY) {
1027 ast_expression_common *elemtype = &self->expression.next->expression;
1028 int vtype = elemtype->vtype;
1030 /* same as with field arrays */
1031 if (!self->expression.count || self->expression.count > opts_max_array_size)
1032 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1034 v = ir_builder_create_global(ir, self->name, vtype);
1036 asterror(ast_ctx(self), "ir_builder_create_global failed");
1039 if (vtype == TYPE_FIELD)
1040 v->fieldtype = elemtype->next->expression.vtype;
1041 v->context = ast_ctx(self);
1043 namelen = strlen(self->name);
1044 name = (char*)mem_a(namelen + 16);
1045 strcpy(name, self->name);
1047 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1048 self->ir_values[0] = v;
1049 for (ai = 1; ai < self->expression.count; ++ai) {
1050 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1051 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1052 if (!self->ir_values[ai]) {
1054 asterror(ast_ctx(self), "ir_builder_create_global failed");
1057 if (vtype == TYPE_FIELD)
1058 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1059 self->ir_values[ai]->context = ast_ctx(self);
1065 /* Arrays don't do this since there's no "array" value which spans across the
1068 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1070 asterror(ast_ctx(self), "ir_builder_create_global failed");
1073 if (self->expression.vtype == TYPE_FIELD)
1074 v->fieldtype = self->expression.next->expression.vtype;
1075 v->context = ast_ctx(self);
1078 if (self->isconst) {
1079 switch (self->expression.vtype)
1082 if (!ir_value_set_float(v, self->constval.vfloat))
1086 if (!ir_value_set_vector(v, self->constval.vvec))
1090 if (!ir_value_set_string(v, self->constval.vstring))
1094 asterror(ast_ctx(self), "TODO: global constant array");
1097 asterror(ast_ctx(self), "global of type function not properly generated");
1099 /* Cannot generate an IR value for a function,
1100 * need a pointer pointing to a function rather.
1103 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1108 /* link us to the ir_value */
1112 error: /* clean up */
1117 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1120 if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
1122 /* Do we allow local functions? I think not...
1123 * this is NOT a function pointer atm.
1128 if (self->expression.vtype == TYPE_ARRAY) {
1133 ast_expression_common *elemtype = &self->expression.next->expression;
1134 int vtype = elemtype->vtype;
1137 asterror(ast_ctx(self), "array-parameters are not supported");
1141 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1142 if (!self->expression.count || self->expression.count > opts_max_array_size) {
1143 asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1146 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1147 if (!self->ir_values) {
1148 asterror(ast_ctx(self), "failed to allocate array values");
1152 v = ir_function_create_local(func, self->name, vtype, param);
1154 asterror(ast_ctx(self), "ir_function_create_local failed");
1157 if (vtype == TYPE_FIELD)
1158 v->fieldtype = elemtype->next->expression.vtype;
1159 v->context = ast_ctx(self);
1161 namelen = strlen(self->name);
1162 name = (char*)mem_a(namelen + 16);
1163 strcpy(name, self->name);
1165 self->ir_values[0] = v;
1166 for (ai = 1; ai < self->expression.count; ++ai) {
1167 snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1168 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1169 if (!self->ir_values[ai]) {
1170 asterror(ast_ctx(self), "ir_builder_create_global failed");
1173 if (vtype == TYPE_FIELD)
1174 self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype;
1175 self->ir_values[ai]->context = ast_ctx(self);
1180 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1183 if (self->expression.vtype == TYPE_FIELD)
1184 v->fieldtype = self->expression.next->expression.vtype;
1185 v->context = ast_ctx(self);
1188 /* A constant local... hmmm...
1189 * I suppose the IR will have to deal with this
1191 if (self->isconst) {
1192 switch (self->expression.vtype)
1195 if (!ir_value_set_float(v, self->constval.vfloat))
1199 if (!ir_value_set_vector(v, self->constval.vvec))
1203 if (!ir_value_set_string(v, self->constval.vstring))
1207 asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1212 /* link us to the ir_value */
1216 if (!ast_global_codegen(self->setter, func->owner, false) ||
1217 !ast_function_codegen(self->setter->constval.vfunc, func->owner) ||
1218 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1222 if (!ast_global_codegen(self->getter, func->owner, false) ||
1223 !ast_function_codegen(self->getter->constval.vfunc, func->owner) ||
1224 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1229 error: /* clean up */
1234 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1238 ast_expression_common *ec;
1241 irf = self->ir_func;
1243 asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet");
1247 /* fill the parameter list */
1248 ec = &self->vtype->expression;
1249 for (i = 0; i < ec->params_count; ++i)
1251 if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
1253 if (!self->builtin) {
1254 if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1259 if (self->builtin) {
1260 irf->builtin = self->builtin;
1264 if (!self->blocks_count) {
1265 asterror(ast_ctx(self), "function `%s` has no body", self->name);
1269 self->curblock = ir_function_create_block(irf, "entry");
1270 if (!self->curblock) {
1271 asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1275 for (i = 0; i < self->blocks_count; ++i) {
1276 ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
1277 if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
1281 /* TODO: check return types */
1282 if (!self->curblock->is_return)
1284 return ir_block_create_return(self->curblock, NULL);
1285 /* From now on the parser has to handle this situation */
1287 if (!self->vtype->expression.next ||
1288 self->vtype->expression.next->expression.vtype == TYPE_VOID)
1290 return ir_block_create_return(self->curblock, NULL);
1294 /* error("missing return"); */
1295 asterror(ast_ctx(self), "function `%s` missing return value", self->name);
1303 /* Note, you will not see ast_block_codegen generate ir_blocks.
1304 * To the AST and the IR, blocks are 2 different things.
1305 * In the AST it represents a block of code, usually enclosed in
1306 * curly braces {...}.
1307 * While in the IR it represents a block in terms of control-flow.
1309 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1313 /* We don't use this
1314 * Note: an ast-representation using the comma-operator
1315 * of the form: (a, b, c) = x should not assign to c...
1318 asterror(ast_ctx(self), "not an l-value (code-block)");
1322 if (self->expression.outr) {
1323 *out = self->expression.outr;
1327 /* output is NULL at first, we'll have each expression
1328 * assign to out output, thus, a comma-operator represention
1329 * using an ast_block will return the last generated value,
1330 * so: (b, c) + a executed both b and c, and returns c,
1331 * which is then added to a.
1335 /* generate locals */
1336 for (i = 0; i < self->locals_count; ++i)
1338 if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1340 asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1345 for (i = 0; i < self->exprs_count; ++i)
1347 ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
1348 if (!(*gen)(self->exprs[i], func, false, out))
1352 self->expression.outr = *out;
1357 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1359 ast_expression_codegen *cgen;
1360 ir_value *left, *right;
1364 ast_array_index *ai = NULL;
1366 if (lvalue && self->expression.outl) {
1367 *out = self->expression.outl;
1371 if (!lvalue && self->expression.outr) {
1372 *out = self->expression.outr;
1376 if (ast_istype(self->dest, ast_array_index))
1379 ai = (ast_array_index*)self->dest;
1380 idx = (ast_value*)ai->index;
1382 if (ast_istype(ai->index, ast_value) && idx->isconst)
1387 /* we need to call the setter */
1388 ir_value *iridx, *funval;
1392 asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1396 arr = (ast_value*)ai->array;
1397 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1398 asterror(ast_ctx(self), "value has no setter (%s)", arr->name);
1402 cgen = idx->expression.codegen;
1403 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1406 cgen = arr->setter->expression.codegen;
1407 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1410 cgen = self->source->expression.codegen;
1411 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1414 call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval);
1417 if (!ir_call_param(call, iridx))
1419 if (!ir_call_param(call, right))
1421 self->expression.outr = right;
1427 cgen = self->dest->expression.codegen;
1429 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1431 self->expression.outl = left;
1433 cgen = self->source->expression.codegen;
1435 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1438 if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1440 self->expression.outr = right;
1443 /* Theoretically, an assinment returns its left side as an
1444 * lvalue, if we don't need an lvalue though, we return
1445 * the right side as an rvalue, otherwise we have to
1446 * somehow know whether or not we need to dereference the pointer
1447 * on the left side - that is: OP_LOAD if it was an address.
1448 * Also: in original QC we cannot OP_LOADP *anyway*.
1450 *out = (lvalue ? left : right);
1455 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1457 ast_expression_codegen *cgen;
1458 ir_value *left, *right;
1460 /* A binary operation cannot yield an l-value */
1462 asterror(ast_ctx(self), "not an l-value (binop)");
1466 if (self->expression.outr) {
1467 *out = self->expression.outr;
1471 cgen = self->left->expression.codegen;
1473 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1476 cgen = self->right->expression.codegen;
1478 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1481 *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1482 self->op, left, right);
1485 self->expression.outr = *out;
1490 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1492 ast_expression_codegen *cgen;
1493 ir_value *leftl, *leftr, *right, *bin;
1495 if (lvalue && self->expression.outl) {
1496 *out = self->expression.outl;
1500 if (!lvalue && self->expression.outr) {
1501 *out = self->expression.outr;
1505 /* for a binstore we need both an lvalue and an rvalue for the left side */
1506 /* rvalue of destination! */
1507 cgen = self->dest->expression.codegen;
1508 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1511 /* source as rvalue only */
1512 cgen = self->source->expression.codegen;
1513 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1516 /* now the binary */
1517 bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1518 self->opbin, leftr, right);
1519 self->expression.outr = bin;
1521 /* now store them */
1522 cgen = self->dest->expression.codegen;
1523 /* lvalue of destination */
1524 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1526 self->expression.outl = leftl;
1528 if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1530 self->expression.outr = bin;
1532 /* Theoretically, an assinment returns its left side as an
1533 * lvalue, if we don't need an lvalue though, we return
1534 * the right side as an rvalue, otherwise we have to
1535 * somehow know whether or not we need to dereference the pointer
1536 * on the left side - that is: OP_LOAD if it was an address.
1537 * Also: in original QC we cannot OP_LOADP *anyway*.
1539 *out = (lvalue ? leftl : bin);
1544 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1546 ast_expression_codegen *cgen;
1549 /* An unary operation cannot yield an l-value */
1551 asterror(ast_ctx(self), "not an l-value (binop)");
1555 if (self->expression.outr) {
1556 *out = self->expression.outr;
1560 cgen = self->operand->expression.codegen;
1562 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1565 *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1569 self->expression.outr = *out;
1574 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1576 ast_expression_codegen *cgen;
1579 /* In the context of a return operation, we don't actually return
1583 asterror(ast_ctx(self), "return-expression is not an l-value");
1587 if (self->expression.outr) {
1588 asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
1591 self->expression.outr = (ir_value*)1;
1593 if (self->operand) {
1594 cgen = self->operand->expression.codegen;
1596 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1599 if (!ir_block_create_return(func->curblock, operand))
1602 if (!ir_block_create_return(func->curblock, NULL))
1609 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1611 ast_expression_codegen *cgen;
1612 ir_value *ent, *field;
1614 /* This function needs to take the 'lvalue' flag into account!
1615 * As lvalue we provide a field-pointer, as rvalue we provide the
1619 if (lvalue && self->expression.outl) {
1620 *out = self->expression.outl;
1624 if (!lvalue && self->expression.outr) {
1625 *out = self->expression.outr;
1629 cgen = self->entity->expression.codegen;
1630 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1633 cgen = self->field->expression.codegen;
1634 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1639 *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1642 *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1643 ent, field, self->expression.vtype);
1646 asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1647 (lvalue ? "ADDRESS" : "FIELD"),
1648 type_name[self->expression.vtype]);
1653 self->expression.outl = *out;
1655 self->expression.outr = *out;
1657 /* Hm that should be it... */
1661 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1663 ast_expression_codegen *cgen;
1666 /* in QC this is always an lvalue */
1668 if (self->expression.outl) {
1669 *out = self->expression.outl;
1673 cgen = self->owner->expression.codegen;
1674 if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1677 if (vec->vtype != TYPE_VECTOR &&
1678 !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1683 *out = ir_value_vector_member(vec, self->field);
1684 self->expression.outl = *out;
1686 return (*out != NULL);
1689 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
1694 if (!lvalue && self->expression.outr) {
1695 *out = self->expression.outr;
1697 if (lvalue && self->expression.outl) {
1698 *out = self->expression.outl;
1701 if (!ast_istype(self->array, ast_value)) {
1702 asterror(ast_ctx(self), "array indexing this way is not supported");
1703 /* note this would actually be pointer indexing because the left side is
1704 * not an actual array but (hopefully) an indexable expression.
1705 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
1706 * support this path will be filled.
1711 arr = (ast_value*)self->array;
1712 idx = (ast_value*)self->index;
1714 if (!ast_istype(self->index, ast_value) || !idx->isconst) {
1715 /* Time to use accessor functions */
1716 ast_expression_codegen *cgen;
1717 ir_value *iridx, *funval;
1721 asterror(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
1726 asterror(ast_ctx(self), "value has no getter, don't know how to index it");
1730 cgen = self->index->expression.codegen;
1731 if (!(*cgen)((ast_expression*)(self->index), func, true, &iridx))
1734 cgen = arr->getter->expression.codegen;
1735 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
1738 call = ir_block_create_call(func->curblock, ast_function_label(func, "fetch"), funval);
1741 if (!ir_call_param(call, iridx))
1744 *out = ir_call_value(call);
1745 self->expression.outr = *out;
1749 if (idx->expression.vtype == TYPE_FLOAT)
1750 *out = arr->ir_values[(int)idx->constval.vfloat];
1751 else if (idx->expression.vtype == TYPE_INTEGER)
1752 *out = arr->ir_values[idx->constval.vint];
1754 asterror(ast_ctx(self), "array indexing here needs an integer constant");
1760 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1762 ast_expression_codegen *cgen;
1767 ir_block *cond = func->curblock;
1770 ir_block *ontrue_endblock = NULL;
1771 ir_block *onfalse_endblock = NULL;
1774 /* We don't output any value, thus also don't care about r/lvalue */
1778 if (self->expression.outr) {
1779 asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
1782 self->expression.outr = (ir_value*)1;
1784 /* generate the condition */
1785 func->curblock = cond;
1786 cgen = self->cond->expression.codegen;
1787 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1792 if (self->on_true) {
1793 /* create on-true block */
1794 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1798 /* enter the block */
1799 func->curblock = ontrue;
1802 cgen = self->on_true->expression.codegen;
1803 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1806 /* we now need to work from the current endpoint */
1807 ontrue_endblock = func->curblock;
1812 if (self->on_false) {
1813 /* create on-false block */
1814 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1818 /* enter the block */
1819 func->curblock = onfalse;
1822 cgen = self->on_false->expression.codegen;
1823 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1826 /* we now need to work from the current endpoint */
1827 onfalse_endblock = func->curblock;
1831 /* Merge block were they all merge in to */
1832 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1836 /* add jumps ot the merge block */
1837 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
1839 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, merge))
1842 /* we create the if here, that way all blocks are ordered :)
1844 if (!ir_block_create_if(cond, condval,
1845 (ontrue ? ontrue : merge),
1846 (onfalse ? onfalse : merge)))
1851 /* Now enter the merge block */
1852 func->curblock = merge;
1857 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1859 ast_expression_codegen *cgen;
1862 ir_value *trueval, *falseval;
1865 ir_block *cond = func->curblock;
1870 /* Ternary can never create an lvalue... */
1874 /* In theory it shouldn't be possible to pass through a node twice, but
1875 * in case we add any kind of optimization pass for the AST itself, it
1876 * may still happen, thus we remember a created ir_value and simply return one
1877 * if it already exists.
1879 if (self->phi_out) {
1880 *out = self->phi_out;
1884 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1886 /* generate the condition */
1887 func->curblock = cond;
1888 cgen = self->cond->expression.codegen;
1889 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1892 /* create on-true block */
1893 ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1898 /* enter the block */
1899 func->curblock = ontrue;
1902 cgen = self->on_true->expression.codegen;
1903 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1907 /* create on-false block */
1908 onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1913 /* enter the block */
1914 func->curblock = onfalse;
1917 cgen = self->on_false->expression.codegen;
1918 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1922 /* create merge block */
1923 merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1926 /* jump to merge block */
1927 if (!ir_block_create_jump(ontrue, merge))
1929 if (!ir_block_create_jump(onfalse, merge))
1932 /* create if instruction */
1933 if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1936 /* Now enter the merge block */
1937 func->curblock = merge;
1939 /* Here, now, we need a PHI node
1940 * but first some sanity checking...
1942 if (trueval->vtype != falseval->vtype) {
1943 /* error("ternary with different types on the two sides"); */
1948 phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1950 !ir_phi_add(phi, ontrue, trueval) ||
1951 !ir_phi_add(phi, onfalse, falseval))
1956 self->phi_out = ir_phi_value(phi);
1957 *out = self->phi_out;
1962 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1964 ast_expression_codegen *cgen;
1966 ir_value *dummy = NULL;
1967 ir_value *precond = NULL;
1968 ir_value *postcond = NULL;
1970 /* Since we insert some jumps "late" so we have blocks
1971 * ordered "nicely", we need to keep track of the actual end-blocks
1972 * of expressions to add the jumps to.
1974 ir_block *bbody = NULL, *end_bbody = NULL;
1975 ir_block *bprecond = NULL, *end_bprecond = NULL;
1976 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
1977 ir_block *bincrement = NULL, *end_bincrement = NULL;
1978 ir_block *bout = NULL, *bin = NULL;
1980 /* let's at least move the outgoing block to the end */
1983 /* 'break' and 'continue' need to be able to find the right blocks */
1984 ir_block *bcontinue = NULL;
1985 ir_block *bbreak = NULL;
1987 ir_block *old_bcontinue = NULL;
1988 ir_block *old_bbreak = NULL;
1990 ir_block *tmpblock = NULL;
1995 if (self->expression.outr) {
1996 asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
1999 self->expression.outr = (ir_value*)1;
2002 * Should we ever need some kind of block ordering, better make this function
2003 * move blocks around than write a block ordering algorithm later... after all
2004 * the ast and ir should work together, not against each other.
2007 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2008 * anyway if for example it contains a ternary.
2012 cgen = self->initexpr->expression.codegen;
2013 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2017 /* Store the block from which we enter this chaos */
2018 bin = func->curblock;
2020 /* The pre-loop condition needs its own block since we
2021 * need to be able to jump to the start of that expression.
2025 bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
2029 /* the pre-loop-condition the least important place to 'continue' at */
2030 bcontinue = bprecond;
2033 func->curblock = bprecond;
2036 cgen = self->precond->expression.codegen;
2037 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2040 end_bprecond = func->curblock;
2042 bprecond = end_bprecond = NULL;
2045 /* Now the next blocks won't be ordered nicely, but we need to
2046 * generate them this early for 'break' and 'continue'.
2048 if (self->increment) {
2049 bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
2052 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2054 bincrement = end_bincrement = NULL;
2057 if (self->postcond) {
2058 bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
2061 bcontinue = bpostcond; /* postcond comes before the increment */
2063 bpostcond = end_bpostcond = NULL;
2066 bout_id = func->ir_func->blocks_count;
2067 bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
2072 /* The loop body... */
2075 bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
2080 func->curblock = bbody;
2082 old_bbreak = func->breakblock;
2083 old_bcontinue = func->continueblock;
2084 func->breakblock = bbreak;
2085 func->continueblock = bcontinue;
2088 cgen = self->body->expression.codegen;
2089 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2092 end_bbody = func->curblock;
2093 func->breakblock = old_bbreak;
2094 func->continueblock = old_bcontinue;
2097 /* post-loop-condition */
2101 func->curblock = bpostcond;
2104 cgen = self->postcond->expression.codegen;
2105 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2108 end_bpostcond = func->curblock;
2111 /* The incrementor */
2112 if (self->increment)
2115 func->curblock = bincrement;
2118 cgen = self->increment->expression.codegen;
2119 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2122 end_bincrement = func->curblock;
2125 /* In any case now, we continue from the outgoing block */
2126 func->curblock = bout;
2128 /* Now all blocks are in place */
2129 /* From 'bin' we jump to whatever comes first */
2130 if (bprecond) tmpblock = bprecond;
2131 else if (bbody) tmpblock = bbody;
2132 else if (bpostcond) tmpblock = bpostcond;
2133 else tmpblock = bout;
2134 if (!ir_block_create_jump(bin, tmpblock))
2140 ir_block *ontrue, *onfalse;
2141 if (bbody) ontrue = bbody;
2142 else if (bincrement) ontrue = bincrement;
2143 else if (bpostcond) ontrue = bpostcond;
2144 else ontrue = bprecond;
2146 if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
2153 if (bincrement) tmpblock = bincrement;
2154 else if (bpostcond) tmpblock = bpostcond;
2155 else if (bprecond) tmpblock = bprecond;
2156 else tmpblock = bout;
2157 if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
2161 /* from increment */
2164 if (bpostcond) tmpblock = bpostcond;
2165 else if (bprecond) tmpblock = bprecond;
2166 else if (bbody) tmpblock = bbody;
2167 else tmpblock = bout;
2168 if (!ir_block_create_jump(end_bincrement, tmpblock))
2175 ir_block *ontrue, *onfalse;
2176 if (bprecond) ontrue = bprecond;
2177 else if (bbody) ontrue = bbody;
2178 else if (bincrement) ontrue = bincrement;
2179 else ontrue = bpostcond;
2181 if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
2185 /* Move 'bout' to the end */
2186 if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
2187 !ir_function_blocks_add(func->ir_func, bout))
2189 ir_block_delete(bout);
2196 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
2198 ast_expression_codegen *cgen;
2199 ir_value_vector params;
2200 ir_instr *callinstr;
2203 ir_value *funval = NULL;
2205 /* return values are never lvalues */
2207 asterror(ast_ctx(self), "not an l-value (function call)");
2211 if (self->expression.outr) {
2212 *out = self->expression.outr;
2216 cgen = self->func->expression.codegen;
2217 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
2222 MEM_VECTOR_INIT(¶ms, v);
2225 for (i = 0; i < self->params_count; ++i)
2228 ast_expression *expr = self->params[i];
2230 cgen = expr->expression.codegen;
2231 if (!(*cgen)(expr, func, false, ¶m))
2235 if (!ir_value_vector_v_add(¶ms, param))
2239 callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
2243 for (i = 0; i < params.v_count; ++i) {
2244 if (!ir_call_param(callinstr, params.v[i]))
2248 *out = ir_call_value(callinstr);
2249 self->expression.outr = *out;
2251 MEM_VECTOR_CLEAR(¶ms, v);
2254 MEM_VECTOR_CLEAR(¶ms, v);