dbf-halloween2015

annotate libs/zlib/deflate.c @ 1:c3f5c32cb210

find changesets by author, revision, files, or words in the commit message
barfed all the libraries in the source tree to make porting easier
author John Tsiombikas <nuclear@member.fsf.org>
date Sun, 01 Nov 2015 00:36:56 +0200
parents
children
rev   line source
nuclear@1 1 /* deflate.c -- compress data using the deflation algorithm
nuclear@1 2 * Copyright (C) 1995-2005 Jean-loup Gailly.
nuclear@1 3 * For conditions of distribution and use, see copyright notice in zlib.h
nuclear@1 4 */
nuclear@1 5
nuclear@1 6 /*
nuclear@1 7 * ALGORITHM
nuclear@1 8 *
nuclear@1 9 * The "deflation" process depends on being able to identify portions
nuclear@1 10 * of the input text which are identical to earlier input (within a
nuclear@1 11 * sliding window trailing behind the input currently being processed).
nuclear@1 12 *
nuclear@1 13 * The most straightforward technique turns out to be the fastest for
nuclear@1 14 * most input files: try all possible matches and select the longest.
nuclear@1 15 * The key feature of this algorithm is that insertions into the string
nuclear@1 16 * dictionary are very simple and thus fast, and deletions are avoided
nuclear@1 17 * completely. Insertions are performed at each input character, whereas
nuclear@1 18 * string matches are performed only when the previous match ends. So it
nuclear@1 19 * is preferable to spend more time in matches to allow very fast string
nuclear@1 20 * insertions and avoid deletions. The matching algorithm for small
nuclear@1 21 * strings is inspired from that of Rabin & Karp. A brute force approach
nuclear@1 22 * is used to find longer strings when a small match has been found.
nuclear@1 23 * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze
nuclear@1 24 * (by Leonid Broukhis).
nuclear@1 25 * A previous version of this file used a more sophisticated algorithm
nuclear@1 26 * (by Fiala and Greene) which is guaranteed to run in linear amortized
nuclear@1 27 * time, but has a larger average cost, uses more memory and is patented.
nuclear@1 28 * However the F&G algorithm may be faster for some highly redundant
nuclear@1 29 * files if the parameter max_chain_length (described below) is too large.
nuclear@1 30 *
nuclear@1 31 * ACKNOWLEDGEMENTS
nuclear@1 32 *
nuclear@1 33 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
nuclear@1 34 * I found it in 'freeze' written by Leonid Broukhis.
nuclear@1 35 * Thanks to many people for bug reports and testing.
nuclear@1 36 *
nuclear@1 37 * REFERENCES
nuclear@1 38 *
nuclear@1 39 * Deutsch, L.P.,"DEFLATE Compressed Data Format Specification".
nuclear@1 40 * Available in http://www.ietf.org/rfc/rfc1951.txt
nuclear@1 41 *
nuclear@1 42 * A description of the Rabin and Karp algorithm is given in the book
nuclear@1 43 * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
nuclear@1 44 *
nuclear@1 45 * Fiala,E.R., and Greene,D.H.
nuclear@1 46 * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595
nuclear@1 47 *
nuclear@1 48 */
nuclear@1 49
nuclear@1 50 /* @(#) $Id$ */
nuclear@1 51
nuclear@1 52 #include "deflate.h"
nuclear@1 53
nuclear@1 54 const char deflate_copyright[] =
nuclear@1 55 " deflate 1.2.3 Copyright 1995-2005 Jean-loup Gailly ";
nuclear@1 56 /*
nuclear@1 57 If you use the zlib library in a product, an acknowledgment is welcome
nuclear@1 58 in the documentation of your product. If for some reason you cannot
nuclear@1 59 include such an acknowledgment, I would appreciate that you keep this
nuclear@1 60 copyright string in the executable of your product.
nuclear@1 61 */
nuclear@1 62
nuclear@1 63 /* ===========================================================================
nuclear@1 64 * Function prototypes.
nuclear@1 65 */
nuclear@1 66 typedef enum {
nuclear@1 67 need_more, /* block not completed, need more input or more output */
nuclear@1 68 block_done, /* block flush performed */
nuclear@1 69 finish_started, /* finish started, need only more output at next deflate */
nuclear@1 70 finish_done /* finish done, accept no more input or output */
nuclear@1 71 } block_state;
nuclear@1 72
nuclear@1 73 typedef block_state (*compress_func) OF((deflate_state *s, int flush));
nuclear@1 74 /* Compression function. Returns the block state after the call. */
nuclear@1 75
nuclear@1 76 local void fill_window OF((deflate_state *s));
nuclear@1 77 local block_state deflate_stored OF((deflate_state *s, int flush));
nuclear@1 78 local block_state deflate_fast OF((deflate_state *s, int flush));
nuclear@1 79 #ifndef FASTEST
nuclear@1 80 local block_state deflate_slow OF((deflate_state *s, int flush));
nuclear@1 81 #endif
nuclear@1 82 local void lm_init OF((deflate_state *s));
nuclear@1 83 local void putShortMSB OF((deflate_state *s, uInt b));
nuclear@1 84 local void flush_pending OF((z_streamp strm));
nuclear@1 85 local int read_buf OF((z_streamp strm, Bytef *buf, unsigned size));
nuclear@1 86 #ifndef FASTEST
nuclear@1 87 #ifdef ASMV
nuclear@1 88 void match_init OF((void)); /* asm code initialization */
nuclear@1 89 uInt longest_match OF((deflate_state *s, IPos cur_match));
nuclear@1 90 #else
nuclear@1 91 local uInt longest_match OF((deflate_state *s, IPos cur_match));
nuclear@1 92 #endif
nuclear@1 93 #endif
nuclear@1 94 local uInt longest_match_fast OF((deflate_state *s, IPos cur_match));
nuclear@1 95
nuclear@1 96 #ifdef DEBUG
nuclear@1 97 local void check_match OF((deflate_state *s, IPos start, IPos match,
nuclear@1 98 int length));
nuclear@1 99 #endif
nuclear@1 100
nuclear@1 101 /* ===========================================================================
nuclear@1 102 * Local data
nuclear@1 103 */
nuclear@1 104
nuclear@1 105 #define NIL 0
nuclear@1 106 /* Tail of hash chains */
nuclear@1 107
nuclear@1 108 #ifndef TOO_FAR
nuclear@1 109 # define TOO_FAR 4096
nuclear@1 110 #endif
nuclear@1 111 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
nuclear@1 112
nuclear@1 113 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
nuclear@1 114 /* Minimum amount of lookahead, except at the end of the input file.
nuclear@1 115 * See deflate.c for comments about the MIN_MATCH+1.
nuclear@1 116 */
nuclear@1 117
nuclear@1 118 /* Values for max_lazy_match, good_match and max_chain_length, depending on
nuclear@1 119 * the desired pack level (0..9). The values given below have been tuned to
nuclear@1 120 * exclude worst case performance for pathological files. Better values may be
nuclear@1 121 * found for specific files.
nuclear@1 122 */
nuclear@1 123 typedef struct config_s {
nuclear@1 124 ush good_length; /* reduce lazy search above this match length */
nuclear@1 125 ush max_lazy; /* do not perform lazy search above this match length */
nuclear@1 126 ush nice_length; /* quit search above this match length */
nuclear@1 127 ush max_chain;
nuclear@1 128 compress_func func;
nuclear@1 129 } config;
nuclear@1 130
nuclear@1 131 #ifdef FASTEST
nuclear@1 132 local const config configuration_table[2] = {
nuclear@1 133 /* good lazy nice chain */
nuclear@1 134 /* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */
nuclear@1 135 /* 1 */ {4, 4, 8, 4, deflate_fast}}; /* max speed, no lazy matches */
nuclear@1 136 #else
nuclear@1 137 local const config configuration_table[10] = {
nuclear@1 138 /* good lazy nice chain */
nuclear@1 139 /* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */
nuclear@1 140 /* 1 */ {4, 4, 8, 4, deflate_fast}, /* max speed, no lazy matches */
nuclear@1 141 /* 2 */ {4, 5, 16, 8, deflate_fast},
nuclear@1 142 /* 3 */ {4, 6, 32, 32, deflate_fast},
nuclear@1 143
nuclear@1 144 /* 4 */ {4, 4, 16, 16, deflate_slow}, /* lazy matches */
nuclear@1 145 /* 5 */ {8, 16, 32, 32, deflate_slow},
nuclear@1 146 /* 6 */ {8, 16, 128, 128, deflate_slow},
nuclear@1 147 /* 7 */ {8, 32, 128, 256, deflate_slow},
nuclear@1 148 /* 8 */ {32, 128, 258, 1024, deflate_slow},
nuclear@1 149 /* 9 */ {32, 258, 258, 4096, deflate_slow}}; /* max compression */
nuclear@1 150 #endif
nuclear@1 151
nuclear@1 152 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
nuclear@1 153 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
nuclear@1 154 * meaning.
nuclear@1 155 */
nuclear@1 156
nuclear@1 157 #define EQUAL 0
nuclear@1 158 /* result of memcmp for equal strings */
nuclear@1 159
nuclear@1 160 #ifndef NO_DUMMY_DECL
nuclear@1 161 struct static_tree_desc_s {int dummy;}; /* for buggy compilers */
nuclear@1 162 #endif
nuclear@1 163
nuclear@1 164 /* ===========================================================================
nuclear@1 165 * Update a hash value with the given input byte
nuclear@1 166 * IN assertion: all calls to to UPDATE_HASH are made with consecutive
nuclear@1 167 * input characters, so that a running hash key can be computed from the
nuclear@1 168 * previous key instead of complete recalculation each time.
nuclear@1 169 */
nuclear@1 170 #define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask)
nuclear@1 171
nuclear@1 172
nuclear@1 173 /* ===========================================================================
nuclear@1 174 * Insert string str in the dictionary and set match_head to the previous head
nuclear@1 175 * of the hash chain (the most recent string with same hash key). Return
nuclear@1 176 * the previous length of the hash chain.
nuclear@1 177 * If this file is compiled with -DFASTEST, the compression level is forced
nuclear@1 178 * to 1, and no hash chains are maintained.
nuclear@1 179 * IN assertion: all calls to to INSERT_STRING are made with consecutive
nuclear@1 180 * input characters and the first MIN_MATCH bytes of str are valid
nuclear@1 181 * (except for the last MIN_MATCH-1 bytes of the input file).
nuclear@1 182 */
nuclear@1 183 #ifdef FASTEST
nuclear@1 184 #define INSERT_STRING(s, str, match_head) \
nuclear@1 185 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
nuclear@1 186 match_head = s->head[s->ins_h], \
nuclear@1 187 s->head[s->ins_h] = (Pos)(str))
nuclear@1 188 #else
nuclear@1 189 #define INSERT_STRING(s, str, match_head) \
nuclear@1 190 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
nuclear@1 191 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
nuclear@1 192 s->head[s->ins_h] = (Pos)(str))
nuclear@1 193 #endif
nuclear@1 194
nuclear@1 195 /* ===========================================================================
nuclear@1 196 * Initialize the hash table (avoiding 64K overflow for 16 bit systems).
nuclear@1 197 * prev[] will be initialized on the fly.
nuclear@1 198 */
nuclear@1 199 #define CLEAR_HASH(s) \
nuclear@1 200 s->head[s->hash_size-1] = NIL; \
nuclear@1 201 zmemzero((Bytef *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));
nuclear@1 202
nuclear@1 203 /* ========================================================================= */
nuclear@1 204 int ZEXPORT deflateInit_(strm, level, version, stream_size)
nuclear@1 205 z_streamp strm;
nuclear@1 206 int level;
nuclear@1 207 const char *version;
nuclear@1 208 int stream_size;
nuclear@1 209 {
nuclear@1 210 return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL,
nuclear@1 211 Z_DEFAULT_STRATEGY, version, stream_size);
nuclear@1 212 /* To do: ignore strm->next_in if we use it as window */
nuclear@1 213 }
nuclear@1 214
nuclear@1 215 /* ========================================================================= */
nuclear@1 216 int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy,
nuclear@1 217 version, stream_size)
nuclear@1 218 z_streamp strm;
nuclear@1 219 int level;
nuclear@1 220 int method;
nuclear@1 221 int windowBits;
nuclear@1 222 int memLevel;
nuclear@1 223 int strategy;
nuclear@1 224 const char *version;
nuclear@1 225 int stream_size;
nuclear@1 226 {
nuclear@1 227 deflate_state *s;
nuclear@1 228 int wrap = 1;
nuclear@1 229 static const char my_version[] = ZLIB_VERSION;
nuclear@1 230
nuclear@1 231 ushf *overlay;
nuclear@1 232 /* We overlay pending_buf and d_buf+l_buf. This works since the average
nuclear@1 233 * output size for (length,distance) codes is <= 24 bits.
nuclear@1 234 */
nuclear@1 235
nuclear@1 236 if (version == Z_NULL || version[0] != my_version[0] ||
nuclear@1 237 stream_size != sizeof(z_stream)) {
nuclear@1 238 return Z_VERSION_ERROR;
nuclear@1 239 }
nuclear@1 240 if (strm == Z_NULL) return Z_STREAM_ERROR;
nuclear@1 241
nuclear@1 242 strm->msg = Z_NULL;
nuclear@1 243 if (strm->zalloc == (alloc_func)0) {
nuclear@1 244 strm->zalloc = zcalloc;
nuclear@1 245 strm->opaque = (voidpf)0;
nuclear@1 246 }
nuclear@1 247 if (strm->zfree == (free_func)0) strm->zfree = zcfree;
nuclear@1 248
nuclear@1 249 #ifdef FASTEST
nuclear@1 250 if (level != 0) level = 1;
nuclear@1 251 #else
nuclear@1 252 if (level == Z_DEFAULT_COMPRESSION) level = 6;
nuclear@1 253 #endif
nuclear@1 254
nuclear@1 255 if (windowBits < 0) { /* suppress zlib wrapper */
nuclear@1 256 wrap = 0;
nuclear@1 257 windowBits = -windowBits;
nuclear@1 258 }
nuclear@1 259 #ifdef GZIP
nuclear@1 260 else if (windowBits > 15) {
nuclear@1 261 wrap = 2; /* write gzip wrapper instead */
nuclear@1 262 windowBits -= 16;
nuclear@1 263 }
nuclear@1 264 #endif
nuclear@1 265 if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED ||
nuclear@1 266 windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
nuclear@1 267 strategy < 0 || strategy > Z_FIXED) {
nuclear@1 268 return Z_STREAM_ERROR;
nuclear@1 269 }
nuclear@1 270 if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */
nuclear@1 271 s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state));
nuclear@1 272 if (s == Z_NULL) return Z_MEM_ERROR;
nuclear@1 273 strm->state = (struct internal_state FAR *)s;
nuclear@1 274 s->strm = strm;
nuclear@1 275
nuclear@1 276 s->wrap = wrap;
nuclear@1 277 s->gzhead = Z_NULL;
nuclear@1 278 s->w_bits = windowBits;
nuclear@1 279 s->w_size = 1 << s->w_bits;
nuclear@1 280 s->w_mask = s->w_size - 1;
nuclear@1 281
nuclear@1 282 s->hash_bits = memLevel + 7;
nuclear@1 283 s->hash_size = 1 << s->hash_bits;
nuclear@1 284 s->hash_mask = s->hash_size - 1;
nuclear@1 285 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
nuclear@1 286
nuclear@1 287 s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));
nuclear@1 288 s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos));
nuclear@1 289 s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos));
nuclear@1 290
nuclear@1 291 s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */
nuclear@1 292
nuclear@1 293 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
nuclear@1 294 s->pending_buf = (uchf *) overlay;
nuclear@1 295 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
nuclear@1 296
nuclear@1 297 if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
nuclear@1 298 s->pending_buf == Z_NULL) {
nuclear@1 299 s->status = FINISH_STATE;
nuclear@1 300 strm->msg = (char*)ERR_MSG(Z_MEM_ERROR);
nuclear@1 301 deflateEnd (strm);
nuclear@1 302 return Z_MEM_ERROR;
nuclear@1 303 }
nuclear@1 304 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
nuclear@1 305 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
nuclear@1 306
nuclear@1 307 s->level = level;
nuclear@1 308 s->strategy = strategy;
nuclear@1 309 s->method = (Byte)method;
nuclear@1 310
nuclear@1 311 return deflateReset(strm);
nuclear@1 312 }
nuclear@1 313
nuclear@1 314 /* ========================================================================= */
nuclear@1 315 int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength)
nuclear@1 316 z_streamp strm;
nuclear@1 317 const Bytef *dictionary;
nuclear@1 318 uInt dictLength;
nuclear@1 319 {
nuclear@1 320 deflate_state *s;
nuclear@1 321 uInt length = dictLength;
nuclear@1 322 uInt n;
nuclear@1 323 IPos hash_head = 0;
nuclear@1 324
nuclear@1 325 if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL ||
nuclear@1 326 strm->state->wrap == 2 ||
nuclear@1 327 (strm->state->wrap == 1 && strm->state->status != INIT_STATE))
nuclear@1 328 return Z_STREAM_ERROR;
nuclear@1 329
nuclear@1 330 s = strm->state;
nuclear@1 331 if (s->wrap)
nuclear@1 332 strm->adler = adler32(strm->adler, dictionary, dictLength);
nuclear@1 333
nuclear@1 334 if (length < MIN_MATCH) return Z_OK;
nuclear@1 335 if (length > MAX_DIST(s)) {
nuclear@1 336 length = MAX_DIST(s);
nuclear@1 337 dictionary += dictLength - length; /* use the tail of the dictionary */
nuclear@1 338 }
nuclear@1 339 zmemcpy(s->window, dictionary, length);
nuclear@1 340 s->strstart = length;
nuclear@1 341 s->block_start = (long)length;
nuclear@1 342
nuclear@1 343 /* Insert all strings in the hash table (except for the last two bytes).
nuclear@1 344 * s->lookahead stays null, so s->ins_h will be recomputed at the next
nuclear@1 345 * call of fill_window.
nuclear@1 346 */
nuclear@1 347 s->ins_h = s->window[0];
nuclear@1 348 UPDATE_HASH(s, s->ins_h, s->window[1]);
nuclear@1 349 for (n = 0; n <= length - MIN_MATCH; n++) {
nuclear@1 350 INSERT_STRING(s, n, hash_head);
nuclear@1 351 }
nuclear@1 352 if (hash_head) hash_head = 0; /* to make compiler happy */
nuclear@1 353 return Z_OK;
nuclear@1 354 }
nuclear@1 355
nuclear@1 356 /* ========================================================================= */
nuclear@1 357 int ZEXPORT deflateReset (strm)
nuclear@1 358 z_streamp strm;
nuclear@1 359 {
nuclear@1 360 deflate_state *s;
nuclear@1 361
nuclear@1 362 if (strm == Z_NULL || strm->state == Z_NULL ||
nuclear@1 363 strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0) {
nuclear@1 364 return Z_STREAM_ERROR;
nuclear@1 365 }
nuclear@1 366
nuclear@1 367 strm->total_in = strm->total_out = 0;
nuclear@1 368 strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */
nuclear@1 369 strm->data_type = Z_UNKNOWN;
nuclear@1 370
nuclear@1 371 s = (deflate_state *)strm->state;
nuclear@1 372 s->pending = 0;
nuclear@1 373 s->pending_out = s->pending_buf;
nuclear@1 374
nuclear@1 375 if (s->wrap < 0) {
nuclear@1 376 s->wrap = -s->wrap; /* was made negative by deflate(..., Z_FINISH); */
nuclear@1 377 }
nuclear@1 378 s->status = s->wrap ? INIT_STATE : BUSY_STATE;
nuclear@1 379 strm->adler =
nuclear@1 380 #ifdef GZIP
nuclear@1 381 s->wrap == 2 ? crc32(0L, Z_NULL, 0) :
nuclear@1 382 #endif
nuclear@1 383 adler32(0L, Z_NULL, 0);
nuclear@1 384 s->last_flush = Z_NO_FLUSH;
nuclear@1 385
nuclear@1 386 _tr_init(s);
nuclear@1 387 lm_init(s);
nuclear@1 388
nuclear@1 389 return Z_OK;
nuclear@1 390 }
nuclear@1 391
nuclear@1 392 /* ========================================================================= */
nuclear@1 393 int ZEXPORT deflateSetHeader (strm, head)
nuclear@1 394 z_streamp strm;
nuclear@1 395 gz_headerp head;
nuclear@1 396 {
nuclear@1 397 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
nuclear@1 398 if (strm->state->wrap != 2) return Z_STREAM_ERROR;
nuclear@1 399 strm->state->gzhead = head;
nuclear@1 400 return Z_OK;
nuclear@1 401 }
nuclear@1 402
nuclear@1 403 /* ========================================================================= */
nuclear@1 404 int ZEXPORT deflatePrime (strm, bits, value)
nuclear@1 405 z_streamp strm;
nuclear@1 406 int bits;
nuclear@1 407 int value;
nuclear@1 408 {
nuclear@1 409 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
nuclear@1 410 strm->state->bi_valid = bits;
nuclear@1 411 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
nuclear@1 412 return Z_OK;
nuclear@1 413 }
nuclear@1 414
nuclear@1 415 /* ========================================================================= */
nuclear@1 416 int ZEXPORT deflateParams(strm, level, strategy)
nuclear@1 417 z_streamp strm;
nuclear@1 418 int level;
nuclear@1 419 int strategy;
nuclear@1 420 {
nuclear@1 421 deflate_state *s;
nuclear@1 422 compress_func func;
nuclear@1 423 int err = Z_OK;
nuclear@1 424
nuclear@1 425 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
nuclear@1 426 s = strm->state;
nuclear@1 427
nuclear@1 428 #ifdef FASTEST
nuclear@1 429 if (level != 0) level = 1;
nuclear@1 430 #else
nuclear@1 431 if (level == Z_DEFAULT_COMPRESSION) level = 6;
nuclear@1 432 #endif
nuclear@1 433 if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {
nuclear@1 434 return Z_STREAM_ERROR;
nuclear@1 435 }
nuclear@1 436 func = configuration_table[s->level].func;
nuclear@1 437
nuclear@1 438 if (func != configuration_table[level].func && strm->total_in != 0) {
nuclear@1 439 /* Flush the last buffer: */
nuclear@1 440 err = deflate(strm, Z_PARTIAL_FLUSH);
nuclear@1 441 }
nuclear@1 442 if (s->level != level) {
nuclear@1 443 s->level = level;
nuclear@1 444 s->max_lazy_match = configuration_table[level].max_lazy;
nuclear@1 445 s->good_match = configuration_table[level].good_length;
nuclear@1 446 s->nice_match = configuration_table[level].nice_length;
nuclear@1 447 s->max_chain_length = configuration_table[level].max_chain;
nuclear@1 448 }
nuclear@1 449 s->strategy = strategy;
nuclear@1 450 return err;
nuclear@1 451 }
nuclear@1 452
nuclear@1 453 /* ========================================================================= */
nuclear@1 454 int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain)
nuclear@1 455 z_streamp strm;
nuclear@1 456 int good_length;
nuclear@1 457 int max_lazy;
nuclear@1 458 int nice_length;
nuclear@1 459 int max_chain;
nuclear@1 460 {
nuclear@1 461 deflate_state *s;
nuclear@1 462
nuclear@1 463 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
nuclear@1 464 s = strm->state;
nuclear@1 465 s->good_match = good_length;
nuclear@1 466 s->max_lazy_match = max_lazy;
nuclear@1 467 s->nice_match = nice_length;
nuclear@1 468 s->max_chain_length = max_chain;
nuclear@1 469 return Z_OK;
nuclear@1 470 }
nuclear@1 471
nuclear@1 472 /* =========================================================================
nuclear@1 473 * For the default windowBits of 15 and memLevel of 8, this function returns
nuclear@1 474 * a close to exact, as well as small, upper bound on the compressed size.
nuclear@1 475 * They are coded as constants here for a reason--if the #define's are
nuclear@1 476 * changed, then this function needs to be changed as well. The return
nuclear@1 477 * value for 15 and 8 only works for those exact settings.
nuclear@1 478 *
nuclear@1 479 * For any setting other than those defaults for windowBits and memLevel,
nuclear@1 480 * the value returned is a conservative worst case for the maximum expansion
nuclear@1 481 * resulting from using fixed blocks instead of stored blocks, which deflate
nuclear@1 482 * can emit on compressed data for some combinations of the parameters.
nuclear@1 483 *
nuclear@1 484 * This function could be more sophisticated to provide closer upper bounds
nuclear@1 485 * for every combination of windowBits and memLevel, as well as wrap.
nuclear@1 486 * But even the conservative upper bound of about 14% expansion does not
nuclear@1 487 * seem onerous for output buffer allocation.
nuclear@1 488 */
nuclear@1 489 uLong ZEXPORT deflateBound(strm, sourceLen)
nuclear@1 490 z_streamp strm;
nuclear@1 491 uLong sourceLen;
nuclear@1 492 {
nuclear@1 493 deflate_state *s;
nuclear@1 494 uLong destLen;
nuclear@1 495
nuclear@1 496 /* conservative upper bound */
nuclear@1 497 destLen = sourceLen +
nuclear@1 498 ((sourceLen + 7) >> 3) + ((sourceLen + 63) >> 6) + 11;
nuclear@1 499
nuclear@1 500 /* if can't get parameters, return conservative bound */
nuclear@1 501 if (strm == Z_NULL || strm->state == Z_NULL)
nuclear@1 502 return destLen;
nuclear@1 503
nuclear@1 504 /* if not default parameters, return conservative bound */
nuclear@1 505 s = strm->state;
nuclear@1 506 if (s->w_bits != 15 || s->hash_bits != 8 + 7)
nuclear@1 507 return destLen;
nuclear@1 508
nuclear@1 509 /* default settings: return tight bound for that case */
nuclear@1 510 return compressBound(sourceLen);
nuclear@1 511 }
nuclear@1 512
nuclear@1 513 /* =========================================================================
nuclear@1 514 * Put a short in the pending buffer. The 16-bit value is put in MSB order.
nuclear@1 515 * IN assertion: the stream state is correct and there is enough room in
nuclear@1 516 * pending_buf.
nuclear@1 517 */
nuclear@1 518 local void putShortMSB (s, b)
nuclear@1 519 deflate_state *s;
nuclear@1 520 uInt b;
nuclear@1 521 {
nuclear@1 522 put_byte(s, (Byte)(b >> 8));
nuclear@1 523 put_byte(s, (Byte)(b & 0xff));
nuclear@1 524 }
nuclear@1 525
nuclear@1 526 /* =========================================================================
nuclear@1 527 * Flush as much pending output as possible. All deflate() output goes
nuclear@1 528 * through this function so some applications may wish to modify it
nuclear@1 529 * to avoid allocating a large strm->next_out buffer and copying into it.
nuclear@1 530 * (See also read_buf()).
nuclear@1 531 */
nuclear@1 532 local void flush_pending(strm)
nuclear@1 533 z_streamp strm;
nuclear@1 534 {
nuclear@1 535 unsigned len = strm->state->pending;
nuclear@1 536
nuclear@1 537 if (len > strm->avail_out) len = strm->avail_out;
nuclear@1 538 if (len == 0) return;
nuclear@1 539
nuclear@1 540 zmemcpy(strm->next_out, strm->state->pending_out, len);
nuclear@1 541 strm->next_out += len;
nuclear@1 542 strm->state->pending_out += len;
nuclear@1 543 strm->total_out += len;
nuclear@1 544 strm->avail_out -= len;
nuclear@1 545 strm->state->pending -= len;
nuclear@1 546 if (strm->state->pending == 0) {
nuclear@1 547 strm->state->pending_out = strm->state->pending_buf;
nuclear@1 548 }
nuclear@1 549 }
nuclear@1 550
nuclear@1 551 /* ========================================================================= */
nuclear@1 552 int ZEXPORT deflate (strm, flush)
nuclear@1 553 z_streamp strm;
nuclear@1 554 int flush;
nuclear@1 555 {
nuclear@1 556 int old_flush; /* value of flush param for previous deflate call */
nuclear@1 557 deflate_state *s;
nuclear@1 558
nuclear@1 559 if (strm == Z_NULL || strm->state == Z_NULL ||
nuclear@1 560 flush > Z_FINISH || flush < 0) {
nuclear@1 561 return Z_STREAM_ERROR;
nuclear@1 562 }
nuclear@1 563 s = strm->state;
nuclear@1 564
nuclear@1 565 if (strm->next_out == Z_NULL ||
nuclear@1 566 (strm->next_in == Z_NULL && strm->avail_in != 0) ||
nuclear@1 567 (s->status == FINISH_STATE && flush != Z_FINISH)) {
nuclear@1 568 ERR_RETURN(strm, Z_STREAM_ERROR);
nuclear@1 569 }
nuclear@1 570 if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR);
nuclear@1 571
nuclear@1 572 s->strm = strm; /* just in case */
nuclear@1 573 old_flush = s->last_flush;
nuclear@1 574 s->last_flush = flush;
nuclear@1 575
nuclear@1 576 /* Write the header */
nuclear@1 577 if (s->status == INIT_STATE) {
nuclear@1 578 #ifdef GZIP
nuclear@1 579 if (s->wrap == 2) {
nuclear@1 580 strm->adler = crc32(0L, Z_NULL, 0);
nuclear@1 581 put_byte(s, 31);
nuclear@1 582 put_byte(s, 139);
nuclear@1 583 put_byte(s, 8);
nuclear@1 584 if (s->gzhead == NULL) {
nuclear@1 585 put_byte(s, 0);
nuclear@1 586 put_byte(s, 0);
nuclear@1 587 put_byte(s, 0);
nuclear@1 588 put_byte(s, 0);
nuclear@1 589 put_byte(s, 0);
nuclear@1 590 put_byte(s, s->level == 9 ? 2 :
nuclear@1 591 (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
nuclear@1 592 4 : 0));
nuclear@1 593 put_byte(s, OS_CODE);
nuclear@1 594 s->status = BUSY_STATE;
nuclear@1 595 }
nuclear@1 596 else {
nuclear@1 597 put_byte(s, (s->gzhead->text ? 1 : 0) +
nuclear@1 598 (s->gzhead->hcrc ? 2 : 0) +
nuclear@1 599 (s->gzhead->extra == Z_NULL ? 0 : 4) +
nuclear@1 600 (s->gzhead->name == Z_NULL ? 0 : 8) +
nuclear@1 601 (s->gzhead->comment == Z_NULL ? 0 : 16)
nuclear@1 602 );
nuclear@1 603 put_byte(s, (Byte)(s->gzhead->time & 0xff));
nuclear@1 604 put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff));
nuclear@1 605 put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff));
nuclear@1 606 put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff));
nuclear@1 607 put_byte(s, s->level == 9 ? 2 :
nuclear@1 608 (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
nuclear@1 609 4 : 0));
nuclear@1 610 put_byte(s, s->gzhead->os & 0xff);
nuclear@1 611 if (s->gzhead->extra != NULL) {
nuclear@1 612 put_byte(s, s->gzhead->extra_len & 0xff);
nuclear@1 613 put_byte(s, (s->gzhead->extra_len >> 8) & 0xff);
nuclear@1 614 }
nuclear@1 615 if (s->gzhead->hcrc)
nuclear@1 616 strm->adler = crc32(strm->adler, s->pending_buf,
nuclear@1 617 s->pending);
nuclear@1 618 s->gzindex = 0;
nuclear@1 619 s->status = EXTRA_STATE;
nuclear@1 620 }
nuclear@1 621 }
nuclear@1 622 else
nuclear@1 623 #endif
nuclear@1 624 {
nuclear@1 625 uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
nuclear@1 626 uInt level_flags;
nuclear@1 627
nuclear@1 628 if (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2)
nuclear@1 629 level_flags = 0;
nuclear@1 630 else if (s->level < 6)
nuclear@1 631 level_flags = 1;
nuclear@1 632 else if (s->level == 6)
nuclear@1 633 level_flags = 2;
nuclear@1 634 else
nuclear@1 635 level_flags = 3;
nuclear@1 636 header |= (level_flags << 6);
nuclear@1 637 if (s->strstart != 0) header |= PRESET_DICT;
nuclear@1 638 header += 31 - (header % 31);
nuclear@1 639
nuclear@1 640 s->status = BUSY_STATE;
nuclear@1 641 putShortMSB(s, header);
nuclear@1 642
nuclear@1 643 /* Save the adler32 of the preset dictionary: */
nuclear@1 644 if (s->strstart != 0) {
nuclear@1 645 putShortMSB(s, (uInt)(strm->adler >> 16));
nuclear@1 646 putShortMSB(s, (uInt)(strm->adler & 0xffff));
nuclear@1 647 }
nuclear@1 648 strm->adler = adler32(0L, Z_NULL, 0);
nuclear@1 649 }
nuclear@1 650 }
nuclear@1 651 #ifdef GZIP
nuclear@1 652 if (s->status == EXTRA_STATE) {
nuclear@1 653 if (s->gzhead->extra != NULL) {
nuclear@1 654 uInt beg = s->pending; /* start of bytes to update crc */
nuclear@1 655
nuclear@1 656 while (s->gzindex < (s->gzhead->extra_len & 0xffff)) {
nuclear@1 657 if (s->pending == s->pending_buf_size) {
nuclear@1 658 if (s->gzhead->hcrc && s->pending > beg)
nuclear@1 659 strm->adler = crc32(strm->adler, s->pending_buf + beg,
nuclear@1 660 s->pending - beg);
nuclear@1 661 flush_pending(strm);
nuclear@1 662 beg = s->pending;
nuclear@1 663 if (s->pending == s->pending_buf_size)
nuclear@1 664 break;
nuclear@1 665 }
nuclear@1 666 put_byte(s, s->gzhead->extra[s->gzindex]);
nuclear@1 667 s->gzindex++;
nuclear@1 668 }
nuclear@1 669 if (s->gzhead->hcrc && s->pending > beg)
nuclear@1 670 strm->adler = crc32(strm->adler, s->pending_buf + beg,
nuclear@1 671 s->pending - beg);
nuclear@1 672 if (s->gzindex == s->gzhead->extra_len) {
nuclear@1 673 s->gzindex = 0;
nuclear@1 674 s->status = NAME_STATE;
nuclear@1 675 }
nuclear@1 676 }
nuclear@1 677 else
nuclear@1 678 s->status = NAME_STATE;
nuclear@1 679 }
nuclear@1 680 if (s->status == NAME_STATE) {
nuclear@1 681 if (s->gzhead->name != NULL) {
nuclear@1 682 uInt beg = s->pending; /* start of bytes to update crc */
nuclear@1 683 int val;
nuclear@1 684
nuclear@1 685 do {
nuclear@1 686 if (s->pending == s->pending_buf_size) {
nuclear@1 687 if (s->gzhead->hcrc && s->pending > beg)
nuclear@1 688 strm->adler = crc32(strm->adler, s->pending_buf + beg,
nuclear@1 689 s->pending - beg);
nuclear@1 690 flush_pending(strm);
nuclear@1 691 beg = s->pending;
nuclear@1 692 if (s->pending == s->pending_buf_size) {
nuclear@1 693 val = 1;
nuclear@1 694 break;
nuclear@1 695 }
nuclear@1 696 }
nuclear@1 697 val = s->gzhead->name[s->gzindex++];
nuclear@1 698 put_byte(s, val);
nuclear@1 699 } while (val != 0);
nuclear@1 700 if (s->gzhead->hcrc && s->pending > beg)
nuclear@1 701 strm->adler = crc32(strm->adler, s->pending_buf + beg,
nuclear@1 702 s->pending - beg);
nuclear@1 703 if (val == 0) {
nuclear@1 704 s->gzindex = 0;
nuclear@1 705 s->status = COMMENT_STATE;
nuclear@1 706 }
nuclear@1 707 }
nuclear@1 708 else
nuclear@1 709 s->status = COMMENT_STATE;
nuclear@1 710 }
nuclear@1 711 if (s->status == COMMENT_STATE) {
nuclear@1 712 if (s->gzhead->comment != NULL) {
nuclear@1 713 uInt beg = s->pending; /* start of bytes to update crc */
nuclear@1 714 int val;
nuclear@1 715
nuclear@1 716 do {
nuclear@1 717 if (s->pending == s->pending_buf_size) {
nuclear@1 718 if (s->gzhead->hcrc && s->pending > beg)
nuclear@1 719 strm->adler = crc32(strm->adler, s->pending_buf + beg,
nuclear@1 720 s->pending - beg);
nuclear@1 721 flush_pending(strm);
nuclear@1 722 beg = s->pending;
nuclear@1 723 if (s->pending == s->pending_buf_size) {
nuclear@1 724 val = 1;
nuclear@1 725 break;
nuclear@1 726 }
nuclear@1 727 }
nuclear@1 728 val = s->gzhead->comment[s->gzindex++];
nuclear@1 729 put_byte(s, val);
nuclear@1 730 } while (val != 0);
nuclear@1 731 if (s->gzhead->hcrc && s->pending > beg)
nuclear@1 732 strm->adler = crc32(strm->adler, s->pending_buf + beg,
nuclear@1 733 s->pending - beg);
nuclear@1 734 if (val == 0)
nuclear@1 735 s->status = HCRC_STATE;
nuclear@1 736 }
nuclear@1 737 else
nuclear@1 738 s->status = HCRC_STATE;
nuclear@1 739 }
nuclear@1 740 if (s->status == HCRC_STATE) {
nuclear@1 741 if (s->gzhead->hcrc) {
nuclear@1 742 if (s->pending + 2 > s->pending_buf_size)
nuclear@1 743 flush_pending(strm);
nuclear@1 744 if (s->pending + 2 <= s->pending_buf_size) {
nuclear@1 745 put_byte(s, (Byte)(strm->adler & 0xff));
nuclear@1 746 put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
nuclear@1 747 strm->adler = crc32(0L, Z_NULL, 0);
nuclear@1 748 s->status = BUSY_STATE;
nuclear@1 749 }
nuclear@1 750 }
nuclear@1 751 else
nuclear@1 752 s->status = BUSY_STATE;
nuclear@1 753 }
nuclear@1 754 #endif
nuclear@1 755
nuclear@1 756 /* Flush as much pending output as possible */
nuclear@1 757 if (s->pending != 0) {
nuclear@1 758 flush_pending(strm);
nuclear@1 759 if (strm->avail_out == 0) {
nuclear@1 760 /* Since avail_out is 0, deflate will be called again with
nuclear@1 761 * more output space, but possibly with both pending and
nuclear@1 762 * avail_in equal to zero. There won't be anything to do,
nuclear@1 763 * but this is not an error situation so make sure we
nuclear@1 764 * return OK instead of BUF_ERROR at next call of deflate:
nuclear@1 765 */
nuclear@1 766 s->last_flush = -1;
nuclear@1 767 return Z_OK;
nuclear@1 768 }
nuclear@1 769
nuclear@1 770 /* Make sure there is something to do and avoid duplicate consecutive
nuclear@1 771 * flushes. For repeated and useless calls with Z_FINISH, we keep
nuclear@1 772 * returning Z_STREAM_END instead of Z_BUF_ERROR.
nuclear@1 773 */
nuclear@1 774 } else if (strm->avail_in == 0 && flush <= old_flush &&
nuclear@1 775 flush != Z_FINISH) {
nuclear@1 776 ERR_RETURN(strm, Z_BUF_ERROR);
nuclear@1 777 }
nuclear@1 778
nuclear@1 779 /* User must not provide more input after the first FINISH: */
nuclear@1 780 if (s->status == FINISH_STATE && strm->avail_in != 0) {
nuclear@1 781 ERR_RETURN(strm, Z_BUF_ERROR);
nuclear@1 782 }
nuclear@1 783
nuclear@1 784 /* Start a new block or continue the current one.
nuclear@1 785 */
nuclear@1 786 if (strm->avail_in != 0 || s->lookahead != 0 ||
nuclear@1 787 (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) {
nuclear@1 788 block_state bstate;
nuclear@1 789
nuclear@1 790 bstate = (*(configuration_table[s->level].func))(s, flush);
nuclear@1 791
nuclear@1 792 if (bstate == finish_started || bstate == finish_done) {
nuclear@1 793 s->status = FINISH_STATE;
nuclear@1 794 }
nuclear@1 795 if (bstate == need_more || bstate == finish_started) {
nuclear@1 796 if (strm->avail_out == 0) {
nuclear@1 797 s->last_flush = -1; /* avoid BUF_ERROR next call, see above */
nuclear@1 798 }
nuclear@1 799 return Z_OK;
nuclear@1 800 /* If flush != Z_NO_FLUSH && avail_out == 0, the next call
nuclear@1 801 * of deflate should use the same flush parameter to make sure
nuclear@1 802 * that the flush is complete. So we don't have to output an
nuclear@1 803 * empty block here, this will be done at next call. This also
nuclear@1 804 * ensures that for a very small output buffer, we emit at most
nuclear@1 805 * one empty block.
nuclear@1 806 */
nuclear@1 807 }
nuclear@1 808 if (bstate == block_done) {
nuclear@1 809 if (flush == Z_PARTIAL_FLUSH) {
nuclear@1 810 _tr_align(s);
nuclear@1 811 } else { /* FULL_FLUSH or SYNC_FLUSH */
nuclear@1 812 _tr_stored_block(s, (char*)0, 0L, 0);
nuclear@1 813 /* For a full flush, this empty block will be recognized
nuclear@1 814 * as a special marker by inflate_sync().
nuclear@1 815 */
nuclear@1 816 if (flush == Z_FULL_FLUSH) {
nuclear@1 817 CLEAR_HASH(s); /* forget history */
nuclear@1 818 }
nuclear@1 819 }
nuclear@1 820 flush_pending(strm);
nuclear@1 821 if (strm->avail_out == 0) {
nuclear@1 822 s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */
nuclear@1 823 return Z_OK;
nuclear@1 824 }
nuclear@1 825 }
nuclear@1 826 }
nuclear@1 827 Assert(strm->avail_out > 0, "bug2");
nuclear@1 828
nuclear@1 829 if (flush != Z_FINISH) return Z_OK;
nuclear@1 830 if (s->wrap <= 0) return Z_STREAM_END;
nuclear@1 831
nuclear@1 832 /* Write the trailer */
nuclear@1 833 #ifdef GZIP
nuclear@1 834 if (s->wrap == 2) {
nuclear@1 835 put_byte(s, (Byte)(strm->adler & 0xff));
nuclear@1 836 put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
nuclear@1 837 put_byte(s, (Byte)((strm->adler >> 16) & 0xff));
nuclear@1 838 put_byte(s, (Byte)((strm->adler >> 24) & 0xff));
nuclear@1 839 put_byte(s, (Byte)(strm->total_in & 0xff));
nuclear@1 840 put_byte(s, (Byte)((strm->total_in >> 8) & 0xff));
nuclear@1 841 put_byte(s, (Byte)((strm->total_in >> 16) & 0xff));
nuclear@1 842 put_byte(s, (Byte)((strm->total_in >> 24) & 0xff));
nuclear@1 843 }
nuclear@1 844 else
nuclear@1 845 #endif
nuclear@1 846 {
nuclear@1 847 putShortMSB(s, (uInt)(strm->adler >> 16));
nuclear@1 848 putShortMSB(s, (uInt)(strm->adler & 0xffff));
nuclear@1 849 }
nuclear@1 850 flush_pending(strm);
nuclear@1 851 /* If avail_out is zero, the application will call deflate again
nuclear@1 852 * to flush the rest.
nuclear@1 853 */
nuclear@1 854 if (s->wrap > 0) s->wrap = -s->wrap; /* write the trailer only once! */
nuclear@1 855 return s->pending != 0 ? Z_OK : Z_STREAM_END;
nuclear@1 856 }
nuclear@1 857
nuclear@1 858 /* ========================================================================= */
nuclear@1 859 int ZEXPORT deflateEnd (strm)
nuclear@1 860 z_streamp strm;
nuclear@1 861 {
nuclear@1 862 int status;
nuclear@1 863
nuclear@1 864 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
nuclear@1 865
nuclear@1 866 status = strm->state->status;
nuclear@1 867 if (status != INIT_STATE &&
nuclear@1 868 status != EXTRA_STATE &&
nuclear@1 869 status != NAME_STATE &&
nuclear@1 870 status != COMMENT_STATE &&
nuclear@1 871 status != HCRC_STATE &&
nuclear@1 872 status != BUSY_STATE &&
nuclear@1 873 status != FINISH_STATE) {
nuclear@1 874 return Z_STREAM_ERROR;
nuclear@1 875 }
nuclear@1 876
nuclear@1 877 /* Deallocate in reverse order of allocations: */
nuclear@1 878 TRY_FREE(strm, strm->state->pending_buf);
nuclear@1 879 TRY_FREE(strm, strm->state->head);
nuclear@1 880 TRY_FREE(strm, strm->state->prev);
nuclear@1 881 TRY_FREE(strm, strm->state->window);
nuclear@1 882
nuclear@1 883 ZFREE(strm, strm->state);
nuclear@1 884 strm->state = Z_NULL;
nuclear@1 885
nuclear@1 886 return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK;
nuclear@1 887 }
nuclear@1 888
nuclear@1 889 /* =========================================================================
nuclear@1 890 * Copy the source state to the destination state.
nuclear@1 891 * To simplify the source, this is not supported for 16-bit MSDOS (which
nuclear@1 892 * doesn't have enough memory anyway to duplicate compression states).
nuclear@1 893 */
nuclear@1 894 int ZEXPORT deflateCopy (dest, source)
nuclear@1 895 z_streamp dest;
nuclear@1 896 z_streamp source;
nuclear@1 897 {
nuclear@1 898 #ifdef MAXSEG_64K
nuclear@1 899 return Z_STREAM_ERROR;
nuclear@1 900 #else
nuclear@1 901 deflate_state *ds;
nuclear@1 902 deflate_state *ss;
nuclear@1 903 ushf *overlay;
nuclear@1 904
nuclear@1 905
nuclear@1 906 if (source == Z_NULL || dest == Z_NULL || source->state == Z_NULL) {
nuclear@1 907 return Z_STREAM_ERROR;
nuclear@1 908 }
nuclear@1 909
nuclear@1 910 ss = source->state;
nuclear@1 911
nuclear@1 912 zmemcpy(dest, source, sizeof(z_stream));
nuclear@1 913
nuclear@1 914 ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state));
nuclear@1 915 if (ds == Z_NULL) return Z_MEM_ERROR;
nuclear@1 916 dest->state = (struct internal_state FAR *) ds;
nuclear@1 917 zmemcpy(ds, ss, sizeof(deflate_state));
nuclear@1 918 ds->strm = dest;
nuclear@1 919
nuclear@1 920 ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));
nuclear@1 921 ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos));
nuclear@1 922 ds->head = (Posf *) ZALLOC(dest, ds->hash_size, sizeof(Pos));
nuclear@1 923 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
nuclear@1 924 ds->pending_buf = (uchf *) overlay;
nuclear@1 925
nuclear@1 926 if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
nuclear@1 927 ds->pending_buf == Z_NULL) {
nuclear@1 928 deflateEnd (dest);
nuclear@1 929 return Z_MEM_ERROR;
nuclear@1 930 }
nuclear@1 931 /* following zmemcpy do not work for 16-bit MSDOS */
nuclear@1 932 zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));
nuclear@1 933 zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));
nuclear@1 934 zmemcpy(ds->head, ss->head, ds->hash_size * sizeof(Pos));
nuclear@1 935 zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);
nuclear@1 936
nuclear@1 937 ds->pending_out = ds->pending_buf + (ss->pending_out - ss->pending_buf);
nuclear@1 938 ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);
nuclear@1 939 ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;
nuclear@1 940
nuclear@1 941 ds->l_desc.dyn_tree = ds->dyn_ltree;
nuclear@1 942 ds->d_desc.dyn_tree = ds->dyn_dtree;
nuclear@1 943 ds->bl_desc.dyn_tree = ds->bl_tree;
nuclear@1 944
nuclear@1 945 return Z_OK;
nuclear@1 946 #endif /* MAXSEG_64K */
nuclear@1 947 }
nuclear@1 948
nuclear@1 949 /* ===========================================================================
nuclear@1 950 * Read a new buffer from the current input stream, update the adler32
nuclear@1 951 * and total number of bytes read. All deflate() input goes through
nuclear@1 952 * this function so some applications may wish to modify it to avoid
nuclear@1 953 * allocating a large strm->next_in buffer and copying from it.
nuclear@1 954 * (See also flush_pending()).
nuclear@1 955 */
nuclear@1 956 local int read_buf(strm, buf, size)
nuclear@1 957 z_streamp strm;
nuclear@1 958 Bytef *buf;
nuclear@1 959 unsigned size;
nuclear@1 960 {
nuclear@1 961 unsigned len = strm->avail_in;
nuclear@1 962
nuclear@1 963 if (len > size) len = size;
nuclear@1 964 if (len == 0) return 0;
nuclear@1 965
nuclear@1 966 strm->avail_in -= len;
nuclear@1 967
nuclear@1 968 if (strm->state->wrap == 1) {
nuclear@1 969 strm->adler = adler32(strm->adler, strm->next_in, len);
nuclear@1 970 }
nuclear@1 971 #ifdef GZIP
nuclear@1 972 else if (strm->state->wrap == 2) {
nuclear@1 973 strm->adler = crc32(strm->adler, strm->next_in, len);
nuclear@1 974 }
nuclear@1 975 #endif
nuclear@1 976 zmemcpy(buf, strm->next_in, len);
nuclear@1 977 strm->next_in += len;
nuclear@1 978 strm->total_in += len;
nuclear@1 979
nuclear@1 980 return (int)len;
nuclear@1 981 }
nuclear@1 982
nuclear@1 983 /* ===========================================================================
nuclear@1 984 * Initialize the "longest match" routines for a new zlib stream
nuclear@1 985 */
nuclear@1 986 local void lm_init (s)
nuclear@1 987 deflate_state *s;
nuclear@1 988 {
nuclear@1 989 s->window_size = (ulg)2L*s->w_size;
nuclear@1 990
nuclear@1 991 CLEAR_HASH(s);
nuclear@1 992
nuclear@1 993 /* Set the default configuration parameters:
nuclear@1 994 */
nuclear@1 995 s->max_lazy_match = configuration_table[s->level].max_lazy;
nuclear@1 996 s->good_match = configuration_table[s->level].good_length;
nuclear@1 997 s->nice_match = configuration_table[s->level].nice_length;
nuclear@1 998 s->max_chain_length = configuration_table[s->level].max_chain;
nuclear@1 999
nuclear@1 1000 s->strstart = 0;
nuclear@1 1001 s->block_start = 0L;
nuclear@1 1002 s->lookahead = 0;
nuclear@1 1003 s->match_length = s->prev_length = MIN_MATCH-1;
nuclear@1 1004 s->match_available = 0;
nuclear@1 1005 s->ins_h = 0;
nuclear@1 1006 #ifndef FASTEST
nuclear@1 1007 #ifdef ASMV
nuclear@1 1008 match_init(); /* initialize the asm code */
nuclear@1 1009 #endif
nuclear@1 1010 #endif
nuclear@1 1011 }
nuclear@1 1012
nuclear@1 1013 #ifndef FASTEST
nuclear@1 1014 /* ===========================================================================
nuclear@1 1015 * Set match_start to the longest match starting at the given string and
nuclear@1 1016 * return its length. Matches shorter or equal to prev_length are discarded,
nuclear@1 1017 * in which case the result is equal to prev_length and match_start is
nuclear@1 1018 * garbage.
nuclear@1 1019 * IN assertions: cur_match is the head of the hash chain for the current
nuclear@1 1020 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
nuclear@1 1021 * OUT assertion: the match length is not greater than s->lookahead.
nuclear@1 1022 */
nuclear@1 1023 #ifndef ASMV
nuclear@1 1024 /* For 80x86 and 680x0, an optimized version will be provided in match.asm or
nuclear@1 1025 * match.S. The code will be functionally equivalent.
nuclear@1 1026 */
nuclear@1 1027 local uInt longest_match(s, cur_match)
nuclear@1 1028 deflate_state *s;
nuclear@1 1029 IPos cur_match; /* current match */
nuclear@1 1030 {
nuclear@1 1031 unsigned chain_length = s->max_chain_length;/* max hash chain length */
nuclear@1 1032 register Bytef *scan = s->window + s->strstart; /* current string */
nuclear@1 1033 register Bytef *match; /* matched string */
nuclear@1 1034 register int len; /* length of current match */
nuclear@1 1035 int best_len = s->prev_length; /* best match length so far */
nuclear@1 1036 int nice_match = s->nice_match; /* stop if match long enough */
nuclear@1 1037 IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
nuclear@1 1038 s->strstart - (IPos)MAX_DIST(s) : NIL;
nuclear@1 1039 /* Stop when cur_match becomes <= limit. To simplify the code,
nuclear@1 1040 * we prevent matches with the string of window index 0.
nuclear@1 1041 */
nuclear@1 1042 Posf *prev = s->prev;
nuclear@1 1043 uInt wmask = s->w_mask;
nuclear@1 1044
nuclear@1 1045 #ifdef UNALIGNED_OK
nuclear@1 1046 /* Compare two bytes at a time. Note: this is not always beneficial.
nuclear@1 1047 * Try with and without -DUNALIGNED_OK to check.
nuclear@1 1048 */
nuclear@1 1049 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
nuclear@1 1050 register ush scan_start = *(ushf*)scan;
nuclear@1 1051 register ush scan_end = *(ushf*)(scan+best_len-1);
nuclear@1 1052 #else
nuclear@1 1053 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
nuclear@1 1054 register Byte scan_end1 = scan[best_len-1];
nuclear@1 1055 register Byte scan_end = scan[best_len];
nuclear@1 1056 #endif
nuclear@1 1057
nuclear@1 1058 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
nuclear@1 1059 * It is easy to get rid of this optimization if necessary.
nuclear@1 1060 */
nuclear@1 1061 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
nuclear@1 1062
nuclear@1 1063 /* Do not waste too much time if we already have a good match: */
nuclear@1 1064 if (s->prev_length >= s->good_match) {
nuclear@1 1065 chain_length >>= 2;
nuclear@1 1066 }
nuclear@1 1067 /* Do not look for matches beyond the end of the input. This is necessary
nuclear@1 1068 * to make deflate deterministic.
nuclear@1 1069 */
nuclear@1 1070 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
nuclear@1 1071
nuclear@1 1072 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
nuclear@1 1073
nuclear@1 1074 do {
nuclear@1 1075 Assert(cur_match < s->strstart, "no future");
nuclear@1 1076 match = s->window + cur_match;
nuclear@1 1077
nuclear@1 1078 /* Skip to next match if the match length cannot increase
nuclear@1 1079 * or if the match length is less than 2. Note that the checks below
nuclear@1 1080 * for insufficient lookahead only occur occasionally for performance
nuclear@1 1081 * reasons. Therefore uninitialized memory will be accessed, and
nuclear@1 1082 * conditional jumps will be made that depend on those values.
nuclear@1 1083 * However the length of the match is limited to the lookahead, so
nuclear@1 1084 * the output of deflate is not affected by the uninitialized values.
nuclear@1 1085 */
nuclear@1 1086 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
nuclear@1 1087 /* This code assumes sizeof(unsigned short) == 2. Do not use
nuclear@1 1088 * UNALIGNED_OK if your compiler uses a different size.
nuclear@1 1089 */
nuclear@1 1090 if (*(ushf*)(match+best_len-1) != scan_end ||
nuclear@1 1091 *(ushf*)match != scan_start) continue;
nuclear@1 1092
nuclear@1 1093 /* It is not necessary to compare scan[2] and match[2] since they are
nuclear@1 1094 * always equal when the other bytes match, given that the hash keys
nuclear@1 1095 * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
nuclear@1 1096 * strstart+3, +5, ... up to strstart+257. We check for insufficient
nuclear@1 1097 * lookahead only every 4th comparison; the 128th check will be made
nuclear@1 1098 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
nuclear@1 1099 * necessary to put more guard bytes at the end of the window, or
nuclear@1 1100 * to check more often for insufficient lookahead.
nuclear@1 1101 */
nuclear@1 1102 Assert(scan[2] == match[2], "scan[2]?");
nuclear@1 1103 scan++, match++;
nuclear@1 1104 do {
nuclear@1 1105 } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
nuclear@1 1106 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
nuclear@1 1107 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
nuclear@1 1108 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
nuclear@1 1109 scan < strend);
nuclear@1 1110 /* The funny "do {}" generates better code on most compilers */
nuclear@1 1111
nuclear@1 1112 /* Here, scan <= window+strstart+257 */
nuclear@1 1113 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
nuclear@1 1114 if (*scan == *match) scan++;
nuclear@1 1115
nuclear@1 1116 len = (MAX_MATCH - 1) - (int)(strend-scan);
nuclear@1 1117 scan = strend - (MAX_MATCH-1);
nuclear@1 1118
nuclear@1 1119 #else /* UNALIGNED_OK */
nuclear@1 1120
nuclear@1 1121 if (match[best_len] != scan_end ||
nuclear@1 1122 match[best_len-1] != scan_end1 ||
nuclear@1 1123 *match != *scan ||
nuclear@1 1124 *++match != scan[1]) continue;
nuclear@1 1125
nuclear@1 1126 /* The check at best_len-1 can be removed because it will be made
nuclear@1 1127 * again later. (This heuristic is not always a win.)
nuclear@1 1128 * It is not necessary to compare scan[2] and match[2] since they
nuclear@1 1129 * are always equal when the other bytes match, given that
nuclear@1 1130 * the hash keys are equal and that HASH_BITS >= 8.
nuclear@1 1131 */
nuclear@1 1132 scan += 2, match++;
nuclear@1 1133 Assert(*scan == *match, "match[2]?");
nuclear@1 1134
nuclear@1 1135 /* We check for insufficient lookahead only every 8th comparison;
nuclear@1 1136 * the 256th check will be made at strstart+258.
nuclear@1 1137 */
nuclear@1 1138 do {
nuclear@1 1139 } while (*++scan == *++match && *++scan == *++match &&
nuclear@1 1140 *++scan == *++match && *++scan == *++match &&
nuclear@1 1141 *++scan == *++match && *++scan == *++match &&
nuclear@1 1142 *++scan == *++match && *++scan == *++match &&
nuclear@1 1143 scan < strend);
nuclear@1 1144
nuclear@1 1145 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
nuclear@1 1146
nuclear@1 1147 len = MAX_MATCH - (int)(strend - scan);
nuclear@1 1148 scan = strend - MAX_MATCH;
nuclear@1 1149
nuclear@1 1150 #endif /* UNALIGNED_OK */
nuclear@1 1151
nuclear@1 1152 if (len > best_len) {
nuclear@1 1153 s->match_start = cur_match;
nuclear@1 1154 best_len = len;
nuclear@1 1155 if (len >= nice_match) break;
nuclear@1 1156 #ifdef UNALIGNED_OK
nuclear@1 1157 scan_end = *(ushf*)(scan+best_len-1);
nuclear@1 1158 #else
nuclear@1 1159 scan_end1 = scan[best_len-1];
nuclear@1 1160 scan_end = scan[best_len];
nuclear@1 1161 #endif
nuclear@1 1162 }
nuclear@1 1163 } while ((cur_match = prev[cur_match & wmask]) > limit
nuclear@1 1164 && --chain_length != 0);
nuclear@1 1165
nuclear@1 1166 if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
nuclear@1 1167 return s->lookahead;
nuclear@1 1168 }
nuclear@1 1169 #endif /* ASMV */
nuclear@1 1170 #endif /* FASTEST */
nuclear@1 1171
nuclear@1 1172 /* ---------------------------------------------------------------------------
nuclear@1 1173 * Optimized version for level == 1 or strategy == Z_RLE only
nuclear@1 1174 */
nuclear@1 1175 local uInt longest_match_fast(s, cur_match)
nuclear@1 1176 deflate_state *s;
nuclear@1 1177 IPos cur_match; /* current match */
nuclear@1 1178 {
nuclear@1 1179 register Bytef *scan = s->window + s->strstart; /* current string */
nuclear@1 1180 register Bytef *match; /* matched string */
nuclear@1 1181 register int len; /* length of current match */
nuclear@1 1182 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
nuclear@1 1183
nuclear@1 1184 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
nuclear@1 1185 * It is easy to get rid of this optimization if necessary.
nuclear@1 1186 */
nuclear@1 1187 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
nuclear@1 1188
nuclear@1 1189 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
nuclear@1 1190
nuclear@1 1191 Assert(cur_match < s->strstart, "no future");
nuclear@1 1192
nuclear@1 1193 match = s->window + cur_match;
nuclear@1 1194
nuclear@1 1195 /* Return failure if the match length is less than 2:
nuclear@1 1196 */
nuclear@1 1197 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
nuclear@1 1198
nuclear@1 1199 /* The check at best_len-1 can be removed because it will be made
nuclear@1 1200 * again later. (This heuristic is not always a win.)
nuclear@1 1201 * It is not necessary to compare scan[2] and match[2] since they
nuclear@1 1202 * are always equal when the other bytes match, given that
nuclear@1 1203 * the hash keys are equal and that HASH_BITS >= 8.
nuclear@1 1204 */
nuclear@1 1205 scan += 2, match += 2;
nuclear@1 1206 Assert(*scan == *match, "match[2]?");
nuclear@1 1207
nuclear@1 1208 /* We check for insufficient lookahead only every 8th comparison;
nuclear@1 1209 * the 256th check will be made at strstart+258.
nuclear@1 1210 */
nuclear@1 1211 do {
nuclear@1 1212 } while (*++scan == *++match && *++scan == *++match &&
nuclear@1 1213 *++scan == *++match && *++scan == *++match &&
nuclear@1 1214 *++scan == *++match && *++scan == *++match &&
nuclear@1 1215 *++scan == *++match && *++scan == *++match &&
nuclear@1 1216 scan < strend);
nuclear@1 1217
nuclear@1 1218 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
nuclear@1 1219
nuclear@1 1220 len = MAX_MATCH - (int)(strend - scan);
nuclear@1 1221
nuclear@1 1222 if (len < MIN_MATCH) return MIN_MATCH - 1;
nuclear@1 1223
nuclear@1 1224 s->match_start = cur_match;
nuclear@1 1225 return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;
nuclear@1 1226 }
nuclear@1 1227
nuclear@1 1228 #ifdef DEBUG
nuclear@1 1229 /* ===========================================================================
nuclear@1 1230 * Check that the match at match_start is indeed a match.
nuclear@1 1231 */
nuclear@1 1232 local void check_match(s, start, match, length)
nuclear@1 1233 deflate_state *s;
nuclear@1 1234 IPos start, match;
nuclear@1 1235 int length;
nuclear@1 1236 {
nuclear@1 1237 /* check that the match is indeed a match */
nuclear@1 1238 if (zmemcmp(s->window + match,
nuclear@1 1239 s->window + start, length) != EQUAL) {
nuclear@1 1240 fprintf(stderr, " start %u, match %u, length %d\n",
nuclear@1 1241 start, match, length);
nuclear@1 1242 do {
nuclear@1 1243 fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);
nuclear@1 1244 } while (--length != 0);
nuclear@1 1245 z_error("invalid match");
nuclear@1 1246 }
nuclear@1 1247 if (z_verbose > 1) {
nuclear@1 1248 fprintf(stderr,"\\[%d,%d]", start-match, length);
nuclear@1 1249 do { putc(s->window[start++], stderr); } while (--length != 0);
nuclear@1 1250 }
nuclear@1 1251 }
nuclear@1 1252 #else
nuclear@1 1253 # define check_match(s, start, match, length)
nuclear@1 1254 #endif /* DEBUG */
nuclear@1 1255
nuclear@1 1256 /* ===========================================================================
nuclear@1 1257 * Fill the window when the lookahead becomes insufficient.
nuclear@1 1258 * Updates strstart and lookahead.
nuclear@1 1259 *
nuclear@1 1260 * IN assertion: lookahead < MIN_LOOKAHEAD
nuclear@1 1261 * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
nuclear@1 1262 * At least one byte has been read, or avail_in == 0; reads are
nuclear@1 1263 * performed for at least two bytes (required for the zip translate_eol
nuclear@1 1264 * option -- not supported here).
nuclear@1 1265 */
nuclear@1 1266 local void fill_window(s)
nuclear@1 1267 deflate_state *s;
nuclear@1 1268 {
nuclear@1 1269 register unsigned n, m;
nuclear@1 1270 register Posf *p;
nuclear@1 1271 unsigned more; /* Amount of free space at the end of the window. */
nuclear@1 1272 uInt wsize = s->w_size;
nuclear@1 1273
nuclear@1 1274 do {
nuclear@1 1275 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
nuclear@1 1276
nuclear@1 1277 /* Deal with !@#$% 64K limit: */
nuclear@1 1278 if (sizeof(int) <= 2) {
nuclear@1 1279 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
nuclear@1 1280 more = wsize;
nuclear@1 1281
nuclear@1 1282 } else if (more == (unsigned)(-1)) {
nuclear@1 1283 /* Very unlikely, but possible on 16 bit machine if
nuclear@1 1284 * strstart == 0 && lookahead == 1 (input done a byte at time)
nuclear@1 1285 */
nuclear@1 1286 more--;
nuclear@1 1287 }
nuclear@1 1288 }
nuclear@1 1289
nuclear@1 1290 /* If the window is almost full and there is insufficient lookahead,
nuclear@1 1291 * move the upper half to the lower one to make room in the upper half.
nuclear@1 1292 */
nuclear@1 1293 if (s->strstart >= wsize+MAX_DIST(s)) {
nuclear@1 1294
nuclear@1 1295 zmemcpy(s->window, s->window+wsize, (unsigned)wsize);
nuclear@1 1296 s->match_start -= wsize;
nuclear@1 1297 s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
nuclear@1 1298 s->block_start -= (long) wsize;
nuclear@1 1299
nuclear@1 1300 /* Slide the hash table (could be avoided with 32 bit values
nuclear@1 1301 at the expense of memory usage). We slide even when level == 0
nuclear@1 1302 to keep the hash table consistent if we switch back to level > 0
nuclear@1 1303 later. (Using level 0 permanently is not an optimal usage of
nuclear@1 1304 zlib, so we don't care about this pathological case.)
nuclear@1 1305 */
nuclear@1 1306 /* %%% avoid this when Z_RLE */
nuclear@1 1307 n = s->hash_size;
nuclear@1 1308 p = &s->head[n];
nuclear@1 1309 do {
nuclear@1 1310 m = *--p;
nuclear@1 1311 *p = (Pos)(m >= wsize ? m-wsize : NIL);
nuclear@1 1312 } while (--n);
nuclear@1 1313
nuclear@1 1314 n = wsize;
nuclear@1 1315 #ifndef FASTEST
nuclear@1 1316 p = &s->prev[n];
nuclear@1 1317 do {
nuclear@1 1318 m = *--p;
nuclear@1 1319 *p = (Pos)(m >= wsize ? m-wsize : NIL);
nuclear@1 1320 /* If n is not on any hash chain, prev[n] is garbage but
nuclear@1 1321 * its value will never be used.
nuclear@1 1322 */
nuclear@1 1323 } while (--n);
nuclear@1 1324 #endif
nuclear@1 1325 more += wsize;
nuclear@1 1326 }
nuclear@1 1327 if (s->strm->avail_in == 0) return;
nuclear@1 1328
nuclear@1 1329 /* If there was no sliding:
nuclear@1 1330 * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
nuclear@1 1331 * more == window_size - lookahead - strstart
nuclear@1 1332 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
nuclear@1 1333 * => more >= window_size - 2*WSIZE + 2
nuclear@1 1334 * In the BIG_MEM or MMAP case (not yet supported),
nuclear@1 1335 * window_size == input_size + MIN_LOOKAHEAD &&
nuclear@1 1336 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
nuclear@1 1337 * Otherwise, window_size == 2*WSIZE so more >= 2.
nuclear@1 1338 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
nuclear@1 1339 */
nuclear@1 1340 Assert(more >= 2, "more < 2");
nuclear@1 1341
nuclear@1 1342 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
nuclear@1 1343 s->lookahead += n;
nuclear@1 1344
nuclear@1 1345 /* Initialize the hash value now that we have some input: */
nuclear@1 1346 if (s->lookahead >= MIN_MATCH) {
nuclear@1 1347 s->ins_h = s->window[s->strstart];
nuclear@1 1348 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
nuclear@1 1349 #if MIN_MATCH != 3
nuclear@1 1350 Call UPDATE_HASH() MIN_MATCH-3 more times
nuclear@1 1351 #endif
nuclear@1 1352 }
nuclear@1 1353 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
nuclear@1 1354 * but this is not important since only literal bytes will be emitted.
nuclear@1 1355 */
nuclear@1 1356
nuclear@1 1357 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
nuclear@1 1358 }
nuclear@1 1359
nuclear@1 1360 /* ===========================================================================
nuclear@1 1361 * Flush the current block, with given end-of-file flag.
nuclear@1 1362 * IN assertion: strstart is set to the end of the current match.
nuclear@1 1363 */
nuclear@1 1364 #define FLUSH_BLOCK_ONLY(s, eof) { \
nuclear@1 1365 _tr_flush_block(s, (s->block_start >= 0L ? \
nuclear@1 1366 (charf *)&s->window[(unsigned)s->block_start] : \
nuclear@1 1367 (charf *)Z_NULL), \
nuclear@1 1368 (ulg)((long)s->strstart - s->block_start), \
nuclear@1 1369 (eof)); \
nuclear@1 1370 s->block_start = s->strstart; \
nuclear@1 1371 flush_pending(s->strm); \
nuclear@1 1372 Tracev((stderr,"[FLUSH]")); \
nuclear@1 1373 }
nuclear@1 1374
nuclear@1 1375 /* Same but force premature exit if necessary. */
nuclear@1 1376 #define FLUSH_BLOCK(s, eof) { \
nuclear@1 1377 FLUSH_BLOCK_ONLY(s, eof); \
nuclear@1 1378 if (s->strm->avail_out == 0) return (eof) ? finish_started : need_more; \
nuclear@1 1379 }
nuclear@1 1380
nuclear@1 1381 /* ===========================================================================
nuclear@1 1382 * Copy without compression as much as possible from the input stream, return
nuclear@1 1383 * the current block state.
nuclear@1 1384 * This function does not insert new strings in the dictionary since
nuclear@1 1385 * uncompressible data is probably not useful. This function is used
nuclear@1 1386 * only for the level=0 compression option.
nuclear@1 1387 * NOTE: this function should be optimized to avoid extra copying from
nuclear@1 1388 * window to pending_buf.
nuclear@1 1389 */
nuclear@1 1390 local block_state deflate_stored(s, flush)
nuclear@1 1391 deflate_state *s;
nuclear@1 1392 int flush;
nuclear@1 1393 {
nuclear@1 1394 /* Stored blocks are limited to 0xffff bytes, pending_buf is limited
nuclear@1 1395 * to pending_buf_size, and each stored block has a 5 byte header:
nuclear@1 1396 */
nuclear@1 1397 ulg max_block_size = 0xffff;
nuclear@1 1398 ulg max_start;
nuclear@1 1399
nuclear@1 1400 if (max_block_size > s->pending_buf_size - 5) {
nuclear@1 1401 max_block_size = s->pending_buf_size - 5;
nuclear@1 1402 }
nuclear@1 1403
nuclear@1 1404 /* Copy as much as possible from input to output: */
nuclear@1 1405 for (;;) {
nuclear@1 1406 /* Fill the window as much as possible: */
nuclear@1 1407 if (s->lookahead <= 1) {
nuclear@1 1408
nuclear@1 1409 Assert(s->strstart < s->w_size+MAX_DIST(s) ||
nuclear@1 1410 s->block_start >= (long)s->w_size, "slide too late");
nuclear@1 1411
nuclear@1 1412 fill_window(s);
nuclear@1 1413 if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more;
nuclear@1 1414
nuclear@1 1415 if (s->lookahead == 0) break; /* flush the current block */
nuclear@1 1416 }
nuclear@1 1417 Assert(s->block_start >= 0L, "block gone");
nuclear@1 1418
nuclear@1 1419 s->strstart += s->lookahead;
nuclear@1 1420 s->lookahead = 0;
nuclear@1 1421
nuclear@1 1422 /* Emit a stored block if pending_buf will be full: */
nuclear@1 1423 max_start = s->block_start + max_block_size;
nuclear@1 1424 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
nuclear@1 1425 /* strstart == 0 is possible when wraparound on 16-bit machine */
nuclear@1 1426 s->lookahead = (uInt)(s->strstart - max_start);
nuclear@1 1427 s->strstart = (uInt)max_start;
nuclear@1 1428 FLUSH_BLOCK(s, 0);
nuclear@1 1429 }
nuclear@1 1430 /* Flush if we may have to slide, otherwise block_start may become
nuclear@1 1431 * negative and the data will be gone:
nuclear@1 1432 */
nuclear@1 1433 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
nuclear@1 1434 FLUSH_BLOCK(s, 0);
nuclear@1 1435 }
nuclear@1 1436 }
nuclear@1 1437 FLUSH_BLOCK(s, flush == Z_FINISH);
nuclear@1 1438 return flush == Z_FINISH ? finish_done : block_done;
nuclear@1 1439 }
nuclear@1 1440
nuclear@1 1441 /* ===========================================================================
nuclear@1 1442 * Compress as much as possible from the input stream, return the current
nuclear@1 1443 * block state.
nuclear@1 1444 * This function does not perform lazy evaluation of matches and inserts
nuclear@1 1445 * new strings in the dictionary only for unmatched strings or for short
nuclear@1 1446 * matches. It is used only for the fast compression options.
nuclear@1 1447 */
nuclear@1 1448 local block_state deflate_fast(s, flush)
nuclear@1 1449 deflate_state *s;
nuclear@1 1450 int flush;
nuclear@1 1451 {
nuclear@1 1452 IPos hash_head = NIL; /* head of the hash chain */
nuclear@1 1453 int bflush; /* set if current block must be flushed */
nuclear@1 1454
nuclear@1 1455 for (;;) {
nuclear@1 1456 /* Make sure that we always have enough lookahead, except
nuclear@1 1457 * at the end of the input file. We need MAX_MATCH bytes
nuclear@1 1458 * for the next match, plus MIN_MATCH bytes to insert the
nuclear@1 1459 * string following the next match.
nuclear@1 1460 */
nuclear@1 1461 if (s->lookahead < MIN_LOOKAHEAD) {
nuclear@1 1462 fill_window(s);
nuclear@1 1463 if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
nuclear@1 1464 return need_more;
nuclear@1 1465 }
nuclear@1 1466 if (s->lookahead == 0) break; /* flush the current block */
nuclear@1 1467 }
nuclear@1 1468
nuclear@1 1469 /* Insert the string window[strstart .. strstart+2] in the
nuclear@1 1470 * dictionary, and set hash_head to the head of the hash chain:
nuclear@1 1471 */
nuclear@1 1472 if (s->lookahead >= MIN_MATCH) {
nuclear@1 1473 INSERT_STRING(s, s->strstart, hash_head);
nuclear@1 1474 }
nuclear@1 1475
nuclear@1 1476 /* Find the longest match, discarding those <= prev_length.
nuclear@1 1477 * At this point we have always match_length < MIN_MATCH
nuclear@1 1478 */
nuclear@1 1479 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
nuclear@1 1480 /* To simplify the code, we prevent matches with the string
nuclear@1 1481 * of window index 0 (in particular we have to avoid a match
nuclear@1 1482 * of the string with itself at the start of the input file).
nuclear@1 1483 */
nuclear@1 1484 #ifdef FASTEST
nuclear@1 1485 if ((s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) ||
nuclear@1 1486 (s->strategy == Z_RLE && s->strstart - hash_head == 1)) {
nuclear@1 1487 s->match_length = longest_match_fast (s, hash_head);
nuclear@1 1488 }
nuclear@1 1489 #else
nuclear@1 1490 if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {
nuclear@1 1491 s->match_length = longest_match (s, hash_head);
nuclear@1 1492 } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
nuclear@1 1493 s->match_length = longest_match_fast (s, hash_head);
nuclear@1 1494 }
nuclear@1 1495 #endif
nuclear@1 1496 /* longest_match() or longest_match_fast() sets match_start */
nuclear@1 1497 }
nuclear@1 1498 if (s->match_length >= MIN_MATCH) {
nuclear@1 1499 check_match(s, s->strstart, s->match_start, s->match_length);
nuclear@1 1500
nuclear@1 1501 _tr_tally_dist(s, s->strstart - s->match_start,
nuclear@1 1502 s->match_length - MIN_MATCH, bflush);
nuclear@1 1503
nuclear@1 1504 s->lookahead -= s->match_length;
nuclear@1 1505
nuclear@1 1506 /* Insert new strings in the hash table only if the match length
nuclear@1 1507 * is not too large. This saves time but degrades compression.
nuclear@1 1508 */
nuclear@1 1509 #ifndef FASTEST
nuclear@1 1510 if (s->match_length <= s->max_insert_length &&
nuclear@1 1511 s->lookahead >= MIN_MATCH) {
nuclear@1 1512 s->match_length--; /* string at strstart already in table */
nuclear@1 1513 do {
nuclear@1 1514 s->strstart++;
nuclear@1 1515 INSERT_STRING(s, s->strstart, hash_head);
nuclear@1 1516 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
nuclear@1 1517 * always MIN_MATCH bytes ahead.
nuclear@1 1518 */
nuclear@1 1519 } while (--s->match_length != 0);
nuclear@1 1520 s->strstart++;
nuclear@1 1521 } else
nuclear@1 1522 #endif
nuclear@1 1523 {
nuclear@1 1524 s->strstart += s->match_length;
nuclear@1 1525 s->match_length = 0;
nuclear@1 1526 s->ins_h = s->window[s->strstart];
nuclear@1 1527 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
nuclear@1 1528 #if MIN_MATCH != 3
nuclear@1 1529 Call UPDATE_HASH() MIN_MATCH-3 more times
nuclear@1 1530 #endif
nuclear@1 1531 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
nuclear@1 1532 * matter since it will be recomputed at next deflate call.
nuclear@1 1533 */
nuclear@1 1534 }
nuclear@1 1535 } else {
nuclear@1 1536 /* No match, output a literal byte */
nuclear@1 1537 Tracevv((stderr,"%c", s->window[s->strstart]));
nuclear@1 1538 _tr_tally_lit (s, s->window[s->strstart], bflush);
nuclear@1 1539 s->lookahead--;
nuclear@1 1540 s->strstart++;
nuclear@1 1541 }
nuclear@1 1542 if (bflush) FLUSH_BLOCK(s, 0);
nuclear@1 1543 }
nuclear@1 1544 FLUSH_BLOCK(s, flush == Z_FINISH);
nuclear@1 1545 return flush == Z_FINISH ? finish_done : block_done;
nuclear@1 1546 }
nuclear@1 1547
nuclear@1 1548 #ifndef FASTEST
nuclear@1 1549 /* ===========================================================================
nuclear@1 1550 * Same as above, but achieves better compression. We use a lazy
nuclear@1 1551 * evaluation for matches: a match is finally adopted only if there is
nuclear@1 1552 * no better match at the next window position.
nuclear@1 1553 */
nuclear@1 1554 local block_state deflate_slow(s, flush)
nuclear@1 1555 deflate_state *s;
nuclear@1 1556 int flush;
nuclear@1 1557 {
nuclear@1 1558 IPos hash_head = NIL; /* head of hash chain */
nuclear@1 1559 int bflush; /* set if current block must be flushed */
nuclear@1 1560
nuclear@1 1561 /* Process the input block. */
nuclear@1 1562 for (;;) {
nuclear@1 1563 /* Make sure that we always have enough lookahead, except
nuclear@1 1564 * at the end of the input file. We need MAX_MATCH bytes
nuclear@1 1565 * for the next match, plus MIN_MATCH bytes to insert the
nuclear@1 1566 * string following the next match.
nuclear@1 1567 */
nuclear@1 1568 if (s->lookahead < MIN_LOOKAHEAD) {
nuclear@1 1569 fill_window(s);
nuclear@1 1570 if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
nuclear@1 1571 return need_more;
nuclear@1 1572 }
nuclear@1 1573 if (s->lookahead == 0) break; /* flush the current block */
nuclear@1 1574 }
nuclear@1 1575
nuclear@1 1576 /* Insert the string window[strstart .. strstart+2] in the
nuclear@1 1577 * dictionary, and set hash_head to the head of the hash chain:
nuclear@1 1578 */
nuclear@1 1579 if (s->lookahead >= MIN_MATCH) {
nuclear@1 1580 INSERT_STRING(s, s->strstart, hash_head);
nuclear@1 1581 }
nuclear@1 1582
nuclear@1 1583 /* Find the longest match, discarding those <= prev_length.
nuclear@1 1584 */
nuclear@1 1585 s->prev_length = s->match_length, s->prev_match = s->match_start;
nuclear@1 1586 s->match_length = MIN_MATCH-1;
nuclear@1 1587
nuclear@1 1588 if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
nuclear@1 1589 s->strstart - hash_head <= MAX_DIST(s)) {
nuclear@1 1590 /* To simplify the code, we prevent matches with the string
nuclear@1 1591 * of window index 0 (in particular we have to avoid a match
nuclear@1 1592 * of the string with itself at the start of the input file).
nuclear@1 1593 */
nuclear@1 1594 if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {
nuclear@1 1595 s->match_length = longest_match (s, hash_head);
nuclear@1 1596 } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
nuclear@1 1597 s->match_length = longest_match_fast (s, hash_head);
nuclear@1 1598 }
nuclear@1 1599 /* longest_match() or longest_match_fast() sets match_start */
nuclear@1 1600
nuclear@1 1601 if (s->match_length <= 5 && (s->strategy == Z_FILTERED
nuclear@1 1602 #if TOO_FAR <= 32767
nuclear@1 1603 || (s->match_length == MIN_MATCH &&
nuclear@1 1604 s->strstart - s->match_start > TOO_FAR)
nuclear@1 1605 #endif
nuclear@1 1606 )) {
nuclear@1 1607
nuclear@1 1608 /* If prev_match is also MIN_MATCH, match_start is garbage
nuclear@1 1609 * but we will ignore the current match anyway.
nuclear@1 1610 */
nuclear@1 1611 s->match_length = MIN_MATCH-1;
nuclear@1 1612 }
nuclear@1 1613 }
nuclear@1 1614 /* If there was a match at the previous step and the current
nuclear@1 1615 * match is not better, output the previous match:
nuclear@1 1616 */
nuclear@1 1617 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
nuclear@1 1618 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
nuclear@1 1619 /* Do not insert strings in hash table beyond this. */
nuclear@1 1620
nuclear@1 1621 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
nuclear@1 1622
nuclear@1 1623 _tr_tally_dist(s, s->strstart -1 - s->prev_match,
nuclear@1 1624 s->prev_length - MIN_MATCH, bflush);
nuclear@1 1625
nuclear@1 1626 /* Insert in hash table all strings up to the end of the match.
nuclear@1 1627 * strstart-1 and strstart are already inserted. If there is not
nuclear@1 1628 * enough lookahead, the last two strings are not inserted in
nuclear@1 1629 * the hash table.
nuclear@1 1630 */
nuclear@1 1631 s->lookahead -= s->prev_length-1;
nuclear@1 1632 s->prev_length -= 2;
nuclear@1 1633 do {
nuclear@1 1634 if (++s->strstart <= max_insert) {
nuclear@1 1635 INSERT_STRING(s, s->strstart, hash_head);
nuclear@1 1636 }
nuclear@1 1637 } while (--s->prev_length != 0);
nuclear@1 1638 s->match_available = 0;
nuclear@1 1639 s->match_length = MIN_MATCH-1;
nuclear@1 1640 s->strstart++;
nuclear@1 1641
nuclear@1 1642 if (bflush) FLUSH_BLOCK(s, 0);
nuclear@1 1643
nuclear@1 1644 } else if (s->match_available) {
nuclear@1 1645 /* If there was no match at the previous position, output a
nuclear@1 1646 * single literal. If there was a match but the current match
nuclear@1 1647 * is longer, truncate the previous match to a single literal.
nuclear@1 1648 */
nuclear@1 1649 Tracevv((stderr,"%c", s->window[s->strstart-1]));
nuclear@1 1650 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
nuclear@1 1651 if (bflush) {
nuclear@1 1652 FLUSH_BLOCK_ONLY(s, 0);
nuclear@1 1653 }
nuclear@1 1654 s->strstart++;
nuclear@1 1655 s->lookahead--;
nuclear@1 1656 if (s->strm->avail_out == 0) return need_more;
nuclear@1 1657 } else {
nuclear@1 1658 /* There is no previous match to compare with, wait for
nuclear@1 1659 * the next step to decide.
nuclear@1 1660 */
nuclear@1 1661 s->match_available = 1;
nuclear@1 1662 s->strstart++;
nuclear@1 1663 s->lookahead--;
nuclear@1 1664 }
nuclear@1 1665 }
nuclear@1 1666 Assert (flush != Z_NO_FLUSH, "no flush?");
nuclear@1 1667 if (s->match_available) {
nuclear@1 1668 Tracevv((stderr,"%c", s->window[s->strstart-1]));
nuclear@1 1669 _tr_tally_lit(s, s->window[s->strstart-1], bflush);
nuclear@1 1670 s->match_available = 0;
nuclear@1 1671 }
nuclear@1 1672 FLUSH_BLOCK(s, flush == Z_FINISH);
nuclear@1 1673 return flush == Z_FINISH ? finish_done : block_done;
nuclear@1 1674 }
nuclear@1 1675 #endif /* FASTEST */
nuclear@1 1676
nuclear@1 1677 #if 0
nuclear@1 1678 /* ===========================================================================
nuclear@1 1679 * For Z_RLE, simply look for runs of bytes, generate matches only of distance
nuclear@1 1680 * one. Do not maintain a hash table. (It will be regenerated if this run of
nuclear@1 1681 * deflate switches away from Z_RLE.)
nuclear@1 1682 */
nuclear@1 1683 local block_state deflate_rle(s, flush)
nuclear@1 1684 deflate_state *s;
nuclear@1 1685 int flush;
nuclear@1 1686 {
nuclear@1 1687 int bflush; /* set if current block must be flushed */
nuclear@1 1688 uInt run; /* length of run */
nuclear@1 1689 uInt max; /* maximum length of run */
nuclear@1 1690 uInt prev; /* byte at distance one to match */
nuclear@1 1691 Bytef *scan; /* scan for end of run */
nuclear@1 1692
nuclear@1 1693 for (;;) {
nuclear@1 1694 /* Make sure that we always have enough lookahead, except
nuclear@1 1695 * at the end of the input file. We need MAX_MATCH bytes
nuclear@1 1696 * for the longest encodable run.
nuclear@1 1697 */
nuclear@1 1698 if (s->lookahead < MAX_MATCH) {
nuclear@1 1699 fill_window(s);
nuclear@1 1700 if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {
nuclear@1 1701 return need_more;
nuclear@1 1702 }
nuclear@1 1703 if (s->lookahead == 0) break; /* flush the current block */
nuclear@1 1704 }
nuclear@1 1705
nuclear@1 1706 /* See how many times the previous byte repeats */
nuclear@1 1707 run = 0;
nuclear@1 1708 if (s->strstart > 0) { /* if there is a previous byte, that is */
nuclear@1 1709 max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH;
nuclear@1 1710 scan = s->window + s->strstart - 1;
nuclear@1 1711 prev = *scan++;
nuclear@1 1712 do {
nuclear@1 1713 if (*scan++ != prev)
nuclear@1 1714 break;
nuclear@1 1715 } while (++run < max);
nuclear@1 1716 }
nuclear@1 1717
nuclear@1 1718 /* Emit match if have run of MIN_MATCH or longer, else emit literal */
nuclear@1 1719 if (run >= MIN_MATCH) {
nuclear@1 1720 check_match(s, s->strstart, s->strstart - 1, run);
nuclear@1 1721 _tr_tally_dist(s, 1, run - MIN_MATCH, bflush);
nuclear@1 1722 s->lookahead -= run;
nuclear@1 1723 s->strstart += run;
nuclear@1 1724 } else {
nuclear@1 1725 /* No match, output a literal byte */
nuclear@1 1726 Tracevv((stderr,"%c", s->window[s->strstart]));
nuclear@1 1727 _tr_tally_lit (s, s->window[s->strstart], bflush);
nuclear@1 1728 s->lookahead--;
nuclear@1 1729 s->strstart++;
nuclear@1 1730 }
nuclear@1 1731 if (bflush) FLUSH_BLOCK(s, 0);
nuclear@1 1732 }
nuclear@1 1733 FLUSH_BLOCK(s, flush == Z_FINISH);
nuclear@1 1734 return flush == Z_FINISH ? finish_done : block_done;
nuclear@1 1735 }
nuclear@1 1736 #endif