Lines Matching defs:len
166 unsigned len; /* length of stored block */
175 len = s->in[s->incnt++];
176 len |= s->in[s->incnt++] << 8;
177 if (s->in[s->incnt++] != (~len & 0xff) ||
178 s->in[s->incnt++] != ((~len >> 8) & 0xff))
181 /* copy len bytes from in to out */
182 if (s->incnt + len > s->inlen)
185 if (s->outcnt + len > s->outlen)
187 while (len--)
191 s->outcnt += len;
192 s->incnt += len;
237 int len; /* current number of bits in code */
238 int code; /* len bits being decoded */
239 int first; /* first code of length len */
240 int count; /* number of codes of length len */
241 int index; /* index of first code of length len in symbol table */
244 for (len = 1; len <= MAXBITS; len++) {
246 count = h->count[len];
247 if (code - count < first) /* if length len, return symbol */
265 int len; /* current number of bits in code */
266 int code; /* len bits being decoded */
267 int first; /* first code of length len */
268 int count; /* number of codes of length len */
269 int index; /* index of first code of length len in symbol table */
277 len = 1;
284 if (code - count < first) { /* if length len, return symbol */
286 s->bitcnt = (s->bitcnt - len) & 7;
293 len++;
295 left = (MAXBITS+1) - len;
343 int len; /* current length when stepping through h->count[] */
348 for (len = 0; len <= MAXBITS; len++)
349 h->count[len] = 0;
357 for (len = 1; len <= MAXBITS; len++) {
359 left -= h->count[len]; /* deduct count from possible codes */
366 for (len = 1; len < MAXBITS; len++)
367 offs[len + 1] = offs[len] + h->count[len];
441 int len; /* length for copy */
477 len = lens[symbol] + bits(s, lext[symbol]);
491 if (s->outcnt + len > s->outlen)
493 while (len--) {
504 s->outcnt += len;
705 int len; /* last length to repeat */
713 len = 0; /* assume repeating zeros */
717 len = lengths[index - 1]; /* last length */
727 lengths[index++] = len;