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;
209 MEM_VECTOR_INIT(self, params);
210 MEM_VECTOR_INIT(self, blocks);
211 MEM_VECTOR_INIT(self, values);
212 MEM_VECTOR_INIT(self, locals);
217 MEM_VEC_FUNCTIONS(ir_function, ir_value*, values)
218 MEM_VEC_FUNCTIONS(ir_function, ir_block*, blocks)
219 MEM_VEC_FUNCTIONS(ir_function, ir_value*, locals)
221 bool ir_function_set_name(ir_function *self, const char *name)
224 mem_d((void*)self->name);
225 self->name = util_strdup(name);
229 void ir_function_delete(ir_function *self)
232 mem_d((void*)self->name);
234 for (i = 0; i != self->blocks_count; ++i)
235 ir_block_delete(self->blocks[i]);
236 MEM_VECTOR_CLEAR(self, blocks);
238 MEM_VECTOR_CLEAR(self, params);
240 for (i = 0; i != self->values_count; ++i)
241 ir_value_delete(self->values[i]);
242 MEM_VECTOR_CLEAR(self, values);
244 for (i = 0; i != self->locals_count; ++i)
245 ir_value_delete(self->locals[i]);
246 MEM_VECTOR_CLEAR(self, locals);
248 /* self->value is deleted by the builder */
253 bool GMQCC_WARN ir_function_collect_value(ir_function *self, ir_value *v)
255 return ir_function_values_add(self, v);
258 ir_block* ir_function_create_block(ir_function *self, const char *label)
260 ir_block* bn = ir_block_new(self, label);
261 memcpy(&bn->context, &self->context, sizeof(self->context));
262 if (!ir_function_blocks_add(self, bn)) {
269 bool ir_function_finalize(ir_function *self)
271 if (!ir_function_naive_phi(self))
274 ir_function_enumerate(self);
276 if (!ir_function_calculate_liferanges(self))
279 if (!ir_function_allocate_locals(self))
284 ir_value* ir_function_get_local(ir_function *self, const char *name)
287 for (i = 0; i < self->locals_count; ++i) {
288 if (!strcmp(self->locals[i]->name, name))
289 return self->locals[i];
294 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype)
296 ir_value *ve = ir_function_get_local(self, name);
301 ve = ir_value_var(name, store_local, vtype);
302 if (!ir_function_locals_add(self, ve)) {
309 /***********************************************************************
313 ir_block* ir_block_new(ir_function* owner, const char *name)
316 self = (ir_block*)mem_a(sizeof(*self));
320 memset(self, 0, sizeof(*self));
323 if (!ir_block_set_label(self, name)) {
328 self->context.file = "<@no context>";
329 self->context.line = 0;
331 MEM_VECTOR_INIT(self, instr);
332 MEM_VECTOR_INIT(self, entries);
333 MEM_VECTOR_INIT(self, exits);
336 self->is_return = false;
338 MEM_VECTOR_INIT(self, living);
340 self->generated = false;
344 MEM_VEC_FUNCTIONS(ir_block, ir_instr*, instr)
345 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, entries)
346 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, exits)
347 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_value*, living)
349 void ir_block_delete(ir_block* self)
353 for (i = 0; i != self->instr_count; ++i)
354 ir_instr_delete(self->instr[i]);
355 MEM_VECTOR_CLEAR(self, instr);
356 MEM_VECTOR_CLEAR(self, entries);
357 MEM_VECTOR_CLEAR(self, exits);
358 MEM_VECTOR_CLEAR(self, living);
362 bool ir_block_set_label(ir_block *self, const char *name)
365 mem_d((void*)self->label);
366 self->label = util_strdup(name);
367 return !!self->label;
370 /***********************************************************************
374 ir_instr* ir_instr_new(ir_block* owner, int op)
377 self = (ir_instr*)mem_a(sizeof(*self));
382 self->context.file = "<@no context>";
383 self->context.line = 0;
385 self->_ops[0] = NULL;
386 self->_ops[1] = NULL;
387 self->_ops[2] = NULL;
388 self->bops[0] = NULL;
389 self->bops[1] = NULL;
390 MEM_VECTOR_INIT(self, phi);
391 MEM_VECTOR_INIT(self, params);
396 MEM_VEC_FUNCTIONS(ir_instr, ir_phi_entry_t, phi)
397 MEM_VEC_FUNCTIONS(ir_instr, ir_value*, params)
399 void ir_instr_delete(ir_instr *self)
402 /* The following calls can only delete from
403 * vectors, we still want to delete this instruction
404 * so ignore the return value. Since with the warn_unused_result attribute
405 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
406 * I have to improvise here and use if(foo());
408 for (i = 0; i < self->phi_count; ++i) {
410 if (ir_value_writes_find(self->phi[i].value, self, &idx))
411 if (ir_value_writes_remove(self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
412 if (ir_value_reads_find(self->phi[i].value, self, &idx))
413 if (ir_value_reads_remove (self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
415 MEM_VECTOR_CLEAR(self, phi);
416 for (i = 0; i < self->params_count; ++i) {
418 if (ir_value_writes_find(self->params[i], self, &idx))
419 if (ir_value_writes_remove(self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
420 if (ir_value_reads_find(self->params[i], self, &idx))
421 if (ir_value_reads_remove (self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
423 MEM_VECTOR_CLEAR(self, params);
424 if (ir_instr_op(self, 0, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
425 if (ir_instr_op(self, 1, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
426 if (ir_instr_op(self, 2, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
430 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
432 if (self->_ops[op]) {
434 if (writing && ir_value_writes_find(self->_ops[op], self, &idx))
436 if (!ir_value_writes_remove(self->_ops[op], idx))
439 else if (ir_value_reads_find(self->_ops[op], self, &idx))
441 if (!ir_value_reads_remove(self->_ops[op], idx))
447 if (!ir_value_writes_add(v, self))
450 if (!ir_value_reads_add(v, self))
458 /***********************************************************************
462 ir_value* ir_value_var(const char *name, int storetype, int vtype)
465 self = (ir_value*)mem_a(sizeof(*self));
467 self->fieldtype = TYPE_VOID;
468 self->outtype = TYPE_VOID;
469 self->store = storetype;
470 MEM_VECTOR_INIT(self, reads);
471 MEM_VECTOR_INIT(self, writes);
472 self->isconst = false;
473 self->context.file = "<@no context>";
474 self->context.line = 0;
476 ir_value_set_name(self, name);
478 memset(&self->constval, 0, sizeof(self->constval));
479 memset(&self->code, 0, sizeof(self->code));
481 MEM_VECTOR_INIT(self, life);
484 MEM_VEC_FUNCTIONS(ir_value, ir_life_entry_t, life)
485 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, reads)
486 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, writes)
488 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
490 ir_value *v = ir_value_var(name, storetype, vtype);
493 if (!ir_function_collect_value(owner, v))
501 void ir_value_delete(ir_value* self)
504 mem_d((void*)self->name);
507 if (self->vtype == TYPE_STRING)
508 mem_d((void*)self->constval.vstring);
510 MEM_VECTOR_CLEAR(self, reads);
511 MEM_VECTOR_CLEAR(self, writes);
512 MEM_VECTOR_CLEAR(self, life);
516 void ir_value_set_name(ir_value *self, const char *name)
519 mem_d((void*)self->name);
520 self->name = util_strdup(name);
523 bool ir_value_set_float(ir_value *self, float f)
525 if (self->vtype != TYPE_FLOAT)
527 self->constval.vfloat = f;
528 self->isconst = true;
532 bool ir_value_set_vector(ir_value *self, vector v)
534 if (self->vtype != TYPE_VECTOR)
536 self->constval.vvec = v;
537 self->isconst = true;
541 bool ir_value_set_string(ir_value *self, const char *str)
543 if (self->vtype != TYPE_STRING)
545 self->constval.vstring = util_strdup(str);
546 self->isconst = true;
551 bool ir_value_set_int(ir_value *self, int i)
553 if (self->vtype != TYPE_INTEGER)
555 self->constval.vint = i;
556 self->isconst = true;
561 bool ir_value_lives(ir_value *self, size_t at)
564 for (i = 0; i < self->life_count; ++i)
566 ir_life_entry_t *life = &self->life[i];
567 if (life->start <= at && at <= life->end)
569 if (life->start > at) /* since it's ordered */
575 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
578 if (!ir_value_life_add(self, e)) /* naive... */
580 for (k = self->life_count-1; k > idx; --k)
581 self->life[k] = self->life[k-1];
586 bool ir_value_life_merge(ir_value *self, size_t s)
589 ir_life_entry_t *life = NULL;
590 ir_life_entry_t *before = NULL;
591 ir_life_entry_t new_entry;
593 /* Find the first range >= s */
594 for (i = 0; i < self->life_count; ++i)
597 life = &self->life[i];
601 /* nothing found? append */
602 if (i == self->life_count) {
604 if (life && life->end+1 == s)
606 /* previous life range can be merged in */
610 if (life && life->end >= s)
613 if (!ir_value_life_add(self, e))
614 return false; /* failing */
620 if (before->end + 1 == s &&
621 life->start - 1 == s)
624 before->end = life->end;
625 if (!ir_value_life_remove(self, i))
626 return false; /* failing */
629 if (before->end + 1 == s)
635 /* already contained */
636 if (before->end >= s)
640 if (life->start - 1 == s)
645 /* insert a new entry */
646 new_entry.start = new_entry.end = s;
647 return ir_value_life_insert(self, i, new_entry);
650 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
654 if (!other->life_count)
657 if (!self->life_count) {
658 for (i = 0; i < other->life_count; ++i) {
659 if (!ir_value_life_add(self, other->life[i]))
666 for (i = 0; i < other->life_count; ++i)
668 const ir_life_entry_t *life = &other->life[i];
671 ir_life_entry_t *entry = &self->life[myi];
673 if (life->end+1 < entry->start)
675 /* adding an interval before entry */
676 if (!ir_value_life_insert(self, myi, *life))
682 if (life->start < entry->start &&
683 life->end >= entry->start)
685 /* starts earlier and overlaps */
686 entry->start = life->start;
689 if (life->end > entry->end &&
690 life->start-1 <= entry->end)
692 /* ends later and overlaps */
693 entry->end = life->end;
696 /* see if our change combines it with the next ranges */
697 while (myi+1 < self->life_count &&
698 entry->end+1 >= self->life[1+myi].start)
700 /* overlaps with (myi+1) */
701 if (entry->end < self->life[1+myi].end)
702 entry->end = self->life[1+myi].end;
703 if (!ir_value_life_remove(self, myi+1))
705 entry = &self->life[myi];
708 /* see if we're after the entry */
709 if (life->start > entry->end)
712 /* append if we're at the end */
713 if (myi >= self->life_count) {
714 if (!ir_value_life_add(self, *life))
718 /* otherweise check the next range */
727 bool ir_values_overlap(const ir_value *a, const ir_value *b)
729 /* For any life entry in A see if it overlaps with
730 * any life entry in B.
731 * Note that the life entries are orderes, so we can make a
732 * more efficient algorithm there than naively translating the
736 ir_life_entry_t *la, *lb, *enda, *endb;
738 /* first of all, if either has no life range, they cannot clash */
739 if (!a->life_count || !b->life_count)
744 enda = la + a->life_count;
745 endb = lb + b->life_count;
748 /* check if the entries overlap, for that,
749 * both must start before the other one ends.
751 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
752 if (la->start <= lb->end &&
753 lb->start <= la->end)
755 if (la->start < lb->end &&
762 /* entries are ordered
763 * one entry is earlier than the other
764 * that earlier entry will be moved forward
766 if (la->start < lb->start)
768 /* order: A B, move A forward
769 * check if we hit the end with A
774 else if (lb->start < la->start)
776 /* order: B A, move B forward
777 * check if we hit the end with B
786 /***********************************************************************
790 bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
792 if (target->store == store_value) {
793 fprintf(stderr, "cannot store to an SSA value\n");
794 fprintf(stderr, "trying to store: %s <- %s\n", target->name, what->name);
797 ir_instr *in = ir_instr_new(self, op);
800 if (!ir_instr_op(in, 0, target, true) ||
801 !ir_instr_op(in, 1, what, false) ||
802 !ir_block_instr_add(self, in) )
810 bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
814 if (target->vtype == TYPE_VARIANT)
817 vtype = target->vtype;
822 if (what->vtype == TYPE_INTEGER)
823 op = INSTR_CONV_ITOF;
832 op = INSTR_STORE_ENT;
838 op = INSTR_STORE_FLD;
842 if (what->vtype == TYPE_INTEGER)
843 op = INSTR_CONV_FTOI;
852 op = INSTR_STORE_ENT;
859 return ir_block_create_store_op(self, op, target, what);
862 bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
867 if (target->vtype != TYPE_POINTER)
870 /* storing using pointer - target is a pointer, type must be
871 * inferred from source
883 op = INSTR_STOREP_ENT;
889 op = INSTR_STOREP_FLD;
900 op = INSTR_STOREP_ENT;
907 return ir_block_create_store_op(self, op, target, what);
910 bool ir_block_create_return(ir_block *self, ir_value *v)
914 fprintf(stderr, "block already ended (%s)\n", self->label);
918 self->is_return = true;
919 in = ir_instr_new(self, INSTR_RETURN);
923 if (!ir_instr_op(in, 0, v, false) ||
924 !ir_block_instr_add(self, in) )
931 bool ir_block_create_if(ir_block *self, ir_value *v,
932 ir_block *ontrue, ir_block *onfalse)
936 fprintf(stderr, "block already ended (%s)\n", self->label);
940 /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
941 in = ir_instr_new(self, VINSTR_COND);
945 if (!ir_instr_op(in, 0, v, false)) {
950 in->bops[0] = ontrue;
951 in->bops[1] = onfalse;
953 if (!ir_block_instr_add(self, in))
956 if (!ir_block_exits_add(self, ontrue) ||
957 !ir_block_exits_add(self, onfalse) ||
958 !ir_block_entries_add(ontrue, self) ||
959 !ir_block_entries_add(onfalse, self) )
966 bool ir_block_create_jump(ir_block *self, ir_block *to)
970 fprintf(stderr, "block already ended (%s)\n", self->label);
974 in = ir_instr_new(self, VINSTR_JUMP);
979 if (!ir_block_instr_add(self, in))
982 if (!ir_block_exits_add(self, to) ||
983 !ir_block_entries_add(to, self) )
990 bool ir_block_create_goto(ir_block *self, ir_block *to)
994 fprintf(stderr, "block already ended (%s)\n", self->label);
998 in = ir_instr_new(self, INSTR_GOTO);
1003 if (!ir_block_instr_add(self, in))
1006 if (!ir_block_exits_add(self, to) ||
1007 !ir_block_entries_add(to, self) )
1014 ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
1018 in = ir_instr_new(self, VINSTR_PHI);
1021 out = ir_value_out(self->owner, label, store_value, ot);
1023 ir_instr_delete(in);
1026 if (!ir_instr_op(in, 0, out, true)) {
1027 ir_instr_delete(in);
1028 ir_value_delete(out);
1031 if (!ir_block_instr_add(self, in)) {
1032 ir_instr_delete(in);
1033 ir_value_delete(out);
1039 ir_value* ir_phi_value(ir_instr *self)
1041 return self->_ops[0];
1044 bool ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1048 if (!ir_block_entries_find(self->owner, b, NULL)) {
1049 /* Must not be possible to cause this, otherwise the AST
1050 * is doing something wrong.
1052 fprintf(stderr, "Invalid entry block for PHI\n");
1058 if (!ir_value_reads_add(v, self))
1060 return ir_instr_phi_add(self, pe);
1063 /* call related code */
1064 ir_instr* ir_block_create_call(ir_block *self, const char *label, ir_value *func)
1068 in = ir_instr_new(self, INSTR_CALL0);
1071 out = ir_value_out(self->owner, label, store_return, func->outtype);
1073 ir_instr_delete(in);
1076 if (!ir_instr_op(in, 0, out, true) ||
1077 !ir_instr_op(in, 1, func, false) ||
1078 !ir_block_instr_add(self, in))
1080 ir_instr_delete(in);
1081 ir_value_delete(out);
1087 ir_value* ir_call_value(ir_instr *self)
1089 return self->_ops[0];
1092 bool ir_call_param(ir_instr* self, ir_value *v)
1094 if (!ir_instr_params_add(self, v))
1096 if (!ir_value_reads_add(v, self)) {
1097 if (!ir_instr_params_remove(self, self->params_count-1))
1098 GMQCC_SUPPRESS_EMPTY_BODY;
1104 /* binary op related code */
1106 ir_value* ir_block_create_binop(ir_block *self,
1107 const char *label, int opcode,
1108 ir_value *left, ir_value *right)
1130 case INSTR_SUB_S: /* -- offset of string as float */
1135 case INSTR_BITOR_IF:
1136 case INSTR_BITOR_FI:
1137 case INSTR_BITAND_FI:
1138 case INSTR_BITAND_IF:
1153 case INSTR_BITAND_I:
1156 case INSTR_RSHIFT_I:
1157 case INSTR_LSHIFT_I:
1179 /* boolean operations result in floats */
1180 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1182 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1185 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1190 if (ot == TYPE_VOID) {
1191 /* The AST or parser were supposed to check this! */
1195 return ir_block_create_general_instr(self, label, opcode, left, right, ot);
1198 ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
1199 int op, ir_value *a, ir_value *b, int outype)
1204 out = ir_value_out(self->owner, label, store_value, outype);
1208 instr = ir_instr_new(self, op);
1210 ir_value_delete(out);
1214 if (!ir_instr_op(instr, 0, out, true) ||
1215 !ir_instr_op(instr, 1, a, false) ||
1216 !ir_instr_op(instr, 2, b, false) )
1221 if (!ir_block_instr_add(self, instr))
1226 ir_instr_delete(instr);
1227 ir_value_delete(out);
1231 ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
1233 /* Support for various pointer types todo if so desired */
1234 if (ent->vtype != TYPE_ENTITY)
1237 if (field->vtype != TYPE_FIELD)
1240 return ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1243 ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
1246 if (ent->vtype != TYPE_ENTITY)
1249 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1250 if (field->vtype != TYPE_FIELD)
1255 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1256 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1257 case TYPE_STRING: op = INSTR_LOAD_S; break;
1258 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1259 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1261 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1262 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1268 return ir_block_create_general_instr(self, label, op, ent, field, outype);
1271 ir_value* ir_block_create_add(ir_block *self,
1273 ir_value *left, ir_value *right)
1276 int l = left->vtype;
1277 int r = right->vtype;
1296 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1298 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1304 return ir_block_create_binop(self, label, op, left, right);
1307 ir_value* ir_block_create_sub(ir_block *self,
1309 ir_value *left, ir_value *right)
1312 int l = left->vtype;
1313 int r = right->vtype;
1333 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1335 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1341 return ir_block_create_binop(self, label, op, left, right);
1344 ir_value* ir_block_create_mul(ir_block *self,
1346 ir_value *left, ir_value *right)
1349 int l = left->vtype;
1350 int r = right->vtype;
1369 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1371 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1374 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1376 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1378 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1380 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1386 return ir_block_create_binop(self, label, op, left, right);
1389 ir_value* ir_block_create_div(ir_block *self,
1391 ir_value *left, ir_value *right)
1394 int l = left->vtype;
1395 int r = right->vtype;
1412 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1414 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1416 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1422 return ir_block_create_binop(self, label, op, left, right);
1425 /* PHI resolving breaks the SSA, and must thus be the last
1426 * step before life-range calculation.
1429 static bool ir_block_naive_phi(ir_block *self);
1430 bool ir_function_naive_phi(ir_function *self)
1434 for (i = 0; i < self->blocks_count; ++i)
1436 if (!ir_block_naive_phi(self->blocks[i]))
1442 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1447 /* create a store */
1448 if (!ir_block_create_store(block, old, what))
1451 /* we now move it up */
1452 instr = block->instr[block->instr_count-1];
1453 for (i = block->instr_count; i > iid; --i)
1454 block->instr[i] = block->instr[i-1];
1455 block->instr[i] = instr;
1460 static bool ir_block_naive_phi(ir_block *self)
1463 /* FIXME: optionally, create_phi can add the phis
1464 * to a list so we don't need to loop through blocks
1465 * - anyway: "don't optimize YET"
1467 for (i = 0; i < self->instr_count; ++i)
1469 ir_instr *instr = self->instr[i];
1470 if (instr->opcode != VINSTR_PHI)
1473 if (!ir_block_instr_remove(self, i))
1475 --i; /* NOTE: i+1 below */
1477 for (p = 0; p < instr->phi_count; ++p)
1479 ir_value *v = instr->phi[p].value;
1480 for (w = 0; w < v->writes_count; ++w) {
1483 if (!v->writes[w]->_ops[0])
1486 /* When the write was to a global, we have to emit a mov */
1487 old = v->writes[w]->_ops[0];
1489 /* The original instruction now writes to the PHI target local */
1490 if (v->writes[w]->_ops[0] == v)
1491 v->writes[w]->_ops[0] = instr->_ops[0];
1493 if (old->store != store_value && old->store != store_local)
1495 /* If it originally wrote to a global we need to store the value
1498 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1500 if (i+1 < self->instr_count)
1501 instr = self->instr[i+1];
1504 /* In case I forget and access instr later, it'll be NULL
1505 * when it's a problem, to make sure we crash, rather than accessing
1511 /* If it didn't, we can replace all reads by the phi target now. */
1513 for (r = 0; r < old->reads_count; ++r)
1516 ir_instr *ri = old->reads[r];
1517 for (op = 0; op < ri->phi_count; ++op) {
1518 if (ri->phi[op].value == old)
1519 ri->phi[op].value = v;
1521 for (op = 0; op < 3; ++op) {
1522 if (ri->_ops[op] == old)
1529 ir_instr_delete(instr);
1534 /***********************************************************************
1535 *IR Temp allocation code
1536 * Propagating value life ranges by walking through the function backwards
1537 * until no more changes are made.
1538 * In theory this should happen once more than once for every nested loop
1540 * Though this implementation might run an additional time for if nests.
1549 MEM_VEC_FUNCTIONS_ALL(new_reads_t, ir_value*, v)
1551 /* Enumerate instructions used by value's life-ranges
1553 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1557 for (i = 0; i < self->instr_count; ++i)
1559 self->instr[i]->eid = eid++;
1564 /* Enumerate blocks and instructions.
1565 * The block-enumeration is unordered!
1566 * We do not really use the block enumreation, however
1567 * the instruction enumeration is important for life-ranges.
1569 void ir_function_enumerate(ir_function *self)
1572 size_t instruction_id = 0;
1573 for (i = 0; i < self->blocks_count; ++i)
1575 self->blocks[i]->eid = i;
1576 self->blocks[i]->run_id = 0;
1577 ir_block_enumerate(self->blocks[i], &instruction_id);
1581 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
1582 bool ir_function_calculate_liferanges(ir_function *self)
1590 for (i = 0; i != self->blocks_count; ++i)
1592 if (self->blocks[i]->is_return)
1594 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
1602 /* Local-value allocator
1603 * After finishing creating the liferange of all values used in a function
1604 * we can allocate their global-positions.
1605 * This is the counterpart to register-allocation in register machines.
1608 MEM_VECTOR_MAKE(ir_value*, locals);
1609 MEM_VECTOR_MAKE(size_t, sizes);
1610 MEM_VECTOR_MAKE(size_t, positions);
1611 } function_allocator;
1612 MEM_VEC_FUNCTIONS(function_allocator, ir_value*, locals)
1613 MEM_VEC_FUNCTIONS(function_allocator, size_t, sizes)
1614 MEM_VEC_FUNCTIONS(function_allocator, size_t, positions)
1616 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
1619 size_t vsize = type_sizeof[var->vtype];
1621 slot = ir_value_var("reg", store_global, var->vtype);
1625 if (!ir_value_life_merge_into(slot, var))
1628 if (!function_allocator_locals_add(alloc, slot))
1631 if (!function_allocator_sizes_add(alloc, vsize))
1637 ir_value_delete(slot);
1641 bool ir_function_allocate_locals(ir_function *self)
1650 function_allocator alloc;
1652 MEM_VECTOR_INIT(&alloc, locals);
1653 MEM_VECTOR_INIT(&alloc, sizes);
1654 MEM_VECTOR_INIT(&alloc, positions);
1656 for (i = 0; i < self->locals_count; ++i)
1658 if (!function_allocator_alloc(&alloc, self->locals[i]))
1662 /* Allocate a slot for any value that still exists */
1663 for (i = 0; i < self->values_count; ++i)
1665 v = self->values[i];
1670 for (a = 0; a < alloc.locals_count; ++a)
1672 slot = alloc.locals[a];
1674 if (ir_values_overlap(v, slot))
1677 if (!ir_value_life_merge_into(slot, v))
1680 /* adjust size for this slot */
1681 if (alloc.sizes[a] < type_sizeof[v->vtype])
1682 alloc.sizes[a] = type_sizeof[v->vtype];
1684 self->values[i]->code.local = a;
1687 if (a >= alloc.locals_count) {
1688 self->values[i]->code.local = alloc.locals_count;
1689 if (!function_allocator_alloc(&alloc, v))
1694 /* Adjust slot positions based on sizes */
1695 if (!function_allocator_positions_add(&alloc, 0))
1698 if (alloc.sizes_count)
1699 pos = alloc.positions[0] + alloc.sizes[0];
1702 for (i = 1; i < alloc.sizes_count; ++i)
1704 pos = alloc.positions[i-1] + alloc.sizes[i-1];
1705 if (!function_allocator_positions_add(&alloc, pos))
1709 self->allocated_locals = pos + alloc.sizes[alloc.sizes_count-1];
1711 /* Take over the actual slot positions */
1712 for (i = 0; i < self->values_count; ++i)
1713 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
1720 for (i = 0; i < alloc.locals_count; ++i)
1721 ir_value_delete(alloc.locals[i]);
1722 MEM_VECTOR_CLEAR(&alloc, locals);
1723 MEM_VECTOR_CLEAR(&alloc, sizes);
1724 MEM_VECTOR_CLEAR(&alloc, positions);
1728 /* Get information about which operand
1729 * is read from, or written to.
1731 static void ir_op_read_write(int op, size_t *read, size_t *write)
1758 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
1761 bool changed = false;
1763 for (i = 0; i != self->living_count; ++i)
1765 tempbool = ir_value_life_merge(self->living[i], eid);
1768 fprintf(stderr, "block_living_add_instr() value instruction added %s: %i\n", self->living[i]->_name, (int)eid);
1770 changed = changed || tempbool;
1775 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
1778 /* values which have been read in a previous iteration are now
1779 * in the "living" array even if the previous block doesn't use them.
1780 * So we have to remove whatever does not exist in the previous block.
1781 * They will be re-added on-read, but the liferange merge won't cause
1784 for (i = 0; i < self->living_count; ++i)
1786 if (!ir_block_living_find(prev, self->living[i], NULL)) {
1787 if (!ir_block_living_remove(self, i))
1793 /* Whatever the previous block still has in its living set
1794 * must now be added to ours as well.
1796 for (i = 0; i < prev->living_count; ++i)
1798 if (ir_block_living_find(self, prev->living[i], NULL))
1800 if (!ir_block_living_add(self, prev->living[i]))
1803 printf("%s got from prev: %s\n", self->label, prev->living[i]->_name);
1809 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
1815 /* bitmasks which operands are read from or written to */
1817 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1819 new_reads_t new_reads;
1821 char dbg_ind[16] = { '#', '0' };
1824 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1825 MEM_VECTOR_INIT(&new_reads, v);
1830 if (!ir_block_life_prop_previous(self, prev, changed))
1834 i = self->instr_count;
1837 instr = self->instr[i];
1839 /* PHI operands are always read operands */
1840 for (p = 0; p < instr->phi_count; ++p)
1842 value = instr->phi[p].value;
1843 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1844 if (!ir_block_living_find(self, value, NULL) &&
1845 !ir_block_living_add(self, value))
1850 if (!new_reads_t_v_find(&new_reads, value, NULL))
1852 if (!new_reads_t_v_add(&new_reads, value))
1858 /* See which operands are read and write operands */
1859 ir_op_read_write(instr->opcode, &read, &write);
1861 /* Go through the 3 main operands */
1862 for (o = 0; o < 3; ++o)
1864 if (!instr->_ops[o]) /* no such operand */
1867 value = instr->_ops[o];
1869 /* We only care about locals */
1870 if (value->store != store_value &&
1871 value->store != store_local)
1877 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1878 if (!ir_block_living_find(self, value, NULL) &&
1879 !ir_block_living_add(self, value))
1884 /* fprintf(stderr, "read: %s\n", value->_name); */
1885 if (!new_reads_t_v_find(&new_reads, value, NULL))
1887 if (!new_reads_t_v_add(&new_reads, value))
1893 /* write operands */
1894 /* When we write to a local, we consider it "dead" for the
1895 * remaining upper part of the function, since in SSA a value
1896 * can only be written once (== created)
1901 bool in_living = ir_block_living_find(self, value, &idx);
1902 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1904 bool in_reads = new_reads_t_v_find(&new_reads, value, &readidx);
1905 if (!in_living && !in_reads)
1910 /* If the value isn't alive it hasn't been read before... */
1911 /* TODO: See if the warning can be emitted during parsing or AST processing
1912 * otherwise have warning printed here.
1913 * IF printing a warning here: include filecontext_t,
1914 * and make sure it's only printed once
1915 * since this function is run multiple times.
1917 /* For now: debug info: */
1918 fprintf(stderr, "Value only written %s\n", value->name);
1919 tempbool = ir_value_life_merge(value, instr->eid);
1920 *changed = *changed || tempbool;
1922 ir_instr_dump(instr, dbg_ind, printf);
1926 /* since 'living' won't contain it
1927 * anymore, merge the value, since
1930 tempbool = ir_value_life_merge(value, instr->eid);
1933 fprintf(stderr, "value added id %s %i\n", value->name, (int)instr->eid);
1935 *changed = *changed || tempbool;
1937 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1938 if (!ir_block_living_remove(self, idx))
1943 if (!new_reads_t_v_remove(&new_reads, readidx))
1951 tempbool = ir_block_living_add_instr(self, instr->eid);
1952 /*fprintf(stderr, "living added values\n");*/
1953 *changed = *changed || tempbool;
1955 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1957 for (rd = 0; rd < new_reads.v_count; ++rd)
1959 if (!ir_block_living_find(self, new_reads.v[rd], NULL)) {
1960 if (!ir_block_living_add(self, new_reads.v[rd]))
1963 if (!i && !self->entries_count) {
1965 *changed = *changed || ir_value_life_merge(new_reads.v[rd], instr->eid);
1968 MEM_VECTOR_CLEAR(&new_reads, v);
1972 if (self->run_id == self->owner->run_id)
1975 self->run_id = self->owner->run_id;
1977 for (i = 0; i < self->entries_count; ++i)
1979 ir_block *entry = self->entries[i];
1980 ir_block_life_propagate(entry, self, changed);
1985 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1986 MEM_VECTOR_CLEAR(&new_reads, v);
1991 /***********************************************************************
1994 * Since the IR has the convention of putting 'write' operands
1995 * at the beginning, we have to rotate the operands of instructions
1996 * properly in order to generate valid QCVM code.
1998 * Having destinations at a fixed position is more convenient. In QC
1999 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2000 * read from from OPA, and store to OPB rather than OPC. Which is
2001 * partially the reason why the implementation of these instructions
2002 * in darkplaces has been delayed for so long.
2004 * Breaking conventions is annoying...
2006 static bool ir_builder_gen_global(ir_builder *self, ir_value *global);
2008 static bool gen_global_field(ir_value *global)
2010 if (global->isconst)
2012 ir_value *fld = global->constval.vpointer;
2014 printf("Invalid field constant with no field: %s\n", global->name);
2018 /* Now, in this case, a relocation would be impossible to code
2019 * since it looks like this:
2020 * .vector v = origin; <- parse error, wtf is 'origin'?
2023 * But we will need a general relocation support later anyway
2024 * for functions... might as well support that here.
2026 if (!fld->code.globaladdr) {
2027 printf("FIXME: Relocation support\n");
2031 /* copy the field's value */
2032 global->code.globaladdr = code_globals_add(code_globals_data[fld->code.globaladdr]);
2036 prog_section_field fld;
2038 fld.name = global->code.name;
2039 fld.offset = code_fields_elements;
2040 fld.type = global->fieldtype;
2042 if (fld.type == TYPE_VOID) {
2043 printf("Field is missing a type: %s\n", global->name);
2047 if (code_fields_add(fld) < 0)
2050 global->code.globaladdr = code_globals_add(fld.offset);
2052 if (global->code.globaladdr < 0)
2057 static bool gen_global_pointer(ir_value *global)
2059 if (global->isconst)
2061 ir_value *target = global->constval.vpointer;
2063 printf("Invalid pointer constant: %s\n", global->name);
2064 /* NULL pointers are pointing to the NULL constant, which also
2065 * sits at address 0, but still has an ir_value for itself.
2070 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2071 * void() foo; <- proto
2072 * void() *fooptr = &foo;
2073 * void() foo = { code }
2075 if (!target->code.globaladdr) {
2076 /* FIXME: Check for the constant nullptr ir_value!
2077 * because then code.globaladdr being 0 is valid.
2079 printf("FIXME: Relocation support\n");
2083 global->code.globaladdr = code_globals_add(target->code.globaladdr);
2087 global->code.globaladdr = code_globals_add(0);
2089 if (global->code.globaladdr < 0)
2094 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2096 prog_section_statement stmt;
2105 block->generated = true;
2106 block->code_start = code_statements_elements;
2107 for (i = 0; i < block->instr_count; ++i)
2109 instr = block->instr[i];
2111 if (instr->opcode == VINSTR_PHI) {
2112 printf("cannot generate virtual instruction (phi)\n");
2116 if (instr->opcode == VINSTR_JUMP) {
2117 target = instr->bops[0];
2118 /* for uncoditional jumps, if the target hasn't been generated
2119 * yet, we generate them right here.
2121 if (!target->generated) {
2126 /* otherwise we generate a jump instruction */
2127 stmt.opcode = INSTR_GOTO;
2128 stmt.o1.s1 = (target->code_start) - code_statements_elements;
2131 if (code_statements_add(stmt) < 0)
2134 /* no further instructions can be in this block */
2138 if (instr->opcode == VINSTR_COND) {
2139 ontrue = instr->bops[0];
2140 onfalse = instr->bops[1];
2141 /* TODO: have the AST signal which block should
2142 * come first: eg. optimize IFs without ELSE...
2145 stmt.o1.u1 = instr->_ops[0]->code.globaladdr;
2149 if (ontrue->generated) {
2150 stmt.opcode = INSTR_IF;
2151 stmt.o2.s1 = (ontrue->code_start-1) - code_statements_elements;
2152 if (code_statements_add(stmt) < 0)
2155 if (onfalse->generated) {
2156 stmt.opcode = INSTR_IFNOT;
2157 stmt.o2.s1 = (onfalse->code_start-1) - code_statements_elements;
2158 if (code_statements_add(stmt) < 0)
2161 if (!ontrue->generated) {
2162 if (onfalse->generated) {
2167 if (!onfalse->generated) {
2168 if (ontrue->generated) {
2173 /* neither ontrue nor onfalse exist */
2174 stmt.opcode = INSTR_IFNOT;
2175 stidx = code_statements_elements;
2176 if (code_statements_add(stmt) < 0)
2178 /* on false we jump, so add ontrue-path */
2179 if (!gen_blocks_recursive(func, ontrue))
2181 /* fixup the jump address */
2182 code_statements_data[stidx].o2.s1 = code_statements_elements - stidx;
2183 /* generate onfalse path */
2184 if (onfalse->generated) {
2185 /* fixup the jump address */
2186 code_statements_data[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2187 /* may have been generated in the previous recursive call */
2188 stmt.opcode = INSTR_GOTO;
2189 stmt.o1.s1 = (onfalse->code_start) - code_statements_elements;
2192 return (code_statements_add(stmt) >= 0);
2194 /* if not, generate now */
2199 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2200 /* Trivial call translation:
2201 * copy all params to OFS_PARM*
2202 * if the output's storetype is not store_return,
2203 * add append a STORE instruction!
2205 * NOTES on how to do it better without much trouble:
2206 * -) The liferanges!
2207 * Simply check the liferange of all parameters for
2208 * other CALLs. For each param with no CALL in its
2209 * liferange, we can store it in an OFS_PARM at
2210 * generation already. This would even include later
2211 * reuse.... probably... :)
2216 for (p = 0; p < instr->params_count; ++p)
2218 ir_value *param = instr->params[p];
2220 stmt.opcode = INSTR_STORE_F;
2223 stmt.opcode = type_store_instr[param->vtype];
2224 stmt.o1.u1 = param->code.globaladdr;
2225 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2226 if (code_statements_add(stmt) < 0)
2229 stmt.opcode = INSTR_CALL0 + instr->params_count;
2230 if (stmt.opcode > INSTR_CALL8)
2231 stmt.opcode = INSTR_CALL8;
2232 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2235 if (code_statements_add(stmt) < 0)
2238 retvalue = instr->_ops[0];
2239 if (retvalue && retvalue->store != store_return && retvalue->life_count)
2241 /* not to be kept in OFS_RETURN */
2242 stmt.opcode = type_store_instr[retvalue->vtype];
2243 stmt.o1.u1 = OFS_RETURN;
2244 stmt.o2.u1 = retvalue->code.globaladdr;
2246 if (code_statements_add(stmt) < 0)
2252 if (instr->opcode == INSTR_STATE) {
2253 printf("TODO: state instruction\n");
2257 stmt.opcode = instr->opcode;
2262 /* This is the general order of operands */
2264 stmt.o3.u1 = instr->_ops[0]->code.globaladdr;
2267 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2270 stmt.o2.u1 = instr->_ops[2]->code.globaladdr;
2272 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2274 stmt.o1.u1 = stmt.o3.u1;
2277 else if ((stmt.opcode >= INSTR_STORE_F &&
2278 stmt.opcode <= INSTR_STORE_FNC) ||
2279 (stmt.opcode >= INSTR_NOT_F &&
2280 stmt.opcode <= INSTR_NOT_FNC))
2282 /* 2-operand instructions with A -> B */
2283 stmt.o2.u1 = stmt.o3.u1;
2287 if (code_statements_add(stmt) < 0)
2293 static bool gen_function_code(ir_function *self)
2297 /* Starting from entry point, we generate blocks "as they come"
2298 * for now. Dead blocks will not be translated obviously.
2300 if (!self->blocks_count) {
2301 printf("Function '%s' declared without body.\n", self->name);
2305 block = self->blocks[0];
2306 if (block->generated)
2309 if (!gen_blocks_recursive(self, block)) {
2310 printf("failed to generate blocks for '%s'\n", self->name);
2316 static bool gen_global_function(ir_builder *ir, ir_value *global)
2318 prog_section_function fun;
2322 size_t local_var_end;
2324 if (!global->isconst ||
2325 !global->constval.vfunc)
2327 printf("Invalid state of function-global: not constant: %s\n", global->name);
2331 irfun = global->constval.vfunc;
2333 fun.name = global->code.name;
2334 fun.file = code_cachedstring(global->context.file);
2335 fun.profile = 0; /* always 0 */
2336 fun.nargs = irfun->params_count;
2338 for (i = 0;i < 8; ++i) {
2341 else if (irfun->params[i] == TYPE_VECTOR)
2347 fun.firstlocal = code_globals_elements;
2348 fun.locals = irfun->allocated_locals + irfun->locals_count;
2351 for (i = 0; i < irfun->locals_count; ++i) {
2352 if (!ir_builder_gen_global(ir, irfun->locals[i])) {
2353 printf("Failed to generate global %s\n", irfun->locals[i]->name);
2357 if (irfun->locals_count) {
2358 ir_value *last = irfun->locals[irfun->locals_count-1];
2359 local_var_end = last->code.globaladdr;
2360 local_var_end += type_sizeof[last->vtype];
2362 for (i = 0; i < irfun->values_count; ++i)
2364 /* generate code.globaladdr for ssa values */
2365 ir_value *v = irfun->values[i];
2366 v->code.globaladdr = local_var_end + v->code.local;
2368 for (i = 0; i < irfun->locals_count; ++i) {
2369 /* fill the locals with zeros */
2370 code_globals_add(0);
2373 fun.entry = code_statements_elements;
2374 if (!gen_function_code(irfun)) {
2375 printf("Failed to generate code for function %s\n", irfun->name);
2379 return (code_functions_add(fun) >= 0);
2382 static bool ir_builder_gen_global(ir_builder *self, ir_value *global)
2385 prog_section_def def;
2387 def.type = global->vtype;
2388 def.offset = code_globals_elements;
2389 def.name = global->code.name = code_genstring(global->name);
2391 switch (global->vtype)
2394 if (code_defs_add(def) < 0)
2396 return gen_global_pointer(global);
2398 if (code_defs_add(def) < 0)
2400 return gen_global_field(global);
2405 if (code_defs_add(def) < 0)
2408 if (global->isconst) {
2409 iptr = (int32_t*)&global->constval.vfloat;
2410 global->code.globaladdr = code_globals_add(*iptr);
2412 global->code.globaladdr = code_globals_add(0);
2414 return global->code.globaladdr >= 0;
2418 if (code_defs_add(def) < 0)
2420 if (global->isconst)
2421 global->code.globaladdr = code_globals_add(code_cachedstring(global->constval.vstring));
2423 global->code.globaladdr = code_globals_add(0);
2424 return global->code.globaladdr >= 0;
2428 if (code_defs_add(def) < 0)
2431 if (global->isconst) {
2432 iptr = (int32_t*)&global->constval.vvec;
2433 global->code.globaladdr = code_globals_add(iptr[0]);
2434 if (code_globals_add(iptr[1]) < 0 || code_globals_add(iptr[2]) < 0)
2437 global->code.globaladdr = code_globals_add(0);
2438 if (code_globals_add(0) < 0 || code_globals_add(0) < 0)
2441 return global->code.globaladdr >= 0;
2444 if (code_defs_add(def) < 0)
2446 code_globals_add(code_functions_elements);
2447 return gen_global_function(self, global);
2449 /* assume biggest type */
2450 global->code.globaladdr = code_globals_add(0);
2451 code_globals_add(0);
2452 code_globals_add(0);
2455 /* refuse to create 'void' type or any other fancy business. */
2456 printf("Invalid type for global variable %s\n", global->name);
2461 bool ir_builder_generate(ir_builder *self, const char *filename)
2467 for (i = 0; i < self->globals_count; ++i)
2469 if (!ir_builder_gen_global(self, self->globals[i])) {
2474 printf("writing '%s'...\n", filename);
2475 return code_write(filename);
2478 /***********************************************************************
2479 *IR DEBUG Dump functions...
2482 #define IND_BUFSZ 1024
2484 const char *qc_opname(int op)
2486 if (op < 0) return "<INVALID>";
2487 if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
2488 return asm_instr[op].m;
2490 case VINSTR_PHI: return "PHI";
2491 case VINSTR_JUMP: return "JUMP";
2492 case VINSTR_COND: return "COND";
2493 default: return "<UNK>";
2497 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
2500 char indent[IND_BUFSZ];
2504 oprintf("module %s\n", b->name);
2505 for (i = 0; i < b->globals_count; ++i)
2508 if (b->globals[i]->isconst)
2509 oprintf("%s = ", b->globals[i]->name);
2510 ir_value_dump(b->globals[i], oprintf);
2513 for (i = 0; i < b->functions_count; ++i)
2514 ir_function_dump(b->functions[i], indent, oprintf);
2515 oprintf("endmodule %s\n", b->name);
2518 void ir_function_dump(ir_function *f, char *ind,
2519 int (*oprintf)(const char*, ...))
2522 oprintf("%sfunction %s\n", ind, f->name);
2523 strncat(ind, "\t", IND_BUFSZ);
2524 if (f->locals_count)
2526 oprintf("%s%i locals:\n", ind, (int)f->locals_count);
2527 for (i = 0; i < f->locals_count; ++i) {
2528 oprintf("%s\t", ind);
2529 ir_value_dump(f->locals[i], oprintf);
2533 if (f->blocks_count)
2535 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
2536 for (i = 0; i < f->blocks_count; ++i) {
2537 if (f->blocks[i]->run_id != f->run_id) {
2538 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
2540 ir_block_dump(f->blocks[i], ind, oprintf);
2544 ind[strlen(ind)-1] = 0;
2545 oprintf("%sendfunction %s\n", ind, f->name);
2548 void ir_block_dump(ir_block* b, char *ind,
2549 int (*oprintf)(const char*, ...))
2552 oprintf("%s:%s\n", ind, b->label);
2553 strncat(ind, "\t", IND_BUFSZ);
2555 for (i = 0; i < b->instr_count; ++i)
2556 ir_instr_dump(b->instr[i], ind, oprintf);
2557 ind[strlen(ind)-1] = 0;
2560 void dump_phi(ir_instr *in, char *ind,
2561 int (*oprintf)(const char*, ...))
2564 oprintf("%s <- phi ", in->_ops[0]->name);
2565 for (i = 0; i < in->phi_count; ++i)
2567 oprintf("([%s] : %s) ", in->phi[i].from->label,
2568 in->phi[i].value->name);
2573 void ir_instr_dump(ir_instr *in, char *ind,
2574 int (*oprintf)(const char*, ...))
2577 const char *comma = NULL;
2579 oprintf("%s (%i) ", ind, (int)in->eid);
2581 if (in->opcode == VINSTR_PHI) {
2582 dump_phi(in, ind, oprintf);
2586 strncat(ind, "\t", IND_BUFSZ);
2588 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
2589 ir_value_dump(in->_ops[0], oprintf);
2590 if (in->_ops[1] || in->_ops[2])
2593 oprintf("%s\t", qc_opname(in->opcode));
2594 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
2595 ir_value_dump(in->_ops[0], oprintf);
2600 for (i = 1; i != 3; ++i) {
2604 ir_value_dump(in->_ops[i], oprintf);
2612 oprintf("[%s]", in->bops[0]->label);
2616 oprintf("%s[%s]", comma, in->bops[1]->label);
2618 ind[strlen(ind)-1] = 0;
2621 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
2629 oprintf("%g", v->constval.vfloat);
2632 oprintf("'%g %g %g'",
2635 v->constval.vvec.z);
2638 oprintf("(entity)");
2641 oprintf("\"%s\"", v->constval.vstring);
2645 oprintf("%i", v->constval.vint);
2650 v->constval.vpointer->name);
2654 oprintf("%s", v->name);
2658 void ir_value_dump_life(ir_value *self, int (*oprintf)(const char*,...))
2661 oprintf("Life of %s:\n", self->name);
2662 for (i = 0; i < self->life_count; ++i)
2664 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);