Lines Matching defs:leafidx
90 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl);
1158 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) {
1165 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1288 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) {
1293 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1454 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1513 ((s64) (ti - le32_to_cpu(dcp->leafidx))) << budmin;
1754 int rc, leafidx, lev;
1776 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
1788 rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx, true);
1809 b += (((s64) leafidx) << budmin);
2026 int leafidx, rc;
2035 if (dbFindLeaf((dmtree_t *) &dp->tree, l2nb, &leafidx, false))
2038 if (leafidx < 0)
2044 blkno = le64_to_cpu(dp->start) + (leafidx << L2DBWORD);
2050 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN)
2051 blkno += dbFindBits(le32_to_cpu(dp->wmap[leafidx]), l2nb);
2554 if (dcp->leafidx != cpu_to_le32(CTLLEAFIND)) {
2564 ti = leafno + le32_to_cpu(dcp->leafidx);
2997 * leafidx - return pointer to be set to the index of the leaf
3006 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl)
3047 *leafidx = x + n - le32_to_cpu(tp->dmt_leafidx);
3898 tp->leafidx = cpu_to_le32(LEAFIND);
3906 cp = tp->stree + le32_to_cpu(tp->leafidx);
3965 for (i = 0, cp = tp + le32_to_cpu(dtp->leafidx);
3986 for (child = le32_to_cpu(dtp->leafidx),
4015 dcp->leafidx = cpu_to_le32(CTLLEAFIND);