*
* 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 enum {
+ be_req_kind_old_limited,
+ be_req_kind_negate_old_limited,
+ be_req_kind_single_reg
+} be_req_kind_t;
-static int templ_pos_Reload[] = {
- arch_pos_make_out(0)
-};
+typedef struct {
+ arch_register_req_t req;
+ be_req_kind_t kind;
+ union {
+ struct {
+ void (*old_limited)(void *ptr, bitset_t *bs);
+ void *old_limited_env;
+ } old_limited;
+
+ const arch_register_t *single_reg;
+ } x;
+} be_req_t;
-static int templ_pos_Copy[] = {
- arch_pos_make_in(0),
- arch_pos_make_out(0)
-};
+typedef struct {
+ const arch_register_t *reg;
+ be_req_t req;
+ be_req_t in_req;
+} be_reg_data_t;
+
+typedef struct {
+ int max_reg_data;
+ arch_irn_flags_t flags;
+ const arch_register_class_t *cls;
+ be_reg_data_t *reg_data;
+} be_node_attr_t;
+
+typedef struct {
+ be_node_attr_t node_attr;
+ ir_node *spill_ctx; /**< The node in whose context this spill was introduced. */
+ entity *ent; /**< The entity in the stack frame the spill writes to. */
+} be_spill_attr_t;
+
+typedef struct {
+ be_node_attr_t node_attr;
+ int offset; /**< The offset by which the stack shall be increased/decreased. */
+ be_stack_dir_t dir; /**< The direction in which the stack shall be modified (along or in the other direction). */
+} be_stack_attr_t;
+
+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 ir_op *op_Call;
+static ir_op *op_IncSP;
+static ir_op *op_AddSP;
+static ir_op *op_RegParams;
+static ir_op *op_StackParam;
+static ir_op *op_NoReg;
+
+static int beo_base = -1;
+
+static const ir_op_ops be_node_op_ops;
+
+#define N irop_flag_none
+#define L irop_flag_labeled
+#define C irop_flag_commutative
+#define X irop_flag_cfopcode
+#define I irop_flag_ip_cfopcode
+#define F irop_flag_fragile
+#define Y irop_flag_forking
+#define H irop_flag_highlevel
+#define c irop_flag_constlike
+#define K irop_flag_keep
+
+void be_node_init(void) {
+ static int inited = 0;
+
+ if(inited)
+ return;
+
+ inited = 1;
+
+ /* Acquire all needed opcodes. */
+ beo_base = get_next_ir_opcodes(beo_Last - 1);
+
+ op_Spill = new_ir_op(beo_base + beo_Spill, "Spill", op_pin_state_mem_pinned, N, 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, N, 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, N, 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, N, 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, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_NoReg = new_ir_op(beo_base + beo_Keep, "NoReg", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_Call = new_ir_op(beo_base + beo_Keep, "Call", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_AddSP = new_ir_op(beo_base + beo_Keep, "AddSP", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_stack_attr_t), &be_node_op_ops);
+ op_IncSP = new_ir_op(beo_base + beo_Keep, "IncSP", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_stack_attr_t), &be_node_op_ops);
+ op_RegParams = new_ir_op(beo_base + beo_Keep, "RegParams", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_StackParam = new_ir_op(beo_base + beo_Keep, "StackParam", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_stack_attr_t), &be_node_op_ops);
+
+ 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);
+ set_op_tag(op_NoReg, &be_node_tag);
+ set_op_tag(op_Call, &be_node_tag);
+ set_op_tag(op_AddSP, &be_node_tag);
+ set_op_tag(op_IncSP, &be_node_tag);
+ set_op_tag(op_RegParams, &be_node_tag);
+ set_op_tag(op_StackParam, &be_node_tag);
+}
-#define ARRSIZE(x) (sizeof(x) / sizeof(x[0]))
+static void *init_node_attr(ir_node* irn, const arch_register_class_t *cls, ir_graph *irg, int max_reg_data)
+{
+ be_node_attr_t *a = get_irn_attr(irn);
+
+ a->max_reg_data = max_reg_data;
+ a->flags = arch_irn_flags_none;
+ a->cls = cls;
+ a->reg_data = NULL;
+
+ if(max_reg_data > 0) {
+ int i;
+
+ a->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(irg), max_reg_data);
+ memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
+ for(i = 0; i < max_reg_data; ++i) {
+ a->reg_data[i].req.req.cls = cls;
+ a->reg_data[i].req.req.type = arch_register_req_type_normal;
+ }
+ }
-static int cmp_op_map(const void *a, const void *b, size_t size)
+ return a;
+}
+
+static INLINE int is_be_node(const ir_node *irn)
{
- const be_op_t *x = a;
- const be_op_t *y = b;
+ return get_op_tag(get_irn_op(irn)) == &be_node_tag;
+}
- return !(x->kind == y->kind && x->cls == y->cls);
+be_opcode_t get_irn_be_opcode(const ir_node *irn)
+{
+ return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp;
}
-static be_op_t *get_op(const be_node_factory_t *fact,
- const arch_register_class_t *cls, node_kind_t kind)
+static int redir_proj(const ir_node **node, int pos)
{
- be_op_t templ;
+ const ir_node *n = *node;
- templ.kind = kind;
- templ.cls = cls;
+ if(is_Proj(n)) {
+ assert(pos == -1 && "Illegal pos for a Proj");
+ *node = get_Proj_pred(n);
+ return get_Proj_proj(n);
+ }
- return set_insert(fact->ops, &templ, sizeof(templ),
- HASH_PTR(cls) + 7 * kind);
+ return 0;
}
-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)
+static void
+be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg)
{
- ir_node *in[1];
- ir_op *op = get_op(factory, cls, node_kind_spill)->op;
+ int out_pos;
+ be_node_attr_t *a;
- assert(op && "Spill opcode must be present for this register class");
- in[0] = node_to_spill;
+ out_pos = redir_proj((const ir_node **) &irn, -1);
+ a = get_irn_attr(irn);
- return new_ir_node(NULL, irg, bl, op, mode_M, 1, in);
+ assert(is_be_node(irn));
+ assert(out_pos < a->max_reg_data && "position too high");
+ a->reg_data[out_pos].reg = reg;
}
-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)
+
+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 *in[1];
- ir_op *op = get_op(factory, cls, node_kind_reload)->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->ent = NULL;
+ a->spill_ctx = ctx;
+ return res;
+}
- 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;
+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, mode, 1, in);
+ in[0] = mem;
+ res = new_ir_node(NULL, irg, bl, op_Reload, mode, 1, in);
+ init_node_attr(res, cls, irg, 1);
+ return res;
}
-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)
+ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
{
- ir_op *op = get_op(factory, cls, node_kind_perm)->op;
+ ir_node *irn = new_ir_node(NULL, irg, bl, op_Perm, mode_T, n, in);
+ init_node_attr(irn, cls, irg, n);
+ return irn;
+}
- return new_ir_node(NULL, irg, bl, op, mode_T, arity, in);
+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;
}
-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_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
{
- ir_node *ins[1];
- ir_op *op = get_op(factory, cls, node_kind_copy)->op;
+ ir_node *irn;
- ins[0] = in;
+ 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 new_ir_node(NULL, irg, bl, op, get_irn_mode(in), 1, ins);
+ir_node *be_new_Call(ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr, int n_outs, int n, ir_node *in[])
+{
+ int real_n = 3 + n;
+ ir_node *irn;
+ ir_node **real_in;
+
+ real_in = malloc(sizeof(real_in[0]) * (real_n));
+
+ real_in[0] = mem;
+ real_in[1] = sp;
+ real_in[2] = ptr;
+ memcpy(&real_in[3], in, n * sizeof(in[0]));
+
+ irn = new_ir_node(NULL, irg, bl, op_Call, mode_T, real_n, real_in);
+ init_node_attr(irn, NULL, irg, (n_outs > real_n ? n_outs : real_n));
+ return irn;
}
-/**
- * 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_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, unsigned offset, be_stack_dir_t dir)
{
- const ir_node *n = *node;
+ be_stack_attr_t *a;
+ ir_node *irn;
+ ir_node *in[1];
+
+ in[0] = old_sp;
+ irn = new_ir_node(NULL, irg, bl, op_IncSP, sp->reg_class->mode, 1, in);
+ a = init_node_attr(irn, sp->reg_class, irg, 1);
+ a->dir = dir;
+ a->offset = offset;
+
+ a->node_attr.flags |= arch_irn_flags_ignore;
- if(is_Proj(n)) {
- *node = get_Proj_pred(n);
- def = get_Proj_proj(n);
- }
+ /* Set output constraint to stack register. */
+ be_set_constr_single_reg(irn, -1, sp);
+ be_node_set_irn_reg(NULL, irn, sp);
- return def;
+ return irn;
}
-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)
+ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *op)
{
- be_op_t *bo;
- const be_node_factory_t *factory =
- container_of(_self, const be_node_factory_t, irn_ops);
+ be_node_attr_t *a;
+ ir_node *irn;
+ ir_node *in[2];
- pos = arch_pos_make_out(redir_proj(&irn, arch_pos_get_index(pos)));
+ in[0] = old_sp;
+ in[1] = op;
+ irn = new_ir_node(NULL, irg, bl, op_AddSP, sp->reg_class->mode, 2, in);
+ a = init_node_attr(irn, sp->reg_class, irg, 1);
+ a->flags |= arch_irn_flags_ignore;
- bo = pmap_get(factory->irn_op_map, get_irn_op(irn));
+ /* Set output constraint to stack register. */
+ be_set_constr_single_reg(irn, -1, sp);
+ be_node_set_irn_reg(NULL, irn, sp);
- if(bo) {
- int i;
+ return irn;
+}
- req->type = arch_register_req_type_normal;
- req->cls = bo->cls;
+ir_node *be_new_NoReg(const arch_register_t *reg, ir_graph *irg, ir_node *bl)
+{
+ be_node_attr_t *a;
+ ir_node *irn;
+ ir_node *in[1];
+
+ irn = new_ir_node(NULL, irg, bl, op_NoReg, reg->reg_class->mode, 0, in);
+ a = init_node_attr(irn, reg->reg_class, irg, 1);
+ a->flags |= arch_irn_flags_ignore;
+ be_set_constr_single_reg(irn, -1, reg);
+ be_node_set_irn_reg(NULL, irn, reg);
+ return irn;
+}
- for(i = 0; i < bo->n_pos; ++pos)
- if(pos == bo->pos[i])
- return req;
- }
+ir_node *be_new_StackParam(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *frame_pointer, unsigned offset)
+{
+ be_stack_attr_t *a;
+ ir_node *irn;
+ ir_node *in[1];
+
+ in[0] = frame_pointer;
+ irn = new_ir_node(NULL, irg, bl, op_StackParam, mode, 1, in);
+ a = init_node_attr(irn, cls, irg, 1);
+ a->offset = offset;
+ return irn;
+}
- return NULL;
+int be_is_Spill (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Spill ; }
+int be_is_Reload (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Reload ; }
+int be_is_Copy (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Copy ; }
+int be_is_Perm (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Perm ; }
+int be_is_Keep (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Keep ; }
+int be_is_Call (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Call ; }
+int be_is_IncSP (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_IncSP ; }
+int be_is_AddSP (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_AddSP ; }
+int be_is_RegParams (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_RegParams ; }
+int be_is_StackParam (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_StackParam ; }
+int be_is_NoReg (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_NoReg ; }
+
+static void be_limited(void *data, bitset_t *bs)
+{
+ be_req_t *req = data;
+
+ switch(req->kind) {
+ case be_req_kind_negate_old_limited:
+ case be_req_kind_old_limited:
+ req->x.old_limited.old_limited(req->x.old_limited.old_limited_env, bs);
+ if(req->kind == be_req_kind_negate_old_limited)
+ bitset_flip_all(bs);
+ break;
+ case be_req_kind_single_reg:
+ bitset_clear_all(bs);
+ bitset_set(bs, req->x.single_reg->index);
+ break;
+ }
}
-static int
-be_node_get_n_operands(const arch_irn_ops_t *_self, const ir_node *irn, int in_out)
+void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg)
{
- be_op_t *bo;
- int i, res = 0;
- const be_node_factory_t *factory =
- container_of(_self, const be_node_factory_t, irn_ops);
+ int idx = pos < 0 ? -(pos - 1) : pos;
+ be_node_attr_t *a = get_irn_attr(irn);
+ be_reg_data_t *rd = &a->reg_data[idx];
+ be_req_t *r = pos < 0 ? &rd->req : &rd->in_req;
+
+ assert(is_be_node(irn));
+ assert(!(pos >= 0) || pos < get_irn_arity(irn));
+ assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data);
+
+ r->kind = be_req_kind_single_reg;
+ r->x.single_reg = reg;
+ r->req.limited = be_limited;
+ r->req.limited_env = r;
+ r->req.type = arch_register_req_type_limited;
+ r->req.cls = reg->reg_class;
+}
- redir_proj(&irn, 0);
- bo = pmap_get(factory->irn_op_map, get_irn_op(irn));
+void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req)
+{
+ int idx = pos < 0 ? -(pos - 1) : pos;
+ be_node_attr_t *a = get_irn_attr(irn);
+ be_reg_data_t *rd = &a->reg_data[idx];
+ be_req_t *r = pos < 0 ? &rd->req : &rd->in_req;
+
+ assert(is_be_node(irn));
+ assert(!(pos >= 0) || pos < get_irn_arity(irn));
+ assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data);
+ assert(arch_register_req_is(req, limited));
+
+ r->kind = be_req_kind_old_limited;
+ r->req.limited = be_limited;
+ r->req.limited_env = r;
+ r->req.type = arch_register_req_type_limited;
+ r->req.cls = req->cls;
+
+ r->x.old_limited.old_limited = req->limited;
+ r->x.old_limited.old_limited_env = req->limited_env;
+}
- for(i = 0; i < bo->n_pos; ++i)
- res += (bo->pos[i] ^ in_out) > 0;
+void be_set_IncSP_offset(ir_node *irn, unsigned offset)
+{
+ be_stack_attr_t *a = get_irn_attr(irn);
+ assert(be_is_IncSP(irn));
+ a->offset = offset;
+}
+
+unsigned be_get_IncSP_offset(ir_node *irn)
+{
+ be_stack_attr_t *a = get_irn_attr(irn);
+ assert(be_is_IncSP(irn));
+ return a->offset;
+}
- return res;
+void be_set_IncSP_direction(ir_node *irn, be_stack_dir_t dir)
+{
+ be_stack_attr_t *a = get_irn_attr(irn);
+ assert(be_is_IncSP(irn));
+ a->dir = dir;
}
-void
-be_node_set_irn_reg(const arch_irn_ops_t *_self, ir_node *irn,
- int idx, const arch_register_t *reg)
+be_stack_dir_t be_get_IncSP_direction(ir_node *irn)
{
- const arch_register_t **regs;
+ be_stack_attr_t *a = get_irn_attr(irn);
+ assert(be_is_IncSP(irn));
+ return a->dir;
+}
- idx = redir_proj((const ir_node **) &irn, idx);
- regs = (const arch_register_t **) &irn->attr;
- regs[idx] = reg;
+void be_set_Spill_entity(ir_node *irn, entity *ent)
+{
+ be_spill_attr_t *a = get_irn_attr(irn);
+ assert(be_is_Spill(irn));
+ a->ent = ent;
}
-const arch_register_t *
-be_node_get_irn_reg(const arch_irn_ops_t *_self, const ir_node *irn, int idx)
+static ir_node *find_a_spill_walker(ir_node *irn, unsigned visited_nr)
{
- const arch_register_t **regs;
+ 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;
+}
- idx = redir_proj(&irn, idx);
- regs = (const arch_register_t **) &irn->attr;
- return regs[idx];
+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;
}
-arch_irn_class_t be_node_classify(const arch_irn_ops_t *_self, const ir_node *irn)
+/**
+ * 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;
+
+ assert(be_is_Reload(irn));
+ set_irg_visited(irg, visited_nr);
+ return find_a_spill_walker(irn, visited_nr);
+}
+
+entity *be_get_spill_entity(ir_node *irn)
{
- const be_node_factory_t *factory =
- container_of(_self, const be_node_factory_t, irn_ops);
+ int opc = get_irn_opcode(irn);
+
+ switch(get_irn_be_opcode(irn)) {
+ case beo_Reload:
+ return be_get_spill_entity(find_a_spill(irn));
+ case beo_Spill:
+ {
+ be_spill_attr_t *a = get_irn_attr(irn);
+ return a->ent;
+ }
+ default:
+ assert(0 && "Must give spill/reload node");
+ }
+
+ return NULL;
+}
- be_op_t *bo;
- int idx;
+ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx)
+{
+ const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
- idx = redir_proj(&irn, 0);
- bo = pmap_get(factory->irn_op_map, get_irn_op(irn));
+ 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;
- return 0;
+ /*
+ * 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);
+
+ sched_add_before(insert, spill);
+ return spill;
}
-static const arch_irn_ops_t *
-be_node_get_irn_ops(const arch_irn_handler_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)
{
- be_op_t *bo;
- const be_node_factory_t *factory =
- container_of(_self, const be_node_factory_t, handler);
+ ir_node *reload;
+
+ ir_node *bl = get_nodes_block(irn);
+ ir_graph *irg = get_irn_irg(bl);
+
+ assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
+
+ reload = be_new_Reload(cls, irg, bl, mode, spill);
+
+ set_irn_n(irn, pos, reload);
+ sched_add_before(irn, reload);
+ return reload;
+}
+
+static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos)
+{
+ const be_node_attr_t *a = get_irn_attr(irn);
+
+ if(out_pos < a->max_reg_data)
+ memcpy(req, &a->reg_data[out_pos].req, sizeof(req[0]));
+ else {
+ req->type = arch_register_req_type_none;
+ req->cls = NULL;
+ }
+
+ return req;
+}
+
+static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos)
+{
+ const be_node_attr_t *a = get_irn_attr(irn);
+ int n = get_irn_arity(irn);
+
+ if(pos < get_irn_arity(irn))
+ memcpy(req, &a->reg_data[pos].in_req, sizeof(req[0]));
+ else {
+ req->type = arch_register_req_type_none;
+ req->cls = NULL;
+ }
+
+ return req;
+}
+
+static const arch_register_req_t *
+be_node_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos)
+{
+ int out_pos = pos;
+
+ if(pos < 0) {
+ if(get_irn_mode(irn) == mode_T)
+ return NULL;
- redir_proj(&irn, 0);
- bo = pmap_get(factory->irn_op_map, get_irn_op(irn));
+ out_pos = redir_proj((const ir_node **) &irn, pos);
+ assert(is_be_node(irn));
+ return put_out_reg_req(req, irn, out_pos);
+ }
- return bo ? &factory->irn_ops : NULL;
+ else {
+ return is_be_node(irn) ? put_in_reg_req(req, irn, pos) : NULL;
+ }
+
+ return req;
}
-const arch_irn_handler_t *be_node_get_irn_handler(const be_node_factory_t *f)
+const arch_register_t *
+be_node_get_irn_reg(const void *_self, const ir_node *irn)
{
- return &f->handler;
+ int out_pos;
+ be_node_attr_t *a;
+
+ out_pos = redir_proj((const ir_node **) &irn, -1);
+ a = get_irn_attr(irn);
+
+ assert(is_be_node(irn));
+ assert(out_pos < a->max_reg_data && "position too high");
+
+ return a->reg_data[out_pos].reg;
}
-int is_Spill(const be_node_factory_t *f, const ir_node *irn)
+arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn)
{
- be_op_t *bo;
- bo = pmap_get(f->irn_op_map, get_irn_op(irn));
- return bo->kind == node_kind_spill;
+ redir_proj((const ir_node **) &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;
}
-be_node_factory_t *be_node_factory_init(be_node_factory_t *factory,
- const arch_isa_if_t *isa)
+arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *irn)
{
- char buf[256];
- int i, j, n;
+ be_node_attr_t *a = get_irn_attr(irn);
+ return a->flags;
+}
- factory->ops = new_set(cmp_op_map, 64);
- factory->irn_op_map = pmap_create();
- obstack_init(&factory->obst);
+static const arch_irn_ops_if_t be_node_irn_ops_if = {
+ be_node_get_irn_reg_req,
+ be_node_set_irn_reg,
+ be_node_get_irn_reg,
+ be_node_classify,
+ be_node_get_flags,
+};
- factory->handler.get_irn_ops = be_node_get_irn_ops;
+static const arch_irn_ops_t be_node_irn_ops = {
+ &be_node_irn_ops_if
+};
- 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;
+const void *be_node_get_arch_ops(const arch_irn_handler_t *self, const ir_node *irn)
+{
+ redir_proj((const ir_node **) &irn, -1);
+ return is_be_node(irn) ? &be_node_irn_ops : NULL;
+}
- 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;
+const arch_irn_handler_t be_node_irn_handler = {
+ be_node_get_arch_ops
+};
- 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);
+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->max_reg_data; ++i) {
+ const arch_register_t *reg = at->reg_data[i].reg;
+ fprintf(f, "reg #%d: %s\n", i, reg ? reg->name : "n/a");
+ }
+
+ switch(get_irn_be_opcode(irn)) {
+ case beo_Spill:
+ {
+ be_spill_attr_t *a = (be_spill_attr_t *) at;
+
+ ir_fprintf(f, "spill context: %+F\n", a->spill_ctx);
+ if (a->ent) {
+ unsigned ofs = get_entity_offset_bytes(a->ent);
+ ir_fprintf(f, "spill entity: %+F offset %x (%d)\n", a->ent, ofs, ofs);
+ }
+ else {
+ ir_fprintf(f, "spill entity: n/a\n");
+ }
+ }
+ break;
+
+ case beo_IncSP:
+ {
+ be_stack_attr_t *a = (be_stack_attr_t *) at;
+ fprintf(f, "offset: %u\n", a->offset);
+ fprintf(f, "direction: %s\n", a->dir == be_stack_dir_along ? "along" : "against");
+ }
+ break;
+ }
+
+ }
+
+ return 0;
+}
- 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);
+void copy_attr(const ir_node *old_node, ir_node *new_node)
+{
+ be_node_attr_t *old_attr = get_irn_attr(old_attr);
+ be_node_attr_t *new_attr = get_irn_attr(new_node);
- 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);
+ assert(is_be_node(old_node));
+ assert(is_be_node(new_node));
- 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);
+ memcpy(new_attr, old_attr, old_node->op->attr_size);
- }
+ new_attr->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(get_irn_irg(new_node)), new_attr->max_reg_data);
+ memcpy(new_attr->reg_data, old_attr->reg_data, new_attr->max_reg_data * sizeof(be_reg_data_t));
+}
- return factory;
+static const ir_op_ops be_node_op_ops = {
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ copy_attr,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ dump_node,
+ NULL
+};
+
+pset *nodes_live_at(const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live)
+{
+ firm_dbg_module_t *dbg = firm_dbg_register("firm.be.node");
+ const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
+ ir_node *irn;
+ irn_live_t *li;
+
+ live_foreach(bl, li) {
+ ir_node *irn = (ir_node *) li->irn;
+ if(live_is_end(li) && arch_irn_consider_in_reg_alloc(arch_env, cls, irn))
+ pset_insert_ptr(live, irn);
+ }
+
+ sched_foreach_reverse(bl, irn) {
+ int i, n;
+ ir_node *x;
+
+ /*
+ * If we encounter the node we want to insert the Perm after,
+ * exit immediately, so that this node is still live
+ */
+ if(irn == pos)
+ return live;
+
+ 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));
+
+ if(arch_irn_has_reg_class(arch_env, irn, -1, cls))
+ pset_remove_ptr(live, irn);
+
+ for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
+ ir_node *op = get_irn_n(irn, i);
+
+ if(arch_irn_consider_in_reg_alloc(arch_env, cls, op))
+ pset_insert_ptr(live, op);
+ }
+ }
+
+ return live;
}
-ir_node *insert_Perm_after(const be_main_session_env_t *env,
- const arch_register_class_t *cls, ir_node *pos)
+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)
{
- 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;
+ 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");
- firm_dbg_set_mask(dbg, DBG_LEVEL);
- DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", pos));
+ ir_node *curr, *irn, *perm, **nodes;
+ int i, n;
- sched_foreach_reverse(bl, irn) {
- ir_node *x;
+ DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", 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));
-
- if(arch_irn_has_reg_class(arch_env, irn, arch_pos_make_out(0), cls))
- pset_remove_ptr(live, irn);
-
- for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
- ir_node *op = get_irn_n(irn, i);
-
- if(arch_irn_has_reg_class(arch_env, op, arch_pos_make_out(0), cls))
- pset_insert_ptr(live, op);
- }
- }
-
- n = pset_count(live);
- nodes = malloc(n * sizeof(nodes[0]));
-
- 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;
- }
-
- perm = new_Perm(env->main_env->node_factory, 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, 0);
-
- 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);
-
- sched_add_after(curr, proj);
- curr = proj;
-
- copies[0] = proj;
- be_introduce_copies(env->dom_front, perm_op, array_size(copies), copies);
- }
- return perm;
+ if(!nodes_live_at(arch_env, cls, pos, live));
+
+ n = pset_count(live);
+
+ if(n == 0)
+ return NULL;
+
+ nodes = malloc(n * sizeof(nodes[0]));
+
+ 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;
+ }
+
+ 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_ssa_constr_single(dom_front, perm_op, 1, copies);
+ }
+ return perm;
}
projects / libfirm / blobdiff