X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.c;h=373960339ba2e3674813b51bf0b6f0946de9f7c2;hb=040868cbcb834457c8195efbbccf221123c7f153;hp=7e0e7a3d22bb763be9637dd4c2f5874a05d4f6e0;hpb=4402ff71e8a876aa7ef50de56597b0eb7110583d;p=libfirm

diff --git a/ir/be/beutil.c b/ir/be/beutil.c
index 7e0e7a3d2..373960339 100644
--- a/ir/be/beutil.c
+++ b/ir/be/beutil.c
@@ -1,7 +1,27 @@
+/*
+ * 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.
+ */
+
 /**
- * Contains some useful function for the backend.
- * @author Sebastian Hack
- * @cvsid  $Id$
+ * @file
+ * @brief       Contains some useful function for the backend.
+ * @author      Sebastian Hack
+ * @version     $Id$
  */
 #ifdef HAVE_CONFIG_H
 #include "config.h"
@@ -20,10 +40,11 @@
 #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)
@@ -38,8 +59,8 @@ pset *be_empty_set(void)
 }
 
 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)
@@ -88,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);
 
@@ -102,46 +123,14 @@ void dump_allocated_irg(arch_env_t *arch_env, ir_graph *irg, char *suffix)
 	}
 }
 
-static void localize_const_walker(ir_node *irn, void *data)
-{
-	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);
-			}
-		}
-	}
-}
-
-void localize_consts(ir_graph *irg)
-{
-	irg_walk_graph(irg, localize_const_walker, NULL, NULL);
-	dead_node_elimination(irg);
-}
-
 /**
  * Edge hook to dump the schedule edges.
  */
 static int sched_edge_hook(FILE *F, ir_node *irn)
 {
-	if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
+	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);
@@ -156,7 +145,8 @@ 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);
-	set_dump_node_edge_hook(sched_edge_hook);
+	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);
 }
@@ -165,7 +155,8 @@ 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);
+	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);
 }
@@ -183,7 +174,7 @@ void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const
 
 	if (irg != last_irg) {
 		last_irg = irg;
-		nr       = 0;
+		nr       = strcmp(suffix, "-abi") ? 0 : 1;
 	}
 
 	snprintf(buf, sizeof(buf), "-%02d%s", nr++, suffix);
@@ -195,16 +186,19 @@ void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const
 
 static void collect_phis(ir_node *irn, void *data)
 {
-  if(is_Phi(irn)) {
-    ir_node *bl = get_nodes_block(irn);
-    set_irn_link(irn, get_irn_link(bl));
-    set_irn_link(bl, irn);
-  }
+	(void) data;
+	if(is_Phi(irn)) {
+		ir_node *bl = get_nodes_block(irn);
+		set_irn_link(irn, get_irn_link(bl));
+		set_irn_link(bl, irn);
+	}
 }
 
 void be_clear_links(ir_graph *irg)
 {
+	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);
 }
 
 void be_collect_phis(ir_graph *irg)
@@ -212,9 +206,11 @@ void be_collect_phis(ir_graph *irg)
 	irg_walk_graph(irg, collect_phis, NULL, NULL);
 }
 
-unsigned count_num_reachable_nodes(ir_node *irn, void *env) {
+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) {
@@ -223,22 +219,33 @@ unsigned get_num_reachable_nodes(ir_graph *irg) {
 	return num;
 }
 
-/* FIXME: not used. can be deleted? */
-ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
-	ir_node *irn, *idom;
+/**
+ * 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");
 
-	/* search the current block */
-	for (irn=sched_prev(start_point_exclusive); irn; irn=sched_prev(irn))
-		if (pset_find_ptr(accept, irn))
-			return irn;
+	foreach_out_edge(irn, edge) {
+		proj = get_edge_src_irn(edge);
 
-	/* 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 (get_Proj_proj(proj) == pn)
+			return proj;
+	}
 
-	if (idom)
-		return dom_up_search(accept, idom); /* continue search in idom-block */
-	else
-		return NULL; /* this was the start block and we did not find an acceptable irn */
+	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;
 }