xarray: Add XArray unconditional store operations
authorMatthew Wilcox <willy@infradead.org>
Fri, 10 Nov 2017 20:15:08 +0000 (15:15 -0500)
committerMatthew Wilcox <willy@infradead.org>
Sun, 21 Oct 2018 14:45:57 +0000 (10:45 -0400)
commit58d6ea3085f2e53714810a513c61629f6d2be0a6
treeb4b73ea07cd720063fd3a2f8b063422c5a0e698a
parent9b89a0355144685a787b0dc5bcf7bdd6f2d02968
xarray: Add XArray unconditional store operations

xa_store() differs from radix_tree_insert() in that it will overwrite an
existing element in the array rather than returning an error.  This is
the behaviour which most users want, and those that want more complex
behaviour generally want to use the xas family of routines anyway.

For memory allocation, xa_store() will first attempt to request memory
from the slab allocator; if memory is not immediately available, it will
drop the xa_lock and allocate memory, keeping a pointer in the xa_state.
It does not use the per-CPU cache, although those will continue to exist
until all radix tree users are converted to the xarray.

This patch also includes xa_erase() and __xa_erase() for a streamlined
way to store NULL.  Since there is no need to allocate memory in order
to store a NULL in the XArray, we do not need to trouble the user with
deciding what memory allocation flags to use.

Signed-off-by: Matthew Wilcox <willy@infradead.org>
include/linux/xarray.h
lib/radix-tree.c
lib/test_xarray.c
lib/xarray.c
tools/include/linux/bitmap.h
tools/include/linux/spinlock.h
tools/testing/radix-tree/Makefile
tools/testing/radix-tree/bitmap.c [new file with mode: 0644]
tools/testing/radix-tree/linux/kernel.h
tools/testing/radix-tree/linux/lockdep.h [new file with mode: 0644]