Searched refs:bl_tree (Results 1 – 3 of 3) sorted by relevance
424 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()450 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()720 if (tree == s->bl_tree) { in build_tree()771 s->bl_tree[curlen].Freq += count; in scan_tree()773 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()774 s->bl_tree[REP_3_6].Freq++; in scan_tree()776 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()778 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()827 send_code(s, curlen, s->bl_tree); count--; in send_tree()876 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; in build_bl_tree()[all …]
223 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
970 ds->bl_desc.dyn_tree = ds->bl_tree; in deflateCopy()