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)
995 if (self->members[member])
996 return self->members[member];
998 if (self->vtype == TYPE_VECTOR)
1000 m = ir_value_var(self->name, self->store, TYPE_FLOAT);
1003 m->context = self->context;
1005 self->members[member] = m;
1006 m->code.addroffset = member;
1008 else if (self->vtype == TYPE_FIELD)
1010 if (self->fieldtype != TYPE_VECTOR)
1012 m = ir_value_var(self->name, self->store, TYPE_FIELD);
1015 m->fieldtype = TYPE_FLOAT;
1016 m->context = self->context;
1018 self->members[member] = m;
1019 m->code.addroffset = member;
1023 irerror(self->context, "invalid member access on %s", self->name);
1031 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
1033 ir_value *v = ir_value_var(name, storetype, vtype);
1036 ir_function_collect_value(owner, v);
1040 void ir_value_delete(ir_value* self)
1044 mem_d((void*)self->name);
1047 if (self->vtype == TYPE_STRING)
1048 mem_d((void*)self->constval.vstring);
1050 for (i = 0; i < 3; ++i) {
1051 if (self->members[i])
1052 ir_value_delete(self->members[i]);
1054 vec_free(self->reads);
1055 vec_free(self->writes);
1056 vec_free(self->life);
1060 bool ir_value_set_name(ir_value *self, const char *name)
1063 mem_d((void*)self->name);
1064 self->name = util_strdup(name);
1065 return !!self->name;
1068 bool ir_value_set_float(ir_value *self, float f)
1070 if (self->vtype != TYPE_FLOAT)
1072 self->constval.vfloat = f;
1073 self->hasvalue = true;
1077 bool ir_value_set_func(ir_value *self, int f)
1079 if (self->vtype != TYPE_FUNCTION)
1081 self->constval.vint = f;
1082 self->hasvalue = true;
1086 bool ir_value_set_vector(ir_value *self, vector v)
1088 if (self->vtype != TYPE_VECTOR)
1090 self->constval.vvec = v;
1091 self->hasvalue = true;
1095 bool ir_value_set_field(ir_value *self, ir_value *fld)
1097 if (self->vtype != TYPE_FIELD)
1099 self->constval.vpointer = fld;
1100 self->hasvalue = true;
1104 static char *ir_strdup(const char *str)
1107 /* actually dup empty strings */
1108 char *out = mem_a(1);
1112 return util_strdup(str);
1115 bool ir_value_set_string(ir_value *self, const char *str)
1117 if (self->vtype != TYPE_STRING)
1119 self->constval.vstring = ir_strdup(str);
1120 self->hasvalue = true;
1125 bool ir_value_set_int(ir_value *self, int i)
1127 if (self->vtype != TYPE_INTEGER)
1129 self->constval.vint = i;
1130 self->hasvalue = true;
1135 bool ir_value_lives(ir_value *self, size_t at)
1138 for (i = 0; i < vec_size(self->life); ++i)
1140 ir_life_entry_t *life = &self->life[i];
1141 if (life->start <= at && at <= life->end)
1143 if (life->start > at) /* since it's ordered */
1149 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
1152 vec_push(self->life, e);
1153 for (k = vec_size(self->life)-1; k > idx; --k)
1154 self->life[k] = self->life[k-1];
1155 self->life[idx] = e;
1159 bool ir_value_life_merge(ir_value *self, size_t s)
1162 ir_life_entry_t *life = NULL;
1163 ir_life_entry_t *before = NULL;
1164 ir_life_entry_t new_entry;
1166 /* Find the first range >= s */
1167 for (i = 0; i < vec_size(self->life); ++i)
1170 life = &self->life[i];
1171 if (life->start > s)
1174 /* nothing found? append */
1175 if (i == vec_size(self->life)) {
1177 if (life && life->end+1 == s)
1179 /* previous life range can be merged in */
1183 if (life && life->end >= s)
1185 e.start = e.end = s;
1186 vec_push(self->life, e);
1192 if (before->end + 1 == s &&
1193 life->start - 1 == s)
1196 before->end = life->end;
1197 vec_remove(self->life, i, 1);
1200 if (before->end + 1 == s)
1206 /* already contained */
1207 if (before->end >= s)
1211 if (life->start - 1 == s)
1216 /* insert a new entry */
1217 new_entry.start = new_entry.end = s;
1218 return ir_value_life_insert(self, i, new_entry);
1221 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
1225 if (!vec_size(other->life))
1228 if (!vec_size(self->life)) {
1229 size_t count = vec_size(other->life);
1230 ir_life_entry_t *life = vec_add(self->life, count);
1231 memcpy(life, other->life, count * sizeof(*life));
1236 for (i = 0; i < vec_size(other->life); ++i)
1238 const ir_life_entry_t *life = &other->life[i];
1241 ir_life_entry_t *entry = &self->life[myi];
1243 if (life->end+1 < entry->start)
1245 /* adding an interval before entry */
1246 if (!ir_value_life_insert(self, myi, *life))
1252 if (life->start < entry->start &&
1253 life->end+1 >= entry->start)
1255 /* starts earlier and overlaps */
1256 entry->start = life->start;
1259 if (life->end > entry->end &&
1260 life->start <= entry->end+1)
1262 /* ends later and overlaps */
1263 entry->end = life->end;
1266 /* see if our change combines it with the next ranges */
1267 while (myi+1 < vec_size(self->life) &&
1268 entry->end+1 >= self->life[1+myi].start)
1270 /* overlaps with (myi+1) */
1271 if (entry->end < self->life[1+myi].end)
1272 entry->end = self->life[1+myi].end;
1273 vec_remove(self->life, myi+1, 1);
1274 entry = &self->life[myi];
1277 /* see if we're after the entry */
1278 if (life->start > entry->end)
1281 /* append if we're at the end */
1282 if (myi >= vec_size(self->life)) {
1283 vec_push(self->life, *life);
1286 /* otherweise check the next range */
1295 bool ir_values_overlap(const ir_value *a, const ir_value *b)
1297 /* For any life entry in A see if it overlaps with
1298 * any life entry in B.
1299 * Note that the life entries are orderes, so we can make a
1300 * more efficient algorithm there than naively translating the
1304 ir_life_entry_t *la, *lb, *enda, *endb;
1306 /* first of all, if either has no life range, they cannot clash */
1307 if (!vec_size(a->life) || !vec_size(b->life))
1312 enda = la + vec_size(a->life);
1313 endb = lb + vec_size(b->life);
1316 /* check if the entries overlap, for that,
1317 * both must start before the other one ends.
1319 if (la->start < lb->end &&
1320 lb->start < la->end)
1325 /* entries are ordered
1326 * one entry is earlier than the other
1327 * that earlier entry will be moved forward
1329 if (la->start < lb->start)
1331 /* order: A B, move A forward
1332 * check if we hit the end with A
1337 else /* if (lb->start < la->start) actually <= */
1339 /* order: B A, move B forward
1340 * check if we hit the end with B
1349 /***********************************************************************
1353 bool ir_block_create_store_op(ir_block *self, lex_ctx ctx, int op, ir_value *target, ir_value *what)
1357 irerror(self->context, "unreachable statement (%s)", self->label);
1361 if (target->store == store_value &&
1362 (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1364 irerror(self->context, "cannot store to an SSA value");
1365 irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1366 irerror(self->context, "instruction: %s", asm_instr[op].m);
1370 in = ir_instr_new(ctx, self, op);
1374 if (!ir_instr_op(in, 0, target, true) ||
1375 !ir_instr_op(in, 1, what, false))
1377 ir_instr_delete(in);
1380 vec_push(self->instr, in);
1384 bool ir_block_create_store(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1388 if (target->vtype == TYPE_VARIANT)
1389 vtype = what->vtype;
1391 vtype = target->vtype;
1394 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
1395 op = INSTR_CONV_ITOF;
1396 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1397 op = INSTR_CONV_FTOI;
1399 op = type_store_instr[vtype];
1401 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1402 if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1406 return ir_block_create_store_op(self, ctx, op, target, what);
1409 bool ir_block_create_storep(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1414 if (target->vtype != TYPE_POINTER)
1417 /* storing using pointer - target is a pointer, type must be
1418 * inferred from source
1420 vtype = what->vtype;
1422 op = type_storep_instr[vtype];
1423 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1424 if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1425 op = INSTR_STOREP_V;
1428 return ir_block_create_store_op(self, ctx, op, target, what);
1431 bool ir_block_create_return(ir_block *self, lex_ctx ctx, ir_value *v)
1435 irerror(self->context, "unreachable statement (%s)", self->label);
1439 self->is_return = true;
1440 in = ir_instr_new(ctx, self, INSTR_RETURN);
1444 if (v && !ir_instr_op(in, 0, v, false)) {
1445 ir_instr_delete(in);
1449 vec_push(self->instr, in);
1453 bool ir_block_create_if(ir_block *self, lex_ctx ctx, ir_value *v,
1454 ir_block *ontrue, ir_block *onfalse)
1458 irerror(self->context, "unreachable statement (%s)", self->label);
1462 /*in = ir_instr_new(ctx, self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1463 in = ir_instr_new(ctx, self, VINSTR_COND);
1467 if (!ir_instr_op(in, 0, v, false)) {
1468 ir_instr_delete(in);
1472 in->bops[0] = ontrue;
1473 in->bops[1] = onfalse;
1475 vec_push(self->instr, in);
1477 vec_push(self->exits, ontrue);
1478 vec_push(self->exits, onfalse);
1479 vec_push(ontrue->entries, self);
1480 vec_push(onfalse->entries, self);
1484 bool ir_block_create_jump(ir_block *self, lex_ctx ctx, ir_block *to)
1488 irerror(self->context, "unreachable statement (%s)", self->label);
1492 in = ir_instr_new(ctx, self, VINSTR_JUMP);
1497 vec_push(self->instr, in);
1499 vec_push(self->exits, to);
1500 vec_push(to->entries, self);
1504 bool ir_block_create_goto(ir_block *self, lex_ctx ctx, ir_block *to)
1508 irerror(self->context, "unreachable statement (%s)", self->label);
1512 in = ir_instr_new(ctx, self, INSTR_GOTO);
1517 vec_push(self->instr, in);
1519 vec_push(self->exits, to);
1520 vec_push(to->entries, self);
1524 ir_instr* ir_block_create_phi(ir_block *self, lex_ctx ctx, const char *label, int ot)
1529 irerror(self->context, "unreachable statement (%s)", self->label);
1532 in = ir_instr_new(ctx, self, VINSTR_PHI);
1535 out = ir_value_out(self->owner, label, store_value, ot);
1537 ir_instr_delete(in);
1540 if (!ir_instr_op(in, 0, out, true)) {
1541 ir_instr_delete(in);
1542 ir_value_delete(out);
1545 vec_push(self->instr, in);
1549 ir_value* ir_phi_value(ir_instr *self)
1551 return self->_ops[0];
1554 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1558 if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1559 /* Must not be possible to cause this, otherwise the AST
1560 * is doing something wrong.
1562 irerror(self->context, "Invalid entry block for PHI");
1568 vec_push(v->reads, self);
1569 vec_push(self->phi, pe);
1572 /* call related code */
1573 ir_instr* ir_block_create_call(ir_block *self, lex_ctx ctx, const char *label, ir_value *func, bool noreturn)
1578 irerror(self->context, "unreachable statement (%s)", self->label);
1581 in = ir_instr_new(ctx, self, (noreturn ? VINSTR_NRCALL : INSTR_CALL0));
1586 self->is_return = true;
1588 out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1590 ir_instr_delete(in);
1593 if (!ir_instr_op(in, 0, out, true) ||
1594 !ir_instr_op(in, 1, func, false))
1596 ir_instr_delete(in);
1597 ir_value_delete(out);
1600 vec_push(self->instr, in);
1604 ir_value* ir_call_value(ir_instr *self)
1606 return self->_ops[0];
1609 void ir_call_param(ir_instr* self, ir_value *v)
1611 vec_push(self->params, v);
1612 vec_push(v->reads, self);
1615 /* binary op related code */
1617 ir_value* ir_block_create_binop(ir_block *self, lex_ctx ctx,
1618 const char *label, int opcode,
1619 ir_value *left, ir_value *right)
1641 case INSTR_SUB_S: /* -- offset of string as float */
1646 case INSTR_BITOR_IF:
1647 case INSTR_BITOR_FI:
1648 case INSTR_BITAND_FI:
1649 case INSTR_BITAND_IF:
1664 case INSTR_BITAND_I:
1667 case INSTR_RSHIFT_I:
1668 case INSTR_LSHIFT_I:
1690 /* boolean operations result in floats */
1691 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1693 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1696 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1701 if (ot == TYPE_VOID) {
1702 /* The AST or parser were supposed to check this! */
1706 return ir_block_create_general_instr(self, ctx, label, opcode, left, right, ot);
1709 ir_value* ir_block_create_unary(ir_block *self, lex_ctx ctx,
1710 const char *label, int opcode,
1713 int ot = TYPE_FLOAT;
1725 /* QC doesn't have other unary operations. We expect extensions to fill
1726 * the above list, otherwise we assume out-type = in-type, eg for an
1730 ot = operand->vtype;
1733 if (ot == TYPE_VOID) {
1734 /* The AST or parser were supposed to check this! */
1738 /* let's use the general instruction creator and pass NULL for OPB */
1739 return ir_block_create_general_instr(self, ctx, label, opcode, operand, NULL, ot);
1742 ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx ctx, const char *label,
1743 int op, ir_value *a, ir_value *b, int outype)
1748 out = ir_value_out(self->owner, label, store_value, outype);
1752 instr = ir_instr_new(ctx, self, op);
1754 ir_value_delete(out);
1758 if (!ir_instr_op(instr, 0, out, true) ||
1759 !ir_instr_op(instr, 1, a, false) ||
1760 !ir_instr_op(instr, 2, b, false) )
1765 vec_push(self->instr, instr);
1769 ir_instr_delete(instr);
1770 ir_value_delete(out);
1774 ir_value* ir_block_create_fieldaddress(ir_block *self, lex_ctx ctx, const char *label, ir_value *ent, ir_value *field)
1778 /* Support for various pointer types todo if so desired */
1779 if (ent->vtype != TYPE_ENTITY)
1782 if (field->vtype != TYPE_FIELD)
1785 v = ir_block_create_general_instr(self, ctx, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1786 v->fieldtype = field->fieldtype;
1790 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)
1793 if (ent->vtype != TYPE_ENTITY)
1796 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1797 if (field->vtype != TYPE_FIELD)
1802 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1803 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1804 case TYPE_STRING: op = INSTR_LOAD_S; break;
1805 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1806 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1807 case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1809 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1810 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1813 irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1817 return ir_block_create_general_instr(self, ctx, label, op, ent, field, outype);
1820 ir_value* ir_block_create_add(ir_block *self, lex_ctx ctx,
1822 ir_value *left, ir_value *right)
1825 int l = left->vtype;
1826 int r = right->vtype;
1830 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1846 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1848 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1853 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1857 return ir_block_create_binop(self, ctx, label, op, left, right);
1860 ir_value* ir_block_create_sub(ir_block *self, lex_ctx ctx,
1862 ir_value *left, ir_value *right)
1865 int l = left->vtype;
1866 int r = right->vtype;
1871 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1887 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1889 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1894 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1898 return ir_block_create_binop(self, ctx, label, op, left, right);
1901 ir_value* ir_block_create_mul(ir_block *self, lex_ctx ctx,
1903 ir_value *left, ir_value *right)
1906 int l = left->vtype;
1907 int r = right->vtype;
1912 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1927 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1929 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1932 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1934 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1936 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1938 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1942 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1946 return ir_block_create_binop(self, ctx, label, op, left, right);
1949 ir_value* ir_block_create_div(ir_block *self, lex_ctx ctx,
1951 ir_value *left, ir_value *right)
1954 int l = left->vtype;
1955 int r = right->vtype;
1960 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1973 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1975 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1977 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1982 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1986 return ir_block_create_binop(self, ctx, label, op, left, right);
1989 /* PHI resolving breaks the SSA, and must thus be the last
1990 * step before life-range calculation.
1993 static bool ir_block_naive_phi(ir_block *self);
1994 bool ir_function_naive_phi(ir_function *self)
1998 for (i = 0; i < vec_size(self->blocks); ++i)
2000 if (!ir_block_naive_phi(self->blocks[i]))
2007 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
2012 /* create a store */
2013 if (!ir_block_create_store(block, old, what))
2016 /* we now move it up */
2017 instr = vec_last(block->instr);
2018 for (i = vec_size(block->instr)-1; i > iid; --i)
2019 block->instr[i] = block->instr[i-1];
2020 block->instr[i] = instr;
2026 static bool ir_block_naive_phi(ir_block *self)
2028 size_t i, p; /*, w;*/
2029 /* FIXME: optionally, create_phi can add the phis
2030 * to a list so we don't need to loop through blocks
2031 * - anyway: "don't optimize YET"
2033 for (i = 0; i < vec_size(self->instr); ++i)
2035 ir_instr *instr = self->instr[i];
2036 if (instr->opcode != VINSTR_PHI)
2039 vec_remove(self->instr, i, 1);
2040 --i; /* NOTE: i+1 below */
2042 for (p = 0; p < vec_size(instr->phi); ++p)
2044 ir_value *v = instr->phi[p].value;
2045 ir_block *b = instr->phi[p].from;
2047 if (v->store == store_value &&
2048 vec_size(v->reads) == 1 &&
2049 vec_size(v->writes) == 1)
2051 /* replace the value */
2052 if (!ir_instr_op(v->writes[0], 0, instr->_ops[0], true))
2057 /* force a move instruction */
2058 ir_instr *prevjump = vec_last(b->instr);
2061 instr->_ops[0]->store = store_global;
2062 if (!ir_block_create_store(b, instr->context, instr->_ops[0], v))
2064 instr->_ops[0]->store = store_value;
2065 vec_push(b->instr, prevjump);
2070 ir_value *v = instr->phi[p].value;
2071 for (w = 0; w < vec_size(v->writes); ++w) {
2074 if (!v->writes[w]->_ops[0])
2077 /* When the write was to a global, we have to emit a mov */
2078 old = v->writes[w]->_ops[0];
2080 /* The original instruction now writes to the PHI target local */
2081 if (v->writes[w]->_ops[0] == v)
2082 v->writes[w]->_ops[0] = instr->_ops[0];
2084 if (old->store != store_value && old->store != store_local && old->store != store_param)
2086 /* If it originally wrote to a global we need to store the value
2089 if (!ir_naive_phi_emit_store(self, i+1, old, v))
2091 if (i+1 < vec_size(self->instr))
2092 instr = self->instr[i+1];
2095 /* In case I forget and access instr later, it'll be NULL
2096 * when it's a problem, to make sure we crash, rather than accessing
2102 /* If it didn't, we can replace all reads by the phi target now. */
2104 for (r = 0; r < vec_size(old->reads); ++r)
2107 ir_instr *ri = old->reads[r];
2108 for (op = 0; op < vec_size(ri->phi); ++op) {
2109 if (ri->phi[op].value == old)
2110 ri->phi[op].value = v;
2112 for (op = 0; op < 3; ++op) {
2113 if (ri->_ops[op] == old)
2121 ir_instr_delete(instr);
2126 /***********************************************************************
2127 *IR Temp allocation code
2128 * Propagating value life ranges by walking through the function backwards
2129 * until no more changes are made.
2130 * In theory this should happen once more than once for every nested loop
2132 * Though this implementation might run an additional time for if nests.
2135 /* Enumerate instructions used by value's life-ranges
2137 static void ir_block_enumerate(ir_block *self, size_t *_eid)
2141 for (i = 0; i < vec_size(self->instr); ++i)
2143 self->instr[i]->eid = eid++;
2148 /* Enumerate blocks and instructions.
2149 * The block-enumeration is unordered!
2150 * We do not really use the block enumreation, however
2151 * the instruction enumeration is important for life-ranges.
2153 void ir_function_enumerate(ir_function *self)
2156 size_t instruction_id = 0;
2157 for (i = 0; i < vec_size(self->blocks); ++i)
2159 self->blocks[i]->eid = i;
2160 self->blocks[i]->run_id = 0;
2161 ir_block_enumerate(self->blocks[i], &instruction_id);
2165 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
2166 bool ir_function_calculate_liferanges(ir_function *self)
2174 for (i = 0; i != vec_size(self->blocks); ++i)
2176 if (self->blocks[i]->is_return)
2178 vec_free(self->blocks[i]->living);
2179 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
2184 if (vec_size(self->blocks)) {
2185 ir_block *block = self->blocks[0];
2186 for (i = 0; i < vec_size(block->living); ++i) {
2187 ir_value *v = block->living[i];
2188 if (v->memberof || v->store != store_local)
2190 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2191 "variable `%s` may be used uninitialized in this function", v->name))
2200 /* Local-value allocator
2201 * After finishing creating the liferange of all values used in a function
2202 * we can allocate their global-positions.
2203 * This is the counterpart to register-allocation in register machines.
2210 } function_allocator;
2212 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
2215 size_t vsize = type_sizeof[var->vtype];
2217 slot = ir_value_var("reg", store_global, var->vtype);
2221 if (!ir_value_life_merge_into(slot, var))
2224 vec_push(alloc->locals, slot);
2225 vec_push(alloc->sizes, vsize);
2226 vec_push(alloc->unique, var->unique_life);
2231 ir_value_delete(slot);
2235 bool ir_function_allocate_locals(ir_function *self)
2244 function_allocator alloc;
2246 if (!vec_size(self->locals) && !vec_size(self->values))
2249 alloc.locals = NULL;
2251 alloc.positions = NULL;
2252 alloc.unique = NULL;
2254 for (i = 0; i < vec_size(self->locals); ++i)
2256 if (!OPTS_OPTIMIZATION(OPTIM_LOCALTEMPS))
2257 self->locals[i]->unique_life = true;
2258 if (!function_allocator_alloc(&alloc, self->locals[i]))
2262 /* Allocate a slot for any value that still exists */
2263 for (i = 0; i < vec_size(self->values); ++i)
2265 v = self->values[i];
2267 if (!vec_size(v->life))
2270 for (a = 0; a < vec_size(alloc.locals); ++a)
2272 /* if it's reserved for a unique liferange: skip */
2273 if (alloc.unique[a])
2276 slot = alloc.locals[a];
2278 /* never resize parameters
2279 * will be required later when overlapping temps + locals
2281 if (a < vec_size(self->params) &&
2282 alloc.sizes[a] < type_sizeof[v->vtype])
2287 if (ir_values_overlap(v, slot))
2290 if (!ir_value_life_merge_into(slot, v))
2293 /* adjust size for this slot */
2294 if (alloc.sizes[a] < type_sizeof[v->vtype])
2295 alloc.sizes[a] = type_sizeof[v->vtype];
2297 self->values[i]->code.local = a;
2300 if (a >= vec_size(alloc.locals)) {
2301 self->values[i]->code.local = vec_size(alloc.locals);
2302 if (!function_allocator_alloc(&alloc, v))
2311 /* Adjust slot positions based on sizes */
2312 vec_push(alloc.positions, 0);
2314 if (vec_size(alloc.sizes))
2315 pos = alloc.positions[0] + alloc.sizes[0];
2318 for (i = 1; i < vec_size(alloc.sizes); ++i)
2320 pos = alloc.positions[i-1] + alloc.sizes[i-1];
2321 vec_push(alloc.positions, pos);
2324 self->allocated_locals = pos + vec_last(alloc.sizes);
2326 /* Locals need to know their new position */
2327 for (i = 0; i < vec_size(self->locals); ++i) {
2328 self->locals[i]->code.local = alloc.positions[i];
2330 /* Take over the actual slot positions on values */
2331 for (i = 0; i < vec_size(self->values); ++i) {
2332 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
2340 for (i = 0; i < vec_size(alloc.locals); ++i)
2341 ir_value_delete(alloc.locals[i]);
2342 vec_free(alloc.locals);
2343 vec_free(alloc.sizes);
2344 vec_free(alloc.positions);
2348 /* Get information about which operand
2349 * is read from, or written to.
2351 static void ir_op_read_write(int op, size_t *read, size_t *write)
2371 case INSTR_STOREP_F:
2372 case INSTR_STOREP_V:
2373 case INSTR_STOREP_S:
2374 case INSTR_STOREP_ENT:
2375 case INSTR_STOREP_FLD:
2376 case INSTR_STOREP_FNC:
2387 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2390 bool changed = false;
2392 for (i = 0; i != vec_size(self->living); ++i)
2394 tempbool = ir_value_life_merge(self->living[i], eid);
2397 irerror(self->context, "block_living_add_instr() value instruction added %s: %i", self->living[i]->_name, (int)eid);
2399 changed = changed || tempbool;
2404 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
2410 /* values which have been read in a previous iteration are now
2411 * in the "living" array even if the previous block doesn't use them.
2412 * So we have to remove whatever does not exist in the previous block.
2413 * They will be re-added on-read, but the liferange merge won't cause
2415 for (i = 0; i < vec_size(self->living); ++i)
2417 if (!vec_ir_value_find(prev->living, self->living[i], NULL)) {
2418 vec_remove(self->living, i, 1);
2424 /* Whatever the previous block still has in its living set
2425 * must now be added to ours as well.
2427 for (i = 0; i < vec_size(prev->living); ++i)
2429 if (vec_ir_value_find(self->living, prev->living[i], NULL))
2431 vec_push(self->living, prev->living[i]);
2433 irerror(self->contextt from prev: %s", self->label, prev->living[i]->_name);
2439 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
2445 /* bitmasks which operands are read from or written to */
2447 char dbg_ind[16] = { '#', '0' };
2452 if (!ir_block_life_prop_previous(self, prev, changed))
2456 i = vec_size(self->instr);
2459 instr = self->instr[i];
2461 /* PHI operands are always read operands */
2462 for (p = 0; p < vec_size(instr->phi); ++p)
2464 value = instr->phi[p].value;
2465 if (value->memberof)
2466 value = value->memberof;
2467 if (!vec_ir_value_find(self->living, value, NULL))
2468 vec_push(self->living, value);
2471 /* call params are read operands too */
2472 for (p = 0; p < vec_size(instr->params); ++p)
2474 value = instr->params[p];
2475 if (value->memberof)
2476 value = value->memberof;
2477 if (!vec_ir_value_find(self->living, value, NULL))
2478 vec_push(self->living, value);
2481 /* See which operands are read and write operands */
2482 ir_op_read_write(instr->opcode, &read, &write);
2484 if (instr->opcode == INSTR_MUL_VF)
2486 /* the float source will get an additional lifetime */
2487 tempbool = ir_value_life_merge(instr->_ops[2], instr->eid+1);
2488 *changed = *changed || tempbool;
2490 else if (instr->opcode == INSTR_MUL_FV)
2492 /* the float source will get an additional lifetime */
2493 tempbool = ir_value_life_merge(instr->_ops[1], instr->eid+1);
2494 *changed = *changed || tempbool;
2497 /* Go through the 3 main operands */
2498 for (o = 0; o < 3; ++o)
2500 if (!instr->_ops[o]) /* no such operand */
2503 value = instr->_ops[o];
2504 if (value->memberof)
2505 value = value->memberof;
2507 /* We only care about locals */
2508 /* we also calculate parameter liferanges so that locals
2509 * can take up parameter slots */
2510 if (value->store != store_value &&
2511 value->store != store_local &&
2512 value->store != store_param)
2518 if (!vec_ir_value_find(self->living, value, NULL))
2519 vec_push(self->living, value);
2522 /* write operands */
2523 /* When we write to a local, we consider it "dead" for the
2524 * remaining upper part of the function, since in SSA a value
2525 * can only be written once (== created)
2530 bool in_living = vec_ir_value_find(self->living, value, &idx);
2533 /* If the value isn't alive it hasn't been read before... */
2534 /* TODO: See if the warning can be emitted during parsing or AST processing
2535 * otherwise have warning printed here.
2536 * IF printing a warning here: include filecontext_t,
2537 * and make sure it's only printed once
2538 * since this function is run multiple times.
2540 /* For now: debug info: */
2541 /* con_err( "Value only written %s\n", value->name); */
2542 tempbool = ir_value_life_merge(value, instr->eid);
2543 *changed = *changed || tempbool;
2545 ir_instr_dump(instr, dbg_ind, printf);
2549 /* since 'living' won't contain it
2550 * anymore, merge the value, since
2553 tempbool = ir_value_life_merge(value, instr->eid);
2556 con_err( "value added id %s %i\n", value->name, (int)instr->eid);
2558 *changed = *changed || tempbool;
2560 vec_remove(self->living, idx, 1);
2565 tempbool = ir_block_living_add_instr(self, instr->eid);
2566 /*con_err( "living added values\n");*/
2567 *changed = *changed || tempbool;
2571 if (self->run_id == self->owner->run_id)
2574 self->run_id = self->owner->run_id;
2576 for (i = 0; i < vec_size(self->entries); ++i)
2578 ir_block *entry = self->entries[i];
2579 ir_block_life_propagate(entry, self, changed);
2585 /***********************************************************************
2588 * Since the IR has the convention of putting 'write' operands
2589 * at the beginning, we have to rotate the operands of instructions
2590 * properly in order to generate valid QCVM code.
2592 * Having destinations at a fixed position is more convenient. In QC
2593 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2594 * read from from OPA, and store to OPB rather than OPC. Which is
2595 * partially the reason why the implementation of these instructions
2596 * in darkplaces has been delayed for so long.
2598 * Breaking conventions is annoying...
2600 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2602 static bool gen_global_field(ir_value *global)
2604 if (global->hasvalue)
2606 ir_value *fld = global->constval.vpointer;
2608 irerror(global->context, "Invalid field constant with no field: %s", global->name);
2612 /* copy the field's value */
2613 ir_value_code_setaddr(global, vec_size(code_globals));
2614 vec_push(code_globals, fld->code.fieldaddr);
2615 if (global->fieldtype == TYPE_VECTOR) {
2616 vec_push(code_globals, fld->code.fieldaddr+1);
2617 vec_push(code_globals, fld->code.fieldaddr+2);
2622 ir_value_code_setaddr(global, vec_size(code_globals));
2623 vec_push(code_globals, 0);
2624 if (global->fieldtype == TYPE_VECTOR) {
2625 vec_push(code_globals, 0);
2626 vec_push(code_globals, 0);
2629 if (global->code.globaladdr < 0)
2634 static bool gen_global_pointer(ir_value *global)
2636 if (global->hasvalue)
2638 ir_value *target = global->constval.vpointer;
2640 irerror(global->context, "Invalid pointer constant: %s", global->name);
2641 /* NULL pointers are pointing to the NULL constant, which also
2642 * sits at address 0, but still has an ir_value for itself.
2647 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2648 * void() foo; <- proto
2649 * void() *fooptr = &foo;
2650 * void() foo = { code }
2652 if (!target->code.globaladdr) {
2653 /* FIXME: Check for the constant nullptr ir_value!
2654 * because then code.globaladdr being 0 is valid.
2656 irerror(global->context, "FIXME: Relocation support");
2660 ir_value_code_setaddr(global, vec_size(code_globals));
2661 vec_push(code_globals, target->code.globaladdr);
2665 ir_value_code_setaddr(global, vec_size(code_globals));
2666 vec_push(code_globals, 0);
2668 if (global->code.globaladdr < 0)
2673 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2675 prog_section_statement stmt;
2684 block->generated = true;
2685 block->code_start = vec_size(code_statements);
2686 for (i = 0; i < vec_size(block->instr); ++i)
2688 instr = block->instr[i];
2690 if (instr->opcode == VINSTR_PHI) {
2691 irerror(block->context, "cannot generate virtual instruction (phi)");
2695 if (instr->opcode == VINSTR_JUMP) {
2696 target = instr->bops[0];
2697 /* for uncoditional jumps, if the target hasn't been generated
2698 * yet, we generate them right here.
2700 if (!target->generated) {
2705 /* otherwise we generate a jump instruction */
2706 stmt.opcode = INSTR_GOTO;
2707 stmt.o1.s1 = (target->code_start) - vec_size(code_statements);
2710 if (stmt.o1.s1 != 1)
2711 code_push_statement(&stmt, instr->context.line);
2713 /* no further instructions can be in this block */
2717 if (instr->opcode == VINSTR_COND) {
2718 ontrue = instr->bops[0];
2719 onfalse = instr->bops[1];
2720 /* TODO: have the AST signal which block should
2721 * come first: eg. optimize IFs without ELSE...
2724 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2728 if (ontrue->generated) {
2729 stmt.opcode = INSTR_IF;
2730 stmt.o2.s1 = (ontrue->code_start) - vec_size(code_statements);
2731 if (stmt.o2.s1 != 1)
2732 code_push_statement(&stmt, instr->context.line);
2734 if (onfalse->generated) {
2735 stmt.opcode = INSTR_IFNOT;
2736 stmt.o2.s1 = (onfalse->code_start) - vec_size(code_statements);
2737 if (stmt.o2.s1 != 1)
2738 code_push_statement(&stmt, instr->context.line);
2740 if (!ontrue->generated) {
2741 if (onfalse->generated) {
2746 if (!onfalse->generated) {
2747 if (ontrue->generated) {
2752 /* neither ontrue nor onfalse exist */
2753 stmt.opcode = INSTR_IFNOT;
2754 if (!instr->likely) {
2755 /* Honor the likelyhood hint */
2756 ir_block *tmp = onfalse;
2757 stmt.opcode = INSTR_IF;
2761 stidx = vec_size(code_statements);
2762 code_push_statement(&stmt, instr->context.line);
2763 /* on false we jump, so add ontrue-path */
2764 if (!gen_blocks_recursive(func, ontrue))
2766 /* fixup the jump address */
2767 code_statements[stidx].o2.s1 = vec_size(code_statements) - stidx;
2768 /* generate onfalse path */
2769 if (onfalse->generated) {
2770 /* fixup the jump address */
2771 code_statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2772 if (code_statements[stidx].o2.s1 == 1) {
2773 code_statements[stidx] = code_statements[stidx+1];
2774 if (code_statements[stidx].o1.s1 < 0)
2775 code_statements[stidx].o1.s1++;
2776 code_pop_statement();
2778 stmt.opcode = vec_last(code_statements).opcode;
2779 if (stmt.opcode == INSTR_GOTO ||
2780 stmt.opcode == INSTR_IF ||
2781 stmt.opcode == INSTR_IFNOT ||
2782 stmt.opcode == INSTR_RETURN ||
2783 stmt.opcode == INSTR_DONE)
2785 /* no use jumping from here */
2788 /* may have been generated in the previous recursive call */
2789 stmt.opcode = INSTR_GOTO;
2790 stmt.o1.s1 = (onfalse->code_start) - vec_size(code_statements);
2793 if (stmt.o1.s1 != 1)
2794 code_push_statement(&stmt, instr->context.line);
2797 else if (code_statements[stidx].o2.s1 == 1) {
2798 code_statements[stidx] = code_statements[stidx+1];
2799 if (code_statements[stidx].o1.s1 < 0)
2800 code_statements[stidx].o1.s1++;
2801 code_pop_statement();
2803 /* if not, generate now */
2808 if ( (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8)
2809 || instr->opcode == VINSTR_NRCALL)
2811 /* Trivial call translation:
2812 * copy all params to OFS_PARM*
2813 * if the output's storetype is not store_return,
2814 * add append a STORE instruction!
2816 * NOTES on how to do it better without much trouble:
2817 * -) The liferanges!
2818 * Simply check the liferange of all parameters for
2819 * other CALLs. For each param with no CALL in its
2820 * liferange, we can store it in an OFS_PARM at
2821 * generation already. This would even include later
2822 * reuse.... probably... :)
2827 first = vec_size(instr->params);
2830 for (p = 0; p < first; ++p)
2832 ir_value *param = instr->params[p];
2834 stmt.opcode = INSTR_STORE_F;
2837 if (param->vtype == TYPE_FIELD)
2838 stmt.opcode = field_store_instr[param->fieldtype];
2840 stmt.opcode = type_store_instr[param->vtype];
2841 stmt.o1.u1 = ir_value_code_addr(param);
2842 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2843 code_push_statement(&stmt, instr->context.line);
2845 /* Now handle extparams */
2846 first = vec_size(instr->params);
2847 for (; p < first; ++p)
2849 ir_builder *ir = func->owner;
2850 ir_value *param = instr->params[p];
2851 ir_value *targetparam;
2853 if (p-8 >= vec_size(ir->extparams))
2854 ir_gen_extparam(ir);
2856 targetparam = ir->extparams[p-8];
2858 stmt.opcode = INSTR_STORE_F;
2861 if (param->vtype == TYPE_FIELD)
2862 stmt.opcode = field_store_instr[param->fieldtype];
2864 stmt.opcode = type_store_instr[param->vtype];
2865 stmt.o1.u1 = ir_value_code_addr(param);
2866 stmt.o2.u1 = ir_value_code_addr(targetparam);
2867 code_push_statement(&stmt, instr->context.line);
2870 stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
2871 if (stmt.opcode > INSTR_CALL8)
2872 stmt.opcode = INSTR_CALL8;
2873 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2876 code_push_statement(&stmt, instr->context.line);
2878 retvalue = instr->_ops[0];
2879 if (retvalue && retvalue->store != store_return && vec_size(retvalue->life))
2881 /* not to be kept in OFS_RETURN */
2882 if (retvalue->vtype == TYPE_FIELD)
2883 stmt.opcode = field_store_instr[retvalue->vtype];
2885 stmt.opcode = type_store_instr[retvalue->vtype];
2886 stmt.o1.u1 = OFS_RETURN;
2887 stmt.o2.u1 = ir_value_code_addr(retvalue);
2889 code_push_statement(&stmt, instr->context.line);
2894 if (instr->opcode == INSTR_STATE) {
2895 irerror(block->context, "TODO: state instruction");
2899 stmt.opcode = instr->opcode;
2904 /* This is the general order of operands */
2906 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
2909 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2912 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
2914 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2916 stmt.o1.u1 = stmt.o3.u1;
2919 else if ((stmt.opcode >= INSTR_STORE_F &&
2920 stmt.opcode <= INSTR_STORE_FNC) ||
2921 (stmt.opcode >= INSTR_STOREP_F &&
2922 stmt.opcode <= INSTR_STOREP_FNC))
2924 /* 2-operand instructions with A -> B */
2925 stmt.o2.u1 = stmt.o3.u1;
2928 /* tiny optimization, don't output
2931 if (stmt.o2.u1 == stmt.o1.u1 &&
2932 OPTS_OPTIMIZATION(OPTIM_PEEPHOLE))
2934 ++opts_optimizationcount[OPTIM_PEEPHOLE];
2939 code_push_statement(&stmt, instr->context.line);
2944 static bool gen_function_code(ir_function *self)
2947 prog_section_statement stmt;
2949 /* Starting from entry point, we generate blocks "as they come"
2950 * for now. Dead blocks will not be translated obviously.
2952 if (!vec_size(self->blocks)) {
2953 irerror(self->context, "Function '%s' declared without body.", self->name);
2957 block = self->blocks[0];
2958 if (block->generated)
2961 if (!gen_blocks_recursive(self, block)) {
2962 irerror(self->context, "failed to generate blocks for '%s'", self->name);
2966 /* code_write and qcvm -disasm need to know that the function ends here */
2967 stmt.opcode = INSTR_DONE;
2971 code_push_statement(&stmt, vec_last(code_linenums));
2975 static qcint ir_builder_filestring(ir_builder *ir, const char *filename)
2977 /* NOTE: filename pointers are copied, we never strdup them,
2978 * thus we can use pointer-comparison to find the string.
2983 for (i = 0; i < vec_size(ir->filenames); ++i) {
2984 if (ir->filenames[i] == filename)
2985 return ir->filestrings[i];
2988 str = code_genstring(filename);
2989 vec_push(ir->filenames, filename);
2990 vec_push(ir->filestrings, str);
2994 static bool gen_global_function(ir_builder *ir, ir_value *global)
2996 prog_section_function fun;
3000 #ifndef NEW_ALLOC_STRAT
3001 size_t local_var_end;
3004 if (!global->hasvalue || (!global->constval.vfunc))
3006 irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
3010 irfun = global->constval.vfunc;
3012 fun.name = global->code.name;
3013 fun.file = ir_builder_filestring(ir, global->context.file);
3014 fun.profile = 0; /* always 0 */
3015 fun.nargs = vec_size(irfun->params);
3019 for (i = 0;i < 8; ++i) {
3020 if ((int32_t)i >= fun.nargs)
3023 fun.argsize[i] = type_sizeof[irfun->params[i]];
3026 fun.firstlocal = vec_size(code_globals);
3028 #ifndef NEW_ALLOC_STRAT
3029 local_var_end = fun.firstlocal;
3030 for (i = 0; i < vec_size(irfun->locals); ++i) {
3031 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3032 irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
3036 if (vec_size(irfun->locals)) {
3037 ir_value *last = vec_last(irfun->locals);
3038 local_var_end = last->code.globaladdr;
3039 if (last->vtype == TYPE_FIELD && last->fieldtype == TYPE_VECTOR)
3040 local_var_end += type_sizeof[TYPE_VECTOR];
3042 local_var_end += type_sizeof[last->vtype];
3044 for (i = 0; i < vec_size(irfun->values); ++i)
3046 /* generate code.globaladdr for ssa values */
3047 ir_value *v = irfun->values[i];
3048 ir_value_code_setaddr(v, local_var_end + v->code.local);
3050 for (i = 0; i < irfun->allocated_locals; ++i) {
3051 /* fill the locals with zeros */
3052 vec_push(code_globals, 0);
3055 fun.locals = vec_size(code_globals) - fun.firstlocal;
3057 fun.locals = irfun->allocated_locals;
3058 for (i = 0; i < vec_size(irfun->locals); ++i) {
3059 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3060 irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
3063 ir_value_code_setaddr(irfun->locals[i], fun.firstlocal + irfun->locals[i]->code.local);
3065 for (i = vec_size(code_globals) - fun.firstlocal; i < fun.locals; ++i) {
3066 vec_push(code_globals, 0);
3068 for (i = 0; i < vec_size(irfun->values); ++i)
3070 /* generate code.globaladdr for ssa values */
3071 ir_value *v = irfun->values[i];
3072 ir_value_code_setaddr(v, fun.firstlocal + v->code.local);
3077 fun.entry = irfun->builtin+1;
3079 irfun->code_function_def = vec_size(code_functions);
3080 fun.entry = vec_size(code_statements);
3083 vec_push(code_functions, fun);
3087 static void ir_gen_extparam(ir_builder *ir)
3089 prog_section_def def;
3093 snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparams)+8));
3094 global = ir_value_var(name, store_global, TYPE_VECTOR);
3096 def.name = code_genstring(name);
3097 def.type = TYPE_VECTOR;
3098 def.offset = vec_size(code_globals);
3100 vec_push(code_defs, def);
3101 ir_value_code_setaddr(global, def.offset);
3102 vec_push(code_globals, 0);
3103 vec_push(code_globals, 0);
3104 vec_push(code_globals, 0);
3106 vec_push(ir->extparams, global);
3109 static bool gen_function_extparam_copy(ir_function *self)
3111 size_t i, ext, numparams;
3113 ir_builder *ir = self->owner;
3115 prog_section_statement stmt;
3117 numparams = vec_size(self->params);
3121 stmt.opcode = INSTR_STORE_F;
3123 for (i = 8; i < numparams; ++i) {
3125 if (ext >= vec_size(ir->extparams))
3126 ir_gen_extparam(ir);
3128 ep = ir->extparams[ext];
3130 stmt.opcode = type_store_instr[self->locals[i]->vtype];
3131 if (self->locals[i]->vtype == TYPE_FIELD &&
3132 self->locals[i]->fieldtype == TYPE_VECTOR)
3134 stmt.opcode = INSTR_STORE_V;
3136 stmt.o1.u1 = ir_value_code_addr(ep);
3137 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3138 code_push_statement(&stmt, self->context.line);
3144 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
3146 prog_section_function *fundef;
3151 irfun = global->constval.vfunc;
3153 if (global->cvq == CV_NONE) {
3154 irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
3155 "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
3157 /* this was a function pointer, don't generate code for those */
3164 if (irfun->code_function_def < 0) {
3165 irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
3168 fundef = &code_functions[irfun->code_function_def];
3170 fundef->entry = vec_size(code_statements);
3171 if (!gen_function_extparam_copy(irfun)) {
3172 irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
3175 if (!gen_function_code(irfun)) {
3176 irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
3182 static void gen_vector_defs(prog_section_def def, const char *name)
3187 if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3190 def.type = TYPE_FLOAT;
3194 component = (char*)mem_a(len+3);
3195 memcpy(component, name, len);
3197 component[len-0] = 0;
3198 component[len-2] = '_';
3200 component[len-1] = 'x';
3202 for (i = 0; i < 3; ++i) {
3203 def.name = code_genstring(component);
3204 vec_push(code_defs, def);
3210 static void gen_vector_fields(prog_section_field fld, const char *name)
3215 if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3218 fld.type = TYPE_FLOAT;
3222 component = (char*)mem_a(len+3);
3223 memcpy(component, name, len);
3225 component[len-0] = 0;
3226 component[len-2] = '_';
3228 component[len-1] = 'x';
3230 for (i = 0; i < 3; ++i) {
3231 fld.name = code_genstring(component);
3232 vec_push(code_fields, fld);
3238 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
3242 prog_section_def def;
3244 def.type = global->vtype;
3245 def.offset = vec_size(code_globals);
3248 if (global->name[0] == '#') {
3249 if (!self->str_immediate)
3250 self->str_immediate = code_genstring("IMMEDIATE");
3251 def.name = global->code.name = self->str_immediate;
3254 def.name = global->code.name = code_genstring(global->name);
3259 switch (global->vtype)
3262 if (!strcmp(global->name, "end_sys_globals")) {
3263 /* TODO: remember this point... all the defs before this one
3264 * should be checksummed and added to progdefs.h when we generate it.
3267 else if (!strcmp(global->name, "end_sys_fields")) {
3268 /* TODO: same as above but for entity-fields rather than globsl
3272 irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
3274 /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
3275 * the system fields actually go? Though the engine knows this anyway...
3276 * Maybe this could be an -foption
3277 * fteqcc creates data for end_sys_* - of size 1, so let's do the same
3279 ir_value_code_setaddr(global, vec_size(code_globals));
3280 vec_push(code_globals, 0);
3282 vec_push(code_defs, def);
3285 vec_push(code_defs, def);
3286 return gen_global_pointer(global);
3288 vec_push(code_defs, def);
3289 gen_vector_defs(def, global->name);
3290 return gen_global_field(global);
3295 ir_value_code_setaddr(global, vec_size(code_globals));
3296 if (global->hasvalue) {
3297 iptr = (int32_t*)&global->constval.ivec[0];
3298 vec_push(code_globals, *iptr);
3300 vec_push(code_globals, 0);
3302 if (!islocal && global->cvq != CV_CONST)
3303 def.type |= DEF_SAVEGLOBAL;
3304 vec_push(code_defs, def);
3306 return global->code.globaladdr >= 0;
3310 ir_value_code_setaddr(global, vec_size(code_globals));
3311 if (global->hasvalue) {
3312 vec_push(code_globals, code_genstring(global->constval.vstring));
3314 vec_push(code_globals, 0);
3316 if (!islocal && global->cvq != CV_CONST)
3317 def.type |= DEF_SAVEGLOBAL;
3318 vec_push(code_defs, def);
3319 return global->code.globaladdr >= 0;
3324 ir_value_code_setaddr(global, vec_size(code_globals));
3325 if (global->hasvalue) {
3326 iptr = (int32_t*)&global->constval.ivec[0];
3327 vec_push(code_globals, iptr[0]);
3328 if (global->code.globaladdr < 0)
3330 for (d = 1; d < type_sizeof[global->vtype]; ++d) {
3331 vec_push(code_globals, iptr[d]);
3334 vec_push(code_globals, 0);
3335 if (global->code.globaladdr < 0)
3337 for (d = 1; d < type_sizeof[global->vtype]; ++d) {
3338 vec_push(code_globals, 0);
3341 if (!islocal && global->cvq != CV_CONST)
3342 def.type |= DEF_SAVEGLOBAL;
3344 vec_push(code_defs, def);
3345 def.type &= ~DEF_SAVEGLOBAL;
3346 gen_vector_defs(def, global->name);
3347 return global->code.globaladdr >= 0;
3350 ir_value_code_setaddr(global, vec_size(code_globals));
3351 if (!global->hasvalue) {
3352 vec_push(code_globals, 0);
3353 if (global->code.globaladdr < 0)
3356 vec_push(code_globals, vec_size(code_functions));
3357 if (!gen_global_function(self, global))
3360 if (!islocal && global->cvq != CV_CONST)
3361 def.type |= DEF_SAVEGLOBAL;
3362 vec_push(code_defs, def);
3365 /* assume biggest type */
3366 ir_value_code_setaddr(global, vec_size(code_globals));
3367 vec_push(code_globals, 0);
3368 for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
3369 vec_push(code_globals, 0);
3372 /* refuse to create 'void' type or any other fancy business. */
3373 irerror(global->context, "Invalid type for global variable `%s`: %s",
3374 global->name, type_name[global->vtype]);
3379 static void ir_builder_prepare_field(ir_value *field)
3381 field->code.fieldaddr = code_alloc_field(type_sizeof[field->fieldtype]);
3384 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
3386 prog_section_def def;
3387 prog_section_field fld;
3391 def.type = (uint16_t)field->vtype;
3392 def.offset = (uint16_t)vec_size(code_globals);
3394 /* create a global named the same as the field */
3395 if (opts.standard == COMPILER_GMQCC) {
3396 /* in our standard, the global gets a dot prefix */
3397 size_t len = strlen(field->name);
3400 /* we really don't want to have to allocate this, and 1024
3401 * bytes is more than enough for a variable/field name
3403 if (len+2 >= sizeof(name)) {
3404 irerror(field->context, "invalid field name size: %u", (unsigned int)len);
3409 memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
3412 def.name = code_genstring(name);
3413 fld.name = def.name + 1; /* we reuse that string table entry */
3415 /* in plain QC, there cannot be a global with the same name,
3416 * and so we also name the global the same.
3417 * FIXME: fteqcc should create a global as well
3418 * check if it actually uses the same name. Probably does
3420 def.name = code_genstring(field->name);
3421 fld.name = def.name;
3424 field->code.name = def.name;
3426 vec_push(code_defs, def);
3428 fld.type = field->fieldtype;
3430 if (fld.type == TYPE_VOID) {
3431 irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3435 fld.offset = field->code.fieldaddr;
3437 vec_push(code_fields, fld);
3439 ir_value_code_setaddr(field, vec_size(code_globals));
3440 vec_push(code_globals, fld.offset);
3441 if (fld.type == TYPE_VECTOR) {
3442 vec_push(code_globals, fld.offset+1);
3443 vec_push(code_globals, fld.offset+2);
3446 if (field->fieldtype == TYPE_VECTOR) {
3447 gen_vector_defs(def, field->name);
3448 gen_vector_fields(fld, field->name);
3451 return field->code.globaladdr >= 0;
3454 bool ir_builder_generate(ir_builder *self, const char *filename)
3456 prog_section_statement stmt;
3458 char *lnofile = NULL;
3462 for (i = 0; i < vec_size(self->fields); ++i)
3464 ir_builder_prepare_field(self->fields[i]);
3467 for (i = 0; i < vec_size(self->globals); ++i)
3469 if (!ir_builder_gen_global(self, self->globals[i], false)) {
3474 for (i = 0; i < vec_size(self->fields); ++i)
3476 if (!ir_builder_gen_field(self, self->fields[i])) {
3481 /* generate function code */
3482 for (i = 0; i < vec_size(self->globals); ++i)
3484 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3485 if (!gen_global_function_code(self, self->globals[i])) {
3491 if (vec_size(code_globals) >= 65536) {
3492 irerror(vec_last(self->globals)->context, "This progs file would require more globals than the metadata can handle. Bailing out.");
3496 /* DP errors if the last instruction is not an INSTR_DONE. */
3497 if (vec_last(code_statements).opcode != INSTR_DONE)
3499 stmt.opcode = INSTR_DONE;
3503 code_push_statement(&stmt, vec_last(code_linenums));
3509 if (vec_size(code_statements) != vec_size(code_linenums)) {
3510 con_err("Linecounter wrong: %lu != %lu\n",
3511 (unsigned long)vec_size(code_statements),
3512 (unsigned long)vec_size(code_linenums));
3513 } else if (OPTS_FLAG(LNO)) {
3515 size_t filelen = strlen(filename);
3517 memcpy(vec_add(lnofile, filelen+1), filename, filelen+1);
3518 dot = strrchr(lnofile, '.');
3522 vec_shrinkto(lnofile, dot - lnofile);
3524 memcpy(vec_add(lnofile, 5), ".lno", 5);
3528 con_out("writing '%s' and '%s'...\n", filename, lnofile);
3530 con_out("writing '%s'\n", filename);
3531 if (!code_write(filename, lnofile)) {
3539 /***********************************************************************
3540 *IR DEBUG Dump functions...
3543 #define IND_BUFSZ 1024
3546 # define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
3549 const char *qc_opname(int op)
3551 if (op < 0) return "<INVALID>";
3552 if (op < (int)( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
3553 return asm_instr[op].m;
3555 case VINSTR_PHI: return "PHI";
3556 case VINSTR_JUMP: return "JUMP";
3557 case VINSTR_COND: return "COND";
3558 default: return "<UNK>";
3562 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
3565 char indent[IND_BUFSZ];
3569 oprintf("module %s\n", b->name);
3570 for (i = 0; i < vec_size(b->globals); ++i)
3573 if (b->globals[i]->hasvalue)
3574 oprintf("%s = ", b->globals[i]->name);
3575 ir_value_dump(b->globals[i], oprintf);
3578 for (i = 0; i < vec_size(b->functions); ++i)
3579 ir_function_dump(b->functions[i], indent, oprintf);
3580 oprintf("endmodule %s\n", b->name);
3583 void ir_function_dump(ir_function *f, char *ind,
3584 int (*oprintf)(const char*, ...))
3587 if (f->builtin != 0) {
3588 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
3591 oprintf("%sfunction %s\n", ind, f->name);
3592 strncat(ind, "\t", IND_BUFSZ);
3593 if (vec_size(f->locals))
3595 oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
3596 for (i = 0; i < vec_size(f->locals); ++i) {
3597 oprintf("%s\t", ind);
3598 ir_value_dump(f->locals[i], oprintf);
3602 oprintf("%sliferanges:\n", ind);
3603 for (i = 0; i < vec_size(f->locals); ++i) {
3605 ir_value *v = f->locals[i];
3606 oprintf("%s\t%s: %s@%i ", ind, v->name, (v->unique_life ? "unique " : ""), (int)v->code.local);
3607 for (l = 0; l < vec_size(v->life); ++l) {
3608 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3612 for (i = 0; i < vec_size(f->values); ++i) {
3614 ir_value *v = f->values[i];
3615 oprintf("%s\t%s: @%i ", ind, v->name, (int)v->code.local);
3616 for (l = 0; l < vec_size(v->life); ++l) {
3617 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3621 if (vec_size(f->blocks))
3623 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
3624 for (i = 0; i < vec_size(f->blocks); ++i) {
3625 if (f->blocks[i]->run_id != f->run_id) {
3626 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
3628 ir_block_dump(f->blocks[i], ind, oprintf);
3632 ind[strlen(ind)-1] = 0;
3633 oprintf("%sendfunction %s\n", ind, f->name);
3636 void ir_block_dump(ir_block* b, char *ind,
3637 int (*oprintf)(const char*, ...))
3640 oprintf("%s:%s\n", ind, b->label);
3641 strncat(ind, "\t", IND_BUFSZ);
3643 for (i = 0; i < vec_size(b->instr); ++i)
3644 ir_instr_dump(b->instr[i], ind, oprintf);
3645 ind[strlen(ind)-1] = 0;
3648 void dump_phi(ir_instr *in, int (*oprintf)(const char*, ...))
3651 oprintf("%s <- phi ", in->_ops[0]->name);
3652 for (i = 0; i < vec_size(in->phi); ++i)
3654 oprintf("([%s] : %s) ", in->phi[i].from->label,
3655 in->phi[i].value->name);
3660 void ir_instr_dump(ir_instr *in, char *ind,
3661 int (*oprintf)(const char*, ...))
3664 const char *comma = NULL;
3666 oprintf("%s (%i) ", ind, (int)in->eid);
3668 if (in->opcode == VINSTR_PHI) {
3669 dump_phi(in, oprintf);
3673 strncat(ind, "\t", IND_BUFSZ);
3675 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
3676 ir_value_dump(in->_ops[0], oprintf);
3677 if (in->_ops[1] || in->_ops[2])
3680 if (in->opcode == INSTR_CALL0 || in->opcode == VINSTR_NRCALL) {
3681 oprintf("CALL%i\t", vec_size(in->params));
3683 oprintf("%s\t", qc_opname(in->opcode));
3685 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
3686 ir_value_dump(in->_ops[0], oprintf);
3691 for (i = 1; i != 3; ++i) {
3695 ir_value_dump(in->_ops[i], oprintf);
3703 oprintf("[%s]", in->bops[0]->label);
3707 oprintf("%s[%s]", comma, in->bops[1]->label);
3708 if (vec_size(in->params)) {
3709 oprintf("\tparams: ");
3710 for (i = 0; i != vec_size(in->params); ++i) {
3711 oprintf("%s, ", in->params[i]->name);
3715 ind[strlen(ind)-1] = 0;
3718 void ir_value_dump_string(const char *str, int (*oprintf)(const char*, ...))
3721 for (; *str; ++str) {
3723 case '\n': oprintf("\\n"); break;
3724 case '\r': oprintf("\\r"); break;
3725 case '\t': oprintf("\\t"); break;
3726 case '\v': oprintf("\\v"); break;
3727 case '\f': oprintf("\\f"); break;
3728 case '\b': oprintf("\\b"); break;
3729 case '\a': oprintf("\\a"); break;
3730 case '\\': oprintf("\\\\"); break;
3731 case '"': oprintf("\\\""); break;
3732 default: oprintf("%c", *str); break;
3738 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
3747 oprintf("fn:%s", v->name);
3750 oprintf("%g", v->constval.vfloat);
3753 oprintf("'%g %g %g'",
3756 v->constval.vvec.z);
3759 oprintf("(entity)");
3762 ir_value_dump_string(v->constval.vstring, oprintf);
3766 oprintf("%i", v->constval.vint);
3771 v->constval.vpointer->name);
3775 oprintf("%s", v->name);
3779 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
3782 oprintf("Life of %12s:", self->name);
3783 for (i = 0; i < vec_size(self->life); ++i)
3785 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);