l2nb               72 fs/jfs/jfs_dmap.c static int dbAllocAny(struct bmap * bmp, s64 nblocks, int l2nb, s64 * results);
l2nb               77 fs/jfs/jfs_dmap.c 		       int l2nb, s64 * results);
l2nb               81 fs/jfs/jfs_dmap.c 			  int l2nb,
l2nb               83 fs/jfs/jfs_dmap.c static int dbAllocAG(struct bmap * bmp, int agno, s64 nblocks, int l2nb,
l2nb               85 fs/jfs/jfs_dmap.c static int dbAllocCtl(struct bmap * bmp, s64 nblocks, int l2nb, s64 blkno,
l2nb               88 fs/jfs/jfs_dmap.c static int dbFindBits(u32 word, int l2nb);
l2nb               89 fs/jfs/jfs_dmap.c static int dbFindCtl(struct bmap * bmp, int l2nb, int level, s64 * blkno);
l2nb               90 fs/jfs/jfs_dmap.c static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx);
l2nb              695 fs/jfs/jfs_dmap.c 	int l2nb;
l2nb              706 fs/jfs/jfs_dmap.c 	l2nb = BLKSTOL2(nblocks);
l2nb              721 fs/jfs/jfs_dmap.c 	if (l2nb > bmp->db_agl2size) {
l2nb              724 fs/jfs/jfs_dmap.c 		rc = dbAllocAny(bmp, nblocks, l2nb, results);
l2nb              805 fs/jfs/jfs_dmap.c 		     dbAllocNear(bmp, dp, blkno, (int) nblocks, l2nb, results))
l2nb              817 fs/jfs/jfs_dmap.c 		if ((rc = dbAllocDmapLev(bmp, dp, (int) nblocks, l2nb, results))
l2nb              834 fs/jfs/jfs_dmap.c 	if ((rc = dbAllocAG(bmp, agno, nblocks, l2nb, results)) != -ENOSPC)
l2nb              850 fs/jfs/jfs_dmap.c 	if ((rc = dbAllocAG(bmp, agno, nblocks, l2nb, results)) == -ENOSPC)
l2nb              851 fs/jfs/jfs_dmap.c 		rc = dbAllocAny(bmp, nblocks, l2nb, results);
l2nb             1245 fs/jfs/jfs_dmap.c 	    struct dmap * dp, s64 blkno, int nblocks, int l2nb, s64 * results)
l2nb             1269 fs/jfs/jfs_dmap.c 		if (leaf[word] < l2nb)
l2nb             1284 fs/jfs/jfs_dmap.c 			    dbFindBits(le32_to_cpu(dp->wmap[word]), l2nb);
l2nb             1353 fs/jfs/jfs_dmap.c dbAllocAG(struct bmap * bmp, int agno, s64 nblocks, int l2nb, s64 * results)
l2nb             1364 fs/jfs/jfs_dmap.c 	if (l2nb > bmp->db_agl2size) {
l2nb             1394 fs/jfs/jfs_dmap.c 		rc = dbAllocCtl(bmp, nblocks, l2nb, blkno, results);
l2nb             1442 fs/jfs/jfs_dmap.c 		if (l2nb > dcp->stree[ti])
l2nb             1451 fs/jfs/jfs_dmap.c 				if (l2nb <= dcp->stree[m + n]) {
l2nb             1487 fs/jfs/jfs_dmap.c 		if (l2nb < budmin) {
l2nb             1494 fs/jfs/jfs_dmap.c 			     dbFindCtl(bmp, l2nb, bmp->db_aglevel - 1,
l2nb             1507 fs/jfs/jfs_dmap.c 		rc = dbAllocCtl(bmp, nblocks, l2nb, blkno, results);
l2nb             1551 fs/jfs/jfs_dmap.c static int dbAllocAny(struct bmap * bmp, s64 nblocks, int l2nb, s64 * results)
l2nb             1562 fs/jfs/jfs_dmap.c 	if ((rc = dbFindCtl(bmp, l2nb, bmp->db_maxlevel, &blkno)))
l2nb             1567 fs/jfs/jfs_dmap.c 	rc = dbAllocCtl(bmp, nblocks, l2nb, blkno, results);
l2nb             1612 fs/jfs/jfs_dmap.c 	int rc, l2nb;
l2nb             1640 fs/jfs/jfs_dmap.c 		l2nb = BLKSTOL2(nblocks);
l2nb             1643 fs/jfs/jfs_dmap.c 		rc = dbAllocAG(bmp, agno, nblocks, l2nb, &blkno);
l2nb             1658 fs/jfs/jfs_dmap.c 			l2nb = BLKSTOL2(nblocks) - 1;
l2nb             1659 fs/jfs/jfs_dmap.c 			nblocks = 1 << l2nb;
l2nb             1714 fs/jfs/jfs_dmap.c static int dbFindCtl(struct bmap * bmp, int l2nb, int level, s64 * blkno)
l2nb             1750 fs/jfs/jfs_dmap.c 		rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx);
l2nb             1778 fs/jfs/jfs_dmap.c 		if (l2nb >= budmin)
l2nb             1833 fs/jfs/jfs_dmap.c dbAllocCtl(struct bmap * bmp, s64 nblocks, int l2nb, s64 blkno, s64 * results)
l2nb             1842 fs/jfs/jfs_dmap.c 	if (l2nb <= L2BPERDMAP) {
l2nb             1853 fs/jfs/jfs_dmap.c 		rc = dbAllocDmapLev(bmp, dp, (int) nblocks, l2nb, results);
l2nb             1985 fs/jfs/jfs_dmap.c 	       struct dmap * dp, int nblocks, int l2nb, s64 * results)
l2nb             1991 fs/jfs/jfs_dmap.c 	assert(l2nb <= L2BPERDMAP);
l2nb             1997 fs/jfs/jfs_dmap.c 	if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx))
l2nb             2010 fs/jfs/jfs_dmap.c 		blkno += dbFindBits(le32_to_cpu(dp->wmap[leafidx]), l2nb);
l2nb             2959 fs/jfs/jfs_dmap.c static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx)
l2nb             2966 fs/jfs/jfs_dmap.c 	if (l2nb > tp->dmt_stree[ROOT])
l2nb             2982 fs/jfs/jfs_dmap.c 			if (l2nb <= tp->dmt_stree[x + n])
l2nb             3017 fs/jfs/jfs_dmap.c static int dbFindBits(u32 word, int l2nb)
l2nb             3024 fs/jfs/jfs_dmap.c 	nb = 1 << l2nb;
l2nb             3149 fs/jfs/jfs_dmap.c 	int l2nb;
l2nb             3156 fs/jfs/jfs_dmap.c 	for (l2nb = 0; l2nb < 64; l2nb++, mask >>= 1) {
l2nb             3162 fs/jfs/jfs_dmap.c 			l2nb = (64 - 1) - l2nb;
l2nb             3167 fs/jfs/jfs_dmap.c 				l2nb++;
l2nb             3169 fs/jfs/jfs_dmap.c 			return (l2nb);