X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fbipartite.c;h=05c6d10d93d825929d0d566768ad3297b4419745;hb=f2edb6301aa7affb0673e76436d9b4dbaef6b9e1;hp=6c3f8f5eef96efff4687ea8cec2597c6a46749ac;hpb=57d365a67aaef76497b85e9a18b785c562652b16;p=libfirm

diff --git a/ir/adt/bipartite.c b/ir/adt/bipartite.c
index 6c3f8f5ee..05c6d10d9 100644
--- a/ir/adt/bipartite.c
+++ b/ir/adt/bipartite.c
@@ -1,5 +1,5 @@
 /*
- * Copyrigth (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -41,12 +41,8 @@ struct _bipartite_t {
 
 bipartite_t *bipartite_new(int n_left, int n_right)
 {
-	int i, size;
-	bipartite_t *gr;
-
-	size = n_left > 0 ? n_left - 1 : 0;
-	gr = xmalloc(sizeof(*gr) + size * sizeof(void *));
-	memset(gr, 0, sizeof(*gr));
+	bipartite_t *gr = XMALLOCFZ(bipartite_t, adj, n_left);
+	int i;
 
 	gr->n_left = n_left;
 	gr->n_right = n_right;
@@ -138,7 +134,7 @@ static int apply_alternating_path(const bipartite_t *gr, int *matching,
 			if(bitset_popcnt(tmp) == 0)
 				continue;
 
-			right = bitset_min(tmp);
+			right = bitset_next_set(tmp, 0);
 			assert(!bitset_is_set(matched_right, right));
 			matching[left] = right;
 			bitset_set(matched_left, left);