Lines Matching refs:bl_tree
453 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
1180 ds->bl_desc.dyn_tree = ds->bl_tree; in deflateCopy()
2144 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()
2169 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
2439 if (tree == s->bl_tree) { in build_tree()
2488 s->bl_tree[curlen].Freq += count; in scan_tree()
2490 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
2491 s->bl_tree[REP_3_6].Freq++; in scan_tree()
2493 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
2495 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
2535 do { send_code(s, curlen, s->bl_tree); } while (--count != 0); in send_tree()
2539 send_code(s, curlen, s->bl_tree); count--; in send_tree()
2542 send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2); in send_tree()
2545 send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3); in send_tree()
2548 send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7); in send_tree()
2585 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; in build_bl_tree()
2617 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); in send_all_trees()