radix tree test suite: handle exceptional entries
item_kill_tree() assumes that everything in the tree is a pointer to a struct item, which is annoying when testing the behaviour of exceptional entries. Fix it to delete exceptional entries on the assumption they don't need to be freed. Link: http://lkml.kernel.org/r/1480369871-5271-45-git-send-email-mawilcox@linuxonhyperv.com Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com> Tested-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com> Cc: Konstantin Khlebnikov <koct9i@gmail.com> Cc: Ross Zwisler <ross.zwisler@linux.intel.com> Cc: Matthew Wilcox <mawilcox@microsoft.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
parent
af1c5cca90
commit
3ad75f8a1d
|
@ -200,9 +200,16 @@ void verify_tag_consistency(struct radix_tree_root *root, unsigned int tag)
|
|||
|
||||
void item_kill_tree(struct radix_tree_root *root)
|
||||
{
|
||||
struct radix_tree_iter iter;
|
||||
void **slot;
|
||||
struct item *items[32];
|
||||
int nfound;
|
||||
|
||||
radix_tree_for_each_slot(slot, root, &iter, 0) {
|
||||
if (radix_tree_exceptional_entry(*slot))
|
||||
radix_tree_delete(root, iter.index);
|
||||
}
|
||||
|
||||
while ((nfound = radix_tree_gang_lookup(root, (void **)items, 0, 32))) {
|
||||
int i;
|
||||
|
||||
|
|
Loading…
Reference in New Issue