fix cmp_ASM_attr

[libfirm] / ir / kaps / brute_force.c

diff --git a/ir/kaps/brute_force.c b/ir/kaps/brute_force.c
index 94111ce..a819107 100644 (file)
--- a/ir/kaps/brute_force.c
+++ b/ir/kaps/brute_force.c
@@ -32,7 +32,7 @@
 #include "bucket.h"
 #include "brute_force.h"
 #include "optimal.h"
-#if    KAPS_DUMP
+#if KAPS_DUMP
 #include "html_dumper.h"
 #endif
 #include "kaps.h"
@@ -77,7 +77,6 @@ static unsigned get_minimal_alternative(pbqp_t *pbqp, pbqp_node_t *node)
        unsigned  bucket_index;
 
        assert(pbqp);
-       assert(node);
        node_vec     = node->costs;
        node_len     = node_vec->len;
        bucket_index = node->bucket_index;
@@ -151,10 +150,9 @@ static void apply_Brute_Force(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, "BF-Reduction of Node n%d", node->index);
@@ -170,7 +168,7 @@ static void apply_Brute_Force(pbqp_t *pbqp)
        min_index = get_minimal_alternative(pbqp, node);
        node = pbqp->nodes[node->index];
 
-#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);
@@ -202,7 +200,6 @@ static void back_propagate_RI(pbqp_t *pbqp, pbqp_node_t *node)
        int            is_src;
 
        assert(pbqp);
-       assert(node);
 
        edge = node->edges[0];
        mat = edge->costs;
@@ -211,7 +208,6 @@ static void back_propagate_RI(pbqp_t *pbqp, pbqp_node_t *node)
 
        if (is_src) {
                other = edge->tgt;
-               assert(other);
 
                /* Update pointer for brute force solver. */
                other = pbqp->nodes[other->index];
@@ -219,7 +215,6 @@ static void back_propagate_RI(pbqp_t *pbqp, pbqp_node_t *node)
                node->solution = pbqp_matrix_get_col_min_index(mat, other->solution, vec);
        } else {
                other = edge->src;
-               assert(other);
 
                /* Update pointer for brute force solver. */
                other = pbqp->nodes[other->index];
@@ -227,7 +222,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);
        }
@@ -308,7 +303,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);
        }
@@ -324,7 +319,7 @@ static void back_propagate_brute_force(pbqp_t *pbqp)
 
        assert(pbqp);
 
-#if    KAPS_DUMP
+#if KAPS_DUMP
        if (pbqp->dump_file) {
                dump_section(pbqp->dump_file, 2, "Back Propagation");
        }