Searched refs:RADIX_TREE_MAP_SHIFT (Results 1 - 6 of 6) sorted by relevance

/linux-master/tools/testing/radix-tree/
H A Dmultiorder.c167 unsigned int order = RADIX_TREE_MAP_SHIFT - 1;
223 item_insert_order(tree, 3 << RADIX_TREE_MAP_SHIFT, 0);
224 item_insert_order(tree, 2 << RADIX_TREE_MAP_SHIFT, 0);
226 for (order = 1; order < RADIX_TREE_MAP_SHIFT; order++) {
227 unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) -
241 unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) - 1;
H A Dbenchmark.c145 printv(1, "RADIX_TREE_MAP_SHIFT = %d\n", RADIX_TREE_MAP_SHIFT);
H A Dtest.c284 assert(maxindex > shift_maxindex(shift - RADIX_TREE_MAP_SHIFT));
H A Dtag_check.c95 tmp = 1<<RADIX_TREE_MAP_SHIFT;
/linux-master/include/linux/
H A Dradix-tree.h63 #define RADIX_TREE_MAP_SHIFT XA_CHUNK_SHIFT macro
64 #define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT)
72 RADIX_TREE_MAP_SHIFT))
/linux-master/lib/
H A Dradix-tree.c56 RADIX_TREE_MAP_SHIFT))
398 return node->shift + RADIX_TREE_MAP_SHIFT;
418 maxshift += RADIX_TREE_MAP_SHIFT;
458 shift += RADIX_TREE_MAP_SHIFT;
461 return maxshift + RADIX_TREE_MAP_SHIFT;
621 shift -= RADIX_TREE_MAP_SHIFT;
1168 * because RADIX_TREE_MAP_SHIFT < BITS_PER_LONG.
1500 shift = RADIX_TREE_MAP_SHIFT;
1503 shift -= RADIX_TREE_MAP_SHIFT;

Completed in 134 milliseconds