From: Matthew Wilcox <mawil...@microsoft.com>
The only user of this functionality was the page cache, and it's now
been converted to the XArray.
Signed-off-by: Matthew Wilcox <mawil...@microsoft.com>
---
include/linux/radix-tree.h | 4 +---
lib/idr.c | 2 +-
lib/radix-tree.c | 25 ++++++++-----------------
tools/testing/radix-tree/multiorder.c | 2 +-
4 files changed, 11 insertions(+), 22 deletions(-)
diff --git a/include/linux/radix-tree.h b/include/linux/radix-tree.h
index 3f0cecc6122c..ceff6856470a 100644
--- a/include/linux/radix-tree.h
+++ b/include/linux/radix-tree.h
@@ -245,10 +245,8 @@ void *__radix_tree_lookup(const struct radix_tree_root *,
unsigned long index,
void *radix_tree_lookup(const struct radix_tree_root *, unsigned long);
void __rcu **radix_tree_lookup_slot(const struct radix_tree_root *,
unsigned long index);
-typedef void (*radix_tree_update_node_t)(struct radix_tree_node *);
void __radix_tree_replace(struct radix_tree_root *, struct radix_tree_node *,
- void __rcu **slot, void *entry,
- radix_tree_update_node_t update_node);
+ void __rcu **slot, void *entry);
void radix_tree_iter_replace(struct radix_tree_root *,
const struct radix_tree_iter *, void __rcu **slot, void *entry);
void radix_tree_replace_slot(struct radix_tree_root *,
diff --git a/lib/idr.c b/lib/idr.c
index 696f9df87e4e..7d1e7a9f8702 100644
--- a/lib/idr.c
+++ b/lib/idr.c
@@ -304,7 +304,7 @@ void *idr_replace(struct idr *idr, void *ptr, unsigned long
id)
if (!slot || radix_tree_tag_get(&idr->idr_rt, id, IDR_FREE))
return ERR_PTR(-ENOENT);
- __radix_tree_replace(&idr->idr_rt, node, slot, ptr, NULL);
+ __radix_tree_replace(&idr->idr_rt, node, slot, ptr);
return entry;
}
diff --git a/lib/radix-tree.c b/lib/radix-tree.c
index 5a1f2b052194..f15b9ee000b8 100644
--- a/lib/radix-tree.c
+++ b/lib/radix-tree.c
@@ -540,8 +540,7 @@ static int radix_tree_extend(struct radix_tree_root *root,
gfp_t gfp,
* radix_tree_shrink - shrink radix tree to minimum height
* @root radix tree root
*/
-static inline bool radix_tree_shrink(struct radix_tree_root *root,
- radix_tree_update_node_t update_node)
+static inline bool radix_tree_shrink(struct radix_tree_root *root)
{
bool shrunk = false;
@@ -601,8 +600,6 @@ static inline bool radix_tree_shrink(struct radix_tree_root
*root,
node->count = 0;
if (!radix_tree_is_internal_node(child)) {
node->slots[0] = (void __rcu *)RADIX_TREE_RETRY;
- if (update_node)
- update_node(node);
}
WARN_ON_ONCE(!list_empty(&node->private_list));
@@ -614,8 +611,7 @@ static inline bool radix_tree_shrink(struct radix_tree_root
*root,
}
static bool delete_node(struct radix_tree_root *root,
- struct radix_tree_node *node,
- radix_tree_update_node_t update_node)
+ struct radix_tree_node *node)
{
bool deleted = false;
@@ -625,7 +621,7 @@ static bool delete_node(struct radix_tree_root *root,
if (node->count) {
if (node_to_entry(node) ==
rcu_dereference_raw(root->xa_head))
- deleted |= radix_tree_shrink(root, update_node);
+ deleted |= radix_tree_shrink(root);
return deleted;
}
@@ -1030,15 +1026,13 @@ static int calculate_count(struct radix_tree_root *root,
* @node: pointer to tree node
* @slot: pointer to slot in @node
* @item: new item to store in the slot.
- * @update_node: callback for changing leaf nodes
*
* For use with __radix_tree_lookup(). Caller must hold tree write locked
* across slot lookup and replacement.
*/
void __radix_tree_replace(struct radix_tree_root *root,
struct radix_tree_node *node,
- void __rcu **slot, void *item,
- radix_tree_update_node_t update_node)
+ void __rcu **slot, void *item)
{
void *old = rcu_dereference_raw(*slot);
int values = !!xa_is_value(item) - !!xa_is_value(old);
@@ -1056,10 +1050,7 @@ void __radix_tree_replace(struct radix_tree_root *root,
if (!node)
return;
- if (update_node)
- update_node(node);
-
- delete_node(root, node, update_node);
+ delete_node(root, node);
}
/**
@@ -1081,7 +1072,7 @@ void __radix_tree_replace(struct radix_tree_root *root,
void radix_tree_replace_slot(struct radix_tree_root *root,
void __rcu **slot, void *item)
{
- __radix_tree_replace(root, NULL, slot, item, NULL);
+ __radix_tree_replace(root, NULL, slot, item);
}
EXPORT_SYMBOL(radix_tree_replace_slot);
@@ -1098,7 +1089,7 @@ void radix_tree_iter_replace(struct radix_tree_root *root,
const struct radix_tree_iter *iter,
void __rcu **slot, void *item)
{
- __radix_tree_replace(root, iter->node, slot, item, NULL);
+ __radix_tree_replace(root, iter->node, slot, item);
}
static void node_tag_set(struct radix_tree_root *root,
@@ -1648,7 +1639,7 @@ static bool __radix_tree_delete(struct radix_tree_root
*root,
node_tag_clear(root, node, tag, offset);
replace_slot(slot, NULL, node, -1, values);
- return node && delete_node(root, node, NULL);
+ return node && delete_node(root, node);
}
/**
diff --git a/tools/testing/radix-tree/multiorder.c
b/tools/testing/radix-tree/multiorder.c
index 146b490d5823..26212bd33c9d 100644
--- a/tools/testing/radix-tree/multiorder.c
+++ b/tools/testing/radix-tree/multiorder.c
@@ -372,7 +372,7 @@ static void multiorder_account(void)
__radix_tree_insert(&tree, 1 << 5, 5, xa_mk_value(5));
__radix_tree_lookup(&tree, 1 << 5, &node, &slot);
assert(node->count == node->nr_values * 2);
- __radix_tree_replace(&tree, node, slot, NULL, NULL);
+ __radix_tree_replace(&tree, node, slot, NULL);
assert(node->nr_values == 0);
item_kill_tree(&tree);
--
2.17.0
------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________
Linux-f2fs-devel mailing list
Linux-f2fs-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/linux-f2fs-devel
