lib/libz/trees.c

222

int len = tree[n].Len;

lib/libz/trees.c

237

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

lib/libz/trees.c

243

send_bits(s, tree[c].Code, tree[c].Len); }

lib/libz/trees.c

351

while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;

lib/libz/trees.c

352

while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;

lib/libz/trees.c

353

while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;

lib/libz/trees.c

354

while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;

lib/libz/trees.c

363

static_dtree[n].Len = 5;

lib/libz/trees.c

397

static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));

lib/libz/trees.c

403

static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));

lib/libz/trees.c

557

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

lib/libz/trees.c

561

bits = tree[tree[n].Dad].Len + 1;

lib/libz/trees.c

563

tree[n].Len = (ush)bits;

lib/libz/trees.c

573

if (stree) s->static_len += (ulg)f * (unsigned)(stree[n].Len + xbits);

lib/libz/trees.c

603

if ((unsigned) tree[m].Len != (unsigned) bits) {

lib/libz/trees.c

604

Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

lib/libz/trees.c

605

s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;

lib/libz/trees.c

606

tree[m].Len = (ush)bits;

lib/libz/trees.c

644

tree[n].Len = 0;

lib/libz/trees.c

657

s->opt_len--; if (stree) s->static_len -= stree[node].Len;

lib/libz/trees.c

714

int nextlen = tree[0].Len; /* length of next code */

lib/libz/trees.c

720

tree[max_code + 1].Len = (ush)0xffff; /* guard */

lib/libz/trees.c

723

curlen = nextlen; nextlen = tree[n + 1].Len;

lib/libz/trees.c

755

int nextlen = tree[0].Len; /* length of next code */

lib/libz/trees.c

764

curlen = nextlen; nextlen = tree[n + 1].Len;

lib/libz/trees.c

816

if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;

lib/libz/trees.c

844

send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);

sys/lib/libz/trees.c

222

int len = tree[n].Len;

sys/lib/libz/trees.c

237

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

sys/lib/libz/trees.c

243

send_bits(s, tree[c].Code, tree[c].Len); }

sys/lib/libz/trees.c

351

while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;

sys/lib/libz/trees.c

352

while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;

sys/lib/libz/trees.c

353

while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;

sys/lib/libz/trees.c

354

while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;

sys/lib/libz/trees.c

363

static_dtree[n].Len = 5;

sys/lib/libz/trees.c

397

static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));

sys/lib/libz/trees.c

403

static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));

sys/lib/libz/trees.c

557

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

sys/lib/libz/trees.c

561

bits = tree[tree[n].Dad].Len + 1;

sys/lib/libz/trees.c

563

tree[n].Len = (ush)bits;

sys/lib/libz/trees.c

573

if (stree) s->static_len += (ulg)f * (unsigned)(stree[n].Len + xbits);

sys/lib/libz/trees.c

603

if ((unsigned) tree[m].Len != (unsigned) bits) {

sys/lib/libz/trees.c

604

Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

sys/lib/libz/trees.c

605

s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;

sys/lib/libz/trees.c

606

tree[m].Len = (ush)bits;

sys/lib/libz/trees.c

644

tree[n].Len = 0;

sys/lib/libz/trees.c

657

s->opt_len--; if (stree) s->static_len -= stree[node].Len;

sys/lib/libz/trees.c

714

int nextlen = tree[0].Len; /* length of next code */

sys/lib/libz/trees.c

720

tree[max_code + 1].Len = (ush)0xffff; /* guard */

sys/lib/libz/trees.c

723

curlen = nextlen; nextlen = tree[n + 1].Len;

sys/lib/libz/trees.c

755

int nextlen = tree[0].Len; /* length of next code */

sys/lib/libz/trees.c

764

curlen = nextlen; nextlen = tree[n + 1].Len;

sys/lib/libz/trees.c

816

if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;

sys/lib/libz/trees.c

844

send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);