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);
868 ast_propagate_effects(self, op);
873 void ast_switch_delete(ast_switch *self)
875 ast_unref(self->operand);
877 for (auto &it : self->cases) {
883 ast_expression_delete((ast_expression*)self);
887 ast_label* ast_label_new(lex_ctx_t ctx, const char *name, bool undefined)
889 ast_instantiate(ast_label, ctx, ast_label_delete);
890 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
892 self->expression.vtype = TYPE_NOEXPR;
894 self->name = util_strdup(name);
895 self->irblock = NULL;
896 self->undefined = undefined;
901 void ast_label_delete(ast_label *self)
903 mem_d((void*)self->name);
904 ast_expression_delete((ast_expression*)self);
908 static void ast_label_register_goto(ast_label *self, ast_goto *g)
910 self->gotos.push_back(g);
913 ast_goto* ast_goto_new(lex_ctx_t ctx, const char *name)
915 ast_instantiate(ast_goto, ctx, ast_goto_delete);
916 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
918 self->name = util_strdup(name);
920 self->irblock_from = NULL;
925 void ast_goto_delete(ast_goto *self)
927 mem_d((void*)self->name);
928 ast_expression_delete((ast_expression*)self);
932 void ast_goto_set_label(ast_goto *self, ast_label *label)
934 self->target = label;
937 ast_state* ast_state_new(lex_ctx_t ctx, ast_expression *frame, ast_expression *think)
939 ast_instantiate(ast_state, ctx, ast_state_delete);
940 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_state_codegen);
941 self->framenum = frame;
942 self->nextthink = think;
946 void ast_state_delete(ast_state *self)
949 ast_unref(self->framenum);
951 ast_unref(self->nextthink);
953 ast_expression_delete((ast_expression*)self);
957 ast_call* ast_call_new(lex_ctx_t ctx,
958 ast_expression *funcexpr)
960 ast_instantiate(ast_call, ctx, ast_call_delete);
961 if (!funcexpr->next) {
962 compile_error(ctx, "not a function");
966 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
968 ast_side_effects(self) = true;
970 self->func = funcexpr;
971 self->va_count = NULL;
973 ast_type_adopt(self, funcexpr->next);
978 void ast_call_delete(ast_call *self)
980 for (auto &it : self->params)
984 ast_unref(self->func);
987 ast_unref(self->va_count);
989 ast_expression_delete((ast_expression*)self);
993 static bool ast_call_check_vararg(ast_call *self, ast_expression *va_type, ast_expression *exp_type)
999 if (!va_type || !ast_compare_type(va_type, exp_type))
1001 if (va_type && exp_type)
1003 ast_type_to_string(va_type, tgot, sizeof(tgot));
1004 ast_type_to_string(exp_type, texp, sizeof(texp));
1005 if (OPTS_FLAG(UNSAFE_VARARGS)) {
1006 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1007 "piped variadic argument differs in type: constrained to type %s, expected type %s",
1011 compile_error(ast_ctx(self),
1012 "piped variadic argument differs in type: constrained to type %s, expected type %s",
1019 ast_type_to_string(exp_type, texp, sizeof(texp));
1020 if (OPTS_FLAG(UNSAFE_VARARGS)) {
1021 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1022 "piped variadic argument may differ in type: expected type %s",
1026 compile_error(ast_ctx(self),
1027 "piped variadic argument may differ in type: expected type %s",
1036 bool ast_call_check_types(ast_call *self, ast_expression *va_type)
1042 const ast_expression *func = self->func;
1043 size_t count = self->params.size();
1044 if (count > func->params.size())
1045 count = func->params.size();
1047 for (i = 0; i < count; ++i) {
1048 if (ast_istype(self->params[i], ast_argpipe)) {
1049 /* warn about type safety instead */
1051 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1054 if (!ast_call_check_vararg(self, va_type, (ast_expression*)func->params[i]))
1057 else if (!ast_compare_type(self->params[i], (ast_expression*)(func->params[i])))
1059 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1060 ast_type_to_string((ast_expression*)func->params[i], texp, sizeof(texp));
1061 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
1062 (unsigned int)(i+1), texp, tgot);
1063 /* we don't immediately return */
1067 count = self->params.size();
1068 if (count > func->params.size() && func->varparam) {
1069 for (; i < count; ++i) {
1070 if (ast_istype(self->params[i], ast_argpipe)) {
1071 /* warn about type safety instead */
1073 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1076 if (!ast_call_check_vararg(self, va_type, func->varparam))
1079 else if (!ast_compare_type(self->params[i], func->varparam))
1081 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1082 ast_type_to_string(func->varparam, texp, sizeof(texp));
1083 compile_error(ast_ctx(self), "invalid type for variadic parameter %u in function call: expected %s, got %s",
1084 (unsigned int)(i+1), texp, tgot);
1085 /* we don't immediately return */
1093 ast_store* ast_store_new(lex_ctx_t ctx, int op,
1094 ast_expression *dest, ast_expression *source)
1096 ast_instantiate(ast_store, ctx, ast_store_delete);
1097 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
1099 ast_side_effects(self) = true;
1103 self->source = source;
1105 ast_type_adopt(self, dest);
1110 void ast_store_delete(ast_store *self)
1112 ast_unref(self->dest);
1113 ast_unref(self->source);
1114 ast_expression_delete((ast_expression*)self);
1118 ast_block* ast_block_new(lex_ctx_t ctx)
1120 ast_instantiate(ast_block, ctx, ast_block_delete);
1121 ast_expression_init((ast_expression*)self,
1122 (ast_expression_codegen*)&ast_block_codegen);
1126 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1128 ast_propagate_effects(self, e);
1129 self->exprs.push_back(e);
1130 if (self->expression.next) {
1131 ast_delete(self->expression.next);
1132 self->expression.next = NULL;
1134 ast_type_adopt(self, e);
1138 void ast_block_collect(ast_block *self, ast_expression *expr)
1140 self->collect.push_back(expr);
1141 expr->node.keep = true;
1144 void ast_block_delete(ast_block *self)
1146 for (auto &it : self->exprs) ast_unref(it);
1147 for (auto &it : self->locals) ast_delete(it);
1148 for (auto &it : self->collect) ast_delete(it);
1149 ast_expression_delete((ast_expression*)self);
1153 void ast_block_set_type(ast_block *self, ast_expression *from)
1155 if (self->expression.next)
1156 ast_delete(self->expression.next);
1157 ast_type_adopt(self, from);
1160 ast_function* ast_function_new(lex_ctx_t ctx, const char *name, ast_value *vtype)
1162 ast_instantiate(ast_function, ctx, ast_function_delete);
1165 compile_error(ast_ctx(self), "internal error: ast_function_new condition 0");
1167 } else if (vtype->hasvalue || vtype->expression.vtype != TYPE_FUNCTION) {
1168 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1170 (int)vtype->hasvalue,
1171 vtype->expression.vtype);
1175 self->vtype = vtype;
1176 self->name = name ? util_strdup(name) : NULL;
1178 self->labelcount = 0;
1181 self->ir_func = NULL;
1182 self->curblock = NULL;
1184 vtype->hasvalue = true;
1185 vtype->constval.vfunc = self;
1187 self->varargs = NULL;
1189 self->fixedparams = NULL;
1190 self->return_value = NULL;
1191 self->static_count = 0;
1200 void ast_function_delete(ast_function *self)
1203 mem_d((void*)self->name);
1205 /* ast_value_delete(self->vtype); */
1206 self->vtype->hasvalue = false;
1207 self->vtype->constval.vfunc = NULL;
1208 /* We use unref - if it was stored in a global table it is supposed
1209 * to be deleted from *there*
1211 ast_unref(self->vtype);
1213 for (auto &it : self->static_names)
1215 for (auto &it : self->blocks)
1218 ast_delete(self->varargs);
1220 ast_delete(self->argc);
1221 if (self->fixedparams)
1222 ast_unref(self->fixedparams);
1223 if (self->return_value)
1224 ast_unref(self->return_value);
1228 const char* ast_function_label(ast_function *self, const char *prefix)
1234 if (!OPTS_OPTION_BOOL(OPTION_DUMP) &&
1235 !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
1236 !OPTS_OPTION_BOOL(OPTION_DEBUG))
1241 id = (self->labelcount++);
1242 len = strlen(prefix);
1244 from = self->labelbuf + sizeof(self->labelbuf)-1;
1247 *from-- = (id%10) + '0';
1251 memcpy(from - len, prefix, len);
1255 /*********************************************************************/
1257 * by convention you must never pass NULL to the 'ir_value **out'
1258 * parameter. If you really don't care about the output, pass a dummy.
1259 * But I can't imagine a pituation where the output is truly unnecessary.
1262 static void _ast_codegen_output_type(ast_expression *self, ir_value *out)
1264 if (out->vtype == TYPE_FIELD)
1265 out->fieldtype = self->next->vtype;
1266 if (out->vtype == TYPE_FUNCTION)
1267 out->outtype = self->next->vtype;
1270 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1272 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1276 if (self->expression.vtype == TYPE_NIL) {
1277 *out = func->ir_func->owner->nil;
1280 /* NOTE: This is the codegen for a variable used in an expression.
1281 * It is not the codegen to generate the value. For this purpose,
1282 * ast_local_codegen and ast_global_codegen are to be used before this
1283 * is executed. ast_function_codegen should take care of its locals,
1284 * and the ast-user should take care of ast_global_codegen to be used
1285 * on all the globals.
1288 char tname[1024]; /* typename is reserved in C++ */
1289 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1290 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1297 static bool ast_global_array_set(ast_value *self)
1299 size_t count = self->initlist.size();
1302 if (count > self->expression.count) {
1303 compile_error(ast_ctx(self), "too many elements in initializer");
1304 count = self->expression.count;
1306 else if (count < self->expression.count) {
1308 compile_warning(ast_ctx(self), "not all elements are initialized");
1312 for (i = 0; i != count; ++i) {
1313 switch (self->expression.next->vtype) {
1315 if (!ir_value_set_float(self->ir_values[i], self->initlist[i].vfloat))
1319 if (!ir_value_set_vector(self->ir_values[i], self->initlist[i].vvec))
1323 if (!ir_value_set_string(self->ir_values[i], self->initlist[i].vstring))
1327 /* we don't support them in any other place yet either */
1328 compile_error(ast_ctx(self), "TODO: nested arrays");
1331 /* this requiers a bit more work - similar to the fields I suppose */
1332 compile_error(ast_ctx(self), "global of type function not properly generated");
1335 if (!self->initlist[i].vfield) {
1336 compile_error(ast_ctx(self), "field constant without vfield set");
1339 if (!self->initlist[i].vfield->ir_v) {
1340 compile_error(ast_ctx(self), "field constant generated before its field");
1343 if (!ir_value_set_field(self->ir_values[i], self->initlist[i].vfield->ir_v))
1347 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1354 static bool check_array(ast_value *self, ast_value *array)
1356 if (array->expression.flags & AST_FLAG_ARRAY_INIT && array->initlist.empty()) {
1357 compile_error(ast_ctx(self), "array without size: %s", self->name);
1360 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1361 if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1362 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1368 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1372 if (self->expression.vtype == TYPE_NIL) {
1373 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1377 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1379 ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->vtype);
1382 func->context = ast_ctx(self);
1383 func->value->context = ast_ctx(self);
1385 self->constval.vfunc->ir_func = func;
1386 self->ir_v = func->value;
1387 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1388 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1389 if (self->expression.flags & AST_FLAG_ERASEABLE)
1390 self->ir_v->flags |= IR_FLAG_ERASABLE;
1391 if (self->expression.flags & AST_FLAG_BLOCK_COVERAGE)
1392 func->flags |= IR_FLAG_BLOCK_COVERAGE;
1393 /* The function is filled later on ast_function_codegen... */
1397 if (isfield && self->expression.vtype == TYPE_FIELD) {
1398 ast_expression *fieldtype = self->expression.next;
1400 if (self->hasvalue) {
1401 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1405 if (fieldtype->vtype == TYPE_ARRAY) {
1410 ast_expression *elemtype;
1412 ast_value *array = (ast_value*)fieldtype;
1414 if (!ast_istype(fieldtype, ast_value)) {
1415 compile_error(ast_ctx(self), "internal error: ast_value required");
1419 if (!check_array(self, array))
1422 elemtype = array->expression.next;
1423 vtype = elemtype->vtype;
1425 v = ir_builder_create_field(ir, self->name, vtype);
1427 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1430 v->context = ast_ctx(self);
1431 v->unique_life = true;
1433 array->ir_v = self->ir_v = v;
1435 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1436 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1437 if (self->expression.flags & AST_FLAG_ERASEABLE)
1438 self->ir_v->flags |= IR_FLAG_ERASABLE;
1440 namelen = strlen(self->name);
1441 name = (char*)mem_a(namelen + 16);
1442 util_strncpy(name, self->name, namelen);
1444 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1445 array->ir_values[0] = v;
1446 for (ai = 1; ai < array->expression.count; ++ai) {
1447 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1448 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1449 if (!array->ir_values[ai]) {
1451 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1454 array->ir_values[ai]->context = ast_ctx(self);
1455 array->ir_values[ai]->unique_life = true;
1456 array->ir_values[ai]->locked = true;
1457 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1458 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1464 v = ir_builder_create_field(ir, self->name, self->expression.next->vtype);
1467 v->context = ast_ctx(self);
1469 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1470 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1472 if (self->expression.flags & AST_FLAG_ERASEABLE)
1473 self->ir_v->flags |= IR_FLAG_ERASABLE;
1478 if (self->expression.vtype == TYPE_ARRAY) {
1483 ast_expression *elemtype = self->expression.next;
1484 int vtype = elemtype->vtype;
1486 if (self->expression.flags & AST_FLAG_ARRAY_INIT && !self->expression.count) {
1487 compile_error(ast_ctx(self), "array `%s' has no size", self->name);
1491 /* same as with field arrays */
1492 if (!check_array(self, self))
1495 v = ir_builder_create_global(ir, self->name, vtype);
1497 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1500 v->context = ast_ctx(self);
1501 v->unique_life = true;
1504 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1505 v->flags |= IR_FLAG_INCLUDE_DEF;
1506 if (self->expression.flags & AST_FLAG_ERASEABLE)
1507 self->ir_v->flags |= IR_FLAG_ERASABLE;
1509 namelen = strlen(self->name);
1510 name = (char*)mem_a(namelen + 16);
1511 util_strncpy(name, self->name, namelen);
1513 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1514 self->ir_values[0] = v;
1515 for (ai = 1; ai < self->expression.count; ++ai) {
1516 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1517 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1518 if (!self->ir_values[ai]) {
1520 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1523 self->ir_values[ai]->context = ast_ctx(self);
1524 self->ir_values[ai]->unique_life = true;
1525 self->ir_values[ai]->locked = true;
1526 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1527 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1533 /* Arrays don't do this since there's no "array" value which spans across the
1536 v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1538 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1541 codegen_output_type(self, v);
1542 v->context = ast_ctx(self);
1545 /* link us to the ir_value */
1549 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1550 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1551 if (self->expression.flags & AST_FLAG_ERASEABLE)
1552 self->ir_v->flags |= IR_FLAG_ERASABLE;
1555 if (self->hasvalue) {
1556 switch (self->expression.vtype)
1559 if (!ir_value_set_float(v, self->constval.vfloat))
1563 if (!ir_value_set_vector(v, self->constval.vvec))
1567 if (!ir_value_set_string(v, self->constval.vstring))
1571 ast_global_array_set(self);
1574 compile_error(ast_ctx(self), "global of type function not properly generated");
1576 /* Cannot generate an IR value for a function,
1577 * need a pointer pointing to a function rather.
1580 if (!self->constval.vfield) {
1581 compile_error(ast_ctx(self), "field constant without vfield set");
1584 if (!self->constval.vfield->ir_v) {
1585 compile_error(ast_ctx(self), "field constant generated before its field");
1588 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1592 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1598 error: /* clean up */
1599 if(v) ir_value_delete(v);
1603 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1607 if (self->expression.vtype == TYPE_NIL) {
1608 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1612 if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1614 /* Do we allow local functions? I think not...
1615 * this is NOT a function pointer atm.
1620 if (self->expression.vtype == TYPE_ARRAY) {
1625 ast_expression *elemtype = self->expression.next;
1626 int vtype = elemtype->vtype;
1628 func->flags |= IR_FLAG_HAS_ARRAYS;
1630 if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1631 compile_error(ast_ctx(self), "array-parameters are not supported");
1635 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1636 if (!check_array(self, self))
1639 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1640 if (!self->ir_values) {
1641 compile_error(ast_ctx(self), "failed to allocate array values");
1645 v = ir_function_create_local(func, self->name, vtype, param);
1647 compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1650 v->context = ast_ctx(self);
1651 v->unique_life = true;
1654 namelen = strlen(self->name);
1655 name = (char*)mem_a(namelen + 16);
1656 util_strncpy(name, self->name, namelen);
1658 self->ir_values[0] = v;
1659 for (ai = 1; ai < self->expression.count; ++ai) {
1660 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1661 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1662 if (!self->ir_values[ai]) {
1663 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1666 self->ir_values[ai]->context = ast_ctx(self);
1667 self->ir_values[ai]->unique_life = true;
1668 self->ir_values[ai]->locked = true;
1674 v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1677 codegen_output_type(self, v);
1678 v->context = ast_ctx(self);
1681 /* A constant local... hmmm...
1682 * I suppose the IR will have to deal with this
1684 if (self->hasvalue) {
1685 switch (self->expression.vtype)
1688 if (!ir_value_set_float(v, self->constval.vfloat))
1692 if (!ir_value_set_vector(v, self->constval.vvec))
1696 if (!ir_value_set_string(v, self->constval.vstring))
1700 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1705 /* link us to the ir_value */
1709 if (!ast_generate_accessors(self, func->owner))
1713 error: /* clean up */
1718 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1721 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1722 if (!self->setter || !self->getter)
1724 for (i = 0; i < self->expression.count; ++i) {
1725 if (!self->ir_values) {
1726 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1729 if (!self->ir_values[i]) {
1730 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1733 if (self->ir_values[i]->life) {
1734 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1739 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1741 if (!ast_global_codegen (self->setter, ir, false) ||
1742 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1743 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1745 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1746 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1751 if (!ast_global_codegen (self->getter, ir, false) ||
1752 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1753 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1755 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1756 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1760 for (i = 0; i < self->expression.count; ++i) {
1761 vec_free(self->ir_values[i]->life);
1763 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1767 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1772 ast_expression_codegen *cgen;
1776 irf = self->ir_func;
1778 compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1782 /* fill the parameter list */
1783 ec = &self->vtype->expression;
1784 for (auto &it : ec->params) {
1785 if (it->expression.vtype == TYPE_FIELD)
1786 vec_push(irf->params, it->expression.next->vtype);
1788 vec_push(irf->params, it->expression.vtype);
1789 if (!self->builtin) {
1790 if (!ast_local_codegen(it, self->ir_func, true))
1795 if (self->varargs) {
1796 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1798 irf->max_varargs = self->varargs->expression.count;
1801 if (self->builtin) {
1802 irf->builtin = self->builtin;
1806 /* have a local return value variable? */
1807 if (self->return_value) {
1808 if (!ast_local_codegen(self->return_value, self->ir_func, false))
1812 if (self->blocks.empty()) {
1813 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1817 irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1818 if (!self->curblock) {
1819 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1827 if (!ast_local_codegen(self->argc, self->ir_func, true))
1829 cgen = self->argc->expression.codegen;
1830 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1832 cgen = self->fixedparams->expression.codegen;
1833 if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1835 sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1836 ast_function_label(self, "va_count"), INSTR_SUB_F,
1837 ir_builder_get_va_count(ir), fixed);
1840 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1847 for (auto &it : self->blocks) {
1848 cgen = it->expression.codegen;
1849 if (!(*cgen)((ast_expression*)it, self, false, &dummy))
1853 /* TODO: check return types */
1854 if (!self->curblock->final)
1856 if (!self->vtype->expression.next ||
1857 self->vtype->expression.next->vtype == TYPE_VOID)
1859 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1861 else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1863 if (self->return_value) {
1864 cgen = self->return_value->expression.codegen;
1865 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1867 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1869 else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1870 "control reaches end of non-void function (`%s`) via %s",
1871 self->name, self->curblock->label))
1875 return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1881 static bool starts_a_label(ast_expression *ex)
1883 while (ex && ast_istype(ex, ast_block)) {
1884 ast_block *b = (ast_block*)ex;
1889 return ast_istype(ex, ast_label);
1892 /* Note, you will not see ast_block_codegen generate ir_blocks.
1893 * To the AST and the IR, blocks are 2 different things.
1894 * In the AST it represents a block of code, usually enclosed in
1895 * curly braces {...}.
1896 * While in the IR it represents a block in terms of control-flow.
1898 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1900 /* We don't use this
1901 * Note: an ast-representation using the comma-operator
1902 * of the form: (a, b, c) = x should not assign to c...
1905 compile_error(ast_ctx(self), "not an l-value (code-block)");
1909 if (self->expression.outr) {
1910 *out = self->expression.outr;
1914 /* output is NULL at first, we'll have each expression
1915 * assign to out output, thus, a comma-operator represention
1916 * using an ast_block will return the last generated value,
1917 * so: (b, c) + a executed both b and c, and returns c,
1918 * which is then added to a.
1922 /* generate locals */
1923 for (auto &it : self->locals) {
1924 if (!ast_local_codegen(it, func->ir_func, false)) {
1925 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1926 compile_error(ast_ctx(self), "failed to generate local `%s`", it->name);
1931 for (auto &it : self->exprs) {
1932 ast_expression_codegen *gen;
1933 if (func->curblock->final && !starts_a_label(it)) {
1934 if (compile_warning(ast_ctx(it), WARN_UNREACHABLE_CODE, "unreachable statement"))
1939 if (!(*gen)(it, func, false, out))
1943 self->expression.outr = *out;
1948 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1950 ast_expression_codegen *cgen;
1951 ir_value *left = NULL;
1952 ir_value *right = NULL;
1956 ast_array_index *ai = NULL;
1958 if (lvalue && self->expression.outl) {
1959 *out = self->expression.outl;
1963 if (!lvalue && self->expression.outr) {
1964 *out = self->expression.outr;
1968 if (ast_istype(self->dest, ast_array_index))
1971 ai = (ast_array_index*)self->dest;
1972 idx = (ast_value*)ai->index;
1974 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1979 /* we need to call the setter */
1980 ir_value *iridx, *funval;
1984 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1988 arr = (ast_value*)ai->array;
1989 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1990 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1994 cgen = idx->expression.codegen;
1995 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1998 cgen = arr->setter->expression.codegen;
1999 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2002 cgen = self->source->codegen;
2003 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2006 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2009 ir_call_param(call, iridx);
2010 ir_call_param(call, right);
2011 self->expression.outr = right;
2017 cgen = self->dest->codegen;
2019 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
2021 self->expression.outl = left;
2023 cgen = self->source->codegen;
2025 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2028 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
2030 self->expression.outr = right;
2033 /* Theoretically, an assinment returns its left side as an
2034 * lvalue, if we don't need an lvalue though, we return
2035 * the right side as an rvalue, otherwise we have to
2036 * somehow know whether or not we need to dereference the pointer
2037 * on the left side - that is: OP_LOAD if it was an address.
2038 * Also: in original QC we cannot OP_LOADP *anyway*.
2040 *out = (lvalue ? left : right);
2045 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
2047 ast_expression_codegen *cgen;
2048 ir_value *left, *right;
2050 /* A binary operation cannot yield an l-value */
2052 compile_error(ast_ctx(self), "not an l-value (binop)");
2056 if (self->expression.outr) {
2057 *out = self->expression.outr;
2061 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
2062 (self->op == INSTR_AND || self->op == INSTR_OR))
2064 /* NOTE: The short-logic path will ignore right_first */
2066 /* short circuit evaluation */
2067 ir_block *other, *merge;
2068 ir_block *from_left, *from_right;
2072 /* prepare end-block */
2073 merge_id = vec_size(func->ir_func->blocks);
2074 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
2076 /* generate the left expression */
2077 cgen = self->left->codegen;
2078 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2080 /* remember the block */
2081 from_left = func->curblock;
2083 /* create a new block for the right expression */
2084 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
2085 if (self->op == INSTR_AND) {
2086 /* on AND: left==true -> other */
2087 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
2090 /* on OR: left==false -> other */
2091 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
2094 /* use the likely flag */
2095 vec_last(func->curblock->instr)->likely = true;
2097 /* enter the right-expression's block */
2098 func->curblock = other;
2100 cgen = self->right->codegen;
2101 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2103 /* remember block */
2104 from_right = func->curblock;
2106 /* jump to the merge block */
2107 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
2110 vec_remove(func->ir_func->blocks, merge_id, 1);
2111 vec_push(func->ir_func->blocks, merge);
2113 func->curblock = merge;
2114 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
2115 ast_function_label(func, "sce_value"),
2116 self->expression.vtype);
2117 ir_phi_add(phi, from_left, left);
2118 ir_phi_add(phi, from_right, right);
2119 *out = ir_phi_value(phi);
2123 if (!OPTS_FLAG(PERL_LOGIC)) {
2125 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
2126 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2127 ast_function_label(func, "sce_bool_v"),
2131 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2132 ast_function_label(func, "sce_bool"),
2137 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
2138 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2139 ast_function_label(func, "sce_bool_s"),
2143 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2144 ast_function_label(func, "sce_bool"),
2150 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
2151 ast_function_label(func, "sce_bool"),
2152 INSTR_AND, *out, *out);
2158 self->expression.outr = *out;
2159 codegen_output_type(self, *out);
2163 if (self->right_first) {
2164 cgen = self->right->codegen;
2165 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2167 cgen = self->left->codegen;
2168 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2171 cgen = self->left->codegen;
2172 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2174 cgen = self->right->codegen;
2175 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2179 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
2180 self->op, left, right);
2183 self->expression.outr = *out;
2184 codegen_output_type(self, *out);
2189 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
2191 ast_expression_codegen *cgen;
2192 ir_value *leftl = NULL, *leftr, *right, *bin;
2196 ast_array_index *ai = NULL;
2197 ir_value *iridx = NULL;
2199 if (lvalue && self->expression.outl) {
2200 *out = self->expression.outl;
2204 if (!lvalue && self->expression.outr) {
2205 *out = self->expression.outr;
2209 if (ast_istype(self->dest, ast_array_index))
2212 ai = (ast_array_index*)self->dest;
2213 idx = (ast_value*)ai->index;
2215 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2219 /* for a binstore we need both an lvalue and an rvalue for the left side */
2220 /* rvalue of destination! */
2222 cgen = idx->expression.codegen;
2223 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2226 cgen = self->dest->codegen;
2227 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2230 /* source as rvalue only */
2231 cgen = self->source->codegen;
2232 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2235 /* now the binary */
2236 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2237 self->opbin, leftr, right);
2238 self->expression.outr = bin;
2242 /* we need to call the setter */
2247 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2251 arr = (ast_value*)ai->array;
2252 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2253 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2257 cgen = arr->setter->expression.codegen;
2258 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2261 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2264 ir_call_param(call, iridx);
2265 ir_call_param(call, bin);
2266 self->expression.outr = bin;
2268 /* now store them */
2269 cgen = self->dest->codegen;
2270 /* lvalue of destination */
2271 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2273 self->expression.outl = leftl;
2275 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2277 self->expression.outr = bin;
2280 /* Theoretically, an assinment returns its left side as an
2281 * lvalue, if we don't need an lvalue though, we return
2282 * the right side as an rvalue, otherwise we have to
2283 * somehow know whether or not we need to dereference the pointer
2284 * on the left side - that is: OP_LOAD if it was an address.
2285 * Also: in original QC we cannot OP_LOADP *anyway*.
2287 *out = (lvalue ? leftl : bin);
2292 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2294 ast_expression_codegen *cgen;
2297 /* An unary operation cannot yield an l-value */
2299 compile_error(ast_ctx(self), "not an l-value (binop)");
2303 if (self->expression.outr) {
2304 *out = self->expression.outr;
2308 cgen = self->operand->codegen;
2310 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2313 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2317 self->expression.outr = *out;
2322 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2324 ast_expression_codegen *cgen;
2329 /* In the context of a return operation, we don't actually return
2333 compile_error(ast_ctx(self), "return-expression is not an l-value");
2337 if (self->expression.outr) {
2338 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2341 self->expression.outr = (ir_value*)1;
2343 if (self->operand) {
2344 cgen = self->operand->codegen;
2346 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2349 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2352 if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2359 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2361 ast_expression_codegen *cgen;
2362 ir_value *ent, *field;
2364 /* This function needs to take the 'lvalue' flag into account!
2365 * As lvalue we provide a field-pointer, as rvalue we provide the
2369 if (lvalue && self->expression.outl) {
2370 *out = self->expression.outl;
2374 if (!lvalue && self->expression.outr) {
2375 *out = self->expression.outr;
2379 cgen = self->entity->codegen;
2380 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2383 cgen = self->field->codegen;
2384 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2389 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2392 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2393 ent, field, self->expression.vtype);
2394 /* Done AFTER error checking:
2395 codegen_output_type(self, *out);
2399 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2400 (lvalue ? "ADDRESS" : "FIELD"),
2401 type_name[self->expression.vtype]);
2405 codegen_output_type(self, *out);
2408 self->expression.outl = *out;
2410 self->expression.outr = *out;
2412 /* Hm that should be it... */
2416 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2418 ast_expression_codegen *cgen;
2421 /* in QC this is always an lvalue */
2422 if (lvalue && self->rvalue) {
2423 compile_error(ast_ctx(self), "not an l-value (member access)");
2426 if (self->expression.outl) {
2427 *out = self->expression.outl;
2431 cgen = self->owner->codegen;
2432 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2435 if (vec->vtype != TYPE_VECTOR &&
2436 !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2441 *out = ir_value_vector_member(vec, self->field);
2442 self->expression.outl = *out;
2444 return (*out != NULL);
2447 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2452 if (!lvalue && self->expression.outr) {
2453 *out = self->expression.outr;
2456 if (lvalue && self->expression.outl) {
2457 *out = self->expression.outl;
2461 if (!ast_istype(self->array, ast_value)) {
2462 compile_error(ast_ctx(self), "array indexing this way is not supported");
2463 /* note this would actually be pointer indexing because the left side is
2464 * not an actual array but (hopefully) an indexable expression.
2465 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2466 * support this path will be filled.
2471 arr = (ast_value*)self->array;
2472 idx = (ast_value*)self->index;
2474 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2475 /* Time to use accessor functions */
2476 ast_expression_codegen *cgen;
2477 ir_value *iridx, *funval;
2481 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2486 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2490 cgen = self->index->codegen;
2491 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2494 cgen = arr->getter->expression.codegen;
2495 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2498 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2501 ir_call_param(call, iridx);
2503 *out = ir_call_value(call);
2504 self->expression.outr = *out;
2505 (*out)->vtype = self->expression.vtype;
2506 codegen_output_type(self, *out);
2510 if (idx->expression.vtype == TYPE_FLOAT) {
2511 unsigned int arridx = idx->constval.vfloat;
2512 if (arridx >= self->array->count)
2514 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2517 *out = arr->ir_values[arridx];
2519 else if (idx->expression.vtype == TYPE_INTEGER) {
2520 unsigned int arridx = idx->constval.vint;
2521 if (arridx >= self->array->count)
2523 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2526 *out = arr->ir_values[arridx];
2529 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2532 (*out)->vtype = self->expression.vtype;
2533 codegen_output_type(self, *out);
2537 bool ast_argpipe_codegen(ast_argpipe *self, ast_function *func, bool lvalue, ir_value **out)
2541 compile_error(ast_ctx(self), "argpipe node: not an lvalue");
2546 compile_error(ast_ctx(self), "TODO: argpipe codegen not implemented");
2550 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2552 ast_expression_codegen *cgen;
2560 ir_block *ontrue_endblock = NULL;
2561 ir_block *onfalse_endblock = NULL;
2562 ir_block *merge = NULL;
2565 /* We don't output any value, thus also don't care about r/lvalue */
2569 if (self->expression.outr) {
2570 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2573 self->expression.outr = (ir_value*)1;
2575 /* generate the condition */
2576 cgen = self->cond->codegen;
2577 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2579 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2580 cond = func->curblock;
2582 /* try constant folding away the condition */
2583 if ((fold = fold_cond_ifthen(condval, func, self)) != -1)
2586 if (self->on_true) {
2587 /* create on-true block */
2588 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2592 /* enter the block */
2593 func->curblock = ontrue;
2596 cgen = self->on_true->codegen;
2597 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2600 /* we now need to work from the current endpoint */
2601 ontrue_endblock = func->curblock;
2606 if (self->on_false) {
2607 /* create on-false block */
2608 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2612 /* enter the block */
2613 func->curblock = onfalse;
2616 cgen = self->on_false->codegen;
2617 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2620 /* we now need to work from the current endpoint */
2621 onfalse_endblock = func->curblock;
2625 /* Merge block were they all merge in to */
2626 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2628 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2631 /* add jumps ot the merge block */
2632 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2634 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2637 /* Now enter the merge block */
2638 func->curblock = merge;
2641 /* we create the if here, that way all blocks are ordered :)
2643 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2644 (ontrue ? ontrue : merge),
2645 (onfalse ? onfalse : merge)))
2653 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2655 ast_expression_codegen *cgen;
2658 ir_value *trueval, *falseval;
2661 ir_block *cond = func->curblock;
2662 ir_block *cond_out = NULL;
2663 ir_block *ontrue, *ontrue_out = NULL;
2664 ir_block *onfalse, *onfalse_out = NULL;
2668 /* Ternary can never create an lvalue... */
2672 /* In theory it shouldn't be possible to pass through a node twice, but
2673 * in case we add any kind of optimization pass for the AST itself, it
2674 * may still happen, thus we remember a created ir_value and simply return one
2675 * if it already exists.
2677 if (self->expression.outr) {
2678 *out = self->expression.outr;
2682 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2684 /* generate the condition */
2685 func->curblock = cond;
2686 cgen = self->cond->codegen;
2687 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2689 cond_out = func->curblock;
2691 /* try constant folding away the condition */
2692 if ((fold = fold_cond_ternary(condval, func, self)) != -1)
2695 /* create on-true block */
2696 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2701 /* enter the block */
2702 func->curblock = ontrue;
2705 cgen = self->on_true->codegen;
2706 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2709 ontrue_out = func->curblock;
2712 /* create on-false block */
2713 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2718 /* enter the block */
2719 func->curblock = onfalse;
2722 cgen = self->on_false->codegen;
2723 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2726 onfalse_out = func->curblock;
2729 /* create merge block */
2730 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2733 /* jump to merge block */
2734 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2736 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2739 /* create if instruction */
2740 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2743 /* Now enter the merge block */
2744 func->curblock = merge;
2746 /* Here, now, we need a PHI node
2747 * but first some sanity checking...
2749 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2750 /* error("ternary with different types on the two sides"); */
2751 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2756 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2758 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2761 ir_phi_add(phi, ontrue_out, trueval);
2762 ir_phi_add(phi, onfalse_out, falseval);
2764 self->expression.outr = ir_phi_value(phi);
2765 *out = self->expression.outr;
2767 codegen_output_type(self, *out);
2772 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2774 ast_expression_codegen *cgen;
2776 ir_value *dummy = NULL;
2777 ir_value *precond = NULL;
2778 ir_value *postcond = NULL;
2780 /* Since we insert some jumps "late" so we have blocks
2781 * ordered "nicely", we need to keep track of the actual end-blocks
2782 * of expressions to add the jumps to.
2784 ir_block *bbody = NULL, *end_bbody = NULL;
2785 ir_block *bprecond = NULL, *end_bprecond = NULL;
2786 ir_block *bpostcond = NULL, *end_bpostcond = NULL;
2787 ir_block *bincrement = NULL, *end_bincrement = NULL;
2788 ir_block *bout = NULL, *bin = NULL;
2790 /* let's at least move the outgoing block to the end */
2793 /* 'break' and 'continue' need to be able to find the right blocks */
2794 ir_block *bcontinue = NULL;
2795 ir_block *bbreak = NULL;
2797 ir_block *tmpblock = NULL;
2802 if (self->expression.outr) {
2803 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2806 self->expression.outr = (ir_value*)1;
2809 * Should we ever need some kind of block ordering, better make this function
2810 * move blocks around than write a block ordering algorithm later... after all
2811 * the ast and ir should work together, not against each other.
2814 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2815 * anyway if for example it contains a ternary.
2819 cgen = self->initexpr->codegen;
2820 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2824 /* Store the block from which we enter this chaos */
2825 bin = func->curblock;
2827 /* The pre-loop condition needs its own block since we
2828 * need to be able to jump to the start of that expression.
2832 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2836 /* the pre-loop-condition the least important place to 'continue' at */
2837 bcontinue = bprecond;
2840 func->curblock = bprecond;
2843 cgen = self->precond->codegen;
2844 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2847 end_bprecond = func->curblock;
2849 bprecond = end_bprecond = NULL;
2852 /* Now the next blocks won't be ordered nicely, but we need to
2853 * generate them this early for 'break' and 'continue'.
2855 if (self->increment) {
2856 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2859 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2861 bincrement = end_bincrement = NULL;
2864 if (self->postcond) {
2865 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2868 bcontinue = bpostcond; /* postcond comes before the increment */
2870 bpostcond = end_bpostcond = NULL;
2873 bout_id = vec_size(func->ir_func->blocks);
2874 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2879 /* The loop body... */
2880 /* if (self->body) */
2882 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2887 func->curblock = bbody;
2889 func->breakblocks.push_back(bbreak);
2891 func->continueblocks.push_back(bcontinue);
2893 func->continueblocks.push_back(bbody);
2897 cgen = self->body->codegen;
2898 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2902 end_bbody = func->curblock;
2903 func->breakblocks.pop_back();
2904 func->continueblocks.pop_back();
2907 /* post-loop-condition */
2911 func->curblock = bpostcond;
2914 cgen = self->postcond->codegen;
2915 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2918 end_bpostcond = func->curblock;
2921 /* The incrementor */
2922 if (self->increment)
2925 func->curblock = bincrement;
2928 cgen = self->increment->codegen;
2929 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2932 end_bincrement = func->curblock;
2935 /* In any case now, we continue from the outgoing block */
2936 func->curblock = bout;
2938 /* Now all blocks are in place */
2939 /* From 'bin' we jump to whatever comes first */
2940 if (bprecond) tmpblock = bprecond;
2941 else tmpblock = bbody; /* can never be null */
2944 else if (bpostcond) tmpblock = bpostcond;
2945 else tmpblock = bout;
2948 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2954 ir_block *ontrue, *onfalse;
2955 ontrue = bbody; /* can never be null */
2957 /* all of this is dead code
2958 else if (bincrement) ontrue = bincrement;
2959 else ontrue = bpostcond;
2963 if (self->pre_not) {
2968 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2975 if (bincrement) tmpblock = bincrement;
2976 else if (bpostcond) tmpblock = bpostcond;
2977 else if (bprecond) tmpblock = bprecond;
2978 else tmpblock = bbody;
2979 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2983 /* from increment */
2986 if (bpostcond) tmpblock = bpostcond;
2987 else if (bprecond) tmpblock = bprecond;
2988 else if (bbody) tmpblock = bbody;
2989 else tmpblock = bout;
2990 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2997 ir_block *ontrue, *onfalse;
2998 if (bprecond) ontrue = bprecond;
2999 else ontrue = bbody; /* can never be null */
3001 /* all of this is dead code
3002 else if (bincrement) ontrue = bincrement;
3003 else ontrue = bpostcond;
3007 if (self->post_not) {
3012 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
3016 /* Move 'bout' to the end */
3017 vec_remove(func->ir_func->blocks, bout_id, 1);
3018 vec_push(func->ir_func->blocks, bout);
3023 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
3030 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
3034 if (self->expression.outr) {
3035 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
3038 self->expression.outr = (ir_value*)1;
3040 if (self->is_continue)
3041 target = func->continueblocks[func->continueblocks.size()-1-self->levels];
3043 target = func->breakblocks[func->breakblocks.size()-1-self->levels];
3046 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
3050 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
3055 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
3057 ast_expression_codegen *cgen;
3059 ast_switch_case *def_case = NULL;
3060 ir_block *def_bfall = NULL;
3061 ir_block *def_bfall_to = NULL;
3062 bool set_def_bfall_to = false;
3064 ir_value *dummy = NULL;
3065 ir_value *irop = NULL;
3066 ir_block *bout = NULL;
3067 ir_block *bfall = NULL;
3074 compile_error(ast_ctx(self), "switch expression is not an l-value");
3078 if (self->expression.outr) {
3079 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
3082 self->expression.outr = (ir_value*)1;
3087 cgen = self->operand->codegen;
3088 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
3091 if (self->cases.empty())
3094 cmpinstr = type_eq_instr[irop->vtype];
3095 if (cmpinstr >= VINSTR_END) {
3096 ast_type_to_string(self->operand, typestr, sizeof(typestr));
3097 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
3101 bout_id = vec_size(func->ir_func->blocks);
3102 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
3106 /* setup the break block */
3107 func->breakblocks.push_back(bout);
3109 /* Now create all cases */
3110 for (auto &it : self->cases) {
3111 ir_value *cond, *val;
3112 ir_block *bcase, *bnot;
3115 ast_switch_case *swcase = ⁢
3117 if (swcase->value) {
3118 /* A regular case */
3119 /* generate the condition operand */
3120 cgen = swcase->value->codegen;
3121 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
3123 /* generate the condition */
3124 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
3128 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
3129 bnot_id = vec_size(func->ir_func->blocks);
3130 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
3131 if (!bcase || !bnot)
3133 if (set_def_bfall_to) {
3134 set_def_bfall_to = false;
3135 def_bfall_to = bcase;
3137 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
3140 /* Make the previous case-end fall through */
3141 if (bfall && !bfall->final) {
3142 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
3146 /* enter the case */
3147 func->curblock = bcase;
3148 cgen = swcase->code->codegen;
3149 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
3152 /* remember this block to fall through from */
3153 bfall = func->curblock;
3155 /* enter the else and move it down */
3156 func->curblock = bnot;
3157 vec_remove(func->ir_func->blocks, bnot_id, 1);
3158 vec_push(func->ir_func->blocks, bnot);
3160 /* The default case */
3161 /* Remember where to fall through from: */
3164 /* remember which case it was */
3166 /* And the next case will be remembered */
3167 set_def_bfall_to = true;
3171 /* Jump from the last bnot to bout */
3172 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
3174 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
3179 /* If there was a default case, put it down here */
3183 /* No need to create an extra block */
3184 bcase = func->curblock;
3186 /* Insert the fallthrough jump */
3187 if (def_bfall && !def_bfall->final) {
3188 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
3192 /* Now generate the default code */
3193 cgen = def_case->code->codegen;
3194 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
3197 /* see if we need to fall through */
3198 if (def_bfall_to && !func->curblock->final)
3200 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
3205 /* Jump from the last bnot to bout */
3206 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
3208 /* enter the outgoing block */
3209 func->curblock = bout;
3211 /* restore the break block */
3212 func->breakblocks.pop_back();
3214 /* Move 'bout' to the end, it's nicer */
3215 vec_remove(func->ir_func->blocks, bout_id, 1);
3216 vec_push(func->ir_func->blocks, bout);
3221 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3225 if (self->undefined) {
3226 compile_error(ast_ctx(self), "internal error: ast_label never defined");
3232 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3236 /* simply create a new block and jump to it */
3237 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3238 if (!self->irblock) {
3239 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3242 if (!func->curblock->final) {
3243 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3247 /* enter the new block */
3248 func->curblock = self->irblock;
3250 /* Generate all the leftover gotos */
3251 for (auto &it : self->gotos) {
3252 if (!ast_goto_codegen(it, func, false, &dummy))
3259 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3263 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3267 if (self->target->irblock) {
3268 if (self->irblock_from) {
3269 /* we already tried once, this is the callback */
3270 self->irblock_from->final = false;
3271 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3272 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3278 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3279 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3286 /* the target has not yet been created...
3287 * close this block in a sneaky way:
3289 func->curblock->final = true;
3290 self->irblock_from = func->curblock;
3291 ast_label_register_goto(self->target, self);
3298 bool ast_state_codegen(ast_state *self, ast_function *func, bool lvalue, ir_value **out)
3300 ast_expression_codegen *cgen;
3302 ir_value *frameval, *thinkval;
3305 compile_error(ast_ctx(self), "not an l-value (state operation)");
3308 if (self->expression.outr) {
3309 compile_error(ast_ctx(self), "internal error: ast_state cannot be reused!");
3314 cgen = self->framenum->codegen;
3315 if (!(*cgen)((ast_expression*)(self->framenum), func, false, &frameval))
3320 cgen = self->nextthink->codegen;
3321 if (!(*cgen)((ast_expression*)(self->nextthink), func, false, &thinkval))
3326 if (!ir_block_create_state_op(func->curblock, ast_ctx(self), frameval, thinkval)) {
3327 compile_error(ast_ctx(self), "failed to create STATE instruction");
3331 self->expression.outr = (ir_value*)1;
3335 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3337 ast_expression_codegen *cgen;
3338 std::vector<ir_value*> params;
3339 ir_instr *callinstr;
3341 ir_value *funval = NULL;
3343 /* return values are never lvalues */
3345 compile_error(ast_ctx(self), "not an l-value (function call)");
3349 if (self->expression.outr) {
3350 *out = self->expression.outr;
3354 cgen = self->func->codegen;
3355 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3361 for (auto &it : self->params) {
3364 if (!(*cgen)(it, func, false, ¶m))
3368 params.push_back(param);
3371 /* varargs counter */
3372 if (self->va_count) {
3374 ir_builder *builder = func->curblock->owner->owner;
3375 cgen = self->va_count->codegen;
3376 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3378 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3379 ir_builder_get_va_count(builder), va_count))
3385 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3386 ast_function_label(func, "call"),
3387 funval, !!(self->func->flags & AST_FLAG_NORETURN));
3391 for (auto &it : params)
3392 ir_call_param(callinstr, it);
3394 *out = ir_call_value(callinstr);
3395 self->expression.outr = *out;
3397 codegen_output_type(self, *out);