49 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_equal()  local
50 	for (k = 0; k < lim; ++k)  in __bitmap_equal()
51 		if (bitmap1[k] != bitmap2[k])  in __bitmap_equal()
55 		if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_equal()
67 	unsigned int k, lim = bits / BITS_PER_LONG;  in __bitmap_or_equal()  local
70 	for (k = 0; k < lim; ++k) {  in __bitmap_or_equal()
71 		if ((bitmap1[k] | bitmap2[k]) != bitmap3[k])  in __bitmap_or_equal()
78 	tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k];  in __bitmap_or_equal()
84 	unsigned int k, lim = BITS_TO_LONGS(bits);  in __bitmap_complement()  local
85 	for (k = 0; k < lim; ++k)  in __bitmap_complement()
86 		dst[k] = ~src[k];  in __bitmap_complement()
104 	unsigned k, lim = BITS_TO_LONGS(nbits);  in __bitmap_shift_right()  local
107 	for (k = 0; off + k < lim; ++k) {  in __bitmap_shift_right()
114 		if (!rem || off + k + 1 >= lim)  in __bitmap_shift_right()
117 			upper = src[off + k + 1];  in __bitmap_shift_right()
118 			if (off + k + 1 == lim - 1)  in __bitmap_shift_right()
122 		lower = src[off + k];  in __bitmap_shift_right()
123 		if (off + k == lim - 1)  in __bitmap_shift_right()
126 		dst[k] = lower | upper;  in __bitmap_shift_right()
149 	int k;  in __bitmap_shift_left()  local
152 	for (k = lim - off - 1; k >= 0; --k) {  in __bitmap_shift_left()
159 		if (rem && k > 0)  in __bitmap_shift_left()
160 			lower = src[k - 1] >> (BITS_PER_LONG - rem);  in __bitmap_shift_left()
163 		upper = src[k] << rem;  in __bitmap_shift_left()
164 		dst[k + off] = lower | upper;  in __bitmap_shift_left()
241 	unsigned int k;  in __bitmap_and()  local
245 	for (k = 0; k < lim; k++)  in __bitmap_and()
246 		result |= (dst[k] = bitmap1[k] & bitmap2[k]);  in __bitmap_and()
248 		result |= (dst[k] = bitmap1[k] & bitmap2[k] &  in __bitmap_and()
257 	unsigned int k;  in __bitmap_or()  local
260 	for (k = 0; k < nr; k++)  in __bitmap_or()
261 		dst[k] = bitmap1[k] | bitmap2[k];  in __bitmap_or()
268 	unsigned int k;  in __bitmap_xor()  local
271 	for (k = 0; k < nr; k++)  in __bitmap_xor()
272 		dst[k] = bitmap1[k] ^ bitmap2[k];  in __bitmap_xor()
279 	unsigned int k;  in __bitmap_andnot()  local
283 	for (k = 0; k < lim; k++)  in __bitmap_andnot()
284 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k]);  in __bitmap_andnot()
286 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k] &  in __bitmap_andnot()
296 	unsigned int k;  in __bitmap_replace()  local
299 	for (k = 0; k < nr; k++)  in __bitmap_replace()
300 		dst[k] = (old[k] & ~mask[k]) | (new[k] & mask[k]);  in __bitmap_replace()
307 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_intersects()  local
308 	for (k = 0; k < lim; ++k)  in __bitmap_intersects()
309 		if (bitmap1[k] & bitmap2[k])  in __bitmap_intersects()
313 		if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_intersects()
322 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_subset()  local
323 	for (k = 0; k < lim; ++k)  in __bitmap_subset()
324 		if (bitmap1[k] & ~bitmap2[k])  in __bitmap_subset()
328 		if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_subset()
336 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_weight()  local
339 	for (k = 0; k < lim; k++)  in __bitmap_weight()
340 		w += hweight_long(bitmap[k]);  in __bitmap_weight()
343 		w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits));  in __bitmap_weight()
788  * If for example, just bits 4 through 7 are set in @buf, then @pos
789  * values 4 through 7 will get mapped to 0 through 3, respectively,
790  * and other @pos values will get mapped to -1.  When @pos value 7
792  * that bit 7 is the 3rd (starting with 0th) set bit in @buf.
814  * If for example, just bits 4 through 7 are set in @buf, then @ord
815  * values 0 through 3 will get mapped to 4 through 7, respectively,
817  * gets mapped to (returns) @pos value 7 in this example, that means
818  * that the 3rd set bit (starting with 0th) is at position 7 in @buf.
859  * For example, lets say that @old has bits 4 through 7 set, and
861  * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
863  * with bits 1, 5 and 7 set, then @dst should leave with bits 1,
907  * For example, lets say that @old has bits 4 through 7 set, and
909  * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
953  *  1, 3, 5, 7, 9 and 11 set.  Then on return from this routine,
970  *  @orig (i.e. bits 3, 5, 7 and 9) were also set.
1007  *      1 3 5 7          1 3 5 7       41 43 48 61
1009  *      0 9 18 27        0 9 8 7       40 61 74 95