X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fbipartite.c;h=4c47e97edc859ff5f0906afa8575190a1e57eee9;hb=1852308bd33b77378f0fca9e5347d4f9082464c4;hp=05c6d10d93d825929d0d566768ad3297b4419745;hpb=e07b61c6ed5d198a484761f8a40a4f26520d964d;p=libfirm

diff --git a/ir/adt/bipartite.c b/ir/adt/bipartite.c
index 05c6d10d9..4c47e97ed 100644
--- a/ir/adt/bipartite.c
+++ b/ir/adt/bipartite.c
@@ -19,13 +19,11 @@
 
 /**
  * @file
- * @brief  Specialized implementation for perfect bipartite matching.
- * @author Sebastian Hack
- * @cvs-id $Id$
+ * @brief   Specialized implementation for perfect bipartite matching.
+ * @author  Sebastian Hack
+ * @version $Id$
  */
-#ifdef HAVE_CONFIG_H
-# include "config.h"
-#endif
+#include "config.h"
 
 #include <stdio.h>
 #include <assert.h>
@@ -131,7 +129,7 @@ static int apply_alternating_path(const bipartite_t *gr, int *matching,
 			assert(!bitset_is_set(matched_left, left));
 
 			bitset_andnot(tmp, matched_right);
-			if(bitset_popcnt(tmp) == 0)
+			if(bitset_is_empty(tmp))
 				continue;
 
 			right = bitset_next_set(tmp, 0);