Searched refs:bl_tree (Results 1 – 3 of 3) sorted by relevance
446 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()465 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()686 if (tree == s->bl_tree) { in build_tree()729 s->bl_tree[curlen].Freq += (ush)count; in scan_tree()731 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()732 s->bl_tree[REP_3_6].Freq++; in scan_tree()734 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()736 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()770 do { send_code(s, curlen, s->bl_tree); } while (--count != 0); in send_tree()774 send_code(s, curlen, s->bl_tree); count--; in send_tree()[all …]
204 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
1373 ds->bl_desc.dyn_tree = ds->bl_tree; in deflateCopy()