*
* Backend node support.
*
+ * This file provdies Perm, Copy, Spill and Reload nodes.
+ *
* Copyright (C) 2005 Universitaet Karlsruhe
* Released under the GPL
*/
+
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "pmap.h"
#include "util.h"
#include "debug.h"
+#include "fourcc.h"
#include "irop_t.h"
#include "irmode_t.h"
#include "irnode_t.h"
#include "ircons_t.h"
+#include "irprintf.h"
#include "be_t.h"
#include "belive_t.h"
#include "beirgmod.h"
-#define DBG_LEVEL 0
+/* Sometimes we want to put const nodes into get_irn_generic_attr ... */
+#define get_irn_attr(irn) get_irn_generic_attr((ir_node *) (irn))
+
+static unsigned be_node_tag = FOURCC('B', 'E', 'N', 'O');
typedef enum _node_kind_t {
- node_kind_spill,
- node_kind_reload,
- node_kind_perm,
- node_kind_copy,
- node_kind_last
+ node_kind_spill,
+ node_kind_reload,
+ node_kind_perm,
+ node_kind_copy,
+ node_kind_kill,
+ node_kind_last
} node_kind_t;
typedef struct {
- node_kind_t kind;
- const arch_register_class_t *cls;
- ir_op *op;
- int n_pos;
- int *pos;
+ node_kind_t kind;
+ const arch_register_class_t *cls;
+ ir_op *op;
+ int n_pos;
+ int *pos;
} be_op_t;
-static int templ_pos_Spill[] = {
- arch_pos_make_in(0)
-};
+typedef struct {
+ const arch_register_t *reg;
+ arch_register_req_t req;
+} be_reg_data_t;
-static int templ_pos_Reload[] = {
- arch_pos_make_out(0)
-};
+typedef struct {
+ int n_outs;
+ const arch_register_class_t *cls;
+ be_reg_data_t *reg_data;
+} be_node_attr_t;
-static int templ_pos_Copy[] = {
- arch_pos_make_in(0),
- arch_pos_make_out(0)
-};
+typedef struct {
+ be_node_attr_t node_attr;
+ ir_node *spill_ctx; /**< The node in whose context this spill was introduced. */
+ unsigned offset; /**< The offset of the memory location the spill writes to
+ in the spill area. */
+} be_spill_attr_t;
-#define ARRSIZE(x) (sizeof(x) / sizeof(x[0]))
+static ir_op *op_Spill;
+static ir_op *op_Reload;
+static ir_op *op_Perm;
+static ir_op *op_Copy;
+static ir_op *op_Keep;
-static int cmp_op_map(const void *a, const void *b, size_t size)
-{
- const be_op_t *x = a;
- const be_op_t *y = b;
+static int beo_base = -1;
- return !(x->kind == y->kind && x->cls == y->cls);
-}
+static const ir_op_ops be_node_op_ops;
-static be_op_t *get_op(const be_node_factory_t *fact,
- const arch_register_class_t *cls, node_kind_t kind)
-{
- be_op_t templ;
+void be_node_init(void) {
+ static int inited = 0;
+ int i;
- templ.kind = kind;
- templ.cls = cls;
+ if(inited)
+ return;
- return set_insert(fact->ops, &templ, sizeof(templ),
- HASH_PTR(cls) + 7 * kind);
-}
+ inited = 1;
-ir_node *new_Spill(const be_node_factory_t *factory,
- const arch_register_class_t *cls,
- ir_graph *irg, ir_node *bl, ir_node *node_to_spill)
-{
- ir_node *in[1];
- ir_op *op = get_op(factory, cls, node_kind_spill)->op;
+ beo_base = get_next_ir_opcode();
+
+ /* Acquire all needed opcodes. We assume that they are consecutive! */
+ for(i = beo_Spill; i < beo_Last; ++i)
+ get_next_ir_opcode();
- assert(op && "Spill opcode must be present for this register class");
- in[0] = node_to_spill;
+ op_Spill = new_ir_op(beo_base + beo_Spill, "Spill", op_pin_state_mem_pinned, 0, oparity_unary, 0, sizeof(be_spill_attr_t), &be_node_op_ops);
+ op_Reload = new_ir_op(beo_base + beo_Reload, "Reload", op_pin_state_mem_pinned, 0, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_Perm = new_ir_op(beo_base + beo_Perm, "Perm", op_pin_state_pinned, 0, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_Copy = new_ir_op(beo_base + beo_Copy, "Copy", op_pin_state_pinned, 0, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_Keep = new_ir_op(beo_base + beo_Keep, "Keep", op_pin_state_pinned, 0, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
- return new_ir_node(NULL, irg, bl, op, mode_M, 1, in);
+ set_op_tag(op_Spill, &be_node_tag);
+ set_op_tag(op_Reload, &be_node_tag);
+ set_op_tag(op_Perm, &be_node_tag);
+ set_op_tag(op_Copy, &be_node_tag);
+ set_op_tag(op_Keep, &be_node_tag);
}
-ir_node *new_Reload(const be_node_factory_t *factory,
- const arch_register_class_t *cls, ir_graph *irg,
- ir_node *bl, ir_mode *mode, ir_node *spill_node)
+static void *init_node_attr(ir_node* irn, const arch_register_class_t *cls, ir_graph *irg, int n_outs)
{
- ir_node *in[1];
- ir_op *op = get_op(factory, cls, node_kind_reload)->op;
+ be_node_attr_t *a = get_irn_attr(irn);
- assert(op && "Reload opcode must be present for this register class");
- // assert(is_Spill(factory, spill_node) && "Operand of Reload must be a Spill");
- in[0] = spill_node;
+ a->n_outs = n_outs;
+ a->cls = cls;
+ a->reg_data = NULL;
- return new_ir_node(NULL, irg, bl, op, mode, 1, in);
+ if(n_outs > 0) {
+ int i;
+
+ a->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(irg), n_outs);
+ memset(a->reg_data, 0, n_outs * sizeof(a->reg_data[0]));
+ for(i = 0; i < n_outs; ++i) {
+ a->reg_data[i].req.cls = cls;
+ a->reg_data[i].req.type = arch_register_req_type_normal;
+ }
+ }
+
+ return a;
}
-ir_node *new_Perm(const be_node_factory_t *factory,
- const arch_register_class_t *cls,
- ir_graph *irg, ir_node *bl, int arity, ir_node **in)
+static INLINE int is_be_node(const ir_node *irn)
{
- ir_op *op = get_op(factory, cls, node_kind_perm)->op;
+ return get_op_tag(get_irn_op(irn)) == &be_node_tag;
+}
- return new_ir_node(NULL, irg, bl, op, mode_T, arity, in);
+be_opcode_t get_irn_be_opcode(const ir_node *irn)
+{
+ return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp;
}
-ir_node *new_Copy(const be_node_factory_t *factory,
- const arch_register_class_t *cls,
- ir_graph *irg, ir_node *bl, ir_node *in)
+ir_node *be_new_Spill(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *to_spill, ir_node *ctx)
{
- ir_node *ins[1];
- ir_op *op = get_op(factory, cls, node_kind_copy)->op;
+ be_spill_attr_t *a;
+ ir_node *in[1];
+ ir_node *res;
+
+ in[0] = to_spill;
+ res = new_ir_node(NULL, irg, bl, op_Spill, mode_M, 1, in);
+ a = init_node_attr(res, cls, irg, 0);
+ a->offset = BE_SPILL_NO_OFFSET;
+ a->spill_ctx = ctx;
+ return res;
+}
- ins[0] = in;
+ir_node *be_new_Reload(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *mem)
+{
+ ir_node *in[1];
+ ir_node *res;
- return new_ir_node(NULL, irg, bl, op, get_irn_mode(in), 1, ins);
+ in[0] = mem;
+ res = new_ir_node(NULL, irg, bl, op_Reload, mode, 1, in);
+ init_node_attr(res, cls, irg, 1);
+ return res;
}
-#if 0
-ir_node *be_spill(const be_node_factory_t *factory, ir_node *irn)
+ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
{
- ir_node *bl = get_nodes_block(irn);
- ir_graph *irg = get_irn_irg(bl);
- ir_node *spill =
- new_Spill(factory, arch_get_irn_reg_class(irn), irg, bl, irn);
- sched_add_after(irn, spill);
- return spill;
+ ir_node *irn = new_ir_node(NULL, irg, bl, op_Perm, mode_T, n, in);
+ init_node_attr(irn, cls, irg, n);
+ return irn;
}
-#endif
-
+ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
+{
+ ir_node *in[1];
+ ir_node *res;
+ in[0] = op;
+ res = new_ir_node(NULL, irg, bl, op_Copy, get_irn_mode(op), 1, in);
+ init_node_attr(res, cls, irg, 1);
+ return res;
+}
-/**
- * If the node is a proj, reset the node to the proj's target and return
- * the proj number.
- * @param node The address of a node pointer.
- * @param def A default value.
- * @return If *node is a Proj, *node is set to the Proj's target and
- * the Proj number is returned. Else *node remains the same and @p def
- * is returned.
- */
-static int redir_proj(const ir_node **node, int def)
+ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
{
- const ir_node *n = *node;
+ ir_node *irn;
- if(is_Proj(n)) {
- *node = get_Proj_pred(n);
- def = get_Proj_proj(n);
- }
+ irn = new_ir_node(NULL, irg, bl, op_Keep, mode_ANY, n, in);
+ init_node_attr(irn, cls, irg, 0);
+ keep_alive(irn);
+ return irn;
+}
- return def;
+int be_is_Spill(const ir_node *irn)
+{
+ return get_irn_be_opcode(irn) == beo_Spill;
}
-static const arch_register_req_t *
-be_node_get_irn_reg_req(const arch_irn_ops_t *_self,
- arch_register_req_t *req, const ir_node *irn, int pos)
+int be_is_Reload(const ir_node *irn)
{
- be_op_t *bo;
- const be_node_factory_t *factory =
- container_of(_self, const be_node_factory_t, irn_ops);
+ return get_irn_be_opcode(irn) == beo_Reload;
+}
- pos = arch_pos_make_out(redir_proj(&irn, arch_pos_get_index(pos)));
+int be_is_Copy(const ir_node *irn)
+{
+ return get_irn_be_opcode(irn) == beo_Copy;
+}
- bo = pmap_get(factory->irn_op_map, get_irn_op(irn));
+int be_is_Perm(const ir_node *irn)
+{
+ return get_irn_be_opcode(irn) == beo_Perm;
+}
- if(bo) {
- int i;
+int be_is_Keep(const ir_node *irn)
+{
+ return get_irn_be_opcode(irn) == beo_Keep;
+}
- req->type = arch_register_req_type_normal;
- req->cls = bo->cls;
+void be_set_Perm_out_req(ir_node *irn, int pos, const arch_register_req_t *req)
+{
+ be_node_attr_t *a = get_irn_attr(irn);
- for(i = 0; i < bo->n_pos; ++pos)
- if(pos == bo->pos[i])
- return req;
- }
+ assert(be_is_Perm(irn));
+ assert(pos >= 0 && pos < get_irn_arity(irn));
+ memcpy(&a->reg_data[pos].req, req, sizeof(req[0]));
+}
- return NULL;
+void be_set_Spill_offset(ir_node *irn, unsigned offset)
+{
+ be_spill_attr_t *a = get_irn_attr(irn);
+ assert(be_is_Spill(irn));
+ a->offset = offset;
}
-static int
-be_node_get_n_operands(const arch_irn_ops_t *_self, const ir_node *irn, int in_out)
+static ir_node *find_a_spill_walker(ir_node *irn, unsigned visited_nr)
{
- be_op_t *bo;
- int i, res = 0;
- const be_node_factory_t *factory =
- container_of(_self, const be_node_factory_t, irn_ops);
+ if(get_irn_visited(irn) < visited_nr) {
+ set_irn_visited(irn, visited_nr);
+
+ if(is_Phi(irn)) {
+ int i, n;
+ for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
+ ir_node *n = find_a_spill_walker(get_irn_n(irn, i), visited_nr);
+ if(n != NULL)
+ return n;
+ }
+ }
+
+ else if(get_irn_be_opcode(irn) == beo_Spill)
+ return irn;
+ }
+
+ return NULL;
+}
- redir_proj(&irn, 0);
- bo = pmap_get(factory->irn_op_map, get_irn_op(irn));
+ir_node *be_get_Spill_context(const ir_node *irn) {
+ const be_spill_attr_t *a = get_irn_attr(irn);
+ assert(be_is_Spill(irn));
+ return a->spill_ctx;
+}
- for(i = 0; i < bo->n_pos; ++i)
- res += (bo->pos[i] ^ in_out) > 0;
+/**
+ * Finds a spill for a reload.
+ * If the reload is directly using the spill, this is simple,
+ * else we perform DFS from the reload (over all PhiMs) and return
+ * the first spill node we find.
+ */
+static INLINE ir_node *find_a_spill(ir_node *irn)
+{
+ ir_graph *irg = get_irn_irg(irn);
+ unsigned visited_nr = get_irg_visited(irg) + 1;
- return res;
+ assert(be_is_Reload(irn));
+ set_irg_visited(irg, visited_nr);
+ return find_a_spill_walker(irn, visited_nr);
}
-void
-be_node_set_irn_reg(const arch_irn_ops_t *_self, ir_node *irn,
- int idx, const arch_register_t *reg)
-{
- const arch_register_t **regs;
- idx = redir_proj((const ir_node **) &irn, idx);
- regs = (const arch_register_t **) &irn->attr;
- regs[idx] = reg;
+unsigned be_get_spill_offset(ir_node *irn)
+{
+ int opc = get_irn_opcode(irn);
+
+ switch(get_irn_be_opcode(irn)) {
+ case beo_Reload:
+ return be_get_spill_offset(find_a_spill(irn));
+ case beo_Spill:
+ {
+ be_spill_attr_t *a = get_irn_attr(irn);
+ return a->offset;
+ }
+ default:
+ assert(0 && "Must give spill/reload node");
+ }
+
+ return (unsigned) -1;
}
-const arch_register_t *
-be_node_get_irn_reg(const arch_irn_ops_t *_self, const ir_node *irn, int idx)
+ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx)
{
- const arch_register_t **regs;
+ const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
+
+ ir_node *bl = get_nodes_block(irn);
+ ir_graph *irg = get_irn_irg(bl);
+ ir_node *spill = be_new_Spill(cls, irg, bl, irn, ctx);
+ ir_node *insert;
+
+ /*
+ * search the right insertion point. a spill of a phi cannot be put
+ * directly after the phi, if there are some phis behind the one which
+ * is spilled.
+ */
+ insert = sched_next(irn);
+ while(is_Phi(insert) && !sched_is_end(insert))
+ insert = sched_next(insert);
- idx = redir_proj(&irn, idx);
- regs = (const arch_register_t **) &irn->attr;
- return regs[idx];
+ sched_add_before(insert, spill);
+ return spill;
}
-arch_irn_class_t be_node_classify(const arch_irn_ops_t *_self, const ir_node *irn)
+ir_node *be_reload(const arch_env_t *arch_env,
+ const arch_register_class_t *cls,
+ ir_node *irn, int pos, ir_mode *mode, ir_node *spill)
{
- const be_node_factory_t *factory =
- container_of(_self, const be_node_factory_t, irn_ops);
+ ir_node *reload;
- be_op_t *bo;
- int idx;
+ ir_node *bl = get_nodes_block(irn);
+ ir_graph *irg = get_irn_irg(bl);
- idx = redir_proj(&irn, 0);
- bo = pmap_get(factory->irn_op_map, get_irn_op(irn));
+ assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
- /* TODO Implement */
- return 0;
+ reload = be_new_Reload(cls, irg, bl, mode, spill);
+
+ set_irn_n(irn, pos, reload);
+ sched_add_before(irn, reload);
+ return reload;
}
-static const arch_irn_ops_t *
-be_node_get_irn_ops(const arch_irn_handler_t *_self, const ir_node *irn)
+static int redir_proj(const ir_node **node, int pos)
{
- be_op_t *bo;
- const be_node_factory_t *factory =
- container_of(_self, const be_node_factory_t, handler);
+ const ir_node *n = *node;
- redir_proj(&irn, 0);
- bo = pmap_get(factory->irn_op_map, get_irn_op(irn));
+ if(is_Proj(n)) {
+ assert(pos == -1 && "Illegal pos for a Proj");
+ *node = get_Proj_pred(n);
+ return get_Proj_proj(n);
+ }
- return bo ? &factory->irn_ops : NULL;
+ return 0;
}
-const arch_irn_handler_t *be_node_get_irn_handler(const be_node_factory_t *f)
+static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos)
{
- return &f->handler;
+ const be_node_attr_t *a = get_irn_attr(irn);
+
+
+ if(out_pos < a->n_outs)
+ memcpy(req, &a->reg_data[out_pos].req, sizeof(req[0]));
+ else {
+ req->type = arch_register_req_type_none;
+ req->cls = NULL;
+ }
+
+ return req;
}
-int is_Spill(const be_node_factory_t *f, const ir_node *irn)
+static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos)
{
- be_op_t *bo;
- bo = pmap_get(f->irn_op_map, get_irn_op(irn));
- return bo->kind == node_kind_spill;
+ const be_node_attr_t *a = get_irn_attr(irn);
+ int n = get_irn_arity(irn);
+
+ req->type = arch_register_req_type_none;
+ req->cls = NULL;
+
+ switch(get_irn_be_opcode(irn)) {
+ case beo_Spill:
+ case beo_Copy:
+ case beo_Keep:
+ case beo_Perm:
+ if(pos < n) {
+ req->type = arch_register_req_type_normal;
+ req->cls = a->cls;
+ }
+ break;
+ case beo_Reload:
+ default:
+ req = NULL;
+ }
+
+ return req;
}
-be_node_factory_t *be_node_factory_init(be_node_factory_t *factory,
- const arch_isa_if_t *isa)
-{
- char buf[256];
- int i, j, n;
-
- factory->ops = new_set(cmp_op_map, 64);
- factory->irn_op_map = pmap_create();
- obstack_init(&factory->obst);
-
- factory->handler.get_irn_ops = be_node_get_irn_ops;
-
- factory->irn_ops.get_irn_reg_req = be_node_get_irn_reg_req;
- factory->irn_ops.get_n_operands = be_node_get_n_operands;
- factory->irn_ops.set_irn_reg = be_node_set_irn_reg;
- factory->irn_ops.get_irn_reg = be_node_get_irn_reg;
- factory->irn_ops.classify = be_node_classify;
-
- for(i = 0, n = isa->get_n_reg_class(); i < n; ++i) {
- const arch_register_class_t *cls = isa->get_reg_class(i);
- be_op_t *ent;
-
- ent = get_op(factory, cls, node_kind_spill);
- snprintf(buf, sizeof(buf), "Spill_%s", cls->name);
- ent->op = new_ir_op(get_next_ir_opcode(), buf, op_pin_state_pinned,
- 0, 0, oparity_unary, 0);
- ent->n_pos = ARRSIZE(templ_pos_Spill);
- ent->pos = templ_pos_Spill;
- pmap_insert(factory->irn_op_map, ent->op, ent);
-
- ent = get_op(factory, cls, node_kind_reload);
- snprintf(buf, sizeof(buf), "Reload_%s", cls->name);
- ent->op = new_ir_op(get_next_ir_opcode(), buf, op_pin_state_pinned, 0, 0,
- oparity_unary, sizeof(const arch_register_t *));
- ent->n_pos = ARRSIZE(templ_pos_Reload);
- ent->pos = templ_pos_Reload;
- pmap_insert(factory->irn_op_map, ent->op, ent);
-
- ent = get_op(factory, cls, node_kind_copy);
- snprintf(buf, sizeof(buf), "Copy_%s", cls->name);
- ent->op = new_ir_op(get_next_ir_opcode(), buf, op_pin_state_pinned, 0, 0,
- oparity_unary, sizeof(const arch_register_t *));
- ent->n_pos = ARRSIZE(templ_pos_Copy);
- ent->pos = templ_pos_Copy;
- pmap_insert(factory->irn_op_map, ent->op, ent);
-
- ent = get_op(factory, cls, node_kind_perm);
- snprintf(buf, sizeof(buf), "Perm_%s", cls->name);
- ent->op = new_ir_op(get_next_ir_opcode(), buf, op_pin_state_pinned, 0, 0,
- oparity_variable, sizeof(const arch_register_t) * cls->n_regs);
- ent->n_pos = 2 * cls->n_regs;
- ent->pos = obstack_alloc(&factory->obst, sizeof(ent->pos[0]) * ent->n_pos);
- for(j = 0; j < ent->n_pos; j += 2) {
- ent->pos[j] = arch_pos_make_in(j);
- ent->pos[j + 1] = arch_pos_make_out(j);
- }
- pmap_insert(factory->irn_op_map, ent->op, ent);
-
- }
-
- return factory;
-}
-
-ir_node *insert_Perm_after(const be_main_session_env_t *env,
- const arch_register_class_t *cls, ir_node *pos)
+static const arch_register_req_t *
+be_node_get_irn_reg_req(const arch_irn_ops_t *self, arch_register_req_t *req, const ir_node *irn, int pos)
{
- const arch_env_t *arch_env = env->main_env->arch_env;
- ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
- ir_graph *irg = get_irn_irg(bl);
- pset *live = put_live_end(bl, pset_new_ptr_default());
- ir_node *curr, *irn, *perm, **nodes;
- firm_dbg_module_t *dbg = firm_dbg_register("firm.be.node");
- int i, n;
+ int out_pos = pos;
- firm_dbg_set_mask(dbg, DBG_LEVEL);
- DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", pos));
+ if(pos < 0) {
+ if(get_irn_mode(irn) == mode_T)
+ return NULL;
- sched_foreach_reverse(bl, irn) {
- ir_node *x;
+ out_pos = redir_proj((const ir_node **) &irn, pos);
+ assert(is_be_node(irn));
+ return put_out_reg_req(req, irn, out_pos);
+ }
- /*
- * If we encounter the node we want to insert the Perm after,
- * exit immediately, so that this node is still live
- */
- if(irn == pos)
- break;
-
- DBG((dbg, LEVEL_1, "%+F\n", irn));
- for(x = pset_first(live); x; x = pset_next(live))
- DBG((dbg, LEVEL_1, "\tlive: %+F\n", x));
+ else {
+ return is_be_node(irn) ? put_in_reg_req(req, irn, pos) : NULL;
+ }
- if(arch_irn_has_reg_class(arch_env, irn, arch_pos_make_out(0), cls))
- pset_remove_ptr(live, irn);
+ return req;
+}
- for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
- ir_node *op = get_irn_n(irn, i);
+static void
+be_node_set_irn_reg(const arch_irn_ops_t *_self, ir_node *irn, const arch_register_t *reg)
+{
+ int out_pos;
+ be_node_attr_t *a;
- if(arch_irn_has_reg_class(arch_env, op, arch_pos_make_out(0), cls))
- pset_insert_ptr(live, op);
- }
- }
+ out_pos = redir_proj(&irn, -1);
+ a = get_irn_attr(irn);
- n = pset_count(live);
- nodes = malloc(n * sizeof(nodes[0]));
+ assert(is_be_node(irn));
+ assert(out_pos < a->n_outs && "position too high");
+ a->reg_data[out_pos].reg = reg;
+}
- DBG((dbg, LEVEL_1, "live:\n"));
- for(irn = pset_first(live), i = 0; irn; irn = pset_next(live), i++) {
- DBG((dbg, LEVEL_1, "\t%+F\n", irn));
- nodes[i] = irn;
- }
+const arch_register_t *
+be_node_get_irn_reg(const arch_irn_ops_t *_self, const ir_node *irn)
+{
+ int out_pos;
+ be_node_attr_t *a;
- perm = new_Perm(env->main_env->node_factory, cls, irg, bl, n, nodes);
- sched_add_after(pos, perm);
- free(nodes);
+ out_pos = redir_proj(&irn, -1);
+ a = get_irn_attr(irn);
- curr = perm;
- for(i = 0; i < n; ++i) {
- ir_node *copies[1];
- ir_node *perm_op = get_irn_n(perm, i);
- const arch_register_t *reg = arch_get_irn_register(arch_env, perm_op, 0);
+ assert(is_be_node(irn));
+ assert(out_pos < a->n_outs && "position too high");
- ir_mode *mode = get_irn_mode(perm_op);
- ir_node *proj = new_r_Proj(irg, bl, perm, mode, i);
- arch_set_irn_register(arch_env, proj, 0, reg);
+ return a->reg_data[out_pos].reg;
+}
- sched_add_after(curr, proj);
- curr = proj;
+arch_irn_class_t be_node_classify(const arch_irn_ops_t *_self, const ir_node *irn)
+{
+ redir_proj(&irn, -1);
+
+ switch(get_irn_be_opcode(irn)) {
+#define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b;
+ XXX(Spill, spill)
+ XXX(Reload, reload)
+ XXX(Perm, perm)
+ XXX(Copy, copy)
+#undef XXX
+ default:
+ return 0;
+ }
+
+ return 0;
+}
- copies[0] = proj;
- be_introduce_copies(env->dom_front, perm_op, array_size(copies), copies);
- }
- return perm;
+arch_irn_class_t be_node_get_flags(const arch_irn_ops_t *_self, const ir_node *irn)
+{
+ return 0;
}
-#if 0
-typedef struct _phi_perm_info_t {
- const be_main_session_env_t *env;
- const arch_register_class_t *cls;
- pmap *perm_map;
-} phi_perm_info_t;
+static const arch_irn_ops_t be_node_irn_ops = {
+ be_node_get_irn_reg_req,
+ be_node_set_irn_reg,
+ be_node_get_irn_reg,
+ be_node_classify,
+ be_node_get_flags,
+};
-static void clear_link(ir_node *irn, void *data)
+const arch_irn_ops_t *be_node_get_arch_ops(const arch_irn_handler_t *self, const ir_node *irn)
{
- set_irn_link(irn, NULL);
+ redir_proj((const ir_node **) &irn, -1);
+ return is_be_node(irn) ? &be_node_irn_ops : NULL;
}
-static void collect_phis(ir_node *irn, void *data)
-{
- phi_perm_info_t *pi = data;
- if(is_Phi(irn) && arch_irn_has_reg_class(pi->env->main_env->arch_env,
- irn, arch_pos_make_out(0), pi->cls)) {
+const arch_irn_handler_t be_node_irn_handler = {
+ be_node_get_arch_ops
+};
- ir_node *bl = get_nodes_block(irn);
- set_irn_link(irn, get_irn_link(bl));
- set_irn_link(bl, irn);
- }
+static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
+{
+ be_node_attr_t *at = get_irn_attr(irn);
+ int i;
+
+ assert(is_be_node(irn));
+
+ switch(reason) {
+ case dump_node_opcode_txt:
+ fprintf(f, get_op_name(get_irn_op(irn)));
+ break;
+ case dump_node_mode_txt:
+ fprintf(f, get_mode_name(get_irn_mode(irn)));
+ break;
+ case dump_node_nodeattr_txt:
+ break;
+ case dump_node_info_txt:
+ fprintf(f, "reg class: %s\n", at->cls->name);
+ for(i = 0; i < at->n_outs; ++i) {
+ const arch_register_t *reg = at->reg_data[i].reg;
+ fprintf(f, "reg #%d: %s\n", i, reg ? reg->name : "n/a");
+ }
+
+ if(get_irn_be_opcode(irn) == beo_Spill) {
+ be_spill_attr_t *a = (be_spill_attr_t *) at;
+ ir_fprintf(f, "spill context: %+F\n", a->spill_ctx);
+ ir_fprintf(f, "spill offset: %04x (%u)\n", a->offset);
+ }
+ break;
+ }
+
+ return 0;
}
-/* This is only semi-ugly :-) */
-#define INT_TO_PTR(i) ((void *) ((char *) 0 + (i)))
-#define PTR_TO_INT(p) ((int) ((char *) (p) - (char *) 0))
+static const ir_op_ops be_node_op_ops = {
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ dump_node,
+ NULL
+};
-static void insert_phi_perms(ir_node *bl, void *data)
+ir_node *insert_Perm_after(const arch_env_t *arch_env,
+ const arch_register_class_t *cls,
+ dom_front_info_t *dom_front,
+ ir_node *pos)
{
- phi_perm_info_t *pi = data;
- ir_graph *irg = pi->env->irg;
+ ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
+ ir_graph *irg = get_irn_irg(bl);
+ pset *live = pset_new_ptr_default();
+ firm_dbg_module_t *dbg = firm_dbg_register("be.node");
- assert(is_Block(bl));
+ irn_live_t *li;
+ ir_node *curr, *irn, *perm, **nodes;
+ int i, n;
- /* If the link flag is NULL, this block has no phis. */
- if(get_irn_link(bl)) {
- int i, n;
+ DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", pos));
- /* Look at all predecessors of the phi block */
- for(i = 0, n = get_irn_arity(bl); i < n; ++i) {
- ir_node *pred_bl = get_Block_cfgpred_block(bl, i);
- ir_node *phi, *perm;
- ir_node **in;
- int n_phis = 0;
- int j;
- for(phi = get_irn_link(bl); phi; phi = get_irn_link(phi))
- n_phis++;
+ live_foreach(bl, li) {
+ ir_node *irn = (ir_node *) li->irn;
+ if(live_is_end(li) && arch_irn_has_reg_class(arch_env, irn, -1, cls))
+ pset_insert_ptr(live, irn);
+ }
- in = malloc(n_phis * sizeof(in[0]));
+ sched_foreach_reverse(bl, irn) {
+ ir_node *x;
- /* Look at all phis in this block */
- j = 0;
- for(phi = get_irn_link(bl); phi; phi = get_irn_link(phi))
- in[j++] = get_irn_n(phi, i);
+ /*
+ * If we encounter the node we want to insert the Perm after,
+ * exit immediately, so that this node is still live
+ */
+ if(irn == pos)
+ break;
- perm = new_Perm(pi->env->main_env->node_factory, pi->cls, irg, pred_bl, n_phis, in);
+ DBG((dbg, LEVEL_1, "%+F\n", irn));
+ for(x = pset_first(live); x; x = pset_next(live))
+ DBG((dbg, LEVEL_1, "\tlive: %+F\n", x));
- j = 0;
- for(phi = get_irn_link(bl); phi; phi = get_irn_link(phi)) {
- ir_node *proj = new_r_Proj(irg, pred_bl, perm, get_irn_mode(phi), j++);
- set_irn_n(phi, i, proj);
- }
+ if(arch_irn_has_reg_class(arch_env, irn, -1, cls))
+ pset_remove_ptr(live, irn);
- free(in);
- }
- }
-}
+ for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
+ ir_node *op = get_irn_n(irn, i);
-void be_insert_phi_perms(const be_main_session_env_t *env,
- const arch_register_class_t *cls)
-{
- phi_perm_info_t pi;
+ if(arch_irn_has_reg_class(arch_env, op, -1, cls))
+ pset_insert_ptr(live, op);
+ }
+ }
+
+ n = pset_count(live);
+
+ if(n == 0)
+ return NULL;
+
+ nodes = malloc(n * sizeof(nodes[0]));
- pi.env = env;
- pi.cls = cls;
- pi.perm_map = pmap_create();
+ DBG((dbg, LEVEL_1, "live:\n"));
+ for(irn = pset_first(live), i = 0; irn; irn = pset_next(live), i++) {
+ DBG((dbg, LEVEL_1, "\t%+F\n", irn));
+ nodes[i] = irn;
+ }
- irg_walk_graph(env->irg, clear_link, collect_phis, &pi);
- irg_block_walk_graph(env->irg, insert_phi_perms, NULL, &pi);
- pmap_destroy(pi.perm_map);
+ perm = be_new_Perm(cls, irg, bl, n, nodes);
+ sched_add_after(pos, perm);
+ free(nodes);
+
+ curr = perm;
+ for(i = 0; i < n; ++i) {
+ ir_node *copies[1];
+ ir_node *perm_op = get_irn_n(perm, i);
+ const arch_register_t *reg = arch_get_irn_register(arch_env, perm_op);
+
+ ir_mode *mode = get_irn_mode(perm_op);
+ ir_node *proj = new_r_Proj(irg, bl, perm, mode, i);
+ arch_set_irn_register(arch_env, proj, reg);
+
+ sched_add_after(curr, proj);
+ curr = proj;
+
+ copies[0] = proj;
+ be_introduce_copies(dom_front, perm_op, 1, copies);
+ }
+ return perm;
}
-#endif