X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.h;h=8dbb7a5805b6df8c873591972512cd3cd7dd6c9e;hb=bd019d8cd785c1a433c19dee44bf3f9e82397286;hp=6e676de0d56b0267e79891b93e4b6b61666d1a75;hpb=2342f687edb76b232eba1b0499e1efcb25fd3bff;p=libfirm

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index 6e676de0d..8dbb7a580 100644
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -1,24 +1,39 @@
+/*
+ * 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
+ */
+#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"
-
-/**
- * Get an empty set.
- * This function always returns the same set.
- */
-pset *be_empty_set(void);
 
+#include "bearch.h"
 
-/** Undefine this to disable debugging mode. */
-#define BE_DEBUG 1
+/* 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.
@@ -27,100 +42,38 @@ 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)
-{
-	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.
- * 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)
+static inline const ir_node *get_block_const(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)))
-		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)))
-			return 1;
-	}
-
-	/* Else the node does not produce/consume a data value */
-	return 0;
-}
-
-/**
- * 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);
-
-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;
+	return is_Block(irn) ? irn : get_nodes_block(irn);
 }
 
 /**
- * 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);
+void be_clear_links(ir_graph *irg);
 
 /**
- * Dumps a graph and numbers all dumps.
- * @param irg    The graph
- * @param suffix A suffix to its file name.
- * @param dumper The dump function
+ * Gets the Proj with number pn from irn.
  */
-void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const char *));
+ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn);
 
 /**
- * Returns the number of reachable nodes in an irg.
- * @param irg The irg.
- * @return The number of reachable nodes.
+ * 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.)
  */
-unsigned get_num_reachable_nodes(ir_graph *irg);
+ir_node **be_get_cfgpostorder(ir_graph *irg);
 
 /**
- * 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.
+ * convenience function to return the first successor block
+ * (it is often known that there is exactly 1 successor anyway)
  */
-ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive);
+ir_node *get_first_block_succ(const ir_node *block);
 
-#endif /* _BEUTIL_H */
+#endif