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] = {
50 size_t type_sizeof_[TYPE_COUNT] = {
57 1, /* TYPE_FUNCTION */
67 uint16_t type_store_instr[TYPE_COUNT] = {
68 INSTR_STORE_F, /* should use I when having integer support */
75 INSTR_STORE_ENT, /* should use I */
77 INSTR_STORE_I, /* integer type */
82 INSTR_STORE_V, /* variant, should never be accessed */
84 AINSTR_END, /* struct */
85 AINSTR_END, /* union */
86 AINSTR_END, /* array */
90 uint16_t field_store_instr[TYPE_COUNT] = {
100 INSTR_STORE_FLD, /* integer type */
105 INSTR_STORE_V, /* variant, should never be accessed */
107 AINSTR_END, /* struct */
108 AINSTR_END, /* union */
109 AINSTR_END, /* array */
110 AINSTR_END, /* nil */
113 uint16_t type_storep_instr[TYPE_COUNT] = {
114 INSTR_STOREP_F, /* should use I when having integer support */
121 INSTR_STOREP_ENT, /* should use I */
123 INSTR_STOREP_ENT, /* integer type */
128 INSTR_STOREP_V, /* variant, should never be accessed */
130 AINSTR_END, /* struct */
131 AINSTR_END, /* union */
132 AINSTR_END, /* array */
133 AINSTR_END, /* nil */
136 uint16_t type_eq_instr[TYPE_COUNT] = {
137 INSTR_EQ_F, /* should use I when having integer support */
142 INSTR_EQ_E, /* FLD has no comparison */
144 INSTR_EQ_E, /* should use I */
151 INSTR_EQ_V, /* variant, should never be accessed */
153 AINSTR_END, /* struct */
154 AINSTR_END, /* union */
155 AINSTR_END, /* array */
156 AINSTR_END, /* nil */
159 uint16_t type_ne_instr[TYPE_COUNT] = {
160 INSTR_NE_F, /* should use I when having integer support */
165 INSTR_NE_E, /* FLD has no comparison */
167 INSTR_NE_E, /* should use I */
174 INSTR_NE_V, /* variant, should never be accessed */
176 AINSTR_END, /* struct */
177 AINSTR_END, /* union */
178 AINSTR_END, /* array */
179 AINSTR_END, /* nil */
182 uint16_t type_not_instr[TYPE_COUNT] = {
183 INSTR_NOT_F, /* should use I when having integer support */
190 INSTR_NOT_ENT, /* should use I */
192 INSTR_NOT_I, /* integer type */
197 INSTR_NOT_V, /* variant, should never be accessed */
199 AINSTR_END, /* struct */
200 AINSTR_END, /* union */
201 AINSTR_END, /* array */
202 AINSTR_END, /* nil */
206 static ir_value* ir_gen_extparam_proto(ir_builder *ir);
207 static void ir_gen_extparam (ir_builder *ir);
209 /* error functions */
211 static void irerror(lex_ctx ctx, const char *msg, ...)
215 con_cvprintmsg((void*)&ctx, LVL_ERROR, "internal error", msg, ap);
219 static bool irwarning(lex_ctx ctx, int warntype, const char *fmt, ...)
224 r = vcompile_warning(ctx, warntype, fmt, ap);
229 /***********************************************************************
230 * Vector utility functions
233 bool GMQCC_WARN vec_ir_value_find(ir_value **vec, const ir_value *what, size_t *idx)
236 size_t len = vec_size(vec);
237 for (i = 0; i < len; ++i) {
238 if (vec[i] == what) {
246 bool GMQCC_WARN vec_ir_block_find(ir_block **vec, ir_block *what, size_t *idx)
249 size_t len = vec_size(vec);
250 for (i = 0; i < len; ++i) {
251 if (vec[i] == what) {
259 bool GMQCC_WARN vec_ir_instr_find(ir_instr **vec, ir_instr *what, size_t *idx)
262 size_t len = vec_size(vec);
263 for (i = 0; i < len; ++i) {
264 if (vec[i] == what) {
272 /***********************************************************************
276 static void ir_block_delete_quick(ir_block* self);
277 static void ir_instr_delete_quick(ir_instr *self);
278 static void ir_function_delete_quick(ir_function *self);
280 ir_builder* ir_builder_new(const char *modulename)
284 self = (ir_builder*)mem_a(sizeof(*self));
288 self->functions = NULL;
289 self->globals = NULL;
291 self->filenames = NULL;
292 self->filestrings = NULL;
293 self->htglobals = util_htnew(IR_HT_SIZE);
294 self->htfields = util_htnew(IR_HT_SIZE);
295 self->htfunctions = util_htnew(IR_HT_SIZE);
297 self->extparams = NULL;
298 self->extparam_protos = NULL;
300 self->first_common_globaltemp = 0;
301 self->max_globaltemps = 0;
302 self->first_common_local = 0;
303 self->max_locals = 0;
305 self->str_immediate = 0;
307 if (!ir_builder_set_name(self, modulename)) {
312 self->nil = ir_value_var("nil", store_value, TYPE_NIL);
313 self->nil->cvq = CV_CONST;
318 void ir_builder_delete(ir_builder* self)
321 util_htdel(self->htglobals);
322 util_htdel(self->htfields);
323 util_htdel(self->htfunctions);
324 mem_d((void*)self->name);
325 for (i = 0; i != vec_size(self->functions); ++i) {
326 ir_function_delete_quick(self->functions[i]);
328 vec_free(self->functions);
329 for (i = 0; i != vec_size(self->extparams); ++i) {
330 ir_value_delete(self->extparams[i]);
332 vec_free(self->extparams);
333 for (i = 0; i != vec_size(self->globals); ++i) {
334 ir_value_delete(self->globals[i]);
336 vec_free(self->globals);
337 for (i = 0; i != vec_size(self->fields); ++i) {
338 ir_value_delete(self->fields[i]);
340 ir_value_delete(self->nil);
341 vec_free(self->fields);
342 vec_free(self->filenames);
343 vec_free(self->filestrings);
347 bool ir_builder_set_name(ir_builder *self, const char *name)
350 mem_d((void*)self->name);
351 self->name = util_strdup(name);
355 ir_function* ir_builder_get_function(ir_builder *self, const char *name)
357 return (ir_function*)util_htget(self->htfunctions, name);
360 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
362 ir_function *fn = ir_builder_get_function(self, name);
367 fn = ir_function_new(self, outtype);
368 if (!ir_function_set_name(fn, name))
370 ir_function_delete(fn);
373 vec_push(self->functions, fn);
374 util_htset(self->htfunctions, name, fn);
376 fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
378 ir_function_delete(fn);
382 fn->value->hasvalue = true;
383 fn->value->outtype = outtype;
384 fn->value->constval.vfunc = fn;
385 fn->value->context = fn->context;
390 ir_value* ir_builder_get_global(ir_builder *self, const char *name)
392 return (ir_value*)util_htget(self->htglobals, name);
395 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
399 if (name && name[0] != '#')
401 ve = ir_builder_get_global(self, name);
407 ve = ir_value_var(name, store_global, vtype);
408 vec_push(self->globals, ve);
409 util_htset(self->htglobals, name, ve);
413 ir_value* ir_builder_get_field(ir_builder *self, const char *name)
415 return (ir_value*)util_htget(self->htfields, name);
419 ir_value* ir_builder_create_field(ir_builder *self, const char *name, int vtype)
421 ir_value *ve = ir_builder_get_field(self, name);
426 ve = ir_value_var(name, store_global, TYPE_FIELD);
427 ve->fieldtype = vtype;
428 vec_push(self->fields, ve);
429 util_htset(self->htfields, name, ve);
433 /***********************************************************************
437 bool ir_function_naive_phi(ir_function*);
438 void ir_function_enumerate(ir_function*);
439 bool ir_function_calculate_liferanges(ir_function*);
440 bool ir_function_allocate_locals(ir_function*);
442 ir_function* ir_function_new(ir_builder* owner, int outtype)
445 self = (ir_function*)mem_a(sizeof(*self));
450 memset(self, 0, sizeof(*self));
453 if (!ir_function_set_name(self, "<@unnamed>")) {
460 self->context.file = "<@no context>";
461 self->context.line = 0;
462 self->outtype = outtype;
471 self->code_function_def = -1;
472 self->allocated_locals = 0;
473 self->globaltemps = 0;
479 bool ir_function_set_name(ir_function *self, const char *name)
482 mem_d((void*)self->name);
483 self->name = util_strdup(name);
487 static void ir_function_delete_quick(ir_function *self)
490 mem_d((void*)self->name);
492 for (i = 0; i != vec_size(self->blocks); ++i)
493 ir_block_delete_quick(self->blocks[i]);
494 vec_free(self->blocks);
496 vec_free(self->params);
498 for (i = 0; i != vec_size(self->values); ++i)
499 ir_value_delete(self->values[i]);
500 vec_free(self->values);
502 for (i = 0; i != vec_size(self->locals); ++i)
503 ir_value_delete(self->locals[i]);
504 vec_free(self->locals);
506 /* self->value is deleted by the builder */
511 void ir_function_delete(ir_function *self)
514 mem_d((void*)self->name);
516 for (i = 0; i != vec_size(self->blocks); ++i)
517 ir_block_delete(self->blocks[i]);
518 vec_free(self->blocks);
520 vec_free(self->params);
522 for (i = 0; i != vec_size(self->values); ++i)
523 ir_value_delete(self->values[i]);
524 vec_free(self->values);
526 for (i = 0; i != vec_size(self->locals); ++i)
527 ir_value_delete(self->locals[i]);
528 vec_free(self->locals);
530 /* self->value is deleted by the builder */
535 void ir_function_collect_value(ir_function *self, ir_value *v)
537 vec_push(self->values, v);
540 ir_block* ir_function_create_block(lex_ctx ctx, ir_function *self, const char *label)
542 ir_block* bn = ir_block_new(self, label);
544 vec_push(self->blocks, bn);
548 static bool instr_is_operation(uint16_t op)
550 return ( (op >= INSTR_MUL_F && op <= INSTR_GT) ||
551 (op >= INSTR_LOAD_F && op <= INSTR_LOAD_FNC) ||
552 (op == INSTR_ADDRESS) ||
553 (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) ||
554 (op >= INSTR_AND && op <= INSTR_BITOR) ||
555 (op >= INSTR_CALL0 && op <= INSTR_CALL8) );
558 bool ir_function_pass_peephole(ir_function *self)
562 for (b = 0; b < vec_size(self->blocks); ++b) {
564 ir_block *block = self->blocks[b];
566 for (i = 0; i < vec_size(block->instr); ++i) {
568 inst = block->instr[i];
571 (inst->opcode >= INSTR_STORE_F &&
572 inst->opcode <= INSTR_STORE_FNC))
580 oper = block->instr[i-1];
581 if (!instr_is_operation(oper->opcode))
584 value = oper->_ops[0];
586 /* only do it for SSA values */
587 if (value->store != store_value)
590 /* don't optimize out the temp if it's used later again */
591 if (vec_size(value->reads) != 1)
594 /* The very next store must use this value */
595 if (value->reads[0] != store)
598 /* And of course the store must _read_ from it, so it's in
600 if (store->_ops[1] != value)
603 ++opts_optimizationcount[OPTIM_PEEPHOLE];
604 (void)!ir_instr_op(oper, 0, store->_ops[0], true);
606 vec_remove(block->instr, i, 1);
607 ir_instr_delete(store);
609 else if (inst->opcode == VINSTR_COND)
611 /* COND on a value resulting from a NOT could
612 * remove the NOT and swap its operands
619 value = inst->_ops[0];
621 if (value->store != store_value ||
622 vec_size(value->reads) != 1 ||
623 value->reads[0] != inst)
628 inot = value->writes[0];
629 if (inot->_ops[0] != value ||
630 inot->opcode < INSTR_NOT_F ||
631 inot->opcode > INSTR_NOT_FNC ||
632 inot->opcode == INSTR_NOT_V || /* can't do these */
633 inot->opcode == INSTR_NOT_S)
639 ++opts_optimizationcount[OPTIM_PEEPHOLE];
641 (void)!ir_instr_op(inst, 0, inot->_ops[1], false);
644 for (inotid = 0; inotid < vec_size(tmp->instr); ++inotid) {
645 if (tmp->instr[inotid] == inot)
648 if (inotid >= vec_size(tmp->instr)) {
649 compile_error(inst->context, "sanity-check failed: failed to find instruction to optimize out");
652 vec_remove(tmp->instr, inotid, 1);
653 ir_instr_delete(inot);
654 /* swap ontrue/onfalse */
656 inst->bops[0] = inst->bops[1];
667 bool ir_function_pass_tailrecursion(ir_function *self)
671 for (b = 0; b < vec_size(self->blocks); ++b) {
673 ir_instr *ret, *call, *store = NULL;
674 ir_block *block = self->blocks[b];
676 if (!block->final || vec_size(block->instr) < 2)
679 ret = block->instr[vec_size(block->instr)-1];
680 if (ret->opcode != INSTR_DONE && ret->opcode != INSTR_RETURN)
683 call = block->instr[vec_size(block->instr)-2];
684 if (call->opcode >= INSTR_STORE_F && call->opcode <= INSTR_STORE_FNC) {
685 /* account for the unoptimized
687 * STORE %return, %tmp
691 if (vec_size(block->instr) < 3)
695 call = block->instr[vec_size(block->instr)-3];
698 if (call->opcode < INSTR_CALL0 || call->opcode > INSTR_CALL8)
702 /* optimize out the STORE */
704 ret->_ops[0] == store->_ops[0] &&
705 store->_ops[1] == call->_ops[0])
707 ++opts_optimizationcount[OPTIM_PEEPHOLE];
708 call->_ops[0] = store->_ops[0];
709 vec_remove(block->instr, vec_size(block->instr) - 2, 1);
710 ir_instr_delete(store);
719 funcval = call->_ops[1];
722 if (funcval->vtype != TYPE_FUNCTION || funcval->constval.vfunc != self)
725 /* now we have a CALL and a RET, check if it's a tailcall */
726 if (ret->_ops[0] && call->_ops[0] != ret->_ops[0])
729 ++opts_optimizationcount[OPTIM_TAIL_RECURSION];
730 vec_shrinkby(block->instr, 2);
732 block->final = false; /* open it back up */
734 /* emite parameter-stores */
735 for (p = 0; p < vec_size(call->params); ++p) {
736 /* assert(call->params_count <= self->locals_count); */
737 if (!ir_block_create_store(block, call->context, self->locals[p], call->params[p])) {
738 irerror(call->context, "failed to create tailcall store instruction for parameter %i", (int)p);
742 if (!ir_block_create_jump(block, call->context, self->blocks[0])) {
743 irerror(call->context, "failed to create tailcall jump");
747 ir_instr_delete(call);
748 ir_instr_delete(ret);
754 bool ir_function_finalize(ir_function *self)
761 if (OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
762 if (!ir_function_pass_peephole(self)) {
763 irerror(self->context, "generic optimization pass broke something in `%s`", self->name);
768 if (OPTS_OPTIMIZATION(OPTIM_TAIL_RECURSION)) {
769 if (!ir_function_pass_tailrecursion(self)) {
770 irerror(self->context, "tail-recursion optimization pass broke something in `%s`", self->name);
775 if (!ir_function_naive_phi(self)) {
776 irerror(self->context, "internal error: ir_function_naive_phi failed");
780 for (i = 0; i < vec_size(self->locals); ++i) {
781 ir_value *v = self->locals[i];
782 if (v->vtype == TYPE_VECTOR ||
783 (v->vtype == TYPE_FIELD && v->outtype == TYPE_VECTOR))
785 ir_value_vector_member(v, 0);
786 ir_value_vector_member(v, 1);
787 ir_value_vector_member(v, 2);
790 for (i = 0; i < vec_size(self->values); ++i) {
791 ir_value *v = self->values[i];
792 if (v->vtype == TYPE_VECTOR ||
793 (v->vtype == TYPE_FIELD && v->outtype == TYPE_VECTOR))
795 ir_value_vector_member(v, 0);
796 ir_value_vector_member(v, 1);
797 ir_value_vector_member(v, 2);
801 ir_function_enumerate(self);
803 if (!ir_function_calculate_liferanges(self))
805 if (!ir_function_allocate_locals(self))
810 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
815 vec_size(self->locals) &&
816 self->locals[vec_size(self->locals)-1]->store != store_param) {
817 irerror(self->context, "cannot add parameters after adding locals");
821 ve = ir_value_var(name, (param ? store_param : store_local), vtype);
824 vec_push(self->locals, ve);
828 /***********************************************************************
832 ir_block* ir_block_new(ir_function* owner, const char *name)
835 self = (ir_block*)mem_a(sizeof(*self));
839 memset(self, 0, sizeof(*self));
842 if (name && !ir_block_set_label(self, name)) {
847 self->context.file = "<@no context>";
848 self->context.line = 0;
852 self->entries = NULL;
856 self->is_return = false;
861 self->generated = false;
866 static void ir_block_delete_quick(ir_block* self)
869 if (self->label) mem_d(self->label);
870 for (i = 0; i != vec_size(self->instr); ++i)
871 ir_instr_delete_quick(self->instr[i]);
872 vec_free(self->instr);
873 vec_free(self->entries);
874 vec_free(self->exits);
875 vec_free(self->living);
879 void ir_block_delete(ir_block* self)
882 if (self->label) mem_d(self->label);
883 for (i = 0; i != vec_size(self->instr); ++i)
884 ir_instr_delete(self->instr[i]);
885 vec_free(self->instr);
886 vec_free(self->entries);
887 vec_free(self->exits);
888 vec_free(self->living);
892 bool ir_block_set_label(ir_block *self, const char *name)
895 mem_d((void*)self->label);
896 self->label = util_strdup(name);
897 return !!self->label;
900 /***********************************************************************
904 ir_instr* ir_instr_new(lex_ctx ctx, ir_block* owner, int op)
907 self = (ir_instr*)mem_a(sizeof(*self));
914 self->_ops[0] = NULL;
915 self->_ops[1] = NULL;
916 self->_ops[2] = NULL;
917 self->bops[0] = NULL;
918 self->bops[1] = NULL;
929 static void ir_instr_delete_quick(ir_instr *self)
932 vec_free(self->params);
936 void ir_instr_delete(ir_instr *self)
939 /* The following calls can only delete from
940 * vectors, we still want to delete this instruction
941 * so ignore the return value. Since with the warn_unused_result attribute
942 * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
943 * I have to improvise here and use if(foo());
945 for (i = 0; i < vec_size(self->phi); ++i) {
947 if (vec_ir_instr_find(self->phi[i].value->writes, self, &idx))
948 vec_remove(self->phi[i].value->writes, idx, 1);
949 if (vec_ir_instr_find(self->phi[i].value->reads, self, &idx))
950 vec_remove(self->phi[i].value->reads, idx, 1);
953 for (i = 0; i < vec_size(self->params); ++i) {
955 if (vec_ir_instr_find(self->params[i]->writes, self, &idx))
956 vec_remove(self->params[i]->writes, idx, 1);
957 if (vec_ir_instr_find(self->params[i]->reads, self, &idx))
958 vec_remove(self->params[i]->reads, idx, 1);
960 vec_free(self->params);
961 (void)!ir_instr_op(self, 0, NULL, false);
962 (void)!ir_instr_op(self, 1, NULL, false);
963 (void)!ir_instr_op(self, 2, NULL, false);
967 bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
969 if (self->_ops[op]) {
971 if (writing && vec_ir_instr_find(self->_ops[op]->writes, self, &idx))
972 vec_remove(self->_ops[op]->writes, idx, 1);
973 else if (vec_ir_instr_find(self->_ops[op]->reads, self, &idx))
974 vec_remove(self->_ops[op]->reads, idx, 1);
978 vec_push(v->writes, self);
980 vec_push(v->reads, self);
986 /***********************************************************************
990 void ir_value_code_setaddr(ir_value *self, int32_t gaddr)
992 self->code.globaladdr = gaddr;
993 if (self->members[0]) self->members[0]->code.globaladdr = gaddr;
994 if (self->members[1]) self->members[1]->code.globaladdr = gaddr;
995 if (self->members[2]) self->members[2]->code.globaladdr = gaddr;
998 int32_t ir_value_code_addr(const ir_value *self)
1000 if (self->store == store_return)
1001 return OFS_RETURN + self->code.addroffset;
1002 return self->code.globaladdr + self->code.addroffset;
1005 ir_value* ir_value_var(const char *name, int storetype, int vtype)
1008 self = (ir_value*)mem_a(sizeof(*self));
1009 self->vtype = vtype;
1010 self->fieldtype = TYPE_VOID;
1011 self->outtype = TYPE_VOID;
1012 self->store = storetype;
1015 self->writes = NULL;
1017 self->cvq = CV_NONE;
1018 self->hasvalue = false;
1019 self->context.file = "<@no context>";
1020 self->context.line = 0;
1022 if (name && !ir_value_set_name(self, name)) {
1023 irerror(self->context, "out of memory");
1028 memset(&self->constval, 0, sizeof(self->constval));
1029 memset(&self->code, 0, sizeof(self->code));
1031 self->members[0] = NULL;
1032 self->members[1] = NULL;
1033 self->members[2] = NULL;
1034 self->memberof = NULL;
1036 self->unique_life = false;
1037 self->locked = false;
1038 self->callparam = false;
1044 ir_value* ir_value_vector_member(ir_value *self, unsigned int member)
1052 if (self->members[member])
1053 return self->members[member];
1056 len = strlen(self->name);
1057 name = (char*)mem_a(len + 3);
1058 memcpy(name, self->name, len);
1060 name[len+1] = 'x' + member;
1066 if (self->vtype == TYPE_VECTOR)
1068 m = ir_value_var(name, self->store, TYPE_FLOAT);
1073 m->context = self->context;
1075 self->members[member] = m;
1076 m->code.addroffset = member;
1078 else if (self->vtype == TYPE_FIELD)
1080 if (self->fieldtype != TYPE_VECTOR)
1082 m = ir_value_var(name, self->store, TYPE_FIELD);
1087 m->fieldtype = TYPE_FLOAT;
1088 m->context = self->context;
1090 self->members[member] = m;
1091 m->code.addroffset = member;
1095 irerror(self->context, "invalid member access on %s", self->name);
1103 static GMQCC_INLINE size_t ir_value_sizeof(const ir_value *self)
1105 if (self->vtype == TYPE_FIELD && self->fieldtype == TYPE_VECTOR)
1106 return type_sizeof_[TYPE_VECTOR];
1107 return type_sizeof_[self->vtype];
1110 ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
1112 ir_value *v = ir_value_var(name, storetype, vtype);
1115 ir_function_collect_value(owner, v);
1119 void ir_value_delete(ir_value* self)
1123 mem_d((void*)self->name);
1126 if (self->vtype == TYPE_STRING)
1127 mem_d((void*)self->constval.vstring);
1129 for (i = 0; i < 3; ++i) {
1130 if (self->members[i])
1131 ir_value_delete(self->members[i]);
1133 vec_free(self->reads);
1134 vec_free(self->writes);
1135 vec_free(self->life);
1139 bool ir_value_set_name(ir_value *self, const char *name)
1142 mem_d((void*)self->name);
1143 self->name = util_strdup(name);
1144 return !!self->name;
1147 bool ir_value_set_float(ir_value *self, float f)
1149 if (self->vtype != TYPE_FLOAT)
1151 self->constval.vfloat = f;
1152 self->hasvalue = true;
1156 bool ir_value_set_func(ir_value *self, int f)
1158 if (self->vtype != TYPE_FUNCTION)
1160 self->constval.vint = f;
1161 self->hasvalue = true;
1165 bool ir_value_set_vector(ir_value *self, vector v)
1167 if (self->vtype != TYPE_VECTOR)
1169 self->constval.vvec = v;
1170 self->hasvalue = true;
1174 bool ir_value_set_field(ir_value *self, ir_value *fld)
1176 if (self->vtype != TYPE_FIELD)
1178 self->constval.vpointer = fld;
1179 self->hasvalue = true;
1183 static char *ir_strdup(const char *str)
1186 /* actually dup empty strings */
1187 char *out = (char*)mem_a(1);
1191 return util_strdup(str);
1194 bool ir_value_set_string(ir_value *self, const char *str)
1196 if (self->vtype != TYPE_STRING)
1198 self->constval.vstring = ir_strdup(str);
1199 self->hasvalue = true;
1204 bool ir_value_set_int(ir_value *self, int i)
1206 if (self->vtype != TYPE_INTEGER)
1208 self->constval.vint = i;
1209 self->hasvalue = true;
1214 bool ir_value_lives(ir_value *self, size_t at)
1217 for (i = 0; i < vec_size(self->life); ++i)
1219 ir_life_entry_t *life = &self->life[i];
1220 if (life->start <= at && at <= life->end)
1222 if (life->start > at) /* since it's ordered */
1228 bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
1231 vec_push(self->life, e);
1232 for (k = vec_size(self->life)-1; k > idx; --k)
1233 self->life[k] = self->life[k-1];
1234 self->life[idx] = e;
1238 bool ir_value_life_merge(ir_value *self, size_t s)
1241 ir_life_entry_t *life = NULL;
1242 ir_life_entry_t *before = NULL;
1243 ir_life_entry_t new_entry;
1245 /* Find the first range >= s */
1246 for (i = 0; i < vec_size(self->life); ++i)
1249 life = &self->life[i];
1250 if (life->start > s)
1253 /* nothing found? append */
1254 if (i == vec_size(self->life)) {
1256 if (life && life->end+1 == s)
1258 /* previous life range can be merged in */
1262 if (life && life->end >= s)
1264 e.start = e.end = s;
1265 vec_push(self->life, e);
1271 if (before->end + 1 == s &&
1272 life->start - 1 == s)
1275 before->end = life->end;
1276 vec_remove(self->life, i, 1);
1279 if (before->end + 1 == s)
1285 /* already contained */
1286 if (before->end >= s)
1290 if (life->start - 1 == s)
1295 /* insert a new entry */
1296 new_entry.start = new_entry.end = s;
1297 return ir_value_life_insert(self, i, new_entry);
1300 bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
1304 if (!vec_size(other->life))
1307 if (!vec_size(self->life)) {
1308 size_t count = vec_size(other->life);
1309 ir_life_entry_t *life = vec_add(self->life, count);
1310 memcpy(life, other->life, count * sizeof(*life));
1315 for (i = 0; i < vec_size(other->life); ++i)
1317 const ir_life_entry_t *life = &other->life[i];
1320 ir_life_entry_t *entry = &self->life[myi];
1322 if (life->end+1 < entry->start)
1324 /* adding an interval before entry */
1325 if (!ir_value_life_insert(self, myi, *life))
1331 if (life->start < entry->start &&
1332 life->end+1 >= entry->start)
1334 /* starts earlier and overlaps */
1335 entry->start = life->start;
1338 if (life->end > entry->end &&
1339 life->start <= entry->end+1)
1341 /* ends later and overlaps */
1342 entry->end = life->end;
1345 /* see if our change combines it with the next ranges */
1346 while (myi+1 < vec_size(self->life) &&
1347 entry->end+1 >= self->life[1+myi].start)
1349 /* overlaps with (myi+1) */
1350 if (entry->end < self->life[1+myi].end)
1351 entry->end = self->life[1+myi].end;
1352 vec_remove(self->life, myi+1, 1);
1353 entry = &self->life[myi];
1356 /* see if we're after the entry */
1357 if (life->start > entry->end)
1360 /* append if we're at the end */
1361 if (myi >= vec_size(self->life)) {
1362 vec_push(self->life, *life);
1365 /* otherweise check the next range */
1374 bool ir_values_overlap(const ir_value *a, const ir_value *b)
1376 /* For any life entry in A see if it overlaps with
1377 * any life entry in B.
1378 * Note that the life entries are orderes, so we can make a
1379 * more efficient algorithm there than naively translating the
1383 ir_life_entry_t *la, *lb, *enda, *endb;
1385 /* first of all, if either has no life range, they cannot clash */
1386 if (!vec_size(a->life) || !vec_size(b->life))
1391 enda = la + vec_size(a->life);
1392 endb = lb + vec_size(b->life);
1395 /* check if the entries overlap, for that,
1396 * both must start before the other one ends.
1398 if (la->start < lb->end &&
1399 lb->start < la->end)
1404 /* entries are ordered
1405 * one entry is earlier than the other
1406 * that earlier entry will be moved forward
1408 if (la->start < lb->start)
1410 /* order: A B, move A forward
1411 * check if we hit the end with A
1416 else /* if (lb->start < la->start) actually <= */
1418 /* order: B A, move B forward
1419 * check if we hit the end with B
1428 /***********************************************************************
1432 static bool ir_check_unreachable(ir_block *self)
1434 /* The IR should never have to deal with unreachable code */
1435 if (!self->final/* || OPTS_FLAG(ALLOW_UNREACHABLE_CODE)*/)
1437 irerror(self->context, "unreachable statement (%s)", self->label);
1441 bool ir_block_create_store_op(ir_block *self, lex_ctx ctx, int op, ir_value *target, ir_value *what)
1444 if (!ir_check_unreachable(self))
1447 if (target->store == store_value &&
1448 (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1450 irerror(self->context, "cannot store to an SSA value");
1451 irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1452 irerror(self->context, "instruction: %s", asm_instr[op].m);
1456 in = ir_instr_new(ctx, self, op);
1460 if (!ir_instr_op(in, 0, target, (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC)) ||
1461 !ir_instr_op(in, 1, what, false))
1463 ir_instr_delete(in);
1466 vec_push(self->instr, in);
1470 bool ir_block_create_store(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1474 if (target->vtype == TYPE_VARIANT)
1475 vtype = what->vtype;
1477 vtype = target->vtype;
1480 if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
1481 op = INSTR_CONV_ITOF;
1482 else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1483 op = INSTR_CONV_FTOI;
1485 op = type_store_instr[vtype];
1487 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1488 if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1492 return ir_block_create_store_op(self, ctx, op, target, what);
1495 bool ir_block_create_storep(ir_block *self, lex_ctx ctx, ir_value *target, ir_value *what)
1500 if (target->vtype != TYPE_POINTER)
1503 /* storing using pointer - target is a pointer, type must be
1504 * inferred from source
1506 vtype = what->vtype;
1508 op = type_storep_instr[vtype];
1509 if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1510 if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1511 op = INSTR_STOREP_V;
1514 return ir_block_create_store_op(self, ctx, op, target, what);
1517 bool ir_block_create_return(ir_block *self, lex_ctx ctx, ir_value *v)
1520 if (!ir_check_unreachable(self))
1523 self->is_return = true;
1524 in = ir_instr_new(ctx, self, INSTR_RETURN);
1528 if (v && !ir_instr_op(in, 0, v, false)) {
1529 ir_instr_delete(in);
1533 vec_push(self->instr, in);
1537 bool ir_block_create_if(ir_block *self, lex_ctx ctx, ir_value *v,
1538 ir_block *ontrue, ir_block *onfalse)
1541 if (!ir_check_unreachable(self))
1544 /*in = ir_instr_new(ctx, self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1545 in = ir_instr_new(ctx, self, VINSTR_COND);
1549 if (!ir_instr_op(in, 0, v, false)) {
1550 ir_instr_delete(in);
1554 in->bops[0] = ontrue;
1555 in->bops[1] = onfalse;
1557 vec_push(self->instr, in);
1559 vec_push(self->exits, ontrue);
1560 vec_push(self->exits, onfalse);
1561 vec_push(ontrue->entries, self);
1562 vec_push(onfalse->entries, self);
1566 bool ir_block_create_jump(ir_block *self, lex_ctx ctx, ir_block *to)
1569 if (!ir_check_unreachable(self))
1572 in = ir_instr_new(ctx, self, VINSTR_JUMP);
1577 vec_push(self->instr, in);
1579 vec_push(self->exits, to);
1580 vec_push(to->entries, self);
1584 bool ir_block_create_goto(ir_block *self, lex_ctx ctx, ir_block *to)
1586 self->owner->flags |= IR_FLAG_HAS_GOTO;
1587 return ir_block_create_jump(self, ctx, to);
1590 ir_instr* ir_block_create_phi(ir_block *self, lex_ctx ctx, const char *label, int ot)
1594 if (!ir_check_unreachable(self))
1596 in = ir_instr_new(ctx, self, VINSTR_PHI);
1599 out = ir_value_out(self->owner, label, store_value, ot);
1601 ir_instr_delete(in);
1604 if (!ir_instr_op(in, 0, out, true)) {
1605 ir_instr_delete(in);
1606 ir_value_delete(out);
1609 vec_push(self->instr, in);
1613 ir_value* ir_phi_value(ir_instr *self)
1615 return self->_ops[0];
1618 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1622 if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1623 /* Must not be possible to cause this, otherwise the AST
1624 * is doing something wrong.
1626 irerror(self->context, "Invalid entry block for PHI");
1632 vec_push(v->reads, self);
1633 vec_push(self->phi, pe);
1636 /* call related code */
1637 ir_instr* ir_block_create_call(ir_block *self, lex_ctx ctx, const char *label, ir_value *func, bool noreturn)
1641 if (!ir_check_unreachable(self))
1643 in = ir_instr_new(ctx, self, (noreturn ? VINSTR_NRCALL : INSTR_CALL0));
1648 self->is_return = true;
1650 out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1652 ir_instr_delete(in);
1655 if (!ir_instr_op(in, 0, out, true) ||
1656 !ir_instr_op(in, 1, func, false))
1658 ir_instr_delete(in);
1659 ir_value_delete(out);
1662 vec_push(self->instr, in);
1665 if (!ir_block_create_return(self, ctx, NULL)) {
1666 compile_error(ctx, "internal error: failed to generate dummy-return instruction");
1667 ir_instr_delete(in);
1675 ir_value* ir_call_value(ir_instr *self)
1677 return self->_ops[0];
1680 void ir_call_param(ir_instr* self, ir_value *v)
1682 vec_push(self->params, v);
1683 vec_push(v->reads, self);
1686 /* binary op related code */
1688 ir_value* ir_block_create_binop(ir_block *self, lex_ctx ctx,
1689 const char *label, int opcode,
1690 ir_value *left, ir_value *right)
1712 case INSTR_SUB_S: /* -- offset of string as float */
1717 case INSTR_BITOR_IF:
1718 case INSTR_BITOR_FI:
1719 case INSTR_BITAND_FI:
1720 case INSTR_BITAND_IF:
1735 case INSTR_BITAND_I:
1738 case INSTR_RSHIFT_I:
1739 case INSTR_LSHIFT_I:
1761 /* boolean operations result in floats */
1762 if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1764 else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1767 else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1772 if (ot == TYPE_VOID) {
1773 /* The AST or parser were supposed to check this! */
1777 return ir_block_create_general_instr(self, ctx, label, opcode, left, right, ot);
1780 ir_value* ir_block_create_unary(ir_block *self, lex_ctx ctx,
1781 const char *label, int opcode,
1784 int ot = TYPE_FLOAT;
1796 /* QC doesn't have other unary operations. We expect extensions to fill
1797 * the above list, otherwise we assume out-type = in-type, eg for an
1801 ot = operand->vtype;
1804 if (ot == TYPE_VOID) {
1805 /* The AST or parser were supposed to check this! */
1809 /* let's use the general instruction creator and pass NULL for OPB */
1810 return ir_block_create_general_instr(self, ctx, label, opcode, operand, NULL, ot);
1813 ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx ctx, const char *label,
1814 int op, ir_value *a, ir_value *b, int outype)
1819 out = ir_value_out(self->owner, label, store_value, outype);
1823 instr = ir_instr_new(ctx, self, op);
1825 ir_value_delete(out);
1829 if (!ir_instr_op(instr, 0, out, true) ||
1830 !ir_instr_op(instr, 1, a, false) ||
1831 !ir_instr_op(instr, 2, b, false) )
1836 vec_push(self->instr, instr);
1840 ir_instr_delete(instr);
1841 ir_value_delete(out);
1845 ir_value* ir_block_create_fieldaddress(ir_block *self, lex_ctx ctx, const char *label, ir_value *ent, ir_value *field)
1849 /* Support for various pointer types todo if so desired */
1850 if (ent->vtype != TYPE_ENTITY)
1853 if (field->vtype != TYPE_FIELD)
1856 v = ir_block_create_general_instr(self, ctx, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1857 v->fieldtype = field->fieldtype;
1861 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)
1864 if (ent->vtype != TYPE_ENTITY)
1867 /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1868 if (field->vtype != TYPE_FIELD)
1873 case TYPE_FLOAT: op = INSTR_LOAD_F; break;
1874 case TYPE_VECTOR: op = INSTR_LOAD_V; break;
1875 case TYPE_STRING: op = INSTR_LOAD_S; break;
1876 case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
1877 case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
1878 case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1880 case TYPE_POINTER: op = INSTR_LOAD_I; break;
1881 case TYPE_INTEGER: op = INSTR_LOAD_I; break;
1884 irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1888 return ir_block_create_general_instr(self, ctx, label, op, ent, field, outype);
1891 /* PHI resolving breaks the SSA, and must thus be the last
1892 * step before life-range calculation.
1895 static bool ir_block_naive_phi(ir_block *self);
1896 bool ir_function_naive_phi(ir_function *self)
1900 for (i = 0; i < vec_size(self->blocks); ++i)
1902 if (!ir_block_naive_phi(self->blocks[i]))
1909 static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
1914 /* create a store */
1915 if (!ir_block_create_store(block, old, what))
1918 /* we now move it up */
1919 instr = vec_last(block->instr);
1920 for (i = vec_size(block->instr)-1; i > iid; --i)
1921 block->instr[i] = block->instr[i-1];
1922 block->instr[i] = instr;
1928 static bool ir_block_naive_phi(ir_block *self)
1930 size_t i, p; /*, w;*/
1931 /* FIXME: optionally, create_phi can add the phis
1932 * to a list so we don't need to loop through blocks
1933 * - anyway: "don't optimize YET"
1935 for (i = 0; i < vec_size(self->instr); ++i)
1937 ir_instr *instr = self->instr[i];
1938 if (instr->opcode != VINSTR_PHI)
1941 vec_remove(self->instr, i, 1);
1942 --i; /* NOTE: i+1 below */
1944 for (p = 0; p < vec_size(instr->phi); ++p)
1946 ir_value *v = instr->phi[p].value;
1947 ir_block *b = instr->phi[p].from;
1949 if (v->store == store_value &&
1950 vec_size(v->reads) == 1 &&
1951 vec_size(v->writes) == 1)
1953 /* replace the value */
1954 if (!ir_instr_op(v->writes[0], 0, instr->_ops[0], true))
1959 /* force a move instruction */
1960 ir_instr *prevjump = vec_last(b->instr);
1963 instr->_ops[0]->store = store_global;
1964 if (!ir_block_create_store(b, instr->context, instr->_ops[0], v))
1966 instr->_ops[0]->store = store_value;
1967 vec_push(b->instr, prevjump);
1972 ir_value *v = instr->phi[p].value;
1973 for (w = 0; w < vec_size(v->writes); ++w) {
1976 if (!v->writes[w]->_ops[0])
1979 /* When the write was to a global, we have to emit a mov */
1980 old = v->writes[w]->_ops[0];
1982 /* The original instruction now writes to the PHI target local */
1983 if (v->writes[w]->_ops[0] == v)
1984 v->writes[w]->_ops[0] = instr->_ops[0];
1986 if (old->store != store_value && old->store != store_local && old->store != store_param)
1988 /* If it originally wrote to a global we need to store the value
1991 if (!ir_naive_phi_emit_store(self, i+1, old, v))
1993 if (i+1 < vec_size(self->instr))
1994 instr = self->instr[i+1];
1997 /* In case I forget and access instr later, it'll be NULL
1998 * when it's a problem, to make sure we crash, rather than accessing
2004 /* If it didn't, we can replace all reads by the phi target now. */
2006 for (r = 0; r < vec_size(old->reads); ++r)
2009 ir_instr *ri = old->reads[r];
2010 for (op = 0; op < vec_size(ri->phi); ++op) {
2011 if (ri->phi[op].value == old)
2012 ri->phi[op].value = v;
2014 for (op = 0; op < 3; ++op) {
2015 if (ri->_ops[op] == old)
2023 ir_instr_delete(instr);
2028 /***********************************************************************
2029 *IR Temp allocation code
2030 * Propagating value life ranges by walking through the function backwards
2031 * until no more changes are made.
2032 * In theory this should happen once more than once for every nested loop
2034 * Though this implementation might run an additional time for if nests.
2037 /* Enumerate instructions used by value's life-ranges
2039 static void ir_block_enumerate(ir_block *self, size_t *_eid)
2043 for (i = 0; i < vec_size(self->instr); ++i)
2045 self->instr[i]->eid = eid++;
2050 /* Enumerate blocks and instructions.
2051 * The block-enumeration is unordered!
2052 * We do not really use the block enumreation, however
2053 * the instruction enumeration is important for life-ranges.
2055 void ir_function_enumerate(ir_function *self)
2058 size_t instruction_id = 1;
2059 for (i = 0; i < vec_size(self->blocks); ++i)
2061 self->blocks[i]->eid = i;
2062 self->blocks[i]->run_id = 0;
2063 ir_block_enumerate(self->blocks[i], &instruction_id);
2067 static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
2068 bool ir_function_calculate_liferanges(ir_function *self)
2073 /* parameters live at 0 */
2074 for (i = 0; i < vec_size(self->params); ++i)
2075 ir_value_life_merge(self->locals[i], 0);
2080 for (i = 0; i != vec_size(self->blocks); ++i)
2082 if (self->blocks[i]->is_return)
2084 vec_free(self->blocks[i]->living);
2085 if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
2090 if (vec_size(self->blocks)) {
2091 ir_block *block = self->blocks[0];
2092 for (i = 0; i < vec_size(block->living); ++i) {
2093 ir_value *v = block->living[i];
2094 if (v->store != store_local)
2096 if (v->vtype == TYPE_VECTOR)
2098 self->flags |= IR_FLAG_HAS_UNINITIALIZED;
2099 /* find the instruction reading from it */
2100 for (s = 0; s < vec_size(v->reads); ++s) {
2101 if (v->reads[s]->eid == v->life[0].end)
2104 if (s < vec_size(v->reads)) {
2105 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2106 "variable `%s` may be used uninitialized in this function\n"
2109 v->reads[s]->context.file, v->reads[s]->context.line)
2117 ir_value *vec = v->memberof;
2118 for (s = 0; s < vec_size(vec->reads); ++s) {
2119 if (vec->reads[s]->eid == v->life[0].end)
2122 if (s < vec_size(vec->reads)) {
2123 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2124 "variable `%s` may be used uninitialized in this function\n"
2127 vec->reads[s]->context.file, vec->reads[s]->context.line)
2135 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2136 "variable `%s` may be used uninitialized in this function", v->name))
2145 /* Local-value allocator
2146 * After finishing creating the liferange of all values used in a function
2147 * we can allocate their global-positions.
2148 * This is the counterpart to register-allocation in register machines.
2155 } function_allocator;
2157 static bool function_allocator_alloc(function_allocator *alloc, ir_value *var)
2160 size_t vsize = ir_value_sizeof(var);
2162 var->code.local = vec_size(alloc->locals);
2164 slot = ir_value_var("reg", store_global, var->vtype);
2168 if (!ir_value_life_merge_into(slot, var))
2171 vec_push(alloc->locals, slot);
2172 vec_push(alloc->sizes, vsize);
2173 vec_push(alloc->unique, var->unique_life);
2178 ir_value_delete(slot);
2182 static bool ir_function_allocator_assign(ir_function *self, function_allocator *alloc, ir_value *v)
2187 for (a = 0; a < vec_size(alloc->locals); ++a)
2189 /* if it's reserved for a unique liferange: skip */
2190 if (alloc->unique[a])
2193 slot = alloc->locals[a];
2195 /* never resize parameters
2196 * will be required later when overlapping temps + locals
2198 if (a < vec_size(self->params) &&
2199 alloc->sizes[a] < ir_value_sizeof(v))
2204 if (ir_values_overlap(v, slot))
2207 if (!ir_value_life_merge_into(slot, v))
2210 /* adjust size for this slot */
2211 if (alloc->sizes[a] < ir_value_sizeof(v))
2212 alloc->sizes[a] = ir_value_sizeof(v);
2217 if (a >= vec_size(alloc->locals)) {
2218 if (!function_allocator_alloc(alloc, v))
2224 bool ir_function_allocate_locals(ir_function *self)
2229 bool opt_gt = OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS);
2233 function_allocator lockalloc, globalloc;
2235 if (!vec_size(self->locals) && !vec_size(self->values))
2238 globalloc.locals = NULL;
2239 globalloc.sizes = NULL;
2240 globalloc.positions = NULL;
2241 globalloc.unique = NULL;
2242 lockalloc.locals = NULL;
2243 lockalloc.sizes = NULL;
2244 lockalloc.positions = NULL;
2245 lockalloc.unique = NULL;
2247 for (i = 0; i < vec_size(self->locals); ++i)
2249 v = self->locals[i];
2250 if (!OPTS_OPTIMIZATION(OPTIM_LOCAL_TEMPS)) {
2252 v->unique_life = true;
2254 else if (i >= vec_size(self->params))
2257 v->locked = true; /* lock parameters locals */
2258 if (!function_allocator_alloc((v->locked || !opt_gt ? &lockalloc : &globalloc), self->locals[i]))
2261 for (; i < vec_size(self->locals); ++i)
2263 v = self->locals[i];
2264 if (!vec_size(v->life))
2266 if (!ir_function_allocator_assign(self, (v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2270 /* Allocate a slot for any value that still exists */
2271 for (i = 0; i < vec_size(self->values); ++i)
2273 v = self->values[i];
2275 if (!vec_size(v->life))
2278 /* CALL optimization:
2279 * If the value is a parameter-temp: 1 write, 1 read from a CALL
2280 * and it's not "locked", write it to the OFS_PARM directly.
2282 if (OPTS_OPTIMIZATION(OPTIM_CALL_STORES) && !v->locked && !v->unique_life) {
2283 if (vec_size(v->reads) == 1 && vec_size(v->writes) == 1 &&
2284 (v->reads[0]->opcode == VINSTR_NRCALL ||
2285 (v->reads[0]->opcode >= INSTR_CALL0 && v->reads[0]->opcode <= INSTR_CALL8)
2290 ir_instr *call = v->reads[0];
2291 if (!vec_ir_value_find(call->params, v, ¶m)) {
2292 irerror(call->context, "internal error: unlocked parameter %s not found", v->name);
2296 ++opts_optimizationcount[OPTIM_CALL_STORES];
2297 v->callparam = true;
2299 ir_value_code_setaddr(v, OFS_PARM0 + 3*param);
2303 if (vec_size(self->owner->extparam_protos) <= param)
2304 ep = ir_gen_extparam_proto(self->owner);
2306 ep = self->owner->extparam_protos[param];
2307 ir_instr_op(v->writes[0], 0, ep, true);
2308 call->params[param+8] = ep;
2312 if (vec_size(v->writes) == 1 && v->writes[0]->opcode == INSTR_CALL0)
2314 v->store = store_return;
2315 if (v->members[0]) v->members[0]->store = store_return;
2316 if (v->members[1]) v->members[1]->store = store_return;
2317 if (v->members[2]) v->members[2]->store = store_return;
2318 ++opts_optimizationcount[OPTIM_CALL_STORES];
2323 if (!ir_function_allocator_assign(self, (v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2327 if (!lockalloc.sizes && !globalloc.sizes) {
2330 vec_push(lockalloc.positions, 0);
2331 vec_push(globalloc.positions, 0);
2333 /* Adjust slot positions based on sizes */
2334 if (lockalloc.sizes) {
2335 pos = (vec_size(lockalloc.sizes) ? lockalloc.positions[0] : 0);
2336 for (i = 1; i < vec_size(lockalloc.sizes); ++i)
2338 pos = lockalloc.positions[i-1] + lockalloc.sizes[i-1];
2339 vec_push(lockalloc.positions, pos);
2341 self->allocated_locals = pos + vec_last(lockalloc.sizes);
2343 if (globalloc.sizes) {
2344 pos = (vec_size(globalloc.sizes) ? globalloc.positions[0] : 0);
2345 for (i = 1; i < vec_size(globalloc.sizes); ++i)
2347 pos = globalloc.positions[i-1] + globalloc.sizes[i-1];
2348 vec_push(globalloc.positions, pos);
2350 self->globaltemps = pos + vec_last(globalloc.sizes);
2353 /* Locals need to know their new position */
2354 for (i = 0; i < vec_size(self->locals); ++i) {
2355 v = self->locals[i];
2356 if (i >= vec_size(self->params) && !vec_size(v->life))
2358 if (v->locked || !opt_gt)
2359 v->code.local = lockalloc.positions[v->code.local];
2361 v->code.local = globalloc.positions[v->code.local];
2363 /* Take over the actual slot positions on values */
2364 for (i = 0; i < vec_size(self->values); ++i) {
2365 v = self->values[i];
2366 if (!vec_size(v->life))
2368 if (v->locked || !opt_gt)
2369 v->code.local = lockalloc.positions[v->code.local];
2371 v->code.local = globalloc.positions[v->code.local];
2379 for (i = 0; i < vec_size(lockalloc.locals); ++i)
2380 ir_value_delete(lockalloc.locals[i]);
2381 for (i = 0; i < vec_size(globalloc.locals); ++i)
2382 ir_value_delete(globalloc.locals[i]);
2383 vec_free(globalloc.unique);
2384 vec_free(globalloc.locals);
2385 vec_free(globalloc.sizes);
2386 vec_free(globalloc.positions);
2387 vec_free(lockalloc.unique);
2388 vec_free(lockalloc.locals);
2389 vec_free(lockalloc.sizes);
2390 vec_free(lockalloc.positions);
2394 /* Get information about which operand
2395 * is read from, or written to.
2397 static void ir_op_read_write(int op, size_t *read, size_t *write)
2417 case INSTR_STOREP_F:
2418 case INSTR_STOREP_V:
2419 case INSTR_STOREP_S:
2420 case INSTR_STOREP_ENT:
2421 case INSTR_STOREP_FLD:
2422 case INSTR_STOREP_FNC:
2433 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2436 bool changed = false;
2438 for (i = 0; i != vec_size(self->living); ++i)
2440 tempbool = ir_value_life_merge(self->living[i], eid);
2441 changed = changed || tempbool;
2446 static bool ir_block_living_lock(ir_block *self)
2449 bool changed = false;
2450 for (i = 0; i != vec_size(self->living); ++i)
2452 if (!self->living[i]->locked)
2454 self->living[i]->locked = true;
2459 static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
2465 /* values which have been read in a previous iteration are now
2466 * in the "living" array even if the previous block doesn't use them.
2467 * So we have to remove whatever does not exist in the previous block.
2468 * They will be re-added on-read, but the liferange merge won't cause
2470 for (i = 0; i < vec_size(self->living); ++i)
2472 if (!vec_ir_value_find(prev->living, self->living[i], NULL)) {
2473 vec_remove(self->living, i, 1);
2479 /* Whatever the previous block still has in its living set
2480 * must now be added to ours as well.
2482 for (i = 0; i < vec_size(prev->living); ++i)
2484 if (vec_ir_value_find(self->living, prev->living[i], NULL))
2486 vec_push(self->living, prev->living[i]);
2488 irerror(self->contextt from prev: %s", self->label, prev->living[i]->_name);
2494 static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
2499 size_t i, o, p, mem;
2500 /* bitmasks which operands are read from or written to */
2509 if (!ir_block_life_prop_previous(self, prev, changed))
2513 i = vec_size(self->instr);
2516 instr = self->instr[i];
2518 /* See which operands are read and write operands */
2519 ir_op_read_write(instr->opcode, &read, &write);
2521 if (instr->opcode == INSTR_MUL_VF)
2523 /* the float source will get an additional lifetime */
2524 tempbool = ir_value_life_merge(instr->_ops[2], instr->eid+1);
2525 *changed = *changed || tempbool;
2527 else if (instr->opcode == INSTR_MUL_FV)
2529 /* the float source will get an additional lifetime */
2530 tempbool = ir_value_life_merge(instr->_ops[1], instr->eid+1);
2531 *changed = *changed || tempbool;
2534 /* Go through the 3 main operands
2535 * writes first, then reads
2537 for (o = 0; o < 3; ++o)
2539 if (!instr->_ops[o]) /* no such operand */
2542 value = instr->_ops[o];
2544 /* We only care about locals */
2545 /* we also calculate parameter liferanges so that locals
2546 * can take up parameter slots */
2547 if (value->store != store_value &&
2548 value->store != store_local &&
2549 value->store != store_param)
2552 /* write operands */
2553 /* When we write to a local, we consider it "dead" for the
2554 * remaining upper part of the function, since in SSA a value
2555 * can only be written once (== created)
2560 bool in_living = vec_ir_value_find(self->living, value, &idx);
2563 /* If the value isn't alive it hasn't been read before... */
2564 /* TODO: See if the warning can be emitted during parsing or AST processing
2565 * otherwise have warning printed here.
2566 * IF printing a warning here: include filecontext_t,
2567 * and make sure it's only printed once
2568 * since this function is run multiple times.
2570 /* con_err( "Value only written %s\n", value->name); */
2571 tempbool = ir_value_life_merge(value, instr->eid);
2572 *changed = *changed || tempbool;
2574 /* since 'living' won't contain it
2575 * anymore, merge the value, since
2578 tempbool = ir_value_life_merge(value, instr->eid);
2579 *changed = *changed || tempbool;
2581 vec_remove(self->living, idx, 1);
2583 /* Removing a vector removes all members */
2584 for (mem = 0; mem < 3; ++mem) {
2585 if (value->members[mem] && vec_ir_value_find(self->living, value->members[mem], &idx)) {
2586 tempbool = ir_value_life_merge(value->members[mem], instr->eid);
2587 *changed = *changed || tempbool;
2588 vec_remove(self->living, idx, 1);
2591 /* Removing the last member removes the vector */
2592 if (value->memberof) {
2593 value = value->memberof;
2594 for (mem = 0; mem < 3; ++mem) {
2595 if (value->members[mem] && vec_ir_value_find(self->living, value->members[mem], NULL))
2598 if (mem == 3 && vec_ir_value_find(self->living, value, &idx)) {
2599 tempbool = ir_value_life_merge(value, instr->eid);
2600 *changed = *changed || tempbool;
2601 vec_remove(self->living, idx, 1);
2607 for (o = 0; o < 3; ++o)
2609 if (!instr->_ops[o]) /* no such operand */
2612 value = instr->_ops[o];
2614 /* We only care about locals */
2615 /* we also calculate parameter liferanges so that locals
2616 * can take up parameter slots */
2617 if (value->store != store_value &&
2618 value->store != store_local &&
2619 value->store != store_param)
2625 if (!vec_ir_value_find(self->living, value, NULL))
2626 vec_push(self->living, value);
2627 /* reading adds the full vector */
2628 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2629 vec_push(self->living, value->memberof);
2630 for (mem = 0; mem < 3; ++mem) {
2631 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2632 vec_push(self->living, value->members[mem]);
2636 /* PHI operands are always read operands */
2637 for (p = 0; p < vec_size(instr->phi); ++p)
2639 value = instr->phi[p].value;
2640 if (!vec_ir_value_find(self->living, value, NULL))
2641 vec_push(self->living, value);
2642 /* reading adds the full vector */
2643 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2644 vec_push(self->living, value->memberof);
2645 for (mem = 0; mem < 3; ++mem) {
2646 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2647 vec_push(self->living, value->members[mem]);
2651 /* on a call, all these values must be "locked" */
2652 if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2653 if (ir_block_living_lock(self))
2656 /* call params are read operands too */
2657 for (p = 0; p < vec_size(instr->params); ++p)
2659 value = instr->params[p];
2660 if (!vec_ir_value_find(self->living, value, NULL))
2661 vec_push(self->living, value);
2662 /* reading adds the full vector */
2663 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2664 vec_push(self->living, value->memberof);
2665 for (mem = 0; mem < 3; ++mem) {
2666 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2667 vec_push(self->living, value->members[mem]);
2672 tempbool = ir_block_living_add_instr(self, instr->eid);
2673 /*con_err( "living added values\n");*/
2674 *changed = *changed || tempbool;
2678 if (self->run_id == self->owner->run_id)
2681 self->run_id = self->owner->run_id;
2683 for (i = 0; i < vec_size(self->entries); ++i)
2685 ir_block *entry = self->entries[i];
2686 ir_block_life_propagate(entry, self, changed);
2692 /***********************************************************************
2695 * Since the IR has the convention of putting 'write' operands
2696 * at the beginning, we have to rotate the operands of instructions
2697 * properly in order to generate valid QCVM code.
2699 * Having destinations at a fixed position is more convenient. In QC
2700 * this is *mostly* OPC, but FTE adds at least 2 instructions which
2701 * read from from OPA, and store to OPB rather than OPC. Which is
2702 * partially the reason why the implementation of these instructions
2703 * in darkplaces has been delayed for so long.
2705 * Breaking conventions is annoying...
2707 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2709 static bool gen_global_field(ir_value *global)
2711 if (global->hasvalue)
2713 ir_value *fld = global->constval.vpointer;
2715 irerror(global->context, "Invalid field constant with no field: %s", global->name);
2719 /* copy the field's value */
2720 ir_value_code_setaddr(global, vec_size(code_globals));
2721 vec_push(code_globals, fld->code.fieldaddr);
2722 if (global->fieldtype == TYPE_VECTOR) {
2723 vec_push(code_globals, fld->code.fieldaddr+1);
2724 vec_push(code_globals, fld->code.fieldaddr+2);
2729 ir_value_code_setaddr(global, vec_size(code_globals));
2730 vec_push(code_globals, 0);
2731 if (global->fieldtype == TYPE_VECTOR) {
2732 vec_push(code_globals, 0);
2733 vec_push(code_globals, 0);
2736 if (global->code.globaladdr < 0)
2741 static bool gen_global_pointer(ir_value *global)
2743 if (global->hasvalue)
2745 ir_value *target = global->constval.vpointer;
2747 irerror(global->context, "Invalid pointer constant: %s", global->name);
2748 /* NULL pointers are pointing to the NULL constant, which also
2749 * sits at address 0, but still has an ir_value for itself.
2754 /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2755 * void() foo; <- proto
2756 * void() *fooptr = &foo;
2757 * void() foo = { code }
2759 if (!target->code.globaladdr) {
2760 /* FIXME: Check for the constant nullptr ir_value!
2761 * because then code.globaladdr being 0 is valid.
2763 irerror(global->context, "FIXME: Relocation support");
2767 ir_value_code_setaddr(global, vec_size(code_globals));
2768 vec_push(code_globals, target->code.globaladdr);
2772 ir_value_code_setaddr(global, vec_size(code_globals));
2773 vec_push(code_globals, 0);
2775 if (global->code.globaladdr < 0)
2780 static bool gen_blocks_recursive(ir_function *func, ir_block *block)
2782 prog_section_statement stmt;
2791 block->generated = true;
2792 block->code_start = vec_size(code_statements);
2793 for (i = 0; i < vec_size(block->instr); ++i)
2795 instr = block->instr[i];
2797 if (instr->opcode == VINSTR_PHI) {
2798 irerror(block->context, "cannot generate virtual instruction (phi)");
2802 if (instr->opcode == VINSTR_JUMP) {
2803 target = instr->bops[0];
2804 /* for uncoditional jumps, if the target hasn't been generated
2805 * yet, we generate them right here.
2807 if (!target->generated) {
2812 /* otherwise we generate a jump instruction */
2813 stmt.opcode = INSTR_GOTO;
2814 stmt.o1.s1 = (target->code_start) - vec_size(code_statements);
2817 if (stmt.o1.s1 != 1)
2818 code_push_statement(&stmt, instr->context.line);
2820 /* no further instructions can be in this block */
2824 if (instr->opcode == VINSTR_COND) {
2825 ontrue = instr->bops[0];
2826 onfalse = instr->bops[1];
2827 /* TODO: have the AST signal which block should
2828 * come first: eg. optimize IFs without ELSE...
2831 stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
2835 if (ontrue->generated) {
2836 stmt.opcode = INSTR_IF;
2837 stmt.o2.s1 = (ontrue->code_start) - vec_size(code_statements);
2838 if (stmt.o2.s1 != 1)
2839 code_push_statement(&stmt, instr->context.line);
2841 if (onfalse->generated) {
2842 stmt.opcode = INSTR_IFNOT;
2843 stmt.o2.s1 = (onfalse->code_start) - vec_size(code_statements);
2844 if (stmt.o2.s1 != 1)
2845 code_push_statement(&stmt, instr->context.line);
2847 if (!ontrue->generated) {
2848 if (onfalse->generated) {
2853 if (!onfalse->generated) {
2854 if (ontrue->generated) {
2859 /* neither ontrue nor onfalse exist */
2860 stmt.opcode = INSTR_IFNOT;
2861 if (!instr->likely) {
2862 /* Honor the likelyhood hint */
2863 ir_block *tmp = onfalse;
2864 stmt.opcode = INSTR_IF;
2868 stidx = vec_size(code_statements);
2869 code_push_statement(&stmt, instr->context.line);
2870 /* on false we jump, so add ontrue-path */
2871 if (!gen_blocks_recursive(func, ontrue))
2873 /* fixup the jump address */
2874 code_statements[stidx].o2.s1 = vec_size(code_statements) - stidx;
2875 /* generate onfalse path */
2876 if (onfalse->generated) {
2877 /* fixup the jump address */
2878 code_statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
2879 if (code_statements[stidx].o2.s1 == 1) {
2880 code_statements[stidx] = code_statements[stidx+1];
2881 if (code_statements[stidx].o1.s1 < 0)
2882 code_statements[stidx].o1.s1++;
2883 code_pop_statement();
2885 stmt.opcode = vec_last(code_statements).opcode;
2886 if (stmt.opcode == INSTR_GOTO ||
2887 stmt.opcode == INSTR_IF ||
2888 stmt.opcode == INSTR_IFNOT ||
2889 stmt.opcode == INSTR_RETURN ||
2890 stmt.opcode == INSTR_DONE)
2892 /* no use jumping from here */
2895 /* may have been generated in the previous recursive call */
2896 stmt.opcode = INSTR_GOTO;
2897 stmt.o1.s1 = (onfalse->code_start) - vec_size(code_statements);
2900 if (stmt.o1.s1 != 1)
2901 code_push_statement(&stmt, instr->context.line);
2904 else if (code_statements[stidx].o2.s1 == 1) {
2905 code_statements[stidx] = code_statements[stidx+1];
2906 if (code_statements[stidx].o1.s1 < 0)
2907 code_statements[stidx].o1.s1++;
2908 code_pop_statement();
2910 /* if not, generate now */
2915 if ( (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8)
2916 || instr->opcode == VINSTR_NRCALL)
2921 first = vec_size(instr->params);
2924 for (p = 0; p < first; ++p)
2926 ir_value *param = instr->params[p];
2927 if (param->callparam)
2930 stmt.opcode = INSTR_STORE_F;
2933 if (param->vtype == TYPE_FIELD)
2934 stmt.opcode = field_store_instr[param->fieldtype];
2935 else if (param->vtype == TYPE_NIL)
2936 stmt.opcode = INSTR_STORE_V;
2938 stmt.opcode = type_store_instr[param->vtype];
2939 stmt.o1.u1 = ir_value_code_addr(param);
2940 stmt.o2.u1 = OFS_PARM0 + 3 * p;
2941 code_push_statement(&stmt, instr->context.line);
2943 /* Now handle extparams */
2944 first = vec_size(instr->params);
2945 for (; p < first; ++p)
2947 ir_builder *ir = func->owner;
2948 ir_value *param = instr->params[p];
2949 ir_value *targetparam;
2951 if (param->callparam)
2954 if (p-8 >= vec_size(ir->extparams))
2955 ir_gen_extparam(ir);
2957 targetparam = ir->extparams[p-8];
2959 stmt.opcode = INSTR_STORE_F;
2962 if (param->vtype == TYPE_FIELD)
2963 stmt.opcode = field_store_instr[param->fieldtype];
2964 else if (param->vtype == TYPE_NIL)
2965 stmt.opcode = INSTR_STORE_V;
2967 stmt.opcode = type_store_instr[param->vtype];
2968 stmt.o1.u1 = ir_value_code_addr(param);
2969 stmt.o2.u1 = ir_value_code_addr(targetparam);
2970 code_push_statement(&stmt, instr->context.line);
2973 stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
2974 if (stmt.opcode > INSTR_CALL8)
2975 stmt.opcode = INSTR_CALL8;
2976 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
2979 code_push_statement(&stmt, instr->context.line);
2981 retvalue = instr->_ops[0];
2982 if (retvalue && retvalue->store != store_return &&
2983 (retvalue->store == store_global || vec_size(retvalue->life)))
2985 /* not to be kept in OFS_RETURN */
2986 if (retvalue->vtype == TYPE_FIELD && OPTS_FLAG(ADJUST_VECTOR_FIELDS))
2987 stmt.opcode = field_store_instr[retvalue->fieldtype];
2989 stmt.opcode = type_store_instr[retvalue->vtype];
2990 stmt.o1.u1 = OFS_RETURN;
2991 stmt.o2.u1 = ir_value_code_addr(retvalue);
2993 code_push_statement(&stmt, instr->context.line);
2998 if (instr->opcode == INSTR_STATE) {
2999 irerror(block->context, "TODO: state instruction");
3003 stmt.opcode = instr->opcode;
3008 /* This is the general order of operands */
3010 stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
3013 stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
3016 stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
3018 if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
3020 stmt.o1.u1 = stmt.o3.u1;
3023 else if ((stmt.opcode >= INSTR_STORE_F &&
3024 stmt.opcode <= INSTR_STORE_FNC) ||
3025 (stmt.opcode >= INSTR_STOREP_F &&
3026 stmt.opcode <= INSTR_STOREP_FNC))
3028 /* 2-operand instructions with A -> B */
3029 stmt.o2.u1 = stmt.o3.u1;
3032 /* tiny optimization, don't output
3035 if (stmt.o2.u1 == stmt.o1.u1 &&
3036 OPTS_OPTIMIZATION(OPTIM_PEEPHOLE))
3038 ++opts_optimizationcount[OPTIM_PEEPHOLE];
3043 code_push_statement(&stmt, instr->context.line);
3048 static bool gen_function_code(ir_function *self)
3051 prog_section_statement stmt, *retst;
3053 /* Starting from entry point, we generate blocks "as they come"
3054 * for now. Dead blocks will not be translated obviously.
3056 if (!vec_size(self->blocks)) {
3057 irerror(self->context, "Function '%s' declared without body.", self->name);
3061 block = self->blocks[0];
3062 if (block->generated)
3065 if (!gen_blocks_recursive(self, block)) {
3066 irerror(self->context, "failed to generate blocks for '%s'", self->name);
3070 /* code_write and qcvm -disasm need to know that the function ends here */
3071 retst = &vec_last(code_statements);
3072 if (OPTS_OPTIMIZATION(OPTIM_VOID_RETURN) &&
3073 self->outtype == TYPE_VOID &&
3074 retst->opcode == INSTR_RETURN &&
3075 !retst->o1.u1 && !retst->o2.u1 && !retst->o3.u1)
3077 retst->opcode = INSTR_DONE;
3078 ++opts_optimizationcount[OPTIM_VOID_RETURN];
3080 stmt.opcode = INSTR_DONE;
3084 code_push_statement(&stmt, vec_last(code_linenums));
3089 static qcint ir_builder_filestring(ir_builder *ir, const char *filename)
3091 /* NOTE: filename pointers are copied, we never strdup them,
3092 * thus we can use pointer-comparison to find the string.
3097 for (i = 0; i < vec_size(ir->filenames); ++i) {
3098 if (ir->filenames[i] == filename)
3099 return ir->filestrings[i];
3102 str = code_genstring(filename);
3103 vec_push(ir->filenames, filename);
3104 vec_push(ir->filestrings, str);
3108 static bool gen_global_function(ir_builder *ir, ir_value *global)
3110 prog_section_function fun;
3115 if (!global->hasvalue || (!global->constval.vfunc))
3117 irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
3121 irfun = global->constval.vfunc;
3123 fun.name = global->code.name;
3124 fun.file = ir_builder_filestring(ir, global->context.file);
3125 fun.profile = 0; /* always 0 */
3126 fun.nargs = vec_size(irfun->params);
3130 for (i = 0;i < 8; ++i) {
3131 if ((int32_t)i >= fun.nargs)
3134 fun.argsize[i] = type_sizeof_[irfun->params[i]];
3138 fun.locals = irfun->allocated_locals;
3141 fun.entry = irfun->builtin+1;
3143 irfun->code_function_def = vec_size(code_functions);
3144 fun.entry = vec_size(code_statements);
3147 vec_push(code_functions, fun);
3151 static ir_value* ir_gen_extparam_proto(ir_builder *ir)
3156 snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparam_protos)+8));
3157 global = ir_value_var(name, store_global, TYPE_VECTOR);
3159 vec_push(ir->extparam_protos, global);
3163 static void ir_gen_extparam(ir_builder *ir)
3165 prog_section_def def;
3168 if (vec_size(ir->extparam_protos) < vec_size(ir->extparams)+1)
3169 global = ir_gen_extparam_proto(ir);
3171 global = ir->extparam_protos[vec_size(ir->extparams)];
3173 def.name = code_genstring(global->name);
3174 def.type = TYPE_VECTOR;
3175 def.offset = vec_size(code_globals);
3177 vec_push(code_defs, def);
3178 ir_value_code_setaddr(global, def.offset);
3179 vec_push(code_globals, 0);
3180 vec_push(code_globals, 0);
3181 vec_push(code_globals, 0);
3183 vec_push(ir->extparams, global);
3186 static bool gen_function_extparam_copy(ir_function *self)
3188 size_t i, ext, numparams;
3190 ir_builder *ir = self->owner;
3192 prog_section_statement stmt;
3194 numparams = vec_size(self->params);
3198 stmt.opcode = INSTR_STORE_F;
3200 for (i = 8; i < numparams; ++i) {
3202 if (ext >= vec_size(ir->extparams))
3203 ir_gen_extparam(ir);
3205 ep = ir->extparams[ext];
3207 stmt.opcode = type_store_instr[self->locals[i]->vtype];
3208 if (self->locals[i]->vtype == TYPE_FIELD &&
3209 self->locals[i]->fieldtype == TYPE_VECTOR)
3211 stmt.opcode = INSTR_STORE_V;
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.g || !OPTS_OPTIMIZATION(OPTIM_OVERLAP_LOCALS) || (irfun->flags & IR_FLAG_MASK_NO_OVERLAP))
3232 firstlocal = def->firstlocal = vec_size(code_globals);
3234 firstlocal = def->firstlocal = ir->first_common_local;
3235 ++opts_optimizationcount[OPTIM_OVERLAP_LOCALS];
3238 firstglobal = (OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS) ? ir->first_common_globaltemp : firstlocal);
3240 for (i = vec_size(code_globals); i < firstlocal + irfun->allocated_locals; ++i)
3241 vec_push(code_globals, 0);
3242 for (i = 0; i < vec_size(irfun->locals); ++i) {
3243 ir_value *v = irfun->locals[i];
3244 if (v->locked || !OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS)) {
3245 ir_value_code_setaddr(v, firstlocal + v->code.local);
3246 if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3247 irerror(irfun->locals[i]->context, "failed to generate local %s", irfun->locals[i]->name);
3252 ir_value_code_setaddr(v, firstglobal + v->code.local);
3254 for (i = 0; i < vec_size(irfun->values); ++i)
3256 ir_value *v = irfun->values[i];
3260 ir_value_code_setaddr(v, firstlocal + v->code.local);
3262 ir_value_code_setaddr(v, firstglobal + v->code.local);
3267 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
3269 prog_section_function *fundef;
3274 irfun = global->constval.vfunc;
3276 if (global->cvq == CV_NONE) {
3277 irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
3278 "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
3280 /* this was a function pointer, don't generate code for those */
3287 if (irfun->code_function_def < 0) {
3288 irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
3291 fundef = &code_functions[irfun->code_function_def];
3293 fundef->entry = vec_size(code_statements);
3294 if (!gen_function_locals(ir, global)) {
3295 irerror(irfun->context, "Failed to generate locals for function %s", irfun->name);
3298 if (!gen_function_extparam_copy(irfun)) {
3299 irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
3302 if (!gen_function_code(irfun)) {
3303 irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
3309 static void gen_vector_defs(prog_section_def def, const char *name)
3314 if (!name || name[0] == '#' || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3317 def.type = TYPE_FLOAT;
3321 component = (char*)mem_a(len+3);
3322 memcpy(component, name, len);
3324 component[len-0] = 0;
3325 component[len-2] = '_';
3327 component[len-1] = 'x';
3329 for (i = 0; i < 3; ++i) {
3330 def.name = code_genstring(component);
3331 vec_push(code_defs, def);
3337 static void gen_vector_fields(prog_section_field fld, const char *name)
3342 if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3345 fld.type = TYPE_FLOAT;
3349 component = (char*)mem_a(len+3);
3350 memcpy(component, name, len);
3352 component[len-0] = 0;
3353 component[len-2] = '_';
3355 component[len-1] = 'x';
3357 for (i = 0; i < 3; ++i) {
3358 fld.name = code_genstring(component);
3359 vec_push(code_fields, fld);
3365 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
3369 prog_section_def def;
3370 bool pushdef = false;
3372 def.type = global->vtype;
3373 def.offset = vec_size(code_globals);
3375 if (opts.g || !islocal)
3379 if (OPTS_OPTIMIZATION(OPTIM_STRIP_CONSTANT_NAMES) &&
3380 (global->name[0] == '#' || global->cvq == CV_CONST))
3385 if (pushdef && global->name) {
3386 if (global->name[0] == '#') {
3387 if (!self->str_immediate)
3388 self->str_immediate = code_genstring("IMMEDIATE");
3389 def.name = global->code.name = self->str_immediate;
3392 def.name = global->code.name = code_genstring(global->name);
3397 def.offset = ir_value_code_addr(global);
3398 vec_push(code_defs, def);
3399 if (global->vtype == TYPE_VECTOR)
3400 gen_vector_defs(def, global->name);
3401 else if (global->vtype == TYPE_FIELD && global->fieldtype == TYPE_VECTOR)
3402 gen_vector_defs(def, global->name);
3409 switch (global->vtype)
3412 if (!strcmp(global->name, "end_sys_globals")) {
3413 /* TODO: remember this point... all the defs before this one
3414 * should be checksummed and added to progdefs.h when we generate it.
3417 else if (!strcmp(global->name, "end_sys_fields")) {
3418 /* TODO: same as above but for entity-fields rather than globsl
3422 irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
3424 /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
3425 * the system fields actually go? Though the engine knows this anyway...
3426 * Maybe this could be an -foption
3427 * fteqcc creates data for end_sys_* - of size 1, so let's do the same
3429 ir_value_code_setaddr(global, vec_size(code_globals));
3430 vec_push(code_globals, 0);
3432 if (pushdef) vec_push(code_defs, def);
3435 if (pushdef) vec_push(code_defs, def);
3436 return gen_global_pointer(global);
3439 vec_push(code_defs, def);
3440 if (global->fieldtype == TYPE_VECTOR)
3441 gen_vector_defs(def, global->name);
3443 return gen_global_field(global);
3448 ir_value_code_setaddr(global, vec_size(code_globals));
3449 if (global->hasvalue) {
3450 iptr = (int32_t*)&global->constval.ivec[0];
3451 vec_push(code_globals, *iptr);
3453 vec_push(code_globals, 0);
3455 if (!islocal && global->cvq != CV_CONST)
3456 def.type |= DEF_SAVEGLOBAL;
3457 if (pushdef) vec_push(code_defs, def);
3459 return global->code.globaladdr >= 0;
3463 ir_value_code_setaddr(global, vec_size(code_globals));
3464 if (global->hasvalue) {
3465 vec_push(code_globals, code_genstring(global->constval.vstring));
3467 vec_push(code_globals, 0);
3469 if (!islocal && global->cvq != CV_CONST)
3470 def.type |= DEF_SAVEGLOBAL;
3471 if (pushdef) vec_push(code_defs, def);
3472 return global->code.globaladdr >= 0;
3477 ir_value_code_setaddr(global, vec_size(code_globals));
3478 if (global->hasvalue) {
3479 iptr = (int32_t*)&global->constval.ivec[0];
3480 vec_push(code_globals, iptr[0]);
3481 if (global->code.globaladdr < 0)
3483 for (d = 1; d < type_sizeof_[global->vtype]; ++d) {
3484 vec_push(code_globals, iptr[d]);
3487 vec_push(code_globals, 0);
3488 if (global->code.globaladdr < 0)
3490 for (d = 1; d < type_sizeof_[global->vtype]; ++d) {
3491 vec_push(code_globals, 0);
3494 if (!islocal && global->cvq != CV_CONST)
3495 def.type |= DEF_SAVEGLOBAL;
3498 vec_push(code_defs, def);
3499 def.type &= ~DEF_SAVEGLOBAL;
3500 gen_vector_defs(def, global->name);
3502 return global->code.globaladdr >= 0;
3505 ir_value_code_setaddr(global, vec_size(code_globals));
3506 if (!global->hasvalue) {
3507 vec_push(code_globals, 0);
3508 if (global->code.globaladdr < 0)
3511 vec_push(code_globals, vec_size(code_functions));
3512 if (!gen_global_function(self, global))
3515 if (!islocal && global->cvq != CV_CONST)
3516 def.type |= DEF_SAVEGLOBAL;
3517 if (pushdef) vec_push(code_defs, def);
3520 /* assume biggest type */
3521 ir_value_code_setaddr(global, vec_size(code_globals));
3522 vec_push(code_globals, 0);
3523 for (i = 1; i < type_sizeof_[TYPE_VARIANT]; ++i)
3524 vec_push(code_globals, 0);
3527 /* refuse to create 'void' type or any other fancy business. */
3528 irerror(global->context, "Invalid type for global variable `%s`: %s",
3529 global->name, type_name[global->vtype]);
3534 static void ir_builder_prepare_field(ir_value *field)
3536 field->code.fieldaddr = code_alloc_field(type_sizeof_[field->fieldtype]);
3539 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
3541 prog_section_def def;
3542 prog_section_field fld;
3546 def.type = (uint16_t)field->vtype;
3547 def.offset = (uint16_t)vec_size(code_globals);
3549 /* create a global named the same as the field */
3550 if (opts.standard == COMPILER_GMQCC) {
3551 /* in our standard, the global gets a dot prefix */
3552 size_t len = strlen(field->name);
3555 /* we really don't want to have to allocate this, and 1024
3556 * bytes is more than enough for a variable/field name
3558 if (len+2 >= sizeof(name)) {
3559 irerror(field->context, "invalid field name size: %u", (unsigned int)len);
3564 memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
3567 def.name = code_genstring(name);
3568 fld.name = def.name + 1; /* we reuse that string table entry */
3570 /* in plain QC, there cannot be a global with the same name,
3571 * and so we also name the global the same.
3572 * FIXME: fteqcc should create a global as well
3573 * check if it actually uses the same name. Probably does
3575 def.name = code_genstring(field->name);
3576 fld.name = def.name;
3579 field->code.name = def.name;
3581 vec_push(code_defs, def);
3583 fld.type = field->fieldtype;
3585 if (fld.type == TYPE_VOID) {
3586 irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3590 fld.offset = field->code.fieldaddr;
3592 vec_push(code_fields, fld);
3594 ir_value_code_setaddr(field, vec_size(code_globals));
3595 vec_push(code_globals, fld.offset);
3596 if (fld.type == TYPE_VECTOR) {
3597 vec_push(code_globals, fld.offset+1);
3598 vec_push(code_globals, fld.offset+2);
3601 if (field->fieldtype == TYPE_VECTOR) {
3602 gen_vector_defs(def, field->name);
3603 gen_vector_fields(fld, field->name);
3606 return field->code.globaladdr >= 0;
3609 bool ir_builder_generate(ir_builder *self, const char *filename)
3611 prog_section_statement stmt;
3613 char *lnofile = NULL;
3617 for (i = 0; i < vec_size(self->fields); ++i)
3619 ir_builder_prepare_field(self->fields[i]);
3622 for (i = 0; i < vec_size(self->globals); ++i)
3624 if (!ir_builder_gen_global(self, self->globals[i], false)) {
3627 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3628 ir_function *func = self->globals[i]->constval.vfunc;
3629 if (func && self->max_locals < func->allocated_locals &&
3630 !(func->flags & IR_FLAG_MASK_NO_OVERLAP))
3632 self->max_locals = func->allocated_locals;
3634 if (func && self->max_globaltemps < func->globaltemps)
3635 self->max_globaltemps = func->globaltemps;
3639 for (i = 0; i < vec_size(self->fields); ++i)
3641 if (!ir_builder_gen_field(self, self->fields[i])) {
3647 ir_value_code_setaddr(self->nil, vec_size(code_globals));
3648 vec_push(code_globals, 0);
3649 vec_push(code_globals, 0);
3650 vec_push(code_globals, 0);
3652 /* generate global temps */
3653 self->first_common_globaltemp = vec_size(code_globals);
3654 for (i = 0; i < self->max_globaltemps; ++i) {
3655 vec_push(code_globals, 0);
3657 /* generate common locals */
3658 self->first_common_local = vec_size(code_globals);
3659 for (i = 0; i < self->max_locals; ++i) {
3660 vec_push(code_globals, 0);
3663 /* generate function code */
3664 for (i = 0; i < vec_size(self->globals); ++i)
3666 if (self->globals[i]->vtype == TYPE_FUNCTION) {
3667 if (!gen_global_function_code(self, self->globals[i])) {
3673 if (vec_size(code_globals) >= 65536) {
3674 irerror(vec_last(self->globals)->context, "This progs file would require more globals than the metadata can handle. Bailing out.");
3678 /* DP errors if the last instruction is not an INSTR_DONE. */
3679 if (vec_last(code_statements).opcode != INSTR_DONE)
3681 stmt.opcode = INSTR_DONE;
3685 code_push_statement(&stmt, vec_last(code_linenums));
3691 if (vec_size(code_statements) != vec_size(code_linenums)) {
3692 con_err("Linecounter wrong: %lu != %lu\n",
3693 (unsigned long)vec_size(code_statements),
3694 (unsigned long)vec_size(code_linenums));
3695 } else if (OPTS_FLAG(LNO)) {
3697 size_t filelen = strlen(filename);
3699 memcpy(vec_add(lnofile, filelen+1), filename, filelen+1);
3700 dot = strrchr(lnofile, '.');
3704 vec_shrinkto(lnofile, dot - lnofile);
3706 memcpy(vec_add(lnofile, 5), ".lno", 5);
3711 con_out("writing '%s' and '%s'...\n", filename, lnofile);
3713 con_out("writing '%s'\n", filename);
3715 if (!code_write(filename, lnofile)) {
3723 /***********************************************************************
3724 *IR DEBUG Dump functions...
3727 #define IND_BUFSZ 1024
3730 # define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
3733 const char *qc_opname(int op)
3735 if (op < 0) return "<INVALID>";
3736 if (op < (int)( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
3737 return asm_instr[op].m;
3739 case VINSTR_PHI: return "PHI";
3740 case VINSTR_JUMP: return "JUMP";
3741 case VINSTR_COND: return "COND";
3742 default: return "<UNK>";
3746 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
3749 char indent[IND_BUFSZ];
3753 oprintf("module %s\n", b->name);
3754 for (i = 0; i < vec_size(b->globals); ++i)
3757 if (b->globals[i]->hasvalue)
3758 oprintf("%s = ", b->globals[i]->name);
3759 ir_value_dump(b->globals[i], oprintf);
3762 for (i = 0; i < vec_size(b->functions); ++i)
3763 ir_function_dump(b->functions[i], indent, oprintf);
3764 oprintf("endmodule %s\n", b->name);
3767 void ir_function_dump(ir_function *f, char *ind,
3768 int (*oprintf)(const char*, ...))
3771 if (f->builtin != 0) {
3772 oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
3775 oprintf("%sfunction %s\n", ind, f->name);
3776 strncat(ind, "\t", IND_BUFSZ);
3777 if (vec_size(f->locals))
3779 oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
3780 for (i = 0; i < vec_size(f->locals); ++i) {
3781 oprintf("%s\t", ind);
3782 ir_value_dump(f->locals[i], oprintf);
3786 oprintf("%sliferanges:\n", ind);
3787 for (i = 0; i < vec_size(f->locals); ++i) {
3788 const char *attr = "";
3790 ir_value *v = f->locals[i];
3791 if (v->unique_life && v->locked)
3792 attr = "unique,locked ";
3793 else if (v->unique_life)
3797 oprintf("%s\t%s: %s %s@%i ", ind, v->name, type_name[v->vtype], attr, (int)v->code.local);
3798 for (l = 0; l < vec_size(v->life); ++l) {
3799 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3802 for (m = 0; m < 3; ++m) {
3803 ir_value *vm = v->members[m];
3806 if (vm->unique_life && vm->locked)
3807 attr = "unique,locked ";
3808 else if (vm->unique_life)
3810 else if (vm->locked)
3812 oprintf("%s\t%s: %s@%i ", ind, vm->name, attr, (int)vm->code.local);
3813 for (l = 0; l < vec_size(vm->life); ++l) {
3814 oprintf("[%i,%i] ", vm->life[l].start, vm->life[l].end);
3819 for (i = 0; i < vec_size(f->values); ++i) {
3820 const char *attr = "";
3822 ir_value *v = f->values[i];
3823 if (v->unique_life && v->locked)
3824 attr = "unique,locked ";
3825 else if (v->unique_life)
3829 oprintf("%s\t%s: %s %s@%i ", ind, v->name, type_name[v->vtype], attr, (int)v->code.local);
3830 for (l = 0; l < vec_size(v->life); ++l) {
3831 oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
3834 for (m = 0; m < 3; ++m) {
3835 ir_value *vm = v->members[m];
3838 if (vm->unique_life && vm->locked)
3839 attr = "unique,locked ";
3840 else if (vm->unique_life)
3842 else if (vm->locked)
3844 oprintf("%s\t%s: %s@%i ", ind, vm->name, attr, (int)vm->code.local);
3845 for (l = 0; l < vec_size(vm->life); ++l) {
3846 oprintf("[%i,%i] ", vm->life[l].start, vm->life[l].end);
3851 if (vec_size(f->blocks))
3853 oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
3854 for (i = 0; i < vec_size(f->blocks); ++i) {
3855 if (f->blocks[i]->run_id != f->run_id) {
3856 oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
3858 ir_block_dump(f->blocks[i], ind, oprintf);
3862 ind[strlen(ind)-1] = 0;
3863 oprintf("%sendfunction %s\n", ind, f->name);
3866 void ir_block_dump(ir_block* b, char *ind,
3867 int (*oprintf)(const char*, ...))
3870 oprintf("%s:%s\n", ind, b->label);
3871 strncat(ind, "\t", IND_BUFSZ);
3873 for (i = 0; i < vec_size(b->instr); ++i)
3874 ir_instr_dump(b->instr[i], ind, oprintf);
3875 ind[strlen(ind)-1] = 0;
3878 void dump_phi(ir_instr *in, int (*oprintf)(const char*, ...))
3881 oprintf("%s <- phi ", in->_ops[0]->name);
3882 for (i = 0; i < vec_size(in->phi); ++i)
3884 oprintf("([%s] : %s) ", in->phi[i].from->label,
3885 in->phi[i].value->name);
3890 void ir_instr_dump(ir_instr *in, char *ind,
3891 int (*oprintf)(const char*, ...))
3894 const char *comma = NULL;
3896 oprintf("%s (%i) ", ind, (int)in->eid);
3898 if (in->opcode == VINSTR_PHI) {
3899 dump_phi(in, oprintf);
3903 strncat(ind, "\t", IND_BUFSZ);
3905 if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
3906 ir_value_dump(in->_ops[0], oprintf);
3907 if (in->_ops[1] || in->_ops[2])
3910 if (in->opcode == INSTR_CALL0 || in->opcode == VINSTR_NRCALL) {
3911 oprintf("CALL%i\t", vec_size(in->params));
3913 oprintf("%s\t", qc_opname(in->opcode));
3915 if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
3916 ir_value_dump(in->_ops[0], oprintf);
3921 for (i = 1; i != 3; ++i) {
3925 ir_value_dump(in->_ops[i], oprintf);
3933 oprintf("[%s]", in->bops[0]->label);
3937 oprintf("%s[%s]", comma, in->bops[1]->label);
3938 if (vec_size(in->params)) {
3939 oprintf("\tparams: ");
3940 for (i = 0; i != vec_size(in->params); ++i) {
3941 oprintf("%s, ", in->params[i]->name);
3945 ind[strlen(ind)-1] = 0;
3948 void ir_value_dump_string(const char *str, int (*oprintf)(const char*, ...))
3951 for (; *str; ++str) {
3953 case '\n': oprintf("\\n"); break;
3954 case '\r': oprintf("\\r"); break;
3955 case '\t': oprintf("\\t"); break;
3956 case '\v': oprintf("\\v"); break;
3957 case '\f': oprintf("\\f"); break;
3958 case '\b': oprintf("\\b"); break;
3959 case '\a': oprintf("\\a"); break;
3960 case '\\': oprintf("\\\\"); break;
3961 case '"': oprintf("\\\""); break;
3962 default: oprintf("%c", *str); break;
3968 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
3977 oprintf("fn:%s", v->name);
3980 oprintf("%g", v->constval.vfloat);
3983 oprintf("'%g %g %g'",
3986 v->constval.vvec.z);
3989 oprintf("(entity)");
3992 ir_value_dump_string(v->constval.vstring, oprintf);
3996 oprintf("%i", v->constval.vint);
4001 v->constval.vpointer->name);
4005 oprintf("%s", v->name);
4009 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
4012 oprintf("Life of %12s:", self->name);
4013 for (i = 0; i < vec_size(self->life); ++i)
4015 oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);