103 static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx);
1133 	if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) {  in dbAllocNext()
1140 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNext()
1263 	if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) {  in dbAllocNear()
1268 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNear()
1429 	if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {  in dbAllocAG()
1488 		    ((s64) (ti - le32_to_cpu(dcp->leafidx))) << budmin;  in dbAllocAG()
1729 	int rc, leafidx, lev;  in dbFindCtl()  local
1751 		if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {  in dbFindCtl()
1763 		rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx);  in dbFindCtl()
1784 		b += (((s64) leafidx) << budmin);  in dbFindCtl()
2001 	int leafidx, rc;  in dbAllocDmapLev()  local
2010 	if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx))  in dbAllocDmapLev()
2016 	blkno = le64_to_cpu(dp->start) + (leafidx << L2DBWORD);  in dbAllocDmapLev()
2022 	if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN)  in dbAllocDmapLev()
2023 		blkno += dbFindBits(le32_to_cpu(dp->wmap[leafidx]), l2nb);  in dbAllocDmapLev()
2526 	if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {  in dbAdjCtl()
2536 	ti = leafno + le32_to_cpu(dcp->leafidx);  in dbAdjCtl()
2972 static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx)  in dbFindLeaf()  argument
3008 	*leafidx = x + n - le32_to_cpu(tp->dmt_leafidx);  in dbFindLeaf()
3859 	tp->leafidx = cpu_to_le32(LEAFIND);  in dbInitDmapTree()
3867 	cp = tp->stree + le32_to_cpu(tp->leafidx);  in dbInitDmapTree()
3926 		for (i = 0, cp = tp + le32_to_cpu(dtp->leafidx);  in dbInitTree()
3947 	for (child = le32_to_cpu(dtp->leafidx),  in dbInitTree()
3976 	dcp->leafidx = cpu_to_le32(CTLLEAFIND);  in dbInitDmapCtl()