Lines Matching refs:next
270 struct xa_node *next, *node = xas->xa_alloc;
274 next = rcu_dereference_raw(node->parent);
276 xas->xa_alloc = node = next;
782 void *first, *next;
800 next = first;
820 if (xa_is_node(next) && (!node || node->shift))
821 xas_free_nodes(xas, xa_to_node(next));
824 count += !next - !entry;
835 next = xa_entry_locked(xas->xa, node, ++offset);
836 if (!xa_is_sibling(next)) {
839 first = next;
1112 * the lock. It resets the @xas to be suitable for the next iteration
1183 * __xas_next() - Find the next entry in the XArray.
1222 * xas_find() - Find the next present entry in the XArray.
1229 * next entry.
1286 * xas_find_marked() - Find the next marked entry in the XArray.
1386 * xas_find_conflict() - Find the next present entry in a range.
1392 * Return: The next entry in the range covered by @xas or %NULL.
1847 * @next: Pointer to next ID to allocate.
1853 * The search for an empty entry will start at @next and will wrap
1866 struct xa_limit limit, u32 *next, gfp_t gfp)
1871 limit.min = max(min, *next);
1886 *next = *id + 1;
1887 if (*next == 0)
2247 node->array, node->private_list.prev, node->private_list.next);