L2BPERDMAP       1842 fs/jfs/jfs_dmap.c 	if (l2nb <= L2BPERDMAP) {
L2BPERDMAP       1882 fs/jfs/jfs_dmap.c 		if (dp->tree.stree[ROOT] != L2BPERDMAP) {
L2BPERDMAP       1991 fs/jfs/jfs_dmap.c 	assert(l2nb <= L2BPERDMAP);
L2BPERDMAP       3513 fs/jfs/jfs_dmap.c 				    L2BPERDMAP;
L2BPERDMAP       3705 fs/jfs/jfs_dmap.c 	    bmp->db_agl2size - (L2BPERDMAP + bmp->db_aglevel * L2LPERCTL);
L2BPERDMAP       3965 fs/jfs/jfs_dmap.c 	dcp->budmin = L2BPERDMAP + L2LPERCTL * level;
L2BPERDMAP       3998 fs/jfs/jfs_dmap.c 		return (L2BPERDMAP);
L2BPERDMAP       4076 fs/jfs/jfs_dmap.c 	nblocks = ndmaps << L2BPERDMAP;
L2BPERDMAP         34 fs/jfs/jfs_dmap.h #define	L2MAXL0SIZE	(L2BPERDMAP + 1 * L2LPERCTL)
L2BPERDMAP         35 fs/jfs/jfs_dmap.h #define	L2MAXL1SIZE	(L2BPERDMAP + 2 * L2LPERCTL)
L2BPERDMAP         36 fs/jfs/jfs_dmap.h #define	L2MAXL2SIZE	(L2BPERDMAP + 3 * L2LPERCTL)
L2BPERDMAP        161 fs/jfs/resize.c 	t64 = ((newLVSize - newLogSize + BPERDMAP - 1) >> L2BPERDMAP)
L2BPERDMAP        162 fs/jfs/resize.c 	    << L2BPERDMAP;