1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52#include "deflate.h"
53#include <u-boot/crc.h>
54
55const char deflate_copyright[] =
56 " deflate 1.2.5 Copyright 1995-2010 Jean-loup Gailly and Mark Adler ";
57
58
59
60
61
62
63
64
65
66
67typedef enum {
68 need_more,
69 block_done,
70 finish_started,
71 finish_done
72} block_state;
73
74typedef block_state (*compress_func) OF((deflate_state *s, int flush));
75
76
77local void fill_window OF((deflate_state *s));
78local block_state deflate_stored OF((deflate_state *s, int flush));
79local block_state deflate_fast OF((deflate_state *s, int flush));
80#ifndef FASTEST
81local block_state deflate_slow OF((deflate_state *s, int flush));
82#endif
83local block_state deflate_rle OF((deflate_state *s, int flush));
84local block_state deflate_huff OF((deflate_state *s, int flush));
85local void lm_init OF((deflate_state *s));
86local void putShortMSB OF((deflate_state *s, uInt b));
87local void flush_pending OF((z_streamp strm));
88local int read_buf OF((z_streamp strm, Bytef *buf, unsigned size));
89#ifdef ASMV
90 void match_init OF((void));
91 uInt longest_match OF((deflate_state *s, IPos cur_match));
92#else
93local uInt longest_match OF((deflate_state *s, IPos cur_match));
94#endif
95
96#ifdef DEBUG
97local void check_match OF((deflate_state *s, IPos start, IPos match,
98 int length));
99#endif
100
101
102
103
104
105#define NIL 0
106
107
108#ifndef TOO_FAR
109# define TOO_FAR 4096
110#endif
111
112
113
114
115
116
117
118typedef struct config_s {
119 ush good_length;
120 ush max_lazy;
121 ush nice_length;
122 ush max_chain;
123 compress_func func;
124} config;
125
126#ifdef FASTEST
127local const config configuration_table[2] = {
128
129 {0, 0, 0, 0, deflate_stored},
130 {4, 4, 8, 4, deflate_fast}};
131#else
132local const config configuration_table[10] = {
133
134 {0, 0, 0, 0, deflate_stored},
135 {4, 4, 8, 4, deflate_fast},
136 {4, 5, 16, 8, deflate_fast},
137 {4, 6, 32, 32, deflate_fast},
138
139 {4, 4, 16, 16, deflate_slow},
140 {8, 16, 32, 32, deflate_slow},
141 {8, 16, 128, 128, deflate_slow},
142 {8, 32, 128, 256, deflate_slow},
143 {32, 128, 258, 1024, deflate_slow},
144 {32, 258, 258, 4096, deflate_slow}};
145#endif
146
147
148
149
150
151
152#define EQUAL 0
153
154
155#ifndef NO_DUMMY_DECL
156struct static_tree_desc_s {int dummy;};
157#endif
158
159
160
161
162
163
164
165#define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask)
166
167
168
169
170
171
172
173
174
175
176
177
178#ifdef FASTEST
179#define INSERT_STRING(s, str, match_head) \
180 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
181 match_head = s->head[s->ins_h], \
182 s->head[s->ins_h] = (Pos)(str))
183#else
184#define INSERT_STRING(s, str, match_head) \
185 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
186 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
187 s->head[s->ins_h] = (Pos)(str))
188#endif
189
190
191
192
193
194#define CLEAR_HASH(s) \
195 s->head[s->hash_size-1] = NIL; \
196 zmemzero((Bytef *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));
197
198
199int ZEXPORT deflateInit_(strm, level, version, stream_size)
200 z_streamp strm;
201 int level;
202 const char *version;
203 int stream_size;
204{
205 return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL,
206 Z_DEFAULT_STRATEGY, version, stream_size);
207
208}
209
210
211int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy,
212 version, stream_size)
213 z_streamp strm;
214 int level;
215 int method;
216 int windowBits;
217 int memLevel;
218 int strategy;
219 const char *version;
220 int stream_size;
221{
222 deflate_state *s;
223 int wrap = 1;
224 static const char my_version[] = ZLIB_VERSION;
225
226 ushf *overlay;
227
228
229
230
231 if (version == Z_NULL || version[0] != my_version[0] ||
232 stream_size != sizeof(z_stream)) {
233 return Z_VERSION_ERROR;
234 }
235 if (strm == Z_NULL) return Z_STREAM_ERROR;
236
237 strm->msg = Z_NULL;
238 if (strm->zalloc == (alloc_func)0) {
239 strm->zalloc = zcalloc;
240 strm->opaque = (voidpf)0;
241 }
242 if (strm->zfree == (free_func)0) strm->zfree = zcfree;
243
244#ifdef FASTEST
245 if (level != 0) level = 1;
246#else
247 if (level == Z_DEFAULT_COMPRESSION) level = 6;
248#endif
249
250 if (windowBits < 0) {
251 wrap = 0;
252 windowBits = -windowBits;
253 }
254#ifdef GZIP
255 else if (windowBits > 15) {
256 wrap = 2;
257 windowBits -= 16;
258 }
259#endif
260 if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED ||
261 windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
262 strategy < 0 || strategy > Z_FIXED) {
263 return Z_STREAM_ERROR;
264 }
265 if (windowBits == 8) windowBits = 9;
266 s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state));
267 if (s == Z_NULL) return Z_MEM_ERROR;
268 strm->state = (struct internal_state FAR *)s;
269 s->strm = strm;
270
271 s->wrap = wrap;
272 s->gzhead = Z_NULL;
273 s->w_bits = windowBits;
274 s->w_size = 1 << s->w_bits;
275 s->w_mask = s->w_size - 1;
276
277 s->hash_bits = memLevel + 7;
278 s->hash_size = 1 << s->hash_bits;
279 s->hash_mask = s->hash_size - 1;
280 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
281
282 s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));
283 s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos));
284 s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos));
285
286 s->high_water = 0;
287
288 s->lit_bufsize = 1 << (memLevel + 6);
289
290 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
291 s->pending_buf = (uchf *) overlay;
292 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
293
294 if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
295 s->pending_buf == Z_NULL) {
296 s->status = FINISH_STATE;
297 strm->msg = (char*)ERR_MSG(Z_MEM_ERROR);
298 deflateEnd (strm);
299 return Z_MEM_ERROR;
300 }
301 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
302 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
303
304 s->level = level;
305 s->strategy = strategy;
306 s->method = (Byte)method;
307
308 return deflateReset(strm);
309}
310
311
312int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength)
313 z_streamp strm;
314 const Bytef *dictionary;
315 uInt dictLength;
316{
317 deflate_state *s;
318 uInt length = dictLength;
319 uInt n;
320 IPos hash_head = 0;
321
322 if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL ||
323 strm->state->wrap == 2 ||
324 (strm->state->wrap == 1 && strm->state->status != INIT_STATE))
325 return Z_STREAM_ERROR;
326
327 s = strm->state;
328 if (s->wrap)
329 strm->adler = adler32(strm->adler, dictionary, dictLength);
330
331 if (length < MIN_MATCH) return Z_OK;
332 if (length > s->w_size) {
333 length = s->w_size;
334 dictionary += dictLength - length;
335 }
336 zmemcpy(s->window, dictionary, length);
337 s->strstart = length;
338 s->block_start = (long)length;
339
340
341
342
343
344 s->ins_h = s->window[0];
345 UPDATE_HASH(s, s->ins_h, s->window[1]);
346 for (n = 0; n <= length - MIN_MATCH; n++) {
347 INSERT_STRING(s, n, hash_head);
348 }
349 if (hash_head) hash_head = 0;
350 return Z_OK;
351}
352
353
354int ZEXPORT deflateReset (strm)
355 z_streamp strm;
356{
357 deflate_state *s;
358
359 if (strm == Z_NULL || strm->state == Z_NULL ||
360 strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0) {
361 return Z_STREAM_ERROR;
362 }
363
364 strm->total_in = strm->total_out = 0;
365 strm->msg = Z_NULL;
366 strm->data_type = Z_UNKNOWN;
367
368 s = (deflate_state *)strm->state;
369 s->pending = 0;
370 s->pending_out = s->pending_buf;
371
372 if (s->wrap < 0) {
373 s->wrap = -s->wrap;
374 }
375 s->status = s->wrap ? INIT_STATE : BUSY_STATE;
376 strm->adler =
377#ifdef GZIP
378 s->wrap == 2 ? crc32(0L, Z_NULL, 0) :
379#endif
380 adler32(0L, Z_NULL, 0);
381 s->last_flush = Z_NO_FLUSH;
382
383 _tr_init(s);
384 lm_init(s);
385
386 return Z_OK;
387}
388
389
390int ZEXPORT deflateSetHeader (strm, head)
391 z_streamp strm;
392 gz_headerp head;
393{
394 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
395 if (strm->state->wrap != 2) return Z_STREAM_ERROR;
396 strm->state->gzhead = head;
397 return Z_OK;
398}
399
400
401int ZEXPORT deflatePrime (strm, bits, value)
402 z_streamp strm;
403 int bits;
404 int value;
405{
406 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
407 strm->state->bi_valid = bits;
408 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
409 return Z_OK;
410}
411
412
413int ZEXPORT deflateParams(strm, level, strategy)
414 z_streamp strm;
415 int level;
416 int strategy;
417{
418 deflate_state *s;
419 compress_func func;
420 int err = Z_OK;
421
422 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
423 s = strm->state;
424
425#ifdef FASTEST
426 if (level != 0) level = 1;
427#else
428 if (level == Z_DEFAULT_COMPRESSION) level = 6;
429#endif
430 if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {
431 return Z_STREAM_ERROR;
432 }
433 func = configuration_table[s->level].func;
434
435 if ((strategy != s->strategy || func != configuration_table[level].func) &&
436 strm->total_in != 0) {
437
438 err = deflate(strm, Z_BLOCK);
439 }
440 if (s->level != level) {
441 s->level = level;
442 s->max_lazy_match = configuration_table[level].max_lazy;
443 s->good_match = configuration_table[level].good_length;
444 s->nice_match = configuration_table[level].nice_length;
445 s->max_chain_length = configuration_table[level].max_chain;
446 }
447 s->strategy = strategy;
448 return err;
449}
450
451
452int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain)
453 z_streamp strm;
454 int good_length;
455 int max_lazy;
456 int nice_length;
457 int max_chain;
458{
459 deflate_state *s;
460
461 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
462 s = strm->state;
463 s->good_match = good_length;
464 s->max_lazy_match = max_lazy;
465 s->nice_match = nice_length;
466 s->max_chain_length = max_chain;
467 return Z_OK;
468}
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487uLong ZEXPORT deflateBound(strm, sourceLen)
488 z_streamp strm;
489 uLong sourceLen;
490{
491 deflate_state *s;
492 uLong complen, wraplen;
493 Bytef *str;
494
495
496 complen = sourceLen +
497 ((sourceLen + 7) >> 3) + ((sourceLen + 63) >> 6) + 5;
498
499
500 if (strm == Z_NULL || strm->state == Z_NULL)
501 return complen + 6;
502
503
504 s = strm->state;
505 switch (s->wrap) {
506 case 0:
507 wraplen = 0;
508 break;
509 case 1:
510 wraplen = 6 + (s->strstart ? 4 : 0);
511 break;
512 case 2:
513 wraplen = 18;
514 if (s->gzhead != Z_NULL) {
515 if (s->gzhead->extra != Z_NULL)
516 wraplen += 2 + s->gzhead->extra_len;
517 str = s->gzhead->name;
518 if (str != Z_NULL)
519 do {
520 wraplen++;
521 } while (*str++);
522 str = s->gzhead->comment;
523 if (str != Z_NULL)
524 do {
525 wraplen++;
526 } while (*str++);
527 if (s->gzhead->hcrc)
528 wraplen += 2;
529 }
530 break;
531 default:
532 wraplen = 6;
533 }
534
535
536 if (s->w_bits != 15 || s->hash_bits != 8 + 7)
537 return complen + wraplen;
538
539
540 return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) +
541 (sourceLen >> 25) + 13 - 6 + wraplen;
542}
543
544
545
546
547
548
549local void putShortMSB (s, b)
550 deflate_state *s;
551 uInt b;
552{
553 put_byte(s, (Byte)(b >> 8));
554 put_byte(s, (Byte)(b & 0xff));
555}
556
557
558
559
560
561
562
563local void flush_pending(strm)
564 z_streamp strm;
565{
566 unsigned len = strm->state->pending;
567
568 if (len > strm->avail_out) len = strm->avail_out;
569 if (len == 0) return;
570
571 zmemcpy(strm->next_out, strm->state->pending_out, len);
572 strm->next_out += len;
573 strm->state->pending_out += len;
574 strm->total_out += len;
575 strm->avail_out -= len;
576 strm->state->pending -= len;
577 if (strm->state->pending == 0) {
578 strm->state->pending_out = strm->state->pending_buf;
579 }
580}
581
582
583int ZEXPORT deflate (strm, flush)
584 z_streamp strm;
585 int flush;
586{
587 int old_flush;
588 deflate_state *s;
589
590 if (strm == Z_NULL || strm->state == Z_NULL ||
591 flush > Z_BLOCK || flush < 0) {
592 return Z_STREAM_ERROR;
593 }
594 s = strm->state;
595
596 if (s->status == FINISH_STATE && flush != Z_FINISH) {
597 ERR_RETURN(strm, Z_STREAM_ERROR);
598 }
599 if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR);
600
601 s->strm = strm;
602 old_flush = s->last_flush;
603 s->last_flush = flush;
604
605
606 if (s->status == INIT_STATE) {
607#ifdef GZIP
608 if (s->wrap == 2) {
609 strm->adler = crc32(0L, Z_NULL, 0);
610 put_byte(s, 31);
611 put_byte(s, 139);
612 put_byte(s, 8);
613 if (s->gzhead == Z_NULL) {
614 put_byte(s, 0);
615 put_byte(s, 0);
616 put_byte(s, 0);
617 put_byte(s, 0);
618 put_byte(s, 0);
619 put_byte(s, s->level == 9 ? 2 :
620 (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
621 4 : 0));
622 put_byte(s, OS_CODE);
623 s->status = BUSY_STATE;
624 }
625 else {
626 put_byte(s, (s->gzhead->text ? 1 : 0) +
627 (s->gzhead->hcrc ? 2 : 0) +
628 (s->gzhead->extra == Z_NULL ? 0 : 4) +
629 (s->gzhead->name == Z_NULL ? 0 : 8) +
630 (s->gzhead->comment == Z_NULL ? 0 : 16)
631 );
632 put_byte(s, (Byte)(s->gzhead->time & 0xff));
633 put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff));
634 put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff));
635 put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff));
636 put_byte(s, s->level == 9 ? 2 :
637 (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
638 4 : 0));
639 put_byte(s, s->gzhead->os & 0xff);
640 if (s->gzhead->extra != Z_NULL) {
641 put_byte(s, s->gzhead->extra_len & 0xff);
642 put_byte(s, (s->gzhead->extra_len >> 8) & 0xff);
643 }
644 if (s->gzhead->hcrc)
645 strm->adler = crc32(strm->adler, s->pending_buf,
646 s->pending);
647 s->gzindex = 0;
648 s->status = EXTRA_STATE;
649 }
650 }
651 else
652#endif
653 {
654 uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
655 uInt level_flags;
656
657 if (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2)
658 level_flags = 0;
659 else if (s->level < 6)
660 level_flags = 1;
661 else if (s->level == 6)
662 level_flags = 2;
663 else
664 level_flags = 3;
665 header |= (level_flags << 6);
666 if (s->strstart != 0) header |= PRESET_DICT;
667 header += 31 - (header % 31);
668
669 s->status = BUSY_STATE;
670 putShortMSB(s, header);
671
672
673 if (s->strstart != 0) {
674 putShortMSB(s, (uInt)(strm->adler >> 16));
675 putShortMSB(s, (uInt)(strm->adler & 0xffff));
676 }
677 strm->adler = adler32(0L, Z_NULL, 0);
678 }
679 }
680#ifdef GZIP
681 if (s->status == EXTRA_STATE) {
682 if (s->gzhead->extra != Z_NULL) {
683 uInt beg = s->pending;
684
685 while (s->gzindex < (s->gzhead->extra_len & 0xffff)) {
686 if (s->pending == s->pending_buf_size) {
687 if (s->gzhead->hcrc && s->pending > beg)
688 strm->adler = crc32(strm->adler, s->pending_buf + beg,
689 s->pending - beg);
690 flush_pending(strm);
691 beg = s->pending;
692 if (s->pending == s->pending_buf_size)
693 break;
694 }
695 put_byte(s, s->gzhead->extra[s->gzindex]);
696 s->gzindex++;
697 }
698 if (s->gzhead->hcrc && s->pending > beg)
699 strm->adler = crc32(strm->adler, s->pending_buf + beg,
700 s->pending - beg);
701 if (s->gzindex == s->gzhead->extra_len) {
702 s->gzindex = 0;
703 s->status = NAME_STATE;
704 }
705 }
706 else
707 s->status = NAME_STATE;
708 }
709 if (s->status == NAME_STATE) {
710 if (s->gzhead->name != Z_NULL) {
711 uInt beg = s->pending;
712 int val;
713
714 do {
715 if (s->pending == s->pending_buf_size) {
716 if (s->gzhead->hcrc && s->pending > beg)
717 strm->adler = crc32(strm->adler, s->pending_buf + beg,
718 s->pending - beg);
719 flush_pending(strm);
720 beg = s->pending;
721 if (s->pending == s->pending_buf_size) {
722 val = 1;
723 break;
724 }
725 }
726 val = s->gzhead->name[s->gzindex++];
727 put_byte(s, val);
728 } while (val != 0);
729 if (s->gzhead->hcrc && s->pending > beg)
730 strm->adler = crc32(strm->adler, s->pending_buf + beg,
731 s->pending - beg);
732 if (val == 0) {
733 s->gzindex = 0;
734 s->status = COMMENT_STATE;
735 }
736 }
737 else
738 s->status = COMMENT_STATE;
739 }
740 if (s->status == COMMENT_STATE) {
741 if (s->gzhead->comment != Z_NULL) {
742 uInt beg = s->pending;
743 int val;
744
745 do {
746 if (s->pending == s->pending_buf_size) {
747 if (s->gzhead->hcrc && s->pending > beg)
748 strm->adler = crc32(strm->adler, s->pending_buf + beg,
749 s->pending - beg);
750 flush_pending(strm);
751 beg = s->pending;
752 if (s->pending == s->pending_buf_size) {
753 val = 1;
754 break;
755 }
756 }
757 val = s->gzhead->comment[s->gzindex++];
758 put_byte(s, val);
759 } while (val != 0);
760 if (s->gzhead->hcrc && s->pending > beg)
761 strm->adler = crc32(strm->adler, s->pending_buf + beg,
762 s->pending - beg);
763 if (val == 0)
764 s->status = HCRC_STATE;
765 }
766 else
767 s->status = HCRC_STATE;
768 }
769 if (s->status == HCRC_STATE) {
770 if (s->gzhead->hcrc) {
771 if (s->pending + 2 > s->pending_buf_size)
772 flush_pending(strm);
773 if (s->pending + 2 <= s->pending_buf_size) {
774 put_byte(s, (Byte)(strm->adler & 0xff));
775 put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
776 strm->adler = crc32(0L, Z_NULL, 0);
777 s->status = BUSY_STATE;
778 }
779 }
780 else
781 s->status = BUSY_STATE;
782 }
783#endif
784
785
786 if (s->pending != 0) {
787 flush_pending(strm);
788 if (strm->avail_out == 0) {
789
790
791
792
793
794
795 s->last_flush = -1;
796 return Z_OK;
797 }
798
799
800
801
802
803 } else if (strm->avail_in == 0 && flush <= old_flush &&
804 flush != Z_FINISH) {
805 ERR_RETURN(strm, Z_BUF_ERROR);
806 }
807
808
809 if (s->status == FINISH_STATE && strm->avail_in != 0) {
810 ERR_RETURN(strm, Z_BUF_ERROR);
811 }
812
813
814
815 if (strm->avail_in != 0 || s->lookahead != 0 ||
816 (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) {
817 block_state bstate;
818
819 bstate = s->strategy == Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :
820 (s->strategy == Z_RLE ? deflate_rle(s, flush) :
821 (*(configuration_table[s->level].func))(s, flush));
822
823 if (bstate == finish_started || bstate == finish_done) {
824 s->status = FINISH_STATE;
825 }
826 if (bstate == need_more || bstate == finish_started) {
827 if (strm->avail_out == 0) {
828 s->last_flush = -1;
829 }
830 return Z_OK;
831
832
833
834
835
836
837
838 }
839 if (bstate == block_done) {
840 if (flush == Z_PARTIAL_FLUSH) {
841 _tr_align(s);
842 } else if (flush != Z_BLOCK) {
843 _tr_stored_block(s, (char*)0, 0L, 0);
844
845
846
847 if (flush == Z_FULL_FLUSH) {
848 CLEAR_HASH(s);
849 if (s->lookahead == 0) {
850 s->strstart = 0;
851 s->block_start = 0L;
852 }
853 }
854 }
855 flush_pending(strm);
856 if (strm->avail_out == 0) {
857 s->last_flush = -1;
858 return Z_OK;
859 }
860 }
861 }
862 Assert(strm->avail_out > 0, "bug2");
863
864 if (flush != Z_FINISH) return Z_OK;
865 if (s->wrap <= 0) return Z_STREAM_END;
866
867
868#ifdef GZIP
869 if (s->wrap == 2) {
870 put_byte(s, (Byte)(strm->adler & 0xff));
871 put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
872 put_byte(s, (Byte)((strm->adler >> 16) & 0xff));
873 put_byte(s, (Byte)((strm->adler >> 24) & 0xff));
874 put_byte(s, (Byte)(strm->total_in & 0xff));
875 put_byte(s, (Byte)((strm->total_in >> 8) & 0xff));
876 put_byte(s, (Byte)((strm->total_in >> 16) & 0xff));
877 put_byte(s, (Byte)((strm->total_in >> 24) & 0xff));
878 }
879 else
880#endif
881 {
882 putShortMSB(s, (uInt)(strm->adler >> 16));
883 putShortMSB(s, (uInt)(strm->adler & 0xffff));
884 }
885 flush_pending(strm);
886
887
888
889 if (s->wrap > 0) s->wrap = -s->wrap;
890 return s->pending != 0 ? Z_OK : Z_STREAM_END;
891}
892
893
894int ZEXPORT deflateEnd (strm)
895 z_streamp strm;
896{
897 int status;
898
899 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
900
901 status = strm->state->status;
902 if (status != INIT_STATE &&
903 status != EXTRA_STATE &&
904 status != NAME_STATE &&
905 status != COMMENT_STATE &&
906 status != HCRC_STATE &&
907 status != BUSY_STATE &&
908 status != FINISH_STATE) {
909 return Z_STREAM_ERROR;
910 }
911
912
913 TRY_FREE(strm, strm->state->pending_buf);
914 TRY_FREE(strm, strm->state->head);
915 TRY_FREE(strm, strm->state->prev);
916 TRY_FREE(strm, strm->state->window);
917
918 ZFREE(strm, strm->state);
919 strm->state = Z_NULL;
920
921 return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK;
922}
923
924
925
926
927
928
929int ZEXPORT deflateCopy (dest, source)
930 z_streamp dest;
931 z_streamp source;
932{
933#ifdef MAXSEG_64K
934 return Z_STREAM_ERROR;
935#else
936 deflate_state *ds;
937 deflate_state *ss;
938 ushf *overlay;
939
940
941 if (source == Z_NULL || dest == Z_NULL || source->state == Z_NULL) {
942 return Z_STREAM_ERROR;
943 }
944
945 ss = source->state;
946
947 zmemcpy(dest, source, sizeof(z_stream));
948
949 ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state));
950 if (ds == Z_NULL) return Z_MEM_ERROR;
951 dest->state = (struct internal_state FAR *) ds;
952 zmemcpy(ds, ss, sizeof(deflate_state));
953 ds->strm = dest;
954
955 ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));
956 ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos));
957 ds->head = (Posf *) ZALLOC(dest, ds->hash_size, sizeof(Pos));
958 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
959 ds->pending_buf = (uchf *) overlay;
960
961 if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
962 ds->pending_buf == Z_NULL) {
963 deflateEnd (dest);
964 return Z_MEM_ERROR;
965 }
966
967 zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));
968 zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));
969 zmemcpy(ds->head, ss->head, ds->hash_size * sizeof(Pos));
970 zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);
971
972 ds->pending_out = ds->pending_buf + (ss->pending_out - ss->pending_buf);
973 ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);
974 ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;
975
976 ds->l_desc.dyn_tree = ds->dyn_ltree;
977 ds->d_desc.dyn_tree = ds->dyn_dtree;
978 ds->bl_desc.dyn_tree = ds->bl_tree;
979
980 return Z_OK;
981#endif
982}
983
984
985
986
987
988
989
990
991local int read_buf(strm, buf, size)
992 z_streamp strm;
993 Bytef *buf;
994 unsigned size;
995{
996 unsigned len = strm->avail_in;
997
998 if (len > size) len = size;
999 if (len == 0) return 0;
1000
1001 strm->avail_in -= len;
1002
1003 if (strm->state->wrap == 1) {
1004 strm->adler = adler32(strm->adler, strm->next_in, len);
1005 }
1006#ifdef GZIP
1007 else if (strm->state->wrap == 2) {
1008 strm->adler = crc32(strm->adler, strm->next_in, len);
1009 }
1010#endif
1011 zmemcpy(buf, strm->next_in, len);
1012 strm->next_in += len;
1013 strm->total_in += len;
1014
1015 return (int)len;
1016}
1017
1018
1019
1020
1021local void lm_init (s)
1022 deflate_state *s;
1023{
1024 s->window_size = (ulg)2L*s->w_size;
1025
1026 CLEAR_HASH(s);
1027
1028
1029
1030 s->max_lazy_match = configuration_table[s->level].max_lazy;
1031 s->good_match = configuration_table[s->level].good_length;
1032 s->nice_match = configuration_table[s->level].nice_length;
1033 s->max_chain_length = configuration_table[s->level].max_chain;
1034
1035 s->strstart = 0;
1036 s->block_start = 0L;
1037 s->lookahead = 0;
1038 s->match_length = s->prev_length = MIN_MATCH-1;
1039 s->match_available = 0;
1040 s->ins_h = 0;
1041#ifndef FASTEST
1042#ifdef ASMV
1043 match_init();
1044#endif
1045#endif
1046}
1047
1048#ifndef FASTEST
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058#ifndef ASMV
1059
1060
1061
1062local uInt longest_match(s, cur_match)
1063 deflate_state *s;
1064 IPos cur_match;
1065{
1066 unsigned chain_length = s->max_chain_length;
1067 register Bytef *scan = s->window + s->strstart;
1068 register Bytef *match;
1069 register int len;
1070 int best_len = s->prev_length;
1071 int nice_match = s->nice_match;
1072 IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
1073 s->strstart - (IPos)MAX_DIST(s) : NIL;
1074
1075
1076
1077 Posf *prev = s->prev;
1078 uInt wmask = s->w_mask;
1079
1080#ifdef UNALIGNED_OK
1081
1082
1083
1084 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1085 register ush scan_start = *(ushf*)scan;
1086 register ush scan_end = *(ushf*)(scan+best_len-1);
1087#else
1088 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1089 register Byte scan_end1 = scan[best_len-1];
1090 register Byte scan_end = scan[best_len];
1091#endif
1092
1093
1094
1095
1096 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1097
1098
1099 if (s->prev_length >= s->good_match) {
1100 chain_length >>= 2;
1101 }
1102
1103
1104
1105 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1106
1107 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1108
1109 do {
1110 Assert(cur_match < s->strstart, "no future");
1111 match = s->window + cur_match;
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1122
1123
1124
1125 if (*(ushf*)(match+best_len-1) != scan_end ||
1126 *(ushf*)match != scan_start) continue;
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137 Assert(scan[2] == match[2], "scan[2]?");
1138 scan++, match++;
1139 do {
1140 } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1141 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1142 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1143 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
1144 scan < strend);
1145
1146
1147
1148 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1149 if (*scan == *match) scan++;
1150
1151 len = (MAX_MATCH - 1) - (int)(strend-scan);
1152 scan = strend - (MAX_MATCH-1);
1153
1154#else
1155
1156 if (match[best_len] != scan_end ||
1157 match[best_len-1] != scan_end1 ||
1158 *match != *scan ||
1159 *++match != scan[1]) continue;
1160
1161
1162
1163
1164
1165
1166
1167 scan += 2, match++;
1168 Assert(*scan == *match, "match[2]?");
1169
1170
1171
1172
1173 do {
1174 } while (*++scan == *++match && *++scan == *++match &&
1175 *++scan == *++match && *++scan == *++match &&
1176 *++scan == *++match && *++scan == *++match &&
1177 *++scan == *++match && *++scan == *++match &&
1178 scan < strend);
1179
1180 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1181
1182 len = MAX_MATCH - (int)(strend - scan);
1183 scan = strend - MAX_MATCH;
1184
1185#endif
1186
1187 if (len > best_len) {
1188 s->match_start = cur_match;
1189 best_len = len;
1190 if (len >= nice_match) break;
1191#ifdef UNALIGNED_OK
1192 scan_end = *(ushf*)(scan+best_len-1);
1193#else
1194 scan_end1 = scan[best_len-1];
1195 scan_end = scan[best_len];
1196#endif
1197 }
1198 } while ((cur_match = prev[cur_match & wmask]) > limit
1199 && --chain_length != 0);
1200
1201 if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
1202 return s->lookahead;
1203}
1204#endif
1205
1206#else
1207
1208
1209
1210
1211local uInt longest_match(s, cur_match)
1212 deflate_state *s;
1213 IPos cur_match;
1214{
1215 register Bytef *scan = s->window + s->strstart;
1216 register Bytef *match;
1217 register int len;
1218 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1219
1220
1221
1222
1223 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1224
1225 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1226
1227 Assert(cur_match < s->strstart, "no future");
1228
1229 match = s->window + cur_match;
1230
1231
1232
1233 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1234
1235
1236
1237
1238
1239
1240
1241 scan += 2, match += 2;
1242 Assert(*scan == *match, "match[2]?");
1243
1244
1245
1246
1247 do {
1248 } while (*++scan == *++match && *++scan == *++match &&
1249 *++scan == *++match && *++scan == *++match &&
1250 *++scan == *++match && *++scan == *++match &&
1251 *++scan == *++match && *++scan == *++match &&
1252 scan < strend);
1253
1254 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
1255
1256 len = MAX_MATCH - (int)(strend - scan);
1257
1258 if (len < MIN_MATCH) return MIN_MATCH - 1;
1259
1260 s->match_start = cur_match;
1261 return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;
1262}
1263
1264#endif
1265
1266#ifdef DEBUG
1267
1268
1269
1270local void check_match(s, start, match, length)
1271 deflate_state *s;
1272 IPos start, match;
1273 int length;
1274{
1275
1276 if (zmemcmp(s->window + match,
1277 s->window + start, length) != EQUAL) {
1278 fprintf(stderr, " start %u, match %u, length %d\n",
1279 start, match, length);
1280 do {
1281 fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);
1282 } while (--length != 0);
1283 z_error("invalid match");
1284 }
1285 if (z_verbose > 1) {
1286 fprintf(stderr,"\\[%d,%d]", start-match, length);
1287 do { putc(s->window[start++], stderr); } while (--length != 0);
1288 }
1289}
1290#else
1291# define check_match(s, start, match, length)
1292#endif
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304local void fill_window(s)
1305 deflate_state *s;
1306{
1307 register unsigned n, m;
1308 register Posf *p;
1309 unsigned more;
1310 uInt wsize = s->w_size;
1311
1312 do {
1313 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1314
1315
1316 if (sizeof(int) <= 2) {
1317 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1318 more = wsize;
1319
1320 } else if (more == (unsigned)(-1)) {
1321
1322
1323
1324 more--;
1325 }
1326 }
1327
1328
1329
1330
1331 if (s->strstart >= wsize+MAX_DIST(s)) {
1332
1333 zmemcpy(s->window, s->window+wsize, (unsigned)wsize);
1334 s->match_start -= wsize;
1335 s->strstart -= wsize;
1336 s->block_start -= (long) wsize;
1337
1338
1339
1340
1341
1342
1343
1344 n = s->hash_size;
1345 p = &s->head[n];
1346 do {
1347 m = *--p;
1348 *p = (Pos)(m >= wsize ? m-wsize : NIL);
1349 } while (--n);
1350
1351 n = wsize;
1352#ifndef FASTEST
1353 p = &s->prev[n];
1354 do {
1355 m = *--p;
1356 *p = (Pos)(m >= wsize ? m-wsize : NIL);
1357
1358
1359
1360 } while (--n);
1361#endif
1362 more += wsize;
1363 }
1364 if (s->strm->avail_in == 0) return;
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377 Assert(more >= 2, "more < 2");
1378
1379 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1380 s->lookahead += n;
1381
1382
1383 if (s->lookahead >= MIN_MATCH) {
1384 s->ins_h = s->window[s->strstart];
1385 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1386#if MIN_MATCH != 3
1387 Call UPDATE_HASH() MIN_MATCH-3 more times
1388#endif
1389 }
1390
1391
1392
1393
1394 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
1395
1396
1397
1398
1399
1400
1401
1402
1403 if (s->high_water < s->window_size) {
1404 ulg curr = s->strstart + (ulg)(s->lookahead);
1405 ulg init;
1406
1407 if (s->high_water < curr) {
1408
1409
1410
1411 init = s->window_size - curr;
1412 if (init > WIN_INIT)
1413 init = WIN_INIT;
1414 zmemzero(s->window + curr, (unsigned)init);
1415 s->high_water = curr + init;
1416 }
1417 else if (s->high_water < (ulg)curr + WIN_INIT) {
1418
1419
1420
1421
1422 init = (ulg)curr + WIN_INIT - s->high_water;
1423 if (init > s->window_size - s->high_water)
1424 init = s->window_size - s->high_water;
1425 zmemzero(s->window + s->high_water, (unsigned)init);
1426 s->high_water += init;
1427 }
1428 }
1429}
1430
1431
1432
1433
1434
1435#define FLUSH_BLOCK_ONLY(s, last) { \
1436 _tr_flush_block(s, (s->block_start >= 0L ? \
1437 (charf *)&s->window[(unsigned)s->block_start] : \
1438 (charf *)Z_NULL), \
1439 (ulg)((long)s->strstart - s->block_start), \
1440 (last)); \
1441 s->block_start = s->strstart; \
1442 flush_pending(s->strm); \
1443 Tracev((stderr,"[FLUSH]")); \
1444}
1445
1446
1447#define FLUSH_BLOCK(s, last) { \
1448 FLUSH_BLOCK_ONLY(s, last); \
1449 if (s->strm->avail_out == 0) return (last) ? finish_started : need_more; \
1450}
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461local block_state deflate_stored(s, flush)
1462 deflate_state *s;
1463 int flush;
1464{
1465
1466
1467
1468 ulg max_block_size = 0xffff;
1469 ulg max_start;
1470
1471 if (max_block_size > s->pending_buf_size - 5) {
1472 max_block_size = s->pending_buf_size - 5;
1473 }
1474
1475
1476 for (;;) {
1477
1478 if (s->lookahead <= 1) {
1479
1480 Assert(s->strstart < s->w_size+MAX_DIST(s) ||
1481 s->block_start >= (long)s->w_size, "slide too late");
1482
1483 fill_window(s);
1484 if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more;
1485
1486 if (s->lookahead == 0) break;
1487 }
1488 Assert(s->block_start >= 0L, "block gone");
1489
1490 s->strstart += s->lookahead;
1491 s->lookahead = 0;
1492
1493
1494 max_start = s->block_start + max_block_size;
1495 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
1496
1497 s->lookahead = (uInt)(s->strstart - max_start);
1498 s->strstart = (uInt)max_start;
1499 FLUSH_BLOCK(s, 0);
1500 }
1501
1502
1503
1504 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1505 FLUSH_BLOCK(s, 0);
1506 }
1507 }
1508 FLUSH_BLOCK(s, flush == Z_FINISH);
1509 return flush == Z_FINISH ? finish_done : block_done;
1510}
1511
1512
1513
1514
1515
1516
1517
1518
1519local block_state deflate_fast(s, flush)
1520 deflate_state *s;
1521 int flush;
1522{
1523 IPos hash_head;
1524 int bflush;
1525
1526 for (;;) {
1527
1528
1529
1530
1531
1532 if (s->lookahead < MIN_LOOKAHEAD) {
1533 fill_window(s);
1534 if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
1535 return need_more;
1536 }
1537 if (s->lookahead == 0) break;
1538 }
1539
1540
1541
1542
1543 hash_head = NIL;
1544 if (s->lookahead >= MIN_MATCH) {
1545 INSERT_STRING(s, s->strstart, hash_head);
1546 }
1547
1548
1549
1550
1551 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
1552
1553
1554
1555
1556 s->match_length = longest_match (s, hash_head);
1557
1558 }
1559 if (s->match_length >= MIN_MATCH) {
1560 check_match(s, s->strstart, s->match_start, s->match_length);
1561
1562 _tr_tally_dist(s, s->strstart - s->match_start,
1563 s->match_length - MIN_MATCH, bflush);
1564
1565 s->lookahead -= s->match_length;
1566
1567
1568
1569
1570#ifndef FASTEST
1571 if (s->match_length <= s->max_insert_length &&
1572 s->lookahead >= MIN_MATCH) {
1573 s->match_length--;
1574 do {
1575 s->strstart++;
1576 INSERT_STRING(s, s->strstart, hash_head);
1577
1578
1579
1580 } while (--s->match_length != 0);
1581 s->strstart++;
1582 } else
1583#endif
1584 {
1585 s->strstart += s->match_length;
1586 s->match_length = 0;
1587 s->ins_h = s->window[s->strstart];
1588 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1589#if MIN_MATCH != 3
1590 Call UPDATE_HASH() MIN_MATCH-3 more times
1591#endif
1592
1593
1594
1595 }
1596 } else {
1597
1598 Tracevv((stderr,"%c", s->window[s->strstart]));
1599 _tr_tally_lit (s, s->window[s->strstart], bflush);
1600 s->lookahead--;
1601 s->strstart++;
1602 }
1603 if (bflush) FLUSH_BLOCK(s, 0);
1604 }
1605 FLUSH_BLOCK(s, flush == Z_FINISH);
1606 return flush == Z_FINISH ? finish_done : block_done;
1607}
1608
1609#ifndef FASTEST
1610
1611
1612
1613
1614
1615local block_state deflate_slow(s, flush)
1616 deflate_state *s;
1617 int flush;
1618{
1619 IPos hash_head;
1620 int bflush;
1621
1622
1623 for (;;) {
1624
1625
1626
1627
1628
1629 if (s->lookahead < MIN_LOOKAHEAD) {
1630 fill_window(s);
1631 if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
1632 return need_more;
1633 }
1634 if (s->lookahead == 0) break;
1635 }
1636
1637
1638
1639
1640 hash_head = NIL;
1641 if (s->lookahead >= MIN_MATCH) {
1642 INSERT_STRING(s, s->strstart, hash_head);
1643 }
1644
1645
1646
1647 s->prev_length = s->match_length, s->prev_match = s->match_start;
1648 s->match_length = MIN_MATCH-1;
1649
1650 if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
1651 s->strstart - hash_head <= MAX_DIST(s)) {
1652
1653
1654
1655
1656 s->match_length = longest_match (s, hash_head);
1657
1658
1659 if (s->match_length <= 5 && (s->strategy == Z_FILTERED
1660#if TOO_FAR <= 32767
1661 || (s->match_length == MIN_MATCH &&
1662 s->strstart - s->match_start > TOO_FAR)
1663#endif
1664 )) {
1665
1666
1667
1668
1669 s->match_length = MIN_MATCH-1;
1670 }
1671 }
1672
1673
1674
1675 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1676 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1677
1678
1679 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1680
1681 _tr_tally_dist(s, s->strstart -1 - s->prev_match,
1682 s->prev_length - MIN_MATCH, bflush);
1683
1684
1685
1686
1687
1688
1689 s->lookahead -= s->prev_length-1;
1690 s->prev_length -= 2;
1691 do {
1692 if (++s->strstart <= max_insert) {
1693 INSERT_STRING(s, s->strstart, hash_head);
1694 }
1695 } while (--s->prev_length != 0);
1696 s->match_available = 0;
1697 s->match_length = MIN_MATCH-1;
1698 s->strstart++;
1699
1700 if (bflush) FLUSH_BLOCK(s, 0);
1701
1702 } else if (s->match_available) {
1703
1704
1705
1706
1707 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1708 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1709 if (bflush) {
1710 FLUSH_BLOCK_ONLY(s, 0);
1711 }
1712 s->strstart++;
1713 s->lookahead--;
1714 if (s->strm->avail_out == 0) return need_more;
1715 } else {
1716
1717
1718
1719 s->match_available = 1;
1720 s->strstart++;
1721 s->lookahead--;
1722 }
1723 }
1724 Assert (flush != Z_NO_FLUSH, "no flush?");
1725 if (s->match_available) {
1726 Tracevv((stderr,"%c", s->window[s->strstart-1]));
1727 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
1728 s->match_available = 0;
1729 }
1730 FLUSH_BLOCK(s, flush == Z_FINISH);
1731 return flush == Z_FINISH ? finish_done : block_done;
1732}
1733#endif
1734
1735
1736
1737
1738
1739
1740local block_state deflate_rle(s, flush)
1741 deflate_state *s;
1742 int flush;
1743{
1744 int bflush;
1745 uInt prev;
1746 Bytef *scan, *strend;
1747
1748 for (;;) {
1749
1750
1751
1752
1753 if (s->lookahead < MAX_MATCH) {
1754 fill_window(s);
1755 if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {
1756 return need_more;
1757 }
1758 if (s->lookahead == 0) break;
1759 }
1760
1761
1762 s->match_length = 0;
1763 if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1764 scan = s->window + s->strstart - 1;
1765 prev = *scan;
1766 if (prev == *++scan && prev == *++scan && prev == *++scan) {
1767 strend = s->window + s->strstart + MAX_MATCH;
1768 do {
1769 } while (prev == *++scan && prev == *++scan &&
1770 prev == *++scan && prev == *++scan &&
1771 prev == *++scan && prev == *++scan &&
1772 prev == *++scan && prev == *++scan &&
1773 scan < strend);
1774 s->match_length = MAX_MATCH - (int)(strend - scan);
1775 if (s->match_length > s->lookahead)
1776 s->match_length = s->lookahead;
1777 }
1778 }
1779
1780
1781 if (s->match_length >= MIN_MATCH) {
1782 check_match(s, s->strstart, s->strstart - 1, s->match_length);
1783
1784 _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);
1785
1786 s->lookahead -= s->match_length;
1787 s->strstart += s->match_length;
1788 s->match_length = 0;
1789 } else {
1790
1791 Tracevv((stderr,"%c", s->window[s->strstart]));
1792 _tr_tally_lit (s, s->window[s->strstart], bflush);
1793 s->lookahead--;
1794 s->strstart++;
1795 }
1796 if (bflush) FLUSH_BLOCK(s, 0);
1797 }
1798 FLUSH_BLOCK(s, flush == Z_FINISH);
1799 return flush == Z_FINISH ? finish_done : block_done;
1800}
1801
1802
1803
1804
1805
1806local block_state deflate_huff(s, flush)
1807 deflate_state *s;
1808 int flush;
1809{
1810 int bflush;
1811
1812 for (;;) {
1813
1814 if (s->lookahead == 0) {
1815 fill_window(s);
1816 if (s->lookahead == 0) {
1817 if (flush == Z_NO_FLUSH)
1818 return need_more;
1819 break;
1820 }
1821 }
1822
1823
1824 s->match_length = 0;
1825 Tracevv((stderr,"%c", s->window[s->strstart]));
1826 _tr_tally_lit (s, s->window[s->strstart], bflush);
1827 s->lookahead--;
1828 s->strstart++;
1829 if (bflush) FLUSH_BLOCK(s, 0);
1830 }
1831 FLUSH_BLOCK(s, flush == Z_FINISH);
1832 return flush == Z_FINISH ? finish_done : block_done;
1833}
1834