Now that sibling pointers are handled explicitly, there is no purpose served by restricting the order to be >= RADIX_TREE_MAP_SHIFT.
Signed-off-by: Matthew Wilcox <wi...@linux.intel.com> Reviewed-by: Ross Zwisler <ross.zwis...@linux.intel.com> --- lib/radix-tree.c | 2 -- 1 file changed, 2 deletions(-) diff --git a/lib/radix-tree.c b/lib/radix-tree.c index 554986599c63..f2a314cf42cc 100644 --- a/lib/radix-tree.c +++ b/lib/radix-tree.c @@ -483,8 +483,6 @@ int __radix_tree_create(struct radix_tree_root *root, unsigned long index, unsigned int height, shift, offset; int error; - BUG_ON((0 < order) && (order < RADIX_TREE_MAP_SHIFT)); - /* Make sure the tree is high enough. */ if (index > radix_tree_maxindex(root->height)) { error = radix_tree_extend(root, index, order); -- 2.8.0.rc3