Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Copyright (C) 2001 Momchil Velikov | |
3 | * Portions Copyright (C) 2001 Christoph Hellwig | |
7cf9c2c7 | 4 | * Copyright (C) 2006 Nick Piggin |
78c1d784 | 5 | * Copyright (C) 2012 Konstantin Khlebnikov |
1da177e4 LT |
6 | * |
7 | * This program is free software; you can redistribute it and/or | |
8 | * modify it under the terms of the GNU General Public License as | |
9 | * published by the Free Software Foundation; either version 2, or (at | |
10 | * your option) any later version. | |
11 | * | |
12 | * This program is distributed in the hope that it will be useful, but | |
13 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
15 | * General Public License for more details. | |
16 | * | |
17 | * You should have received a copy of the GNU General Public License | |
18 | * along with this program; if not, write to the Free Software | |
19 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
20 | */ | |
21 | #ifndef _LINUX_RADIX_TREE_H | |
22 | #define _LINUX_RADIX_TREE_H | |
23 | ||
f67c07f0 | 24 | #include <linux/bitops.h> |
1da177e4 LT |
25 | #include <linux/preempt.h> |
26 | #include <linux/types.h> | |
187f1882 | 27 | #include <linux/bug.h> |
7cf9c2c7 NP |
28 | #include <linux/kernel.h> |
29 | #include <linux/rcupdate.h> | |
30 | ||
31 | /* | |
3bcadd6f MW |
32 | * The bottom two bits of the slot determine how the remaining bits in the |
33 | * slot are interpreted: | |
7cf9c2c7 | 34 | * |
3bcadd6f MW |
35 | * 00 - data pointer |
36 | * 01 - internal entry | |
37 | * 10 - exceptional entry | |
a23216a2 | 38 | * 11 - this bit combination is currently unused/reserved |
3bcadd6f MW |
39 | * |
40 | * The internal entry may be a pointer to the next level in the tree, a | |
41 | * sibling entry, or an indicator that the entry in this slot has been moved | |
42 | * to another location in the tree and the lookup should be restarted. While | |
43 | * NULL fits the 'data pointer' pattern, it means that there is no entry in | |
44 | * the tree for this index (no matter what level of the tree it is found at). | |
45 | * This means that you cannot store NULL in the tree as a value for the index. | |
7cf9c2c7 | 46 | */ |
3bcadd6f MW |
47 | #define RADIX_TREE_ENTRY_MASK 3UL |
48 | #define RADIX_TREE_INTERNAL_NODE 1UL | |
30ff46cc | 49 | |
6328650b | 50 | /* |
3bcadd6f MW |
51 | * Most users of the radix tree store pointers but shmem/tmpfs stores swap |
52 | * entries in the same tree. They are marked as exceptional entries to | |
53 | * distinguish them from pointers to struct page. | |
6328650b HD |
54 | * EXCEPTIONAL_ENTRY tests the bit, EXCEPTIONAL_SHIFT shifts content past it. |
55 | */ | |
56 | #define RADIX_TREE_EXCEPTIONAL_ENTRY 2 | |
57 | #define RADIX_TREE_EXCEPTIONAL_SHIFT 2 | |
7cf9c2c7 | 58 | |
3bcadd6f | 59 | static inline bool radix_tree_is_internal_node(void *ptr) |
7cf9c2c7 | 60 | { |
3bcadd6f MW |
61 | return ((unsigned long)ptr & RADIX_TREE_ENTRY_MASK) == |
62 | RADIX_TREE_INTERNAL_NODE; | |
7cf9c2c7 NP |
63 | } |
64 | ||
65 | /*** radix-tree API starts here ***/ | |
1da177e4 | 66 | |
f446daae | 67 | #define RADIX_TREE_MAX_TAGS 3 |
612d6c19 | 68 | |
97d778b2 | 69 | #ifndef RADIX_TREE_MAP_SHIFT |
139e5616 | 70 | #define RADIX_TREE_MAP_SHIFT (CONFIG_BASE_SMALL ? 4 : 6) |
139e5616 JW |
71 | #endif |
72 | ||
73 | #define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT) | |
74 | #define RADIX_TREE_MAP_MASK (RADIX_TREE_MAP_SIZE-1) | |
75 | ||
76 | #define RADIX_TREE_TAG_LONGS \ | |
77 | ((RADIX_TREE_MAP_SIZE + BITS_PER_LONG - 1) / BITS_PER_LONG) | |
78 | ||
449dd698 JW |
79 | #define RADIX_TREE_INDEX_BITS (8 /* CHAR_BIT */ * sizeof(unsigned long)) |
80 | #define RADIX_TREE_MAX_PATH (DIV_ROUND_UP(RADIX_TREE_INDEX_BITS, \ | |
81 | RADIX_TREE_MAP_SHIFT)) | |
82 | ||
449dd698 JW |
83 | /* Internally used bits of node->count */ |
84 | #define RADIX_TREE_COUNT_SHIFT (RADIX_TREE_MAP_SHIFT + 1) | |
85 | #define RADIX_TREE_COUNT_MASK ((1UL << RADIX_TREE_COUNT_SHIFT) - 1) | |
86 | ||
139e5616 | 87 | struct radix_tree_node { |
c12e51b0 | 88 | unsigned char shift; /* Bits remaining in each slot */ |
0c7fa0a8 | 89 | unsigned char offset; /* Slot offset in parent */ |
139e5616 JW |
90 | unsigned int count; |
91 | union { | |
449dd698 JW |
92 | struct { |
93 | /* Used when ascending tree */ | |
94 | struct radix_tree_node *parent; | |
95 | /* For tree user */ | |
96 | void *private_data; | |
97 | }; | |
98 | /* Used when freeing node */ | |
99 | struct rcu_head rcu_head; | |
139e5616 | 100 | }; |
449dd698 JW |
101 | /* For tree user */ |
102 | struct list_head private_list; | |
139e5616 JW |
103 | void __rcu *slots[RADIX_TREE_MAP_SIZE]; |
104 | unsigned long tags[RADIX_TREE_MAX_TAGS][RADIX_TREE_TAG_LONGS]; | |
105 | }; | |
106 | ||
612d6c19 | 107 | /* root tags are stored in gfp_mask, shifted by __GFP_BITS_SHIFT */ |
1da177e4 | 108 | struct radix_tree_root { |
fd4f2df2 | 109 | gfp_t gfp_mask; |
a1115570 | 110 | struct radix_tree_node __rcu *rnode; |
1da177e4 LT |
111 | }; |
112 | ||
113 | #define RADIX_TREE_INIT(mask) { \ | |
1da177e4 LT |
114 | .gfp_mask = (mask), \ |
115 | .rnode = NULL, \ | |
116 | } | |
117 | ||
118 | #define RADIX_TREE(name, mask) \ | |
119 | struct radix_tree_root name = RADIX_TREE_INIT(mask) | |
120 | ||
121 | #define INIT_RADIX_TREE(root, mask) \ | |
122 | do { \ | |
1da177e4 LT |
123 | (root)->gfp_mask = (mask); \ |
124 | (root)->rnode = NULL; \ | |
125 | } while (0) | |
126 | ||
e9256efc MW |
127 | static inline bool radix_tree_empty(struct radix_tree_root *root) |
128 | { | |
129 | return root->rnode == NULL; | |
130 | } | |
131 | ||
7cf9c2c7 NP |
132 | /** |
133 | * Radix-tree synchronization | |
134 | * | |
135 | * The radix-tree API requires that users provide all synchronisation (with | |
136 | * specific exceptions, noted below). | |
137 | * | |
138 | * Synchronization of access to the data items being stored in the tree, and | |
139 | * management of their lifetimes must be completely managed by API users. | |
140 | * | |
141 | * For API usage, in general, | |
59c51591 | 142 | * - any function _modifying_ the tree or tags (inserting or deleting |
eb8dc5e7 | 143 | * items, setting or clearing tags) must exclude other modifications, and |
7cf9c2c7 | 144 | * exclude any functions reading the tree. |
59c51591 | 145 | * - any function _reading_ the tree or tags (looking up items or tags, |
7cf9c2c7 NP |
146 | * gang lookups) must exclude modifications to the tree, but may occur |
147 | * concurrently with other readers. | |
148 | * | |
149 | * The notable exceptions to this rule are the following functions: | |
139e5616 | 150 | * __radix_tree_lookup |
7cf9c2c7 | 151 | * radix_tree_lookup |
47feff2c | 152 | * radix_tree_lookup_slot |
7cf9c2c7 NP |
153 | * radix_tree_tag_get |
154 | * radix_tree_gang_lookup | |
47feff2c | 155 | * radix_tree_gang_lookup_slot |
7cf9c2c7 | 156 | * radix_tree_gang_lookup_tag |
47feff2c | 157 | * radix_tree_gang_lookup_tag_slot |
7cf9c2c7 NP |
158 | * radix_tree_tagged |
159 | * | |
243c2137 | 160 | * The first 8 functions are able to be called locklessly, using RCU. The |
7cf9c2c7 NP |
161 | * caller must ensure calls to these functions are made within rcu_read_lock() |
162 | * regions. Other readers (lock-free or otherwise) and modifications may be | |
163 | * running concurrently. | |
164 | * | |
165 | * It is still required that the caller manage the synchronization and lifetimes | |
166 | * of the items. So if RCU lock-free lookups are used, typically this would mean | |
167 | * that the items have their own locks, or are amenable to lock-free access; and | |
168 | * that the items are freed by RCU (or only freed after having been deleted from | |
169 | * the radix tree *and* a synchronize_rcu() grace period). | |
170 | * | |
171 | * (Note, rcu_assign_pointer and rcu_dereference are not needed to control | |
172 | * access to data items when inserting into or looking up from the radix tree) | |
173 | * | |
ce82653d DH |
174 | * Note that the value returned by radix_tree_tag_get() may not be relied upon |
175 | * if only the RCU read lock is held. Functions to set/clear tags and to | |
176 | * delete nodes running concurrently with it may affect its result such that | |
177 | * two consecutive reads in the same locked section may return different | |
178 | * values. If reliability is required, modification functions must also be | |
179 | * excluded from concurrency. | |
180 | * | |
7cf9c2c7 NP |
181 | * radix_tree_tagged is able to be called without locking or RCU. |
182 | */ | |
183 | ||
184 | /** | |
185 | * radix_tree_deref_slot - dereference a slot | |
186 | * @pslot: pointer to slot, returned by radix_tree_lookup_slot | |
187 | * Returns: item that was stored in that slot with any direct pointer flag | |
188 | * removed. | |
189 | * | |
190 | * For use with radix_tree_lookup_slot(). Caller must hold tree at least read | |
27d20fdd NP |
191 | * locked across slot lookup and dereference. Not required if write lock is |
192 | * held (ie. items cannot be concurrently inserted). | |
193 | * | |
194 | * radix_tree_deref_retry must be used to confirm validity of the pointer if | |
195 | * only the read lock is held. | |
7cf9c2c7 NP |
196 | */ |
197 | static inline void *radix_tree_deref_slot(void **pslot) | |
198 | { | |
27d20fdd | 199 | return rcu_dereference(*pslot); |
7cf9c2c7 | 200 | } |
27d20fdd | 201 | |
29c1f677 MG |
202 | /** |
203 | * radix_tree_deref_slot_protected - dereference a slot without RCU lock but with tree lock held | |
204 | * @pslot: pointer to slot, returned by radix_tree_lookup_slot | |
205 | * Returns: item that was stored in that slot with any direct pointer flag | |
206 | * removed. | |
207 | * | |
208 | * Similar to radix_tree_deref_slot but only used during migration when a pages | |
209 | * mapping is being moved. The caller does not hold the RCU read lock but it | |
210 | * must hold the tree lock to prevent parallel updates. | |
211 | */ | |
212 | static inline void *radix_tree_deref_slot_protected(void **pslot, | |
213 | spinlock_t *treelock) | |
214 | { | |
215 | return rcu_dereference_protected(*pslot, lockdep_is_held(treelock)); | |
216 | } | |
217 | ||
27d20fdd NP |
218 | /** |
219 | * radix_tree_deref_retry - check radix_tree_deref_slot | |
220 | * @arg: pointer returned by radix_tree_deref_slot | |
221 | * Returns: 0 if retry is not required, otherwise retry is required | |
222 | * | |
223 | * radix_tree_deref_retry must be used with radix_tree_deref_slot. | |
224 | */ | |
225 | static inline int radix_tree_deref_retry(void *arg) | |
226 | { | |
b194d16c | 227 | return unlikely(radix_tree_is_internal_node(arg)); |
27d20fdd NP |
228 | } |
229 | ||
6328650b HD |
230 | /** |
231 | * radix_tree_exceptional_entry - radix_tree_deref_slot gave exceptional entry? | |
232 | * @arg: value returned by radix_tree_deref_slot | |
233 | * Returns: 0 if well-aligned pointer, non-0 if exceptional entry. | |
234 | */ | |
235 | static inline int radix_tree_exceptional_entry(void *arg) | |
236 | { | |
237 | /* Not unlikely because radix_tree_exception often tested first */ | |
238 | return (unsigned long)arg & RADIX_TREE_EXCEPTIONAL_ENTRY; | |
239 | } | |
240 | ||
241 | /** | |
242 | * radix_tree_exception - radix_tree_deref_slot returned either exception? | |
243 | * @arg: value returned by radix_tree_deref_slot | |
244 | * Returns: 0 if well-aligned pointer, non-0 if either kind of exception. | |
245 | */ | |
246 | static inline int radix_tree_exception(void *arg) | |
247 | { | |
3bcadd6f | 248 | return unlikely((unsigned long)arg & RADIX_TREE_ENTRY_MASK); |
6328650b HD |
249 | } |
250 | ||
7cf9c2c7 NP |
251 | /** |
252 | * radix_tree_replace_slot - replace item in a slot | |
253 | * @pslot: pointer to slot, returned by radix_tree_lookup_slot | |
254 | * @item: new item to store in the slot. | |
255 | * | |
256 | * For use with radix_tree_lookup_slot(). Caller must hold tree write locked | |
257 | * across slot lookup and replacement. | |
258 | */ | |
259 | static inline void radix_tree_replace_slot(void **pslot, void *item) | |
260 | { | |
b194d16c | 261 | BUG_ON(radix_tree_is_internal_node(item)); |
c0bc9875 | 262 | rcu_assign_pointer(*pslot, item); |
7cf9c2c7 NP |
263 | } |
264 | ||
139e5616 | 265 | int __radix_tree_create(struct radix_tree_root *root, unsigned long index, |
e6145236 MW |
266 | unsigned order, struct radix_tree_node **nodep, |
267 | void ***slotp); | |
268 | int __radix_tree_insert(struct radix_tree_root *, unsigned long index, | |
269 | unsigned order, void *); | |
270 | static inline int radix_tree_insert(struct radix_tree_root *root, | |
271 | unsigned long index, void *entry) | |
272 | { | |
273 | return __radix_tree_insert(root, index, 0, entry); | |
274 | } | |
139e5616 JW |
275 | void *__radix_tree_lookup(struct radix_tree_root *root, unsigned long index, |
276 | struct radix_tree_node **nodep, void ***slotp); | |
1da177e4 | 277 | void *radix_tree_lookup(struct radix_tree_root *, unsigned long); |
a4331366 | 278 | void **radix_tree_lookup_slot(struct radix_tree_root *, unsigned long); |
449dd698 | 279 | bool __radix_tree_delete_node(struct radix_tree_root *root, |
139e5616 | 280 | struct radix_tree_node *node); |
53c59f26 | 281 | void *radix_tree_delete_item(struct radix_tree_root *, unsigned long, void *); |
1da177e4 | 282 | void *radix_tree_delete(struct radix_tree_root *, unsigned long); |
d604c324 MW |
283 | struct radix_tree_node *radix_tree_replace_clear_tags( |
284 | struct radix_tree_root *root, | |
285 | unsigned long index, void *entry); | |
286 | unsigned int radix_tree_gang_lookup(struct radix_tree_root *root, | |
287 | void **results, unsigned long first_index, | |
288 | unsigned int max_items); | |
6328650b HD |
289 | unsigned int radix_tree_gang_lookup_slot(struct radix_tree_root *root, |
290 | void ***results, unsigned long *indices, | |
47feff2c | 291 | unsigned long first_index, unsigned int max_items); |
dd0fc66f | 292 | int radix_tree_preload(gfp_t gfp_mask); |
5e4c0d97 | 293 | int radix_tree_maybe_preload(gfp_t gfp_mask); |
c78c66d1 | 294 | int radix_tree_maybe_preload_order(gfp_t gfp_mask, int order); |
1da177e4 LT |
295 | void radix_tree_init(void); |
296 | void *radix_tree_tag_set(struct radix_tree_root *root, | |
daff89f3 | 297 | unsigned long index, unsigned int tag); |
1da177e4 | 298 | void *radix_tree_tag_clear(struct radix_tree_root *root, |
daff89f3 | 299 | unsigned long index, unsigned int tag); |
1da177e4 | 300 | int radix_tree_tag_get(struct radix_tree_root *root, |
daff89f3 | 301 | unsigned long index, unsigned int tag); |
1da177e4 LT |
302 | unsigned int |
303 | radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results, | |
daff89f3 JC |
304 | unsigned long first_index, unsigned int max_items, |
305 | unsigned int tag); | |
47feff2c NP |
306 | unsigned int |
307 | radix_tree_gang_lookup_tag_slot(struct radix_tree_root *root, void ***results, | |
308 | unsigned long first_index, unsigned int max_items, | |
309 | unsigned int tag); | |
ebf8aa44 JK |
310 | unsigned long radix_tree_range_tag_if_tagged(struct radix_tree_root *root, |
311 | unsigned long *first_indexp, unsigned long last_index, | |
312 | unsigned long nr_to_tag, | |
313 | unsigned int fromtag, unsigned int totag); | |
daff89f3 | 314 | int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag); |
e504f3fd | 315 | unsigned long radix_tree_locate_item(struct radix_tree_root *root, void *item); |
1da177e4 LT |
316 | |
317 | static inline void radix_tree_preload_end(void) | |
318 | { | |
319 | preempt_enable(); | |
320 | } | |
321 | ||
78c1d784 KK |
322 | /** |
323 | * struct radix_tree_iter - radix tree iterator state | |
324 | * | |
325 | * @index: index of current slot | |
21ef5339 | 326 | * @next_index: one beyond the last index for this chunk |
78c1d784 | 327 | * @tags: bit-mask for tag-iterating |
21ef5339 | 328 | * @shift: shift for the node that holds our slots |
78c1d784 KK |
329 | * |
330 | * This radix tree iterator works in terms of "chunks" of slots. A chunk is a | |
331 | * subinterval of slots contained within one radix tree leaf node. It is | |
332 | * described by a pointer to its first slot and a struct radix_tree_iter | |
333 | * which holds the chunk's position in the tree and its size. For tagged | |
334 | * iteration radix_tree_iter also holds the slots' bit-mask for one chosen | |
335 | * radix tree tag. | |
336 | */ | |
337 | struct radix_tree_iter { | |
338 | unsigned long index; | |
339 | unsigned long next_index; | |
340 | unsigned long tags; | |
21ef5339 RZ |
341 | #ifdef CONFIG_RADIX_TREE_MULTIORDER |
342 | unsigned int shift; | |
343 | #endif | |
78c1d784 KK |
344 | }; |
345 | ||
21ef5339 RZ |
346 | static inline unsigned int iter_shift(struct radix_tree_iter *iter) |
347 | { | |
348 | #ifdef CONFIG_RADIX_TREE_MULTIORDER | |
349 | return iter->shift; | |
350 | #else | |
351 | return 0; | |
352 | #endif | |
353 | } | |
354 | ||
78c1d784 KK |
355 | #define RADIX_TREE_ITER_TAG_MASK 0x00FF /* tag index in lower byte */ |
356 | #define RADIX_TREE_ITER_TAGGED 0x0100 /* lookup tagged slots */ | |
357 | #define RADIX_TREE_ITER_CONTIG 0x0200 /* stop at first hole */ | |
358 | ||
359 | /** | |
360 | * radix_tree_iter_init - initialize radix tree iterator | |
361 | * | |
362 | * @iter: pointer to iterator state | |
363 | * @start: iteration starting index | |
364 | * Returns: NULL | |
365 | */ | |
366 | static __always_inline void ** | |
367 | radix_tree_iter_init(struct radix_tree_iter *iter, unsigned long start) | |
368 | { | |
369 | /* | |
370 | * Leave iter->tags uninitialized. radix_tree_next_chunk() will fill it | |
371 | * in the case of a successful tagged chunk lookup. If the lookup was | |
372 | * unsuccessful or non-tagged then nobody cares about ->tags. | |
373 | * | |
374 | * Set index to zero to bypass next_index overflow protection. | |
375 | * See the comment in radix_tree_next_chunk() for details. | |
376 | */ | |
377 | iter->index = 0; | |
378 | iter->next_index = start; | |
379 | return NULL; | |
380 | } | |
381 | ||
382 | /** | |
383 | * radix_tree_next_chunk - find next chunk of slots for iteration | |
384 | * | |
385 | * @root: radix tree root | |
386 | * @iter: iterator state | |
387 | * @flags: RADIX_TREE_ITER_* flags and tag index | |
388 | * Returns: pointer to chunk first slot, or NULL if there no more left | |
389 | * | |
390 | * This function looks up the next chunk in the radix tree starting from | |
391 | * @iter->next_index. It returns a pointer to the chunk's first slot. | |
392 | * Also it fills @iter with data about chunk: position in the tree (index), | |
393 | * its end (next_index), and constructs a bit mask for tagged iterating (tags). | |
394 | */ | |
395 | void **radix_tree_next_chunk(struct radix_tree_root *root, | |
396 | struct radix_tree_iter *iter, unsigned flags); | |
397 | ||
46437f9a MW |
398 | /** |
399 | * radix_tree_iter_retry - retry this chunk of the iteration | |
400 | * @iter: iterator state | |
401 | * | |
402 | * If we iterate over a tree protected only by the RCU lock, a race | |
403 | * against deletion or creation may result in seeing a slot for which | |
404 | * radix_tree_deref_retry() returns true. If so, call this function | |
405 | * and continue the iteration. | |
406 | */ | |
407 | static inline __must_check | |
408 | void **radix_tree_iter_retry(struct radix_tree_iter *iter) | |
409 | { | |
410 | iter->next_index = iter->index; | |
3cb9185c | 411 | iter->tags = 0; |
46437f9a MW |
412 | return NULL; |
413 | } | |
414 | ||
21ef5339 RZ |
415 | static inline unsigned long |
416 | __radix_tree_iter_add(struct radix_tree_iter *iter, unsigned long slots) | |
417 | { | |
418 | return iter->index + (slots << iter_shift(iter)); | |
419 | } | |
420 | ||
7165092f MW |
421 | /** |
422 | * radix_tree_iter_next - resume iterating when the chunk may be invalid | |
423 | * @iter: iterator state | |
424 | * | |
425 | * If the iterator needs to release then reacquire a lock, the chunk may | |
426 | * have been invalidated by an insertion or deletion. Call this function | |
427 | * to continue the iteration from the next index. | |
428 | */ | |
429 | static inline __must_check | |
430 | void **radix_tree_iter_next(struct radix_tree_iter *iter) | |
431 | { | |
21ef5339 | 432 | iter->next_index = __radix_tree_iter_add(iter, 1); |
7165092f MW |
433 | iter->tags = 0; |
434 | return NULL; | |
435 | } | |
436 | ||
78c1d784 KK |
437 | /** |
438 | * radix_tree_chunk_size - get current chunk size | |
439 | * | |
440 | * @iter: pointer to radix tree iterator | |
441 | * Returns: current chunk size | |
442 | */ | |
73204282 | 443 | static __always_inline long |
78c1d784 KK |
444 | radix_tree_chunk_size(struct radix_tree_iter *iter) |
445 | { | |
21ef5339 RZ |
446 | return (iter->next_index - iter->index) >> iter_shift(iter); |
447 | } | |
448 | ||
4dd6c098 | 449 | static inline struct radix_tree_node *entry_to_node(void *ptr) |
21ef5339 | 450 | { |
30ff46cc | 451 | return (void *)((unsigned long)ptr & ~RADIX_TREE_INTERNAL_NODE); |
78c1d784 KK |
452 | } |
453 | ||
454 | /** | |
455 | * radix_tree_next_slot - find next slot in chunk | |
456 | * | |
457 | * @slot: pointer to current slot | |
458 | * @iter: pointer to interator state | |
459 | * @flags: RADIX_TREE_ITER_*, should be constant | |
460 | * Returns: pointer to next slot, or NULL if there no more left | |
461 | * | |
462 | * This function updates @iter->index in the case of a successful lookup. | |
463 | * For tagged lookup it also eats @iter->tags. | |
464 | */ | |
465 | static __always_inline void ** | |
466 | radix_tree_next_slot(void **slot, struct radix_tree_iter *iter, unsigned flags) | |
467 | { | |
468 | if (flags & RADIX_TREE_ITER_TAGGED) { | |
21ef5339 RZ |
469 | void *canon = slot; |
470 | ||
78c1d784 | 471 | iter->tags >>= 1; |
21ef5339 RZ |
472 | if (unlikely(!iter->tags)) |
473 | return NULL; | |
474 | while (IS_ENABLED(CONFIG_RADIX_TREE_MULTIORDER) && | |
b194d16c | 475 | radix_tree_is_internal_node(slot[1])) { |
4dd6c098 | 476 | if (entry_to_node(slot[1]) == canon) { |
21ef5339 RZ |
477 | iter->tags >>= 1; |
478 | iter->index = __radix_tree_iter_add(iter, 1); | |
479 | slot++; | |
480 | continue; | |
481 | } | |
482 | iter->next_index = __radix_tree_iter_add(iter, 1); | |
483 | return NULL; | |
484 | } | |
78c1d784 | 485 | if (likely(iter->tags & 1ul)) { |
21ef5339 | 486 | iter->index = __radix_tree_iter_add(iter, 1); |
78c1d784 KK |
487 | return slot + 1; |
488 | } | |
21ef5339 | 489 | if (!(flags & RADIX_TREE_ITER_CONTIG)) { |
78c1d784 KK |
490 | unsigned offset = __ffs(iter->tags); |
491 | ||
492 | iter->tags >>= offset; | |
21ef5339 | 493 | iter->index = __radix_tree_iter_add(iter, offset + 1); |
78c1d784 KK |
494 | return slot + offset + 1; |
495 | } | |
496 | } else { | |
21ef5339 RZ |
497 | long count = radix_tree_chunk_size(iter); |
498 | void *canon = slot; | |
78c1d784 | 499 | |
21ef5339 | 500 | while (--count > 0) { |
78c1d784 | 501 | slot++; |
21ef5339 RZ |
502 | iter->index = __radix_tree_iter_add(iter, 1); |
503 | ||
504 | if (IS_ENABLED(CONFIG_RADIX_TREE_MULTIORDER) && | |
b194d16c | 505 | radix_tree_is_internal_node(*slot)) { |
4dd6c098 | 506 | if (entry_to_node(*slot) == canon) |
21ef5339 | 507 | continue; |
4dd6c098 MW |
508 | iter->next_index = iter->index; |
509 | break; | |
21ef5339 RZ |
510 | } |
511 | ||
78c1d784 KK |
512 | if (likely(*slot)) |
513 | return slot; | |
fffaee36 KK |
514 | if (flags & RADIX_TREE_ITER_CONTIG) { |
515 | /* forbid switching to the next chunk */ | |
516 | iter->next_index = 0; | |
78c1d784 | 517 | break; |
fffaee36 | 518 | } |
78c1d784 KK |
519 | } |
520 | } | |
521 | return NULL; | |
522 | } | |
523 | ||
78c1d784 KK |
524 | /** |
525 | * radix_tree_for_each_slot - iterate over non-empty slots | |
526 | * | |
527 | * @slot: the void** variable for pointer to slot | |
528 | * @root: the struct radix_tree_root pointer | |
529 | * @iter: the struct radix_tree_iter pointer | |
530 | * @start: iteration starting index | |
531 | * | |
532 | * @slot points to radix tree slot, @iter->index contains its index. | |
533 | */ | |
534 | #define radix_tree_for_each_slot(slot, root, iter, start) \ | |
535 | for (slot = radix_tree_iter_init(iter, start) ; \ | |
536 | slot || (slot = radix_tree_next_chunk(root, iter, 0)) ; \ | |
537 | slot = radix_tree_next_slot(slot, iter, 0)) | |
538 | ||
539 | /** | |
540 | * radix_tree_for_each_contig - iterate over contiguous slots | |
541 | * | |
542 | * @slot: the void** variable for pointer to slot | |
543 | * @root: the struct radix_tree_root pointer | |
544 | * @iter: the struct radix_tree_iter pointer | |
545 | * @start: iteration starting index | |
546 | * | |
547 | * @slot points to radix tree slot, @iter->index contains its index. | |
548 | */ | |
549 | #define radix_tree_for_each_contig(slot, root, iter, start) \ | |
550 | for (slot = radix_tree_iter_init(iter, start) ; \ | |
551 | slot || (slot = radix_tree_next_chunk(root, iter, \ | |
552 | RADIX_TREE_ITER_CONTIG)) ; \ | |
553 | slot = radix_tree_next_slot(slot, iter, \ | |
554 | RADIX_TREE_ITER_CONTIG)) | |
555 | ||
556 | /** | |
557 | * radix_tree_for_each_tagged - iterate over tagged slots | |
558 | * | |
559 | * @slot: the void** variable for pointer to slot | |
560 | * @root: the struct radix_tree_root pointer | |
561 | * @iter: the struct radix_tree_iter pointer | |
562 | * @start: iteration starting index | |
563 | * @tag: tag index | |
564 | * | |
565 | * @slot points to radix tree slot, @iter->index contains its index. | |
566 | */ | |
567 | #define radix_tree_for_each_tagged(slot, root, iter, start, tag) \ | |
568 | for (slot = radix_tree_iter_init(iter, start) ; \ | |
569 | slot || (slot = radix_tree_next_chunk(root, iter, \ | |
570 | RADIX_TREE_ITER_TAGGED | tag)) ; \ | |
571 | slot = radix_tree_next_slot(slot, iter, \ | |
572 | RADIX_TREE_ITER_TAGGED)) | |
573 | ||
1da177e4 | 574 | #endif /* _LINUX_RADIX_TREE_H */ |