1067 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNext()
1195 	leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);  in dbAllocNear()
1382 		if (l2nb > dcp->stree[ti])  in dbAllocAG()
1391 				if (l2nb <= dcp->stree[m + n]) {  in dbAllocAG()
1822 		if (dp->tree.stree[ROOT] != L2BPERDMAP) {  in dbAllocCtl()
1949 	if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN)  in dbAllocDmapLev()
1996 	oldroot = dp->tree.stree[ROOT];  in dbAllocDmap()
2002 	if (dp->tree.stree[ROOT] == oldroot)  in dbAllocDmap()
2009 	if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0)))  in dbAllocDmap()
2051 	oldroot = dp->tree.stree[ROOT];  in dbFreeDmap()
2057 	if (rc || (dp->tree.stree[ROOT] == oldroot))  in dbFreeDmap()
2064 	if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 0, 0))) {  in dbFreeDmap()
2072 		if (dp->tree.stree[word] == NOFREE)  in dbFreeDmap()
2113 	leaf = dp->tree.stree + LEAFIND;  in dbAllocBits()
2468 	oldval = dcp->stree[ti];  in dbAdjCtl()
2469 	oldroot = dcp->stree[ROOT];  in dbAdjCtl()
2496 			oldval = dcp->stree[ti];  in dbAdjCtl()
2514 	if (dcp->stree[ROOT] != oldroot) {  in dbAdjCtl()
2523 			     dbAdjCtl(bmp, blkno, dcp->stree[ROOT], alloc,  in dbAdjCtl()
2539 					if (dcp->stree[ti] == NOFREE)  in dbAdjCtl()
2561 			bmp->db_maxfreebud = dcp->stree[ROOT];  in dbAdjCtl()
3205 	oldroot = tp->stree[ROOT];  in dbAllocDmapBU()
3284 	if (tp->stree[ROOT] == oldroot)  in dbAllocDmapBU()
3291 	if ((rc = dbAdjCtl(bmp, blkno, tp->stree[ROOT], 1, 0)))  in dbAllocDmapBU()
3408 	l2leaf = l2dcp->stree + CTLLEAFIND + k;  in dbExtendFS()
3425 			l1leaf = l1dcp->stree + CTLLEAFIND + j;  in dbExtendFS()
3438 			l1leaf = l1dcp->stree + CTLLEAFIND;  in dbExtendFS()
3458 				l0leaf = l0dcp->stree + CTLLEAFIND + i;  in dbExtendFS()
3472 				l0leaf = l0dcp->stree + CTLLEAFIND;  in dbExtendFS()
3798 	cp = tp->stree + le32_to_cpu(tp->leafidx);  in dbInitDmapTree()
3832 	tp = dtp->stree;  in dbInitTree()
3916 	cp = &dcp->stree[CTLLEAFIND + i];  in dbInitDmapCtl()