sparc: no need for is_load_store attribute anymore

[libfirm] / ir / be / beutil.h

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index f40820f..0404d18 100644 (file)
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -33,34 +33,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);
-
-/** Undefine this to disable debugging mode. */
-#define BE_DEBUG 1
-
 /**
  * Convenient block getter.
  * Works also, if the given node is a block.
@@ -78,11 +53,6 @@ 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.
@@ -96,13 +66,13 @@ 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;
        }
 
@@ -116,28 +86,6 @@ static inline int is_data_node(const ir_node *irn)
  */
 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.
@@ -158,8 +106,9 @@ 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