13 /* Initialize main ast node aprts */
14 ast_node::ast_node(lex_ctx_t ctx, int node_type)
16 , m_node_type(node_type)
18 , m_side_effects(false)
26 /* weight and side effects */
27 void ast_node::propagateSideEffects(const ast_node *other)
29 if (other->m_side_effects)
30 m_side_effects = true;
33 /* General expression initialization */
34 ast_expression::ast_expression(lex_ctx_t ctx, int nodetype, qc_type type)
35 : ast_node(ctx, nodetype)
38 if (OPTS_OPTION_BOOL(OPTION_COVERAGE))
39 m_flags |= AST_FLAG_BLOCK_COVERAGE;
41 ast_expression::ast_expression(lex_ctx_t ctx, int nodetype)
42 : ast_expression(ctx, nodetype, TYPE_VOID)
45 ast_expression::~ast_expression()
53 ast_expression::ast_expression(ast_copy_type_t, const ast_expression &other)
54 : ast_expression(ast_copy_type, other.m_context, other)
57 ast_expression::ast_expression(ast_copy_type_t, lex_ctx_t ctx, const ast_expression &other)
58 : ast_expression(ast_copy_type, TYPE_ast_expression, ctx, other)
61 ast_expression::ast_expression(ast_copy_type_t, int nodetype, const ast_expression &other)
62 : ast_expression(ast_copy_type, nodetype, other.m_context, other)
65 ast_expression::ast_expression(ast_copy_type_t, int nodetype, lex_ctx_t ctx, const ast_expression &other)
66 : ast_expression(ctx, nodetype)
68 m_vtype = other.m_vtype;
69 m_count = other.m_count;
70 m_flags = other.m_flags;
72 m_next = new ast_expression(ast_copy_type, *other.m_next);
73 m_type_params.reserve(other.m_type_params.size());
74 for (auto &it : other.m_type_params)
75 m_type_params.emplace_back(new ast_value(ast_copy_type, *it));
79 ast_expression *ast_expression::shallowType(lex_ctx_t ctx, qc_type vtype) {
80 auto expr = new ast_expression(ctx, TYPE_ast_expression);
81 expr->m_vtype = vtype;
85 void ast_expression::adoptType(const ast_expression &other)
87 m_vtype = other.m_vtype;
89 m_next = new ast_expression(ast_copy_type, *other.m_next);
90 m_count = other.m_count;
91 m_flags = other.m_flags;
92 m_type_params.clear();
93 m_type_params.reserve(other.m_type_params.size());
94 for (auto &it : other.m_type_params)
95 m_type_params.emplace_back(new ast_value(ast_copy_type, *it));
98 bool ast_expression::compareType(const ast_expression &other) const
100 if (m_vtype == TYPE_NIL ||
101 other.m_vtype == TYPE_NIL)
103 if (m_vtype != other.m_vtype)
105 if (!m_next != !other.m_next)
107 if (m_type_params.size() != other.m_type_params.size())
109 if ((m_flags & AST_FLAG_TYPE_MASK) !=
110 (other.m_flags & AST_FLAG_TYPE_MASK) )
114 if (m_type_params.size()) {
116 for (i = 0; i < m_type_params.size(); ++i) {
117 if (!m_type_params[i]->compareType(*other.m_type_params[i]))
122 return m_next->compareType(*other.m_next);
126 bool ast_expression::codegen(ast_function*, bool, ir_value**) {
127 compile_error(m_context, "ast_expression::codegen called!");
132 ast_value::ast_value(ast_copy_type_t, const ast_value &other, const std::string &name)
133 : ast_value(ast_copy_type, static_cast<const ast_expression&>(other), name)
135 m_keep_node = true; // keep values, always
136 memset(&m_constval, 0, sizeof(m_constval));
139 ast_value::ast_value(ast_copy_type_t, const ast_value &other)
140 : ast_value(ast_copy_type, static_cast<const ast_expression&>(other), other.m_name)
142 m_keep_node = true; // keep values, always
143 memset(&m_constval, 0, sizeof(m_constval));
146 ast_value::ast_value(ast_copy_type_t, const ast_expression &other, const std::string &name)
147 : ast_expression(ast_copy_type, TYPE_ast_value, other)
150 m_keep_node = true; // keep values, always
151 memset(&m_constval, 0, sizeof(m_constval));
154 ast_value::ast_value(lex_ctx_t ctx, const std::string &name, qc_type t)
155 : ast_expression(ctx, TYPE_ast_value, t)
158 m_keep_node = true; // keep values, always
159 memset(&m_constval, 0, sizeof(m_constval));
162 ast_value::~ast_value()
165 mem_d((void*)m_argcounter);
170 mem_d((void*)m_constval.vstring);
173 // unlink us from the function node
174 m_constval.vfunc->m_function_type = nullptr;
176 // NOTE: delete function? currently collected in
177 // the parser structure
183 // initlist imples an array which implies .next in the expression exists.
184 if (m_initlist.size() && m_next->m_vtype == TYPE_STRING) {
185 for (auto &it : m_initlist)
191 static size_t ast_type_to_string_impl(const ast_expression *e, char *buf, size_t bufsize, size_t pos)
198 if (pos + 6 >= bufsize)
200 util_strncpy(buf + pos, "(null)", 6);
204 if (pos + 1 >= bufsize)
207 switch (e->m_vtype) {
209 util_strncpy(buf + pos, "(variant)", 9);
214 return ast_type_to_string_impl(e->m_next, buf, bufsize, pos);
217 if (pos + 3 >= bufsize)
221 pos = ast_type_to_string_impl(e->m_next, buf, bufsize, pos);
222 if (pos + 1 >= bufsize)
228 pos = ast_type_to_string_impl(e->m_next, buf, bufsize, pos);
229 if (pos + 2 >= bufsize)
231 if (e->m_type_params.empty()) {
237 pos = ast_type_to_string_impl(e->m_type_params[0].get(), buf, bufsize, pos);
238 for (i = 1; i < e->m_type_params.size(); ++i) {
239 if (pos + 2 >= bufsize)
243 pos = ast_type_to_string_impl(e->m_type_params[i].get(), buf, bufsize, pos);
245 if (pos + 1 >= bufsize)
251 pos = ast_type_to_string_impl(e->m_next, buf, bufsize, pos);
252 if (pos + 1 >= bufsize)
255 pos += util_snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->m_count);
256 if (pos + 1 >= bufsize)
262 typestr = type_name[e->m_vtype];
263 typelen = strlen(typestr);
264 if (pos + typelen >= bufsize)
266 util_strncpy(buf + pos, typestr, typelen);
267 return pos + typelen;
271 buf[bufsize-3] = '.';
272 buf[bufsize-2] = '.';
273 buf[bufsize-1] = '.';
277 void ast_type_to_string(const ast_expression *e, char *buf, size_t bufsize)
279 size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
283 void ast_value::addParam(ast_value *p)
285 m_type_params.emplace_back(p);
288 ast_binary::ast_binary(lex_ctx_t ctx, int op,
289 ast_expression* left, ast_expression* right)
290 : ast_expression(ctx, TYPE_ast_binary)
292 // m_left/m_right happen after the peephole step right below
293 , m_right_first(false)
295 if (ast_istype(right, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
296 ast_unary *unary = ((ast_unary*)right);
297 ast_expression *normal = unary->m_operand;
299 /* make a-(-b) => a + b */
300 if (unary->m_op == VINSTR_NEG_F || unary->m_op == VINSTR_NEG_V) {
301 if (op == INSTR_SUB_F) {
304 ++opts_optimizationcount[OPTIM_PEEPHOLE];
305 } else if (op == INSTR_SUB_V) {
308 ++opts_optimizationcount[OPTIM_PEEPHOLE];
316 propagateSideEffects(left);
317 propagateSideEffects(right);
319 if (op >= INSTR_EQ_F && op <= INSTR_GT)
320 m_vtype = TYPE_FLOAT;
321 else if (op == INSTR_AND || op == INSTR_OR) {
322 if (OPTS_FLAG(PERL_LOGIC))
325 m_vtype = TYPE_FLOAT;
327 else if (op == INSTR_BITAND || op == INSTR_BITOR)
328 m_vtype = TYPE_FLOAT;
329 else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
330 m_vtype = TYPE_VECTOR;
331 else if (op == INSTR_MUL_V)
332 m_vtype = TYPE_FLOAT;
334 m_vtype = left->m_vtype;
337 m_refs = AST_REF_ALL;
340 ast_binary::~ast_binary()
342 if (m_refs & AST_REF_LEFT) ast_unref(m_left);
343 if (m_refs & AST_REF_RIGHT) ast_unref(m_right);
346 ast_binstore::ast_binstore(lex_ctx_t ctx, int storop, int mathop,
347 ast_expression* left, ast_expression* right)
348 : ast_expression(ctx, TYPE_ast_binstore)
355 m_side_effects = true;
359 ast_binstore::~ast_binstore()
366 ast_unary* ast_unary::make(lex_ctx_t ctx, int op, ast_expression *expr)
368 // handle double negation, double bitwise or logical not
369 if (op == opid2('!','P') ||
370 op == opid2('~','P') ||
371 op == opid2('-','P'))
373 if (ast_istype(expr, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
374 ast_unary *unary = reinterpret_cast<ast_unary*>(expr);
375 if (unary->m_op == op) {
376 auto out = reinterpret_cast<ast_unary*>(unary->m_operand);
377 unary->m_operand = nullptr;
379 ++opts_optimizationcount[OPTIM_PEEPHOLE];
385 return new ast_unary(ctx, op, expr);
388 ast_unary::ast_unary(lex_ctx_t ctx, int op, ast_expression *expr)
389 : ast_expression(ctx, TYPE_ast_unary)
393 propagateSideEffects(expr);
394 if ((op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) || op == VINSTR_NEG_F) {
395 m_vtype = TYPE_FLOAT;
396 } else if (op == VINSTR_NEG_V) {
397 m_vtype = TYPE_VECTOR;
399 compile_error(ctx, "cannot determine type of unary operation %s", util_instr_str[op]);
403 ast_unary::~ast_unary()
406 ast_unref(m_operand);
409 ast_return::ast_return(lex_ctx_t ctx, ast_expression *expr)
410 : ast_expression(ctx, TYPE_ast_return)
414 propagateSideEffects(expr);
417 ast_return::~ast_return()
420 ast_unref(m_operand);
423 ast_entfield::ast_entfield(lex_ctx_t ctx, ast_expression *entity, ast_expression *field)
424 : ast_entfield(ctx, entity, field, field->m_next)
426 if (field->m_vtype != TYPE_FIELD)
427 compile_error(ctx, "ast_entfield with expression not of type field");
430 ast_entfield::ast_entfield(lex_ctx_t ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
431 : ast_expression(ctx, TYPE_ast_entfield)
435 propagateSideEffects(m_entity);
436 propagateSideEffects(m_field);
439 compile_error(ctx, "ast_entfield: field has no type");
446 ast_entfield::~ast_entfield()
452 ast_member *ast_member::make(lex_ctx_t ctx, ast_expression *owner, unsigned int field, const std::string &name)
455 compile_error(ctx, "ast_member: invalid field (>=3): %u", field);
458 if (owner->m_vtype != TYPE_VECTOR &&
459 owner->m_vtype != TYPE_FIELD)
461 compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->m_vtype]);
464 return new ast_member(ctx, owner, field, name);
467 ast_member::ast_member(lex_ctx_t ctx, ast_expression *owner, unsigned int field, const std::string &name)
468 : ast_expression(ctx, TYPE_ast_member)
476 if (m_owner->m_vtype == TYPE_VECTOR) {
477 m_vtype = TYPE_FLOAT;
480 m_vtype = TYPE_FIELD;
481 m_next = ast_expression::shallowType(ctx, TYPE_FLOAT);
484 propagateSideEffects(owner);
487 ast_member::~ast_member()
489 // The owner is always an ast_value, which has .keep_node=true,
490 // also: ast_members are usually deleted after the owner, thus
491 // this will cause invalid access
492 //ast_unref(self->m_owner);
493 // once we allow (expression).x to access a vector-member, we need
494 // to change this: preferably by creating an alternate ast node for this
495 // purpose that is not garbage-collected.
498 ast_array_index* ast_array_index::make(lex_ctx_t ctx, ast_expression *array, ast_expression *index)
500 ast_expression *outtype = array->m_next;
506 return new ast_array_index(ctx, array, index);
509 ast_array_index::ast_array_index(lex_ctx_t ctx, ast_expression *array, ast_expression *index)
510 : ast_expression(ctx, TYPE_ast_array_index)
514 propagateSideEffects(array);
515 propagateSideEffects(index);
517 ast_expression *outtype = m_array->m_next;
520 if (array->m_vtype == TYPE_FIELD && outtype->m_vtype == TYPE_ARRAY) {
521 // FIXME: investigate - this is not possible after adoptType
522 //if (m_vtype != TYPE_ARRAY) {
523 // compile_error(self->m_context, "array_index node on type");
524 // ast_array_index_delete(self);
529 m_vtype = TYPE_FIELD;
533 ast_array_index::~ast_array_index()
541 ast_argpipe::ast_argpipe(lex_ctx_t ctx, ast_expression *index)
542 : ast_expression(ctx, TYPE_ast_argpipe)
545 m_vtype = TYPE_NOEXPR;
548 ast_argpipe::~ast_argpipe()
554 ast_store::ast_store(lex_ctx_t ctx, int op, ast_expression *dest, ast_expression *source)
555 : ast_expression(ctx, TYPE_ast_store)
560 m_side_effects = true;
564 ast_store::~ast_store()
570 ast_ifthen::ast_ifthen(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
571 : ast_expression(ctx, TYPE_ast_ifthen)
574 , m_on_false(onfalse)
576 propagateSideEffects(cond);
578 propagateSideEffects(ontrue);
580 propagateSideEffects(onfalse);
583 ast_ifthen::~ast_ifthen()
587 ast_unref(m_on_true);
589 ast_unref(m_on_false);
592 ast_ternary::ast_ternary(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
593 : ast_expression(ctx, TYPE_ast_ternary)
596 , m_on_false(onfalse)
598 propagateSideEffects(cond);
599 propagateSideEffects(ontrue);
600 propagateSideEffects(onfalse);
602 if (ontrue->m_vtype == TYPE_NIL)
608 ast_ternary::~ast_ternary()
610 /* the if()s are only there because computed-gotos can set them
613 if (m_cond) ast_unref(m_cond);
614 if (m_on_true) ast_unref(m_on_true);
615 if (m_on_false) ast_unref(m_on_false);
618 ast_loop::ast_loop(lex_ctx_t ctx,
619 ast_expression *initexpr,
620 ast_expression *precond, bool pre_not,
621 ast_expression *postcond, bool post_not,
622 ast_expression *increment,
623 ast_expression *body)
624 : ast_expression(ctx, TYPE_ast_loop)
625 , m_initexpr(initexpr)
627 , m_postcond(postcond)
628 , m_increment(increment)
631 , m_post_not(post_not)
634 propagateSideEffects(initexpr);
636 propagateSideEffects(precond);
638 propagateSideEffects(postcond);
640 propagateSideEffects(increment);
642 propagateSideEffects(body);
645 ast_loop::~ast_loop()
648 ast_unref(m_initexpr);
650 ast_unref(m_precond);
652 ast_unref(m_postcond);
654 ast_unref(m_increment);
659 ast_breakcont::ast_breakcont(lex_ctx_t ctx, bool iscont, unsigned int levels)
660 : ast_expression(ctx, TYPE_ast_breakcont)
661 , m_is_continue(iscont)
666 ast_breakcont::~ast_breakcont()
670 ast_switch::ast_switch(lex_ctx_t ctx, ast_expression *op)
671 : ast_expression(ctx, TYPE_ast_switch)
674 propagateSideEffects(op);
677 ast_switch::~ast_switch()
679 ast_unref(m_operand);
681 for (auto &it : m_cases) {
683 ast_unref(it.m_value);
684 ast_unref(it.m_code);
688 ast_label::ast_label(lex_ctx_t ctx, const std::string &name, bool undefined)
689 : ast_expression(ctx, TYPE_ast_label)
692 , m_undefined(undefined)
694 m_vtype = TYPE_NOEXPR;
697 ast_label::~ast_label()
701 void ast_label::registerGoto(ast_goto *g)
703 m_gotos.push_back(g);
706 ast_goto::ast_goto(lex_ctx_t ctx, const std::string &name)
707 : ast_expression(ctx, TYPE_ast_goto)
710 , m_irblock_from(nullptr)
714 ast_goto::~ast_goto()
718 void ast_goto::setLabel(ast_label *label)
723 ast_state::ast_state(lex_ctx_t ctx, ast_expression *frame, ast_expression *think)
724 : ast_expression(ctx, TYPE_ast_expression)
730 ast_state::~ast_state()
733 ast_unref(m_framenum);
735 ast_unref(m_nextthink);
738 ast_call *ast_call::make(lex_ctx_t ctx, ast_expression *funcexpr)
740 if (!funcexpr->m_next) {
741 compile_error(ctx, "not a function");
744 return new ast_call(ctx, funcexpr);
747 ast_call::ast_call(lex_ctx_t ctx, ast_expression *funcexpr)
748 : ast_expression(ctx, TYPE_ast_call)
750 , m_va_count(nullptr)
752 m_side_effects = true;
753 adoptType(*funcexpr->m_next);
756 ast_call::~ast_call()
758 for (auto &it : m_params)
765 ast_unref(m_va_count);
768 bool ast_call::checkVararg(ast_expression *va_type, ast_expression *exp_type) const
774 if (!va_type || !va_type->compareType(*exp_type))
776 if (va_type && exp_type)
778 ast_type_to_string(va_type, tgot, sizeof(tgot));
779 ast_type_to_string(exp_type, texp, sizeof(texp));
780 if (OPTS_FLAG(UNSAFE_VARARGS)) {
781 if (compile_warning(m_context, WARN_UNSAFE_TYPES,
782 "piped variadic argument differs in type: constrained to type %s, expected type %s",
786 compile_error(m_context,
787 "piped variadic argument differs in type: constrained to type %s, expected type %s",
794 ast_type_to_string(exp_type, texp, sizeof(texp));
795 if (OPTS_FLAG(UNSAFE_VARARGS)) {
796 if (compile_warning(m_context, WARN_UNSAFE_TYPES,
797 "piped variadic argument may differ in type: expected type %s",
801 compile_error(m_context,
802 "piped variadic argument may differ in type: expected type %s",
811 bool ast_call::checkTypes(ast_expression *va_type) const
818 size_t count = m_params.size();
819 if (count > m_func->m_type_params.size())
820 count = m_func->m_type_params.size();
822 for (i = 0; i < count; ++i) {
823 if (ast_istype(m_params[i], ast_argpipe)) {
824 /* warn about type safety instead */
826 compile_error(m_context, "argpipe must be the last parameter to a function call");
829 if (!checkVararg(va_type, m_func->m_type_params[i].get()))
832 else if (!m_params[i]->compareType(*m_func->m_type_params[i]))
834 ast_type_to_string(m_params[i], tgot, sizeof(tgot));
835 ast_type_to_string(m_func->m_type_params[i].get(), texp, sizeof(texp));
836 compile_error(m_context, "invalid type for parameter %u in function call: expected %s, got %s",
837 (unsigned int)(i+1), texp, tgot);
838 /* we don't immediately return */
842 count = m_params.size();
843 if (count > m_func->m_type_params.size() && m_func->m_varparam) {
844 for (; i < count; ++i) {
845 if (ast_istype(m_params[i], ast_argpipe)) {
846 /* warn about type safety instead */
848 compile_error(m_context, "argpipe must be the last parameter to a function call");
851 if (!checkVararg(va_type, m_func->m_varparam))
854 else if (!m_params[i]->compareType(*m_func->m_varparam))
856 ast_type_to_string(m_params[i], tgot, sizeof(tgot));
857 ast_type_to_string(m_func->m_varparam, texp, sizeof(texp));
858 compile_error(m_context, "invalid type for variadic parameter %u in function call: expected %s, got %s",
859 (unsigned int)(i+1), texp, tgot);
860 /* we don't immediately return */
868 ast_block::ast_block(lex_ctx_t ctx)
869 : ast_expression(ctx, TYPE_ast_block)
873 ast_block::~ast_block()
875 for (auto &it : m_exprs) ast_unref(it);
876 for (auto &it : m_locals) delete it;
877 for (auto &it : m_collect) delete it;
880 void ast_block::setType(const ast_expression &from)
888 bool ast_block::addExpr(ast_expression *e)
890 propagateSideEffects(e);
891 m_exprs.push_back(e);
900 void ast_block::collect(ast_expression *expr)
902 m_collect.push_back(expr);
903 expr->m_keep_node = true;
906 ast_function *ast_function::make(lex_ctx_t ctx, const std::string &name, ast_value *vtype)
909 compile_error(ctx, "internal error: ast_function_new condition 0");
911 } else if (vtype->m_hasvalue || vtype->m_vtype != TYPE_FUNCTION) {
912 compile_error(ctx, "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
914 (int)vtype->m_hasvalue,
918 return new ast_function(ctx, name, vtype);
921 ast_function::ast_function(lex_ctx_t ctx, const std::string &name, ast_value *vtype)
922 : ast_node(ctx, TYPE_ast_function)
923 , m_function_type(vtype)
928 , m_curblock(nullptr)
932 , m_fixedparams(nullptr)
933 , m_return_value(nullptr)
935 vtype->m_hasvalue = true;
936 vtype->m_constval.vfunc = this;
939 ast_function::~ast_function()
941 if (m_function_type) {
942 // ast_value_delete(m_function_type);
943 m_function_type->m_hasvalue = false;
944 m_function_type->m_constval.vfunc = nullptr;
945 // We use unref - if it was stored in a global table it is supposed
946 // to be deleted from *there*
947 ast_unref(m_function_type);
951 ast_unref(m_fixedparams);
953 ast_unref(m_return_value);
955 // force this to be cleared before m_varargs/m_argc as blocks might
956 // try to access them via ast_unref()
960 const char* ast_function::makeLabel(const char *prefix)
966 if (!OPTS_OPTION_BOOL(OPTION_DUMP) &&
967 !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
968 !OPTS_OPTION_BOOL(OPTION_DEBUG))
973 id = (m_labelcount++);
974 len = strlen(prefix);
976 from = m_labelbuf + sizeof(m_labelbuf)-1;
979 *from-- = (id%10) + '0';
983 memcpy(from - len, prefix, len);
987 /*********************************************************************/
989 * by convention you must never pass nullptr to the 'ir_value **out'
990 * parameter. If you really don't care about the output, pass a dummy.
991 * But I can't imagine a pituation where the output is truly unnecessary.
994 static void codegen_output_type(ast_expression *self, ir_value *out)
996 if (out->m_vtype == TYPE_FIELD)
997 out->m_fieldtype = self->m_next->m_vtype;
998 if (out->m_vtype == TYPE_FUNCTION)
999 out->m_outtype = self->m_next->m_vtype;
1002 bool ast_value::codegen(ast_function *func, bool lvalue, ir_value **out)
1006 if (m_vtype == TYPE_NIL) {
1007 *out = func->m_ir_func->m_owner->m_nil;
1010 // NOTE: This is the codegen for a variable used in an expression.
1011 // It is not the codegen to generate the value storage. For this purpose,
1012 // generateLocal and generateGlobal are to be used before this
1013 // is executed. ast_function::generateFunction should take care of its
1014 // locals, and the ast-user should take care of generateGlobal to be used
1015 // on all the globals.
1017 char tname[1024]; /* typename is reserved in C++ */
1018 ast_type_to_string(this, tname, sizeof(tname));
1019 compile_error(m_context, "ast_value used before generated %s %s", tname, m_name);
1026 bool ast_value::setGlobalArray()
1028 size_t count = m_initlist.size();
1031 if (count > m_count) {
1032 compile_error(m_context, "too many elements in initializer");
1035 else if (count < m_count) {
1037 compile_warning(m_context, "not all elements are initialized");
1041 for (i = 0; i != count; ++i) {
1042 switch (m_next->m_vtype) {
1044 if (!m_ir_values[i]->setFloat(m_initlist[i].vfloat))
1048 if (!m_ir_values[i]->setVector(m_initlist[i].vvec))
1052 if (!m_ir_values[i]->setString(m_initlist[i].vstring))
1056 /* we don't support them in any other place yet either */
1057 compile_error(m_context, "TODO: nested arrays");
1060 /* this requiers a bit more work - similar to the fields I suppose */
1061 compile_error(m_context, "global of type function not properly generated");
1064 if (!m_initlist[i].vfield) {
1065 compile_error(m_context, "field constant without vfield set");
1068 if (!m_initlist[i].vfield->m_ir_v) {
1069 compile_error(m_context, "field constant generated before its field");
1072 if (!m_ir_values[i]->setField(m_initlist[i].vfield->m_ir_v))
1076 compile_error(m_context, "TODO: global constant type %i", m_vtype);
1083 bool ast_value::checkArray(const ast_value &array) const
1085 if (array.m_flags & AST_FLAG_ARRAY_INIT && array.m_initlist.empty()) {
1086 compile_error(m_context, "array without size: %s", m_name);
1089 // we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements
1090 if (!array.m_count || array.m_count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1091 compile_error(m_context, "Invalid array of size %lu", (unsigned long)array.m_count);
1097 bool ast_value::generateGlobal(ir_builder *ir, bool isfield)
1099 if (m_vtype == TYPE_NIL) {
1100 compile_error(m_context, "internal error: trying to generate a variable of TYPE_NIL");
1104 if (m_hasvalue && m_vtype == TYPE_FUNCTION)
1105 return generateGlobalFunction(ir);
1107 if (isfield && m_vtype == TYPE_FIELD)
1108 return generateGlobalField(ir);
1110 ir_value *v = nullptr;
1111 if (m_vtype == TYPE_ARRAY) {
1112 v = prepareGlobalArray(ir);
1116 // Arrays don't do this since there's no "array" value which spans across the
1118 v = ir->createGlobal(m_name, m_vtype);
1120 compile_error(m_context, "ir_builder::createGlobal failed on `%s`", m_name);
1123 codegen_output_type(this, v);
1124 v->m_context = m_context;
1127 /* link us to the ir_value */
1131 if (m_flags & AST_FLAG_INCLUDE_DEF)
1132 m_ir_v->m_flags |= IR_FLAG_INCLUDE_DEF;
1133 if (m_flags & AST_FLAG_ERASEABLE)
1134 m_ir_v->m_flags |= IR_FLAG_ERASABLE;
1141 if (!v->setFloat(m_constval.vfloat))
1145 if (!v->setVector(m_constval.vvec))
1149 if (!v->setString(m_constval.vstring))
1153 if (!setGlobalArray())
1157 compile_error(m_context, "global of type function not properly generated");
1159 /* Cannot generate an IR value for a function,
1160 * need a pointer pointing to a function rather.
1163 if (!m_constval.vfield) {
1164 compile_error(m_context, "field constant without vfield set");
1167 if (!m_constval.vfield->m_ir_v) {
1168 compile_error(m_context, "field constant generated before its field");
1171 if (!v->setField(m_constval.vfield->m_ir_v))
1175 compile_error(m_context, "TODO: global constant type %i", m_vtype);
1183 bool ast_value::generateGlobalFunction(ir_builder *ir)
1185 ir_function *func = ir->createFunction(m_name, m_next->m_vtype);
1188 func->m_context = m_context;
1189 func->m_value->m_context = m_context;
1191 m_constval.vfunc->m_ir_func = func;
1192 m_ir_v = func->m_value;
1193 if (m_flags & AST_FLAG_INCLUDE_DEF)
1194 m_ir_v->m_flags |= IR_FLAG_INCLUDE_DEF;
1195 if (m_flags & AST_FLAG_ERASEABLE)
1196 m_ir_v->m_flags |= IR_FLAG_ERASABLE;
1197 if (m_flags & AST_FLAG_BLOCK_COVERAGE)
1198 func->m_flags |= IR_FLAG_BLOCK_COVERAGE;
1199 // The function is filled later on ast_function::generateFunction...
1203 bool ast_value::generateGlobalField(ir_builder *ir)
1205 ast_expression *fieldtype = m_next;
1208 compile_error(m_context, "TODO: constant field pointers with value");
1212 if (fieldtype->m_vtype == TYPE_ARRAY) {
1213 if (!ast_istype(fieldtype, ast_value)) {
1214 compile_error(m_context, "internal error: ast_value required");
1217 ast_value *array = reinterpret_cast<ast_value*>(fieldtype);
1219 if (!checkArray(*array))
1222 ast_expression *elemtype = array->m_next;
1223 qc_type vtype = elemtype->m_vtype;
1225 ir_value *v = ir->createField(m_name, vtype);
1227 compile_error(m_context, "ir_builder::createGlobal failed on `%s`", m_name);
1230 v->m_context = m_context;
1231 v->m_unique_life = true;
1233 array->m_ir_v = m_ir_v = v;
1235 if (m_flags & AST_FLAG_INCLUDE_DEF)
1236 m_ir_v->m_flags |= IR_FLAG_INCLUDE_DEF;
1237 if (m_flags & AST_FLAG_ERASEABLE)
1238 m_ir_v->m_flags |= IR_FLAG_ERASABLE;
1240 const size_t namelen = m_name.length();
1241 std::unique_ptr<char[]> name(new char[namelen+16]);
1242 util_strncpy(name.get(), m_name.c_str(), namelen);
1244 array->m_ir_values.resize(array->m_count);
1245 array->m_ir_values[0] = v;
1246 for (size_t ai = 1; ai < array->m_count; ++ai) {
1247 util_snprintf(name.get() + namelen, 16, "[%u]", (unsigned int)ai);
1248 array->m_ir_values[ai] = ir->createField(name.get(), vtype);
1249 if (!array->m_ir_values[ai]) {
1250 compile_error(m_context, "ir_builder::createGlobal failed on `%s`", name.get());
1253 array->m_ir_values[ai]->m_context = m_context;
1254 array->m_ir_values[ai]->m_unique_life = true;
1255 array->m_ir_values[ai]->m_locked = true;
1256 if (m_flags & AST_FLAG_INCLUDE_DEF)
1257 m_ir_values[ai]->m_flags |= IR_FLAG_INCLUDE_DEF;
1262 ir_value *v = ir->createField(m_name, m_next->m_vtype);
1265 v->m_context = m_context;
1267 if (m_flags & AST_FLAG_INCLUDE_DEF)
1268 m_ir_v->m_flags |= IR_FLAG_INCLUDE_DEF;
1270 if (m_flags & AST_FLAG_ERASEABLE)
1271 m_ir_v->m_flags |= IR_FLAG_ERASABLE;
1276 ir_value *ast_value::prepareGlobalArray(ir_builder *ir)
1278 ast_expression *elemtype = m_next;
1279 qc_type vtype = elemtype->m_vtype;
1281 if (m_flags & AST_FLAG_ARRAY_INIT && !m_count) {
1282 compile_error(m_context, "array `%s' has no size", m_name);
1286 /* same as with field arrays */
1287 if (!checkArray(*this))
1290 ir_value *v = ir->createGlobal(m_name, vtype);
1292 compile_error(m_context, "ir_builder::createGlobal failed `%s`", m_name);
1295 v->m_context = m_context;
1296 v->m_unique_life = true;
1299 if (m_flags & AST_FLAG_INCLUDE_DEF)
1300 v->m_flags |= IR_FLAG_INCLUDE_DEF;
1301 if (m_flags & AST_FLAG_ERASEABLE)
1302 m_ir_v->m_flags |= IR_FLAG_ERASABLE;
1304 const size_t namelen = m_name.length();
1305 std::unique_ptr<char[]> name(new char[namelen+16]);
1306 util_strncpy(name.get(), m_name.c_str(), namelen);
1308 m_ir_values.resize(m_count);
1310 for (size_t ai = 1; ai < m_count; ++ai) {
1311 util_snprintf(name.get() + namelen, 16, "[%u]", (unsigned int)ai);
1312 m_ir_values[ai] = ir->createGlobal(name.get(), vtype);
1313 if (!m_ir_values[ai]) {
1314 compile_error(m_context, "ir_builder::createGlobal failed `%s`", name.get());
1317 m_ir_values[ai]->m_context = m_context;
1318 m_ir_values[ai]->m_unique_life = true;
1319 m_ir_values[ai]->m_locked = true;
1320 if (m_flags & AST_FLAG_INCLUDE_DEF)
1321 m_ir_values[ai]->m_flags |= IR_FLAG_INCLUDE_DEF;
1327 bool ast_value::generateLocal(ir_function *func, bool param)
1329 if (m_vtype == TYPE_NIL) {
1330 compile_error(m_context, "internal error: trying to generate a variable of TYPE_NIL");
1334 if (m_hasvalue && m_vtype == TYPE_FUNCTION)
1336 /* Do we allow local functions? I think not...
1337 * this is NOT a function pointer atm.
1342 ir_value *v = nullptr;
1343 if (m_vtype == TYPE_ARRAY) {
1344 ast_expression *elemtype = m_next;
1345 qc_type vtype = elemtype->m_vtype;
1347 func->m_flags |= IR_FLAG_HAS_ARRAYS;
1349 if (param && !(m_flags & AST_FLAG_IS_VARARG)) {
1350 compile_error(m_context, "array-parameters are not supported");
1354 /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1355 if (!checkArray(*this))
1358 m_ir_values.resize(m_count);
1359 v = ir_function_create_local(func, m_name, vtype, param);
1361 compile_error(m_context, "internal error: ir_function_create_local failed");
1364 v->m_context = m_context;
1365 v->m_unique_life = true;
1368 const size_t namelen = m_name.length();
1369 std::unique_ptr<char[]> name(new char[namelen+16]);
1370 util_strncpy(name.get(), m_name.c_str(), namelen);
1373 for (size_t ai = 1; ai < m_count; ++ai) {
1374 util_snprintf(name.get() + namelen, 16, "[%u]", (unsigned int)ai);
1375 m_ir_values[ai] = ir_function_create_local(func, name.get(), vtype, param);
1376 if (!m_ir_values[ai]) {
1377 compile_error(m_context, "internal_error: ir_builder::createGlobal failed on `%s`", name.get());
1380 m_ir_values[ai]->m_context = m_context;
1381 m_ir_values[ai]->m_unique_life = true;
1382 m_ir_values[ai]->m_locked = true;
1387 v = ir_function_create_local(func, m_name, m_vtype, param);
1390 codegen_output_type(this, v);
1391 v->m_context = m_context;
1394 // A constant local... hmmm...
1395 // I suppose the IR will have to deal with this
1400 if (!v->setFloat(m_constval.vfloat))
1404 if (!v->setVector(m_constval.vvec))
1408 if (!v->setString(m_constval.vstring))
1412 compile_error(m_context, "TODO: global constant type %i", m_vtype);
1417 // link us to the ir_value
1421 if (!generateAccessors(func->m_owner))
1425 error: /* clean up */
1430 bool ast_value::generateAccessors(ir_builder *ir)
1433 bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1434 if (!m_setter || !m_getter)
1436 if (m_count && m_ir_values.empty()) {
1437 compile_error(m_context, "internal error: no array values generated for `%s`", m_name);
1440 for (i = 0; i < m_count; ++i) {
1441 if (!m_ir_values[i]) {
1442 compile_error(m_context, "internal error: not all array values have been generated for `%s`", m_name);
1445 if (!m_ir_values[i]->m_life.empty()) {
1446 compile_error(m_context, "internal error: function containing `%s` already generated", m_name);
1451 opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1453 if (!m_setter->generateGlobal(ir, false) ||
1454 !m_setter->m_constval.vfunc->generateFunction(ir) ||
1455 !ir_function_finalize(m_setter->m_constval.vfunc->m_ir_func))
1457 compile_error(m_context, "internal error: failed to generate setter for `%s`", m_name);
1458 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1463 if (!m_getter->generateGlobal(ir, false) ||
1464 !m_getter->m_constval.vfunc->generateFunction(ir) ||
1465 !ir_function_finalize(m_getter->m_constval.vfunc->m_ir_func))
1467 compile_error(m_context, "internal error: failed to generate getter for `%s`", m_name);
1468 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1472 for (i = 0; i < m_count; ++i)
1473 m_ir_values[i]->m_life.clear();
1474 opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1478 bool ast_function::generateFunction(ir_builder *ir)
1484 ir_function *irf = m_ir_func;
1486 compile_error(m_context, "internal error: ast_function's related ast_value was not generated yet");
1490 /* fill the parameter list */
1491 for (auto &it : m_function_type->m_type_params) {
1492 if (it->m_vtype == TYPE_FIELD)
1493 vec_push(irf->m_params, it->m_next->m_vtype);
1495 vec_push(irf->m_params, it->m_vtype);
1497 if (!it->generateLocal(m_ir_func, true))
1503 if (!m_varargs->generateLocal(m_ir_func, true))
1505 irf->m_max_varargs = m_varargs->m_count;
1509 irf->m_builtin = m_builtin;
1513 /* have a local return value variable? */
1514 if (m_return_value) {
1515 if (!m_return_value->generateLocal(m_ir_func, false))
1519 if (m_blocks.empty()) {
1520 compile_error(m_context, "function `%s` has no body", m_name);
1524 irf->m_first = m_curblock = ir_function_create_block(m_context, irf, "entry");
1526 compile_error(m_context, "failed to allocate entry block for `%s`", m_name);
1534 if (!m_argc->generateLocal(m_ir_func, true))
1536 if (!m_argc->codegen(this, false, &va_count))
1538 if (!m_fixedparams->codegen(this, false, &fixed))
1540 sub = ir_block_create_binop(m_curblock, m_context,
1541 makeLabel("va_count"), INSTR_SUB_F,
1542 ir->get_va_count(), fixed);
1545 if (!ir_block_create_store_op(m_curblock, m_context, INSTR_STORE_F,
1552 for (auto &it : m_blocks) {
1553 if (!it->codegen(this, false, &dummy))
1557 /* TODO: check return types */
1558 if (!m_curblock->m_final)
1560 if (!m_function_type->m_next ||
1561 m_function_type->m_next->m_vtype == TYPE_VOID)
1563 return ir_block_create_return(m_curblock, m_context, nullptr);
1565 else if (vec_size(m_curblock->m_entries) || m_curblock == irf->m_first)
1567 if (m_return_value) {
1568 if (!m_return_value->codegen(this, false, &dummy))
1570 return ir_block_create_return(m_curblock, m_context, dummy);
1572 else if (compile_warning(m_context, WARN_MISSING_RETURN_VALUES,
1573 "control reaches end of non-void function (`%s`) via %s",
1574 m_name.c_str(), m_curblock->m_label.c_str()))
1578 return ir_block_create_return(m_curblock, m_context, nullptr);
1584 static bool starts_a_label(const ast_expression *ex)
1586 while (ex && ast_istype(ex, ast_block)) {
1587 auto b = reinterpret_cast<const ast_block*>(ex);
1592 return ast_istype(ex, ast_label);
1595 /* Note, you will not see ast_block_codegen generate ir_blocks.
1596 * To the AST and the IR, blocks are 2 different things.
1597 * In the AST it represents a block of code, usually enclosed in
1598 * curly braces {...}.
1599 * While in the IR it represents a block in terms of control-flow.
1601 bool ast_block::codegen(ast_function *func, bool lvalue, ir_value **out)
1603 /* We don't use this
1604 * Note: an ast-representation using the comma-operator
1605 * of the form: (a, b, c) = x should not assign to c...
1608 compile_error(m_context, "not an l-value (code-block)");
1617 /* output is nullptr at first, we'll have each expression
1618 * assign to out output, thus, a comma-operator represention
1619 * using an ast_block will return the last generated value,
1620 * so: (b, c) + a executed both b and c, and returns c,
1621 * which is then added to a.
1625 /* generate locals */
1626 for (auto &it : m_locals) {
1627 if (!it->generateLocal(func->m_ir_func, false)) {
1628 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1629 compile_error(m_context, "failed to generate local `%s`", it->m_name);
1634 for (auto &it : m_exprs) {
1635 if (func->m_curblock->m_final && !starts_a_label(it)) {
1636 if (compile_warning(it->m_context, WARN_UNREACHABLE_CODE, "unreachable statement"))
1640 if (!it->codegen(func, false, out))
1649 bool ast_store::codegen(ast_function *func, bool lvalue, ir_value **out)
1651 ir_value *left = nullptr;
1652 ir_value *right = nullptr;
1655 ast_array_index *ai = nullptr;
1657 if (lvalue && m_outl) {
1662 if (!lvalue && m_outr) {
1667 if (ast_istype(m_dest, ast_array_index))
1670 ai = (ast_array_index*)m_dest;
1671 idx = (ast_value*)ai->m_index;
1673 if (ast_istype(ai->m_index, ast_value) && idx->m_hasvalue && idx->m_cvq == CV_CONST)
1678 /* we need to call the setter */
1679 ir_value *iridx, *funval;
1683 compile_error(m_context, "array-subscript assignment cannot produce lvalues");
1687 auto arr = reinterpret_cast<ast_value*>(ai->m_array);
1688 if (!ast_istype(ai->m_array, ast_value) || !arr->m_setter) {
1689 compile_error(m_context, "value has no setter (%s)", arr->m_name);
1693 if (!idx->codegen(func, false, &iridx))
1696 if (!arr->m_setter->codegen(func, true, &funval))
1699 if (!m_source->codegen(func, false, &right))
1702 call = ir_block_create_call(func->m_curblock, m_context, func->makeLabel("store"), funval, false);
1705 ir_call_param(call, iridx);
1706 ir_call_param(call, right);
1714 if (!m_dest->codegen(func, true, &left))
1719 if (!m_source->codegen(func, false, &right))
1722 if (!ir_block_create_store_op(func->m_curblock, m_context, m_op, left, right))
1727 /* Theoretically, an assinment returns its left side as an
1728 * lvalue, if we don't need an lvalue though, we return
1729 * the right side as an rvalue, otherwise we have to
1730 * somehow know whether or not we need to dereference the pointer
1731 * on the left side - that is: OP_LOAD if it was an address.
1732 * Also: in original QC we cannot OP_LOADP *anyway*.
1734 *out = (lvalue ? left : right);
1739 bool ast_binary::codegen(ast_function *func, bool lvalue, ir_value **out)
1741 ir_value *left, *right;
1743 /* A binary operation cannot yield an l-value */
1745 compile_error(m_context, "not an l-value (binop)");
1754 if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1755 (m_op == INSTR_AND || m_op == INSTR_OR))
1757 /* NOTE: The short-logic path will ignore right_first */
1759 /* short circuit evaluation */
1760 ir_block *other, *merge;
1761 ir_block *from_left, *from_right;
1765 /* prepare end-block */
1766 merge_id = func->m_ir_func->m_blocks.size();
1767 merge = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("sce_merge"));
1769 /* generate the left expression */
1770 if (!m_left->codegen(func, false, &left))
1772 /* remember the block */
1773 from_left = func->m_curblock;
1775 /* create a new block for the right expression */
1776 other = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("sce_other"));
1777 if (m_op == INSTR_AND) {
1778 /* on AND: left==true -> other */
1779 if (!ir_block_create_if(func->m_curblock, m_context, left, other, merge))
1782 /* on OR: left==false -> other */
1783 if (!ir_block_create_if(func->m_curblock, m_context, left, merge, other))
1786 /* use the likely flag */
1787 vec_last(func->m_curblock->m_instr)->m_likely = true;
1789 /* enter the right-expression's block */
1790 func->m_curblock = other;
1792 if (!m_right->codegen(func, false, &right))
1794 /* remember block */
1795 from_right = func->m_curblock;
1797 /* jump to the merge block */
1798 if (!ir_block_create_jump(func->m_curblock, m_context, merge))
1801 algo::shiftback(func->m_ir_func->m_blocks.begin() + merge_id,
1802 func->m_ir_func->m_blocks.end());
1804 //func->m_ir_func->m_blocks[merge_id].release();
1805 //func->m_ir_func->m_blocks.erase(func->m_ir_func->m_blocks.begin() + merge_id);
1806 //func->m_ir_func->m_blocks.emplace_back(merge);
1808 func->m_curblock = merge;
1809 phi = ir_block_create_phi(func->m_curblock, m_context,
1810 func->makeLabel("sce_value"),
1812 ir_phi_add(phi, from_left, left);
1813 ir_phi_add(phi, from_right, right);
1814 *out = ir_phi_value(phi);
1818 if (!OPTS_FLAG(PERL_LOGIC)) {
1820 if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->m_vtype == TYPE_VECTOR) {
1821 *out = ir_block_create_unary(func->m_curblock, m_context,
1822 func->makeLabel("sce_bool_v"),
1826 *out = ir_block_create_unary(func->m_curblock, m_context,
1827 func->makeLabel("sce_bool"),
1832 else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->m_vtype == TYPE_STRING) {
1833 *out = ir_block_create_unary(func->m_curblock, m_context,
1834 func->makeLabel("sce_bool_s"),
1838 *out = ir_block_create_unary(func->m_curblock, m_context,
1839 func->makeLabel("sce_bool"),
1845 *out = ir_block_create_binop(func->m_curblock, m_context,
1846 func->makeLabel("sce_bool"),
1847 INSTR_AND, *out, *out);
1854 codegen_output_type(this, *out);
1858 if (m_right_first) {
1859 if (!m_right->codegen(func, false, &right))
1861 if (!m_left->codegen(func, false, &left))
1864 if (!m_left->codegen(func, false, &left))
1866 if (!m_right->codegen(func, false, &right))
1870 *out = ir_block_create_binop(func->m_curblock, m_context, func->makeLabel("bin"),
1875 codegen_output_type(this, *out);
1880 bool ast_binstore::codegen(ast_function *func, bool lvalue, ir_value **out)
1882 ir_value *leftl = nullptr, *leftr, *right, *bin;
1886 ast_array_index *ai = nullptr;
1887 ir_value *iridx = nullptr;
1889 if (lvalue && m_outl) {
1894 if (!lvalue && m_outr) {
1899 if (ast_istype(m_dest, ast_array_index))
1902 ai = (ast_array_index*)m_dest;
1903 idx = (ast_value*)ai->m_index;
1905 if (ast_istype(ai->m_index, ast_value) && idx->m_hasvalue && idx->m_cvq == CV_CONST)
1909 /* for a binstore we need both an lvalue and an rvalue for the left side */
1910 /* rvalue of destination! */
1912 if (!idx->codegen(func, false, &iridx))
1915 if (!m_dest->codegen(func, false, &leftr))
1918 /* source as rvalue only */
1919 if (!m_source->codegen(func, false, &right))
1922 /* now the binary */
1923 bin = ir_block_create_binop(func->m_curblock, m_context, func->makeLabel("binst"),
1924 m_opbin, leftr, right);
1928 /* we need to call the setter */
1933 compile_error(m_context, "array-subscript assignment cannot produce lvalues");
1937 arr = (ast_value*)ai->m_array;
1938 if (!ast_istype(ai->m_array, ast_value) || !arr->m_setter) {
1939 compile_error(m_context, "value has no setter (%s)", arr->m_name);
1943 if (!arr->m_setter->codegen(func, true, &funval))
1946 call = ir_block_create_call(func->m_curblock, m_context, func->makeLabel("store"), funval, false);
1949 ir_call_param(call, iridx);
1950 ir_call_param(call, bin);
1954 // lvalue of destination
1955 if (!m_dest->codegen(func, true, &leftl))
1959 if (!ir_block_create_store_op(func->m_curblock, m_context, m_opstore, leftl, bin))
1964 /* Theoretically, an assinment returns its left side as an
1965 * lvalue, if we don't need an lvalue though, we return
1966 * the right side as an rvalue, otherwise we have to
1967 * somehow know whether or not we need to dereference the pointer
1968 * on the left side - that is: OP_LOAD if it was an address.
1969 * Also: in original QC we cannot OP_LOADP *anyway*.
1971 *out = (lvalue ? leftl : bin);
1976 bool ast_unary::codegen(ast_function *func, bool lvalue, ir_value **out)
1980 /* An unary operation cannot yield an l-value */
1982 compile_error(m_context, "not an l-value (binop)");
1992 if (!m_operand->codegen(func, false, &operand))
1995 *out = ir_block_create_unary(func->m_curblock, m_context, func->makeLabel("unary"),
2004 bool ast_return::codegen(ast_function *func, bool lvalue, ir_value **out)
2010 /* In the context of a return operation, we don't actually return
2014 compile_error(m_context, "return-expression is not an l-value");
2019 compile_error(m_context, "internal error: ast_return cannot be reused, it bears no result!");
2022 m_outr = (ir_value*)1;
2026 if (!m_operand->codegen(func, false, &operand))
2029 if (!ir_block_create_return(func->m_curblock, m_context, operand))
2032 if (!ir_block_create_return(func->m_curblock, m_context, nullptr))
2039 bool ast_entfield::codegen(ast_function *func, bool lvalue, ir_value **out)
2041 ir_value *ent, *field;
2043 // This function needs to take the 'lvalue' flag into account!
2044 // As lvalue we provide a field-pointer, as rvalue we provide the
2047 if (lvalue && m_outl) {
2052 if (!lvalue && m_outr) {
2057 if (!m_entity->codegen(func, false, &ent))
2060 if (!m_field->codegen(func, false, &field))
2065 *out = ir_block_create_fieldaddress(func->m_curblock, m_context, func->makeLabel("efa"),
2068 *out = ir_block_create_load_from_ent(func->m_curblock, m_context, func->makeLabel("efv"),
2069 ent, field, m_vtype);
2070 /* Done AFTER error checking:
2071 codegen_output_type(this, *out);
2075 compile_error(m_context, "failed to create %s instruction (output type %s)",
2076 (lvalue ? "ADDRESS" : "FIELD"),
2077 type_name[m_vtype]);
2081 codegen_output_type(this, *out);
2088 // Hm that should be it...
2092 bool ast_member::codegen(ast_function *func, bool lvalue, ir_value **out)
2096 /* in QC this is always an lvalue */
2097 if (lvalue && m_rvalue) {
2098 compile_error(m_context, "not an l-value (member access)");
2106 if (!m_owner->codegen(func, false, &vec))
2109 if (vec->m_vtype != TYPE_VECTOR &&
2110 !(vec->m_vtype == TYPE_FIELD && m_owner->m_next->m_vtype == TYPE_VECTOR))
2115 *out = vec->vectorMember(m_field);
2118 return (*out != nullptr);
2121 bool ast_array_index::codegen(ast_function *func, bool lvalue, ir_value **out)
2126 if (!lvalue && m_outr) {
2130 if (lvalue && m_outl) {
2135 if (!ast_istype(m_array, ast_value)) {
2136 compile_error(m_context, "array indexing this way is not supported");
2137 /* note this would actually be pointer indexing because the left side is
2138 * not an actual array but (hopefully) an indexable expression.
2139 * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2140 * support this path will be filled.
2145 arr = reinterpret_cast<ast_value*>(m_array);
2146 idx = reinterpret_cast<ast_value*>(m_index);
2148 if (!ast_istype(m_index, ast_value) || !idx->m_hasvalue || idx->m_cvq != CV_CONST) {
2149 /* Time to use accessor functions */
2150 ir_value *iridx, *funval;
2154 compile_error(m_context, "(.2) array indexing here needs a compile-time constant");
2158 if (!arr->m_getter) {
2159 compile_error(m_context, "value has no getter, don't know how to index it");
2163 if (!m_index->codegen(func, false, &iridx))
2166 if (!arr->m_getter->codegen(func, true, &funval))
2169 call = ir_block_create_call(func->m_curblock, m_context, func->makeLabel("fetch"), funval, false);
2172 ir_call_param(call, iridx);
2174 *out = ir_call_value(call);
2176 (*out)->m_vtype = m_vtype;
2177 codegen_output_type(this, *out);
2181 if (idx->m_vtype == TYPE_FLOAT) {
2182 unsigned int arridx = idx->m_constval.vfloat;
2183 if (arridx >= m_array->m_count)
2185 compile_error(m_context, "array index out of bounds: %i", arridx);
2188 *out = arr->m_ir_values[arridx];
2190 else if (idx->m_vtype == TYPE_INTEGER) {
2191 unsigned int arridx = idx->m_constval.vint;
2192 if (arridx >= m_array->m_count)
2194 compile_error(m_context, "array index out of bounds: %i", arridx);
2197 *out = arr->m_ir_values[arridx];
2200 compile_error(m_context, "array indexing here needs an integer constant");
2203 (*out)->m_vtype = m_vtype;
2204 codegen_output_type(this, *out);
2208 bool ast_argpipe::codegen(ast_function *func, bool lvalue, ir_value **out)
2212 compile_error(m_context, "argpipe node: not an lvalue");
2217 compile_error(m_context, "TODO: argpipe codegen not implemented");
2221 bool ast_ifthen::codegen(ast_function *func, bool lvalue, ir_value **out)
2229 ir_block *ontrue_endblock = nullptr;
2230 ir_block *onfalse_endblock = nullptr;
2231 ir_block *merge = nullptr;
2234 /* We don't output any value, thus also don't care about r/lvalue */
2239 compile_error(m_context, "internal error: ast_ifthen cannot be reused, it bears no result!");
2242 m_outr = (ir_value*)1;
2244 /* generate the condition */
2245 if (!m_cond->codegen(func, false, &condval))
2247 /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2248 cond = func->m_curblock;
2250 /* try constant folding away the condition */
2251 if ((folded = fold::cond_ifthen(condval, func, this)) != -1)
2255 /* create on-true block */
2256 ontrue = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("ontrue"));
2260 /* enter the block */
2261 func->m_curblock = ontrue;
2264 if (!m_on_true->codegen(func, false, &dummy))
2267 /* we now need to work from the current endpoint */
2268 ontrue_endblock = func->m_curblock;
2274 /* create on-false block */
2275 onfalse = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("onfalse"));
2279 /* enter the block */
2280 func->m_curblock = onfalse;
2283 if (!m_on_false->codegen(func, false, &dummy))
2286 /* we now need to work from the current endpoint */
2287 onfalse_endblock = func->m_curblock;
2291 /* Merge block were they all merge in to */
2292 if (!ontrue || !onfalse || !ontrue_endblock->m_final || !onfalse_endblock->m_final)
2294 merge = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("endif"));
2297 /* add jumps ot the merge block */
2298 if (ontrue && !ontrue_endblock->m_final && !ir_block_create_jump(ontrue_endblock, m_context, merge))
2300 if (onfalse && !onfalse_endblock->m_final && !ir_block_create_jump(onfalse_endblock, m_context, merge))
2303 /* Now enter the merge block */
2304 func->m_curblock = merge;
2307 /* we create the if here, that way all blocks are ordered :)
2309 if (!ir_block_create_if(cond, m_context, condval,
2310 (ontrue ? ontrue : merge),
2311 (onfalse ? onfalse : merge)))
2319 bool ast_ternary::codegen(ast_function *func, bool lvalue, ir_value **out)
2322 ir_value *trueval, *falseval;
2325 ir_block *cond = func->m_curblock;
2326 ir_block *cond_out = nullptr;
2327 ir_block *ontrue, *ontrue_out = nullptr;
2328 ir_block *onfalse, *onfalse_out = nullptr;
2332 /* Ternary can never create an lvalue... */
2336 /* In theory it shouldn't be possible to pass through a node twice, but
2337 * in case we add any kind of optimization pass for the AST itself, it
2338 * may still happen, thus we remember a created ir_value and simply return one
2339 * if it already exists.
2346 /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2348 /* generate the condition */
2349 func->m_curblock = cond;
2350 if (!m_cond->codegen(func, false, &condval))
2352 cond_out = func->m_curblock;
2354 /* try constant folding away the condition */
2355 if ((folded = fold::cond_ternary(condval, func, this)) != -1)
2358 /* create on-true block */
2359 ontrue = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("tern_T"));
2364 /* enter the block */
2365 func->m_curblock = ontrue;
2368 if (!m_on_true->codegen(func, false, &trueval))
2371 ontrue_out = func->m_curblock;
2374 /* create on-false block */
2375 onfalse = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("tern_F"));
2380 /* enter the block */
2381 func->m_curblock = onfalse;
2384 if (!m_on_false->codegen(func, false, &falseval))
2387 onfalse_out = func->m_curblock;
2390 /* create merge block */
2391 merge = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("tern_out"));
2394 /* jump to merge block */
2395 if (!ir_block_create_jump(ontrue_out, m_context, merge))
2397 if (!ir_block_create_jump(onfalse_out, m_context, merge))
2400 /* create if instruction */
2401 if (!ir_block_create_if(cond_out, m_context, condval, ontrue, onfalse))
2404 /* Now enter the merge block */
2405 func->m_curblock = merge;
2407 /* Here, now, we need a PHI node
2408 * but first some sanity checking...
2410 if (trueval->m_vtype != falseval->m_vtype && trueval->m_vtype != TYPE_NIL && falseval->m_vtype != TYPE_NIL) {
2411 /* error("ternary with different types on the two sides"); */
2412 compile_error(m_context, "internal error: ternary operand types invalid");
2417 phi = ir_block_create_phi(merge, m_context, func->makeLabel("phi"), m_vtype);
2419 compile_error(m_context, "internal error: failed to generate phi node");
2422 ir_phi_add(phi, ontrue_out, trueval);
2423 ir_phi_add(phi, onfalse_out, falseval);
2425 m_outr = ir_phi_value(phi);
2428 codegen_output_type(this, *out);
2433 bool ast_loop::codegen(ast_function *func, bool lvalue, ir_value **out)
2435 ir_value *dummy = nullptr;
2436 ir_value *precond = nullptr;
2437 ir_value *postcond = nullptr;
2439 /* Since we insert some jumps "late" so we have blocks
2440 * ordered "nicely", we need to keep track of the actual end-blocks
2441 * of expressions to add the jumps to.
2443 ir_block *bbody = nullptr, *end_bbody = nullptr;
2444 ir_block *bprecond = nullptr, *end_bprecond = nullptr;
2445 ir_block *bpostcond = nullptr, *end_bpostcond = nullptr;
2446 ir_block *bincrement = nullptr, *end_bincrement = nullptr;
2447 ir_block *bout = nullptr, *bin = nullptr;
2449 /* let's at least move the outgoing block to the end */
2452 /* 'break' and 'continue' need to be able to find the right blocks */
2453 ir_block *bcontinue = nullptr;
2454 ir_block *bbreak = nullptr;
2456 ir_block *tmpblock = nullptr;
2462 compile_error(m_context, "internal error: ast_loop cannot be reused, it bears no result!");
2465 m_outr = (ir_value*)1;
2468 * Should we ever need some kind of block ordering, better make this function
2469 * move blocks around than write a block ordering algorithm later... after all
2470 * the ast and ir should work together, not against each other.
2473 /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2474 * anyway if for example it contains a ternary.
2478 if (!m_initexpr->codegen(func, false, &dummy))
2482 /* Store the block from which we enter this chaos */
2483 bin = func->m_curblock;
2485 /* The pre-loop condition needs its own block since we
2486 * need to be able to jump to the start of that expression.
2490 bprecond = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("pre_loop_cond"));
2494 /* the pre-loop-condition the least important place to 'continue' at */
2495 bcontinue = bprecond;
2498 func->m_curblock = bprecond;
2501 if (!m_precond->codegen(func, false, &precond))
2504 end_bprecond = func->m_curblock;
2506 bprecond = end_bprecond = nullptr;
2509 /* Now the next blocks won't be ordered nicely, but we need to
2510 * generate them this early for 'break' and 'continue'.
2513 bincrement = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("loop_increment"));
2516 bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2518 bincrement = end_bincrement = nullptr;
2522 bpostcond = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("post_loop_cond"));
2525 bcontinue = bpostcond; /* postcond comes before the increment */
2527 bpostcond = end_bpostcond = nullptr;
2530 bout_id = func->m_ir_func->m_blocks.size();
2531 bout = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("after_loop"));
2536 /* The loop body... */
2539 bbody = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("loop_body"));
2544 func->m_curblock = bbody;
2546 func->m_breakblocks.push_back(bbreak);
2548 func->m_continueblocks.push_back(bcontinue);
2550 func->m_continueblocks.push_back(bbody);
2554 if (!m_body->codegen(func, false, &dummy))
2558 end_bbody = func->m_curblock;
2559 func->m_breakblocks.pop_back();
2560 func->m_continueblocks.pop_back();
2563 /* post-loop-condition */
2567 func->m_curblock = bpostcond;
2570 if (!m_postcond->codegen(func, false, &postcond))
2573 end_bpostcond = func->m_curblock;
2576 /* The incrementor */
2580 func->m_curblock = bincrement;
2583 if (!m_increment->codegen(func, false, &dummy))
2586 end_bincrement = func->m_curblock;
2589 /* In any case now, we continue from the outgoing block */
2590 func->m_curblock = bout;
2592 /* Now all blocks are in place */
2593 /* From 'bin' we jump to whatever comes first */
2594 if (bprecond) tmpblock = bprecond;
2595 else tmpblock = bbody; /* can never be null */
2598 else if (bpostcond) tmpblock = bpostcond;
2599 else tmpblock = bout;
2602 if (!ir_block_create_jump(bin, m_context, tmpblock))
2608 ir_block *ontrue, *onfalse;
2609 ontrue = bbody; /* can never be null */
2611 /* all of this is dead code
2612 else if (bincrement) ontrue = bincrement;
2613 else ontrue = bpostcond;
2622 if (!ir_block_create_if(end_bprecond, m_context, precond, ontrue, onfalse))
2629 if (bincrement) tmpblock = bincrement;
2630 else if (bpostcond) tmpblock = bpostcond;
2631 else if (bprecond) tmpblock = bprecond;
2632 else tmpblock = bbody;
2633 if (!end_bbody->m_final && !ir_block_create_jump(end_bbody, m_context, tmpblock))
2637 /* from increment */
2640 if (bpostcond) tmpblock = bpostcond;
2641 else if (bprecond) tmpblock = bprecond;
2642 else if (bbody) tmpblock = bbody;
2643 else tmpblock = bout;
2644 if (!ir_block_create_jump(end_bincrement, m_context, tmpblock))
2651 ir_block *ontrue, *onfalse;
2652 if (bprecond) ontrue = bprecond;
2653 else ontrue = bbody; /* can never be null */
2655 /* all of this is dead code
2656 else if (bincrement) ontrue = bincrement;
2657 else ontrue = bpostcond;
2666 if (!ir_block_create_if(end_bpostcond, m_context, postcond, ontrue, onfalse))
2670 /* Move 'bout' to the end */
2671 algo::shiftback(func->m_ir_func->m_blocks.begin() + bout_id,
2672 func->m_ir_func->m_blocks.end());
2674 //func->m_ir_func->m_blocks[bout_id].release(); // it's a vector<std::unique_ptr<>>
2675 //func->m_ir_func->m_blocks.erase(func->m_ir_func->m_blocks.begin() + bout_id);
2676 //func->m_ir_func->m_blocks.emplace_back(bout);
2681 bool ast_breakcont::codegen(ast_function *func, bool lvalue, ir_value **out)
2688 compile_error(m_context, "break/continue expression is not an l-value");
2693 compile_error(m_context, "internal error: ast_breakcont cannot be reused!");
2696 m_outr = (ir_value*)1;
2699 target = func->m_continueblocks[func->m_continueblocks.size()-1-m_levels];
2701 target = func->m_breakblocks[func->m_breakblocks.size()-1-m_levels];
2704 compile_error(m_context, "%s is lacking a target block", (m_is_continue ? "continue" : "break"));
2708 if (!ir_block_create_jump(func->m_curblock, m_context, target))
2713 bool ast_switch::codegen(ast_function *func, bool lvalue, ir_value **out)
2715 ast_switch_case *def_case = nullptr;
2716 ir_block *def_bfall = nullptr;
2717 ir_block *def_bfall_to = nullptr;
2718 bool set_def_bfall_to = false;
2720 ir_value *dummy = nullptr;
2721 ir_value *irop = nullptr;
2722 ir_block *bout = nullptr;
2723 ir_block *bfall = nullptr;
2730 compile_error(m_context, "switch expression is not an l-value");
2735 compile_error(m_context, "internal error: ast_switch cannot be reused!");
2738 m_outr = (ir_value*)1;
2743 if (!m_operand->codegen(func, false, &irop))
2746 if (m_cases.empty())
2749 cmpinstr = type_eq_instr[irop->m_vtype];
2750 if (cmpinstr >= VINSTR_END) {
2751 ast_type_to_string(m_operand, typestr, sizeof(typestr));
2752 compile_error(m_context, "invalid type to perform a switch on: %s", typestr);
2756 bout_id = func->m_ir_func->m_blocks.size();
2757 bout = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("after_switch"));
2761 /* setup the break block */
2762 func->m_breakblocks.push_back(bout);
2764 /* Now create all cases */
2765 for (auto &it : m_cases) {
2766 ir_value *cond, *val;
2767 ir_block *bcase, *bnot;
2770 ast_switch_case *swcase = ⁢
2772 if (swcase->m_value) {
2773 /* A regular case */
2774 /* generate the condition operand */
2775 if (!swcase->m_value->codegen(func, false, &val))
2777 /* generate the condition */
2778 cond = ir_block_create_binop(func->m_curblock, m_context, func->makeLabel("switch_eq"), cmpinstr, irop, val);
2782 bcase = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("case"));
2783 bnot_id = func->m_ir_func->m_blocks.size();
2784 bnot = ir_function_create_block(m_context, func->m_ir_func, func->makeLabel("not_case"));
2785 if (!bcase || !bnot)
2787 if (set_def_bfall_to) {
2788 set_def_bfall_to = false;
2789 def_bfall_to = bcase;
2791 if (!ir_block_create_if(func->m_curblock, m_context, cond, bcase, bnot))
2794 /* Make the previous case-end fall through */
2795 if (bfall && !bfall->m_final) {
2796 if (!ir_block_create_jump(bfall, m_context, bcase))
2800 /* enter the case */
2801 func->m_curblock = bcase;
2802 if (!swcase->m_code->codegen(func, false, &dummy))
2805 /* remember this block to fall through from */
2806 bfall = func->m_curblock;
2808 /* enter the else and move it down */
2809 func->m_curblock = bnot;
2810 algo::shiftback(func->m_ir_func->m_blocks.begin() + bnot_id,
2811 func->m_ir_func->m_blocks.end());
2813 //func->m_ir_func->m_blocks[bnot_id].release();
2814 //func->m_ir_func->m_blocks.erase(func->m_ir_func->m_blocks.begin() + bnot_id);
2815 //func->m_ir_func->m_blocks.emplace_back(bnot);
2817 /* The default case */
2818 /* Remember where to fall through from: */
2821 /* remember which case it was */
2823 /* And the next case will be remembered */
2824 set_def_bfall_to = true;
2828 /* Jump from the last bnot to bout */
2829 if (bfall && !bfall->m_final && !ir_block_create_jump(bfall, m_context, bout)) {
2831 astwarning(bfall->m_context, WARN_???, "missing break after last case");
2836 /* If there was a default case, put it down here */
2840 /* No need to create an extra block */
2841 bcase = func->m_curblock;
2843 /* Insert the fallthrough jump */
2844 if (def_bfall && !def_bfall->m_final) {
2845 if (!ir_block_create_jump(def_bfall, m_context, bcase))
2849 /* Now generate the default code */
2850 if (!def_case->m_code->codegen(func, false, &dummy))
2853 /* see if we need to fall through */
2854 if (def_bfall_to && !func->m_curblock->m_final)
2856 if (!ir_block_create_jump(func->m_curblock, m_context, def_bfall_to))
2861 /* Jump from the last bnot to bout */
2862 if (!func->m_curblock->m_final && !ir_block_create_jump(func->m_curblock, m_context, bout))
2864 /* enter the outgoing block */
2865 func->m_curblock = bout;
2867 /* restore the break block */
2868 func->m_breakblocks.pop_back();
2870 /* Move 'bout' to the end, it's nicer */
2871 algo::shiftback(func->m_ir_func->m_blocks.begin() + bout_id,
2872 func->m_ir_func->m_blocks.end());
2874 //func->m_ir_func->m_blocks[bout_id].release();
2875 //func->m_ir_func->m_blocks.erase(func->m_ir_func->m_blocks.begin() + bout_id);
2876 //func->m_ir_func->m_blocks.emplace_back(bout);
2881 bool ast_label::codegen(ast_function *func, bool lvalue, ir_value **out)
2886 compile_error(m_context, "internal error: ast_label never defined");
2892 compile_error(m_context, "internal error: ast_label cannot be an lvalue");
2896 /* simply create a new block and jump to it */
2897 m_irblock = ir_function_create_block(m_context, func->m_ir_func, m_name.c_str());
2899 compile_error(m_context, "failed to allocate label block `%s`", m_name);
2902 if (!func->m_curblock->m_final) {
2903 if (!ir_block_create_jump(func->m_curblock, m_context, m_irblock))
2907 /* enter the new block */
2908 func->m_curblock = m_irblock;
2910 /* Generate all the leftover gotos */
2911 for (auto &it : m_gotos) {
2912 if (!it->codegen(func, false, &dummy))
2919 bool ast_goto::codegen(ast_function *func, bool lvalue, ir_value **out)
2923 compile_error(m_context, "internal error: ast_goto cannot be an lvalue");
2927 if (m_target->m_irblock) {
2928 if (m_irblock_from) {
2929 /* we already tried once, this is the callback */
2930 m_irblock_from->m_final = false;
2931 if (!ir_block_create_goto(m_irblock_from, m_context, m_target->m_irblock)) {
2932 compile_error(m_context, "failed to generate goto to `%s`", m_name);
2938 if (!ir_block_create_goto(func->m_curblock, m_context, m_target->m_irblock)) {
2939 compile_error(m_context, "failed to generate goto to `%s`", m_name);
2946 /* the target has not yet been created...
2947 * close this block in a sneaky way:
2949 func->m_curblock->m_final = true;
2950 m_irblock_from = func->m_curblock;
2951 m_target->registerGoto(this);
2957 bool ast_state::codegen(ast_function *func, bool lvalue, ir_value **out)
2959 ir_value *frameval, *thinkval;
2962 compile_error(m_context, "not an l-value (state operation)");
2966 compile_error(m_context, "internal error: ast_state cannot be reused!");
2971 if (!m_framenum->codegen(func, false, &frameval))
2976 if (!m_nextthink->codegen(func, false, &thinkval))
2981 if (!ir_block_create_state_op(func->m_curblock, m_context, frameval, thinkval)) {
2982 compile_error(m_context, "failed to create STATE instruction");
2986 m_outr = (ir_value*)1;
2990 bool ast_call::codegen(ast_function *func, bool lvalue, ir_value **out)
2992 std::vector<ir_value*> params;
2993 ir_instr *callinstr;
2995 ir_value *funval = nullptr;
2997 /* return values are never lvalues */
2999 compile_error(m_context, "not an l-value (function call)");
3008 if (!m_func->codegen(func, false, &funval))
3014 for (auto &it : m_params) {
3016 if (!it->codegen(func, false, ¶m))
3020 params.push_back(param);
3023 /* varargs counter */
3026 ir_builder *builder = func->m_curblock->m_owner->m_owner;
3027 if (!m_va_count->codegen(func, false, &va_count))
3029 if (!ir_block_create_store_op(func->m_curblock, m_context, INSTR_STORE_F,
3030 builder->get_va_count(), va_count))
3036 callinstr = ir_block_create_call(func->m_curblock, m_context,
3037 func->makeLabel("call"),
3038 funval, !!(m_func->m_flags & AST_FLAG_NORETURN));
3042 for (auto &it : params)
3043 ir_call_param(callinstr, it);
3045 *out = ir_call_value(callinstr);
3048 codegen_output_type(this, *out);