Lines Matching refs:Len
160 local void copy_block OF((deflate_state *s, charf *buf, unsigned len,
168 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
174 send_bits(s, tree[c].Code, tree[c].Len); }
219 { int len = length;\
220 if (s->bi_valid > (int)Buf_size - len) {\
225 s->bi_valid += len - Buf_size;\
228 s->bi_valid += len;\
298 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
299 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
300 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
301 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
310 static_dtree[n].Len = 5;
345 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
351 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
489 * OUT assertions: the field len is set to the optimal bit length, the
516 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
520 bits = tree[tree[n].Dad].Len + 1;
522 tree[n].Len = (ush)bits;
532 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
562 if ((unsigned) tree[m].Len != (unsigned) bits) {
563 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
564 s->opt_len += ((long)bits - (long)tree[m].Len)
566 tree[m].Len = (ush)bits;
577 * the given tree and the field len is set for all tree elements.
605 int len = tree[n].Len;
606 if (len == 0) continue;
608 tree[n].Code = bi_reverse(next_code[len]++, len);
611 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
619 * OUT assertions: the fields len and code are set to the optimal bit length
645 tree[n].Len = 0;
658 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
703 /* The field len is now set, we can generate the bit codes */
719 int nextlen = tree[0].Len; /* length of next code */
725 tree[max_code+1].Len = (ush)0xffff; /* guard */
728 curlen = nextlen; nextlen = tree[n+1].Len;
764 int nextlen = tree[0].Len; /* length of next code */
769 /* tree[max_code+1].Len = -1; */ /* guard already set */
773 curlen = nextlen; nextlen = tree[n+1].Len;
827 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
857 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
1121 s->last_eob_len = ltree[END_BLOCK].Len;
1167 * Reverse the first len bits of a code, using straightforward code (a faster
1169 * IN assertion: 1 <= len <= 15
1171 local unsigned bi_reverse(code, len)
1173 int len; /* its bit length */
1179 } while (--len > 0);
1222 local void copy_block(s, buf, len, header)
1225 unsigned len; /* its length */
1232 put_short(s, (ush)len);
1233 put_short(s, (ush)~len);
1239 s->bits_sent += (ulg)len<<3;
1241 while (len--) {
