Lines Matching refs:k
57 int k, lim = bits/BITS_PER_LONG; in __bitmap_empty() local
58 for (k = 0; k < lim; ++k) in __bitmap_empty()
59 if (bitmap[k]) in __bitmap_empty()
63 if (bitmap[k] & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_empty()
72 int k, lim = bits/BITS_PER_LONG; in __bitmap_full() local
73 for (k = 0; k < lim; ++k) in __bitmap_full()
74 if (~bitmap[k]) in __bitmap_full()
78 if (~bitmap[k] & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_full()
88 int k, lim = bits/BITS_PER_LONG; in __bitmap_equal() local
89 for (k = 0; k < lim; ++k) in __bitmap_equal()
90 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
94 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
103 int k, lim = bits/BITS_PER_LONG; in __bitmap_complement() local
104 for (k = 0; k < lim; ++k) in __bitmap_complement()
105 dst[k] = ~src[k]; in __bitmap_complement()
108 dst[k] = ~src[k] & BITMAP_LAST_WORD_MASK(bits); in __bitmap_complement()
126 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG; in __bitmap_shift_right() local
129 for (k = 0; off + k < lim; ++k) { in __bitmap_shift_right()
136 if (!rem || off + k + 1 >= lim) in __bitmap_shift_right()
139 upper = src[off + k + 1]; in __bitmap_shift_right()
140 if (off + k + 1 == lim - 1 && left) in __bitmap_shift_right()
143 lower = src[off + k]; in __bitmap_shift_right()
144 if (left && off + k == lim - 1) in __bitmap_shift_right()
146 dst[k] = rem in __bitmap_shift_right()
149 if (left && k == lim - 1) in __bitmap_shift_right()
150 dst[k] &= mask; in __bitmap_shift_right()
173 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG; in __bitmap_shift_left() local
175 for (k = lim - off - 1; k >= 0; --k) { in __bitmap_shift_left()
182 if (rem && k > 0) in __bitmap_shift_left()
183 lower = src[k - 1]; in __bitmap_shift_left()
186 upper = src[k]; in __bitmap_shift_left()
187 if (left && k == lim - 1) in __bitmap_shift_left()
189 dst[k + off] = rem ? (lower >> (BITS_PER_LONG - rem)) in __bitmap_shift_left()
192 if (left && k + off == lim - 1) in __bitmap_shift_left()
193 dst[k + off] &= (1UL << left) - 1; in __bitmap_shift_left()
203 int k; in __bitmap_and() local
206 for (k = 0; k < nr; k++) in __bitmap_and()
207 dst[k] = bitmap1[k] & bitmap2[k]; in __bitmap_and()
214 int k; in __bitmap_or() local
217 for (k = 0; k < nr; k++) in __bitmap_or()
218 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
225 int k; in __bitmap_xor() local
228 for (k = 0; k < nr; k++) in __bitmap_xor()
229 dst[k] = bitmap1[k] ^ bitmap2[k]; in __bitmap_xor()
236 int k; in __bitmap_andnot() local
239 for (k = 0; k < nr; k++) in __bitmap_andnot()
240 dst[k] = bitmap1[k] & ~bitmap2[k]; in __bitmap_andnot()
247 int k, lim = bits/BITS_PER_LONG; in __bitmap_intersects() local
248 for (k = 0; k < lim; ++k) in __bitmap_intersects()
249 if (bitmap1[k] & bitmap2[k]) in __bitmap_intersects()
253 if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_intersects()
262 int k, lim = bits/BITS_PER_LONG; in __bitmap_subset() local
263 for (k = 0; k < lim; ++k) in __bitmap_subset()
264 if (bitmap1[k] & ~bitmap2[k]) in __bitmap_subset()
268 if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_subset()
277 int k, w = 0, lim = bits/BITS_PER_LONG; in __bitmap_weight() local
279 for (k = 0; k < lim; k++) in __bitmap_weight()
280 w += hweight32(bitmap[k]); in __bitmap_weight()
283 w += hweight32(bitmap[k] & BITMAP_LAST_WORD_MASK(bits)); in __bitmap_weight()
290 int k, w = 0, lim = bits/BITS_PER_LONG; in __bitmap_weight() local
292 for (k = 0; k < lim; k++) in __bitmap_weight()
293 w += hweight64(bitmap[k]); in __bitmap_weight()
296 w += hweight64(bitmap[k] & BITMAP_LAST_WORD_MASK(bits)); in __bitmap_weight()