X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.c;h=ee4506ce8a926851c4f5c5d7a218506959d215d5;hb=96529e627cc751d0865eebfff6441338e1af6cce;hp=1d209b3247d80a42ee0184390a95995bb8264a47;hpb=8786fa72e7744afaaecdab0d002fc821539b79b9;p=libfirm

diff --git a/ir/be/beutil.c b/ir/be/beutil.c
index 1d209b324..ee4506ce8 100644
--- a/ir/be/beutil.c
+++ b/ir/be/beutil.c
@@ -1,3 +1,28 @@
+/*
+ * 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.
+ *
+ * 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$
+ */
 #ifdef HAVE_CONFIG_H
 #include "config.h"
 #endif
@@ -13,25 +38,29 @@
 #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 "bearch.h"
+#include "bearch_t.h"
 
+/* Get an always empty set. */
 pset *be_empty_set(void)
 {
 	static pset *empty_set = NULL;
 
 	if(!empty_set)
-		empty_set = pset_new_ptr_default();
+		empty_set = pset_new_ptr(1);
 
+	assert(pset_count(empty_set) == 0);
 	return empty_set;
 }
 
 struct dump_env {
-  FILE *f;
-  arch_env_t *env;
+  	FILE *f;
+	arch_env_t *env;
 };
 
 static void dump_allocated_block(ir_node *block, void *data)
@@ -80,9 +109,9 @@ static void dump_allocated_block(ir_node *block, void *data)
 void dump_allocated_irg(arch_env_t *arch_env, ir_graph *irg, char *suffix)
 {
 	char buf[1024];
-  struct dump_env env;
+	struct dump_env env;
 
-  env.env = arch_env;
+	env.env = arch_env;
 
 	ir_snprintf(buf, sizeof(buf), "%F-alloc%s.vcg", irg, suffix);
 
@@ -94,67 +123,63 @@ void dump_allocated_irg(arch_env_t *arch_env, ir_graph *irg, char *suffix)
 	}
 }
 
-static void localize_const_walker(ir_node *irn, void *data)
+/**
+ * Edge hook to dump the schedule edges.
+ */
+static int sched_edge_hook(FILE *F, ir_node *irn)
 {
-	if(!is_Block(irn)) {
-		int i, n;
-
-		for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
-			ir_node *op = get_irn_n(irn, i);
-			if(get_irn_opcode(op) == iro_Const) {
-				ir_node *tgt_block, *cnst;
-
-				/* Special treatment for phi nodes, because phi-usage is different */
-				tgt_block = get_nodes_block(irn);
-				if(is_Phi(irn))
-					tgt_block = get_nodes_block(get_irn_n(tgt_block, i));
-
-				/*
-				 * We have to create the const node by ourselves, since the
-				 * firmcons implementation always places it in the start block.
-				 */
-				cnst = new_ir_node(NULL, get_irn_irg(irn),
-						tgt_block, op_Const, get_irn_mode(op), 0, NULL);
-				cnst->attr.con.tv = get_Const_tarval(op);
-				set_irn_n(irn, i, cnst);
-			}
-		}
+	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");
 	}
+	return 1;
 }
 
-void localize_consts(ir_graph *irg)
-{
-	irg_walk_graph(irg, localize_const_walker, NULL, NULL);
-	dead_node_elimination(irg);
-}
+void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) {
+	DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
 
-static int sched_edge_hook(FILE *F, ir_node *irn)
-{
-    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");
-    }
-    return 1;
+	dump_consts_local(0);
+	set_dump_node_edge_hook(sched_edge_hook);
+	dump_ir_block_graph(irg, suffix);
+	set_dump_node_edge_hook(old);
 }
 
-void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) {
-    DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
+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);
-    set_dump_node_edge_hook(sched_edge_hook);
-    dump_ir_block_graph(irg, suffix);
-    set_dump_node_edge_hook(old);
+	dump_consts_local(0);
+	set_dump_node_edge_hook(sched_edge_hook);
+	dump_ir_extblock_graph(irg, suffix);
+	set_dump_node_edge_hook(old);
 }
 
-static void clear_link(ir_node *irn, void *data)
-{
-  set_irn_link(irn, NULL);
+/**
+ * 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 (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);
 }
 
+
+
 static void collect_phis(ir_node *irn, void *data)
 {
   if(is_Phi(irn)) {
@@ -166,7 +191,7 @@ static void collect_phis(ir_node *irn, void *data)
 
 void be_clear_links(ir_graph *irg)
 {
-	irg_walk_graph(irg, clear_link, NULL, NULL);
+	irg_walk_graph(irg, firm_clear_link, NULL, NULL);
 }
 
 void be_collect_phis(ir_graph *irg)
@@ -174,7 +199,40 @@ void be_collect_phis(ir_graph *irg)
 	irg_walk_graph(irg, collect_phis, NULL, NULL);
 }
 
+static void count_num_reachable_nodes(ir_node *irn, void *env) {
+	int *num = env;
+	(*num)++;
+}
+
+unsigned get_num_reachable_nodes(ir_graph *irg) {
+	int num = 0;
+	irg_walk_graph(irg, count_num_reachable_nodes, NULL, &num);
+	return num;
+}
+
+/**
+ * Sets all node inputs to BAD node.
+ */
+void be_kill_node(ir_node *irn) {
+	ir_graph *irg = get_irn_irg(irn);
+
+	assert(!is_Bad(irn));
 
+#ifdef DEBUG_libfirm
+	{
+	int i, first;
+	first = 0 - ! is_Block(irn);
+
+	for (i = get_irn_arity(irn) - 1; i >= first; --i) {
+		set_irn_n(irn, i, get_irg_bad(irg));
+	}
+	}
+#endif
+
+	edges_node_deleted(irn, irg);
+}
+
+/* FIXME: not used. can be deleted? */
 ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
 	ir_node *irn, *idom;
 
@@ -183,6 +241,9 @@ ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
 		if (pset_find_ptr(accept, irn))
 			return irn;
 
+	/* FIXME: This is obviously buggy: after the first recursive call idom is a block
+	   and get_nodes_block will fail.
+		 Moreover, why not a simple iteration instead of recursion */
 	idom = get_Block_idom(get_nodes_block(start_point_exclusive));
 
 	if (idom)
@@ -190,3 +251,34 @@ ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
 	else
 		return NULL; /* this was the start block and we did not find an acceptable irn */
 }
+
+/**
+ * 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 (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];
+
+	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;
+}