85 static int dbAllocAny(struct bmap * bmp, s64 nblocks, int l2nb, s64 * results);
90 		       int l2nb, s64 * results);
94 			  int l2nb,
96 static int dbAllocAG(struct bmap * bmp, int agno, s64 nblocks, int l2nb,
98 static int dbAllocCtl(struct bmap * bmp, s64 nblocks, int l2nb, s64 blkno,
101 static int dbFindBits(u32 word, int l2nb);
102 static int dbFindCtl(struct bmap * bmp, int l2nb, int level, s64 * blkno);
103 static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx);
739 	int l2nb;  in dbAlloc()  local
750 	l2nb = BLKSTOL2(nblocks);  in dbAlloc()
765 	if (l2nb > bmp->db_agl2size) {  in dbAlloc()
768 		rc = dbAllocAny(bmp, nblocks, l2nb, results);  in dbAlloc()
849 		     dbAllocNear(bmp, dp, blkno, (int) nblocks, l2nb, results))  in dbAlloc()
861 		if ((rc = dbAllocDmapLev(bmp, dp, (int) nblocks, l2nb, results))  in dbAlloc()
878 	if ((rc = dbAllocAG(bmp, agno, nblocks, l2nb, results)) != -ENOSPC)  in dbAlloc()
894 	if ((rc = dbAllocAG(bmp, agno, nblocks, l2nb, results)) == -ENOSPC)  in dbAlloc()
895 		rc = dbAllocAny(bmp, nblocks, l2nb, results);  in dbAlloc()
1289 	    struct dmap * dp, s64 blkno, int nblocks, int l2nb, s64 * results)  in dbAllocNear()  argument
1313 		if (leaf[word] < l2nb)  in dbAllocNear()
1328 			    dbFindBits(le32_to_cpu(dp->wmap[word]), l2nb);  in dbAllocNear()
1397 dbAllocAG(struct bmap * bmp, int agno, s64 nblocks, int l2nb, s64 * results)  in dbAllocAG()  argument
1408 	if (l2nb > bmp->db_agl2size) {  in dbAllocAG()
1438 		rc = dbAllocCtl(bmp, nblocks, l2nb, blkno, results);  in dbAllocAG()
1486 		if (l2nb > dcp->stree[ti])  in dbAllocAG()
1495 				if (l2nb <= dcp->stree[m + n]) {  in dbAllocAG()
1531 		if (l2nb < budmin) {  in dbAllocAG()
1538 			     dbFindCtl(bmp, l2nb, bmp->db_aglevel - 1,  in dbAllocAG()
1551 		rc = dbAllocCtl(bmp, nblocks, l2nb, blkno, results);  in dbAllocAG()
1595 static int dbAllocAny(struct bmap * bmp, s64 nblocks, int l2nb, s64 * results)  in dbAllocAny()  argument
1606 	if ((rc = dbFindCtl(bmp, l2nb, bmp->db_maxlevel, &blkno)))  in dbAllocAny()
1611 	rc = dbAllocCtl(bmp, nblocks, l2nb, blkno, results);  in dbAllocAny()
1656 	int rc, l2nb;  in dbDiscardAG()  local
1684 		l2nb = BLKSTOL2(nblocks);  in dbDiscardAG()
1687 		rc = dbAllocAG(bmp, agno, nblocks, l2nb, &blkno);  in dbDiscardAG()
1702 			l2nb = BLKSTOL2(nblocks) - 1;  in dbDiscardAG()
1703 			nblocks = 1LL << l2nb;  in dbDiscardAG()
1758 static int dbFindCtl(struct bmap * bmp, int l2nb, int level, s64 * blkno)  in dbFindCtl()  argument
1794 		rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx);  in dbFindCtl()
1822 		if (l2nb >= budmin)  in dbFindCtl()
1877 dbAllocCtl(struct bmap * bmp, s64 nblocks, int l2nb, s64 blkno, s64 * results)  in dbAllocCtl()  argument
1886 	if (l2nb <= L2BPERDMAP) {  in dbAllocCtl()
1897 		rc = dbAllocDmapLev(bmp, dp, (int) nblocks, l2nb, results);  in dbAllocCtl()
2029 	       struct dmap * dp, int nblocks, int l2nb, s64 * results)  in dbAllocDmapLev()  argument
2035 	assert(l2nb <= L2BPERDMAP);  in dbAllocDmapLev()
2041 	if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx))  in dbAllocDmapLev()
2057 		blkno += dbFindBits(le32_to_cpu(dp->wmap[leafidx]), l2nb);  in dbAllocDmapLev()
3006 static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx)  in dbFindLeaf()  argument
3013 	if (l2nb > tp->dmt_stree[ROOT])  in dbFindLeaf()
3029 			if (l2nb <= tp->dmt_stree[x + n])  in dbFindLeaf()
3064 static int dbFindBits(u32 word, int l2nb)  in dbFindBits()  argument
3071 	nb = 1 << l2nb;  in dbFindBits()
3196 	int l2nb;  in blkstol2()  local
3203 	for (l2nb = 0; l2nb < 64; l2nb++, mask >>= 1) {  in blkstol2()
3209 			l2nb = (64 - 1) - l2nb;  in blkstol2()
3214 				l2nb++;  in blkstol2()
3216 			return (l2nb);  in blkstol2()