Searched refs:stree (Results 1 – 4 of 4) sorted by relevance
1140 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()1268 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()1455 if (l2nb > dcp->stree[ti]) in dbAllocAG()1464 if (l2nb <= dcp->stree[m + n]) { in dbAllocAG()1895 if (dp->tree.stree[ROOT] != L2BPERDMAP) { in dbAllocCtl()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()[all …]
153 s8 stree[TREESIZE]; /* TREESIZE: tree */ member181 s8 stree[CTLTREESIZE]; /* CTLTREESIZE: dmapctl tree */ member199 #define dmt_stree t1.stree
9 super.o prints.o objectid.o lbalance.o ibalance.o stree.o \
414 const ct_data *stree = desc->stat_desc->static_tree; in gen_bitlen() local446 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); in gen_bitlen()544 const ct_data *stree = desc->stat_desc->static_tree; in build_tree() local574 s->opt_len--; if (stree) s->static_len -= stree[node].Len; in build_tree()
