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, bool param)
316 ir_value *ve = ir_function_get_local(self, name);
322 self->locals_count &&
323 self->locals[self->locals_count-1]->store != store_param) {
324 printf("cannot add parameters after adding locals\n");
328 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
329 if (!ir_function_locals_add(self, ve)) {
336 /***********************************************************************
340 ir_block* ir_block_new(ir_function* owner, const char *name)
343 self = (ir_block*)mem_a(sizeof(*self));
347 memset(self, 0, sizeof(*self));
350 if (!ir_block_set_label(self, name)) {
355 self->context.file = "<@no context>";
356 self->context.line = 0;
358 MEM_VECTOR_INIT(self, instr);
359 MEM_VECTOR_INIT(self, entries);
360 MEM_VECTOR_INIT(self, exits);
363 self->is_return = false;
365 MEM_VECTOR_INIT(self, living);
367 self->generated = false;
371 MEM_VEC_FUNCTIONS(ir_block, ir_instr*, instr)
372 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, entries)
373 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_block*, exits)
374 MEM_VEC_FUNCTIONS_ALL(ir_block, ir_value*, living)
376 void ir_block_delete(ir_block* self)
380 for (i = 0; i != self->instr_count; ++i)
381 ir_instr_delete(self->instr[i]);
382 MEM_VECTOR_CLEAR(self, instr);
383 MEM_VECTOR_CLEAR(self, entries);
384 MEM_VECTOR_CLEAR(self, exits);
385 MEM_VECTOR_CLEAR(self, living);
389 bool ir_block_set_label(ir_block *self, const char *name)
392 mem_d((void*)self->label);
393 self->label = util_strdup(name);
394 return !!self->label;
397 /***********************************************************************
401 ir_instr* ir_instr_new(ir_block* owner, int op)
404 self = (ir_instr*)mem_a(sizeof(*self));
409 self->context.file = "<@no context>";
410 self->context.line = 0;
412 self->_ops[0] = NULL;
413 self->_ops[1] = NULL;
414 self->_ops[2] = NULL;
415 self->bops[0] = NULL;
416 self->bops[1] = NULL;
417 MEM_VECTOR_INIT(self, phi);
418 MEM_VECTOR_INIT(self, params);
423 MEM_VEC_FUNCTIONS(ir_instr, ir_phi_entry_t, phi)
424 MEM_VEC_FUNCTIONS(ir_instr, ir_value*, params)
426 void ir_instr_delete(ir_instr *self)
429 /* The following calls can only delete from
430 * vectors, we still want to delete this instruction
431 * so ignore the return value. Since with the warn_unused_result attribute
432 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
433 * I have to improvise here and use if(foo());
435 for (i = 0; i < self->phi_count; ++i) {
437 if (ir_value_writes_find(self->phi[i].value, self, &idx))
438 if (ir_value_writes_remove(self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
439 if (ir_value_reads_find(self->phi[i].value, self, &idx))
440 if (ir_value_reads_remove (self->phi[i].value, idx)) GMQCC_SUPPRESS_EMPTY_BODY;
442 MEM_VECTOR_CLEAR(self, phi);
443 for (i = 0; i < self->params_count; ++i) {
445 if (ir_value_writes_find(self->params[i], self, &idx))
446 if (ir_value_writes_remove(self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
447 if (ir_value_reads_find(self->params[i], self, &idx))
448 if (ir_value_reads_remove (self->params[i], idx)) GMQCC_SUPPRESS_EMPTY_BODY;
450 MEM_VECTOR_CLEAR(self, params);
451 if (ir_instr_op(self, 0, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
452 if (ir_instr_op(self, 1, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
453 if (ir_instr_op(self, 2, NULL, false)) GMQCC_SUPPRESS_EMPTY_BODY;
457 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
459 if (self->_ops[op]) {
461 if (writing && ir_value_writes_find(self->_ops[op], self, &idx))
463 if (!ir_value_writes_remove(self->_ops[op], idx))
466 else if (ir_value_reads_find(self->_ops[op], self, &idx))
468 if (!ir_value_reads_remove(self->_ops[op], idx))
474 if (!ir_value_writes_add(v, self))
477 if (!ir_value_reads_add(v, self))
485 /***********************************************************************
489 ir_value* ir_value_var(const char *name, int storetype, int vtype)
492 self = (ir_value*)mem_a(sizeof(*self));
494 self->fieldtype = TYPE_VOID;
495 self->outtype = TYPE_VOID;
496 self->store = storetype;
497 MEM_VECTOR_INIT(self, reads);
498 MEM_VECTOR_INIT(self, writes);
499 self->isconst = false;
500 self->context.file = "<@no context>";
501 self->context.line = 0;
503 ir_value_set_name(self, name);
505 memset(&self->constval, 0, sizeof(self->constval));
506 memset(&self->code, 0, sizeof(self->code));
508 MEM_VECTOR_INIT(self, life);
511 MEM_VEC_FUNCTIONS(ir_value, ir_life_entry_t, life)
512 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, reads)
513 MEM_VEC_FUNCTIONS_ALL(ir_value, ir_instr*, writes)
515 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
517 ir_value *v = ir_value_var(name, storetype, vtype);
520 if (!ir_function_collect_value(owner, v))
528 void ir_value_delete(ir_value* self)
531 mem_d((void*)self->name);
534 if (self->vtype == TYPE_STRING)
535 mem_d((void*)self->constval.vstring);
537 MEM_VECTOR_CLEAR(self, reads);
538 MEM_VECTOR_CLEAR(self, writes);
539 MEM_VECTOR_CLEAR(self, life);
543 void ir_value_set_name(ir_value *self, const char *name)
546 mem_d((void*)self->name);
547 self->name = util_strdup(name);
550 bool ir_value_set_float(ir_value *self, float f)
552 if (self->vtype != TYPE_FLOAT)
554 self->constval.vfloat = f;
555 self->isconst = true;
559 bool ir_value_set_func(ir_value *self, int f)
561 if (self->vtype != TYPE_FUNCTION)
563 self->constval.vint = f;
564 self->isconst = true;
568 bool ir_value_set_vector(ir_value *self, vector v)
570 if (self->vtype != TYPE_VECTOR)
572 self->constval.vvec = v;
573 self->isconst = true;
577 bool ir_value_set_string(ir_value *self, const char *str)
579 if (self->vtype != TYPE_STRING)
581 self->constval.vstring = util_strdup(str);
582 self->isconst = true;
587 bool ir_value_set_int(ir_value *self, int i)
589 if (self->vtype != TYPE_INTEGER)
591 self->constval.vint = i;
592 self->isconst = true;
597 bool ir_value_lives(ir_value *self, size_t at)
600 for (i = 0; i < self->life_count; ++i)
602 ir_life_entry_t *life = &self->life[i];
603 if (life->start <= at && at <= life->end)
605 if (life->start > at) /* since it's ordered */
611 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
614 if (!ir_value_life_add(self, e)) /* naive... */
616 for (k = self->life_count-1; k > idx; --k)
617 self->life[k] = self->life[k-1];
622 bool ir_value_life_merge(ir_value *self, size_t s)
625 ir_life_entry_t *life = NULL;
626 ir_life_entry_t *before = NULL;
627 ir_life_entry_t new_entry;
629 /* Find the first range >= s */
630 for (i = 0; i < self->life_count; ++i)
633 life = &self->life[i];
637 /* nothing found? append */
638 if (i == self->life_count) {
640 if (life && life->end+1 == s)
642 /* previous life range can be merged in */
646 if (life && life->end >= s)
649 if (!ir_value_life_add(self, e))
650 return false; /* failing */
656 if (before->end + 1 == s &&
657 life->start - 1 == s)
660 before->end = life->end;
661 if (!ir_value_life_remove(self, i))
662 return false; /* failing */
665 if (before->end + 1 == s)
671 /* already contained */
672 if (before->end >= s)
676 if (life->start - 1 == s)
681 /* insert a new entry */
682 new_entry.start = new_entry.end = s;
683 return ir_value_life_insert(self, i, new_entry);
686 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
690 if (!other->life_count)
693 if (!self->life_count) {
694 for (i = 0; i < other->life_count; ++i) {
695 if (!ir_value_life_add(self, other->life[i]))
702 for (i = 0; i < other->life_count; ++i)
704 const ir_life_entry_t *life = &other->life[i];
707 ir_life_entry_t *entry = &self->life[myi];
709 if (life->end+1 < entry->start)
711 /* adding an interval before entry */
712 if (!ir_value_life_insert(self, myi, *life))
718 if (life->start < entry->start &&
719 life->end >= entry->start)
721 /* starts earlier and overlaps */
722 entry->start = life->start;
725 if (life->end > entry->end &&
726 life->start-1 <= entry->end)
728 /* ends later and overlaps */
729 entry->end = life->end;
732 /* see if our change combines it with the next ranges */
733 while (myi+1 < self->life_count &&
734 entry->end+1 >= self->life[1+myi].start)
736 /* overlaps with (myi+1) */
737 if (entry->end < self->life[1+myi].end)
738 entry->end = self->life[1+myi].end;
739 if (!ir_value_life_remove(self, myi+1))
741 entry = &self->life[myi];
744 /* see if we're after the entry */
745 if (life->start > entry->end)
748 /* append if we're at the end */
749 if (myi >= self->life_count) {
750 if (!ir_value_life_add(self, *life))
754 /* otherweise check the next range */
763 bool ir_values_overlap(const ir_value *a, const ir_value *b)
765 /* For any life entry in A see if it overlaps with
766 * any life entry in B.
767 * Note that the life entries are orderes, so we can make a
768 * more efficient algorithm there than naively translating the
772 ir_life_entry_t *la, *lb, *enda, *endb;
774 /* first of all, if either has no life range, they cannot clash */
775 if (!a->life_count || !b->life_count)
780 enda = la + a->life_count;
781 endb = lb + b->life_count;
784 /* check if the entries overlap, for that,
785 * both must start before the other one ends.
787 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
788 if (la->start <= lb->end &&
789 lb->start <= la->end)
791 if (la->start < lb->end &&
798 /* entries are ordered
799 * one entry is earlier than the other
800 * that earlier entry will be moved forward
802 if (la->start < lb->start)
804 /* order: A B, move A forward
805 * check if we hit the end with A
810 else if (lb->start < la->start)
812 /* order: B A, move B forward
813 * check if we hit the end with B
822 /***********************************************************************
826 bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
828 if (target->store == store_value) {
829 fprintf(stderr, "cannot store to an SSA value\n");
830 fprintf(stderr, "trying to store: %s <- %s\n", target->name, what->name);
833 ir_instr *in = ir_instr_new(self, op);
836 if (!ir_instr_op(in, 0, target, true) ||
837 !ir_instr_op(in, 1, what, false) ||
838 !ir_block_instr_add(self, in) )
846 bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
850 if (target->vtype == TYPE_VARIANT)
853 vtype = target->vtype;
856 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
857 op = INSTR_CONV_ITOF;
858 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
859 op = INSTR_CONV_FTOI;
861 op = type_store_instr[vtype];
863 return ir_block_create_store_op(self, op, target, what);
866 bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
871 if (target->vtype != TYPE_POINTER)
874 /* storing using pointer - target is a pointer, type must be
875 * inferred from source
879 op = type_storep_instr[vtype];
881 return ir_block_create_store_op(self, op, target, what);
884 bool ir_block_create_return(ir_block *self, ir_value *v)
888 fprintf(stderr, "block already ended (%s)\n", self->label);
892 self->is_return = true;
893 in = ir_instr_new(self, INSTR_RETURN);
897 if (!ir_instr_op(in, 0, v, false) ||
898 !ir_block_instr_add(self, in) )
905 bool ir_block_create_if(ir_block *self, ir_value *v,
906 ir_block *ontrue, ir_block *onfalse)
910 fprintf(stderr, "block already ended (%s)\n", self->label);
914 /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
915 in = ir_instr_new(self, VINSTR_COND);
919 if (!ir_instr_op(in, 0, v, false)) {
924 in->bops[0] = ontrue;
925 in->bops[1] = onfalse;
927 if (!ir_block_instr_add(self, in))
930 if (!ir_block_exits_add(self, ontrue) ||
931 !ir_block_exits_add(self, onfalse) ||
932 !ir_block_entries_add(ontrue, self) ||
933 !ir_block_entries_add(onfalse, self) )
940 bool ir_block_create_jump(ir_block *self, ir_block *to)
944 fprintf(stderr, "block already ended (%s)\n", self->label);
948 in = ir_instr_new(self, VINSTR_JUMP);
953 if (!ir_block_instr_add(self, in))
956 if (!ir_block_exits_add(self, to) ||
957 !ir_block_entries_add(to, self) )
964 bool ir_block_create_goto(ir_block *self, ir_block *to)
968 fprintf(stderr, "block already ended (%s)\n", self->label);
972 in = ir_instr_new(self, INSTR_GOTO);
977 if (!ir_block_instr_add(self, in))
980 if (!ir_block_exits_add(self, to) ||
981 !ir_block_entries_add(to, self) )
988 ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
992 in = ir_instr_new(self, VINSTR_PHI);
995 out = ir_value_out(self->owner, label, store_value, ot);
1000 if (!ir_instr_op(in, 0, out, true)) {
1001 ir_instr_delete(in);
1002 ir_value_delete(out);
1005 if (!ir_block_instr_add(self, in)) {
1006 ir_instr_delete(in);
1007 ir_value_delete(out);
1013 ir_value* ir_phi_value(ir_instr *self)
1015 return self->_ops[0];
1018 bool ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1022 if (!ir_block_entries_find(self->owner, b, NULL)) {
1023 /* Must not be possible to cause this, otherwise the AST
1024 * is doing something wrong.
1026 fprintf(stderr, "Invalid entry block for PHI\n");
1032 if (!ir_value_reads_add(v, self))
1034 return ir_instr_phi_add(self, pe);
1037 /* call related code */
1038 ir_instr* ir_block_create_call(ir_block *self, const char *label, ir_value *func)
1042 in = ir_instr_new(self, INSTR_CALL0);
1045 out = ir_value_out(self->owner, label, store_return, func->outtype);
1047 ir_instr_delete(in);
1050 if (!ir_instr_op(in, 0, out, true) ||
1051 !ir_instr_op(in, 1, func, false) ||
1052 !ir_block_instr_add(self, in))
1054 ir_instr_delete(in);
1055 ir_value_delete(out);
1061 ir_value* ir_call_value(ir_instr *self)
1063 return self->_ops[0];
1066 bool ir_call_param(ir_instr* self, ir_value *v)
1068 if (!ir_instr_params_add(self, v))
1070 if (!ir_value_reads_add(v, self)) {
1071 if (!ir_instr_params_remove(self, self->params_count-1))
1072 GMQCC_SUPPRESS_EMPTY_BODY;
1078 /* binary op related code */
1080 ir_value* ir_block_create_binop(ir_block *self,
1081 const char *label, int opcode,
1082 ir_value *left, ir_value *right)
1104 case INSTR_SUB_S: /* -- offset of string as float */
1109 case INSTR_BITOR_IF:
1110 case INSTR_BITOR_FI:
1111 case INSTR_BITAND_FI:
1112 case INSTR_BITAND_IF:
1127 case INSTR_BITAND_I:
1130 case INSTR_RSHIFT_I:
1131 case INSTR_LSHIFT_I:
1153 /* boolean operations result in floats */
1154 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1156 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1159 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1164 if (ot == TYPE_VOID) {
1165 /* The AST or parser were supposed to check this! */
1169 return ir_block_create_general_instr(self, label, opcode, left, right, ot);
1172 ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
1173 int op, ir_value *a, ir_value *b, int outype)
1178 out = ir_value_out(self->owner, label, store_value, outype);
1182 instr = ir_instr_new(self, op);
1184 ir_value_delete(out);
1188 if (!ir_instr_op(instr, 0, out, true) ||
1189 !ir_instr_op(instr, 1, a, false) ||
1190 !ir_instr_op(instr, 2, b, false) )
1195 if (!ir_block_instr_add(self, instr))
1200 ir_instr_delete(instr);
1201 ir_value_delete(out);
1205 ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
1207 /* Support for various pointer types todo if so desired */
1208 if (ent->vtype != TYPE_ENTITY)
1211 if (field->vtype != TYPE_FIELD)
1214 return ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1217 ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
1220 if (ent->vtype != TYPE_ENTITY)
1223 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1224 if (field->vtype != TYPE_FIELD)
1229 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1230 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1231 case TYPE_STRING: op = INSTR_LOAD_S; break;
1232 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1233 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1235 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1236 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1242 return ir_block_create_general_instr(self, label, op, ent, field, outype);
1245 ir_value* ir_block_create_add(ir_block *self,
1247 ir_value *left, ir_value *right)
1250 int l = left->vtype;
1251 int r = right->vtype;
1270 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1272 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1278 return ir_block_create_binop(self, label, op, left, right);
1281 ir_value* ir_block_create_sub(ir_block *self,
1283 ir_value *left, ir_value *right)
1286 int l = left->vtype;
1287 int r = right->vtype;
1307 if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1309 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1315 return ir_block_create_binop(self, label, op, left, right);
1318 ir_value* ir_block_create_mul(ir_block *self,
1320 ir_value *left, ir_value *right)
1323 int l = left->vtype;
1324 int r = right->vtype;
1343 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1345 else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
1348 else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
1350 else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
1352 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1354 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1360 return ir_block_create_binop(self, label, op, left, right);
1363 ir_value* ir_block_create_div(ir_block *self,
1365 ir_value *left, ir_value *right)
1368 int l = left->vtype;
1369 int r = right->vtype;
1386 if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
1388 else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
1390 else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
1396 return ir_block_create_binop(self, label, op, left, right);
1399 /* PHI resolving breaks the SSA, and must thus be the last
1400 * step before life-range calculation.
1403 static bool ir_block_naive_phi(ir_block *self);
1404 bool ir_function_naive_phi(ir_function *self)
1408 for (i = 0; i < self->blocks_count; ++i)
1410 if (!ir_block_naive_phi(self->blocks[i]))
1416 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1421 /* create a store */
1422 if (!ir_block_create_store(block, old, what))
1425 /* we now move it up */
1426 instr = block->instr[block->instr_count-1];
1427 for (i = block->instr_count; i > iid; --i)
1428 block->instr[i] = block->instr[i-1];
1429 block->instr[i] = instr;
1434 static bool ir_block_naive_phi(ir_block *self)
1437 /* FIXME: optionally, create_phi can add the phis
1438 * to a list so we don't need to loop through blocks
1439 * - anyway: "don't optimize YET"
1441 for (i = 0; i < self->instr_count; ++i)
1443 ir_instr *instr = self->instr[i];
1444 if (instr->opcode != VINSTR_PHI)
1447 if (!ir_block_instr_remove(self, i))
1449 --i; /* NOTE: i+1 below */
1451 for (p = 0; p < instr->phi_count; ++p)
1453 ir_value *v = instr->phi[p].value;
1454 for (w = 0; w < v->writes_count; ++w) {
1457 if (!v->writes[w]->_ops[0])
1460 /* When the write was to a global, we have to emit a mov */
1461 old = v->writes[w]->_ops[0];
1463 /* The original instruction now writes to the PHI target local */
1464 if (v->writes[w]->_ops[0] == v)
1465 v->writes[w]->_ops[0] = instr->_ops[0];
1467 if (old->store != store_value && old->store != store_local && old->store != store_param)
1469 /* If it originally wrote to a global we need to store the value
1472 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1474 if (i+1 < self->instr_count)
1475 instr = self->instr[i+1];
1478 /* In case I forget and access instr later, it'll be NULL
1479 * when it's a problem, to make sure we crash, rather than accessing
1485 /* If it didn't, we can replace all reads by the phi target now. */
1487 for (r = 0; r < old->reads_count; ++r)
1490 ir_instr *ri = old->reads[r];
1491 for (op = 0; op < ri->phi_count; ++op) {
1492 if (ri->phi[op].value == old)
1493 ri->phi[op].value = v;
1495 for (op = 0; op < 3; ++op) {
1496 if (ri->_ops[op] == old)
1503 ir_instr_delete(instr);
1508 /***********************************************************************
1509 *IR Temp allocation code
1510 * Propagating value life ranges by walking through the function backwards
1511 * until no more changes are made.
1512 * In theory this should happen once more than once for every nested loop
1514 * Though this implementation might run an additional time for if nests.
1523 MEM_VEC_FUNCTIONS_ALL(new_reads_t, ir_value*, v)
1525 /* Enumerate instructions used by value's life-ranges
1527 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1531 for (i = 0; i < self->instr_count; ++i)
1533 self->instr[i]->eid = eid++;
1538 /* Enumerate blocks and instructions.
1539 * The block-enumeration is unordered!
1540 * We do not really use the block enumreation, however
1541 * the instruction enumeration is important for life-ranges.
1543 void ir_function_enumerate(ir_function *self)
1546 size_t instruction_id = 0;
1547 for (i = 0; i < self->blocks_count; ++i)
1549 self->blocks[i]->eid = i;
1550 self->blocks[i]->run_id = 0;
1551 ir_block_enumerate(self->blocks[i], &instruction_id);
1555 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
1556 bool ir_function_calculate_liferanges(ir_function *self)
1564 for (i = 0; i != self->blocks_count; ++i)
1566 if (self->blocks[i]->is_return)
1568 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
1576 /* Local-value allocator
1577 * After finishing creating the liferange of all values used in a function
1578 * we can allocate their global-positions.
1579 * This is the counterpart to register-allocation in register machines.
1582 MEM_VECTOR_MAKE(ir_value*, locals);
1583 MEM_VECTOR_MAKE(size_t, sizes);
1584 MEM_VECTOR_MAKE(size_t, positions);
1585 } function_allocator;
1586 MEM_VEC_FUNCTIONS(function_allocator, ir_value*, locals)
1587 MEM_VEC_FUNCTIONS(function_allocator, size_t, sizes)
1588 MEM_VEC_FUNCTIONS(function_allocator, size_t, positions)
1590 static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
1593 size_t vsize = type_sizeof[var->vtype];
1595 slot = ir_value_var("reg", store_global, var->vtype);
1599 if (!ir_value_life_merge_into(slot, var))
1602 if (!function_allocator_locals_add(alloc, slot))
1605 if (!function_allocator_sizes_add(alloc, vsize))
1611 ir_value_delete(slot);
1615 bool ir_function_allocate_locals(ir_function *self)
1624 function_allocator alloc;
1626 if (!self->locals_count)
1629 MEM_VECTOR_INIT(&alloc, locals);
1630 MEM_VECTOR_INIT(&alloc, sizes);
1631 MEM_VECTOR_INIT(&alloc, positions);
1633 for (i = 0; i < self->locals_count; ++i)
1635 if (!function_allocator_alloc(&alloc, self->locals[i]))
1639 /* Allocate a slot for any value that still exists */
1640 for (i = 0; i < self->values_count; ++i)
1642 v = self->values[i];
1647 for (a = 0; a < alloc.locals_count; ++a)
1649 slot = alloc.locals[a];
1651 if (ir_values_overlap(v, slot))
1654 if (!ir_value_life_merge_into(slot, v))
1657 /* adjust size for this slot */
1658 if (alloc.sizes[a] < type_sizeof[v->vtype])
1659 alloc.sizes[a] = type_sizeof[v->vtype];
1661 self->values[i]->code.local = a;
1664 if (a >= alloc.locals_count) {
1665 self->values[i]->code.local = alloc.locals_count;
1666 if (!function_allocator_alloc(&alloc, v))
1671 /* Adjust slot positions based on sizes */
1672 if (!function_allocator_positions_add(&alloc, 0))
1675 if (alloc.sizes_count)
1676 pos = alloc.positions[0] + alloc.sizes[0];
1679 for (i = 1; i < alloc.sizes_count; ++i)
1681 pos = alloc.positions[i-1] + alloc.sizes[i-1];
1682 if (!function_allocator_positions_add(&alloc, pos))
1686 self->allocated_locals = pos + alloc.sizes[alloc.sizes_count-1];
1688 /* Take over the actual slot positions */
1689 for (i = 0; i < self->values_count; ++i)
1690 self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
1697 for (i = 0; i < alloc.locals_count; ++i)
1698 ir_value_delete(alloc.locals[i]);
1699 MEM_VECTOR_CLEAR(&alloc, locals);
1700 MEM_VECTOR_CLEAR(&alloc, sizes);
1701 MEM_VECTOR_CLEAR(&alloc, positions);
1705 /* Get information about which operand
1706 * is read from, or written to.
1708 static void ir_op_read_write(int op, size_t *read, size_t *write)
1735 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
1738 bool changed = false;
1740 for (i = 0; i != self->living_count; ++i)
1742 tempbool = ir_value_life_merge(self->living[i], eid);
1745 fprintf(stderr, "block_living_add_instr() value instruction added %s: %i\n", self->living[i]->_name, (int)eid);
1747 changed = changed || tempbool;
1752 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
1755 /* values which have been read in a previous iteration are now
1756 * in the "living" array even if the previous block doesn't use them.
1757 * So we have to remove whatever does not exist in the previous block.
1758 * They will be re-added on-read, but the liferange merge won't cause
1761 for (i = 0; i < self->living_count; ++i)
1763 if (!ir_block_living_find(prev, self->living[i], NULL)) {
1764 if (!ir_block_living_remove(self, i))
1770 /* Whatever the previous block still has in its living set
1771 * must now be added to ours as well.
1773 for (i = 0; i < prev->living_count; ++i)
1775 if (ir_block_living_find(self, prev->living[i], NULL))
1777 if (!ir_block_living_add(self, prev->living[i]))
1780 printf("%s got from prev: %s\n", self->label, prev->living[i]->_name);
1786 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
1792 /* bitmasks which operands are read from or written to */
1794 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1796 new_reads_t new_reads;
1798 char dbg_ind[16] = { '#', '0' };
1801 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1802 MEM_VECTOR_INIT(&new_reads, v);
1807 if (!ir_block_life_prop_previous(self, prev, changed))
1811 i = self->instr_count;
1814 instr = self->instr[i];
1816 /* PHI operands are always read operands */
1817 for (p = 0; p < instr->phi_count; ++p)
1819 value = instr->phi[p].value;
1820 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1821 if (!ir_block_living_find(self, value, NULL) &&
1822 !ir_block_living_add(self, value))
1827 if (!new_reads_t_v_find(&new_reads, value, NULL))
1829 if (!new_reads_t_v_add(&new_reads, value))
1835 /* See which operands are read and write operands */
1836 ir_op_read_write(instr->opcode, &read, &write);
1838 /* Go through the 3 main operands */
1839 for (o = 0; o < 3; ++o)
1841 if (!instr->_ops[o]) /* no such operand */
1844 value = instr->_ops[o];
1846 /* We only care about locals */
1847 /* we also calculate parameter liferanges so that locals
1848 * can take up parameter slots */
1849 if (value->store != store_value &&
1850 value->store != store_local &&
1851 value->store != store_param)
1857 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1858 if (!ir_block_living_find(self, value, NULL) &&
1859 !ir_block_living_add(self, value))
1864 /* fprintf(stderr, "read: %s\n", value->_name); */
1865 if (!new_reads_t_v_find(&new_reads, value, NULL))
1867 if (!new_reads_t_v_add(&new_reads, value))
1873 /* write operands */
1874 /* When we write to a local, we consider it "dead" for the
1875 * remaining upper part of the function, since in SSA a value
1876 * can only be written once (== created)
1881 bool in_living = ir_block_living_find(self, value, &idx);
1882 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1884 bool in_reads = new_reads_t_v_find(&new_reads, value, &readidx);
1885 if (!in_living && !in_reads)
1890 /* If the value isn't alive it hasn't been read before... */
1891 /* TODO: See if the warning can be emitted during parsing or AST processing
1892 * otherwise have warning printed here.
1893 * IF printing a warning here: include filecontext_t,
1894 * and make sure it's only printed once
1895 * since this function is run multiple times.
1897 /* For now: debug info: */
1898 fprintf(stderr, "Value only written %s\n", value->name);
1899 tempbool = ir_value_life_merge(value, instr->eid);
1900 *changed = *changed || tempbool;
1902 ir_instr_dump(instr, dbg_ind, printf);
1906 /* since 'living' won't contain it
1907 * anymore, merge the value, since
1910 tempbool = ir_value_life_merge(value, instr->eid);
1913 fprintf(stderr, "value added id %s %i\n", value->name, (int)instr->eid);
1915 *changed = *changed || tempbool;
1917 #if ! defined(LIFE_RANGE_WITHOUT_LAST_READ)
1918 if (!ir_block_living_remove(self, idx))
1923 if (!new_reads_t_v_remove(&new_reads, readidx))
1931 tempbool = ir_block_living_add_instr(self, instr->eid);
1932 /*fprintf(stderr, "living added values\n");*/
1933 *changed = *changed || tempbool;
1935 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1937 for (rd = 0; rd < new_reads.v_count; ++rd)
1939 if (!ir_block_living_find(self, new_reads.v[rd], NULL)) {
1940 if (!ir_block_living_add(self, new_reads.v[rd]))
1943 if (!i && !self->entries_count) {
1945 *changed = *changed || ir_value_life_merge(new_reads.v[rd], instr->eid);
1948 MEM_VECTOR_CLEAR(&new_reads, v);
1952 if (self->run_id == self->owner->run_id)
1955 self->run_id = self->owner->run_id;
1957 for (i = 0; i < self->entries_count; ++i)
1959 ir_block *entry = self->entries[i];
1960 ir_block_life_propagate(entry, self, changed);
1965 #if defined(LIFE_RANGE_WITHOUT_LAST_READ)
1966 MEM_VECTOR_CLEAR(&new_reads, v);
1971 /***********************************************************************
1974 * Since the IR has the convention of putting 'write' operands
1975 * at the beginning, we have to rotate the operands of instructions
1976 * properly in order to generate valid QCVM code.
1978 * Having destinations at a fixed position is more convenient. In QC
1979 * this is *mostly* OPC, but FTE adds at least 2 instructions which
1980 * read from from OPA, and store to OPB rather than OPC. Which is
1981 * partially the reason why the implementation of these instructions
1982 * in darkplaces has been delayed for so long.
1984 * Breaking conventions is annoying...
1986 static bool ir_builder_gen_global(ir_builder *self, ir_value *global);
1988 static bool gen_global_field(ir_value *global)
1990 if (global->isconst)
1992 ir_value *fld = global->constval.vpointer;
1994 printf("Invalid field constant with no field: %s\n", global->name);
1998 /* Now, in this case, a relocation would be impossible to code
1999 * since it looks like this:
2000 * .vector v = origin; <- parse error, wtf is 'origin'?
2003 * But we will need a general relocation support later anyway
2004 * for functions... might as well support that here.
2006 if (!fld->code.globaladdr) {
2007 printf("FIXME: Relocation support\n");
2011 /* copy the field's value */
2012 global->code.globaladdr = code_globals_add(code_globals_data[fld->code.globaladdr]);
2016 prog_section_field fld;
2018 fld.name = global->code.name;
2019 fld.offset = code_fields_elements;
2020 fld.type = global->fieldtype;
2022 if (fld.type == TYPE_VOID) {
2023 printf("Field is missing a type: %s\n", global->name);
2027 if (code_fields_add(fld) < 0)
2030 global->code.globaladdr = code_globals_add(fld.offset);
2032 if (global->code.globaladdr < 0)
2037 static bool gen_global_pointer(ir_value *global)
2039 if (global->isconst)
2041 ir_value *target = global->constval.vpointer;
2043 printf("Invalid pointer constant: %s\n", global->name);
2044 /* NULL pointers are pointing to the NULL constant, which also
2045 * sits at address 0, but still has an ir_value for itself.
2050 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2051 * void() foo; <- proto
2052 * void() *fooptr = &foo;
2053 * void() foo = { code }
2055 if (!target->code.globaladdr) {
2056 /* FIXME: Check for the constant nullptr ir_value!
2057 * because then code.globaladdr being 0 is valid.
2059 printf("FIXME: Relocation support\n");
2063 global->code.globaladdr = code_globals_add(target->code.globaladdr);
2067 global->code.globaladdr = code_globals_add(0);
2069 if (global->code.globaladdr < 0)
2074 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2076 prog_section_statement stmt;
2085 block->generated = true;
2086 block->code_start = code_statements_elements;
2087 for (i = 0; i < block->instr_count; ++i)
2089 instr = block->instr[i];
2091 if (instr->opcode == VINSTR_PHI) {
2092 printf("cannot generate virtual instruction (phi)\n");
2096 if (instr->opcode == VINSTR_JUMP) {
2097 target = instr->bops[0];
2098 /* for uncoditional jumps, if the target hasn't been generated
2099 * yet, we generate them right here.
2101 if (!target->generated) {
2106 /* otherwise we generate a jump instruction */
2107 stmt.opcode = INSTR_GOTO;
2108 stmt.o1.s1 = (target->code_start) - code_statements_elements;
2111 if (code_statements_add(stmt) < 0)
2114 /* no further instructions can be in this block */
2118 if (instr->opcode == VINSTR_COND) {
2119 ontrue = instr->bops[0];
2120 onfalse = instr->bops[1];
2121 /* TODO: have the AST signal which block should
2122 * come first: eg. optimize IFs without ELSE...
2125 stmt.o1.u1 = instr->_ops[0]->code.globaladdr;
2129 if (ontrue->generated) {
2130 stmt.opcode = INSTR_IF;
2131 stmt.o2.s1 = (ontrue->code_start-1) - code_statements_elements;
2132 if (code_statements_add(stmt) < 0)
2135 if (onfalse->generated) {
2136 stmt.opcode = INSTR_IFNOT;
2137 stmt.o2.s1 = (onfalse->code_start-1) - code_statements_elements;
2138 if (code_statements_add(stmt) < 0)
2141 if (!ontrue->generated) {
2142 if (onfalse->generated) {
2147 if (!onfalse->generated) {
2148 if (ontrue->generated) {
2153 /* neither ontrue nor onfalse exist */
2154 stmt.opcode = INSTR_IFNOT;
2155 stidx = code_statements_elements;
2156 if (code_statements_add(stmt) < 0)
2158 /* on false we jump, so add ontrue-path */
2159 if (!gen_blocks_recursive(func, ontrue))
2161 /* fixup the jump address */
2162 code_statements_data[stidx].o2.s1 = code_statements_elements - stidx;
2163 /* generate onfalse path */
2164 if (onfalse->generated) {
2165 /* fixup the jump address */
2166 code_statements_data[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2167 /* may have been generated in the previous recursive call */
2168 stmt.opcode = INSTR_GOTO;
2169 stmt.o1.s1 = (onfalse->code_start) - code_statements_elements;
2172 return (code_statements_add(stmt) >= 0);
2174 /* if not, generate now */
2179 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2180 /* Trivial call translation:
2181 * copy all params to OFS_PARM*
2182 * if the output's storetype is not store_return,
2183 * add append a STORE instruction!
2185 * NOTES on how to do it better without much trouble:
2186 * -) The liferanges!
2187 * Simply check the liferange of all parameters for
2188 * other CALLs. For each param with no CALL in its
2189 * liferange, we can store it in an OFS_PARM at
2190 * generation already. This would even include later
2191 * reuse.... probably... :)
2196 for (p = 0; p < instr->params_count; ++p)
2198 ir_value *param = instr->params[p];
2200 stmt.opcode = INSTR_STORE_F;
2203 stmt.opcode = type_store_instr[param->vtype];
2204 stmt.o1.u1 = param->code.globaladdr;
2205 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2206 if (code_statements_add(stmt) < 0)
2209 stmt.opcode = INSTR_CALL0 + instr->params_count;
2210 if (stmt.opcode > INSTR_CALL8)
2211 stmt.opcode = INSTR_CALL8;
2212 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2215 if (code_statements_add(stmt) < 0)
2218 retvalue = instr->_ops[0];
2219 if (retvalue && retvalue->store != store_return && retvalue->life_count)
2221 /* not to be kept in OFS_RETURN */
2222 stmt.opcode = type_store_instr[retvalue->vtype];
2223 stmt.o1.u1 = OFS_RETURN;
2224 stmt.o2.u1 = retvalue->code.globaladdr;
2226 if (code_statements_add(stmt) < 0)
2232 if (instr->opcode == INSTR_STATE) {
2233 printf("TODO: state instruction\n");
2237 stmt.opcode = instr->opcode;
2242 /* This is the general order of operands */
2244 stmt.o3.u1 = instr->_ops[0]->code.globaladdr;
2247 stmt.o1.u1 = instr->_ops[1]->code.globaladdr;
2250 stmt.o2.u1 = instr->_ops[2]->code.globaladdr;
2252 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2254 stmt.o1.u1 = stmt.o3.u1;
2257 else if ((stmt.opcode >= INSTR_STORE_F &&
2258 stmt.opcode <= INSTR_STORE_FNC) ||
2259 (stmt.opcode >= INSTR_NOT_F &&
2260 stmt.opcode <= INSTR_NOT_FNC))
2262 /* 2-operand instructions with A -> B */
2263 stmt.o2.u1 = stmt.o3.u1;
2267 if (code_statements_add(stmt) < 0)
2273 static bool gen_function_code(ir_function *self)
2276 prog_section_statement stmt;
2278 /* Starting from entry point, we generate blocks "as they come"
2279 * for now. Dead blocks will not be translated obviously.
2281 if (!self->blocks_count) {
2282 printf("Function '%s' declared without body.\n", self->name);
2286 block = self->blocks[0];
2287 if (block->generated)
2290 if (!gen_blocks_recursive(self, block)) {
2291 printf("failed to generate blocks for '%s'\n", self->name);
2295 /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
2296 stmt.opcode = AINSTR_END;
2300 if (code_statements_add(stmt) < 0)
2305 static bool gen_global_function(ir_builder *ir, ir_value *global)
2307 prog_section_function fun;
2311 size_t local_var_end;
2313 if (!global->isconst || (!global->constval.vfunc))
2315 printf("Invalid state of function-global: not constant: %s\n", global->name);
2319 irfun = global->constval.vfunc;
2321 fun.name = global->code.name;
2322 fun.file = code_cachedstring(global->context.file);
2323 fun.profile = 0; /* always 0 */
2324 fun.nargs = irfun->params_count;
2326 for (i = 0;i < 8; ++i) {
2330 fun.argsize[i] = type_sizeof[irfun->params[i]];
2333 fun.firstlocal = code_globals_elements;
2334 fun.locals = irfun->allocated_locals + irfun->locals_count;
2337 for (i = 0; i < irfun->locals_count; ++i) {
2338 if (!ir_builder_gen_global(ir, irfun->locals[i])) {
2339 printf("Failed to generate global %s\n", irfun->locals[i]->name);
2343 if (irfun->locals_count) {
2344 ir_value *last = irfun->locals[irfun->locals_count-1];
2345 local_var_end = last->code.globaladdr;
2346 local_var_end += type_sizeof[last->vtype];
2348 for (i = 0; i < irfun->values_count; ++i)
2350 /* generate code.globaladdr for ssa values */
2351 ir_value *v = irfun->values[i];
2352 v->code.globaladdr = local_var_end + v->code.local;
2354 for (i = 0; i < irfun->locals_count; ++i) {
2355 /* fill the locals with zeros */
2356 code_globals_add(0);
2360 fun.entry = irfun->builtin;
2362 fun.entry = code_statements_elements;
2363 if (!gen_function_code(irfun)) {
2364 printf("Failed to generate code for function %s\n", irfun->name);
2369 return (code_functions_add(fun) >= 0);
2372 static bool ir_builder_gen_global(ir_builder *self, ir_value *global)
2376 prog_section_def def;
2378 def.type = global->vtype;
2379 def.offset = code_globals_elements;
2380 def.name = global->code.name = code_genstring(global->name);
2382 switch (global->vtype)
2385 if (code_defs_add(def) < 0)
2387 return gen_global_pointer(global);
2389 if (code_defs_add(def) < 0)
2391 return gen_global_field(global);
2396 if (code_defs_add(def) < 0)
2399 if (global->isconst) {
2400 iptr = (int32_t*)&global->constval.vfloat;
2401 global->code.globaladdr = code_globals_add(*iptr);
2403 global->code.globaladdr = code_globals_add(0);
2405 return global->code.globaladdr >= 0;
2409 if (code_defs_add(def) < 0)
2411 if (global->isconst)
2412 global->code.globaladdr = code_globals_add(code_cachedstring(global->constval.vstring));
2414 global->code.globaladdr = code_globals_add(0);
2415 return global->code.globaladdr >= 0;
2420 if (code_defs_add(def) < 0)
2423 if (global->isconst) {
2424 iptr = (int32_t*)&global->constval.vvec;
2425 global->code.globaladdr = code_globals_add(iptr[0]);
2426 if (global->code.globaladdr < 0)
2428 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2430 if (code_globals_add(iptr[d]) < 0)
2434 global->code.globaladdr = code_globals_add(0);
2435 if (global->code.globaladdr < 0)
2437 for (d = 1; d < type_sizeof[global->vtype]; ++d)
2439 if (code_globals_add(0) < 0)
2443 return global->code.globaladdr >= 0;
2446 if (code_defs_add(def) < 0)
2448 global->code.globaladdr = code_globals_elements;
2449 code_globals_add(code_functions_elements);
2450 return gen_global_function(self, global);
2452 /* assume biggest type */
2453 global->code.globaladdr = code_globals_add(0);
2454 for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
2455 code_globals_add(0);
2458 /* refuse to create 'void' type or any other fancy business. */
2459 printf("Invalid type for global variable %s\n", global->name);
2464 bool ir_builder_generate(ir_builder *self, const char *filename)
2470 for (i = 0; i < self->globals_count; ++i)
2472 if (!ir_builder_gen_global(self, self->globals[i])) {
2477 printf("writing '%s'...\n", filename);
2478 return code_write(filename);
2481 /***********************************************************************
2482 *IR DEBUG Dump functions...
2485 #define IND_BUFSZ 1024
2487 const char *qc_opname(int op)
2489 if (op < 0) return "<INVALID>";
2490 if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
2491 return asm_instr[op].m;
2493 case VINSTR_PHI: return "PHI";
2494 case VINSTR_JUMP: return "JUMP";
2495 case VINSTR_COND: return "COND";
2496 default: return "<UNK>";
2500 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
2503 char indent[IND_BUFSZ];
2507 oprintf("module %s\n", b->name);
2508 for (i = 0; i < b->globals_count; ++i)
2511 if (b->globals[i]->isconst)
2512 oprintf("%s = ", b->globals[i]->name);
2513 ir_value_dump(b->globals[i], oprintf);
2516 for (i = 0; i < b->functions_count; ++i)
2517 ir_function_dump(b->functions[i], indent, oprintf);
2518 oprintf("endmodule %s\n", b->name);
2521 void ir_function_dump(ir_function *f, char *ind,
2522 int (*oprintf)(const char*, ...))
2525 if (f->builtin != 0) {
2526 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
2529 oprintf("%sfunction %s\n", ind, f->name);
2530 strncat(ind, "\t", IND_BUFSZ);
2531 if (f->locals_count)
2533 oprintf("%s%i locals:\n", ind, (int)f->locals_count);
2534 for (i = 0; i < f->locals_count; ++i) {
2535 oprintf("%s\t", ind);
2536 ir_value_dump(f->locals[i], oprintf);
2540 if (f->blocks_count)
2542 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
2543 for (i = 0; i < f->blocks_count; ++i) {
2544 if (f->blocks[i]->run_id != f->run_id) {
2545 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
2547 ir_block_dump(f->blocks[i], ind, oprintf);
2551 ind[strlen(ind)-1] = 0;
2552 oprintf("%sendfunction %s\n", ind, f->name);
2555 void ir_block_dump(ir_block* b, char *ind,
2556 int (*oprintf)(const char*, ...))
2559 oprintf("%s:%s\n", ind, b->label);
2560 strncat(ind, "\t", IND_BUFSZ);
2562 for (i = 0; i < b->instr_count; ++i)
2563 ir_instr_dump(b->instr[i], ind, oprintf);
2564 ind[strlen(ind)-1] = 0;
2567 void dump_phi(ir_instr *in, char *ind,
2568 int (*oprintf)(const char*, ...))
2571 oprintf("%s <- phi ", in->_ops[0]->name);
2572 for (i = 0; i < in->phi_count; ++i)
2574 oprintf("([%s] : %s) ", in->phi[i].from->label,
2575 in->phi[i].value->name);
2580 void ir_instr_dump(ir_instr *in, char *ind,
2581 int (*oprintf)(const char*, ...))
2584 const char *comma = NULL;
2586 oprintf("%s (%i) ", ind, (int)in->eid);
2588 if (in->opcode == VINSTR_PHI) {
2589 dump_phi(in, ind, oprintf);
2593 strncat(ind, "\t", IND_BUFSZ);
2595 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
2596 ir_value_dump(in->_ops[0], oprintf);
2597 if (in->_ops[1] || in->_ops[2])
2600 oprintf("%s\t", qc_opname(in->opcode));
2601 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
2602 ir_value_dump(in->_ops[0], oprintf);
2607 for (i = 1; i != 3; ++i) {
2611 ir_value_dump(in->_ops[i], oprintf);
2619 oprintf("[%s]", in->bops[0]->label);
2623 oprintf("%s[%s]", comma, in->bops[1]->label);
2625 ind[strlen(ind)-1] = 0;
2628 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
2636 oprintf("%g", v->constval.vfloat);
2639 oprintf("'%g %g %g'",
2642 v->constval.vvec.z);
2645 oprintf("(entity)");
2648 oprintf("\"%s\"", v->constval.vstring);
2652 oprintf("%i", v->constval.vint);
2657 v->constval.vpointer->name);
2661 oprintf("%s", v->name);
2665 void ir_value_dump_life(ir_value *self, int (*oprintf)(const char*,...))
2668 oprintf("Life of %s:\n", self->name);
2669 for (i = 0; i < self->life_count; ++i)
2671 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);