L2BPERDMAP
if (l2nb <= L2BPERDMAP) {
if (dp->tree.stree[ROOT] != L2BPERDMAP) {
assert(l2nb <= L2BPERDMAP);
L2BPERDMAP;
bmp->db_agl2size - (L2BPERDMAP + bmp->db_aglevel * L2LPERCTL);
dcp->budmin = L2BPERDMAP + L2LPERCTL * level;
return (L2BPERDMAP);
nblocks = ndmaps << L2BPERDMAP;
#define L2MAXL0SIZE (L2BPERDMAP + 1 * L2LPERCTL)
#define L2MAXL1SIZE (L2BPERDMAP + 2 * L2LPERCTL)
#define L2MAXL2SIZE (L2BPERDMAP + 3 * L2LPERCTL)
t64 = ((newLVSize - newLogSize + BPERDMAP - 1) >> L2BPERDMAP)
<< L2BPERDMAP;