Searched refs:stree (Results 1 – 6 of 6) sorted by relevance
1412 if (l2nb > dcp->stree[ti]) in dbAllocAG()2029 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()2084 oldroot = dp->tree.stree[ROOT]; in dbFreeDmap()2146 leaf = dp->tree.stree + LEAFIND; in dbAllocBits()2501 oldval = dcp->stree[ti]; in dbAdjCtl()2502 oldroot = dcp->stree[ROOT]; in dbAdjCtl()2529 oldval = dcp->stree[ti]; in dbAdjCtl()2572 if (dcp->stree[ti] == NOFREE) in dbAdjCtl()3249 oldroot = tp->stree[ROOT]; in dbAllocDmapBU()3328 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
9 super.o prints.o objectid.o lbalance.o ibalance.o stree.o \
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()
500 const ct_data *stree = desc->stat_desc->static_tree; local532 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);628 const ct_data *stree = desc->stat_desc->static_tree; local658 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
1578 stree = build_size_tree(toppat.pats, 8, 0, 0)1579 prop_size(stree)1647 stree.output_code(4, 0, 0, 0)