Searched refs:bl_tree (Results 1 – 6 of 6) sorted by relevance
393 s->bl_desc.dyn_tree = s->bl_tree;419 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;681 if (tree == s->bl_tree) {728 s->bl_tree[curlen].Freq += count;730 if (curlen != prevlen) s->bl_tree[curlen].Freq++;731 s->bl_tree[REP_3_6].Freq++;733 s->bl_tree[REPZ_3_10].Freq++;735 s->bl_tree[REPZ_11_138].Freq++;773 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);777 send_code(s, curlen, s->bl_tree); count--;[all …]
194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
943 ds->bl_desc.dyn_tree = ds->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++;771 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);775 send_code(s, curlen, s->bl_tree); count--;[all …]
197 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
1063 ds->bl_desc.dyn_tree = ds->bl_tree;