bescripts: Copy all common node attributes into the constructor variants.

[libfirm] / ir / be / beutil.h

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index e33d9bb..5a0c4f0 100644 (file)
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -21,20 +21,11 @@
  * @file
  * @brief       Contains some useful function for the backend.
  * @author      Sebastian Hack
- * @version     $Id$
  */
 #ifndef FIRM_BE_BEUTIL_H
 #define FIRM_BE_BEUTIL_H
 
-#include <stdio.h>
-
 #include "firm_types.h"
-#include "pset.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)))
 
 /**
  * Convenient block getter.
@@ -53,68 +44,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.
  */
@@ -127,11 +62,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)