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 */
44 4, /* TYPE_QUATERNION */
46 16, /* TYPE_VARIANT */
49 uint16_t type_store_instr[TYPE_COUNT] = {
50 INSTR_STORE_F, /* should use I when having integer support */
57 INSTR_STORE_ENT, /* should use I */
59 INSTR_STORE_I, /* integer type */
64 INSTR_STORE_M, /* variant, should never be accessed */
67 uint16_t type_storep_instr[TYPE_COUNT] = {
68 INSTR_STOREP_F, /* should use I when having integer support */
75 INSTR_STOREP_ENT, /* should use I */
77 INSTR_STOREP_ENT, /* integer type */
82 INSTR_STOREP_M, /* variant, should never be accessed */
85 MEM_VEC_FUNCTIONS(ir_value_vector, ir_value*, v)
87 /***********************************************************************
91 ir_builder* ir_builder_new(const char *modulename)
95 self = (ir_builder*)mem_a(sizeof(*self));
99 MEM_VECTOR_INIT(self, functions);
100 MEM_VECTOR_INIT(self, globals);
102 if (!ir_builder_set_name(self, modulename)) {
107 /* globals which always exist */
109 /* for now we give it a vector size */
110 ir_builder_create_global(self, "OFS_RETURN", TYPE_VARIANT);
115 MEM_VEC_FUNCTIONS(ir_builder, ir_value*, globals)
116 MEM_VEC_FUNCTIONS(ir_builder, ir_function*, functions)
118 void ir_builder_delete(ir_builder* self)
121 mem_d((void*)self->name);
122 for (i = 0; i != self->functions_count; ++i) {
123 ir_function_delete(self->functions[i]);
125 MEM_VECTOR_CLEAR(self, functions);
126 for (i = 0; i != self->globals_count; ++i) {
127 ir_value_delete(self->globals[i]);
129 MEM_VECTOR_CLEAR(self, globals);
133 bool ir_builder_set_name(ir_builder *self, const char *name)
136 mem_d((void*)self->name);
137 self->name = util_strdup(name);
141 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
144 for (i = 0; i < self->functions_count; ++i) {
145 if (!strcmp(name, self->functions[i]->name))
146 return self->functions[i];
151 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
153 ir_function *fn = ir_builder_get_function(self, name);
158 fn = ir_function_new(self, outtype);
159 if (!ir_function_set_name(fn, name) ||
160 !ir_builder_functions_add(self, fn) )
162 ir_function_delete(fn);
166 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
168 ir_function_delete(fn);
172 fn->value->isconst = true;
173 fn->value->outtype = outtype;
174 fn->value->constval.vfunc = fn;
175 fn->value->context = fn->context;
180 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
183 for (i = 0; i < self->globals_count; ++i) {
184 if (!strcmp(self->globals[i]->name, name))
185 return self->globals[i];
190 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
192 ir_value *ve = ir_builder_get_global(self, name);
197 ve = ir_value_var(name, store_global, vtype);
198 if (!ir_builder_globals_add(self, ve)) {
205 /***********************************************************************
209 bool ir_function_naive_phi(ir_function*);
210 void ir_function_enumerate(ir_function*);
211 bool ir_function_calculate_liferanges(ir_function*);
212 bool ir_function_allocate_locals(ir_function*);
214 ir_function* ir_function_new(ir_builder* owner, int outtype)
217 self = (ir_function*)mem_a(sizeof(*self));
223 if (!ir_function_set_name(self, "<@unnamed>")) {
228 self->context.file = "<@no context>";
229 self->context.line = 0;
230 self->outtype = outtype;
233 MEM_VECTOR_INIT(self, params);
234 MEM_VECTOR_INIT(self, blocks);
235 MEM_VECTOR_INIT(self, values);
236 MEM_VECTOR_INIT(self, locals);
241 MEM_VEC_FUNCTIONS(ir_function, ir_value*, values)
242 MEM_VEC_FUNCTIONS(ir_function, ir_block*, blocks)
243 MEM_VEC_FUNCTIONS(ir_function, ir_value*, locals)
244 MEM_VEC_FUNCTIONS(ir_function, int, params)
246 bool ir_function_set_name(ir_function *self, const char *name)
249 mem_d((void*)self->name);
250 self->name = util_strdup(name);
254 void ir_function_delete(ir_function *self)
257 mem_d((void*)self->name);
259 for (i = 0; i != self->blocks_count; ++i)
260 ir_block_delete(self->blocks[i]);
261 MEM_VECTOR_CLEAR(self, blocks);
263 MEM_VECTOR_CLEAR(self, params);
265 for (i = 0; i != self->values_count; ++i)
266 ir_value_delete(self->values[i]);
267 MEM_VECTOR_CLEAR(self, values);
269 for (i = 0; i != self->locals_count; ++i)
270 ir_value_delete(self->locals[i]);
271 MEM_VECTOR_CLEAR(self, locals);
273 /* self->value is deleted by the builder */
278 bool GMQCC_WARN ir_function_collect_value(ir_function *self, ir_value *v)
280 return ir_function_values_add(self, v);
283 ir_block* ir_function_create_block(ir_function *self, const char *label)
285 ir_block* bn = ir_block_new(self, label);
286 memcpy(&bn->context, &self->context, sizeof(self->context));
287 if (!ir_function_blocks_add(self, bn)) {
294 bool ir_function_finalize(ir_function *self)
299 if (!ir_function_naive_phi(self))
302 ir_function_enumerate(self);
304 if (!ir_function_calculate_liferanges(self))
307 if (!ir_function_allocate_locals(self))
312 ir_value* ir_function_get_local(ir_function *self, const char *name)
315 for (i = 0; i < self->locals_count; ++i) {
316 if (!strcmp(self->locals[i]->name, name))
317 return self->locals[i];
322 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype)
324 ir_value *ve = ir_function_get_local(self, name);
329 ve = ir_value_var(name, store_local, vtype);
330 if (!ir_function_locals_add(self, ve)) {
337 /***********************************************************************
341 ir_block* ir_block_new(ir_function* owner, const char *name)
344 self = (ir_block*)mem_a(sizeof(*self));
348 memset(self, 0, sizeof(*self));
351 if (!ir_block_set_label(self, name)) {
356 self->context.file = "<@no context>";
357 self->context.line = 0;
359 MEM_VECTOR_INIT(self, instr);
360 MEM_VECTOR_INIT(self, entries);
361 MEM_VECTOR_INIT(self, exits);
364 self->is_return = false;
366 MEM_VECTOR_INIT(self, living);
368 self->generated = false;
372 MEM_VEC_FUNCTIONS(ir_block, ir_instr*, instr)
373 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, entries)
374 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, exits)
375 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_value*, living)
377 void ir_block_delete(ir_block* self)
381 for (i = 0; i != self->instr_count; ++i)
382 ir_instr_delete(self->instr[i]);
383 MEM_VECTOR_CLEAR(self, instr);
384 MEM_VECTOR_CLEAR(self, entries);
385 MEM_VECTOR_CLEAR(self, exits);
386 MEM_VECTOR_CLEAR(self, living);
390 bool ir_block_set_label(ir_block *self, const char *name)
393 mem_d((void*)self->label);
394 self->label = util_strdup(name);
395 return !!self->label;
398 /***********************************************************************
402 ir_instr* ir_instr_new(ir_block* owner, int op)
405 self = (ir_instr*)mem_a(sizeof(*self));
410 self->context.file = "<@no context>";
411 self->context.line = 0;
413 self->_ops[0] = NULL;
414 self->_ops[1] = NULL;
415 self->_ops[2] = NULL;
416 self->bops[0] = NULL;
417 self->bops[1] = NULL;
418 MEM_VECTOR_INIT(self, phi);
419 MEM_VECTOR_INIT(self, params);
424 MEM_VEC_FUNCTIONS(ir_instr, ir_phi_entry_t, phi)
425 MEM_VEC_FUNCTIONS(ir_instr, ir_value*, params)
427 void ir_instr_delete(ir_instr *self)
430 /* The following calls can only delete from
431 * vectors, we still want to delete this instruction
432 * so ignore the return value. Since with the warn_unused_result attribute
433 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
434 * I have to improvise here and use if(foo());
436 for (i = 0; i < self->phi_count; ++i) {
438 if (ir_value_writes_find(self->phi[i].value, self, &idx))
439 if (ir_value_writes_remove(self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
440 if (ir_value_reads_find(self->phi[i].value, self, &idx))
441 if (ir_value_reads_remove (self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
443 MEM_VECTOR_CLEAR(self, phi);
444 for (i = 0; i < self->params_count; ++i) {
446 if (ir_value_writes_find(self->params[i], self, &idx))
447 if (ir_value_writes_remove(self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
448 if (ir_value_reads_find(self->params[i], self, &idx))
449 if (ir_value_reads_remove (self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
451 MEM_VECTOR_CLEAR(self, params);
452 if (ir_instr_op(self, 0, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
453 if (ir_instr_op(self, 1, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
454 if (ir_instr_op(self, 2, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
458 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
460 if (self->_ops[op]) {
462 if (writing && ir_value_writes_find(self->_ops[op], self, &idx))
464 if (!ir_value_writes_remove(self->_ops[op], idx))
467 else if (ir_value_reads_find(self->_ops[op], self, &idx))
469 if (!ir_value_reads_remove(self->_ops[op], idx))
475 if (!ir_value_writes_add(v, self))
478 if (!ir_value_reads_add(v, self))
486 /***********************************************************************
490 ir_value* ir_value_var(const char *name, int storetype, int vtype)
493 self = (ir_value*)mem_a(sizeof(*self));
495 self->fieldtype = TYPE_VOID;
496 self->outtype = TYPE_VOID;
497 self->store = storetype;
498 MEM_VECTOR_INIT(self, reads);
499 MEM_VECTOR_INIT(self, writes);
500 self->isconst = false;
501 self->context.file = "<@no context>";
502 self->context.line = 0;
504 ir_value_set_name(self, name);
506 memset(&self->constval, 0, sizeof(self->constval));
507 memset(&self->code, 0, sizeof(self->code));
509 MEM_VECTOR_INIT(self, life);
512 MEM_VEC_FUNCTIONS(ir_value, ir_life_entry_t, life)
513 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, reads)
514 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, writes)
516 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
518 ir_value *v = ir_value_var(name, storetype, vtype);
521 if (!ir_function_collect_value(owner, v))
529 void ir_value_delete(ir_value* self)
532 mem_d((void*)self->name);
535 if (self->vtype == TYPE_STRING)
536 mem_d((void*)self->constval.vstring);
538 MEM_VECTOR_CLEAR(self, reads);
539 MEM_VECTOR_CLEAR(self, writes);
540 MEM_VECTOR_CLEAR(self, life);
544 void ir_value_set_name(ir_value *self, const char *name)
547 mem_d((void*)self->name);
548 self->name = util_strdup(name);
551 bool ir_value_set_float(ir_value *self, float f)
553 if (self->vtype != TYPE_FLOAT)
555 self->constval.vfloat = f;
556 self->isconst = true;
560 bool ir_value_set_func(ir_value *self, int f)
562 if (self->vtype != TYPE_FUNCTION)
564 self->constval.vint = f;
565 self->isconst = true;
569 bool ir_value_set_vector(ir_value *self, vector v)
571 if (self->vtype != TYPE_VECTOR)
573 self->constval.vvec = v;
574 self->isconst = true;
578 bool ir_value_set_quaternion(ir_value *self, quaternion v)
580 if (self->vtype != TYPE_QUATERNION)
582 memcpy(&self->constval.vquat, v, sizeof(self->constval.vquat));
583 self->isconst = true;
587 bool ir_value_set_matrix(ir_value *self, matrix v)
589 if (self->vtype != TYPE_MATRIX)
591 memcpy(&self->constval.vmat, v, sizeof(self->constval.vmat));
592 self->isconst = true;
596 bool ir_value_set_string(ir_value *self, const char *str)
598 if (self->vtype != TYPE_STRING)
600 self->constval.vstring = util_strdup(str);
601 self->isconst = true;
606 bool ir_value_set_int(ir_value *self, int i)
608 if (self->vtype != TYPE_INTEGER)
610 self->constval.vint = i;
611 self->isconst = true;
616 bool ir_value_lives(ir_value *self, size_t at)
619 for (i = 0; i < self->life_count; ++i)
621 ir_life_entry_t *life = &self->life[i];
622 if (life->start <= at && at <= life->end)
624 if (life->start > at) /* since it's ordered */
630 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
633 if (!ir_value_life_add(self, e)) /* naive... */
635 for (k = self->life_count-1; k > idx; --k)
636 self->life[k] = self->life[k-1];
641 bool ir_value_life_merge(ir_value *self, size_t s)
644 ir_life_entry_t *life = NULL;
645 ir_life_entry_t *before = NULL;
646 ir_life_entry_t new_entry;
648 /* Find the first range >= s */
649 for (i = 0; i < self->life_count; ++i)
652 life = &self->life[i];
656 /* nothing found? append */
657 if (i == self->life_count) {
659 if (life && life->end+1 == s)
661 /* previous life range can be merged in */
665 if (life && life->end >= s)
668 if (!ir_value_life_add(self, e))
669 return false; /* failing */
675 if (before->end + 1 == s &&
676 life->start - 1 == s)
679 before->end = life->end;
680 if (!ir_value_life_remove(self, i))
681 return false; /* failing */
684 if (before->end + 1 == s)
690 /* already contained */
691 if (before->end >= s)
695 if (life->start - 1 == s)
700 /* insert a new entry */
701 new_entry.start = new_entry.end = s;
702 return ir_value_life_insert(self, i, new_entry);
705 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
709 if (!other->life_count)
712 if (!self->life_count) {
713 for (i = 0; i < other->life_count; ++i) {
714 if (!ir_value_life_add(self, other->life[i]))
721 for (i = 0; i < other->life_count; ++i)
723 const ir_life_entry_t *life = &other->life[i];
726 ir_life_entry_t *entry = &self->life[myi];
728 if (life->end+1 < entry->start)
730 /* adding an interval before entry */
731 if (!ir_value_life_insert(self, myi, *life))
737 if (life->start < entry->start &&
738 life->end >= entry->start)
740 /* starts earlier and overlaps */
741 entry->start = life->start;
744 if (life->end > entry->end &&
745 life->start-1 <= entry->end)
747 /* ends later and overlaps */
748 entry->end = life->end;
751 /* see if our change combines it with the next ranges */
752 while (myi+1 < self->life_count &&
753 entry->end+1 >= self->life[1+myi].start)
755 /* overlaps with (myi+1) */
756 if (entry->end < self->life[1+myi].end)
757 entry->end = self->life[1+myi].end;
758 if (!ir_value_life_remove(self, myi+1))
760 entry = &self->life[myi];
763 /* see if we're after the entry */
764 if (life->start > entry->end)
767 /* append if we're at the end */
768 if (myi >= self->life_count) {
769 if (!ir_value_life_add(self, *life))
773 /* otherweise check the next range */
782 bool ir_values_overlap(const ir_value *a, const ir_value *b)
784 /* For any life entry in A see if it overlaps with
785 * any life entry in B.
786 * Note that the life entries are orderes, so we can make a
787 * more efficient algorithm there than naively translating the
791 ir_life_entry_t *la, *lb, *enda, *endb;
793 /* first of all, if either has no life range, they cannot clash */
794 if (!a->life_count || !b->life_count)
799 enda = la + a->life_count;
800 endb = lb + b->life_count;
803 /* check if the entries overlap, for that,
804 * both must start before the other one ends.
806 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
807 if (la->start <= lb->end &&
808 lb->start <= la->end)
810 if (la->start < lb->end &&
817 /* entries are ordered
818 * one entry is earlier than the other
819 * that earlier entry will be moved forward
821 if (la->start < lb->start)
823 /* order: A B, move A forward
824 * check if we hit the end with A
829 else if (lb->start < la->start)
831 /* order: B A, move B forward
832 * check if we hit the end with B
841 /***********************************************************************
845 bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
847 if (target->store == store_value) {
848 fprintf(stderr, "cannot store to an SSA value\n");
849 fprintf(stderr, "trying to store: %s <- %s\n", target->name, what->name);
852 ir_instr *in = ir_instr_new(self, op);
855 if (!ir_instr_op(in, 0, target, true) ||
856 !ir_instr_op(in, 1, what, false) ||
857 !ir_block_instr_add(self, in) )
865 bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
869 if (target->vtype == TYPE_VARIANT)
872 vtype = target->vtype;
875 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
876 op = INSTR_CONV_ITOF;
877 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
878 op = INSTR_CONV_FTOI;
880 op = type_store_instr[vtype];
882 return ir_block_create_store_op(self, op, target, what);
885 bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
890 if (target->vtype != TYPE_POINTER)
893 /* storing using pointer - target is a pointer, type must be
894 * inferred from source
898 op = type_storep_instr[vtype];
899 return ir_block_create_store_op(self, op, target, what);
902 bool ir_block_create_return(ir_block *self, ir_value *v)
906 fprintf(stderr, "block already ended (%s)\n", self->label);
910 self->is_return = true;
911 in = ir_instr_new(self, INSTR_RETURN);
915 if (!ir_instr_op(in, 0, v, false) ||
916 !ir_block_instr_add(self, in) )
923 bool ir_block_create_if(ir_block *self, ir_value *v,
924 ir_block *ontrue, ir_block *onfalse)
928 fprintf(stderr, "block already ended (%s)\n", self->label);
932 /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
933 in = ir_instr_new(self, VINSTR_COND);
937 if (!ir_instr_op(in, 0, v, false)) {
942 in->bops[0] = ontrue;
943 in->bops[1] = onfalse;
945 if (!ir_block_instr_add(self, in))
948 if (!ir_block_exits_add(self, ontrue) ||
949 !ir_block_exits_add(self, onfalse) ||
950 !ir_block_entries_add(ontrue, self) ||
951 !ir_block_entries_add(onfalse, self) )
958 bool ir_block_create_jump(ir_block *self, ir_block *to)
962 fprintf(stderr, "block already ended (%s)\n", self->label);
966 in = ir_instr_new(self, VINSTR_JUMP);
971 if (!ir_block_instr_add(self, in))
974 if (!ir_block_exits_add(self, to) ||
975 !ir_block_entries_add(to, self) )
982 bool ir_block_create_goto(ir_block *self, ir_block *to)
986 fprintf(stderr, "block already ended (%s)\n", self->label);
990 in = ir_instr_new(self, INSTR_GOTO);
995 if (!ir_block_instr_add(self, in))
998 if (!ir_block_exits_add(self, to) ||
999 !ir_block_entries_add(to, self) )
1006 ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
1010 in = ir_instr_new(self, VINSTR_PHI);
1013 out = ir_value_out(self->owner, label, store_value, ot);
1015 ir_instr_delete(in);
1018 if (!ir_instr_op(in, 0, out, true)) {
1019 ir_instr_delete(in);
1020 ir_value_delete(out);
1023 if (!ir_block_instr_add(self, in)) {
1024 ir_instr_delete(in);
1025 ir_value_delete(out);
1031 ir_value* ir_phi_value(ir_instr *self)
1033 return self->_ops[0];
1036 bool ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1040 if (!ir_block_entries_find(self->owner, b, NULL)) {
1041 /* Must not be possible to cause this, otherwise the AST
1042 * is doing something wrong.
1044 fprintf(stderr, "Invalid entry block for PHI\n");
1050 if (!ir_value_reads_add(v, self))
1052 return ir_instr_phi_add(self, pe);
1055 /* call related code */
1056 ir_instr* ir_block_create_call(ir_block *self, const char *label, ir_value *func)
1060 in = ir_instr_new(self, INSTR_CALL0);
1063 out = ir_value_out(self->owner, label, store_return, func->outtype);
1065 ir_instr_delete(in);
1068 if (!ir_instr_op(in, 0, out, true) ||
1069 !ir_instr_op(in, 1, func, false) ||
1070 !ir_block_instr_add(self, in))
1072 ir_instr_delete(in);
1073 ir_value_delete(out);
1079 ir_value* ir_call_value(ir_instr *self)
1081 return self->_ops[0];
1084 bool ir_call_param(ir_instr* self, ir_value *v)
1086 if (!ir_instr_params_add(self, v))
1088 if (!ir_value_reads_add(v, self)) {
1089 if (!ir_instr_params_remove(self, self->params_count-1))
1090 GMQCC_SUPPRESS_EMPTY_BODY;
1096 /* binary op related code */
1098 ir_value* ir_block_create_binop(ir_block *self,
1099 const char *label, int opcode,
1100 ir_value *left, ir_value *right)
1122 case INSTR_SUB_S: /* -- offset of string as float */
1127 case INSTR_BITOR_IF:
1128 case INSTR_BITOR_FI:
1129 case INSTR_BITAND_FI:
1130 case INSTR_BITAND_IF:
1145 case INSTR_BITAND_I:
1148 case INSTR_RSHIFT_I:
1149 case INSTR_LSHIFT_I:
1170 /* boolean operations result in floats */
1171 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1173 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1176 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1181 if (ot == TYPE_VOID) {
1182 /* The AST or parser were supposed to check this! */
1186 return ir_block_create_general_instr(self, label, opcode, left, right, ot);
1189 ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
1190 int op, ir_value *a, ir_value *b, int outype)
1195 out = ir_value_out(self->owner, label, store_value, outype);
1199 instr = ir_instr_new(self, op);
1201 ir_value_delete(out);
1205 if (!ir_instr_op(instr, 0, out, true) ||
1206 !ir_instr_op(instr, 1, a, false) ||
1207 !ir_instr_op(instr, 2, b, false) )
1212 if (!ir_block_instr_add(self, instr))
1217 ir_instr_delete(instr);
1218 ir_value_delete(out);
1222 ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
1224 /* Support for various pointer types todo if so desired */
1225 if (ent->vtype != TYPE_ENTITY)
1228 if (field->vtype != TYPE_FIELD)
1231 return ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1234 ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
1237 if (ent->vtype != TYPE_ENTITY)
1240 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1241 if (field->vtype != TYPE_FIELD)
1246 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1247 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1248 case TYPE_STRING: op = INSTR_LOAD_S; break;
1249 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1250 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1252 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1253 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1255 case TYPE_QUATERNION: op = INSTR_LOAD_Q; break;
1256 case TYPE_MATRIX: op = INSTR_LOAD_M; break;
1261 return ir_block_create_general_instr(self, label, op, ent, field, outype);
1264 ir_value* ir_block_create_add(ir_block *self,
1266 ir_value *left, ir_value *right)
1269 int l = left->vtype;
1270 int r = right->vtype;
1289 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1291 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1297 return ir_block_create_binop(self, label, op, left, right);
1300 ir_value* ir_block_create_sub(ir_block *self,
1302 ir_value *left, ir_value *right)
1305 int l = left->vtype;
1306 int r = right->vtype;
1326 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1328 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1334 return ir_block_create_binop(self, label, op, left, right);
1337 ir_value* ir_block_create_mul(ir_block *self,
1339 ir_value *left, ir_value *right)
1342 int l = left->vtype;
1343 int r = right->vtype;
1360 case TYPE_QUATERNION:
1368 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1370 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1372 else if ( (l == TYPE_QUATERNION && r == TYPE_FLOAT) )
1374 else if ( (l == TYPE_MATRIX && r == TYPE_FLOAT) )
1377 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1379 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1381 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1383 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1389 return ir_block_create_binop(self, label, op, left, right);
1392 ir_value* ir_block_create_div(ir_block *self,
1394 ir_value *left, ir_value *right)
1397 int l = left->vtype;
1398 int r = right->vtype;
1415 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1417 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1419 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1425 return ir_block_create_binop(self, label, op, left, right);
1428 /* PHI resolving breaks the SSA, and must thus be the last
1429 * step before life-range calculation.
1432 static bool ir_block_naive_phi(ir_block *self);
1433 bool ir_function_naive_phi(ir_function *self)
1437 for (i = 0; i < self->blocks_count; ++i)
1439 if (!ir_block_naive_phi(self->blocks[i]))
1445 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1450 /* create a store */
1451 if (!ir_block_create_store(block, old, what))
1454 /* we now move it up */
1455 instr = block->instr[block->instr_count-1];
1456 for (i = block->instr_count; i > iid; --i)
1457 block->instr[i] = block->instr[i-1];
1458 block->instr[i] = instr;
1463 static bool ir_block_naive_phi(ir_block *self)
1466 /* FIXME: optionally, create_phi can add the phis
1467 * to a list so we don't need to loop through blocks
1468 * - anyway: "don't optimize YET"
1470 for (i = 0; i < self->instr_count; ++i)
1472 ir_instr *instr = self->instr[i];
1473 if (instr->opcode != VINSTR_PHI)
1476 if (!ir_block_instr_remove(self, i))
1478 --i; /* NOTE: i+1 below */
1480 for (p = 0; p < instr->phi_count; ++p)
1482 ir_value *v = instr->phi[p].value;
1483 for (w = 0; w < v->writes_count; ++w) {
1486 if (!v->writes[w]->_ops[0])
1489 /* When the write was to a global, we have to emit a mov */
1490 old = v->writes[w]->_ops[0];
1492 /* The original instruction now writes to the PHI target local */
1493 if (v->writes[w]->_ops[0] == v)
1494 v->writes[w]->_ops[0] = instr->_ops[0];
1496 if (old->store != store_value && old->store != store_local)
1498 /* If it originally wrote to a global we need to store the value
1501 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1503 if (i+1 < self->instr_count)
1504 instr = self->instr[i+1];
1507 /* In case I forget and access instr later, it'll be NULL
1508 * when it's a problem, to make sure we crash, rather than accessing
1514 /* If it didn't, we can replace all reads by the phi target now. */
1516 for (r = 0; r < old->reads_count; ++r)
1519 ir_instr *ri = old->reads[r];
1520 for (op = 0; op < ri->phi_count; ++op) {
1521 if (ri->phi[op].value == old)
1522 ri->phi[op].value = v;
1524 for (op = 0; op < 3; ++op) {
1525 if (ri->_ops[op] == old)
1532 ir_instr_delete(instr);
1537 /***********************************************************************
1538 *IR Temp allocation code
1539 * Propagating value life ranges by walking through the function backwards
1540 * until no more changes are made.
1541 * In theory this should happen once more than once for every nested loop
1543 * Though this implementation might run an additional time for if nests.
1552 MEM_VEC_FUNCTIONS_ALL(new_reads_t, ir_value*, v)
1554 /* Enumerate instructions used by value's life-ranges
1556 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1560 for (i = 0; i < self->instr_count; ++i)
1562 self->instr[i]->eid = eid++;
1567 /* Enumerate blocks and instructions.
1568 * The block-enumeration is unordered!
1569 * We do not really use the block enumreation, however
1570 * the instruction enumeration is important for life-ranges.
1572 void ir_function_enumerate(ir_function *self)
1575 size_t instruction_id = 0;
1576 for (i = 0; i < self->blocks_count; ++i)
1578 self->blocks[i]->eid = i;
1579 self->blocks[i]->run_id = 0;
1580 ir_block_enumerate(self->blocks[i], &instruction_id);
1584 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
1585 bool ir_function_calculate_liferanges(ir_function *self)
1593 for (i = 0; i != self->blocks_count; ++i)
1595 if (self->blocks[i]->is_return)
1597 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
1605 /* Local-value allocator
1606 * After finishing creating the liferange of all values used in a function
1607 * we can allocate their global-positions.
1608 * This is the counterpart to register-allocation in register machines.
1611 MEM_VECTOR_MAKE(ir_value*, locals);
1612 MEM_VECTOR_MAKE(size_t, sizes);
1613 MEM_VECTOR_MAKE(size_t, positions);
1614 } function_allocator;
1615 MEM_VEC_FUNCTIONS(function_allocator, ir_value*, locals)
1616 MEM_VEC_FUNCTIONS(function_allocator, size_t, sizes)
1617 MEM_VEC_FUNCTIONS(function_allocator, size_t, positions)
1619 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
1622 size_t vsize = type_sizeof[var->vtype];
1624 slot = ir_value_var("reg", store_global, var->vtype);
1628 if (!ir_value_life_merge_into(slot, var))
1631 if (!function_allocator_locals_add(alloc, slot))
1634 if (!function_allocator_sizes_add(alloc, vsize))
1640 ir_value_delete(slot);
1644 bool ir_function_allocate_locals(ir_function *self)
1653 function_allocator alloc;
1655 if (!self->locals_count)
1658 MEM_VECTOR_INIT(&alloc, locals);
1659 MEM_VECTOR_INIT(&alloc, sizes);
1660 MEM_VECTOR_INIT(&alloc, positions);
1662 for (i = 0; i < self->locals_count; ++i)
1664 if (!function_allocator_alloc(&alloc, self->locals[i]))
1668 /* Allocate a slot for any value that still exists */
1669 for (i = 0; i < self->values_count; ++i)
1671 v = self->values[i];
1676 for (a = 0; a < alloc.locals_count; ++a)
1678 slot = alloc.locals[a];
1680 if (ir_values_overlap(v, slot))
1683 if (!ir_value_life_merge_into(slot, v))
1686 /* adjust size for this slot */
1687 if (alloc.sizes[a] < type_sizeof[v->vtype])
1688 alloc.sizes[a] = type_sizeof[v->vtype];
1690 self->values[i]->code.local = a;
1693 if (a >= alloc.locals_count) {
1694 self->values[i]->code.local = alloc.locals_count;
1695 if (!function_allocator_alloc(&alloc, v))
1700 /* Adjust slot positions based on sizes */
1701 if (!function_allocator_positions_add(&alloc, 0))
1704 if (alloc.sizes_count)
1705 pos = alloc.positions[0] + alloc.sizes[0];
1708 for (i = 1; i < alloc.sizes_count; ++i)
1710 pos = alloc.positions[i-1] + alloc.sizes[i-1];
1711 if (!function_allocator_positions_add(&alloc, pos))
1715 self->allocated_locals = pos + alloc.sizes[alloc.sizes_count-1];
1717 /* Take over the actual slot positions */
1718 for (i = 0; i < self->values_count; ++i)
1719 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
1726 for (i = 0; i < alloc.locals_count; ++i)
1727 ir_value_delete(alloc.locals[i]);
1728 MEM_VECTOR_CLEAR(&alloc, locals);
1729 MEM_VECTOR_CLEAR(&alloc, sizes);
1730 MEM_VECTOR_CLEAR(&alloc, positions);
1734 /* Get information about which operand
1735 * is read from, or written to.
1737 static void ir_op_read_write(int op, size_t *read, size_t *write)
1764 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
1767 bool changed = false;
1769 for (i = 0; i != self->living_count; ++i)
1771 tempbool = ir_value_life_merge(self->living[i], eid);
1774 fprintf(stderr, "block_living_add_instr() value instruction added %s: %i\n", self->living[i]->_name, (int)eid);
1776 changed = changed || tempbool;
1781 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
1784 /* values which have been read in a previous iteration are now
1785 * in the "living" array even if the previous block doesn't use them.
1786 * So we have to remove whatever does not exist in the previous block.
1787 * They will be re-added on-read, but the liferange merge won't cause
1790 for (i = 0; i < self->living_count; ++i)
1792 if (!ir_block_living_find(prev, self->living[i], NULL)) {
1793 if (!ir_block_living_remove(self, i))
1799 /* Whatever the previous block still has in its living set
1800 * must now be added to ours as well.
1802 for (i = 0; i < prev->living_count; ++i)
1804 if (ir_block_living_find(self, prev->living[i], NULL))
1806 if (!ir_block_living_add(self, prev->living[i]))
1809 printf("%s got from prev: %s\n", self->label, prev->living[i]->_name);
1815 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
1821 /* bitmasks which operands are read from or written to */
1823 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1825 new_reads_t new_reads;
1827 char dbg_ind[16] = { '#', '0' };
1830 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1831 MEM_VECTOR_INIT(&new_reads, v);
1836 if (!ir_block_life_prop_previous(self, prev, changed))
1840 i = self->instr_count;
1843 instr = self->instr[i];
1845 /* PHI operands are always read operands */
1846 for (p = 0; p < instr->phi_count; ++p)
1848 value = instr->phi[p].value;
1849 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1850 if (!ir_block_living_find(self, value, NULL) &&
1851 !ir_block_living_add(self, value))
1856 if (!new_reads_t_v_find(&new_reads, value, NULL))
1858 if (!new_reads_t_v_add(&new_reads, value))
1864 /* See which operands are read and write operands */
1865 ir_op_read_write(instr->opcode, &read, &write);
1867 /* Go through the 3 main operands */
1868 for (o = 0; o < 3; ++o)
1870 if (!instr->_ops[o]) /* no such operand */
1873 value = instr->_ops[o];
1875 /* We only care about locals */
1876 if (value->store != store_value &&
1877 value->store != store_local)
1883 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1884 if (!ir_block_living_find(self, value, NULL) &&
1885 !ir_block_living_add(self, value))
1890 /* fprintf(stderr, "read: %s\n", value->_name); */
1891 if (!new_reads_t_v_find(&new_reads, value, NULL))
1893 if (!new_reads_t_v_add(&new_reads, value))
1899 /* write operands */
1900 /* When we write to a local, we consider it "dead" for the
1901 * remaining upper part of the function, since in SSA a value
1902 * can only be written once (== created)
1907 bool in_living = ir_block_living_find(self, value, &idx);
1908 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1910 bool in_reads = new_reads_t_v_find(&new_reads, value, &readidx);
1911 if (!in_living && !in_reads)
1916 /* If the value isn't alive it hasn't been read before... */
1917 /* TODO: See if the warning can be emitted during parsing or AST processing
1918 * otherwise have warning printed here.
1919 * IF printing a warning here: include filecontext_t,
1920 * and make sure it's only printed once
1921 * since this function is run multiple times.
1923 /* For now: debug info: */
1924 fprintf(stderr, "Value only written %s\n", value->name);
1925 tempbool = ir_value_life_merge(value, instr->eid);
1926 *changed = *changed || tempbool;
1928 ir_instr_dump(instr, dbg_ind, printf);
1932 /* since 'living' won't contain it
1933 * anymore, merge the value, since
1936 tempbool = ir_value_life_merge(value, instr->eid);
1939 fprintf(stderr, "value added id %s %i\n", value->name, (int)instr->eid);
1941 *changed = *changed || tempbool;
1943 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1944 if (!ir_block_living_remove(self, idx))
1949 if (!new_reads_t_v_remove(&new_reads, readidx))
1957 tempbool = ir_block_living_add_instr(self, instr->eid);
1958 /*fprintf(stderr, "living added values\n");*/
1959 *changed = *changed || tempbool;
1961 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1963 for (rd = 0; rd < new_reads.v_count; ++rd)
1965 if (!ir_block_living_find(self, new_reads.v[rd], NULL)) {
1966 if (!ir_block_living_add(self, new_reads.v[rd]))
1969 if (!i && !self->entries_count) {
1971 *changed = *changed || ir_value_life_merge(new_reads.v[rd], instr->eid);
1974 MEM_VECTOR_CLEAR(&new_reads, v);
1978 if (self->run_id == self->owner->run_id)
1981 self->run_id = self->owner->run_id;
1983 for (i = 0; i < self->entries_count; ++i)
1985 ir_block *entry = self->entries[i];
1986 ir_block_life_propagate(entry, self, changed);
1991 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1992 MEM_VECTOR_CLEAR(&new_reads, v);
1997 /***********************************************************************
2000 * Since the IR has the convention of putting 'write' operands
2001 * at the beginning, we have to rotate the operands of instructions
2002 * properly in order to generate valid QCVM code.
2004 * Having destinations at a fixed position is more convenient. In QC
2005 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2006 * read from from OPA, and store to OPB rather than OPC. Which is
2007 * partially the reason why the implementation of these instructions
2008 * in darkplaces has been delayed for so long.
2010 * Breaking conventions is annoying...
2012 static bool ir_builder_gen_global(ir_builder *self, ir_value *global);
2014 static bool gen_global_field(ir_value *global)
2016 if (global->isconst)
2018 ir_value *fld = global->constval.vpointer;
2020 printf("Invalid field constant with no field: %s\n", global->name);
2024 /* Now, in this case, a relocation would be impossible to code
2025 * since it looks like this:
2026 * .vector v = origin; <- parse error, wtf is 'origin'?
2029 * But we will need a general relocation support later anyway
2030 * for functions... might as well support that here.
2032 if (!fld->code.globaladdr) {
2033 printf("FIXME: Relocation support\n");
2037 /* copy the field's value */
2038 global->code.globaladdr = code_globals_add(code_globals_data[fld->code.globaladdr]);
2042 prog_section_field fld;
2044 fld.name = global->code.name;
2045 fld.offset = code_fields_elements;
2046 fld.type = global->fieldtype;
2048 if (fld.type == TYPE_VOID) {
2049 printf("Field is missing a type: %s\n", global->name);
2053 if (code_fields_add(fld) < 0)
2056 global->code.globaladdr = code_globals_add(fld.offset);
2058 if (global->code.globaladdr < 0)
2063 static bool gen_global_pointer(ir_value *global)
2065 if (global->isconst)
2067 ir_value *target = global->constval.vpointer;
2069 printf("Invalid pointer constant: %s\n", global->name);
2070 /* NULL pointers are pointing to the NULL constant, which also
2071 * sits at address 0, but still has an ir_value for itself.
2076 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2077 * void() foo; <- proto
2078 * void() *fooptr = &foo;
2079 * void() foo = { code }
2081 if (!target->code.globaladdr) {
2082 /* FIXME: Check for the constant nullptr ir_value!
2083 * because then code.globaladdr being 0 is valid.
2085 printf("FIXME: Relocation support\n");
2089 global->code.globaladdr = code_globals_add(target->code.globaladdr);
2093 global->code.globaladdr = code_globals_add(0);
2095 if (global->code.globaladdr < 0)
2100 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2102 prog_section_statement stmt;
2111 block->generated = true;
2112 block->code_start = code_statements_elements;
2113 for (i = 0; i < block->instr_count; ++i)
2115 instr = block->instr[i];
2117 if (instr->opcode == VINSTR_PHI) {
2118 printf("cannot generate virtual instruction (phi)\n");
2122 if (instr->opcode == VINSTR_JUMP) {
2123 target = instr->bops[0];
2124 /* for uncoditional jumps, if the target hasn't been generated
2125 * yet, we generate them right here.
2127 if (!target->generated) {
2132 /* otherwise we generate a jump instruction */
2133 stmt.opcode = INSTR_GOTO;
2134 stmt.o1.s1 = (target->code_start) - code_statements_elements;
2137 if (code_statements_add(stmt) < 0)
2140 /* no further instructions can be in this block */
2144 if (instr->opcode == VINSTR_COND) {
2145 ontrue = instr->bops[0];
2146 onfalse = instr->bops[1];
2147 /* TODO: have the AST signal which block should
2148 * come first: eg. optimize IFs without ELSE...
2151 stmt.o1.u1 = instr->_ops[0]->code.globaladdr;
2155 if (ontrue->generated) {
2156 stmt.opcode = INSTR_IF;
2157 stmt.o2.s1 = (ontrue->code_start-1) - code_statements_elements;
2158 if (code_statements_add(stmt) < 0)
2161 if (onfalse->generated) {
2162 stmt.opcode = INSTR_IFNOT;
2163 stmt.o2.s1 = (onfalse->code_start-1) - code_statements_elements;
2164 if (code_statements_add(stmt) < 0)
2167 if (!ontrue->generated) {
2168 if (onfalse->generated) {
2173 if (!onfalse->generated) {
2174 if (ontrue->generated) {
2179 /* neither ontrue nor onfalse exist */
2180 stmt.opcode = INSTR_IFNOT;
2181 stidx = code_statements_elements;
2182 if (code_statements_add(stmt) < 0)
2184 /* on false we jump, so add ontrue-path */
2185 if (!gen_blocks_recursive(func, ontrue))
2187 /* fixup the jump address */
2188 code_statements_data[stidx].o2.s1 = code_statements_elements - stidx;
2189 /* generate onfalse path */
2190 if (onfalse->generated) {
2191 /* fixup the jump address */
2192 code_statements_data[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2193 /* may have been generated in the previous recursive call */
2194 stmt.opcode = INSTR_GOTO;
2195 stmt.o1.s1 = (onfalse->code_start) - code_statements_elements;
2198 return (code_statements_add(stmt) >= 0);
2200 /* if not, generate now */
2205 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2206 /* Trivial call translation:
2207 * copy all params to OFS_PARM*
2208 * if the output's storetype is not store_return,
2209 * add append a STORE instruction!
2211 * NOTES on how to do it better without much trouble:
2212 * -) The liferanges!
2213 * Simply check the liferange of all parameters for
2214 * other CALLs. For each param with no CALL in its
2215 * liferange, we can store it in an OFS_PARM at
2216 * generation already. This would even include later
2217 * reuse.... probably... :)
2222 for (p = 0; p < instr->params_count; ++p)
2224 ir_value *param = instr->params[p];
2226 stmt.opcode = INSTR_STORE_F;
2229 stmt.opcode = type_store_instr[param->vtype];
2230 stmt.o1.u1 = param->code.globaladdr;
2231 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2232 if (code_statements_add(stmt) < 0)
2235 stmt.opcode = INSTR_CALL0 + instr->params_count;
2236 if (stmt.opcode > INSTR_CALL8)
2237 stmt.opcode = INSTR_CALL8;
2238 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2241 if (code_statements_add(stmt) < 0)
2244 retvalue = instr->_ops[0];
2245 if (retvalue && retvalue->store != store_return && retvalue->life_count)
2247 /* not to be kept in OFS_RETURN */
2248 stmt.opcode = type_store_instr[retvalue->vtype];
2249 stmt.o1.u1 = OFS_RETURN;
2250 stmt.o2.u1 = retvalue->code.globaladdr;
2252 if (code_statements_add(stmt) < 0)
2258 if (instr->opcode == INSTR_STATE) {
2259 printf("TODO: state instruction\n");
2263 stmt.opcode = instr->opcode;
2268 /* This is the general order of operands */
2270 stmt.o3.u1 = instr->_ops[0]->code.globaladdr;
2273 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2276 stmt.o2.u1 = instr->_ops[2]->code.globaladdr;
2278 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2280 stmt.o1.u1 = stmt.o3.u1;
2283 else if ((stmt.opcode >= INSTR_STORE_F &&
2284 stmt.opcode <= INSTR_STORE_FNC) ||
2285 (stmt.opcode >= INSTR_NOT_F &&
2286 stmt.opcode <= INSTR_NOT_FNC))
2288 /* 2-operand instructions with A -> B */
2289 stmt.o2.u1 = stmt.o3.u1;
2293 if (code_statements_add(stmt) < 0)
2299 static bool gen_function_code(ir_function *self)
2302 prog_section_statement stmt;
2304 /* Starting from entry point, we generate blocks "as they come"
2305 * for now. Dead blocks will not be translated obviously.
2307 if (!self->blocks_count) {
2308 printf("Function '%s' declared without body.\n", self->name);
2312 block = self->blocks[0];
2313 if (block->generated)
2316 if (!gen_blocks_recursive(self, block)) {
2317 printf("failed to generate blocks for '%s'\n", self->name);
2321 /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
2322 stmt.opcode = AINSTR_END;
2326 if (code_statements_add(stmt) < 0)
2331 static bool gen_global_function(ir_builder *ir, ir_value *global)
2333 prog_section_function fun;
2337 size_t local_var_end;
2339 if (!global->isconst || (!global->constval.vfunc))
2341 printf("Invalid state of function-global: not constant: %s\n", global->name);
2345 irfun = global->constval.vfunc;
2347 fun.name = global->code.name;
2348 fun.file = code_cachedstring(global->context.file);
2349 fun.profile = 0; /* always 0 */
2350 fun.nargs = irfun->params_count;
2352 for (i = 0;i < 8; ++i) {
2356 fun.argsize[i] = type_sizeof[irfun->params[i]];
2359 fun.firstlocal = code_globals_elements;
2360 fun.locals = irfun->allocated_locals + irfun->locals_count;
2363 for (i = 0; i < irfun->locals_count; ++i) {
2364 if (!ir_builder_gen_global(ir, irfun->locals[i])) {
2365 printf("Failed to generate global %s\n", irfun->locals[i]->name);
2369 if (irfun->locals_count) {
2370 ir_value *last = irfun->locals[irfun->locals_count-1];
2371 local_var_end = last->code.globaladdr;
2372 local_var_end += type_sizeof[last->vtype];
2374 for (i = 0; i < irfun->values_count; ++i)
2376 /* generate code.globaladdr for ssa values */
2377 ir_value *v = irfun->values[i];
2378 v->code.globaladdr = local_var_end + v->code.local;
2380 for (i = 0; i < irfun->locals_count; ++i) {
2381 /* fill the locals with zeros */
2382 code_globals_add(0);
2386 fun.entry = irfun->builtin;
2388 fun.entry = code_statements_elements;
2389 if (!gen_function_code(irfun)) {
2390 printf("Failed to generate code for function %s\n", irfun->name);
2395 return (code_functions_add(fun) >= 0);
2398 static bool ir_builder_gen_global(ir_builder *self, ir_value *global)
2401 prog_section_def def;
2403 def.type = global->vtype;
2404 def.offset = code_globals_elements;
2405 def.name = global->code.name = code_genstring(global->name);
2407 switch (global->vtype)
2410 if (code_defs_add(def) < 0)
2412 return gen_global_pointer(global);
2414 if (code_defs_add(def) < 0)
2416 return gen_global_field(global);
2421 if (code_defs_add(def) < 0)
2424 if (global->isconst) {
2425 iptr = (int32_t*)&global->constval.vfloat;
2426 global->code.globaladdr = code_globals_add(*iptr);
2428 global->code.globaladdr = code_globals_add(0);
2430 return global->code.globaladdr >= 0;
2434 if (code_defs_add(def) < 0)
2436 if (global->isconst)
2437 global->code.globaladdr = code_globals_add(code_cachedstring(global->constval.vstring));
2439 global->code.globaladdr = code_globals_add(0);
2440 return global->code.globaladdr >= 0;
2443 case TYPE_QUATERNION:
2447 if (code_defs_add(def) < 0)
2450 if (global->isconst) {
2451 iptr = (int32_t*)&global->constval.vvec;
2452 global->code.globaladdr = code_globals_add(iptr[0]);
2453 if (global->code.globaladdr < 0)
2455 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2457 if (code_globals_add(iptr[d]) < 0)
2461 global->code.globaladdr = code_globals_add(0);
2462 if (global->code.globaladdr < 0)
2464 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2466 if (code_globals_add(0) < 0)
2470 return global->code.globaladdr >= 0;
2473 if (code_defs_add(def) < 0)
2475 global->code.globaladdr = code_globals_elements;
2476 code_globals_add(code_functions_elements);
2477 return gen_global_function(self, global);
2479 /* assume biggest type */
2480 global->code.globaladdr = code_globals_add(0);
2481 code_globals_add(0);
2482 code_globals_add(0);
2485 /* refuse to create 'void' type or any other fancy business. */
2486 printf("Invalid type for global variable %s\n", global->name);
2491 bool ir_builder_generate(ir_builder *self, const char *filename)
2497 for (i = 0; i < self->globals_count; ++i)
2499 if (!ir_builder_gen_global(self, self->globals[i])) {
2504 printf("writing '%s'...\n", filename);
2505 return code_write(filename);
2508 /***********************************************************************
2509 *IR DEBUG Dump functions...
2512 #define IND_BUFSZ 1024
2514 const char *qc_opname(int op)
2516 if (op < 0) return "<INVALID>";
2517 if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
2518 return asm_instr[op].m;
2520 case VINSTR_PHI: return "PHI";
2521 case VINSTR_JUMP: return "JUMP";
2522 case VINSTR_COND: return "COND";
2523 default: return "<UNK>";
2527 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
2530 char indent[IND_BUFSZ];
2534 oprintf("module %s\n", b->name);
2535 for (i = 0; i < b->globals_count; ++i)
2538 if (b->globals[i]->isconst)
2539 oprintf("%s = ", b->globals[i]->name);
2540 ir_value_dump(b->globals[i], oprintf);
2543 for (i = 0; i < b->functions_count; ++i)
2544 ir_function_dump(b->functions[i], indent, oprintf);
2545 oprintf("endmodule %s\n", b->name);
2548 void ir_function_dump(ir_function *f, char *ind,
2549 int (*oprintf)(const char*, ...))
2552 if (f->builtin != 0) {
2553 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
2556 oprintf("%sfunction %s\n", ind, f->name);
2557 strncat(ind, "\t", IND_BUFSZ);
2558 if (f->locals_count)
2560 oprintf("%s%i locals:\n", ind, (int)f->locals_count);
2561 for (i = 0; i < f->locals_count; ++i) {
2562 oprintf("%s\t", ind);
2563 ir_value_dump(f->locals[i], oprintf);
2567 if (f->blocks_count)
2569 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
2570 for (i = 0; i < f->blocks_count; ++i) {
2571 if (f->blocks[i]->run_id != f->run_id) {
2572 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
2574 ir_block_dump(f->blocks[i], ind, oprintf);
2578 ind[strlen(ind)-1] = 0;
2579 oprintf("%sendfunction %s\n", ind, f->name);
2582 void ir_block_dump(ir_block* b, char *ind,
2583 int (*oprintf)(const char*, ...))
2586 oprintf("%s:%s\n", ind, b->label);
2587 strncat(ind, "\t", IND_BUFSZ);
2589 for (i = 0; i < b->instr_count; ++i)
2590 ir_instr_dump(b->instr[i], ind, oprintf);
2591 ind[strlen(ind)-1] = 0;
2594 void dump_phi(ir_instr *in, char *ind,
2595 int (*oprintf)(const char*, ...))
2598 oprintf("%s <- phi ", in->_ops[0]->name);
2599 for (i = 0; i < in->phi_count; ++i)
2601 oprintf("([%s] : %s) ", in->phi[i].from->label,
2602 in->phi[i].value->name);
2607 void ir_instr_dump(ir_instr *in, char *ind,
2608 int (*oprintf)(const char*, ...))
2611 const char *comma = NULL;
2613 oprintf("%s (%i) ", ind, (int)in->eid);
2615 if (in->opcode == VINSTR_PHI) {
2616 dump_phi(in, ind, oprintf);
2620 strncat(ind, "\t", IND_BUFSZ);
2622 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
2623 ir_value_dump(in->_ops[0], oprintf);
2624 if (in->_ops[1] || in->_ops[2])
2627 oprintf("%s\t", qc_opname(in->opcode));
2628 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
2629 ir_value_dump(in->_ops[0], oprintf);
2634 for (i = 1; i != 3; ++i) {
2638 ir_value_dump(in->_ops[i], oprintf);
2646 oprintf("[%s]", in->bops[0]->label);
2650 oprintf("%s[%s]", comma, in->bops[1]->label);
2652 ind[strlen(ind)-1] = 0;
2655 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
2664 oprintf("%g", v->constval.vfloat);
2667 oprintf("'%g %g %g'",
2670 v->constval.vvec.z);
2673 oprintf("(entity)");
2676 oprintf("\"%s\"", v->constval.vstring);
2680 oprintf("%i", v->constval.vint);
2685 v->constval.vpointer->name);
2689 oprintf("%s", v->name);
2693 void ir_value_dump_life(ir_value *self, int (*oprintf)(const char*,...))
2696 oprintf("Life of %s:\n", self->name);
2697 for (i = 0; i < self->life_count; ++i)
2699 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);