X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fkaps%2Fbrute_force.c;h=ca8f9758297dd9f4f0dd5eb22e2dddcd9e5a9cf0;hb=0a8dac2b5fb9e59ea2add322baf61237b607bea5;hp=32a148898d7bf42f04672ee224a662c8e0dc746a;hpb=8ccfe04ca59ff56fc32b2323b80cee2a5194694d;p=libfirm

diff --git a/ir/kaps/brute_force.c b/ir/kaps/brute_force.c
index 32a148898..ca8f97582 100644
--- 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