49         ush  len;        /* length of bit string */  member
56 #define Len  dl.len  macro
76     Byte *pending_buf;   /* output still pending */
78     Byte *pending_out;   /* next pending byte to output to the stream */
81     Byte  data_type;     /* UNKNOWN, BINARY or ASCII */
82     Byte  method;        /* STORED (for zip only) or DEFLATED */
89     uInt  w_mask;        /* w_size - 1 */
91     Byte *window;
95      * wSize-MAX_MATCH bytes, but this ensures that IO is always
117     uInt  hash_mask;      /* hash_size-1 */
122      * byte no longer takes part in the hash key, that is:
197      *   - frequencies can be kept in 16 bit counters
198      *   - if compression is not successful for the first block, all input
202      *   - if compression is not successful for a file smaller than 64K, we can
205      *   - creating new Huffman trees less frequently may not provide fast
211      *   - I can't count above 4
245 	(2 * (1 << (windowBits)) * sizeof(Byte) + PAGE_SIZE)
248 	(2 * (1 << (windowBits)) * sizeof(Byte))
257 /* Output a byte on the stream.
260 #define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}
268 #define MAX_DIST(s)  ((s)->w_size-MIN_LOOKAHEAD)
294  * Reverse the first len bits of a code, using straightforward code (a faster
296  * IN assertion: 1 <= len <= 15
300     int len        /* its bit length */  in bi_reverse()  argument
307     } while (--len > 0);  in bi_reverse()
316     if (s->bi_valid == 16) {  in bi_flush()
317         put_short(s, s->bi_buf);  in bi_flush()
318         s->bi_buf = 0;  in bi_flush()
319         s->bi_valid = 0;  in bi_flush()
320     } else if (s->bi_valid >= 8) {  in bi_flush()
321         put_byte(s, (Byte)s->bi_buf);  in bi_flush()
322         s->bi_buf >>= 8;  in bi_flush()
323         s->bi_valid -= 8;  in bi_flush()
328  * Flush the bit buffer and align the output on a byte boundary
332     if (s->bi_valid > 8) {  in bi_windup()
333         put_short(s, s->bi_buf);  in bi_windup()
334     } else if (s->bi_valid > 0) {  in bi_windup()
335         put_byte(s, (Byte)s->bi_buf);  in bi_windup()
337     s->bi_buf = 0;  in bi_windup()
338     s->bi_valid = 0;  in bi_windup()
340     s->bits_sent = (s->bits_sent+7) & ~7;  in bi_windup()
371     s->bits_sent += (ulg)length;  in send_bits()
374      * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))  in send_bits()
377     if (s->bi_valid > (int)Buf_size - length) {  in send_bits()
378         s->bi_buf |= (value << s->bi_valid);  in send_bits()
379         put_short(s, s->bi_buf);  in send_bits()
380         s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);  in send_bits()
381         s->bi_valid += length - Buf_size;  in send_bits()
383         s->bi_buf |= value << s->bi_valid;  in send_bits()
384         s->bi_valid += length;  in send_bits()
390 { int len = length;\
391   if (s->bi_valid > (int)Buf_size - len) {\
393     s->bi_buf |= (val << s->bi_valid);\
394     put_short(s, s->bi_buf);\
395     s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
396     s->bi_valid += len - Buf_size;\
398     s->bi_buf |= (value) << s->bi_valid;\
399     s->bi_valid += len;\
416  * to avoid allocating a large strm->next_out buffer and copying into it.
423     unsigned len;  in flush_pending()  local
424     deflate_state *s = (deflate_state *) strm->state;  in flush_pending()
427     len = s->pending;  in flush_pending()
428     if (len > strm->avail_out) len = strm->avail_out;  in flush_pending()
429     if (len == 0) return;  in flush_pending()
431     if (strm->next_out != NULL) {  in flush_pending()
432 	memcpy(strm->next_out, s->pending_out, len);  in flush_pending()
433 	strm->next_out += len;  in flush_pending()
435     s->pending_out += len;  in flush_pending()
436     strm->total_out += len;  in flush_pending()
437     strm->avail_out  -= len;  in flush_pending()
438     s->pending -= len;  in flush_pending()
439     if (s->pending == 0) {  in flush_pending()
440         s->pending_out = s->pending_buf;  in flush_pending()