Lines Matching refs:Len
155 local void copy_block OF((deflate_state *s, charf *buf, unsigned len,
163 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
169 send_bits(s, tree[c].Code, tree[c].Len); }
214 { int len = length;\
215 if (s->bi_valid > (int)Buf_size - len) {\
220 s->bi_valid += len - Buf_size;\
223 s->bi_valid += len;\
293 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
294 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
295 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
296 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
305 static_dtree[n].Len = 5;
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
346 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
483 len is set to the optimal bit length, the
510 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
514 bits = tree[tree[n].Dad].Len + 1;
516 tree[n].Len = (ush)bits;
526 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
556 if ((unsigned) tree[m].Len != (unsigned) bits) {
557 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
558 s->opt_len += ((long)bits - (long)tree[m].Len)
560 tree[m].Len = (ush)bits;
571 * the given tree and the field len is set for all tree elements.
599 int len = tree[n].Len;
600 if (len == 0) continue;
602 tree[n].Code = bi_reverse(next_code[len]++, len);
605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
613 * OUT assertions: the fields len and code are set to the optimal bit length
639 tree[n].Len = 0;
652 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
697 /* The field len is now set, we can generate the bit codes */
713 int nextlen = tree[0].Len; /* length of next code */
719 tree[max_code+1].Len = (ush)0xffff; /* guard */
722 curlen = nextlen; nextlen = tree[n+1].Len;
758 int nextlen = tree[0].Len; /* length of next code */
763 /* tree[max_code+1].Len = -1; */ /* guard already set */
767 curlen = nextlen; nextlen = tree[n+1].Len;
821 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
851 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
1150 * Reverse the first len bits of a code, using straightforward code (a faster
1152 * IN assertion: 1 <= len <= 15
1154 local unsigned bi_reverse(code, len)
1156 int len; /* its bit length */
1162 } while (--len > 0);
1205 local void copy_block(s, buf, len, header)
1208 unsigned len; /* its length */
1214 put_short(s, (ush)len);
1215 put_short(s, (ush)~len);
1221 s->bits_sent += (ulg)len<<3;
1223 while (len--) {
