Lines Matching refs:bl_tree
392 s->bl_desc.dyn_tree = s->bl_tree;
417 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
679 if (tree == s->bl_tree) {
726 s->bl_tree[curlen].Freq += count;
728 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
729 s->bl_tree[REP_3_6].Freq++;
731 s->bl_tree[REPZ_3_10].Freq++;
733 s->bl_tree[REPZ_11_138].Freq++;
748 * bl_tree.
771 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
775 send_code(s, curlen, s->bl_tree); count--;
778 send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
781 send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
784 send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
821 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
851 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);