X-Git-Url: http://wien.tomnetworks.com/gitweb/?a=blobdiff_plain;f=mono%2Futils%2Fmonobitset.h;h=7ec53f60bcf91cf53c3ea6f87f77589f7b09fe4f;hb=5901caa6ce510e300117609410192bcf15b098f0;hp=6807336a6c989230c5b5e25a6d459fadb6aebc62;hpb=fefd6f1d0578964f8ec15e061c5b2db1f9ef4fbc;p=mono.git diff --git a/mono/utils/monobitset.h b/mono/utils/monobitset.h index 6807336a6c9..7ec53f60bcf 100644 --- a/mono/utils/monobitset.h +++ b/mono/utils/monobitset.h @@ -3,13 +3,60 @@ #include -typedef struct MonoBitSet MonoBitSet; +/* + * When embedding, you have to define MONO_ZERO_LEN_ARRAY before including any + * other Mono header file if you use a different compiler from the one used to + * build Mono. + */ +#ifndef MONO_ZERO_LEN_ARRAY +#ifdef __GNUC__ +#define MONO_ZERO_LEN_ARRAY 0 +#else +#define MONO_ZERO_LEN_ARRAY 1 +#endif +#endif + +#define MONO_BITSET_BITS_PER_CHUNK (8 * sizeof (gsize)) + +typedef struct { + gsize size; + gsize flags; + gsize data [MONO_ZERO_LEN_ARRAY]; +} MonoBitSet; + typedef void (*MonoBitSetFunc) (guint idx, gpointer data); enum { MONO_BITSET_DONT_FREE = 1 }; +/* Fast access to bits which depends on the implementation of the bitset */ +#define mono_bitset_test_fast(set,n) ((set)->data [(n)/MONO_BITSET_BITS_PER_CHUNK] & ((gsize)1 << ((n) % MONO_BITSET_BITS_PER_CHUNK))) +#define mono_bitset_test_fast(set,n) ((set)->data [(n)/MONO_BITSET_BITS_PER_CHUNK] & ((gsize)1 << ((n) % MONO_BITSET_BITS_PER_CHUNK))) +#define mono_bitset_set_fast(set,n) do { (set)->data [(n)/MONO_BITSET_BITS_PER_CHUNK] |= ((gsize)1 << ((n) % MONO_BITSET_BITS_PER_CHUNK)); } while (0) +#define mono_bitset_clear_fast(set,n) do { (set)->data [(n)/MONO_BITSET_BITS_PER_CHUNK] &= ~((gsize)1 << ((n) % MONO_BITSET_BITS_PER_CHUNK)); } while (0) +#define mono_bitset_get_fast(set,n) ((set)->data[(n)]) + +#define mono_bitset_copyto_fast(src,dest) do { memcpy (&(dest)->data, &(src)->data, (dest)->size / 8); } while (0) + +#define mono_bitset_union_fast(dest,src) do { \ + MonoBitSet *tmp_src = (src); \ + MonoBitSet *tmp_dest = (dest); \ + int i, size; \ + size = tmp_dest->size / MONO_BITSET_BITS_PER_CHUNK; \ + for (i = 0; i < size; ++i) \ + tmp_dest->data [i] |= tmp_src->data [i]; \ +} while (0) + +#define mono_bitset_sub_fast(dest,src) do { \ + MonoBitSet *tmp_src = (src); \ + MonoBitSet *tmp_dest = (dest); \ + int i, size; \ + size = tmp_dest->size / MONO_BITSET_BITS_PER_CHUNK; \ + for (i = 0; i < size; ++i) \ + tmp_dest->data [i] &= ~tmp_src->data [i]; \ +} while (0) + /* * Interface documentation can be found in the c-file. * Interface documentation by Dennis Haney. @@ -29,7 +76,7 @@ void mono_bitset_set_all (MonoBitSet *set); int mono_bitset_test (const MonoBitSet *set, guint32 pos); -guint32 mono_bitset_test_bulk (const MonoBitSet *set, guint32 pos); +gsize mono_bitset_test_bulk (const MonoBitSet *set, guint32 pos); void mono_bitset_clear (MonoBitSet *set, guint32 pos); @@ -49,6 +96,8 @@ int mono_bitset_find_first (const MonoBitSet *set, gint pos); int mono_bitset_find_last (const MonoBitSet *set, gint pos); +int mono_bitset_find_first_unset (const MonoBitSet *set, gint pos); + MonoBitSet* mono_bitset_clone (const MonoBitSet *set, guint32 new_size); void mono_bitset_copyto (const MonoBitSet *src, MonoBitSet *dest); @@ -63,4 +112,6 @@ gboolean mono_bitset_equal (const MonoBitSet *src, const MonoBitSet *s void mono_bitset_foreach (MonoBitSet *set, MonoBitSetFunc func, gpointer data); +void mono_bitset_intersection_2 (MonoBitSet *dest, const MonoBitSet *src1, const MonoBitSet *src2); + #endif /* __MONO_BITSET_H__ */