Minor code cleanup. Removed unnecessary debugging output.

diff --git a/mm/bitmap2.c b/mm/bitmap2.c
index 9a257e27eedb9ca91cd2d10d7c8c3d8d02aded45..b0aa8424a43a63a987caefc5a39740467c82755d 100644 (file)
--- a/mm/bitmap2.c
+++ b/mm/bitmap2.c
@@ -6,7 +6,7 @@
  *
  * Authors: Philipp Tomsich     EMAIL: cacao@complang.tuwien.ac.at
  *
- * $Id: bitmap2.c 45 1998-11-09 13:35:51Z phil $
+ * $Id: bitmap2.c 56 1998-11-10 17:35:47Z phil $
  */
 
 /*
@@ -336,8 +336,6 @@ bitmap_find_next_combination_set_unset(bitmap_t* bitmap,
        bitmap_boundscheck(bitmap, addr);
        bitmap_boundscheck(invertedmap, addr);
 
-       //              fprintf(stderr, "bitmap_find_next_combination_set_unset(0x%lx, 0x%lx. 0x%lx);\n", bitmap, invertedmap, addr);
-
        /* 1. check the current block, starting from the bit indicated by addr */
        pattern = (bitmap->bitmap[block] & ~invertedmap->bitmap[block]) >> offset;
        if (pattern)
@@ -345,16 +343,10 @@ bitmap_find_next_combination_set_unset(bitmap_t* bitmap,
 
        /* 2. iteratively check block by block until the end of the bitmap */
        while (block < bitmap->bitmap_top_block) {
-               ++block;
-               pattern = bitmap->bitmap[block] & ~invertedmap->bitmap[block];
-
-               if (pattern) {
-                       //                      fprintf(stderr, "\tbitmap->bitmap[block] = 0x%lx, ~invertedmap->bitmap[block] = 0x%lx\n",
-                       //                                      bitmap->bitmap[block], ~invertedmap->bitmap[block]);
-                       //                      fprintf(stderr, "\tpattern = 0x%lx, BLOCK_TO_ADDR(block) = 0x%lx\n", pattern, BLOCK_TO_ADDR(block));
+               pattern = bitmap->bitmap[++block] & ~invertedmap->bitmap[block];
 
+               if (pattern)
                        return (void*)(BLOCK_TO_ADDR(block) + offset_for_lowest(pattern));
-               }
        }
 
        /* 3. failed to find a combination... */