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, ...)
212 int lvl = LVL_WARNING;
214 if (warntype && !OPTS_WARN(warntype))
221 con_vprintmsg(lvl, ctx.file, ctx.line, (opts_werror ? "error" : "warning"), fmt, ap);
227 /***********************************************************************
228 * Vector utility functions
231 bool GMQCC_WARN vec_ir_value_find(ir_value **vec, ir_value *what, size_t *idx)
234 size_t len = vec_size(vec);
235 for (i = 0; i < len; ++i) {
236 if (vec[i] == what) {
244 bool GMQCC_WARN vec_ir_block_find(ir_block **vec, ir_block *what, size_t *idx)
247 size_t len = vec_size(vec);
248 for (i = 0; i < len; ++i) {
249 if (vec[i] == what) {
257 bool GMQCC_WARN vec_ir_instr_find(ir_instr **vec, ir_instr *what, size_t *idx)
260 size_t len = vec_size(vec);
261 for (i = 0; i < len; ++i) {
262 if (vec[i] == what) {
270 /***********************************************************************
274 static void ir_block_delete_quick(ir_block* self);
275 static void ir_instr_delete_quick(ir_instr *self);
276 static void ir_function_delete_quick(ir_function *self);
278 ir_builder* ir_builder_new(const char *modulename)
282 self = (ir_builder*)mem_a(sizeof(*self));
286 self->functions = NULL;
287 self->globals = NULL;
289 self->extparams = NULL;
290 self->filenames = NULL;
291 self->filestrings = NULL;
292 self->htglobals = util_htnew(IR_HT_SIZE);
293 self->htfields = util_htnew(IR_HT_SIZE);
294 self->htfunctions = util_htnew(IR_HT_SIZE);
296 self->str_immediate = 0;
298 if (!ir_builder_set_name(self, modulename)) {
306 void ir_builder_delete(ir_builder* self)
309 util_htdel(self->htglobals);
310 util_htdel(self->htfields);
311 util_htdel(self->htfunctions);
312 mem_d((void*)self->name);
313 for (i = 0; i != vec_size(self->functions); ++i) {
314 ir_function_delete_quick(self->functions[i]);
316 vec_free(self->functions);
317 for (i = 0; i != vec_size(self->extparams); ++i) {
318 ir_value_delete(self->extparams[i]);
320 vec_free(self->extparams);
321 for (i = 0; i != vec_size(self->globals); ++i) {
322 ir_value_delete(self->globals[i]);
324 vec_free(self->globals);
325 for (i = 0; i != vec_size(self->fields); ++i) {
326 ir_value_delete(self->fields[i]);
328 vec_free(self->fields);
329 vec_free(self->filenames);
330 vec_free(self->filestrings);
334 bool ir_builder_set_name(ir_builder *self, const char *name)
337 mem_d((void*)self->name);
338 self->name = util_strdup(name);
342 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
344 return (ir_function*)util_htget(self->htfunctions, name);
347 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
349 ir_function *fn = ir_builder_get_function(self, name);
354 fn = ir_function_new(self, outtype);
355 if (!ir_function_set_name(fn, name))
357 ir_function_delete(fn);
360 vec_push(self->functions, fn);
361 util_htset(self->htfunctions, name, fn);
363 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
365 ir_function_delete(fn);
369 fn->value->hasvalue = true;
370 fn->value->outtype = outtype;
371 fn->value->constval.vfunc = fn;
372 fn->value->context = fn->context;
377 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
379 return (ir_value*)util_htget(self->htglobals, name);
382 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
386 if (name && name[0] != '#')
388 ve = ir_builder_get_global(self, name);
394 ve = ir_value_var(name, store_global, vtype);
395 vec_push(self->globals, ve);
396 util_htset(self->htglobals, name, ve);
400 ir_value* ir_builder_get_field(ir_builder *self, const char *name)
402 return (ir_value*)util_htget(self->htfields, name);
406 ir_value* ir_builder_create_field(ir_builder *self, const char *name, int vtype)
408 ir_value *ve = ir_builder_get_field(self, name);
413 ve = ir_value_var(name, store_global, TYPE_FIELD);
414 ve->fieldtype = vtype;
415 vec_push(self->fields, ve);
416 util_htset(self->htfields, name, ve);
420 /***********************************************************************
424 bool ir_function_naive_phi(ir_function*);
425 void ir_function_enumerate(ir_function*);
426 bool ir_function_calculate_liferanges(ir_function*);
427 bool ir_function_allocate_locals(ir_function*);
429 ir_function* ir_function_new(ir_builder* owner, int outtype)
432 self = (ir_function*)mem_a(sizeof(*self));
437 memset(self, 0, sizeof(*self));
440 if (!ir_function_set_name(self, "<@unnamed>")) {
445 self->context.file = "<@no context>";
446 self->context.line = 0;
447 self->outtype = outtype;
456 self->code_function_def = -1;
457 self->allocated_locals = 0;
463 bool ir_function_set_name(ir_function *self, const char *name)
466 mem_d((void*)self->name);
467 self->name = util_strdup(name);
471 static void ir_function_delete_quick(ir_function *self)
474 mem_d((void*)self->name);
476 for (i = 0; i != vec_size(self->blocks); ++i)
477 ir_block_delete_quick(self->blocks[i]);
478 vec_free(self->blocks);
480 vec_free(self->params);
482 for (i = 0; i != vec_size(self->values); ++i)
483 ir_value_delete(self->values[i]);
484 vec_free(self->values);
486 for (i = 0; i != vec_size(self->locals); ++i)
487 ir_value_delete(self->locals[i]);
488 vec_free(self->locals);
490 /* self->value is deleted by the builder */
495 void ir_function_delete(ir_function *self)
498 mem_d((void*)self->name);
500 for (i = 0; i != vec_size(self->blocks); ++i)
501 ir_block_delete(self->blocks[i]);
502 vec_free(self->blocks);
504 vec_free(self->params);
506 for (i = 0; i != vec_size(self->values); ++i)
507 ir_value_delete(self->values[i]);
508 vec_free(self->values);
510 for (i = 0; i != vec_size(self->locals); ++i)
511 ir_value_delete(self->locals[i]);
512 vec_free(self->locals);
514 /* self->value is deleted by the builder */
519 void ir_function_collect_value(ir_function *self, ir_value *v)
521 vec_push(self->values, v);
524 ir_block* ir_function_create_block(lex_ctx ctx, ir_function *self, const char *label)
526 ir_block* bn = ir_block_new(self, label);
528 vec_push(self->blocks, bn);
532 static bool instr_is_operation(uint16_t op)
534 return ( (op >= INSTR_MUL_F && op <= INSTR_GT) ||
535 (op >= INSTR_LOAD_F && op <= INSTR_LOAD_FNC) ||
536 (op == INSTR_ADDRESS) ||
537 (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) ||
538 (op >= INSTR_AND && op <= INSTR_BITOR) );
541 bool ir_function_pass_minor(ir_function *self)
545 for (b = 0; b < vec_size(self->blocks); ++b) {
547 ir_block *block = self->blocks[b];
549 if (vec_size(block->instr) < 2)
552 for (i = 1; i < vec_size(block->instr); ++i) {
557 store = block->instr[i];
558 if (store->opcode < INSTR_STORE_F ||
559 store->opcode > INSTR_STORE_FNC)
564 oper = block->instr[i-1];
565 if (!instr_is_operation(oper->opcode))
568 value = oper->_ops[0];
570 /* only do it for SSA values */
571 if (value->store != store_value)
574 /* don't optimize out the temp if it's used later again */
575 if (vec_size(value->reads) != 1)
578 /* The very next store must use this value */
579 if (value->reads[0] != store)
582 /* And of course the store must _read_ from it, so it's in
584 if (store->_ops[1] != value)
587 ++optimization_count[OPTIM_MINOR];
588 oper->_ops[0] = store->_ops[0];
590 vec_remove(block->instr, i, 1);
591 ir_instr_delete(store);
598 bool ir_function_pass_tailcall(ir_function *self)
602 for (b = 0; b < vec_size(self->blocks); ++b) {
604 ir_instr *ret, *call, *store = NULL;
605 ir_block *block = self->blocks[b];
607 if (!block->final || vec_size(block->instr) < 2)
610 ret = block->instr[vec_size(block->instr)-1];
611 if (ret->opcode != INSTR_DONE && ret->opcode != INSTR_RETURN)
614 call = block->instr[vec_size(block->instr)-2];
615 if (call->opcode >= INSTR_STORE_F && call->opcode <= INSTR_STORE_FNC) {
616 /* account for the unoptimized
618 * STORE %return, %tmp
622 if (vec_size(block->instr) < 3)
626 call = block->instr[vec_size(block->instr)-3];
629 if (call->opcode < INSTR_CALL0 || call->opcode > INSTR_CALL8)
633 /* optimize out the STORE */
635 ret->_ops[0] == store->_ops[0] &&
636 store->_ops[1] == call->_ops[0])
638 ++optimization_count[OPTIM_MINOR];
639 call->_ops[0] = store->_ops[0];
640 vec_remove(block->instr, vec_size(block->instr) - 2, 1);
641 ir_instr_delete(store);
650 funcval = call->_ops[1];
653 if (funcval->vtype != TYPE_FUNCTION || funcval->constval.vfunc != self)
656 /* now we have a CALL and a RET, check if it's a tailcall */
657 if (ret->_ops[0] && call->_ops[0] != ret->_ops[0])
660 ++optimization_count[OPTIM_TAIL_RECURSION];
661 vec_shrinkby(block->instr, 2);
663 block->final = false; /* open it back up */
665 /* emite parameter-stores */
666 for (p = 0; p < vec_size(call->params); ++p) {
667 /* assert(call->params_count <= self->locals_count); */
668 if (!ir_block_create_store(block, call->context, self->locals[p], call->params[p])) {
669 irerror(call->context, "failed to create tailcall store instruction for parameter %i", (int)p);
673 if (!ir_block_create_jump(block, call->context, self->blocks[0])) {
674 irerror(call->context, "failed to create tailcall jump");
678 ir_instr_delete(call);
679 ir_instr_delete(ret);
685 bool ir_function_finalize(ir_function *self)
690 if (OPTS_OPTIMIZATION(OPTIM_MINOR)) {
691 if (!ir_function_pass_minor(self)) {
692 irerror(self->context, "generic optimization pass broke something in `%s`", self->name);
697 if (OPTS_OPTIMIZATION(OPTIM_TAIL_RECURSION)) {
698 if (!ir_function_pass_tailcall(self)) {
699 irerror(self->context, "tailcall optimization pass broke something in `%s`", self->name);
704 if (!ir_function_naive_phi(self))
707 ir_function_enumerate(self);
709 if (!ir_function_calculate_liferanges(self))
711 if (!ir_function_allocate_locals(self))
716 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
721 vec_size(self->locals) &&
722 self->locals[vec_size(self->locals)-1]->store != store_param) {
723 irerror(self->context, "cannot add parameters after adding locals");
727 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
728 vec_push(self->locals, ve);
732 /***********************************************************************
736 ir_block* ir_block_new(ir_function* owner, const char *name)
739 self = (ir_block*)mem_a(sizeof(*self));
743 memset(self, 0, sizeof(*self));
746 if (name && !ir_block_set_label(self, name)) {
751 self->context.file = "<@no context>";
752 self->context.line = 0;
756 self->entries = NULL;
760 self->is_return = false;
765 self->generated = false;
770 static void ir_block_delete_quick(ir_block* self)
773 if (self->label) mem_d(self->label);
774 for (i = 0; i != vec_size(self->instr); ++i)
775 ir_instr_delete_quick(self->instr[i]);
776 vec_free(self->instr);
777 vec_free(self->entries);
778 vec_free(self->exits);
779 vec_free(self->living);
783 void ir_block_delete(ir_block* self)
786 if (self->label) mem_d(self->label);
787 for (i = 0; i != vec_size(self->instr); ++i)
788 ir_instr_delete(self->instr[i]);
789 vec_free(self->instr);
790 vec_free(self->entries);
791 vec_free(self->exits);
792 vec_free(self->living);
796 bool ir_block_set_label(ir_block *self, const char *name)
799 mem_d((void*)self->label);
800 self->label = util_strdup(name);
801 return !!self->label;
804 /***********************************************************************
808 ir_instr* ir_instr_new(lex_ctx ctx, ir_block* owner, int op)
811 self = (ir_instr*)mem_a(sizeof(*self));
818 self->_ops[0] = NULL;
819 self->_ops[1] = NULL;
820 self->_ops[2] = NULL;
821 self->bops[0] = NULL;
822 self->bops[1] = NULL;
833 static void ir_instr_delete_quick(ir_instr *self)
836 vec_free(self->params);
840 void ir_instr_delete(ir_instr *self)
843 /* The following calls can only delete from
844 * vectors, we still want to delete this instruction
845 * so ignore the return value. Since with the warn_unused_result attribute
846 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
847 * I have to improvise here and use if(foo());
849 for (i = 0; i < vec_size(self->phi); ++i) {
851 if (vec_ir_instr_find(self->phi[i].value->writes, self, &idx))
852 vec_remove(self->phi[i].value->writes, idx, 1);
853 if (vec_ir_instr_find(self->phi[i].value->reads, self, &idx))
854 vec_remove(self->phi[i].value->reads, idx, 1);
857 for (i = 0; i < vec_size(self->params); ++i) {
859 if (vec_ir_instr_find(self->params[i]->writes, self, &idx))
860 vec_remove(self->params[i]->writes, idx, 1);
861 if (vec_ir_instr_find(self->params[i]->reads, self, &idx))
862 vec_remove(self->params[i]->reads, idx, 1);
864 vec_free(self->params);
865 (void)!ir_instr_op(self, 0, NULL, false);
866 (void)!ir_instr_op(self, 1, NULL, false);
867 (void)!ir_instr_op(self, 2, NULL, false);
871 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
873 if (self->_ops[op]) {
875 if (writing && vec_ir_instr_find(self->_ops[op]->writes, self, &idx))
876 vec_remove(self->_ops[op]->writes, idx, 1);
877 else if (vec_ir_instr_find(self->_ops[op]->reads, self, &idx))
878 vec_remove(self->_ops[op]->reads, idx, 1);
882 vec_push(v->writes, self);
884 vec_push(v->reads, self);
890 /***********************************************************************
894 void ir_value_code_setaddr(ir_value *self, int32_t gaddr)
896 self->code.globaladdr = gaddr;
897 if (self->members[0]) self->members[0]->code.globaladdr = gaddr;
898 if (self->members[1]) self->members[1]->code.globaladdr = gaddr;
899 if (self->members[2]) self->members[2]->code.globaladdr = gaddr;
902 int32_t ir_value_code_addr(const ir_value *self)
904 if (self->store == store_return)
905 return OFS_RETURN + self->code.addroffset;
906 return self->code.globaladdr + self->code.addroffset;
909 ir_value* ir_value_var(const char *name, int storetype, int vtype)
912 self = (ir_value*)mem_a(sizeof(*self));
914 self->fieldtype = TYPE_VOID;
915 self->outtype = TYPE_VOID;
916 self->store = storetype;
922 self->hasvalue = false;
923 self->context.file = "<@no context>";
924 self->context.line = 0;
926 if (name && !ir_value_set_name(self, name)) {
927 irerror(self->context, "out of memory");
932 memset(&self->constval, 0, sizeof(self->constval));
933 memset(&self->code, 0, sizeof(self->code));
935 self->members[0] = NULL;
936 self->members[1] = NULL;
937 self->members[2] = NULL;
938 self->memberof = NULL;
944 ir_value* ir_value_vector_member(ir_value *self, unsigned int member)
950 if (self->members[member])
951 return self->members[member];
953 if (self->vtype == TYPE_VECTOR)
955 m = ir_value_var(self->name, self->store, TYPE_FLOAT);
958 m->context = self->context;
960 self->members[member] = m;
961 m->code.addroffset = member;
963 else if (self->vtype == TYPE_FIELD)
965 if (self->fieldtype != TYPE_VECTOR)
967 m = ir_value_var(self->name, self->store, TYPE_FIELD);
970 m->fieldtype = TYPE_FLOAT;
971 m->context = self->context;
973 self->members[member] = m;
974 m->code.addroffset = member;
978 irerror(self->context, "invalid member access on %s", self->name);
986 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
988 ir_value *v = ir_value_var(name, storetype, vtype);
991 ir_function_collect_value(owner, v);
995 void ir_value_delete(ir_value* self)
999 mem_d((void*)self->name);
1002 if (self->vtype == TYPE_STRING)
1003 mem_d((void*)self->constval.vstring);
1005 for (i = 0; i < 3; ++i) {
1006 if (self->members[i])
1007 ir_value_delete(self->members[i]);
1009 vec_free(self->reads);
1010 vec_free(self->writes);
1011 vec_free(self->life);
1015 bool ir_value_set_name(ir_value *self, const char *name)
1018 mem_d((void*)self->name);
1019 self->name = util_strdup(name);
1020 return !!self->name;
1023 bool ir_value_set_float(ir_value *self, float f)
1025 if (self->vtype != TYPE_FLOAT)
1027 self->constval.vfloat = f;
1028 self->hasvalue = true;
1032 bool ir_value_set_func(ir_value *self, int f)
1034 if (self->vtype != TYPE_FUNCTION)
1036 self->constval.vint = f;
1037 self->hasvalue = true;
1041 bool ir_value_set_vector(ir_value *self, vector v)
1043 if (self->vtype != TYPE_VECTOR)
1045 self->constval.vvec = v;
1046 self->hasvalue = true;
1050 bool ir_value_set_field(ir_value *self, ir_value *fld)
1052 if (self->vtype != TYPE_FIELD)
1054 self->constval.vpointer = fld;
1055 self->hasvalue = true;
1059 static char *ir_strdup(const char *str)
1062 /* actually dup empty strings */
1063 char *out = mem_a(1);
1067 return util_strdup(str);
1070 bool ir_value_set_string(ir_value *self, const char *str)
1072 if (self->vtype != TYPE_STRING)
1074 self->constval.vstring = ir_strdup(str);
1075 self->hasvalue = true;
1080 bool ir_value_set_int(ir_value *self, int i)
1082 if (self->vtype != TYPE_INTEGER)
1084 self->constval.vint = i;
1085 self->hasvalue = true;
1090 bool ir_value_lives(ir_value *self, size_t at)
1093 for (i = 0; i < vec_size(self->life); ++i)
1095 ir_life_entry_t *life = &self->life[i];
1096 if (life->start <= at && at <= life->end)
1098 if (life->start > at) /* since it's ordered */
1104 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
1107 vec_push(self->life, e);
1108 for (k = vec_size(self->life)-1; k > idx; --k)
1109 self->life[k] = self->life[k-1];
1110 self->life[idx] = e;
1114 bool ir_value_life_merge(ir_value *self, size_t s)
1117 ir_life_entry_t *life = NULL;
1118 ir_life_entry_t *before = NULL;
1119 ir_life_entry_t new_entry;
1121 /* Find the first range >= s */
1122 for (i = 0; i < vec_size(self->life); ++i)
1125 life = &self->life[i];
1126 if (life->start > s)
1129 /* nothing found? append */
1130 if (i == vec_size(self->life)) {
1132 if (life && life->end+1 == s)
1134 /* previous life range can be merged in */
1138 if (life && life->end >= s)
1140 e.start = e.end = s;
1141 vec_push(self->life, e);
1147 if (before->end + 1 == s &&
1148 life->start - 1 == s)
1151 before->end = life->end;
1152 vec_remove(self->life, i, 1);
1155 if (before->end + 1 == s)
1161 /* already contained */
1162 if (before->end >= s)
1166 if (life->start - 1 == s)
1171 /* insert a new entry */
1172 new_entry.start = new_entry.end = s;
1173 return ir_value_life_insert(self, i, new_entry);
1176 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
1180 if (!vec_size(other->life))
1183 if (!vec_size(self->life)) {
1184 size_t count = vec_size(other->life);
1185 ir_life_entry_t *life = vec_add(self->life, count);
1186 memcpy(life, other->life, count * sizeof(*life));
1191 for (i = 0; i < vec_size(other->life); ++i)
1193 const ir_life_entry_t *life = &other->life[i];
1196 ir_life_entry_t *entry = &self->life[myi];
1198 if (life->end+1 < entry->start)
1200 /* adding an interval before entry */
1201 if (!ir_value_life_insert(self, myi, *life))
1207 if (life->start < entry->start &&
1208 life->end+1 >= entry->start)
1210 /* starts earlier and overlaps */
1211 entry->start = life->start;
1214 if (life->end > entry->end &&
1215 life->start <= entry->end+1)
1217 /* ends later and overlaps */
1218 entry->end = life->end;
1221 /* see if our change combines it with the next ranges */
1222 while (myi+1 < vec_size(self->life) &&
1223 entry->end+1 >= self->life[1+myi].start)
1225 /* overlaps with (myi+1) */
1226 if (entry->end < self->life[1+myi].end)
1227 entry->end = self->life[1+myi].end;
1228 vec_remove(self->life, myi+1, 1);
1229 entry = &self->life[myi];
1232 /* see if we're after the entry */
1233 if (life->start > entry->end)
1236 /* append if we're at the end */
1237 if (myi >= vec_size(self->life)) {
1238 vec_push(self->life, *life);
1241 /* otherweise check the next range */
1250 bool ir_values_overlap(const ir_value *a, const ir_value *b)
1252 /* For any life entry in A see if it overlaps with
1253 * any life entry in B.
1254 * Note that the life entries are orderes, so we can make a
1255 * more efficient algorithm there than naively translating the
1259 ir_life_entry_t *la, *lb, *enda, *endb;
1261 /* first of all, if either has no life range, they cannot clash */
1262 if (!vec_size(a->life) || !vec_size(b->life))
1267 enda = la + vec_size(a->life);
1268 endb = lb + vec_size(b->life);
1271 /* check if the entries overlap, for that,
1272 * both must start before the other one ends.
1274 if (la->start < lb->end &&
1275 lb->start < la->end)
1280 /* entries are ordered
1281 * one entry is earlier than the other
1282 * that earlier entry will be moved forward
1284 if (la->start < lb->start)
1286 /* order: A B, move A forward
1287 * check if we hit the end with A
1292 else /* if (lb->start < la->start) actually <= */
1294 /* order: B A, move B forward
1295 * check if we hit the end with B
1304 /***********************************************************************
1308 bool ir_block_create_store_op(ir_block *self, lex_ctx ctx, int op, ir_value *target, ir_value *what)
1312 irerror(self->context, "unreachable statement (%s)", self->label);
1315 in = ir_instr_new(ctx, self, op);
1319 if (target->store == store_value &&
1320 (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1322 irerror(self->context, "cannot store to an SSA value");
1323 irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1324 irerror(self->context, "instruction: %s", asm_instr[op].m);
1328 if (!ir_instr_op(in, 0, target, true) ||
1329 !ir_instr_op(in, 1, what, false))
1333 vec_push(self->instr, in);
1337 bool ir_block_create_store(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1341 if (target->vtype == TYPE_VARIANT)
1342 vtype = what->vtype;
1344 vtype = target->vtype;
1347 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
1348 op = INSTR_CONV_ITOF;
1349 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1350 op = INSTR_CONV_FTOI;
1352 op = type_store_instr[vtype];
1354 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1355 if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1359 return ir_block_create_store_op(self, ctx, op, target, what);
1362 bool ir_block_create_storep(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1367 if (target->vtype != TYPE_POINTER)
1370 /* storing using pointer - target is a pointer, type must be
1371 * inferred from source
1373 vtype = what->vtype;
1375 op = type_storep_instr[vtype];
1376 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1377 if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1378 op = INSTR_STOREP_V;
1381 return ir_block_create_store_op(self, ctx, op, target, what);
1384 bool ir_block_create_return(ir_block *self, lex_ctx ctx, ir_value *v)
1388 irerror(self->context, "unreachable statement (%s)", self->label);
1392 self->is_return = true;
1393 in = ir_instr_new(ctx, self, INSTR_RETURN);
1397 if (v && !ir_instr_op(in, 0, v, false))
1400 vec_push(self->instr, in);
1404 bool ir_block_create_if(ir_block *self, lex_ctx ctx, ir_value *v,
1405 ir_block *ontrue, ir_block *onfalse)
1409 irerror(self->context, "unreachable statement (%s)", self->label);
1413 /*in = ir_instr_new(ctx, self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1414 in = ir_instr_new(ctx, self, VINSTR_COND);
1418 if (!ir_instr_op(in, 0, v, false)) {
1419 ir_instr_delete(in);
1423 in->bops[0] = ontrue;
1424 in->bops[1] = onfalse;
1426 vec_push(self->instr, in);
1428 vec_push(self->exits, ontrue);
1429 vec_push(self->exits, onfalse);
1430 vec_push(ontrue->entries, self);
1431 vec_push(onfalse->entries, self);
1435 bool ir_block_create_jump(ir_block *self, lex_ctx ctx, ir_block *to)
1439 irerror(self->context, "unreachable statement (%s)", self->label);
1443 in = ir_instr_new(ctx, self, VINSTR_JUMP);
1448 vec_push(self->instr, in);
1450 vec_push(self->exits, to);
1451 vec_push(to->entries, self);
1455 bool ir_block_create_goto(ir_block *self, lex_ctx ctx, ir_block *to)
1459 irerror(self->context, "unreachable statement (%s)", self->label);
1463 in = ir_instr_new(ctx, self, INSTR_GOTO);
1468 vec_push(self->instr, in);
1470 vec_push(self->exits, to);
1471 vec_push(to->entries, self);
1475 ir_instr* ir_block_create_phi(ir_block *self, lex_ctx ctx, const char *label, int ot)
1479 in = ir_instr_new(ctx, self, VINSTR_PHI);
1482 out = ir_value_out(self->owner, label, store_value, ot);
1484 ir_instr_delete(in);
1487 if (!ir_instr_op(in, 0, out, true)) {
1488 ir_instr_delete(in);
1489 ir_value_delete(out);
1492 vec_push(self->instr, in);
1496 ir_value* ir_phi_value(ir_instr *self)
1498 return self->_ops[0];
1501 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1505 if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1506 /* Must not be possible to cause this, otherwise the AST
1507 * is doing something wrong.
1509 irerror(self->context, "Invalid entry block for PHI");
1515 vec_push(v->reads, self);
1516 vec_push(self->phi, pe);
1519 /* call related code */
1520 ir_instr* ir_block_create_call(ir_block *self, lex_ctx ctx, const char *label, ir_value *func)
1524 in = ir_instr_new(ctx, self, INSTR_CALL0);
1527 out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1529 ir_instr_delete(in);
1532 if (!ir_instr_op(in, 0, out, true) ||
1533 !ir_instr_op(in, 1, func, false))
1535 ir_instr_delete(in);
1536 ir_value_delete(out);
1539 vec_push(self->instr, in);
1543 ir_value* ir_call_value(ir_instr *self)
1545 return self->_ops[0];
1548 void ir_call_param(ir_instr* self, ir_value *v)
1550 vec_push(self->params, v);
1551 vec_push(v->reads, self);
1554 /* binary op related code */
1556 ir_value* ir_block_create_binop(ir_block *self, lex_ctx ctx,
1557 const char *label, int opcode,
1558 ir_value *left, ir_value *right)
1580 case INSTR_SUB_S: /* -- offset of string as float */
1585 case INSTR_BITOR_IF:
1586 case INSTR_BITOR_FI:
1587 case INSTR_BITAND_FI:
1588 case INSTR_BITAND_IF:
1603 case INSTR_BITAND_I:
1606 case INSTR_RSHIFT_I:
1607 case INSTR_LSHIFT_I:
1629 /* boolean operations result in floats */
1630 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1632 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1635 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1640 if (ot == TYPE_VOID) {
1641 /* The AST or parser were supposed to check this! */
1645 return ir_block_create_general_instr(self, ctx, label, opcode, left, right, ot);
1648 ir_value* ir_block_create_unary(ir_block *self, lex_ctx ctx,
1649 const char *label, int opcode,
1652 int ot = TYPE_FLOAT;
1664 /* QC doesn't have other unary operations. We expect extensions to fill
1665 * the above list, otherwise we assume out-type = in-type, eg for an
1669 ot = operand->vtype;
1672 if (ot == TYPE_VOID) {
1673 /* The AST or parser were supposed to check this! */
1677 /* let's use the general instruction creator and pass NULL for OPB */
1678 return ir_block_create_general_instr(self, ctx, label, opcode, operand, NULL, ot);
1681 ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx ctx, const char *label,
1682 int op, ir_value *a, ir_value *b, int outype)
1687 out = ir_value_out(self->owner, label, store_value, outype);
1691 instr = ir_instr_new(ctx, self, op);
1693 ir_value_delete(out);
1697 if (!ir_instr_op(instr, 0, out, true) ||
1698 !ir_instr_op(instr, 1, a, false) ||
1699 !ir_instr_op(instr, 2, b, false) )
1704 vec_push(self->instr, instr);
1708 ir_instr_delete(instr);
1709 ir_value_delete(out);
1713 ir_value* ir_block_create_fieldaddress(ir_block *self, lex_ctx ctx, const char *label, ir_value *ent, ir_value *field)
1717 /* Support for various pointer types todo if so desired */
1718 if (ent->vtype != TYPE_ENTITY)
1721 if (field->vtype != TYPE_FIELD)
1724 v = ir_block_create_general_instr(self, ctx, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1725 v->fieldtype = field->fieldtype;
1729 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)
1732 if (ent->vtype != TYPE_ENTITY)
1735 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1736 if (field->vtype != TYPE_FIELD)
1741 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1742 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1743 case TYPE_STRING: op = INSTR_LOAD_S; break;
1744 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1745 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1746 case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1748 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1749 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1752 irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1756 return ir_block_create_general_instr(self, ctx, label, op, ent, field, outype);
1759 ir_value* ir_block_create_add(ir_block *self, lex_ctx ctx,
1761 ir_value *left, ir_value *right)
1764 int l = left->vtype;
1765 int r = right->vtype;
1769 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1785 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1787 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1792 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1796 return ir_block_create_binop(self, ctx, label, op, left, right);
1799 ir_value* ir_block_create_sub(ir_block *self, lex_ctx ctx,
1801 ir_value *left, ir_value *right)
1804 int l = left->vtype;
1805 int r = right->vtype;
1810 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1826 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1828 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1833 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1837 return ir_block_create_binop(self, ctx, label, op, left, right);
1840 ir_value* ir_block_create_mul(ir_block *self, lex_ctx ctx,
1842 ir_value *left, ir_value *right)
1845 int l = left->vtype;
1846 int r = right->vtype;
1851 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1866 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1868 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1871 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1873 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1875 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1877 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1881 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1885 return ir_block_create_binop(self, ctx, label, op, left, right);
1888 ir_value* ir_block_create_div(ir_block *self, lex_ctx ctx,
1890 ir_value *left, ir_value *right)
1893 int l = left->vtype;
1894 int r = right->vtype;
1899 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1912 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1914 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1916 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1921 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1925 return ir_block_create_binop(self, ctx, label, op, left, right);
1928 /* PHI resolving breaks the SSA, and must thus be the last
1929 * step before life-range calculation.
1932 static bool ir_block_naive_phi(ir_block *self);
1933 bool ir_function_naive_phi(ir_function *self)
1937 for (i = 0; i < vec_size(self->blocks); ++i)
1939 if (!ir_block_naive_phi(self->blocks[i]))
1946 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1951 /* create a store */
1952 if (!ir_block_create_store(block, old, what))
1955 /* we now move it up */
1956 instr = vec_last(block->instr);
1957 for (i = vec_size(block->instr)-1; i > iid; --i)
1958 block->instr[i] = block->instr[i-1];
1959 block->instr[i] = instr;
1965 static bool ir_block_naive_phi(ir_block *self)
1967 size_t i, p; /*, w;*/
1968 /* FIXME: optionally, create_phi can add the phis
1969 * to a list so we don't need to loop through blocks
1970 * - anyway: "don't optimize YET"
1972 for (i = 0; i < vec_size(self->instr); ++i)
1974 ir_instr *instr = self->instr[i];
1975 if (instr->opcode != VINSTR_PHI)
1978 vec_remove(self->instr, i, 1);
1979 --i; /* NOTE: i+1 below */
1981 for (p = 0; p < vec_size(instr->phi); ++p)
1983 ir_value *v = instr->phi[p].value;
1984 ir_block *b = instr->phi[p].from;
1986 if (v->store == store_value &&
1987 vec_size(v->reads) == 1 &&
1988 vec_size(v->writes) == 1)
1990 /* replace the value */
1991 if (!ir_instr_op(v->writes[0], 0, instr->_ops[0], true))
1996 /* force a move instruction */
1997 ir_instr *prevjump = vec_last(b->instr);
2000 instr->_ops[0]->store = store_global;
2001 if (!ir_block_create_store(b, instr->context, instr->_ops[0], v))
2003 instr->_ops[0]->store = store_value;
2004 vec_push(b->instr, prevjump);
2009 ir_value *v = instr->phi[p].value;
2010 for (w = 0; w < vec_size(v->writes); ++w) {
2013 if (!v->writes[w]->_ops[0])
2016 /* When the write was to a global, we have to emit a mov */
2017 old = v->writes[w]->_ops[0];
2019 /* The original instruction now writes to the PHI target local */
2020 if (v->writes[w]->_ops[0] == v)
2021 v->writes[w]->_ops[0] = instr->_ops[0];
2023 if (old->store != store_value && old->store != store_local && old->store != store_param)
2025 /* If it originally wrote to a global we need to store the value
2028 if (!ir_naive_phi_emit_store(self, i+1, old, v))
2030 if (i+1 < vec_size(self->instr))
2031 instr = self->instr[i+1];
2034 /* In case I forget and access instr later, it'll be NULL
2035 * when it's a problem, to make sure we crash, rather than accessing
2041 /* If it didn't, we can replace all reads by the phi target now. */
2043 for (r = 0; r < vec_size(old->reads); ++r)
2046 ir_instr *ri = old->reads[r];
2047 for (op = 0; op < vec_size(ri->phi); ++op) {
2048 if (ri->phi[op].value == old)
2049 ri->phi[op].value = v;
2051 for (op = 0; op < 3; ++op) {
2052 if (ri->_ops[op] == old)
2060 ir_instr_delete(instr);
2065 /***********************************************************************
2066 *IR Temp allocation code
2067 * Propagating value life ranges by walking through the function backwards
2068 * until no more changes are made.
2069 * In theory this should happen once more than once for every nested loop
2071 * Though this implementation might run an additional time for if nests.
2074 /* Enumerate instructions used by value's life-ranges
2076 static void ir_block_enumerate(ir_block *self, size_t *_eid)
2080 for (i = 0; i < vec_size(self->instr); ++i)
2082 self->instr[i]->eid = eid++;
2087 /* Enumerate blocks and instructions.
2088 * The block-enumeration is unordered!
2089 * We do not really use the block enumreation, however
2090 * the instruction enumeration is important for life-ranges.
2092 void ir_function_enumerate(ir_function *self)
2095 size_t instruction_id = 0;
2096 for (i = 0; i < vec_size(self->blocks); ++i)
2098 self->blocks[i]->eid = i;
2099 self->blocks[i]->run_id = 0;
2100 ir_block_enumerate(self->blocks[i], &instruction_id);
2104 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
2105 bool ir_function_calculate_liferanges(ir_function *self)
2113 for (i = 0; i != vec_size(self->blocks); ++i)
2115 if (self->blocks[i]->is_return)
2117 vec_free(self->blocks[i]->living);
2118 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
2123 if (vec_size(self->blocks)) {
2124 ir_block *block = self->blocks[0];
2125 for (i = 0; i < vec_size(block->living); ++i) {
2126 ir_value *v = block->living[i];
2127 if (v->memberof || v->store != store_local)
2129 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2130 "variable `%s` may be used uninitialized in this function", v->name))
2139 /* Local-value allocator
2140 * After finishing creating the liferange of all values used in a function
2141 * we can allocate their global-positions.
2142 * This is the counterpart to register-allocation in register machines.
2148 } function_allocator;
2150 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
2153 size_t vsize = type_sizeof[var->vtype];
2155 slot = ir_value_var("reg", store_global, var->vtype);
2159 if (!ir_value_life_merge_into(slot, var))
2162 vec_push(alloc->locals, slot);
2163 vec_push(alloc->sizes, vsize);
2168 ir_value_delete(slot);
2172 bool ir_function_allocate_locals(ir_function *self)
2181 function_allocator alloc;
2183 if (!vec_size(self->locals) && !vec_size(self->values))
2186 alloc.locals = NULL;
2188 alloc.positions = NULL;
2190 for (i = 0; i < vec_size(self->locals); ++i)
2192 if (!function_allocator_alloc(&alloc, self->locals[i]))
2196 /* Allocate a slot for any value that still exists */
2197 for (i = 0; i < vec_size(self->values); ++i)
2199 v = self->values[i];
2201 if (!vec_size(v->life))
2204 for (a = 0; a < vec_size(alloc.locals); ++a)
2206 slot = alloc.locals[a];
2208 /* never resize parameters
2209 * will be required later when overlapping temps + locals
2211 if (a < vec_size(self->params) &&
2212 alloc.sizes[a] < type_sizeof[v->vtype])
2217 if (ir_values_overlap(v, slot))
2220 if (!ir_value_life_merge_into(slot, v))
2223 /* adjust size for this slot */
2224 if (alloc.sizes[a] < type_sizeof[v->vtype])
2225 alloc.sizes[a] = type_sizeof[v->vtype];
2227 self->values[i]->code.local = a;
2230 if (a >= vec_size(alloc.locals)) {
2231 self->values[i]->code.local = vec_size(alloc.locals);
2232 if (!function_allocator_alloc(&alloc, v))
2241 /* Adjust slot positions based on sizes */
2242 vec_push(alloc.positions, 0);
2244 if (vec_size(alloc.sizes))
2245 pos = alloc.positions[0] + alloc.sizes[0];
2248 for (i = 1; i < vec_size(alloc.sizes); ++i)
2250 pos = alloc.positions[i-1] + alloc.sizes[i-1];
2251 vec_push(alloc.positions, pos);
2254 self->allocated_locals = pos + vec_last(alloc.sizes);
2256 /* Take over the actual slot positions */
2257 for (i = 0; i < vec_size(self->values); ++i) {
2258 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
2266 for (i = 0; i < vec_size(alloc.locals); ++i)
2267 ir_value_delete(alloc.locals[i]);
2268 vec_free(alloc.locals);
2269 vec_free(alloc.sizes);
2270 vec_free(alloc.positions);
2274 /* Get information about which operand
2275 * is read from, or written to.
2277 static void ir_op_read_write(int op, size_t *read, size_t *write)
2297 case INSTR_STOREP_F:
2298 case INSTR_STOREP_V:
2299 case INSTR_STOREP_S:
2300 case INSTR_STOREP_ENT:
2301 case INSTR_STOREP_FLD:
2302 case INSTR_STOREP_FNC:
2313 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2316 bool changed = false;
2318 for (i = 0; i != vec_size(self->living); ++i)
2320 tempbool = ir_value_life_merge(self->living[i], eid);
2323 irerror(self->context, "block_living_add_instr() value instruction added %s: %i", self->living[i]->_name, (int)eid);
2325 changed = changed || tempbool;
2330 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
2336 /* values which have been read in a previous iteration are now
2337 * in the "living" array even if the previous block doesn't use them.
2338 * So we have to remove whatever does not exist in the previous block.
2339 * They will be re-added on-read, but the liferange merge won't cause
2342 for (i = 0; i < vec_size(self->living); ++i)
2344 if (!vec_ir_value_find(prev->living, self->living[i], NULL)) {
2345 vec_remove(self->living, i, 1);
2350 /* Whatever the previous block still has in its living set
2351 * must now be added to ours as well.
2353 for (i = 0; i < vec_size(prev->living); ++i)
2355 if (vec_ir_value_find(self->living, prev->living[i], NULL))
2357 vec_push(self->living, prev->living[i]);
2359 irerror(self->contextt from prev: %s", self->label, prev->living[i]->_name);
2365 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
2371 /* bitmasks which operands are read from or written to */
2373 char dbg_ind[16] = { '#', '0' };
2378 if (!ir_block_life_prop_previous(self, prev, changed))
2382 i = vec_size(self->instr);
2385 instr = self->instr[i];
2387 /* PHI operands are always read operands */
2388 for (p = 0; p < vec_size(instr->phi); ++p)
2390 value = instr->phi[p].value;
2391 if (value->memberof)
2392 value = value->memberof;
2393 if (!vec_ir_value_find(self->living, value, NULL))
2394 vec_push(self->living, value);
2397 /* call params are read operands too */
2398 for (p = 0; p < vec_size(instr->params); ++p)
2400 value = instr->params[p];
2401 if (value->memberof)
2402 value = value->memberof;
2403 if (!vec_ir_value_find(self->living, value, NULL))
2404 vec_push(self->living, value);
2407 /* See which operands are read and write operands */
2408 ir_op_read_write(instr->opcode, &read, &write);
2410 if (instr->opcode == INSTR_MUL_VF)
2412 /* the float source will get an additional lifetime */
2413 tempbool = ir_value_life_merge(instr->_ops[2], instr->eid+1);
2414 *changed = *changed || tempbool;
2416 else if (instr->opcode == INSTR_MUL_FV)
2418 /* the float source will get an additional lifetime */
2419 tempbool = ir_value_life_merge(instr->_ops[1], instr->eid+1);
2420 *changed = *changed || tempbool;
2423 /* Go through the 3 main operands */
2424 for (o = 0; o < 3; ++o)
2426 if (!instr->_ops[o]) /* no such operand */
2429 value = instr->_ops[o];
2430 if (value->memberof)
2431 value = value->memberof;
2433 /* We only care about locals */
2434 /* we also calculate parameter liferanges so that locals
2435 * can take up parameter slots */
2436 if (value->store != store_value &&
2437 value->store != store_local &&
2438 value->store != store_param)
2444 if (!vec_ir_value_find(self->living, value, NULL))
2445 vec_push(self->living, value);
2448 /* write operands */
2449 /* When we write to a local, we consider it "dead" for the
2450 * remaining upper part of the function, since in SSA a value
2451 * can only be written once (== created)
2456 bool in_living = vec_ir_value_find(self->living, value, &idx);
2459 /* If the value isn't alive it hasn't been read before... */
2460 /* TODO: See if the warning can be emitted during parsing or AST processing
2461 * otherwise have warning printed here.
2462 * IF printing a warning here: include filecontext_t,
2463 * and make sure it's only printed once
2464 * since this function is run multiple times.
2466 /* For now: debug info: */
2467 /* con_err( "Value only written %s\n", value->name); */
2468 tempbool = ir_value_life_merge(value, instr->eid);
2469 *changed = *changed || tempbool;
2471 ir_instr_dump(instr, dbg_ind, printf);
2475 /* since 'living' won't contain it
2476 * anymore, merge the value, since
2479 tempbool = ir_value_life_merge(value, instr->eid);
2482 con_err( "value added id %s %i\n", value->name, (int)instr->eid);
2484 *changed = *changed || tempbool;
2486 vec_remove(self->living, idx, 1);
2491 tempbool = ir_block_living_add_instr(self, instr->eid);
2492 /*con_err( "living added values\n");*/
2493 *changed = *changed || tempbool;
2497 if (self->run_id == self->owner->run_id)
2500 self->run_id = self->owner->run_id;
2502 for (i = 0; i < vec_size(self->entries); ++i)
2504 ir_block *entry = self->entries[i];
2505 ir_block_life_propagate(entry, self, changed);
2511 /***********************************************************************
2514 * Since the IR has the convention of putting 'write' operands
2515 * at the beginning, we have to rotate the operands of instructions
2516 * properly in order to generate valid QCVM code.
2518 * Having destinations at a fixed position is more convenient. In QC
2519 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2520 * read from from OPA, and store to OPB rather than OPC. Which is
2521 * partially the reason why the implementation of these instructions
2522 * in darkplaces has been delayed for so long.
2524 * Breaking conventions is annoying...
2526 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2528 static bool gen_global_field(ir_value *global)
2530 if (global->hasvalue)
2532 ir_value *fld = global->constval.vpointer;
2534 irerror(global->context, "Invalid field constant with no field: %s", global->name);
2538 /* copy the field's value */
2539 ir_value_code_setaddr(global, vec_size(code_globals));
2540 vec_push(code_globals, fld->code.fieldaddr);
2541 if (global->fieldtype == TYPE_VECTOR) {
2542 vec_push(code_globals, fld->code.fieldaddr+1);
2543 vec_push(code_globals, fld->code.fieldaddr+2);
2548 ir_value_code_setaddr(global, vec_size(code_globals));
2549 vec_push(code_globals, 0);
2550 if (global->fieldtype == TYPE_VECTOR) {
2551 vec_push(code_globals, 0);
2552 vec_push(code_globals, 0);
2555 if (global->code.globaladdr < 0)
2560 static bool gen_global_pointer(ir_value *global)
2562 if (global->hasvalue)
2564 ir_value *target = global->constval.vpointer;
2566 irerror(global->context, "Invalid pointer constant: %s", global->name);
2567 /* NULL pointers are pointing to the NULL constant, which also
2568 * sits at address 0, but still has an ir_value for itself.
2573 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2574 * void() foo; <- proto
2575 * void() *fooptr = &foo;
2576 * void() foo = { code }
2578 if (!target->code.globaladdr) {
2579 /* FIXME: Check for the constant nullptr ir_value!
2580 * because then code.globaladdr being 0 is valid.
2582 irerror(global->context, "FIXME: Relocation support");
2586 ir_value_code_setaddr(global, vec_size(code_globals));
2587 vec_push(code_globals, target->code.globaladdr);
2591 ir_value_code_setaddr(global, vec_size(code_globals));
2592 vec_push(code_globals, 0);
2594 if (global->code.globaladdr < 0)
2599 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2601 prog_section_statement stmt;
2610 block->generated = true;
2611 block->code_start = vec_size(code_statements);
2612 for (i = 0; i < vec_size(block->instr); ++i)
2614 instr = block->instr[i];
2616 if (instr->opcode == VINSTR_PHI) {
2617 irerror(block->context, "cannot generate virtual instruction (phi)");
2621 if (instr->opcode == VINSTR_JUMP) {
2622 target = instr->bops[0];
2623 /* for uncoditional jumps, if the target hasn't been generated
2624 * yet, we generate them right here.
2626 if (!target->generated) {
2631 /* otherwise we generate a jump instruction */
2632 stmt.opcode = INSTR_GOTO;
2633 stmt.o1.s1 = (target->code_start) - vec_size(code_statements);
2636 code_push_statement(&stmt, instr->context.line);
2638 /* no further instructions can be in this block */
2642 if (instr->opcode == VINSTR_COND) {
2643 ontrue = instr->bops[0];
2644 onfalse = instr->bops[1];
2645 /* TODO: have the AST signal which block should
2646 * come first: eg. optimize IFs without ELSE...
2649 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2653 if (ontrue->generated) {
2654 stmt.opcode = INSTR_IF;
2655 stmt.o2.s1 = (ontrue->code_start) - vec_size(code_statements);
2656 code_push_statement(&stmt, instr->context.line);
2658 if (onfalse->generated) {
2659 stmt.opcode = INSTR_IFNOT;
2660 stmt.o2.s1 = (onfalse->code_start) - vec_size(code_statements);
2661 code_push_statement(&stmt, instr->context.line);
2663 if (!ontrue->generated) {
2664 if (onfalse->generated) {
2669 if (!onfalse->generated) {
2670 if (ontrue->generated) {
2675 /* neither ontrue nor onfalse exist */
2676 stmt.opcode = INSTR_IFNOT;
2677 if (!instr->likely) {
2678 /* Honor the likelyhood hint */
2679 ir_block *tmp = onfalse;
2680 stmt.opcode = INSTR_IF;
2684 stidx = vec_size(code_statements);
2685 code_push_statement(&stmt, instr->context.line);
2686 /* on false we jump, so add ontrue-path */
2687 if (!gen_blocks_recursive(func, ontrue))
2689 /* fixup the jump address */
2690 code_statements[stidx].o2.s1 = vec_size(code_statements) - stidx;
2691 /* generate onfalse path */
2692 if (onfalse->generated) {
2693 /* fixup the jump address */
2694 code_statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2695 stmt.opcode = vec_last(code_statements).opcode;
2696 if (stmt.opcode == INSTR_GOTO ||
2697 stmt.opcode == INSTR_IF ||
2698 stmt.opcode == INSTR_IFNOT ||
2699 stmt.opcode == INSTR_RETURN ||
2700 stmt.opcode == INSTR_DONE)
2702 /* no use jumping from here */
2705 /* may have been generated in the previous recursive call */
2706 stmt.opcode = INSTR_GOTO;
2707 stmt.o1.s1 = (onfalse->code_start) - vec_size(code_statements);
2710 code_push_statement(&stmt, instr->context.line);
2713 /* if not, generate now */
2718 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2719 /* Trivial call translation:
2720 * copy all params to OFS_PARM*
2721 * if the output's storetype is not store_return,
2722 * add append a STORE instruction!
2724 * NOTES on how to do it better without much trouble:
2725 * -) The liferanges!
2726 * Simply check the liferange of all parameters for
2727 * other CALLs. For each param with no CALL in its
2728 * liferange, we can store it in an OFS_PARM at
2729 * generation already. This would even include later
2730 * reuse.... probably... :)
2735 first = vec_size(instr->params);
2738 for (p = 0; p < first; ++p)
2740 ir_value *param = instr->params[p];
2742 stmt.opcode = INSTR_STORE_F;
2745 if (param->vtype == TYPE_FIELD)
2746 stmt.opcode = field_store_instr[param->fieldtype];
2748 stmt.opcode = type_store_instr[param->vtype];
2749 stmt.o1.u1 = ir_value_code_addr(param);
2750 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2751 code_push_statement(&stmt, instr->context.line);
2753 /* Now handle extparams */
2754 first = vec_size(instr->params);
2755 for (; p < first; ++p)
2757 ir_builder *ir = func->owner;
2758 ir_value *param = instr->params[p];
2759 ir_value *targetparam;
2761 if (p-8 >= vec_size(ir->extparams))
2762 ir_gen_extparam(ir);
2764 targetparam = ir->extparams[p-8];
2766 stmt.opcode = INSTR_STORE_F;
2769 if (param->vtype == TYPE_FIELD)
2770 stmt.opcode = field_store_instr[param->fieldtype];
2772 stmt.opcode = type_store_instr[param->vtype];
2773 stmt.o1.u1 = ir_value_code_addr(param);
2774 stmt.o2.u1 = ir_value_code_addr(targetparam);
2775 code_push_statement(&stmt, instr->context.line);
2778 stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
2779 if (stmt.opcode > INSTR_CALL8)
2780 stmt.opcode = INSTR_CALL8;
2781 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2784 code_push_statement(&stmt, instr->context.line);
2786 retvalue = instr->_ops[0];
2787 if (retvalue && retvalue->store != store_return && vec_size(retvalue->life))
2789 /* not to be kept in OFS_RETURN */
2790 if (retvalue->vtype == TYPE_FIELD)
2791 stmt.opcode = field_store_instr[retvalue->vtype];
2793 stmt.opcode = type_store_instr[retvalue->vtype];
2794 stmt.o1.u1 = OFS_RETURN;
2795 stmt.o2.u1 = ir_value_code_addr(retvalue);
2797 code_push_statement(&stmt, instr->context.line);
2802 if (instr->opcode == INSTR_STATE) {
2803 irerror(block->context, "TODO: state instruction");
2807 stmt.opcode = instr->opcode;
2812 /* This is the general order of operands */
2814 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
2817 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2820 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
2822 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2824 stmt.o1.u1 = stmt.o3.u1;
2827 else if ((stmt.opcode >= INSTR_STORE_F &&
2828 stmt.opcode <= INSTR_STORE_FNC) ||
2829 (stmt.opcode >= INSTR_STOREP_F &&
2830 stmt.opcode <= INSTR_STOREP_FNC))
2832 /* 2-operand instructions with A -> B */
2833 stmt.o2.u1 = stmt.o3.u1;
2837 code_push_statement(&stmt, instr->context.line);
2842 static bool gen_function_code(ir_function *self)
2845 prog_section_statement stmt;
2847 /* Starting from entry point, we generate blocks "as they come"
2848 * for now. Dead blocks will not be translated obviously.
2850 if (!vec_size(self->blocks)) {
2851 irerror(self->context, "Function '%s' declared without body.", self->name);
2855 block = self->blocks[0];
2856 if (block->generated)
2859 if (!gen_blocks_recursive(self, block)) {
2860 irerror(self->context, "failed to generate blocks for '%s'", self->name);
2864 /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
2865 stmt.opcode = AINSTR_END;
2869 code_push_statement(&stmt, vec_last(code_linenums));
2873 static qcint ir_builder_filestring(ir_builder *ir, const char *filename)
2875 /* NOTE: filename pointers are copied, we never strdup them,
2876 * thus we can use pointer-comparison to find the string.
2881 for (i = 0; i < vec_size(ir->filenames); ++i) {
2882 if (ir->filenames[i] == filename)
2883 return ir->filestrings[i];
2886 str = code_genstring(filename);
2887 vec_push(ir->filenames, filename);
2888 vec_push(ir->filestrings, str);
2892 static bool gen_global_function(ir_builder *ir, ir_value *global)
2894 prog_section_function fun;
2898 size_t local_var_end;
2900 if (!global->hasvalue || (!global->constval.vfunc))
2902 irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
2906 irfun = global->constval.vfunc;
2908 fun.name = global->code.name;
2909 fun.file = ir_builder_filestring(ir, global->context.file);
2910 fun.profile = 0; /* always 0 */
2911 fun.nargs = vec_size(irfun->params);
2915 for (i = 0;i < 8; ++i) {
2916 if ((int32_t)i >= fun.nargs)
2919 fun.argsize[i] = type_sizeof[irfun->params[i]];
2922 fun.firstlocal = vec_size(code_globals);
2924 local_var_end = fun.firstlocal;
2925 for (i = 0; i < vec_size(irfun->locals); ++i) {
2926 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
2927 irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
2931 if (vec_size(irfun->locals)) {
2932 ir_value *last = vec_last(irfun->locals);
2933 local_var_end = last->code.globaladdr;
2934 if (last->vtype == TYPE_FIELD && last->fieldtype == TYPE_VECTOR)
2935 local_var_end += type_sizeof[TYPE_VECTOR];
2937 local_var_end += type_sizeof[last->vtype];
2939 for (i = 0; i < vec_size(irfun->values); ++i)
2941 /* generate code.globaladdr for ssa values */
2942 ir_value *v = irfun->values[i];
2943 ir_value_code_setaddr(v, local_var_end + v->code.local);
2945 for (i = 0; i < irfun->allocated_locals; ++i) {
2946 /* fill the locals with zeros */
2947 vec_push(code_globals, 0);
2950 fun.locals = vec_size(code_globals) - fun.firstlocal;
2953 fun.entry = irfun->builtin+1;
2955 irfun->code_function_def = vec_size(code_functions);
2956 fun.entry = vec_size(code_statements);
2959 vec_push(code_functions, fun);
2963 static void ir_gen_extparam(ir_builder *ir)
2965 prog_section_def def;
2969 snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparams)+8));
2970 global = ir_value_var(name, store_global, TYPE_VECTOR);
2972 def.name = code_genstring(name);
2973 def.type = TYPE_VECTOR;
2974 def.offset = vec_size(code_globals);
2976 vec_push(code_defs, def);
2977 ir_value_code_setaddr(global, def.offset);
2978 vec_push(code_globals, 0);
2979 vec_push(code_globals, 0);
2980 vec_push(code_globals, 0);
2982 vec_push(ir->extparams, global);
2985 static bool gen_function_extparam_copy(ir_function *self)
2987 size_t i, ext, numparams;
2989 ir_builder *ir = self->owner;
2991 prog_section_statement stmt;
2993 numparams = vec_size(self->params);
2997 stmt.opcode = INSTR_STORE_F;
2999 for (i = 8; i < numparams; ++i) {
3001 if (ext >= vec_size(ir->extparams))
3002 ir_gen_extparam(ir);
3004 ep = ir->extparams[ext];
3006 stmt.opcode = type_store_instr[self->locals[i]->vtype];
3007 if (self->locals[i]->vtype == TYPE_FIELD &&
3008 self->locals[i]->fieldtype == TYPE_VECTOR)
3010 stmt.opcode = INSTR_STORE_V;
3012 stmt.o1.u1 = ir_value_code_addr(ep);
3013 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3014 code_push_statement(&stmt, self->context.line);
3020 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
3022 prog_section_function *fundef;
3027 irfun = global->constval.vfunc;
3029 if (global->cvq == CV_NONE) {
3030 irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
3031 "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
3033 /* this was a function pointer, don't generate code for those */
3040 if (irfun->code_function_def < 0) {
3041 irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
3044 fundef = &code_functions[irfun->code_function_def];
3046 fundef->entry = vec_size(code_statements);
3047 if (!gen_function_extparam_copy(irfun)) {
3048 irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
3051 if (!gen_function_code(irfun)) {
3052 irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
3058 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
3062 prog_section_def def;
3064 def.type = global->vtype;
3065 def.offset = vec_size(code_globals);
3068 if (global->name[0] == '#') {
3069 if (!self->str_immediate)
3070 self->str_immediate = code_genstring("IMMEDIATE");
3071 def.name = global->code.name = self->str_immediate;
3074 def.name = global->code.name = code_genstring(global->name);
3079 switch (global->vtype)
3082 if (!strcmp(global->name, "end_sys_globals")) {
3083 /* TODO: remember this point... all the defs before this one
3084 * should be checksummed and added to progdefs.h when we generate it.
3087 else if (!strcmp(global->name, "end_sys_fields")) {
3088 /* TODO: same as above but for entity-fields rather than globsl
3092 irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
3094 /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
3095 * the system fields actually go? Though the engine knows this anyway...
3096 * Maybe this could be an -foption
3097 * fteqcc creates data for end_sys_* - of size 1, so let's do the same
3099 ir_value_code_setaddr(global, vec_size(code_globals));
3100 vec_push(code_globals, 0);
3102 vec_push(code_defs, def);
3105 vec_push(code_defs, def);
3106 return gen_global_pointer(global);
3108 vec_push(code_defs, def);
3109 return gen_global_field(global);
3114 ir_value_code_setaddr(global, vec_size(code_globals));
3115 if (global->hasvalue) {
3116 iptr = (int32_t*)&global->constval.ivec[0];
3117 vec_push(code_globals, *iptr);
3119 vec_push(code_globals, 0);
3121 def.type |= DEF_SAVEGLOBAL;
3123 vec_push(code_defs, def);
3125 return global->code.globaladdr >= 0;
3129 ir_value_code_setaddr(global, vec_size(code_globals));
3130 if (global->hasvalue) {
3131 vec_push(code_globals, code_genstring(global->constval.vstring));
3133 vec_push(code_globals, 0);
3135 def.type |= DEF_SAVEGLOBAL;
3137 vec_push(code_defs, def);
3138 return global->code.globaladdr >= 0;
3143 ir_value_code_setaddr(global, vec_size(code_globals));
3144 if (global->hasvalue) {
3145 iptr = (int32_t*)&global->constval.ivec[0];
3146 vec_push(code_globals, iptr[0]);
3147 if (global->code.globaladdr < 0)
3149 for (d = 1; d < type_sizeof[global->vtype]; ++d)
3151 vec_push(code_globals, iptr[d]);
3154 vec_push(code_globals, 0);
3155 if (global->code.globaladdr < 0)
3157 for (d = 1; d < type_sizeof[global->vtype]; ++d)
3159 vec_push(code_globals, 0);
3162 def.type |= DEF_SAVEGLOBAL;
3165 vec_push(code_defs, def);
3166 return global->code.globaladdr >= 0;
3169 ir_value_code_setaddr(global, vec_size(code_globals));
3170 if (!global->hasvalue) {
3171 vec_push(code_globals, 0);
3172 if (global->code.globaladdr < 0)
3175 vec_push(code_globals, vec_size(code_functions));
3176 if (!gen_global_function(self, global))
3179 def.type |= DEF_SAVEGLOBAL;
3181 vec_push(code_defs, def);
3184 /* assume biggest type */
3185 ir_value_code_setaddr(global, vec_size(code_globals));
3186 vec_push(code_globals, 0);
3187 for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
3188 vec_push(code_globals, 0);
3191 /* refuse to create 'void' type or any other fancy business. */
3192 irerror(global->context, "Invalid type for global variable `%s`: %s",
3193 global->name, type_name[global->vtype]);
3198 static void ir_builder_prepare_field(ir_value *field)
3200 field->code.fieldaddr = code_alloc_field(type_sizeof[field->fieldtype]);
3203 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
3205 prog_section_def def;
3206 prog_section_field fld;
3210 def.type = (uint16_t)field->vtype;
3211 def.offset = (uint16_t)vec_size(code_globals);
3213 /* create a global named the same as the field */
3214 if (opts_standard == COMPILER_GMQCC) {
3215 /* in our standard, the global gets a dot prefix */
3216 size_t len = strlen(field->name);
3219 /* we really don't want to have to allocate this, and 1024
3220 * bytes is more than enough for a variable/field name
3222 if (len+2 >= sizeof(name)) {
3223 irerror(field->context, "invalid field name size: %u", (unsigned int)len);
3228 memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
3231 def.name = code_genstring(name);
3232 fld.name = def.name + 1; /* we reuse that string table entry */
3234 /* in plain QC, there cannot be a global with the same name,
3235 * and so we also name the global the same.
3236 * FIXME: fteqcc should create a global as well
3237 * check if it actually uses the same name. Probably does
3239 def.name = code_genstring(field->name);
3240 fld.name = def.name;
3243 field->code.name = def.name;
3245 vec_push(code_defs, def);
3247 fld.type = field->fieldtype;
3249 if (fld.type == TYPE_VOID) {
3250 irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3254 fld.offset = field->code.fieldaddr;
3256 vec_push(code_fields, fld);
3258 ir_value_code_setaddr(field, vec_size(code_globals));
3259 vec_push(code_globals, fld.offset);
3260 if (fld.type == TYPE_VECTOR) {
3261 vec_push(code_globals, fld.offset+1);
3262 vec_push(code_globals, fld.offset+2);
3265 return field->code.globaladdr >= 0;
3268 bool ir_builder_generate(ir_builder *self, const char *filename)
3270 prog_section_statement stmt;
3272 char *lnofile = NULL;
3276 for (i = 0; i < vec_size(self->fields); ++i)
3278 ir_builder_prepare_field(self->fields[i]);
3281 for (i = 0; i < vec_size(self->globals); ++i)
3283 if (!ir_builder_gen_global(self, self->globals[i], false)) {
3288 for (i = 0; i < vec_size(self->fields); ++i)
3290 if (!ir_builder_gen_field(self, self->fields[i])) {
3295 /* generate function code */
3296 for (i = 0; i < vec_size(self->globals); ++i)
3298 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3299 if (!gen_global_function_code(self, self->globals[i])) {
3305 if (vec_size(code_globals) >= 65536) {
3306 irerror(vec_last(self->globals)->context, "This progs file would require more globals than the metadata can handle. Bailing out.");
3310 /* DP errors if the last instruction is not an INSTR_DONE
3311 * and for debugging purposes we add an additional AINSTR_END
3312 * to the end of functions, so here it goes:
3314 stmt.opcode = INSTR_DONE;
3318 code_push_statement(&stmt, vec_last(code_linenums));
3323 if (vec_size(code_statements) != vec_size(code_linenums)) {
3324 con_err("Linecounter wrong: %lu != %lu\n",
3325 (unsigned long)vec_size(code_statements),
3326 (unsigned long)vec_size(code_linenums));
3327 } else if (OPTS_FLAG(LNO)) {
3329 size_t filelen = strlen(filename);
3331 memcpy(vec_add(lnofile, filelen+1), filename, filelen+1);
3332 dot = strrchr(lnofile, '.');
3336 vec_shrinkto(lnofile, dot - lnofile);
3338 memcpy(vec_add(lnofile, 5), ".lno", 5);
3342 con_out("writing '%s' and '%s'...\n", filename, lnofile);
3344 con_out("writing '%s'\n", filename);
3345 if (!code_write(filename, lnofile)) {
3353 /***********************************************************************
3354 *IR DEBUG Dump functions...
3357 #define IND_BUFSZ 1024
3360 # define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
3363 const char *qc_opname(int op)
3365 if (op < 0) return "<INVALID>";
3366 if (op < (int)( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
3367 return asm_instr[op].m;
3369 case VINSTR_PHI: return "PHI";
3370 case VINSTR_JUMP: return "JUMP";
3371 case VINSTR_COND: return "COND";
3372 default: return "<UNK>";
3376 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
3379 char indent[IND_BUFSZ];
3383 oprintf("module %s\n", b->name);
3384 for (i = 0; i < vec_size(b->globals); ++i)
3387 if (b->globals[i]->hasvalue)
3388 oprintf("%s = ", b->globals[i]->name);
3389 ir_value_dump(b->globals[i], oprintf);
3392 for (i = 0; i < vec_size(b->functions); ++i)
3393 ir_function_dump(b->functions[i], indent, oprintf);
3394 oprintf("endmodule %s\n", b->name);
3397 void ir_function_dump(ir_function *f, char *ind,
3398 int (*oprintf)(const char*, ...))
3401 if (f->builtin != 0) {
3402 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
3405 oprintf("%sfunction %s\n", ind, f->name);
3406 strncat(ind, "\t", IND_BUFSZ);
3407 if (vec_size(f->locals))
3409 oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
3410 for (i = 0; i < vec_size(f->locals); ++i) {
3411 oprintf("%s\t", ind);
3412 ir_value_dump(f->locals[i], oprintf);
3416 oprintf("%sliferanges:\n", ind);
3417 for (i = 0; i < vec_size(f->locals); ++i) {
3419 ir_value *v = f->locals[i];
3420 oprintf("%s\t%s: unique ", ind, v->name);
3421 for (l = 0; l < vec_size(v->life); ++l) {
3422 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3426 for (i = 0; i < vec_size(f->values); ++i) {
3428 ir_value *v = f->values[i];
3429 oprintf("%s\t%s: @%i ", ind, v->name, (int)v->code.local);
3430 for (l = 0; l < vec_size(v->life); ++l) {
3431 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3435 if (vec_size(f->blocks))
3437 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
3438 for (i = 0; i < vec_size(f->blocks); ++i) {
3439 if (f->blocks[i]->run_id != f->run_id) {
3440 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
3442 ir_block_dump(f->blocks[i], ind, oprintf);
3446 ind[strlen(ind)-1] = 0;
3447 oprintf("%sendfunction %s\n", ind, f->name);
3450 void ir_block_dump(ir_block* b, char *ind,
3451 int (*oprintf)(const char*, ...))
3454 oprintf("%s:%s\n", ind, b->label);
3455 strncat(ind, "\t", IND_BUFSZ);
3457 for (i = 0; i < vec_size(b->instr); ++i)
3458 ir_instr_dump(b->instr[i], ind, oprintf);
3459 ind[strlen(ind)-1] = 0;
3462 void dump_phi(ir_instr *in, int (*oprintf)(const char*, ...))
3465 oprintf("%s <- phi ", in->_ops[0]->name);
3466 for (i = 0; i < vec_size(in->phi); ++i)
3468 oprintf("([%s] : %s) ", in->phi[i].from->label,
3469 in->phi[i].value->name);
3474 void ir_instr_dump(ir_instr *in, char *ind,
3475 int (*oprintf)(const char*, ...))
3478 const char *comma = NULL;
3480 oprintf("%s (%i) ", ind, (int)in->eid);
3482 if (in->opcode == VINSTR_PHI) {
3483 dump_phi(in, oprintf);
3487 strncat(ind, "\t", IND_BUFSZ);
3489 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
3490 ir_value_dump(in->_ops[0], oprintf);
3491 if (in->_ops[1] || in->_ops[2])
3494 if (in->opcode == INSTR_CALL0) {
3495 oprintf("CALL%i\t", vec_size(in->params));
3497 oprintf("%s\t", qc_opname(in->opcode));
3499 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
3500 ir_value_dump(in->_ops[0], oprintf);
3505 for (i = 1; i != 3; ++i) {
3509 ir_value_dump(in->_ops[i], oprintf);
3517 oprintf("[%s]", in->bops[0]->label);
3521 oprintf("%s[%s]", comma, in->bops[1]->label);
3522 if (vec_size(in->params)) {
3523 oprintf("\tparams: ");
3524 for (i = 0; i != vec_size(in->params); ++i) {
3525 oprintf("%s, ", in->params[i]->name);
3529 ind[strlen(ind)-1] = 0;
3532 void ir_value_dump_string(const char *str, int (*oprintf)(const char*, ...))
3535 for (; *str; ++str) {
3537 case '\n': oprintf("\\n"); break;
3538 case '\r': oprintf("\\r"); break;
3539 case '\t': oprintf("\\t"); break;
3540 case '\v': oprintf("\\v"); break;
3541 case '\f': oprintf("\\f"); break;
3542 case '\b': oprintf("\\b"); break;
3543 case '\a': oprintf("\\a"); break;
3544 case '\\': oprintf("\\\\"); break;
3545 case '"': oprintf("\\\""); break;
3546 default: oprintf("%c", *str); break;
3552 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
3561 oprintf("fn:%s", v->name);
3564 oprintf("%g", v->constval.vfloat);
3567 oprintf("'%g %g %g'",
3570 v->constval.vvec.z);
3573 oprintf("(entity)");
3576 ir_value_dump_string(v->constval.vstring, oprintf);
3580 oprintf("%i", v->constval.vint);
3585 v->constval.vpointer->name);
3589 oprintf("%s", v->name);
3593 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
3596 oprintf("Life of %12s:", self->name);
3597 for (i = 0; i < vec_size(self->life); ++i)
3599 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);