X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbedomfront.c;h=fec39d830a48a4809fb0100d694885c15b15d43d;hb=2799d7aec7b0f52d8f10ad5c7a88e31d4dbc8b1b;hp=0397d2af3614cd4df6a5df0f7b8508403415726a;hpb=ef989753ccf68e0e26accc92ea9674b5852f8c21;p=libfirm

diff --git a/ir/be/bedomfront.c b/ir/be/bedomfront.c
index 0397d2af3..fec39d830 100644
--- a/ir/be/bedomfront.c
+++ b/ir/be/bedomfront.c
@@ -1,16 +1,30 @@
+/*
+ * 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.
+ */
+
 /**
  * @file
+ * @brief       Algorithms for computing normal and iterated dominance frontiers.
  * @author      Sebastian Hack, Daniel Grund
- * @date:       04.05.2005
+ * @date        04.05.2005
  * @version     $Id$
- * Copyright:   (c) Universitaet Karlsruhe
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
  */
-#ifdef HAVE_CONFIG_H
-#include <config.h>
-#endif
-
-#include "bedomfront.h"
+#include "config.h"
 
 #include "obst.h"
 #include "pmap.h"
@@ -19,6 +33,9 @@
 #include "array.h"
 #include "irgraph.h"
 #include "iredges_t.h"
+#include "irnodeset.h"
+
+#include "bedomfront.h"
 
 /**
  * The dominance frontier for a graph.
@@ -36,7 +53,7 @@ struct _be_dom_front_info_t {
  * @param bl The block.
  * @return The immediate dominator of the block.
  */
-static INLINE
+static inline
 ir_node *get_idom(ir_node *bl)
 {
 	ir_node *idom = get_Block_idom(bl);
@@ -96,7 +113,7 @@ ir_node **compute_df(ir_node *blk, be_dom_front_info_t *info)
 
 be_dom_front_info_t *be_compute_dominance_frontiers(ir_graph *irg)
 {
-	be_dom_front_info_t *info = xmalloc(sizeof(*info));
+	be_dom_front_info_t *info = XMALLOC(be_dom_front_info_t);
 
 	edges_assure(irg);
 	obstack_init(&info->obst);
@@ -121,6 +138,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
@@ -136,20 +154,19 @@ void be_get_iterated_dominance_frontiers(const be_dom_front_info_t *domfronts,
 		waitq_put(worklist, block);
 	}
 
-	while(!pdeq_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);
+	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))
-				continue;
-
-			waitq_put(worklist, y);
+			if (ir_nodeset_insert(blocks, y))
+				waitq_put(worklist, y);
 		}
 	}
 
 	del_waitq(worklist);
 }
+#endif