Function radix_to_skip

freebsd/kern/subr_blist.c:169–174

* For a subtree that can represent the state of up to 'radix' blocks, the * number of leaf nodes of the subtree is L=radix/BLIST_RADIX. If 'm' * is short for BLIST_RADIX, then for a tree of height h with L=m**h * leaf nodes, the total number of tree nodes is 1 + m + m**2 + ... + m**h, * or, equivalently, (m**(h+1)-1)/(m-1). This quantity is called 'skip' * in the 'meta' functions that proce

 * calculation.
 */
static inline daddr_t
radix_to_skip(daddr_t radix)
{

	return (radix / BLIST_MASK);
}

/*
 * Provide a mask with count bits set, starting as position n.