Searched refs:bl_tree (Results 1 – 7 of 7) 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++;777 send_code(s, curlen, s->bl_tree); count--;823 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;[all …]
194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
949 ds->bl_desc.dyn_tree = ds->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++;773 send_code(s, curlen, s->bl_tree); count--;819 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;[all …]
200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
1151 ds->bl_desc.dyn_tree = ds->bl_tree;
1193 ds->bl_desc.dyn_tree = ds->bl_tree;2159 s->bl_desc.dyn_tree = s->bl_tree;2184 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;2445 if (tree == s->bl_tree) {2492 s->bl_tree[curlen].Freq += count;2494 if (curlen != prevlen) s->bl_tree[curlen].Freq++;2495 s->bl_tree[REP_3_6].Freq++;2497 s->bl_tree[REPZ_3_10].Freq++;2499 s->bl_tree[REPZ_11_138].Freq++;2541 send_code(s, curlen, s->bl_tree); count--;[all …]