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()
174 	unsigned int k;  in __bitmap_and()  local
178 	for (k = 0; k < lim; k++)  in __bitmap_and()
179 		result |= (dst[k] = bitmap1[k] & bitmap2[k]);  in __bitmap_and()
181 		result |= (dst[k] = bitmap1[k] & bitmap2[k] &  in __bitmap_and()
190 	unsigned int k;  in __bitmap_or()  local
193 	for (k = 0; k < nr; k++)  in __bitmap_or()
194 		dst[k] = bitmap1[k] | bitmap2[k];  in __bitmap_or()
201 	unsigned int k;  in __bitmap_xor()  local
204 	for (k = 0; k < nr; k++)  in __bitmap_xor()
205 		dst[k] = bitmap1[k] ^ bitmap2[k];  in __bitmap_xor()
212 	unsigned int k;  in __bitmap_andnot()  local
216 	for (k = 0; k < lim; k++)  in __bitmap_andnot()
217 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k]);  in __bitmap_andnot()
219 		result |= (dst[k] = bitmap1[k] & ~bitmap2[k] &  in __bitmap_andnot()
228 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_intersects()  local
229 	for (k = 0; k < lim; ++k)  in __bitmap_intersects()
230 		if (bitmap1[k] & bitmap2[k])  in __bitmap_intersects()
234 		if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_intersects()
243 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_subset()  local
244 	for (k = 0; k < lim; ++k)  in __bitmap_subset()
245 		if (bitmap1[k] & ~bitmap2[k])  in __bitmap_subset()
249 		if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))  in __bitmap_subset()
257 	unsigned int k, lim = bits/BITS_PER_LONG;  in __bitmap_weight()  local
260 	for (k = 0; k < lim; k++)  in __bitmap_weight()
261 		w += hweight_long(bitmap[k]);  in __bitmap_weight()
264 		w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits));  in __bitmap_weight()