X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fbitset.h;h=5d9aada3f7e48fa37b140a80d54c456476bd29fa;hb=7cf5d1acea5684e12bd09537b60324acb1c0b163;hp=79cb6b4eb0f93f5b47fde183789abe56b11f356e;hpb=1a3b7d363474ab544c13093a2f0b578718d37c7a;p=libfirm

diff --git a/ir/adt/bitset.h b/ir/adt/bitset.h
index 79cb6b4eb..5d9aada3f 100644
--- a/ir/adt/bitset.h
+++ b/ir/adt/bitset.h
@@ -22,7 +22,6 @@
  * @brief   convenience layer over raw_bitsets (stores number of bits
  *          with the bitfield)
  * @author  Matthias Braun
- * @version $Id$
  */
 #ifndef FIRM_ADT_BITSET_H
 #define FIRM_ADT_BITSET_H
@@ -201,8 +200,6 @@ static inline void bitset_copy_into(bitset_t *tgt, const bitset_t *src)
  */
 static inline size_t bitset_next_clear(const bitset_t *bs, size_t pos)
 {
-	if (pos >= bs->size)
-		return (size_t)-1;
 	return rbitset_next_max(bs->data, pos, bs->size, false);
 }
 
@@ -216,8 +213,6 @@ static inline size_t bitset_next_clear(const bitset_t *bs, size_t pos)
  */
 static inline size_t bitset_next_set(const bitset_t *bs, size_t pos)
 {
-	if (pos >= bs->size)
-		return (size_t)-1;
 	return rbitset_next_max(bs->data, pos, bs->size, true);
 }
 
@@ -226,12 +221,12 @@ static inline size_t bitset_next_set(const bitset_t *bs, size_t pos)
  * @param bitset The bitset.
  * @param elm A size_t variable.
  */
-#define bitset_foreach(bitset,elm) \
-	for(elm = bitset_next_set(bitset,0); elm != (size_t)-1; elm = bitset_next_set(bitset,elm+1))
+#define bitset_foreach(bitset, elm) \
+	for (size_t elm = 0; (elm = bitset_next_set((bitset), elm)) != (size_t)-1; ++elm)
 
 
-#define bitset_foreach_clear(bitset,elm) \
-	for(elm = bitset_next_clear(bitset,0); elm != (size_t) -1; elm = bitset_next_clear(bitset,elm+1))
+#define bitset_foreach_clear(bitset, elm) \
+	for (size_t elm = 0; (elm = bitset_next_clear((bitset), elm)) != (size_t)-1; ++elm)
 
 /**
  * Count the bits set.