blob: 355f6e80db0d3e8afd4de9d4bcf447ec4e637ea3 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Copyright (C) 2001 Momchil Velikov
3 * Portions Copyright (C) 2001 Christoph Hellwig
Nick Piggin7cf9c2c2006-12-06 20:33:44 -08004 * Copyright (C) 2006 Nick Piggin
Linus Torvalds1da177e2005-04-16 15:20:36 -07005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
8 * published by the Free Software Foundation; either version 2, or (at
9 * your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
19 */
20#ifndef _LINUX_RADIX_TREE_H
21#define _LINUX_RADIX_TREE_H
22
23#include <linux/preempt.h>
24#include <linux/types.h>
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080025#include <linux/kernel.h>
26#include <linux/rcupdate.h>
27
28/*
Nick Pigginc0bc9872007-10-16 01:24:42 -070029 * An indirect pointer (root->rnode pointing to a radix_tree_node, rather
30 * than a data item) is signalled by the low bit set in the root->rnode
31 * pointer.
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080032 *
Nick Pigginc0bc9872007-10-16 01:24:42 -070033 * In this case root->height is > 0, but the indirect pointer tests are
34 * needed for RCU lookups (because root->height is unreliable). The only
35 * time callers need worry about this is when doing a lookup_slot under
36 * RCU.
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080037 */
Nick Pigginc0bc9872007-10-16 01:24:42 -070038#define RADIX_TREE_INDIRECT_PTR 1
39#define RADIX_TREE_RETRY ((void *)-1UL)
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080040
Nick Pigginc0bc9872007-10-16 01:24:42 -070041static inline void *radix_tree_ptr_to_indirect(void *ptr)
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080042{
Nick Pigginc0bc9872007-10-16 01:24:42 -070043 return (void *)((unsigned long)ptr | RADIX_TREE_INDIRECT_PTR);
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080044}
45
Nick Pigginc0bc9872007-10-16 01:24:42 -070046static inline void *radix_tree_indirect_to_ptr(void *ptr)
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080047{
Nick Pigginc0bc9872007-10-16 01:24:42 -070048 return (void *)((unsigned long)ptr & ~RADIX_TREE_INDIRECT_PTR);
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080049}
50
Nick Pigginc0bc9872007-10-16 01:24:42 -070051static inline int radix_tree_is_indirect_ptr(void *ptr)
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080052{
Nick Pigginc0bc9872007-10-16 01:24:42 -070053 return (int)((unsigned long)ptr & RADIX_TREE_INDIRECT_PTR);
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080054}
55
56/*** radix-tree API starts here ***/
Linus Torvalds1da177e2005-04-16 15:20:36 -070057
Nick Piggin612d6c12006-06-23 02:03:22 -070058#define RADIX_TREE_MAX_TAGS 2
59
60/* root tags are stored in gfp_mask, shifted by __GFP_BITS_SHIFT */
Linus Torvalds1da177e2005-04-16 15:20:36 -070061struct radix_tree_root {
62 unsigned int height;
Al Virofd4f2df2005-10-21 03:18:50 -040063 gfp_t gfp_mask;
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 struct radix_tree_node *rnode;
65};
66
67#define RADIX_TREE_INIT(mask) { \
68 .height = 0, \
69 .gfp_mask = (mask), \
70 .rnode = NULL, \
71}
72
73#define RADIX_TREE(name, mask) \
74 struct radix_tree_root name = RADIX_TREE_INIT(mask)
75
76#define INIT_RADIX_TREE(root, mask) \
77do { \
78 (root)->height = 0; \
79 (root)->gfp_mask = (mask); \
80 (root)->rnode = NULL; \
81} while (0)
82
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080083/**
84 * Radix-tree synchronization
85 *
86 * The radix-tree API requires that users provide all synchronisation (with
87 * specific exceptions, noted below).
88 *
89 * Synchronization of access to the data items being stored in the tree, and
90 * management of their lifetimes must be completely managed by API users.
91 *
92 * For API usage, in general,
Michael Opdenacker59c51592007-05-09 08:57:56 +020093 * - any function _modifying_ the tree or tags (inserting or deleting
Tim Peppereb8dc5e2008-02-03 16:12:47 +020094 * items, setting or clearing tags) must exclude other modifications, and
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080095 * exclude any functions reading the tree.
Michael Opdenacker59c51592007-05-09 08:57:56 +020096 * - any function _reading_ the tree or tags (looking up items or tags,
Nick Piggin7cf9c2c2006-12-06 20:33:44 -080097 * gang lookups) must exclude modifications to the tree, but may occur
98 * concurrently with other readers.
99 *
100 * The notable exceptions to this rule are the following functions:
101 * radix_tree_lookup
Nick Piggin47feff22008-07-25 19:45:29 -0700102 * radix_tree_lookup_slot
Nick Piggin7cf9c2c2006-12-06 20:33:44 -0800103 * radix_tree_tag_get
104 * radix_tree_gang_lookup
Nick Piggin47feff22008-07-25 19:45:29 -0700105 * radix_tree_gang_lookup_slot
Nick Piggin7cf9c2c2006-12-06 20:33:44 -0800106 * radix_tree_gang_lookup_tag
Nick Piggin47feff22008-07-25 19:45:29 -0700107 * radix_tree_gang_lookup_tag_slot
Nick Piggin7cf9c2c2006-12-06 20:33:44 -0800108 * radix_tree_tagged
109 *
Nick Piggin47feff22008-07-25 19:45:29 -0700110 * The first 7 functions are able to be called locklessly, using RCU. The
Nick Piggin7cf9c2c2006-12-06 20:33:44 -0800111 * caller must ensure calls to these functions are made within rcu_read_lock()
112 * regions. Other readers (lock-free or otherwise) and modifications may be
113 * running concurrently.
114 *
115 * It is still required that the caller manage the synchronization and lifetimes
116 * of the items. So if RCU lock-free lookups are used, typically this would mean
117 * that the items have their own locks, or are amenable to lock-free access; and
118 * that the items are freed by RCU (or only freed after having been deleted from
119 * the radix tree *and* a synchronize_rcu() grace period).
120 *
121 * (Note, rcu_assign_pointer and rcu_dereference are not needed to control
122 * access to data items when inserting into or looking up from the radix tree)
123 *
124 * radix_tree_tagged is able to be called without locking or RCU.
125 */
126
127/**
128 * radix_tree_deref_slot - dereference a slot
129 * @pslot: pointer to slot, returned by radix_tree_lookup_slot
130 * Returns: item that was stored in that slot with any direct pointer flag
131 * removed.
132 *
133 * For use with radix_tree_lookup_slot(). Caller must hold tree at least read
134 * locked across slot lookup and dereference. More likely, will be used with
135 * radix_tree_replace_slot(), as well, so caller will hold tree write locked.
136 */
137static inline void *radix_tree_deref_slot(void **pslot)
138{
Nick Piggine8c82c22009-01-06 03:05:50 +0100139 void *ret = rcu_dereference(*pslot);
Nick Pigginc0bc9872007-10-16 01:24:42 -0700140 if (unlikely(radix_tree_is_indirect_ptr(ret)))
141 ret = RADIX_TREE_RETRY;
142 return ret;
Nick Piggin7cf9c2c2006-12-06 20:33:44 -0800143}
144/**
145 * radix_tree_replace_slot - replace item in a slot
146 * @pslot: pointer to slot, returned by radix_tree_lookup_slot
147 * @item: new item to store in the slot.
148 *
149 * For use with radix_tree_lookup_slot(). Caller must hold tree write locked
150 * across slot lookup and replacement.
151 */
152static inline void radix_tree_replace_slot(void **pslot, void *item)
153{
Nick Pigginc0bc9872007-10-16 01:24:42 -0700154 BUG_ON(radix_tree_is_indirect_ptr(item));
155 rcu_assign_pointer(*pslot, item);
Nick Piggin7cf9c2c2006-12-06 20:33:44 -0800156}
157
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158int radix_tree_insert(struct radix_tree_root *, unsigned long, void *);
159void *radix_tree_lookup(struct radix_tree_root *, unsigned long);
Hans Reisera4331362005-11-07 00:59:29 -0800160void **radix_tree_lookup_slot(struct radix_tree_root *, unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700161void *radix_tree_delete(struct radix_tree_root *, unsigned long);
162unsigned int
163radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
164 unsigned long first_index, unsigned int max_items);
Nick Piggin47feff22008-07-25 19:45:29 -0700165unsigned int
166radix_tree_gang_lookup_slot(struct radix_tree_root *root, void ***results,
167 unsigned long first_index, unsigned int max_items);
Fengguang Wu6df8ba42007-10-16 01:24:33 -0700168unsigned long radix_tree_next_hole(struct radix_tree_root *root,
169 unsigned long index, unsigned long max_scan);
Al Virodd0fc662005-10-07 07:46:04 +0100170int radix_tree_preload(gfp_t gfp_mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171void radix_tree_init(void);
172void *radix_tree_tag_set(struct radix_tree_root *root,
Jonathan Corbetdaff89f2006-03-25 03:08:05 -0800173 unsigned long index, unsigned int tag);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174void *radix_tree_tag_clear(struct radix_tree_root *root,
Jonathan Corbetdaff89f2006-03-25 03:08:05 -0800175 unsigned long index, unsigned int tag);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176int radix_tree_tag_get(struct radix_tree_root *root,
Jonathan Corbetdaff89f2006-03-25 03:08:05 -0800177 unsigned long index, unsigned int tag);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178unsigned int
179radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results,
Jonathan Corbetdaff89f2006-03-25 03:08:05 -0800180 unsigned long first_index, unsigned int max_items,
181 unsigned int tag);
Nick Piggin47feff22008-07-25 19:45:29 -0700182unsigned int
183radix_tree_gang_lookup_tag_slot(struct radix_tree_root *root, void ***results,
184 unsigned long first_index, unsigned int max_items,
185 unsigned int tag);
Jonathan Corbetdaff89f2006-03-25 03:08:05 -0800186int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187
188static inline void radix_tree_preload_end(void)
189{
190 preempt_enable();
191}
192
193#endif /* _LINUX_RADIX_TREE_H */