Lines Matching refs:tree
1133 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNext()
1140 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1263 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNear()
1268 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1895 if (dp->tree.stree[ROOT] != L2BPERDMAP) { in dbAllocCtl()
2010 if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx)) in dbAllocDmapLev()
2022 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) in dbAllocDmapLev()
2069 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()
2075 if (dp->tree.stree[ROOT] == oldroot) in dbAllocDmap()
2082 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0))) in dbAllocDmap()
2124 oldroot = dp->tree.stree[ROOT]; in dbFreeDmap()
2130 if (rc || (dp->tree.stree[ROOT] == oldroot)) in dbFreeDmap()
2137 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 0, 0))) { in dbFreeDmap()
2145 if (dp->tree.stree[word] == NOFREE) in dbFreeDmap()
2146 dbBackSplit((dmtree_t *) & dp->tree, word); in dbFreeDmap()
2181 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbAllocBits()
2186 leaf = dp->tree.stree + LEAFIND; in dbAllocBits()
2328 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbFreeBits()
3269 struct dmaptree *tp = (struct dmaptree *) & dp->tree; in dbAllocDmapBU()
3856 tp = &dp->tree; in dbInitDmapTree()