X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeinfo.c;h=05f1b95b90b13c65f1abb90d8e6a4598c97d21ed;hb=e9e538b53d0d890d5037faf17f0865299a75dd28;hp=1cdfcdd71151568cbab18025540802d719190452;hpb=2807bb5b1ed34c23dc30d228ab0686c6fc9d6ae3;p=libfirm

diff --git a/ir/be/beinfo.c b/ir/be/beinfo.c
index 1cdfcdd71..05f1b95b9 100644
--- a/ir/be/beinfo.c
+++ b/ir/be/beinfo.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2011 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -20,49 +20,68 @@
 /**
  * @file
  * @author      Matthias Braun
- * @version     $Id$
  */
 #include "config.h"
 
 #include <stdbool.h>
 
 #include "beinfo.h"
+#include "beirg.h"
 #include "bearch.h"
 #include "benode.h"
+#include "besched.h"
 #include "irgwalk.h"
 #include "irnode_t.h"
+#include "irdump_t.h"
 #include "error.h"
 
-static copy_attr_func  old_phi_copy_attr;
+static copy_attr_func old_phi_copy_attr;
 
-void be_info_new_node(ir_node *node)
+void be_info_new_node(ir_graph *irg, ir_node *node)
 {
 	struct obstack *obst;
 	backend_info_t *info;
 
-	/* Projs need no be info, their tuple holds all information */
- 	if (is_Proj(node))
+	/* Projs need no be info, all info is fetched from their predecessor */
+	if (is_Proj(node))
 		return;
 
-	obst = be_get_birg_obst(current_ir_graph);
+	obst = be_get_be_obst(irg);
 	info = OALLOCZ(obst, backend_info_t);
 
 	assert(node->backend_info == NULL);
 	node->backend_info = info;
 
-	/* Hack! We still have middle end nodes in the backend (which was probably
-	   a bad decision back then), which have no register constraints.
-	   Set some none_requirements here.
+	/*
+	 * Set backend info for some middleend nodes which still appear in
+	 * backend graphs
 	 */
-	if (get_irn_mode(node) != mode_T
-			&& get_irn_opcode(node) <= iro_Last) {
+	switch (get_irn_opcode(node)) {
+	case iro_Block:
+	case iro_Dummy:
+	case iro_NoMem:
+	case iro_Anchor:
+	case iro_Pin:
+	case iro_Sync:
+	case iro_Bad:
+	case iro_End:
+	case iro_Unknown:
+		info->flags |= arch_irn_flags_not_scheduled;
 		info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
 		memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
 		info->out_infos[0].req = arch_no_register_req;
+		break;
+	case iro_Phi:
+		info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
+		memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
+		info->out_infos[0].req = arch_no_register_req;
+		break;
+	default:
+		break;
 	}
 }
 
-static void new_Phi_copy_attr(ir_graph *irg, const ir_node *old_node,
+static void new_phi_copy_attr(ir_graph *irg, const ir_node *old_node,
                               ir_node *new_node)
 {
 	backend_info_t *old_info = be_get_info(old_node);
@@ -73,14 +92,25 @@ static void new_Phi_copy_attr(ir_graph *irg, const ir_node *old_node,
 	old_phi_copy_attr(irg, old_node, new_node);
 }
 
-int be_infos_equal(const backend_info_t *info1, const backend_info_t *info2)
+int be_nodes_equal(const ir_node *node1, const ir_node *node2)
 {
-	int             len   = ARR_LEN(info1->out_infos);
-	int             i;
+	const backend_info_t *info1 = be_get_info(node1);
+	const backend_info_t *info2 = be_get_info(node2);
+	size_t                len   = ARR_LEN(info1->out_infos);
+	int                   arity = get_irn_arity(node1);
+	int                   in;
+	size_t                i;
 
 	if (ARR_LEN(info2->out_infos) != len)
 		return false;
 
+	assert(arity == get_irn_arity(node2));
+
+	for (in = 0; in < arity; ++in) {
+		if (info1->in_reqs[in] != info2->in_reqs[in])
+			return false;
+	}
+
 	for (i = 0; i < len; ++i) {
 		const reg_out_info_t *out1 = &info1->out_infos[i];
 		const reg_out_info_t *out2 = &info2->out_infos[i];
@@ -93,17 +123,11 @@ int be_infos_equal(const backend_info_t *info1, const backend_info_t *info2)
 	return true;
 }
 
-int be_nodes_equal(const ir_node *node1, const ir_node *node2)
-{
-	backend_info_t *info1 = be_get_info(node1);
-	backend_info_t *info2 = be_get_info(node2);
-	return be_infos_equal(info1, info2);
-}
-
 static void init_walker(ir_node *node, void *data)
 {
+	ir_graph *irg = get_irn_irg(node);
 	(void) data;
-	be_info_new_node(node);
+	be_info_new_node(irg, node);
 }
 
 static bool initialized = false;
@@ -114,7 +138,7 @@ void be_info_init(void)
 		panic("double initialization of be_info");
 
 	old_phi_copy_attr = op_Phi->ops.copy_attr;
-	op_Phi->ops.copy_attr = new_Phi_copy_attr;
+	op_Phi->ops.copy_attr = new_phi_copy_attr;
 	initialized = true;
 
 	/* phis have register and register requirements now which we want to dump */
@@ -122,26 +146,42 @@ void be_info_init(void)
 	op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
 }
 
+/**
+ * Edge hook to dump the schedule edges.
+ */
+static void sched_edge_hook(FILE *F, const ir_node *irn)
+{
+	if (get_irn_irg(irn)->be_data == NULL)
+		return;
+
+	if (sched_is_scheduled(irn) && !is_Block(irn)) {
+		ir_node *const prev = sched_prev(irn);
+		if (!sched_is_begin(prev)) {
+			fprintf(F, "edge:{sourcename: ");
+			print_nodeid(F, irn);
+			fprintf(F, " targetname: ");
+			print_nodeid(F, prev);
+			fprintf(F, " color:magenta}\n");
+		}
+	}
+}
+
 void be_info_init_irg(ir_graph *irg)
 {
 	irg_walk_anchors(irg, init_walker, NULL, NULL);
+
+	set_dump_node_edge_hook(sched_edge_hook);
 }
 
 void be_info_free(void)
 {
 	if (!initialized)
-		panic("be_info_free called without prior init");
+		panic("called without prior init");
 
-	assert(op_Phi->ops.copy_attr == new_Phi_copy_attr);
+	assert(op_Phi->ops.copy_attr == new_phi_copy_attr);
 	op_Phi->ops.copy_attr = old_phi_copy_attr;
 	initialized = false;
 
 	assert(op_Phi->ops.dump_node == be_dump_phi_reg_reqs);
 	op_Phi->ops.dump_node = NULL;
 }
-
-int be_info_initialized(const ir_graph *irg)
-{
-	(void) irg;
-	return initialized;
-}