Commit b66b5a48 authored by Matthew Wilcox's avatar Matthew Wilcox

radix tree tests: Convert item_delete_rcu to XArray

In preparation for the removal of the multiorder radix tree code,
convert item_delete_rcu() to use the XArray so it can still be called
for XArrays containing multi-index entries.
Signed-off-by: default avatarMatthew Wilcox <willy@infradead.org>
parent ccc89e30
...@@ -76,9 +76,9 @@ static void item_free_rcu(struct rcu_head *head) ...@@ -76,9 +76,9 @@ static void item_free_rcu(struct rcu_head *head)
free(item); free(item);
} }
int item_delete_rcu(struct radix_tree_root *root, unsigned long index) int item_delete_rcu(struct xarray *xa, unsigned long index)
{ {
struct item *item = radix_tree_delete(root, index); struct item *item = xa_erase(xa, index);
if (item) { if (item) {
item_sanity(item, index); item_sanity(item, index);
......
...@@ -15,7 +15,7 @@ int item_insert(struct radix_tree_root *root, unsigned long index); ...@@ -15,7 +15,7 @@ int item_insert(struct radix_tree_root *root, unsigned long index);
void item_sanity(struct item *item, unsigned long index); void item_sanity(struct item *item, unsigned long index);
void item_free(struct item *item, unsigned long index); void item_free(struct item *item, unsigned long index);
int item_delete(struct radix_tree_root *root, unsigned long index); int item_delete(struct radix_tree_root *root, unsigned long index);
int item_delete_rcu(struct radix_tree_root *root, unsigned long index); int item_delete_rcu(struct xarray *xa, unsigned long index);
struct item *item_lookup(struct radix_tree_root *root, unsigned long index); struct item *item_lookup(struct radix_tree_root *root, unsigned long index);
void item_check_present(struct radix_tree_root *root, unsigned long index); void item_check_present(struct radix_tree_root *root, unsigned long index);
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment