51 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_equal()  local
52 	for (k = 0; k < lim; ++k)  in __bitmap_equal()
53 		if (bitmap1[k] != bitmap2[k])  in __bitmap_equal()
57 		if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_equal()
69 	unsigned int k, lim = bits / BITS_PER_LONG;  in __bitmap_or_equal()  local
72 	for (k = 0; k < lim; ++k) {  in __bitmap_or_equal()
73 		if ((bitmap1[k] | bitmap2[k]) != bitmap3[k])  in __bitmap_or_equal()
80 	tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k];  in __bitmap_or_equal()
86 	unsigned int k, lim = BITS_TO_LONGS(bits);  in __bitmap_complement()  local
87 	for (k = 0; k < lim; ++k)  in __bitmap_complement()
88 		dst[k] = ~src[k];  in __bitmap_complement()
106 	unsigned k, lim = BITS_TO_LONGS(nbits);  in __bitmap_shift_right()  local
109 	for (k = 0; off + k < lim; ++k) {  in __bitmap_shift_right()
116 		if (!rem || off + k + 1 >= lim)  in __bitmap_shift_right()
119 			upper = src[off + k + 1];  in __bitmap_shift_right()
120 			if (off + k + 1 == lim - 1)  in __bitmap_shift_right()
124 		lower = src[off + k];  in __bitmap_shift_right()
125 		if (off + k == lim - 1)  in __bitmap_shift_right()
128 		dst[k] = lower | upper;  in __bitmap_shift_right()
151 	int k;  in __bitmap_shift_left()  local
154 	for (k = lim - off - 1; k >= 0; --k) {  in __bitmap_shift_left()
161 		if (rem && k > 0)  in __bitmap_shift_left()
162 			lower = src[k - 1] >> (BITS_PER_LONG - rem);  in __bitmap_shift_left()
165 		upper = src[k] << rem;  in __bitmap_shift_left()
166 		dst[k + off] = lower | upper;  in __bitmap_shift_left()
243 	unsigned int k;  in __bitmap_and()  local
247 	for (k = 0; k < lim; k++)  in __bitmap_and()
248 		result |= (dst[k] = bitmap1[k] & bitmap2[k]);  in __bitmap_and()
250 		result |= (dst[k] = bitmap1[k] & bitmap2[k] &  in __bitmap_and()
259 	unsigned int k;  in __bitmap_or()  local
262 	for (k = 0; k < nr; k++)  in __bitmap_or()
263 		dst[k] = bitmap1[k] | bitmap2[k];  in __bitmap_or()
270 	unsigned int k;  in __bitmap_xor()  local
273 	for (k = 0; k < nr; k++)  in __bitmap_xor()
274 		dst[k] = bitmap1[k] ^ bitmap2[k];  in __bitmap_xor()
281 	unsigned int k;  in __bitmap_andnot()  local
285 	for (k = 0; k < lim; k++)  in __bitmap_andnot()
286 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k]);  in __bitmap_andnot()
288 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k] &  in __bitmap_andnot()
298 	unsigned int k;  in __bitmap_replace()  local
301 	for (k = 0; k < nr; k++)  in __bitmap_replace()
302 		dst[k] = (old[k] & ~mask[k]) | (new[k] & mask[k]);  in __bitmap_replace()
309 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_intersects()  local
310 	for (k = 0; k < lim; ++k)  in __bitmap_intersects()
311 		if (bitmap1[k] & bitmap2[k])  in __bitmap_intersects()
315 		if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_intersects()
324 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_subset()  local
325 	for (k = 0; k < lim; ++k)  in __bitmap_subset()
326 		if (bitmap1[k] & ~bitmap2[k])  in __bitmap_subset()
330 		if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_subset()