Lines Matching refs:bl_tree
390 s->bl_desc.dyn_tree = s->bl_tree;
415 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
677 if (tree == s->bl_tree) {
724 s->bl_tree[curlen].Freq += count;
726 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
727 s->bl_tree[REP_3_6].Freq++;
729 s->bl_tree[REPZ_3_10].Freq++;
731 s->bl_tree[REPZ_11_138].Freq++;
746 * bl_tree.
769 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
773 send_code(s, curlen, s->bl_tree); count--;
776 send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
779 send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
782 send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
819 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
849 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
