Lines Matching defs:bl_tree
477 struct ct_data_s bl_tree[2*BL_CODES+1];
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_138].Freq++;
2944 * bl_tree.
2968 do { send_code(s, curlen, s->bl_tree); }
2973 send_code(s, curlen, s->bl_tree); count--;
2976 send_code(s, REP_3_6, s->bl_tree);
2980 send_code(s, REPZ_3_10, s->bl_tree);
2984 send_code(s, REPZ_11_138, s->bl_tree);
3031 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
3064 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);