X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.h;h=8dbb7a5805b6df8c873591972512cd3cd7dd6c9e;hb=8e4e49e66d1d578b31a5ffce9bb6ff94ba985dfb;hp=0dcd29bfe676d585bc21d29887e739bca6a19f0b;hpb=7c36344d22a7c306a4e216f135c974bdb9f6b943;p=libfirm

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index 0dcd29bfe..8dbb7a580 100644
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -21,7 +21,6 @@
  * @file
  * @brief       Contains some useful function for the backend.
  * @author      Sebastian Hack
- * @version     $Id$
  */
 #ifndef FIRM_BE_BEUTIL_H
 #define FIRM_BE_BEUTIL_H
@@ -33,31 +32,9 @@
 
 #include "bearch.h"
 
-#ifdef _MSC_VER
-typedef          __int64 long64;
-typedef unsigned __int64 ulong64;
-
-#define LL_FMT	"i64"
-#define ULL_FMT	"ui64"
-
-#else
-typedef          long long long64;
-typedef unsigned long long ulong64;
-
-#define LL_FMT	"ll"
-#define ULL_FMT	"llu"
-
-#endif /* _MSC_VER */
-
 /* 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);
-
 /**
  * Convenient block getter.
  * Works also, if the given node is a block.
@@ -75,68 +52,12 @@ static inline const ir_node *get_block_const(const ir_node *irn)
 	return is_Block(irn) ? irn : get_nodes_block(irn);
 }
 
-/**
- * Check, if a node produces or consumes a data value.
- * If it does, it is significant for scheduling and register allocation.
- * A node produces/consumes a data value, if one of its operands is of
- * mode datab, or his retuning mode is of mode datab.
- * @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)
-{
-	int i, n;
-
-	/* If the node produces a data value, return immediately. */
-	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 (mode_is_data(get_irn_mode(op)))
-			return 1;
-	}
-
-	/* Else the node does not produce/consume a data value */
-	return 0;
-}
-
 /**
  * Clears the link fields of all nodes of the given graph.
  * @param irg The graph.
  */
 void be_clear_links(ir_graph *irg);
 
-/**
- * Dump a graph with schedule edges.
- * @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 *));
-
-/**
- * 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);
-
 /**
  * Gets the Proj with number pn from irn.
  */
@@ -149,11 +70,6 @@ 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.
- */
-FILE *be_ffopen(const char *base, const char *ext, const char *mode);
-
 /**
  * convenience function to return the first successor block
  * (it is often known that there is exactly 1 successor anyway)