Blame view
lib/radix-tree.c
38.7 KB
1da177e4c
|
1 2 3 |
/* * Copyright (C) 2001 Momchil Velikov * Portions Copyright (C) 2001 Christoph Hellwig |
cde535359
|
4 |
* Copyright (C) 2005 SGI, Christoph Lameter |
7cf9c2c76
|
5 |
* Copyright (C) 2006 Nick Piggin |
78c1d7848
|
6 |
* Copyright (C) 2012 Konstantin Khlebnikov |
1da177e4c
|
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
* * 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> |
8bc3bcc93
|
26 |
#include <linux/export.h> |
1da177e4c
|
27 28 29 30 31 |
#include <linux/radix-tree.h> #include <linux/percpu.h> #include <linux/slab.h> #include <linux/notifier.h> #include <linux/cpu.h> |
1da177e4c
|
32 33 |
#include <linux/string.h> #include <linux/bitops.h> |
7cf9c2c76
|
34 |
#include <linux/rcupdate.h> |
1da177e4c
|
35 36 37 |
#ifdef __KERNEL__ |
cfd9b7df4
|
38 |
#define RADIX_TREE_MAP_SHIFT (CONFIG_BASE_SMALL ? 4 : 6) |
1da177e4c
|
39 40 41 |
#else #define RADIX_TREE_MAP_SHIFT 3 /* For more stressful testing */ #endif |
1da177e4c
|
42 43 44 45 46 47 48 49 |
#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 { |
7cf9c2c76
|
50 |
unsigned int height; /* Height from the bottom */ |
1da177e4c
|
51 |
unsigned int count; |
e2bdb933a
|
52 53 54 55 |
union { struct radix_tree_node *parent; /* Used when ascending tree */ struct rcu_head rcu_head; /* Used when freeing node */ }; |
a1115570b
|
56 |
void __rcu *slots[RADIX_TREE_MAP_SIZE]; |
daff89f32
|
57 |
unsigned long tags[RADIX_TREE_MAX_TAGS][RADIX_TREE_TAG_LONGS]; |
1da177e4c
|
58 |
}; |
1da177e4c
|
59 |
#define RADIX_TREE_INDEX_BITS (8 /* CHAR_BIT */ * sizeof(unsigned long)) |
26fb1589c
|
60 61 |
#define RADIX_TREE_MAX_PATH (DIV_ROUND_UP(RADIX_TREE_INDEX_BITS, \ RADIX_TREE_MAP_SHIFT)) |
1da177e4c
|
62 |
|
26fb1589c
|
63 64 65 66 67 |
/* * 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; |
1da177e4c
|
68 69 70 71 |
/* * Radix tree node cache. */ |
e18b890bb
|
72 |
static struct kmem_cache *radix_tree_node_cachep; |
1da177e4c
|
73 74 |
/* |
553680529
|
75 76 77 78 79 80 81 82 83 84 85 86 87 |
* The radix tree is variable-height, so an insert operation not only has * to build the branch to its corresponding item, it also has to build the * branch to existing items if the size has to be increased (by * radix_tree_extend). * * The worst case is a zero height tree with just a single item at index 0, * and then inserting an item at index ULONG_MAX. This requires 2 new branches * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared. * Hence: */ #define RADIX_TREE_PRELOAD_SIZE (RADIX_TREE_MAX_PATH * 2 - 1) /* |
1da177e4c
|
88 89 90 91 |
* Per-cpu pool of preloaded nodes */ struct radix_tree_preload { int nr; |
553680529
|
92 |
struct radix_tree_node *nodes[RADIX_TREE_PRELOAD_SIZE]; |
1da177e4c
|
93 |
}; |
8cef7d57a
|
94 |
static DEFINE_PER_CPU(struct radix_tree_preload, radix_tree_preloads) = { 0, }; |
1da177e4c
|
95 |
|
27d20fddc
|
96 97 98 99 100 101 102 103 104 |
static inline void *ptr_to_indirect(void *ptr) { return (void *)((unsigned long)ptr | RADIX_TREE_INDIRECT_PTR); } static inline void *indirect_to_ptr(void *ptr) { return (void *)((unsigned long)ptr & ~RADIX_TREE_INDIRECT_PTR); } |
612d6c19d
|
105 106 107 108 |
static inline gfp_t root_gfp_mask(struct radix_tree_root *root) { return root->gfp_mask & __GFP_BITS_MASK; } |
643b52b9c
|
109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 |
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; } |
78c1d7848
|
160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 |
/** * radix_tree_find_next_bit - find the next set bit in a memory region * * @addr: The address to base the search on * @size: The bitmap size in bits * @offset: The bitnumber to start searching at * * Unrollable variant of find_next_bit() for constant size arrays. * Tail bits starting from size to roundup(size, BITS_PER_LONG) must be zero. * Returns next bit offset, or size if nothing found. */ static __always_inline unsigned long radix_tree_find_next_bit(const unsigned long *addr, unsigned long size, unsigned long offset) { if (!__builtin_constant_p(size)) return find_next_bit(addr, size, offset); if (offset < size) { unsigned long tmp; addr += offset / BITS_PER_LONG; tmp = *addr >> (offset % BITS_PER_LONG); if (tmp) return __ffs(tmp) + offset; offset = (offset + BITS_PER_LONG) & ~(BITS_PER_LONG - 1); while (offset < size) { tmp = *++addr; if (tmp) return __ffs(tmp) + offset; offset += BITS_PER_LONG; } } return size; } |
1da177e4c
|
196 197 198 199 200 201 202 |
/* * 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) { |
e2848a0ef
|
203 |
struct radix_tree_node *ret = NULL; |
612d6c19d
|
204 |
gfp_t gfp_mask = root_gfp_mask(root); |
1da177e4c
|
205 |
|
e2848a0ef
|
206 |
if (!(gfp_mask & __GFP_WAIT)) { |
1da177e4c
|
207 |
struct radix_tree_preload *rtp; |
e2848a0ef
|
208 209 210 211 212 |
/* * Provided the caller has preloaded here, we will always * succeed in getting a node here (and never reach * kmem_cache_alloc) */ |
1da177e4c
|
213 214 215 216 217 218 219 |
rtp = &__get_cpu_var(radix_tree_preloads); if (rtp->nr) { ret = rtp->nodes[rtp->nr - 1]; rtp->nodes[rtp->nr - 1] = NULL; rtp->nr--; } } |
e2848a0ef
|
220 |
if (ret == NULL) |
488514d17
|
221 |
ret = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask); |
e2848a0ef
|
222 |
|
c0bc9875b
|
223 |
BUG_ON(radix_tree_is_indirect_ptr(ret)); |
1da177e4c
|
224 225 |
return ret; } |
7cf9c2c76
|
226 227 228 229 |
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); |
b6dd08652
|
230 |
int i; |
643b52b9c
|
231 232 233 234 235 236 |
/* * 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. */ |
b6dd08652
|
237 238 |
for (i = 0; i < RADIX_TREE_MAX_TAGS; i++) tag_clear(node, i, 0); |
643b52b9c
|
239 240 |
node->slots[0] = NULL; node->count = 0; |
7cf9c2c76
|
241 242 |
kmem_cache_free(radix_tree_node_cachep, node); } |
1da177e4c
|
243 244 245 |
static inline void radix_tree_node_free(struct radix_tree_node *node) { |
7cf9c2c76
|
246 |
call_rcu(&node->rcu_head, radix_tree_node_rcu_free); |
1da177e4c
|
247 248 249 250 251 252 253 |
} /* * 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. |
b34df792b
|
254 255 256 |
* * To make use of this facility, the radix tree must be initialised without * __GFP_WAIT being passed to INIT_RADIX_TREE(). |
1da177e4c
|
257 |
*/ |
dd0fc66fb
|
258 |
int radix_tree_preload(gfp_t gfp_mask) |
1da177e4c
|
259 260 261 262 263 264 265 266 267 |
{ 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(); |
488514d17
|
268 |
node = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask); |
1da177e4c
|
269 270 271 272 273 274 275 276 277 278 279 280 281 |
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; } |
d7f0923d8
|
282 |
EXPORT_SYMBOL(radix_tree_preload); |
1da177e4c
|
283 |
|
6e954b9e9
|
284 |
/* |
1da177e4c
|
285 286 287 288 289 290 291 292 293 294 295 296 297 298 |
* 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; |
e2bdb933a
|
299 |
struct radix_tree_node *slot; |
1da177e4c
|
300 |
unsigned int height; |
1da177e4c
|
301 302 303 304 305 306 307 308 309 310 311 |
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; } |
1da177e4c
|
312 |
do { |
7cf9c2c76
|
313 |
unsigned int newheight; |
1da177e4c
|
314 315 |
if (!(node = radix_tree_node_alloc(root))) return -ENOMEM; |
1da177e4c
|
316 |
/* Propagate the aggregated tag info into the new root */ |
daff89f32
|
317 |
for (tag = 0; tag < RADIX_TREE_MAX_TAGS; tag++) { |
612d6c19d
|
318 |
if (root_tag_get(root, tag)) |
1da177e4c
|
319 320 |
tag_set(node, tag, 0); } |
e2bdb933a
|
321 |
/* Increase the height. */ |
7cf9c2c76
|
322 323 |
newheight = root->height+1; node->height = newheight; |
1da177e4c
|
324 |
node->count = 1; |
e2bdb933a
|
325 326 327 328 329 330 331 |
node->parent = NULL; slot = root->rnode; if (newheight > 1) { slot = indirect_to_ptr(slot); slot->parent = node; } node->slots[0] = slot; |
27d20fddc
|
332 |
node = ptr_to_indirect(node); |
7cf9c2c76
|
333 334 |
rcu_assign_pointer(root->rnode, node); root->height = newheight; |
1da177e4c
|
335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 |
} 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) { |
201b6264f
|
351 |
struct radix_tree_node *node = NULL, *slot; |
1da177e4c
|
352 353 354 |
unsigned int height, shift; int offset; int error; |
c0bc9875b
|
355 |
BUG_ON(radix_tree_is_indirect_ptr(item)); |
7cf9c2c76
|
356 |
|
1da177e4c
|
357 |
/* Make sure the tree is high enough. */ |
612d6c19d
|
358 |
if (index > radix_tree_maxindex(root->height)) { |
1da177e4c
|
359 360 361 362 |
error = radix_tree_extend(root, index); if (error) return error; } |
27d20fddc
|
363 |
slot = indirect_to_ptr(root->rnode); |
c0bc9875b
|
364 |
|
1da177e4c
|
365 366 367 368 |
height = root->height; shift = (height-1) * RADIX_TREE_MAP_SHIFT; offset = 0; /* uninitialised var warning */ |
612d6c19d
|
369 |
while (height > 0) { |
201b6264f
|
370 |
if (slot == NULL) { |
1da177e4c
|
371 |
/* Have to add a child node. */ |
201b6264f
|
372 |
if (!(slot = radix_tree_node_alloc(root))) |
1da177e4c
|
373 |
return -ENOMEM; |
7cf9c2c76
|
374 |
slot->height = height; |
e2bdb933a
|
375 |
slot->parent = node; |
201b6264f
|
376 |
if (node) { |
7cf9c2c76
|
377 |
rcu_assign_pointer(node->slots[offset], slot); |
1da177e4c
|
378 |
node->count++; |
201b6264f
|
379 |
} else |
27d20fddc
|
380 |
rcu_assign_pointer(root->rnode, ptr_to_indirect(slot)); |
1da177e4c
|
381 382 383 384 |
} /* Go a level down */ offset = (index >> shift) & RADIX_TREE_MAP_MASK; |
201b6264f
|
385 386 |
node = slot; slot = node->slots[offset]; |
1da177e4c
|
387 388 |
shift -= RADIX_TREE_MAP_SHIFT; height--; |
612d6c19d
|
389 |
} |
1da177e4c
|
390 |
|
201b6264f
|
391 |
if (slot != NULL) |
1da177e4c
|
392 |
return -EEXIST; |
201b6264f
|
393 |
|
612d6c19d
|
394 395 |
if (node) { node->count++; |
7cf9c2c76
|
396 |
rcu_assign_pointer(node->slots[offset], item); |
612d6c19d
|
397 398 399 |
BUG_ON(tag_get(node, 0, offset)); BUG_ON(tag_get(node, 1, offset)); } else { |
c0bc9875b
|
400 |
rcu_assign_pointer(root->rnode, item); |
612d6c19d
|
401 402 403 |
BUG_ON(root_tag_get(root, 0)); BUG_ON(root_tag_get(root, 1)); } |
1da177e4c
|
404 |
|
1da177e4c
|
405 406 407 |
return 0; } EXPORT_SYMBOL(radix_tree_insert); |
b72b71c6c
|
408 409 410 |
/* * is_slot == 1 : search for the slot. * is_slot == 0 : search for the node. |
7cf9c2c76
|
411 |
*/ |
b72b71c6c
|
412 413 |
static void *radix_tree_lookup_element(struct radix_tree_root *root, unsigned long index, int is_slot) |
1da177e4c
|
414 415 |
{ unsigned int height, shift; |
7cf9c2c76
|
416 |
struct radix_tree_node *node, **slot; |
612d6c19d
|
417 |
|
2676a58c9
|
418 |
node = rcu_dereference_raw(root->rnode); |
7cf9c2c76
|
419 |
if (node == NULL) |
1da177e4c
|
420 |
return NULL; |
c0bc9875b
|
421 |
if (!radix_tree_is_indirect_ptr(node)) { |
7cf9c2c76
|
422 423 |
if (index > 0) return NULL; |
b72b71c6c
|
424 |
return is_slot ? (void *)&root->rnode : node; |
7cf9c2c76
|
425 |
} |
27d20fddc
|
426 |
node = indirect_to_ptr(node); |
7cf9c2c76
|
427 428 429 430 |
height = node->height; if (index > radix_tree_maxindex(height)) return NULL; |
612d6c19d
|
431 |
|
1da177e4c
|
432 |
shift = (height-1) * RADIX_TREE_MAP_SHIFT; |
1da177e4c
|
433 |
|
7cf9c2c76
|
434 435 436 |
do { slot = (struct radix_tree_node **) (node->slots + ((index>>shift) & RADIX_TREE_MAP_MASK)); |
2676a58c9
|
437 |
node = rcu_dereference_raw(*slot); |
7cf9c2c76
|
438 |
if (node == NULL) |
1da177e4c
|
439 |
return NULL; |
1da177e4c
|
440 441 |
shift -= RADIX_TREE_MAP_SHIFT; height--; |
7cf9c2c76
|
442 |
} while (height > 0); |
1da177e4c
|
443 |
|
27d20fddc
|
444 |
return is_slot ? (void *)slot : indirect_to_ptr(node); |
b72b71c6c
|
445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 |
} /** * 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); |
a43313668
|
463 |
} |
a43313668
|
464 465 466 467 468 469 470 471 |
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. |
7cf9c2c76
|
472 473 474 475 476 |
* * 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. |
a43313668
|
477 478 479 |
*/ void *radix_tree_lookup(struct radix_tree_root *root, unsigned long index) { |
b72b71c6c
|
480 |
return radix_tree_lookup_element(root, index, 0); |
1da177e4c
|
481 482 483 484 485 486 487 488 489 |
} 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 * |
daff89f32
|
490 491 |
* Set the search tag (which must be < RADIX_TREE_MAX_TAGS) * corresponding to @index in the radix tree. From |
1da177e4c
|
492 493 494 495 496 497 |
* 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, |
daff89f32
|
498 |
unsigned long index, unsigned int tag) |
1da177e4c
|
499 500 |
{ unsigned int height, shift; |
201b6264f
|
501 |
struct radix_tree_node *slot; |
1da177e4c
|
502 503 |
height = root->height; |
4c91c3648
|
504 |
BUG_ON(index > radix_tree_maxindex(height)); |
1da177e4c
|
505 |
|
27d20fddc
|
506 |
slot = indirect_to_ptr(root->rnode); |
612d6c19d
|
507 |
shift = (height - 1) * RADIX_TREE_MAP_SHIFT; |
1da177e4c
|
508 509 510 511 512 |
while (height > 0) { int offset; offset = (index >> shift) & RADIX_TREE_MAP_MASK; |
d5274261e
|
513 514 |
if (!tag_get(slot, tag, offset)) tag_set(slot, tag, offset); |
201b6264f
|
515 516 |
slot = slot->slots[offset]; BUG_ON(slot == NULL); |
1da177e4c
|
517 518 519 |
shift -= RADIX_TREE_MAP_SHIFT; height--; } |
612d6c19d
|
520 521 522 |
/* set the root's tag bit */ if (slot && !root_tag_get(root, tag)) root_tag_set(root, tag); |
201b6264f
|
523 |
return slot; |
1da177e4c
|
524 525 526 527 528 529 530 531 532 |
} 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 * |
daff89f32
|
533 534 |
* Clear the search tag (which must be < RADIX_TREE_MAX_TAGS) * corresponding to @index in the radix tree. If |
1da177e4c
|
535 536 537 538 539 540 541 |
* 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, |
daff89f32
|
542 |
unsigned long index, unsigned int tag) |
1da177e4c
|
543 |
{ |
e2bdb933a
|
544 |
struct radix_tree_node *node = NULL; |
612d6c19d
|
545 |
struct radix_tree_node *slot = NULL; |
1da177e4c
|
546 |
unsigned int height, shift; |
e2bdb933a
|
547 |
int uninitialized_var(offset); |
1da177e4c
|
548 549 550 551 |
height = root->height; if (index > radix_tree_maxindex(height)) goto out; |
e2bdb933a
|
552 |
shift = height * RADIX_TREE_MAP_SHIFT; |
27d20fddc
|
553 |
slot = indirect_to_ptr(root->rnode); |
1da177e4c
|
554 |
|
e2bdb933a
|
555 |
while (shift) { |
201b6264f
|
556 |
if (slot == NULL) |
1da177e4c
|
557 |
goto out; |
e2bdb933a
|
558 |
shift -= RADIX_TREE_MAP_SHIFT; |
1da177e4c
|
559 |
offset = (index >> shift) & RADIX_TREE_MAP_MASK; |
e2bdb933a
|
560 |
node = slot; |
201b6264f
|
561 |
slot = slot->slots[offset]; |
1da177e4c
|
562 |
} |
612d6c19d
|
563 |
if (slot == NULL) |
1da177e4c
|
564 |
goto out; |
e2bdb933a
|
565 566 |
while (node) { if (!tag_get(node, tag, offset)) |
d5274261e
|
567 |
goto out; |
e2bdb933a
|
568 569 |
tag_clear(node, tag, offset); if (any_tag_set(node, tag)) |
6e954b9e9
|
570 |
goto out; |
e2bdb933a
|
571 572 573 574 |
index >>= RADIX_TREE_MAP_SHIFT; offset = index & RADIX_TREE_MAP_MASK; node = node->parent; |
612d6c19d
|
575 576 577 578 579 |
} /* clear the root's tag bit */ if (root_tag_get(root, tag)) root_tag_clear(root, tag); |
1da177e4c
|
580 |
out: |
612d6c19d
|
581 |
return slot; |
1da177e4c
|
582 583 |
} EXPORT_SYMBOL(radix_tree_tag_clear); |
1da177e4c
|
584 |
/** |
32605a181
|
585 586 587 |
* radix_tree_tag_get - get a tag on a radix tree node * @root: radix tree root * @index: index key |
daff89f32
|
588 |
* @tag: tag index (< RADIX_TREE_MAX_TAGS) |
1da177e4c
|
589 |
* |
32605a181
|
590 |
* Return values: |
1da177e4c
|
591 |
* |
612d6c19d
|
592 593 |
* 0: tag not present or not set * 1: tag set |
ce82653d6
|
594 595 596 597 |
* * Note that the return value of this function may not be relied on, even if * the RCU lock is held, unless tag modification and node deletion are excluded * from concurrency. |
1da177e4c
|
598 599 |
*/ int radix_tree_tag_get(struct radix_tree_root *root, |
daff89f32
|
600 |
unsigned long index, unsigned int tag) |
1da177e4c
|
601 602 |
{ unsigned int height, shift; |
7cf9c2c76
|
603 |
struct radix_tree_node *node; |
1da177e4c
|
604 |
|
612d6c19d
|
605 606 607 |
/* check the root's tag bit */ if (!root_tag_get(root, tag)) return 0; |
2676a58c9
|
608 |
node = rcu_dereference_raw(root->rnode); |
7cf9c2c76
|
609 610 |
if (node == NULL) return 0; |
c0bc9875b
|
611 |
if (!radix_tree_is_indirect_ptr(node)) |
7cf9c2c76
|
612 |
return (index == 0); |
27d20fddc
|
613 |
node = indirect_to_ptr(node); |
7cf9c2c76
|
614 615 616 617 |
height = node->height; if (index > radix_tree_maxindex(height)) return 0; |
612d6c19d
|
618 |
|
1da177e4c
|
619 |
shift = (height - 1) * RADIX_TREE_MAP_SHIFT; |
1da177e4c
|
620 621 622 |
for ( ; ; ) { int offset; |
7cf9c2c76
|
623 |
if (node == NULL) |
1da177e4c
|
624 625 626 |
return 0; offset = (index >> shift) & RADIX_TREE_MAP_MASK; |
7cf9c2c76
|
627 |
if (!tag_get(node, tag, offset)) |
3fa36acbc
|
628 |
return 0; |
ce82653d6
|
629 |
if (height == 1) |
3fa36acbc
|
630 |
return 1; |
2676a58c9
|
631 |
node = rcu_dereference_raw(node->slots[offset]); |
1da177e4c
|
632 633 634 635 636 |
shift -= RADIX_TREE_MAP_SHIFT; height--; } } EXPORT_SYMBOL(radix_tree_tag_get); |
1da177e4c
|
637 |
|
6df8ba4f8
|
638 |
/** |
78c1d7848
|
639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 |
* radix_tree_next_chunk - find next chunk of slots for iteration * * @root: radix tree root * @iter: iterator state * @flags: RADIX_TREE_ITER_* flags and tag index * Returns: pointer to chunk first slot, or NULL if iteration is over */ void **radix_tree_next_chunk(struct radix_tree_root *root, struct radix_tree_iter *iter, unsigned flags) { unsigned shift, tag = flags & RADIX_TREE_ITER_TAG_MASK; struct radix_tree_node *rnode, *node; unsigned long index, offset; if ((flags & RADIX_TREE_ITER_TAGGED) && !root_tag_get(root, tag)) return NULL; /* * Catch next_index overflow after ~0UL. iter->index never overflows * during iterating; it can be zero only at the beginning. * And we cannot overflow iter->next_index in a single step, * because RADIX_TREE_MAP_SHIFT < BITS_PER_LONG. |
fffaee365
|
661 662 663 |
* * This condition also used by radix_tree_next_slot() to stop * contiguous iterating, and forbid swithing to the next chunk. |
78c1d7848
|
664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 |
*/ index = iter->next_index; if (!index && iter->index) return NULL; rnode = rcu_dereference_raw(root->rnode); if (radix_tree_is_indirect_ptr(rnode)) { rnode = indirect_to_ptr(rnode); } else if (rnode && !index) { /* Single-slot tree */ iter->index = 0; iter->next_index = 1; iter->tags = 1; return (void **)&root->rnode; } else return NULL; restart: shift = (rnode->height - 1) * RADIX_TREE_MAP_SHIFT; offset = index >> shift; /* Index outside of the tree */ if (offset >= RADIX_TREE_MAP_SIZE) return NULL; node = rnode; while (1) { if ((flags & RADIX_TREE_ITER_TAGGED) ? !test_bit(offset, node->tags[tag]) : !node->slots[offset]) { /* Hole detected */ if (flags & RADIX_TREE_ITER_CONTIG) return NULL; if (flags & RADIX_TREE_ITER_TAGGED) offset = radix_tree_find_next_bit( node->tags[tag], RADIX_TREE_MAP_SIZE, offset + 1); else while (++offset < RADIX_TREE_MAP_SIZE) { if (node->slots[offset]) break; } index &= ~((RADIX_TREE_MAP_SIZE << shift) - 1); index += offset << shift; /* Overflow after ~0UL */ if (!index) return NULL; if (offset == RADIX_TREE_MAP_SIZE) goto restart; } /* This is leaf-node */ if (!shift) break; node = rcu_dereference_raw(node->slots[offset]); if (node == NULL) goto restart; shift -= RADIX_TREE_MAP_SHIFT; offset = (index >> shift) & RADIX_TREE_MAP_MASK; } /* Update the iterator state */ iter->index = index; iter->next_index = (index | RADIX_TREE_MAP_MASK) + 1; /* Construct iter->tags bit-mask from node->tags[tag] array */ if (flags & RADIX_TREE_ITER_TAGGED) { unsigned tag_long, tag_bit; tag_long = offset / BITS_PER_LONG; tag_bit = offset % BITS_PER_LONG; iter->tags = node->tags[tag][tag_long] >> tag_bit; /* This never happens if RADIX_TREE_TAG_LONGS == 1 */ if (tag_long < RADIX_TREE_TAG_LONGS - 1) { /* Pick tags from next element */ if (tag_bit) iter->tags |= node->tags[tag][tag_long + 1] << (BITS_PER_LONG - tag_bit); /* Clip chunk size, here only BITS_PER_LONG tags */ iter->next_index = index + BITS_PER_LONG; } } return node->slots + offset; } EXPORT_SYMBOL(radix_tree_next_chunk); /** |
ebf8aa44b
|
755 756 757 758 759 760 761 762 763 764 765 766 767 768 |
* radix_tree_range_tag_if_tagged - for each item in given range set given * tag if item has another tag set * @root: radix tree root * @first_indexp: pointer to a starting index of a range to scan * @last_index: last index of a range to scan * @nr_to_tag: maximum number items to tag * @iftag: tag index to test * @settag: tag index to set if tested tag is set * * This function scans range of radix tree from first_index to last_index * (inclusive). For each item in the range if iftag is set, the function sets * also settag. The function stops either after tagging nr_to_tag items or * after reaching last_index. * |
144dcfc01
|
769 770 771 772 773 774 775 |
* The tags must be set from the leaf level only and propagated back up the * path to the root. We must do this so that we resolve the full path before * setting any tags on intermediate nodes. If we set tags as we descend, then * we can get to the leaf node and find that the index that has the iftag * set is outside the range we are scanning. This reults in dangling tags and * can lead to problems with later tag operations (e.g. livelocks on lookups). * |
ebf8aa44b
|
776 777 |
* The function returns number of leaves where the tag was set and sets * *first_indexp to the first unscanned index. |
d5ed3a4af
|
778 779 |
* WARNING! *first_indexp can wrap if last_index is ULONG_MAX. Caller must * be prepared to handle that. |
ebf8aa44b
|
780 781 782 783 784 785 |
*/ unsigned long radix_tree_range_tag_if_tagged(struct radix_tree_root *root, unsigned long *first_indexp, unsigned long last_index, unsigned long nr_to_tag, unsigned int iftag, unsigned int settag) { |
144dcfc01
|
786 |
unsigned int height = root->height; |
e2bdb933a
|
787 |
struct radix_tree_node *node = NULL; |
144dcfc01
|
788 789 790 791 |
struct radix_tree_node *slot; unsigned int shift; unsigned long tagged = 0; unsigned long index = *first_indexp; |
ebf8aa44b
|
792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 |
last_index = min(last_index, radix_tree_maxindex(height)); if (index > last_index) return 0; if (!nr_to_tag) return 0; if (!root_tag_get(root, iftag)) { *first_indexp = last_index + 1; return 0; } if (height == 0) { *first_indexp = last_index + 1; root_tag_set(root, settag); return 1; } shift = (height - 1) * RADIX_TREE_MAP_SHIFT; |
27d20fddc
|
809 |
slot = indirect_to_ptr(root->rnode); |
ebf8aa44b
|
810 811 |
for (;;) { |
e2bdb933a
|
812 |
unsigned long upindex; |
ebf8aa44b
|
813 814 815 816 817 818 819 |
int offset; offset = (index >> shift) & RADIX_TREE_MAP_MASK; if (!slot->slots[offset]) goto next; if (!tag_get(slot, iftag, offset)) goto next; |
e2bdb933a
|
820 |
if (shift) { |
144dcfc01
|
821 |
/* Go down one level */ |
144dcfc01
|
822 |
shift -= RADIX_TREE_MAP_SHIFT; |
e2bdb933a
|
823 |
node = slot; |
144dcfc01
|
824 825 826 827 828 829 |
slot = slot->slots[offset]; continue; } /* tag the leaf */ tagged++; |
ebf8aa44b
|
830 |
tag_set(slot, settag, offset); |
144dcfc01
|
831 832 |
/* walk back up the path tagging interior nodes */ |
e2bdb933a
|
833 834 835 836 |
upindex = index; while (node) { upindex >>= RADIX_TREE_MAP_SHIFT; offset = upindex & RADIX_TREE_MAP_MASK; |
144dcfc01
|
837 |
/* stop if we find a node with the tag already set */ |
e2bdb933a
|
838 |
if (tag_get(node, settag, offset)) |
144dcfc01
|
839 |
break; |
e2bdb933a
|
840 841 |
tag_set(node, settag, offset); node = node->parent; |
ebf8aa44b
|
842 |
} |
144dcfc01
|
843 |
|
e2bdb933a
|
844 845 846 847 848 849 850 851 |
/* * Small optimization: now clear that node pointer. * Since all of this slot's ancestors now have the tag set * from setting it above, we have no further need to walk * back up the tree setting tags, until we update slot to * point to another radix_tree_node. */ node = NULL; |
ebf8aa44b
|
852 853 854 |
next: /* Go to next item at level determined by 'shift' */ index = ((index >> shift) + 1) << shift; |
d5ed3a4af
|
855 856 |
/* Overflow can happen when last_index is ~0UL... */ if (index > last_index || !index) |
ebf8aa44b
|
857 858 859 860 861 862 863 864 865 |
break; if (tagged >= nr_to_tag) break; while (((index >> shift) & RADIX_TREE_MAP_MASK) == 0) { /* * We've fully scanned this node. Go up. Because * last_index is guaranteed to be in the tree, what * we do below cannot wander astray. */ |
e2bdb933a
|
866 |
slot = slot->parent; |
ebf8aa44b
|
867 868 869 870 |
shift += RADIX_TREE_MAP_SHIFT; } } /* |
ac15ee691
|
871 872 |
* We need not to tag the root tag if there is no tag which is set with * settag within the range from *first_indexp to last_index. |
ebf8aa44b
|
873 |
*/ |
ac15ee691
|
874 875 |
if (tagged > 0) root_tag_set(root, settag); |
ebf8aa44b
|
876 877 878 879 880 881 882 883 |
*first_indexp = index; return tagged; } EXPORT_SYMBOL(radix_tree_range_tag_if_tagged); /** |
6df8ba4f8
|
884 885 886 887 888 889 890 891 892 893 |
* 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' |
8e6bdb7f8
|
894 |
* will be true). In rare cases of index wrap-around, 0 will be returned. |
6df8ba4f8
|
895 896 |
* * radix_tree_next_hole may be called under rcu_read_lock. However, like |
8e6bdb7f8
|
897 898 899 900 901 |
* 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. |
6df8ba4f8
|
902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 |
*/ 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); |
dc566127d
|
919 920 921 922 923 924 925 926 927 928 929 |
/** * 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' |
edcd1d843
|
930 |
* will be true). In rare cases of wrap-around, ULONG_MAX will be returned. |
dc566127d
|
931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 |
* * 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--; |
edcd1d843
|
948 |
if (index == ULONG_MAX) |
dc566127d
|
949 950 951 952 953 954 |
break; } return index; } EXPORT_SYMBOL(radix_tree_prev_hole); |
1da177e4c
|
955 956 957 958 959 960 961 962 963 964 965 966 |
/** * 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. |
7cf9c2c76
|
967 968 969 970 971 972 |
* * 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'. |
1da177e4c
|
973 974 975 976 977 |
*/ unsigned int radix_tree_gang_lookup(struct radix_tree_root *root, void **results, unsigned long first_index, unsigned int max_items) { |
cebbd29e1
|
978 979 980 |
struct radix_tree_iter iter; void **slot; unsigned int ret = 0; |
7cf9c2c76
|
981 |
|
cebbd29e1
|
982 |
if (unlikely(!max_items)) |
7cf9c2c76
|
983 |
return 0; |
1da177e4c
|
984 |
|
cebbd29e1
|
985 986 987 988 989 |
radix_tree_for_each_slot(slot, root, &iter, first_index) { results[ret] = indirect_to_ptr(rcu_dereference_raw(*slot)); if (!results[ret]) continue; if (++ret == max_items) |
1da177e4c
|
990 |
break; |
1da177e4c
|
991 |
} |
7cf9c2c76
|
992 |
|
1da177e4c
|
993 994 995 |
return ret; } EXPORT_SYMBOL(radix_tree_gang_lookup); |
47feff2c8
|
996 997 998 999 |
/** * 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 |
6328650bb
|
1000 |
* @indices: where their indices should be placed (but usually NULL) |
47feff2c8
|
1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 |
* @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 |
6328650bb
|
1015 1016 |
radix_tree_gang_lookup_slot(struct radix_tree_root *root, void ***results, unsigned long *indices, |
47feff2c8
|
1017 1018 |
unsigned long first_index, unsigned int max_items) { |
cebbd29e1
|
1019 1020 1021 |
struct radix_tree_iter iter; void **slot; unsigned int ret = 0; |
47feff2c8
|
1022 |
|
cebbd29e1
|
1023 |
if (unlikely(!max_items)) |
47feff2c8
|
1024 |
return 0; |
cebbd29e1
|
1025 1026 |
radix_tree_for_each_slot(slot, root, &iter, first_index) { results[ret] = slot; |
6328650bb
|
1027 |
if (indices) |
cebbd29e1
|
1028 1029 |
indices[ret] = iter.index; if (++ret == max_items) |
47feff2c8
|
1030 |
break; |
47feff2c8
|
1031 1032 1033 1034 1035 |
} return ret; } EXPORT_SYMBOL(radix_tree_gang_lookup_slot); |
1da177e4c
|
1036 1037 1038 1039 1040 1041 1042 |
/** * 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 |
daff89f32
|
1043 |
* @tag: the tag index (< RADIX_TREE_MAX_TAGS) |
1da177e4c
|
1044 1045 1046 1047 1048 1049 1050 |
* * 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, |
daff89f32
|
1051 1052 |
unsigned long first_index, unsigned int max_items, unsigned int tag) |
1da177e4c
|
1053 |
{ |
cebbd29e1
|
1054 1055 1056 |
struct radix_tree_iter iter; void **slot; unsigned int ret = 0; |
612d6c19d
|
1057 |
|
cebbd29e1
|
1058 |
if (unlikely(!max_items)) |
7cf9c2c76
|
1059 |
return 0; |
cebbd29e1
|
1060 1061 1062 1063 1064 |
radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) { results[ret] = indirect_to_ptr(rcu_dereference_raw(*slot)); if (!results[ret]) continue; if (++ret == max_items) |
1da177e4c
|
1065 |
break; |
1da177e4c
|
1066 |
} |
7cf9c2c76
|
1067 |
|
1da177e4c
|
1068 1069 1070 1071 1072 |
return ret; } EXPORT_SYMBOL(radix_tree_gang_lookup_tag); /** |
47feff2c8
|
1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 |
* 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) { |
cebbd29e1
|
1090 1091 1092 |
struct radix_tree_iter iter; void **slot; unsigned int ret = 0; |
47feff2c8
|
1093 |
|
cebbd29e1
|
1094 |
if (unlikely(!max_items)) |
47feff2c8
|
1095 |
return 0; |
cebbd29e1
|
1096 1097 1098 |
radix_tree_for_each_tagged(slot, root, &iter, first_index, tag) { results[ret] = slot; if (++ret == max_items) |
47feff2c8
|
1099 |
break; |
47feff2c8
|
1100 1101 1102 1103 1104 |
} return ret; } EXPORT_SYMBOL(radix_tree_gang_lookup_tag_slot); |
e504f3fdd
|
1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 |
#if defined(CONFIG_SHMEM) && defined(CONFIG_SWAP) #include <linux/sched.h> /* for cond_resched() */ /* * This linear search is at present only useful to shmem_unuse_inode(). */ static unsigned long __locate(struct radix_tree_node *slot, void *item, unsigned long index, unsigned long *found_index) { unsigned int shift, height; unsigned long i; height = slot->height; shift = (height-1) * RADIX_TREE_MAP_SHIFT; for ( ; height > 1; height--) { i = (index >> shift) & RADIX_TREE_MAP_MASK; for (;;) { if (slot->slots[i] != NULL) break; index &= ~((1UL << shift) - 1); index += 1UL << shift; if (index == 0) goto out; /* 32-bit wraparound */ i++; if (i == RADIX_TREE_MAP_SIZE) goto out; } shift -= RADIX_TREE_MAP_SHIFT; slot = rcu_dereference_raw(slot->slots[i]); if (slot == NULL) goto out; } /* Bottom level: check items */ for (i = 0; i < RADIX_TREE_MAP_SIZE; i++) { if (slot->slots[i] == item) { *found_index = index + i; index = 0; goto out; } } index += RADIX_TREE_MAP_SIZE; out: return index; } /** * radix_tree_locate_item - search through radix tree for item * @root: radix tree root * @item: item to be found * * Returns index where item was found, or -1 if not found. * Caller must hold no lock (since this time-consuming function needs * to be preemptible), and must check afterwards if item is still there. */ unsigned long radix_tree_locate_item(struct radix_tree_root *root, void *item) { struct radix_tree_node *node; unsigned long max_index; unsigned long cur_index = 0; unsigned long found_index = -1; do { rcu_read_lock(); node = rcu_dereference_raw(root->rnode); if (!radix_tree_is_indirect_ptr(node)) { rcu_read_unlock(); if (node == item) found_index = 0; break; } node = indirect_to_ptr(node); max_index = radix_tree_maxindex(node->height); if (cur_index > max_index) break; cur_index = __locate(node, item, cur_index, &found_index); rcu_read_unlock(); cond_resched(); } while (cur_index != 0 && cur_index <= max_index); return found_index; } #else unsigned long radix_tree_locate_item(struct radix_tree_root *root, void *item) { return -1; } #endif /* CONFIG_SHMEM && CONFIG_SWAP */ |
47feff2c8
|
1197 1198 |
/** |
a5f51c966
|
1199 1200 1201 1202 1203 1204 |
* 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 */ |
c0bc9875b
|
1205 |
while (root->height > 0) { |
a5f51c966
|
1206 |
struct radix_tree_node *to_free = root->rnode; |
e2bdb933a
|
1207 |
struct radix_tree_node *slot; |
a5f51c966
|
1208 |
|
c0bc9875b
|
1209 |
BUG_ON(!radix_tree_is_indirect_ptr(to_free)); |
27d20fddc
|
1210 |
to_free = indirect_to_ptr(to_free); |
c0bc9875b
|
1211 1212 1213 1214 1215 1216 1217 1218 1219 |
/* * 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; |
7cf9c2c76
|
1220 1221 |
/* * We don't need rcu_assign_pointer(), since we are simply |
27d20fddc
|
1222 1223 |
* moving the node from one part of the tree to another: if it * was safe to dereference the old pointer to it |
7cf9c2c76
|
1224 |
* (to_free->slots[0]), it will be safe to dereference the new |
27d20fddc
|
1225 |
* one (root->rnode) as far as dependent read barriers go. |
7cf9c2c76
|
1226 |
*/ |
e2bdb933a
|
1227 1228 1229 1230 1231 1232 |
slot = to_free->slots[0]; if (root->height > 1) { slot->parent = NULL; slot = ptr_to_indirect(slot); } root->rnode = slot; |
a5f51c966
|
1233 |
root->height--; |
27d20fddc
|
1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 |
/* * We have a dilemma here. The node's slot[0] must not be * NULLed in case there are concurrent lookups expecting to * find the item. However if this was a bottom-level node, * then it may be subject to the slot pointer being visible * to callers dereferencing it. If item corresponding to * slot[0] is subsequently deleted, these callers would expect * their slot to become empty sooner or later. * * For example, lockless pagecache will look up a slot, deref * the page pointer, and if the page is 0 refcount it means it * was concurrently deleted from pagecache so try the deref * again. Fortunately there is already a requirement for logic * to retry the entire slot lookup -- the indirect pointer * problem (replacing direct root node with an indirect pointer * also results in a stale slot). So tag the slot as indirect * to force callers to retry. */ if (root->height == 0) *((unsigned long *)&to_free->slots[0]) |= RADIX_TREE_INDIRECT_PTR; |
a5f51c966
|
1256 1257 1258 1259 1260 |
radix_tree_node_free(to_free); } } /** |
1da177e4c
|
1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 |
* 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) { |
e2bdb933a
|
1271 |
struct radix_tree_node *node = NULL; |
612d6c19d
|
1272 |
struct radix_tree_node *slot = NULL; |
7cf9c2c76
|
1273 |
struct radix_tree_node *to_free; |
1da177e4c
|
1274 |
unsigned int height, shift; |
d5274261e
|
1275 |
int tag; |
e2bdb933a
|
1276 |
int uninitialized_var(offset); |
1da177e4c
|
1277 1278 1279 1280 |
height = root->height; if (index > radix_tree_maxindex(height)) goto out; |
612d6c19d
|
1281 |
slot = root->rnode; |
c0bc9875b
|
1282 |
if (height == 0) { |
612d6c19d
|
1283 1284 1285 1286 |
root_tag_clear_all(root); root->rnode = NULL; goto out; } |
27d20fddc
|
1287 |
slot = indirect_to_ptr(slot); |
e2bdb933a
|
1288 |
shift = height * RADIX_TREE_MAP_SHIFT; |
1da177e4c
|
1289 |
|
612d6c19d
|
1290 |
do { |
201b6264f
|
1291 |
if (slot == NULL) |
1da177e4c
|
1292 |
goto out; |
e2bdb933a
|
1293 |
shift -= RADIX_TREE_MAP_SHIFT; |
1da177e4c
|
1294 |
offset = (index >> shift) & RADIX_TREE_MAP_MASK; |
e2bdb933a
|
1295 |
node = slot; |
201b6264f
|
1296 |
slot = slot->slots[offset]; |
e2bdb933a
|
1297 |
} while (shift); |
1da177e4c
|
1298 |
|
612d6c19d
|
1299 |
if (slot == NULL) |
1da177e4c
|
1300 |
goto out; |
1da177e4c
|
1301 |
/* |
e2bdb933a
|
1302 1303 |
* Clear all tags associated with the item to be deleted. * This way of doing it would be inefficient, but seldom is any set. |
1da177e4c
|
1304 |
*/ |
daff89f32
|
1305 |
for (tag = 0; tag < RADIX_TREE_MAX_TAGS; tag++) { |
e2bdb933a
|
1306 |
if (tag_get(node, tag, offset)) |
612d6c19d
|
1307 |
radix_tree_tag_clear(root, index, tag); |
d5274261e
|
1308 |
} |
1da177e4c
|
1309 |
|
7cf9c2c76
|
1310 |
to_free = NULL; |
201b6264f
|
1311 |
/* Now free the nodes we do not need anymore */ |
e2bdb933a
|
1312 1313 1314 |
while (node) { node->slots[offset] = NULL; node->count--; |
7cf9c2c76
|
1315 1316 1317 1318 1319 1320 |
/* * 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); |
a5f51c966
|
1321 |
|
e2bdb933a
|
1322 1323 |
if (node->count) { if (node == indirect_to_ptr(root->rnode)) |
a5f51c966
|
1324 |
radix_tree_shrink(root); |
201b6264f
|
1325 |
goto out; |
a5f51c966
|
1326 |
} |
201b6264f
|
1327 1328 |
/* Node with zero slots in use so free it */ |
e2bdb933a
|
1329 |
to_free = node; |
7cf9c2c76
|
1330 |
|
e2bdb933a
|
1331 1332 1333 |
index >>= RADIX_TREE_MAP_SHIFT; offset = index & RADIX_TREE_MAP_MASK; node = node->parent; |
1da177e4c
|
1334 |
} |
e2bdb933a
|
1335 |
|
612d6c19d
|
1336 |
root_tag_clear_all(root); |
201b6264f
|
1337 |
root->height = 0; |
612d6c19d
|
1338 |
root->rnode = NULL; |
7cf9c2c76
|
1339 1340 |
if (to_free) radix_tree_node_free(to_free); |
612d6c19d
|
1341 |
|
1da177e4c
|
1342 |
out: |
612d6c19d
|
1343 |
return slot; |
1da177e4c
|
1344 1345 1346 1347 1348 1349 1350 1351 |
} 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 */ |
daff89f32
|
1352 |
int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag) |
1da177e4c
|
1353 |
{ |
612d6c19d
|
1354 |
return root_tag_get(root, tag); |
1da177e4c
|
1355 1356 1357 1358 |
} EXPORT_SYMBOL(radix_tree_tagged); static void |
51cc50685
|
1359 |
radix_tree_node_ctor(void *node) |
1da177e4c
|
1360 1361 1362 1363 1364 1365 |
{ memset(node, 0, sizeof(struct radix_tree_node)); } static __init unsigned long __maxindex(unsigned int height) { |
430d275a3
|
1366 1367 1368 1369 1370 1371 1372 1373 |
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; |
1da177e4c
|
1374 1375 1376 1377 1378 1379 1380 1381 1382 |
} 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); } |
1da177e4c
|
1383 1384 1385 1386 1387 1388 1389 1390 |
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 */ |
8bb784428
|
1391 |
if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) { |
1da177e4c
|
1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 |
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; } |
1da177e4c
|
1402 1403 1404 1405 1406 |
void __init radix_tree_init(void) { radix_tree_node_cachep = kmem_cache_create("radix_tree_node", sizeof(struct radix_tree_node), 0, |
488514d17
|
1407 1408 |
SLAB_PANIC | SLAB_RECLAIM_ACCOUNT, radix_tree_node_ctor); |
1da177e4c
|
1409 1410 1411 |
radix_tree_init_maxindex(); hotcpu_notifier(radix_tree_callback, 0); } |