2 * Copyright (C) 2012, 2013
6 * Permission is hereby granted, free of charge, to any person obtaining a copy of
7 * this software and associated documentation files (the "Software"), to deal in
8 * the Software without restriction, including without limitation the rights to
9 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
10 * of the Software, and to permit persons to whom the Software is furnished to do
11 * so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30 /***********************************************************************
31 * Type sizes used at multiple points in the IR codegen
34 const char *type_name[TYPE_COUNT] = {
53 static size_t type_sizeof_[TYPE_COUNT] = {
60 1, /* TYPE_FUNCTION */
71 const uint16_t type_store_instr[TYPE_COUNT] = {
72 INSTR_STORE_F, /* should use I when having integer support */
79 INSTR_STORE_ENT, /* should use I */
81 INSTR_STORE_I, /* integer type */
86 INSTR_STORE_V, /* variant, should never be accessed */
88 VINSTR_END, /* struct */
89 VINSTR_END, /* union */
90 VINSTR_END, /* array */
92 VINSTR_END, /* noexpr */
95 const uint16_t field_store_instr[TYPE_COUNT] = {
105 INSTR_STORE_FLD, /* integer type */
110 INSTR_STORE_V, /* variant, should never be accessed */
112 VINSTR_END, /* struct */
113 VINSTR_END, /* union */
114 VINSTR_END, /* array */
115 VINSTR_END, /* nil */
116 VINSTR_END, /* noexpr */
119 const uint16_t type_storep_instr[TYPE_COUNT] = {
120 INSTR_STOREP_F, /* should use I when having integer support */
127 INSTR_STOREP_ENT, /* should use I */
129 INSTR_STOREP_ENT, /* integer type */
134 INSTR_STOREP_V, /* variant, should never be accessed */
136 VINSTR_END, /* struct */
137 VINSTR_END, /* union */
138 VINSTR_END, /* array */
139 VINSTR_END, /* nil */
140 VINSTR_END, /* noexpr */
143 const uint16_t type_eq_instr[TYPE_COUNT] = {
144 INSTR_EQ_F, /* should use I when having integer support */
149 INSTR_EQ_E, /* FLD has no comparison */
151 INSTR_EQ_E, /* should use I */
158 INSTR_EQ_V, /* variant, should never be accessed */
160 VINSTR_END, /* struct */
161 VINSTR_END, /* union */
162 VINSTR_END, /* array */
163 VINSTR_END, /* nil */
164 VINSTR_END, /* noexpr */
167 const uint16_t type_ne_instr[TYPE_COUNT] = {
168 INSTR_NE_F, /* should use I when having integer support */
173 INSTR_NE_E, /* FLD has no comparison */
175 INSTR_NE_E, /* should use I */
182 INSTR_NE_V, /* variant, should never be accessed */
184 VINSTR_END, /* struct */
185 VINSTR_END, /* union */
186 VINSTR_END, /* array */
187 VINSTR_END, /* nil */
188 VINSTR_END, /* noexpr */
191 const uint16_t type_not_instr[TYPE_COUNT] = {
192 INSTR_NOT_F, /* should use I when having integer support */
193 VINSTR_END, /* not to be used, depends on string related -f flags */
199 INSTR_NOT_ENT, /* should use I */
201 INSTR_NOT_I, /* integer type */
206 INSTR_NOT_V, /* variant, should never be accessed */
208 VINSTR_END, /* struct */
209 VINSTR_END, /* union */
210 VINSTR_END, /* array */
211 VINSTR_END, /* nil */
212 VINSTR_END, /* noexpr */
216 static ir_value* ir_value_var(const char *name, int st, int vtype);
217 static bool ir_value_set_name(ir_value*, const char *name);
218 static void ir_value_dump(ir_value*, int (*oprintf)(const char*,...));
220 static ir_value* ir_gen_extparam_proto(ir_builder *ir);
221 static void ir_gen_extparam (ir_builder *ir);
223 static bool ir_builder_set_name(ir_builder *self, const char *name);
225 static ir_function* ir_function_new(struct ir_builder_s *owner, int returntype);
226 static bool ir_function_set_name(ir_function*, const char *name);
227 static void ir_function_delete(ir_function*);
228 static void ir_function_dump(ir_function*, char *ind, int (*oprintf)(const char*,...));
230 static ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx_t, const char *label,
231 int op, ir_value *a, ir_value *b, int outype);
232 static void ir_block_delete(ir_block*);
233 static ir_block* ir_block_new(struct ir_function_s *owner, const char *label);
234 static bool GMQCC_WARN ir_block_create_store(ir_block*, lex_ctx_t, ir_value *target, ir_value *what);
235 static bool ir_block_set_label(ir_block*, const char *label);
236 static void ir_block_dump(ir_block*, char *ind, int (*oprintf)(const char*,...));
238 static bool ir_instr_op(ir_instr*, int op, ir_value *value, bool writing);
239 static void ir_instr_delete(ir_instr*);
240 static void ir_instr_dump(ir_instr* in, char *ind, int (*oprintf)(const char*,...));
241 /* error functions */
243 static void irerror(lex_ctx_t ctx, const char *msg, ...)
247 con_cvprintmsg(ctx, LVL_ERROR, "internal error", msg, ap);
251 static bool irwarning(lex_ctx_t ctx, int warntype, const char *fmt, ...)
256 r = vcompile_warning(ctx, warntype, fmt, ap);
261 /***********************************************************************
262 * Vector utility functions
265 static bool GMQCC_WARN vec_ir_value_find(ir_value **vec, const ir_value *what, size_t *idx)
268 size_t len = vec_size(vec);
269 for (i = 0; i < len; ++i) {
270 if (vec[i] == what) {
278 static bool GMQCC_WARN vec_ir_block_find(ir_block **vec, ir_block *what, size_t *idx)
281 size_t len = vec_size(vec);
282 for (i = 0; i < len; ++i) {
283 if (vec[i] == what) {
291 static bool GMQCC_WARN vec_ir_instr_find(ir_instr **vec, ir_instr *what, size_t *idx)
294 size_t len = vec_size(vec);
295 for (i = 0; i < len; ++i) {
296 if (vec[i] == what) {
304 /***********************************************************************
308 static void ir_block_delete_quick(ir_block* self);
309 static void ir_instr_delete_quick(ir_instr *self);
310 static void ir_function_delete_quick(ir_function *self);
312 ir_builder* ir_builder_new(const char *modulename)
317 self = (ir_builder*)mem_a(sizeof(*self));
321 self->functions = NULL;
322 self->globals = NULL;
324 self->filenames = NULL;
325 self->filestrings = NULL;
326 self->htglobals = util_htnew(IR_HT_SIZE);
327 self->htfields = util_htnew(IR_HT_SIZE);
328 self->htfunctions = util_htnew(IR_HT_SIZE);
330 self->extparams = NULL;
331 self->extparam_protos = NULL;
333 self->first_common_globaltemp = 0;
334 self->max_globaltemps = 0;
335 self->first_common_local = 0;
336 self->max_locals = 0;
338 self->str_immediate = 0;
340 if (!ir_builder_set_name(self, modulename)) {
345 self->nil = ir_value_var("nil", store_value, TYPE_NIL);
346 self->nil->cvq = CV_CONST;
348 for (i = 0; i != IR_MAX_VINSTR_TEMPS; ++i) {
349 /* we write to them, but they're not supposed to be used outside the IR, so
350 * let's not allow the generation of ir_instrs which use these.
351 * So it's a constant noexpr.
353 self->vinstr_temp[i] = ir_value_var("vinstr_temp", store_value, TYPE_NOEXPR);
354 self->vinstr_temp[i]->cvq = CV_CONST;
357 self->reserved_va_count = NULL;
358 self->code = code_init();
363 void ir_builder_delete(ir_builder* self)
366 util_htdel(self->htglobals);
367 util_htdel(self->htfields);
368 util_htdel(self->htfunctions);
369 mem_d((void*)self->name);
370 for (i = 0; i != vec_size(self->functions); ++i) {
371 ir_function_delete_quick(self->functions[i]);
373 vec_free(self->functions);
374 for (i = 0; i != vec_size(self->extparams); ++i) {
375 ir_value_delete(self->extparams[i]);
377 vec_free(self->extparams);
378 vec_free(self->extparam_protos);
379 for (i = 0; i != vec_size(self->globals); ++i) {
380 ir_value_delete(self->globals[i]);
382 vec_free(self->globals);
383 for (i = 0; i != vec_size(self->fields); ++i) {
384 ir_value_delete(self->fields[i]);
386 ir_value_delete(self->nil);
387 for (i = 0; i != IR_MAX_VINSTR_TEMPS; ++i) {
388 ir_value_delete(self->vinstr_temp[i]);
390 vec_free(self->fields);
391 vec_free(self->filenames);
392 vec_free(self->filestrings);
394 code_cleanup(self->code);
398 bool ir_builder_set_name(ir_builder *self, const char *name)
401 mem_d((void*)self->name);
402 self->name = util_strdup(name);
406 static ir_function* ir_builder_get_function(ir_builder *self, const char *name)
408 return (ir_function*)util_htget(self->htfunctions, name);
411 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
413 ir_function *fn = ir_builder_get_function(self, name);
418 fn = ir_function_new(self, outtype);
419 if (!ir_function_set_name(fn, name))
421 ir_function_delete(fn);
424 vec_push(self->functions, fn);
425 util_htset(self->htfunctions, name, fn);
427 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
429 ir_function_delete(fn);
433 fn->value->hasvalue = true;
434 fn->value->outtype = outtype;
435 fn->value->constval.vfunc = fn;
436 fn->value->context = fn->context;
441 static ir_value* ir_builder_get_global(ir_builder *self, const char *name)
443 return (ir_value*)util_htget(self->htglobals, name);
446 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
452 ve = ir_builder_get_global(self, name);
458 ve = ir_value_var(name, store_global, vtype);
459 vec_push(self->globals, ve);
460 util_htset(self->htglobals, name, ve);
464 ir_value* ir_builder_get_va_count(ir_builder *self)
466 if (self->reserved_va_count)
467 return self->reserved_va_count;
468 return (self->reserved_va_count = ir_builder_create_global(self, "reserved:va_count", TYPE_FLOAT));
471 static ir_value* ir_builder_get_field(ir_builder *self, const char *name)
473 return (ir_value*)util_htget(self->htfields, name);
477 ir_value* ir_builder_create_field(ir_builder *self, const char *name, int vtype)
479 ir_value *ve = ir_builder_get_field(self, name);
484 ve = ir_value_var(name, store_global, TYPE_FIELD);
485 ve->fieldtype = vtype;
486 vec_push(self->fields, ve);
487 util_htset(self->htfields, name, ve);
491 /***********************************************************************
495 static bool ir_function_naive_phi(ir_function*);
496 static void ir_function_enumerate(ir_function*);
497 static bool ir_function_calculate_liferanges(ir_function*);
498 static bool ir_function_allocate_locals(ir_function*);
500 ir_function* ir_function_new(ir_builder* owner, int outtype)
503 self = (ir_function*)mem_a(sizeof(*self));
508 memset(self, 0, sizeof(*self));
511 if (!ir_function_set_name(self, "<@unnamed>")) {
518 self->context.file = "<@no context>";
519 self->context.line = 0;
520 self->outtype = outtype;
529 self->max_varargs = 0;
531 self->code_function_def = -1;
532 self->allocated_locals = 0;
533 self->globaltemps = 0;
539 bool ir_function_set_name(ir_function *self, const char *name)
542 mem_d((void*)self->name);
543 self->name = util_strdup(name);
547 static void ir_function_delete_quick(ir_function *self)
550 mem_d((void*)self->name);
552 for (i = 0; i != vec_size(self->blocks); ++i)
553 ir_block_delete_quick(self->blocks[i]);
554 vec_free(self->blocks);
556 vec_free(self->params);
558 for (i = 0; i != vec_size(self->values); ++i)
559 ir_value_delete(self->values[i]);
560 vec_free(self->values);
562 for (i = 0; i != vec_size(self->locals); ++i)
563 ir_value_delete(self->locals[i]);
564 vec_free(self->locals);
566 /* self->value is deleted by the builder */
571 void ir_function_delete(ir_function *self)
574 mem_d((void*)self->name);
576 for (i = 0; i != vec_size(self->blocks); ++i)
577 ir_block_delete(self->blocks[i]);
578 vec_free(self->blocks);
580 vec_free(self->params);
582 for (i = 0; i != vec_size(self->values); ++i)
583 ir_value_delete(self->values[i]);
584 vec_free(self->values);
586 for (i = 0; i != vec_size(self->locals); ++i)
587 ir_value_delete(self->locals[i]);
588 vec_free(self->locals);
590 /* self->value is deleted by the builder */
595 static void ir_function_collect_value(ir_function *self, ir_value *v)
597 vec_push(self->values, v);
600 ir_block* ir_function_create_block(lex_ctx_t ctx, ir_function *self, const char *label)
602 ir_block* bn = ir_block_new(self, label);
604 vec_push(self->blocks, bn);
608 static bool instr_is_operation(uint16_t op)
610 return ( (op >= INSTR_MUL_F && op <= INSTR_GT) ||
611 (op >= INSTR_LOAD_F && op <= INSTR_LOAD_FNC) ||
612 (op == INSTR_ADDRESS) ||
613 (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) ||
614 (op >= INSTR_AND && op <= INSTR_BITOR) ||
615 (op >= INSTR_CALL0 && op <= INSTR_CALL8) ||
616 (op >= VINSTR_BITAND_V && op <= VINSTR_BITXOR_VF) );
619 static bool ir_function_pass_peephole(ir_function *self)
623 for (b = 0; b < vec_size(self->blocks); ++b) {
625 ir_block *block = self->blocks[b];
627 for (i = 0; i < vec_size(block->instr); ++i) {
629 inst = block->instr[i];
632 (inst->opcode >= INSTR_STORE_F &&
633 inst->opcode <= INSTR_STORE_FNC))
641 oper = block->instr[i-1];
642 if (!instr_is_operation(oper->opcode))
645 /* Old engine's mul for vector+float cannot deal with aliased inputs. */
646 if (OPTS_FLAG(LEGACY_VECTOR_MATHS)) {
647 if (oper->opcode == INSTR_MUL_VF && oper->_ops[2]->memberof == oper->_ops[1])
649 if (oper->opcode == INSTR_MUL_FV && oper->_ops[1]->memberof == oper->_ops[2])
653 /* Emulated bitxor cannot deal with aliased inputs. */
654 if (oper->opcode == VINSTR_BITXOR && oper->_ops[2]->memberof == oper->_ops[1])
657 /* Emulated bitand/bitor for vector+float cannot deal with aliased inputs. */
658 if (oper->opcode == VINSTR_BITAND_VF && oper->_ops[2]->memberof == oper->_ops[1])
660 if (oper->opcode == VINSTR_BITOR_VF && oper->_ops[2]->memberof == oper->_ops[1])
662 if (oper->opcode == VINSTR_BITXOR_VF && oper->_ops[2]->memberof == oper->_ops[1])
665 value = oper->_ops[0];
667 /* only do it for SSA values */
668 if (value->store != store_value)
671 /* don't optimize out the temp if it's used later again */
672 if (vec_size(value->reads) != 1)
675 /* The very next store must use this value */
676 if (value->reads[0] != store)
679 /* And of course the store must _read_ from it, so it's in
681 if (store->_ops[1] != value)
684 ++opts_optimizationcount[OPTIM_PEEPHOLE];
685 (void)!ir_instr_op(oper, 0, store->_ops[0], true);
687 vec_remove(block->instr, i, 1);
688 ir_instr_delete(store);
690 else if (inst->opcode == VINSTR_COND)
692 /* COND on a value resulting from a NOT could
693 * remove the NOT and swap its operands
700 value = inst->_ops[0];
702 if (value->store != store_value ||
703 vec_size(value->reads) != 1 ||
704 value->reads[0] != inst)
709 inot = value->writes[0];
710 if (inot->_ops[0] != value ||
711 inot->opcode < INSTR_NOT_F ||
712 inot->opcode > INSTR_NOT_FNC ||
713 inot->opcode == INSTR_NOT_V || /* can't do these */
714 inot->opcode == INSTR_NOT_S)
720 ++opts_optimizationcount[OPTIM_PEEPHOLE];
722 (void)!ir_instr_op(inst, 0, inot->_ops[1], false);
725 for (inotid = 0; inotid < vec_size(tmp->instr); ++inotid) {
726 if (tmp->instr[inotid] == inot)
729 if (inotid >= vec_size(tmp->instr)) {
730 compile_error(inst->context, "sanity-check failed: failed to find instruction to optimize out");
733 vec_remove(tmp->instr, inotid, 1);
734 ir_instr_delete(inot);
735 /* swap ontrue/onfalse */
737 inst->bops[0] = inst->bops[1];
748 static bool ir_function_pass_tailrecursion(ir_function *self)
752 for (b = 0; b < vec_size(self->blocks); ++b) {
754 ir_instr *ret, *call, *store = NULL;
755 ir_block *block = self->blocks[b];
757 if (!block->final || vec_size(block->instr) < 2)
760 ret = block->instr[vec_size(block->instr)-1];
761 if (ret->opcode != INSTR_DONE && ret->opcode != INSTR_RETURN)
764 call = block->instr[vec_size(block->instr)-2];
765 if (call->opcode >= INSTR_STORE_F && call->opcode <= INSTR_STORE_FNC) {
766 /* account for the unoptimized
768 * STORE %return, %tmp
772 if (vec_size(block->instr) < 3)
776 call = block->instr[vec_size(block->instr)-3];
779 if (call->opcode < INSTR_CALL0 || call->opcode > INSTR_CALL8)
783 /* optimize out the STORE */
785 ret->_ops[0] == store->_ops[0] &&
786 store->_ops[1] == call->_ops[0])
788 ++opts_optimizationcount[OPTIM_PEEPHOLE];
789 call->_ops[0] = store->_ops[0];
790 vec_remove(block->instr, vec_size(block->instr) - 2, 1);
791 ir_instr_delete(store);
800 funcval = call->_ops[1];
803 if (funcval->vtype != TYPE_FUNCTION || funcval->constval.vfunc != self)
806 /* now we have a CALL and a RET, check if it's a tailcall */
807 if (ret->_ops[0] && call->_ops[0] != ret->_ops[0])
810 ++opts_optimizationcount[OPTIM_TAIL_RECURSION];
811 vec_shrinkby(block->instr, 2);
813 block->final = false; /* open it back up */
815 /* emite parameter-stores */
816 for (p = 0; p < vec_size(call->params); ++p) {
817 /* assert(call->params_count <= self->locals_count); */
818 if (!ir_block_create_store(block, call->context, self->locals[p], call->params[p])) {
819 irerror(call->context, "failed to create tailcall store instruction for parameter %i", (int)p);
823 if (!ir_block_create_jump(block, call->context, self->blocks[0])) {
824 irerror(call->context, "failed to create tailcall jump");
828 ir_instr_delete(call);
829 ir_instr_delete(ret);
835 bool ir_function_finalize(ir_function *self)
842 if (OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
843 if (!ir_function_pass_peephole(self)) {
844 irerror(self->context, "generic optimization pass broke something in `%s`", self->name);
849 if (OPTS_OPTIMIZATION(OPTIM_TAIL_RECURSION)) {
850 if (!ir_function_pass_tailrecursion(self)) {
851 irerror(self->context, "tail-recursion optimization pass broke something in `%s`", self->name);
856 if (!ir_function_naive_phi(self)) {
857 irerror(self->context, "internal error: ir_function_naive_phi failed");
861 for (i = 0; i < vec_size(self->locals); ++i) {
862 ir_value *v = self->locals[i];
863 if (v->vtype == TYPE_VECTOR ||
864 (v->vtype == TYPE_FIELD && v->outtype == TYPE_VECTOR))
866 ir_value_vector_member(v, 0);
867 ir_value_vector_member(v, 1);
868 ir_value_vector_member(v, 2);
871 for (i = 0; i < vec_size(self->values); ++i) {
872 ir_value *v = self->values[i];
873 if (v->vtype == TYPE_VECTOR ||
874 (v->vtype == TYPE_FIELD && v->outtype == TYPE_VECTOR))
876 ir_value_vector_member(v, 0);
877 ir_value_vector_member(v, 1);
878 ir_value_vector_member(v, 2);
882 ir_function_enumerate(self);
884 if (!ir_function_calculate_liferanges(self))
886 if (!ir_function_allocate_locals(self))
891 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
896 vec_size(self->locals) &&
897 self->locals[vec_size(self->locals)-1]->store != store_param) {
898 irerror(self->context, "cannot add parameters after adding locals");
902 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
905 vec_push(self->locals, ve);
909 /***********************************************************************
913 ir_block* ir_block_new(ir_function* owner, const char *name)
916 self = (ir_block*)mem_a(sizeof(*self));
920 memset(self, 0, sizeof(*self));
923 if (name && !ir_block_set_label(self, name)) {
928 self->context.file = "<@no context>";
929 self->context.line = 0;
933 self->entries = NULL;
937 self->is_return = false;
941 self->generated = false;
946 static void ir_block_delete_quick(ir_block* self)
949 if (self->label) mem_d(self->label);
950 for (i = 0; i != vec_size(self->instr); ++i)
951 ir_instr_delete_quick(self->instr[i]);
952 vec_free(self->instr);
953 vec_free(self->entries);
954 vec_free(self->exits);
955 vec_free(self->living);
959 void ir_block_delete(ir_block* self)
962 if (self->label) mem_d(self->label);
963 for (i = 0; i != vec_size(self->instr); ++i)
964 ir_instr_delete(self->instr[i]);
965 vec_free(self->instr);
966 vec_free(self->entries);
967 vec_free(self->exits);
968 vec_free(self->living);
972 bool ir_block_set_label(ir_block *self, const char *name)
975 mem_d((void*)self->label);
976 self->label = util_strdup(name);
977 return !!self->label;
980 /***********************************************************************
984 static ir_instr* ir_instr_new(lex_ctx_t ctx, ir_block* owner, int op)
987 self = (ir_instr*)mem_a(sizeof(*self));
994 self->_ops[0] = NULL;
995 self->_ops[1] = NULL;
996 self->_ops[2] = NULL;
997 self->bops[0] = NULL;
998 self->bops[1] = NULL;
1001 self->params = NULL;
1005 self->likely = true;
1009 static void ir_instr_delete_quick(ir_instr *self)
1011 vec_free(self->phi);
1012 vec_free(self->params);
1016 static void ir_instr_delete(ir_instr *self)
1019 /* The following calls can only delete from
1020 * vectors, we still want to delete this instruction
1021 * so ignore the return value. Since with the warn_unused_result attribute
1022 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
1023 * I have to improvise here and use if(foo());
1025 for (i = 0; i < vec_size(self->phi); ++i) {
1027 if (vec_ir_instr_find(self->phi[i].value->writes, self, &idx))
1028 vec_remove(self->phi[i].value->writes, idx, 1);
1029 if (vec_ir_instr_find(self->phi[i].value->reads, self, &idx))
1030 vec_remove(self->phi[i].value->reads, idx, 1);
1032 vec_free(self->phi);
1033 for (i = 0; i < vec_size(self->params); ++i) {
1035 if (vec_ir_instr_find(self->params[i]->writes, self, &idx))
1036 vec_remove(self->params[i]->writes, idx, 1);
1037 if (vec_ir_instr_find(self->params[i]->reads, self, &idx))
1038 vec_remove(self->params[i]->reads, idx, 1);
1040 vec_free(self->params);
1041 (void)!ir_instr_op(self, 0, NULL, false);
1042 (void)!ir_instr_op(self, 1, NULL, false);
1043 (void)!ir_instr_op(self, 2, NULL, false);
1047 static bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
1049 if (v && v->vtype == TYPE_NOEXPR) {
1050 irerror(self->context, "tried to use a NOEXPR value");
1054 if (self->_ops[op]) {
1056 if (writing && vec_ir_instr_find(self->_ops[op]->writes, self, &idx))
1057 vec_remove(self->_ops[op]->writes, idx, 1);
1058 else if (vec_ir_instr_find(self->_ops[op]->reads, self, &idx))
1059 vec_remove(self->_ops[op]->reads, idx, 1);
1063 vec_push(v->writes, self);
1065 vec_push(v->reads, self);
1071 /***********************************************************************
1075 static void ir_value_code_setaddr(ir_value *self, int32_t gaddr)
1077 self->code.globaladdr = gaddr;
1078 if (self->members[0]) self->members[0]->code.globaladdr = gaddr;
1079 if (self->members[1]) self->members[1]->code.globaladdr = gaddr;
1080 if (self->members[2]) self->members[2]->code.globaladdr = gaddr;
1083 static int32_t ir_value_code_addr(const ir_value *self)
1085 if (self->store == store_return)
1086 return OFS_RETURN + self->code.addroffset;
1087 return self->code.globaladdr + self->code.addroffset;
1090 ir_value* ir_value_var(const char *name, int storetype, int vtype)
1093 self = (ir_value*)mem_a(sizeof(*self));
1094 self->vtype = vtype;
1095 self->fieldtype = TYPE_VOID;
1096 self->outtype = TYPE_VOID;
1097 self->store = storetype;
1101 self->writes = NULL;
1103 self->cvq = CV_NONE;
1104 self->hasvalue = false;
1105 self->context.file = "<@no context>";
1106 self->context.line = 0;
1108 if (name && !ir_value_set_name(self, name)) {
1109 irerror(self->context, "out of memory");
1114 memset(&self->constval, 0, sizeof(self->constval));
1115 memset(&self->code, 0, sizeof(self->code));
1117 self->members[0] = NULL;
1118 self->members[1] = NULL;
1119 self->members[2] = NULL;
1120 self->memberof = NULL;
1122 self->unique_life = false;
1123 self->locked = false;
1124 self->callparam = false;
1130 ir_value* ir_value_vector_member(ir_value *self, unsigned int member)
1138 if (self->members[member])
1139 return self->members[member];
1142 len = strlen(self->name);
1143 name = (char*)mem_a(len + 3);
1144 memcpy(name, self->name, len);
1146 name[len+1] = 'x' + member;
1152 if (self->vtype == TYPE_VECTOR)
1154 m = ir_value_var(name, self->store, TYPE_FLOAT);
1159 m->context = self->context;
1161 self->members[member] = m;
1162 m->code.addroffset = member;
1164 else if (self->vtype == TYPE_FIELD)
1166 if (self->fieldtype != TYPE_VECTOR)
1168 m = ir_value_var(name, self->store, TYPE_FIELD);
1173 m->fieldtype = TYPE_FLOAT;
1174 m->context = self->context;
1176 self->members[member] = m;
1177 m->code.addroffset = member;
1181 irerror(self->context, "invalid member access on %s", self->name);
1189 static GMQCC_INLINE size_t ir_value_sizeof(const ir_value *self)
1191 if (self->vtype == TYPE_FIELD && self->fieldtype == TYPE_VECTOR)
1192 return type_sizeof_[TYPE_VECTOR];
1193 return type_sizeof_[self->vtype];
1196 static ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
1198 ir_value *v = ir_value_var(name, storetype, vtype);
1201 ir_function_collect_value(owner, v);
1205 void ir_value_delete(ir_value* self)
1209 mem_d((void*)self->name);
1212 if (self->vtype == TYPE_STRING)
1213 mem_d((void*)self->constval.vstring);
1215 for (i = 0; i < 3; ++i) {
1216 if (self->members[i])
1217 ir_value_delete(self->members[i]);
1219 vec_free(self->reads);
1220 vec_free(self->writes);
1221 vec_free(self->life);
1225 bool ir_value_set_name(ir_value *self, const char *name)
1228 mem_d((void*)self->name);
1229 self->name = util_strdup(name);
1230 return !!self->name;
1233 bool ir_value_set_float(ir_value *self, float f)
1235 if (self->vtype != TYPE_FLOAT)
1237 self->constval.vfloat = f;
1238 self->hasvalue = true;
1242 bool ir_value_set_func(ir_value *self, int f)
1244 if (self->vtype != TYPE_FUNCTION)
1246 self->constval.vint = f;
1247 self->hasvalue = true;
1251 bool ir_value_set_vector(ir_value *self, vec3_t v)
1253 if (self->vtype != TYPE_VECTOR)
1255 self->constval.vvec = v;
1256 self->hasvalue = true;
1260 bool ir_value_set_field(ir_value *self, ir_value *fld)
1262 if (self->vtype != TYPE_FIELD)
1264 self->constval.vpointer = fld;
1265 self->hasvalue = true;
1269 bool ir_value_set_string(ir_value *self, const char *str)
1271 if (self->vtype != TYPE_STRING)
1273 self->constval.vstring = util_strdupe(str);
1274 self->hasvalue = true;
1279 bool ir_value_set_int(ir_value *self, int i)
1281 if (self->vtype != TYPE_INTEGER)
1283 self->constval.vint = i;
1284 self->hasvalue = true;
1289 bool ir_value_lives(ir_value *self, size_t at)
1292 for (i = 0; i < vec_size(self->life); ++i)
1294 ir_life_entry_t *life = &self->life[i];
1295 if (life->start <= at && at <= life->end)
1297 if (life->start > at) /* since it's ordered */
1303 static bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
1306 vec_push(self->life, e);
1307 for (k = vec_size(self->life)-1; k > idx; --k)
1308 self->life[k] = self->life[k-1];
1309 self->life[idx] = e;
1313 static bool ir_value_life_merge(ir_value *self, size_t s)
1316 const size_t vs = vec_size(self->life);
1317 ir_life_entry_t *life = NULL;
1318 ir_life_entry_t *before = NULL;
1319 ir_life_entry_t new_entry;
1321 /* Find the first range >= s */
1322 for (i = 0; i < vs; ++i)
1325 life = &self->life[i];
1326 if (life->start > s)
1329 /* nothing found? append */
1332 if (life && life->end+1 == s)
1334 /* previous life range can be merged in */
1338 if (life && life->end >= s)
1340 e.start = e.end = s;
1341 vec_push(self->life, e);
1347 if (before->end + 1 == s &&
1348 life->start - 1 == s)
1351 before->end = life->end;
1352 vec_remove(self->life, i, 1);
1355 if (before->end + 1 == s)
1361 /* already contained */
1362 if (before->end >= s)
1366 if (life->start - 1 == s)
1371 /* insert a new entry */
1372 new_entry.start = new_entry.end = s;
1373 return ir_value_life_insert(self, i, new_entry);
1376 static bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
1380 if (!vec_size(other->life))
1383 if (!vec_size(self->life)) {
1384 size_t count = vec_size(other->life);
1385 ir_life_entry_t *life = vec_add(self->life, count);
1386 memcpy(life, other->life, count * sizeof(*life));
1391 for (i = 0; i < vec_size(other->life); ++i)
1393 const ir_life_entry_t *life = &other->life[i];
1396 ir_life_entry_t *entry = &self->life[myi];
1398 if (life->end+1 < entry->start)
1400 /* adding an interval before entry */
1401 if (!ir_value_life_insert(self, myi, *life))
1407 if (life->start < entry->start &&
1408 life->end+1 >= entry->start)
1410 /* starts earlier and overlaps */
1411 entry->start = life->start;
1414 if (life->end > entry->end &&
1415 life->start <= entry->end+1)
1417 /* ends later and overlaps */
1418 entry->end = life->end;
1421 /* see if our change combines it with the next ranges */
1422 while (myi+1 < vec_size(self->life) &&
1423 entry->end+1 >= self->life[1+myi].start)
1425 /* overlaps with (myi+1) */
1426 if (entry->end < self->life[1+myi].end)
1427 entry->end = self->life[1+myi].end;
1428 vec_remove(self->life, myi+1, 1);
1429 entry = &self->life[myi];
1432 /* see if we're after the entry */
1433 if (life->start > entry->end)
1436 /* append if we're at the end */
1437 if (myi >= vec_size(self->life)) {
1438 vec_push(self->life, *life);
1441 /* otherweise check the next range */
1450 static bool ir_values_overlap(const ir_value *a, const ir_value *b)
1452 /* For any life entry in A see if it overlaps with
1453 * any life entry in B.
1454 * Note that the life entries are orderes, so we can make a
1455 * more efficient algorithm there than naively translating the
1459 ir_life_entry_t *la, *lb, *enda, *endb;
1461 /* first of all, if either has no life range, they cannot clash */
1462 if (!vec_size(a->life) || !vec_size(b->life))
1467 enda = la + vec_size(a->life);
1468 endb = lb + vec_size(b->life);
1471 /* check if the entries overlap, for that,
1472 * both must start before the other one ends.
1474 if (la->start < lb->end &&
1475 lb->start < la->end)
1480 /* entries are ordered
1481 * one entry is earlier than the other
1482 * that earlier entry will be moved forward
1484 if (la->start < lb->start)
1486 /* order: A B, move A forward
1487 * check if we hit the end with A
1492 else /* if (lb->start < la->start) actually <= */
1494 /* order: B A, move B forward
1495 * check if we hit the end with B
1504 /***********************************************************************
1508 static bool ir_check_unreachable(ir_block *self)
1510 /* The IR should never have to deal with unreachable code */
1511 if (!self->final/* || OPTS_FLAG(ALLOW_UNREACHABLE_CODE)*/)
1513 irerror(self->context, "unreachable statement (%s)", self->label);
1517 bool ir_block_create_store_op(ir_block *self, lex_ctx_t ctx, int op, ir_value *target, ir_value *what)
1520 if (!ir_check_unreachable(self))
1523 if (target->store == store_value &&
1524 (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1526 irerror(self->context, "cannot store to an SSA value");
1527 irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1528 irerror(self->context, "instruction: %s", util_instr_str[op]);
1532 in = ir_instr_new(ctx, self, op);
1536 if (!ir_instr_op(in, 0, target, (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC)) ||
1537 !ir_instr_op(in, 1, what, false))
1539 ir_instr_delete(in);
1542 vec_push(self->instr, in);
1546 static bool ir_block_create_store(ir_block *self, lex_ctx_t ctx, ir_value *target, ir_value *what)
1550 if (target->vtype == TYPE_VARIANT)
1551 vtype = what->vtype;
1553 vtype = target->vtype;
1556 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
1557 op = INSTR_CONV_ITOF;
1558 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1559 op = INSTR_CONV_FTOI;
1561 op = type_store_instr[vtype];
1563 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1564 if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1568 return ir_block_create_store_op(self, ctx, op, target, what);
1571 bool ir_block_create_storep(ir_block *self, lex_ctx_t ctx, ir_value *target, ir_value *what)
1576 if (target->vtype != TYPE_POINTER)
1579 /* storing using pointer - target is a pointer, type must be
1580 * inferred from source
1582 vtype = what->vtype;
1584 op = type_storep_instr[vtype];
1585 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1586 if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1587 op = INSTR_STOREP_V;
1590 return ir_block_create_store_op(self, ctx, op, target, what);
1593 bool ir_block_create_return(ir_block *self, lex_ctx_t ctx, ir_value *v)
1596 if (!ir_check_unreachable(self))
1599 self->is_return = true;
1600 in = ir_instr_new(ctx, self, INSTR_RETURN);
1604 if (v && !ir_instr_op(in, 0, v, false)) {
1605 ir_instr_delete(in);
1609 vec_push(self->instr, in);
1613 bool ir_block_create_if(ir_block *self, lex_ctx_t ctx, ir_value *v,
1614 ir_block *ontrue, ir_block *onfalse)
1617 if (!ir_check_unreachable(self))
1620 /*in = ir_instr_new(ctx, self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1621 in = ir_instr_new(ctx, self, VINSTR_COND);
1625 if (!ir_instr_op(in, 0, v, false)) {
1626 ir_instr_delete(in);
1630 in->bops[0] = ontrue;
1631 in->bops[1] = onfalse;
1633 vec_push(self->instr, in);
1635 vec_push(self->exits, ontrue);
1636 vec_push(self->exits, onfalse);
1637 vec_push(ontrue->entries, self);
1638 vec_push(onfalse->entries, self);
1642 bool ir_block_create_jump(ir_block *self, lex_ctx_t ctx, ir_block *to)
1645 if (!ir_check_unreachable(self))
1648 in = ir_instr_new(ctx, self, VINSTR_JUMP);
1653 vec_push(self->instr, in);
1655 vec_push(self->exits, to);
1656 vec_push(to->entries, self);
1660 bool ir_block_create_goto(ir_block *self, lex_ctx_t ctx, ir_block *to)
1662 self->owner->flags |= IR_FLAG_HAS_GOTO;
1663 return ir_block_create_jump(self, ctx, to);
1666 ir_instr* ir_block_create_phi(ir_block *self, lex_ctx_t ctx, const char *label, int ot)
1670 if (!ir_check_unreachable(self))
1672 in = ir_instr_new(ctx, self, VINSTR_PHI);
1675 out = ir_value_out(self->owner, label, store_value, ot);
1677 ir_instr_delete(in);
1680 if (!ir_instr_op(in, 0, out, true)) {
1681 ir_instr_delete(in);
1682 ir_value_delete(out);
1685 vec_push(self->instr, in);
1689 ir_value* ir_phi_value(ir_instr *self)
1691 return self->_ops[0];
1694 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1698 if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1699 /* Must not be possible to cause this, otherwise the AST
1700 * is doing something wrong.
1702 irerror(self->context, "Invalid entry block for PHI");
1708 vec_push(v->reads, self);
1709 vec_push(self->phi, pe);
1712 /* call related code */
1713 ir_instr* ir_block_create_call(ir_block *self, lex_ctx_t ctx, const char *label, ir_value *func, bool noreturn)
1717 if (!ir_check_unreachable(self))
1719 in = ir_instr_new(ctx, self, (noreturn ? VINSTR_NRCALL : INSTR_CALL0));
1724 self->is_return = true;
1726 out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1728 ir_instr_delete(in);
1731 if (!ir_instr_op(in, 0, out, true) ||
1732 !ir_instr_op(in, 1, func, false))
1734 ir_instr_delete(in);
1735 ir_value_delete(out);
1738 vec_push(self->instr, in);
1741 if (!ir_block_create_return(self, ctx, NULL)) {
1742 compile_error(ctx, "internal error: failed to generate dummy-return instruction");
1743 ir_instr_delete(in);
1751 ir_value* ir_call_value(ir_instr *self)
1753 return self->_ops[0];
1756 void ir_call_param(ir_instr* self, ir_value *v)
1758 vec_push(self->params, v);
1759 vec_push(v->reads, self);
1762 /* binary op related code */
1764 ir_value* ir_block_create_binop(ir_block *self, lex_ctx_t ctx,
1765 const char *label, int opcode,
1766 ir_value *left, ir_value *right)
1789 case INSTR_SUB_S: /* -- offset of string as float */
1794 case INSTR_BITOR_IF:
1795 case INSTR_BITOR_FI:
1796 case INSTR_BITAND_FI:
1797 case INSTR_BITAND_IF:
1812 case INSTR_BITAND_I:
1815 case INSTR_RSHIFT_I:
1816 case INSTR_LSHIFT_I:
1824 case VINSTR_BITAND_V:
1825 case VINSTR_BITOR_V:
1826 case VINSTR_BITXOR_V:
1827 case VINSTR_BITAND_VF:
1828 case VINSTR_BITOR_VF:
1829 case VINSTR_BITXOR_VF:
1843 * after the following default case, the value of opcode can never
1844 * be 1, 2, 3, 4, 5, 6, 7, 8, 9, 62, 63, 64, 65
1848 /* boolean operations result in floats */
1851 * opcode >= 10 takes true branch opcode is at least 10
1852 * opcode <= 23 takes false branch opcode is at least 24
1854 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1858 * At condition "opcode <= 23", the value of "opcode" must be
1860 * At condition "opcode <= 23", the value of "opcode" cannot be
1861 * equal to any of {1, 2, 3, 4, 5, 6, 7, 8, 9, 62, 63, 64, 65}.
1862 * The condition "opcode <= 23" cannot be true.
1864 * Thus ot=2 (TYPE_FLOAT) can never be true
1867 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1869 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1874 if (ot == TYPE_VOID) {
1875 /* The AST or parser were supposed to check this! */
1879 return ir_block_create_general_instr(self, ctx, label, opcode, left, right, ot);
1882 ir_value* ir_block_create_unary(ir_block *self, lex_ctx_t ctx,
1883 const char *label, int opcode,
1886 int ot = TYPE_FLOAT;
1898 /* QC doesn't have other unary operations. We expect extensions to fill
1899 * the above list, otherwise we assume out-type = in-type, eg for an
1903 ot = operand->vtype;
1906 if (ot == TYPE_VOID) {
1907 /* The AST or parser were supposed to check this! */
1911 /* let's use the general instruction creator and pass NULL for OPB */
1912 return ir_block_create_general_instr(self, ctx, label, opcode, operand, NULL, ot);
1915 static ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx_t ctx, const char *label,
1916 int op, ir_value *a, ir_value *b, int outype)
1921 out = ir_value_out(self->owner, label, store_value, outype);
1925 instr = ir_instr_new(ctx, self, op);
1927 ir_value_delete(out);
1931 if (!ir_instr_op(instr, 0, out, true) ||
1932 !ir_instr_op(instr, 1, a, false) ||
1933 !ir_instr_op(instr, 2, b, false) )
1938 vec_push(self->instr, instr);
1942 ir_instr_delete(instr);
1943 ir_value_delete(out);
1947 ir_value* ir_block_create_fieldaddress(ir_block *self, lex_ctx_t ctx, const char *label, ir_value *ent, ir_value *field)
1951 /* Support for various pointer types todo if so desired */
1952 if (ent->vtype != TYPE_ENTITY)
1955 if (field->vtype != TYPE_FIELD)
1958 v = ir_block_create_general_instr(self, ctx, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1959 v->fieldtype = field->fieldtype;
1963 ir_value* ir_block_create_load_from_ent(ir_block *self, lex_ctx_t ctx, const char *label, ir_value *ent, ir_value *field, int outype)
1966 if (ent->vtype != TYPE_ENTITY)
1969 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1970 if (field->vtype != TYPE_FIELD)
1975 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1976 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1977 case TYPE_STRING: op = INSTR_LOAD_S; break;
1978 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1979 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1980 case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1982 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1983 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1986 irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1990 return ir_block_create_general_instr(self, ctx, label, op, ent, field, outype);
1993 /* PHI resolving breaks the SSA, and must thus be the last
1994 * step before life-range calculation.
1997 static bool ir_block_naive_phi(ir_block *self);
1998 bool ir_function_naive_phi(ir_function *self)
2002 for (i = 0; i < vec_size(self->blocks); ++i)
2004 if (!ir_block_naive_phi(self->blocks[i]))
2010 static bool ir_block_naive_phi(ir_block *self)
2012 size_t i, p; /*, w;*/
2013 /* FIXME: optionally, create_phi can add the phis
2014 * to a list so we don't need to loop through blocks
2015 * - anyway: "don't optimize YET"
2017 for (i = 0; i < vec_size(self->instr); ++i)
2019 ir_instr *instr = self->instr[i];
2020 if (instr->opcode != VINSTR_PHI)
2023 vec_remove(self->instr, i, 1);
2024 --i; /* NOTE: i+1 below */
2026 for (p = 0; p < vec_size(instr->phi); ++p)
2028 ir_value *v = instr->phi[p].value;
2029 ir_block *b = instr->phi[p].from;
2031 if (v->store == store_value &&
2032 vec_size(v->reads) == 1 &&
2033 vec_size(v->writes) == 1)
2035 /* replace the value */
2036 if (!ir_instr_op(v->writes[0], 0, instr->_ops[0], true))
2041 /* force a move instruction */
2042 ir_instr *prevjump = vec_last(b->instr);
2045 instr->_ops[0]->store = store_global;
2046 if (!ir_block_create_store(b, instr->context, instr->_ops[0], v))
2048 instr->_ops[0]->store = store_value;
2049 vec_push(b->instr, prevjump);
2053 ir_instr_delete(instr);
2058 /***********************************************************************
2059 *IR Temp allocation code
2060 * Propagating value life ranges by walking through the function backwards
2061 * until no more changes are made.
2062 * In theory this should happen once more than once for every nested loop
2064 * Though this implementation might run an additional time for if nests.
2067 /* Enumerate instructions used by value's life-ranges
2069 static void ir_block_enumerate(ir_block *self, size_t *_eid)
2073 for (i = 0; i < vec_size(self->instr); ++i)
2075 self->instr[i]->eid = eid++;
2080 /* Enumerate blocks and instructions.
2081 * The block-enumeration is unordered!
2082 * We do not really use the block enumreation, however
2083 * the instruction enumeration is important for life-ranges.
2085 void ir_function_enumerate(ir_function *self)
2088 size_t instruction_id = 0;
2089 for (i = 0; i < vec_size(self->blocks); ++i)
2091 /* each block now gets an additional "entry" instruction id
2092 * we can use to avoid point-life issues
2094 self->blocks[i]->entry_id = instruction_id;
2097 self->blocks[i]->eid = i;
2098 ir_block_enumerate(self->blocks[i], &instruction_id);
2102 /* Local-value allocator
2103 * After finishing creating the liferange of all values used in a function
2104 * we can allocate their global-positions.
2105 * This is the counterpart to register-allocation in register machines.
2112 } function_allocator;
2114 static bool function_allocator_alloc(function_allocator *alloc, ir_value *var)
2117 size_t vsize = ir_value_sizeof(var);
2119 var->code.local = vec_size(alloc->locals);
2121 slot = ir_value_var("reg", store_global, var->vtype);
2125 if (!ir_value_life_merge_into(slot, var))
2128 vec_push(alloc->locals, slot);
2129 vec_push(alloc->sizes, vsize);
2130 vec_push(alloc->unique, var->unique_life);
2135 ir_value_delete(slot);
2139 static bool ir_function_allocator_assign(ir_function *self, function_allocator *alloc, ir_value *v)
2145 return function_allocator_alloc(alloc, v);
2147 for (a = 0; a < vec_size(alloc->locals); ++a)
2149 /* if it's reserved for a unique liferange: skip */
2150 if (alloc->unique[a])
2153 slot = alloc->locals[a];
2155 /* never resize parameters
2156 * will be required later when overlapping temps + locals
2158 if (a < vec_size(self->params) &&
2159 alloc->sizes[a] < ir_value_sizeof(v))
2164 if (ir_values_overlap(v, slot))
2167 if (!ir_value_life_merge_into(slot, v))
2170 /* adjust size for this slot */
2171 if (alloc->sizes[a] < ir_value_sizeof(v))
2172 alloc->sizes[a] = ir_value_sizeof(v);
2177 if (a >= vec_size(alloc->locals)) {
2178 if (!function_allocator_alloc(alloc, v))
2184 bool ir_function_allocate_locals(ir_function *self)
2189 bool opt_gt = OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS);
2193 function_allocator lockalloc, globalloc;
2195 if (!vec_size(self->locals) && !vec_size(self->values))
2198 globalloc.locals = NULL;
2199 globalloc.sizes = NULL;
2200 globalloc.positions = NULL;
2201 globalloc.unique = NULL;
2202 lockalloc.locals = NULL;
2203 lockalloc.sizes = NULL;
2204 lockalloc.positions = NULL;
2205 lockalloc.unique = NULL;
2207 for (i = 0; i < vec_size(self->locals); ++i)
2209 v = self->locals[i];
2210 if ((self->flags & IR_FLAG_MASK_NO_LOCAL_TEMPS) || !OPTS_OPTIMIZATION(OPTIM_LOCAL_TEMPS)) {
2212 v->unique_life = true;
2214 else if (i >= vec_size(self->params))
2217 v->locked = true; /* lock parameters locals */
2218 if (!function_allocator_alloc((v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2221 for (; i < vec_size(self->locals); ++i)
2223 v = self->locals[i];
2224 if (!vec_size(v->life))
2226 if (!ir_function_allocator_assign(self, (v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2230 /* Allocate a slot for any value that still exists */
2231 for (i = 0; i < vec_size(self->values); ++i)
2233 v = self->values[i];
2235 if (!vec_size(v->life))
2238 /* CALL optimization:
2239 * If the value is a parameter-temp: 1 write, 1 read from a CALL
2240 * and it's not "locked", write it to the OFS_PARM directly.
2242 if (OPTS_OPTIMIZATION(OPTIM_CALL_STORES) && !v->locked && !v->unique_life) {
2243 if (vec_size(v->reads) == 1 && vec_size(v->writes) == 1 &&
2244 (v->reads[0]->opcode == VINSTR_NRCALL ||
2245 (v->reads[0]->opcode >= INSTR_CALL0 && v->reads[0]->opcode <= INSTR_CALL8)
2250 ir_instr *call = v->reads[0];
2251 if (!vec_ir_value_find(call->params, v, ¶m)) {
2252 irerror(call->context, "internal error: unlocked parameter %s not found", v->name);
2255 ++opts_optimizationcount[OPTIM_CALL_STORES];
2256 v->callparam = true;
2258 ir_value_code_setaddr(v, OFS_PARM0 + 3*param);
2260 size_t nprotos = vec_size(self->owner->extparam_protos);
2263 if (nprotos > param)
2264 ep = self->owner->extparam_protos[param];
2267 ep = ir_gen_extparam_proto(self->owner);
2268 while (++nprotos <= param)
2269 ep = ir_gen_extparam_proto(self->owner);
2271 ir_instr_op(v->writes[0], 0, ep, true);
2272 call->params[param+8] = ep;
2276 if (vec_size(v->writes) == 1 && v->writes[0]->opcode == INSTR_CALL0)
2278 v->store = store_return;
2279 if (v->members[0]) v->members[0]->store = store_return;
2280 if (v->members[1]) v->members[1]->store = store_return;
2281 if (v->members[2]) v->members[2]->store = store_return;
2282 ++opts_optimizationcount[OPTIM_CALL_STORES];
2287 if (!ir_function_allocator_assign(self, (v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2291 if (!lockalloc.sizes && !globalloc.sizes) {
2294 vec_push(lockalloc.positions, 0);
2295 vec_push(globalloc.positions, 0);
2297 /* Adjust slot positions based on sizes */
2298 if (lockalloc.sizes) {
2299 pos = (vec_size(lockalloc.sizes) ? lockalloc.positions[0] : 0);
2300 for (i = 1; i < vec_size(lockalloc.sizes); ++i)
2302 pos = lockalloc.positions[i-1] + lockalloc.sizes[i-1];
2303 vec_push(lockalloc.positions, pos);
2305 self->allocated_locals = pos + vec_last(lockalloc.sizes);
2307 if (globalloc.sizes) {
2308 pos = (vec_size(globalloc.sizes) ? globalloc.positions[0] : 0);
2309 for (i = 1; i < vec_size(globalloc.sizes); ++i)
2311 pos = globalloc.positions[i-1] + globalloc.sizes[i-1];
2312 vec_push(globalloc.positions, pos);
2314 self->globaltemps = pos + vec_last(globalloc.sizes);
2317 /* Locals need to know their new position */
2318 for (i = 0; i < vec_size(self->locals); ++i) {
2319 v = self->locals[i];
2320 if (v->locked || !opt_gt)
2321 v->code.local = lockalloc.positions[v->code.local];
2323 v->code.local = globalloc.positions[v->code.local];
2325 /* Take over the actual slot positions on values */
2326 for (i = 0; i < vec_size(self->values); ++i) {
2327 v = self->values[i];
2328 if (v->locked || !opt_gt)
2329 v->code.local = lockalloc.positions[v->code.local];
2331 v->code.local = globalloc.positions[v->code.local];
2339 for (i = 0; i < vec_size(lockalloc.locals); ++i)
2340 ir_value_delete(lockalloc.locals[i]);
2341 for (i = 0; i < vec_size(globalloc.locals); ++i)
2342 ir_value_delete(globalloc.locals[i]);
2343 vec_free(globalloc.unique);
2344 vec_free(globalloc.locals);
2345 vec_free(globalloc.sizes);
2346 vec_free(globalloc.positions);
2347 vec_free(lockalloc.unique);
2348 vec_free(lockalloc.locals);
2349 vec_free(lockalloc.sizes);
2350 vec_free(lockalloc.positions);
2354 /* Get information about which operand
2355 * is read from, or written to.
2357 static void ir_op_read_write(int op, size_t *read, size_t *write)
2377 case INSTR_STOREP_F:
2378 case INSTR_STOREP_V:
2379 case INSTR_STOREP_S:
2380 case INSTR_STOREP_ENT:
2381 case INSTR_STOREP_FLD:
2382 case INSTR_STOREP_FNC:
2393 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2396 const size_t vs = vec_size(self->living);
2397 bool changed = false;
2398 for (i = 0; i != vs; ++i)
2400 if (ir_value_life_merge(self->living[i], eid))
2406 static bool ir_block_living_lock(ir_block *self)
2409 bool changed = false;
2410 for (i = 0; i != vec_size(self->living); ++i)
2412 if (!self->living[i]->locked) {
2413 self->living[i]->locked = true;
2420 static bool ir_block_life_propagate(ir_block *self, bool *changed)
2424 size_t i, o, p, mem, cnt;
2425 /* bitmasks which operands are read from or written to */
2432 vec_free(self->living);
2434 p = vec_size(self->exits);
2435 for (i = 0; i < p; ++i) {
2436 ir_block *prev = self->exits[i];
2437 cnt = vec_size(prev->living);
2438 for (o = 0; o < cnt; ++o) {
2439 if (!vec_ir_value_find(self->living, prev->living[o], NULL))
2440 vec_push(self->living, prev->living[o]);
2444 i = vec_size(self->instr);
2447 instr = self->instr[i];
2449 /* See which operands are read and write operands */
2450 ir_op_read_write(instr->opcode, &read, &write);
2452 /* Go through the 3 main operands
2453 * writes first, then reads
2455 for (o = 0; o < 3; ++o)
2457 if (!instr->_ops[o]) /* no such operand */
2460 value = instr->_ops[o];
2462 /* We only care about locals */
2463 /* we also calculate parameter liferanges so that locals
2464 * can take up parameter slots */
2465 if (value->store != store_value &&
2466 value->store != store_local &&
2467 value->store != store_param)
2470 /* write operands */
2471 /* When we write to a local, we consider it "dead" for the
2472 * remaining upper part of the function, since in SSA a value
2473 * can only be written once (== created)
2478 bool in_living = vec_ir_value_find(self->living, value, &idx);
2481 /* If the value isn't alive it hasn't been read before... */
2482 /* TODO: See if the warning can be emitted during parsing or AST processing
2483 * otherwise have warning printed here.
2484 * IF printing a warning here: include filecontext_t,
2485 * and make sure it's only printed once
2486 * since this function is run multiple times.
2488 /* con_err( "Value only written %s\n", value->name); */
2489 if (ir_value_life_merge(value, instr->eid))
2492 /* since 'living' won't contain it
2493 * anymore, merge the value, since
2496 if (ir_value_life_merge(value, instr->eid))
2499 vec_remove(self->living, idx, 1);
2501 /* Removing a vector removes all members */
2502 for (mem = 0; mem < 3; ++mem) {
2503 if (value->members[mem] && vec_ir_value_find(self->living, value->members[mem], &idx)) {
2504 if (ir_value_life_merge(value->members[mem], instr->eid))
2506 vec_remove(self->living, idx, 1);
2509 /* Removing the last member removes the vector */
2510 if (value->memberof) {
2511 value = value->memberof;
2512 for (mem = 0; mem < 3; ++mem) {
2513 if (value->members[mem] && vec_ir_value_find(self->living, value->members[mem], NULL))
2516 if (mem == 3 && vec_ir_value_find(self->living, value, &idx)) {
2517 if (ir_value_life_merge(value, instr->eid))
2519 vec_remove(self->living, idx, 1);
2525 /* These operations need a special case as they can break when using
2526 * same source and destination operand otherwise, as the engine may
2527 * read the source multiple times. */
2528 if (instr->opcode == INSTR_MUL_VF ||
2529 instr->opcode == VINSTR_BITXOR ||
2530 instr->opcode == VINSTR_BITAND_VF ||
2531 instr->opcode == VINSTR_BITOR_VF ||
2532 instr->opcode == VINSTR_BITXOR_VF ||
2533 instr->opcode == VINSTR_BITXOR_V)
2535 value = instr->_ops[2];
2536 /* the float source will get an additional lifetime */
2537 if (ir_value_life_merge(value, instr->eid+1))
2539 if (value->memberof && ir_value_life_merge(value->memberof, instr->eid+1))
2542 else if (instr->opcode == INSTR_MUL_FV || instr->opcode == INSTR_LOAD_V)
2544 value = instr->_ops[1];
2545 /* the float source will get an additional lifetime */
2546 if (ir_value_life_merge(value, instr->eid+1))
2548 if (value->memberof && ir_value_life_merge(value->memberof, instr->eid+1))
2552 for (o = 0; o < 3; ++o)
2554 if (!instr->_ops[o]) /* no such operand */
2557 value = instr->_ops[o];
2559 /* We only care about locals */
2560 /* we also calculate parameter liferanges so that locals
2561 * can take up parameter slots */
2562 if (value->store != store_value &&
2563 value->store != store_local &&
2564 value->store != store_param)
2570 if (!vec_ir_value_find(self->living, value, NULL))
2571 vec_push(self->living, value);
2572 /* reading adds the full vector */
2573 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2574 vec_push(self->living, value->memberof);
2575 for (mem = 0; mem < 3; ++mem) {
2576 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2577 vec_push(self->living, value->members[mem]);
2581 /* PHI operands are always read operands */
2582 for (p = 0; p < vec_size(instr->phi); ++p)
2584 value = instr->phi[p].value;
2585 if (!vec_ir_value_find(self->living, value, NULL))
2586 vec_push(self->living, value);
2587 /* reading adds the full vector */
2588 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2589 vec_push(self->living, value->memberof);
2590 for (mem = 0; mem < 3; ++mem) {
2591 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2592 vec_push(self->living, value->members[mem]);
2596 /* on a call, all these values must be "locked" */
2597 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2598 if (ir_block_living_lock(self))
2601 /* call params are read operands too */
2602 for (p = 0; p < vec_size(instr->params); ++p)
2604 value = instr->params[p];
2605 if (!vec_ir_value_find(self->living, value, NULL))
2606 vec_push(self->living, value);
2607 /* reading adds the full vector */
2608 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2609 vec_push(self->living, value->memberof);
2610 for (mem = 0; mem < 3; ++mem) {
2611 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2612 vec_push(self->living, value->members[mem]);
2617 if (ir_block_living_add_instr(self, instr->eid))
2620 /* the "entry" instruction ID */
2621 if (ir_block_living_add_instr(self, self->entry_id))
2627 bool ir_function_calculate_liferanges(ir_function *self)
2632 /* parameters live at 0 */
2633 for (i = 0; i < vec_size(self->params); ++i)
2634 if (!ir_value_life_merge(self->locals[i], 0))
2635 compile_error(self->context, "internal error: failed value-life merging");
2640 i = vec_size(self->blocks);
2642 ir_block_life_propagate(self->blocks[i], &changed);
2646 if (vec_size(self->blocks)) {
2647 ir_block *block = self->blocks[0];
2648 for (i = 0; i < vec_size(block->living); ++i) {
2649 ir_value *v = block->living[i];
2650 if (v->store != store_local)
2652 if (v->vtype == TYPE_VECTOR)
2654 self->flags |= IR_FLAG_HAS_UNINITIALIZED;
2655 /* find the instruction reading from it */
2656 for (s = 0; s < vec_size(v->reads); ++s) {
2657 if (v->reads[s]->eid == v->life[0].end)
2660 if (s < vec_size(v->reads)) {
2661 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2662 "variable `%s` may be used uninitialized in this function\n"
2665 v->reads[s]->context.file, v->reads[s]->context.line)
2673 ir_value *vec = v->memberof;
2674 for (s = 0; s < vec_size(vec->reads); ++s) {
2675 if (vec->reads[s]->eid == v->life[0].end)
2678 if (s < vec_size(vec->reads)) {
2679 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2680 "variable `%s` may be used uninitialized in this function\n"
2683 vec->reads[s]->context.file, vec->reads[s]->context.line)
2691 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2692 "variable `%s` may be used uninitialized in this function", v->name))
2701 /***********************************************************************
2704 * Since the IR has the convention of putting 'write' operands
2705 * at the beginning, we have to rotate the operands of instructions
2706 * properly in order to generate valid QCVM code.
2708 * Having destinations at a fixed position is more convenient. In QC
2709 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2710 * read from from OPA, and store to OPB rather than OPC. Which is
2711 * partially the reason why the implementation of these instructions
2712 * in darkplaces has been delayed for so long.
2714 * Breaking conventions is annoying...
2716 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2718 static bool gen_global_field(code_t *code, ir_value *global)
2720 if (global->hasvalue)
2722 ir_value *fld = global->constval.vpointer;
2724 irerror(global->context, "Invalid field constant with no field: %s", global->name);
2728 /* copy the field's value */
2729 ir_value_code_setaddr(global, vec_size(code->globals));
2730 vec_push(code->globals, fld->code.fieldaddr);
2731 if (global->fieldtype == TYPE_VECTOR) {
2732 vec_push(code->globals, fld->code.fieldaddr+1);
2733 vec_push(code->globals, fld->code.fieldaddr+2);
2738 ir_value_code_setaddr(global, vec_size(code->globals));
2739 vec_push(code->globals, 0);
2740 if (global->fieldtype == TYPE_VECTOR) {
2741 vec_push(code->globals, 0);
2742 vec_push(code->globals, 0);
2745 if (global->code.globaladdr < 0)
2750 static bool gen_global_pointer(code_t *code, ir_value *global)
2752 if (global->hasvalue)
2754 ir_value *target = global->constval.vpointer;
2756 irerror(global->context, "Invalid pointer constant: %s", global->name);
2757 /* NULL pointers are pointing to the NULL constant, which also
2758 * sits at address 0, but still has an ir_value for itself.
2763 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2764 * void() foo; <- proto
2765 * void() *fooptr = &foo;
2766 * void() foo = { code }
2768 if (!target->code.globaladdr) {
2769 /* FIXME: Check for the constant nullptr ir_value!
2770 * because then code.globaladdr being 0 is valid.
2772 irerror(global->context, "FIXME: Relocation support");
2776 ir_value_code_setaddr(global, vec_size(code->globals));
2777 vec_push(code->globals, target->code.globaladdr);
2781 ir_value_code_setaddr(global, vec_size(code->globals));
2782 vec_push(code->globals, 0);
2784 if (global->code.globaladdr < 0)
2789 static bool gen_blocks_recursive(code_t *code, ir_function *func, ir_block *block)
2791 prog_section_statement_t stmt;
2800 block->generated = true;
2801 block->code_start = vec_size(code->statements);
2802 for (i = 0; i < vec_size(block->instr); ++i)
2804 instr = block->instr[i];
2806 if (instr->opcode == VINSTR_PHI) {
2807 irerror(block->context, "cannot generate virtual instruction (phi)");
2811 if (instr->opcode == VINSTR_JUMP) {
2812 target = instr->bops[0];
2813 /* for uncoditional jumps, if the target hasn't been generated
2814 * yet, we generate them right here.
2816 if (!target->generated)
2817 return gen_blocks_recursive(code, func, target);
2819 /* otherwise we generate a jump instruction */
2820 stmt.opcode = INSTR_GOTO;
2821 stmt.o1.s1 = (target->code_start) - vec_size(code->statements);
2824 if (stmt.o1.s1 != 1)
2825 code_push_statement(code, &stmt, instr->context);
2827 /* no further instructions can be in this block */
2831 if (instr->opcode == VINSTR_BITXOR) {
2832 stmt.opcode = INSTR_BITOR;
2833 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2834 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2835 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2836 code_push_statement(code, &stmt, instr->context);
2837 stmt.opcode = INSTR_BITAND;
2838 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2839 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2840 stmt.o3.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]);
2841 code_push_statement(code, &stmt, instr->context);
2842 stmt.opcode = INSTR_SUB_F;
2843 stmt.o1.s1 = ir_value_code_addr(instr->_ops[0]);
2844 stmt.o2.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]);
2845 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2846 code_push_statement(code, &stmt, instr->context);
2848 /* instruction generated */
2852 if (instr->opcode == VINSTR_BITAND_V) {
2853 stmt.opcode = INSTR_BITAND;
2854 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2855 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2856 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2857 code_push_statement(code, &stmt, instr->context);
2861 code_push_statement(code, &stmt, instr->context);
2865 code_push_statement(code, &stmt, instr->context);
2867 /* instruction generated */
2871 if (instr->opcode == VINSTR_BITOR_V) {
2872 stmt.opcode = INSTR_BITOR;
2873 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2874 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2875 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2876 code_push_statement(code, &stmt, instr->context);
2880 code_push_statement(code, &stmt, instr->context);
2884 code_push_statement(code, &stmt, instr->context);
2886 /* instruction generated */
2890 if (instr->opcode == VINSTR_BITXOR_V) {
2891 for (j = 0; j < 3; ++j) {
2892 stmt.opcode = INSTR_BITOR;
2893 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + j;
2894 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]) + j;
2895 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]) + j;
2896 code_push_statement(code, &stmt, instr->context);
2897 stmt.opcode = INSTR_BITAND;
2898 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + j;
2899 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]) + j;
2900 stmt.o3.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]) + j;
2901 code_push_statement(code, &stmt, instr->context);
2903 stmt.opcode = INSTR_SUB_V;
2904 stmt.o1.s1 = ir_value_code_addr(instr->_ops[0]);
2905 stmt.o2.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]);
2906 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2907 code_push_statement(code, &stmt, instr->context);
2909 /* instruction generated */
2913 if (instr->opcode == VINSTR_BITAND_VF) {
2914 stmt.opcode = INSTR_BITAND;
2915 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2916 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2917 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2918 code_push_statement(code, &stmt, instr->context);
2921 code_push_statement(code, &stmt, instr->context);
2924 code_push_statement(code, &stmt, instr->context);
2926 /* instruction generated */
2930 if (instr->opcode == VINSTR_BITOR_VF) {
2931 stmt.opcode = INSTR_BITOR;
2932 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2933 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2934 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2935 code_push_statement(code, &stmt, instr->context);
2938 code_push_statement(code, &stmt, instr->context);
2941 code_push_statement(code, &stmt, instr->context);
2943 /* instruction generated */
2947 if (instr->opcode == VINSTR_BITXOR_VF) {
2948 for (j = 0; j < 3; ++j) {
2949 stmt.opcode = INSTR_BITOR;
2950 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + j;
2951 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2952 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]) + j;
2953 code_push_statement(code, &stmt, instr->context);
2954 stmt.opcode = INSTR_BITAND;
2955 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + j;
2956 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2957 stmt.o3.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]) + j;
2958 code_push_statement(code, &stmt, instr->context);
2960 stmt.opcode = INSTR_SUB_V;
2961 stmt.o1.s1 = ir_value_code_addr(instr->_ops[0]);
2962 stmt.o2.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]);
2963 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2964 code_push_statement(code, &stmt, instr->context);
2966 /* instruction generated */
2970 if (instr->opcode == VINSTR_COND) {
2971 ontrue = instr->bops[0];
2972 onfalse = instr->bops[1];
2973 /* TODO: have the AST signal which block should
2974 * come first: eg. optimize IFs without ELSE...
2977 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2981 if (ontrue->generated) {
2982 stmt.opcode = INSTR_IF;
2983 stmt.o2.s1 = (ontrue->code_start) - vec_size(code->statements);
2984 if (stmt.o2.s1 != 1)
2985 code_push_statement(code, &stmt, instr->context);
2987 if (onfalse->generated) {
2988 stmt.opcode = INSTR_IFNOT;
2989 stmt.o2.s1 = (onfalse->code_start) - vec_size(code->statements);
2990 if (stmt.o2.s1 != 1)
2991 code_push_statement(code, &stmt, instr->context);
2993 if (!ontrue->generated) {
2994 if (onfalse->generated)
2995 return gen_blocks_recursive(code, func, ontrue);
2997 if (!onfalse->generated) {
2998 if (ontrue->generated)
2999 return gen_blocks_recursive(code, func, onfalse);
3001 /* neither ontrue nor onfalse exist */
3002 stmt.opcode = INSTR_IFNOT;
3003 if (!instr->likely) {
3004 /* Honor the likelyhood hint */
3005 ir_block *tmp = onfalse;
3006 stmt.opcode = INSTR_IF;
3010 stidx = vec_size(code->statements);
3011 code_push_statement(code, &stmt, instr->context);
3012 /* on false we jump, so add ontrue-path */
3013 if (!gen_blocks_recursive(code, func, ontrue))
3015 /* fixup the jump address */
3016 code->statements[stidx].o2.s1 = vec_size(code->statements) - stidx;
3017 /* generate onfalse path */
3018 if (onfalse->generated) {
3019 /* fixup the jump address */
3020 code->statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
3021 if (stidx+2 == vec_size(code->statements) && code->statements[stidx].o2.s1 == 1) {
3022 code->statements[stidx] = code->statements[stidx+1];
3023 if (code->statements[stidx].o1.s1 < 0)
3024 code->statements[stidx].o1.s1++;
3025 code_pop_statement(code);
3027 stmt.opcode = vec_last(code->statements).opcode;
3028 if (stmt.opcode == INSTR_GOTO ||
3029 stmt.opcode == INSTR_IF ||
3030 stmt.opcode == INSTR_IFNOT ||
3031 stmt.opcode == INSTR_RETURN ||
3032 stmt.opcode == INSTR_DONE)
3034 /* no use jumping from here */
3037 /* may have been generated in the previous recursive call */
3038 stmt.opcode = INSTR_GOTO;
3039 stmt.o1.s1 = (onfalse->code_start) - vec_size(code->statements);
3042 if (stmt.o1.s1 != 1)
3043 code_push_statement(code, &stmt, instr->context);
3046 else if (stidx+2 == vec_size(code->statements) && code->statements[stidx].o2.s1 == 1) {
3047 code->statements[stidx] = code->statements[stidx+1];
3048 if (code->statements[stidx].o1.s1 < 0)
3049 code->statements[stidx].o1.s1++;
3050 code_pop_statement(code);
3052 /* if not, generate now */
3053 return gen_blocks_recursive(code, func, onfalse);
3056 if ( (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8)
3057 || instr->opcode == VINSTR_NRCALL)
3062 first = vec_size(instr->params);
3065 for (p = 0; p < first; ++p)
3067 ir_value *param = instr->params[p];
3068 if (param->callparam)
3071 stmt.opcode = INSTR_STORE_F;
3074 if (param->vtype == TYPE_FIELD)
3075 stmt.opcode = field_store_instr[param->fieldtype];
3076 else if (param->vtype == TYPE_NIL)
3077 stmt.opcode = INSTR_STORE_V;
3079 stmt.opcode = type_store_instr[param->vtype];
3080 stmt.o1.u1 = ir_value_code_addr(param);
3081 stmt.o2.u1 = OFS_PARM0 + 3 * p;
3082 code_push_statement(code, &stmt, instr->context);
3084 /* Now handle extparams */
3085 first = vec_size(instr->params);
3086 for (; p < first; ++p)
3088 ir_builder *ir = func->owner;
3089 ir_value *param = instr->params[p];
3090 ir_value *targetparam;
3092 if (param->callparam)
3095 if (p-8 >= vec_size(ir->extparams))
3096 ir_gen_extparam(ir);
3098 targetparam = ir->extparams[p-8];
3100 stmt.opcode = INSTR_STORE_F;
3103 if (param->vtype == TYPE_FIELD)
3104 stmt.opcode = field_store_instr[param->fieldtype];
3105 else if (param->vtype == TYPE_NIL)
3106 stmt.opcode = INSTR_STORE_V;
3108 stmt.opcode = type_store_instr[param->vtype];
3109 stmt.o1.u1 = ir_value_code_addr(param);
3110 stmt.o2.u1 = ir_value_code_addr(targetparam);
3111 code_push_statement(code, &stmt, instr->context);
3114 stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
3115 if (stmt.opcode > INSTR_CALL8)
3116 stmt.opcode = INSTR_CALL8;
3117 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
3120 code_push_statement(code, &stmt, instr->context);
3122 retvalue = instr->_ops[0];
3123 if (retvalue && retvalue->store != store_return &&
3124 (retvalue->store == store_global || vec_size(retvalue->life)))
3126 /* not to be kept in OFS_RETURN */
3127 if (retvalue->vtype == TYPE_FIELD && OPTS_FLAG(ADJUST_VECTOR_FIELDS))
3128 stmt.opcode = field_store_instr[retvalue->fieldtype];
3130 stmt.opcode = type_store_instr[retvalue->vtype];
3131 stmt.o1.u1 = OFS_RETURN;
3132 stmt.o2.u1 = ir_value_code_addr(retvalue);
3134 code_push_statement(code, &stmt, instr->context);
3139 if (instr->opcode == INSTR_STATE) {
3140 irerror(block->context, "TODO: state instruction");
3144 stmt.opcode = instr->opcode;
3149 /* This is the general order of operands */
3151 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
3154 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
3157 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
3159 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
3161 stmt.o1.u1 = stmt.o3.u1;
3164 else if ((stmt.opcode >= INSTR_STORE_F &&
3165 stmt.opcode <= INSTR_STORE_FNC) ||
3166 (stmt.opcode >= INSTR_STOREP_F &&
3167 stmt.opcode <= INSTR_STOREP_FNC))
3169 /* 2-operand instructions with A -> B */
3170 stmt.o2.u1 = stmt.o3.u1;
3173 /* tiny optimization, don't output
3176 if (stmt.o2.u1 == stmt.o1.u1 &&
3177 OPTS_OPTIMIZATION(OPTIM_PEEPHOLE))
3179 ++opts_optimizationcount[OPTIM_PEEPHOLE];
3184 code_push_statement(code, &stmt, instr->context);
3189 static bool gen_function_code(code_t *code, ir_function *self)
3192 prog_section_statement_t stmt, *retst;
3194 /* Starting from entry point, we generate blocks "as they come"
3195 * for now. Dead blocks will not be translated obviously.
3197 if (!vec_size(self->blocks)) {
3198 irerror(self->context, "Function '%s' declared without body.", self->name);
3202 block = self->blocks[0];
3203 if (block->generated)
3206 if (!gen_blocks_recursive(code, self, block)) {
3207 irerror(self->context, "failed to generate blocks for '%s'", self->name);
3211 /* code_write and qcvm -disasm need to know that the function ends here */
3212 retst = &vec_last(code->statements);
3213 if (OPTS_OPTIMIZATION(OPTIM_VOID_RETURN) &&
3214 self->outtype == TYPE_VOID &&
3215 retst->opcode == INSTR_RETURN &&
3216 !retst->o1.u1 && !retst->o2.u1 && !retst->o3.u1)
3218 retst->opcode = INSTR_DONE;
3219 ++opts_optimizationcount[OPTIM_VOID_RETURN];
3223 stmt.opcode = INSTR_DONE;
3227 last.line = vec_last(code->linenums);
3228 last.column = vec_last(code->columnnums);
3230 code_push_statement(code, &stmt, last);
3235 static qcint_t ir_builder_filestring(ir_builder *ir, const char *filename)
3237 /* NOTE: filename pointers are copied, we never strdup them,
3238 * thus we can use pointer-comparison to find the string.
3243 for (i = 0; i < vec_size(ir->filenames); ++i) {
3244 if (ir->filenames[i] == filename)
3245 return ir->filestrings[i];
3248 str = code_genstring(ir->code, filename);
3249 vec_push(ir->filenames, filename);
3250 vec_push(ir->filestrings, str);
3254 static bool gen_global_function(ir_builder *ir, ir_value *global)
3256 prog_section_function_t fun;
3261 if (!global->hasvalue || (!global->constval.vfunc))
3263 irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
3267 irfun = global->constval.vfunc;
3269 fun.name = global->code.name;
3270 fun.file = ir_builder_filestring(ir, global->context.file);
3271 fun.profile = 0; /* always 0 */
3272 fun.nargs = vec_size(irfun->params);
3276 for (i = 0;i < 8; ++i) {
3277 if ((int32_t)i >= fun.nargs)
3280 fun.argsize[i] = type_sizeof_[irfun->params[i]];
3284 fun.locals = irfun->allocated_locals;
3287 fun.entry = irfun->builtin+1;
3289 irfun->code_function_def = vec_size(ir->code->functions);
3290 fun.entry = vec_size(ir->code->statements);
3293 vec_push(ir->code->functions, fun);
3297 static ir_value* ir_gen_extparam_proto(ir_builder *ir)
3302 util_snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparam_protos)));
3303 global = ir_value_var(name, store_global, TYPE_VECTOR);
3305 vec_push(ir->extparam_protos, global);
3309 static void ir_gen_extparam(ir_builder *ir)
3311 prog_section_def_t def;
3314 if (vec_size(ir->extparam_protos) < vec_size(ir->extparams)+1)
3315 global = ir_gen_extparam_proto(ir);
3317 global = ir->extparam_protos[vec_size(ir->extparams)];
3319 def.name = code_genstring(ir->code, global->name);
3320 def.type = TYPE_VECTOR;
3321 def.offset = vec_size(ir->code->globals);
3323 vec_push(ir->code->defs, def);
3325 ir_value_code_setaddr(global, def.offset);
3327 vec_push(ir->code->globals, 0);
3328 vec_push(ir->code->globals, 0);
3329 vec_push(ir->code->globals, 0);
3331 vec_push(ir->extparams, global);
3334 static bool gen_function_extparam_copy(code_t *code, ir_function *self)
3336 size_t i, ext, numparams;
3338 ir_builder *ir = self->owner;
3340 prog_section_statement_t stmt;
3342 numparams = vec_size(self->params);
3346 stmt.opcode = INSTR_STORE_F;
3348 for (i = 8; i < numparams; ++i) {
3350 if (ext >= vec_size(ir->extparams))
3351 ir_gen_extparam(ir);
3353 ep = ir->extparams[ext];
3355 stmt.opcode = type_store_instr[self->locals[i]->vtype];
3356 if (self->locals[i]->vtype == TYPE_FIELD &&
3357 self->locals[i]->fieldtype == TYPE_VECTOR)
3359 stmt.opcode = INSTR_STORE_V;
3361 stmt.o1.u1 = ir_value_code_addr(ep);
3362 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3363 code_push_statement(code, &stmt, self->context);
3369 static bool gen_function_varargs_copy(code_t *code, ir_function *self)
3371 size_t i, ext, numparams, maxparams;
3373 ir_builder *ir = self->owner;
3375 prog_section_statement_t stmt;
3377 numparams = vec_size(self->params);
3381 stmt.opcode = INSTR_STORE_V;
3383 maxparams = numparams + self->max_varargs;
3384 for (i = numparams; i < maxparams; ++i) {
3386 stmt.o1.u1 = OFS_PARM0 + 3*i;
3387 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3388 code_push_statement(code, &stmt, self->context);
3392 while (ext >= vec_size(ir->extparams))
3393 ir_gen_extparam(ir);
3395 ep = ir->extparams[ext];
3397 stmt.o1.u1 = ir_value_code_addr(ep);
3398 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3399 code_push_statement(code, &stmt, self->context);
3405 static bool gen_function_locals(ir_builder *ir, ir_value *global)
3407 prog_section_function_t *def;
3410 uint32_t firstlocal, firstglobal;
3412 irfun = global->constval.vfunc;
3413 def = ir->code->functions + irfun->code_function_def;
3415 if (OPTS_OPTION_BOOL(OPTION_G) ||
3416 !OPTS_OPTIMIZATION(OPTIM_OVERLAP_LOCALS) ||
3417 (irfun->flags & IR_FLAG_MASK_NO_OVERLAP))
3419 firstlocal = def->firstlocal = vec_size(ir->code->globals);
3421 firstlocal = def->firstlocal = ir->first_common_local;
3422 ++opts_optimizationcount[OPTIM_OVERLAP_LOCALS];
3425 firstglobal = (OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS) ? ir->first_common_globaltemp : firstlocal);
3427 for (i = vec_size(ir->code->globals); i < firstlocal + irfun->allocated_locals; ++i)
3428 vec_push(ir->code->globals, 0);
3429 for (i = 0; i < vec_size(irfun->locals); ++i) {
3430 ir_value *v = irfun->locals[i];
3431 if (v->locked || !OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS)) {
3432 ir_value_code_setaddr(v, firstlocal + v->code.local);
3433 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3434 irerror(irfun->locals[i]->context, "failed to generate local %s", irfun->locals[i]->name);
3439 ir_value_code_setaddr(v, firstglobal + v->code.local);
3441 for (i = 0; i < vec_size(irfun->values); ++i)
3443 ir_value *v = irfun->values[i];
3447 ir_value_code_setaddr(v, firstlocal + v->code.local);
3449 ir_value_code_setaddr(v, firstglobal + v->code.local);
3454 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
3456 prog_section_function_t *fundef;
3461 irfun = global->constval.vfunc;
3463 if (global->cvq == CV_NONE) {
3464 irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
3465 "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
3467 /* this was a function pointer, don't generate code for those */
3474 if (irfun->code_function_def < 0) {
3475 irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
3478 fundef = &ir->code->functions[irfun->code_function_def];
3480 fundef->entry = vec_size(ir->code->statements);
3481 if (!gen_function_locals(ir, global)) {
3482 irerror(irfun->context, "Failed to generate locals for function %s", irfun->name);
3485 if (!gen_function_extparam_copy(ir->code, irfun)) {
3486 irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
3489 if (irfun->max_varargs && !gen_function_varargs_copy(ir->code, irfun)) {
3490 irerror(irfun->context, "Failed to generate vararg-copy code for function %s", irfun->name);
3493 if (!gen_function_code(ir->code, irfun)) {
3494 irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
3500 static void gen_vector_defs(code_t *code, prog_section_def_t def, const char *name)
3505 if (!name || name[0] == '#' || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3508 def.type = TYPE_FLOAT;
3512 component = (char*)mem_a(len+3);
3513 memcpy(component, name, len);
3515 component[len-0] = 0;
3516 component[len-2] = '_';
3518 component[len-1] = 'x';
3520 for (i = 0; i < 3; ++i) {
3521 def.name = code_genstring(code, component);
3522 vec_push(code->defs, def);
3530 static void gen_vector_fields(code_t *code, prog_section_field_t fld, const char *name)
3535 if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3538 fld.type = TYPE_FLOAT;
3542 component = (char*)mem_a(len+3);
3543 memcpy(component, name, len);
3545 component[len-0] = 0;
3546 component[len-2] = '_';
3548 component[len-1] = 'x';
3550 for (i = 0; i < 3; ++i) {
3551 fld.name = code_genstring(code, component);
3552 vec_push(code->fields, fld);
3560 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
3564 prog_section_def_t def;
3565 bool pushdef = opts.optimizeoff;
3567 def.type = global->vtype;
3568 def.offset = vec_size(self->code->globals);
3570 if (OPTS_OPTION_BOOL(OPTION_G) || !islocal)
3574 if (OPTS_OPTIMIZATION(OPTIM_STRIP_CONSTANT_NAMES) &&
3575 !(global->flags & IR_FLAG_INCLUDE_DEF) &&
3576 (global->name[0] == '#' || global->cvq == CV_CONST))
3582 if (global->name[0] == '#') {
3583 if (!self->str_immediate)
3584 self->str_immediate = code_genstring(self->code, "IMMEDIATE");
3585 def.name = global->code.name = self->str_immediate;
3588 def.name = global->code.name = code_genstring(self->code, global->name);
3593 def.offset = ir_value_code_addr(global);
3594 vec_push(self->code->defs, def);
3595 if (global->vtype == TYPE_VECTOR)
3596 gen_vector_defs(self->code, def, global->name);
3597 else if (global->vtype == TYPE_FIELD && global->fieldtype == TYPE_VECTOR)
3598 gen_vector_defs(self->code, def, global->name);
3605 switch (global->vtype)
3608 if (!strcmp(global->name, "end_sys_globals")) {
3609 /* TODO: remember this point... all the defs before this one
3610 * should be checksummed and added to progdefs.h when we generate it.
3613 else if (!strcmp(global->name, "end_sys_fields")) {
3614 /* TODO: same as above but for entity-fields rather than globsl
3618 irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
3620 /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
3621 * the system fields actually go? Though the engine knows this anyway...
3622 * Maybe this could be an -foption
3623 * fteqcc creates data for end_sys_* - of size 1, so let's do the same
3625 ir_value_code_setaddr(global, vec_size(self->code->globals));
3626 vec_push(self->code->globals, 0);
3628 if (pushdef) vec_push(self->code->defs, def);
3631 if (pushdef) vec_push(self->code->defs, def);
3632 return gen_global_pointer(self->code, global);
3635 vec_push(self->code->defs, def);
3636 if (global->fieldtype == TYPE_VECTOR)
3637 gen_vector_defs(self->code, def, global->name);
3639 return gen_global_field(self->code, global);
3644 ir_value_code_setaddr(global, vec_size(self->code->globals));
3645 if (global->hasvalue) {
3646 iptr = (int32_t*)&global->constval.ivec[0];
3647 vec_push(self->code->globals, *iptr);
3649 vec_push(self->code->globals, 0);
3651 if (!islocal && global->cvq != CV_CONST)
3652 def.type |= DEF_SAVEGLOBAL;
3653 if (pushdef) vec_push(self->code->defs, def);
3655 return global->code.globaladdr >= 0;
3659 ir_value_code_setaddr(global, vec_size(self->code->globals));
3660 if (global->hasvalue) {
3661 uint32_t load = code_genstring(self->code, global->constval.vstring);
3662 vec_push(self->code->globals, load);
3664 vec_push(self->code->globals, 0);
3666 if (!islocal && global->cvq != CV_CONST)
3667 def.type |= DEF_SAVEGLOBAL;
3668 if (pushdef) vec_push(self->code->defs, def);
3669 return global->code.globaladdr >= 0;
3674 ir_value_code_setaddr(global, vec_size(self->code->globals));
3675 if (global->hasvalue) {
3676 iptr = (int32_t*)&global->constval.ivec[0];
3677 vec_push(self->code->globals, iptr[0]);
3678 if (global->code.globaladdr < 0)
3680 for (d = 1; d < type_sizeof_[global->vtype]; ++d) {
3681 vec_push(self->code->globals, iptr[d]);
3684 vec_push(self->code->globals, 0);
3685 if (global->code.globaladdr < 0)
3687 for (d = 1; d < type_sizeof_[global->vtype]; ++d) {
3688 vec_push(self->code->globals, 0);
3691 if (!islocal && global->cvq != CV_CONST)
3692 def.type |= DEF_SAVEGLOBAL;
3695 vec_push(self->code->defs, def);
3696 def.type &= ~DEF_SAVEGLOBAL;
3697 gen_vector_defs(self->code, def, global->name);
3699 return global->code.globaladdr >= 0;
3702 ir_value_code_setaddr(global, vec_size(self->code->globals));
3703 if (!global->hasvalue) {
3704 vec_push(self->code->globals, 0);
3705 if (global->code.globaladdr < 0)
3708 vec_push(self->code->globals, vec_size(self->code->functions));
3709 if (!gen_global_function(self, global))
3712 if (!islocal && global->cvq != CV_CONST)
3713 def.type |= DEF_SAVEGLOBAL;
3714 if (pushdef) vec_push(self->code->defs, def);
3717 /* assume biggest type */
3718 ir_value_code_setaddr(global, vec_size(self->code->globals));
3719 vec_push(self->code->globals, 0);
3720 for (i = 1; i < type_sizeof_[TYPE_VARIANT]; ++i)
3721 vec_push(self->code->globals, 0);
3724 /* refuse to create 'void' type or any other fancy business. */
3725 irerror(global->context, "Invalid type for global variable `%s`: %s",
3726 global->name, type_name[global->vtype]);
3731 static GMQCC_INLINE void ir_builder_prepare_field(code_t *code, ir_value *field)
3733 field->code.fieldaddr = code_alloc_field(code, type_sizeof_[field->fieldtype]);
3736 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
3738 prog_section_def_t def;
3739 prog_section_field_t fld;
3743 def.type = (uint16_t)field->vtype;
3744 def.offset = (uint16_t)vec_size(self->code->globals);
3746 /* create a global named the same as the field */
3747 if (OPTS_OPTION_U32(OPTION_STANDARD) == COMPILER_GMQCC) {
3748 /* in our standard, the global gets a dot prefix */
3749 size_t len = strlen(field->name);
3752 /* we really don't want to have to allocate this, and 1024
3753 * bytes is more than enough for a variable/field name
3755 if (len+2 >= sizeof(name)) {
3756 irerror(field->context, "invalid field name size: %u", (unsigned int)len);
3761 memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
3764 def.name = code_genstring(self->code, name);
3765 fld.name = def.name + 1; /* we reuse that string table entry */
3767 /* in plain QC, there cannot be a global with the same name,
3768 * and so we also name the global the same.
3769 * FIXME: fteqcc should create a global as well
3770 * check if it actually uses the same name. Probably does
3772 def.name = code_genstring(self->code, field->name);
3773 fld.name = def.name;
3776 field->code.name = def.name;
3778 vec_push(self->code->defs, def);
3780 fld.type = field->fieldtype;
3782 if (fld.type == TYPE_VOID) {
3783 irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3787 fld.offset = field->code.fieldaddr;
3789 vec_push(self->code->fields, fld);
3791 ir_value_code_setaddr(field, vec_size(self->code->globals));
3792 vec_push(self->code->globals, fld.offset);
3793 if (fld.type == TYPE_VECTOR) {
3794 vec_push(self->code->globals, fld.offset+1);
3795 vec_push(self->code->globals, fld.offset+2);
3798 if (field->fieldtype == TYPE_VECTOR) {
3799 gen_vector_defs (self->code, def, field->name);
3800 gen_vector_fields(self->code, fld, field->name);
3803 return field->code.globaladdr >= 0;
3806 bool ir_builder_generate(ir_builder *self, const char *filename)
3808 prog_section_statement_t stmt;
3810 char *lnofile = NULL;
3812 for (i = 0; i < vec_size(self->fields); ++i)
3814 ir_builder_prepare_field(self->code, self->fields[i]);
3817 for (i = 0; i < vec_size(self->globals); ++i)
3819 if (!ir_builder_gen_global(self, self->globals[i], false)) {
3822 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3823 ir_function *func = self->globals[i]->constval.vfunc;
3824 if (func && self->max_locals < func->allocated_locals &&
3825 !(func->flags & IR_FLAG_MASK_NO_OVERLAP))
3827 self->max_locals = func->allocated_locals;
3829 if (func && self->max_globaltemps < func->globaltemps)
3830 self->max_globaltemps = func->globaltemps;
3834 for (i = 0; i < vec_size(self->fields); ++i)
3836 if (!ir_builder_gen_field(self, self->fields[i])) {
3842 ir_value_code_setaddr(self->nil, vec_size(self->code->globals));
3843 vec_push(self->code->globals, 0);
3844 vec_push(self->code->globals, 0);
3845 vec_push(self->code->globals, 0);
3847 /* generate virtual-instruction temps */
3848 for (i = 0; i < IR_MAX_VINSTR_TEMPS; ++i) {
3849 ir_value_code_setaddr(self->vinstr_temp[i], vec_size(self->code->globals));
3850 vec_push(self->code->globals, 0);
3851 vec_push(self->code->globals, 0);
3852 vec_push(self->code->globals, 0);
3855 /* generate global temps */
3856 self->first_common_globaltemp = vec_size(self->code->globals);
3857 for (i = 0; i < self->max_globaltemps; ++i) {
3858 vec_push(self->code->globals, 0);
3860 /* generate common locals */
3861 self->first_common_local = vec_size(self->code->globals);
3862 for (i = 0; i < self->max_locals; ++i) {
3863 vec_push(self->code->globals, 0);
3866 /* generate function code */
3867 for (i = 0; i < vec_size(self->globals); ++i)
3869 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3870 if (!gen_global_function_code(self, self->globals[i])) {
3876 if (vec_size(self->code->globals) >= 65536) {
3877 irerror(vec_last(self->globals)->context, "This progs file would require more globals than the metadata can handle. Bailing out.");
3881 /* DP errors if the last instruction is not an INSTR_DONE. */
3882 if (vec_last(self->code->statements).opcode != INSTR_DONE)
3886 stmt.opcode = INSTR_DONE;
3890 last.line = vec_last(self->code->linenums);
3891 last.column = vec_last(self->code->columnnums);
3893 code_push_statement(self->code, &stmt, last);
3896 if (OPTS_OPTION_BOOL(OPTION_PP_ONLY))
3899 if (vec_size(self->code->statements) != vec_size(self->code->linenums)) {
3900 con_err("Linecounter wrong: %lu != %lu\n",
3901 (unsigned long)vec_size(self->code->statements),
3902 (unsigned long)vec_size(self->code->linenums));
3903 } else if (OPTS_FLAG(LNO)) {
3905 size_t filelen = strlen(filename);
3907 memcpy(vec_add(lnofile, filelen+1), filename, filelen+1);
3908 dot = strrchr(lnofile, '.');
3912 vec_shrinkto(lnofile, dot - lnofile);
3914 memcpy(vec_add(lnofile, 5), ".lno", 5);
3917 if (!code_write(self->code, filename, lnofile)) {
3926 /***********************************************************************
3927 *IR DEBUG Dump functions...
3930 #define IND_BUFSZ 1024
3933 # define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
3936 static const char *qc_opname(int op)
3938 if (op < 0) return "<INVALID>";
3939 if (op < VINSTR_END)
3940 return util_instr_str[op];
3942 case VINSTR_END: return "END";
3943 case VINSTR_PHI: return "PHI";
3944 case VINSTR_JUMP: return "JUMP";
3945 case VINSTR_COND: return "COND";
3946 case VINSTR_BITXOR: return "BITXOR";
3947 case VINSTR_BITAND_V: return "BITAND_V";
3948 case VINSTR_BITOR_V: return "BITOR_V";
3949 case VINSTR_BITXOR_V: return "BITXOR_V";
3950 case VINSTR_BITAND_VF: return "BITAND_VF";
3951 case VINSTR_BITOR_VF: return "BITOR_VF";
3952 case VINSTR_BITXOR_VF: return "BITXOR_VF";
3953 default: return "<UNK>";
3957 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
3960 char indent[IND_BUFSZ];
3964 oprintf("module %s\n", b->name);
3965 for (i = 0; i < vec_size(b->globals); ++i)
3968 if (b->globals[i]->hasvalue)
3969 oprintf("%s = ", b->globals[i]->name);
3970 ir_value_dump(b->globals[i], oprintf);
3973 for (i = 0; i < vec_size(b->functions); ++i)
3974 ir_function_dump(b->functions[i], indent, oprintf);
3975 oprintf("endmodule %s\n", b->name);
3978 static const char *storenames[] = {
3979 "[global]", "[local]", "[param]", "[value]", "[return]"
3982 void ir_function_dump(ir_function *f, char *ind,
3983 int (*oprintf)(const char*, ...))
3986 if (f->builtin != 0) {
3987 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
3990 oprintf("%sfunction %s\n", ind, f->name);
3991 strncat(ind, "\t", IND_BUFSZ-1);
3992 if (vec_size(f->locals))
3994 oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
3995 for (i = 0; i < vec_size(f->locals); ++i) {
3996 oprintf("%s\t", ind);
3997 ir_value_dump(f->locals[i], oprintf);
4001 oprintf("%sliferanges:\n", ind);
4002 for (i = 0; i < vec_size(f->locals); ++i) {
4003 const char *attr = "";
4005 ir_value *v = f->locals[i];
4006 if (v->unique_life && v->locked)
4007 attr = "unique,locked ";
4008 else if (v->unique_life)
4012 oprintf("%s\t%s: %s %s %s%s@%i ", ind, v->name, type_name[v->vtype],
4013 storenames[v->store],
4014 attr, (v->callparam ? "callparam " : ""),
4015 (int)v->code.local);
4018 for (l = 0; l < vec_size(v->life); ++l) {
4019 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
4022 for (m = 0; m < 3; ++m) {
4023 ir_value *vm = v->members[m];
4026 oprintf("%s\t%s: @%i ", ind, vm->name, (int)vm->code.local);
4027 for (l = 0; l < vec_size(vm->life); ++l) {
4028 oprintf("[%i,%i] ", vm->life[l].start, vm->life[l].end);
4033 for (i = 0; i < vec_size(f->values); ++i) {
4034 const char *attr = "";
4036 ir_value *v = f->values[i];
4037 if (v->unique_life && v->locked)
4038 attr = "unique,locked ";
4039 else if (v->unique_life)
4043 oprintf("%s\t%s: %s %s %s%s@%i ", ind, v->name, type_name[v->vtype],
4044 storenames[v->store],
4045 attr, (v->callparam ? "callparam " : ""),
4046 (int)v->code.local);
4049 for (l = 0; l < vec_size(v->life); ++l) {
4050 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
4053 for (m = 0; m < 3; ++m) {
4054 ir_value *vm = v->members[m];
4057 if (vm->unique_life && vm->locked)
4058 attr = "unique,locked ";
4059 else if (vm->unique_life)
4061 else if (vm->locked)
4063 oprintf("%s\t%s: %s@%i ", ind, vm->name, attr, (int)vm->code.local);
4064 for (l = 0; l < vec_size(vm->life); ++l) {
4065 oprintf("[%i,%i] ", vm->life[l].start, vm->life[l].end);
4070 if (vec_size(f->blocks))
4072 oprintf("%slife passes: %i\n", ind, (int)f->run_id);
4073 for (i = 0; i < vec_size(f->blocks); ++i) {
4074 ir_block_dump(f->blocks[i], ind, oprintf);
4078 ind[strlen(ind)-1] = 0;
4079 oprintf("%sendfunction %s\n", ind, f->name);
4082 void ir_block_dump(ir_block* b, char *ind,
4083 int (*oprintf)(const char*, ...))
4086 oprintf("%s:%s\n", ind, b->label);
4087 strncat(ind, "\t", IND_BUFSZ-1);
4089 if (b->instr && b->instr[0])
4090 oprintf("%s (%i) [entry]\n", ind, (int)(b->instr[0]->eid-1));
4091 for (i = 0; i < vec_size(b->instr); ++i)
4092 ir_instr_dump(b->instr[i], ind, oprintf);
4093 ind[strlen(ind)-1] = 0;
4096 static void dump_phi(ir_instr *in, int (*oprintf)(const char*, ...))
4099 oprintf("%s <- phi ", in->_ops[0]->name);
4100 for (i = 0; i < vec_size(in->phi); ++i)
4102 oprintf("([%s] : %s) ", in->phi[i].from->label,
4103 in->phi[i].value->name);
4108 void ir_instr_dump(ir_instr *in, char *ind,
4109 int (*oprintf)(const char*, ...))
4112 const char *comma = NULL;
4114 oprintf("%s (%i) ", ind, (int)in->eid);
4116 if (in->opcode == VINSTR_PHI) {
4117 dump_phi(in, oprintf);
4121 strncat(ind, "\t", IND_BUFSZ-1);
4123 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
4124 ir_value_dump(in->_ops[0], oprintf);
4125 if (in->_ops[1] || in->_ops[2])
4128 if (in->opcode == INSTR_CALL0 || in->opcode == VINSTR_NRCALL) {
4129 oprintf("CALL%i\t", vec_size(in->params));
4131 oprintf("%s\t", qc_opname(in->opcode));
4133 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
4134 ir_value_dump(in->_ops[0], oprintf);
4139 for (i = 1; i != 3; ++i) {
4143 ir_value_dump(in->_ops[i], oprintf);
4151 oprintf("[%s]", in->bops[0]->label);
4155 oprintf("%s[%s]", comma, in->bops[1]->label);
4156 if (vec_size(in->params)) {
4157 oprintf("\tparams: ");
4158 for (i = 0; i != vec_size(in->params); ++i) {
4159 oprintf("%s, ", in->params[i]->name);
4163 ind[strlen(ind)-1] = 0;
4166 static void ir_value_dump_string(const char *str, int (*oprintf)(const char*, ...))
4169 for (; *str; ++str) {
4171 case '\n': oprintf("\\n"); break;
4172 case '\r': oprintf("\\r"); break;
4173 case '\t': oprintf("\\t"); break;
4174 case '\v': oprintf("\\v"); break;
4175 case '\f': oprintf("\\f"); break;
4176 case '\b': oprintf("\\b"); break;
4177 case '\a': oprintf("\\a"); break;
4178 case '\\': oprintf("\\\\"); break;
4179 case '"': oprintf("\\\""); break;
4180 default: oprintf("%c", *str); break;
4186 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
4195 oprintf("fn:%s", v->name);
4198 oprintf("%g", v->constval.vfloat);
4201 oprintf("'%g %g %g'",
4204 v->constval.vvec.z);
4207 oprintf("(entity)");
4210 ir_value_dump_string(v->constval.vstring, oprintf);
4214 oprintf("%i", v->constval.vint);
4219 v->constval.vpointer->name);
4223 oprintf("%s", v->name);
4227 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
4230 oprintf("Life of %12s:", self->name);
4231 for (i = 0; i < vec_size(self->life); ++i)
4233 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);