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