Lines Matching defs:order
408 * in order to add the entry described by @xas. Because we cannot store a
645 unsigned int order = xas->xa_shift;
673 while (shift > order) {
992 * @order: New entry order.
997 * to prepare for the upcoming split of an entry of @order size into
998 * entries of the order stored in the @xas.
1002 void xas_split_alloc(struct xa_state *xas, void *entry, unsigned int order,
1005 unsigned int sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1;
1009 if (WARN_ON(xas->xa_shift + 2 * XA_CHUNK_SHIFT < order))
1011 if (xas->xa_shift + XA_CHUNK_SHIFT > order)
1046 * @order: New entry order.
1052 void xas_split(struct xa_state *xas, void *entry, unsigned int order)
1054 unsigned int sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1;
1108 * order to yield to a higher priority thread or carry out an operation
1727 unsigned int order = BITS_PER_LONG;
1729 order = __ffs(last + 1);
1730 xas_set_order(&xas, last, order);
1751 * xa_get_order() - Get the order of an entry.
1755 * Return: A number between 0 and 63 indicating the order of the entry.
1761 int order = 0;
1773 unsigned int slot = xas.xa_offset + (1 << order);
1779 order++;
1782 order += xas.xa_node->shift;
1786 return order;