Lines Matching refs:can

17 entry in a cache-efficient manner.  The tree can also be put into an RCU-safe
19 synchronize on a lock, which can be the default spinlock, or the user can set
28 The Maple Tree can store values between ``0`` and ``ULONG_MAX``.  The Maple
31 entries then the users can convert the entries using xa_mk_value() and convert
33 value, then the user can convert the value when using the
36 The Maple Tree can also be configured to support searching for a gap of a given
57 ``0`` upwards or ``ULONG_MAX`` down.  An allocation tree can be used by
60 You can then set entries using mtree_store() or mtree_store_range().
64 given index.  You can use mtree_erase() to erase an entire range by only
69 currently ``NULL``, you can use mtree_insert_range() or mtree_insert() which
72 You can search for an entry from an index upwards by using mt_find().
74 You can walk each entry within a range by calling mt_for_each().  You must
84 You can use mtree_dup() to duplicate an entire maple tree. It is a more
87 Finally, you can remove all entries from a maple tree by calling
124 structures that you are storing in the Maple Tree, you can call mtree_lock()
128 incrementing the refcount.  You can also use RCU to avoid dereferencing
138 cost of an interface which can be harder to use and has fewer safeguards.
140 You can use the ma_lock, RCU or an external lock for protection.
141 You can mix advanced and normal operations on the same array, as long
158 You can set entries using mas_store().  mas_store() will overwrite any entry
162 You can use mas_erase() to erase an entire range by setting index and
168 You can walk each entry within a range by using mas_for_each().  If you want
190 or mas_empty_area_rev() can be used.  mas_empty_area() searches for a gap
212 The maple tree uses a spinlock by default, but external locks can be used for