X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbedomfront.c;h=c4c3d42ac7e3f4a7bb804ee1b27037b75f7ddb21;hb=9276447aec4972df060349e162f583c4898dfec8;hp=c5fbf601fc01a8bc04e2cdf896813e9421cb5aa8;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm

diff --git a/ir/be/bedomfront.c b/ir/be/bedomfront.c
index c5fbf601f..c4c3d42ac 100644
--- a/ir/be/bedomfront.c
+++ b/ir/be/bedomfront.c
@@ -19,18 +19,15 @@
 
 /**
  * @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 "obst.h"
 #include "pmap.h"
 #include "pdeq.h"
@@ -38,6 +35,9 @@
 #include "array.h"
 #include "irgraph.h"
 #include "iredges_t.h"
+#include "irnodeset.h"
+
+#include "bedomfront.h"
 
 /**
  * The dominance frontier for a graph.
@@ -155,11 +155,11 @@ 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(! 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);
 
 		for (i = 0; i < domfront_len; ++i) {
 			ir_node *y = domfront[i];