Searched refs:IDA_BITMAP_BITS (Results 1 – 5 of 5) sorted by relevance
| /Linux-v4.19/lib/ |
| D | test_ida.c | 88 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()
|
| D | idr.c | 364 #define IDA_MAX (0x80000000U / IDA_BITMAP_BITS - 1)
376 index = start / IDA_BITMAP_BITS; in ida_get_new_above()
377 bit = start % IDA_BITMAP_BITS; in ida_get_new_above()
397 new = iter.index * IDA_BITMAP_BITS; in ida_get_new_above()
417 IDA_BITMAP_BITS, bit); in ida_get_new_above()
421 if (bit == IDA_BITMAP_BITS) in ida_get_new_above()
425 if (bitmap_full(bitmap->bitmap, IDA_BITMAP_BITS)) in ida_get_new_above()
452 unsigned long index = id / IDA_BITMAP_BITS; in ida_remove()
453 unsigned offset = id % IDA_BITMAP_BITS; in ida_remove()
481 } else if (bitmap_empty(btmp, IDA_BITMAP_BITS)) { in ida_remove()
|
| D | radix-tree.c | 76 #define IDA_INDEX_BITS (8 * sizeof(int) - 1 - ilog2(IDA_BITMAP_BITS))
335 node, node->offset, index * IDA_BITMAP_BITS, in dump_ida_node()
337 IDA_BITMAP_BITS - 1, in dump_ida_node()
346 index * IDA_BITMAP_BITS, in dump_ida_node()
347 index * IDA_BITMAP_BITS + BITS_PER_LONG - in dump_ida_node()
356 index * IDA_BITMAP_BITS, in dump_ida_node()
357 (index + 1) * IDA_BITMAP_BITS - 1); in dump_ida_node()
|
| /Linux-v4.19/tools/testing/radix-tree/ |
| D | idr-test.c | 351 IDA_BUG_ON(&ida, (i % IDA_BITMAP_BITS) != in ida_check_conv_user()
355 IDA_BUG_ON(&ida, (i % IDA_BITMAP_BITS) == in ida_check_conv_user()
|
| /Linux-v4.19/include/linux/ |
| D | idr.h | 222 #define IDA_BITMAP_BITS (IDA_BITMAP_LONGS * sizeof(long) * 8) macro
|
