Lines Matching refs:entry
72 unsigned order, void *entry, gfp_t gfp)
79 curr = xas_store(&xas, entry);
105 void *entry;
138 xas_for_each(&xas, entry, ULONG_MAX) {
153 void *entry = xa_load(xa, j);
155 XA_BUG_ON(xa, xa_to_value(entry) != j);
157 XA_BUG_ON(xa, entry);
164 void *entry = xa_load(xa, j);
166 XA_BUG_ON(xa, xa_to_value(entry) != j);
168 XA_BUG_ON(xa, entry);
203 * Storing a multi-index entry over entries with marks gives the
204 * entire entry the union of the marks
222 void *entry;
230 xas_for_each(&xas, entry, ULONG_MAX)
239 xas_for_each_marked(&xas, entry, ULONG_MAX, XA_MARK_0)
259 void *entry;
276 xas_for_each_marked(&xas, entry, ULONG_MAX, XA_MARK_0)
282 xas_for_each(&xas, entry, ULONG_MAX) {
296 void *entry;
303 xas_for_each_marked(&xas, entry, ULONG_MAX, XA_MARK_0) {
305 XA_BUG_ON(xa, entry != xa_mk_index(0x40));
336 * Check that erasing the entry at 1 shrinks the tree and properly
428 void *entry;
432 /* An array with a reserved entry is not empty */
440 /* Releasing a used entry does nothing */
447 /* cmpxchg sees a reserved entry as ZERO */
463 /* Can iterate through a reserved entry */
469 xa_for_each(xa, index, entry) {
475 /* If we free a reserved entry, we should be able to allocate it */
495 void *entry;
520 xas_for_each(&xas, entry, ULONG_MAX) {
521 XA_BUG_ON(xa, entry != xa_mk_index(j));
574 void *entry;
580 xas_for_each(&xas, entry, ULONG_MAX) {
581 XA_BUG_ON(xa, entry != xa_mk_index(index));
586 xas_for_each(&xas, entry, ULONG_MAX) {
587 XA_BUG_ON(xa, entry != xa_mk_index(index));
651 void *entry = xa_load(xa, (1UL << k) - 1);
653 XA_BUG_ON(xa, entry != NULL);
655 XA_BUG_ON(xa, entry != xa_mk_index(j));
756 void *entry;
787 xa_for_each(xa, index, entry) {
809 void *entry;
825 entry = xa_mk_index(i);
827 entry = xa_mk_index(i - 0x3fff);
828 XA_BUG_ON(xa, xa_alloc_cyclic(xa, &id, entry, limit,
830 XA_BUG_ON(xa, xa_mk_index(id) != entry);
848 xa_for_each(xa, index, entry)
871 void *entry;
876 xas_for_each_conflict(&xas, entry) {
877 XA_BUG_ON(xa, !xa_is_value(entry));
878 XA_BUG_ON(xa, entry < xa_mk_index(start));
879 XA_BUG_ON(xa, entry > xa_mk_index(start + (1UL << order) - 1));
970 void *entry;
980 xas_for_each(&xas, entry, ULONG_MAX) {
1023 void *entry = xa_find(xa, &index, ULONG_MAX,
1030 XA_BUG_ON(xa, entry != NULL);
1033 entry = xa_find(xa, &index, ULONG_MAX,
1040 XA_BUG_ON(xa, entry != NULL);
1054 void *entry;
1057 xa_for_each(xa, index, entry) {
1064 xa_for_each(xa, index, entry) {
1065 XA_BUG_ON(xa, xa_mk_index(index) != entry);
1077 void *entry;
1084 xas_for_each_marked(&xas, entry, k, XA_MARK_0)
1101 void *entry;
1105 entry = xa_find_after(xa, &index, ULONG_MAX, XA_PRESENT);
1106 XA_BUG_ON(xa, entry != xa_mk_index(ULONG_MAX));
1108 entry = xa_find_after(xa, &index, ULONG_MAX, XA_PRESENT);
1109 XA_BUG_ON(xa, entry);
1134 void *entry;
1137 xas_for_each(&xas, entry, ULONG_MAX) {
1138 if (xas_retry(&xas, entry))
1140 if (entry == item)
1149 return entry ? xas.xa_index : -1;
1187 void *entry;
1199 xas_for_each(&xas, entry, ULONG_MAX) {
1200 XA_BUG_ON(xa, entry != xa_mk_index(1UL << count));
1209 xas_for_each(&xas, entry, ULONG_MAX) {
1210 XA_BUG_ON(xa, entry != xa_mk_index(1UL << count));
1273 void *entry = xas_next(&xas);
1278 XA_BUG_ON(xa, entry != xa_mk_index(i));
1280 XA_BUG_ON(xa, entry != NULL);
1286 void *entry = xas_prev(&xas);
1292 XA_BUG_ON(xa, entry != xa_mk_index(i));
1294 XA_BUG_ON(xa, entry != NULL);
1321 void *entry = xas_prev(&xas);
1323 XA_BUG_ON(xa, entry != xa_mk_index(i));
1331 void *entry = xas_next(&xas);
1332 XA_BUG_ON(xa, entry != xa_mk_index(i));
1345 void *entry = xas_prev(&xas);
1348 XA_BUG_ON(xa, entry != xa_mk_index(i));
1350 XA_BUG_ON(xa, entry != NULL);
1358 void *entry = xas_next(&xas);
1360 XA_BUG_ON(xa, entry != xa_mk_index(i));
1362 XA_BUG_ON(xa, entry != NULL);
1603 void *entry;
1610 xa_for_each(xa, index, entry)
1611 XA_BUG_ON(xa, xa_is_err(entry));
1769 /* Destroying an array with a single entry */
1777 /* Destroying an array with a single entry at ULONG_MAX */
1784 /* Destroying an array with a multi-index entry */