radix-tree: remove restriction on multi-order entries
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 <willy@linux.intel.com> Reviewed-by: Ross Zwisler <ross.zwisler@linux.intel.com> Cc: Konstantin Khlebnikov <koct9i@gmail.com> Cc: Kirill Shutemov <kirill.shutemov@linux.intel.com> Cc: Jan Kara <jack@suse.com> Cc: Neil Brown <neilb@suse.de> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
parent
29e0967c2f
commit
aa54757602
|
@ -483,8 +483,6 @@ int __radix_tree_create(struct radix_tree_root *root, unsigned long index,
|
||||||
unsigned int height, shift, offset;
|
unsigned int height, shift, offset;
|
||||||
int error;
|
int error;
|
||||||
|
|
||||||
BUG_ON((0 < order) && (order < RADIX_TREE_MAP_SHIFT));
|
|
||||||
|
|
||||||
/* Make sure the tree is high enough. */
|
/* Make sure the tree is high enough. */
|
||||||
if (index > radix_tree_maxindex(root->height)) {
|
if (index > radix_tree_maxindex(root->height)) {
|
||||||
error = radix_tree_extend(root, index, order);
|
error = radix_tree_extend(root, index, order);
|
||||||
|
|
Loading…
Reference in New Issue