48 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_equal()  local
49 	for (k = 0; k < lim; ++k)  in __bitmap_equal()
50 		if (bitmap1[k] != bitmap2[k])  in __bitmap_equal()
54 		if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_equal()
63 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_complement()  local
64 	for (k = 0; k < lim; ++k)  in __bitmap_complement()
65 		dst[k] = ~src[k];  in __bitmap_complement()
68 		dst[k] = ~src[k];  in __bitmap_complement()
86 	unsigned k, lim = BITS_TO_LONGS(nbits);  in __bitmap_shift_right()  local
89 	for (k = 0; off + k < lim; ++k) {  in __bitmap_shift_right()
96 		if (!rem || off + k + 1 >= lim)  in __bitmap_shift_right()
99 			upper = src[off + k + 1];  in __bitmap_shift_right()
100 			if (off + k + 1 == lim - 1)  in __bitmap_shift_right()
104 		lower = src[off + k];  in __bitmap_shift_right()
105 		if (off + k == lim - 1)  in __bitmap_shift_right()
108 		dst[k] = lower | upper;  in __bitmap_shift_right()
131 	int k;  in __bitmap_shift_left()  local
134 	for (k = lim - off - 1; k >= 0; --k) {  in __bitmap_shift_left()
141 		if (rem && k > 0)  in __bitmap_shift_left()
142 			lower = src[k - 1] >> (BITS_PER_LONG - rem);  in __bitmap_shift_left()
145 		upper = src[k] << rem;  in __bitmap_shift_left()
146 		dst[k + off] = lower | upper;  in __bitmap_shift_left()
156 	unsigned int k;  in __bitmap_and()  local
160 	for (k = 0; k < lim; k++)  in __bitmap_and()
161 		result |= (dst[k] = bitmap1[k] & bitmap2[k]);  in __bitmap_and()
163 		result |= (dst[k] = bitmap1[k] & bitmap2[k] &  in __bitmap_and()
172 	unsigned int k;  in __bitmap_or()  local
175 	for (k = 0; k < nr; k++)  in __bitmap_or()
176 		dst[k] = bitmap1[k] | bitmap2[k];  in __bitmap_or()
183 	unsigned int k;  in __bitmap_xor()  local
186 	for (k = 0; k < nr; k++)  in __bitmap_xor()
187 		dst[k] = bitmap1[k] ^ bitmap2[k];  in __bitmap_xor()
194 	unsigned int k;  in __bitmap_andnot()  local
198 	for (k = 0; k < lim; k++)  in __bitmap_andnot()
199 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k]);  in __bitmap_andnot()
201 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k] &  in __bitmap_andnot()
210 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_intersects()  local
211 	for (k = 0; k < lim; ++k)  in __bitmap_intersects()
212 		if (bitmap1[k] & bitmap2[k])  in __bitmap_intersects()
216 		if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_intersects()
225 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_subset()  local
226 	for (k = 0; k < lim; ++k)  in __bitmap_subset()
227 		if (bitmap1[k] & ~bitmap2[k])  in __bitmap_subset()
231 		if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_subset()
239 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_weight()  local
242 	for (k = 0; k < lim; k++)  in __bitmap_weight()
243 		w += hweight_long(bitmap[k]);  in __bitmap_weight()
246 		w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits));  in __bitmap_weight()