X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fbipartite.c;h=4c47e97edc859ff5f0906afa8575190a1e57eee9;hb=0f234e2d94155d13c0e4727871125beda0eaa66d;hp=9a169c9228b6147e8cbd8ecb1501947d1fec7f0c;hpb=389fc95084e6d484ed84c37f28838d3f9a3c964d;p=libfirm

diff --git a/ir/adt/bipartite.c b/ir/adt/bipartite.c
index 9a169c922..4c47e97ed 100644
--- a/ir/adt/bipartite.c
+++ b/ir/adt/bipartite.c
@@ -1,3 +1,29 @@
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief   Specialized implementation for perfect bipartite matching.
+ * @author  Sebastian Hack
+ * @version $Id$
+ */
+#include "config.h"
 
 #include <stdio.h>
 #include <assert.h>
@@ -8,18 +34,16 @@
 
 struct _bipartite_t {
 	int n_left, n_right;
-	bitset_t **adj;
+	bitset_t *adj[1];
 };
 
 bipartite_t *bipartite_new(int n_left, int n_right)
 {
+	bipartite_t *gr = XMALLOCFZ(bipartite_t, adj, n_left);
 	int i;
-	bipartite_t *gr = xmalloc(sizeof(*gr) + n_left * sizeof(void *));
-	memset(gr, 0, sizeof(*gr));
 
 	gr->n_left = n_left;
 	gr->n_right = n_right;
-	gr->adj = (bitset_t**)(gr + 1);
 
 	for(i = 0; i < n_left; ++i)
 		gr->adj[i] = bitset_malloc(n_right);
@@ -105,10 +129,10 @@ 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_min(tmp);
+			right = bitset_next_set(tmp, 0);
 			assert(!bitset_is_set(matched_right, right));
 			matching[left] = right;
 			bitset_set(matched_left, left);
@@ -129,12 +153,22 @@ void bipartite_matching(const bipartite_t *gr, int *matching)
 	while(apply_alternating_path(gr, matching, matched_left, matched_right));
 }
 
-void bipartite_dump(FILE *f, const bipartite_t *gr)
+void bipartite_dump_f(FILE *f, const bipartite_t *gr)
 {
 	int i;
 
 	for(i = 0; i < gr->n_left; ++i) {
+		fprintf(f, "%d: ", i);
 		bitset_fprint(f, gr->adj[i]);
 		fprintf(f, "\n");
 	}
 }
+
+void bipartite_dump(const char *name, const bipartite_t *gr) {
+	FILE *f = fopen(name, "w");
+
+	if (f) {
+		bipartite_dump_f(f, gr);
+		fclose(f);
+	}
+}