Lines Matching defs:order
409 * in order to add the entry described by @xas. Because we cannot store a
646 unsigned int order = xas->xa_shift;
674 while (shift > order) {
993 * @order: Current entry order.
998 * to prepare for the upcoming split of an entry of @order size into
999 * entries of the order stored in the @xas.
1003 void xas_split_alloc(struct xa_state *xas, void *entry, unsigned int order,
1006 unsigned int sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1;
1010 if (WARN_ON(xas->xa_shift + 2 * XA_CHUNK_SHIFT < order))
1012 if (xas->xa_shift + XA_CHUNK_SHIFT > order)
1047 * @order: Current entry order.
1054 void xas_split(struct xa_state *xas, void *entry, unsigned int order)
1056 unsigned int sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1;
1110 * order to yield to a higher priority thread or carry out an operation
1729 unsigned int order = BITS_PER_LONG;
1731 order = __ffs(last + 1);
1732 xas_set_order(&xas, last, order);
1753 * xa_get_order() - Get the order of an entry.
1757 * Return: A number between 0 and 63 indicating the order of the entry.
1763 int order = 0;
1775 unsigned int slot = xas.xa_offset + (1 << order);
1781 order++;
1784 order += xas.xa_node->shift;
1788 return order;