X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fhungarian.c;h=3793d176212c84b5368232de6ecb932246288501;hb=dcff73b2cc34378750e2cc1979a4b120e19767a9;hp=926f768fac6b852de253c15d8695bd44b528ec05;hpb=e1c05b012f012400bf9f3b807b11fb6eafd3b99b;p=libfirm

diff --git a/ir/adt/hungarian.c b/ir/adt/hungarian.c
index 926f768fa..3793d1762 100644
--- a/ir/adt/hungarian.c
+++ b/ir/adt/hungarian.c
@@ -27,7 +27,6 @@
 /**
  * @file
  * @brief   Solving the Minimum Assignment Problem using the Hungarian Method.
- * @version $Id$
  */
 #include "config.h"
 
@@ -35,7 +34,7 @@
 #include <stdlib.h>
 #include <assert.h>
 
-#include "irtools.h"
+#include "util.h"
 #include "xmalloc.h"
 #include "debug.h"
 #include "bitset.h"
@@ -43,7 +42,7 @@
 
 #include "hungarian.h"
 
-DEBUG_ONLY(static firm_dbg_module_t *dbg);
+DEBUG_ONLY(static firm_dbg_module_t *dbg;)
 
 struct hungarian_problem_t {
 	unsigned      num_rows;      /**< number of rows */