Lines Matching refs:Len
323 #define Len dl.len
1986 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1992 send_bits(s, tree[c].Code, tree[c].Len); }
2116 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
2117 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
2118 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
2119 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
2128 static_dtree[n].Len = 5;
2268 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
2272 bits = tree[tree[n].Dad].Len + 1;
2274 tree[n].Len = (ush)bits;
2284 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
2314 if (tree[m].Len != (unsigned) bits) {
2315 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
2316 s->opt_len += ((long)bits - (long)tree[m].Len)
2318 tree[m].Len = (ush)bits;
2357 int len = tree[n].Len;
2397 tree[n].Len = 0;
2410 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
2470 int nextlen = tree[0].Len; /* length of next code */
2476 tree[max_code+1].Len = (ush)0xffff; /* guard */
2479 curlen = nextlen; nextlen = tree[n+1].Len;
2515 int nextlen = tree[0].Len; /* length of next code */
2520 /* tree[max_code+1].Len = -1; */ /* guard already set */
2524 curlen = nextlen; nextlen = tree[n+1].Len;
2578 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
2608 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
2887 s->last_eob_len = ltree[END_BLOCK].Len;