Len 167 lib/zlib/trees.c # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
Len 173 lib/zlib/trees.c send_bits(s, tree[c].Code, tree[c].Len); }
Len 295 lib/zlib/trees.c while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
Len 296 lib/zlib/trees.c while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
Len 297 lib/zlib/trees.c while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
Len 298 lib/zlib/trees.c while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
Len 307 lib/zlib/trees.c static_dtree[n].Len = 5;
Len 342 lib/zlib/trees.c static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
Len 348 lib/zlib/trees.c static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
Len 512 lib/zlib/trees.c tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
Len 516 lib/zlib/trees.c bits = tree[tree[n].Dad].Len + 1;
Len 518 lib/zlib/trees.c tree[n].Len = (ush)bits;
Len 528 lib/zlib/trees.c if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
Len 558 lib/zlib/trees.c if ((unsigned) tree[m].Len != (unsigned) bits) {
Len 559 lib/zlib/trees.c Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
Len 560 lib/zlib/trees.c s->opt_len += ((long)bits - (long)tree[m].Len)
Len 562 lib/zlib/trees.c tree[m].Len = (ush)bits;
Len 601 lib/zlib/trees.c int len = tree[n].Len;
Len 641 lib/zlib/trees.c tree[n].Len = 0;
Len 654 lib/zlib/trees.c s->opt_len--; if (stree) s->static_len -= stree[node].Len;
Len 715 lib/zlib/trees.c int nextlen = tree[0].Len; /* length of next code */
Len 721 lib/zlib/trees.c tree[max_code+1].Len = (ush)0xffff; /* guard */
Len 724 lib/zlib/trees.c curlen = nextlen; nextlen = tree[n+1].Len;
Len 760 lib/zlib/trees.c int nextlen = tree[0].Len; /* length of next code */
Len 769 lib/zlib/trees.c curlen = nextlen; nextlen = tree[n+1].Len;
Len 823 lib/zlib/trees.c if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
Len 853 lib/zlib/trees.c send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
Len 1117 lib/zlib/trees.c s->last_eob_len = ltree[END_BLOCK].Len;