Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Copyright (C) 2001 Momchil Velikov | |
3 | * Portions Copyright (C) 2001 Christoph Hellwig | |
cde53535 | 4 | * Copyright (C) 2005 SGI, Christoph Lameter |
7cf9c2c7 | 5 | * Copyright (C) 2006 Nick Piggin |
78c1d784 | 6 | * Copyright (C) 2012 Konstantin Khlebnikov |
6b053b8e MW |
7 | * Copyright (C) 2016 Intel, Matthew Wilcox |
8 | * Copyright (C) 2016 Intel, Ross Zwisler | |
1da177e4 LT |
9 | * |
10 | * This program is free software; you can redistribute it and/or | |
11 | * modify it under the terms of the GNU General Public License as | |
12 | * published by the Free Software Foundation; either version 2, or (at | |
13 | * your option) any later version. | |
14 | * | |
15 | * This program is distributed in the hope that it will be useful, but | |
16 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
17 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
18 | * General Public License for more details. | |
19 | * | |
20 | * You should have received a copy of the GNU General Public License | |
21 | * along with this program; if not, write to the Free Software | |
22 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
23 | */ | |
24 | ||
25 | #include <linux/errno.h> | |
26 | #include <linux/init.h> | |
27 | #include <linux/kernel.h> | |
8bc3bcc9 | 28 | #include <linux/export.h> |
1da177e4 LT |
29 | #include <linux/radix-tree.h> |
30 | #include <linux/percpu.h> | |
31 | #include <linux/slab.h> | |
ce80b067 | 32 | #include <linux/kmemleak.h> |
1da177e4 LT |
33 | #include <linux/notifier.h> |
34 | #include <linux/cpu.h> | |
1da177e4 LT |
35 | #include <linux/string.h> |
36 | #include <linux/bitops.h> | |
7cf9c2c7 | 37 | #include <linux/rcupdate.h> |
92cf2118 | 38 | #include <linux/preempt.h> /* in_interrupt() */ |
1da177e4 LT |
39 | |
40 | ||
1da177e4 LT |
41 | /* |
42 | * Radix tree node cache. | |
43 | */ | |
e18b890b | 44 | static struct kmem_cache *radix_tree_node_cachep; |
1da177e4 | 45 | |
55368052 NP |
46 | /* |
47 | * The radix tree is variable-height, so an insert operation not only has | |
48 | * to build the branch to its corresponding item, it also has to build the | |
49 | * branch to existing items if the size has to be increased (by | |
50 | * radix_tree_extend). | |
51 | * | |
52 | * The worst case is a zero height tree with just a single item at index 0, | |
53 | * and then inserting an item at index ULONG_MAX. This requires 2 new branches | |
54 | * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared. | |
55 | * Hence: | |
56 | */ | |
57 | #define RADIX_TREE_PRELOAD_SIZE (RADIX_TREE_MAX_PATH * 2 - 1) | |
58 | ||
1da177e4 LT |
59 | /* |
60 | * Per-cpu pool of preloaded nodes | |
61 | */ | |
62 | struct radix_tree_preload { | |
2fcd9005 | 63 | unsigned nr; |
9d2a8da0 KS |
64 | /* nodes->private_data points to next preallocated node */ |
65 | struct radix_tree_node *nodes; | |
1da177e4 | 66 | }; |
8cef7d57 | 67 | static DEFINE_PER_CPU(struct radix_tree_preload, radix_tree_preloads) = { 0, }; |
1da177e4 | 68 | |
a4db4dce | 69 | static inline void *node_to_entry(void *ptr) |
27d20fdd | 70 | { |
30ff46cc | 71 | return (void *)((unsigned long)ptr | RADIX_TREE_INTERNAL_NODE); |
27d20fdd NP |
72 | } |
73 | ||
a4db4dce | 74 | #define RADIX_TREE_RETRY node_to_entry(NULL) |
afe0e395 | 75 | |
db050f29 MW |
76 | #ifdef CONFIG_RADIX_TREE_MULTIORDER |
77 | /* Sibling slots point directly to another slot in the same node */ | |
78 | static inline bool is_sibling_entry(struct radix_tree_node *parent, void *node) | |
79 | { | |
80 | void **ptr = node; | |
81 | return (parent->slots <= ptr) && | |
82 | (ptr < parent->slots + RADIX_TREE_MAP_SIZE); | |
83 | } | |
84 | #else | |
85 | static inline bool is_sibling_entry(struct radix_tree_node *parent, void *node) | |
86 | { | |
87 | return false; | |
88 | } | |
89 | #endif | |
90 | ||
91 | static inline unsigned long get_slot_offset(struct radix_tree_node *parent, | |
92 | void **slot) | |
93 | { | |
94 | return slot - parent->slots; | |
95 | } | |
96 | ||
9e85d811 MW |
97 | static unsigned int radix_tree_descend(struct radix_tree_node *parent, |
98 | struct radix_tree_node **nodep, unsigned long index) | |
db050f29 | 99 | { |
9e85d811 | 100 | unsigned int offset = (index >> parent->shift) & RADIX_TREE_MAP_MASK; |
db050f29 MW |
101 | void **entry = rcu_dereference_raw(parent->slots[offset]); |
102 | ||
103 | #ifdef CONFIG_RADIX_TREE_MULTIORDER | |
b194d16c | 104 | if (radix_tree_is_internal_node(entry)) { |
db050f29 MW |
105 | unsigned long siboff = get_slot_offset(parent, entry); |
106 | if (siboff < RADIX_TREE_MAP_SIZE) { | |
107 | offset = siboff; | |
108 | entry = rcu_dereference_raw(parent->slots[offset]); | |
109 | } | |
110 | } | |
111 | #endif | |
112 | ||
113 | *nodep = (void *)entry; | |
114 | return offset; | |
115 | } | |
116 | ||
612d6c19 NP |
117 | static inline gfp_t root_gfp_mask(struct radix_tree_root *root) |
118 | { | |
119 | return root->gfp_mask & __GFP_BITS_MASK; | |
120 | } | |
121 | ||
643b52b9 NP |
122 | static inline void tag_set(struct radix_tree_node *node, unsigned int tag, |
123 | int offset) | |
124 | { | |
125 | __set_bit(offset, node->tags[tag]); | |
126 | } | |
127 | ||
128 | static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, | |
129 | int offset) | |
130 | { | |
131 | __clear_bit(offset, node->tags[tag]); | |
132 | } | |
133 | ||
134 | static inline int tag_get(struct radix_tree_node *node, unsigned int tag, | |
135 | int offset) | |
136 | { | |
137 | return test_bit(offset, node->tags[tag]); | |
138 | } | |
139 | ||
140 | static inline void root_tag_set(struct radix_tree_root *root, unsigned int tag) | |
141 | { | |
142 | root->gfp_mask |= (__force gfp_t)(1 << (tag + __GFP_BITS_SHIFT)); | |
143 | } | |
144 | ||
2fcd9005 | 145 | static inline void root_tag_clear(struct radix_tree_root *root, unsigned tag) |
643b52b9 NP |
146 | { |
147 | root->gfp_mask &= (__force gfp_t)~(1 << (tag + __GFP_BITS_SHIFT)); | |
148 | } | |
149 | ||
150 | static inline void root_tag_clear_all(struct radix_tree_root *root) | |
151 | { | |
152 | root->gfp_mask &= __GFP_BITS_MASK; | |
153 | } | |
154 | ||
155 | static inline int root_tag_get(struct radix_tree_root *root, unsigned int tag) | |
156 | { | |
2fcd9005 | 157 | return (__force int)root->gfp_mask & (1 << (tag + __GFP_BITS_SHIFT)); |
643b52b9 NP |
158 | } |
159 | ||
7b60e9ad MW |
160 | static inline unsigned root_tags_get(struct radix_tree_root *root) |
161 | { | |
162 | return (__force unsigned)root->gfp_mask >> __GFP_BITS_SHIFT; | |
163 | } | |
164 | ||
643b52b9 NP |
165 | /* |
166 | * Returns 1 if any slot in the node has this tag set. | |
167 | * Otherwise returns 0. | |
168 | */ | |
169 | static inline int any_tag_set(struct radix_tree_node *node, unsigned int tag) | |
170 | { | |
2fcd9005 | 171 | unsigned idx; |
643b52b9 NP |
172 | for (idx = 0; idx < RADIX_TREE_TAG_LONGS; idx++) { |
173 | if (node->tags[tag][idx]) | |
174 | return 1; | |
175 | } | |
176 | return 0; | |
177 | } | |
78c1d784 KK |
178 | |
179 | /** | |
180 | * radix_tree_find_next_bit - find the next set bit in a memory region | |
181 | * | |
182 | * @addr: The address to base the search on | |
183 | * @size: The bitmap size in bits | |
184 | * @offset: The bitnumber to start searching at | |
185 | * | |
186 | * Unrollable variant of find_next_bit() for constant size arrays. | |
187 | * Tail bits starting from size to roundup(size, BITS_PER_LONG) must be zero. | |
188 | * Returns next bit offset, or size if nothing found. | |
189 | */ | |
190 | static __always_inline unsigned long | |
191 | radix_tree_find_next_bit(const unsigned long *addr, | |
192 | unsigned long size, unsigned long offset) | |
193 | { | |
194 | if (!__builtin_constant_p(size)) | |
195 | return find_next_bit(addr, size, offset); | |
196 | ||
197 | if (offset < size) { | |
198 | unsigned long tmp; | |
199 | ||
200 | addr += offset / BITS_PER_LONG; | |
201 | tmp = *addr >> (offset % BITS_PER_LONG); | |
202 | if (tmp) | |
203 | return __ffs(tmp) + offset; | |
204 | offset = (offset + BITS_PER_LONG) & ~(BITS_PER_LONG - 1); | |
205 | while (offset < size) { | |
206 | tmp = *++addr; | |
207 | if (tmp) | |
208 | return __ffs(tmp) + offset; | |
209 | offset += BITS_PER_LONG; | |
210 | } | |
211 | } | |
212 | return size; | |
213 | } | |
214 | ||
0796c583 | 215 | #ifndef __KERNEL__ |
d0891265 | 216 | static void dump_node(struct radix_tree_node *node, unsigned long index) |
7cf19af4 | 217 | { |
0796c583 | 218 | unsigned long i; |
7cf19af4 | 219 | |
c12e51b0 | 220 | pr_debug("radix node: %p offset %d tags %lx %lx %lx shift %d count %d parent %p\n", |
0c7fa0a8 | 221 | node, node->offset, |
0796c583 | 222 | node->tags[0][0], node->tags[1][0], node->tags[2][0], |
c12e51b0 | 223 | node->shift, node->count, node->parent); |
0796c583 RZ |
224 | |
225 | for (i = 0; i < RADIX_TREE_MAP_SIZE; i++) { | |
d0891265 MW |
226 | unsigned long first = index | (i << node->shift); |
227 | unsigned long last = first | ((1UL << node->shift) - 1); | |
0796c583 RZ |
228 | void *entry = node->slots[i]; |
229 | if (!entry) | |
230 | continue; | |
231 | if (is_sibling_entry(node, entry)) { | |
232 | pr_debug("radix sblng %p offset %ld val %p indices %ld-%ld\n", | |
233 | entry, i, | |
4dd6c098 | 234 | *(void **)entry_to_node(entry), |
0796c583 | 235 | first, last); |
b194d16c | 236 | } else if (!radix_tree_is_internal_node(entry)) { |
0796c583 RZ |
237 | pr_debug("radix entry %p offset %ld indices %ld-%ld\n", |
238 | entry, i, first, last); | |
239 | } else { | |
4dd6c098 | 240 | dump_node(entry_to_node(entry), first); |
0796c583 RZ |
241 | } |
242 | } | |
7cf19af4 MW |
243 | } |
244 | ||
245 | /* For debug */ | |
246 | static void radix_tree_dump(struct radix_tree_root *root) | |
247 | { | |
d0891265 MW |
248 | pr_debug("radix root: %p rnode %p tags %x\n", |
249 | root, root->rnode, | |
7cf19af4 | 250 | root->gfp_mask >> __GFP_BITS_SHIFT); |
b194d16c | 251 | if (!radix_tree_is_internal_node(root->rnode)) |
7cf19af4 | 252 | return; |
4dd6c098 | 253 | dump_node(entry_to_node(root->rnode), 0); |
7cf19af4 MW |
254 | } |
255 | #endif | |
256 | ||
1da177e4 LT |
257 | /* |
258 | * This assumes that the caller has performed appropriate preallocation, and | |
259 | * that the caller has pinned this thread of control to the current CPU. | |
260 | */ | |
261 | static struct radix_tree_node * | |
262 | radix_tree_node_alloc(struct radix_tree_root *root) | |
263 | { | |
e2848a0e | 264 | struct radix_tree_node *ret = NULL; |
612d6c19 | 265 | gfp_t gfp_mask = root_gfp_mask(root); |
1da177e4 | 266 | |
5e4c0d97 | 267 | /* |
2fcd9005 MW |
268 | * Preload code isn't irq safe and it doesn't make sense to use |
269 | * preloading during an interrupt anyway as all the allocations have | |
270 | * to be atomic. So just do normal allocation when in interrupt. | |
5e4c0d97 | 271 | */ |
d0164adc | 272 | if (!gfpflags_allow_blocking(gfp_mask) && !in_interrupt()) { |
1da177e4 LT |
273 | struct radix_tree_preload *rtp; |
274 | ||
58e698af VD |
275 | /* |
276 | * Even if the caller has preloaded, try to allocate from the | |
277 | * cache first for the new node to get accounted. | |
278 | */ | |
279 | ret = kmem_cache_alloc(radix_tree_node_cachep, | |
280 | gfp_mask | __GFP_ACCOUNT | __GFP_NOWARN); | |
281 | if (ret) | |
282 | goto out; | |
283 | ||
e2848a0e NP |
284 | /* |
285 | * Provided the caller has preloaded here, we will always | |
286 | * succeed in getting a node here (and never reach | |
287 | * kmem_cache_alloc) | |
288 | */ | |
7c8e0181 | 289 | rtp = this_cpu_ptr(&radix_tree_preloads); |
1da177e4 | 290 | if (rtp->nr) { |
9d2a8da0 KS |
291 | ret = rtp->nodes; |
292 | rtp->nodes = ret->private_data; | |
293 | ret->private_data = NULL; | |
1da177e4 LT |
294 | rtp->nr--; |
295 | } | |
ce80b067 CM |
296 | /* |
297 | * Update the allocation stack trace as this is more useful | |
298 | * for debugging. | |
299 | */ | |
300 | kmemleak_update_trace(ret); | |
58e698af | 301 | goto out; |
1da177e4 | 302 | } |
58e698af VD |
303 | ret = kmem_cache_alloc(radix_tree_node_cachep, |
304 | gfp_mask | __GFP_ACCOUNT); | |
305 | out: | |
b194d16c | 306 | BUG_ON(radix_tree_is_internal_node(ret)); |
1da177e4 LT |
307 | return ret; |
308 | } | |
309 | ||
7cf9c2c7 NP |
310 | static void radix_tree_node_rcu_free(struct rcu_head *head) |
311 | { | |
312 | struct radix_tree_node *node = | |
313 | container_of(head, struct radix_tree_node, rcu_head); | |
b6dd0865 | 314 | int i; |
643b52b9 NP |
315 | |
316 | /* | |
317 | * must only free zeroed nodes into the slab. radix_tree_shrink | |
318 | * can leave us with a non-NULL entry in the first slot, so clear | |
319 | * that here to make sure. | |
320 | */ | |
b6dd0865 DC |
321 | for (i = 0; i < RADIX_TREE_MAX_TAGS; i++) |
322 | tag_clear(node, i, 0); | |
323 | ||
643b52b9 NP |
324 | node->slots[0] = NULL; |
325 | node->count = 0; | |
326 | ||
7cf9c2c7 NP |
327 | kmem_cache_free(radix_tree_node_cachep, node); |
328 | } | |
329 | ||
1da177e4 LT |
330 | static inline void |
331 | radix_tree_node_free(struct radix_tree_node *node) | |
332 | { | |
7cf9c2c7 | 333 | call_rcu(&node->rcu_head, radix_tree_node_rcu_free); |
1da177e4 LT |
334 | } |
335 | ||
336 | /* | |
337 | * Load up this CPU's radix_tree_node buffer with sufficient objects to | |
338 | * ensure that the addition of a single element in the tree cannot fail. On | |
339 | * success, return zero, with preemption disabled. On error, return -ENOMEM | |
340 | * with preemption not disabled. | |
b34df792 DH |
341 | * |
342 | * To make use of this facility, the radix tree must be initialised without | |
d0164adc | 343 | * __GFP_DIRECT_RECLAIM being passed to INIT_RADIX_TREE(). |
1da177e4 | 344 | */ |
5e4c0d97 | 345 | static int __radix_tree_preload(gfp_t gfp_mask) |
1da177e4 LT |
346 | { |
347 | struct radix_tree_preload *rtp; | |
348 | struct radix_tree_node *node; | |
349 | int ret = -ENOMEM; | |
350 | ||
351 | preempt_disable(); | |
7c8e0181 | 352 | rtp = this_cpu_ptr(&radix_tree_preloads); |
9d2a8da0 | 353 | while (rtp->nr < RADIX_TREE_PRELOAD_SIZE) { |
1da177e4 | 354 | preempt_enable(); |
488514d1 | 355 | node = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask); |
1da177e4 LT |
356 | if (node == NULL) |
357 | goto out; | |
358 | preempt_disable(); | |
7c8e0181 | 359 | rtp = this_cpu_ptr(&radix_tree_preloads); |
9d2a8da0 KS |
360 | if (rtp->nr < RADIX_TREE_PRELOAD_SIZE) { |
361 | node->private_data = rtp->nodes; | |
362 | rtp->nodes = node; | |
363 | rtp->nr++; | |
364 | } else { | |
1da177e4 | 365 | kmem_cache_free(radix_tree_node_cachep, node); |
9d2a8da0 | 366 | } |
1da177e4 LT |
367 | } |
368 | ret = 0; | |
369 | out: | |
370 | return ret; | |
371 | } | |
5e4c0d97 JK |
372 | |
373 | /* | |
374 | * Load up this CPU's radix_tree_node buffer with sufficient objects to | |
375 | * ensure that the addition of a single element in the tree cannot fail. On | |
376 | * success, return zero, with preemption disabled. On error, return -ENOMEM | |
377 | * with preemption not disabled. | |
378 | * | |
379 | * To make use of this facility, the radix tree must be initialised without | |
d0164adc | 380 | * __GFP_DIRECT_RECLAIM being passed to INIT_RADIX_TREE(). |
5e4c0d97 JK |
381 | */ |
382 | int radix_tree_preload(gfp_t gfp_mask) | |
383 | { | |
384 | /* Warn on non-sensical use... */ | |
d0164adc | 385 | WARN_ON_ONCE(!gfpflags_allow_blocking(gfp_mask)); |
5e4c0d97 JK |
386 | return __radix_tree_preload(gfp_mask); |
387 | } | |
d7f0923d | 388 | EXPORT_SYMBOL(radix_tree_preload); |
1da177e4 | 389 | |
5e4c0d97 JK |
390 | /* |
391 | * The same as above function, except we don't guarantee preloading happens. | |
392 | * We do it, if we decide it helps. On success, return zero with preemption | |
393 | * disabled. On error, return -ENOMEM with preemption not disabled. | |
394 | */ | |
395 | int radix_tree_maybe_preload(gfp_t gfp_mask) | |
396 | { | |
d0164adc | 397 | if (gfpflags_allow_blocking(gfp_mask)) |
5e4c0d97 JK |
398 | return __radix_tree_preload(gfp_mask); |
399 | /* Preloading doesn't help anything with this gfp mask, skip it */ | |
400 | preempt_disable(); | |
401 | return 0; | |
402 | } | |
403 | EXPORT_SYMBOL(radix_tree_maybe_preload); | |
404 | ||
1da177e4 | 405 | /* |
d0891265 | 406 | * The maximum index which can be stored in a radix tree |
1da177e4 | 407 | */ |
c12e51b0 MW |
408 | static inline unsigned long shift_maxindex(unsigned int shift) |
409 | { | |
410 | return (RADIX_TREE_MAP_SIZE << shift) - 1; | |
411 | } | |
412 | ||
1456a439 MW |
413 | static inline unsigned long node_maxindex(struct radix_tree_node *node) |
414 | { | |
c12e51b0 | 415 | return shift_maxindex(node->shift); |
1456a439 MW |
416 | } |
417 | ||
418 | static unsigned radix_tree_load_root(struct radix_tree_root *root, | |
419 | struct radix_tree_node **nodep, unsigned long *maxindex) | |
420 | { | |
421 | struct radix_tree_node *node = rcu_dereference_raw(root->rnode); | |
422 | ||
423 | *nodep = node; | |
424 | ||
b194d16c | 425 | if (likely(radix_tree_is_internal_node(node))) { |
4dd6c098 | 426 | node = entry_to_node(node); |
1456a439 | 427 | *maxindex = node_maxindex(node); |
c12e51b0 | 428 | return node->shift + RADIX_TREE_MAP_SHIFT; |
1456a439 MW |
429 | } |
430 | ||
431 | *maxindex = 0; | |
432 | return 0; | |
433 | } | |
434 | ||
1da177e4 LT |
435 | /* |
436 | * Extend a radix tree so it can store key @index. | |
437 | */ | |
e6145236 | 438 | static int radix_tree_extend(struct radix_tree_root *root, |
d0891265 | 439 | unsigned long index, unsigned int shift) |
1da177e4 | 440 | { |
e2bdb933 | 441 | struct radix_tree_node *slot; |
d0891265 | 442 | unsigned int maxshift; |
1da177e4 LT |
443 | int tag; |
444 | ||
d0891265 MW |
445 | /* Figure out what the shift should be. */ |
446 | maxshift = shift; | |
447 | while (index > shift_maxindex(maxshift)) | |
448 | maxshift += RADIX_TREE_MAP_SHIFT; | |
1da177e4 | 449 | |
d0891265 MW |
450 | slot = root->rnode; |
451 | if (!slot) | |
1da177e4 | 452 | goto out; |
1da177e4 | 453 | |
1da177e4 | 454 | do { |
2fcd9005 MW |
455 | struct radix_tree_node *node = radix_tree_node_alloc(root); |
456 | ||
457 | if (!node) | |
1da177e4 LT |
458 | return -ENOMEM; |
459 | ||
1da177e4 | 460 | /* Propagate the aggregated tag info into the new root */ |
daff89f3 | 461 | for (tag = 0; tag < RADIX_TREE_MAX_TAGS; tag++) { |
612d6c19 | 462 | if (root_tag_get(root, tag)) |
1da177e4 LT |
463 | tag_set(node, tag, 0); |
464 | } | |
465 | ||
d0891265 MW |
466 | BUG_ON(shift > BITS_PER_LONG); |
467 | node->shift = shift; | |
0c7fa0a8 | 468 | node->offset = 0; |
1da177e4 | 469 | node->count = 1; |
e2bdb933 | 470 | node->parent = NULL; |
b194d16c | 471 | if (radix_tree_is_internal_node(slot)) |
4dd6c098 | 472 | entry_to_node(slot)->parent = node; |
e2bdb933 | 473 | node->slots[0] = slot; |
a4db4dce MW |
474 | slot = node_to_entry(node); |
475 | rcu_assign_pointer(root->rnode, slot); | |
d0891265 | 476 | shift += RADIX_TREE_MAP_SHIFT; |
d0891265 | 477 | } while (shift <= maxshift); |
1da177e4 | 478 | out: |
d0891265 | 479 | return maxshift + RADIX_TREE_MAP_SHIFT; |
1da177e4 LT |
480 | } |
481 | ||
482 | /** | |
139e5616 | 483 | * __radix_tree_create - create a slot in a radix tree |
1da177e4 LT |
484 | * @root: radix tree root |
485 | * @index: index key | |
e6145236 | 486 | * @order: index occupies 2^order aligned slots |
139e5616 JW |
487 | * @nodep: returns node |
488 | * @slotp: returns slot | |
1da177e4 | 489 | * |
139e5616 JW |
490 | * Create, if necessary, and return the node and slot for an item |
491 | * at position @index in the radix tree @root. | |
492 | * | |
493 | * Until there is more than one item in the tree, no nodes are | |
494 | * allocated and @root->rnode is used as a direct slot instead of | |
495 | * pointing to a node, in which case *@nodep will be NULL. | |
496 | * | |
497 | * Returns -ENOMEM, or 0 for success. | |
1da177e4 | 498 | */ |
139e5616 | 499 | int __radix_tree_create(struct radix_tree_root *root, unsigned long index, |
e6145236 MW |
500 | unsigned order, struct radix_tree_node **nodep, |
501 | void ***slotp) | |
1da177e4 | 502 | { |
89148aa4 MW |
503 | struct radix_tree_node *node = NULL, *child; |
504 | void **slot = (void **)&root->rnode; | |
49ea6ebc | 505 | unsigned long maxindex; |
89148aa4 | 506 | unsigned int shift, offset = 0; |
49ea6ebc MW |
507 | unsigned long max = index | ((1UL << order) - 1); |
508 | ||
89148aa4 | 509 | shift = radix_tree_load_root(root, &child, &maxindex); |
1da177e4 LT |
510 | |
511 | /* Make sure the tree is high enough. */ | |
49ea6ebc | 512 | if (max > maxindex) { |
d0891265 | 513 | int error = radix_tree_extend(root, max, shift); |
49ea6ebc | 514 | if (error < 0) |
1da177e4 | 515 | return error; |
49ea6ebc | 516 | shift = error; |
89148aa4 | 517 | child = root->rnode; |
d0891265 | 518 | if (order == shift) |
49ea6ebc | 519 | shift += RADIX_TREE_MAP_SHIFT; |
1da177e4 LT |
520 | } |
521 | ||
e6145236 | 522 | while (shift > order) { |
c12e51b0 | 523 | shift -= RADIX_TREE_MAP_SHIFT; |
89148aa4 | 524 | if (child == NULL) { |
1da177e4 | 525 | /* Have to add a child node. */ |
89148aa4 MW |
526 | child = radix_tree_node_alloc(root); |
527 | if (!child) | |
1da177e4 | 528 | return -ENOMEM; |
89148aa4 MW |
529 | child->shift = shift; |
530 | child->offset = offset; | |
531 | child->parent = node; | |
532 | rcu_assign_pointer(*slot, node_to_entry(child)); | |
533 | if (node) | |
1da177e4 | 534 | node->count++; |
89148aa4 | 535 | } else if (!radix_tree_is_internal_node(child)) |
e6145236 | 536 | break; |
1da177e4 LT |
537 | |
538 | /* Go a level down */ | |
89148aa4 | 539 | node = entry_to_node(child); |
9e85d811 | 540 | offset = radix_tree_descend(node, &child, index); |
89148aa4 | 541 | slot = &node->slots[offset]; |
e6145236 MW |
542 | } |
543 | ||
57578c2e | 544 | #ifdef CONFIG_RADIX_TREE_MULTIORDER |
e6145236 | 545 | /* Insert pointers to the canonical entry */ |
3b8c00f6 | 546 | if (order > shift) { |
89148aa4 | 547 | unsigned i, n = 1 << (order - shift); |
e6145236 | 548 | offset = offset & ~(n - 1); |
89148aa4 MW |
549 | slot = &node->slots[offset]; |
550 | child = node_to_entry(slot); | |
e6145236 | 551 | for (i = 0; i < n; i++) { |
89148aa4 | 552 | if (slot[i]) |
e6145236 MW |
553 | return -EEXIST; |
554 | } | |
555 | ||
556 | for (i = 1; i < n; i++) { | |
89148aa4 | 557 | rcu_assign_pointer(slot[i], child); |
e6145236 MW |
558 | node->count++; |
559 | } | |
612d6c19 | 560 | } |
57578c2e | 561 | #endif |
1da177e4 | 562 | |
139e5616 JW |
563 | if (nodep) |
564 | *nodep = node; | |
565 | if (slotp) | |
89148aa4 | 566 | *slotp = slot; |
139e5616 JW |
567 | return 0; |
568 | } | |
569 | ||
570 | /** | |
e6145236 | 571 | * __radix_tree_insert - insert into a radix tree |
139e5616 JW |
572 | * @root: radix tree root |
573 | * @index: index key | |
e6145236 | 574 | * @order: key covers the 2^order indices around index |
139e5616 JW |
575 | * @item: item to insert |
576 | * | |
577 | * Insert an item into the radix tree at position @index. | |
578 | */ | |
e6145236 MW |
579 | int __radix_tree_insert(struct radix_tree_root *root, unsigned long index, |
580 | unsigned order, void *item) | |
139e5616 JW |
581 | { |
582 | struct radix_tree_node *node; | |
583 | void **slot; | |
584 | int error; | |
585 | ||
b194d16c | 586 | BUG_ON(radix_tree_is_internal_node(item)); |
139e5616 | 587 | |
e6145236 | 588 | error = __radix_tree_create(root, index, order, &node, &slot); |
139e5616 JW |
589 | if (error) |
590 | return error; | |
591 | if (*slot != NULL) | |
1da177e4 | 592 | return -EEXIST; |
139e5616 | 593 | rcu_assign_pointer(*slot, item); |
201b6264 | 594 | |
612d6c19 | 595 | if (node) { |
7b60e9ad | 596 | unsigned offset = get_slot_offset(node, slot); |
612d6c19 | 597 | node->count++; |
7b60e9ad MW |
598 | BUG_ON(tag_get(node, 0, offset)); |
599 | BUG_ON(tag_get(node, 1, offset)); | |
600 | BUG_ON(tag_get(node, 2, offset)); | |
612d6c19 | 601 | } else { |
7b60e9ad | 602 | BUG_ON(root_tags_get(root)); |
612d6c19 | 603 | } |
1da177e4 | 604 | |
1da177e4 LT |
605 | return 0; |
606 | } | |
e6145236 | 607 | EXPORT_SYMBOL(__radix_tree_insert); |
1da177e4 | 608 | |
139e5616 JW |
609 | /** |
610 | * __radix_tree_lookup - lookup an item in a radix tree | |
611 | * @root: radix tree root | |
612 | * @index: index key | |
613 | * @nodep: returns node | |
614 | * @slotp: returns slot | |
615 | * | |
616 | * Lookup and return the item at position @index in the radix | |
617 | * tree @root. | |
618 | * | |
619 | * Until there is more than one item in the tree, no nodes are | |
620 | * allocated and @root->rnode is used as a direct slot instead of | |
621 | * pointing to a node, in which case *@nodep will be NULL. | |
7cf9c2c7 | 622 | */ |
139e5616 JW |
623 | void *__radix_tree_lookup(struct radix_tree_root *root, unsigned long index, |
624 | struct radix_tree_node **nodep, void ***slotp) | |
1da177e4 | 625 | { |
139e5616 | 626 | struct radix_tree_node *node, *parent; |
85829954 | 627 | unsigned long maxindex; |
139e5616 | 628 | void **slot; |
612d6c19 | 629 | |
85829954 MW |
630 | restart: |
631 | parent = NULL; | |
632 | slot = (void **)&root->rnode; | |
9e85d811 | 633 | radix_tree_load_root(root, &node, &maxindex); |
85829954 | 634 | if (index > maxindex) |
1da177e4 LT |
635 | return NULL; |
636 | ||
b194d16c | 637 | while (radix_tree_is_internal_node(node)) { |
85829954 | 638 | unsigned offset; |
1da177e4 | 639 | |
85829954 MW |
640 | if (node == RADIX_TREE_RETRY) |
641 | goto restart; | |
4dd6c098 | 642 | parent = entry_to_node(node); |
9e85d811 | 643 | offset = radix_tree_descend(parent, &node, index); |
85829954 MW |
644 | slot = parent->slots + offset; |
645 | } | |
1da177e4 | 646 | |
139e5616 JW |
647 | if (nodep) |
648 | *nodep = parent; | |
649 | if (slotp) | |
650 | *slotp = slot; | |
651 | return node; | |
b72b71c6 HS |
652 | } |
653 | ||
654 | /** | |
655 | * radix_tree_lookup_slot - lookup a slot in a radix tree | |
656 | * @root: radix tree root | |
657 | * @index: index key | |
658 | * | |
659 | * Returns: the slot corresponding to the position @index in the | |
660 | * radix tree @root. This is useful for update-if-exists operations. | |
661 | * | |
662 | * This function can be called under rcu_read_lock iff the slot is not | |
663 | * modified by radix_tree_replace_slot, otherwise it must be called | |
664 | * exclusive from other writers. Any dereference of the slot must be done | |
665 | * using radix_tree_deref_slot. | |
666 | */ | |
667 | void **radix_tree_lookup_slot(struct radix_tree_root *root, unsigned long index) | |
668 | { | |
139e5616 JW |
669 | void **slot; |
670 | ||
671 | if (!__radix_tree_lookup(root, index, NULL, &slot)) | |
672 | return NULL; | |
673 | return slot; | |
a4331366 | 674 | } |
a4331366 HR |
675 | EXPORT_SYMBOL(radix_tree_lookup_slot); |
676 | ||
677 | /** | |
678 | * radix_tree_lookup - perform lookup operation on a radix tree | |
679 | * @root: radix tree root | |
680 | * @index: index key | |
681 | * | |
682 | * Lookup the item at the position @index in the radix tree @root. | |
7cf9c2c7 NP |
683 | * |
684 | * This function can be called under rcu_read_lock, however the caller | |
685 | * must manage lifetimes of leaf nodes (eg. RCU may also be used to free | |
686 | * them safely). No RCU barriers are required to access or modify the | |
687 | * returned item, however. | |
a4331366 HR |
688 | */ |
689 | void *radix_tree_lookup(struct radix_tree_root *root, unsigned long index) | |
690 | { | |
139e5616 | 691 | return __radix_tree_lookup(root, index, NULL, NULL); |
1da177e4 LT |
692 | } |
693 | EXPORT_SYMBOL(radix_tree_lookup); | |
694 | ||
695 | /** | |
696 | * radix_tree_tag_set - set a tag on a radix tree node | |
697 | * @root: radix tree root | |
698 | * @index: index key | |
2fcd9005 | 699 | * @tag: tag index |
1da177e4 | 700 | * |
daff89f3 JC |
701 | * Set the search tag (which must be < RADIX_TREE_MAX_TAGS) |
702 | * corresponding to @index in the radix tree. From | |
1da177e4 LT |
703 | * the root all the way down to the leaf node. |
704 | * | |
2fcd9005 | 705 | * Returns the address of the tagged item. Setting a tag on a not-present |
1da177e4 LT |
706 | * item is a bug. |
707 | */ | |
708 | void *radix_tree_tag_set(struct radix_tree_root *root, | |
daff89f3 | 709 | unsigned long index, unsigned int tag) |
1da177e4 | 710 | { |
fb969909 RZ |
711 | struct radix_tree_node *node, *parent; |
712 | unsigned long maxindex; | |
1da177e4 | 713 | |
9e85d811 | 714 | radix_tree_load_root(root, &node, &maxindex); |
fb969909 | 715 | BUG_ON(index > maxindex); |
1da177e4 | 716 | |
b194d16c | 717 | while (radix_tree_is_internal_node(node)) { |
fb969909 | 718 | unsigned offset; |
1da177e4 | 719 | |
4dd6c098 | 720 | parent = entry_to_node(node); |
9e85d811 | 721 | offset = radix_tree_descend(parent, &node, index); |
fb969909 RZ |
722 | BUG_ON(!node); |
723 | ||
724 | if (!tag_get(parent, tag, offset)) | |
725 | tag_set(parent, tag, offset); | |
1da177e4 LT |
726 | } |
727 | ||
612d6c19 | 728 | /* set the root's tag bit */ |
fb969909 | 729 | if (!root_tag_get(root, tag)) |
612d6c19 NP |
730 | root_tag_set(root, tag); |
731 | ||
fb969909 | 732 | return node; |
1da177e4 LT |
733 | } |
734 | EXPORT_SYMBOL(radix_tree_tag_set); | |
735 | ||
d604c324 MW |
736 | static void node_tag_clear(struct radix_tree_root *root, |
737 | struct radix_tree_node *node, | |
738 | unsigned int tag, unsigned int offset) | |
739 | { | |
740 | while (node) { | |
741 | if (!tag_get(node, tag, offset)) | |
742 | return; | |
743 | tag_clear(node, tag, offset); | |
744 | if (any_tag_set(node, tag)) | |
745 | return; | |
746 | ||
747 | offset = node->offset; | |
748 | node = node->parent; | |
749 | } | |
750 | ||
751 | /* clear the root's tag bit */ | |
752 | if (root_tag_get(root, tag)) | |
753 | root_tag_clear(root, tag); | |
754 | } | |
755 | ||
1da177e4 LT |
756 | /** |
757 | * radix_tree_tag_clear - clear a tag on a radix tree node | |
758 | * @root: radix tree root | |
759 | * @index: index key | |
2fcd9005 | 760 | * @tag: tag index |
1da177e4 | 761 | * |
daff89f3 | 762 | * Clear the search tag (which must be < RADIX_TREE_MAX_TAGS) |
2fcd9005 MW |
763 | * corresponding to @index in the radix tree. If this causes |
764 | * the leaf node to have no tags set then clear the tag in the | |
1da177e4 LT |
765 | * next-to-leaf node, etc. |
766 | * | |
767 | * Returns the address of the tagged item on success, else NULL. ie: | |
768 | * has the same return value and semantics as radix_tree_lookup(). | |
769 | */ | |
770 | void *radix_tree_tag_clear(struct radix_tree_root *root, | |
daff89f3 | 771 | unsigned long index, unsigned int tag) |
1da177e4 | 772 | { |
00f47b58 RZ |
773 | struct radix_tree_node *node, *parent; |
774 | unsigned long maxindex; | |
e2bdb933 | 775 | int uninitialized_var(offset); |
1da177e4 | 776 | |
9e85d811 | 777 | radix_tree_load_root(root, &node, &maxindex); |
00f47b58 RZ |
778 | if (index > maxindex) |
779 | return NULL; | |
1da177e4 | 780 | |
00f47b58 | 781 | parent = NULL; |
1da177e4 | 782 | |
b194d16c | 783 | while (radix_tree_is_internal_node(node)) { |
4dd6c098 | 784 | parent = entry_to_node(node); |
9e85d811 | 785 | offset = radix_tree_descend(parent, &node, index); |
1da177e4 LT |
786 | } |
787 | ||
d604c324 MW |
788 | if (node) |
789 | node_tag_clear(root, parent, tag, offset); | |
1da177e4 | 790 | |
00f47b58 | 791 | return node; |
1da177e4 LT |
792 | } |
793 | EXPORT_SYMBOL(radix_tree_tag_clear); | |
794 | ||
1da177e4 | 795 | /** |
32605a18 MT |
796 | * radix_tree_tag_get - get a tag on a radix tree node |
797 | * @root: radix tree root | |
798 | * @index: index key | |
2fcd9005 | 799 | * @tag: tag index (< RADIX_TREE_MAX_TAGS) |
1da177e4 | 800 | * |
32605a18 | 801 | * Return values: |
1da177e4 | 802 | * |
612d6c19 NP |
803 | * 0: tag not present or not set |
804 | * 1: tag set | |
ce82653d DH |
805 | * |
806 | * Note that the return value of this function may not be relied on, even if | |
807 | * the RCU lock is held, unless tag modification and node deletion are excluded | |
808 | * from concurrency. | |
1da177e4 LT |
809 | */ |
810 | int radix_tree_tag_get(struct radix_tree_root *root, | |
daff89f3 | 811 | unsigned long index, unsigned int tag) |
1da177e4 | 812 | { |
4589ba6d RZ |
813 | struct radix_tree_node *node, *parent; |
814 | unsigned long maxindex; | |
1da177e4 | 815 | |
612d6c19 NP |
816 | if (!root_tag_get(root, tag)) |
817 | return 0; | |
818 | ||
9e85d811 | 819 | radix_tree_load_root(root, &node, &maxindex); |
4589ba6d RZ |
820 | if (index > maxindex) |
821 | return 0; | |
7cf9c2c7 NP |
822 | if (node == NULL) |
823 | return 0; | |
824 | ||
b194d16c | 825 | while (radix_tree_is_internal_node(node)) { |
9e85d811 | 826 | unsigned offset; |
1da177e4 | 827 | |
4dd6c098 | 828 | parent = entry_to_node(node); |
9e85d811 | 829 | offset = radix_tree_descend(parent, &node, index); |
1da177e4 | 830 | |
4589ba6d | 831 | if (!node) |
1da177e4 | 832 | return 0; |
4589ba6d | 833 | if (!tag_get(parent, tag, offset)) |
3fa36acb | 834 | return 0; |
4589ba6d RZ |
835 | if (node == RADIX_TREE_RETRY) |
836 | break; | |
1da177e4 | 837 | } |
4589ba6d RZ |
838 | |
839 | return 1; | |
1da177e4 LT |
840 | } |
841 | EXPORT_SYMBOL(radix_tree_tag_get); | |
1da177e4 | 842 | |
21ef5339 RZ |
843 | static inline void __set_iter_shift(struct radix_tree_iter *iter, |
844 | unsigned int shift) | |
845 | { | |
846 | #ifdef CONFIG_RADIX_TREE_MULTIORDER | |
847 | iter->shift = shift; | |
848 | #endif | |
849 | } | |
850 | ||
78c1d784 KK |
851 | /** |
852 | * radix_tree_next_chunk - find next chunk of slots for iteration | |
853 | * | |
854 | * @root: radix tree root | |
855 | * @iter: iterator state | |
856 | * @flags: RADIX_TREE_ITER_* flags and tag index | |
857 | * Returns: pointer to chunk first slot, or NULL if iteration is over | |
858 | */ | |
859 | void **radix_tree_next_chunk(struct radix_tree_root *root, | |
860 | struct radix_tree_iter *iter, unsigned flags) | |
861 | { | |
9e85d811 | 862 | unsigned tag = flags & RADIX_TREE_ITER_TAG_MASK; |
8c1244de | 863 | struct radix_tree_node *node, *child; |
21ef5339 | 864 | unsigned long index, offset, maxindex; |
78c1d784 KK |
865 | |
866 | if ((flags & RADIX_TREE_ITER_TAGGED) && !root_tag_get(root, tag)) | |
867 | return NULL; | |
868 | ||
869 | /* | |
870 | * Catch next_index overflow after ~0UL. iter->index never overflows | |
871 | * during iterating; it can be zero only at the beginning. | |
872 | * And we cannot overflow iter->next_index in a single step, | |
873 | * because RADIX_TREE_MAP_SHIFT < BITS_PER_LONG. | |
fffaee36 KK |
874 | * |
875 | * This condition also used by radix_tree_next_slot() to stop | |
876 | * contiguous iterating, and forbid swithing to the next chunk. | |
78c1d784 KK |
877 | */ |
878 | index = iter->next_index; | |
879 | if (!index && iter->index) | |
880 | return NULL; | |
881 | ||
21ef5339 | 882 | restart: |
9e85d811 | 883 | radix_tree_load_root(root, &child, &maxindex); |
21ef5339 RZ |
884 | if (index > maxindex) |
885 | return NULL; | |
8c1244de MW |
886 | if (!child) |
887 | return NULL; | |
21ef5339 | 888 | |
8c1244de | 889 | if (!radix_tree_is_internal_node(child)) { |
78c1d784 | 890 | /* Single-slot tree */ |
21ef5339 RZ |
891 | iter->index = index; |
892 | iter->next_index = maxindex + 1; | |
78c1d784 | 893 | iter->tags = 1; |
8c1244de | 894 | __set_iter_shift(iter, 0); |
78c1d784 | 895 | return (void **)&root->rnode; |
8c1244de | 896 | } |
21ef5339 | 897 | |
8c1244de MW |
898 | do { |
899 | node = entry_to_node(child); | |
9e85d811 | 900 | offset = radix_tree_descend(node, &child, index); |
21ef5339 | 901 | |
78c1d784 | 902 | if ((flags & RADIX_TREE_ITER_TAGGED) ? |
8c1244de | 903 | !tag_get(node, tag, offset) : !child) { |
78c1d784 KK |
904 | /* Hole detected */ |
905 | if (flags & RADIX_TREE_ITER_CONTIG) | |
906 | return NULL; | |
907 | ||
908 | if (flags & RADIX_TREE_ITER_TAGGED) | |
909 | offset = radix_tree_find_next_bit( | |
910 | node->tags[tag], | |
911 | RADIX_TREE_MAP_SIZE, | |
912 | offset + 1); | |
913 | else | |
914 | while (++offset < RADIX_TREE_MAP_SIZE) { | |
21ef5339 RZ |
915 | void *slot = node->slots[offset]; |
916 | if (is_sibling_entry(node, slot)) | |
917 | continue; | |
918 | if (slot) | |
78c1d784 KK |
919 | break; |
920 | } | |
8c1244de | 921 | index &= ~node_maxindex(node); |
9e85d811 | 922 | index += offset << node->shift; |
78c1d784 KK |
923 | /* Overflow after ~0UL */ |
924 | if (!index) | |
925 | return NULL; | |
926 | if (offset == RADIX_TREE_MAP_SIZE) | |
927 | goto restart; | |
8c1244de | 928 | child = rcu_dereference_raw(node->slots[offset]); |
78c1d784 KK |
929 | } |
930 | ||
8c1244de | 931 | if ((child == NULL) || (child == RADIX_TREE_RETRY)) |
78c1d784 | 932 | goto restart; |
8c1244de | 933 | } while (radix_tree_is_internal_node(child)); |
78c1d784 KK |
934 | |
935 | /* Update the iterator state */ | |
8c1244de MW |
936 | iter->index = (index &~ node_maxindex(node)) | (offset << node->shift); |
937 | iter->next_index = (index | node_maxindex(node)) + 1; | |
9e85d811 | 938 | __set_iter_shift(iter, node->shift); |
78c1d784 KK |
939 | |
940 | /* Construct iter->tags bit-mask from node->tags[tag] array */ | |
941 | if (flags & RADIX_TREE_ITER_TAGGED) { | |
942 | unsigned tag_long, tag_bit; | |
943 | ||
944 | tag_long = offset / BITS_PER_LONG; | |
945 | tag_bit = offset % BITS_PER_LONG; | |
946 | iter->tags = node->tags[tag][tag_long] >> tag_bit; | |
947 | /* This never happens if RADIX_TREE_TAG_LONGS == 1 */ | |
948 | if (tag_long < RADIX_TREE_TAG_LONGS - 1) { | |
949 | /* Pick tags from next element */ | |
950 | if (tag_bit) | |
951 | iter->tags |= node->tags[tag][tag_long + 1] << | |
952 | (BITS_PER_LONG - tag_bit); | |
953 | /* Clip chunk size, here only BITS_PER_LONG tags */ | |
954 | iter->next_index = index + BITS_PER_LONG; | |
955 | } | |
956 | } | |
957 | ||
958 | return node->slots + offset; | |
959 | } | |
960 | EXPORT_SYMBOL(radix_tree_next_chunk); | |
961 | ||
ebf8aa44 JK |
962 | /** |
963 | * radix_tree_range_tag_if_tagged - for each item in given range set given | |
964 | * tag if item has another tag set | |
965 | * @root: radix tree root | |
966 | * @first_indexp: pointer to a starting index of a range to scan | |
967 | * @last_index: last index of a range to scan | |
968 | * @nr_to_tag: maximum number items to tag | |
969 | * @iftag: tag index to test | |
970 | * @settag: tag index to set if tested tag is set | |
971 | * | |
972 | * This function scans range of radix tree from first_index to last_index | |
973 | * (inclusive). For each item in the range if iftag is set, the function sets | |
974 | * also settag. The function stops either after tagging nr_to_tag items or | |
975 | * after reaching last_index. | |
976 | * | |
144dcfc0 DC |
977 | * The tags must be set from the leaf level only and propagated back up the |
978 | * path to the root. We must do this so that we resolve the full path before | |
979 | * setting any tags on intermediate nodes. If we set tags as we descend, then | |
980 | * we can get to the leaf node and find that the index that has the iftag | |
981 | * set is outside the range we are scanning. This reults in dangling tags and | |
982 | * can lead to problems with later tag operations (e.g. livelocks on lookups). | |
983 | * | |
2fcd9005 | 984 | * The function returns the number of leaves where the tag was set and sets |
ebf8aa44 | 985 | * *first_indexp to the first unscanned index. |
d5ed3a4a JK |
986 | * WARNING! *first_indexp can wrap if last_index is ULONG_MAX. Caller must |
987 | * be prepared to handle that. | |
ebf8aa44 JK |
988 | */ |
989 | unsigned long radix_tree_range_tag_if_tagged(struct radix_tree_root *root, | |
990 | unsigned long *first_indexp, unsigned long last_index, | |
991 | unsigned long nr_to_tag, | |
992 | unsigned int iftag, unsigned int settag) | |
993 | { | |
a8e4da25 | 994 | struct radix_tree_node *parent, *node, *child; |
070c5ac2 | 995 | unsigned long maxindex; |
144dcfc0 DC |
996 | unsigned long tagged = 0; |
997 | unsigned long index = *first_indexp; | |
ebf8aa44 | 998 | |
9e85d811 | 999 | radix_tree_load_root(root, &child, &maxindex); |
070c5ac2 | 1000 | last_index = min(last_index, maxindex); |
ebf8aa44 JK |
1001 | if (index > last_index) |
1002 | return 0; | |
1003 | if (!nr_to_tag) | |
1004 | return 0; | |
1005 | if (!root_tag_get(root, iftag)) { | |
1006 | *first_indexp = last_index + 1; | |
1007 | return 0; | |
1008 | } | |
a8e4da25 | 1009 | if (!radix_tree_is_internal_node(child)) { |
ebf8aa44 JK |
1010 | *first_indexp = last_index + 1; |
1011 | root_tag_set(root, settag); | |
1012 | return 1; | |
1013 | } | |
1014 | ||
a8e4da25 | 1015 | node = entry_to_node(child); |
ebf8aa44 JK |
1016 | |
1017 | for (;;) { | |
9e85d811 | 1018 | unsigned offset = radix_tree_descend(node, &child, index); |
a8e4da25 | 1019 | if (!child) |
ebf8aa44 | 1020 | goto next; |
070c5ac2 | 1021 | if (!tag_get(node, iftag, offset)) |
ebf8aa44 | 1022 | goto next; |
070c5ac2 | 1023 | /* Sibling slots never have tags set on them */ |
a8e4da25 MW |
1024 | if (radix_tree_is_internal_node(child)) { |
1025 | node = entry_to_node(child); | |
070c5ac2 | 1026 | continue; |
144dcfc0 DC |
1027 | } |
1028 | ||
1029 | /* tag the leaf */ | |
070c5ac2 MW |
1030 | tagged++; |
1031 | tag_set(node, settag, offset); | |
144dcfc0 DC |
1032 | |
1033 | /* walk back up the path tagging interior nodes */ | |
a8e4da25 MW |
1034 | parent = node; |
1035 | for (;;) { | |
1036 | offset = parent->offset; | |
1037 | parent = parent->parent; | |
1038 | if (!parent) | |
1039 | break; | |
144dcfc0 | 1040 | /* stop if we find a node with the tag already set */ |
a8e4da25 | 1041 | if (tag_get(parent, settag, offset)) |
144dcfc0 | 1042 | break; |
a8e4da25 | 1043 | tag_set(parent, settag, offset); |
ebf8aa44 | 1044 | } |
070c5ac2 | 1045 | next: |
9e85d811 MW |
1046 | /* Go to next entry in node */ |
1047 | index = ((index >> node->shift) + 1) << node->shift; | |
d5ed3a4a JK |
1048 | /* Overflow can happen when last_index is ~0UL... */ |
1049 | if (index > last_index || !index) | |
ebf8aa44 | 1050 | break; |
9e85d811 | 1051 | offset = (index >> node->shift) & RADIX_TREE_MAP_MASK; |
070c5ac2 | 1052 | while (offset == 0) { |
ebf8aa44 JK |
1053 | /* |
1054 | * We've fully scanned this node. Go up. Because | |
1055 | * last_index is guaranteed to be in the tree, what | |
1056 | * we do below cannot wander astray. | |
1057 | */ | |
070c5ac2 | 1058 | node = node->parent; |
9e85d811 | 1059 | offset = (index >> node->shift) & RADIX_TREE_MAP_MASK; |
ebf8aa44 | 1060 | } |
070c5ac2 MW |
1061 | if (is_sibling_entry(node, node->slots[offset])) |
1062 | goto next; | |
1063 | if (tagged >= nr_to_tag) | |
1064 | break; | |
ebf8aa44 JK |
1065 | } |
1066 | /* | |
ac15ee69 TO |
1067 | * We need not to tag the root tag if there is no tag which is set with |
1068 | * settag within the range from *first_indexp to last_index. | |
ebf8aa44 | 1069 | */ |
ac15ee69 TO |
1070 | if (tagged > 0) |
1071 | root_tag_set(root, settag); | |
ebf8aa44 JK |
1072 | *first_indexp = index; |
1073 | ||
1074 | return tagged; | |
1075 | } | |
1076 | EXPORT_SYMBOL(radix_tree_range_tag_if_tagged); | |
1077 | ||
1da177e4 LT |
1078 | /** |
1079 | * radix_tree_gang_lookup - perform multiple lookup on a radix tree | |
1080 | * @root: radix tree root | |
1081 | * @results: where the results of the lookup are placed | |
1082 | * @first_index: start the lookup from this key | |
1083 | * @max_items: place up to this many items at *results | |
1084 | * | |
1085 | * Performs an index-ascending scan of the tree for present items. Places | |
1086 | * them at *@results and returns the number of items which were placed at | |
1087 | * *@results. | |
1088 | * | |
1089 | * The implementation is naive. | |
7cf9c2c7 NP |
1090 | * |
1091 | * Like radix_tree_lookup, radix_tree_gang_lookup may be called under | |
1092 | * rcu_read_lock. In this case, rather than the returned results being | |
2fcd9005 MW |
1093 | * an atomic snapshot of the tree at a single point in time, the |
1094 | * semantics of an RCU protected gang lookup are as though multiple | |
1095 | * radix_tree_lookups have been issued in individual locks, and results | |
1096 | * stored in 'results'. | |
1da177e4 LT |
1097 | */ |
1098 | unsigned int | |
1099 | radix_tree_gang_lookup(struct radix_tree_root *root, void **results, | |
1100 | unsigned long first_index, unsigned int max_items) | |
1101 | { | |
cebbd29e KK |
1102 | struct radix_tree_iter iter; |
1103 | void **slot; | |
1104 | unsigned int ret = 0; | |
7cf9c2c7 | 1105 | |
cebbd29e | 1106 | if (unlikely(!max_items)) |
7cf9c2c7 | 1107 | return 0; |
1da177e4 | 1108 | |
cebbd29e | 1109 | radix_tree_for_each_slot(slot, root, &iter, first_index) { |
46437f9a | 1110 | results[ret] = rcu_dereference_raw(*slot); |
cebbd29e KK |
1111 | if (!results[ret]) |
1112 | continue; | |
b194d16c | 1113 | if (radix_tree_is_internal_node(results[ret])) { |
46437f9a MW |
1114 | slot = radix_tree_iter_retry(&iter); |
1115 | continue; | |
1116 | } | |
cebbd29e | 1117 | if (++ret == max_items) |
1da177e4 | 1118 | break; |
1da177e4 | 1119 | } |
7cf9c2c7 | 1120 | |
1da177e4 LT |
1121 | return ret; |
1122 | } | |
1123 | EXPORT_SYMBOL(radix_tree_gang_lookup); | |
1124 | ||
47feff2c NP |
1125 | /** |
1126 | * radix_tree_gang_lookup_slot - perform multiple slot lookup on radix tree | |
1127 | * @root: radix tree root | |
1128 | * @results: where the results of the lookup are placed | |
6328650b | 1129 | * @indices: where their indices should be placed (but usually NULL) |
47feff2c NP |
1130 | * @first_index: start the lookup from this key |
1131 | * @max_items: place up to this many items at *results | |
1132 | * | |
1133 | * Performs an index-ascending scan of the tree for present items. Places | |
1134 | * their slots at *@results and returns the number of items which were | |
1135 | * placed at *@results. | |
1136 | * | |
1137 | * The implementation is naive. | |
1138 | * | |
1139 | * Like radix_tree_gang_lookup as far as RCU and locking goes. Slots must | |
1140 | * be dereferenced with radix_tree_deref_slot, and if using only RCU | |
1141 | * protection, radix_tree_deref_slot may fail requiring a retry. | |
1142 | */ | |
1143 | unsigned int | |
6328650b HD |
1144 | radix_tree_gang_lookup_slot(struct radix_tree_root *root, |
1145 | void ***results, unsigned long *indices, | |
47feff2c NP |
1146 | unsigned long first_index, unsigned int max_items) |
1147 | { | |
cebbd29e KK |
1148 | struct radix_tree_iter iter; |
1149 | void **slot; | |
1150 | unsigned int ret = 0; | |
47feff2c | 1151 | |
cebbd29e | 1152 | if (unlikely(!max_items)) |
47feff2c NP |
1153 | return 0; |
1154 | ||
cebbd29e KK |
1155 | radix_tree_for_each_slot(slot, root, &iter, first_index) { |
1156 | results[ret] = slot; | |
6328650b | 1157 | if (indices) |
cebbd29e KK |
1158 | indices[ret] = iter.index; |
1159 | if (++ret == max_items) | |
47feff2c | 1160 | break; |
47feff2c NP |
1161 | } |
1162 | ||
1163 | return ret; | |
1164 | } | |
1165 | EXPORT_SYMBOL(radix_tree_gang_lookup_slot); | |
1166 | ||
1da177e4 LT |
1167 | /** |
1168 | * radix_tree_gang_lookup_tag - perform multiple lookup on a radix tree | |
1169 | * based on a tag | |
1170 | * @root: radix tree root | |
1171 | * @results: where the results of the lookup are placed | |
1172 | * @first_index: start the lookup from this key | |
1173 | * @max_items: place up to this many items at *results | |
daff89f3 | 1174 | * @tag: the tag index (< RADIX_TREE_MAX_TAGS) |
1da177e4 LT |
1175 | * |
1176 | * Performs an index-ascending scan of the tree for present items which | |
1177 | * have the tag indexed by @tag set. Places the items at *@results and | |
1178 | * returns the number of items which were placed at *@results. | |
1179 | */ | |
1180 | unsigned int | |
1181 | radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results, | |
daff89f3 JC |
1182 | unsigned long first_index, unsigned int max_items, |
1183 | unsigned int tag) | |
1da177e4 | 1184 | { |
cebbd29e KK |
1185 | struct radix_tree_iter iter; |
1186 | void **slot; | |
1187 | unsigned int ret = 0; | |
612d6c19 | 1188 | |
cebbd29e | 1189 | if (unlikely(!max_items)) |
7cf9c2c7 NP |
1190 | return 0; |
1191 | ||
cebbd29e | 1192 | radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) { |
46437f9a | 1193 | results[ret] = rcu_dereference_raw(*slot); |
cebbd29e KK |
1194 | if (!results[ret]) |
1195 | continue; | |
b194d16c | 1196 | if (radix_tree_is_internal_node(results[ret])) { |
46437f9a MW |
1197 | slot = radix_tree_iter_retry(&iter); |
1198 | continue; | |
1199 | } | |
cebbd29e | 1200 | if (++ret == max_items) |
1da177e4 | 1201 | break; |
1da177e4 | 1202 | } |
7cf9c2c7 | 1203 | |
1da177e4 LT |
1204 | return ret; |
1205 | } | |
1206 | EXPORT_SYMBOL(radix_tree_gang_lookup_tag); | |
1207 | ||
47feff2c NP |
1208 | /** |
1209 | * radix_tree_gang_lookup_tag_slot - perform multiple slot lookup on a | |
1210 | * radix tree based on a tag | |
1211 | * @root: radix tree root | |
1212 | * @results: where the results of the lookup are placed | |
1213 | * @first_index: start the lookup from this key | |
1214 | * @max_items: place up to this many items at *results | |
1215 | * @tag: the tag index (< RADIX_TREE_MAX_TAGS) | |
1216 | * | |
1217 | * Performs an index-ascending scan of the tree for present items which | |
1218 | * have the tag indexed by @tag set. Places the slots at *@results and | |
1219 | * returns the number of slots which were placed at *@results. | |
1220 | */ | |
1221 | unsigned int | |
1222 | radix_tree_gang_lookup_tag_slot(struct radix_tree_root *root, void ***results, | |
1223 | unsigned long first_index, unsigned int max_items, | |
1224 | unsigned int tag) | |
1225 | { | |
cebbd29e KK |
1226 | struct radix_tree_iter iter; |
1227 | void **slot; | |
1228 | unsigned int ret = 0; | |
47feff2c | 1229 | |
cebbd29e | 1230 | if (unlikely(!max_items)) |
47feff2c NP |
1231 | return 0; |
1232 | ||
cebbd29e KK |
1233 | radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) { |
1234 | results[ret] = slot; | |
1235 | if (++ret == max_items) | |
47feff2c | 1236 | break; |
47feff2c NP |
1237 | } |
1238 | ||
1239 | return ret; | |
1240 | } | |
1241 | EXPORT_SYMBOL(radix_tree_gang_lookup_tag_slot); | |
1242 | ||
e504f3fd HD |
1243 | #if defined(CONFIG_SHMEM) && defined(CONFIG_SWAP) |
1244 | #include <linux/sched.h> /* for cond_resched() */ | |
1245 | ||
0a2efc6c MW |
1246 | struct locate_info { |
1247 | unsigned long found_index; | |
1248 | bool stop; | |
1249 | }; | |
1250 | ||
e504f3fd HD |
1251 | /* |
1252 | * This linear search is at present only useful to shmem_unuse_inode(). | |
1253 | */ | |
1254 | static unsigned long __locate(struct radix_tree_node *slot, void *item, | |
0a2efc6c | 1255 | unsigned long index, struct locate_info *info) |
e504f3fd | 1256 | { |
e504f3fd HD |
1257 | unsigned long i; |
1258 | ||
0a2efc6c | 1259 | do { |
9e85d811 | 1260 | unsigned int shift = slot->shift; |
e504f3fd | 1261 | |
0a2efc6c MW |
1262 | for (i = (index >> shift) & RADIX_TREE_MAP_MASK; |
1263 | i < RADIX_TREE_MAP_SIZE; | |
1264 | i++, index += (1UL << shift)) { | |
1265 | struct radix_tree_node *node = | |
1266 | rcu_dereference_raw(slot->slots[i]); | |
1267 | if (node == RADIX_TREE_RETRY) | |
1268 | goto out; | |
b194d16c | 1269 | if (!radix_tree_is_internal_node(node)) { |
0a2efc6c MW |
1270 | if (node == item) { |
1271 | info->found_index = index; | |
1272 | info->stop = true; | |
1273 | goto out; | |
1274 | } | |
1275 | continue; | |
e6145236 | 1276 | } |
4dd6c098 | 1277 | node = entry_to_node(node); |
0a2efc6c MW |
1278 | if (is_sibling_entry(slot, node)) |
1279 | continue; | |
1280 | slot = node; | |
1281 | break; | |
e6145236 | 1282 | } |
9e85d811 | 1283 | } while (i < RADIX_TREE_MAP_SIZE); |
e504f3fd | 1284 | |
e504f3fd | 1285 | out: |
0a2efc6c MW |
1286 | if ((index == 0) && (i == RADIX_TREE_MAP_SIZE)) |
1287 | info->stop = true; | |
e504f3fd HD |
1288 | return index; |
1289 | } | |
1290 | ||
1291 | /** | |
1292 | * radix_tree_locate_item - search through radix tree for item | |
1293 | * @root: radix tree root | |
1294 | * @item: item to be found | |
1295 | * | |
1296 | * Returns index where item was found, or -1 if not found. | |
1297 | * Caller must hold no lock (since this time-consuming function needs | |
1298 | * to be preemptible), and must check afterwards if item is still there. | |
1299 | */ | |
1300 | unsigned long radix_tree_locate_item(struct radix_tree_root *root, void *item) | |
1301 | { | |
1302 | struct radix_tree_node *node; | |
1303 | unsigned long max_index; | |
1304 | unsigned long cur_index = 0; | |
0a2efc6c MW |
1305 | struct locate_info info = { |
1306 | .found_index = -1, | |
1307 | .stop = false, | |
1308 | }; | |
e504f3fd HD |
1309 | |
1310 | do { | |
1311 | rcu_read_lock(); | |
1312 | node = rcu_dereference_raw(root->rnode); | |
b194d16c | 1313 | if (!radix_tree_is_internal_node(node)) { |
e504f3fd HD |
1314 | rcu_read_unlock(); |
1315 | if (node == item) | |
0a2efc6c | 1316 | info.found_index = 0; |
e504f3fd HD |
1317 | break; |
1318 | } | |
1319 | ||
4dd6c098 | 1320 | node = entry_to_node(node); |
0a2efc6c MW |
1321 | |
1322 | max_index = node_maxindex(node); | |
5f30fc94 HD |
1323 | if (cur_index > max_index) { |
1324 | rcu_read_unlock(); | |
e504f3fd | 1325 | break; |
5f30fc94 | 1326 | } |
e504f3fd | 1327 | |
0a2efc6c | 1328 | cur_index = __locate(node, item, cur_index, &info); |
e504f3fd HD |
1329 | rcu_read_unlock(); |
1330 | cond_resched(); | |
0a2efc6c | 1331 | } while (!info.stop && cur_index <= max_index); |
e504f3fd | 1332 | |
0a2efc6c | 1333 | return info.found_index; |
e504f3fd HD |
1334 | } |
1335 | #else | |
1336 | unsigned long radix_tree_locate_item(struct radix_tree_root *root, void *item) | |
1337 | { | |
1338 | return -1; | |
1339 | } | |
1340 | #endif /* CONFIG_SHMEM && CONFIG_SWAP */ | |
47feff2c | 1341 | |
a5f51c96 | 1342 | /** |
d0891265 | 1343 | * radix_tree_shrink - shrink radix tree to minimum height |
a5f51c96 NP |
1344 | * @root radix tree root |
1345 | */ | |
fb209019 | 1346 | static inline bool radix_tree_shrink(struct radix_tree_root *root) |
a5f51c96 | 1347 | { |
fb209019 MW |
1348 | bool shrunk = false; |
1349 | ||
d0891265 | 1350 | for (;;) { |
af49a63e MW |
1351 | struct radix_tree_node *node = root->rnode; |
1352 | struct radix_tree_node *child; | |
a5f51c96 | 1353 | |
af49a63e | 1354 | if (!radix_tree_is_internal_node(node)) |
d0891265 | 1355 | break; |
af49a63e | 1356 | node = entry_to_node(node); |
c0bc9875 NP |
1357 | |
1358 | /* | |
1359 | * The candidate node has more than one child, or its child | |
d0891265 MW |
1360 | * is not at the leftmost slot, or the child is a multiorder |
1361 | * entry, we cannot shrink. | |
c0bc9875 | 1362 | */ |
af49a63e | 1363 | if (node->count != 1) |
c0bc9875 | 1364 | break; |
af49a63e MW |
1365 | child = node->slots[0]; |
1366 | if (!child) | |
c0bc9875 | 1367 | break; |
af49a63e | 1368 | if (!radix_tree_is_internal_node(child) && node->shift) |
afe0e395 MW |
1369 | break; |
1370 | ||
af49a63e MW |
1371 | if (radix_tree_is_internal_node(child)) |
1372 | entry_to_node(child)->parent = NULL; | |
c0bc9875 | 1373 | |
7cf9c2c7 NP |
1374 | /* |
1375 | * We don't need rcu_assign_pointer(), since we are simply | |
27d20fdd NP |
1376 | * moving the node from one part of the tree to another: if it |
1377 | * was safe to dereference the old pointer to it | |
af49a63e | 1378 | * (node->slots[0]), it will be safe to dereference the new |
27d20fdd | 1379 | * one (root->rnode) as far as dependent read barriers go. |
7cf9c2c7 | 1380 | */ |
af49a63e | 1381 | root->rnode = child; |
27d20fdd NP |
1382 | |
1383 | /* | |
1384 | * We have a dilemma here. The node's slot[0] must not be | |
1385 | * NULLed in case there are concurrent lookups expecting to | |
1386 | * find the item. However if this was a bottom-level node, | |
1387 | * then it may be subject to the slot pointer being visible | |
1388 | * to callers dereferencing it. If item corresponding to | |
1389 | * slot[0] is subsequently deleted, these callers would expect | |
1390 | * their slot to become empty sooner or later. | |
1391 | * | |
1392 | * For example, lockless pagecache will look up a slot, deref | |
2fcd9005 | 1393 | * the page pointer, and if the page has 0 refcount it means it |
27d20fdd NP |
1394 | * was concurrently deleted from pagecache so try the deref |
1395 | * again. Fortunately there is already a requirement for logic | |
1396 | * to retry the entire slot lookup -- the indirect pointer | |
1397 | * problem (replacing direct root node with an indirect pointer | |
1398 | * also results in a stale slot). So tag the slot as indirect | |
1399 | * to force callers to retry. | |
1400 | */ | |
af49a63e MW |
1401 | if (!radix_tree_is_internal_node(child)) |
1402 | node->slots[0] = RADIX_TREE_RETRY; | |
27d20fdd | 1403 | |
af49a63e | 1404 | radix_tree_node_free(node); |
fb209019 | 1405 | shrunk = true; |
a5f51c96 | 1406 | } |
fb209019 MW |
1407 | |
1408 | return shrunk; | |
a5f51c96 NP |
1409 | } |
1410 | ||
139e5616 JW |
1411 | /** |
1412 | * __radix_tree_delete_node - try to free node after clearing a slot | |
1413 | * @root: radix tree root | |
139e5616 JW |
1414 | * @node: node containing @index |
1415 | * | |
1416 | * After clearing the slot at @index in @node from radix tree | |
1417 | * rooted at @root, call this function to attempt freeing the | |
1418 | * node and shrinking the tree. | |
1419 | * | |
1420 | * Returns %true if @node was freed, %false otherwise. | |
1421 | */ | |
449dd698 | 1422 | bool __radix_tree_delete_node(struct radix_tree_root *root, |
139e5616 JW |
1423 | struct radix_tree_node *node) |
1424 | { | |
1425 | bool deleted = false; | |
1426 | ||
1427 | do { | |
1428 | struct radix_tree_node *parent; | |
1429 | ||
1430 | if (node->count) { | |
4dd6c098 | 1431 | if (node == entry_to_node(root->rnode)) |
fb209019 | 1432 | deleted |= radix_tree_shrink(root); |
139e5616 JW |
1433 | return deleted; |
1434 | } | |
1435 | ||
1436 | parent = node->parent; | |
1437 | if (parent) { | |
0c7fa0a8 | 1438 | parent->slots[node->offset] = NULL; |
139e5616 JW |
1439 | parent->count--; |
1440 | } else { | |
1441 | root_tag_clear_all(root); | |
139e5616 JW |
1442 | root->rnode = NULL; |
1443 | } | |
1444 | ||
1445 | radix_tree_node_free(node); | |
1446 | deleted = true; | |
1447 | ||
1448 | node = parent; | |
1449 | } while (node); | |
1450 | ||
1451 | return deleted; | |
1452 | } | |
1453 | ||
57578c2e MW |
1454 | static inline void delete_sibling_entries(struct radix_tree_node *node, |
1455 | void *ptr, unsigned offset) | |
1456 | { | |
1457 | #ifdef CONFIG_RADIX_TREE_MULTIORDER | |
1458 | int i; | |
1459 | for (i = 1; offset + i < RADIX_TREE_MAP_SIZE; i++) { | |
1460 | if (node->slots[offset + i] != ptr) | |
1461 | break; | |
1462 | node->slots[offset + i] = NULL; | |
1463 | node->count--; | |
1464 | } | |
1465 | #endif | |
1466 | } | |
1467 | ||
1da177e4 | 1468 | /** |
53c59f26 | 1469 | * radix_tree_delete_item - delete an item from a radix tree |
1da177e4 LT |
1470 | * @root: radix tree root |
1471 | * @index: index key | |
53c59f26 | 1472 | * @item: expected item |
1da177e4 | 1473 | * |
53c59f26 | 1474 | * Remove @item at @index from the radix tree rooted at @root. |
1da177e4 | 1475 | * |
53c59f26 JW |
1476 | * Returns the address of the deleted item, or NULL if it was not present |
1477 | * or the entry at the given @index was not @item. | |
1da177e4 | 1478 | */ |
53c59f26 JW |
1479 | void *radix_tree_delete_item(struct radix_tree_root *root, |
1480 | unsigned long index, void *item) | |
1da177e4 | 1481 | { |
139e5616 | 1482 | struct radix_tree_node *node; |
57578c2e | 1483 | unsigned int offset; |
139e5616 JW |
1484 | void **slot; |
1485 | void *entry; | |
d5274261 | 1486 | int tag; |
1da177e4 | 1487 | |
139e5616 JW |
1488 | entry = __radix_tree_lookup(root, index, &node, &slot); |
1489 | if (!entry) | |
1490 | return NULL; | |
1da177e4 | 1491 | |
139e5616 JW |
1492 | if (item && entry != item) |
1493 | return NULL; | |
1494 | ||
1495 | if (!node) { | |
612d6c19 NP |
1496 | root_tag_clear_all(root); |
1497 | root->rnode = NULL; | |
139e5616 | 1498 | return entry; |
612d6c19 | 1499 | } |
1da177e4 | 1500 | |
29e0967c | 1501 | offset = get_slot_offset(node, slot); |
53c59f26 | 1502 | |
d604c324 MW |
1503 | /* Clear all tags associated with the item to be deleted. */ |
1504 | for (tag = 0; tag < RADIX_TREE_MAX_TAGS; tag++) | |
1505 | node_tag_clear(root, node, tag, offset); | |
1da177e4 | 1506 | |
a4db4dce | 1507 | delete_sibling_entries(node, node_to_entry(slot), offset); |
139e5616 JW |
1508 | node->slots[offset] = NULL; |
1509 | node->count--; | |
e2bdb933 | 1510 | |
449dd698 | 1511 | __radix_tree_delete_node(root, node); |
612d6c19 | 1512 | |
139e5616 | 1513 | return entry; |
1da177e4 | 1514 | } |
53c59f26 JW |
1515 | EXPORT_SYMBOL(radix_tree_delete_item); |
1516 | ||
1517 | /** | |
1518 | * radix_tree_delete - delete an item from a radix tree | |
1519 | * @root: radix tree root | |
1520 | * @index: index key | |
1521 | * | |
1522 | * Remove the item at @index from the radix tree rooted at @root. | |
1523 | * | |
1524 | * Returns the address of the deleted item, or NULL if it was not present. | |
1525 | */ | |
1526 | void *radix_tree_delete(struct radix_tree_root *root, unsigned long index) | |
1527 | { | |
1528 | return radix_tree_delete_item(root, index, NULL); | |
1529 | } | |
1da177e4 LT |
1530 | EXPORT_SYMBOL(radix_tree_delete); |
1531 | ||
d604c324 MW |
1532 | struct radix_tree_node *radix_tree_replace_clear_tags( |
1533 | struct radix_tree_root *root, | |
1534 | unsigned long index, void *entry) | |
1535 | { | |
1536 | struct radix_tree_node *node; | |
1537 | void **slot; | |
1538 | ||
1539 | __radix_tree_lookup(root, index, &node, &slot); | |
1540 | ||
1541 | if (node) { | |
1542 | unsigned int tag, offset = get_slot_offset(node, slot); | |
1543 | for (tag = 0; tag < RADIX_TREE_MAX_TAGS; tag++) | |
1544 | node_tag_clear(root, node, tag, offset); | |
1545 | } else { | |
1546 | /* Clear root node tags */ | |
1547 | root->gfp_mask &= __GFP_BITS_MASK; | |
1548 | } | |
1549 | ||
1550 | radix_tree_replace_slot(slot, entry); | |
1551 | return node; | |
1552 | } | |
1553 | ||
1da177e4 LT |
1554 | /** |
1555 | * radix_tree_tagged - test whether any items in the tree are tagged | |
1556 | * @root: radix tree root | |
1557 | * @tag: tag to test | |
1558 | */ | |
daff89f3 | 1559 | int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag) |
1da177e4 | 1560 | { |
612d6c19 | 1561 | return root_tag_get(root, tag); |
1da177e4 LT |
1562 | } |
1563 | EXPORT_SYMBOL(radix_tree_tagged); | |
1564 | ||
1565 | static void | |
449dd698 | 1566 | radix_tree_node_ctor(void *arg) |
1da177e4 | 1567 | { |
449dd698 JW |
1568 | struct radix_tree_node *node = arg; |
1569 | ||
1570 | memset(node, 0, sizeof(*node)); | |
1571 | INIT_LIST_HEAD(&node->private_list); | |
1da177e4 LT |
1572 | } |
1573 | ||
1da177e4 | 1574 | static int radix_tree_callback(struct notifier_block *nfb, |
2fcd9005 | 1575 | unsigned long action, void *hcpu) |
1da177e4 | 1576 | { |
2fcd9005 MW |
1577 | int cpu = (long)hcpu; |
1578 | struct radix_tree_preload *rtp; | |
1579 | struct radix_tree_node *node; | |
1580 | ||
1581 | /* Free per-cpu pool of preloaded nodes */ | |
1582 | if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) { | |
1583 | rtp = &per_cpu(radix_tree_preloads, cpu); | |
1584 | while (rtp->nr) { | |
9d2a8da0 KS |
1585 | node = rtp->nodes; |
1586 | rtp->nodes = node->private_data; | |
1587 | kmem_cache_free(radix_tree_node_cachep, node); | |
1588 | rtp->nr--; | |
2fcd9005 MW |
1589 | } |
1590 | } | |
1591 | return NOTIFY_OK; | |
1da177e4 | 1592 | } |
1da177e4 LT |
1593 | |
1594 | void __init radix_tree_init(void) | |
1595 | { | |
1596 | radix_tree_node_cachep = kmem_cache_create("radix_tree_node", | |
1597 | sizeof(struct radix_tree_node), 0, | |
488514d1 CL |
1598 | SLAB_PANIC | SLAB_RECLAIM_ACCOUNT, |
1599 | radix_tree_node_ctor); | |
1da177e4 LT |
1600 | hotcpu_notifier(radix_tree_callback, 0); |
1601 | } |