Lines Matching defs:bl_tree
315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
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.
2130 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
2134 send_code(s, curlen, s->bl_tree); count--;
2137 send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
2140 send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
2143 send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
2180 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
2210 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);