Searched refs:bl_tree (Results 1 – 6 of 6) sorted by relevance
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++;769 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);773 send_code(s, curlen, s->bl_tree); count--;[all …]
198 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
1189 ds->bl_desc.dyn_tree = ds->bl_tree;
315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member1751 s->bl_desc.dyn_tree = s->bl_tree;1777 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;2038 if (tree == s->bl_tree) {2085 s->bl_tree[curlen].Freq += count;2087 if (curlen != prevlen) s->bl_tree[curlen].Freq++;2088 s->bl_tree[REP_3_6].Freq++;2090 s->bl_tree[REPZ_3_10].Freq++;2092 s->bl_tree[REPZ_11_138].Freq++;2130 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);[all …]
475 struct ct_data_s bl_tree[2*BL_CODES+1]; member1352 ds->bl_desc.dyn_tree = ds->bl_tree;2550 s->bl_desc.dyn_tree = s->bl_tree;2578 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;2868 if (tree == s->bl_tree) {2919 s->bl_tree[curlen].Freq += count;2921 if (curlen != prevlen) s->bl_tree[curlen].Freq++;2922 s->bl_tree[REP_3_6].Freq++;2924 s->bl_tree[REPZ_3_10].Freq++;2926 s->bl_tree[REPZ_11_138].Freq++;[all …]
1404 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member