X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.h;h=b5e393f55419093590a2a4af5cd282cd526e6d6f;hb=246d0a3ac5d4cef9de6532ffa027b6a53e1e09ac;hp=d25f2e4f9c797e8cae244e1a4a7faf7a30e6ab87;hpb=d1de7107f847963fbce099597e6c42c2371b053c;p=libfirm

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index d25f2e4f9..b5e393f55 100644
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -26,8 +26,6 @@
 #ifndef FIRM_BE_BEUTIL_H
 #define FIRM_BE_BEUTIL_H
 
-#include "firm_config.h"
-
 #include <stdio.h>
 
 #include "firm_types.h"
@@ -35,6 +33,22 @@
 
 #include "bearch_t.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)))
 
@@ -54,7 +68,12 @@ 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 const ir_node *get_block_const(const ir_node *irn)
 {
 	return is_Block(irn) ? irn : get_nodes_block(irn);
 }
@@ -92,13 +111,9 @@ 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);
 
 /**
@@ -130,19 +145,6 @@ 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.
- */
-void be_kill_node(ir_node *irn);
-
-/**
- * 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.
- */
-ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive);
-
 /**
  * Gets the Proj with number pn from irn.
  */