Lines Matching refs:n_bits

57 			unsigned int n_bits;				\
118 unsigned int n_bits; member
131 ck_bitmap_base(unsigned int n_bits) in ck_bitmap_base() argument
134 return CK_BITMAP_BLOCKS(n_bits) * sizeof(unsigned int); in ck_bitmap_base()
142 ck_bitmap_size(unsigned int n_bits) in ck_bitmap_size() argument
145 return ck_bitmap_base(n_bits) + sizeof(struct ck_bitmap); in ck_bitmap_size()
155 return bitmap->n_bits; in ck_bitmap_bits()
226 unsigned int n_buckets = dst->n_bits; in ck_bitmap_union()
228 if (src->n_bits < dst->n_bits) in ck_bitmap_union()
229 n_buckets = src->n_bits; in ck_bitmap_union()
249 unsigned int n_buckets = dst->n_bits; in ck_bitmap_intersection()
252 if (src->n_bits < n_intersect) in ck_bitmap_intersection()
253 n_intersect = src->n_bits; in ck_bitmap_intersection()
278 unsigned int n_intersect = dst->n_bits; in ck_bitmap_intersection_negate()
280 if (src->n_bits < n_intersect) in ck_bitmap_intersection_negate()
281 n_intersect = src->n_bits; in ck_bitmap_intersection_negate()
300 unsigned int n_buckets = ck_bitmap_base(bitmap->n_bits) / in ck_bitmap_clear()
319 if (limit > bitmap->n_bits) in ck_bitmap_empty()
320 limit = bitmap->n_bits; in ck_bitmap_empty()
350 if (limit > bitmap->n_bits) { in ck_bitmap_full()
351 limit = bitmap->n_bits; in ck_bitmap_full()
381 if (limit > bitmap->n_bits) in ck_bitmap_count()
382 limit = bitmap->n_bits; in ck_bitmap_count()
409 if (limit > x->n_bits) in ck_bitmap_count_intersect()
410 limit = x->n_bits; in ck_bitmap_count_intersect()
412 if (limit > y->n_bits) in ck_bitmap_count_intersect()
413 limit = y->n_bits; in ck_bitmap_count_intersect()
443 unsigned int n_bits, in ck_bitmap_init() argument
446 unsigned int base = ck_bitmap_base(n_bits); in ck_bitmap_init()
448 bitmap->n_bits = n_bits; in ck_bitmap_init()
452 unsigned int b = n_bits % CK_BITMAP_BLOCK; in ck_bitmap_init()
457 *CK_BITMAP_PTR(bitmap->map, n_bits - 1) &= (1U << b) - 1U; in ck_bitmap_init()
472 i->n_limit = CK_BITMAP_BLOCKS(bitmap->n_bits); in ck_bitmap_iterator_init()