include/linux/radix-tree.h

64

#define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT)

include/linux/radix-tree.h

72

RADIX_TREE_MAP_SHIFT))

lib/radix-tree.c

1500

shift = RADIX_TREE_MAP_SHIFT;

lib/radix-tree.c

1503

shift -= RADIX_TREE_MAP_SHIFT;

lib/radix-tree.c

398

return node->shift + RADIX_TREE_MAP_SHIFT;

lib/radix-tree.c

418

maxshift += RADIX_TREE_MAP_SHIFT;

lib/radix-tree.c

458

shift += RADIX_TREE_MAP_SHIFT;

lib/radix-tree.c

461

return maxshift + RADIX_TREE_MAP_SHIFT;

lib/radix-tree.c

56

RADIX_TREE_MAP_SHIFT))

lib/radix-tree.c

621

shift -= RADIX_TREE_MAP_SHIFT;

tools/testing/radix-tree/benchmark.c

145

printv(1, "RADIX_TREE_MAP_SHIFT = %d\n", RADIX_TREE_MAP_SHIFT);

tools/testing/radix-tree/multiorder.c

167

unsigned int order = RADIX_TREE_MAP_SHIFT - 1;

tools/testing/radix-tree/multiorder.c

223

item_insert_order(tree, 3 << RADIX_TREE_MAP_SHIFT, 0);

tools/testing/radix-tree/multiorder.c

224

item_insert_order(tree, 2 << RADIX_TREE_MAP_SHIFT, 0);

tools/testing/radix-tree/multiorder.c

226

for (order = 1; order < RADIX_TREE_MAP_SHIFT; order++) {

tools/testing/radix-tree/multiorder.c

227

unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) -

tools/testing/radix-tree/multiorder.c

242

unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) - 1;

tools/testing/radix-tree/multiorder.c

246

unsigned long find_index = (2 << RADIX_TREE_MAP_SHIFT) + 1;

tools/testing/radix-tree/tag_check.c

95

tmp = 1<<RADIX_TREE_MAP_SHIFT;

tools/testing/radix-tree/test.c

284

assert(maxindex > shift_maxindex(shift - RADIX_TREE_MAP_SHIFT));