X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.h;h=122e217fc0238dcf9d40fad23c4dd01ccfdfffa6;hb=e6ad8ee4680a88db8652483c2c6f3124f3d9a888;hp=8df13b838c79613c4672acfa864f83f38691e64e;hpb=3c255183287cde25567f714737019fa7266c5708;p=libfirm

diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index 8df13b838..122e217fc 100644
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -6,9 +6,17 @@
 
 #include <stdio.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);
+
+
 /** Undefine this to disable debugging mode. */
 #define BE_DEBUG 1
 
@@ -94,3 +102,10 @@ static INLINE FILE *ffopen(const char *base, const char *ext, const char *mode)
 void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix);
 
 #endif
+
+/**
+ * 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);