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()
76 	unsigned int k, lim = BITS_TO_LONGS(bits);  in __bitmap_complement()  local
77 	for (k = 0; k < lim; ++k)  in __bitmap_complement()
78 		dst[k] = ~src[k];  in __bitmap_complement()
96 	unsigned k, lim = BITS_TO_LONGS(nbits);  in __bitmap_shift_right()  local
99 	for (k = 0; off + k < lim; ++k) {  in __bitmap_shift_right()
106 		if (!rem || off + k + 1 >= lim)  in __bitmap_shift_right()
109 			upper = src[off + k + 1];  in __bitmap_shift_right()
110 			if (off + k + 1 == lim - 1)  in __bitmap_shift_right()
114 		lower = src[off + k];  in __bitmap_shift_right()
115 		if (off + k == lim - 1)  in __bitmap_shift_right()
118 		dst[k] = lower | upper;  in __bitmap_shift_right()
141 	int k;  in __bitmap_shift_left()  local
144 	for (k = lim - off - 1; k >= 0; --k) {  in __bitmap_shift_left()
151 		if (rem && k > 0)  in __bitmap_shift_left()
152 			lower = src[k - 1] >> (BITS_PER_LONG - rem);  in __bitmap_shift_left()
155 		upper = src[k] << rem;  in __bitmap_shift_left()
156 		dst[k + off] = lower | upper;  in __bitmap_shift_left()
233 	unsigned int k;  in __bitmap_and()  local
237 	for (k = 0; k < lim; k++)  in __bitmap_and()
238 		result |= (dst[k] = bitmap1[k] & bitmap2[k]);  in __bitmap_and()
240 		result |= (dst[k] = bitmap1[k] & bitmap2[k] &  in __bitmap_and()
249 	unsigned int k;  in __bitmap_or()  local
252 	for (k = 0; k < nr; k++)  in __bitmap_or()
253 		dst[k] = bitmap1[k] | bitmap2[k];  in __bitmap_or()
260 	unsigned int k;  in __bitmap_xor()  local
263 	for (k = 0; k < nr; k++)  in __bitmap_xor()
264 		dst[k] = bitmap1[k] ^ bitmap2[k];  in __bitmap_xor()
271 	unsigned int k;  in __bitmap_andnot()  local
275 	for (k = 0; k < lim; k++)  in __bitmap_andnot()
276 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k]);  in __bitmap_andnot()
278 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k] &  in __bitmap_andnot()
288 	unsigned int k;  in __bitmap_replace()  local
291 	for (k = 0; k < nr; k++)  in __bitmap_replace()
292 		dst[k] = (old[k] & ~mask[k]) | (new[k] & mask[k]);  in __bitmap_replace()
299 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_intersects()  local
300 	for (k = 0; k < lim; ++k)  in __bitmap_intersects()
301 		if (bitmap1[k] & bitmap2[k])  in __bitmap_intersects()
305 		if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_intersects()
314 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_subset()  local
315 	for (k = 0; k < lim; ++k)  in __bitmap_subset()
316 		if (bitmap1[k] & ~bitmap2[k])  in __bitmap_subset()
320 		if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_subset()