Searched refs:RADIX_TREE_MAP_SHIFT (Results 1 – 7 of 7) sorted by relevance
70 #ifndef RADIX_TREE_MAP_SHIFT71 #define RADIX_TREE_MAP_SHIFT (CONFIG_BASE_SMALL ? 4 : 6) macro74 #define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT)82 RADIX_TREE_MAP_SHIFT))
70 RADIX_TREE_MAP_SHIFT))78 RADIX_TREE_MAP_SHIFT))541 unsigned top = 1 << (old_order % RADIX_TREE_MAP_SHIFT); in radix_tree_split_preload()542 unsigned layers = (old_order / RADIX_TREE_MAP_SHIFT) - in radix_tree_split_preload()543 (new_order / RADIX_TREE_MAP_SHIFT); in radix_tree_split_preload()577 nr_subtrees >>= RADIX_TREE_MAP_SHIFT; in radix_tree_maybe_preload_order()610 return node->shift + RADIX_TREE_MAP_SHIFT; in radix_tree_load_root()630 maxshift += RADIX_TREE_MAP_SHIFT; in radix_tree_extend()670 shift += RADIX_TREE_MAP_SHIFT; in radix_tree_extend()673 return maxshift + RADIX_TREE_MAP_SHIFT; in radix_tree_extend()[all …]
256 int height = order[i] / RADIX_TREE_MAP_SHIFT; in multiorder_iteration()257 int shift = height * RADIX_TREE_MAP_SHIFT; in multiorder_iteration()633 unsigned int order = RADIX_TREE_MAP_SHIFT - 1; in creator_func()700 multiorder_shrink((1UL << (i + RADIX_TREE_MAP_SHIFT)), i); in multiorder_checks()
241 printv(1, "RADIX_TREE_MAP_SHIFT = %d\n", RADIX_TREE_MAP_SHIFT); in benchmark()
331 assert(maxindex > shift_maxindex(shift - RADIX_TREE_MAP_SHIFT)); in tree_verify_min_height()
95 tmp = 1<<RADIX_TREE_MAP_SHIFT; in contract_checks()
400 max_nodes = cache >> (RADIX_TREE_MAP_SHIFT - 3); in count_shadow_nodes()
