X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fbe%2Fbeinfo.c;h=d17e59c854aad9b510ee9244d83ceb51d69cdf27;hb=9181bbbb24cd351c0e21c538bcf0341674e0c3fc;hp=2f71d18ff9d4936a5e938ca548f7ac9a85b01728;hpb=f8cc15664f571aa7ef89d6f6bc8d5bd2b8ca7d53;p=libfirm

diff --git a/ir/be/beinfo.c b/ir/be/beinfo.c
index 2f71d18ff..d17e59c85 100644
--- a/ir/be/beinfo.c
+++ b/ir/be/beinfo.c
@@ -1,20 +1,6 @@
 /*
- * Copyright (C) 1995-2011 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.
- *
- * 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.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
 /**
@@ -26,17 +12,21 @@
 #include <stdbool.h>
 
 #include "beinfo.h"
+#include "beirg.h"
 #include "bearch.h"
 #include "benode.h"
 #include "besched.h"
+#include "bedump.h"
+#include "belive_t.h"
 #include "irgwalk.h"
 #include "irnode_t.h"
 #include "irdump_t.h"
+#include "irhooks.h"
 #include "error.h"
 
 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;
@@ -45,7 +35,7 @@ void be_info_new_node(ir_node *node)
 	if (is_Proj(node))
 		return;
 
-	obst = be_get_be_obst(current_ir_graph);
+	obst = be_get_be_obst(irg);
 	info = OALLOCZ(obst, backend_info_t);
 
 	assert(node->backend_info == NULL);
@@ -66,13 +56,9 @@ void be_info_new_node(ir_node *node)
 	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;
+		/* FALLTHROUGH */
 	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        = NEW_ARR_DZ(reg_out_info_t, obst, 1);
 		info->out_infos[0].req = arch_no_register_req;
 		break;
 	default:
@@ -124,11 +110,31 @@ int be_nodes_equal(const ir_node *node1, const ir_node *node2)
 
 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;
+static bool         initialized = false;
+static hook_entry_t hook_liveness_info;
+
+static void dump_liveness_info_hook(void *context, FILE *F, const ir_node *node)
+{
+	(void)context;
+	if (!is_Block(node))
+		return;
+	ir_graph *irg = get_irn_irg(node);
+	if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND))
+		return;
+
+	be_lv_t *lv = be_get_irg_liveness(irg);
+	if (lv == NULL)
+		return;
+	if (!lv->sets_valid)
+		return;
+
+	be_dump_liveness_block(lv, F, node);
+}
 
 void be_info_init(void)
 {
@@ -142,30 +148,36 @@ void be_info_init(void)
 	/* phis have register and register requirements now which we want to dump */
 	assert(op_Phi->ops.dump_node == NULL);
 	op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
+
+	hook_liveness_info.hook._hook_node_info = dump_liveness_info_hook;
+	register_hook(hook_node_info, &hook_liveness_info);
 }
 
 /**
  * Edge hook to dump the schedule edges.
  */
-static void sched_edge_hook(FILE *F, ir_node *irn)
+static void sched_edge_hook(FILE *F, const ir_node *irn)
 {
-	if (is_Proj(irn))
+	ir_graph *irg = get_irn_irg(irn);
+	if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND))
 		return;
-	if (get_irn_irg(irn)->be_data == NULL)
+
+	if (is_Proj(irn) || is_Block(irn) || !sched_is_scheduled(irn))
 		return;
 
-	if (sched_is_scheduled(irn) && sched_has_prev(irn)) {
-		ir_node *prev = sched_prev(irn);
-		fprintf(F, "edge:{sourcename:\"");
-		PRINT_NODEID(irn);
-		fprintf(F, "\" targetname:\"");
-		PRINT_NODEID(prev);
-		fprintf(F, "\" color:magenta}\n");
+	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)
 {
+	add_irg_constraints(irg, IR_GRAPH_CONSTRAINT_BACKEND);
 	irg_walk_anchors(irg, init_walker, NULL, NULL);
 
 	set_dump_node_edge_hook(sched_edge_hook);
@@ -174,7 +186,7 @@ void be_info_init_irg(ir_graph *irg)
 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);
 	op_Phi->ops.copy_attr = old_phi_copy_attr;
@@ -182,10 +194,6 @@ void be_info_free(void)
 
 	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;
+	unregister_hook(hook_node_info, &hook_liveness_info);
 }