include/linux/radix-tree.h

42  * The internal entry may be a pointer to the next level in the tree, a
44  * to another location in the tree and the lookup should be restarted.  While
46  * the tree for this index (no matter what level of the tree it is found at).
47  * This means that storing a NULL entry in the tree is the same as deleting
48  * the entry from the tree.
59 /*** radix-tree API starts here ***/
90  * struct radix_tree_iter - radix tree iterator state
97  * This radix tree iterator works in terms of "chunks" of slots.  A chunk is a
98  * subinterval of slots contained within one radix tree leaf node.  It is
100  * which holds the chunk's position in the tree and its size.  For tagged
102  * radix tree tag.
112  * Radix-tree synchronization
114  * The radix-tree API requires that users provide all synchronisation (with
117  * Synchronization of access to the data items being stored in the tree, and
121  * - any function _modifying_ the tree or tags (inserting or deleting
123  *   exclude any functions reading the tree.
124  * - any function _reading_ the tree or tags (looking up items or tags,
125  *   gang lookups) must exclude modifications to the tree, but may occur
147  * the radix tree *and* a synchronize_rcu() grace period).
150  * access to data items when inserting into or looking up from the radix tree)
166  * For use with radix_tree_lookup_slot().  Caller must hold tree at least read
181  * radix_tree_deref_slot_protected - dereference a slot with tree lock held
185  * lock but it must hold the tree lock to prevent parallel updates.
272  * radix_tree_iter_init - initialize radix tree iterator
297  * @root:	radix tree root
302  * This function looks up the next chunk in the radix tree starting from
304  * Also it fills @iter with data about chunk: position in the tree (index),
311  * radix_tree_iter_lookup - look up an index in the radix tree
312  * @root: radix tree root
316  * If @index is present in the radix tree, this function returns the slot
332  * If we iterate over a tree protected only by the RCU lock, a race
367  * @iter:	pointer to radix tree iterator
445  * @slot points to radix tree slot, @iter->index contains its index.
461  * @slot points to radix tree slot, @iter->index contains its index.