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 MEM_VEC_FUNCTIONS(ir_value_vector, ir_value*, v)
64 /***********************************************************************
68 ir_builder* ir_builder_new(const char *modulename)
72 self = (ir_builder*)mem_a(sizeof(*self));
76 MEM_VECTOR_INIT(self, functions);
77 MEM_VECTOR_INIT(self, globals);
79 if (!ir_builder_set_name(self, modulename)) {
84 /* globals which always exist */
86 /* for now we give it a vector size */
87 ir_builder_create_global(self, "OFS_RETURN", TYPE_VARIANT);
92 MEM_VEC_FUNCTIONS(ir_builder, ir_value*, globals)
93 MEM_VEC_FUNCTIONS(ir_builder, ir_function*, functions)
95 void ir_builder_delete(ir_builder* self)
98 mem_d((void*)self->name);
99 for (i = 0; i != self->functions_count; ++i) {
100 ir_function_delete(self->functions[i]);
102 MEM_VECTOR_CLEAR(self, functions);
103 for (i = 0; i != self->globals_count; ++i) {
104 ir_value_delete(self->globals[i]);
106 MEM_VECTOR_CLEAR(self, globals);
110 bool ir_builder_set_name(ir_builder *self, const char *name)
113 mem_d((void*)self->name);
114 self->name = util_strdup(name);
118 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
121 for (i = 0; i < self->functions_count; ++i) {
122 if (!strcmp(name, self->functions[i]->name))
123 return self->functions[i];
128 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
130 ir_function *fn = ir_builder_get_function(self, name);
135 fn = ir_function_new(self, outtype);
136 if (!ir_function_set_name(fn, name) ||
137 !ir_builder_functions_add(self, fn) )
139 ir_function_delete(fn);
143 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
145 ir_function_delete(fn);
149 fn->value->isconst = true;
150 fn->value->outtype = outtype;
151 fn->value->constval.vfunc = fn;
152 fn->value->context = fn->context;
157 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
160 for (i = 0; i < self->globals_count; ++i) {
161 if (!strcmp(self->globals[i]->name, name))
162 return self->globals[i];
167 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
169 ir_value *ve = ir_builder_get_global(self, name);
174 ve = ir_value_var(name, store_global, vtype);
175 if (!ir_builder_globals_add(self, ve)) {
182 /***********************************************************************
186 bool ir_function_naive_phi(ir_function*);
187 void ir_function_enumerate(ir_function*);
188 bool ir_function_calculate_liferanges(ir_function*);
189 bool ir_function_allocate_locals(ir_function*);
191 ir_function* ir_function_new(ir_builder* owner, int outtype)
194 self = (ir_function*)mem_a(sizeof(*self));
200 if (!ir_function_set_name(self, "<@unnamed>")) {
205 self->context.file = "<@no context>";
206 self->context.line = 0;
207 self->outtype = outtype;
210 MEM_VECTOR_INIT(self, params);
211 MEM_VECTOR_INIT(self, blocks);
212 MEM_VECTOR_INIT(self, values);
213 MEM_VECTOR_INIT(self, locals);
218 MEM_VEC_FUNCTIONS(ir_function, ir_value*, values)
219 MEM_VEC_FUNCTIONS(ir_function, ir_block*, blocks)
220 MEM_VEC_FUNCTIONS(ir_function, ir_value*, locals)
221 MEM_VEC_FUNCTIONS(ir_function, int, params)
223 bool ir_function_set_name(ir_function *self, const char *name)
226 mem_d((void*)self->name);
227 self->name = util_strdup(name);
231 void ir_function_delete(ir_function *self)
234 mem_d((void*)self->name);
236 for (i = 0; i != self->blocks_count; ++i)
237 ir_block_delete(self->blocks[i]);
238 MEM_VECTOR_CLEAR(self, blocks);
240 MEM_VECTOR_CLEAR(self, params);
242 for (i = 0; i != self->values_count; ++i)
243 ir_value_delete(self->values[i]);
244 MEM_VECTOR_CLEAR(self, values);
246 for (i = 0; i != self->locals_count; ++i)
247 ir_value_delete(self->locals[i]);
248 MEM_VECTOR_CLEAR(self, locals);
250 /* self->value is deleted by the builder */
255 bool GMQCC_WARN ir_function_collect_value(ir_function *self, ir_value *v)
257 return ir_function_values_add(self, v);
260 ir_block* ir_function_create_block(ir_function *self, const char *label)
262 ir_block* bn = ir_block_new(self, label);
263 memcpy(&bn->context, &self->context, sizeof(self->context));
264 if (!ir_function_blocks_add(self, bn)) {
271 bool ir_function_finalize(ir_function *self)
276 if (!ir_function_naive_phi(self))
279 ir_function_enumerate(self);
281 if (!ir_function_calculate_liferanges(self))
284 if (!ir_function_allocate_locals(self))
289 ir_value* ir_function_get_local(ir_function *self, const char *name)
292 for (i = 0; i < self->locals_count; ++i) {
293 if (!strcmp(self->locals[i]->name, name))
294 return self->locals[i];
299 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype)
301 ir_value *ve = ir_function_get_local(self, name);
306 ve = ir_value_var(name, store_local, vtype);
307 if (!ir_function_locals_add(self, ve)) {
314 /***********************************************************************
318 ir_block* ir_block_new(ir_function* owner, const char *name)
321 self = (ir_block*)mem_a(sizeof(*self));
325 memset(self, 0, sizeof(*self));
328 if (!ir_block_set_label(self, name)) {
333 self->context.file = "<@no context>";
334 self->context.line = 0;
336 MEM_VECTOR_INIT(self, instr);
337 MEM_VECTOR_INIT(self, entries);
338 MEM_VECTOR_INIT(self, exits);
341 self->is_return = false;
343 MEM_VECTOR_INIT(self, living);
345 self->generated = false;
349 MEM_VEC_FUNCTIONS(ir_block, ir_instr*, instr)
350 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, entries)
351 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, exits)
352 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_value*, living)
354 void ir_block_delete(ir_block* self)
358 for (i = 0; i != self->instr_count; ++i)
359 ir_instr_delete(self->instr[i]);
360 MEM_VECTOR_CLEAR(self, instr);
361 MEM_VECTOR_CLEAR(self, entries);
362 MEM_VECTOR_CLEAR(self, exits);
363 MEM_VECTOR_CLEAR(self, living);
367 bool ir_block_set_label(ir_block *self, const char *name)
370 mem_d((void*)self->label);
371 self->label = util_strdup(name);
372 return !!self->label;
375 /***********************************************************************
379 ir_instr* ir_instr_new(ir_block* owner, int op)
382 self = (ir_instr*)mem_a(sizeof(*self));
387 self->context.file = "<@no context>";
388 self->context.line = 0;
390 self->_ops[0] = NULL;
391 self->_ops[1] = NULL;
392 self->_ops[2] = NULL;
393 self->bops[0] = NULL;
394 self->bops[1] = NULL;
395 MEM_VECTOR_INIT(self, phi);
396 MEM_VECTOR_INIT(self, params);
401 MEM_VEC_FUNCTIONS(ir_instr, ir_phi_entry_t, phi)
402 MEM_VEC_FUNCTIONS(ir_instr, ir_value*, params)
404 void ir_instr_delete(ir_instr *self)
407 /* The following calls can only delete from
408 * vectors, we still want to delete this instruction
409 * so ignore the return value. Since with the warn_unused_result attribute
410 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
411 * I have to improvise here and use if(foo());
413 for (i = 0; i < self->phi_count; ++i) {
415 if (ir_value_writes_find(self->phi[i].value, self, &idx))
416 if (ir_value_writes_remove(self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
417 if (ir_value_reads_find(self->phi[i].value, self, &idx))
418 if (ir_value_reads_remove (self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
420 MEM_VECTOR_CLEAR(self, phi);
421 for (i = 0; i < self->params_count; ++i) {
423 if (ir_value_writes_find(self->params[i], self, &idx))
424 if (ir_value_writes_remove(self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
425 if (ir_value_reads_find(self->params[i], self, &idx))
426 if (ir_value_reads_remove (self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
428 MEM_VECTOR_CLEAR(self, params);
429 if (ir_instr_op(self, 0, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
430 if (ir_instr_op(self, 1, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
431 if (ir_instr_op(self, 2, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
435 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
437 if (self->_ops[op]) {
439 if (writing && ir_value_writes_find(self->_ops[op], self, &idx))
441 if (!ir_value_writes_remove(self->_ops[op], idx))
444 else if (ir_value_reads_find(self->_ops[op], self, &idx))
446 if (!ir_value_reads_remove(self->_ops[op], idx))
452 if (!ir_value_writes_add(v, self))
455 if (!ir_value_reads_add(v, self))
463 /***********************************************************************
467 ir_value* ir_value_var(const char *name, int storetype, int vtype)
470 self = (ir_value*)mem_a(sizeof(*self));
472 self->fieldtype = TYPE_VOID;
473 self->outtype = TYPE_VOID;
474 self->store = storetype;
475 MEM_VECTOR_INIT(self, reads);
476 MEM_VECTOR_INIT(self, writes);
477 self->isconst = false;
478 self->context.file = "<@no context>";
479 self->context.line = 0;
481 ir_value_set_name(self, name);
483 memset(&self->constval, 0, sizeof(self->constval));
484 memset(&self->code, 0, sizeof(self->code));
486 MEM_VECTOR_INIT(self, life);
489 MEM_VEC_FUNCTIONS(ir_value, ir_life_entry_t, life)
490 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, reads)
491 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, writes)
493 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
495 ir_value *v = ir_value_var(name, storetype, vtype);
498 if (!ir_function_collect_value(owner, v))
506 void ir_value_delete(ir_value* self)
509 mem_d((void*)self->name);
512 if (self->vtype == TYPE_STRING)
513 mem_d((void*)self->constval.vstring);
515 MEM_VECTOR_CLEAR(self, reads);
516 MEM_VECTOR_CLEAR(self, writes);
517 MEM_VECTOR_CLEAR(self, life);
521 void ir_value_set_name(ir_value *self, const char *name)
524 mem_d((void*)self->name);
525 self->name = util_strdup(name);
528 bool ir_value_set_float(ir_value *self, float f)
530 if (self->vtype != TYPE_FLOAT)
532 self->constval.vfloat = f;
533 self->isconst = true;
537 bool ir_value_set_func(ir_value *self, int f)
539 if (self->vtype != TYPE_FUNCTION)
541 self->constval.vint = f;
542 self->isconst = true;
546 bool ir_value_set_vector(ir_value *self, vector v)
548 if (self->vtype != TYPE_VECTOR)
550 self->constval.vvec = v;
551 self->isconst = true;
555 bool ir_value_set_string(ir_value *self, const char *str)
557 if (self->vtype != TYPE_STRING)
559 self->constval.vstring = util_strdup(str);
560 self->isconst = true;
565 bool ir_value_set_int(ir_value *self, int i)
567 if (self->vtype != TYPE_INTEGER)
569 self->constval.vint = i;
570 self->isconst = true;
575 bool ir_value_lives(ir_value *self, size_t at)
578 for (i = 0; i < self->life_count; ++i)
580 ir_life_entry_t *life = &self->life[i];
581 if (life->start <= at && at <= life->end)
583 if (life->start > at) /* since it's ordered */
589 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
592 if (!ir_value_life_add(self, e)) /* naive... */
594 for (k = self->life_count-1; k > idx; --k)
595 self->life[k] = self->life[k-1];
600 bool ir_value_life_merge(ir_value *self, size_t s)
603 ir_life_entry_t *life = NULL;
604 ir_life_entry_t *before = NULL;
605 ir_life_entry_t new_entry;
607 /* Find the first range >= s */
608 for (i = 0; i < self->life_count; ++i)
611 life = &self->life[i];
615 /* nothing found? append */
616 if (i == self->life_count) {
618 if (life && life->end+1 == s)
620 /* previous life range can be merged in */
624 if (life && life->end >= s)
627 if (!ir_value_life_add(self, e))
628 return false; /* failing */
634 if (before->end + 1 == s &&
635 life->start - 1 == s)
638 before->end = life->end;
639 if (!ir_value_life_remove(self, i))
640 return false; /* failing */
643 if (before->end + 1 == s)
649 /* already contained */
650 if (before->end >= s)
654 if (life->start - 1 == s)
659 /* insert a new entry */
660 new_entry.start = new_entry.end = s;
661 return ir_value_life_insert(self, i, new_entry);
664 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
668 if (!other->life_count)
671 if (!self->life_count) {
672 for (i = 0; i < other->life_count; ++i) {
673 if (!ir_value_life_add(self, other->life[i]))
680 for (i = 0; i < other->life_count; ++i)
682 const ir_life_entry_t *life = &other->life[i];
685 ir_life_entry_t *entry = &self->life[myi];
687 if (life->end+1 < entry->start)
689 /* adding an interval before entry */
690 if (!ir_value_life_insert(self, myi, *life))
696 if (life->start < entry->start &&
697 life->end >= entry->start)
699 /* starts earlier and overlaps */
700 entry->start = life->start;
703 if (life->end > entry->end &&
704 life->start-1 <= entry->end)
706 /* ends later and overlaps */
707 entry->end = life->end;
710 /* see if our change combines it with the next ranges */
711 while (myi+1 < self->life_count &&
712 entry->end+1 >= self->life[1+myi].start)
714 /* overlaps with (myi+1) */
715 if (entry->end < self->life[1+myi].end)
716 entry->end = self->life[1+myi].end;
717 if (!ir_value_life_remove(self, myi+1))
719 entry = &self->life[myi];
722 /* see if we're after the entry */
723 if (life->start > entry->end)
726 /* append if we're at the end */
727 if (myi >= self->life_count) {
728 if (!ir_value_life_add(self, *life))
732 /* otherweise check the next range */
741 bool ir_values_overlap(const ir_value *a, const ir_value *b)
743 /* For any life entry in A see if it overlaps with
744 * any life entry in B.
745 * Note that the life entries are orderes, so we can make a
746 * more efficient algorithm there than naively translating the
750 ir_life_entry_t *la, *lb, *enda, *endb;
752 /* first of all, if either has no life range, they cannot clash */
753 if (!a->life_count || !b->life_count)
758 enda = la + a->life_count;
759 endb = lb + b->life_count;
762 /* check if the entries overlap, for that,
763 * both must start before the other one ends.
765 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
766 if (la->start <= lb->end &&
767 lb->start <= la->end)
769 if (la->start < lb->end &&
776 /* entries are ordered
777 * one entry is earlier than the other
778 * that earlier entry will be moved forward
780 if (la->start < lb->start)
782 /* order: A B, move A forward
783 * check if we hit the end with A
788 else if (lb->start < la->start)
790 /* order: B A, move B forward
791 * check if we hit the end with B
800 /***********************************************************************
804 bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
806 if (target->store == store_value) {
807 fprintf(stderr, "cannot store to an SSA value\n");
808 fprintf(stderr, "trying to store: %s <- %s\n", target->name, what->name);
811 ir_instr *in = ir_instr_new(self, op);
814 if (!ir_instr_op(in, 0, target, true) ||
815 !ir_instr_op(in, 1, what, false) ||
816 !ir_block_instr_add(self, in) )
824 bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
828 if (target->vtype == TYPE_VARIANT)
831 vtype = target->vtype;
836 if (what->vtype == TYPE_INTEGER)
837 op = INSTR_CONV_ITOF;
846 op = INSTR_STORE_ENT;
852 op = INSTR_STORE_FLD;
856 if (what->vtype == TYPE_INTEGER)
857 op = INSTR_CONV_FTOI;
866 op = INSTR_STORE_ENT;
873 return ir_block_create_store_op(self, op, target, what);
876 bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
881 if (target->vtype != TYPE_POINTER)
884 /* storing using pointer - target is a pointer, type must be
885 * inferred from source
897 op = INSTR_STOREP_ENT;
903 op = INSTR_STOREP_FLD;
914 op = INSTR_STOREP_ENT;
921 return ir_block_create_store_op(self, op, target, what);
924 bool ir_block_create_return(ir_block *self, ir_value *v)
928 fprintf(stderr, "block already ended (%s)\n", self->label);
932 self->is_return = true;
933 in = ir_instr_new(self, INSTR_RETURN);
937 if (!ir_instr_op(in, 0, v, false) ||
938 !ir_block_instr_add(self, in) )
945 bool ir_block_create_if(ir_block *self, ir_value *v,
946 ir_block *ontrue, ir_block *onfalse)
950 fprintf(stderr, "block already ended (%s)\n", self->label);
954 /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
955 in = ir_instr_new(self, VINSTR_COND);
959 if (!ir_instr_op(in, 0, v, false)) {
964 in->bops[0] = ontrue;
965 in->bops[1] = onfalse;
967 if (!ir_block_instr_add(self, in))
970 if (!ir_block_exits_add(self, ontrue) ||
971 !ir_block_exits_add(self, onfalse) ||
972 !ir_block_entries_add(ontrue, self) ||
973 !ir_block_entries_add(onfalse, self) )
980 bool ir_block_create_jump(ir_block *self, ir_block *to)
984 fprintf(stderr, "block already ended (%s)\n", self->label);
988 in = ir_instr_new(self, VINSTR_JUMP);
993 if (!ir_block_instr_add(self, in))
996 if (!ir_block_exits_add(self, to) ||
997 !ir_block_entries_add(to, self) )
1004 bool ir_block_create_goto(ir_block *self, ir_block *to)
1008 fprintf(stderr, "block already ended (%s)\n", self->label);
1012 in = ir_instr_new(self, INSTR_GOTO);
1017 if (!ir_block_instr_add(self, in))
1020 if (!ir_block_exits_add(self, to) ||
1021 !ir_block_entries_add(to, self) )
1028 ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
1032 in = ir_instr_new(self, VINSTR_PHI);
1035 out = ir_value_out(self->owner, label, store_value, ot);
1037 ir_instr_delete(in);
1040 if (!ir_instr_op(in, 0, out, true)) {
1041 ir_instr_delete(in);
1042 ir_value_delete(out);
1045 if (!ir_block_instr_add(self, in)) {
1046 ir_instr_delete(in);
1047 ir_value_delete(out);
1053 ir_value* ir_phi_value(ir_instr *self)
1055 return self->_ops[0];
1058 bool ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1062 if (!ir_block_entries_find(self->owner, b, NULL)) {
1063 /* Must not be possible to cause this, otherwise the AST
1064 * is doing something wrong.
1066 fprintf(stderr, "Invalid entry block for PHI\n");
1072 if (!ir_value_reads_add(v, self))
1074 return ir_instr_phi_add(self, pe);
1077 /* call related code */
1078 ir_instr* ir_block_create_call(ir_block *self, const char *label, ir_value *func)
1082 in = ir_instr_new(self, INSTR_CALL0);
1085 out = ir_value_out(self->owner, label, store_return, func->outtype);
1087 ir_instr_delete(in);
1090 if (!ir_instr_op(in, 0, out, true) ||
1091 !ir_instr_op(in, 1, func, false) ||
1092 !ir_block_instr_add(self, in))
1094 ir_instr_delete(in);
1095 ir_value_delete(out);
1101 ir_value* ir_call_value(ir_instr *self)
1103 return self->_ops[0];
1106 bool ir_call_param(ir_instr* self, ir_value *v)
1108 if (!ir_instr_params_add(self, v))
1110 if (!ir_value_reads_add(v, self)) {
1111 if (!ir_instr_params_remove(self, self->params_count-1))
1112 GMQCC_SUPPRESS_EMPTY_BODY;
1118 /* binary op related code */
1120 ir_value* ir_block_create_binop(ir_block *self,
1121 const char *label, int opcode,
1122 ir_value *left, ir_value *right)
1144 case INSTR_SUB_S: /* -- offset of string as float */
1149 case INSTR_BITOR_IF:
1150 case INSTR_BITOR_FI:
1151 case INSTR_BITAND_FI:
1152 case INSTR_BITAND_IF:
1167 case INSTR_BITAND_I:
1170 case INSTR_RSHIFT_I:
1171 case INSTR_LSHIFT_I:
1193 /* boolean operations result in floats */
1194 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1196 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1199 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1204 if (ot == TYPE_VOID) {
1205 /* The AST or parser were supposed to check this! */
1209 return ir_block_create_general_instr(self, label, opcode, left, right, ot);
1212 ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
1213 int op, ir_value *a, ir_value *b, int outype)
1218 out = ir_value_out(self->owner, label, store_value, outype);
1222 instr = ir_instr_new(self, op);
1224 ir_value_delete(out);
1228 if (!ir_instr_op(instr, 0, out, true) ||
1229 !ir_instr_op(instr, 1, a, false) ||
1230 !ir_instr_op(instr, 2, b, false) )
1235 if (!ir_block_instr_add(self, instr))
1240 ir_instr_delete(instr);
1241 ir_value_delete(out);
1245 ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
1247 /* Support for various pointer types todo if so desired */
1248 if (ent->vtype != TYPE_ENTITY)
1251 if (field->vtype != TYPE_FIELD)
1254 return ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1257 ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
1260 if (ent->vtype != TYPE_ENTITY)
1263 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1264 if (field->vtype != TYPE_FIELD)
1269 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1270 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1271 case TYPE_STRING: op = INSTR_LOAD_S; break;
1272 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1273 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1275 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1276 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1282 return ir_block_create_general_instr(self, label, op, ent, field, outype);
1285 ir_value* ir_block_create_add(ir_block *self,
1287 ir_value *left, ir_value *right)
1290 int l = left->vtype;
1291 int r = right->vtype;
1310 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1312 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1318 return ir_block_create_binop(self, label, op, left, right);
1321 ir_value* ir_block_create_sub(ir_block *self,
1323 ir_value *left, ir_value *right)
1326 int l = left->vtype;
1327 int r = right->vtype;
1347 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1349 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1355 return ir_block_create_binop(self, label, op, left, right);
1358 ir_value* ir_block_create_mul(ir_block *self,
1360 ir_value *left, ir_value *right)
1363 int l = left->vtype;
1364 int r = right->vtype;
1383 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1385 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1388 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1390 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1392 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1394 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1400 return ir_block_create_binop(self, label, op, left, right);
1403 ir_value* ir_block_create_div(ir_block *self,
1405 ir_value *left, ir_value *right)
1408 int l = left->vtype;
1409 int r = right->vtype;
1426 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1428 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1430 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1436 return ir_block_create_binop(self, label, op, left, right);
1439 /* PHI resolving breaks the SSA, and must thus be the last
1440 * step before life-range calculation.
1443 static bool ir_block_naive_phi(ir_block *self);
1444 bool ir_function_naive_phi(ir_function *self)
1448 for (i = 0; i < self->blocks_count; ++i)
1450 if (!ir_block_naive_phi(self->blocks[i]))
1456 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1461 /* create a store */
1462 if (!ir_block_create_store(block, old, what))
1465 /* we now move it up */
1466 instr = block->instr[block->instr_count-1];
1467 for (i = block->instr_count; i > iid; --i)
1468 block->instr[i] = block->instr[i-1];
1469 block->instr[i] = instr;
1474 static bool ir_block_naive_phi(ir_block *self)
1477 /* FIXME: optionally, create_phi can add the phis
1478 * to a list so we don't need to loop through blocks
1479 * - anyway: "don't optimize YET"
1481 for (i = 0; i < self->instr_count; ++i)
1483 ir_instr *instr = self->instr[i];
1484 if (instr->opcode != VINSTR_PHI)
1487 if (!ir_block_instr_remove(self, i))
1489 --i; /* NOTE: i+1 below */
1491 for (p = 0; p < instr->phi_count; ++p)
1493 ir_value *v = instr->phi[p].value;
1494 for (w = 0; w < v->writes_count; ++w) {
1497 if (!v->writes[w]->_ops[0])
1500 /* When the write was to a global, we have to emit a mov */
1501 old = v->writes[w]->_ops[0];
1503 /* The original instruction now writes to the PHI target local */
1504 if (v->writes[w]->_ops[0] == v)
1505 v->writes[w]->_ops[0] = instr->_ops[0];
1507 if (old->store != store_value && old->store != store_local)
1509 /* If it originally wrote to a global we need to store the value
1512 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1514 if (i+1 < self->instr_count)
1515 instr = self->instr[i+1];
1518 /* In case I forget and access instr later, it'll be NULL
1519 * when it's a problem, to make sure we crash, rather than accessing
1525 /* If it didn't, we can replace all reads by the phi target now. */
1527 for (r = 0; r < old->reads_count; ++r)
1530 ir_instr *ri = old->reads[r];
1531 for (op = 0; op < ri->phi_count; ++op) {
1532 if (ri->phi[op].value == old)
1533 ri->phi[op].value = v;
1535 for (op = 0; op < 3; ++op) {
1536 if (ri->_ops[op] == old)
1543 ir_instr_delete(instr);
1548 /***********************************************************************
1549 *IR Temp allocation code
1550 * Propagating value life ranges by walking through the function backwards
1551 * until no more changes are made.
1552 * In theory this should happen once more than once for every nested loop
1554 * Though this implementation might run an additional time for if nests.
1563 MEM_VEC_FUNCTIONS_ALL(new_reads_t, ir_value*, v)
1565 /* Enumerate instructions used by value's life-ranges
1567 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1571 for (i = 0; i < self->instr_count; ++i)
1573 self->instr[i]->eid = eid++;
1578 /* Enumerate blocks and instructions.
1579 * The block-enumeration is unordered!
1580 * We do not really use the block enumreation, however
1581 * the instruction enumeration is important for life-ranges.
1583 void ir_function_enumerate(ir_function *self)
1586 size_t instruction_id = 0;
1587 for (i = 0; i < self->blocks_count; ++i)
1589 self->blocks[i]->eid = i;
1590 self->blocks[i]->run_id = 0;
1591 ir_block_enumerate(self->blocks[i], &instruction_id);
1595 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
1596 bool ir_function_calculate_liferanges(ir_function *self)
1604 for (i = 0; i != self->blocks_count; ++i)
1606 if (self->blocks[i]->is_return)
1608 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
1616 /* Local-value allocator
1617 * After finishing creating the liferange of all values used in a function
1618 * we can allocate their global-positions.
1619 * This is the counterpart to register-allocation in register machines.
1622 MEM_VECTOR_MAKE(ir_value*, locals);
1623 MEM_VECTOR_MAKE(size_t, sizes);
1624 MEM_VECTOR_MAKE(size_t, positions);
1625 } function_allocator;
1626 MEM_VEC_FUNCTIONS(function_allocator, ir_value*, locals)
1627 MEM_VEC_FUNCTIONS(function_allocator, size_t, sizes)
1628 MEM_VEC_FUNCTIONS(function_allocator, size_t, positions)
1630 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
1633 size_t vsize = type_sizeof[var->vtype];
1635 slot = ir_value_var("reg", store_global, var->vtype);
1639 if (!ir_value_life_merge_into(slot, var))
1642 if (!function_allocator_locals_add(alloc, slot))
1645 if (!function_allocator_sizes_add(alloc, vsize))
1651 ir_value_delete(slot);
1655 bool ir_function_allocate_locals(ir_function *self)
1664 function_allocator alloc;
1666 if (!self->locals_count)
1669 MEM_VECTOR_INIT(&alloc, locals);
1670 MEM_VECTOR_INIT(&alloc, sizes);
1671 MEM_VECTOR_INIT(&alloc, positions);
1673 for (i = 0; i < self->locals_count; ++i)
1675 if (!function_allocator_alloc(&alloc, self->locals[i]))
1679 /* Allocate a slot for any value that still exists */
1680 for (i = 0; i < self->values_count; ++i)
1682 v = self->values[i];
1687 for (a = 0; a < alloc.locals_count; ++a)
1689 slot = alloc.locals[a];
1691 if (ir_values_overlap(v, slot))
1694 if (!ir_value_life_merge_into(slot, v))
1697 /* adjust size for this slot */
1698 if (alloc.sizes[a] < type_sizeof[v->vtype])
1699 alloc.sizes[a] = type_sizeof[v->vtype];
1701 self->values[i]->code.local = a;
1704 if (a >= alloc.locals_count) {
1705 self->values[i]->code.local = alloc.locals_count;
1706 if (!function_allocator_alloc(&alloc, v))
1711 /* Adjust slot positions based on sizes */
1712 if (!function_allocator_positions_add(&alloc, 0))
1715 if (alloc.sizes_count)
1716 pos = alloc.positions[0] + alloc.sizes[0];
1719 for (i = 1; i < alloc.sizes_count; ++i)
1721 pos = alloc.positions[i-1] + alloc.sizes[i-1];
1722 if (!function_allocator_positions_add(&alloc, pos))
1726 self->allocated_locals = pos + alloc.sizes[alloc.sizes_count-1];
1728 /* Take over the actual slot positions */
1729 for (i = 0; i < self->values_count; ++i)
1730 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
1737 for (i = 0; i < alloc.locals_count; ++i)
1738 ir_value_delete(alloc.locals[i]);
1739 MEM_VECTOR_CLEAR(&alloc, locals);
1740 MEM_VECTOR_CLEAR(&alloc, sizes);
1741 MEM_VECTOR_CLEAR(&alloc, positions);
1745 /* Get information about which operand
1746 * is read from, or written to.
1748 static void ir_op_read_write(int op, size_t *read, size_t *write)
1775 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
1778 bool changed = false;
1780 for (i = 0; i != self->living_count; ++i)
1782 tempbool = ir_value_life_merge(self->living[i], eid);
1785 fprintf(stderr, "block_living_add_instr() value instruction added %s: %i\n", self->living[i]->_name, (int)eid);
1787 changed = changed || tempbool;
1792 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
1795 /* values which have been read in a previous iteration are now
1796 * in the "living" array even if the previous block doesn't use them.
1797 * So we have to remove whatever does not exist in the previous block.
1798 * They will be re-added on-read, but the liferange merge won't cause
1801 for (i = 0; i < self->living_count; ++i)
1803 if (!ir_block_living_find(prev, self->living[i], NULL)) {
1804 if (!ir_block_living_remove(self, i))
1810 /* Whatever the previous block still has in its living set
1811 * must now be added to ours as well.
1813 for (i = 0; i < prev->living_count; ++i)
1815 if (ir_block_living_find(self, prev->living[i], NULL))
1817 if (!ir_block_living_add(self, prev->living[i]))
1820 printf("%s got from prev: %s\n", self->label, prev->living[i]->_name);
1826 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
1832 /* bitmasks which operands are read from or written to */
1834 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1836 new_reads_t new_reads;
1838 char dbg_ind[16] = { '#', '0' };
1841 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1842 MEM_VECTOR_INIT(&new_reads, v);
1847 if (!ir_block_life_prop_previous(self, prev, changed))
1851 i = self->instr_count;
1854 instr = self->instr[i];
1856 /* PHI operands are always read operands */
1857 for (p = 0; p < instr->phi_count; ++p)
1859 value = instr->phi[p].value;
1860 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1861 if (!ir_block_living_find(self, value, NULL) &&
1862 !ir_block_living_add(self, value))
1867 if (!new_reads_t_v_find(&new_reads, value, NULL))
1869 if (!new_reads_t_v_add(&new_reads, value))
1875 /* See which operands are read and write operands */
1876 ir_op_read_write(instr->opcode, &read, &write);
1878 /* Go through the 3 main operands */
1879 for (o = 0; o < 3; ++o)
1881 if (!instr->_ops[o]) /* no such operand */
1884 value = instr->_ops[o];
1886 /* We only care about locals */
1887 if (value->store != store_value &&
1888 value->store != store_local)
1894 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1895 if (!ir_block_living_find(self, value, NULL) &&
1896 !ir_block_living_add(self, value))
1901 /* fprintf(stderr, "read: %s\n", value->_name); */
1902 if (!new_reads_t_v_find(&new_reads, value, NULL))
1904 if (!new_reads_t_v_add(&new_reads, value))
1910 /* write operands */
1911 /* When we write to a local, we consider it "dead" for the
1912 * remaining upper part of the function, since in SSA a value
1913 * can only be written once (== created)
1918 bool in_living = ir_block_living_find(self, value, &idx);
1919 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1921 bool in_reads = new_reads_t_v_find(&new_reads, value, &readidx);
1922 if (!in_living && !in_reads)
1927 /* If the value isn't alive it hasn't been read before... */
1928 /* TODO: See if the warning can be emitted during parsing or AST processing
1929 * otherwise have warning printed here.
1930 * IF printing a warning here: include filecontext_t,
1931 * and make sure it's only printed once
1932 * since this function is run multiple times.
1934 /* For now: debug info: */
1935 fprintf(stderr, "Value only written %s\n", value->name);
1936 tempbool = ir_value_life_merge(value, instr->eid);
1937 *changed = *changed || tempbool;
1939 ir_instr_dump(instr, dbg_ind, printf);
1943 /* since 'living' won't contain it
1944 * anymore, merge the value, since
1947 tempbool = ir_value_life_merge(value, instr->eid);
1950 fprintf(stderr, "value added id %s %i\n", value->name, (int)instr->eid);
1952 *changed = *changed || tempbool;
1954 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1955 if (!ir_block_living_remove(self, idx))
1960 if (!new_reads_t_v_remove(&new_reads, readidx))
1968 tempbool = ir_block_living_add_instr(self, instr->eid);
1969 /*fprintf(stderr, "living added values\n");*/
1970 *changed = *changed || tempbool;
1972 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1974 for (rd = 0; rd < new_reads.v_count; ++rd)
1976 if (!ir_block_living_find(self, new_reads.v[rd], NULL)) {
1977 if (!ir_block_living_add(self, new_reads.v[rd]))
1980 if (!i && !self->entries_count) {
1982 *changed = *changed || ir_value_life_merge(new_reads.v[rd], instr->eid);
1985 MEM_VECTOR_CLEAR(&new_reads, v);
1989 if (self->run_id == self->owner->run_id)
1992 self->run_id = self->owner->run_id;
1994 for (i = 0; i < self->entries_count; ++i)
1996 ir_block *entry = self->entries[i];
1997 ir_block_life_propagate(entry, self, changed);
2002 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
2003 MEM_VECTOR_CLEAR(&new_reads, v);
2008 /***********************************************************************
2011 * Since the IR has the convention of putting 'write' operands
2012 * at the beginning, we have to rotate the operands of instructions
2013 * properly in order to generate valid QCVM code.
2015 * Having destinations at a fixed position is more convenient. In QC
2016 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2017 * read from from OPA, and store to OPB rather than OPC. Which is
2018 * partially the reason why the implementation of these instructions
2019 * in darkplaces has been delayed for so long.
2021 * Breaking conventions is annoying...
2023 static bool ir_builder_gen_global(ir_builder *self, ir_value *global);
2025 static bool gen_global_field(ir_value *global)
2027 if (global->isconst)
2029 ir_value *fld = global->constval.vpointer;
2031 printf("Invalid field constant with no field: %s\n", global->name);
2035 /* Now, in this case, a relocation would be impossible to code
2036 * since it looks like this:
2037 * .vector v = origin; <- parse error, wtf is 'origin'?
2040 * But we will need a general relocation support later anyway
2041 * for functions... might as well support that here.
2043 if (!fld->code.globaladdr) {
2044 printf("FIXME: Relocation support\n");
2048 /* copy the field's value */
2049 global->code.globaladdr = code_globals_add(code_globals_data[fld->code.globaladdr]);
2053 prog_section_field fld;
2055 fld.name = global->code.name;
2056 fld.offset = code_fields_elements;
2057 fld.type = global->fieldtype;
2059 if (fld.type == TYPE_VOID) {
2060 printf("Field is missing a type: %s\n", global->name);
2064 if (code_fields_add(fld) < 0)
2067 global->code.globaladdr = code_globals_add(fld.offset);
2069 if (global->code.globaladdr < 0)
2074 static bool gen_global_pointer(ir_value *global)
2076 if (global->isconst)
2078 ir_value *target = global->constval.vpointer;
2080 printf("Invalid pointer constant: %s\n", global->name);
2081 /* NULL pointers are pointing to the NULL constant, which also
2082 * sits at address 0, but still has an ir_value for itself.
2087 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2088 * void() foo; <- proto
2089 * void() *fooptr = &foo;
2090 * void() foo = { code }
2092 if (!target->code.globaladdr) {
2093 /* FIXME: Check for the constant nullptr ir_value!
2094 * because then code.globaladdr being 0 is valid.
2096 printf("FIXME: Relocation support\n");
2100 global->code.globaladdr = code_globals_add(target->code.globaladdr);
2104 global->code.globaladdr = code_globals_add(0);
2106 if (global->code.globaladdr < 0)
2111 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2113 prog_section_statement stmt;
2122 block->generated = true;
2123 block->code_start = code_statements_elements;
2124 for (i = 0; i < block->instr_count; ++i)
2126 instr = block->instr[i];
2128 if (instr->opcode == VINSTR_PHI) {
2129 printf("cannot generate virtual instruction (phi)\n");
2133 if (instr->opcode == VINSTR_JUMP) {
2134 target = instr->bops[0];
2135 /* for uncoditional jumps, if the target hasn't been generated
2136 * yet, we generate them right here.
2138 if (!target->generated) {
2143 /* otherwise we generate a jump instruction */
2144 stmt.opcode = INSTR_GOTO;
2145 stmt.o1.s1 = (target->code_start) - code_statements_elements;
2148 if (code_statements_add(stmt) < 0)
2151 /* no further instructions can be in this block */
2155 if (instr->opcode == VINSTR_COND) {
2156 ontrue = instr->bops[0];
2157 onfalse = instr->bops[1];
2158 /* TODO: have the AST signal which block should
2159 * come first: eg. optimize IFs without ELSE...
2162 stmt.o1.u1 = instr->_ops[0]->code.globaladdr;
2166 if (ontrue->generated) {
2167 stmt.opcode = INSTR_IF;
2168 stmt.o2.s1 = (ontrue->code_start-1) - code_statements_elements;
2169 if (code_statements_add(stmt) < 0)
2172 if (onfalse->generated) {
2173 stmt.opcode = INSTR_IFNOT;
2174 stmt.o2.s1 = (onfalse->code_start-1) - code_statements_elements;
2175 if (code_statements_add(stmt) < 0)
2178 if (!ontrue->generated) {
2179 if (onfalse->generated) {
2184 if (!onfalse->generated) {
2185 if (ontrue->generated) {
2190 /* neither ontrue nor onfalse exist */
2191 stmt.opcode = INSTR_IFNOT;
2192 stidx = code_statements_elements;
2193 if (code_statements_add(stmt) < 0)
2195 /* on false we jump, so add ontrue-path */
2196 if (!gen_blocks_recursive(func, ontrue))
2198 /* fixup the jump address */
2199 code_statements_data[stidx].o2.s1 = code_statements_elements - stidx;
2200 /* generate onfalse path */
2201 if (onfalse->generated) {
2202 /* fixup the jump address */
2203 code_statements_data[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2204 /* may have been generated in the previous recursive call */
2205 stmt.opcode = INSTR_GOTO;
2206 stmt.o1.s1 = (onfalse->code_start) - code_statements_elements;
2209 return (code_statements_add(stmt) >= 0);
2211 /* if not, generate now */
2216 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2217 /* Trivial call translation:
2218 * copy all params to OFS_PARM*
2219 * if the output's storetype is not store_return,
2220 * add append a STORE instruction!
2222 * NOTES on how to do it better without much trouble:
2223 * -) The liferanges!
2224 * Simply check the liferange of all parameters for
2225 * other CALLs. For each param with no CALL in its
2226 * liferange, we can store it in an OFS_PARM at
2227 * generation already. This would even include later
2228 * reuse.... probably... :)
2233 for (p = 0; p < instr->params_count; ++p)
2235 ir_value *param = instr->params[p];
2237 stmt.opcode = INSTR_STORE_F;
2240 stmt.opcode = type_store_instr[param->vtype];
2241 stmt.o1.u1 = param->code.globaladdr;
2242 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2243 if (code_statements_add(stmt) < 0)
2246 stmt.opcode = INSTR_CALL0 + instr->params_count;
2247 if (stmt.opcode > INSTR_CALL8)
2248 stmt.opcode = INSTR_CALL8;
2249 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2252 if (code_statements_add(stmt) < 0)
2255 retvalue = instr->_ops[0];
2256 if (retvalue && retvalue->store != store_return && retvalue->life_count)
2258 /* not to be kept in OFS_RETURN */
2259 stmt.opcode = type_store_instr[retvalue->vtype];
2260 stmt.o1.u1 = OFS_RETURN;
2261 stmt.o2.u1 = retvalue->code.globaladdr;
2263 if (code_statements_add(stmt) < 0)
2269 if (instr->opcode == INSTR_STATE) {
2270 printf("TODO: state instruction\n");
2274 stmt.opcode = instr->opcode;
2279 /* This is the general order of operands */
2281 stmt.o3.u1 = instr->_ops[0]->code.globaladdr;
2284 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2287 stmt.o2.u1 = instr->_ops[2]->code.globaladdr;
2289 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2291 stmt.o1.u1 = stmt.o3.u1;
2294 else if ((stmt.opcode >= INSTR_STORE_F &&
2295 stmt.opcode <= INSTR_STORE_FNC) ||
2296 (stmt.opcode >= INSTR_NOT_F &&
2297 stmt.opcode <= INSTR_NOT_FNC))
2299 /* 2-operand instructions with A -> B */
2300 stmt.o2.u1 = stmt.o3.u1;
2304 if (code_statements_add(stmt) < 0)
2310 static bool gen_function_code(ir_function *self)
2313 prog_section_statement stmt;
2315 /* Starting from entry point, we generate blocks "as they come"
2316 * for now. Dead blocks will not be translated obviously.
2318 if (!self->blocks_count) {
2319 printf("Function '%s' declared without body.\n", self->name);
2323 block = self->blocks[0];
2324 if (block->generated)
2327 if (!gen_blocks_recursive(self, block)) {
2328 printf("failed to generate blocks for '%s'\n", self->name);
2332 /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
2333 stmt.opcode = AINSTR_END;
2337 if (code_statements_add(stmt) < 0)
2342 static bool gen_global_function(ir_builder *ir, ir_value *global)
2344 prog_section_function fun;
2348 size_t local_var_end;
2350 if (!global->isconst || (!global->constval.vfunc))
2352 printf("Invalid state of function-global: not constant: %s\n", global->name);
2356 irfun = global->constval.vfunc;
2358 fun.name = global->code.name;
2359 fun.file = code_cachedstring(global->context.file);
2360 fun.profile = 0; /* always 0 */
2361 fun.nargs = irfun->params_count;
2363 for (i = 0;i < 8; ++i) {
2367 fun.argsize[i] = type_sizeof[irfun->params[i]];
2370 fun.firstlocal = code_globals_elements;
2371 fun.locals = irfun->allocated_locals + irfun->locals_count;
2374 for (i = 0; i < irfun->locals_count; ++i) {
2375 if (!ir_builder_gen_global(ir, irfun->locals[i])) {
2376 printf("Failed to generate global %s\n", irfun->locals[i]->name);
2380 if (irfun->locals_count) {
2381 ir_value *last = irfun->locals[irfun->locals_count-1];
2382 local_var_end = last->code.globaladdr;
2383 local_var_end += type_sizeof[last->vtype];
2385 for (i = 0; i < irfun->values_count; ++i)
2387 /* generate code.globaladdr for ssa values */
2388 ir_value *v = irfun->values[i];
2389 v->code.globaladdr = local_var_end + v->code.local;
2391 for (i = 0; i < irfun->locals_count; ++i) {
2392 /* fill the locals with zeros */
2393 code_globals_add(0);
2397 fun.entry = irfun->builtin;
2399 fun.entry = code_statements_elements;
2400 if (!gen_function_code(irfun)) {
2401 printf("Failed to generate code for function %s\n", irfun->name);
2406 return (code_functions_add(fun) >= 0);
2409 static bool ir_builder_gen_global(ir_builder *self, ir_value *global)
2412 prog_section_def def;
2414 def.type = global->vtype;
2415 def.offset = code_globals_elements;
2416 def.name = global->code.name = code_genstring(global->name);
2418 switch (global->vtype)
2421 if (code_defs_add(def) < 0)
2423 return gen_global_pointer(global);
2425 if (code_defs_add(def) < 0)
2427 return gen_global_field(global);
2432 if (code_defs_add(def) < 0)
2435 if (global->isconst) {
2436 iptr = (int32_t*)&global->constval.vfloat;
2437 global->code.globaladdr = code_globals_add(*iptr);
2439 global->code.globaladdr = code_globals_add(0);
2441 return global->code.globaladdr >= 0;
2445 if (code_defs_add(def) < 0)
2447 if (global->isconst)
2448 global->code.globaladdr = code_globals_add(code_cachedstring(global->constval.vstring));
2450 global->code.globaladdr = code_globals_add(0);
2451 return global->code.globaladdr >= 0;
2456 if (code_defs_add(def) < 0)
2459 if (global->isconst) {
2460 iptr = (int32_t*)&global->constval.vvec;
2461 global->code.globaladdr = code_globals_add(iptr[0]);
2462 if (global->code.globaladdr < 0)
2464 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2466 if (code_globals_add(iptr[d]) < 0)
2470 global->code.globaladdr = code_globals_add(0);
2471 if (global->code.globaladdr < 0)
2473 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2475 if (code_globals_add(0) < 0)
2479 return global->code.globaladdr >= 0;
2482 if (code_defs_add(def) < 0)
2484 global->code.globaladdr = code_globals_elements;
2485 code_globals_add(code_functions_elements);
2486 return gen_global_function(self, global);
2488 /* assume biggest type */
2489 global->code.globaladdr = code_globals_add(0);
2490 code_globals_add(0);
2491 code_globals_add(0);
2494 /* refuse to create 'void' type or any other fancy business. */
2495 printf("Invalid type for global variable %s\n", global->name);
2500 bool ir_builder_generate(ir_builder *self, const char *filename)
2506 for (i = 0; i < self->globals_count; ++i)
2508 if (!ir_builder_gen_global(self, self->globals[i])) {
2513 printf("writing '%s'...\n", filename);
2514 return code_write(filename);
2517 /***********************************************************************
2518 *IR DEBUG Dump functions...
2521 #define IND_BUFSZ 1024
2523 const char *qc_opname(int op)
2525 if (op < 0) return "<INVALID>";
2526 if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
2527 return asm_instr[op].m;
2529 case VINSTR_PHI: return "PHI";
2530 case VINSTR_JUMP: return "JUMP";
2531 case VINSTR_COND: return "COND";
2532 default: return "<UNK>";
2536 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
2539 char indent[IND_BUFSZ];
2543 oprintf("module %s\n", b->name);
2544 for (i = 0; i < b->globals_count; ++i)
2547 if (b->globals[i]->isconst)
2548 oprintf("%s = ", b->globals[i]->name);
2549 ir_value_dump(b->globals[i], oprintf);
2552 for (i = 0; i < b->functions_count; ++i)
2553 ir_function_dump(b->functions[i], indent, oprintf);
2554 oprintf("endmodule %s\n", b->name);
2557 void ir_function_dump(ir_function *f, char *ind,
2558 int (*oprintf)(const char*, ...))
2561 oprintf("%sfunction %s\n", ind, f->name);
2562 strncat(ind, "\t", IND_BUFSZ);
2563 if (f->locals_count)
2565 oprintf("%s%i locals:\n", ind, (int)f->locals_count);
2566 for (i = 0; i < f->locals_count; ++i) {
2567 oprintf("%s\t", ind);
2568 ir_value_dump(f->locals[i], oprintf);
2572 if (f->blocks_count)
2574 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
2575 for (i = 0; i < f->blocks_count; ++i) {
2576 if (f->blocks[i]->run_id != f->run_id) {
2577 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
2579 ir_block_dump(f->blocks[i], ind, oprintf);
2583 ind[strlen(ind)-1] = 0;
2584 oprintf("%sendfunction %s\n", ind, f->name);
2587 void ir_block_dump(ir_block* b, char *ind,
2588 int (*oprintf)(const char*, ...))
2591 oprintf("%s:%s\n", ind, b->label);
2592 strncat(ind, "\t", IND_BUFSZ);
2594 for (i = 0; i < b->instr_count; ++i)
2595 ir_instr_dump(b->instr[i], ind, oprintf);
2596 ind[strlen(ind)-1] = 0;
2599 void dump_phi(ir_instr *in, char *ind,
2600 int (*oprintf)(const char*, ...))
2603 oprintf("%s <- phi ", in->_ops[0]->name);
2604 for (i = 0; i < in->phi_count; ++i)
2606 oprintf("([%s] : %s) ", in->phi[i].from->label,
2607 in->phi[i].value->name);
2612 void ir_instr_dump(ir_instr *in, char *ind,
2613 int (*oprintf)(const char*, ...))
2616 const char *comma = NULL;
2618 oprintf("%s (%i) ", ind, (int)in->eid);
2620 if (in->opcode == VINSTR_PHI) {
2621 dump_phi(in, ind, oprintf);
2625 strncat(ind, "\t", IND_BUFSZ);
2627 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
2628 ir_value_dump(in->_ops[0], oprintf);
2629 if (in->_ops[1] || in->_ops[2])
2632 oprintf("%s\t", qc_opname(in->opcode));
2633 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
2634 ir_value_dump(in->_ops[0], oprintf);
2639 for (i = 1; i != 3; ++i) {
2643 ir_value_dump(in->_ops[i], oprintf);
2651 oprintf("[%s]", in->bops[0]->label);
2655 oprintf("%s[%s]", comma, in->bops[1]->label);
2657 ind[strlen(ind)-1] = 0;
2660 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
2668 oprintf("%g", v->constval.vfloat);
2671 oprintf("'%g %g %g'",
2674 v->constval.vvec.z);
2677 oprintf("(entity)");
2680 oprintf("\"%s\"", v->constval.vstring);
2684 oprintf("%i", v->constval.vint);
2689 v->constval.vpointer->name);
2693 oprintf("%s", v->name);
2697 void ir_value_dump_life(ir_value *self, int (*oprintf)(const char*,...))
2700 oprintf("Life of %s:\n", self->name);
2701 for (i = 0; i < self->life_count; ++i)
2703 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);