X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.c;h=6bafeaae132a157975bc332e0ca250b34263081e;hb=82eea1b6b7887bdc834affa49038734e42012395;hp=2b9cc157b1a417cdfd7c92207d685350d129710f;hpb=111503924bac361d3db429f4bdd30532165a1652;p=libfirm

diff --git a/ir/be/beutil.c b/ir/be/beutil.c
index 2b9cc157b..6bafeaae1 100644
--- a/ir/be/beutil.c
+++ b/ir/be/beutil.c
@@ -1,99 +1,99 @@
+/*
+ * 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
+ */
+#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_t.h"
 
 #include "beutil.h"
-#include "besched_t.h"
-#include "bera_t.h"
+#include "besched.h"
+#include "bearch.h"
 
-static void dump_allocated_block(ir_node *block, void *env)
+void be_clear_links(ir_graph *irg)
 {
-	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, ")");
-	}
-	ir_fprintf(f, "\"}\n");
-
-	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);
-		}
-	}
+	irg_walk_graph(irg, firm_clear_link, NULL, NULL);
 }
 
-void dump_allocated_irg(ir_graph *irg, char *suffix)
+/**
+ * Gets the Proj with number pn from irn.
+ */
+ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn)
 {
-	char buf[1024];
-	FILE *f;
+	ir_node *proj;
+	assert(get_irn_mode(irn) == mode_T && "need mode_T");
 
-	snprintf(buf, sizeof(buf), "%s-alloc%s.vcg", get_entity_name(get_irg_entity(irg)), suffix);
+	foreach_out_edge(irn, edge) {
+		proj = get_edge_src_irn(edge);
 
-	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);
+		if (is_Proj(proj) && get_Proj_proj(proj) == pn)
+			return proj;
 	}
+
+	return NULL;
 }
 
-static void localize_const_walker(ir_node *irn, void *data)
+/**
+ * Block-walker: adds the visited block to a flexible array.
+ */
+static void add_to_postorder(ir_node *block, 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);
-			}
-		}
-	}
+	ir_node ***list = (ir_node***) data;
+	ARR_APP1(ir_node*, *list, block);
+}
+
+ir_node **be_get_cfgpostorder(ir_graph *irg)
+{
+	ir_node **list      = NEW_ARR_F(ir_node*, 0);
+	ir_node  *end_block = get_irg_end_block(irg);
+
+	/* end block may be unreachable in case of endless loops */
+	if (get_Block_n_cfgpreds(end_block) == 0)
+		ARR_APP1(ir_node*, list, end_block);
+
+	/* walk blocks */
+	irg_block_edges_walk(get_irg_start_block(irg), NULL, add_to_postorder,
+	                     &list);
+
+	return list;
 }
 
-void localize_consts(ir_graph *irg)
+ir_node *get_first_block_succ(const ir_node *block)
 {
-	irg_walk_graph(irg, localize_const_walker, NULL, NULL);
-	dead_node_elimination(irg);
+	const ir_edge_t *edge = get_irn_out_edge_first_kind(block, EDGE_KIND_BLOCK);
+	assert(edge != NULL);
+	return get_edge_src_irn(edge);
 }