budmin 1359 fs/jfs/jfs_dmap.c int budmin; budmin 1414 fs/jfs/jfs_dmap.c budmin = dcp->budmin; budmin 1475 fs/jfs/jfs_dmap.c ((s64) (ti - le32_to_cpu(dcp->leafidx))) << budmin; budmin 1487 fs/jfs/jfs_dmap.c if (l2nb < budmin) { budmin 1719 fs/jfs/jfs_dmap.c int budmin; budmin 1736 fs/jfs/jfs_dmap.c budmin = dcp->budmin; budmin 1771 fs/jfs/jfs_dmap.c b += (((s64) leafidx) << budmin); budmin 1778 fs/jfs/jfs_dmap.c if (l2nb >= budmin) budmin 2522 fs/jfs/jfs_dmap.c leafno = BLKTOCTLLEAF(blkno, dcp->budmin); budmin 2556 fs/jfs/jfs_dmap.c dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval); budmin 2599 fs/jfs/jfs_dmap.c dcp->budmin, oldval); budmin 3848 fs/jfs/jfs_dmap.c tp->budmin = BUDMIN; budmin 3891 fs/jfs/jfs_dmap.c l2max = le32_to_cpu(dtp->l2nleafs) + dtp->budmin; budmin 3907 fs/jfs/jfs_dmap.c for (l2free = dtp->budmin, bsize = 1; l2free < l2max; budmin 3965 fs/jfs/jfs_dmap.c dcp->budmin = L2BPERDMAP + L2LPERCTL * level; budmin 139 fs/jfs/jfs_dmap.h s8 budmin; /* 1: min l2 tree leaf value to combine */ budmin 167 fs/jfs/jfs_dmap.h s8 budmin; /* 1: minimum l2 tree leaf value */ budmin 185 fs/jfs/jfs_dmap.h #define dmt_budmin t1.budmin