BLIST_RADIX
radix / BLIST_RADIX);
(long long)blk, (long long)BLIST_RADIX,
(int)(1 + (BLIST_RADIX - 1) / 4),
(long long)blk, (long long)radix * BLIST_RADIX,
(long long)radix * BLIST_RADIX,
(int)(1 + (BLIST_RADIX - 1) / 4),
radix / BLIST_RADIX, tab);
daddr_t size = BLIST_RADIX * BLIST_RADIX;
(long long)size, (long long)bl->bl_radix * BLIST_RADIX);
#define BLIST_MASK (BLIST_RADIX - 1)
((u_daddr_t)-1 >> (BLIST_RADIX - (n + count))));
for (radix = 1; (blocks - 1) / BLIST_RADIX / radix > 0;
radix *= BLIST_RADIX)
nodes += 1 + (blocks - 1) / BLIST_RADIX / radix;
if (blocks % BLIST_RADIX == 0)
radix /= BLIST_RADIX;
nodes += radix_to_skip(radix * BLIST_RADIX);
i += radix * BLIST_RADIX;
((i / BLIST_RADIX / radix) & BLIST_MASK) == 0;
radix *= BLIST_RADIX)
start += BLIST_RADIX;
for (blk = start; blk - start < maxcount; blk += BLIST_RADIX) {
radix = BLIST_RADIX;
radix *= BLIST_RADIX;
if (maxcount % BLIST_RADIX == 0) {
radix /= BLIST_RADIX;
blk -= BLIST_RADIX;
if (maxcount % BLIST_RADIX != 0)
scan->bm_bitmap &= ~bitrange(0, maxcount % BLIST_RADIX);
blk -= BLIST_RADIX;
for (radix = BLIST_RADIX;
radix *= BLIST_RADIX) {
} else if (maxcount <= BLIST_RADIX - lo) {
if (hi == BLIST_RADIX)
count1 = *count - (BLIST_RADIX - lo);
maxcount -= BLIST_RADIX - lo;
*count = BLIST_RADIX - lo + hi;
blk = cursor & -(radix * BLIST_RADIX);
count, maxcount, radix / BLIST_RADIX);
if (scan_from_start && !(digit == BLIST_RADIX - 1 &&
blk = (freeBlk + radix * BLIST_RADIX) & -(radix * BLIST_RADIX);
blst_meta_free(&scan[i], freeBlk, count, radix / BLIST_RADIX);
radix / BLIST_RADIX, dest, count);
blk = (allocBlk + radix * BLIST_RADIX) & -(radix * BLIST_RADIX);
#define BLIST_MAX_ALLOC BLIST_RADIX