Home
last modified time | relevance | path

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

/Linux-v5.4/lib/
Didr.c382 XA_STATE(xas, &ida->xa, min / IDA_BITMAP_BITS); in ida_alloc_range()
383 unsigned bit = min % IDA_BITMAP_BITS; in ida_alloc_range()
396 bitmap = xas_find_marked(&xas, max / IDA_BITMAP_BITS, XA_FREE_MARK); in ida_alloc_range()
397 if (xas.xa_index > min / IDA_BITMAP_BITS) in ida_alloc_range()
399 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
407 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
429 bit = find_next_zero_bit(bitmap->bitmap, IDA_BITMAP_BITS, bit); in ida_alloc_range()
430 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
432 if (bit == IDA_BITMAP_BITS) in ida_alloc_range()
436 if (bitmap_full(bitmap->bitmap, IDA_BITMAP_BITS)) in ida_alloc_range()
[all …]
Dtest_ida.c88 for (i = 0; i < IDA_BITMAP_BITS; i++) { in ida_check_leaf()
131 for (i = 0; i < IDA_BITMAP_BITS * 2; i += IDA_BITMAP_BITS) { in ida_check_conv()
140 for (i = 0; i < IDA_BITMAP_BITS * 2; i++) in ida_check_conv()
142 for (i = IDA_BITMAP_BITS * 2; i > 0; i--) in ida_check_conv()
146 for (i = 0; i < IDA_BITMAP_BITS + BITS_PER_LONG - 4; i++) in ida_check_conv()
148 for (i = IDA_BITMAP_BITS + BITS_PER_LONG - 4; i > 0; i--) in ida_check_conv()
Dradix-tree.c61 #define IDA_INDEX_BITS (8 * sizeof(int) - 1 - ilog2(IDA_BITMAP_BITS))
/Linux-v5.4/tools/testing/radix-tree/
Didr-test.c449 IDA_BUG_ON(&ida, ((i % IDA_BITMAP_BITS) != in ida_check_conv_user()
451 ((i % IDA_BITMAP_BITS) != 0)); in ida_check_conv_user()
454 IDA_BUG_ON(&ida, (i % IDA_BITMAP_BITS) == in ida_check_conv_user()
/Linux-v5.4/include/linux/
Didr.h238 #define IDA_BITMAP_BITS (IDA_BITMAP_LONGS * sizeof(long) * 8) macro