Len
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
static_dtree[n].Len = 5;
static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
bits = tree[tree[n].Dad].Len + 1;
tree[n].Len = (ush)bits;
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
if ((unsigned) tree[m].Len != (unsigned) bits) {
Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
s->opt_len += ((long)bits - (long)tree[m].Len)
tree[m].Len = (ush)bits;
int len = tree[n].Len;
tree[n].Len = 0;
s->opt_len--; if (stree) s->static_len -= stree[node].Len;
int nextlen = tree[0].Len; /* length of next code */
tree[max_code+1].Len = (ush)0xffff; /* guard */
curlen = nextlen; nextlen = tree[n+1].Len;
int nextlen = tree[0].Len; /* length of next code */
curlen = nextlen; nextlen = tree[n+1].Len;
if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
static_dtree[n].Len = 5;
tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
bits = tree[tree[n].Dad].Len + 1;
tree[n].Len = (ush)bits;
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
if (tree[m].Len != (unsigned) bits) {
Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
s->opt_len += ((long)bits - (long)tree[m].Len)
tree[m].Len = (ush)bits;
int len = tree[n].Len;
tree[n].Len = 0;
s->opt_len--; if (stree) s->static_len -= stree[node].Len;
int nextlen = tree[0].Len; /* length of next code */
tree[max_code+1].Len = (ush)0xffff; /* guard */
curlen = nextlen; nextlen = tree[n+1].Len;
int nextlen = tree[0].Len; /* length of next code */
curlen = nextlen; nextlen = tree[n+1].Len;
if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
s->last_eob_len = ltree[END_BLOCK].Len;
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
static_dtree[n].Len = 5;
static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
bits = tree[tree[n].Dad].Len + 1;
tree[n].Len = (ush)bits;
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
if ((unsigned) tree[m].Len != (unsigned) bits) {
Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
s->opt_len += ((long)bits - (long)tree[m].Len)
tree[m].Len = (ush)bits;
int len = tree[n].Len;
tree[n].Len = 0;
s->opt_len--; if (stree) s->static_len -= stree[node].Len;
int nextlen = tree[0].Len; /* length of next code */
tree[max_code+1].Len = (ush)0xffff; /* guard */
curlen = nextlen; nextlen = tree[n+1].Len;
int nextlen = tree[0].Len; /* length of next code */
curlen = nextlen; nextlen = tree[n+1].Len;
if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
static_dtree[n].Len = 5;
static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
bits = tree[tree[n].Dad].Len + 1;
tree[n].Len = (ush)bits;
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
if ((unsigned) tree[m].Len != (unsigned) bits) {
Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
s->opt_len += ((long)bits - (long)tree[m].Len)
tree[m].Len = (ush)bits;
int len = tree[n].Len;
tree[n].Len = 0;
s->opt_len--; if (stree) s->static_len -= stree[node].Len;
int nextlen = tree[0].Len; /* length of next code */
tree[max_code+1].Len = (ush)0xffff; /* guard */
curlen = nextlen; nextlen = tree[n+1].Len;
int nextlen = tree[0].Len; /* length of next code */
curlen = nextlen; nextlen = tree[n+1].Len;
if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);