Loading lib/radix-tree.c +0 −8 Original line number Diff line number Diff line Loading @@ -55,14 +55,6 @@ struct kmem_cache *radix_tree_node_cachep; RADIX_TREE_MAP_SHIFT)) #define IDR_PRELOAD_SIZE (IDR_MAX_PATH * 2 - 1) /* * The IDA is even shorter since it uses a bitmap at the last level. */ #define IDA_INDEX_BITS (8 * sizeof(int) - 1 - ilog2(IDA_BITMAP_BITS)) #define IDA_MAX_PATH (DIV_ROUND_UP(IDA_INDEX_BITS, \ RADIX_TREE_MAP_SHIFT)) #define IDA_PRELOAD_SIZE (IDA_MAX_PATH * 2 - 1) /* * Per-cpu pool of preloaded nodes */ Loading Loading
lib/radix-tree.c +0 −8 Original line number Diff line number Diff line Loading @@ -55,14 +55,6 @@ struct kmem_cache *radix_tree_node_cachep; RADIX_TREE_MAP_SHIFT)) #define IDR_PRELOAD_SIZE (IDR_MAX_PATH * 2 - 1) /* * The IDA is even shorter since it uses a bitmap at the last level. */ #define IDA_INDEX_BITS (8 * sizeof(int) - 1 - ilog2(IDA_BITMAP_BITS)) #define IDA_MAX_PATH (DIV_ROUND_UP(IDA_INDEX_BITS, \ RADIX_TREE_MAP_SHIFT)) #define IDA_PRELOAD_SIZE (IDA_MAX_PATH * 2 - 1) /* * Per-cpu pool of preloaded nodes */ Loading