Lines Matching defs:leafidx
90 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl);
1090 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) {
1097 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1220 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) {
1225 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1386 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1445 ((s64) (ti - le32_to_cpu(dcp->leafidx))) << budmin;
1686 int rc, leafidx, lev;
1708 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1720 rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx, true);
1741 b += (((s64) leafidx) << budmin);
1958 int leafidx, rc;
1967 if (dbFindLeaf((dmtree_t *) &dp->tree, l2nb, &leafidx, false))
1970 if (leafidx < 0)
1976 blkno = le64_to_cpu(dp->start) + (leafidx << L2DBWORD);
1982 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN)
1983 blkno += dbFindBits(le32_to_cpu(dp->wmap[leafidx]), l2nb);
2486 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
2496 ti = leafno + le32_to_cpu(dcp->leafidx);
2933 * leafidx - return pointer to be set to the index of the leaf
2942 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl)
2983 *leafidx = x + n - le32_to_cpu(tp->dmt_leafidx);
3834 tp->leafidx = cpu_to_le32(LEAFIND);
3842 cp = tp->stree + le32_to_cpu(tp->leafidx);
3901 for (i = 0, cp = tp + le32_to_cpu(dtp->leafidx);
3922 for (child = le32_to_cpu(dtp->leafidx),
3951 dcp->leafidx = cpu_to_le32(CTLLEAFIND);