90 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl);
1090 	if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) {  in dbAllocNext()
1097 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNext()
1220 	if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) {  in dbAllocNear()
1225 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNear()
1386 	if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {  in dbAllocAG()
1445 		    ((s64) (ti - le32_to_cpu(dcp->leafidx))) << budmin;  in dbAllocAG()
1688 	int rc, leafidx, lev;  in dbFindCtl()  local
1710 		if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {  in dbFindCtl()
1722 		rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx, true);  in dbFindCtl()
1743 		b += (((s64) leafidx) << budmin);  in dbFindCtl()
1963 	int leafidx, rc;  in dbAllocDmapLev()  local
1972 	if (dbFindLeaf((dmtree_t *) &dp->tree, l2nb, &leafidx, false))  in dbAllocDmapLev()
1975 	if (leafidx < 0)  in dbAllocDmapLev()
1981 	blkno = le64_to_cpu(dp->start) + (leafidx << L2DBWORD);  in dbAllocDmapLev()
1987 	if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN)  in dbAllocDmapLev()
1988 		blkno += dbFindBits(le32_to_cpu(dp->wmap[leafidx]), l2nb);  in dbAllocDmapLev()
2491 	if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {  in dbAdjCtl()
2501 	ti = leafno + le32_to_cpu(dcp->leafidx);  in dbAdjCtl()
2950 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl)  in dbFindLeaf()  argument
2994 	*leafidx = x + n - le32_to_cpu(tp->dmt_leafidx);  in dbFindLeaf()
3845 	tp->leafidx = cpu_to_le32(LEAFIND);  in dbInitDmapTree()
3853 	cp = tp->stree + le32_to_cpu(tp->leafidx);  in dbInitDmapTree()
3912 		for (i = 0, cp = tp + le32_to_cpu(dtp->leafidx);  in dbInitTree()
3933 	for (child = le32_to_cpu(dtp->leafidx),  in dbInitTree()
3962 	dcp->leafidx = cpu_to_le32(CTLLEAFIND);  in dbInitDmapCtl()