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

diff --git a/ir/adt/bipartite.c b/ir/adt/bipartite.c
index 9a169c922..a114e014e 100644
--- a/ir/adt/bipartite.c
+++ b/ir/adt/bipartite.c
@@ -1,3 +1,8 @@
+/*
+ * Specialized implementation for perfect bipartite matching.
+ * @author Sebastian Hack
+ * @cvs-id $Id$
+ */
 
 #include <stdio.h>
 #include <assert.h>
@@ -8,18 +13,20 @@
 
 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)
 {
-	int i;
-	bipartite_t *gr = xmalloc(sizeof(*gr) + n_left * sizeof(void *));
+	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));
 
 	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);
@@ -129,12 +136,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);
+	}
+}