Searched defs:bl_tree (Results 1 - 4 of 4) sorted by relevance

/illumos-gate/usr/src/uts/common/zmod/
H A Ddeflate.h194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member in struct:internal_state
/illumos-gate/usr/src/boot/lib/libz/
H A Ddeflate.h197 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member in struct:internal_state
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member in struct:deflate_state
1751 s->bl_desc.dyn_tree = s->bl_tree;
1777 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2038 if (tree == s->bl_tree) {
2085 s->bl_tree[curlen].Freq += count;
2087 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2088 s->bl_tree[REP_3_6].Freq++;
2090 s->bl_tree[REPZ_3_10].Freq++;
2092 s->bl_tree[REPZ_11_138].Freq++;
2107 * bl_tree
[all...]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c477 struct ct_data_s bl_tree[2*BL_CODES+1]; member in struct:deflate_state
1354 ds->bl_desc.dyn_tree = ds->bl_tree;
2552 s->bl_desc.dyn_tree = s->bl_tree;
2580 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2870 if (tree == s->bl_tree) {
2921 s->bl_tree[curlen].Freq += count;
2923 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2924 s->bl_tree[REP_3_6].Freq++;
2926 s->bl_tree[REPZ_3_10].Freq++;
2928 s->bl_tree[REPZ_11_13
[all...]

Completed in 80 milliseconds