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);
93 MEM_VECTOR_INIT(self, fields);
95 if (!ir_builder_set_name(self, modulename)) {
100 /* globals which always exist */
102 /* for now we give it a vector size */
103 ir_builder_create_global(self, "OFS_RETURN", TYPE_VARIANT);
108 MEM_VEC_FUNCTIONS(ir_builder, ir_value*, globals)
109 MEM_VEC_FUNCTIONS(ir_builder, ir_value*, fields)
110 MEM_VEC_FUNCTIONS(ir_builder, ir_function*, functions)
112 void ir_builder_delete(ir_builder* self)
115 mem_d((void*)self->name);
116 for (i = 0; i != self->functions_count; ++i) {
117 ir_function_delete(self->functions[i]);
119 MEM_VECTOR_CLEAR(self, functions);
120 for (i = 0; i != self->globals_count; ++i) {
121 ir_value_delete(self->globals[i]);
123 MEM_VECTOR_CLEAR(self, fields);
124 for (i = 0; i != self->fields_count; ++i) {
125 ir_value_delete(self->fields[i]);
127 MEM_VECTOR_CLEAR(self, fields);
131 bool ir_builder_set_name(ir_builder *self, const char *name)
134 mem_d((void*)self->name);
135 self->name = util_strdup(name);
139 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
142 for (i = 0; i < self->functions_count; ++i) {
143 if (!strcmp(name, self->functions[i]->name))
144 return self->functions[i];
149 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
151 ir_function *fn = ir_builder_get_function(self, name);
156 fn = ir_function_new(self, outtype);
157 if (!ir_function_set_name(fn, name) ||
158 !ir_builder_functions_add(self, fn) )
160 ir_function_delete(fn);
164 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
166 ir_function_delete(fn);
170 fn->value->isconst = true;
171 fn->value->outtype = outtype;
172 fn->value->constval.vfunc = fn;
173 fn->value->context = fn->context;
178 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
181 for (i = 0; i < self->globals_count; ++i) {
182 if (!strcmp(self->globals[i]->name, name))
183 return self->globals[i];
188 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
190 ir_value *ve = ir_builder_get_global(self, name);
195 ve = ir_value_var(name, store_global, vtype);
196 if (!ir_builder_globals_add(self, ve)) {
203 ir_value* ir_builder_get_field(ir_builder *self, const char *name)
206 for (i = 0; i < self->fields_count; ++i) {
207 if (!strcmp(self->fields[i]->name, name))
208 return self->fields[i];
214 ir_value* ir_builder_create_field(ir_builder *self, const char *name, int vtype)
216 ir_value *ve = ir_builder_get_field(self, name);
221 ve = ir_value_var(name, store_global, TYPE_FIELD);
222 ve->fieldtype = vtype;
223 if (!ir_builder_fields_add(self, ve)) {
230 /***********************************************************************
234 bool ir_function_naive_phi(ir_function*);
235 void ir_function_enumerate(ir_function*);
236 bool ir_function_calculate_liferanges(ir_function*);
237 bool ir_function_allocate_locals(ir_function*);
239 ir_function* ir_function_new(ir_builder* owner, int outtype)
242 self = (ir_function*)mem_a(sizeof(*self));
248 if (!ir_function_set_name(self, "<@unnamed>")) {
253 self->context.file = "<@no context>";
254 self->context.line = 0;
255 self->outtype = outtype;
258 MEM_VECTOR_INIT(self, params);
259 MEM_VECTOR_INIT(self, blocks);
260 MEM_VECTOR_INIT(self, values);
261 MEM_VECTOR_INIT(self, locals);
266 MEM_VEC_FUNCTIONS(ir_function, ir_value*, values)
267 MEM_VEC_FUNCTIONS(ir_function, ir_block*, blocks)
268 MEM_VEC_FUNCTIONS(ir_function, ir_value*, locals)
269 MEM_VEC_FUNCTIONS(ir_function, int, params)
271 bool ir_function_set_name(ir_function *self, const char *name)
274 mem_d((void*)self->name);
275 self->name = util_strdup(name);
279 void ir_function_delete(ir_function *self)
282 mem_d((void*)self->name);
284 for (i = 0; i != self->blocks_count; ++i)
285 ir_block_delete(self->blocks[i]);
286 MEM_VECTOR_CLEAR(self, blocks);
288 MEM_VECTOR_CLEAR(self, params);
290 for (i = 0; i != self->values_count; ++i)
291 ir_value_delete(self->values[i]);
292 MEM_VECTOR_CLEAR(self, values);
294 for (i = 0; i != self->locals_count; ++i)
295 ir_value_delete(self->locals[i]);
296 MEM_VECTOR_CLEAR(self, locals);
298 /* self->value is deleted by the builder */
303 bool GMQCC_WARN ir_function_collect_value(ir_function *self, ir_value *v)
305 return ir_function_values_add(self, v);
308 ir_block* ir_function_create_block(ir_function *self, const char *label)
310 ir_block* bn = ir_block_new(self, label);
311 memcpy(&bn->context, &self->context, sizeof(self->context));
312 if (!ir_function_blocks_add(self, bn)) {
319 bool ir_function_finalize(ir_function *self)
324 if (!ir_function_naive_phi(self))
327 ir_function_enumerate(self);
329 if (!ir_function_calculate_liferanges(self))
332 if (!ir_function_allocate_locals(self))
337 ir_value* ir_function_get_local(ir_function *self, const char *name)
340 for (i = 0; i < self->locals_count; ++i) {
341 if (!strcmp(self->locals[i]->name, name))
342 return self->locals[i];
347 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
349 ir_value *ve = ir_function_get_local(self, name);
355 self->locals_count &&
356 self->locals[self->locals_count-1]->store != store_param) {
357 printf("cannot add parameters after adding locals\n");
361 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
362 if (!ir_function_locals_add(self, ve)) {
369 /***********************************************************************
373 ir_block* ir_block_new(ir_function* owner, const char *name)
376 self = (ir_block*)mem_a(sizeof(*self));
380 memset(self, 0, sizeof(*self));
383 if (!ir_block_set_label(self, name)) {
388 self->context.file = "<@no context>";
389 self->context.line = 0;
391 MEM_VECTOR_INIT(self, instr);
392 MEM_VECTOR_INIT(self, entries);
393 MEM_VECTOR_INIT(self, exits);
396 self->is_return = false;
398 MEM_VECTOR_INIT(self, living);
400 self->generated = false;
404 MEM_VEC_FUNCTIONS(ir_block, ir_instr*, instr)
405 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, entries)
406 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, exits)
407 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_value*, living)
409 void ir_block_delete(ir_block* self)
413 for (i = 0; i != self->instr_count; ++i)
414 ir_instr_delete(self->instr[i]);
415 MEM_VECTOR_CLEAR(self, instr);
416 MEM_VECTOR_CLEAR(self, entries);
417 MEM_VECTOR_CLEAR(self, exits);
418 MEM_VECTOR_CLEAR(self, living);
422 bool ir_block_set_label(ir_block *self, const char *name)
425 mem_d((void*)self->label);
426 self->label = util_strdup(name);
427 return !!self->label;
430 /***********************************************************************
434 ir_instr* ir_instr_new(ir_block* owner, int op)
437 self = (ir_instr*)mem_a(sizeof(*self));
442 self->context.file = "<@no context>";
443 self->context.line = 0;
445 self->_ops[0] = NULL;
446 self->_ops[1] = NULL;
447 self->_ops[2] = NULL;
448 self->bops[0] = NULL;
449 self->bops[1] = NULL;
450 MEM_VECTOR_INIT(self, phi);
451 MEM_VECTOR_INIT(self, params);
456 MEM_VEC_FUNCTIONS(ir_instr, ir_phi_entry_t, phi)
457 MEM_VEC_FUNCTIONS(ir_instr, ir_value*, params)
459 void ir_instr_delete(ir_instr *self)
462 /* The following calls can only delete from
463 * vectors, we still want to delete this instruction
464 * so ignore the return value. Since with the warn_unused_result attribute
465 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
466 * I have to improvise here and use if(foo());
468 for (i = 0; i < self->phi_count; ++i) {
470 if (ir_value_writes_find(self->phi[i].value, self, &idx))
471 if (ir_value_writes_remove(self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
472 if (ir_value_reads_find(self->phi[i].value, self, &idx))
473 if (ir_value_reads_remove (self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
475 MEM_VECTOR_CLEAR(self, phi);
476 for (i = 0; i < self->params_count; ++i) {
478 if (ir_value_writes_find(self->params[i], self, &idx))
479 if (ir_value_writes_remove(self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
480 if (ir_value_reads_find(self->params[i], self, &idx))
481 if (ir_value_reads_remove (self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
483 MEM_VECTOR_CLEAR(self, params);
484 if (ir_instr_op(self, 0, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
485 if (ir_instr_op(self, 1, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
486 if (ir_instr_op(self, 2, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
490 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
492 if (self->_ops[op]) {
494 if (writing && ir_value_writes_find(self->_ops[op], self, &idx))
496 if (!ir_value_writes_remove(self->_ops[op], idx))
499 else if (ir_value_reads_find(self->_ops[op], self, &idx))
501 if (!ir_value_reads_remove(self->_ops[op], idx))
507 if (!ir_value_writes_add(v, self))
510 if (!ir_value_reads_add(v, self))
518 /***********************************************************************
522 ir_value* ir_value_var(const char *name, int storetype, int vtype)
525 self = (ir_value*)mem_a(sizeof(*self));
527 self->fieldtype = TYPE_VOID;
528 self->outtype = TYPE_VOID;
529 self->store = storetype;
530 MEM_VECTOR_INIT(self, reads);
531 MEM_VECTOR_INIT(self, writes);
532 self->isconst = false;
533 self->context.file = "<@no context>";
534 self->context.line = 0;
536 ir_value_set_name(self, name);
538 memset(&self->constval, 0, sizeof(self->constval));
539 memset(&self->code, 0, sizeof(self->code));
541 MEM_VECTOR_INIT(self, life);
544 MEM_VEC_FUNCTIONS(ir_value, ir_life_entry_t, life)
545 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, reads)
546 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, writes)
548 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
550 ir_value *v = ir_value_var(name, storetype, vtype);
553 if (!ir_function_collect_value(owner, v))
561 void ir_value_delete(ir_value* self)
564 mem_d((void*)self->name);
567 if (self->vtype == TYPE_STRING)
568 mem_d((void*)self->constval.vstring);
570 MEM_VECTOR_CLEAR(self, reads);
571 MEM_VECTOR_CLEAR(self, writes);
572 MEM_VECTOR_CLEAR(self, life);
576 void ir_value_set_name(ir_value *self, const char *name)
579 mem_d((void*)self->name);
580 self->name = util_strdup(name);
583 bool ir_value_set_float(ir_value *self, float f)
585 if (self->vtype != TYPE_FLOAT)
587 self->constval.vfloat = f;
588 self->isconst = true;
592 bool ir_value_set_func(ir_value *self, int f)
594 if (self->vtype != TYPE_FUNCTION)
596 self->constval.vint = f;
597 self->isconst = true;
601 bool ir_value_set_vector(ir_value *self, vector v)
603 if (self->vtype != TYPE_VECTOR)
605 self->constval.vvec = v;
606 self->isconst = true;
610 bool ir_value_set_string(ir_value *self, const char *str)
612 if (self->vtype != TYPE_STRING)
614 self->constval.vstring = util_strdup(str);
615 self->isconst = true;
620 bool ir_value_set_int(ir_value *self, int i)
622 if (self->vtype != TYPE_INTEGER)
624 self->constval.vint = i;
625 self->isconst = true;
630 bool ir_value_lives(ir_value *self, size_t at)
633 for (i = 0; i < self->life_count; ++i)
635 ir_life_entry_t *life = &self->life[i];
636 if (life->start <= at && at <= life->end)
638 if (life->start > at) /* since it's ordered */
644 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
647 if (!ir_value_life_add(self, e)) /* naive... */
649 for (k = self->life_count-1; k > idx; --k)
650 self->life[k] = self->life[k-1];
655 bool ir_value_life_merge(ir_value *self, size_t s)
658 ir_life_entry_t *life = NULL;
659 ir_life_entry_t *before = NULL;
660 ir_life_entry_t new_entry;
662 /* Find the first range >= s */
663 for (i = 0; i < self->life_count; ++i)
666 life = &self->life[i];
670 /* nothing found? append */
671 if (i == self->life_count) {
673 if (life && life->end+1 == s)
675 /* previous life range can be merged in */
679 if (life && life->end >= s)
682 if (!ir_value_life_add(self, e))
683 return false; /* failing */
689 if (before->end + 1 == s &&
690 life->start - 1 == s)
693 before->end = life->end;
694 if (!ir_value_life_remove(self, i))
695 return false; /* failing */
698 if (before->end + 1 == s)
704 /* already contained */
705 if (before->end >= s)
709 if (life->start - 1 == s)
714 /* insert a new entry */
715 new_entry.start = new_entry.end = s;
716 return ir_value_life_insert(self, i, new_entry);
719 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
723 if (!other->life_count)
726 if (!self->life_count) {
727 for (i = 0; i < other->life_count; ++i) {
728 if (!ir_value_life_add(self, other->life[i]))
735 for (i = 0; i < other->life_count; ++i)
737 const ir_life_entry_t *life = &other->life[i];
740 ir_life_entry_t *entry = &self->life[myi];
742 if (life->end+1 < entry->start)
744 /* adding an interval before entry */
745 if (!ir_value_life_insert(self, myi, *life))
751 if (life->start < entry->start &&
752 life->end >= entry->start)
754 /* starts earlier and overlaps */
755 entry->start = life->start;
758 if (life->end > entry->end &&
759 life->start-1 <= entry->end)
761 /* ends later and overlaps */
762 entry->end = life->end;
765 /* see if our change combines it with the next ranges */
766 while (myi+1 < self->life_count &&
767 entry->end+1 >= self->life[1+myi].start)
769 /* overlaps with (myi+1) */
770 if (entry->end < self->life[1+myi].end)
771 entry->end = self->life[1+myi].end;
772 if (!ir_value_life_remove(self, myi+1))
774 entry = &self->life[myi];
777 /* see if we're after the entry */
778 if (life->start > entry->end)
781 /* append if we're at the end */
782 if (myi >= self->life_count) {
783 if (!ir_value_life_add(self, *life))
787 /* otherweise check the next range */
796 bool ir_values_overlap(const ir_value *a, const ir_value *b)
798 /* For any life entry in A see if it overlaps with
799 * any life entry in B.
800 * Note that the life entries are orderes, so we can make a
801 * more efficient algorithm there than naively translating the
805 ir_life_entry_t *la, *lb, *enda, *endb;
807 /* first of all, if either has no life range, they cannot clash */
808 if (!a->life_count || !b->life_count)
813 enda = la + a->life_count;
814 endb = lb + b->life_count;
817 /* check if the entries overlap, for that,
818 * both must start before the other one ends.
820 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
821 if (la->start <= lb->end &&
822 lb->start <= la->end)
824 if (la->start < lb->end &&
831 /* entries are ordered
832 * one entry is earlier than the other
833 * that earlier entry will be moved forward
835 if (la->start < lb->start)
837 /* order: A B, move A forward
838 * check if we hit the end with A
843 else if (lb->start < la->start)
845 /* order: B A, move B forward
846 * check if we hit the end with B
855 /***********************************************************************
859 bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
861 if (target->store == store_value) {
862 fprintf(stderr, "cannot store to an SSA value\n");
863 fprintf(stderr, "trying to store: %s <- %s\n", target->name, what->name);
866 ir_instr *in = ir_instr_new(self, op);
869 if (!ir_instr_op(in, 0, target, true) ||
870 !ir_instr_op(in, 1, what, false) ||
871 !ir_block_instr_add(self, in) )
879 bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
883 if (target->vtype == TYPE_VARIANT)
886 vtype = target->vtype;
889 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
890 op = INSTR_CONV_ITOF;
891 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
892 op = INSTR_CONV_FTOI;
894 op = type_store_instr[vtype];
896 return ir_block_create_store_op(self, op, target, what);
899 bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
904 if (target->vtype != TYPE_POINTER)
907 /* storing using pointer - target is a pointer, type must be
908 * inferred from source
912 op = type_storep_instr[vtype];
914 return ir_block_create_store_op(self, op, target, what);
917 bool ir_block_create_return(ir_block *self, ir_value *v)
921 fprintf(stderr, "block already ended (%s)\n", self->label);
925 self->is_return = true;
926 in = ir_instr_new(self, INSTR_RETURN);
930 if (!ir_instr_op(in, 0, v, false) ||
931 !ir_block_instr_add(self, in) )
938 bool ir_block_create_if(ir_block *self, ir_value *v,
939 ir_block *ontrue, ir_block *onfalse)
943 fprintf(stderr, "block already ended (%s)\n", self->label);
947 /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
948 in = ir_instr_new(self, VINSTR_COND);
952 if (!ir_instr_op(in, 0, v, false)) {
957 in->bops[0] = ontrue;
958 in->bops[1] = onfalse;
960 if (!ir_block_instr_add(self, in))
963 if (!ir_block_exits_add(self, ontrue) ||
964 !ir_block_exits_add(self, onfalse) ||
965 !ir_block_entries_add(ontrue, self) ||
966 !ir_block_entries_add(onfalse, self) )
973 bool ir_block_create_jump(ir_block *self, ir_block *to)
977 fprintf(stderr, "block already ended (%s)\n", self->label);
981 in = ir_instr_new(self, VINSTR_JUMP);
986 if (!ir_block_instr_add(self, in))
989 if (!ir_block_exits_add(self, to) ||
990 !ir_block_entries_add(to, self) )
997 bool ir_block_create_goto(ir_block *self, ir_block *to)
1001 fprintf(stderr, "block already ended (%s)\n", self->label);
1005 in = ir_instr_new(self, INSTR_GOTO);
1010 if (!ir_block_instr_add(self, in))
1013 if (!ir_block_exits_add(self, to) ||
1014 !ir_block_entries_add(to, self) )
1021 ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
1025 in = ir_instr_new(self, VINSTR_PHI);
1028 out = ir_value_out(self->owner, label, store_value, ot);
1030 ir_instr_delete(in);
1033 if (!ir_instr_op(in, 0, out, true)) {
1034 ir_instr_delete(in);
1035 ir_value_delete(out);
1038 if (!ir_block_instr_add(self, in)) {
1039 ir_instr_delete(in);
1040 ir_value_delete(out);
1046 ir_value* ir_phi_value(ir_instr *self)
1048 return self->_ops[0];
1051 bool ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1055 if (!ir_block_entries_find(self->owner, b, NULL)) {
1056 /* Must not be possible to cause this, otherwise the AST
1057 * is doing something wrong.
1059 fprintf(stderr, "Invalid entry block for PHI\n");
1065 if (!ir_value_reads_add(v, self))
1067 return ir_instr_phi_add(self, pe);
1070 /* call related code */
1071 ir_instr* ir_block_create_call(ir_block *self, const char *label, ir_value *func)
1075 in = ir_instr_new(self, INSTR_CALL0);
1078 out = ir_value_out(self->owner, label, store_return, func->outtype);
1080 ir_instr_delete(in);
1083 if (!ir_instr_op(in, 0, out, true) ||
1084 !ir_instr_op(in, 1, func, false) ||
1085 !ir_block_instr_add(self, in))
1087 ir_instr_delete(in);
1088 ir_value_delete(out);
1094 ir_value* ir_call_value(ir_instr *self)
1096 return self->_ops[0];
1099 bool ir_call_param(ir_instr* self, ir_value *v)
1101 if (!ir_instr_params_add(self, v))
1103 if (!ir_value_reads_add(v, self)) {
1104 if (!ir_instr_params_remove(self, self->params_count-1))
1105 GMQCC_SUPPRESS_EMPTY_BODY;
1111 /* binary op related code */
1113 ir_value* ir_block_create_binop(ir_block *self,
1114 const char *label, int opcode,
1115 ir_value *left, ir_value *right)
1137 case INSTR_SUB_S: /* -- offset of string as float */
1142 case INSTR_BITOR_IF:
1143 case INSTR_BITOR_FI:
1144 case INSTR_BITAND_FI:
1145 case INSTR_BITAND_IF:
1160 case INSTR_BITAND_I:
1163 case INSTR_RSHIFT_I:
1164 case INSTR_LSHIFT_I:
1186 /* boolean operations result in floats */
1187 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1189 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1192 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1197 if (ot == TYPE_VOID) {
1198 /* The AST or parser were supposed to check this! */
1202 return ir_block_create_general_instr(self, label, opcode, left, right, ot);
1205 ir_value* ir_block_create_unary(ir_block *self,
1206 const char *label, int opcode,
1209 int ot = TYPE_FLOAT;
1221 /* QC doesn't have other unary operations. We expect extensions to fill
1222 * the above list, otherwise we assume out-type = in-type, eg for an
1226 ot = operand->vtype;
1229 if (ot == TYPE_VOID) {
1230 /* The AST or parser were supposed to check this! */
1234 /* let's use the general instruction creator and pass NULL for OPB */
1235 return ir_block_create_general_instr(self, label, opcode, operand, NULL, ot);
1238 ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
1239 int op, ir_value *a, ir_value *b, int outype)
1244 out = ir_value_out(self->owner, label, store_value, outype);
1248 instr = ir_instr_new(self, op);
1250 ir_value_delete(out);
1254 if (!ir_instr_op(instr, 0, out, true) ||
1255 !ir_instr_op(instr, 1, a, false) ||
1256 !ir_instr_op(instr, 2, b, false) )
1261 if (!ir_block_instr_add(self, instr))
1266 ir_instr_delete(instr);
1267 ir_value_delete(out);
1271 ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
1273 /* Support for various pointer types todo if so desired */
1274 if (ent->vtype != TYPE_ENTITY)
1277 if (field->vtype != TYPE_FIELD)
1280 return ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1283 ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
1286 if (ent->vtype != TYPE_ENTITY)
1289 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1290 if (field->vtype != TYPE_FIELD)
1295 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1296 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1297 case TYPE_STRING: op = INSTR_LOAD_S; break;
1298 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1299 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1301 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1302 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1308 return ir_block_create_general_instr(self, label, op, ent, field, outype);
1311 ir_value* ir_block_create_add(ir_block *self,
1313 ir_value *left, ir_value *right)
1316 int l = left->vtype;
1317 int r = right->vtype;
1336 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1338 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1344 return ir_block_create_binop(self, label, op, left, right);
1347 ir_value* ir_block_create_sub(ir_block *self,
1349 ir_value *left, ir_value *right)
1352 int l = left->vtype;
1353 int r = right->vtype;
1373 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1375 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1381 return ir_block_create_binop(self, label, op, left, right);
1384 ir_value* ir_block_create_mul(ir_block *self,
1386 ir_value *left, ir_value *right)
1389 int l = left->vtype;
1390 int r = right->vtype;
1409 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1411 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1414 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1416 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1418 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1420 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1426 return ir_block_create_binop(self, label, op, left, right);
1429 ir_value* ir_block_create_div(ir_block *self,
1431 ir_value *left, ir_value *right)
1434 int l = left->vtype;
1435 int r = right->vtype;
1452 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1454 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1456 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1462 return ir_block_create_binop(self, label, op, left, right);
1465 /* PHI resolving breaks the SSA, and must thus be the last
1466 * step before life-range calculation.
1469 static bool ir_block_naive_phi(ir_block *self);
1470 bool ir_function_naive_phi(ir_function *self)
1474 for (i = 0; i < self->blocks_count; ++i)
1476 if (!ir_block_naive_phi(self->blocks[i]))
1482 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1487 /* create a store */
1488 if (!ir_block_create_store(block, old, what))
1491 /* we now move it up */
1492 instr = block->instr[block->instr_count-1];
1493 for (i = block->instr_count; i > iid; --i)
1494 block->instr[i] = block->instr[i-1];
1495 block->instr[i] = instr;
1500 static bool ir_block_naive_phi(ir_block *self)
1503 /* FIXME: optionally, create_phi can add the phis
1504 * to a list so we don't need to loop through blocks
1505 * - anyway: "don't optimize YET"
1507 for (i = 0; i < self->instr_count; ++i)
1509 ir_instr *instr = self->instr[i];
1510 if (instr->opcode != VINSTR_PHI)
1513 if (!ir_block_instr_remove(self, i))
1515 --i; /* NOTE: i+1 below */
1517 for (p = 0; p < instr->phi_count; ++p)
1519 ir_value *v = instr->phi[p].value;
1520 for (w = 0; w < v->writes_count; ++w) {
1523 if (!v->writes[w]->_ops[0])
1526 /* When the write was to a global, we have to emit a mov */
1527 old = v->writes[w]->_ops[0];
1529 /* The original instruction now writes to the PHI target local */
1530 if (v->writes[w]->_ops[0] == v)
1531 v->writes[w]->_ops[0] = instr->_ops[0];
1533 if (old->store != store_value && old->store != store_local && old->store != store_param)
1535 /* If it originally wrote to a global we need to store the value
1538 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1540 if (i+1 < self->instr_count)
1541 instr = self->instr[i+1];
1544 /* In case I forget and access instr later, it'll be NULL
1545 * when it's a problem, to make sure we crash, rather than accessing
1551 /* If it didn't, we can replace all reads by the phi target now. */
1553 for (r = 0; r < old->reads_count; ++r)
1556 ir_instr *ri = old->reads[r];
1557 for (op = 0; op < ri->phi_count; ++op) {
1558 if (ri->phi[op].value == old)
1559 ri->phi[op].value = v;
1561 for (op = 0; op < 3; ++op) {
1562 if (ri->_ops[op] == old)
1569 ir_instr_delete(instr);
1574 /***********************************************************************
1575 *IR Temp allocation code
1576 * Propagating value life ranges by walking through the function backwards
1577 * until no more changes are made.
1578 * In theory this should happen once more than once for every nested loop
1580 * Though this implementation might run an additional time for if nests.
1589 MEM_VEC_FUNCTIONS_ALL(new_reads_t, ir_value*, v)
1591 /* Enumerate instructions used by value's life-ranges
1593 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1597 for (i = 0; i < self->instr_count; ++i)
1599 self->instr[i]->eid = eid++;
1604 /* Enumerate blocks and instructions.
1605 * The block-enumeration is unordered!
1606 * We do not really use the block enumreation, however
1607 * the instruction enumeration is important for life-ranges.
1609 void ir_function_enumerate(ir_function *self)
1612 size_t instruction_id = 0;
1613 for (i = 0; i < self->blocks_count; ++i)
1615 self->blocks[i]->eid = i;
1616 self->blocks[i]->run_id = 0;
1617 ir_block_enumerate(self->blocks[i], &instruction_id);
1621 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
1622 bool ir_function_calculate_liferanges(ir_function *self)
1630 for (i = 0; i != self->blocks_count; ++i)
1632 if (self->blocks[i]->is_return)
1634 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
1642 /* Local-value allocator
1643 * After finishing creating the liferange of all values used in a function
1644 * we can allocate their global-positions.
1645 * This is the counterpart to register-allocation in register machines.
1648 MEM_VECTOR_MAKE(ir_value*, locals);
1649 MEM_VECTOR_MAKE(size_t, sizes);
1650 MEM_VECTOR_MAKE(size_t, positions);
1651 } function_allocator;
1652 MEM_VEC_FUNCTIONS(function_allocator, ir_value*, locals)
1653 MEM_VEC_FUNCTIONS(function_allocator, size_t, sizes)
1654 MEM_VEC_FUNCTIONS(function_allocator, size_t, positions)
1656 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
1659 size_t vsize = type_sizeof[var->vtype];
1661 slot = ir_value_var("reg", store_global, var->vtype);
1665 if (!ir_value_life_merge_into(slot, var))
1668 if (!function_allocator_locals_add(alloc, slot))
1671 if (!function_allocator_sizes_add(alloc, vsize))
1677 ir_value_delete(slot);
1681 bool ir_function_allocate_locals(ir_function *self)
1690 function_allocator alloc;
1692 if (!self->locals_count)
1695 MEM_VECTOR_INIT(&alloc, locals);
1696 MEM_VECTOR_INIT(&alloc, sizes);
1697 MEM_VECTOR_INIT(&alloc, positions);
1699 for (i = 0; i < self->locals_count; ++i)
1701 if (!function_allocator_alloc(&alloc, self->locals[i]))
1705 /* Allocate a slot for any value that still exists */
1706 for (i = 0; i < self->values_count; ++i)
1708 v = self->values[i];
1713 for (a = 0; a < alloc.locals_count; ++a)
1715 slot = alloc.locals[a];
1717 if (ir_values_overlap(v, slot))
1720 if (!ir_value_life_merge_into(slot, v))
1723 /* adjust size for this slot */
1724 if (alloc.sizes[a] < type_sizeof[v->vtype])
1725 alloc.sizes[a] = type_sizeof[v->vtype];
1727 self->values[i]->code.local = a;
1730 if (a >= alloc.locals_count) {
1731 self->values[i]->code.local = alloc.locals_count;
1732 if (!function_allocator_alloc(&alloc, v))
1737 /* Adjust slot positions based on sizes */
1738 if (!function_allocator_positions_add(&alloc, 0))
1741 if (alloc.sizes_count)
1742 pos = alloc.positions[0] + alloc.sizes[0];
1745 for (i = 1; i < alloc.sizes_count; ++i)
1747 pos = alloc.positions[i-1] + alloc.sizes[i-1];
1748 if (!function_allocator_positions_add(&alloc, pos))
1752 self->allocated_locals = pos + alloc.sizes[alloc.sizes_count-1];
1754 /* Take over the actual slot positions */
1755 for (i = 0; i < self->values_count; ++i)
1756 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
1763 for (i = 0; i < alloc.locals_count; ++i)
1764 ir_value_delete(alloc.locals[i]);
1765 MEM_VECTOR_CLEAR(&alloc, locals);
1766 MEM_VECTOR_CLEAR(&alloc, sizes);
1767 MEM_VECTOR_CLEAR(&alloc, positions);
1771 /* Get information about which operand
1772 * is read from, or written to.
1774 static void ir_op_read_write(int op, size_t *read, size_t *write)
1801 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
1804 bool changed = false;
1806 for (i = 0; i != self->living_count; ++i)
1808 tempbool = ir_value_life_merge(self->living[i], eid);
1811 fprintf(stderr, "block_living_add_instr() value instruction added %s: %i\n", self->living[i]->_name, (int)eid);
1813 changed = changed || tempbool;
1818 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
1821 /* values which have been read in a previous iteration are now
1822 * in the "living" array even if the previous block doesn't use them.
1823 * So we have to remove whatever does not exist in the previous block.
1824 * They will be re-added on-read, but the liferange merge won't cause
1827 for (i = 0; i < self->living_count; ++i)
1829 if (!ir_block_living_find(prev, self->living[i], NULL)) {
1830 if (!ir_block_living_remove(self, i))
1836 /* Whatever the previous block still has in its living set
1837 * must now be added to ours as well.
1839 for (i = 0; i < prev->living_count; ++i)
1841 if (ir_block_living_find(self, prev->living[i], NULL))
1843 if (!ir_block_living_add(self, prev->living[i]))
1846 printf("%s got from prev: %s\n", self->label, prev->living[i]->_name);
1852 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
1858 /* bitmasks which operands are read from or written to */
1860 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1862 new_reads_t new_reads;
1864 char dbg_ind[16] = { '#', '0' };
1867 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1868 MEM_VECTOR_INIT(&new_reads, v);
1873 if (!ir_block_life_prop_previous(self, prev, changed))
1877 i = self->instr_count;
1880 instr = self->instr[i];
1882 /* PHI operands are always read operands */
1883 for (p = 0; p < instr->phi_count; ++p)
1885 value = instr->phi[p].value;
1886 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1887 if (!ir_block_living_find(self, value, NULL) &&
1888 !ir_block_living_add(self, value))
1893 if (!new_reads_t_v_find(&new_reads, value, NULL))
1895 if (!new_reads_t_v_add(&new_reads, value))
1901 /* See which operands are read and write operands */
1902 ir_op_read_write(instr->opcode, &read, &write);
1904 /* Go through the 3 main operands */
1905 for (o = 0; o < 3; ++o)
1907 if (!instr->_ops[o]) /* no such operand */
1910 value = instr->_ops[o];
1912 /* We only care about locals */
1913 /* we also calculate parameter liferanges so that locals
1914 * can take up parameter slots */
1915 if (value->store != store_value &&
1916 value->store != store_local &&
1917 value->store != store_param)
1923 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1924 if (!ir_block_living_find(self, value, NULL) &&
1925 !ir_block_living_add(self, value))
1930 /* fprintf(stderr, "read: %s\n", value->_name); */
1931 if (!new_reads_t_v_find(&new_reads, value, NULL))
1933 if (!new_reads_t_v_add(&new_reads, value))
1939 /* write operands */
1940 /* When we write to a local, we consider it "dead" for the
1941 * remaining upper part of the function, since in SSA a value
1942 * can only be written once (== created)
1947 bool in_living = ir_block_living_find(self, value, &idx);
1948 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1950 bool in_reads = new_reads_t_v_find(&new_reads, value, &readidx);
1951 if (!in_living && !in_reads)
1956 /* If the value isn't alive it hasn't been read before... */
1957 /* TODO: See if the warning can be emitted during parsing or AST processing
1958 * otherwise have warning printed here.
1959 * IF printing a warning here: include filecontext_t,
1960 * and make sure it's only printed once
1961 * since this function is run multiple times.
1963 /* For now: debug info: */
1964 fprintf(stderr, "Value only written %s\n", value->name);
1965 tempbool = ir_value_life_merge(value, instr->eid);
1966 *changed = *changed || tempbool;
1968 ir_instr_dump(instr, dbg_ind, printf);
1972 /* since 'living' won't contain it
1973 * anymore, merge the value, since
1976 tempbool = ir_value_life_merge(value, instr->eid);
1979 fprintf(stderr, "value added id %s %i\n", value->name, (int)instr->eid);
1981 *changed = *changed || tempbool;
1983 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1984 if (!ir_block_living_remove(self, idx))
1989 if (!new_reads_t_v_remove(&new_reads, readidx))
1997 tempbool = ir_block_living_add_instr(self, instr->eid);
1998 /*fprintf(stderr, "living added values\n");*/
1999 *changed = *changed || tempbool;
2001 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
2003 for (rd = 0; rd < new_reads.v_count; ++rd)
2005 if (!ir_block_living_find(self, new_reads.v[rd], NULL)) {
2006 if (!ir_block_living_add(self, new_reads.v[rd]))
2009 if (!i && !self->entries_count) {
2011 *changed = *changed || ir_value_life_merge(new_reads.v[rd], instr->eid);
2014 MEM_VECTOR_CLEAR(&new_reads, v);
2018 if (self->run_id == self->owner->run_id)
2021 self->run_id = self->owner->run_id;
2023 for (i = 0; i < self->entries_count; ++i)
2025 ir_block *entry = self->entries[i];
2026 ir_block_life_propagate(entry, self, changed);
2031 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
2032 MEM_VECTOR_CLEAR(&new_reads, v);
2037 /***********************************************************************
2040 * Since the IR has the convention of putting 'write' operands
2041 * at the beginning, we have to rotate the operands of instructions
2042 * properly in order to generate valid QCVM code.
2044 * Having destinations at a fixed position is more convenient. In QC
2045 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2046 * read from from OPA, and store to OPB rather than OPC. Which is
2047 * partially the reason why the implementation of these instructions
2048 * in darkplaces has been delayed for so long.
2050 * Breaking conventions is annoying...
2052 static bool ir_builder_gen_global(ir_builder *self, ir_value *global);
2054 static bool gen_global_field(ir_value *global)
2056 if (global->isconst)
2058 ir_value *fld = global->constval.vpointer;
2060 printf("Invalid field constant with no field: %s\n", global->name);
2064 /* Now, in this case, a relocation would be impossible to code
2065 * since it looks like this:
2066 * .vector v = origin; <- parse error, wtf is 'origin'?
2069 * But we will need a general relocation support later anyway
2070 * for functions... might as well support that here.
2072 if (!fld->code.globaladdr) {
2073 printf("FIXME: Relocation support\n");
2077 /* copy the field's value */
2078 global->code.globaladdr = code_globals_add(code_globals_data[fld->code.globaladdr]);
2082 global->code.globaladdr = code_globals_add(0);
2084 if (global->code.globaladdr < 0)
2089 static bool gen_global_pointer(ir_value *global)
2091 if (global->isconst)
2093 ir_value *target = global->constval.vpointer;
2095 printf("Invalid pointer constant: %s\n", global->name);
2096 /* NULL pointers are pointing to the NULL constant, which also
2097 * sits at address 0, but still has an ir_value for itself.
2102 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2103 * void() foo; <- proto
2104 * void() *fooptr = &foo;
2105 * void() foo = { code }
2107 if (!target->code.globaladdr) {
2108 /* FIXME: Check for the constant nullptr ir_value!
2109 * because then code.globaladdr being 0 is valid.
2111 printf("FIXME: Relocation support\n");
2115 global->code.globaladdr = code_globals_add(target->code.globaladdr);
2119 global->code.globaladdr = code_globals_add(0);
2121 if (global->code.globaladdr < 0)
2126 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2128 prog_section_statement stmt;
2137 block->generated = true;
2138 block->code_start = code_statements_elements;
2139 for (i = 0; i < block->instr_count; ++i)
2141 instr = block->instr[i];
2143 if (instr->opcode == VINSTR_PHI) {
2144 printf("cannot generate virtual instruction (phi)\n");
2148 if (instr->opcode == VINSTR_JUMP) {
2149 target = instr->bops[0];
2150 /* for uncoditional jumps, if the target hasn't been generated
2151 * yet, we generate them right here.
2153 if (!target->generated) {
2158 /* otherwise we generate a jump instruction */
2159 stmt.opcode = INSTR_GOTO;
2160 stmt.o1.s1 = (target->code_start) - code_statements_elements;
2163 if (code_statements_add(stmt) < 0)
2166 /* no further instructions can be in this block */
2170 if (instr->opcode == VINSTR_COND) {
2171 ontrue = instr->bops[0];
2172 onfalse = instr->bops[1];
2173 /* TODO: have the AST signal which block should
2174 * come first: eg. optimize IFs without ELSE...
2177 stmt.o1.u1 = instr->_ops[0]->code.globaladdr;
2181 if (ontrue->generated) {
2182 stmt.opcode = INSTR_IF;
2183 stmt.o2.s1 = (ontrue->code_start-1) - code_statements_elements;
2184 if (code_statements_add(stmt) < 0)
2187 if (onfalse->generated) {
2188 stmt.opcode = INSTR_IFNOT;
2189 stmt.o2.s1 = (onfalse->code_start-1) - code_statements_elements;
2190 if (code_statements_add(stmt) < 0)
2193 if (!ontrue->generated) {
2194 if (onfalse->generated) {
2199 if (!onfalse->generated) {
2200 if (ontrue->generated) {
2205 /* neither ontrue nor onfalse exist */
2206 stmt.opcode = INSTR_IFNOT;
2207 stidx = code_statements_elements;
2208 if (code_statements_add(stmt) < 0)
2210 /* on false we jump, so add ontrue-path */
2211 if (!gen_blocks_recursive(func, ontrue))
2213 /* fixup the jump address */
2214 code_statements_data[stidx].o2.s1 = code_statements_elements - stidx;
2215 /* generate onfalse path */
2216 if (onfalse->generated) {
2217 /* fixup the jump address */
2218 code_statements_data[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2219 /* may have been generated in the previous recursive call */
2220 stmt.opcode = INSTR_GOTO;
2221 stmt.o1.s1 = (onfalse->code_start) - code_statements_elements;
2224 return (code_statements_add(stmt) >= 0);
2226 /* if not, generate now */
2231 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2232 /* Trivial call translation:
2233 * copy all params to OFS_PARM*
2234 * if the output's storetype is not store_return,
2235 * add append a STORE instruction!
2237 * NOTES on how to do it better without much trouble:
2238 * -) The liferanges!
2239 * Simply check the liferange of all parameters for
2240 * other CALLs. For each param with no CALL in its
2241 * liferange, we can store it in an OFS_PARM at
2242 * generation already. This would even include later
2243 * reuse.... probably... :)
2248 for (p = 0; p < instr->params_count; ++p)
2250 ir_value *param = instr->params[p];
2252 stmt.opcode = INSTR_STORE_F;
2255 stmt.opcode = type_store_instr[param->vtype];
2256 stmt.o1.u1 = param->code.globaladdr;
2257 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2258 if (code_statements_add(stmt) < 0)
2261 stmt.opcode = INSTR_CALL0 + instr->params_count;
2262 if (stmt.opcode > INSTR_CALL8)
2263 stmt.opcode = INSTR_CALL8;
2264 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2267 if (code_statements_add(stmt) < 0)
2270 retvalue = instr->_ops[0];
2271 if (retvalue && retvalue->store != store_return && retvalue->life_count)
2273 /* not to be kept in OFS_RETURN */
2274 stmt.opcode = type_store_instr[retvalue->vtype];
2275 stmt.o1.u1 = OFS_RETURN;
2276 stmt.o2.u1 = retvalue->code.globaladdr;
2278 if (code_statements_add(stmt) < 0)
2284 if (instr->opcode == INSTR_STATE) {
2285 printf("TODO: state instruction\n");
2289 stmt.opcode = instr->opcode;
2294 /* This is the general order of operands */
2296 stmt.o3.u1 = instr->_ops[0]->code.globaladdr;
2299 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2302 stmt.o2.u1 = instr->_ops[2]->code.globaladdr;
2304 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2306 stmt.o1.u1 = stmt.o3.u1;
2309 else if (stmt.opcode >= INSTR_STORE_F &&
2310 stmt.opcode <= INSTR_STORE_FNC)
2312 /* 2-operand instructions with A -> B */
2313 stmt.o2.u1 = stmt.o3.u1;
2317 if (code_statements_add(stmt) < 0)
2323 static bool gen_function_code(ir_function *self)
2326 prog_section_statement stmt;
2328 /* Starting from entry point, we generate blocks "as they come"
2329 * for now. Dead blocks will not be translated obviously.
2331 if (!self->blocks_count) {
2332 printf("Function '%s' declared without body.\n", self->name);
2336 block = self->blocks[0];
2337 if (block->generated)
2340 if (!gen_blocks_recursive(self, block)) {
2341 printf("failed to generate blocks for '%s'\n", self->name);
2345 /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
2346 stmt.opcode = AINSTR_END;
2350 if (code_statements_add(stmt) < 0)
2355 static bool gen_global_function(ir_builder *ir, ir_value *global)
2357 prog_section_function fun;
2361 size_t local_var_end;
2363 if (!global->isconst || (!global->constval.vfunc))
2365 printf("Invalid state of function-global: not constant: %s\n", global->name);
2369 irfun = global->constval.vfunc;
2371 fun.name = global->code.name;
2372 fun.file = code_cachedstring(global->context.file);
2373 fun.profile = 0; /* always 0 */
2374 fun.nargs = irfun->params_count;
2376 for (i = 0;i < 8; ++i) {
2380 fun.argsize[i] = type_sizeof[irfun->params[i]];
2383 fun.firstlocal = code_globals_elements;
2384 fun.locals = irfun->allocated_locals + irfun->locals_count;
2387 for (i = 0; i < irfun->locals_count; ++i) {
2388 if (!ir_builder_gen_global(ir, irfun->locals[i])) {
2389 printf("Failed to generate global %s\n", irfun->locals[i]->name);
2393 if (irfun->locals_count) {
2394 ir_value *last = irfun->locals[irfun->locals_count-1];
2395 local_var_end = last->code.globaladdr;
2396 local_var_end += type_sizeof[last->vtype];
2398 for (i = 0; i < irfun->values_count; ++i)
2400 /* generate code.globaladdr for ssa values */
2401 ir_value *v = irfun->values[i];
2402 v->code.globaladdr = local_var_end + v->code.local;
2404 for (i = 0; i < irfun->locals_count; ++i) {
2405 /* fill the locals with zeros */
2406 code_globals_add(0);
2410 fun.entry = irfun->builtin;
2412 fun.entry = code_statements_elements;
2413 if (!gen_function_code(irfun)) {
2414 printf("Failed to generate code for function %s\n", irfun->name);
2419 return (code_functions_add(fun) >= 0);
2422 static bool ir_builder_gen_global(ir_builder *self, ir_value *global)
2426 prog_section_def def;
2428 def.type = global->vtype;
2429 def.offset = code_globals_elements;
2430 def.name = global->code.name = code_genstring(global->name);
2432 switch (global->vtype)
2435 if (code_defs_add(def) < 0)
2437 return gen_global_pointer(global);
2439 if (code_defs_add(def) < 0)
2441 return gen_global_field(global);
2446 if (code_defs_add(def) < 0)
2449 if (global->isconst) {
2450 iptr = (int32_t*)&global->constval.vfloat;
2451 global->code.globaladdr = code_globals_add(*iptr);
2453 global->code.globaladdr = code_globals_add(0);
2455 return global->code.globaladdr >= 0;
2459 if (code_defs_add(def) < 0)
2461 if (global->isconst)
2462 global->code.globaladdr = code_globals_add(code_cachedstring(global->constval.vstring));
2464 global->code.globaladdr = code_globals_add(0);
2465 return global->code.globaladdr >= 0;
2470 if (code_defs_add(def) < 0)
2473 if (global->isconst) {
2474 iptr = (int32_t*)&global->constval.vvec;
2475 global->code.globaladdr = code_globals_add(iptr[0]);
2476 if (global->code.globaladdr < 0)
2478 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2480 if (code_globals_add(iptr[d]) < 0)
2484 global->code.globaladdr = code_globals_add(0);
2485 if (global->code.globaladdr < 0)
2487 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2489 if (code_globals_add(0) < 0)
2493 return global->code.globaladdr >= 0;
2496 if (code_defs_add(def) < 0)
2498 global->code.globaladdr = code_globals_elements;
2499 code_globals_add(code_functions_elements);
2500 return gen_global_function(self, global);
2502 /* assume biggest type */
2503 global->code.globaladdr = code_globals_add(0);
2504 for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
2505 code_globals_add(0);
2508 /* refuse to create 'void' type or any other fancy business. */
2509 printf("Invalid type for global variable %s\n", global->name);
2514 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
2516 prog_section_def def;
2517 prog_section_field fld;
2519 def.type = field->vtype;
2520 def.offset = code_globals_elements;
2521 def.name = field->code.name = code_genstring(field->name);
2523 if (code_defs_add(def) < 0)
2526 fld.name = def.name;
2527 fld.offset = code_fields_elements;
2528 fld.type = field->fieldtype;
2530 if (fld.type == TYPE_VOID) {
2531 printf("field is missing a type: %s - don't know its size\n", field->name);
2535 if (code_fields_add(fld) < 0)
2538 if (!code_globals_add(code_alloc_field(type_sizeof[field->fieldtype])))
2541 field->code.globaladdr = code_globals_add(fld.offset);
2542 return field->code.globaladdr >= 0;
2545 bool ir_builder_generate(ir_builder *self, const char *filename)
2551 for (i = 0; i < self->fields_count; ++i)
2553 if (!ir_builder_gen_field(self, self->fields[i])) {
2558 for (i = 0; i < self->globals_count; ++i)
2560 if (!ir_builder_gen_global(self, self->globals[i])) {
2565 printf("writing '%s'...\n", filename);
2566 return code_write(filename);
2569 /***********************************************************************
2570 *IR DEBUG Dump functions...
2573 #define IND_BUFSZ 1024
2575 const char *qc_opname(int op)
2577 if (op < 0) return "<INVALID>";
2578 if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
2579 return asm_instr[op].m;
2581 case VINSTR_PHI: return "PHI";
2582 case VINSTR_JUMP: return "JUMP";
2583 case VINSTR_COND: return "COND";
2584 default: return "<UNK>";
2588 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
2591 char indent[IND_BUFSZ];
2595 oprintf("module %s\n", b->name);
2596 for (i = 0; i < b->globals_count; ++i)
2599 if (b->globals[i]->isconst)
2600 oprintf("%s = ", b->globals[i]->name);
2601 ir_value_dump(b->globals[i], oprintf);
2604 for (i = 0; i < b->functions_count; ++i)
2605 ir_function_dump(b->functions[i], indent, oprintf);
2606 oprintf("endmodule %s\n", b->name);
2609 void ir_function_dump(ir_function *f, char *ind,
2610 int (*oprintf)(const char*, ...))
2613 if (f->builtin != 0) {
2614 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
2617 oprintf("%sfunction %s\n", ind, f->name);
2618 strncat(ind, "\t", IND_BUFSZ);
2619 if (f->locals_count)
2621 oprintf("%s%i locals:\n", ind, (int)f->locals_count);
2622 for (i = 0; i < f->locals_count; ++i) {
2623 oprintf("%s\t", ind);
2624 ir_value_dump(f->locals[i], oprintf);
2628 if (f->blocks_count)
2630 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
2631 for (i = 0; i < f->blocks_count; ++i) {
2632 if (f->blocks[i]->run_id != f->run_id) {
2633 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
2635 ir_block_dump(f->blocks[i], ind, oprintf);
2639 ind[strlen(ind)-1] = 0;
2640 oprintf("%sendfunction %s\n", ind, f->name);
2643 void ir_block_dump(ir_block* b, char *ind,
2644 int (*oprintf)(const char*, ...))
2647 oprintf("%s:%s\n", ind, b->label);
2648 strncat(ind, "\t", IND_BUFSZ);
2650 for (i = 0; i < b->instr_count; ++i)
2651 ir_instr_dump(b->instr[i], ind, oprintf);
2652 ind[strlen(ind)-1] = 0;
2655 void dump_phi(ir_instr *in, char *ind,
2656 int (*oprintf)(const char*, ...))
2659 oprintf("%s <- phi ", in->_ops[0]->name);
2660 for (i = 0; i < in->phi_count; ++i)
2662 oprintf("([%s] : %s) ", in->phi[i].from->label,
2663 in->phi[i].value->name);
2668 void ir_instr_dump(ir_instr *in, char *ind,
2669 int (*oprintf)(const char*, ...))
2672 const char *comma = NULL;
2674 oprintf("%s (%i) ", ind, (int)in->eid);
2676 if (in->opcode == VINSTR_PHI) {
2677 dump_phi(in, ind, oprintf);
2681 strncat(ind, "\t", IND_BUFSZ);
2683 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
2684 ir_value_dump(in->_ops[0], oprintf);
2685 if (in->_ops[1] || in->_ops[2])
2688 oprintf("%s\t", qc_opname(in->opcode));
2689 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
2690 ir_value_dump(in->_ops[0], oprintf);
2695 for (i = 1; i != 3; ++i) {
2699 ir_value_dump(in->_ops[i], oprintf);
2707 oprintf("[%s]", in->bops[0]->label);
2711 oprintf("%s[%s]", comma, in->bops[1]->label);
2713 ind[strlen(ind)-1] = 0;
2716 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
2724 oprintf("%g", v->constval.vfloat);
2727 oprintf("'%g %g %g'",
2730 v->constval.vvec.z);
2733 oprintf("(entity)");
2736 oprintf("\"%s\"", v->constval.vstring);
2740 oprintf("%i", v->constval.vint);
2745 v->constval.vpointer->name);
2749 oprintf("%s", v->name);
2753 void ir_value_dump_life(ir_value *self, int (*oprintf)(const char*,...))
2756 oprintf("Life of %s:\n", self->name);
2757 for (i = 0; i < self->life_count; ++i)
2759 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);