Searched refs:stree (Results 1 – 3 of 3) sorted by relevance
1397 if (l2nb > dcp->stree[ti]) in dbAllocAG()2019 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()2074 oldroot = dp->tree.stree[ROOT]; in dbFreeDmap()2136 leaf = dp->tree.stree + LEAFIND; in dbAllocBits()2491 oldval = dcp->stree[ti]; in dbAdjCtl()2492 oldroot = dcp->stree[ROOT]; in dbAdjCtl()2519 oldval = dcp->stree[ti]; in dbAdjCtl()2562 if (dcp->stree[ti] == NOFREE) in dbAdjCtl()3245 oldroot = tp->stree[ROOT]; in dbAllocDmapBU()3324 if (tp->stree[ROOT] == oldroot) in dbAllocDmapBU()[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()