Lines Matching defs:bl_tree
253 local ct_data near bl_tree[2*BL_CODES+1];
273 {bl_tree, NULL, extra_blbits, 0, BL_CODES, MAX_BL_BITS, 0};
566 for (n = 0; n < BL_CODES; n++) bl_tree[n].Freq = 0;
824 if (tree == bl_tree) {
850 * during the construction of bl_tree.)
872 bl_tree[curlen].Freq += (ush)count;
874 if (curlen != prevlen) bl_tree[curlen].Freq++;
875 bl_tree[REP_3_6].Freq++;
877 bl_tree[REPZ_3_10].Freq++;
879 bl_tree[REPZ_11_138].Freq++;
894 * bl_tree.
916 do { send_code(curlen, bl_tree); } while (--count != 0);
920 send_code(curlen, bl_tree); count--;
923 send_code(REP_3_6, bl_tree); send_bits(count-3, 2);
926 send_code(REPZ_3_10, bl_tree); send_bits(count-3, 3);
929 send_code(REPZ_11_138, bl_tree); send_bits(count-11, 7);
965 if (bl_tree[bl_order[max_blindex]].Len != 0) break;
994 send_bits(bl_tree[bl_order[rank]].Len, 3);