X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fkaps%2Fkaps.c;h=5599a6dd76a93fc1c2e4f8f43a3aa7d6b00ffb1c;hb=2ebb071337047f3afd245a5ca0e27ae7d069aa89;hp=63914d11d1fb1aa330e4e625f64d368337e84d70;hpb=2f6a3ddc84e1023452e7b1301c321567fd3e7407;p=libfirm

diff --git a/ir/kaps/kaps.c b/ir/kaps/kaps.c
index 63914d11d..5599a6dd7 100644
--- a/ir/kaps/kaps.c
+++ b/ir/kaps/kaps.c
@@ -22,7 +22,6 @@
  * @brief   Partitioned Boolean Quadratic Problem (PBQP) solver.
  * @date    02.10.2008
  * @author  Sebastian Buchwald
- * @version $Id$
  */
 #include "config.h"
 
@@ -44,8 +43,8 @@ pbqp_node_t *get_node(pbqp_t *pbqp, unsigned index)
 
 pbqp_edge_t *get_edge(pbqp_t *pbqp, unsigned src_index, unsigned tgt_index)
 {
-	int i;
-	int len;
+	size_t i;
+	size_t len;
 	pbqp_node_t *src_node;
 	pbqp_node_t *tgt_node;
 
@@ -79,7 +78,7 @@ pbqp_t *alloc_pbqp(unsigned number_nodes)
 
 	pbqp->solution = 0;
 	pbqp->num_nodes = number_nodes;
-#if	KAPS_DUMP
+#if KAPS_DUMP
 	pbqp->dump_file = NULL;
 #endif
 	pbqp->nodes = OALLOCNZ(&pbqp->obstack, pbqp_node_t*, number_nodes);
@@ -144,7 +143,7 @@ num get_solution(pbqp_t *pbqp)
 	return pbqp->solution;
 }
 
-#if	KAPS_DUMP
+#if KAPS_DUMP
 void set_dumpfile(pbqp *pbqp, FILE *f)
 {
 	pbqp->dump_file = f;