467     struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */  member
1261     ds->bl_desc.dyn_tree = ds->bl_tree;
2490     s->bl_desc.dyn_tree = s->bl_tree;  in _tr_init()
2515     for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;  in init_block()
2772         if (tree == s->bl_tree) {  in build_tree()
2818             s->bl_tree[curlen].Freq += count;  in scan_tree()
2820             if (curlen != prevlen) s->bl_tree[curlen].Freq++;  in scan_tree()
2821             s->bl_tree[REP_3_6].Freq++;  in scan_tree()
2823             s->bl_tree[REPZ_3_10].Freq++;  in scan_tree()
2825             s->bl_tree[REPZ_11_138].Freq++;  in scan_tree()
2862             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);  in send_tree()
2866                 send_code(s, curlen, s->bl_tree); count--;  in send_tree()
2869             send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);  in send_tree()
2872             send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);  in send_tree()
2875             send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);  in send_tree()
2911         if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;  in build_bl_tree()
2940         send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);  in send_all_trees()