X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fkaps%2Fheuristical_co_ld.c;h=fe7db8cee33ae1e5ce5cd2c3268a990b51fd1207;hb=2ee064e0f2a03bbdbdb51839cfd852b9fc6f1079;hp=ff848cb819278b9c31e8d4c2a2b0f54ce7f1dcfa;hpb=171a98cff2d5ae80ee5a4f4cf71ba2a0e75e611e;p=libfirm

diff --git a/ir/kaps/heuristical_co_ld.c b/ir/kaps/heuristical_co_ld.c
index ff848cb81..fe7db8cee 100644
--- a/ir/kaps/heuristical_co_ld.c
+++ b/ir/kaps/heuristical_co_ld.c
@@ -14,7 +14,7 @@
 #include "bucket.h"
 #include "heuristical_co_ld.h"
 #include "optimal.h"
-#if	KAPS_DUMP
+#if KAPS_DUMP
 #include "html_dumper.h"
 #endif
 #include "kaps.h"
@@ -36,6 +36,8 @@ static void back_propagate_RI(pbqp_t *pbqp, pbqp_node_t *node)
 	vector_t      *vec;
 	int            is_src;
 
+	(void) pbqp;
+
 	edge = node->edges[0];
 	mat = edge->costs;
 	is_src = edge->src == node;
@@ -49,7 +51,7 @@ static void back_propagate_RI(pbqp_t *pbqp, pbqp_node_t *node)
 		node->solution = pbqp_matrix_get_row_min_index(mat, other->solution, vec);
 	}
 
-#if	KAPS_DUMP
+#if KAPS_DUMP
 	if (pbqp->dump_file) {
 		fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
 	}
@@ -126,7 +128,7 @@ static void back_propagate_RII(pbqp_t *pbqp, pbqp_node_t *node)
 
 	node->solution = vector_get_min_index(vec);
 
-#if	KAPS_DUMP
+#if KAPS_DUMP
 	if (pbqp->dump_file) {
 		fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
 	}
@@ -162,7 +164,7 @@ static void back_propagate_RN(pbqp_t *pbqp, pbqp_node_t *node)
 	assert(vector_get_min(vec) != INF_COSTS);
 	node->solution = vector_get_min_index(vec);
 
-#if	KAPS_DUMP
+#if KAPS_DUMP
 	if (pbqp->dump_file) {
 		fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
 	}
@@ -178,9 +180,9 @@ static void back_propagate_ld(pbqp_t *pbqp)
 
 	assert(pbqp);
 
-#if	KAPS_DUMP
+#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
 
@@ -235,11 +237,11 @@ static void apply_RN_co_without_selection(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