X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fkaps%2Fheuristical.c;h=18ef165add40994bdabb7b80b61f1acd38161d8f;hb=199ea1a4479a4d8dcbebfde81820286935e64b0c;hp=c078f5d1e10147605fbaec5f55608681eccfb441;hpb=1a3b7d363474ab544c13093a2f0b578718d37c7a;p=libfirm

diff --git a/ir/kaps/heuristical.c b/ir/kaps/heuristical.c
index c078f5d1e..18ef165ad 100644
--- a/ir/kaps/heuristical.c
+++ b/ir/kaps/heuristical.c
@@ -22,7 +22,6 @@
  * @brief   Heuristic PBQP solver.
  * @date    02.10.2008
  * @author  Sebastian Buchwald
- * @version $Id$
  */
 #include "config.h"
 
@@ -33,7 +32,7 @@
 #include "bucket.h"
 #include "heuristical.h"
 #include "optimal.h"
-#if	KAPS_DUMP
+#if KAPS_DUMP
 #include "html_dumper.h"
 #endif
 #include "kaps.h"
@@ -55,21 +54,20 @@ static void apply_RN(pbqp_t *pbqp)
 
 	/* We want to reduce a node with maximum degree. */
 	node = get_node_with_max_degree();
-	assert(node);
 	assert(pbqp_node_get_degree(node) > 2);
 
-#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);