1138 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNext()
1267 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNear()
1456 		if (l2nb > dcp->stree[ti])  in dbAllocAG()
1465 				if (l2nb <= dcp->stree[m + n]) {  in dbAllocAG()
1788 		if (dp->tree.stree[ROOT] != L2BPERDMAP) {  in dbAllocCtl()
1916 	if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN)  in dbAllocDmapLev()
1963 	oldroot = dp->tree.stree[ROOT];  in dbAllocDmap()
1969 	if (dp->tree.stree[ROOT] == oldroot)  in dbAllocDmap()
1976 	if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0)))  in dbAllocDmap()
2018 	oldroot = dp->tree.stree[ROOT];  in dbFreeDmap()
2024 	if (rc || (dp->tree.stree[ROOT] == oldroot))  in dbFreeDmap()
2031 	if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 0, 0))) {  in dbFreeDmap()
2039 		if (dp->tree.stree[word] == NOFREE)  in dbFreeDmap()
2080 	leaf = dp->tree.stree + LEAFIND;  in dbAllocBits()
2436 	oldval = dcp->stree[ti];  in dbAdjCtl()
2437 	oldroot = dcp->stree[ROOT];  in dbAdjCtl()
2462 			oldval = dcp->stree[ti];  in dbAdjCtl()
2478 	if (dcp->stree[ROOT] != oldroot) {  in dbAdjCtl()
2487 			     dbAdjCtl(bmp, blkno, dcp->stree[ROOT], alloc,  in dbAdjCtl()
2503 					if (dcp->stree[ti] == NOFREE)  in dbAdjCtl()
2526 			bmp->db_maxfreebud = dcp->stree[ROOT];  in dbAdjCtl()
3170 	oldroot = tp->stree[ROOT];  in dbAllocDmapBU()
3249 	if (tp->stree[ROOT] == oldroot)  in dbAllocDmapBU()
3256 	if ((rc = dbAdjCtl(bmp, blkno, tp->stree[ROOT], 1, 0)))  in dbAllocDmapBU()
3373 	l2leaf = l2dcp->stree + CTLLEAFIND + k;  in dbExtendFS()
3390 			l1leaf = l1dcp->stree + CTLLEAFIND + j;  in dbExtendFS()
3403 			l1leaf = l1dcp->stree + CTLLEAFIND;  in dbExtendFS()
3423 				l0leaf = l0dcp->stree + CTLLEAFIND + i;  in dbExtendFS()
3437 				l0leaf = l0dcp->stree + CTLLEAFIND;  in dbExtendFS()
3764 	cp = tp->stree + le32_to_cpu(tp->leafidx);  in dbInitDmapTree()
3798 	tp = dtp->stree;  in dbInitTree()
3882 	cp = &dcp->stree[CTLLEAFIND + i];  in dbInitDmapCtl()