Lines Matching full:an

17 entry in a cache-efficient manner.  The tree can also be put into an RCU-safe
20 the lock to an external lock of a different type.  Note that external locks may
25 use the normal API.  An :ref:`maple-tree-advanced-api` exists for more complex
47 data density, erasing an entry may cause allocations to occur.  That is,
48 erasing an entry may consume memory.  Users must take care to ensure that they
67 ``0`` upwards or ``ULONG_MAX`` down.  An allocation tree can be used by
72 success or an error code otherwise.  mtree_store_range() works in the same way
74 given index.  You can use mtree_erase() to erase an entire range by only
75 knowing one value within that range, or mtree_store() call with an entry of
78 fail.  mtree_erase() can sleep, so it must not be called from an atomic
85 You can search for an entry from an index upwards by using mt_find().
97 You can use mtree_dup() to duplicate an entire maple tree. It is a more
116 The Maple Tree uses RCU and an internal spinlock to synchronise access:
142 freed memory, but an explanation of that is beyond the scope of this
151 cost of an interface which can be harder to use and has fewer safeguards.
153 You can use the ma_lock, RCU or an external lock for protection.
175 You can use mas_erase() to erase an entire range by setting index and
201 If the user needs to yield the lock during an operation, then the maple state
204 There are a few extra interfaces provided when using an allocation tree.
229 tree updates as well.  To use an external lock, the tree must be initialized
231 MTREE_INIT_EXT() #define, which takes an external lock as an argument.