X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.h;h=0404d18b81dcb5f59fc14d346e0fe58956ccbce2;hb=ef2e65d91192a4a0d4ca22e1bda6c42edf5b4b3d;hp=5fbd6e38777331f55935b741d1bc5887124f3a79;hpb=1ce363f80e6a204d4011f85813362d9bd1d0e7e4;p=libfirm

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index 5fbd6e387..0404d18b8 100644
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -26,27 +26,16 @@
 #ifndef FIRM_BE_BEUTIL_H
 #define FIRM_BE_BEUTIL_H
 
-#include "firm_config.h"
-
 #include <stdio.h>
 
 #include "firm_types.h"
 #include "pset.h"
 
-#include "bearch_t.h"
+#include "bearch.h"
 
 /* iterate over a list of ir_nodes linked by link field */
 #define foreach_linked_irns(head, iter) for ((iter) = (head); (iter); (iter) = get_irn_link((iter)))
 
-/**
- * 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
-
 /**
  * Convenient block getter.
  * Works also, if the given node is a block.
@@ -54,21 +43,16 @@ pset *be_empty_set(void);
  * @return The block of the node, or the node itself, if the node is a
  *         block.
  */
-static INLINE ir_node *get_block(ir_node *irn)
+static inline ir_node *get_block(ir_node *irn)
 {
 	return is_Block(irn) ? irn : get_nodes_block(irn);
 }
 
-static INLINE const ir_node *get_block_const(const ir_node *irn)
+static inline const ir_node *get_block_const(const ir_node *irn)
 {
 	return is_Block(irn) ? irn : get_nodes_block(irn);
 }
 
-static INLINE int is_firm_be_mode(const ir_mode *mode)
-{
-	return mode_is_data(mode);
-}
-
 /**
  * Check, if a node produces or consumes a data value.
  * If it does, it is significant for scheduling and register allocation.
@@ -77,18 +61,18 @@ static INLINE int is_firm_be_mode(const ir_mode *mode)
  * @param irn The node to check for.
  * @return 1, if the node is a data node, 0 if not.
  */
-static INLINE int is_data_node(const ir_node *irn)
+static inline int is_data_node(const ir_node *irn)
 {
 	int i, n;
 
 	/* If the node produces a data value, return immediately. */
-	if (is_firm_be_mode(get_irn_mode(irn)))
+	if (mode_is_data(get_irn_mode(irn)))
 		return 1;
 
 	/* else check, if it takes a data value, if that is so, return */
 	for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
 		ir_node *op = get_irn_n(irn, i);
-		if (is_firm_be_mode(get_irn_mode(op)))
+		if (mode_is_data(get_irn_mode(op)))
 			return 1;
 	}
 
@@ -97,36 +81,10 @@ static INLINE int is_data_node(const ir_node *irn)
 }
 
 /**
- * Dump a vcg graph containing the controlflow graph, the schedule and
- * allocated registers.
- * @param irg The irg. Note that scheduling, register allocation must
- * have been performed.
- */
-void dump_allocated_irg(arch_env_t *env, ir_graph *irg, char *suffix);
-
-void be_clear_links(ir_graph *irg);
-
-/**
- * Dump a graph with schedule edges.
+ * Clears the link fields of all nodes of the given graph.
  * @param irg The graph.
- * @param suffix A suffix to its file name.
  */
-void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix);
-
-/**
- * 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 *));
+void be_clear_links(ir_graph *irg);
 
 /**
  * Returns the number of reachable nodes in an irg.
@@ -136,19 +94,21 @@ void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const
 unsigned get_num_reachable_nodes(ir_graph *irg);
 
 /**
- * Sets all node inputs to BAD node.
- * @param irn  The node to be killed.
+ * Gets the Proj with number pn from irn.
  */
-void be_kill_node(ir_node *irn);
+ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn);
 
 /**
- * Gets the Proj with number pn from irn.
+ * Returns an array (an ARR_F) of the programs blocks in reverse postorder
+ * (note: caller has to free the memory with DEL_ARR_F after use;
+ *  of course you can use ARR_LEN on the array too.)
  */
-ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn);
+ir_node **be_get_cfgpostorder(ir_graph *irg);
 
 /**
- * Opens a file named base.ext with the mode mode.
+ * convenience function to return the first successor block
+ * (it is often known that there is exactly 1 successor anyway)
  */
-FILE *be_ffopen(const char *base, const char *ext, const char *mode);
+ir_node *get_first_block_succ(const ir_node *block);
 
-#endif /* FIRM_BE_BEUTIL_H */
+#endif