projects / mirror_edk2.git / blame
| Commit | Line | Data |
|---|---|---|
| 7eb75bcc DM |
1 | /* inflate.h -- internal inflate state definition\r |
| 2 | * Copyright (C) 1995-2009 Mark Adler\r | |
| 3 | * For conditions of distribution and use, see copyright notice in zlib.h\r | |
| 4 | */\r | |
| 5 | \r | |
| 6 | /* WARNING: this file should *not* be used by applications. It is\r | |
| 7 | part of the implementation of the compression library and is\r | |
| 8 | subject to change. Applications should only use zlib.h.\r | |
| 9 | */\r | |
| 10 | \r | |
| 11 | /* define NO_GZIP when compiling if you want to disable gzip header and\r | |
| 12 | trailer decoding by inflate(). NO_GZIP would be used to avoid linking in\r | |
| 13 | the crc code when it is not needed. For shared libraries, gzip decoding\r | |
| 14 | should be left enabled. */\r | |
| 15 | #ifndef NO_GZIP\r | |
| 16 | # define GUNZIP\r | |
| 17 | #endif\r | |
| 18 | \r | |
| 19 | /* Possible inflate modes between inflate() calls */\r | |
| 20 | typedef enum {\r | |
| 21 | HEAD, /* i: waiting for magic header */\r | |
| 22 | FLAGS, /* i: waiting for method and flags (gzip) */\r | |
| 23 | TIME, /* i: waiting for modification time (gzip) */\r | |
| 24 | OS, /* i: waiting for extra flags and operating system (gzip) */\r | |
| 25 | EXLEN, /* i: waiting for extra length (gzip) */\r | |
| 26 | EXTRA, /* i: waiting for extra bytes (gzip) */\r | |
| 27 | NAME, /* i: waiting for end of file name (gzip) */\r | |
| 28 | COMMENT, /* i: waiting for end of comment (gzip) */\r | |
| 29 | HCRC, /* i: waiting for header crc (gzip) */\r | |
| 30 | DICTID, /* i: waiting for dictionary check value */\r | |
| 31 | DICT, /* waiting for inflateSetDictionary() call */\r | |
| 32 | TYPE, /* i: waiting for type bits, including last-flag bit */\r | |
| 33 | TYPEDO, /* i: same, but skip check to exit inflate on new block */\r | |
| 34 | STORED, /* i: waiting for stored size (length and complement) */\r | |
| 35 | COPY_, /* i/o: same as COPY below, but only first time in */\r | |
| 36 | COPY, /* i/o: waiting for input or output to copy stored block */\r | |
| 37 | TABLE, /* i: waiting for dynamic block table lengths */\r | |
| 38 | LENLENS, /* i: waiting for code length code lengths */\r | |
| 39 | CODELENS, /* i: waiting for length/lit and distance code lengths */\r | |
| 40 | LEN_, /* i: same as LEN below, but only first time in */\r | |
| 41 | LEN, /* i: waiting for length/lit/eob code */\r | |
| 42 | LENEXT, /* i: waiting for length extra bits */\r | |
| 43 | DIST, /* i: waiting for distance code */\r | |
| 44 | DISTEXT, /* i: waiting for distance extra bits */\r | |
| 45 | MATCH, /* o: waiting for output space to copy string */\r | |
| 46 | LIT, /* o: waiting for output space to write literal */\r | |
| 47 | CHECK, /* i: waiting for 32-bit check value */\r | |
| 48 | LENGTH, /* i: waiting for 32-bit length (gzip) */\r | |
| 49 | DONE, /* finished check, done -- remain here until reset */\r | |
| 50 | BAD, /* got a data error -- remain here until reset */\r | |
| 51 | MEM, /* got an inflate() memory error -- remain here until reset */\r | |
| 52 | SYNC /* looking for synchronization bytes to restart inflate() */\r | |
| 53 | } inflate_mode;\r | |
| 54 | \r | |
| 55 | /*\r | |
| 56 | State transitions between above modes -\r | |
| 57 | \r | |
| 58 | (most modes can go to BAD or MEM on error -- not shown for clarity)\r | |
| 59 | \r | |
| 60 | Process header:\r | |
| 61 | HEAD -> (gzip) or (zlib) or (raw)\r | |
| 62 | (gzip) -> FLAGS -> TIME -> OS -> EXLEN -> EXTRA -> NAME -> COMMENT ->\r | |
| 63 | HCRC -> TYPE\r | |
| 64 | (zlib) -> DICTID or TYPE\r | |
| 65 | DICTID -> DICT -> TYPE\r | |
| 66 | (raw) -> TYPEDO\r | |
| 67 | Read deflate blocks:\r | |
| 68 | TYPE -> TYPEDO -> STORED or TABLE or LEN_ or CHECK\r | |
| 69 | STORED -> COPY_ -> COPY -> TYPE\r | |
| 70 | TABLE -> LENLENS -> CODELENS -> LEN_\r | |
| 71 | LEN_ -> LEN\r | |
| 72 | Read deflate codes in fixed or dynamic block:\r | |
| 73 | LEN -> LENEXT or LIT or TYPE\r | |
| 74 | LENEXT -> DIST -> DISTEXT -> MATCH -> LEN\r | |
| 75 | LIT -> LEN\r | |
| 76 | Process trailer:\r | |
| 77 | CHECK -> LENGTH -> DONE\r | |
| 78 | */\r | |
| 79 | \r | |
| 80 | /* state maintained between inflate() calls. Approximately 10K bytes. */\r | |
| 81 | struct inflate_state {\r | |
| 82 | inflate_mode mode; /* current inflate mode */\r | |
| 83 | int last; /* true if processing last block */\r | |
| 84 | int wrap; /* bit 0 true for zlib, bit 1 true for gzip */\r | |
| 85 | int havedict; /* true if dictionary provided */\r | |
| 86 | int flags; /* gzip header method and flags (0 if zlib) */\r | |
| 87 | unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */\r | |
| 88 | unsigned long check; /* protected copy of check value */\r | |
| 89 | unsigned long total; /* protected copy of output count */\r | |
| 90 | gz_headerp head; /* where to save gzip header information */\r | |
| 91 | /* sliding window */\r | |
| 92 | unsigned wbits; /* log base 2 of requested window size */\r | |
| 93 | unsigned wsize; /* window size or zero if not using window */\r | |
| 94 | unsigned whave; /* valid bytes in the window */\r | |
| 95 | unsigned wnext; /* window write index */\r | |
| 96 | unsigned char FAR *window; /* allocated sliding window, if needed */\r | |
| 97 | /* bit accumulator */\r | |
| 98 | unsigned long hold; /* input bit accumulator */\r | |
| 99 | unsigned bits; /* number of bits in "in" */\r | |
| 100 | /* for string and stored block copying */\r | |
| 101 | unsigned length; /* literal or length of data to copy */\r | |
| 102 | unsigned offset; /* distance back to copy string from */\r | |
| 103 | /* for table and code decoding */\r | |
| 104 | unsigned extra; /* extra bits needed */\r | |
| 105 | /* fixed and dynamic code tables */\r | |
| 106 | code const FAR *lencode; /* starting table for length/literal codes */\r | |
| 107 | code const FAR *distcode; /* starting table for distance codes */\r | |
| 108 | unsigned lenbits; /* index bits for lencode */\r | |
| 109 | unsigned distbits; /* index bits for distcode */\r | |
| 110 | /* dynamic table building */\r | |
| 111 | unsigned ncode; /* number of code length code lengths */\r | |
| 112 | unsigned nlen; /* number of length code lengths */\r | |
| 113 | unsigned ndist; /* number of distance code lengths */\r | |
| 114 | unsigned have; /* number of code lengths in lens[] */\r | |
| 115 | code FAR *next; /* next available space in codes[] */\r | |
| 116 | unsigned short lens[320]; /* temporary storage for code lengths */\r | |
| 117 | unsigned short work[288]; /* work area for code table building */\r | |
| 118 | code codes[ENOUGH]; /* space for code tables */\r | |
| 119 | int sane; /* if false, allow invalid distance too far */\r | |
| 120 | int back; /* bits back of last unprocessed length/lit */\r | |
| 121 | unsigned was; /* initial length of match */\r | |
| 122 | };\r |