+ return ir_value_life_insert(self, i, new_entry);
+}
+
+bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
+{
+ size_t i, myi;
+
+ if (!vec_size(other->life))
+ return true;
+
+ if (!vec_size(self->life)) {
+ size_t count = vec_size(other->life);
+ ir_life_entry_t *life = vec_add(self->life, count);
+ memcpy(life, other->life, count * sizeof(*life));
+ return true;
+ }
+
+ myi = 0;
+ for (i = 0; i < vec_size(other->life); ++i)
+ {
+ const ir_life_entry_t *life = &other->life[i];
+ while (true)
+ {
+ ir_life_entry_t *entry = &self->life[myi];
+
+ if (life->end+1 < entry->start)
+ {
+ /* adding an interval before entry */
+ if (!ir_value_life_insert(self, myi, *life))
+ return false;
+ ++myi;
+ break;
+ }
+
+ if (life->start < entry->start &&
+ life->end+1 >= entry->start)
+ {
+ /* starts earlier and overlaps */
+ entry->start = life->start;
+ }
+
+ if (life->end > entry->end &&
+ life->start <= entry->end+1)
+ {
+ /* ends later and overlaps */
+ entry->end = life->end;
+ }
+
+ /* see if our change combines it with the next ranges */
+ while (myi+1 < vec_size(self->life) &&
+ entry->end+1 >= self->life[1+myi].start)
+ {
+ /* overlaps with (myi+1) */
+ if (entry->end < self->life[1+myi].end)
+ entry->end = self->life[1+myi].end;
+ vec_remove(self->life, myi+1, 1);
+ entry = &self->life[myi];
+ }
+
+ /* see if we're after the entry */
+ if (life->start > entry->end)
+ {
+ ++myi;
+ /* append if we're at the end */
+ if (myi >= vec_size(self->life)) {
+ vec_push(self->life, *life);
+ break;
+ }
+ /* otherweise check the next range */
+ continue;
+ }
+ break;
+ }
+ }
+ return true;
+}
+
+bool ir_values_overlap(const ir_value *a, const ir_value *b)
+{
+ /* For any life entry in A see if it overlaps with
+ * any life entry in B.
+ * Note that the life entries are orderes, so we can make a
+ * more efficient algorithm there than naively translating the
+ * statement above.
+ */
+
+ ir_life_entry_t *la, *lb, *enda, *endb;
+
+ /* first of all, if either has no life range, they cannot clash */
+ if (!vec_size(a->life) || !vec_size(b->life))
+ return false;
+
+ la = a->life;
+ lb = b->life;
+ enda = la + vec_size(a->life);
+ endb = lb + vec_size(b->life);
+ while (true)
+ {
+ /* check if the entries overlap, for that,
+ * both must start before the other one ends.
+ */
+ if (la->start < lb->end &&
+ lb->start < la->end)
+ {
+ return true;
+ }
+
+ /* entries are ordered
+ * one entry is earlier than the other
+ * that earlier entry will be moved forward
+ */
+ if (la->start < lb->start)
+ {
+ /* order: A B, move A forward
+ * check if we hit the end with A
+ */
+ if (++la == enda)
+ break;
+ }
+ else /* if (lb->start < la->start) actually <= */
+ {
+ /* order: B A, move B forward
+ * check if we hit the end with B
+ */
+ if (++lb == endb)
+ break;
+ }
+ }
+ return false;
+}
+
+/***********************************************************************
+ *IR main operations
+ */
+
+bool ir_block_create_store_op(ir_block *self, int op, ir_value *target, ir_value *what)
+{
+ ir_instr *in = ir_instr_new(self, op);
+ if (!in)
+ return false;
+
+ if (target->store == store_value &&
+ (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
+ {
+ irerror(self->context, "cannot store to an SSA value");
+ irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
+ irerror(self->context, "instruction: %s", asm_instr[op].m);
+ return false;
+ }
+
+ if (!ir_instr_op(in, 0, target, true) ||
+ !ir_instr_op(in, 1, what, false))
+ {
+ return false;
+ }
+ vec_push(self->instr, in);
+ return true;
+}
+
+bool ir_block_create_store(ir_block *self, ir_value *target, ir_value *what)
+{
+ int op = 0;
+ int vtype;
+ if (target->vtype == TYPE_VARIANT)
+ vtype = what->vtype;
+ else
+ vtype = target->vtype;
+
+#if 0
+ if (vtype == TYPE_FLOAT && what->vtype == TYPE_INTEGER)
+ op = INSTR_CONV_ITOF;
+ else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
+ op = INSTR_CONV_FTOI;
+#endif
+ op = type_store_instr[vtype];
+
+ if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
+ if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
+ op = INSTR_STORE_V;
+ }
+
+ return ir_block_create_store_op(self, op, target, what);
+}
+
+bool ir_block_create_storep(ir_block *self, ir_value *target, ir_value *what)
+{
+ int op = 0;
+ int vtype;
+
+ if (target->vtype != TYPE_POINTER)
+ return false;
+
+ /* storing using pointer - target is a pointer, type must be
+ * inferred from source
+ */
+ vtype = what->vtype;
+
+ op = type_storep_instr[vtype];
+ if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
+ if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
+ op = INSTR_STOREP_V;
+ }
+
+ return ir_block_create_store_op(self, op, target, what);
+}
+
+bool ir_block_create_return(ir_block *self, ir_value *v)
+{
+ ir_instr *in;
+ if (self->final) {
+ irerror(self->context, "block already ended (%s)", self->label);
+ return false;
+ }
+ self->final = true;
+ self->is_return = true;
+ in = ir_instr_new(self, INSTR_RETURN);
+ if (!in)
+ return false;
+
+ if (v && !ir_instr_op(in, 0, v, false))
+ return false;
+
+ vec_push(self->instr, in);
+ return true;
+}
+
+bool ir_block_create_if(ir_block *self, ir_value *v,
+ ir_block *ontrue, ir_block *onfalse)
+{
+ ir_instr *in;
+ if (self->final) {
+ irerror(self->context, "block already ended (%s)", self->label);
+ return false;
+ }
+ self->final = true;
+ /*in = ir_instr_new(self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
+ in = ir_instr_new(self, VINSTR_COND);
+ if (!in)
+ return false;
+
+ if (!ir_instr_op(in, 0, v, false)) {
+ ir_instr_delete(in);
+ return false;
+ }
+
+ in->bops[0] = ontrue;
+ in->bops[1] = onfalse;
+
+ vec_push(self->instr, in);
+
+ vec_push(self->exits, ontrue);
+ vec_push(self->exits, onfalse);
+ vec_push(ontrue->entries, self);
+ vec_push(onfalse->entries, self);
+ return true;
+}
+
+bool ir_block_create_jump(ir_block *self, ir_block *to)
+{
+ ir_instr *in;
+ if (self->final) {
+ irerror(self->context, "block already ended (%s)", self->label);
+ return false;
+ }
+ self->final = true;
+ in = ir_instr_new(self, VINSTR_JUMP);
+ if (!in)
+ return false;
+
+ in->bops[0] = to;
+ vec_push(self->instr, in);
+
+ vec_push(self->exits, to);
+ vec_push(to->entries, self);
+ return true;
+}
+
+bool ir_block_create_goto(ir_block *self, ir_block *to)
+{
+ ir_instr *in;
+ if (self->final) {
+ irerror(self->context, "block already ended (%s)", self->label);
+ return false;
+ }
+ self->final = true;
+ in = ir_instr_new(self, INSTR_GOTO);
+ if (!in)
+ return false;
+
+ in->bops[0] = to;
+ vec_push(self->instr, in);
+
+ vec_push(self->exits, to);
+ vec_push(to->entries, self);
+ return true;
+}
+
+ir_instr* ir_block_create_phi(ir_block *self, const char *label, int ot)
+{
+ ir_value *out;
+ ir_instr *in;
+ in = ir_instr_new(self, VINSTR_PHI);
+ if (!in)
+ return NULL;
+ out = ir_value_out(self->owner, label, store_value, ot);
+ if (!out) {
+ ir_instr_delete(in);
+ return NULL;
+ }
+ if (!ir_instr_op(in, 0, out, true)) {
+ ir_instr_delete(in);
+ ir_value_delete(out);
+ return NULL;
+ }
+ vec_push(self->instr, in);
+ return in;
+}
+
+ir_value* ir_phi_value(ir_instr *self)
+{
+ return self->_ops[0];
+}
+
+void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
+{
+ ir_phi_entry_t pe;
+
+ if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
+ /* Must not be possible to cause this, otherwise the AST
+ * is doing something wrong.
+ */
+ irerror(self->context, "Invalid entry block for PHI");
+ abort();
+ }
+
+ pe.value = v;
+ pe.from = b;
+ vec_push(v->reads, self);
+ vec_push(self->phi, pe);
+}
+
+/* call related code */
+ir_instr* ir_block_create_call(ir_block *self, const char *label, ir_value *func)
+{
+ ir_value *out;
+ ir_instr *in;
+ in = ir_instr_new(self, INSTR_CALL0);
+ if (!in)
+ return NULL;
+ out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
+ if (!out) {
+ ir_instr_delete(in);
+ return NULL;
+ }
+ if (!ir_instr_op(in, 0, out, true) ||
+ !ir_instr_op(in, 1, func, false))
+ {
+ ir_instr_delete(in);
+ ir_value_delete(out);
+ return NULL;
+ }
+ vec_push(self->instr, in);
+ return in;
+}
+
+ir_value* ir_call_value(ir_instr *self)
+{
+ return self->_ops[0];
+}
+
+void ir_call_param(ir_instr* self, ir_value *v)
+{
+ vec_push(self->params, v);
+ vec_push(v->reads, self);
+}
+
+/* binary op related code */
+
+ir_value* ir_block_create_binop(ir_block *self,
+ const char *label, int opcode,
+ ir_value *left, ir_value *right)
+{
+ int ot = TYPE_VOID;
+ switch (opcode) {
+ case INSTR_ADD_F:
+ case INSTR_SUB_F:
+ case INSTR_DIV_F:
+ case INSTR_MUL_F:
+ case INSTR_MUL_V:
+ case INSTR_AND:
+ case INSTR_OR:
+#if 0
+ case INSTR_AND_I:
+ case INSTR_AND_IF:
+ case INSTR_AND_FI:
+ case INSTR_OR_I:
+ case INSTR_OR_IF:
+ case INSTR_OR_FI:
+#endif
+ case INSTR_BITAND:
+ case INSTR_BITOR:
+#if 0
+ case INSTR_SUB_S: /* -- offset of string as float */
+ case INSTR_MUL_IF:
+ case INSTR_MUL_FI:
+ case INSTR_DIV_IF:
+ case INSTR_DIV_FI:
+ case INSTR_BITOR_IF:
+ case INSTR_BITOR_FI:
+ case INSTR_BITAND_FI:
+ case INSTR_BITAND_IF:
+ case INSTR_EQ_I:
+ case INSTR_NE_I:
+#endif
+ ot = TYPE_FLOAT;
+ break;
+#if 0
+ case INSTR_ADD_I:
+ case INSTR_ADD_IF:
+ case INSTR_ADD_FI:
+ case INSTR_SUB_I:
+ case INSTR_SUB_FI:
+ case INSTR_SUB_IF:
+ case INSTR_MUL_I:
+ case INSTR_DIV_I:
+ case INSTR_BITAND_I:
+ case INSTR_BITOR_I:
+ case INSTR_XOR_I:
+ case INSTR_RSHIFT_I:
+ case INSTR_LSHIFT_I:
+ ot = TYPE_INTEGER;
+ break;
+#endif
+ case INSTR_ADD_V:
+ case INSTR_SUB_V:
+ case INSTR_MUL_VF:
+ case INSTR_MUL_FV:
+#if 0
+ case INSTR_DIV_VF:
+ case INSTR_MUL_IV:
+ case INSTR_MUL_VI:
+#endif
+ ot = TYPE_VECTOR;
+ break;
+#if 0
+ case INSTR_ADD_SF:
+ ot = TYPE_POINTER;
+ break;
+#endif
+ default:
+ /* ranges: */
+ /* boolean operations result in floats */
+ if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
+ ot = TYPE_FLOAT;
+ else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
+ ot = TYPE_FLOAT;
+#if 0
+ else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
+ ot = TYPE_FLOAT;
+#endif
+ break;
+ };
+ if (ot == TYPE_VOID) {
+ /* The AST or parser were supposed to check this! */
+ return NULL;
+ }
+
+ return ir_block_create_general_instr(self, label, opcode, left, right, ot);
+}
+
+ir_value* ir_block_create_unary(ir_block *self,
+ const char *label, int opcode,
+ ir_value *operand)
+{
+ int ot = TYPE_FLOAT;
+ switch (opcode) {
+ case INSTR_NOT_F:
+ case INSTR_NOT_V:
+ case INSTR_NOT_S:
+ case INSTR_NOT_ENT:
+ case INSTR_NOT_FNC:
+#if 0
+ case INSTR_NOT_I:
+#endif
+ ot = TYPE_FLOAT;
+ break;
+ /* QC doesn't have other unary operations. We expect extensions to fill
+ * the above list, otherwise we assume out-type = in-type, eg for an
+ * unary minus
+ */
+ default:
+ ot = operand->vtype;
+ break;
+ };
+ if (ot == TYPE_VOID) {
+ /* The AST or parser were supposed to check this! */
+ return NULL;
+ }
+
+ /* let's use the general instruction creator and pass NULL for OPB */
+ return ir_block_create_general_instr(self, label, opcode, operand, NULL, ot);
+}
+
+ir_value* ir_block_create_general_instr(ir_block *self, const char *label,
+ int op, ir_value *a, ir_value *b, int outype)
+{
+ ir_instr *instr;
+ ir_value *out;
+
+ out = ir_value_out(self->owner, label, store_value, outype);
+ if (!out)
+ return NULL;
+
+ instr = ir_instr_new(self, op);
+ if (!instr) {
+ ir_value_delete(out);
+ return NULL;
+ }
+
+ if (!ir_instr_op(instr, 0, out, true) ||
+ !ir_instr_op(instr, 1, a, false) ||
+ !ir_instr_op(instr, 2, b, false) )
+ {
+ goto on_error;
+ }
+
+ vec_push(self->instr, instr);
+
+ return out;
+on_error:
+ ir_instr_delete(instr);
+ ir_value_delete(out);
+ return NULL;
+}
+
+ir_value* ir_block_create_fieldaddress(ir_block *self, const char *label, ir_value *ent, ir_value *field)
+{
+ ir_value *v;
+
+ /* Support for various pointer types todo if so desired */
+ if (ent->vtype != TYPE_ENTITY)
+ return NULL;
+
+ if (field->vtype != TYPE_FIELD)
+ return NULL;
+
+ v = ir_block_create_general_instr(self, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
+ v->fieldtype = field->fieldtype;
+ return v;
+}
+
+ir_value* ir_block_create_load_from_ent(ir_block *self, const char *label, ir_value *ent, ir_value *field, int outype)
+{
+ int op;
+ if (ent->vtype != TYPE_ENTITY)
+ return NULL;
+
+ /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
+ if (field->vtype != TYPE_FIELD)
+ return NULL;
+
+ switch (outype)
+ {
+ case TYPE_FLOAT: op = INSTR_LOAD_F; break;
+ case TYPE_VECTOR: op = INSTR_LOAD_V; break;
+ case TYPE_STRING: op = INSTR_LOAD_S; break;
+ case TYPE_FIELD: op = INSTR_LOAD_FLD; break;
+ case TYPE_ENTITY: op = INSTR_LOAD_ENT; break;
+ case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
+#if 0
+ case TYPE_POINTER: op = INSTR_LOAD_I; break;
+ case TYPE_INTEGER: op = INSTR_LOAD_I; break;
+#endif
+ default:
+ irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
+ return NULL;
+ }
+
+ return ir_block_create_general_instr(self, label, op, ent, field, outype);
+}
+
+ir_value* ir_block_create_add(ir_block *self,
+ const char *label,
+ ir_value *left, ir_value *right)
+{
+ int op = 0;
+ int l = left->vtype;
+ int r = right->vtype;
+ if (l == r) {
+ switch (l) {
+ default:
+ irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
+ return NULL;
+ case TYPE_FLOAT:
+ op = INSTR_ADD_F;
+ break;
+#if 0
+ case TYPE_INTEGER:
+ op = INSTR_ADD_I;
+ break;
+#endif
+ case TYPE_VECTOR:
+ op = INSTR_ADD_V;
+ break;
+ }
+ } else {
+#if 0
+ if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
+ op = INSTR_ADD_FI;
+ else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
+ op = INSTR_ADD_IF;
+ else
+#endif
+ {
+ irerror(self->context, "invalid type for ir_block_create_add: %s", type_name[l]);
+ return NULL;
+ }
+ }
+ return ir_block_create_binop(self, label, op, left, right);
+}
+
+ir_value* ir_block_create_sub(ir_block *self,
+ const char *label,
+ ir_value *left, ir_value *right)
+{
+ int op = 0;
+ int l = left->vtype;
+ int r = right->vtype;
+ if (l == r) {
+
+ switch (l) {
+ default:
+ irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
+ return NULL;
+ case TYPE_FLOAT:
+ op = INSTR_SUB_F;
+ break;
+#if 0
+ case TYPE_INTEGER:
+ op = INSTR_SUB_I;
+ break;
+#endif
+ case TYPE_VECTOR:
+ op = INSTR_SUB_V;
+ break;
+ }
+ } else {
+#if 0
+ if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
+ op = INSTR_SUB_FI;
+ else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
+ op = INSTR_SUB_IF;
+ else
+#endif
+ {
+ irerror(self->context, "invalid type for ir_block_create_sub: %s", type_name[l]);
+ return NULL;
+ }
+ }
+ return ir_block_create_binop(self, label, op, left, right);
+}
+
+ir_value* ir_block_create_mul(ir_block *self,
+ const char *label,
+ ir_value *left, ir_value *right)
+{
+ int op = 0;
+ int l = left->vtype;
+ int r = right->vtype;
+ if (l == r) {
+
+ switch (l) {
+ default:
+ irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
+ return NULL;
+ case TYPE_FLOAT:
+ op = INSTR_MUL_F;
+ break;
+#if 0
+ case TYPE_INTEGER:
+ op = INSTR_MUL_I;
+ break;
+#endif
+ case TYPE_VECTOR:
+ op = INSTR_MUL_V;
+ break;
+ }
+ } else {
+ if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
+ op = INSTR_MUL_VF;
+ else if ( (l == TYPE_FLOAT && r == TYPE_VECTOR) )
+ op = INSTR_MUL_FV;
+#if 0
+ else if ( (l == TYPE_VECTOR && r == TYPE_INTEGER) )
+ op = INSTR_MUL_VI;
+ else if ( (l == TYPE_INTEGER && r == TYPE_VECTOR) )
+ op = INSTR_MUL_IV;
+ else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
+ op = INSTR_MUL_FI;
+ else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
+ op = INSTR_MUL_IF;
+#endif
+ else {
+ irerror(self->context, "invalid type for ir_block_create_mul: %s", type_name[l]);
+ return NULL;
+ }
+ }
+ return ir_block_create_binop(self, label, op, left, right);
+}
+
+ir_value* ir_block_create_div(ir_block *self,
+ const char *label,
+ ir_value *left, ir_value *right)
+{
+ int op = 0;
+ int l = left->vtype;
+ int r = right->vtype;
+ if (l == r) {
+
+ switch (l) {
+ default:
+ irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
+ return NULL;
+ case TYPE_FLOAT:
+ op = INSTR_DIV_F;
+ break;
+#if 0
+ case TYPE_INTEGER:
+ op = INSTR_DIV_I;
+ break;
+#endif
+ }
+ } else {
+#if 0
+ if ( (l == TYPE_VECTOR && r == TYPE_FLOAT) )
+ op = INSTR_DIV_VF;
+ else if ( (l == TYPE_FLOAT && r == TYPE_INTEGER) )
+ op = INSTR_DIV_FI;
+ else if ( (l == TYPE_INTEGER && r == TYPE_FLOAT) )
+ op = INSTR_DIV_IF;
+ else
+#endif
+ {
+ irerror(self->context, "invalid type for ir_block_create_div: %s", type_name[l]);
+ return NULL;
+ }
+ }
+ return ir_block_create_binop(self, label, op, left, right);
+}
+
+/* PHI resolving breaks the SSA, and must thus be the last
+ * step before life-range calculation.
+ */
+
+static bool ir_block_naive_phi(ir_block *self);
+bool ir_function_naive_phi(ir_function *self)
+{
+ size_t i;
+
+ for (i = 0; i < vec_size(self->blocks); ++i)
+ {
+ if (!ir_block_naive_phi(self->blocks[i]))
+ return false;
+ }
+ return true;
+}
+
+static bool ir_naive_phi_emit_store(ir_block *block, size_t iid, ir_value *old, ir_value *what)
+{
+ ir_instr *instr;
+ size_t i;
+
+ /* create a store */
+ if (!ir_block_create_store(block, old, what))
+ return false;
+
+ /* we now move it up */
+ instr = vec_last(block->instr);
+ for (i = vec_size(block->instr)-1; i > iid; --i)
+ block->instr[i] = block->instr[i-1];
+ block->instr[i] = instr;
+
+ return true;
+}
+
+static bool ir_block_naive_phi(ir_block *self)
+{
+ size_t i, p, w;
+ /* FIXME: optionally, create_phi can add the phis
+ * to a list so we don't need to loop through blocks
+ * - anyway: "don't optimize YET"
+ */
+ for (i = 0; i < vec_size(self->instr); ++i)
+ {
+ ir_instr *instr = self->instr[i];
+ if (instr->opcode != VINSTR_PHI)
+ continue;
+
+ vec_remove(self->instr, i, 1);
+ --i; /* NOTE: i+1 below */
+
+ for (p = 0; p < vec_size(instr->phi); ++p)
+ {
+ ir_value *v = instr->phi[p].value;
+ for (w = 0; w < vec_size(v->writes); ++w) {
+ ir_value *old;
+
+ if (!v->writes[w]->_ops[0])
+ continue;
+
+ /* When the write was to a global, we have to emit a mov */
+ old = v->writes[w]->_ops[0];
+
+ /* The original instruction now writes to the PHI target local */
+ if (v->writes[w]->_ops[0] == v)
+ v->writes[w]->_ops[0] = instr->_ops[0];
+
+ if (old->store != store_value && old->store != store_local && old->store != store_param)
+ {
+ /* If it originally wrote to a global we need to store the value
+ * there as welli
+ */
+ if (!ir_naive_phi_emit_store(self, i+1, old, v))
+ return false;
+ if (i+1 < vec_size(self->instr))
+ instr = self->instr[i+1];
+ else
+ instr = NULL;
+ /* In case I forget and access instr later, it'll be NULL
+ * when it's a problem, to make sure we crash, rather than accessing
+ * invalid data.
+ */
+ }
+ else
+ {
+ /* If it didn't, we can replace all reads by the phi target now. */
+ size_t r;
+ for (r = 0; r < vec_size(old->reads); ++r)
+ {
+ size_t op;
+ ir_instr *ri = old->reads[r];
+ for (op = 0; op < vec_size(ri->phi); ++op) {
+ if (ri->phi[op].value == old)
+ ri->phi[op].value = v;
+ }
+ for (op = 0; op < 3; ++op) {
+ if (ri->_ops[op] == old)
+ ri->_ops[op] = v;
+ }
+ }
+ }
+ }
+ }
+ ir_instr_delete(instr);
+ }
+ return true;
+}
+
+/***********************************************************************
+ *IR Temp allocation code
+ * Propagating value life ranges by walking through the function backwards
+ * until no more changes are made.
+ * In theory this should happen once more than once for every nested loop
+ * level.
+ * Though this implementation might run an additional time for if nests.
+ */
+
+/* Enumerate instructions used by value's life-ranges
+ */
+static void ir_block_enumerate(ir_block *self, size_t *_eid)
+{
+ size_t i;
+ size_t eid = *_eid;
+ for (i = 0; i < vec_size(self->instr); ++i)
+ {
+ self->instr[i]->eid = eid++;
+ }
+ *_eid = eid;
+}
+
+/* Enumerate blocks and instructions.
+ * The block-enumeration is unordered!
+ * We do not really use the block enumreation, however
+ * the instruction enumeration is important for life-ranges.
+ */
+void ir_function_enumerate(ir_function *self)
+{
+ size_t i;
+ size_t instruction_id = 0;
+ for (i = 0; i < vec_size(self->blocks); ++i)
+ {
+ self->blocks[i]->eid = i;
+ self->blocks[i]->run_id = 0;
+ ir_block_enumerate(self->blocks[i], &instruction_id);
+ }
+}
+
+static bool ir_block_life_propagate(ir_block *b, ir_block *prev, bool *changed);
+bool ir_function_calculate_liferanges(ir_function *self)
+{
+ size_t i;
+ bool changed;
+
+ do {
+ self->run_id++;
+ changed = false;
+ for (i = 0; i != vec_size(self->blocks); ++i)
+ {
+ if (self->blocks[i]->is_return)
+ {
+ vec_free(self->blocks[i]->living);
+ if (!ir_block_life_propagate(self->blocks[i], NULL, &changed))
+ return false;
+ }
+ }
+ } while (changed);
+ if (vec_size(self->blocks)) {
+ ir_block *block = self->blocks[0];
+ for (i = 0; i < vec_size(block->living); ++i) {
+ ir_value *v = block->living[i];
+ if (v->memberof || v->store != store_local)
+ continue;
+ if (irwarning(v->context, WARN_USED_UNINITIALIZED,
+ "variable `%s` may be used uninitialized in this function", v->name))
+ {
+ return false;
+ }
+ }
+ }
+ return true;
+}
+
+/* Local-value allocator
+ * After finishing creating the liferange of all values used in a function
+ * we can allocate their global-positions.
+ * This is the counterpart to register-allocation in register machines.
+ */
+typedef struct {
+ ir_value **locals;
+ size_t *sizes;
+ size_t *positions;
+} function_allocator;
+
+static bool function_allocator_alloc(function_allocator *alloc, const ir_value *var)
+{
+ ir_value *slot;
+ size_t vsize = type_sizeof[var->vtype];
+
+ slot = ir_value_var("reg", store_global, var->vtype);
+ if (!slot)
+ return false;
+
+ if (!ir_value_life_merge_into(slot, var))
+ goto localerror;
+
+ vec_push(alloc->locals, slot);
+ vec_push(alloc->sizes, vsize);
+
+ return true;
+
+localerror:
+ ir_value_delete(slot);
+ return false;
+}
+
+bool ir_function_allocate_locals(ir_function *self)
+{
+ size_t i, a;
+ bool retval = true;
+ size_t pos;
+
+ ir_value *slot;
+ const ir_value *v;
+
+ function_allocator alloc;
+
+ if (!vec_size(self->locals) && !vec_size(self->values))
+ return true;
+
+ alloc.locals = NULL;
+ alloc.sizes = NULL;
+ alloc.positions = NULL;
+
+ for (i = 0; i < vec_size(self->locals); ++i)
+ {
+ if (!function_allocator_alloc(&alloc, self->locals[i]))
+ goto error;
+ }
+
+ /* Allocate a slot for any value that still exists */
+ for (i = 0; i < vec_size(self->values); ++i)
+ {
+ v = self->values[i];
+
+ if (!vec_size(v->life))
+ continue;
+
+ for (a = 0; a < vec_size(alloc.locals); ++a)
+ {
+ slot = alloc.locals[a];
+
+ if (ir_values_overlap(v, slot))
+ continue;
+
+ if (!ir_value_life_merge_into(slot, v))
+ goto error;
+
+ /* adjust size for this slot */
+ if (alloc.sizes[a] < type_sizeof[v->vtype])
+ alloc.sizes[a] = type_sizeof[v->vtype];
+
+ self->values[i]->code.local = a;
+ break;
+ }
+ if (a >= vec_size(alloc.locals)) {
+ self->values[i]->code.local = vec_size(alloc.locals);
+ if (!function_allocator_alloc(&alloc, v))
+ goto error;
+ }
+ }
+
+ if (!alloc.sizes) {
+ goto cleanup;
+ }
+
+ /* Adjust slot positions based on sizes */
+ vec_push(alloc.positions, 0);
+
+ if (vec_size(alloc.sizes))
+ pos = alloc.positions[0] + alloc.sizes[0];
+ else
+ pos = 0;
+ for (i = 1; i < vec_size(alloc.sizes); ++i)
+ {
+ pos = alloc.positions[i-1] + alloc.sizes[i-1];
+ vec_push(alloc.positions, pos);
+ }
+
+ self->allocated_locals = pos + vec_last(alloc.sizes);
+
+ /* Take over the actual slot positions */
+ for (i = 0; i < vec_size(self->values); ++i) {
+ self->values[i]->code.local = alloc.positions[self->values[i]->code.local];
+ }
+
+ goto cleanup;
+
+error:
+ retval = false;
+cleanup:
+ for (i = 0; i < vec_size(alloc.locals); ++i)
+ ir_value_delete(alloc.locals[i]);
+ vec_free(alloc.locals);
+ vec_free(alloc.sizes);
+ vec_free(alloc.positions);
+ return retval;
+}
+
+/* Get information about which operand
+ * is read from, or written to.
+ */
+static void ir_op_read_write(int op, size_t *read, size_t *write)
+{
+ switch (op)
+ {
+ case VINSTR_JUMP:
+ case INSTR_GOTO:
+ *write = 0;
+ *read = 0;
+ break;
+ case INSTR_IF:
+ case INSTR_IFNOT:
+#if 0
+ case INSTR_IF_S:
+ case INSTR_IFNOT_S:
+#endif
+ case INSTR_RETURN:
+ case VINSTR_COND:
+ *write = 0;
+ *read = 1;
+ break;
+ case INSTR_STOREP_F:
+ case INSTR_STOREP_V:
+ case INSTR_STOREP_S:
+ case INSTR_STOREP_ENT:
+ case INSTR_STOREP_FLD:
+ case INSTR_STOREP_FNC:
+ *write = 0;
+ *read = 7;
+ break;
+ default:
+ *write = 1;
+ *read = 6;
+ break;
+ };
+}
+
+static bool ir_block_living_add_instr(ir_block *self, size_t eid)
+{
+ size_t i;
+ bool changed = false;
+ bool tempbool;
+ for (i = 0; i != vec_size(self->living); ++i)
+ {
+ tempbool = ir_value_life_merge(self->living[i], eid);
+ /* debug
+ if (tempbool)
+ irerror(self->context, "block_living_add_instr() value instruction added %s: %i", self->living[i]->_name, (int)eid);
+ */
+ changed = changed || tempbool;
+ }
+ return changed;
+}
+
+static bool ir_block_life_prop_previous(ir_block* self, ir_block *prev, bool *changed)
+{
+ size_t i;
+ /* values which have been read in a previous iteration are now
+ * in the "living" array even if the previous block doesn't use them.
+ * So we have to remove whatever does not exist in the previous block.
+ * They will be re-added on-read, but the liferange merge won't cause
+ * a change.
+ */
+ for (i = 0; i < vec_size(self->living); ++i)
+ {
+ if (!vec_ir_value_find(prev->living, self->living[i], NULL)) {
+ vec_remove(self->living, i, 1);
+ --i;
+ }
+ }
+
+ /* Whatever the previous block still has in its living set
+ * must now be added to ours as well.
+ */
+ for (i = 0; i < vec_size(prev->living); ++i)
+ {
+ if (vec_ir_value_find(self->living, prev->living[i], NULL))
+ continue;
+ vec_push(self->living, prev->living[i]);
+ /*
+ irerror(self->contextt from prev: %s", self->label, prev->living[i]->_name);
+ */
+ }
+ return true;
+}
+
+static bool ir_block_life_propagate(ir_block *self, ir_block *prev, bool *changed)
+{
+ ir_instr *instr;
+ ir_value *value;
+ bool tempbool;
+ size_t i, o, p;
+ /* bitmasks which operands are read from or written to */
+ size_t read, write;
+ char dbg_ind[16] = { '#', '0' };
+ (void)dbg_ind;
+
+ if (prev)
+ {
+ if (!ir_block_life_prop_previous(self, prev, changed))
+ return false;
+ }
+
+ i = vec_size(self->instr);
+ while (i)
+ { --i;
+ instr = self->instr[i];
+
+ /* PHI operands are always read operands */
+ for (p = 0; p < vec_size(instr->phi); ++p)
+ {
+ value = instr->phi[p].value;
+ if (value->memberof)
+ value = value->memberof;
+ if (!vec_ir_value_find(self->living, value, NULL))
+ vec_push(self->living, value);
+ }
+
+ /* call params are read operands too */
+ for (p = 0; p < vec_size(instr->params); ++p)
+ {
+ value = instr->params[p];
+ if (value->memberof)
+ value = value->memberof;
+ if (!vec_ir_value_find(self->living, value, NULL))
+ vec_push(self->living, value);
+ }
+
+ /* See which operands are read and write operands */
+ ir_op_read_write(instr->opcode, &read, &write);
+
+ if (instr->opcode == INSTR_MUL_VF)
+ {
+ /* the float source will get an additional lifetime */
+ tempbool = ir_value_life_merge(instr->_ops[2], instr->eid+1);
+ *changed = *changed || tempbool;
+ }
+ else if (instr->opcode == INSTR_MUL_FV)
+ {
+ /* the float source will get an additional lifetime */
+ tempbool = ir_value_life_merge(instr->_ops[1], instr->eid+1);
+ *changed = *changed || tempbool;
+ }
+
+ /* Go through the 3 main operands */
+ for (o = 0; o < 3; ++o)
+ {
+ if (!instr->_ops[o]) /* no such operand */
+ continue;
+
+ value = instr->_ops[o];
+ if (value->memberof)
+ value = value->memberof;
+
+ /* We only care about locals */
+ /* we also calculate parameter liferanges so that locals
+ * can take up parameter slots */
+ if (value->store != store_value &&
+ value->store != store_local &&
+ value->store != store_param)
+ continue;
+
+ /* read operands */
+ if (read & (1<<o))
+ {
+ if (!vec_ir_value_find(self->living, value, NULL))
+ vec_push(self->living, value);
+ }
+
+ /* write operands */
+ /* When we write to a local, we consider it "dead" for the
+ * remaining upper part of the function, since in SSA a value
+ * can only be written once (== created)
+ */
+ if (write & (1<<o))
+ {
+ size_t idx;
+ bool in_living = vec_ir_value_find(self->living, value, &idx);
+ if (!in_living)
+ {
+ /* If the value isn't alive it hasn't been read before... */
+ /* TODO: See if the warning can be emitted during parsing or AST processing
+ * otherwise have warning printed here.
+ * IF printing a warning here: include filecontext_t,
+ * and make sure it's only printed once
+ * since this function is run multiple times.
+ */
+ /* For now: debug info: */
+ /* con_err( "Value only written %s\n", value->name); */
+ tempbool = ir_value_life_merge(value, instr->eid);
+ *changed = *changed || tempbool;
+ /*
+ ir_instr_dump(instr, dbg_ind, printf);
+ abort();
+ */
+ } else {
+ /* since 'living' won't contain it
+ * anymore, merge the value, since
+ * (A) doesn't.
+ */
+ tempbool = ir_value_life_merge(value, instr->eid);
+ /*
+ if (tempbool)
+ con_err( "value added id %s %i\n", value->name, (int)instr->eid);
+ */
+ *changed = *changed || tempbool;
+ /* Then remove */
+ vec_remove(self->living, idx, 1);
+ }
+ }
+ }
+ /* (A) */
+ tempbool = ir_block_living_add_instr(self, instr->eid);
+ /*con_err( "living added values\n");*/
+ *changed = *changed || tempbool;
+
+ }
+
+ if (self->run_id == self->owner->run_id)
+ return true;
+
+ self->run_id = self->owner->run_id;
+
+ for (i = 0; i < vec_size(self->entries); ++i)
+ {
+ ir_block *entry = self->entries[i];
+ ir_block_life_propagate(entry, self, changed);
+ }
+
+ return true;
+}
+
+/***********************************************************************
+ *IR Code-Generation
+ *
+ * Since the IR has the convention of putting 'write' operands
+ * at the beginning, we have to rotate the operands of instructions
+ * properly in order to generate valid QCVM code.
+ *
+ * Having destinations at a fixed position is more convenient. In QC
+ * this is *mostly* OPC, but FTE adds at least 2 instructions which
+ * read from from OPA, and store to OPB rather than OPC. Which is
+ * partially the reason why the implementation of these instructions
+ * in darkplaces has been delayed for so long.
+ *
+ * Breaking conventions is annoying...
+ */
+static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
+
+static bool gen_global_field(ir_value *global)
+{
+ if (global->isconst)
+ {
+ ir_value *fld = global->constval.vpointer;
+ if (!fld) {
+ irerror(global->context, "Invalid field constant with no field: %s", global->name);
+ return false;
+ }
+
+ /* Now, in this case, a relocation would be impossible to code
+ * since it looks like this:
+ * .vector v = origin; <- parse error, wtf is 'origin'?
+ * .vector origin;
+ *
+ * But we will need a general relocation support later anyway
+ * for functions... might as well support that here.
+ */
+ if (!fld->code.globaladdr) {
+ irerror(global->context, "FIXME: Relocation support");
+ return false;
+ }
+
+ /* copy the field's value */
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ vec_push(code_globals, code_globals[fld->code.globaladdr]);
+ if (global->fieldtype == TYPE_VECTOR) {
+ vec_push(code_globals, code_globals[fld->code.globaladdr]+1);
+ vec_push(code_globals, code_globals[fld->code.globaladdr]+2);
+ }
+ }
+ else
+ {
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ vec_push(code_globals, 0);
+ if (global->fieldtype == TYPE_VECTOR) {
+ vec_push(code_globals, 0);
+ vec_push(code_globals, 0);
+ }
+ }
+ if (global->code.globaladdr < 0)
+ return false;
+ return true;
+}
+
+static bool gen_global_pointer(ir_value *global)
+{
+ if (global->isconst)
+ {
+ ir_value *target = global->constval.vpointer;
+ if (!target) {
+ irerror(global->context, "Invalid pointer constant: %s", global->name);
+ /* NULL pointers are pointing to the NULL constant, which also
+ * sits at address 0, but still has an ir_value for itself.
+ */
+ return false;
+ }
+
+ /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
+ * void() foo; <- proto
+ * void() *fooptr = &foo;
+ * void() foo = { code }
+ */
+ if (!target->code.globaladdr) {
+ /* FIXME: Check for the constant nullptr ir_value!
+ * because then code.globaladdr being 0 is valid.
+ */
+ irerror(global->context, "FIXME: Relocation support");
+ return false;
+ }
+
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ vec_push(code_globals, target->code.globaladdr);
+ }
+ else
+ {
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ vec_push(code_globals, 0);
+ }
+ if (global->code.globaladdr < 0)
+ return false;
+ return true;
+}
+
+static bool gen_blocks_recursive(ir_function *func, ir_block *block)
+{
+ prog_section_statement stmt;
+ ir_instr *instr;
+ ir_block *target;
+ ir_block *ontrue;
+ ir_block *onfalse;
+ size_t stidx;
+ size_t i;
+
+tailcall:
+ block->generated = true;
+ block->code_start = vec_size(code_statements);
+ for (i = 0; i < vec_size(block->instr); ++i)
+ {
+ instr = block->instr[i];
+
+ if (instr->opcode == VINSTR_PHI) {
+ irerror(block->context, "cannot generate virtual instruction (phi)");
+ return false;
+ }
+
+ if (instr->opcode == VINSTR_JUMP) {
+ target = instr->bops[0];
+ /* for uncoditional jumps, if the target hasn't been generated
+ * yet, we generate them right here.
+ */
+ if (!target->generated) {
+ block = target;
+ goto tailcall;
+ }
+
+ /* otherwise we generate a jump instruction */
+ stmt.opcode = INSTR_GOTO;
+ stmt.o1.s1 = (target->code_start) - vec_size(code_statements);
+ stmt.o2.s1 = 0;
+ stmt.o3.s1 = 0;
+ vec_push(code_statements, stmt);
+
+ /* no further instructions can be in this block */
+ return true;
+ }
+
+ if (instr->opcode == VINSTR_COND) {
+ ontrue = instr->bops[0];
+ onfalse = instr->bops[1];
+ /* TODO: have the AST signal which block should
+ * come first: eg. optimize IFs without ELSE...
+ */
+
+ stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
+ stmt.o2.u1 = 0;
+ stmt.o3.s1 = 0;
+
+ if (ontrue->generated) {
+ stmt.opcode = INSTR_IF;
+ stmt.o2.s1 = (ontrue->code_start) - vec_size(code_statements);
+ vec_push(code_statements, stmt);
+ }
+ if (onfalse->generated) {
+ stmt.opcode = INSTR_IFNOT;
+ stmt.o2.s1 = (onfalse->code_start) - vec_size(code_statements);
+ vec_push(code_statements, stmt);
+ }
+ if (!ontrue->generated) {
+ if (onfalse->generated) {
+ block = ontrue;
+ goto tailcall;
+ }
+ }
+ if (!onfalse->generated) {
+ if (ontrue->generated) {
+ block = onfalse;
+ goto tailcall;
+ }
+ }
+ /* neither ontrue nor onfalse exist */
+ stmt.opcode = INSTR_IFNOT;
+ stidx = vec_size(code_statements);
+ vec_push(code_statements, stmt);
+ /* on false we jump, so add ontrue-path */
+ if (!gen_blocks_recursive(func, ontrue))
+ return false;
+ /* fixup the jump address */
+ code_statements[stidx].o2.s1 = vec_size(code_statements) - stidx;
+ /* generate onfalse path */
+ if (onfalse->generated) {
+ /* fixup the jump address */
+ code_statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
+ /* may have been generated in the previous recursive call */
+ stmt.opcode = INSTR_GOTO;
+ stmt.o1.s1 = (onfalse->code_start) - vec_size(code_statements);
+ stmt.o2.s1 = 0;
+ stmt.o3.s1 = 0;
+ vec_push(code_statements, stmt);
+ return true;
+ }
+ /* if not, generate now */
+ block = onfalse;
+ goto tailcall;
+ }
+
+ if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
+ /* Trivial call translation:
+ * copy all params to OFS_PARM*
+ * if the output's storetype is not store_return,
+ * add append a STORE instruction!
+ *
+ * NOTES on how to do it better without much trouble:
+ * -) The liferanges!
+ * Simply check the liferange of all parameters for
+ * other CALLs. For each param with no CALL in its
+ * liferange, we can store it in an OFS_PARM at
+ * generation already. This would even include later
+ * reuse.... probably... :)
+ */
+ size_t p;
+ ir_value *retvalue;
+
+ for (p = 0; p < vec_size(instr->params); ++p)
+ {
+ ir_value *param = instr->params[p];
+
+ stmt.opcode = INSTR_STORE_F;
+ stmt.o3.u1 = 0;
+
+ if (param->vtype == TYPE_FIELD)
+ stmt.opcode = field_store_instr[param->fieldtype];
+ else
+ stmt.opcode = type_store_instr[param->vtype];
+ stmt.o1.u1 = ir_value_code_addr(param);
+ stmt.o2.u1 = OFS_PARM0 + 3 * p;
+ vec_push(code_statements, stmt);
+ }
+ stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
+ if (stmt.opcode > INSTR_CALL8)
+ stmt.opcode = INSTR_CALL8;
+ stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
+ stmt.o2.u1 = 0;
+ stmt.o3.u1 = 0;
+ vec_push(code_statements, stmt);
+
+ retvalue = instr->_ops[0];
+ if (retvalue && retvalue->store != store_return && vec_size(retvalue->life))
+ {
+ /* not to be kept in OFS_RETURN */
+ if (retvalue->vtype == TYPE_FIELD)
+ stmt.opcode = field_store_instr[retvalue->vtype];
+ else
+ stmt.opcode = type_store_instr[retvalue->vtype];
+ stmt.o1.u1 = OFS_RETURN;
+ stmt.o2.u1 = ir_value_code_addr(retvalue);
+ stmt.o3.u1 = 0;
+ vec_push(code_statements, stmt);
+ }
+ continue;
+ }
+
+ if (instr->opcode == INSTR_STATE) {
+ irerror(block->context, "TODO: state instruction");
+ return false;
+ }
+
+ stmt.opcode = instr->opcode;
+ stmt.o1.u1 = 0;
+ stmt.o2.u1 = 0;
+ stmt.o3.u1 = 0;
+
+ /* This is the general order of operands */
+ if (instr->_ops[0])
+ stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
+
+ if (instr->_ops[1])
+ stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
+
+ if (instr->_ops[2])
+ stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
+
+ if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
+ {
+ stmt.o1.u1 = stmt.o3.u1;
+ stmt.o3.u1 = 0;
+ }
+ else if ((stmt.opcode >= INSTR_STORE_F &&
+ stmt.opcode <= INSTR_STORE_FNC) ||
+ (stmt.opcode >= INSTR_STOREP_F &&
+ stmt.opcode <= INSTR_STOREP_FNC))
+ {
+ /* 2-operand instructions with A -> B */
+ stmt.o2.u1 = stmt.o3.u1;
+ stmt.o3.u1 = 0;
+ }
+
+ vec_push(code_statements, stmt);
+ }
+ return true;
+}
+
+static bool gen_function_code(ir_function *self)
+{
+ ir_block *block;
+ prog_section_statement stmt;
+
+ /* Starting from entry point, we generate blocks "as they come"
+ * for now. Dead blocks will not be translated obviously.
+ */
+ if (!vec_size(self->blocks)) {
+ irerror(self->context, "Function '%s' declared without body.", self->name);
+ return false;
+ }
+
+ block = self->blocks[0];
+ if (block->generated)
+ return true;
+
+ if (!gen_blocks_recursive(self, block)) {
+ irerror(self->context, "failed to generate blocks for '%s'", self->name);
+ return false;
+ }
+
+ /* otherwise code_write crashes since it debug-prints functions until AINSTR_END */
+ stmt.opcode = AINSTR_END;
+ stmt.o1.u1 = 0;
+ stmt.o2.u1 = 0;
+ stmt.o3.u1 = 0;
+ vec_push(code_statements, stmt);
+ return true;
+}
+
+static qcint ir_builder_filestring(ir_builder *ir, const char *filename)
+{
+ /* NOTE: filename pointers are copied, we never strdup them,
+ * thus we can use pointer-comparison to find the string.
+ */
+ size_t i;
+ qcint str;
+
+ for (i = 0; i < vec_size(ir->filenames); ++i) {
+ if (ir->filenames[i] == filename)
+ return ir->filestrings[i];
+ }
+
+ str = code_genstring(filename);
+ vec_push(ir->filenames, filename);
+ vec_push(ir->filestrings, str);
+ return str;
+}
+
+static bool gen_global_function(ir_builder *ir, ir_value *global)
+{
+ prog_section_function fun;
+ ir_function *irfun;
+
+ size_t i;
+ size_t local_var_end;
+
+ if (!global->isconst || (!global->constval.vfunc))
+ {
+ irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
+ return false;
+ }
+
+ irfun = global->constval.vfunc;
+
+ fun.name = global->code.name;
+ fun.file = ir_builder_filestring(ir, global->context.file);
+ fun.profile = 0; /* always 0 */
+ fun.nargs = vec_size(irfun->params);
+
+ for (i = 0;i < 8; ++i) {
+ if (i >= fun.nargs)
+ fun.argsize[i] = 0;
+ else
+ fun.argsize[i] = type_sizeof[irfun->params[i]];
+ }
+
+ fun.firstlocal = vec_size(code_globals);
+
+ local_var_end = fun.firstlocal;
+ for (i = 0; i < vec_size(irfun->locals); ++i) {
+ if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
+ irerror(irfun->locals[i]->context, "Failed to generate local %s", irfun->locals[i]->name);
+ return false;
+ }
+ }
+ if (vec_size(irfun->locals)) {
+ ir_value *last = vec_last(irfun->locals);
+ local_var_end = last->code.globaladdr;
+ local_var_end += type_sizeof[last->vtype];
+ }
+ for (i = 0; i < vec_size(irfun->values); ++i)
+ {
+ /* generate code.globaladdr for ssa values */
+ ir_value *v = irfun->values[i];
+ ir_value_code_setaddr(v, local_var_end + v->code.local);
+ }
+ for (i = 0; i < irfun->allocated_locals; ++i) {
+ /* fill the locals with zeros */
+ vec_push(code_globals, 0);
+ }
+
+ fun.locals = vec_size(code_globals) - fun.firstlocal;
+
+ if (irfun->builtin)
+ fun.entry = irfun->builtin;
+ else {
+ irfun->code_function_def = vec_size(code_functions);
+ fun.entry = vec_size(code_statements);
+ }
+
+ vec_push(code_functions, fun);
+ return true;
+}
+
+static bool gen_global_function_code(ir_builder *ir, ir_value *global)
+{
+ prog_section_function *fundef;
+ ir_function *irfun;
+
+ irfun = global->constval.vfunc;
+ if (!irfun) {
+ irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
+ "function `%s` has no body and in QC implicitly becomes a function-pointer", global->name);
+ /* this was a function pointer, don't generate code for those */
+ return true;
+ }
+
+ if (irfun->builtin)
+ return true;
+
+ if (irfun->code_function_def < 0) {
+ irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
+ return false;
+ }
+ fundef = &code_functions[irfun->code_function_def];
+
+ fundef->entry = vec_size(code_statements);
+ if (!gen_function_code(irfun)) {
+ irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
+ return false;
+ }
+ return true;
+}
+
+static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
+{
+ size_t i;
+ int32_t *iptr;
+ prog_section_def def;
+
+ def.type = global->vtype;
+ def.offset = vec_size(code_globals);
+
+ if (global->name) {
+ if (global->name[0] == '#') {
+ if (!self->str_immediate)
+ self->str_immediate = code_genstring("IMMEDIATE");
+ def.name = global->code.name = self->str_immediate;
+ }
+ else
+ def.name = global->code.name = code_genstring(global->name);
+ }
+ else
+ def.name = 0;
+
+ switch (global->vtype)
+ {
+ case TYPE_VOID:
+ if (!strcmp(global->name, "end_sys_globals")) {
+ /* TODO: remember this point... all the defs before this one
+ * should be checksummed and added to progdefs.h when we generate it.
+ */
+ }
+ else if (!strcmp(global->name, "end_sys_fields")) {
+ /* TODO: same as above but for entity-fields rather than globsl
+ */
+ }
+ else
+ irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
+ global->name);
+ /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
+ * the system fields actually go? Though the engine knows this anyway...
+ * Maybe this could be an -foption
+ * fteqcc creates data for end_sys_* - of size 1, so let's do the same
+ */
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ vec_push(code_globals, 0);
+ /* Add the def */
+ vec_push(code_defs, def);
+ return true;
+ case TYPE_POINTER:
+ vec_push(code_defs, def);
+ return gen_global_pointer(global);
+ case TYPE_FIELD:
+ vec_push(code_defs, def);
+ return gen_global_field(global);
+ case TYPE_ENTITY:
+ /* fall through */
+ case TYPE_FLOAT:
+ {
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ if (global->isconst) {
+ iptr = (int32_t*)&global->constval.ivec[0];
+ vec_push(code_globals, *iptr);
+ } else {
+ vec_push(code_globals, 0);
+ if (!islocal)
+ def.type |= DEF_SAVEGLOBAL;
+ }
+ vec_push(code_defs, def);
+
+ return global->code.globaladdr >= 0;
+ }
+ case TYPE_STRING:
+ {
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ if (global->isconst) {
+ vec_push(code_globals, code_genstring(global->constval.vstring));
+ } else {
+ vec_push(code_globals, 0);
+ if (!islocal)
+ def.type |= DEF_SAVEGLOBAL;
+ }
+ vec_push(code_defs, def);
+ return global->code.globaladdr >= 0;
+ }
+ case TYPE_VECTOR:
+ {
+ size_t d;
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ if (global->isconst) {
+ iptr = (int32_t*)&global->constval.ivec[0];
+ vec_push(code_globals, iptr[0]);
+ if (global->code.globaladdr < 0)
+ return false;
+ for (d = 1; d < type_sizeof[global->vtype]; ++d)
+ {
+ vec_push(code_globals, iptr[d]);
+ }
+ } else {
+ vec_push(code_globals, 0);
+ if (global->code.globaladdr < 0)
+ return false;
+ for (d = 1; d < type_sizeof[global->vtype]; ++d)
+ {
+ vec_push(code_globals, 0);
+ }
+ if (!islocal)
+ def.type |= DEF_SAVEGLOBAL;
+ }
+
+ vec_push(code_defs, def);
+ return global->code.globaladdr >= 0;
+ }
+ case TYPE_FUNCTION:
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ if (!global->isconst) {
+ vec_push(code_globals, 0);
+ if (global->code.globaladdr < 0)
+ return false;
+ } else {
+ vec_push(code_globals, vec_size(code_functions));
+ if (!gen_global_function(self, global))
+ return false;
+ if (!islocal)
+ def.type |= DEF_SAVEGLOBAL;
+ }
+ vec_push(code_defs, def);
+ return true;
+ case TYPE_VARIANT:
+ /* assume biggest type */
+ ir_value_code_setaddr(global, vec_size(code_globals));
+ vec_push(code_globals, 0);
+ for (i = 1; i < type_sizeof[TYPE_VARIANT]; ++i)
+ vec_push(code_globals, 0);
+ return true;
+ default:
+ /* refuse to create 'void' type or any other fancy business. */
+ irerror(global->context, "Invalid type for global variable `%s`: %s",
+ global->name, type_name[global->vtype]);
+ return false;
+ }
+}
+
+static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
+{
+ prog_section_def def;
+ prog_section_field fld;
+
+ def.type = field->vtype;
+ def.offset = vec_size(code_globals);
+
+ /* create a global named the same as the field */
+ if (opts_standard == COMPILER_GMQCC) {
+ /* in our standard, the global gets a dot prefix */
+ size_t len = strlen(field->name);
+ char name[1024];
+
+ /* we really don't want to have to allocate this, and 1024
+ * bytes is more than enough for a variable/field name
+ */
+ if (len+2 >= sizeof(name)) {
+ irerror(field->context, "invalid field name size: %u", (unsigned int)len);
+ return false;
+ }
+
+ name[0] = '.';
+ memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
+ name[len+1] = 0;
+
+ def.name = code_genstring(name);
+ fld.name = def.name + 1; /* we reuse that string table entry */
+ } else {
+ /* in plain QC, there cannot be a global with the same name,
+ * and so we also name the global the same.
+ * FIXME: fteqcc should create a global as well
+ * check if it actually uses the same name. Probably does
+ */
+ def.name = code_genstring(field->name);
+ fld.name = def.name;
+ }
+
+ field->code.name = def.name;
+
+ vec_push(code_defs, def);
+
+ fld.type = field->fieldtype;
+
+ if (fld.type == TYPE_VOID) {
+ irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
+ return false;
+ }
+
+ fld.offset = code_alloc_field(type_sizeof[field->fieldtype]);
+
+ vec_push(code_fields, fld);
+
+ ir_value_code_setaddr(field, vec_size(code_globals));
+ vec_push(code_globals, fld.offset);
+ if (fld.type == TYPE_VECTOR) {
+ vec_push(code_globals, fld.offset+1);
+ vec_push(code_globals, fld.offset+2);
+ }
+
+ return field->code.globaladdr >= 0;
+}
+
+bool ir_builder_generate(ir_builder *self, const char *filename)
+{
+ prog_section_statement stmt;
+ size_t i;
+
+ code_init();
+
+ for (i = 0; i < vec_size(self->globals); ++i)
+ {
+ if (!ir_builder_gen_global(self, self->globals[i], false)) {
+ return false;
+ }
+ }
+
+ for (i = 0; i < vec_size(self->fields); ++i)
+ {
+ if (!ir_builder_gen_field(self, self->fields[i])) {
+ return false;
+ }
+ }
+
+ /* generate function code */
+ for (i = 0; i < vec_size(self->globals); ++i)
+ {
+ if (self->globals[i]->vtype == TYPE_FUNCTION) {
+ if (!gen_global_function_code(self, self->globals[i])) {
+ return false;
+ }
+ }
+ }
+
+ /* DP errors if the last instruction is not an INSTR_DONE
+ * and for debugging purposes we add an additional AINSTR_END
+ * to the end of functions, so here it goes:
+ */
+ stmt.opcode = INSTR_DONE;
+ stmt.o1.u1 = 0;
+ stmt.o2.u1 = 0;
+ stmt.o3.u1 = 0;
+ vec_push(code_statements, stmt);
+
+ printf("writing '%s'...\n", filename);
+ return code_write(filename);
+}
+
+/***********************************************************************
+ *IR DEBUG Dump functions...
+ */
+
+#define IND_BUFSZ 1024
+
+#ifdef WIN32
+# define strncat(dst, src, sz) strncat_s(dst, sz, src, _TRUNCATE)
+#endif
+
+const char *qc_opname(int op)
+{
+ if (op < 0) return "<INVALID>";
+ if (op < ( sizeof(asm_instr) / sizeof(asm_instr[0]) ))
+ return asm_instr[op].m;
+ switch (op) {
+ case VINSTR_PHI: return "PHI";
+ case VINSTR_JUMP: return "JUMP";
+ case VINSTR_COND: return "COND";
+ default: return "<UNK>";
+ }
+}
+
+void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
+{
+ size_t i;
+ char indent[IND_BUFSZ];
+ indent[0] = '\t';
+ indent[1] = 0;
+
+ oprintf("module %s\n", b->name);
+ for (i = 0; i < vec_size(b->globals); ++i)
+ {
+ oprintf("global ");
+ if (b->globals[i]->isconst)
+ oprintf("%s = ", b->globals[i]->name);
+ ir_value_dump(b->globals[i], oprintf);
+ oprintf("\n");
+ }
+ for (i = 0; i < vec_size(b->functions); ++i)
+ ir_function_dump(b->functions[i], indent, oprintf);
+ oprintf("endmodule %s\n", b->name);
+}
+
+void ir_function_dump(ir_function *f, char *ind,
+ int (*oprintf)(const char*, ...))
+{
+ size_t i;
+ if (f->builtin != 0) {
+ oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
+ return;
+ }
+ oprintf("%sfunction %s\n", ind, f->name);
+ strncat(ind, "\t", IND_BUFSZ);
+ if (vec_size(f->locals))
+ {
+ oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
+ for (i = 0; i < vec_size(f->locals); ++i) {
+ oprintf("%s\t", ind);
+ ir_value_dump(f->locals[i], oprintf);
+ oprintf("\n");
+ }
+ }
+ oprintf("%sliferanges:\n", ind);
+ for (i = 0; i < vec_size(f->locals); ++i) {
+ size_t l;
+ ir_value *v = f->locals[i];
+ oprintf("%s\t%s: unique ", ind, v->name);
+ for (l = 0; l < vec_size(v->life); ++l) {
+ oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
+ }
+ oprintf("\n");
+ }
+ for (i = 0; i < vec_size(f->values); ++i) {
+ size_t l;
+ ir_value *v = f->values[i];
+ oprintf("%s\t%s: @%i ", ind, v->name, (int)v->code.local);
+ for (l = 0; l < vec_size(v->life); ++l) {
+ oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
+ }
+ oprintf("\n");
+ }
+ if (vec_size(f->blocks))
+ {
+ oprintf("%slife passes (check): %i\n", ind, (int)f->run_id);
+ for (i = 0; i < vec_size(f->blocks); ++i) {
+ if (f->blocks[i]->run_id != f->run_id) {
+ oprintf("%slife pass check fail! %i != %i\n", ind, (int)f->blocks[i]->run_id, (int)f->run_id);
+ }
+ ir_block_dump(f->blocks[i], ind, oprintf);
+ }
+
+ }
+ ind[strlen(ind)-1] = 0;
+ oprintf("%sendfunction %s\n", ind, f->name);
+}
+
+void ir_block_dump(ir_block* b, char *ind,
+ int (*oprintf)(const char*, ...))
+{
+ size_t i;
+ oprintf("%s:%s\n", ind, b->label);
+ strncat(ind, "\t", IND_BUFSZ);
+
+ for (i = 0; i < vec_size(b->instr); ++i)
+ ir_instr_dump(b->instr[i], ind, oprintf);
+ ind[strlen(ind)-1] = 0;
+}
+
+void dump_phi(ir_instr *in, char *ind,
+ int (*oprintf)(const char*, ...))
+{
+ size_t i;
+ oprintf("%s <- phi ", in->_ops[0]->name);
+ for (i = 0; i < vec_size(in->phi); ++i)
+ {
+ oprintf("([%s] : %s) ", in->phi[i].from->label,
+ in->phi[i].value->name);
+ }
+ oprintf("\n");
+}
+
+void ir_instr_dump(ir_instr *in, char *ind,
+ int (*oprintf)(const char*, ...))
+{
+ size_t i;
+ const char *comma = NULL;
+
+ oprintf("%s (%i) ", ind, (int)in->eid);
+
+ if (in->opcode == VINSTR_PHI) {
+ dump_phi(in, ind, oprintf);
+ return;
+ }
+
+ strncat(ind, "\t", IND_BUFSZ);
+
+ if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
+ ir_value_dump(in->_ops[0], oprintf);
+ if (in->_ops[1] || in->_ops[2])
+ oprintf(" <- ");
+ }
+ if (in->opcode == INSTR_CALL0) {
+ oprintf("CALL%i\t", vec_size(in->params));
+ } else
+ oprintf("%s\t", qc_opname(in->opcode));
+
+ if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
+ ir_value_dump(in->_ops[0], oprintf);
+ comma = ",\t";
+ }
+ else
+ {
+ for (i = 1; i != 3; ++i) {
+ if (in->_ops[i]) {
+ if (comma)
+ oprintf(comma);
+ ir_value_dump(in->_ops[i], oprintf);
+ comma = ",\t";
+ }
+ }
+ }
+ if (in->bops[0]) {
+ if (comma)
+ oprintf(comma);
+ oprintf("[%s]", in->bops[0]->label);
+ comma = ",\t";
+ }
+ if (in->bops[1])
+ oprintf("%s[%s]", comma, in->bops[1]->label);
+ if (vec_size(in->params)) {
+ oprintf("\tparams: ");
+ for (i = 0; i != vec_size(in->params); ++i) {
+ oprintf("%s, ", in->params[i]->name);
+ }
+ }
+ oprintf("\n");
+ ind[strlen(ind)-1] = 0;
+}
+
+void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
+{
+ if (v->isconst) {
+ switch (v->vtype) {
+ default:
+ case TYPE_VOID:
+ oprintf("(void)");
+ break;
+ case TYPE_FUNCTION:
+ oprintf("fn:%s", v->name);
+ break;
+ case TYPE_FLOAT:
+ oprintf("%g", v->constval.vfloat);
+ break;
+ case TYPE_VECTOR:
+ oprintf("'%g %g %g'",
+ v->constval.vvec.x,
+ v->constval.vvec.y,
+ v->constval.vvec.z);
+ break;
+ case TYPE_ENTITY:
+ oprintf("(entity)");
+ break;
+ case TYPE_STRING:
+ oprintf("\"%s\"", v->constval.vstring);
+ break;
+#if 0
+ case TYPE_INTEGER:
+ oprintf("%i", v->constval.vint);
+ break;
+#endif
+ case TYPE_POINTER:
+ oprintf("&%s",
+ v->constval.vpointer->name);
+ break;
+ }
+ } else {
+ oprintf("%s", v->name);
+ }
+}
+
+void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
+{
+ size_t i;
+ oprintf("Life of %12s:", self->name);
+ for (i = 0; i < vec_size(self->life); ++i)
+ {
+ oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);
+ }