Len               156 lib/zlib_deflate/deftree.c #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
Len               162 lib/zlib_deflate/deftree.c        send_bits(s, tree[c].Code, tree[c].Len); }
Len               274 lib/zlib_deflate/deftree.c     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
Len               275 lib/zlib_deflate/deftree.c     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
Len               276 lib/zlib_deflate/deftree.c     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
Len               277 lib/zlib_deflate/deftree.c     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
Len               286 lib/zlib_deflate/deftree.c         static_dtree[n].Len = 5;
Len               430 lib/zlib_deflate/deftree.c     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
Len               434 lib/zlib_deflate/deftree.c         bits = tree[tree[n].Dad].Len + 1;
Len               436 lib/zlib_deflate/deftree.c         tree[n].Len = (ush)bits;
Len               446 lib/zlib_deflate/deftree.c         if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
Len               476 lib/zlib_deflate/deftree.c             if (tree[m].Len != (unsigned) bits) {
Len               477 lib/zlib_deflate/deftree.c                 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
Len               478 lib/zlib_deflate/deftree.c                 s->opt_len += ((long)bits - (long)tree[m].Len)
Len               480 lib/zlib_deflate/deftree.c                 tree[m].Len = (ush)bits;
Len               520 lib/zlib_deflate/deftree.c         int len = tree[n].Len;
Len               561 lib/zlib_deflate/deftree.c             tree[n].Len = 0;
Len               574 lib/zlib_deflate/deftree.c         s->opt_len--; if (stree) s->static_len -= stree[node].Len;
Len               635 lib/zlib_deflate/deftree.c     int nextlen = tree[0].Len; /* length of next code */
Len               641 lib/zlib_deflate/deftree.c     tree[max_code+1].Len = (ush)0xffff; /* guard */
Len               644 lib/zlib_deflate/deftree.c         curlen = nextlen; nextlen = tree[n+1].Len;
Len               681 lib/zlib_deflate/deftree.c     int nextlen = tree[0].Len; /* length of next code */
Len               690 lib/zlib_deflate/deftree.c         curlen = nextlen; nextlen = tree[n+1].Len;
Len               745 lib/zlib_deflate/deftree.c         if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
Len               778 lib/zlib_deflate/deftree.c         send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
Len              1063 lib/zlib_deflate/deftree.c     s->last_eob_len = ltree[END_BLOCK].Len;