Correct typos, mostly s/there/their/.
[libfirm] / ir / kaps / heuristical_co_ld.c
index ff848cb..fe7db8c 100644 (file)
@@ -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