Added test case for pbqp construction: There seems to be missing skip patterns, so...

[libfirm] / ir / be / bedomfront.c

diff --git a/ir/be/bedomfront.c b/ir/be/bedomfront.c
index c4c3d42..79aad6e 100644 (file)
--- a/ir/be/bedomfront.c
+++ b/ir/be/bedomfront.c
@@ -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.
  *
@@ -140,6 +140,7 @@ ir_node **be_get_dominance_frontier(const be_dom_front_info_t *info,
        return pmap_get(info->df_map, block);
 }
 
+#if 0
 /**
  * Calculates the iterated dominance frontier of a set of blocks.
  * Also clears the link field of the returned blocks as a side effect
@@ -155,7 +156,7 @@ void be_get_iterated_dominance_frontiers(const be_dom_front_info_t *domfronts,
                waitq_put(worklist, block);
        }
 
-       while(! pdeq_empty(worklist)) {
+       while(! waitq_empty(worklist)) {
                int     i;
                ir_node *block       = waitq_get(worklist);
                ir_node **domfront   = be_get_dominance_frontier(domfronts, block);
@@ -163,12 +164,11 @@ void be_get_iterated_dominance_frontiers(const be_dom_front_info_t *domfronts,
 
                for (i = 0; i < domfront_len; ++i) {
                        ir_node *y = domfront[i];
-                       if(!ir_nodeset_insert(blocks, y))
-                               continue;
-
-                       waitq_put(worklist, y);
+                       if (ir_nodeset_insert(blocks, y))
+                               waitq_put(worklist, y);
                }
        }
 
        del_waitq(worklist);
 }
+#endif