Searched refs:stree (Results 1 – 4 of 4) sorted by relevance
1082 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()1210 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()1397 if (l2nb > dcp->stree[ti]) in dbAllocAG()1406 if (l2nb <= dcp->stree[m + n]) { in dbAllocAG()1837 if (dp->tree.stree[ROOT] != L2BPERDMAP) { in dbAllocCtl()1964 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) in dbAllocDmapLev()2011 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()2017 if (dp->tree.stree[ROOT] == oldroot) in dbAllocDmap()2024 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0))) in dbAllocDmap()2066 oldroot = dp->tree.stree[ROOT]; in dbFreeDmap()[all …]
140 s8 stree[TREESIZE]; /* TREESIZE: tree */ member168 s8 stree[CTLTREESIZE]; /* CTLTREESIZE: dmapctl tree */ member186 #define dmt_stree t2.stree
360 const ct_data *stree = desc->stat_desc->static_tree; in gen_bitlen() local392 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); in gen_bitlen()490 const ct_data *stree = desc->stat_desc->static_tree; in build_tree() local520 s->opt_len--; if (stree) s->static_len -= stree[node].Len; in build_tree()
9 super.o prints.o objectid.o lbalance.o ibalance.o stree.o \