Lines Matching refs:stree
1097 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1225 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1412 if (l2nb > dcp->stree[ti])
1421 if (l2nb <= dcp->stree[m + n]) {
1428 "failed descending stree\n");
1852 if (dp->tree.stree[ROOT] != L2BPERDMAP) {
1982 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN)
2029 oldroot = dp->tree.stree[ROOT];
2035 if (dp->tree.stree[ROOT] == oldroot)
2042 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0)))
2084 oldroot = dp->tree.stree[ROOT];
2090 if (rc || (dp->tree.stree[ROOT] == oldroot))
2097 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 0, 0))) {
2105 if (dp->tree.stree[word] == NOFREE)
2146 leaf = dp->tree.stree + LEAFIND;
2501 oldval = dcp->stree[ti];
2502 oldroot = dcp->stree[ROOT];
2529 oldval = dcp->stree[ti];
2547 if (dcp->stree[ROOT] != oldroot) {
2556 dbAdjCtl(bmp, blkno, dcp->stree[ROOT], alloc,
2572 if (dcp->stree[ti] == NOFREE)
2594 bmp->db_maxfreebud = dcp->stree[ROOT];
3249 oldroot = tp->stree[ROOT];
3328 if (tp->stree[ROOT] == oldroot)
3335 if ((rc = dbAdjCtl(bmp, blkno, tp->stree[ROOT], 1, 0)))
3452 l2leaf = l2dcp->stree + CTLLEAFIND + k;
3469 l1leaf = l1dcp->stree + CTLLEAFIND + j;
3482 l1leaf = l1dcp->stree + CTLLEAFIND;
3502 l0leaf = l0dcp->stree + CTLLEAFIND + i;
3516 l0leaf = l0dcp->stree + CTLLEAFIND;
3842 cp = tp->stree + le32_to_cpu(tp->leafidx);
3876 tp = dtp->stree;
3960 cp = &dcp->stree[CTLLEAFIND + i];