10 #define ast_instantiate(T, ctx, destroyfn) \
11 T* self = (T*)mem_a(sizeof(T)); \
16 ast_node_init((ast_node*)self, ctx, TYPE_##T); \
17 ( (ast_node*)self )->destroy = (ast_node_delete*)destroyfn
20 * forward declarations, these need not be in ast.h for obvious
23 static bool ast_member_codegen(ast_member*, ast_function*, bool lvalue, ir_value**);
24 static void ast_array_index_delete(ast_array_index*);
25 static bool ast_array_index_codegen(ast_array_index*, ast_function*, bool lvalue, ir_value**);
26 static void ast_argpipe_delete(ast_argpipe*);
27 static bool ast_argpipe_codegen(ast_argpipe*, ast_function*, bool lvalue, ir_value**);
28 static void ast_store_delete(ast_store*);
29 static bool ast_store_codegen(ast_store*, ast_function*, bool lvalue, ir_value**);
30 static void ast_ifthen_delete(ast_ifthen*);
31 static bool ast_ifthen_codegen(ast_ifthen*, ast_function*, bool lvalue, ir_value**);
32 static void ast_ternary_delete(ast_ternary*);
33 static bool ast_ternary_codegen(ast_ternary*, ast_function*, bool lvalue, ir_value**);
34 static void ast_loop_delete(ast_loop*);
35 static bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**);
36 static void ast_breakcont_delete(ast_breakcont*);
37 static bool ast_breakcont_codegen(ast_breakcont*, ast_function*, bool lvalue, ir_value**);
38 static void ast_switch_delete(ast_switch*);
39 static bool ast_switch_codegen(ast_switch*, ast_function*, bool lvalue, ir_value**);
40 static void ast_label_delete(ast_label*);
41 static void ast_label_register_goto(ast_label*, ast_goto*);
42 static bool ast_label_codegen(ast_label*, ast_function*, bool lvalue, ir_value**);
43 static bool ast_goto_codegen(ast_goto*, ast_function*, bool lvalue, ir_value**);
44 static void ast_goto_delete(ast_goto*);
45 static void ast_call_delete(ast_call*);
46 static bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**);
47 static bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**);
48 static void ast_unary_delete(ast_unary*);
49 static bool ast_unary_codegen(ast_unary*, ast_function*, bool lvalue, ir_value**);
50 static void ast_entfield_delete(ast_entfield*);
51 static bool ast_entfield_codegen(ast_entfield*, ast_function*, bool lvalue, ir_value**);
52 static void ast_return_delete(ast_return*);
53 static bool ast_return_codegen(ast_return*, ast_function*, bool lvalue, ir_value**);
54 static void ast_binstore_delete(ast_binstore*);
55 static bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**);
56 static void ast_binary_delete(ast_binary*);
57 static bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**);
58 static bool ast_state_codegen(ast_state*, ast_function*, bool lvalue, ir_value**);
60 /* It must not be possible to get here. */
61 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
64 con_err("ast node missing destroy()\n");
68 /* Initialize main ast node aprts */
69 static void ast_node_init(ast_node *self, lex_ctx_t ctx, int nodetype)
72 self->destroy = &_ast_node_destroy;
74 self->nodetype = nodetype;
75 self->side_effects = false;
78 /* weight and side effects */
79 static void _ast_propagate_effects(ast_node *self, ast_node *other)
81 if (ast_side_effects(other))
82 ast_side_effects(self) = true;
84 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
86 /* General expression initialization */
87 static void ast_expression_init(ast_expression *self,
88 ast_expression_codegen *codegen)
90 self->codegen = codegen;
91 self->vtype = TYPE_VOID;
96 self->varparam = NULL;
98 if (OPTS_OPTION_BOOL(OPTION_COVERAGE))
99 self->flags |= AST_FLAG_BLOCK_COVERAGE;
102 static void ast_expression_delete(ast_expression *self)
105 ast_delete(self->next);
106 for (auto &it : self->params)
109 ast_delete(self->varparam);
112 static void ast_expression_delete_full(ast_expression *self)
114 ast_expression_delete(self);
118 ast_value* ast_value_copy(const ast_value *self)
120 const ast_expression *fromex;
121 ast_expression *selfex;
122 ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
123 if (self->expression.next) {
124 cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
126 fromex = &self->expression;
127 selfex = &cp->expression;
128 selfex->count = fromex->count;
129 selfex->flags = fromex->flags;
130 for (auto &it : fromex->params) {
131 ast_value *v = ast_value_copy(it);
132 selfex->params.push_back(v);
137 void ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
139 const ast_expression *fromex;
140 ast_expression *selfex;
141 self->vtype = other->vtype;
143 self->next = (ast_expression*)ast_type_copy(ast_ctx(self), other->next);
147 selfex->count = fromex->count;
148 selfex->flags = fromex->flags;
149 for (auto &it : fromex->params) {
150 ast_value *v = ast_value_copy(it);
151 selfex->params.push_back(v);
155 static ast_expression* ast_shallow_type(lex_ctx_t ctx, int vtype)
157 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
158 ast_expression_init(self, NULL);
159 self->codegen = NULL;
165 ast_expression* ast_type_copy(lex_ctx_t ctx, const ast_expression *ex)
167 const ast_expression *fromex;
168 ast_expression *selfex;
174 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
175 ast_expression_init(self, NULL);
180 /* This may never be codegen()d */
181 selfex->codegen = NULL;
183 selfex->vtype = fromex->vtype;
185 selfex->next = ast_type_copy(ctx, fromex->next);
189 selfex->count = fromex->count;
190 selfex->flags = fromex->flags;
191 for (auto &it : fromex->params) {
192 ast_value *v = ast_value_copy(it);
193 selfex->params.push_back(v);
200 bool ast_compare_type(ast_expression *a, ast_expression *b)
202 if (a->vtype == TYPE_NIL ||
203 b->vtype == TYPE_NIL)
205 if (a->vtype != b->vtype)
207 if (!a->next != !b->next)
209 if (a->params.size() != b->params.size())
211 if ((a->flags & AST_FLAG_TYPE_MASK) !=
212 (b->flags & AST_FLAG_TYPE_MASK) )
216 if (a->params.size()) {
218 for (i = 0; i < a->params.size(); ++i) {
219 if (!ast_compare_type((ast_expression*)a->params[i],
220 (ast_expression*)b->params[i]))
225 return ast_compare_type(a->next, b->next);
229 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
236 if (pos + 6 >= bufsize)
238 util_strncpy(buf + pos, "(null)", 6);
242 if (pos + 1 >= bufsize)
247 util_strncpy(buf + pos, "(variant)", 9);
252 return ast_type_to_string_impl(e->next, buf, bufsize, pos);
255 if (pos + 3 >= bufsize)
259 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
260 if (pos + 1 >= bufsize)
266 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
267 if (pos + 2 >= bufsize)
269 if (e->params.empty()) {
275 pos = ast_type_to_string_impl((ast_expression*)(e->params[0]), buf, bufsize, pos);
276 for (i = 1; i < e->params.size(); ++i) {
277 if (pos + 2 >= bufsize)
281 pos = ast_type_to_string_impl((ast_expression*)(e->params[i]), buf, bufsize, pos);
283 if (pos + 1 >= bufsize)
289 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
290 if (pos + 1 >= bufsize)
293 pos += util_snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->count);
294 if (pos + 1 >= bufsize)
300 typestr = type_name[e->vtype];
301 typelen = strlen(typestr);
302 if (pos + typelen >= bufsize)
304 util_strncpy(buf + pos, typestr, typelen);
305 return pos + typelen;
309 buf[bufsize-3] = '.';
310 buf[bufsize-2] = '.';
311 buf[bufsize-1] = '.';
315 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
317 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
321 static bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out);
322 ast_value* ast_value_new(lex_ctx_t ctx, const char *name, int t)
324 ast_instantiate(ast_value, ctx, ast_value_delete);
325 ast_expression_init((ast_expression*)self,
326 (ast_expression_codegen*)&ast_value_codegen);
327 self->expression.node.keep = true; /* keep */
329 self->name = name ? util_strdup(name) : NULL;
330 self->expression.vtype = t;
331 self->expression.next = NULL;
332 self->isfield = false;
334 self->hasvalue = false;
336 self->inexact = false;
338 memset(&self->constval, 0, sizeof(self->constval));
341 self->ir_values = NULL;
342 self->ir_value_count = 0;
348 self->argcounter = NULL;
349 self->intrinsic = false;
354 void ast_value_delete(ast_value* self)
357 mem_d((void*)self->name);
358 if (self->argcounter)
359 mem_d((void*)self->argcounter);
360 if (self->hasvalue) {
361 switch (self->expression.vtype)
364 mem_d((void*)self->constval.vstring);
367 /* unlink us from the function node */
368 self->constval.vfunc->vtype = NULL;
370 /* NOTE: delete function? currently collected in
371 * the parser structure
378 mem_d(self->ir_values);
383 // initlist imples an array which implies .next in the expression exists.
384 if (self->initlist.size() && self->expression.next->vtype == TYPE_STRING) {
385 for (auto &it : self->initlist)
390 ast_expression_delete((ast_expression*)self);
394 void ast_value_params_add(ast_value *self, ast_value *p)
396 self->expression.params.push_back(p);
399 bool ast_value_set_name(ast_value *self, const char *name)
402 mem_d((void*)self->name);
403 self->name = util_strdup(name);
407 ast_binary* ast_binary_new(lex_ctx_t ctx, int op,
408 ast_expression* left, ast_expression* right)
410 ast_instantiate(ast_binary, ctx, ast_binary_delete);
411 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
413 if (ast_istype(right, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
414 ast_unary *unary = ((ast_unary*)right);
415 ast_expression *normal = unary->operand;
417 /* make a-(-b) => a + b */
418 if (unary->op == VINSTR_NEG_F || unary->op == VINSTR_NEG_V) {
419 if (op == INSTR_SUB_F) {
422 ++opts_optimizationcount[OPTIM_PEEPHOLE];
423 } else if (op == INSTR_SUB_V) {
426 ++opts_optimizationcount[OPTIM_PEEPHOLE];
434 self->right_first = false;
436 ast_propagate_effects(self, left);
437 ast_propagate_effects(self, right);
439 if (op >= INSTR_EQ_F && op <= INSTR_GT)
440 self->expression.vtype = TYPE_FLOAT;
441 else if (op == INSTR_AND || op == INSTR_OR) {
442 if (OPTS_FLAG(PERL_LOGIC))
443 ast_type_adopt(self, right);
445 self->expression.vtype = TYPE_FLOAT;
447 else if (op == INSTR_BITAND || op == INSTR_BITOR)
448 self->expression.vtype = TYPE_FLOAT;
449 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
450 self->expression.vtype = TYPE_VECTOR;
451 else if (op == INSTR_MUL_V)
452 self->expression.vtype = TYPE_FLOAT;
454 self->expression.vtype = left->vtype;
457 self->refs = AST_REF_ALL;
462 void ast_binary_delete(ast_binary *self)
464 if (self->refs & AST_REF_LEFT) ast_unref(self->left);
465 if (self->refs & AST_REF_RIGHT) ast_unref(self->right);
467 ast_expression_delete((ast_expression*)self);
471 ast_binstore* ast_binstore_new(lex_ctx_t ctx, int storop, int op,
472 ast_expression* left, ast_expression* right)
474 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
475 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
477 ast_side_effects(self) = true;
479 self->opstore = storop;
482 self->source = right;
484 self->keep_dest = false;
486 ast_type_adopt(self, left);
490 void ast_binstore_delete(ast_binstore *self)
492 if (!self->keep_dest)
493 ast_unref(self->dest);
494 ast_unref(self->source);
495 ast_expression_delete((ast_expression*)self);
499 ast_unary* ast_unary_new(lex_ctx_t ctx, int op,
500 ast_expression *expr)
502 ast_instantiate(ast_unary, ctx, ast_unary_delete);
503 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
506 self->operand = expr;
509 if (ast_istype(expr, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
510 ast_unary *prev = (ast_unary*)((ast_unary*)expr)->operand;
512 /* Handle for double negation */
513 if (((ast_unary*)expr)->op == op)
514 prev = (ast_unary*)((ast_unary*)expr)->operand;
516 if (ast_istype(prev, ast_unary)) {
517 ast_expression_delete((ast_expression*)self);
519 ++opts_optimizationcount[OPTIM_PEEPHOLE];
524 ast_propagate_effects(self, expr);
526 if ((op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) || op == VINSTR_NEG_F) {
527 self->expression.vtype = TYPE_FLOAT;
528 } else if (op == VINSTR_NEG_V) {
529 self->expression.vtype = TYPE_VECTOR;
531 compile_error(ctx, "cannot determine type of unary operation %s", util_instr_str[op]);
537 void ast_unary_delete(ast_unary *self)
539 if (self->operand) ast_unref(self->operand);
540 ast_expression_delete((ast_expression*)self);
544 ast_return* ast_return_new(lex_ctx_t ctx, ast_expression *expr)
546 ast_instantiate(ast_return, ctx, ast_return_delete);
547 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
549 self->operand = expr;
552 ast_propagate_effects(self, expr);
557 void ast_return_delete(ast_return *self)
560 ast_unref(self->operand);
561 ast_expression_delete((ast_expression*)self);
565 ast_entfield* ast_entfield_new(lex_ctx_t ctx, ast_expression *entity, ast_expression *field)
567 if (field->vtype != TYPE_FIELD) {
568 compile_error(ctx, "ast_entfield_new with expression not of type field");
571 return ast_entfield_new_force(ctx, entity, field, field->next);
574 ast_entfield* ast_entfield_new_force(lex_ctx_t ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
576 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
580 /* Error: field has no type... */
584 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
586 self->entity = entity;
588 ast_propagate_effects(self, entity);
589 ast_propagate_effects(self, field);
591 ast_type_adopt(self, outtype);
595 void ast_entfield_delete(ast_entfield *self)
597 ast_unref(self->entity);
598 ast_unref(self->field);
599 ast_expression_delete((ast_expression*)self);
603 ast_member* ast_member_new(lex_ctx_t ctx, ast_expression *owner, unsigned int field, const char *name)
605 ast_instantiate(ast_member, ctx, ast_member_delete);
611 if (owner->vtype != TYPE_VECTOR &&
612 owner->vtype != TYPE_FIELD) {
613 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->vtype]);
618 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
619 self->expression.node.keep = true; /* keep */
621 if (owner->vtype == TYPE_VECTOR) {
622 self->expression.vtype = TYPE_FLOAT;
623 self->expression.next = NULL;
625 self->expression.vtype = TYPE_FIELD;
626 self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
629 self->rvalue = false;
631 ast_propagate_effects(self, owner);
635 self->name = util_strdup(name);
642 void ast_member_delete(ast_member *self)
644 /* The owner is always an ast_value, which has .keep=true,
645 * also: ast_members are usually deleted after the owner, thus
646 * this will cause invalid access
647 ast_unref(self->owner);
648 * once we allow (expression).x to access a vector-member, we need
649 * to change this: preferably by creating an alternate ast node for this
650 * purpose that is not garbage-collected.
652 ast_expression_delete((ast_expression*)self);
657 bool ast_member_set_name(ast_member *self, const char *name)
660 mem_d((void*)self->name);
661 self->name = util_strdup(name);
665 ast_array_index* ast_array_index_new(lex_ctx_t ctx, ast_expression *array, ast_expression *index)
667 ast_expression *outtype;
668 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
670 outtype = array->next;
673 /* Error: field has no type... */
677 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
681 ast_propagate_effects(self, array);
682 ast_propagate_effects(self, index);
684 ast_type_adopt(self, outtype);
685 if (array->vtype == TYPE_FIELD && outtype->vtype == TYPE_ARRAY) {
686 if (self->expression.vtype != TYPE_ARRAY) {
687 compile_error(ast_ctx(self), "array_index node on type");
688 ast_array_index_delete(self);
691 self->array = outtype;
692 self->expression.vtype = TYPE_FIELD;
698 void ast_array_index_delete(ast_array_index *self)
701 ast_unref(self->array);
703 ast_unref(self->index);
704 ast_expression_delete((ast_expression*)self);
708 ast_argpipe* ast_argpipe_new(lex_ctx_t ctx, ast_expression *index)
710 ast_instantiate(ast_argpipe, ctx, ast_argpipe_delete);
711 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_argpipe_codegen);
713 self->expression.vtype = TYPE_NOEXPR;
717 void ast_argpipe_delete(ast_argpipe *self)
720 ast_unref(self->index);
721 ast_expression_delete((ast_expression*)self);
725 ast_ifthen* ast_ifthen_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
727 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
728 if (!ontrue && !onfalse) {
729 /* because it is invalid */
733 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
736 self->on_true = ontrue;
737 self->on_false = onfalse;
738 ast_propagate_effects(self, cond);
740 ast_propagate_effects(self, ontrue);
742 ast_propagate_effects(self, onfalse);
747 void ast_ifthen_delete(ast_ifthen *self)
749 ast_unref(self->cond);
751 ast_unref(self->on_true);
753 ast_unref(self->on_false);
754 ast_expression_delete((ast_expression*)self);
758 ast_ternary* ast_ternary_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
760 ast_expression *exprtype = ontrue;
761 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
762 /* This time NEITHER must be NULL */
763 if (!ontrue || !onfalse) {
767 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
770 self->on_true = ontrue;
771 self->on_false = onfalse;
772 ast_propagate_effects(self, cond);
773 ast_propagate_effects(self, ontrue);
774 ast_propagate_effects(self, onfalse);
776 if (ontrue->vtype == TYPE_NIL)
778 ast_type_adopt(self, exprtype);
783 void ast_ternary_delete(ast_ternary *self)
785 /* the if()s are only there because computed-gotos can set them
788 if (self->cond) ast_unref(self->cond);
789 if (self->on_true) ast_unref(self->on_true);
790 if (self->on_false) ast_unref(self->on_false);
791 ast_expression_delete((ast_expression*)self);
795 ast_loop* ast_loop_new(lex_ctx_t ctx,
796 ast_expression *initexpr,
797 ast_expression *precond, bool pre_not,
798 ast_expression *postcond, bool post_not,
799 ast_expression *increment,
800 ast_expression *body)
802 ast_instantiate(ast_loop, ctx, ast_loop_delete);
803 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
805 self->initexpr = initexpr;
806 self->precond = precond;
807 self->postcond = postcond;
808 self->increment = increment;
811 self->pre_not = pre_not;
812 self->post_not = post_not;
815 ast_propagate_effects(self, initexpr);
817 ast_propagate_effects(self, precond);
819 ast_propagate_effects(self, postcond);
821 ast_propagate_effects(self, increment);
823 ast_propagate_effects(self, body);
828 void ast_loop_delete(ast_loop *self)
831 ast_unref(self->initexpr);
833 ast_unref(self->precond);
835 ast_unref(self->postcond);
837 ast_unref(self->increment);
839 ast_unref(self->body);
840 ast_expression_delete((ast_expression*)self);
844 ast_breakcont* ast_breakcont_new(lex_ctx_t ctx, bool iscont, unsigned int levels)
846 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
847 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
849 self->is_continue = iscont;
850 self->levels = levels;
855 void ast_breakcont_delete(ast_breakcont *self)
857 ast_expression_delete((ast_expression*)self);
861 ast_switch* ast_switch_new(lex_ctx_t ctx, ast_expression *op)
863 ast_instantiate(ast_switch, ctx, ast_switch_delete);
864 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
869 ast_propagate_effects(self, op);
874 void ast_switch_delete(ast_switch *self)
877 ast_unref(self->operand);
879 for (i = 0; i < vec_size(self->cases); ++i) {
880 if (self->cases[i].value)
881 ast_unref(self->cases[i].value);
882 ast_unref(self->cases[i].code);
884 vec_free(self->cases);
886 ast_expression_delete((ast_expression*)self);
890 ast_label* ast_label_new(lex_ctx_t ctx, const char *name, bool undefined)
892 ast_instantiate(ast_label, ctx, ast_label_delete);
893 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
895 self->expression.vtype = TYPE_NOEXPR;
897 self->name = util_strdup(name);
898 self->irblock = NULL;
899 self->undefined = undefined;
904 void ast_label_delete(ast_label *self)
906 mem_d((void*)self->name);
907 ast_expression_delete((ast_expression*)self);
911 static void ast_label_register_goto(ast_label *self, ast_goto *g)
913 self->gotos.push_back(g);
916 ast_goto* ast_goto_new(lex_ctx_t ctx, const char *name)
918 ast_instantiate(ast_goto, ctx, ast_goto_delete);
919 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
921 self->name = util_strdup(name);
923 self->irblock_from = NULL;
928 void ast_goto_delete(ast_goto *self)
930 mem_d((void*)self->name);
931 ast_expression_delete((ast_expression*)self);
935 void ast_goto_set_label(ast_goto *self, ast_label *label)
937 self->target = label;
940 ast_state* ast_state_new(lex_ctx_t ctx, ast_expression *frame, ast_expression *think)
942 ast_instantiate(ast_state, ctx, ast_state_delete);
943 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_state_codegen);
944 self->framenum = frame;
945 self->nextthink = think;
949 void ast_state_delete(ast_state *self)
952 ast_unref(self->framenum);
954 ast_unref(self->nextthink);
956 ast_expression_delete((ast_expression*)self);
960 ast_call* ast_call_new(lex_ctx_t ctx,
961 ast_expression *funcexpr)
963 ast_instantiate(ast_call, ctx, ast_call_delete);
964 if (!funcexpr->next) {
965 compile_error(ctx, "not a function");
969 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
971 ast_side_effects(self) = true;
973 self->func = funcexpr;
974 self->va_count = NULL;
976 ast_type_adopt(self, funcexpr->next);
981 void ast_call_delete(ast_call *self)
983 for (auto &it : self->params)
987 ast_unref(self->func);
990 ast_unref(self->va_count);
992 ast_expression_delete((ast_expression*)self);
996 static bool ast_call_check_vararg(ast_call *self, ast_expression *va_type, ast_expression *exp_type)
1002 if (!va_type || !ast_compare_type(va_type, exp_type))
1004 if (va_type && exp_type)
1006 ast_type_to_string(va_type, tgot, sizeof(tgot));
1007 ast_type_to_string(exp_type, texp, sizeof(texp));
1008 if (OPTS_FLAG(UNSAFE_VARARGS)) {
1009 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1010 "piped variadic argument differs in type: constrained to type %s, expected type %s",
1014 compile_error(ast_ctx(self),
1015 "piped variadic argument differs in type: constrained to type %s, expected type %s",
1022 ast_type_to_string(exp_type, texp, sizeof(texp));
1023 if (OPTS_FLAG(UNSAFE_VARARGS)) {
1024 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1025 "piped variadic argument may differ in type: expected type %s",
1029 compile_error(ast_ctx(self),
1030 "piped variadic argument may differ in type: expected type %s",
1039 bool ast_call_check_types(ast_call *self, ast_expression *va_type)
1045 const ast_expression *func = self->func;
1046 size_t count = self->params.size();
1047 if (count > func->params.size())
1048 count = func->params.size();
1050 for (i = 0; i < count; ++i) {
1051 if (ast_istype(self->params[i], ast_argpipe)) {
1052 /* warn about type safety instead */
1054 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1057 if (!ast_call_check_vararg(self, va_type, (ast_expression*)func->params[i]))
1060 else if (!ast_compare_type(self->params[i], (ast_expression*)(func->params[i])))
1062 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1063 ast_type_to_string((ast_expression*)func->params[i], texp, sizeof(texp));
1064 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
1065 (unsigned int)(i+1), texp, tgot);
1066 /* we don't immediately return */
1070 count = self->params.size();
1071 if (count > func->params.size() && func->varparam) {
1072 for (; i < count; ++i) {
1073 if (ast_istype(self->params[i], ast_argpipe)) {
1074 /* warn about type safety instead */
1076 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1079 if (!ast_call_check_vararg(self, va_type, func->varparam))
1082 else if (!ast_compare_type(self->params[i], func->varparam))
1084 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1085 ast_type_to_string(func->varparam, texp, sizeof(texp));
1086 compile_error(ast_ctx(self), "invalid type for variadic parameter %u in function call: expected %s, got %s",
1087 (unsigned int)(i+1), texp, tgot);
1088 /* we don't immediately return */
1096 ast_store* ast_store_new(lex_ctx_t ctx, int op,
1097 ast_expression *dest, ast_expression *source)
1099 ast_instantiate(ast_store, ctx, ast_store_delete);
1100 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
1102 ast_side_effects(self) = true;
1106 self->source = source;
1108 ast_type_adopt(self, dest);
1113 void ast_store_delete(ast_store *self)
1115 ast_unref(self->dest);
1116 ast_unref(self->source);
1117 ast_expression_delete((ast_expression*)self);
1121 ast_block* ast_block_new(lex_ctx_t ctx)
1123 ast_instantiate(ast_block, ctx, ast_block_delete);
1124 ast_expression_init((ast_expression*)self,
1125 (ast_expression_codegen*)&ast_block_codegen);
1129 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1131 ast_propagate_effects(self, e);
1132 self->exprs.push_back(e);
1133 if (self->expression.next) {
1134 ast_delete(self->expression.next);
1135 self->expression.next = NULL;
1137 ast_type_adopt(self, e);
1141 void ast_block_collect(ast_block *self, ast_expression *expr)
1143 self->collect.push_back(expr);
1144 expr->node.keep = true;
1147 void ast_block_delete(ast_block *self)
1149 for (auto &it : self->exprs) ast_unref(it);
1150 for (auto &it : self->locals) ast_delete(it);
1151 for (auto &it : self->collect) ast_delete(it);
1152 ast_expression_delete((ast_expression*)self);
1156 void ast_block_set_type(ast_block *self, ast_expression *from)
1158 if (self->expression.next)
1159 ast_delete(self->expression.next);
1160 ast_type_adopt(self, from);
1163 ast_function* ast_function_new(lex_ctx_t ctx, const char *name, ast_value *vtype)
1165 ast_instantiate(ast_function, ctx, ast_function_delete);
1168 compile_error(ast_ctx(self), "internal error: ast_function_new condition 0");
1170 } else if (vtype->hasvalue || vtype->expression.vtype != TYPE_FUNCTION) {
1171 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1173 (int)vtype->hasvalue,
1174 vtype->expression.vtype);
1178 self->vtype = vtype;
1179 self->name = name ? util_strdup(name) : NULL;
1181 self->labelcount = 0;
1184 self->ir_func = NULL;
1185 self->curblock = NULL;
1187 self->breakblocks = NULL;
1188 self->continueblocks = NULL;
1190 vtype->hasvalue = true;
1191 vtype->constval.vfunc = self;
1193 self->varargs = NULL;
1195 self->fixedparams = NULL;
1196 self->return_value = NULL;
1198 self->static_names = NULL;
1199 self->static_count = 0;
1208 void ast_function_delete(ast_function *self)
1212 mem_d((void*)self->name);
1214 /* ast_value_delete(self->vtype); */
1215 self->vtype->hasvalue = false;
1216 self->vtype->constval.vfunc = NULL;
1217 /* We use unref - if it was stored in a global table it is supposed
1218 * to be deleted from *there*
1220 ast_unref(self->vtype);
1222 for (i = 0; i < vec_size(self->static_names); ++i)
1223 mem_d(self->static_names[i]);
1224 vec_free(self->static_names);
1225 for (auto &it : self->blocks)
1227 vec_free(self->breakblocks);
1228 vec_free(self->continueblocks);
1230 ast_delete(self->varargs);
1232 ast_delete(self->argc);
1233 if (self->fixedparams)
1234 ast_unref(self->fixedparams);
1235 if (self->return_value)
1236 ast_unref(self->return_value);
1240 const char* ast_function_label(ast_function *self, const char *prefix)
1246 if (!OPTS_OPTION_BOOL(OPTION_DUMP) &&
1247 !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
1248 !OPTS_OPTION_BOOL(OPTION_DEBUG))
1253 id = (self->labelcount++);
1254 len = strlen(prefix);
1256 from = self->labelbuf + sizeof(self->labelbuf)-1;
1259 *from-- = (id%10) + '0';
1263 memcpy(from - len, prefix, len);
1267 /*********************************************************************/
1269 * by convention you must never pass NULL to the 'ir_value **out'
1270 * parameter. If you really don't care about the output, pass a dummy.
1271 * But I can't imagine a pituation where the output is truly unnecessary.
1274 static void _ast_codegen_output_type(ast_expression *self, ir_value *out)
1276 if (out->vtype == TYPE_FIELD)
1277 out->fieldtype = self->next->vtype;
1278 if (out->vtype == TYPE_FUNCTION)
1279 out->outtype = self->next->vtype;
1282 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1284 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1288 if (self->expression.vtype == TYPE_NIL) {
1289 *out = func->ir_func->owner->nil;
1292 /* NOTE: This is the codegen for a variable used in an expression.
1293 * It is not the codegen to generate the value. For this purpose,
1294 * ast_local_codegen and ast_global_codegen are to be used before this
1295 * is executed. ast_function_codegen should take care of its locals,
1296 * and the ast-user should take care of ast_global_codegen to be used
1297 * on all the globals.
1300 char tname[1024]; /* typename is reserved in C++ */
1301 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1302 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1309 static bool ast_global_array_set(ast_value *self)
1311 size_t count = self->initlist.size();
1314 if (count > self->expression.count) {
1315 compile_error(ast_ctx(self), "too many elements in initializer");
1316 count = self->expression.count;
1318 else if (count < self->expression.count) {
1320 compile_warning(ast_ctx(self), "not all elements are initialized");
1324 for (i = 0; i != count; ++i) {
1325 switch (self->expression.next->vtype) {
1327 if (!ir_value_set_float(self->ir_values[i], self->initlist[i].vfloat))
1331 if (!ir_value_set_vector(self->ir_values[i], self->initlist[i].vvec))
1335 if (!ir_value_set_string(self->ir_values[i], self->initlist[i].vstring))
1339 /* we don't support them in any other place yet either */
1340 compile_error(ast_ctx(self), "TODO: nested arrays");
1343 /* this requiers a bit more work - similar to the fields I suppose */
1344 compile_error(ast_ctx(self), "global of type function not properly generated");
1347 if (!self->initlist[i].vfield) {
1348 compile_error(ast_ctx(self), "field constant without vfield set");
1351 if (!self->initlist[i].vfield->ir_v) {
1352 compile_error(ast_ctx(self), "field constant generated before its field");
1355 if (!ir_value_set_field(self->ir_values[i], self->initlist[i].vfield->ir_v))
1359 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1366 static bool check_array(ast_value *self, ast_value *array)
1368 if (array->expression.flags & AST_FLAG_ARRAY_INIT && array->initlist.empty()) {
1369 compile_error(ast_ctx(self), "array without size: %s", self->name);
1372 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1373 if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1374 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1380 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1384 if (self->expression.vtype == TYPE_NIL) {
1385 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1389 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1391 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->vtype);
1394 func->context = ast_ctx(self);
1395 func->value->context = ast_ctx(self);
1397 self->constval.vfunc->ir_func = func;
1398 self->ir_v = func->value;
1399 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1400 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1401 if (self->expression.flags & AST_FLAG_ERASEABLE)
1402 self->ir_v->flags |= IR_FLAG_ERASABLE;
1403 if (self->expression.flags & AST_FLAG_BLOCK_COVERAGE)
1404 func->flags |= IR_FLAG_BLOCK_COVERAGE;
1405 /* The function is filled later on ast_function_codegen... */
1409 if (isfield && self->expression.vtype == TYPE_FIELD) {
1410 ast_expression *fieldtype = self->expression.next;
1412 if (self->hasvalue) {
1413 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1417 if (fieldtype->vtype == TYPE_ARRAY) {
1422 ast_expression *elemtype;
1424 ast_value *array = (ast_value*)fieldtype;
1426 if (!ast_istype(fieldtype, ast_value)) {
1427 compile_error(ast_ctx(self), "internal error: ast_value required");
1431 if (!check_array(self, array))
1434 elemtype = array->expression.next;
1435 vtype = elemtype->vtype;
1437 v = ir_builder_create_field(ir, self->name, vtype);
1439 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1442 v->context = ast_ctx(self);
1443 v->unique_life = true;
1445 array->ir_v = self->ir_v = v;
1447 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1448 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1449 if (self->expression.flags & AST_FLAG_ERASEABLE)
1450 self->ir_v->flags |= IR_FLAG_ERASABLE;
1452 namelen = strlen(self->name);
1453 name = (char*)mem_a(namelen + 16);
1454 util_strncpy(name, self->name, namelen);
1456 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1457 array->ir_values[0] = v;
1458 for (ai = 1; ai < array->expression.count; ++ai) {
1459 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1460 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1461 if (!array->ir_values[ai]) {
1463 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1466 array->ir_values[ai]->context = ast_ctx(self);
1467 array->ir_values[ai]->unique_life = true;
1468 array->ir_values[ai]->locked = true;
1469 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1470 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1476 v = ir_builder_create_field(ir, self->name, self->expression.next->vtype);
1479 v->context = ast_ctx(self);
1481 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1482 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1484 if (self->expression.flags & AST_FLAG_ERASEABLE)
1485 self->ir_v->flags |= IR_FLAG_ERASABLE;
1490 if (self->expression.vtype == TYPE_ARRAY) {
1495 ast_expression *elemtype = self->expression.next;
1496 int vtype = elemtype->vtype;
1498 if (self->expression.flags & AST_FLAG_ARRAY_INIT && !self->expression.count) {
1499 compile_error(ast_ctx(self), "array `%s' has no size", self->name);
1503 /* same as with field arrays */
1504 if (!check_array(self, self))
1507 v = ir_builder_create_global(ir, self->name, vtype);
1509 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1512 v->context = ast_ctx(self);
1513 v->unique_life = true;
1516 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1517 v->flags |= IR_FLAG_INCLUDE_DEF;
1518 if (self->expression.flags & AST_FLAG_ERASEABLE)
1519 self->ir_v->flags |= IR_FLAG_ERASABLE;
1521 namelen = strlen(self->name);
1522 name = (char*)mem_a(namelen + 16);
1523 util_strncpy(name, self->name, namelen);
1525 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1526 self->ir_values[0] = v;
1527 for (ai = 1; ai < self->expression.count; ++ai) {
1528 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1529 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1530 if (!self->ir_values[ai]) {
1532 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1535 self->ir_values[ai]->context = ast_ctx(self);
1536 self->ir_values[ai]->unique_life = true;
1537 self->ir_values[ai]->locked = true;
1538 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1539 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1545 /* Arrays don't do this since there's no "array" value which spans across the
1548 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1550 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1553 codegen_output_type(self, v);
1554 v->context = ast_ctx(self);
1557 /* link us to the ir_value */
1561 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1562 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1563 if (self->expression.flags & AST_FLAG_ERASEABLE)
1564 self->ir_v->flags |= IR_FLAG_ERASABLE;
1567 if (self->hasvalue) {
1568 switch (self->expression.vtype)
1571 if (!ir_value_set_float(v, self->constval.vfloat))
1575 if (!ir_value_set_vector(v, self->constval.vvec))
1579 if (!ir_value_set_string(v, self->constval.vstring))
1583 ast_global_array_set(self);
1586 compile_error(ast_ctx(self), "global of type function not properly generated");
1588 /* Cannot generate an IR value for a function,
1589 * need a pointer pointing to a function rather.
1592 if (!self->constval.vfield) {
1593 compile_error(ast_ctx(self), "field constant without vfield set");
1596 if (!self->constval.vfield->ir_v) {
1597 compile_error(ast_ctx(self), "field constant generated before its field");
1600 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1604 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1610 error: /* clean up */
1611 if(v) ir_value_delete(v);
1615 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1619 if (self->expression.vtype == TYPE_NIL) {
1620 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1624 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1626 /* Do we allow local functions? I think not...
1627 * this is NOT a function pointer atm.
1632 if (self->expression.vtype == TYPE_ARRAY) {
1637 ast_expression *elemtype = self->expression.next;
1638 int vtype = elemtype->vtype;
1640 func->flags |= IR_FLAG_HAS_ARRAYS;
1642 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1643 compile_error(ast_ctx(self), "array-parameters are not supported");
1647 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1648 if (!check_array(self, self))
1651 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1652 if (!self->ir_values) {
1653 compile_error(ast_ctx(self), "failed to allocate array values");
1657 v = ir_function_create_local(func, self->name, vtype, param);
1659 compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1662 v->context = ast_ctx(self);
1663 v->unique_life = true;
1666 namelen = strlen(self->name);
1667 name = (char*)mem_a(namelen + 16);
1668 util_strncpy(name, self->name, namelen);
1670 self->ir_values[0] = v;
1671 for (ai = 1; ai < self->expression.count; ++ai) {
1672 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1673 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1674 if (!self->ir_values[ai]) {
1675 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1678 self->ir_values[ai]->context = ast_ctx(self);
1679 self->ir_values[ai]->unique_life = true;
1680 self->ir_values[ai]->locked = true;
1686 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1689 codegen_output_type(self, v);
1690 v->context = ast_ctx(self);
1693 /* A constant local... hmmm...
1694 * I suppose the IR will have to deal with this
1696 if (self->hasvalue) {
1697 switch (self->expression.vtype)
1700 if (!ir_value_set_float(v, self->constval.vfloat))
1704 if (!ir_value_set_vector(v, self->constval.vvec))
1708 if (!ir_value_set_string(v, self->constval.vstring))
1712 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1717 /* link us to the ir_value */
1721 if (!ast_generate_accessors(self, func->owner))
1725 error: /* clean up */
1730 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1733 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1734 if (!self->setter || !self->getter)
1736 for (i = 0; i < self->expression.count; ++i) {
1737 if (!self->ir_values) {
1738 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1741 if (!self->ir_values[i]) {
1742 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1745 if (self->ir_values[i]->life) {
1746 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1751 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1753 if (!ast_global_codegen (self->setter, ir, false) ||
1754 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1755 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1757 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1758 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1763 if (!ast_global_codegen (self->getter, ir, false) ||
1764 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1765 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1767 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1768 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1772 for (i = 0; i < self->expression.count; ++i) {
1773 vec_free(self->ir_values[i]->life);
1775 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1779 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1784 ast_expression_codegen *cgen;
1788 irf = self->ir_func;
1790 compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1794 /* fill the parameter list */
1795 ec = &self->vtype->expression;
1796 for (auto &it : ec->params) {
1797 if (it->expression.vtype == TYPE_FIELD)
1798 vec_push(irf->params, it->expression.next->vtype);
1800 vec_push(irf->params, it->expression.vtype);
1801 if (!self->builtin) {
1802 if (!ast_local_codegen(it, self->ir_func, true))
1807 if (self->varargs) {
1808 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1810 irf->max_varargs = self->varargs->expression.count;
1813 if (self->builtin) {
1814 irf->builtin = self->builtin;
1818 /* have a local return value variable? */
1819 if (self->return_value) {
1820 if (!ast_local_codegen(self->return_value, self->ir_func, false))
1824 if (self->blocks.empty()) {
1825 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1829 irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1830 if (!self->curblock) {
1831 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1839 if (!ast_local_codegen(self->argc, self->ir_func, true))
1841 cgen = self->argc->expression.codegen;
1842 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1844 cgen = self->fixedparams->expression.codegen;
1845 if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1847 sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1848 ast_function_label(self, "va_count"), INSTR_SUB_F,
1849 ir_builder_get_va_count(ir), fixed);
1852 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1859 for (auto &it : self->blocks) {
1860 cgen = it->expression.codegen;
1861 if (!(*cgen)((ast_expression*)it, self, false, &dummy))
1865 /* TODO: check return types */
1866 if (!self->curblock->final)
1868 if (!self->vtype->expression.next ||
1869 self->vtype->expression.next->vtype == TYPE_VOID)
1871 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1873 else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1875 if (self->return_value) {
1876 cgen = self->return_value->expression.codegen;
1877 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1879 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1881 else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1882 "control reaches end of non-void function (`%s`) via %s",
1883 self->name, self->curblock->label))
1887 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1893 static bool starts_a_label(ast_expression *ex)
1895 while (ex && ast_istype(ex, ast_block)) {
1896 ast_block *b = (ast_block*)ex;
1901 return ast_istype(ex, ast_label);
1904 /* Note, you will not see ast_block_codegen generate ir_blocks.
1905 * To the AST and the IR, blocks are 2 different things.
1906 * In the AST it represents a block of code, usually enclosed in
1907 * curly braces {...}.
1908 * While in the IR it represents a block in terms of control-flow.
1910 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1912 /* We don't use this
1913 * Note: an ast-representation using the comma-operator
1914 * of the form: (a, b, c) = x should not assign to c...
1917 compile_error(ast_ctx(self), "not an l-value (code-block)");
1921 if (self->expression.outr) {
1922 *out = self->expression.outr;
1926 /* output is NULL at first, we'll have each expression
1927 * assign to out output, thus, a comma-operator represention
1928 * using an ast_block will return the last generated value,
1929 * so: (b, c) + a executed both b and c, and returns c,
1930 * which is then added to a.
1934 /* generate locals */
1935 for (auto &it : self->locals) {
1936 if (!ast_local_codegen(it, func->ir_func, false)) {
1937 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1938 compile_error(ast_ctx(self), "failed to generate local `%s`", it->name);
1943 for (auto &it : self->exprs) {
1944 ast_expression_codegen *gen;
1945 if (func->curblock->final && !starts_a_label(it)) {
1946 if (compile_warning(ast_ctx(it), WARN_UNREACHABLE_CODE, "unreachable statement"))
1951 if (!(*gen)(it, func, false, out))
1955 self->expression.outr = *out;
1960 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1962 ast_expression_codegen *cgen;
1963 ir_value *left = NULL;
1964 ir_value *right = NULL;
1968 ast_array_index *ai = NULL;
1970 if (lvalue && self->expression.outl) {
1971 *out = self->expression.outl;
1975 if (!lvalue && self->expression.outr) {
1976 *out = self->expression.outr;
1980 if (ast_istype(self->dest, ast_array_index))
1983 ai = (ast_array_index*)self->dest;
1984 idx = (ast_value*)ai->index;
1986 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1991 /* we need to call the setter */
1992 ir_value *iridx, *funval;
1996 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2000 arr = (ast_value*)ai->array;
2001 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2002 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2006 cgen = idx->expression.codegen;
2007 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2010 cgen = arr->setter->expression.codegen;
2011 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2014 cgen = self->source->codegen;
2015 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2018 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2021 ir_call_param(call, iridx);
2022 ir_call_param(call, right);
2023 self->expression.outr = right;
2029 cgen = self->dest->codegen;
2031 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
2033 self->expression.outl = left;
2035 cgen = self->source->codegen;
2037 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2040 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
2042 self->expression.outr = right;
2045 /* Theoretically, an assinment returns its left side as an
2046 * lvalue, if we don't need an lvalue though, we return
2047 * the right side as an rvalue, otherwise we have to
2048 * somehow know whether or not we need to dereference the pointer
2049 * on the left side - that is: OP_LOAD if it was an address.
2050 * Also: in original QC we cannot OP_LOADP *anyway*.
2052 *out = (lvalue ? left : right);
2057 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
2059 ast_expression_codegen *cgen;
2060 ir_value *left, *right;
2062 /* A binary operation cannot yield an l-value */
2064 compile_error(ast_ctx(self), "not an l-value (binop)");
2068 if (self->expression.outr) {
2069 *out = self->expression.outr;
2073 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
2074 (self->op == INSTR_AND || self->op == INSTR_OR))
2076 /* NOTE: The short-logic path will ignore right_first */
2078 /* short circuit evaluation */
2079 ir_block *other, *merge;
2080 ir_block *from_left, *from_right;
2084 /* prepare end-block */
2085 merge_id = vec_size(func->ir_func->blocks);
2086 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
2088 /* generate the left expression */
2089 cgen = self->left->codegen;
2090 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2092 /* remember the block */
2093 from_left = func->curblock;
2095 /* create a new block for the right expression */
2096 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
2097 if (self->op == INSTR_AND) {
2098 /* on AND: left==true -> other */
2099 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
2102 /* on OR: left==false -> other */
2103 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
2106 /* use the likely flag */
2107 vec_last(func->curblock->instr)->likely = true;
2109 /* enter the right-expression's block */
2110 func->curblock = other;
2112 cgen = self->right->codegen;
2113 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2115 /* remember block */
2116 from_right = func->curblock;
2118 /* jump to the merge block */
2119 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
2122 vec_remove(func->ir_func->blocks, merge_id, 1);
2123 vec_push(func->ir_func->blocks, merge);
2125 func->curblock = merge;
2126 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
2127 ast_function_label(func, "sce_value"),
2128 self->expression.vtype);
2129 ir_phi_add(phi, from_left, left);
2130 ir_phi_add(phi, from_right, right);
2131 *out = ir_phi_value(phi);
2135 if (!OPTS_FLAG(PERL_LOGIC)) {
2137 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
2138 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2139 ast_function_label(func, "sce_bool_v"),
2143 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2144 ast_function_label(func, "sce_bool"),
2149 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
2150 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2151 ast_function_label(func, "sce_bool_s"),
2155 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2156 ast_function_label(func, "sce_bool"),
2162 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
2163 ast_function_label(func, "sce_bool"),
2164 INSTR_AND, *out, *out);
2170 self->expression.outr = *out;
2171 codegen_output_type(self, *out);
2175 if (self->right_first) {
2176 cgen = self->right->codegen;
2177 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2179 cgen = self->left->codegen;
2180 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2183 cgen = self->left->codegen;
2184 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2186 cgen = self->right->codegen;
2187 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2191 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
2192 self->op, left, right);
2195 self->expression.outr = *out;
2196 codegen_output_type(self, *out);
2201 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
2203 ast_expression_codegen *cgen;
2204 ir_value *leftl = NULL, *leftr, *right, *bin;
2208 ast_array_index *ai = NULL;
2209 ir_value *iridx = NULL;
2211 if (lvalue && self->expression.outl) {
2212 *out = self->expression.outl;
2216 if (!lvalue && self->expression.outr) {
2217 *out = self->expression.outr;
2221 if (ast_istype(self->dest, ast_array_index))
2224 ai = (ast_array_index*)self->dest;
2225 idx = (ast_value*)ai->index;
2227 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2231 /* for a binstore we need both an lvalue and an rvalue for the left side */
2232 /* rvalue of destination! */
2234 cgen = idx->expression.codegen;
2235 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2238 cgen = self->dest->codegen;
2239 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2242 /* source as rvalue only */
2243 cgen = self->source->codegen;
2244 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2247 /* now the binary */
2248 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2249 self->opbin, leftr, right);
2250 self->expression.outr = bin;
2254 /* we need to call the setter */
2259 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2263 arr = (ast_value*)ai->array;
2264 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2265 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2269 cgen = arr->setter->expression.codegen;
2270 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2273 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2276 ir_call_param(call, iridx);
2277 ir_call_param(call, bin);
2278 self->expression.outr = bin;
2280 /* now store them */
2281 cgen = self->dest->codegen;
2282 /* lvalue of destination */
2283 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2285 self->expression.outl = leftl;
2287 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2289 self->expression.outr = bin;
2292 /* Theoretically, an assinment returns its left side as an
2293 * lvalue, if we don't need an lvalue though, we return
2294 * the right side as an rvalue, otherwise we have to
2295 * somehow know whether or not we need to dereference the pointer
2296 * on the left side - that is: OP_LOAD if it was an address.
2297 * Also: in original QC we cannot OP_LOADP *anyway*.
2299 *out = (lvalue ? leftl : bin);
2304 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2306 ast_expression_codegen *cgen;
2309 /* An unary operation cannot yield an l-value */
2311 compile_error(ast_ctx(self), "not an l-value (binop)");
2315 if (self->expression.outr) {
2316 *out = self->expression.outr;
2320 cgen = self->operand->codegen;
2322 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2325 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2329 self->expression.outr = *out;
2334 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2336 ast_expression_codegen *cgen;
2341 /* In the context of a return operation, we don't actually return
2345 compile_error(ast_ctx(self), "return-expression is not an l-value");
2349 if (self->expression.outr) {
2350 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2353 self->expression.outr = (ir_value*)1;
2355 if (self->operand) {
2356 cgen = self->operand->codegen;
2358 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2361 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2364 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2371 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2373 ast_expression_codegen *cgen;
2374 ir_value *ent, *field;
2376 /* This function needs to take the 'lvalue' flag into account!
2377 * As lvalue we provide a field-pointer, as rvalue we provide the
2381 if (lvalue && self->expression.outl) {
2382 *out = self->expression.outl;
2386 if (!lvalue && self->expression.outr) {
2387 *out = self->expression.outr;
2391 cgen = self->entity->codegen;
2392 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2395 cgen = self->field->codegen;
2396 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2401 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2404 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2405 ent, field, self->expression.vtype);
2406 /* Done AFTER error checking:
2407 codegen_output_type(self, *out);
2411 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2412 (lvalue ? "ADDRESS" : "FIELD"),
2413 type_name[self->expression.vtype]);
2417 codegen_output_type(self, *out);
2420 self->expression.outl = *out;
2422 self->expression.outr = *out;
2424 /* Hm that should be it... */
2428 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2430 ast_expression_codegen *cgen;
2433 /* in QC this is always an lvalue */
2434 if (lvalue && self->rvalue) {
2435 compile_error(ast_ctx(self), "not an l-value (member access)");
2438 if (self->expression.outl) {
2439 *out = self->expression.outl;
2443 cgen = self->owner->codegen;
2444 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2447 if (vec->vtype != TYPE_VECTOR &&
2448 !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2453 *out = ir_value_vector_member(vec, self->field);
2454 self->expression.outl = *out;
2456 return (*out != NULL);
2459 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2464 if (!lvalue && self->expression.outr) {
2465 *out = self->expression.outr;
2468 if (lvalue && self->expression.outl) {
2469 *out = self->expression.outl;
2473 if (!ast_istype(self->array, ast_value)) {
2474 compile_error(ast_ctx(self), "array indexing this way is not supported");
2475 /* note this would actually be pointer indexing because the left side is
2476 * not an actual array but (hopefully) an indexable expression.
2477 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2478 * support this path will be filled.
2483 arr = (ast_value*)self->array;
2484 idx = (ast_value*)self->index;
2486 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2487 /* Time to use accessor functions */
2488 ast_expression_codegen *cgen;
2489 ir_value *iridx, *funval;
2493 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2498 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2502 cgen = self->index->codegen;
2503 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2506 cgen = arr->getter->expression.codegen;
2507 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2510 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2513 ir_call_param(call, iridx);
2515 *out = ir_call_value(call);
2516 self->expression.outr = *out;
2517 (*out)->vtype = self->expression.vtype;
2518 codegen_output_type(self, *out);
2522 if (idx->expression.vtype == TYPE_FLOAT) {
2523 unsigned int arridx = idx->constval.vfloat;
2524 if (arridx >= self->array->count)
2526 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2529 *out = arr->ir_values[arridx];
2531 else if (idx->expression.vtype == TYPE_INTEGER) {
2532 unsigned int arridx = idx->constval.vint;
2533 if (arridx >= self->array->count)
2535 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2538 *out = arr->ir_values[arridx];
2541 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2544 (*out)->vtype = self->expression.vtype;
2545 codegen_output_type(self, *out);
2549 bool ast_argpipe_codegen(ast_argpipe *self, ast_function *func, bool lvalue, ir_value **out)
2553 compile_error(ast_ctx(self), "argpipe node: not an lvalue");
2558 compile_error(ast_ctx(self), "TODO: argpipe codegen not implemented");
2562 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2564 ast_expression_codegen *cgen;
2572 ir_block *ontrue_endblock = NULL;
2573 ir_block *onfalse_endblock = NULL;
2574 ir_block *merge = NULL;
2577 /* We don't output any value, thus also don't care about r/lvalue */
2581 if (self->expression.outr) {
2582 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2585 self->expression.outr = (ir_value*)1;
2587 /* generate the condition */
2588 cgen = self->cond->codegen;
2589 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2591 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2592 cond = func->curblock;
2594 /* try constant folding away the condition */
2595 if ((fold = fold_cond_ifthen(condval, func, self)) != -1)
2598 if (self->on_true) {
2599 /* create on-true block */
2600 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2604 /* enter the block */
2605 func->curblock = ontrue;
2608 cgen = self->on_true->codegen;
2609 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2612 /* we now need to work from the current endpoint */
2613 ontrue_endblock = func->curblock;
2618 if (self->on_false) {
2619 /* create on-false block */
2620 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2624 /* enter the block */
2625 func->curblock = onfalse;
2628 cgen = self->on_false->codegen;
2629 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2632 /* we now need to work from the current endpoint */
2633 onfalse_endblock = func->curblock;
2637 /* Merge block were they all merge in to */
2638 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2640 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2643 /* add jumps ot the merge block */
2644 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2646 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2649 /* Now enter the merge block */
2650 func->curblock = merge;
2653 /* we create the if here, that way all blocks are ordered :)
2655 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2656 (ontrue ? ontrue : merge),
2657 (onfalse ? onfalse : merge)))
2665 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2667 ast_expression_codegen *cgen;
2670 ir_value *trueval, *falseval;
2673 ir_block *cond = func->curblock;
2674 ir_block *cond_out = NULL;
2675 ir_block *ontrue, *ontrue_out = NULL;
2676 ir_block *onfalse, *onfalse_out = NULL;
2680 /* Ternary can never create an lvalue... */
2684 /* In theory it shouldn't be possible to pass through a node twice, but
2685 * in case we add any kind of optimization pass for the AST itself, it
2686 * may still happen, thus we remember a created ir_value and simply return one
2687 * if it already exists.
2689 if (self->expression.outr) {
2690 *out = self->expression.outr;
2694 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2696 /* generate the condition */
2697 func->curblock = cond;
2698 cgen = self->cond->codegen;
2699 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2701 cond_out = func->curblock;
2703 /* try constant folding away the condition */
2704 if ((fold = fold_cond_ternary(condval, func, self)) != -1)
2707 /* create on-true block */
2708 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2713 /* enter the block */
2714 func->curblock = ontrue;
2717 cgen = self->on_true->codegen;
2718 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2721 ontrue_out = func->curblock;
2724 /* create on-false block */
2725 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2730 /* enter the block */
2731 func->curblock = onfalse;
2734 cgen = self->on_false->codegen;
2735 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2738 onfalse_out = func->curblock;
2741 /* create merge block */
2742 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2745 /* jump to merge block */
2746 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2748 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2751 /* create if instruction */
2752 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2755 /* Now enter the merge block */
2756 func->curblock = merge;
2758 /* Here, now, we need a PHI node
2759 * but first some sanity checking...
2761 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2762 /* error("ternary with different types on the two sides"); */
2763 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2768 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2770 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2773 ir_phi_add(phi, ontrue_out, trueval);
2774 ir_phi_add(phi, onfalse_out, falseval);
2776 self->expression.outr = ir_phi_value(phi);
2777 *out = self->expression.outr;
2779 codegen_output_type(self, *out);
2784 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2786 ast_expression_codegen *cgen;
2788 ir_value *dummy = NULL;
2789 ir_value *precond = NULL;
2790 ir_value *postcond = NULL;
2792 /* Since we insert some jumps "late" so we have blocks
2793 * ordered "nicely", we need to keep track of the actual end-blocks
2794 * of expressions to add the jumps to.
2796 ir_block *bbody = NULL, *end_bbody = NULL;
2797 ir_block *bprecond = NULL, *end_bprecond = NULL;
2798 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2799 ir_block *bincrement = NULL, *end_bincrement = NULL;
2800 ir_block *bout = NULL, *bin = NULL;
2802 /* let's at least move the outgoing block to the end */
2805 /* 'break' and 'continue' need to be able to find the right blocks */
2806 ir_block *bcontinue = NULL;
2807 ir_block *bbreak = NULL;
2809 ir_block *tmpblock = NULL;
2814 if (self->expression.outr) {
2815 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2818 self->expression.outr = (ir_value*)1;
2821 * Should we ever need some kind of block ordering, better make this function
2822 * move blocks around than write a block ordering algorithm later... after all
2823 * the ast and ir should work together, not against each other.
2826 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2827 * anyway if for example it contains a ternary.
2831 cgen = self->initexpr->codegen;
2832 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2836 /* Store the block from which we enter this chaos */
2837 bin = func->curblock;
2839 /* The pre-loop condition needs its own block since we
2840 * need to be able to jump to the start of that expression.
2844 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2848 /* the pre-loop-condition the least important place to 'continue' at */
2849 bcontinue = bprecond;
2852 func->curblock = bprecond;
2855 cgen = self->precond->codegen;
2856 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2859 end_bprecond = func->curblock;
2861 bprecond = end_bprecond = NULL;
2864 /* Now the next blocks won't be ordered nicely, but we need to
2865 * generate them this early for 'break' and 'continue'.
2867 if (self->increment) {
2868 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2871 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2873 bincrement = end_bincrement = NULL;
2876 if (self->postcond) {
2877 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2880 bcontinue = bpostcond; /* postcond comes before the increment */
2882 bpostcond = end_bpostcond = NULL;
2885 bout_id = vec_size(func->ir_func->blocks);
2886 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2891 /* The loop body... */
2892 /* if (self->body) */
2894 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2899 func->curblock = bbody;
2901 vec_push(func->breakblocks, bbreak);
2903 vec_push(func->continueblocks, bcontinue);
2905 vec_push(func->continueblocks, bbody);
2909 cgen = self->body->codegen;
2910 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2914 end_bbody = func->curblock;
2915 vec_pop(func->breakblocks);
2916 vec_pop(func->continueblocks);
2919 /* post-loop-condition */
2923 func->curblock = bpostcond;
2926 cgen = self->postcond->codegen;
2927 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2930 end_bpostcond = func->curblock;
2933 /* The incrementor */
2934 if (self->increment)
2937 func->curblock = bincrement;
2940 cgen = self->increment->codegen;
2941 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2944 end_bincrement = func->curblock;
2947 /* In any case now, we continue from the outgoing block */
2948 func->curblock = bout;
2950 /* Now all blocks are in place */
2951 /* From 'bin' we jump to whatever comes first */
2952 if (bprecond) tmpblock = bprecond;
2953 else tmpblock = bbody; /* can never be null */
2956 else if (bpostcond) tmpblock = bpostcond;
2957 else tmpblock = bout;
2960 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2966 ir_block *ontrue, *onfalse;
2967 ontrue = bbody; /* can never be null */
2969 /* all of this is dead code
2970 else if (bincrement) ontrue = bincrement;
2971 else ontrue = bpostcond;
2975 if (self->pre_not) {
2980 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2987 if (bincrement) tmpblock = bincrement;
2988 else if (bpostcond) tmpblock = bpostcond;
2989 else if (bprecond) tmpblock = bprecond;
2990 else tmpblock = bbody;
2991 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2995 /* from increment */
2998 if (bpostcond) tmpblock = bpostcond;
2999 else if (bprecond) tmpblock = bprecond;
3000 else if (bbody) tmpblock = bbody;
3001 else tmpblock = bout;
3002 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
3009 ir_block *ontrue, *onfalse;
3010 if (bprecond) ontrue = bprecond;
3011 else ontrue = bbody; /* can never be null */
3013 /* all of this is dead code
3014 else if (bincrement) ontrue = bincrement;
3015 else ontrue = bpostcond;
3019 if (self->post_not) {
3024 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
3028 /* Move 'bout' to the end */
3029 vec_remove(func->ir_func->blocks, bout_id, 1);
3030 vec_push(func->ir_func->blocks, bout);
3035 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
3042 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
3046 if (self->expression.outr) {
3047 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
3050 self->expression.outr = (ir_value*)1;
3052 if (self->is_continue)
3053 target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
3055 target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
3058 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
3062 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
3067 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
3069 ast_expression_codegen *cgen;
3071 ast_switch_case *def_case = NULL;
3072 ir_block *def_bfall = NULL;
3073 ir_block *def_bfall_to = NULL;
3074 bool set_def_bfall_to = false;
3076 ir_value *dummy = NULL;
3077 ir_value *irop = NULL;
3078 ir_block *bout = NULL;
3079 ir_block *bfall = NULL;
3087 compile_error(ast_ctx(self), "switch expression is not an l-value");
3091 if (self->expression.outr) {
3092 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
3095 self->expression.outr = (ir_value*)1;
3100 cgen = self->operand->codegen;
3101 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
3104 if (!vec_size(self->cases))
3107 cmpinstr = type_eq_instr[irop->vtype];
3108 if (cmpinstr >= VINSTR_END) {
3109 ast_type_to_string(self->operand, typestr, sizeof(typestr));
3110 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
3114 bout_id = vec_size(func->ir_func->blocks);
3115 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
3119 /* setup the break block */
3120 vec_push(func->breakblocks, bout);
3122 /* Now create all cases */
3123 for (c = 0; c < vec_size(self->cases); ++c) {
3124 ir_value *cond, *val;
3125 ir_block *bcase, *bnot;
3128 ast_switch_case *swcase = &self->cases[c];
3130 if (swcase->value) {
3131 /* A regular case */
3132 /* generate the condition operand */
3133 cgen = swcase->value->codegen;
3134 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
3136 /* generate the condition */
3137 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
3141 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
3142 bnot_id = vec_size(func->ir_func->blocks);
3143 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
3144 if (!bcase || !bnot)
3146 if (set_def_bfall_to) {
3147 set_def_bfall_to = false;
3148 def_bfall_to = bcase;
3150 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
3153 /* Make the previous case-end fall through */
3154 if (bfall && !bfall->final) {
3155 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
3159 /* enter the case */
3160 func->curblock = bcase;
3161 cgen = swcase->code->codegen;
3162 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
3165 /* remember this block to fall through from */
3166 bfall = func->curblock;
3168 /* enter the else and move it down */
3169 func->curblock = bnot;
3170 vec_remove(func->ir_func->blocks, bnot_id, 1);
3171 vec_push(func->ir_func->blocks, bnot);
3173 /* The default case */
3174 /* Remember where to fall through from: */
3177 /* remember which case it was */
3179 /* And the next case will be remembered */
3180 set_def_bfall_to = true;
3184 /* Jump from the last bnot to bout */
3185 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
3187 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
3192 /* If there was a default case, put it down here */
3196 /* No need to create an extra block */
3197 bcase = func->curblock;
3199 /* Insert the fallthrough jump */
3200 if (def_bfall && !def_bfall->final) {
3201 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
3205 /* Now generate the default code */
3206 cgen = def_case->code->codegen;
3207 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
3210 /* see if we need to fall through */
3211 if (def_bfall_to && !func->curblock->final)
3213 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
3218 /* Jump from the last bnot to bout */
3219 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
3221 /* enter the outgoing block */
3222 func->curblock = bout;
3224 /* restore the break block */
3225 vec_pop(func->breakblocks);
3227 /* Move 'bout' to the end, it's nicer */
3228 vec_remove(func->ir_func->blocks, bout_id, 1);
3229 vec_push(func->ir_func->blocks, bout);
3234 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3238 if (self->undefined) {
3239 compile_error(ast_ctx(self), "internal error: ast_label never defined");
3245 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3249 /* simply create a new block and jump to it */
3250 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3251 if (!self->irblock) {
3252 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3255 if (!func->curblock->final) {
3256 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3260 /* enter the new block */
3261 func->curblock = self->irblock;
3263 /* Generate all the leftover gotos */
3264 for (auto &it : self->gotos) {
3265 if (!ast_goto_codegen(it, func, false, &dummy))
3272 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3276 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3280 if (self->target->irblock) {
3281 if (self->irblock_from) {
3282 /* we already tried once, this is the callback */
3283 self->irblock_from->final = false;
3284 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3285 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3291 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3292 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3299 /* the target has not yet been created...
3300 * close this block in a sneaky way:
3302 func->curblock->final = true;
3303 self->irblock_from = func->curblock;
3304 ast_label_register_goto(self->target, self);
3311 bool ast_state_codegen(ast_state *self, ast_function *func, bool lvalue, ir_value **out)
3313 ast_expression_codegen *cgen;
3315 ir_value *frameval, *thinkval;
3318 compile_error(ast_ctx(self), "not an l-value (state operation)");
3321 if (self->expression.outr) {
3322 compile_error(ast_ctx(self), "internal error: ast_state cannot be reused!");
3327 cgen = self->framenum->codegen;
3328 if (!(*cgen)((ast_expression*)(self->framenum), func, false, &frameval))
3333 cgen = self->nextthink->codegen;
3334 if (!(*cgen)((ast_expression*)(self->nextthink), func, false, &thinkval))
3339 if (!ir_block_create_state_op(func->curblock, ast_ctx(self), frameval, thinkval)) {
3340 compile_error(ast_ctx(self), "failed to create STATE instruction");
3344 self->expression.outr = (ir_value*)1;
3348 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3350 ast_expression_codegen *cgen;
3352 ir_instr *callinstr;
3355 ir_value *funval = NULL;
3357 /* return values are never lvalues */
3359 compile_error(ast_ctx(self), "not an l-value (function call)");
3363 if (self->expression.outr) {
3364 *out = self->expression.outr;
3368 cgen = self->func->codegen;
3369 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3377 for (auto &it : self->params) {
3380 if (!(*cgen)(it, func, false, ¶m))
3384 vec_push(params, param);
3387 /* varargs counter */
3388 if (self->va_count) {
3390 ir_builder *builder = func->curblock->owner->owner;
3391 cgen = self->va_count->codegen;
3392 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3394 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3395 ir_builder_get_va_count(builder), va_count))
3401 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3402 ast_function_label(func, "call"),
3403 funval, !!(self->func->flags & AST_FLAG_NORETURN));
3407 for (i = 0; i < vec_size(params); ++i) {
3408 ir_call_param(callinstr, params[i]);
3411 *out = ir_call_value(callinstr);
3412 self->expression.outr = *out;
3414 codegen_output_type(self, *out);