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 static void irerror(lex_ctx ctx, const char *msg, ...)
178 con_cvprintmsg((void*)&ctx, LVL_ERROR, "internal error", msg, ap);
182 static bool irwarning(lex_ctx ctx, int warntype, const char *fmt, ...)
185 int lvl = LVL_WARNING;
187 if (warntype && !OPTS_WARN(warntype))
194 con_vprintmsg(lvl, ctx.file, ctx.line, "warning", fmt, ap);
200 /***********************************************************************
201 * Vector utility functions
204 bool GMQCC_WARN vec_ir_value_find(ir_value **vec, ir_value *what, size_t *idx)
207 size_t len = vec_size(vec);
208 for (i = 0; i < len; ++i) {
209 if (vec[i] == what) {
217 bool GMQCC_WARN vec_ir_block_find(ir_block **vec, ir_block *what, size_t *idx)
220 size_t len = vec_size(vec);
221 for (i = 0; i < len; ++i) {
222 if (vec[i] == what) {
230 bool GMQCC_WARN vec_ir_instr_find(ir_instr **vec, ir_instr *what, size_t *idx)
233 size_t len = vec_size(vec);
234 for (i = 0; i < len; ++i) {
235 if (vec[i] == what) {
243 /***********************************************************************
247 static void ir_block_delete_quick(ir_block* self);
248 static void ir_instr_delete_quick(ir_instr *self);
249 static void ir_function_delete_quick(ir_function *self);
251 ir_builder* ir_builder_new(const char *modulename)
255 self = (ir_builder*)mem_a(sizeof(*self));
259 self->functions = NULL;
260 self->globals = NULL;
262 self->extparams = NULL;
263 self->filenames = NULL;
264 self->filestrings = NULL;
266 self->str_immediate = 0;
268 if (!ir_builder_set_name(self, modulename)) {
276 void ir_builder_delete(ir_builder* self)
279 mem_d((void*)self->name);
280 for (i = 0; i != vec_size(self->functions); ++i) {
281 ir_function_delete_quick(self->functions[i]);
283 vec_free(self->functions);
284 for (i = 0; i != vec_size(self->extparams); ++i) {
285 ir_value_delete(self->extparams[i]);
287 vec_free(self->extparams);
288 for (i = 0; i != vec_size(self->globals); ++i) {
289 ir_value_delete(self->globals[i]);
291 vec_free(self->globals);
292 for (i = 0; i != vec_size(self->fields); ++i) {
293 ir_value_delete(self->fields[i]);
295 vec_free(self->fields);
296 vec_free(self->filenames);
297 vec_free(self->filestrings);
301 bool ir_builder_set_name(ir_builder *self, const char *name)
304 mem_d((void*)self->name);
305 self->name = util_strdup(name);
309 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
312 for (i = 0; i < vec_size(self->functions); ++i) {
313 if (!strcmp(name, self->functions[i]->name))
314 return self->functions[i];
319 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
321 ir_function *fn = ir_builder_get_function(self, name);
326 fn = ir_function_new(self, outtype);
327 if (!ir_function_set_name(fn, name))
329 ir_function_delete(fn);
332 vec_push(self->functions, fn);
334 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
336 ir_function_delete(fn);
340 fn->value->isconst = true;
341 fn->value->outtype = outtype;
342 fn->value->constval.vfunc = fn;
343 fn->value->context = fn->context;
348 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
351 for (i = 0; i < vec_size(self->globals); ++i) {
352 if (!strcmp(self->globals[i]->name, name))
353 return self->globals[i];
358 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
362 if (name && name[0] != '#')
364 ve = ir_builder_get_global(self, name);
370 ve = ir_value_var(name, store_global, vtype);
371 vec_push(self->globals, ve);
375 ir_value* ir_builder_get_field(ir_builder *self, const char *name)
378 for (i = 0; i < vec_size(self->fields); ++i) {
379 if (!strcmp(self->fields[i]->name, name))
380 return self->fields[i];
386 ir_value* ir_builder_create_field(ir_builder *self, const char *name, int vtype)
388 ir_value *ve = ir_builder_get_field(self, name);
393 ve = ir_value_var(name, store_global, TYPE_FIELD);
394 ve->fieldtype = vtype;
395 vec_push(self->fields, ve);
399 /***********************************************************************
403 bool ir_function_naive_phi(ir_function*);
404 void ir_function_enumerate(ir_function*);
405 bool ir_function_calculate_liferanges(ir_function*);
406 bool ir_function_allocate_locals(ir_function*);
408 ir_function* ir_function_new(ir_builder* owner, int outtype)
411 self = (ir_function*)mem_a(sizeof(*self));
416 memset(self, 0, sizeof(*self));
419 if (!ir_function_set_name(self, "<@unnamed>")) {
424 self->context.file = "<@no context>";
425 self->context.line = 0;
426 self->outtype = outtype;
435 self->code_function_def = -1;
436 self->allocated_locals = 0;
442 bool ir_function_set_name(ir_function *self, const char *name)
445 mem_d((void*)self->name);
446 self->name = util_strdup(name);
450 static void ir_function_delete_quick(ir_function *self)
453 mem_d((void*)self->name);
455 for (i = 0; i != vec_size(self->blocks); ++i)
456 ir_block_delete_quick(self->blocks[i]);
457 vec_free(self->blocks);
459 vec_free(self->params);
461 for (i = 0; i != vec_size(self->values); ++i)
462 ir_value_delete(self->values[i]);
463 vec_free(self->values);
465 for (i = 0; i != vec_size(self->locals); ++i)
466 ir_value_delete(self->locals[i]);
467 vec_free(self->locals);
469 /* self->value is deleted by the builder */
474 void ir_function_delete(ir_function *self)
477 mem_d((void*)self->name);
479 for (i = 0; i != vec_size(self->blocks); ++i)
480 ir_block_delete(self->blocks[i]);
481 vec_free(self->blocks);
483 vec_free(self->params);
485 for (i = 0; i != vec_size(self->values); ++i)
486 ir_value_delete(self->values[i]);
487 vec_free(self->values);
489 for (i = 0; i != vec_size(self->locals); ++i)
490 ir_value_delete(self->locals[i]);
491 vec_free(self->locals);
493 /* self->value is deleted by the builder */
498 void ir_function_collect_value(ir_function *self, ir_value *v)
500 vec_push(self->values, v);
503 ir_block* ir_function_create_block(ir_function *self, const char *label)
505 ir_block* bn = ir_block_new(self, label);
506 memcpy(&bn->context, &self->context, sizeof(self->context));
507 vec_push(self->blocks, bn);
511 bool ir_function_finalize(ir_function *self)
516 if (!ir_function_naive_phi(self))
519 ir_function_enumerate(self);
521 if (!ir_function_calculate_liferanges(self))
524 if (!ir_function_allocate_locals(self))
529 ir_value* ir_function_get_local(ir_function *self, const char *name)
532 for (i = 0; i < vec_size(self->locals); ++i) {
533 if (!strcmp(self->locals[i]->name, name))
534 return self->locals[i];
539 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
544 if (ir_function_get_local(self, name))
549 vec_size(self->locals) &&
550 self->locals[vec_size(self->locals)-1]->store != store_param) {
551 irerror(self->context, "cannot add parameters after adding locals");
555 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
556 vec_push(self->locals, ve);
560 /***********************************************************************
564 ir_block* ir_block_new(ir_function* owner, const char *name)
567 self = (ir_block*)mem_a(sizeof(*self));
571 memset(self, 0, sizeof(*self));
574 if (name && !ir_block_set_label(self, name)) {
579 self->context.file = "<@no context>";
580 self->context.line = 0;
584 self->entries = NULL;
588 self->is_return = false;
593 self->generated = false;
598 static void ir_block_delete_quick(ir_block* self)
601 if (self->label) mem_d(self->label);
602 for (i = 0; i != vec_size(self->instr); ++i)
603 ir_instr_delete_quick(self->instr[i]);
604 vec_free(self->instr);
605 vec_free(self->entries);
606 vec_free(self->exits);
607 vec_free(self->living);
611 void ir_block_delete(ir_block* self)
614 if (self->label) mem_d(self->label);
615 for (i = 0; i != vec_size(self->instr); ++i)
616 ir_instr_delete(self->instr[i]);
617 vec_free(self->instr);
618 vec_free(self->entries);
619 vec_free(self->exits);
620 vec_free(self->living);
624 bool ir_block_set_label(ir_block *self, const char *name)
627 mem_d((void*)self->label);
628 self->label = util_strdup(name);
629 return !!self->label;
632 /***********************************************************************
636 ir_instr* ir_instr_new(ir_block* owner, int op)
639 self = (ir_instr*)mem_a(sizeof(*self));
644 self->context.file = "<@no context>";
645 self->context.line = 0;
647 self->_ops[0] = NULL;
648 self->_ops[1] = NULL;
649 self->_ops[2] = NULL;
650 self->bops[0] = NULL;
651 self->bops[1] = NULL;
660 static void ir_instr_delete_quick(ir_instr *self)
663 vec_free(self->params);
667 void ir_instr_delete(ir_instr *self)
670 /* The following calls can only delete from
671 * vectors, we still want to delete this instruction
672 * so ignore the return value. Since with the warn_unused_result attribute
673 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
674 * I have to improvise here and use if(foo());
676 for (i = 0; i < vec_size(self->phi); ++i) {
678 if (vec_ir_instr_find(self->phi[i].value->writes, self, &idx))
679 vec_remove(self->phi[i].value->writes, idx, 1);
680 if (vec_ir_instr_find(self->phi[i].value->reads, self, &idx))
681 vec_remove(self->phi[i].value->reads, idx, 1);
684 for (i = 0; i < vec_size(self->params); ++i) {
686 if (vec_ir_instr_find(self->params[i]->writes, self, &idx))
687 vec_remove(self->params[i]->writes, idx, 1);
688 if (vec_ir_instr_find(self->params[i]->reads, self, &idx))
689 vec_remove(self->params[i]->reads, idx, 1);
691 vec_free(self->params);
692 (void)!ir_instr_op(self, 0, NULL, false);
693 (void)!ir_instr_op(self, 1, NULL, false);
694 (void)!ir_instr_op(self, 2, NULL, false);
698 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
700 if (self->_ops[op]) {
702 if (writing && vec_ir_instr_find(self->_ops[op]->writes, self, &idx))
703 vec_remove(self->_ops[op]->writes, idx, 1);
704 else if (vec_ir_instr_find(self->_ops[op]->reads, self, &idx))
705 vec_remove(self->_ops[op]->reads, idx, 1);
709 vec_push(v->writes, self);
711 vec_push(v->reads, self);
717 /***********************************************************************
721 void ir_value_code_setaddr(ir_value *self, int32_t gaddr)
723 self->code.globaladdr = gaddr;
724 if (self->members[0]) self->members[0]->code.globaladdr = gaddr;
725 if (self->members[1]) self->members[1]->code.globaladdr = gaddr;
726 if (self->members[2]) self->members[2]->code.globaladdr = gaddr;
729 int32_t ir_value_code_addr(const ir_value *self)
731 if (self->store == store_return)
732 return OFS_RETURN + self->code.addroffset;
733 return self->code.globaladdr + self->code.addroffset;
736 ir_value* ir_value_var(const char *name, int storetype, int vtype)
739 self = (ir_value*)mem_a(sizeof(*self));
741 self->fieldtype = TYPE_VOID;
742 self->outtype = TYPE_VOID;
743 self->store = storetype;
748 self->isconst = false;
749 self->context.file = "<@no context>";
750 self->context.line = 0;
752 if (name && !ir_value_set_name(self, name)) {
753 irerror(self->context, "out of memory");
758 memset(&self->constval, 0, sizeof(self->constval));
759 memset(&self->code, 0, sizeof(self->code));
761 self->members[0] = NULL;
762 self->members[1] = NULL;
763 self->members[2] = NULL;
764 self->memberof = NULL;
770 ir_value* ir_value_vector_member(ir_value *self, unsigned int member)
776 if (self->members[member])
777 return self->members[member];
779 if (self->vtype == TYPE_VECTOR)
781 m = ir_value_var(self->name, self->store, TYPE_FLOAT);
784 m->context = self->context;
786 self->members[member] = m;
787 m->code.addroffset = member;
789 else if (self->vtype == TYPE_FIELD)
791 if (self->fieldtype != TYPE_VECTOR)
793 m = ir_value_var(self->name, self->store, TYPE_FIELD);
796 m->fieldtype = TYPE_FLOAT;
797 m->context = self->context;
799 self->members[member] = m;
800 m->code.addroffset = member;
804 irerror(self->context, "invalid member access on %s", self->name);
812 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
814 ir_value *v = ir_value_var(name, storetype, vtype);
817 ir_function_collect_value(owner, v);
821 void ir_value_delete(ir_value* self)
825 mem_d((void*)self->name);
828 if (self->vtype == TYPE_STRING)
829 mem_d((void*)self->constval.vstring);
831 for (i = 0; i < 3; ++i) {
832 if (self->members[i])
833 ir_value_delete(self->members[i]);
835 vec_free(self->reads);
836 vec_free(self->writes);
837 vec_free(self->life);
841 bool ir_value_set_name(ir_value *self, const char *name)
844 mem_d((void*)self->name);
845 self->name = util_strdup(name);
849 bool ir_value_set_float(ir_value *self, float f)
851 if (self->vtype != TYPE_FLOAT)
853 self->constval.vfloat = f;
854 self->isconst = true;
858 bool ir_value_set_func(ir_value *self, int f)
860 if (self->vtype != TYPE_FUNCTION)
862 self->constval.vint = f;
863 self->isconst = true;
867 bool ir_value_set_vector(ir_value *self, vector v)
869 if (self->vtype != TYPE_VECTOR)
871 self->constval.vvec = v;
872 self->isconst = true;
876 bool ir_value_set_field(ir_value *self, ir_value *fld)
878 if (self->vtype != TYPE_FIELD)
880 self->constval.vpointer = fld;
881 self->isconst = true;
885 static char *ir_strdup(const char *str)
888 /* actually dup empty strings */
889 char *out = mem_a(1);
893 return util_strdup(str);
896 bool ir_value_set_string(ir_value *self, const char *str)
898 if (self->vtype != TYPE_STRING)
900 self->constval.vstring = ir_strdup(str);
901 self->isconst = true;
906 bool ir_value_set_int(ir_value *self, int i)
908 if (self->vtype != TYPE_INTEGER)
910 self->constval.vint = i;
911 self->isconst = true;
916 bool ir_value_lives(ir_value *self, size_t at)
919 for (i = 0; i < vec_size(self->life); ++i)
921 ir_life_entry_t *life = &self->life[i];
922 if (life->start <= at && at <= life->end)
924 if (life->start > at) /* since it's ordered */
930 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
933 vec_push(self->life, e);
934 for (k = vec_size(self->life)-1; k > idx; --k)
935 self->life[k] = self->life[k-1];
940 bool ir_value_life_merge(ir_value *self, size_t s)
943 ir_life_entry_t *life = NULL;
944 ir_life_entry_t *before = NULL;
945 ir_life_entry_t new_entry;
947 /* Find the first range >= s */
948 for (i = 0; i < vec_size(self->life); ++i)
951 life = &self->life[i];
955 /* nothing found? append */
956 if (i == vec_size(self->life)) {
958 if (life && life->end+1 == s)
960 /* previous life range can be merged in */
964 if (life && life->end >= s)
967 vec_push(self->life, e);
973 if (before->end + 1 == s &&
974 life->start - 1 == s)
977 before->end = life->end;
978 vec_remove(self->life, i, 1);
981 if (before->end + 1 == s)
987 /* already contained */
988 if (before->end >= s)
992 if (life->start - 1 == s)
997 /* insert a new entry */
998 new_entry.start = new_entry.end = s;
999 return ir_value_life_insert(self, i, new_entry);
1002 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
1006 if (!vec_size(other->life))
1009 if (!vec_size(self->life)) {
1010 size_t count = vec_size(other->life);
1011 ir_life_entry_t *life = vec_add(self->life, count);
1012 memcpy(life, other->life, count * sizeof(*life));
1017 for (i = 0; i < vec_size(other->life); ++i)
1019 const ir_life_entry_t *life = &other->life[i];
1022 ir_life_entry_t *entry = &self->life[myi];
1024 if (life->end+1 < entry->start)
1026 /* adding an interval before entry */
1027 if (!ir_value_life_insert(self, myi, *life))
1033 if (life->start < entry->start &&
1034 life->end+1 >= entry->start)
1036 /* starts earlier and overlaps */
1037 entry->start = life->start;
1040 if (life->end > entry->end &&
1041 life->start <= entry->end+1)
1043 /* ends later and overlaps */
1044 entry->end = life->end;
1047 /* see if our change combines it with the next ranges */
1048 while (myi+1 < vec_size(self->life) &&
1049 entry->end+1 >= self->life[1+myi].start)
1051 /* overlaps with (myi+1) */
1052 if (entry->end < self->life[1+myi].end)
1053 entry->end = self->life[1+myi].end;
1054 vec_remove(self->life, myi+1, 1);
1055 entry = &self->life[myi];
1058 /* see if we're after the entry */
1059 if (life->start > entry->end)
1062 /* append if we're at the end */
1063 if (myi >= vec_size(self->life)) {
1064 vec_push(self->life, *life);
1067 /* otherweise check the next range */
1076 bool ir_values_overlap(const ir_value *a, const ir_value *b)
1078 /* For any life entry in A see if it overlaps with
1079 * any life entry in B.
1080 * Note that the life entries are orderes, so we can make a
1081 * more efficient algorithm there than naively translating the
1085 ir_life_entry_t *la, *lb, *enda, *endb;
1087 /* first of all, if either has no life range, they cannot clash */
1088 if (!vec_size(a->life) || !vec_size(b->life))
1093 enda = la + vec_size(a->life);
1094 endb = lb + vec_size(b->life);
1097 /* check if the entries overlap, for that,
1098 * both must start before the other one ends.
1100 if (la->start < lb->end &&
1101 lb->start < la->end)
1106 /* entries are ordered
1107 * one entry is earlier than the other
1108 * that earlier entry will be moved forward
1110 if (la->start < lb->start)
1112 /* order: A B, move A forward
1113 * check if we hit the end with A
1118 else /* if (lb->start < la->start) actually <= */
1120 /* order: B A, move B forward
1121 * check if we hit the end with B
1130 /***********************************************************************
1134 bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
1136 ir_instr *in = ir_instr_new(self, op);
1140 if (target->store == store_value &&
1141 (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1143 irerror(self->context, "cannot store to an SSA value");
1144 irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1145 irerror(self->context, "instruction: %s", asm_instr[op].m);
1149 if (!ir_instr_op(in, 0, target, true) ||
1150 !ir_instr_op(in, 1, what, false))
1154 vec_push(self->instr, in);
1158 bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
1162 if (target->vtype == TYPE_VARIANT)
1163 vtype = what->vtype;
1165 vtype = target->vtype;
1168 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
1169 op = INSTR_CONV_ITOF;
1170 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1171 op = INSTR_CONV_FTOI;
1173 op = type_store_instr[vtype];
1175 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1176 if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1180 return ir_block_create_store_op(self, op, target, what);
1183 bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
1188 if (target->vtype != TYPE_POINTER)
1191 /* storing using pointer - target is a pointer, type must be
1192 * inferred from source
1194 vtype = what->vtype;
1196 op = type_storep_instr[vtype];
1197 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1198 if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1199 op = INSTR_STOREP_V;
1202 return ir_block_create_store_op(self, op, target, what);
1205 bool ir_block_create_return(ir_block *self, ir_value *v)
1209 irerror(self->context, "block already ended (%s)", self->label);
1213 self->is_return = true;
1214 in = ir_instr_new(self, INSTR_RETURN);
1218 if (v && !ir_instr_op(in, 0, v, false))
1221 vec_push(self->instr, in);
1225 bool ir_block_create_if(ir_block *self, ir_value *v,
1226 ir_block *ontrue, ir_block *onfalse)
1230 irerror(self->context, "block already ended (%s)", self->label);
1234 /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1235 in = ir_instr_new(self, VINSTR_COND);
1239 if (!ir_instr_op(in, 0, v, false)) {
1240 ir_instr_delete(in);
1244 in->bops[0] = ontrue;
1245 in->bops[1] = onfalse;
1247 vec_push(self->instr, in);
1249 vec_push(self->exits, ontrue);
1250 vec_push(self->exits, onfalse);
1251 vec_push(ontrue->entries, self);
1252 vec_push(onfalse->entries, self);
1256 bool ir_block_create_jump(ir_block *self, ir_block *to)
1260 irerror(self->context, "block already ended (%s)", self->label);
1264 in = ir_instr_new(self, VINSTR_JUMP);
1269 vec_push(self->instr, in);
1271 vec_push(self->exits, to);
1272 vec_push(to->entries, self);
1276 bool ir_block_create_goto(ir_block *self, ir_block *to)
1280 irerror(self->context, "block already ended (%s)", self->label);
1284 in = ir_instr_new(self, INSTR_GOTO);
1289 vec_push(self->instr, in);
1291 vec_push(self->exits, to);
1292 vec_push(to->entries, self);
1296 ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
1300 in = ir_instr_new(self, VINSTR_PHI);
1303 out = ir_value_out(self->owner, label, store_value, ot);
1305 ir_instr_delete(in);
1308 if (!ir_instr_op(in, 0, out, true)) {
1309 ir_instr_delete(in);
1310 ir_value_delete(out);
1313 vec_push(self->instr, in);
1317 ir_value* ir_phi_value(ir_instr *self)
1319 return self->_ops[0];
1322 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1326 if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1327 /* Must not be possible to cause this, otherwise the AST
1328 * is doing something wrong.
1330 irerror(self->context, "Invalid entry block for PHI");
1336 vec_push(v->reads, self);
1337 vec_push(self->phi, pe);
1340 /* call related code */
1341 ir_instr* ir_block_create_call(ir_block *self, const char *label, ir_value *func)
1345 in = ir_instr_new(self, INSTR_CALL0);
1348 out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1350 ir_instr_delete(in);
1353 if (!ir_instr_op(in, 0, out, true) ||
1354 !ir_instr_op(in, 1, func, false))
1356 ir_instr_delete(in);
1357 ir_value_delete(out);
1360 vec_push(self->instr, in);
1364 ir_value* ir_call_value(ir_instr *self)
1366 return self->_ops[0];
1369 void ir_call_param(ir_instr* self, ir_value *v)
1371 vec_push(self->params, v);
1372 vec_push(v->reads, self);
1375 /* binary op related code */
1377 ir_value* ir_block_create_binop(ir_block *self,
1378 const char *label, int opcode,
1379 ir_value *left, ir_value *right)
1401 case INSTR_SUB_S: /* -- offset of string as float */
1406 case INSTR_BITOR_IF:
1407 case INSTR_BITOR_FI:
1408 case INSTR_BITAND_FI:
1409 case INSTR_BITAND_IF:
1424 case INSTR_BITAND_I:
1427 case INSTR_RSHIFT_I:
1428 case INSTR_LSHIFT_I:
1450 /* boolean operations result in floats */
1451 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1453 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1456 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1461 if (ot == TYPE_VOID) {
1462 /* The AST or parser were supposed to check this! */
1466 return ir_block_create_general_instr(self, label, opcode, left, right, ot);
1469 ir_value* ir_block_create_unary(ir_block *self,
1470 const char *label, int opcode,
1473 int ot = TYPE_FLOAT;
1485 /* QC doesn't have other unary operations. We expect extensions to fill
1486 * the above list, otherwise we assume out-type = in-type, eg for an
1490 ot = operand->vtype;
1493 if (ot == TYPE_VOID) {
1494 /* The AST or parser were supposed to check this! */
1498 /* let's use the general instruction creator and pass NULL for OPB */
1499 return ir_block_create_general_instr(self, label, opcode, operand, NULL, ot);
1502 ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
1503 int op, ir_value *a, ir_value *b, int outype)
1508 out = ir_value_out(self->owner, label, store_value, outype);
1512 instr = ir_instr_new(self, op);
1514 ir_value_delete(out);
1518 if (!ir_instr_op(instr, 0, out, true) ||
1519 !ir_instr_op(instr, 1, a, false) ||
1520 !ir_instr_op(instr, 2, b, false) )
1525 vec_push(self->instr, instr);
1529 ir_instr_delete(instr);
1530 ir_value_delete(out);
1534 ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
1538 /* Support for various pointer types todo if so desired */
1539 if (ent->vtype != TYPE_ENTITY)
1542 if (field->vtype != TYPE_FIELD)
1545 v = ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1546 v->fieldtype = field->fieldtype;
1550 ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
1553 if (ent->vtype != TYPE_ENTITY)
1556 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1557 if (field->vtype != TYPE_FIELD)
1562 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1563 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1564 case TYPE_STRING: op = INSTR_LOAD_S; break;
1565 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1566 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1567 case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1569 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1570 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1573 irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1577 return ir_block_create_general_instr(self, label, op, ent, field, outype);
1580 ir_value* ir_block_create_add(ir_block *self,
1582 ir_value *left, ir_value *right)
1585 int l = left->vtype;
1586 int r = right->vtype;
1590 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1606 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1608 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1613 irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
1617 return ir_block_create_binop(self, label, op, left, right);
1620 ir_value* ir_block_create_sub(ir_block *self,
1622 ir_value *left, ir_value *right)
1625 int l = left->vtype;
1626 int r = right->vtype;
1631 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1647 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1649 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1654 irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
1658 return ir_block_create_binop(self, label, op, left, right);
1661 ir_value* ir_block_create_mul(ir_block *self,
1663 ir_value *left, ir_value *right)
1666 int l = left->vtype;
1667 int r = right->vtype;
1672 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1687 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1689 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1692 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1694 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1696 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1698 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1702 irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
1706 return ir_block_create_binop(self, label, op, left, right);
1709 ir_value* ir_block_create_div(ir_block *self,
1711 ir_value *left, ir_value *right)
1714 int l = left->vtype;
1715 int r = right->vtype;
1720 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1733 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1735 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1737 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1742 irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
1746 return ir_block_create_binop(self, label, op, left, right);
1749 /* PHI resolving breaks the SSA, and must thus be the last
1750 * step before life-range calculation.
1753 static bool ir_block_naive_phi(ir_block *self);
1754 bool ir_function_naive_phi(ir_function *self)
1758 for (i = 0; i < vec_size(self->blocks); ++i)
1760 if (!ir_block_naive_phi(self->blocks[i]))
1766 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1771 /* create a store */
1772 if (!ir_block_create_store(block, old, what))
1775 /* we now move it up */
1776 instr = vec_last(block->instr);
1777 for (i = vec_size(block->instr)-1; i > iid; --i)
1778 block->instr[i] = block->instr[i-1];
1779 block->instr[i] = instr;
1784 static bool ir_block_naive_phi(ir_block *self)
1787 /* FIXME: optionally, create_phi can add the phis
1788 * to a list so we don't need to loop through blocks
1789 * - anyway: "don't optimize YET"
1791 for (i = 0; i < vec_size(self->instr); ++i)
1793 ir_instr *instr = self->instr[i];
1794 if (instr->opcode != VINSTR_PHI)
1797 vec_remove(self->instr, i, 1);
1798 --i; /* NOTE: i+1 below */
1800 for (p = 0; p < vec_size(instr->phi); ++p)
1802 ir_value *v = instr->phi[p].value;
1803 for (w = 0; w < vec_size(v->writes); ++w) {
1806 if (!v->writes[w]->_ops[0])
1809 /* When the write was to a global, we have to emit a mov */
1810 old = v->writes[w]->_ops[0];
1812 /* The original instruction now writes to the PHI target local */
1813 if (v->writes[w]->_ops[0] == v)
1814 v->writes[w]->_ops[0] = instr->_ops[0];
1816 if (old->store != store_value && old->store != store_local && old->store != store_param)
1818 /* If it originally wrote to a global we need to store the value
1821 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1823 if (i+1 < vec_size(self->instr))
1824 instr = self->instr[i+1];
1827 /* In case I forget and access instr later, it'll be NULL
1828 * when it's a problem, to make sure we crash, rather than accessing
1834 /* If it didn't, we can replace all reads by the phi target now. */
1836 for (r = 0; r < vec_size(old->reads); ++r)
1839 ir_instr *ri = old->reads[r];
1840 for (op = 0; op < vec_size(ri->phi); ++op) {
1841 if (ri->phi[op].value == old)
1842 ri->phi[op].value = v;
1844 for (op = 0; op < 3; ++op) {
1845 if (ri->_ops[op] == old)
1852 ir_instr_delete(instr);
1857 /***********************************************************************
1858 *IR Temp allocation code
1859 * Propagating value life ranges by walking through the function backwards
1860 * until no more changes are made.
1861 * In theory this should happen once more than once for every nested loop
1863 * Though this implementation might run an additional time for if nests.
1866 /* Enumerate instructions used by value's life-ranges
1868 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1872 for (i = 0; i < vec_size(self->instr); ++i)
1874 self->instr[i]->eid = eid++;
1879 /* Enumerate blocks and instructions.
1880 * The block-enumeration is unordered!
1881 * We do not really use the block enumreation, however
1882 * the instruction enumeration is important for life-ranges.
1884 void ir_function_enumerate(ir_function *self)
1887 size_t instruction_id = 0;
1888 for (i = 0; i < vec_size(self->blocks); ++i)
1890 self->blocks[i]->eid = i;
1891 self->blocks[i]->run_id = 0;
1892 ir_block_enumerate(self->blocks[i], &instruction_id);
1896 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
1897 bool ir_function_calculate_liferanges(ir_function *self)
1905 for (i = 0; i != vec_size(self->blocks); ++i)
1907 if (self->blocks[i]->is_return)
1909 vec_free(self->blocks[i]->living);
1910 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
1915 if (vec_size(self->blocks)) {
1916 ir_block *block = self->blocks[0];
1917 for (i = 0; i < vec_size(block->living); ++i) {
1918 ir_value *v = block->living[i];
1919 if (v->memberof || v->store != store_local)
1921 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
1922 "variable `%s` may be used uninitialized in this function", v->name))
1931 /* Local-value allocator
1932 * After finishing creating the liferange of all values used in a function
1933 * we can allocate their global-positions.
1934 * This is the counterpart to register-allocation in register machines.
1940 } function_allocator;
1942 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
1945 size_t vsize = type_sizeof[var->vtype];
1947 slot = ir_value_var("reg", store_global, var->vtype);
1951 if (!ir_value_life_merge_into(slot, var))
1954 vec_push(alloc->locals, slot);
1955 vec_push(alloc->sizes, vsize);
1960 ir_value_delete(slot);
1964 bool ir_function_allocate_locals(ir_function *self)
1973 function_allocator alloc;
1975 if (!vec_size(self->locals) && !vec_size(self->values))
1978 alloc.locals = NULL;
1980 alloc.positions = NULL;
1982 for (i = 0; i < vec_size(self->locals); ++i)
1984 if (!function_allocator_alloc(&alloc, self->locals[i]))
1988 /* Allocate a slot for any value that still exists */
1989 for (i = 0; i < vec_size(self->values); ++i)
1991 v = self->values[i];
1993 if (!vec_size(v->life))
1996 for (a = 0; a < vec_size(alloc.locals); ++a)
1998 slot = alloc.locals[a];
2000 if (ir_values_overlap(v, slot))
2003 if (!ir_value_life_merge_into(slot, v))
2006 /* adjust size for this slot */
2007 if (alloc.sizes[a] < type_sizeof[v->vtype])
2008 alloc.sizes[a] = type_sizeof[v->vtype];
2010 self->values[i]->code.local = a;
2013 if (a >= vec_size(alloc.locals)) {
2014 self->values[i]->code.local = vec_size(alloc.locals);
2015 if (!function_allocator_alloc(&alloc, v))
2024 /* Adjust slot positions based on sizes */
2025 vec_push(alloc.positions, 0);
2027 if (vec_size(alloc.sizes))
2028 pos = alloc.positions[0] + alloc.sizes[0];
2031 for (i = 1; i < vec_size(alloc.sizes); ++i)
2033 pos = alloc.positions[i-1] + alloc.sizes[i-1];
2034 vec_push(alloc.positions, pos);
2037 self->allocated_locals = pos + vec_last(alloc.sizes);
2039 /* Take over the actual slot positions */
2040 for (i = 0; i < vec_size(self->values); ++i) {
2041 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
2049 for (i = 0; i < vec_size(alloc.locals); ++i)
2050 ir_value_delete(alloc.locals[i]);
2051 vec_free(alloc.locals);
2052 vec_free(alloc.sizes);
2053 vec_free(alloc.positions);
2057 /* Get information about which operand
2058 * is read from, or written to.
2060 static void ir_op_read_write(int op, size_t *read, size_t *write)
2080 case INSTR_STOREP_F:
2081 case INSTR_STOREP_V:
2082 case INSTR_STOREP_S:
2083 case INSTR_STOREP_ENT:
2084 case INSTR_STOREP_FLD:
2085 case INSTR_STOREP_FNC:
2096 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2099 bool changed = false;
2101 for (i = 0; i != vec_size(self->living); ++i)
2103 tempbool = ir_value_life_merge(self->living[i], eid);
2106 irerror(self->context, "block_living_add_instr() value instruction added %s: %i", self->living[i]->_name, (int)eid);
2108 changed = changed || tempbool;
2113 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
2116 /* values which have been read in a previous iteration are now
2117 * in the "living" array even if the previous block doesn't use them.
2118 * So we have to remove whatever does not exist in the previous block.
2119 * They will be re-added on-read, but the liferange merge won't cause
2122 for (i = 0; i < vec_size(self->living); ++i)
2124 if (!vec_ir_value_find(prev->living, self->living[i], NULL)) {
2125 vec_remove(self->living, i, 1);
2130 /* Whatever the previous block still has in its living set
2131 * must now be added to ours as well.
2133 for (i = 0; i < vec_size(prev->living); ++i)
2135 if (vec_ir_value_find(self->living, prev->living[i], NULL))
2137 vec_push(self->living, prev->living[i]);
2139 irerror(self->contextt from prev: %s", self->label, prev->living[i]->_name);
2145 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
2151 /* bitmasks which operands are read from or written to */
2153 char dbg_ind[16] = { '#', '0' };
2158 if (!ir_block_life_prop_previous(self, prev, changed))
2162 i = vec_size(self->instr);
2165 instr = self->instr[i];
2167 /* PHI operands are always read operands */
2168 for (p = 0; p < vec_size(instr->phi); ++p)
2170 value = instr->phi[p].value;
2171 if (value->memberof)
2172 value = value->memberof;
2173 if (!vec_ir_value_find(self->living, value, NULL))
2174 vec_push(self->living, value);
2177 /* call params are read operands too */
2178 for (p = 0; p < vec_size(instr->params); ++p)
2180 value = instr->params[p];
2181 if (value->memberof)
2182 value = value->memberof;
2183 if (!vec_ir_value_find(self->living, value, NULL))
2184 vec_push(self->living, value);
2187 /* See which operands are read and write operands */
2188 ir_op_read_write(instr->opcode, &read, &write);
2190 if (instr->opcode == INSTR_MUL_VF)
2192 /* the float source will get an additional lifetime */
2193 tempbool = ir_value_life_merge(instr->_ops[2], instr->eid+1);
2194 *changed = *changed || tempbool;
2196 else if (instr->opcode == INSTR_MUL_FV)
2198 /* the float source will get an additional lifetime */
2199 tempbool = ir_value_life_merge(instr->_ops[1], instr->eid+1);
2200 *changed = *changed || tempbool;
2203 /* Go through the 3 main operands */
2204 for (o = 0; o < 3; ++o)
2206 if (!instr->_ops[o]) /* no such operand */
2209 value = instr->_ops[o];
2210 if (value->memberof)
2211 value = value->memberof;
2213 /* We only care about locals */
2214 /* we also calculate parameter liferanges so that locals
2215 * can take up parameter slots */
2216 if (value->store != store_value &&
2217 value->store != store_local &&
2218 value->store != store_param)
2224 if (!vec_ir_value_find(self->living, value, NULL))
2225 vec_push(self->living, value);
2228 /* write operands */
2229 /* When we write to a local, we consider it "dead" for the
2230 * remaining upper part of the function, since in SSA a value
2231 * can only be written once (== created)
2236 bool in_living = vec_ir_value_find(self->living, value, &idx);
2239 /* If the value isn't alive it hasn't been read before... */
2240 /* TODO: See if the warning can be emitted during parsing or AST processing
2241 * otherwise have warning printed here.
2242 * IF printing a warning here: include filecontext_t,
2243 * and make sure it's only printed once
2244 * since this function is run multiple times.
2246 /* For now: debug info: */
2247 /* con_err( "Value only written %s\n", value->name); */
2248 tempbool = ir_value_life_merge(value, instr->eid);
2249 *changed = *changed || tempbool;
2251 ir_instr_dump(instr, dbg_ind, printf);
2255 /* since 'living' won't contain it
2256 * anymore, merge the value, since
2259 tempbool = ir_value_life_merge(value, instr->eid);
2262 con_err( "value added id %s %i\n", value->name, (int)instr->eid);
2264 *changed = *changed || tempbool;
2266 vec_remove(self->living, idx, 1);
2271 tempbool = ir_block_living_add_instr(self, instr->eid);
2272 /*con_err( "living added values\n");*/
2273 *changed = *changed || tempbool;
2277 if (self->run_id == self->owner->run_id)
2280 self->run_id = self->owner->run_id;
2282 for (i = 0; i < vec_size(self->entries); ++i)
2284 ir_block *entry = self->entries[i];
2285 ir_block_life_propagate(entry, self, changed);
2291 /***********************************************************************
2294 * Since the IR has the convention of putting 'write' operands
2295 * at the beginning, we have to rotate the operands of instructions
2296 * properly in order to generate valid QCVM code.
2298 * Having destinations at a fixed position is more convenient. In QC
2299 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2300 * read from from OPA, and store to OPB rather than OPC. Which is
2301 * partially the reason why the implementation of these instructions
2302 * in darkplaces has been delayed for so long.
2304 * Breaking conventions is annoying...
2306 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2308 static bool gen_global_field(ir_value *global)
2310 if (global->isconst)
2312 ir_value *fld = global->constval.vpointer;
2314 irerror(global->context, "Invalid field constant with no field: %s", global->name);
2318 /* Now, in this case, a relocation would be impossible to code
2319 * since it looks like this:
2320 * .vector v = origin; <- parse error, wtf is 'origin'?
2323 * But we will need a general relocation support later anyway
2324 * for functions... might as well support that here.
2326 if (!fld->code.globaladdr) {
2327 irerror(global->context, "FIXME: Relocation support");
2331 /* copy the field's value */
2332 ir_value_code_setaddr(global, vec_size(code_globals));
2333 vec_push(code_globals, code_globals[fld->code.globaladdr]);
2334 if (global->fieldtype == TYPE_VECTOR) {
2335 vec_push(code_globals, code_globals[fld->code.globaladdr]+1);
2336 vec_push(code_globals, code_globals[fld->code.globaladdr]+2);
2341 ir_value_code_setaddr(global, vec_size(code_globals));
2342 vec_push(code_globals, 0);
2343 if (global->fieldtype == TYPE_VECTOR) {
2344 vec_push(code_globals, 0);
2345 vec_push(code_globals, 0);
2348 if (global->code.globaladdr < 0)
2353 static bool gen_global_pointer(ir_value *global)
2355 if (global->isconst)
2357 ir_value *target = global->constval.vpointer;
2359 irerror(global->context, "Invalid pointer constant: %s", global->name);
2360 /* NULL pointers are pointing to the NULL constant, which also
2361 * sits at address 0, but still has an ir_value for itself.
2366 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2367 * void() foo; <- proto
2368 * void() *fooptr = &foo;
2369 * void() foo = { code }
2371 if (!target->code.globaladdr) {
2372 /* FIXME: Check for the constant nullptr ir_value!
2373 * because then code.globaladdr being 0 is valid.
2375 irerror(global->context, "FIXME: Relocation support");
2379 ir_value_code_setaddr(global, vec_size(code_globals));
2380 vec_push(code_globals, target->code.globaladdr);
2384 ir_value_code_setaddr(global, vec_size(code_globals));
2385 vec_push(code_globals, 0);
2387 if (global->code.globaladdr < 0)
2392 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2394 prog_section_statement stmt;
2403 block->generated = true;
2404 block->code_start = vec_size(code_statements);
2405 for (i = 0; i < vec_size(block->instr); ++i)
2407 instr = block->instr[i];
2409 if (instr->opcode == VINSTR_PHI) {
2410 irerror(block->context, "cannot generate virtual instruction (phi)");
2414 if (instr->opcode == VINSTR_JUMP) {
2415 target = instr->bops[0];
2416 /* for uncoditional jumps, if the target hasn't been generated
2417 * yet, we generate them right here.
2419 if (!target->generated) {
2424 /* otherwise we generate a jump instruction */
2425 stmt.opcode = INSTR_GOTO;
2426 stmt.o1.s1 = (target->code_start) - vec_size(code_statements);
2429 vec_push(code_statements, stmt);
2431 /* no further instructions can be in this block */
2435 if (instr->opcode == VINSTR_COND) {
2436 ontrue = instr->bops[0];
2437 onfalse = instr->bops[1];
2438 /* TODO: have the AST signal which block should
2439 * come first: eg. optimize IFs without ELSE...
2442 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2446 if (ontrue->generated) {
2447 stmt.opcode = INSTR_IF;
2448 stmt.o2.s1 = (ontrue->code_start) - vec_size(code_statements);
2449 vec_push(code_statements, stmt);
2451 if (onfalse->generated) {
2452 stmt.opcode = INSTR_IFNOT;
2453 stmt.o2.s1 = (onfalse->code_start) - vec_size(code_statements);
2454 vec_push(code_statements, stmt);
2456 if (!ontrue->generated) {
2457 if (onfalse->generated) {
2462 if (!onfalse->generated) {
2463 if (ontrue->generated) {
2468 /* neither ontrue nor onfalse exist */
2469 stmt.opcode = INSTR_IFNOT;
2470 stidx = vec_size(code_statements);
2471 vec_push(code_statements, stmt);
2472 /* on false we jump, so add ontrue-path */
2473 if (!gen_blocks_recursive(func, ontrue))
2475 /* fixup the jump address */
2476 code_statements[stidx].o2.s1 = vec_size(code_statements) - stidx;
2477 /* generate onfalse path */
2478 if (onfalse->generated) {
2479 /* fixup the jump address */
2480 code_statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2481 /* may have been generated in the previous recursive call */
2482 stmt.opcode = INSTR_GOTO;
2483 stmt.o1.s1 = (onfalse->code_start) - vec_size(code_statements);
2486 vec_push(code_statements, stmt);
2489 /* if not, generate now */
2494 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2495 /* Trivial call translation:
2496 * copy all params to OFS_PARM*
2497 * if the output's storetype is not store_return,
2498 * add append a STORE instruction!
2500 * NOTES on how to do it better without much trouble:
2501 * -) The liferanges!
2502 * Simply check the liferange of all parameters for
2503 * other CALLs. For each param with no CALL in its
2504 * liferange, we can store it in an OFS_PARM at
2505 * generation already. This would even include later
2506 * reuse.... probably... :)
2511 first = vec_size(instr->params);
2514 for (p = 0; p < first; ++p)
2516 ir_value *param = instr->params[p];
2518 stmt.opcode = INSTR_STORE_F;
2521 if (param->vtype == TYPE_FIELD)
2522 stmt.opcode = field_store_instr[param->fieldtype];
2524 stmt.opcode = type_store_instr[param->vtype];
2525 stmt.o1.u1 = ir_value_code_addr(param);
2526 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2527 vec_push(code_statements, stmt);
2529 /* No whandle extparams */
2530 first = vec_size(instr->params);
2531 for (; p < first; ++p)
2533 ir_builder *ir = func->owner;
2534 ir_value *param = instr->params[p];
2537 if (p-8 >= vec_size(ir->extparams)) {
2538 irerror(instr->context, "Not enough extparam-globals have been created");
2542 target = ir->extparams[p-8];
2544 stmt.opcode = INSTR_STORE_F;
2547 if (param->vtype == TYPE_FIELD)
2548 stmt.opcode = field_store_instr[param->fieldtype];
2550 stmt.opcode = type_store_instr[param->vtype];
2551 stmt.o1.u1 = ir_value_code_addr(param);
2552 stmt.o2.u1 = ir_value_code_addr(target);
2553 vec_push(code_statements, stmt);
2556 stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
2557 if (stmt.opcode > INSTR_CALL8)
2558 stmt.opcode = INSTR_CALL8;
2559 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2562 vec_push(code_statements, stmt);
2564 retvalue = instr->_ops[0];
2565 if (retvalue && retvalue->store != store_return && vec_size(retvalue->life))
2567 /* not to be kept in OFS_RETURN */
2568 if (retvalue->vtype == TYPE_FIELD)
2569 stmt.opcode = field_store_instr[retvalue->vtype];
2571 stmt.opcode = type_store_instr[retvalue->vtype];
2572 stmt.o1.u1 = OFS_RETURN;
2573 stmt.o2.u1 = ir_value_code_addr(retvalue);
2575 vec_push(code_statements, stmt);
2580 if (instr->opcode == INSTR_STATE) {
2581 irerror(block->context, "TODO: state instruction");
2585 stmt.opcode = instr->opcode;
2590 /* This is the general order of operands */
2592 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
2595 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2598 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
2600 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2602 stmt.o1.u1 = stmt.o3.u1;
2605 else if ((stmt.opcode >= INSTR_STORE_F &&
2606 stmt.opcode <= INSTR_STORE_FNC) ||
2607 (stmt.opcode >= INSTR_STOREP_F &&
2608 stmt.opcode <= INSTR_STOREP_FNC))
2610 /* 2-operand instructions with A -> B */
2611 stmt.o2.u1 = stmt.o3.u1;
2615 vec_push(code_statements, stmt);
2620 static bool gen_function_code(ir_function *self)
2623 prog_section_statement stmt;
2625 /* Starting from entry point, we generate blocks "as they come"
2626 * for now. Dead blocks will not be translated obviously.
2628 if (!vec_size(self->blocks)) {
2629 irerror(self->context, "Function '%s' declared without body.", self->name);
2633 block = self->blocks[0];
2634 if (block->generated)
2637 if (!gen_blocks_recursive(self, block)) {
2638 irerror(self->context, "failed to generate blocks for '%s'", self->name);
2642 /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
2643 stmt.opcode = AINSTR_END;
2647 vec_push(code_statements, stmt);
2651 static qcint ir_builder_filestring(ir_builder *ir, const char *filename)
2653 /* NOTE: filename pointers are copied, we never strdup them,
2654 * thus we can use pointer-comparison to find the string.
2659 for (i = 0; i < vec_size(ir->filenames); ++i) {
2660 if (ir->filenames[i] == filename)
2661 return ir->filestrings[i];
2664 str = code_genstring(filename);
2665 vec_push(ir->filenames, filename);
2666 vec_push(ir->filestrings, str);
2670 static bool gen_global_function(ir_builder *ir, ir_value *global)
2672 prog_section_function fun;
2676 size_t local_var_end;
2678 if (!global->isconst || (!global->constval.vfunc))
2680 irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
2684 irfun = global->constval.vfunc;
2686 fun.name = global->code.name;
2687 fun.file = ir_builder_filestring(ir, global->context.file);
2688 fun.profile = 0; /* always 0 */
2689 fun.nargs = vec_size(irfun->params);
2693 for (i = 0;i < 8; ++i) {
2697 fun.argsize[i] = type_sizeof[irfun->params[i]];
2700 fun.firstlocal = vec_size(code_globals);
2702 local_var_end = fun.firstlocal;
2703 for (i = 0; i < vec_size(irfun->locals); ++i) {
2704 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
2705 irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
2709 if (vec_size(irfun->locals)) {
2710 ir_value *last = vec_last(irfun->locals);
2711 local_var_end = last->code.globaladdr;
2712 local_var_end += type_sizeof[last->vtype];
2714 for (i = 0; i < vec_size(irfun->values); ++i)
2716 /* generate code.globaladdr for ssa values */
2717 ir_value *v = irfun->values[i];
2718 ir_value_code_setaddr(v, local_var_end + v->code.local);
2720 for (i = 0; i < irfun->allocated_locals; ++i) {
2721 /* fill the locals with zeros */
2722 vec_push(code_globals, 0);
2725 fun.locals = vec_size(code_globals) - fun.firstlocal;
2728 fun.entry = irfun->builtin;
2730 irfun->code_function_def = vec_size(code_functions);
2731 fun.entry = vec_size(code_statements);
2734 vec_push(code_functions, fun);
2738 static void ir_gen_extparam(ir_builder *ir)
2740 prog_section_def def;
2744 snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparams)+8));
2745 global = ir_value_var(name, store_global, TYPE_VECTOR);
2747 def.name = code_genstring(name);
2748 def.type = TYPE_VECTOR;
2749 def.offset = vec_size(code_globals);
2751 vec_push(code_defs, def);
2752 ir_value_code_setaddr(global, def.offset);
2753 vec_push(code_globals, 0);
2754 vec_push(code_globals, 0);
2755 vec_push(code_globals, 0);
2757 vec_push(ir->extparams, global);
2760 static bool gen_function_extparam_copy(ir_function *self)
2762 size_t i, ext, numparams;
2764 ir_builder *ir = self->owner;
2766 prog_section_statement stmt;
2768 numparams = vec_size(self->params);
2772 stmt.opcode = INSTR_STORE_F;
2774 for (i = 8; i < numparams; ++i) {
2776 if (ext >= vec_size(ir->extparams))
2777 ir_gen_extparam(ir);
2779 ep = ir->extparams[ext];
2781 stmt.opcode = type_store_instr[self->locals[i]->vtype];
2782 if (self->locals[i]->vtype == TYPE_FIELD &&
2783 self->locals[i]->fieldtype == TYPE_VECTOR)
2785 stmt.opcode = INSTR_STORE_V;
2787 stmt.o1.u1 = ir_value_code_addr(ep);
2788 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
2789 vec_push(code_statements, stmt);
2795 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
2797 prog_section_function *fundef;
2800 irfun = global->constval.vfunc;
2802 irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
2803 "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
2804 /* this was a function pointer, don't generate code for those */
2811 if (irfun->code_function_def < 0) {
2812 irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
2815 fundef = &code_functions[irfun->code_function_def];
2817 fundef->entry = vec_size(code_statements);
2818 if (!gen_function_extparam_copy(irfun)) {
2819 irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
2822 if (!gen_function_code(irfun)) {
2823 irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
2829 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
2833 prog_section_def def;
2835 def.type = global->vtype;
2836 def.offset = vec_size(code_globals);
2839 if (global->name[0] == '#') {
2840 if (!self->str_immediate)
2841 self->str_immediate = code_genstring("IMMEDIATE");
2842 def.name = global->code.name = self->str_immediate;
2845 def.name = global->code.name = code_genstring(global->name);
2850 switch (global->vtype)
2853 if (!strcmp(global->name, "end_sys_globals")) {
2854 /* TODO: remember this point... all the defs before this one
2855 * should be checksummed and added to progdefs.h when we generate it.
2858 else if (!strcmp(global->name, "end_sys_fields")) {
2859 /* TODO: same as above but for entity-fields rather than globsl
2863 irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
2865 /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
2866 * the system fields actually go? Though the engine knows this anyway...
2867 * Maybe this could be an -foption
2868 * fteqcc creates data for end_sys_* - of size 1, so let's do the same
2870 ir_value_code_setaddr(global, vec_size(code_globals));
2871 vec_push(code_globals, 0);
2873 vec_push(code_defs, def);
2876 vec_push(code_defs, def);
2877 return gen_global_pointer(global);
2879 vec_push(code_defs, def);
2880 return gen_global_field(global);
2885 ir_value_code_setaddr(global, vec_size(code_globals));
2886 if (global->isconst) {
2887 iptr = (int32_t*)&global->constval.ivec[0];
2888 vec_push(code_globals, *iptr);
2890 vec_push(code_globals, 0);
2892 def.type |= DEF_SAVEGLOBAL;
2894 vec_push(code_defs, def);
2896 return global->code.globaladdr >= 0;
2900 ir_value_code_setaddr(global, vec_size(code_globals));
2901 if (global->isconst) {
2902 vec_push(code_globals, code_genstring(global->constval.vstring));
2904 vec_push(code_globals, 0);
2906 def.type |= DEF_SAVEGLOBAL;
2908 vec_push(code_defs, def);
2909 return global->code.globaladdr >= 0;
2914 ir_value_code_setaddr(global, vec_size(code_globals));
2915 if (global->isconst) {
2916 iptr = (int32_t*)&global->constval.ivec[0];
2917 vec_push(code_globals, iptr[0]);
2918 if (global->code.globaladdr < 0)
2920 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2922 vec_push(code_globals, iptr[d]);
2925 vec_push(code_globals, 0);
2926 if (global->code.globaladdr < 0)
2928 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2930 vec_push(code_globals, 0);
2933 def.type |= DEF_SAVEGLOBAL;
2936 vec_push(code_defs, def);
2937 return global->code.globaladdr >= 0;
2940 ir_value_code_setaddr(global, vec_size(code_globals));
2941 if (!global->isconst) {
2942 vec_push(code_globals, 0);
2943 if (global->code.globaladdr < 0)
2946 vec_push(code_globals, vec_size(code_functions));
2947 if (!gen_global_function(self, global))
2950 def.type |= DEF_SAVEGLOBAL;
2952 vec_push(code_defs, def);
2955 /* assume biggest type */
2956 ir_value_code_setaddr(global, vec_size(code_globals));
2957 vec_push(code_globals, 0);
2958 for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
2959 vec_push(code_globals, 0);
2962 /* refuse to create 'void' type or any other fancy business. */
2963 irerror(global->context, "Invalid type for global variable `%s`: %s",
2964 global->name, type_name[global->vtype]);
2969 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
2971 prog_section_def def;
2972 prog_section_field fld;
2974 def.type = field->vtype;
2975 def.offset = vec_size(code_globals);
2977 /* create a global named the same as the field */
2978 if (opts_standard == COMPILER_GMQCC) {
2979 /* in our standard, the global gets a dot prefix */
2980 size_t len = strlen(field->name);
2983 /* we really don't want to have to allocate this, and 1024
2984 * bytes is more than enough for a variable/field name
2986 if (len+2 >= sizeof(name)) {
2987 irerror(field->context, "invalid field name size: %u", (unsigned int)len);
2992 memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
2995 def.name = code_genstring(name);
2996 fld.name = def.name + 1; /* we reuse that string table entry */
2998 /* in plain QC, there cannot be a global with the same name,
2999 * and so we also name the global the same.
3000 * FIXME: fteqcc should create a global as well
3001 * check if it actually uses the same name. Probably does
3003 def.name = code_genstring(field->name);
3004 fld.name = def.name;
3007 field->code.name = def.name;
3009 vec_push(code_defs, def);
3011 fld.type = field->fieldtype;
3013 if (fld.type == TYPE_VOID) {
3014 irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3018 fld.offset = code_alloc_field(type_sizeof[field->fieldtype]);
3020 vec_push(code_fields, fld);
3022 ir_value_code_setaddr(field, vec_size(code_globals));
3023 vec_push(code_globals, fld.offset);
3024 if (fld.type == TYPE_VECTOR) {
3025 vec_push(code_globals, fld.offset+1);
3026 vec_push(code_globals, fld.offset+2);
3029 return field->code.globaladdr >= 0;
3032 bool ir_builder_generate(ir_builder *self, const char *filename)
3034 prog_section_statement stmt;
3039 for (i = 0; i < vec_size(self->globals); ++i)
3041 if (!ir_builder_gen_global(self, self->globals[i], false)) {
3046 for (i = 0; i < vec_size(self->fields); ++i)
3048 if (!ir_builder_gen_field(self, self->fields[i])) {
3053 /* generate function code */
3054 for (i = 0; i < vec_size(self->globals); ++i)
3056 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3057 if (!gen_global_function_code(self, self->globals[i])) {
3063 /* DP errors if the last instruction is not an INSTR_DONE
3064 * and for debugging purposes we add an additional AINSTR_END
3065 * to the end of functions, so here it goes:
3067 stmt.opcode = INSTR_DONE;
3071 vec_push(code_statements, stmt);
3074 con_out("writing '%s'...\n", filename);
3075 return code_write(filename);
3078 /***********************************************************************
3079 *IR DEBUG Dump functions...
3082 #define IND_BUFSZ 1024
3085 # define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
3088 const char *qc_opname(int op)
3090 if (op < 0) return "<INVALID>";
3091 if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
3092 return asm_instr[op].m;
3094 case VINSTR_PHI: return "PHI";
3095 case VINSTR_JUMP: return "JUMP";
3096 case VINSTR_COND: return "COND";
3097 default: return "<UNK>";
3101 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
3104 char indent[IND_BUFSZ];
3108 oprintf("module %s\n", b->name);
3109 for (i = 0; i < vec_size(b->globals); ++i)
3112 if (b->globals[i]->isconst)
3113 oprintf("%s = ", b->globals[i]->name);
3114 ir_value_dump(b->globals[i], oprintf);
3117 for (i = 0; i < vec_size(b->functions); ++i)
3118 ir_function_dump(b->functions[i], indent, oprintf);
3119 oprintf("endmodule %s\n", b->name);
3122 void ir_function_dump(ir_function *f, char *ind,
3123 int (*oprintf)(const char*, ...))
3126 if (f->builtin != 0) {
3127 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
3130 oprintf("%sfunction %s\n", ind, f->name);
3131 strncat(ind, "\t", IND_BUFSZ);
3132 if (vec_size(f->locals))
3134 oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
3135 for (i = 0; i < vec_size(f->locals); ++i) {
3136 oprintf("%s\t", ind);
3137 ir_value_dump(f->locals[i], oprintf);
3141 oprintf("%sliferanges:\n", ind);
3142 for (i = 0; i < vec_size(f->locals); ++i) {
3144 ir_value *v = f->locals[i];
3145 oprintf("%s\t%s: unique ", ind, v->name);
3146 for (l = 0; l < vec_size(v->life); ++l) {
3147 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3151 for (i = 0; i < vec_size(f->values); ++i) {
3153 ir_value *v = f->values[i];
3154 oprintf("%s\t%s: @%i ", ind, v->name, (int)v->code.local);
3155 for (l = 0; l < vec_size(v->life); ++l) {
3156 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3160 if (vec_size(f->blocks))
3162 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
3163 for (i = 0; i < vec_size(f->blocks); ++i) {
3164 if (f->blocks[i]->run_id != f->run_id) {
3165 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
3167 ir_block_dump(f->blocks[i], ind, oprintf);
3171 ind[strlen(ind)-1] = 0;
3172 oprintf("%sendfunction %s\n", ind, f->name);
3175 void ir_block_dump(ir_block* b, char *ind,
3176 int (*oprintf)(const char*, ...))
3179 oprintf("%s:%s\n", ind, b->label);
3180 strncat(ind, "\t", IND_BUFSZ);
3182 for (i = 0; i < vec_size(b->instr); ++i)
3183 ir_instr_dump(b->instr[i], ind, oprintf);
3184 ind[strlen(ind)-1] = 0;
3187 void dump_phi(ir_instr *in, char *ind,
3188 int (*oprintf)(const char*, ...))
3191 oprintf("%s <- phi ", in->_ops[0]->name);
3192 for (i = 0; i < vec_size(in->phi); ++i)
3194 oprintf("([%s] : %s) ", in->phi[i].from->label,
3195 in->phi[i].value->name);
3200 void ir_instr_dump(ir_instr *in, char *ind,
3201 int (*oprintf)(const char*, ...))
3204 const char *comma = NULL;
3206 oprintf("%s (%i) ", ind, (int)in->eid);
3208 if (in->opcode == VINSTR_PHI) {
3209 dump_phi(in, ind, oprintf);
3213 strncat(ind, "\t", IND_BUFSZ);
3215 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
3216 ir_value_dump(in->_ops[0], oprintf);
3217 if (in->_ops[1] || in->_ops[2])
3220 if (in->opcode == INSTR_CALL0) {
3221 oprintf("CALL%i\t", vec_size(in->params));
3223 oprintf("%s\t", qc_opname(in->opcode));
3225 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
3226 ir_value_dump(in->_ops[0], oprintf);
3231 for (i = 1; i != 3; ++i) {
3235 ir_value_dump(in->_ops[i], oprintf);
3243 oprintf("[%s]", in->bops[0]->label);
3247 oprintf("%s[%s]", comma, in->bops[1]->label);
3248 if (vec_size(in->params)) {
3249 oprintf("\tparams: ");
3250 for (i = 0; i != vec_size(in->params); ++i) {
3251 oprintf("%s, ", in->params[i]->name);
3255 ind[strlen(ind)-1] = 0;
3258 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
3267 oprintf("fn:%s", v->name);
3270 oprintf("%g", v->constval.vfloat);
3273 oprintf("'%g %g %g'",
3276 v->constval.vvec.z);
3279 oprintf("(entity)");
3282 oprintf("\"%s\"", v->constval.vstring);
3286 oprintf("%i", v->constval.vint);
3291 v->constval.vpointer->name);
3295 oprintf("%s", v->name);
3299 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
3302 oprintf("Life of %12s:", self->name);
3303 for (i = 0; i < vec_size(self->life); ++i)
3305 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);