Lines Matching refs:Len
150 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
156 send_bits(s, tree[c].Code, tree[c].Len); }
220 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
221 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
222 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
223 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
232 static_dtree[n].Len = 5;
376 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
380 bits = tree[tree[n].Dad].Len + 1;
382 tree[n].Len = (ush)bits;
392 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
422 if (tree[m].Len != (unsigned) bits) {
423 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
424 s->opt_len += ((long)bits - (long)tree[m].Len)
426 tree[m].Len = (ush)bits;
466 int len = tree[n].Len;
507 tree[n].Len = 0;
520 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
581 int nextlen = tree[0].Len; /* length of next code */
587 tree[max_code+1].Len = (ush)0xffff; /* guard */
590 curlen = nextlen; nextlen = tree[n+1].Len;
627 int nextlen = tree[0].Len; /* length of next code */
632 /* tree[max_code+1].Len = -1; */ /* guard already set */
636 curlen = nextlen; nextlen = tree[n+1].Len;
691 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
724 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
1009 s->last_eob_len = ltree[END_BLOCK].Len;