5 * Permission is hereby granted, free of charge, to any person obtaining a copy of
6 * this software and associated documentation files (the "Software"), to deal in
7 * the Software without restriction, including without limitation the rights to
8 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
9 * of the Software, and to permit persons to whom the Software is furnished to do
10 * so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in all
13 * copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
28 /***********************************************************************
29 * Type sizes used at multiple points in the IR codegen
32 const char *type_name[TYPE_COUNT] = {
48 size_t type_sizeof[TYPE_COUNT] = {
55 1, /* TYPE_FUNCTION */
64 uint16_t type_store_instr[TYPE_COUNT] = {
65 INSTR_STORE_F, /* should use I when having integer support */
72 INSTR_STORE_ENT, /* should use I */
74 INSTR_STORE_I, /* integer type */
79 INSTR_STORE_V, /* variant, should never be accessed */
81 AINSTR_END, /* struct */
82 AINSTR_END, /* union */
83 AINSTR_END, /* array */
86 uint16_t field_store_instr[TYPE_COUNT] = {
96 INSTR_STORE_FLD, /* integer type */
101 INSTR_STORE_V, /* variant, should never be accessed */
103 AINSTR_END, /* struct */
104 AINSTR_END, /* union */
105 AINSTR_END, /* array */
108 uint16_t type_storep_instr[TYPE_COUNT] = {
109 INSTR_STOREP_F, /* should use I when having integer support */
116 INSTR_STOREP_ENT, /* should use I */
118 INSTR_STOREP_ENT, /* integer type */
123 INSTR_STOREP_V, /* variant, should never be accessed */
125 AINSTR_END, /* struct */
126 AINSTR_END, /* union */
127 AINSTR_END, /* array */
130 uint16_t type_eq_instr[TYPE_COUNT] = {
131 INSTR_EQ_F, /* should use I when having integer support */
136 INSTR_EQ_E, /* FLD has no comparison */
138 INSTR_EQ_E, /* should use I */
145 INSTR_EQ_V, /* variant, should never be accessed */
147 AINSTR_END, /* struct */
148 AINSTR_END, /* union */
149 AINSTR_END, /* array */
152 uint16_t type_ne_instr[TYPE_COUNT] = {
153 INSTR_NE_F, /* should use I when having integer support */
158 INSTR_NE_E, /* FLD has no comparison */
160 INSTR_NE_E, /* should use I */
167 INSTR_NE_V, /* variant, should never be accessed */
169 AINSTR_END, /* struct */
170 AINSTR_END, /* union */
171 AINSTR_END, /* array */
174 uint16_t type_not_instr[TYPE_COUNT] = {
175 INSTR_NOT_F, /* should use I when having integer support */
182 INSTR_NOT_ENT, /* should use I */
184 INSTR_NOT_I, /* integer type */
189 INSTR_NOT_V, /* variant, should never be accessed */
191 AINSTR_END, /* struct */
192 AINSTR_END, /* union */
193 AINSTR_END, /* array */
197 static void ir_gen_extparam(ir_builder *ir);
199 /* error functions */
201 static void irerror(lex_ctx ctx, const char *msg, ...)
205 con_cvprintmsg((void*)&ctx, LVL_ERROR, "internal error", msg, ap);
209 static bool irwarning(lex_ctx ctx, int warntype, const char *fmt, ...)
214 r = vcompile_warning(ctx, warntype, fmt, ap);
219 /***********************************************************************
220 * Vector utility functions
223 bool GMQCC_WARN vec_ir_value_find(ir_value **vec, ir_value *what, size_t *idx)
226 size_t len = vec_size(vec);
227 for (i = 0; i < len; ++i) {
228 if (vec[i] == what) {
236 bool GMQCC_WARN vec_ir_block_find(ir_block **vec, ir_block *what, size_t *idx)
239 size_t len = vec_size(vec);
240 for (i = 0; i < len; ++i) {
241 if (vec[i] == what) {
249 bool GMQCC_WARN vec_ir_instr_find(ir_instr **vec, ir_instr *what, size_t *idx)
252 size_t len = vec_size(vec);
253 for (i = 0; i < len; ++i) {
254 if (vec[i] == what) {
262 /***********************************************************************
266 static void ir_block_delete_quick(ir_block* self);
267 static void ir_instr_delete_quick(ir_instr *self);
268 static void ir_function_delete_quick(ir_function *self);
270 ir_builder* ir_builder_new(const char *modulename)
274 self = (ir_builder*)mem_a(sizeof(*self));
278 self->functions = NULL;
279 self->globals = NULL;
281 self->extparams = NULL;
282 self->filenames = NULL;
283 self->filestrings = NULL;
284 self->htglobals = util_htnew(IR_HT_SIZE);
285 self->htfields = util_htnew(IR_HT_SIZE);
286 self->htfunctions = util_htnew(IR_HT_SIZE);
288 self->str_immediate = 0;
290 if (!ir_builder_set_name(self, modulename)) {
298 void ir_builder_delete(ir_builder* self)
301 util_htdel(self->htglobals);
302 util_htdel(self->htfields);
303 util_htdel(self->htfunctions);
304 mem_d((void*)self->name);
305 for (i = 0; i != vec_size(self->functions); ++i) {
306 ir_function_delete_quick(self->functions[i]);
308 vec_free(self->functions);
309 for (i = 0; i != vec_size(self->extparams); ++i) {
310 ir_value_delete(self->extparams[i]);
312 vec_free(self->extparams);
313 for (i = 0; i != vec_size(self->globals); ++i) {
314 ir_value_delete(self->globals[i]);
316 vec_free(self->globals);
317 for (i = 0; i != vec_size(self->fields); ++i) {
318 ir_value_delete(self->fields[i]);
320 vec_free(self->fields);
321 vec_free(self->filenames);
322 vec_free(self->filestrings);
326 bool ir_builder_set_name(ir_builder *self, const char *name)
329 mem_d((void*)self->name);
330 self->name = util_strdup(name);
334 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
336 return (ir_function*)util_htget(self->htfunctions, name);
339 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
341 ir_function *fn = ir_builder_get_function(self, name);
346 fn = ir_function_new(self, outtype);
347 if (!ir_function_set_name(fn, name))
349 ir_function_delete(fn);
352 vec_push(self->functions, fn);
353 util_htset(self->htfunctions, name, fn);
355 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
357 ir_function_delete(fn);
361 fn->value->hasvalue = true;
362 fn->value->outtype = outtype;
363 fn->value->constval.vfunc = fn;
364 fn->value->context = fn->context;
369 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
371 return (ir_value*)util_htget(self->htglobals, name);
374 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
378 if (name && name[0] != '#')
380 ve = ir_builder_get_global(self, name);
386 ve = ir_value_var(name, store_global, vtype);
387 vec_push(self->globals, ve);
388 util_htset(self->htglobals, name, ve);
392 ir_value* ir_builder_get_field(ir_builder *self, const char *name)
394 return (ir_value*)util_htget(self->htfields, name);
398 ir_value* ir_builder_create_field(ir_builder *self, const char *name, int vtype)
400 ir_value *ve = ir_builder_get_field(self, name);
405 ve = ir_value_var(name, store_global, TYPE_FIELD);
406 ve->fieldtype = vtype;
407 vec_push(self->fields, ve);
408 util_htset(self->htfields, name, ve);
412 /***********************************************************************
416 bool ir_function_naive_phi(ir_function*);
417 void ir_function_enumerate(ir_function*);
418 bool ir_function_calculate_liferanges(ir_function*);
419 bool ir_function_allocate_locals(ir_function*);
421 ir_function* ir_function_new(ir_builder* owner, int outtype)
424 self = (ir_function*)mem_a(sizeof(*self));
429 memset(self, 0, sizeof(*self));
432 if (!ir_function_set_name(self, "<@unnamed>")) {
437 self->context.file = "<@no context>";
438 self->context.line = 0;
439 self->outtype = outtype;
448 self->code_function_def = -1;
449 self->allocated_locals = 0;
455 bool ir_function_set_name(ir_function *self, const char *name)
458 mem_d((void*)self->name);
459 self->name = util_strdup(name);
463 static void ir_function_delete_quick(ir_function *self)
466 mem_d((void*)self->name);
468 for (i = 0; i != vec_size(self->blocks); ++i)
469 ir_block_delete_quick(self->blocks[i]);
470 vec_free(self->blocks);
472 vec_free(self->params);
474 for (i = 0; i != vec_size(self->values); ++i)
475 ir_value_delete(self->values[i]);
476 vec_free(self->values);
478 for (i = 0; i != vec_size(self->locals); ++i)
479 ir_value_delete(self->locals[i]);
480 vec_free(self->locals);
482 /* self->value is deleted by the builder */
487 void ir_function_delete(ir_function *self)
490 mem_d((void*)self->name);
492 for (i = 0; i != vec_size(self->blocks); ++i)
493 ir_block_delete(self->blocks[i]);
494 vec_free(self->blocks);
496 vec_free(self->params);
498 for (i = 0; i != vec_size(self->values); ++i)
499 ir_value_delete(self->values[i]);
500 vec_free(self->values);
502 for (i = 0; i != vec_size(self->locals); ++i)
503 ir_value_delete(self->locals[i]);
504 vec_free(self->locals);
506 /* self->value is deleted by the builder */
511 void ir_function_collect_value(ir_function *self, ir_value *v)
513 vec_push(self->values, v);
516 ir_block* ir_function_create_block(lex_ctx ctx, ir_function *self, const char *label)
518 ir_block* bn = ir_block_new(self, label);
520 vec_push(self->blocks, bn);
524 static bool instr_is_operation(uint16_t op)
526 return ( (op >= INSTR_MUL_F && op <= INSTR_GT) ||
527 (op >= INSTR_LOAD_F && op <= INSTR_LOAD_FNC) ||
528 (op == INSTR_ADDRESS) ||
529 (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) ||
530 (op >= INSTR_AND && op <= INSTR_BITOR) );
533 bool ir_function_pass_peephole(ir_function *self)
537 for (b = 0; b < vec_size(self->blocks); ++b) {
539 ir_block *block = self->blocks[b];
541 for (i = 0; i < vec_size(block->instr); ++i) {
543 inst = block->instr[i];
546 (inst->opcode >= INSTR_STORE_F &&
547 inst->opcode <= INSTR_STORE_FNC))
555 oper = block->instr[i-1];
556 if (!instr_is_operation(oper->opcode))
559 value = oper->_ops[0];
561 /* only do it for SSA values */
562 if (value->store != store_value)
565 /* don't optimize out the temp if it's used later again */
566 if (vec_size(value->reads) != 1)
569 /* The very next store must use this value */
570 if (value->reads[0] != store)
573 /* And of course the store must _read_ from it, so it's in
575 if (store->_ops[1] != value)
578 ++opts_optimizationcount[OPTIM_PEEPHOLE];
579 (void)!ir_instr_op(oper, 0, store->_ops[0], true);
581 vec_remove(block->instr, i, 1);
582 ir_instr_delete(store);
584 else if (inst->opcode == VINSTR_COND)
586 /* COND on a value resulting from a NOT could
587 * remove the NOT and swap its operands
594 value = inst->_ops[0];
596 if (value->store != store_value ||
597 vec_size(value->reads) != 1 ||
598 value->reads[0] != inst)
603 inot = value->writes[0];
604 if (inot->_ops[0] != value ||
605 inot->opcode < INSTR_NOT_F ||
606 inot->opcode > INSTR_NOT_FNC ||
607 inot->opcode == INSTR_NOT_V) /* can't do this one */
613 ++opts_optimizationcount[OPTIM_PEEPHOLE];
615 (void)!ir_instr_op(inst, 0, inot->_ops[1], false);
618 for (inotid = 0; inotid < vec_size(tmp->instr); ++inotid) {
619 if (tmp->instr[inotid] == inot)
622 if (inotid >= vec_size(tmp->instr)) {
623 compile_error(inst->context, "sanity-check failed: failed to find instruction to optimize out");
626 vec_remove(tmp->instr, inotid, 1);
627 ir_instr_delete(inot);
628 /* swap ontrue/onfalse */
630 inst->bops[0] = inst->bops[1];
641 bool ir_function_pass_tailcall(ir_function *self)
645 for (b = 0; b < vec_size(self->blocks); ++b) {
647 ir_instr *ret, *call, *store = NULL;
648 ir_block *block = self->blocks[b];
650 if (!block->final || vec_size(block->instr) < 2)
653 ret = block->instr[vec_size(block->instr)-1];
654 if (ret->opcode != INSTR_DONE && ret->opcode != INSTR_RETURN)
657 call = block->instr[vec_size(block->instr)-2];
658 if (call->opcode >= INSTR_STORE_F && call->opcode <= INSTR_STORE_FNC) {
659 /* account for the unoptimized
661 * STORE %return, %tmp
665 if (vec_size(block->instr) < 3)
669 call = block->instr[vec_size(block->instr)-3];
672 if (call->opcode < INSTR_CALL0 || call->opcode > INSTR_CALL8)
676 /* optimize out the STORE */
678 ret->_ops[0] == store->_ops[0] &&
679 store->_ops[1] == call->_ops[0])
681 ++opts_optimizationcount[OPTIM_PEEPHOLE];
682 call->_ops[0] = store->_ops[0];
683 vec_remove(block->instr, vec_size(block->instr) - 2, 1);
684 ir_instr_delete(store);
693 funcval = call->_ops[1];
696 if (funcval->vtype != TYPE_FUNCTION || funcval->constval.vfunc != self)
699 /* now we have a CALL and a RET, check if it's a tailcall */
700 if (ret->_ops[0] && call->_ops[0] != ret->_ops[0])
703 ++opts_optimizationcount[OPTIM_TAIL_RECURSION];
704 vec_shrinkby(block->instr, 2);
706 block->final = false; /* open it back up */
708 /* emite parameter-stores */
709 for (p = 0; p < vec_size(call->params); ++p) {
710 /* assert(call->params_count <= self->locals_count); */
711 if (!ir_block_create_store(block, call->context, self->locals[p], call->params[p])) {
712 irerror(call->context, "failed to create tailcall store instruction for parameter %i", (int)p);
716 if (!ir_block_create_jump(block, call->context, self->blocks[0])) {
717 irerror(call->context, "failed to create tailcall jump");
721 ir_instr_delete(call);
722 ir_instr_delete(ret);
728 bool ir_function_finalize(ir_function *self)
733 if (OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
734 if (!ir_function_pass_peephole(self)) {
735 irerror(self->context, "generic optimization pass broke something in `%s`", self->name);
740 if (OPTS_OPTIMIZATION(OPTIM_TAIL_RECURSION)) {
741 if (!ir_function_pass_tailcall(self)) {
742 irerror(self->context, "tailcall optimization pass broke something in `%s`", self->name);
747 if (!ir_function_naive_phi(self))
750 ir_function_enumerate(self);
752 if (!ir_function_calculate_liferanges(self))
754 if (!ir_function_allocate_locals(self))
759 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
764 vec_size(self->locals) &&
765 self->locals[vec_size(self->locals)-1]->store != store_param) {
766 irerror(self->context, "cannot add parameters after adding locals");
770 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
771 vec_push(self->locals, ve);
775 /***********************************************************************
779 ir_block* ir_block_new(ir_function* owner, const char *name)
782 self = (ir_block*)mem_a(sizeof(*self));
786 memset(self, 0, sizeof(*self));
789 if (name && !ir_block_set_label(self, name)) {
794 self->context.file = "<@no context>";
795 self->context.line = 0;
799 self->entries = NULL;
803 self->is_return = false;
808 self->generated = false;
813 static void ir_block_delete_quick(ir_block* self)
816 if (self->label) mem_d(self->label);
817 for (i = 0; i != vec_size(self->instr); ++i)
818 ir_instr_delete_quick(self->instr[i]);
819 vec_free(self->instr);
820 vec_free(self->entries);
821 vec_free(self->exits);
822 vec_free(self->living);
826 void ir_block_delete(ir_block* self)
829 if (self->label) mem_d(self->label);
830 for (i = 0; i != vec_size(self->instr); ++i)
831 ir_instr_delete(self->instr[i]);
832 vec_free(self->instr);
833 vec_free(self->entries);
834 vec_free(self->exits);
835 vec_free(self->living);
839 bool ir_block_set_label(ir_block *self, const char *name)
842 mem_d((void*)self->label);
843 self->label = util_strdup(name);
844 return !!self->label;
847 /***********************************************************************
851 ir_instr* ir_instr_new(lex_ctx ctx, ir_block* owner, int op)
854 self = (ir_instr*)mem_a(sizeof(*self));
861 self->_ops[0] = NULL;
862 self->_ops[1] = NULL;
863 self->_ops[2] = NULL;
864 self->bops[0] = NULL;
865 self->bops[1] = NULL;
876 static void ir_instr_delete_quick(ir_instr *self)
879 vec_free(self->params);
883 void ir_instr_delete(ir_instr *self)
886 /* The following calls can only delete from
887 * vectors, we still want to delete this instruction
888 * so ignore the return value. Since with the warn_unused_result attribute
889 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
890 * I have to improvise here and use if(foo());
892 for (i = 0; i < vec_size(self->phi); ++i) {
894 if (vec_ir_instr_find(self->phi[i].value->writes, self, &idx))
895 vec_remove(self->phi[i].value->writes, idx, 1);
896 if (vec_ir_instr_find(self->phi[i].value->reads, self, &idx))
897 vec_remove(self->phi[i].value->reads, idx, 1);
900 for (i = 0; i < vec_size(self->params); ++i) {
902 if (vec_ir_instr_find(self->params[i]->writes, self, &idx))
903 vec_remove(self->params[i]->writes, idx, 1);
904 if (vec_ir_instr_find(self->params[i]->reads, self, &idx))
905 vec_remove(self->params[i]->reads, idx, 1);
907 vec_free(self->params);
908 (void)!ir_instr_op(self, 0, NULL, false);
909 (void)!ir_instr_op(self, 1, NULL, false);
910 (void)!ir_instr_op(self, 2, NULL, false);
914 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
916 if (self->_ops[op]) {
918 if (writing && vec_ir_instr_find(self->_ops[op]->writes, self, &idx))
919 vec_remove(self->_ops[op]->writes, idx, 1);
920 else if (vec_ir_instr_find(self->_ops[op]->reads, self, &idx))
921 vec_remove(self->_ops[op]->reads, idx, 1);
925 vec_push(v->writes, self);
927 vec_push(v->reads, self);
933 /***********************************************************************
937 void ir_value_code_setaddr(ir_value *self, int32_t gaddr)
939 self->code.globaladdr = gaddr;
940 if (self->members[0]) self->members[0]->code.globaladdr = gaddr;
941 if (self->members[1]) self->members[1]->code.globaladdr = gaddr;
942 if (self->members[2]) self->members[2]->code.globaladdr = gaddr;
945 int32_t ir_value_code_addr(const ir_value *self)
947 if (self->store == store_return)
948 return OFS_RETURN + self->code.addroffset;
949 return self->code.globaladdr + self->code.addroffset;
952 ir_value* ir_value_var(const char *name, int storetype, int vtype)
955 self = (ir_value*)mem_a(sizeof(*self));
957 self->fieldtype = TYPE_VOID;
958 self->outtype = TYPE_VOID;
959 self->store = storetype;
965 self->hasvalue = false;
966 self->context.file = "<@no context>";
967 self->context.line = 0;
969 if (name && !ir_value_set_name(self, name)) {
970 irerror(self->context, "out of memory");
975 memset(&self->constval, 0, sizeof(self->constval));
976 memset(&self->code, 0, sizeof(self->code));
978 self->members[0] = NULL;
979 self->members[1] = NULL;
980 self->members[2] = NULL;
981 self->memberof = NULL;
983 self->unique_life = false;
989 ir_value* ir_value_vector_member(ir_value *self, unsigned int member)
997 if (self->members[member])
998 return self->members[member];
1000 len = strlen(self->name);
1001 name = (char*)mem_a(len + 3);
1002 memcpy(name, self->name, len);
1004 name[len+1] = 'x' + member;
1006 if (self->vtype == TYPE_VECTOR)
1008 m = ir_value_var(name, self->store, TYPE_FLOAT);
1012 m->context = self->context;
1014 self->members[member] = m;
1015 m->code.addroffset = member;
1017 else if (self->vtype == TYPE_FIELD)
1019 if (self->fieldtype != TYPE_VECTOR)
1021 m = ir_value_var(name, self->store, TYPE_FIELD);
1025 m->fieldtype = TYPE_FLOAT;
1026 m->context = self->context;
1028 self->members[member] = m;
1029 m->code.addroffset = member;
1033 irerror(self->context, "invalid member access on %s", self->name);
1041 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
1043 ir_value *v = ir_value_var(name, storetype, vtype);
1046 ir_function_collect_value(owner, v);
1050 void ir_value_delete(ir_value* self)
1054 mem_d((void*)self->name);
1057 if (self->vtype == TYPE_STRING)
1058 mem_d((void*)self->constval.vstring);
1060 for (i = 0; i < 3; ++i) {
1061 if (self->members[i])
1062 ir_value_delete(self->members[i]);
1064 vec_free(self->reads);
1065 vec_free(self->writes);
1066 vec_free(self->life);
1070 bool ir_value_set_name(ir_value *self, const char *name)
1073 mem_d((void*)self->name);
1074 self->name = util_strdup(name);
1075 return !!self->name;
1078 bool ir_value_set_float(ir_value *self, float f)
1080 if (self->vtype != TYPE_FLOAT)
1082 self->constval.vfloat = f;
1083 self->hasvalue = true;
1087 bool ir_value_set_func(ir_value *self, int f)
1089 if (self->vtype != TYPE_FUNCTION)
1091 self->constval.vint = f;
1092 self->hasvalue = true;
1096 bool ir_value_set_vector(ir_value *self, vector v)
1098 if (self->vtype != TYPE_VECTOR)
1100 self->constval.vvec = v;
1101 self->hasvalue = true;
1105 bool ir_value_set_field(ir_value *self, ir_value *fld)
1107 if (self->vtype != TYPE_FIELD)
1109 self->constval.vpointer = fld;
1110 self->hasvalue = true;
1114 static char *ir_strdup(const char *str)
1117 /* actually dup empty strings */
1118 char *out = mem_a(1);
1122 return util_strdup(str);
1125 bool ir_value_set_string(ir_value *self, const char *str)
1127 if (self->vtype != TYPE_STRING)
1129 self->constval.vstring = ir_strdup(str);
1130 self->hasvalue = true;
1135 bool ir_value_set_int(ir_value *self, int i)
1137 if (self->vtype != TYPE_INTEGER)
1139 self->constval.vint = i;
1140 self->hasvalue = true;
1145 bool ir_value_lives(ir_value *self, size_t at)
1148 for (i = 0; i < vec_size(self->life); ++i)
1150 ir_life_entry_t *life = &self->life[i];
1151 if (life->start <= at && at <= life->end)
1153 if (life->start > at) /* since it's ordered */
1159 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
1162 vec_push(self->life, e);
1163 for (k = vec_size(self->life)-1; k > idx; --k)
1164 self->life[k] = self->life[k-1];
1165 self->life[idx] = e;
1169 bool ir_value_life_merge(ir_value *self, size_t s)
1172 ir_life_entry_t *life = NULL;
1173 ir_life_entry_t *before = NULL;
1174 ir_life_entry_t new_entry;
1176 /* Find the first range >= s */
1177 for (i = 0; i < vec_size(self->life); ++i)
1180 life = &self->life[i];
1181 if (life->start > s)
1184 /* nothing found? append */
1185 if (i == vec_size(self->life)) {
1187 if (life && life->end+1 == s)
1189 /* previous life range can be merged in */
1193 if (life && life->end >= s)
1195 e.start = e.end = s;
1196 vec_push(self->life, e);
1202 if (before->end + 1 == s &&
1203 life->start - 1 == s)
1206 before->end = life->end;
1207 vec_remove(self->life, i, 1);
1210 if (before->end + 1 == s)
1216 /* already contained */
1217 if (before->end >= s)
1221 if (life->start - 1 == s)
1226 /* insert a new entry */
1227 new_entry.start = new_entry.end = s;
1228 return ir_value_life_insert(self, i, new_entry);
1231 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
1235 if (!vec_size(other->life))
1238 if (!vec_size(self->life)) {
1239 size_t count = vec_size(other->life);
1240 ir_life_entry_t *life = vec_add(self->life, count);
1241 memcpy(life, other->life, count * sizeof(*life));
1246 for (i = 0; i < vec_size(other->life); ++i)
1248 const ir_life_entry_t *life = &other->life[i];
1251 ir_life_entry_t *entry = &self->life[myi];
1253 if (life->end+1 < entry->start)
1255 /* adding an interval before entry */
1256 if (!ir_value_life_insert(self, myi, *life))
1262 if (life->start < entry->start &&
1263 life->end+1 >= entry->start)
1265 /* starts earlier and overlaps */
1266 entry->start = life->start;
1269 if (life->end > entry->end &&
1270 life->start <= entry->end+1)
1272 /* ends later and overlaps */
1273 entry->end = life->end;
1276 /* see if our change combines it with the next ranges */
1277 while (myi+1 < vec_size(self->life) &&
1278 entry->end+1 >= self->life[1+myi].start)
1280 /* overlaps with (myi+1) */
1281 if (entry->end < self->life[1+myi].end)
1282 entry->end = self->life[1+myi].end;
1283 vec_remove(self->life, myi+1, 1);
1284 entry = &self->life[myi];
1287 /* see if we're after the entry */
1288 if (life->start > entry->end)
1291 /* append if we're at the end */
1292 if (myi >= vec_size(self->life)) {
1293 vec_push(self->life, *life);
1296 /* otherweise check the next range */
1305 bool ir_values_overlap(const ir_value *a, const ir_value *b)
1307 /* For any life entry in A see if it overlaps with
1308 * any life entry in B.
1309 * Note that the life entries are orderes, so we can make a
1310 * more efficient algorithm there than naively translating the
1314 ir_life_entry_t *la, *lb, *enda, *endb;
1316 /* first of all, if either has no life range, they cannot clash */
1317 if (!vec_size(a->life) || !vec_size(b->life))
1322 enda = la + vec_size(a->life);
1323 endb = lb + vec_size(b->life);
1326 /* check if the entries overlap, for that,
1327 * both must start before the other one ends.
1329 if (la->start < lb->end &&
1330 lb->start < la->end)
1335 /* entries are ordered
1336 * one entry is earlier than the other
1337 * that earlier entry will be moved forward
1339 if (la->start < lb->start)
1341 /* order: A B, move A forward
1342 * check if we hit the end with A
1347 else /* if (lb->start < la->start) actually <= */
1349 /* order: B A, move B forward
1350 * check if we hit the end with B
1359 /***********************************************************************
1363 bool ir_block_create_store_op(ir_block *self, lex_ctx ctx, int op, ir_value *target, ir_value *what)
1367 irerror(self->context, "unreachable statement (%s)", self->label);
1371 if (target->store == store_value &&
1372 (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1374 irerror(self->context, "cannot store to an SSA value");
1375 irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1376 irerror(self->context, "instruction: %s", asm_instr[op].m);
1380 in = ir_instr_new(ctx, self, op);
1384 if (!ir_instr_op(in, 0, target, true) ||
1385 !ir_instr_op(in, 1, what, false))
1387 ir_instr_delete(in);
1390 vec_push(self->instr, in);
1394 bool ir_block_create_store(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1398 if (target->vtype == TYPE_VARIANT)
1399 vtype = what->vtype;
1401 vtype = target->vtype;
1404 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
1405 op = INSTR_CONV_ITOF;
1406 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1407 op = INSTR_CONV_FTOI;
1409 op = type_store_instr[vtype];
1411 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1412 if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1416 return ir_block_create_store_op(self, ctx, op, target, what);
1419 bool ir_block_create_storep(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1424 if (target->vtype != TYPE_POINTER)
1427 /* storing using pointer - target is a pointer, type must be
1428 * inferred from source
1430 vtype = what->vtype;
1432 op = type_storep_instr[vtype];
1433 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1434 if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1435 op = INSTR_STOREP_V;
1438 return ir_block_create_store_op(self, ctx, op, target, what);
1441 bool ir_block_create_return(ir_block *self, lex_ctx ctx, ir_value *v)
1445 irerror(self->context, "unreachable statement (%s)", self->label);
1449 self->is_return = true;
1450 in = ir_instr_new(ctx, self, INSTR_RETURN);
1454 if (v && !ir_instr_op(in, 0, v, false)) {
1455 ir_instr_delete(in);
1459 vec_push(self->instr, in);
1463 bool ir_block_create_if(ir_block *self, lex_ctx ctx, ir_value *v,
1464 ir_block *ontrue, ir_block *onfalse)
1468 irerror(self->context, "unreachable statement (%s)", self->label);
1472 /*in = ir_instr_new(ctx, self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1473 in = ir_instr_new(ctx, self, VINSTR_COND);
1477 if (!ir_instr_op(in, 0, v, false)) {
1478 ir_instr_delete(in);
1482 in->bops[0] = ontrue;
1483 in->bops[1] = onfalse;
1485 vec_push(self->instr, in);
1487 vec_push(self->exits, ontrue);
1488 vec_push(self->exits, onfalse);
1489 vec_push(ontrue->entries, self);
1490 vec_push(onfalse->entries, self);
1494 bool ir_block_create_jump(ir_block *self, lex_ctx ctx, ir_block *to)
1498 irerror(self->context, "unreachable statement (%s)", self->label);
1502 in = ir_instr_new(ctx, self, VINSTR_JUMP);
1507 vec_push(self->instr, in);
1509 vec_push(self->exits, to);
1510 vec_push(to->entries, self);
1514 bool ir_block_create_goto(ir_block *self, lex_ctx ctx, ir_block *to)
1518 irerror(self->context, "unreachable statement (%s)", self->label);
1522 in = ir_instr_new(ctx, self, INSTR_GOTO);
1527 vec_push(self->instr, in);
1529 vec_push(self->exits, to);
1530 vec_push(to->entries, self);
1534 ir_instr* ir_block_create_phi(ir_block *self, lex_ctx ctx, const char *label, int ot)
1539 irerror(self->context, "unreachable statement (%s)", self->label);
1542 in = ir_instr_new(ctx, self, VINSTR_PHI);
1545 out = ir_value_out(self->owner, label, store_value, ot);
1547 ir_instr_delete(in);
1550 if (!ir_instr_op(in, 0, out, true)) {
1551 ir_instr_delete(in);
1552 ir_value_delete(out);
1555 vec_push(self->instr, in);
1559 ir_value* ir_phi_value(ir_instr *self)
1561 return self->_ops[0];
1564 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1568 if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1569 /* Must not be possible to cause this, otherwise the AST
1570 * is doing something wrong.
1572 irerror(self->context, "Invalid entry block for PHI");
1578 vec_push(v->reads, self);
1579 vec_push(self->phi, pe);
1582 /* call related code */
1583 ir_instr* ir_block_create_call(ir_block *self, lex_ctx ctx, const char *label, ir_value *func, bool noreturn)
1588 irerror(self->context, "unreachable statement (%s)", self->label);
1591 in = ir_instr_new(ctx, self, (noreturn ? VINSTR_NRCALL : INSTR_CALL0));
1596 self->is_return = true;
1598 out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1600 ir_instr_delete(in);
1603 if (!ir_instr_op(in, 0, out, true) ||
1604 !ir_instr_op(in, 1, func, false))
1606 ir_instr_delete(in);
1607 ir_value_delete(out);
1610 vec_push(self->instr, in);
1614 ir_value* ir_call_value(ir_instr *self)
1616 return self->_ops[0];
1619 void ir_call_param(ir_instr* self, ir_value *v)
1621 vec_push(self->params, v);
1622 vec_push(v->reads, self);
1625 /* binary op related code */
1627 ir_value* ir_block_create_binop(ir_block *self, lex_ctx ctx,
1628 const char *label, int opcode,
1629 ir_value *left, ir_value *right)
1651 case INSTR_SUB_S: /* -- offset of string as float */
1656 case INSTR_BITOR_IF:
1657 case INSTR_BITOR_FI:
1658 case INSTR_BITAND_FI:
1659 case INSTR_BITAND_IF:
1674 case INSTR_BITAND_I:
1677 case INSTR_RSHIFT_I:
1678 case INSTR_LSHIFT_I:
1700 /* boolean operations result in floats */
1701 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1703 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1706 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1711 if (ot == TYPE_VOID) {
1712 /* The AST or parser were supposed to check this! */
1716 return ir_block_create_general_instr(self, ctx, label, opcode, left, right, ot);
1719 ir_value* ir_block_create_unary(ir_block *self, lex_ctx ctx,
1720 const char *label, int opcode,
1723 int ot = TYPE_FLOAT;
1735 /* QC doesn't have other unary operations. We expect extensions to fill
1736 * the above list, otherwise we assume out-type = in-type, eg for an
1740 ot = operand->vtype;
1743 if (ot == TYPE_VOID) {
1744 /* The AST or parser were supposed to check this! */
1748 /* let's use the general instruction creator and pass NULL for OPB */
1749 return ir_block_create_general_instr(self, ctx, label, opcode, operand, NULL, ot);
1752 ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx ctx, const char *label,
1753 int op, ir_value *a, ir_value *b, int outype)
1758 out = ir_value_out(self->owner, label, store_value, outype);
1762 instr = ir_instr_new(ctx, self, op);
1764 ir_value_delete(out);
1768 if (!ir_instr_op(instr, 0, out, true) ||
1769 !ir_instr_op(instr, 1, a, false) ||
1770 !ir_instr_op(instr, 2, b, false) )
1775 vec_push(self->instr, instr);
1779 ir_instr_delete(instr);
1780 ir_value_delete(out);
1784 ir_value* ir_block_create_fieldaddress(ir_block *self, lex_ctx ctx, const char *label, ir_value *ent, ir_value *field)
1788 /* Support for various pointer types todo if so desired */
1789 if (ent->vtype != TYPE_ENTITY)
1792 if (field->vtype != TYPE_FIELD)
1795 v = ir_block_create_general_instr(self, ctx, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1796 v->fieldtype = field->fieldtype;
1800 ir_value* ir_block_create_load_from_ent(ir_block *self, lex_ctx ctx, const char *label, ir_value *ent, ir_value *field, int outype)
1803 if (ent->vtype != TYPE_ENTITY)
1806 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1807 if (field->vtype != TYPE_FIELD)
1812 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1813 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1814 case TYPE_STRING: op = INSTR_LOAD_S; break;
1815 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1816 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1817 case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1819 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1820 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1823 irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1827 return ir_block_create_general_instr(self, ctx, label, op, ent, field, outype);
1830 ir_value* ir_block_create_add(ir_block *self, lex_ctx ctx,
1832 ir_value *left, ir_value *right)
1835 int l = left->vtype;
1836 int r = right->vtype;
1840 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1856 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1858 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1863 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1867 return ir_block_create_binop(self, ctx, label, op, left, right);
1870 ir_value* ir_block_create_sub(ir_block *self, lex_ctx ctx,
1872 ir_value *left, ir_value *right)
1875 int l = left->vtype;
1876 int r = right->vtype;
1881 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1897 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1899 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1904 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1908 return ir_block_create_binop(self, ctx, label, op, left, right);
1911 ir_value* ir_block_create_mul(ir_block *self, lex_ctx ctx,
1913 ir_value *left, ir_value *right)
1916 int l = left->vtype;
1917 int r = right->vtype;
1922 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1937 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1939 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1942 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1944 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1946 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1948 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1952 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1956 return ir_block_create_binop(self, ctx, label, op, left, right);
1959 ir_value* ir_block_create_div(ir_block *self, lex_ctx ctx,
1961 ir_value *left, ir_value *right)
1964 int l = left->vtype;
1965 int r = right->vtype;
1970 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1983 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1985 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1987 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1992 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1996 return ir_block_create_binop(self, ctx, label, op, left, right);
1999 /* PHI resolving breaks the SSA, and must thus be the last
2000 * step before life-range calculation.
2003 static bool ir_block_naive_phi(ir_block *self);
2004 bool ir_function_naive_phi(ir_function *self)
2008 for (i = 0; i < vec_size(self->blocks); ++i)
2010 if (!ir_block_naive_phi(self->blocks[i]))
2017 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
2022 /* create a store */
2023 if (!ir_block_create_store(block, old, what))
2026 /* we now move it up */
2027 instr = vec_last(block->instr);
2028 for (i = vec_size(block->instr)-1; i > iid; --i)
2029 block->instr[i] = block->instr[i-1];
2030 block->instr[i] = instr;
2036 static bool ir_block_naive_phi(ir_block *self)
2038 size_t i, p; /*, w;*/
2039 /* FIXME: optionally, create_phi can add the phis
2040 * to a list so we don't need to loop through blocks
2041 * - anyway: "don't optimize YET"
2043 for (i = 0; i < vec_size(self->instr); ++i)
2045 ir_instr *instr = self->instr[i];
2046 if (instr->opcode != VINSTR_PHI)
2049 vec_remove(self->instr, i, 1);
2050 --i; /* NOTE: i+1 below */
2052 for (p = 0; p < vec_size(instr->phi); ++p)
2054 ir_value *v = instr->phi[p].value;
2055 ir_block *b = instr->phi[p].from;
2057 if (v->store == store_value &&
2058 vec_size(v->reads) == 1 &&
2059 vec_size(v->writes) == 1)
2061 /* replace the value */
2062 if (!ir_instr_op(v->writes[0], 0, instr->_ops[0], true))
2067 /* force a move instruction */
2068 ir_instr *prevjump = vec_last(b->instr);
2071 instr->_ops[0]->store = store_global;
2072 if (!ir_block_create_store(b, instr->context, instr->_ops[0], v))
2074 instr->_ops[0]->store = store_value;
2075 vec_push(b->instr, prevjump);
2080 ir_value *v = instr->phi[p].value;
2081 for (w = 0; w < vec_size(v->writes); ++w) {
2084 if (!v->writes[w]->_ops[0])
2087 /* When the write was to a global, we have to emit a mov */
2088 old = v->writes[w]->_ops[0];
2090 /* The original instruction now writes to the PHI target local */
2091 if (v->writes[w]->_ops[0] == v)
2092 v->writes[w]->_ops[0] = instr->_ops[0];
2094 if (old->store != store_value && old->store != store_local && old->store != store_param)
2096 /* If it originally wrote to a global we need to store the value
2099 if (!ir_naive_phi_emit_store(self, i+1, old, v))
2101 if (i+1 < vec_size(self->instr))
2102 instr = self->instr[i+1];
2105 /* In case I forget and access instr later, it'll be NULL
2106 * when it's a problem, to make sure we crash, rather than accessing
2112 /* If it didn't, we can replace all reads by the phi target now. */
2114 for (r = 0; r < vec_size(old->reads); ++r)
2117 ir_instr *ri = old->reads[r];
2118 for (op = 0; op < vec_size(ri->phi); ++op) {
2119 if (ri->phi[op].value == old)
2120 ri->phi[op].value = v;
2122 for (op = 0; op < 3; ++op) {
2123 if (ri->_ops[op] == old)
2131 ir_instr_delete(instr);
2136 /***********************************************************************
2137 *IR Temp allocation code
2138 * Propagating value life ranges by walking through the function backwards
2139 * until no more changes are made.
2140 * In theory this should happen once more than once for every nested loop
2142 * Though this implementation might run an additional time for if nests.
2145 /* Enumerate instructions used by value's life-ranges
2147 static void ir_block_enumerate(ir_block *self, size_t *_eid)
2151 for (i = 0; i < vec_size(self->instr); ++i)
2153 self->instr[i]->eid = eid++;
2158 /* Enumerate blocks and instructions.
2159 * The block-enumeration is unordered!
2160 * We do not really use the block enumreation, however
2161 * the instruction enumeration is important for life-ranges.
2163 void ir_function_enumerate(ir_function *self)
2166 size_t instruction_id = 0;
2167 for (i = 0; i < vec_size(self->blocks); ++i)
2169 self->blocks[i]->eid = i;
2170 self->blocks[i]->run_id = 0;
2171 ir_block_enumerate(self->blocks[i], &instruction_id);
2175 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
2176 bool ir_function_calculate_liferanges(ir_function *self)
2184 for (i = 0; i != vec_size(self->blocks); ++i)
2186 if (self->blocks[i]->is_return)
2188 vec_free(self->blocks[i]->living);
2189 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
2194 if (vec_size(self->blocks)) {
2195 ir_block *block = self->blocks[0];
2196 for (i = 0; i < vec_size(block->living); ++i) {
2197 ir_value *v = block->living[i];
2198 if (v->store != store_local)
2200 if ((v->members[0] && v->members[1] && v->members[2])) {
2201 /* all vector members have been accessed - only treat this as uninitialized
2202 * if any of them is also uninitialized.
2204 if (!vec_ir_value_find(block->living, v->members[0], NULL) &&
2205 !vec_ir_value_find(block->living, v->members[1], NULL) &&
2206 !vec_ir_value_find(block->living, v->members[2], NULL))
2212 /* A member is only uninitialized if the whole vector is also uninitialized */
2213 if (!vec_ir_value_find(block->living, v->memberof, NULL))
2216 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2217 "variable `%s` may be used uninitialized in this function", v->name))
2226 /* Local-value allocator
2227 * After finishing creating the liferange of all values used in a function
2228 * we can allocate their global-positions.
2229 * This is the counterpart to register-allocation in register machines.
2236 } function_allocator;
2238 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
2241 size_t vsize = type_sizeof[var->vtype];
2243 slot = ir_value_var("reg", store_global, var->vtype);
2247 if (!ir_value_life_merge_into(slot, var))
2250 vec_push(alloc->locals, slot);
2251 vec_push(alloc->sizes, vsize);
2252 vec_push(alloc->unique, var->unique_life);
2257 ir_value_delete(slot);
2261 bool ir_function_allocate_locals(ir_function *self)
2270 function_allocator alloc;
2272 if (!vec_size(self->locals) && !vec_size(self->values))
2275 alloc.locals = NULL;
2277 alloc.positions = NULL;
2278 alloc.unique = NULL;
2280 for (i = 0; i < vec_size(self->locals); ++i)
2282 if (!OPTS_OPTIMIZATION(OPTIM_LOCALTEMPS))
2283 self->locals[i]->unique_life = true;
2284 if (!function_allocator_alloc(&alloc, self->locals[i]))
2288 /* Allocate a slot for any value that still exists */
2289 for (i = 0; i < vec_size(self->values); ++i)
2291 v = self->values[i];
2293 if (!vec_size(v->life))
2296 for (a = 0; a < vec_size(alloc.locals); ++a)
2298 /* if it's reserved for a unique liferange: skip */
2299 if (alloc.unique[a])
2302 slot = alloc.locals[a];
2304 /* never resize parameters
2305 * will be required later when overlapping temps + locals
2307 if (a < vec_size(self->params) &&
2308 alloc.sizes[a] < type_sizeof[v->vtype])
2313 if (ir_values_overlap(v, slot))
2316 if (!ir_value_life_merge_into(slot, v))
2319 /* adjust size for this slot */
2320 if (alloc.sizes[a] < type_sizeof[v->vtype])
2321 alloc.sizes[a] = type_sizeof[v->vtype];
2323 self->values[i]->code.local = a;
2326 if (a >= vec_size(alloc.locals)) {
2327 self->values[i]->code.local = vec_size(alloc.locals);
2328 if (!function_allocator_alloc(&alloc, v))
2337 /* Adjust slot positions based on sizes */
2338 vec_push(alloc.positions, 0);
2340 if (vec_size(alloc.sizes))
2341 pos = alloc.positions[0] + alloc.sizes[0];
2344 for (i = 1; i < vec_size(alloc.sizes); ++i)
2346 pos = alloc.positions[i-1] + alloc.sizes[i-1];
2347 vec_push(alloc.positions, pos);
2350 self->allocated_locals = pos + vec_last(alloc.sizes);
2352 /* Locals need to know their new position */
2353 for (i = 0; i < vec_size(self->locals); ++i) {
2354 self->locals[i]->code.local = alloc.positions[i];
2356 /* Take over the actual slot positions on values */
2357 for (i = 0; i < vec_size(self->values); ++i) {
2358 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
2366 for (i = 0; i < vec_size(alloc.locals); ++i)
2367 ir_value_delete(alloc.locals[i]);
2368 vec_free(alloc.locals);
2369 vec_free(alloc.sizes);
2370 vec_free(alloc.positions);
2374 /* Get information about which operand
2375 * is read from, or written to.
2377 static void ir_op_read_write(int op, size_t *read, size_t *write)
2397 case INSTR_STOREP_F:
2398 case INSTR_STOREP_V:
2399 case INSTR_STOREP_S:
2400 case INSTR_STOREP_ENT:
2401 case INSTR_STOREP_FLD:
2402 case INSTR_STOREP_FNC:
2413 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2416 bool changed = false;
2418 for (i = 0; i != vec_size(self->living); ++i)
2420 tempbool = ir_value_life_merge(self->living[i], eid);
2423 irerror(self->context, "block_living_add_instr() value instruction added %s: %i", self->living[i]->_name, (int)eid);
2425 changed = changed || tempbool;
2430 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
2436 /* values which have been read in a previous iteration are now
2437 * in the "living" array even if the previous block doesn't use them.
2438 * So we have to remove whatever does not exist in the previous block.
2439 * They will be re-added on-read, but the liferange merge won't cause
2441 for (i = 0; i < vec_size(self->living); ++i)
2443 if (!vec_ir_value_find(prev->living, self->living[i], NULL)) {
2444 vec_remove(self->living, i, 1);
2450 /* Whatever the previous block still has in its living set
2451 * must now be added to ours as well.
2453 for (i = 0; i < vec_size(prev->living); ++i)
2455 if (vec_ir_value_find(self->living, prev->living[i], NULL))
2457 vec_push(self->living, prev->living[i]);
2459 irerror(self->contextt from prev: %s", self->label, prev->living[i]->_name);
2465 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
2471 /* bitmasks which operands are read from or written to */
2473 char dbg_ind[16] = { '#', '0' };
2478 if (!ir_block_life_prop_previous(self, prev, changed))
2482 i = vec_size(self->instr);
2485 instr = self->instr[i];
2487 /* PHI operands are always read operands */
2488 for (p = 0; p < vec_size(instr->phi); ++p)
2490 value = instr->phi[p].value;
2491 if (!vec_ir_value_find(self->living, value, NULL))
2492 vec_push(self->living, value);
2495 /* call params are read operands too */
2496 for (p = 0; p < vec_size(instr->params); ++p)
2498 value = instr->params[p];
2499 if (!vec_ir_value_find(self->living, value, NULL))
2500 vec_push(self->living, value);
2503 /* See which operands are read and write operands */
2504 ir_op_read_write(instr->opcode, &read, &write);
2506 if (instr->opcode == INSTR_MUL_VF)
2508 /* the float source will get an additional lifetime */
2509 tempbool = ir_value_life_merge(instr->_ops[2], instr->eid+1);
2510 *changed = *changed || tempbool;
2512 else if (instr->opcode == INSTR_MUL_FV)
2514 /* the float source will get an additional lifetime */
2515 tempbool = ir_value_life_merge(instr->_ops[1], instr->eid+1);
2516 *changed = *changed || tempbool;
2519 /* Go through the 3 main operands */
2520 for (o = 0; o < 3; ++o)
2522 if (!instr->_ops[o]) /* no such operand */
2525 value = instr->_ops[o];
2527 /* We only care about locals */
2528 /* we also calculate parameter liferanges so that locals
2529 * can take up parameter slots */
2530 if (value->store != store_value &&
2531 value->store != store_local &&
2532 value->store != store_param)
2538 if (!vec_ir_value_find(self->living, value, NULL))
2539 vec_push(self->living, value);
2542 /* write operands */
2543 /* When we write to a local, we consider it "dead" for the
2544 * remaining upper part of the function, since in SSA a value
2545 * can only be written once (== created)
2550 bool in_living = vec_ir_value_find(self->living, value, &idx);
2553 /* If the value isn't alive it hasn't been read before... */
2554 /* TODO: See if the warning can be emitted during parsing or AST processing
2555 * otherwise have warning printed here.
2556 * IF printing a warning here: include filecontext_t,
2557 * and make sure it's only printed once
2558 * since this function is run multiple times.
2560 /* For now: debug info: */
2561 /* con_err( "Value only written %s\n", value->name); */
2562 tempbool = ir_value_life_merge(value, instr->eid);
2563 *changed = *changed || tempbool;
2565 ir_instr_dump(instr, dbg_ind, printf);
2569 /* since 'living' won't contain it
2570 * anymore, merge the value, since
2573 tempbool = ir_value_life_merge(value, instr->eid);
2576 con_err( "value added id %s %i\n", value->name, (int)instr->eid);
2578 *changed = *changed || tempbool;
2580 vec_remove(self->living, idx, 1);
2585 tempbool = ir_block_living_add_instr(self, instr->eid);
2586 /*con_err( "living added values\n");*/
2587 *changed = *changed || tempbool;
2591 if (self->run_id == self->owner->run_id)
2594 self->run_id = self->owner->run_id;
2596 for (i = 0; i < vec_size(self->entries); ++i)
2598 ir_block *entry = self->entries[i];
2599 ir_block_life_propagate(entry, self, changed);
2605 /***********************************************************************
2608 * Since the IR has the convention of putting 'write' operands
2609 * at the beginning, we have to rotate the operands of instructions
2610 * properly in order to generate valid QCVM code.
2612 * Having destinations at a fixed position is more convenient. In QC
2613 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2614 * read from from OPA, and store to OPB rather than OPC. Which is
2615 * partially the reason why the implementation of these instructions
2616 * in darkplaces has been delayed for so long.
2618 * Breaking conventions is annoying...
2620 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2622 static bool gen_global_field(ir_value *global)
2624 if (global->hasvalue)
2626 ir_value *fld = global->constval.vpointer;
2628 irerror(global->context, "Invalid field constant with no field: %s", global->name);
2632 /* copy the field's value */
2633 ir_value_code_setaddr(global, vec_size(code_globals));
2634 vec_push(code_globals, fld->code.fieldaddr);
2635 if (global->fieldtype == TYPE_VECTOR) {
2636 vec_push(code_globals, fld->code.fieldaddr+1);
2637 vec_push(code_globals, fld->code.fieldaddr+2);
2642 ir_value_code_setaddr(global, vec_size(code_globals));
2643 vec_push(code_globals, 0);
2644 if (global->fieldtype == TYPE_VECTOR) {
2645 vec_push(code_globals, 0);
2646 vec_push(code_globals, 0);
2649 if (global->code.globaladdr < 0)
2654 static bool gen_global_pointer(ir_value *global)
2656 if (global->hasvalue)
2658 ir_value *target = global->constval.vpointer;
2660 irerror(global->context, "Invalid pointer constant: %s", global->name);
2661 /* NULL pointers are pointing to the NULL constant, which also
2662 * sits at address 0, but still has an ir_value for itself.
2667 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2668 * void() foo; <- proto
2669 * void() *fooptr = &foo;
2670 * void() foo = { code }
2672 if (!target->code.globaladdr) {
2673 /* FIXME: Check for the constant nullptr ir_value!
2674 * because then code.globaladdr being 0 is valid.
2676 irerror(global->context, "FIXME: Relocation support");
2680 ir_value_code_setaddr(global, vec_size(code_globals));
2681 vec_push(code_globals, target->code.globaladdr);
2685 ir_value_code_setaddr(global, vec_size(code_globals));
2686 vec_push(code_globals, 0);
2688 if (global->code.globaladdr < 0)
2693 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2695 prog_section_statement stmt;
2704 block->generated = true;
2705 block->code_start = vec_size(code_statements);
2706 for (i = 0; i < vec_size(block->instr); ++i)
2708 instr = block->instr[i];
2710 if (instr->opcode == VINSTR_PHI) {
2711 irerror(block->context, "cannot generate virtual instruction (phi)");
2715 if (instr->opcode == VINSTR_JUMP) {
2716 target = instr->bops[0];
2717 /* for uncoditional jumps, if the target hasn't been generated
2718 * yet, we generate them right here.
2720 if (!target->generated) {
2725 /* otherwise we generate a jump instruction */
2726 stmt.opcode = INSTR_GOTO;
2727 stmt.o1.s1 = (target->code_start) - vec_size(code_statements);
2730 if (stmt.o1.s1 != 1)
2731 code_push_statement(&stmt, instr->context.line);
2733 /* no further instructions can be in this block */
2737 if (instr->opcode == VINSTR_COND) {
2738 ontrue = instr->bops[0];
2739 onfalse = instr->bops[1];
2740 /* TODO: have the AST signal which block should
2741 * come first: eg. optimize IFs without ELSE...
2744 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2748 if (ontrue->generated) {
2749 stmt.opcode = INSTR_IF;
2750 stmt.o2.s1 = (ontrue->code_start) - vec_size(code_statements);
2751 if (stmt.o2.s1 != 1)
2752 code_push_statement(&stmt, instr->context.line);
2754 if (onfalse->generated) {
2755 stmt.opcode = INSTR_IFNOT;
2756 stmt.o2.s1 = (onfalse->code_start) - vec_size(code_statements);
2757 if (stmt.o2.s1 != 1)
2758 code_push_statement(&stmt, instr->context.line);
2760 if (!ontrue->generated) {
2761 if (onfalse->generated) {
2766 if (!onfalse->generated) {
2767 if (ontrue->generated) {
2772 /* neither ontrue nor onfalse exist */
2773 stmt.opcode = INSTR_IFNOT;
2774 if (!instr->likely) {
2775 /* Honor the likelyhood hint */
2776 ir_block *tmp = onfalse;
2777 stmt.opcode = INSTR_IF;
2781 stidx = vec_size(code_statements);
2782 code_push_statement(&stmt, instr->context.line);
2783 /* on false we jump, so add ontrue-path */
2784 if (!gen_blocks_recursive(func, ontrue))
2786 /* fixup the jump address */
2787 code_statements[stidx].o2.s1 = vec_size(code_statements) - stidx;
2788 /* generate onfalse path */
2789 if (onfalse->generated) {
2790 /* fixup the jump address */
2791 code_statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2792 if (code_statements[stidx].o2.s1 == 1) {
2793 code_statements[stidx] = code_statements[stidx+1];
2794 if (code_statements[stidx].o1.s1 < 0)
2795 code_statements[stidx].o1.s1++;
2796 code_pop_statement();
2798 stmt.opcode = vec_last(code_statements).opcode;
2799 if (stmt.opcode == INSTR_GOTO ||
2800 stmt.opcode == INSTR_IF ||
2801 stmt.opcode == INSTR_IFNOT ||
2802 stmt.opcode == INSTR_RETURN ||
2803 stmt.opcode == INSTR_DONE)
2805 /* no use jumping from here */
2808 /* may have been generated in the previous recursive call */
2809 stmt.opcode = INSTR_GOTO;
2810 stmt.o1.s1 = (onfalse->code_start) - vec_size(code_statements);
2813 if (stmt.o1.s1 != 1)
2814 code_push_statement(&stmt, instr->context.line);
2817 else if (code_statements[stidx].o2.s1 == 1) {
2818 code_statements[stidx] = code_statements[stidx+1];
2819 if (code_statements[stidx].o1.s1 < 0)
2820 code_statements[stidx].o1.s1++;
2821 code_pop_statement();
2823 /* if not, generate now */
2828 if ( (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8)
2829 || instr->opcode == VINSTR_NRCALL)
2831 /* Trivial call translation:
2832 * copy all params to OFS_PARM*
2833 * if the output's storetype is not store_return,
2834 * add append a STORE instruction!
2836 * NOTES on how to do it better without much trouble:
2837 * -) The liferanges!
2838 * Simply check the liferange of all parameters for
2839 * other CALLs. For each param with no CALL in its
2840 * liferange, we can store it in an OFS_PARM at
2841 * generation already. This would even include later
2842 * reuse.... probably... :)
2847 first = vec_size(instr->params);
2850 for (p = 0; p < first; ++p)
2852 ir_value *param = instr->params[p];
2854 stmt.opcode = INSTR_STORE_F;
2857 if (param->vtype == TYPE_FIELD)
2858 stmt.opcode = field_store_instr[param->fieldtype];
2860 stmt.opcode = type_store_instr[param->vtype];
2861 stmt.o1.u1 = ir_value_code_addr(param);
2862 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2863 code_push_statement(&stmt, instr->context.line);
2865 /* Now handle extparams */
2866 first = vec_size(instr->params);
2867 for (; p < first; ++p)
2869 ir_builder *ir = func->owner;
2870 ir_value *param = instr->params[p];
2871 ir_value *targetparam;
2873 if (p-8 >= vec_size(ir->extparams))
2874 ir_gen_extparam(ir);
2876 targetparam = ir->extparams[p-8];
2878 stmt.opcode = INSTR_STORE_F;
2881 if (param->vtype == TYPE_FIELD)
2882 stmt.opcode = field_store_instr[param->fieldtype];
2884 stmt.opcode = type_store_instr[param->vtype];
2885 stmt.o1.u1 = ir_value_code_addr(param);
2886 stmt.o2.u1 = ir_value_code_addr(targetparam);
2887 code_push_statement(&stmt, instr->context.line);
2890 stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
2891 if (stmt.opcode > INSTR_CALL8)
2892 stmt.opcode = INSTR_CALL8;
2893 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2896 code_push_statement(&stmt, instr->context.line);
2898 retvalue = instr->_ops[0];
2899 if (retvalue && retvalue->store != store_return && vec_size(retvalue->life))
2901 /* not to be kept in OFS_RETURN */
2902 if (retvalue->vtype == TYPE_FIELD)
2903 stmt.opcode = field_store_instr[retvalue->vtype];
2905 stmt.opcode = type_store_instr[retvalue->vtype];
2906 stmt.o1.u1 = OFS_RETURN;
2907 stmt.o2.u1 = ir_value_code_addr(retvalue);
2909 code_push_statement(&stmt, instr->context.line);
2914 if (instr->opcode == INSTR_STATE) {
2915 irerror(block->context, "TODO: state instruction");
2919 stmt.opcode = instr->opcode;
2924 /* This is the general order of operands */
2926 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
2929 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2932 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
2934 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2936 stmt.o1.u1 = stmt.o3.u1;
2939 else if ((stmt.opcode >= INSTR_STORE_F &&
2940 stmt.opcode <= INSTR_STORE_FNC) ||
2941 (stmt.opcode >= INSTR_STOREP_F &&
2942 stmt.opcode <= INSTR_STOREP_FNC))
2944 /* 2-operand instructions with A -> B */
2945 stmt.o2.u1 = stmt.o3.u1;
2948 /* tiny optimization, don't output
2951 if (stmt.o2.u1 == stmt.o1.u1 &&
2952 OPTS_OPTIMIZATION(OPTIM_PEEPHOLE))
2954 ++opts_optimizationcount[OPTIM_PEEPHOLE];
2959 code_push_statement(&stmt, instr->context.line);
2964 static bool gen_function_code(ir_function *self)
2967 prog_section_statement stmt;
2969 /* Starting from entry point, we generate blocks "as they come"
2970 * for now. Dead blocks will not be translated obviously.
2972 if (!vec_size(self->blocks)) {
2973 irerror(self->context, "Function '%s' declared without body.", self->name);
2977 block = self->blocks[0];
2978 if (block->generated)
2981 if (!gen_blocks_recursive(self, block)) {
2982 irerror(self->context, "failed to generate blocks for '%s'", self->name);
2986 /* code_write and qcvm -disasm need to know that the function ends here */
2987 stmt.opcode = INSTR_DONE;
2991 code_push_statement(&stmt, vec_last(code_linenums));
2995 static qcint ir_builder_filestring(ir_builder *ir, const char *filename)
2997 /* NOTE: filename pointers are copied, we never strdup them,
2998 * thus we can use pointer-comparison to find the string.
3003 for (i = 0; i < vec_size(ir->filenames); ++i) {
3004 if (ir->filenames[i] == filename)
3005 return ir->filestrings[i];
3008 str = code_genstring(filename);
3009 vec_push(ir->filenames, filename);
3010 vec_push(ir->filestrings, str);
3014 static bool gen_global_function(ir_builder *ir, ir_value *global)
3016 prog_section_function fun;
3020 #ifndef NEW_ALLOC_STRAT
3021 size_t local_var_end;
3024 if (!global->hasvalue || (!global->constval.vfunc))
3026 irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
3030 irfun = global->constval.vfunc;
3032 fun.name = global->code.name;
3033 fun.file = ir_builder_filestring(ir, global->context.file);
3034 fun.profile = 0; /* always 0 */
3035 fun.nargs = vec_size(irfun->params);
3039 for (i = 0;i < 8; ++i) {
3040 if ((int32_t)i >= fun.nargs)
3043 fun.argsize[i] = type_sizeof[irfun->params[i]];
3046 fun.firstlocal = vec_size(code_globals);
3048 #ifndef NEW_ALLOC_STRAT
3049 local_var_end = fun.firstlocal;
3050 for (i = 0; i < vec_size(irfun->locals); ++i) {
3051 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3052 irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
3056 if (vec_size(irfun->locals)) {
3057 ir_value *last = vec_last(irfun->locals);
3058 local_var_end = last->code.globaladdr;
3059 if (last->vtype == TYPE_FIELD && last->fieldtype == TYPE_VECTOR)
3060 local_var_end += type_sizeof[TYPE_VECTOR];
3062 local_var_end += type_sizeof[last->vtype];
3064 for (i = 0; i < vec_size(irfun->values); ++i)
3066 /* generate code.globaladdr for ssa values */
3067 ir_value *v = irfun->values[i];
3068 ir_value_code_setaddr(v, local_var_end + v->code.local);
3070 for (i = 0; i < irfun->allocated_locals; ++i) {
3071 /* fill the locals with zeros */
3072 vec_push(code_globals, 0);
3075 fun.locals = vec_size(code_globals) - fun.firstlocal;
3077 fun.locals = irfun->allocated_locals;
3078 for (i = 0; i < vec_size(irfun->locals); ++i) {
3079 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3080 irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
3083 ir_value_code_setaddr(irfun->locals[i], fun.firstlocal + irfun->locals[i]->code.local);
3085 for (i = vec_size(code_globals) - fun.firstlocal; i < fun.locals; ++i) {
3086 vec_push(code_globals, 0);
3088 for (i = 0; i < vec_size(irfun->values); ++i)
3090 /* generate code.globaladdr for ssa values */
3091 ir_value *v = irfun->values[i];
3092 ir_value_code_setaddr(v, fun.firstlocal + v->code.local);
3097 fun.entry = irfun->builtin+1;
3099 irfun->code_function_def = vec_size(code_functions);
3100 fun.entry = vec_size(code_statements);
3103 vec_push(code_functions, fun);
3107 static void ir_gen_extparam(ir_builder *ir)
3109 prog_section_def def;
3113 snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparams)+8));
3114 global = ir_value_var(name, store_global, TYPE_VECTOR);
3116 def.name = code_genstring(name);
3117 def.type = TYPE_VECTOR;
3118 def.offset = vec_size(code_globals);
3120 vec_push(code_defs, def);
3121 ir_value_code_setaddr(global, def.offset);
3122 vec_push(code_globals, 0);
3123 vec_push(code_globals, 0);
3124 vec_push(code_globals, 0);
3126 vec_push(ir->extparams, global);
3129 static bool gen_function_extparam_copy(ir_function *self)
3131 size_t i, ext, numparams;
3133 ir_builder *ir = self->owner;
3135 prog_section_statement stmt;
3137 numparams = vec_size(self->params);
3141 stmt.opcode = INSTR_STORE_F;
3143 for (i = 8; i < numparams; ++i) {
3145 if (ext >= vec_size(ir->extparams))
3146 ir_gen_extparam(ir);
3148 ep = ir->extparams[ext];
3150 stmt.opcode = type_store_instr[self->locals[i]->vtype];
3151 if (self->locals[i]->vtype == TYPE_FIELD &&
3152 self->locals[i]->fieldtype == TYPE_VECTOR)
3154 stmt.opcode = INSTR_STORE_V;
3156 stmt.o1.u1 = ir_value_code_addr(ep);
3157 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3158 code_push_statement(&stmt, self->context.line);
3164 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
3166 prog_section_function *fundef;
3171 irfun = global->constval.vfunc;
3173 if (global->cvq == CV_NONE) {
3174 irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
3175 "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
3177 /* this was a function pointer, don't generate code for those */
3184 if (irfun->code_function_def < 0) {
3185 irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
3188 fundef = &code_functions[irfun->code_function_def];
3190 fundef->entry = vec_size(code_statements);
3191 if (!gen_function_extparam_copy(irfun)) {
3192 irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
3195 if (!gen_function_code(irfun)) {
3196 irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
3202 static void gen_vector_defs(prog_section_def def, const char *name)
3207 if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3210 def.type = TYPE_FLOAT;
3214 component = (char*)mem_a(len+3);
3215 memcpy(component, name, len);
3217 component[len-0] = 0;
3218 component[len-2] = '_';
3220 component[len-1] = 'x';
3222 for (i = 0; i < 3; ++i) {
3223 def.name = code_genstring(component);
3224 vec_push(code_defs, def);
3230 static void gen_vector_fields(prog_section_field fld, const char *name)
3235 if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3238 fld.type = TYPE_FLOAT;
3242 component = (char*)mem_a(len+3);
3243 memcpy(component, name, len);
3245 component[len-0] = 0;
3246 component[len-2] = '_';
3248 component[len-1] = 'x';
3250 for (i = 0; i < 3; ++i) {
3251 fld.name = code_genstring(component);
3252 vec_push(code_fields, fld);
3258 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
3262 prog_section_def def;
3264 def.type = global->vtype;
3265 def.offset = vec_size(code_globals);
3268 if (global->name[0] == '#') {
3269 if (!self->str_immediate)
3270 self->str_immediate = code_genstring("IMMEDIATE");
3271 def.name = global->code.name = self->str_immediate;
3274 def.name = global->code.name = code_genstring(global->name);
3279 switch (global->vtype)
3282 if (!strcmp(global->name, "end_sys_globals")) {
3283 /* TODO: remember this point... all the defs before this one
3284 * should be checksummed and added to progdefs.h when we generate it.
3287 else if (!strcmp(global->name, "end_sys_fields")) {
3288 /* TODO: same as above but for entity-fields rather than globsl
3292 irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
3294 /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
3295 * the system fields actually go? Though the engine knows this anyway...
3296 * Maybe this could be an -foption
3297 * fteqcc creates data for end_sys_* - of size 1, so let's do the same
3299 ir_value_code_setaddr(global, vec_size(code_globals));
3300 vec_push(code_globals, 0);
3302 vec_push(code_defs, def);
3305 vec_push(code_defs, def);
3306 return gen_global_pointer(global);
3308 vec_push(code_defs, def);
3309 gen_vector_defs(def, global->name);
3310 return gen_global_field(global);
3315 ir_value_code_setaddr(global, vec_size(code_globals));
3316 if (global->hasvalue) {
3317 iptr = (int32_t*)&global->constval.ivec[0];
3318 vec_push(code_globals, *iptr);
3320 vec_push(code_globals, 0);
3322 if (!islocal && global->cvq != CV_CONST)
3323 def.type |= DEF_SAVEGLOBAL;
3324 vec_push(code_defs, def);
3326 return global->code.globaladdr >= 0;
3330 ir_value_code_setaddr(global, vec_size(code_globals));
3331 if (global->hasvalue) {
3332 vec_push(code_globals, code_genstring(global->constval.vstring));
3334 vec_push(code_globals, 0);
3336 if (!islocal && global->cvq != CV_CONST)
3337 def.type |= DEF_SAVEGLOBAL;
3338 vec_push(code_defs, def);
3339 return global->code.globaladdr >= 0;
3344 ir_value_code_setaddr(global, vec_size(code_globals));
3345 if (global->hasvalue) {
3346 iptr = (int32_t*)&global->constval.ivec[0];
3347 vec_push(code_globals, iptr[0]);
3348 if (global->code.globaladdr < 0)
3350 for (d = 1; d < type_sizeof[global->vtype]; ++d) {
3351 vec_push(code_globals, iptr[d]);
3354 vec_push(code_globals, 0);
3355 if (global->code.globaladdr < 0)
3357 for (d = 1; d < type_sizeof[global->vtype]; ++d) {
3358 vec_push(code_globals, 0);
3361 if (!islocal && global->cvq != CV_CONST)
3362 def.type |= DEF_SAVEGLOBAL;
3364 vec_push(code_defs, def);
3365 def.type &= ~DEF_SAVEGLOBAL;
3366 gen_vector_defs(def, global->name);
3367 return global->code.globaladdr >= 0;
3370 ir_value_code_setaddr(global, vec_size(code_globals));
3371 if (!global->hasvalue) {
3372 vec_push(code_globals, 0);
3373 if (global->code.globaladdr < 0)
3376 vec_push(code_globals, vec_size(code_functions));
3377 if (!gen_global_function(self, global))
3380 if (!islocal && global->cvq != CV_CONST)
3381 def.type |= DEF_SAVEGLOBAL;
3382 vec_push(code_defs, def);
3385 /* assume biggest type */
3386 ir_value_code_setaddr(global, vec_size(code_globals));
3387 vec_push(code_globals, 0);
3388 for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
3389 vec_push(code_globals, 0);
3392 /* refuse to create 'void' type or any other fancy business. */
3393 irerror(global->context, "Invalid type for global variable `%s`: %s",
3394 global->name, type_name[global->vtype]);
3399 static void ir_builder_prepare_field(ir_value *field)
3401 field->code.fieldaddr = code_alloc_field(type_sizeof[field->fieldtype]);
3404 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
3406 prog_section_def def;
3407 prog_section_field fld;
3411 def.type = (uint16_t)field->vtype;
3412 def.offset = (uint16_t)vec_size(code_globals);
3414 /* create a global named the same as the field */
3415 if (opts.standard == COMPILER_GMQCC) {
3416 /* in our standard, the global gets a dot prefix */
3417 size_t len = strlen(field->name);
3420 /* we really don't want to have to allocate this, and 1024
3421 * bytes is more than enough for a variable/field name
3423 if (len+2 >= sizeof(name)) {
3424 irerror(field->context, "invalid field name size: %u", (unsigned int)len);
3429 memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
3432 def.name = code_genstring(name);
3433 fld.name = def.name + 1; /* we reuse that string table entry */
3435 /* in plain QC, there cannot be a global with the same name,
3436 * and so we also name the global the same.
3437 * FIXME: fteqcc should create a global as well
3438 * check if it actually uses the same name. Probably does
3440 def.name = code_genstring(field->name);
3441 fld.name = def.name;
3444 field->code.name = def.name;
3446 vec_push(code_defs, def);
3448 fld.type = field->fieldtype;
3450 if (fld.type == TYPE_VOID) {
3451 irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3455 fld.offset = field->code.fieldaddr;
3457 vec_push(code_fields, fld);
3459 ir_value_code_setaddr(field, vec_size(code_globals));
3460 vec_push(code_globals, fld.offset);
3461 if (fld.type == TYPE_VECTOR) {
3462 vec_push(code_globals, fld.offset+1);
3463 vec_push(code_globals, fld.offset+2);
3466 if (field->fieldtype == TYPE_VECTOR) {
3467 gen_vector_defs(def, field->name);
3468 gen_vector_fields(fld, field->name);
3471 return field->code.globaladdr >= 0;
3474 bool ir_builder_generate(ir_builder *self, const char *filename)
3476 prog_section_statement stmt;
3478 char *lnofile = NULL;
3482 for (i = 0; i < vec_size(self->fields); ++i)
3484 ir_builder_prepare_field(self->fields[i]);
3487 for (i = 0; i < vec_size(self->globals); ++i)
3489 if (!ir_builder_gen_global(self, self->globals[i], false)) {
3494 for (i = 0; i < vec_size(self->fields); ++i)
3496 if (!ir_builder_gen_field(self, self->fields[i])) {
3501 /* generate function code */
3502 for (i = 0; i < vec_size(self->globals); ++i)
3504 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3505 if (!gen_global_function_code(self, self->globals[i])) {
3511 if (vec_size(code_globals) >= 65536) {
3512 irerror(vec_last(self->globals)->context, "This progs file would require more globals than the metadata can handle. Bailing out.");
3516 /* DP errors if the last instruction is not an INSTR_DONE. */
3517 if (vec_last(code_statements).opcode != INSTR_DONE)
3519 stmt.opcode = INSTR_DONE;
3523 code_push_statement(&stmt, vec_last(code_linenums));
3529 if (vec_size(code_statements) != vec_size(code_linenums)) {
3530 con_err("Linecounter wrong: %lu != %lu\n",
3531 (unsigned long)vec_size(code_statements),
3532 (unsigned long)vec_size(code_linenums));
3533 } else if (OPTS_FLAG(LNO)) {
3535 size_t filelen = strlen(filename);
3537 memcpy(vec_add(lnofile, filelen+1), filename, filelen+1);
3538 dot = strrchr(lnofile, '.');
3542 vec_shrinkto(lnofile, dot - lnofile);
3544 memcpy(vec_add(lnofile, 5), ".lno", 5);
3548 con_out("writing '%s' and '%s'...\n", filename, lnofile);
3550 con_out("writing '%s'\n", filename);
3551 if (!code_write(filename, lnofile)) {
3559 /***********************************************************************
3560 *IR DEBUG Dump functions...
3563 #define IND_BUFSZ 1024
3566 # define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
3569 const char *qc_opname(int op)
3571 if (op < 0) return "<INVALID>";
3572 if (op < (int)( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
3573 return asm_instr[op].m;
3575 case VINSTR_PHI: return "PHI";
3576 case VINSTR_JUMP: return "JUMP";
3577 case VINSTR_COND: return "COND";
3578 default: return "<UNK>";
3582 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
3585 char indent[IND_BUFSZ];
3589 oprintf("module %s\n", b->name);
3590 for (i = 0; i < vec_size(b->globals); ++i)
3593 if (b->globals[i]->hasvalue)
3594 oprintf("%s = ", b->globals[i]->name);
3595 ir_value_dump(b->globals[i], oprintf);
3598 for (i = 0; i < vec_size(b->functions); ++i)
3599 ir_function_dump(b->functions[i], indent, oprintf);
3600 oprintf("endmodule %s\n", b->name);
3603 void ir_function_dump(ir_function *f, char *ind,
3604 int (*oprintf)(const char*, ...))
3607 if (f->builtin != 0) {
3608 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
3611 oprintf("%sfunction %s\n", ind, f->name);
3612 strncat(ind, "\t", IND_BUFSZ);
3613 if (vec_size(f->locals))
3615 oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
3616 for (i = 0; i < vec_size(f->locals); ++i) {
3617 oprintf("%s\t", ind);
3618 ir_value_dump(f->locals[i], oprintf);
3622 oprintf("%sliferanges:\n", ind);
3623 for (i = 0; i < vec_size(f->locals); ++i) {
3625 ir_value *v = f->locals[i];
3626 oprintf("%s\t%s: %s@%i ", ind, v->name, (v->unique_life ? "unique " : ""), (int)v->code.local);
3627 for (l = 0; l < vec_size(v->life); ++l) {
3628 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3632 for (i = 0; i < vec_size(f->values); ++i) {
3634 ir_value *v = f->values[i];
3635 oprintf("%s\t%s: @%i ", ind, v->name, (int)v->code.local);
3636 for (l = 0; l < vec_size(v->life); ++l) {
3637 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3641 if (vec_size(f->blocks))
3643 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
3644 for (i = 0; i < vec_size(f->blocks); ++i) {
3645 if (f->blocks[i]->run_id != f->run_id) {
3646 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
3648 ir_block_dump(f->blocks[i], ind, oprintf);
3652 ind[strlen(ind)-1] = 0;
3653 oprintf("%sendfunction %s\n", ind, f->name);
3656 void ir_block_dump(ir_block* b, char *ind,
3657 int (*oprintf)(const char*, ...))
3660 oprintf("%s:%s\n", ind, b->label);
3661 strncat(ind, "\t", IND_BUFSZ);
3663 for (i = 0; i < vec_size(b->instr); ++i)
3664 ir_instr_dump(b->instr[i], ind, oprintf);
3665 ind[strlen(ind)-1] = 0;
3668 void dump_phi(ir_instr *in, int (*oprintf)(const char*, ...))
3671 oprintf("%s <- phi ", in->_ops[0]->name);
3672 for (i = 0; i < vec_size(in->phi); ++i)
3674 oprintf("([%s] : %s) ", in->phi[i].from->label,
3675 in->phi[i].value->name);
3680 void ir_instr_dump(ir_instr *in, char *ind,
3681 int (*oprintf)(const char*, ...))
3684 const char *comma = NULL;
3686 oprintf("%s (%i) ", ind, (int)in->eid);
3688 if (in->opcode == VINSTR_PHI) {
3689 dump_phi(in, oprintf);
3693 strncat(ind, "\t", IND_BUFSZ);
3695 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
3696 ir_value_dump(in->_ops[0], oprintf);
3697 if (in->_ops[1] || in->_ops[2])
3700 if (in->opcode == INSTR_CALL0 || in->opcode == VINSTR_NRCALL) {
3701 oprintf("CALL%i\t", vec_size(in->params));
3703 oprintf("%s\t", qc_opname(in->opcode));
3705 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
3706 ir_value_dump(in->_ops[0], oprintf);
3711 for (i = 1; i != 3; ++i) {
3715 ir_value_dump(in->_ops[i], oprintf);
3723 oprintf("[%s]", in->bops[0]->label);
3727 oprintf("%s[%s]", comma, in->bops[1]->label);
3728 if (vec_size(in->params)) {
3729 oprintf("\tparams: ");
3730 for (i = 0; i != vec_size(in->params); ++i) {
3731 oprintf("%s, ", in->params[i]->name);
3735 ind[strlen(ind)-1] = 0;
3738 void ir_value_dump_string(const char *str, int (*oprintf)(const char*, ...))
3741 for (; *str; ++str) {
3743 case '\n': oprintf("\\n"); break;
3744 case '\r': oprintf("\\r"); break;
3745 case '\t': oprintf("\\t"); break;
3746 case '\v': oprintf("\\v"); break;
3747 case '\f': oprintf("\\f"); break;
3748 case '\b': oprintf("\\b"); break;
3749 case '\a': oprintf("\\a"); break;
3750 case '\\': oprintf("\\\\"); break;
3751 case '"': oprintf("\\\""); break;
3752 default: oprintf("%c", *str); break;
3758 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
3767 oprintf("fn:%s", v->name);
3770 oprintf("%g", v->constval.vfloat);
3773 oprintf("'%g %g %g'",
3776 v->constval.vvec.z);
3779 oprintf("(entity)");
3782 ir_value_dump_string(v->constval.vstring, oprintf);
3786 oprintf("%i", v->constval.vint);
3791 v->constval.vpointer->name);
3795 oprintf("%s", v->name);
3799 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
3802 oprintf("Life of %12s:", self->name);
3803 for (i = 0; i < vec_size(self->life); ++i)
3805 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);