Home
last modified time | relevance | path

Searched refs:IDA_BITMAP_BITS (Results 1 – 4 of 4) sorted by relevance

/linux/lib/
H A Didr.c385 XA_STATE(xas, &ida->xa, min / IDA_BITMAP_BITS); in ida_alloc_range()
386 unsigned bit = min % IDA_BITMAP_BITS; in ida_alloc_range()
399 bitmap = xas_find_marked(&xas, max / IDA_BITMAP_BITS, XA_FREE_MARK); in ida_alloc_range()
400 if (xas.xa_index > min / IDA_BITMAP_BITS) in ida_alloc_range()
402 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
410 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
432 bit = find_next_zero_bit(bitmap->bitmap, IDA_BITMAP_BITS, bit); in ida_alloc_range()
433 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
435 if (bit == IDA_BITMAP_BITS) in ida_alloc_range()
439 if (bitmap_full(bitmap->bitmap, IDA_BITMAP_BITS)) in ida_alloc_range()
[all …]
H A Dregion_alloc_benchmark.c62 unsigned long entries = DIV_ROUND_UP(nr_ids, IDA_BITMAP_BITS); in ida_size()
63 unsigned long bitmaps = nr_ids / IDA_BITMAP_BITS; in ida_size()
66 if (nr_ids % IDA_BITMAP_BITS > BITS_PER_XA_VALUE) in ida_size()
/linux/tools/testing/radix-tree/
H A Didr-test.c484 IDA_BUG_ON(&ida, ((i % IDA_BITMAP_BITS) != in ida_check_conv_user()
486 ((i % IDA_BITMAP_BITS) != 0)); in ida_check_conv_user()
489 IDA_BUG_ON(&ida, (i % IDA_BITMAP_BITS) == in ida_check_conv_user()
/linux/include/linux/
H A Didr.h257 #define IDA_BITMAP_BITS (IDA_BITMAP_LONGS * sizeof(long) * 8) macro