X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbedomfront.c;h=65886a95a3682cc76e6c3929a301d16b7871374f;hb=ccdf802c598f7adc5e35fff42fed029c59f48a57;hp=c2f3703fa622741bb36a8cea1811203d602c343f;hpb=2adf84106c02caf097c2d6cf1764706bdc437bcc;p=libfirm

diff --git a/ir/be/bedomfront.c b/ir/be/bedomfront.c
index c2f3703fa..65886a95a 100644
--- a/ir/be/bedomfront.c
+++ b/ir/be/bedomfront.c
@@ -1,17 +1,33 @@
+/*
+ * 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 "obst.h"
 #include "pmap.h"
 #include "pdeq.h"
@@ -19,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.
@@ -136,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(! 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];