diff options
| author | Matthew Wilcox <willy@linux.intel.com> | 2016-05-20 17:02:05 -0700 |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2016-05-20 17:58:30 -0700 |
| commit | aa5475760235672f316fbf29cdfb82a75016dbdf (patch) | |
| tree | 44f197dfda6d8911fa502ddaa03878ee4f010126 /lib/radix-tree.c | |
| parent | 29e0967c2f66771f654cef7168c90a53737abcdf (diff) | |
| download | linux-stable-aa5475760235672f316fbf29cdfb82a75016dbdf.tar.gz linux-stable-aa5475760235672f316fbf29cdfb82a75016dbdf.tar.bz2 linux-stable-aa5475760235672f316fbf29cdfb82a75016dbdf.zip | |
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>
Diffstat (limited to 'lib/radix-tree.c')
| -rw-r--r-- | lib/radix-tree.c | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/lib/radix-tree.c b/lib/radix-tree.c index b3364b9ecc83..6900f7b67c49 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); |