Lines Matching refs:stree
1165 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1293 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1480 if (l2nb > dcp->stree[ti])
1489 if (l2nb <= dcp->stree[m + n]) {
1496 "failed descending stree\n");
1920 if (dp->tree.stree[ROOT] != L2BPERDMAP) {
2050 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN)
2097 oldroot = dp->tree.stree[ROOT];
2103 if (dp->tree.stree[ROOT] == oldroot)
2110 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0)))
2152 oldroot = dp->tree.stree[ROOT];
2158 if (rc || (dp->tree.stree[ROOT] == oldroot))
2165 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 0, 0))) {
2173 if (dp->tree.stree[word] == NOFREE)
2214 leaf = dp->tree.stree + LEAFIND;
2569 oldval = dcp->stree[ti];
2570 oldroot = dcp->stree[ROOT];
2595 oldval = dcp->stree[ti];
2611 if (dcp->stree[ROOT] != oldroot) {
2620 dbAdjCtl(bmp, blkno, dcp->stree[ROOT], alloc,
2636 if (dcp->stree[ti] == NOFREE)
2658 bmp->db_maxfreebud = dcp->stree[ROOT];
3313 oldroot = tp->stree[ROOT];
3392 if (tp->stree[ROOT] == oldroot)
3399 if ((rc = dbAdjCtl(bmp, blkno, tp->stree[ROOT], 1, 0)))
3516 l2leaf = l2dcp->stree + CTLLEAFIND + k;
3533 l1leaf = l1dcp->stree + CTLLEAFIND + j;
3546 l1leaf = l1dcp->stree + CTLLEAFIND;
3566 l0leaf = l0dcp->stree + CTLLEAFIND + i;
3580 l0leaf = l0dcp->stree + CTLLEAFIND;
3906 cp = tp->stree + le32_to_cpu(tp->leafidx);
3940 tp = dtp->stree;
4024 cp = &dcp->stree[CTLLEAFIND + i];