150 #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
156        send_bits(s, tree[c].Code, tree[c].Len); }
220     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
221     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;  in tr_static_init()
222     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;  in tr_static_init()
223     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
232         static_dtree[n].Len = 5;  in tr_static_init()
376     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */  in gen_bitlen()
380         bits = tree[tree[n].Dad].Len + 1;  in gen_bitlen()
382         tree[n].Len = (ush)bits;  in gen_bitlen()
392         if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);  in gen_bitlen()
422             if (tree[m].Len != (unsigned) bits) {  in gen_bitlen()
423                 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));  in gen_bitlen()
424                 s->opt_len += ((long)bits - (long)tree[m].Len)  in gen_bitlen()
426                 tree[m].Len = (ush)bits;  in gen_bitlen()
466         int len = tree[n].Len;  in gen_codes()
507             tree[n].Len = 0;  in build_tree()
520         s->opt_len--; if (stree) s->static_len -= stree[node].Len;  in build_tree()
581     int nextlen = tree[0].Len; /* length of next code */  in scan_tree()
587     tree[max_code+1].Len = (ush)0xffff; /* guard */  in scan_tree()
590         curlen = nextlen; nextlen = tree[n+1].Len;  in scan_tree()
627     int nextlen = tree[0].Len; /* length of next code */  in send_tree()
636         curlen = nextlen; nextlen = tree[n+1].Len;  in send_tree()
691         if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;  in build_bl_tree()
724         send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);  in send_all_trees()
1009     s->last_eob_len = ltree[END_BLOCK].Len;