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 size_t type_sizeof[TYPE_COUNT] = {
39 1, /* TYPE_FUNCTION */
47 uint16_t type_store_instr[TYPE_COUNT] = {
48 INSTR_STORE_F, /* should use I when having integer support */
55 INSTR_STORE_ENT, /* should use I */
57 INSTR_STORE_ENT, /* integer type */
59 INSTR_STORE_V, /* variant, should never be accessed */
62 uint16_t type_storep_instr[TYPE_COUNT] = {
63 INSTR_STOREP_F, /* should use I when having integer support */
70 INSTR_STOREP_ENT, /* should use I */
72 INSTR_STOREP_ENT, /* integer type */
74 INSTR_STOREP_V, /* variant, should never be accessed */
77 MEM_VEC_FUNCTIONS(ir_value_vector, ir_value*, v)
79 /***********************************************************************
83 ir_builder* ir_builder_new(const char *modulename)
87 self = (ir_builder*)mem_a(sizeof(*self));
91 MEM_VECTOR_INIT(self, functions);
92 MEM_VECTOR_INIT(self, globals);
93 MEM_VECTOR_INIT(self, fields);
95 if (!ir_builder_set_name(self, modulename)) {
100 /* globals which always exist */
102 /* for now we give it a vector size */
103 ir_builder_create_global(self, "OFS_RETURN", TYPE_VARIANT);
108 MEM_VEC_FUNCTIONS(ir_builder, ir_value*, globals)
109 MEM_VEC_FUNCTIONS(ir_builder, ir_value*, fields)
110 MEM_VEC_FUNCTIONS(ir_builder, ir_function*, functions)
112 void ir_builder_delete(ir_builder* self)
115 mem_d((void*)self->name);
116 for (i = 0; i != self->functions_count; ++i) {
117 ir_function_delete(self->functions[i]);
119 MEM_VECTOR_CLEAR(self, functions);
120 for (i = 0; i != self->globals_count; ++i) {
121 ir_value_delete(self->globals[i]);
123 MEM_VECTOR_CLEAR(self, fields);
124 for (i = 0; i != self->fields_count; ++i) {
125 ir_value_delete(self->fields[i]);
127 MEM_VECTOR_CLEAR(self, fields);
131 bool ir_builder_set_name(ir_builder *self, const char *name)
134 mem_d((void*)self->name);
135 self->name = util_strdup(name);
139 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
142 for (i = 0; i < self->functions_count; ++i) {
143 if (!strcmp(name, self->functions[i]->name))
144 return self->functions[i];
149 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
151 ir_function *fn = ir_builder_get_function(self, name);
156 fn = ir_function_new(self, outtype);
157 if (!ir_function_set_name(fn, name) ||
158 !ir_builder_functions_add(self, fn) )
160 ir_function_delete(fn);
164 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
166 ir_function_delete(fn);
170 fn->value->isconst = true;
171 fn->value->outtype = outtype;
172 fn->value->constval.vfunc = fn;
173 fn->value->context = fn->context;
178 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
181 for (i = 0; i < self->globals_count; ++i) {
182 if (!strcmp(self->globals[i]->name, name))
183 return self->globals[i];
188 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
190 ir_value *ve = ir_builder_get_global(self, name);
195 ve = ir_value_var(name, store_global, vtype);
196 if (!ir_builder_globals_add(self, ve)) {
203 ir_value* ir_builder_get_field(ir_builder *self, const char *name)
206 for (i = 0; i < self->fields_count; ++i) {
207 if (!strcmp(self->fields[i]->name, name))
208 return self->fields[i];
214 ir_value* ir_builder_create_field(ir_builder *self, const char *name, int vtype)
216 ir_value *ve = ir_builder_get_field(self, name);
221 ve = ir_value_var(name, store_global, TYPE_FIELD);
222 ve->fieldtype = vtype;
223 if (!ir_builder_fields_add(self, ve)) {
230 /***********************************************************************
234 bool ir_function_naive_phi(ir_function*);
235 void ir_function_enumerate(ir_function*);
236 bool ir_function_calculate_liferanges(ir_function*);
237 bool ir_function_allocate_locals(ir_function*);
239 ir_function* ir_function_new(ir_builder* owner, int outtype)
242 self = (ir_function*)mem_a(sizeof(*self));
248 if (!ir_function_set_name(self, "<@unnamed>")) {
253 self->context.file = "<@no context>";
254 self->context.line = 0;
255 self->outtype = outtype;
258 MEM_VECTOR_INIT(self, params);
259 MEM_VECTOR_INIT(self, blocks);
260 MEM_VECTOR_INIT(self, values);
261 MEM_VECTOR_INIT(self, locals);
266 MEM_VEC_FUNCTIONS(ir_function, ir_value*, values)
267 MEM_VEC_FUNCTIONS(ir_function, ir_block*, blocks)
268 MEM_VEC_FUNCTIONS(ir_function, ir_value*, locals)
269 MEM_VEC_FUNCTIONS(ir_function, int, params)
271 bool ir_function_set_name(ir_function *self, const char *name)
274 mem_d((void*)self->name);
275 self->name = util_strdup(name);
279 void ir_function_delete(ir_function *self)
282 mem_d((void*)self->name);
284 for (i = 0; i != self->blocks_count; ++i)
285 ir_block_delete(self->blocks[i]);
286 MEM_VECTOR_CLEAR(self, blocks);
288 MEM_VECTOR_CLEAR(self, params);
290 for (i = 0; i != self->values_count; ++i)
291 ir_value_delete(self->values[i]);
292 MEM_VECTOR_CLEAR(self, values);
294 for (i = 0; i != self->locals_count; ++i)
295 ir_value_delete(self->locals[i]);
296 MEM_VECTOR_CLEAR(self, locals);
298 /* self->value is deleted by the builder */
303 bool GMQCC_WARN ir_function_collect_value(ir_function *self, ir_value *v)
305 return ir_function_values_add(self, v);
308 ir_block* ir_function_create_block(ir_function *self, const char *label)
310 ir_block* bn = ir_block_new(self, label);
311 memcpy(&bn->context, &self->context, sizeof(self->context));
312 if (!ir_function_blocks_add(self, bn)) {
319 bool ir_function_finalize(ir_function *self)
324 if (!ir_function_naive_phi(self))
327 ir_function_enumerate(self);
329 if (!ir_function_calculate_liferanges(self))
332 if (!ir_function_allocate_locals(self))
337 ir_value* ir_function_get_local(ir_function *self, const char *name)
340 for (i = 0; i < self->locals_count; ++i) {
341 if (!strcmp(self->locals[i]->name, name))
342 return self->locals[i];
347 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
349 ir_value *ve = ir_function_get_local(self, name);
355 self->locals_count &&
356 self->locals[self->locals_count-1]->store != store_param) {
357 printf("cannot add parameters after adding locals\n");
361 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
362 if (!ir_function_locals_add(self, ve)) {
369 /***********************************************************************
373 ir_block* ir_block_new(ir_function* owner, const char *name)
376 self = (ir_block*)mem_a(sizeof(*self));
380 memset(self, 0, sizeof(*self));
383 if (!ir_block_set_label(self, name)) {
388 self->context.file = "<@no context>";
389 self->context.line = 0;
391 MEM_VECTOR_INIT(self, instr);
392 MEM_VECTOR_INIT(self, entries);
393 MEM_VECTOR_INIT(self, exits);
396 self->is_return = false;
398 MEM_VECTOR_INIT(self, living);
400 self->generated = false;
404 MEM_VEC_FUNCTIONS(ir_block, ir_instr*, instr)
405 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, entries)
406 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, exits)
407 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_value*, living)
409 void ir_block_delete(ir_block* self)
413 for (i = 0; i != self->instr_count; ++i)
414 ir_instr_delete(self->instr[i]);
415 MEM_VECTOR_CLEAR(self, instr);
416 MEM_VECTOR_CLEAR(self, entries);
417 MEM_VECTOR_CLEAR(self, exits);
418 MEM_VECTOR_CLEAR(self, living);
422 bool ir_block_set_label(ir_block *self, const char *name)
425 mem_d((void*)self->label);
426 self->label = util_strdup(name);
427 return !!self->label;
430 /***********************************************************************
434 ir_instr* ir_instr_new(ir_block* owner, int op)
437 self = (ir_instr*)mem_a(sizeof(*self));
442 self->context.file = "<@no context>";
443 self->context.line = 0;
445 self->_ops[0] = NULL;
446 self->_ops[1] = NULL;
447 self->_ops[2] = NULL;
448 self->bops[0] = NULL;
449 self->bops[1] = NULL;
450 MEM_VECTOR_INIT(self, phi);
451 MEM_VECTOR_INIT(self, params);
456 MEM_VEC_FUNCTIONS(ir_instr, ir_phi_entry_t, phi)
457 MEM_VEC_FUNCTIONS(ir_instr, ir_value*, params)
459 void ir_instr_delete(ir_instr *self)
462 /* The following calls can only delete from
463 * vectors, we still want to delete this instruction
464 * so ignore the return value. Since with the warn_unused_result attribute
465 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
466 * I have to improvise here and use if(foo());
468 for (i = 0; i < self->phi_count; ++i) {
470 if (ir_value_writes_find(self->phi[i].value, self, &idx))
471 if (ir_value_writes_remove(self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
472 if (ir_value_reads_find(self->phi[i].value, self, &idx))
473 if (ir_value_reads_remove (self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
475 MEM_VECTOR_CLEAR(self, phi);
476 for (i = 0; i < self->params_count; ++i) {
478 if (ir_value_writes_find(self->params[i], self, &idx))
479 if (ir_value_writes_remove(self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
480 if (ir_value_reads_find(self->params[i], self, &idx))
481 if (ir_value_reads_remove (self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
483 MEM_VECTOR_CLEAR(self, params);
484 if (ir_instr_op(self, 0, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
485 if (ir_instr_op(self, 1, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
486 if (ir_instr_op(self, 2, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
490 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
492 if (self->_ops[op]) {
494 if (writing && ir_value_writes_find(self->_ops[op], self, &idx))
496 if (!ir_value_writes_remove(self->_ops[op], idx))
499 else if (ir_value_reads_find(self->_ops[op], self, &idx))
501 if (!ir_value_reads_remove(self->_ops[op], idx))
507 if (!ir_value_writes_add(v, self))
510 if (!ir_value_reads_add(v, self))
518 /***********************************************************************
522 void ir_value_code_setaddr(ir_value *self, int32_t gaddr)
524 self->code.globaladdr = gaddr;
525 if (self->members[0]) self->members[0]->code.globaladdr = gaddr;
526 if (self->members[1]) self->members[1]->code.globaladdr = gaddr;
527 if (self->members[2]) self->members[2]->code.globaladdr = gaddr;
530 int32_t ir_value_code_addr(const ir_value *self)
532 return self->code.globaladdr + self->code.addroffset;
535 ir_value* ir_value_var(const char *name, int storetype, int vtype)
538 self = (ir_value*)mem_a(sizeof(*self));
540 self->fieldtype = TYPE_VOID;
541 self->outtype = TYPE_VOID;
542 self->store = storetype;
543 MEM_VECTOR_INIT(self, reads);
544 MEM_VECTOR_INIT(self, writes);
545 self->isconst = false;
546 self->context.file = "<@no context>";
547 self->context.line = 0;
549 ir_value_set_name(self, name);
551 memset(&self->constval, 0, sizeof(self->constval));
552 memset(&self->code, 0, sizeof(self->code));
554 MEM_VECTOR_INIT(self, life);
558 ir_value* ir_value_vector_member(ir_value *self, unsigned int member)
564 if (self->members[member])
565 return self->members[member];
567 m = ir_value_var(self->name, self->store, TYPE_FLOAT);
570 m->context = self->context;
572 self->members[member] = m;
573 m->code.addroffset = member;
578 MEM_VEC_FUNCTIONS(ir_value, ir_life_entry_t, life)
579 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, reads)
580 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, writes)
582 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
584 ir_value *v = ir_value_var(name, storetype, vtype);
587 if (!ir_function_collect_value(owner, v))
595 void ir_value_delete(ir_value* self)
599 mem_d((void*)self->name);
602 if (self->vtype == TYPE_STRING)
603 mem_d((void*)self->constval.vstring);
605 for (i = 0; i < 3; ++i) {
606 if (self->members[i])
607 ir_value_delete(self->members[i]);
609 MEM_VECTOR_CLEAR(self, reads);
610 MEM_VECTOR_CLEAR(self, writes);
611 MEM_VECTOR_CLEAR(self, life);
615 void ir_value_set_name(ir_value *self, const char *name)
618 mem_d((void*)self->name);
619 self->name = util_strdup(name);
622 bool ir_value_set_float(ir_value *self, float f)
624 if (self->vtype != TYPE_FLOAT)
626 self->constval.vfloat = f;
627 self->isconst = true;
631 bool ir_value_set_func(ir_value *self, int f)
633 if (self->vtype != TYPE_FUNCTION)
635 self->constval.vint = f;
636 self->isconst = true;
640 bool ir_value_set_vector(ir_value *self, vector v)
642 if (self->vtype != TYPE_VECTOR)
644 self->constval.vvec = v;
645 self->isconst = true;
649 bool ir_value_set_string(ir_value *self, const char *str)
651 if (self->vtype != TYPE_STRING)
653 self->constval.vstring = util_strdup(str);
654 self->isconst = true;
659 bool ir_value_set_int(ir_value *self, int i)
661 if (self->vtype != TYPE_INTEGER)
663 self->constval.vint = i;
664 self->isconst = true;
669 bool ir_value_lives(ir_value *self, size_t at)
672 for (i = 0; i < self->life_count; ++i)
674 ir_life_entry_t *life = &self->life[i];
675 if (life->start <= at && at <= life->end)
677 if (life->start > at) /* since it's ordered */
683 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
686 if (!ir_value_life_add(self, e)) /* naive... */
688 for (k = self->life_count-1; k > idx; --k)
689 self->life[k] = self->life[k-1];
694 bool ir_value_life_merge(ir_value *self, size_t s)
697 ir_life_entry_t *life = NULL;
698 ir_life_entry_t *before = NULL;
699 ir_life_entry_t new_entry;
701 /* Find the first range >= s */
702 for (i = 0; i < self->life_count; ++i)
705 life = &self->life[i];
709 /* nothing found? append */
710 if (i == self->life_count) {
712 if (life && life->end+1 == s)
714 /* previous life range can be merged in */
718 if (life && life->end >= s)
721 if (!ir_value_life_add(self, e))
722 return false; /* failing */
728 if (before->end + 1 == s &&
729 life->start - 1 == s)
732 before->end = life->end;
733 if (!ir_value_life_remove(self, i))
734 return false; /* failing */
737 if (before->end + 1 == s)
743 /* already contained */
744 if (before->end >= s)
748 if (life->start - 1 == s)
753 /* insert a new entry */
754 new_entry.start = new_entry.end = s;
755 return ir_value_life_insert(self, i, new_entry);
758 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
762 if (!other->life_count)
765 if (!self->life_count) {
766 for (i = 0; i < other->life_count; ++i) {
767 if (!ir_value_life_add(self, other->life[i]))
774 for (i = 0; i < other->life_count; ++i)
776 const ir_life_entry_t *life = &other->life[i];
779 ir_life_entry_t *entry = &self->life[myi];
781 if (life->end+1 < entry->start)
783 /* adding an interval before entry */
784 if (!ir_value_life_insert(self, myi, *life))
790 if (life->start < entry->start &&
791 life->end >= entry->start)
793 /* starts earlier and overlaps */
794 entry->start = life->start;
797 if (life->end > entry->end &&
798 life->start-1 <= entry->end)
800 /* ends later and overlaps */
801 entry->end = life->end;
804 /* see if our change combines it with the next ranges */
805 while (myi+1 < self->life_count &&
806 entry->end+1 >= self->life[1+myi].start)
808 /* overlaps with (myi+1) */
809 if (entry->end < self->life[1+myi].end)
810 entry->end = self->life[1+myi].end;
811 if (!ir_value_life_remove(self, myi+1))
813 entry = &self->life[myi];
816 /* see if we're after the entry */
817 if (life->start > entry->end)
820 /* append if we're at the end */
821 if (myi >= self->life_count) {
822 if (!ir_value_life_add(self, *life))
826 /* otherweise check the next range */
835 bool ir_values_overlap(const ir_value *a, const ir_value *b)
837 /* For any life entry in A see if it overlaps with
838 * any life entry in B.
839 * Note that the life entries are orderes, so we can make a
840 * more efficient algorithm there than naively translating the
844 ir_life_entry_t *la, *lb, *enda, *endb;
846 /* first of all, if either has no life range, they cannot clash */
847 if (!a->life_count || !b->life_count)
852 enda = la + a->life_count;
853 endb = lb + b->life_count;
856 /* check if the entries overlap, for that,
857 * both must start before the other one ends.
859 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
860 if (la->start <= lb->end &&
861 lb->start <= la->end)
863 if (la->start < lb->end &&
870 /* entries are ordered
871 * one entry is earlier than the other
872 * that earlier entry will be moved forward
874 if (la->start < lb->start)
876 /* order: A B, move A forward
877 * check if we hit the end with A
882 else if (lb->start < la->start)
884 /* order: B A, move B forward
885 * check if we hit the end with B
894 /***********************************************************************
898 bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
900 if (target->store == store_value) {
901 fprintf(stderr, "cannot store to an SSA value\n");
902 fprintf(stderr, "trying to store: %s <- %s\n", target->name, what->name);
905 ir_instr *in = ir_instr_new(self, op);
908 if (!ir_instr_op(in, 0, target, true) ||
909 !ir_instr_op(in, 1, what, false) ||
910 !ir_block_instr_add(self, in) )
918 bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
922 if (target->vtype == TYPE_VARIANT)
925 vtype = target->vtype;
928 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
929 op = INSTR_CONV_ITOF;
930 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
931 op = INSTR_CONV_FTOI;
933 op = type_store_instr[vtype];
935 return ir_block_create_store_op(self, op, target, what);
938 bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
943 if (target->vtype != TYPE_POINTER)
946 /* storing using pointer - target is a pointer, type must be
947 * inferred from source
951 op = type_storep_instr[vtype];
953 return ir_block_create_store_op(self, op, target, what);
956 bool ir_block_create_return(ir_block *self, ir_value *v)
960 fprintf(stderr, "block already ended (%s)\n", self->label);
964 self->is_return = true;
965 in = ir_instr_new(self, INSTR_RETURN);
969 if (!ir_instr_op(in, 0, v, false) ||
970 !ir_block_instr_add(self, in) )
977 bool ir_block_create_if(ir_block *self, ir_value *v,
978 ir_block *ontrue, ir_block *onfalse)
982 fprintf(stderr, "block already ended (%s)\n", self->label);
986 /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
987 in = ir_instr_new(self, VINSTR_COND);
991 if (!ir_instr_op(in, 0, v, false)) {
996 in->bops[0] = ontrue;
997 in->bops[1] = onfalse;
999 if (!ir_block_instr_add(self, in))
1002 if (!ir_block_exits_add(self, ontrue) ||
1003 !ir_block_exits_add(self, onfalse) ||
1004 !ir_block_entries_add(ontrue, self) ||
1005 !ir_block_entries_add(onfalse, self) )
1012 bool ir_block_create_jump(ir_block *self, ir_block *to)
1016 fprintf(stderr, "block already ended (%s)\n", self->label);
1020 in = ir_instr_new(self, VINSTR_JUMP);
1025 if (!ir_block_instr_add(self, in))
1028 if (!ir_block_exits_add(self, to) ||
1029 !ir_block_entries_add(to, self) )
1036 bool ir_block_create_goto(ir_block *self, ir_block *to)
1040 fprintf(stderr, "block already ended (%s)\n", self->label);
1044 in = ir_instr_new(self, INSTR_GOTO);
1049 if (!ir_block_instr_add(self, in))
1052 if (!ir_block_exits_add(self, to) ||
1053 !ir_block_entries_add(to, self) )
1060 ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
1064 in = ir_instr_new(self, VINSTR_PHI);
1067 out = ir_value_out(self->owner, label, store_value, ot);
1069 ir_instr_delete(in);
1072 if (!ir_instr_op(in, 0, out, true)) {
1073 ir_instr_delete(in);
1074 ir_value_delete(out);
1077 if (!ir_block_instr_add(self, in)) {
1078 ir_instr_delete(in);
1079 ir_value_delete(out);
1085 ir_value* ir_phi_value(ir_instr *self)
1087 return self->_ops[0];
1090 bool ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1094 if (!ir_block_entries_find(self->owner, b, NULL)) {
1095 /* Must not be possible to cause this, otherwise the AST
1096 * is doing something wrong.
1098 fprintf(stderr, "Invalid entry block for PHI\n");
1104 if (!ir_value_reads_add(v, self))
1106 return ir_instr_phi_add(self, pe);
1109 /* call related code */
1110 ir_instr* ir_block_create_call(ir_block *self, const char *label, ir_value *func)
1114 in = ir_instr_new(self, INSTR_CALL0);
1117 out = ir_value_out(self->owner, label, store_return, func->outtype);
1119 ir_instr_delete(in);
1122 if (!ir_instr_op(in, 0, out, true) ||
1123 !ir_instr_op(in, 1, func, false) ||
1124 !ir_block_instr_add(self, in))
1126 ir_instr_delete(in);
1127 ir_value_delete(out);
1133 ir_value* ir_call_value(ir_instr *self)
1135 return self->_ops[0];
1138 bool ir_call_param(ir_instr* self, ir_value *v)
1140 if (!ir_instr_params_add(self, v))
1142 if (!ir_value_reads_add(v, self)) {
1143 if (!ir_instr_params_remove(self, self->params_count-1))
1144 GMQCC_SUPPRESS_EMPTY_BODY;
1150 /* binary op related code */
1152 ir_value* ir_block_create_binop(ir_block *self,
1153 const char *label, int opcode,
1154 ir_value *left, ir_value *right)
1176 case INSTR_SUB_S: /* -- offset of string as float */
1181 case INSTR_BITOR_IF:
1182 case INSTR_BITOR_FI:
1183 case INSTR_BITAND_FI:
1184 case INSTR_BITAND_IF:
1199 case INSTR_BITAND_I:
1202 case INSTR_RSHIFT_I:
1203 case INSTR_LSHIFT_I:
1225 /* boolean operations result in floats */
1226 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1228 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1231 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1236 if (ot == TYPE_VOID) {
1237 /* The AST or parser were supposed to check this! */
1241 return ir_block_create_general_instr(self, label, opcode, left, right, ot);
1244 ir_value* ir_block_create_unary(ir_block *self,
1245 const char *label, int opcode,
1248 int ot = TYPE_FLOAT;
1260 /* QC doesn't have other unary operations. We expect extensions to fill
1261 * the above list, otherwise we assume out-type = in-type, eg for an
1265 ot = operand->vtype;
1268 if (ot == TYPE_VOID) {
1269 /* The AST or parser were supposed to check this! */
1273 /* let's use the general instruction creator and pass NULL for OPB */
1274 return ir_block_create_general_instr(self, label, opcode, operand, NULL, ot);
1277 ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
1278 int op, ir_value *a, ir_value *b, int outype)
1283 out = ir_value_out(self->owner, label, store_value, outype);
1287 instr = ir_instr_new(self, op);
1289 ir_value_delete(out);
1293 if (!ir_instr_op(instr, 0, out, true) ||
1294 !ir_instr_op(instr, 1, a, false) ||
1295 !ir_instr_op(instr, 2, b, false) )
1300 if (!ir_block_instr_add(self, instr))
1305 ir_instr_delete(instr);
1306 ir_value_delete(out);
1310 ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
1314 /* Support for various pointer types todo if so desired */
1315 if (ent->vtype != TYPE_ENTITY)
1318 if (field->vtype != TYPE_FIELD)
1321 v = ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1322 v->fieldtype = field->fieldtype;
1326 ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
1329 if (ent->vtype != TYPE_ENTITY)
1332 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1333 if (field->vtype != TYPE_FIELD)
1338 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1339 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1340 case TYPE_STRING: op = INSTR_LOAD_S; break;
1341 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1342 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1344 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1345 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1351 return ir_block_create_general_instr(self, label, op, ent, field, outype);
1354 ir_value* ir_block_create_add(ir_block *self,
1356 ir_value *left, ir_value *right)
1359 int l = left->vtype;
1360 int r = right->vtype;
1379 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1381 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1387 return ir_block_create_binop(self, label, op, left, right);
1390 ir_value* ir_block_create_sub(ir_block *self,
1392 ir_value *left, ir_value *right)
1395 int l = left->vtype;
1396 int r = right->vtype;
1416 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1418 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1424 return ir_block_create_binop(self, label, op, left, right);
1427 ir_value* ir_block_create_mul(ir_block *self,
1429 ir_value *left, ir_value *right)
1432 int l = left->vtype;
1433 int r = right->vtype;
1452 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1454 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1457 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1459 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1461 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1463 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1469 return ir_block_create_binop(self, label, op, left, right);
1472 ir_value* ir_block_create_div(ir_block *self,
1474 ir_value *left, ir_value *right)
1477 int l = left->vtype;
1478 int r = right->vtype;
1495 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1497 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1499 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1505 return ir_block_create_binop(self, label, op, left, right);
1508 /* PHI resolving breaks the SSA, and must thus be the last
1509 * step before life-range calculation.
1512 static bool ir_block_naive_phi(ir_block *self);
1513 bool ir_function_naive_phi(ir_function *self)
1517 for (i = 0; i < self->blocks_count; ++i)
1519 if (!ir_block_naive_phi(self->blocks[i]))
1525 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1530 /* create a store */
1531 if (!ir_block_create_store(block, old, what))
1534 /* we now move it up */
1535 instr = block->instr[block->instr_count-1];
1536 for (i = block->instr_count; i > iid; --i)
1537 block->instr[i] = block->instr[i-1];
1538 block->instr[i] = instr;
1543 static bool ir_block_naive_phi(ir_block *self)
1546 /* FIXME: optionally, create_phi can add the phis
1547 * to a list so we don't need to loop through blocks
1548 * - anyway: "don't optimize YET"
1550 for (i = 0; i < self->instr_count; ++i)
1552 ir_instr *instr = self->instr[i];
1553 if (instr->opcode != VINSTR_PHI)
1556 if (!ir_block_instr_remove(self, i))
1558 --i; /* NOTE: i+1 below */
1560 for (p = 0; p < instr->phi_count; ++p)
1562 ir_value *v = instr->phi[p].value;
1563 for (w = 0; w < v->writes_count; ++w) {
1566 if (!v->writes[w]->_ops[0])
1569 /* When the write was to a global, we have to emit a mov */
1570 old = v->writes[w]->_ops[0];
1572 /* The original instruction now writes to the PHI target local */
1573 if (v->writes[w]->_ops[0] == v)
1574 v->writes[w]->_ops[0] = instr->_ops[0];
1576 if (old->store != store_value && old->store != store_local && old->store != store_param)
1578 /* If it originally wrote to a global we need to store the value
1581 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1583 if (i+1 < self->instr_count)
1584 instr = self->instr[i+1];
1587 /* In case I forget and access instr later, it'll be NULL
1588 * when it's a problem, to make sure we crash, rather than accessing
1594 /* If it didn't, we can replace all reads by the phi target now. */
1596 for (r = 0; r < old->reads_count; ++r)
1599 ir_instr *ri = old->reads[r];
1600 for (op = 0; op < ri->phi_count; ++op) {
1601 if (ri->phi[op].value == old)
1602 ri->phi[op].value = v;
1604 for (op = 0; op < 3; ++op) {
1605 if (ri->_ops[op] == old)
1612 ir_instr_delete(instr);
1617 /***********************************************************************
1618 *IR Temp allocation code
1619 * Propagating value life ranges by walking through the function backwards
1620 * until no more changes are made.
1621 * In theory this should happen once more than once for every nested loop
1623 * Though this implementation might run an additional time for if nests.
1632 MEM_VEC_FUNCTIONS_ALL(new_reads_t, ir_value*, v)
1634 /* Enumerate instructions used by value's life-ranges
1636 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1640 for (i = 0; i < self->instr_count; ++i)
1642 self->instr[i]->eid = eid++;
1647 /* Enumerate blocks and instructions.
1648 * The block-enumeration is unordered!
1649 * We do not really use the block enumreation, however
1650 * the instruction enumeration is important for life-ranges.
1652 void ir_function_enumerate(ir_function *self)
1655 size_t instruction_id = 0;
1656 for (i = 0; i < self->blocks_count; ++i)
1658 self->blocks[i]->eid = i;
1659 self->blocks[i]->run_id = 0;
1660 ir_block_enumerate(self->blocks[i], &instruction_id);
1664 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
1665 bool ir_function_calculate_liferanges(ir_function *self)
1673 for (i = 0; i != self->blocks_count; ++i)
1675 if (self->blocks[i]->is_return)
1677 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
1685 /* Local-value allocator
1686 * After finishing creating the liferange of all values used in a function
1687 * we can allocate their global-positions.
1688 * This is the counterpart to register-allocation in register machines.
1691 MEM_VECTOR_MAKE(ir_value*, locals);
1692 MEM_VECTOR_MAKE(size_t, sizes);
1693 MEM_VECTOR_MAKE(size_t, positions);
1694 } function_allocator;
1695 MEM_VEC_FUNCTIONS(function_allocator, ir_value*, locals)
1696 MEM_VEC_FUNCTIONS(function_allocator, size_t, sizes)
1697 MEM_VEC_FUNCTIONS(function_allocator, size_t, positions)
1699 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
1702 size_t vsize = type_sizeof[var->vtype];
1704 slot = ir_value_var("reg", store_global, var->vtype);
1708 if (!ir_value_life_merge_into(slot, var))
1711 if (!function_allocator_locals_add(alloc, slot))
1714 if (!function_allocator_sizes_add(alloc, vsize))
1720 ir_value_delete(slot);
1724 bool ir_function_allocate_locals(ir_function *self)
1733 function_allocator alloc;
1735 if (!self->locals_count)
1738 MEM_VECTOR_INIT(&alloc, locals);
1739 MEM_VECTOR_INIT(&alloc, sizes);
1740 MEM_VECTOR_INIT(&alloc, positions);
1742 for (i = 0; i < self->locals_count; ++i)
1744 if (!function_allocator_alloc(&alloc, self->locals[i]))
1748 /* Allocate a slot for any value that still exists */
1749 for (i = 0; i < self->values_count; ++i)
1751 v = self->values[i];
1756 for (a = 0; a < alloc.locals_count; ++a)
1758 slot = alloc.locals[a];
1760 if (ir_values_overlap(v, slot))
1763 if (!ir_value_life_merge_into(slot, v))
1766 /* adjust size for this slot */
1767 if (alloc.sizes[a] < type_sizeof[v->vtype])
1768 alloc.sizes[a] = type_sizeof[v->vtype];
1770 self->values[i]->code.local = a;
1773 if (a >= alloc.locals_count) {
1774 self->values[i]->code.local = alloc.locals_count;
1775 if (!function_allocator_alloc(&alloc, v))
1780 /* Adjust slot positions based on sizes */
1781 if (!function_allocator_positions_add(&alloc, 0))
1784 if (alloc.sizes_count)
1785 pos = alloc.positions[0] + alloc.sizes[0];
1788 for (i = 1; i < alloc.sizes_count; ++i)
1790 pos = alloc.positions[i-1] + alloc.sizes[i-1];
1791 if (!function_allocator_positions_add(&alloc, pos))
1795 self->allocated_locals = pos + alloc.sizes[alloc.sizes_count-1];
1797 /* Take over the actual slot positions */
1798 for (i = 0; i < self->values_count; ++i)
1799 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
1806 for (i = 0; i < alloc.locals_count; ++i)
1807 ir_value_delete(alloc.locals[i]);
1808 MEM_VECTOR_CLEAR(&alloc, locals);
1809 MEM_VECTOR_CLEAR(&alloc, sizes);
1810 MEM_VECTOR_CLEAR(&alloc, positions);
1814 /* Get information about which operand
1815 * is read from, or written to.
1817 static void ir_op_read_write(int op, size_t *read, size_t *write)
1844 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
1847 bool changed = false;
1849 for (i = 0; i != self->living_count; ++i)
1851 tempbool = ir_value_life_merge(self->living[i], eid);
1854 fprintf(stderr, "block_living_add_instr() value instruction added %s: %i\n", self->living[i]->_name, (int)eid);
1856 changed = changed || tempbool;
1861 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
1864 /* values which have been read in a previous iteration are now
1865 * in the "living" array even if the previous block doesn't use them.
1866 * So we have to remove whatever does not exist in the previous block.
1867 * They will be re-added on-read, but the liferange merge won't cause
1870 for (i = 0; i < self->living_count; ++i)
1872 if (!ir_block_living_find(prev, self->living[i], NULL)) {
1873 if (!ir_block_living_remove(self, i))
1879 /* Whatever the previous block still has in its living set
1880 * must now be added to ours as well.
1882 for (i = 0; i < prev->living_count; ++i)
1884 if (ir_block_living_find(self, prev->living[i], NULL))
1886 if (!ir_block_living_add(self, prev->living[i]))
1889 printf("%s got from prev: %s\n", self->label, prev->living[i]->_name);
1895 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
1901 /* bitmasks which operands are read from or written to */
1903 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1905 new_reads_t new_reads;
1907 char dbg_ind[16] = { '#', '0' };
1910 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1911 MEM_VECTOR_INIT(&new_reads, v);
1916 if (!ir_block_life_prop_previous(self, prev, changed))
1920 i = self->instr_count;
1923 instr = self->instr[i];
1925 /* PHI operands are always read operands */
1926 for (p = 0; p < instr->phi_count; ++p)
1928 value = instr->phi[p].value;
1929 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1930 if (!ir_block_living_find(self, value, NULL) &&
1931 !ir_block_living_add(self, value))
1936 if (!new_reads_t_v_find(&new_reads, value, NULL))
1938 if (!new_reads_t_v_add(&new_reads, value))
1944 /* See which operands are read and write operands */
1945 ir_op_read_write(instr->opcode, &read, &write);
1947 /* Go through the 3 main operands */
1948 for (o = 0; o < 3; ++o)
1950 if (!instr->_ops[o]) /* no such operand */
1953 value = instr->_ops[o];
1955 /* We only care about locals */
1956 /* we also calculate parameter liferanges so that locals
1957 * can take up parameter slots */
1958 if (value->store != store_value &&
1959 value->store != store_local &&
1960 value->store != store_param)
1966 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1967 if (!ir_block_living_find(self, value, NULL) &&
1968 !ir_block_living_add(self, value))
1973 /* fprintf(stderr, "read: %s\n", value->_name); */
1974 if (!new_reads_t_v_find(&new_reads, value, NULL))
1976 if (!new_reads_t_v_add(&new_reads, value))
1982 /* write operands */
1983 /* When we write to a local, we consider it "dead" for the
1984 * remaining upper part of the function, since in SSA a value
1985 * can only be written once (== created)
1990 bool in_living = ir_block_living_find(self, value, &idx);
1991 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1993 bool in_reads = new_reads_t_v_find(&new_reads, value, &readidx);
1994 if (!in_living && !in_reads)
1999 /* If the value isn't alive it hasn't been read before... */
2000 /* TODO: See if the warning can be emitted during parsing or AST processing
2001 * otherwise have warning printed here.
2002 * IF printing a warning here: include filecontext_t,
2003 * and make sure it's only printed once
2004 * since this function is run multiple times.
2006 /* For now: debug info: */
2007 fprintf(stderr, "Value only written %s\n", value->name);
2008 tempbool = ir_value_life_merge(value, instr->eid);
2009 *changed = *changed || tempbool;
2011 ir_instr_dump(instr, dbg_ind, printf);
2015 /* since 'living' won't contain it
2016 * anymore, merge the value, since
2019 tempbool = ir_value_life_merge(value, instr->eid);
2022 fprintf(stderr, "value added id %s %i\n", value->name, (int)instr->eid);
2024 *changed = *changed || tempbool;
2026 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
2027 if (!ir_block_living_remove(self, idx))
2032 if (!new_reads_t_v_remove(&new_reads, readidx))
2040 tempbool = ir_block_living_add_instr(self, instr->eid);
2041 /*fprintf(stderr, "living added values\n");*/
2042 *changed = *changed || tempbool;
2044 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
2046 for (rd = 0; rd < new_reads.v_count; ++rd)
2048 if (!ir_block_living_find(self, new_reads.v[rd], NULL)) {
2049 if (!ir_block_living_add(self, new_reads.v[rd]))
2052 if (!i && !self->entries_count) {
2054 *changed = *changed || ir_value_life_merge(new_reads.v[rd], instr->eid);
2057 MEM_VECTOR_CLEAR(&new_reads, v);
2061 if (self->run_id == self->owner->run_id)
2064 self->run_id = self->owner->run_id;
2066 for (i = 0; i < self->entries_count; ++i)
2068 ir_block *entry = self->entries[i];
2069 ir_block_life_propagate(entry, self, changed);
2074 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
2075 MEM_VECTOR_CLEAR(&new_reads, v);
2080 /***********************************************************************
2083 * Since the IR has the convention of putting 'write' operands
2084 * at the beginning, we have to rotate the operands of instructions
2085 * properly in order to generate valid QCVM code.
2087 * Having destinations at a fixed position is more convenient. In QC
2088 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2089 * read from from OPA, and store to OPB rather than OPC. Which is
2090 * partially the reason why the implementation of these instructions
2091 * in darkplaces has been delayed for so long.
2093 * Breaking conventions is annoying...
2095 static bool ir_builder_gen_global(ir_builder *self, ir_value *global);
2097 static bool gen_global_field(ir_value *global)
2099 if (global->isconst)
2101 ir_value *fld = global->constval.vpointer;
2103 printf("Invalid field constant with no field: %s\n", global->name);
2107 /* Now, in this case, a relocation would be impossible to code
2108 * since it looks like this:
2109 * .vector v = origin; <- parse error, wtf is 'origin'?
2112 * But we will need a general relocation support later anyway
2113 * for functions... might as well support that here.
2115 if (!fld->code.globaladdr) {
2116 printf("FIXME: Relocation support\n");
2120 /* copy the field's value */
2121 ir_value_code_setaddr(global, code_globals_add(code_globals_data[fld->code.globaladdr]));
2125 ir_value_code_setaddr(global, code_globals_add(0));
2127 if (global->code.globaladdr < 0)
2132 static bool gen_global_pointer(ir_value *global)
2134 if (global->isconst)
2136 ir_value *target = global->constval.vpointer;
2138 printf("Invalid pointer constant: %s\n", global->name);
2139 /* NULL pointers are pointing to the NULL constant, which also
2140 * sits at address 0, but still has an ir_value for itself.
2145 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2146 * void() foo; <- proto
2147 * void() *fooptr = &foo;
2148 * void() foo = { code }
2150 if (!target->code.globaladdr) {
2151 /* FIXME: Check for the constant nullptr ir_value!
2152 * because then code.globaladdr being 0 is valid.
2154 printf("FIXME: Relocation support\n");
2158 ir_value_code_setaddr(global, code_globals_add(target->code.globaladdr));
2162 ir_value_code_setaddr(global, code_globals_add(0));
2164 if (global->code.globaladdr < 0)
2169 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2171 prog_section_statement stmt;
2180 block->generated = true;
2181 block->code_start = code_statements_elements;
2182 for (i = 0; i < block->instr_count; ++i)
2184 instr = block->instr[i];
2186 if (instr->opcode == VINSTR_PHI) {
2187 printf("cannot generate virtual instruction (phi)\n");
2191 if (instr->opcode == VINSTR_JUMP) {
2192 target = instr->bops[0];
2193 /* for uncoditional jumps, if the target hasn't been generated
2194 * yet, we generate them right here.
2196 if (!target->generated) {
2201 /* otherwise we generate a jump instruction */
2202 stmt.opcode = INSTR_GOTO;
2203 stmt.o1.s1 = (target->code_start) - code_statements_elements;
2206 if (code_statements_add(stmt) < 0)
2209 /* no further instructions can be in this block */
2213 if (instr->opcode == VINSTR_COND) {
2214 ontrue = instr->bops[0];
2215 onfalse = instr->bops[1];
2216 /* TODO: have the AST signal which block should
2217 * come first: eg. optimize IFs without ELSE...
2220 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2224 if (ontrue->generated) {
2225 stmt.opcode = INSTR_IF;
2226 stmt.o2.s1 = (ontrue->code_start-1) - code_statements_elements;
2227 if (code_statements_add(stmt) < 0)
2230 if (onfalse->generated) {
2231 stmt.opcode = INSTR_IFNOT;
2232 stmt.o2.s1 = (onfalse->code_start-1) - code_statements_elements;
2233 if (code_statements_add(stmt) < 0)
2236 if (!ontrue->generated) {
2237 if (onfalse->generated) {
2242 if (!onfalse->generated) {
2243 if (ontrue->generated) {
2248 /* neither ontrue nor onfalse exist */
2249 stmt.opcode = INSTR_IFNOT;
2250 stidx = code_statements_elements;
2251 if (code_statements_add(stmt) < 0)
2253 /* on false we jump, so add ontrue-path */
2254 if (!gen_blocks_recursive(func, ontrue))
2256 /* fixup the jump address */
2257 code_statements_data[stidx].o2.s1 = code_statements_elements - stidx;
2258 /* generate onfalse path */
2259 if (onfalse->generated) {
2260 /* fixup the jump address */
2261 code_statements_data[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2262 /* may have been generated in the previous recursive call */
2263 stmt.opcode = INSTR_GOTO;
2264 stmt.o1.s1 = (onfalse->code_start) - code_statements_elements;
2267 return (code_statements_add(stmt) >= 0);
2269 /* if not, generate now */
2274 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2275 /* Trivial call translation:
2276 * copy all params to OFS_PARM*
2277 * if the output's storetype is not store_return,
2278 * add append a STORE instruction!
2280 * NOTES on how to do it better without much trouble:
2281 * -) The liferanges!
2282 * Simply check the liferange of all parameters for
2283 * other CALLs. For each param with no CALL in its
2284 * liferange, we can store it in an OFS_PARM at
2285 * generation already. This would even include later
2286 * reuse.... probably... :)
2291 for (p = 0; p < instr->params_count; ++p)
2293 ir_value *param = instr->params[p];
2295 stmt.opcode = INSTR_STORE_F;
2298 stmt.opcode = type_store_instr[param->vtype];
2299 stmt.o1.u1 = ir_value_code_addr(param);
2300 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2301 if (code_statements_add(stmt) < 0)
2304 stmt.opcode = INSTR_CALL0 + instr->params_count;
2305 if (stmt.opcode > INSTR_CALL8)
2306 stmt.opcode = INSTR_CALL8;
2307 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2310 if (code_statements_add(stmt) < 0)
2313 retvalue = instr->_ops[0];
2314 if (retvalue && retvalue->store != store_return && retvalue->life_count)
2316 /* not to be kept in OFS_RETURN */
2317 stmt.opcode = type_store_instr[retvalue->vtype];
2318 stmt.o1.u1 = OFS_RETURN;
2319 stmt.o2.u1 = ir_value_code_addr(retvalue);
2321 if (code_statements_add(stmt) < 0)
2327 if (instr->opcode == INSTR_STATE) {
2328 printf("TODO: state instruction\n");
2332 stmt.opcode = instr->opcode;
2337 /* This is the general order of operands */
2339 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
2342 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2345 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
2347 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2349 stmt.o1.u1 = stmt.o3.u1;
2352 else if (stmt.opcode >= INSTR_STORE_F &&
2353 stmt.opcode <= INSTR_STORE_FNC)
2355 /* 2-operand instructions with A -> B */
2356 stmt.o2.u1 = stmt.o3.u1;
2360 if (code_statements_add(stmt) < 0)
2366 static bool gen_function_code(ir_function *self)
2369 prog_section_statement stmt;
2371 /* Starting from entry point, we generate blocks "as they come"
2372 * for now. Dead blocks will not be translated obviously.
2374 if (!self->blocks_count) {
2375 printf("Function '%s' declared without body.\n", self->name);
2379 block = self->blocks[0];
2380 if (block->generated)
2383 if (!gen_blocks_recursive(self, block)) {
2384 printf("failed to generate blocks for '%s'\n", self->name);
2388 /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
2389 stmt.opcode = AINSTR_END;
2393 if (code_statements_add(stmt) < 0)
2398 static bool gen_global_function(ir_builder *ir, ir_value *global)
2400 prog_section_function fun;
2404 size_t local_var_end;
2406 if (!global->isconst || (!global->constval.vfunc))
2408 printf("Invalid state of function-global: not constant: %s\n", global->name);
2412 irfun = global->constval.vfunc;
2414 fun.name = global->code.name;
2415 fun.file = code_cachedstring(global->context.file);
2416 fun.profile = 0; /* always 0 */
2417 fun.nargs = irfun->params_count;
2419 for (i = 0;i < 8; ++i) {
2423 fun.argsize[i] = type_sizeof[irfun->params[i]];
2426 fun.firstlocal = code_globals_elements;
2427 fun.locals = irfun->allocated_locals + irfun->locals_count;
2430 for (i = 0; i < irfun->locals_count; ++i) {
2431 if (!ir_builder_gen_global(ir, irfun->locals[i])) {
2432 printf("Failed to generate global %s\n", irfun->locals[i]->name);
2436 if (irfun->locals_count) {
2437 ir_value *last = irfun->locals[irfun->locals_count-1];
2438 local_var_end = last->code.globaladdr;
2439 local_var_end += type_sizeof[last->vtype];
2441 for (i = 0; i < irfun->values_count; ++i)
2443 /* generate code.globaladdr for ssa values */
2444 ir_value *v = irfun->values[i];
2445 ir_value_code_setaddr(v, local_var_end + v->code.local);
2447 for (i = 0; i < irfun->locals_count; ++i) {
2448 /* fill the locals with zeros */
2449 code_globals_add(0);
2453 fun.entry = irfun->builtin;
2455 fun.entry = code_statements_elements;
2456 if (!gen_function_code(irfun)) {
2457 printf("Failed to generate code for function %s\n", irfun->name);
2462 return (code_functions_add(fun) >= 0);
2465 static bool ir_builder_gen_global(ir_builder *self, ir_value *global)
2469 prog_section_def def;
2471 def.type = global->vtype;
2472 def.offset = code_globals_elements;
2473 def.name = global->code.name = code_genstring(global->name);
2475 switch (global->vtype)
2478 if (code_defs_add(def) < 0)
2480 return gen_global_pointer(global);
2482 if (code_defs_add(def) < 0)
2484 return gen_global_field(global);
2489 if (code_defs_add(def) < 0)
2492 if (global->isconst) {
2493 iptr = (int32_t*)&global->constval.vfloat;
2494 ir_value_code_setaddr(global, code_globals_add(*iptr));
2496 ir_value_code_setaddr(global, code_globals_add(0));
2498 return global->code.globaladdr >= 0;
2502 if (code_defs_add(def) < 0)
2504 if (global->isconst)
2505 ir_value_code_setaddr(global, code_globals_add(code_cachedstring(global->constval.vstring)));
2507 ir_value_code_setaddr(global, code_globals_add(0));
2508 return global->code.globaladdr >= 0;
2513 if (code_defs_add(def) < 0)
2516 if (global->isconst) {
2517 iptr = (int32_t*)&global->constval.vvec;
2518 ir_value_code_setaddr(global, code_globals_add(iptr[0]));
2519 if (global->code.globaladdr < 0)
2521 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2523 if (code_globals_add(iptr[d]) < 0)
2527 ir_value_code_setaddr(global, code_globals_add(0));
2528 if (global->code.globaladdr < 0)
2530 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2532 if (code_globals_add(0) < 0)
2536 return global->code.globaladdr >= 0;
2539 if (code_defs_add(def) < 0)
2541 ir_value_code_setaddr(global, code_globals_elements);
2542 code_globals_add(code_functions_elements);
2543 return gen_global_function(self, global);
2545 /* assume biggest type */
2546 ir_value_code_setaddr(global, code_globals_add(0));
2547 for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
2548 code_globals_add(0);
2551 /* refuse to create 'void' type or any other fancy business. */
2552 printf("Invalid type for global variable %s\n", global->name);
2557 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
2559 prog_section_def def;
2560 prog_section_field fld;
2562 def.type = field->vtype;
2563 def.offset = code_globals_elements;
2564 def.name = field->code.name = code_genstring(field->name);
2566 if (code_defs_add(def) < 0)
2569 fld.name = def.name;
2570 fld.offset = code_fields_elements;
2571 fld.type = field->fieldtype;
2573 if (fld.type == TYPE_VOID) {
2574 printf("field is missing a type: %s - don't know its size\n", field->name);
2578 if (code_fields_add(fld) < 0)
2581 if (!code_globals_add(code_alloc_field(type_sizeof[field->fieldtype])))
2584 ir_value_code_setaddr(field, code_globals_add(fld.offset));
2585 return field->code.globaladdr >= 0;
2588 bool ir_builder_generate(ir_builder *self, const char *filename)
2594 for (i = 0; i < self->fields_count; ++i)
2596 if (!ir_builder_gen_field(self, self->fields[i])) {
2601 for (i = 0; i < self->globals_count; ++i)
2603 if (!ir_builder_gen_global(self, self->globals[i])) {
2608 printf("writing '%s'...\n", filename);
2609 return code_write(filename);
2612 /***********************************************************************
2613 *IR DEBUG Dump functions...
2616 #define IND_BUFSZ 1024
2618 const char *qc_opname(int op)
2620 if (op < 0) return "<INVALID>";
2621 if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
2622 return asm_instr[op].m;
2624 case VINSTR_PHI: return "PHI";
2625 case VINSTR_JUMP: return "JUMP";
2626 case VINSTR_COND: return "COND";
2627 default: return "<UNK>";
2631 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
2634 char indent[IND_BUFSZ];
2638 oprintf("module %s\n", b->name);
2639 for (i = 0; i < b->globals_count; ++i)
2642 if (b->globals[i]->isconst)
2643 oprintf("%s = ", b->globals[i]->name);
2644 ir_value_dump(b->globals[i], oprintf);
2647 for (i = 0; i < b->functions_count; ++i)
2648 ir_function_dump(b->functions[i], indent, oprintf);
2649 oprintf("endmodule %s\n", b->name);
2652 void ir_function_dump(ir_function *f, char *ind,
2653 int (*oprintf)(const char*, ...))
2656 if (f->builtin != 0) {
2657 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
2660 oprintf("%sfunction %s\n", ind, f->name);
2661 strncat(ind, "\t", IND_BUFSZ);
2662 if (f->locals_count)
2664 oprintf("%s%i locals:\n", ind, (int)f->locals_count);
2665 for (i = 0; i < f->locals_count; ++i) {
2666 oprintf("%s\t", ind);
2667 ir_value_dump(f->locals[i], oprintf);
2671 if (f->blocks_count)
2673 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
2674 for (i = 0; i < f->blocks_count; ++i) {
2675 if (f->blocks[i]->run_id != f->run_id) {
2676 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
2678 ir_block_dump(f->blocks[i], ind, oprintf);
2682 ind[strlen(ind)-1] = 0;
2683 oprintf("%sendfunction %s\n", ind, f->name);
2686 void ir_block_dump(ir_block* b, char *ind,
2687 int (*oprintf)(const char*, ...))
2690 oprintf("%s:%s\n", ind, b->label);
2691 strncat(ind, "\t", IND_BUFSZ);
2693 for (i = 0; i < b->instr_count; ++i)
2694 ir_instr_dump(b->instr[i], ind, oprintf);
2695 ind[strlen(ind)-1] = 0;
2698 void dump_phi(ir_instr *in, char *ind,
2699 int (*oprintf)(const char*, ...))
2702 oprintf("%s <- phi ", in->_ops[0]->name);
2703 for (i = 0; i < in->phi_count; ++i)
2705 oprintf("([%s] : %s) ", in->phi[i].from->label,
2706 in->phi[i].value->name);
2711 void ir_instr_dump(ir_instr *in, char *ind,
2712 int (*oprintf)(const char*, ...))
2715 const char *comma = NULL;
2717 oprintf("%s (%i) ", ind, (int)in->eid);
2719 if (in->opcode == VINSTR_PHI) {
2720 dump_phi(in, ind, oprintf);
2724 strncat(ind, "\t", IND_BUFSZ);
2726 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
2727 ir_value_dump(in->_ops[0], oprintf);
2728 if (in->_ops[1] || in->_ops[2])
2731 oprintf("%s\t", qc_opname(in->opcode));
2732 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
2733 ir_value_dump(in->_ops[0], oprintf);
2738 for (i = 1; i != 3; ++i) {
2742 ir_value_dump(in->_ops[i], oprintf);
2750 oprintf("[%s]", in->bops[0]->label);
2754 oprintf("%s[%s]", comma, in->bops[1]->label);
2756 ind[strlen(ind)-1] = 0;
2759 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
2767 oprintf("%g", v->constval.vfloat);
2770 oprintf("'%g %g %g'",
2773 v->constval.vvec.z);
2776 oprintf("(entity)");
2779 oprintf("\"%s\"", v->constval.vstring);
2783 oprintf("%i", v->constval.vint);
2788 v->constval.vpointer->name);
2792 oprintf("%s", v->name);
2796 void ir_value_dump_life(ir_value *self, int (*oprintf)(const char*,...))
2799 oprintf("Life of %s:\n", self->name);
2800 for (i = 0; i < self->life_count; ++i)
2802 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);