arch_register_class_put() is only used locally

[libfirm] / ir / be / bedomfront.c

diff --git a/ir/be/bedomfront.c b/ir/be/bedomfront.c
index 0397d2a..79aad6e 100644 (file)
--- 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>
+#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.
@@ -121,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
@@ -136,20 +156,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