- Bigger refactoring and cleanup in backend:

[libfirm] / ir / be / beutil.h

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index 5f17a78..72a81fa 100644 (file)
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -1,15 +1,54 @@
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
 
-#ifndef _BEUTIL_H
-#define _BEUTIL_H
-
-#include "firm_config.h"
+/**
+ * @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 "irnode.h"
+
 #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)))
 
@@ -19,9 +58,6 @@
  */
 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.
@@ -29,14 +65,14 @@ pset *be_empty_set(void);
  * @return The block of the node, or the node itself, if the node is a
  *         block.
  */
-static INLINE const ir_node *get_block(const ir_node *irn)
+static inline ir_node *get_block(ir_node *irn)
 {
        return is_Block(irn) ? irn : get_nodes_block(irn);
 }
 
-static INLINE int is_firm_be_mode(const ir_mode *mode)
+static inline const ir_node *get_block_const(const ir_node *irn)
 {
-       return mode_is_data(mode);
+       return is_Block(irn) ? irn : get_nodes_block(irn);
 }
 
 /**
@@ -47,18 +83,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;
        }
 
@@ -67,28 +103,11 @@ 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.
+ * Clears the link fields of all nodes of the given graph.
+ * @param irg The graph.
  */
-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;
-       }
-       return out;
-}
-
 /**
  * Dump a graph with schedule edges.
  * @param irg The graph.
@@ -119,21 +138,20 @@ 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);
 
 /**
- * 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.
+ * 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 *dom_up_search(pset *accept, ir_node *start_point_exclusive);
+ir_node **be_get_cfgpostorder(ir_graph *irg);
 
 /**
- * Gets the Proj with number pn from irn.
+ * Opens a file named base.ext with the mode mode.
  */
-ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn);
+FILE *be_ffopen(const char *base, const char *ext, const char *mode);
 
-#endif /* _BEUTIL_H */
+#endif /* FIRM_BE_BEUTIL_H */