8sphinx.addnodesdocument)}( rawsourcechildren]( translations LanguagesNode)}(hhh](h pending_xref)}(hhh]docutils.nodesTextChinese (Simplified)}(hhparenthuba attributes}(ids]classes]names]dupnames]backrefs] refdomainstdreftypedoc reftarget#/translations/zh_CN/core-api/xarraymodnameN classnameN refexplicitutagnamehhh ubh)}(hhh]hChinese (Traditional)}(hhhh2ubah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget#/translations/zh_TW/core-api/xarraymodnameN classnameN refexplicituh1hhh ubh)}(hhh]hItalian}(hhhhFubah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget#/translations/it_IT/core-api/xarraymodnameN classnameN refexplicituh1hhh ubh)}(hhh]hJapanese}(hhhhZubah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget#/translations/ja_JP/core-api/xarraymodnameN classnameN refexplicituh1hhh ubh)}(hhh]hKorean}(hhhhnubah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget#/translations/ko_KR/core-api/xarraymodnameN classnameN refexplicituh1hhh ubh)}(hhh]hSpanish}(hhhhubah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget#/translations/sp_SP/core-api/xarraymodnameN classnameN refexplicituh1hhh ubeh}(h]h ]h"]h$]h&]current_languageEnglishuh1h hh _documenthsourceNlineNubhcomment)}(h!SPDX-License-Identifier: GPL-2.0+h]h!SPDX-License-Identifier: GPL-2.0+}(hhhhubah}(h]h ]h"]h$]h&] xml:spacepreserveuh1hhhhhh=/var/lib/git/docbuild/linux/Documentation/core-api/xarray.rsthKubhsection)}(hhh](htitle)}(hXArrayh]hXArray}(hhhhhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhhhhhKubh field_list)}(hhh]hfield)}(hhh](h field_name)}(hAuthorh]hAuthor}(hhhhhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhhhKubh field_body)}(hMatthew Wilcox h]h paragraph)}(hMatthew Wilcoxh]hMatthew Wilcox}(hhhhhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhhubah}(h]h ]h"]h$]h&]uh1hhhubeh}(h]h ]h"]h$]h&]uh1hhhhKhhhhubah}(h]h ]h"]h$]h&]uh1hhhhhhhhKubh)}(hhh](h)}(hOverviewh]hOverview}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hhhhhK ubh)}(hXThe XArray is an abstract data type which behaves like a very large array of pointers. It meets many of the same needs as a hash or a conventional resizable array. Unlike a hash, it allows you to sensibly go to the next or previous entry in a cache-efficient manner. In contrast to a resizable array, there is no need to copy data or change MMU mappings in order to grow the array. It is more memory-efficient, parallelisable and cache friendly than a doubly-linked list. It takes advantage of RCU to perform lookups without locking.h]hXThe XArray is an abstract data type which behaves like a very large array of pointers. It meets many of the same needs as a hash or a conventional resizable array. Unlike a hash, it allows you to sensibly go to the next or previous entry in a cache-efficient manner. In contrast to a resizable array, there is no need to copy data or change MMU mappings in order to grow the array. It is more memory-efficient, parallelisable and cache friendly than a doubly-linked list. It takes advantage of RCU to perform lookups without locking.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK hj hhubh)}(hXThe XArray implementation is efficient when the indices used are densely clustered; hashing the object and using the hash as the index will not perform well. The XArray is optimised for small indices, but still has good performance with large indices. If your index can be larger than ``ULONG_MAX`` then the XArray is not the data type for you. The most important user of the XArray is the page cache.h](hXThe XArray implementation is efficient when the indices used are densely clustered; hashing the object and using the hash as the index will not perform well. The XArray is optimised for small indices, but still has good performance with large indices. If your index can be larger than }(hXThe XArray implementation is efficient when the indices used are densely clustered; hashing the object and using the hash as the index will not perform well. The XArray is optimised for small indices, but still has good performance with large indices. If your index can be larger than hj*hhhNhNubhliteral)}(h ``ULONG_MAX``h]h ULONG_MAX}(hhhj5hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj*ubhh then the XArray is not the data type for you. The most important user of the XArray is the page cache.}(hh then the XArray is not the data type for you. The most important user of the XArray is the page cache.hj*hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKhj hhubh)}(hX[Normal pointers may be stored in the XArray directly. They must be 4-byte aligned, which is true for any pointer returned from kmalloc() and alloc_page(). It isn't true for arbitrary user-space pointers, nor for function pointers. You can store pointers to statically allocated objects, as long as those objects have an alignment of at least 4.h]hX]Normal pointers may be stored in the XArray directly. They must be 4-byte aligned, which is true for any pointer returned from kmalloc() and alloc_page(). It isn’t true for arbitrary user-space pointers, nor for function pointers. You can store pointers to statically allocated objects, as long as those objects have an alignment of at least 4.}(hjPhjNhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhj hhubh)}(hX.You can also store integers between 0 and ``LONG_MAX`` in the XArray. You must first convert it into an entry using xa_mk_value(). When you retrieve an entry from the XArray, you can check whether it is a value entry by calling xa_is_value(), and convert it back to an integer by calling xa_to_value().h](h*You can also store integers between 0 and }(h*You can also store integers between 0 and hj\hhhNhNubj4)}(h ``LONG_MAX``h]hLONG_MAX}(hhhjehhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj\ubh in the XArray. You must first convert it into an entry using xa_mk_value(). When you retrieve an entry from the XArray, you can check whether it is a value entry by calling xa_is_value(), and convert it back to an integer by calling xa_to_value().}(h in the XArray. You must first convert it into an entry using xa_mk_value(). When you retrieve an entry from the XArray, you can check whether it is a value entry by calling xa_is_value(), and convert it back to an integer by calling xa_to_value().hj\hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhK"hj hhubh)}(hXSome users want to tag the pointers they store in the XArray. You can call xa_tag_pointer() to create an entry with a tag, xa_untag_pointer() to turn a tagged entry back into an untagged pointer and xa_pointer_tag() to retrieve the tag of an entry. Tagged pointers use the same bits that are used to distinguish value entries from normal pointers, so you must decide whether they want to store value entries or tagged pointers in any particular XArray.h]hXSome users want to tag the pointers they store in the XArray. You can call xa_tag_pointer() to create an entry with a tag, xa_untag_pointer() to turn a tagged entry back into an untagged pointer and xa_pointer_tag() to retrieve the tag of an entry. Tagged pointers use the same bits that are used to distinguish value entries from normal pointers, so you must decide whether they want to store value entries or tagged pointers in any particular XArray.}(hjhj~hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK(hj hhubh)}(hnThe XArray does not support storing IS_ERR() pointers as some conflict with value entries or internal entries.h]hnThe XArray does not support storing IS_ERR() pointers as some conflict with value entries or internal entries.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK0hj hhubh)}(hXAn unusual feature of the XArray is the ability to create entries which occupy a range of indices. Once stored to, looking up any index in the range will return the same entry as looking up any other index in the range. Storing to any index will store to all of them. Multi-index entries can be explicitly split into smaller entries, or storing ``NULL`` into any entry will cause the XArray to forget about the range.h](hX\An unusual feature of the XArray is the ability to create entries which occupy a range of indices. Once stored to, looking up any index in the range will return the same entry as looking up any other index in the range. Storing to any index will store to all of them. Multi-index entries can be explicitly split into smaller entries, or storing }(hX\An unusual feature of the XArray is the ability to create entries which occupy a range of indices. Once stored to, looking up any index in the range will return the same entry as looking up any other index in the range. Storing to any index will store to all of them. Multi-index entries can be explicitly split into smaller entries, or storing hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh@ into any entry will cause the XArray to forget about the range.}(h@ into any entry will cause the XArray to forget about the range.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhK3hj hhubeh}(h]overviewah ]h"]overviewah$]h&]uh1hhhhhhhhK ubh)}(hhh](h)}(h Normal APIh]h Normal API}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhhhhhK;ubh)}(hStart by initialising an XArray, either with DEFINE_XARRAY() for statically allocated XArrays or xa_init() for dynamically allocated ones. A freshly-initialised XArray contains a ``NULL`` pointer at every index.h](hStart by initialising an XArray, either with DEFINE_XARRAY() for statically allocated XArrays or xa_init() for dynamically allocated ones. A freshly-initialised XArray contains a }(hStart by initialising an XArray, either with DEFINE_XARRAY() for statically allocated XArrays or xa_init() for dynamically allocated ones. A freshly-initialised XArray contains a hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh pointer at every index.}(h pointer at every index.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhK=hjhhubh)}(hXYou can then set entries using xa_store() and get entries using xa_load(). xa_store will overwrite any entry with the new entry and return the previous entry stored at that index. You can use xa_erase() instead of calling xa_store() with a ``NULL`` entry. There is no difference between an entry that has never been stored to, one that has been erased and one that has most recently had ``NULL`` stored to it.h](hYou can then set entries using xa_store() and get entries using xa_load(). xa_store will overwrite any entry with the new entry and return the previous entry stored at that index. You can use xa_erase() instead of calling xa_store() with a }(hYou can then set entries using xa_store() and get entries using xa_load(). xa_store will overwrite any entry with the new entry and return the previous entry stored at that index. You can use xa_erase() instead of calling xa_store() with a hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh entry. There is no difference between an entry that has never been stored to, one that has been erased and one that has most recently had }(h entry. There is no difference between an entry that has never been stored to, one that has been erased and one that has most recently had hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh stored to it.}(h stored to it.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKBhjhhubh)}(hX(You can conditionally replace an entry at an index by using xa_cmpxchg(). Like cmpxchg(), it will only succeed if the entry at that index has the 'old' value. It also returns the entry which was at that index; if it returns the same entry which was passed as 'old', then xa_cmpxchg() succeeded.h]hX0You can conditionally replace an entry at an index by using xa_cmpxchg(). Like cmpxchg(), it will only succeed if the entry at that index has the ‘old’ value. It also returns the entry which was at that index; if it returns the same entry which was passed as ‘old’, then xa_cmpxchg() succeeded.}(hj.hj,hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKJhjhhubh)}(hIf you want to only store a new entry to an index if the current entry at that index is ``NULL``, you can use xa_insert() which returns ``-EBUSY`` if the entry is not empty.h](hXIf you want to only store a new entry to an index if the current entry at that index is }(hXIf you want to only store a new entry to an index if the current entry at that index is hj:hhhNhNubj4)}(h``NULL``h]hNULL}(hhhjChhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj:ubh(, you can use xa_insert() which returns }(h(, you can use xa_insert() which returns hj:hhhNhNubj4)}(h ``-EBUSY``h]h-EBUSY}(hhhjVhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj:ubh if the entry is not empty.}(h if the entry is not empty.hj:hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKPhjhhubh)}(hX7You can copy entries out of the XArray into a plain array by calling xa_extract(). Or you can iterate over the present entries in the XArray by calling xa_for_each(), xa_for_each_start() or xa_for_each_range(). You may prefer to use xa_find() or xa_find_after() to move to the next present entry in the XArray.h]hX7You can copy entries out of the XArray into a plain array by calling xa_extract(). Or you can iterate over the present entries in the XArray by calling xa_for_each(), xa_for_each_start() or xa_for_each_range(). You may prefer to use xa_find() or xa_find_after() to move to the next present entry in the XArray.}(hjqhjohhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKThjhhubh)}(hXCalling xa_store_range() stores the same entry in a range of indices. If you do this, some of the other operations will behave in a slightly odd way. For example, marking the entry at one index may result in the entry being marked at some, but not all of the other indices. Storing into one index may result in the entry retrieved by some, but not all of the other indices changing.h]hXCalling xa_store_range() stores the same entry in a range of indices. If you do this, some of the other operations will behave in a slightly odd way. For example, marking the entry at one index may result in the entry being marked at some, but not all of the other indices. Storing into one index may result in the entry retrieved by some, but not all of the other indices changing.}(hjhj}hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKZhjhhubh)}(hX2Sometimes you need to ensure that a subsequent call to xa_store() will not need to allocate memory. The xa_reserve() function will store a reserved entry at the indicated index. Users of the normal API will see this entry as containing ``NULL``. If you do not need to use the reserved entry, you can call xa_release() to remove the unused entry. If another user has stored to the entry in the meantime, xa_release() will do nothing; if instead you want the entry to become ``NULL``, you should use xa_erase(). Using xa_insert() on a reserved entry will fail.h](hSometimes you need to ensure that a subsequent call to xa_store() will not need to allocate memory. The xa_reserve() function will store a reserved entry at the indicated index. Users of the normal API will see this entry as containing }(hSometimes you need to ensure that a subsequent call to xa_store() will not need to allocate memory. The xa_reserve() function will store a reserved entry at the indicated index. Users of the normal API will see this entry as containing hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh. If you do not need to use the reserved entry, you can call xa_release() to remove the unused entry. If another user has stored to the entry in the meantime, xa_release() will do nothing; if instead you want the entry to become }(h. If you do not need to use the reserved entry, you can call xa_release() to remove the unused entry. If another user has stored to the entry in the meantime, xa_release() will do nothing; if instead you want the entry to become hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubhM, you should use xa_erase(). Using xa_insert() on a reserved entry will fail.}(hM, you should use xa_erase(). Using xa_insert() on a reserved entry will fail.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKahjhhubh)}(hWIf all entries in the array are ``NULL``, the xa_empty() function will return ``true``.h](h If all entries in the array are }(h If all entries in the array are hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh&, the xa_empty() function will return }(h&, the xa_empty() function will return hjhhhNhNubj4)}(h``true``h]htrue}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh.}(h.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKkhjhhubh)}(hFinally, you can remove all entries from an XArray by calling xa_destroy(). If the XArray entries are pointers, you may wish to free the entries first. You can do this by iterating over all present entries in the XArray using the xa_for_each() iterator.h]hFinally, you can remove all entries from an XArray by calling xa_destroy(). If the XArray entries are pointers, you may wish to free the entries first. You can do this by iterating over all present entries in the XArray using the xa_for_each() iterator.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKnhjhhubh)}(hhh](h)}(h Search Marksh]h Search Marks}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhhhhhKtubh)}(hEach entry in the array has three bits associated with it called marks. Each mark may be set or cleared independently of the others. You can iterate over marked entries by using the xa_for_each_marked() iterator.h]hEach entry in the array has three bits associated with it called marks. Each mark may be set or cleared independently of the others. You can iterate over marked entries by using the xa_for_each_marked() iterator.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKvhjhhubh)}(hXYou can enquire whether a mark is set on an entry by using xa_get_mark(). If the entry is not ``NULL``, you can set a mark on it by using xa_set_mark() and remove the mark from an entry by calling xa_clear_mark(). You can ask whether any entry in the XArray has a particular mark set by calling xa_marked(). Erasing an entry from the XArray causes all marks associated with that entry to be cleared.h](h_You can enquire whether a mark is set on an entry by using xa_get_mark(). If the entry is not }(h_You can enquire whether a mark is set on an entry by using xa_get_mark(). If the entry is not hj"hhhNhNubj4)}(h``NULL``h]hNULL}(hhhj+hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj"ubhX+, you can set a mark on it by using xa_set_mark() and remove the mark from an entry by calling xa_clear_mark(). You can ask whether any entry in the XArray has a particular mark set by calling xa_marked(). Erasing an entry from the XArray causes all marks associated with that entry to be cleared.}(hX+, you can set a mark on it by using xa_set_mark() and remove the mark from an entry by calling xa_clear_mark(). You can ask whether any entry in the XArray has a particular mark set by calling xa_marked(). Erasing an entry from the XArray causes all marks associated with that entry to be cleared.hj"hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKzhjhhubh)}(hSetting or clearing a mark on any index of a multi-index entry will affect all indices covered by that entry. Querying the mark on any index will return the same result.h]hSetting or clearing a mark on any index of a multi-index entry will affect all indices covered by that entry. Querying the mark on any index will return the same result.}(hjFhjDhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjhhubh)}(hXThere is no way to iterate over entries which are not marked; the data structure does not allow this to be implemented efficiently. There are not currently iterators to search for logical combinations of bits (eg iterate over all entries which have both ``XA_MARK_1`` and ``XA_MARK_2`` set, or iterate over all entries which have ``XA_MARK_0`` or ``XA_MARK_2`` set). It would be possible to add these if a user arises.h](hThere is no way to iterate over entries which are not marked; the data structure does not allow this to be implemented efficiently. There are not currently iterators to search for logical combinations of bits (eg iterate over all entries which have both }(hThere is no way to iterate over entries which are not marked; the data structure does not allow this to be implemented efficiently. There are not currently iterators to search for logical combinations of bits (eg iterate over all entries which have both hjRhhhNhNubj4)}(h ``XA_MARK_1``h]h XA_MARK_1}(hhhj[hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjRubh and }(h and hjRhhhNhNubj4)}(h ``XA_MARK_2``h]h XA_MARK_2}(hhhjnhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjRubh- set, or iterate over all entries which have }(h- set, or iterate over all entries which have hjRhhhNhNubj4)}(h ``XA_MARK_0``h]h XA_MARK_0}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjRubh or }(h or hjRhhhNhNubj4)}(h ``XA_MARK_2``h]h XA_MARK_2}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjRubh; set). It would be possible to add these if a user arises.}(h; set). It would be possible to add these if a user arises.hjRhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKhjhhubeh}(h] search-marksah ]h"] search marksah$]h&]uh1hhjhhhhhKtubh)}(hhh](h)}(hAllocating XArraysh]hAllocating XArrays}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhhhhhKubh)}(hIf you use DEFINE_XARRAY_ALLOC() to define the XArray, or initialise it by passing ``XA_FLAGS_ALLOC`` to xa_init_flags(), the XArray changes to track whether entries are in use or not.h](hSIf you use DEFINE_XARRAY_ALLOC() to define the XArray, or initialise it by passing }(hSIf you use DEFINE_XARRAY_ALLOC() to define the XArray, or initialise it by passing hjhhhNhNubj4)}(h``XA_FLAGS_ALLOC``h]hXA_FLAGS_ALLOC}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubhS to xa_init_flags(), the XArray changes to track whether entries are in use or not.}(hS to xa_init_flags(), the XArray changes to track whether entries are in use or not.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKhjhhubh)}(hYou can call xa_alloc() to store the entry at an unused index in the XArray. If you need to modify the array from interrupt context, you can use xa_alloc_bh() or xa_alloc_irq() to disable interrupts while allocating the ID.h]hYou can call xa_alloc() to store the entry at an unused index in the XArray. If you need to modify the array from interrupt context, you can use xa_alloc_bh() or xa_alloc_irq() to disable interrupts while allocating the ID.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjhhubh)}(hX$Using xa_store(), xa_cmpxchg() or xa_insert() will also mark the entry as being allocated. Unlike a normal XArray, storing ``NULL`` will mark the entry as being in use, like xa_reserve(). To free an entry, use xa_erase() (or xa_release() if you only want to free the entry if it's ``NULL``).h](h|Using xa_store(), xa_cmpxchg() or xa_insert() will also mark the entry as being allocated. Unlike a normal XArray, storing }(h|Using xa_store(), xa_cmpxchg() or xa_insert() will also mark the entry as being allocated. Unlike a normal XArray, storing hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh will mark the entry as being in use, like xa_reserve(). To free an entry, use xa_erase() (or xa_release() if you only want to free the entry if it’s }(h will mark the entry as being in use, like xa_reserve(). To free an entry, use xa_erase() (or xa_release() if you only want to free the entry if it's hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh).}(h).hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKhjhhubh)}(hX4By default, the lowest free entry is allocated starting from 0. If you want to allocate entries starting at 1, it is more efficient to use DEFINE_XARRAY_ALLOC1() or ``XA_FLAGS_ALLOC1``. If you want to allocate IDs up to a maximum, then wrap back around to the lowest free ID, you can use xa_alloc_cyclic().h](hBy default, the lowest free entry is allocated starting from 0. If you want to allocate entries starting at 1, it is more efficient to use DEFINE_XARRAY_ALLOC1() or }(hBy default, the lowest free entry is allocated starting from 0. If you want to allocate entries starting at 1, it is more efficient to use DEFINE_XARRAY_ALLOC1() or hj+hhhNhNubj4)}(h``XA_FLAGS_ALLOC1``h]hXA_FLAGS_ALLOC1}(hhhj4hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj+ubh{. If you want to allocate IDs up to a maximum, then wrap back around to the lowest free ID, you can use xa_alloc_cyclic().}(h{. If you want to allocate IDs up to a maximum, then wrap back around to the lowest free ID, you can use xa_alloc_cyclic().hj+hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKhjhhubh)}(hYou cannot use ``XA_MARK_0`` with an allocating XArray as this mark is used to track whether an entry is free or not. The other marks are available for your use.h](hYou cannot use }(hYou cannot use hjMhhhNhNubj4)}(h ``XA_MARK_0``h]h XA_MARK_0}(hhhjVhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjMubh with an allocating XArray as this mark is used to track whether an entry is free or not. The other marks are available for your use.}(h with an allocating XArray as this mark is used to track whether an entry is free or not. The other marks are available for your use.hjMhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhKhjhhubeh}(h]allocating-xarraysah ]h"]allocating xarraysah$]h&]uh1hhjhhhhhKubh)}(hhh](h)}(hMemory allocationh]hMemory allocation}(hj|hjzhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjwhhhhhKubh)}(hX The xa_store(), xa_cmpxchg(), xa_alloc(), xa_reserve() and xa_insert() functions take a gfp_t parameter in case the XArray needs to allocate memory to store this entry. If the entry is being deleted, no memory allocation needs to be performed, and the GFP flags specified will be ignored.h]hX The xa_store(), xa_cmpxchg(), xa_alloc(), xa_reserve() and xa_insert() functions take a gfp_t parameter in case the XArray needs to allocate memory to store this entry. If the entry is being deleted, no memory allocation needs to be performed, and the GFP flags specified will be ignored.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjwhhubh)}(hX4It is possible for no memory to be allocatable, particularly if you pass a restrictive set of GFP flags. In that case, the functions return a special value which can be turned into an errno using xa_err(). If you don't need to know exactly which error occurred, using xa_is_err() is slightly more efficient.h]hX6It is possible for no memory to be allocatable, particularly if you pass a restrictive set of GFP flags. In that case, the functions return a special value which can be turned into an errno using xa_err(). If you don’t need to know exactly which error occurred, using xa_is_err() is slightly more efficient.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjwhhubeh}(h]memory-allocationah ]h"]memory allocationah$]h&]uh1hhjhhhhhKubh)}(hhh](h)}(hLockingh]hLocking}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhhhhhKubh)}(hWhen using the Normal API, you do not have to worry about locking. The XArray uses RCU and an internal spinlock to synchronise access:h]hWhen using the Normal API, you do not have to worry about locking. The XArray uses RCU and an internal spinlock to synchronise access:}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjhhubhdefinition_list)}(hhh](hdefinition_list_item)}(h+No lock needed: * xa_empty() * xa_marked() h](hterm)}(hNo lock needed:h]hNo lock needed:}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jhhhKhjubh definition)}(hhh]h bullet_list)}(hhh](h list_item)}(h xa_empty()h]h)}(hjh]h xa_empty()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjubj)}(h xa_marked() h]h)}(h xa_marked()h]h xa_marked()}(hjhj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhj ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]bullet*uh1jhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhhhKhjubj)}(hTakes RCU read lock: * xa_load() * xa_for_each() * xa_for_each_start() * xa_for_each_range() * xa_find() * xa_find_after() * xa_extract() * xa_get_mark() h](j)}(hTakes RCU read lock:h]hTakes RCU read lock:}(hj;hj9hhhNhNubah}(h]h ]h"]h$]h&]uh1jhhhKhj5ubj)}(hhh]j)}(hhh](j)}(h xa_load()h]h)}(hjOh]h xa_load()}(hjOhjQhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjMubah}(h]h ]h"]h$]h&]uh1jhjJubj)}(h xa_for_each()h]h)}(hjfh]h xa_for_each()}(hjfhjhhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjdubah}(h]h ]h"]h$]h&]uh1jhjJubj)}(hxa_for_each_start()h]h)}(hj}h]hxa_for_each_start()}(hj}hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhj{ubah}(h]h ]h"]h$]h&]uh1jhjJubj)}(hxa_for_each_range()h]h)}(hjh]hxa_for_each_range()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjJubj)}(h xa_find()h]h)}(hjh]h xa_find()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjJubj)}(hxa_find_after()h]h)}(hjh]hxa_find_after()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjJubj)}(h xa_extract()h]h)}(hjh]h xa_extract()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjJubj)}(hxa_get_mark() h]h)}(h xa_get_mark()h]h xa_get_mark()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjJubeh}(h]h ]h"]h$]h&]j'j(uh1jhhhKhjGubah}(h]h ]h"]h$]h&]uh1jhj5ubeh}(h]h ]h"]h$]h&]uh1jhhhKhjhhubj)}(hXTakes xa_lock internally: * xa_store() * xa_store_bh() * xa_store_irq() * xa_insert() * xa_insert_bh() * xa_insert_irq() * xa_erase() * xa_erase_bh() * xa_erase_irq() * xa_cmpxchg() * xa_cmpxchg_bh() * xa_cmpxchg_irq() * xa_store_range() * xa_alloc() * xa_alloc_bh() * xa_alloc_irq() * xa_reserve() * xa_reserve_bh() * xa_reserve_irq() * xa_destroy() * xa_set_mark() * xa_clear_mark() h](j)}(hTakes xa_lock internally:h]hTakes xa_lock internally:}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jhhhKhjubj)}(hhh]j)}(hhh](j)}(h xa_store()h]h)}(hj2h]h xa_store()}(hj2hj4hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhj0ubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_store_bh()h]h)}(hjIh]h xa_store_bh()}(hjIhjKhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjGubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_store_irq()h]h)}(hj`h]hxa_store_irq()}(hj`hjbhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhj^ubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_insert()h]h)}(hjwh]h xa_insert()}(hjwhjyhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjuubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_insert_bh()h]h)}(hjh]hxa_insert_bh()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_insert_irq()h]h)}(hjh]hxa_insert_irq()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_erase()h]h)}(hjh]h xa_erase()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_erase_bh()h]h)}(hjh]h xa_erase_bh()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_erase_irq()h]h)}(hjh]hxa_erase_irq()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_cmpxchg()h]h)}(hjh]h xa_cmpxchg()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_cmpxchg_bh()h]h)}(hjh]hxa_cmpxchg_bh()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_cmpxchg_irq()h]h)}(hj/h]hxa_cmpxchg_irq()}(hj/hj1hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhj-ubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_store_range()h]h)}(hjFh]hxa_store_range()}(hjFhjHhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjDubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_alloc()h]h)}(hj]h]h xa_alloc()}(hj]hj_hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhj[ubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_alloc_bh()h]h)}(hjth]h xa_alloc_bh()}(hjthjvhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjrubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_alloc_irq()h]h)}(hjh]hxa_alloc_irq()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_reserve()h]h)}(hjh]h xa_reserve()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_reserve_bh()h]h)}(hjh]hxa_reserve_bh()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_reserve_irq()h]h)}(hjh]hxa_reserve_irq()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_destroy()h]h)}(hjh]h xa_destroy()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(h xa_set_mark()h]h)}(hjh]h xa_set_mark()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubj)}(hxa_clear_mark() h]h)}(hxa_clear_mark()h]hxa_clear_mark()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhj-ubeh}(h]h ]h"]h$]h&]j'j(uh1jhhhKhj*ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhhhKhjhhubj)}(hAssumes xa_lock held on entry: * __xa_store() * __xa_insert() * __xa_erase() * __xa_cmpxchg() * __xa_alloc() * __xa_set_mark() * __xa_clear_mark() h](j)}(hAssumes xa_lock held on entry:h]hAssumes xa_lock held on entry:}(hjChjAhhhNhNubah}(h]h ]h"]h$]h&]uh1jhhhKhj=ubj)}(hhh]j)}(hhh](j)}(h __xa_store()h]h)}(hjWh]h __xa_store()}(hjWhjYhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjUubah}(h]h ]h"]h$]h&]uh1jhjRubj)}(h __xa_insert()h]h)}(hjnh]h __xa_insert()}(hjnhjphhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjlubah}(h]h ]h"]h$]h&]uh1jhjRubj)}(h __xa_erase()h]h)}(hjh]h __xa_erase()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjRubj)}(h__xa_cmpxchg()h]h)}(hjh]h__xa_cmpxchg()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjRubj)}(h __xa_alloc()h]h)}(hjh]h __xa_alloc()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjRubj)}(h__xa_set_mark()h]h)}(hjh]h__xa_set_mark()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjRubj)}(h__xa_clear_mark() h]h)}(h__xa_clear_mark()h]h__xa_clear_mark()}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjRubeh}(h]h ]h"]h$]h&]j'j(uh1jhhhKhjOubah}(h]h ]h"]h$]h&]uh1jhj=ubeh}(h]h ]h"]h$]h&]uh1jhhhKhjhhubeh}(h]h ]h"]h$]h&]uh1jhjhhhNhNubh)}(hXIf you want to take advantage of the lock to protect the data structures that you are storing in the XArray, you can call xa_lock() before calling xa_load(), then take a reference count on the object you have found before calling xa_unlock(). This will prevent stores from removing the object from the array between looking up the object and incrementing the refcount. You can also use RCU to avoid dereferencing freed memory, but an explanation of that is beyond the scope of this document.h]hXIf you want to take advantage of the lock to protect the data structures that you are storing in the XArray, you can call xa_lock() before calling xa_load(), then take a reference count on the object you have found before calling xa_unlock(). This will prevent stores from removing the object from the array between looking up the object and incrementing the refcount. You can also use RCU to avoid dereferencing freed memory, but an explanation of that is beyond the scope of this document.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjhhubh)}(hThe XArray does not disable interrupts or softirqs while modifying the array. It is safe to read the XArray from interrupt or softirq context as the RCU lock provides enough protection.h]hThe XArray does not disable interrupts or softirqs while modifying the array. It is safe to read the XArray from interrupt or softirq context as the RCU lock provides enough protection.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjhhubh)}(hIf, for example, you want to store entries in the XArray in process context and then erase them in softirq context, you can do that this way::h]hIf, for example, you want to store entries in the XArray in process context and then erase them in softirq context, you can do that this way:}(hIf, for example, you want to store entries in the XArray in process context and then erase them in softirq context, you can do that this way:hj+ hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjhhubh literal_block)}(hX9void foo_init(struct foo *foo) { xa_init_flags(&foo->array, XA_FLAGS_LOCK_BH); } int foo_store(struct foo *foo, unsigned long index, void *entry) { int err; xa_lock_bh(&foo->array); err = xa_err(__xa_store(&foo->array, index, entry, GFP_KERNEL)); if (!err) foo->count++; xa_unlock_bh(&foo->array); return err; } /* foo_erase() is only called from softirq context */ void foo_erase(struct foo *foo, unsigned long index) { xa_lock(&foo->array); __xa_erase(&foo->array, index); foo->count--; xa_unlock(&foo->array); }h]hX9void foo_init(struct foo *foo) { xa_init_flags(&foo->array, XA_FLAGS_LOCK_BH); } int foo_store(struct foo *foo, unsigned long index, void *entry) { int err; xa_lock_bh(&foo->array); err = xa_err(__xa_store(&foo->array, index, entry, GFP_KERNEL)); if (!err) foo->count++; xa_unlock_bh(&foo->array); return err; } /* foo_erase() is only called from softirq context */ void foo_erase(struct foo *foo, unsigned long index) { xa_lock(&foo->array); __xa_erase(&foo->array, index); foo->count--; xa_unlock(&foo->array); }}(hhhj< ubah}(h]h ]h"]h$]h&]hhuh1j: hhhKhjhhubh)}(hIf you are going to modify the XArray from interrupt or softirq context, you need to initialise the array using xa_init_flags(), passing ``XA_FLAGS_LOCK_IRQ`` or ``XA_FLAGS_LOCK_BH``.h](hIf you are going to modify the XArray from interrupt or softirq context, you need to initialise the array using xa_init_flags(), passing }(hIf you are going to modify the XArray from interrupt or softirq context, you need to initialise the array using xa_init_flags(), passing hjJ hhhNhNubj4)}(h``XA_FLAGS_LOCK_IRQ``h]hXA_FLAGS_LOCK_IRQ}(hhhjS hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjJ ubh or }(h or hjJ hhhNhNubj4)}(h``XA_FLAGS_LOCK_BH``h]hXA_FLAGS_LOCK_BH}(hhhjf hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjJ ubh.}(hjhjJ hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhMhjhhubh)}(hThe above example also shows a common pattern of wanting to extend the coverage of the xa_lock on the store side to protect some statistics associated with the array.h]hThe above example also shows a common pattern of wanting to extend the coverage of the xa_lock on the store side to protect some statistics associated with the array.}(hj hj~ hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhjhhubh)}(hX}Sharing the XArray with interrupt context is also possible, either using xa_lock_irqsave() in both the interrupt handler and process context, or xa_lock_irq() in process context and xa_lock() in the interrupt handler. Some of the more common patterns have helper functions such as xa_store_bh(), xa_store_irq(), xa_erase_bh(), xa_erase_irq(), xa_cmpxchg_bh() and xa_cmpxchg_irq().h]hX}Sharing the XArray with interrupt context is also possible, either using xa_lock_irqsave() in both the interrupt handler and process context, or xa_lock_irq() in process context and xa_lock() in the interrupt handler. Some of the more common patterns have helper functions such as xa_store_bh(), xa_store_irq(), xa_erase_bh(), xa_erase_irq(), xa_cmpxchg_bh() and xa_cmpxchg_irq().}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhjhhubh)}(hX<Sometimes you need to protect access to the XArray with a mutex because that lock sits above another mutex in the locking hierarchy. That does not entitle you to use functions like __xa_erase() without taking the xa_lock; the xa_lock is used for lockdep validation and will be used for other purposes in the future.h]hX<Sometimes you need to protect access to the XArray with a mutex because that lock sits above another mutex in the locking hierarchy. That does not entitle you to use functions like __xa_erase() without taking the xa_lock; the xa_lock is used for lockdep validation and will be used for other purposes in the future.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhM&hjhhubh)}(hX The __xa_set_mark() and __xa_clear_mark() functions are also available for situations where you look up an entry and want to atomically set or clear a mark. It may be more efficient to use the advanced API in this case, as it will save you from walking the tree twice.h]hX The __xa_set_mark() and __xa_clear_mark() functions are also available for situations where you look up an entry and want to atomically set or clear a mark. It may be more efficient to use the advanced API in this case, as it will save you from walking the tree twice.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhM,hjhhubeh}(h]lockingah ]h"]lockingah$]h&]uh1hhjhhhhhKubeh}(h] normal-apiah ]h"] normal apiah$]h&]uh1hhhhhhhhK;ubh)}(hhh](h)}(h Advanced APIh]h Advanced API}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hhhhhM2ubh)}(hX=The advanced API offers more flexibility and better performance at the cost of an interface which can be harder to use and has fewer safeguards. No locking is done for you by the advanced API, and you are required to use the xa_lock while modifying the array. You can choose whether to use the xa_lock or the RCU lock while doing read-only operations on the array. You can mix advanced and normal operations on the same array; indeed the normal API is implemented in terms of the advanced API. The advanced API is only available to modules with a GPL-compatible license.h]hX=The advanced API offers more flexibility and better performance at the cost of an interface which can be harder to use and has fewer safeguards. No locking is done for you by the advanced API, and you are required to use the xa_lock while modifying the array. You can choose whether to use the xa_lock or the RCU lock while doing read-only operations on the array. You can mix advanced and normal operations on the same array; indeed the normal API is implemented in terms of the advanced API. The advanced API is only available to modules with a GPL-compatible license.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhM4hj hhubh)}(hXThe advanced API is based around the xa_state. This is an opaque data structure which you declare on the stack using the XA_STATE() macro. This macro initialises the xa_state ready to start walking around the XArray. It is used as a cursor to maintain the position in the XArray and let you compose various operations together without having to restart from the top every time. The contents of the xa_state are protected by the rcu_read_lock() or the xas_lock(). If you need to drop whichever of those locks is protecting your state and tree, you must call xas_pause() so that future calls do not rely on the parts of the state which were left unprotected.h]hXThe advanced API is based around the xa_state. This is an opaque data structure which you declare on the stack using the XA_STATE() macro. This macro initialises the xa_state ready to start walking around the XArray. It is used as a cursor to maintain the position in the XArray and let you compose various operations together without having to restart from the top every time. The contents of the xa_state are protected by the rcu_read_lock() or the xas_lock(). If you need to drop whichever of those locks is protecting your state and tree, you must call xas_pause() so that future calls do not rely on the parts of the state which were left unprotected.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhM=hj hhubh)}(hXThe xa_state is also used to store errors. You can call xas_error() to retrieve the error. All operations check whether the xa_state is in an error state before proceeding, so there's no need for you to check for an error after each call; you can make multiple calls in succession and only check at a convenient point. The only errors currently generated by the XArray code itself are ``ENOMEM`` and ``EINVAL``, but it supports arbitrary errors in case you want to call xas_set_err() yourself.h](hXThe xa_state is also used to store errors. You can call xas_error() to retrieve the error. All operations check whether the xa_state is in an error state before proceeding, so there’s no need for you to check for an error after each call; you can make multiple calls in succession and only check at a convenient point. The only errors currently generated by the XArray code itself are }(hXThe xa_state is also used to store errors. You can call xas_error() to retrieve the error. All operations check whether the xa_state is in an error state before proceeding, so there's no need for you to check for an error after each call; you can make multiple calls in succession and only check at a convenient point. The only errors currently generated by the XArray code itself are hj hhhNhNubj4)}(h ``ENOMEM``h]hENOMEM}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubh and }(h and hj hhhNhNubj4)}(h ``EINVAL``h]hEINVAL}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubhS, but it supports arbitrary errors in case you want to call xas_set_err() yourself.}(hS, but it supports arbitrary errors in case you want to call xas_set_err() yourself.hj hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhMHhj hhubh)}(hXIf the xa_state is holding an ``ENOMEM`` error, calling xas_nomem() will attempt to allocate more memory using the specified gfp flags and cache it in the xa_state for the next attempt. The idea is that you take the xa_lock, attempt the operation and drop the lock. The operation attempts to allocate memory while holding the lock, but it is more likely to fail. Once you have dropped the lock, xas_nomem() can try harder to allocate more memory. It will return ``true`` if it is worth retrying the operation (i.e. that there was a memory error *and* more memory was allocated). If it has previously allocated memory, and that memory wasn't used, and there is no error (or some error that isn't ``ENOMEM``), then it will free the memory previously allocated.h](hIf the xa_state is holding an }(hIf the xa_state is holding an hj( hhhNhNubj4)}(h ``ENOMEM``h]hENOMEM}(hhhj1 hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj( ubhX error, calling xas_nomem() will attempt to allocate more memory using the specified gfp flags and cache it in the xa_state for the next attempt. The idea is that you take the xa_lock, attempt the operation and drop the lock. The operation attempts to allocate memory while holding the lock, but it is more likely to fail. Once you have dropped the lock, xas_nomem() can try harder to allocate more memory. It will return }(hX error, calling xas_nomem() will attempt to allocate more memory using the specified gfp flags and cache it in the xa_state for the next attempt. The idea is that you take the xa_lock, attempt the operation and drop the lock. The operation attempts to allocate memory while holding the lock, but it is more likely to fail. Once you have dropped the lock, xas_nomem() can try harder to allocate more memory. It will return hj( hhhNhNubj4)}(h``true``h]htrue}(hhhjD hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj( ubhK if it is worth retrying the operation (i.e. that there was a memory error }(hK if it is worth retrying the operation (i.e. that there was a memory error hj( hhhNhNubhemphasis)}(h*and*h]hand}(hhhjY hhhNhNubah}(h]h ]h"]h$]h&]uh1jW hj( ubh more memory was allocated). If it has previously allocated memory, and that memory wasn’t used, and there is no error (or some error that isn’t }(h more memory was allocated). If it has previously allocated memory, and that memory wasn't used, and there is no error (or some error that isn't hj( hhhNhNubj4)}(h ``ENOMEM``h]hENOMEM}(hhhjl hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj( ubh5), then it will free the memory previously allocated.}(h5), then it will free the memory previously allocated.hj( hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhMQhj hhubh)}(hhh](h)}(hInternal Entriesh]hInternal Entries}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hhhhhM^ubh)}(hXThe XArray reserves some entries for its own purposes. These are never exposed through the normal API, but when using the advanced API, it's possible to see them. Usually the best way to handle them is to pass them to xas_retry(), and retry the operation if it returns ``true``.h](hXThe XArray reserves some entries for its own purposes. These are never exposed through the normal API, but when using the advanced API, it’s possible to see them. Usually the best way to handle them is to pass them to xas_retry(), and retry the operation if it returns }(hXThe XArray reserves some entries for its own purposes. These are never exposed through the normal API, but when using the advanced API, it's possible to see them. Usually the best way to handle them is to pass them to xas_retry(), and retry the operation if it returns hj hhhNhNubj4)}(h``true``h]htrue}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubh.}(hjhj hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhM`hj hhubhtable)}(hhh]htgroup)}(hhh](hcolspec)}(hhh]h}(h]h ]h"]h$]h&]colwidthKuh1j hj ubj )}(hhh]h}(h]h ]h"]h$]h&]colwidthKuh1j hj ubj )}(hhh]h}(h]h ]h"]h$]h&]colwidthKuh1j hj ubhtbody)}(hhh](hrow)}(hhh](hentry)}(hhh]h)}(hNameh]hName}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhhj ubah}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh]h)}(hTesth]hTest}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMihj ubah}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh]h)}(hUsageh]hUsage}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMjhj ubah}(h]h ]h"]h$]h&]uh1j hj ubeh}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh](j )}(hhh]h)}(hNodeh]hNode}(hj@ hj> hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMlhj; ubah}(h]h ]h"]h$]h&]uh1j hj8 ubj )}(hhh]h)}(h xa_is_node()h]h xa_is_node()}(hjW hjU hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMmhjR ubah}(h]h ]h"]h$]h&]uh1j hj8 ubj )}(hhh]h)}(hBAn XArray node. May be visible when using a multi-index xa_state.h]hBAn XArray node. May be visible when using a multi-index xa_state.}(hjn hjl hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMnhji ubah}(h]h ]h"]h$]h&]uh1j hj8 ubeh}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh](j )}(hhh]h)}(hSiblingh]hSibling}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMphj ubah}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh]h)}(hxa_is_sibling()h]hxa_is_sibling()}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMqhj ubah}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh]h)}(htA non-canonical entry for a multi-index entry. The value indicates which slot in this node has the canonical entry.h]htA non-canonical entry for a multi-index entry. The value indicates which slot in this node has the canonical entry.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMrhj ubah}(h]h ]h"]h$]h&]uh1j hj ubeh}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh](j )}(hhh]h)}(hRetryh]hRetry}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMuhj ubah}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh]h)}(h xa_is_retry()h]h xa_is_retry()}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMvhj ubah}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh]h)}(hThis entry is currently being modified by a thread which has the xa_lock. The node containing this entry may be freed at the end of this RCU period. You should restart the lookup from the head of the array.h]hThis entry is currently being modified by a thread which has the xa_lock. The node containing this entry may be freed at the end of this RCU period. You should restart the lookup from the head of the array.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMwhj ubah}(h]h ]h"]h$]h&]uh1j hj ubeh}(h]h ]h"]h$]h&]uh1j hj ubj )}(hhh](j )}(hhh]h)}(hZeroh]hZero}(hj* hj( hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhM|hj% ubah}(h]h ]h"]h$]h&]uh1j hj" ubj )}(hhh]h)}(h xa_is_zero()h]h xa_is_zero()}(hjA hj? hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhM}hj< ubah}(h]h ]h"]h$]h&]uh1j hj" ubj )}(hhh]h)}(hZero entries appear as ``NULL`` through the Normal API, but occupy an entry in the XArray which can be used to reserve the index for future use. This is used by allocating XArrays for allocated entries which are ``NULL``.h](hZero entries appear as }(hZero entries appear as hjV hhhNhNubj4)}(h``NULL``h]hNULL}(hhhj_ hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjV ubh through the Normal API, but occupy an entry in the XArray which can be used to reserve the index for future use. This is used by allocating XArrays for allocated entries which are }(h through the Normal API, but occupy an entry in the XArray which can be used to reserve the index for future use. This is used by allocating XArrays for allocated entries which are hjV hhhNhNubj4)}(h``NULL``h]hNULL}(hhhjr hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjV ubh.}(hjhjV hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhM~hjS ubah}(h]h ]h"]h$]h&]uh1j hj" ubeh}(h]h ]h"]h$]h&]uh1j hj ubeh}(h]h ]h"]h$]h&]uh1j hj ubeh}(h]h ]h"]h$]h&]colsKuh1j hj ubah}(h]h ]h"]h$]h&]uh1j hj hhhNhNubh)}(hlOther internal entries may be added in the future. As far as possible, they will be handled by xas_retry().h]hlOther internal entries may be added in the future. As far as possible, they will be handled by xas_retry().}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj hhubeh}(h]internal-entriesah ]h"]internal entriesah$]h&]uh1hhj hhhhhM^ubh)}(hhh](h)}(hAdditional functionalityh]hAdditional functionality}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hhhhhMubh)}(hThe xas_create_range() function allocates all the necessary memory to store every entry in a range. It will set ENOMEM in the xa_state if it cannot allocate memory.h]hThe xas_create_range() function allocates all the necessary memory to store every entry in a range. It will set ENOMEM in the xa_state if it cannot allocate memory.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj hhubh)}(hXYou can use xas_init_marks() to reset the marks on an entry to their default state. This is usually all marks clear, unless the XArray is marked with ``XA_FLAGS_TRACK_FREE``, in which case mark 0 is set and all other marks are clear. Replacing one entry with another using xas_store() will not reset the marks on that entry; if you want the marks reset, you should do that explicitly.h](hYou can use xas_init_marks() to reset the marks on an entry to their default state. This is usually all marks clear, unless the XArray is marked with }(hYou can use xas_init_marks() to reset the marks on an entry to their default state. This is usually all marks clear, unless the XArray is marked with hj hhhNhNubj4)}(h``XA_FLAGS_TRACK_FREE``h]hXA_FLAGS_TRACK_FREE}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubh, in which case mark 0 is set and all other marks are clear. Replacing one entry with another using xas_store() will not reset the marks on that entry; if you want the marks reset, you should do that explicitly.}(h, in which case mark 0 is set and all other marks are clear. Replacing one entry with another using xas_store() will not reset the marks on that entry; if you want the marks reset, you should do that explicitly.hj hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhMhj hhubh)}(hThe xas_load() will walk the xa_state as close to the entry as it can. If you know the xa_state has already been walked to the entry and need to check that the entry hasn't changed, you can use xas_reload() to save a function call.h]hThe xas_load() will walk the xa_state as close to the entry as it can. If you know the xa_state has already been walked to the entry and need to check that the entry hasn’t changed, you can use xas_reload() to save a function call.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj hhubh)}(hXIf you need to move to a different index in the XArray, call xas_set(). This resets the cursor to the top of the tree, which will generally make the next operation walk the cursor to the desired spot in the tree. If you want to move to the next or previous index, call xas_next() or xas_prev(). Setting the index does not walk the cursor around the array so does not require a lock to be held, while moving to the next or previous index does.h]hXIf you need to move to a different index in the XArray, call xas_set(). This resets the cursor to the top of the tree, which will generally make the next operation walk the cursor to the desired spot in the tree. If you want to move to the next or previous index, call xas_next() or xas_prev(). Setting the index does not walk the cursor around the array so does not require a lock to be held, while moving to the next or previous index does.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj hhubh)}(hXYou can search for the next present entry using xas_find(). This is the equivalent of both xa_find() and xa_find_after(); if the cursor has been walked to an entry, then it will find the next entry after the one currently referenced. If not, it will return the entry at the index of the xa_state. Using xas_next_entry() to move to the next present entry instead of xas_find() will save a function call in the majority of cases at the expense of emitting more inline code.h]hXYou can search for the next present entry using xas_find(). This is the equivalent of both xa_find() and xa_find_after(); if the cursor has been walked to an entry, then it will find the next entry after the one currently referenced. If not, it will return the entry at the index of the xa_state. Using xas_next_entry() to move to the next present entry instead of xas_find() will save a function call in the majority of cases at the expense of emitting more inline code.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj hhubh)}(hX=The xas_find_marked() function is similar. If the xa_state has not been walked, it will return the entry at the index of the xa_state, if it is marked. Otherwise, it will return the first marked entry after the entry referenced by the xa_state. The xas_next_marked() function is the equivalent of xas_next_entry().h]hX=The xas_find_marked() function is similar. If the xa_state has not been walked, it will return the entry at the index of the xa_state, if it is marked. Otherwise, it will return the first marked entry after the entry referenced by the xa_state. The xas_next_marked() function is the equivalent of xas_next_entry().}(hj, hj* hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj hhubh)}(hXWhen iterating over a range of the XArray using xas_for_each() or xas_for_each_marked(), it may be necessary to temporarily stop the iteration. The xas_pause() function exists for this purpose. After you have done the necessary work and wish to resume, the xa_state is in an appropriate state to continue the iteration after the entry you last processed. If you have interrupts disabled while iterating, then it is good manners to pause the iteration and reenable interrupts every ``XA_CHECK_SCHED`` entries.h](hXWhen iterating over a range of the XArray using xas_for_each() or xas_for_each_marked(), it may be necessary to temporarily stop the iteration. The xas_pause() function exists for this purpose. After you have done the necessary work and wish to resume, the xa_state is in an appropriate state to continue the iteration after the entry you last processed. If you have interrupts disabled while iterating, then it is good manners to pause the iteration and reenable interrupts every }(hXWhen iterating over a range of the XArray using xas_for_each() or xas_for_each_marked(), it may be necessary to temporarily stop the iteration. The xas_pause() function exists for this purpose. After you have done the necessary work and wish to resume, the xa_state is in an appropriate state to continue the iteration after the entry you last processed. If you have interrupts disabled while iterating, then it is good manners to pause the iteration and reenable interrupts every hj8 hhhNhNubj4)}(h``XA_CHECK_SCHED``h]hXA_CHECK_SCHED}(hhhjA hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj8 ubh entries.}(h entries.hj8 hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhMhj hhubh)}(hThe xas_get_mark(), xas_set_mark() and xas_clear_mark() functions require the xa_state cursor to have been moved to the appropriate location in the XArray; they will do nothing if you have called xas_pause() or xas_set() immediately before.h]hThe xas_get_mark(), xas_set_mark() and xas_clear_mark() functions require the xa_state cursor to have been moved to the appropriate location in the XArray; they will do nothing if you have called xas_pause() or xas_set() immediately before.}(hj\ hjZ hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj hhubh)}(hYou can call xas_set_update() to have a callback function called each time the XArray updates a node. This is used by the page cache workingset code to maintain its list of nodes which contain only shadow entries.h]hYou can call xas_set_update() to have a callback function called each time the XArray updates a node. This is used by the page cache workingset code to maintain its list of nodes which contain only shadow entries.}(hjj hjh hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj hhubeh}(h]additional-functionalityah ]h"]additional functionalityah$]h&]uh1hhj hhhhhMubh)}(hhh](h)}(hMulti-Index Entriesh]hMulti-Index Entries}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj~ hhhhhMubh)}(hXAThe XArray has the ability to tie multiple indices together so that operations on one index affect all indices. For example, storing into any index will change the value of the entry retrieved from any index. Setting or clearing a mark on any index will set or clear the mark on every index that is tied together. The current implementation only allows tying ranges which are aligned powers of two together; eg indices 64-127 may be tied together, but 2-6 may not be. This may save substantial quantities of memory; for example tying 512 entries together will save over 4kB.h]hXAThe XArray has the ability to tie multiple indices together so that operations on one index affect all indices. For example, storing into any index will change the value of the entry retrieved from any index. Setting or clearing a mark on any index will set or clear the mark on every index that is tied together. The current implementation only allows tying ranges which are aligned powers of two together; eg indices 64-127 may be tied together, but 2-6 may not be. This may save substantial quantities of memory; for example tying 512 entries together will save over 4kB.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj~ hhubh)}(hXLYou can create a multi-index entry by using XA_STATE_ORDER() or xas_set_order() followed by a call to xas_store(). Calling xas_load() with a multi-index xa_state will walk the xa_state to the right location in the tree, but the return value is not meaningful, potentially being an internal entry or ``NULL`` even when there is an entry stored within the range. Calling xas_find_conflict() will return the first entry within the range or ``NULL`` if there are no entries in the range. The xas_for_each_conflict() iterator will iterate over every entry which overlaps the specified range.h](hX+You can create a multi-index entry by using XA_STATE_ORDER() or xas_set_order() followed by a call to xas_store(). Calling xas_load() with a multi-index xa_state will walk the xa_state to the right location in the tree, but the return value is not meaningful, potentially being an internal entry or }(hX+You can create a multi-index entry by using XA_STATE_ORDER() or xas_set_order() followed by a call to xas_store(). Calling xas_load() with a multi-index xa_state will walk the xa_state to the right location in the tree, but the return value is not meaningful, potentially being an internal entry or hj hhhNhNubj4)}(h``NULL``h]hNULL}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubh even when there is an entry stored within the range. Calling xas_find_conflict() will return the first entry within the range or }(h even when there is an entry stored within the range. Calling xas_find_conflict() will return the first entry within the range or hj hhhNhNubj4)}(h``NULL``h]hNULL}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubh if there are no entries in the range. The xas_for_each_conflict() iterator will iterate over every entry which overlaps the specified range.}(h if there are no entries in the range. The xas_for_each_conflict() iterator will iterate over every entry which overlaps the specified range.hj hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhMhj~ hhubh)}(hXIf xas_load() encounters a multi-index entry, the xa_index in the xa_state will not be changed. When iterating over an XArray or calling xas_find(), if the initial index is in the middle of a multi-index entry, it will not be altered. Subsequent calls or iterations will move the index to the first index in the range. Each entry will only be returned once, no matter how many indices it occupies.h]hXIf xas_load() encounters a multi-index entry, the xa_index in the xa_state will not be changed. When iterating over an XArray or calling xas_find(), if the initial index is in the middle of a multi-index entry, it will not be altered. Subsequent calls or iterations will move the index to the first index in the range. Each entry will only be returned once, no matter how many indices it occupies.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj~ hhubh)}(hUsing xas_next() or xas_prev() with a multi-index xa_state is not supported. Using either of these functions on a multi-index entry will reveal sibling entries; these should be skipped over by the caller.h]hUsing xas_next() or xas_prev() with a multi-index xa_state is not supported. Using either of these functions on a multi-index entry will reveal sibling entries; these should be skipped over by the caller.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhMhj~ hhubh)}(hX.Storing ``NULL`` into any index of a multi-index entry will set the entry at every index to ``NULL`` and dissolve the tie. A multi-index entry can be split into entries occupying smaller ranges by calling xas_split_alloc() without the xa_lock held, followed by taking the lock and calling xas_split().h](hStoring }(hStoring hj hhhNhNubj4)}(h``NULL``h]hNULL}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubhL into any index of a multi-index entry will set the entry at every index to }(hL into any index of a multi-index entry will set the entry at every index to hj hhhNhNubj4)}(h``NULL``h]hNULL}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubh and dissolve the tie. A multi-index entry can be split into entries occupying smaller ranges by calling xas_split_alloc() without the xa_lock held, followed by taking the lock and calling xas_split().}(h and dissolve the tie. A multi-index entry can be split into entries occupying smaller ranges by calling xas_split_alloc() without the xa_lock held, followed by taking the lock and calling xas_split().hj hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhhhMhj~ hhubeh}(h]multi-index-entriesah ]h"]multi-index entriesah$]h&]uh1hhj hhhhhMubeh}(h] advanced-apiah ]h"] advanced apiah$]h&]uh1hhhhhhhhM2ubh)}(hhh](h)}(hFunctions and structuresh]hFunctions and structures}(hj8hj6hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj3hhhhhMubhindex)}(hhh]h}(h]h ]h"]h$]h&]entries](singlexa_mk_value (C function) c.xa_mk_valuehNtauh1jDhj3hhhNhNubhdesc)}(hhh](hdesc_signature)}(h$void * xa_mk_value (unsigned long v)h]hdesc_signature_line)}(h"void *xa_mk_value(unsigned long v)h](hdesc_sig_keyword_type)}(hvoidh]hvoid}(hhhjhhhhNhNubah}(h]h ]ktah"]h$]h&]uh1jfhjbhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK5ubhdesc_sig_space)}(h h]h }(hhhjzhhhNhNubah}(h]h ]wah"]h$]h&]uh1jxhjbhhhjwhK5ubhdesc_sig_punctuation)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]pah"]h$]h&]uh1jhjbhhhjwhK5ubh desc_name)}(h xa_mk_valueh]h desc_sig_name)}(h xa_mk_valueh]h xa_mk_value}(hhhjhhhNhNubah}(h]h ]nah"]h$]h&]uh1jhjubah}(h]h ](sig-namedescnameeh"]h$]h&]hhuh1jhjbhhhjwhK5ubhdesc_parameterlist)}(h(unsigned long v)h]hdesc_parameter)}(hunsigned long vh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hvh]hv}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjbhhhjwhK5ubeh}(h]h ]h"]h$]h&]hh add_permalinkuh1j`sphinx_line_type declaratorhj\hhhjwhK5ubah}(h]jSah ](sig sig-objecteh"]h$]h&] is_multilineuh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK:hjWhhubh desc_content)}(hhh]h)}(h'Create an XArray entry from an integer.h]h'Create an XArray entry from an integer.}(hj1hj/hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK4hj,hhubah}(h]h ]h"]h$]h&]uh1j*hjWhhhjwhK5ubeh}(h]h ](cfunctioneh"]h$]h&]domainjGobjtypejHdesctypejHnoindexuh1jUhhhj3hNhNubh container)}(h**Parameters** ``unsigned long v`` Value to store in XArray. **Context** Any context. **Return** An entry suitable for storing in the XArray.h](h)}(h**Parameters**h]hstrong)}(hjXh]h Parameters}(hhhj\hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjVubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK8hjRubj)}(hhh]j)}(h.``unsigned long v`` Value to store in XArray. h](j)}(h``unsigned long v``h]j4)}(hjyh]hunsigned long v}(hhhj{hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjwubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK5hjsubj)}(hhh]h)}(hValue to store in XArray.h]hValue to store in XArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhK5hjubah}(h]h ]h"]h$]h&]uh1jhjsubeh}(h]h ]h"]h$]h&]uh1jhjhK5hjpubah}(h]h ]h"]h$]h&]uh1jhjRubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK7hjRubh)}(h Any context.h]h Any context.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK7hjRubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK9hjRubh)}(h,An entry suitable for storing in the XArray.h]h,An entry suitable for storing in the XArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK8hjRubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_to_value (C function) c.xa_to_valuehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h-unsigned long xa_to_value (const void *entry)h]ja)}(h,unsigned long xa_to_value(const void *entry)h](jg)}(hunsignedh]hunsigned}(hhhj hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKBubjy)}(h h]h }(hhhj/hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhj.hKBubjg)}(hlongh]hlong}(hhhj=hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhj.hKBubjy)}(h h]h }(hhhjKhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhj.hKBubj)}(h xa_to_valueh]j)}(h xa_to_valueh]h xa_to_value}(hhhj]hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjYubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhj.hKBubj)}(h(const void *entry)h]j)}(hconst void *entryh](hdesc_sig_keyword)}(hconsth]hconst}(hhhj{hhhNhNubah}(h]h ]kah"]h$]h&]uh1jyhjuubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjuubjg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjuubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjuubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjuubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjuubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjqubah}(h]h ]h"]h$]h&]hhuh1jhjhhhj.hKBubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhj.hKBubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKGhjhhubj+)}(hhh]h)}(h$Get value stored in an XArray entry.h]h$Get value stored in an XArray entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKAhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhj.hKBubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const void *entry`` XArray entry. **Context** Any context. **Return** The value stored in the XArray entry.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKEhjubj)}(hhh]j)}(h$``const void *entry`` XArray entry. h](j)}(h``const void *entry``h]j4)}(hj-h]hconst void *entry}(hhhj/hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj+ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKBhj'ubj)}(hhh]h)}(h XArray entry.h]h XArray entry.}(hjHhjFhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjBhKBhjCubah}(h]h ]h"]h$]h&]uh1jhj'ubeh}(h]h ]h"]h$]h&]uh1jhjBhKBhj$ubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h **Context**h]j[)}(hjhh]hContext}(hhhjjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjfubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKDhjubh)}(h Any context.h]h Any context.}(hjhj~hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKDhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKFhjubh)}(h%The value stored in the XArray entry.h]h%The value stored in the XArray entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKEhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_is_value (C function) c.xa_is_valuehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h$bool xa_is_value (const void *entry)h]ja)}(h#bool xa_is_value(const void *entry)h](jg)}(hboolh]hbool}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKNubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhKNubj)}(h xa_is_valueh]j)}(h xa_is_valueh]h xa_is_value}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhKNubj)}(h(const void *entry)h]j)}(hconst void *entryh](jz)}(hj}h]hconst}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubjg)}(hvoidh]hvoid}(hhhj,hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj ubjy)}(h h]h }(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubj)}(hj(h]h*}(hhhjHhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubj)}(hentryh]hentry}(hhhjUhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhKNubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhKNubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKShjhhubj+)}(hhh]h)}(h!Determine if an entry is a value.h]h!Determine if an entry is a value.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKMhj}hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhKNubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const void *entry`` XArray entry. **Context** Any context. **Return** True if the entry is a value, false if it is a pointer.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKQhjubj)}(hhh]j)}(h$``const void *entry`` XArray entry. h](j)}(h``const void *entry``h]j4)}(hjh]hconst void *entry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKNhjubj)}(hhh]h)}(h XArray entry.h]h XArray entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhKNhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhKNhjubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKPhjubh)}(h Any context.h]h Any context.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKPhjubh)}(h **Return**h]j[)}(hj#h]hReturn}(hhhj%hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj!ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKRhjubh)}(h7True if the entry is a value, false if it is a pointer.h]h7True if the entry is a value, false if it is a pointer.}(hj;hj9hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKQhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_tag_pointer (C function)c.xa_tag_pointerhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h2void * xa_tag_pointer (void *p, unsigned long tag)h]ja)}(h0void *xa_tag_pointer(void *p, unsigned long tag)h](jg)}(hvoidh]hvoid}(hhhjhhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjdhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKZubjy)}(h h]h }(hhhjwhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjdhhhjvhKZubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjdhhhjvhKZubj)}(hxa_tag_pointerh]j)}(hxa_tag_pointerh]hxa_tag_pointer}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjdhhhjvhKZubj)}(h(void *p, unsigned long tag)h](j)}(hvoid *ph](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hjh]hp}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long tagh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(htagh]htag}(hhhj+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjdhhhjvhKZubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj`hhhjvhKZubah}(h]j[ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKehj]hhubj+)}(hhh]h)}(h,Create an XArray entry for a tagged pointer.h]h,Create an XArray entry for a tagged pointer.}(hjXhjVhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKYhjShhubah}(h]h ]h"]h$]h&]uh1j*hj]hhhjvhKZubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjnjNjnjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``void *p`` Plain pointer. ``unsigned long tag`` Tag value (0, 1 or 3). **Description** If the user of the XArray prefers, they can tag their pointers instead of storing value entries. Three tags are available (0, 1 and 3). These are distinct from the xa_mark_t as they are not replicated up through the array and cannot be searched for. **Context** Any context. **Return** An XArray entry.h](h)}(h**Parameters**h]j[)}(hjxh]h Parameters}(hhhjzhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjvubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK]hjrubj)}(hhh](j)}(h``void *p`` Plain pointer. h](j)}(h ``void *p``h]j4)}(hjh]hvoid *p}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKZhjubj)}(hhh]h)}(hPlain pointer.h]hPlain pointer.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhKZhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhKZhjubj)}(h-``unsigned long tag`` Tag value (0, 1 or 3). h](j)}(h``unsigned long tag``h]j4)}(hjh]hunsigned long tag}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK[hjubj)}(hhh]h)}(hTag value (0, 1 or 3).h]hTag value (0, 1 or 3).}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhK[hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhK[hjubeh}(h]h ]h"]h$]h&]uh1jhjrubh)}(h**Description**h]j[)}(hj h]h Description}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK]hjrubh)}(hIf the user of the XArray prefers, they can tag their pointers instead of storing value entries. Three tags are available (0, 1 and 3). These are distinct from the xa_mark_t as they are not replicated up through the array and cannot be searched for.h]hIf the user of the XArray prefers, they can tag their pointers instead of storing value entries. Three tags are available (0, 1 and 3). These are distinct from the xa_mark_t as they are not replicated up through the array and cannot be searched for.}(hj#hj!hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK]hjrubh)}(h **Context**h]j[)}(hj2h]hContext}(hhhj4hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj0ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKbhjrubh)}(h Any context.h]h Any context.}(hjJhjHhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKbhjrubh)}(h **Return**h]j[)}(hjYh]hReturn}(hhhj[hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjWubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKdhjrubh)}(hAn XArray entry.h]hAn XArray entry.}(hjqhjohhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKchjrubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_untag_pointer (C function)c.xa_untag_pointerhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h%void * xa_untag_pointer (void *entry)h]ja)}(h#void *xa_untag_pointer(void *entry)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKlubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhKlubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhhhjhKlubj)}(hxa_untag_pointerh]j)}(hxa_untag_pointerh]hxa_untag_pointer}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhKlubj)}(h (void *entry)h]j)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhKlubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhKlubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKthjhhubj+)}(hhh]h)}(h*Turn an XArray entry into a plain pointer.h]h*Turn an XArray entry into a plain pointer.}(hj>hj<hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKkhj9hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhKlubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjTjNjTjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``void *entry`` XArray entry. **Description** If you have stored a tagged pointer in the XArray, call this function to get the untagged version of the pointer. **Context** Any context. **Return** A pointer.h](h)}(h**Parameters**h]j[)}(hj^h]h Parameters}(hhhj`hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj\ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKohjXubj)}(hhh]j)}(h``void *entry`` XArray entry. h](j)}(h``void *entry``h]j4)}(hj}h]h void *entry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj{ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKlhjwubj)}(hhh]h)}(h XArray entry.h]h XArray entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhKlhjubah}(h]h ]h"]h$]h&]uh1jhjwubeh}(h]h ]h"]h$]h&]uh1jhjhKlhjtubah}(h]h ]h"]h$]h&]uh1jhjXubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKnhjXubh)}(hqIf you have stored a tagged pointer in the XArray, call this function to get the untagged version of the pointer.h]hqIf you have stored a tagged pointer in the XArray, call this function to get the untagged version of the pointer.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKnhjXubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKqhjXubh)}(h Any context.h]h Any context.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKqhjXubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKshjXubh)}(h A pointer.h]h A pointer.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKrhjXubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_pointer_tag (C function)c.xa_pointer_taghNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h)unsigned int xa_pointer_tag (void *entry)h]ja)}(h(unsigned int xa_pointer_tag(void *entry)h](jg)}(hunsignedh]hunsigned}(hhhjKhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjGhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK{ubjy)}(h h]h }(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjGhhhjYhK{ubjg)}(hinth]hint}(hhhjhhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjGhhhjYhK{ubjy)}(h h]h }(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjGhhhjYhK{ubj)}(hxa_pointer_tagh]j)}(hxa_pointer_tagh]hxa_pointer_tag}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjGhhhjYhK{ubj)}(h (void *entry)h]j)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjGhhhjYhK{ubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjChhhjYhK{ubah}(h]j>ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhj@hhubj+)}(hhh]h)}(h&Get the tag stored in an XArray entry.h]h&Get the tag stored in an XArray entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKzhjhhubah}(h]h ]h"]h$]h&]uh1j*hj@hhhjYhK{ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``void *entry`` XArray entry. **Description** If you have stored a tagged pointer in the XArray, call this function to get the tag of that pointer. **Context** Any context. **Return** A tag.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK~hjubj)}(hhh]j)}(h``void *entry`` XArray entry. h](j)}(h``void *entry``h]j4)}(hj9h]h void *entry}(hhhj;hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj7ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK{hj3ubj)}(hhh]h)}(h XArray entry.h]h XArray entry.}(hjThjRhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjNhK{hjOubah}(h]h ]h"]h$]h&]uh1jhj3ubeh}(h]h ]h"]h$]h&]uh1jhjNhK{hj0ubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjth]h Description}(hhhjvhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjrubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK}hjubh)}(heIf you have stored a tagged pointer in the XArray, call this function to get the tag of that pointer.h]heIf you have stored a tagged pointer in the XArray, call this function to get the tag of that pointer.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhK}hjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(h Any context.h]h Any context.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(hA tag.h]hA tag.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_is_zero (C function) c.xa_is_zerohNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h#bool xa_is_zero (const void *entry)h]ja)}(h"bool xa_is_zero(const void *entry)h](jg)}(hjh]hbool}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhKubj)}(h xa_is_zeroh]j)}(h xa_is_zeroh]h xa_is_zero}(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj#ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhKubj)}(h(const void *entry)h]j)}(hconst void *entryh](jz)}(hj}h]hconst}(hhhjChhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj?ubjy)}(h h]h }(hhhjPhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj?ubjg)}(hvoidh]hvoid}(hhhj^hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj?ubjy)}(h h]h }(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj?ubj)}(hj(h]h*}(hhhjzhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj?ubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj?ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj;ubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhKubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhKubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjhhubj+)}(hhh]h)}(hIs the entry a zero entry?h]hIs the entry a zero entry?}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhKubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``const void *entry`` Entry retrieved from the XArray **Description** The normal API will return NULL as the contents of a slot containing a zero entry. You can only see zero entries by using the advanced API. **Return** ``true`` if the entry is a zero entry.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubj)}(hhh]j)}(h6``const void *entry`` Entry retrieved from the XArray h](j)}(h``const void *entry``h]j4)}(hjh]hconst void *entry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubj)}(hhh]h)}(hEntry retrieved from the XArrayh]hEntry retrieved from the XArray}(hjhj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhKhj ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhKhjubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hj.h]h Description}(hhhj0hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj,ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(hThe normal API will return NULL as the contents of a slot containing a zero entry. You can only see zero entries by using the advanced API.h]hThe normal API will return NULL as the contents of a slot containing a zero entry. You can only see zero entries by using the advanced API.}(hjFhjDhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(h **Return**h]j[)}(hjUh]hReturn}(hhhjWhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjSubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(h&``true`` if the entry is a zero entry.h](j4)}(h``true``h]htrue}(hhhjohhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjkubh if the entry is a zero entry.}(h if the entry is a zero entry.hjkhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_is_err (C function) c.xa_is_errhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h"bool xa_is_err (const void *entry)h]ja)}(h!bool xa_is_err(const void *entry)h](jg)}(hjh]hbool}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhKubj)}(h xa_is_errh]j)}(h xa_is_errh]h xa_is_err}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhKubj)}(h(const void *entry)h]j)}(hconst void *entryh](jz)}(hj}h]hconst}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhj)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhKubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhKubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjhhubj+)}(hhh]h)}(h4Report whether an XArray operation returned an errorh]h4Report whether an XArray operation returned an error}(hjVhjThhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjQhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhKubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjljNjljOuh1jUhhhj3hNhNubjQ)}(hXx**Parameters** ``const void *entry`` Result from calling an XArray function **Description** If an XArray operation cannot complete an operation, it will return a special value indicating an error. This function tells you whether an error occurred; xa_err() tells you which error occurred. **Context** Any context. **Return** ``true`` if the entry indicates an error.h](h)}(h**Parameters**h]j[)}(hjvh]h Parameters}(hhhjxhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjtubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjpubj)}(hhh]j)}(h=``const void *entry`` Result from calling an XArray function h](j)}(h``const void *entry``h]j4)}(hjh]hconst void *entry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubj)}(hhh]h)}(h&Result from calling an XArray functionh]h&Result from calling an XArray function}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhKhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhKhjubah}(h]h ]h"]h$]h&]uh1jhjpubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjpubh)}(hIf an XArray operation cannot complete an operation, it will return a special value indicating an error. This function tells you whether an error occurred; xa_err() tells you which error occurred.h]hIf an XArray operation cannot complete an operation, it will return a special value indicating an error. This function tells you whether an error occurred; xa_err() tells you which error occurred.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjpubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjpubh)}(h Any context.h]h Any context.}(hjhj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjpubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjpubh)}(h)``true`` if the entry indicates an error.h](j4)}(h``true``h]htrue}(hhhj8hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj4ubh! if the entry indicates an error.}(h! if the entry indicates an error.hj4hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjpubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_err (C function)c.xa_errhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hint xa_err (void *entry)h]ja)}(hint xa_err(void *entry)h](jg)}(hinth]hint}(hhhjrhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjnhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjnhhhjhKubj)}(hxa_errh]j)}(hxa_errh]hxa_err}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjnhhhjhKubj)}(h (void *entry)h]j)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjnhhhjhKubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjjhhhjhKubah}(h]jeah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjghhubj+)}(hhh]h)}(h$Turn an XArray result into an errno.h]h$Turn an XArray result into an errno.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjhhubah}(h]h ]h"]h$]h&]uh1j*hjghhhjhKubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``void *entry`` Result from calling an XArray function. **Description** If an XArray operation cannot complete an operation, it will return a special pointer value which encodes an errno. This function extracts the errno from the pointer value, or returns 0 if the pointer does not represent an errno. **Context** Any context. **Return** A negative errno or 0.h](h)}(h**Parameters**h]j[)}(hj%h]h Parameters}(hhhj'hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj#ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubj)}(hhh]j)}(h8``void *entry`` Result from calling an XArray function. h](j)}(h``void *entry``h]j4)}(hjDh]h void *entry}(hhhjFhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjBubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhj>ubj)}(hhh]h)}(h'Result from calling an XArray function.h]h'Result from calling an XArray function.}(hj_hj]hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjYhKhjZubah}(h]h ]h"]h$]h&]uh1jhj>ubeh}(h]h ]h"]h$]h&]uh1jhjYhKhj;ubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj}ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(hIf an XArray operation cannot complete an operation, it will return a special pointer value which encodes an errno. This function extracts the errno from the pointer value, or returns 0 if the pointer does not represent an errno.h]hIf an XArray operation cannot complete an operation, it will return a special pointer value which encodes an errno. This function extracts the errno from the pointer value, or returns 0 if the pointer does not represent an errno.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(h Any context.h]h Any context.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubh)}(hA negative errno or 0.h]hA negative errno or 0.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_limit (C struct) c.xa_limithNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hxa_limith]ja)}(hstruct xa_limith](jz)}(hstructh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKubjy)}(h h]h }(hhhj!hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhj hKubj)}(hxa_limith]j)}(hj h]hxa_limit}(hhhj3hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj/ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhj hKubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj hhhj hKubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjhhubj+)}(hhh]h)}(hRepresents a range of IDs.h]hRepresents a range of IDs.}(hjXhjVhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjShhubah}(h]h ]h"]h$]h&]uh1j*hjhhhj hKubeh}(h]h ](jGstructeh"]h$]h&]jLjGjMjnjNjnjOuh1jUhhhj3hNhNubjQ)}(h**Definition**:: struct xa_limit { u32 max; u32 min; }; **Members** ``max`` The maximum ID to allocate (inclusive). ``min`` The lowest ID to allocate (inclusive).h](h)}(h**Definition**::h](j[)}(h**Definition**h]h Definition}(hhhjzhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjvubh:}(h:hjvhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjrubj; )}(h.struct xa_limit { u32 max; u32 min; };h]h.struct xa_limit { u32 max; u32 min; };}(hhhjubah}(h]h ]h"]h$]h&]hhuh1j: hW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjrubh)}(h **Members**h]j[)}(hjh]hMembers}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjrubj)}(hhh](j)}(h0``max`` The maximum ID to allocate (inclusive). h](j)}(h``max``h]j4)}(hjh]hmax}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubj)}(hhh]h)}(h'The maximum ID to allocate (inclusive).h]h'The maximum ID to allocate (inclusive).}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhKhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhKhjubj)}(h.``min`` The lowest ID to allocate (inclusive).h](j)}(h``min``h]j4)}(hjh]hmin}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubj)}(hhh]h)}(h&The lowest ID to allocate (inclusive).h]h&The lowest ID to allocate (inclusive).}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhKhjubeh}(h]h ]h"]h$]h&]uh1jhjrubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubh)}(h**Description**h]j[)}(hj@h]h Description}(hhhjBhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj>ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhj3hhubh)}(hXThis structure is used either directly or via the XA_LIMIT() macro to communicate the range of IDs that are valid for allocation. Three common ranges are predefined for you: * xa_limit_32b - [0 - UINT_MAX] * xa_limit_31b - [0 - INT_MAX] * xa_limit_16b - [0 - USHRT_MAX]h]hXThis structure is used either directly or via the XA_LIMIT() macro to communicate the range of IDs that are valid for allocation. Three common ranges are predefined for you: * xa_limit_32b - [0 - UINT_MAX] * xa_limit_31b - [0 - INT_MAX] * xa_limit_16b - [0 - USHRT_MAX]}(hjXhjVhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhj3hhubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxarray (C struct)c.xarrayhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hxarrayh]ja)}(h struct xarrayh](jz)}(hjh]hstruct}(hhhj~hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjzhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjzhhhjhMubj)}(hxarrayh]j)}(hjxh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjzhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjvhhhjhMubah}(h]jqah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhKhjshhubj+)}(hhh]h)}(hThe anchor of the XArray.h]hThe anchor of the XArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjshhhjhMubeh}(h]h ](jGstructeh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Definition**:: struct xarray { spinlock_t xa_lock; }; **Members** ``xa_lock`` Lock that protects the contents of the XArray.h](h)}(h**Definition**::h](j[)}(h**Definition**h]h Definition}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh:}(hjhjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM!hjubj; )}(h*struct xarray { spinlock_t xa_lock; };h]h*struct xarray { spinlock_t xa_lock; };}(hhhjubah}(h]h ]h"]h$]h&]hhuh1j: hW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM#hjubh)}(h **Members**h]j[)}(hj h]hMembers}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM'hjubj)}(hhh]j)}(h:``xa_lock`` Lock that protects the contents of the XArray.h](j)}(h ``xa_lock``h]j4)}(hj. h]hxa_lock}(hhhj0 hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj, ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj( ubj)}(hhh]h)}(h.Lock that protects the contents of the XArray.h]h.Lock that protects the contents of the XArray.}(hjI hjG hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjD ubah}(h]h ]h"]h$]h&]uh1jhj( ubeh}(h]h ]h"]h$]h&]uh1jhjC hMhj% ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubh)}(h**Description**h]j[)}(hjq h]h Description}(hhhjs hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjo ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM"hj3hhubh)}(hTo use the xarray, define it statically or embed it in your data structure. It is a very small data structure, so it does not usually make sense to allocate it separately and keep a pointer to it in your data structure.h]hTo use the xarray, define it statically or embed it in your data structure. It is a very small data structure, so it does not usually make sense to allocate it separately and keep a pointer to it in your data structure.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM hj3hhubh)}(hDYou may use the xa_lock to protect your own data structures as well.h]hDYou may use the xa_lock to protect your own data structures as well.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM$hj3hhubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQDEFINE_XARRAY_FLAGS (C macro)c.DEFINE_XARRAY_FLAGShNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hDEFINE_XARRAY_FLAGSh]ja)}(hDEFINE_XARRAY_FLAGSh]j)}(hDEFINE_XARRAY_FLAGSh]j)}(hj h]hDEFINE_XARRAY_FLAGS}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMDubah}(h]h ]h"]h$]h&]hhjuh1j`jjhj hhhj hMDubah}(h]j ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMChj hhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hj hhhj hMDubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMj jNj jOuh1jUhhhj3hNhNubh)}(h%``DEFINE_XARRAY_FLAGS (name, flags)``h]j4)}(hj h]h!DEFINE_XARRAY_FLAGS (name, flags)}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMEhj3hhubh block_quote)}(hhh]h)}(h#Define an XArray with custom flags.h]h#Define an XArray with custom flags.}(hj!hj!hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM:hj !ubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hXl**Parameters** ``name`` A string that names your XArray. ``flags`` XA_FLAG values. **Description** This is intended for file scope definitions of XArrays. It declares and initialises an empty XArray with the chosen name and flags. It is equivalent to calling xa_init_flags() on the array, but it does the initialisation at compiletime instead of runtime.h](h)}(h**Parameters**h]j[)}(hj+!h]h Parameters}(hhhj-!hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj)!ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM>hj%!ubj)}(hhh](j)}(h*``name`` A string that names your XArray. h](j)}(h``name``h]j4)}(hjJ!h]hname}(hhhjL!hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjH!ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM;hjD!ubj)}(hhh]h)}(h A string that names your XArray.h]h A string that names your XArray.}(hje!hjc!hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj_!hM;hj`!ubah}(h]h ]h"]h$]h&]uh1jhjD!ubeh}(h]h ]h"]h$]h&]uh1jhj_!hM;hjA!ubj)}(h``flags`` XA_FLAG values. h](j)}(h ``flags``h]j4)}(hj!h]hflags}(hhhj!hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj!ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM<hj}!ubj)}(hhh]h)}(hXA_FLAG values.h]hXA_FLAG values.}(hj!hj!hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj!hM<hj!ubah}(h]h ]h"]h$]h&]uh1jhj}!ubeh}(h]h ]h"]h$]h&]uh1jhj!hM<hjA!ubeh}(h]h ]h"]h$]h&]uh1jhj%!ubh)}(h**Description**h]j[)}(hj!h]h Description}(hhhj!hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj!ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM>hj%!ubh)}(hXThis is intended for file scope definitions of XArrays. It declares and initialises an empty XArray with the chosen name and flags. It is equivalent to calling xa_init_flags() on the array, but it does the initialisation at compiletime instead of runtime.h]hXThis is intended for file scope definitions of XArrays. It declares and initialises an empty XArray with the chosen name and flags. It is equivalent to calling xa_init_flags() on the array, but it does the initialisation at compiletime instead of runtime.}(hj!hj!hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM>hj%!ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQDEFINE_XARRAY (C macro)c.DEFINE_XARRAYhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h DEFINE_XARRAYh]ja)}(h DEFINE_XARRAYh]j)}(h DEFINE_XARRAYh]j)}(hj!h]h DEFINE_XARRAY}(hhhj"hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj"ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj!hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMPubah}(h]h ]h"]h$]h&]hhjuh1j`jjhj!hhhj"hMPubah}(h]j!ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMOhj!hhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hj!hhhj"hMPubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMj4"jNj4"jOuh1jUhhhj3hNhNubh)}(h``DEFINE_XARRAY (name)``h]j4)}(hj:"h]hDEFINE_XARRAY (name)}(hhhj<"hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj8"ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMQhj3hhubj !)}(hhh]h)}(hDefine an XArray.h]hDefine an XArray.}(hjU"hjS"hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMGhjP"ubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hX?**Parameters** ``name`` A string that names your XArray. **Description** This is intended for file scope definitions of XArrays. It declares and initialises an empty XArray with the chosen name. It is equivalent to calling xa_init() on the array, but it does the initialisation at compiletime instead of runtime.h](h)}(h**Parameters**h]j[)}(hjn"h]h Parameters}(hhhjp"hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjl"ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMKhjh"ubj)}(hhh]j)}(h*``name`` A string that names your XArray. h](j)}(h``name``h]j4)}(hj"h]hname}(hhhj"hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj"ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMHhj"ubj)}(hhh]h)}(h A string that names your XArray.h]h A string that names your XArray.}(hj"hj"hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj"hMHhj"ubah}(h]h ]h"]h$]h&]uh1jhj"ubeh}(h]h ]h"]h$]h&]uh1jhj"hMHhj"ubah}(h]h ]h"]h$]h&]uh1jhjh"ubh)}(h**Description**h]j[)}(hj"h]h Description}(hhhj"hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj"ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMJhjh"ubh)}(hThis is intended for file scope definitions of XArrays. It declares and initialises an empty XArray with the chosen name. It is equivalent to calling xa_init() on the array, but it does the initialisation at compiletime instead of runtime.h]hThis is intended for file scope definitions of XArrays. It declares and initialises an empty XArray with the chosen name. It is equivalent to calling xa_init() on the array, but it does the initialisation at compiletime instead of runtime.}(hj"hj"hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMJhjh"ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQDEFINE_XARRAY_ALLOC (C macro)c.DEFINE_XARRAY_ALLOChNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hDEFINE_XARRAY_ALLOCh]ja)}(hDEFINE_XARRAY_ALLOCh]j)}(hDEFINE_XARRAY_ALLOCh]j)}(hj#h]hDEFINE_XARRAY_ALLOC}(hhhj#hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj #ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj #hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMYubah}(h]h ]h"]h$]h&]hhjuh1j`jjhj#hhhj$#hMYubah}(h]j#ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMXhj#hhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hj#hhhj$#hMYubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMj>#jNj>#jOuh1jUhhhj3hNhNubh)}(h``DEFINE_XARRAY_ALLOC (name)``h]j4)}(hjD#h]hDEFINE_XARRAY_ALLOC (name)}(hhhjF#hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjB#ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMZhj3hhubj !)}(hhh]h)}(h3Define an XArray which allocates IDs starting at 0.h]h3Define an XArray which allocates IDs starting at 0.}(hj_#hj]#hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMRhjZ#ubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(h**Parameters** ``name`` A string that names your XArray. **Description** This is intended for file scope definitions of allocating XArrays. See also DEFINE_XARRAY().h](h)}(h**Parameters**h]j[)}(hjx#h]h Parameters}(hhhjz#hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjv#ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMVhjr#ubj)}(hhh]j)}(h*``name`` A string that names your XArray. h](j)}(h``name``h]j4)}(hj#h]hname}(hhhj#hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj#ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMShj#ubj)}(hhh]h)}(h A string that names your XArray.h]h A string that names your XArray.}(hj#hj#hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj#hMShj#ubah}(h]h ]h"]h$]h&]uh1jhj#ubeh}(h]h ]h"]h$]h&]uh1jhj#hMShj#ubah}(h]h ]h"]h$]h&]uh1jhjr#ubh)}(h**Description**h]j[)}(hj#h]h Description}(hhhj#hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj#ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMUhjr#ubh)}(h\This is intended for file scope definitions of allocating XArrays. See also DEFINE_XARRAY().h]h\This is intended for file scope definitions of allocating XArrays. See also DEFINE_XARRAY().}(hj#hj#hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMUhjr#ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQDEFINE_XARRAY_ALLOC1 (C macro)c.DEFINE_XARRAY_ALLOC1hNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hDEFINE_XARRAY_ALLOC1h]ja)}(hDEFINE_XARRAY_ALLOC1h]j)}(hDEFINE_XARRAY_ALLOC1h]j)}(hj$h]hDEFINE_XARRAY_ALLOC1}(hhhj$hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj$ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj$hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMbubah}(h]h ]h"]h$]h&]hhjuh1j`jjhj$hhhj.$hMbubah}(h]j $ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMahj $hhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hj $hhhj.$hMbubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMjH$jNjH$jOuh1jUhhhj3hNhNubh)}(h``DEFINE_XARRAY_ALLOC1 (name)``h]j4)}(hjN$h]hDEFINE_XARRAY_ALLOC1 (name)}(hhhjP$hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjL$ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMchj3hhubj !)}(hhh]h)}(h3Define an XArray which allocates IDs starting at 1.h]h3Define an XArray which allocates IDs starting at 1.}(hji$hjg$hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM[hjd$ubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(h**Parameters** ``name`` A string that names your XArray. **Description** This is intended for file scope definitions of allocating XArrays. See also DEFINE_XARRAY().h](h)}(h**Parameters**h]j[)}(hj$h]h Parameters}(hhhj$hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj$ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM_hj|$ubj)}(hhh]j)}(h*``name`` A string that names your XArray. h](j)}(h``name``h]j4)}(hj$h]hname}(hhhj$hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj$ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM\hj$ubj)}(hhh]h)}(h A string that names your XArray.h]h A string that names your XArray.}(hj$hj$hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj$hM\hj$ubah}(h]h ]h"]h$]h&]uh1jhj$ubeh}(h]h ]h"]h$]h&]uh1jhj$hM\hj$ubah}(h]h ]h"]h$]h&]uh1jhj|$ubh)}(h**Description**h]j[)}(hj$h]h Description}(hhhj$hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj$ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM^hj|$ubh)}(h\This is intended for file scope definitions of allocating XArrays. See also DEFINE_XARRAY().h]h\This is intended for file scope definitions of allocating XArrays. See also DEFINE_XARRAY().}(hj$hj$hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM^hj|$ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_init_flags (C function)c.xa_init_flagshNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h3void xa_init_flags (struct xarray *xa, gfp_t flags)h]ja)}(h2void xa_init_flags(struct xarray *xa, gfp_t flags)h](jg)}(hvoidh]hvoid}(hhhj!%hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj%hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMuubjy)}(h h]h }(hhhj0%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj%hhhj/%hMuubj)}(h xa_init_flagsh]j)}(h xa_init_flagsh]h xa_init_flags}(hhhjB%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj>%ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj%hhhj/%hMuubj)}(h (struct xarray *xa, gfp_t flags)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhj^%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjZ%ubjy)}(h h]h }(hhhjk%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjZ%ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj|%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjy%ubah}(h]h ]h"]h$]h&] refdomainjGreftype identifier reftargetj~%modnameN classnameN c:parent_keysphinx.domains.c LookupKey)}data]j% ASTIdentifier)}j%jD%sbc.xa_init_flagsasbuh1hhjZ%ubjy)}(h h]h }(hhhj%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjZ%ubj)}(hj(h]h*}(hhhj%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjZ%ubj)}(hxah]hxa}(hhhj%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjZ%ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjV%ubj)}(h gfp_t flagsh](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhj%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj%ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj%modnameN classnameNj%j%)}j%]j%c.xa_init_flagsasbuh1hhj%ubjy)}(h h]h }(hhhj%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj%ubj)}(hflagsh]hflags}(hhhj&hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj%ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjV%ubeh}(h]h ]h"]h$]h&]hhuh1jhj%hhhj/%hMuubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj%hhhj/%hMuubah}(h]j%ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM~hj%hhubj+)}(hhh]h)}(h&Initialise an empty XArray with flags.h]h&Initialise an empty XArray with flags.}(hj4&hj2&hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMthj/&hhubah}(h]h ]h"]h$]h&]uh1j*hj%hhhj/%hMuubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjJ&jNjJ&jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``gfp_t flags`` XA_FLAG values. **Description** If you need to initialise an XArray with special flags (eg you need to take the lock from interrupt context), use this function instead of xa_init(). **Context** Any context.h](h)}(h**Parameters**h]j[)}(hjT&h]h Parameters}(hhhjV&hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjR&ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMxhjN&ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjs&h]hstruct xarray *xa}(hhhju&hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjq&ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMuhjm&ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj&hj&hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj&hMuhj&ubah}(h]h ]h"]h$]h&]uh1jhjm&ubeh}(h]h ]h"]h$]h&]uh1jhj&hMuhjj&ubj)}(h ``gfp_t flags`` XA_FLAG values. h](j)}(h``gfp_t flags``h]j4)}(hj&h]h gfp_t flags}(hhhj&hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj&ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMvhj&ubj)}(hhh]h)}(hXA_FLAG values.h]hXA_FLAG values.}(hj&hj&hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj&hMvhj&ubah}(h]h ]h"]h$]h&]uh1jhj&ubeh}(h]h ]h"]h$]h&]uh1jhj&hMvhjj&ubeh}(h]h ]h"]h$]h&]uh1jhjN&ubh)}(h**Description**h]j[)}(hj&h]h Description}(hhhj&hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj&ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMxhjN&ubh)}(hIf you need to initialise an XArray with special flags (eg you need to take the lock from interrupt context), use this function instead of xa_init().h]hIf you need to initialise an XArray with special flags (eg you need to take the lock from interrupt context), use this function instead of xa_init().}(hj&hj&hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMxhjN&ubh)}(h **Context**h]j[)}(hj'h]hContext}(hhhj'hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj 'ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM|hjN&ubh)}(h Any context.h]h Any context.}(hj&'hj$'hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM|hjN&ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_init (C function) c.xa_inithNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h void xa_init (struct xarray *xa)h]ja)}(hvoid xa_init(struct xarray *xa)h](jg)}(hvoidh]hvoid}(hhhjS'hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjO'hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjb'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjO'hhhja'hMubj)}(hxa_inith]j)}(hxa_inith]hxa_init}(hhhjt'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjp'ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjO'hhhja'hMubj)}(h(struct xarray *xa)h]j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj'ubjy)}(h h]h }(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj'ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj'ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj'modnameN classnameNj%j%)}j%]j%)}j%jv'sb c.xa_initasbuh1hhj'ubjy)}(h h]h }(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj'ubj)}(hj(h]h*}(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj'ubj)}(hxah]hxa}(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj'ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj'ubah}(h]h ]h"]h$]h&]hhuh1jhjO'hhhja'hMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjK'hhhja'hMubah}(h]jF'ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjH'hhubj+)}(hhh]h)}(hInitialise an empty XArray.h]hInitialise an empty XArray.}(hj(hj(hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj(hhubah}(h]h ]h"]h$]h&]uh1j*hjH'hhhja'hMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj,(jNj,(jOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``struct xarray *xa`` XArray. **Description** An empty XArray is full of NULL entries. **Context** Any context.h](h)}(h**Parameters**h]j[)}(hj6(h]h Parameters}(hhhj8(hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj4(ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj0(ubj)}(hhh]j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjU(h]hstruct xarray *xa}(hhhjW(hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjS(ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjO(ubj)}(hhh]h)}(hXArray.h]hXArray.}(hjp(hjn(hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjj(hMhjk(ubah}(h]h ]h"]h$]h&]uh1jhjO(ubeh}(h]h ]h"]h$]h&]uh1jhjj(hMhjL(ubah}(h]h ]h"]h$]h&]uh1jhj0(ubh)}(h**Description**h]j[)}(hj(h]h Description}(hhhj(hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj(ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj0(ubh)}(h(An empty XArray is full of NULL entries.h]h(An empty XArray is full of NULL entries.}(hj(hj(hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj0(ubh)}(h **Context**h]j[)}(hj(h]hContext}(hhhj(hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj(ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj0(ubh)}(h Any context.h]h Any context.}(hj(hj(hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj0(ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_empty (C function) c.xa_emptyhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h'bool xa_empty (const struct xarray *xa)h]ja)}(h&bool xa_empty(const struct xarray *xa)h](jg)}(hjh]hbool}(hhhj(hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj(hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhj )hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj(hhhj )hMubj)}(hxa_emptyh]j)}(hxa_emptyh]hxa_empty}(hhhj)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj)ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj(hhhj )hMubj)}(h(const struct xarray *xa)h]j)}(hconst struct xarray *xah](jz)}(hj}h]hconst}(hhhj8)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj4)ubjy)}(h h]h }(hhhjE)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj4)ubjz)}(hjh]hstruct}(hhhjS)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj4)ubjy)}(h h]h }(hhhj`)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj4)ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjq)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjn)ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjs)modnameN classnameNj%j%)}j%]j%)}j%j)sb c.xa_emptyasbuh1hhj4)ubjy)}(h h]h }(hhhj)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj4)ubj)}(hj(h]h*}(hhhj)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj4)ubj)}(hxah]hxa}(hhhj)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj4)ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj0)ubah}(h]h ]h"]h$]h&]hhuh1jhj(hhhj )hMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj(hhhj )hMubah}(h]j(ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj(hhubj+)}(hhh]h)}(h.Determine if an array has any present entries.h]h.Determine if an array has any present entries.}(hj)hj)hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj)hhubah}(h]h ]h"]h$]h&]uh1j*hj(hhhj )hMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj)jNj)jOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const struct xarray *xa`` XArray. **Context** Any context. **Return** ``true`` if the array contains only NULL pointers.h](h)}(h**Parameters**h]j[)}(hj)h]h Parameters}(hhhj)hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj)ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj)ubj)}(hhh]j)}(h$``const struct xarray *xa`` XArray. h](j)}(h``const struct xarray *xa``h]j4)}(hj*h]hconst struct xarray *xa}(hhhj*hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj*ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj*ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj3*hj1*hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj-*hMhj.*ubah}(h]h ]h"]h$]h&]uh1jhj*ubeh}(h]h ]h"]h$]h&]uh1jhj-*hMhj*ubah}(h]h ]h"]h$]h&]uh1jhj)ubh)}(h **Context**h]j[)}(hjS*h]hContext}(hhhjU*hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjQ*ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj)ubh)}(h Any context.h]h Any context.}(hjk*hji*hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj)ubh)}(h **Return**h]j[)}(hjz*h]hReturn}(hhhj|*hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjx*ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj)ubh)}(h2``true`` if the array contains only NULL pointers.h](j4)}(h``true``h]htrue}(hhhj*hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj*ubh* if the array contains only NULL pointers.}(h* if the array contains only NULL pointers.hj*hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj)ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_marked (C function) c.xa_markedhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h8bool xa_marked (const struct xarray *xa, xa_mark_t mark)h]ja)}(h7bool xa_marked(const struct xarray *xa, xa_mark_t mark)h](jg)}(hjh]hbool}(hhhj*hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj*hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhj*hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj*hhhj*hMubj)}(h xa_markedh]j)}(h xa_markedh]h xa_marked}(hhhj*hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj*ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj*hhhj*hMubj)}(h)(const struct xarray *xa, xa_mark_t mark)h](j)}(hconst struct xarray *xah](jz)}(hj}h]hconst}(hhhj +hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj+ubjy)}(h h]h }(hhhj+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj+ubjz)}(hjh]hstruct}(hhhj%+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj+ubjy)}(h h]h }(hhhj2+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj+ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjC+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj@+ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjE+modnameN classnameNj%j%)}j%]j%)}j%j*sb c.xa_markedasbuh1hhj+ubjy)}(h h]h }(hhhjc+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj+ubj)}(hj(h]h*}(hhhjq+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj+ubj)}(hxah]hxa}(hhhj~+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj+ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj+ubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhj+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj+ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj+modnameN classnameNj%j%)}j%]j_+ c.xa_markedasbuh1hhj+ubjy)}(h h]h }(hhhj+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj+ubj)}(hmarkh]hmark}(hhhj+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj+ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj+ubeh}(h]h ]h"]h$]h&]hhuh1jhj*hhhj*hMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj*hhhj*hMubah}(h]j*ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj*hhubj+)}(hhh]h)}(h6Inquire whether any entry in this array has a mark seth]h6Inquire whether any entry in this array has a mark set}(hj+hj+hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj+hhubah}(h]h ]h"]h$]h&]uh1j*hj*hhhj*hMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj ,jNj ,jOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const struct xarray *xa`` Array ``xa_mark_t mark`` Mark value **Context** Any context. **Return** ``true`` if any entry has this mark set.h](h)}(h**Parameters**h]j[)}(hj,h]h Parameters}(hhhj,hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj,ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj ,ubj)}(hhh](j)}(h"``const struct xarray *xa`` Array h](j)}(h``const struct xarray *xa``h]j4)}(hj2,h]hconst struct xarray *xa}(hhhj4,hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj0,ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj,,ubj)}(hhh]h)}(hArrayh]hArray}(hjM,hjK,hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjG,hMhjH,ubah}(h]h ]h"]h$]h&]uh1jhj,,ubeh}(h]h ]h"]h$]h&]uh1jhjG,hMhj),ubj)}(h``xa_mark_t mark`` Mark value h](j)}(h``xa_mark_t mark``h]j4)}(hjk,h]hxa_mark_t mark}(hhhjm,hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hji,ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhje,ubj)}(hhh]h)}(h Mark valueh]h Mark value}(hj,hj,hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj,hMhj,ubah}(h]h ]h"]h$]h&]uh1jhje,ubeh}(h]h ]h"]h$]h&]uh1jhj,hMhj),ubeh}(h]h ]h"]h$]h&]uh1jhj ,ubh)}(h **Context**h]j[)}(hj,h]hContext}(hhhj,hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj,ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj ,ubh)}(h Any context.h]h Any context.}(hj,hj,hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj ,ubh)}(h **Return**h]j[)}(hj,h]hReturn}(hhhj,hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj,ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj ,ubh)}(h(``true`` if any entry has this mark set.h](j4)}(h``true``h]htrue}(hhhj,hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj,ubh if any entry has this mark set.}(h if any entry has this mark set.hj,hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj ,ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_for_each_range (C macro)c.xa_for_each_rangehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hxa_for_each_rangeh]ja)}(hxa_for_each_rangeh]j)}(hxa_for_each_rangeh]j)}(hj-h]hxa_for_each_range}(hhhj%-hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj!-ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj-hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubah}(h]h ]h"]h$]h&]hhjuh1j`jjhj-hhhj8-hMubah}(h]j-ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj-hhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hj-hhhj8-hMubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMjR-jNjR-jOuh1jUhhhj3hNhNubh)}(h5``xa_for_each_range (xa, index, entry, start, last)``h]j4)}(hjX-h]h1xa_for_each_range (xa, index, entry, start, last)}(hhhjZ-hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjV-ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj3hhubj !)}(hhh]h)}(h$Iterate over a portion of an XArray.h]h$Iterate over a portion of an XArray.}(hjs-hjq-hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjn-ubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hX:**Parameters** ``xa`` XArray. ``index`` Index of **entry**. ``entry`` Entry retrieved from array. ``start`` First index to retrieve from array. ``last`` Last index to retrieve from array. **Description** During the iteration, **entry** will have the value of the entry stored in **xa** at **index**. You may modify **index** during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, **entry** will be set to NULL and **index** will have a value less than or equal to max. xa_for_each_range() is O(n.log(n)) while xas_for_each() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each_range() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each() iterator instead. The xas_for_each() iterator will expand into more inline code than xa_for_each_range(). **Context** Any context. Takes and releases the RCU lock.h](h)}(h**Parameters**h]j[)}(hj-h]h Parameters}(hhhj-hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj-ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj-ubj)}(hhh](j)}(h``xa`` XArray. h](j)}(h``xa``h]j4)}(hj-h]hxa}(hhhj-hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj-ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj-ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj-hj-hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj-hMhj-ubah}(h]h ]h"]h$]h&]uh1jhj-ubeh}(h]h ]h"]h$]h&]uh1jhj-hMhj-ubj)}(h``index`` Index of **entry**. h](j)}(h ``index``h]j4)}(hj-h]hindex}(hhhj-hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj-ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj-ubj)}(hhh]h)}(hIndex of **entry**.h](h Index of }(h Index of hj-hhhNhNubj[)}(h **entry**h]hentry}(hhhj.hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj-ubh.}(hjhj-hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhj-hMhj-ubah}(h]h ]h"]h$]h&]uh1jhj-ubeh}(h]h ]h"]h$]h&]uh1jhj-hMhj-ubj)}(h&``entry`` Entry retrieved from array. h](j)}(h ``entry``h]j4)}(hj0.h]hentry}(hhhj2.hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj..ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj*.ubj)}(hhh]h)}(hEntry retrieved from array.h]hEntry retrieved from array.}(hjK.hjI.hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjE.hMhjF.ubah}(h]h ]h"]h$]h&]uh1jhj*.ubeh}(h]h ]h"]h$]h&]uh1jhjE.hMhj-ubj)}(h.``start`` First index to retrieve from array. h](j)}(h ``start``h]j4)}(hji.h]hstart}(hhhjk.hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjg.ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjc.ubj)}(hhh]h)}(h#First index to retrieve from array.h]h#First index to retrieve from array.}(hj.hj.hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj~.hMhj.ubah}(h]h ]h"]h$]h&]uh1jhjc.ubeh}(h]h ]h"]h$]h&]uh1jhj~.hMhj-ubj)}(h,``last`` Last index to retrieve from array. h](j)}(h``last``h]j4)}(hj.h]hlast}(hhhj.hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj.ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj.ubj)}(hhh]h)}(h"Last index to retrieve from array.h]h"Last index to retrieve from array.}(hj.hj.hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj.hMhj.ubah}(h]h ]h"]h$]h&]uh1jhj.ubeh}(h]h ]h"]h$]h&]uh1jhj.hMhj-ubeh}(h]h ]h"]h$]h&]uh1jhj-ubh)}(h**Description**h]j[)}(hj.h]h Description}(hhhj.hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj.ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj-ubh)}(hXeDuring the iteration, **entry** will have the value of the entry stored in **xa** at **index**. You may modify **index** during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, **entry** will be set to NULL and **index** will have a value less than or equal to max.h](hDuring the iteration, }(hDuring the iteration, hj.hhhNhNubj[)}(h **entry**h]hentry}(hhhj.hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj.ubh, will have the value of the entry stored in }(h, will have the value of the entry stored in hj.hhhNhNubj[)}(h**xa**h]hxa}(hhhj/hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj.ubh at }(h at hj.hhhNhNubj[)}(h **index**h]hindex}(hhhj"/hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj.ubh. You may modify }(h. You may modify hj.hhhNhNubj[)}(h **index**h]hindex}(hhhj5/hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj.ubh during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, }(h during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, hj.hhhNhNubj[)}(h **entry**h]hentry}(hhhjH/hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj.ubh will be set to NULL and }(h will be set to NULL and hj.hhhNhNubj[)}(h **index**h]hindex}(hhhj[/hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj.ubh- will have a value less than or equal to max.}(h- will have a value less than or equal to max.hj.hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj-ubh)}(hXxa_for_each_range() is O(n.log(n)) while xas_for_each() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each_range() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each() iterator instead. The xas_for_each() iterator will expand into more inline code than xa_for_each_range().h]hXxa_for_each_range() is O(n.log(n)) while xas_for_each() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each_range() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each() iterator instead. The xas_for_each() iterator will expand into more inline code than xa_for_each_range().}(hjw/hju/hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj-ubh)}(h **Context**h]j[)}(hj/h]hContext}(hhhj/hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj/ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj-ubh)}(h.Any context. Takes and releases the RCU lock.h]h.Any context. Takes and releases the RCU lock.}(hj/hj/hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj-ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_for_each_start (C macro)c.xa_for_each_starthNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hxa_for_each_starth]ja)}(hxa_for_each_starth]j)}(hxa_for_each_starth]j)}(hj/h]hxa_for_each_start}(hhhj/hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj/ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj/hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubah}(h]h ]h"]h$]h&]hhjuh1j`jjhj/hhhj/hMubah}(h]j/ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj/hhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hj/hhhj/hMubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMj/jNj/jOuh1jUhhhj3hNhNubh)}(h/``xa_for_each_start (xa, index, entry, start)``h]j4)}(hj0h]h+xa_for_each_start (xa, index, entry, start)}(hhhj0hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj0ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj3hhubj !)}(hhh]h)}(h$Iterate over a portion of an XArray.h]h$Iterate over a portion of an XArray.}(hj0hj0hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj0ubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hX **Parameters** ``xa`` XArray. ``index`` Index of **entry**. ``entry`` Entry retrieved from array. ``start`` First index to retrieve from array. **Description** During the iteration, **entry** will have the value of the entry stored in **xa** at **index**. You may modify **index** during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, **entry** will be set to NULL and **index** will have a value less than or equal to max. xa_for_each_start() is O(n.log(n)) while xas_for_each() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each_start() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each() iterator instead. The xas_for_each() iterator will expand into more inline code than xa_for_each_start(). **Context** Any context. Takes and releases the RCU lock.h](h)}(h**Parameters**h]j[)}(hj60h]h Parameters}(hhhj80hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj40ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj00ubj)}(hhh](j)}(h``xa`` XArray. h](j)}(h``xa``h]j4)}(hjU0h]hxa}(hhhjW0hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjS0ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjO0ubj)}(hhh]h)}(hXArray.h]hXArray.}(hjp0hjn0hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjj0hMhjk0ubah}(h]h ]h"]h$]h&]uh1jhjO0ubeh}(h]h ]h"]h$]h&]uh1jhjj0hMhjL0ubj)}(h``index`` Index of **entry**. h](j)}(h ``index``h]j4)}(hj0h]hindex}(hhhj0hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj0ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj0ubj)}(hhh]h)}(hIndex of **entry**.h](h Index of }(h Index of hj0hhhNhNubj[)}(h **entry**h]hentry}(hhhj0hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj0ubh.}(hjhj0hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhj0hMhj0ubah}(h]h ]h"]h$]h&]uh1jhj0ubeh}(h]h ]h"]h$]h&]uh1jhj0hMhjL0ubj)}(h&``entry`` Entry retrieved from array. h](j)}(h ``entry``h]j4)}(hj0h]hentry}(hhhj0hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj0ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj0ubj)}(hhh]h)}(hEntry retrieved from array.h]hEntry retrieved from array.}(hj0hj0hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj0hMhj0ubah}(h]h ]h"]h$]h&]uh1jhj0ubeh}(h]h ]h"]h$]h&]uh1jhj0hMhjL0ubj)}(h.``start`` First index to retrieve from array. h](j)}(h ``start``h]j4)}(hj1h]hstart}(hhhj1hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj1ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj 1ubj)}(hhh]h)}(h#First index to retrieve from array.h]h#First index to retrieve from array.}(hj.1hj,1hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj(1hMhj)1ubah}(h]h ]h"]h$]h&]uh1jhj 1ubeh}(h]h ]h"]h$]h&]uh1jhj(1hMhjL0ubeh}(h]h ]h"]h$]h&]uh1jhj00ubh)}(h**Description**h]j[)}(hjN1h]h Description}(hhhjP1hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjL1ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj00ubh)}(hXeDuring the iteration, **entry** will have the value of the entry stored in **xa** at **index**. You may modify **index** during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, **entry** will be set to NULL and **index** will have a value less than or equal to max.h](hDuring the iteration, }(hDuring the iteration, hjd1hhhNhNubj[)}(h **entry**h]hentry}(hhhjm1hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjd1ubh, will have the value of the entry stored in }(h, will have the value of the entry stored in hjd1hhhNhNubj[)}(h**xa**h]hxa}(hhhj1hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjd1ubh at }(h at hjd1hhhNhNubj[)}(h **index**h]hindex}(hhhj1hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjd1ubh. You may modify }(h. You may modify hjd1hhhNhNubj[)}(h **index**h]hindex}(hhhj1hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjd1ubh during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, }(h during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, hjd1hhhNhNubj[)}(h **entry**h]hentry}(hhhj1hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjd1ubh will be set to NULL and }(h will be set to NULL and hjd1hhhNhNubj[)}(h **index**h]hindex}(hhhj1hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjd1ubh- will have a value less than or equal to max.}(h- will have a value less than or equal to max.hjd1hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj00ubh)}(hXxa_for_each_start() is O(n.log(n)) while xas_for_each() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each_start() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each() iterator instead. The xas_for_each() iterator will expand into more inline code than xa_for_each_start().h]hXxa_for_each_start() is O(n.log(n)) while xas_for_each() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each_start() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each() iterator instead. The xas_for_each() iterator will expand into more inline code than xa_for_each_start().}(hj1hj1hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj00ubh)}(h **Context**h]j[)}(hj1h]hContext}(hhhj1hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj1ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj00ubh)}(h.Any context. Takes and releases the RCU lock.h]h.Any context. Takes and releases the RCU lock.}(hj2hj 2hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj00ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_for_each (C macro) c.xa_for_eachhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h xa_for_eachh]ja)}(h xa_for_eachh]j)}(h xa_for_eachh]j)}(hj62h]h xa_for_each}(hhhj@2hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj<2ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj82hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubah}(h]h ]h"]h$]h&]hhjuh1j`jjhj42hhhjS2hMubah}(h]j/2ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj12hhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hj12hhhjS2hMubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMjm2jNjm2jOuh1jUhhhj3hNhNubh)}(h"``xa_for_each (xa, index, entry)``h]j4)}(hjs2h]hxa_for_each (xa, index, entry)}(hhhju2hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjq2ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj3hhubj !)}(hhh]h)}(h*Iterate over present entries in an XArray.h]h*Iterate over present entries in an XArray.}(hj2hj2hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj2ubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hX**Parameters** ``xa`` XArray. ``index`` Index of **entry**. ``entry`` Entry retrieved from array. **Description** During the iteration, **entry** will have the value of the entry stored in **xa** at **index**. You may modify **index** during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, **entry** will be set to NULL and **index** will have a value less than or equal to max. xa_for_each() is O(n.log(n)) while xas_for_each() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each() iterator instead. The xas_for_each() iterator will expand into more inline code than xa_for_each(). **Context** Any context. Takes and releases the RCU lock.h](h)}(h**Parameters**h]j[)}(hj2h]h Parameters}(hhhj2hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj2ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj2ubj)}(hhh](j)}(h``xa`` XArray. h](j)}(h``xa``h]j4)}(hj2h]hxa}(hhhj2hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj2ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj2ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj2hj2hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj2hMhj2ubah}(h]h ]h"]h$]h&]uh1jhj2ubeh}(h]h ]h"]h$]h&]uh1jhj2hMhj2ubj)}(h``index`` Index of **entry**. h](j)}(h ``index``h]j4)}(hj2h]hindex}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj2ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj2ubj)}(hhh]h)}(hIndex of **entry**.h](h Index of }(h Index of hj3hhhNhNubj[)}(h **entry**h]hentry}(hhhj!3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubh.}(hjhj3hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhj3hMhj3ubah}(h]h ]h"]h$]h&]uh1jhj2ubeh}(h]h ]h"]h$]h&]uh1jhj3hMhj2ubj)}(h&``entry`` Entry retrieved from array. h](j)}(h ``entry``h]j4)}(hjK3h]hentry}(hhhjM3hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjI3ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjE3ubj)}(hhh]h)}(hEntry retrieved from array.h]hEntry retrieved from array.}(hjf3hjd3hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj`3hMhja3ubah}(h]h ]h"]h$]h&]uh1jhjE3ubeh}(h]h ]h"]h$]h&]uh1jhj`3hMhj2ubeh}(h]h ]h"]h$]h&]uh1jhj2ubh)}(h**Description**h]j[)}(hj3h]h Description}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj2ubh)}(hXeDuring the iteration, **entry** will have the value of the entry stored in **xa** at **index**. You may modify **index** during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, **entry** will be set to NULL and **index** will have a value less than or equal to max.h](hDuring the iteration, }(hDuring the iteration, hj3hhhNhNubj[)}(h **entry**h]hentry}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubh, will have the value of the entry stored in }(h, will have the value of the entry stored in hj3hhhNhNubj[)}(h**xa**h]hxa}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubh at }(h at hj3hhhNhNubj[)}(h **index**h]hindex}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubh. You may modify }(h. You may modify hj3hhhNhNubj[)}(h **index**h]hindex}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubh during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, }(h during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, hj3hhhNhNubj[)}(h **entry**h]hentry}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubh will be set to NULL and }(h will be set to NULL and hj3hhhNhNubj[)}(h **index**h]hindex}(hhhj4hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubh- will have a value less than or equal to max.}(h- will have a value less than or equal to max.hj3hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj2ubh)}(hXxa_for_each() is O(n.log(n)) while xas_for_each() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each() iterator instead. The xas_for_each() iterator will expand into more inline code than xa_for_each().h]hXxa_for_each() is O(n.log(n)) while xas_for_each() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each() iterator instead. The xas_for_each() iterator will expand into more inline code than xa_for_each().}(hj 4hj4hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj2ubh)}(h **Context**h]j[)}(hj/4h]hContext}(hhhj14hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj-4ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj2ubh)}(h.Any context. Takes and releases the RCU lock.h]h.Any context. Takes and releases the RCU lock.}(hjG4hjE4hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj2ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_for_each_marked (C macro)c.xa_for_each_markedhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hxa_for_each_markedh]ja)}(hxa_for_each_markedh]j)}(hxa_for_each_markedh]j)}(hjn4h]hxa_for_each_marked}(hhhjx4hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjt4ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjp4hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubah}(h]h ]h"]h$]h&]hhjuh1j`jjhjl4hhhj4hMubah}(h]jg4ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhji4hhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hji4hhhj4hMubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMj4jNj4jOuh1jUhhhj3hNhNubh)}(h1``xa_for_each_marked (xa, index, entry, filter)``h]j4)}(hj4h]h-xa_for_each_marked (xa, index, entry, filter)}(hhhj4hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj4ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj3hhubj !)}(hhh]h)}(h)Iterate over marked entries in an XArray.h]h)Iterate over marked entries in an XArray.}(hj4hj4hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj4ubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hXf**Parameters** ``xa`` XArray. ``index`` Index of **entry**. ``entry`` Entry retrieved from array. ``filter`` Selection criterion. **Description** During the iteration, **entry** will have the value of the entry stored in **xa** at **index**. The iteration will skip all entries in the array which do not match **filter**. You may modify **index** during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, **entry** will be set to NULL and **index** will have a value less than or equal to max. xa_for_each_marked() is O(n.log(n)) while xas_for_each_marked() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each_marked() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each_marked() iterator instead. The xas_for_each_marked() iterator will expand into more inline code than xa_for_each_marked(). **Context** Any context. Takes and releases the RCU lock.h](h)}(h**Parameters**h]j[)}(hj4h]h Parameters}(hhhj4hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj4ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj4ubj)}(hhh](j)}(h``xa`` XArray. h](j)}(h``xa``h]j4)}(hj4h]hxa}(hhhj5hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj4ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj4ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj5hj5hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj5hMhj5ubah}(h]h ]h"]h$]h&]uh1jhj4ubeh}(h]h ]h"]h$]h&]uh1jhj5hMhj4ubj)}(h``index`` Index of **entry**. h](j)}(h ``index``h]j4)}(hj75h]hindex}(hhhj95hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj55ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj15ubj)}(hhh]h)}(hIndex of **entry**.h](h Index of }(h Index of hjP5hhhNhNubj[)}(h **entry**h]hentry}(hhhjY5hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjP5ubh.}(hjhjP5hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhjL5hMhjM5ubah}(h]h ]h"]h$]h&]uh1jhj15ubeh}(h]h ]h"]h$]h&]uh1jhjL5hMhj4ubj)}(h&``entry`` Entry retrieved from array. h](j)}(h ``entry``h]j4)}(hj5h]hentry}(hhhj5hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj5ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}5ubj)}(hhh]h)}(hEntry retrieved from array.h]hEntry retrieved from array.}(hj5hj5hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj5hMhj5ubah}(h]h ]h"]h$]h&]uh1jhj}5ubeh}(h]h ]h"]h$]h&]uh1jhj5hMhj4ubj)}(h ``filter`` Selection criterion. h](j)}(h ``filter``h]j4)}(hj5h]hfilter}(hhhj5hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj5ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj5ubj)}(hhh]h)}(hSelection criterion.h]hSelection criterion.}(hj5hj5hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj5hMhj5ubah}(h]h ]h"]h$]h&]uh1jhj5ubeh}(h]h ]h"]h$]h&]uh1jhj5hMhj4ubeh}(h]h ]h"]h$]h&]uh1jhj4ubh)}(h**Description**h]j[)}(hj5h]h Description}(hhhj5hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj5ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj4ubh)}(hXDuring the iteration, **entry** will have the value of the entry stored in **xa** at **index**. The iteration will skip all entries in the array which do not match **filter**. You may modify **index** during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, **entry** will be set to NULL and **index** will have a value less than or equal to max.h](hDuring the iteration, }(hDuring the iteration, hj 6hhhNhNubj[)}(h **entry**h]hentry}(hhhj6hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj 6ubh, will have the value of the entry stored in }(h, will have the value of the entry stored in hj 6hhhNhNubj[)}(h**xa**h]hxa}(hhhj)6hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj 6ubh at }(h at hj 6hhhNhNubj[)}(h **index**h]hindex}(hhhj<6hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj 6ubhG. The iteration will skip all entries in the array which do not match }(hG. The iteration will skip all entries in the array which do not match hj 6hhhNhNubj[)}(h **filter**h]hfilter}(hhhjO6hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj 6ubh. You may modify }(h. You may modify hj 6hhhNhNubj[)}(h **index**h]hindex}(hhhjb6hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj 6ubh during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, }(h during the iteration if you want to skip or reprocess indices. It is safe to modify the array during the iteration. At the end of the iteration, hj 6hhhNhNubj[)}(h **entry**h]hentry}(hhhju6hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj 6ubh will be set to NULL and }(h will be set to NULL and hj 6hhhNhNubj[)}(h **index**h]hindex}(hhhj6hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj 6ubh- will have a value less than or equal to max.}(h- will have a value less than or equal to max.hj 6hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj4ubh)}(hXxa_for_each_marked() is O(n.log(n)) while xas_for_each_marked() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each_marked() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each_marked() iterator instead. The xas_for_each_marked() iterator will expand into more inline code than xa_for_each_marked().h]hXxa_for_each_marked() is O(n.log(n)) while xas_for_each_marked() is O(n). You have to handle your own locking with xas_for_each(), and if you have to unlock after each iteration, it will also end up being O(n.log(n)). xa_for_each_marked() will spin if it hits a retry entry; if you intend to see retry entries, you should use the xas_for_each_marked() iterator instead. The xas_for_each_marked() iterator will expand into more inline code than xa_for_each_marked().}(hj6hj6hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM hj4ubh)}(h **Context**h]j[)}(hj6h]hContext}(hhhj6hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj6ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj4ubh)}(h.Any context. Takes and releases the RCU lock.h]h.Any context. Takes and releases the RCU lock.}(hj6hj6hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj4ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_store_bh (C function) c.xa_store_bhhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hSvoid * xa_store_bh (struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h]ja)}(hQvoid *xa_store_bh(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](jg)}(hvoidh]hvoid}(hhhj6hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj6hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMAubjy)}(h h]h }(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj6hhhj7hMAubj)}(hj(h]h*}(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj6hhhj7hMAubj)}(h xa_store_bhh]j)}(h xa_store_bhh]h xa_store_bh}(hhhj&7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj"7ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj6hhhj7hMAubj)}(h@(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjB7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj>7ubjy)}(h h]h }(hhhjO7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj>7ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj`7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj]7ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjb7modnameN classnameNj%j%)}j%]j%)}j%j(7sb c.xa_store_bhasbuh1hhj>7ubjy)}(h h]h }(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj>7ubj)}(hj(h]h*}(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj>7ubj)}(hxah]hxa}(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj>7ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj:7ubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhj7hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj7ubjy)}(h h]h }(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj7ubjg)}(hlongh]hlong}(hhhj7hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj7ubjy)}(h h]h }(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj7ubj)}(hindexh]hindex}(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj7ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj:7ubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhj8hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj8ubjy)}(h h]h }(hhhj8hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj8ubj)}(hj(h]h*}(hhhj!8hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj8ubj)}(hentryh]hentry}(hhhj.8hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj8ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj:7ubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhjJ8hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjG8ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjL8modnameN classnameNj%j%)}j%]j|7 c.xa_store_bhasbuh1hhjC8ubjy)}(h h]h }(hhhjh8hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjC8ubj)}(hgfph]hgfp}(hhhjv8hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjC8ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj:7ubeh}(h]h ]h"]h$]h&]hhuh1jhj6hhhj7hMAubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj6hhhj7hMAubah}(h]j6ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMMhj6hhubj+)}(hhh]h)}(hStore this entry in the XArray.h]hStore this entry in the XArray.}(hj8hj8hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM@hj8hhubah}(h]h ]h"]h$]h&]uh1j*hj6hhhj7hMAubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj8jNj8jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. ``void *entry`` New entry. ``gfp_t gfp`` Memory allocation flags. **Description** This function is like calling xa_store() except it disables softirqs while holding the array lock. **Context** Any context. Takes and releases the xa_lock while disabling softirqs. **Return** The old entry at this index or xa_err() if an error happened.h](h)}(h**Parameters**h]j[)}(hj8h]h Parameters}(hhhj8hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj8ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMDhj8ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hj8h]hstruct xarray *xa}(hhhj8hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj8ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMAhj8ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj8hj8hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj8hMAhj8ubah}(h]h ]h"]h$]h&]uh1jhj8ubeh}(h]h ]h"]h$]h&]uh1jhj8hMAhj8ubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hj9h]hunsigned long index}(hhhj9hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj9ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMBhj9ubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hj69hj49hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj09hMBhj19ubah}(h]h ]h"]h$]h&]uh1jhj9ubeh}(h]h ]h"]h$]h&]uh1jhj09hMBhj8ubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hjT9h]h void *entry}(hhhjV9hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjR9ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMChjN9ubj)}(hhh]h)}(h New entry.h]h New entry.}(hjo9hjm9hhhNhNubah}(h]h ]h"]h$]h&]uh1hhji9hMChjj9ubah}(h]h ]h"]h$]h&]uh1jhjN9ubeh}(h]h ]h"]h$]h&]uh1jhji9hMChj8ubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hj9h]h gfp_t gfp}(hhhj9hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj9ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMDhj9ubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hj9hj9hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj9hMDhj9ubah}(h]h ]h"]h$]h&]uh1jhj9ubeh}(h]h ]h"]h$]h&]uh1jhj9hMDhj8ubeh}(h]h ]h"]h$]h&]uh1jhj8ubh)}(h**Description**h]j[)}(hj9h]h Description}(hhhj9hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj9ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMFhj8ubh)}(hbThis function is like calling xa_store() except it disables softirqs while holding the array lock.h]hbThis function is like calling xa_store() except it disables softirqs while holding the array lock.}(hj9hj9hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMFhj8ubh)}(h **Context**h]j[)}(hj9h]hContext}(hhhj9hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj9ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMIhj8ubh)}(hFAny context. Takes and releases the xa_lock while disabling softirqs.h]hFAny context. Takes and releases the xa_lock while disabling softirqs.}(hj:hj:hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMIhj8ubh)}(h **Return**h]j[)}(hj:h]hReturn}(hhhj:hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj:ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMLhj8ubh)}(h=The old entry at this index or xa_err() if an error happened.h]h=The old entry at this index or xa_err() if an error happened.}(hj.:hj,:hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMKhj8ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_store_irq (C function)c.xa_store_irqhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hTvoid * xa_store_irq (struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h]ja)}(hRvoid *xa_store_irq(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](jg)}(hvoidh]hvoid}(hhhj[:hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjW:hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM\ubjy)}(h h]h }(hhhjj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjW:hhhji:hM\ubj)}(hj(h]h*}(hhhjx:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjW:hhhji:hM\ubj)}(h xa_store_irqh]j)}(h xa_store_irqh]h xa_store_irq}(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj:ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjW:hhhji:hM\ubj)}(h@(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj:ubjy)}(h h]h }(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj:ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj:ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj:modnameN classnameNj%j%)}j%]j%)}j%j:sbc.xa_store_irqasbuh1hhj:ubjy)}(h h]h }(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj:ubj)}(hj(h]h*}(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj:ubj)}(hxah]hxa}(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj:ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj:ubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhj;hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj;ubjy)}(h h]h }(hhhj%;hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj;ubjg)}(hlongh]hlong}(hhhj3;hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj;ubjy)}(h h]h }(hhhjA;hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj;ubj)}(hindexh]hindex}(hhhjO;hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj;ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj:ubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjh;hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjd;ubjy)}(h h]h }(hhhjv;hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjd;ubj)}(hj(h]h*}(hhhj;hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjd;ubj)}(hentryh]hentry}(hhhj;hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjd;ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj:ubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhj;hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj;ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj;modnameN classnameNj%j%)}j%]j:c.xa_store_irqasbuh1hhj;ubjy)}(h h]h }(hhhj;hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj;ubj)}(hgfph]hgfp}(hhhj;hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj;ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj:ubeh}(h]h ]h"]h$]h&]hhuh1jhjW:hhhji:hM\ubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjS:hhhji:hM\ubah}(h]jN:ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhhjP:hhubj+)}(hhh]h)}(hStore this entry in the XArray.h]hStore this entry in the XArray.}(hj<hj<hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM[hj<hhubah}(h]h ]h"]h$]h&]uh1j*hjP:hhhji:hM\ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj<jNj<jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. ``void *entry`` New entry. ``gfp_t gfp`` Memory allocation flags. **Description** This function is like calling xa_store() except it disables interrupts while holding the array lock. **Context** Process context. Takes and releases the xa_lock while disabling interrupts. **Return** The old entry at this index or xa_err() if an error happened.h](h)}(h**Parameters**h]j[)}(hj&<h]h Parameters}(hhhj(<hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj$<ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM_hj <ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjE<h]hstruct xarray *xa}(hhhjG<hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjC<ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM\hj?<ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj`<hj^<hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjZ<hM\hj[<ubah}(h]h ]h"]h$]h&]uh1jhj?<ubeh}(h]h ]h"]h$]h&]uh1jhjZ<hM\hj<<ubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hj~<h]hunsigned long index}(hhhj<hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj|<ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM]hjx<ubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hj<hj<hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj<hM]hj<ubah}(h]h ]h"]h$]h&]uh1jhjx<ubeh}(h]h ]h"]h$]h&]uh1jhj<hM]hj<<ubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hj<h]h void *entry}(hhhj<hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj<ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM^hj<ubj)}(hhh]h)}(h New entry.h]h New entry.}(hj<hj<hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj<hM^hj<ubah}(h]h ]h"]h$]h&]uh1jhj<ubeh}(h]h ]h"]h$]h&]uh1jhj<hM^hj<<ubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hj<h]h gfp_t gfp}(hhhj<hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj<ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM_hj<ubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hj =hj =hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj=hM_hj=ubah}(h]h ]h"]h$]h&]uh1jhj<ubeh}(h]h ]h"]h$]h&]uh1jhj=hM_hj<<ubeh}(h]h ]h"]h$]h&]uh1jhj <ubh)}(h**Description**h]j[)}(hj+=h]h Description}(hhhj-=hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj)=ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMahj <ubh)}(hdThis function is like calling xa_store() except it disables interrupts while holding the array lock.h]hdThis function is like calling xa_store() except it disables interrupts while holding the array lock.}(hjC=hjA=hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMahj <ubh)}(h **Context**h]j[)}(hjR=h]hContext}(hhhjT=hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjP=ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMdhj <ubh)}(hLProcess context. Takes and releases the xa_lock while disabling interrupts.h]hLProcess context. Takes and releases the xa_lock while disabling interrupts.}(hjj=hjh=hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMdhj <ubh)}(h **Return**h]j[)}(hjy=h]hReturn}(hhhj{=hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjw=ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMghj <ubh)}(h=The old entry at this index or xa_err() if an error happened.h]h=The old entry at this index or xa_err() if an error happened.}(hj=hj=hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMfhj <ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_erase_bh (C function) c.xa_erase_bhhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h;void * xa_erase_bh (struct xarray *xa, unsigned long index)h]ja)}(h9void *xa_erase_bh(struct xarray *xa, unsigned long index)h](jg)}(hvoidh]hvoid}(hhhj=hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj=hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMwubjy)}(h h]h }(hhhj=hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj=hhhj=hMwubj)}(hj(h]h*}(hhhj=hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj=hhhj=hMwubj)}(h xa_erase_bhh]j)}(h xa_erase_bhh]h xa_erase_bh}(hhhj=hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj=ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj=hhhj=hMwubj)}(h((struct xarray *xa, unsigned long index)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhj>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj>ubjy)}(h h]h }(hhhj>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj>ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj&>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj#>ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj(>modnameN classnameNj%j%)}j%]j%)}j%j=sb c.xa_erase_bhasbuh1hhj>ubjy)}(h h]h }(hhhjF>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj>ubj)}(hj(h]h*}(hhhjT>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj>ubj)}(hxah]hxa}(hhhja>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj>ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj>ubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjz>hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjv>ubjy)}(h h]h }(hhhj>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjv>ubjg)}(hlongh]hlong}(hhhj>hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjv>ubjy)}(h h]h }(hhhj>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjv>ubj)}(hindexh]hindex}(hhhj>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjv>ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj>ubeh}(h]h ]h"]h$]h&]hhuh1jhj=hhhj=hMwubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj=hhhj=hMwubah}(h]j=ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj=hhubj+)}(hhh]h)}(h!Erase this entry from the XArray.h]h!Erase this entry from the XArray.}(hj>hj>hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMvhj>hhubah}(h]h ]h"]h$]h&]uh1j*hj=hhhj=hMwubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj>jNj>jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index of entry. **Description** After this function returns, loading from **index** will return ``NULL``. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry. **Context** Any context. Takes and releases the xa_lock while disabling softirqs. **Return** The entry which used to be at this index.h](h)}(h**Parameters**h]j[)}(hj>h]h Parameters}(hhhj?hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj>ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMzhj>ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hj?h]hstruct xarray *xa}(hhhj ?hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj?ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMwhj?ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj9?hj7?hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj3?hMwhj4?ubah}(h]h ]h"]h$]h&]uh1jhj?ubeh}(h]h ]h"]h$]h&]uh1jhj3?hMwhj?ubj)}(h(``unsigned long index`` Index of entry. h](j)}(h``unsigned long index``h]j4)}(hjW?h]hunsigned long index}(hhhjY?hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjU?ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMxhjQ?ubj)}(hhh]h)}(hIndex of entry.h]hIndex of entry.}(hjr?hjp?hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjl?hMxhjm?ubah}(h]h ]h"]h$]h&]uh1jhjQ?ubeh}(h]h ]h"]h$]h&]uh1jhjl?hMxhj?ubeh}(h]h ]h"]h$]h&]uh1jhj>ubh)}(h**Description**h]j[)}(hj?h]h Description}(hhhj?hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj?ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMzhj>ubh)}(hAfter this function returns, loading from **index** will return ``NULL``. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry.h](h*After this function returns, loading from }(h*After this function returns, loading from hj?hhhNhNubj[)}(h **index**h]hindex}(hhhj?hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj?ubh will return }(h will return hj?hhhNhNubj4)}(h``NULL``h]hNULL}(hhhj?hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj?ubh. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry.}(h. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry.hj?hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMzhj>ubh)}(h **Context**h]j[)}(hj?h]hContext}(hhhj?hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj?ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM~hj>ubh)}(hFAny context. Takes and releases the xa_lock while disabling softirqs.h]hFAny context. Takes and releases the xa_lock while disabling softirqs.}(hj?hj?hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM~hj>ubh)}(h **Return**h]j[)}(hj@h]hReturn}(hhhj @hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj@ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj>ubh)}(h)The entry which used to be at this index.h]h)The entry which used to be at this index.}(hj@hj@hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj>ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_erase_irq (C function)c.xa_erase_irqhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hJhMhj?Jubah}(h]h ]h"]h$]h&]uh1jhj#Jubeh}(h]h ]h"]h$]h&]uh1jhj>JhMhjTubj)}(hhh]h)}(hXArray.h]hXArray.}(hj_Thj]ThhhNhNubah}(h]h ]h"]h$]h&]uh1hhjYThMhjZTubah}(h]h ]h"]h$]h&]uh1jhj>Tubeh}(h]h ]h"]h$]h&]uh1jhjYThMhj;Tubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hj}Th]hunsigned long index}(hhhjThhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj{Tubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjwTubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hjThjThhhNhNubah}(h]h ]h"]h$]h&]uh1hhjThMhjTubah}(h]h ]h"]h$]h&]uh1jhjwTubeh}(h]h ]h"]h$]h&]uh1jhjThMhj;Tubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hjTh]h void *entry}(hhhjThhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjTubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjTubj)}(hhh]h)}(h New entry.h]h New entry.}(hjThjThhhNhNubah}(h]h ]h"]h$]h&]uh1hhjThMhjTubah}(h]h ]h"]h$]h&]uh1jhjTubeh}(h]h ]h"]h$]h&]uh1jhjThMhj;Tubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjTh]h gfp_t gfp}(hhhjThhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjTubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjTubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hj UhjUhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjUhMhjUubah}(h]h ]h"]h$]h&]uh1jhjTubeh}(h]h ]h"]h$]h&]uh1jhjUhMhj;Tubeh}(h]h ]h"]h$]h&]uh1jhjTubh)}(h**Description**h]j[)}(hj*Uh]h Description}(hhhj,UhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj(Uubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjTubh)}(hInserting a NULL entry will store a reserved entry (like xa_reserve()) if no entry is present. Inserting will fail if a reserved entry is present, even though loading from this index will return NULL.h]hInserting a NULL entry will store a reserved entry (like xa_reserve()) if no entry is present. Inserting will fail if a reserved entry is present, even though loading from this index will return NULL.}(hjBUhj@UhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjTubh)}(h **Context**h]j[)}(hjQUh]hContext}(hhhjSUhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjOUubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM#hjTubh)}(hnAny context. Takes and releases the xa_lock while disabling softirqs. May sleep if the **gfp** flags permit.h](hYAny context. Takes and releases the xa_lock while disabling softirqs. May sleep if the }(hYAny context. Takes and releases the xa_lock while disabling softirqs. May sleep if the hjgUhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjpUhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjgUubh flags permit.}(h flags permit.hjgUhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM#hjTubh)}(h **Return**h]j[)}(hjUh]hReturn}(hhhjUhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjUubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM&hjTubh)}(hi0 if the store succeeded. -EBUSY if another entry was present. -ENOMEM if memory could not be allocated.h]hi0 if the store succeeded. -EBUSY if another entry was present. -ENOMEM if memory could not be allocated.}(hjUhjUhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM%hjTubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_insert_irq (C function)c.xa_insert_irqhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hRint xa_insert_irq (struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h]ja)}(hQint xa_insert_irq(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](jg)}(hinth]hint}(hhhjUhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjUhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM7ubjy)}(h h]h }(hhhjUhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjUhhhjUhM7ubj)}(h xa_insert_irqh]j)}(h xa_insert_irqh]h xa_insert_irq}(hhhjUhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjUubah}(h]h ](jjeh"]h$]h&]hhuh1jhjUhhhjUhM7ubj)}(h@(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj Vubjy)}(h h]h }(hhhjVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj Vubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj,VhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj)Vubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj.VmodnameN classnameNj%j%)}j%]j%)}j%jUsbc.xa_insert_irqasbuh1hhj Vubjy)}(h h]h }(hhhjLVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj Vubj)}(hj(h]h*}(hhhjZVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj Vubj)}(hxah]hxa}(hhhjgVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj Vubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjVubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjVhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj|Vubjy)}(h h]h }(hhhjVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj|Vubjg)}(hlongh]hlong}(hhhjVhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj|Vubjy)}(h h]h }(hhhjVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj|Vubj)}(hindexh]hindex}(hhhjVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj|Vubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjVubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjVhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjVubjy)}(h h]h }(hhhjVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjVubj)}(hj(h]h*}(hhhjVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjVubj)}(hentryh]hentry}(hhhjVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjVubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjVubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhjWhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjWubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjWmodnameN classnameNj%j%)}j%]jHVc.xa_insert_irqasbuh1hhjWubjy)}(h h]h }(hhhj4WhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjWubj)}(hgfph]hgfp}(hhhjBWhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjWubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjVubeh}(h]h ]h"]h$]h&]hhuh1jhjUhhhjUhM7ubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjUhhhjUhM7ubah}(h]jUah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMFhjUhhubj+)}(hhh]h)}(hGStore this entry in the XArray unless another entry is already present.h]hGStore this entry in the XArray unless another entry is already present.}(hjoWhjmWhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM6hjjWhhubah}(h]h ]h"]h$]h&]uh1j*hjUhhhjUhM7ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjWjNjWjOuh1jUhhhj3hNhNubjQ)}(hXz**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. ``void *entry`` New entry. ``gfp_t gfp`` Memory allocation flags. **Description** Inserting a NULL entry will store a reserved entry (like xa_reserve()) if no entry is present. Inserting will fail if a reserved entry is present, even though loading from this index will return NULL. **Context** Process context. Takes and releases the xa_lock while disabling interrupts. May sleep if the **gfp** flags permit. **Return** 0 if the store succeeded. -EBUSY if another entry was present. -ENOMEM if memory could not be allocated.h](h)}(h**Parameters**h]j[)}(hjWh]h Parameters}(hhhjWhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjWubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM:hjWubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjWh]hstruct xarray *xa}(hhhjWhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjWubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM8hjWubj)}(hhh]h)}(hXArray.h]hXArray.}(hjWhjWhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjWhM8hjWubah}(h]h ]h"]h$]h&]uh1jhjWubeh}(h]h ]h"]h$]h&]uh1jhjWhM8hjWubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hjWh]hunsigned long index}(hhhjWhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjWubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM9hjWubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hjXhjXhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjWhM9hjWubah}(h]h ]h"]h$]h&]uh1jhjWubeh}(h]h ]h"]h$]h&]uh1jhjWhM9hjWubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hj Xh]h void *entry}(hhhj"XhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjXubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM:hjXubj)}(hhh]h)}(h New entry.h]h New entry.}(hj;Xhj9XhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj5XhM:hj6Xubah}(h]h ]h"]h$]h&]uh1jhjXubeh}(h]h ]h"]h$]h&]uh1jhj5XhM:hjWubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjYXh]h gfp_t gfp}(hhhj[XhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjWXubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM;hjSXubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjtXhjrXhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjnXhM;hjoXubah}(h]h ]h"]h$]h&]uh1jhjSXubeh}(h]h ]h"]h$]h&]uh1jhjnXhM;hjWubeh}(h]h ]h"]h$]h&]uh1jhjWubh)}(h**Description**h]j[)}(hjXh]h Description}(hhhjXhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjXubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM=hjWubh)}(hInserting a NULL entry will store a reserved entry (like xa_reserve()) if no entry is present. Inserting will fail if a reserved entry is present, even though loading from this index will return NULL.h]hInserting a NULL entry will store a reserved entry (like xa_reserve()) if no entry is present. Inserting will fail if a reserved entry is present, even though loading from this index will return NULL.}(hjXhjXhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM=hjWubh)}(h **Context**h]j[)}(hjXh]hContext}(hhhjXhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjXubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMAhjWubh)}(htProcess context. Takes and releases the xa_lock while disabling interrupts. May sleep if the **gfp** flags permit.h](h_Process context. Takes and releases the xa_lock while disabling interrupts. May sleep if the }(h_Process context. Takes and releases the xa_lock while disabling interrupts. May sleep if the hjXhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjXhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjXubh flags permit.}(h flags permit.hjXhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMAhjWubh)}(h **Return**h]j[)}(hjXh]hReturn}(hhhjXhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjXubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMDhjWubh)}(hi0 if the store succeeded. -EBUSY if another entry was present. -ENOMEM if memory could not be allocated.h]hi0 if the store succeeded. -EBUSY if another entry was present. -ENOMEM if memory could not be allocated.}(hjYhj YhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMChjWubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_alloc (C function) c.xa_allochNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hXint xa_alloc (struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp)h]ja)}(hWint xa_alloc(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp)h](jg)}(hinth]hint}(hhhj;YhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj7YhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMUubjy)}(h h]h }(hhhjJYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj7YhhhjIYhMUubj)}(hxa_alloch]j)}(hxa_alloch]hxa_alloc}(hhhj\YhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjXYubah}(h]h ](jjeh"]h$]h&]hhuh1jhj7YhhhjIYhMUubj)}(hK(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjxYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjtYubjy)}(h h]h }(hhhjYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjtYubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjYubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjYmodnameN classnameNj%j%)}j%]j%)}j%j^Ysb c.xa_allocasbuh1hhjtYubjy)}(h h]h }(hhhjYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjtYubj)}(hj(h]h*}(hhhjYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjtYubj)}(hxah]hxa}(hhhjYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjtYubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjpYubj)}(hu32 *idh](h)}(hhh]j)}(hu32h]hu32}(hhhjYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjYubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjYmodnameN classnameNj%j%)}j%]jY c.xa_allocasbuh1hhjYubjy)}(h h]h }(hhhj ZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjYubj)}(hj(h]h*}(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjYubj)}(hidh]hid}(hhhj&ZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjYubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjpYubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhj?ZhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj;Zubjy)}(h h]h }(hhhjMZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj;Zubj)}(hj(h]h*}(hhhj[ZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj;Zubj)}(hentryh]hentry}(hhhjhZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj;Zubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjpYubj)}(hstruct xa_limit limith](jz)}(hjh]hstruct}(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj}Zubjy)}(h h]h }(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj}Zubh)}(hhh]j)}(hxa_limith]hxa_limit}(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjZubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjZmodnameN classnameNj%j%)}j%]jY c.xa_allocasbuh1hhj}Zubjy)}(h h]h }(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj}Zubj)}(hlimith]hlimit}(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj}Zubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjpYubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjZubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjZmodnameN classnameNj%j%)}j%]jY c.xa_allocasbuh1hhjZubjy)}(h h]h }(hhhj[hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjZubj)}(hgfph]hgfp}(hhhj[hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjZubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjpYubeh}(h]h ]h"]h$]h&]hhuh1jhj7YhhhjIYhMUubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj3YhhhjIYhMUubah}(h]j.Yah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMghj0Yhhubj+)}(hhh]h)}(h1Find somewhere to store this entry in the XArray.h]h1Find somewhere to store this entry in the XArray.}(hj@[hj>[hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMThj;[hhubah}(h]h ]h"]h$]h&]uh1j*hj0YhhhjIYhMUubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjV[jNjV[jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``u32 *id`` Pointer to ID. ``void *entry`` New entry. ``struct xa_limit limit`` Range of ID to allocate. ``gfp_t gfp`` Memory allocation flags. **Description** Finds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**. Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags(). **Context** Any context. Takes and releases the xa_lock. May sleep if the **gfp** flags permit. **Return** 0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](h)}(h**Parameters**h]j[)}(hj`[h]h Parameters}(hhhjb[hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj^[ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMXhjZ[ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hj[h]hstruct xarray *xa}(hhhj[hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj}[ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMUhjy[ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj[hj[hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj[hMUhj[ubah}(h]h ]h"]h$]h&]uh1jhjy[ubeh}(h]h ]h"]h$]h&]uh1jhj[hMUhjv[ubj)}(h``u32 *id`` Pointer to ID. h](j)}(h ``u32 *id``h]j4)}(hj[h]hu32 *id}(hhhj[hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj[ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMVhj[ubj)}(hhh]h)}(hPointer to ID.h]hPointer to ID.}(hj[hj[hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj[hMVhj[ubah}(h]h ]h"]h$]h&]uh1jhj[ubeh}(h]h ]h"]h$]h&]uh1jhj[hMVhjv[ubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hj[h]h void *entry}(hhhj[hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj[ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMWhj[ubj)}(hhh]h)}(h New entry.h]h New entry.}(hj \hj \hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj\hMWhj\ubah}(h]h ]h"]h$]h&]uh1jhj[ubeh}(h]h ]h"]h$]h&]uh1jhj\hMWhjv[ubj)}(h3``struct xa_limit limit`` Range of ID to allocate. h](j)}(h``struct xa_limit limit``h]j4)}(hj*\h]hstruct xa_limit limit}(hhhj,\hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj(\ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMXhj$\ubj)}(hhh]h)}(hRange of ID to allocate.h]hRange of ID to allocate.}(hjE\hjC\hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj?\hMXhj@\ubah}(h]h ]h"]h$]h&]uh1jhj$\ubeh}(h]h ]h"]h$]h&]uh1jhj?\hMXhjv[ubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjc\h]h gfp_t gfp}(hhhje\hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hja\ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMYhj]\ubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hj~\hj|\hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjx\hMYhjy\ubah}(h]h ]h"]h$]h&]uh1jhj]\ubeh}(h]h ]h"]h$]h&]uh1jhjx\hMYhjv[ubeh}(h]h ]h"]h$]h&]uh1jhjZ[ubh)}(h**Description**h]j[)}(hj\h]h Description}(hhhj\hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj\ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM[hjZ[ubh)}(hFinds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**.h](hFinds an empty entry in }(hFinds an empty entry in hj\hhhNhNubj[)}(h**xa**h]hxa}(hhhj\hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj\ubh between }(h between hj\hhhNhNubj[)}(h **limit.min**h]h limit.min}(hhhj\hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj\ubh and }(h and hj\hhhNhNubj[)}(h **limit.max**h]h limit.max}(hhhj\hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj\ubh, stores the index into the }(h, stores the index into the hj\hhhNhNubj[)}(h**id**h]hid}(hhhj\hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj\ubhb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised }(hb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised hj\hhhNhNubj[)}(h**id**h]hid}(hhhj ]hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj\ubh.}(hjhj\hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM[hjZ[ubh)}(h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().h]h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().}(hj$]hj"]hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM_hjZ[ubh)}(h **Context**h]j[)}(hj3]h]hContext}(hhhj5]hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj1]ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMbhjZ[ubh)}(hUAny context. Takes and releases the xa_lock. May sleep if the **gfp** flags permit.h](h@Any context. Takes and releases the xa_lock. May sleep if the }(h@Any context. Takes and releases the xa_lock. May sleep if the hjI]hhhNhNubj[)}(h**gfp**h]hgfp}(hhhjR]hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjI]ubh flags permit.}(h flags permit.hjI]hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMbhjZ[ubh)}(h **Return**h]j[)}(hjn]h]hReturn}(hhhjp]hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjl]ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMehjZ[ubh)}(hk0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](ha0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in }(ha0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in hj]hhhNhNubj[)}(h **limit**h]hlimit}(hhhj]hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj]ubh.}(hjhj]hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMdhjZ[ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_alloc_bh (C function) c.xa_alloc_bhhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h[int xa_alloc_bh (struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp)h]ja)}(hZint xa_alloc_bh(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp)h](jg)}(hinth]hint}(hhhj]hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj]hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMvubjy)}(h h]h }(hhhj]hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj]hhhj]hMvubj)}(h xa_alloc_bhh]j)}(h xa_alloc_bhh]h xa_alloc_bh}(hhhj]hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj]ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj]hhhj]hMvubj)}(hK(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj]ubjy)}(h h]h }(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj]ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj!^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj^ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj#^modnameN classnameNj%j%)}j%]j%)}j%j]sb c.xa_alloc_bhasbuh1hhj]ubjy)}(h h]h }(hhhjA^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj]ubj)}(hj(h]h*}(hhhjO^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj]ubj)}(hxah]hxa}(hhhj\^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj]ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj]ubj)}(hu32 *idh](h)}(hhh]j)}(hu32h]hu32}(hhhjx^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhju^ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjz^modnameN classnameNj%j%)}j%]j=^ c.xa_alloc_bhasbuh1hhjq^ubjy)}(h h]h }(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjq^ubj)}(hj(h]h*}(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjq^ubj)}(hidh]hid}(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjq^ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj]ubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhj^hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj^ubjy)}(h h]h }(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj^ubj)}(hj(h]h*}(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj^ubj)}(hentryh]hentry}(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj^ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj]ubj)}(hstruct xa_limit limith](jz)}(hjh]hstruct}(hhhj _hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj_ubjy)}(h h]h }(hhhj_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj_ubh)}(hhh]j)}(hxa_limith]hxa_limit}(hhhj*_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj'_ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj,_modnameN classnameNj%j%)}j%]j=^ c.xa_alloc_bhasbuh1hhj_ubjy)}(h h]h }(hhhjH_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj_ubj)}(hlimith]hlimit}(hhhjV_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj_ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj]ubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhjr_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjo_ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjt_modnameN classnameNj%j%)}j%]j=^ c.xa_alloc_bhasbuh1hhjk_ubjy)}(h h]h }(hhhj_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjk_ubj)}(hgfph]hgfp}(hhhj_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjk_ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj]ubeh}(h]h ]h"]h$]h&]hhuh1jhj]hhhj]hMvubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj]hhhj]hMvubah}(h]j]ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj]hhubj+)}(hhh]h)}(h1Find somewhere to store this entry in the XArray.h]h1Find somewhere to store this entry in the XArray.}(hj_hj_hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMuhj_hhubah}(h]h ]h"]h$]h&]uh1j*hj]hhhj]hMvubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj_jNj_jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``u32 *id`` Pointer to ID. ``void *entry`` New entry. ``struct xa_limit limit`` Range of ID to allocate. ``gfp_t gfp`` Memory allocation flags. **Description** Finds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**. Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags(). **Context** Any context. Takes and releases the xa_lock while disabling softirqs. May sleep if the **gfp** flags permit. **Return** 0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](h)}(h**Parameters**h]j[)}(hj_h]h Parameters}(hhhj_hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj_ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMyhj_ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hj `h]hstruct xarray *xa}(hhhj `hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj`ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMvhj`ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj%`hj#`hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj`hMvhj `ubah}(h]h ]h"]h$]h&]uh1jhj`ubeh}(h]h ]h"]h$]h&]uh1jhj`hMvhj`ubj)}(h``u32 *id`` Pointer to ID. h](j)}(h ``u32 *id``h]j4)}(hjC`h]hu32 *id}(hhhjE`hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjA`ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMwhj=`ubj)}(hhh]h)}(hPointer to ID.h]hPointer to ID.}(hj^`hj\`hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjX`hMwhjY`ubah}(h]h ]h"]h$]h&]uh1jhj=`ubeh}(h]h ]h"]h$]h&]uh1jhjX`hMwhj`ubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hj|`h]h void *entry}(hhhj~`hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjz`ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMxhjv`ubj)}(hhh]h)}(h New entry.h]h New entry.}(hj`hj`hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj`hMxhj`ubah}(h]h ]h"]h$]h&]uh1jhjv`ubeh}(h]h ]h"]h$]h&]uh1jhj`hMxhj`ubj)}(h3``struct xa_limit limit`` Range of ID to allocate. h](j)}(h``struct xa_limit limit``h]j4)}(hj`h]hstruct xa_limit limit}(hhhj`hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj`ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMyhj`ubj)}(hhh]h)}(hRange of ID to allocate.h]hRange of ID to allocate.}(hj`hj`hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj`hMyhj`ubah}(h]h ]h"]h$]h&]uh1jhj`ubeh}(h]h ]h"]h$]h&]uh1jhj`hMyhj`ubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hj`h]h gfp_t gfp}(hhhj`hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj`ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMzhj`ubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hj ahjahhhNhNubah}(h]h ]h"]h$]h&]uh1hhjahMzhjaubah}(h]h ]h"]h$]h&]uh1jhj`ubeh}(h]h ]h"]h$]h&]uh1jhjahMzhj`ubeh}(h]h ]h"]h$]h&]uh1jhj_ubh)}(h**Description**h]j[)}(hj)ah]h Description}(hhhj+ahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj'aubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM|hj_ubh)}(hFinds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**.h](hFinds an empty entry in }(hFinds an empty entry in hj?ahhhNhNubj[)}(h**xa**h]hxa}(hhhjHahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj?aubh between }(h between hj?ahhhNhNubj[)}(h **limit.min**h]h limit.min}(hhhj[ahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj?aubh and }(h and hj?ahhhNhNubj[)}(h **limit.max**h]h limit.max}(hhhjnahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj?aubh, stores the index into the }(h, stores the index into the hj?ahhhNhNubj[)}(h**id**h]hid}(hhhjahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj?aubhb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised }(hb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised hj?ahhhNhNubj[)}(h**id**h]hid}(hhhjahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj?aubh.}(hjhj?ahhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM|hj_ubh)}(h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().h]h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().}(hjahjahhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj_ubh)}(h **Context**h]j[)}(hjah]hContext}(hhhjahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjaubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj_ubh)}(hnAny context. Takes and releases the xa_lock while disabling softirqs. May sleep if the **gfp** flags permit.h](hYAny context. Takes and releases the xa_lock while disabling softirqs. May sleep if the }(hYAny context. Takes and releases the xa_lock while disabling softirqs. May sleep if the hjahhhNhNubj[)}(h**gfp**h]hgfp}(hhhjahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjaubh flags permit.}(h flags permit.hjahhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj_ubh)}(h **Return**h]j[)}(hjah]hReturn}(hhhjahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjaubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj_ubh)}(hk0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](ha0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in }(ha0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in hjbhhhNhNubj[)}(h **limit**h]hlimit}(hhhjbhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjbubh.}(hjhjbhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj_ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_alloc_irq (C function)c.xa_alloc_irqhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h\int xa_alloc_irq (struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp)h]ja)}(h[int xa_alloc_irq(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp)h](jg)}(hinth]hint}(hhhjQbhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjMbhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhj`bhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjMbhhhj_bhMubj)}(h xa_alloc_irqh]j)}(h xa_alloc_irqh]h xa_alloc_irq}(hhhjrbhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjnbubah}(h]h ](jjeh"]h$]h&]hhuh1jhjMbhhhj_bhMubj)}(hK(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjbhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjbubjy)}(h h]h }(hhhjbhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjbubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjbhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjbubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjbmodnameN classnameNj%j%)}j%]j%)}j%jtbsbc.xa_alloc_irqasbuh1hhjbubjy)}(h h]h }(hhhjbhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjbubj)}(hj(h]h*}(hhhjbhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjbubj)}(hxah]hxa}(hhhjbhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjbubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjbubj)}(hu32 *idh](h)}(hhh]j)}(hu32h]hu32}(hhhjchhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjcubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjcmodnameN classnameNj%j%)}j%]jbc.xa_alloc_irqasbuh1hhjbubjy)}(h h]h }(hhhj!chhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjbubj)}(hj(h]h*}(hhhj/chhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjbubj)}(hidh]hid}(hhhjeubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj:eubj)}(hhh]h)}(hRange of ID to allocate.h]hRange of ID to allocate.}(hj[ehjYehhhNhNubah}(h]h ]h"]h$]h&]uh1hhjUehMhjVeubah}(h]h ]h"]h$]h&]uh1jhj:eubeh}(h]h ]h"]h$]h&]uh1jhjUehMhjdubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjyeh]h gfp_t gfp}(hhhj{ehhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjweubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjseubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjehjehhhNhNubah}(h]h ]h"]h$]h&]uh1hhjehMhjeubah}(h]h ]h"]h$]h&]uh1jhjseubeh}(h]h ]h"]h$]h&]uh1jhjehMhjdubeh}(h]h ]h"]h$]h&]uh1jhjpdubh)}(h**Description**h]j[)}(hjeh]h Description}(hhhjehhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjeubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjpdubh)}(hFinds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**.h](hFinds an empty entry in }(hFinds an empty entry in hjehhhNhNubj[)}(h**xa**h]hxa}(hhhjehhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjeubh between }(h between hjehhhNhNubj[)}(h **limit.min**h]h limit.min}(hhhjehhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjeubh and }(h and hjehhhNhNubj[)}(h **limit.max**h]h limit.max}(hhhjehhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjeubh, stores the index into the }(h, stores the index into the hjehhhNhNubj[)}(h**id**h]hid}(hhhj fhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjeubhb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised }(hb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised hjehhhNhNubj[)}(h**id**h]hid}(hhhjfhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjeubh.}(hjhjehhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjpdubh)}(h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().h]h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().}(hj:fhj8fhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjpdubh)}(h **Context**h]j[)}(hjIfh]hContext}(hhhjKfhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjGfubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjpdubh)}(htProcess context. Takes and releases the xa_lock while disabling interrupts. May sleep if the **gfp** flags permit.h](h_Process context. Takes and releases the xa_lock while disabling interrupts. May sleep if the }(h_Process context. Takes and releases the xa_lock while disabling interrupts. May sleep if the hj_fhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjhfhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj_fubh flags permit.}(h flags permit.hj_fhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjpdubh)}(h **Return**h]j[)}(hjfh]hReturn}(hhhjfhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjfubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjpdubh)}(hk0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](ha0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in }(ha0 on success, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in hjfhhhNhNubj[)}(h **limit**h]hlimit}(hhhjfhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjfubh.}(hjhjfhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjpdubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_alloc_cyclic (C function)c.xa_alloc_cyclichNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hjint xa_alloc_cyclic (struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp)h]ja)}(hiint xa_alloc_cyclic(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp)h](jg)}(hinth]hint}(hhhjfhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjfhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjfhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjfhhhjfhMubj)}(hxa_alloc_cyclich]j)}(hxa_alloc_cyclich]hxa_alloc_cyclic}(hhhjfhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjfubah}(h]h ](jjeh"]h$]h&]hhuh1jhjfhhhjfhMubj)}(hV(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjghhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjgubjy)}(h h]h }(hhhj&ghhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjgubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj7ghhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj4gubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj9gmodnameN classnameNj%j%)}j%]j%)}j%jfsbc.xa_alloc_cyclicasbuh1hhjgubjy)}(h h]h }(hhhjWghhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjgubj)}(hj(h]h*}(hhhjeghhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjgubj)}(hxah]hxa}(hhhjrghhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjgubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjgubj)}(hu32 *idh](h)}(hhh]j)}(hu32h]hu32}(hhhjghhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjgubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjgmodnameN classnameNj%j%)}j%]jSgc.xa_alloc_cyclicasbuh1hhjgubjy)}(h h]h }(hhhjghhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjgubj)}(hj(h]h*}(hhhjghhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjgubj)}(hidh]hid}(hhhjghhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjgubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjgubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjghhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjgubjy)}(h h]h }(hhhjghhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjgubj)}(hj(h]h*}(hhhjghhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjgubj)}(hentryh]hentry}(hhhj hhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjgubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjgubj)}(hstruct xa_limit limith](jz)}(hjh]hstruct}(hhhj"hhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjhubjy)}(h h]h }(hhhj/hhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhubh)}(hhh]j)}(hxa_limith]hxa_limit}(hhhj@hhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj=hubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjBhmodnameN classnameNj%j%)}j%]jSgc.xa_alloc_cyclicasbuh1hhjhubjy)}(h h]h }(hhhj^hhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhubj)}(hlimith]hlimit}(hhhjlhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjgubj)}(h u32 *nexth](h)}(hhh]j)}(hu32h]hu32}(hhhjhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjhmodnameN classnameNj%j%)}j%]jSgc.xa_alloc_cyclicasbuh1hhjhubjy)}(h h]h }(hhhjhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhubj)}(hj(h]h*}(hhhjhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhubj)}(hnexth]hnext}(hhhjhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjgubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhjhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjhmodnameN classnameNj%j%)}j%]jSgc.xa_alloc_cyclicasbuh1hhjhubjy)}(h h]h }(hhhjhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhubj)}(hgfph]hgfp}(hhhj ihhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjgubeh}(h]h ]h"]h$]h&]hhuh1jhjfhhhjfhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjfhhhjfhMubah}(h]jfah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjfhhubj+)}(hhh]h)}(h1Find somewhere to store this entry in the XArray.h]h1Find somewhere to store this entry in the XArray.}(hj6ihj4ihhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj1ihhubah}(h]h ]h"]h$]h&]uh1j*hjfhhhjfhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjLijNjLijOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``u32 *id`` Pointer to ID. ``void *entry`` New entry. ``struct xa_limit limit`` Range of allocated ID. ``u32 *next`` Pointer to next ID to allocate. ``gfp_t gfp`` Memory allocation flags. **Description** Finds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**. The search for an empty entry will start at **next** and will wrap around if necessary. Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags(). **Context** Any context. Takes and releases the xa_lock. May sleep if the **gfp** flags permit. **Return** 0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](h)}(h**Parameters**h]j[)}(hjVih]h Parameters}(hhhjXihhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjTiubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjPiubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjuih]hstruct xarray *xa}(hhhjwihhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjsiubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjoiubj)}(hhh]h)}(hXArray.h]hXArray.}(hjihjihhhNhNubah}(h]h ]h"]h$]h&]uh1hhjihMhjiubah}(h]h ]h"]h$]h&]uh1jhjoiubeh}(h]h ]h"]h$]h&]uh1jhjihMhjliubj)}(h``u32 *id`` Pointer to ID. h](j)}(h ``u32 *id``h]j4)}(hjih]hu32 *id}(hhhjihhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjiubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjiubj)}(hhh]h)}(hPointer to ID.h]hPointer to ID.}(hjihjihhhNhNubah}(h]h ]h"]h$]h&]uh1hhjihMhjiubah}(h]h ]h"]h$]h&]uh1jhjiubeh}(h]h ]h"]h$]h&]uh1jhjihMhjliubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hjih]h void *entry}(hhhjihhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjiubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjiubj)}(hhh]h)}(h New entry.h]h New entry.}(hjjhjjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjihMhjiubah}(h]h ]h"]h$]h&]uh1jhjiubeh}(h]h ]h"]h$]h&]uh1jhjihMhjliubj)}(h1``struct xa_limit limit`` Range of allocated ID. h](j)}(h``struct xa_limit limit``h]j4)}(hj jh]hstruct xa_limit limit}(hhhj"jhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjjubj)}(hhh]h)}(hRange of allocated ID.h]hRange of allocated ID.}(hj;jhj9jhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj5jhMhj6jubah}(h]h ]h"]h$]h&]uh1jhjjubeh}(h]h ]h"]h$]h&]uh1jhj5jhMhjliubj)}(h.``u32 *next`` Pointer to next ID to allocate. h](j)}(h ``u32 *next``h]j4)}(hjYjh]h u32 *next}(hhhj[jhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjWjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjSjubj)}(hhh]h)}(hPointer to next ID to allocate.h]hPointer to next ID to allocate.}(hjtjhjrjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjnjhMhjojubah}(h]h ]h"]h$]h&]uh1jhjSjubeh}(h]h ]h"]h$]h&]uh1jhjnjhMhjliubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjjh]h gfp_t gfp}(hhhjjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjjubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjjhjjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjjhMhjjubah}(h]h ]h"]h$]h&]uh1jhjjubeh}(h]h ]h"]h$]h&]uh1jhjjhMhjliubeh}(h]h ]h"]h$]h&]uh1jhjPiubh)}(h**Description**h]j[)}(hjjh]h Description}(hhhjjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjPiubh)}(hX)Finds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**. The search for an empty entry will start at **next** and will wrap around if necessary.h](hFinds an empty entry in }(hFinds an empty entry in hjjhhhNhNubj[)}(h**xa**h]hxa}(hhhjjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjjubh between }(h between hjjhhhNhNubj[)}(h **limit.min**h]h limit.min}(hhhjjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjjubh and }(h and hjjhhhNhNubj[)}(h **limit.max**h]h limit.max}(hhhjkhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjjubh, stores the index into the }(h, stores the index into the hjjhhhNhNubj[)}(h**id**h]hid}(hhhj%khhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjjubhb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised }(hb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised hjjhhhNhNubj[)}(h**id**h]hid}(hhhj8khhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjjubh.. The search for an empty entry will start at }(h.. The search for an empty entry will start at hjjhhhNhNubj[)}(h**next**h]hnext}(hhhjKkhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjjubh# and will wrap around if necessary.}(h# and will wrap around if necessary.hjjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjPiubh)}(h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().h]h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().}(hjgkhjekhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjPiubh)}(h **Context**h]j[)}(hjvkh]hContext}(hhhjxkhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjtkubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjPiubh)}(hUAny context. Takes and releases the xa_lock. May sleep if the **gfp** flags permit.h](h@Any context. Takes and releases the xa_lock. May sleep if the }(h@Any context. Takes and releases the xa_lock. May sleep if the hjkhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjkhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjkubh flags permit.}(h flags permit.hjkhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjPiubh)}(h **Return**h]j[)}(hjkh]hReturn}(hhhjkhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjkubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjPiubh)}(h0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](h0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in }(h0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in hjkhhhNhNubj[)}(h **limit**h]hlimit}(hhhjkhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjkubh.}(hjhjkhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjPiubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_alloc_cyclic_bh (C function)c.xa_alloc_cyclic_bhhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hmint xa_alloc_cyclic_bh (struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp)h]ja)}(hlint xa_alloc_cyclic_bh(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp)h](jg)}(hinth]hint}(hhhj lhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjlhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjlhhhjlhMubj)}(hxa_alloc_cyclic_bhh]j)}(hxa_alloc_cyclic_bhh]hxa_alloc_cyclic_bh}(hhhj*lhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj&lubah}(h]h ](jjeh"]h$]h&]hhuh1jhjlhhhjlhMubj)}(hV(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjFlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjBlubjy)}(h h]h }(hhhjSlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjBlubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjdlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjalubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjflmodnameN classnameNj%j%)}j%]j%)}j%j,lsbc.xa_alloc_cyclic_bhasbuh1hhjBlubjy)}(h h]h }(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjBlubj)}(hj(h]h*}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjBlubj)}(hxah]hxa}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjBlubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj>lubj)}(hu32 *idh](h)}(hhh]j)}(hu32h]hu32}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjlubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjlmodnameN classnameNj%j%)}j%]jlc.xa_alloc_cyclic_bhasbuh1hhjlubjy)}(h h]h }(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjlubj)}(hj(h]h*}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjlubj)}(hidh]hid}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjlubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj>lubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhj mhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj mubjy)}(h h]h }(hhhjmhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj mubj)}(hj(h]h*}(hhhj)mhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj mubj)}(hentryh]hentry}(hhhj6mhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj mubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj>lubj)}(hstruct xa_limit limith](jz)}(hjh]hstruct}(hhhjOmhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjKmubjy)}(h h]h }(hhhj\mhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjKmubh)}(hhh]j)}(hxa_limith]hxa_limit}(hhhjmmhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjjmubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjommodnameN classnameNj%j%)}j%]jlc.xa_alloc_cyclic_bhasbuh1hhjKmubjy)}(h h]h }(hhhjmhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjKmubj)}(hlimith]hlimit}(hhhjmhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjKmubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj>lubj)}(h u32 *nexth](h)}(hhh]j)}(hu32h]hu32}(hhhjmhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjmubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmmodnameN classnameNj%j%)}j%]jlc.xa_alloc_cyclic_bhasbuh1hhjmubjy)}(h h]h }(hhhjmhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjmubj)}(hj(h]h*}(hhhjmhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjmubj)}(hnexth]hnext}(hhhjmhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjmubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj>lubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhj nhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjnubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj nmodnameN classnameNj%j%)}j%]jlc.xa_alloc_cyclic_bhasbuh1hhjnubjy)}(h h]h }(hhhj(nhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjnubj)}(hgfph]hgfp}(hhhj6nhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjnubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj>lubeh}(h]h ]h"]h$]h&]hhuh1jhjlhhhjlhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjlhhhjlhMubah}(h]jkah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjkhhubj+)}(hhh]h)}(h1Find somewhere to store this entry in the XArray.h]h1Find somewhere to store this entry in the XArray.}(hjcnhjanhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj^nhhubah}(h]h ]h"]h$]h&]uh1j*hjkhhhjlhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjynjNjynjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``u32 *id`` Pointer to ID. ``void *entry`` New entry. ``struct xa_limit limit`` Range of allocated ID. ``u32 *next`` Pointer to next ID to allocate. ``gfp_t gfp`` Memory allocation flags. **Description** Finds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**. The search for an empty entry will start at **next** and will wrap around if necessary. Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags(). **Context** Any context. Takes and releases the xa_lock while disabling softirqs. May sleep if the **gfp** flags permit. **Return** 0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](h)}(h**Parameters**h]j[)}(hjnh]h Parameters}(hhhjnhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjnubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}nubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjnh]hstruct xarray *xa}(hhhjnhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjnubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjnubj)}(hhh]h)}(hXArray.h]hXArray.}(hjnhjnhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjnhMhjnubah}(h]h ]h"]h$]h&]uh1jhjnubeh}(h]h ]h"]h$]h&]uh1jhjnhMhjnubj)}(h``u32 *id`` Pointer to ID. h](j)}(h ``u32 *id``h]j4)}(hjnh]hu32 *id}(hhhjnhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjnubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjnubj)}(hhh]h)}(hPointer to ID.h]hPointer to ID.}(hjnhjnhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjnhMhjnubah}(h]h ]h"]h$]h&]uh1jhjnubeh}(h]h ]h"]h$]h&]uh1jhjnhMhjnubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hjoh]h void *entry}(hhhjohhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjoubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjoubj)}(hhh]h)}(h New entry.h]h New entry.}(hj/ohj-ohhhNhNubah}(h]h ]h"]h$]h&]uh1hhj)ohMhj*oubah}(h]h ]h"]h$]h&]uh1jhjoubeh}(h]h ]h"]h$]h&]uh1jhj)ohMhjnubj)}(h1``struct xa_limit limit`` Range of allocated ID. h](j)}(h``struct xa_limit limit``h]j4)}(hjMoh]hstruct xa_limit limit}(hhhjOohhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjKoubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjGoubj)}(hhh]h)}(hRange of allocated ID.h]hRange of allocated ID.}(hjhohjfohhhNhNubah}(h]h ]h"]h$]h&]uh1hhjbohMhjcoubah}(h]h ]h"]h$]h&]uh1jhjGoubeh}(h]h ]h"]h$]h&]uh1jhjbohMhjnubj)}(h.``u32 *next`` Pointer to next ID to allocate. h](j)}(h ``u32 *next``h]j4)}(hjoh]h u32 *next}(hhhjohhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjoubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjoubj)}(hhh]h)}(hPointer to next ID to allocate.h]hPointer to next ID to allocate.}(hjohjohhhNhNubah}(h]h ]h"]h$]h&]uh1hhjohMhjoubah}(h]h ]h"]h$]h&]uh1jhjoubeh}(h]h ]h"]h$]h&]uh1jhjohMhjnubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjoh]h gfp_t gfp}(hhhjohhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjoubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjoubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjohjohhhNhNubah}(h]h ]h"]h$]h&]uh1hhjohMhjoubah}(h]h ]h"]h$]h&]uh1jhjoubeh}(h]h ]h"]h$]h&]uh1jhjohMhjnubeh}(h]h ]h"]h$]h&]uh1jhj}nubh)}(h**Description**h]j[)}(hjoh]h Description}(hhhjohhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjoubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}nubh)}(hX)Finds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**. The search for an empty entry will start at **next** and will wrap around if necessary.h](hFinds an empty entry in }(hFinds an empty entry in hjphhhNhNubj[)}(h**xa**h]hxa}(hhhjphhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubh between }(h between hjphhhNhNubj[)}(h **limit.min**h]h limit.min}(hhhj,phhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubh and }(h and hjphhhNhNubj[)}(h **limit.max**h]h limit.max}(hhhj?phhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubh, stores the index into the }(h, stores the index into the hjphhhNhNubj[)}(h**id**h]hid}(hhhjRphhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubhb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised }(hb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised hjphhhNhNubj[)}(h**id**h]hid}(hhhjephhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubh.. The search for an empty entry will start at }(h.. The search for an empty entry will start at hjphhhNhNubj[)}(h**next**h]hnext}(hhhjxphhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubh# and will wrap around if necessary.}(h# and will wrap around if necessary.hjphhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}nubh)}(h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().h]h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().}(hjphjphhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}nubh)}(h **Context**h]j[)}(hjph]hContext}(hhhjphhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}nubh)}(hnAny context. Takes and releases the xa_lock while disabling softirqs. May sleep if the **gfp** flags permit.h](hYAny context. Takes and releases the xa_lock while disabling softirqs. May sleep if the }(hYAny context. Takes and releases the xa_lock while disabling softirqs. May sleep if the hjphhhNhNubj[)}(h**gfp**h]hgfp}(hhhjphhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubh flags permit.}(h flags permit.hjphhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}nubh)}(h **Return**h]j[)}(hjph]hReturn}(hhhjphhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}nubh)}(h0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](h0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in }(h0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in hjphhhNhNubj[)}(h **limit**h]hlimit}(hhhjphhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjpubh.}(hjhjphhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}nubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQ xa_alloc_cyclic_irq (C function)c.xa_alloc_cyclic_irqhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hnint xa_alloc_cyclic_irq (struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp)h]ja)}(hmint xa_alloc_cyclic_irq(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp)h](jg)}(hinth]hint}(hhhj6qhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj2qhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjEqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj2qhhhjDqhMubj)}(hxa_alloc_cyclic_irqh]j)}(hxa_alloc_cyclic_irqh]hxa_alloc_cyclic_irq}(hhhjWqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjSqubah}(h]h ](jjeh"]h$]h&]hhuh1jhj2qhhhjDqhMubj)}(hV(struct xarray *xa, u32 *id, void *entry, struct xa_limit limit, u32 *next, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjsqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjoqubjy)}(h h]h }(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjoqubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjqubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjqmodnameN classnameNj%j%)}j%]j%)}j%jYqsbc.xa_alloc_cyclic_irqasbuh1hhjoqubjy)}(h h]h }(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjoqubj)}(hj(h]h*}(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjoqubj)}(hxah]hxa}(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjoqubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjkqubj)}(hu32 *idh](h)}(hhh]j)}(hu32h]hu32}(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjqubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjqmodnameN classnameNj%j%)}j%]jqc.xa_alloc_cyclic_irqasbuh1hhjqubjy)}(h h]h }(hhhjrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjqubj)}(hj(h]h*}(hhhjrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjqubj)}(hidh]hid}(hhhj!rhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjqubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjkqubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhj:rhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj6rubjy)}(h h]h }(hhhjHrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj6rubj)}(hj(h]h*}(hhhjVrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj6rubj)}(hentryh]hentry}(hhhjcrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj6rubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjkqubj)}(hstruct xa_limit limith](jz)}(hjh]hstruct}(hhhj|rhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjxrubjy)}(h h]h }(hhhjrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjxrubh)}(hhh]j)}(hxa_limith]hxa_limit}(hhhjrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjrubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjrmodnameN classnameNj%j%)}j%]jqc.xa_alloc_cyclic_irqasbuh1hhjxrubjy)}(h h]h }(hhhjrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjxrubj)}(hlimith]hlimit}(hhhjrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjxrubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjkqubj)}(h u32 *nexth](h)}(hhh]j)}(hu32h]hu32}(hhhjrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjrubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjrmodnameN classnameNj%j%)}j%]jqc.xa_alloc_cyclic_irqasbuh1hhjrubjy)}(h h]h }(hhhjshhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjrubj)}(hj(h]h*}(hhhjshhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjrubj)}(hnexth]hnext}(hhhjshhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjrubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjkqubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhj7shhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj4subah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj9smodnameN classnameNj%j%)}j%]jqc.xa_alloc_cyclic_irqasbuh1hhj0subjy)}(h h]h }(hhhjUshhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj0subj)}(hgfph]hgfp}(hhhjcshhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj0subeh}(h]h ]h"]h$]h&]noemphhhuh1jhjkqubeh}(h]h ]h"]h$]h&]hhuh1jhj2qhhhjDqhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj.qhhhjDqhMubah}(h]j)qah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj+qhhubj+)}(hhh]h)}(h1Find somewhere to store this entry in the XArray.h]h1Find somewhere to store this entry in the XArray.}(hjshjshhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjshhubah}(h]h ]h"]h$]h&]uh1j*hj+qhhhjDqhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjsjNjsjOuh1jUhhhj3;hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``u32 *id`` Pointer to ID. ``void *entry`` New entry. ``struct xa_limit limit`` Range of allocated ID. ``u32 *next`` Pointer to next ID to allocate. ``gfp_t gfp`` Memory allocation flags. **Description** Finds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**. The search for an empty entry will start at **next** and will wrap around if necessary. Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags(). **Context** Process context. Takes and releases the xa_lock while disabling interrupts. May sleep if the **gfp** flags permit. **Return** 0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](h)}(h**Parameters**h]j[)}(hjsh]h Parameters}(hhhjshhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjsubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjsubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjsh]hstruct xarray *xa}(hhhjshhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjsubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjsubj)}(hhh]h)}(hXArray.h]hXArray.}(hjshjshhhNhNubah}(h]h ]h"]h$]h&]uh1hhjshMhjsubah}(h]h ]h"]h$]h&]uh1jhjsubeh}(h]h ]h"]h$]h&]uh1jhjshMhjsubj)}(h``u32 *id`` Pointer to ID. h](j)}(h ``u32 *id``h]j4)}(hjth]hu32 *id}(hhhj thhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjtubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjtubj)}(hhh]h)}(hPointer to ID.h]hPointer to ID.}(hj#thj!thhhNhNubah}(h]h ]h"]h$]h&]uh1hhjthMhjtubah}(h]h ]h"]h$]h&]uh1jhjtubeh}(h]h ]h"]h$]h&]uh1jhjthMhjsubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hjAth]h void *entry}(hhhjCthhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj?tubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj;tubj)}(hhh]h)}(h New entry.h]h New entry.}(hj\thjZthhhNhNubah}(h]h ]h"]h$]h&]uh1hhjVthMhjWtubah}(h]h ]h"]h$]h&]uh1jhj;tubeh}(h]h ]h"]h$]h&]uh1jhjVthMhjsubj)}(h1``struct xa_limit limit`` Range of allocated ID. h](j)}(h``struct xa_limit limit``h]j4)}(hjzth]hstruct xa_limit limit}(hhhj|thhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjxtubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjttubj)}(hhh]h)}(hRange of allocated ID.h]hRange of allocated ID.}(hjthjthhhNhNubah}(h]h ]h"]h$]h&]uh1hhjthMhjtubah}(h]h ]h"]h$]h&]uh1jhjttubeh}(h]h ]h"]h$]h&]uh1jhjthMhjsubj)}(h.``u32 *next`` Pointer to next ID to allocate. h](j)}(h ``u32 *next``h]j4)}(hjth]h u32 *next}(hhhjthhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjtubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjtubj)}(hhh]h)}(hPointer to next ID to allocate.h]hPointer to next ID to allocate.}(hjthjthhhNhNubah}(h]h ]h"]h$]h&]uh1hhjthMhjtubah}(h]h ]h"]h$]h&]uh1jhjtubeh}(h]h ]h"]h$]h&]uh1jhjthMhjsubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjth]h gfp_t gfp}(hhhjthhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjtubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjtubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjuhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjuhMhjuubah}(h]h ]h"]h$]h&]uh1jhjtubeh}(h]h ]h"]h$]h&]uh1jhjuhMhjsubeh}(h]h ]h"]h$]h&]uh1jhjsubh)}(h**Description**h]j[)}(hj'uh]h Description}(hhhj)uhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj%uubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM hjsubh)}(hX)Finds an empty entry in **xa** between **limit.min** and **limit.max**, stores the index into the **id** pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised **id**. The search for an empty entry will start at **next** and will wrap around if necessary.h](hFinds an empty entry in }(hFinds an empty entry in hj=uhhhNhNubj[)}(h**xa**h]hxa}(hhhjFuhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj=uubh between }(h between hj=uhhhNhNubj[)}(h **limit.min**h]h limit.min}(hhhjYuhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj=uubh and }(h and hj=uhhhNhNubj[)}(h **limit.max**h]h limit.max}(hhhjluhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj=uubh, stores the index into the }(h, stores the index into the hj=uhhhNhNubj[)}(h**id**h]hid}(hhhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj=uubhb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised }(hb pointer, then stores the entry at that index. A concurrent lookup will not see an uninitialised hj=uhhhNhNubj[)}(h**id**h]hid}(hhhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj=uubh.. The search for an empty entry will start at }(h.. The search for an empty entry will start at hj=uhhhNhNubj[)}(h**next**h]hnext}(hhhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj=uubh# and will wrap around if necessary.}(h# and will wrap around if necessary.hj=uhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM hjsubh)}(h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().h]h_Must only be operated on an xarray initialized with flag XA_FLAGS_ALLOC set in xa_init_flags().}(hjuhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjsubh)}(h **Context**h]j[)}(hjuh]hContext}(hhhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjuubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjsubh)}(htProcess context. Takes and releases the xa_lock while disabling interrupts. May sleep if the **gfp** flags permit.h](h_Process context. Takes and releases the xa_lock while disabling interrupts. May sleep if the }(h_Process context. Takes and releases the xa_lock while disabling interrupts. May sleep if the hjuhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjuubh flags permit.}(h flags permit.hjuhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjsubh)}(h **Return**h]j[)}(hj vh]hReturn}(hhhj vhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj vubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjsubh)}(h0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in **limit**.h](h0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in }(h0 if the allocation succeeded without wrapping. 1 if the allocation succeeded after wrapping, -ENOMEM if memory could not be allocated or -EBUSY if there are no free entries in hj!vhhhNhNubj[)}(h **limit**h]hlimit}(hhhj*vhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj!vubh.}(hjhj!vhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjsubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_reserve (C function) c.xa_reservehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hBint xa_reserve (struct xarray *xa, unsigned long index, gfp_t gfp)h]ja)}(hAint xa_reserve(struct xarray *xa, unsigned long index, gfp_t gfp)h](jg)}(hinth]hint}(hhhjcvhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj_vhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM'ubjy)}(h h]h }(hhhjrvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj_vhhhjqvhM'ubj)}(h xa_reserveh]j)}(h xa_reserveh]h xa_reserve}(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjvubah}(h]h ](jjeh"]h$]h&]hhuh1jhj_vhhhjqvhM'ubj)}(h3(struct xarray *xa, unsigned long index, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjvubjy)}(h h]h }(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjvubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjvubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjvmodnameN classnameNj%j%)}j%]j%)}j%jvsb c.xa_reserveasbuh1hhjvubjy)}(h h]h }(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjvubj)}(hj(h]h*}(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjvubj)}(hxah]hxa}(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjvubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjvubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjwhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjwubjy)}(h h]h }(hhhj whhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjwubjg)}(hlongh]hlong}(hhhj.whhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjwubjy)}(h h]h }(hhhjhjzhhubah}(h]h ]h"]h$]h&]uh1j*hjyhhhjyhM?ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj {jNj {jOuh1jUhhhj3hNhNubjQ)}(hX_**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. ``gfp_t gfp`` Memory allocation flags. **Description** A softirq-disabling version of xa_reserve(). **Context** Any context. Takes and releases the xa_lock while disabling softirqs. **Return** 0 if the reservation succeeded or -ENOMEM if it failed.h](h)}(h**Parameters**h]j[)}(hj{h]h Parameters}(hhhj{hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj{ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMBhj{ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hj6{h]hstruct xarray *xa}(hhhj8{hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj4{ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM?hj0{ubj)}(hhh]h)}(hXArray.h]hXArray.}(hjQ{hjO{hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjK{hM?hjL{ubah}(h]h ]h"]h$]h&]uh1jhj0{ubeh}(h]h ]h"]h$]h&]uh1jhjK{hM?hj-{ubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hjo{h]hunsigned long index}(hhhjq{hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjm{ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM@hji{ubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hj{hj{hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj{hM@hj{ubah}(h]h ]h"]h$]h&]uh1jhji{ubeh}(h]h ]h"]h$]h&]uh1jhj{hM@hj-{ubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hj{h]h gfp_t gfp}(hhhj{hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj{ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMAhj{ubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hj{hj{hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj{hMAhj{ubah}(h]h ]h"]h$]h&]uh1jhj{ubeh}(h]h ]h"]h$]h&]uh1jhj{hMAhj-{ubeh}(h]h ]h"]h$]h&]uh1jhj{ubh)}(h**Description**h]j[)}(hj{h]h Description}(hhhj{hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj{ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMChj{ubh)}(h,A softirq-disabling version of xa_reserve().h]h,A softirq-disabling version of xa_reserve().}(hj{hj{hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMChj{ubh)}(h **Context**h]j[)}(hj |h]hContext}(hhhj |hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj|ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMEhj{ubh)}(hFAny context. Takes and releases the xa_lock while disabling softirqs.h]hFAny context. Takes and releases the xa_lock while disabling softirqs.}(hj"|hj |hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMEhj{ubh)}(h **Return**h]j[)}(hj1|h]hReturn}(hhhj3|hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj/|ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMHhj{ubh)}(h70 if the reservation succeeded or -ENOMEM if it failed.h]h70 if the reservation succeeded or -ENOMEM if it failed.}(hjI|hjG|hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMGhj{ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_reserve_irq (C function)c.xa_reserve_irqhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hFint xa_reserve_irq (struct xarray *xa, unsigned long index, gfp_t gfp)h]ja)}(hEint xa_reserve_irq(struct xarray *xa, unsigned long index, gfp_t gfp)h](jg)}(hinth]hint}(hhhjv|hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjr|hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMQubjy)}(h h]h }(hhhj|hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjr|hhhj|hMQubj)}(hxa_reserve_irqh]j)}(hxa_reserve_irqh]hxa_reserve_irq}(hhhj|hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj|ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjr|hhhj|hMQubj)}(h3(struct xarray *xa, unsigned long index, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhj|hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj|ubjy)}(h h]h }(hhhj|hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj|ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj|hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj|ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj|modnameN classnameNj%j%)}j%]j%)}j%j|sbc.xa_reserve_irqasbuh1hhj|ubjy)}(h h]h }(hhhj|hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj|ubj)}(hj(h]h*}(hhhj|hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj|ubj)}(hxah]hxa}(hhhj }hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj|ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj|ubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhj%}hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj!}ubjy)}(h h]h }(hhhj3}hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj!}ubjg)}(hlongh]hlong}(hhhjA}hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj!}ubjy)}(h h]h }(hhhjO}hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj!}ubj)}(hindexh]hindex}(hhhj]}hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj!}ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj|ubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhjy}hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjv}ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj{}modnameN classnameNj%j%)}j%]j|c.xa_reserve_irqasbuh1hhjr}ubjy)}(h h]h }(hhhj}hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjr}ubj)}(hgfph]hgfp}(hhhj}hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjr}ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj|ubeh}(h]h ]h"]h$]h&]hhuh1jhjr|hhhj|hMQubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjn|hhhj|hMQubah}(h]ji|ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM[hjk|hhubj+)}(hhh]h)}(h!Reserve this index in the XArray.h]h!Reserve this index in the XArray.}(hj}hj}hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMPhj}hhubah}(h]h ]h"]h$]h&]uh1j*hjk|hhhj|hMQubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj}jNj}jOuh1jUhhhj3hNhNubjQ)}(hXh**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. ``gfp_t gfp`` Memory allocation flags. **Description** An interrupt-disabling version of xa_reserve(). **Context** Process context. Takes and releases the xa_lock while disabling interrupts. **Return** 0 if the reservation succeeded or -ENOMEM if it failed.h](h)}(h**Parameters**h]j[)}(hj}h]h Parameters}(hhhj}hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj}ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMThj}ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hj~h]hstruct xarray *xa}(hhhj~hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj~ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMQhj ~ubj)}(hhh]h)}(hXArray.h]hXArray.}(hj,~hj*~hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj&~hMQhj'~ubah}(h]h ]h"]h$]h&]uh1jhj ~ubeh}(h]h ]h"]h$]h&]uh1jhj&~hMQhj~ubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hjJ~h]hunsigned long index}(hhhjL~hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjH~ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMRhjD~ubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hje~hjc~hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj_~hMRhj`~ubah}(h]h ]h"]h$]h&]uh1jhjD~ubeh}(h]h ]h"]h$]h&]uh1jhj_~hMRhj~ubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hj~h]h gfp_t gfp}(hhhj~hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj~ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMShj}~ubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hj~hj~hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj~hMShj~ubah}(h]h ]h"]h$]h&]uh1jhj}~ubeh}(h]h ]h"]h$]h&]uh1jhj~hMShj~ubeh}(h]h ]h"]h$]h&]uh1jhj}ubh)}(h**Description**h]j[)}(hj~h]h Description}(hhhj~hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj~ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMUhj}ubh)}(h/An interrupt-disabling version of xa_reserve().h]h/An interrupt-disabling version of xa_reserve().}(hj~hj~hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMUhj}ubh)}(h **Context**h]j[)}(hj~h]hContext}(hhhj~hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj~ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMWhj}ubh)}(hLProcess context. Takes and releases the xa_lock while disabling interrupts.h]hLProcess context. Takes and releases the xa_lock while disabling interrupts.}(hj~hj~hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMWhj}ubh)}(h **Return**h]j[)}(hj h]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMZhj}ubh)}(h70 if the reservation succeeded or -ENOMEM if it failed.h]h70 if the reservation succeeded or -ENOMEM if it failed.}(hj$hj"hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMYhj}ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_release (C function) c.xa_releasehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h8void xa_release (struct xarray *xa, unsigned long index)h]ja)}(h7void xa_release(struct xarray *xa, unsigned long index)h](jg)}(hvoidh]hvoid}(hhhjQhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjMhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMcubjy)}(h h]h }(hhhj`hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjMhhhj_hMcubj)}(h xa_releaseh]j)}(h xa_releaseh]h xa_release}(hhhjrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjnubah}(h]h ](jjeh"]h$]h&]hhuh1jhjMhhhj_hMcubj)}(h((struct xarray *xa, unsigned long index)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jtsb c.xa_releaseasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhj*hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hindexh]hindex}(hhhj8hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjMhhhj_hMcubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjIhhhj_hMcubah}(h]jDah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMjhjFhhubj+)}(hhh]h)}(hRelease a reserved entry.h]hRelease a reserved entry.}(hjehjchhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMbhj`hhubah}(h]h ]h"]h$]h&]uh1j*hjFhhhj_hMcubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj{jNj{jOuh1jUhhhj3hNhNubjQ)}(hX **Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index of entry. **Description** After calling xa_reserve(), you can call this function to release the reservation. If the entry at **index** has been stored to, this function will do nothing.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMfhjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMchjubj)}(hhh]h)}(hXArray.h]hXArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMchjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMchjubj)}(h(``unsigned long index`` Index of entry. h](j)}(h``unsigned long index``h]j4)}(hj݀h]hunsigned long index}(hhhj߀hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjۀubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMdhj׀ubj)}(hhh]h)}(hIndex of entry.h]hIndex of entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMdhjubah}(h]h ]h"]h$]h&]uh1jhj׀ubeh}(h]h ]h"]h$]h&]uh1jhjhMdhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMfhjubh)}(hAfter calling xa_reserve(), you can call this function to release the reservation. If the entry at **index** has been stored to, this function will do nothing.h](hdAfter calling xa_reserve(), you can call this function to release the reservation. If the entry at }(hdAfter calling xa_reserve(), you can call this function to release the reservation. If the entry at hj.hhhNhNubj[)}(h **index**h]hindex}(hhhj7hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj.ubh3 has been stored to, this function will do nothing.}(h3 has been stored to, this function will do nothing.hj.hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMfhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_is_sibling (C function)c.xa_is_siblinghNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h&bool xa_is_sibling (const void *entry)h]ja)}(h%bool xa_is_sibling(const void *entry)h](jg)}(hjh]hbool}(hhhjqhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjmhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjmhhhj~hMubj)}(h xa_is_siblingh]j)}(h xa_is_siblingh]h xa_is_sibling}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjmhhhj~hMubj)}(h(const void *entry)h]j)}(hconst void *entryh](jz)}(hj}h]hconst}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hvoidh]hvoid}(hhhjȁhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjցhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjmhhhj~hMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjihhhj~hMubah}(h]jdah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjfhhubj+)}(hhh]h)}(hIs the entry a sibling entry?h]hIs the entry a sibling entry?}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjfhhhj~hMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj4jNj4jOuh1jUhhhj3hNhNubjQ)}(h~**Parameters** ``const void *entry`` Entry retrieved from the XArray **Return** ``true`` if the entry is a sibling entry.h](h)}(h**Parameters**h]j[)}(hj>h]h Parameters}(hhhj@hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj<ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj8ubj)}(hhh]j)}(h6``const void *entry`` Entry retrieved from the XArray h](j)}(h``const void *entry``h]j4)}(hj]h]hconst void *entry}(hhhj_hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj[ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjWubj)}(hhh]h)}(hEntry retrieved from the XArrayh]hEntry retrieved from the XArray}(hjxhjvhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjrhMhjsubah}(h]h ]h"]h$]h&]uh1jhjWubeh}(h]h ]h"]h$]h&]uh1jhjrhMhjTubah}(h]h ]h"]h$]h&]uh1jhj8ubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj8ubh)}(h)``true`` if the entry is a sibling entry.h](j4)}(h``true``h]htrue}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh! if the entry is a sibling entry.}(h! if the entry is a sibling entry.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj8ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_is_retry (C function) c.xa_is_retryhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h$bool xa_is_retry (const void *entry)h]ja)}(h#bool xa_is_retry(const void *entry)h](jg)}(hjh]hbool}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(h xa_is_retryh]j)}(h xa_is_retryh]h xa_is_retry}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h(const void *entry)h]j)}(hconst void *entryh](jz)}(hj}h]hconst}(hhhj(hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj$ubjy)}(h h]h }(hhhj5hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj$ubjg)}(hvoidh]hvoid}(hhhjChhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj$ubjy)}(h h]h }(hhhjQhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj$ubj)}(hj(h]h*}(hhhj_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj$ubj)}(hentryh]hentry}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj$ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]j߂ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubj+)}(hhh]h)}(hIs the entry a retry entry?h]hIs the entry a retry entry?}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h|**Parameters** ``const void *entry`` Entry retrieved from the XArray **Return** ``true`` if the entry is a retry entry.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh]j)}(h6``const void *entry`` Entry retrieved from the XArray h](j)}(h``const void *entry``h]j4)}(hj؃h]hconst void *entry}(hhhjڃhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjփubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj҃ubj)}(hhh]h)}(hEntry retrieved from the XArrayh]hEntry retrieved from the XArray}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhj҃ubeh}(h]h ]h"]h$]h&]uh1jhjhMhjσubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h'``true`` if the entry is a retry entry.h](j4)}(h``true``h]htrue}(hhhj-hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj)ubh if the entry is a retry entry.}(h if the entry is a retry entry.hj)hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_is_advanced (C function)c.xa_is_advancedhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h'bool xa_is_advanced (const void *entry)h]ja)}(h&bool xa_is_advanced(const void *entry)h](jg)}(hjh]hbool}(hhhjghhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjchhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjuhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjchhhjthMubj)}(hxa_is_advancedh]j)}(hxa_is_advancedh]hxa_is_advanced}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjchhhjthMubj)}(h(const void *entry)h]j)}(hconst void *entryh](jz)}(hj}h]hconst}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhj̄hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjڄhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjchhhjthMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj_hhhjthMubah}(h]jZah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj\hhubj+)}(hhh]h)}(h1Is the entry only permitted for the advanced API?h]h1Is the entry only permitted for the advanced API?}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubah}(h]h ]h"]h$]h&]uh1j*hj\hhhjthMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj*jNj*jOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const void *entry`` Entry to be stored in the XArray. **Return** ``true`` if the entry cannot be stored by the normal API.h](h)}(h**Parameters**h]j[)}(hj4h]h Parameters}(hhhj6hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj2ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj.ubj)}(hhh]j)}(h8``const void *entry`` Entry to be stored in the XArray. h](j)}(h``const void *entry``h]j4)}(hjSh]hconst void *entry}(hhhjUhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjQubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjMubj)}(hhh]h)}(h!Entry to be stored in the XArray.h]h!Entry to be stored in the XArray.}(hjnhjlhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhhMhjiubah}(h]h ]h"]h$]h&]uh1jhjMubeh}(h]h ]h"]h$]h&]uh1jhjhhMhjJubah}(h]h ]h"]h$]h&]uh1jhj.ubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj.ubh)}(h9``true`` if the entry cannot be stored by the normal API.h](j4)}(h``true``h]htrue}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh1 if the entry cannot be stored by the normal API.}(h1 if the entry cannot be stored by the normal API.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj.ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_update_node_t (C macro)c.xa_update_node_thNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hxa_update_node_th]ja)}(hxa_update_node_th]j)}(hxa_update_node_th]j)}(hj܅h]hxa_update_node_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjޅhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM&ubah}(h]h ]h"]h$]h&]hhjuh1j`jjhjڅhhhjhM&ubah}(h]jՅah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjׅhhubj+)}(hhh]h)}(h1**Typedef**: A callback function from the XArray.h](j[)}(h **Typedef**h]hTypedef}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubh&: A callback function from the XArray.}(h&: A callback function from the XArray.hj hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM$hjhhubah}(h]h ]h"]h$]h&]uh1j*hjׅhhhjhM&ubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMj1jNj1jOuh1jUhhhj3hNhNubh)}(h **Syntax**h]j[)}(hj7h]hSyntax}(hhhj9hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj5ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM'hj3hhubj !)}(hhh]h)}(h0``void xa_update_node_t (struct xa_node *node)``h]j4)}(hjRh]h,void xa_update_node_t (struct xa_node *node)}(hhhjThhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjPubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM)hjMubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hX**Parameters** ``struct xa_node *node`` The node which is being processed **Description** This function is called every time the XArray updates the count of present and value entries in a node. It allows advanced users to maintain the private_list in the node. **Context** The xa_lock is held and interrupts may be disabled. Implementations should not drop the xa_lock, nor re-enable interrupts.h](h)}(h**Parameters**h]j[)}(hjth]h Parameters}(hhhjvhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjrubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM-hjnubj)}(hhh]j)}(h;``struct xa_node *node`` The node which is being processed h](j)}(h``struct xa_node *node``h]j4)}(hjh]hstruct xa_node *node}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM%hjubj)}(hhh]h)}(h!The node which is being processedh]h!The node which is being processed}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM%hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM%hjubah}(h]h ]h"]h$]h&]uh1jhjnubh)}(h**Description**h]j[)}(hjΆh]h Description}(hhhjІhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj̆ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM'hjnubh)}(hThis function is called every time the XArray updates the count of present and value entries in a node. It allows advanced users to maintain the private_list in the node.h]hThis function is called every time the XArray updates the count of present and value entries in a node. It allows advanced users to maintain the private_list in the node.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM'hjnubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM+hjnubh)}(hzThe xa_lock is held and interrupts may be disabled. Implementations should not drop the xa_lock, nor re-enable interrupts.h]hzThe xa_lock is held and interrupts may be disabled. Implementations should not drop the xa_lock, nor re-enable interrupts.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM+hjnubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQXA_STATE (C macro) c.XA_STATEhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hXA_STATEh]ja)}(hXA_STATEh]j)}(hXA_STATEh]j)}(hj4h]hXA_STATE}(hhhj>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj:ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj6hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMoubah}(h]h ]h"]h$]h&]hhjuh1j`jjhj2hhhjQhMoubah}(h]j-ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMnhj/hhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hj/hhhjQhMoubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMjkjNjkjOuh1jUhhhj3hNhNubh)}(h!``XA_STATE (name, array, index)``h]j4)}(hjqh]hXA_STATE (name, array, index)}(hhhjshhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjoubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMphj3hhubj !)}(hhh]h)}(h"Declare an XArray operation state.h]h"Declare an XArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMghjubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(h**Parameters** ``name`` Name of this operation state (usually xas). ``array`` Array to operate on. ``index`` Initial index of interest. **Description** Declare and initialise an xa_state on the stack.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMkhjubj)}(hhh](j)}(h5``name`` Name of this operation state (usually xas). h](j)}(h``name``h]j4)}(hjćh]hname}(hhhjƇhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj‡ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhhjubj)}(hhh]h)}(h+Name of this operation state (usually xas).h]h+Name of this operation state (usually xas).}(hj߇hj݇hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjهhMhhjڇubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjهhMhhjubj)}(h``array`` Array to operate on. h](j)}(h ``array``h]j4)}(hjh]harray}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMihjubj)}(hhh]h)}(hArray to operate on.h]hArray to operate on.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMihjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMihjubj)}(h%``index`` Initial index of interest. h](j)}(h ``index``h]j4)}(hj6h]hindex}(hhhj8hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj4ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMjhj0ubj)}(hhh]h)}(hInitial index of interest.h]hInitial index of interest.}(hjQhjOhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjKhMjhjLubah}(h]h ]h"]h$]h&]uh1jhj0ubeh}(h]h ]h"]h$]h&]uh1jhjKhMjhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjqh]h Description}(hhhjshhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjoubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMlhjubh)}(h0Declare and initialise an xa_state on the stack.h]h0Declare and initialise an xa_state on the stack.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMlhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQXA_STATE_ORDER (C macro)c.XA_STATE_ORDERhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hXA_STATE_ORDERh]ja)}(hXA_STATE_ORDERh]j)}(hXA_STATE_ORDERh]j)}(hjh]hXA_STATE_ORDER}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM}ubah}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhj͈hM}ubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM|hjhhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hjhhhj͈hM}ubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubh)}(h.``XA_STATE_ORDER (name, array, index, order)``h]j4)}(hjh]h*XA_STATE_ORDER (name, array, index, order)}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM~hj3hhubj !)}(hhh]h)}(h"Declare an XArray operation state.h]h"Declare an XArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMrhjubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hXV**Parameters** ``name`` Name of this operation state (usually xas). ``array`` Array to operate on. ``index`` Initial index of interest. ``order`` Order of entry. **Description** Declare and initialise an xa_state on the stack. This variant of XA_STATE() allows you to specify the 'order' of the element you want to operate on.`h](h)}(h**Parameters**h]j[)}(hj!h]h Parameters}(hhhj#hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMvhjubj)}(hhh](j)}(h5``name`` Name of this operation state (usually xas). h](j)}(h``name``h]j4)}(hj@h]hname}(hhhjBhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj>ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMshj:ubj)}(hhh]h)}(h+Name of this operation state (usually xas).h]h+Name of this operation state (usually xas).}(hj[hjYhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjUhMshjVubah}(h]h ]h"]h$]h&]uh1jhj:ubeh}(h]h ]h"]h$]h&]uh1jhjUhMshj7ubj)}(h``array`` Array to operate on. h](j)}(h ``array``h]j4)}(hjyh]harray}(hhhj{hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjwubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMthjsubj)}(hhh]h)}(hArray to operate on.h]hArray to operate on.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMthjubah}(h]h ]h"]h$]h&]uh1jhjsubeh}(h]h ]h"]h$]h&]uh1jhjhMthj7ubj)}(h%``index`` Initial index of interest. h](j)}(h ``index``h]j4)}(hjh]hindex}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMuhjubj)}(hhh]h)}(hInitial index of interest.h]hInitial index of interest.}(hj͉hjˉhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjljhMuhjȉubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjljhMuhj7ubj)}(h``order`` Order of entry. h](j)}(h ``order``h]j4)}(hjh]horder}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMvhjubj)}(hhh]h)}(hOrder of entry.h]hOrder of entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMvhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMvhj7ubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hj&h]h Description}(hhhj(hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj$ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMxhjubh)}(hDeclare and initialise an xa_state on the stack. This variant of XA_STATE() allows you to specify the 'order' of the element you want to operate on.`h]hDeclare and initialise an xa_state on the stack. This variant of XA_STATE() allows you to specify the ‘order’ of the element you want to operate on.`}(hj>hj<hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMxhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_error (C function) c.xas_errorhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h*int xas_error (const struct xa_state *xas)h]ja)}(h)int xas_error(const struct xa_state *xas)h](jg)}(hinth]hint}(hhhjkhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjghhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjzhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjghhhjyhMubj)}(h xas_errorh]j)}(h xas_errorh]h xas_error}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjghhhjyhMubj)}(h(const struct xa_state *xas)h]j)}(hconst struct xa_state *xash](jz)}(hj}h]hconst}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjz)}(hjh]hstruct}(hhhjÊhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjЊhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjފubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsb c.xas_errorasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjghhhjyhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjchhhjyhMubah}(h]j^ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj`hhubj+)}(hhh]h)}(h'Return an errno stored in the xa_state.h]h'Return an errno stored in the xa_state.}(hjIhjGhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjDhhubah}(h]h ]h"]h$]h&]uh1j*hj`hhhjyhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj_jNj_jOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const struct xa_state *xas`` XArray operation state. **Return** 0 if no error has been noted. A negative errno if one has.h](h)}(h**Parameters**h]j[)}(hjih]h Parameters}(hhhjkhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjgubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjcubj)}(hhh]j)}(h7``const struct xa_state *xas`` XArray operation state. h](j)}(h``const struct xa_state *xas``h]j4)}(hjh]hconst struct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjcubh)}(h **Return**h]j[)}(hjËh]hReturn}(hhhjŋhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjcubh)}(h;0 if no error has been noted. A negative errno if one has.h]h;0 if no error has been noted. A negative errno if one has.}(hjۋhjًhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjcubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_set_err (C function) c.xas_set_errhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h1void xas_set_err (struct xa_state *xas, long err)h]ja)}(h0void xas_set_err(struct xa_state *xas, long err)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(h xas_set_errh]j)}(h xas_set_errh]h xas_set_err}(hhhj)hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj%ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h (struct xa_state *xas, long err)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjEhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjAubjy)}(h h]h }(hhhjRhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjAubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjchhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj`ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjemodnameN classnameNj%j%)}j%]j%)}j%j+sb c.xas_set_errasbuh1hhjAubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjAubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjAubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjAubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj=ubj)}(hlong errh](jg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjŌhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(herrh]herr}(hhhjӌhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj=ubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubj+)}(hhh]h)}(hNote an error in the xa_state.h]hNote an error in the xa_state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX?**Parameters** ``struct xa_state *xas`` XArray operation state. ``long err`` Negative error number. **Description** Only call this function with a negative **err**; zero or positive errors will probably not behave the way you think they should. If you want to clear the error from an xa_state, use xas_reset().h](h)}(h**Parameters**h]j[)}(hj h]h Parameters}(hhhj"hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hj?h]hstruct xa_state *xas}(hhhjAhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj=ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj9ubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjZhjXhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjThMhjUubah}(h]h ]h"]h$]h&]uh1jhj9ubeh}(h]h ]h"]h$]h&]uh1jhjThMhj6ubj)}(h$``long err`` Negative error number. h](j)}(h ``long err``h]j4)}(hjxh]hlong err}(hhhjzhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjvubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjrubj)}(hhh]h)}(hNegative error number.h]hNegative error number.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjrubeh}(h]h ]h"]h$]h&]uh1jhjhMhj6ubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(hOnly call this function with a negative **err**; zero or positive errors will probably not behave the way you think they should. If you want to clear the error from an xa_state, use xas_reset().h](h(Only call this function with a negative }(h(Only call this function with a negative hjɍhhhNhNubj[)}(h**err**h]herr}(hhhjҍhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjɍubh; zero or positive errors will probably not behave the way you think they should. If you want to clear the error from an xa_state, use xas_reset().}(h; zero or positive errors will probably not behave the way you think they should. If you want to clear the error from an xa_state, use xas_reset().hjɍhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_invalid (C function) c.xas_invalidhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h-bool xas_invalid (const struct xa_state *xas)h]ja)}(h,bool xas_invalid(const struct xa_state *xas)h](jg)}(hjh]hbool}(hhhj hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(h xas_invalidh]j)}(h xas_invalidh]h xas_invalid}(hhhj,hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj(ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h(const struct xa_state *xas)h]j)}(hconst struct xa_state *xash](jz)}(hj}h]hconst}(hhhjHhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjDubjy)}(h h]h }(hhhjUhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjDubjz)}(hjh]hstruct}(hhhjchhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjDubjy)}(h h]h }(hhhjphhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjDubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj~ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%j.sb c.xas_invalidasbuh1hhjDubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjDubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjDubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjDubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj@ubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubj+)}(hhh]h)}(h%Is the xas in a retry or error state?h]h%Is the xas in a retry or error state?}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const struct xa_state *xas`` XArray operation state. **Return** ``true`` if the xas cannot be used for operations.h](h)}(h**Parameters**h]j[)}(hj h]h Parameters}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh]j)}(h7``const struct xa_state *xas`` XArray operation state. h](j)}(h``const struct xa_state *xas``h]j4)}(hj(h]hconst struct xa_state *xas}(hhhj*hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj&ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj"ubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjChjAhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj=hMhj>ubah}(h]h ]h"]h$]h&]uh1jhj"ubeh}(h]h ]h"]h$]h&]uh1jhj=hMhjubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h **Return**h]j[)}(hjch]hReturn}(hhhjehhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjaubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h2``true`` if the xas cannot be used for operations.h](j4)}(h``true``h]htrue}(hhhj}hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjyubh* if the xas cannot be used for operations.}(h* if the xas cannot be used for operations.hjyhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_valid (C function) c.xas_validhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h+bool xas_valid (const struct xa_state *xas)h]ja)}(h*bool xas_valid(const struct xa_state *xas)h](jg)}(hjh]hbool}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjŏhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjďhMubj)}(h xas_validh]j)}(h xas_validh]h xas_valid}(hhhj׏hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjӏubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjďhMubj)}(h(const struct xa_state *xas)h]j)}(hconst struct xa_state *xash](jz)}(hj}h]hconst}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhj,hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj)ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj.modnameN classnameNj%j%)}j%]j%)}j%jُsb c.xas_validasbuh1hhjubjy)}(h h]h }(hhhjLhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjghhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjďhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjďhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubj+)}(hhh]h)}(h)Is the xas a valid cursor into the array?h]h)Is the xas a valid cursor into the array?}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjďhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const struct xa_state *xas`` XArray operation state. **Return** ``true`` if the xas can be used for operations.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh]j)}(h7``const struct xa_state *xas`` XArray operation state. h](j)}(h``const struct xa_state *xas``h]j4)}(hjӐh]hconst struct xa_state *xas}(hhhjՐhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjѐubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj͐ubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhj͐ubeh}(h]h ]h"]h$]h&]uh1jhjhMhjʐubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h/``true`` if the xas can be used for operations.h](j4)}(h``true``h]htrue}(hhhj(hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj$ubh' if the xas can be used for operations.}(h' if the xas can be used for operations.hj$hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_is_node (C function) c.xas_is_nodehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h-bool xas_is_node (const struct xa_state *xas)h]ja)}(h,bool xas_is_node(const struct xa_state *xas)h](jg)}(hjh]hbool}(hhhjbhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj^hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjphhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj^hhhjohMubj)}(h xas_is_nodeh]j)}(h xas_is_nodeh]h xas_is_node}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj~ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj^hhhjohMubj)}(h(const struct xa_state *xas)h]j)}(hconst struct xa_state *xash](jz)}(hj}h]hconst}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjƑhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjבhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjԑubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjّmodnameN classnameNj%j%)}j%]j%)}j%jsb c.xas_is_nodeasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhj^hhhjohMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjZhhhjohMubah}(h]jUah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjWhhubj+)}(hhh]h)}(hDoes the xas point to a node?h]hDoes the xas point to a node?}(hj?hj=hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj:hhubah}(h]h ]h"]h$]h&]uh1j*hjWhhhjohMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjUjNjUjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const struct xa_state *xas`` XArray operation state. **Return** ``true`` if the xas currently references a node.h](h)}(h**Parameters**h]j[)}(hj_h]h Parameters}(hhhjahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj]ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjYubj)}(hhh]j)}(h7``const struct xa_state *xas`` XArray operation state. h](j)}(h``const struct xa_state *xas``h]j4)}(hj~h]hconst struct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj|ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjxubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjxubeh}(h]h ]h"]h$]h&]uh1jhjhMhjuubah}(h]h ]h"]h$]h&]uh1jhjYubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjYubh)}(h0``true`` if the xas currently references a node.h](j4)}(h``true``h]htrue}(hhhjӒhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjϒubh( if the xas currently references a node.}(h( if the xas currently references a node.hjϒhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjYubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_reset (C function) c.xas_resethNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h%void xas_reset (struct xa_state *xas)h]ja)}(h$void xas_reset(struct xa_state *xas)h](jg)}(hvoidh]hvoid}(hhhj hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj hhhjhMubj)}(h xas_reseth]j)}(h xas_reseth]h xas_reset}(hhhj.hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj*ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj hhhjhMubj)}(h(struct xa_state *xas)h]j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjJhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjFubjy)}(h h]h }(hhhjWhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjFubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjeubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjjmodnameN classnameNj%j%)}j%]j%)}j%j0sb c.xas_resetasbuh1hhjFubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjFubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjFubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjFubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjBubah}(h]h ]h"]h$]h&]hhuh1jhj hhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubj+)}(hhh]h)}(h Reset an XArray operation state.h]h Reset an XArray operation state.}(hjГhjΓhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj˓hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX"**Parameters** ``struct xa_state *xas`` XArray operation state. **Description** Resets the error or walk state of the **xas** so future walks of the array will start from the root. Use this if you have dropped the xarray lock and want to reuse the xa_state. **Context** Any context.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh]j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj ubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hj*hj(hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj$hMhj%ubah}(h]h ]h"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]uh1jhj$hMhjubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjJh]h Description}(hhhjLhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjHubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(hResets the error or walk state of the **xas** so future walks of the array will start from the root. Use this if you have dropped the xarray lock and want to reuse the xa_state.h](h&Resets the error or walk state of the }(h&Resets the error or walk state of the hj`hhhNhNubj[)}(h**xas**h]hxas}(hhhjihhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj`ubh so future walks of the array will start from the root. Use this if you have dropped the xarray lock and want to reuse the xa_state.}(h so future walks of the array will start from the root. Use this if you have dropped the xarray lock and want to reuse the xa_state.hj`hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h Any context.h]h Any context.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_retry (C function) c.xas_retryhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h8bool xas_retry (struct xa_state *xas, const void *entry)h]ja)}(h7bool xas_retry(struct xa_state *xas, const void *entry)h](jg)}(hjh]hbool}(hhhjʔhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjƔhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhjؔhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjƔhhhjהhMubj)}(h xas_retryh]j)}(h xas_retryh]h xas_retry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjƔhhhjהhMubj)}(h)(struct xa_state *xas, const void *entry)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhj$hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj!ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj&modnameN classnameNj%j%)}j%]j%)}j%jsb c.xas_retryasbuh1hhjubjy)}(h h]h }(hhhjDhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjRhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhj_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hconst void *entryh](jz)}(hj}h]hconst}(hhhjxhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjtubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjtubjg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjtubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjtubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjtubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjtubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjƔhhhjהhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj”hhhjהhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubj+)}(hhh]h)}(h#Retry the operation if appropriate.h]h#Retry the operation if appropriate.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjהhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xa_state *xas`` XArray operation state. ``const void *entry`` Entry from xarray. **Description** The advanced functions may sometimes return an internal entry, such as a retry entry or a zero entry. This function sets up the **xas** to restart the walk from the head of the array if needed. **Context** Any context. **Return** true if the operation needs to be retried.h](h)}(h**Parameters**h]j[)}(hj h]h Parameters}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hj(h]hstruct xa_state *xas}(hhhj*hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj&ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj"ubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjChjAhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj=hMhj>ubah}(h]h ]h"]h$]h&]uh1jhj"ubeh}(h]h ]h"]h$]h&]uh1jhj=hMhjubj)}(h)``const void *entry`` Entry from xarray. h](j)}(h``const void *entry``h]j4)}(hjah]hconst void *entry}(hhhjchhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj_ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj[ubj)}(hhh]h)}(hEntry from xarray.h]hEntry from xarray.}(hj|hjzhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjvhMhjwubah}(h]h ]h"]h$]h&]uh1jhj[ubeh}(h]h ]h"]h$]h&]uh1jhjvhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(hThe advanced functions may sometimes return an internal entry, such as a retry entry or a zero entry. This function sets up the **xas** to restart the walk from the head of the array if needed.h](hThe advanced functions may sometimes return an internal entry, such as a retry entry or a zero entry. This function sets up the }(hThe advanced functions may sometimes return an internal entry, such as a retry entry or a zero entry. This function sets up the hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh: to restart the walk from the head of the array if needed.}(h: to restart the walk from the head of the array if needed.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h **Context**h]j[)}(hjזh]hContext}(hhhjٖhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjՖubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h Any context.h]h Any context.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h*true if the operation needs to be retried.h]h*true if the operation needs to be retried.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_reload (C function) c.xas_reloadhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h(void * xas_reload (struct xa_state *xas)h]ja)}(h&void *xas_reload(struct xa_state *xas)h](jg)}(hvoidh]hvoid}(hhhjChhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj?hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM/ubjy)}(h h]h }(hhhjRhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj?hhhjQhM/ubj)}(hj(h]h*}(hhhj`hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj?hhhjQhM/ubj)}(h xas_reloadh]j)}(h xas_reloadh]h xas_reload}(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjmubah}(h]h ](jjeh"]h$]h&]hhuh1jhj?hhhjQhM/ubj)}(h(struct xa_state *xas)h]j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jssb c.xas_reloadasbuh1hhjubjy)}(h h]h }(hhhj˗hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjٗhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhj?hhhjQhM/ubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj;hhhjQhM/ubah}(h]j6ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM;hj8hhubj+)}(hhh]h)}(h!Refetch an entry from the xarray.h]h!Refetch an entry from the xarray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM.hjhhubah}(h]h ]h"]h$]h&]uh1j*hj8hhhjQhM/ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj)jNj)jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xa_state *xas`` XArray operation state. **Description** Use this function to check that a previously loaded entry still has the same value. This is useful for the lockless pagecache lookup where we walk the array with only the RCU lock to protect us, lock the page, then check that the page hasn't moved since we looked it up. The caller guarantees that **xas** is still valid. If it may be in an error or restart state, call xas_load() instead. **Return** The entry at this location in the xarray.h](h)}(h**Parameters**h]j[)}(hj3h]h Parameters}(hhhj5hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj1ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM2hj-ubj)}(hhh]j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjRh]hstruct xa_state *xas}(hhhjThhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjPubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM/hjLubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjmhjkhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjghM/hjhubah}(h]h ]h"]h$]h&]uh1jhjLubeh}(h]h ]h"]h$]h&]uh1jhjghM/hjIubah}(h]h ]h"]h$]h&]uh1jhj-ubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM1hj-ubh)}(hXUse this function to check that a previously loaded entry still has the same value. This is useful for the lockless pagecache lookup where we walk the array with only the RCU lock to protect us, lock the page, then check that the page hasn't moved since we looked it up.h]hXUse this function to check that a previously loaded entry still has the same value. This is useful for the lockless pagecache lookup where we walk the array with only the RCU lock to protect us, lock the page, then check that the page hasn’t moved since we looked it up.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM1hj-ubh)}(hwThe caller guarantees that **xas** is still valid. If it may be in an error or restart state, call xas_load() instead.h](hThe caller guarantees that }(hThe caller guarantees that hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubhU is still valid. If it may be in an error or restart state, call xas_load() instead.}(hU is still valid. If it may be in an error or restart state, call xas_load() instead.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM6hj-ubh)}(h **Return**h]j[)}(hjטh]hReturn}(hhhj٘hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj՘ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM9hj-ubh)}(h)The entry at this location in the xarray.h]h)The entry at this location in the xarray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM9hj-ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_set (C function) c.xas_sethNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h8void xas_set (struct xa_state *xas, unsigned long index)h]ja)}(h7void xas_set(struct xa_state *xas, unsigned long index)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMQubjy)}(h h]h }(hhhj+hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhj*hMQubj)}(hxas_seth]j)}(hxas_seth]hxas_set}(hhhj=hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj9ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhj*hMQubj)}(h+(struct xa_state *xas, unsigned long index)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjUubjy)}(h h]h }(hhhjfhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjUubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjwhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjtubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjymodnameN classnameNj%j%)}j%]j%)}j%j?sb c.xas_setasbuh1hhjUubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjUubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjUubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjUubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjQubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhj˙hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjǙubjy)}(h h]h }(hhhjٙhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjǙubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjǙubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjǙubj)}(hindexh]hindex}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjǙubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjQubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhj*hMQubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhj*hMQubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMXhjhhubj+)}(hhh]h)}(h4Set up XArray operation state for a different index.h]h4Set up XArray operation state for a different index.}(hj0hj.hhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMPhj+hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhj*hMQubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjFjNjFjOuh1jUhhhj3hNhNubjQ)}(hX+**Parameters** ``struct xa_state *xas`` XArray operation state. ``unsigned long index`` New index into the XArray. **Description** Move the operation state to refer to a different index. This will have the effect of starting a walk from the top; see xas_next() to move to an adjacent index.h](h)}(h**Parameters**h]j[)}(hjPh]h Parameters}(hhhjRhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMThjJubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjoh]hstruct xa_state *xas}(hhhjqhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjmubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMQhjiubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMQhjubah}(h]h ]h"]h$]h&]uh1jhjiubeh}(h]h ]h"]h$]h&]uh1jhjhMQhjfubj)}(h3``unsigned long index`` New index into the XArray. h](j)}(h``unsigned long index``h]j4)}(hjh]hunsigned long index}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMRhjubj)}(hhh]h)}(hNew index into the XArray.h]hNew index into the XArray.}(hjÚhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMRhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMRhjfubeh}(h]h ]h"]h$]h&]uh1jhjJubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMThjJubh)}(hMove the operation state to refer to a different index. This will have the effect of starting a walk from the top; see xas_next() to move to an adjacent index.h]hMove the operation state to refer to a different index. This will have the effect of starting a walk from the top; see xas_next() to move to an adjacent index.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMThjJubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_advance (C function) c.xas_advancehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj:ubj)}(hhh]h)}(hHighest index to return.h]hHighest index to return.}(hj[hjYhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjUhMhjVubah}(h]h ]h"]h$]h&]uh1jhj:ubeh}(h]h ]h"]h$]h&]uh1jhjUhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hj{h]h Description}(hhhj}hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjyubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(hxas_next_entry() is an inline function to optimise xarray traversal for speed. It is equivalent to calling xas_find(), and will call xas_find() for all the hard cases.h]hxas_next_entry() is an inline function to optimise xarray traversal for speed. It is equivalent to calling xas_find(), and will call xas_find() for all the hard cases.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubh)}(hFThe next present entry after the one currently referred to by **xas**.h](h>The next present entry after the one currently referred to by }(h>The next present entry after the one currently referred to by hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh.}(hjhjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_next_marked (C function)c.xas_next_markedhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hPvoid * xas_next_marked (struct xa_state *xas, unsigned long max, xa_mark_t mark)h]ja)}(hNvoid *xas_next_marked(struct xa_state *xas, unsigned long max, xa_mark_t mark)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhhhjhMubj)}(hxas_next_markedh]j)}(hxas_next_markedh]hxas_next_marked}(hhhj(hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj$ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h9(struct xa_state *xas, unsigned long max, xa_mark_t mark)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjDhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj@ubjy)}(h h]h }(hhhjQhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj@ubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjbhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj_ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjdmodnameN classnameNj%j%)}j%]j%)}j%j*sbc.xas_next_markedasbuh1hhj@ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj@ubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj@ubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj@ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj<ubj)}(hunsigned long maxh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjĤhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjҤhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmaxh]hmax}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj<ubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj modnameN classnameNj%j%)}j%]j~c.xas_next_markedasbuh1hhjubjy)}(h h]h }(hhhj(hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmarkh]hmark}(hhhj6hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj<ubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjhhubj+)}(hhh]h)}(h&Advance iterator to next marked entry.h]h&Advance iterator to next marked entry.}(hjchjahhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj^hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjyjNjyjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xa_state *xas`` XArray operation state. ``unsigned long max`` Highest index to return. ``xa_mark_t mark`` Mark to search for. **Description** xas_next_marked() is an inline function to optimise xarray traversal for speed. It is equivalent to calling xas_find_marked(), and will call xas_find_marked() for all the hard cases. **Return** The next marked entry after the one currently referred to by **xas**.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}ubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h/``unsigned long max`` Highest index to return. h](j)}(h``unsigned long max``h]j4)}(hjۥh]hunsigned long max}(hhhjݥhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj٥ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjեubj)}(hhh]h)}(hHighest index to return.h]hHighest index to return.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjեubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h'``xa_mark_t mark`` Mark to search for. h](j)}(h``xa_mark_t mark``h]j4)}(hjh]hxa_mark_t mark}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh]h)}(hMark to search for.h]hMark to search for.}(hj/hj-hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj)hMhj*ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj)hMhjubeh}(h]h ]h"]h$]h&]uh1jhj}ubh)}(h**Description**h]j[)}(hjOh]h Description}(hhhjQhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjMubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}ubh)}(hxas_next_marked() is an inline function to optimise xarray traversal for speed. It is equivalent to calling xas_find_marked(), and will call xas_find_marked() for all the hard cases.h]hxas_next_marked() is an inline function to optimise xarray traversal for speed. It is equivalent to calling xas_find_marked(), and will call xas_find_marked() for all the hard cases.}(hjghjehhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}ubh)}(h **Return**h]j[)}(hjvh]hReturn}(hhhjxhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjtubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}ubh)}(hEThe next marked entry after the one currently referred to by **xas**.h](h=The next marked entry after the one currently referred to by }(h=The next marked entry after the one currently referred to by hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh.}(hjhjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj}ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_for_each (C macro)c.xas_for_eachhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h xas_for_eachh]ja)}(h xas_for_eachh]j)}(h xas_for_eachh]j)}(hjȦh]h xas_for_each}(hhhjҦhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjΦubah}(h]h ](jjeh"]h$]h&]hhuh1jhjʦhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubah}(h]h ]h"]h$]h&]hhjuh1j`jjhjƦhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjæhhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hjæhhhjhMubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubh)}(h"``xas_for_each (xas, entry, max)``h]j4)}(hjh]hxas_for_each (xas, entry, max)}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj3hhubj !)}(hhh]h)}(h"Iterate over a range of an XArray.h]h"Iterate over a range of an XArray.}(hj hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hX **Parameters** ``xas`` XArray operation state. ``entry`` Entry retrieved from the array. ``max`` Maximum index to retrieve from array. **Description** The loop body will be executed for each entry present in the xarray between the current xas position and **max**. **entry** will be set to the entry retrieved from the xarray. It is safe to delete entries from the array in the loop body. You should hold either the RCU lock or the xa_lock while iterating. If you need to drop the lock, call xas_pause() first.h](h)}(h**Parameters**h]j[)}(hj9h]h Parameters}(hhhj;hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj7ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj3ubj)}(hhh](j)}(h ``xas`` XArray operation state. h](j)}(h``xas``h]j4)}(hjXh]hxas}(hhhjZhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjVubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjRubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjshjqhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjmhMhjnubah}(h]h ]h"]h$]h&]uh1jhjRubeh}(h]h ]h"]h$]h&]uh1jhjmhMhjOubj)}(h*``entry`` Entry retrieved from the array. h](j)}(h ``entry``h]j4)}(hjh]hentry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh]h)}(hEntry retrieved from the array.h]hEntry retrieved from the array.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjOubj)}(h.``max`` Maximum index to retrieve from array. h](j)}(h``max``h]j4)}(hjʧh]hmax}(hhhj̧hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjȧubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjħubj)}(hhh]h)}(h%Maximum index to retrieve from array.h]h%Maximum index to retrieve from array.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjߧhMhjubah}(h]h ]h"]h$]h&]uh1jhjħubeh}(h]h ]h"]h$]h&]uh1jhjߧhMhjOubeh}(h]h ]h"]h$]h&]uh1jhj3ubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj3ubh)}(hXkThe loop body will be executed for each entry present in the xarray between the current xas position and **max**. **entry** will be set to the entry retrieved from the xarray. It is safe to delete entries from the array in the loop body. You should hold either the RCU lock or the xa_lock while iterating. If you need to drop the lock, call xas_pause() first.h](hiThe loop body will be executed for each entry present in the xarray between the current xas position and }(hiThe loop body will be executed for each entry present in the xarray between the current xas position and hjhhhNhNubj[)}(h**max**h]hmax}(hhhj$hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh. }(h. hjhhhNhNubj[)}(h **entry**h]hentry}(hhhj7hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh will be set to the entry retrieved from the xarray. It is safe to delete entries from the array in the loop body. You should hold either the RCU lock or the xa_lock while iterating. If you need to drop the lock, call xas_pause() first.}(h will be set to the entry retrieved from the xarray. It is safe to delete entries from the array in the loop body. You should hold either the RCU lock or the xa_lock while iterating. If you need to drop the lock, call xas_pause() first.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj3ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_for_each_marked (C macro)c.xas_for_each_markedhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hxas_for_each_markedh]ja)}(hxas_for_each_markedh]j)}(hxas_for_each_markedh]j)}(hjkh]hxas_for_each_marked}(hhhjuhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjqubah}(h]h ](jjeh"]h$]h&]hhuh1jhjmhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMubah}(h]h ]h"]h$]h&]hhjuh1j`jjhjihhhjhMubah}(h]jdah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjfhhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hjfhhhjhMubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubh)}(h/``xas_for_each_marked (xas, entry, max, mark)``h]j4)}(hjh]h+xas_for_each_marked (xas, entry, max, mark)}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj3hhubj !)}(hhh]h)}(h"Iterate over a range of an XArray.h]h"Iterate over a range of an XArray.}(hjèhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM hjubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hX,**Parameters** ``xas`` XArray operation state. ``entry`` Entry retrieved from the array. ``max`` Maximum index to retrieve from array. ``mark`` Mark to search for. **Description** The loop body will be executed for each marked entry in the xarray between the current xas position and **max**. **entry** will be set to the entry retrieved from the xarray. It is safe to delete entries from the array in the loop body. You should hold either the RCU lock or the xa_lock while iterating. If you need to drop the lock, call xas_pause() first.h](h)}(h**Parameters**h]j[)}(hjܨh]h Parameters}(hhhjިhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjڨubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj֨ubj)}(hhh](j)}(h ``xas`` XArray operation state. h](j)}(h``xas``h]j4)}(hjh]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM hjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM hjubj)}(h*``entry`` Entry retrieved from the array. h](j)}(h ``entry``h]j4)}(hj4h]hentry}(hhhj6hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj2ubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM hj.ubj)}(hhh]h)}(hEntry retrieved from the array.h]hEntry retrieved from the array.}(hjOhjMhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjIhM hjJubah}(h]h ]h"]h$]h&]uh1jhj.ubeh}(h]h ]h"]h$]h&]uh1jhjIhM hjubj)}(h.``max`` Maximum index to retrieve from array. h](j)}(h``max``h]j4)}(hjmh]hmax}(hhhjohhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjkubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjgubj)}(hhh]h)}(h%Maximum index to retrieve from array.h]h%Maximum index to retrieve from array.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjgubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h``mark`` Mark to search for. h](j)}(h``mark``h]j4)}(hjh]hmark}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubj)}(hhh]h)}(hMark to search for.h]hMark to search for.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubeh}(h]h ]h"]h$]h&]uh1jhj֨ubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjߩubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj֨ubh)}(hXjThe loop body will be executed for each marked entry in the xarray between the current xas position and **max**. **entry** will be set to the entry retrieved from the xarray. It is safe to delete entries from the array in the loop body. You should hold either the RCU lock or the xa_lock while iterating. If you need to drop the lock, call xas_pause() first.h](hhThe loop body will be executed for each marked entry in the xarray between the current xas position and }(hhThe loop body will be executed for each marked entry in the xarray between the current xas position and hjhhhNhNubj[)}(h**max**h]hmax}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh. }(h. hjhhhNhNubj[)}(h **entry**h]hentry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh will be set to the entry retrieved from the xarray. It is safe to delete entries from the array in the loop body. You should hold either the RCU lock or the xa_lock while iterating. If you need to drop the lock, call xas_pause() first.}(h will be set to the entry retrieved from the xarray. It is safe to delete entries from the array in the loop body. You should hold either the RCU lock or the xa_lock while iterating. If you need to drop the lock, call xas_pause() first.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj֨ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_for_each_conflict (C macro)c.xas_for_each_conflicthNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hxas_for_each_conflicth]ja)}(hxas_for_each_conflicth]j)}(hxas_for_each_conflicth]j)}(hjGh]hxas_for_each_conflict}(hhhjQhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjMubah}(h]h ](jjeh"]h$]h&]hhuh1jhjIhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM)ubah}(h]h ]h"]h$]h&]hhjuh1j`jjhjEhhhjdhM)ubah}(h]j@ah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM(hjBhhubj+)}(hhh]h}(h]h ]h"]h$]h&]uh1j*hjBhhhjdhM)ubeh}(h]h ](jGmacroeh"]h$]h&]jLjGjMj~jNj~jOuh1jUhhhj3hNhNubh)}(h&``xas_for_each_conflict (xas, entry)``h]j4)}(hjh]h"xas_for_each_conflict (xas, entry)}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM*hj3hhubj !)}(hhh]h)}(h"Iterate over a range of an XArray.h]h"Iterate over a range of an XArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjubah}(h]h ]h"]h$]h&]uh1j !hj3hhhNhNubjQ)}(hX**Parameters** ``xas`` XArray operation state. ``entry`` Entry retrieved from the array. **Description** The loop body will be executed for each entry in the XArray that lies within the range specified by **xas**. If the loop terminates normally, **entry** will be ``NULL``. The user may break out of the loop, which will leave **entry** set to the conflicting entry. The caller may also call xa_set_err() to exit the loop while setting an error to record the reason.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM!hjubj)}(hhh](j)}(h ``xas`` XArray operation state. h](j)}(h``xas``h]j4)}(hjתh]hxas}(hhhj٪hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjժubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhjѪubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjѪubeh}(h]h ]h"]h$]h&]uh1jhjhMhjΪubj)}(h*``entry`` Entry retrieved from the array. h](j)}(h ``entry``h]j4)}(hjh]hentry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMhj ubj)}(hhh]h)}(hEntry retrieved from the array.h]hEntry retrieved from the array.}(hj+hj)hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj%hMhj&ubah}(h]h ]h"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]uh1jhj%hMhjΪubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjKh]h Description}(hhhjMhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjIubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM!hjubh)}(hXmThe loop body will be executed for each entry in the XArray that lies within the range specified by **xas**. If the loop terminates normally, **entry** will be ``NULL``. The user may break out of the loop, which will leave **entry** set to the conflicting entry. The caller may also call xa_set_err() to exit the loop while setting an error to record the reason.h](hdThe loop body will be executed for each entry in the XArray that lies within the range specified by }(hdThe loop body will be executed for each entry in the XArray that lies within the range specified by hjahhhNhNubj[)}(h**xas**h]hxas}(hhhjjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjaubh$. If the loop terminates normally, }(h$. If the loop terminates normally, hjahhhNhNubj[)}(h **entry**h]hentry}(hhhj}hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjaubh will be }(h will be hjahhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjaubh8. The user may break out of the loop, which will leave }(h8. The user may break out of the loop, which will leave hjahhhNhNubj[)}(h **entry**h]hentry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjaubh set to the conflicting entry. The caller may also call xa_set_err() to exit the loop while setting an error to record the reason.}(h set to the conflicting entry. The caller may also call xa_set_err() to exit the loop while setting an error to record the reason.hjahhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM!hjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_prev (C function) c.xas_prevhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h&void * xas_prev (struct xa_state *xas)h]ja)}(h$void *xas_prev(struct xa_state *xas)h](jg)}(hvoidh]hvoid}(hhhjݫhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj٫hhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM0ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj٫hhhjhM0ubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj٫hhhjhM0ubj)}(hxas_prevh]j)}(hxas_prevh]hxas_prev}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhj٫hhhjhM0ubj)}(h(struct xa_state *xas)h]j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj#ubjy)}(h h]h }(hhhj4hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj#ubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjEhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjBubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjGmodnameN classnameNj%j%)}j%]j%)}j%j sb c.xas_prevasbuh1hhj#ubjy)}(h h]h }(hhhjehhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj#ubj)}(hj(h]h*}(hhhjshhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj#ubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj#ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhj٫hhhjhM0ubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjիhhhjhM0ubah}(h]jЫah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM>hjҫhhubj+)}(hhh]h)}(h Move iterator to previous index.h]h Move iterator to previous index.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM/hjhhubah}(h]h ]h"]h$]h&]uh1j*hjҫhhhjhM0ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjìjNjìjOuh1jUhhhj3hNhNubjQ)}(hXP**Parameters** ``struct xa_state *xas`` XArray operation state. **Description** If the **xas** was in an error state, it will remain in an error state and this function will return ``NULL``. If the **xas** has never been walked, it will have the effect of calling xas_load(). Otherwise one will be subtracted from the index and the state will be walked to the correct location in the array for the next operation. If the iterator was referencing index 0, this function wraps around to ``ULONG_MAX``. **Return** The entry at the new index. This may be ``NULL`` or an internal entry.h](h)}(h**Parameters**h]j[)}(hjͬh]h Parameters}(hhhjϬhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjˬubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM3hjǬubj)}(hhh]j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM0hjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM0hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM0hjubah}(h]h ]h"]h$]h&]uh1jhjǬubh)}(h**Description**h]j[)}(hj'h]h Description}(hhhj)hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj%ubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM2hjǬubh)}(hXOIf the **xas** was in an error state, it will remain in an error state and this function will return ``NULL``. If the **xas** has never been walked, it will have the effect of calling xas_load(). Otherwise one will be subtracted from the index and the state will be walked to the correct location in the array for the next operation.h](hIf the }(hIf the hj=hhhNhNubj[)}(h**xas**h]hxas}(hhhjFhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj=ubhW was in an error state, it will remain in an error state and this function will return }(hW was in an error state, it will remain in an error state and this function will return hj=hhhNhNubj4)}(h``NULL``h]hNULL}(hhhjYhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj=ubh . If the }(h . If the hj=hhhNhNubj[)}(h**xas**h]hxas}(hhhjlhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj=ubh has never been walked, it will have the effect of calling xas_load(). Otherwise one will be subtracted from the index and the state will be walked to the correct location in the array for the next operation.}(h has never been walked, it will have the effect of calling xas_load(). Otherwise one will be subtracted from the index and the state will be walked to the correct location in the array for the next operation.hj=hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM2hjǬubh)}(hUIf the iterator was referencing index 0, this function wraps around to ``ULONG_MAX``.h](hGIf the iterator was referencing index 0, this function wraps around to }(hGIf the iterator was referencing index 0, this function wraps around to hjhhhNhNubj4)}(h ``ULONG_MAX``h]h ULONG_MAX}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh.}(hjhjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM8hjǬubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM;hjǬubh)}(hGThe entry at the new index. This may be ``NULL`` or an internal entry.h](h)The entry at the new index. This may be }(h)The entry at the new index. This may be hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjɭhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh or an internal entry.}(h or an internal entry.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM;hjǬubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_next (C function) c.xas_nexthNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h&void * xas_next (struct xa_state *xas)h]ja)}(h$void *xas_next(struct xa_state *xas)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMMubj)}(hj(h]h*}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhhhjhMMubj)}(hxas_nexth]j)}(hxas_nexth]hxas_next}(hhhj1hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj-ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMMubj)}(h(struct xa_state *xas)h]j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjMhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjIubjy)}(h h]h }(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjIubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjkhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmmodnameN classnameNj%j%)}j%]j%)}j%j3sb c.xas_nextasbuh1hhjIubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjIubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjIubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjIubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjEubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhM[hjhhubj+)}(hhh]h)}(hMove state to next index.h]hMove state to next index.}(hjӮhjѮhhhNhNubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMLhjήhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hXI**Parameters** ``struct xa_state *xas`` XArray operation state. **Description** If the **xas** was in an error state, it will remain in an error state and this function will return ``NULL``. If the **xas** has never been walked, it will have the effect of calling xas_load(). Otherwise one will be added to the index and the state will be walked to the correct location in the array for the next operation. If the iterator was referencing index ``ULONG_MAX``, this function wraps around to 0. **Return** The entry at the new index. This may be ``NULL`` or an internal entry.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMPhjubj)}(hhh]j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMMhj ubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hj-hj+hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj'hMMhj(ubah}(h]h ]h"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]uh1jhj'hMMhj ubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjMh]h Description}(hhhjOhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjKubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMOhjubh)}(hXHIf the **xas** was in an error state, it will remain in an error state and this function will return ``NULL``. If the **xas** has never been walked, it will have the effect of calling xas_load(). Otherwise one will be added to the index and the state will be walked to the correct location in the array for the next operation.h](hIf the }(hIf the hjchhhNhNubj[)}(h**xas**h]hxas}(hhhjlhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjcubhW was in an error state, it will remain in an error state and this function will return }(hW was in an error state, it will remain in an error state and this function will return hjchhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjcubh . If the }(h . If the hjchhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjcubh has never been walked, it will have the effect of calling xas_load(). Otherwise one will be added to the index and the state will be walked to the correct location in the array for the next operation.}(h has never been walked, it will have the effect of calling xas_load(). Otherwise one will be added to the index and the state will be walked to the correct location in the array for the next operation.hjchhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMOhjubh)}(hUIf the iterator was referencing index ``ULONG_MAX``, this function wraps around to 0.h](h&If the iterator was referencing index }(h&If the iterator was referencing index hjhhhNhNubj4)}(h ``ULONG_MAX``h]h ULONG_MAX}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh", this function wraps around to 0.}(h", this function wraps around to 0.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMUhjubh)}(h **Return**h]j[)}(hjѯh]hReturn}(hhhjӯhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjϯubah}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMXhjubh)}(hGThe entry at the new index. This may be ``NULL`` or an internal entry.h](h)The entry at the new index. This may be }(h)The entry at the new index. This may be hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh or an internal entry.}(h or an internal entry.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhW/var/lib/git/docbuild/linux/Documentation/core-api/xarray:495: ./include/linux/xarray.hhMXhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_load (C function) c.xas_loadhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h&void * xas_load (struct xa_state *xas)h]ja)}(h$void *xas_load(struct xa_state *xas)h](jg)}(hvoidh]hvoid}(hhhj*hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj&hhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKubjy)}(h h]h }(hhhj9hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj&hhhj8hKubj)}(hj(h]h*}(hhhjGhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj&hhhj8hKubj)}(hxas_loadh]j)}(hxas_loadh]hxas_load}(hhhjXhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjTubah}(h]h ](jjeh"]h$]h&]hhuh1jhj&hhhj8hKubj)}(h(struct xa_state *xas)h]j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjthhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjpubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjpubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jZsb c.xas_loadasbuh1hhjpubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjpubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjpubj)}(hxash]hxas}(hhhjͰhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjpubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjlubah}(h]h ]h"]h$]h&]hhuh1jhj&hhhj8hKubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj"hhhj8hKubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjhhubj+)}(hhh]h)}(h)Load an entry from the XArray (advanced).h]h)Load an entry from the XArray (advanced).}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhj8hKubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xa_state *xas`` XArray operation state. **Description** Usually walks the **xas** to the appropriate state to load the entry stored at xa_index. However, it will do nothing and return ``NULL`` if **xas** is in an error state. xas_load() will never expand the tree. If the xa_state is set up to operate on a multi-index entry, xas_load() may return ``NULL`` or an internal entry, even if there are entries present within the range specified by **xas**. **Context** Any context. The caller should hold the xa_lock or the RCU lock. **Return** Usually an entry in the XArray, but see description for exceptions.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjubj)}(hhh]j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hj9h]hstruct xa_state *xas}(hhhj;hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj7ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhj3ubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjThjRhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjNhKhjOubah}(h]h ]h"]h$]h&]uh1jhj3ubeh}(h]h ]h"]h$]h&]uh1jhjNhKhj0ubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjth]h Description}(hhhjvhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjrubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjubh)}(hUsually walks the **xas** to the appropriate state to load the entry stored at xa_index. However, it will do nothing and return ``NULL`` if **xas** is in an error state. xas_load() will never expand the tree.h](hUsually walks the }(hUsually walks the hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]:h&]uh1jZhjubhh to the appropriate state to load the entry stored at xa_index. However, it will do nothing and return }(hh to the appropriate state to load the entry stored at xa_index. However, it will do nothing and return hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh if }(h if hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh> is in an error state. xas_load() will never expand the tree.}(h> is in an error state. xas_load() will never expand the tree.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjubh)}(hIf the xa_state is set up to operate on a multi-index entry, xas_load() may return ``NULL`` or an internal entry, even if there are entries present within the range specified by **xas**.h](hSIf the xa_state is set up to operate on a multi-index entry, xas_load() may return }(hSIf the xa_state is set up to operate on a multi-index entry, xas_load() may return hjӱhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjܱhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjӱubhW or an internal entry, even if there are entries present within the range specified by }(hW or an internal entry, even if there are entries present within the range specified by hjӱhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjӱubh.}(hjhjӱhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjubh)}(h **Context**h]j[)}(hj h]hContext}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjubh)}(hAAny context. The caller should hold the xa_lock or the RCU lock.h]hAAny context. The caller should hold the xa_lock or the RCU lock.}(hj"hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjubh)}(h **Return**h]j[)}(hj1h]hReturn}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj/ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjubh)}(hCUsually an entry in the XArray, but see description for exceptions.h]hCUsually an entry in the XArray, but see description for exceptions.}(hjIhjGhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chKhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_nomem (C function) c.xas_nomemhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h0bool xas_nomem (struct xa_state *xas, gfp_t gfp)h]ja)}(h/bool xas_nomem(struct xa_state *xas, gfp_t gfp)h](jg)}(hjh]hbool}(hhhjvhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjrhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjrhhhjhMubj)}(h xas_nomemh]j)}(h xas_nomemh]h xas_nomem}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjrhhhjhMubj)}(h!(struct xa_state *xas, gfp_t gfp)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjвhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjͲubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjҲmodnameN classnameNj%j%)}j%]j%)}j%jsb c.xas_nomemasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj$ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj)modnameN classnameNj%j%)}j%]j c.xas_nomemasbuh1hhj ubjy)}(h h]h }(hhhjEhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubj)}(hgfph]hgfp}(hhhjShhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjrhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjnhhhjhMubah}(h]jiah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM+hjkhhubj+)}(hhh]h)}(hAllocate memory if needed.h]hAllocate memory if needed.}(hjhj~hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj{hhubah}(h]h ]h"]h$]h&]uh1j*hjkhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xa_state *xas`` XArray operation state. ``gfp_t gfp`` Memory allocation flags. **Description** If we need to add new nodes to the XArray, we try to allocate memory with GFP_NOWAIT while holding the lock, which will usually succeed. If it fails, **xas** is flagged as needing memory to continue. The caller should drop the lock and call xas_nomem(). If xas_nomem() succeeds, the caller should retry the operation. Forward progress is guaranteed as one node is allocated here and stored in the xa_state where it will be found by xas_alloc(). More nodes will likely be found in the slab allocator, but we do not tie them up here. **Return** true if memory was needed, and was successfully allocated.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjڳhjسhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjԳhMhjճubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjԳhMhjubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjh]h gfp_t gfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj hMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hj3h]h Description}(hhhj5hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj1ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hX?If we need to add new nodes to the XArray, we try to allocate memory with GFP_NOWAIT while holding the lock, which will usually succeed. If it fails, **xas** is flagged as needing memory to continue. The caller should drop the lock and call xas_nomem(). If xas_nomem() succeeds, the caller should retry the operation.h](hIf we need to add new nodes to the XArray, we try to allocate memory with GFP_NOWAIT while holding the lock, which will usually succeed. If it fails, }(hIf we need to add new nodes to the XArray, we try to allocate memory with GFP_NOWAIT while holding the lock, which will usually succeed. If it fails, hjIhhhNhNubj[)}(h**xas**h]hxas}(hhhjRhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjIubh is flagged as needing memory to continue. The caller should drop the lock and call xas_nomem(). If xas_nomem() succeeds, the caller should retry the operation.}(h is flagged as needing memory to continue. The caller should drop the lock and call xas_nomem(). If xas_nomem() succeeds, the caller should retry the operation.hjIhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hForward progress is guaranteed as one node is allocated here and stored in the xa_state where it will be found by xas_alloc(). More nodes will likely be found in the slab allocator, but we do not tie them up here.h]hForward progress is guaranteed as one node is allocated here and stored in the xa_state where it will be found by xas_alloc(). More nodes will likely be found in the slab allocator, but we do not tie them up here.}(hjnhjlhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM$hjubh)}(h **Return**h]j[)}(hj}h]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj{ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM)hjubh)}(h:true if memory was needed, and was successfully allocated.h]h:true if memory was needed, and was successfully allocated.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM)hjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_free_nodes (C function)c.xas_free_nodeshNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h?void xas_free_nodes (struct xa_state *xas, struct xa_node *top)h]ja)}(h>void xas_free_nodes(struct xa_state *xas, struct xa_node *top)h](jg)}(hvoidh]hvoid}(hhhj´hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjѴhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjдhMubj)}(hxas_free_nodesh]j)}(hxas_free_nodesh]hxas_free_nodes}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjߴubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjдhMubj)}(h+(struct xa_state *xas, struct xa_node *top)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsbc.xas_free_nodesasbuh1hhjubjy)}(h h]h }(hhhj=hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjKhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjXhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hstruct xa_node *toph](jz)}(hjh]hstruct}(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjmubjy)}(h h]h }(hhhj~hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjmubh)}(hhh]j)}(hxa_nodeh]hxa_node}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j9c.xas_free_nodesasbuh1hhjmubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjmubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjmubj)}(htoph]htop}(hhhjȵhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjmubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjдhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjдhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM hjhhubj+)}(hhh]h)}(h/Free this node and all nodes that it referencesh]h/Free this node and all nodes that it references}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjдhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj jNj jOuh1jUhhhj3hNhNubjQ)}(hX?**Parameters** ``struct xa_state *xas`` Array operation state. ``struct xa_node *top`` Node to free **Description** This node has been removed from the tree. We must now free it and all of its subnodes. There may be RCU walkers with references into the tree, so we must replace all entries with retry markers.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h0``struct xa_state *xas`` Array operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hj4h]hstruct xa_state *xas}(hhhj6hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj2ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj.ubj)}(hhh]h)}(hArray operation state.h]hArray operation state.}(hjOhjMhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjIhMhjJubah}(h]h ]h"]h$]h&]uh1jhj.ubeh}(h]h ]h"]h$]h&]uh1jhjIhMhj+ubj)}(h%``struct xa_node *top`` Node to free h](j)}(h``struct xa_node *top``h]j4)}(hjmh]hstruct xa_node *top}(hhhjohhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjkubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjgubj)}(hhh]h)}(h Node to freeh]h Node to free}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjgubeh}(h]h ]h"]h$]h&]uh1jhjhMhj+ubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hThis node has been removed from the tree. We must now free it and all of its subnodes. There may be RCU walkers with references into the tree, so we must replace all entries with retry markers.h]hThis node has been removed from the tree. We must now free it and all of its subnodes. There may be RCU walkers with references into the tree, so we must replace all entries with retry markers.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_create_range (C function)c.xas_create_rangehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h,void xas_create_range (struct xa_state *xas)h]ja)}(h+void xas_create_range(struct xa_state *xas)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(hxas_create_rangeh]j)}(hxas_create_rangeh]hxas_create_range}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h(struct xa_state *xas)h]j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhj*hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj&ubjy)}(h h]h }(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj&ubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjHhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjEubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjJmodnameN classnameNj%j%)}j%]j%)}j%jsbc.xas_create_rangeasbuh1hhj&ubjy)}(h h]h }(hhhjhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj&ubj)}(hj(h]h*}(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj&ubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj&ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj"ubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubj+)}(hhh]h)}(h-Ensure that stores to this range will succeedh]h-Ensure that stores to this range will succeed}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjƷjNjƷjOuh1jUhhhj3hNhNubjQ)}(hXK**Parameters** ``struct xa_state *xas`` XArray operation state. **Description** Creates all of the slots in the range covered by **xas**. Sets **xas** to create single-index entries and positions it at the beginning of the range. This is for the benefit of users which have not yet been converted to use multi-index entries.h](h)}(h**Parameters**h]j[)}(hjзh]h Parameters}(hhhjҷhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjηubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjʷubj)}(hhh]j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hj hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjʷubh)}(h**Description**h]j[)}(hj*h]h Description}(hhhj,hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj(ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjʷubh)}(hCreates all of the slots in the range covered by **xas**. Sets **xas** to create single-index entries and positions it at the beginning of the range. This is for the benefit of users which have not yet been converted to use multi-index entries.h](h1Creates all of the slots in the range covered by }(h1Creates all of the slots in the range covered by hj@hhhNhNubj[)}(h**xas**h]hxas}(hhhjIhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj@ubh. Sets }(h. Sets hj@hhhNhNubj[)}(h**xas**h]hxas}(hhhj\hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj@ubh to create single-index entries and positions it at the beginning of the range. This is for the benefit of users which have not yet been converted to use multi-index entries.}(h to create single-index entries and positions it at the beginning of the range. This is for the benefit of users which have not yet been converted to use multi-index entries.hj@hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjʷubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_store (C function) c.xas_storehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h4void * xas_store (struct xa_state *xas, void *entry)h]ja)}(h2void *xas_store(struct xa_state *xas, void *entry)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhhhjhMubj)}(h xas_storeh]j)}(h xas_storeh]h xas_store}(hhhjĸhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h#(struct xa_state *xas, void *entry)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjܸubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjܸubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jƸsb c.xas_storeasbuh1hhjܸubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjܸubj)}(hj(h]h*}(hhhj,hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjܸubj)}(hxash]hxas}(hhhj9hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjܸubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjظubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjRhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjNubjy)}(h h]h }(hhhj`hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjNubj)}(hj(h]h*}(hhhjnhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjNubj)}(hentryh]hentry}(hhhj{hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjNubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjظubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubj+)}(hhh]h)}(hStore this entry in the XArray.h]hStore this entry in the XArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xa_state *xas`` XArray operation state. ``void *entry`` New entry. **Description** If **xas** is operating on a multi-index entry, the entry returned by this function is essentially meaningless (it may be an internal entry or it may be ``NULL``, even if there are non-NULL entries at some of the indices covered by the range). This is not a problem for any current users, and can be changed if needed. **Return** The old entry at this index.h](h)}(h**Parameters**h]j[)}(hjȹh]h Parameters}(hhhjʹhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjƹubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj¹ubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhj޹ubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hj h]h void *entry}(hhhj"hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(h New entry.h]h New entry.}(hj;hj9hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj5hMhj6ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj5hMhj޹ubeh}(h]h ]h"]h$]h&]uh1jhj¹ubh)}(h**Description**h]j[)}(hj[h]h Description}(hhhj]hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjYubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj¹ubh)}(hX?If **xas** is operating on a multi-index entry, the entry returned by this function is essentially meaningless (it may be an internal entry or it may be ``NULL``, even if there are non-NULL entries at some of the indices covered by the range). This is not a problem for any current users, and can be changed if needed.h](hIf }(hIf hjqhhhNhNubj[)}(h**xas**h]hxas}(hhhjzhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjqubh is operating on a multi-index entry, the entry returned by this function is essentially meaningless (it may be an internal entry or it may be }(h is operating on a multi-index entry, the entry returned by this function is essentially meaningless (it may be an internal entry or it may be hjqhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjqubh, even if there are non-NULL entries at some of the indices covered by the range). This is not a problem for any current users, and can be changed if needed.}(h, even if there are non-NULL entries at some of the indices covered by the range). This is not a problem for any current users, and can be changed if needed.hjqhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj¹ubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj¹ubh)}(hThe old entry at this index.h]hThe old entry at this index.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj¹ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_get_mark (C function)c.xas_get_markhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h>bool xas_get_mark (const struct xa_state *xas, xa_mark_t mark)h]ja)}(h=bool xas_get_mark(const struct xa_state *xas, xa_mark_t mark)h](jg)}(hjh]hbool}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMTubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMTubj)}(h xas_get_markh]j)}(h xas_get_markh]h xas_get_mark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMTubj)}(h,(const struct xa_state *xas, xa_mark_t mark)h](j)}(hconst struct xa_state *xash](jz)}(hj}h]hconst}(hhhj*hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj&ubjy)}(h h]h }(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj&ubjz)}(hjh]hstruct}(hhhjEhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj&ubjy)}(h h]h }(hhhjRhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj&ubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjchhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj`ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjemodnameN classnameNj%j%)}j%]j%)}j%jsbc.xas_get_markasbuh1hhj&ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj&ubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj&ubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj&ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj"ubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]jc.xas_get_markasbuh1hhjubjy)}(h h]h }(hhhjػhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmarkh]hmark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj"ubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMTubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMTubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMZhjhhubj+)}(hhh]h)}(hReturns the state of this mark.h]hReturns the state of this mark.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMShjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMTubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj)jNj)jOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``const struct xa_state *xas`` XArray operation state. ``xa_mark_t mark`` Mark number. **Return** true if the mark is set, false if the mark is clear or **xas** is in an error state.h](h)}(h**Parameters**h]j[)}(hj3h]h Parameters}(hhhj5hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj1ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMWhj-ubj)}(hhh](j)}(h7``const struct xa_state *xas`` XArray operation state. h](j)}(h``const struct xa_state *xas``h]j4)}(hjRh]hconst struct xa_state *xas}(hhhjThhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjPubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMThjLubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjmhjkhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjghMThjhubah}(h]h ]h"]h$]h&]uh1jhjLubeh}(h]h ]h"]h$]h&]uh1jhjghMThjIubj)}(h ``xa_mark_t mark`` Mark number. h](j)}(h``xa_mark_t mark``h]j4)}(hjh]hxa_mark_t mark}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMUhjubj)}(hhh]h)}(h Mark number.h]h Mark number.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMUhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMUhjIubeh}(h]h ]h"]h$]h&]uh1jhj-ubh)}(h **Return**h]j[)}(hjƼh]hReturn}(hhhjȼhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjļubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMWhj-ubh)}(hTtrue if the mark is set, false if the mark is clear or **xas** is in an error state.h](h7true if the mark is set, false if the mark is clear or }(h7true if the mark is set, false if the mark is clear or hjܼhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjܼubh is in an error state.}(h is in an error state.hjܼhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMWhj-ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_set_mark (C function)c.xas_set_markhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h>void xas_set_mark (const struct xa_state *xas, xa_mark_t mark)h]ja)}(h=void xas_set_mark(const struct xa_state *xas, xa_mark_t mark)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMfubjy)}(h h]h }(hhhj.hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhj-hMfubj)}(h xas_set_markh]j)}(h xas_set_markh]h xas_set_mark}(hhhj@hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj<ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhj-hMfubj)}(h,(const struct xa_state *xas, xa_mark_t mark)h](j)}(hconst struct xa_state *xash](jz)}(hj}h]hconst}(hhhj\hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjXubjy)}(h h]h }(hhhjihhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjXubjz)}(hjh]hstruct}(hhhjwhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjXubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjXubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jBsbc.xas_set_markasbuh1hhjXubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjXubj)}(hj(h]h*}(hhhjýhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjXubj)}(hxash]hxas}(hhhjнhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjXubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjTubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]jc.xas_set_markasbuh1hhjubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmarkh]hmark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjTubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhj-hMfubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhj-hMfubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMmhjhhubj+)}(hhh]h)}(h,Sets the mark on this entry and its parents.h]h,Sets the mark on this entry and its parents.}(hjEhjChhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMehj@hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhj-hMfubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj[jNj[jOuh1jUhhhj3hNhNubjQ)}(hX5**Parameters** ``const struct xa_state *xas`` XArray operation state. ``xa_mark_t mark`` Mark number. **Description** Sets the specified mark on this entry, and walks up the tree setting it on all the ancestor entries. Does nothing if **xas** has not been walked to an entry, or is in an error state.h](h)}(h**Parameters**h]j[)}(hjeh]h Parameters}(hhhjghhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjcubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMihj_ubj)}(hhh](j)}(h7``const struct xa_state *xas`` XArray operation state. h](j)}(h``const struct xa_state *xas``h]j4)}(hjh]hconst struct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMfhj~ubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMfhjubah}(h]h ]h"]h$]h&]uh1jhj~ubeh}(h]h ]h"]h$]h&]uh1jhjhMfhj{ubj)}(h ``xa_mark_t mark`` Mark number. h](j)}(h``xa_mark_t mark``h]j4)}(hjh]hxa_mark_t mark}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMghjubj)}(hhh]h)}(h Mark number.h]h Mark number.}(hjؾhj־hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjҾhMghjӾubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjҾhMghj{ubeh}(h]h ]h"]h$]h&]uh1jhj_ubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMihj_ubh)}(hSets the specified mark on this entry, and walks up the tree setting it on all the ancestor entries. Does nothing if **xas** has not been walked to an entry, or is in an error state.h](hvSets the specified mark on this entry, and walks up the tree setting it on all the ancestor entries. Does nothing if }(hvSets the specified mark on this entry, and walks up the tree setting it on all the ancestor entries. Does nothing if hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh: has not been walked to an entry, or is in an error state.}(h: has not been walked to an entry, or is in an error state.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMihj_ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_clear_mark (C function)c.xas_clear_markhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h@void xas_clear_mark (const struct xa_state *xas, xa_mark_t mark)h]ja)}(h?void xas_clear_mark(const struct xa_state *xas, xa_mark_t mark)h](jg)}(hvoidh]hvoid}(hhhjQhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjMhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhj`hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjMhhhj_hMubj)}(hxas_clear_markh]j)}(hxas_clear_markh]hxas_clear_mark}(hhhjrhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjnubah}(h]h ](jjeh"]h$]h&]hhuh1jhjMhhhj_hMubj)}(h,(const struct xa_state *xas, xa_mark_t mark)h](j)}(hconst struct xa_state *xash](jz)}(hj}h]hconst}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjǿhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjĿubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjɿmodnameN classnameNj%j%)}j%]j%)}j%jtsbc.xas_clear_markasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj modnameN classnameNj%j%)}j%]jc.xas_clear_markasbuh1hhjubjy)}(h h]h }(hhhj<hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmarkh]hmark}(hhhjJhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjMhhhj_hMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjIhhhj_hMubah}(h]jDah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjFhhubj+)}(hhh]h)}(h.Clears the mark on this entry and its parents.h]h.Clears the mark on this entry and its parents.}(hjwhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjrhhubah}(h]h ]h"]h$]h&]uh1j*hjFhhhj_hMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hXH**Parameters** ``const struct xa_state *xas`` XArray operation state. ``xa_mark_t mark`` Mark number. **Description** Clears the specified mark on this entry, and walks back to the head attempting to clear it on all the ancestor entries. Does nothing if **xas** has not been walked to an entry, or is in an error state.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h7``const struct xa_state *xas`` XArray operation state. h](j)}(h``const struct xa_state *xas``h]j4)}(hjh]hconst struct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h ``xa_mark_t mark`` Mark number. h](j)}(h``xa_mark_t mark``h]j4)}(hjh]hxa_mark_t mark}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(h Mark number.h]h Mark number.}(hj hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hj*h]h Description}(hhhj,hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj(ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hClears the specified mark on this entry, and walks back to the head attempting to clear it on all the ancestor entries. Does nothing if **xas** has not been walked to an entry, or is in an error state.h](hClears the specified mark on this entry, and walks back to the head attempting to clear it on all the ancestor entries. Does nothing if }(hClears the specified mark on this entry, and walks back to the head attempting to clear it on all the ancestor entries. Does nothing if hj@hhhNhNubj[)}(h**xas**h]hxas}(hhhjIhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj@ubh: has not been walked to an entry, or is in an error state.}(h: has not been walked to an entry, or is in an error state.hj@hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_init_marks (C function)c.xas_init_markshNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h0void xas_init_marks (const struct xa_state *xas)h]ja)}(h/void xas_init_marks(const struct xa_state *xas)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(hxas_init_marksh]j)}(hxas_init_marksh]hxas_init_marks}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h(const struct xa_state *xas)h]j)}(hconst struct xa_state *xash](jz)}(hj}h]hconst}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsbc.xas_init_marksasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhj4hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj{hhhjhMubah}(h]jvah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjxhhubj+)}(hhh]h)}(h"Initialise all marks for the entryh]h"Initialise all marks for the entry}(hjahj_hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj\hhubah}(h]h ]h"]h$]h&]uh1j*hjxhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjwjNjwjOuh1jUhhhj3hNhNubjQ)}(hXa**Parameters** ``const struct xa_state *xas`` Array operations state. **Description** Initialise all marks for the entry specified by **xas**. If we're tracking free entries with a mark, we need to set it on all entries. All other marks are cleared. This implementation is not as efficient as it could be; we may walk up the tree multiple times.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj{ubj)}(hhh]j)}(h7``const struct xa_state *xas`` Array operations state. h](j)}(h``const struct xa_state *xas``h]j4)}(hjh]hconst struct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hArray operations state.h]hArray operations state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubah}(h]h ]h"]h$]h&]uh1jhj{ubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj{ubh)}(hInitialise all marks for the entry specified by **xas**. If we're tracking free entries with a mark, we need to set it on all entries. All other marks are cleared.h](h0Initialise all marks for the entry specified by }(h0Initialise all marks for the entry specified by hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubhp. If we’re tracking free entries with a mark, we need to set it on all entries. All other marks are cleared.}(hn. If we're tracking free entries with a mark, we need to set it on all entries. All other marks are cleared.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj{ubh)}(h_This implementation is not as efficient as it could be; we may walk up the tree multiple times.h]h_This implementation is not as efficient as it could be; we may walk up the tree multiple times.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj{ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_split_alloc (C function)c.xas_split_allochNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hWvoid xas_split_alloc (struct xa_state *xas, void *entry, unsigned int order, gfp_t gfp)h]ja)}(hVvoid xas_split_alloc(struct xa_state *xas, void *entry, unsigned int order, gfp_t gfp)h](jg)}(hvoidh]hvoid}(hhhjChhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj?hhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjRhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj?hhhjQhMubj)}(hxas_split_alloch]j)}(hxas_split_alloch]hxas_split_alloc}(hhhjdhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj`ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj?hhhjQhMubj)}(hB(struct xa_state *xas, void *entry, unsigned int order, gfp_t gfp)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj|ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj|ubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jfsbc.xas_split_allocasbuh1hhj|ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj|ubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj|ubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj|ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjxubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjxubj)}(hunsigned int orderh](jg)}(hunsignedh]hunsigned}(hhhj4hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj0ubjy)}(h h]h }(hhhjBhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj0ubjg)}(hinth]hint}(hhhjPhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj0ubjy)}(h h]h }(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj0ubj)}(horderh]horder}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj0ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjxubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]jc.xas_split_allocasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hgfph]hgfp}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjxubeh}(h]h ]h"]h$]h&]hhuh1jhj?hhhjQhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj;hhhjQhMubah}(h]j6ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj8hhubj+)}(hhh]h)}(h'Allocate memory for splitting an entry.h]h'Allocate memory for splitting an entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hj8hhhjQhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xa_state *xas`` XArray operation state. ``void *entry`` New entry which will be stored in the array. ``unsigned int order`` Current entry order. ``gfp_t gfp`` Memory allocation flags. **Description** This function should be called before calling xas_split(). If necessary, it will allocate new nodes (and fill them with **entry**) to prepare for the upcoming split of an entry of **order** size into entries of the order stored in the **xas**. **Context** May sleep if **gfp** flags permit.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hj h]hstruct xa_state *xas}(hhhj"hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hj;hj9hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj5hMhj6ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj5hMhjubj)}(h=``void *entry`` New entry which will be stored in the array. h](j)}(h``void *entry``h]j4)}(hjYh]h void *entry}(hhhj[hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjWubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjSubj)}(hhh]h)}(h,New entry which will be stored in the array.h]h,New entry which will be stored in the array.}(hjthjrhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjnhMhjoubah}(h]h ]h"]h$]h&]uh1jhjSubeh}(h]h ]h"]h$]h&]uh1jhjnhMhjubj)}(h,``unsigned int order`` Current entry order. h](j)}(h``unsigned int order``h]j4)}(hjh]hunsigned int order}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hCurrent entry order.h]hCurrent entry order.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjh]h gfp_t gfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hThis function should be called before calling xas_split(). If necessary, it will allocate new nodes (and fill them with **entry**) to prepare for the upcoming split of an entry of **order** size into entries of the order stored in the **xas**.h](hxThis function should be called before calling xas_split(). If necessary, it will allocate new nodes (and fill them with }(hxThis function should be called before calling xas_split(). If necessary, it will allocate new nodes (and fill them with hjhhhNhNubj[)}(h **entry**h]hentry}(hhhj%hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh3) to prepare for the upcoming split of an entry of }(h3) to prepare for the upcoming split of an entry of hjhhhNhNubj[)}(h **order**h]horder}(hhhj8hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh. size into entries of the order stored in the }(h. size into entries of the order stored in the hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjKhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh.}(hjhjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Context**h]j[)}(hjfh]hContext}(hhhjhhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjdubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h"May sleep if **gfp** flags permit.h](h May sleep if }(h May sleep if hj|hhhNhNubj[)}(h**gfp**h]hgfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj|ubh flags permit.}(h flags permit.hj|hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_split (C function) c.xas_splithNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hFvoid xas_split (struct xa_state *xas, void *entry, unsigned int order)h]ja)}(hEvoid xas_split(struct xa_state *xas, void *entry, unsigned int order)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM$ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhM$ubj)}(h xas_splith]j)}(h xas_splith]h xas_split}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhM$ubj)}(h7(struct xa_state *xas, void *entry, unsigned int order)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsb c.xas_splitasbuh1hhjubjy)}(h h]h }(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjHhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjUhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjnhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjjubjy)}(h h]h }(hhhj|hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjjubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned int orderh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hinth]hint}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(horderh]horder}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhM$ubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhM$ubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM-hjhhubj+)}(hhh]h)}(h/Split a multi-index entry into smaller entries.h]h/Split a multi-index entry into smaller entries.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM#hjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhM$ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj+jNj+jOuh1jUhhhj3hNhNubjQ)}(hXh**Parameters** ``struct xa_state *xas`` XArray operation state. ``void *entry`` New entry to store in the array. ``unsigned int order`` Current entry order. **Description** The size of the new entries is set in **xas**. The value in **entry** is copied to all the replacement entries. **Context** Any context. The caller should hold the xa_lock.h](h)}(h**Parameters**h]j[)}(hj5h]h Parameters}(hhhj7hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM'hj/ubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjTh]hstruct xa_state *xas}(hhhjVhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjRubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM$hjNubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjohjmhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjihM$hjjubah}(h]h ]h"]h$]h&]uh1jhjNubeh}(h]h ]h"]h$]h&]uh1jhjihM$hjKubj)}(h1``void *entry`` New entry to store in the array. h](j)}(h``void *entry``h]j4)}(hjh]h void *entry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM%hjubj)}(hhh]h)}(h New entry to store in the array.h]h New entry to store in the array.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM%hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM%hjKubj)}(h,``unsigned int order`` Current entry order. h](j)}(h``unsigned int order``h]j4)}(hjh]hunsigned int order}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM&hjubj)}(hhh]h)}(hCurrent entry order.h]hCurrent entry order.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM&hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM&hjKubeh}(h]h ]h"]h$]h&]uh1jhj/ubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM(hj/ubh)}(hpThe size of the new entries is set in **xas**. The value in **entry** is copied to all the replacement entries.h](h&The size of the new entries is set in }(h&The size of the new entries is set in hjhhhNhNubj[)}(h**xas**h]hxas}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh. The value in }(h. The value in hjhhhNhNubj[)}(h **entry**h]hentry}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh* is copied to all the replacement entries.}(h* is copied to all the replacement entries.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM(hj/ubh)}(h **Context**h]j[)}(hjOh]hContext}(hhhjQhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjMubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM+hj/ubh)}(h1Any context. The caller should hold the xa_lock.h]h1Any context. The caller should hold the xa_lock.}(hjghjehhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM+hj/ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_pause (C function) c.xas_pausehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h%void xas_pause (struct xa_state *xas)h]ja)}(h$void xas_pause(struct xa_state *xas)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMcubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMcubj)}(h xas_pauseh]j)}(h xas_pauseh]h xas_pause}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMcubj)}(h(struct xa_state *xas)h]j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsb c.xas_pauseasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhj*hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMcubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMcubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMphjhhubj+)}(hhh]h)}(hPause a walk to drop a lock.h]hPause a walk to drop a lock.}(hjWhjUhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMbhjRhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMcubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjmjNjmjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xa_state *xas`` XArray operation state. **Description** Some users need to pause a walk and drop the lock they're holding in order to yield to a higher priority thread or carry out an operation on an entry. Those users should call this function before they drop the lock. It resets the **xas** to be suitable for the next iteration of the loop after the user has reacquired the lock. If most entries found during a walk require you to call xas_pause(), the xa_for_each() iterator may be more appropriate. Note that xas_pause() only works for forward iteration. If a user needs to pause a reverse iteration, we will need a xas_pause_rev().h](h)}(h**Parameters**h]j[)}(hjwh]h Parameters}(hhhjyhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjuubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMfhjqubj)}(hhh]j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMchjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMchjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMchjubah}(h]h ]h"]h$]h&]uh1jhjqubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMehjqubh)}(hXSome users need to pause a walk and drop the lock they're holding in order to yield to a higher priority thread or carry out an operation on an entry. Those users should call this function before they drop the lock. It resets the **xas** to be suitable for the next iteration of the loop after the user has reacquired the lock. If most entries found during a walk require you to call xas_pause(), the xa_for_each() iterator may be more appropriate.h](hSome users need to pause a walk and drop the lock they’re holding in order to yield to a higher priority thread or carry out an operation on an entry. Those users should call this function before they drop the lock. It resets the }(hSome users need to pause a walk and drop the lock they're holding in order to yield to a higher priority thread or carry out an operation on an entry. Those users should call this function before they drop the lock. It resets the hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh to be suitable for the next iteration of the loop after the user has reacquired the lock. If most entries found during a walk require you to call xas_pause(), the xa_for_each() iterator may be more appropriate.}(h to be suitable for the next iteration of the loop after the user has reacquired the lock. If most entries found during a walk require you to call xas_pause(), the xa_for_each() iterator may be more appropriate.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMehjqubh)}(hNote that xas_pause() only works for forward iteration. If a user needs to pause a reverse iteration, we will need a xas_pause_rev().h]hNote that xas_pause() only works for forward iteration. If a user needs to pause a reverse iteration, we will need a xas_pause_rev().}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMmhjqubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_find (C function) c.xas_findhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h9void * xas_find (struct xa_state *xas, unsigned long max)h]ja)}(h7void *xas_find(struct xa_state *xas, unsigned long max)h](jg)}(hvoidh]hvoid}(hhhj9hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj5hhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjHhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj5hhhjGhMubj)}(hj(h]h*}(hhhjVhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj5hhhjGhMubj)}(hxas_findh]j)}(hxas_findh]hxas_find}(hhhjghhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjcubah}(h]h ](jjeh"]h$]h&]hhuh1jhj5hhhjGhMubj)}(h)(struct xa_state *xas, unsigned long max)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jisb c.xas_findasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj{ubj)}(hunsigned long maxh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmaxh]hmax}(hhhj-hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj{ubeh}(h]h ]h"]h$]h&]hhuh1jhj5hhhjGhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj1hhhjGhMubah}(h]j,ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj.hhubj+)}(hhh]h)}(h*Find the next present entry in the XArray.h]h*Find the next present entry in the XArray.}(hjZhjXhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjUhhubah}(h]h ]h"]h$]h&]uh1j*hj.hhhjGhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjpjNjpjOuh1jUhhhj3hNhNubjQ)}(hXS**Parameters** ``struct xa_state *xas`` XArray operation state. ``unsigned long max`` Highest index to return. **Description** If the **xas** has not yet been walked to an entry, return the entry which has an index >= xas.xa_index. If it has been walked, the entry currently being pointed at has been processed, and so we move to the next entry. If no entry is found and the array is smaller than **max**, the iterator is set to the smallest index not yet in the array. This allows **xas** to be immediately passed to xas_store(). **Return** The entry, if found, otherwise ``NULL``.h](h)}(h**Parameters**h]j[)}(hjzh]h Parameters}(hhhj|hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjxubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjtubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h/``unsigned long max`` Highest index to return. h](j)}(h``unsigned long max``h]j4)}(hjh]hunsigned long max}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hHighest index to return.h]hHighest index to return.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubeh}(h]h ]h"]h$]h&]uh1jhjtubh)}(h**Description**h]j[)}(hj h]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjtubh)}(hIf the **xas** has not yet been walked to an entry, return the entry which has an index >= xas.xa_index. If it has been walked, the entry currently being pointed at has been processed, and so we move to the next entry.h](hIf the }(hIf the hj#hhhNhNubj[)}(h**xas**h]hxas}(hhhj,hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj#ubh has not yet been walked to an entry, return the entry which has an index >= xas.xa_index. If it has been walked, the entry currently being pointed at has been processed, and so we move to the next entry.}(h has not yet been walked to an entry, return the entry which has an index >= xas.xa_index. If it has been walked, the entry currently being pointed at has been processed, and so we move to the next entry.hj#hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjtubh)}(hIf no entry is found and the array is smaller than **max**, the iterator is set to the smallest index not yet in the array. This allows **xas** to be immediately passed to xas_store().h](h3If no entry is found and the array is smaller than }(h3If no entry is found and the array is smaller than hjFhhhNhNubj[)}(h**max**h]hmax}(hhhjOhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjFubhO, the iterator is set to the smallest index not yet in the array. This allows }(hO, the iterator is set to the smallest index not yet in the array. This allows hjFhhhNhNubj[)}(h**xas**h]hxas}(hhhjbhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjFubh) to be immediately passed to xas_store().}(h) to be immediately passed to xas_store().hjFhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjtubh)}(h **Return**h]j[)}(hj~h]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj|ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjtubh)}(h(The entry, if found, otherwise ``NULL``.h](hThe entry, if found, otherwise }(hThe entry, if found, otherwise hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh.}(hjhjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjtubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_find_marked (C function)c.xas_find_markedhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hPvoid * xas_find_marked (struct xa_state *xas, unsigned long max, xa_mark_t mark)h]ja)}(hNvoid *xas_find_marked(struct xa_state *xas, unsigned long max, xa_mark_t mark)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhhhjhMubj)}(hxas_find_markedh]j)}(hxas_find_markedh]hxas_find_marked}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h9(struct xa_state *xas, unsigned long max, xa_mark_t mark)h](j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhj-hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhj>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj;ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj@modnameN classnameNj%j%)}j%]j%)}j%jsbc.xas_find_markedasbuh1hhjubjy)}(h h]h }(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjyhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long maxh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmaxh]hmax}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]jZc.xas_find_markedasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmarkh]hmark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM*hjhhubj+)}(hhh]h)}(h)Find the next marked entry in the XArray.h]h)Find the next marked entry in the XArray.}(hj?hj=hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj:hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjUjNjUjOuh1jUhhhj3hNhNubjQ)}(hX4**Parameters** ``struct xa_state *xas`` XArray operation state. ``unsigned long max`` Highest index to return. ``xa_mark_t mark`` Mark number to search for. **Description** If the **xas** has not yet been walked to an entry, return the marked entry which has an index >= xas.xa_index. If it has been walked, the entry currently being pointed at has been processed, and so we return the first marked entry with an index > xas.xa_index. If no marked entry is found and the array is smaller than **max**, **xas** is set to the bounds state and xas->xa_index is set to the smallest index not yet in the array. This allows **xas** to be immediately passed to xas_store(). If no entry is found before **max** is reached, **xas** is set to the restart state. **Return** The entry, if found, otherwise ``NULL``.h](h)}(h**Parameters**h]j[)}(hj_h]h Parameters}(hhhjahhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj]ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjYubj)}(hhh](j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hj~h]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj|ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjxubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjxubeh}(h]h ]h"]h$]h&]uh1jhjhMhjuubj)}(h/``unsigned long max`` Highest index to return. h](j)}(h``unsigned long max``h]j4)}(hjh]hunsigned long max}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hHighest index to return.h]hHighest index to return.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjuubj)}(h.``xa_mark_t mark`` Mark number to search for. h](j)}(h``xa_mark_t mark``h]j4)}(hjh]hxa_mark_t mark}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hMark number to search for.h]hMark number to search for.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjuubeh}(h]h ]h"]h$]h&]uh1jhjYubh)}(h**Description**h]j[)}(hj+h]h Description}(hhhj-hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj)ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjYubh)}(hXIf the **xas** has not yet been walked to an entry, return the marked entry which has an index >= xas.xa_index. If it has been walked, the entry currently being pointed at has been processed, and so we return the first marked entry with an index > xas.xa_index.h](hIf the }(hIf the hjAhhhNhNubj[)}(h**xas**h]hxas}(hhhjJhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjAubh has not yet been walked to an entry, return the marked entry which has an index >= xas.xa_index. If it has been walked, the entry currently being pointed at has been processed, and so we return the first marked entry with an index > xas.xa_index.}(h has not yet been walked to an entry, return the marked entry which has an index >= xas.xa_index. If it has been walked, the entry currently being pointed at has been processed, and so we return the first marked entry with an index > xas.xa_index.hjAhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjYubh)}(hIf no marked entry is found and the array is smaller than **max**, **xas** is set to the bounds state and xas->xa_index is set to the smallest index not yet in the array. This allows **xas** to be immediately passed to xas_store().h](h:If no marked entry is found and the array is smaller than }(h:If no marked entry is found and the array is smaller than hjdhhhNhNubj[)}(h**max**h]hmax}(hhhjmhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjdubh, }(h, hjdhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjdubhn is set to the bounds state and xas->xa_index is set to the smallest index not yet in the array. This allows }(hn is set to the bounds state and xas->xa_index is set to the smallest index not yet in the array. This allows hjdhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjdubh) to be immediately passed to xas_store().}(h) to be immediately passed to xas_store().hjdhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM hjYubh)}(hTIf no entry is found before **max** is reached, **xas** is set to the restart state.h](hIf no entry is found before }(hIf no entry is found before hjhhhNhNubj[)}(h**max**h]hmax}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh is reached, }(h is reached, hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh is set to the restart state.}(h is set to the restart state.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM%hjYubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM(hjYubh)}(h(The entry, if found, otherwise ``NULL``.h](hThe entry, if found, otherwise }(hThe entry, if found, otherwise hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh.}(hjhjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM(hjYubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_find_conflict (C function)c.xas_find_conflicthNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h/void * xas_find_conflict (struct xa_state *xas)h]ja)}(h-void *xas_find_conflict(struct xa_state *xas)h](jg)}(hvoidh]hvoid}(hhhj=hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj9hhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM{ubjy)}(h h]h }(hhhjLhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj9hhhjKhM{ubj)}(hj(h]h*}(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj9hhhjKhM{ubj)}(hxas_find_conflicth]j)}(hxas_find_conflicth]hxas_find_conflict}(hhhjkhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjgubah}(h]h ](jjeh"]h$]h&]hhuh1jhj9hhhjKhM{ubj)}(h(struct xa_state *xas)h]j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jmsbc.xas_find_conflictasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhj9hhhjKhM{ubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj5hhhjKhM{ubah}(h]j0ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj2hhubj+)}(hhh]h)}(h'Find the next present entry in a range.h]h'Find the next present entry in a range.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMzhjhhubah}(h]h ]h"]h$]h&]uh1j*hj2hhhjKhM{ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj#jNj#jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xa_state *xas`` XArray operation state. **Description** The **xas** describes both a range and a position within that range. **Context** Any context. Expects xa_lock to be held. **Return** The next entry in the range covered by **xas** or ``NULL``.h](h)}(h**Parameters**h]j[)}(hj-h]h Parameters}(hhhj/hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj+ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM~hj'ubj)}(hhh]j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjLh]hstruct xa_state *xas}(hhhjNhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjJubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM{hjFubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hjghjehhhNhNubah}(h]h ]h"]h$]h&]uh1hhjahM{hjbubah}(h]h ]h"]h$]h&]uh1jhjFubeh}(h]h ]h"]h$]h&]uh1jhjahM{hjCubah}(h]h ]h"]h$]h&]uh1jhj'ubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM}hj'ubh)}(hDThe **xas** describes both a range and a position within that range.h](hThe }(hThe hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh9 describes both a range and a position within that range.}(h9 describes both a range and a position within that range.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM}hj'ubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj'ubh)}(h)Any context. Expects xa_lock to be held.h]h)Any context. Expects xa_lock to be held.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj'ubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj'ubh)}(h;The next entry in the range covered by **xas** or ``NULL``.h](h'The next entry in the range covered by }(h'The next entry in the range covered by hjhhhNhNubj[)}(h**xas**h]hxas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh or }(h or hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh.}(hjhjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj'ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_load (C function) c.xa_loadhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h7void * xa_load (struct xarray *xa, unsigned long index)h]ja)}(h5void *xa_load(struct xarray *xa, unsigned long index)h](jg)}(hvoidh]hvoid}(hhhjThhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjPhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjchhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjPhhhjbhMubj)}(hj(h]h*}(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjPhhhjbhMubj)}(hxa_loadh]j)}(hxa_loadh]hxa_load}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj~ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjPhhhjbhMubj)}(h((struct xarray *xa, unsigned long index)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsb c.xa_loadasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubjg)}(hlongh]hlong}(hhhj,hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj ubjy)}(h h]h }(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubj)}(hindexh]hindex}(hhhjHhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjPhhhjbhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjLhhhjbhMubah}(h]jGah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjIhhubj+)}(hhh]h)}(hLoad an entry from an XArray.h]hLoad an entry from an XArray.}(hjuhjshhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjphhubah}(h]h ]h"]h$]h&]uh1j*hjIhhhjbhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` index into array. **Context** Any context. Takes and releases the RCU lock. **Return** The entry at **index** in **xa**.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray.h]hXArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h*``unsigned long index`` index into array. h](j)}(h``unsigned long index``h]j4)}(hjh]hunsigned long index}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hindex into array.h]hindex into array.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h **Context**h]j[)}(hj(h]hContext}(hhhj*hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj&ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h.Any context. Takes and releases the RCU lock.h]h.Any context. Takes and releases the RCU lock.}(hj@hj>hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Return**h]j[)}(hjOh]hReturn}(hhhjQhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjMubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h!The entry at **index** in **xa**.h](h The entry at }(h The entry at hjehhhNhNubj[)}(h **index**h]hindex}(hhhjnhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjeubh in }(h in hjehhhNhNubj[)}(h**xa**h]hxa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjeubh.}(hjhjehhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQ__xa_erase (C function) c.__xa_erasehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h:void * __xa_erase (struct xarray *xa, unsigned long index)h]ja)}(h8void *__xa_erase(struct xarray *xa, unsigned long index)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhhhjhMubj)}(h __xa_eraseh]j)}(h __xa_eraseh]h __xa_erase}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h((struct xarray *xa, unsigned long index)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj"hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj$modnameN classnameNj%j%)}j%]j%)}j%jsb c.__xa_eraseasbuh1hhjubjy)}(h h]h }(hhhjBhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjPhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhj]hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjvhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjrubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjrubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjrubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjrubj)}(hindexh]hindex}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjrubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubj+)}(hhh]h)}(h.Erase this entry from the XArray while locked.h]h.Erase this entry from the XArray while locked.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. **Description** After this function returns, loading from **index** will return ``NULL``. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry. **Context** Any context. Expects xa_lock to be held on entry. **Return** The entry which used to be at this index.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray.h]hXArray.}(hj5hj3hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj/hMhj0ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj/hMhjubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hjSh]hunsigned long index}(hhhjUhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjQubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjMubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hjnhjlhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhhMhjiubah}(h]h ]h"]h$]h&]uh1jhjMubeh}(h]h ]h"]h$]h&]uh1jhjhhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hAfter this function returns, loading from **index** will return ``NULL``. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry.h](h*After this function returns, loading from }(h*After this function returns, loading from hjhhhNhNubj[)}(h **index**h]hindex}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh will return }(h will return hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry.}(h. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h2Any context. Expects xa_lock to be held on entry.h]h2Any context. Expects xa_lock to be held on entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h)The entry which used to be at this index.h]h)The entry which used to be at this index.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_erase (C function) c.xa_erasehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h8void * xa_erase (struct xarray *xa, unsigned long index)h]ja)}(h6void *xa_erase(struct xarray *xa, unsigned long index)h](jg)}(hvoidh]hvoid}(hhhjHhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjDhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjWhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjDhhhjVhMubj)}(hj(h]h*}(hhhjehhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjDhhhjVhMubj)}(hxa_eraseh]j)}(hxa_eraseh]hxa_erase}(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjrubah}(h]h ](jjeh"]h$]h&]hhuh1jhjDhhhjVhMubj)}(h((struct xarray *xa, unsigned long index)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jxsb c.xa_eraseasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhj hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhj.hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hindexh]hindex}(hhhj<hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjDhhhjVhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj@hhhjVhMubah}(h]j;ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj=hhubj+)}(hhh]h)}(h!Erase this entry from the XArray.h]h!Erase this entry from the XArray.}(hjihjghhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjdhhubah}(h]h ]h"]h$]h&]uh1j*hj=hhhjVhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index of entry. **Description** After this function returns, loading from **index** will return ``NULL``. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry. **Context** Any context. Takes and releases the xa_lock. **Return** The entry which used to be at this index.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray.h]hXArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h(``unsigned long index`` Index of entry. h](j)}(h``unsigned long index``h]j4)}(hjh]hunsigned long index}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hIndex of entry.h]hIndex of entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hAfter this function returns, loading from **index** will return ``NULL``. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry.h](h*After this function returns, loading from }(h*After this function returns, loading from hj2hhhNhNubj[)}(h **index**h]hindex}(hhhj;hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj2ubh will return }(h will return hj2hhhNhNubj4)}(h``NULL``h]hNULL}(hhhjNhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj2ubh. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry.}(h. If the index is part of a multi-index entry, all indices will be erased and none of the entries will be part of a multi-index entry.hj2hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Context**h]j[)}(hjjh]hContext}(hhhjlhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjhubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h-Any context. Takes and releases the xa_lock.h]h-Any context. Takes and releases the xa_lock.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h)The entry which used to be at this index.h]h)The entry which used to be at this index.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQ__xa_store (C function) c.__xa_storehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hRvoid * __xa_store (struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h]ja)}(hPvoid *__xa_store(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjhhhjhMubj)}(h __xa_storeh]j)}(h __xa_storeh]h __xa_store}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h@(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhj-hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj>hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj;ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj@modnameN classnameNj%j%)}j%]j%)}j%jsb c.__xa_storeasbuh1hhjubjy)}(h h]h }(hhhj^hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhjyhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hindexh]hindex}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhj(hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj%ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj*modnameN classnameNj%j%)}j%]jZ c.__xa_storeasbuh1hhj!ubjy)}(h h]h }(hhhjFhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj!ubj)}(hgfph]hgfp}(hhhjThhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj!ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubj+)}(hhh]h)}(hStore this entry in the XArray.h]hStore this entry in the XArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj|hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. ``void *entry`` New entry. ``gfp_t gfp`` Memory allocation flags. **Description** You must already be holding the xa_lock when calling this function. It will drop the lock if needed to allocate memory, and then reacquire it afterwards. **Context** Any context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if **gfp** flags permit. **Return** The old entry at this index or xa_err() if an error happened.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray.h]hXArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hjh]hunsigned long index}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hj2h]h void *entry}(hhhj4hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj0ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj,ubj)}(hhh]h)}(h New entry.h]h New entry.}(hjMhjKhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjGhMhjHubah}(h]h ]h"]h$]h&]uh1jhj,ubeh}(h]h ]h"]h$]h&]uh1jhjGhMhjubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjkh]h gfp_t gfp}(hhhjmhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjiubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjeubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjeubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM hjubh)}(hYou must already be holding the xa_lock when calling this function. It will drop the lock if needed to allocate memory, and then reacquire it afterwards.h]hYou must already be holding the xa_lock when calling this function. It will drop the lock if needed to allocate memory, and then reacquire it afterwards.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM hjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hnAny context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if **gfp** flags permit.h](hYAny context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if }(hYAny context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if hjhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh flags permit.}(h flags permit.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h=The old entry at this index or xa_err() if an error happened.h]h=The old entry at this index or xa_err() if an error happened.}(hj hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_store (C function) c.xa_storehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hPvoid * xa_store (struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h]ja)}(hNvoid *xa_store(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](jg)}(hvoidh]hvoid}(hhhjMhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjIhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM(ubjy)}(h h]h }(hhhj\hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjIhhhj[hM(ubj)}(hj(h]h*}(hhhjjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjIhhhj[hM(ubj)}(hxa_storeh]j)}(hxa_storeh]hxa_store}(hhhj{hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjwubah}(h]h ](jjeh"]h$]h&]hhuh1jhjIhhhj[hM(ubj)}(h@(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%j}sb c.xa_storeasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhj hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhj%hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhj3hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hindexh]hindex}(hhhjAhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjZhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjVubjy)}(h h]h }(hhhjhhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjVubj)}(hj(h]h*}(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjVubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjVubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j c.xa_storeasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hgfph]hgfp}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjIhhhj[hM(ubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjEhhhj[hM(ubah}(h]j@ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM7hjBhhubj+)}(hhh]h)}(hStore this entry in the XArray.h]hStore this entry in the XArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM'hjhhubah}(h]h ]h"]h$]h&]uh1j*hjBhhhj[hM(ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. ``void *entry`` New entry. ``gfp_t gfp`` Memory allocation flags. **Description** After this function returns, loads from this index will return **entry**. Storing into an existing multi-index entry updates the entry of every index. The marks associated with **index** are unaffected unless **entry** is ``NULL``. **Context** Any context. Takes and releases the xa_lock. May sleep if the **gfp** flags permit. **Return** The old entry at this index on success, xa_err(-EINVAL) if **entry** cannot be stored in an XArray, or xa_err(-ENOMEM) if memory allocation failed.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM+hjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hj7h]hstruct xarray *xa}(hhhj9hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj5ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM(hj1ubj)}(hhh]h)}(hXArray.h]hXArray.}(hjRhjPhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjLhM(hjMubah}(h]h ]h"]h$]h&]uh1jhj1ubeh}(h]h ]h"]h$]h&]uh1jhjLhM(hj.ubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hjph]hunsigned long index}(hhhjrhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjnubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM)hjjubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM)hjubah}(h]h ]h"]h$]h&]uh1jhjjubeh}(h]h ]h"]h$]h&]uh1jhjhM)hj.ubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hjh]h void *entry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM*hjubj)}(hhh]h)}(h New entry.h]h New entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM*hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM*hj.ubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjh]h gfp_t gfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM+hjubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM+hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM+hj.ubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM-hjubh)}(hAfter this function returns, loads from this index will return **entry**. Storing into an existing multi-index entry updates the entry of every index. The marks associated with **index** are unaffected unless **entry** is ``NULL``.h](h?After this function returns, loads from this index will return }(h?After this function returns, loads from this index will return hj3hhhNhNubj[)}(h **entry**h]hentry}(hhhj<hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubhi. Storing into an existing multi-index entry updates the entry of every index. The marks associated with }(hi. Storing into an existing multi-index entry updates the entry of every index. The marks associated with hj3hhhNhNubj[)}(h **index**h]hindex}(hhhjOhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubh are unaffected unless }(h are unaffected unless hj3hhhNhNubj[)}(h **entry**h]hentry}(hhhjbhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj3ubh is }(h is hj3hhhNhNubj4)}(h``NULL``h]hNULL}(hhhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj3ubh.}(hjhj3hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM-hjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM1hjubh)}(hTAny context. Takes and releases the xa_lock. May sleep if the **gfp** flags permit.h](h?Any context. Takes and releases the xa_lock. May sleep if the }(h?Any context. Takes and releases the xa_lock. May sleep if the hjhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh flags permit.}(h flags permit.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM1hjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM4hjubh)}(hThe old entry at this index on success, xa_err(-EINVAL) if **entry** cannot be stored in an XArray, or xa_err(-ENOMEM) if memory allocation failed.h](h;The old entry at this index on success, xa_err(-EINVAL) if }(h;The old entry at this index on success, xa_err(-EINVAL) if hjhhhNhNubj[)}(h **entry**h]hentry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubhO cannot be stored in an XArray, or xa_err(-ENOMEM) if memory allocation failed.}(hO cannot be stored in an XArray, or xa_err(-ENOMEM) if memory allocation failed.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM3hjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQ__xa_cmpxchg (C function)c.__xa_cmpxchghNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h_void * __xa_cmpxchg (struct xarray *xa, unsigned long index, void *old, void *entry, gfp_t gfp)h]ja)}(h]void *__xa_cmpxchg(struct xarray *xa, unsigned long index, void *old, void *entry, gfp_t gfp)h](jg)}(hvoidh]hvoid}(hhhj$hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj hhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMEubjy)}(h h]h }(hhhj3hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj hhhj2hMEubj)}(hj(h]h*}(hhhjAhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj hhhj2hMEubj)}(h __xa_cmpxchgh]j)}(h __xa_cmpxchgh]h __xa_cmpxchg}(hhhjRhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjNubah}(h]h ](jjeh"]h$]h&]hhuh1jhj hhhj2hMEubj)}(hK(struct xarray *xa, unsigned long index, void *old, void *entry, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjnhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjjubjy)}(h h]h }(hhhj{hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jTsbc.__xa_cmpxchgasbuh1hhjjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjjubj)}(hxah]hxa}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjfubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hindexh]hindex}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjfubj)}(h void *oldh](jg)}(hvoidh]hvoid}(hhhj1hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj-ubjy)}(h h]h }(hhhj?hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj-ubj)}(hj(h]h*}(hhhjMhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj-ubj)}(holdh]hold}(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj-ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjfubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjshhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjoubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjoubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjoubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjoubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjfubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]jc.__xa_cmpxchgasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hgfph]hgfp}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjfubeh}(h]h ]h"]h$]h&]hhuh1jhj hhhj2hMEubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhj2hMEubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMShjhhubj+)}(hhh]h)}(hStore this entry in the XArray.h]hStore this entry in the XArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMDhj hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhj2hMEubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj'jNj'jOuh1jUhhhj3hNhNubjQ)}(hXD**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. ``void *old`` Old value to test against. ``void *entry`` New entry. ``gfp_t gfp`` Memory allocation flags. **Description** You must already be holding the xa_lock when calling this function. It will drop the lock if needed to allocate memory, and then reacquire it afterwards. **Context** Any context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if **gfp** flags permit. **Return** The old entry at this index or xa_err() if an error happened.h](h)}(h**Parameters**h]j[)}(hj1h]h Parameters}(hhhj3hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj/ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMHhj+ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjPh]hstruct xarray *xa}(hhhjRhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjNubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMEhjJubj)}(hhh]h)}(hXArray.h]hXArray.}(hjkhjihhhNhNubah}(h]h ]h"]h$]h&]uh1hhjehMEhjfubah}(h]h ]h"]h$]h&]uh1jhjJubeh}(h]h ]h"]h$]h&]uh1jhjehMEhjGubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hjh]hunsigned long index}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMFhjubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMFhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMFhjGubj)}(h)``void *old`` Old value to test against. h](j)}(h ``void *old``h]j4)}(hjh]h void *old}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMGhjubj)}(hhh]h)}(hOld value to test against.h]hOld value to test against.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMGhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMGhjGubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hjh]h void *entry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMHhjubj)}(hhh]h)}(h New entry.h]h New entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMHhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMHhjGubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hj4h]h gfp_t gfp}(hhhj6hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj2ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMIhj.ubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjOhjMhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjIhMIhjJubah}(h]h ]h"]h$]h&]uh1jhj.ubeh}(h]h ]h"]h$]h&]uh1jhjIhMIhjGubeh}(h]h ]h"]h$]h&]uh1jhj+ubh)}(h**Description**h]j[)}(hjoh]h Description}(hhhjqhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjmubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMKhj+ubh)}(hYou must already be holding the xa_lock when calling this function. It will drop the lock if needed to allocate memory, and then reacquire it afterwards.h]hYou must already be holding the xa_lock when calling this function. It will drop the lock if needed to allocate memory, and then reacquire it afterwards.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMKhj+ubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMOhj+ubh)}(hnAny context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if **gfp** flags permit.h](hYAny context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if }(hYAny context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if hjhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh flags permit.}(h flags permit.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMOhj+ubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMRhj+ubh)}(h=The old entry at this index or xa_err() if an error happened.h]h=The old entry at this index or xa_err() if an error happened.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMQhj+ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQ__xa_insert (C function) c.__xa_inserthNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hPint __xa_insert (struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h]ja)}(hOint __xa_insert(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](jg)}(hinth]hint}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMkubjy)}(h h]h }(hhhj%hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhj$hMkubj)}(h __xa_inserth]j)}(h __xa_inserth]h __xa_insert}(hhhj7hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj3ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhj$hMkubj)}(h@(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjShhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjOubjy)}(h h]h }(hhhj`hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjOubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjqhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjnubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjsmodnameN classnameNj%j%)}j%]j%)}j%j9sb c.__xa_insertasbuh1hhjOubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjOubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjOubj)}(hxah]hxa}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjOubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjKubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hindexh]hindex}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjKubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhj$hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhj2hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhj?hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjKubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhj[hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjXubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj]modnameN classnameNj%j%)}j%]j c.__xa_insertasbuh1hhjTubjy)}(h h]h }(hhhjyhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjTubj)}(hgfph]hgfp}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjTubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjKubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhj$hMkubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhj$hMkubah}(h]j ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMyhj hhubj+)}(hhh]h)}(h6Store this entry in the XArray if no entry is present.h]h6Store this entry in the XArray if no entry is present.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMjhjhhubah}(h]h ]h"]h$]h&]uh1j*hj hhhj$hMkubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hXt**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index into array. ``void *entry`` New entry. ``gfp_t gfp`` Memory allocation flags. **Description** Inserting a NULL entry will store a reserved entry (like xa_reserve()) if no entry is present. Inserting will fail if a reserved entry is present, even though loading from this index will return NULL. **Context** Any context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if **gfp** flags permit. **Return** 0 if the store succeeded. -EBUSY if another entry was present. -ENOMEM if memory could not be allocated.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMnhjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMkhjubj)}(hhh]h)}(hXArray.h]hXArray.}(hjhj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMkhj ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMkhjubj)}(h*``unsigned long index`` Index into array. h](j)}(h``unsigned long index``h]j4)}(hj,h]hunsigned long index}(hhhj.hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj*ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMlhj&ubj)}(hhh]h)}(hIndex into array.h]hIndex into array.}(hjGhjEhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjAhMlhjBubah}(h]h ]h"]h$]h&]uh1jhj&ubeh}(h]h ]h"]h$]h&]uh1jhjAhMlhjubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hjeh]h void *entry}(hhhjghhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjcubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMmhj_ubj)}(hhh]h)}(h New entry.h]h New entry.}(hjhj~hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjzhMmhj{ubah}(h]h ]h"]h$]h&]uh1jhj_ubeh}(h]h ]h"]h$]h&]uh1jhjzhMmhjubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjh]h gfp_t gfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMnhjubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMnhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMnhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMphjubh)}(hInserting a NULL entry will store a reserved entry (like xa_reserve()) if no entry is present. Inserting will fail if a reserved entry is present, even though loading from this index will return NULL.h]hInserting a NULL entry will store a reserved entry (like xa_reserve()) if no entry is present. Inserting will fail if a reserved entry is present, even though loading from this index will return NULL.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMphjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMthjubh)}(hnAny context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if **gfp** flags permit.h](hYAny context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if }(hYAny context. Expects xa_lock to be held on entry. May release and reacquire xa_lock if hjhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh flags permit.}(h flags permit.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMthjubh)}(h **Return**h]j[)}(hj;h]hReturn}(hhhj=hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj9ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMwhjubh)}(hi0 if the store succeeded. -EBUSY if another entry was present. -ENOMEM if memory could not be allocated.h]hi0 if the store succeeded. -EBUSY if another entry was present. -ENOMEM if memory could not be allocated.}(hjShjQhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMvhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_store_range (C function)c.xa_store_rangehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hjvoid * xa_store_range (struct xarray *xa, unsigned long first, unsigned long last, void *entry, gfp_t gfp)h]ja)}(hhvoid *xa_store_range(struct xarray *xa, unsigned long first, unsigned long last, void *entry, gfp_t gfp)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj|hhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj|hhhjhMubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj|hhhjhMubj)}(hxa_store_rangeh]j)}(hxa_store_rangeh]hxa_store_range}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhj|hhhjhMubj)}(hT(struct xarray *xa, unsigned long first, unsigned long last, void *entry, gfp_t gfp)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsbc.xa_store_rangeasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhj#hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long firsth](jg)}(hunsignedh]hunsigned}(hhhj<hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj8ubjy)}(h h]h }(hhhjJhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj8ubjg)}(hlongh]hlong}(hhhjXhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj8ubjy)}(h h]h }(hhhjfhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj8ubj)}(hfirsth]hfirst}(hhhjthhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj8ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long lasth](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hlasth]hlast}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(h void *entryh](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hentryh]hentry}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(h gfp_t gfph](h)}(hhh]j)}(hgfp_th]hgfp_t}(hhhj#hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj%modnameN classnameNj%j%)}j%]jc.xa_store_rangeasbuh1hhjubjy)}(h h]h }(hhhjAhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hgfph]hgfp}(hhhjOhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhj|hhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjxhhhjhMubah}(h]jsah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjuhhubj+)}(hhh]h)}(h5Store this entry at a range of indices in the XArray.h]h5Store this entry at a range of indices in the XArray.}(hj|hjzhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjwhhubah}(h]h ]h"]h$]h&]uh1j*hjuhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long first`` First index to affect. ``unsigned long last`` Last index to affect. ``void *entry`` New entry. ``gfp_t gfp`` Memory allocation flags. **Description** After this function returns, loads from any index between **first** and **last**, inclusive will return **entry**. Storing into an existing multi-index entry updates the entry of every index. The marks associated with **index** are unaffected unless **entry** is ``NULL``. **Context** Process context. Takes and releases the xa_lock. May sleep if the **gfp** flags permit. **Return** ``NULL`` on success, xa_err(-EINVAL) if **entry** cannot be stored in an XArray, or xa_err(-ENOMEM) if memory allocation failed.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray.h]hXArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h/``unsigned long first`` First index to affect. h](j)}(h``unsigned long first``h]j4)}(hjh]hunsigned long first}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hFirst index to affect.h]hFirst index to affect.}(hjhj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hMhj ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj hMhjubj)}(h-``unsigned long last`` Last index to affect. h](j)}(h``unsigned long last``h]j4)}(hj-h]hunsigned long last}(hhhj/hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj+ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj'ubj)}(hhh]h)}(hLast index to affect.h]hLast index to affect.}(hjHhjFhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjBhMhjCubah}(h]h ]h"]h$]h&]uh1jhj'ubeh}(h]h ]h"]h$]h&]uh1jhjBhMhjubj)}(h``void *entry`` New entry. h](j)}(h``void *entry``h]j4)}(hjfh]h void *entry}(hhhjhhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjdubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj`ubj)}(hhh]h)}(h New entry.h]h New entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj{hMhj|ubah}(h]h ]h"]h$]h&]uh1jhj`ubeh}(h]h ]h"]h$]h&]uh1jhj{hMhjubj)}(h'``gfp_t gfp`` Memory allocation flags. h](j)}(h ``gfp_t gfp``h]j4)}(hjh]h gfp_t gfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hMemory allocation flags.h]hMemory allocation flags.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hXAfter this function returns, loads from any index between **first** and **last**, inclusive will return **entry**. Storing into an existing multi-index entry updates the entry of every index. The marks associated with **index** are unaffected unless **entry** is ``NULL``.h](h:After this function returns, loads from any index between }(h:After this function returns, loads from any index between hjhhhNhNubj[)}(h **first**h]hfirst}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh and }(h and hjhhhNhNubj[)}(h**last**h]hlast}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh, inclusive will return }(h, inclusive will return hjhhhNhNubj[)}(h **entry**h]hentry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubhi. Storing into an existing multi-index entry updates the entry of every index. The marks associated with }(hi. Storing into an existing multi-index entry updates the entry of every index. The marks associated with hjhhhNhNubj[)}(h **index**h]hindex}(hhhj2hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh are unaffected unless }(h are unaffected unless hjhhhNhNubj[)}(h **entry**h]hentry}(hhhjEhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh is }(h is hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjXhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh.}(hjhjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Context**h]j[)}(hjsh]hContext}(hhhjuhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjqubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hYProcess context. Takes and releases the xa_lock. May sleep if the **gfp** flags permit.h](hDProcess context. Takes and releases the xa_lock. May sleep if the }(hDProcess context. Takes and releases the xa_lock. May sleep if the hjhhhNhNubj[)}(h**gfp**h]hgfp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh flags permit.}(h flags permit.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h``NULL`` on success, xa_err(-EINVAL) if **entry** cannot be stored in an XArray, or xa_err(-ENOMEM) if memory allocation failed.h](j4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh on success, xa_err(-EINVAL) if }(h on success, xa_err(-EINVAL) if hjhhhNhNubj[)}(h **entry**h]hentry}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubhO cannot be stored in an XArray, or xa_err(-ENOMEM) if memory allocation failed.}(hO cannot be stored in an XArray, or xa_err(-ENOMEM) if memory allocation failed.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxas_get_order (C function)c.xas_get_orderhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h(int xas_get_order (struct xa_state *xas)h]ja)}(h'int xas_get_order(struct xa_state *xas)h](jg)}(hinth]hint}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhj$hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhj#hMubj)}(h xas_get_orderh]j)}(h xas_get_orderh]h xas_get_order}(hhhj6hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj2ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhj#hMubj)}(h(struct xa_state *xas)h]j)}(hstruct xa_state *xash](jz)}(hjh]hstruct}(hhhjRhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjNubjy)}(h h]h }(hhhj_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjNubh)}(hhh]j)}(hxa_stateh]hxa_state}(hhhjphhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjmubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjrmodnameN classnameNj%j%)}j%]j%)}j%j8sbc.xas_get_orderasbuh1hhjNubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjNubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjNubj)}(hxash]hxas}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjNubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjJubah}(h]h ]h"]h$]h&]hhuh1jhjhhhj#hMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj hhhj#hMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj hhubj+)}(hhh]h)}(hGet the order of an entry.h]hGet the order of an entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hj hhhj#hMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``struct xa_state *xas`` XArray operation state. **Description** Called after xas_load, the xas should not be in an error state. **Return** A number between 0 and 63 indicating the order of the entry.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]j)}(h1``struct xa_state *xas`` XArray operation state. h](j)}(h``struct xa_state *xas``h]j4)}(hjh]hstruct xa_state *xas}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray operation state.h]hXArray operation state.}(hj2hj0hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj,hMhj-ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj,hMhjubah}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjRh]h Description}(hhhjThhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjPubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h?Called after xas_load, the xas should not be in an error state.h]h?Called after xas_load, the xas should not be in an error state.}(hjjhjhhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Return**h]j[)}(hjyh]hReturn}(hhhj{hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjwubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hAttempting to set a mark on a ``NULL`` entry does not succeed.h](hAttempting to set a mark on a }(hAttempting to set a mark on a hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh entry does not succeed.}(h entry does not succeed.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h2Any context. Expects xa_lock to be held on entry.h]h2Any context. Expects xa_lock to be held on entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQ__xa_clear_mark (C function)c.__xa_clear_markhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hMvoid __xa_clear_mark (struct xarray *xa, unsigned long index, xa_mark_t mark)h]ja)}(hLvoid __xa_clear_mark(struct xarray *xa, unsigned long index, xa_mark_t mark)h](jg)}(hvoidh]hvoid}(hhhjJhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjFhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjYhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjFhhhjXhMubj)}(h__xa_clear_markh]j)}(h__xa_clear_markh]h__xa_clear_mark}(hhhjkhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjgubah}(h]h ](jjeh"]h$]h&]hhuh1jhjFhhhjXhMubj)}(h8(struct xarray *xa, unsigned long index, xa_mark_t mark)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jmsbc.__xa_clear_markasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhj#hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hindexh]hindex}(hhhj1hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjMhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjJubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjOmodnameN classnameNj%j%)}j%]jc.__xa_clear_markasbuh1hhjFubjy)}(h h]h }(hhhjkhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjFubj)}(hmarkh]hmark}(hhhjyhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjFubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjFhhhjXhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjBhhhjXhMubah}(h]j=ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj?hhubj+)}(hhh]h)}(h+Clear this mark on this entry while locked.h]h+Clear this mark on this entry while locked.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hj?hhhjXhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index of entry. ``xa_mark_t mark`` Mark number. **Context** Any context. Expects xa_lock to be held on entry.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray.h]hXArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(h(``unsigned long index`` Index of entry. h](j)}(h``unsigned long index``h]j4)}(hjh]hunsigned long index}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hIndex of entry.h]hIndex of entry.}(hj9hj7hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj3hMhj4ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj3hMhjubj)}(h ``xa_mark_t mark`` Mark number. h](j)}(h``xa_mark_t mark``h]j4)}(hjWh]hxa_mark_t mark}(hhhjYhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjUubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjQubj)}(hhh]h)}(h Mark number.h]h Mark number.}(hjrhjphhhNhNubah}(h]h ]h"]h$]h&]uh1hhjlhMhjmubah}(h]h ]h"]h$]h&]uh1jhjQubeh}(h]h ]h"]h$]h&]uh1jhjlhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h2Any context. Expects xa_lock to be held on entry.h]h2Any context. Expects xa_lock to be held on entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_get_mark (C function) c.xa_get_markhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hIbool xa_get_mark (struct xarray *xa, unsigned long index, xa_mark_t mark)h]ja)}(hHbool xa_get_mark(struct xarray *xa, unsigned long index, xa_mark_t mark)h](jg)}(hjh]hbool}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(h xa_get_markh]j)}(h xa_get_markh]h xa_get_mark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h8(struct xarray *xa, unsigned long index, xa_mark_t mark)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj1hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj.ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj3modnameN classnameNj%j%)}j%]j%)}j%jsb c.xa_get_markasbuh1hhjubjy)}(h h]h }(hhhjQhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhj_hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhjlhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hindexh]hindex}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]jM c.xa_get_markasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmarkh]hmark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubj+)}(hhh]h)}(h/Inquire whether this mark is set on this entry.h]h/Inquire whether this mark is set on this entry.}(hj2hj0hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj-hhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjHjNjHjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index of entry. ``xa_mark_t mark`` Mark number. **Description** This function uses the RCU read lock, so the result may be out of date by the time it returns. If you need the result to be stable, use a lock. **Context** Any context. Takes and releases the RCU lock. **Return** True if the entry at **index** has this mark set, false if it doesn't.h](h)}(h**Parameters**h]j[)}(hjRh]h Parameters}(hhhjThhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjPubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjLubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjqh]hstruct xarray *xa}(hhhjshhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjoubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjkubj)}(hhh]h)}(hXArray.h]hXArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjkubeh}(h]h ]h"]h$]h&]uh1jhjhMhjhubj)}(h(``unsigned long index`` Index of entry. h](j)}(h``unsigned long index``h]j4)}(hjh]hunsigned long index}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hIndex of entry.h]hIndex of entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjhubj)}(h ``xa_mark_t mark`` Mark number. h](j)}(h``xa_mark_t mark``h]j4)}(hjh]hxa_mark_t mark}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(h Mark number.h]h Mark number.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjhubeh}(h]h ]h"]h$]h&]uh1jhjLubh)}(h**Description**h]j[)}(hjh]h Description}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjLubh)}(hThis function uses the RCU read lock, so the result may be out of date by the time it returns. If you need the result to be stable, use a lock.h]hThis function uses the RCU read lock, so the result may be out of date by the time it returns. If you need the result to be stable, use a lock.}(hj6hj4hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjLubh)}(h **Context**h]j[)}(hjEh]hContext}(hhhjGhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjCubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjLubh)}(h.Any context. Takes and releases the RCU lock.h]h.Any context. Takes and releases the RCU lock.}(hj]hj[hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjLubh)}(h **Return**h]j[)}(hjlh]hReturn}(hhhjnhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjLubh)}(hFTrue if the entry at **index** has this mark set, false if it doesn't.h](hTrue if the entry at }(hTrue if the entry at hjhhhNhNubj[)}(h **index**h]hindex}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubh* has this mark set, false if it doesn’t.}(h( has this mark set, false if it doesn't.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjLubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_set_mark (C function) c.xa_set_markhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hIvoid xa_set_mark (struct xarray *xa, unsigned long index, xa_mark_t mark)h]ja)}(hHvoid xa_set_mark(struct xarray *xa, unsigned long index, xa_mark_t mark)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(h xa_set_markh]j)}(h xa_set_markh]h xa_set_mark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h8(struct xarray *xa, unsigned long index, xa_mark_t mark)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj"modnameN classnameNj%j%)}j%]j%)}j%jsb c.xa_set_markasbuh1hhjubjy)}(h h]h }(hhhj@hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjNhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhj[hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhjthhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjpubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjpubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjpubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjpubj)}(hindexh]hindex}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjpubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j< c.xa_set_markasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmarkh]hmark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubj+)}(hhh]h)}(hSet this mark on this entry.h]hSet this mark on this entry.}(hj!hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj7jNj7jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index of entry. ``xa_mark_t mark`` Mark number. **Description** Attempting to set a mark on a ``NULL`` entry does not succeed. **Context** Process context. Takes and releases the xa_lock.h](h)}(h**Parameters**h]j[)}(hjAh]h Parameters}(hhhjChhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj?ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj;ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hj`h]hstruct xarray *xa}(hhhjbhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj^ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjZubj)}(hhh]h)}(hXArray.h]hXArray.}(hj{hjyhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjuhMhjvubah}(h]h ]h"]h$]h&]uh1jhjZubeh}(h]h ]h"]h$]h&]uh1jhjuhMhjWubj)}(h(``unsigned long index`` Index of entry. h](j)}(h``unsigned long index``h]j4)}(hjh]hunsigned long index}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hIndex of entry.h]hIndex of entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjWubj)}(h ``xa_mark_t mark`` Mark number. h](j)}(h``xa_mark_t mark``h]j4)}(hjh]hxa_mark_t mark}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(h Mark number.h]h Mark number.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjWubeh}(h]h ]h"]h$]h&]uh1jhj;ubh)}(h**Description**h]j[)}(hj h]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj;ubh)}(h>Attempting to set a mark on a ``NULL`` entry does not succeed.h](hAttempting to set a mark on a }(hAttempting to set a mark on a hj#hhhNhNubj4)}(h``NULL``h]hNULL}(hhhj,hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj#ubh entry does not succeed.}(h entry does not succeed.hj#hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj;ubh)}(h **Context**h]j[)}(hjHh]hContext}(hhhjJhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjFubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj;ubh)}(h1Process context. Takes and releases the xa_lock.h]h1Process context. Takes and releases the xa_lock.}(hj`hj^hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj;ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_clear_mark (C function)c.xa_clear_markhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hKvoid xa_clear_mark (struct xarray *xa, unsigned long index, xa_mark_t mark)h]ja)}(hJvoid xa_clear_mark(struct xarray *xa, unsigned long index, xa_mark_t mark)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(h xa_clear_markh]j)}(h xa_clear_markh]h xa_clear_mark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h8(struct xarray *xa, unsigned long index, xa_mark_t mark)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsbc.xa_clear_markasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhj#hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long indexh](jg)}(hunsignedh]hunsigned}(hhhj<hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj8ubjy)}(h h]h }(hhhjJhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj8ubjg)}(hlongh]hlong}(hhhjXhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj8ubjy)}(h h]h }(hhhjfhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj8ubj)}(hindexh]hindex}(hhhjthhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj8ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hxa_mark_t markh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]jc.xa_clear_markasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmarkh]hmark}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubj+)}(hhh]h)}(hClear this mark on this entry.h]hClear this mark on this entry.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``struct xarray *xa`` XArray. ``unsigned long index`` Index of entry. ``xa_mark_t mark`` Mark number. **Description** Clearing a mark always succeeds. **Context** Process context. Takes and releases the xa_lock.h](h)}(h**Parameters**h]j[)}(hj h]h Parameters}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hj(h]hstruct xarray *xa}(hhhj*hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj&ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj"ubj)}(hhh]h)}(hXArray.h]hXArray.}(hjChjAhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj=hMhj>ubah}(h]h ]h"]h$]h&]uh1jhj"ubeh}(h]h ]h"]h$]h&]uh1jhj=hMhjubj)}(h(``unsigned long index`` Index of entry. h](j)}(h``unsigned long index``h]j4)}(hjah]hunsigned long index}(hhhjchhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj_ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj[ubj)}(hhh]h)}(hIndex of entry.h]hIndex of entry.}(hj|hjzhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjvhMhjwubah}(h]h ]h"]h$]h&]uh1jhj[ubeh}(h]h ]h"]h$]h&]uh1jhjvhMhjubj)}(h ``xa_mark_t mark`` Mark number. h](j)}(h``xa_mark_t mark``h]j4)}(hjh]hxa_mark_t mark}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(h Mark number.h]h Mark number.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h Clearing a mark always succeeds.h]h Clearing a mark always succeeds.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h1Process context. Takes and releases the xa_lock.h]h1Process context. Takes and releases the xa_lock.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_find (C function) c.xa_findhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h^void * xa_find (struct xarray *xa, unsigned long *indexp, unsigned long max, xa_mark_t filter)h]ja)}(h\void *xa_find(struct xarray *xa, unsigned long *indexp, unsigned long max, xa_mark_t filter)h](jg)}(hvoidh]hvoid}(hhhjA hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj= hhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjP hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj= hhhjO hMubj)}(hj(h]h*}(hhhj^ hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj= hhhjO hMubj)}(hxa_findh]j)}(hxa_findh]hxa_find}(hhhjo hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjk ubah}(h]h ](jjeh"]h$]h&]hhuh1jhj= hhhjO hMubj)}(hO(struct xarray *xa, unsigned long *indexp, unsigned long max, xa_mark_t filter)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj ubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj modnameN classnameNj%j%)}j%]j%)}j%jq sb c.xa_findasbuh1hhj ubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubj)}(hj(h]h*}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubj)}(hxah]hxa}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubj)}(hunsigned long *indexph](jg)}(hunsignedh]hunsigned}(hhhj hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj ubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubjg)}(hlongh]hlong}(hhhj hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj ubjy)}(h h]h }(hhhj' hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubj)}(hj(h]h*}(hhhj5 hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubj)}(hindexph]hindexp}(hhhjB hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubj)}(hunsigned long maxh](jg)}(hunsignedh]hunsigned}(hhhj[ hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjW ubjy)}(h h]h }(hhhji hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjW ubjg)}(hlongh]hlong}(hhhjw hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjW ubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjW ubj)}(hmaxh]hmax}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjW ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubj)}(hxa_mark_t filterh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj modnameN classnameNj%j%)}j%]j  c.xa_findasbuh1hhj ubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubj)}(hfilterh]hfilter}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubeh}(h]h ]h"]h$]h&]hhuh1jhj= hhhjO hMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj9 hhhjO hMubah}(h]j4 ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj6 hhubj+)}(hhh]h)}(hSearch the XArray for an entry.h]hSearch the XArray for an entry.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj hhubah}(h]h ]h"]h$]h&]uh1j*hj6 hhhjO hMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj jNj jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long *indexp`` Pointer to an index. ``unsigned long max`` Maximum index to search to. ``xa_mark_t filter`` Selection criterion. **Description** Finds the entry in **xa** which matches the **filter**, and has the lowest index that is at least **indexp** and no more than **max**. If an entry is found, **indexp** is updated to be the index of the entry. This function is protected by the RCU read lock, so it may not find entries which are being simultaneously added. It will not return an ``XA_RETRY_ENTRY``; if you need to see retry entries, use xas_find(). **Context** Any context. Takes and releases the RCU lock. **Return** The entry, if found, otherwise ``NULL``.h](h)}(h**Parameters**h]j[)}(hj( h]h Parameters}(hhhj* hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj& ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj" ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjG h]hstruct xarray *xa}(hhhjI hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjE ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjA ubj)}(hhh]h)}(hXArray.h]hXArray.}(hjb hj` hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj\ hMhj] ubah}(h]h ]h"]h$]h&]uh1jhjA ubeh}(h]h ]h"]h$]h&]uh1jhj\ hMhj> ubj)}(h/``unsigned long *indexp`` Pointer to an index. h](j)}(h``unsigned long *indexp``h]j4)}(hj h]hunsigned long *indexp}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj~ ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjz ubj)}(hhh]h)}(hPointer to an index.h]hPointer to an index.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hMhj ubah}(h]h ]h"]h$]h&]uh1jhjz ubeh}(h]h ]h"]h$]h&]uh1jhj hMhj> ubj)}(h2``unsigned long max`` Maximum index to search to. h](j)}(h``unsigned long max``h]j4)}(hj h]hunsigned long max}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj ubj)}(hhh]h)}(hMaximum index to search to.h]hMaximum index to search to.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hMhj ubah}(h]h ]h"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]uh1jhj hMhj> ubj)}(h*``xa_mark_t filter`` Selection criterion. h](j)}(h``xa_mark_t filter``h]j4)}(hj h]hxa_mark_t filter}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj ubj)}(hhh]h)}(hSelection criterion.h]hSelection criterion.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hMhj ubah}(h]h ]h"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]uh1jhj hMhj> ubeh}(h]h ]h"]h$]h&]uh1jhj" ubh)}(h**Description**h]j[)}(hj- h]h Description}(hhhj/ hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj+ ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj" ubh)}(hXFinds the entry in **xa** which matches the **filter**, and has the lowest index that is at least **indexp** and no more than **max**. If an entry is found, **indexp** is updated to be the index of the entry. This function is protected by the RCU read lock, so it may not find entries which are being simultaneously added. It will not return an ``XA_RETRY_ENTRY``; if you need to see retry entries, use xas_find().h](hFinds the entry in }(hFinds the entry in hjC hhhNhNubj[)}(h**xa**h]hxa}(hhhjL hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjC ubh which matches the }(h which matches the hjC hhhNhNubj[)}(h **filter**h]hfilter}(hhhj_ hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjC ubh,, and has the lowest index that is at least }(h,, and has the lowest index that is at least hjC hhhNhNubj[)}(h **indexp**h]hindexp}(hhhjr hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjC ubh and no more than }(h and no more than hjC hhhNhNubj[)}(h**max**h]hmax}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjC ubh. If an entry is found, }(h. If an entry is found, hjC hhhNhNubj[)}(h **indexp**h]hindexp}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjC ubh is updated to be the index of the entry. This function is protected by the RCU read lock, so it may not find entries which are being simultaneously added. It will not return an }(h is updated to be the index of the entry. This function is protected by the RCU read lock, so it may not find entries which are being simultaneously added. It will not return an hjC hhhNhNubj4)}(h``XA_RETRY_ENTRY``h]hXA_RETRY_ENTRY}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjC ubh3; if you need to see retry entries, use xas_find().}(h3; if you need to see retry entries, use xas_find().hjC hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj" ubh)}(h **Context**h]j[)}(hj h]hContext}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj" ubh)}(h.Any context. Takes and releases the RCU lock.h]h.Any context. Takes and releases the RCU lock.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj" ubh)}(h **Return**h]j[)}(hj h]hReturn}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj" ubh)}(h(The entry, if found, otherwise ``NULL``.h](hThe entry, if found, otherwise }(hThe entry, if found, otherwise hj hhhNhNubj4)}(h``NULL``h]hNULL}(hhhj hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubh.}(hjhj hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj" ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_find_after (C function)c.xa_find_afterhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hdvoid * xa_find_after (struct xarray *xa, unsigned long *indexp, unsigned long max, xa_mark_t filter)h]ja)}(hbvoid *xa_find_after(struct xarray *xa, unsigned long *indexp, unsigned long max, xa_mark_t filter)h](jg)}(hvoidh]hvoid}(hhhjF hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjB hhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM!ubjy)}(h h]h }(hhhjU hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjB hhhjT hM!ubj)}(hj(h]h*}(hhhjc hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjB hhhjT hM!ubj)}(h xa_find_afterh]j)}(h xa_find_afterh]h xa_find_after}(hhhjt hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjp ubah}(h]h ](jjeh"]h$]h&]hhuh1jhjB hhhjT hM!ubj)}(hO(struct xarray *xa, unsigned long *indexp, unsigned long max, xa_mark_t filter)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhj ubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubh)}(hhh]j)}(hxarrayh]hxarray}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj modnameN classnameNj%j%)}j%]j%)}j%jv sbc.xa_find_afterasbuh1hhj ubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubj)}(hj(h]h*}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubj)}(hxah]hxa}(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubj)}(hunsigned long *indexph](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj ubjy)}(h h]h }(hhhj,hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj ubj)}(hj(h]h*}(hhhj:hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubj)}(hindexph]hindexp}(hhhjGhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubj)}(hunsigned long maxh](jg)}(hunsignedh]hunsigned}(hhhj`hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj\ubjy)}(h h]h }(hhhjnhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj\ubjg)}(hlongh]hlong}(hhhj|hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhj\ubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj\ubj)}(hmaxh]hmax}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj\ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubj)}(hxa_mark_t filterh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j c.xa_find_afterasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hfilterh]hfilter}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhj ubeh}(h]h ]h"]h$]h&]hhuh1jhjB hhhjT hM!ubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhj> hhhjT hM!ubah}(h]j9 ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM0hj; hhubj+)}(hhh]h)}(h&Search the XArray for a present entry.h]h&Search the XArray for a present entry.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM hjhhubah}(h]h ]h"]h$]h&]uh1j*hj; hhhjT hM!ubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMj#jNj#jOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` XArray. ``unsigned long *indexp`` Pointer to an index. ``unsigned long max`` Maximum index to search to. ``xa_mark_t filter`` Selection criterion. **Description** Finds the entry in **xa** which matches the **filter** and has the lowest index that is above **indexp** and no more than **max**. If an entry is found, **indexp** is updated to be the index of the entry. This function is protected by the RCU read lock, so it may miss entries which are being simultaneously added. It will not return an ``XA_RETRY_ENTRY``; if you need to see retry entries, use xas_find(). **Context** Any context. Takes and releases the RCU lock. **Return** The pointer, if found, otherwise ``NULL``.h](h)}(h**Parameters**h]j[)}(hj-h]h Parameters}(hhhj/hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj+ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM$hj'ubj)}(hhh](j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjLh]hstruct xarray *xa}(hhhjNhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjJubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM!hjFubj)}(hhh]h)}(hXArray.h]hXArray.}(hjghjehhhNhNubah}(h]h ]h"]h$]h&]uh1hhjahM!hjbubah}(h]h ]h"]h$]h&]uh1jhjFubeh}(h]h ]h"]h$]h&]uh1jhjahM!hjCubj)}(h/``unsigned long *indexp`` Pointer to an index. h](j)}(h``unsigned long *indexp``h]j4)}(hjh]hunsigned long *indexp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM"hjubj)}(hhh]h)}(hPointer to an index.h]hPointer to an index.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM"hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM"hjCubj)}(h2``unsigned long max`` Maximum index to search to. h](j)}(h``unsigned long max``h]j4)}(hjh]hunsigned long max}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM#hjubj)}(hhh]h)}(hMaximum index to search to.h]hMaximum index to search to.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM#hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM#hjCubj)}(h*``xa_mark_t filter`` Selection criterion. h](j)}(h``xa_mark_t filter``h]j4)}(hjh]hxa_mark_t filter}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM$hjubj)}(hhh]h)}(hSelection criterion.h]hSelection criterion.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj hM$hj ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj hM$hjCubeh}(h]h ]h"]h$]h&]uh1jhj'ubh)}(h**Description**h]j[)}(hj2h]h Description}(hhhj4hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj0ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM&hj'ubh)}(hXFinds the entry in **xa** which matches the **filter** and has the lowest index that is above **indexp** and no more than **max**. If an entry is found, **indexp** is updated to be the index of the entry. This function is protected by the RCU read lock, so it may miss entries which are being simultaneously added. It will not return an ``XA_RETRY_ENTRY``; if you need to see retry entries, use xas_find().h](hFinds the entry in }(hFinds the entry in hjHhhhNhNubj[)}(h**xa**h]hxa}(hhhjQhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjHubh which matches the }(h which matches the hjHhhhNhNubj[)}(h **filter**h]hfilter}(hhhjdhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjHubh( and has the lowest index that is above }(h( and has the lowest index that is above hjHhhhNhNubj[)}(h **indexp**h]hindexp}(hhhjwhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjHubh and no more than }(h and no more than hjHhhhNhNubj[)}(h**max**h]hmax}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjHubh. If an entry is found, }(h. If an entry is found, hjHhhhNhNubj[)}(h **indexp**h]hindexp}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjHubh is updated to be the index of the entry. This function is protected by the RCU read lock, so it may miss entries which are being simultaneously added. It will not return an }(h is updated to be the index of the entry. This function is protected by the RCU read lock, so it may miss entries which are being simultaneously added. It will not return an hjHhhhNhNubj4)}(h``XA_RETRY_ENTRY``h]hXA_RETRY_ENTRY}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjHubh3; if you need to see retry entries, use xas_find().}(h3; if you need to see retry entries, use xas_find().hjHhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM&hj'ubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM-hj'ubh)}(h.Any context. Takes and releases the RCU lock.h]h.Any context. Takes and releases the RCU lock.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM-hj'ubh)}(h **Return**h]j[)}(hjh]hReturn}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM/hj'ubh)}(h*The pointer, if found, otherwise ``NULL``.h](h!The pointer, if found, otherwise }(h!The pointer, if found, otherwise hj hhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubh.}(hjhj hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM.hj'ubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_extract (C function) c.xa_extracthNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hunsigned int xa_extract (struct xarray *xa, void **dst, unsigned long start, unsigned long max, unsigned int n, xa_mark_t filter)h]ja)}(hunsigned int xa_extract(struct xarray *xa, void **dst, unsigned long start, unsigned long max, unsigned int n, xa_mark_t filter)h](jg)}(hunsignedh]hunsigned}(hhhjKhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjGhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMwubjy)}(h h]h }(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjGhhhjYhMwubjg)}(hinth]hint}(hhhjhhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjGhhhjYhMwubjy)}(h h]h }(hhhjvhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjGhhhjYhMwubj)}(h xa_extracth]j)}(h xa_extracth]h xa_extract}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjGhhhjYhMwubj)}(hi(struct xarray *xa, void **dst, unsigned long start, unsigned long max, unsigned int n, xa_mark_t filter)h](j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsb c.xa_extractasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(h void **dsth](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhj$hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhj2hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hj(h]h*}(hhhj?hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hdsth]hdst}(hhhjLhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long starth](jg)}(hunsignedh]hunsigned}(hhhjehhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjaubjy)}(h h]h }(hhhjshhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjaubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjaubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjaubj)}(hstarth]hstart}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjaubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned long maxh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hlongh]hlong}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hmaxh]hmax}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hunsigned int nh](jg)}(hunsignedh]hunsigned}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubjg)}(hinth]hint}(hhhj#hhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjubjy)}(h h]h }(hhhj1hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hjh]hn}(hhhj?hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hxa_mark_t filterh](h)}(hhh]j)}(h xa_mark_th]h xa_mark_t}(hhhjZhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjWubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetj\modnameN classnameNj%j%)}j%]j c.xa_extractasbuh1hhjSubjy)}(h h]h }(hhhjxhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjSubj)}(hfilterh]hfilter}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjSubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjGhhhjYhMwubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjChhhjYhMwubah}(h]j>ah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhj@hhubj+)}(hhh]h)}(h:Copy selected entries from the XArray into a normal array.h]h:Copy selected entries from the XArray into a normal array.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMvhjhhubah}(h]h ]h"]h$]h&]uh1j*hj@hhhjYhMwubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(hX**Parameters** ``struct xarray *xa`` The source XArray to copy from. ``void **dst`` The buffer to copy entries into. ``unsigned long start`` The first index in the XArray eligible to be selected. ``unsigned long max`` The last index in the XArray eligible to be selected. ``unsigned int n`` The maximum number of entries to copy. ``xa_mark_t filter`` Selection criterion. **Description** Copies up to **n** entries that match **filter** from the XArray. The copied entries will have indices between **start** and **max**, inclusive. The **filter** may be an XArray mark value, in which case entries which are marked with that mark will be copied. It may also be ``XA_PRESENT``, in which case all entries which are not ``NULL`` will be copied. The entries returned may not represent a snapshot of the XArray at a moment in time. For example, if another thread stores to index 5, then index 10, calling xa_extract() may return the old contents of index 5 and the new contents of index 10. Indices not modified while this function is running will not be skipped. If you need stronger guarantees, holding the xa_lock across calls to this function will prevent concurrent modification. **Context** Any context. Takes and releases the RCU lock. **Return** The number of entries copied.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMzhjubj)}(hhh](j)}(h6``struct xarray *xa`` The source XArray to copy from. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMwhjubj)}(hhh]h)}(hThe source XArray to copy from.h]hThe source XArray to copy from.}(hj hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMwhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMwhjubj)}(h0``void **dst`` The buffer to copy entries into. h](j)}(h``void **dst``h]j4)}(hj+h]h void **dst}(hhhj-hhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj)ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMxhj%ubj)}(hhh]h)}(h The buffer to copy entries into.h]h The buffer to copy entries into.}(hjFhjDhhhNhNubah}(h]h ]h"]h$]h&]uh1hhj@hMxhjAubah}(h]h ]h"]h$]h&]uh1jhj%ubeh}(h]h ]h"]h$]h&]uh1jhj@hMxhjubj)}(hO``unsigned long start`` The first index in the XArray eligible to be selected. h](j)}(h``unsigned long start``h]j4)}(hjdh]hunsigned long start}(hhhjfhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjbubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMyhj^ubj)}(hhh]h)}(h6The first index in the XArray eligible to be selected.h]h6The first index in the XArray eligible to be selected.}(hjhj}hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjyhMyhjzubah}(h]h ]h"]h$]h&]uh1jhj^ubeh}(h]h ]h"]h$]h&]uh1jhjyhMyhjubj)}(hL``unsigned long max`` The last index in the XArray eligible to be selected. h](j)}(h``unsigned long max``h]j4)}(hjh]hunsigned long max}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMzhjubj)}(hhh]h)}(h5The last index in the XArray eligible to be selected.h]h5The last index in the XArray eligible to be selected.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMzhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMzhjubj)}(h:``unsigned int n`` The maximum number of entries to copy. h](j)}(h``unsigned int n``h]j4)}(hjh]hunsigned int n}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM{hjubj)}(hhh]h)}(h&The maximum number of entries to copy.h]h&The maximum number of entries to copy.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhM{hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhM{hjubj)}(h*``xa_mark_t filter`` Selection criterion. h](j)}(h``xa_mark_t filter``h]j4)}(hjh]hxa_mark_t filter}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hj ubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM|hj ubj)}(hhh]h)}(hSelection criterion.h]hSelection criterion.}(hj*hj(hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj$hM|hj%ubah}(h]h ]h"]h$]h&]uh1jhj ubeh}(h]h ]h"]h$]h&]uh1jhj$hM|hjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h**Description**h]j[)}(hjJh]h Description}(hhhjLhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjHubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM~hjubh)}(hCopies up to **n** entries that match **filter** from the XArray. The copied entries will have indices between **start** and **max**, inclusive.h](h Copies up to }(h Copies up to hj`hhhNhNubj[)}(h**n**h]hn}(hhhjihhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj`ubh entries that match }(h entries that match hj`hhhNhNubj[)}(h **filter**h]hfilter}(hhhj|hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj`ubh@ from the XArray. The copied entries will have indices between }(h@ from the XArray. The copied entries will have indices between hj`hhhNhNubj[)}(h **start**h]hstart}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj`ubh and }(h and hj`hhhNhNubj[)}(h**max**h]hmax}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj`ubh , inclusive.}(h , inclusive.hj`hhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chM~hjubh)}(hThe **filter** may be an XArray mark value, in which case entries which are marked with that mark will be copied. It may also be ``XA_PRESENT``, in which case all entries which are not ``NULL`` will be copied.h](hThe }(hThe hjhhhNhNubj[)}(h **filter**h]hfilter}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubht may be an XArray mark value, in which case entries which are marked with that mark will be copied. It may also be }(ht may be an XArray mark value, in which case entries which are marked with that mark will be copied. It may also be hjhhhNhNubj4)}(h``XA_PRESENT``h]h XA_PRESENT}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh*, in which case all entries which are not }(h*, in which case all entries which are not hjhhhNhNubj4)}(h``NULL``h]hNULL}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubh will be copied.}(h will be copied.hjhhhNhNubeh}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hX>The entries returned may not represent a snapshot of the XArray at a moment in time. For example, if another thread stores to index 5, then index 10, calling xa_extract() may return the old contents of index 5 and the new contents of index 10. Indices not modified while this function is running will not be skipped.h]hX>The entries returned may not represent a snapshot of the XArray at a moment in time. For example, if another thread stores to index 5, then index 10, calling xa_extract() may return the old contents of index 5 and the new contents of index 10. Indices not modified while this function is running will not be skipped.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hxIf you need stronger guarantees, holding the xa_lock across calls to this function will prevent concurrent modification.h]hxIf you need stronger guarantees, holding the xa_lock across calls to this function will prevent concurrent modification.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Context**h]j[)}(hj%h]hContext}(hhhj'hhhNhNubah}(h]h ]h"]h$]h&]uh1jZhj#ubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h.Any context. Takes and releases the RCU lock.h]h.Any context. Takes and releases the RCU lock.}(hj=hj;hhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h **Return**h]j[)}(hjLh]hReturn}(hhhjNhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjJubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(hThe number of entries copied.h]hThe number of entries copied.}(hjdhjbhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_delete_node (C function)c.xa_delete_nodehNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(hCvoid xa_delete_node (struct xa_node *node, xa_update_node_t update)h]ja)}(hBvoid xa_delete_node(struct xa_node *node, xa_update_node_t update)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(hxa_delete_nodeh]j)}(hxa_delete_nodeh]hxa_delete_node}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h/(struct xa_node *node, xa_update_node_t update)h](j)}(hstruct xa_node *nodeh](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxa_nodeh]hxa_node}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsbc.xa_delete_nodeasbuh1hhjubjy)}(h h]h }(hhhj hhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hnodeh]hnode}(hhhj'hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubj)}(hxa_update_node_t updateh](h)}(hhh]j)}(hxa_update_node_th]hxa_update_node_t}(hhhjChhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj@ubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjEmodnameN classnameNj%j%)}j%]jc.xa_delete_nodeasbuh1hhj<ubjy)}(h h]h }(hhhjahhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhj<ubj)}(hupdateh]hupdate}(hhhjohhhNhNubah}(h]h ]jah"]h$]h&]uh1jhj<ubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubeh}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubj+)}(hhh]h)}(h&Private interface for workingset code.h]h&Private interface for workingset code.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjjNjjOuh1jUhhhj3hNhNubjQ)}(h**Parameters** ``struct xa_node *node`` Node to be removed from the tree. ``xa_update_node_t update`` Function to call to update ancestor nodes. **Context** xa_lock must be held on entry and will not be released.h](h)}(h**Parameters**h]j[)}(hjh]h Parameters}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh](j)}(h;``struct xa_node *node`` Node to be removed from the tree. h](j)}(h``struct xa_node *node``h]j4)}(hjh]hstruct xa_node *node}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(h!Node to be removed from the tree.h]h!Node to be removed from the tree.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubj)}(hG``xa_update_node_t update`` Function to call to update ancestor nodes. h](j)}(h``xa_update_node_t update``h]j4)}(hjh]hxa_update_node_t update}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(h*Function to call to update ancestor nodes.h]h*Function to call to update ancestor nodes.}(hj/hj-hhhNhNubah}(h]h ]h"]h$]h&]uh1hhj)hMhj*ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhj)hMhjubeh}(h]h ]h"]h$]h&]uh1jhjubh)}(h **Context**h]j[)}(hjOh]hContext}(hhhjQhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjMubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubh)}(h7xa_lock must be held on entry and will not be released.h]h7xa_lock must be held on entry and will not be released.}(hjghjehhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubjE)}(hhh]h}(h]h ]h"]h$]h&]entries](jQxa_destroy (C function) c.xa_destroyhNtauh1jDhj3hhhNhNubjV)}(hhh](j[)}(h#void xa_destroy (struct xarray *xa)h]ja)}(h"void xa_destroy(struct xarray *xa)h](jg)}(hvoidh]hvoid}(hhhjhhhNhNubah}(h]h ]jsah"]h$]h&]uh1jfhjhhhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjhhhjhMubj)}(h xa_destroyh]j)}(h xa_destroyh]h xa_destroy}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ](jjeh"]h$]h&]hhuh1jhjhhhjhMubj)}(h(struct xarray *xa)h]j)}(hstruct xarray *xah](jz)}(hjh]hstruct}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jyhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubh)}(hhh]j)}(hxarrayh]hxarray}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubah}(h]h ]h"]h$]h&] refdomainjGreftypej% reftargetjmodnameN classnameNj%j%)}j%]j%)}j%jsb c.xa_destroyasbuh1hhjubjy)}(h h]h }(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jxhjubj)}(hj(h]h*}(hhhjhhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubj)}(hxah]hxa}(hhhj*hhhNhNubah}(h]h ]jah"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]noemphhhuh1jhjubah}(h]h ]h"]h$]h&]hhuh1jhjhhhjhMubeh}(h]h ]h"]h$]h&]hhjuh1j`jjhjhhhjhMubah}(h]jah ](j#j$eh"]h$]h&]j(uh1jZhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjhhubj+)}(hhh]h)}(h"Free all internal data structures.h]h"Free all internal data structures.}(hjWhjUhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjRhhubah}(h]h ]h"]h$]h&]uh1j*hjhhhjhMubeh}(h]h ](jGfunctioneh"]h$]h&]jLjGjMjmjNjmjOuh1jUhhhj3hNhNubjQ)}(hXJ**Parameters** ``struct xarray *xa`` XArray. **Description** After calling this function, the XArray is empty and has freed all memory allocated for its internal data structures. You are responsible for freeing the objects referenced by the XArray. **Context** Any context. Takes and releases the xa_lock, interrupt-safe.h](h)}(h**Parameters**h]j[)}(hjwh]h Parameters}(hhhjyhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjuubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjqubj)}(hhh]j)}(h``struct xarray *xa`` XArray. h](j)}(h``struct xarray *xa``h]j4)}(hjh]hstruct xarray *xa}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1j3hjubah}(h]h ]h"]h$]h&]uh1jhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjubj)}(hhh]h)}(hXArray.h]hXArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjhMhjubah}(h]h ]h"]h$]h&]uh1jhjqubh)}(h**Description**h]j[)}(hjh]h Description}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjqubh)}(hAfter calling this function, the XArray is empty and has freed all memory allocated for its internal data structures. You are responsible for freeing the objects referenced by the XArray.h]hAfter calling this function, the XArray is empty and has freed all memory allocated for its internal data structures. You are responsible for freeing the objects referenced by the XArray.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjqubh)}(h **Context**h]j[)}(hjh]hContext}(hhhjhhhNhNubah}(h]h ]h"]h$]h&]uh1jZhjubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjqubh)}(h=Any context. Takes and releases the xa_lock, interrupt-safe.h]h=Any context. Takes and releases the xa_lock, interrupt-safe.}(hjhjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhM/var/lib/git/docbuild/linux/Documentation/core-api/xarray:496: ./lib/xarray.chMhjqubeh}(h]h ] kernelindentah"]h$]h&]uh1jPhj3hhhNhNubeh}(h]functions-and-structuresah ]h"]functions and structuresah$]h&]uh1hhhhhhhhMubeh}(h]xarrayah ]h"]xarrayah$]h&]uh1hhhhhhhhKubeh}(h]h ]h"]h$]h&]sourcehuh1hcurrent_sourceN current_lineNsettingsdocutils.frontendValues)}(hN generatorN datestampN source_linkN source_urlN toc_backlinksj footnote_backlinksK sectnum_xformKstrip_commentsNstrip_elements_with_classesN strip_classesN report_levelK halt_levelKexit_status_levelKdebugNwarning_streamN tracebackinput_encoding utf-8-siginput_encoding_error_handlerstrictoutput_encodingutf-8output_encoding_error_handlerjVerror_encodingUTF-8error_encoding_error_handlerbackslashreplace language_codeenrecord_dependenciesNconfigN id_prefixhauto_id_prefixid dump_settingsNdump_internalsNdump_transformsNdump_pseudo_xmlNexpose_internalsNstrict_visitorN_disable_configN_sourceh _destinationN _config_files]7/var/lib/git/docbuild/linux/Documentation/docutils.confapep_referencesN pep_base_urlhttps://peps.python.org/pep_file_url_templatepep-%04drfc_referencesN rfc_base_url&https://datatracker.ietf.org/doc/html/ tab_widthKtrim_footnote_reference_spacefile_insertion_enabled raw_enabledKline_length_limitM'syntax_highlightlong smart_quotessmartquotes_locales]character_level_inline_markupdoctitle_xform docinfo_xformKsectsubtitle_xform image_loadinglinkembed_stylesheetcloak_email_addressessection_self_link embed_imagesenvNubreporterNindirect_targets]substitution_defs}substitution_names}refnames}refids}nameids}(j1j.jjj j jjjtjqjjj j j0j-j j j{ jx j(j%j)j&u nametypes}(j1NjNj NjNjtNjNj Nj0Nj Nj{ Nj(Nj)Nuh}(j.hjj j jjjjqjjjwj jj-j j j jx j j%j~ j&j3jSj\jjjjj[j`jjj>jCjjjjjejjjj jqjvj j j!j!j#j#j $j$j%j%jF'jK'j(j(j*j*j-j-j/j/j/2j42jg4jl4j6j6jN:jS:j=j=j?@jD@jBjBj GjGjJjKjNjNjZRj_RjUjUj.Yj3Yj]j]jDbjIbjfjfjkjlj)qj.qjVvj[vjyjyji|jn|jDjIjdjij߂jjZj_jՅjڅj-j2jjj^jcjjjjjjjUjZjjjj”j6j;jjjj j'j,jjjjjjjjƦjdjij@jEjЫjիjjjj"jijnjjjjjjjjjjjDjIjvj{j6j;jjjjj,j1jjj0j5jGjLjjj;j@jjj@jEjjj jjsjxjj jjjjjHjMjujzj=jBjjjjjjj4 j9 j9 j> j>jCjjjju footnote_refs} citation_refs} autofootnotes]autofootnote_refs]symbol_footnotes]symbol_footnote_refs] footnotes] citations]autofootnote_startKsymbol_footnote_startK id_counter collectionsCounter}Rparse_messages]transform_messages] transformerN include_log] decorationNhhub.