5 * Permission is hereby granted, free of charge, to any person obtaining a copy of
6 * this software and associated documentation files (the "Software"), to deal in
7 * the Software without restriction, including without limitation the rights to
8 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
9 * of the Software, and to permit persons to whom the Software is furnished to do
10 * so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in all
13 * copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
28 /***********************************************************************
29 * Type sizes used at multiple points in the IR codegen
32 size_t type_sizeof[TYPE_COUNT] = {
39 1, /* TYPE_FUNCTION */
47 uint16_t type_store_instr[TYPE_COUNT] = {
48 INSTR_STORE_F, /* should use I when having integer support */
55 INSTR_STORE_ENT, /* should use I */
57 INSTR_STORE_ENT, /* integer type */
59 INSTR_STORE_V, /* variant, should never be accessed */
62 uint16_t type_storep_instr[TYPE_COUNT] = {
63 INSTR_STOREP_F, /* should use I when having integer support */
70 INSTR_STOREP_ENT, /* should use I */
72 INSTR_STOREP_ENT, /* integer type */
74 INSTR_STOREP_V, /* variant, should never be accessed */
77 MEM_VEC_FUNCTIONS(ir_value_vector, ir_value*, v)
79 /***********************************************************************
83 ir_builder* ir_builder_new(const char *modulename)
87 self = (ir_builder*)mem_a(sizeof(*self));
91 MEM_VECTOR_INIT(self, functions);
92 MEM_VECTOR_INIT(self, globals);
94 if (!ir_builder_set_name(self, modulename)) {
99 /* globals which always exist */
101 /* for now we give it a vector size */
102 ir_builder_create_global(self, "OFS_RETURN", TYPE_VARIANT);
107 MEM_VEC_FUNCTIONS(ir_builder, ir_value*, globals)
108 MEM_VEC_FUNCTIONS(ir_builder, ir_function*, functions)
110 void ir_builder_delete(ir_builder* self)
113 mem_d((void*)self->name);
114 for (i = 0; i != self->functions_count; ++i) {
115 ir_function_delete(self->functions[i]);
117 MEM_VECTOR_CLEAR(self, functions);
118 for (i = 0; i != self->globals_count; ++i) {
119 ir_value_delete(self->globals[i]);
121 MEM_VECTOR_CLEAR(self, globals);
125 bool ir_builder_set_name(ir_builder *self, const char *name)
128 mem_d((void*)self->name);
129 self->name = util_strdup(name);
133 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
136 for (i = 0; i < self->functions_count; ++i) {
137 if (!strcmp(name, self->functions[i]->name))
138 return self->functions[i];
143 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
145 ir_function *fn = ir_builder_get_function(self, name);
150 fn = ir_function_new(self, outtype);
151 if (!ir_function_set_name(fn, name) ||
152 !ir_builder_functions_add(self, fn) )
154 ir_function_delete(fn);
158 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
160 ir_function_delete(fn);
164 fn->value->isconst = true;
165 fn->value->outtype = outtype;
166 fn->value->constval.vfunc = fn;
167 fn->value->context = fn->context;
172 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
175 for (i = 0; i < self->globals_count; ++i) {
176 if (!strcmp(self->globals[i]->name, name))
177 return self->globals[i];
182 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
184 ir_value *ve = ir_builder_get_global(self, name);
189 ve = ir_value_var(name, store_global, vtype);
190 if (!ir_builder_globals_add(self, ve)) {
197 /***********************************************************************
201 bool ir_function_naive_phi(ir_function*);
202 void ir_function_enumerate(ir_function*);
203 bool ir_function_calculate_liferanges(ir_function*);
204 bool ir_function_allocate_locals(ir_function*);
206 ir_function* ir_function_new(ir_builder* owner, int outtype)
209 self = (ir_function*)mem_a(sizeof(*self));
215 if (!ir_function_set_name(self, "<@unnamed>")) {
220 self->context.file = "<@no context>";
221 self->context.line = 0;
222 self->outtype = outtype;
225 MEM_VECTOR_INIT(self, params);
226 MEM_VECTOR_INIT(self, blocks);
227 MEM_VECTOR_INIT(self, values);
228 MEM_VECTOR_INIT(self, locals);
233 MEM_VEC_FUNCTIONS(ir_function, ir_value*, values)
234 MEM_VEC_FUNCTIONS(ir_function, ir_block*, blocks)
235 MEM_VEC_FUNCTIONS(ir_function, ir_value*, locals)
236 MEM_VEC_FUNCTIONS(ir_function, int, params)
238 bool ir_function_set_name(ir_function *self, const char *name)
241 mem_d((void*)self->name);
242 self->name = util_strdup(name);
246 void ir_function_delete(ir_function *self)
249 mem_d((void*)self->name);
251 for (i = 0; i != self->blocks_count; ++i)
252 ir_block_delete(self->blocks[i]);
253 MEM_VECTOR_CLEAR(self, blocks);
255 MEM_VECTOR_CLEAR(self, params);
257 for (i = 0; i != self->values_count; ++i)
258 ir_value_delete(self->values[i]);
259 MEM_VECTOR_CLEAR(self, values);
261 for (i = 0; i != self->locals_count; ++i)
262 ir_value_delete(self->locals[i]);
263 MEM_VECTOR_CLEAR(self, locals);
265 /* self->value is deleted by the builder */
270 bool GMQCC_WARN ir_function_collect_value(ir_function *self, ir_value *v)
272 return ir_function_values_add(self, v);
275 ir_block* ir_function_create_block(ir_function *self, const char *label)
277 ir_block* bn = ir_block_new(self, label);
278 memcpy(&bn->context, &self->context, sizeof(self->context));
279 if (!ir_function_blocks_add(self, bn)) {
286 bool ir_function_finalize(ir_function *self)
291 if (!ir_function_naive_phi(self))
294 ir_function_enumerate(self);
296 if (!ir_function_calculate_liferanges(self))
299 if (!ir_function_allocate_locals(self))
304 ir_value* ir_function_get_local(ir_function *self, const char *name)
307 for (i = 0; i < self->locals_count; ++i) {
308 if (!strcmp(self->locals[i]->name, name))
309 return self->locals[i];
314 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype)
316 ir_value *ve = ir_function_get_local(self, name);
321 ve = ir_value_var(name, store_local, vtype);
322 if (!ir_function_locals_add(self, ve)) {
329 /***********************************************************************
333 ir_block* ir_block_new(ir_function* owner, const char *name)
336 self = (ir_block*)mem_a(sizeof(*self));
340 memset(self, 0, sizeof(*self));
343 if (!ir_block_set_label(self, name)) {
348 self->context.file = "<@no context>";
349 self->context.line = 0;
351 MEM_VECTOR_INIT(self, instr);
352 MEM_VECTOR_INIT(self, entries);
353 MEM_VECTOR_INIT(self, exits);
356 self->is_return = false;
358 MEM_VECTOR_INIT(self, living);
360 self->generated = false;
364 MEM_VEC_FUNCTIONS(ir_block, ir_instr*, instr)
365 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, entries)
366 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, exits)
367 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_value*, living)
369 void ir_block_delete(ir_block* self)
373 for (i = 0; i != self->instr_count; ++i)
374 ir_instr_delete(self->instr[i]);
375 MEM_VECTOR_CLEAR(self, instr);
376 MEM_VECTOR_CLEAR(self, entries);
377 MEM_VECTOR_CLEAR(self, exits);
378 MEM_VECTOR_CLEAR(self, living);
382 bool ir_block_set_label(ir_block *self, const char *name)
385 mem_d((void*)self->label);
386 self->label = util_strdup(name);
387 return !!self->label;
390 /***********************************************************************
394 ir_instr* ir_instr_new(ir_block* owner, int op)
397 self = (ir_instr*)mem_a(sizeof(*self));
402 self->context.file = "<@no context>";
403 self->context.line = 0;
405 self->_ops[0] = NULL;
406 self->_ops[1] = NULL;
407 self->_ops[2] = NULL;
408 self->bops[0] = NULL;
409 self->bops[1] = NULL;
410 MEM_VECTOR_INIT(self, phi);
411 MEM_VECTOR_INIT(self, params);
416 MEM_VEC_FUNCTIONS(ir_instr, ir_phi_entry_t, phi)
417 MEM_VEC_FUNCTIONS(ir_instr, ir_value*, params)
419 void ir_instr_delete(ir_instr *self)
422 /* The following calls can only delete from
423 * vectors, we still want to delete this instruction
424 * so ignore the return value. Since with the warn_unused_result attribute
425 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
426 * I have to improvise here and use if(foo());
428 for (i = 0; i < self->phi_count; ++i) {
430 if (ir_value_writes_find(self->phi[i].value, self, &idx))
431 if (ir_value_writes_remove(self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
432 if (ir_value_reads_find(self->phi[i].value, self, &idx))
433 if (ir_value_reads_remove (self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
435 MEM_VECTOR_CLEAR(self, phi);
436 for (i = 0; i < self->params_count; ++i) {
438 if (ir_value_writes_find(self->params[i], self, &idx))
439 if (ir_value_writes_remove(self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
440 if (ir_value_reads_find(self->params[i], self, &idx))
441 if (ir_value_reads_remove (self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
443 MEM_VECTOR_CLEAR(self, params);
444 if (ir_instr_op(self, 0, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
445 if (ir_instr_op(self, 1, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
446 if (ir_instr_op(self, 2, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
450 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
452 if (self->_ops[op]) {
454 if (writing && ir_value_writes_find(self->_ops[op], self, &idx))
456 if (!ir_value_writes_remove(self->_ops[op], idx))
459 else if (ir_value_reads_find(self->_ops[op], self, &idx))
461 if (!ir_value_reads_remove(self->_ops[op], idx))
467 if (!ir_value_writes_add(v, self))
470 if (!ir_value_reads_add(v, self))
478 /***********************************************************************
482 ir_value* ir_value_var(const char *name, int storetype, int vtype)
485 self = (ir_value*)mem_a(sizeof(*self));
487 self->fieldtype = TYPE_VOID;
488 self->outtype = TYPE_VOID;
489 self->store = storetype;
490 MEM_VECTOR_INIT(self, reads);
491 MEM_VECTOR_INIT(self, writes);
492 self->isconst = false;
493 self->context.file = "<@no context>";
494 self->context.line = 0;
496 ir_value_set_name(self, name);
498 memset(&self->constval, 0, sizeof(self->constval));
499 memset(&self->code, 0, sizeof(self->code));
501 MEM_VECTOR_INIT(self, life);
504 MEM_VEC_FUNCTIONS(ir_value, ir_life_entry_t, life)
505 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, reads)
506 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, writes)
508 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
510 ir_value *v = ir_value_var(name, storetype, vtype);
513 if (!ir_function_collect_value(owner, v))
521 void ir_value_delete(ir_value* self)
524 mem_d((void*)self->name);
527 if (self->vtype == TYPE_STRING)
528 mem_d((void*)self->constval.vstring);
530 MEM_VECTOR_CLEAR(self, reads);
531 MEM_VECTOR_CLEAR(self, writes);
532 MEM_VECTOR_CLEAR(self, life);
536 void ir_value_set_name(ir_value *self, const char *name)
539 mem_d((void*)self->name);
540 self->name = util_strdup(name);
543 bool ir_value_set_float(ir_value *self, float f)
545 if (self->vtype != TYPE_FLOAT)
547 self->constval.vfloat = f;
548 self->isconst = true;
552 bool ir_value_set_func(ir_value *self, int f)
554 if (self->vtype != TYPE_FUNCTION)
556 self->constval.vint = f;
557 self->isconst = true;
561 bool ir_value_set_vector(ir_value *self, vector v)
563 if (self->vtype != TYPE_VECTOR)
565 self->constval.vvec = v;
566 self->isconst = true;
570 bool ir_value_set_string(ir_value *self, const char *str)
572 if (self->vtype != TYPE_STRING)
574 self->constval.vstring = util_strdup(str);
575 self->isconst = true;
580 bool ir_value_set_int(ir_value *self, int i)
582 if (self->vtype != TYPE_INTEGER)
584 self->constval.vint = i;
585 self->isconst = true;
590 bool ir_value_lives(ir_value *self, size_t at)
593 for (i = 0; i < self->life_count; ++i)
595 ir_life_entry_t *life = &self->life[i];
596 if (life->start <= at && at <= life->end)
598 if (life->start > at) /* since it's ordered */
604 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
607 if (!ir_value_life_add(self, e)) /* naive... */
609 for (k = self->life_count-1; k > idx; --k)
610 self->life[k] = self->life[k-1];
615 bool ir_value_life_merge(ir_value *self, size_t s)
618 ir_life_entry_t *life = NULL;
619 ir_life_entry_t *before = NULL;
620 ir_life_entry_t new_entry;
622 /* Find the first range >= s */
623 for (i = 0; i < self->life_count; ++i)
626 life = &self->life[i];
630 /* nothing found? append */
631 if (i == self->life_count) {
633 if (life && life->end+1 == s)
635 /* previous life range can be merged in */
639 if (life && life->end >= s)
642 if (!ir_value_life_add(self, e))
643 return false; /* failing */
649 if (before->end + 1 == s &&
650 life->start - 1 == s)
653 before->end = life->end;
654 if (!ir_value_life_remove(self, i))
655 return false; /* failing */
658 if (before->end + 1 == s)
664 /* already contained */
665 if (before->end >= s)
669 if (life->start - 1 == s)
674 /* insert a new entry */
675 new_entry.start = new_entry.end = s;
676 return ir_value_life_insert(self, i, new_entry);
679 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
683 if (!other->life_count)
686 if (!self->life_count) {
687 for (i = 0; i < other->life_count; ++i) {
688 if (!ir_value_life_add(self, other->life[i]))
695 for (i = 0; i < other->life_count; ++i)
697 const ir_life_entry_t *life = &other->life[i];
700 ir_life_entry_t *entry = &self->life[myi];
702 if (life->end+1 < entry->start)
704 /* adding an interval before entry */
705 if (!ir_value_life_insert(self, myi, *life))
711 if (life->start < entry->start &&
712 life->end >= entry->start)
714 /* starts earlier and overlaps */
715 entry->start = life->start;
718 if (life->end > entry->end &&
719 life->start-1 <= entry->end)
721 /* ends later and overlaps */
722 entry->end = life->end;
725 /* see if our change combines it with the next ranges */
726 while (myi+1 < self->life_count &&
727 entry->end+1 >= self->life[1+myi].start)
729 /* overlaps with (myi+1) */
730 if (entry->end < self->life[1+myi].end)
731 entry->end = self->life[1+myi].end;
732 if (!ir_value_life_remove(self, myi+1))
734 entry = &self->life[myi];
737 /* see if we're after the entry */
738 if (life->start > entry->end)
741 /* append if we're at the end */
742 if (myi >= self->life_count) {
743 if (!ir_value_life_add(self, *life))
747 /* otherweise check the next range */
756 bool ir_values_overlap(const ir_value *a, const ir_value *b)
758 /* For any life entry in A see if it overlaps with
759 * any life entry in B.
760 * Note that the life entries are orderes, so we can make a
761 * more efficient algorithm there than naively translating the
765 ir_life_entry_t *la, *lb, *enda, *endb;
767 /* first of all, if either has no life range, they cannot clash */
768 if (!a->life_count || !b->life_count)
773 enda = la + a->life_count;
774 endb = lb + b->life_count;
777 /* check if the entries overlap, for that,
778 * both must start before the other one ends.
780 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
781 if (la->start <= lb->end &&
782 lb->start <= la->end)
784 if (la->start < lb->end &&
791 /* entries are ordered
792 * one entry is earlier than the other
793 * that earlier entry will be moved forward
795 if (la->start < lb->start)
797 /* order: A B, move A forward
798 * check if we hit the end with A
803 else if (lb->start < la->start)
805 /* order: B A, move B forward
806 * check if we hit the end with B
815 /***********************************************************************
819 bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
821 if (target->store == store_value) {
822 fprintf(stderr, "cannot store to an SSA value\n");
823 fprintf(stderr, "trying to store: %s <- %s\n", target->name, what->name);
826 ir_instr *in = ir_instr_new(self, op);
829 if (!ir_instr_op(in, 0, target, true) ||
830 !ir_instr_op(in, 1, what, false) ||
831 !ir_block_instr_add(self, in) )
839 bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
843 if (target->vtype == TYPE_VARIANT)
846 vtype = target->vtype;
849 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
850 op = INSTR_CONV_ITOF;
851 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
852 op = INSTR_CONV_FTOI;
854 op = type_store_instr[vtype];
856 return ir_block_create_store_op(self, op, target, what);
859 bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
864 if (target->vtype != TYPE_POINTER)
867 /* storing using pointer - target is a pointer, type must be
868 * inferred from source
872 op = type_storep_instr[vtype];
874 return ir_block_create_store_op(self, op, target, what);
877 bool ir_block_create_return(ir_block *self, ir_value *v)
881 fprintf(stderr, "block already ended (%s)\n", self->label);
885 self->is_return = true;
886 in = ir_instr_new(self, INSTR_RETURN);
890 if (!ir_instr_op(in, 0, v, false) ||
891 !ir_block_instr_add(self, in) )
898 bool ir_block_create_if(ir_block *self, ir_value *v,
899 ir_block *ontrue, ir_block *onfalse)
903 fprintf(stderr, "block already ended (%s)\n", self->label);
907 /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
908 in = ir_instr_new(self, VINSTR_COND);
912 if (!ir_instr_op(in, 0, v, false)) {
917 in->bops[0] = ontrue;
918 in->bops[1] = onfalse;
920 if (!ir_block_instr_add(self, in))
923 if (!ir_block_exits_add(self, ontrue) ||
924 !ir_block_exits_add(self, onfalse) ||
925 !ir_block_entries_add(ontrue, self) ||
926 !ir_block_entries_add(onfalse, self) )
933 bool ir_block_create_jump(ir_block *self, ir_block *to)
937 fprintf(stderr, "block already ended (%s)\n", self->label);
941 in = ir_instr_new(self, VINSTR_JUMP);
946 if (!ir_block_instr_add(self, in))
949 if (!ir_block_exits_add(self, to) ||
950 !ir_block_entries_add(to, self) )
957 bool ir_block_create_goto(ir_block *self, ir_block *to)
961 fprintf(stderr, "block already ended (%s)\n", self->label);
965 in = ir_instr_new(self, INSTR_GOTO);
970 if (!ir_block_instr_add(self, in))
973 if (!ir_block_exits_add(self, to) ||
974 !ir_block_entries_add(to, self) )
981 ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
985 in = ir_instr_new(self, VINSTR_PHI);
988 out = ir_value_out(self->owner, label, store_value, ot);
993 if (!ir_instr_op(in, 0, out, true)) {
995 ir_value_delete(out);
998 if (!ir_block_instr_add(self, in)) {
1000 ir_value_delete(out);
1006 ir_value* ir_phi_value(ir_instr *self)
1008 return self->_ops[0];
1011 bool ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1015 if (!ir_block_entries_find(self->owner, b, NULL)) {
1016 /* Must not be possible to cause this, otherwise the AST
1017 * is doing something wrong.
1019 fprintf(stderr, "Invalid entry block for PHI\n");
1025 if (!ir_value_reads_add(v, self))
1027 return ir_instr_phi_add(self, pe);
1030 /* call related code */
1031 ir_instr* ir_block_create_call(ir_block *self, const char *label, ir_value *func)
1035 in = ir_instr_new(self, INSTR_CALL0);
1038 out = ir_value_out(self->owner, label, store_return, func->outtype);
1040 ir_instr_delete(in);
1043 if (!ir_instr_op(in, 0, out, true) ||
1044 !ir_instr_op(in, 1, func, false) ||
1045 !ir_block_instr_add(self, in))
1047 ir_instr_delete(in);
1048 ir_value_delete(out);
1054 ir_value* ir_call_value(ir_instr *self)
1056 return self->_ops[0];
1059 bool ir_call_param(ir_instr* self, ir_value *v)
1061 if (!ir_instr_params_add(self, v))
1063 if (!ir_value_reads_add(v, self)) {
1064 if (!ir_instr_params_remove(self, self->params_count-1))
1065 GMQCC_SUPPRESS_EMPTY_BODY;
1071 /* binary op related code */
1073 ir_value* ir_block_create_binop(ir_block *self,
1074 const char *label, int opcode,
1075 ir_value *left, ir_value *right)
1097 case INSTR_SUB_S: /* -- offset of string as float */
1102 case INSTR_BITOR_IF:
1103 case INSTR_BITOR_FI:
1104 case INSTR_BITAND_FI:
1105 case INSTR_BITAND_IF:
1120 case INSTR_BITAND_I:
1123 case INSTR_RSHIFT_I:
1124 case INSTR_LSHIFT_I:
1146 /* boolean operations result in floats */
1147 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1149 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1152 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1157 if (ot == TYPE_VOID) {
1158 /* The AST or parser were supposed to check this! */
1162 return ir_block_create_general_instr(self, label, opcode, left, right, ot);
1165 ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
1166 int op, ir_value *a, ir_value *b, int outype)
1171 out = ir_value_out(self->owner, label, store_value, outype);
1175 instr = ir_instr_new(self, op);
1177 ir_value_delete(out);
1181 if (!ir_instr_op(instr, 0, out, true) ||
1182 !ir_instr_op(instr, 1, a, false) ||
1183 !ir_instr_op(instr, 2, b, false) )
1188 if (!ir_block_instr_add(self, instr))
1193 ir_instr_delete(instr);
1194 ir_value_delete(out);
1198 ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
1200 /* Support for various pointer types todo if so desired */
1201 if (ent->vtype != TYPE_ENTITY)
1204 if (field->vtype != TYPE_FIELD)
1207 return ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1210 ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
1213 if (ent->vtype != TYPE_ENTITY)
1216 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1217 if (field->vtype != TYPE_FIELD)
1222 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1223 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1224 case TYPE_STRING: op = INSTR_LOAD_S; break;
1225 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1226 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1228 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1229 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1235 return ir_block_create_general_instr(self, label, op, ent, field, outype);
1238 ir_value* ir_block_create_add(ir_block *self,
1240 ir_value *left, ir_value *right)
1243 int l = left->vtype;
1244 int r = right->vtype;
1263 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1265 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1271 return ir_block_create_binop(self, label, op, left, right);
1274 ir_value* ir_block_create_sub(ir_block *self,
1276 ir_value *left, ir_value *right)
1279 int l = left->vtype;
1280 int r = right->vtype;
1300 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1302 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1308 return ir_block_create_binop(self, label, op, left, right);
1311 ir_value* ir_block_create_mul(ir_block *self,
1313 ir_value *left, ir_value *right)
1316 int l = left->vtype;
1317 int r = right->vtype;
1336 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1338 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1341 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1343 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1345 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1347 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1353 return ir_block_create_binop(self, label, op, left, right);
1356 ir_value* ir_block_create_div(ir_block *self,
1358 ir_value *left, ir_value *right)
1361 int l = left->vtype;
1362 int r = right->vtype;
1379 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1381 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1383 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1389 return ir_block_create_binop(self, label, op, left, right);
1392 /* PHI resolving breaks the SSA, and must thus be the last
1393 * step before life-range calculation.
1396 static bool ir_block_naive_phi(ir_block *self);
1397 bool ir_function_naive_phi(ir_function *self)
1401 for (i = 0; i < self->blocks_count; ++i)
1403 if (!ir_block_naive_phi(self->blocks[i]))
1409 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1414 /* create a store */
1415 if (!ir_block_create_store(block, old, what))
1418 /* we now move it up */
1419 instr = block->instr[block->instr_count-1];
1420 for (i = block->instr_count; i > iid; --i)
1421 block->instr[i] = block->instr[i-1];
1422 block->instr[i] = instr;
1427 static bool ir_block_naive_phi(ir_block *self)
1430 /* FIXME: optionally, create_phi can add the phis
1431 * to a list so we don't need to loop through blocks
1432 * - anyway: "don't optimize YET"
1434 for (i = 0; i < self->instr_count; ++i)
1436 ir_instr *instr = self->instr[i];
1437 if (instr->opcode != VINSTR_PHI)
1440 if (!ir_block_instr_remove(self, i))
1442 --i; /* NOTE: i+1 below */
1444 for (p = 0; p < instr->phi_count; ++p)
1446 ir_value *v = instr->phi[p].value;
1447 for (w = 0; w < v->writes_count; ++w) {
1450 if (!v->writes[w]->_ops[0])
1453 /* When the write was to a global, we have to emit a mov */
1454 old = v->writes[w]->_ops[0];
1456 /* The original instruction now writes to the PHI target local */
1457 if (v->writes[w]->_ops[0] == v)
1458 v->writes[w]->_ops[0] = instr->_ops[0];
1460 if (old->store != store_value && old->store != store_local && old->store != store_param)
1462 /* If it originally wrote to a global we need to store the value
1465 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1467 if (i+1 < self->instr_count)
1468 instr = self->instr[i+1];
1471 /* In case I forget and access instr later, it'll be NULL
1472 * when it's a problem, to make sure we crash, rather than accessing
1478 /* If it didn't, we can replace all reads by the phi target now. */
1480 for (r = 0; r < old->reads_count; ++r)
1483 ir_instr *ri = old->reads[r];
1484 for (op = 0; op < ri->phi_count; ++op) {
1485 if (ri->phi[op].value == old)
1486 ri->phi[op].value = v;
1488 for (op = 0; op < 3; ++op) {
1489 if (ri->_ops[op] == old)
1496 ir_instr_delete(instr);
1501 /***********************************************************************
1502 *IR Temp allocation code
1503 * Propagating value life ranges by walking through the function backwards
1504 * until no more changes are made.
1505 * In theory this should happen once more than once for every nested loop
1507 * Though this implementation might run an additional time for if nests.
1516 MEM_VEC_FUNCTIONS_ALL(new_reads_t, ir_value*, v)
1518 /* Enumerate instructions used by value's life-ranges
1520 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1524 for (i = 0; i < self->instr_count; ++i)
1526 self->instr[i]->eid = eid++;
1531 /* Enumerate blocks and instructions.
1532 * The block-enumeration is unordered!
1533 * We do not really use the block enumreation, however
1534 * the instruction enumeration is important for life-ranges.
1536 void ir_function_enumerate(ir_function *self)
1539 size_t instruction_id = 0;
1540 for (i = 0; i < self->blocks_count; ++i)
1542 self->blocks[i]->eid = i;
1543 self->blocks[i]->run_id = 0;
1544 ir_block_enumerate(self->blocks[i], &instruction_id);
1548 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
1549 bool ir_function_calculate_liferanges(ir_function *self)
1557 for (i = 0; i != self->blocks_count; ++i)
1559 if (self->blocks[i]->is_return)
1561 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
1569 /* Local-value allocator
1570 * After finishing creating the liferange of all values used in a function
1571 * we can allocate their global-positions.
1572 * This is the counterpart to register-allocation in register machines.
1575 MEM_VECTOR_MAKE(ir_value*, locals);
1576 MEM_VECTOR_MAKE(size_t, sizes);
1577 MEM_VECTOR_MAKE(size_t, positions);
1578 } function_allocator;
1579 MEM_VEC_FUNCTIONS(function_allocator, ir_value*, locals)
1580 MEM_VEC_FUNCTIONS(function_allocator, size_t, sizes)
1581 MEM_VEC_FUNCTIONS(function_allocator, size_t, positions)
1583 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
1586 size_t vsize = type_sizeof[var->vtype];
1588 slot = ir_value_var("reg", store_global, var->vtype);
1592 if (!ir_value_life_merge_into(slot, var))
1595 if (!function_allocator_locals_add(alloc, slot))
1598 if (!function_allocator_sizes_add(alloc, vsize))
1604 ir_value_delete(slot);
1608 bool ir_function_allocate_locals(ir_function *self)
1617 function_allocator alloc;
1619 if (!self->locals_count)
1622 MEM_VECTOR_INIT(&alloc, locals);
1623 MEM_VECTOR_INIT(&alloc, sizes);
1624 MEM_VECTOR_INIT(&alloc, positions);
1626 for (i = 0; i < self->locals_count; ++i)
1628 if (!function_allocator_alloc(&alloc, self->locals[i]))
1632 /* Allocate a slot for any value that still exists */
1633 for (i = 0; i < self->values_count; ++i)
1635 v = self->values[i];
1640 for (a = 0; a < alloc.locals_count; ++a)
1642 slot = alloc.locals[a];
1644 if (ir_values_overlap(v, slot))
1647 if (!ir_value_life_merge_into(slot, v))
1650 /* adjust size for this slot */
1651 if (alloc.sizes[a] < type_sizeof[v->vtype])
1652 alloc.sizes[a] = type_sizeof[v->vtype];
1654 self->values[i]->code.local = a;
1657 if (a >= alloc.locals_count) {
1658 self->values[i]->code.local = alloc.locals_count;
1659 if (!function_allocator_alloc(&alloc, v))
1664 /* Adjust slot positions based on sizes */
1665 if (!function_allocator_positions_add(&alloc, 0))
1668 if (alloc.sizes_count)
1669 pos = alloc.positions[0] + alloc.sizes[0];
1672 for (i = 1; i < alloc.sizes_count; ++i)
1674 pos = alloc.positions[i-1] + alloc.sizes[i-1];
1675 if (!function_allocator_positions_add(&alloc, pos))
1679 self->allocated_locals = pos + alloc.sizes[alloc.sizes_count-1];
1681 /* Take over the actual slot positions */
1682 for (i = 0; i < self->values_count; ++i)
1683 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
1690 for (i = 0; i < alloc.locals_count; ++i)
1691 ir_value_delete(alloc.locals[i]);
1692 MEM_VECTOR_CLEAR(&alloc, locals);
1693 MEM_VECTOR_CLEAR(&alloc, sizes);
1694 MEM_VECTOR_CLEAR(&alloc, positions);
1698 /* Get information about which operand
1699 * is read from, or written to.
1701 static void ir_op_read_write(int op, size_t *read, size_t *write)
1728 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
1731 bool changed = false;
1733 for (i = 0; i != self->living_count; ++i)
1735 tempbool = ir_value_life_merge(self->living[i], eid);
1738 fprintf(stderr, "block_living_add_instr() value instruction added %s: %i\n", self->living[i]->_name, (int)eid);
1740 changed = changed || tempbool;
1745 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
1748 /* values which have been read in a previous iteration are now
1749 * in the "living" array even if the previous block doesn't use them.
1750 * So we have to remove whatever does not exist in the previous block.
1751 * They will be re-added on-read, but the liferange merge won't cause
1754 for (i = 0; i < self->living_count; ++i)
1756 if (!ir_block_living_find(prev, self->living[i], NULL)) {
1757 if (!ir_block_living_remove(self, i))
1763 /* Whatever the previous block still has in its living set
1764 * must now be added to ours as well.
1766 for (i = 0; i < prev->living_count; ++i)
1768 if (ir_block_living_find(self, prev->living[i], NULL))
1770 if (!ir_block_living_add(self, prev->living[i]))
1773 printf("%s got from prev: %s\n", self->label, prev->living[i]->_name);
1779 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
1785 /* bitmasks which operands are read from or written to */
1787 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1789 new_reads_t new_reads;
1791 char dbg_ind[16] = { '#', '0' };
1794 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1795 MEM_VECTOR_INIT(&new_reads, v);
1800 if (!ir_block_life_prop_previous(self, prev, changed))
1804 i = self->instr_count;
1807 instr = self->instr[i];
1809 /* PHI operands are always read operands */
1810 for (p = 0; p < instr->phi_count; ++p)
1812 value = instr->phi[p].value;
1813 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1814 if (!ir_block_living_find(self, value, NULL) &&
1815 !ir_block_living_add(self, value))
1820 if (!new_reads_t_v_find(&new_reads, value, NULL))
1822 if (!new_reads_t_v_add(&new_reads, value))
1828 /* See which operands are read and write operands */
1829 ir_op_read_write(instr->opcode, &read, &write);
1831 /* Go through the 3 main operands */
1832 for (o = 0; o < 3; ++o)
1834 if (!instr->_ops[o]) /* no such operand */
1837 value = instr->_ops[o];
1839 /* We only care about locals */
1840 /* we also calculate parameter liferanges so that locals
1841 * can take up parameter slots */
1842 if (value->store != store_value &&
1843 value->store != store_local &&
1844 value->store != store_param)
1850 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1851 if (!ir_block_living_find(self, value, NULL) &&
1852 !ir_block_living_add(self, value))
1857 /* fprintf(stderr, "read: %s\n", value->_name); */
1858 if (!new_reads_t_v_find(&new_reads, value, NULL))
1860 if (!new_reads_t_v_add(&new_reads, value))
1866 /* write operands */
1867 /* When we write to a local, we consider it "dead" for the
1868 * remaining upper part of the function, since in SSA a value
1869 * can only be written once (== created)
1874 bool in_living = ir_block_living_find(self, value, &idx);
1875 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1877 bool in_reads = new_reads_t_v_find(&new_reads, value, &readidx);
1878 if (!in_living && !in_reads)
1883 /* If the value isn't alive it hasn't been read before... */
1884 /* TODO: See if the warning can be emitted during parsing or AST processing
1885 * otherwise have warning printed here.
1886 * IF printing a warning here: include filecontext_t,
1887 * and make sure it's only printed once
1888 * since this function is run multiple times.
1890 /* For now: debug info: */
1891 fprintf(stderr, "Value only written %s\n", value->name);
1892 tempbool = ir_value_life_merge(value, instr->eid);
1893 *changed = *changed || tempbool;
1895 ir_instr_dump(instr, dbg_ind, printf);
1899 /* since 'living' won't contain it
1900 * anymore, merge the value, since
1903 tempbool = ir_value_life_merge(value, instr->eid);
1906 fprintf(stderr, "value added id %s %i\n", value->name, (int)instr->eid);
1908 *changed = *changed || tempbool;
1910 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1911 if (!ir_block_living_remove(self, idx))
1916 if (!new_reads_t_v_remove(&new_reads, readidx))
1924 tempbool = ir_block_living_add_instr(self, instr->eid);
1925 /*fprintf(stderr, "living added values\n");*/
1926 *changed = *changed || tempbool;
1928 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1930 for (rd = 0; rd < new_reads.v_count; ++rd)
1932 if (!ir_block_living_find(self, new_reads.v[rd], NULL)) {
1933 if (!ir_block_living_add(self, new_reads.v[rd]))
1936 if (!i && !self->entries_count) {
1938 *changed = *changed || ir_value_life_merge(new_reads.v[rd], instr->eid);
1941 MEM_VECTOR_CLEAR(&new_reads, v);
1945 if (self->run_id == self->owner->run_id)
1948 self->run_id = self->owner->run_id;
1950 for (i = 0; i < self->entries_count; ++i)
1952 ir_block *entry = self->entries[i];
1953 ir_block_life_propagate(entry, self, changed);
1958 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1959 MEM_VECTOR_CLEAR(&new_reads, v);
1964 /***********************************************************************
1967 * Since the IR has the convention of putting 'write' operands
1968 * at the beginning, we have to rotate the operands of instructions
1969 * properly in order to generate valid QCVM code.
1971 * Having destinations at a fixed position is more convenient. In QC
1972 * this is *mostly* OPC, but FTE adds at least 2 instructions which
1973 * read from from OPA, and store to OPB rather than OPC. Which is
1974 * partially the reason why the implementation of these instructions
1975 * in darkplaces has been delayed for so long.
1977 * Breaking conventions is annoying...
1979 static bool ir_builder_gen_global(ir_builder *self, ir_value *global);
1981 static bool gen_global_field(ir_value *global)
1983 if (global->isconst)
1985 ir_value *fld = global->constval.vpointer;
1987 printf("Invalid field constant with no field: %s\n", global->name);
1991 /* Now, in this case, a relocation would be impossible to code
1992 * since it looks like this:
1993 * .vector v = origin; <- parse error, wtf is 'origin'?
1996 * But we will need a general relocation support later anyway
1997 * for functions... might as well support that here.
1999 if (!fld->code.globaladdr) {
2000 printf("FIXME: Relocation support\n");
2004 /* copy the field's value */
2005 global->code.globaladdr = code_globals_add(code_globals_data[fld->code.globaladdr]);
2009 prog_section_field fld;
2011 fld.name = global->code.name;
2012 fld.offset = code_fields_elements;
2013 fld.type = global->fieldtype;
2015 if (fld.type == TYPE_VOID) {
2016 printf("Field is missing a type: %s\n", global->name);
2020 if (code_fields_add(fld) < 0)
2023 global->code.globaladdr = code_globals_add(fld.offset);
2025 if (global->code.globaladdr < 0)
2030 static bool gen_global_pointer(ir_value *global)
2032 if (global->isconst)
2034 ir_value *target = global->constval.vpointer;
2036 printf("Invalid pointer constant: %s\n", global->name);
2037 /* NULL pointers are pointing to the NULL constant, which also
2038 * sits at address 0, but still has an ir_value for itself.
2043 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2044 * void() foo; <- proto
2045 * void() *fooptr = &foo;
2046 * void() foo = { code }
2048 if (!target->code.globaladdr) {
2049 /* FIXME: Check for the constant nullptr ir_value!
2050 * because then code.globaladdr being 0 is valid.
2052 printf("FIXME: Relocation support\n");
2056 global->code.globaladdr = code_globals_add(target->code.globaladdr);
2060 global->code.globaladdr = code_globals_add(0);
2062 if (global->code.globaladdr < 0)
2067 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2069 prog_section_statement stmt;
2078 block->generated = true;
2079 block->code_start = code_statements_elements;
2080 for (i = 0; i < block->instr_count; ++i)
2082 instr = block->instr[i];
2084 if (instr->opcode == VINSTR_PHI) {
2085 printf("cannot generate virtual instruction (phi)\n");
2089 if (instr->opcode == VINSTR_JUMP) {
2090 target = instr->bops[0];
2091 /* for uncoditional jumps, if the target hasn't been generated
2092 * yet, we generate them right here.
2094 if (!target->generated) {
2099 /* otherwise we generate a jump instruction */
2100 stmt.opcode = INSTR_GOTO;
2101 stmt.o1.s1 = (target->code_start) - code_statements_elements;
2104 if (code_statements_add(stmt) < 0)
2107 /* no further instructions can be in this block */
2111 if (instr->opcode == VINSTR_COND) {
2112 ontrue = instr->bops[0];
2113 onfalse = instr->bops[1];
2114 /* TODO: have the AST signal which block should
2115 * come first: eg. optimize IFs without ELSE...
2118 stmt.o1.u1 = instr->_ops[0]->code.globaladdr;
2122 if (ontrue->generated) {
2123 stmt.opcode = INSTR_IF;
2124 stmt.o2.s1 = (ontrue->code_start-1) - code_statements_elements;
2125 if (code_statements_add(stmt) < 0)
2128 if (onfalse->generated) {
2129 stmt.opcode = INSTR_IFNOT;
2130 stmt.o2.s1 = (onfalse->code_start-1) - code_statements_elements;
2131 if (code_statements_add(stmt) < 0)
2134 if (!ontrue->generated) {
2135 if (onfalse->generated) {
2140 if (!onfalse->generated) {
2141 if (ontrue->generated) {
2146 /* neither ontrue nor onfalse exist */
2147 stmt.opcode = INSTR_IFNOT;
2148 stidx = code_statements_elements;
2149 if (code_statements_add(stmt) < 0)
2151 /* on false we jump, so add ontrue-path */
2152 if (!gen_blocks_recursive(func, ontrue))
2154 /* fixup the jump address */
2155 code_statements_data[stidx].o2.s1 = code_statements_elements - stidx;
2156 /* generate onfalse path */
2157 if (onfalse->generated) {
2158 /* fixup the jump address */
2159 code_statements_data[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2160 /* may have been generated in the previous recursive call */
2161 stmt.opcode = INSTR_GOTO;
2162 stmt.o1.s1 = (onfalse->code_start) - code_statements_elements;
2165 return (code_statements_add(stmt) >= 0);
2167 /* if not, generate now */
2172 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2173 /* Trivial call translation:
2174 * copy all params to OFS_PARM*
2175 * if the output's storetype is not store_return,
2176 * add append a STORE instruction!
2178 * NOTES on how to do it better without much trouble:
2179 * -) The liferanges!
2180 * Simply check the liferange of all parameters for
2181 * other CALLs. For each param with no CALL in its
2182 * liferange, we can store it in an OFS_PARM at
2183 * generation already. This would even include later
2184 * reuse.... probably... :)
2189 for (p = 0; p < instr->params_count; ++p)
2191 ir_value *param = instr->params[p];
2193 stmt.opcode = INSTR_STORE_F;
2196 stmt.opcode = type_store_instr[param->vtype];
2197 stmt.o1.u1 = param->code.globaladdr;
2198 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2199 if (code_statements_add(stmt) < 0)
2202 stmt.opcode = INSTR_CALL0 + instr->params_count;
2203 if (stmt.opcode > INSTR_CALL8)
2204 stmt.opcode = INSTR_CALL8;
2205 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2208 if (code_statements_add(stmt) < 0)
2211 retvalue = instr->_ops[0];
2212 if (retvalue && retvalue->store != store_return && retvalue->life_count)
2214 /* not to be kept in OFS_RETURN */
2215 stmt.opcode = type_store_instr[retvalue->vtype];
2216 stmt.o1.u1 = OFS_RETURN;
2217 stmt.o2.u1 = retvalue->code.globaladdr;
2219 if (code_statements_add(stmt) < 0)
2225 if (instr->opcode == INSTR_STATE) {
2226 printf("TODO: state instruction\n");
2230 stmt.opcode = instr->opcode;
2235 /* This is the general order of operands */
2237 stmt.o3.u1 = instr->_ops[0]->code.globaladdr;
2240 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2243 stmt.o2.u1 = instr->_ops[2]->code.globaladdr;
2245 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2247 stmt.o1.u1 = stmt.o3.u1;
2250 else if ((stmt.opcode >= INSTR_STORE_F &&
2251 stmt.opcode <= INSTR_STORE_FNC) ||
2252 (stmt.opcode >= INSTR_NOT_F &&
2253 stmt.opcode <= INSTR_NOT_FNC))
2255 /* 2-operand instructions with A -> B */
2256 stmt.o2.u1 = stmt.o3.u1;
2260 if (code_statements_add(stmt) < 0)
2266 static bool gen_function_code(ir_function *self)
2269 prog_section_statement stmt;
2271 /* Starting from entry point, we generate blocks "as they come"
2272 * for now. Dead blocks will not be translated obviously.
2274 if (!self->blocks_count) {
2275 printf("Function '%s' declared without body.\n", self->name);
2279 block = self->blocks[0];
2280 if (block->generated)
2283 if (!gen_blocks_recursive(self, block)) {
2284 printf("failed to generate blocks for '%s'\n", self->name);
2288 /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
2289 stmt.opcode = AINSTR_END;
2293 if (code_statements_add(stmt) < 0)
2298 static bool gen_global_function(ir_builder *ir, ir_value *global)
2300 prog_section_function fun;
2304 size_t local_var_end;
2306 if (!global->isconst || (!global->constval.vfunc))
2308 printf("Invalid state of function-global: not constant: %s\n", global->name);
2312 irfun = global->constval.vfunc;
2314 fun.name = global->code.name;
2315 fun.file = code_cachedstring(global->context.file);
2316 fun.profile = 0; /* always 0 */
2317 fun.nargs = irfun->params_count;
2319 for (i = 0;i < 8; ++i) {
2323 fun.argsize[i] = type_sizeof[irfun->params[i]];
2326 fun.firstlocal = code_globals_elements;
2327 fun.locals = irfun->allocated_locals + irfun->locals_count;
2330 for (i = 0; i < irfun->locals_count; ++i) {
2331 if (!ir_builder_gen_global(ir, irfun->locals[i])) {
2332 printf("Failed to generate global %s\n", irfun->locals[i]->name);
2336 if (irfun->locals_count) {
2337 ir_value *last = irfun->locals[irfun->locals_count-1];
2338 local_var_end = last->code.globaladdr;
2339 local_var_end += type_sizeof[last->vtype];
2341 for (i = 0; i < irfun->values_count; ++i)
2343 /* generate code.globaladdr for ssa values */
2344 ir_value *v = irfun->values[i];
2345 v->code.globaladdr = local_var_end + v->code.local;
2347 for (i = 0; i < irfun->locals_count; ++i) {
2348 /* fill the locals with zeros */
2349 code_globals_add(0);
2353 fun.entry = irfun->builtin;
2355 fun.entry = code_statements_elements;
2356 if (!gen_function_code(irfun)) {
2357 printf("Failed to generate code for function %s\n", irfun->name);
2362 return (code_functions_add(fun) >= 0);
2365 static bool ir_builder_gen_global(ir_builder *self, ir_value *global)
2368 prog_section_def def;
2370 def.type = global->vtype;
2371 def.offset = code_globals_elements;
2372 def.name = global->code.name = code_genstring(global->name);
2374 switch (global->vtype)
2377 if (code_defs_add(def) < 0)
2379 return gen_global_pointer(global);
2381 if (code_defs_add(def) < 0)
2383 return gen_global_field(global);
2388 if (code_defs_add(def) < 0)
2391 if (global->isconst) {
2392 iptr = (int32_t*)&global->constval.vfloat;
2393 global->code.globaladdr = code_globals_add(*iptr);
2395 global->code.globaladdr = code_globals_add(0);
2397 return global->code.globaladdr >= 0;
2401 if (code_defs_add(def) < 0)
2403 if (global->isconst)
2404 global->code.globaladdr = code_globals_add(code_cachedstring(global->constval.vstring));
2406 global->code.globaladdr = code_globals_add(0);
2407 return global->code.globaladdr >= 0;
2412 if (code_defs_add(def) < 0)
2415 if (global->isconst) {
2416 iptr = (int32_t*)&global->constval.vvec;
2417 global->code.globaladdr = code_globals_add(iptr[0]);
2418 if (global->code.globaladdr < 0)
2420 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2422 if (code_globals_add(iptr[d]) < 0)
2426 global->code.globaladdr = code_globals_add(0);
2427 if (global->code.globaladdr < 0)
2429 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2431 if (code_globals_add(0) < 0)
2435 return global->code.globaladdr >= 0;
2438 if (code_defs_add(def) < 0)
2440 global->code.globaladdr = code_globals_elements;
2441 code_globals_add(code_functions_elements);
2442 return gen_global_function(self, global);
2444 /* assume biggest type */
2445 global->code.globaladdr = code_globals_add(0);
2446 code_globals_add(0);
2447 code_globals_add(0);
2450 /* refuse to create 'void' type or any other fancy business. */
2451 printf("Invalid type for global variable %s\n", global->name);
2456 bool ir_builder_generate(ir_builder *self, const char *filename)
2462 for (i = 0; i < self->globals_count; ++i)
2464 if (!ir_builder_gen_global(self, self->globals[i])) {
2469 printf("writing '%s'...\n", filename);
2470 return code_write(filename);
2473 /***********************************************************************
2474 *IR DEBUG Dump functions...
2477 #define IND_BUFSZ 1024
2479 const char *qc_opname(int op)
2481 if (op < 0) return "<INVALID>";
2482 if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
2483 return asm_instr[op].m;
2485 case VINSTR_PHI: return "PHI";
2486 case VINSTR_JUMP: return "JUMP";
2487 case VINSTR_COND: return "COND";
2488 default: return "<UNK>";
2492 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
2495 char indent[IND_BUFSZ];
2499 oprintf("module %s\n", b->name);
2500 for (i = 0; i < b->globals_count; ++i)
2503 if (b->globals[i]->isconst)
2504 oprintf("%s = ", b->globals[i]->name);
2505 ir_value_dump(b->globals[i], oprintf);
2508 for (i = 0; i < b->functions_count; ++i)
2509 ir_function_dump(b->functions[i], indent, oprintf);
2510 oprintf("endmodule %s\n", b->name);
2513 void ir_function_dump(ir_function *f, char *ind,
2514 int (*oprintf)(const char*, ...))
2517 if (f->builtin != 0) {
2518 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
2521 oprintf("%sfunction %s\n", ind, f->name);
2522 strncat(ind, "\t", IND_BUFSZ);
2523 if (f->locals_count)
2525 oprintf("%s%i locals:\n", ind, (int)f->locals_count);
2526 for (i = 0; i < f->locals_count; ++i) {
2527 oprintf("%s\t", ind);
2528 ir_value_dump(f->locals[i], oprintf);
2532 if (f->blocks_count)
2534 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
2535 for (i = 0; i < f->blocks_count; ++i) {
2536 if (f->blocks[i]->run_id != f->run_id) {
2537 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
2539 ir_block_dump(f->blocks[i], ind, oprintf);
2543 ind[strlen(ind)-1] = 0;
2544 oprintf("%sendfunction %s\n", ind, f->name);
2547 void ir_block_dump(ir_block* b, char *ind,
2548 int (*oprintf)(const char*, ...))
2551 oprintf("%s:%s\n", ind, b->label);
2552 strncat(ind, "\t", IND_BUFSZ);
2554 for (i = 0; i < b->instr_count; ++i)
2555 ir_instr_dump(b->instr[i], ind, oprintf);
2556 ind[strlen(ind)-1] = 0;
2559 void dump_phi(ir_instr *in, char *ind,
2560 int (*oprintf)(const char*, ...))
2563 oprintf("%s <- phi ", in->_ops[0]->name);
2564 for (i = 0; i < in->phi_count; ++i)
2566 oprintf("([%s] : %s) ", in->phi[i].from->label,
2567 in->phi[i].value->name);
2572 void ir_instr_dump(ir_instr *in, char *ind,
2573 int (*oprintf)(const char*, ...))
2576 const char *comma = NULL;
2578 oprintf("%s (%i) ", ind, (int)in->eid);
2580 if (in->opcode == VINSTR_PHI) {
2581 dump_phi(in, ind, oprintf);
2585 strncat(ind, "\t", IND_BUFSZ);
2587 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
2588 ir_value_dump(in->_ops[0], oprintf);
2589 if (in->_ops[1] || in->_ops[2])
2592 oprintf("%s\t", qc_opname(in->opcode));
2593 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
2594 ir_value_dump(in->_ops[0], oprintf);
2599 for (i = 1; i != 3; ++i) {
2603 ir_value_dump(in->_ops[i], oprintf);
2611 oprintf("[%s]", in->bops[0]->label);
2615 oprintf("%s[%s]", comma, in->bops[1]->label);
2617 ind[strlen(ind)-1] = 0;
2620 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
2628 oprintf("%g", v->constval.vfloat);
2631 oprintf("'%g %g %g'",
2634 v->constval.vvec.z);
2637 oprintf("(entity)");
2640 oprintf("\"%s\"", v->constval.vstring);
2644 oprintf("%i", v->constval.vint);
2649 v->constval.vpointer->name);
2653 oprintf("%s", v->name);
2657 void ir_value_dump_life(ir_value *self, int (*oprintf)(const char*,...))
2660 oprintf("Life of %s:\n", self->name);
2661 for (i = 0; i < self->life_count; ++i)
2663 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);