1140 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNext()
1268 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNear()
1455 		if (l2nb > dcp->stree[ti])  in dbAllocAG()
1464 				if (l2nb <= dcp->stree[m + n]) {  in dbAllocAG()
1895 		if (dp->tree.stree[ROOT] != L2BPERDMAP) {  in dbAllocCtl()
2022 	if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN)  in dbAllocDmapLev()
2069 	oldroot = dp->tree.stree[ROOT];  in dbAllocDmap()
2075 	if (dp->tree.stree[ROOT] == oldroot)  in dbAllocDmap()
2082 	if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0)))  in dbAllocDmap()
2124 	oldroot = dp->tree.stree[ROOT];  in dbFreeDmap()
2130 	if (rc || (dp->tree.stree[ROOT] == oldroot))  in dbFreeDmap()
2137 	if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 0, 0))) {  in dbFreeDmap()
2145 		if (dp->tree.stree[word] == NOFREE)  in dbFreeDmap()
2186 	leaf = dp->tree.stree + LEAFIND;  in dbAllocBits()
2541 	oldval = dcp->stree[ti];  in dbAdjCtl()
2542 	oldroot = dcp->stree[ROOT];  in dbAdjCtl()
2567 			oldval = dcp->stree[ti];  in dbAdjCtl()
2583 	if (dcp->stree[ROOT] != oldroot) {  in dbAdjCtl()
2592 			     dbAdjCtl(bmp, blkno, dcp->stree[ROOT], alloc,  in dbAdjCtl()
2608 					if (dcp->stree[ti] == NOFREE)  in dbAdjCtl()
2630 			bmp->db_maxfreebud = dcp->stree[ROOT];  in dbAdjCtl()
3274 	oldroot = tp->stree[ROOT];  in dbAllocDmapBU()
3353 	if (tp->stree[ROOT] == oldroot)  in dbAllocDmapBU()
3360 	if ((rc = dbAdjCtl(bmp, blkno, tp->stree[ROOT], 1, 0)))  in dbAllocDmapBU()
3477 	l2leaf = l2dcp->stree + CTLLEAFIND + k;  in dbExtendFS()
3494 			l1leaf = l1dcp->stree + CTLLEAFIND + j;  in dbExtendFS()
3507 			l1leaf = l1dcp->stree + CTLLEAFIND;  in dbExtendFS()
3527 				l0leaf = l0dcp->stree + CTLLEAFIND + i;  in dbExtendFS()
3541 				l0leaf = l0dcp->stree + CTLLEAFIND;  in dbExtendFS()
3867 	cp = tp->stree + le32_to_cpu(tp->leafidx);  in dbInitDmapTree()
3901 	tp = dtp->stree;  in dbInitTree()
3985 	cp = &dcp->stree[CTLLEAFIND + i];  in dbInitDmapCtl()