L2BPERDMAP 1747 fs/jfs/jfs_dmap.c if (l2nb <= L2BPERDMAP) { L2BPERDMAP 1787 fs/jfs/jfs_dmap.c if (dp->tree.stree[ROOT] != L2BPERDMAP) { L2BPERDMAP 1897 fs/jfs/jfs_dmap.c assert(l2nb <= L2BPERDMAP); L2BPERDMAP 3424 fs/jfs/jfs_dmap.c L2BPERDMAP; L2BPERDMAP 3617 fs/jfs/jfs_dmap.c bmp->db_agl2size - (L2BPERDMAP + bmp->db_aglevel * L2LPERCTL); L2BPERDMAP 3877 fs/jfs/jfs_dmap.c dcp->budmin = L2BPERDMAP + L2LPERCTL * level; L2BPERDMAP 3910 fs/jfs/jfs_dmap.c return (L2BPERDMAP); L2BPERDMAP 3988 fs/jfs/jfs_dmap.c nblocks = ndmaps << L2BPERDMAP; L2BPERDMAP 47 fs/jfs/jfs_dmap.h #define L2MAXL0SIZE (L2BPERDMAP + 1 * L2LPERCTL) L2BPERDMAP 48 fs/jfs/jfs_dmap.h #define L2MAXL1SIZE (L2BPERDMAP + 2 * L2LPERCTL) L2BPERDMAP 49 fs/jfs/jfs_dmap.h #define L2MAXL2SIZE (L2BPERDMAP + 3 * L2LPERCTL) L2BPERDMAP 173 fs/jfs/resize.c t64 = ((newLVSize - newLogSize + BPERDMAP - 1) >> L2BPERDMAP) L2BPERDMAP 174 fs/jfs/resize.c << L2BPERDMAP;