X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbenode.c;h=a189252a7408e89843671b5cc714248f736be9c8;hb=890fe2773c2fdba09fc899c6f51629f4c380059d;hp=b1c6f593424686798e5cd77cca25ecce82966d09;hpb=cdf28710bfb9bc07406af412d6780c7cdb9283d2;p=libfirm

diff --git a/ir/be/benode.c b/ir/be/benode.c
index b1c6f5934..a189252a7 100644
--- a/ir/be/benode.c
+++ b/ir/be/benode.c
@@ -5,14 +5,13 @@
  *
  * Backend node support.
  *
- * This file provdies Perm, Copy, Spill and Reload nodes.
+ * This file provides Perm, Copy, Spill and Reload nodes.
  *
- * Copyright (C) 2005 Universitaet Karlsruhe
+ * Copyright (C) 2005-2006 Universitaet Karlsruhe
  * Released under the GPL
  */
-
 #ifdef HAVE_CONFIG_H
-#include "config.h"
+#include <config.h>
 #endif
 
 #include <stdlib.h>
@@ -23,12 +22,17 @@
 #include "util.h"
 #include "debug.h"
 #include "fourcc.h"
+#include "offset.h"
+#include "bitfiddle.h"
+#include "raw_bitset.h"
 
 #include "irop_t.h"
 #include "irmode_t.h"
 #include "irnode_t.h"
 #include "ircons_t.h"
 #include "irprintf.h"
+#include "irgwalk.h"
+#include "iropt_t.h"
 
 #include "be_t.h"
 #include "belive_t.h"
@@ -37,466 +41,1455 @@
 
 #include "beirgmod.h"
 
+#define OUT_POS(x) (-((x) + 1))
+
 /* 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_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;
-} be_op_t;
+	arch_register_req_t req;
+	arch_irn_flags_t    flags;
+} be_req_t;
 
 typedef struct {
 	const arch_register_t *reg;
-	arch_register_req_t   req;
+	be_req_t req;
+	be_req_t in_req;
 } be_reg_data_t;
 
+/** The generic be nodes attribute type. */
 typedef struct {
-	int                         n_outs;
-	const arch_register_class_t *cls;
-	be_reg_data_t               *reg_data;
+	be_reg_data_t         *reg_data;
 } be_node_attr_t;
 
+/** The be_Return nodes attribute type. */
+typedef struct {
+	be_node_attr_t node_attr;
+	int            num_ret_vals;  /**< number of return values */
+} be_return_attr_t;
+
+/** The be_Stack attribute type. */
+typedef struct {
+	be_node_attr_t node_attr;
+	int offset;           /**< The offset by which the stack shall be expanded/shrinked. */
+} be_stack_attr_t;
+
+/** The be_Frame attribute type. */
+typedef struct {
+	be_node_attr_t node_attr;
+	ir_entity *ent;
+	int offset;
+} be_frame_attr_t;
+
+/** The be_Call attribute type. */
 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;
+	ir_entity *ent;      /**< The called entity if this is a static call. */
+	ir_type *call_tp;    /**< The call type, copied from the original Call node. */
+} be_call_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;
+typedef struct {
+	be_node_attr_t node_attr;
+	ir_entity **in_entities;
+	ir_entity **out_entities;
+} be_memperm_attr_t;
+
+ir_op *op_be_Spill;
+ir_op *op_be_Reload;
+ir_op *op_be_Perm;
+ir_op *op_be_MemPerm;
+ir_op *op_be_Copy;
+ir_op *op_be_Keep;
+ir_op *op_be_CopyKeep;
+ir_op *op_be_Call;
+ir_op *op_be_Return;
+ir_op *op_be_IncSP;
+ir_op *op_be_AddSP;
+ir_op *op_be_SubSP;
+ir_op *op_be_SetSP;
+ir_op *op_be_RegParams;
+ir_op *op_be_StackParam;
+ir_op *op_be_FrameAddr;
+ir_op *op_be_FrameLoad;
+ir_op *op_be_FrameStore;
+ir_op *op_be_Barrier;
 
 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
+#define M   irop_flag_machine
+
+
+/**
+ * Compare two node attributes.
+ *
+ * @return zero if both attributes are identically
+ */
+static int cmp_node_attr(be_node_attr_t *a, be_node_attr_t *b) {
+	int i, len;
+
+	if(ARR_LEN(a->reg_data) != ARR_LEN(b->reg_data))
+		return 1;
+
+	len = ARR_LEN(a->reg_data);
+	for (i = 0; i < len; ++i) {
+		if (a->reg_data[i].reg != b->reg_data[i].reg ||
+				memcmp(&a->reg_data[i].in_req, &b->reg_data[i].in_req, sizeof(b->reg_data[i].in_req)) ||
+			    memcmp(&a->reg_data[i].req,    &b->reg_data[i].req,    sizeof(a->reg_data[i].req)))
+			return 1;
+	}
+
+	return 0;
+}
+
+/**
+ * Compare the attributes of two FrameAddr nodes.
+ *
+ * @return zero if both attributes are identically
+ */
+static int FrameAddr_cmp_attr(ir_node *a, ir_node *b) {
+	be_frame_attr_t *a_attr = get_irn_attr(a);
+	be_frame_attr_t *b_attr = get_irn_attr(b);
+
+	if (a_attr->ent == b_attr->ent && a_attr->offset == b_attr->offset)
+		return cmp_node_attr(&a_attr->node_attr, &b_attr->node_attr);
+	return 1;
+}
+
+static INLINE be_req_t *get_be_req(const ir_node *node, int pos)
+{
+	int idx;
+	be_node_attr_t *attr;
+	be_reg_data_t *rd;
+
+	assert(is_be_node(node));
+	attr = get_irn_attr(node);
+
+	if(pos < 0) {
+		idx = -(pos + 1);
+	} else {
+		idx = pos;
+		assert(idx < get_irn_arity(node));
+	}
+	assert(idx < ARR_LEN(attr->reg_data));
+	rd = &attr->reg_data[idx];
+
+	return pos < 0 ? &rd->req : &rd->in_req;
+}
+
+static inline arch_register_req_t *get_req(const ir_node *node, int pos)
+{
+	be_req_t *bereq = get_be_req(node, pos);
+	return &bereq->req;
+}
+
 void be_node_init(void) {
 	static int inited = 0;
-	int i;
 
 	if(inited)
 		return;
 
 	inited = 1;
 
-	beo_base = get_next_ir_opcode();
+	/* Acquire all needed opcodes. */
+	beo_base = get_next_ir_opcodes(beo_Last - 1);
+
+	op_be_Spill      = new_ir_op(beo_base + beo_Spill,      "be_Spill",      op_pin_state_mem_pinned, N, oparity_unary,    0, sizeof(be_frame_attr_t),   &be_node_op_ops);
+	op_be_Reload     = new_ir_op(beo_base + beo_Reload,     "be_Reload",     op_pin_state_mem_pinned, N, oparity_zero,     0, sizeof(be_frame_attr_t),   &be_node_op_ops);
+	op_be_Perm       = new_ir_op(beo_base + beo_Perm,       "be_Perm",       op_pin_state_pinned,     N, oparity_variable, 0, sizeof(be_node_attr_t),    &be_node_op_ops);
+	op_be_MemPerm    = new_ir_op(beo_base + beo_MemPerm,    "be_MemPerm",    op_pin_state_mem_pinned, N, oparity_variable, 0, sizeof(be_memperm_attr_t), &be_node_op_ops);
+	op_be_Copy       = new_ir_op(beo_base + beo_Copy,       "be_Copy",       op_pin_state_floats,     N, oparity_unary,    0, sizeof(be_node_attr_t),    &be_node_op_ops);
+	op_be_Keep       = new_ir_op(beo_base + beo_Keep,       "be_Keep",       op_pin_state_pinned,     K, oparity_dynamic,  0, sizeof(be_node_attr_t),    &be_node_op_ops);
+	op_be_CopyKeep   = new_ir_op(beo_base + beo_CopyKeep,   "be_CopyKeep",   op_pin_state_pinned,     K, oparity_variable, 0, sizeof(be_node_attr_t),    &be_node_op_ops);
+	op_be_Call       = new_ir_op(beo_base + beo_Call,       "be_Call",       op_pin_state_pinned,     F, oparity_variable, 0, sizeof(be_call_attr_t),    &be_node_op_ops);
+	op_be_Return     = new_ir_op(beo_base + beo_Return,     "be_Return",     op_pin_state_pinned,     X, oparity_variable, 0, sizeof(be_return_attr_t),  &be_node_op_ops);
+	op_be_AddSP      = new_ir_op(beo_base + beo_AddSP,      "be_AddSP",      op_pin_state_pinned,     N, oparity_unary,    0, sizeof(be_node_attr_t),    &be_node_op_ops);
+	op_be_SubSP      = new_ir_op(beo_base + beo_SubSP,      "be_SubSP",      op_pin_state_pinned,     N, oparity_unary,    0, sizeof(be_node_attr_t),    &be_node_op_ops);
+	op_be_SetSP      = new_ir_op(beo_base + beo_SetSP,      "be_SetSP",      op_pin_state_pinned,     N, oparity_binary,   0, sizeof(be_stack_attr_t),   &be_node_op_ops);
+	op_be_IncSP      = new_ir_op(beo_base + beo_IncSP,      "be_IncSP",      op_pin_state_pinned,     N, oparity_unary,    0, sizeof(be_stack_attr_t),   &be_node_op_ops);
+	op_be_RegParams  = new_ir_op(beo_base + beo_RegParams,  "be_RegParams",  op_pin_state_pinned,     N, oparity_zero,     0, sizeof(be_node_attr_t),    &be_node_op_ops);
+	op_be_StackParam = new_ir_op(beo_base + beo_StackParam, "be_StackParam", op_pin_state_pinned,     N, oparity_unary,    0, sizeof(be_frame_attr_t),   &be_node_op_ops);
+	op_be_FrameAddr  = new_ir_op(beo_base + beo_FrameAddr,  "be_FrameAddr",  op_pin_state_pinned,     N, oparity_unary,    0, sizeof(be_frame_attr_t),   &be_node_op_ops);
+	op_be_FrameLoad  = new_ir_op(beo_base + beo_FrameLoad,  "be_FrameLoad",  op_pin_state_pinned,     N, oparity_any,      0, sizeof(be_frame_attr_t),   &be_node_op_ops);
+	op_be_FrameStore = new_ir_op(beo_base + beo_FrameStore, "be_FrameStore", op_pin_state_pinned,     N, oparity_any,      0, sizeof(be_frame_attr_t),   &be_node_op_ops);
+	op_be_Barrier    = new_ir_op(beo_base + beo_Barrier,    "be_Barrier",    op_pin_state_pinned,     N, oparity_dynamic,  0, sizeof(be_node_attr_t),    &be_node_op_ops);
+
+	set_op_tag(op_be_Spill,      &be_node_tag);
+	set_op_tag(op_be_Reload,     &be_node_tag);
+	set_op_tag(op_be_Perm,       &be_node_tag);
+	set_op_tag(op_be_MemPerm,    &be_node_tag);
+	set_op_tag(op_be_Copy,       &be_node_tag);
+	set_op_tag(op_be_Keep,       &be_node_tag);
+	set_op_tag(op_be_CopyKeep,   &be_node_tag);
+	set_op_tag(op_be_Call,       &be_node_tag);
+	set_op_tag(op_be_Return,     &be_node_tag);
+	set_op_tag(op_be_AddSP,      &be_node_tag);
+	set_op_tag(op_be_SubSP,      &be_node_tag);
+	set_op_tag(op_be_SetSP,      &be_node_tag);
+	set_op_tag(op_be_IncSP,      &be_node_tag);
+	set_op_tag(op_be_RegParams,  &be_node_tag);
+	set_op_tag(op_be_StackParam, &be_node_tag);
+	set_op_tag(op_be_FrameLoad,  &be_node_tag);
+	set_op_tag(op_be_FrameStore, &be_node_tag);
+	set_op_tag(op_be_FrameAddr,  &be_node_tag);
+	set_op_tag(op_be_Barrier,    &be_node_tag);
+
+	op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
+}
+
+/**
+ * Initializes the generic attribute of all be nodes and return ir.
+ */
+static void *init_node_attr(ir_node *node, int max_reg_data)
+{
+	ir_graph *irg = get_irn_irg(node);
+	struct obstack *obst = get_irg_obstack(irg);
+	be_node_attr_t *a = get_irn_attr(node);
+
+	memset(a, 0, sizeof(get_op_attr_size(get_irn_op(node))));
 
-	/* Acquire all needed opcodes. We assume that they are consecutive! */
-	for(i = beo_Spill; i < beo_Last; ++i)
-		get_next_ir_opcode();
+	if(max_reg_data >= 0) {
+		a->reg_data = NEW_ARR_D(be_reg_data_t, obst, max_reg_data);
+		memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
+	} else {
+		a->reg_data = NEW_ARR_F(be_reg_data_t, 0);
+	}
+
+	return a;
+}
 
-	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);
+static void add_register_req(ir_node *node)
+{
+	be_node_attr_t *a = get_irn_attr(node);
+	be_reg_data_t regreq;
+	memset(&regreq, 0, sizeof(regreq));
+	ARR_APP1(be_reg_data_t, a->reg_data, regreq);
+}
 
-	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);
+int is_be_node(const ir_node *irn)
+{
+	return get_op_tag(get_irn_op(irn)) == &be_node_tag;
 }
 
-static void *init_node_attr(ir_node* irn, const arch_register_class_t *cls, ir_graph *irg, int n_outs)
+be_opcode_t be_get_irn_opcode(const ir_node *irn)
 {
-	be_node_attr_t *a = get_irn_attr(irn);
+	return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp;
+}
 
-	a->n_outs   = n_outs;
-	a->cls      = cls;
-	a->reg_data = NULL;
+/**
+ * Skip Proj nodes and return their Proj numbers.
+ *
+ * If *node is a Proj or Proj(Proj) node, skip it.
+ *
+ * @param node  points to the node to be skipped
+ *
+ * @return 0 if *node was no Proj node, its Proj number else.
+ */
+static int redir_proj(const ir_node **node)
+{
+	const ir_node *n = *node;
 
-	if(n_outs > 0) {
-		int i;
+	if(is_Proj(n)) {
+		ir_node *irn;
 
-		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;
+		*node = irn = get_Proj_pred(n);
+		if(is_Proj(irn)) {
+			assert(get_irn_mode(irn) == mode_T);
+			*node = get_Proj_pred(irn);
 		}
+		return get_Proj_proj(n);
 	}
 
-	return a;
+	return 0;
 }
 
-static INLINE int is_be_node(const ir_node *irn)
+static be_reg_data_t *retrieve_reg_data(const ir_node *node)
 {
-	return get_op_tag(get_irn_op(irn)) == &be_node_tag;
+	be_node_attr_t *attr;
+	int pos = 0;
+
+	if(is_Proj(node)) {
+		pos = get_Proj_proj(node);
+		node = get_Proj_pred(node);
+	}
+
+	assert(is_be_node(node));
+	attr = get_irn_attr(node);
+	assert(pos >= 0 && pos < ARR_LEN(attr->reg_data) && "illegal proj number");
+
+	return &attr->reg_data[pos];
 }
 
-be_opcode_t get_irn_be_opcode(const ir_node *irn)
+static void
+be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg)
 {
-	return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp;
+	be_reg_data_t *r = retrieve_reg_data(irn);
+	r->reg = reg;
 }
 
-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 *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
+	ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill)
 {
-	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;
+	be_frame_attr_t *a;
+	ir_node         *in[2];
+	ir_node         *res;
+
+	in[0]     = frame;
+	in[1]     = to_spill;
+	res       = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
+	a         = init_node_attr(res, 2);
+	a->ent    = NULL;
+	a->offset = 0;
+
+	be_node_set_reg_class(res, be_pos_Spill_frame, cls_frame);
+	be_node_set_reg_class(res, be_pos_Spill_val, cls);
 	return res;
 }
 
-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 *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
+	ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode)
 {
-	ir_node *in[1];
+	ir_node *in[2];
 	ir_node *res;
 
-	in[0] = mem;
-	res   = new_ir_node(NULL, irg, bl, op_Reload, mode, 1, in);
-	init_node_attr(res, cls, irg, 1);
+	in[0] = frame;
+	in[1] = mem;
+	res   = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
+
+	init_node_attr(res, 2);
+	be_node_set_reg_class(res, -1, cls);
+	be_node_set_reg_class(res, be_pos_Reload_frame, cls_frame);
+	be_node_set_flags(res, -1, arch_irn_flags_rematerializable);
 	return res;
 }
 
+ir_node *be_get_Reload_mem(const ir_node *irn)
+{
+	assert(be_is_Reload(irn));
+	return get_irn_n(irn, be_pos_Reload_mem);
+}
+
+ir_node *be_get_Reload_frame(const ir_node *irn)
+{
+	assert(be_is_Reload(irn));
+	return get_irn_n(irn, be_pos_Reload_frame);
+}
+
+ir_node *be_get_Spill_val(const ir_node *irn)
+{
+	assert(be_is_Spill(irn));
+	return get_irn_n(irn, be_pos_Spill_val);
+}
+
+ir_node *be_get_Spill_frame(const ir_node *irn)
+{
+	assert(be_is_Spill(irn));
+	return get_irn_n(irn, be_pos_Spill_frame);
+}
+
 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
 {
-	ir_node *irn = new_ir_node(NULL, irg, bl, op_Perm, mode_T, n, in);
-	init_node_attr(irn, cls, irg, n);
+	int i;
+	ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
+	init_node_attr(irn, n);
+	for(i = 0; i < n; ++i) {
+		be_node_set_reg_class(irn, i, cls);
+		be_node_set_reg_class(irn, OUT_POS(i), cls);
+	}
+
+	return irn;
+}
+
+ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
+{
+	int i;
+	ir_node *frame = get_irg_frame(irg);
+	const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
+	ir_node *irn;
+	const arch_register_t *sp = arch_env->isa->sp;
+	be_memperm_attr_t *attr;
+	ir_node **real_in;
+
+	real_in = alloca((n+1) * sizeof(real_in[0]));
+	real_in[0] = frame;
+	memcpy(&real_in[1], in, n * sizeof(real_in[0]));
+
+	irn =  new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
+
+	init_node_attr(irn, n + 1);
+	be_node_set_reg_class(irn, 0, sp->reg_class);
+	for(i = 0; i < n; ++i) {
+		be_node_set_reg_class(irn, i + 1, cls_frame);
+		be_node_set_reg_class(irn, OUT_POS(i), cls_frame);
+	}
+
+	attr = get_irn_attr(irn);
+
+	attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0]));
+	memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0]));
+	attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0]));
+	memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0]));
+
 	return irn;
 }
 
+
 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;
+	arch_register_req_t *req;
 
 	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);
+	res   = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
+	init_node_attr(res, 1);
+	be_node_set_reg_class(res, 0, cls);
+	be_node_set_reg_class(res, OUT_POS(0), cls);
+
+	req = get_req(res, OUT_POS(0));
+	req->cls = cls;
+	req->type = arch_register_req_type_should_be_same;
+	req->other_same = 0;
+
 	return res;
 }
 
+ir_node *be_get_Copy_op(const ir_node *cpy) {
+	return get_irn_n(cpy, be_pos_Copy_op);
+}
+
+void be_set_Copy_op(ir_node *cpy, ir_node *op) {
+	set_irn_n(cpy, be_pos_Copy_op, op);
+}
+
 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
 {
+	int i;
+	ir_node *res;
+
+	res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
+	init_node_attr(res, -1);
+
+	for(i = 0; i < n; ++i) {
+		add_irn_n(res, in[i]);
+		add_register_req(res);
+		be_node_set_reg_class(res, i, cls);
+	}
+	keep_alive(res);
+
+	return res;
+}
+
+void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
+{
+	int n;
+
+	assert(be_is_Keep(keep));
+	n = add_irn_n(keep, node);
+	add_register_req(keep);
+	be_node_set_reg_class(keep, n, cls);
+}
+
+ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
+                     int n_outs, int n, ir_node *in[], ir_type *call_tp)
+{
+	be_call_attr_t *a;
+	int real_n = be_pos_Call_first_arg + n;
 	ir_node *irn;
+	ir_node **real_in;
+
+	NEW_ARR_A(ir_node *, real_in, real_n);
+	real_in[be_pos_Call_mem] = mem;
+	real_in[be_pos_Call_sp]  = sp;
+	real_in[be_pos_Call_ptr] = ptr;
+	memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
+
+	irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
+	a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
+	a->ent     = NULL;
+	a->call_tp = call_tp;
+	return irn;
+}
+
+/* Gets the call entity or NULL if this is no static call. */
+ir_entity *be_Call_get_entity(const ir_node *call) {
+	be_call_attr_t *a = get_irn_attr(call);
+	assert(be_is_Call(call));
+	return a->ent;
+}
+
+/* Sets the call entity. */
+void be_Call_set_entity(ir_node *call, ir_entity *ent) {
+	be_call_attr_t *a = get_irn_attr(call);
+	assert(be_is_Call(call));
+	a->ent = ent;
+}
+
+/* Gets the call type. */
+ir_type *be_Call_get_type(ir_node *call) {
+	be_call_attr_t *a = get_irn_attr(call);
+	assert(be_is_Call(call));
+	return a->call_tp;
+}
+
+/* Sets the call type. */
+void be_Call_set_type(ir_node *call, ir_type *call_tp) {
+	be_call_attr_t *a = get_irn_attr(call);
+	assert(be_is_Call(call));
+	a->call_tp = call_tp;
+}
+
+/* Construct a new be_Return. */
+ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n_res, int n, ir_node *in[])
+{
+	be_return_attr_t *a;
+	ir_node *irn = new_ir_node(dbg, irg, bl, op_be_Return, mode_X, n, in);
+	init_node_attr(irn, n);
+	a = get_irn_attr(irn);
+	a->num_ret_vals = n_res;
 
-	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;
 }
 
-int be_is_Spill(const ir_node *irn)
+/* Returns the number of real returns values */
+int be_Return_get_n_rets(ir_node *ret)
 {
-	return get_irn_be_opcode(irn) == beo_Spill;
+	be_return_attr_t *a = get_irn_attr(ret);
+	return a->num_ret_vals;
 }
 
-int be_is_Reload(const ir_node *irn)
+ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, int offset)
 {
-	return get_irn_be_opcode(irn) == beo_Reload;
+	be_stack_attr_t *a;
+	ir_node *irn;
+	ir_node *in[1];
+
+	in[0]     = old_sp;
+	irn       = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, sizeof(in) / sizeof(in[0]), in);
+	a         = init_node_attr(irn, 1);
+	a->offset = offset;
+
+	be_node_set_flags(irn, -1, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
+
+	/* Set output constraint to stack register. */
+	be_node_set_reg_class(irn, 0, sp->reg_class);
+	be_set_constr_single_reg(irn, BE_OUT_POS(0), sp);
+	be_node_set_irn_reg(NULL, irn, sp);
+
+	return irn;
 }
 
-int be_is_Copy(const ir_node *irn)
+ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
 {
-	return get_irn_be_opcode(irn) == beo_Copy;
+	be_node_attr_t *a;
+	ir_node *irn;
+	ir_node *in[be_pos_AddSP_last];
+
+	in[be_pos_AddSP_old_sp] = old_sp;
+	in[be_pos_AddSP_size]   = sz;
+
+	irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
+	a   = init_node_attr(irn, be_pos_AddSP_last);
+
+	be_node_set_flags(irn, OUT_POS(pn_be_AddSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
+
+	/* Set output constraint to stack register. */
+	be_set_constr_single_reg(irn, be_pos_AddSP_old_sp, sp);
+	be_node_set_reg_class(irn, be_pos_AddSP_size, arch_register_get_class(sp));
+	be_set_constr_single_reg(irn, OUT_POS(pn_be_AddSP_res), sp);
+	a->reg_data[pn_be_AddSP_res].reg = sp;
+
+	return irn;
 }
 
-int be_is_Perm(const ir_node *irn)
+ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
 {
-	return get_irn_be_opcode(irn) == beo_Perm;
+	be_node_attr_t *a;
+	ir_node *irn;
+	ir_node *in[be_pos_SubSP_last];
+
+	in[be_pos_SubSP_old_sp] = old_sp;
+	in[be_pos_SubSP_size]   = sz;
+
+	irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
+	a   = init_node_attr(irn, be_pos_SubSP_last);
+
+	be_node_set_flags(irn, OUT_POS(pn_be_SubSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
+
+	/* Set output constraint to stack register. */
+	be_set_constr_single_reg(irn, be_pos_SubSP_old_sp, sp);
+	be_node_set_reg_class(irn, be_pos_SubSP_size, arch_register_get_class(sp));
+	be_set_constr_single_reg(irn, OUT_POS(pn_be_SubSP_res), sp);
+	a->reg_data[pn_be_SubSP_res].reg = sp;
+
+	return irn;
 }
 
-int be_is_Keep(const ir_node *irn)
+ir_node *be_new_SetSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *op, ir_node *mem)
 {
-	return get_irn_be_opcode(irn) == beo_Keep;
+	be_node_attr_t *a;
+	ir_node *irn;
+	ir_node *in[3];
+
+	in[0]    = mem;
+	in[1]    = old_sp;
+	in[2]    = op;
+	irn      = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in);
+	a        = init_node_attr(irn, 3);
+
+	be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
+
+	/* Set output constraint to stack register. */
+	be_set_constr_single_reg(irn, OUT_POS(0), sp);
+	be_node_set_reg_class(irn, be_pos_AddSP_size, sp->reg_class);
+	be_node_set_reg_class(irn, be_pos_AddSP_old_sp, sp->reg_class);
+
+	return irn;
 }
 
-void be_set_Perm_out_req(ir_node *irn, int pos, const arch_register_req_t *req)
+ir_node *be_new_StackParam(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *frame_pointer, ir_entity *ent)
 {
-	be_node_attr_t *a = get_irn_attr(irn);
+	be_frame_attr_t *a;
+	ir_node *irn;
+	ir_node *in[1];
+
+	in[0] = frame_pointer;
+	irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in);
+	a = init_node_attr(irn, 1);
+	a->ent = ent;
 
-	assert(be_is_Perm(irn));
-	assert(pos >= 0 && pos < get_irn_arity(irn));
-	memcpy(&a->reg_data[pos].req, req, sizeof(req[0]));
+	be_node_set_reg_class(irn, 0, cls_frame);
+	be_node_set_reg_class(irn, OUT_POS(0), cls);
+	return irn;
 }
 
-void be_set_Spill_offset(ir_node *irn, unsigned offset)
+ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
 {
-	be_spill_attr_t *a = get_irn_attr(irn);
-	assert(be_is_Spill(irn));
-	a->offset = offset;
+	ir_node *res;
+	int i;
+
+	res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
+	init_node_attr(res, -1);
+	for(i = 0; i < n_outs; ++i)
+		add_register_req(res);
+
+	return res;
 }
 
-static ir_node *find_a_spill_walker(ir_node *irn, unsigned visited_nr)
+ir_node *be_RegParams_append_out_reg(ir_node *regparams,
+                                     const arch_env_t *arch_env,
+                                     const arch_register_t *reg)
 {
-	if(get_irn_visited(irn) < visited_nr) {
-		set_irn_visited(irn, visited_nr);
+	ir_graph *irg = get_irn_irg(regparams);
+	ir_node *block = get_nodes_block(regparams);
+	be_node_attr_t *attr = get_irn_attr(regparams);
+	const arch_register_class_t *cls = arch_register_get_class(reg);
+	ir_mode *mode = arch_register_class_mode(cls);
+	int n = ARR_LEN(attr->reg_data);
+	ir_node *proj;
+
+	assert(be_is_RegParams(regparams));
+	proj = new_r_Proj(irg, block, regparams, mode, n);
+	add_register_req(regparams);
+	be_set_constr_single_reg(regparams, n, reg);
+	arch_set_irn_register(arch_env, proj, reg);
+
+	/* TODO decide, whether we need to set ignore/modify sp flags here? */
+
+	return proj;
+}
 
-		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;
-			}
-		}
+ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
+						  ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_entity *ent)
+{
+	be_frame_attr_t *a;
+	ir_node *irn;
+	ir_node *in[2];
+
+	in[0]  = mem;
+	in[1]  = frame;
+	irn    = new_ir_node(NULL, irg, bl, op_be_FrameLoad, mode_T, 2, in);
+	a      = init_node_attr(irn, 3);
+	a->ent = ent;
+	a->offset = 0;
+	be_node_set_reg_class(irn, 1, cls_frame);
+	be_node_set_reg_class(irn, OUT_POS(pn_Load_res), cls_data);
+	return irn;
+}
 
-		else if(get_irn_be_opcode(irn) == beo_Spill)
-			return irn;
-	}
+ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
+						   ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, ir_entity *ent)
+{
+	be_frame_attr_t *a;
+	ir_node *irn;
+	ir_node *in[3];
+
+	in[0]  = mem;
+	in[1]  = frame;
+	in[2]  = data;
+	irn    = new_ir_node(NULL, irg, bl, op_be_FrameStore, mode_T, 3, in);
+	a      = init_node_attr(irn, 3);
+	a->ent = ent;
+	a->offset = 0;
+	be_node_set_reg_class(irn, 1, cls_frame);
+	be_node_set_reg_class(irn, 2, cls_data);
+	return irn;
+}
 
-	return NULL;
+ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent)
+{
+	be_frame_attr_t *a;
+	ir_node *irn;
+	ir_node *in[1];
+
+	in[0]  = frame;
+	irn    = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
+	a      = init_node_attr(irn, 1);
+	a->ent = ent;
+	a->offset = 0;
+	be_node_set_reg_class(irn, 0, cls_frame);
+	be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
+
+	return optimize_node(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;
+ir_node *be_new_CopyKeep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, int n, ir_node *in_keep[], ir_mode *mode)
+{
+	ir_node *irn;
+	ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
+
+	in[0] = src;
+	memcpy(&in[1], in_keep, n * sizeof(in[0]));
+	irn   = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
+	init_node_attr(irn, n + 1);
+	be_node_set_reg_class(irn, OUT_POS(0), cls);
+	be_node_set_reg_class(irn, 0, cls);
+
+	return 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_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode)
 {
-	ir_graph *irg       = get_irn_irg(irn);
-	unsigned visited_nr = get_irg_visited(irg) + 1;
+	ir_node *in[1];
 
-	assert(be_is_Reload(irn));
-	set_irg_visited(irg, visited_nr);
-	return find_a_spill_walker(irn, visited_nr);
+	in[0] = keep;
+	return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode);
+}
+
+ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
+	return get_irn_n(cpy, be_pos_CopyKeep_op);
+}
+
+void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
+	set_irn_n(cpy, be_pos_CopyKeep_op, op);
 }
 
+ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
+{
+	ir_node *res;
+	int i;
+
+	res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
+	init_node_attr(res, -1);
+	for(i = 0; i < n; ++i) {
+		add_irn_n(res, in[i]);
+		add_register_req(res);
+	}
+
+	return res;
+}
 
-unsigned be_get_spill_offset(ir_node *irn)
+ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
 {
-	int opc           = get_irn_opcode(irn);
+	ir_graph *irg = get_irn_irg(barrier);
+	ir_node *block = get_nodes_block(barrier);
+	ir_mode *mode = get_irn_mode(node);
+	int n = add_irn_n(barrier, node);
+	ir_node *proj = new_r_Proj(irg, block, barrier, mode, n);
+	add_register_req(barrier);
+
+	return proj;
+}
 
-	switch(get_irn_be_opcode(irn)) {
-	case beo_Reload:
-		return be_get_spill_offset(find_a_spill(irn));
+int be_is_Spill         (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill          ; }
+int be_is_Reload        (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload         ; }
+int be_is_Copy          (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy           ; }
+int be_is_CopyKeep      (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_CopyKeep       ; }
+int be_is_Perm          (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm           ; }
+int be_is_MemPerm       (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_MemPerm        ; }
+int be_is_Keep          (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep           ; }
+int be_is_Call          (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call           ; }
+int be_is_Return        (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return         ; }
+int be_is_IncSP         (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP          ; }
+int be_is_SetSP         (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP          ; }
+int be_is_AddSP         (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP          ; }
+int be_is_SubSP         (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SubSP          ; }
+int be_is_RegParams     (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams      ; }
+int be_is_StackParam    (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_StackParam     ; }
+int be_is_FrameAddr     (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr      ; }
+int be_is_FrameLoad     (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameLoad      ; }
+int be_is_FrameStore    (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameStore     ; }
+int be_is_Barrier       (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier        ; }
+
+int be_has_frame_entity(const ir_node *irn)
+{
+	switch(be_get_irn_opcode(irn)) {
+	case beo_StackParam:
 	case beo_Spill:
-		{
-			be_spill_attr_t *a = get_irn_attr(irn);
-			return a->offset;
-		}
+	case beo_Reload:
+	case beo_FrameStore:
+	case beo_FrameLoad:
+	case beo_FrameAddr:
+		return 1;
 	default:
-		assert(0 && "Must give spill/reload node");
+		return 0;
 	}
+}
 
-	return (unsigned) -1;
+ir_entity *be_get_frame_entity(const ir_node *irn)
+{
+	if (be_has_frame_entity(irn)) {
+		be_frame_attr_t *a = get_irn_attr(irn);
+		return a->ent;
+	}
+	return NULL;
 }
 
-ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx)
+int be_get_frame_offset(const ir_node *irn)
 {
-	const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
+	assert(is_be_node(irn));
+	if (be_has_frame_entity(irn)) {
+		be_frame_attr_t *a = get_irn_attr(irn);
+		return a->offset;
+	}
+	return 0;
+}
 
-	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;
+void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
+{
+	be_memperm_attr_t *attr = get_irn_attr(irn);
 
-	/*
-	 * 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);
+	assert(be_is_MemPerm(irn));
+	assert(n < be_get_MemPerm_entity_arity(irn));
 
-	sched_add_before(insert, spill);
-	return spill;
+	attr->in_entities[n] = ent;
 }
 
-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)
+ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
 {
-	ir_node *reload;
+	be_memperm_attr_t *attr = get_irn_attr(irn);
 
-	ir_node *bl   = get_nodes_block(irn);
-	ir_graph *irg = get_irn_irg(bl);
+	assert(be_is_MemPerm(irn));
+	assert(n < be_get_MemPerm_entity_arity(irn));
 
-	assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
+	return attr->in_entities[n];
+}
+
+void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
+{
+	be_memperm_attr_t *attr = get_irn_attr(irn);
 
-	reload = be_new_Reload(cls, irg, bl, mode, spill);
+	assert(be_is_MemPerm(irn));
+	assert(n < be_get_MemPerm_entity_arity(irn));
 
-	set_irn_n(irn, pos, reload);
-	sched_add_before(irn, reload);
-	return reload;
+	attr->out_entities[n] = ent;
 }
 
-static int redir_proj(const ir_node **node, int pos)
+ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
 {
-	const ir_node *n = *node;
+	be_memperm_attr_t *attr = get_irn_attr(irn);
 
-	if(is_Proj(n)) {
-		assert(pos == -1 && "Illegal pos for a Proj");
-		*node = get_Proj_pred(n);
-		return get_Proj_proj(n);
-	}
+	assert(be_is_MemPerm(irn));
+	assert(n < be_get_MemPerm_entity_arity(irn));
 
-	return 0;
+	return attr->out_entities[n];
 }
 
-static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos)
+int be_get_MemPerm_entity_arity(const ir_node *irn)
 {
-	const be_node_attr_t *a = get_irn_attr(irn);
+	return get_irn_arity(irn) - 1;
+}
 
+void be_set_constr_single_reg(ir_node *node, int pos, const arch_register_t *reg)
+{
+	arch_register_req_t *req = get_req(node, pos);
+	const arch_register_class_t *cls = arch_register_get_class(reg);
+	ir_graph *irg = get_irn_irg(node);
+	struct obstack *obst = get_irg_obstack(irg);
+	unsigned *limited_bitset;
+
+	assert(req->cls == NULL || req->cls == cls);
+	assert(! (req->type & arch_register_req_type_limited));
+	assert(req->limited == NULL);
+
+	limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
+	rbitset_set(limited_bitset, arch_register_get_index(reg));
+
+	req->cls = cls;
+	req->type |= arch_register_req_type_limited;
+	req->limited = limited_bitset;
+}
 
-	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;
-	}
+void be_set_constr_limited(ir_node *node, int pos, const arch_register_req_t *req)
+{
+	ir_graph *irg = get_irn_irg(node);
+	struct obstack *obst = get_irg_obstack(irg);
+	arch_register_req_t *r = get_req(node, pos);
+
+	assert(arch_register_req_is(req, limited));
+	assert(! (req->type & (arch_register_req_type_should_be_same | arch_register_req_type_should_be_different)));
+	memcpy(r, req, sizeof(r[0]));
+	r->limited = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
+}
 
-	return req;
+void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
+{
+	be_req_t *bereq = get_be_req(irn, pos);
+	bereq->flags = flags;
 }
 
-static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos)
+void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
 {
-	const be_node_attr_t *a = get_irn_attr(irn);
-	int n                   = get_irn_arity(irn);
+	arch_register_req_t *req = get_req(irn, pos);
 
-	req->type = arch_register_req_type_none;
-	req->cls  = NULL;
+	req->cls = cls;
 
-	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;
+	if (cls == NULL) {
+		req->type = arch_register_req_type_none;
+	} else if (req->type == arch_register_req_type_none) {
+		req->type = arch_register_req_type_normal;
 	}
+}
 
-	return req;
+void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
+{
+	arch_register_req_t *req = get_req(irn, pos);
+	req->type = type;
 }
 
-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)
+ir_node *be_get_IncSP_pred(ir_node *irn) {
+	assert(be_is_IncSP(irn));
+	return get_irn_n(irn, 0);
+}
+
+void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
+	assert(be_is_IncSP(incsp));
+	set_irn_n(incsp, 0, pred);
+}
+
+ir_node *be_get_IncSP_mem(ir_node *irn) {
+	assert(be_is_IncSP(irn));
+	return get_irn_n(irn, 1);
+}
+
+void be_set_IncSP_offset(ir_node *irn, int offset)
 {
-	int out_pos = pos;
+	be_stack_attr_t *a = get_irn_attr(irn);
+	assert(be_is_IncSP(irn));
+	a->offset = offset;
+}
 
-	if(pos < 0) {
-		if(get_irn_mode(irn) == mode_T)
-			return NULL;
+int be_get_IncSP_offset(const ir_node *irn)
+{
+	be_stack_attr_t *a = get_irn_attr(irn);
+	assert(be_is_IncSP(irn));
+	return a->offset;
+}
 
-		out_pos = redir_proj((const ir_node **) &irn, pos);
-		assert(is_be_node(irn));
-		return put_out_reg_req(req, irn, out_pos);
+ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn)
+{
+	ir_node                     *bl        = get_nodes_block(irn);
+	ir_graph                    *irg       = get_irn_irg(bl);
+	ir_node                     *frame     = get_irg_frame(irg);
+	const arch_register_class_t *cls       = arch_get_irn_reg_class(arch_env, irn, -1);
+	const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
+	ir_node                     *spill;
+
+	spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
+	return spill;
+}
+
+ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill)
+{
+	ir_node  *reload;
+	ir_node  *bl    = is_Block(insert) ? insert : get_nodes_block(insert);
+	ir_graph *irg   = get_irn_irg(bl);
+	ir_node  *frame = get_irg_frame(irg);
+	const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
+
+	assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
+
+	reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
+
+	if (is_Block(insert)) {
+		insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
+		sched_add_after(insert, reload);
+	} else {
+		sched_add_before(insert, reload);
 	}
 
-	else {
-		return is_be_node(irn) ? put_in_reg_req(req, irn, pos) : NULL;
+	return reload;
+}
+
+/*
+  ____              ____
+ |  _ \ ___  __ _  |  _ \ ___  __ _ ___
+ | |_) / _ \/ _` | | |_) / _ \/ _` / __|
+ |  _ <  __/ (_| | |  _ <  __/ (_| \__ \
+ |_| \_\___|\__, | |_| \_\___|\__, |___/
+            |___/                |_|
+
+*/
+
+
+static const
+arch_register_req_t *get_out_reg_req(const ir_node *irn, int out_pos)
+{
+	const be_node_attr_t *a = get_irn_attr(irn);
+
+	if(out_pos >= ARR_LEN(a->reg_data)) {
+		return arch_no_register_req;
 	}
 
-	return req;
+	return &a->reg_data[out_pos].req.req;
 }
 
-static void
-be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg)
+static const
+arch_register_req_t *get_in_reg_req(const ir_node *irn, int pos)
 {
-	int out_pos;
-	be_node_attr_t *a;
+	const be_node_attr_t *a = get_irn_attr(irn);
 
-	out_pos = redir_proj((const ir_node **) &irn, -1);
-	a       = get_irn_attr(irn);
+	if(pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
+		return arch_no_register_req;
 
-	assert(is_be_node(irn));
-	assert(out_pos < a->n_outs && "position too high");
-	a->reg_data[out_pos].reg = reg;
+	return &a->reg_data[pos].in_req.req;
 }
 
-const arch_register_t *
-be_node_get_irn_reg(const void *_self, const ir_node *irn)
+static const arch_register_req_t *
+be_node_get_irn_reg_req(const void *self, const ir_node *irn, int pos)
 {
-	int out_pos;
-	be_node_attr_t *a;
+	int out_pos = pos;
 
-	out_pos = redir_proj((const ir_node **) &irn, -1);
-	a       = get_irn_attr(irn);
+	if (pos < 0) {
+		if (get_irn_mode(irn) == mode_T)
+			return arch_no_register_req;
 
-	assert(is_be_node(irn));
-	assert(out_pos < a->n_outs && "position too high");
+		out_pos = redir_proj((const ir_node **)&irn);
+		assert(is_be_node(irn));
+		return get_out_reg_req(irn, out_pos);
+	} else if (is_be_node(irn)) {
+		/*
+   		 * For spills and reloads, we return "none" as requirement for frame
+		 * pointer, so every input is ok. Some backends need this (e.g. STA).
+		 */
+		if ((be_is_Spill(irn)  && pos == be_pos_Spill_frame) ||
+				(be_is_Reload(irn) && pos == be_pos_Reload_frame))
+			return arch_no_register_req;
+
+		return get_in_reg_req(irn, pos);
+	}
 
-	return a->reg_data[out_pos].reg;
+	return arch_no_register_req;
 }
 
-arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn)
+const arch_register_t *
+be_node_get_irn_reg(const void *_self, const ir_node *irn)
 {
-	redir_proj((const ir_node **) &irn, -1);
+	be_reg_data_t *r = retrieve_reg_data(irn);
+	return r->reg;
+}
 
-	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)
+static arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn)
+{
+	redir_proj((const ir_node **) &irn);
+
+	switch(be_get_irn_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);
+		XXX(Return, branch);
+		XXX(StackParam, stackparam);
 #undef XXX
 		default:
-		return 0;
+		return arch_irn_class_normal;
 	}
 
 	return 0;
 }
 
-arch_irn_class_t be_node_get_flags(const void *_self, const ir_node *irn)
+static arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *node)
 {
-	return 0;
+	be_req_t *bereq;
+	int pos = -1;
+
+	if(is_Proj(node)) {
+		pos = OUT_POS(get_Proj_proj(node));
+		node = skip_Proj_const(node);
+	}
+
+	bereq = get_be_req(node, pos);
+
+	return bereq->flags;
+}
+
+static ir_entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
+{
+	return be_get_frame_entity(irn);
+}
+
+static void be_node_set_frame_entity(const void *self, ir_node *irn, ir_entity *ent)
+{
+	be_frame_attr_t *a;
+
+	assert(be_has_frame_entity(irn));
+
+	a = get_irn_attr(irn);
+	a->ent = ent;
+}
+
+static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset)
+{
+	if(be_has_frame_entity(irn)) {
+		be_frame_attr_t *a = get_irn_attr(irn);
+		a->offset = offset;
+	}
+}
+
+static int be_node_get_sp_bias(const void *self, const ir_node *irn)
+{
+	return be_is_IncSP(irn) ? be_get_IncSP_offset(irn) : 0;
 }
 
+/*
+  ___ ____  _   _   _   _                 _ _
+ |_ _|  _ \| \ | | | | | | __ _ _ __   __| | | ___ _ __
+  | || |_) |  \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
+  | ||  _ <| |\  | |  _  | (_| | | | | (_| | |  __/ |
+ |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
+
+*/
+
 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,
+	be_node_get_frame_entity,
+	be_node_set_frame_entity,
+	be_node_set_frame_offset,
+	be_node_get_sp_bias,
+	NULL,    /* get_inverse             */
+	NULL,    /* get_op_estimated_cost   */
+	NULL,    /* possible_memory_operand */
+	NULL,    /* perform_memory_operand  */
 };
 
 static const arch_irn_ops_t be_node_irn_ops = {
 	&be_node_irn_ops_if
 };
 
-const void *be_node_get_arch_ops(const arch_irn_handler_t *self, const ir_node *irn)
+const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
 {
-	redir_proj((const ir_node **) &irn, -1);
+	redir_proj((const ir_node **) &irn);
 	return is_be_node(irn) ? &be_node_irn_ops : NULL;
 }
 
 const arch_irn_handler_t be_node_irn_handler = {
-	be_node_get_arch_ops
+	be_node_get_irn_ops
+};
+
+/*
+  ____  _     _   ___ ____  _   _   _   _                 _ _
+ |  _ \| |__ (_) |_ _|  _ \| \ | | | | | | __ _ _ __   __| | | ___ _ __
+ | |_) | '_ \| |  | || |_) |  \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
+ |  __/| | | | |  | ||  _ <| |\  | |  _  | (_| | | | | (_| | |  __/ |
+ |_|   |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
+
+*/
+
+typedef struct {
+	const arch_register_t *reg;
+	arch_register_req_t req;
+} phi_attr_t;
+
+typedef struct {
+	arch_irn_handler_t irn_handler;
+	arch_irn_ops_t     irn_ops;
+	const arch_env_t   *arch_env;
+	pmap               *phi_attrs;
+} phi_handler_t;
+
+#define get_phi_handler_from_handler(h)  container_of(h, phi_handler_t, irn_handler)
+#define get_phi_handler_from_ops(h)      container_of(h, phi_handler_t, irn_ops)
+
+static const void *phi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn)
+{
+	const phi_handler_t *h = get_phi_handler_from_handler(handler);
+	return is_Phi(irn) && mode_is_datab(get_irn_mode(irn)) ? &h->irn_ops : NULL;
+}
+
+static INLINE phi_attr_t *get_Phi_attr(const phi_handler_t *handler,
+                                       const ir_node *phi)
+{
+	phi_attr_t *attr = pmap_get(handler->phi_attrs, (void*) phi);
+	if(attr == NULL) {
+		ir_graph *irg = get_irn_irg(phi);
+		struct obstack *obst = get_irg_obstack(irg);
+		attr = obstack_alloc(obst, sizeof(attr[0]));
+		memset(attr, 0, sizeof(attr[0]));
+		pmap_insert(handler->phi_attrs, phi, attr);
+	}
+
+	return attr;
+}
+
+/**
+ * Get register class of a Phi.
+ */
+static
+const arch_register_req_t *get_Phi_reg_req_recursive(const phi_handler_t *h,
+                                                     const ir_node *phi,
+                                                     pset **visited)
+{
+	int n = get_irn_arity(phi);
+	ir_node *op;
+	int i;
+
+	if(*visited && pset_find_ptr(*visited, phi))
+		return NULL;
+
+	for(i = 0; i < n; ++i) {
+		op = get_irn_n(phi, i);
+		/* Matze: don't we unnecessary constraint our phis with this?
+		 * we only need to take the regclass IMO*/
+		if(!is_Phi(op))
+			return arch_get_register_req(h->arch_env, op, BE_OUT_POS(0));
+	}
+
+	/*
+	 * The operands of that Phi were all Phis themselves.
+	 * We have to start a DFS for a non-Phi argument now.
+	 */
+	if(!*visited)
+		*visited = pset_new_ptr(16);
+
+	pset_insert_ptr(*visited, phi);
+
+	for(i = 0; i < n; ++i) {
+		const arch_register_req_t *req;
+		op = get_irn_n(phi, i);
+		req = get_Phi_reg_req_recursive(h, op, visited);
+		if(req != NULL)
+			return req;
+	}
+
+	return NULL;
+}
+
+static
+const arch_register_req_t *phi_get_irn_reg_req(const void *self,
+                                               const ir_node *irn, int pos)
+{
+	phi_handler_t *phi_handler = get_phi_handler_from_ops(self);
+	phi_attr_t *attr;
+
+	if(!mode_is_datab(get_irn_mode(irn)))
+		return arch_no_register_req;
+
+	attr = get_Phi_attr(phi_handler, irn);
+
+	if(attr->req.type == arch_register_req_type_none) {
+		pset *visited = NULL;
+		const arch_register_req_t *req;
+		req = get_Phi_reg_req_recursive(phi_handler, irn, &visited);
+
+		memcpy(&attr->req, req, sizeof(req[0]));
+		assert(attr->req.cls != NULL);
+		attr->req.type = arch_register_req_type_normal;
+
+		if(visited != NULL)
+			del_pset(visited);
+	}
+
+	return &attr->req;
+}
+
+static void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
+{
+	phi_handler_t *h = get_phi_handler_from_ops(self);
+	phi_attr_t *attr = get_Phi_attr(h, irn);
+	attr->reg = reg;
+}
+
+static const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn)
+{
+	phi_handler_t *h = get_phi_handler_from_ops(self);
+	phi_attr_t *attr = get_Phi_attr(h, irn);
+	return attr->reg;
+}
+
+static arch_irn_class_t phi_classify(const void *_self, const ir_node *irn)
+{
+	return arch_irn_class_normal;
+}
+
+static arch_irn_flags_t phi_get_flags(const void *_self, const ir_node *irn)
+{
+	return arch_irn_flags_none;
+}
+
+static ir_entity *phi_get_frame_entity(const void *_self, const ir_node *irn)
+{
+	return NULL;
+}
+
+static void phi_set_frame_entity(const void *_self, ir_node *irn, ir_entity *ent)
+{
+}
+
+static void phi_set_frame_offset(const void *_self, ir_node *irn, int bias)
+{
+}
+
+static int phi_get_sp_bias(const void* self, const ir_node *irn)
+{
+	return 0;
+}
+
+static const arch_irn_ops_if_t phi_irn_ops = {
+	phi_get_irn_reg_req,
+	phi_set_irn_reg,
+	phi_get_irn_reg,
+	phi_classify,
+	phi_get_flags,
+	phi_get_frame_entity,
+	phi_set_frame_entity,
+	phi_set_frame_offset,
+	phi_get_sp_bias,
+	NULL,    /* get_inverse             */
+	NULL,    /* get_op_estimated_cost   */
+	NULL,    /* possible_memory_operand */
+	NULL,    /* perform_memory_operand  */
+};
+
+static const arch_irn_handler_t phi_irn_handler = {
+	phi_get_irn_ops
 };
 
+arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env)
+{
+	phi_handler_t *h           = xmalloc(sizeof(h[0]));
+	h->irn_handler.get_irn_ops = phi_get_irn_ops;
+	h->irn_ops.impl            = &phi_irn_ops;
+	h->arch_env                = arch_env;
+	h->phi_attrs               = pmap_create();
+	return (arch_irn_handler_t *) h;
+}
+
+void be_phi_handler_free(arch_irn_handler_t *handler)
+{
+	phi_handler_t *h = (void *) handler;
+	pmap_destroy(h->phi_attrs);
+	free(handler);
+}
+
+const void *be_phi_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
+{
+	phi_handler_t *phi_handler = get_phi_handler_from_handler(self);
+	return is_Phi(irn) ? &phi_handler->irn_ops : NULL;
+}
+
+void be_phi_handler_reset(arch_irn_handler_t *handler)
+{
+	phi_handler_t *h = get_phi_handler_from_handler(handler);
+	if(h->phi_attrs)
+		pmap_destroy(h->phi_attrs);
+	h->phi_attrs = pmap_create();
+}
+
+/*
+  _   _           _        ____                        _
+ | \ | | ___   __| | ___  |  _ \ _   _ _ __ ___  _ __ (_)_ __   __ _
+ |  \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
+ | |\  | (_) | (_| |  __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
+ |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
+                                                |_|            |___/
+*/
+
+/**
+ * Dumps a register requirement to a file.
+ */
+static void dump_node_req(FILE *f, int idx, const arch_register_req_t *req,
+                          const ir_node *node)
+{
+	int did_something = 0;
+	char buf[16];
+	const char *prefix = buf;
+
+	snprintf(buf, sizeof(buf), "#%d ", idx);
+	buf[sizeof(buf) - 1] = '\0';
+
+	if(req->cls != 0) {
+		char tmp[256];
+		fprintf(f, prefix);
+		arch_register_req_format(tmp, sizeof(tmp), req, node);
+		fprintf(f, "%s", tmp);
+		did_something = 1;
+	}
+
+	if(did_something)
+		fprintf(f, "\n");
+}
+
+/**
+ * Dumps node register requirements to a file.
+ */
+static void dump_node_reqs(FILE *f, ir_node *node)
+{
+	int i;
+	be_node_attr_t *a = get_irn_attr(node);
+	int len = ARR_LEN(a->reg_data);
+
+	fprintf(f, "registers: \n");
+	for(i = 0; i < len; ++i) {
+		be_reg_data_t *rd = &a->reg_data[i];
+		if(rd->reg)
+			fprintf(f, "#%d: %s\n", i, rd->reg->name);
+	}
+
+	fprintf(f, "in requirements:\n");
+	for(i = 0; i < len; ++i) {
+		dump_node_req(f, i, &a->reg_data[i].in_req.req, node);
+	}
+
+	fprintf(f, "\nout requirements:\n");
+	for(i = 0; i < len; ++i) {
+		dump_node_req(f, i, &a->reg_data[i].req.req, node);
+	}
+}
+
+/**
+ * ir_op-Operation: dump a be node to file
+ */
 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));
 
@@ -510,30 +1503,120 @@ static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
 		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");
+			dump_node_reqs(f, irn);
+
+			if(be_has_frame_entity(irn)) {
+				be_frame_attr_t *a = (be_frame_attr_t *) at;
+				if (a->ent) {
+					int bits = get_type_size_bits(get_entity_type(a->ent));
+					ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bits\n",
+					  a->ent, a->offset, a->offset, bits, bits);
+				}
+
 			}
 
-			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, a->offset);
+			switch(be_get_irn_opcode(irn)) {
+			case beo_IncSP:
+				{
+					be_stack_attr_t *a = (be_stack_attr_t *) at;
+					if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
+						fprintf(f, "offset: FRAME_SIZE\n");
+					else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
+						fprintf(f, "offset: -FRAME SIZE\n");
+					else
+						fprintf(f, "offset: %u\n", a->offset);
+				}
+				break;
+			case beo_Call:
+				{
+					be_call_attr_t *a = (be_call_attr_t *) at;
+
+					if (a->ent)
+						fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
+				}
+				break;
+			case beo_MemPerm:
+				{
+					int i;
+					for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
+						ir_entity *in, *out;
+						in = be_get_MemPerm_in_entity(irn, i);
+						out = be_get_MemPerm_out_entity(irn, i);
+						if(in) {
+							fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
+						}
+						if(out) {
+							fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
+						}
+					}
+				}
+				break;
+
+			default:
+				break;
 			}
-			break;
 	}
 
 	return 0;
 }
 
+/**
+ * ir_op-Operation:
+ * Copies the backend specific attributes from old node to new node.
+ */
+static void copy_attr(const ir_node *old_node, ir_node *new_node)
+{
+	be_node_attr_t *old_attr = get_irn_attr(old_node);
+	be_node_attr_t *new_attr = get_irn_attr(new_node);
+	struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
+	unsigned i, len;
+
+	assert(is_be_node(old_node));
+	assert(is_be_node(new_node));
+
+	memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
+	new_attr->reg_data = NULL;
+
+	if(old_attr->reg_data != NULL)
+		len = ARR_LEN(old_attr->reg_data);
+	else
+		len = 0;
+
+	if(get_irn_op(old_node)->opar == oparity_dynamic
+			|| be_is_RegParams(old_node)) {
+		new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
+	} else {
+		new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
+	}
+
+	if(len > 0) {
+		memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
+		for(i = 0; i < len; ++i) {
+			const be_reg_data_t *rd = &old_attr->reg_data[i];
+			be_reg_data_t *newrd = &new_attr->reg_data[i];
+			if(arch_register_req_is(&rd->req.req, limited)) {
+				const arch_register_req_t *req = &rd->req.req;
+				arch_register_req_t *new_req = &newrd->req.req;
+				new_req->limited
+					= rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
+			}
+			if(arch_register_req_is(&rd->in_req.req, limited)) {
+				const arch_register_req_t *req = &rd->in_req.req;
+				arch_register_req_t *new_req = &newrd->in_req.req;
+				new_req->limited
+					= rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
+			}
+		}
+	}
+}
+
 static const ir_op_ops be_node_op_ops = {
 	NULL,
 	NULL,
 	NULL,
 	NULL,
 	NULL,
-	NULL,
+	copy_attr,
 	NULL,
 	NULL,
 	NULL,
@@ -542,99 +1625,3 @@ static const ir_op_ops be_node_op_ops = {
 	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");
-	ir_node *bl            = 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 NULL;
-}
-
-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)
-{
-	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");
-
-	ir_node *curr, *irn, *perm, **nodes;
-	int i, n;
-
-	DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", pos));
-
-	if(!nodes_live_at(arch_env, cls, pos, live))
-		assert(0 && "position not found");
-
-	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_introduce_copies(dom_front, perm_op, 1, copies);
-	}
-	return perm;
-}