lkml.org 
[lkml]   [2016]   [Apr]   [14]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    Patch in this message
    /
    From
    Subject[PATCH v2 12/29] radix-tree: Remove restriction on multi-order entries
    Date
    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>
    ---
    lib/radix-tree.c | 2 --
    1 file changed, 2 deletions(-)

    diff --git a/lib/radix-tree.c b/lib/radix-tree.c
    index b3364b9..6900f7b 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
    \
     
     \ /
      Last update: 2016-04-14 16:41    [W:3.008 / U:0.176 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site