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 bool ir_function_pass_tailcall(ir_function *self)
536 for (b = 0; b < vec_size(self->blocks); ++b) {
538 ir_instr *ret, *call, *store = NULL;
539 ir_block *block = self->blocks[b];
541 if (!block->final || vec_size(block->instr) < 2)
544 ret = block->instr[vec_size(block->instr)-1];
545 if (ret->opcode != INSTR_DONE && ret->opcode != INSTR_RETURN)
548 call = block->instr[vec_size(block->instr)-2];
549 if (call->opcode >= INSTR_STORE_F && call->opcode <= INSTR_STORE_FNC) {
550 /* account for the unoptimized
552 * STORE %return, %tmp
556 if (vec_size(block->instr) < 3)
560 call = block->instr[vec_size(block->instr)-3];
563 if (call->opcode < INSTR_CALL0 || call->opcode > INSTR_CALL8)
567 /* optimize out the STORE */
569 ret->_ops[0] == store->_ops[0] &&
570 store->_ops[1] == call->_ops[0])
572 ++optimization_count[OPTIM_MINOR];
573 call->_ops[0] = store->_ops[0];
574 vec_remove(block->instr, vec_size(block->instr) - 2, 1);
575 ir_instr_delete(store);
584 funcval = call->_ops[1];
587 if (funcval->vtype != TYPE_FUNCTION || funcval->constval.vfunc != self)
590 /* now we have a CALL and a RET, check if it's a tailcall */
591 if (ret->_ops[0] && call->_ops[0] != ret->_ops[0])
594 ++optimization_count[OPTIM_TAIL_RECURSION];
595 vec_shrinkby(block->instr, 2);
597 block->final = false; /* open it back up */
599 /* emite parameter-stores */
600 for (p = 0; p < vec_size(call->params); ++p) {
601 /* assert(call->params_count <= self->locals_count); */
602 if (!ir_block_create_store(block, call->context, self->locals[p], call->params[p])) {
603 irerror(call->context, "failed to create tailcall store instruction for parameter %i", (int)p);
607 if (!ir_block_create_jump(block, call->context, self->blocks[0])) {
608 irerror(call->context, "failed to create tailcall jump");
612 ir_instr_delete(call);
613 ir_instr_delete(ret);
619 bool ir_function_finalize(ir_function *self)
624 if (OPTS_OPTIMIZATION(OPTIM_TAIL_RECURSION)) {
625 if (!ir_function_pass_tailcall(self)) {
626 irerror(self->context, "tailcall optimization pass broke something in `%s`", self->name);
631 if (!ir_function_naive_phi(self))
634 ir_function_enumerate(self);
636 if (!ir_function_calculate_liferanges(self))
638 if (!ir_function_allocate_locals(self))
643 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
648 vec_size(self->locals) &&
649 self->locals[vec_size(self->locals)-1]->store != store_param) {
650 irerror(self->context, "cannot add parameters after adding locals");
654 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
655 vec_push(self->locals, ve);
659 /***********************************************************************
663 ir_block* ir_block_new(ir_function* owner, const char *name)
666 self = (ir_block*)mem_a(sizeof(*self));
670 memset(self, 0, sizeof(*self));
673 if (name && !ir_block_set_label(self, name)) {
678 self->context.file = "<@no context>";
679 self->context.line = 0;
683 self->entries = NULL;
687 self->is_return = false;
692 self->generated = false;
697 static void ir_block_delete_quick(ir_block* self)
700 if (self->label) mem_d(self->label);
701 for (i = 0; i != vec_size(self->instr); ++i)
702 ir_instr_delete_quick(self->instr[i]);
703 vec_free(self->instr);
704 vec_free(self->entries);
705 vec_free(self->exits);
706 vec_free(self->living);
710 void ir_block_delete(ir_block* self)
713 if (self->label) mem_d(self->label);
714 for (i = 0; i != vec_size(self->instr); ++i)
715 ir_instr_delete(self->instr[i]);
716 vec_free(self->instr);
717 vec_free(self->entries);
718 vec_free(self->exits);
719 vec_free(self->living);
723 bool ir_block_set_label(ir_block *self, const char *name)
726 mem_d((void*)self->label);
727 self->label = util_strdup(name);
728 return !!self->label;
731 /***********************************************************************
735 ir_instr* ir_instr_new(lex_ctx ctx, ir_block* owner, int op)
738 self = (ir_instr*)mem_a(sizeof(*self));
745 self->_ops[0] = NULL;
746 self->_ops[1] = NULL;
747 self->_ops[2] = NULL;
748 self->bops[0] = NULL;
749 self->bops[1] = NULL;
760 static void ir_instr_delete_quick(ir_instr *self)
763 vec_free(self->params);
767 void ir_instr_delete(ir_instr *self)
770 /* The following calls can only delete from
771 * vectors, we still want to delete this instruction
772 * so ignore the return value. Since with the warn_unused_result attribute
773 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
774 * I have to improvise here and use if(foo());
776 for (i = 0; i < vec_size(self->phi); ++i) {
778 if (vec_ir_instr_find(self->phi[i].value->writes, self, &idx))
779 vec_remove(self->phi[i].value->writes, idx, 1);
780 if (vec_ir_instr_find(self->phi[i].value->reads, self, &idx))
781 vec_remove(self->phi[i].value->reads, idx, 1);
784 for (i = 0; i < vec_size(self->params); ++i) {
786 if (vec_ir_instr_find(self->params[i]->writes, self, &idx))
787 vec_remove(self->params[i]->writes, idx, 1);
788 if (vec_ir_instr_find(self->params[i]->reads, self, &idx))
789 vec_remove(self->params[i]->reads, idx, 1);
791 vec_free(self->params);
792 (void)!ir_instr_op(self, 0, NULL, false);
793 (void)!ir_instr_op(self, 1, NULL, false);
794 (void)!ir_instr_op(self, 2, NULL, false);
798 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
800 if (self->_ops[op]) {
802 if (writing && vec_ir_instr_find(self->_ops[op]->writes, self, &idx))
803 vec_remove(self->_ops[op]->writes, idx, 1);
804 else if (vec_ir_instr_find(self->_ops[op]->reads, self, &idx))
805 vec_remove(self->_ops[op]->reads, idx, 1);
809 vec_push(v->writes, self);
811 vec_push(v->reads, self);
817 /***********************************************************************
821 void ir_value_code_setaddr(ir_value *self, int32_t gaddr)
823 self->code.globaladdr = gaddr;
824 if (self->members[0]) self->members[0]->code.globaladdr = gaddr;
825 if (self->members[1]) self->members[1]->code.globaladdr = gaddr;
826 if (self->members[2]) self->members[2]->code.globaladdr = gaddr;
829 int32_t ir_value_code_addr(const ir_value *self)
831 if (self->store == store_return)
832 return OFS_RETURN + self->code.addroffset;
833 return self->code.globaladdr + self->code.addroffset;
836 ir_value* ir_value_var(const char *name, int storetype, int vtype)
839 self = (ir_value*)mem_a(sizeof(*self));
841 self->fieldtype = TYPE_VOID;
842 self->outtype = TYPE_VOID;
843 self->store = storetype;
849 self->hasvalue = false;
850 self->context.file = "<@no context>";
851 self->context.line = 0;
853 if (name && !ir_value_set_name(self, name)) {
854 irerror(self->context, "out of memory");
859 memset(&self->constval, 0, sizeof(self->constval));
860 memset(&self->code, 0, sizeof(self->code));
862 self->members[0] = NULL;
863 self->members[1] = NULL;
864 self->members[2] = NULL;
865 self->memberof = NULL;
871 ir_value* ir_value_vector_member(ir_value *self, unsigned int member)
877 if (self->members[member])
878 return self->members[member];
880 if (self->vtype == TYPE_VECTOR)
882 m = ir_value_var(self->name, self->store, TYPE_FLOAT);
885 m->context = self->context;
887 self->members[member] = m;
888 m->code.addroffset = member;
890 else if (self->vtype == TYPE_FIELD)
892 if (self->fieldtype != TYPE_VECTOR)
894 m = ir_value_var(self->name, self->store, TYPE_FIELD);
897 m->fieldtype = TYPE_FLOAT;
898 m->context = self->context;
900 self->members[member] = m;
901 m->code.addroffset = member;
905 irerror(self->context, "invalid member access on %s", self->name);
913 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
915 ir_value *v = ir_value_var(name, storetype, vtype);
918 ir_function_collect_value(owner, v);
922 void ir_value_delete(ir_value* self)
926 mem_d((void*)self->name);
929 if (self->vtype == TYPE_STRING)
930 mem_d((void*)self->constval.vstring);
932 for (i = 0; i < 3; ++i) {
933 if (self->members[i])
934 ir_value_delete(self->members[i]);
936 vec_free(self->reads);
937 vec_free(self->writes);
938 vec_free(self->life);
942 bool ir_value_set_name(ir_value *self, const char *name)
945 mem_d((void*)self->name);
946 self->name = util_strdup(name);
950 bool ir_value_set_float(ir_value *self, float f)
952 if (self->vtype != TYPE_FLOAT)
954 self->constval.vfloat = f;
955 self->hasvalue = true;
959 bool ir_value_set_func(ir_value *self, int f)
961 if (self->vtype != TYPE_FUNCTION)
963 self->constval.vint = f;
964 self->hasvalue = true;
968 bool ir_value_set_vector(ir_value *self, vector v)
970 if (self->vtype != TYPE_VECTOR)
972 self->constval.vvec = v;
973 self->hasvalue = true;
977 bool ir_value_set_field(ir_value *self, ir_value *fld)
979 if (self->vtype != TYPE_FIELD)
981 self->constval.vpointer = fld;
982 self->hasvalue = true;
986 static char *ir_strdup(const char *str)
989 /* actually dup empty strings */
990 char *out = mem_a(1);
994 return util_strdup(str);
997 bool ir_value_set_string(ir_value *self, const char *str)
999 if (self->vtype != TYPE_STRING)
1001 self->constval.vstring = ir_strdup(str);
1002 self->hasvalue = true;
1007 bool ir_value_set_int(ir_value *self, int i)
1009 if (self->vtype != TYPE_INTEGER)
1011 self->constval.vint = i;
1012 self->hasvalue = true;
1017 bool ir_value_lives(ir_value *self, size_t at)
1020 for (i = 0; i < vec_size(self->life); ++i)
1022 ir_life_entry_t *life = &self->life[i];
1023 if (life->start <= at && at <= life->end)
1025 if (life->start > at) /* since it's ordered */
1031 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
1034 vec_push(self->life, e);
1035 for (k = vec_size(self->life)-1; k > idx; --k)
1036 self->life[k] = self->life[k-1];
1037 self->life[idx] = e;
1041 bool ir_value_life_merge(ir_value *self, size_t s)
1044 ir_life_entry_t *life = NULL;
1045 ir_life_entry_t *before = NULL;
1046 ir_life_entry_t new_entry;
1048 /* Find the first range >= s */
1049 for (i = 0; i < vec_size(self->life); ++i)
1052 life = &self->life[i];
1053 if (life->start > s)
1056 /* nothing found? append */
1057 if (i == vec_size(self->life)) {
1059 if (life && life->end+1 == s)
1061 /* previous life range can be merged in */
1065 if (life && life->end >= s)
1067 e.start = e.end = s;
1068 vec_push(self->life, e);
1074 if (before->end + 1 == s &&
1075 life->start - 1 == s)
1078 before->end = life->end;
1079 vec_remove(self->life, i, 1);
1082 if (before->end + 1 == s)
1088 /* already contained */
1089 if (before->end >= s)
1093 if (life->start - 1 == s)
1098 /* insert a new entry */
1099 new_entry.start = new_entry.end = s;
1100 return ir_value_life_insert(self, i, new_entry);
1103 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
1107 if (!vec_size(other->life))
1110 if (!vec_size(self->life)) {
1111 size_t count = vec_size(other->life);
1112 ir_life_entry_t *life = vec_add(self->life, count);
1113 memcpy(life, other->life, count * sizeof(*life));
1118 for (i = 0; i < vec_size(other->life); ++i)
1120 const ir_life_entry_t *life = &other->life[i];
1123 ir_life_entry_t *entry = &self->life[myi];
1125 if (life->end+1 < entry->start)
1127 /* adding an interval before entry */
1128 if (!ir_value_life_insert(self, myi, *life))
1134 if (life->start < entry->start &&
1135 life->end+1 >= entry->start)
1137 /* starts earlier and overlaps */
1138 entry->start = life->start;
1141 if (life->end > entry->end &&
1142 life->start <= entry->end+1)
1144 /* ends later and overlaps */
1145 entry->end = life->end;
1148 /* see if our change combines it with the next ranges */
1149 while (myi+1 < vec_size(self->life) &&
1150 entry->end+1 >= self->life[1+myi].start)
1152 /* overlaps with (myi+1) */
1153 if (entry->end < self->life[1+myi].end)
1154 entry->end = self->life[1+myi].end;
1155 vec_remove(self->life, myi+1, 1);
1156 entry = &self->life[myi];
1159 /* see if we're after the entry */
1160 if (life->start > entry->end)
1163 /* append if we're at the end */
1164 if (myi >= vec_size(self->life)) {
1165 vec_push(self->life, *life);
1168 /* otherweise check the next range */
1177 bool ir_values_overlap(const ir_value *a, const ir_value *b)
1179 /* For any life entry in A see if it overlaps with
1180 * any life entry in B.
1181 * Note that the life entries are orderes, so we can make a
1182 * more efficient algorithm there than naively translating the
1186 ir_life_entry_t *la, *lb, *enda, *endb;
1188 /* first of all, if either has no life range, they cannot clash */
1189 if (!vec_size(a->life) || !vec_size(b->life))
1194 enda = la + vec_size(a->life);
1195 endb = lb + vec_size(b->life);
1198 /* check if the entries overlap, for that,
1199 * both must start before the other one ends.
1201 if (la->start < lb->end &&
1202 lb->start < la->end)
1207 /* entries are ordered
1208 * one entry is earlier than the other
1209 * that earlier entry will be moved forward
1211 if (la->start < lb->start)
1213 /* order: A B, move A forward
1214 * check if we hit the end with A
1219 else /* if (lb->start < la->start) actually <= */
1221 /* order: B A, move B forward
1222 * check if we hit the end with B
1231 /***********************************************************************
1235 bool ir_block_create_store_op(ir_block *self, lex_ctx ctx, int op, ir_value *target, ir_value *what)
1239 irerror(self->context, "unreachable statement (%s)", self->label);
1242 in = ir_instr_new(ctx, self, op);
1246 if (target->store == store_value &&
1247 (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1249 irerror(self->context, "cannot store to an SSA value");
1250 irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1251 irerror(self->context, "instruction: %s", asm_instr[op].m);
1255 if (!ir_instr_op(in, 0, target, true) ||
1256 !ir_instr_op(in, 1, what, false))
1260 vec_push(self->instr, in);
1264 bool ir_block_create_store(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1268 if (target->vtype == TYPE_VARIANT)
1269 vtype = what->vtype;
1271 vtype = target->vtype;
1274 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
1275 op = INSTR_CONV_ITOF;
1276 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1277 op = INSTR_CONV_FTOI;
1279 op = type_store_instr[vtype];
1281 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1282 if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1286 return ir_block_create_store_op(self, ctx, op, target, what);
1289 bool ir_block_create_storep(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1294 if (target->vtype != TYPE_POINTER)
1297 /* storing using pointer - target is a pointer, type must be
1298 * inferred from source
1300 vtype = what->vtype;
1302 op = type_storep_instr[vtype];
1303 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1304 if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1305 op = INSTR_STOREP_V;
1308 return ir_block_create_store_op(self, ctx, op, target, what);
1311 bool ir_block_create_return(ir_block *self, lex_ctx ctx, ir_value *v)
1315 irerror(self->context, "unreachable statement (%s)", self->label);
1319 self->is_return = true;
1320 in = ir_instr_new(ctx, self, INSTR_RETURN);
1324 if (v && !ir_instr_op(in, 0, v, false))
1327 vec_push(self->instr, in);
1331 bool ir_block_create_if(ir_block *self, lex_ctx ctx, ir_value *v,
1332 ir_block *ontrue, ir_block *onfalse)
1336 irerror(self->context, "unreachable statement (%s)", self->label);
1340 /*in = ir_instr_new(ctx, self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1341 in = ir_instr_new(ctx, self, VINSTR_COND);
1345 if (!ir_instr_op(in, 0, v, false)) {
1346 ir_instr_delete(in);
1350 in->bops[0] = ontrue;
1351 in->bops[1] = onfalse;
1353 vec_push(self->instr, in);
1355 vec_push(self->exits, ontrue);
1356 vec_push(self->exits, onfalse);
1357 vec_push(ontrue->entries, self);
1358 vec_push(onfalse->entries, self);
1362 bool ir_block_create_jump(ir_block *self, lex_ctx ctx, ir_block *to)
1366 irerror(self->context, "unreachable statement (%s)", self->label);
1370 in = ir_instr_new(ctx, self, VINSTR_JUMP);
1375 vec_push(self->instr, in);
1377 vec_push(self->exits, to);
1378 vec_push(to->entries, self);
1382 bool ir_block_create_goto(ir_block *self, lex_ctx ctx, ir_block *to)
1386 irerror(self->context, "unreachable statement (%s)", self->label);
1390 in = ir_instr_new(ctx, self, INSTR_GOTO);
1395 vec_push(self->instr, in);
1397 vec_push(self->exits, to);
1398 vec_push(to->entries, self);
1402 ir_instr* ir_block_create_phi(ir_block *self, lex_ctx ctx, const char *label, int ot)
1406 in = ir_instr_new(ctx, self, VINSTR_PHI);
1409 out = ir_value_out(self->owner, label, store_value, ot);
1411 ir_instr_delete(in);
1414 if (!ir_instr_op(in, 0, out, true)) {
1415 ir_instr_delete(in);
1416 ir_value_delete(out);
1419 vec_push(self->instr, in);
1423 ir_value* ir_phi_value(ir_instr *self)
1425 return self->_ops[0];
1428 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1432 if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1433 /* Must not be possible to cause this, otherwise the AST
1434 * is doing something wrong.
1436 irerror(self->context, "Invalid entry block for PHI");
1442 vec_push(v->reads, self);
1443 vec_push(self->phi, pe);
1446 /* call related code */
1447 ir_instr* ir_block_create_call(ir_block *self, lex_ctx ctx, const char *label, ir_value *func)
1451 in = ir_instr_new(ctx, self, INSTR_CALL0);
1454 out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1456 ir_instr_delete(in);
1459 if (!ir_instr_op(in, 0, out, true) ||
1460 !ir_instr_op(in, 1, func, false))
1462 ir_instr_delete(in);
1463 ir_value_delete(out);
1466 vec_push(self->instr, in);
1470 ir_value* ir_call_value(ir_instr *self)
1472 return self->_ops[0];
1475 void ir_call_param(ir_instr* self, ir_value *v)
1477 vec_push(self->params, v);
1478 vec_push(v->reads, self);
1481 /* binary op related code */
1483 ir_value* ir_block_create_binop(ir_block *self, lex_ctx ctx,
1484 const char *label, int opcode,
1485 ir_value *left, ir_value *right)
1507 case INSTR_SUB_S: /* -- offset of string as float */
1512 case INSTR_BITOR_IF:
1513 case INSTR_BITOR_FI:
1514 case INSTR_BITAND_FI:
1515 case INSTR_BITAND_IF:
1530 case INSTR_BITAND_I:
1533 case INSTR_RSHIFT_I:
1534 case INSTR_LSHIFT_I:
1556 /* boolean operations result in floats */
1557 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1559 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1562 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1567 if (ot == TYPE_VOID) {
1568 /* The AST or parser were supposed to check this! */
1572 return ir_block_create_general_instr(self, ctx, label, opcode, left, right, ot);
1575 ir_value* ir_block_create_unary(ir_block *self, lex_ctx ctx,
1576 const char *label, int opcode,
1579 int ot = TYPE_FLOAT;
1591 /* QC doesn't have other unary operations. We expect extensions to fill
1592 * the above list, otherwise we assume out-type = in-type, eg for an
1596 ot = operand->vtype;
1599 if (ot == TYPE_VOID) {
1600 /* The AST or parser were supposed to check this! */
1604 /* let's use the general instruction creator and pass NULL for OPB */
1605 return ir_block_create_general_instr(self, ctx, label, opcode, operand, NULL, ot);
1608 ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx ctx, const char *label,
1609 int op, ir_value *a, ir_value *b, int outype)
1614 out = ir_value_out(self->owner, label, store_value, outype);
1618 instr = ir_instr_new(ctx, self, op);
1620 ir_value_delete(out);
1624 if (!ir_instr_op(instr, 0, out, true) ||
1625 !ir_instr_op(instr, 1, a, false) ||
1626 !ir_instr_op(instr, 2, b, false) )
1631 vec_push(self->instr, instr);
1635 ir_instr_delete(instr);
1636 ir_value_delete(out);
1640 ir_value* ir_block_create_fieldaddress(ir_block *self, lex_ctx ctx, const char *label, ir_value *ent, ir_value *field)
1644 /* Support for various pointer types todo if so desired */
1645 if (ent->vtype != TYPE_ENTITY)
1648 if (field->vtype != TYPE_FIELD)
1651 v = ir_block_create_general_instr(self, ctx, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1652 v->fieldtype = field->fieldtype;
1656 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)
1659 if (ent->vtype != TYPE_ENTITY)
1662 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1663 if (field->vtype != TYPE_FIELD)
1668 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1669 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1670 case TYPE_STRING: op = INSTR_LOAD_S; break;
1671 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1672 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1673 case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1675 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1676 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1679 irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1683 return ir_block_create_general_instr(self, ctx, label, op, ent, field, outype);
1686 ir_value* ir_block_create_add(ir_block *self, lex_ctx ctx,
1688 ir_value *left, ir_value *right)
1691 int l = left->vtype;
1692 int r = right->vtype;
1696 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1712 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1714 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1719 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1723 return ir_block_create_binop(self, ctx, label, op, left, right);
1726 ir_value* ir_block_create_sub(ir_block *self, lex_ctx ctx,
1728 ir_value *left, ir_value *right)
1731 int l = left->vtype;
1732 int r = right->vtype;
1737 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1753 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1755 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1760 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1764 return ir_block_create_binop(self, ctx, label, op, left, right);
1767 ir_value* ir_block_create_mul(ir_block *self, lex_ctx ctx,
1769 ir_value *left, ir_value *right)
1772 int l = left->vtype;
1773 int r = right->vtype;
1778 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1793 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1795 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1798 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1800 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1802 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1804 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1808 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1812 return ir_block_create_binop(self, ctx, label, op, left, right);
1815 ir_value* ir_block_create_div(ir_block *self, lex_ctx ctx,
1817 ir_value *left, ir_value *right)
1820 int l = left->vtype;
1821 int r = right->vtype;
1826 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1839 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1841 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1843 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1848 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1852 return ir_block_create_binop(self, ctx, label, op, left, right);
1855 /* PHI resolving breaks the SSA, and must thus be the last
1856 * step before life-range calculation.
1859 static bool ir_block_naive_phi(ir_block *self);
1860 bool ir_function_naive_phi(ir_function *self)
1864 for (i = 0; i < vec_size(self->blocks); ++i)
1866 if (!ir_block_naive_phi(self->blocks[i]))
1873 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1878 /* create a store */
1879 if (!ir_block_create_store(block, old, what))
1882 /* we now move it up */
1883 instr = vec_last(block->instr);
1884 for (i = vec_size(block->instr)-1; i > iid; --i)
1885 block->instr[i] = block->instr[i-1];
1886 block->instr[i] = instr;
1892 static bool ir_block_naive_phi(ir_block *self)
1894 size_t i, p; /*, w;*/
1895 /* FIXME: optionally, create_phi can add the phis
1896 * to a list so we don't need to loop through blocks
1897 * - anyway: "don't optimize YET"
1899 for (i = 0; i < vec_size(self->instr); ++i)
1901 ir_instr *instr = self->instr[i];
1902 if (instr->opcode != VINSTR_PHI)
1905 vec_remove(self->instr, i, 1);
1906 --i; /* NOTE: i+1 below */
1908 for (p = 0; p < vec_size(instr->phi); ++p)
1910 ir_value *v = instr->phi[p].value;
1911 ir_block *b = instr->phi[p].from;
1913 if (v->store == store_value &&
1914 vec_size(v->reads) == 1 &&
1915 vec_size(v->writes) == 1)
1917 /* replace the value */
1918 if (!ir_instr_op(v->writes[0], 0, instr->_ops[0], true))
1923 /* force a move instruction */
1924 ir_instr *prevjump = vec_last(b->instr);
1927 instr->_ops[0]->store = store_global;
1928 if (!ir_block_create_store(b, instr->context, instr->_ops[0], v))
1930 instr->_ops[0]->store = store_value;
1931 vec_push(b->instr, prevjump);
1936 ir_value *v = instr->phi[p].value;
1937 for (w = 0; w < vec_size(v->writes); ++w) {
1940 if (!v->writes[w]->_ops[0])
1943 /* When the write was to a global, we have to emit a mov */
1944 old = v->writes[w]->_ops[0];
1946 /* The original instruction now writes to the PHI target local */
1947 if (v->writes[w]->_ops[0] == v)
1948 v->writes[w]->_ops[0] = instr->_ops[0];
1950 if (old->store != store_value && old->store != store_local && old->store != store_param)
1952 /* If it originally wrote to a global we need to store the value
1955 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1957 if (i+1 < vec_size(self->instr))
1958 instr = self->instr[i+1];
1961 /* In case I forget and access instr later, it'll be NULL
1962 * when it's a problem, to make sure we crash, rather than accessing
1968 /* If it didn't, we can replace all reads by the phi target now. */
1970 for (r = 0; r < vec_size(old->reads); ++r)
1973 ir_instr *ri = old->reads[r];
1974 for (op = 0; op < vec_size(ri->phi); ++op) {
1975 if (ri->phi[op].value == old)
1976 ri->phi[op].value = v;
1978 for (op = 0; op < 3; ++op) {
1979 if (ri->_ops[op] == old)
1987 ir_instr_delete(instr);
1992 /***********************************************************************
1993 *IR Temp allocation code
1994 * Propagating value life ranges by walking through the function backwards
1995 * until no more changes are made.
1996 * In theory this should happen once more than once for every nested loop
1998 * Though this implementation might run an additional time for if nests.
2001 /* Enumerate instructions used by value's life-ranges
2003 static void ir_block_enumerate(ir_block *self, size_t *_eid)
2007 for (i = 0; i < vec_size(self->instr); ++i)
2009 self->instr[i]->eid = eid++;
2014 /* Enumerate blocks and instructions.
2015 * The block-enumeration is unordered!
2016 * We do not really use the block enumreation, however
2017 * the instruction enumeration is important for life-ranges.
2019 void ir_function_enumerate(ir_function *self)
2022 size_t instruction_id = 0;
2023 for (i = 0; i < vec_size(self->blocks); ++i)
2025 self->blocks[i]->eid = i;
2026 self->blocks[i]->run_id = 0;
2027 ir_block_enumerate(self->blocks[i], &instruction_id);
2031 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
2032 bool ir_function_calculate_liferanges(ir_function *self)
2040 for (i = 0; i != vec_size(self->blocks); ++i)
2042 if (self->blocks[i]->is_return)
2044 vec_free(self->blocks[i]->living);
2045 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
2050 if (vec_size(self->blocks)) {
2051 ir_block *block = self->blocks[0];
2052 for (i = 0; i < vec_size(block->living); ++i) {
2053 ir_value *v = block->living[i];
2054 if (v->memberof || v->store != store_local)
2056 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2057 "variable `%s` may be used uninitialized in this function", v->name))
2066 /* Local-value allocator
2067 * After finishing creating the liferange of all values used in a function
2068 * we can allocate their global-positions.
2069 * This is the counterpart to register-allocation in register machines.
2075 } function_allocator;
2077 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
2080 size_t vsize = type_sizeof[var->vtype];
2082 slot = ir_value_var("reg", store_global, var->vtype);
2086 if (!ir_value_life_merge_into(slot, var))
2089 vec_push(alloc->locals, slot);
2090 vec_push(alloc->sizes, vsize);
2095 ir_value_delete(slot);
2099 bool ir_function_allocate_locals(ir_function *self)
2108 function_allocator alloc;
2110 if (!vec_size(self->locals) && !vec_size(self->values))
2113 alloc.locals = NULL;
2115 alloc.positions = NULL;
2117 for (i = 0; i < vec_size(self->locals); ++i)
2119 if (!function_allocator_alloc(&alloc, self->locals[i]))
2123 /* Allocate a slot for any value that still exists */
2124 for (i = 0; i < vec_size(self->values); ++i)
2126 v = self->values[i];
2128 if (!vec_size(v->life))
2131 for (a = 0; a < vec_size(alloc.locals); ++a)
2133 slot = alloc.locals[a];
2135 if (ir_values_overlap(v, slot))
2138 if (!ir_value_life_merge_into(slot, v))
2141 /* adjust size for this slot */
2142 if (alloc.sizes[a] < type_sizeof[v->vtype])
2143 alloc.sizes[a] = type_sizeof[v->vtype];
2145 self->values[i]->code.local = a;
2148 if (a >= vec_size(alloc.locals)) {
2149 self->values[i]->code.local = vec_size(alloc.locals);
2150 if (!function_allocator_alloc(&alloc, v))
2159 /* Adjust slot positions based on sizes */
2160 vec_push(alloc.positions, 0);
2162 if (vec_size(alloc.sizes))
2163 pos = alloc.positions[0] + alloc.sizes[0];
2166 for (i = 1; i < vec_size(alloc.sizes); ++i)
2168 pos = alloc.positions[i-1] + alloc.sizes[i-1];
2169 vec_push(alloc.positions, pos);
2172 self->allocated_locals = pos + vec_last(alloc.sizes);
2174 /* Take over the actual slot positions */
2175 for (i = 0; i < vec_size(self->values); ++i) {
2176 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
2184 for (i = 0; i < vec_size(alloc.locals); ++i)
2185 ir_value_delete(alloc.locals[i]);
2186 vec_free(alloc.locals);
2187 vec_free(alloc.sizes);
2188 vec_free(alloc.positions);
2192 /* Get information about which operand
2193 * is read from, or written to.
2195 static void ir_op_read_write(int op, size_t *read, size_t *write)
2215 case INSTR_STOREP_F:
2216 case INSTR_STOREP_V:
2217 case INSTR_STOREP_S:
2218 case INSTR_STOREP_ENT:
2219 case INSTR_STOREP_FLD:
2220 case INSTR_STOREP_FNC:
2231 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2234 bool changed = false;
2236 for (i = 0; i != vec_size(self->living); ++i)
2238 tempbool = ir_value_life_merge(self->living[i], eid);
2241 irerror(self->context, "block_living_add_instr() value instruction added %s: %i", self->living[i]->_name, (int)eid);
2243 changed = changed || tempbool;
2248 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
2254 /* values which have been read in a previous iteration are now
2255 * in the "living" array even if the previous block doesn't use them.
2256 * So we have to remove whatever does not exist in the previous block.
2257 * They will be re-added on-read, but the liferange merge won't cause
2260 for (i = 0; i < vec_size(self->living); ++i)
2262 if (!vec_ir_value_find(prev->living, self->living[i], NULL)) {
2263 vec_remove(self->living, i, 1);
2268 /* Whatever the previous block still has in its living set
2269 * must now be added to ours as well.
2271 for (i = 0; i < vec_size(prev->living); ++i)
2273 if (vec_ir_value_find(self->living, prev->living[i], NULL))
2275 vec_push(self->living, prev->living[i]);
2277 irerror(self->contextt from prev: %s", self->label, prev->living[i]->_name);
2283 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
2289 /* bitmasks which operands are read from or written to */
2291 char dbg_ind[16] = { '#', '0' };
2296 if (!ir_block_life_prop_previous(self, prev, changed))
2300 i = vec_size(self->instr);
2303 instr = self->instr[i];
2305 /* PHI operands are always read operands */
2306 for (p = 0; p < vec_size(instr->phi); ++p)
2308 value = instr->phi[p].value;
2309 if (value->memberof)
2310 value = value->memberof;
2311 if (!vec_ir_value_find(self->living, value, NULL))
2312 vec_push(self->living, value);
2315 /* call params are read operands too */
2316 for (p = 0; p < vec_size(instr->params); ++p)
2318 value = instr->params[p];
2319 if (value->memberof)
2320 value = value->memberof;
2321 if (!vec_ir_value_find(self->living, value, NULL))
2322 vec_push(self->living, value);
2325 /* See which operands are read and write operands */
2326 ir_op_read_write(instr->opcode, &read, &write);
2328 if (instr->opcode == INSTR_MUL_VF)
2330 /* the float source will get an additional lifetime */
2331 tempbool = ir_value_life_merge(instr->_ops[2], instr->eid+1);
2332 *changed = *changed || tempbool;
2334 else if (instr->opcode == INSTR_MUL_FV)
2336 /* the float source will get an additional lifetime */
2337 tempbool = ir_value_life_merge(instr->_ops[1], instr->eid+1);
2338 *changed = *changed || tempbool;
2341 /* Go through the 3 main operands */
2342 for (o = 0; o < 3; ++o)
2344 if (!instr->_ops[o]) /* no such operand */
2347 value = instr->_ops[o];
2348 if (value->memberof)
2349 value = value->memberof;
2351 /* We only care about locals */
2352 /* we also calculate parameter liferanges so that locals
2353 * can take up parameter slots */
2354 if (value->store != store_value &&
2355 value->store != store_local &&
2356 value->store != store_param)
2362 if (!vec_ir_value_find(self->living, value, NULL))
2363 vec_push(self->living, value);
2366 /* write operands */
2367 /* When we write to a local, we consider it "dead" for the
2368 * remaining upper part of the function, since in SSA a value
2369 * can only be written once (== created)
2374 bool in_living = vec_ir_value_find(self->living, value, &idx);
2377 /* If the value isn't alive it hasn't been read before... */
2378 /* TODO: See if the warning can be emitted during parsing or AST processing
2379 * otherwise have warning printed here.
2380 * IF printing a warning here: include filecontext_t,
2381 * and make sure it's only printed once
2382 * since this function is run multiple times.
2384 /* For now: debug info: */
2385 /* con_err( "Value only written %s\n", value->name); */
2386 tempbool = ir_value_life_merge(value, instr->eid);
2387 *changed = *changed || tempbool;
2389 ir_instr_dump(instr, dbg_ind, printf);
2393 /* since 'living' won't contain it
2394 * anymore, merge the value, since
2397 tempbool = ir_value_life_merge(value, instr->eid);
2400 con_err( "value added id %s %i\n", value->name, (int)instr->eid);
2402 *changed = *changed || tempbool;
2404 vec_remove(self->living, idx, 1);
2409 tempbool = ir_block_living_add_instr(self, instr->eid);
2410 /*con_err( "living added values\n");*/
2411 *changed = *changed || tempbool;
2415 if (self->run_id == self->owner->run_id)
2418 self->run_id = self->owner->run_id;
2420 for (i = 0; i < vec_size(self->entries); ++i)
2422 ir_block *entry = self->entries[i];
2423 ir_block_life_propagate(entry, self, changed);
2429 /***********************************************************************
2432 * Since the IR has the convention of putting 'write' operands
2433 * at the beginning, we have to rotate the operands of instructions
2434 * properly in order to generate valid QCVM code.
2436 * Having destinations at a fixed position is more convenient. In QC
2437 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2438 * read from from OPA, and store to OPB rather than OPC. Which is
2439 * partially the reason why the implementation of these instructions
2440 * in darkplaces has been delayed for so long.
2442 * Breaking conventions is annoying...
2444 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2446 static bool gen_global_field(ir_value *global)
2448 if (global->hasvalue)
2450 ir_value *fld = global->constval.vpointer;
2452 irerror(global->context, "Invalid field constant with no field: %s", global->name);
2456 /* copy the field's value */
2457 ir_value_code_setaddr(global, vec_size(code_globals));
2458 vec_push(code_globals, fld->code.fieldaddr);
2459 if (global->fieldtype == TYPE_VECTOR) {
2460 vec_push(code_globals, fld->code.fieldaddr+1);
2461 vec_push(code_globals, fld->code.fieldaddr+2);
2466 ir_value_code_setaddr(global, vec_size(code_globals));
2467 vec_push(code_globals, 0);
2468 if (global->fieldtype == TYPE_VECTOR) {
2469 vec_push(code_globals, 0);
2470 vec_push(code_globals, 0);
2473 if (global->code.globaladdr < 0)
2478 static bool gen_global_pointer(ir_value *global)
2480 if (global->hasvalue)
2482 ir_value *target = global->constval.vpointer;
2484 irerror(global->context, "Invalid pointer constant: %s", global->name);
2485 /* NULL pointers are pointing to the NULL constant, which also
2486 * sits at address 0, but still has an ir_value for itself.
2491 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2492 * void() foo; <- proto
2493 * void() *fooptr = &foo;
2494 * void() foo = { code }
2496 if (!target->code.globaladdr) {
2497 /* FIXME: Check for the constant nullptr ir_value!
2498 * because then code.globaladdr being 0 is valid.
2500 irerror(global->context, "FIXME: Relocation support");
2504 ir_value_code_setaddr(global, vec_size(code_globals));
2505 vec_push(code_globals, target->code.globaladdr);
2509 ir_value_code_setaddr(global, vec_size(code_globals));
2510 vec_push(code_globals, 0);
2512 if (global->code.globaladdr < 0)
2517 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2519 prog_section_statement stmt;
2528 block->generated = true;
2529 block->code_start = vec_size(code_statements);
2530 for (i = 0; i < vec_size(block->instr); ++i)
2532 instr = block->instr[i];
2534 if (instr->opcode == VINSTR_PHI) {
2535 irerror(block->context, "cannot generate virtual instruction (phi)");
2539 if (instr->opcode == VINSTR_JUMP) {
2540 target = instr->bops[0];
2541 /* for uncoditional jumps, if the target hasn't been generated
2542 * yet, we generate them right here.
2544 if (!target->generated) {
2549 /* otherwise we generate a jump instruction */
2550 stmt.opcode = INSTR_GOTO;
2551 stmt.o1.s1 = (target->code_start) - vec_size(code_statements);
2554 code_push_statement(&stmt, instr->context.line);
2556 /* no further instructions can be in this block */
2560 if (instr->opcode == VINSTR_COND) {
2561 ontrue = instr->bops[0];
2562 onfalse = instr->bops[1];
2563 /* TODO: have the AST signal which block should
2564 * come first: eg. optimize IFs without ELSE...
2567 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2571 if (ontrue->generated) {
2572 stmt.opcode = INSTR_IF;
2573 stmt.o2.s1 = (ontrue->code_start) - vec_size(code_statements);
2574 code_push_statement(&stmt, instr->context.line);
2576 if (onfalse->generated) {
2577 stmt.opcode = INSTR_IFNOT;
2578 stmt.o2.s1 = (onfalse->code_start) - vec_size(code_statements);
2579 code_push_statement(&stmt, instr->context.line);
2581 if (!ontrue->generated) {
2582 if (onfalse->generated) {
2587 if (!onfalse->generated) {
2588 if (ontrue->generated) {
2593 /* neither ontrue nor onfalse exist */
2594 stmt.opcode = INSTR_IFNOT;
2595 if (!instr->likely) {
2596 /* Honor the likelyhood hint */
2597 ir_block *tmp = onfalse;
2598 stmt.opcode = INSTR_IF;
2602 stidx = vec_size(code_statements);
2603 code_push_statement(&stmt, instr->context.line);
2604 /* on false we jump, so add ontrue-path */
2605 if (!gen_blocks_recursive(func, ontrue))
2607 /* fixup the jump address */
2608 code_statements[stidx].o2.s1 = vec_size(code_statements) - stidx;
2609 /* generate onfalse path */
2610 if (onfalse->generated) {
2611 /* fixup the jump address */
2612 code_statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2613 stmt.opcode = vec_last(code_statements).opcode;
2614 if (stmt.opcode == INSTR_GOTO ||
2615 stmt.opcode == INSTR_IF ||
2616 stmt.opcode == INSTR_IFNOT ||
2617 stmt.opcode == INSTR_RETURN ||
2618 stmt.opcode == INSTR_DONE)
2620 /* no use jumping from here */
2623 /* may have been generated in the previous recursive call */
2624 stmt.opcode = INSTR_GOTO;
2625 stmt.o1.s1 = (onfalse->code_start) - vec_size(code_statements);
2628 code_push_statement(&stmt, instr->context.line);
2631 /* if not, generate now */
2636 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2637 /* Trivial call translation:
2638 * copy all params to OFS_PARM*
2639 * if the output's storetype is not store_return,
2640 * add append a STORE instruction!
2642 * NOTES on how to do it better without much trouble:
2643 * -) The liferanges!
2644 * Simply check the liferange of all parameters for
2645 * other CALLs. For each param with no CALL in its
2646 * liferange, we can store it in an OFS_PARM at
2647 * generation already. This would even include later
2648 * reuse.... probably... :)
2653 first = vec_size(instr->params);
2656 for (p = 0; p < first; ++p)
2658 ir_value *param = instr->params[p];
2660 stmt.opcode = INSTR_STORE_F;
2663 if (param->vtype == TYPE_FIELD)
2664 stmt.opcode = field_store_instr[param->fieldtype];
2666 stmt.opcode = type_store_instr[param->vtype];
2667 stmt.o1.u1 = ir_value_code_addr(param);
2668 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2669 code_push_statement(&stmt, instr->context.line);
2671 /* Now handle extparams */
2672 first = vec_size(instr->params);
2673 for (; p < first; ++p)
2675 ir_builder *ir = func->owner;
2676 ir_value *param = instr->params[p];
2677 ir_value *targetparam;
2679 if (p-8 >= vec_size(ir->extparams))
2680 ir_gen_extparam(ir);
2682 targetparam = ir->extparams[p-8];
2684 stmt.opcode = INSTR_STORE_F;
2687 if (param->vtype == TYPE_FIELD)
2688 stmt.opcode = field_store_instr[param->fieldtype];
2690 stmt.opcode = type_store_instr[param->vtype];
2691 stmt.o1.u1 = ir_value_code_addr(param);
2692 stmt.o2.u1 = ir_value_code_addr(targetparam);
2693 code_push_statement(&stmt, instr->context.line);
2696 stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
2697 if (stmt.opcode > INSTR_CALL8)
2698 stmt.opcode = INSTR_CALL8;
2699 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2702 code_push_statement(&stmt, instr->context.line);
2704 retvalue = instr->_ops[0];
2705 if (retvalue && retvalue->store != store_return && vec_size(retvalue->life))
2707 /* not to be kept in OFS_RETURN */
2708 if (retvalue->vtype == TYPE_FIELD)
2709 stmt.opcode = field_store_instr[retvalue->vtype];
2711 stmt.opcode = type_store_instr[retvalue->vtype];
2712 stmt.o1.u1 = OFS_RETURN;
2713 stmt.o2.u1 = ir_value_code_addr(retvalue);
2715 code_push_statement(&stmt, instr->context.line);
2720 if (instr->opcode == INSTR_STATE) {
2721 irerror(block->context, "TODO: state instruction");
2725 stmt.opcode = instr->opcode;
2730 /* This is the general order of operands */
2732 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
2735 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2738 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
2740 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2742 stmt.o1.u1 = stmt.o3.u1;
2745 else if ((stmt.opcode >= INSTR_STORE_F &&
2746 stmt.opcode <= INSTR_STORE_FNC) ||
2747 (stmt.opcode >= INSTR_STOREP_F &&
2748 stmt.opcode <= INSTR_STOREP_FNC))
2750 /* 2-operand instructions with A -> B */
2751 stmt.o2.u1 = stmt.o3.u1;
2755 code_push_statement(&stmt, instr->context.line);
2760 static bool gen_function_code(ir_function *self)
2763 prog_section_statement stmt;
2765 /* Starting from entry point, we generate blocks "as they come"
2766 * for now. Dead blocks will not be translated obviously.
2768 if (!vec_size(self->blocks)) {
2769 irerror(self->context, "Function '%s' declared without body.", self->name);
2773 block = self->blocks[0];
2774 if (block->generated)
2777 if (!gen_blocks_recursive(self, block)) {
2778 irerror(self->context, "failed to generate blocks for '%s'", self->name);
2782 /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
2783 stmt.opcode = AINSTR_END;
2787 code_push_statement(&stmt, vec_last(code_linenums));
2791 static qcint ir_builder_filestring(ir_builder *ir, const char *filename)
2793 /* NOTE: filename pointers are copied, we never strdup them,
2794 * thus we can use pointer-comparison to find the string.
2799 for (i = 0; i < vec_size(ir->filenames); ++i) {
2800 if (ir->filenames[i] == filename)
2801 return ir->filestrings[i];
2804 str = code_genstring(filename);
2805 vec_push(ir->filenames, filename);
2806 vec_push(ir->filestrings, str);
2810 static bool gen_global_function(ir_builder *ir, ir_value *global)
2812 prog_section_function fun;
2816 size_t local_var_end;
2818 if (!global->hasvalue || (!global->constval.vfunc))
2820 irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
2824 irfun = global->constval.vfunc;
2826 fun.name = global->code.name;
2827 fun.file = ir_builder_filestring(ir, global->context.file);
2828 fun.profile = 0; /* always 0 */
2829 fun.nargs = vec_size(irfun->params);
2833 for (i = 0;i < 8; ++i) {
2834 if ((int32_t)i >= fun.nargs)
2837 fun.argsize[i] = type_sizeof[irfun->params[i]];
2840 fun.firstlocal = vec_size(code_globals);
2842 local_var_end = fun.firstlocal;
2843 for (i = 0; i < vec_size(irfun->locals); ++i) {
2844 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
2845 irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
2849 if (vec_size(irfun->locals)) {
2850 ir_value *last = vec_last(irfun->locals);
2851 local_var_end = last->code.globaladdr;
2852 if (last->vtype == TYPE_FIELD && last->fieldtype == TYPE_VECTOR)
2853 local_var_end += type_sizeof[TYPE_VECTOR];
2855 local_var_end += type_sizeof[last->vtype];
2857 for (i = 0; i < vec_size(irfun->values); ++i)
2859 /* generate code.globaladdr for ssa values */
2860 ir_value *v = irfun->values[i];
2861 ir_value_code_setaddr(v, local_var_end + v->code.local);
2863 for (i = 0; i < irfun->allocated_locals; ++i) {
2864 /* fill the locals with zeros */
2865 vec_push(code_globals, 0);
2868 fun.locals = vec_size(code_globals) - fun.firstlocal;
2871 fun.entry = irfun->builtin+1;
2873 irfun->code_function_def = vec_size(code_functions);
2874 fun.entry = vec_size(code_statements);
2877 vec_push(code_functions, fun);
2881 static void ir_gen_extparam(ir_builder *ir)
2883 prog_section_def def;
2887 snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparams)+8));
2888 global = ir_value_var(name, store_global, TYPE_VECTOR);
2890 def.name = code_genstring(name);
2891 def.type = TYPE_VECTOR;
2892 def.offset = vec_size(code_globals);
2894 vec_push(code_defs, def);
2895 ir_value_code_setaddr(global, def.offset);
2896 vec_push(code_globals, 0);
2897 vec_push(code_globals, 0);
2898 vec_push(code_globals, 0);
2900 vec_push(ir->extparams, global);
2903 static bool gen_function_extparam_copy(ir_function *self)
2905 size_t i, ext, numparams;
2907 ir_builder *ir = self->owner;
2909 prog_section_statement stmt;
2911 numparams = vec_size(self->params);
2915 stmt.opcode = INSTR_STORE_F;
2917 for (i = 8; i < numparams; ++i) {
2919 if (ext >= vec_size(ir->extparams))
2920 ir_gen_extparam(ir);
2922 ep = ir->extparams[ext];
2924 stmt.opcode = type_store_instr[self->locals[i]->vtype];
2925 if (self->locals[i]->vtype == TYPE_FIELD &&
2926 self->locals[i]->fieldtype == TYPE_VECTOR)
2928 stmt.opcode = INSTR_STORE_V;
2930 stmt.o1.u1 = ir_value_code_addr(ep);
2931 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
2932 code_push_statement(&stmt, self->context.line);
2938 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
2940 prog_section_function *fundef;
2945 irfun = global->constval.vfunc;
2947 if (global->cvq == CV_NONE) {
2948 irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
2949 "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
2951 /* this was a function pointer, don't generate code for those */
2958 if (irfun->code_function_def < 0) {
2959 irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
2962 fundef = &code_functions[irfun->code_function_def];
2964 fundef->entry = vec_size(code_statements);
2965 if (!gen_function_extparam_copy(irfun)) {
2966 irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
2969 if (!gen_function_code(irfun)) {
2970 irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
2976 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
2980 prog_section_def def;
2982 def.type = global->vtype;
2983 def.offset = vec_size(code_globals);
2986 if (global->name[0] == '#') {
2987 if (!self->str_immediate)
2988 self->str_immediate = code_genstring("IMMEDIATE");
2989 def.name = global->code.name = self->str_immediate;
2992 def.name = global->code.name = code_genstring(global->name);
2997 switch (global->vtype)
3000 if (!strcmp(global->name, "end_sys_globals")) {
3001 /* TODO: remember this point... all the defs before this one
3002 * should be checksummed and added to progdefs.h when we generate it.
3005 else if (!strcmp(global->name, "end_sys_fields")) {
3006 /* TODO: same as above but for entity-fields rather than globsl
3010 irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
3012 /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
3013 * the system fields actually go? Though the engine knows this anyway...
3014 * Maybe this could be an -foption
3015 * fteqcc creates data for end_sys_* - of size 1, so let's do the same
3017 ir_value_code_setaddr(global, vec_size(code_globals));
3018 vec_push(code_globals, 0);
3020 vec_push(code_defs, def);
3023 vec_push(code_defs, def);
3024 return gen_global_pointer(global);
3026 vec_push(code_defs, def);
3027 return gen_global_field(global);
3032 ir_value_code_setaddr(global, vec_size(code_globals));
3033 if (global->hasvalue) {
3034 iptr = (int32_t*)&global->constval.ivec[0];
3035 vec_push(code_globals, *iptr);
3037 vec_push(code_globals, 0);
3039 def.type |= DEF_SAVEGLOBAL;
3041 vec_push(code_defs, def);
3043 return global->code.globaladdr >= 0;
3047 ir_value_code_setaddr(global, vec_size(code_globals));
3048 if (global->hasvalue) {
3049 vec_push(code_globals, code_genstring(global->constval.vstring));
3051 vec_push(code_globals, 0);
3053 def.type |= DEF_SAVEGLOBAL;
3055 vec_push(code_defs, def);
3056 return global->code.globaladdr >= 0;
3061 ir_value_code_setaddr(global, vec_size(code_globals));
3062 if (global->hasvalue) {
3063 iptr = (int32_t*)&global->constval.ivec[0];
3064 vec_push(code_globals, iptr[0]);
3065 if (global->code.globaladdr < 0)
3067 for (d = 1; d < type_sizeof[global->vtype]; ++d)
3069 vec_push(code_globals, iptr[d]);
3072 vec_push(code_globals, 0);
3073 if (global->code.globaladdr < 0)
3075 for (d = 1; d < type_sizeof[global->vtype]; ++d)
3077 vec_push(code_globals, 0);
3080 def.type |= DEF_SAVEGLOBAL;
3083 vec_push(code_defs, def);
3084 return global->code.globaladdr >= 0;
3087 ir_value_code_setaddr(global, vec_size(code_globals));
3088 if (!global->hasvalue) {
3089 vec_push(code_globals, 0);
3090 if (global->code.globaladdr < 0)
3093 vec_push(code_globals, vec_size(code_functions));
3094 if (!gen_global_function(self, global))
3097 def.type |= DEF_SAVEGLOBAL;
3099 vec_push(code_defs, def);
3102 /* assume biggest type */
3103 ir_value_code_setaddr(global, vec_size(code_globals));
3104 vec_push(code_globals, 0);
3105 for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
3106 vec_push(code_globals, 0);
3109 /* refuse to create 'void' type or any other fancy business. */
3110 irerror(global->context, "Invalid type for global variable `%s`: %s",
3111 global->name, type_name[global->vtype]);
3116 static void ir_builder_prepare_field(ir_value *field)
3118 field->code.fieldaddr = code_alloc_field(type_sizeof[field->fieldtype]);
3121 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
3123 prog_section_def def;
3124 prog_section_field fld;
3128 def.type = (uint16_t)field->vtype;
3129 def.offset = (uint16_t)vec_size(code_globals);
3131 /* create a global named the same as the field */
3132 if (opts_standard == COMPILER_GMQCC) {
3133 /* in our standard, the global gets a dot prefix */
3134 size_t len = strlen(field->name);
3137 /* we really don't want to have to allocate this, and 1024
3138 * bytes is more than enough for a variable/field name
3140 if (len+2 >= sizeof(name)) {
3141 irerror(field->context, "invalid field name size: %u", (unsigned int)len);
3146 memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
3149 def.name = code_genstring(name);
3150 fld.name = def.name + 1; /* we reuse that string table entry */
3152 /* in plain QC, there cannot be a global with the same name,
3153 * and so we also name the global the same.
3154 * FIXME: fteqcc should create a global as well
3155 * check if it actually uses the same name. Probably does
3157 def.name = code_genstring(field->name);
3158 fld.name = def.name;
3161 field->code.name = def.name;
3163 vec_push(code_defs, def);
3165 fld.type = field->fieldtype;
3167 if (fld.type == TYPE_VOID) {
3168 irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3172 fld.offset = field->code.fieldaddr;
3174 vec_push(code_fields, fld);
3176 ir_value_code_setaddr(field, vec_size(code_globals));
3177 vec_push(code_globals, fld.offset);
3178 if (fld.type == TYPE_VECTOR) {
3179 vec_push(code_globals, fld.offset+1);
3180 vec_push(code_globals, fld.offset+2);
3183 return field->code.globaladdr >= 0;
3186 bool ir_builder_generate(ir_builder *self, const char *filename)
3188 prog_section_statement stmt;
3190 char *lnofile = NULL;
3194 for (i = 0; i < vec_size(self->fields); ++i)
3196 ir_builder_prepare_field(self->fields[i]);
3199 for (i = 0; i < vec_size(self->globals); ++i)
3201 if (!ir_builder_gen_global(self, self->globals[i], false)) {
3206 for (i = 0; i < vec_size(self->fields); ++i)
3208 if (!ir_builder_gen_field(self, self->fields[i])) {
3213 /* generate function code */
3214 for (i = 0; i < vec_size(self->globals); ++i)
3216 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3217 if (!gen_global_function_code(self, self->globals[i])) {
3223 if (vec_size(code_globals) >= 65536) {
3224 irerror(vec_last(self->globals)->context, "This progs file would require more globals than the metadata can handle. Bailing out.");
3228 /* DP errors if the last instruction is not an INSTR_DONE
3229 * and for debugging purposes we add an additional AINSTR_END
3230 * to the end of functions, so here it goes:
3232 stmt.opcode = INSTR_DONE;
3236 code_push_statement(&stmt, vec_last(code_linenums));
3241 if (vec_size(code_statements) != vec_size(code_linenums)) {
3242 con_err("Linecounter wrong: %lu != %lu\n",
3243 (unsigned long)vec_size(code_statements),
3244 (unsigned long)vec_size(code_linenums));
3245 } else if (OPTS_FLAG(LNO)) {
3247 size_t filelen = strlen(filename);
3249 memcpy(vec_add(lnofile, filelen+1), filename, filelen+1);
3250 dot = strrchr(lnofile, '.');
3254 vec_shrinkto(lnofile, dot - lnofile);
3256 memcpy(vec_add(lnofile, 5), ".lno", 5);
3260 con_out("writing '%s' and '%s'...\n", filename, lnofile);
3262 con_out("writing '%s'\n", filename);
3263 if (!code_write(filename, lnofile)) {
3271 /***********************************************************************
3272 *IR DEBUG Dump functions...
3275 #define IND_BUFSZ 1024
3278 # define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
3281 const char *qc_opname(int op)
3283 if (op < 0) return "<INVALID>";
3284 if (op < (int)( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
3285 return asm_instr[op].m;
3287 case VINSTR_PHI: return "PHI";
3288 case VINSTR_JUMP: return "JUMP";
3289 case VINSTR_COND: return "COND";
3290 default: return "<UNK>";
3294 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
3297 char indent[IND_BUFSZ];
3301 oprintf("module %s\n", b->name);
3302 for (i = 0; i < vec_size(b->globals); ++i)
3305 if (b->globals[i]->hasvalue)
3306 oprintf("%s = ", b->globals[i]->name);
3307 ir_value_dump(b->globals[i], oprintf);
3310 for (i = 0; i < vec_size(b->functions); ++i)
3311 ir_function_dump(b->functions[i], indent, oprintf);
3312 oprintf("endmodule %s\n", b->name);
3315 void ir_function_dump(ir_function *f, char *ind,
3316 int (*oprintf)(const char*, ...))
3319 if (f->builtin != 0) {
3320 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
3323 oprintf("%sfunction %s\n", ind, f->name);
3324 strncat(ind, "\t", IND_BUFSZ);
3325 if (vec_size(f->locals))
3327 oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
3328 for (i = 0; i < vec_size(f->locals); ++i) {
3329 oprintf("%s\t", ind);
3330 ir_value_dump(f->locals[i], oprintf);
3334 oprintf("%sliferanges:\n", ind);
3335 for (i = 0; i < vec_size(f->locals); ++i) {
3337 ir_value *v = f->locals[i];
3338 oprintf("%s\t%s: unique ", ind, v->name);
3339 for (l = 0; l < vec_size(v->life); ++l) {
3340 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3344 for (i = 0; i < vec_size(f->values); ++i) {
3346 ir_value *v = f->values[i];
3347 oprintf("%s\t%s: @%i ", ind, v->name, (int)v->code.local);
3348 for (l = 0; l < vec_size(v->life); ++l) {
3349 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3353 if (vec_size(f->blocks))
3355 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
3356 for (i = 0; i < vec_size(f->blocks); ++i) {
3357 if (f->blocks[i]->run_id != f->run_id) {
3358 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
3360 ir_block_dump(f->blocks[i], ind, oprintf);
3364 ind[strlen(ind)-1] = 0;
3365 oprintf("%sendfunction %s\n", ind, f->name);
3368 void ir_block_dump(ir_block* b, char *ind,
3369 int (*oprintf)(const char*, ...))
3372 oprintf("%s:%s\n", ind, b->label);
3373 strncat(ind, "\t", IND_BUFSZ);
3375 for (i = 0; i < vec_size(b->instr); ++i)
3376 ir_instr_dump(b->instr[i], ind, oprintf);
3377 ind[strlen(ind)-1] = 0;
3380 void dump_phi(ir_instr *in, int (*oprintf)(const char*, ...))
3383 oprintf("%s <- phi ", in->_ops[0]->name);
3384 for (i = 0; i < vec_size(in->phi); ++i)
3386 oprintf("([%s] : %s) ", in->phi[i].from->label,
3387 in->phi[i].value->name);
3392 void ir_instr_dump(ir_instr *in, char *ind,
3393 int (*oprintf)(const char*, ...))
3396 const char *comma = NULL;
3398 oprintf("%s (%i) ", ind, (int)in->eid);
3400 if (in->opcode == VINSTR_PHI) {
3401 dump_phi(in, oprintf);
3405 strncat(ind, "\t", IND_BUFSZ);
3407 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
3408 ir_value_dump(in->_ops[0], oprintf);
3409 if (in->_ops[1] || in->_ops[2])
3412 if (in->opcode == INSTR_CALL0) {
3413 oprintf("CALL%i\t", vec_size(in->params));
3415 oprintf("%s\t", qc_opname(in->opcode));
3417 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
3418 ir_value_dump(in->_ops[0], oprintf);
3423 for (i = 1; i != 3; ++i) {
3427 ir_value_dump(in->_ops[i], oprintf);
3435 oprintf("[%s]", in->bops[0]->label);
3439 oprintf("%s[%s]", comma, in->bops[1]->label);
3440 if (vec_size(in->params)) {
3441 oprintf("\tparams: ");
3442 for (i = 0; i != vec_size(in->params); ++i) {
3443 oprintf("%s, ", in->params[i]->name);
3447 ind[strlen(ind)-1] = 0;
3450 void ir_value_dump_string(const char *str, int (*oprintf)(const char*, ...))
3453 for (; *str; ++str) {
3455 case '\n': oprintf("\\n"); break;
3456 case '\r': oprintf("\\r"); break;
3457 case '\t': oprintf("\\t"); break;
3458 case '\v': oprintf("\\v"); break;
3459 case '\f': oprintf("\\f"); break;
3460 case '\b': oprintf("\\b"); break;
3461 case '\a': oprintf("\\a"); break;
3462 case '\\': oprintf("\\\\"); break;
3463 case '"': oprintf("\\\""); break;
3464 default: oprintf("%c", *str); break;
3470 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
3479 oprintf("fn:%s", v->name);
3482 oprintf("%g", v->constval.vfloat);
3485 oprintf("'%g %g %g'",
3488 v->constval.vvec.z);
3491 oprintf("(entity)");
3494 ir_value_dump_string(v->constval.vstring, oprintf);
3498 oprintf("%i", v->constval.vint);
3503 v->constval.vpointer->name);
3507 oprintf("%s", v->name);
3511 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
3514 oprintf("Life of %12s:", self->name);
3515 for (i = 0; i < vec_size(self->life); ++i)
3517 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);