18  * bitmaps provide an array of bits, implemented using an
19  * array of unsigned longs.  The number of valid bits in a
23  * The possible unused bits in the last, partially used word
29  * carefully filter out these unused bits from impacting their
34  * unused bits set, then they won't output any set unused bits
41 int slow_bitmap_empty(const unsigned long *bitmap, long bits)  in slow_bitmap_empty()  argument
43     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_empty()
50     if (bits % BITS_PER_LONG) {  in slow_bitmap_empty()
51         if (bitmap[k] & BITMAP_LAST_WORD_MASK(bits)) {  in slow_bitmap_empty()
59 int slow_bitmap_full(const unsigned long *bitmap, long bits)  in slow_bitmap_full()  argument
61     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_full()
69     if (bits % BITS_PER_LONG) {  in slow_bitmap_full()
70         if (~bitmap[k] & BITMAP_LAST_WORD_MASK(bits)) {  in slow_bitmap_full()
79                       const unsigned long *bitmap2, long bits)  in slow_bitmap_equal()  argument
81     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_equal()
89     if (bits % BITS_PER_LONG) {  in slow_bitmap_equal()
90         if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) {  in slow_bitmap_equal()
99                             long bits)  in slow_bitmap_complement()  argument
101     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_complement()
107     if (bits % BITS_PER_LONG) {  in slow_bitmap_complement()
108         dst[k] = ~src[k] & BITMAP_LAST_WORD_MASK(bits);  in slow_bitmap_complement()
113                     const unsigned long *bitmap2, long bits)  in slow_bitmap_and()  argument
116     long nr = BITS_TO_LONGS(bits);  in slow_bitmap_and()
126                     const unsigned long *bitmap2, long bits)  in slow_bitmap_or()  argument
129     long nr = BITS_TO_LONGS(bits);  in slow_bitmap_or()
137                      const unsigned long *bitmap2, long bits)  in slow_bitmap_xor()  argument
140     long nr = BITS_TO_LONGS(bits);  in slow_bitmap_xor()
148                        const unsigned long *bitmap2, long bits)  in slow_bitmap_andnot()  argument
151     long nr = BITS_TO_LONGS(bits);  in slow_bitmap_andnot()
351  * @size: The bitmap size in bits
353  * @nr: The number of zeroed bits we're looking for
386                            const unsigned long *bitmap2, long bits)  in slow_bitmap_intersects()  argument
388     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_intersects()
396     if (bits % BITS_PER_LONG) {  in slow_bitmap_intersects()
397         if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) {  in slow_bitmap_intersects()