X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.c;h=1637c4d2115408a5c59aa9f5db55959aff43aa2f;hb=d7343573ce41f42a614410632b6aff56b4f30015;hp=10745a2a4a8e7fd9bcd4edbb3edd3a9c86eceff5;hpb=9b060a71a2667ced8d103023eda0ff710e799867;p=libfirm

diff --git a/ir/be/beutil.c b/ir/be/beutil.c
index 10745a2a4..1637c4d21 100644
--- a/ir/be/beutil.c
+++ b/ir/be/beutil.c
@@ -1,62 +1,167 @@
+/*
+ * Copyright (C) 1995-2008 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.
+ */
+
+/**
+ * @file
+ * @brief       Contains some useful function for the backend.
+ * @author      Sebastian Hack
+ * @version     $Id$
+ */
+#include "config.h"
 
 #include <stdio.h>
 
+#include "pset.h"
+
 #include "irgraph.h"
 #include "irgwalk.h"
+#include "irdump_t.h"
+#include "irdom_t.h"
+#include "ircons.h"
+#include "iropt.h"
+#include "irgopt.h"
+#include "irtools.h"
 #include "irprintf.h"
+#include "iredges.h"
 
 #include "beutil.h"
 #include "besched_t.h"
-#include "bera_t.h"
+#include "bearch_t.h"
+
+/* Get an always empty set. */
+pset *be_empty_set(void)
+{
+	static pset *empty_set = NULL;
 
-static void dump_allocated_block(ir_node *block, void *env)
+	if(!empty_set)
+		empty_set = pset_new_ptr(1);
+
+	assert(pset_count(empty_set) == 0);
+	return empty_set;
+}
+
+/**
+ * Edge hook to dump the schedule edges.
+ */
+static int sched_edge_hook(FILE *F, ir_node *irn)
 {
-	int i, n;
-	const ir_node *irn;
-	FILE *f = env;
-
-	ir_fprintf(f, "node:{title:\"b%N\"\nlabel:\"%n\n", block, block);
-	sched_foreach(block, irn) {
-		const char *prefix = "";
-
-		ir_fprintf(f, "\n");
-		if(is_color(get_irn_color(irn)))
-			ir_fprintf(f, "r%d = ", get_irn_color(irn));
-		ir_fprintf(f, "%n(", irn);
-
-		if(block != get_irg_start_block(get_irn_irg(block))) {
-			for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
-				ir_node *op = get_irn_n(irn, i);
-				if(is_allocatable_irn(op)) {
-					ir_fprintf(f, "%sr%d", prefix, get_irn_color(op));
-					prefix = ", ";
-				}
-			}
-		}
-
-		ir_fprintf(f, ")");
+	if (is_Proj(irn))
+		return 1;
+	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_fprintf(f, "\"}\n");
+	return 1;
+}
+
+void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) {
+	DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
+
+	dump_consts_local(0);
+	if (have_sched_info(irg))
+		set_dump_node_edge_hook(sched_edge_hook);
+	dump_ir_block_graph(irg, suffix);
+	set_dump_node_edge_hook(old);
+}
+
+void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix) {
+	DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
+
+	dump_consts_local(0);
+	if (have_sched_info(irg))
+		set_dump_node_edge_hook(sched_edge_hook);
+	dump_ir_extblock_graph(irg, suffix);
+	set_dump_node_edge_hook(old);
+}
+
+/**
+ * Dumps a graph and numbers all dumps.
+ * @param irg    The graph
+ * @param suffix A suffix to its file name.
+ * @param dumper The dump function
+ */
+void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const char *)) {
+	static ir_graph *last_irg = NULL;
+	static int       nr       = 0;
+	char             buf[128];
 
-	if(get_irg_start_block(get_irn_irg(block)) != block) {
-		for(i = 0, n = get_irn_arity(block); i < n; ++i) {
-			ir_node *pred_bl = get_nodes_block(get_irn_n(block, i));
-			ir_fprintf(f, "edge:{sourcename:\"b%N\" targetname:\"b%N\"}\n", pred_bl, block);
-		}
+	if (irg != last_irg) {
+		last_irg = irg;
+		nr       = strcmp(suffix, "-abi") ? 0 : 1;
 	}
+
+	snprintf(buf, sizeof(buf), "-%02d%s", nr++, suffix);
+	buf[sizeof(buf) - 1] = '\0';
+	dumper(irg, buf);
 }
 
-void dump_allocated_irg(ir_graph *irg)
+void be_clear_links(ir_graph *irg)
 {
-	char buf[1024];
-	FILE *f;
+	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
+	irg_walk_graph(irg, firm_clear_link, NULL, NULL);
+	ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
+}
+
+static void count_num_reachable_nodes(ir_node *irn, void *env)
+{
+	int *num = env;
+	(*num)++;
+	(void) irn;
+}
+
+unsigned get_num_reachable_nodes(ir_graph *irg) {
+	int num = 0;
+	irg_walk_graph(irg, count_num_reachable_nodes, NULL, &num);
+	return num;
+}
 
-	snprintf(buf, sizeof(buf), "%s-alloc.vcg", get_entity_name(get_irg_entity(irg)));
+/**
+ * Gets the Proj with number pn from irn.
+ */
+ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn) {
+	const ir_edge_t *edge;
+	ir_node         *proj;
+	assert(get_irn_mode(irn) == mode_T && "need mode_T");
+
+	foreach_out_edge(irn, edge) {
+		proj = get_edge_src_irn(edge);
+
+		if (is_Proj(proj) && get_Proj_proj(proj) == pn)
+			return proj;
+	}
+
+	return NULL;
+}
+
+FILE *be_ffopen(const char *base, const char *ext, const char *mode) {
+	FILE *out;
+	char buf[1024];
 
-	if((f = fopen(buf, "wt")) != NULL) {
-		fprintf(f, "graph:{title:\"prg\"\n");
-		irg_block_walk_graph(irg, dump_allocated_block, NULL, f);
-		fprintf(f, "}\n");
-		fclose(f);
+	snprintf(buf, sizeof(buf), "%s.%s", base, ext);
+	buf[sizeof(buf) - 1] = '\0';
+	if (! (out = fopen(buf, mode))) {
+		fprintf(stderr, "Cannot open file %s in mode %s\n", buf, mode);
+		return NULL;
 	}
+	return out;
 }