2 * Copyright (C) 2012, 2013
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 const char *type_name[TYPE_COUNT] = {
51 size_t type_sizeof_[TYPE_COUNT] = {
58 1, /* TYPE_FUNCTION */
69 uint16_t type_store_instr[TYPE_COUNT] = {
70 INSTR_STORE_F, /* should use I when having integer support */
77 INSTR_STORE_ENT, /* should use I */
79 INSTR_STORE_I, /* integer type */
84 INSTR_STORE_V, /* variant, should never be accessed */
86 VINSTR_END, /* struct */
87 VINSTR_END, /* union */
88 VINSTR_END, /* array */
90 VINSTR_END, /* noexpr */
93 uint16_t field_store_instr[TYPE_COUNT] = {
103 INSTR_STORE_FLD, /* integer type */
108 INSTR_STORE_V, /* variant, should never be accessed */
110 VINSTR_END, /* struct */
111 VINSTR_END, /* union */
112 VINSTR_END, /* array */
113 VINSTR_END, /* nil */
114 VINSTR_END, /* noexpr */
117 uint16_t type_storep_instr[TYPE_COUNT] = {
118 INSTR_STOREP_F, /* should use I when having integer support */
125 INSTR_STOREP_ENT, /* should use I */
127 INSTR_STOREP_ENT, /* integer type */
132 INSTR_STOREP_V, /* variant, should never be accessed */
134 VINSTR_END, /* struct */
135 VINSTR_END, /* union */
136 VINSTR_END, /* array */
137 VINSTR_END, /* nil */
138 VINSTR_END, /* noexpr */
141 uint16_t type_eq_instr[TYPE_COUNT] = {
142 INSTR_EQ_F, /* should use I when having integer support */
147 INSTR_EQ_E, /* FLD has no comparison */
149 INSTR_EQ_E, /* should use I */
156 INSTR_EQ_V, /* variant, should never be accessed */
158 VINSTR_END, /* struct */
159 VINSTR_END, /* union */
160 VINSTR_END, /* array */
161 VINSTR_END, /* nil */
162 VINSTR_END, /* noexpr */
165 uint16_t type_ne_instr[TYPE_COUNT] = {
166 INSTR_NE_F, /* should use I when having integer support */
171 INSTR_NE_E, /* FLD has no comparison */
173 INSTR_NE_E, /* should use I */
180 INSTR_NE_V, /* variant, should never be accessed */
182 VINSTR_END, /* struct */
183 VINSTR_END, /* union */
184 VINSTR_END, /* array */
185 VINSTR_END, /* nil */
186 VINSTR_END, /* noexpr */
189 uint16_t type_not_instr[TYPE_COUNT] = {
190 INSTR_NOT_F, /* should use I when having integer support */
197 INSTR_NOT_ENT, /* should use I */
199 INSTR_NOT_I, /* integer type */
204 INSTR_NOT_V, /* variant, should never be accessed */
206 VINSTR_END, /* struct */
207 VINSTR_END, /* union */
208 VINSTR_END, /* array */
209 VINSTR_END, /* nil */
210 VINSTR_END, /* noexpr */
214 static ir_value* ir_gen_extparam_proto(ir_builder *ir);
215 static void ir_gen_extparam (ir_builder *ir);
217 /* error functions */
219 static void irerror(lex_ctx ctx, const char *msg, ...)
223 con_cvprintmsg((void*)&ctx, LVL_ERROR, "internal error", msg, ap);
227 static bool irwarning(lex_ctx ctx, int warntype, const char *fmt, ...)
232 r = vcompile_warning(ctx, warntype, fmt, ap);
237 /***********************************************************************
238 * Vector utility functions
241 bool GMQCC_WARN vec_ir_value_find(ir_value **vec, const ir_value *what, size_t *idx)
244 size_t len = vec_size(vec);
245 for (i = 0; i < len; ++i) {
246 if (vec[i] == what) {
254 bool GMQCC_WARN vec_ir_block_find(ir_block **vec, ir_block *what, size_t *idx)
257 size_t len = vec_size(vec);
258 for (i = 0; i < len; ++i) {
259 if (vec[i] == what) {
267 bool GMQCC_WARN vec_ir_instr_find(ir_instr **vec, ir_instr *what, size_t *idx)
270 size_t len = vec_size(vec);
271 for (i = 0; i < len; ++i) {
272 if (vec[i] == what) {
280 /***********************************************************************
284 static void ir_block_delete_quick(ir_block* self);
285 static void ir_instr_delete_quick(ir_instr *self);
286 static void ir_function_delete_quick(ir_function *self);
288 ir_builder* ir_builder_new(const char *modulename)
292 self = (ir_builder*)mem_a(sizeof(*self));
296 self->functions = NULL;
297 self->globals = NULL;
299 self->filenames = NULL;
300 self->filestrings = NULL;
301 self->htglobals = util_htnew(IR_HT_SIZE);
302 self->htfields = util_htnew(IR_HT_SIZE);
303 self->htfunctions = util_htnew(IR_HT_SIZE);
305 self->extparams = NULL;
306 self->extparam_protos = NULL;
308 self->first_common_globaltemp = 0;
309 self->max_globaltemps = 0;
310 self->first_common_local = 0;
311 self->max_locals = 0;
313 self->str_immediate = 0;
315 if (!ir_builder_set_name(self, modulename)) {
320 self->nil = ir_value_var("nil", store_value, TYPE_NIL);
321 self->nil->cvq = CV_CONST;
323 self->reserved_va_count = NULL;
328 void ir_builder_delete(ir_builder* self)
331 util_htdel(self->htglobals);
332 util_htdel(self->htfields);
333 util_htdel(self->htfunctions);
334 mem_d((void*)self->name);
335 for (i = 0; i != vec_size(self->functions); ++i) {
336 ir_function_delete_quick(self->functions[i]);
338 vec_free(self->functions);
339 for (i = 0; i != vec_size(self->extparams); ++i) {
340 ir_value_delete(self->extparams[i]);
342 vec_free(self->extparams);
343 for (i = 0; i != vec_size(self->globals); ++i) {
344 ir_value_delete(self->globals[i]);
346 vec_free(self->globals);
347 for (i = 0; i != vec_size(self->fields); ++i) {
348 ir_value_delete(self->fields[i]);
350 ir_value_delete(self->nil);
351 vec_free(self->fields);
352 vec_free(self->filenames);
353 vec_free(self->filestrings);
357 bool ir_builder_set_name(ir_builder *self, const char *name)
360 mem_d((void*)self->name);
361 self->name = util_strdup(name);
365 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
367 return (ir_function*)util_htget(self->htfunctions, name);
370 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
372 ir_function *fn = ir_builder_get_function(self, name);
377 fn = ir_function_new(self, outtype);
378 if (!ir_function_set_name(fn, name))
380 ir_function_delete(fn);
383 vec_push(self->functions, fn);
384 util_htset(self->htfunctions, name, fn);
386 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
388 ir_function_delete(fn);
392 fn->value->hasvalue = true;
393 fn->value->outtype = outtype;
394 fn->value->constval.vfunc = fn;
395 fn->value->context = fn->context;
400 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
402 return (ir_value*)util_htget(self->htglobals, name);
405 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
409 if (name && name[0] != '#')
411 ve = ir_builder_get_global(self, name);
417 ve = ir_value_var(name, store_global, vtype);
418 vec_push(self->globals, ve);
419 util_htset(self->htglobals, name, ve);
423 ir_value* ir_builder_get_va_count(ir_builder *self)
425 if (self->reserved_va_count)
426 return self->reserved_va_count;
427 return (self->reserved_va_count = ir_builder_create_global(self, "reserved:va_count", TYPE_FLOAT));
430 ir_value* ir_builder_get_field(ir_builder *self, const char *name)
432 return (ir_value*)util_htget(self->htfields, name);
436 ir_value* ir_builder_create_field(ir_builder *self, const char *name, int vtype)
438 ir_value *ve = ir_builder_get_field(self, name);
443 ve = ir_value_var(name, store_global, TYPE_FIELD);
444 ve->fieldtype = vtype;
445 vec_push(self->fields, ve);
446 util_htset(self->htfields, name, ve);
450 /***********************************************************************
454 bool ir_function_naive_phi(ir_function*);
455 void ir_function_enumerate(ir_function*);
456 bool ir_function_calculate_liferanges(ir_function*);
457 bool ir_function_allocate_locals(ir_function*);
459 ir_function* ir_function_new(ir_builder* owner, int outtype)
462 self = (ir_function*)mem_a(sizeof(*self));
467 memset(self, 0, sizeof(*self));
470 if (!ir_function_set_name(self, "<@unnamed>")) {
477 self->context.file = "<@no context>";
478 self->context.line = 0;
479 self->outtype = outtype;
488 self->max_varargs = 0;
490 self->code_function_def = -1;
491 self->allocated_locals = 0;
492 self->globaltemps = 0;
498 bool ir_function_set_name(ir_function *self, const char *name)
501 mem_d((void*)self->name);
502 self->name = util_strdup(name);
506 static void ir_function_delete_quick(ir_function *self)
509 mem_d((void*)self->name);
511 for (i = 0; i != vec_size(self->blocks); ++i)
512 ir_block_delete_quick(self->blocks[i]);
513 vec_free(self->blocks);
515 vec_free(self->params);
517 for (i = 0; i != vec_size(self->values); ++i)
518 ir_value_delete(self->values[i]);
519 vec_free(self->values);
521 for (i = 0; i != vec_size(self->locals); ++i)
522 ir_value_delete(self->locals[i]);
523 vec_free(self->locals);
525 /* self->value is deleted by the builder */
530 void ir_function_delete(ir_function *self)
533 mem_d((void*)self->name);
535 for (i = 0; i != vec_size(self->blocks); ++i)
536 ir_block_delete(self->blocks[i]);
537 vec_free(self->blocks);
539 vec_free(self->params);
541 for (i = 0; i != vec_size(self->values); ++i)
542 ir_value_delete(self->values[i]);
543 vec_free(self->values);
545 for (i = 0; i != vec_size(self->locals); ++i)
546 ir_value_delete(self->locals[i]);
547 vec_free(self->locals);
549 /* self->value is deleted by the builder */
554 void ir_function_collect_value(ir_function *self, ir_value *v)
556 vec_push(self->values, v);
559 ir_block* ir_function_create_block(lex_ctx ctx, ir_function *self, const char *label)
561 ir_block* bn = ir_block_new(self, label);
563 vec_push(self->blocks, bn);
567 static bool instr_is_operation(uint16_t op)
569 return ( (op >= INSTR_MUL_F && op <= INSTR_GT) ||
570 (op >= INSTR_LOAD_F && op <= INSTR_LOAD_FNC) ||
571 (op == INSTR_ADDRESS) ||
572 (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) ||
573 (op >= INSTR_AND && op <= INSTR_BITOR) ||
574 (op >= INSTR_CALL0 && op <= INSTR_CALL8) );
577 bool ir_function_pass_peephole(ir_function *self)
581 for (b = 0; b < vec_size(self->blocks); ++b) {
583 ir_block *block = self->blocks[b];
585 for (i = 0; i < vec_size(block->instr); ++i) {
587 inst = block->instr[i];
590 (inst->opcode >= INSTR_STORE_F &&
591 inst->opcode <= INSTR_STORE_FNC))
599 oper = block->instr[i-1];
600 if (!instr_is_operation(oper->opcode))
603 if (OPTS_FLAG(LEGACY_VECTOR_MATHS)) {
604 if (oper->opcode == INSTR_MUL_VF && oper->_ops[2]->memberof == oper->_ops[1])
606 if (oper->opcode == INSTR_MUL_FV && oper->_ops[1]->memberof == oper->_ops[2])
610 value = oper->_ops[0];
612 /* only do it for SSA values */
613 if (value->store != store_value)
616 /* don't optimize out the temp if it's used later again */
617 if (vec_size(value->reads) != 1)
620 /* The very next store must use this value */
621 if (value->reads[0] != store)
624 /* And of course the store must _read_ from it, so it's in
626 if (store->_ops[1] != value)
629 ++opts_optimizationcount[OPTIM_PEEPHOLE];
630 (void)!ir_instr_op(oper, 0, store->_ops[0], true);
632 vec_remove(block->instr, i, 1);
633 ir_instr_delete(store);
635 else if (inst->opcode == VINSTR_COND)
637 /* COND on a value resulting from a NOT could
638 * remove the NOT and swap its operands
645 value = inst->_ops[0];
647 if (value->store != store_value ||
648 vec_size(value->reads) != 1 ||
649 value->reads[0] != inst)
654 inot = value->writes[0];
655 if (inot->_ops[0] != value ||
656 inot->opcode < INSTR_NOT_F ||
657 inot->opcode > INSTR_NOT_FNC ||
658 inot->opcode == INSTR_NOT_V || /* can't do these */
659 inot->opcode == INSTR_NOT_S)
665 ++opts_optimizationcount[OPTIM_PEEPHOLE];
667 (void)!ir_instr_op(inst, 0, inot->_ops[1], false);
670 for (inotid = 0; inotid < vec_size(tmp->instr); ++inotid) {
671 if (tmp->instr[inotid] == inot)
674 if (inotid >= vec_size(tmp->instr)) {
675 compile_error(inst->context, "sanity-check failed: failed to find instruction to optimize out");
678 vec_remove(tmp->instr, inotid, 1);
679 ir_instr_delete(inot);
680 /* swap ontrue/onfalse */
682 inst->bops[0] = inst->bops[1];
693 bool ir_function_pass_tailrecursion(ir_function *self)
697 for (b = 0; b < vec_size(self->blocks); ++b) {
699 ir_instr *ret, *call, *store = NULL;
700 ir_block *block = self->blocks[b];
702 if (!block->final || vec_size(block->instr) < 2)
705 ret = block->instr[vec_size(block->instr)-1];
706 if (ret->opcode != INSTR_DONE && ret->opcode != INSTR_RETURN)
709 call = block->instr[vec_size(block->instr)-2];
710 if (call->opcode >= INSTR_STORE_F && call->opcode <= INSTR_STORE_FNC) {
711 /* account for the unoptimized
713 * STORE %return, %tmp
717 if (vec_size(block->instr) < 3)
721 call = block->instr[vec_size(block->instr)-3];
724 if (call->opcode < INSTR_CALL0 || call->opcode > INSTR_CALL8)
728 /* optimize out the STORE */
730 ret->_ops[0] == store->_ops[0] &&
731 store->_ops[1] == call->_ops[0])
733 ++opts_optimizationcount[OPTIM_PEEPHOLE];
734 call->_ops[0] = store->_ops[0];
735 vec_remove(block->instr, vec_size(block->instr) - 2, 1);
736 ir_instr_delete(store);
745 funcval = call->_ops[1];
748 if (funcval->vtype != TYPE_FUNCTION || funcval->constval.vfunc != self)
751 /* now we have a CALL and a RET, check if it's a tailcall */
752 if (ret->_ops[0] && call->_ops[0] != ret->_ops[0])
755 ++opts_optimizationcount[OPTIM_TAIL_RECURSION];
756 vec_shrinkby(block->instr, 2);
758 block->final = false; /* open it back up */
760 /* emite parameter-stores */
761 for (p = 0; p < vec_size(call->params); ++p) {
762 /* assert(call->params_count <= self->locals_count); */
763 if (!ir_block_create_store(block, call->context, self->locals[p], call->params[p])) {
764 irerror(call->context, "failed to create tailcall store instruction for parameter %i", (int)p);
768 if (!ir_block_create_jump(block, call->context, self->blocks[0])) {
769 irerror(call->context, "failed to create tailcall jump");
773 ir_instr_delete(call);
774 ir_instr_delete(ret);
780 bool ir_function_finalize(ir_function *self)
787 if (OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
788 if (!ir_function_pass_peephole(self)) {
789 irerror(self->context, "generic optimization pass broke something in `%s`", self->name);
794 if (OPTS_OPTIMIZATION(OPTIM_TAIL_RECURSION)) {
795 if (!ir_function_pass_tailrecursion(self)) {
796 irerror(self->context, "tail-recursion optimization pass broke something in `%s`", self->name);
801 if (!ir_function_naive_phi(self)) {
802 irerror(self->context, "internal error: ir_function_naive_phi failed");
806 for (i = 0; i < vec_size(self->locals); ++i) {
807 ir_value *v = self->locals[i];
808 if (v->vtype == TYPE_VECTOR ||
809 (v->vtype == TYPE_FIELD && v->outtype == TYPE_VECTOR))
811 ir_value_vector_member(v, 0);
812 ir_value_vector_member(v, 1);
813 ir_value_vector_member(v, 2);
816 for (i = 0; i < vec_size(self->values); ++i) {
817 ir_value *v = self->values[i];
818 if (v->vtype == TYPE_VECTOR ||
819 (v->vtype == TYPE_FIELD && v->outtype == TYPE_VECTOR))
821 ir_value_vector_member(v, 0);
822 ir_value_vector_member(v, 1);
823 ir_value_vector_member(v, 2);
827 ir_function_enumerate(self);
829 if (!ir_function_calculate_liferanges(self))
831 if (!ir_function_allocate_locals(self))
836 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
841 vec_size(self->locals) &&
842 self->locals[vec_size(self->locals)-1]->store != store_param) {
843 irerror(self->context, "cannot add parameters after adding locals");
847 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
850 vec_push(self->locals, ve);
854 /***********************************************************************
858 ir_block* ir_block_new(ir_function* owner, const char *name)
861 self = (ir_block*)mem_a(sizeof(*self));
865 memset(self, 0, sizeof(*self));
868 if (name && !ir_block_set_label(self, name)) {
873 self->context.file = "<@no context>";
874 self->context.line = 0;
878 self->entries = NULL;
882 self->is_return = false;
887 self->generated = false;
892 static void ir_block_delete_quick(ir_block* self)
895 if (self->label) mem_d(self->label);
896 for (i = 0; i != vec_size(self->instr); ++i)
897 ir_instr_delete_quick(self->instr[i]);
898 vec_free(self->instr);
899 vec_free(self->entries);
900 vec_free(self->exits);
901 vec_free(self->living);
905 void ir_block_delete(ir_block* self)
908 if (self->label) mem_d(self->label);
909 for (i = 0; i != vec_size(self->instr); ++i)
910 ir_instr_delete(self->instr[i]);
911 vec_free(self->instr);
912 vec_free(self->entries);
913 vec_free(self->exits);
914 vec_free(self->living);
918 bool ir_block_set_label(ir_block *self, const char *name)
921 mem_d((void*)self->label);
922 self->label = util_strdup(name);
923 return !!self->label;
926 /***********************************************************************
930 ir_instr* ir_instr_new(lex_ctx ctx, ir_block* owner, int op)
933 self = (ir_instr*)mem_a(sizeof(*self));
940 self->_ops[0] = NULL;
941 self->_ops[1] = NULL;
942 self->_ops[2] = NULL;
943 self->bops[0] = NULL;
944 self->bops[1] = NULL;
955 static void ir_instr_delete_quick(ir_instr *self)
958 vec_free(self->params);
962 void ir_instr_delete(ir_instr *self)
965 /* The following calls can only delete from
966 * vectors, we still want to delete this instruction
967 * so ignore the return value. Since with the warn_unused_result attribute
968 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
969 * I have to improvise here and use if(foo());
971 for (i = 0; i < vec_size(self->phi); ++i) {
973 if (vec_ir_instr_find(self->phi[i].value->writes, self, &idx))
974 vec_remove(self->phi[i].value->writes, idx, 1);
975 if (vec_ir_instr_find(self->phi[i].value->reads, self, &idx))
976 vec_remove(self->phi[i].value->reads, idx, 1);
979 for (i = 0; i < vec_size(self->params); ++i) {
981 if (vec_ir_instr_find(self->params[i]->writes, self, &idx))
982 vec_remove(self->params[i]->writes, idx, 1);
983 if (vec_ir_instr_find(self->params[i]->reads, self, &idx))
984 vec_remove(self->params[i]->reads, idx, 1);
986 vec_free(self->params);
987 (void)!ir_instr_op(self, 0, NULL, false);
988 (void)!ir_instr_op(self, 1, NULL, false);
989 (void)!ir_instr_op(self, 2, NULL, false);
993 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
995 if (self->_ops[op]) {
997 if (writing && vec_ir_instr_find(self->_ops[op]->writes, self, &idx))
998 vec_remove(self->_ops[op]->writes, idx, 1);
999 else if (vec_ir_instr_find(self->_ops[op]->reads, self, &idx))
1000 vec_remove(self->_ops[op]->reads, idx, 1);
1004 vec_push(v->writes, self);
1006 vec_push(v->reads, self);
1012 /***********************************************************************
1016 void ir_value_code_setaddr(ir_value *self, int32_t gaddr)
1018 self->code.globaladdr = gaddr;
1019 if (self->members[0]) self->members[0]->code.globaladdr = gaddr;
1020 if (self->members[1]) self->members[1]->code.globaladdr = gaddr;
1021 if (self->members[2]) self->members[2]->code.globaladdr = gaddr;
1024 int32_t ir_value_code_addr(const ir_value *self)
1026 if (self->store == store_return)
1027 return OFS_RETURN + self->code.addroffset;
1028 return self->code.globaladdr + self->code.addroffset;
1031 ir_value* ir_value_var(const char *name, int storetype, int vtype)
1034 self = (ir_value*)mem_a(sizeof(*self));
1035 self->vtype = vtype;
1036 self->fieldtype = TYPE_VOID;
1037 self->outtype = TYPE_VOID;
1038 self->store = storetype;
1042 self->writes = NULL;
1044 self->cvq = CV_NONE;
1045 self->hasvalue = false;
1046 self->context.file = "<@no context>";
1047 self->context.line = 0;
1049 if (name && !ir_value_set_name(self, name)) {
1050 irerror(self->context, "out of memory");
1055 memset(&self->constval, 0, sizeof(self->constval));
1056 memset(&self->code, 0, sizeof(self->code));
1058 self->members[0] = NULL;
1059 self->members[1] = NULL;
1060 self->members[2] = NULL;
1061 self->memberof = NULL;
1063 self->unique_life = false;
1064 self->locked = false;
1065 self->callparam = false;
1071 ir_value* ir_value_vector_member(ir_value *self, unsigned int member)
1079 if (self->members[member])
1080 return self->members[member];
1083 len = strlen(self->name);
1084 name = (char*)mem_a(len + 3);
1085 memcpy(name, self->name, len);
1087 name[len+1] = 'x' + member;
1093 if (self->vtype == TYPE_VECTOR)
1095 m = ir_value_var(name, self->store, TYPE_FLOAT);
1100 m->context = self->context;
1102 self->members[member] = m;
1103 m->code.addroffset = member;
1105 else if (self->vtype == TYPE_FIELD)
1107 if (self->fieldtype != TYPE_VECTOR)
1109 m = ir_value_var(name, self->store, TYPE_FIELD);
1114 m->fieldtype = TYPE_FLOAT;
1115 m->context = self->context;
1117 self->members[member] = m;
1118 m->code.addroffset = member;
1122 irerror(self->context, "invalid member access on %s", self->name);
1130 static GMQCC_INLINE size_t ir_value_sizeof(const ir_value *self)
1132 if (self->vtype == TYPE_FIELD && self->fieldtype == TYPE_VECTOR)
1133 return type_sizeof_[TYPE_VECTOR];
1134 return type_sizeof_[self->vtype];
1137 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
1139 ir_value *v = ir_value_var(name, storetype, vtype);
1142 ir_function_collect_value(owner, v);
1146 void ir_value_delete(ir_value* self)
1150 mem_d((void*)self->name);
1153 if (self->vtype == TYPE_STRING)
1154 mem_d((void*)self->constval.vstring);
1156 for (i = 0; i < 3; ++i) {
1157 if (self->members[i])
1158 ir_value_delete(self->members[i]);
1160 vec_free(self->reads);
1161 vec_free(self->writes);
1162 vec_free(self->life);
1166 bool ir_value_set_name(ir_value *self, const char *name)
1169 mem_d((void*)self->name);
1170 self->name = util_strdup(name);
1171 return !!self->name;
1174 bool ir_value_set_float(ir_value *self, float f)
1176 if (self->vtype != TYPE_FLOAT)
1178 self->constval.vfloat = f;
1179 self->hasvalue = true;
1183 bool ir_value_set_func(ir_value *self, int f)
1185 if (self->vtype != TYPE_FUNCTION)
1187 self->constval.vint = f;
1188 self->hasvalue = true;
1192 bool ir_value_set_vector(ir_value *self, vector v)
1194 if (self->vtype != TYPE_VECTOR)
1196 self->constval.vvec = v;
1197 self->hasvalue = true;
1201 bool ir_value_set_field(ir_value *self, ir_value *fld)
1203 if (self->vtype != TYPE_FIELD)
1205 self->constval.vpointer = fld;
1206 self->hasvalue = true;
1210 static char *ir_strdup(const char *str)
1213 /* actually dup empty strings */
1214 char *out = (char*)mem_a(1);
1218 return util_strdup(str);
1221 bool ir_value_set_string(ir_value *self, const char *str)
1223 if (self->vtype != TYPE_STRING)
1225 self->constval.vstring = ir_strdup(str);
1226 self->hasvalue = true;
1231 bool ir_value_set_int(ir_value *self, int i)
1233 if (self->vtype != TYPE_INTEGER)
1235 self->constval.vint = i;
1236 self->hasvalue = true;
1241 bool ir_value_lives(ir_value *self, size_t at)
1244 for (i = 0; i < vec_size(self->life); ++i)
1246 ir_life_entry_t *life = &self->life[i];
1247 if (life->start <= at && at <= life->end)
1249 if (life->start > at) /* since it's ordered */
1255 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
1258 vec_push(self->life, e);
1259 for (k = vec_size(self->life)-1; k > idx; --k)
1260 self->life[k] = self->life[k-1];
1261 self->life[idx] = e;
1265 bool ir_value_life_merge(ir_value *self, size_t s)
1268 const size_t vs = vec_size(self->life);
1269 ir_life_entry_t *life = NULL;
1270 ir_life_entry_t *before = NULL;
1271 ir_life_entry_t new_entry;
1273 /* Find the first range >= s */
1274 for (i = 0; i < vs; ++i)
1277 life = &self->life[i];
1278 if (life->start > s)
1281 /* nothing found? append */
1284 if (life && life->end+1 == s)
1286 /* previous life range can be merged in */
1290 if (life && life->end >= s)
1292 e.start = e.end = s;
1293 vec_push(self->life, e);
1299 if (before->end + 1 == s &&
1300 life->start - 1 == s)
1303 before->end = life->end;
1304 vec_remove(self->life, i, 1);
1307 if (before->end + 1 == s)
1313 /* already contained */
1314 if (before->end >= s)
1318 if (life->start - 1 == s)
1323 /* insert a new entry */
1324 new_entry.start = new_entry.end = s;
1325 return ir_value_life_insert(self, i, new_entry);
1328 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
1332 if (!vec_size(other->life))
1335 if (!vec_size(self->life)) {
1336 size_t count = vec_size(other->life);
1337 ir_life_entry_t *life = vec_add(self->life, count);
1338 memcpy(life, other->life, count * sizeof(*life));
1343 for (i = 0; i < vec_size(other->life); ++i)
1345 const ir_life_entry_t *life = &other->life[i];
1348 ir_life_entry_t *entry = &self->life[myi];
1350 if (life->end+1 < entry->start)
1352 /* adding an interval before entry */
1353 if (!ir_value_life_insert(self, myi, *life))
1359 if (life->start < entry->start &&
1360 life->end+1 >= entry->start)
1362 /* starts earlier and overlaps */
1363 entry->start = life->start;
1366 if (life->end > entry->end &&
1367 life->start <= entry->end+1)
1369 /* ends later and overlaps */
1370 entry->end = life->end;
1373 /* see if our change combines it with the next ranges */
1374 while (myi+1 < vec_size(self->life) &&
1375 entry->end+1 >= self->life[1+myi].start)
1377 /* overlaps with (myi+1) */
1378 if (entry->end < self->life[1+myi].end)
1379 entry->end = self->life[1+myi].end;
1380 vec_remove(self->life, myi+1, 1);
1381 entry = &self->life[myi];
1384 /* see if we're after the entry */
1385 if (life->start > entry->end)
1388 /* append if we're at the end */
1389 if (myi >= vec_size(self->life)) {
1390 vec_push(self->life, *life);
1393 /* otherweise check the next range */
1402 bool ir_values_overlap(const ir_value *a, const ir_value *b)
1404 /* For any life entry in A see if it overlaps with
1405 * any life entry in B.
1406 * Note that the life entries are orderes, so we can make a
1407 * more efficient algorithm there than naively translating the
1411 ir_life_entry_t *la, *lb, *enda, *endb;
1413 /* first of all, if either has no life range, they cannot clash */
1414 if (!vec_size(a->life) || !vec_size(b->life))
1419 enda = la + vec_size(a->life);
1420 endb = lb + vec_size(b->life);
1423 /* check if the entries overlap, for that,
1424 * both must start before the other one ends.
1426 if (la->start < lb->end &&
1427 lb->start < la->end)
1432 /* entries are ordered
1433 * one entry is earlier than the other
1434 * that earlier entry will be moved forward
1436 if (la->start < lb->start)
1438 /* order: A B, move A forward
1439 * check if we hit the end with A
1444 else /* if (lb->start < la->start) actually <= */
1446 /* order: B A, move B forward
1447 * check if we hit the end with B
1456 /***********************************************************************
1460 static bool ir_check_unreachable(ir_block *self)
1462 /* The IR should never have to deal with unreachable code */
1463 if (!self->final/* || OPTS_FLAG(ALLOW_UNREACHABLE_CODE)*/)
1465 irerror(self->context, "unreachable statement (%s)", self->label);
1469 bool ir_block_create_store_op(ir_block *self, lex_ctx ctx, int op, ir_value *target, ir_value *what)
1472 if (!ir_check_unreachable(self))
1475 if (target->store == store_value &&
1476 (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1478 irerror(self->context, "cannot store to an SSA value");
1479 irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1480 irerror(self->context, "instruction: %s", asm_instr[op].m);
1484 in = ir_instr_new(ctx, self, op);
1488 if (!ir_instr_op(in, 0, target, (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC)) ||
1489 !ir_instr_op(in, 1, what, false))
1491 ir_instr_delete(in);
1494 vec_push(self->instr, in);
1498 bool ir_block_create_store(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1502 if (target->vtype == TYPE_VARIANT)
1503 vtype = what->vtype;
1505 vtype = target->vtype;
1508 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
1509 op = INSTR_CONV_ITOF;
1510 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1511 op = INSTR_CONV_FTOI;
1513 op = type_store_instr[vtype];
1515 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1516 if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1520 return ir_block_create_store_op(self, ctx, op, target, what);
1523 bool ir_block_create_storep(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1528 if (target->vtype != TYPE_POINTER)
1531 /* storing using pointer - target is a pointer, type must be
1532 * inferred from source
1534 vtype = what->vtype;
1536 op = type_storep_instr[vtype];
1537 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1538 if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1539 op = INSTR_STOREP_V;
1542 return ir_block_create_store_op(self, ctx, op, target, what);
1545 bool ir_block_create_return(ir_block *self, lex_ctx ctx, ir_value *v)
1548 if (!ir_check_unreachable(self))
1551 self->is_return = true;
1552 in = ir_instr_new(ctx, self, INSTR_RETURN);
1556 if (v && !ir_instr_op(in, 0, v, false)) {
1557 ir_instr_delete(in);
1561 vec_push(self->instr, in);
1565 bool ir_block_create_if(ir_block *self, lex_ctx ctx, ir_value *v,
1566 ir_block *ontrue, ir_block *onfalse)
1569 if (!ir_check_unreachable(self))
1572 /*in = ir_instr_new(ctx, self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1573 in = ir_instr_new(ctx, self, VINSTR_COND);
1577 if (!ir_instr_op(in, 0, v, false)) {
1578 ir_instr_delete(in);
1582 in->bops[0] = ontrue;
1583 in->bops[1] = onfalse;
1585 vec_push(self->instr, in);
1587 vec_push(self->exits, ontrue);
1588 vec_push(self->exits, onfalse);
1589 vec_push(ontrue->entries, self);
1590 vec_push(onfalse->entries, self);
1594 bool ir_block_create_jump(ir_block *self, lex_ctx ctx, ir_block *to)
1597 if (!ir_check_unreachable(self))
1600 in = ir_instr_new(ctx, self, VINSTR_JUMP);
1605 vec_push(self->instr, in);
1607 vec_push(self->exits, to);
1608 vec_push(to->entries, self);
1612 bool ir_block_create_goto(ir_block *self, lex_ctx ctx, ir_block *to)
1614 self->owner->flags |= IR_FLAG_HAS_GOTO;
1615 return ir_block_create_jump(self, ctx, to);
1618 ir_instr* ir_block_create_phi(ir_block *self, lex_ctx ctx, const char *label, int ot)
1622 if (!ir_check_unreachable(self))
1624 in = ir_instr_new(ctx, self, VINSTR_PHI);
1627 out = ir_value_out(self->owner, label, store_value, ot);
1629 ir_instr_delete(in);
1632 if (!ir_instr_op(in, 0, out, true)) {
1633 ir_instr_delete(in);
1634 ir_value_delete(out);
1637 vec_push(self->instr, in);
1641 ir_value* ir_phi_value(ir_instr *self)
1643 return self->_ops[0];
1646 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1650 if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1651 /* Must not be possible to cause this, otherwise the AST
1652 * is doing something wrong.
1654 irerror(self->context, "Invalid entry block for PHI");
1660 vec_push(v->reads, self);
1661 vec_push(self->phi, pe);
1664 /* call related code */
1665 ir_instr* ir_block_create_call(ir_block *self, lex_ctx ctx, const char *label, ir_value *func, bool noreturn)
1669 if (!ir_check_unreachable(self))
1671 in = ir_instr_new(ctx, self, (noreturn ? VINSTR_NRCALL : INSTR_CALL0));
1676 self->is_return = true;
1678 out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1680 ir_instr_delete(in);
1683 if (!ir_instr_op(in, 0, out, true) ||
1684 !ir_instr_op(in, 1, func, false))
1686 ir_instr_delete(in);
1687 ir_value_delete(out);
1690 vec_push(self->instr, in);
1693 if (!ir_block_create_return(self, ctx, NULL)) {
1694 compile_error(ctx, "internal error: failed to generate dummy-return instruction");
1695 ir_instr_delete(in);
1703 ir_value* ir_call_value(ir_instr *self)
1705 return self->_ops[0];
1708 void ir_call_param(ir_instr* self, ir_value *v)
1710 vec_push(self->params, v);
1711 vec_push(v->reads, self);
1714 /* binary op related code */
1716 ir_value* ir_block_create_binop(ir_block *self, lex_ctx ctx,
1717 const char *label, int opcode,
1718 ir_value *left, ir_value *right)
1740 case INSTR_SUB_S: /* -- offset of string as float */
1745 case INSTR_BITOR_IF:
1746 case INSTR_BITOR_FI:
1747 case INSTR_BITAND_FI:
1748 case INSTR_BITAND_IF:
1763 case INSTR_BITAND_I:
1766 case INSTR_RSHIFT_I:
1767 case INSTR_LSHIFT_I:
1789 /* boolean operations result in floats */
1790 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1792 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1795 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1800 if (ot == TYPE_VOID) {
1801 /* The AST or parser were supposed to check this! */
1805 return ir_block_create_general_instr(self, ctx, label, opcode, left, right, ot);
1808 ir_value* ir_block_create_unary(ir_block *self, lex_ctx ctx,
1809 const char *label, int opcode,
1812 int ot = TYPE_FLOAT;
1824 /* QC doesn't have other unary operations. We expect extensions to fill
1825 * the above list, otherwise we assume out-type = in-type, eg for an
1829 ot = operand->vtype;
1832 if (ot == TYPE_VOID) {
1833 /* The AST or parser were supposed to check this! */
1837 /* let's use the general instruction creator and pass NULL for OPB */
1838 return ir_block_create_general_instr(self, ctx, label, opcode, operand, NULL, ot);
1841 ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx ctx, const char *label,
1842 int op, ir_value *a, ir_value *b, int outype)
1847 out = ir_value_out(self->owner, label, store_value, outype);
1851 instr = ir_instr_new(ctx, self, op);
1853 ir_value_delete(out);
1857 if (!ir_instr_op(instr, 0, out, true) ||
1858 !ir_instr_op(instr, 1, a, false) ||
1859 !ir_instr_op(instr, 2, b, false) )
1864 vec_push(self->instr, instr);
1868 ir_instr_delete(instr);
1869 ir_value_delete(out);
1873 ir_value* ir_block_create_fieldaddress(ir_block *self, lex_ctx ctx, const char *label, ir_value *ent, ir_value *field)
1877 /* Support for various pointer types todo if so desired */
1878 if (ent->vtype != TYPE_ENTITY)
1881 if (field->vtype != TYPE_FIELD)
1884 v = ir_block_create_general_instr(self, ctx, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1885 v->fieldtype = field->fieldtype;
1889 ir_value* ir_block_create_load_from_ent(ir_block *self, lex_ctx ctx, const char *label, ir_value *ent, ir_value *field, int outype)
1892 if (ent->vtype != TYPE_ENTITY)
1895 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1896 if (field->vtype != TYPE_FIELD)
1901 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1902 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1903 case TYPE_STRING: op = INSTR_LOAD_S; break;
1904 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1905 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1906 case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1908 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1909 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1912 irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1916 return ir_block_create_general_instr(self, ctx, label, op, ent, field, outype);
1919 /* PHI resolving breaks the SSA, and must thus be the last
1920 * step before life-range calculation.
1923 static bool ir_block_naive_phi(ir_block *self);
1924 bool ir_function_naive_phi(ir_function *self)
1928 for (i = 0; i < vec_size(self->blocks); ++i)
1930 if (!ir_block_naive_phi(self->blocks[i]))
1936 static bool ir_block_naive_phi(ir_block *self)
1938 size_t i, p; /*, w;*/
1939 /* FIXME: optionally, create_phi can add the phis
1940 * to a list so we don't need to loop through blocks
1941 * - anyway: "don't optimize YET"
1943 for (i = 0; i < vec_size(self->instr); ++i)
1945 ir_instr *instr = self->instr[i];
1946 if (instr->opcode != VINSTR_PHI)
1949 vec_remove(self->instr, i, 1);
1950 --i; /* NOTE: i+1 below */
1952 for (p = 0; p < vec_size(instr->phi); ++p)
1954 ir_value *v = instr->phi[p].value;
1955 ir_block *b = instr->phi[p].from;
1957 if (v->store == store_value &&
1958 vec_size(v->reads) == 1 &&
1959 vec_size(v->writes) == 1)
1961 /* replace the value */
1962 if (!ir_instr_op(v->writes[0], 0, instr->_ops[0], true))
1967 /* force a move instruction */
1968 ir_instr *prevjump = vec_last(b->instr);
1971 instr->_ops[0]->store = store_global;
1972 if (!ir_block_create_store(b, instr->context, instr->_ops[0], v))
1974 instr->_ops[0]->store = store_value;
1975 vec_push(b->instr, prevjump);
1979 ir_instr_delete(instr);
1984 /***********************************************************************
1985 *IR Temp allocation code
1986 * Propagating value life ranges by walking through the function backwards
1987 * until no more changes are made.
1988 * In theory this should happen once more than once for every nested loop
1990 * Though this implementation might run an additional time for if nests.
1993 /* Enumerate instructions used by value's life-ranges
1995 static void ir_block_enumerate(ir_block *self, size_t *_eid)
1999 for (i = 0; i < vec_size(self->instr); ++i)
2001 self->instr[i]->eid = eid++;
2006 /* Enumerate blocks and instructions.
2007 * The block-enumeration is unordered!
2008 * We do not really use the block enumreation, however
2009 * the instruction enumeration is important for life-ranges.
2011 void ir_function_enumerate(ir_function *self)
2014 size_t instruction_id = 0;
2015 for (i = 0; i < vec_size(self->blocks); ++i)
2017 /* each block now gets an additional "entry" instruction id
2018 * we can use to avoid point-life issues
2020 self->blocks[i]->entry_id = instruction_id;
2023 self->blocks[i]->eid = i;
2024 self->blocks[i]->run_id = 0;
2025 ir_block_enumerate(self->blocks[i], &instruction_id);
2029 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
2030 bool ir_function_calculate_liferanges(ir_function *self)
2035 /* parameters live at 0 */
2036 for (i = 0; i < vec_size(self->params); ++i)
2037 ir_value_life_merge(self->locals[i], 0);
2042 for (i = 0; i != vec_size(self->blocks); ++i)
2044 if (self->blocks[i]->is_return)
2046 vec_free(self->blocks[i]->living);
2047 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
2052 if (vec_size(self->blocks)) {
2053 ir_block *block = self->blocks[0];
2054 for (i = 0; i < vec_size(block->living); ++i) {
2055 ir_value *v = block->living[i];
2056 if (v->store != store_local)
2058 if (v->vtype == TYPE_VECTOR)
2060 self->flags |= IR_FLAG_HAS_UNINITIALIZED;
2061 /* find the instruction reading from it */
2062 for (s = 0; s < vec_size(v->reads); ++s) {
2063 if (v->reads[s]->eid == v->life[0].end)
2066 if (s < vec_size(v->reads)) {
2067 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2068 "variable `%s` may be used uninitialized in this function\n"
2071 v->reads[s]->context.file, v->reads[s]->context.line)
2079 ir_value *vec = v->memberof;
2080 for (s = 0; s < vec_size(vec->reads); ++s) {
2081 if (vec->reads[s]->eid == v->life[0].end)
2084 if (s < vec_size(vec->reads)) {
2085 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2086 "variable `%s` may be used uninitialized in this function\n"
2089 vec->reads[s]->context.file, vec->reads[s]->context.line)
2097 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2098 "variable `%s` may be used uninitialized in this function", v->name))
2107 /* Local-value allocator
2108 * After finishing creating the liferange of all values used in a function
2109 * we can allocate their global-positions.
2110 * This is the counterpart to register-allocation in register machines.
2117 } function_allocator;
2119 static bool function_allocator_alloc(function_allocator *alloc, ir_value *var)
2122 size_t vsize = ir_value_sizeof(var);
2124 var->code.local = vec_size(alloc->locals);
2126 slot = ir_value_var("reg", store_global, var->vtype);
2130 if (!ir_value_life_merge_into(slot, var))
2133 vec_push(alloc->locals, slot);
2134 vec_push(alloc->sizes, vsize);
2135 vec_push(alloc->unique, var->unique_life);
2140 ir_value_delete(slot);
2144 static bool ir_function_allocator_assign(ir_function *self, function_allocator *alloc, ir_value *v)
2150 return function_allocator_alloc(alloc, v);
2152 for (a = 0; a < vec_size(alloc->locals); ++a)
2154 /* if it's reserved for a unique liferange: skip */
2155 if (alloc->unique[a])
2158 slot = alloc->locals[a];
2160 /* never resize parameters
2161 * will be required later when overlapping temps + locals
2163 if (a < vec_size(self->params) &&
2164 alloc->sizes[a] < ir_value_sizeof(v))
2169 if (ir_values_overlap(v, slot))
2172 if (!ir_value_life_merge_into(slot, v))
2175 /* adjust size for this slot */
2176 if (alloc->sizes[a] < ir_value_sizeof(v))
2177 alloc->sizes[a] = ir_value_sizeof(v);
2182 if (a >= vec_size(alloc->locals)) {
2183 if (!function_allocator_alloc(alloc, v))
2189 bool ir_function_allocate_locals(ir_function *self)
2194 bool opt_gt = OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS);
2198 function_allocator lockalloc, globalloc;
2200 if (!vec_size(self->locals) && !vec_size(self->values))
2203 globalloc.locals = NULL;
2204 globalloc.sizes = NULL;
2205 globalloc.positions = NULL;
2206 globalloc.unique = NULL;
2207 lockalloc.locals = NULL;
2208 lockalloc.sizes = NULL;
2209 lockalloc.positions = NULL;
2210 lockalloc.unique = NULL;
2212 for (i = 0; i < vec_size(self->locals); ++i)
2214 v = self->locals[i];
2215 if ((self->flags & IR_FLAG_MASK_NO_LOCAL_TEMPS) || !OPTS_OPTIMIZATION(OPTIM_LOCAL_TEMPS)) {
2217 v->unique_life = true;
2219 else if (i >= vec_size(self->params))
2222 v->locked = true; /* lock parameters locals */
2223 if (!function_allocator_alloc((v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2226 for (; i < vec_size(self->locals); ++i)
2228 v = self->locals[i];
2229 if (!vec_size(v->life))
2231 if (!ir_function_allocator_assign(self, (v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2235 /* Allocate a slot for any value that still exists */
2236 for (i = 0; i < vec_size(self->values); ++i)
2238 v = self->values[i];
2240 if (!vec_size(v->life))
2243 /* CALL optimization:
2244 * If the value is a parameter-temp: 1 write, 1 read from a CALL
2245 * and it's not "locked", write it to the OFS_PARM directly.
2247 if (OPTS_OPTIMIZATION(OPTIM_CALL_STORES) && !v->locked && !v->unique_life) {
2248 if (vec_size(v->reads) == 1 && vec_size(v->writes) == 1 &&
2249 (v->reads[0]->opcode == VINSTR_NRCALL ||
2250 (v->reads[0]->opcode >= INSTR_CALL0 && v->reads[0]->opcode <= INSTR_CALL8)
2255 ir_instr *call = v->reads[0];
2256 if (!vec_ir_value_find(call->params, v, ¶m)) {
2257 irerror(call->context, "internal error: unlocked parameter %s not found", v->name);
2260 ++opts_optimizationcount[OPTIM_CALL_STORES];
2261 v->callparam = true;
2263 ir_value_code_setaddr(v, OFS_PARM0 + 3*param);
2265 size_t nprotos = vec_size(self->owner->extparam_protos);
2268 if (nprotos > param)
2269 ep = self->owner->extparam_protos[param];
2272 ep = ir_gen_extparam_proto(self->owner);
2273 while (++nprotos <= param)
2274 ep = ir_gen_extparam_proto(self->owner);
2276 ir_instr_op(v->writes[0], 0, ep, true);
2277 call->params[param+8] = ep;
2281 if (vec_size(v->writes) == 1 && v->writes[0]->opcode == INSTR_CALL0)
2283 v->store = store_return;
2284 if (v->members[0]) v->members[0]->store = store_return;
2285 if (v->members[1]) v->members[1]->store = store_return;
2286 if (v->members[2]) v->members[2]->store = store_return;
2287 ++opts_optimizationcount[OPTIM_CALL_STORES];
2292 if (!ir_function_allocator_assign(self, (v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2296 if (!lockalloc.sizes && !globalloc.sizes) {
2299 vec_push(lockalloc.positions, 0);
2300 vec_push(globalloc.positions, 0);
2302 /* Adjust slot positions based on sizes */
2303 if (lockalloc.sizes) {
2304 pos = (vec_size(lockalloc.sizes) ? lockalloc.positions[0] : 0);
2305 for (i = 1; i < vec_size(lockalloc.sizes); ++i)
2307 pos = lockalloc.positions[i-1] + lockalloc.sizes[i-1];
2308 vec_push(lockalloc.positions, pos);
2310 self->allocated_locals = pos + vec_last(lockalloc.sizes);
2312 if (globalloc.sizes) {
2313 pos = (vec_size(globalloc.sizes) ? globalloc.positions[0] : 0);
2314 for (i = 1; i < vec_size(globalloc.sizes); ++i)
2316 pos = globalloc.positions[i-1] + globalloc.sizes[i-1];
2317 vec_push(globalloc.positions, pos);
2319 self->globaltemps = pos + vec_last(globalloc.sizes);
2322 /* Locals need to know their new position */
2323 for (i = 0; i < vec_size(self->locals); ++i) {
2324 v = self->locals[i];
2325 if (v->locked || !opt_gt)
2326 v->code.local = lockalloc.positions[v->code.local];
2328 v->code.local = globalloc.positions[v->code.local];
2330 /* Take over the actual slot positions on values */
2331 for (i = 0; i < vec_size(self->values); ++i) {
2332 v = self->values[i];
2333 if (v->locked || !opt_gt)
2334 v->code.local = lockalloc.positions[v->code.local];
2336 v->code.local = globalloc.positions[v->code.local];
2344 for (i = 0; i < vec_size(lockalloc.locals); ++i)
2345 ir_value_delete(lockalloc.locals[i]);
2346 for (i = 0; i < vec_size(globalloc.locals); ++i)
2347 ir_value_delete(globalloc.locals[i]);
2348 vec_free(globalloc.unique);
2349 vec_free(globalloc.locals);
2350 vec_free(globalloc.sizes);
2351 vec_free(globalloc.positions);
2352 vec_free(lockalloc.unique);
2353 vec_free(lockalloc.locals);
2354 vec_free(lockalloc.sizes);
2355 vec_free(lockalloc.positions);
2359 /* Get information about which operand
2360 * is read from, or written to.
2362 static void ir_op_read_write(int op, size_t *read, size_t *write)
2382 case INSTR_STOREP_F:
2383 case INSTR_STOREP_V:
2384 case INSTR_STOREP_S:
2385 case INSTR_STOREP_ENT:
2386 case INSTR_STOREP_FLD:
2387 case INSTR_STOREP_FNC:
2398 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2401 const size_t vs = vec_size(self->living);
2402 bool changed = false;
2403 for (i = 0; i != vs; ++i)
2405 if (ir_value_life_merge(self->living[i], eid))
2411 static bool ir_block_living_lock(ir_block *self)
2414 bool changed = false;
2415 for (i = 0; i != vec_size(self->living); ++i)
2417 if (!self->living[i]->locked) {
2418 self->living[i]->locked = true;
2425 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
2431 /* values which have been read in a previous iteration are now
2432 * in the "living" array even if the previous block doesn't use them.
2433 * So we have to remove whatever does not exist in the previous block.
2434 * They will be re-added on-read, but the liferange merge won't cause
2436 for (i = 0; i < vec_size(self->living); ++i)
2438 if (!vec_ir_value_find(prev->living, self->living[i], NULL)) {
2439 vec_remove(self->living, i, 1);
2445 /* Whatever the previous block still has in its living set
2446 * must now be added to ours as well.
2448 for (i = 0; i < vec_size(prev->living); ++i)
2450 if (vec_ir_value_find(self->living, prev->living[i], NULL))
2452 vec_push(self->living, prev->living[i]);
2454 irerror(self->contextt from prev: %s", self->label, prev->living[i]->_name);
2460 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
2464 size_t i, o, p, mem;
2465 /* bitmasks which operands are read from or written to */
2474 if (!ir_block_life_prop_previous(self, prev, changed))
2478 i = vec_size(self->instr);
2481 instr = self->instr[i];
2483 /* See which operands are read and write operands */
2484 ir_op_read_write(instr->opcode, &read, &write);
2486 /* Go through the 3 main operands
2487 * writes first, then reads
2489 for (o = 0; o < 3; ++o)
2491 if (!instr->_ops[o]) /* no such operand */
2494 value = instr->_ops[o];
2496 /* We only care about locals */
2497 /* we also calculate parameter liferanges so that locals
2498 * can take up parameter slots */
2499 if (value->store != store_value &&
2500 value->store != store_local &&
2501 value->store != store_param)
2504 /* write operands */
2505 /* When we write to a local, we consider it "dead" for the
2506 * remaining upper part of the function, since in SSA a value
2507 * can only be written once (== created)
2512 bool in_living = vec_ir_value_find(self->living, value, &idx);
2515 /* If the value isn't alive it hasn't been read before... */
2516 /* TODO: See if the warning can be emitted during parsing or AST processing
2517 * otherwise have warning printed here.
2518 * IF printing a warning here: include filecontext_t,
2519 * and make sure it's only printed once
2520 * since this function is run multiple times.
2522 /* con_err( "Value only written %s\n", value->name); */
2523 if (ir_value_life_merge(value, instr->eid))
2526 /* since 'living' won't contain it
2527 * anymore, merge the value, since
2530 if (ir_value_life_merge(value, instr->eid))
2533 vec_remove(self->living, idx, 1);
2535 /* Removing a vector removes all members */
2536 for (mem = 0; mem < 3; ++mem) {
2537 if (value->members[mem] && vec_ir_value_find(self->living, value->members[mem], &idx)) {
2538 if (ir_value_life_merge(value->members[mem], instr->eid))
2540 vec_remove(self->living, idx, 1);
2543 /* Removing the last member removes the vector */
2544 if (value->memberof) {
2545 value = value->memberof;
2546 for (mem = 0; mem < 3; ++mem) {
2547 if (value->members[mem] && vec_ir_value_find(self->living, value->members[mem], NULL))
2550 if (mem == 3 && vec_ir_value_find(self->living, value, &idx)) {
2551 if (ir_value_life_merge(value, instr->eid))
2553 vec_remove(self->living, idx, 1);
2559 if (instr->opcode == INSTR_MUL_VF)
2561 value = instr->_ops[2];
2562 /* the float source will get an additional lifetime */
2563 if (ir_value_life_merge(value, instr->eid+1))
2565 if (value->memberof && ir_value_life_merge(value->memberof, instr->eid+1))
2568 else if (instr->opcode == INSTR_MUL_FV || instr->opcode == INSTR_LOAD_V)
2570 value = instr->_ops[1];
2571 /* the float source will get an additional lifetime */
2572 if (ir_value_life_merge(value, instr->eid+1))
2574 if (value->memberof && ir_value_life_merge(value->memberof, instr->eid+1))
2578 for (o = 0; o < 3; ++o)
2580 if (!instr->_ops[o]) /* no such operand */
2583 value = instr->_ops[o];
2585 /* We only care about locals */
2586 /* we also calculate parameter liferanges so that locals
2587 * can take up parameter slots */
2588 if (value->store != store_value &&
2589 value->store != store_local &&
2590 value->store != store_param)
2596 if (!vec_ir_value_find(self->living, value, NULL))
2597 vec_push(self->living, value);
2598 /* reading adds the full vector */
2599 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2600 vec_push(self->living, value->memberof);
2601 for (mem = 0; mem < 3; ++mem) {
2602 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2603 vec_push(self->living, value->members[mem]);
2607 /* PHI operands are always read operands */
2608 for (p = 0; p < vec_size(instr->phi); ++p)
2610 value = instr->phi[p].value;
2611 if (!vec_ir_value_find(self->living, value, NULL))
2612 vec_push(self->living, value);
2613 /* reading adds the full vector */
2614 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2615 vec_push(self->living, value->memberof);
2616 for (mem = 0; mem < 3; ++mem) {
2617 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2618 vec_push(self->living, value->members[mem]);
2622 /* on a call, all these values must be "locked" */
2623 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2624 if (ir_block_living_lock(self))
2627 /* call params are read operands too */
2628 for (p = 0; p < vec_size(instr->params); ++p)
2630 value = instr->params[p];
2631 if (!vec_ir_value_find(self->living, value, NULL))
2632 vec_push(self->living, value);
2633 /* reading adds the full vector */
2634 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2635 vec_push(self->living, value->memberof);
2636 for (mem = 0; mem < 3; ++mem) {
2637 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2638 vec_push(self->living, value->members[mem]);
2643 if (ir_block_living_add_instr(self, instr->eid))
2646 /* the "entry" instruction ID */
2647 if (ir_block_living_add_instr(self, self->entry_id))
2650 if (self->run_id == self->owner->run_id)
2653 self->run_id = self->owner->run_id;
2655 for (i = 0; i < vec_size(self->entries); ++i)
2657 ir_block *entry = self->entries[i];
2658 ir_block_life_propagate(entry, self, changed);
2664 /***********************************************************************
2667 * Since the IR has the convention of putting 'write' operands
2668 * at the beginning, we have to rotate the operands of instructions
2669 * properly in order to generate valid QCVM code.
2671 * Having destinations at a fixed position is more convenient. In QC
2672 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2673 * read from from OPA, and store to OPB rather than OPC. Which is
2674 * partially the reason why the implementation of these instructions
2675 * in darkplaces has been delayed for so long.
2677 * Breaking conventions is annoying...
2679 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2681 static bool gen_global_field(ir_value *global)
2683 if (global->hasvalue)
2685 ir_value *fld = global->constval.vpointer;
2687 irerror(global->context, "Invalid field constant with no field: %s", global->name);
2691 /* copy the field's value */
2692 ir_value_code_setaddr(global, vec_size(code_globals));
2693 vec_push(code_globals, fld->code.fieldaddr);
2694 if (global->fieldtype == TYPE_VECTOR) {
2695 vec_push(code_globals, fld->code.fieldaddr+1);
2696 vec_push(code_globals, fld->code.fieldaddr+2);
2701 ir_value_code_setaddr(global, vec_size(code_globals));
2702 vec_push(code_globals, 0);
2703 if (global->fieldtype == TYPE_VECTOR) {
2704 vec_push(code_globals, 0);
2705 vec_push(code_globals, 0);
2708 if (global->code.globaladdr < 0)
2713 static bool gen_global_pointer(ir_value *global)
2715 if (global->hasvalue)
2717 ir_value *target = global->constval.vpointer;
2719 irerror(global->context, "Invalid pointer constant: %s", global->name);
2720 /* NULL pointers are pointing to the NULL constant, which also
2721 * sits at address 0, but still has an ir_value for itself.
2726 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2727 * void() foo; <- proto
2728 * void() *fooptr = &foo;
2729 * void() foo = { code }
2731 if (!target->code.globaladdr) {
2732 /* FIXME: Check for the constant nullptr ir_value!
2733 * because then code.globaladdr being 0 is valid.
2735 irerror(global->context, "FIXME: Relocation support");
2739 ir_value_code_setaddr(global, vec_size(code_globals));
2740 vec_push(code_globals, target->code.globaladdr);
2744 ir_value_code_setaddr(global, vec_size(code_globals));
2745 vec_push(code_globals, 0);
2747 if (global->code.globaladdr < 0)
2752 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2754 prog_section_statement stmt;
2762 block->generated = true;
2763 block->code_start = vec_size(code_statements);
2764 for (i = 0; i < vec_size(block->instr); ++i)
2766 instr = block->instr[i];
2768 if (instr->opcode == VINSTR_PHI) {
2769 irerror(block->context, "cannot generate virtual instruction (phi)");
2773 if (instr->opcode == VINSTR_JUMP) {
2774 target = instr->bops[0];
2775 /* for uncoditional jumps, if the target hasn't been generated
2776 * yet, we generate them right here.
2778 if (!target->generated)
2779 return gen_blocks_recursive(func, target);
2781 /* otherwise we generate a jump instruction */
2782 stmt.opcode = INSTR_GOTO;
2783 stmt.o1.s1 = (target->code_start) - vec_size(code_statements);
2786 if (stmt.o1.s1 != 1)
2787 code_push_statement(&stmt, instr->context.line);
2789 /* no further instructions can be in this block */
2793 if (instr->opcode == VINSTR_COND) {
2794 ontrue = instr->bops[0];
2795 onfalse = instr->bops[1];
2796 /* TODO: have the AST signal which block should
2797 * come first: eg. optimize IFs without ELSE...
2800 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2804 if (ontrue->generated) {
2805 stmt.opcode = INSTR_IF;
2806 stmt.o2.s1 = (ontrue->code_start) - vec_size(code_statements);
2807 if (stmt.o2.s1 != 1)
2808 code_push_statement(&stmt, instr->context.line);
2810 if (onfalse->generated) {
2811 stmt.opcode = INSTR_IFNOT;
2812 stmt.o2.s1 = (onfalse->code_start) - vec_size(code_statements);
2813 if (stmt.o2.s1 != 1)
2814 code_push_statement(&stmt, instr->context.line);
2816 if (!ontrue->generated) {
2817 if (onfalse->generated)
2818 return gen_blocks_recursive(func, ontrue);
2820 if (!onfalse->generated) {
2821 if (ontrue->generated)
2822 return gen_blocks_recursive(func, onfalse);
2824 /* neither ontrue nor onfalse exist */
2825 stmt.opcode = INSTR_IFNOT;
2826 if (!instr->likely) {
2827 /* Honor the likelyhood hint */
2828 ir_block *tmp = onfalse;
2829 stmt.opcode = INSTR_IF;
2833 stidx = vec_size(code_statements);
2834 code_push_statement(&stmt, instr->context.line);
2835 /* on false we jump, so add ontrue-path */
2836 if (!gen_blocks_recursive(func, ontrue))
2838 /* fixup the jump address */
2839 code_statements[stidx].o2.s1 = vec_size(code_statements) - stidx;
2840 /* generate onfalse path */
2841 if (onfalse->generated) {
2842 /* fixup the jump address */
2843 code_statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2844 if (stidx+2 == vec_size(code_statements) && code_statements[stidx].o2.s1 == 1) {
2845 code_statements[stidx] = code_statements[stidx+1];
2846 if (code_statements[stidx].o1.s1 < 0)
2847 code_statements[stidx].o1.s1++;
2848 code_pop_statement();
2850 stmt.opcode = vec_last(code_statements).opcode;
2851 if (stmt.opcode == INSTR_GOTO ||
2852 stmt.opcode == INSTR_IF ||
2853 stmt.opcode == INSTR_IFNOT ||
2854 stmt.opcode == INSTR_RETURN ||
2855 stmt.opcode == INSTR_DONE)
2857 /* no use jumping from here */
2860 /* may have been generated in the previous recursive call */
2861 stmt.opcode = INSTR_GOTO;
2862 stmt.o1.s1 = (onfalse->code_start) - vec_size(code_statements);
2865 if (stmt.o1.s1 != 1)
2866 code_push_statement(&stmt, instr->context.line);
2869 else if (stidx+2 == vec_size(code_statements) && code_statements[stidx].o2.s1 == 1) {
2870 code_statements[stidx] = code_statements[stidx+1];
2871 if (code_statements[stidx].o1.s1 < 0)
2872 code_statements[stidx].o1.s1++;
2873 code_pop_statement();
2875 /* if not, generate now */
2876 return gen_blocks_recursive(func, onfalse);
2879 if ( (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8)
2880 || instr->opcode == VINSTR_NRCALL)
2885 first = vec_size(instr->params);
2888 for (p = 0; p < first; ++p)
2890 ir_value *param = instr->params[p];
2891 if (param->callparam)
2894 stmt.opcode = INSTR_STORE_F;
2897 if (param->vtype == TYPE_FIELD)
2898 stmt.opcode = field_store_instr[param->fieldtype];
2899 else if (param->vtype == TYPE_NIL)
2900 stmt.opcode = INSTR_STORE_V;
2902 stmt.opcode = type_store_instr[param->vtype];
2903 stmt.o1.u1 = ir_value_code_addr(param);
2904 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2905 code_push_statement(&stmt, instr->context.line);
2907 /* Now handle extparams */
2908 first = vec_size(instr->params);
2909 for (; p < first; ++p)
2911 ir_builder *ir = func->owner;
2912 ir_value *param = instr->params[p];
2913 ir_value *targetparam;
2915 if (param->callparam)
2918 if (p-8 >= vec_size(ir->extparams))
2919 ir_gen_extparam(ir);
2921 targetparam = ir->extparams[p-8];
2923 stmt.opcode = INSTR_STORE_F;
2926 if (param->vtype == TYPE_FIELD)
2927 stmt.opcode = field_store_instr[param->fieldtype];
2928 else if (param->vtype == TYPE_NIL)
2929 stmt.opcode = INSTR_STORE_V;
2931 stmt.opcode = type_store_instr[param->vtype];
2932 stmt.o1.u1 = ir_value_code_addr(param);
2933 stmt.o2.u1 = ir_value_code_addr(targetparam);
2934 code_push_statement(&stmt, instr->context.line);
2937 stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
2938 if (stmt.opcode > INSTR_CALL8)
2939 stmt.opcode = INSTR_CALL8;
2940 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2943 code_push_statement(&stmt, instr->context.line);
2945 retvalue = instr->_ops[0];
2946 if (retvalue && retvalue->store != store_return &&
2947 (retvalue->store == store_global || vec_size(retvalue->life)))
2949 /* not to be kept in OFS_RETURN */
2950 if (retvalue->vtype == TYPE_FIELD && OPTS_FLAG(ADJUST_VECTOR_FIELDS))
2951 stmt.opcode = field_store_instr[retvalue->fieldtype];
2953 stmt.opcode = type_store_instr[retvalue->vtype];
2954 stmt.o1.u1 = OFS_RETURN;
2955 stmt.o2.u1 = ir_value_code_addr(retvalue);
2957 code_push_statement(&stmt, instr->context.line);
2962 if (instr->opcode == INSTR_STATE) {
2963 irerror(block->context, "TODO: state instruction");
2967 stmt.opcode = instr->opcode;
2972 /* This is the general order of operands */
2974 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
2977 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2980 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
2982 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
2984 stmt.o1.u1 = stmt.o3.u1;
2987 else if ((stmt.opcode >= INSTR_STORE_F &&
2988 stmt.opcode <= INSTR_STORE_FNC) ||
2989 (stmt.opcode >= INSTR_STOREP_F &&
2990 stmt.opcode <= INSTR_STOREP_FNC))
2992 /* 2-operand instructions with A -> B */
2993 stmt.o2.u1 = stmt.o3.u1;
2996 /* tiny optimization, don't output
2999 if (stmt.o2.u1 == stmt.o1.u1 &&
3000 OPTS_OPTIMIZATION(OPTIM_PEEPHOLE))
3002 ++opts_optimizationcount[OPTIM_PEEPHOLE];
3007 code_push_statement(&stmt, instr->context.line);
3012 static bool gen_function_code(ir_function *self)
3015 prog_section_statement stmt, *retst;
3017 /* Starting from entry point, we generate blocks "as they come"
3018 * for now. Dead blocks will not be translated obviously.
3020 if (!vec_size(self->blocks)) {
3021 irerror(self->context, "Function '%s' declared without body.", self->name);
3025 block = self->blocks[0];
3026 if (block->generated)
3029 if (!gen_blocks_recursive(self, block)) {
3030 irerror(self->context, "failed to generate blocks for '%s'", self->name);
3034 /* code_write and qcvm -disasm need to know that the function ends here */
3035 retst = &vec_last(code_statements);
3036 if (OPTS_OPTIMIZATION(OPTIM_VOID_RETURN) &&
3037 self->outtype == TYPE_VOID &&
3038 retst->opcode == INSTR_RETURN &&
3039 !retst->o1.u1 && !retst->o2.u1 && !retst->o3.u1)
3041 retst->opcode = INSTR_DONE;
3042 ++opts_optimizationcount[OPTIM_VOID_RETURN];
3044 stmt.opcode = INSTR_DONE;
3048 code_push_statement(&stmt, vec_last(code_linenums));
3053 static qcint ir_builder_filestring(ir_builder *ir, const char *filename)
3055 /* NOTE: filename pointers are copied, we never strdup them,
3056 * thus we can use pointer-comparison to find the string.
3061 for (i = 0; i < vec_size(ir->filenames); ++i) {
3062 if (ir->filenames[i] == filename)
3063 return ir->filestrings[i];
3066 str = code_genstring(filename);
3067 vec_push(ir->filenames, filename);
3068 vec_push(ir->filestrings, str);
3072 static bool gen_global_function(ir_builder *ir, ir_value *global)
3074 prog_section_function fun;
3079 if (!global->hasvalue || (!global->constval.vfunc))
3081 irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
3085 irfun = global->constval.vfunc;
3087 fun.name = global->code.name;
3088 fun.file = ir_builder_filestring(ir, global->context.file);
3089 fun.profile = 0; /* always 0 */
3090 fun.nargs = vec_size(irfun->params);
3094 for (i = 0;i < 8; ++i) {
3095 if ((int32_t)i >= fun.nargs)
3098 fun.argsize[i] = type_sizeof_[irfun->params[i]];
3102 fun.locals = irfun->allocated_locals;
3105 fun.entry = irfun->builtin+1;
3107 irfun->code_function_def = vec_size(code_functions);
3108 fun.entry = vec_size(code_statements);
3111 vec_push(code_functions, fun);
3115 static ir_value* ir_gen_extparam_proto(ir_builder *ir)
3120 snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparam_protos)));
3121 global = ir_value_var(name, store_global, TYPE_VECTOR);
3123 vec_push(ir->extparam_protos, global);
3127 static void ir_gen_extparam(ir_builder *ir)
3129 prog_section_def def;
3132 if (vec_size(ir->extparam_protos) < vec_size(ir->extparams)+1)
3133 global = ir_gen_extparam_proto(ir);
3135 global = ir->extparam_protos[vec_size(ir->extparams)];
3137 def.name = code_genstring(global->name);
3138 def.type = TYPE_VECTOR;
3139 def.offset = vec_size(code_globals);
3141 vec_push(code_defs, def);
3142 ir_value_code_setaddr(global, def.offset);
3143 vec_push(code_globals, 0);
3144 vec_push(code_globals, 0);
3145 vec_push(code_globals, 0);
3147 vec_push(ir->extparams, global);
3150 static bool gen_function_extparam_copy(ir_function *self)
3152 size_t i, ext, numparams;
3154 ir_builder *ir = self->owner;
3156 prog_section_statement stmt;
3158 numparams = vec_size(self->params);
3162 stmt.opcode = INSTR_STORE_F;
3164 for (i = 8; i < numparams; ++i) {
3166 if (ext >= vec_size(ir->extparams))
3167 ir_gen_extparam(ir);
3169 ep = ir->extparams[ext];
3171 stmt.opcode = type_store_instr[self->locals[i]->vtype];
3172 if (self->locals[i]->vtype == TYPE_FIELD &&
3173 self->locals[i]->fieldtype == TYPE_VECTOR)
3175 stmt.opcode = INSTR_STORE_V;
3177 stmt.o1.u1 = ir_value_code_addr(ep);
3178 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3179 code_push_statement(&stmt, self->context.line);
3185 static bool gen_function_varargs_copy(ir_function *self)
3187 size_t i, ext, numparams, maxparams;
3189 ir_builder *ir = self->owner;
3191 prog_section_statement stmt;
3193 numparams = vec_size(self->params);
3197 stmt.opcode = INSTR_STORE_V;
3199 maxparams = numparams + self->max_varargs;
3200 for (i = numparams; i < maxparams; ++i) {
3202 stmt.o1.u1 = OFS_PARM0 + 3*i;
3203 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3204 code_push_statement(&stmt, self->context.line);
3208 if (ext >= vec_size(ir->extparams))
3209 ir_gen_extparam(ir);
3211 ep = ir->extparams[ext];
3213 stmt.o1.u1 = ir_value_code_addr(ep);
3214 stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3215 code_push_statement(&stmt, self->context.line);
3221 static bool gen_function_locals(ir_builder *ir, ir_value *global)
3223 prog_section_function *def;
3226 uint32_t firstlocal, firstglobal;
3228 irfun = global->constval.vfunc;
3229 def = code_functions + irfun->code_function_def;
3231 if (OPTS_OPTION_BOOL(OPTION_G) ||
3232 !OPTS_OPTIMIZATION(OPTIM_OVERLAP_LOCALS) ||
3233 (irfun->flags & IR_FLAG_MASK_NO_OVERLAP))
3235 firstlocal = def->firstlocal = vec_size(code_globals);
3237 firstlocal = def->firstlocal = ir->first_common_local;
3238 ++opts_optimizationcount[OPTIM_OVERLAP_LOCALS];
3241 firstglobal = (OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS) ? ir->first_common_globaltemp : firstlocal);
3243 for (i = vec_size(code_globals); i < firstlocal + irfun->allocated_locals; ++i)
3244 vec_push(code_globals, 0);
3245 for (i = 0; i < vec_size(irfun->locals); ++i) {
3246 ir_value *v = irfun->locals[i];
3247 if (v->locked || !OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS)) {
3248 ir_value_code_setaddr(v, firstlocal + v->code.local);
3249 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3250 irerror(irfun->locals[i]->context, "failed to generate local %s", irfun->locals[i]->name);
3255 ir_value_code_setaddr(v, firstglobal + v->code.local);
3257 for (i = 0; i < vec_size(irfun->values); ++i)
3259 ir_value *v = irfun->values[i];
3263 ir_value_code_setaddr(v, firstlocal + v->code.local);
3265 ir_value_code_setaddr(v, firstglobal + v->code.local);
3270 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
3272 prog_section_function *fundef;
3277 irfun = global->constval.vfunc;
3279 if (global->cvq == CV_NONE) {
3280 irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
3281 "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
3283 /* this was a function pointer, don't generate code for those */
3290 if (irfun->code_function_def < 0) {
3291 irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
3294 fundef = &code_functions[irfun->code_function_def];
3296 fundef->entry = vec_size(code_statements);
3297 if (!gen_function_locals(ir, global)) {
3298 irerror(irfun->context, "Failed to generate locals for function %s", irfun->name);
3301 if (!gen_function_extparam_copy(irfun)) {
3302 irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
3305 if (irfun->max_varargs && !gen_function_varargs_copy(irfun)) {
3306 irerror(irfun->context, "Failed to generate vararg-copy code for function %s", irfun->name);
3309 if (!gen_function_code(irfun)) {
3310 irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
3316 static void gen_vector_defs(prog_section_def def, const char *name)
3321 if (!name || name[0] == '#' || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3324 def.type = TYPE_FLOAT;
3328 component = (char*)mem_a(len+3);
3329 memcpy(component, name, len);
3331 component[len-0] = 0;
3332 component[len-2] = '_';
3334 component[len-1] = 'x';
3336 for (i = 0; i < 3; ++i) {
3337 def.name = code_genstring(component);
3338 vec_push(code_defs, def);
3344 static void gen_vector_fields(prog_section_field fld, const char *name)
3349 if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3352 fld.type = TYPE_FLOAT;
3356 component = (char*)mem_a(len+3);
3357 memcpy(component, name, len);
3359 component[len-0] = 0;
3360 component[len-2] = '_';
3362 component[len-1] = 'x';
3364 for (i = 0; i < 3; ++i) {
3365 fld.name = code_genstring(component);
3366 vec_push(code_fields, fld);
3372 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
3376 prog_section_def def;
3377 bool pushdef = false;
3379 def.type = global->vtype;
3380 def.offset = vec_size(code_globals);
3382 if (OPTS_OPTION_BOOL(OPTION_G) || !islocal)
3386 if (OPTS_OPTIMIZATION(OPTIM_STRIP_CONSTANT_NAMES) &&
3387 !(global->flags & IR_FLAG_INCLUDE_DEF) &&
3388 (global->name[0] == '#' || global->cvq == CV_CONST))
3393 if (pushdef && global->name) {
3394 if (global->name[0] == '#') {
3395 if (!self->str_immediate)
3396 self->str_immediate = code_genstring("IMMEDIATE");
3397 def.name = global->code.name = self->str_immediate;
3400 def.name = global->code.name = code_genstring(global->name);
3405 def.offset = ir_value_code_addr(global);
3406 vec_push(code_defs, def);
3407 if (global->vtype == TYPE_VECTOR)
3408 gen_vector_defs(def, global->name);
3409 else if (global->vtype == TYPE_FIELD && global->fieldtype == TYPE_VECTOR)
3410 gen_vector_defs(def, global->name);
3417 switch (global->vtype)
3420 if (!strcmp(global->name, "end_sys_globals")) {
3421 /* TODO: remember this point... all the defs before this one
3422 * should be checksummed and added to progdefs.h when we generate it.
3425 else if (!strcmp(global->name, "end_sys_fields")) {
3426 /* TODO: same as above but for entity-fields rather than globsl
3430 irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
3432 /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
3433 * the system fields actually go? Though the engine knows this anyway...
3434 * Maybe this could be an -foption
3435 * fteqcc creates data for end_sys_* - of size 1, so let's do the same
3437 ir_value_code_setaddr(global, vec_size(code_globals));
3438 vec_push(code_globals, 0);
3440 if (pushdef) vec_push(code_defs, def);
3443 if (pushdef) vec_push(code_defs, def);
3444 return gen_global_pointer(global);
3447 vec_push(code_defs, def);
3448 if (global->fieldtype == TYPE_VECTOR)
3449 gen_vector_defs(def, global->name);
3451 return gen_global_field(global);
3456 ir_value_code_setaddr(global, vec_size(code_globals));
3457 if (global->hasvalue) {
3458 iptr = (int32_t*)&global->constval.ivec[0];
3459 vec_push(code_globals, *iptr);
3461 vec_push(code_globals, 0);
3463 if (!islocal && global->cvq != CV_CONST)
3464 def.type |= DEF_SAVEGLOBAL;
3465 if (pushdef) vec_push(code_defs, def);
3467 return global->code.globaladdr >= 0;
3471 ir_value_code_setaddr(global, vec_size(code_globals));
3472 if (global->hasvalue) {
3473 vec_push(code_globals, code_genstring(global->constval.vstring));
3475 vec_push(code_globals, 0);
3477 if (!islocal && global->cvq != CV_CONST)
3478 def.type |= DEF_SAVEGLOBAL;
3479 if (pushdef) vec_push(code_defs, def);
3480 return global->code.globaladdr >= 0;
3485 ir_value_code_setaddr(global, vec_size(code_globals));
3486 if (global->hasvalue) {
3487 iptr = (int32_t*)&global->constval.ivec[0];
3488 vec_push(code_globals, iptr[0]);
3489 if (global->code.globaladdr < 0)
3491 for (d = 1; d < type_sizeof_[global->vtype]; ++d) {
3492 vec_push(code_globals, iptr[d]);
3495 vec_push(code_globals, 0);
3496 if (global->code.globaladdr < 0)
3498 for (d = 1; d < type_sizeof_[global->vtype]; ++d) {
3499 vec_push(code_globals, 0);
3502 if (!islocal && global->cvq != CV_CONST)
3503 def.type |= DEF_SAVEGLOBAL;
3506 vec_push(code_defs, def);
3507 def.type &= ~DEF_SAVEGLOBAL;
3508 gen_vector_defs(def, global->name);
3510 return global->code.globaladdr >= 0;
3513 ir_value_code_setaddr(global, vec_size(code_globals));
3514 if (!global->hasvalue) {
3515 vec_push(code_globals, 0);
3516 if (global->code.globaladdr < 0)
3519 vec_push(code_globals, vec_size(code_functions));
3520 if (!gen_global_function(self, global))
3523 if (!islocal && global->cvq != CV_CONST)
3524 def.type |= DEF_SAVEGLOBAL;
3525 if (pushdef) vec_push(code_defs, def);
3528 /* assume biggest type */
3529 ir_value_code_setaddr(global, vec_size(code_globals));
3530 vec_push(code_globals, 0);
3531 for (i = 1; i < type_sizeof_[TYPE_VARIANT]; ++i)
3532 vec_push(code_globals, 0);
3535 /* refuse to create 'void' type or any other fancy business. */
3536 irerror(global->context, "Invalid type for global variable `%s`: %s",
3537 global->name, type_name[global->vtype]);
3542 static void ir_builder_prepare_field(ir_value *field)
3544 field->code.fieldaddr = code_alloc_field(type_sizeof_[field->fieldtype]);
3547 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
3549 prog_section_def def;
3550 prog_section_field fld;
3554 def.type = (uint16_t)field->vtype;
3555 def.offset = (uint16_t)vec_size(code_globals);
3557 /* create a global named the same as the field */
3558 if (OPTS_OPTION_U32(OPTION_STANDARD) == COMPILER_GMQCC) {
3559 /* in our standard, the global gets a dot prefix */
3560 size_t len = strlen(field->name);
3563 /* we really don't want to have to allocate this, and 1024
3564 * bytes is more than enough for a variable/field name
3566 if (len+2 >= sizeof(name)) {
3567 irerror(field->context, "invalid field name size: %u", (unsigned int)len);
3572 memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
3575 def.name = code_genstring(name);
3576 fld.name = def.name + 1; /* we reuse that string table entry */
3578 /* in plain QC, there cannot be a global with the same name,
3579 * and so we also name the global the same.
3580 * FIXME: fteqcc should create a global as well
3581 * check if it actually uses the same name. Probably does
3583 def.name = code_genstring(field->name);
3584 fld.name = def.name;
3587 field->code.name = def.name;
3589 vec_push(code_defs, def);
3591 fld.type = field->fieldtype;
3593 if (fld.type == TYPE_VOID) {
3594 irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3598 fld.offset = field->code.fieldaddr;
3600 vec_push(code_fields, fld);
3602 ir_value_code_setaddr(field, vec_size(code_globals));
3603 vec_push(code_globals, fld.offset);
3604 if (fld.type == TYPE_VECTOR) {
3605 vec_push(code_globals, fld.offset+1);
3606 vec_push(code_globals, fld.offset+2);
3609 if (field->fieldtype == TYPE_VECTOR) {
3610 gen_vector_defs(def, field->name);
3611 gen_vector_fields(fld, field->name);
3614 return field->code.globaladdr >= 0;
3617 bool ir_builder_generate(ir_builder *self, const char *filename)
3619 prog_section_statement stmt;
3621 char *lnofile = NULL;
3625 for (i = 0; i < vec_size(self->fields); ++i)
3627 ir_builder_prepare_field(self->fields[i]);
3630 for (i = 0; i < vec_size(self->globals); ++i)
3632 if (!ir_builder_gen_global(self, self->globals[i], false)) {
3635 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3636 ir_function *func = self->globals[i]->constval.vfunc;
3637 if (func && self->max_locals < func->allocated_locals &&
3638 !(func->flags & IR_FLAG_MASK_NO_OVERLAP))
3640 self->max_locals = func->allocated_locals;
3642 if (func && self->max_globaltemps < func->globaltemps)
3643 self->max_globaltemps = func->globaltemps;
3647 for (i = 0; i < vec_size(self->fields); ++i)
3649 if (!ir_builder_gen_field(self, self->fields[i])) {
3655 ir_value_code_setaddr(self->nil, vec_size(code_globals));
3656 vec_push(code_globals, 0);
3657 vec_push(code_globals, 0);
3658 vec_push(code_globals, 0);
3660 /* generate global temps */
3661 self->first_common_globaltemp = vec_size(code_globals);
3662 for (i = 0; i < self->max_globaltemps; ++i) {
3663 vec_push(code_globals, 0);
3665 /* generate common locals */
3666 self->first_common_local = vec_size(code_globals);
3667 for (i = 0; i < self->max_locals; ++i) {
3668 vec_push(code_globals, 0);
3671 /* generate function code */
3672 for (i = 0; i < vec_size(self->globals); ++i)
3674 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3675 if (!gen_global_function_code(self, self->globals[i])) {
3681 if (vec_size(code_globals) >= 65536) {
3682 irerror(vec_last(self->globals)->context, "This progs file would require more globals than the metadata can handle. Bailing out.");
3686 /* DP errors if the last instruction is not an INSTR_DONE. */
3687 if (vec_last(code_statements).opcode != INSTR_DONE)
3689 stmt.opcode = INSTR_DONE;
3693 code_push_statement(&stmt, vec_last(code_linenums));
3696 if (OPTS_OPTION_BOOL(OPTION_PP_ONLY))
3699 if (vec_size(code_statements) != vec_size(code_linenums)) {
3700 con_err("Linecounter wrong: %lu != %lu\n",
3701 (unsigned long)vec_size(code_statements),
3702 (unsigned long)vec_size(code_linenums));
3703 } else if (OPTS_FLAG(LNO)) {
3705 size_t filelen = strlen(filename);
3707 memcpy(vec_add(lnofile, filelen+1), filename, filelen+1);
3708 dot = strrchr(lnofile, '.');
3712 vec_shrinkto(lnofile, dot - lnofile);
3714 memcpy(vec_add(lnofile, 5), ".lno", 5);
3717 if (!OPTS_OPTION_BOOL(OPTION_QUIET)) {
3719 con_out("writing '%s' and '%s'...\n", filename, lnofile);
3721 con_out("writing '%s'\n", filename);
3723 if (!code_write(filename, lnofile)) {
3731 /***********************************************************************
3732 *IR DEBUG Dump functions...
3735 #define IND_BUFSZ 1024
3738 # define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
3741 const char *qc_opname(int op)
3743 if (op < 0) return "<INVALID>";
3744 if (op < (int)( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
3745 return asm_instr[op].m;
3747 case VINSTR_PHI: return "PHI";
3748 case VINSTR_JUMP: return "JUMP";
3749 case VINSTR_COND: return "COND";
3750 default: return "<UNK>";
3754 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
3757 char indent[IND_BUFSZ];
3761 oprintf("module %s\n", b->name);
3762 for (i = 0; i < vec_size(b->globals); ++i)
3765 if (b->globals[i]->hasvalue)
3766 oprintf("%s = ", b->globals[i]->name);
3767 ir_value_dump(b->globals[i], oprintf);
3770 for (i = 0; i < vec_size(b->functions); ++i)
3771 ir_function_dump(b->functions[i], indent, oprintf);
3772 oprintf("endmodule %s\n", b->name);
3775 static const char *storenames[] = {
3776 "[global]", "[local]", "[param]", "[value]", "[return]"
3779 void ir_function_dump(ir_function *f, char *ind,
3780 int (*oprintf)(const char*, ...))
3783 if (f->builtin != 0) {
3784 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
3787 oprintf("%sfunction %s\n", ind, f->name);
3788 strncat(ind, "\t", IND_BUFSZ);
3789 if (vec_size(f->locals))
3791 oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
3792 for (i = 0; i < vec_size(f->locals); ++i) {
3793 oprintf("%s\t", ind);
3794 ir_value_dump(f->locals[i], oprintf);
3798 oprintf("%sliferanges:\n", ind);
3799 for (i = 0; i < vec_size(f->locals); ++i) {
3800 const char *attr = "";
3802 ir_value *v = f->locals[i];
3803 if (v->unique_life && v->locked)
3804 attr = "unique,locked ";
3805 else if (v->unique_life)
3809 oprintf("%s\t%s: %s %s %s%s@%i ", ind, v->name, type_name[v->vtype],
3810 storenames[v->store],
3811 attr, (v->callparam ? "callparam " : ""),
3812 (int)v->code.local);
3815 for (l = 0; l < vec_size(v->life); ++l) {
3816 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3819 for (m = 0; m < 3; ++m) {
3820 ir_value *vm = v->members[m];
3823 oprintf("%s\t%s: @%i ", ind, vm->name, (int)vm->code.local);
3824 for (l = 0; l < vec_size(vm->life); ++l) {
3825 oprintf("[%i,%i] ", vm->life[l].start, vm->life[l].end);
3830 for (i = 0; i < vec_size(f->values); ++i) {
3831 const char *attr = "";
3833 ir_value *v = f->values[i];
3834 if (v->unique_life && v->locked)
3835 attr = "unique,locked ";
3836 else if (v->unique_life)
3840 oprintf("%s\t%s: %s %s %s%s@%i ", ind, v->name, type_name[v->vtype],
3841 storenames[v->store],
3842 attr, (v->callparam ? "callparam " : ""),
3843 (int)v->code.local);
3846 for (l = 0; l < vec_size(v->life); ++l) {
3847 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3850 for (m = 0; m < 3; ++m) {
3851 ir_value *vm = v->members[m];
3854 if (vm->unique_life && vm->locked)
3855 attr = "unique,locked ";
3856 else if (vm->unique_life)
3858 else if (vm->locked)
3860 oprintf("%s\t%s: %s@%i ", ind, vm->name, attr, (int)vm->code.local);
3861 for (l = 0; l < vec_size(vm->life); ++l) {
3862 oprintf("[%i,%i] ", vm->life[l].start, vm->life[l].end);
3867 if (vec_size(f->blocks))
3869 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
3870 for (i = 0; i < vec_size(f->blocks); ++i) {
3871 if (f->blocks[i]->run_id != f->run_id) {
3872 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
3874 ir_block_dump(f->blocks[i], ind, oprintf);
3878 ind[strlen(ind)-1] = 0;
3879 oprintf("%sendfunction %s\n", ind, f->name);
3882 void ir_block_dump(ir_block* b, char *ind,
3883 int (*oprintf)(const char*, ...))
3886 oprintf("%s:%s\n", ind, b->label);
3887 strncat(ind, "\t", IND_BUFSZ);
3889 if (b->instr && b->instr[0])
3890 oprintf("%s (%i) [entry]\n", ind, (int)(b->instr[0]->eid-1));
3891 for (i = 0; i < vec_size(b->instr); ++i)
3892 ir_instr_dump(b->instr[i], ind, oprintf);
3893 ind[strlen(ind)-1] = 0;
3896 void dump_phi(ir_instr *in, int (*oprintf)(const char*, ...))
3899 oprintf("%s <- phi ", in->_ops[0]->name);
3900 for (i = 0; i < vec_size(in->phi); ++i)
3902 oprintf("([%s] : %s) ", in->phi[i].from->label,
3903 in->phi[i].value->name);
3908 void ir_instr_dump(ir_instr *in, char *ind,
3909 int (*oprintf)(const char*, ...))
3912 const char *comma = NULL;
3914 oprintf("%s (%i) ", ind, (int)in->eid);
3916 if (in->opcode == VINSTR_PHI) {
3917 dump_phi(in, oprintf);
3921 strncat(ind, "\t", IND_BUFSZ);
3923 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
3924 ir_value_dump(in->_ops[0], oprintf);
3925 if (in->_ops[1] || in->_ops[2])
3928 if (in->opcode == INSTR_CALL0 || in->opcode == VINSTR_NRCALL) {
3929 oprintf("CALL%i\t", vec_size(in->params));
3931 oprintf("%s\t", qc_opname(in->opcode));
3933 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
3934 ir_value_dump(in->_ops[0], oprintf);
3939 for (i = 1; i != 3; ++i) {
3943 ir_value_dump(in->_ops[i], oprintf);
3951 oprintf("[%s]", in->bops[0]->label);
3955 oprintf("%s[%s]", comma, in->bops[1]->label);
3956 if (vec_size(in->params)) {
3957 oprintf("\tparams: ");
3958 for (i = 0; i != vec_size(in->params); ++i) {
3959 oprintf("%s, ", in->params[i]->name);
3963 ind[strlen(ind)-1] = 0;
3966 void ir_value_dump_string(const char *str, int (*oprintf)(const char*, ...))
3969 for (; *str; ++str) {
3971 case '\n': oprintf("\\n"); break;
3972 case '\r': oprintf("\\r"); break;
3973 case '\t': oprintf("\\t"); break;
3974 case '\v': oprintf("\\v"); break;
3975 case '\f': oprintf("\\f"); break;
3976 case '\b': oprintf("\\b"); break;
3977 case '\a': oprintf("\\a"); break;
3978 case '\\': oprintf("\\\\"); break;
3979 case '"': oprintf("\\\""); break;
3980 default: oprintf("%c", *str); break;
3986 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
3995 oprintf("fn:%s", v->name);
3998 oprintf("%g", v->constval.vfloat);
4001 oprintf("'%g %g %g'",
4004 v->constval.vvec.z);
4007 oprintf("(entity)");
4010 ir_value_dump_string(v->constval.vstring, oprintf);
4014 oprintf("%i", v->constval.vint);
4019 v->constval.vpointer->name);
4023 oprintf("%s", v->name);
4027 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
4030 oprintf("Life of %12s:", self->name);
4031 for (i = 0; i < vec_size(self->life); ++i)
4033 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);