Searched refs:bl_tree (Results 1 – 2 of 2) sorted by relevance
255 s->bl_desc.dyn_tree = s->bl_tree; in zlib_tr_init()281 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()546 if (tree == s->bl_tree) { in build_tree()594 s->bl_tree[curlen].Freq += count; in scan_tree()596 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()597 s->bl_tree[REP_3_6].Freq++; in scan_tree()599 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()601 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()644 send_code(s, curlen, s->bl_tree); count--; in send_tree()691 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; in build_bl_tree()[all …]
172 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
Completed in 8 milliseconds