X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeabi.c;h=749880069fa0555374b93e97d0c052698f4d00bc;hb=dfc341ac6f54b4b0922d605e28333be76f487c68;hp=bb0af7b8a84ab75c9596bef35c13df697e040453;hpb=d9ba33a4b9e7b4ee41bae2d4697c217cb4ad9b53;p=libfirm

diff --git a/ir/be/beabi.c b/ir/be/beabi.c
index bb0af7b8a..749880069 100644
--- a/ir/be/beabi.c
+++ b/ir/be/beabi.c
@@ -1,12 +1,30 @@
-/**
- * ABI lowering.
+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
  *
- * @author Sebastian Hack
- * @date   7.3.2005
- * @cvsid  $Id$
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief       Backend ABI implementation.
+ * @author      Sebastian Hack
+ * @version     $Id$
  */
 #ifdef HAVE_CONFIG_H
-# include <config.h>
+# include "config.h"
 #endif
 
 #include "obst.h"
@@ -31,11 +49,12 @@
 
 #include "be.h"
 #include "beabi.h"
-#include "bearch.h"
+#include "bearch_t.h"
 #include "benode_t.h"
 #include "belive_t.h"
 #include "besched_t.h"
-#include "beirg.h"
+#include "beirg_t.h"
+#include "bessaconstr.h"
 
 typedef struct _be_abi_call_arg_t {
 	unsigned is_res   : 1;  /**< 1: the call argument is a return value. 0: it's a call parameter. */
@@ -77,9 +96,6 @@ struct _be_abi_irg_t {
 	pmap                 *regs;         /**< A map of all callee-save and ignore regs to
 											their Projs to the RegParams node. */
 
-	pset                 *stack_phis;   /**< The set of all Phi nodes inserted due to
-											stack pointer modifying nodes. */
-
 	int                  start_block_bias;	/**< The stack bias at the end of the start block. */
 
 	void                 *cb;           /**< ABI Callback self pointer. */
@@ -87,20 +103,14 @@ struct _be_abi_irg_t {
 	pmap                 *keep_map;     /**< mapping blocks to keep nodes. */
 	pset                 *ignore_regs;  /**< Additional registers which shall be ignored. */
 
+	ir_node             **calls;        /**< flexible array containing all be_Call nodes */
+
 	arch_register_req_t sp_req;
 	arch_register_req_t sp_cls_req;
 
-	arch_irn_handler_t irn_handler;
-	arch_irn_ops_t     irn_ops;
 	DEBUG_ONLY(firm_dbg_module_t    *dbg;)          /**< The debugging module. */
 };
 
-#define get_abi_from_handler(ptr) firm_container_of(ptr, be_abi_irg_t, irn_handler)
-#define get_abi_from_ops(ptr)     firm_container_of(ptr, be_abi_irg_t, irn_ops)
-
-/* Forward, since be need it in be_abi_introduce(). */
-static const arch_irn_ops_if_t abi_irn_ops;
-static const arch_irn_handler_t abi_irn_handler;
 static heights_t *ir_heights;
 
 /* Flag: if set, try to omit the frame pointer if called by the backend */
@@ -389,7 +399,8 @@ static INLINE int is_on_stack(be_abi_call_t *call, int pos)
 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp, ir_node *alloca_copy)
 {
 	ir_graph *irg             = env->birg->irg;
-	const arch_isa_t *isa     = env->birg->main_env->arch_env->isa;
+	const arch_env_t *arch_env = env->birg->main_env->arch_env;
+	const arch_isa_t *isa     = arch_env->isa;
 	ir_type *mt               = get_Call_type(irn);
 	ir_node *call_ptr         = get_Call_ptr(irn);
 	int n_params              = get_method_n_params(mt);
@@ -397,6 +408,7 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp, i
 	ir_node *bl               = get_nodes_block(irn);
 	pset *results             = pset_new_ptr(8);
 	pset *caller_save         = pset_new_ptr(8);
+	pset *states              = pset_new_ptr(2);
 	int stack_size            = 0;
 	int stack_dir             = arch_isa_stack_dir(isa);
 	const arch_register_t *sp = arch_isa_sp(isa);
@@ -409,10 +421,12 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp, i
 	int curr_res_proj = pn_Call_max;
 	int n_low_args    = 0;
 	int n_pos         = 0;
+	int count;
 
 	ir_node *low_call;
 	ir_node **in;
 	ir_node **res_projs;
+	const arch_register_t *reg;
 	const ir_edge_t *edge;
 	int *low_args;
 	int *pos;
@@ -569,8 +583,13 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp, i
 		const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
 		for(j = 0; j < cls->n_regs; ++j) {
 			const arch_register_t *reg = arch_register_for_index(cls, j);
-			if(arch_register_type_is(reg, caller_save))
+			if(arch_register_type_is(reg, caller_save)) {
 				pset_insert_ptr(caller_save, (void *) reg);
+			}
+			if(arch_register_type_is(reg, state)) {
+				pset_insert_ptr(caller_save, (void*) reg);
+				pset_insert_ptr(states, (void*) reg);
+			}
 		}
 	}
 
@@ -624,22 +643,35 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp, i
 	res_projs = obstack_finish(obst);
 
 	/* make the back end call node and set its register requirements. */
-	for(i = 0; i < n_low_args; ++i)
+	for(i = 0; i < n_low_args; ++i) {
 		obstack_ptr_grow(obst, get_Call_param(irn, low_args[i]));
+	}
+	foreach_pset(states, reg) {
+		const arch_register_class_t *cls = arch_register_get_class(reg);
+#if 0
+		ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
+		ir_fprintf(stderr, "Adding %+F\n", regnode);
+#endif
+		ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
+		obstack_ptr_grow(obst, regnode);
+	}
+	count = n_low_args + pset_count(states);
 
 	in = obstack_finish(obst);
 
 	if(env->call->flags.bits.call_has_imm && get_irn_opcode(call_ptr) == iro_SymConst) {
-		low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem, curr_sp, curr_sp,
-		                       curr_res_proj + pset_count(caller_save), n_low_args, in,
-		                       get_Call_type(irn));
+		low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
+		                       curr_sp, curr_sp,
+		                       curr_res_proj + pset_count(caller_save), count,
+		                       in, get_Call_type(irn));
 		be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
+	} else {
+		low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
+		                       curr_sp, call_ptr,
+		                       curr_res_proj + pset_count(caller_save),
+		                       count, in, get_Call_type(irn));
 	}
-
-	else
-		low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem, curr_sp, call_ptr,
-		                       curr_res_proj + pset_count(caller_save), n_low_args, in,
-		                       get_Call_type(irn));
+	ARR_APP1(ir_node*, env->calls, low_call);
 
 	/*
 		Set the register class of the call address to
@@ -677,6 +709,7 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp, i
 
 		assert(arg->in_reg);
 		be_set_constr_single_reg(low_call, BE_OUT_POS(pn), arg->reg);
+		arch_set_irn_register(arch_env, res_projs[i], arg->reg);
 	}
 	obstack_free(obst, in);
 	exchange(irn, low_call);
@@ -755,6 +788,7 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp, i
 	be_abi_call_free(call);
 	obstack_free(obst, pos);
 	del_pset(results);
+	del_pset(states);
 	del_pset(caller_save);
 
 	return curr_sp;
@@ -878,6 +912,7 @@ static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
 	ir_node *subsp, *mem, *res, *size, *sync;
 	ir_type *type;
 	ir_node *in[2];
+	ir_mode *sp_mode;
 
 	if (get_Free_where(free) != stack_alloc) {
 		assert(0);
@@ -887,6 +922,7 @@ static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
 	block = get_nodes_block(free);
 	irg = get_irn_irg(block);
 	type = get_Free_type(free);
+	sp_mode = env->isa->sp->reg_class->mode;
 
 	/* we might need to multiply the size with the element size */
 	if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
@@ -905,7 +941,7 @@ static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
 	subsp = be_new_SubSP(env->isa->sp, irg, block, curr_sp, size);
 
 	mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
-	res = new_r_Proj(irg, block, subsp, mode_P_data, pn_be_SubSP_res);
+	res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_res);
 
 	/* we need to sync the memory */
 	in[0] = get_Free_mem(free);
@@ -1656,7 +1692,9 @@ static void modify_irg(be_abi_irg_t *env)
 	ir_graph *irg             = env->birg->irg;
 	ir_node *bl               = get_irg_start_block(irg);
 	ir_node *end              = get_irg_end_block(irg);
-	ir_node *mem              = get_irg_initial_mem(irg);
+	ir_node *old_mem          = get_irg_initial_mem(irg);
+	ir_node *new_mem_proj;
+	ir_node *mem;
 	ir_type *method_type      = get_entity_type(get_irg_entity(irg));
 	pset *dont_save           = pset_new_ptr(8);
 
@@ -1743,8 +1781,10 @@ static void modify_irg(be_abi_irg_t *env)
 		const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
 		for(j = 0; j < cls->n_regs; ++j) {
 			const arch_register_t *reg = &cls->regs[j];
-			if(arch_register_type_is(reg, callee_save))
+			if(arch_register_type_is(reg, callee_save) ||
+					arch_register_type_is(reg, state)) {
 				pmap_insert(env->regs, (void *) reg, NULL);
+			}
 		}
 	}
 
@@ -1795,6 +1835,13 @@ static void modify_irg(be_abi_irg_t *env)
 	}
 	obstack_free(&env->obst, rm);
 
+	/* create a new initial memory proj */
+	assert(is_Proj(old_mem));
+	new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
+	                          new_r_Unknown(irg, mode_T), mode_M,
+	                          get_Proj_proj(old_mem));
+	mem = new_mem_proj;
+
 	/* Generate the Prologue */
 	fp_reg  = call->cb->prologue(env->cb, &mem, env->regs);
 
@@ -1813,6 +1860,10 @@ static void modify_irg(be_abi_irg_t *env)
 	set_irg_frame(irg, frame_pointer);
 	pset_insert_ptr(env->ignore_regs, fp_reg);
 
+	/* rewire old mem users to new mem */
+	set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
+	exchange(old_mem, mem);
+
 	set_irg_initial_mem(irg, mem);
 
 	/* Now, introduce stack param nodes for all parameters passed on the stack */
@@ -1868,7 +1919,7 @@ static void modify_irg(be_abi_irg_t *env)
 			exchange(irn, ret);
 		}
 	}
-	/* if we have endless loops here, n might be <= 0. Do NOT create a be_Return than,
+	/* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
 	   the code is dead and will never be executed. */
 
 	del_pset(dont_save);
@@ -1879,6 +1930,46 @@ static void modify_irg(be_abi_irg_t *env)
 	irg_block_walk_graph(irg, fix_start_block, NULL, &temp);
 }
 
+/** Fix the state inputs of calls that still hang on unknowns */
+static
+void fix_call_state_inputs(be_abi_irg_t *env)
+{
+	const arch_isa_t *isa = env->isa;
+	int i, n, n_states;
+	arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
+
+	/* Collect caller save registers */
+	n = arch_isa_get_n_reg_class(isa);
+	for(i = 0; i < n; ++i) {
+		int j;
+		const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
+		for(j = 0; j < cls->n_regs; ++j) {
+			const arch_register_t *reg = arch_register_for_index(cls, j);
+			if(arch_register_type_is(reg, state)) {
+				ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
+			}
+		}
+	}
+
+	n = ARR_LEN(env->calls);
+	n_states = ARR_LEN(stateregs);
+	for(i = 0; i < n; ++i) {
+		int s, arity;
+		ir_node *call = env->calls[i];
+
+		arity = get_irn_arity(call);
+
+		/* the statereg inputs are the last n inputs of the calls */
+		for(s = 0; s < n_states; ++s) {
+			int inp = arity - n_states + s;
+			const arch_register_t *reg = stateregs[s];
+			ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
+
+			set_irn_n(call, inp, regnode);
+		}
+	}
+}
+
 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
 {
 	be_abi_irg_t *env  = xmalloc(sizeof(env[0]));
@@ -1894,22 +1985,21 @@ be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
 
 	obstack_init(&env->obst);
 
-	env->isa           = birg->main_env->arch_env->isa;
-	env->method_type   = get_entity_type(get_irg_entity(irg));
-	env->call          = be_abi_call_new(env->isa->sp->reg_class);
+	env->isa         = birg->main_env->arch_env->isa;
+	env->method_type = get_entity_type(get_irg_entity(irg));
+	env->call        = be_abi_call_new(env->isa->sp->reg_class);
 	arch_isa_get_call_abi(env->isa, env->method_type, env->call);
 
-	env->ignore_regs      = pset_new_ptr_default();
-	env->keep_map         = pmap_create();
-	env->dce_survivor     = new_survive_dce();
-	env->birg             = birg;
-	env->stack_phis       = pset_new_ptr(16);
+	env->ignore_regs  = pset_new_ptr_default();
+	env->keep_map     = pmap_create();
+	env->dce_survivor = new_survive_dce();
+	env->birg         = birg;
 
-	env->sp_req.type      = arch_register_req_type_limited;
-	env->sp_req.cls       = arch_register_get_class(env->isa->sp);
-	limited_bitset        = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
+	env->sp_req.type    = arch_register_req_type_limited;
+	env->sp_req.cls     = arch_register_get_class(env->isa->sp);
+	limited_bitset      = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
 	rbitset_set(limited_bitset, arch_register_get_index(env->isa->sp));
-	env->sp_req.limited   = limited_bitset;
+	env->sp_req.limited = limited_bitset;
 
 	env->sp_cls_req.type  = arch_register_req_type_normal;
 	env->sp_cls_req.cls   = arch_register_get_class(env->isa->sp);
@@ -1922,8 +2012,7 @@ be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
 	restore_optimization_state(&state);
 	FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
 
-	memcpy(&env->irn_handler, &abi_irn_handler, sizeof(abi_irn_handler));
-	env->irn_ops.impl = &abi_irn_ops;
+	env->calls = NEW_ARR_F(ir_node*, 0);
 
 	/* Lower all call nodes in the IRG. */
 	process_calls(env);
@@ -1937,9 +2026,15 @@ be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
 	/* Process the IRG */
 	modify_irg(env);
 
+	/* fix call inputs for state registers */
+	fix_call_state_inputs(env);
+
 	/* We don't need the keep map anymore. */
 	pmap_destroy(env->keep_map);
 
+	/* calls array is not needed anymore */
+	DEL_ARR_F(env->calls);
+
 	/* reroute the stack origin of the calls to the true stack origin. */
 	exchange(dummy, env->init_sp);
 	exchange(old_frame, get_irg_frame(irg));
@@ -1950,8 +2045,6 @@ be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
 		survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
 	}
 
-	arch_env_push_irn_handler(env->birg->main_env->arch_env, &env->irn_handler);
-
 	env->call->cb->done(env->cb);
 	env->cb = NULL;
 	return env;
@@ -1959,12 +2052,11 @@ be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
 
 void be_abi_free(be_abi_irg_t *env)
 {
+	be_abi_call_free(env->call);
 	free_survive_dce(env->dce_survivor);
-	del_pset(env->stack_phis);
 	del_pset(env->ignore_regs);
 	pmap_destroy(env->regs);
 	obstack_free(&env->obst, NULL);
-	arch_env_pop_irn_handler(env->birg->main_env->arch_env);
 	free(env);
 }
 
@@ -1992,46 +2084,79 @@ const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
 
 */
 
-struct fix_stack_walker_info {
-	nodeset *nodes;
-	const arch_env_t *aenv;
-};
+typedef ir_node **node_array;
+
+typedef struct fix_stack_walker_env_t {
+	node_array sp_nodes;
+	const arch_env_t *arch_env;
+} fix_stack_walker_env_t;
 
 /**
  * Walker. Collect all stack modifying nodes.
  */
-static void collect_stack_nodes_walker(ir_node *irn, void *data)
+static void collect_stack_nodes_walker(ir_node *node, void *data)
 {
-	struct fix_stack_walker_info *info = data;
-
-	if (is_Block(irn))
-		return;
+	fix_stack_walker_env_t *env = data;
 
-	if (arch_irn_is(info->aenv, irn, modify_sp)) {
-		assert(get_irn_mode(irn) != mode_M && get_irn_mode(irn) != mode_T);
-		pset_insert_ptr(info->nodes, irn);
+	if (arch_irn_is(env->arch_env, node, modify_sp)) {
+		assert(get_irn_mode(node) != mode_M && get_irn_mode(node) != mode_T);
+		ARR_APP1(ir_node*, env->sp_nodes, node);
 	}
 }
 
-void be_abi_fix_stack_nodes(be_abi_irg_t *env, be_lv_t *lv)
+void be_abi_fix_stack_nodes(be_abi_irg_t *env)
 {
-	pset *stack_nodes = pset_new_ptr(16);
-	struct fix_stack_walker_info info;
-	int collect_phis;
+	be_ssa_construction_env_t senv;
+	int i, len;
+	ir_node **phis;
+	be_irg_t *birg = env->birg;
+	be_lv_t *lv = be_get_birg_liveness(birg);
+	fix_stack_walker_env_t walker_env;
+	arch_isa_t *isa;
+
+	walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
+	walker_env.arch_env = birg->main_env->arch_env;
+	isa = walker_env.arch_env->isa;
+
+	irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
+
+	/* nothing to be done if we didn't find any node, in fact we mustn't
+	 * continue, as for endless loops incsp might have had no users and is bad
+	 * now.
+	 */
+	len = ARR_LEN(walker_env.sp_nodes);
+	if(len == 0) {
+		DEL_ARR_F(walker_env.sp_nodes);
+		return;
+	}
 
-	info.nodes = stack_nodes;
-	info.aenv  = env->birg->main_env->arch_env;
+	be_ssa_construction_init(&senv, birg);
+	be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
+                                   ARR_LEN(walker_env.sp_nodes));
+	be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
+	                              ARR_LEN(walker_env.sp_nodes));
 
-	be_assure_dom_front(env->birg);
+	if(lv != NULL) {
+		len = ARR_LEN(walker_env.sp_nodes);
+		for(i = 0; i < len; ++i) {
+			be_liveness_update(lv, walker_env.sp_nodes[i]);
+		}
+		be_ssa_construction_update_liveness_phis(&senv, lv);
+	}
+
+	phis = be_ssa_construction_get_new_phis(&senv);
 
+	/* set register requirements for stack phis */
+	len = ARR_LEN(phis);
+	for(i = 0; i < len; ++i) {
+		ir_node *phi = phis[i];
+		be_set_phi_reg_req(walker_env.arch_env, phi, &env->sp_req);
+		be_set_phi_flags(walker_env.arch_env, phi, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
+		arch_set_irn_register(walker_env.arch_env, phi, env->isa->sp);
+	}
+	be_ssa_construction_destroy(&senv);
 
-	irg_walk_graph(env->birg->irg, collect_stack_nodes_walker, NULL, &info);
-	pset_insert_ptr(stack_nodes, env->init_sp);
-	collect_phis = 1;
-	if (env->call->cb->collect_stack_phis)
-		collect_phis = env->call->cb->collect_stack_phis(env->cb);
-	be_ssa_constr_set_phis(env->birg->dom_front, lv, stack_nodes, collect_phis ? env->stack_phis : NULL);
-	del_pset(stack_nodes);
+	DEL_ARR_F(walker_env.sp_nodes);
 }
 
 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
@@ -2135,105 +2260,6 @@ ir_node *be_abi_get_start_barrier(be_abi_irg_t *abi)
 	return abi->start_barrier;
 }
 
-/*
-  _____ _____  _   _   _    _                 _ _
- |_   _|  __ \| \ | | | |  | |               | | |
-   | | | |__) |  \| | | |__| | __ _ _ __   __| | | ___ _ __
-   | | |  _  /| . ` | |  __  |/ _` | '_ \ / _` | |/ _ \ '__|
-  _| |_| | \ \| |\  | | |  | | (_| | | | | (_| | |  __/ |
- |_____|_|  \_\_| \_| |_|  |_|\__,_|_| |_|\__,_|_|\___|_|
-
-  for Phi nodes which are created due to stack modifying nodes
-  such as IncSP, AddSP and SetSP.
-
-  These Phis are always to be ignored by the reg alloc and are
-  fixed on the SP register of the ISA.
-*/
-
-static const void *abi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn)
-{
-	const be_abi_irg_t *abi = get_abi_from_handler(handler);
-	const void *res = NULL;
-
-	if(is_Phi(irn) && pset_find_ptr(abi->stack_phis, (void *) irn))
-		res = &abi->irn_ops;
-
-	return res;
-}
-
-static
-const arch_register_req_t *abi_get_irn_reg_req(const void *self,
-                                               const ir_node *irn, int pos)
-{
-	be_abi_irg_t *abi = get_abi_from_ops(self);
-
-	if(pos == BE_OUT_POS(0)) {
-		return &abi->sp_req;
-	} else if(pos >= 0 && pos < get_irn_arity(irn)) {
-		return &abi->sp_cls_req;
-	}
-
-	return arch_no_register_req;
-}
-
-static void abi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
-{
-}
-
-static const arch_register_t *abi_get_irn_reg(const void *self, const ir_node *irn)
-{
-	const be_abi_irg_t *abi = get_abi_from_ops(self);
-	return abi->isa->sp;
-}
-
-static arch_irn_class_t abi_classify(const void *_self, const ir_node *irn)
-{
-	return arch_irn_class_normal;
-}
-
-static arch_irn_flags_t abi_get_flags(const void *_self, const ir_node *irn)
-{
-	return arch_irn_flags_ignore | arch_irn_flags_modify_sp;
-}
-
-static ir_entity *abi_get_frame_entity(const void *_self, const ir_node *irn)
-{
-	return NULL;
-}
-
-static void abi_set_frame_entity(const void *_self, ir_node *irn, ir_entity *ent)
-{
-}
-
-static void abi_set_frame_offset(const void *_self, ir_node *irn, int bias)
-{
-}
-
-static int abi_get_sp_bias(const void *self, const ir_node *irn)
-{
-	return 0;
-}
-
-static const arch_irn_ops_if_t abi_irn_ops = {
-	abi_get_irn_reg_req,
-	abi_set_irn_reg,
-	abi_get_irn_reg,
-	abi_classify,
-	abi_get_flags,
-	abi_get_frame_entity,
-	abi_set_frame_entity,
-	abi_set_frame_offset,
-	abi_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 abi_irn_handler = {
-	abi_get_irn_ops
-};
-
 /**
  * Returns non-zero if the ABI has omitted the frame pointer in
  * the current graph.