13 #define ast_instantiate(T, ctx, destroyfn) \
14 T* self = (T*)mem_a(sizeof(T)); \
19 ast_node_init((ast_node*)self, ctx, TYPE_##T); \
20 ( (ast_node*)self )->destroy = (ast_node_delete*)destroyfn
23 * forward declarations, these need not be in ast.h for obvious
26 static bool ast_member_codegen(ast_member*, ast_function*, bool lvalue, ir_value**);
27 static void ast_array_index_delete(ast_array_index*);
28 static bool ast_array_index_codegen(ast_array_index*, ast_function*, bool lvalue, ir_value**);
29 static void ast_argpipe_delete(ast_argpipe*);
30 static bool ast_argpipe_codegen(ast_argpipe*, ast_function*, bool lvalue, ir_value**);
31 static void ast_store_delete(ast_store*);
32 static bool ast_store_codegen(ast_store*, ast_function*, bool lvalue, ir_value**);
33 static void ast_ifthen_delete(ast_ifthen*);
34 static bool ast_ifthen_codegen(ast_ifthen*, ast_function*, bool lvalue, ir_value**);
35 static void ast_ternary_delete(ast_ternary*);
36 static bool ast_ternary_codegen(ast_ternary*, ast_function*, bool lvalue, ir_value**);
37 static void ast_loop_delete(ast_loop*);
38 static bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**);
39 static void ast_breakcont_delete(ast_breakcont*);
40 static bool ast_breakcont_codegen(ast_breakcont*, ast_function*, bool lvalue, ir_value**);
41 static void ast_switch_delete(ast_switch*);
42 static bool ast_switch_codegen(ast_switch*, ast_function*, bool lvalue, ir_value**);
43 static void ast_label_delete(ast_label*);
44 static void ast_label_register_goto(ast_label*, ast_goto*);
45 static bool ast_label_codegen(ast_label*, ast_function*, bool lvalue, ir_value**);
46 static bool ast_goto_codegen(ast_goto*, ast_function*, bool lvalue, ir_value**);
47 static void ast_goto_delete(ast_goto*);
48 static void ast_call_delete(ast_call*);
49 static bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**);
50 static bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**);
51 static void ast_unary_delete(ast_unary*);
52 static bool ast_unary_codegen(ast_unary*, ast_function*, bool lvalue, ir_value**);
53 static void ast_entfield_delete(ast_entfield*);
54 static bool ast_entfield_codegen(ast_entfield*, ast_function*, bool lvalue, ir_value**);
55 static void ast_return_delete(ast_return*);
56 static bool ast_return_codegen(ast_return*, ast_function*, bool lvalue, ir_value**);
57 static void ast_binstore_delete(ast_binstore*);
58 static bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**);
59 static void ast_binary_delete(ast_binary*);
60 static bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**);
61 static bool ast_state_codegen(ast_state*, ast_function*, bool lvalue, ir_value**);
63 /* It must not be possible to get here. */
64 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
67 con_err("ast node missing destroy()\n");
71 /* Initialize main ast node aprts */
72 static void ast_node_init(ast_node *self, lex_ctx_t ctx, int node_type)
75 self->destroy = &_ast_node_destroy;
76 self->keep_node = false;
77 self->node_type = node_type;
78 self->side_effects = false;
81 /* weight and side effects */
82 static void _ast_propagate_effects(ast_node *self, ast_node *other)
84 if (ast_side_effects(other))
85 ast_side_effects(self) = true;
87 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
89 /* General expression initialization */
90 static void ast_expression_init(ast_expression *self,
91 ast_expression_codegen *codegen)
93 self->codegen = codegen;
94 self->vtype = TYPE_VOID;
99 self->varparam = nullptr;
101 if (OPTS_OPTION_BOOL(OPTION_COVERAGE))
102 self->flags |= AST_FLAG_BLOCK_COVERAGE;
105 static void ast_expression_delete(ast_expression *self)
108 ast_delete(self->next);
109 for (auto &it : self->type_params)
112 ast_delete(self->varparam);
115 static void ast_expression_delete_full(ast_expression *self)
117 ast_expression_delete(self);
121 ast_value* ast_value_copy(const ast_value *self)
123 ast_value *cp = ast_value_new(self->context, self->name, self->vtype);
125 cp->next = ast_type_copy(self->context, self->next);
127 const ast_expression *fromex = self;
128 ast_expression *selfex = cp;
129 selfex->count = fromex->count;
130 selfex->flags = fromex->flags;
131 for (auto &it : fromex->type_params) {
132 ast_value *v = ast_value_copy(it);
133 selfex->type_params.push_back(v);
138 void ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
140 const ast_expression *fromex;
141 ast_expression *selfex;
142 self->vtype = other->vtype;
144 self->next = (ast_expression*)ast_type_copy(ast_ctx(self), other->next);
148 selfex->count = fromex->count;
149 selfex->flags = fromex->flags;
150 for (auto &it : fromex->type_params) {
151 ast_value *v = ast_value_copy(it);
152 selfex->type_params.push_back(v);
156 static ast_expression* ast_shallow_type(lex_ctx_t ctx, qc_type vtype)
158 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
159 ast_expression_init(self, nullptr);
160 self->codegen = nullptr;
161 self->next = nullptr;
166 ast_expression* ast_type_copy(lex_ctx_t ctx, const ast_expression *ex)
168 const ast_expression *fromex;
169 ast_expression *selfex;
175 ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
176 ast_expression_init(self, nullptr);
181 /* This may never be codegen()d */
182 selfex->codegen = nullptr;
184 selfex->vtype = fromex->vtype;
186 selfex->next = ast_type_copy(ctx, fromex->next);
188 selfex->next = nullptr;
190 selfex->count = fromex->count;
191 selfex->flags = fromex->flags;
192 for (auto &it : fromex->type_params) {
193 ast_value *v = ast_value_copy(it);
194 selfex->type_params.push_back(v);
201 bool ast_compare_type(ast_expression *a, ast_expression *b)
203 if (a->vtype == TYPE_NIL ||
204 b->vtype == TYPE_NIL)
206 if (a->vtype != b->vtype)
208 if (!a->next != !b->next)
210 if (a->type_params.size() != b->type_params.size())
212 if ((a->flags & AST_FLAG_TYPE_MASK) !=
213 (b->flags & AST_FLAG_TYPE_MASK) )
217 if (a->type_params.size()) {
219 for (i = 0; i < a->type_params.size(); ++i) {
220 if (!ast_compare_type((ast_expression*)a->type_params[i],
221 (ast_expression*)b->type_params[i]))
226 return ast_compare_type(a->next, b->next);
230 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
237 if (pos + 6 >= bufsize)
239 util_strncpy(buf + pos, "(null)", 6);
243 if (pos + 1 >= bufsize)
248 util_strncpy(buf + pos, "(variant)", 9);
253 return ast_type_to_string_impl(e->next, buf, bufsize, pos);
256 if (pos + 3 >= bufsize)
260 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
261 if (pos + 1 >= bufsize)
267 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
268 if (pos + 2 >= bufsize)
270 if (e->type_params.empty()) {
276 pos = ast_type_to_string_impl((ast_expression*)(e->type_params[0]), buf, bufsize, pos);
277 for (i = 1; i < e->type_params.size(); ++i) {
278 if (pos + 2 >= bufsize)
282 pos = ast_type_to_string_impl((ast_expression*)(e->type_params[i]), buf, bufsize, pos);
284 if (pos + 1 >= bufsize)
290 pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
291 if (pos + 1 >= bufsize)
294 pos += util_snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->count);
295 if (pos + 1 >= bufsize)
301 typestr = type_name[e->vtype];
302 typelen = strlen(typestr);
303 if (pos + typelen >= bufsize)
305 util_strncpy(buf + pos, typestr, typelen);
306 return pos + typelen;
310 buf[bufsize-3] = '.';
311 buf[bufsize-2] = '.';
312 buf[bufsize-1] = '.';
316 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
318 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
322 static bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out);
323 ast_value* ast_value_new(lex_ctx_t ctx, const char *name, qc_type t)
325 ast_instantiate(ast_value, ctx, ast_value_delete);
326 ast_expression_init((ast_expression*)self,
327 (ast_expression_codegen*)&ast_value_codegen);
328 self->keep_node = true; /* keep */
330 self->name = name ? util_strdup(name) : nullptr;
332 self->next = nullptr;
333 self->isfield = false;
335 self->hasvalue = false;
337 self->inexact = false;
339 memset(&self->constval, 0, sizeof(self->constval));
341 self->ir_v = nullptr;
342 self->ir_values = nullptr;
343 self->ir_value_count = 0;
345 self->setter = nullptr;
346 self->getter = nullptr;
347 self->desc = nullptr;
349 self->argcounter = nullptr;
350 self->intrinsic = false;
355 void ast_value_delete(ast_value* self)
358 mem_d((void*)self->name);
359 if (self->argcounter)
360 mem_d((void*)self->argcounter);
361 if (self->hasvalue) {
365 mem_d((void*)self->constval.vstring);
368 /* unlink us from the function node */
369 self->constval.vfunc->function_type = nullptr;
371 /* NOTE: delete function? currently collected in
372 * the parser structure
379 mem_d(self->ir_values);
384 // initlist imples an array which implies .next in the expression exists.
385 if (self->initlist.size() && self->next->vtype == TYPE_STRING) {
386 for (auto &it : self->initlist)
391 ast_expression_delete((ast_expression*)self);
396 void ast_value_params_add(ast_value *self, ast_value *p)
398 self->type_params.push_back(p);
401 bool ast_value_set_name(ast_value *self, const char *name)
404 mem_d((void*)self->name);
405 self->name = util_strdup(name);
409 ast_binary* ast_binary_new(lex_ctx_t ctx, int op,
410 ast_expression* left, ast_expression* right)
412 ast_instantiate(ast_binary, ctx, ast_binary_delete);
413 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
415 if (ast_istype(right, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
416 ast_unary *unary = ((ast_unary*)right);
417 ast_expression *normal = unary->operand;
419 /* make a-(-b) => a + b */
420 if (unary->op == VINSTR_NEG_F || unary->op == VINSTR_NEG_V) {
421 if (op == INSTR_SUB_F) {
424 ++opts_optimizationcount[OPTIM_PEEPHOLE];
425 } else if (op == INSTR_SUB_V) {
428 ++opts_optimizationcount[OPTIM_PEEPHOLE];
436 self->right_first = false;
438 ast_propagate_effects(self, left);
439 ast_propagate_effects(self, right);
441 if (op >= INSTR_EQ_F && op <= INSTR_GT)
442 self->vtype = TYPE_FLOAT;
443 else if (op == INSTR_AND || op == INSTR_OR) {
444 if (OPTS_FLAG(PERL_LOGIC))
445 ast_type_adopt(self, right);
447 self->vtype = TYPE_FLOAT;
449 else if (op == INSTR_BITAND || op == INSTR_BITOR)
450 self->vtype = TYPE_FLOAT;
451 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
452 self->vtype = TYPE_VECTOR;
453 else if (op == INSTR_MUL_V)
454 self->vtype = TYPE_FLOAT;
456 self->vtype = left->vtype;
459 self->refs = AST_REF_ALL;
464 void ast_binary_delete(ast_binary *self)
466 if (self->refs & AST_REF_LEFT) ast_unref(self->left);
467 if (self->refs & AST_REF_RIGHT) ast_unref(self->right);
469 ast_expression_delete((ast_expression*)self);
474 ast_binstore* ast_binstore_new(lex_ctx_t ctx, int storop, int op,
475 ast_expression* left, ast_expression* right)
477 ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
478 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
480 ast_side_effects(self) = true;
482 self->opstore = storop;
485 self->source = right;
487 self->keep_dest = false;
489 ast_type_adopt(self, left);
493 void ast_binstore_delete(ast_binstore *self)
495 if (!self->keep_dest)
496 ast_unref(self->dest);
497 ast_unref(self->source);
498 ast_expression_delete((ast_expression*)self);
499 self->~ast_binstore();
503 ast_unary* ast_unary_new(lex_ctx_t ctx, int op,
504 ast_expression *expr)
506 ast_instantiate(ast_unary, ctx, ast_unary_delete);
507 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
510 self->operand = expr;
513 if (ast_istype(expr, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
514 ast_unary *prev = (ast_unary*)((ast_unary*)expr)->operand;
516 /* Handle for double negation */
517 if (((ast_unary*)expr)->op == op)
518 prev = (ast_unary*)((ast_unary*)expr)->operand;
520 if (ast_istype(prev, ast_unary)) {
521 ast_expression_delete((ast_expression*)self);
523 ++opts_optimizationcount[OPTIM_PEEPHOLE];
528 ast_propagate_effects(self, expr);
530 if ((op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) || op == VINSTR_NEG_F) {
531 self->vtype = TYPE_FLOAT;
532 } else if (op == VINSTR_NEG_V) {
533 self->vtype = TYPE_VECTOR;
535 compile_error(ctx, "cannot determine type of unary operation %s", util_instr_str[op]);
541 void ast_unary_delete(ast_unary *self)
543 if (self->operand) ast_unref(self->operand);
544 ast_expression_delete((ast_expression*)self);
549 ast_return* ast_return_new(lex_ctx_t ctx, ast_expression *expr)
551 ast_instantiate(ast_return, ctx, ast_return_delete);
552 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
554 self->operand = expr;
557 ast_propagate_effects(self, expr);
562 void ast_return_delete(ast_return *self)
565 ast_unref(self->operand);
566 ast_expression_delete((ast_expression*)self);
571 ast_entfield* ast_entfield_new(lex_ctx_t ctx, ast_expression *entity, ast_expression *field)
573 if (field->vtype != TYPE_FIELD) {
574 compile_error(ctx, "ast_entfield_new with expression not of type field");
577 return ast_entfield_new_force(ctx, entity, field, field->next);
580 ast_entfield* ast_entfield_new_force(lex_ctx_t ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
582 ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
586 /* Error: field has no type... */
590 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
592 self->entity = entity;
594 ast_propagate_effects(self, entity);
595 ast_propagate_effects(self, field);
597 ast_type_adopt(self, outtype);
601 void ast_entfield_delete(ast_entfield *self)
603 ast_unref(self->entity);
604 ast_unref(self->field);
605 ast_expression_delete((ast_expression*)self);
606 self->~ast_entfield();
610 ast_member* ast_member_new(lex_ctx_t ctx, ast_expression *owner, unsigned int field, const char *name)
612 ast_instantiate(ast_member, ctx, ast_member_delete);
618 if (owner->vtype != TYPE_VECTOR &&
619 owner->vtype != TYPE_FIELD) {
620 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->vtype]);
625 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
626 self->keep_node = true; /* keep */
628 if (owner->vtype == TYPE_VECTOR) {
629 self->vtype = TYPE_FLOAT;
630 self->next = nullptr;
632 self->vtype = TYPE_FIELD;
633 self->next = ast_shallow_type(ctx, TYPE_FLOAT);
636 self->rvalue = false;
638 ast_propagate_effects(self, owner);
642 self->name = util_strdup(name);
644 self->name = nullptr;
649 void ast_member_delete(ast_member *self)
651 /* The owner is always an ast_value, which has .keep_node=true,
652 * also: ast_members are usually deleted after the owner, thus
653 * this will cause invalid access
654 ast_unref(self->owner);
655 * once we allow (expression).x to access a vector-member, we need
656 * to change this: preferably by creating an alternate ast node for this
657 * purpose that is not garbage-collected.
659 ast_expression_delete((ast_expression*)self);
665 bool ast_member_set_name(ast_member *self, const char *name)
668 mem_d((void*)self->name);
669 self->name = util_strdup(name);
673 ast_array_index* ast_array_index_new(lex_ctx_t ctx, ast_expression *array, ast_expression *index)
675 ast_expression *outtype;
676 ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
678 outtype = array->next;
681 /* Error: field has no type... */
685 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
689 ast_propagate_effects(self, array);
690 ast_propagate_effects(self, index);
692 ast_type_adopt(self, outtype);
693 if (array->vtype == TYPE_FIELD && outtype->vtype == TYPE_ARRAY) {
694 if (self->vtype != TYPE_ARRAY) {
695 compile_error(ast_ctx(self), "array_index node on type");
696 ast_array_index_delete(self);
699 self->array = outtype;
700 self->vtype = TYPE_FIELD;
706 void ast_array_index_delete(ast_array_index *self)
709 ast_unref(self->array);
711 ast_unref(self->index);
712 ast_expression_delete((ast_expression*)self);
716 ast_argpipe* ast_argpipe_new(lex_ctx_t ctx, ast_expression *index)
718 ast_instantiate(ast_argpipe, ctx, ast_argpipe_delete);
719 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_argpipe_codegen);
721 self->vtype = TYPE_NOEXPR;
725 void ast_argpipe_delete(ast_argpipe *self)
728 ast_unref(self->index);
729 ast_expression_delete((ast_expression*)self);
730 self->~ast_argpipe();
734 ast_ifthen* ast_ifthen_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
736 ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
737 if (!ontrue && !onfalse) {
738 /* because it is invalid */
742 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
745 self->on_true = ontrue;
746 self->on_false = onfalse;
747 ast_propagate_effects(self, cond);
749 ast_propagate_effects(self, ontrue);
751 ast_propagate_effects(self, onfalse);
756 void ast_ifthen_delete(ast_ifthen *self)
758 ast_unref(self->cond);
760 ast_unref(self->on_true);
762 ast_unref(self->on_false);
763 ast_expression_delete((ast_expression*)self);
768 ast_ternary* ast_ternary_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
770 ast_expression *exprtype = ontrue;
771 ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
772 /* This time NEITHER must be nullptr */
773 if (!ontrue || !onfalse) {
777 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
780 self->on_true = ontrue;
781 self->on_false = onfalse;
782 ast_propagate_effects(self, cond);
783 ast_propagate_effects(self, ontrue);
784 ast_propagate_effects(self, onfalse);
786 if (ontrue->vtype == TYPE_NIL)
788 ast_type_adopt(self, exprtype);
793 void ast_ternary_delete(ast_ternary *self)
795 /* the if()s are only there because computed-gotos can set them
798 if (self->cond) ast_unref(self->cond);
799 if (self->on_true) ast_unref(self->on_true);
800 if (self->on_false) ast_unref(self->on_false);
801 ast_expression_delete((ast_expression*)self);
802 self->~ast_ternary();
806 ast_loop* ast_loop_new(lex_ctx_t ctx,
807 ast_expression *initexpr,
808 ast_expression *precond, bool pre_not,
809 ast_expression *postcond, bool post_not,
810 ast_expression *increment,
811 ast_expression *body)
813 ast_instantiate(ast_loop, ctx, ast_loop_delete);
814 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
816 self->initexpr = initexpr;
817 self->precond = precond;
818 self->postcond = postcond;
819 self->increment = increment;
822 self->pre_not = pre_not;
823 self->post_not = post_not;
826 ast_propagate_effects(self, initexpr);
828 ast_propagate_effects(self, precond);
830 ast_propagate_effects(self, postcond);
832 ast_propagate_effects(self, increment);
834 ast_propagate_effects(self, body);
839 void ast_loop_delete(ast_loop *self)
842 ast_unref(self->initexpr);
844 ast_unref(self->precond);
846 ast_unref(self->postcond);
848 ast_unref(self->increment);
850 ast_unref(self->body);
851 ast_expression_delete((ast_expression*)self);
856 ast_breakcont* ast_breakcont_new(lex_ctx_t ctx, bool iscont, unsigned int levels)
858 ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
859 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
861 self->is_continue = iscont;
862 self->levels = levels;
867 void ast_breakcont_delete(ast_breakcont *self)
869 ast_expression_delete((ast_expression*)self);
870 self->~ast_breakcont();
874 ast_switch* ast_switch_new(lex_ctx_t ctx, ast_expression *op)
876 ast_instantiate(ast_switch, ctx, ast_switch_delete);
877 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
881 ast_propagate_effects(self, op);
886 void ast_switch_delete(ast_switch *self)
888 ast_unref(self->operand);
890 for (auto &it : self->cases) {
896 ast_expression_delete((ast_expression*)self);
901 ast_label* ast_label_new(lex_ctx_t ctx, const char *name, bool undefined)
903 ast_instantiate(ast_label, ctx, ast_label_delete);
904 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
906 self->vtype = TYPE_NOEXPR;
908 self->name = util_strdup(name);
909 self->irblock = nullptr;
910 self->undefined = undefined;
915 void ast_label_delete(ast_label *self)
917 mem_d((void*)self->name);
918 ast_expression_delete((ast_expression*)self);
923 static void ast_label_register_goto(ast_label *self, ast_goto *g)
925 self->gotos.push_back(g);
928 ast_goto* ast_goto_new(lex_ctx_t ctx, const char *name)
930 ast_instantiate(ast_goto, ctx, ast_goto_delete);
931 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
933 self->name = util_strdup(name);
934 self->target = nullptr;
935 self->irblock_from = nullptr;
940 void ast_goto_delete(ast_goto *self)
942 mem_d((void*)self->name);
943 ast_expression_delete((ast_expression*)self);
948 void ast_goto_set_label(ast_goto *self, ast_label *label)
950 self->target = label;
953 ast_state* ast_state_new(lex_ctx_t ctx, ast_expression *frame, ast_expression *think)
955 ast_instantiate(ast_state, ctx, ast_state_delete);
956 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_state_codegen);
957 self->framenum = frame;
958 self->nextthink = think;
962 void ast_state_delete(ast_state *self)
965 ast_unref(self->framenum);
967 ast_unref(self->nextthink);
969 ast_expression_delete((ast_expression*)self);
974 ast_call* ast_call_new(lex_ctx_t ctx,
975 ast_expression *funcexpr)
977 ast_instantiate(ast_call, ctx, ast_call_delete);
978 if (!funcexpr->next) {
979 compile_error(ctx, "not a function");
983 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
985 ast_side_effects(self) = true;
987 self->func = funcexpr;
988 self->va_count = nullptr;
990 ast_type_adopt(self, funcexpr->next);
995 void ast_call_delete(ast_call *self)
997 for (auto &it : self->params)
1001 ast_unref(self->func);
1004 ast_unref(self->va_count);
1006 ast_expression_delete((ast_expression*)self);
1011 static bool ast_call_check_vararg(ast_call *self, ast_expression *va_type, ast_expression *exp_type)
1017 if (!va_type || !ast_compare_type(va_type, exp_type))
1019 if (va_type && exp_type)
1021 ast_type_to_string(va_type, tgot, sizeof(tgot));
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 differs in type: constrained to type %s, expected type %s",
1029 compile_error(ast_ctx(self),
1030 "piped variadic argument differs in type: constrained to type %s, expected type %s",
1037 ast_type_to_string(exp_type, texp, sizeof(texp));
1038 if (OPTS_FLAG(UNSAFE_VARARGS)) {
1039 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1040 "piped variadic argument may differ in type: expected type %s",
1044 compile_error(ast_ctx(self),
1045 "piped variadic argument may differ in type: expected type %s",
1054 bool ast_call_check_types(ast_call *self, ast_expression *va_type)
1060 const ast_expression *func = self->func;
1061 size_t count = self->params.size();
1062 if (count > func->type_params.size())
1063 count = func->type_params.size();
1065 for (i = 0; i < count; ++i) {
1066 if (ast_istype(self->params[i], ast_argpipe)) {
1067 /* warn about type safety instead */
1069 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1072 if (!ast_call_check_vararg(self, va_type, (ast_expression*)func->type_params[i]))
1075 else if (!ast_compare_type(self->params[i], (ast_expression*)(func->type_params[i])))
1077 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1078 ast_type_to_string((ast_expression*)func->type_params[i], texp, sizeof(texp));
1079 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
1080 (unsigned int)(i+1), texp, tgot);
1081 /* we don't immediately return */
1085 count = self->params.size();
1086 if (count > func->type_params.size() && func->varparam) {
1087 for (; i < count; ++i) {
1088 if (ast_istype(self->params[i], ast_argpipe)) {
1089 /* warn about type safety instead */
1091 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1094 if (!ast_call_check_vararg(self, va_type, func->varparam))
1097 else if (!ast_compare_type(self->params[i], func->varparam))
1099 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1100 ast_type_to_string(func->varparam, texp, sizeof(texp));
1101 compile_error(ast_ctx(self), "invalid type for variadic parameter %u in function call: expected %s, got %s",
1102 (unsigned int)(i+1), texp, tgot);
1103 /* we don't immediately return */
1111 ast_store* ast_store_new(lex_ctx_t ctx, int op,
1112 ast_expression *dest, ast_expression *source)
1114 ast_instantiate(ast_store, ctx, ast_store_delete);
1115 ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
1117 ast_side_effects(self) = true;
1121 self->source = source;
1123 ast_type_adopt(self, dest);
1128 void ast_store_delete(ast_store *self)
1130 ast_unref(self->dest);
1131 ast_unref(self->source);
1132 ast_expression_delete((ast_expression*)self);
1137 ast_block* ast_block_new(lex_ctx_t ctx)
1139 ast_instantiate(ast_block, ctx, ast_block_delete);
1140 ast_expression_init((ast_expression*)self,
1141 (ast_expression_codegen*)&ast_block_codegen);
1145 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1147 ast_propagate_effects(self, e);
1148 self->exprs.push_back(e);
1150 ast_delete(self->next);
1151 self->next = nullptr;
1153 ast_type_adopt(self, e);
1157 void ast_block_collect(ast_block *self, ast_expression *expr)
1159 self->collect.push_back(expr);
1160 expr->keep_node = true;
1163 void ast_block_delete(ast_block *self)
1165 for (auto &it : self->exprs) ast_unref(it);
1166 for (auto &it : self->locals) ast_delete(it);
1167 for (auto &it : self->collect) ast_delete(it);
1168 ast_expression_delete((ast_expression*)self);
1173 void ast_block_set_type(ast_block *self, ast_expression *from)
1176 ast_delete(self->next);
1177 ast_type_adopt(self, from);
1180 ast_function* ast_function_new(lex_ctx_t ctx, const char *name, ast_value *vtype)
1182 ast_instantiate(ast_function, ctx, ast_function_delete);
1185 compile_error(ast_ctx(self), "internal error: ast_function_new condition 0");
1187 } else if (vtype->hasvalue || vtype->vtype != TYPE_FUNCTION) {
1188 compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1190 (int)vtype->hasvalue,
1195 self->function_type = vtype;
1196 self->name = name ? util_strdup(name) : nullptr;
1198 self->labelcount = 0;
1201 self->ir_func = nullptr;
1202 self->curblock = nullptr;
1204 vtype->hasvalue = true;
1205 vtype->constval.vfunc = self;
1207 self->varargs = nullptr;
1208 self->argc = nullptr;
1209 self->fixedparams = nullptr;
1210 self->return_value = nullptr;
1211 self->static_count = 0;
1220 void ast_function_delete(ast_function *self)
1223 mem_d((void*)self->name);
1224 if (self->function_type) {
1225 /* ast_value_delete(self->function_type); */
1226 self->function_type->hasvalue = false;
1227 self->function_type->constval.vfunc = nullptr;
1228 /* We use unref - if it was stored in a global table it is supposed
1229 * to be deleted from *there*
1231 ast_unref(self->function_type);
1233 for (auto &it : self->static_names)
1235 // FIXME::DELME:: unique_ptr used on ast_block
1236 //for (auto &it : self->blocks)
1239 ast_delete(self->varargs);
1241 ast_delete(self->argc);
1242 if (self->fixedparams)
1243 ast_unref(self->fixedparams);
1244 if (self->return_value)
1245 ast_unref(self->return_value);
1246 self->~ast_function();
1250 const char* ast_function_label(ast_function *self, const char *prefix)
1256 if (!OPTS_OPTION_BOOL(OPTION_DUMP) &&
1257 !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
1258 !OPTS_OPTION_BOOL(OPTION_DEBUG))
1263 id = (self->labelcount++);
1264 len = strlen(prefix);
1266 from = self->labelbuf + sizeof(self->labelbuf)-1;
1269 *from-- = (id%10) + '0';
1273 memcpy(from - len, prefix, len);
1277 /*********************************************************************/
1279 * by convention you must never pass nullptr to the 'ir_value **out'
1280 * parameter. If you really don't care about the output, pass a dummy.
1281 * But I can't imagine a pituation where the output is truly unnecessary.
1284 static void _ast_codegen_output_type(ast_expression *self, ir_value *out)
1286 if (out->vtype == TYPE_FIELD)
1287 out->fieldtype = self->next->vtype;
1288 if (out->vtype == TYPE_FUNCTION)
1289 out->outtype = self->next->vtype;
1292 #define codegen_output_type(a,o) (_ast_codegen_output_type(static_cast<ast_expression*>((a)),(o)))
1294 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1298 if (self->vtype == TYPE_NIL) {
1299 *out = func->ir_func->owner->nil;
1302 /* NOTE: This is the codegen for a variable used in an
1303 * It is not the codegen to generate the value. For this purpose,
1304 * ast_local_codegen and ast_global_codegen are to be used before this
1305 * is executed. ast_function_codegen should take care of its locals,
1306 * and the ast-user should take care of ast_global_codegen to be used
1307 * on all the globals.
1310 char tname[1024]; /* typename is reserved in C++ */
1311 ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1312 compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1319 static bool ast_global_array_set(ast_value *self)
1321 size_t count = self->initlist.size();
1324 if (count > self->count) {
1325 compile_error(ast_ctx(self), "too many elements in initializer");
1326 count = self->count;
1328 else if (count < self->count) {
1330 compile_warning(ast_ctx(self), "not all elements are initialized");
1334 for (i = 0; i != count; ++i) {
1335 switch (self->next->vtype) {
1337 if (!ir_value_set_float(self->ir_values[i], self->initlist[i].vfloat))
1341 if (!ir_value_set_vector(self->ir_values[i], self->initlist[i].vvec))
1345 if (!ir_value_set_string(self->ir_values[i], self->initlist[i].vstring))
1349 /* we don't support them in any other place yet either */
1350 compile_error(ast_ctx(self), "TODO: nested arrays");
1353 /* this requiers a bit more work - similar to the fields I suppose */
1354 compile_error(ast_ctx(self), "global of type function not properly generated");
1357 if (!self->initlist[i].vfield) {
1358 compile_error(ast_ctx(self), "field constant without vfield set");
1361 if (!self->initlist[i].vfield->ir_v) {
1362 compile_error(ast_ctx(self), "field constant generated before its field");
1365 if (!ir_value_set_field(self->ir_values[i], self->initlist[i].vfield->ir_v))
1369 compile_error(ast_ctx(self), "TODO: global constant type %i", self->vtype);
1376 static bool check_array(ast_value *self, ast_value *array)
1378 if (array->flags & AST_FLAG_ARRAY_INIT && array->initlist.empty()) {
1379 compile_error(ast_ctx(self), "array without size: %s", self->name);
1382 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1383 if (!array->count || array->count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1384 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->count);
1390 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1392 ir_value *v = nullptr;
1394 if (self->vtype == TYPE_NIL) {
1395 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1399 if (self->hasvalue && self->vtype == TYPE_FUNCTION)
1401 ir_function *func = ir_builder_create_function(ir, self->name, self->next->vtype);
1404 func->context = ast_ctx(self);
1405 func->value->context = ast_ctx(self);
1407 self->constval.vfunc->ir_func = func;
1408 self->ir_v = func->value;
1409 if (self->flags & AST_FLAG_INCLUDE_DEF)
1410 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1411 if (self->flags & AST_FLAG_ERASEABLE)
1412 self->ir_v->flags |= IR_FLAG_ERASABLE;
1413 if (self->flags & AST_FLAG_BLOCK_COVERAGE)
1414 func->flags |= IR_FLAG_BLOCK_COVERAGE;
1415 /* The function is filled later on ast_function_codegen... */
1419 if (isfield && self->vtype == TYPE_FIELD) {
1420 ast_expression *fieldtype = self->next;
1422 if (self->hasvalue) {
1423 compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1427 if (fieldtype->vtype == TYPE_ARRAY) {
1432 ast_expression *elemtype;
1434 ast_value *array = (ast_value*)fieldtype;
1436 if (!ast_istype(fieldtype, ast_value)) {
1437 compile_error(ast_ctx(self), "internal error: ast_value required");
1441 if (!check_array(self, array))
1444 elemtype = array->next;
1445 vtype = elemtype->vtype;
1447 v = ir_builder_create_field(ir, self->name, vtype);
1449 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1452 v->context = ast_ctx(self);
1453 v->unique_life = true;
1455 array->ir_v = self->ir_v = v;
1457 if (self->flags & AST_FLAG_INCLUDE_DEF)
1458 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1459 if (self->flags & AST_FLAG_ERASEABLE)
1460 self->ir_v->flags |= IR_FLAG_ERASABLE;
1462 namelen = strlen(self->name);
1463 name = (char*)mem_a(namelen + 16);
1464 util_strncpy(name, self->name, namelen);
1466 array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->count);
1467 array->ir_values[0] = v;
1468 for (ai = 1; ai < array->count; ++ai) {
1469 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1470 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1471 if (!array->ir_values[ai]) {
1473 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1476 array->ir_values[ai]->context = ast_ctx(self);
1477 array->ir_values[ai]->unique_life = true;
1478 array->ir_values[ai]->locked = true;
1479 if (self->flags & AST_FLAG_INCLUDE_DEF)
1480 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1486 v = ir_builder_create_field(ir, self->name, self->next->vtype);
1489 v->context = ast_ctx(self);
1491 if (self->flags & AST_FLAG_INCLUDE_DEF)
1492 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1494 if (self->flags & AST_FLAG_ERASEABLE)
1495 self->ir_v->flags |= IR_FLAG_ERASABLE;
1500 if (self->vtype == TYPE_ARRAY) {
1505 ast_expression *elemtype = self->next;
1506 qc_type vtype = elemtype->vtype;
1508 if (self->flags & AST_FLAG_ARRAY_INIT && !self->count) {
1509 compile_error(ast_ctx(self), "array `%s' has no size", self->name);
1513 /* same as with field arrays */
1514 if (!check_array(self, self))
1517 v = ir_builder_create_global(ir, self->name, vtype);
1519 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1522 v->context = ast_ctx(self);
1523 v->unique_life = true;
1526 if (self->flags & AST_FLAG_INCLUDE_DEF)
1527 v->flags |= IR_FLAG_INCLUDE_DEF;
1528 if (self->flags & AST_FLAG_ERASEABLE)
1529 self->ir_v->flags |= IR_FLAG_ERASABLE;
1531 namelen = strlen(self->name);
1532 name = (char*)mem_a(namelen + 16);
1533 util_strncpy(name, self->name, namelen);
1535 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->count);
1536 self->ir_values[0] = v;
1537 for (ai = 1; ai < self->count; ++ai) {
1538 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1539 self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1540 if (!self->ir_values[ai]) {
1542 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1545 self->ir_values[ai]->context = ast_ctx(self);
1546 self->ir_values[ai]->unique_life = true;
1547 self->ir_values[ai]->locked = true;
1548 if (self->flags & AST_FLAG_INCLUDE_DEF)
1549 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1555 /* Arrays don't do this since there's no "array" value which spans across the
1558 v = ir_builder_create_global(ir, self->name, self->vtype);
1560 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1563 codegen_output_type(self, v);
1564 v->context = ast_ctx(self);
1567 /* link us to the ir_value */
1571 if (self->flags & AST_FLAG_INCLUDE_DEF)
1572 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1573 if (self->flags & AST_FLAG_ERASEABLE)
1574 self->ir_v->flags |= IR_FLAG_ERASABLE;
1577 if (self->hasvalue) {
1578 switch (self->vtype)
1581 if (!ir_value_set_float(v, self->constval.vfloat))
1585 if (!ir_value_set_vector(v, self->constval.vvec))
1589 if (!ir_value_set_string(v, self->constval.vstring))
1593 ast_global_array_set(self);
1596 compile_error(ast_ctx(self), "global of type function not properly generated");
1598 /* Cannot generate an IR value for a function,
1599 * need a pointer pointing to a function rather.
1602 if (!self->constval.vfield) {
1603 compile_error(ast_ctx(self), "field constant without vfield set");
1606 if (!self->constval.vfield->ir_v) {
1607 compile_error(ast_ctx(self), "field constant generated before its field");
1610 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1614 compile_error(ast_ctx(self), "TODO: global constant type %i", self->vtype);
1620 error: /* clean up */
1625 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1627 ir_value *v = nullptr;
1629 if (self->vtype == TYPE_NIL) {
1630 compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1634 if (self->hasvalue && self->vtype == TYPE_FUNCTION)
1636 /* Do we allow local functions? I think not...
1637 * this is NOT a function pointer atm.
1642 if (self->vtype == TYPE_ARRAY) {
1647 ast_expression *elemtype = self->next;
1648 qc_type vtype = elemtype->vtype;
1650 func->flags |= IR_FLAG_HAS_ARRAYS;
1652 if (param && !(self->flags & AST_FLAG_IS_VARARG)) {
1653 compile_error(ast_ctx(self), "array-parameters are not supported");
1657 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1658 if (!check_array(self, self))
1661 self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->count);
1662 if (!self->ir_values) {
1663 compile_error(ast_ctx(self), "failed to allocate array values");
1667 v = ir_function_create_local(func, self->name, vtype, param);
1669 compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1672 v->context = ast_ctx(self);
1673 v->unique_life = true;
1676 namelen = strlen(self->name);
1677 name = (char*)mem_a(namelen + 16);
1678 util_strncpy(name, self->name, namelen);
1680 self->ir_values[0] = v;
1681 for (ai = 1; ai < self->count; ++ai) {
1682 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1683 self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1684 if (!self->ir_values[ai]) {
1685 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1688 self->ir_values[ai]->context = ast_ctx(self);
1689 self->ir_values[ai]->unique_life = true;
1690 self->ir_values[ai]->locked = true;
1696 v = ir_function_create_local(func, self->name, self->vtype, param);
1699 codegen_output_type(self, v);
1700 v->context = ast_ctx(self);
1703 /* A constant local... hmmm...
1704 * I suppose the IR will have to deal with this
1706 if (self->hasvalue) {
1707 switch (self->vtype)
1710 if (!ir_value_set_float(v, self->constval.vfloat))
1714 if (!ir_value_set_vector(v, self->constval.vvec))
1718 if (!ir_value_set_string(v, self->constval.vstring))
1722 compile_error(ast_ctx(self), "TODO: global constant type %i", self->vtype);
1727 /* link us to the ir_value */
1731 if (!ast_generate_accessors(self, func->owner))
1735 error: /* clean up */
1740 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1743 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1744 if (!self->setter || !self->getter)
1746 for (i = 0; i < self->count; ++i) {
1747 if (!self->ir_values) {
1748 compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1751 if (!self->ir_values[i]) {
1752 compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1755 if (!self->ir_values[i]->life.empty()) {
1756 compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1761 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1763 if (!ast_global_codegen (self->setter, ir, false) ||
1764 !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1765 !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1767 compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1768 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1773 if (!ast_global_codegen (self->getter, ir, false) ||
1774 !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1775 !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1777 compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1778 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1782 for (i = 0; i < self->count; ++i)
1783 self->ir_values[i]->life.clear();
1784 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1788 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1793 ast_expression_codegen *cgen;
1797 irf = self->ir_func;
1799 compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1803 /* fill the parameter list */
1804 ec = self->function_type;
1805 for (auto &it : ec->type_params) {
1806 if (it->vtype == TYPE_FIELD)
1807 vec_push(irf->params, it->next->vtype);
1809 vec_push(irf->params, it->vtype);
1810 if (!self->builtin) {
1811 if (!ast_local_codegen(it, self->ir_func, true))
1816 if (self->varargs) {
1817 if (!ast_local_codegen(self->varargs, self->ir_func, true))
1819 irf->max_varargs = self->varargs->count;
1822 if (self->builtin) {
1823 irf->builtin = self->builtin;
1827 /* have a local return value variable? */
1828 if (self->return_value) {
1829 if (!ast_local_codegen(self->return_value, self->ir_func, false))
1833 if (self->blocks.empty()) {
1834 compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1838 irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1839 if (!self->curblock) {
1840 compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1848 if (!ast_local_codegen(self->argc, self->ir_func, true))
1850 cgen = self->argc->codegen;
1851 if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1853 cgen = self->fixedparams->codegen;
1854 if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1856 sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1857 ast_function_label(self, "va_count"), INSTR_SUB_F,
1858 ir_builder_get_va_count(ir), fixed);
1861 if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1868 for (auto &it : self->blocks) {
1870 if (!(*cgen)(it.get(), self, false, &dummy))
1874 /* TODO: check return types */
1875 if (!self->curblock->final)
1877 if (!self->function_type->next ||
1878 self->function_type->next->vtype == TYPE_VOID)
1880 return ir_block_create_return(self->curblock, ast_ctx(self), nullptr);
1882 else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1884 if (self->return_value) {
1885 cgen = self->return_value->codegen;
1886 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1888 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1890 else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1891 "control reaches end of non-void function (`%s`) via %s",
1892 self->name, self->curblock->label.c_str()))
1896 return ir_block_create_return(self->curblock, ast_ctx(self), nullptr);
1902 static bool starts_a_label(ast_expression *ex)
1904 while (ex && ast_istype(ex, ast_block)) {
1905 ast_block *b = (ast_block*)ex;
1910 return ast_istype(ex, ast_label);
1913 /* Note, you will not see ast_block_codegen generate ir_blocks.
1914 * To the AST and the IR, blocks are 2 different things.
1915 * In the AST it represents a block of code, usually enclosed in
1916 * curly braces {...}.
1917 * While in the IR it represents a block in terms of control-flow.
1919 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1921 /* We don't use this
1922 * Note: an ast-representation using the comma-operator
1923 * of the form: (a, b, c) = x should not assign to c...
1926 compile_error(ast_ctx(self), "not an l-value (code-block)");
1935 /* output is nullptr at first, we'll have each expression
1936 * assign to out output, thus, a comma-operator represention
1937 * using an ast_block will return the last generated value,
1938 * so: (b, c) + a executed both b and c, and returns c,
1939 * which is then added to a.
1943 /* generate locals */
1944 for (auto &it : self->locals) {
1945 if (!ast_local_codegen(it, func->ir_func, false)) {
1946 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1947 compile_error(ast_ctx(self), "failed to generate local `%s`", it->name);
1952 for (auto &it : self->exprs) {
1953 ast_expression_codegen *gen;
1954 if (func->curblock->final && !starts_a_label(it)) {
1955 if (compile_warning(ast_ctx(it), WARN_UNREACHABLE_CODE, "unreachable statement"))
1960 if (!(*gen)(it, func, false, out))
1969 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1971 ast_expression_codegen *cgen;
1972 ir_value *left = nullptr;
1973 ir_value *right = nullptr;
1977 ast_array_index *ai = nullptr;
1979 if (lvalue && self->outl) {
1984 if (!lvalue && self->outr) {
1989 if (ast_istype(self->dest, ast_array_index))
1992 ai = (ast_array_index*)self->dest;
1993 idx = (ast_value*)ai->index;
1995 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2000 /* we need to call the setter */
2001 ir_value *iridx, *funval;
2005 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2009 arr = (ast_value*)ai->array;
2010 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2011 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2015 cgen = idx->codegen;
2016 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2019 cgen = arr->setter->codegen;
2020 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2023 cgen = self->source->codegen;
2024 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2027 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2030 ir_call_param(call, iridx);
2031 ir_call_param(call, right);
2038 cgen = self->dest->codegen;
2040 if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
2044 cgen = self->source->codegen;
2046 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2049 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
2054 /* Theoretically, an assinment returns its left side as an
2055 * lvalue, if we don't need an lvalue though, we return
2056 * the right side as an rvalue, otherwise we have to
2057 * somehow know whether or not we need to dereference the pointer
2058 * on the left side - that is: OP_LOAD if it was an address.
2059 * Also: in original QC we cannot OP_LOADP *anyway*.
2061 *out = (lvalue ? left : right);
2066 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
2068 ast_expression_codegen *cgen;
2069 ir_value *left, *right;
2071 /* A binary operation cannot yield an l-value */
2073 compile_error(ast_ctx(self), "not an l-value (binop)");
2082 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
2083 (self->op == INSTR_AND || self->op == INSTR_OR))
2085 /* NOTE: The short-logic path will ignore right_first */
2087 /* short circuit evaluation */
2088 ir_block *other, *merge;
2089 ir_block *from_left, *from_right;
2093 /* prepare end-block */
2094 merge_id = func->ir_func->blocks.size();
2095 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
2097 /* generate the left expression */
2098 cgen = self->left->codegen;
2099 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2101 /* remember the block */
2102 from_left = func->curblock;
2104 /* create a new block for the right expression */
2105 other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
2106 if (self->op == INSTR_AND) {
2107 /* on AND: left==true -> other */
2108 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
2111 /* on OR: left==false -> other */
2112 if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
2115 /* use the likely flag */
2116 vec_last(func->curblock->instr)->likely = true;
2118 /* enter the right-expression's block */
2119 func->curblock = other;
2121 cgen = self->right->codegen;
2122 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2124 /* remember block */
2125 from_right = func->curblock;
2127 /* jump to the merge block */
2128 if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
2131 algo::shiftback(func->ir_func->blocks.begin() + merge_id,
2132 func->ir_func->blocks.end());
2134 //func->ir_func->blocks[merge_id].release();
2135 //func->ir_func->blocks.erase(func->ir_func->blocks.begin() + merge_id);
2136 //func->ir_func->blocks.emplace_back(merge);
2138 func->curblock = merge;
2139 phi = ir_block_create_phi(func->curblock, ast_ctx(self),
2140 ast_function_label(func, "sce_value"),
2142 ir_phi_add(phi, from_left, left);
2143 ir_phi_add(phi, from_right, right);
2144 *out = ir_phi_value(phi);
2148 if (!OPTS_FLAG(PERL_LOGIC)) {
2150 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
2151 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2152 ast_function_label(func, "sce_bool_v"),
2156 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2157 ast_function_label(func, "sce_bool"),
2162 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
2163 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2164 ast_function_label(func, "sce_bool_s"),
2168 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2169 ast_function_label(func, "sce_bool"),
2175 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
2176 ast_function_label(func, "sce_bool"),
2177 INSTR_AND, *out, *out);
2184 codegen_output_type(self, *out);
2188 if (self->right_first) {
2189 cgen = self->right->codegen;
2190 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2192 cgen = self->left->codegen;
2193 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2196 cgen = self->left->codegen;
2197 if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2199 cgen = self->right->codegen;
2200 if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2204 *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
2205 self->op, left, right);
2209 codegen_output_type(self, *out);
2214 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
2216 ast_expression_codegen *cgen;
2217 ir_value *leftl = nullptr, *leftr, *right, *bin;
2221 ast_array_index *ai = nullptr;
2222 ir_value *iridx = nullptr;
2224 if (lvalue && self->outl) {
2229 if (!lvalue && self->outr) {
2234 if (ast_istype(self->dest, ast_array_index))
2237 ai = (ast_array_index*)self->dest;
2238 idx = (ast_value*)ai->index;
2240 if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2244 /* for a binstore we need both an lvalue and an rvalue for the left side */
2245 /* rvalue of destination! */
2247 cgen = idx->codegen;
2248 if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2251 cgen = self->dest->codegen;
2252 if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2255 /* source as rvalue only */
2256 cgen = self->source->codegen;
2257 if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2260 /* now the binary */
2261 bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2262 self->opbin, leftr, right);
2266 /* we need to call the setter */
2271 compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2275 arr = (ast_value*)ai->array;
2276 if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2277 compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2281 cgen = arr->setter->codegen;
2282 if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2285 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2288 ir_call_param(call, iridx);
2289 ir_call_param(call, bin);
2292 /* now store them */
2293 cgen = self->dest->codegen;
2294 /* lvalue of destination */
2295 if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2299 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2304 /* Theoretically, an assinment returns its left side as an
2305 * lvalue, if we don't need an lvalue though, we return
2306 * the right side as an rvalue, otherwise we have to
2307 * somehow know whether or not we need to dereference the pointer
2308 * on the left side - that is: OP_LOAD if it was an address.
2309 * Also: in original QC we cannot OP_LOADP *anyway*.
2311 *out = (lvalue ? leftl : bin);
2316 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2318 ast_expression_codegen *cgen;
2321 /* An unary operation cannot yield an l-value */
2323 compile_error(ast_ctx(self), "not an l-value (binop)");
2332 cgen = self->operand->codegen;
2334 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2337 *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2346 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2348 ast_expression_codegen *cgen;
2353 /* In the context of a return operation, we don't actually return
2357 compile_error(ast_ctx(self), "return-expression is not an l-value");
2362 compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2365 self->outr = (ir_value*)1;
2367 if (self->operand) {
2368 cgen = self->operand->codegen;
2370 if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2373 if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2376 if (!ir_block_create_return(func->curblock, ast_ctx(self), nullptr))
2383 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2385 ast_expression_codegen *cgen;
2386 ir_value *ent, *field;
2388 /* This function needs to take the 'lvalue' flag into account!
2389 * As lvalue we provide a field-pointer, as rvalue we provide the
2393 if (lvalue && self->outl) {
2398 if (!lvalue && self->outr) {
2403 cgen = self->entity->codegen;
2404 if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2407 cgen = self->field->codegen;
2408 if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2413 *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2416 *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2417 ent, field, self->vtype);
2418 /* Done AFTER error checking:
2419 codegen_output_type(self, *out);
2423 compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2424 (lvalue ? "ADDRESS" : "FIELD"),
2425 type_name[self->vtype]);
2429 codegen_output_type(self, *out);
2436 /* Hm that should be it... */
2440 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2442 ast_expression_codegen *cgen;
2445 /* in QC this is always an lvalue */
2446 if (lvalue && self->rvalue) {
2447 compile_error(ast_ctx(self), "not an l-value (member access)");
2455 cgen = self->owner->codegen;
2456 if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2459 if (vec->vtype != TYPE_VECTOR &&
2460 !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2465 *out = ir_value_vector_member(vec, self->field);
2468 return (*out != nullptr);
2471 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2476 if (!lvalue && self->outr) {
2480 if (lvalue && self->outl) {
2485 if (!ast_istype(self->array, ast_value)) {
2486 compile_error(ast_ctx(self), "array indexing this way is not supported");
2487 /* note this would actually be pointer indexing because the left side is
2488 * not an actual array but (hopefully) an indexable expression.
2489 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2490 * support this path will be filled.
2495 arr = (ast_value*)self->array;
2496 idx = (ast_value*)self->index;
2498 if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2499 /* Time to use accessor functions */
2500 ast_expression_codegen *cgen;
2501 ir_value *iridx, *funval;
2505 compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2510 compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2514 cgen = self->index->codegen;
2515 if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2518 cgen = arr->getter->codegen;
2519 if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2522 call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2525 ir_call_param(call, iridx);
2527 *out = ir_call_value(call);
2529 (*out)->vtype = self->vtype;
2530 codegen_output_type(self, *out);
2534 if (idx->vtype == TYPE_FLOAT) {
2535 unsigned int arridx = idx->constval.vfloat;
2536 if (arridx >= self->array->count)
2538 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2541 *out = arr->ir_values[arridx];
2543 else if (idx->vtype == TYPE_INTEGER) {
2544 unsigned int arridx = idx->constval.vint;
2545 if (arridx >= self->array->count)
2547 compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2550 *out = arr->ir_values[arridx];
2553 compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2556 (*out)->vtype = self->vtype;
2557 codegen_output_type(self, *out);
2561 bool ast_argpipe_codegen(ast_argpipe *self, ast_function *func, bool lvalue, ir_value **out)
2565 compile_error(ast_ctx(self), "argpipe node: not an lvalue");
2570 compile_error(ast_ctx(self), "TODO: argpipe codegen not implemented");
2574 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2576 ast_expression_codegen *cgen;
2584 ir_block *ontrue_endblock = nullptr;
2585 ir_block *onfalse_endblock = nullptr;
2586 ir_block *merge = nullptr;
2589 /* We don't output any value, thus also don't care about r/lvalue */
2594 compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2597 self->outr = (ir_value*)1;
2599 /* generate the condition */
2600 cgen = self->cond->codegen;
2601 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2603 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2604 cond = func->curblock;
2606 /* try constant folding away the condition */
2607 if ((folded = fold::cond_ifthen(condval, func, self)) != -1)
2610 if (self->on_true) {
2611 /* create on-true block */
2612 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2616 /* enter the block */
2617 func->curblock = ontrue;
2620 cgen = self->on_true->codegen;
2621 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2624 /* we now need to work from the current endpoint */
2625 ontrue_endblock = func->curblock;
2630 if (self->on_false) {
2631 /* create on-false block */
2632 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2636 /* enter the block */
2637 func->curblock = onfalse;
2640 cgen = self->on_false->codegen;
2641 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2644 /* we now need to work from the current endpoint */
2645 onfalse_endblock = func->curblock;
2649 /* Merge block were they all merge in to */
2650 if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2652 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2655 /* add jumps ot the merge block */
2656 if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2658 if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2661 /* Now enter the merge block */
2662 func->curblock = merge;
2665 /* we create the if here, that way all blocks are ordered :)
2667 if (!ir_block_create_if(cond, ast_ctx(self), condval,
2668 (ontrue ? ontrue : merge),
2669 (onfalse ? onfalse : merge)))
2677 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2679 ast_expression_codegen *cgen;
2682 ir_value *trueval, *falseval;
2685 ir_block *cond = func->curblock;
2686 ir_block *cond_out = nullptr;
2687 ir_block *ontrue, *ontrue_out = nullptr;
2688 ir_block *onfalse, *onfalse_out = nullptr;
2692 /* Ternary can never create an lvalue... */
2696 /* In theory it shouldn't be possible to pass through a node twice, but
2697 * in case we add any kind of optimization pass for the AST itself, it
2698 * may still happen, thus we remember a created ir_value and simply return one
2699 * if it already exists.
2706 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2708 /* generate the condition */
2709 func->curblock = cond;
2710 cgen = self->cond->codegen;
2711 if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2713 cond_out = func->curblock;
2715 /* try constant folding away the condition */
2716 if ((folded = fold::cond_ternary(condval, func, self)) != -1)
2719 /* create on-true block */
2720 ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2725 /* enter the block */
2726 func->curblock = ontrue;
2729 cgen = self->on_true->codegen;
2730 if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2733 ontrue_out = func->curblock;
2736 /* create on-false block */
2737 onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2742 /* enter the block */
2743 func->curblock = onfalse;
2746 cgen = self->on_false->codegen;
2747 if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2750 onfalse_out = func->curblock;
2753 /* create merge block */
2754 merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2757 /* jump to merge block */
2758 if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2760 if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2763 /* create if instruction */
2764 if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2767 /* Now enter the merge block */
2768 func->curblock = merge;
2770 /* Here, now, we need a PHI node
2771 * but first some sanity checking...
2773 if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2774 /* error("ternary with different types on the two sides"); */
2775 compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2780 phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->vtype);
2782 compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2785 ir_phi_add(phi, ontrue_out, trueval);
2786 ir_phi_add(phi, onfalse_out, falseval);
2788 self->outr = ir_phi_value(phi);
2791 codegen_output_type(self, *out);
2796 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2798 ast_expression_codegen *cgen;
2800 ir_value *dummy = nullptr;
2801 ir_value *precond = nullptr;
2802 ir_value *postcond = nullptr;
2804 /* Since we insert some jumps "late" so we have blocks
2805 * ordered "nicely", we need to keep track of the actual end-blocks
2806 * of expressions to add the jumps to.
2808 ir_block *bbody = nullptr, *end_bbody = nullptr;
2809 ir_block *bprecond = nullptr, *end_bprecond = nullptr;
2810 ir_block *bpostcond = nullptr, *end_bpostcond = nullptr;
2811 ir_block *bincrement = nullptr, *end_bincrement = nullptr;
2812 ir_block *bout = nullptr, *bin = nullptr;
2814 /* let's at least move the outgoing block to the end */
2817 /* 'break' and 'continue' need to be able to find the right blocks */
2818 ir_block *bcontinue = nullptr;
2819 ir_block *bbreak = nullptr;
2821 ir_block *tmpblock = nullptr;
2827 compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2830 self->outr = (ir_value*)1;
2833 * Should we ever need some kind of block ordering, better make this function
2834 * move blocks around than write a block ordering algorithm later... after all
2835 * the ast and ir should work together, not against each other.
2838 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2839 * anyway if for example it contains a ternary.
2843 cgen = self->initexpr->codegen;
2844 if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2848 /* Store the block from which we enter this chaos */
2849 bin = func->curblock;
2851 /* The pre-loop condition needs its own block since we
2852 * need to be able to jump to the start of that expression.
2856 bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2860 /* the pre-loop-condition the least important place to 'continue' at */
2861 bcontinue = bprecond;
2864 func->curblock = bprecond;
2867 cgen = self->precond->codegen;
2868 if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2871 end_bprecond = func->curblock;
2873 bprecond = end_bprecond = nullptr;
2876 /* Now the next blocks won't be ordered nicely, but we need to
2877 * generate them this early for 'break' and 'continue'.
2879 if (self->increment) {
2880 bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2883 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2885 bincrement = end_bincrement = nullptr;
2888 if (self->postcond) {
2889 bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2892 bcontinue = bpostcond; /* postcond comes before the increment */
2894 bpostcond = end_bpostcond = nullptr;
2897 bout_id = func->ir_func->blocks.size();
2898 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2903 /* The loop body... */
2904 /* if (self->body) */
2906 bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2911 func->curblock = bbody;
2913 func->breakblocks.push_back(bbreak);
2915 func->continueblocks.push_back(bcontinue);
2917 func->continueblocks.push_back(bbody);
2921 cgen = self->body->codegen;
2922 if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2926 end_bbody = func->curblock;
2927 func->breakblocks.pop_back();
2928 func->continueblocks.pop_back();
2931 /* post-loop-condition */
2935 func->curblock = bpostcond;
2938 cgen = self->postcond->codegen;
2939 if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2942 end_bpostcond = func->curblock;
2945 /* The incrementor */
2946 if (self->increment)
2949 func->curblock = bincrement;
2952 cgen = self->increment->codegen;
2953 if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2956 end_bincrement = func->curblock;
2959 /* In any case now, we continue from the outgoing block */
2960 func->curblock = bout;
2962 /* Now all blocks are in place */
2963 /* From 'bin' we jump to whatever comes first */
2964 if (bprecond) tmpblock = bprecond;
2965 else tmpblock = bbody; /* can never be null */
2968 else if (bpostcond) tmpblock = bpostcond;
2969 else tmpblock = bout;
2972 if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2978 ir_block *ontrue, *onfalse;
2979 ontrue = bbody; /* can never be null */
2981 /* all of this is dead code
2982 else if (bincrement) ontrue = bincrement;
2983 else ontrue = bpostcond;
2987 if (self->pre_not) {
2992 if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2999 if (bincrement) tmpblock = bincrement;
3000 else if (bpostcond) tmpblock = bpostcond;
3001 else if (bprecond) tmpblock = bprecond;
3002 else tmpblock = bbody;
3003 if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
3007 /* from increment */
3010 if (bpostcond) tmpblock = bpostcond;
3011 else if (bprecond) tmpblock = bprecond;
3012 else if (bbody) tmpblock = bbody;
3013 else tmpblock = bout;
3014 if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
3021 ir_block *ontrue, *onfalse;
3022 if (bprecond) ontrue = bprecond;
3023 else ontrue = bbody; /* can never be null */
3025 /* all of this is dead code
3026 else if (bincrement) ontrue = bincrement;
3027 else ontrue = bpostcond;
3031 if (self->post_not) {
3036 if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
3040 /* Move 'bout' to the end */
3041 algo::shiftback(func->ir_func->blocks.begin() + bout_id,
3042 func->ir_func->blocks.end());
3044 //func->ir_func->blocks[bout_id].release(); // it's a vector<unique_ptr<>>
3045 //func->ir_func->blocks.erase(func->ir_func->blocks.begin() + bout_id);
3046 //func->ir_func->blocks.emplace_back(bout);
3051 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
3058 compile_error(ast_ctx(self), "break/continue expression is not an l-value");
3063 compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
3066 self->outr = (ir_value*)1;
3068 if (self->is_continue)
3069 target = func->continueblocks[func->continueblocks.size()-1-self->levels];
3071 target = func->breakblocks[func->breakblocks.size()-1-self->levels];
3074 compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
3078 if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
3083 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
3085 ast_expression_codegen *cgen;
3087 ast_switch_case *def_case = nullptr;
3088 ir_block *def_bfall = nullptr;
3089 ir_block *def_bfall_to = nullptr;
3090 bool set_def_bfall_to = false;
3092 ir_value *dummy = nullptr;
3093 ir_value *irop = nullptr;
3094 ir_block *bout = nullptr;
3095 ir_block *bfall = nullptr;
3102 compile_error(ast_ctx(self), "switch expression is not an l-value");
3107 compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
3110 self->outr = (ir_value*)1;
3115 cgen = self->operand->codegen;
3116 if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
3119 if (self->cases.empty())
3122 cmpinstr = type_eq_instr[irop->vtype];
3123 if (cmpinstr >= VINSTR_END) {
3124 ast_type_to_string(self->operand, typestr, sizeof(typestr));
3125 compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
3129 bout_id = func->ir_func->blocks.size();
3130 bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
3134 /* setup the break block */
3135 func->breakblocks.push_back(bout);
3137 /* Now create all cases */
3138 for (auto &it : self->cases) {
3139 ir_value *cond, *val;
3140 ir_block *bcase, *bnot;
3143 ast_switch_case *swcase = ⁢
3145 if (swcase->value) {
3146 /* A regular case */
3147 /* generate the condition operand */
3148 cgen = swcase->value->codegen;
3149 if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
3151 /* generate the condition */
3152 cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
3156 bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
3157 bnot_id = func->ir_func->blocks.size();
3158 bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
3159 if (!bcase || !bnot)
3161 if (set_def_bfall_to) {
3162 set_def_bfall_to = false;
3163 def_bfall_to = bcase;
3165 if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
3168 /* Make the previous case-end fall through */
3169 if (bfall && !bfall->final) {
3170 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
3174 /* enter the case */
3175 func->curblock = bcase;
3176 cgen = swcase->code->codegen;
3177 if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
3180 /* remember this block to fall through from */
3181 bfall = func->curblock;
3183 /* enter the else and move it down */
3184 func->curblock = bnot;
3185 algo::shiftback(func->ir_func->blocks.begin() + bnot_id,
3186 func->ir_func->blocks.end());
3188 //func->ir_func->blocks[bnot_id].release();
3189 //func->ir_func->blocks.erase(func->ir_func->blocks.begin() + bnot_id);
3190 //func->ir_func->blocks.emplace_back(bnot);
3192 /* The default case */
3193 /* Remember where to fall through from: */
3196 /* remember which case it was */
3198 /* And the next case will be remembered */
3199 set_def_bfall_to = true;
3203 /* Jump from the last bnot to bout */
3204 if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
3206 astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
3211 /* If there was a default case, put it down here */
3215 /* No need to create an extra block */
3216 bcase = func->curblock;
3218 /* Insert the fallthrough jump */
3219 if (def_bfall && !def_bfall->final) {
3220 if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
3224 /* Now generate the default code */
3225 cgen = def_case->code->codegen;
3226 if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
3229 /* see if we need to fall through */
3230 if (def_bfall_to && !func->curblock->final)
3232 if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
3237 /* Jump from the last bnot to bout */
3238 if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
3240 /* enter the outgoing block */
3241 func->curblock = bout;
3243 /* restore the break block */
3244 func->breakblocks.pop_back();
3246 /* Move 'bout' to the end, it's nicer */
3247 algo::shiftback(func->ir_func->blocks.begin() + bout_id,
3248 func->ir_func->blocks.end());
3250 //func->ir_func->blocks[bout_id].release();
3251 //func->ir_func->blocks.erase(func->ir_func->blocks.begin() + bout_id);
3252 //func->ir_func->blocks.emplace_back(bout);
3257 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3261 if (self->undefined) {
3262 compile_error(ast_ctx(self), "internal error: ast_label never defined");
3268 compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3272 /* simply create a new block and jump to it */
3273 self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3274 if (!self->irblock) {
3275 compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3278 if (!func->curblock->final) {
3279 if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3283 /* enter the new block */
3284 func->curblock = self->irblock;
3286 /* Generate all the leftover gotos */
3287 for (auto &it : self->gotos) {
3288 if (!ast_goto_codegen(it, func, false, &dummy))
3295 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3299 compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3303 if (self->target->irblock) {
3304 if (self->irblock_from) {
3305 /* we already tried once, this is the callback */
3306 self->irblock_from->final = false;
3307 if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3308 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3314 if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3315 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3322 /* the target has not yet been created...
3323 * close this block in a sneaky way:
3325 func->curblock->final = true;
3326 self->irblock_from = func->curblock;
3327 ast_label_register_goto(self->target, self);
3334 bool ast_state_codegen(ast_state *self, ast_function *func, bool lvalue, ir_value **out)
3336 ast_expression_codegen *cgen;
3338 ir_value *frameval, *thinkval;
3341 compile_error(ast_ctx(self), "not an l-value (state operation)");
3345 compile_error(ast_ctx(self), "internal error: ast_state cannot be reused!");
3350 cgen = self->framenum->codegen;
3351 if (!(*cgen)((ast_expression*)(self->framenum), func, false, &frameval))
3356 cgen = self->nextthink->codegen;
3357 if (!(*cgen)((ast_expression*)(self->nextthink), func, false, &thinkval))
3362 if (!ir_block_create_state_op(func->curblock, ast_ctx(self), frameval, thinkval)) {
3363 compile_error(ast_ctx(self), "failed to create STATE instruction");
3367 self->outr = (ir_value*)1;
3371 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3373 ast_expression_codegen *cgen;
3374 std::vector<ir_value*> params;
3375 ir_instr *callinstr;
3377 ir_value *funval = nullptr;
3379 /* return values are never lvalues */
3381 compile_error(ast_ctx(self), "not an l-value (function call)");
3390 cgen = self->func->codegen;
3391 if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3397 for (auto &it : self->params) {
3400 if (!(*cgen)(it, func, false, ¶m))
3404 params.push_back(param);
3407 /* varargs counter */
3408 if (self->va_count) {
3410 ir_builder *builder = func->curblock->owner->owner;
3411 cgen = self->va_count->codegen;
3412 if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3414 if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3415 ir_builder_get_va_count(builder), va_count))
3421 callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3422 ast_function_label(func, "call"),
3423 funval, !!(self->func->flags & AST_FLAG_NORETURN));
3427 for (auto &it : params)
3428 ir_call_param(callinstr, it);
3430 *out = ir_call_value(callinstr);
3433 codegen_output_type(self, *out);