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 static bool ir_check_unreachable(ir_block *self)
1365 /* The IR should never have to deal with unreachable code */
1366 if (!self->final/* || OPTS_FLAG(ALLOW_UNREACHABLE_CODE)*/)
1368 irerror(self->context, "unreachable statement (%s)", self->label);
1372 bool ir_block_create_store_op(ir_block *self, lex_ctx ctx, int op, ir_value *target, ir_value *what)
1375 if (!ir_check_unreachable(self))
1378 if (target->store == store_value &&
1379 (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1381 irerror(self->context, "cannot store to an SSA value");
1382 irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1383 irerror(self->context, "instruction: %s", asm_instr[op].m);
1387 in = ir_instr_new(ctx, self, op);
1391 if (!ir_instr_op(in, 0, target, true) ||
1392 !ir_instr_op(in, 1, what, false))
1394 ir_instr_delete(in);
1397 vec_push(self->instr, in);
1401 bool ir_block_create_store(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1405 if (target->vtype == TYPE_VARIANT)
1406 vtype = what->vtype;
1408 vtype = target->vtype;
1411 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
1412 op = INSTR_CONV_ITOF;
1413 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1414 op = INSTR_CONV_FTOI;
1416 op = type_store_instr[vtype];
1418 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1419 if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1423 return ir_block_create_store_op(self, ctx, op, target, what);
1426 bool ir_block_create_storep(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1431 if (target->vtype != TYPE_POINTER)
1434 /* storing using pointer - target is a pointer, type must be
1435 * inferred from source
1437 vtype = what->vtype;
1439 op = type_storep_instr[vtype];
1440 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1441 if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1442 op = INSTR_STOREP_V;
1445 return ir_block_create_store_op(self, ctx, op, target, what);
1448 bool ir_block_create_return(ir_block *self, lex_ctx ctx, ir_value *v)
1451 if (!ir_check_unreachable(self))
1454 self->is_return = true;
1455 in = ir_instr_new(ctx, self, INSTR_RETURN);
1459 if (v && !ir_instr_op(in, 0, v, false)) {
1460 ir_instr_delete(in);
1464 vec_push(self->instr, in);
1468 bool ir_block_create_if(ir_block *self, lex_ctx ctx, ir_value *v,
1469 ir_block *ontrue, ir_block *onfalse)
1472 if (!ir_check_unreachable(self))
1475 /*in = ir_instr_new(ctx, self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1476 in = ir_instr_new(ctx, self, VINSTR_COND);
1480 if (!ir_instr_op(in, 0, v, false)) {
1481 ir_instr_delete(in);
1485 in->bops[0] = ontrue;
1486 in->bops[1] = onfalse;
1488 vec_push(self->instr, in);
1490 vec_push(self->exits, ontrue);
1491 vec_push(self->exits, onfalse);
1492 vec_push(ontrue->entries, self);
1493 vec_push(onfalse->entries, self);
1497 bool ir_block_create_jump(ir_block *self, lex_ctx ctx, ir_block *to)
1500 if (!ir_check_unreachable(self))
1503 in = ir_instr_new(ctx, self, VINSTR_JUMP);
1508 vec_push(self->instr, in);
1510 vec_push(self->exits, to);
1511 vec_push(to->entries, self);
1515 bool ir_block_create_goto(ir_block *self, lex_ctx ctx, ir_block *to)
1518 if (!ir_check_unreachable(self))
1521 in = ir_instr_new(ctx, self, INSTR_GOTO);
1526 vec_push(self->instr, in);
1528 vec_push(self->exits, to);
1529 vec_push(to->entries, self);
1533 ir_instr* ir_block_create_phi(ir_block *self, lex_ctx ctx, const char *label, int ot)
1537 if (!ir_check_unreachable(self))
1539 in = ir_instr_new(ctx, self, VINSTR_PHI);
1542 out = ir_value_out(self->owner, label, store_value, ot);
1544 ir_instr_delete(in);
1547 if (!ir_instr_op(in, 0, out, true)) {
1548 ir_instr_delete(in);
1549 ir_value_delete(out);
1552 vec_push(self->instr, in);
1556 ir_value* ir_phi_value(ir_instr *self)
1558 return self->_ops[0];
1561 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1565 if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1566 /* Must not be possible to cause this, otherwise the AST
1567 * is doing something wrong.
1569 irerror(self->context, "Invalid entry block for PHI");
1575 vec_push(v->reads, self);
1576 vec_push(self->phi, pe);
1579 /* call related code */
1580 ir_instr* ir_block_create_call(ir_block *self, lex_ctx ctx, const char *label, ir_value *func, bool noreturn)
1584 if (!ir_check_unreachable(self))
1586 in = ir_instr_new(ctx, self, (noreturn ? VINSTR_NRCALL : INSTR_CALL0));
1591 self->is_return = true;
1593 out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1595 ir_instr_delete(in);
1598 if (!ir_instr_op(in, 0, out, true) ||
1599 !ir_instr_op(in, 1, func, false))
1601 ir_instr_delete(in);
1602 ir_value_delete(out);
1605 vec_push(self->instr, in);
1609 ir_value* ir_call_value(ir_instr *self)
1611 return self->_ops[0];
1614 void ir_call_param(ir_instr* self, ir_value *v)
1616 vec_push(self->params, v);
1617 vec_push(v->reads, self);
1620 /* binary op related code */
1622 ir_value* ir_block_create_binop(ir_block *self, lex_ctx ctx,
1623 const char *label, int opcode,
1624 ir_value *left, ir_value *right)
1646 case INSTR_SUB_S: /* -- offset of string as float */
1651 case INSTR_BITOR_IF:
1652 case INSTR_BITOR_FI:
1653 case INSTR_BITAND_FI:
1654 case INSTR_BITAND_IF:
1669 case INSTR_BITAND_I:
1672 case INSTR_RSHIFT_I:
1673 case INSTR_LSHIFT_I:
1695 /* boolean operations result in floats */
1696 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1698 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1701 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1706 if (ot == TYPE_VOID) {
1707 /* The AST or parser were supposed to check this! */
1711 return ir_block_create_general_instr(self, ctx, label, opcode, left, right, ot);
1714 ir_value* ir_block_create_unary(ir_block *self, lex_ctx ctx,
1715 const char *label, int opcode,
1718 int ot = TYPE_FLOAT;
1730 /* QC doesn't have other unary operations. We expect extensions to fill
1731 * the above list, otherwise we assume out-type = in-type, eg for an
1735 ot = operand->vtype;
1738 if (ot == TYPE_VOID) {
1739 /* The AST or parser were supposed to check this! */
1743 /* let's use the general instruction creator and pass NULL for OPB */
1744 return ir_block_create_general_instr(self, ctx, label, opcode, operand, NULL, ot);
1747 ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx ctx, const char *label,
1748 int op, ir_value *a, ir_value *b, int outype)
1753 out = ir_value_out(self->owner, label, store_value, outype);
1757 instr = ir_instr_new(ctx, self, op);
1759 ir_value_delete(out);
1763 if (!ir_instr_op(instr, 0, out, true) ||
1764 !ir_instr_op(instr, 1, a, false) ||
1765 !ir_instr_op(instr, 2, b, false) )
1770 vec_push(self->instr, instr);
1774 ir_instr_delete(instr);
1775 ir_value_delete(out);
1779 ir_value* ir_block_create_fieldaddress(ir_block *self, lex_ctx ctx, const char *label, ir_value *ent, ir_value *field)
1783 /* Support for various pointer types todo if so desired */
1784 if (ent->vtype != TYPE_ENTITY)
1787 if (field->vtype != TYPE_FIELD)
1790 v = ir_block_create_general_instr(self, ctx, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1791 v->fieldtype = field->fieldtype;
1795 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)
1798 if (ent->vtype != TYPE_ENTITY)
1801 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1802 if (field->vtype != TYPE_FIELD)
1807 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1808 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1809 case TYPE_STRING: op = INSTR_LOAD_S; break;
1810 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1811 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1812 case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1814 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1815 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1818 irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1822 return ir_block_create_general_instr(self, ctx, label, op, ent, field, outype);
1825 ir_value* ir_block_create_add(ir_block *self, lex_ctx ctx,
1827 ir_value *left, ir_value *right)
1830 int l = left->vtype;
1831 int r = right->vtype;
1835 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1851 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1853 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1858 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1862 return ir_block_create_binop(self, ctx, label, op, left, right);
1865 ir_value* ir_block_create_sub(ir_block *self, lex_ctx ctx,
1867 ir_value *left, ir_value *right)
1870 int l = left->vtype;
1871 int r = right->vtype;
1876 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1892 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1894 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1899 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1903 return ir_block_create_binop(self, ctx, label, op, left, right);
1906 ir_value* ir_block_create_mul(ir_block *self, lex_ctx ctx,
1908 ir_value *left, ir_value *right)
1911 int l = left->vtype;
1912 int r = right->vtype;
1917 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1932 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1934 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1937 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1939 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1941 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1943 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1947 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1951 return ir_block_create_binop(self, ctx, label, op, left, right);
1954 ir_value* ir_block_create_div(ir_block *self, lex_ctx ctx,
1956 ir_value *left, ir_value *right)
1959 int l = left->vtype;
1960 int r = right->vtype;
1965 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1978 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1980 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1982 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1987 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1991 return ir_block_create_binop(self, ctx, label, op, left, right);
1994 /* PHI resolving breaks the SSA, and must thus be the last
1995 * step before life-range calculation.
1998 static bool ir_block_naive_phi(ir_block *self);
1999 bool ir_function_naive_phi(ir_function *self)
2003 for (i = 0; i < vec_size(self->blocks); ++i)
2005 if (!ir_block_naive_phi(self->blocks[i]))
2012 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
2017 /* create a store */
2018 if (!ir_block_create_store(block, old, what))
2021 /* we now move it up */
2022 instr = vec_last(block->instr);
2023 for (i = vec_size(block->instr)-1; i > iid; --i)
2024 block->instr[i] = block->instr[i-1];
2025 block->instr[i] = instr;
2031 static bool ir_block_naive_phi(ir_block *self)
2033 size_t i, p; /*, w;*/
2034 /* FIXME: optionally, create_phi can add the phis
2035 * to a list so we don't need to loop through blocks
2036 * - anyway: "don't optimize YET"
2038 for (i = 0; i < vec_size(self->instr); ++i)
2040 ir_instr *instr = self->instr[i];
2041 if (instr->opcode != VINSTR_PHI)
2044 vec_remove(self->instr, i, 1);
2045 --i; /* NOTE: i+1 below */
2047 for (p = 0; p < vec_size(instr->phi); ++p)
2049 ir_value *v = instr->phi[p].value;
2050 ir_block *b = instr->phi[p].from;
2052 if (v->store == store_value &&
2053 vec_size(v->reads) == 1 &&
2054 vec_size(v->writes) == 1)
2056 /* replace the value */
2057 if (!ir_instr_op(v->writes[0], 0, instr->_ops[0], true))
2062 /* force a move instruction */
2063 ir_instr *prevjump = vec_last(b->instr);
2066 instr->_ops[0]->store = store_global;
2067 if (!ir_block_create_store(b, instr->context, instr->_ops[0], v))
2069 instr->_ops[0]->store = store_value;
2070 vec_push(b->instr, prevjump);
2075 ir_value *v = instr->phi[p].value;
2076 for (w = 0; w < vec_size(v->writes); ++w) {
2079 if (!v->writes[w]->_ops[0])
2082 /* When the write was to a global, we have to emit a mov */
2083 old = v->writes[w]->_ops[0];
2085 /* The original instruction now writes to the PHI target local */
2086 if (v->writes[w]->_ops[0] == v)
2087 v->writes[w]->_ops[0] = instr->_ops[0];
2089 if (old->store != store_value && old->store != store_local && old->store != store_param)
2091 /* If it originally wrote to a global we need to store the value
2094 if (!ir_naive_phi_emit_store(self, i+1, old, v))
2096 if (i+1 < vec_size(self->instr))
2097 instr = self->instr[i+1];
2100 /* In case I forget and access instr later, it'll be NULL
2101 * when it's a problem, to make sure we crash, rather than accessing
2107 /* If it didn't, we can replace all reads by the phi target now. */
2109 for (r = 0; r < vec_size(old->reads); ++r)
2112 ir_instr *ri = old->reads[r];
2113 for (op = 0; op < vec_size(ri->phi); ++op) {
2114 if (ri->phi[op].value == old)
2115 ri->phi[op].value = v;
2117 for (op = 0; op < 3; ++op) {
2118 if (ri->_ops[op] == old)
2126 ir_instr_delete(instr);
2131 /***********************************************************************
2132 *IR Temp allocation code
2133 * Propagating value life ranges by walking through the function backwards
2134 * until no more changes are made.
2135 * In theory this should happen once more than once for every nested loop
2137 * Though this implementation might run an additional time for if nests.
2140 /* Enumerate instructions used by value's life-ranges
2142 static void ir_block_enumerate(ir_block *self, size_t *_eid)
2146 for (i = 0; i < vec_size(self->instr); ++i)
2148 self->instr[i]->eid = eid++;
2153 /* Enumerate blocks and instructions.
2154 * The block-enumeration is unordered!
2155 * We do not really use the block enumreation, however
2156 * the instruction enumeration is important for life-ranges.
2158 void ir_function_enumerate(ir_function *self)
2161 size_t instruction_id = 0;
2162 for (i = 0; i < vec_size(self->blocks); ++i)
2164 self->blocks[i]->eid = i;
2165 self->blocks[i]->run_id = 0;
2166 ir_block_enumerate(self->blocks[i], &instruction_id);
2170 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
2171 bool ir_function_calculate_liferanges(ir_function *self)
2179 for (i = 0; i != vec_size(self->blocks); ++i)
2181 if (self->blocks[i]->is_return)
2183 vec_free(self->blocks[i]->living);
2184 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
2189 if (vec_size(self->blocks)) {
2190 ir_block *block = self->blocks[0];
2191 for (i = 0; i < vec_size(block->living); ++i) {
2192 ir_value *v = block->living[i];
2193 if (v->store != store_local)
2195 if ((v->members[0] && v->members[1] && v->members[2])) {
2196 /* all vector members have been accessed - only treat this as uninitialized
2197 * if any of them is also uninitialized.
2199 if (!vec_ir_value_find(block->living, v->members[0], NULL) &&
2200 !vec_ir_value_find(block->living, v->members[1], NULL) &&
2201 !vec_ir_value_find(block->living, v->members[2], NULL))
2207 /* A member is only uninitialized if the whole vector is also uninitialized */
2208 if (!vec_ir_value_find(block->living, v->memberof, NULL))
2211 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2212 "variable `%s` may be used uninitialized in this function", v->name))
2221 /* Local-value allocator
2222 * After finishing creating the liferange of all values used in a function
2223 * we can allocate their global-positions.
2224 * This is the counterpart to register-allocation in register machines.
2231 } function_allocator;
2233 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
2236 size_t vsize = type_sizeof[var->vtype];
2238 slot = ir_value_var("reg", store_global, var->vtype);
2242 if (!ir_value_life_merge_into(slot, var))
2245 vec_push(alloc->locals, slot);
2246 vec_push(alloc->sizes, vsize);
2247 vec_push(alloc->unique, var->unique_life);
2252 ir_value_delete(slot);
2256 bool ir_function_allocate_locals(ir_function *self)
2265 function_allocator alloc;
2267 if (!vec_size(self->locals) && !vec_size(self->values))
2270 alloc.locals = NULL;
2272 alloc.positions = NULL;
2273 alloc.unique = NULL;
2275 for (i = 0; i < vec_size(self->locals); ++i)
2277 if (!OPTS_OPTIMIZATION(OPTIM_LOCALTEMPS))
2278 self->locals[i]->unique_life = true;
2279 if (!function_allocator_alloc(&alloc, self->locals[i]))
2283 /* Allocate a slot for any value that still exists */
2284 for (i = 0; i < vec_size(self->values); ++i)
2286 v = self->values[i];
2288 if (!vec_size(v->life))
2291 for (a = 0; a < vec_size(alloc.locals); ++a)
2293 /* if it's reserved for a unique liferange: skip */
2294 if (alloc.unique[a])
2297 slot = alloc.locals[a];
2299 /* never resize parameters
2300 * will be required later when overlapping temps + locals
2302 if (a < vec_size(self->params) &&
2303 alloc.sizes[a] < type_sizeof[v->vtype])
2308 if (ir_values_overlap(v, slot))
2311 if (!ir_value_life_merge_into(slot, v))
2314 /* adjust size for this slot */
2315 if (alloc.sizes[a] < type_sizeof[v->vtype])
2316 alloc.sizes[a] = type_sizeof[v->vtype];
2318 self->values[i]->code.local = a;
2321 if (a >= vec_size(alloc.locals)) {
2322 self->values[i]->code.local = vec_size(alloc.locals);
2323 if (!function_allocator_alloc(&alloc, v))
2332 /* Adjust slot positions based on sizes */
2333 vec_push(alloc.positions, 0);
2335 if (vec_size(alloc.sizes))
2336 pos = alloc.positions[0] + alloc.sizes[0];
2339 for (i = 1; i < vec_size(alloc.sizes); ++i)
2341 pos = alloc.positions[i-1] + alloc.sizes[i-1];
2342 vec_push(alloc.positions, pos);
2345 self->allocated_locals = pos + vec_last(alloc.sizes);
2347 /* Locals need to know their new position */
2348 for (i = 0; i < vec_size(self->locals); ++i) {
2349 self->locals[i]->code.local = alloc.positions[i];
2351 /* Take over the actual slot positions on values */
2352 for (i = 0; i < vec_size(self->values); ++i) {
2353 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
2361 for (i = 0; i < vec_size(alloc.locals); ++i)
2362 ir_value_delete(alloc.locals[i]);
2363 vec_free(alloc.locals);
2364 vec_free(alloc.sizes);
2365 vec_free(alloc.positions);
2369 /* Get information about which operand
2370 * is read from, or written to.
2372 static void ir_op_read_write(int op, size_t *read, size_t *write)
2392 case INSTR_STOREP_F:
2393 case INSTR_STOREP_V:
2394 case INSTR_STOREP_S:
2395 case INSTR_STOREP_ENT:
2396 case INSTR_STOREP_FLD:
2397 case INSTR_STOREP_FNC:
2408 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2411 bool changed = false;
2413 for (i = 0; i != vec_size(self->living); ++i)
2415 tempbool = ir_value_life_merge(self->living[i], eid);
2418 irerror(self->context, "block_living_add_instr() value instruction added %s: %i", self->living[i]->_name, (int)eid);
2420 changed = changed || tempbool;
2425 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
2431 /* values which have been read in a previous iteration are now
2432 * in the "living" array even if the previous block doesn't use them.
2433 * So we have to remove whatever does not exist in the previous block.
2434 * They will be re-added on-read, but the liferange merge won't cause
2436 for (i = 0; i < vec_size(self->living); ++i)
2438 if (!vec_ir_value_find(prev->living, self->living[i], NULL)) {
2439 vec_remove(self->living, i, 1);
2445 /* Whatever the previous block still has in its living set
2446 * must now be added to ours as well.
2448 for (i = 0; i < vec_size(prev->living); ++i)
2450 if (vec_ir_value_find(self->living, prev->living[i], NULL))
2452 vec_push(self->living, prev->living[i]);
2454 irerror(self->contextt from prev: %s", self->label, prev->living[i]->_name);
2460 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
2466 /* bitmasks which operands are read from or written to */
2468 char dbg_ind[16] = { '#', '0' };
2473 if (!ir_block_life_prop_previous(self, prev, changed))
2477 i = vec_size(self->instr);
2480 instr = self->instr[i];
2482 /* PHI operands are always read operands */
2483 for (p = 0; p < vec_size(instr->phi); ++p)
2485 value = instr->phi[p].value;
2486 if (!vec_ir_value_find(self->living, value, NULL))
2487 vec_push(self->living, value);
2490 /* call params are read operands too */
2491 for (p = 0; p < vec_size(instr->params); ++p)
2493 value = instr->params[p];
2494 if (!vec_ir_value_find(self->living, value, NULL))
2495 vec_push(self->living, value);
2498 /* See which operands are read and write operands */
2499 ir_op_read_write(instr->opcode, &read, &write);
2501 if (instr->opcode == INSTR_MUL_VF)
2503 /* the float source will get an additional lifetime */
2504 tempbool = ir_value_life_merge(instr->_ops[2], instr->eid+1);
2505 *changed = *changed || tempbool;
2507 else if (instr->opcode == INSTR_MUL_FV)
2509 /* the float source will get an additional lifetime */
2510 tempbool = ir_value_life_merge(instr->_ops[1], instr->eid+1);
2511 *changed = *changed || tempbool;
2514 /* Go through the 3 main operands */
2515 for (o = 0; o < 3; ++o)
2517 if (!instr->_ops[o]) /* no such operand */
2520 value = instr->_ops[o];
2522 /* We only care about locals */
2523 /* we also calculate parameter liferanges so that locals
2524 * can take up parameter slots */
2525 if (value->store != store_value &&
2526 value->store != store_local &&
2527 value->store != store_param)
2533 if (!vec_ir_value_find(self->living, value, NULL))
2534 vec_push(self->living, value);
2537 /* write operands */
2538 /* When we write to a local, we consider it "dead" for the
2539 * remaining upper part of the function, since in SSA a value
2540 * can only be written once (== created)
2545 bool in_living = vec_ir_value_find(self->living, value, &idx);
2548 /* If the value isn't alive it hasn't been read before... */
2549 /* TODO: See if the warning can be emitted during parsing or AST processing
2550 * otherwise have warning printed here.
2551 * IF printing a warning here: include filecontext_t,
2552 * and make sure it's only printed once
2553 * since this function is run multiple times.
2555 /* For now: debug info: */
2556 /* con_err( "Value only written %s\n", value->name); */
2557 tempbool = ir_value_life_merge(value, instr->eid);
2558 *changed = *changed || tempbool;
2560 ir_instr_dump(instr, dbg_ind, printf);
2564 /* since 'living' won't contain it
2565 * anymore, merge the value, since
2568 tempbool = ir_value_life_merge(value, instr->eid);
2571 con_err( "value added id %s %i\n", value->name, (int)instr->eid);
2573 *changed = *changed || tempbool;
2575 vec_remove(self->living, idx, 1);
2580 tempbool = ir_block_living_add_instr(self, instr->eid);
2581 /*con_err( "living added values\n");*/
2582 *changed = *changed || tempbool;
2586 if (self->run_id == self->owner->run_id)
2589 self->run_id = self->owner->run_id;
2591 for (i = 0; i < vec_size(self->entries); ++i)
2593 ir_block *entry = self->entries[i];
2594 ir_block_life_propagate(entry, self, changed);
2600 /***********************************************************************
2603 * Since the IR has the convention of putting 'write' operands
2604 * at the beginning, we have to rotate the operands of instructions
2605 * properly in order to generate valid QCVM code.
2607 * Having destinations at a fixed position is more convenient. In QC
2608 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2609 * read from from OPA, and store to OPB rather than OPC. Which is
2610 * partially the reason why the implementation of these instructions
2611 * in darkplaces has been delayed for so long.
2613 * Breaking conventions is annoying...
2615 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2617 static bool gen_global_field(ir_value *global)
2619 if (global->hasvalue)
2621 ir_value *fld = global->constval.vpointer;
2623 irerror(global->context, "Invalid field constant with no field: %s", global->name);
2627 /* copy the field's value */
2628 ir_value_code_setaddr(global, vec_size(code_globals));
2629 vec_push(code_globals, fld->code.fieldaddr);
2630 if (global->fieldtype == TYPE_VECTOR) {
2631 vec_push(code_globals, fld->code.fieldaddr+1);
2632 vec_push(code_globals, fld->code.fieldaddr+2);
2637 ir_value_code_setaddr(global, vec_size(code_globals));
2638 vec_push(code_globals, 0);
2639 if (global->fieldtype == TYPE_VECTOR) {
2640 vec_push(code_globals, 0);
2641 vec_push(code_globals, 0);
2644 if (global->code.globaladdr < 0)
2649 static bool gen_global_pointer(ir_value *global)
2651 if (global->hasvalue)
2653 ir_value *target = global->constval.vpointer;
2655 irerror(global->context, "Invalid pointer constant: %s", global->name);
2656 /* NULL pointers are pointing to the NULL constant, which also
2657 * sits at address 0, but still has an ir_value for itself.
2662 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2663 * void() foo; <- proto
2664 * void() *fooptr = &foo;
2665 * void() foo = { code }
2667 if (!target->code.globaladdr) {
2668 /* FIXME: Check for the constant nullptr ir_value!
2669 * because then code.globaladdr being 0 is valid.
2671 irerror(global->context, "FIXME: Relocation support");
2675 ir_value_code_setaddr(global, vec_size(code_globals));
2676 vec_push(code_globals, target->code.globaladdr);
2680 ir_value_code_setaddr(global, vec_size(code_globals));
2681 vec_push(code_globals, 0);
2683 if (global->code.globaladdr < 0)
2688 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2690 prog_section_statement stmt;
2699 block->generated = true;
2700 block->code_start = vec_size(code_statements);
2701 for (i = 0; i < vec_size(block->instr); ++i)
2703 instr = block->instr[i];
2705 if (instr->opcode == VINSTR_PHI) {
2706 irerror(block->context, "cannot generate virtual instruction (phi)");
2710 if (instr->opcode == VINSTR_JUMP) {
2711 target = instr->bops[0];
2712 /* for uncoditional jumps, if the target hasn't been generated
2713 * yet, we generate them right here.
2715 if (!target->generated) {
2720 /* otherwise we generate a jump instruction */
2721 stmt.opcode = INSTR_GOTO;
2722 stmt.o1.s1 = (target->code_start) - vec_size(code_statements);
2725 if (stmt.o1.s1 != 1)
2726 code_push_statement(&stmt, instr->context.line);
2728 /* no further instructions can be in this block */
2732 if (instr->opcode == VINSTR_COND) {
2733 ontrue = instr->bops[0];
2734 onfalse = instr->bops[1];
2735 /* TODO: have the AST signal which block should
2736 * come first: eg. optimize IFs without ELSE...
2739 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2743 if (ontrue->generated) {
2744 stmt.opcode = INSTR_IF;
2745 stmt.o2.s1 = (ontrue->code_start) - vec_size(code_statements);
2746 if (stmt.o2.s1 != 1)
2747 code_push_statement(&stmt, instr->context.line);
2749 if (onfalse->generated) {
2750 stmt.opcode = INSTR_IFNOT;
2751 stmt.o2.s1 = (onfalse->code_start) - vec_size(code_statements);
2752 if (stmt.o2.s1 != 1)
2753 code_push_statement(&stmt, instr->context.line);
2755 if (!ontrue->generated) {
2756 if (onfalse->generated) {
2761 if (!onfalse->generated) {
2762 if (ontrue->generated) {
2767 /* neither ontrue nor onfalse exist */
2768 stmt.opcode = INSTR_IFNOT;
2769 if (!instr->likely) {
2770 /* Honor the likelyhood hint */
2771 ir_block *tmp = onfalse;
2772 stmt.opcode = INSTR_IF;
2776 stidx = vec_size(code_statements);
2777 code_push_statement(&stmt, instr->context.line);
2778 /* on false we jump, so add ontrue-path */
2779 if (!gen_blocks_recursive(func, ontrue))
2781 /* fixup the jump address */
2782 code_statements[stidx].o2.s1 = vec_size(code_statements) - stidx;
2783 /* generate onfalse path */
2784 if (onfalse->generated) {
2785 /* fixup the jump address */
2786 code_statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2787 if (code_statements[stidx].o2.s1 == 1) {
2788 code_statements[stidx] = code_statements[stidx+1];
2789 if (code_statements[stidx].o1.s1 < 0)
2790 code_statements[stidx].o1.s1++;
2791 code_pop_statement();
2793 stmt.opcode = vec_last(code_statements).opcode;
2794 if (stmt.opcode == INSTR_GOTO ||
2795 stmt.opcode == INSTR_IF ||
2796 stmt.opcode == INSTR_IFNOT ||
2797 stmt.opcode == INSTR_RETURN ||
2798 stmt.opcode == INSTR_DONE)
2800 /* no use jumping from here */
2803 /* may have been generated in the previous recursive call */
2804 stmt.opcode = INSTR_GOTO;
2805 stmt.o1.s1 = (onfalse->code_start) - vec_size(code_statements);
2808 if (stmt.o1.s1 != 1)
2809 code_push_statement(&stmt, instr->context.line);
2812 else if (code_statements[stidx].o2.s1 == 1) {
2813 code_statements[stidx] = code_statements[stidx+1];
2814 if (code_statements[stidx].o1.s1 < 0)
2815 code_statements[stidx].o1.s1++;
2816 code_pop_statement();
2818 /* if not, generate now */
2823 if ( (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8)
2824 || instr->opcode == VINSTR_NRCALL)
2826 /* Trivial call translation:
2827 * copy all params to OFS_PARM*
2828 * if the output's storetype is not store_return,
2829 * add append a STORE instruction!
2831 * NOTES on how to do it better without much trouble:
2832 * -) The liferanges!
2833 * Simply check the liferange of all parameters for
2834 * other CALLs. For each param with no CALL in its
2835 * liferange, we can store it in an OFS_PARM at
2836 * generation already. This would even include later
2837 * reuse.... probably... :)
2842 first = vec_size(instr->params);
2845 for (p = 0; p < first; ++p)
2847 ir_value *param = instr->params[p];
2849 stmt.opcode = INSTR_STORE_F;
2852 if (param->vtype == TYPE_FIELD)
2853 stmt.opcode = field_store_instr[param->fieldtype];
2855 stmt.opcode = type_store_instr[param->vtype];
2856 stmt.o1.u1 = ir_value_code_addr(param);
2857 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2858 code_push_statement(&stmt, instr->context.line);
2860 /* Now handle extparams */
2861 first = vec_size(instr->params);
2862 for (; p < first; ++p)
2864 ir_builder *ir = func->owner;
2865 ir_value *param = instr->params[p];
2866 ir_value *targetparam;
2868 if (p-8 >= vec_size(ir->extparams))
2869 ir_gen_extparam(ir);
2871 targetparam = ir->extparams[p-8];
2873 stmt.opcode = INSTR_STORE_F;
2876 if (param->vtype == TYPE_FIELD)
2877 stmt.opcode = field_store_instr[param->fieldtype];
2879 stmt.opcode = type_store_instr[param->vtype];
2880 stmt.o1.u1 = ir_value_code_addr(param);
2881 stmt.o2.u1 = ir_value_code_addr(targetparam);
2882 code_push_statement(&stmt, instr->context.line);
2885 stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
2886 if (stmt.opcode > INSTR_CALL8)
2887 stmt.opcode = INSTR_CALL8;
2888 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2891 code_push_statement(&stmt, instr->context.line);
2893 retvalue = instr->_ops[0];
2894 if (retvalue && retvalue->store != store_return && vec_size(retvalue->life))
2896 /* not to be kept in OFS_RETURN */
2897 if (retvalue->vtype == TYPE_FIELD)
2898 stmt.opcode = field_store_instr[retvalue->vtype];
2900 stmt.opcode = type_store_instr[retvalue->vtype];
2901 stmt.o1.u1 = OFS_RETURN;
2902 stmt.o2.u1 = ir_value_code_addr(retvalue);
2904 code_push_statement(&stmt, instr->context.line);
2909 if (instr->opcode == INSTR_STATE) {
2910 irerror(block->context, "TODO: state instruction");
2914 stmt.opcode = instr->opcode;
2919 /* This is the general order of operands */
2921 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
2924 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2927 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
2929 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2931 stmt.o1.u1 = stmt.o3.u1;
2934 else if ((stmt.opcode >= INSTR_STORE_F &&
2935 stmt.opcode <= INSTR_STORE_FNC) ||
2936 (stmt.opcode >= INSTR_STOREP_F &&
2937 stmt.opcode <= INSTR_STOREP_FNC))
2939 /* 2-operand instructions with A -> B */
2940 stmt.o2.u1 = stmt.o3.u1;
2943 /* tiny optimization, don't output
2946 if (stmt.o2.u1 == stmt.o1.u1 &&
2947 OPTS_OPTIMIZATION(OPTIM_PEEPHOLE))
2949 ++opts_optimizationcount[OPTIM_PEEPHOLE];
2954 code_push_statement(&stmt, instr->context.line);
2959 static bool gen_function_code(ir_function *self)
2962 prog_section_statement stmt;
2964 /* Starting from entry point, we generate blocks "as they come"
2965 * for now. Dead blocks will not be translated obviously.
2967 if (!vec_size(self->blocks)) {
2968 irerror(self->context, "Function '%s' declared without body.", self->name);
2972 block = self->blocks[0];
2973 if (block->generated)
2976 if (!gen_blocks_recursive(self, block)) {
2977 irerror(self->context, "failed to generate blocks for '%s'", self->name);
2981 /* code_write and qcvm -disasm need to know that the function ends here */
2982 stmt.opcode = INSTR_DONE;
2986 code_push_statement(&stmt, vec_last(code_linenums));
2990 static qcint ir_builder_filestring(ir_builder *ir, const char *filename)
2992 /* NOTE: filename pointers are copied, we never strdup them,
2993 * thus we can use pointer-comparison to find the string.
2998 for (i = 0; i < vec_size(ir->filenames); ++i) {
2999 if (ir->filenames[i] == filename)
3000 return ir->filestrings[i];
3003 str = code_genstring(filename);
3004 vec_push(ir->filenames, filename);
3005 vec_push(ir->filestrings, str);
3009 static bool gen_global_function(ir_builder *ir, ir_value *global)
3011 prog_section_function fun;
3015 #ifndef NEW_ALLOC_STRAT
3016 size_t local_var_end;
3019 if (!global->hasvalue || (!global->constval.vfunc))
3021 irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
3025 irfun = global->constval.vfunc;
3027 fun.name = global->code.name;
3028 fun.file = ir_builder_filestring(ir, global->context.file);
3029 fun.profile = 0; /* always 0 */
3030 fun.nargs = vec_size(irfun->params);
3034 for (i = 0;i < 8; ++i) {
3035 if ((int32_t)i >= fun.nargs)
3038 fun.argsize[i] = type_sizeof[irfun->params[i]];
3041 fun.firstlocal = vec_size(code_globals);
3043 #ifndef NEW_ALLOC_STRAT
3044 local_var_end = fun.firstlocal;
3045 for (i = 0; i < vec_size(irfun->locals); ++i) {
3046 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3047 irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
3051 if (vec_size(irfun->locals)) {
3052 ir_value *last = vec_last(irfun->locals);
3053 local_var_end = last->code.globaladdr;
3054 if (last->vtype == TYPE_FIELD && last->fieldtype == TYPE_VECTOR)
3055 local_var_end += type_sizeof[TYPE_VECTOR];
3057 local_var_end += type_sizeof[last->vtype];
3059 for (i = 0; i < vec_size(irfun->values); ++i)
3061 /* generate code.globaladdr for ssa values */
3062 ir_value *v = irfun->values[i];
3063 ir_value_code_setaddr(v, local_var_end + v->code.local);
3065 for (i = 0; i < irfun->allocated_locals; ++i) {
3066 /* fill the locals with zeros */
3067 vec_push(code_globals, 0);
3070 fun.locals = vec_size(code_globals) - fun.firstlocal;
3072 fun.locals = irfun->allocated_locals;
3073 for (i = 0; i < vec_size(irfun->locals); ++i) {
3074 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3075 irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
3078 ir_value_code_setaddr(irfun->locals[i], fun.firstlocal + irfun->locals[i]->code.local);
3080 for (i = vec_size(code_globals) - fun.firstlocal; i < fun.locals; ++i) {
3081 vec_push(code_globals, 0);
3083 for (i = 0; i < vec_size(irfun->values); ++i)
3085 /* generate code.globaladdr for ssa values */
3086 ir_value *v = irfun->values[i];
3087 ir_value_code_setaddr(v, fun.firstlocal + v->code.local);
3092 fun.entry = irfun->builtin+1;
3094 irfun->code_function_def = vec_size(code_functions);
3095 fun.entry = vec_size(code_statements);
3098 vec_push(code_functions, fun);
3102 static void ir_gen_extparam(ir_builder *ir)
3104 prog_section_def def;
3108 snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparams)+8));
3109 global = ir_value_var(name, store_global, TYPE_VECTOR);
3111 def.name = code_genstring(name);
3112 def.type = TYPE_VECTOR;
3113 def.offset = vec_size(code_globals);
3115 vec_push(code_defs, def);
3116 ir_value_code_setaddr(global, def.offset);
3117 vec_push(code_globals, 0);
3118 vec_push(code_globals, 0);
3119 vec_push(code_globals, 0);
3121 vec_push(ir->extparams, global);
3124 static bool gen_function_extparam_copy(ir_function *self)
3126 size_t i, ext, numparams;
3128 ir_builder *ir = self->owner;
3130 prog_section_statement stmt;
3132 numparams = vec_size(self->params);
3136 stmt.opcode = INSTR_STORE_F;
3138 for (i = 8; i < numparams; ++i) {
3140 if (ext >= vec_size(ir->extparams))
3141 ir_gen_extparam(ir);
3143 ep = ir->extparams[ext];
3145 stmt.opcode = type_store_instr[self->locals[i]->vtype];
3146 if (self->locals[i]->vtype == TYPE_FIELD &&
3147 self->locals[i]->fieldtype == TYPE_VECTOR)
3149 stmt.opcode = INSTR_STORE_V;
3151 stmt.o1.u1 = ir_value_code_addr(ep);
3152 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3153 code_push_statement(&stmt, self->context.line);
3159 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
3161 prog_section_function *fundef;
3166 irfun = global->constval.vfunc;
3168 if (global->cvq == CV_NONE) {
3169 irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
3170 "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
3172 /* this was a function pointer, don't generate code for those */
3179 if (irfun->code_function_def < 0) {
3180 irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
3183 fundef = &code_functions[irfun->code_function_def];
3185 fundef->entry = vec_size(code_statements);
3186 if (!gen_function_extparam_copy(irfun)) {
3187 irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
3190 if (!gen_function_code(irfun)) {
3191 irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
3197 static void gen_vector_defs(prog_section_def def, const char *name)
3202 if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3205 def.type = TYPE_FLOAT;
3209 component = (char*)mem_a(len+3);
3210 memcpy(component, name, len);
3212 component[len-0] = 0;
3213 component[len-2] = '_';
3215 component[len-1] = 'x';
3217 for (i = 0; i < 3; ++i) {
3218 def.name = code_genstring(component);
3219 vec_push(code_defs, def);
3225 static void gen_vector_fields(prog_section_field fld, const char *name)
3230 if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3233 fld.type = TYPE_FLOAT;
3237 component = (char*)mem_a(len+3);
3238 memcpy(component, name, len);
3240 component[len-0] = 0;
3241 component[len-2] = '_';
3243 component[len-1] = 'x';
3245 for (i = 0; i < 3; ++i) {
3246 fld.name = code_genstring(component);
3247 vec_push(code_fields, fld);
3253 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
3257 prog_section_def def;
3259 def.type = global->vtype;
3260 def.offset = vec_size(code_globals);
3263 if (global->name[0] == '#') {
3264 if (!self->str_immediate)
3265 self->str_immediate = code_genstring("IMMEDIATE");
3266 def.name = global->code.name = self->str_immediate;
3269 def.name = global->code.name = code_genstring(global->name);
3274 switch (global->vtype)
3277 if (!strcmp(global->name, "end_sys_globals")) {
3278 /* TODO: remember this point... all the defs before this one
3279 * should be checksummed and added to progdefs.h when we generate it.
3282 else if (!strcmp(global->name, "end_sys_fields")) {
3283 /* TODO: same as above but for entity-fields rather than globsl
3287 irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
3289 /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
3290 * the system fields actually go? Though the engine knows this anyway...
3291 * Maybe this could be an -foption
3292 * fteqcc creates data for end_sys_* - of size 1, so let's do the same
3294 ir_value_code_setaddr(global, vec_size(code_globals));
3295 vec_push(code_globals, 0);
3297 vec_push(code_defs, def);
3300 vec_push(code_defs, def);
3301 return gen_global_pointer(global);
3303 vec_push(code_defs, def);
3304 gen_vector_defs(def, global->name);
3305 return gen_global_field(global);
3310 ir_value_code_setaddr(global, vec_size(code_globals));
3311 if (global->hasvalue) {
3312 iptr = (int32_t*)&global->constval.ivec[0];
3313 vec_push(code_globals, *iptr);
3315 vec_push(code_globals, 0);
3317 if (!islocal && global->cvq != CV_CONST)
3318 def.type |= DEF_SAVEGLOBAL;
3319 vec_push(code_defs, def);
3321 return global->code.globaladdr >= 0;
3325 ir_value_code_setaddr(global, vec_size(code_globals));
3326 if (global->hasvalue) {
3327 vec_push(code_globals, code_genstring(global->constval.vstring));
3329 vec_push(code_globals, 0);
3331 if (!islocal && global->cvq != CV_CONST)
3332 def.type |= DEF_SAVEGLOBAL;
3333 vec_push(code_defs, def);
3334 return global->code.globaladdr >= 0;
3339 ir_value_code_setaddr(global, vec_size(code_globals));
3340 if (global->hasvalue) {
3341 iptr = (int32_t*)&global->constval.ivec[0];
3342 vec_push(code_globals, iptr[0]);
3343 if (global->code.globaladdr < 0)
3345 for (d = 1; d < type_sizeof[global->vtype]; ++d) {
3346 vec_push(code_globals, iptr[d]);
3349 vec_push(code_globals, 0);
3350 if (global->code.globaladdr < 0)
3352 for (d = 1; d < type_sizeof[global->vtype]; ++d) {
3353 vec_push(code_globals, 0);
3356 if (!islocal && global->cvq != CV_CONST)
3357 def.type |= DEF_SAVEGLOBAL;
3359 vec_push(code_defs, def);
3360 def.type &= ~DEF_SAVEGLOBAL;
3361 gen_vector_defs(def, global->name);
3362 return global->code.globaladdr >= 0;
3365 ir_value_code_setaddr(global, vec_size(code_globals));
3366 if (!global->hasvalue) {
3367 vec_push(code_globals, 0);
3368 if (global->code.globaladdr < 0)
3371 vec_push(code_globals, vec_size(code_functions));
3372 if (!gen_global_function(self, global))
3375 if (!islocal && global->cvq != CV_CONST)
3376 def.type |= DEF_SAVEGLOBAL;
3377 vec_push(code_defs, def);
3380 /* assume biggest type */
3381 ir_value_code_setaddr(global, vec_size(code_globals));
3382 vec_push(code_globals, 0);
3383 for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
3384 vec_push(code_globals, 0);
3387 /* refuse to create 'void' type or any other fancy business. */
3388 irerror(global->context, "Invalid type for global variable `%s`: %s",
3389 global->name, type_name[global->vtype]);
3394 static void ir_builder_prepare_field(ir_value *field)
3396 field->code.fieldaddr = code_alloc_field(type_sizeof[field->fieldtype]);
3399 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
3401 prog_section_def def;
3402 prog_section_field fld;
3406 def.type = (uint16_t)field->vtype;
3407 def.offset = (uint16_t)vec_size(code_globals);
3409 /* create a global named the same as the field */
3410 if (opts.standard == COMPILER_GMQCC) {
3411 /* in our standard, the global gets a dot prefix */
3412 size_t len = strlen(field->name);
3415 /* we really don't want to have to allocate this, and 1024
3416 * bytes is more than enough for a variable/field name
3418 if (len+2 >= sizeof(name)) {
3419 irerror(field->context, "invalid field name size: %u", (unsigned int)len);
3424 memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
3427 def.name = code_genstring(name);
3428 fld.name = def.name + 1; /* we reuse that string table entry */
3430 /* in plain QC, there cannot be a global with the same name,
3431 * and so we also name the global the same.
3432 * FIXME: fteqcc should create a global as well
3433 * check if it actually uses the same name. Probably does
3435 def.name = code_genstring(field->name);
3436 fld.name = def.name;
3439 field->code.name = def.name;
3441 vec_push(code_defs, def);
3443 fld.type = field->fieldtype;
3445 if (fld.type == TYPE_VOID) {
3446 irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3450 fld.offset = field->code.fieldaddr;
3452 vec_push(code_fields, fld);
3454 ir_value_code_setaddr(field, vec_size(code_globals));
3455 vec_push(code_globals, fld.offset);
3456 if (fld.type == TYPE_VECTOR) {
3457 vec_push(code_globals, fld.offset+1);
3458 vec_push(code_globals, fld.offset+2);
3461 if (field->fieldtype == TYPE_VECTOR) {
3462 gen_vector_defs(def, field->name);
3463 gen_vector_fields(fld, field->name);
3466 return field->code.globaladdr >= 0;
3469 bool ir_builder_generate(ir_builder *self, const char *filename)
3471 prog_section_statement stmt;
3473 char *lnofile = NULL;
3477 for (i = 0; i < vec_size(self->fields); ++i)
3479 ir_builder_prepare_field(self->fields[i]);
3482 for (i = 0; i < vec_size(self->globals); ++i)
3484 if (!ir_builder_gen_global(self, self->globals[i], false)) {
3489 for (i = 0; i < vec_size(self->fields); ++i)
3491 if (!ir_builder_gen_field(self, self->fields[i])) {
3496 /* generate function code */
3497 for (i = 0; i < vec_size(self->globals); ++i)
3499 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3500 if (!gen_global_function_code(self, self->globals[i])) {
3506 if (vec_size(code_globals) >= 65536) {
3507 irerror(vec_last(self->globals)->context, "This progs file would require more globals than the metadata can handle. Bailing out.");
3511 /* DP errors if the last instruction is not an INSTR_DONE. */
3512 if (vec_last(code_statements).opcode != INSTR_DONE)
3514 stmt.opcode = INSTR_DONE;
3518 code_push_statement(&stmt, vec_last(code_linenums));
3524 if (vec_size(code_statements) != vec_size(code_linenums)) {
3525 con_err("Linecounter wrong: %lu != %lu\n",
3526 (unsigned long)vec_size(code_statements),
3527 (unsigned long)vec_size(code_linenums));
3528 } else if (OPTS_FLAG(LNO)) {
3530 size_t filelen = strlen(filename);
3532 memcpy(vec_add(lnofile, filelen+1), filename, filelen+1);
3533 dot = strrchr(lnofile, '.');
3537 vec_shrinkto(lnofile, dot - lnofile);
3539 memcpy(vec_add(lnofile, 5), ".lno", 5);
3543 con_out("writing '%s' and '%s'...\n", filename, lnofile);
3545 con_out("writing '%s'\n", filename);
3546 if (!code_write(filename, lnofile)) {
3554 /***********************************************************************
3555 *IR DEBUG Dump functions...
3558 #define IND_BUFSZ 1024
3561 # define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
3564 const char *qc_opname(int op)
3566 if (op < 0) return "<INVALID>";
3567 if (op < (int)( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
3568 return asm_instr[op].m;
3570 case VINSTR_PHI: return "PHI";
3571 case VINSTR_JUMP: return "JUMP";
3572 case VINSTR_COND: return "COND";
3573 default: return "<UNK>";
3577 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
3580 char indent[IND_BUFSZ];
3584 oprintf("module %s\n", b->name);
3585 for (i = 0; i < vec_size(b->globals); ++i)
3588 if (b->globals[i]->hasvalue)
3589 oprintf("%s = ", b->globals[i]->name);
3590 ir_value_dump(b->globals[i], oprintf);
3593 for (i = 0; i < vec_size(b->functions); ++i)
3594 ir_function_dump(b->functions[i], indent, oprintf);
3595 oprintf("endmodule %s\n", b->name);
3598 void ir_function_dump(ir_function *f, char *ind,
3599 int (*oprintf)(const char*, ...))
3602 if (f->builtin != 0) {
3603 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
3606 oprintf("%sfunction %s\n", ind, f->name);
3607 strncat(ind, "\t", IND_BUFSZ);
3608 if (vec_size(f->locals))
3610 oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
3611 for (i = 0; i < vec_size(f->locals); ++i) {
3612 oprintf("%s\t", ind);
3613 ir_value_dump(f->locals[i], oprintf);
3617 oprintf("%sliferanges:\n", ind);
3618 for (i = 0; i < vec_size(f->locals); ++i) {
3620 ir_value *v = f->locals[i];
3621 oprintf("%s\t%s: %s@%i ", ind, v->name, (v->unique_life ? "unique " : ""), (int)v->code.local);
3622 for (l = 0; l < vec_size(v->life); ++l) {
3623 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3627 for (i = 0; i < vec_size(f->values); ++i) {
3629 ir_value *v = f->values[i];
3630 oprintf("%s\t%s: @%i ", ind, v->name, (int)v->code.local);
3631 for (l = 0; l < vec_size(v->life); ++l) {
3632 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3636 if (vec_size(f->blocks))
3638 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
3639 for (i = 0; i < vec_size(f->blocks); ++i) {
3640 if (f->blocks[i]->run_id != f->run_id) {
3641 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
3643 ir_block_dump(f->blocks[i], ind, oprintf);
3647 ind[strlen(ind)-1] = 0;
3648 oprintf("%sendfunction %s\n", ind, f->name);
3651 void ir_block_dump(ir_block* b, char *ind,
3652 int (*oprintf)(const char*, ...))
3655 oprintf("%s:%s\n", ind, b->label);
3656 strncat(ind, "\t", IND_BUFSZ);
3658 for (i = 0; i < vec_size(b->instr); ++i)
3659 ir_instr_dump(b->instr[i], ind, oprintf);
3660 ind[strlen(ind)-1] = 0;
3663 void dump_phi(ir_instr *in, int (*oprintf)(const char*, ...))
3666 oprintf("%s <- phi ", in->_ops[0]->name);
3667 for (i = 0; i < vec_size(in->phi); ++i)
3669 oprintf("([%s] : %s) ", in->phi[i].from->label,
3670 in->phi[i].value->name);
3675 void ir_instr_dump(ir_instr *in, char *ind,
3676 int (*oprintf)(const char*, ...))
3679 const char *comma = NULL;
3681 oprintf("%s (%i) ", ind, (int)in->eid);
3683 if (in->opcode == VINSTR_PHI) {
3684 dump_phi(in, oprintf);
3688 strncat(ind, "\t", IND_BUFSZ);
3690 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
3691 ir_value_dump(in->_ops[0], oprintf);
3692 if (in->_ops[1] || in->_ops[2])
3695 if (in->opcode == INSTR_CALL0 || in->opcode == VINSTR_NRCALL) {
3696 oprintf("CALL%i\t", vec_size(in->params));
3698 oprintf("%s\t", qc_opname(in->opcode));
3700 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
3701 ir_value_dump(in->_ops[0], oprintf);
3706 for (i = 1; i != 3; ++i) {
3710 ir_value_dump(in->_ops[i], oprintf);
3718 oprintf("[%s]", in->bops[0]->label);
3722 oprintf("%s[%s]", comma, in->bops[1]->label);
3723 if (vec_size(in->params)) {
3724 oprintf("\tparams: ");
3725 for (i = 0; i != vec_size(in->params); ++i) {
3726 oprintf("%s, ", in->params[i]->name);
3730 ind[strlen(ind)-1] = 0;
3733 void ir_value_dump_string(const char *str, int (*oprintf)(const char*, ...))
3736 for (; *str; ++str) {
3738 case '\n': oprintf("\\n"); break;
3739 case '\r': oprintf("\\r"); break;
3740 case '\t': oprintf("\\t"); break;
3741 case '\v': oprintf("\\v"); break;
3742 case '\f': oprintf("\\f"); break;
3743 case '\b': oprintf("\\b"); break;
3744 case '\a': oprintf("\\a"); break;
3745 case '\\': oprintf("\\\\"); break;
3746 case '"': oprintf("\\\""); break;
3747 default: oprintf("%c", *str); break;
3753 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
3762 oprintf("fn:%s", v->name);
3765 oprintf("%g", v->constval.vfloat);
3768 oprintf("'%g %g %g'",
3771 v->constval.vvec.z);
3774 oprintf("(entity)");
3777 ir_value_dump_string(v->constval.vstring, oprintf);
3781 oprintf("%i", v->constval.vint);
3786 v->constval.vpointer->name);
3790 oprintf("%s", v->name);
3794 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
3797 oprintf("Life of %12s:", self->name);
3798 for (i = 0; i < vec_size(self->life); ++i)
3800 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);