From 73d95329a72d4a4e061a6f05fd28200566f26c03 Mon Sep 17 00:00:00 2001
From: Matthias Braun <matze@braunis.de>
Date: Fri, 6 Nov 2009 12:58:10 +0000
Subject: [PATCH] small cleanup

[r26722]
---
 ir/be/bedomfront.c | 41 +++--------------------------------------
 ir/be/bedomfront.h |  4 ++--
 2 files changed, 5 insertions(+), 40 deletions(-)

diff --git a/ir/be/bedomfront.c b/ir/be/bedomfront.c
index fec39d830..d5a3abea7 100644
--- a/ir/be/bedomfront.c
+++ b/ir/be/bedomfront.c
@@ -19,7 +19,7 @@
 
 /**
  * @file
- * @brief       Algorithms for computing normal and iterated dominance frontiers.
+ * @brief       Algorithms for computing dominance frontiers.
  * @author      Sebastian Hack, Daniel Grund
  * @date        04.05.2005
  * @version     $Id$
@@ -53,8 +53,7 @@ struct _be_dom_front_info_t {
  * @param bl The block.
  * @return The immediate dominator of the block.
  */
-static inline
-ir_node *get_idom(ir_node *bl)
+static inline ir_node *get_idom(ir_node *bl)
 {
 	ir_node *idom = get_Block_idom(bl);
 	return idom == NULL ? bl : idom;
@@ -67,8 +66,7 @@ ir_node *get_idom(ir_node *bl)
  *
  * @return the list of all blocks in the dominance frontier of blk
  */
-static
-ir_node **compute_df(ir_node *blk, be_dom_front_info_t *info)
+static ir_node **compute_df(ir_node *blk, be_dom_front_info_t *info)
 {
 	ir_node *c;
 	const ir_edge_t *edge;
@@ -137,36 +135,3 @@ 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
- */
-void be_get_iterated_dominance_frontiers(const be_dom_front_info_t *domfronts,
-                                         ir_nodeset_t *blocks)
-{
-	ir_node *block;
-	ir_nodeset_iterator_t iter;
-	waitq *worklist = new_waitq();
-
-	foreach_ir_nodeset(blocks, block, iter) {
-		waitq_put(worklist, block);
-	}
-
-	while(! waitq_empty(worklist)) {
-		int     i;
-		ir_node *block       = waitq_get(worklist);
-		ir_node **domfront   = be_get_dominance_frontier(domfronts, block);
-		int     domfront_len = ARR_LEN(domfront);
-
-		for (i = 0; i < domfront_len; ++i) {
-			ir_node *y = domfront[i];
-			if (ir_nodeset_insert(blocks, y))
-				waitq_put(worklist, y);
-		}
-	}
-
-	del_waitq(worklist);
-}
-#endif
diff --git a/ir/be/bedomfront.h b/ir/be/bedomfront.h
index be8dadc93..9a1385850 100644
--- a/ir/be/bedomfront.h
+++ b/ir/be/bedomfront.h
@@ -19,7 +19,7 @@
 
 /**
  * @file
- * @brief       Algorithms for computing normal and iterated dominance frontiers
+ * @brief       Algorithms for computing dominance frontiers
  * @author      Sebastian Hack, Daniel Grund
  * @date:       04.05.2005
  * @version     $Id$
@@ -51,4 +51,4 @@ void be_free_dominance_frontiers(be_dom_front_info_t *info);
  */
 ir_node **be_get_dominance_frontier(const be_dom_front_info_t *info, ir_node *block);
 
-#endif /* FIRM_BE_BEDOMFRONT_H */
+#endif
-- 
2.20.1