X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fkaps%2Fheuristical_co.c;h=06e7e7c0e18e7ab5906c63213cf6c78bd6fcce1e;hb=7ad86c1baab2fdceae2aa610bb584b30538cc5c6;hp=bbd961b6ef293a1cfe05a462b0efde4feb3ba3a3;hpb=171a98cff2d5ae80ee5a4f4cf71ba2a0e75e611e;p=libfirm

diff --git a/ir/kaps/heuristical_co.c b/ir/kaps/heuristical_co.c
index bbd961b6e..06e7e7c0e 100644
--- a/ir/kaps/heuristical_co.c
+++ b/ir/kaps/heuristical_co.c
@@ -22,7 +22,6 @@
  * @brief   Heuristic PBQP solver for SSA-based register allocation.
  * @date    18.09.2009
  * @author  Thomas Bersch
- * @version $Id$
  */
 #include "config.h"
 
@@ -33,7 +32,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"
@@ -82,18 +81,18 @@ static void apply_RN_co(pbqp_t *pbqp)
 	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);