Lines Matching refs:tree
1079 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNext()
1086 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1209 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNear()
1214 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1818 if (dp->tree.budmin < 0) { in dbAllocCtl()
1854 if (dp->tree.stree[ROOT] != L2BPERDMAP) { in dbAllocCtl()
1969 if (dbFindLeaf((dmtree_t *) &dp->tree, l2nb, &leafidx, false)) in dbAllocDmapLev()
1984 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) in dbAllocDmapLev()
2031 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()
2037 if (dp->tree.stree[ROOT] == oldroot) in dbAllocDmap()
2044 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0))) in dbAllocDmap()
2086 oldroot = dp->tree.stree[ROOT]; in dbFreeDmap()
2092 if (rc || (dp->tree.stree[ROOT] == oldroot)) in dbFreeDmap()
2099 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 0, 0))) { in dbFreeDmap()
2107 if (dp->tree.stree[word] == NOFREE) in dbFreeDmap()
2108 dbBackSplit((dmtree_t *)&dp->tree, word, false); in dbFreeDmap()
2143 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbAllocBits()
2148 leaf = dp->tree.stree + LEAFIND; in dbAllocBits()
2290 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbFreeBits()
3252 struct dmaptree *tp = (struct dmaptree *) & dp->tree; in dbAllocDmapBU()
3839 tp = &dp->tree; in dbInitDmapTree()