17c478bd9Sstevel@tonic-gate /* 27c478bd9Sstevel@tonic-gate * This file is derived from various .h and .c files from the zlib-0.95 37c478bd9Sstevel@tonic-gate * distribution by Jean-loup Gailly and Mark Adler, with some additions 47c478bd9Sstevel@tonic-gate * by Paul Mackerras to aid in implementing Deflate compression and 57c478bd9Sstevel@tonic-gate * decompression for PPP packets. See zlib.h for conditions of 67c478bd9Sstevel@tonic-gate * distribution and use. 77c478bd9Sstevel@tonic-gate * 87c478bd9Sstevel@tonic-gate * Changes that have been made include: 97c478bd9Sstevel@tonic-gate * - changed functions not used outside this file to "local" 107c478bd9Sstevel@tonic-gate * - added minCompression parameter to deflateInit2 117c478bd9Sstevel@tonic-gate * - added Z_PACKET_FLUSH (see zlib.h for details) 127c478bd9Sstevel@tonic-gate * - added inflateIncomp 137c478bd9Sstevel@tonic-gate * 147c478bd9Sstevel@tonic-gate * $Id: zlib.c,v 1.2 1999/04/01 07:26:30 paulus Exp $ 157c478bd9Sstevel@tonic-gate */ 167c478bd9Sstevel@tonic-gate 177c478bd9Sstevel@tonic-gate 187c478bd9Sstevel@tonic-gate /*+++++*/ 197c478bd9Sstevel@tonic-gate /* zutil.h -- internal interface and configuration of the compression library 207c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Jean-loup Gailly. 217c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 227c478bd9Sstevel@tonic-gate */ 237c478bd9Sstevel@tonic-gate 247c478bd9Sstevel@tonic-gate /* WARNING: this file should *not* be used by applications. It is 257c478bd9Sstevel@tonic-gate part of the implementation of the compression library and is 267c478bd9Sstevel@tonic-gate subject to change. Applications should only use zlib.h. 277c478bd9Sstevel@tonic-gate */ 287c478bd9Sstevel@tonic-gate 297c478bd9Sstevel@tonic-gate /* From: zutil.h,v 1.9 1995/05/03 17:27:12 jloup Exp */ 307c478bd9Sstevel@tonic-gate 317c478bd9Sstevel@tonic-gate #define _Z_UTIL_H 327c478bd9Sstevel@tonic-gate 337c478bd9Sstevel@tonic-gate #include "zlib.h" 347c478bd9Sstevel@tonic-gate 357c478bd9Sstevel@tonic-gate #ifdef STDC 367c478bd9Sstevel@tonic-gate # include <string.h> 377c478bd9Sstevel@tonic-gate #endif 387c478bd9Sstevel@tonic-gate 397c478bd9Sstevel@tonic-gate #ifndef local 407c478bd9Sstevel@tonic-gate # define local static 417c478bd9Sstevel@tonic-gate #endif 427c478bd9Sstevel@tonic-gate /* compile with -Dlocal if your debugger can't find static symbols */ 437c478bd9Sstevel@tonic-gate 447c478bd9Sstevel@tonic-gate #define FAR 457c478bd9Sstevel@tonic-gate 467c478bd9Sstevel@tonic-gate typedef unsigned char uch; 477c478bd9Sstevel@tonic-gate typedef uch FAR uchf; 487c478bd9Sstevel@tonic-gate typedef unsigned short ush; 497c478bd9Sstevel@tonic-gate typedef ush FAR ushf; 507c478bd9Sstevel@tonic-gate typedef unsigned long ulg; 517c478bd9Sstevel@tonic-gate 527c478bd9Sstevel@tonic-gate extern char *z_errmsg[]; /* indexed by 1-zlib_error */ 537c478bd9Sstevel@tonic-gate 547c478bd9Sstevel@tonic-gate #define ERR_RETURN(strm,err) return (strm->msg=z_errmsg[1-err], err) 557c478bd9Sstevel@tonic-gate /* To be used only when the state is known to be valid */ 567c478bd9Sstevel@tonic-gate 577c478bd9Sstevel@tonic-gate #ifndef NULL 587c478bd9Sstevel@tonic-gate #define NULL ((void *) 0) 597c478bd9Sstevel@tonic-gate #endif 607c478bd9Sstevel@tonic-gate 617c478bd9Sstevel@tonic-gate /* common constants */ 627c478bd9Sstevel@tonic-gate 637c478bd9Sstevel@tonic-gate #define DEFLATED 8 647c478bd9Sstevel@tonic-gate 657c478bd9Sstevel@tonic-gate #ifndef DEF_WBITS 667c478bd9Sstevel@tonic-gate # define DEF_WBITS MAX_WBITS 677c478bd9Sstevel@tonic-gate #endif 687c478bd9Sstevel@tonic-gate /* default windowBits for decompression. MAX_WBITS is for compression only */ 697c478bd9Sstevel@tonic-gate 707c478bd9Sstevel@tonic-gate #if MAX_MEM_LEVEL >= 8 717c478bd9Sstevel@tonic-gate # define DEF_MEM_LEVEL 8 727c478bd9Sstevel@tonic-gate #else 737c478bd9Sstevel@tonic-gate # define DEF_MEM_LEVEL MAX_MEM_LEVEL 747c478bd9Sstevel@tonic-gate #endif 757c478bd9Sstevel@tonic-gate /* default memLevel */ 767c478bd9Sstevel@tonic-gate 777c478bd9Sstevel@tonic-gate #define STORED_BLOCK 0 787c478bd9Sstevel@tonic-gate #define STATIC_TREES 1 797c478bd9Sstevel@tonic-gate #define DYN_TREES 2 807c478bd9Sstevel@tonic-gate /* The three kinds of block type */ 817c478bd9Sstevel@tonic-gate 827c478bd9Sstevel@tonic-gate #define MIN_MATCH 3 837c478bd9Sstevel@tonic-gate #define MAX_MATCH 258 847c478bd9Sstevel@tonic-gate /* The minimum and maximum match lengths */ 857c478bd9Sstevel@tonic-gate 867c478bd9Sstevel@tonic-gate /* functions */ 877c478bd9Sstevel@tonic-gate 887c478bd9Sstevel@tonic-gate #if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY) 897c478bd9Sstevel@tonic-gate # define HAVE_MEMCPY 907c478bd9Sstevel@tonic-gate #endif 917c478bd9Sstevel@tonic-gate #ifdef HAVE_MEMCPY 927c478bd9Sstevel@tonic-gate # define zmemcpy memcpy 937c478bd9Sstevel@tonic-gate # define zmemzero(dest, len) memset(dest, 0, len) 947c478bd9Sstevel@tonic-gate #else 957c478bd9Sstevel@tonic-gate # define zmemcpy(d, s, n) bcopy((s), (d), (n)) 967c478bd9Sstevel@tonic-gate # define zmemzero bzero 977c478bd9Sstevel@tonic-gate #endif 987c478bd9Sstevel@tonic-gate 997c478bd9Sstevel@tonic-gate /* Diagnostic functions */ 1007c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 1017c478bd9Sstevel@tonic-gate # include <stdio.h> 1027c478bd9Sstevel@tonic-gate # ifndef verbose 1037c478bd9Sstevel@tonic-gate # define verbose 0 1047c478bd9Sstevel@tonic-gate # endif 1057c478bd9Sstevel@tonic-gate # define Assert(cond,msg) {if(!(cond)) z_error(msg);} 1067c478bd9Sstevel@tonic-gate # define Trace(x) fprintf x 1077c478bd9Sstevel@tonic-gate # define Tracev(x) {if (verbose) fprintf x ;} 1087c478bd9Sstevel@tonic-gate # define Tracevv(x) {if (verbose>1) fprintf x ;} 1097c478bd9Sstevel@tonic-gate # define Tracec(c,x) {if (verbose && (c)) fprintf x ;} 1107c478bd9Sstevel@tonic-gate # define Tracecv(c,x) {if (verbose>1 && (c)) fprintf x ;} 1117c478bd9Sstevel@tonic-gate #else 1127c478bd9Sstevel@tonic-gate # define Assert(cond,msg) 1137c478bd9Sstevel@tonic-gate # define Trace(x) 1147c478bd9Sstevel@tonic-gate # define Tracev(x) 1157c478bd9Sstevel@tonic-gate # define Tracevv(x) 1167c478bd9Sstevel@tonic-gate # define Tracec(c,x) 1177c478bd9Sstevel@tonic-gate # define Tracecv(c,x) 1187c478bd9Sstevel@tonic-gate #endif 1197c478bd9Sstevel@tonic-gate 1207c478bd9Sstevel@tonic-gate 1217c478bd9Sstevel@tonic-gate typedef uLong (*check_func) OF((uLong check, Bytef *buf, uInt len)); 1227c478bd9Sstevel@tonic-gate 1237c478bd9Sstevel@tonic-gate /* voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size)); */ 1247c478bd9Sstevel@tonic-gate /* void zcfree OF((voidpf opaque, voidpf ptr)); */ 1257c478bd9Sstevel@tonic-gate 1267c478bd9Sstevel@tonic-gate #define ZALLOC(strm, items, size) \ 1277c478bd9Sstevel@tonic-gate (*((strm)->zalloc))((strm)->opaque, (items), (size)) 1287c478bd9Sstevel@tonic-gate #define ZFREE(strm, addr, size) \ 1297c478bd9Sstevel@tonic-gate (*((strm)->zfree))((strm)->opaque, (voidpf)(addr), (size)) 1307c478bd9Sstevel@tonic-gate #define TRY_FREE(s, p, n) {if (p) ZFREE(s, p, n);} 1317c478bd9Sstevel@tonic-gate 1327c478bd9Sstevel@tonic-gate /* deflate.h -- internal compression state 1337c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Jean-loup Gailly 1347c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 1357c478bd9Sstevel@tonic-gate */ 1367c478bd9Sstevel@tonic-gate 1377c478bd9Sstevel@tonic-gate /* WARNING: this file should *not* be used by applications. It is 1387c478bd9Sstevel@tonic-gate part of the implementation of the compression library and is 1397c478bd9Sstevel@tonic-gate subject to change. Applications should only use zlib.h. 1407c478bd9Sstevel@tonic-gate */ 1417c478bd9Sstevel@tonic-gate 1427c478bd9Sstevel@tonic-gate 1437c478bd9Sstevel@tonic-gate /*+++++*/ 1447c478bd9Sstevel@tonic-gate /* From: deflate.h,v 1.5 1995/05/03 17:27:09 jloup Exp */ 1457c478bd9Sstevel@tonic-gate 1467c478bd9Sstevel@tonic-gate /* =========================================================================== 1477c478bd9Sstevel@tonic-gate * Internal compression state. 1487c478bd9Sstevel@tonic-gate */ 1497c478bd9Sstevel@tonic-gate 1507c478bd9Sstevel@tonic-gate /* Data type */ 1517c478bd9Sstevel@tonic-gate #define BINARY 0 1527c478bd9Sstevel@tonic-gate #define ASCII 1 1537c478bd9Sstevel@tonic-gate #define UNKNOWN 2 1547c478bd9Sstevel@tonic-gate 1557c478bd9Sstevel@tonic-gate #define LENGTH_CODES 29 1567c478bd9Sstevel@tonic-gate /* number of length codes, not counting the special END_BLOCK code */ 1577c478bd9Sstevel@tonic-gate 1587c478bd9Sstevel@tonic-gate #define LITERALS 256 1597c478bd9Sstevel@tonic-gate /* number of literal bytes 0..255 */ 1607c478bd9Sstevel@tonic-gate 1617c478bd9Sstevel@tonic-gate #define L_CODES (LITERALS+1+LENGTH_CODES) 1627c478bd9Sstevel@tonic-gate /* number of Literal or Length codes, including the END_BLOCK code */ 1637c478bd9Sstevel@tonic-gate 1647c478bd9Sstevel@tonic-gate #define D_CODES 30 1657c478bd9Sstevel@tonic-gate /* number of distance codes */ 1667c478bd9Sstevel@tonic-gate 1677c478bd9Sstevel@tonic-gate #define BL_CODES 19 1687c478bd9Sstevel@tonic-gate /* number of codes used to transfer the bit lengths */ 1697c478bd9Sstevel@tonic-gate 1707c478bd9Sstevel@tonic-gate #define HEAP_SIZE (2*L_CODES+1) 1717c478bd9Sstevel@tonic-gate /* maximum heap size */ 1727c478bd9Sstevel@tonic-gate 1737c478bd9Sstevel@tonic-gate #define MAX_BITS 15 1747c478bd9Sstevel@tonic-gate /* All codes must not exceed MAX_BITS bits */ 1757c478bd9Sstevel@tonic-gate 1767c478bd9Sstevel@tonic-gate #define INIT_STATE 42 1777c478bd9Sstevel@tonic-gate #define BUSY_STATE 113 1787c478bd9Sstevel@tonic-gate #define FLUSH_STATE 124 1797c478bd9Sstevel@tonic-gate #define FINISH_STATE 666 1807c478bd9Sstevel@tonic-gate /* Stream status */ 1817c478bd9Sstevel@tonic-gate 1827c478bd9Sstevel@tonic-gate 1837c478bd9Sstevel@tonic-gate /* Data structure describing a single value and its code string. */ 1847c478bd9Sstevel@tonic-gate typedef struct ct_data_s { 1857c478bd9Sstevel@tonic-gate union { 1867c478bd9Sstevel@tonic-gate ush freq; /* frequency count */ 1877c478bd9Sstevel@tonic-gate ush code; /* bit string */ 1887c478bd9Sstevel@tonic-gate } fc; 1897c478bd9Sstevel@tonic-gate union { 1907c478bd9Sstevel@tonic-gate ush dad; /* father node in Huffman tree */ 1917c478bd9Sstevel@tonic-gate ush len; /* length of bit string */ 1927c478bd9Sstevel@tonic-gate } dl; 1937c478bd9Sstevel@tonic-gate } FAR ct_data; 1947c478bd9Sstevel@tonic-gate 1957c478bd9Sstevel@tonic-gate #define Freq fc.freq 1967c478bd9Sstevel@tonic-gate #define Code fc.code 1977c478bd9Sstevel@tonic-gate #define Dad dl.dad 1987c478bd9Sstevel@tonic-gate #define Len dl.len 1997c478bd9Sstevel@tonic-gate 2007c478bd9Sstevel@tonic-gate typedef struct static_tree_desc_s static_tree_desc; 2017c478bd9Sstevel@tonic-gate 2027c478bd9Sstevel@tonic-gate typedef struct tree_desc_s { 2037c478bd9Sstevel@tonic-gate ct_data *dyn_tree; /* the dynamic tree */ 2047c478bd9Sstevel@tonic-gate int max_code; /* largest code with non zero frequency */ 2057c478bd9Sstevel@tonic-gate static_tree_desc *stat_desc; /* the corresponding static tree */ 2067c478bd9Sstevel@tonic-gate } FAR tree_desc; 2077c478bd9Sstevel@tonic-gate 2087c478bd9Sstevel@tonic-gate typedef ush Pos; 2097c478bd9Sstevel@tonic-gate typedef Pos FAR Posf; 2107c478bd9Sstevel@tonic-gate typedef unsigned IPos; 2117c478bd9Sstevel@tonic-gate 2127c478bd9Sstevel@tonic-gate /* A Pos is an index in the character window. We use short instead of int to 2137c478bd9Sstevel@tonic-gate * save space in the various tables. IPos is used only for parameter passing. 2147c478bd9Sstevel@tonic-gate */ 2157c478bd9Sstevel@tonic-gate 2167c478bd9Sstevel@tonic-gate typedef struct deflate_state { 2177c478bd9Sstevel@tonic-gate z_stream *strm; /* pointer back to this zlib stream */ 2187c478bd9Sstevel@tonic-gate int status; /* as the name implies */ 2197c478bd9Sstevel@tonic-gate Bytef *pending_buf; /* output still pending */ 2207c478bd9Sstevel@tonic-gate Bytef *pending_out; /* next pending byte to output to the stream */ 2217c478bd9Sstevel@tonic-gate int pending; /* nb of bytes in the pending buffer */ 2227c478bd9Sstevel@tonic-gate uLong adler; /* adler32 of uncompressed data */ 2237c478bd9Sstevel@tonic-gate int noheader; /* suppress zlib header and adler32 */ 2247c478bd9Sstevel@tonic-gate Byte data_type; /* UNKNOWN, BINARY or ASCII */ 2257c478bd9Sstevel@tonic-gate Byte method; /* STORED (for zip only) or DEFLATED */ 2267c478bd9Sstevel@tonic-gate int minCompr; /* min size decrease for Z_FLUSH_NOSTORE */ 2277c478bd9Sstevel@tonic-gate 2287c478bd9Sstevel@tonic-gate /* used by deflate.c: */ 2297c478bd9Sstevel@tonic-gate 2307c478bd9Sstevel@tonic-gate uInt w_size; /* LZ77 window size (32K by default) */ 2317c478bd9Sstevel@tonic-gate uInt w_bits; /* log2(w_size) (8..16) */ 2327c478bd9Sstevel@tonic-gate uInt w_mask; /* w_size - 1 */ 2337c478bd9Sstevel@tonic-gate 2347c478bd9Sstevel@tonic-gate Bytef *window; 2357c478bd9Sstevel@tonic-gate /* Sliding window. Input bytes are read into the second half of the window, 2367c478bd9Sstevel@tonic-gate * and move to the first half later to keep a dictionary of at least wSize 2377c478bd9Sstevel@tonic-gate * bytes. With this organization, matches are limited to a distance of 2387c478bd9Sstevel@tonic-gate * wSize-MAX_MATCH bytes, but this ensures that IO is always 2397c478bd9Sstevel@tonic-gate * performed with a length multiple of the block size. Also, it limits 2407c478bd9Sstevel@tonic-gate * the window size to 64K, which is quite useful on MSDOS. 2417c478bd9Sstevel@tonic-gate * To do: use the user input buffer as sliding window. 2427c478bd9Sstevel@tonic-gate */ 2437c478bd9Sstevel@tonic-gate 2447c478bd9Sstevel@tonic-gate ulg window_size; 2457c478bd9Sstevel@tonic-gate /* Actual size of window: 2*wSize, except when the user input buffer 2467c478bd9Sstevel@tonic-gate * is directly used as sliding window. 2477c478bd9Sstevel@tonic-gate */ 2487c478bd9Sstevel@tonic-gate 2497c478bd9Sstevel@tonic-gate Posf *prev; 2507c478bd9Sstevel@tonic-gate /* Link to older string with same hash index. To limit the size of this 2517c478bd9Sstevel@tonic-gate * array to 64K, this link is maintained only for the last 32K strings. 2527c478bd9Sstevel@tonic-gate * An index in this array is thus a window index modulo 32K. 2537c478bd9Sstevel@tonic-gate */ 2547c478bd9Sstevel@tonic-gate 2557c478bd9Sstevel@tonic-gate Posf *head; /* Heads of the hash chains or NIL. */ 2567c478bd9Sstevel@tonic-gate 2577c478bd9Sstevel@tonic-gate uInt ins_h; /* hash index of string to be inserted */ 2587c478bd9Sstevel@tonic-gate uInt hash_size; /* number of elements in hash table */ 2597c478bd9Sstevel@tonic-gate uInt hash_bits; /* log2(hash_size) */ 2607c478bd9Sstevel@tonic-gate uInt hash_mask; /* hash_size-1 */ 2617c478bd9Sstevel@tonic-gate 2627c478bd9Sstevel@tonic-gate uInt hash_shift; 2637c478bd9Sstevel@tonic-gate /* Number of bits by which ins_h must be shifted at each input 2647c478bd9Sstevel@tonic-gate * step. It must be such that after MIN_MATCH steps, the oldest 2657c478bd9Sstevel@tonic-gate * byte no longer takes part in the hash key, that is: 2667c478bd9Sstevel@tonic-gate * hash_shift * MIN_MATCH >= hash_bits 2677c478bd9Sstevel@tonic-gate */ 2687c478bd9Sstevel@tonic-gate 2697c478bd9Sstevel@tonic-gate long block_start; 2707c478bd9Sstevel@tonic-gate /* Window position at the beginning of the current output block. Gets 2717c478bd9Sstevel@tonic-gate * negative when the window is moved backwards. 2727c478bd9Sstevel@tonic-gate */ 2737c478bd9Sstevel@tonic-gate 2747c478bd9Sstevel@tonic-gate uInt match_length; /* length of best match */ 2757c478bd9Sstevel@tonic-gate IPos prev_match; /* previous match */ 2767c478bd9Sstevel@tonic-gate int match_available; /* set if previous match exists */ 2777c478bd9Sstevel@tonic-gate uInt strstart; /* start of string to insert */ 2787c478bd9Sstevel@tonic-gate uInt match_start; /* start of matching string */ 2797c478bd9Sstevel@tonic-gate uInt lookahead; /* number of valid bytes ahead in window */ 2807c478bd9Sstevel@tonic-gate 2817c478bd9Sstevel@tonic-gate uInt prev_length; 2827c478bd9Sstevel@tonic-gate /* Length of the best match at previous step. Matches not greater than this 2837c478bd9Sstevel@tonic-gate * are discarded. This is used in the lazy match evaluation. 2847c478bd9Sstevel@tonic-gate */ 2857c478bd9Sstevel@tonic-gate 2867c478bd9Sstevel@tonic-gate uInt max_chain_length; 2877c478bd9Sstevel@tonic-gate /* To speed up deflation, hash chains are never searched beyond this 2887c478bd9Sstevel@tonic-gate * length. A higher limit improves compression ratio but degrades the 2897c478bd9Sstevel@tonic-gate * speed. 2907c478bd9Sstevel@tonic-gate */ 2917c478bd9Sstevel@tonic-gate 2927c478bd9Sstevel@tonic-gate uInt max_lazy_match; 2937c478bd9Sstevel@tonic-gate /* Attempt to find a better match only when the current match is strictly 2947c478bd9Sstevel@tonic-gate * smaller than this value. This mechanism is used only for compression 2957c478bd9Sstevel@tonic-gate * levels >= 4. 2967c478bd9Sstevel@tonic-gate */ 2977c478bd9Sstevel@tonic-gate # define max_insert_length max_lazy_match 2987c478bd9Sstevel@tonic-gate /* Insert new strings in the hash table only if the match length is not 2997c478bd9Sstevel@tonic-gate * greater than this length. This saves time but degrades compression. 3007c478bd9Sstevel@tonic-gate * max_insert_length is used only for compression levels <= 3. 3017c478bd9Sstevel@tonic-gate */ 3027c478bd9Sstevel@tonic-gate 3037c478bd9Sstevel@tonic-gate int level; /* compression level (1..9) */ 3047c478bd9Sstevel@tonic-gate int strategy; /* favor or force Huffman coding*/ 3057c478bd9Sstevel@tonic-gate 3067c478bd9Sstevel@tonic-gate uInt good_match; 3077c478bd9Sstevel@tonic-gate /* Use a faster search when the previous match is longer than this */ 3087c478bd9Sstevel@tonic-gate 3097c478bd9Sstevel@tonic-gate int nice_match; /* Stop searching when current match exceeds this */ 3107c478bd9Sstevel@tonic-gate 3117c478bd9Sstevel@tonic-gate /* used by trees.c: */ 3127c478bd9Sstevel@tonic-gate /* Didn't use ct_data typedef below to supress compiler warning */ 3137c478bd9Sstevel@tonic-gate struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 3147c478bd9Sstevel@tonic-gate struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 3157c478bd9Sstevel@tonic-gate struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 3167c478bd9Sstevel@tonic-gate 3177c478bd9Sstevel@tonic-gate struct tree_desc_s l_desc; /* desc. for literal tree */ 3187c478bd9Sstevel@tonic-gate struct tree_desc_s d_desc; /* desc. for distance tree */ 3197c478bd9Sstevel@tonic-gate struct tree_desc_s bl_desc; /* desc. for bit length tree */ 3207c478bd9Sstevel@tonic-gate 3217c478bd9Sstevel@tonic-gate ush bl_count[MAX_BITS+1]; 3227c478bd9Sstevel@tonic-gate /* number of codes at each bit length for an optimal tree */ 3237c478bd9Sstevel@tonic-gate 3247c478bd9Sstevel@tonic-gate int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ 3257c478bd9Sstevel@tonic-gate int heap_len; /* number of elements in the heap */ 3267c478bd9Sstevel@tonic-gate int heap_max; /* element of largest frequency */ 3277c478bd9Sstevel@tonic-gate /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. 3287c478bd9Sstevel@tonic-gate * The same heap array is used to build all trees. 3297c478bd9Sstevel@tonic-gate */ 3307c478bd9Sstevel@tonic-gate 3317c478bd9Sstevel@tonic-gate uch depth[2*L_CODES+1]; 3327c478bd9Sstevel@tonic-gate /* Depth of each subtree used as tie breaker for trees of equal frequency 3337c478bd9Sstevel@tonic-gate */ 3347c478bd9Sstevel@tonic-gate 3357c478bd9Sstevel@tonic-gate uchf *l_buf; /* buffer for literals or lengths */ 3367c478bd9Sstevel@tonic-gate 3377c478bd9Sstevel@tonic-gate uInt lit_bufsize; 3387c478bd9Sstevel@tonic-gate /* Size of match buffer for literals/lengths. There are 4 reasons for 3397c478bd9Sstevel@tonic-gate * limiting lit_bufsize to 64K: 3407c478bd9Sstevel@tonic-gate * - frequencies can be kept in 16 bit counters 3417c478bd9Sstevel@tonic-gate * - if compression is not successful for the first block, all input 3427c478bd9Sstevel@tonic-gate * data is still in the window so we can still emit a stored block even 3437c478bd9Sstevel@tonic-gate * when input comes from standard input. (This can also be done for 3447c478bd9Sstevel@tonic-gate * all blocks if lit_bufsize is not greater than 32K.) 3457c478bd9Sstevel@tonic-gate * - if compression is not successful for a file smaller than 64K, we can 3467c478bd9Sstevel@tonic-gate * even emit a stored file instead of a stored block (saving 5 bytes). 3477c478bd9Sstevel@tonic-gate * This is applicable only for zip (not gzip or zlib). 3487c478bd9Sstevel@tonic-gate * - creating new Huffman trees less frequently may not provide fast 3497c478bd9Sstevel@tonic-gate * adaptation to changes in the input data statistics. (Take for 3507c478bd9Sstevel@tonic-gate * example a binary file with poorly compressible code followed by 3517c478bd9Sstevel@tonic-gate * a highly compressible string table.) Smaller buffer sizes give 3527c478bd9Sstevel@tonic-gate * fast adaptation but have of course the overhead of transmitting 3537c478bd9Sstevel@tonic-gate * trees more frequently. 3547c478bd9Sstevel@tonic-gate * - I can't count above 4 3557c478bd9Sstevel@tonic-gate */ 3567c478bd9Sstevel@tonic-gate 3577c478bd9Sstevel@tonic-gate uInt last_lit; /* running index in l_buf */ 3587c478bd9Sstevel@tonic-gate 3597c478bd9Sstevel@tonic-gate ushf *d_buf; 3607c478bd9Sstevel@tonic-gate /* Buffer for distances. To simplify the code, d_buf and l_buf have 3617c478bd9Sstevel@tonic-gate * the same number of elements. To use different lengths, an extra flag 3627c478bd9Sstevel@tonic-gate * array would be necessary. 3637c478bd9Sstevel@tonic-gate */ 3647c478bd9Sstevel@tonic-gate 3657c478bd9Sstevel@tonic-gate ulg opt_len; /* bit length of current block with optimal trees */ 3667c478bd9Sstevel@tonic-gate ulg static_len; /* bit length of current block with static trees */ 3677c478bd9Sstevel@tonic-gate ulg compressed_len; /* total bit length of compressed file */ 3687c478bd9Sstevel@tonic-gate uInt matches; /* number of string matches in current block */ 3697c478bd9Sstevel@tonic-gate int last_eob_len; /* bit length of EOB code for last block */ 3707c478bd9Sstevel@tonic-gate 3717c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 3727c478bd9Sstevel@tonic-gate ulg bits_sent; /* bit length of the compressed data */ 3737c478bd9Sstevel@tonic-gate #endif 3747c478bd9Sstevel@tonic-gate 3757c478bd9Sstevel@tonic-gate ush bi_buf; 3767c478bd9Sstevel@tonic-gate /* Output buffer. bits are inserted starting at the bottom (least 3777c478bd9Sstevel@tonic-gate * significant bits). 3787c478bd9Sstevel@tonic-gate */ 3797c478bd9Sstevel@tonic-gate int bi_valid; 3807c478bd9Sstevel@tonic-gate /* Number of valid bits in bi_buf. All bits above the last valid bit 3817c478bd9Sstevel@tonic-gate * are always zero. 3827c478bd9Sstevel@tonic-gate */ 3837c478bd9Sstevel@tonic-gate 3847c478bd9Sstevel@tonic-gate uInt blocks_in_packet; 3857c478bd9Sstevel@tonic-gate /* Number of blocks produced since the last time Z_PACKET_FLUSH 3867c478bd9Sstevel@tonic-gate * was used. 3877c478bd9Sstevel@tonic-gate */ 3887c478bd9Sstevel@tonic-gate 3897c478bd9Sstevel@tonic-gate } FAR deflate_state; 3907c478bd9Sstevel@tonic-gate 3917c478bd9Sstevel@tonic-gate /* Output a byte on the stream. 3927c478bd9Sstevel@tonic-gate * IN assertion: there is enough room in pending_buf. 3937c478bd9Sstevel@tonic-gate */ 3947c478bd9Sstevel@tonic-gate #define put_byte(s, c) {s->pending_buf[s->pending++] = (c);} 3957c478bd9Sstevel@tonic-gate 3967c478bd9Sstevel@tonic-gate 3977c478bd9Sstevel@tonic-gate #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 3987c478bd9Sstevel@tonic-gate /* Minimum amount of lookahead, except at the end of the input file. 3997c478bd9Sstevel@tonic-gate * See deflate.c for comments about the MIN_MATCH+1. 4007c478bd9Sstevel@tonic-gate */ 4017c478bd9Sstevel@tonic-gate 4027c478bd9Sstevel@tonic-gate #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD) 4037c478bd9Sstevel@tonic-gate /* In order to simplify the code, particularly on 16 bit machines, match 4047c478bd9Sstevel@tonic-gate * distances are limited to MAX_DIST instead of WSIZE. 4057c478bd9Sstevel@tonic-gate */ 4067c478bd9Sstevel@tonic-gate 4077c478bd9Sstevel@tonic-gate /* in trees.c */ 4087c478bd9Sstevel@tonic-gate local void ct_init OF((deflate_state *s)); 4097c478bd9Sstevel@tonic-gate local int ct_tally OF((deflate_state *s, int dist, int lc)); 4107c478bd9Sstevel@tonic-gate local ulg ct_flush_block OF((deflate_state *s, charf *buf, ulg stored_len, 4117c478bd9Sstevel@tonic-gate int flush)); 4127c478bd9Sstevel@tonic-gate local void ct_align OF((deflate_state *s)); 4137c478bd9Sstevel@tonic-gate local void ct_stored_block OF((deflate_state *s, charf *buf, ulg stored_len, 4147c478bd9Sstevel@tonic-gate int eof)); 4157c478bd9Sstevel@tonic-gate local void ct_stored_type_only OF((deflate_state *s)); 4167c478bd9Sstevel@tonic-gate 4177c478bd9Sstevel@tonic-gate 4187c478bd9Sstevel@tonic-gate /*+++++*/ 4197c478bd9Sstevel@tonic-gate /* deflate.c -- compress data using the deflation algorithm 4207c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Jean-loup Gailly. 4217c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 4227c478bd9Sstevel@tonic-gate */ 4237c478bd9Sstevel@tonic-gate 4247c478bd9Sstevel@tonic-gate /* 4257c478bd9Sstevel@tonic-gate * ALGORITHM 4267c478bd9Sstevel@tonic-gate * 4277c478bd9Sstevel@tonic-gate * The "deflation" process depends on being able to identify portions 4287c478bd9Sstevel@tonic-gate * of the input text which are identical to earlier input (within a 4297c478bd9Sstevel@tonic-gate * sliding window trailing behind the input currently being processed). 4307c478bd9Sstevel@tonic-gate * 4317c478bd9Sstevel@tonic-gate * The most straightforward technique turns out to be the fastest for 4327c478bd9Sstevel@tonic-gate * most input files: try all possible matches and select the longest. 4337c478bd9Sstevel@tonic-gate * The key feature of this algorithm is that insertions into the string 4347c478bd9Sstevel@tonic-gate * dictionary are very simple and thus fast, and deletions are avoided 4357c478bd9Sstevel@tonic-gate * completely. Insertions are performed at each input character, whereas 4367c478bd9Sstevel@tonic-gate * string matches are performed only when the previous match ends. So it 4377c478bd9Sstevel@tonic-gate * is preferable to spend more time in matches to allow very fast string 4387c478bd9Sstevel@tonic-gate * insertions and avoid deletions. The matching algorithm for small 4397c478bd9Sstevel@tonic-gate * strings is inspired from that of Rabin & Karp. A brute force approach 4407c478bd9Sstevel@tonic-gate * is used to find longer strings when a small match has been found. 4417c478bd9Sstevel@tonic-gate * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze 4427c478bd9Sstevel@tonic-gate * (by Leonid Broukhis). 4437c478bd9Sstevel@tonic-gate * A previous version of this file used a more sophisticated algorithm 4447c478bd9Sstevel@tonic-gate * (by Fiala and Greene) which is guaranteed to run in linear amortized 4457c478bd9Sstevel@tonic-gate * time, but has a larger average cost, uses more memory and is patented. 4467c478bd9Sstevel@tonic-gate * However the F&G algorithm may be faster for some highly redundant 4477c478bd9Sstevel@tonic-gate * files if the parameter max_chain_length (described below) is too large. 4487c478bd9Sstevel@tonic-gate * 4497c478bd9Sstevel@tonic-gate * ACKNOWLEDGEMENTS 4507c478bd9Sstevel@tonic-gate * 4517c478bd9Sstevel@tonic-gate * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and 4527c478bd9Sstevel@tonic-gate * I found it in 'freeze' written by Leonid Broukhis. 4537c478bd9Sstevel@tonic-gate * Thanks to many people for bug reports and testing. 4547c478bd9Sstevel@tonic-gate * 4557c478bd9Sstevel@tonic-gate * REFERENCES 4567c478bd9Sstevel@tonic-gate * 4577c478bd9Sstevel@tonic-gate * Deutsch, L.P.,"'Deflate' Compressed Data Format Specification". 4587c478bd9Sstevel@tonic-gate * Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc 4597c478bd9Sstevel@tonic-gate * 4607c478bd9Sstevel@tonic-gate * A description of the Rabin and Karp algorithm is given in the book 4617c478bd9Sstevel@tonic-gate * "Algorithms" by R. Sedgewick, Addison-Wesley, p252. 4627c478bd9Sstevel@tonic-gate * 4637c478bd9Sstevel@tonic-gate * Fiala,E.R., and Greene,D.H. 4647c478bd9Sstevel@tonic-gate * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595 4657c478bd9Sstevel@tonic-gate * 4667c478bd9Sstevel@tonic-gate */ 4677c478bd9Sstevel@tonic-gate 4687c478bd9Sstevel@tonic-gate /* From: deflate.c,v 1.8 1995/05/03 17:27:08 jloup Exp */ 4697c478bd9Sstevel@tonic-gate 4707c478bd9Sstevel@tonic-gate local char zlib_copyright[] = " deflate Copyright 1995 Jean-loup Gailly "; 4717c478bd9Sstevel@tonic-gate /* 4727c478bd9Sstevel@tonic-gate If you use the zlib library in a product, an acknowledgment is welcome 4737c478bd9Sstevel@tonic-gate in the documentation of your product. If for some reason you cannot 4747c478bd9Sstevel@tonic-gate include such an acknowledgment, I would appreciate that you keep this 4757c478bd9Sstevel@tonic-gate copyright string in the executable of your product. 4767c478bd9Sstevel@tonic-gate */ 4777c478bd9Sstevel@tonic-gate 4787c478bd9Sstevel@tonic-gate #define NIL 0 4797c478bd9Sstevel@tonic-gate /* Tail of hash chains */ 4807c478bd9Sstevel@tonic-gate 4817c478bd9Sstevel@tonic-gate #ifndef TOO_FAR 4827c478bd9Sstevel@tonic-gate # define TOO_FAR 4096 4837c478bd9Sstevel@tonic-gate #endif 4847c478bd9Sstevel@tonic-gate /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */ 4857c478bd9Sstevel@tonic-gate 4867c478bd9Sstevel@tonic-gate #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 4877c478bd9Sstevel@tonic-gate /* Minimum amount of lookahead, except at the end of the input file. 4887c478bd9Sstevel@tonic-gate * See deflate.c for comments about the MIN_MATCH+1. 4897c478bd9Sstevel@tonic-gate */ 4907c478bd9Sstevel@tonic-gate 4917c478bd9Sstevel@tonic-gate /* Values for max_lazy_match, good_match and max_chain_length, depending on 4927c478bd9Sstevel@tonic-gate * the desired pack level (0..9). The values given below have been tuned to 4937c478bd9Sstevel@tonic-gate * exclude worst case performance for pathological files. Better values may be 4947c478bd9Sstevel@tonic-gate * found for specific files. 4957c478bd9Sstevel@tonic-gate */ 4967c478bd9Sstevel@tonic-gate 4977c478bd9Sstevel@tonic-gate typedef struct config_s { 4987c478bd9Sstevel@tonic-gate ush good_length; /* reduce lazy search above this match length */ 4997c478bd9Sstevel@tonic-gate ush max_lazy; /* do not perform lazy search above this match length */ 5007c478bd9Sstevel@tonic-gate ush nice_length; /* quit search above this match length */ 5017c478bd9Sstevel@tonic-gate ush max_chain; 5027c478bd9Sstevel@tonic-gate } config; 5037c478bd9Sstevel@tonic-gate 5047c478bd9Sstevel@tonic-gate local config configuration_table[10] = { 5057c478bd9Sstevel@tonic-gate /* good lazy nice chain */ 5067c478bd9Sstevel@tonic-gate /* 0 */ {0, 0, 0, 0}, /* store only */ 5077c478bd9Sstevel@tonic-gate /* 1 */ {4, 4, 8, 4}, /* maximum speed, no lazy matches */ 5087c478bd9Sstevel@tonic-gate /* 2 */ {4, 5, 16, 8}, 5097c478bd9Sstevel@tonic-gate /* 3 */ {4, 6, 32, 32}, 5107c478bd9Sstevel@tonic-gate 5117c478bd9Sstevel@tonic-gate /* 4 */ {4, 4, 16, 16}, /* lazy matches */ 5127c478bd9Sstevel@tonic-gate /* 5 */ {8, 16, 32, 32}, 5137c478bd9Sstevel@tonic-gate /* 6 */ {8, 16, 128, 128}, 5147c478bd9Sstevel@tonic-gate /* 7 */ {8, 32, 128, 256}, 5157c478bd9Sstevel@tonic-gate /* 8 */ {32, 128, 258, 1024}, 5167c478bd9Sstevel@tonic-gate /* 9 */ {32, 258, 258, 4096}}; /* maximum compression */ 5177c478bd9Sstevel@tonic-gate 5187c478bd9Sstevel@tonic-gate /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 5197c478bd9Sstevel@tonic-gate * For deflate_fast() (levels <= 3) good is ignored and lazy has a different 5207c478bd9Sstevel@tonic-gate * meaning. 5217c478bd9Sstevel@tonic-gate */ 5227c478bd9Sstevel@tonic-gate 5237c478bd9Sstevel@tonic-gate #define EQUAL 0 5247c478bd9Sstevel@tonic-gate /* result of memcmp for equal strings */ 5257c478bd9Sstevel@tonic-gate 5267c478bd9Sstevel@tonic-gate /* =========================================================================== 5277c478bd9Sstevel@tonic-gate * Prototypes for local functions. 5287c478bd9Sstevel@tonic-gate */ 5297c478bd9Sstevel@tonic-gate 5307c478bd9Sstevel@tonic-gate local void fill_window OF((deflate_state *s)); 5317c478bd9Sstevel@tonic-gate local int deflate_fast OF((deflate_state *s, int flush)); 5327c478bd9Sstevel@tonic-gate local int deflate_slow OF((deflate_state *s, int flush)); 5337c478bd9Sstevel@tonic-gate local void lm_init OF((deflate_state *s)); 5347c478bd9Sstevel@tonic-gate local int longest_match OF((deflate_state *s, IPos cur_match)); 5357c478bd9Sstevel@tonic-gate local void putShortMSB OF((deflate_state *s, uInt b)); 5367c478bd9Sstevel@tonic-gate local void flush_pending OF((z_stream *strm)); 5377c478bd9Sstevel@tonic-gate local int read_buf OF((z_stream *strm, charf *buf, unsigned size)); 5387c478bd9Sstevel@tonic-gate #ifdef ASMV 5397c478bd9Sstevel@tonic-gate void match_init OF((void)); /* asm code initialization */ 5407c478bd9Sstevel@tonic-gate #endif 5417c478bd9Sstevel@tonic-gate 5427c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 5437c478bd9Sstevel@tonic-gate local void check_match OF((deflate_state *s, IPos start, IPos match, 5447c478bd9Sstevel@tonic-gate int length)); 5457c478bd9Sstevel@tonic-gate #endif 5467c478bd9Sstevel@tonic-gate 5477c478bd9Sstevel@tonic-gate 5487c478bd9Sstevel@tonic-gate /* =========================================================================== 5497c478bd9Sstevel@tonic-gate * Update a hash value with the given input byte 5507c478bd9Sstevel@tonic-gate * IN assertion: all calls to to UPDATE_HASH are made with consecutive 5517c478bd9Sstevel@tonic-gate * input characters, so that a running hash key can be computed from the 5527c478bd9Sstevel@tonic-gate * previous key instead of complete recalculation each time. 5537c478bd9Sstevel@tonic-gate */ 5547c478bd9Sstevel@tonic-gate #define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask) 5557c478bd9Sstevel@tonic-gate 5567c478bd9Sstevel@tonic-gate 5577c478bd9Sstevel@tonic-gate /* =========================================================================== 5587c478bd9Sstevel@tonic-gate * Insert string str in the dictionary and set match_head to the previous head 5597c478bd9Sstevel@tonic-gate * of the hash chain (the most recent string with same hash key). Return 5607c478bd9Sstevel@tonic-gate * the previous length of the hash chain. 5617c478bd9Sstevel@tonic-gate * IN assertion: all calls to to INSERT_STRING are made with consecutive 5627c478bd9Sstevel@tonic-gate * input characters and the first MIN_MATCH bytes of str are valid 5637c478bd9Sstevel@tonic-gate * (except for the last MIN_MATCH-1 bytes of the input file). 5647c478bd9Sstevel@tonic-gate */ 5657c478bd9Sstevel@tonic-gate #define INSERT_STRING(s, str, match_head) \ 5667c478bd9Sstevel@tonic-gate (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 5677c478bd9Sstevel@tonic-gate s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \ 5687c478bd9Sstevel@tonic-gate s->head[s->ins_h] = (str)) 5697c478bd9Sstevel@tonic-gate 5707c478bd9Sstevel@tonic-gate /* =========================================================================== 5717c478bd9Sstevel@tonic-gate * Initialize the hash table (avoiding 64K overflow for 16 bit systems). 5727c478bd9Sstevel@tonic-gate * prev[] will be initialized on the fly. 5737c478bd9Sstevel@tonic-gate */ 5747c478bd9Sstevel@tonic-gate #define CLEAR_HASH(s) \ 5757c478bd9Sstevel@tonic-gate s->head[s->hash_size-1] = NIL; \ 5767c478bd9Sstevel@tonic-gate zmemzero((charf *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head)); 5777c478bd9Sstevel@tonic-gate 5787c478bd9Sstevel@tonic-gate /* ========================================================================= */ 5797c478bd9Sstevel@tonic-gate int deflateInit (strm, level) 5807c478bd9Sstevel@tonic-gate z_stream *strm; 5817c478bd9Sstevel@tonic-gate int level; 5827c478bd9Sstevel@tonic-gate { 5837c478bd9Sstevel@tonic-gate return deflateInit2 (strm, level, DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, 5847c478bd9Sstevel@tonic-gate 0, 0); 5857c478bd9Sstevel@tonic-gate /* To do: ignore strm->next_in if we use it as window */ 5867c478bd9Sstevel@tonic-gate } 5877c478bd9Sstevel@tonic-gate 5887c478bd9Sstevel@tonic-gate /* ========================================================================= */ 5897c478bd9Sstevel@tonic-gate int deflateInit2 (strm, level, method, windowBits, memLevel, 5907c478bd9Sstevel@tonic-gate strategy, minCompression) 5917c478bd9Sstevel@tonic-gate z_stream *strm; 5927c478bd9Sstevel@tonic-gate int level; 5937c478bd9Sstevel@tonic-gate int method; 5947c478bd9Sstevel@tonic-gate int windowBits; 5957c478bd9Sstevel@tonic-gate int memLevel; 5967c478bd9Sstevel@tonic-gate int strategy; 5977c478bd9Sstevel@tonic-gate int minCompression; 5987c478bd9Sstevel@tonic-gate { 5997c478bd9Sstevel@tonic-gate deflate_state *s; 6007c478bd9Sstevel@tonic-gate int noheader = 0; 6017c478bd9Sstevel@tonic-gate 6027c478bd9Sstevel@tonic-gate if (strm == Z_NULL) return Z_STREAM_ERROR; 6037c478bd9Sstevel@tonic-gate 6047c478bd9Sstevel@tonic-gate strm->msg = Z_NULL; 6057c478bd9Sstevel@tonic-gate /* if (strm->zalloc == Z_NULL) strm->zalloc = zcalloc; */ 6067c478bd9Sstevel@tonic-gate /* if (strm->zfree == Z_NULL) strm->zfree = zcfree; */ 6077c478bd9Sstevel@tonic-gate 6087c478bd9Sstevel@tonic-gate if (level == Z_DEFAULT_COMPRESSION) level = 6; 6097c478bd9Sstevel@tonic-gate 6107c478bd9Sstevel@tonic-gate if (windowBits < 0) { /* undocumented feature: suppress zlib header */ 6117c478bd9Sstevel@tonic-gate noheader = 1; 6127c478bd9Sstevel@tonic-gate windowBits = -windowBits; 6137c478bd9Sstevel@tonic-gate } 6147c478bd9Sstevel@tonic-gate if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != DEFLATED || 6157c478bd9Sstevel@tonic-gate windowBits < 8 || windowBits > 15 || level < 1 || level > 9) { 6167c478bd9Sstevel@tonic-gate return Z_STREAM_ERROR; 6177c478bd9Sstevel@tonic-gate } 6187c478bd9Sstevel@tonic-gate s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state)); 6197c478bd9Sstevel@tonic-gate if (s == Z_NULL) return Z_MEM_ERROR; 6207c478bd9Sstevel@tonic-gate strm->state = (struct internal_state FAR *)s; 6217c478bd9Sstevel@tonic-gate s->strm = strm; 6227c478bd9Sstevel@tonic-gate 6237c478bd9Sstevel@tonic-gate s->noheader = noheader; 6247c478bd9Sstevel@tonic-gate s->w_bits = windowBits; 6257c478bd9Sstevel@tonic-gate s->w_size = 1 << s->w_bits; 6267c478bd9Sstevel@tonic-gate s->w_mask = s->w_size - 1; 6277c478bd9Sstevel@tonic-gate 6287c478bd9Sstevel@tonic-gate s->hash_bits = memLevel + 7; 6297c478bd9Sstevel@tonic-gate s->hash_size = 1 << s->hash_bits; 6307c478bd9Sstevel@tonic-gate s->hash_mask = s->hash_size - 1; 6317c478bd9Sstevel@tonic-gate s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 6327c478bd9Sstevel@tonic-gate 6337c478bd9Sstevel@tonic-gate s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte)); 6347c478bd9Sstevel@tonic-gate s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos)); 6357c478bd9Sstevel@tonic-gate s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos)); 6367c478bd9Sstevel@tonic-gate 6377c478bd9Sstevel@tonic-gate s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ 6387c478bd9Sstevel@tonic-gate 6397c478bd9Sstevel@tonic-gate s->pending_buf = (uchf *) ZALLOC(strm, s->lit_bufsize, 2*sizeof(ush)); 6407c478bd9Sstevel@tonic-gate 6417c478bd9Sstevel@tonic-gate if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL || 6427c478bd9Sstevel@tonic-gate s->pending_buf == Z_NULL) { 6437c478bd9Sstevel@tonic-gate strm->msg = z_errmsg[1-Z_MEM_ERROR]; 6447c478bd9Sstevel@tonic-gate deflateEnd (strm); 6457c478bd9Sstevel@tonic-gate return Z_MEM_ERROR; 6467c478bd9Sstevel@tonic-gate } 6477c478bd9Sstevel@tonic-gate s->d_buf = (ushf *) &(s->pending_buf[s->lit_bufsize]); 6487c478bd9Sstevel@tonic-gate s->l_buf = (uchf *) &(s->pending_buf[3*s->lit_bufsize]); 6497c478bd9Sstevel@tonic-gate /* We overlay pending_buf and d_buf+l_buf. This works since the average 6507c478bd9Sstevel@tonic-gate * output size for (length,distance) codes is <= 32 bits (worst case 6517c478bd9Sstevel@tonic-gate * is 15+15+13=33). 6527c478bd9Sstevel@tonic-gate */ 6537c478bd9Sstevel@tonic-gate 6547c478bd9Sstevel@tonic-gate s->level = level; 6557c478bd9Sstevel@tonic-gate s->strategy = strategy; 6567c478bd9Sstevel@tonic-gate s->method = (Byte)method; 6577c478bd9Sstevel@tonic-gate s->minCompr = minCompression; 6587c478bd9Sstevel@tonic-gate s->blocks_in_packet = 0; 6597c478bd9Sstevel@tonic-gate 6607c478bd9Sstevel@tonic-gate return deflateReset(strm); 6617c478bd9Sstevel@tonic-gate } 6627c478bd9Sstevel@tonic-gate 6637c478bd9Sstevel@tonic-gate /* ========================================================================= */ 6647c478bd9Sstevel@tonic-gate int deflateReset (strm) 6657c478bd9Sstevel@tonic-gate z_stream *strm; 6667c478bd9Sstevel@tonic-gate { 6677c478bd9Sstevel@tonic-gate deflate_state *s; 6687c478bd9Sstevel@tonic-gate 6697c478bd9Sstevel@tonic-gate if (strm == Z_NULL || strm->state == Z_NULL || 6707c478bd9Sstevel@tonic-gate strm->zalloc == Z_NULL || strm->zfree == Z_NULL) return Z_STREAM_ERROR; 6717c478bd9Sstevel@tonic-gate 6727c478bd9Sstevel@tonic-gate strm->total_in = strm->total_out = 0; 6737c478bd9Sstevel@tonic-gate strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */ 6747c478bd9Sstevel@tonic-gate strm->data_type = Z_UNKNOWN; 6757c478bd9Sstevel@tonic-gate 6767c478bd9Sstevel@tonic-gate s = (deflate_state *)strm->state; 6777c478bd9Sstevel@tonic-gate s->pending = 0; 6787c478bd9Sstevel@tonic-gate s->pending_out = s->pending_buf; 6797c478bd9Sstevel@tonic-gate 6807c478bd9Sstevel@tonic-gate if (s->noheader < 0) { 6817c478bd9Sstevel@tonic-gate s->noheader = 0; /* was set to -1 by deflate(..., Z_FINISH); */ 6827c478bd9Sstevel@tonic-gate } 6837c478bd9Sstevel@tonic-gate s->status = s->noheader ? BUSY_STATE : INIT_STATE; 6847c478bd9Sstevel@tonic-gate s->adler = 1; 6857c478bd9Sstevel@tonic-gate 6867c478bd9Sstevel@tonic-gate ct_init(s); 6877c478bd9Sstevel@tonic-gate lm_init(s); 6887c478bd9Sstevel@tonic-gate 6897c478bd9Sstevel@tonic-gate return Z_OK; 6907c478bd9Sstevel@tonic-gate } 6917c478bd9Sstevel@tonic-gate 6927c478bd9Sstevel@tonic-gate /* ========================================================================= 6937c478bd9Sstevel@tonic-gate * Put a short in the pending buffer. The 16-bit value is put in MSB order. 6947c478bd9Sstevel@tonic-gate * IN assertion: the stream state is correct and there is enough room in 6957c478bd9Sstevel@tonic-gate * pending_buf. 6967c478bd9Sstevel@tonic-gate */ 6977c478bd9Sstevel@tonic-gate local void putShortMSB (s, b) 6987c478bd9Sstevel@tonic-gate deflate_state *s; 6997c478bd9Sstevel@tonic-gate uInt b; 7007c478bd9Sstevel@tonic-gate { 7017c478bd9Sstevel@tonic-gate put_byte(s, (Byte)(b >> 8)); 7027c478bd9Sstevel@tonic-gate put_byte(s, (Byte)(b & 0xff)); 7037c478bd9Sstevel@tonic-gate } 7047c478bd9Sstevel@tonic-gate 7057c478bd9Sstevel@tonic-gate /* ========================================================================= 7067c478bd9Sstevel@tonic-gate * Flush as much pending output as possible. 7077c478bd9Sstevel@tonic-gate */ 7087c478bd9Sstevel@tonic-gate local void flush_pending(strm) 7097c478bd9Sstevel@tonic-gate z_stream *strm; 7107c478bd9Sstevel@tonic-gate { 7117c478bd9Sstevel@tonic-gate deflate_state *state = (deflate_state *) strm->state; 7127c478bd9Sstevel@tonic-gate unsigned len = state->pending; 7137c478bd9Sstevel@tonic-gate 7147c478bd9Sstevel@tonic-gate if (len > strm->avail_out) len = strm->avail_out; 7157c478bd9Sstevel@tonic-gate if (len == 0) return; 7167c478bd9Sstevel@tonic-gate 7177c478bd9Sstevel@tonic-gate if (strm->next_out != NULL) { 7187c478bd9Sstevel@tonic-gate zmemcpy(strm->next_out, state->pending_out, len); 7197c478bd9Sstevel@tonic-gate strm->next_out += len; 7207c478bd9Sstevel@tonic-gate } 7217c478bd9Sstevel@tonic-gate state->pending_out += len; 7227c478bd9Sstevel@tonic-gate strm->total_out += len; 7237c478bd9Sstevel@tonic-gate strm->avail_out -= len; 7247c478bd9Sstevel@tonic-gate state->pending -= len; 7257c478bd9Sstevel@tonic-gate if (state->pending == 0) { 7267c478bd9Sstevel@tonic-gate state->pending_out = state->pending_buf; 7277c478bd9Sstevel@tonic-gate } 7287c478bd9Sstevel@tonic-gate } 7297c478bd9Sstevel@tonic-gate 7307c478bd9Sstevel@tonic-gate /* ========================================================================= */ 7317c478bd9Sstevel@tonic-gate int deflate (strm, flush) 7327c478bd9Sstevel@tonic-gate z_stream *strm; 7337c478bd9Sstevel@tonic-gate int flush; 7347c478bd9Sstevel@tonic-gate { 7357c478bd9Sstevel@tonic-gate deflate_state *state = (deflate_state *) strm->state; 7367c478bd9Sstevel@tonic-gate 7377c478bd9Sstevel@tonic-gate if (strm == Z_NULL || state == Z_NULL) return Z_STREAM_ERROR; 7387c478bd9Sstevel@tonic-gate 7397c478bd9Sstevel@tonic-gate if (strm->next_in == Z_NULL && strm->avail_in != 0) { 7407c478bd9Sstevel@tonic-gate ERR_RETURN(strm, Z_STREAM_ERROR); 7417c478bd9Sstevel@tonic-gate } 7427c478bd9Sstevel@tonic-gate if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR); 7437c478bd9Sstevel@tonic-gate 7447c478bd9Sstevel@tonic-gate state->strm = strm; /* just in case */ 7457c478bd9Sstevel@tonic-gate 7467c478bd9Sstevel@tonic-gate /* Write the zlib header */ 7477c478bd9Sstevel@tonic-gate if (state->status == INIT_STATE) { 7487c478bd9Sstevel@tonic-gate 7497c478bd9Sstevel@tonic-gate uInt header = (DEFLATED + ((state->w_bits-8)<<4)) << 8; 7507c478bd9Sstevel@tonic-gate uInt level_flags = (state->level-1) >> 1; 7517c478bd9Sstevel@tonic-gate 7527c478bd9Sstevel@tonic-gate if (level_flags > 3) level_flags = 3; 7537c478bd9Sstevel@tonic-gate header |= (level_flags << 6); 7547c478bd9Sstevel@tonic-gate header += 31 - (header % 31); 7557c478bd9Sstevel@tonic-gate 7567c478bd9Sstevel@tonic-gate state->status = BUSY_STATE; 7577c478bd9Sstevel@tonic-gate putShortMSB(state, header); 7587c478bd9Sstevel@tonic-gate } 7597c478bd9Sstevel@tonic-gate 7607c478bd9Sstevel@tonic-gate /* Flush as much pending output as possible */ 7617c478bd9Sstevel@tonic-gate if (state->pending != 0) { 7627c478bd9Sstevel@tonic-gate flush_pending(strm); 7637c478bd9Sstevel@tonic-gate if (strm->avail_out == 0) return Z_OK; 7647c478bd9Sstevel@tonic-gate } 7657c478bd9Sstevel@tonic-gate 7667c478bd9Sstevel@tonic-gate /* If we came back in here to get the last output from 7677c478bd9Sstevel@tonic-gate * a previous flush, we're done for now. 7687c478bd9Sstevel@tonic-gate */ 7697c478bd9Sstevel@tonic-gate if (state->status == FLUSH_STATE) { 7707c478bd9Sstevel@tonic-gate state->status = BUSY_STATE; 7717c478bd9Sstevel@tonic-gate if (flush != Z_NO_FLUSH && flush != Z_FINISH) 7727c478bd9Sstevel@tonic-gate return Z_OK; 7737c478bd9Sstevel@tonic-gate } 7747c478bd9Sstevel@tonic-gate 7757c478bd9Sstevel@tonic-gate /* User must not provide more input after the first FINISH: */ 7767c478bd9Sstevel@tonic-gate if (state->status == FINISH_STATE && strm->avail_in != 0) { 7777c478bd9Sstevel@tonic-gate ERR_RETURN(strm, Z_BUF_ERROR); 7787c478bd9Sstevel@tonic-gate } 7797c478bd9Sstevel@tonic-gate 7807c478bd9Sstevel@tonic-gate /* Start a new block or continue the current one. 7817c478bd9Sstevel@tonic-gate */ 7827c478bd9Sstevel@tonic-gate if (strm->avail_in != 0 || state->lookahead != 0 || 7837c478bd9Sstevel@tonic-gate (flush == Z_FINISH && state->status != FINISH_STATE)) { 7847c478bd9Sstevel@tonic-gate int quit; 7857c478bd9Sstevel@tonic-gate 7867c478bd9Sstevel@tonic-gate if (flush == Z_FINISH) { 7877c478bd9Sstevel@tonic-gate state->status = FINISH_STATE; 7887c478bd9Sstevel@tonic-gate } 7897c478bd9Sstevel@tonic-gate if (state->level <= 3) { 7907c478bd9Sstevel@tonic-gate quit = deflate_fast(state, flush); 7917c478bd9Sstevel@tonic-gate } else { 7927c478bd9Sstevel@tonic-gate quit = deflate_slow(state, flush); 7937c478bd9Sstevel@tonic-gate } 7947c478bd9Sstevel@tonic-gate if (quit || strm->avail_out == 0) 7957c478bd9Sstevel@tonic-gate return Z_OK; 7967c478bd9Sstevel@tonic-gate /* If flush != Z_NO_FLUSH && avail_out == 0, the next call 7977c478bd9Sstevel@tonic-gate * of deflate should use the same flush parameter to make sure 7987c478bd9Sstevel@tonic-gate * that the flush is complete. So we don't have to output an 7997c478bd9Sstevel@tonic-gate * empty block here, this will be done at next call. This also 8007c478bd9Sstevel@tonic-gate * ensures that for a very small output buffer, we emit at most 8017c478bd9Sstevel@tonic-gate * one empty block. 8027c478bd9Sstevel@tonic-gate */ 8037c478bd9Sstevel@tonic-gate } 8047c478bd9Sstevel@tonic-gate 8057c478bd9Sstevel@tonic-gate /* If a flush was requested, we have a little more to output now. */ 8067c478bd9Sstevel@tonic-gate if (flush != Z_NO_FLUSH && flush != Z_FINISH 8077c478bd9Sstevel@tonic-gate && state->status != FINISH_STATE) { 8087c478bd9Sstevel@tonic-gate switch (flush) { 8097c478bd9Sstevel@tonic-gate case Z_PARTIAL_FLUSH: 8107c478bd9Sstevel@tonic-gate ct_align(state); 8117c478bd9Sstevel@tonic-gate break; 8127c478bd9Sstevel@tonic-gate case Z_PACKET_FLUSH: 8137c478bd9Sstevel@tonic-gate /* Output just the 3-bit `stored' block type value, 8147c478bd9Sstevel@tonic-gate but not a zero length. */ 8157c478bd9Sstevel@tonic-gate ct_stored_type_only(state); 8167c478bd9Sstevel@tonic-gate break; 8177c478bd9Sstevel@tonic-gate default: 8187c478bd9Sstevel@tonic-gate ct_stored_block(state, (char*)0, 0L, 0); 8197c478bd9Sstevel@tonic-gate /* For a full flush, this empty block will be recognized 8207c478bd9Sstevel@tonic-gate * as a special marker by inflate_sync(). 8217c478bd9Sstevel@tonic-gate */ 8227c478bd9Sstevel@tonic-gate if (flush == Z_FULL_FLUSH) { 8237c478bd9Sstevel@tonic-gate CLEAR_HASH(state); /* forget history */ 8247c478bd9Sstevel@tonic-gate } 8257c478bd9Sstevel@tonic-gate } 8267c478bd9Sstevel@tonic-gate flush_pending(strm); 8277c478bd9Sstevel@tonic-gate if (strm->avail_out == 0) { 8287c478bd9Sstevel@tonic-gate /* We'll have to come back to get the rest of the output; 8297c478bd9Sstevel@tonic-gate * this ensures we don't output a second zero-length stored 8307c478bd9Sstevel@tonic-gate * block (or whatever). 8317c478bd9Sstevel@tonic-gate */ 8327c478bd9Sstevel@tonic-gate state->status = FLUSH_STATE; 8337c478bd9Sstevel@tonic-gate return Z_OK; 8347c478bd9Sstevel@tonic-gate } 8357c478bd9Sstevel@tonic-gate } 8367c478bd9Sstevel@tonic-gate 8377c478bd9Sstevel@tonic-gate Assert(strm->avail_out > 0, "bug2"); 8387c478bd9Sstevel@tonic-gate 8397c478bd9Sstevel@tonic-gate if (flush != Z_FINISH) return Z_OK; 8407c478bd9Sstevel@tonic-gate if (state->noheader) return Z_STREAM_END; 8417c478bd9Sstevel@tonic-gate 8427c478bd9Sstevel@tonic-gate /* Write the zlib trailer (adler32) */ 8437c478bd9Sstevel@tonic-gate putShortMSB(state, (uInt)(state->adler >> 16)); 8447c478bd9Sstevel@tonic-gate putShortMSB(state, (uInt)(state->adler & 0xffff)); 8457c478bd9Sstevel@tonic-gate flush_pending(strm); 8467c478bd9Sstevel@tonic-gate /* If avail_out is zero, the application will call deflate again 8477c478bd9Sstevel@tonic-gate * to flush the rest. 8487c478bd9Sstevel@tonic-gate */ 8497c478bd9Sstevel@tonic-gate state->noheader = -1; /* write the trailer only once! */ 8507c478bd9Sstevel@tonic-gate return state->pending != 0 ? Z_OK : Z_STREAM_END; 8517c478bd9Sstevel@tonic-gate } 8527c478bd9Sstevel@tonic-gate 8537c478bd9Sstevel@tonic-gate /* ========================================================================= */ 8547c478bd9Sstevel@tonic-gate int deflateEnd (strm) 8557c478bd9Sstevel@tonic-gate z_stream *strm; 8567c478bd9Sstevel@tonic-gate { 8577c478bd9Sstevel@tonic-gate deflate_state *state = (deflate_state *) strm->state; 8587c478bd9Sstevel@tonic-gate 8597c478bd9Sstevel@tonic-gate if (strm == Z_NULL || state == Z_NULL) return Z_STREAM_ERROR; 8607c478bd9Sstevel@tonic-gate 8617c478bd9Sstevel@tonic-gate TRY_FREE(strm, state->window, state->w_size * 2 * sizeof(Byte)); 8627c478bd9Sstevel@tonic-gate TRY_FREE(strm, state->prev, state->w_size * sizeof(Pos)); 8637c478bd9Sstevel@tonic-gate TRY_FREE(strm, state->head, state->hash_size * sizeof(Pos)); 8647c478bd9Sstevel@tonic-gate TRY_FREE(strm, state->pending_buf, state->lit_bufsize * 2 * sizeof(ush)); 8657c478bd9Sstevel@tonic-gate 8667c478bd9Sstevel@tonic-gate ZFREE(strm, state, sizeof(deflate_state)); 8677c478bd9Sstevel@tonic-gate strm->state = Z_NULL; 8687c478bd9Sstevel@tonic-gate 8697c478bd9Sstevel@tonic-gate return Z_OK; 8707c478bd9Sstevel@tonic-gate } 8717c478bd9Sstevel@tonic-gate 8727c478bd9Sstevel@tonic-gate /* =========================================================================== 8737c478bd9Sstevel@tonic-gate * Read a new buffer from the current input stream, update the adler32 8747c478bd9Sstevel@tonic-gate * and total number of bytes read. 8757c478bd9Sstevel@tonic-gate */ 8767c478bd9Sstevel@tonic-gate local int read_buf(strm, buf, size) 8777c478bd9Sstevel@tonic-gate z_stream *strm; 8787c478bd9Sstevel@tonic-gate charf *buf; 8797c478bd9Sstevel@tonic-gate unsigned size; 8807c478bd9Sstevel@tonic-gate { 8817c478bd9Sstevel@tonic-gate unsigned len = strm->avail_in; 8827c478bd9Sstevel@tonic-gate deflate_state *state = (deflate_state *) strm->state; 8837c478bd9Sstevel@tonic-gate 8847c478bd9Sstevel@tonic-gate if (len > size) len = size; 8857c478bd9Sstevel@tonic-gate if (len == 0) return 0; 8867c478bd9Sstevel@tonic-gate 8877c478bd9Sstevel@tonic-gate strm->avail_in -= len; 8887c478bd9Sstevel@tonic-gate 8897c478bd9Sstevel@tonic-gate if (!state->noheader) { 8907c478bd9Sstevel@tonic-gate state->adler = adler32(state->adler, strm->next_in, len); 8917c478bd9Sstevel@tonic-gate } 8927c478bd9Sstevel@tonic-gate zmemcpy(buf, strm->next_in, len); 8937c478bd9Sstevel@tonic-gate strm->next_in += len; 8947c478bd9Sstevel@tonic-gate strm->total_in += len; 8957c478bd9Sstevel@tonic-gate 8967c478bd9Sstevel@tonic-gate return (int)len; 8977c478bd9Sstevel@tonic-gate } 8987c478bd9Sstevel@tonic-gate 8997c478bd9Sstevel@tonic-gate /* =========================================================================== 9007c478bd9Sstevel@tonic-gate * Initialize the "longest match" routines for a new zlib stream 9017c478bd9Sstevel@tonic-gate */ 9027c478bd9Sstevel@tonic-gate local void lm_init (s) 9037c478bd9Sstevel@tonic-gate deflate_state *s; 9047c478bd9Sstevel@tonic-gate { 9057c478bd9Sstevel@tonic-gate s->window_size = (ulg)2L*s->w_size; 9067c478bd9Sstevel@tonic-gate 9077c478bd9Sstevel@tonic-gate CLEAR_HASH(s); 9087c478bd9Sstevel@tonic-gate 9097c478bd9Sstevel@tonic-gate /* Set the default configuration parameters: 9107c478bd9Sstevel@tonic-gate */ 9117c478bd9Sstevel@tonic-gate s->max_lazy_match = configuration_table[s->level].max_lazy; 9127c478bd9Sstevel@tonic-gate s->good_match = configuration_table[s->level].good_length; 9137c478bd9Sstevel@tonic-gate s->nice_match = configuration_table[s->level].nice_length; 9147c478bd9Sstevel@tonic-gate s->max_chain_length = configuration_table[s->level].max_chain; 9157c478bd9Sstevel@tonic-gate 9167c478bd9Sstevel@tonic-gate s->strstart = 0; 9177c478bd9Sstevel@tonic-gate s->block_start = 0L; 9187c478bd9Sstevel@tonic-gate s->lookahead = 0; 9197c478bd9Sstevel@tonic-gate s->match_length = MIN_MATCH-1; 9207c478bd9Sstevel@tonic-gate s->match_available = 0; 9217c478bd9Sstevel@tonic-gate s->ins_h = 0; 9227c478bd9Sstevel@tonic-gate #ifdef ASMV 9237c478bd9Sstevel@tonic-gate match_init(); /* initialize the asm code */ 9247c478bd9Sstevel@tonic-gate #endif 9257c478bd9Sstevel@tonic-gate } 9267c478bd9Sstevel@tonic-gate 9277c478bd9Sstevel@tonic-gate /* =========================================================================== 9287c478bd9Sstevel@tonic-gate * Set match_start to the longest match starting at the given string and 9297c478bd9Sstevel@tonic-gate * return its length. Matches shorter or equal to prev_length are discarded, 9307c478bd9Sstevel@tonic-gate * in which case the result is equal to prev_length and match_start is 9317c478bd9Sstevel@tonic-gate * garbage. 9327c478bd9Sstevel@tonic-gate * IN assertions: cur_match is the head of the hash chain for the current 9337c478bd9Sstevel@tonic-gate * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 9347c478bd9Sstevel@tonic-gate */ 9357c478bd9Sstevel@tonic-gate #ifndef ASMV 9367c478bd9Sstevel@tonic-gate /* For 80x86 and 680x0, an optimized version will be provided in match.asm or 9377c478bd9Sstevel@tonic-gate * match.S. The code will be functionally equivalent. 9387c478bd9Sstevel@tonic-gate */ 9397c478bd9Sstevel@tonic-gate local int longest_match(s, cur_match) 9407c478bd9Sstevel@tonic-gate deflate_state *s; 9417c478bd9Sstevel@tonic-gate IPos cur_match; /* current match */ 9427c478bd9Sstevel@tonic-gate { 9437c478bd9Sstevel@tonic-gate unsigned chain_length = s->max_chain_length;/* max hash chain length */ 9447c478bd9Sstevel@tonic-gate register Bytef *scan = s->window + s->strstart; /* current string */ 9457c478bd9Sstevel@tonic-gate register Bytef *match; /* matched string */ 9467c478bd9Sstevel@tonic-gate register int len; /* length of current match */ 9477c478bd9Sstevel@tonic-gate int best_len = s->prev_length; /* best match length so far */ 9487c478bd9Sstevel@tonic-gate IPos limit = s->strstart > (IPos)MAX_DIST(s) ? 9497c478bd9Sstevel@tonic-gate s->strstart - (IPos)MAX_DIST(s) : NIL; 9507c478bd9Sstevel@tonic-gate /* Stop when cur_match becomes <= limit. To simplify the code, 9517c478bd9Sstevel@tonic-gate * we prevent matches with the string of window index 0. 9527c478bd9Sstevel@tonic-gate */ 9537c478bd9Sstevel@tonic-gate Posf *prev = s->prev; 9547c478bd9Sstevel@tonic-gate uInt wmask = s->w_mask; 9557c478bd9Sstevel@tonic-gate 9567c478bd9Sstevel@tonic-gate #ifdef UNALIGNED_OK 9577c478bd9Sstevel@tonic-gate /* Compare two bytes at a time. Note: this is not always beneficial. 9587c478bd9Sstevel@tonic-gate * Try with and without -DUNALIGNED_OK to check. 9597c478bd9Sstevel@tonic-gate */ 9607c478bd9Sstevel@tonic-gate register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; 9617c478bd9Sstevel@tonic-gate register ush scan_start = *(ushf*)scan; 9627c478bd9Sstevel@tonic-gate register ush scan_end = *(ushf*)(scan+best_len-1); 9637c478bd9Sstevel@tonic-gate #else 9647c478bd9Sstevel@tonic-gate register Bytef *strend = s->window + s->strstart + MAX_MATCH; 9657c478bd9Sstevel@tonic-gate register Byte scan_end1 = scan[best_len-1]; 9667c478bd9Sstevel@tonic-gate register Byte scan_end = scan[best_len]; 9677c478bd9Sstevel@tonic-gate #endif 9687c478bd9Sstevel@tonic-gate 9697c478bd9Sstevel@tonic-gate /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. 9707c478bd9Sstevel@tonic-gate * It is easy to get rid of this optimization if necessary. 9717c478bd9Sstevel@tonic-gate */ 9727c478bd9Sstevel@tonic-gate Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); 9737c478bd9Sstevel@tonic-gate 9747c478bd9Sstevel@tonic-gate /* Do not waste too much time if we already have a good match: */ 9757c478bd9Sstevel@tonic-gate if (s->prev_length >= s->good_match) { 9767c478bd9Sstevel@tonic-gate chain_length >>= 2; 9777c478bd9Sstevel@tonic-gate } 9787c478bd9Sstevel@tonic-gate Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); 9797c478bd9Sstevel@tonic-gate 9807c478bd9Sstevel@tonic-gate do { 9817c478bd9Sstevel@tonic-gate Assert(cur_match < s->strstart, "no future"); 9827c478bd9Sstevel@tonic-gate match = s->window + cur_match; 9837c478bd9Sstevel@tonic-gate 9847c478bd9Sstevel@tonic-gate /* Skip to next match if the match length cannot increase 9857c478bd9Sstevel@tonic-gate * or if the match length is less than 2: 9867c478bd9Sstevel@tonic-gate */ 9877c478bd9Sstevel@tonic-gate #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) 9887c478bd9Sstevel@tonic-gate /* This code assumes sizeof(unsigned short) == 2. Do not use 9897c478bd9Sstevel@tonic-gate * UNALIGNED_OK if your compiler uses a different size. 9907c478bd9Sstevel@tonic-gate */ 9917c478bd9Sstevel@tonic-gate if (*(ushf*)(match+best_len-1) != scan_end || 9927c478bd9Sstevel@tonic-gate *(ushf*)match != scan_start) continue; 9937c478bd9Sstevel@tonic-gate 9947c478bd9Sstevel@tonic-gate /* It is not necessary to compare scan[2] and match[2] since they are 9957c478bd9Sstevel@tonic-gate * always equal when the other bytes match, given that the hash keys 9967c478bd9Sstevel@tonic-gate * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at 9977c478bd9Sstevel@tonic-gate * strstart+3, +5, ... up to strstart+257. We check for insufficient 9987c478bd9Sstevel@tonic-gate * lookahead only every 4th comparison; the 128th check will be made 9997c478bd9Sstevel@tonic-gate * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is 10007c478bd9Sstevel@tonic-gate * necessary to put more guard bytes at the end of the window, or 10017c478bd9Sstevel@tonic-gate * to check more often for insufficient lookahead. 10027c478bd9Sstevel@tonic-gate */ 10037c478bd9Sstevel@tonic-gate Assert(scan[2] == match[2], "scan[2]?"); 10047c478bd9Sstevel@tonic-gate scan++, match++; 10057c478bd9Sstevel@tonic-gate do { 10067c478bd9Sstevel@tonic-gate } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) && 10077c478bd9Sstevel@tonic-gate *(ushf*)(scan+=2) == *(ushf*)(match+=2) && 10087c478bd9Sstevel@tonic-gate *(ushf*)(scan+=2) == *(ushf*)(match+=2) && 10097c478bd9Sstevel@tonic-gate *(ushf*)(scan+=2) == *(ushf*)(match+=2) && 10107c478bd9Sstevel@tonic-gate scan < strend); 10117c478bd9Sstevel@tonic-gate /* The funny "do {}" generates better code on most compilers */ 10127c478bd9Sstevel@tonic-gate 10137c478bd9Sstevel@tonic-gate /* Here, scan <= window+strstart+257 */ 10147c478bd9Sstevel@tonic-gate Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); 10157c478bd9Sstevel@tonic-gate if (*scan == *match) scan++; 10167c478bd9Sstevel@tonic-gate 10177c478bd9Sstevel@tonic-gate len = (MAX_MATCH - 1) - (int)(strend-scan); 10187c478bd9Sstevel@tonic-gate scan = strend - (MAX_MATCH-1); 10197c478bd9Sstevel@tonic-gate 10207c478bd9Sstevel@tonic-gate #else /* UNALIGNED_OK */ 10217c478bd9Sstevel@tonic-gate 10227c478bd9Sstevel@tonic-gate if (match[best_len] != scan_end || 10237c478bd9Sstevel@tonic-gate match[best_len-1] != scan_end1 || 10247c478bd9Sstevel@tonic-gate *match != *scan || 10257c478bd9Sstevel@tonic-gate *++match != scan[1]) continue; 10267c478bd9Sstevel@tonic-gate 10277c478bd9Sstevel@tonic-gate /* The check at best_len-1 can be removed because it will be made 10287c478bd9Sstevel@tonic-gate * again later. (This heuristic is not always a win.) 10297c478bd9Sstevel@tonic-gate * It is not necessary to compare scan[2] and match[2] since they 10307c478bd9Sstevel@tonic-gate * are always equal when the other bytes match, given that 10317c478bd9Sstevel@tonic-gate * the hash keys are equal and that HASH_BITS >= 8. 10327c478bd9Sstevel@tonic-gate */ 10337c478bd9Sstevel@tonic-gate scan += 2, match++; 10347c478bd9Sstevel@tonic-gate Assert(*scan == *match, "match[2]?"); 10357c478bd9Sstevel@tonic-gate 10367c478bd9Sstevel@tonic-gate /* We check for insufficient lookahead only every 8th comparison; 10377c478bd9Sstevel@tonic-gate * the 256th check will be made at strstart+258. 10387c478bd9Sstevel@tonic-gate */ 10397c478bd9Sstevel@tonic-gate do { 10407c478bd9Sstevel@tonic-gate } while (*++scan == *++match && *++scan == *++match && 10417c478bd9Sstevel@tonic-gate *++scan == *++match && *++scan == *++match && 10427c478bd9Sstevel@tonic-gate *++scan == *++match && *++scan == *++match && 10437c478bd9Sstevel@tonic-gate *++scan == *++match && *++scan == *++match && 10447c478bd9Sstevel@tonic-gate scan < strend); 10457c478bd9Sstevel@tonic-gate 10467c478bd9Sstevel@tonic-gate Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); 10477c478bd9Sstevel@tonic-gate 10487c478bd9Sstevel@tonic-gate len = MAX_MATCH - (int)(strend - scan); 10497c478bd9Sstevel@tonic-gate scan = strend - MAX_MATCH; 10507c478bd9Sstevel@tonic-gate 10517c478bd9Sstevel@tonic-gate #endif /* UNALIGNED_OK */ 10527c478bd9Sstevel@tonic-gate 10537c478bd9Sstevel@tonic-gate if (len > best_len) { 10547c478bd9Sstevel@tonic-gate s->match_start = cur_match; 10557c478bd9Sstevel@tonic-gate best_len = len; 10567c478bd9Sstevel@tonic-gate if (len >= s->nice_match) break; 10577c478bd9Sstevel@tonic-gate #ifdef UNALIGNED_OK 10587c478bd9Sstevel@tonic-gate scan_end = *(ushf*)(scan+best_len-1); 10597c478bd9Sstevel@tonic-gate #else 10607c478bd9Sstevel@tonic-gate scan_end1 = scan[best_len-1]; 10617c478bd9Sstevel@tonic-gate scan_end = scan[best_len]; 10627c478bd9Sstevel@tonic-gate #endif 10637c478bd9Sstevel@tonic-gate } 10647c478bd9Sstevel@tonic-gate } while ((cur_match = prev[cur_match & wmask]) > limit 10657c478bd9Sstevel@tonic-gate && --chain_length != 0); 10667c478bd9Sstevel@tonic-gate 10677c478bd9Sstevel@tonic-gate return best_len; 10687c478bd9Sstevel@tonic-gate } 10697c478bd9Sstevel@tonic-gate #endif /* ASMV */ 10707c478bd9Sstevel@tonic-gate 10717c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 10727c478bd9Sstevel@tonic-gate /* =========================================================================== 10737c478bd9Sstevel@tonic-gate * Check that the match at match_start is indeed a match. 10747c478bd9Sstevel@tonic-gate */ 10757c478bd9Sstevel@tonic-gate local void check_match(s, start, match, length) 10767c478bd9Sstevel@tonic-gate deflate_state *s; 10777c478bd9Sstevel@tonic-gate IPos start, match; 10787c478bd9Sstevel@tonic-gate int length; 10797c478bd9Sstevel@tonic-gate { 10807c478bd9Sstevel@tonic-gate /* check that the match is indeed a match */ 10817c478bd9Sstevel@tonic-gate if (memcmp((charf *)s->window + match, 10827c478bd9Sstevel@tonic-gate (charf *)s->window + start, length) != EQUAL) { 10837c478bd9Sstevel@tonic-gate fprintf(stderr, 10847c478bd9Sstevel@tonic-gate " start %u, match %u, length %d\n", 10857c478bd9Sstevel@tonic-gate start, match, length); 10867c478bd9Sstevel@tonic-gate do { fprintf(stderr, "%c%c", s->window[match++], 10877c478bd9Sstevel@tonic-gate s->window[start++]); } while (--length != 0); 10887c478bd9Sstevel@tonic-gate z_error("invalid match"); 10897c478bd9Sstevel@tonic-gate } 10907c478bd9Sstevel@tonic-gate if (verbose > 1) { 10917c478bd9Sstevel@tonic-gate fprintf(stderr,"\\[%d,%d]", start-match, length); 10927c478bd9Sstevel@tonic-gate do { putc(s->window[start++], stderr); } while (--length != 0); 10937c478bd9Sstevel@tonic-gate } 10947c478bd9Sstevel@tonic-gate } 10957c478bd9Sstevel@tonic-gate #else 10967c478bd9Sstevel@tonic-gate # define check_match(s, start, match, length) 10977c478bd9Sstevel@tonic-gate #endif 10987c478bd9Sstevel@tonic-gate 10997c478bd9Sstevel@tonic-gate /* =========================================================================== 11007c478bd9Sstevel@tonic-gate * Fill the window when the lookahead becomes insufficient. 11017c478bd9Sstevel@tonic-gate * Updates strstart and lookahead. 11027c478bd9Sstevel@tonic-gate * 11037c478bd9Sstevel@tonic-gate * IN assertion: lookahead < MIN_LOOKAHEAD 11047c478bd9Sstevel@tonic-gate * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD 11057c478bd9Sstevel@tonic-gate * At least one byte has been read, or avail_in == 0; reads are 11067c478bd9Sstevel@tonic-gate * performed for at least two bytes (required for the zip translate_eol 11077c478bd9Sstevel@tonic-gate * option -- not supported here). 11087c478bd9Sstevel@tonic-gate */ 11097c478bd9Sstevel@tonic-gate local void fill_window(s) 11107c478bd9Sstevel@tonic-gate deflate_state *s; 11117c478bd9Sstevel@tonic-gate { 11127c478bd9Sstevel@tonic-gate register unsigned n, m; 11137c478bd9Sstevel@tonic-gate register Posf *p; 11147c478bd9Sstevel@tonic-gate unsigned more; /* Amount of free space at the end of the window. */ 11157c478bd9Sstevel@tonic-gate uInt wsize = s->w_size; 11167c478bd9Sstevel@tonic-gate 11177c478bd9Sstevel@tonic-gate do { 11187c478bd9Sstevel@tonic-gate more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart); 11197c478bd9Sstevel@tonic-gate 11207c478bd9Sstevel@tonic-gate /* Deal with !@#$% 64K limit: */ 11217c478bd9Sstevel@tonic-gate if (more == 0 && s->strstart == 0 && s->lookahead == 0) { 11227c478bd9Sstevel@tonic-gate more = wsize; 11237c478bd9Sstevel@tonic-gate } else if (more == (unsigned)(-1)) { 11247c478bd9Sstevel@tonic-gate /* Very unlikely, but possible on 16 bit machine if strstart == 0 11257c478bd9Sstevel@tonic-gate * and lookahead == 1 (input done one byte at time) 11267c478bd9Sstevel@tonic-gate */ 11277c478bd9Sstevel@tonic-gate more--; 11287c478bd9Sstevel@tonic-gate 11297c478bd9Sstevel@tonic-gate /* If the window is almost full and there is insufficient lookahead, 11307c478bd9Sstevel@tonic-gate * move the upper half to the lower one to make room in the upper half. 11317c478bd9Sstevel@tonic-gate */ 11327c478bd9Sstevel@tonic-gate } else if (s->strstart >= wsize+MAX_DIST(s)) { 11337c478bd9Sstevel@tonic-gate 11347c478bd9Sstevel@tonic-gate /* By the IN assertion, the window is not empty so we can't confuse 11357c478bd9Sstevel@tonic-gate * more == 0 with more == 64K on a 16 bit machine. 11367c478bd9Sstevel@tonic-gate */ 11377c478bd9Sstevel@tonic-gate zmemcpy((charf *)s->window, (charf *)s->window+wsize, 11387c478bd9Sstevel@tonic-gate (unsigned)wsize); 11397c478bd9Sstevel@tonic-gate s->match_start -= wsize; 11407c478bd9Sstevel@tonic-gate s->strstart -= wsize; /* we now have strstart >= MAX_DIST */ 11417c478bd9Sstevel@tonic-gate 11427c478bd9Sstevel@tonic-gate s->block_start -= (long) wsize; 11437c478bd9Sstevel@tonic-gate 11447c478bd9Sstevel@tonic-gate /* Slide the hash table (could be avoided with 32 bit values 11457c478bd9Sstevel@tonic-gate at the expense of memory usage): 11467c478bd9Sstevel@tonic-gate */ 11477c478bd9Sstevel@tonic-gate n = s->hash_size; 11487c478bd9Sstevel@tonic-gate p = &s->head[n]; 11497c478bd9Sstevel@tonic-gate do { 11507c478bd9Sstevel@tonic-gate m = *--p; 11517c478bd9Sstevel@tonic-gate *p = (Pos)(m >= wsize ? m-wsize : NIL); 11527c478bd9Sstevel@tonic-gate } while (--n); 11537c478bd9Sstevel@tonic-gate 11547c478bd9Sstevel@tonic-gate n = wsize; 11557c478bd9Sstevel@tonic-gate p = &s->prev[n]; 11567c478bd9Sstevel@tonic-gate do { 11577c478bd9Sstevel@tonic-gate m = *--p; 11587c478bd9Sstevel@tonic-gate *p = (Pos)(m >= wsize ? m-wsize : NIL); 11597c478bd9Sstevel@tonic-gate /* If n is not on any hash chain, prev[n] is garbage but 11607c478bd9Sstevel@tonic-gate * its value will never be used. 11617c478bd9Sstevel@tonic-gate */ 11627c478bd9Sstevel@tonic-gate } while (--n); 11637c478bd9Sstevel@tonic-gate 11647c478bd9Sstevel@tonic-gate more += wsize; 11657c478bd9Sstevel@tonic-gate } 11667c478bd9Sstevel@tonic-gate if (s->strm->avail_in == 0) return; 11677c478bd9Sstevel@tonic-gate 11687c478bd9Sstevel@tonic-gate /* If there was no sliding: 11697c478bd9Sstevel@tonic-gate * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && 11707c478bd9Sstevel@tonic-gate * more == window_size - lookahead - strstart 11717c478bd9Sstevel@tonic-gate * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) 11727c478bd9Sstevel@tonic-gate * => more >= window_size - 2*WSIZE + 2 11737c478bd9Sstevel@tonic-gate * In the BIG_MEM or MMAP case (not yet supported), 11747c478bd9Sstevel@tonic-gate * window_size == input_size + MIN_LOOKAHEAD && 11757c478bd9Sstevel@tonic-gate * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. 11767c478bd9Sstevel@tonic-gate * Otherwise, window_size == 2*WSIZE so more >= 2. 11777c478bd9Sstevel@tonic-gate * If there was sliding, more >= WSIZE. So in all cases, more >= 2. 11787c478bd9Sstevel@tonic-gate */ 11797c478bd9Sstevel@tonic-gate Assert(more >= 2, "more < 2"); 11807c478bd9Sstevel@tonic-gate 11817c478bd9Sstevel@tonic-gate n = read_buf(s->strm, (charf *)s->window + s->strstart + s->lookahead, 11827c478bd9Sstevel@tonic-gate more); 11837c478bd9Sstevel@tonic-gate s->lookahead += n; 11847c478bd9Sstevel@tonic-gate 11857c478bd9Sstevel@tonic-gate /* Initialize the hash value now that we have some input: */ 11867c478bd9Sstevel@tonic-gate if (s->lookahead >= MIN_MATCH) { 11877c478bd9Sstevel@tonic-gate s->ins_h = s->window[s->strstart]; 11887c478bd9Sstevel@tonic-gate UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]); 11897c478bd9Sstevel@tonic-gate #if MIN_MATCH != 3 11907c478bd9Sstevel@tonic-gate Call UPDATE_HASH() MIN_MATCH-3 more times 11917c478bd9Sstevel@tonic-gate #endif 11927c478bd9Sstevel@tonic-gate } 11937c478bd9Sstevel@tonic-gate /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, 11947c478bd9Sstevel@tonic-gate * but this is not important since only literal bytes will be emitted. 11957c478bd9Sstevel@tonic-gate */ 11967c478bd9Sstevel@tonic-gate 11977c478bd9Sstevel@tonic-gate } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); 11987c478bd9Sstevel@tonic-gate } 11997c478bd9Sstevel@tonic-gate 12007c478bd9Sstevel@tonic-gate /* =========================================================================== 12017c478bd9Sstevel@tonic-gate * Flush the current block, with given end-of-file flag. 12027c478bd9Sstevel@tonic-gate * IN assertion: strstart is set to the end of the current match. 12037c478bd9Sstevel@tonic-gate */ 12047c478bd9Sstevel@tonic-gate #define FLUSH_BLOCK_ONLY(s, flush) { \ 12057c478bd9Sstevel@tonic-gate ct_flush_block(s, (s->block_start >= 0L ? \ 12067c478bd9Sstevel@tonic-gate (charf *)&s->window[(unsigned)s->block_start] : \ 12077c478bd9Sstevel@tonic-gate (charf *)Z_NULL), (long)s->strstart - s->block_start, (flush)); \ 12087c478bd9Sstevel@tonic-gate s->block_start = s->strstart; \ 12097c478bd9Sstevel@tonic-gate flush_pending(s->strm); \ 12107c478bd9Sstevel@tonic-gate Tracev((stderr,"[FLUSH]")); \ 12117c478bd9Sstevel@tonic-gate } 12127c478bd9Sstevel@tonic-gate 12137c478bd9Sstevel@tonic-gate /* Same but force premature exit if necessary. */ 12147c478bd9Sstevel@tonic-gate #define FLUSH_BLOCK(s, flush) { \ 12157c478bd9Sstevel@tonic-gate FLUSH_BLOCK_ONLY(s, flush); \ 12167c478bd9Sstevel@tonic-gate if (s->strm->avail_out == 0) return 1; \ 12177c478bd9Sstevel@tonic-gate } 12187c478bd9Sstevel@tonic-gate 12197c478bd9Sstevel@tonic-gate /* =========================================================================== 12207c478bd9Sstevel@tonic-gate * Compress as much as possible from the input stream, return true if 12217c478bd9Sstevel@tonic-gate * processing was terminated prematurely (no more input or output space). 12227c478bd9Sstevel@tonic-gate * This function does not perform lazy evaluationof matches and inserts 12237c478bd9Sstevel@tonic-gate * new strings in the dictionary only for unmatched strings or for short 12247c478bd9Sstevel@tonic-gate * matches. It is used only for the fast compression options. 12257c478bd9Sstevel@tonic-gate */ 12267c478bd9Sstevel@tonic-gate local int deflate_fast(s, flush) 12277c478bd9Sstevel@tonic-gate deflate_state *s; 12287c478bd9Sstevel@tonic-gate int flush; 12297c478bd9Sstevel@tonic-gate { 12307c478bd9Sstevel@tonic-gate IPos hash_head = NIL; /* head of the hash chain */ 12317c478bd9Sstevel@tonic-gate int bflush; /* set if current block must be flushed */ 12327c478bd9Sstevel@tonic-gate 12337c478bd9Sstevel@tonic-gate s->prev_length = MIN_MATCH-1; 12347c478bd9Sstevel@tonic-gate 12357c478bd9Sstevel@tonic-gate for (;;) { 12367c478bd9Sstevel@tonic-gate /* Make sure that we always have enough lookahead, except 12377c478bd9Sstevel@tonic-gate * at the end of the input file. We need MAX_MATCH bytes 12387c478bd9Sstevel@tonic-gate * for the next match, plus MIN_MATCH bytes to insert the 12397c478bd9Sstevel@tonic-gate * string following the next match. 12407c478bd9Sstevel@tonic-gate */ 12417c478bd9Sstevel@tonic-gate if (s->lookahead < MIN_LOOKAHEAD) { 12427c478bd9Sstevel@tonic-gate fill_window(s); 12437c478bd9Sstevel@tonic-gate if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) return 1; 12447c478bd9Sstevel@tonic-gate 12457c478bd9Sstevel@tonic-gate if (s->lookahead == 0) break; /* flush the current block */ 12467c478bd9Sstevel@tonic-gate } 12477c478bd9Sstevel@tonic-gate 12487c478bd9Sstevel@tonic-gate /* Insert the string window[strstart .. strstart+2] in the 12497c478bd9Sstevel@tonic-gate * dictionary, and set hash_head to the head of the hash chain: 12507c478bd9Sstevel@tonic-gate */ 12517c478bd9Sstevel@tonic-gate if (s->lookahead >= MIN_MATCH) { 12527c478bd9Sstevel@tonic-gate INSERT_STRING(s, s->strstart, hash_head); 12537c478bd9Sstevel@tonic-gate } 12547c478bd9Sstevel@tonic-gate 12557c478bd9Sstevel@tonic-gate /* Find the longest match, discarding those <= prev_length. 12567c478bd9Sstevel@tonic-gate * At this point we have always match_length < MIN_MATCH 12577c478bd9Sstevel@tonic-gate */ 12587c478bd9Sstevel@tonic-gate if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) { 12597c478bd9Sstevel@tonic-gate /* To simplify the code, we prevent matches with the string 12607c478bd9Sstevel@tonic-gate * of window index 0 (in particular we have to avoid a match 12617c478bd9Sstevel@tonic-gate * of the string with itself at the start of the input file). 12627c478bd9Sstevel@tonic-gate */ 12637c478bd9Sstevel@tonic-gate if (s->strategy != Z_HUFFMAN_ONLY) { 12647c478bd9Sstevel@tonic-gate s->match_length = longest_match (s, hash_head); 12657c478bd9Sstevel@tonic-gate } 12667c478bd9Sstevel@tonic-gate /* longest_match() sets match_start */ 12677c478bd9Sstevel@tonic-gate 12687c478bd9Sstevel@tonic-gate if (s->match_length > s->lookahead) s->match_length = s->lookahead; 12697c478bd9Sstevel@tonic-gate } 12707c478bd9Sstevel@tonic-gate if (s->match_length >= MIN_MATCH) { 12717c478bd9Sstevel@tonic-gate check_match(s, s->strstart, s->match_start, s->match_length); 12727c478bd9Sstevel@tonic-gate 12737c478bd9Sstevel@tonic-gate bflush = ct_tally(s, s->strstart - s->match_start, 12747c478bd9Sstevel@tonic-gate s->match_length - MIN_MATCH); 12757c478bd9Sstevel@tonic-gate 12767c478bd9Sstevel@tonic-gate s->lookahead -= s->match_length; 12777c478bd9Sstevel@tonic-gate 12787c478bd9Sstevel@tonic-gate /* Insert new strings in the hash table only if the match length 12797c478bd9Sstevel@tonic-gate * is not too large. This saves time but degrades compression. 12807c478bd9Sstevel@tonic-gate */ 12817c478bd9Sstevel@tonic-gate if (s->match_length <= s->max_insert_length && 12827c478bd9Sstevel@tonic-gate s->lookahead >= MIN_MATCH) { 12837c478bd9Sstevel@tonic-gate s->match_length--; /* string at strstart already in hash table */ 12847c478bd9Sstevel@tonic-gate do { 12857c478bd9Sstevel@tonic-gate s->strstart++; 12867c478bd9Sstevel@tonic-gate INSERT_STRING(s, s->strstart, hash_head); 12877c478bd9Sstevel@tonic-gate /* strstart never exceeds WSIZE-MAX_MATCH, so there are 12887c478bd9Sstevel@tonic-gate * always MIN_MATCH bytes ahead. 12897c478bd9Sstevel@tonic-gate */ 12907c478bd9Sstevel@tonic-gate } while (--s->match_length != 0); 12917c478bd9Sstevel@tonic-gate s->strstart++; 12927c478bd9Sstevel@tonic-gate } else { 12937c478bd9Sstevel@tonic-gate s->strstart += s->match_length; 12947c478bd9Sstevel@tonic-gate s->match_length = 0; 12957c478bd9Sstevel@tonic-gate s->ins_h = s->window[s->strstart]; 12967c478bd9Sstevel@tonic-gate UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]); 12977c478bd9Sstevel@tonic-gate #if MIN_MATCH != 3 12987c478bd9Sstevel@tonic-gate Call UPDATE_HASH() MIN_MATCH-3 more times 12997c478bd9Sstevel@tonic-gate #endif 13007c478bd9Sstevel@tonic-gate /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not 13017c478bd9Sstevel@tonic-gate * matter since it will be recomputed at next deflate call. 13027c478bd9Sstevel@tonic-gate */ 13037c478bd9Sstevel@tonic-gate } 13047c478bd9Sstevel@tonic-gate } else { 13057c478bd9Sstevel@tonic-gate /* No match, output a literal byte */ 13067c478bd9Sstevel@tonic-gate Tracevv((stderr,"%c", s->window[s->strstart])); 13077c478bd9Sstevel@tonic-gate bflush = ct_tally (s, 0, s->window[s->strstart]); 13087c478bd9Sstevel@tonic-gate s->lookahead--; 13097c478bd9Sstevel@tonic-gate s->strstart++; 13107c478bd9Sstevel@tonic-gate } 13117c478bd9Sstevel@tonic-gate if (bflush) FLUSH_BLOCK(s, Z_NO_FLUSH); 13127c478bd9Sstevel@tonic-gate } 13137c478bd9Sstevel@tonic-gate FLUSH_BLOCK(s, flush); 13147c478bd9Sstevel@tonic-gate return 0; /* normal exit */ 13157c478bd9Sstevel@tonic-gate } 13167c478bd9Sstevel@tonic-gate 13177c478bd9Sstevel@tonic-gate /* =========================================================================== 13187c478bd9Sstevel@tonic-gate * Same as above, but achieves better compression. We use a lazy 13197c478bd9Sstevel@tonic-gate * evaluation for matches: a match is finally adopted only if there is 13207c478bd9Sstevel@tonic-gate * no better match at the next window position. 13217c478bd9Sstevel@tonic-gate */ 13227c478bd9Sstevel@tonic-gate local int deflate_slow(s, flush) 13237c478bd9Sstevel@tonic-gate deflate_state *s; 13247c478bd9Sstevel@tonic-gate int flush; 13257c478bd9Sstevel@tonic-gate { 13267c478bd9Sstevel@tonic-gate IPos hash_head = NIL; /* head of hash chain */ 13277c478bd9Sstevel@tonic-gate int bflush; /* set if current block must be flushed */ 13287c478bd9Sstevel@tonic-gate 13297c478bd9Sstevel@tonic-gate /* Process the input block. */ 13307c478bd9Sstevel@tonic-gate for (;;) { 13317c478bd9Sstevel@tonic-gate /* Make sure that we always have enough lookahead, except 13327c478bd9Sstevel@tonic-gate * at the end of the input file. We need MAX_MATCH bytes 13337c478bd9Sstevel@tonic-gate * for the next match, plus MIN_MATCH bytes to insert the 13347c478bd9Sstevel@tonic-gate * string following the next match. 13357c478bd9Sstevel@tonic-gate */ 13367c478bd9Sstevel@tonic-gate if (s->lookahead < MIN_LOOKAHEAD) { 13377c478bd9Sstevel@tonic-gate fill_window(s); 13387c478bd9Sstevel@tonic-gate if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) return 1; 13397c478bd9Sstevel@tonic-gate 13407c478bd9Sstevel@tonic-gate if (s->lookahead == 0) break; /* flush the current block */ 13417c478bd9Sstevel@tonic-gate } 13427c478bd9Sstevel@tonic-gate 13437c478bd9Sstevel@tonic-gate /* Insert the string window[strstart .. strstart+2] in the 13447c478bd9Sstevel@tonic-gate * dictionary, and set hash_head to the head of the hash chain: 13457c478bd9Sstevel@tonic-gate */ 13467c478bd9Sstevel@tonic-gate if (s->lookahead >= MIN_MATCH) { 13477c478bd9Sstevel@tonic-gate INSERT_STRING(s, s->strstart, hash_head); 13487c478bd9Sstevel@tonic-gate } 13497c478bd9Sstevel@tonic-gate 13507c478bd9Sstevel@tonic-gate /* Find the longest match, discarding those <= prev_length. 13517c478bd9Sstevel@tonic-gate */ 13527c478bd9Sstevel@tonic-gate s->prev_length = s->match_length, s->prev_match = s->match_start; 13537c478bd9Sstevel@tonic-gate s->match_length = MIN_MATCH-1; 13547c478bd9Sstevel@tonic-gate 13557c478bd9Sstevel@tonic-gate if (hash_head != NIL && s->prev_length < s->max_lazy_match && 13567c478bd9Sstevel@tonic-gate s->strstart - hash_head <= MAX_DIST(s)) { 13577c478bd9Sstevel@tonic-gate /* To simplify the code, we prevent matches with the string 13587c478bd9Sstevel@tonic-gate * of window index 0 (in particular we have to avoid a match 13597c478bd9Sstevel@tonic-gate * of the string with itself at the start of the input file). 13607c478bd9Sstevel@tonic-gate */ 13617c478bd9Sstevel@tonic-gate if (s->strategy != Z_HUFFMAN_ONLY) { 13627c478bd9Sstevel@tonic-gate s->match_length = longest_match (s, hash_head); 13637c478bd9Sstevel@tonic-gate } 13647c478bd9Sstevel@tonic-gate /* longest_match() sets match_start */ 13657c478bd9Sstevel@tonic-gate if (s->match_length > s->lookahead) s->match_length = s->lookahead; 13667c478bd9Sstevel@tonic-gate 13677c478bd9Sstevel@tonic-gate if (s->match_length <= 5 && (s->strategy == Z_FILTERED || 13687c478bd9Sstevel@tonic-gate (s->match_length == MIN_MATCH && 13697c478bd9Sstevel@tonic-gate s->strstart - s->match_start > TOO_FAR))) { 13707c478bd9Sstevel@tonic-gate 13717c478bd9Sstevel@tonic-gate /* If prev_match is also MIN_MATCH, match_start is garbage 13727c478bd9Sstevel@tonic-gate * but we will ignore the current match anyway. 13737c478bd9Sstevel@tonic-gate */ 13747c478bd9Sstevel@tonic-gate s->match_length = MIN_MATCH-1; 13757c478bd9Sstevel@tonic-gate } 13767c478bd9Sstevel@tonic-gate } 13777c478bd9Sstevel@tonic-gate /* If there was a match at the previous step and the current 13787c478bd9Sstevel@tonic-gate * match is not better, output the previous match: 13797c478bd9Sstevel@tonic-gate */ 13807c478bd9Sstevel@tonic-gate if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) { 13817c478bd9Sstevel@tonic-gate uInt max_insert = s->strstart + s->lookahead - MIN_MATCH; 13827c478bd9Sstevel@tonic-gate /* Do not insert strings in hash table beyond this. */ 13837c478bd9Sstevel@tonic-gate 13847c478bd9Sstevel@tonic-gate check_match(s, s->strstart-1, s->prev_match, s->prev_length); 13857c478bd9Sstevel@tonic-gate 13867c478bd9Sstevel@tonic-gate bflush = ct_tally(s, s->strstart -1 - s->prev_match, 13877c478bd9Sstevel@tonic-gate s->prev_length - MIN_MATCH); 13887c478bd9Sstevel@tonic-gate 13897c478bd9Sstevel@tonic-gate /* Insert in hash table all strings up to the end of the match. 13907c478bd9Sstevel@tonic-gate * strstart-1 and strstart are already inserted. If there is not 13917c478bd9Sstevel@tonic-gate * enough lookahead, the last two strings are not inserted in 13927c478bd9Sstevel@tonic-gate * the hash table. 13937c478bd9Sstevel@tonic-gate */ 13947c478bd9Sstevel@tonic-gate s->lookahead -= s->prev_length-1; 13957c478bd9Sstevel@tonic-gate s->prev_length -= 2; 13967c478bd9Sstevel@tonic-gate do { 13977c478bd9Sstevel@tonic-gate if (++s->strstart <= max_insert) { 13987c478bd9Sstevel@tonic-gate INSERT_STRING(s, s->strstart, hash_head); 13997c478bd9Sstevel@tonic-gate } 14007c478bd9Sstevel@tonic-gate } while (--s->prev_length != 0); 14017c478bd9Sstevel@tonic-gate s->match_available = 0; 14027c478bd9Sstevel@tonic-gate s->match_length = MIN_MATCH-1; 14037c478bd9Sstevel@tonic-gate s->strstart++; 14047c478bd9Sstevel@tonic-gate 14057c478bd9Sstevel@tonic-gate if (bflush) FLUSH_BLOCK(s, Z_NO_FLUSH); 14067c478bd9Sstevel@tonic-gate 14077c478bd9Sstevel@tonic-gate } else if (s->match_available) { 14087c478bd9Sstevel@tonic-gate /* If there was no match at the previous position, output a 14097c478bd9Sstevel@tonic-gate * single literal. If there was a match but the current match 14107c478bd9Sstevel@tonic-gate * is longer, truncate the previous match to a single literal. 14117c478bd9Sstevel@tonic-gate */ 14127c478bd9Sstevel@tonic-gate Tracevv((stderr,"%c", s->window[s->strstart-1])); 14137c478bd9Sstevel@tonic-gate if (ct_tally (s, 0, s->window[s->strstart-1])) { 14147c478bd9Sstevel@tonic-gate FLUSH_BLOCK_ONLY(s, Z_NO_FLUSH); 14157c478bd9Sstevel@tonic-gate } 14167c478bd9Sstevel@tonic-gate s->strstart++; 14177c478bd9Sstevel@tonic-gate s->lookahead--; 14187c478bd9Sstevel@tonic-gate if (s->strm->avail_out == 0) return 1; 14197c478bd9Sstevel@tonic-gate } else { 14207c478bd9Sstevel@tonic-gate /* There is no previous match to compare with, wait for 14217c478bd9Sstevel@tonic-gate * the next step to decide. 14227c478bd9Sstevel@tonic-gate */ 14237c478bd9Sstevel@tonic-gate s->match_available = 1; 14247c478bd9Sstevel@tonic-gate s->strstart++; 14257c478bd9Sstevel@tonic-gate s->lookahead--; 14267c478bd9Sstevel@tonic-gate } 14277c478bd9Sstevel@tonic-gate } 14287c478bd9Sstevel@tonic-gate Assert (flush != Z_NO_FLUSH, "no flush?"); 14297c478bd9Sstevel@tonic-gate if (s->match_available) { 14307c478bd9Sstevel@tonic-gate Tracevv((stderr,"%c", s->window[s->strstart-1])); 14317c478bd9Sstevel@tonic-gate ct_tally (s, 0, s->window[s->strstart-1]); 14327c478bd9Sstevel@tonic-gate s->match_available = 0; 14337c478bd9Sstevel@tonic-gate } 14347c478bd9Sstevel@tonic-gate FLUSH_BLOCK(s, flush); 14357c478bd9Sstevel@tonic-gate return 0; 14367c478bd9Sstevel@tonic-gate } 14377c478bd9Sstevel@tonic-gate 14387c478bd9Sstevel@tonic-gate 14397c478bd9Sstevel@tonic-gate /*+++++*/ 14407c478bd9Sstevel@tonic-gate /* trees.c -- output deflated data using Huffman coding 14417c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Jean-loup Gailly 14427c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 14437c478bd9Sstevel@tonic-gate */ 14447c478bd9Sstevel@tonic-gate 14457c478bd9Sstevel@tonic-gate /* 14467c478bd9Sstevel@tonic-gate * ALGORITHM 14477c478bd9Sstevel@tonic-gate * 14487c478bd9Sstevel@tonic-gate * The "deflation" process uses several Huffman trees. The more 14497c478bd9Sstevel@tonic-gate * common source values are represented by shorter bit sequences. 14507c478bd9Sstevel@tonic-gate * 14517c478bd9Sstevel@tonic-gate * Each code tree is stored in a compressed form which is itself 14527c478bd9Sstevel@tonic-gate * a Huffman encoding of the lengths of all the code strings (in 14537c478bd9Sstevel@tonic-gate * ascending order by source values). The actual code strings are 14547c478bd9Sstevel@tonic-gate * reconstructed from the lengths in the inflate process, as described 14557c478bd9Sstevel@tonic-gate * in the deflate specification. 14567c478bd9Sstevel@tonic-gate * 14577c478bd9Sstevel@tonic-gate * REFERENCES 14587c478bd9Sstevel@tonic-gate * 14597c478bd9Sstevel@tonic-gate * Deutsch, L.P.,"'Deflate' Compressed Data Format Specification". 14607c478bd9Sstevel@tonic-gate * Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc 14617c478bd9Sstevel@tonic-gate * 14627c478bd9Sstevel@tonic-gate * Storer, James A. 14637c478bd9Sstevel@tonic-gate * Data Compression: Methods and Theory, pp. 49-50. 14647c478bd9Sstevel@tonic-gate * Computer Science Press, 1988. ISBN 0-7167-8156-5. 14657c478bd9Sstevel@tonic-gate * 14667c478bd9Sstevel@tonic-gate * Sedgewick, R. 14677c478bd9Sstevel@tonic-gate * Algorithms, p290. 14687c478bd9Sstevel@tonic-gate * Addison-Wesley, 1983. ISBN 0-201-06672-6. 14697c478bd9Sstevel@tonic-gate */ 14707c478bd9Sstevel@tonic-gate 14717c478bd9Sstevel@tonic-gate /* From: trees.c,v 1.5 1995/05/03 17:27:12 jloup Exp */ 14727c478bd9Sstevel@tonic-gate 14737c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 14747c478bd9Sstevel@tonic-gate # include <ctype.h> 14757c478bd9Sstevel@tonic-gate #endif 14767c478bd9Sstevel@tonic-gate 14777c478bd9Sstevel@tonic-gate /* =========================================================================== 14787c478bd9Sstevel@tonic-gate * Constants 14797c478bd9Sstevel@tonic-gate */ 14807c478bd9Sstevel@tonic-gate 14817c478bd9Sstevel@tonic-gate #define MAX_BL_BITS 7 14827c478bd9Sstevel@tonic-gate /* Bit length codes must not exceed MAX_BL_BITS bits */ 14837c478bd9Sstevel@tonic-gate 14847c478bd9Sstevel@tonic-gate #define END_BLOCK 256 14857c478bd9Sstevel@tonic-gate /* end of block literal code */ 14867c478bd9Sstevel@tonic-gate 14877c478bd9Sstevel@tonic-gate #define REP_3_6 16 14887c478bd9Sstevel@tonic-gate /* repeat previous bit length 3-6 times (2 bits of repeat count) */ 14897c478bd9Sstevel@tonic-gate 14907c478bd9Sstevel@tonic-gate #define REPZ_3_10 17 14917c478bd9Sstevel@tonic-gate /* repeat a zero length 3-10 times (3 bits of repeat count) */ 14927c478bd9Sstevel@tonic-gate 14937c478bd9Sstevel@tonic-gate #define REPZ_11_138 18 14947c478bd9Sstevel@tonic-gate /* repeat a zero length 11-138 times (7 bits of repeat count) */ 14957c478bd9Sstevel@tonic-gate 14967c478bd9Sstevel@tonic-gate local int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 14977c478bd9Sstevel@tonic-gate = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0}; 14987c478bd9Sstevel@tonic-gate 14997c478bd9Sstevel@tonic-gate local int extra_dbits[D_CODES] /* extra bits for each distance code */ 15007c478bd9Sstevel@tonic-gate = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13}; 15017c478bd9Sstevel@tonic-gate 15027c478bd9Sstevel@tonic-gate local int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 15037c478bd9Sstevel@tonic-gate = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7}; 15047c478bd9Sstevel@tonic-gate 15057c478bd9Sstevel@tonic-gate local uch bl_order[BL_CODES] 15067c478bd9Sstevel@tonic-gate = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15}; 15077c478bd9Sstevel@tonic-gate /* The lengths of the bit length codes are sent in order of decreasing 15087c478bd9Sstevel@tonic-gate * probability, to avoid transmitting the lengths for unused bit length codes. 15097c478bd9Sstevel@tonic-gate */ 15107c478bd9Sstevel@tonic-gate 15117c478bd9Sstevel@tonic-gate #define Buf_size (8 * 2*sizeof(char)) 15127c478bd9Sstevel@tonic-gate /* Number of bits used within bi_buf. (bi_buf might be implemented on 15137c478bd9Sstevel@tonic-gate * more than 16 bits on some systems.) 15147c478bd9Sstevel@tonic-gate */ 15157c478bd9Sstevel@tonic-gate 15167c478bd9Sstevel@tonic-gate /* =========================================================================== 15177c478bd9Sstevel@tonic-gate * Local data. These are initialized only once. 15187c478bd9Sstevel@tonic-gate * To do: initialize at compile time to be completely reentrant. ??? 15197c478bd9Sstevel@tonic-gate */ 15207c478bd9Sstevel@tonic-gate 15217c478bd9Sstevel@tonic-gate local ct_data static_ltree[L_CODES+2]; 15227c478bd9Sstevel@tonic-gate /* The static literal tree. Since the bit lengths are imposed, there is no 15237c478bd9Sstevel@tonic-gate * need for the L_CODES extra codes used during heap construction. However 15247c478bd9Sstevel@tonic-gate * The codes 286 and 287 are needed to build a canonical tree (see ct_init 15257c478bd9Sstevel@tonic-gate * below). 15267c478bd9Sstevel@tonic-gate */ 15277c478bd9Sstevel@tonic-gate 15287c478bd9Sstevel@tonic-gate local ct_data static_dtree[D_CODES]; 15297c478bd9Sstevel@tonic-gate /* The static distance tree. (Actually a trivial tree since all codes use 15307c478bd9Sstevel@tonic-gate * 5 bits.) 15317c478bd9Sstevel@tonic-gate */ 15327c478bd9Sstevel@tonic-gate 15337c478bd9Sstevel@tonic-gate local uch dist_code[512]; 15347c478bd9Sstevel@tonic-gate /* distance codes. The first 256 values correspond to the distances 15357c478bd9Sstevel@tonic-gate * 3 .. 258, the last 256 values correspond to the top 8 bits of 15367c478bd9Sstevel@tonic-gate * the 15 bit distances. 15377c478bd9Sstevel@tonic-gate */ 15387c478bd9Sstevel@tonic-gate 15397c478bd9Sstevel@tonic-gate local uch length_code[MAX_MATCH-MIN_MATCH+1]; 15407c478bd9Sstevel@tonic-gate /* length code for each normalized match length (0 == MIN_MATCH) */ 15417c478bd9Sstevel@tonic-gate 15427c478bd9Sstevel@tonic-gate local int base_length[LENGTH_CODES]; 15437c478bd9Sstevel@tonic-gate /* First normalized length for each code (0 = MIN_MATCH) */ 15447c478bd9Sstevel@tonic-gate 15457c478bd9Sstevel@tonic-gate local int base_dist[D_CODES]; 15467c478bd9Sstevel@tonic-gate /* First normalized distance for each code (0 = distance of 1) */ 15477c478bd9Sstevel@tonic-gate 15487c478bd9Sstevel@tonic-gate struct static_tree_desc_s { 15497c478bd9Sstevel@tonic-gate ct_data *static_tree; /* static tree or NULL */ 15507c478bd9Sstevel@tonic-gate intf *extra_bits; /* extra bits for each code or NULL */ 15517c478bd9Sstevel@tonic-gate int extra_base; /* base index for extra_bits */ 15527c478bd9Sstevel@tonic-gate int elems; /* max number of elements in the tree */ 15537c478bd9Sstevel@tonic-gate int max_length; /* max bit length for the codes */ 15547c478bd9Sstevel@tonic-gate }; 15557c478bd9Sstevel@tonic-gate 15567c478bd9Sstevel@tonic-gate local static_tree_desc static_l_desc = 15577c478bd9Sstevel@tonic-gate {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS}; 15587c478bd9Sstevel@tonic-gate 15597c478bd9Sstevel@tonic-gate local static_tree_desc static_d_desc = 15607c478bd9Sstevel@tonic-gate {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS}; 15617c478bd9Sstevel@tonic-gate 15627c478bd9Sstevel@tonic-gate local static_tree_desc static_bl_desc = 15637c478bd9Sstevel@tonic-gate {(ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 15647c478bd9Sstevel@tonic-gate 15657c478bd9Sstevel@tonic-gate /* =========================================================================== 15667c478bd9Sstevel@tonic-gate * Local (static) routines in this file. 15677c478bd9Sstevel@tonic-gate */ 15687c478bd9Sstevel@tonic-gate 15697c478bd9Sstevel@tonic-gate local void ct_static_init OF((void)); 15707c478bd9Sstevel@tonic-gate local void init_block OF((deflate_state *s)); 15717c478bd9Sstevel@tonic-gate local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 15727c478bd9Sstevel@tonic-gate local void gen_bitlen OF((deflate_state *s, tree_desc *desc)); 15737c478bd9Sstevel@tonic-gate local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 15747c478bd9Sstevel@tonic-gate local void build_tree OF((deflate_state *s, tree_desc *desc)); 15757c478bd9Sstevel@tonic-gate local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code)); 15767c478bd9Sstevel@tonic-gate local void send_tree OF((deflate_state *s, ct_data *tree, int max_code)); 15777c478bd9Sstevel@tonic-gate local int build_bl_tree OF((deflate_state *s)); 15787c478bd9Sstevel@tonic-gate local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes, 15797c478bd9Sstevel@tonic-gate int blcodes)); 15807c478bd9Sstevel@tonic-gate local void compress_block OF((deflate_state *s, ct_data *ltree, 15817c478bd9Sstevel@tonic-gate ct_data *dtree)); 15827c478bd9Sstevel@tonic-gate local void set_data_type OF((deflate_state *s)); 15837c478bd9Sstevel@tonic-gate local unsigned bi_reverse OF((unsigned value, int length)); 15847c478bd9Sstevel@tonic-gate local void bi_windup OF((deflate_state *s)); 15857c478bd9Sstevel@tonic-gate local void bi_flush OF((deflate_state *s)); 15867c478bd9Sstevel@tonic-gate local void copy_block OF((deflate_state *s, charf *buf, unsigned len, 15877c478bd9Sstevel@tonic-gate int header)); 15887c478bd9Sstevel@tonic-gate 15897c478bd9Sstevel@tonic-gate #ifndef DEBUG_ZLIB 15907c478bd9Sstevel@tonic-gate # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) 15917c478bd9Sstevel@tonic-gate /* Send a code of the given tree. c and tree must not have side effects */ 15927c478bd9Sstevel@tonic-gate 15937c478bd9Sstevel@tonic-gate #else /* DEBUG_ZLIB */ 15947c478bd9Sstevel@tonic-gate # define send_code(s, c, tree) \ 15957c478bd9Sstevel@tonic-gate { if (verbose>1) fprintf(stderr,"\ncd %3d ",(c)); \ 15967c478bd9Sstevel@tonic-gate send_bits(s, tree[c].Code, tree[c].Len); } 15977c478bd9Sstevel@tonic-gate #endif 15987c478bd9Sstevel@tonic-gate 15997c478bd9Sstevel@tonic-gate #define d_code(dist) \ 16007c478bd9Sstevel@tonic-gate ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)]) 16017c478bd9Sstevel@tonic-gate /* Mapping from a distance to a distance code. dist is the distance - 1 and 16027c478bd9Sstevel@tonic-gate * must not have side effects. dist_code[256] and dist_code[257] are never 16037c478bd9Sstevel@tonic-gate * used. 16047c478bd9Sstevel@tonic-gate */ 16057c478bd9Sstevel@tonic-gate 16067c478bd9Sstevel@tonic-gate /* =========================================================================== 16077c478bd9Sstevel@tonic-gate * Output a short LSB first on the stream. 16087c478bd9Sstevel@tonic-gate * IN assertion: there is enough room in pendingBuf. 16097c478bd9Sstevel@tonic-gate */ 16107c478bd9Sstevel@tonic-gate #define put_short(s, w) { \ 16117c478bd9Sstevel@tonic-gate put_byte(s, (uch)((w) & 0xff)); \ 16127c478bd9Sstevel@tonic-gate put_byte(s, (uch)((ush)(w) >> 8)); \ 16137c478bd9Sstevel@tonic-gate } 16147c478bd9Sstevel@tonic-gate 16157c478bd9Sstevel@tonic-gate /* =========================================================================== 16167c478bd9Sstevel@tonic-gate * Send a value on a given number of bits. 16177c478bd9Sstevel@tonic-gate * IN assertion: length <= 16 and value fits in length bits. 16187c478bd9Sstevel@tonic-gate */ 16197c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 16207c478bd9Sstevel@tonic-gate local void send_bits OF((deflate_state *s, int value, int length)); 16217c478bd9Sstevel@tonic-gate 16227c478bd9Sstevel@tonic-gate local void send_bits(s, value, length) 16237c478bd9Sstevel@tonic-gate deflate_state *s; 16247c478bd9Sstevel@tonic-gate int value; /* value to send */ 16257c478bd9Sstevel@tonic-gate int length; /* number of bits */ 16267c478bd9Sstevel@tonic-gate { 16277c478bd9Sstevel@tonic-gate Tracev((stderr," l %2d v %4x ", length, value)); 16287c478bd9Sstevel@tonic-gate Assert(length > 0 && length <= 15, "invalid length"); 16297c478bd9Sstevel@tonic-gate s->bits_sent += (ulg)length; 16307c478bd9Sstevel@tonic-gate 16317c478bd9Sstevel@tonic-gate /* If not enough room in bi_buf, use (valid) bits from bi_buf and 16327c478bd9Sstevel@tonic-gate * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid)) 16337c478bd9Sstevel@tonic-gate * unused bits in value. 16347c478bd9Sstevel@tonic-gate */ 16357c478bd9Sstevel@tonic-gate if (s->bi_valid > (int)Buf_size - length) { 16367c478bd9Sstevel@tonic-gate s->bi_buf |= (value << s->bi_valid); 16377c478bd9Sstevel@tonic-gate put_short(s, s->bi_buf); 16387c478bd9Sstevel@tonic-gate s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); 16397c478bd9Sstevel@tonic-gate s->bi_valid += length - Buf_size; 16407c478bd9Sstevel@tonic-gate } else { 16417c478bd9Sstevel@tonic-gate s->bi_buf |= value << s->bi_valid; 16427c478bd9Sstevel@tonic-gate s->bi_valid += length; 16437c478bd9Sstevel@tonic-gate } 16447c478bd9Sstevel@tonic-gate } 16457c478bd9Sstevel@tonic-gate #else /* !DEBUG_ZLIB */ 16467c478bd9Sstevel@tonic-gate 16477c478bd9Sstevel@tonic-gate #define send_bits(s, value, length) \ 16487c478bd9Sstevel@tonic-gate { int len = length;\ 16497c478bd9Sstevel@tonic-gate if (s->bi_valid > (int)Buf_size - len) {\ 16507c478bd9Sstevel@tonic-gate int val = value;\ 16517c478bd9Sstevel@tonic-gate s->bi_buf |= (val << s->bi_valid);\ 16527c478bd9Sstevel@tonic-gate put_short(s, s->bi_buf);\ 16537c478bd9Sstevel@tonic-gate s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\ 16547c478bd9Sstevel@tonic-gate s->bi_valid += len - Buf_size;\ 16557c478bd9Sstevel@tonic-gate } else {\ 16567c478bd9Sstevel@tonic-gate s->bi_buf |= (value) << s->bi_valid;\ 16577c478bd9Sstevel@tonic-gate s->bi_valid += len;\ 16587c478bd9Sstevel@tonic-gate }\ 16597c478bd9Sstevel@tonic-gate } 16607c478bd9Sstevel@tonic-gate #endif /* DEBUG_ZLIB */ 16617c478bd9Sstevel@tonic-gate 16627c478bd9Sstevel@tonic-gate 16637c478bd9Sstevel@tonic-gate #define MAX(a,b) (a >= b ? a : b) 16647c478bd9Sstevel@tonic-gate /* the arguments must not have side effects */ 16657c478bd9Sstevel@tonic-gate 16667c478bd9Sstevel@tonic-gate /* =========================================================================== 16677c478bd9Sstevel@tonic-gate * Initialize the various 'constant' tables. 16687c478bd9Sstevel@tonic-gate * To do: do this at compile time. 16697c478bd9Sstevel@tonic-gate */ 16707c478bd9Sstevel@tonic-gate local void ct_static_init() 16717c478bd9Sstevel@tonic-gate { 16727c478bd9Sstevel@tonic-gate int n; /* iterates over tree elements */ 16737c478bd9Sstevel@tonic-gate int bits; /* bit counter */ 16747c478bd9Sstevel@tonic-gate int length; /* length value */ 16757c478bd9Sstevel@tonic-gate int code; /* code value */ 16767c478bd9Sstevel@tonic-gate int dist; /* distance index */ 16777c478bd9Sstevel@tonic-gate ush bl_count[MAX_BITS+1]; 16787c478bd9Sstevel@tonic-gate /* number of codes at each bit length for an optimal tree */ 16797c478bd9Sstevel@tonic-gate 16807c478bd9Sstevel@tonic-gate /* Initialize the mapping length (0..255) -> length code (0..28) */ 16817c478bd9Sstevel@tonic-gate length = 0; 16827c478bd9Sstevel@tonic-gate for (code = 0; code < LENGTH_CODES-1; code++) { 16837c478bd9Sstevel@tonic-gate base_length[code] = length; 16847c478bd9Sstevel@tonic-gate for (n = 0; n < (1<<extra_lbits[code]); n++) { 16857c478bd9Sstevel@tonic-gate length_code[length++] = (uch)code; 16867c478bd9Sstevel@tonic-gate } 16877c478bd9Sstevel@tonic-gate } 16887c478bd9Sstevel@tonic-gate Assert (length == 256, "ct_static_init: length != 256"); 16897c478bd9Sstevel@tonic-gate /* Note that the length 255 (match length 258) can be represented 16907c478bd9Sstevel@tonic-gate * in two different ways: code 284 + 5 bits or code 285, so we 16917c478bd9Sstevel@tonic-gate * overwrite length_code[255] to use the best encoding: 16927c478bd9Sstevel@tonic-gate */ 16937c478bd9Sstevel@tonic-gate length_code[length-1] = (uch)code; 16947c478bd9Sstevel@tonic-gate 16957c478bd9Sstevel@tonic-gate /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ 16967c478bd9Sstevel@tonic-gate dist = 0; 16977c478bd9Sstevel@tonic-gate for (code = 0 ; code < 16; code++) { 16987c478bd9Sstevel@tonic-gate base_dist[code] = dist; 16997c478bd9Sstevel@tonic-gate for (n = 0; n < (1<<extra_dbits[code]); n++) { 17007c478bd9Sstevel@tonic-gate dist_code[dist++] = (uch)code; 17017c478bd9Sstevel@tonic-gate } 17027c478bd9Sstevel@tonic-gate } 17037c478bd9Sstevel@tonic-gate Assert (dist == 256, "ct_static_init: dist != 256"); 17047c478bd9Sstevel@tonic-gate dist >>= 7; /* from now on, all distances are divided by 128 */ 17057c478bd9Sstevel@tonic-gate for ( ; code < D_CODES; code++) { 17067c478bd9Sstevel@tonic-gate base_dist[code] = dist << 7; 17077c478bd9Sstevel@tonic-gate for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) { 17087c478bd9Sstevel@tonic-gate dist_code[256 + dist++] = (uch)code; 17097c478bd9Sstevel@tonic-gate } 17107c478bd9Sstevel@tonic-gate } 17117c478bd9Sstevel@tonic-gate Assert (dist == 256, "ct_static_init: 256+dist != 512"); 17127c478bd9Sstevel@tonic-gate 17137c478bd9Sstevel@tonic-gate /* Construct the codes of the static literal tree */ 17147c478bd9Sstevel@tonic-gate for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; 17157c478bd9Sstevel@tonic-gate n = 0; 17167c478bd9Sstevel@tonic-gate while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; 17177c478bd9Sstevel@tonic-gate while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; 17187c478bd9Sstevel@tonic-gate while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; 17197c478bd9Sstevel@tonic-gate while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; 17207c478bd9Sstevel@tonic-gate /* Codes 286 and 287 do not exist, but we must include them in the 17217c478bd9Sstevel@tonic-gate * tree construction to get a canonical Huffman tree (longest code 17227c478bd9Sstevel@tonic-gate * all ones) 17237c478bd9Sstevel@tonic-gate */ 17247c478bd9Sstevel@tonic-gate gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); 17257c478bd9Sstevel@tonic-gate 17267c478bd9Sstevel@tonic-gate /* The static distance tree is trivial: */ 17277c478bd9Sstevel@tonic-gate for (n = 0; n < D_CODES; n++) { 17287c478bd9Sstevel@tonic-gate static_dtree[n].Len = 5; 17297c478bd9Sstevel@tonic-gate static_dtree[n].Code = bi_reverse(n, 5); 17307c478bd9Sstevel@tonic-gate } 17317c478bd9Sstevel@tonic-gate } 17327c478bd9Sstevel@tonic-gate 17337c478bd9Sstevel@tonic-gate /* =========================================================================== 17347c478bd9Sstevel@tonic-gate * Initialize the tree data structures for a new zlib stream. 17357c478bd9Sstevel@tonic-gate */ 17367c478bd9Sstevel@tonic-gate local void ct_init(s) 17377c478bd9Sstevel@tonic-gate deflate_state *s; 17387c478bd9Sstevel@tonic-gate { 17397c478bd9Sstevel@tonic-gate if (static_dtree[0].Len == 0) { 17407c478bd9Sstevel@tonic-gate ct_static_init(); /* To do: at compile time */ 17417c478bd9Sstevel@tonic-gate } 17427c478bd9Sstevel@tonic-gate 17437c478bd9Sstevel@tonic-gate s->compressed_len = 0L; 17447c478bd9Sstevel@tonic-gate 17457c478bd9Sstevel@tonic-gate s->l_desc.dyn_tree = s->dyn_ltree; 17467c478bd9Sstevel@tonic-gate s->l_desc.stat_desc = &static_l_desc; 17477c478bd9Sstevel@tonic-gate 17487c478bd9Sstevel@tonic-gate s->d_desc.dyn_tree = s->dyn_dtree; 17497c478bd9Sstevel@tonic-gate s->d_desc.stat_desc = &static_d_desc; 17507c478bd9Sstevel@tonic-gate 17517c478bd9Sstevel@tonic-gate s->bl_desc.dyn_tree = s->bl_tree; 17527c478bd9Sstevel@tonic-gate s->bl_desc.stat_desc = &static_bl_desc; 17537c478bd9Sstevel@tonic-gate 17547c478bd9Sstevel@tonic-gate s->bi_buf = 0; 17557c478bd9Sstevel@tonic-gate s->bi_valid = 0; 17567c478bd9Sstevel@tonic-gate s->last_eob_len = 8; /* enough lookahead for inflate */ 17577c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 17587c478bd9Sstevel@tonic-gate s->bits_sent = 0L; 17597c478bd9Sstevel@tonic-gate #endif 17607c478bd9Sstevel@tonic-gate s->blocks_in_packet = 0; 17617c478bd9Sstevel@tonic-gate 17627c478bd9Sstevel@tonic-gate /* Initialize the first block of the first file: */ 17637c478bd9Sstevel@tonic-gate init_block(s); 17647c478bd9Sstevel@tonic-gate } 17657c478bd9Sstevel@tonic-gate 17667c478bd9Sstevel@tonic-gate /* =========================================================================== 17677c478bd9Sstevel@tonic-gate * Initialize a new block. 17687c478bd9Sstevel@tonic-gate */ 17697c478bd9Sstevel@tonic-gate local void init_block(s) 17707c478bd9Sstevel@tonic-gate deflate_state *s; 17717c478bd9Sstevel@tonic-gate { 17727c478bd9Sstevel@tonic-gate int n; /* iterates over tree elements */ 17737c478bd9Sstevel@tonic-gate 17747c478bd9Sstevel@tonic-gate /* Initialize the trees. */ 17757c478bd9Sstevel@tonic-gate for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 17767c478bd9Sstevel@tonic-gate for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 17777c478bd9Sstevel@tonic-gate for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 17787c478bd9Sstevel@tonic-gate 17797c478bd9Sstevel@tonic-gate s->dyn_ltree[END_BLOCK].Freq = 1; 17807c478bd9Sstevel@tonic-gate s->opt_len = s->static_len = 0L; 17817c478bd9Sstevel@tonic-gate s->last_lit = s->matches = 0; 17827c478bd9Sstevel@tonic-gate } 17837c478bd9Sstevel@tonic-gate 17847c478bd9Sstevel@tonic-gate #define SMALLEST 1 17857c478bd9Sstevel@tonic-gate /* Index within the heap array of least frequent node in the Huffman tree */ 17867c478bd9Sstevel@tonic-gate 17877c478bd9Sstevel@tonic-gate 17887c478bd9Sstevel@tonic-gate /* =========================================================================== 17897c478bd9Sstevel@tonic-gate * Remove the smallest element from the heap and recreate the heap with 17907c478bd9Sstevel@tonic-gate * one less element. Updates heap and heap_len. 17917c478bd9Sstevel@tonic-gate */ 17927c478bd9Sstevel@tonic-gate #define pqremove(s, tree, top) \ 17937c478bd9Sstevel@tonic-gate {\ 17947c478bd9Sstevel@tonic-gate top = s->heap[SMALLEST]; \ 17957c478bd9Sstevel@tonic-gate s->heap[SMALLEST] = s->heap[s->heap_len--]; \ 17967c478bd9Sstevel@tonic-gate pqdownheap(s, tree, SMALLEST); \ 17977c478bd9Sstevel@tonic-gate } 17987c478bd9Sstevel@tonic-gate 17997c478bd9Sstevel@tonic-gate /* =========================================================================== 18007c478bd9Sstevel@tonic-gate * Compares to subtrees, using the tree depth as tie breaker when 18017c478bd9Sstevel@tonic-gate * the subtrees have equal frequency. This minimizes the worst case length. 18027c478bd9Sstevel@tonic-gate */ 18037c478bd9Sstevel@tonic-gate #define smaller(tree, n, m, depth) \ 18047c478bd9Sstevel@tonic-gate (tree[n].Freq < tree[m].Freq || \ 18057c478bd9Sstevel@tonic-gate (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) 18067c478bd9Sstevel@tonic-gate 18077c478bd9Sstevel@tonic-gate /* =========================================================================== 18087c478bd9Sstevel@tonic-gate * Restore the heap property by moving down the tree starting at node k, 18097c478bd9Sstevel@tonic-gate * exchanging a node with the smallest of its two sons if necessary, stopping 18107c478bd9Sstevel@tonic-gate * when the heap property is re-established (each father smaller than its 18117c478bd9Sstevel@tonic-gate * two sons). 18127c478bd9Sstevel@tonic-gate */ 18137c478bd9Sstevel@tonic-gate local void pqdownheap(s, tree, k) 18147c478bd9Sstevel@tonic-gate deflate_state *s; 18157c478bd9Sstevel@tonic-gate ct_data *tree; /* the tree to restore */ 18167c478bd9Sstevel@tonic-gate int k; /* node to move down */ 18177c478bd9Sstevel@tonic-gate { 18187c478bd9Sstevel@tonic-gate int v = s->heap[k]; 18197c478bd9Sstevel@tonic-gate int j = k << 1; /* left son of k */ 18207c478bd9Sstevel@tonic-gate while (j <= s->heap_len) { 18217c478bd9Sstevel@tonic-gate /* Set j to the smallest of the two sons: */ 18227c478bd9Sstevel@tonic-gate if (j < s->heap_len && 18237c478bd9Sstevel@tonic-gate smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 18247c478bd9Sstevel@tonic-gate j++; 18257c478bd9Sstevel@tonic-gate } 18267c478bd9Sstevel@tonic-gate /* Exit if v is smaller than both sons */ 18277c478bd9Sstevel@tonic-gate if (smaller(tree, v, s->heap[j], s->depth)) break; 18287c478bd9Sstevel@tonic-gate 18297c478bd9Sstevel@tonic-gate /* Exchange v with the smallest son */ 18307c478bd9Sstevel@tonic-gate s->heap[k] = s->heap[j]; k = j; 18317c478bd9Sstevel@tonic-gate 18327c478bd9Sstevel@tonic-gate /* And continue down the tree, setting j to the left son of k */ 18337c478bd9Sstevel@tonic-gate j <<= 1; 18347c478bd9Sstevel@tonic-gate } 18357c478bd9Sstevel@tonic-gate s->heap[k] = v; 18367c478bd9Sstevel@tonic-gate } 18377c478bd9Sstevel@tonic-gate 18387c478bd9Sstevel@tonic-gate /* =========================================================================== 18397c478bd9Sstevel@tonic-gate * Compute the optimal bit lengths for a tree and update the total bit length 18407c478bd9Sstevel@tonic-gate * for the current block. 18417c478bd9Sstevel@tonic-gate * IN assertion: the fields freq and dad are set, heap[heap_max] and 18427c478bd9Sstevel@tonic-gate * above are the tree nodes sorted by increasing frequency. 18437c478bd9Sstevel@tonic-gate * OUT assertions: the field len is set to the optimal bit length, the 18447c478bd9Sstevel@tonic-gate * array bl_count contains the frequencies for each bit length. 18457c478bd9Sstevel@tonic-gate * The length opt_len is updated; static_len is also updated if stree is 18467c478bd9Sstevel@tonic-gate * not null. 18477c478bd9Sstevel@tonic-gate */ 18487c478bd9Sstevel@tonic-gate local void gen_bitlen(s, desc) 18497c478bd9Sstevel@tonic-gate deflate_state *s; 18507c478bd9Sstevel@tonic-gate tree_desc *desc; /* the tree descriptor */ 18517c478bd9Sstevel@tonic-gate { 18527c478bd9Sstevel@tonic-gate ct_data *tree = desc->dyn_tree; 18537c478bd9Sstevel@tonic-gate int max_code = desc->max_code; 18547c478bd9Sstevel@tonic-gate ct_data *stree = desc->stat_desc->static_tree; 18557c478bd9Sstevel@tonic-gate intf *extra = desc->stat_desc->extra_bits; 18567c478bd9Sstevel@tonic-gate int base = desc->stat_desc->extra_base; 18577c478bd9Sstevel@tonic-gate int max_length = desc->stat_desc->max_length; 18587c478bd9Sstevel@tonic-gate int h; /* heap index */ 18597c478bd9Sstevel@tonic-gate int n, m; /* iterate over the tree elements */ 18607c478bd9Sstevel@tonic-gate int bits; /* bit length */ 18617c478bd9Sstevel@tonic-gate int xbits; /* extra bits */ 18627c478bd9Sstevel@tonic-gate ush f; /* frequency */ 18637c478bd9Sstevel@tonic-gate int overflow = 0; /* number of elements with bit length too large */ 18647c478bd9Sstevel@tonic-gate 18657c478bd9Sstevel@tonic-gate for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; 18667c478bd9Sstevel@tonic-gate 18677c478bd9Sstevel@tonic-gate /* In a first pass, compute the optimal bit lengths (which may 18687c478bd9Sstevel@tonic-gate * overflow in the case of the bit length tree). 18697c478bd9Sstevel@tonic-gate */ 18707c478bd9Sstevel@tonic-gate tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ 18717c478bd9Sstevel@tonic-gate 18727c478bd9Sstevel@tonic-gate for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 18737c478bd9Sstevel@tonic-gate n = s->heap[h]; 18747c478bd9Sstevel@tonic-gate bits = tree[tree[n].Dad].Len + 1; 18757c478bd9Sstevel@tonic-gate if (bits > max_length) bits = max_length, overflow++; 18767c478bd9Sstevel@tonic-gate tree[n].Len = (ush)bits; 18777c478bd9Sstevel@tonic-gate /* We overwrite tree[n].Dad which is no longer needed */ 18787c478bd9Sstevel@tonic-gate 18797c478bd9Sstevel@tonic-gate if (n > max_code) continue; /* not a leaf node */ 18807c478bd9Sstevel@tonic-gate 18817c478bd9Sstevel@tonic-gate s->bl_count[bits]++; 18827c478bd9Sstevel@tonic-gate xbits = 0; 18837c478bd9Sstevel@tonic-gate if (n >= base) xbits = extra[n-base]; 18847c478bd9Sstevel@tonic-gate f = tree[n].Freq; 18857c478bd9Sstevel@tonic-gate s->opt_len += (ulg)f * (bits + xbits); 18867c478bd9Sstevel@tonic-gate if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); 18877c478bd9Sstevel@tonic-gate } 18887c478bd9Sstevel@tonic-gate if (overflow == 0) return; 18897c478bd9Sstevel@tonic-gate 18907c478bd9Sstevel@tonic-gate Trace((stderr,"\nbit length overflow\n")); 18917c478bd9Sstevel@tonic-gate /* This happens for example on obj2 and pic of the Calgary corpus */ 18927c478bd9Sstevel@tonic-gate 18937c478bd9Sstevel@tonic-gate /* Find the first bit length which could increase: */ 18947c478bd9Sstevel@tonic-gate do { 18957c478bd9Sstevel@tonic-gate bits = max_length-1; 18967c478bd9Sstevel@tonic-gate while (s->bl_count[bits] == 0) bits--; 18977c478bd9Sstevel@tonic-gate s->bl_count[bits]--; /* move one leaf down the tree */ 18987c478bd9Sstevel@tonic-gate s->bl_count[bits+1] += 2; /* move one overflow item as its brother */ 18997c478bd9Sstevel@tonic-gate s->bl_count[max_length]--; 19007c478bd9Sstevel@tonic-gate /* The brother of the overflow item also moves one step up, 19017c478bd9Sstevel@tonic-gate * but this does not affect bl_count[max_length] 19027c478bd9Sstevel@tonic-gate */ 19037c478bd9Sstevel@tonic-gate overflow -= 2; 19047c478bd9Sstevel@tonic-gate } while (overflow > 0); 19057c478bd9Sstevel@tonic-gate 19067c478bd9Sstevel@tonic-gate /* Now recompute all bit lengths, scanning in increasing frequency. 19077c478bd9Sstevel@tonic-gate * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 19087c478bd9Sstevel@tonic-gate * lengths instead of fixing only the wrong ones. This idea is taken 19097c478bd9Sstevel@tonic-gate * from 'ar' written by Haruhiko Okumura.) 19107c478bd9Sstevel@tonic-gate */ 19117c478bd9Sstevel@tonic-gate for (bits = max_length; bits != 0; bits--) { 19127c478bd9Sstevel@tonic-gate n = s->bl_count[bits]; 19137c478bd9Sstevel@tonic-gate while (n != 0) { 19147c478bd9Sstevel@tonic-gate m = s->heap[--h]; 19157c478bd9Sstevel@tonic-gate if (m > max_code) continue; 19167c478bd9Sstevel@tonic-gate if (tree[m].Len != (unsigned) bits) { 19177c478bd9Sstevel@tonic-gate Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); 19187c478bd9Sstevel@tonic-gate s->opt_len += ((long)bits - (long)tree[m].Len) 19197c478bd9Sstevel@tonic-gate *(long)tree[m].Freq; 19207c478bd9Sstevel@tonic-gate tree[m].Len = (ush)bits; 19217c478bd9Sstevel@tonic-gate } 19227c478bd9Sstevel@tonic-gate n--; 19237c478bd9Sstevel@tonic-gate } 19247c478bd9Sstevel@tonic-gate } 19257c478bd9Sstevel@tonic-gate } 19267c478bd9Sstevel@tonic-gate 19277c478bd9Sstevel@tonic-gate /* =========================================================================== 19287c478bd9Sstevel@tonic-gate * Generate the codes for a given tree and bit counts (which need not be 19297c478bd9Sstevel@tonic-gate * optimal). 19307c478bd9Sstevel@tonic-gate * IN assertion: the array bl_count contains the bit length statistics for 19317c478bd9Sstevel@tonic-gate * the given tree and the field len is set for all tree elements. 19327c478bd9Sstevel@tonic-gate * OUT assertion: the field code is set for all tree elements of non 19337c478bd9Sstevel@tonic-gate * zero code length. 19347c478bd9Sstevel@tonic-gate */ 19357c478bd9Sstevel@tonic-gate local void gen_codes (tree, max_code, bl_count) 19367c478bd9Sstevel@tonic-gate ct_data *tree; /* the tree to decorate */ 19377c478bd9Sstevel@tonic-gate int max_code; /* largest code with non zero frequency */ 19387c478bd9Sstevel@tonic-gate ushf *bl_count; /* number of codes at each bit length */ 19397c478bd9Sstevel@tonic-gate { 19407c478bd9Sstevel@tonic-gate ush next_code[MAX_BITS+1]; /* next code value for each bit length */ 19417c478bd9Sstevel@tonic-gate ush code = 0; /* running code value */ 19427c478bd9Sstevel@tonic-gate int bits; /* bit index */ 19437c478bd9Sstevel@tonic-gate int n; /* code index */ 19447c478bd9Sstevel@tonic-gate 19457c478bd9Sstevel@tonic-gate /* The distribution counts are first used to generate the code values 19467c478bd9Sstevel@tonic-gate * without bit reversal. 19477c478bd9Sstevel@tonic-gate */ 19487c478bd9Sstevel@tonic-gate for (bits = 1; bits <= MAX_BITS; bits++) { 19497c478bd9Sstevel@tonic-gate next_code[bits] = code = (code + bl_count[bits-1]) << 1; 19507c478bd9Sstevel@tonic-gate } 19517c478bd9Sstevel@tonic-gate /* Check that the bit counts in bl_count are consistent. The last code 19527c478bd9Sstevel@tonic-gate * must be all ones. 19537c478bd9Sstevel@tonic-gate */ 19547c478bd9Sstevel@tonic-gate Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1, 19557c478bd9Sstevel@tonic-gate "inconsistent bit counts"); 19567c478bd9Sstevel@tonic-gate Tracev((stderr,"\ngen_codes: max_code %d ", max_code)); 19577c478bd9Sstevel@tonic-gate 19587c478bd9Sstevel@tonic-gate for (n = 0; n <= max_code; n++) { 19597c478bd9Sstevel@tonic-gate int len = tree[n].Len; 19607c478bd9Sstevel@tonic-gate if (len == 0) continue; 19617c478bd9Sstevel@tonic-gate /* Now reverse the bits */ 19627c478bd9Sstevel@tonic-gate tree[n].Code = bi_reverse(next_code[len]++, len); 19637c478bd9Sstevel@tonic-gate 19647c478bd9Sstevel@tonic-gate Tracec(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ", 19657c478bd9Sstevel@tonic-gate n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); 19667c478bd9Sstevel@tonic-gate } 19677c478bd9Sstevel@tonic-gate } 19687c478bd9Sstevel@tonic-gate 19697c478bd9Sstevel@tonic-gate /* =========================================================================== 19707c478bd9Sstevel@tonic-gate * Construct one Huffman tree and assigns the code bit strings and lengths. 19717c478bd9Sstevel@tonic-gate * Update the total bit length for the current block. 19727c478bd9Sstevel@tonic-gate * IN assertion: the field freq is set for all tree elements. 19737c478bd9Sstevel@tonic-gate * OUT assertions: the fields len and code are set to the optimal bit length 19747c478bd9Sstevel@tonic-gate * and corresponding code. The length opt_len is updated; static_len is 19757c478bd9Sstevel@tonic-gate * also updated if stree is not null. The field max_code is set. 19767c478bd9Sstevel@tonic-gate */ 19777c478bd9Sstevel@tonic-gate local void build_tree(s, desc) 19787c478bd9Sstevel@tonic-gate deflate_state *s; 19797c478bd9Sstevel@tonic-gate tree_desc *desc; /* the tree descriptor */ 19807c478bd9Sstevel@tonic-gate { 19817c478bd9Sstevel@tonic-gate ct_data *tree = desc->dyn_tree; 19827c478bd9Sstevel@tonic-gate ct_data *stree = desc->stat_desc->static_tree; 19837c478bd9Sstevel@tonic-gate int elems = desc->stat_desc->elems; 19847c478bd9Sstevel@tonic-gate int n, m; /* iterate over heap elements */ 19857c478bd9Sstevel@tonic-gate int max_code = -1; /* largest code with non zero frequency */ 19867c478bd9Sstevel@tonic-gate int node; /* new node being created */ 19877c478bd9Sstevel@tonic-gate 19887c478bd9Sstevel@tonic-gate /* Construct the initial heap, with least frequent element in 19897c478bd9Sstevel@tonic-gate * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. 19907c478bd9Sstevel@tonic-gate * heap[0] is not used. 19917c478bd9Sstevel@tonic-gate */ 19927c478bd9Sstevel@tonic-gate s->heap_len = 0, s->heap_max = HEAP_SIZE; 19937c478bd9Sstevel@tonic-gate 19947c478bd9Sstevel@tonic-gate for (n = 0; n < elems; n++) { 19957c478bd9Sstevel@tonic-gate if (tree[n].Freq != 0) { 19967c478bd9Sstevel@tonic-gate s->heap[++(s->heap_len)] = max_code = n; 19977c478bd9Sstevel@tonic-gate s->depth[n] = 0; 19987c478bd9Sstevel@tonic-gate } else { 19997c478bd9Sstevel@tonic-gate tree[n].Len = 0; 20007c478bd9Sstevel@tonic-gate } 20017c478bd9Sstevel@tonic-gate } 20027c478bd9Sstevel@tonic-gate 20037c478bd9Sstevel@tonic-gate /* The pkzip format requires that at least one distance code exists, 20047c478bd9Sstevel@tonic-gate * and that at least one bit should be sent even if there is only one 20057c478bd9Sstevel@tonic-gate * possible code. So to avoid special checks later on we force at least 20067c478bd9Sstevel@tonic-gate * two codes of non zero frequency. 20077c478bd9Sstevel@tonic-gate */ 20087c478bd9Sstevel@tonic-gate while (s->heap_len < 2) { 20097c478bd9Sstevel@tonic-gate node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 20107c478bd9Sstevel@tonic-gate tree[node].Freq = 1; 20117c478bd9Sstevel@tonic-gate s->depth[node] = 0; 20127c478bd9Sstevel@tonic-gate s->opt_len--; if (stree) s->static_len -= stree[node].Len; 20137c478bd9Sstevel@tonic-gate /* node is 0 or 1 so it does not have extra bits */ 20147c478bd9Sstevel@tonic-gate } 20157c478bd9Sstevel@tonic-gate desc->max_code = max_code; 20167c478bd9Sstevel@tonic-gate 20177c478bd9Sstevel@tonic-gate /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, 20187c478bd9Sstevel@tonic-gate * establish sub-heaps of increasing lengths: 20197c478bd9Sstevel@tonic-gate */ 20207c478bd9Sstevel@tonic-gate for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n); 20217c478bd9Sstevel@tonic-gate 20227c478bd9Sstevel@tonic-gate /* Construct the Huffman tree by repeatedly combining the least two 20237c478bd9Sstevel@tonic-gate * frequent nodes. 20247c478bd9Sstevel@tonic-gate */ 20257c478bd9Sstevel@tonic-gate node = elems; /* next internal node of the tree */ 20267c478bd9Sstevel@tonic-gate do { 20277c478bd9Sstevel@tonic-gate pqremove(s, tree, n); /* n = node of least frequency */ 20287c478bd9Sstevel@tonic-gate m = s->heap[SMALLEST]; /* m = node of next least frequency */ 20297c478bd9Sstevel@tonic-gate 20307c478bd9Sstevel@tonic-gate s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ 20317c478bd9Sstevel@tonic-gate s->heap[--(s->heap_max)] = m; 20327c478bd9Sstevel@tonic-gate 20337c478bd9Sstevel@tonic-gate /* Create a new node father of n and m */ 20347c478bd9Sstevel@tonic-gate tree[node].Freq = tree[n].Freq + tree[m].Freq; 20357c478bd9Sstevel@tonic-gate s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1); 20367c478bd9Sstevel@tonic-gate tree[n].Dad = tree[m].Dad = (ush)node; 20377c478bd9Sstevel@tonic-gate #ifdef DUMP_BL_TREE 20387c478bd9Sstevel@tonic-gate if (tree == s->bl_tree) { 20397c478bd9Sstevel@tonic-gate fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)", 20407c478bd9Sstevel@tonic-gate node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); 20417c478bd9Sstevel@tonic-gate } 20427c478bd9Sstevel@tonic-gate #endif 20437c478bd9Sstevel@tonic-gate /* and insert the new node in the heap */ 20447c478bd9Sstevel@tonic-gate s->heap[SMALLEST] = node++; 20457c478bd9Sstevel@tonic-gate pqdownheap(s, tree, SMALLEST); 20467c478bd9Sstevel@tonic-gate 20477c478bd9Sstevel@tonic-gate } while (s->heap_len >= 2); 20487c478bd9Sstevel@tonic-gate 20497c478bd9Sstevel@tonic-gate s->heap[--(s->heap_max)] = s->heap[SMALLEST]; 20507c478bd9Sstevel@tonic-gate 20517c478bd9Sstevel@tonic-gate /* At this point, the fields freq and dad are set. We can now 20527c478bd9Sstevel@tonic-gate * generate the bit lengths. 20537c478bd9Sstevel@tonic-gate */ 20547c478bd9Sstevel@tonic-gate gen_bitlen(s, (tree_desc *)desc); 20557c478bd9Sstevel@tonic-gate 20567c478bd9Sstevel@tonic-gate /* The field len is now set, we can generate the bit codes */ 20577c478bd9Sstevel@tonic-gate gen_codes ((ct_data *)tree, max_code, s->bl_count); 20587c478bd9Sstevel@tonic-gate } 20597c478bd9Sstevel@tonic-gate 20607c478bd9Sstevel@tonic-gate /* =========================================================================== 20617c478bd9Sstevel@tonic-gate * Scan a literal or distance tree to determine the frequencies of the codes 20627c478bd9Sstevel@tonic-gate * in the bit length tree. 20637c478bd9Sstevel@tonic-gate */ 20647c478bd9Sstevel@tonic-gate local void scan_tree (s, tree, max_code) 20657c478bd9Sstevel@tonic-gate deflate_state *s; 20667c478bd9Sstevel@tonic-gate ct_data *tree; /* the tree to be scanned */ 20677c478bd9Sstevel@tonic-gate int max_code; /* and its largest code of non zero frequency */ 20687c478bd9Sstevel@tonic-gate { 20697c478bd9Sstevel@tonic-gate int n; /* iterates over all tree elements */ 20707c478bd9Sstevel@tonic-gate int prevlen = -1; /* last emitted length */ 20717c478bd9Sstevel@tonic-gate int curlen; /* length of current code */ 20727c478bd9Sstevel@tonic-gate int nextlen = tree[0].Len; /* length of next code */ 20737c478bd9Sstevel@tonic-gate int count = 0; /* repeat count of the current code */ 20747c478bd9Sstevel@tonic-gate int max_count = 7; /* max repeat count */ 20757c478bd9Sstevel@tonic-gate int min_count = 4; /* min repeat count */ 20767c478bd9Sstevel@tonic-gate 20777c478bd9Sstevel@tonic-gate if (nextlen == 0) max_count = 138, min_count = 3; 20787c478bd9Sstevel@tonic-gate tree[max_code+1].Len = (ush)0xffff; /* guard */ 20797c478bd9Sstevel@tonic-gate 20807c478bd9Sstevel@tonic-gate for (n = 0; n <= max_code; n++) { 20817c478bd9Sstevel@tonic-gate curlen = nextlen; nextlen = tree[n+1].Len; 20827c478bd9Sstevel@tonic-gate if (++count < max_count && curlen == nextlen) { 20837c478bd9Sstevel@tonic-gate continue; 20847c478bd9Sstevel@tonic-gate } else if (count < min_count) { 20857c478bd9Sstevel@tonic-gate s->bl_tree[curlen].Freq += count; 20867c478bd9Sstevel@tonic-gate } else if (curlen != 0) { 20877c478bd9Sstevel@tonic-gate if (curlen != prevlen) s->bl_tree[curlen].Freq++; 20887c478bd9Sstevel@tonic-gate s->bl_tree[REP_3_6].Freq++; 20897c478bd9Sstevel@tonic-gate } else if (count <= 10) { 20907c478bd9Sstevel@tonic-gate s->bl_tree[REPZ_3_10].Freq++; 20917c478bd9Sstevel@tonic-gate } else { 20927c478bd9Sstevel@tonic-gate s->bl_tree[REPZ_11_138].Freq++; 20937c478bd9Sstevel@tonic-gate } 20947c478bd9Sstevel@tonic-gate count = 0; prevlen = curlen; 20957c478bd9Sstevel@tonic-gate if (nextlen == 0) { 20967c478bd9Sstevel@tonic-gate max_count = 138, min_count = 3; 20977c478bd9Sstevel@tonic-gate } else if (curlen == nextlen) { 20987c478bd9Sstevel@tonic-gate max_count = 6, min_count = 3; 20997c478bd9Sstevel@tonic-gate } else { 21007c478bd9Sstevel@tonic-gate max_count = 7, min_count = 4; 21017c478bd9Sstevel@tonic-gate } 21027c478bd9Sstevel@tonic-gate } 21037c478bd9Sstevel@tonic-gate } 21047c478bd9Sstevel@tonic-gate 21057c478bd9Sstevel@tonic-gate /* =========================================================================== 21067c478bd9Sstevel@tonic-gate * Send a literal or distance tree in compressed form, using the codes in 21077c478bd9Sstevel@tonic-gate * bl_tree. 21087c478bd9Sstevel@tonic-gate */ 21097c478bd9Sstevel@tonic-gate local void send_tree (s, tree, max_code) 21107c478bd9Sstevel@tonic-gate deflate_state *s; 21117c478bd9Sstevel@tonic-gate ct_data *tree; /* the tree to be scanned */ 21127c478bd9Sstevel@tonic-gate int max_code; /* and its largest code of non zero frequency */ 21137c478bd9Sstevel@tonic-gate { 21147c478bd9Sstevel@tonic-gate int n; /* iterates over all tree elements */ 21157c478bd9Sstevel@tonic-gate int prevlen = -1; /* last emitted length */ 21167c478bd9Sstevel@tonic-gate int curlen; /* length of current code */ 21177c478bd9Sstevel@tonic-gate int nextlen = tree[0].Len; /* length of next code */ 21187c478bd9Sstevel@tonic-gate int count = 0; /* repeat count of the current code */ 21197c478bd9Sstevel@tonic-gate int max_count = 7; /* max repeat count */ 21207c478bd9Sstevel@tonic-gate int min_count = 4; /* min repeat count */ 21217c478bd9Sstevel@tonic-gate 21227c478bd9Sstevel@tonic-gate /* tree[max_code+1].Len = -1; */ /* guard already set */ 21237c478bd9Sstevel@tonic-gate if (nextlen == 0) max_count = 138, min_count = 3; 21247c478bd9Sstevel@tonic-gate 21257c478bd9Sstevel@tonic-gate for (n = 0; n <= max_code; n++) { 21267c478bd9Sstevel@tonic-gate curlen = nextlen; nextlen = tree[n+1].Len; 21277c478bd9Sstevel@tonic-gate if (++count < max_count && curlen == nextlen) { 21287c478bd9Sstevel@tonic-gate continue; 21297c478bd9Sstevel@tonic-gate } else if (count < min_count) { 21307c478bd9Sstevel@tonic-gate do { send_code(s, curlen, s->bl_tree); } while (--count != 0); 21317c478bd9Sstevel@tonic-gate 21327c478bd9Sstevel@tonic-gate } else if (curlen != 0) { 21337c478bd9Sstevel@tonic-gate if (curlen != prevlen) { 21347c478bd9Sstevel@tonic-gate send_code(s, curlen, s->bl_tree); count--; 21357c478bd9Sstevel@tonic-gate } 21367c478bd9Sstevel@tonic-gate Assert(count >= 3 && count <= 6, " 3_6?"); 21377c478bd9Sstevel@tonic-gate send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2); 21387c478bd9Sstevel@tonic-gate 21397c478bd9Sstevel@tonic-gate } else if (count <= 10) { 21407c478bd9Sstevel@tonic-gate send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3); 21417c478bd9Sstevel@tonic-gate 21427c478bd9Sstevel@tonic-gate } else { 21437c478bd9Sstevel@tonic-gate send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7); 21447c478bd9Sstevel@tonic-gate } 21457c478bd9Sstevel@tonic-gate count = 0; prevlen = curlen; 21467c478bd9Sstevel@tonic-gate if (nextlen == 0) { 21477c478bd9Sstevel@tonic-gate max_count = 138, min_count = 3; 21487c478bd9Sstevel@tonic-gate } else if (curlen == nextlen) { 21497c478bd9Sstevel@tonic-gate max_count = 6, min_count = 3; 21507c478bd9Sstevel@tonic-gate } else { 21517c478bd9Sstevel@tonic-gate max_count = 7, min_count = 4; 21527c478bd9Sstevel@tonic-gate } 21537c478bd9Sstevel@tonic-gate } 21547c478bd9Sstevel@tonic-gate } 21557c478bd9Sstevel@tonic-gate 21567c478bd9Sstevel@tonic-gate /* =========================================================================== 21577c478bd9Sstevel@tonic-gate * Construct the Huffman tree for the bit lengths and return the index in 21587c478bd9Sstevel@tonic-gate * bl_order of the last bit length code to send. 21597c478bd9Sstevel@tonic-gate */ 21607c478bd9Sstevel@tonic-gate local int build_bl_tree(s) 21617c478bd9Sstevel@tonic-gate deflate_state *s; 21627c478bd9Sstevel@tonic-gate { 21637c478bd9Sstevel@tonic-gate int max_blindex; /* index of last bit length code of non zero freq */ 21647c478bd9Sstevel@tonic-gate 21657c478bd9Sstevel@tonic-gate /* Determine the bit length frequencies for literal and distance trees */ 21667c478bd9Sstevel@tonic-gate scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 21677c478bd9Sstevel@tonic-gate scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 21687c478bd9Sstevel@tonic-gate 21697c478bd9Sstevel@tonic-gate /* Build the bit length tree: */ 21707c478bd9Sstevel@tonic-gate build_tree(s, (tree_desc *)(&(s->bl_desc))); 21717c478bd9Sstevel@tonic-gate /* opt_len now includes the length of the tree representations, except 21727c478bd9Sstevel@tonic-gate * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. 21737c478bd9Sstevel@tonic-gate */ 21747c478bd9Sstevel@tonic-gate 21757c478bd9Sstevel@tonic-gate /* Determine the number of bit length codes to send. The pkzip format 21767c478bd9Sstevel@tonic-gate * requires that at least 4 bit length codes be sent. (appnote.txt says 21777c478bd9Sstevel@tonic-gate * 3 but the actual value used is 4.) 21787c478bd9Sstevel@tonic-gate */ 21797c478bd9Sstevel@tonic-gate for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 21807c478bd9Sstevel@tonic-gate if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; 21817c478bd9Sstevel@tonic-gate } 21827c478bd9Sstevel@tonic-gate /* Update opt_len to include the bit length tree and counts */ 21837c478bd9Sstevel@tonic-gate s->opt_len += 3*(max_blindex+1) + 5+5+4; 21847c478bd9Sstevel@tonic-gate Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", 21857c478bd9Sstevel@tonic-gate s->opt_len, s->static_len)); 21867c478bd9Sstevel@tonic-gate 21877c478bd9Sstevel@tonic-gate return max_blindex; 21887c478bd9Sstevel@tonic-gate } 21897c478bd9Sstevel@tonic-gate 21907c478bd9Sstevel@tonic-gate /* =========================================================================== 21917c478bd9Sstevel@tonic-gate * Send the header for a block using dynamic Huffman trees: the counts, the 21927c478bd9Sstevel@tonic-gate * lengths of the bit length codes, the literal tree and the distance tree. 21937c478bd9Sstevel@tonic-gate * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. 21947c478bd9Sstevel@tonic-gate */ 21957c478bd9Sstevel@tonic-gate local void send_all_trees(s, lcodes, dcodes, blcodes) 21967c478bd9Sstevel@tonic-gate deflate_state *s; 21977c478bd9Sstevel@tonic-gate int lcodes, dcodes, blcodes; /* number of codes for each tree */ 21987c478bd9Sstevel@tonic-gate { 21997c478bd9Sstevel@tonic-gate int rank; /* index in bl_order */ 22007c478bd9Sstevel@tonic-gate 22017c478bd9Sstevel@tonic-gate Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); 22027c478bd9Sstevel@tonic-gate Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, 22037c478bd9Sstevel@tonic-gate "too many codes"); 22047c478bd9Sstevel@tonic-gate Tracev((stderr, "\nbl counts: ")); 22057c478bd9Sstevel@tonic-gate send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */ 22067c478bd9Sstevel@tonic-gate send_bits(s, dcodes-1, 5); 22077c478bd9Sstevel@tonic-gate send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */ 22087c478bd9Sstevel@tonic-gate for (rank = 0; rank < blcodes; rank++) { 22097c478bd9Sstevel@tonic-gate Tracev((stderr, "\nbl code %2d ", bl_order[rank])); 22107c478bd9Sstevel@tonic-gate send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); 22117c478bd9Sstevel@tonic-gate } 22127c478bd9Sstevel@tonic-gate Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); 22137c478bd9Sstevel@tonic-gate 22147c478bd9Sstevel@tonic-gate send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ 22157c478bd9Sstevel@tonic-gate Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); 22167c478bd9Sstevel@tonic-gate 22177c478bd9Sstevel@tonic-gate send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 22187c478bd9Sstevel@tonic-gate Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); 22197c478bd9Sstevel@tonic-gate } 22207c478bd9Sstevel@tonic-gate 22217c478bd9Sstevel@tonic-gate /* =========================================================================== 22227c478bd9Sstevel@tonic-gate * Send a stored block 22237c478bd9Sstevel@tonic-gate */ 22247c478bd9Sstevel@tonic-gate local void ct_stored_block(s, buf, stored_len, eof) 22257c478bd9Sstevel@tonic-gate deflate_state *s; 22267c478bd9Sstevel@tonic-gate charf *buf; /* input block */ 22277c478bd9Sstevel@tonic-gate ulg stored_len; /* length of input block */ 22287c478bd9Sstevel@tonic-gate int eof; /* true if this is the last block for a file */ 22297c478bd9Sstevel@tonic-gate { 22307c478bd9Sstevel@tonic-gate send_bits(s, (STORED_BLOCK<<1)+eof, 3); /* send block type */ 22317c478bd9Sstevel@tonic-gate s->compressed_len = (s->compressed_len + 3 + 7) & ~7L; 22327c478bd9Sstevel@tonic-gate s->compressed_len += (stored_len + 4) << 3; 22337c478bd9Sstevel@tonic-gate 22347c478bd9Sstevel@tonic-gate copy_block(s, buf, (unsigned)stored_len, 1); /* with header */ 22357c478bd9Sstevel@tonic-gate } 22367c478bd9Sstevel@tonic-gate 22377c478bd9Sstevel@tonic-gate /* Send just the `stored block' type code without any length bytes or data. 22387c478bd9Sstevel@tonic-gate */ 22397c478bd9Sstevel@tonic-gate local void ct_stored_type_only(s) 22407c478bd9Sstevel@tonic-gate deflate_state *s; 22417c478bd9Sstevel@tonic-gate { 22427c478bd9Sstevel@tonic-gate send_bits(s, (STORED_BLOCK << 1), 3); 22437c478bd9Sstevel@tonic-gate bi_windup(s); 22447c478bd9Sstevel@tonic-gate s->compressed_len = (s->compressed_len + 3) & ~7L; 22457c478bd9Sstevel@tonic-gate } 22467c478bd9Sstevel@tonic-gate 22477c478bd9Sstevel@tonic-gate 22487c478bd9Sstevel@tonic-gate /* =========================================================================== 22497c478bd9Sstevel@tonic-gate * Send one empty static block to give enough lookahead for inflate. 22507c478bd9Sstevel@tonic-gate * This takes 10 bits, of which 7 may remain in the bit buffer. 22517c478bd9Sstevel@tonic-gate * The current inflate code requires 9 bits of lookahead. If the EOB 22527c478bd9Sstevel@tonic-gate * code for the previous block was coded on 5 bits or less, inflate 22537c478bd9Sstevel@tonic-gate * may have only 5+3 bits of lookahead to decode this EOB. 22547c478bd9Sstevel@tonic-gate * (There are no problems if the previous block is stored or fixed.) 22557c478bd9Sstevel@tonic-gate */ 22567c478bd9Sstevel@tonic-gate local void ct_align(s) 22577c478bd9Sstevel@tonic-gate deflate_state *s; 22587c478bd9Sstevel@tonic-gate { 22597c478bd9Sstevel@tonic-gate send_bits(s, STATIC_TREES<<1, 3); 22607c478bd9Sstevel@tonic-gate send_code(s, END_BLOCK, static_ltree); 22617c478bd9Sstevel@tonic-gate s->compressed_len += 10L; /* 3 for block type, 7 for EOB */ 22627c478bd9Sstevel@tonic-gate bi_flush(s); 22637c478bd9Sstevel@tonic-gate /* Of the 10 bits for the empty block, we have already sent 22647c478bd9Sstevel@tonic-gate * (10 - bi_valid) bits. The lookahead for the EOB of the previous 22657c478bd9Sstevel@tonic-gate * block was thus its length plus what we have just sent. 22667c478bd9Sstevel@tonic-gate */ 22677c478bd9Sstevel@tonic-gate if (s->last_eob_len + 10 - s->bi_valid < 9) { 22687c478bd9Sstevel@tonic-gate send_bits(s, STATIC_TREES<<1, 3); 22697c478bd9Sstevel@tonic-gate send_code(s, END_BLOCK, static_ltree); 22707c478bd9Sstevel@tonic-gate s->compressed_len += 10L; 22717c478bd9Sstevel@tonic-gate bi_flush(s); 22727c478bd9Sstevel@tonic-gate } 22737c478bd9Sstevel@tonic-gate s->last_eob_len = 7; 22747c478bd9Sstevel@tonic-gate } 22757c478bd9Sstevel@tonic-gate 22767c478bd9Sstevel@tonic-gate /* =========================================================================== 22777c478bd9Sstevel@tonic-gate * Determine the best encoding for the current block: dynamic trees, static 22787c478bd9Sstevel@tonic-gate * trees or store, and output the encoded block to the zip file. This function 22797c478bd9Sstevel@tonic-gate * returns the total compressed length for the file so far. 22807c478bd9Sstevel@tonic-gate */ 22817c478bd9Sstevel@tonic-gate local ulg ct_flush_block(s, buf, stored_len, flush) 22827c478bd9Sstevel@tonic-gate deflate_state *s; 22837c478bd9Sstevel@tonic-gate charf *buf; /* input block, or NULL if too old */ 22847c478bd9Sstevel@tonic-gate ulg stored_len; /* length of input block */ 22857c478bd9Sstevel@tonic-gate int flush; /* Z_FINISH if this is the last block for a file */ 22867c478bd9Sstevel@tonic-gate { 22877c478bd9Sstevel@tonic-gate ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */ 22887c478bd9Sstevel@tonic-gate int max_blindex; /* index of last bit length code of non zero freq */ 22897c478bd9Sstevel@tonic-gate int eof = flush == Z_FINISH; 22907c478bd9Sstevel@tonic-gate 22917c478bd9Sstevel@tonic-gate ++s->blocks_in_packet; 22927c478bd9Sstevel@tonic-gate 22937c478bd9Sstevel@tonic-gate /* Check if the file is ascii or binary */ 22947c478bd9Sstevel@tonic-gate if (s->data_type == UNKNOWN) set_data_type(s); 22957c478bd9Sstevel@tonic-gate 22967c478bd9Sstevel@tonic-gate /* Construct the literal and distance trees */ 22977c478bd9Sstevel@tonic-gate build_tree(s, (tree_desc *)(&(s->l_desc))); 22987c478bd9Sstevel@tonic-gate Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, 22997c478bd9Sstevel@tonic-gate s->static_len)); 23007c478bd9Sstevel@tonic-gate 23017c478bd9Sstevel@tonic-gate build_tree(s, (tree_desc *)(&(s->d_desc))); 23027c478bd9Sstevel@tonic-gate Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, 23037c478bd9Sstevel@tonic-gate s->static_len)); 23047c478bd9Sstevel@tonic-gate /* At this point, opt_len and static_len are the total bit lengths of 23057c478bd9Sstevel@tonic-gate * the compressed block data, excluding the tree representations. 23067c478bd9Sstevel@tonic-gate */ 23077c478bd9Sstevel@tonic-gate 23087c478bd9Sstevel@tonic-gate /* Build the bit length tree for the above two trees, and get the index 23097c478bd9Sstevel@tonic-gate * in bl_order of the last bit length code to send. 23107c478bd9Sstevel@tonic-gate */ 23117c478bd9Sstevel@tonic-gate max_blindex = build_bl_tree(s); 23127c478bd9Sstevel@tonic-gate 23137c478bd9Sstevel@tonic-gate /* Determine the best encoding. Compute first the block length in bytes */ 23147c478bd9Sstevel@tonic-gate opt_lenb = (s->opt_len+3+7)>>3; 23157c478bd9Sstevel@tonic-gate static_lenb = (s->static_len+3+7)>>3; 23167c478bd9Sstevel@tonic-gate 23177c478bd9Sstevel@tonic-gate Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", 23187c478bd9Sstevel@tonic-gate opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, 23197c478bd9Sstevel@tonic-gate s->last_lit)); 23207c478bd9Sstevel@tonic-gate 23217c478bd9Sstevel@tonic-gate if (static_lenb <= opt_lenb) opt_lenb = static_lenb; 23227c478bd9Sstevel@tonic-gate 23237c478bd9Sstevel@tonic-gate /* If compression failed and this is the first and last block, 23247c478bd9Sstevel@tonic-gate * and if the .zip file can be seeked (to rewrite the local header), 23257c478bd9Sstevel@tonic-gate * the whole file is transformed into a stored file: 23267c478bd9Sstevel@tonic-gate */ 23277c478bd9Sstevel@tonic-gate #ifdef STORED_FILE_OK 23287c478bd9Sstevel@tonic-gate # ifdef FORCE_STORED_FILE 23297c478bd9Sstevel@tonic-gate if (eof && compressed_len == 0L) /* force stored file */ 23307c478bd9Sstevel@tonic-gate # else 23317c478bd9Sstevel@tonic-gate if (stored_len <= opt_lenb && eof && s->compressed_len==0L && seekable()) 23327c478bd9Sstevel@tonic-gate # endif 23337c478bd9Sstevel@tonic-gate { 23347c478bd9Sstevel@tonic-gate /* Since LIT_BUFSIZE <= 2*WSIZE, the input data must be there: */ 23357c478bd9Sstevel@tonic-gate if (buf == (charf*)0) error ("block vanished"); 23367c478bd9Sstevel@tonic-gate 23377c478bd9Sstevel@tonic-gate copy_block(buf, (unsigned)stored_len, 0); /* without header */ 23387c478bd9Sstevel@tonic-gate s->compressed_len = stored_len << 3; 23397c478bd9Sstevel@tonic-gate s->method = STORED; 23407c478bd9Sstevel@tonic-gate } else 23417c478bd9Sstevel@tonic-gate #endif /* STORED_FILE_OK */ 23427c478bd9Sstevel@tonic-gate 23437c478bd9Sstevel@tonic-gate /* For Z_PACKET_FLUSH, if we don't achieve the required minimum 23447c478bd9Sstevel@tonic-gate * compression, and this block contains all the data since the last 23457c478bd9Sstevel@tonic-gate * time we used Z_PACKET_FLUSH, then just omit this block completely 23467c478bd9Sstevel@tonic-gate * from the output. 23477c478bd9Sstevel@tonic-gate */ 23487c478bd9Sstevel@tonic-gate if (flush == Z_PACKET_FLUSH && s->blocks_in_packet == 1 23497c478bd9Sstevel@tonic-gate && opt_lenb > stored_len - s->minCompr) { 23507c478bd9Sstevel@tonic-gate s->blocks_in_packet = 0; 23517c478bd9Sstevel@tonic-gate /* output nothing */ 23527c478bd9Sstevel@tonic-gate } else 23537c478bd9Sstevel@tonic-gate 23547c478bd9Sstevel@tonic-gate #ifdef FORCE_STORED 23557c478bd9Sstevel@tonic-gate if (buf != (char*)0) /* force stored block */ 23567c478bd9Sstevel@tonic-gate #else 23577c478bd9Sstevel@tonic-gate if (stored_len+4 <= opt_lenb && buf != (char*)0) 23587c478bd9Sstevel@tonic-gate /* 4: two words for the lengths */ 23597c478bd9Sstevel@tonic-gate #endif 23607c478bd9Sstevel@tonic-gate { 23617c478bd9Sstevel@tonic-gate /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. 23627c478bd9Sstevel@tonic-gate * Otherwise we can't have processed more than WSIZE input bytes since 23637c478bd9Sstevel@tonic-gate * the last block flush, because compression would have been 23647c478bd9Sstevel@tonic-gate * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to 23657c478bd9Sstevel@tonic-gate * transform a block into a stored block. 23667c478bd9Sstevel@tonic-gate */ 23677c478bd9Sstevel@tonic-gate ct_stored_block(s, buf, stored_len, eof); 23687c478bd9Sstevel@tonic-gate } else 23697c478bd9Sstevel@tonic-gate 23707c478bd9Sstevel@tonic-gate #ifdef FORCE_STATIC 23717c478bd9Sstevel@tonic-gate if (static_lenb >= 0) /* force static trees */ 23727c478bd9Sstevel@tonic-gate #else 23737c478bd9Sstevel@tonic-gate if (static_lenb == opt_lenb) 23747c478bd9Sstevel@tonic-gate #endif 23757c478bd9Sstevel@tonic-gate { 23767c478bd9Sstevel@tonic-gate send_bits(s, (STATIC_TREES<<1)+eof, 3); 23777c478bd9Sstevel@tonic-gate compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree); 23787c478bd9Sstevel@tonic-gate s->compressed_len += 3 + s->static_len; 23797c478bd9Sstevel@tonic-gate } else { 23807c478bd9Sstevel@tonic-gate send_bits(s, (DYN_TREES<<1)+eof, 3); 23817c478bd9Sstevel@tonic-gate send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1, 23827c478bd9Sstevel@tonic-gate max_blindex+1); 23837c478bd9Sstevel@tonic-gate compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 23847c478bd9Sstevel@tonic-gate s->compressed_len += 3 + s->opt_len; 23857c478bd9Sstevel@tonic-gate } 23867c478bd9Sstevel@tonic-gate Assert (s->compressed_len == s->bits_sent, "bad compressed size"); 23877c478bd9Sstevel@tonic-gate init_block(s); 23887c478bd9Sstevel@tonic-gate 23897c478bd9Sstevel@tonic-gate if (eof) { 23907c478bd9Sstevel@tonic-gate bi_windup(s); 23917c478bd9Sstevel@tonic-gate s->compressed_len += 7; /* align on byte boundary */ 23927c478bd9Sstevel@tonic-gate } 23937c478bd9Sstevel@tonic-gate Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, 23947c478bd9Sstevel@tonic-gate s->compressed_len-7*eof)); 23957c478bd9Sstevel@tonic-gate 23967c478bd9Sstevel@tonic-gate return s->compressed_len >> 3; 23977c478bd9Sstevel@tonic-gate } 23987c478bd9Sstevel@tonic-gate 23997c478bd9Sstevel@tonic-gate /* =========================================================================== 24007c478bd9Sstevel@tonic-gate * Save the match info and tally the frequency counts. Return true if 24017c478bd9Sstevel@tonic-gate * the current block must be flushed. 24027c478bd9Sstevel@tonic-gate */ 24037c478bd9Sstevel@tonic-gate local int ct_tally (s, dist, lc) 24047c478bd9Sstevel@tonic-gate deflate_state *s; 24057c478bd9Sstevel@tonic-gate int dist; /* distance of matched string */ 24067c478bd9Sstevel@tonic-gate int lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 24077c478bd9Sstevel@tonic-gate { 24087c478bd9Sstevel@tonic-gate s->d_buf[s->last_lit] = (ush)dist; 24097c478bd9Sstevel@tonic-gate s->l_buf[s->last_lit++] = (uch)lc; 24107c478bd9Sstevel@tonic-gate if (dist == 0) { 24117c478bd9Sstevel@tonic-gate /* lc is the unmatched char */ 24127c478bd9Sstevel@tonic-gate s->dyn_ltree[lc].Freq++; 24137c478bd9Sstevel@tonic-gate } else { 24147c478bd9Sstevel@tonic-gate s->matches++; 24157c478bd9Sstevel@tonic-gate /* Here, lc is the match length - MIN_MATCH */ 24167c478bd9Sstevel@tonic-gate dist--; /* dist = match distance - 1 */ 24177c478bd9Sstevel@tonic-gate Assert((ush)dist < (ush)MAX_DIST(s) && 24187c478bd9Sstevel@tonic-gate (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 24197c478bd9Sstevel@tonic-gate (ush)d_code(dist) < (ush)D_CODES, "ct_tally: bad match"); 24207c478bd9Sstevel@tonic-gate 24217c478bd9Sstevel@tonic-gate s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++; 24227c478bd9Sstevel@tonic-gate s->dyn_dtree[d_code(dist)].Freq++; 24237c478bd9Sstevel@tonic-gate } 24247c478bd9Sstevel@tonic-gate 24257c478bd9Sstevel@tonic-gate /* Try to guess if it is profitable to stop the current block here */ 24267c478bd9Sstevel@tonic-gate if (s->level > 2 && (s->last_lit & 0xfff) == 0) { 24277c478bd9Sstevel@tonic-gate /* Compute an upper bound for the compressed length */ 24287c478bd9Sstevel@tonic-gate ulg out_length = (ulg)s->last_lit*8L; 24297c478bd9Sstevel@tonic-gate ulg in_length = (ulg)s->strstart - s->block_start; 24307c478bd9Sstevel@tonic-gate int dcode; 24317c478bd9Sstevel@tonic-gate for (dcode = 0; dcode < D_CODES; dcode++) { 24327c478bd9Sstevel@tonic-gate out_length += (ulg)s->dyn_dtree[dcode].Freq * 24337c478bd9Sstevel@tonic-gate (5L+extra_dbits[dcode]); 24347c478bd9Sstevel@tonic-gate } 24357c478bd9Sstevel@tonic-gate out_length >>= 3; 24367c478bd9Sstevel@tonic-gate Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ", 24377c478bd9Sstevel@tonic-gate s->last_lit, in_length, out_length, 24387c478bd9Sstevel@tonic-gate 100L - out_length*100L/in_length)); 24397c478bd9Sstevel@tonic-gate if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1; 24407c478bd9Sstevel@tonic-gate } 24417c478bd9Sstevel@tonic-gate return (s->last_lit == s->lit_bufsize-1); 24427c478bd9Sstevel@tonic-gate /* We avoid equality with lit_bufsize because of wraparound at 64K 24437c478bd9Sstevel@tonic-gate * on 16 bit machines and because stored blocks are restricted to 24447c478bd9Sstevel@tonic-gate * 64K-1 bytes. 24457c478bd9Sstevel@tonic-gate */ 24467c478bd9Sstevel@tonic-gate } 24477c478bd9Sstevel@tonic-gate 24487c478bd9Sstevel@tonic-gate /* =========================================================================== 24497c478bd9Sstevel@tonic-gate * Send the block data compressed using the given Huffman trees 24507c478bd9Sstevel@tonic-gate */ 24517c478bd9Sstevel@tonic-gate local void compress_block(s, ltree, dtree) 24527c478bd9Sstevel@tonic-gate deflate_state *s; 24537c478bd9Sstevel@tonic-gate ct_data *ltree; /* literal tree */ 24547c478bd9Sstevel@tonic-gate ct_data *dtree; /* distance tree */ 24557c478bd9Sstevel@tonic-gate { 24567c478bd9Sstevel@tonic-gate unsigned dist; /* distance of matched string */ 24577c478bd9Sstevel@tonic-gate int lc; /* match length or unmatched char (if dist == 0) */ 24587c478bd9Sstevel@tonic-gate unsigned lx = 0; /* running index in l_buf */ 24597c478bd9Sstevel@tonic-gate unsigned code; /* the code to send */ 24607c478bd9Sstevel@tonic-gate int extra; /* number of extra bits to send */ 24617c478bd9Sstevel@tonic-gate 24627c478bd9Sstevel@tonic-gate if (s->last_lit != 0) do { 24637c478bd9Sstevel@tonic-gate dist = s->d_buf[lx]; 24647c478bd9Sstevel@tonic-gate lc = s->l_buf[lx++]; 24657c478bd9Sstevel@tonic-gate if (dist == 0) { 24667c478bd9Sstevel@tonic-gate send_code(s, lc, ltree); /* send a literal byte */ 24677c478bd9Sstevel@tonic-gate Tracecv(isgraph(lc), (stderr," '%c' ", lc)); 24687c478bd9Sstevel@tonic-gate } else { 24697c478bd9Sstevel@tonic-gate /* Here, lc is the match length - MIN_MATCH */ 24707c478bd9Sstevel@tonic-gate code = length_code[lc]; 24717c478bd9Sstevel@tonic-gate send_code(s, code+LITERALS+1, ltree); /* send the length code */ 24727c478bd9Sstevel@tonic-gate extra = extra_lbits[code]; 24737c478bd9Sstevel@tonic-gate if (extra != 0) { 24747c478bd9Sstevel@tonic-gate lc -= base_length[code]; 24757c478bd9Sstevel@tonic-gate send_bits(s, lc, extra); /* send the extra length bits */ 24767c478bd9Sstevel@tonic-gate } 24777c478bd9Sstevel@tonic-gate dist--; /* dist is now the match distance - 1 */ 24787c478bd9Sstevel@tonic-gate code = d_code(dist); 24797c478bd9Sstevel@tonic-gate Assert (code < D_CODES, "bad d_code"); 24807c478bd9Sstevel@tonic-gate 24817c478bd9Sstevel@tonic-gate send_code(s, code, dtree); /* send the distance code */ 24827c478bd9Sstevel@tonic-gate extra = extra_dbits[code]; 24837c478bd9Sstevel@tonic-gate if (extra != 0) { 24847c478bd9Sstevel@tonic-gate dist -= base_dist[code]; 24857c478bd9Sstevel@tonic-gate send_bits(s, dist, extra); /* send the extra distance bits */ 24867c478bd9Sstevel@tonic-gate } 24877c478bd9Sstevel@tonic-gate } /* literal or match pair ? */ 24887c478bd9Sstevel@tonic-gate 24897c478bd9Sstevel@tonic-gate /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ 24907c478bd9Sstevel@tonic-gate Assert(s->pending < s->lit_bufsize + 2*lx, "pendingBuf overflow"); 24917c478bd9Sstevel@tonic-gate 24927c478bd9Sstevel@tonic-gate } while (lx < s->last_lit); 24937c478bd9Sstevel@tonic-gate 24947c478bd9Sstevel@tonic-gate send_code(s, END_BLOCK, ltree); 24957c478bd9Sstevel@tonic-gate s->last_eob_len = ltree[END_BLOCK].Len; 24967c478bd9Sstevel@tonic-gate } 24977c478bd9Sstevel@tonic-gate 24987c478bd9Sstevel@tonic-gate /* =========================================================================== 24997c478bd9Sstevel@tonic-gate * Set the data type to ASCII or BINARY, using a crude approximation: 25007c478bd9Sstevel@tonic-gate * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise. 25017c478bd9Sstevel@tonic-gate * IN assertion: the fields freq of dyn_ltree are set and the total of all 25027c478bd9Sstevel@tonic-gate * frequencies does not exceed 64K (to fit in an int on 16 bit machines). 25037c478bd9Sstevel@tonic-gate */ 25047c478bd9Sstevel@tonic-gate local void set_data_type(s) 25057c478bd9Sstevel@tonic-gate deflate_state *s; 25067c478bd9Sstevel@tonic-gate { 25077c478bd9Sstevel@tonic-gate int n = 0; 25087c478bd9Sstevel@tonic-gate unsigned ascii_freq = 0; 25097c478bd9Sstevel@tonic-gate unsigned bin_freq = 0; 25107c478bd9Sstevel@tonic-gate while (n < 7) bin_freq += s->dyn_ltree[n++].Freq; 25117c478bd9Sstevel@tonic-gate while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq; 25127c478bd9Sstevel@tonic-gate while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq; 25137c478bd9Sstevel@tonic-gate s->data_type = (Byte)(bin_freq > (ascii_freq >> 2) ? BINARY : ASCII); 25147c478bd9Sstevel@tonic-gate } 25157c478bd9Sstevel@tonic-gate 25167c478bd9Sstevel@tonic-gate /* =========================================================================== 25177c478bd9Sstevel@tonic-gate * Reverse the first len bits of a code, using straightforward code (a faster 25187c478bd9Sstevel@tonic-gate * method would use a table) 25197c478bd9Sstevel@tonic-gate * IN assertion: 1 <= len <= 15 25207c478bd9Sstevel@tonic-gate */ 25217c478bd9Sstevel@tonic-gate local unsigned bi_reverse(code, len) 25227c478bd9Sstevel@tonic-gate unsigned code; /* the value to invert */ 25237c478bd9Sstevel@tonic-gate int len; /* its bit length */ 25247c478bd9Sstevel@tonic-gate { 25257c478bd9Sstevel@tonic-gate register unsigned res = 0; 25267c478bd9Sstevel@tonic-gate do { 25277c478bd9Sstevel@tonic-gate res |= code & 1; 25287c478bd9Sstevel@tonic-gate code >>= 1, res <<= 1; 25297c478bd9Sstevel@tonic-gate } while (--len > 0); 25307c478bd9Sstevel@tonic-gate return res >> 1; 25317c478bd9Sstevel@tonic-gate } 25327c478bd9Sstevel@tonic-gate 25337c478bd9Sstevel@tonic-gate /* =========================================================================== 25347c478bd9Sstevel@tonic-gate * Flush the bit buffer, keeping at most 7 bits in it. 25357c478bd9Sstevel@tonic-gate */ 25367c478bd9Sstevel@tonic-gate local void bi_flush(s) 25377c478bd9Sstevel@tonic-gate deflate_state *s; 25387c478bd9Sstevel@tonic-gate { 25397c478bd9Sstevel@tonic-gate if (s->bi_valid == 16) { 25407c478bd9Sstevel@tonic-gate put_short(s, s->bi_buf); 25417c478bd9Sstevel@tonic-gate s->bi_buf = 0; 25427c478bd9Sstevel@tonic-gate s->bi_valid = 0; 25437c478bd9Sstevel@tonic-gate } else if (s->bi_valid >= 8) { 25447c478bd9Sstevel@tonic-gate put_byte(s, (Byte)s->bi_buf); 25457c478bd9Sstevel@tonic-gate s->bi_buf >>= 8; 25467c478bd9Sstevel@tonic-gate s->bi_valid -= 8; 25477c478bd9Sstevel@tonic-gate } 25487c478bd9Sstevel@tonic-gate } 25497c478bd9Sstevel@tonic-gate 25507c478bd9Sstevel@tonic-gate /* =========================================================================== 25517c478bd9Sstevel@tonic-gate * Flush the bit buffer and align the output on a byte boundary 25527c478bd9Sstevel@tonic-gate */ 25537c478bd9Sstevel@tonic-gate local void bi_windup(s) 25547c478bd9Sstevel@tonic-gate deflate_state *s; 25557c478bd9Sstevel@tonic-gate { 25567c478bd9Sstevel@tonic-gate if (s->bi_valid > 8) { 25577c478bd9Sstevel@tonic-gate put_short(s, s->bi_buf); 25587c478bd9Sstevel@tonic-gate } else if (s->bi_valid > 0) { 25597c478bd9Sstevel@tonic-gate put_byte(s, (Byte)s->bi_buf); 25607c478bd9Sstevel@tonic-gate } 25617c478bd9Sstevel@tonic-gate s->bi_buf = 0; 25627c478bd9Sstevel@tonic-gate s->bi_valid = 0; 25637c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 25647c478bd9Sstevel@tonic-gate s->bits_sent = (s->bits_sent+7) & ~7; 25657c478bd9Sstevel@tonic-gate #endif 25667c478bd9Sstevel@tonic-gate } 25677c478bd9Sstevel@tonic-gate 25687c478bd9Sstevel@tonic-gate /* =========================================================================== 25697c478bd9Sstevel@tonic-gate * Copy a stored block, storing first the length and its 25707c478bd9Sstevel@tonic-gate * one's complement if requested. 25717c478bd9Sstevel@tonic-gate */ 25727c478bd9Sstevel@tonic-gate local void copy_block(s, buf, len, header) 25737c478bd9Sstevel@tonic-gate deflate_state *s; 25747c478bd9Sstevel@tonic-gate charf *buf; /* the input data */ 25757c478bd9Sstevel@tonic-gate unsigned len; /* its length */ 25767c478bd9Sstevel@tonic-gate int header; /* true if block header must be written */ 25777c478bd9Sstevel@tonic-gate { 25787c478bd9Sstevel@tonic-gate bi_windup(s); /* align on byte boundary */ 25797c478bd9Sstevel@tonic-gate s->last_eob_len = 8; /* enough lookahead for inflate */ 25807c478bd9Sstevel@tonic-gate 25817c478bd9Sstevel@tonic-gate if (header) { 25827c478bd9Sstevel@tonic-gate put_short(s, (ush)len); 25837c478bd9Sstevel@tonic-gate put_short(s, (ush)~len); 25847c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 25857c478bd9Sstevel@tonic-gate s->bits_sent += 2*16; 25867c478bd9Sstevel@tonic-gate #endif 25877c478bd9Sstevel@tonic-gate } 25887c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 25897c478bd9Sstevel@tonic-gate s->bits_sent += (ulg)len<<3; 25907c478bd9Sstevel@tonic-gate #endif 25917c478bd9Sstevel@tonic-gate while (len--) { 25927c478bd9Sstevel@tonic-gate put_byte(s, *buf++); 25937c478bd9Sstevel@tonic-gate } 25947c478bd9Sstevel@tonic-gate } 25957c478bd9Sstevel@tonic-gate 25967c478bd9Sstevel@tonic-gate 25977c478bd9Sstevel@tonic-gate /*+++++*/ 25987c478bd9Sstevel@tonic-gate /* infblock.h -- header to use infblock.c 25997c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 26007c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 26017c478bd9Sstevel@tonic-gate */ 26027c478bd9Sstevel@tonic-gate 26037c478bd9Sstevel@tonic-gate /* WARNING: this file should *not* be used by applications. It is 26047c478bd9Sstevel@tonic-gate part of the implementation of the compression library and is 26057c478bd9Sstevel@tonic-gate subject to change. Applications should only use zlib.h. 26067c478bd9Sstevel@tonic-gate */ 26077c478bd9Sstevel@tonic-gate 26087c478bd9Sstevel@tonic-gate struct inflate_blocks_state; 26097c478bd9Sstevel@tonic-gate typedef struct inflate_blocks_state FAR inflate_blocks_statef; 26107c478bd9Sstevel@tonic-gate 26117c478bd9Sstevel@tonic-gate local inflate_blocks_statef * inflate_blocks_new OF(( 26127c478bd9Sstevel@tonic-gate z_stream *z, 26137c478bd9Sstevel@tonic-gate check_func c, /* check function */ 26147c478bd9Sstevel@tonic-gate uInt w)); /* window size */ 26157c478bd9Sstevel@tonic-gate 26167c478bd9Sstevel@tonic-gate local int inflate_blocks OF(( 26177c478bd9Sstevel@tonic-gate inflate_blocks_statef *, 26187c478bd9Sstevel@tonic-gate z_stream *, 26197c478bd9Sstevel@tonic-gate int)); /* initial return code */ 26207c478bd9Sstevel@tonic-gate 26217c478bd9Sstevel@tonic-gate local void inflate_blocks_reset OF(( 26227c478bd9Sstevel@tonic-gate inflate_blocks_statef *, 26237c478bd9Sstevel@tonic-gate z_stream *, 26247c478bd9Sstevel@tonic-gate uLongf *)); /* check value on output */ 26257c478bd9Sstevel@tonic-gate 26267c478bd9Sstevel@tonic-gate local int inflate_blocks_free OF(( 26277c478bd9Sstevel@tonic-gate inflate_blocks_statef *, 26287c478bd9Sstevel@tonic-gate z_stream *, 26297c478bd9Sstevel@tonic-gate uLongf *)); /* check value on output */ 26307c478bd9Sstevel@tonic-gate 26317c478bd9Sstevel@tonic-gate local int inflate_addhistory OF(( 26327c478bd9Sstevel@tonic-gate inflate_blocks_statef *, 26337c478bd9Sstevel@tonic-gate z_stream *)); 26347c478bd9Sstevel@tonic-gate 26357c478bd9Sstevel@tonic-gate local int inflate_packet_flush OF(( 26367c478bd9Sstevel@tonic-gate inflate_blocks_statef *)); 26377c478bd9Sstevel@tonic-gate 26387c478bd9Sstevel@tonic-gate /*+++++*/ 26397c478bd9Sstevel@tonic-gate /* inftrees.h -- header to use inftrees.c 26407c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 26417c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 26427c478bd9Sstevel@tonic-gate */ 26437c478bd9Sstevel@tonic-gate 26447c478bd9Sstevel@tonic-gate /* WARNING: this file should *not* be used by applications. It is 26457c478bd9Sstevel@tonic-gate part of the implementation of the compression library and is 26467c478bd9Sstevel@tonic-gate subject to change. Applications should only use zlib.h. 26477c478bd9Sstevel@tonic-gate */ 26487c478bd9Sstevel@tonic-gate 26497c478bd9Sstevel@tonic-gate /* Huffman code lookup table entry--this entry is four bytes for machines 26507c478bd9Sstevel@tonic-gate that have 16-bit pointers (e.g. PC's in the small or medium model). */ 26517c478bd9Sstevel@tonic-gate 26527c478bd9Sstevel@tonic-gate typedef struct inflate_huft_s FAR inflate_huft; 26537c478bd9Sstevel@tonic-gate 26547c478bd9Sstevel@tonic-gate struct inflate_huft_s { 26557c478bd9Sstevel@tonic-gate union { 26567c478bd9Sstevel@tonic-gate struct { 26577c478bd9Sstevel@tonic-gate Byte Exop; /* number of extra bits or operation */ 26587c478bd9Sstevel@tonic-gate Byte Bits; /* number of bits in this code or subcode */ 26597c478bd9Sstevel@tonic-gate } what; 26607c478bd9Sstevel@tonic-gate uInt Nalloc; /* number of these allocated here */ 26617c478bd9Sstevel@tonic-gate Bytef *pad; /* pad structure to a power of 2 (4 bytes for */ 26627c478bd9Sstevel@tonic-gate } word; /* 16-bit, 8 bytes for 32-bit machines) */ 26637c478bd9Sstevel@tonic-gate union { 26647c478bd9Sstevel@tonic-gate uInt Base; /* literal, length base, or distance base */ 26657c478bd9Sstevel@tonic-gate inflate_huft *Next; /* pointer to next level of table */ 26667c478bd9Sstevel@tonic-gate } more; 26677c478bd9Sstevel@tonic-gate }; 26687c478bd9Sstevel@tonic-gate 26697c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 26707c478bd9Sstevel@tonic-gate local uInt inflate_hufts; 26717c478bd9Sstevel@tonic-gate #endif 26727c478bd9Sstevel@tonic-gate 26737c478bd9Sstevel@tonic-gate local int inflate_trees_bits OF(( 26747c478bd9Sstevel@tonic-gate uIntf *, /* 19 code lengths */ 26757c478bd9Sstevel@tonic-gate uIntf *, /* bits tree desired/actual depth */ 26767c478bd9Sstevel@tonic-gate inflate_huft * FAR *, /* bits tree result */ 26777c478bd9Sstevel@tonic-gate z_stream *)); /* for zalloc, zfree functions */ 26787c478bd9Sstevel@tonic-gate 26797c478bd9Sstevel@tonic-gate local int inflate_trees_dynamic OF(( 26807c478bd9Sstevel@tonic-gate uInt, /* number of literal/length codes */ 26817c478bd9Sstevel@tonic-gate uInt, /* number of distance codes */ 26827c478bd9Sstevel@tonic-gate uIntf *, /* that many (total) code lengths */ 26837c478bd9Sstevel@tonic-gate uIntf *, /* literal desired/actual bit depth */ 26847c478bd9Sstevel@tonic-gate uIntf *, /* distance desired/actual bit depth */ 26857c478bd9Sstevel@tonic-gate inflate_huft * FAR *, /* literal/length tree result */ 26867c478bd9Sstevel@tonic-gate inflate_huft * FAR *, /* distance tree result */ 26877c478bd9Sstevel@tonic-gate z_stream *)); /* for zalloc, zfree functions */ 26887c478bd9Sstevel@tonic-gate 26897c478bd9Sstevel@tonic-gate local int inflate_trees_fixed OF(( 26907c478bd9Sstevel@tonic-gate uIntf *, /* literal desired/actual bit depth */ 26917c478bd9Sstevel@tonic-gate uIntf *, /* distance desired/actual bit depth */ 26927c478bd9Sstevel@tonic-gate inflate_huft * FAR *, /* literal/length tree result */ 26937c478bd9Sstevel@tonic-gate inflate_huft * FAR *)); /* distance tree result */ 26947c478bd9Sstevel@tonic-gate 26957c478bd9Sstevel@tonic-gate local int inflate_trees_free OF(( 26967c478bd9Sstevel@tonic-gate inflate_huft *, /* tables to free */ 26977c478bd9Sstevel@tonic-gate z_stream *)); /* for zfree function */ 26987c478bd9Sstevel@tonic-gate 26997c478bd9Sstevel@tonic-gate 27007c478bd9Sstevel@tonic-gate /*+++++*/ 27017c478bd9Sstevel@tonic-gate /* infcodes.h -- header to use infcodes.c 27027c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 27037c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 27047c478bd9Sstevel@tonic-gate */ 27057c478bd9Sstevel@tonic-gate 27067c478bd9Sstevel@tonic-gate /* WARNING: this file should *not* be used by applications. It is 27077c478bd9Sstevel@tonic-gate part of the implementation of the compression library and is 27087c478bd9Sstevel@tonic-gate subject to change. Applications should only use zlib.h. 27097c478bd9Sstevel@tonic-gate */ 27107c478bd9Sstevel@tonic-gate 27117c478bd9Sstevel@tonic-gate struct inflate_codes_state; 27127c478bd9Sstevel@tonic-gate typedef struct inflate_codes_state FAR inflate_codes_statef; 27137c478bd9Sstevel@tonic-gate 27147c478bd9Sstevel@tonic-gate local inflate_codes_statef *inflate_codes_new OF(( 27157c478bd9Sstevel@tonic-gate uInt, uInt, 27167c478bd9Sstevel@tonic-gate inflate_huft *, inflate_huft *, 27177c478bd9Sstevel@tonic-gate z_stream *)); 27187c478bd9Sstevel@tonic-gate 27197c478bd9Sstevel@tonic-gate local int inflate_codes OF(( 27207c478bd9Sstevel@tonic-gate inflate_blocks_statef *, 27217c478bd9Sstevel@tonic-gate z_stream *, 27227c478bd9Sstevel@tonic-gate int)); 27237c478bd9Sstevel@tonic-gate 27247c478bd9Sstevel@tonic-gate local void inflate_codes_free OF(( 27257c478bd9Sstevel@tonic-gate inflate_codes_statef *, 27267c478bd9Sstevel@tonic-gate z_stream *)); 27277c478bd9Sstevel@tonic-gate 27287c478bd9Sstevel@tonic-gate 27297c478bd9Sstevel@tonic-gate /*+++++*/ 27307c478bd9Sstevel@tonic-gate /* inflate.c -- zlib interface to inflate modules 27317c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 27327c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 27337c478bd9Sstevel@tonic-gate */ 27347c478bd9Sstevel@tonic-gate 27357c478bd9Sstevel@tonic-gate /* inflate private state */ 27367c478bd9Sstevel@tonic-gate struct internal_state { 27377c478bd9Sstevel@tonic-gate 27387c478bd9Sstevel@tonic-gate /* mode */ 27397c478bd9Sstevel@tonic-gate enum { 27407c478bd9Sstevel@tonic-gate METHOD, /* waiting for method byte */ 27417c478bd9Sstevel@tonic-gate FLAG, /* waiting for flag byte */ 27427c478bd9Sstevel@tonic-gate BLOCKS, /* decompressing blocks */ 27437c478bd9Sstevel@tonic-gate CHECK4, /* four check bytes to go */ 27447c478bd9Sstevel@tonic-gate CHECK3, /* three check bytes to go */ 27457c478bd9Sstevel@tonic-gate CHECK2, /* two check bytes to go */ 27467c478bd9Sstevel@tonic-gate CHECK1, /* one check byte to go */ 27477c478bd9Sstevel@tonic-gate DONE, /* finished check, done */ 27487c478bd9Sstevel@tonic-gate BAD} /* got an error--stay here */ 27497c478bd9Sstevel@tonic-gate mode; /* current inflate mode */ 27507c478bd9Sstevel@tonic-gate 27517c478bd9Sstevel@tonic-gate /* mode dependent information */ 27527c478bd9Sstevel@tonic-gate union { 27537c478bd9Sstevel@tonic-gate uInt method; /* if FLAGS, method byte */ 27547c478bd9Sstevel@tonic-gate struct { 27557c478bd9Sstevel@tonic-gate uLong was; /* computed check value */ 27567c478bd9Sstevel@tonic-gate uLong need; /* stream check value */ 27577c478bd9Sstevel@tonic-gate } check; /* if CHECK, check values to compare */ 27587c478bd9Sstevel@tonic-gate uInt marker; /* if BAD, inflateSync's marker bytes count */ 27597c478bd9Sstevel@tonic-gate } sub; /* submode */ 27607c478bd9Sstevel@tonic-gate 27617c478bd9Sstevel@tonic-gate /* mode independent information */ 27627c478bd9Sstevel@tonic-gate int nowrap; /* flag for no wrapper */ 27637c478bd9Sstevel@tonic-gate uInt wbits; /* log2(window size) (8..15, defaults to 15) */ 27647c478bd9Sstevel@tonic-gate inflate_blocks_statef 27657c478bd9Sstevel@tonic-gate *blocks; /* current inflate_blocks state */ 27667c478bd9Sstevel@tonic-gate 27677c478bd9Sstevel@tonic-gate }; 27687c478bd9Sstevel@tonic-gate 27697c478bd9Sstevel@tonic-gate 27707c478bd9Sstevel@tonic-gate int inflateReset(z) 27717c478bd9Sstevel@tonic-gate z_stream *z; 27727c478bd9Sstevel@tonic-gate { 27737c478bd9Sstevel@tonic-gate uLong c; 27747c478bd9Sstevel@tonic-gate 27757c478bd9Sstevel@tonic-gate if (z == Z_NULL || z->state == Z_NULL) 27767c478bd9Sstevel@tonic-gate return Z_STREAM_ERROR; 27777c478bd9Sstevel@tonic-gate z->total_in = z->total_out = 0; 27787c478bd9Sstevel@tonic-gate z->msg = Z_NULL; 27797c478bd9Sstevel@tonic-gate z->state->mode = z->state->nowrap ? BLOCKS : METHOD; 27807c478bd9Sstevel@tonic-gate inflate_blocks_reset(z->state->blocks, z, &c); 27817c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: reset\n")); 27827c478bd9Sstevel@tonic-gate return Z_OK; 27837c478bd9Sstevel@tonic-gate } 27847c478bd9Sstevel@tonic-gate 27857c478bd9Sstevel@tonic-gate 27867c478bd9Sstevel@tonic-gate int inflateEnd(z) 27877c478bd9Sstevel@tonic-gate z_stream *z; 27887c478bd9Sstevel@tonic-gate { 27897c478bd9Sstevel@tonic-gate uLong c; 27907c478bd9Sstevel@tonic-gate 27917c478bd9Sstevel@tonic-gate if (z == Z_NULL || z->state == Z_NULL || z->zfree == Z_NULL) 27927c478bd9Sstevel@tonic-gate return Z_STREAM_ERROR; 27937c478bd9Sstevel@tonic-gate if (z->state->blocks != Z_NULL) 27947c478bd9Sstevel@tonic-gate inflate_blocks_free(z->state->blocks, z, &c); 27957c478bd9Sstevel@tonic-gate ZFREE(z, z->state, sizeof(struct internal_state)); 27967c478bd9Sstevel@tonic-gate z->state = Z_NULL; 27977c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: end\n")); 27987c478bd9Sstevel@tonic-gate return Z_OK; 27997c478bd9Sstevel@tonic-gate } 28007c478bd9Sstevel@tonic-gate 28017c478bd9Sstevel@tonic-gate 28027c478bd9Sstevel@tonic-gate int inflateInit2(z, w) 28037c478bd9Sstevel@tonic-gate z_stream *z; 28047c478bd9Sstevel@tonic-gate int w; 28057c478bd9Sstevel@tonic-gate { 28067c478bd9Sstevel@tonic-gate /* initialize state */ 28077c478bd9Sstevel@tonic-gate if (z == Z_NULL) 28087c478bd9Sstevel@tonic-gate return Z_STREAM_ERROR; 28097c478bd9Sstevel@tonic-gate /* if (z->zalloc == Z_NULL) z->zalloc = zcalloc; */ 28107c478bd9Sstevel@tonic-gate /* if (z->zfree == Z_NULL) z->zfree = zcfree; */ 28117c478bd9Sstevel@tonic-gate if ((z->state = (struct internal_state FAR *) 28127c478bd9Sstevel@tonic-gate ZALLOC(z,1,sizeof(struct internal_state))) == Z_NULL) 28137c478bd9Sstevel@tonic-gate return Z_MEM_ERROR; 28147c478bd9Sstevel@tonic-gate z->state->blocks = Z_NULL; 28157c478bd9Sstevel@tonic-gate 28167c478bd9Sstevel@tonic-gate /* handle undocumented nowrap option (no zlib header or check) */ 28177c478bd9Sstevel@tonic-gate z->state->nowrap = 0; 28187c478bd9Sstevel@tonic-gate if (w < 0) 28197c478bd9Sstevel@tonic-gate { 28207c478bd9Sstevel@tonic-gate w = - w; 28217c478bd9Sstevel@tonic-gate z->state->nowrap = 1; 28227c478bd9Sstevel@tonic-gate } 28237c478bd9Sstevel@tonic-gate 28247c478bd9Sstevel@tonic-gate /* set window size */ 28257c478bd9Sstevel@tonic-gate if (w < 8 || w > 15) 28267c478bd9Sstevel@tonic-gate { 28277c478bd9Sstevel@tonic-gate inflateEnd(z); 28287c478bd9Sstevel@tonic-gate return Z_STREAM_ERROR; 28297c478bd9Sstevel@tonic-gate } 28307c478bd9Sstevel@tonic-gate z->state->wbits = (uInt)w; 28317c478bd9Sstevel@tonic-gate 28327c478bd9Sstevel@tonic-gate /* create inflate_blocks state */ 28337c478bd9Sstevel@tonic-gate if ((z->state->blocks = 28347c478bd9Sstevel@tonic-gate inflate_blocks_new(z, z->state->nowrap ? Z_NULL : adler32, 1 << w)) 28357c478bd9Sstevel@tonic-gate == Z_NULL) 28367c478bd9Sstevel@tonic-gate { 28377c478bd9Sstevel@tonic-gate inflateEnd(z); 28387c478bd9Sstevel@tonic-gate return Z_MEM_ERROR; 28397c478bd9Sstevel@tonic-gate } 28407c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: allocated\n")); 28417c478bd9Sstevel@tonic-gate 28427c478bd9Sstevel@tonic-gate /* reset state */ 28437c478bd9Sstevel@tonic-gate inflateReset(z); 28447c478bd9Sstevel@tonic-gate return Z_OK; 28457c478bd9Sstevel@tonic-gate } 28467c478bd9Sstevel@tonic-gate 28477c478bd9Sstevel@tonic-gate 28487c478bd9Sstevel@tonic-gate int inflateInit(z) 28497c478bd9Sstevel@tonic-gate z_stream *z; 28507c478bd9Sstevel@tonic-gate { 28517c478bd9Sstevel@tonic-gate return inflateInit2(z, DEF_WBITS); 28527c478bd9Sstevel@tonic-gate } 28537c478bd9Sstevel@tonic-gate 28547c478bd9Sstevel@tonic-gate 28557c478bd9Sstevel@tonic-gate #define NEEDBYTE {if(z->avail_in==0)goto empty;r=Z_OK;} 28567c478bd9Sstevel@tonic-gate #define NEXTBYTE (z->avail_in--,z->total_in++,*z->next_in++) 28577c478bd9Sstevel@tonic-gate 28587c478bd9Sstevel@tonic-gate int inflate(z, f) 28597c478bd9Sstevel@tonic-gate z_stream *z; 28607c478bd9Sstevel@tonic-gate int f; 28617c478bd9Sstevel@tonic-gate { 28627c478bd9Sstevel@tonic-gate int r; 28637c478bd9Sstevel@tonic-gate uInt b; 28647c478bd9Sstevel@tonic-gate 28657c478bd9Sstevel@tonic-gate if (z == Z_NULL || z->next_in == Z_NULL) 28667c478bd9Sstevel@tonic-gate return Z_STREAM_ERROR; 28677c478bd9Sstevel@tonic-gate r = Z_BUF_ERROR; 28687c478bd9Sstevel@tonic-gate while (1) switch (z->state->mode) 28697c478bd9Sstevel@tonic-gate { 28707c478bd9Sstevel@tonic-gate case METHOD: 28717c478bd9Sstevel@tonic-gate NEEDBYTE 28727c478bd9Sstevel@tonic-gate if (((z->state->sub.method = NEXTBYTE) & 0xf) != DEFLATED) 28737c478bd9Sstevel@tonic-gate { 28747c478bd9Sstevel@tonic-gate z->state->mode = BAD; 28757c478bd9Sstevel@tonic-gate z->msg = "unknown compression method"; 28767c478bd9Sstevel@tonic-gate z->state->sub.marker = 5; /* can't try inflateSync */ 28777c478bd9Sstevel@tonic-gate break; 28787c478bd9Sstevel@tonic-gate } 28797c478bd9Sstevel@tonic-gate if ((z->state->sub.method >> 4) + 8 > z->state->wbits) 28807c478bd9Sstevel@tonic-gate { 28817c478bd9Sstevel@tonic-gate z->state->mode = BAD; 28827c478bd9Sstevel@tonic-gate z->msg = "invalid window size"; 28837c478bd9Sstevel@tonic-gate z->state->sub.marker = 5; /* can't try inflateSync */ 28847c478bd9Sstevel@tonic-gate break; 28857c478bd9Sstevel@tonic-gate } 28867c478bd9Sstevel@tonic-gate z->state->mode = FLAG; 2887*5b85b345SToomas Soome /* FALLTHROUGH */ 28887c478bd9Sstevel@tonic-gate case FLAG: 28897c478bd9Sstevel@tonic-gate NEEDBYTE 28907c478bd9Sstevel@tonic-gate if ((b = NEXTBYTE) & 0x20) 28917c478bd9Sstevel@tonic-gate { 28927c478bd9Sstevel@tonic-gate z->state->mode = BAD; 28937c478bd9Sstevel@tonic-gate z->msg = "invalid reserved bit"; 28947c478bd9Sstevel@tonic-gate z->state->sub.marker = 5; /* can't try inflateSync */ 28957c478bd9Sstevel@tonic-gate break; 28967c478bd9Sstevel@tonic-gate } 28977c478bd9Sstevel@tonic-gate if (((z->state->sub.method << 8) + b) % 31) 28987c478bd9Sstevel@tonic-gate { 28997c478bd9Sstevel@tonic-gate z->state->mode = BAD; 29007c478bd9Sstevel@tonic-gate z->msg = "incorrect header check"; 29017c478bd9Sstevel@tonic-gate z->state->sub.marker = 5; /* can't try inflateSync */ 29027c478bd9Sstevel@tonic-gate break; 29037c478bd9Sstevel@tonic-gate } 29047c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: zlib header ok\n")); 29057c478bd9Sstevel@tonic-gate z->state->mode = BLOCKS; 2906*5b85b345SToomas Soome /* FALLTHROUGH */ 29077c478bd9Sstevel@tonic-gate case BLOCKS: 29087c478bd9Sstevel@tonic-gate r = inflate_blocks(z->state->blocks, z, r); 29097c478bd9Sstevel@tonic-gate if (f == Z_PACKET_FLUSH && z->avail_in == 0 && z->avail_out != 0) 29107c478bd9Sstevel@tonic-gate r = inflate_packet_flush(z->state->blocks); 29117c478bd9Sstevel@tonic-gate if (r == Z_DATA_ERROR) 29127c478bd9Sstevel@tonic-gate { 29137c478bd9Sstevel@tonic-gate z->state->mode = BAD; 29147c478bd9Sstevel@tonic-gate z->state->sub.marker = 0; /* can try inflateSync */ 29157c478bd9Sstevel@tonic-gate break; 29167c478bd9Sstevel@tonic-gate } 29177c478bd9Sstevel@tonic-gate if (r != Z_STREAM_END) 29187c478bd9Sstevel@tonic-gate return r; 29197c478bd9Sstevel@tonic-gate r = Z_OK; 29207c478bd9Sstevel@tonic-gate inflate_blocks_reset(z->state->blocks, z, &z->state->sub.check.was); 29217c478bd9Sstevel@tonic-gate if (z->state->nowrap) 29227c478bd9Sstevel@tonic-gate { 29237c478bd9Sstevel@tonic-gate z->state->mode = DONE; 29247c478bd9Sstevel@tonic-gate break; 29257c478bd9Sstevel@tonic-gate } 29267c478bd9Sstevel@tonic-gate z->state->mode = CHECK4; 2927*5b85b345SToomas Soome /* FALLTHROUGH */ 29287c478bd9Sstevel@tonic-gate case CHECK4: 29297c478bd9Sstevel@tonic-gate NEEDBYTE 29307c478bd9Sstevel@tonic-gate z->state->sub.check.need = (uLong)NEXTBYTE << 24; 29317c478bd9Sstevel@tonic-gate z->state->mode = CHECK3; 2932*5b85b345SToomas Soome /* FALLTHROUGH */ 29337c478bd9Sstevel@tonic-gate case CHECK3: 29347c478bd9Sstevel@tonic-gate NEEDBYTE 29357c478bd9Sstevel@tonic-gate z->state->sub.check.need += (uLong)NEXTBYTE << 16; 29367c478bd9Sstevel@tonic-gate z->state->mode = CHECK2; 2937*5b85b345SToomas Soome /* FALLTHROUGH */ 29387c478bd9Sstevel@tonic-gate case CHECK2: 29397c478bd9Sstevel@tonic-gate NEEDBYTE 29407c478bd9Sstevel@tonic-gate z->state->sub.check.need += (uLong)NEXTBYTE << 8; 29417c478bd9Sstevel@tonic-gate z->state->mode = CHECK1; 2942*5b85b345SToomas Soome /* FALLTHROUGH */ 29437c478bd9Sstevel@tonic-gate case CHECK1: 29447c478bd9Sstevel@tonic-gate NEEDBYTE 29457c478bd9Sstevel@tonic-gate z->state->sub.check.need += (uLong)NEXTBYTE; 29467c478bd9Sstevel@tonic-gate 29477c478bd9Sstevel@tonic-gate if (z->state->sub.check.was != z->state->sub.check.need) 29487c478bd9Sstevel@tonic-gate { 29497c478bd9Sstevel@tonic-gate z->state->mode = BAD; 29507c478bd9Sstevel@tonic-gate z->msg = "incorrect data check"; 29517c478bd9Sstevel@tonic-gate z->state->sub.marker = 5; /* can't try inflateSync */ 29527c478bd9Sstevel@tonic-gate break; 29537c478bd9Sstevel@tonic-gate } 29547c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: zlib check ok\n")); 29557c478bd9Sstevel@tonic-gate z->state->mode = DONE; 2956*5b85b345SToomas Soome /* FALLTHROUGH */ 29577c478bd9Sstevel@tonic-gate case DONE: 29587c478bd9Sstevel@tonic-gate return Z_STREAM_END; 29597c478bd9Sstevel@tonic-gate case BAD: 29607c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 29617c478bd9Sstevel@tonic-gate default: 29627c478bd9Sstevel@tonic-gate return Z_STREAM_ERROR; 29637c478bd9Sstevel@tonic-gate } 29647c478bd9Sstevel@tonic-gate 29657c478bd9Sstevel@tonic-gate empty: 29667c478bd9Sstevel@tonic-gate if (f != Z_PACKET_FLUSH) 29677c478bd9Sstevel@tonic-gate return r; 29687c478bd9Sstevel@tonic-gate z->state->mode = BAD; 29697c478bd9Sstevel@tonic-gate z->state->sub.marker = 0; /* can try inflateSync */ 29707c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 29717c478bd9Sstevel@tonic-gate } 29727c478bd9Sstevel@tonic-gate 29737c478bd9Sstevel@tonic-gate /* 29747c478bd9Sstevel@tonic-gate * This subroutine adds the data at next_in/avail_in to the output history 29757c478bd9Sstevel@tonic-gate * without performing any output. The output buffer must be "caught up"; 29767c478bd9Sstevel@tonic-gate * i.e. no pending output (hence s->read equals s->write), and the state must 29777c478bd9Sstevel@tonic-gate * be BLOCKS (i.e. we should be willing to see the start of a series of 29787c478bd9Sstevel@tonic-gate * BLOCKS). On exit, the output will also be caught up, and the checksum 29797c478bd9Sstevel@tonic-gate * will have been updated if need be. 29807c478bd9Sstevel@tonic-gate */ 29817c478bd9Sstevel@tonic-gate 29827c478bd9Sstevel@tonic-gate int inflateIncomp(z) 29837c478bd9Sstevel@tonic-gate z_stream *z; 29847c478bd9Sstevel@tonic-gate { 29857c478bd9Sstevel@tonic-gate if (z->state->mode != BLOCKS) 29867c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 29877c478bd9Sstevel@tonic-gate return inflate_addhistory(z->state->blocks, z); 29887c478bd9Sstevel@tonic-gate } 29897c478bd9Sstevel@tonic-gate 29907c478bd9Sstevel@tonic-gate 29917c478bd9Sstevel@tonic-gate int inflateSync(z) 29927c478bd9Sstevel@tonic-gate z_stream *z; 29937c478bd9Sstevel@tonic-gate { 29947c478bd9Sstevel@tonic-gate uInt n; /* number of bytes to look at */ 29957c478bd9Sstevel@tonic-gate Bytef *p; /* pointer to bytes */ 29967c478bd9Sstevel@tonic-gate uInt m; /* number of marker bytes found in a row */ 29977c478bd9Sstevel@tonic-gate uLong r, w; /* temporaries to save total_in and total_out */ 29987c478bd9Sstevel@tonic-gate 29997c478bd9Sstevel@tonic-gate /* set up */ 30007c478bd9Sstevel@tonic-gate if (z == Z_NULL || z->state == Z_NULL) 30017c478bd9Sstevel@tonic-gate return Z_STREAM_ERROR; 30027c478bd9Sstevel@tonic-gate if (z->state->mode != BAD) 30037c478bd9Sstevel@tonic-gate { 30047c478bd9Sstevel@tonic-gate z->state->mode = BAD; 30057c478bd9Sstevel@tonic-gate z->state->sub.marker = 0; 30067c478bd9Sstevel@tonic-gate } 30077c478bd9Sstevel@tonic-gate if ((n = z->avail_in) == 0) 30087c478bd9Sstevel@tonic-gate return Z_BUF_ERROR; 30097c478bd9Sstevel@tonic-gate p = z->next_in; 30107c478bd9Sstevel@tonic-gate m = z->state->sub.marker; 30117c478bd9Sstevel@tonic-gate 30127c478bd9Sstevel@tonic-gate /* search */ 30137c478bd9Sstevel@tonic-gate while (n && m < 4) 30147c478bd9Sstevel@tonic-gate { 30157c478bd9Sstevel@tonic-gate if (*p == (Byte)(m < 2 ? 0 : 0xff)) 30167c478bd9Sstevel@tonic-gate m++; 30177c478bd9Sstevel@tonic-gate else if (*p) 30187c478bd9Sstevel@tonic-gate m = 0; 30197c478bd9Sstevel@tonic-gate else 30207c478bd9Sstevel@tonic-gate m = 4 - m; 30217c478bd9Sstevel@tonic-gate p++, n--; 30227c478bd9Sstevel@tonic-gate } 30237c478bd9Sstevel@tonic-gate 30247c478bd9Sstevel@tonic-gate /* restore */ 30257c478bd9Sstevel@tonic-gate z->total_in += p - z->next_in; 30267c478bd9Sstevel@tonic-gate z->next_in = p; 30277c478bd9Sstevel@tonic-gate z->avail_in = n; 30287c478bd9Sstevel@tonic-gate z->state->sub.marker = m; 30297c478bd9Sstevel@tonic-gate 30307c478bd9Sstevel@tonic-gate /* return no joy or set up to restart on a new block */ 30317c478bd9Sstevel@tonic-gate if (m != 4) 30327c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 30337c478bd9Sstevel@tonic-gate r = z->total_in; w = z->total_out; 30347c478bd9Sstevel@tonic-gate inflateReset(z); 30357c478bd9Sstevel@tonic-gate z->total_in = r; z->total_out = w; 30367c478bd9Sstevel@tonic-gate z->state->mode = BLOCKS; 30377c478bd9Sstevel@tonic-gate return Z_OK; 30387c478bd9Sstevel@tonic-gate } 30397c478bd9Sstevel@tonic-gate 30407c478bd9Sstevel@tonic-gate #undef NEEDBYTE 30417c478bd9Sstevel@tonic-gate #undef NEXTBYTE 30427c478bd9Sstevel@tonic-gate 30437c478bd9Sstevel@tonic-gate /*+++++*/ 30447c478bd9Sstevel@tonic-gate /* infutil.h -- types and macros common to blocks and codes 30457c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 30467c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 30477c478bd9Sstevel@tonic-gate */ 30487c478bd9Sstevel@tonic-gate 30497c478bd9Sstevel@tonic-gate /* WARNING: this file should *not* be used by applications. It is 30507c478bd9Sstevel@tonic-gate part of the implementation of the compression library and is 30517c478bd9Sstevel@tonic-gate subject to change. Applications should only use zlib.h. 30527c478bd9Sstevel@tonic-gate */ 30537c478bd9Sstevel@tonic-gate 30547c478bd9Sstevel@tonic-gate /* inflate blocks semi-private state */ 30557c478bd9Sstevel@tonic-gate struct inflate_blocks_state { 30567c478bd9Sstevel@tonic-gate 30577c478bd9Sstevel@tonic-gate /* mode */ 30587c478bd9Sstevel@tonic-gate enum { 30597c478bd9Sstevel@tonic-gate TYPE, /* get type bits (3, including end bit) */ 30607c478bd9Sstevel@tonic-gate LENS, /* get lengths for stored */ 30617c478bd9Sstevel@tonic-gate STORED, /* processing stored block */ 30627c478bd9Sstevel@tonic-gate TABLE, /* get table lengths */ 30637c478bd9Sstevel@tonic-gate BTREE, /* get bit lengths tree for a dynamic block */ 30647c478bd9Sstevel@tonic-gate DTREE, /* get length, distance trees for a dynamic block */ 30657c478bd9Sstevel@tonic-gate CODES, /* processing fixed or dynamic block */ 30667c478bd9Sstevel@tonic-gate DRY, /* output remaining window bytes */ 30677c478bd9Sstevel@tonic-gate DONEB, /* finished last block, done */ 30687c478bd9Sstevel@tonic-gate BADB} /* got a data error--stuck here */ 30697c478bd9Sstevel@tonic-gate mode; /* current inflate_block mode */ 30707c478bd9Sstevel@tonic-gate 30717c478bd9Sstevel@tonic-gate /* mode dependent information */ 30727c478bd9Sstevel@tonic-gate union { 30737c478bd9Sstevel@tonic-gate uInt left; /* if STORED, bytes left to copy */ 30747c478bd9Sstevel@tonic-gate struct { 30757c478bd9Sstevel@tonic-gate uInt table; /* table lengths (14 bits) */ 30767c478bd9Sstevel@tonic-gate uInt index; /* index into blens (or border) */ 30777c478bd9Sstevel@tonic-gate uIntf *blens; /* bit lengths of codes */ 30787c478bd9Sstevel@tonic-gate uInt bb; /* bit length tree depth */ 30797c478bd9Sstevel@tonic-gate inflate_huft *tb; /* bit length decoding tree */ 30807c478bd9Sstevel@tonic-gate int nblens; /* # elements allocated at blens */ 30817c478bd9Sstevel@tonic-gate } trees; /* if DTREE, decoding info for trees */ 30827c478bd9Sstevel@tonic-gate struct { 30837c478bd9Sstevel@tonic-gate inflate_huft *tl, *td; /* trees to free */ 30847c478bd9Sstevel@tonic-gate inflate_codes_statef 30857c478bd9Sstevel@tonic-gate *codes; 30867c478bd9Sstevel@tonic-gate } decode; /* if CODES, current state */ 30877c478bd9Sstevel@tonic-gate } sub; /* submode */ 30887c478bd9Sstevel@tonic-gate uInt last; /* true if this block is the last block */ 30897c478bd9Sstevel@tonic-gate 30907c478bd9Sstevel@tonic-gate /* mode independent information */ 30917c478bd9Sstevel@tonic-gate uInt bitk; /* bits in bit buffer */ 30927c478bd9Sstevel@tonic-gate uLong bitb; /* bit buffer */ 30937c478bd9Sstevel@tonic-gate Bytef *window; /* sliding window */ 30947c478bd9Sstevel@tonic-gate Bytef *end; /* one byte after sliding window */ 30957c478bd9Sstevel@tonic-gate Bytef *read; /* window read pointer */ 30967c478bd9Sstevel@tonic-gate Bytef *write; /* window write pointer */ 30977c478bd9Sstevel@tonic-gate check_func checkfn; /* check function */ 30987c478bd9Sstevel@tonic-gate uLong check; /* check on output */ 30997c478bd9Sstevel@tonic-gate 31007c478bd9Sstevel@tonic-gate }; 31017c478bd9Sstevel@tonic-gate 31027c478bd9Sstevel@tonic-gate 31037c478bd9Sstevel@tonic-gate /* defines for inflate input/output */ 31047c478bd9Sstevel@tonic-gate /* update pointers and return */ 31057c478bd9Sstevel@tonic-gate #define UPDBITS {s->bitb=b;s->bitk=k;} 31067c478bd9Sstevel@tonic-gate #define UPDIN {z->avail_in=n;z->total_in+=p-z->next_in;z->next_in=p;} 31077c478bd9Sstevel@tonic-gate #define UPDOUT {s->write=q;} 31087c478bd9Sstevel@tonic-gate #define UPDATE {UPDBITS UPDIN UPDOUT} 31097c478bd9Sstevel@tonic-gate #define LEAVE {UPDATE return inflate_flush(s,z,r);} 31107c478bd9Sstevel@tonic-gate /* get bytes and bits */ 31117c478bd9Sstevel@tonic-gate #define LOADIN {p=z->next_in;n=z->avail_in;b=s->bitb;k=s->bitk;} 31127c478bd9Sstevel@tonic-gate #define NEEDBYTE {if(n)r=Z_OK;else LEAVE} 31137c478bd9Sstevel@tonic-gate #define NEXTBYTE (n--,*p++) 31147c478bd9Sstevel@tonic-gate #define NEEDBITS(j) {while(k<(j)){NEEDBYTE;b|=((uLong)NEXTBYTE)<<k;k+=8;}} 31157c478bd9Sstevel@tonic-gate #define DUMPBITS(j) {b>>=(j);k-=(j);} 31167c478bd9Sstevel@tonic-gate /* output bytes */ 31177c478bd9Sstevel@tonic-gate #define WAVAIL (q<s->read?s->read-q-1:s->end-q) 31187c478bd9Sstevel@tonic-gate #define LOADOUT {q=s->write;m=WAVAIL;} 31197c478bd9Sstevel@tonic-gate #define WRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=WAVAIL;}} 31207c478bd9Sstevel@tonic-gate #define FLUSH {UPDOUT r=inflate_flush(s,z,r); LOADOUT} 31217c478bd9Sstevel@tonic-gate #define NEEDOUT {if(m==0){WRAP if(m==0){FLUSH WRAP if(m==0) LEAVE}}r=Z_OK;} 31227c478bd9Sstevel@tonic-gate #define OUTBYTE(a) {*q++=(Byte)(a);m--;} 31237c478bd9Sstevel@tonic-gate /* load local pointers */ 31247c478bd9Sstevel@tonic-gate #define LOAD {LOADIN LOADOUT} 31257c478bd9Sstevel@tonic-gate 31267c478bd9Sstevel@tonic-gate /* And'ing with mask[n] masks the lower n bits */ 31277c478bd9Sstevel@tonic-gate local uInt inflate_mask[] = { 31287c478bd9Sstevel@tonic-gate 0x0000, 31297c478bd9Sstevel@tonic-gate 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, 31307c478bd9Sstevel@tonic-gate 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff 31317c478bd9Sstevel@tonic-gate }; 31327c478bd9Sstevel@tonic-gate 31337c478bd9Sstevel@tonic-gate /* copy as much as possible from the sliding window to the output area */ 31347c478bd9Sstevel@tonic-gate local int inflate_flush OF(( 31357c478bd9Sstevel@tonic-gate inflate_blocks_statef *, 31367c478bd9Sstevel@tonic-gate z_stream *, 31377c478bd9Sstevel@tonic-gate int)); 31387c478bd9Sstevel@tonic-gate 31397c478bd9Sstevel@tonic-gate /*+++++*/ 31407c478bd9Sstevel@tonic-gate /* inffast.h -- header to use inffast.c 31417c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 31427c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 31437c478bd9Sstevel@tonic-gate */ 31447c478bd9Sstevel@tonic-gate 31457c478bd9Sstevel@tonic-gate /* WARNING: this file should *not* be used by applications. It is 31467c478bd9Sstevel@tonic-gate part of the implementation of the compression library and is 31477c478bd9Sstevel@tonic-gate subject to change. Applications should only use zlib.h. 31487c478bd9Sstevel@tonic-gate */ 31497c478bd9Sstevel@tonic-gate 31507c478bd9Sstevel@tonic-gate local int inflate_fast OF(( 31517c478bd9Sstevel@tonic-gate uInt, 31527c478bd9Sstevel@tonic-gate uInt, 31537c478bd9Sstevel@tonic-gate inflate_huft *, 31547c478bd9Sstevel@tonic-gate inflate_huft *, 31557c478bd9Sstevel@tonic-gate inflate_blocks_statef *, 31567c478bd9Sstevel@tonic-gate z_stream *)); 31577c478bd9Sstevel@tonic-gate 31587c478bd9Sstevel@tonic-gate 31597c478bd9Sstevel@tonic-gate /*+++++*/ 31607c478bd9Sstevel@tonic-gate /* infblock.c -- interpret and process block types to last block 31617c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 31627c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 31637c478bd9Sstevel@tonic-gate */ 31647c478bd9Sstevel@tonic-gate 31657c478bd9Sstevel@tonic-gate /* Table for deflate from PKZIP's appnote.txt. */ 31667c478bd9Sstevel@tonic-gate local uInt border[] = { /* Order of the bit length code lengths */ 31677c478bd9Sstevel@tonic-gate 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; 31687c478bd9Sstevel@tonic-gate 31697c478bd9Sstevel@tonic-gate /* 31707c478bd9Sstevel@tonic-gate Notes beyond the 1.93a appnote.txt: 31717c478bd9Sstevel@tonic-gate 31727c478bd9Sstevel@tonic-gate 1. Distance pointers never point before the beginning of the output 31737c478bd9Sstevel@tonic-gate stream. 31747c478bd9Sstevel@tonic-gate 2. Distance pointers can point back across blocks, up to 32k away. 31757c478bd9Sstevel@tonic-gate 3. There is an implied maximum of 7 bits for the bit length table and 31767c478bd9Sstevel@tonic-gate 15 bits for the actual data. 31777c478bd9Sstevel@tonic-gate 4. If only one code exists, then it is encoded using one bit. (Zero 31787c478bd9Sstevel@tonic-gate would be more efficient, but perhaps a little confusing.) If two 31797c478bd9Sstevel@tonic-gate codes exist, they are coded using one bit each (0 and 1). 31807c478bd9Sstevel@tonic-gate 5. There is no way of sending zero distance codes--a dummy must be 31817c478bd9Sstevel@tonic-gate sent if there are none. (History: a pre 2.0 version of PKZIP would 31827c478bd9Sstevel@tonic-gate store blocks with no distance codes, but this was discovered to be 31837c478bd9Sstevel@tonic-gate too harsh a criterion.) Valid only for 1.93a. 2.04c does allow 31847c478bd9Sstevel@tonic-gate zero distance codes, which is sent as one code of zero bits in 31857c478bd9Sstevel@tonic-gate length. 31867c478bd9Sstevel@tonic-gate 6. There are up to 286 literal/length codes. Code 256 represents the 31877c478bd9Sstevel@tonic-gate end-of-block. Note however that the static length tree defines 31887c478bd9Sstevel@tonic-gate 288 codes just to fill out the Huffman codes. Codes 286 and 287 31897c478bd9Sstevel@tonic-gate cannot be used though, since there is no length base or extra bits 31907c478bd9Sstevel@tonic-gate defined for them. Similarily, there are up to 30 distance codes. 31917c478bd9Sstevel@tonic-gate However, static trees define 32 codes (all 5 bits) to fill out the 31927c478bd9Sstevel@tonic-gate Huffman codes, but the last two had better not show up in the data. 31937c478bd9Sstevel@tonic-gate 7. Unzip can check dynamic Huffman blocks for complete code sets. 31947c478bd9Sstevel@tonic-gate The exception is that a single code would not be complete (see #4). 31957c478bd9Sstevel@tonic-gate 8. The five bits following the block type is really the number of 31967c478bd9Sstevel@tonic-gate literal codes sent minus 257. 31977c478bd9Sstevel@tonic-gate 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits 31987c478bd9Sstevel@tonic-gate (1+6+6). Therefore, to output three times the length, you output 31997c478bd9Sstevel@tonic-gate three codes (1+1+1), whereas to output four times the same length, 32007c478bd9Sstevel@tonic-gate you only need two codes (1+3). Hmm. 32017c478bd9Sstevel@tonic-gate 10. In the tree reconstruction algorithm, Code = Code + Increment 32027c478bd9Sstevel@tonic-gate only if BitLength(i) is not zero. (Pretty obvious.) 32037c478bd9Sstevel@tonic-gate 11. Correction: 4 Bits: # of Bit Length codes - 4 (4 - 19) 32047c478bd9Sstevel@tonic-gate 12. Note: length code 284 can represent 227-258, but length code 285 32057c478bd9Sstevel@tonic-gate really is 258. The last length deserves its own, short code 32067c478bd9Sstevel@tonic-gate since it gets used a lot in very redundant files. The length 32077c478bd9Sstevel@tonic-gate 258 is special since 258 - 3 (the min match length) is 255. 32087c478bd9Sstevel@tonic-gate 13. The literal/length and distance code bit lengths are read as a 32097c478bd9Sstevel@tonic-gate single stream of lengths. It is possible (and advantageous) for 32107c478bd9Sstevel@tonic-gate a repeat code (16, 17, or 18) to go across the boundary between 32117c478bd9Sstevel@tonic-gate the two sets of lengths. 32127c478bd9Sstevel@tonic-gate */ 32137c478bd9Sstevel@tonic-gate 32147c478bd9Sstevel@tonic-gate 32157c478bd9Sstevel@tonic-gate local void inflate_blocks_reset(s, z, c) 32167c478bd9Sstevel@tonic-gate inflate_blocks_statef *s; 32177c478bd9Sstevel@tonic-gate z_stream *z; 32187c478bd9Sstevel@tonic-gate uLongf *c; 32197c478bd9Sstevel@tonic-gate { 32207c478bd9Sstevel@tonic-gate if (s->checkfn != Z_NULL) 32217c478bd9Sstevel@tonic-gate *c = s->check; 32227c478bd9Sstevel@tonic-gate if (s->mode == BTREE || s->mode == DTREE) 32237c478bd9Sstevel@tonic-gate ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt)); 32247c478bd9Sstevel@tonic-gate if (s->mode == CODES) 32257c478bd9Sstevel@tonic-gate { 32267c478bd9Sstevel@tonic-gate inflate_codes_free(s->sub.decode.codes, z); 32277c478bd9Sstevel@tonic-gate inflate_trees_free(s->sub.decode.td, z); 32287c478bd9Sstevel@tonic-gate inflate_trees_free(s->sub.decode.tl, z); 32297c478bd9Sstevel@tonic-gate } 32307c478bd9Sstevel@tonic-gate s->mode = TYPE; 32317c478bd9Sstevel@tonic-gate s->bitk = 0; 32327c478bd9Sstevel@tonic-gate s->bitb = 0; 32337c478bd9Sstevel@tonic-gate s->read = s->write = s->window; 32347c478bd9Sstevel@tonic-gate if (s->checkfn != Z_NULL) 32357c478bd9Sstevel@tonic-gate s->check = (*s->checkfn)(0L, Z_NULL, 0); 32367c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: blocks reset\n")); 32377c478bd9Sstevel@tonic-gate } 32387c478bd9Sstevel@tonic-gate 32397c478bd9Sstevel@tonic-gate 32407c478bd9Sstevel@tonic-gate local inflate_blocks_statef *inflate_blocks_new(z, c, w) 32417c478bd9Sstevel@tonic-gate z_stream *z; 32427c478bd9Sstevel@tonic-gate check_func c; 32437c478bd9Sstevel@tonic-gate uInt w; 32447c478bd9Sstevel@tonic-gate { 32457c478bd9Sstevel@tonic-gate inflate_blocks_statef *s; 32467c478bd9Sstevel@tonic-gate 32477c478bd9Sstevel@tonic-gate if ((s = (inflate_blocks_statef *)ZALLOC 32487c478bd9Sstevel@tonic-gate (z,1,sizeof(struct inflate_blocks_state))) == Z_NULL) 32497c478bd9Sstevel@tonic-gate return s; 32507c478bd9Sstevel@tonic-gate if ((s->window = (Bytef *)ZALLOC(z, 1, w)) == Z_NULL) 32517c478bd9Sstevel@tonic-gate { 32527c478bd9Sstevel@tonic-gate ZFREE(z, s, sizeof(struct inflate_blocks_state)); 32537c478bd9Sstevel@tonic-gate return Z_NULL; 32547c478bd9Sstevel@tonic-gate } 32557c478bd9Sstevel@tonic-gate s->end = s->window + w; 32567c478bd9Sstevel@tonic-gate s->checkfn = c; 32577c478bd9Sstevel@tonic-gate s->mode = TYPE; 32587c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: blocks allocated\n")); 32597c478bd9Sstevel@tonic-gate inflate_blocks_reset(s, z, &s->check); 32607c478bd9Sstevel@tonic-gate return s; 32617c478bd9Sstevel@tonic-gate } 32627c478bd9Sstevel@tonic-gate 32637c478bd9Sstevel@tonic-gate 32647c478bd9Sstevel@tonic-gate local int inflate_blocks(s, z, r) 32657c478bd9Sstevel@tonic-gate inflate_blocks_statef *s; 32667c478bd9Sstevel@tonic-gate z_stream *z; 32677c478bd9Sstevel@tonic-gate int r; 32687c478bd9Sstevel@tonic-gate { 32697c478bd9Sstevel@tonic-gate uInt t; /* temporary storage */ 32707c478bd9Sstevel@tonic-gate uLong b; /* bit buffer */ 32717c478bd9Sstevel@tonic-gate uInt k; /* bits in bit buffer */ 32727c478bd9Sstevel@tonic-gate Bytef *p; /* input data pointer */ 32737c478bd9Sstevel@tonic-gate uInt n; /* bytes available there */ 32747c478bd9Sstevel@tonic-gate Bytef *q; /* output window write pointer */ 32757c478bd9Sstevel@tonic-gate uInt m; /* bytes to end of window or read pointer */ 32767c478bd9Sstevel@tonic-gate 32777c478bd9Sstevel@tonic-gate /* copy input/output information to locals (UPDATE macro restores) */ 32787c478bd9Sstevel@tonic-gate LOAD 32797c478bd9Sstevel@tonic-gate 32807c478bd9Sstevel@tonic-gate /* process input based on current state */ 32817c478bd9Sstevel@tonic-gate while (1) switch (s->mode) 32827c478bd9Sstevel@tonic-gate { 32837c478bd9Sstevel@tonic-gate case TYPE: 32847c478bd9Sstevel@tonic-gate NEEDBITS(3) 32857c478bd9Sstevel@tonic-gate t = (uInt)b & 7; 32867c478bd9Sstevel@tonic-gate s->last = t & 1; 32877c478bd9Sstevel@tonic-gate switch (t >> 1) 32887c478bd9Sstevel@tonic-gate { 32897c478bd9Sstevel@tonic-gate case 0: /* stored */ 32907c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: stored block%s\n", 32917c478bd9Sstevel@tonic-gate s->last ? " (last)" : "")); 32927c478bd9Sstevel@tonic-gate DUMPBITS(3) 32937c478bd9Sstevel@tonic-gate t = k & 7; /* go to byte boundary */ 32947c478bd9Sstevel@tonic-gate DUMPBITS(t) 32957c478bd9Sstevel@tonic-gate s->mode = LENS; /* get length of stored block */ 32967c478bd9Sstevel@tonic-gate break; 32977c478bd9Sstevel@tonic-gate case 1: /* fixed */ 32987c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: fixed codes block%s\n", 32997c478bd9Sstevel@tonic-gate s->last ? " (last)" : "")); 33007c478bd9Sstevel@tonic-gate { 33017c478bd9Sstevel@tonic-gate uInt bl, bd; 33027c478bd9Sstevel@tonic-gate inflate_huft *tl, *td; 33037c478bd9Sstevel@tonic-gate 33047c478bd9Sstevel@tonic-gate inflate_trees_fixed(&bl, &bd, &tl, &td); 33057c478bd9Sstevel@tonic-gate s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z); 33067c478bd9Sstevel@tonic-gate if (s->sub.decode.codes == Z_NULL) 33077c478bd9Sstevel@tonic-gate { 33087c478bd9Sstevel@tonic-gate r = Z_MEM_ERROR; 33097c478bd9Sstevel@tonic-gate LEAVE 33107c478bd9Sstevel@tonic-gate } 33117c478bd9Sstevel@tonic-gate s->sub.decode.tl = Z_NULL; /* don't try to free these */ 33127c478bd9Sstevel@tonic-gate s->sub.decode.td = Z_NULL; 33137c478bd9Sstevel@tonic-gate } 33147c478bd9Sstevel@tonic-gate DUMPBITS(3) 33157c478bd9Sstevel@tonic-gate s->mode = CODES; 33167c478bd9Sstevel@tonic-gate break; 33177c478bd9Sstevel@tonic-gate case 2: /* dynamic */ 33187c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: dynamic codes block%s\n", 33197c478bd9Sstevel@tonic-gate s->last ? " (last)" : "")); 33207c478bd9Sstevel@tonic-gate DUMPBITS(3) 33217c478bd9Sstevel@tonic-gate s->mode = TABLE; 33227c478bd9Sstevel@tonic-gate break; 33237c478bd9Sstevel@tonic-gate case 3: /* illegal */ 33247c478bd9Sstevel@tonic-gate DUMPBITS(3) 33257c478bd9Sstevel@tonic-gate s->mode = BADB; 33267c478bd9Sstevel@tonic-gate z->msg = "invalid block type"; 33277c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 33287c478bd9Sstevel@tonic-gate LEAVE 33297c478bd9Sstevel@tonic-gate } 33307c478bd9Sstevel@tonic-gate break; 33317c478bd9Sstevel@tonic-gate case LENS: 33327c478bd9Sstevel@tonic-gate NEEDBITS(32) 33337c478bd9Sstevel@tonic-gate if (((~b) >> 16) != (b & 0xffff)) 33347c478bd9Sstevel@tonic-gate { 33357c478bd9Sstevel@tonic-gate s->mode = BADB; 33367c478bd9Sstevel@tonic-gate z->msg = "invalid stored block lengths"; 33377c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 33387c478bd9Sstevel@tonic-gate LEAVE 33397c478bd9Sstevel@tonic-gate } 33407c478bd9Sstevel@tonic-gate s->sub.left = (uInt)b & 0xffff; 33417c478bd9Sstevel@tonic-gate b = k = 0; /* dump bits */ 33427c478bd9Sstevel@tonic-gate Tracev((stderr, "inflate: stored length %u\n", s->sub.left)); 33437c478bd9Sstevel@tonic-gate s->mode = s->sub.left ? STORED : TYPE; 33447c478bd9Sstevel@tonic-gate break; 33457c478bd9Sstevel@tonic-gate case STORED: 33467c478bd9Sstevel@tonic-gate if (n == 0) 33477c478bd9Sstevel@tonic-gate LEAVE 33487c478bd9Sstevel@tonic-gate NEEDOUT 33497c478bd9Sstevel@tonic-gate t = s->sub.left; 33507c478bd9Sstevel@tonic-gate if (t > n) t = n; 33517c478bd9Sstevel@tonic-gate if (t > m) t = m; 33527c478bd9Sstevel@tonic-gate zmemcpy(q, p, t); 33537c478bd9Sstevel@tonic-gate p += t; n -= t; 33547c478bd9Sstevel@tonic-gate q += t; m -= t; 33557c478bd9Sstevel@tonic-gate if ((s->sub.left -= t) != 0) 33567c478bd9Sstevel@tonic-gate break; 33577c478bd9Sstevel@tonic-gate Tracev((stderr, "inflate: stored end, %lu total out\n", 33587c478bd9Sstevel@tonic-gate z->total_out + (q >= s->read ? q - s->read : 33597c478bd9Sstevel@tonic-gate (s->end - s->read) + (q - s->window)))); 33607c478bd9Sstevel@tonic-gate s->mode = s->last ? DRY : TYPE; 33617c478bd9Sstevel@tonic-gate break; 33627c478bd9Sstevel@tonic-gate case TABLE: 33637c478bd9Sstevel@tonic-gate NEEDBITS(14) 33647c478bd9Sstevel@tonic-gate s->sub.trees.table = t = (uInt)b & 0x3fff; 33657c478bd9Sstevel@tonic-gate #ifndef PKZIP_BUG_WORKAROUND 33667c478bd9Sstevel@tonic-gate if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29) 33677c478bd9Sstevel@tonic-gate { 33687c478bd9Sstevel@tonic-gate s->mode = BADB; 33697c478bd9Sstevel@tonic-gate z->msg = "too many length or distance symbols"; 33707c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 33717c478bd9Sstevel@tonic-gate LEAVE 33727c478bd9Sstevel@tonic-gate } 33737c478bd9Sstevel@tonic-gate #endif 33747c478bd9Sstevel@tonic-gate t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f); 33757c478bd9Sstevel@tonic-gate if (t < 19) 33767c478bd9Sstevel@tonic-gate t = 19; 33777c478bd9Sstevel@tonic-gate if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL) 33787c478bd9Sstevel@tonic-gate { 33797c478bd9Sstevel@tonic-gate r = Z_MEM_ERROR; 33807c478bd9Sstevel@tonic-gate LEAVE 33817c478bd9Sstevel@tonic-gate } 33827c478bd9Sstevel@tonic-gate s->sub.trees.nblens = t; 33837c478bd9Sstevel@tonic-gate DUMPBITS(14) 33847c478bd9Sstevel@tonic-gate s->sub.trees.index = 0; 33857c478bd9Sstevel@tonic-gate Tracev((stderr, "inflate: table sizes ok\n")); 33867c478bd9Sstevel@tonic-gate s->mode = BTREE; 33877c478bd9Sstevel@tonic-gate case BTREE: 33887c478bd9Sstevel@tonic-gate while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10)) 33897c478bd9Sstevel@tonic-gate { 33907c478bd9Sstevel@tonic-gate NEEDBITS(3) 33917c478bd9Sstevel@tonic-gate s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7; 33927c478bd9Sstevel@tonic-gate DUMPBITS(3) 33937c478bd9Sstevel@tonic-gate } 33947c478bd9Sstevel@tonic-gate while (s->sub.trees.index < 19) 33957c478bd9Sstevel@tonic-gate s->sub.trees.blens[border[s->sub.trees.index++]] = 0; 33967c478bd9Sstevel@tonic-gate s->sub.trees.bb = 7; 33977c478bd9Sstevel@tonic-gate t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb, 33987c478bd9Sstevel@tonic-gate &s->sub.trees.tb, z); 33997c478bd9Sstevel@tonic-gate if (t != Z_OK) 34007c478bd9Sstevel@tonic-gate { 34017c478bd9Sstevel@tonic-gate r = t; 34027c478bd9Sstevel@tonic-gate if (r == Z_DATA_ERROR) 34037c478bd9Sstevel@tonic-gate s->mode = BADB; 34047c478bd9Sstevel@tonic-gate LEAVE 34057c478bd9Sstevel@tonic-gate } 34067c478bd9Sstevel@tonic-gate s->sub.trees.index = 0; 34077c478bd9Sstevel@tonic-gate Tracev((stderr, "inflate: bits tree ok\n")); 34087c478bd9Sstevel@tonic-gate s->mode = DTREE; 34097c478bd9Sstevel@tonic-gate case DTREE: 34107c478bd9Sstevel@tonic-gate while (t = s->sub.trees.table, 34117c478bd9Sstevel@tonic-gate s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f)) 34127c478bd9Sstevel@tonic-gate { 34137c478bd9Sstevel@tonic-gate inflate_huft *h; 34147c478bd9Sstevel@tonic-gate uInt i, j, c; 34157c478bd9Sstevel@tonic-gate 34167c478bd9Sstevel@tonic-gate t = s->sub.trees.bb; 34177c478bd9Sstevel@tonic-gate NEEDBITS(t) 34187c478bd9Sstevel@tonic-gate h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]); 34197c478bd9Sstevel@tonic-gate t = h->word.what.Bits; 34207c478bd9Sstevel@tonic-gate c = h->more.Base; 34217c478bd9Sstevel@tonic-gate if (c < 16) 34227c478bd9Sstevel@tonic-gate { 34237c478bd9Sstevel@tonic-gate DUMPBITS(t) 34247c478bd9Sstevel@tonic-gate s->sub.trees.blens[s->sub.trees.index++] = c; 34257c478bd9Sstevel@tonic-gate } 34267c478bd9Sstevel@tonic-gate else /* c == 16..18 */ 34277c478bd9Sstevel@tonic-gate { 34287c478bd9Sstevel@tonic-gate i = c == 18 ? 7 : c - 14; 34297c478bd9Sstevel@tonic-gate j = c == 18 ? 11 : 3; 34307c478bd9Sstevel@tonic-gate NEEDBITS(t + i) 34317c478bd9Sstevel@tonic-gate DUMPBITS(t) 34327c478bd9Sstevel@tonic-gate j += (uInt)b & inflate_mask[i]; 34337c478bd9Sstevel@tonic-gate DUMPBITS(i) 34347c478bd9Sstevel@tonic-gate i = s->sub.trees.index; 34357c478bd9Sstevel@tonic-gate t = s->sub.trees.table; 34367c478bd9Sstevel@tonic-gate if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) || 34377c478bd9Sstevel@tonic-gate (c == 16 && i < 1)) 34387c478bd9Sstevel@tonic-gate { 34397c478bd9Sstevel@tonic-gate s->mode = BADB; 34407c478bd9Sstevel@tonic-gate z->msg = "invalid bit length repeat"; 34417c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 34427c478bd9Sstevel@tonic-gate LEAVE 34437c478bd9Sstevel@tonic-gate } 34447c478bd9Sstevel@tonic-gate c = c == 16 ? s->sub.trees.blens[i - 1] : 0; 34457c478bd9Sstevel@tonic-gate do { 34467c478bd9Sstevel@tonic-gate s->sub.trees.blens[i++] = c; 34477c478bd9Sstevel@tonic-gate } while (--j); 34487c478bd9Sstevel@tonic-gate s->sub.trees.index = i; 34497c478bd9Sstevel@tonic-gate } 34507c478bd9Sstevel@tonic-gate } 34517c478bd9Sstevel@tonic-gate inflate_trees_free(s->sub.trees.tb, z); 34527c478bd9Sstevel@tonic-gate s->sub.trees.tb = Z_NULL; 34537c478bd9Sstevel@tonic-gate { 34547c478bd9Sstevel@tonic-gate uInt bl, bd; 34557c478bd9Sstevel@tonic-gate inflate_huft *tl, *td; 34567c478bd9Sstevel@tonic-gate inflate_codes_statef *c; 34577c478bd9Sstevel@tonic-gate 34587c478bd9Sstevel@tonic-gate bl = 9; /* must be <= 9 for lookahead assumptions */ 34597c478bd9Sstevel@tonic-gate bd = 6; /* must be <= 9 for lookahead assumptions */ 34607c478bd9Sstevel@tonic-gate t = s->sub.trees.table; 34617c478bd9Sstevel@tonic-gate t = inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), 34627c478bd9Sstevel@tonic-gate s->sub.trees.blens, &bl, &bd, &tl, &td, z); 34637c478bd9Sstevel@tonic-gate if (t != Z_OK) 34647c478bd9Sstevel@tonic-gate { 34657c478bd9Sstevel@tonic-gate if (t == (uInt)Z_DATA_ERROR) 34667c478bd9Sstevel@tonic-gate s->mode = BADB; 34677c478bd9Sstevel@tonic-gate r = t; 34687c478bd9Sstevel@tonic-gate LEAVE 34697c478bd9Sstevel@tonic-gate } 34707c478bd9Sstevel@tonic-gate Tracev((stderr, "inflate: trees ok\n")); 34717c478bd9Sstevel@tonic-gate if ((c = inflate_codes_new(bl, bd, tl, td, z)) == Z_NULL) 34727c478bd9Sstevel@tonic-gate { 34737c478bd9Sstevel@tonic-gate inflate_trees_free(td, z); 34747c478bd9Sstevel@tonic-gate inflate_trees_free(tl, z); 34757c478bd9Sstevel@tonic-gate r = Z_MEM_ERROR; 34767c478bd9Sstevel@tonic-gate LEAVE 34777c478bd9Sstevel@tonic-gate } 34787c478bd9Sstevel@tonic-gate ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt)); 34797c478bd9Sstevel@tonic-gate s->sub.decode.codes = c; 34807c478bd9Sstevel@tonic-gate s->sub.decode.tl = tl; 34817c478bd9Sstevel@tonic-gate s->sub.decode.td = td; 34827c478bd9Sstevel@tonic-gate } 34837c478bd9Sstevel@tonic-gate s->mode = CODES; 3484*5b85b345SToomas Soome /* FALLTHROUGH */ 34857c478bd9Sstevel@tonic-gate case CODES: 34867c478bd9Sstevel@tonic-gate UPDATE 34877c478bd9Sstevel@tonic-gate if ((r = inflate_codes(s, z, r)) != Z_STREAM_END) 34887c478bd9Sstevel@tonic-gate return inflate_flush(s, z, r); 34897c478bd9Sstevel@tonic-gate r = Z_OK; 34907c478bd9Sstevel@tonic-gate inflate_codes_free(s->sub.decode.codes, z); 34917c478bd9Sstevel@tonic-gate inflate_trees_free(s->sub.decode.td, z); 34927c478bd9Sstevel@tonic-gate inflate_trees_free(s->sub.decode.tl, z); 34937c478bd9Sstevel@tonic-gate LOAD 34947c478bd9Sstevel@tonic-gate Tracev((stderr, "inflate: codes end, %lu total out\n", 34957c478bd9Sstevel@tonic-gate z->total_out + (q >= s->read ? q - s->read : 34967c478bd9Sstevel@tonic-gate (s->end - s->read) + (q - s->window)))); 34977c478bd9Sstevel@tonic-gate if (!s->last) 34987c478bd9Sstevel@tonic-gate { 34997c478bd9Sstevel@tonic-gate s->mode = TYPE; 35007c478bd9Sstevel@tonic-gate break; 35017c478bd9Sstevel@tonic-gate } 35027c478bd9Sstevel@tonic-gate if (k > 7) /* return unused byte, if any */ 35037c478bd9Sstevel@tonic-gate { 35047c478bd9Sstevel@tonic-gate Assert(k < 16, "inflate_codes grabbed too many bytes") 35057c478bd9Sstevel@tonic-gate k -= 8; 35067c478bd9Sstevel@tonic-gate n++; 35077c478bd9Sstevel@tonic-gate p--; /* can always return one */ 35087c478bd9Sstevel@tonic-gate } 35097c478bd9Sstevel@tonic-gate s->mode = DRY; 3510*5b85b345SToomas Soome /* FALLTHROUGH */ 35117c478bd9Sstevel@tonic-gate case DRY: 35127c478bd9Sstevel@tonic-gate FLUSH 35137c478bd9Sstevel@tonic-gate if (s->read != s->write) 35147c478bd9Sstevel@tonic-gate LEAVE 35157c478bd9Sstevel@tonic-gate s->mode = DONEB; 3516*5b85b345SToomas Soome /* FALLTHROUGH */ 35177c478bd9Sstevel@tonic-gate case DONEB: 35187c478bd9Sstevel@tonic-gate r = Z_STREAM_END; 35197c478bd9Sstevel@tonic-gate LEAVE 35207c478bd9Sstevel@tonic-gate case BADB: 35217c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 35227c478bd9Sstevel@tonic-gate LEAVE 35237c478bd9Sstevel@tonic-gate default: 35247c478bd9Sstevel@tonic-gate r = Z_STREAM_ERROR; 35257c478bd9Sstevel@tonic-gate LEAVE 35267c478bd9Sstevel@tonic-gate } 35277c478bd9Sstevel@tonic-gate } 35287c478bd9Sstevel@tonic-gate 35297c478bd9Sstevel@tonic-gate 35307c478bd9Sstevel@tonic-gate local int inflate_blocks_free(s, z, c) 35317c478bd9Sstevel@tonic-gate inflate_blocks_statef *s; 35327c478bd9Sstevel@tonic-gate z_stream *z; 35337c478bd9Sstevel@tonic-gate uLongf *c; 35347c478bd9Sstevel@tonic-gate { 35357c478bd9Sstevel@tonic-gate inflate_blocks_reset(s, z, c); 35367c478bd9Sstevel@tonic-gate ZFREE(z, s->window, s->end - s->window); 35377c478bd9Sstevel@tonic-gate ZFREE(z, s, sizeof(struct inflate_blocks_state)); 35387c478bd9Sstevel@tonic-gate Trace((stderr, "inflate: blocks freed\n")); 35397c478bd9Sstevel@tonic-gate return Z_OK; 35407c478bd9Sstevel@tonic-gate } 35417c478bd9Sstevel@tonic-gate 35427c478bd9Sstevel@tonic-gate /* 35437c478bd9Sstevel@tonic-gate * This subroutine adds the data at next_in/avail_in to the output history 35447c478bd9Sstevel@tonic-gate * without performing any output. The output buffer must be "caught up"; 35457c478bd9Sstevel@tonic-gate * i.e. no pending output (hence s->read equals s->write), and the state must 35467c478bd9Sstevel@tonic-gate * be BLOCKS (i.e. we should be willing to see the start of a series of 35477c478bd9Sstevel@tonic-gate * BLOCKS). On exit, the output will also be caught up, and the checksum 35487c478bd9Sstevel@tonic-gate * will have been updated if need be. 35497c478bd9Sstevel@tonic-gate */ 35507c478bd9Sstevel@tonic-gate local int inflate_addhistory(s, z) 35517c478bd9Sstevel@tonic-gate inflate_blocks_statef *s; 35527c478bd9Sstevel@tonic-gate z_stream *z; 35537c478bd9Sstevel@tonic-gate { 35547c478bd9Sstevel@tonic-gate uLong b; /* bit buffer */ /* NOT USED HERE */ 35557c478bd9Sstevel@tonic-gate uInt k; /* bits in bit buffer */ /* NOT USED HERE */ 35567c478bd9Sstevel@tonic-gate uInt t; /* temporary storage */ 35577c478bd9Sstevel@tonic-gate Bytef *p; /* input data pointer */ 35587c478bd9Sstevel@tonic-gate uInt n; /* bytes available there */ 35597c478bd9Sstevel@tonic-gate Bytef *q; /* output window write pointer */ 35607c478bd9Sstevel@tonic-gate uInt m; /* bytes to end of window or read pointer */ 35617c478bd9Sstevel@tonic-gate 35627c478bd9Sstevel@tonic-gate if (s->read != s->write) 35637c478bd9Sstevel@tonic-gate return Z_STREAM_ERROR; 35647c478bd9Sstevel@tonic-gate if (s->mode != TYPE) 35657c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 35667c478bd9Sstevel@tonic-gate 35677c478bd9Sstevel@tonic-gate /* we're ready to rock */ 35687c478bd9Sstevel@tonic-gate LOAD 35697c478bd9Sstevel@tonic-gate /* while there is input ready, copy to output buffer, moving 35707c478bd9Sstevel@tonic-gate * pointers as needed. 35717c478bd9Sstevel@tonic-gate */ 35727c478bd9Sstevel@tonic-gate while (n) { 35737c478bd9Sstevel@tonic-gate t = n; /* how many to do */ 35747c478bd9Sstevel@tonic-gate /* is there room until end of buffer? */ 35757c478bd9Sstevel@tonic-gate if (t > m) t = m; 35767c478bd9Sstevel@tonic-gate /* update check information */ 35777c478bd9Sstevel@tonic-gate if (s->checkfn != Z_NULL) 35787c478bd9Sstevel@tonic-gate s->check = (*s->checkfn)(s->check, q, t); 35797c478bd9Sstevel@tonic-gate zmemcpy(q, p, t); 35807c478bd9Sstevel@tonic-gate q += t; 35817c478bd9Sstevel@tonic-gate p += t; 35827c478bd9Sstevel@tonic-gate n -= t; 35837c478bd9Sstevel@tonic-gate z->total_out += t; 35847c478bd9Sstevel@tonic-gate s->read = q; /* drag read pointer forward */ 35857c478bd9Sstevel@tonic-gate /* WRAP */ /* expand WRAP macro by hand to handle s->read */ 35867c478bd9Sstevel@tonic-gate if (q == s->end) { 35877c478bd9Sstevel@tonic-gate s->read = q = s->window; 35887c478bd9Sstevel@tonic-gate m = WAVAIL; 35897c478bd9Sstevel@tonic-gate } 35907c478bd9Sstevel@tonic-gate } 35917c478bd9Sstevel@tonic-gate UPDATE 35927c478bd9Sstevel@tonic-gate return Z_OK; 35937c478bd9Sstevel@tonic-gate } 35947c478bd9Sstevel@tonic-gate 35957c478bd9Sstevel@tonic-gate 35967c478bd9Sstevel@tonic-gate /* 35977c478bd9Sstevel@tonic-gate * At the end of a Deflate-compressed PPP packet, we expect to have seen 35987c478bd9Sstevel@tonic-gate * a `stored' block type value but not the (zero) length bytes. 35997c478bd9Sstevel@tonic-gate */ 36007c478bd9Sstevel@tonic-gate local int inflate_packet_flush(s) 36017c478bd9Sstevel@tonic-gate inflate_blocks_statef *s; 36027c478bd9Sstevel@tonic-gate { 36037c478bd9Sstevel@tonic-gate if (s->mode != LENS) 36047c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 36057c478bd9Sstevel@tonic-gate s->mode = TYPE; 36067c478bd9Sstevel@tonic-gate return Z_OK; 36077c478bd9Sstevel@tonic-gate } 36087c478bd9Sstevel@tonic-gate 36097c478bd9Sstevel@tonic-gate 36107c478bd9Sstevel@tonic-gate /*+++++*/ 36117c478bd9Sstevel@tonic-gate /* inftrees.c -- generate Huffman trees for efficient decoding 36127c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 36137c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 36147c478bd9Sstevel@tonic-gate */ 36157c478bd9Sstevel@tonic-gate 36167c478bd9Sstevel@tonic-gate /* simplify the use of the inflate_huft type with some defines */ 36177c478bd9Sstevel@tonic-gate #define base more.Base 36187c478bd9Sstevel@tonic-gate #define next more.Next 36197c478bd9Sstevel@tonic-gate #define exop word.what.Exop 36207c478bd9Sstevel@tonic-gate #define bits word.what.Bits 36217c478bd9Sstevel@tonic-gate 36227c478bd9Sstevel@tonic-gate 36237c478bd9Sstevel@tonic-gate local int huft_build OF(( 36247c478bd9Sstevel@tonic-gate uIntf *, /* code lengths in bits */ 36257c478bd9Sstevel@tonic-gate uInt, /* number of codes */ 36267c478bd9Sstevel@tonic-gate uInt, /* number of "simple" codes */ 36277c478bd9Sstevel@tonic-gate uIntf *, /* list of base values for non-simple codes */ 36287c478bd9Sstevel@tonic-gate uIntf *, /* list of extra bits for non-simple codes */ 36297c478bd9Sstevel@tonic-gate inflate_huft * FAR*,/* result: starting table */ 36307c478bd9Sstevel@tonic-gate uIntf *, /* maximum lookup bits (returns actual) */ 36317c478bd9Sstevel@tonic-gate z_stream *)); /* for zalloc function */ 36327c478bd9Sstevel@tonic-gate 36337c478bd9Sstevel@tonic-gate local voidpf falloc OF(( 36347c478bd9Sstevel@tonic-gate voidpf, /* opaque pointer (not used) */ 36357c478bd9Sstevel@tonic-gate uInt, /* number of items */ 36367c478bd9Sstevel@tonic-gate uInt)); /* size of item */ 36377c478bd9Sstevel@tonic-gate 36387c478bd9Sstevel@tonic-gate local void ffree OF(( 36397c478bd9Sstevel@tonic-gate voidpf q, /* opaque pointer (not used) */ 36407c478bd9Sstevel@tonic-gate voidpf p, /* what to free (not used) */ 36417c478bd9Sstevel@tonic-gate uInt n)); /* number of bytes (not used) */ 36427c478bd9Sstevel@tonic-gate 36437c478bd9Sstevel@tonic-gate /* Tables for deflate from PKZIP's appnote.txt. */ 36447c478bd9Sstevel@tonic-gate local uInt cplens[] = { /* Copy lengths for literal codes 257..285 */ 36457c478bd9Sstevel@tonic-gate 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 36467c478bd9Sstevel@tonic-gate 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; 36477c478bd9Sstevel@tonic-gate /* actually lengths - 2; also see note #13 above about 258 */ 36487c478bd9Sstevel@tonic-gate local uInt cplext[] = { /* Extra bits for literal codes 257..285 */ 36497c478bd9Sstevel@tonic-gate 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 36507c478bd9Sstevel@tonic-gate 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 192, 192}; /* 192==invalid */ 36517c478bd9Sstevel@tonic-gate local uInt cpdist[] = { /* Copy offsets for distance codes 0..29 */ 36527c478bd9Sstevel@tonic-gate 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 36537c478bd9Sstevel@tonic-gate 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 36547c478bd9Sstevel@tonic-gate 8193, 12289, 16385, 24577}; 36557c478bd9Sstevel@tonic-gate local uInt cpdext[] = { /* Extra bits for distance codes */ 36567c478bd9Sstevel@tonic-gate 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 36577c478bd9Sstevel@tonic-gate 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 36587c478bd9Sstevel@tonic-gate 12, 12, 13, 13}; 36597c478bd9Sstevel@tonic-gate 36607c478bd9Sstevel@tonic-gate /* 36617c478bd9Sstevel@tonic-gate Huffman code decoding is performed using a multi-level table lookup. 36627c478bd9Sstevel@tonic-gate The fastest way to decode is to simply build a lookup table whose 36637c478bd9Sstevel@tonic-gate size is determined by the longest code. However, the time it takes 36647c478bd9Sstevel@tonic-gate to build this table can also be a factor if the data being decoded 36657c478bd9Sstevel@tonic-gate is not very long. The most common codes are necessarily the 36667c478bd9Sstevel@tonic-gate shortest codes, so those codes dominate the decoding time, and hence 36677c478bd9Sstevel@tonic-gate the speed. The idea is you can have a shorter table that decodes the 36687c478bd9Sstevel@tonic-gate shorter, more probable codes, and then point to subsidiary tables for 36697c478bd9Sstevel@tonic-gate the longer codes. The time it costs to decode the longer codes is 36707c478bd9Sstevel@tonic-gate then traded against the time it takes to make longer tables. 36717c478bd9Sstevel@tonic-gate 36727c478bd9Sstevel@tonic-gate This results of this trade are in the variables lbits and dbits 36737c478bd9Sstevel@tonic-gate below. lbits is the number of bits the first level table for literal/ 36747c478bd9Sstevel@tonic-gate length codes can decode in one step, and dbits is the same thing for 36757c478bd9Sstevel@tonic-gate the distance codes. Subsequent tables are also less than or equal to 36767c478bd9Sstevel@tonic-gate those sizes. These values may be adjusted either when all of the 36777c478bd9Sstevel@tonic-gate codes are shorter than that, in which case the longest code length in 36787c478bd9Sstevel@tonic-gate bits is used, or when the shortest code is *longer* than the requested 36797c478bd9Sstevel@tonic-gate table size, in which case the length of the shortest code in bits is 36807c478bd9Sstevel@tonic-gate used. 36817c478bd9Sstevel@tonic-gate 36827c478bd9Sstevel@tonic-gate There are two different values for the two tables, since they code a 36837c478bd9Sstevel@tonic-gate different number of possibilities each. The literal/length table 36847c478bd9Sstevel@tonic-gate codes 286 possible values, or in a flat code, a little over eight 36857c478bd9Sstevel@tonic-gate bits. The distance table codes 30 possible values, or a little less 36867c478bd9Sstevel@tonic-gate than five bits, flat. The optimum values for speed end up being 36877c478bd9Sstevel@tonic-gate about one bit more than those, so lbits is 8+1 and dbits is 5+1. 36887c478bd9Sstevel@tonic-gate The optimum values may differ though from machine to machine, and 36897c478bd9Sstevel@tonic-gate possibly even between compilers. Your mileage may vary. 36907c478bd9Sstevel@tonic-gate */ 36917c478bd9Sstevel@tonic-gate 36927c478bd9Sstevel@tonic-gate 36937c478bd9Sstevel@tonic-gate /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */ 36947c478bd9Sstevel@tonic-gate #define BMAX 15 /* maximum bit length of any code */ 36957c478bd9Sstevel@tonic-gate #define N_MAX 288 /* maximum number of codes in any set */ 36967c478bd9Sstevel@tonic-gate 36977c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 36987c478bd9Sstevel@tonic-gate uInt inflate_hufts; 36997c478bd9Sstevel@tonic-gate #endif 37007c478bd9Sstevel@tonic-gate 37017c478bd9Sstevel@tonic-gate local int huft_build(b, n, s, d, e, t, m, zs) 37027c478bd9Sstevel@tonic-gate uIntf *b; /* code lengths in bits (all assumed <= BMAX) */ 37037c478bd9Sstevel@tonic-gate uInt n; /* number of codes (assumed <= N_MAX) */ 37047c478bd9Sstevel@tonic-gate uInt s; /* number of simple-valued codes (0..s-1) */ 37057c478bd9Sstevel@tonic-gate uIntf *d; /* list of base values for non-simple codes */ 37067c478bd9Sstevel@tonic-gate uIntf *e; /* list of extra bits for non-simple codes */ 37077c478bd9Sstevel@tonic-gate inflate_huft * FAR *t; /* result: starting table */ 37087c478bd9Sstevel@tonic-gate uIntf *m; /* maximum lookup bits, returns actual */ 37097c478bd9Sstevel@tonic-gate z_stream *zs; /* for zalloc function */ 37107c478bd9Sstevel@tonic-gate /* Given a list of code lengths and a maximum table size, make a set of 37117c478bd9Sstevel@tonic-gate tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR 37127c478bd9Sstevel@tonic-gate if the given code set is incomplete (the tables are still built in this 37137c478bd9Sstevel@tonic-gate case), Z_DATA_ERROR if the input is invalid (all zero length codes or an 37147c478bd9Sstevel@tonic-gate over-subscribed set of lengths), or Z_MEM_ERROR if not enough memory. */ 37157c478bd9Sstevel@tonic-gate { 37167c478bd9Sstevel@tonic-gate 37177c478bd9Sstevel@tonic-gate uInt a; /* counter for codes of length k */ 37187c478bd9Sstevel@tonic-gate uInt c[BMAX+1]; /* bit length count table */ 37197c478bd9Sstevel@tonic-gate uInt f; /* i repeats in table every f entries */ 37207c478bd9Sstevel@tonic-gate int g; /* maximum code length */ 37217c478bd9Sstevel@tonic-gate int h; /* table level */ 37227c478bd9Sstevel@tonic-gate register uInt i; /* counter, current code */ 37237c478bd9Sstevel@tonic-gate register uInt j; /* counter */ 37247c478bd9Sstevel@tonic-gate register int k; /* number of bits in current code */ 37257c478bd9Sstevel@tonic-gate int l; /* bits per table (returned in m) */ 37267c478bd9Sstevel@tonic-gate register uIntf *p; /* pointer into c[], b[], or v[] */ 37277c478bd9Sstevel@tonic-gate inflate_huft *q; /* points to current table */ 37287c478bd9Sstevel@tonic-gate struct inflate_huft_s r; /* table entry for structure assignment */ 37297c478bd9Sstevel@tonic-gate inflate_huft *u[BMAX]; /* table stack */ 37307c478bd9Sstevel@tonic-gate uInt v[N_MAX]; /* values in order of bit length */ 37317c478bd9Sstevel@tonic-gate register int w; /* bits before this table == (l * h) */ 37327c478bd9Sstevel@tonic-gate uInt x[BMAX+1]; /* bit offsets, then code stack */ 37337c478bd9Sstevel@tonic-gate uIntf *xp; /* pointer into x */ 37347c478bd9Sstevel@tonic-gate int y; /* number of dummy codes added */ 37357c478bd9Sstevel@tonic-gate uInt z; /* number of entries in current table */ 37367c478bd9Sstevel@tonic-gate 37377c478bd9Sstevel@tonic-gate 37387c478bd9Sstevel@tonic-gate /* Generate counts for each bit length */ 37397c478bd9Sstevel@tonic-gate p = c; 37407c478bd9Sstevel@tonic-gate #define C0 *p++ = 0; 37417c478bd9Sstevel@tonic-gate #define C2 C0 C0 C0 C0 37427c478bd9Sstevel@tonic-gate #define C4 C2 C2 C2 C2 37437c478bd9Sstevel@tonic-gate C4 /* clear c[]--assume BMAX+1 is 16 */ 37447c478bd9Sstevel@tonic-gate p = b; i = n; 37457c478bd9Sstevel@tonic-gate do { 37467c478bd9Sstevel@tonic-gate c[*p++]++; /* assume all entries <= BMAX */ 37477c478bd9Sstevel@tonic-gate } while (--i); 37487c478bd9Sstevel@tonic-gate if (c[0] == n) /* null input--all zero length codes */ 37497c478bd9Sstevel@tonic-gate { 37507c478bd9Sstevel@tonic-gate *t = (inflate_huft *)Z_NULL; 37517c478bd9Sstevel@tonic-gate *m = 0; 37527c478bd9Sstevel@tonic-gate return Z_OK; 37537c478bd9Sstevel@tonic-gate } 37547c478bd9Sstevel@tonic-gate 37557c478bd9Sstevel@tonic-gate 37567c478bd9Sstevel@tonic-gate /* Find minimum and maximum length, bound *m by those */ 37577c478bd9Sstevel@tonic-gate l = *m; 37587c478bd9Sstevel@tonic-gate for (j = 1; j <= BMAX; j++) 37597c478bd9Sstevel@tonic-gate if (c[j]) 37607c478bd9Sstevel@tonic-gate break; 37617c478bd9Sstevel@tonic-gate k = j; /* minimum code length */ 37627c478bd9Sstevel@tonic-gate if ((uInt)l < j) 37637c478bd9Sstevel@tonic-gate l = j; 37647c478bd9Sstevel@tonic-gate for (i = BMAX; i; i--) 37657c478bd9Sstevel@tonic-gate if (c[i]) 37667c478bd9Sstevel@tonic-gate break; 37677c478bd9Sstevel@tonic-gate g = i; /* maximum code length */ 37687c478bd9Sstevel@tonic-gate if ((uInt)l > i) 37697c478bd9Sstevel@tonic-gate l = i; 37707c478bd9Sstevel@tonic-gate *m = l; 37717c478bd9Sstevel@tonic-gate 37727c478bd9Sstevel@tonic-gate 37737c478bd9Sstevel@tonic-gate /* Adjust last length count to fill out codes, if needed */ 37747c478bd9Sstevel@tonic-gate for (y = 1 << j; j < i; j++, y <<= 1) 37757c478bd9Sstevel@tonic-gate if ((y -= c[j]) < 0) 37767c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 37777c478bd9Sstevel@tonic-gate if ((y -= c[i]) < 0) 37787c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 37797c478bd9Sstevel@tonic-gate c[i] += y; 37807c478bd9Sstevel@tonic-gate 37817c478bd9Sstevel@tonic-gate 37827c478bd9Sstevel@tonic-gate /* Generate starting offsets into the value table for each length */ 37837c478bd9Sstevel@tonic-gate x[1] = j = 0; 37847c478bd9Sstevel@tonic-gate p = c + 1; xp = x + 2; 37857c478bd9Sstevel@tonic-gate while (--i) { /* note that i == g from above */ 37867c478bd9Sstevel@tonic-gate *xp++ = (j += *p++); 37877c478bd9Sstevel@tonic-gate } 37887c478bd9Sstevel@tonic-gate 37897c478bd9Sstevel@tonic-gate 37907c478bd9Sstevel@tonic-gate /* Make a table of values in order of bit lengths */ 37917c478bd9Sstevel@tonic-gate p = b; i = 0; 37927c478bd9Sstevel@tonic-gate do { 37937c478bd9Sstevel@tonic-gate if ((j = *p++) != 0) 37947c478bd9Sstevel@tonic-gate v[x[j]++] = i; 37957c478bd9Sstevel@tonic-gate } while (++i < n); 37967c478bd9Sstevel@tonic-gate 37977c478bd9Sstevel@tonic-gate 37987c478bd9Sstevel@tonic-gate /* Generate the Huffman codes and for each, make the table entries */ 37997c478bd9Sstevel@tonic-gate x[0] = i = 0; /* first Huffman code is zero */ 38007c478bd9Sstevel@tonic-gate p = v; /* grab values in bit order */ 38017c478bd9Sstevel@tonic-gate h = -1; /* no tables yet--level -1 */ 38027c478bd9Sstevel@tonic-gate w = -l; /* bits decoded == (l * h) */ 38037c478bd9Sstevel@tonic-gate u[0] = (inflate_huft *)Z_NULL; /* just to keep compilers happy */ 38047c478bd9Sstevel@tonic-gate q = (inflate_huft *)Z_NULL; /* ditto */ 38057c478bd9Sstevel@tonic-gate z = 0; /* ditto */ 38067c478bd9Sstevel@tonic-gate 38077c478bd9Sstevel@tonic-gate /* go through the bit lengths (k already is bits in shortest code) */ 38087c478bd9Sstevel@tonic-gate for (; k <= g; k++) 38097c478bd9Sstevel@tonic-gate { 38107c478bd9Sstevel@tonic-gate a = c[k]; 38117c478bd9Sstevel@tonic-gate while (a--) 38127c478bd9Sstevel@tonic-gate { 38137c478bd9Sstevel@tonic-gate /* here i is the Huffman code of length k bits for value *p */ 38147c478bd9Sstevel@tonic-gate /* make tables up to required level */ 38157c478bd9Sstevel@tonic-gate while (k > w + l) 38167c478bd9Sstevel@tonic-gate { 38177c478bd9Sstevel@tonic-gate h++; 38187c478bd9Sstevel@tonic-gate w += l; /* previous table always l bits */ 38197c478bd9Sstevel@tonic-gate 38207c478bd9Sstevel@tonic-gate /* compute minimum size table less than or equal to l bits */ 38217c478bd9Sstevel@tonic-gate z = (z = g - w) > (uInt)l ? l : z; /* table size upper limit */ 38227c478bd9Sstevel@tonic-gate if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */ 38237c478bd9Sstevel@tonic-gate { /* too few codes for k-w bit table */ 38247c478bd9Sstevel@tonic-gate f -= a + 1; /* deduct codes from patterns left */ 38257c478bd9Sstevel@tonic-gate xp = c + k; 38267c478bd9Sstevel@tonic-gate if (j < z) 38277c478bd9Sstevel@tonic-gate while (++j < z) /* try smaller tables up to z bits */ 38287c478bd9Sstevel@tonic-gate { 38297c478bd9Sstevel@tonic-gate if ((f <<= 1) <= *++xp) 38307c478bd9Sstevel@tonic-gate break; /* enough codes to use up j bits */ 38317c478bd9Sstevel@tonic-gate f -= *xp; /* else deduct codes from patterns */ 38327c478bd9Sstevel@tonic-gate } 38337c478bd9Sstevel@tonic-gate } 38347c478bd9Sstevel@tonic-gate z = 1 << j; /* table entries for j-bit table */ 38357c478bd9Sstevel@tonic-gate 38367c478bd9Sstevel@tonic-gate /* allocate and link in new table */ 38377c478bd9Sstevel@tonic-gate if ((q = (inflate_huft *)ZALLOC 38387c478bd9Sstevel@tonic-gate (zs,z + 1,sizeof(inflate_huft))) == Z_NULL) 38397c478bd9Sstevel@tonic-gate { 38407c478bd9Sstevel@tonic-gate if (h) 38417c478bd9Sstevel@tonic-gate inflate_trees_free(u[0], zs); 38427c478bd9Sstevel@tonic-gate return Z_MEM_ERROR; /* not enough memory */ 38437c478bd9Sstevel@tonic-gate } 38447c478bd9Sstevel@tonic-gate q->word.Nalloc = z + 1; 38457c478bd9Sstevel@tonic-gate #ifdef DEBUG_ZLIB 38467c478bd9Sstevel@tonic-gate inflate_hufts += z + 1; 38477c478bd9Sstevel@tonic-gate #endif 38487c478bd9Sstevel@tonic-gate *t = q + 1; /* link to list for huft_free() */ 38497c478bd9Sstevel@tonic-gate *(t = &(q->next)) = Z_NULL; 38507c478bd9Sstevel@tonic-gate u[h] = ++q; /* table starts after link */ 38517c478bd9Sstevel@tonic-gate 38527c478bd9Sstevel@tonic-gate /* connect to last table, if there is one */ 38537c478bd9Sstevel@tonic-gate if (h) 38547c478bd9Sstevel@tonic-gate { 38557c478bd9Sstevel@tonic-gate x[h] = i; /* save pattern for backing up */ 38567c478bd9Sstevel@tonic-gate r.bits = (Byte)l; /* bits to dump before this table */ 38577c478bd9Sstevel@tonic-gate r.exop = (Byte)j; /* bits in this table */ 38587c478bd9Sstevel@tonic-gate r.next = q; /* pointer to this table */ 38597c478bd9Sstevel@tonic-gate j = i >> (w - l); /* (get around Turbo C bug) */ 38607c478bd9Sstevel@tonic-gate u[h-1][j] = r; /* connect to last table */ 38617c478bd9Sstevel@tonic-gate } 38627c478bd9Sstevel@tonic-gate } 38637c478bd9Sstevel@tonic-gate 38647c478bd9Sstevel@tonic-gate /* set up table entry in r */ 38657c478bd9Sstevel@tonic-gate r.bits = (Byte)(k - w); 38667c478bd9Sstevel@tonic-gate if (p >= v + n) 38677c478bd9Sstevel@tonic-gate r.exop = 128 + 64; /* out of values--invalid code */ 38687c478bd9Sstevel@tonic-gate else if (*p < s) 38697c478bd9Sstevel@tonic-gate { 38707c478bd9Sstevel@tonic-gate r.exop = (Byte)(*p < 256 ? 0 : 32 + 64); /* 256 is end-of-block */ 38717c478bd9Sstevel@tonic-gate r.base = *p++; /* simple code is just the value */ 38727c478bd9Sstevel@tonic-gate } 38737c478bd9Sstevel@tonic-gate else 38747c478bd9Sstevel@tonic-gate { 38757c478bd9Sstevel@tonic-gate r.exop = (Byte)e[*p - s] + 16 + 64; /* non-simple--look up in lists */ 38767c478bd9Sstevel@tonic-gate r.base = d[*p++ - s]; 38777c478bd9Sstevel@tonic-gate } 38787c478bd9Sstevel@tonic-gate 38797c478bd9Sstevel@tonic-gate /* fill code-like entries with r */ 38807c478bd9Sstevel@tonic-gate f = 1 << (k - w); 38817c478bd9Sstevel@tonic-gate for (j = i >> w; j < z; j += f) 38827c478bd9Sstevel@tonic-gate q[j] = r; 38837c478bd9Sstevel@tonic-gate 38847c478bd9Sstevel@tonic-gate /* backwards increment the k-bit code i */ 38857c478bd9Sstevel@tonic-gate for (j = 1 << (k - 1); i & j; j >>= 1) 38867c478bd9Sstevel@tonic-gate i ^= j; 38877c478bd9Sstevel@tonic-gate i ^= j; 38887c478bd9Sstevel@tonic-gate 38897c478bd9Sstevel@tonic-gate /* backup over finished tables */ 38907c478bd9Sstevel@tonic-gate while ((i & ((1 << w) - 1)) != x[h]) 38917c478bd9Sstevel@tonic-gate { 38927c478bd9Sstevel@tonic-gate h--; /* don't need to update q */ 38937c478bd9Sstevel@tonic-gate w -= l; 38947c478bd9Sstevel@tonic-gate } 38957c478bd9Sstevel@tonic-gate } 38967c478bd9Sstevel@tonic-gate } 38977c478bd9Sstevel@tonic-gate 38987c478bd9Sstevel@tonic-gate 38997c478bd9Sstevel@tonic-gate /* Return Z_BUF_ERROR if we were given an incomplete table */ 39007c478bd9Sstevel@tonic-gate return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK; 39017c478bd9Sstevel@tonic-gate } 39027c478bd9Sstevel@tonic-gate 39037c478bd9Sstevel@tonic-gate 39047c478bd9Sstevel@tonic-gate local int inflate_trees_bits(c, bb, tb, z) 39057c478bd9Sstevel@tonic-gate uIntf *c; /* 19 code lengths */ 39067c478bd9Sstevel@tonic-gate uIntf *bb; /* bits tree desired/actual depth */ 39077c478bd9Sstevel@tonic-gate inflate_huft * FAR *tb; /* bits tree result */ 39087c478bd9Sstevel@tonic-gate z_stream *z; /* for zfree function */ 39097c478bd9Sstevel@tonic-gate { 39107c478bd9Sstevel@tonic-gate int r; 39117c478bd9Sstevel@tonic-gate 39127c478bd9Sstevel@tonic-gate r = huft_build(c, 19, 19, (uIntf*)Z_NULL, (uIntf*)Z_NULL, tb, bb, z); 39137c478bd9Sstevel@tonic-gate if (r == Z_DATA_ERROR) 39147c478bd9Sstevel@tonic-gate z->msg = "oversubscribed dynamic bit lengths tree"; 39157c478bd9Sstevel@tonic-gate else if (r == Z_BUF_ERROR) 39167c478bd9Sstevel@tonic-gate { 39177c478bd9Sstevel@tonic-gate inflate_trees_free(*tb, z); 39187c478bd9Sstevel@tonic-gate z->msg = "incomplete dynamic bit lengths tree"; 39197c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 39207c478bd9Sstevel@tonic-gate } 39217c478bd9Sstevel@tonic-gate return r; 39227c478bd9Sstevel@tonic-gate } 39237c478bd9Sstevel@tonic-gate 39247c478bd9Sstevel@tonic-gate 39257c478bd9Sstevel@tonic-gate local int inflate_trees_dynamic(nl, nd, c, bl, bd, tl, td, z) 39267c478bd9Sstevel@tonic-gate uInt nl; /* number of literal/length codes */ 39277c478bd9Sstevel@tonic-gate uInt nd; /* number of distance codes */ 39287c478bd9Sstevel@tonic-gate uIntf *c; /* that many (total) code lengths */ 39297c478bd9Sstevel@tonic-gate uIntf *bl; /* literal desired/actual bit depth */ 39307c478bd9Sstevel@tonic-gate uIntf *bd; /* distance desired/actual bit depth */ 39317c478bd9Sstevel@tonic-gate inflate_huft * FAR *tl; /* literal/length tree result */ 39327c478bd9Sstevel@tonic-gate inflate_huft * FAR *td; /* distance tree result */ 39337c478bd9Sstevel@tonic-gate z_stream *z; /* for zfree function */ 39347c478bd9Sstevel@tonic-gate { 39357c478bd9Sstevel@tonic-gate int r; 39367c478bd9Sstevel@tonic-gate 39377c478bd9Sstevel@tonic-gate /* build literal/length tree */ 39387c478bd9Sstevel@tonic-gate if ((r = huft_build(c, nl, 257, cplens, cplext, tl, bl, z)) != Z_OK) 39397c478bd9Sstevel@tonic-gate { 39407c478bd9Sstevel@tonic-gate if (r == Z_DATA_ERROR) 39417c478bd9Sstevel@tonic-gate z->msg = "oversubscribed literal/length tree"; 39427c478bd9Sstevel@tonic-gate else if (r == Z_BUF_ERROR) 39437c478bd9Sstevel@tonic-gate { 39447c478bd9Sstevel@tonic-gate inflate_trees_free(*tl, z); 39457c478bd9Sstevel@tonic-gate z->msg = "incomplete literal/length tree"; 39467c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 39477c478bd9Sstevel@tonic-gate } 39487c478bd9Sstevel@tonic-gate return r; 39497c478bd9Sstevel@tonic-gate } 39507c478bd9Sstevel@tonic-gate 39517c478bd9Sstevel@tonic-gate /* build distance tree */ 39527c478bd9Sstevel@tonic-gate if ((r = huft_build(c + nl, nd, 0, cpdist, cpdext, td, bd, z)) != Z_OK) 39537c478bd9Sstevel@tonic-gate { 39547c478bd9Sstevel@tonic-gate if (r == Z_DATA_ERROR) 39557c478bd9Sstevel@tonic-gate z->msg = "oversubscribed literal/length tree"; 39567c478bd9Sstevel@tonic-gate else if (r == Z_BUF_ERROR) { 39577c478bd9Sstevel@tonic-gate #ifdef PKZIP_BUG_WORKAROUND 39587c478bd9Sstevel@tonic-gate r = Z_OK; 39597c478bd9Sstevel@tonic-gate } 39607c478bd9Sstevel@tonic-gate #else 39617c478bd9Sstevel@tonic-gate inflate_trees_free(*td, z); 39627c478bd9Sstevel@tonic-gate z->msg = "incomplete literal/length tree"; 39637c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 39647c478bd9Sstevel@tonic-gate } 39657c478bd9Sstevel@tonic-gate inflate_trees_free(*tl, z); 39667c478bd9Sstevel@tonic-gate return r; 39677c478bd9Sstevel@tonic-gate #endif 39687c478bd9Sstevel@tonic-gate } 39697c478bd9Sstevel@tonic-gate 39707c478bd9Sstevel@tonic-gate /* done */ 39717c478bd9Sstevel@tonic-gate return Z_OK; 39727c478bd9Sstevel@tonic-gate } 39737c478bd9Sstevel@tonic-gate 39747c478bd9Sstevel@tonic-gate 39757c478bd9Sstevel@tonic-gate /* build fixed tables only once--keep them here */ 39767c478bd9Sstevel@tonic-gate local int fixed_lock = 0; 39777c478bd9Sstevel@tonic-gate local int fixed_built = 0; 39787c478bd9Sstevel@tonic-gate #define FIXEDH 530 /* number of hufts used by fixed tables */ 39797c478bd9Sstevel@tonic-gate local uInt fixed_left = FIXEDH; 39807c478bd9Sstevel@tonic-gate local inflate_huft fixed_mem[FIXEDH]; 39817c478bd9Sstevel@tonic-gate local uInt fixed_bl; 39827c478bd9Sstevel@tonic-gate local uInt fixed_bd; 39837c478bd9Sstevel@tonic-gate local inflate_huft *fixed_tl; 39847c478bd9Sstevel@tonic-gate local inflate_huft *fixed_td; 39857c478bd9Sstevel@tonic-gate 39867c478bd9Sstevel@tonic-gate 39877c478bd9Sstevel@tonic-gate local voidpf falloc(q, n, s) 39887c478bd9Sstevel@tonic-gate voidpf q; /* opaque pointer (not used) */ 39897c478bd9Sstevel@tonic-gate uInt n; /* number of items */ 39907c478bd9Sstevel@tonic-gate uInt s; /* size of item */ 39917c478bd9Sstevel@tonic-gate { 39927c478bd9Sstevel@tonic-gate Assert(s == sizeof(inflate_huft) && n <= fixed_left, 39937c478bd9Sstevel@tonic-gate "inflate_trees falloc overflow"); 39947c478bd9Sstevel@tonic-gate if (q) s++; /* to make some compilers happy */ 39957c478bd9Sstevel@tonic-gate fixed_left -= n; 39967c478bd9Sstevel@tonic-gate return (voidpf)(fixed_mem + fixed_left); 39977c478bd9Sstevel@tonic-gate } 39987c478bd9Sstevel@tonic-gate 39997c478bd9Sstevel@tonic-gate 40007c478bd9Sstevel@tonic-gate local void ffree(q, p, n) 40017c478bd9Sstevel@tonic-gate voidpf q; 40027c478bd9Sstevel@tonic-gate voidpf p; 40037c478bd9Sstevel@tonic-gate uInt n; 40047c478bd9Sstevel@tonic-gate { 40057c478bd9Sstevel@tonic-gate Assert(0, "inflate_trees ffree called!"); 40067c478bd9Sstevel@tonic-gate if (q) q = p; /* to make some compilers happy */ 40077c478bd9Sstevel@tonic-gate } 40087c478bd9Sstevel@tonic-gate 40097c478bd9Sstevel@tonic-gate 40107c478bd9Sstevel@tonic-gate local int inflate_trees_fixed(bl, bd, tl, td) 40117c478bd9Sstevel@tonic-gate uIntf *bl; /* literal desired/actual bit depth */ 40127c478bd9Sstevel@tonic-gate uIntf *bd; /* distance desired/actual bit depth */ 40137c478bd9Sstevel@tonic-gate inflate_huft * FAR *tl; /* literal/length tree result */ 40147c478bd9Sstevel@tonic-gate inflate_huft * FAR *td; /* distance tree result */ 40157c478bd9Sstevel@tonic-gate { 40167c478bd9Sstevel@tonic-gate /* build fixed tables if not built already--lock out other instances */ 40177c478bd9Sstevel@tonic-gate while (++fixed_lock > 1) 40187c478bd9Sstevel@tonic-gate fixed_lock--; 40197c478bd9Sstevel@tonic-gate if (!fixed_built) 40207c478bd9Sstevel@tonic-gate { 40217c478bd9Sstevel@tonic-gate int k; /* temporary variable */ 40227c478bd9Sstevel@tonic-gate unsigned c[288]; /* length list for huft_build */ 40237c478bd9Sstevel@tonic-gate z_stream z; /* for falloc function */ 40247c478bd9Sstevel@tonic-gate 40257c478bd9Sstevel@tonic-gate /* set up fake z_stream for memory routines */ 40267c478bd9Sstevel@tonic-gate z.zalloc = falloc; 40277c478bd9Sstevel@tonic-gate z.zfree = ffree; 40287c478bd9Sstevel@tonic-gate z.opaque = Z_NULL; 40297c478bd9Sstevel@tonic-gate 40307c478bd9Sstevel@tonic-gate /* literal table */ 40317c478bd9Sstevel@tonic-gate for (k = 0; k < 144; k++) 40327c478bd9Sstevel@tonic-gate c[k] = 8; 40337c478bd9Sstevel@tonic-gate for (; k < 256; k++) 40347c478bd9Sstevel@tonic-gate c[k] = 9; 40357c478bd9Sstevel@tonic-gate for (; k < 280; k++) 40367c478bd9Sstevel@tonic-gate c[k] = 7; 40377c478bd9Sstevel@tonic-gate for (; k < 288; k++) 40387c478bd9Sstevel@tonic-gate c[k] = 8; 40397c478bd9Sstevel@tonic-gate fixed_bl = 7; 40407c478bd9Sstevel@tonic-gate huft_build(c, 288, 257, cplens, cplext, &fixed_tl, &fixed_bl, &z); 40417c478bd9Sstevel@tonic-gate 40427c478bd9Sstevel@tonic-gate /* distance table */ 40437c478bd9Sstevel@tonic-gate for (k = 0; k < 30; k++) 40447c478bd9Sstevel@tonic-gate c[k] = 5; 40457c478bd9Sstevel@tonic-gate fixed_bd = 5; 40467c478bd9Sstevel@tonic-gate huft_build(c, 30, 0, cpdist, cpdext, &fixed_td, &fixed_bd, &z); 40477c478bd9Sstevel@tonic-gate 40487c478bd9Sstevel@tonic-gate /* done */ 40497c478bd9Sstevel@tonic-gate fixed_built = 1; 40507c478bd9Sstevel@tonic-gate } 40517c478bd9Sstevel@tonic-gate fixed_lock--; 40527c478bd9Sstevel@tonic-gate *bl = fixed_bl; 40537c478bd9Sstevel@tonic-gate *bd = fixed_bd; 40547c478bd9Sstevel@tonic-gate *tl = fixed_tl; 40557c478bd9Sstevel@tonic-gate *td = fixed_td; 40567c478bd9Sstevel@tonic-gate return Z_OK; 40577c478bd9Sstevel@tonic-gate } 40587c478bd9Sstevel@tonic-gate 40597c478bd9Sstevel@tonic-gate 40607c478bd9Sstevel@tonic-gate local int inflate_trees_free(t, z) 40617c478bd9Sstevel@tonic-gate inflate_huft *t; /* table to free */ 40627c478bd9Sstevel@tonic-gate z_stream *z; /* for zfree function */ 40637c478bd9Sstevel@tonic-gate /* Free the malloc'ed tables built by huft_build(), which makes a linked 40647c478bd9Sstevel@tonic-gate list of the tables it made, with the links in a dummy first entry of 40657c478bd9Sstevel@tonic-gate each table. */ 40667c478bd9Sstevel@tonic-gate { 40677c478bd9Sstevel@tonic-gate register inflate_huft *p, *q; 40687c478bd9Sstevel@tonic-gate 40697c478bd9Sstevel@tonic-gate /* Go through linked list, freeing from the malloced (t[-1]) address. */ 40707c478bd9Sstevel@tonic-gate p = t; 40717c478bd9Sstevel@tonic-gate while (p != Z_NULL) 40727c478bd9Sstevel@tonic-gate { 40737c478bd9Sstevel@tonic-gate q = (--p)->next; 40747c478bd9Sstevel@tonic-gate ZFREE(z, p, p->word.Nalloc * sizeof(inflate_huft)); 40757c478bd9Sstevel@tonic-gate p = q; 40767c478bd9Sstevel@tonic-gate } 40777c478bd9Sstevel@tonic-gate return Z_OK; 40787c478bd9Sstevel@tonic-gate } 40797c478bd9Sstevel@tonic-gate 40807c478bd9Sstevel@tonic-gate /*+++++*/ 40817c478bd9Sstevel@tonic-gate /* infcodes.c -- process literals and length/distance pairs 40827c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 40837c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 40847c478bd9Sstevel@tonic-gate */ 40857c478bd9Sstevel@tonic-gate 40867c478bd9Sstevel@tonic-gate /* simplify the use of the inflate_huft type with some defines */ 40877c478bd9Sstevel@tonic-gate #define base more.Base 40887c478bd9Sstevel@tonic-gate #define next more.Next 40897c478bd9Sstevel@tonic-gate #define exop word.what.Exop 40907c478bd9Sstevel@tonic-gate #define bits word.what.Bits 40917c478bd9Sstevel@tonic-gate 40927c478bd9Sstevel@tonic-gate /* inflate codes private state */ 40937c478bd9Sstevel@tonic-gate struct inflate_codes_state { 40947c478bd9Sstevel@tonic-gate 40957c478bd9Sstevel@tonic-gate /* mode */ 40967c478bd9Sstevel@tonic-gate enum { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */ 40977c478bd9Sstevel@tonic-gate START, /* x: set up for LEN */ 40987c478bd9Sstevel@tonic-gate LEN, /* i: get length/literal/eob next */ 40997c478bd9Sstevel@tonic-gate LENEXT, /* i: getting length extra (have base) */ 41007c478bd9Sstevel@tonic-gate DIST, /* i: get distance next */ 41017c478bd9Sstevel@tonic-gate DISTEXT, /* i: getting distance extra */ 41027c478bd9Sstevel@tonic-gate COPY, /* o: copying bytes in window, waiting for space */ 41037c478bd9Sstevel@tonic-gate LIT, /* o: got literal, waiting for output space */ 41047c478bd9Sstevel@tonic-gate WASH, /* o: got eob, possibly still output waiting */ 41057c478bd9Sstevel@tonic-gate END, /* x: got eob and all data flushed */ 41067c478bd9Sstevel@tonic-gate BADCODE} /* x: got error */ 41077c478bd9Sstevel@tonic-gate mode; /* current inflate_codes mode */ 41087c478bd9Sstevel@tonic-gate 41097c478bd9Sstevel@tonic-gate /* mode dependent information */ 41107c478bd9Sstevel@tonic-gate uInt len; 41117c478bd9Sstevel@tonic-gate union { 41127c478bd9Sstevel@tonic-gate struct { 41137c478bd9Sstevel@tonic-gate inflate_huft *tree; /* pointer into tree */ 41147c478bd9Sstevel@tonic-gate uInt need; /* bits needed */ 41157c478bd9Sstevel@tonic-gate } code; /* if LEN or DIST, where in tree */ 41167c478bd9Sstevel@tonic-gate uInt lit; /* if LIT, literal */ 41177c478bd9Sstevel@tonic-gate struct { 41187c478bd9Sstevel@tonic-gate uInt get; /* bits to get for extra */ 41197c478bd9Sstevel@tonic-gate uInt dist; /* distance back to copy from */ 41207c478bd9Sstevel@tonic-gate } copy; /* if EXT or COPY, where and how much */ 41217c478bd9Sstevel@tonic-gate } sub; /* submode */ 41227c478bd9Sstevel@tonic-gate 41237c478bd9Sstevel@tonic-gate /* mode independent information */ 41247c478bd9Sstevel@tonic-gate Byte lbits; /* ltree bits decoded per branch */ 41257c478bd9Sstevel@tonic-gate Byte dbits; /* dtree bits decoder per branch */ 41267c478bd9Sstevel@tonic-gate inflate_huft *ltree; /* literal/length/eob tree */ 41277c478bd9Sstevel@tonic-gate inflate_huft *dtree; /* distance tree */ 41287c478bd9Sstevel@tonic-gate 41297c478bd9Sstevel@tonic-gate }; 41307c478bd9Sstevel@tonic-gate 41317c478bd9Sstevel@tonic-gate 41327c478bd9Sstevel@tonic-gate local inflate_codes_statef *inflate_codes_new(bl, bd, tl, td, z) 41337c478bd9Sstevel@tonic-gate uInt bl, bd; 41347c478bd9Sstevel@tonic-gate inflate_huft *tl, *td; 41357c478bd9Sstevel@tonic-gate z_stream *z; 41367c478bd9Sstevel@tonic-gate { 41377c478bd9Sstevel@tonic-gate inflate_codes_statef *c; 41387c478bd9Sstevel@tonic-gate 41397c478bd9Sstevel@tonic-gate if ((c = (inflate_codes_statef *) 41407c478bd9Sstevel@tonic-gate ZALLOC(z,1,sizeof(struct inflate_codes_state))) != Z_NULL) 41417c478bd9Sstevel@tonic-gate { 41427c478bd9Sstevel@tonic-gate c->mode = START; 41437c478bd9Sstevel@tonic-gate c->lbits = (Byte)bl; 41447c478bd9Sstevel@tonic-gate c->dbits = (Byte)bd; 41457c478bd9Sstevel@tonic-gate c->ltree = tl; 41467c478bd9Sstevel@tonic-gate c->dtree = td; 41477c478bd9Sstevel@tonic-gate Tracev((stderr, "inflate: codes new\n")); 41487c478bd9Sstevel@tonic-gate } 41497c478bd9Sstevel@tonic-gate return c; 41507c478bd9Sstevel@tonic-gate } 41517c478bd9Sstevel@tonic-gate 41527c478bd9Sstevel@tonic-gate 41537c478bd9Sstevel@tonic-gate local int inflate_codes(s, z, r) 41547c478bd9Sstevel@tonic-gate inflate_blocks_statef *s; 41557c478bd9Sstevel@tonic-gate z_stream *z; 41567c478bd9Sstevel@tonic-gate int r; 41577c478bd9Sstevel@tonic-gate { 41587c478bd9Sstevel@tonic-gate uInt j; /* temporary storage */ 41597c478bd9Sstevel@tonic-gate inflate_huft *t; /* temporary pointer */ 41607c478bd9Sstevel@tonic-gate uInt e; /* extra bits or operation */ 41617c478bd9Sstevel@tonic-gate uLong b; /* bit buffer */ 41627c478bd9Sstevel@tonic-gate uInt k; /* bits in bit buffer */ 41637c478bd9Sstevel@tonic-gate Bytef *p; /* input data pointer */ 41647c478bd9Sstevel@tonic-gate uInt n; /* bytes available there */ 41657c478bd9Sstevel@tonic-gate Bytef *q; /* output window write pointer */ 41667c478bd9Sstevel@tonic-gate uInt m; /* bytes to end of window or read pointer */ 41677c478bd9Sstevel@tonic-gate Bytef *f; /* pointer to copy strings from */ 41687c478bd9Sstevel@tonic-gate inflate_codes_statef *c = s->sub.decode.codes; /* codes state */ 41697c478bd9Sstevel@tonic-gate 41707c478bd9Sstevel@tonic-gate /* copy input/output information to locals (UPDATE macro restores) */ 41717c478bd9Sstevel@tonic-gate LOAD 41727c478bd9Sstevel@tonic-gate 41737c478bd9Sstevel@tonic-gate /* process input and output based on current state */ 41747c478bd9Sstevel@tonic-gate while (1) switch (c->mode) 41757c478bd9Sstevel@tonic-gate { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */ 41767c478bd9Sstevel@tonic-gate case START: /* x: set up for LEN */ 41777c478bd9Sstevel@tonic-gate #ifndef SLOW 41787c478bd9Sstevel@tonic-gate if (m >= 258 && n >= 10) 41797c478bd9Sstevel@tonic-gate { 41807c478bd9Sstevel@tonic-gate UPDATE 41817c478bd9Sstevel@tonic-gate r = inflate_fast(c->lbits, c->dbits, c->ltree, c->dtree, s, z); 41827c478bd9Sstevel@tonic-gate LOAD 41837c478bd9Sstevel@tonic-gate if (r != Z_OK) 41847c478bd9Sstevel@tonic-gate { 41857c478bd9Sstevel@tonic-gate c->mode = r == Z_STREAM_END ? WASH : BADCODE; 41867c478bd9Sstevel@tonic-gate break; 41877c478bd9Sstevel@tonic-gate } 41887c478bd9Sstevel@tonic-gate } 41897c478bd9Sstevel@tonic-gate #endif /* !SLOW */ 41907c478bd9Sstevel@tonic-gate c->sub.code.need = c->lbits; 41917c478bd9Sstevel@tonic-gate c->sub.code.tree = c->ltree; 41927c478bd9Sstevel@tonic-gate c->mode = LEN; 4193*5b85b345SToomas Soome /* FALLTHROUGH */ 41947c478bd9Sstevel@tonic-gate case LEN: /* i: get length/literal/eob next */ 41957c478bd9Sstevel@tonic-gate j = c->sub.code.need; 41967c478bd9Sstevel@tonic-gate NEEDBITS(j) 41977c478bd9Sstevel@tonic-gate t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); 41987c478bd9Sstevel@tonic-gate DUMPBITS(t->bits) 41997c478bd9Sstevel@tonic-gate e = (uInt)(t->exop); 42007c478bd9Sstevel@tonic-gate if (e == 0) /* literal */ 42017c478bd9Sstevel@tonic-gate { 42027c478bd9Sstevel@tonic-gate c->sub.lit = t->base; 42037c478bd9Sstevel@tonic-gate Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? 42047c478bd9Sstevel@tonic-gate "inflate: literal '%c'\n" : 42057c478bd9Sstevel@tonic-gate "inflate: literal 0x%02x\n", t->base)); 42067c478bd9Sstevel@tonic-gate c->mode = LIT; 42077c478bd9Sstevel@tonic-gate break; 42087c478bd9Sstevel@tonic-gate } 42097c478bd9Sstevel@tonic-gate if (e & 16) /* length */ 42107c478bd9Sstevel@tonic-gate { 42117c478bd9Sstevel@tonic-gate c->sub.copy.get = e & 15; 42127c478bd9Sstevel@tonic-gate c->len = t->base; 42137c478bd9Sstevel@tonic-gate c->mode = LENEXT; 42147c478bd9Sstevel@tonic-gate break; 42157c478bd9Sstevel@tonic-gate } 42167c478bd9Sstevel@tonic-gate if ((e & 64) == 0) /* next table */ 42177c478bd9Sstevel@tonic-gate { 42187c478bd9Sstevel@tonic-gate c->sub.code.need = e; 42197c478bd9Sstevel@tonic-gate c->sub.code.tree = t->next; 42207c478bd9Sstevel@tonic-gate break; 42217c478bd9Sstevel@tonic-gate } 42227c478bd9Sstevel@tonic-gate if (e & 32) /* end of block */ 42237c478bd9Sstevel@tonic-gate { 42247c478bd9Sstevel@tonic-gate Tracevv((stderr, "inflate: end of block\n")); 42257c478bd9Sstevel@tonic-gate c->mode = WASH; 42267c478bd9Sstevel@tonic-gate break; 42277c478bd9Sstevel@tonic-gate } 42287c478bd9Sstevel@tonic-gate c->mode = BADCODE; /* invalid code */ 42297c478bd9Sstevel@tonic-gate z->msg = "invalid literal/length code"; 42307c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 42317c478bd9Sstevel@tonic-gate LEAVE 42327c478bd9Sstevel@tonic-gate case LENEXT: /* i: getting length extra (have base) */ 42337c478bd9Sstevel@tonic-gate j = c->sub.copy.get; 42347c478bd9Sstevel@tonic-gate NEEDBITS(j) 42357c478bd9Sstevel@tonic-gate c->len += (uInt)b & inflate_mask[j]; 42367c478bd9Sstevel@tonic-gate DUMPBITS(j) 42377c478bd9Sstevel@tonic-gate c->sub.code.need = c->dbits; 42387c478bd9Sstevel@tonic-gate c->sub.code.tree = c->dtree; 42397c478bd9Sstevel@tonic-gate Tracevv((stderr, "inflate: length %u\n", c->len)); 42407c478bd9Sstevel@tonic-gate c->mode = DIST; 4241*5b85b345SToomas Soome /* FALLTHROUGH */ 42427c478bd9Sstevel@tonic-gate case DIST: /* i: get distance next */ 42437c478bd9Sstevel@tonic-gate j = c->sub.code.need; 42447c478bd9Sstevel@tonic-gate NEEDBITS(j) 42457c478bd9Sstevel@tonic-gate t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); 42467c478bd9Sstevel@tonic-gate DUMPBITS(t->bits) 42477c478bd9Sstevel@tonic-gate e = (uInt)(t->exop); 42487c478bd9Sstevel@tonic-gate if (e & 16) /* distance */ 42497c478bd9Sstevel@tonic-gate { 42507c478bd9Sstevel@tonic-gate c->sub.copy.get = e & 15; 42517c478bd9Sstevel@tonic-gate c->sub.copy.dist = t->base; 42527c478bd9Sstevel@tonic-gate c->mode = DISTEXT; 42537c478bd9Sstevel@tonic-gate break; 42547c478bd9Sstevel@tonic-gate } 42557c478bd9Sstevel@tonic-gate if ((e & 64) == 0) /* next table */ 42567c478bd9Sstevel@tonic-gate { 42577c478bd9Sstevel@tonic-gate c->sub.code.need = e; 42587c478bd9Sstevel@tonic-gate c->sub.code.tree = t->next; 42597c478bd9Sstevel@tonic-gate break; 42607c478bd9Sstevel@tonic-gate } 42617c478bd9Sstevel@tonic-gate c->mode = BADCODE; /* invalid code */ 42627c478bd9Sstevel@tonic-gate z->msg = "invalid distance code"; 42637c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 42647c478bd9Sstevel@tonic-gate LEAVE 42657c478bd9Sstevel@tonic-gate case DISTEXT: /* i: getting distance extra */ 42667c478bd9Sstevel@tonic-gate j = c->sub.copy.get; 42677c478bd9Sstevel@tonic-gate NEEDBITS(j) 42687c478bd9Sstevel@tonic-gate c->sub.copy.dist += (uInt)b & inflate_mask[j]; 42697c478bd9Sstevel@tonic-gate DUMPBITS(j) 42707c478bd9Sstevel@tonic-gate Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist)); 42717c478bd9Sstevel@tonic-gate c->mode = COPY; 4272*5b85b345SToomas Soome /* FALLTHROUGH */ 42737c478bd9Sstevel@tonic-gate case COPY: /* o: copying bytes in window, waiting for space */ 42747c478bd9Sstevel@tonic-gate #ifndef __TURBOC__ /* Turbo C bug for following expression */ 42757c478bd9Sstevel@tonic-gate f = (uInt)(q - s->window) < c->sub.copy.dist ? 42767c478bd9Sstevel@tonic-gate s->end - (c->sub.copy.dist - (q - s->window)) : 42777c478bd9Sstevel@tonic-gate q - c->sub.copy.dist; 42787c478bd9Sstevel@tonic-gate #else 42797c478bd9Sstevel@tonic-gate f = q - c->sub.copy.dist; 42807c478bd9Sstevel@tonic-gate if ((uInt)(q - s->window) < c->sub.copy.dist) 42817c478bd9Sstevel@tonic-gate f = s->end - (c->sub.copy.dist - (q - s->window)); 42827c478bd9Sstevel@tonic-gate #endif 42837c478bd9Sstevel@tonic-gate while (c->len) 42847c478bd9Sstevel@tonic-gate { 42857c478bd9Sstevel@tonic-gate NEEDOUT 42867c478bd9Sstevel@tonic-gate OUTBYTE(*f++) 42877c478bd9Sstevel@tonic-gate if (f == s->end) 42887c478bd9Sstevel@tonic-gate f = s->window; 42897c478bd9Sstevel@tonic-gate c->len--; 42907c478bd9Sstevel@tonic-gate } 42917c478bd9Sstevel@tonic-gate c->mode = START; 42927c478bd9Sstevel@tonic-gate break; 42937c478bd9Sstevel@tonic-gate case LIT: /* o: got literal, waiting for output space */ 42947c478bd9Sstevel@tonic-gate NEEDOUT 42957c478bd9Sstevel@tonic-gate OUTBYTE(c->sub.lit) 42967c478bd9Sstevel@tonic-gate c->mode = START; 42977c478bd9Sstevel@tonic-gate break; 42987c478bd9Sstevel@tonic-gate case WASH: /* o: got eob, possibly more output */ 42997c478bd9Sstevel@tonic-gate FLUSH 43007c478bd9Sstevel@tonic-gate if (s->read != s->write) 43017c478bd9Sstevel@tonic-gate LEAVE 43027c478bd9Sstevel@tonic-gate c->mode = END; 4303*5b85b345SToomas Soome /* FALLTHROUGH */ 43047c478bd9Sstevel@tonic-gate case END: 43057c478bd9Sstevel@tonic-gate r = Z_STREAM_END; 43067c478bd9Sstevel@tonic-gate LEAVE 43077c478bd9Sstevel@tonic-gate case BADCODE: /* x: got error */ 43087c478bd9Sstevel@tonic-gate r = Z_DATA_ERROR; 43097c478bd9Sstevel@tonic-gate LEAVE 43107c478bd9Sstevel@tonic-gate default: 43117c478bd9Sstevel@tonic-gate r = Z_STREAM_ERROR; 43127c478bd9Sstevel@tonic-gate LEAVE 43137c478bd9Sstevel@tonic-gate } 43147c478bd9Sstevel@tonic-gate } 43157c478bd9Sstevel@tonic-gate 43167c478bd9Sstevel@tonic-gate 43177c478bd9Sstevel@tonic-gate local void inflate_codes_free(c, z) 43187c478bd9Sstevel@tonic-gate inflate_codes_statef *c; 43197c478bd9Sstevel@tonic-gate z_stream *z; 43207c478bd9Sstevel@tonic-gate { 43217c478bd9Sstevel@tonic-gate ZFREE(z, c, sizeof(struct inflate_codes_state)); 43227c478bd9Sstevel@tonic-gate Tracev((stderr, "inflate: codes free\n")); 43237c478bd9Sstevel@tonic-gate } 43247c478bd9Sstevel@tonic-gate 43257c478bd9Sstevel@tonic-gate /*+++++*/ 43267c478bd9Sstevel@tonic-gate /* inflate_util.c -- data and routines common to blocks and codes 43277c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 43287c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 43297c478bd9Sstevel@tonic-gate */ 43307c478bd9Sstevel@tonic-gate 43317c478bd9Sstevel@tonic-gate /* copy as much as possible from the sliding window to the output area */ 43327c478bd9Sstevel@tonic-gate local int inflate_flush(s, z, r) 43337c478bd9Sstevel@tonic-gate inflate_blocks_statef *s; 43347c478bd9Sstevel@tonic-gate z_stream *z; 43357c478bd9Sstevel@tonic-gate int r; 43367c478bd9Sstevel@tonic-gate { 43377c478bd9Sstevel@tonic-gate uInt n; 43387c478bd9Sstevel@tonic-gate Bytef *p, *q; 43397c478bd9Sstevel@tonic-gate 43407c478bd9Sstevel@tonic-gate /* local copies of source and destination pointers */ 43417c478bd9Sstevel@tonic-gate p = z->next_out; 43427c478bd9Sstevel@tonic-gate q = s->read; 43437c478bd9Sstevel@tonic-gate 43447c478bd9Sstevel@tonic-gate /* compute number of bytes to copy as far as end of window */ 43457c478bd9Sstevel@tonic-gate n = (uInt)((q <= s->write ? s->write : s->end) - q); 43467c478bd9Sstevel@tonic-gate if (n > z->avail_out) n = z->avail_out; 43477c478bd9Sstevel@tonic-gate if (n && r == Z_BUF_ERROR) r = Z_OK; 43487c478bd9Sstevel@tonic-gate 43497c478bd9Sstevel@tonic-gate /* update counters */ 43507c478bd9Sstevel@tonic-gate z->avail_out -= n; 43517c478bd9Sstevel@tonic-gate z->total_out += n; 43527c478bd9Sstevel@tonic-gate 43537c478bd9Sstevel@tonic-gate /* update check information */ 43547c478bd9Sstevel@tonic-gate if (s->checkfn != Z_NULL) 43557c478bd9Sstevel@tonic-gate s->check = (*s->checkfn)(s->check, q, n); 43567c478bd9Sstevel@tonic-gate 43577c478bd9Sstevel@tonic-gate /* copy as far as end of window */ 43587c478bd9Sstevel@tonic-gate if (p != NULL) { 43597c478bd9Sstevel@tonic-gate zmemcpy(p, q, n); 43607c478bd9Sstevel@tonic-gate p += n; 43617c478bd9Sstevel@tonic-gate } 43627c478bd9Sstevel@tonic-gate q += n; 43637c478bd9Sstevel@tonic-gate 43647c478bd9Sstevel@tonic-gate /* see if more to copy at beginning of window */ 43657c478bd9Sstevel@tonic-gate if (q == s->end) 43667c478bd9Sstevel@tonic-gate { 43677c478bd9Sstevel@tonic-gate /* wrap pointers */ 43687c478bd9Sstevel@tonic-gate q = s->window; 43697c478bd9Sstevel@tonic-gate if (s->write == s->end) 43707c478bd9Sstevel@tonic-gate s->write = s->window; 43717c478bd9Sstevel@tonic-gate 43727c478bd9Sstevel@tonic-gate /* compute bytes to copy */ 43737c478bd9Sstevel@tonic-gate n = (uInt)(s->write - q); 43747c478bd9Sstevel@tonic-gate if (n > z->avail_out) n = z->avail_out; 43757c478bd9Sstevel@tonic-gate if (n && r == Z_BUF_ERROR) r = Z_OK; 43767c478bd9Sstevel@tonic-gate 43777c478bd9Sstevel@tonic-gate /* update counters */ 43787c478bd9Sstevel@tonic-gate z->avail_out -= n; 43797c478bd9Sstevel@tonic-gate z->total_out += n; 43807c478bd9Sstevel@tonic-gate 43817c478bd9Sstevel@tonic-gate /* update check information */ 43827c478bd9Sstevel@tonic-gate if (s->checkfn != Z_NULL) 43837c478bd9Sstevel@tonic-gate s->check = (*s->checkfn)(s->check, q, n); 43847c478bd9Sstevel@tonic-gate 43857c478bd9Sstevel@tonic-gate /* copy */ 43867c478bd9Sstevel@tonic-gate if (p != NULL) { 43877c478bd9Sstevel@tonic-gate zmemcpy(p, q, n); 43887c478bd9Sstevel@tonic-gate p += n; 43897c478bd9Sstevel@tonic-gate } 43907c478bd9Sstevel@tonic-gate q += n; 43917c478bd9Sstevel@tonic-gate } 43927c478bd9Sstevel@tonic-gate 43937c478bd9Sstevel@tonic-gate /* update pointers */ 43947c478bd9Sstevel@tonic-gate z->next_out = p; 43957c478bd9Sstevel@tonic-gate s->read = q; 43967c478bd9Sstevel@tonic-gate 43977c478bd9Sstevel@tonic-gate /* done */ 43987c478bd9Sstevel@tonic-gate return r; 43997c478bd9Sstevel@tonic-gate } 44007c478bd9Sstevel@tonic-gate 44017c478bd9Sstevel@tonic-gate 44027c478bd9Sstevel@tonic-gate /*+++++*/ 44037c478bd9Sstevel@tonic-gate /* inffast.c -- process literals and length/distance pairs fast 44047c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 44057c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 44067c478bd9Sstevel@tonic-gate */ 44077c478bd9Sstevel@tonic-gate 44087c478bd9Sstevel@tonic-gate /* simplify the use of the inflate_huft type with some defines */ 44097c478bd9Sstevel@tonic-gate #define base more.Base 44107c478bd9Sstevel@tonic-gate #define next more.Next 44117c478bd9Sstevel@tonic-gate #define exop word.what.Exop 44127c478bd9Sstevel@tonic-gate #define bits word.what.Bits 44137c478bd9Sstevel@tonic-gate 44147c478bd9Sstevel@tonic-gate /* macros for bit input with no checking and for returning unused bytes */ 44157c478bd9Sstevel@tonic-gate #define GRABBITS(j) {while(k<(j)){b|=((uLong)NEXTBYTE)<<k;k+=8;}} 44167c478bd9Sstevel@tonic-gate #define UNGRAB {n+=(c=k>>3);p-=c;k&=7;} 44177c478bd9Sstevel@tonic-gate 44187c478bd9Sstevel@tonic-gate /* Called with number of bytes left to write in window at least 258 44197c478bd9Sstevel@tonic-gate (the maximum string length) and number of input bytes available 44207c478bd9Sstevel@tonic-gate at least ten. The ten bytes are six bytes for the longest length/ 44217c478bd9Sstevel@tonic-gate distance pair plus four bytes for overloading the bit buffer. */ 44227c478bd9Sstevel@tonic-gate 44237c478bd9Sstevel@tonic-gate local int inflate_fast(bl, bd, tl, td, s, z) 44247c478bd9Sstevel@tonic-gate uInt bl, bd; 44257c478bd9Sstevel@tonic-gate inflate_huft *tl, *td; 44267c478bd9Sstevel@tonic-gate inflate_blocks_statef *s; 44277c478bd9Sstevel@tonic-gate z_stream *z; 44287c478bd9Sstevel@tonic-gate { 44297c478bd9Sstevel@tonic-gate inflate_huft *t; /* temporary pointer */ 44307c478bd9Sstevel@tonic-gate uInt e; /* extra bits or operation */ 44317c478bd9Sstevel@tonic-gate uLong b; /* bit buffer */ 44327c478bd9Sstevel@tonic-gate uInt k; /* bits in bit buffer */ 44337c478bd9Sstevel@tonic-gate Bytef *p; /* input data pointer */ 44347c478bd9Sstevel@tonic-gate uInt n; /* bytes available there */ 44357c478bd9Sstevel@tonic-gate Bytef *q; /* output window write pointer */ 44367c478bd9Sstevel@tonic-gate uInt m; /* bytes to end of window or read pointer */ 44377c478bd9Sstevel@tonic-gate uInt ml; /* mask for literal/length tree */ 44387c478bd9Sstevel@tonic-gate uInt md; /* mask for distance tree */ 44397c478bd9Sstevel@tonic-gate uInt c; /* bytes to copy */ 44407c478bd9Sstevel@tonic-gate uInt d; /* distance back to copy from */ 44417c478bd9Sstevel@tonic-gate Bytef *r; /* copy source pointer */ 44427c478bd9Sstevel@tonic-gate 44437c478bd9Sstevel@tonic-gate /* load input, output, bit values */ 44447c478bd9Sstevel@tonic-gate LOAD 44457c478bd9Sstevel@tonic-gate 44467c478bd9Sstevel@tonic-gate /* initialize masks */ 44477c478bd9Sstevel@tonic-gate ml = inflate_mask[bl]; 44487c478bd9Sstevel@tonic-gate md = inflate_mask[bd]; 44497c478bd9Sstevel@tonic-gate 44507c478bd9Sstevel@tonic-gate /* do until not enough input or output space for fast loop */ 44517c478bd9Sstevel@tonic-gate do { /* assume called with m >= 258 && n >= 10 */ 44527c478bd9Sstevel@tonic-gate /* get literal/length code */ 44537c478bd9Sstevel@tonic-gate GRABBITS(20) /* max bits for literal/length code */ 44547c478bd9Sstevel@tonic-gate if ((e = (t = tl + ((uInt)b & ml))->exop) == 0) 44557c478bd9Sstevel@tonic-gate { 44567c478bd9Sstevel@tonic-gate DUMPBITS(t->bits) 44577c478bd9Sstevel@tonic-gate Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? 44587c478bd9Sstevel@tonic-gate "inflate: * literal '%c'\n" : 44597c478bd9Sstevel@tonic-gate "inflate: * literal 0x%02x\n", t->base)); 44607c478bd9Sstevel@tonic-gate *q++ = (Byte)t->base; 44617c478bd9Sstevel@tonic-gate m--; 44627c478bd9Sstevel@tonic-gate continue; 44637c478bd9Sstevel@tonic-gate } 44647c478bd9Sstevel@tonic-gate do { 44657c478bd9Sstevel@tonic-gate DUMPBITS(t->bits) 44667c478bd9Sstevel@tonic-gate if (e & 16) 44677c478bd9Sstevel@tonic-gate { 44687c478bd9Sstevel@tonic-gate /* get extra bits for length */ 44697c478bd9Sstevel@tonic-gate e &= 15; 44707c478bd9Sstevel@tonic-gate c = t->base + ((uInt)b & inflate_mask[e]); 44717c478bd9Sstevel@tonic-gate DUMPBITS(e) 44727c478bd9Sstevel@tonic-gate Tracevv((stderr, "inflate: * length %u\n", c)); 44737c478bd9Sstevel@tonic-gate 44747c478bd9Sstevel@tonic-gate /* decode distance base of block to copy */ 44757c478bd9Sstevel@tonic-gate GRABBITS(15); /* max bits for distance code */ 44767c478bd9Sstevel@tonic-gate e = (t = td + ((uInt)b & md))->exop; 44777c478bd9Sstevel@tonic-gate do { 44787c478bd9Sstevel@tonic-gate DUMPBITS(t->bits) 44797c478bd9Sstevel@tonic-gate if (e & 16) 44807c478bd9Sstevel@tonic-gate { 44817c478bd9Sstevel@tonic-gate /* get extra bits to add to distance base */ 44827c478bd9Sstevel@tonic-gate e &= 15; 44837c478bd9Sstevel@tonic-gate GRABBITS(e) /* get extra bits (up to 13) */ 44847c478bd9Sstevel@tonic-gate d = t->base + ((uInt)b & inflate_mask[e]); 44857c478bd9Sstevel@tonic-gate DUMPBITS(e) 44867c478bd9Sstevel@tonic-gate Tracevv((stderr, "inflate: * distance %u\n", d)); 44877c478bd9Sstevel@tonic-gate 44887c478bd9Sstevel@tonic-gate /* do the copy */ 44897c478bd9Sstevel@tonic-gate m -= c; 44907c478bd9Sstevel@tonic-gate if ((uInt)(q - s->window) >= d) /* offset before dest */ 44917c478bd9Sstevel@tonic-gate { /* just copy */ 44927c478bd9Sstevel@tonic-gate r = q - d; 44937c478bd9Sstevel@tonic-gate *q++ = *r++; c--; /* minimum count is three, */ 44947c478bd9Sstevel@tonic-gate *q++ = *r++; c--; /* so unroll loop a little */ 44957c478bd9Sstevel@tonic-gate } 44967c478bd9Sstevel@tonic-gate else /* else offset after destination */ 44977c478bd9Sstevel@tonic-gate { 44987c478bd9Sstevel@tonic-gate e = d - (q - s->window); /* bytes from offset to end */ 44997c478bd9Sstevel@tonic-gate r = s->end - e; /* pointer to offset */ 45007c478bd9Sstevel@tonic-gate if (c > e) /* if source crosses, */ 45017c478bd9Sstevel@tonic-gate { 45027c478bd9Sstevel@tonic-gate c -= e; /* copy to end of window */ 45037c478bd9Sstevel@tonic-gate do { 45047c478bd9Sstevel@tonic-gate *q++ = *r++; 45057c478bd9Sstevel@tonic-gate } while (--e); 45067c478bd9Sstevel@tonic-gate r = s->window; /* copy rest from start of window */ 45077c478bd9Sstevel@tonic-gate } 45087c478bd9Sstevel@tonic-gate } 45097c478bd9Sstevel@tonic-gate do { /* copy all or what's left */ 45107c478bd9Sstevel@tonic-gate *q++ = *r++; 45117c478bd9Sstevel@tonic-gate } while (--c); 45127c478bd9Sstevel@tonic-gate break; 45137c478bd9Sstevel@tonic-gate } 45147c478bd9Sstevel@tonic-gate else if ((e & 64) == 0) 45157c478bd9Sstevel@tonic-gate e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop; 45167c478bd9Sstevel@tonic-gate else 45177c478bd9Sstevel@tonic-gate { 45187c478bd9Sstevel@tonic-gate z->msg = "invalid distance code"; 45197c478bd9Sstevel@tonic-gate UNGRAB 45207c478bd9Sstevel@tonic-gate UPDATE 45217c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 45227c478bd9Sstevel@tonic-gate } 45237c478bd9Sstevel@tonic-gate } while (1); 45247c478bd9Sstevel@tonic-gate break; 45257c478bd9Sstevel@tonic-gate } 45267c478bd9Sstevel@tonic-gate if ((e & 64) == 0) 45277c478bd9Sstevel@tonic-gate { 45287c478bd9Sstevel@tonic-gate if ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) == 0) 45297c478bd9Sstevel@tonic-gate { 45307c478bd9Sstevel@tonic-gate DUMPBITS(t->bits) 45317c478bd9Sstevel@tonic-gate Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? 45327c478bd9Sstevel@tonic-gate "inflate: * literal '%c'\n" : 45337c478bd9Sstevel@tonic-gate "inflate: * literal 0x%02x\n", t->base)); 45347c478bd9Sstevel@tonic-gate *q++ = (Byte)t->base; 45357c478bd9Sstevel@tonic-gate m--; 45367c478bd9Sstevel@tonic-gate break; 45377c478bd9Sstevel@tonic-gate } 45387c478bd9Sstevel@tonic-gate } 45397c478bd9Sstevel@tonic-gate else if (e & 32) 45407c478bd9Sstevel@tonic-gate { 45417c478bd9Sstevel@tonic-gate Tracevv((stderr, "inflate: * end of block\n")); 45427c478bd9Sstevel@tonic-gate UNGRAB 45437c478bd9Sstevel@tonic-gate UPDATE 45447c478bd9Sstevel@tonic-gate return Z_STREAM_END; 45457c478bd9Sstevel@tonic-gate } 45467c478bd9Sstevel@tonic-gate else 45477c478bd9Sstevel@tonic-gate { 45487c478bd9Sstevel@tonic-gate z->msg = "invalid literal/length code"; 45497c478bd9Sstevel@tonic-gate UNGRAB 45507c478bd9Sstevel@tonic-gate UPDATE 45517c478bd9Sstevel@tonic-gate return Z_DATA_ERROR; 45527c478bd9Sstevel@tonic-gate } 45537c478bd9Sstevel@tonic-gate } while (1); 45547c478bd9Sstevel@tonic-gate } while (m >= 258 && n >= 10); 45557c478bd9Sstevel@tonic-gate 45567c478bd9Sstevel@tonic-gate /* not enough input or output--restore pointers and return */ 45577c478bd9Sstevel@tonic-gate UNGRAB 45587c478bd9Sstevel@tonic-gate UPDATE 45597c478bd9Sstevel@tonic-gate return Z_OK; 45607c478bd9Sstevel@tonic-gate } 45617c478bd9Sstevel@tonic-gate 45627c478bd9Sstevel@tonic-gate 45637c478bd9Sstevel@tonic-gate /*+++++*/ 45647c478bd9Sstevel@tonic-gate /* zutil.c -- target dependent utility functions for the compression library 45657c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Jean-loup Gailly. 45667c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 45677c478bd9Sstevel@tonic-gate */ 45687c478bd9Sstevel@tonic-gate 45697c478bd9Sstevel@tonic-gate /* From: zutil.c,v 1.8 1995/05/03 17:27:12 jloup Exp */ 45707c478bd9Sstevel@tonic-gate 45717c478bd9Sstevel@tonic-gate char *zlib_version = ZLIB_VERSION; 45727c478bd9Sstevel@tonic-gate 45737c478bd9Sstevel@tonic-gate char *z_errmsg[] = { 45747c478bd9Sstevel@tonic-gate "stream end", /* Z_STREAM_END 1 */ 45757c478bd9Sstevel@tonic-gate "", /* Z_OK 0 */ 45767c478bd9Sstevel@tonic-gate "file error", /* Z_ERRNO (-1) */ 45777c478bd9Sstevel@tonic-gate "stream error", /* Z_STREAM_ERROR (-2) */ 45787c478bd9Sstevel@tonic-gate "data error", /* Z_DATA_ERROR (-3) */ 45797c478bd9Sstevel@tonic-gate "insufficient memory", /* Z_MEM_ERROR (-4) */ 45807c478bd9Sstevel@tonic-gate "buffer error", /* Z_BUF_ERROR (-5) */ 45817c478bd9Sstevel@tonic-gate ""}; 45827c478bd9Sstevel@tonic-gate 45837c478bd9Sstevel@tonic-gate 45847c478bd9Sstevel@tonic-gate /*+++++*/ 45857c478bd9Sstevel@tonic-gate /* adler32.c -- compute the Adler-32 checksum of a data stream 45867c478bd9Sstevel@tonic-gate * Copyright (C) 1995 Mark Adler 45877c478bd9Sstevel@tonic-gate * For conditions of distribution and use, see copyright notice in zlib.h 45887c478bd9Sstevel@tonic-gate */ 45897c478bd9Sstevel@tonic-gate 45907c478bd9Sstevel@tonic-gate /* From: adler32.c,v 1.6 1995/05/03 17:27:08 jloup Exp */ 45917c478bd9Sstevel@tonic-gate 45927c478bd9Sstevel@tonic-gate #define BASE 65521L /* largest prime smaller than 65536 */ 45937c478bd9Sstevel@tonic-gate #define NMAX 5552 45947c478bd9Sstevel@tonic-gate /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ 45957c478bd9Sstevel@tonic-gate 45967c478bd9Sstevel@tonic-gate #define DO1(buf) {s1 += *buf++; s2 += s1;} 45977c478bd9Sstevel@tonic-gate #define DO2(buf) DO1(buf); DO1(buf); 45987c478bd9Sstevel@tonic-gate #define DO4(buf) DO2(buf); DO2(buf); 45997c478bd9Sstevel@tonic-gate #define DO8(buf) DO4(buf); DO4(buf); 46007c478bd9Sstevel@tonic-gate #define DO16(buf) DO8(buf); DO8(buf); 46017c478bd9Sstevel@tonic-gate 46027c478bd9Sstevel@tonic-gate /* ========================================================================= */ 46037c478bd9Sstevel@tonic-gate uLong adler32(adler, buf, len) 46047c478bd9Sstevel@tonic-gate uLong adler; 46057c478bd9Sstevel@tonic-gate Bytef *buf; 46067c478bd9Sstevel@tonic-gate uInt len; 46077c478bd9Sstevel@tonic-gate { 46087c478bd9Sstevel@tonic-gate unsigned long s1 = adler & 0xffff; 46097c478bd9Sstevel@tonic-gate unsigned long s2 = (adler >> 16) & 0xffff; 46107c478bd9Sstevel@tonic-gate int k; 46117c478bd9Sstevel@tonic-gate 46127c478bd9Sstevel@tonic-gate if (buf == Z_NULL) return 1L; 46137c478bd9Sstevel@tonic-gate 46147c478bd9Sstevel@tonic-gate while (len > 0) { 46157c478bd9Sstevel@tonic-gate k = len < NMAX ? len : NMAX; 46167c478bd9Sstevel@tonic-gate len -= k; 46177c478bd9Sstevel@tonic-gate while (k >= 16) { 46187c478bd9Sstevel@tonic-gate DO16(buf); 46197c478bd9Sstevel@tonic-gate k -= 16; 46207c478bd9Sstevel@tonic-gate } 46217c478bd9Sstevel@tonic-gate if (k != 0) do { 46227c478bd9Sstevel@tonic-gate DO1(buf); 46237c478bd9Sstevel@tonic-gate } while (--k); 46247c478bd9Sstevel@tonic-gate s1 %= BASE; 46257c478bd9Sstevel@tonic-gate s2 %= BASE; 46267c478bd9Sstevel@tonic-gate } 46277c478bd9Sstevel@tonic-gate return (s2 << 16) | s1; 46287c478bd9Sstevel@tonic-gate } 4629