223         int len = tree[n].Len;  in gen_codes()
238 #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
244        send_bits(s, tree[c].Code, tree[c].Len); }
352     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
353     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;  in tr_static_init()
354     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;  in tr_static_init()
355     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
364         static_dtree[n].Len = 5;  in tr_static_init()
398                 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));  in gen_trees_header()
404                 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));  in gen_trees_header()
557     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */  in gen_bitlen()
561         bits = tree[tree[n].Dad].Len + 1;  in gen_bitlen()
563         tree[n].Len = (ush)bits;  in gen_bitlen()
573         if (stree) s->static_len += (ulg)f * (unsigned)(stree[n].Len + xbits);  in gen_bitlen()
603             if ((unsigned) tree[m].Len != (unsigned) bits) {  in gen_bitlen()
604                 Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));  in gen_bitlen()
605                 s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;  in gen_bitlen()
606                 tree[m].Len = (ush)bits;  in gen_bitlen()
644             tree[n].Len = 0;  in build_tree()
657         s->opt_len--; if (stree) s->static_len -= stree[node].Len;  in build_tree()
714     int nextlen = tree[0].Len; /* length of next code */  in scan_tree()
720     tree[max_code + 1].Len = (ush)0xffff; /* guard */  in scan_tree()
723         curlen = nextlen; nextlen = tree[n + 1].Len;  in scan_tree()
755     int nextlen = tree[0].Len; /* length of next code */  in send_tree()
764         curlen = nextlen; nextlen = tree[n + 1].Len;  in send_tree()
816         if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;  in build_bl_tree()
844         send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);  in send_all_trees()