beifg: Remove the unused function be_ifg_nodes_break().

[libfirm] / ir / kaps / heuristical_co.c

diff --git a/ir/kaps/heuristical_co.c b/ir/kaps/heuristical_co.c
index aa30729..c57e459 100644 (file)
--- a/ir/kaps/heuristical_co.c
+++ b/ir/kaps/heuristical_co.c
@@ -1,20 +1,6 @@
 /*
- * 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.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
 /**
@@ -22,7 +8,6 @@
  * @brief   Heuristic PBQP solver for SSA-based register allocation.
  * @date    18.09.2009
  * @author  Thomas Bersch
- * @version $Id$
  */
 #include "config.h"
 
@@ -33,7 +18,7 @@
 #include "bucket.h"
 #include "heuristical_co.h"
 #include "optimal.h"
-#if    KAPS_DUMP
+#if KAPS_DUMP
 #include "html_dumper.h"
 #endif
 #include "kaps.h"
@@ -63,7 +48,6 @@ static void merge_into_RN_node(pbqp_t *pbqp, plist_t *rpeo)
                plist_insert_back(rpeo, node);
        } while(node_is_reduced(node));
 
-       assert(node);
        assert(pbqp_node_get_degree(node) > 2);
 
        /* Check whether we can merge a neighbor into the current node. */
@@ -79,23 +63,22 @@ static void apply_RN_co(pbqp_t *pbqp)
 
        node        = merged_node;
        merged_node = NULL;
-       assert(node);
 
        if (node_is_reduced(node))
                return;
 
-#if    KAPS_DUMP
+#if KAPS_DUMP
        if (pbqp->dump_file) {
                char     txt[100];
                sprintf(txt, "RN-Reduction of Node n%d", node->index);
-               dump_section(pbqp->dump_file, 2, txt);
+               pbqp_dump_section(pbqp->dump_file, 2, txt);
                pbqp_dump_graph(pbqp);
        }
 #endif
 
        min_index = get_local_minimal_alternative(pbqp, node);
 
-#if    KAPS_DUMP
+#if KAPS_DUMP
        if (pbqp->dump_file) {
                fprintf(pbqp->dump_file, "node n%d is set to %d<br><br>\n",
                                        node->index, min_index);