X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fbipartite.c;h=4c47e97edc859ff5f0906afa8575190a1e57eee9;hb=1852308bd33b77378f0fca9e5347d4f9082464c4;hp=cc627286012b04a7fe1097bebb7e7712ecb603ca;hpb=1ce363f80e6a204d4011f85813362d9bd1d0e7e4;p=libfirm diff --git a/ir/adt/bipartite.c b/ir/adt/bipartite.c index cc6272860..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 #include @@ -41,12 +39,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; @@ -135,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);