Lines Matching refs:Len
169 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
175 send_bits(s, tree[c].Code, tree[c].Len); }
299 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
300 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
301 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
302 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
311 static_dtree[n].Len = 5; in tr_static_init()
346 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
352 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
517 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
521 bits = tree[tree[n].Dad].Len + 1;
523 tree[n].Len = (ush)bits;
533 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
563 if ((unsigned) tree[m].Len != (unsigned) bits) {
564 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
565 s->opt_len += ((long)bits - (long)tree[m].Len)
567 tree[m].Len = (ush)bits;
606 int len = tree[n].Len;
646 tree[n].Len = 0;
659 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
720 int nextlen = tree[0].Len; /* length of next code */
726 tree[max_code+1].Len = (ush)0xffff; /* guard */
729 curlen = nextlen; nextlen = tree[n+1].Len;
765 int nextlen = tree[0].Len; /* length of next code */
774 curlen = nextlen; nextlen = tree[n+1].Len;
828 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
858 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
1122 s->last_eob_len = ltree[END_BLOCK].Len;