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 /***********************************************************************
32 ir_builder* ir_builder_new(const char *modulename)
36 self = (ir_builder*)mem_a(sizeof(*self));
37 MEM_VECTOR_INIT(self, functions);
38 MEM_VECTOR_INIT(self, globals);
40 if (!ir_builder_set_name(self, modulename)) {
45 /* globals which always exist */
47 /* for now we give it a vector size */
48 ir_builder_create_global(self, "OFS_RETURN", TYPE_VARIANT);
53 MEM_VEC_FUNCTIONS(ir_builder, ir_value*, globals)
54 MEM_VEC_FUNCTIONS(ir_builder, ir_function*, functions)
56 void ir_builder_delete(ir_builder* self)
59 mem_d((void*)self->name);
60 for (i = 0; i != self->functions_count; ++i) {
61 ir_function_delete(self->functions[i]);
63 MEM_VECTOR_CLEAR(self, functions);
64 for (i = 0; i != self->globals_count; ++i) {
65 ir_value_delete(self->globals[i]);
67 MEM_VECTOR_CLEAR(self, globals);
71 bool ir_builder_set_name(ir_builder *self, const char *name)
74 mem_d((void*)self->name);
75 self->name = util_strdup(name);
79 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
82 for (i = 0; i < self->functions_count; ++i) {
83 if (!strcmp(name, self->functions[i]->name))
84 return self->functions[i];
89 ir_function* ir_builder_create_function(ir_builder *self, const char *name)
91 ir_function *fn = ir_builder_get_function(self, name);
96 fn = ir_function_new(self);
97 if (!ir_function_set_name(fn, name) ||
98 !ir_builder_functions_add(self, fn) )
100 ir_function_delete(fn);
106 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
109 for (i = 0; i < self->globals_count; ++i) {
110 if (!strcmp(self->globals[i]->name, name))
111 return self->globals[i];
116 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
118 ir_value *ve = ir_builder_get_global(self, name);
123 ve = ir_value_var(name, store_global, vtype);
124 if (!ir_builder_globals_add(self, ve)) {
131 /***********************************************************************
135 bool ir_function_naive_phi(ir_function*);
136 void ir_function_enumerate(ir_function*);
137 bool ir_function_calculate_liferanges(ir_function*);
139 ir_function* ir_function_new(ir_builder* owner)
142 self = (ir_function*)mem_a(sizeof(*self));
144 if (!ir_function_set_name(self, "<@unnamed>")) {
149 self->context.file = "<@no context>";
150 self->context.line = 0;
151 self->retype = TYPE_VOID;
152 MEM_VECTOR_INIT(self, params);
153 MEM_VECTOR_INIT(self, blocks);
154 MEM_VECTOR_INIT(self, values);
155 MEM_VECTOR_INIT(self, locals);
160 MEM_VEC_FUNCTIONS(ir_function, ir_value*, values)
161 MEM_VEC_FUNCTIONS(ir_function, ir_block*, blocks)
162 MEM_VEC_FUNCTIONS(ir_function, ir_value*, locals)
164 bool ir_function_set_name(ir_function *self, const char *name)
167 mem_d((void*)self->name);
168 self->name = util_strdup(name);
172 void ir_function_delete(ir_function *self)
175 mem_d((void*)self->name);
177 for (i = 0; i != self->blocks_count; ++i)
178 ir_block_delete(self->blocks[i]);
179 MEM_VECTOR_CLEAR(self, blocks);
181 MEM_VECTOR_CLEAR(self, params);
183 for (i = 0; i != self->values_count; ++i)
184 ir_value_delete(self->values[i]);
185 MEM_VECTOR_CLEAR(self, values);
187 for (i = 0; i != self->locals_count; ++i)
188 ir_value_delete(self->locals[i]);
189 MEM_VECTOR_CLEAR(self, locals);
194 bool GMQCC_WARN ir_function_collect_value(ir_function *self, ir_value *v)
196 return ir_function_values_add(self, v);
199 ir_block* ir_function_create_block(ir_function *self, const char *label)
201 ir_block* bn = ir_block_new(self, label);
202 memcpy(&bn->context, &self->context, sizeof(self->context));
203 if (!ir_function_blocks_add(self, bn)) {
210 bool ir_function_finalize(ir_function *self)
212 if (!ir_function_naive_phi(self))
215 ir_function_enumerate(self);
217 if (!ir_function_calculate_liferanges(self))
222 ir_value* ir_function_get_local(ir_function *self, const char *name)
225 for (i = 0; i < self->locals_count; ++i) {
226 if (!strcmp(self->locals[i]->name, name))
227 return self->locals[i];
232 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype)
234 ir_value *ve = ir_function_get_local(self, name);
239 ve = ir_value_var(name, store_local, vtype);
240 if (!ir_function_locals_add(self, ve)) {
247 /***********************************************************************
251 ir_block* ir_block_new(ir_function* owner, const char *name)
254 self = (ir_block*)mem_a(sizeof(*self));
256 if (!ir_block_set_label(self, name)) {
261 self->context.file = "<@no context>";
262 self->context.line = 0;
264 MEM_VECTOR_INIT(self, instr);
265 MEM_VECTOR_INIT(self, entries);
266 MEM_VECTOR_INIT(self, exits);
269 self->is_return = false;
271 MEM_VECTOR_INIT(self, living);
274 MEM_VEC_FUNCTIONS(ir_block, ir_instr*, instr)
275 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, entries)
276 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, exits)
277 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_value*, living)
279 void ir_block_delete(ir_block* self)
283 for (i = 0; i != self->instr_count; ++i)
284 ir_instr_delete(self->instr[i]);
285 MEM_VECTOR_CLEAR(self, instr);
286 MEM_VECTOR_CLEAR(self, entries);
287 MEM_VECTOR_CLEAR(self, exits);
288 MEM_VECTOR_CLEAR(self, living);
292 bool ir_block_set_label(ir_block *self, const char *name)
295 mem_d((void*)self->label);
296 self->label = util_strdup(name);
297 return !!self->label;
300 /***********************************************************************
304 ir_instr* ir_instr_new(ir_block* owner, int op)
307 self = (ir_instr*)mem_a(sizeof(*self));
309 self->context.file = "<@no context>";
310 self->context.line = 0;
312 self->_ops[0] = NULL;
313 self->_ops[1] = NULL;
314 self->_ops[2] = NULL;
315 self->bops[0] = NULL;
316 self->bops[1] = NULL;
317 MEM_VECTOR_INIT(self, phi);
322 MEM_VEC_FUNCTIONS(ir_instr, ir_phi_entry_t, phi)
324 void ir_instr_delete(ir_instr *self)
327 /* The following calls can only delete from
328 * vectors, we still want to delete this instruction
329 * so ignore the return value. Since with the warn_unused_result attribute
330 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
331 * I have to improvise here and use if(foo());
333 for (i = 0; i < self->phi_count; ++i) {
335 if (ir_value_writes_find(self->phi[i].value, self, &idx))
336 if (ir_value_writes_remove(self->phi[i].value, idx)) GMQCC_SUPRESS_EMPTY_BODY;
337 if (ir_value_reads_find(self->phi[i].value, self, &idx))
338 if (ir_value_reads_remove (self->phi[i].value, idx)) GMQCC_SUPRESS_EMPTY_BODY;
340 MEM_VECTOR_CLEAR(self, phi);
341 if (ir_instr_op(self, 0, NULL, false)) GMQCC_SUPRESS_EMPTY_BODY;
342 if (ir_instr_op(self, 1, NULL, false)) GMQCC_SUPRESS_EMPTY_BODY;
343 if (ir_instr_op(self, 2, NULL, false)) GMQCC_SUPRESS_EMPTY_BODY;
347 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
349 if (self->_ops[op]) {
351 if (writing && ir_value_writes_find(self->_ops[op], self, &idx))
353 if (!ir_value_writes_remove(self->_ops[op], idx))
356 else if (ir_value_reads_find(self->_ops[op], self, &idx))
358 if (!ir_value_reads_remove(self->_ops[op], idx))
364 if (!ir_value_writes_add(v, self))
367 if (!ir_value_reads_add(v, self))
375 /***********************************************************************
379 ir_value* ir_value_var(const char *name, int storetype, int vtype)
382 self = (ir_value*)mem_a(sizeof(*self));
384 self->store = storetype;
385 MEM_VECTOR_INIT(self, reads);
386 MEM_VECTOR_INIT(self, writes);
387 self->isconst = false;
388 self->context.file = "<@no context>";
389 self->context.line = 0;
391 ir_value_set_name(self, name);
393 MEM_VECTOR_INIT(self, life);
396 MEM_VEC_FUNCTIONS(ir_value, ir_life_entry_t, life)
397 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, reads)
398 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, writes)
400 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
402 ir_value *v = ir_value_var(name, storetype, vtype);
405 if (!ir_function_collect_value(owner, v))
413 void ir_value_delete(ir_value* self)
415 mem_d((void*)self->name);
418 if (self->vtype == TYPE_STRING)
419 mem_d((void*)self->constval.vstring);
421 MEM_VECTOR_CLEAR(self, reads);
422 MEM_VECTOR_CLEAR(self, writes);
423 MEM_VECTOR_CLEAR(self, life);
427 void ir_value_set_name(ir_value *self, const char *name)
430 mem_d((void*)self->name);
431 self->name = util_strdup(name);
434 bool ir_value_set_float(ir_value *self, float f)
436 if (self->vtype != TYPE_FLOAT)
438 self->constval.vfloat = f;
439 self->isconst = true;
443 bool ir_value_set_vector(ir_value *self, vector v)
445 if (self->vtype != TYPE_VECTOR)
447 self->constval.vvec = v;
448 self->isconst = true;
452 bool ir_value_set_string(ir_value *self, const char *str)
454 if (self->vtype != TYPE_STRING)
456 self->constval.vstring = util_strdup(str);
457 self->isconst = true;
462 bool ir_value_set_int(ir_value *self, int i)
464 if (self->vtype != TYPE_INTEGER)
466 self->constval.vint = i;
467 self->isconst = true;
472 bool ir_value_lives(ir_value *self, size_t at)
475 for (i = 0; i < self->life_count; ++i)
477 ir_life_entry_t *life = &self->life[i];
478 if (life->start <= at && at <= life->end)
480 if (life->start > at) /* since it's ordered */
486 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
489 if (!ir_value_life_add(self, e)) /* naive... */
491 for (k = self->life_count-1; k > idx; --k)
492 self->life[k] = self->life[k-1];
497 bool ir_value_life_merge(ir_value *self, size_t s)
500 ir_life_entry_t *life = NULL;
501 ir_life_entry_t *before = NULL;
502 ir_life_entry_t new_entry;
504 /* Find the first range >= s */
505 for (i = 0; i < self->life_count; ++i)
508 life = &self->life[i];
512 /* nothing found? append */
513 if (i == self->life_count) {
515 if (life && life->end+1 == s)
517 /* previous life range can be merged in */
521 if (life && life->end >= s)
524 if (!ir_value_life_add(self, e))
525 return false; /* failing */
531 if (before->end + 1 == s &&
532 life->start - 1 == s)
535 before->end = life->end;
536 if (!ir_value_life_remove(self, i))
537 return false; /* failing */
540 if (before->end + 1 == s)
546 /* already contained */
547 if (before->end >= s)
551 if (life->start - 1 == s)
556 /* insert a new entry */
557 new_entry.start = new_entry.end = s;
558 return ir_value_life_insert(self, i, new_entry);
561 bool ir_values_overlap(ir_value *a, ir_value *b)
563 /* For any life entry in A see if it overlaps with
564 * any life entry in B.
565 * Note that the life entries are orderes, so we can make a
566 * more efficient algorithm there than naively translating the
570 ir_life_entry_t *la, *lb, *enda, *endb;
572 /* first of all, if either has no life range, they cannot clash */
573 if (!a->life_count || !b->life_count)
578 enda = la + a->life_count;
579 endb = lb + b->life_count;
582 /* check if the entries overlap, for that,
583 * both must start before the other one ends.
585 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
586 if (la->start <= lb->end &&
587 lb->start <= la->end)
589 if (la->start < lb->end &&
596 /* entries are ordered
597 * one entry is earlier than the other
598 * that earlier entry will be moved forward
600 if (la->end < lb->end)
602 /* order: A B, move A forward
603 * check if we hit the end with A
608 else if (lb->end < la->end)
610 /* order: B A, move B forward
611 * check if we hit the end with B
620 /***********************************************************************
624 bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
626 if (target->store == store_value) {
627 fprintf(stderr, "cannot store to an SSA value\n");
628 fprintf(stderr, "trying to store: %s <- %s\n", target->name, what->name);
631 ir_instr *in = ir_instr_new(self, op);
634 if (!ir_instr_op(in, 0, target, true) ||
635 !ir_instr_op(in, 1, what, false) ||
636 !ir_block_instr_add(self, in) )
644 bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
648 if (target->vtype == TYPE_VARIANT)
651 vtype = target->vtype;
656 if (what->vtype == TYPE_INTEGER)
657 op = INSTR_CONV_ITOF;
666 op = INSTR_STORE_ENT;
672 op = INSTR_STORE_FLD;
676 if (what->vtype == TYPE_INTEGER)
677 op = INSTR_CONV_FTOI;
686 op = INSTR_STORE_ENT;
693 return ir_block_create_store_op(self, op, target, what);
696 bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
701 if (target->vtype != TYPE_POINTER)
704 /* storing using pointer - target is a pointer, type must be
705 * inferred from source
717 op = INSTR_STOREP_ENT;
723 op = INSTR_STOREP_FLD;
734 op = INSTR_STOREP_ENT;
741 return ir_block_create_store_op(self, op, target, what);
744 bool ir_block_create_return(ir_block *self, ir_value *v)
748 fprintf(stderr, "block already ended (%s)\n", self->label);
752 self->is_return = true;
753 in = ir_instr_new(self, INSTR_RETURN);
757 if (!ir_instr_op(in, 0, v, false) ||
758 !ir_block_instr_add(self, in) )
765 bool ir_block_create_if(ir_block *self, ir_value *v,
766 ir_block *ontrue, ir_block *onfalse)
770 fprintf(stderr, "block already ended (%s)\n", self->label);
774 /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
775 in = ir_instr_new(self, VINSTR_COND);
779 if (!ir_instr_op(in, 0, v, false)) {
784 in->bops[0] = ontrue;
785 in->bops[1] = onfalse;
787 if (!ir_block_instr_add(self, in))
790 if (!ir_block_exits_add(self, ontrue) ||
791 !ir_block_exits_add(self, onfalse) ||
792 !ir_block_entries_add(ontrue, self) ||
793 !ir_block_entries_add(onfalse, self) )
800 bool ir_block_create_jump(ir_block *self, ir_block *to)
804 fprintf(stderr, "block already ended (%s)\n", self->label);
808 in = ir_instr_new(self, VINSTR_JUMP);
813 if (!ir_block_instr_add(self, in))
816 if (!ir_block_exits_add(self, to) ||
817 !ir_block_entries_add(to, self) )
824 bool ir_block_create_goto(ir_block *self, ir_block *to)
828 fprintf(stderr, "block already ended (%s)\n", self->label);
832 in = ir_instr_new(self, INSTR_GOTO);
837 if (!ir_block_instr_add(self, in))
840 if (!ir_block_exits_add(self, to) ||
841 !ir_block_entries_add(to, self) )
848 ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
852 in = ir_instr_new(self, VINSTR_PHI);
855 out = ir_value_out(self->owner, label, store_value, ot);
860 if (!ir_instr_op(in, 0, out, true)) {
862 ir_value_delete(out);
865 if (!ir_block_instr_add(self, in)) {
867 ir_value_delete(out);
873 ir_value* ir_phi_value(ir_instr *self)
875 return self->_ops[0];
878 bool ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
882 if (!ir_block_entries_find(self->owner, b, NULL)) {
883 /* Must not be possible to cause this, otherwise the AST
884 * is doing something wrong.
886 fprintf(stderr, "Invalid entry block for PHI\n");
892 if (!ir_value_reads_add(v, self))
894 return ir_instr_phi_add(self, pe);
897 /* binary op related code */
899 ir_value* ir_block_create_binop(ir_block *self,
900 const char *label, int opcode,
901 ir_value *left, ir_value *right)
923 case INSTR_SUB_S: /* -- offset of string as float */
930 case INSTR_BITAND_FI:
931 case INSTR_BITAND_IF:
972 /* boolean operations result in floats */
973 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
975 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
978 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
983 if (ot == TYPE_VOID) {
984 /* The AST or parser were supposed to check this! */
988 return ir_block_create_general_instr(self, label, opcode, left, right, ot);
991 ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
992 int op, ir_value *a, ir_value *b, int outype)
997 out = ir_value_out(self->owner, label, store_value, outype);
1001 instr = ir_instr_new(self, op);
1003 ir_value_delete(out);
1007 if (!ir_instr_op(instr, 0, out, true) ||
1008 !ir_instr_op(instr, 1, a, false) ||
1009 !ir_instr_op(instr, 2, b, false) )
1014 if (!ir_block_instr_add(self, instr))
1019 ir_instr_delete(instr);
1020 ir_value_delete(out);
1024 ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
1026 /* Support for various pointer types todo if so desired */
1027 if (ent->vtype != TYPE_ENTITY)
1030 if (field->vtype != TYPE_FIELD)
1033 return ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1036 ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
1039 if (ent->vtype != TYPE_ENTITY)
1042 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1043 if (field->vtype != TYPE_FIELD)
1048 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1049 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1050 case TYPE_STRING: op = INSTR_LOAD_S; break;
1051 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1052 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1054 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1055 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1061 return ir_block_create_general_instr(self, label, op, ent, field, outype);
1064 ir_value* ir_block_create_add(ir_block *self,
1066 ir_value *left, ir_value *right)
1069 int l = left->vtype;
1070 int r = right->vtype;
1089 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1091 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1097 return ir_block_create_binop(self, label, op, left, right);
1100 ir_value* ir_block_create_sub(ir_block *self,
1102 ir_value *left, ir_value *right)
1105 int l = left->vtype;
1106 int r = right->vtype;
1126 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1128 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1134 return ir_block_create_binop(self, label, op, left, right);
1137 ir_value* ir_block_create_mul(ir_block *self,
1139 ir_value *left, ir_value *right)
1142 int l = left->vtype;
1143 int r = right->vtype;
1162 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1164 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1167 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1169 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1171 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1173 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1179 return ir_block_create_binop(self, label, op, left, right);
1182 ir_value* ir_block_create_div(ir_block *self,
1184 ir_value *left, ir_value *right)
1187 int l = left->vtype;
1188 int r = right->vtype;
1205 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1207 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1209 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1215 return ir_block_create_binop(self, label, op, left, right);
1218 /* PHI resolving breaks the SSA, and must thus be the last
1219 * step before life-range calculation.
1222 static bool ir_block_naive_phi(ir_block *self);
1223 bool ir_function_naive_phi(ir_function *self)
1227 for (i = 0; i < self->blocks_count; ++i)
1229 if (!ir_block_naive_phi(self->blocks[i]))
1235 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1240 /* create a store */
1241 if (!ir_block_create_store(block, old, what))
1244 /* we now move it up */
1245 instr = block->instr[block->instr_count-1];
1246 for (i = block->instr_count; i > iid; --i)
1247 block->instr[i] = block->instr[i-1];
1248 block->instr[i] = instr;
1253 static bool ir_block_naive_phi(ir_block *self)
1256 /* FIXME: optionally, create_phi can add the phis
1257 * to a list so we don't need to loop through blocks
1258 * - anyway: "don't optimize YET"
1260 for (i = 0; i < self->instr_count; ++i)
1262 ir_instr *instr = self->instr[i];
1263 if (instr->opcode != VINSTR_PHI)
1266 if (!ir_block_instr_remove(self, i))
1268 --i; /* NOTE: i+1 below */
1270 for (p = 0; p < instr->phi_count; ++p)
1272 ir_value *v = instr->phi[p].value;
1273 for (w = 0; w < v->writes_count; ++w) {
1276 if (!v->writes[w]->_ops[0])
1279 /* When the write was to a global, we have to emit a mov */
1280 old = v->writes[w]->_ops[0];
1282 /* The original instruction now writes to the PHI target local */
1283 if (v->writes[w]->_ops[0] == v)
1284 v->writes[w]->_ops[0] = instr->_ops[0];
1286 if (old->store != store_value && old->store != store_local)
1288 /* If it originally wrote to a global we need to store the value
1291 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1293 if (i+1 < self->instr_count)
1294 instr = self->instr[i+1];
1297 /* In case I forget and access instr later, it'll be NULL
1298 * when it's a problem, to make sure we crash, rather than accessing
1304 /* If it didn't, we can replace all reads by the phi target now. */
1306 for (r = 0; r < old->reads_count; ++r)
1309 ir_instr *ri = old->reads[r];
1310 for (op = 0; op < ri->phi_count; ++op) {
1311 if (ri->phi[op].value == old)
1312 ri->phi[op].value = v;
1314 for (op = 0; op < 3; ++op) {
1315 if (ri->_ops[op] == old)
1322 ir_instr_delete(instr);
1327 /***********************************************************************
1328 *IR Temp allocation code
1329 * Propagating value life ranges by walking through the function backwards
1330 * until no more changes are made.
1331 * In theory this should happen once more than once for every nested loop
1333 * Though this implementation might run an additional time for if nests.
1342 MEM_VEC_FUNCTIONS_ALL(new_reads_t, ir_value*, v)
1344 /* Enumerate instructions used by value's life-ranges
1346 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1350 for (i = 0; i < self->instr_count; ++i)
1352 self->instr[i]->eid = eid++;
1357 /* Enumerate blocks and instructions.
1358 * The block-enumeration is unordered!
1359 * We do not really use the block enumreation, however
1360 * the instruction enumeration is important for life-ranges.
1362 void ir_function_enumerate(ir_function *self)
1365 size_t instruction_id = 0;
1366 for (i = 0; i < self->blocks_count; ++i)
1368 self->blocks[i]->eid = i;
1369 self->blocks[i]->run_id = 0;
1370 ir_block_enumerate(self->blocks[i], &instruction_id);
1374 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
1375 bool ir_function_calculate_liferanges(ir_function *self)
1383 for (i = 0; i != self->blocks_count; ++i)
1385 if (self->blocks[i]->is_return)
1387 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
1395 /* Get information about which operand
1396 * is read from, or written to.
1398 static void ir_op_read_write(int op, size_t *read, size_t *write)
1425 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
1428 bool changed = false;
1430 for (i = 0; i != self->living_count; ++i)
1432 tempbool = ir_value_life_merge(self->living[i], eid);
1435 fprintf(stderr, "block_living_add_instr() value instruction added %s: %i\n", self->living[i]->_name, (int)eid);
1437 changed = changed || tempbool;
1442 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
1445 /* values which have been read in a previous iteration are now
1446 * in the "living" array even if the previous block doesn't use them.
1447 * So we have to remove whatever does not exist in the previous block.
1448 * They will be re-added on-read, but the liferange merge won't cause
1451 for (i = 0; i < self->living_count; ++i)
1453 if (!ir_block_living_find(prev, self->living[i], NULL)) {
1454 if (!ir_block_living_remove(self, i))
1460 /* Whatever the previous block still has in its living set
1461 * must now be added to ours as well.
1463 for (i = 0; i < prev->living_count; ++i)
1465 if (ir_block_living_find(self, prev->living[i], NULL))
1467 if (!ir_block_living_add(self, prev->living[i]))
1470 printf("%s got from prev: %s\n", self->label, prev->living[i]->_name);
1476 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
1482 /* bitmasks which operands are read from or written to */
1484 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1486 new_reads_t new_reads;
1488 char dbg_ind[16] = { '#', '0' };
1491 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1492 MEM_VECTOR_INIT(&new_reads, v);
1497 if (!ir_block_life_prop_previous(self, prev, changed))
1501 i = self->instr_count;
1504 instr = self->instr[i];
1506 /* PHI operands are always read operands */
1507 for (p = 0; p < instr->phi_count; ++p)
1509 value = instr->phi[p].value;
1510 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1511 if (!ir_block_living_find(self, value, NULL) &&
1512 !ir_block_living_add(self, value))
1517 if (!new_reads_t_v_find(&new_reads, value, NULL))
1519 if (!new_reads_t_v_add(&new_reads, value))
1525 /* See which operands are read and write operands */
1526 ir_op_read_write(instr->opcode, &read, &write);
1528 /* Go through the 3 main operands */
1529 for (o = 0; o < 3; ++o)
1531 if (!instr->_ops[o]) /* no such operand */
1534 value = instr->_ops[o];
1536 /* We only care about locals */
1537 if (value->store != store_value &&
1538 value->store != store_local)
1544 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1545 if (!ir_block_living_find(self, value, NULL) &&
1546 !ir_block_living_add(self, value))
1551 /* fprintf(stderr, "read: %s\n", value->_name); */
1552 if (!new_reads_t_v_find(&new_reads, value, NULL))
1554 if (!new_reads_t_v_add(&new_reads, value))
1560 /* write operands */
1561 /* When we write to a local, we consider it "dead" for the
1562 * remaining upper part of the function, since in SSA a value
1563 * can only be written once (== created)
1568 bool in_living = ir_block_living_find(self, value, &idx);
1569 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1571 bool in_reads = new_reads_t_v_find(&new_reads, value, &readidx);
1572 if (!in_living && !in_reads)
1577 /* If the value isn't alive it hasn't been read before... */
1578 /* TODO: See if the warning can be emitted during parsing or AST processing
1579 * otherwise have warning printed here.
1580 * IF printing a warning here: include filecontext_t,
1581 * and make sure it's only printed once
1582 * since this function is run multiple times.
1584 /* For now: debug info: */
1585 fprintf(stderr, "Value only written %s\n", value->name);
1586 tempbool = ir_value_life_merge(value, instr->eid);
1587 *changed = *changed || tempbool;
1589 ir_instr_dump(instr, dbg_ind, printf);
1593 /* since 'living' won't contain it
1594 * anymore, merge the value, since
1597 tempbool = ir_value_life_merge(value, instr->eid);
1600 fprintf(stderr, "value added id %s %i\n", value->name, (int)instr->eid);
1602 *changed = *changed || tempbool;
1604 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1605 if (!ir_block_living_remove(self, idx))
1610 if (!new_reads_t_v_remove(&new_reads, readidx))
1618 tempbool = ir_block_living_add_instr(self, instr->eid);
1619 /*fprintf(stderr, "living added values\n");*/
1620 *changed = *changed || tempbool;
1622 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1624 for (rd = 0; rd < new_reads.v_count; ++rd)
1626 if (!ir_block_living_find(self, new_reads.v[rd], NULL)) {
1627 if (!ir_block_living_add(self, new_reads.v[rd]))
1630 if (!i && !self->entries_count) {
1632 *changed = *changed || ir_value_life_merge(new_reads.v[rd], instr->eid);
1635 MEM_VECTOR_CLEAR(&new_reads, v);
1639 if (self->run_id == self->owner->run_id)
1642 self->run_id = self->owner->run_id;
1644 for (i = 0; i < self->entries_count; ++i)
1646 ir_block *entry = self->entries[i];
1647 ir_block_life_propagate(entry, self, changed);
1652 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1653 MEM_VECTOR_CLEAR(&new_reads, v);
1658 /***********************************************************************
1659 *IR DEBUG Dump functions...
1662 #define IND_BUFSZ 1024
1664 const char *qc_opname(int op)
1666 if (op < 0) return "<INVALID>";
1667 if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
1668 return asm_instr[op].m;
1670 case VINSTR_PHI: return "PHI";
1671 case VINSTR_JUMP: return "JUMP";
1672 case VINSTR_COND: return "COND";
1673 default: return "<UNK>";
1677 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
1680 char indent[IND_BUFSZ];
1684 oprintf("module %s\n", b->name);
1685 for (i = 0; i < b->globals_count; ++i)
1688 if (b->globals[i]->isconst)
1689 oprintf("%s = ", b->globals[i]->name);
1690 ir_value_dump(b->globals[i], oprintf);
1693 for (i = 0; i < b->functions_count; ++i)
1694 ir_function_dump(b->functions[i], indent, oprintf);
1695 oprintf("endmodule %s\n", b->name);
1698 void ir_function_dump(ir_function *f, char *ind,
1699 int (*oprintf)(const char*, ...))
1702 oprintf("%sfunction %s\n", ind, f->name);
1703 strncat(ind, "\t", IND_BUFSZ);
1704 if (f->locals_count)
1706 oprintf("%s%i locals:\n", ind, (int)f->locals_count);
1707 for (i = 0; i < f->locals_count; ++i) {
1708 oprintf("%s\t", ind);
1709 ir_value_dump(f->locals[i], oprintf);
1713 if (f->blocks_count)
1715 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
1716 for (i = 0; i < f->blocks_count; ++i) {
1717 if (f->blocks[i]->run_id != f->run_id) {
1718 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
1720 ir_block_dump(f->blocks[i], ind, oprintf);
1724 ind[strlen(ind)-1] = 0;
1725 oprintf("%sendfunction %s\n", ind, f->name);
1728 void ir_block_dump(ir_block* b, char *ind,
1729 int (*oprintf)(const char*, ...))
1732 oprintf("%s:%s\n", ind, b->label);
1733 strncat(ind, "\t", IND_BUFSZ);
1735 for (i = 0; i < b->instr_count; ++i)
1736 ir_instr_dump(b->instr[i], ind, oprintf);
1737 ind[strlen(ind)-1] = 0;
1740 void dump_phi(ir_instr *in, char *ind,
1741 int (*oprintf)(const char*, ...))
1744 oprintf("%s <- phi ", in->_ops[0]->name);
1745 for (i = 0; i < in->phi_count; ++i)
1747 oprintf("([%s] : %s) ", in->phi[i].from->label,
1748 in->phi[i].value->name);
1753 void ir_instr_dump(ir_instr *in, char *ind,
1754 int (*oprintf)(const char*, ...))
1757 const char *comma = NULL;
1759 oprintf("%s (%i) ", ind, (int)in->eid);
1761 if (in->opcode == VINSTR_PHI) {
1762 dump_phi(in, ind, oprintf);
1766 strncat(ind, "\t", IND_BUFSZ);
1768 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
1769 ir_value_dump(in->_ops[0], oprintf);
1770 if (in->_ops[1] || in->_ops[2])
1773 oprintf("%s\t", qc_opname(in->opcode));
1774 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
1775 ir_value_dump(in->_ops[0], oprintf);
1780 for (i = 1; i != 3; ++i) {
1784 ir_value_dump(in->_ops[i], oprintf);
1792 oprintf("[%s]", in->bops[0]->label);
1796 oprintf("%s[%s]", comma, in->bops[1]->label);
1798 ind[strlen(ind)-1] = 0;
1801 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
1809 oprintf("%g", v->constval.vfloat);
1812 oprintf("'%g %g %g'",
1815 v->constval.vvec.z);
1818 oprintf("(entity)");
1821 oprintf("\"%s\"", v->constval.vstring);
1825 oprintf("%i", v->constval.vint);
1830 v->constval.vpointer->name);
1834 oprintf("%s", v->name);
1838 void ir_value_dump_life(ir_value *self, int (*oprintf)(const char*,...))
1841 oprintf("Life of %s:\n", self->name);
1842 for (i = 0; i < self->life_count; ++i)
1844 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);