Reorder incident nodes of removed edge.

[libfirm] / brute_force.c

diff --git a/brute_force.c b/brute_force.c
index e41f468..a163126 100644 (file)
--- a/brute_force.c
+++ b/brute_force.c
@@ -43,6 +43,10 @@
 #include "pbqp_node_t.h"
 #include "vector.h"
 
+#if KAPS_STATISTIC
+static int dump = 0;
+#endif
+
 /* Forward declarations. */
 static void apply_Brute_Force(pbqp *pbqp);
 
@@ -363,9 +367,15 @@ void solve_pbqp_brute_force(pbqp *pbqp)
 
 #if KAPS_STATISTIC
        fh = fopen("solutions.pb", "a");
-       fprintf(fh, ": %lld RE:%u R0:%u R1:%u R2:%u RN/BF:%u\n", pbqp->solution,
-                       pbqp->num_edges, pbqp->num_r0, pbqp->num_r1, pbqp->num_r2,
-                       pbqp->num_bf);
+       #if KAPS_USE_UNSIGNED
+               fprintf(fh, ": %u RE:%u R0:%u R1:%u R2:%u RM:%u RN/BF:%u\n", pbqp->solution,
+                               pbqp->num_edges, pbqp->num_r0, pbqp->num_r1, pbqp->num_r2,
+                               pbqp->num_rm, pbqp->num_rn);
+       #else
+               fprintf(fh, ": %lld RE:%u R0:%u R1:%u R2:%u RM:%u RN/BF:%u\n", pbqp->solution,
+                               pbqp->num_edges, pbqp->num_r0, pbqp->num_r1, pbqp->num_r2,
+                               pbqp->num_rm, pbqp->num_bf);
+       #endif
        fclose(fh);
 #endif