XA_CHUNK_SHIFT
#define MAX_XAS_ORDER (XA_CHUNK_SHIFT * 2 - 1)
#define RADIX_TREE_MAP_SHIFT XA_CHUNK_SHIFT
#ifndef XA_CHUNK_SHIFT
#define XA_CHUNK_SIZE (1UL << XA_CHUNK_SHIFT)
order - (order % XA_CHUNK_SHIFT), \
(1U << (order % XA_CHUNK_SHIFT)) - 1)
xas->xa_shift = order - (order % XA_CHUNK_SHIFT);
xas->xa_sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1;
XA_CHUNK_SHIFT;
if (((new_order / XA_CHUNK_SHIFT) < (order / XA_CHUNK_SHIFT)) &&
for (order = 1; order < 2 * XA_CHUNK_SHIFT; order++) {
unsigned int sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1;
if (WARN_ON(xas->xa_shift + 2 * XA_CHUNK_SHIFT <= order))
if (xas->xa_shift + XA_CHUNK_SHIFT > order)
unsigned int sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1;
child->shift = node->shift - XA_CHUNK_SHIFT;
if (order % XA_CHUNK_SHIFT == 0)
return order - (order % XA_CHUNK_SHIFT);
unsigned int sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1;
(1 << ((order - 1) % XA_CHUNK_SHIFT)) - 1;
child->shift = node->shift - XA_CHUNK_SHIFT;
shift += XA_CHUNK_SHIFT;
sibs >>= XA_CHUNK_SHIFT;
first >>= XA_CHUNK_SHIFT;
(node->shift + XA_CHUNK_SHIFT),
.xa_shift = node->shift + XA_CHUNK_SHIFT,
shift = xa_to_node(entry)->shift + XA_CHUNK_SHIFT;
shift += XA_CHUNK_SHIFT;
return shift + XA_CHUNK_SHIFT;
shift = node->shift + XA_CHUNK_SHIFT;
shift += XA_CHUNK_SHIFT;
shift = XA_CHUNK_SHIFT;
shift -= XA_CHUNK_SHIFT;
max_nodes = pages >> (XA_CHUNK_SHIFT - 3);
int height = order[i] / XA_CHUNK_SHIFT;
int shift = height * XA_CHUNK_SHIFT;