Len              1603 net/zlib.c     #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
Len              1609 net/zlib.c            send_bits(s, tree[c].Code, tree[c].Len); }
Len              1728 net/zlib.c         while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
Len              1729 net/zlib.c         while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
Len              1730 net/zlib.c         while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
Len              1731 net/zlib.c         while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
Len              1740 net/zlib.c             static_dtree[n].Len = 5;
Len              1751 net/zlib.c         if (static_dtree[0].Len == 0) {
Len              1882 net/zlib.c         tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
Len              1886 net/zlib.c             bits = tree[tree[n].Dad].Len + 1;
Len              1888 net/zlib.c             tree[n].Len = (ush)bits;
Len              1898 net/zlib.c             if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
Len              1928 net/zlib.c                 if (tree[m].Len != (unsigned) bits) {
Len              1929 net/zlib.c                     Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
Len              1930 net/zlib.c                     s->opt_len += ((long)bits - (long)tree[m].Len)
Len              1932 net/zlib.c                     tree[m].Len = (ush)bits;
Len              1971 net/zlib.c             int len = tree[n].Len;
Len              2011 net/zlib.c                 tree[n].Len = 0;
Len              2024 net/zlib.c             s->opt_len--; if (stree) s->static_len -= stree[node].Len;
Len              2084 net/zlib.c         int nextlen = tree[0].Len; /* length of next code */
Len              2090 net/zlib.c         tree[max_code+1].Len = (ush)0xffff; /* guard */
Len              2093 net/zlib.c             curlen = nextlen; nextlen = tree[n+1].Len;
Len              2129 net/zlib.c         int nextlen = tree[0].Len; /* length of next code */
Len              2138 net/zlib.c             curlen = nextlen; nextlen = tree[n+1].Len;
Len              2192 net/zlib.c             if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
Len              2222 net/zlib.c             send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
Len              2507 net/zlib.c         s->last_eob_len = ltree[END_BLOCK].Len;