include/linux/radix-tree.h

37  * The bottom two bits of the slot determine how the remaining bits in the
38  * slot are interpreted:
45  * sibling entry, or an indicator that the entry in this slot has been moved
94  * @index:	index of current slot
97  * @node:	node that contains current slot
101  * described by a pointer to its first slot and a struct radix_tree_iter
165  * radix_tree_deref_slot - dereference a slot
166  * @slot: slot pointer, returned by radix_tree_lookup_slot
169  * locked across slot lookup and dereference. Not required if write lock is
175  * Return: entry stored in that slot.
177 static inline void *radix_tree_deref_slot(void __rcu **slot)
179 	return rcu_dereference(*slot);
183  * radix_tree_deref_slot_protected - dereference a slot with tree lock held
184  * @slot: slot pointer, returned by radix_tree_lookup_slot
189  * Return: entry stored in that slot.
191 static inline void *radix_tree_deref_slot_protected(void __rcu **slot,
194 	return rcu_dereference_protected(*slot, lockdep_is_held(treelock));
227 			  void __rcu **slot, void *entry);
229 		const struct radix_tree_iter *, void __rcu **slot, void *entry);
231 			     void __rcu **slot, void *entry);
233 			struct radix_tree_iter *iter, void __rcu **slot);
302  * Returns:	pointer to chunk first slot, or NULL if there no more left
305  * @iter->next_index.  It returns a pointer to the chunk's first slot.
318  * If @index is present in the radix tree, this function returns the slot
335  * against deletion or creation may result in seeing a slot for which
355  * @slot: pointer to current slot
357  * Returns: New slot pointer
363 void __rcu **__must_check radix_tree_iter_resume(void __rcu **slot,
379  * radix_tree_next_slot - find next slot in chunk
381  * @slot:	pointer to current slot
384  * Returns:	pointer to next slot, or NULL if there no more left
389  * There are several cases where 'slot' can be passed in as NULL to this
392  * 'slot' because either:
397 static __always_inline void __rcu **radix_tree_next_slot(void __rcu **slot,
406 			slot++;
414 			slot += offset;
421 			slot++;
424 			if (likely(*slot))
436 	return slot;
442  * @slot:	the void** variable for pointer to slot
447  * @slot points to radix tree slot, @iter->index contains its index.
449 #define radix_tree_for_each_slot(slot, root, iter, start)		\
450 	for (slot = radix_tree_iter_init(iter, start) ;			\
451 	     slot || (slot = radix_tree_next_chunk(root, iter, 0)) ;	\
452 	     slot = radix_tree_next_slot(slot, iter, 0))
457  * @slot:	the void** variable for pointer to slot
463  * @slot points to radix tree slot, @iter->index contains its index.
465 #define radix_tree_for_each_tagged(slot, root, iter, start, tag)	\
466 	for (slot = radix_tree_iter_init(iter, start) ;			\
467 	     slot || (slot = radix_tree_next_chunk(root, iter,		\
469 	     slot = radix_tree_next_slot(slot, iter,			\