X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelower.c;h=f4bfd78c72bee9e78d7af4a865967f008861dbe3;hb=f7aeba1c435b8ea674263f30aff4deb53c84eed0;hp=0d0bb3d02f6296f2f2a6eb1019747ba6a66d40f1;hpb=afaf4a5efe7dd7fafc2a478e0cb0423fc574ef51;p=libfirm

diff --git a/ir/be/belower.c b/ir/be/belower.c
index 0d0bb3d02..f4bfd78c7 100644
--- a/ir/be/belower.c
+++ b/ir/be/belower.c
@@ -11,19 +11,26 @@
 #include "config.h"
 #endif
 
+#include <stdlib.h>
+
+#include "ircons.h"
+
 #include "bearch.h"
 #include "belower.h"
 #include "benode_t.h"
 #include "bechordal_t.h"
-#include "besched.h"
+#include "besched_t.h"
 
 #include "irgmod.h"
-#include "iredges.h"
+#include "iredges_t.h"
 #include "irgwalk.h"
 
 #undef is_Perm
 #define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm)
 
+#undef is_Call
+#define is_Call(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_call)
+
 /* lowering walker environment */
 typedef struct _lower_env_t {
 	be_chordal_env_t  *chord_env;
@@ -201,13 +208,14 @@ static perm_cycle_t *get_perm_cycle(perm_cycle_t *cycle, reg_pair_t *pairs, int
 /**
  * Lowers a perm node.  Resolves cycles and creates a bunch of
  * copy and swap operations to permute registers.
+ * Note: The caller of this function has to make sure, that irn
+ *       is a Perm node.
  *
  * @param irn      The perm node
  * @param block    The block the perm node belongs to
  * @param walk_env The environment
  */
 static void lower_perm_node(ir_node *irn, void *walk_env) {
-	const be_node_factory_t     *fact;
 	const arch_register_class_t *reg_class;
 	const arch_env_t            *arch_env;
 	firm_dbg_module_t           *mod;
@@ -220,21 +228,11 @@ static void lower_perm_node(ir_node *irn, void *walk_env) {
 	ir_node         *arg1, *arg2, *res1, *res2;
 	ir_node         *cpyxchg = NULL;
 
-	if (is_Block(irn))
-		return;
-
-	fact     = env->chord_env->main_env->node_factory;
 	arch_env = env->chord_env->main_env->arch_env;
 	do_copy  = env->do_copy;
 	mod      = env->dbg_module;
 	block    = get_nodes_block(irn);
 
-	/* check if perm
-	   Note: A Proj on a Perm will cause is_Perm()
-	         also to return true */
-	if (is_Proj(irn) || ! is_Perm(arch_env, irn))
-		return;
-
 	/*
 		Get the schedule predecessor node to the perm
 		NOTE: This works with auto-magic. If we insert the
@@ -342,7 +340,7 @@ static void lower_perm_node(ir_node *irn, void *walk_env) {
 				DBG((mod, LEVEL_1, "%+F                        (%+F, %s) and (%+F, %s)\n",
 					irn, res1, cycle->elems[i]->name, res2, cycle->elems[i + 1]->name));
 
-				cpyxchg = new_Perm(fact, reg_class, env->chord_env->irg, block, 2, in);
+				cpyxchg = be_new_Perm(reg_class, env->chord_env->irg, block, 2, in);
 
 				sched_remove(res1);
 				sched_remove(res2);
@@ -362,7 +360,7 @@ static void lower_perm_node(ir_node *irn, void *walk_env) {
 				DBG((mod, LEVEL_1, "%+F creating copy node (%+F, %s) -> (%+F, %s)\n",
 					irn, arg1, cycle->elems[i]->name, res2, cycle->elems[i + 1]->name));
 
-				cpyxchg = new_Copy(fact, reg_class, env->chord_env->irg, block, arg1);
+				cpyxchg = be_new_Copy(reg_class, env->chord_env->irg, block, arg1);
 				arch_set_irn_register(arch_env, cpyxchg, cycle->elems[i + 1]);
 
 				/* remove the proj from the schedule */
@@ -386,18 +384,193 @@ static void lower_perm_node(ir_node *irn, void *walk_env) {
 	sched_remove(irn);
 }
 
+
+
 /**
- * Walks over all blocks in an irg and performs perm lowering.
+ * Adds Projs to keep nodes for each register class, which eats the
+ * caller saved registers.
+ * Note: The caller has to make sure, that call is a Call
+ *
+ * @param call     The Call node
+ * @param walk_env The walker environment
+ */
+static void lower_call_node(ir_node *call, void *walk_env) {
+	lower_env_t                 *env      = walk_env;
+	const arch_env_t            *arch_env = env->chord_env->main_env->arch_env;
+	firm_dbg_module_t           *mod      = env->dbg_module;
+	const arch_register_class_t *reg_class;
+	int                          i, j, set_size = 0, pn, keep_arity;
+	arch_isa_t                  *isa      = arch_env_get_isa(arch_env);
+	const ir_node               *proj_T   = NULL;
+	ir_node                     **in_keep, *block = get_nodes_block(call);
+	ir_node                     *last_proj = NULL;
+	bitset_t                    *proj_set;
+	const ir_edge_t             *edge;
+	const arch_register_t       *reg;
+
+	/* Prepare the bitset where we store the projnums which are already in use*/
+	for (i = 0; i < arch_isa_get_n_reg_class(isa); i++) {
+		reg_class  = arch_isa_get_reg_class(isa, i);
+		set_size  += arch_register_class_n_regs(reg_class);
+	}
+
+	in_keep = malloc(set_size * sizeof(ir_node *));
+
+	proj_set = bitset_malloc(set_size);
+	bitset_clear_all(proj_set);
+
+	/* check if there is a ProjT node and which arguments are used */
+	foreach_out_edge(call, edge) {
+		if (get_irn_mode(get_edge_src_irn(edge)) == mode_T)
+			proj_T = get_edge_src_irn(edge);
+	}
+
+	/* set all used arguments */
+	if (proj_T) {
+
+
+		foreach_out_edge(proj_T, edge) {
+			ir_node *proj       = get_edge_src_irn(edge);
+
+			assert(is_Proj(proj));
+			bitset_set(proj_set, get_Proj_proj(get_edge_src_irn(edge)));
+
+			/*
+			 * Filter out the last proj in the schedule.
+			 * After that one, we have to insert the Keep node.
+			 */
+			if(!last_proj || sched_comes_after(last_proj, proj))
+				last_proj = proj;
+
+		}
+	}
+	else {
+		proj_T = new_r_Proj(current_ir_graph, block, call, mode_T, pn_Call_T_result);
+	}
+
+	/* Create for each caller save register a proj (keep node arguement) */
+	/* if this proj is not already present */
+	for (i = 0; i < arch_isa_get_n_reg_class(isa); i++) {
+
+		/* reset the keep input, as we need one keep for each register class */
+		memset(in_keep, 0, set_size * sizeof(ir_node *));
+		keep_arity = 0;
+		reg_class  = arch_isa_get_reg_class(isa, i);
+
+		for (j = 0; j < arch_register_class_n_regs(reg_class); j++) {
+			reg = arch_register_for_index(reg_class, j);
+
+			/* only check caller save registers */
+			if (arch_register_type_is(reg, caller_saved)) {
+				pn = isa->impl->get_projnum_for_register(isa, reg);
+				if (!bitset_is_set(proj_set, pn)) {
+					ir_node *proj = new_r_Proj(current_ir_graph, block, (ir_node *)proj_T, mode_Is, pn);
+
+					in_keep[keep_arity++] = proj;
+					sched_add_after(last_proj, proj);
+					last_proj = proj;
+				}
+			}
+		}
+
+		/* ok, we found some caller save register which are not in use but must be saved */
+		if (keep_arity) {
+			ir_node *keep;
+
+			keep = be_new_Keep(reg_class, current_ir_graph, block, keep_arity, in_keep);
+			sched_add_after(last_proj, keep);
+		}
+	}
+
+	bitset_free(proj_set);
+	return;
+}
+
+
+
+/**
+ * Calls the backend code generator functions to lower Spill and
+ * Reload nodes into Store and Load. The backend is fully responsible
+ * for creating the new nodes and setting their input correct.
+ * Note: The caller of this has to make sure that irn is a Spill
+ *       or Reload!
+ *
+ * @param irn      The Spill/Reload node
+ * @param walk_env The walker environment
+ */
+static void lower_spill_reload(ir_node *irn, void *walk_env) {
+	lower_env_t           *env  = walk_env;
+	arch_code_generator_t *cg   = env->chord_env->main_env->cg;
+	const arch_env_t      *aenv = env->chord_env->main_env->arch_env;
+	ir_node               *res  = NULL;
+	ir_node               *sched_point;
+
+	if (be_is_Spill(irn) && cg->impl->lower_spill) {
+		res = cg->impl->lower_spill(cg, irn);
+	}
+	else if (be_is_Reload(irn) && cg->impl->lower_reload) {
+		res = cg->impl->lower_reload(cg, irn);
+		if (res && res != irn) {
+			/* copy the result register from the reload to the load */
+			arch_set_irn_register(aenv, res, arch_get_irn_register(aenv, irn));
+		}
+	}
+
+	if (res && res != irn) {
+		sched_point = sched_prev(irn);
+		sched_remove(irn);
+		exchange(irn, res);
+		sched_add_after(sched_point, res);
+	}
+	else {
+		DBG((env->dbg_module, LEVEL_1, "node %+F not lowered\n", irn));
+	}
+
+	return;
+}
+
+
+
+/**
+ * Calls the corresponding lowering function for the node.
+ *
+ * @param irn      The node to be checked for lowering
+ * @param walk_env The walker environment
+ */
+static void lower_nodes_walker(ir_node *irn, void *walk_env) {
+	lower_env_t      *env      = walk_env;
+	const arch_env_t *arch_env = env->chord_env->main_env->arch_env;
+
+	if (!is_Block(irn) && !is_Proj(irn)) {
+		if (is_Perm(arch_env, irn)) {
+			lower_perm_node(irn, walk_env);
+		}
+		else if (is_Call(arch_env, irn)) {
+			lower_call_node(irn, walk_env);
+		}
+		else if (be_is_Spill(irn) || be_is_Reload(irn)) {
+			lower_spill_reload(irn, walk_env);
+		}
+	}
+
+	return;
+}
+
+/**
+ * Walks over all blocks in an irg and performs some lowering.
  *
  * @param chord_env The chordal environment containing the irg
  * @param do_copy   1 == resolve cycles with a free reg if available
  */
-void lower_perms(be_chordal_env_t *chord_env, int do_copy) {
+void lower_nodes(be_chordal_env_t *chord_env, int do_copy) {
 	lower_env_t env;
 
 	env.chord_env  = chord_env;
 	env.do_copy    = do_copy;
 	env.dbg_module = firm_dbg_register("ir.be.lower");
 
-	irg_walk_blkwise_graph(chord_env->irg,  NULL, lower_perm_node, &env);
+	irg_walk_blkwise_graph(chord_env->irg, NULL, lower_nodes_walker, &env);
 }
+
+#undef is_Perm
+#undef is_Call