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