40 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_equal()  local
41 	for (k = 0; k < lim; ++k)  in __bitmap_equal()
42 		if (bitmap1[k] != bitmap2[k])  in __bitmap_equal()
46 		if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_equal()
58 	unsigned int k, lim = bits / BITS_PER_LONG;  in __bitmap_or_equal()  local
61 	for (k = 0; k < lim; ++k) {  in __bitmap_or_equal()
62 		if ((bitmap1[k] | bitmap2[k]) != bitmap3[k])  in __bitmap_or_equal()
69 	tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k];  in __bitmap_or_equal()
75 	unsigned int k, lim = BITS_TO_LONGS(bits);  in __bitmap_complement()  local
76 	for (k = 0; k < lim; ++k)  in __bitmap_complement()
77 		dst[k] = ~src[k];  in __bitmap_complement()
95 	unsigned k, lim = BITS_TO_LONGS(nbits);  in __bitmap_shift_right()  local
98 	for (k = 0; off + k < lim; ++k) {  in __bitmap_shift_right()
105 		if (!rem || off + k + 1 >= lim)  in __bitmap_shift_right()
108 			upper = src[off + k + 1];  in __bitmap_shift_right()
109 			if (off + k + 1 == lim - 1)  in __bitmap_shift_right()
113 		lower = src[off + k];  in __bitmap_shift_right()
114 		if (off + k == lim - 1)  in __bitmap_shift_right()
117 		dst[k] = lower | upper;  in __bitmap_shift_right()
140 	int k;  in __bitmap_shift_left()  local
143 	for (k = lim - off - 1; k >= 0; --k) {  in __bitmap_shift_left()
150 		if (rem && k > 0)  in __bitmap_shift_left()
151 			lower = src[k - 1] >> (BITS_PER_LONG - rem);  in __bitmap_shift_left()
154 		upper = src[k] << rem;  in __bitmap_shift_left()
155 		dst[k + off] = lower | upper;  in __bitmap_shift_left()
232 	unsigned int k;  in __bitmap_and()  local
236 	for (k = 0; k < lim; k++)  in __bitmap_and()
237 		result |= (dst[k] = bitmap1[k] & bitmap2[k]);  in __bitmap_and()
239 		result |= (dst[k] = bitmap1[k] & bitmap2[k] &  in __bitmap_and()
248 	unsigned int k;  in __bitmap_or()  local
251 	for (k = 0; k < nr; k++)  in __bitmap_or()
252 		dst[k] = bitmap1[k] | bitmap2[k];  in __bitmap_or()
259 	unsigned int k;  in __bitmap_xor()  local
262 	for (k = 0; k < nr; k++)  in __bitmap_xor()
263 		dst[k] = bitmap1[k] ^ bitmap2[k];  in __bitmap_xor()
270 	unsigned int k;  in __bitmap_andnot()  local
274 	for (k = 0; k < lim; k++)  in __bitmap_andnot()
275 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k]);  in __bitmap_andnot()
277 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k] &  in __bitmap_andnot()
287 	unsigned int k;  in __bitmap_replace()  local
290 	for (k = 0; k < nr; k++)  in __bitmap_replace()
291 		dst[k] = (old[k] & ~mask[k]) | (new[k] & mask[k]);  in __bitmap_replace()
298 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_intersects()  local
299 	for (k = 0; k < lim; ++k)  in __bitmap_intersects()
300 		if (bitmap1[k] & bitmap2[k])  in __bitmap_intersects()
304 		if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_intersects()
313 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_subset()  local
314 	for (k = 0; k < lim; ++k)  in __bitmap_subset()
315 		if (bitmap1[k] & ~bitmap2[k])  in __bitmap_subset()
319 		if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_subset()
449  * If for example, just bits 4 through 7 are set in @buf, then @pos
450  * values 4 through 7 will get mapped to 0 through 3, respectively,
451  * and other @pos values will get mapped to -1.  When @pos value 7
453  * that bit 7 is the 3rd (starting with 0th) set bit in @buf.
490  * For example, lets say that @old has bits 4 through 7 set, and
492  * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
494  * with bits 1, 5 and 7 set, then @dst should leave with bits 1,
539  * For example, lets say that @old has bits 4 through 7 set, and
541  * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
587  *  1, 3, 5, 7, 9 and 11 set.  Then on return from this routine,
604  *  @orig (i.e. bits 3, 5, 7 and 9) were also set.
641  *      1 3 5 7          1 3 5 7       41 43 48 61
643  *      0 9 18 27        0 9 8 7       40 61 74 95