2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2001 Momchil Velikov
|
|
|
|
* Portions Copyright (C) 2001 Christoph Hellwig
|
2008-07-04 10:59:22 -06:00
|
|
|
* Copyright (C) 2005 SGI, Christoph Lameter
|
2006-12-06 21:33:44 -07:00
|
|
|
* Copyright (C) 2006 Nick Piggin
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License as
|
|
|
|
* published by the Free Software Foundation; either version 2, or (at
|
|
|
|
* your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful, but
|
|
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/radix-tree.h>
|
|
|
|
#include <linux/percpu.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/notifier.h>
|
|
|
|
#include <linux/cpu.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/bitops.h>
|
2006-12-06 21:33:44 -07:00
|
|
|
#include <linux/rcupdate.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
2006-06-23 03:03:22 -06:00
|
|
|
#define RADIX_TREE_MAP_SHIFT (CONFIG_BASE_SMALL ? 4 : 6)
|
2005-04-16 16:20:36 -06:00
|
|
|
#else
|
|
|
|
#define RADIX_TREE_MAP_SHIFT 3 /* For more stressful testing */
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT)
|
|
|
|
#define RADIX_TREE_MAP_MASK (RADIX_TREE_MAP_SIZE-1)
|
|
|
|
|
|
|
|
#define RADIX_TREE_TAG_LONGS \
|
|
|
|
((RADIX_TREE_MAP_SIZE + BITS_PER_LONG - 1) / BITS_PER_LONG)
|
|
|
|
|
|
|
|
struct radix_tree_node {
|
2006-12-06 21:33:44 -07:00
|
|
|
unsigned int height; /* Height from the bottom */
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned int count;
|
2006-12-06 21:33:44 -07:00
|
|
|
struct rcu_head rcu_head;
|
2005-04-16 16:20:36 -06:00
|
|
|
void *slots[RADIX_TREE_MAP_SIZE];
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned long tags[RADIX_TREE_MAX_TAGS][RADIX_TREE_TAG_LONGS];
|
2005-04-16 16:20:36 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
struct radix_tree_path {
|
2005-09-06 16:16:46 -06:00
|
|
|
struct radix_tree_node *node;
|
2005-04-16 16:20:36 -06:00
|
|
|
int offset;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define RADIX_TREE_INDEX_BITS (8 /* CHAR_BIT */ * sizeof(unsigned long))
|
2007-10-16 02:24:49 -06:00
|
|
|
#define RADIX_TREE_MAX_PATH (DIV_ROUND_UP(RADIX_TREE_INDEX_BITS, \
|
|
|
|
RADIX_TREE_MAP_SHIFT))
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-10-16 02:24:49 -06:00
|
|
|
/*
|
|
|
|
* The height_to_maxindex array needs to be one deeper than the maximum
|
|
|
|
* path as height 0 holds only 1 entry.
|
|
|
|
*/
|
|
|
|
static unsigned long height_to_maxindex[RADIX_TREE_MAX_PATH + 1] __read_mostly;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Radix tree node cache.
|
|
|
|
*/
|
2006-12-06 21:33:20 -07:00
|
|
|
static struct kmem_cache *radix_tree_node_cachep;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Per-cpu pool of preloaded nodes
|
|
|
|
*/
|
|
|
|
struct radix_tree_preload {
|
|
|
|
int nr;
|
|
|
|
struct radix_tree_node *nodes[RADIX_TREE_MAX_PATH];
|
|
|
|
};
|
2009-01-06 15:40:50 -07:00
|
|
|
static DEFINE_PER_CPU(struct radix_tree_preload, radix_tree_preloads) = { 0, };
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
static inline gfp_t root_gfp_mask(struct radix_tree_root *root)
|
|
|
|
{
|
|
|
|
return root->gfp_mask & __GFP_BITS_MASK;
|
|
|
|
}
|
|
|
|
|
radix-tree: fix small lockless radix-tree bug
We shrink a radix tree when its root node has only one child, in the left
most slot. The child becomes the new root node. To perform this
operation in a manner compatible with concurrent lockless lookups, we
atomically switch the root pointer from the parent to its child.
However a concurrent lockless lookup may now have loaded a pointer to the
parent (and is presently deciding what to do next). For this reason, we
also have to keep the parent node in a valid state after shrinking the
tree, until the next RCU grace period -- otherwise this lookup with the
parent pointer may not do the right thing. Notably, we need to keep the
child in the left most slot there in case that is requested by the lookup.
This is all pretty standard RCU stuff. It is worth repeating because in
my eagerness to obey the radix tree node constructor scheme, I had broken
it by zeroing the radix tree node before the grace period.
What could happen is that a lookup can load the parent pointer, then
decide it wants to follow the left most child slot, only to find the slot
contained NULL due to the concurrent shrinker having zeroed the parent
node before waiting for a grace period. The lookup would return a false
negative as a result.
Fix it by doing that clearing in the RCU callback. I would normally want
to rip out the constructor entirely, but radix tree nodes are one of those
places where they make sense (only few cachelines will be touched soon
after allocation).
This was never actually found in any lockless pagecache testing or by the
test harness, but by seeing the odd problem with my scalable vmap rewrite.
I have not tickled the test harness into reproducing it yet, but I'll
keep working at it.
Fortunately, it is not a problem anywhere lockless pagecache is used in
mainline kernels (pagecache probe is not a guarantee, and brd does not
have concurrent lookups and deletes).
Signed-off-by: Nick Piggin <npiggin@suse.de>
Acked-by: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: "Paul E. McKenney" <paulmck@us.ibm.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-06-12 16:21:52 -06:00
|
|
|
static inline void tag_set(struct radix_tree_node *node, unsigned int tag,
|
|
|
|
int offset)
|
|
|
|
{
|
|
|
|
__set_bit(offset, node->tags[tag]);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void tag_clear(struct radix_tree_node *node, unsigned int tag,
|
|
|
|
int offset)
|
|
|
|
{
|
|
|
|
__clear_bit(offset, node->tags[tag]);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int tag_get(struct radix_tree_node *node, unsigned int tag,
|
|
|
|
int offset)
|
|
|
|
{
|
|
|
|
return test_bit(offset, node->tags[tag]);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void root_tag_set(struct radix_tree_root *root, unsigned int tag)
|
|
|
|
{
|
|
|
|
root->gfp_mask |= (__force gfp_t)(1 << (tag + __GFP_BITS_SHIFT));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void root_tag_clear(struct radix_tree_root *root, unsigned int tag)
|
|
|
|
{
|
|
|
|
root->gfp_mask &= (__force gfp_t)~(1 << (tag + __GFP_BITS_SHIFT));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void root_tag_clear_all(struct radix_tree_root *root)
|
|
|
|
{
|
|
|
|
root->gfp_mask &= __GFP_BITS_MASK;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int root_tag_get(struct radix_tree_root *root, unsigned int tag)
|
|
|
|
{
|
|
|
|
return (__force unsigned)root->gfp_mask & (1 << (tag + __GFP_BITS_SHIFT));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Returns 1 if any slot in the node has this tag set.
|
|
|
|
* Otherwise returns 0.
|
|
|
|
*/
|
|
|
|
static inline int any_tag_set(struct radix_tree_node *node, unsigned int tag)
|
|
|
|
{
|
|
|
|
int idx;
|
|
|
|
for (idx = 0; idx < RADIX_TREE_TAG_LONGS; idx++) {
|
|
|
|
if (node->tags[tag][idx])
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* This assumes that the caller has performed appropriate preallocation, and
|
|
|
|
* that the caller has pinned this thread of control to the current CPU.
|
|
|
|
*/
|
|
|
|
static struct radix_tree_node *
|
|
|
|
radix_tree_node_alloc(struct radix_tree_root *root)
|
|
|
|
{
|
2008-02-04 23:29:10 -07:00
|
|
|
struct radix_tree_node *ret = NULL;
|
2006-06-23 03:03:22 -06:00
|
|
|
gfp_t gfp_mask = root_gfp_mask(root);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2008-02-04 23:29:10 -07:00
|
|
|
if (!(gfp_mask & __GFP_WAIT)) {
|
2005-04-16 16:20:36 -06:00
|
|
|
struct radix_tree_preload *rtp;
|
|
|
|
|
2008-02-04 23:29:10 -07:00
|
|
|
/*
|
|
|
|
* Provided the caller has preloaded here, we will always
|
|
|
|
* succeed in getting a node here (and never reach
|
|
|
|
* kmem_cache_alloc)
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
rtp = &__get_cpu_var(radix_tree_preloads);
|
|
|
|
if (rtp->nr) {
|
|
|
|
ret = rtp->nodes[rtp->nr - 1];
|
|
|
|
rtp->nodes[rtp->nr - 1] = NULL;
|
|
|
|
rtp->nr--;
|
|
|
|
}
|
|
|
|
}
|
2008-02-04 23:29:10 -07:00
|
|
|
if (ret == NULL)
|
2008-04-28 03:12:05 -06:00
|
|
|
ret = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask);
|
2008-02-04 23:29:10 -07:00
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
BUG_ON(radix_tree_is_indirect_ptr(ret));
|
2005-04-16 16:20:36 -06:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
static void radix_tree_node_rcu_free(struct rcu_head *head)
|
|
|
|
{
|
|
|
|
struct radix_tree_node *node =
|
|
|
|
container_of(head, struct radix_tree_node, rcu_head);
|
radix-tree: fix small lockless radix-tree bug
We shrink a radix tree when its root node has only one child, in the left
most slot. The child becomes the new root node. To perform this
operation in a manner compatible with concurrent lockless lookups, we
atomically switch the root pointer from the parent to its child.
However a concurrent lockless lookup may now have loaded a pointer to the
parent (and is presently deciding what to do next). For this reason, we
also have to keep the parent node in a valid state after shrinking the
tree, until the next RCU grace period -- otherwise this lookup with the
parent pointer may not do the right thing. Notably, we need to keep the
child in the left most slot there in case that is requested by the lookup.
This is all pretty standard RCU stuff. It is worth repeating because in
my eagerness to obey the radix tree node constructor scheme, I had broken
it by zeroing the radix tree node before the grace period.
What could happen is that a lookup can load the parent pointer, then
decide it wants to follow the left most child slot, only to find the slot
contained NULL due to the concurrent shrinker having zeroed the parent
node before waiting for a grace period. The lookup would return a false
negative as a result.
Fix it by doing that clearing in the RCU callback. I would normally want
to rip out the constructor entirely, but radix tree nodes are one of those
places where they make sense (only few cachelines will be touched soon
after allocation).
This was never actually found in any lockless pagecache testing or by the
test harness, but by seeing the odd problem with my scalable vmap rewrite.
I have not tickled the test harness into reproducing it yet, but I'll
keep working at it.
Fortunately, it is not a problem anywhere lockless pagecache is used in
mainline kernels (pagecache probe is not a guarantee, and brd does not
have concurrent lookups and deletes).
Signed-off-by: Nick Piggin <npiggin@suse.de>
Acked-by: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: "Paul E. McKenney" <paulmck@us.ibm.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-06-12 16:21:52 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* must only free zeroed nodes into the slab. radix_tree_shrink
|
|
|
|
* can leave us with a non-NULL entry in the first slot, so clear
|
|
|
|
* that here to make sure.
|
|
|
|
*/
|
|
|
|
tag_clear(node, 0, 0);
|
|
|
|
tag_clear(node, 1, 0);
|
|
|
|
node->slots[0] = NULL;
|
|
|
|
node->count = 0;
|
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
kmem_cache_free(radix_tree_node_cachep, node);
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
static inline void
|
|
|
|
radix_tree_node_free(struct radix_tree_node *node)
|
|
|
|
{
|
2006-12-06 21:33:44 -07:00
|
|
|
call_rcu(&node->rcu_head, radix_tree_node_rcu_free);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Load up this CPU's radix_tree_node buffer with sufficient objects to
|
|
|
|
* ensure that the addition of a single element in the tree cannot fail. On
|
|
|
|
* success, return zero, with preemption disabled. On error, return -ENOMEM
|
|
|
|
* with preemption not disabled.
|
FS-Cache: Use radix tree preload correctly in tracking of pages to be stored
__fscache_write_page() attempts to load the radix tree preallocation pool for
the CPU it is on before calling radix_tree_insert(), as the insertion must be
done inside a pair of spinlocks.
Use of the preallocation pool, however, is contingent on the radix tree being
initialised without __GFP_WAIT specified. __fscache_acquire_cookie() was
passing GFP_NOFS to INIT_RADIX_TREE() - but that includes __GFP_WAIT.
The solution is to AND out __GFP_WAIT.
Additionally, the banner comment to radix_tree_preload() is altered to make
note of this prerequisite. Possibly there should be a WARN_ON() too.
Without this fix, I have seen the following recursive deadlock caused by
radix_tree_insert() attempting to allocate memory inside the spinlocked
region, which resulted in FS-Cache being called back into to release memory -
which required the spinlock already held.
=============================================
[ INFO: possible recursive locking detected ]
2.6.32-rc6-cachefs #24
---------------------------------------------
nfsiod/7916 is trying to acquire lock:
(&cookie->lock){+.+.-.}, at: [<ffffffffa0076872>] __fscache_uncache_page+0xdb/0x160 [fscache]
but task is already holding lock:
(&cookie->lock){+.+.-.}, at: [<ffffffffa0076acc>] __fscache_write_page+0x15c/0x3f3 [fscache]
other info that might help us debug this:
5 locks held by nfsiod/7916:
#0: (nfsiod){+.+.+.}, at: [<ffffffff81048290>] worker_thread+0x19a/0x2e2
#1: (&task->u.tk_work#2){+.+.+.}, at: [<ffffffff81048290>] worker_thread+0x19a/0x2e2
#2: (&cookie->lock){+.+.-.}, at: [<ffffffffa0076acc>] __fscache_write_page+0x15c/0x3f3 [fscache]
#3: (&object->lock#2){+.+.-.}, at: [<ffffffffa0076b07>] __fscache_write_page+0x197/0x3f3 [fscache]
#4: (&cookie->stores_lock){+.+...}, at: [<ffffffffa0076b0f>] __fscache_write_page+0x19f/0x3f3 [fscache]
stack backtrace:
Pid: 7916, comm: nfsiod Not tainted 2.6.32-rc6-cachefs #24
Call Trace:
[<ffffffff8105ac7f>] __lock_acquire+0x1649/0x16e3
[<ffffffff81059ded>] ? __lock_acquire+0x7b7/0x16e3
[<ffffffff8100e27d>] ? dump_trace+0x248/0x257
[<ffffffff8105ad70>] lock_acquire+0x57/0x6d
[<ffffffffa0076872>] ? __fscache_uncache_page+0xdb/0x160 [fscache]
[<ffffffff8135467c>] _spin_lock+0x2c/0x3b
[<ffffffffa0076872>] ? __fscache_uncache_page+0xdb/0x160 [fscache]
[<ffffffffa0076872>] __fscache_uncache_page+0xdb/0x160 [fscache]
[<ffffffffa0077eb7>] ? __fscache_check_page_write+0x0/0x71 [fscache]
[<ffffffffa00b4755>] nfs_fscache_release_page+0x86/0xc4 [nfs]
[<ffffffffa00907f0>] nfs_release_page+0x3c/0x41 [nfs]
[<ffffffff81087ffb>] try_to_release_page+0x32/0x3b
[<ffffffff81092c2b>] shrink_page_list+0x316/0x4ac
[<ffffffff81058a9b>] ? mark_held_locks+0x52/0x70
[<ffffffff8135451b>] ? _spin_unlock_irq+0x2b/0x31
[<ffffffff81093153>] shrink_inactive_list+0x392/0x67c
[<ffffffff81058a9b>] ? mark_held_locks+0x52/0x70
[<ffffffff810934ca>] shrink_list+0x8d/0x8f
[<ffffffff81093744>] shrink_zone+0x278/0x33c
[<ffffffff81052c70>] ? ktime_get_ts+0xad/0xba
[<ffffffff8109453b>] try_to_free_pages+0x22e/0x392
[<ffffffff8109184c>] ? isolate_pages_global+0x0/0x212
[<ffffffff8108e16b>] __alloc_pages_nodemask+0x3dc/0x5cf
[<ffffffff810ae24a>] cache_alloc_refill+0x34d/0x6c1
[<ffffffff811bcf74>] ? radix_tree_node_alloc+0x52/0x5c
[<ffffffff810ae929>] kmem_cache_alloc+0xb2/0x118
[<ffffffff811bcf74>] radix_tree_node_alloc+0x52/0x5c
[<ffffffff811bcfd5>] radix_tree_insert+0x57/0x19c
[<ffffffffa0076b53>] __fscache_write_page+0x1e3/0x3f3 [fscache]
[<ffffffffa00b4248>] __nfs_readpage_to_fscache+0x58/0x11e [nfs]
[<ffffffffa009bb77>] nfs_readpage_release+0x34/0x9b [nfs]
[<ffffffffa009c0d9>] nfs_readpage_release_full+0x32/0x4b [nfs]
[<ffffffffa0006cff>] rpc_release_calldata+0x12/0x14 [sunrpc]
[<ffffffffa0006e2d>] rpc_free_task+0x59/0x61 [sunrpc]
[<ffffffffa0006f03>] rpc_async_release+0x10/0x12 [sunrpc]
[<ffffffff810482e5>] worker_thread+0x1ef/0x2e2
[<ffffffff81048290>] ? worker_thread+0x19a/0x2e2
[<ffffffff81352433>] ? thread_return+0x3e/0x101
[<ffffffffa0006ef3>] ? rpc_async_release+0x0/0x12 [sunrpc]
[<ffffffff8104bff5>] ? autoremove_wake_function+0x0/0x34
[<ffffffff81058d25>] ? trace_hardirqs_on+0xd/0xf
[<ffffffff810480f6>] ? worker_thread+0x0/0x2e2
[<ffffffff8104bd21>] kthread+0x7a/0x82
[<ffffffff8100beda>] child_rip+0xa/0x20
[<ffffffff8100b87c>] ? restore_args+0x0/0x30
[<ffffffff8104c2b9>] ? add_wait_queue+0x15/0x44
[<ffffffff8104bca7>] ? kthread+0x0/0x82
[<ffffffff8100bed0>] ? child_rip+0x0/0x20
Signed-off-by: David Howells <dhowells@redhat.com>
2009-11-19 11:11:14 -07:00
|
|
|
*
|
|
|
|
* To make use of this facility, the radix tree must be initialised without
|
|
|
|
* __GFP_WAIT being passed to INIT_RADIX_TREE().
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2005-10-07 00:46:04 -06:00
|
|
|
int radix_tree_preload(gfp_t gfp_mask)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
struct radix_tree_preload *rtp;
|
|
|
|
struct radix_tree_node *node;
|
|
|
|
int ret = -ENOMEM;
|
|
|
|
|
|
|
|
preempt_disable();
|
|
|
|
rtp = &__get_cpu_var(radix_tree_preloads);
|
|
|
|
while (rtp->nr < ARRAY_SIZE(rtp->nodes)) {
|
|
|
|
preempt_enable();
|
2008-04-28 03:12:05 -06:00
|
|
|
node = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (node == NULL)
|
|
|
|
goto out;
|
|
|
|
preempt_disable();
|
|
|
|
rtp = &__get_cpu_var(radix_tree_preloads);
|
|
|
|
if (rtp->nr < ARRAY_SIZE(rtp->nodes))
|
|
|
|
rtp->nodes[rtp->nr++] = node;
|
|
|
|
else
|
|
|
|
kmem_cache_free(radix_tree_node_cachep, node);
|
|
|
|
}
|
|
|
|
ret = 0;
|
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
}
|
2007-07-14 00:05:04 -06:00
|
|
|
EXPORT_SYMBOL(radix_tree_preload);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Return the maximum key which can be store into a
|
|
|
|
* radix tree with height HEIGHT.
|
|
|
|
*/
|
|
|
|
static inline unsigned long radix_tree_maxindex(unsigned int height)
|
|
|
|
{
|
|
|
|
return height_to_maxindex[height];
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Extend a radix tree so it can store key @index.
|
|
|
|
*/
|
|
|
|
static int radix_tree_extend(struct radix_tree_root *root, unsigned long index)
|
|
|
|
{
|
|
|
|
struct radix_tree_node *node;
|
|
|
|
unsigned int height;
|
|
|
|
int tag;
|
|
|
|
|
|
|
|
/* Figure out what the height should be. */
|
|
|
|
height = root->height + 1;
|
|
|
|
while (index > radix_tree_maxindex(height))
|
|
|
|
height++;
|
|
|
|
|
|
|
|
if (root->rnode == NULL) {
|
|
|
|
root->height = height;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
do {
|
2006-12-06 21:33:44 -07:00
|
|
|
unsigned int newheight;
|
2005-04-16 16:20:36 -06:00
|
|
|
if (!(node = radix_tree_node_alloc(root)))
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
/* Increase the height. */
|
2007-10-16 02:24:42 -06:00
|
|
|
node->slots[0] = radix_tree_indirect_to_ptr(root->rnode);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* Propagate the aggregated tag info into the new root */
|
2006-03-25 04:08:05 -07:00
|
|
|
for (tag = 0; tag < RADIX_TREE_MAX_TAGS; tag++) {
|
2006-06-23 03:03:22 -06:00
|
|
|
if (root_tag_get(root, tag))
|
2005-04-16 16:20:36 -06:00
|
|
|
tag_set(node, tag, 0);
|
|
|
|
}
|
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
newheight = root->height+1;
|
|
|
|
node->height = newheight;
|
2005-04-16 16:20:36 -06:00
|
|
|
node->count = 1;
|
2007-10-16 02:24:42 -06:00
|
|
|
node = radix_tree_ptr_to_indirect(node);
|
2006-12-06 21:33:44 -07:00
|
|
|
rcu_assign_pointer(root->rnode, node);
|
|
|
|
root->height = newheight;
|
2005-04-16 16:20:36 -06:00
|
|
|
} while (height > root->height);
|
|
|
|
out:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_insert - insert into a radix tree
|
|
|
|
* @root: radix tree root
|
|
|
|
* @index: index key
|
|
|
|
* @item: item to insert
|
|
|
|
*
|
|
|
|
* Insert an item into the radix tree at position @index.
|
|
|
|
*/
|
|
|
|
int radix_tree_insert(struct radix_tree_root *root,
|
|
|
|
unsigned long index, void *item)
|
|
|
|
{
|
2005-09-06 16:16:46 -06:00
|
|
|
struct radix_tree_node *node = NULL, *slot;
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned int height, shift;
|
|
|
|
int offset;
|
|
|
|
int error;
|
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
BUG_ON(radix_tree_is_indirect_ptr(item));
|
2006-12-06 21:33:44 -07:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/* Make sure the tree is high enough. */
|
2006-06-23 03:03:22 -06:00
|
|
|
if (index > radix_tree_maxindex(root->height)) {
|
2005-04-16 16:20:36 -06:00
|
|
|
error = radix_tree_extend(root, index);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
slot = radix_tree_indirect_to_ptr(root->rnode);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
height = root->height;
|
|
|
|
shift = (height-1) * RADIX_TREE_MAP_SHIFT;
|
|
|
|
|
|
|
|
offset = 0; /* uninitialised var warning */
|
2006-06-23 03:03:22 -06:00
|
|
|
while (height > 0) {
|
2005-09-06 16:16:46 -06:00
|
|
|
if (slot == NULL) {
|
2005-04-16 16:20:36 -06:00
|
|
|
/* Have to add a child node. */
|
2005-09-06 16:16:46 -06:00
|
|
|
if (!(slot = radix_tree_node_alloc(root)))
|
2005-04-16 16:20:36 -06:00
|
|
|
return -ENOMEM;
|
2006-12-06 21:33:44 -07:00
|
|
|
slot->height = height;
|
2005-09-06 16:16:46 -06:00
|
|
|
if (node) {
|
2006-12-06 21:33:44 -07:00
|
|
|
rcu_assign_pointer(node->slots[offset], slot);
|
2005-04-16 16:20:36 -06:00
|
|
|
node->count++;
|
2005-09-06 16:16:46 -06:00
|
|
|
} else
|
2007-10-16 02:24:42 -06:00
|
|
|
rcu_assign_pointer(root->rnode,
|
|
|
|
radix_tree_ptr_to_indirect(slot));
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Go a level down */
|
|
|
|
offset = (index >> shift) & RADIX_TREE_MAP_MASK;
|
2005-09-06 16:16:46 -06:00
|
|
|
node = slot;
|
|
|
|
slot = node->slots[offset];
|
2005-04-16 16:20:36 -06:00
|
|
|
shift -= RADIX_TREE_MAP_SHIFT;
|
|
|
|
height--;
|
2006-06-23 03:03:22 -06:00
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2005-09-06 16:16:46 -06:00
|
|
|
if (slot != NULL)
|
2005-04-16 16:20:36 -06:00
|
|
|
return -EEXIST;
|
2005-09-06 16:16:46 -06:00
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
if (node) {
|
|
|
|
node->count++;
|
2006-12-06 21:33:44 -07:00
|
|
|
rcu_assign_pointer(node->slots[offset], item);
|
2006-06-23 03:03:22 -06:00
|
|
|
BUG_ON(tag_get(node, 0, offset));
|
|
|
|
BUG_ON(tag_get(node, 1, offset));
|
|
|
|
} else {
|
2007-10-16 02:24:42 -06:00
|
|
|
rcu_assign_pointer(root->rnode, item);
|
2006-06-23 03:03:22 -06:00
|
|
|
BUG_ON(root_tag_get(root, 0));
|
|
|
|
BUG_ON(root_tag_get(root, 1));
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_insert);
|
|
|
|
|
2009-06-16 16:33:42 -06:00
|
|
|
/*
|
|
|
|
* is_slot == 1 : search for the slot.
|
|
|
|
* is_slot == 0 : search for the node.
|
2006-12-06 21:33:44 -07:00
|
|
|
*/
|
2009-06-16 16:33:42 -06:00
|
|
|
static void *radix_tree_lookup_element(struct radix_tree_root *root,
|
|
|
|
unsigned long index, int is_slot)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
unsigned int height, shift;
|
2006-12-06 21:33:44 -07:00
|
|
|
struct radix_tree_node *node, **slot;
|
2006-06-23 03:03:22 -06:00
|
|
|
|
2010-02-22 18:04:54 -07:00
|
|
|
node = rcu_dereference_raw(root->rnode);
|
2006-12-06 21:33:44 -07:00
|
|
|
if (node == NULL)
|
2005-04-16 16:20:36 -06:00
|
|
|
return NULL;
|
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
if (!radix_tree_is_indirect_ptr(node)) {
|
2006-12-06 21:33:44 -07:00
|
|
|
if (index > 0)
|
|
|
|
return NULL;
|
2009-06-16 16:33:42 -06:00
|
|
|
return is_slot ? (void *)&root->rnode : node;
|
2006-12-06 21:33:44 -07:00
|
|
|
}
|
2007-10-16 02:24:42 -06:00
|
|
|
node = radix_tree_indirect_to_ptr(node);
|
2006-12-06 21:33:44 -07:00
|
|
|
|
|
|
|
height = node->height;
|
|
|
|
if (index > radix_tree_maxindex(height))
|
|
|
|
return NULL;
|
2006-06-23 03:03:22 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
shift = (height-1) * RADIX_TREE_MAP_SHIFT;
|
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
do {
|
|
|
|
slot = (struct radix_tree_node **)
|
|
|
|
(node->slots + ((index>>shift) & RADIX_TREE_MAP_MASK));
|
2010-02-22 18:04:54 -07:00
|
|
|
node = rcu_dereference_raw(*slot);
|
2006-12-06 21:33:44 -07:00
|
|
|
if (node == NULL)
|
2005-04-16 16:20:36 -06:00
|
|
|
return NULL;
|
|
|
|
|
|
|
|
shift -= RADIX_TREE_MAP_SHIFT;
|
|
|
|
height--;
|
2006-12-06 21:33:44 -07:00
|
|
|
} while (height > 0);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2009-06-16 16:33:42 -06:00
|
|
|
return is_slot ? (void *)slot:node;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_lookup_slot - lookup a slot in a radix tree
|
|
|
|
* @root: radix tree root
|
|
|
|
* @index: index key
|
|
|
|
*
|
|
|
|
* Returns: the slot corresponding to the position @index in the
|
|
|
|
* radix tree @root. This is useful for update-if-exists operations.
|
|
|
|
*
|
|
|
|
* This function can be called under rcu_read_lock iff the slot is not
|
|
|
|
* modified by radix_tree_replace_slot, otherwise it must be called
|
|
|
|
* exclusive from other writers. Any dereference of the slot must be done
|
|
|
|
* using radix_tree_deref_slot.
|
|
|
|
*/
|
|
|
|
void **radix_tree_lookup_slot(struct radix_tree_root *root, unsigned long index)
|
|
|
|
{
|
|
|
|
return (void **)radix_tree_lookup_element(root, index, 1);
|
2005-11-07 01:59:29 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_lookup_slot);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_lookup - perform lookup operation on a radix tree
|
|
|
|
* @root: radix tree root
|
|
|
|
* @index: index key
|
|
|
|
*
|
|
|
|
* Lookup the item at the position @index in the radix tree @root.
|
2006-12-06 21:33:44 -07:00
|
|
|
*
|
|
|
|
* This function can be called under rcu_read_lock, however the caller
|
|
|
|
* must manage lifetimes of leaf nodes (eg. RCU may also be used to free
|
|
|
|
* them safely). No RCU barriers are required to access or modify the
|
|
|
|
* returned item, however.
|
2005-11-07 01:59:29 -07:00
|
|
|
*/
|
|
|
|
void *radix_tree_lookup(struct radix_tree_root *root, unsigned long index)
|
|
|
|
{
|
2009-06-16 16:33:42 -06:00
|
|
|
return radix_tree_lookup_element(root, index, 0);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_lookup);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_tag_set - set a tag on a radix tree node
|
|
|
|
* @root: radix tree root
|
|
|
|
* @index: index key
|
|
|
|
* @tag: tag index
|
|
|
|
*
|
2006-03-25 04:08:05 -07:00
|
|
|
* Set the search tag (which must be < RADIX_TREE_MAX_TAGS)
|
|
|
|
* corresponding to @index in the radix tree. From
|
2005-04-16 16:20:36 -06:00
|
|
|
* the root all the way down to the leaf node.
|
|
|
|
*
|
|
|
|
* Returns the address of the tagged item. Setting a tag on a not-present
|
|
|
|
* item is a bug.
|
|
|
|
*/
|
|
|
|
void *radix_tree_tag_set(struct radix_tree_root *root,
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned long index, unsigned int tag)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
unsigned int height, shift;
|
2005-09-06 16:16:46 -06:00
|
|
|
struct radix_tree_node *slot;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
height = root->height;
|
2006-06-23 03:03:25 -06:00
|
|
|
BUG_ON(index > radix_tree_maxindex(height));
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
slot = radix_tree_indirect_to_ptr(root->rnode);
|
2006-06-23 03:03:22 -06:00
|
|
|
shift = (height - 1) * RADIX_TREE_MAP_SHIFT;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
while (height > 0) {
|
|
|
|
int offset;
|
|
|
|
|
|
|
|
offset = (index >> shift) & RADIX_TREE_MAP_MASK;
|
2006-01-08 02:01:41 -07:00
|
|
|
if (!tag_get(slot, tag, offset))
|
|
|
|
tag_set(slot, tag, offset);
|
2005-09-06 16:16:46 -06:00
|
|
|
slot = slot->slots[offset];
|
|
|
|
BUG_ON(slot == NULL);
|
2005-04-16 16:20:36 -06:00
|
|
|
shift -= RADIX_TREE_MAP_SHIFT;
|
|
|
|
height--;
|
|
|
|
}
|
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
/* set the root's tag bit */
|
|
|
|
if (slot && !root_tag_get(root, tag))
|
|
|
|
root_tag_set(root, tag);
|
|
|
|
|
2005-09-06 16:16:46 -06:00
|
|
|
return slot;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_tag_set);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_tag_clear - clear a tag on a radix tree node
|
|
|
|
* @root: radix tree root
|
|
|
|
* @index: index key
|
|
|
|
* @tag: tag index
|
|
|
|
*
|
2006-03-25 04:08:05 -07:00
|
|
|
* Clear the search tag (which must be < RADIX_TREE_MAX_TAGS)
|
|
|
|
* corresponding to @index in the radix tree. If
|
2005-04-16 16:20:36 -06:00
|
|
|
* this causes the leaf node to have no tags set then clear the tag in the
|
|
|
|
* next-to-leaf node, etc.
|
|
|
|
*
|
|
|
|
* Returns the address of the tagged item on success, else NULL. ie:
|
|
|
|
* has the same return value and semantics as radix_tree_lookup().
|
|
|
|
*/
|
|
|
|
void *radix_tree_tag_clear(struct radix_tree_root *root,
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned long index, unsigned int tag)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2007-10-16 02:24:49 -06:00
|
|
|
/*
|
|
|
|
* The radix tree path needs to be one longer than the maximum path
|
|
|
|
* since the "list" is null terminated.
|
|
|
|
*/
|
|
|
|
struct radix_tree_path path[RADIX_TREE_MAX_PATH + 1], *pathp = path;
|
2006-06-23 03:03:22 -06:00
|
|
|
struct radix_tree_node *slot = NULL;
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned int height, shift;
|
|
|
|
|
|
|
|
height = root->height;
|
|
|
|
if (index > radix_tree_maxindex(height))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
shift = (height - 1) * RADIX_TREE_MAP_SHIFT;
|
|
|
|
pathp->node = NULL;
|
2007-10-16 02:24:42 -06:00
|
|
|
slot = radix_tree_indirect_to_ptr(root->rnode);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
while (height > 0) {
|
|
|
|
int offset;
|
|
|
|
|
2005-09-06 16:16:46 -06:00
|
|
|
if (slot == NULL)
|
2005-04-16 16:20:36 -06:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
offset = (index >> shift) & RADIX_TREE_MAP_MASK;
|
|
|
|
pathp[1].offset = offset;
|
2005-09-06 16:16:46 -06:00
|
|
|
pathp[1].node = slot;
|
|
|
|
slot = slot->slots[offset];
|
2005-04-16 16:20:36 -06:00
|
|
|
pathp++;
|
|
|
|
shift -= RADIX_TREE_MAP_SHIFT;
|
|
|
|
height--;
|
|
|
|
}
|
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
if (slot == NULL)
|
2005-04-16 16:20:36 -06:00
|
|
|
goto out;
|
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
while (pathp->node) {
|
2006-01-08 02:01:41 -07:00
|
|
|
if (!tag_get(pathp->node, tag, pathp->offset))
|
|
|
|
goto out;
|
2005-09-06 16:16:46 -06:00
|
|
|
tag_clear(pathp->node, tag, pathp->offset);
|
2006-01-08 02:01:40 -07:00
|
|
|
if (any_tag_set(pathp->node, tag))
|
|
|
|
goto out;
|
2005-04-16 16:20:36 -06:00
|
|
|
pathp--;
|
2006-06-23 03:03:22 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
/* clear the root's tag bit */
|
|
|
|
if (root_tag_get(root, tag))
|
|
|
|
root_tag_clear(root, tag);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
out:
|
2006-06-23 03:03:22 -06:00
|
|
|
return slot;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_tag_clear);
|
|
|
|
|
|
|
|
/**
|
2005-09-06 16:16:48 -06:00
|
|
|
* radix_tree_tag_get - get a tag on a radix tree node
|
|
|
|
* @root: radix tree root
|
|
|
|
* @index: index key
|
2006-03-25 04:08:05 -07:00
|
|
|
* @tag: tag index (< RADIX_TREE_MAX_TAGS)
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
2005-09-06 16:16:48 -06:00
|
|
|
* Return values:
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
2006-06-23 03:03:22 -06:00
|
|
|
* 0: tag not present or not set
|
|
|
|
* 1: tag set
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
|
|
|
int radix_tree_tag_get(struct radix_tree_root *root,
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned long index, unsigned int tag)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
unsigned int height, shift;
|
2006-12-06 21:33:44 -07:00
|
|
|
struct radix_tree_node *node;
|
2005-04-16 16:20:36 -06:00
|
|
|
int saw_unset_tag = 0;
|
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
/* check the root's tag bit */
|
|
|
|
if (!root_tag_get(root, tag))
|
|
|
|
return 0;
|
|
|
|
|
2010-02-22 18:04:54 -07:00
|
|
|
node = rcu_dereference_raw(root->rnode);
|
2006-12-06 21:33:44 -07:00
|
|
|
if (node == NULL)
|
|
|
|
return 0;
|
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
if (!radix_tree_is_indirect_ptr(node))
|
2006-12-06 21:33:44 -07:00
|
|
|
return (index == 0);
|
2007-10-16 02:24:42 -06:00
|
|
|
node = radix_tree_indirect_to_ptr(node);
|
2006-12-06 21:33:44 -07:00
|
|
|
|
|
|
|
height = node->height;
|
|
|
|
if (index > radix_tree_maxindex(height))
|
|
|
|
return 0;
|
2006-06-23 03:03:22 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
shift = (height - 1) * RADIX_TREE_MAP_SHIFT;
|
|
|
|
|
|
|
|
for ( ; ; ) {
|
|
|
|
int offset;
|
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
if (node == NULL)
|
2005-04-16 16:20:36 -06:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
offset = (index >> shift) & RADIX_TREE_MAP_MASK;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is just a debug check. Later, we can bale as soon as
|
|
|
|
* we see an unset tag.
|
|
|
|
*/
|
2006-12-06 21:33:44 -07:00
|
|
|
if (!tag_get(node, tag, offset))
|
2005-04-16 16:20:36 -06:00
|
|
|
saw_unset_tag = 1;
|
|
|
|
if (height == 1) {
|
2006-12-06 21:33:44 -07:00
|
|
|
int ret = tag_get(node, tag, offset);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
BUG_ON(ret && saw_unset_tag);
|
2006-06-25 06:48:14 -06:00
|
|
|
return !!ret;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2010-02-22 18:04:54 -07:00
|
|
|
node = rcu_dereference_raw(node->slots[offset]);
|
2005-04-16 16:20:36 -06:00
|
|
|
shift -= RADIX_TREE_MAP_SHIFT;
|
|
|
|
height--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_tag_get);
|
|
|
|
|
2007-10-16 02:24:33 -06:00
|
|
|
/**
|
|
|
|
* radix_tree_next_hole - find the next hole (not-present entry)
|
|
|
|
* @root: tree root
|
|
|
|
* @index: index key
|
|
|
|
* @max_scan: maximum range to search
|
|
|
|
*
|
|
|
|
* Search the set [index, min(index+max_scan-1, MAX_INDEX)] for the lowest
|
|
|
|
* indexed hole.
|
|
|
|
*
|
|
|
|
* Returns: the index of the hole if found, otherwise returns an index
|
|
|
|
* outside of the set specified (in which case 'return - index >= max_scan'
|
2008-11-27 03:42:22 -07:00
|
|
|
* will be true). In rare cases of index wrap-around, 0 will be returned.
|
2007-10-16 02:24:33 -06:00
|
|
|
*
|
|
|
|
* radix_tree_next_hole may be called under rcu_read_lock. However, like
|
2008-11-27 03:42:22 -07:00
|
|
|
* radix_tree_gang_lookup, this will not atomically search a snapshot of
|
|
|
|
* the tree at a single point in time. For example, if a hole is created
|
|
|
|
* at index 5, then subsequently a hole is created at index 10,
|
|
|
|
* radix_tree_next_hole covering both indexes may return 10 if called
|
|
|
|
* under rcu_read_lock.
|
2007-10-16 02:24:33 -06:00
|
|
|
*/
|
|
|
|
unsigned long radix_tree_next_hole(struct radix_tree_root *root,
|
|
|
|
unsigned long index, unsigned long max_scan)
|
|
|
|
{
|
|
|
|
unsigned long i;
|
|
|
|
|
|
|
|
for (i = 0; i < max_scan; i++) {
|
|
|
|
if (!radix_tree_lookup(root, index))
|
|
|
|
break;
|
|
|
|
index++;
|
|
|
|
if (index == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return index;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_next_hole);
|
|
|
|
|
2009-06-16 16:31:32 -06:00
|
|
|
/**
|
|
|
|
* radix_tree_prev_hole - find the prev hole (not-present entry)
|
|
|
|
* @root: tree root
|
|
|
|
* @index: index key
|
|
|
|
* @max_scan: maximum range to search
|
|
|
|
*
|
|
|
|
* Search backwards in the range [max(index-max_scan+1, 0), index]
|
|
|
|
* for the first hole.
|
|
|
|
*
|
|
|
|
* Returns: the index of the hole if found, otherwise returns an index
|
|
|
|
* outside of the set specified (in which case 'index - return >= max_scan'
|
|
|
|
* will be true). In rare cases of wrap-around, LONG_MAX will be returned.
|
|
|
|
*
|
|
|
|
* radix_tree_next_hole may be called under rcu_read_lock. However, like
|
|
|
|
* radix_tree_gang_lookup, this will not atomically search a snapshot of
|
|
|
|
* the tree at a single point in time. For example, if a hole is created
|
|
|
|
* at index 10, then subsequently a hole is created at index 5,
|
|
|
|
* radix_tree_prev_hole covering both indexes may return 5 if called under
|
|
|
|
* rcu_read_lock.
|
|
|
|
*/
|
|
|
|
unsigned long radix_tree_prev_hole(struct radix_tree_root *root,
|
|
|
|
unsigned long index, unsigned long max_scan)
|
|
|
|
{
|
|
|
|
unsigned long i;
|
|
|
|
|
|
|
|
for (i = 0; i < max_scan; i++) {
|
|
|
|
if (!radix_tree_lookup(root, index))
|
|
|
|
break;
|
|
|
|
index--;
|
|
|
|
if (index == LONG_MAX)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return index;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_prev_hole);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
static unsigned int
|
2008-07-25 20:45:29 -06:00
|
|
|
__lookup(struct radix_tree_node *slot, void ***results, unsigned long index,
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned int max_items, unsigned long *next_index)
|
|
|
|
{
|
|
|
|
unsigned int nr_found = 0;
|
2005-09-06 16:16:46 -06:00
|
|
|
unsigned int shift, height;
|
|
|
|
unsigned long i;
|
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
height = slot->height;
|
|
|
|
if (height == 0)
|
2005-09-06 16:16:46 -06:00
|
|
|
goto out;
|
2005-04-16 16:20:36 -06:00
|
|
|
shift = (height-1) * RADIX_TREE_MAP_SHIFT;
|
|
|
|
|
2005-09-06 16:16:46 -06:00
|
|
|
for ( ; height > 1; height--) {
|
2006-12-06 21:33:44 -07:00
|
|
|
i = (index >> shift) & RADIX_TREE_MAP_MASK;
|
|
|
|
for (;;) {
|
2005-04-16 16:20:36 -06:00
|
|
|
if (slot->slots[i] != NULL)
|
|
|
|
break;
|
|
|
|
index &= ~((1UL << shift) - 1);
|
|
|
|
index += 1UL << shift;
|
|
|
|
if (index == 0)
|
|
|
|
goto out; /* 32-bit wraparound */
|
2006-12-06 21:33:44 -07:00
|
|
|
i++;
|
|
|
|
if (i == RADIX_TREE_MAP_SIZE)
|
|
|
|
goto out;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
shift -= RADIX_TREE_MAP_SHIFT;
|
2010-02-22 18:04:54 -07:00
|
|
|
slot = rcu_dereference_raw(slot->slots[i]);
|
2006-12-06 21:33:44 -07:00
|
|
|
if (slot == NULL)
|
|
|
|
goto out;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2005-09-06 16:16:46 -06:00
|
|
|
|
|
|
|
/* Bottom level: grab some items */
|
|
|
|
for (i = index & RADIX_TREE_MAP_MASK; i < RADIX_TREE_MAP_SIZE; i++) {
|
|
|
|
index++;
|
2008-07-25 20:45:29 -06:00
|
|
|
if (slot->slots[i]) {
|
|
|
|
results[nr_found++] = &(slot->slots[i]);
|
2005-09-06 16:16:46 -06:00
|
|
|
if (nr_found == max_items)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
out:
|
|
|
|
*next_index = index;
|
|
|
|
return nr_found;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_gang_lookup - perform multiple lookup on a radix tree
|
|
|
|
* @root: radix tree root
|
|
|
|
* @results: where the results of the lookup are placed
|
|
|
|
* @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
|
|
|
|
* them at *@results and returns the number of items which were placed at
|
|
|
|
* *@results.
|
|
|
|
*
|
|
|
|
* The implementation is naive.
|
2006-12-06 21:33:44 -07:00
|
|
|
*
|
|
|
|
* Like radix_tree_lookup, radix_tree_gang_lookup may be called under
|
|
|
|
* rcu_read_lock. In this case, rather than the returned results being
|
|
|
|
* an atomic snapshot of the tree at a single point in time, the semantics
|
|
|
|
* of an RCU protected gang lookup are as though multiple radix_tree_lookups
|
|
|
|
* have been issued in individual locks, and results stored in 'results'.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
|
|
|
unsigned int
|
|
|
|
radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
|
|
|
|
unsigned long first_index, unsigned int max_items)
|
|
|
|
{
|
2006-12-06 21:33:44 -07:00
|
|
|
unsigned long max_index;
|
|
|
|
struct radix_tree_node *node;
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned long cur_index = first_index;
|
2006-12-06 21:33:44 -07:00
|
|
|
unsigned int ret;
|
|
|
|
|
2010-02-22 18:04:54 -07:00
|
|
|
node = rcu_dereference_raw(root->rnode);
|
2006-12-06 21:33:44 -07:00
|
|
|
if (!node)
|
|
|
|
return 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
if (!radix_tree_is_indirect_ptr(node)) {
|
2006-12-06 21:33:44 -07:00
|
|
|
if (first_index > 0)
|
|
|
|
return 0;
|
2007-10-16 02:24:42 -06:00
|
|
|
results[0] = node;
|
2006-12-06 21:33:44 -07:00
|
|
|
return 1;
|
|
|
|
}
|
2007-10-16 02:24:42 -06:00
|
|
|
node = radix_tree_indirect_to_ptr(node);
|
2006-12-06 21:33:44 -07:00
|
|
|
|
|
|
|
max_index = radix_tree_maxindex(node->height);
|
|
|
|
|
|
|
|
ret = 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
while (ret < max_items) {
|
2008-07-25 20:45:29 -06:00
|
|
|
unsigned int nr_found, slots_found, i;
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned long next_index; /* Index of next search */
|
|
|
|
|
|
|
|
if (cur_index > max_index)
|
|
|
|
break;
|
2008-07-25 20:45:29 -06:00
|
|
|
slots_found = __lookup(node, (void ***)results + ret, cur_index,
|
2005-04-16 16:20:36 -06:00
|
|
|
max_items - ret, &next_index);
|
2008-07-25 20:45:29 -06:00
|
|
|
nr_found = 0;
|
|
|
|
for (i = 0; i < slots_found; i++) {
|
|
|
|
struct radix_tree_node *slot;
|
|
|
|
slot = *(((void ***)results)[ret + i]);
|
|
|
|
if (!slot)
|
|
|
|
continue;
|
2010-02-22 18:04:54 -07:00
|
|
|
results[ret + nr_found] = rcu_dereference_raw(slot);
|
2008-07-25 20:45:29 -06:00
|
|
|
nr_found++;
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
ret += nr_found;
|
|
|
|
if (next_index == 0)
|
|
|
|
break;
|
|
|
|
cur_index = next_index;
|
|
|
|
}
|
2006-12-06 21:33:44 -07:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_gang_lookup);
|
|
|
|
|
2008-07-25 20:45:29 -06:00
|
|
|
/**
|
|
|
|
* 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
|
|
|
|
* @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(struct radix_tree_root *root, void ***results,
|
|
|
|
unsigned long first_index, unsigned int max_items)
|
|
|
|
{
|
|
|
|
unsigned long max_index;
|
|
|
|
struct radix_tree_node *node;
|
|
|
|
unsigned long cur_index = first_index;
|
|
|
|
unsigned int ret;
|
|
|
|
|
2010-02-22 18:04:54 -07:00
|
|
|
node = rcu_dereference_raw(root->rnode);
|
2008-07-25 20:45:29 -06:00
|
|
|
if (!node)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (!radix_tree_is_indirect_ptr(node)) {
|
|
|
|
if (first_index > 0)
|
|
|
|
return 0;
|
|
|
|
results[0] = (void **)&root->rnode;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
node = radix_tree_indirect_to_ptr(node);
|
|
|
|
|
|
|
|
max_index = radix_tree_maxindex(node->height);
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
while (ret < max_items) {
|
|
|
|
unsigned int slots_found;
|
|
|
|
unsigned long next_index; /* Index of next search */
|
|
|
|
|
|
|
|
if (cur_index > max_index)
|
|
|
|
break;
|
|
|
|
slots_found = __lookup(node, results + ret, cur_index,
|
|
|
|
max_items - ret, &next_index);
|
|
|
|
ret += slots_found;
|
|
|
|
if (next_index == 0)
|
|
|
|
break;
|
|
|
|
cur_index = next_index;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_gang_lookup_slot);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* FIXME: the two tag_get()s here should use find_next_bit() instead of
|
|
|
|
* open-coding the search.
|
|
|
|
*/
|
|
|
|
static unsigned int
|
2008-07-25 20:45:29 -06:00
|
|
|
__lookup_tag(struct radix_tree_node *slot, void ***results, unsigned long index,
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned int max_items, unsigned long *next_index, unsigned int tag)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
unsigned int nr_found = 0;
|
2006-12-06 21:33:44 -07:00
|
|
|
unsigned int shift, height;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
height = slot->height;
|
|
|
|
if (height == 0)
|
2006-06-23 03:03:22 -06:00
|
|
|
goto out;
|
2006-12-06 21:33:44 -07:00
|
|
|
shift = (height-1) * RADIX_TREE_MAP_SHIFT;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
while (height > 0) {
|
|
|
|
unsigned long i = (index >> shift) & RADIX_TREE_MAP_MASK ;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
for (;;) {
|
|
|
|
if (tag_get(slot, tag, i))
|
2005-04-16 16:20:36 -06:00
|
|
|
break;
|
|
|
|
index &= ~((1UL << shift) - 1);
|
|
|
|
index += 1UL << shift;
|
|
|
|
if (index == 0)
|
|
|
|
goto out; /* 32-bit wraparound */
|
2006-12-06 21:33:44 -07:00
|
|
|
i++;
|
|
|
|
if (i == RADIX_TREE_MAP_SIZE)
|
|
|
|
goto out;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
height--;
|
|
|
|
if (height == 0) { /* Bottom level: grab some items */
|
|
|
|
unsigned long j = index & RADIX_TREE_MAP_MASK;
|
|
|
|
|
|
|
|
for ( ; j < RADIX_TREE_MAP_SIZE; j++) {
|
|
|
|
index++;
|
2006-12-06 21:33:44 -07:00
|
|
|
if (!tag_get(slot, tag, j))
|
|
|
|
continue;
|
|
|
|
/*
|
|
|
|
* Even though the tag was found set, we need to
|
|
|
|
* recheck that we have a non-NULL node, because
|
|
|
|
* if this lookup is lockless, it may have been
|
|
|
|
* subsequently deleted.
|
|
|
|
*
|
|
|
|
* Similar care must be taken in any place that
|
|
|
|
* lookup ->slots[x] without a lock (ie. can't
|
|
|
|
* rely on its value remaining the same).
|
|
|
|
*/
|
2008-07-25 20:45:29 -06:00
|
|
|
if (slot->slots[j]) {
|
|
|
|
results[nr_found++] = &(slot->slots[j]);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (nr_found == max_items)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
shift -= RADIX_TREE_MAP_SHIFT;
|
2010-02-22 18:04:54 -07:00
|
|
|
slot = rcu_dereference_raw(slot->slots[i]);
|
2006-12-06 21:33:44 -07:00
|
|
|
if (slot == NULL)
|
|
|
|
break;
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
out:
|
|
|
|
*next_index = index;
|
|
|
|
return nr_found;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_gang_lookup_tag - perform multiple lookup on a radix tree
|
|
|
|
* based on a tag
|
|
|
|
* @root: radix tree root
|
|
|
|
* @results: where the results of the lookup are placed
|
|
|
|
* @first_index: start the lookup from this key
|
|
|
|
* @max_items: place up to this many items at *results
|
2006-03-25 04:08:05 -07:00
|
|
|
* @tag: the tag index (< RADIX_TREE_MAX_TAGS)
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
|
|
|
* Performs an index-ascending scan of the tree for present items which
|
|
|
|
* have the tag indexed by @tag set. Places the items at *@results and
|
|
|
|
* returns the number of items which were placed at *@results.
|
|
|
|
*/
|
|
|
|
unsigned int
|
|
|
|
radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results,
|
2006-03-25 04:08:05 -07:00
|
|
|
unsigned long first_index, unsigned int max_items,
|
|
|
|
unsigned int tag)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2006-12-06 21:33:44 -07:00
|
|
|
struct radix_tree_node *node;
|
|
|
|
unsigned long max_index;
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned long cur_index = first_index;
|
2006-12-06 21:33:44 -07:00
|
|
|
unsigned int ret;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
/* check the root's tag bit */
|
|
|
|
if (!root_tag_get(root, tag))
|
|
|
|
return 0;
|
|
|
|
|
2010-02-22 18:04:54 -07:00
|
|
|
node = rcu_dereference_raw(root->rnode);
|
2006-12-06 21:33:44 -07:00
|
|
|
if (!node)
|
|
|
|
return 0;
|
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
if (!radix_tree_is_indirect_ptr(node)) {
|
2006-12-06 21:33:44 -07:00
|
|
|
if (first_index > 0)
|
|
|
|
return 0;
|
2007-10-16 02:24:42 -06:00
|
|
|
results[0] = node;
|
2006-12-06 21:33:44 -07:00
|
|
|
return 1;
|
|
|
|
}
|
2007-10-16 02:24:42 -06:00
|
|
|
node = radix_tree_indirect_to_ptr(node);
|
2006-12-06 21:33:44 -07:00
|
|
|
|
|
|
|
max_index = radix_tree_maxindex(node->height);
|
|
|
|
|
|
|
|
ret = 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
while (ret < max_items) {
|
2008-07-25 20:45:29 -06:00
|
|
|
unsigned int nr_found, slots_found, i;
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned long next_index; /* Index of next search */
|
|
|
|
|
|
|
|
if (cur_index > max_index)
|
|
|
|
break;
|
2008-07-25 20:45:29 -06:00
|
|
|
slots_found = __lookup_tag(node, (void ***)results + ret,
|
|
|
|
cur_index, max_items - ret, &next_index, tag);
|
|
|
|
nr_found = 0;
|
|
|
|
for (i = 0; i < slots_found; i++) {
|
|
|
|
struct radix_tree_node *slot;
|
|
|
|
slot = *(((void ***)results)[ret + i]);
|
|
|
|
if (!slot)
|
|
|
|
continue;
|
2010-02-22 18:04:54 -07:00
|
|
|
results[ret + nr_found] = rcu_dereference_raw(slot);
|
2008-07-25 20:45:29 -06:00
|
|
|
nr_found++;
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
ret += nr_found;
|
|
|
|
if (next_index == 0)
|
|
|
|
break;
|
|
|
|
cur_index = next_index;
|
|
|
|
}
|
2006-12-06 21:33:44 -07:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_gang_lookup_tag);
|
|
|
|
|
2008-07-25 20:45:29 -06:00
|
|
|
/**
|
|
|
|
* radix_tree_gang_lookup_tag_slot - perform multiple slot lookup on a
|
|
|
|
* radix tree based on a tag
|
|
|
|
* @root: radix tree root
|
|
|
|
* @results: where the results of the lookup are placed
|
|
|
|
* @first_index: start the lookup from this key
|
|
|
|
* @max_items: place up to this many items at *results
|
|
|
|
* @tag: the tag index (< RADIX_TREE_MAX_TAGS)
|
|
|
|
*
|
|
|
|
* Performs an index-ascending scan of the tree for present items which
|
|
|
|
* have the tag indexed by @tag set. Places the slots at *@results and
|
|
|
|
* returns the number of slots which were placed at *@results.
|
|
|
|
*/
|
|
|
|
unsigned int
|
|
|
|
radix_tree_gang_lookup_tag_slot(struct radix_tree_root *root, void ***results,
|
|
|
|
unsigned long first_index, unsigned int max_items,
|
|
|
|
unsigned int tag)
|
|
|
|
{
|
|
|
|
struct radix_tree_node *node;
|
|
|
|
unsigned long max_index;
|
|
|
|
unsigned long cur_index = first_index;
|
|
|
|
unsigned int ret;
|
|
|
|
|
|
|
|
/* check the root's tag bit */
|
|
|
|
if (!root_tag_get(root, tag))
|
|
|
|
return 0;
|
|
|
|
|
2010-02-22 18:04:54 -07:00
|
|
|
node = rcu_dereference_raw(root->rnode);
|
2008-07-25 20:45:29 -06:00
|
|
|
if (!node)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (!radix_tree_is_indirect_ptr(node)) {
|
|
|
|
if (first_index > 0)
|
|
|
|
return 0;
|
|
|
|
results[0] = (void **)&root->rnode;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
node = radix_tree_indirect_to_ptr(node);
|
|
|
|
|
|
|
|
max_index = radix_tree_maxindex(node->height);
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
while (ret < max_items) {
|
|
|
|
unsigned int slots_found;
|
|
|
|
unsigned long next_index; /* Index of next search */
|
|
|
|
|
|
|
|
if (cur_index > max_index)
|
|
|
|
break;
|
|
|
|
slots_found = __lookup_tag(node, results + ret,
|
|
|
|
cur_index, max_items - ret, &next_index, tag);
|
|
|
|
ret += slots_found;
|
|
|
|
if (next_index == 0)
|
|
|
|
break;
|
|
|
|
cur_index = next_index;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_gang_lookup_tag_slot);
|
|
|
|
|
|
|
|
|
2006-01-08 02:01:41 -07:00
|
|
|
/**
|
|
|
|
* radix_tree_shrink - shrink height of a radix tree to minimal
|
|
|
|
* @root radix tree root
|
|
|
|
*/
|
|
|
|
static inline void radix_tree_shrink(struct radix_tree_root *root)
|
|
|
|
{
|
|
|
|
/* try to shrink tree height */
|
2007-10-16 02:24:42 -06:00
|
|
|
while (root->height > 0) {
|
2006-01-08 02:01:41 -07:00
|
|
|
struct radix_tree_node *to_free = root->rnode;
|
2006-12-06 21:33:44 -07:00
|
|
|
void *newptr;
|
2006-01-08 02:01:41 -07:00
|
|
|
|
2007-10-16 02:24:42 -06:00
|
|
|
BUG_ON(!radix_tree_is_indirect_ptr(to_free));
|
|
|
|
to_free = radix_tree_indirect_to_ptr(to_free);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The candidate node has more than one child, or its child
|
|
|
|
* is not at the leftmost slot, we cannot shrink.
|
|
|
|
*/
|
|
|
|
if (to_free->count != 1)
|
|
|
|
break;
|
|
|
|
if (!to_free->slots[0])
|
|
|
|
break;
|
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
/*
|
|
|
|
* We don't need rcu_assign_pointer(), since we are simply
|
|
|
|
* moving the node from one part of the tree to another. If
|
|
|
|
* it was safe to dereference the old pointer to it
|
|
|
|
* (to_free->slots[0]), it will be safe to dereference the new
|
|
|
|
* one (root->rnode).
|
|
|
|
*/
|
|
|
|
newptr = to_free->slots[0];
|
2007-10-16 02:24:42 -06:00
|
|
|
if (root->height > 1)
|
|
|
|
newptr = radix_tree_ptr_to_indirect(newptr);
|
2006-12-06 21:33:44 -07:00
|
|
|
root->rnode = newptr;
|
2006-01-08 02:01:41 -07:00
|
|
|
root->height--;
|
|
|
|
radix_tree_node_free(to_free);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/**
|
|
|
|
* radix_tree_delete - delete an item from a radix tree
|
|
|
|
* @root: radix tree root
|
|
|
|
* @index: index key
|
|
|
|
*
|
|
|
|
* Remove the item at @index from the radix tree rooted at @root.
|
|
|
|
*
|
|
|
|
* Returns the address of the deleted item, or NULL if it was not present.
|
|
|
|
*/
|
|
|
|
void *radix_tree_delete(struct radix_tree_root *root, unsigned long index)
|
|
|
|
{
|
2007-10-16 02:24:49 -06:00
|
|
|
/*
|
|
|
|
* The radix tree path needs to be one longer than the maximum path
|
|
|
|
* since the "list" is null terminated.
|
|
|
|
*/
|
|
|
|
struct radix_tree_path path[RADIX_TREE_MAX_PATH + 1], *pathp = path;
|
2006-06-23 03:03:22 -06:00
|
|
|
struct radix_tree_node *slot = NULL;
|
2006-12-06 21:33:44 -07:00
|
|
|
struct radix_tree_node *to_free;
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned int height, shift;
|
2006-01-08 02:01:41 -07:00
|
|
|
int tag;
|
|
|
|
int offset;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
height = root->height;
|
|
|
|
if (index > radix_tree_maxindex(height))
|
|
|
|
goto out;
|
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
slot = root->rnode;
|
2007-10-16 02:24:42 -06:00
|
|
|
if (height == 0) {
|
2006-06-23 03:03:22 -06:00
|
|
|
root_tag_clear_all(root);
|
|
|
|
root->rnode = NULL;
|
|
|
|
goto out;
|
|
|
|
}
|
2007-10-16 02:24:42 -06:00
|
|
|
slot = radix_tree_indirect_to_ptr(slot);
|
2006-06-23 03:03:22 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
shift = (height - 1) * RADIX_TREE_MAP_SHIFT;
|
|
|
|
pathp->node = NULL;
|
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
do {
|
2005-09-06 16:16:46 -06:00
|
|
|
if (slot == NULL)
|
2005-04-16 16:20:36 -06:00
|
|
|
goto out;
|
|
|
|
|
2006-01-08 02:01:41 -07:00
|
|
|
pathp++;
|
2005-04-16 16:20:36 -06:00
|
|
|
offset = (index >> shift) & RADIX_TREE_MAP_MASK;
|
2006-01-08 02:01:41 -07:00
|
|
|
pathp->offset = offset;
|
|
|
|
pathp->node = slot;
|
2005-09-06 16:16:46 -06:00
|
|
|
slot = slot->slots[offset];
|
2005-04-16 16:20:36 -06:00
|
|
|
shift -= RADIX_TREE_MAP_SHIFT;
|
2006-06-23 03:03:22 -06:00
|
|
|
height--;
|
|
|
|
} while (height > 0);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-06-23 03:03:22 -06:00
|
|
|
if (slot == NULL)
|
2005-04-16 16:20:36 -06:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clear all tags associated with the just-deleted item
|
|
|
|
*/
|
2006-03-25 04:08:05 -07:00
|
|
|
for (tag = 0; tag < RADIX_TREE_MAX_TAGS; tag++) {
|
2006-06-23 03:03:22 -06:00
|
|
|
if (tag_get(pathp->node, tag, pathp->offset))
|
|
|
|
radix_tree_tag_clear(root, index, tag);
|
2006-01-08 02:01:41 -07:00
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-12-06 21:33:44 -07:00
|
|
|
to_free = NULL;
|
2005-09-06 16:16:46 -06:00
|
|
|
/* Now free the nodes we do not need anymore */
|
2006-06-23 03:03:22 -06:00
|
|
|
while (pathp->node) {
|
2005-09-06 16:16:46 -06:00
|
|
|
pathp->node->slots[pathp->offset] = NULL;
|
2006-01-08 02:01:41 -07:00
|
|
|
pathp->node->count--;
|
2006-12-06 21:33:44 -07:00
|
|
|
/*
|
|
|
|
* Queue the node for deferred freeing after the
|
|
|
|
* last reference to it disappears (set NULL, above).
|
|
|
|
*/
|
|
|
|
if (to_free)
|
|
|
|
radix_tree_node_free(to_free);
|
2006-01-08 02:01:41 -07:00
|
|
|
|
|
|
|
if (pathp->node->count) {
|
2007-10-16 02:24:42 -06:00
|
|
|
if (pathp->node ==
|
|
|
|
radix_tree_indirect_to_ptr(root->rnode))
|
2006-01-08 02:01:41 -07:00
|
|
|
radix_tree_shrink(root);
|
2005-09-06 16:16:46 -06:00
|
|
|
goto out;
|
2006-01-08 02:01:41 -07:00
|
|
|
}
|
2005-09-06 16:16:46 -06:00
|
|
|
|
|
|
|
/* Node with zero slots in use so free it */
|
2006-12-06 21:33:44 -07:00
|
|
|
to_free = pathp->node;
|
2006-06-23 03:03:22 -06:00
|
|
|
pathp--;
|
2006-12-06 21:33:44 -07:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2006-06-23 03:03:22 -06:00
|
|
|
root_tag_clear_all(root);
|
2005-09-06 16:16:46 -06:00
|
|
|
root->height = 0;
|
2006-06-23 03:03:22 -06:00
|
|
|
root->rnode = NULL;
|
2006-12-06 21:33:44 -07:00
|
|
|
if (to_free)
|
|
|
|
radix_tree_node_free(to_free);
|
2006-06-23 03:03:22 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
out:
|
2006-06-23 03:03:22 -06:00
|
|
|
return slot;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_delete);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* radix_tree_tagged - test whether any items in the tree are tagged
|
|
|
|
* @root: radix tree root
|
|
|
|
* @tag: tag to test
|
|
|
|
*/
|
2006-03-25 04:08:05 -07:00
|
|
|
int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2006-06-23 03:03:22 -06:00
|
|
|
return root_tag_get(root, tag);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(radix_tree_tagged);
|
|
|
|
|
|
|
|
static void
|
2008-07-25 20:45:34 -06:00
|
|
|
radix_tree_node_ctor(void *node)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
memset(node, 0, sizeof(struct radix_tree_node));
|
|
|
|
}
|
|
|
|
|
|
|
|
static __init unsigned long __maxindex(unsigned int height)
|
|
|
|
{
|
2007-10-17 00:29:35 -06:00
|
|
|
unsigned int width = height * RADIX_TREE_MAP_SHIFT;
|
|
|
|
int shift = RADIX_TREE_INDEX_BITS - width;
|
|
|
|
|
|
|
|
if (shift < 0)
|
|
|
|
return ~0UL;
|
|
|
|
if (shift >= BITS_PER_LONG)
|
|
|
|
return 0UL;
|
|
|
|
return ~0UL >> shift;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
static __init void radix_tree_init_maxindex(void)
|
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(height_to_maxindex); i++)
|
|
|
|
height_to_maxindex[i] = __maxindex(i);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int radix_tree_callback(struct notifier_block *nfb,
|
|
|
|
unsigned long action,
|
|
|
|
void *hcpu)
|
|
|
|
{
|
|
|
|
int cpu = (long)hcpu;
|
|
|
|
struct radix_tree_preload *rtp;
|
|
|
|
|
|
|
|
/* Free per-cpu pool of perloaded nodes */
|
2007-05-09 03:35:10 -06:00
|
|
|
if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
|
2005-04-16 16:20:36 -06:00
|
|
|
rtp = &per_cpu(radix_tree_preloads, cpu);
|
|
|
|
while (rtp->nr) {
|
|
|
|
kmem_cache_free(radix_tree_node_cachep,
|
|
|
|
rtp->nodes[rtp->nr-1]);
|
|
|
|
rtp->nodes[rtp->nr-1] = NULL;
|
|
|
|
rtp->nr--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NOTIFY_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
void __init radix_tree_init(void)
|
|
|
|
{
|
|
|
|
radix_tree_node_cachep = kmem_cache_create("radix_tree_node",
|
|
|
|
sizeof(struct radix_tree_node), 0,
|
2008-04-28 03:12:05 -06:00
|
|
|
SLAB_PANIC | SLAB_RECLAIM_ACCOUNT,
|
|
|
|
radix_tree_node_ctor);
|
2005-04-16 16:20:36 -06:00
|
|
|
radix_tree_init_maxindex();
|
|
|
|
hotcpu_notifier(radix_tree_callback, 0);
|
|
|
|
}
|