X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.h;h=6e676de0d56b0267e79891b93e4b6b61666d1a75;hb=80a6158fdd766f42ee6c508a773bc114ff1b61f3;hp=ca7e82be6c85f9d3c7046b8958b235bb4bc45baa;hpb=42f34c5541c99888917aa989a9ef229a325b5d10;p=libfirm

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index ca7e82be6..6e676de0d 100644
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -2,13 +2,21 @@
 #ifndef _BEUTIL_H
 #define _BEUTIL_H
 
+#include "firm_config.h"
+
 #include <stdio.h>
 
+#include "pset.h"
 #include "irnode.h"
-#include "config.h"
-
 #include "bearch.h"
 
+/**
+ * Get an empty set.
+ * This function always returns the same set.
+ */
+pset *be_empty_set(void);
+
+
 /** Undefine this to disable debugging mode. */
 #define BE_DEBUG 1
 
@@ -21,7 +29,7 @@
  */
 static INLINE const ir_node *get_block(const ir_node *irn)
 {
-  return is_Block(irn) ? irn : get_nodes_block(irn);
+	return is_Block(irn) ? irn : get_nodes_block(irn);
 }
 
 static INLINE int is_firm_be_mode(const ir_mode *mode)
@@ -56,14 +64,6 @@ static INLINE int is_data_node(const ir_node *irn)
 	return 0;
 }
 
-/**
- * Make each constant local to its use.
- * This duplicates all constants in order to simulate a realistic
- * register pressure.
- * @param irg The graph.
- */
-void localize_consts(ir_graph *irg);
-
 /**
  * Dump a vcg graph containing the controlflow graph, the schedule and
  * allocated registers.
@@ -72,13 +72,14 @@ void localize_consts(ir_graph *irg);
  */
 void dump_allocated_irg(arch_env_t *env, ir_graph *irg, char *suffix);
 
-
+void be_clear_links(ir_graph *irg);
 
 static INLINE FILE *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;
@@ -93,4 +94,33 @@ static INLINE FILE *ffopen(const char *base, const char *ext, const char *mode)
  */
 void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix);
 
-#endif
+/**
+ * Dump a extended block graph with schedule edges.
+ * @param irg The graph.
+ * @param suffix A suffix to its file name.
+ */
+void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix);
+
+/**
+ * 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 *));
+
+/**
+ * Returns the number of reachable nodes in an irg.
+ * @param irg The irg.
+ * @return The number of reachable nodes.
+ */
+unsigned get_num_reachable_nodes(ir_graph *irg);
+
+/**
+ * Search for an irn in @p accept.
+ * The search is started at @p start_point_exclusive and continues upwards the dom-tree
+ * @return The first node out of accept if found. Else NULL is returned.
+ */
+ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive);
+
+#endif /* _BEUTIL_H */