shmem: Convert shmem_alloc_hugepage to XArray

xa_find() is a slightly easier API to use than
radix_tree_gang_lookup_slot() because it contains its own RCU locking.
This commit removes the last user of radix_tree_gang_lookup_slot()
so remove the function too.

Signed-off-by: Matthew Wilcox <willy@infradead.org>

1 files changed, 1 insertions, 43 deletions

diff --git a/lib/radix-tree.c b/lib/radix-tree.c
index 8a58051eb5b3..2f9c0e45eeb7 100644
--- a/lib/radix-tree.c
+++ b/lib/radix-tree.c
@@ -1097,7 +1097,7 @@ void __radix_tree_replace(struct radix_tree_root *root,
  * @slot:       pointer to slot
  * @item:       new item to store in the slot.
  *
- * For use with radix_tree_lookup_slot(), radix_tree_gang_lookup_slot(),
+ * For use with radix_tree_lookup_slot() and
  * radix_tree_gang_lookup_tag_slot().  Caller must hold tree write locked
  * across slot lookup and replacement.
  *
@@ -1732,48 +1732,6 @@ radix_tree_gang_lookup(const struct radix_tree_root *root, void **results,
 EXPORT_SYMBOL(radix_tree_gang_lookup);
 
 /**
- *      radix_tree_gang_lookup_slot - perform multiple slot lookup on radix tree
- *      @root:          radix tree root
- *      @results:       where the results of the lookup are placed
- *      @indices:       where their indices should be placed (but usually NULL)
- *      @first_index:   start the lookup from this key
- *      @max_items:     place up to this many items at *results
- *
- *      Performs an index-ascending scan of the tree for present items.  Places
- *      their slots at *@results and returns the number of items which were
- *      placed at *@results.
- *
- *      The implementation is naive.
- *
- *      Like radix_tree_gang_lookup as far as RCU and locking goes. Slots must
- *      be dereferenced with radix_tree_deref_slot, and if using only RCU
- *      protection, radix_tree_deref_slot may fail requiring a retry.
- */
-unsigned int
-radix_tree_gang_lookup_slot(const struct radix_tree_root *root,
-                        void __rcu ***results, unsigned long *indices,
-                        unsigned long first_index, unsigned int max_items)
-{
-        struct radix_tree_iter iter;
-        void __rcu **slot;
-        unsigned int ret = 0;
-
-        if (unlikely(!max_items))
-                return 0;
-
-        radix_tree_for_each_slot(slot, root, &iter, first_index) {
-                results[ret] = slot;
-                if (indices)
-                        indices[ret] = iter.index;
-                if (++ret == max_items)
-                        break;
-        }
-
-        return ret;
-}
-EXPORT_SYMBOL(radix_tree_gang_lookup_slot);
-
-/**
  *      radix_tree_gang_lookup_tag - perform multiple lookup on a radix tree
  *                                   based on a tag
  *      @root:          radix tree root