be: Simplify places, which still assumed, that Projs are scheduled.

[libfirm] / ir / kaps / brute_force.c

diff --git a/ir/kaps/brute_force.c b/ir/kaps/brute_force.c
index a819107..ca8f975 100644 (file)
--- a/ir/kaps/brute_force.c
+++ b/ir/kaps/brute_force.c
@@ -22,7 +22,6 @@
  * @brief   Brute force PBQP solver.
  * @date    02.12.2008
  * @author  Sebastian Buchwald
- * @version $Id$
  */
 #include "config.h"
 
@@ -156,7 +155,7 @@ static void apply_Brute_Force(pbqp_t *pbqp)
        if (pbqp->dump_file) {
                char     txt[100];
                sprintf(txt, "BF-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
@@ -321,7 +320,7 @@ static void back_propagate_brute_force(pbqp_t *pbqp)
 
 #if KAPS_DUMP
        if (pbqp->dump_file) {
-               dump_section(pbqp->dump_file, 2, "Back Propagation");
+               pbqp_dump_section(pbqp->dump_file, 2, "Back Propagation");
        }
 #endif
 
@@ -337,7 +336,6 @@ static void back_propagate_brute_force(pbqp_t *pbqp)
                                break;
                        default:
                                panic("Only nodes with degree one or two should be in this bucket");
-                               break;
                }
        }
 }