Lines Matching refs:Len
198 #define Len dl.len
1590 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1596 send_bits(s, tree[c].Code, tree[c].Len); }
1716 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
1717 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
1718 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
1719 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
1728 static_dtree[n].Len = 5;
1739 if (static_dtree[0].Len == 0) {
1870 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
1874 bits = tree[tree[n].Dad].Len + 1;
1876 tree[n].Len = (ush)bits;
1886 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
1916 if (tree[m].Len != (unsigned) bits) {
1917 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
1918 s->opt_len += ((long)bits - (long)tree[m].Len)
1920 tree[m].Len = (ush)bits;
1959 int len = tree[n].Len;
1999 tree[n].Len = 0;
2012 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
2072 int nextlen = tree[0].Len; /* length of next code */
2078 tree[max_code+1].Len = (ush)0xffff; /* guard */
2081 curlen = nextlen; nextlen = tree[n+1].Len;
2117 int nextlen = tree[0].Len; /* length of next code */
2122 /* tree[max_code+1].Len = -1; */ /* guard already set */
2126 curlen = nextlen; nextlen = tree[n+1].Len;
2180 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
2210 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
2495 s->last_eob_len = ltree[END_BLOCK].Len;