4 * Copyright 2002 Greg Turner
5 * Copyright 2005 Gerold Jens Wucherpfennig
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
21 #ifndef __WINE_CABINET_H
22 #define __WINE_CABINET_H
24 #define WIN32_NO_STATUS
26 #define COM_NO_WINDOWS_H
36 /* from msvcrt/sys/stat.h */
37 #define _S_IWRITE 0x0080
38 #define _S_IREAD 0x0100
40 /* from msvcrt/fcntl.h */
44 #define _O_ACCMODE (_O_RDONLY|_O_WRONLY|_O_RDWR)
45 #define _O_APPEND 0x0008
46 #define _O_RANDOM 0x0010
47 #define _O_SEQUENTIAL 0x0020
48 #define _O_TEMPORARY 0x0040
49 #define _O_NOINHERIT 0x0080
50 #define _O_CREAT 0x0100
51 #define _O_TRUNC 0x0200
52 #define _O_EXCL 0x0400
53 #define _O_SHORT_LIVED 0x1000
54 #define _O_TEXT 0x4000
55 #define _O_BINARY 0x8000
57 #define CAB_SPLITMAX (10)
59 #define CAB_SEARCH_SIZE (32*1024)
61 typedef unsigned char cab_UBYTE
; /* 8 bits */
62 typedef UINT16 cab_UWORD
; /* 16 bits */
63 typedef UINT32 cab_ULONG
; /* 32 bits */
64 typedef INT32 cab_LONG
; /* 32 bits */
66 typedef UINT32 cab_off_t
;
68 /* number of bits in a ULONG */
72 #define CAB_ULONG_BITS (sizeof(cab_ULONG) * CHAR_BIT)
74 /* structure offsets */
75 #define cfhead_Signature (0x00)
76 #define cfhead_CabinetSize (0x08)
77 #define cfhead_FileOffset (0x10)
78 #define cfhead_MinorVersion (0x18)
79 #define cfhead_MajorVersion (0x19)
80 #define cfhead_NumFolders (0x1A)
81 #define cfhead_NumFiles (0x1C)
82 #define cfhead_Flags (0x1E)
83 #define cfhead_SetID (0x20)
84 #define cfhead_CabinetIndex (0x22)
85 #define cfhead_SIZEOF (0x24)
86 #define cfheadext_HeaderReserved (0x00)
87 #define cfheadext_FolderReserved (0x02)
88 #define cfheadext_DataReserved (0x03)
89 #define cfheadext_SIZEOF (0x04)
90 #define cffold_DataOffset (0x00)
91 #define cffold_NumBlocks (0x04)
92 #define cffold_CompType (0x06)
93 #define cffold_SIZEOF (0x08)
94 #define cffile_UncompressedSize (0x00)
95 #define cffile_FolderOffset (0x04)
96 #define cffile_FolderIndex (0x08)
97 #define cffile_Date (0x0A)
98 #define cffile_Time (0x0C)
99 #define cffile_Attribs (0x0E)
100 #define cffile_SIZEOF (0x10)
101 #define cfdata_CheckSum (0x00)
102 #define cfdata_CompressedSize (0x04)
103 #define cfdata_UncompressedSize (0x06)
104 #define cfdata_SIZEOF (0x08)
107 #define cffoldCOMPTYPE_MASK (0x000f)
108 #define cffoldCOMPTYPE_NONE (0x0000)
109 #define cffoldCOMPTYPE_MSZIP (0x0001)
110 #define cffoldCOMPTYPE_QUANTUM (0x0002)
111 #define cffoldCOMPTYPE_LZX (0x0003)
112 #define cfheadPREV_CABINET (0x0001)
113 #define cfheadNEXT_CABINET (0x0002)
114 #define cfheadRESERVE_PRESENT (0x0004)
115 #define cffileCONTINUED_FROM_PREV (0xFFFD)
116 #define cffileCONTINUED_TO_NEXT (0xFFFE)
117 #define cffileCONTINUED_PREV_AND_NEXT (0xFFFF)
118 #define cffile_A_RDONLY (0x01)
119 #define cffile_A_HIDDEN (0x02)
120 #define cffile_A_SYSTEM (0x04)
121 #define cffile_A_ARCH (0x20)
122 #define cffile_A_EXEC (0x40)
123 #define cffile_A_NAME_IS_UTF (0x80)
125 /****************************************************************************/
126 /* our archiver information / state */
129 #define ZIPWSIZE 0x8000 /* window size */
130 #define ZIPLBITS 9 /* bits in base literal/length lookup table */
131 #define ZIPDBITS 6 /* bits in base distance lookup table */
132 #define ZIPBMAX 16 /* maximum bit length of any code */
133 #define ZIPN_MAX 288 /* maximum number of codes in any set */
136 cab_UBYTE e
; /* number of extra bits or operation */
137 cab_UBYTE b
; /* number of bits in this code or subcode */
139 cab_UWORD n
; /* literal, length base, or distance base */
140 struct Ziphuft
*t
; /* pointer to next level of table */
145 cab_ULONG window_posn
; /* current offset within the window */
146 cab_ULONG bb
; /* bit buffer */
147 cab_ULONG bk
; /* bits in bit buffer */
148 cab_ULONG ll
[288+32]; /* literal/length and distance code lengths */
149 cab_ULONG c
[ZIPBMAX
+1]; /* bit length count table */
150 cab_LONG lx
[ZIPBMAX
+1]; /* memory for l[-1..ZIPBMAX-1] */
151 struct Ziphuft
*u
[ZIPBMAX
]; /* table stack */
152 cab_ULONG v
[ZIPN_MAX
]; /* values in order of bit length */
153 cab_ULONG x
[ZIPBMAX
+1]; /* bit offsets, then code stack */
160 cab_UWORD sym
, cumfreq
;
164 int shiftsleft
, entries
;
165 struct QTMmodelsym
*syms
;
166 cab_UWORD tabloc
[256];
170 cab_UBYTE
*window
; /* the actual decoding window */
171 cab_ULONG window_size
; /* window size (1Kb through 2Mb) */
172 cab_ULONG actual_size
; /* window size when it was first allocated */
173 cab_ULONG window_posn
; /* current offset within the window */
175 struct QTMmodel model7
;
176 struct QTMmodelsym m7sym
[7+1];
178 struct QTMmodel model4
, model5
, model6pos
, model6len
;
179 struct QTMmodelsym m4sym
[0x18 + 1];
180 struct QTMmodelsym m5sym
[0x24 + 1];
181 struct QTMmodelsym m6psym
[0x2a + 1], m6lsym
[0x1b + 1];
183 struct QTMmodel model00
, model40
, model80
, modelC0
;
184 struct QTMmodelsym m00sym
[0x40 + 1], m40sym
[0x40 + 1];
185 struct QTMmodelsym m80sym
[0x40 + 1], mC0sym
[0x40 + 1];
190 /* some constants defined by the LZX specification */
191 #define LZX_MIN_MATCH (2)
192 #define LZX_MAX_MATCH (257)
193 #define LZX_NUM_CHARS (256)
194 #define LZX_BLOCKTYPE_INVALID (0) /* also blocktypes 4-7 invalid */
195 #define LZX_BLOCKTYPE_VERBATIM (1)
196 #define LZX_BLOCKTYPE_ALIGNED (2)
197 #define LZX_BLOCKTYPE_UNCOMPRESSED (3)
198 #define LZX_PRETREE_NUM_ELEMENTS (20)
199 #define LZX_ALIGNED_NUM_ELEMENTS (8) /* aligned offset tree #elements */
200 #define LZX_NUM_PRIMARY_LENGTHS (7) /* this one missing from spec! */
201 #define LZX_NUM_SECONDARY_LENGTHS (249) /* length tree #elements */
203 /* LZX huffman defines: tweak tablebits as desired */
204 #define LZX_PRETREE_MAXSYMBOLS (LZX_PRETREE_NUM_ELEMENTS)
205 #define LZX_PRETREE_TABLEBITS (6)
206 #define LZX_MAINTREE_MAXSYMBOLS (LZX_NUM_CHARS + 50*8)
207 #define LZX_MAINTREE_TABLEBITS (12)
208 #define LZX_LENGTH_MAXSYMBOLS (LZX_NUM_SECONDARY_LENGTHS+1)
209 #define LZX_LENGTH_TABLEBITS (12)
210 #define LZX_ALIGNED_MAXSYMBOLS (LZX_ALIGNED_NUM_ELEMENTS)
211 #define LZX_ALIGNED_TABLEBITS (7)
213 #define LZX_LENTABLE_SAFETY (64) /* we allow length table decoding overruns */
215 #define LZX_DECLARE_TABLE(tbl) \
216 cab_UWORD tbl##_table[(1<<LZX_##tbl##_TABLEBITS) + (LZX_##tbl##_MAXSYMBOLS<<1)];\
217 cab_UBYTE tbl##_len [LZX_##tbl##_MAXSYMBOLS + LZX_LENTABLE_SAFETY]
220 cab_UBYTE
*window
; /* the actual decoding window */
221 cab_ULONG window_size
; /* window size (32Kb through 2Mb) */
222 cab_ULONG actual_size
; /* window size when it was first allocated */
223 cab_ULONG window_posn
; /* current offset within the window */
224 cab_ULONG R0
, R1
, R2
; /* for the LRU offset system */
225 cab_UWORD main_elements
; /* number of main tree elements */
226 int header_read
; /* have we started decoding at all yet? */
227 cab_UWORD block_type
; /* type of this block */
228 cab_ULONG block_length
; /* uncompressed length of this block */
229 cab_ULONG block_remaining
; /* uncompressed bytes still left to decode */
230 cab_ULONG frames_read
; /* the number of CFDATA blocks processed */
231 cab_LONG intel_filesize
; /* magic header value used for transform */
232 cab_LONG intel_curpos
; /* current offset in transform space */
233 int intel_started
; /* have we seen any translatable data yet? */
235 LZX_DECLARE_TABLE(PRETREE
);
236 LZX_DECLARE_TABLE(MAINTREE
);
237 LZX_DECLARE_TABLE(LENGTH
);
238 LZX_DECLARE_TABLE(ALIGNED
);
247 /* CAB data blocks are <= 32768 bytes in uncompressed form. Uncompressed
248 * blocks have zero growth. MSZIP guarantees that it won't grow above
249 * uncompressed size by more than 12 bytes. LZX guarantees it won't grow
250 * more than 6144 bytes.
252 #define CAB_BLOCKMAX (32768)
253 #define CAB_INPUTMAX (CAB_BLOCKMAX+6144)
256 struct cab_file
*next
; /* next file in sequence */
257 struct cab_folder
*folder
; /* folder that contains this file */
258 LPCSTR filename
; /* output name of file */
259 HANDLE fh
; /* open file handle or NULL */
260 cab_ULONG length
; /* uncompressed length of file */
261 cab_ULONG offset
; /* uncompressed offset in folder */
262 cab_UWORD index
; /* magic index number of folder */
263 cab_UWORD time
, date
, attribs
; /* MS-DOS time/date/attributes */
268 struct cab_folder
*next
;
269 struct cabinet
*cab
[CAB_SPLITMAX
]; /* cabinet(s) this folder spans */
270 cab_off_t offset
[CAB_SPLITMAX
]; /* offset to data blocks */
271 cab_UWORD comp_type
; /* compression format/window size */
272 cab_ULONG comp_size
; /* compressed size of folder */
273 cab_UBYTE num_splits
; /* number of split blocks + 1 */
274 cab_UWORD num_blocks
; /* total number of blocks */
275 struct cab_file
*contfile
; /* the first split file */
279 struct cabinet
*next
; /* for making a list of cabinets */
280 LPCSTR filename
; /* input name of cabinet */
281 HANDLE
*fh
; /* open file handle or NULL */
282 cab_off_t filelen
; /* length of cabinet file */
283 cab_off_t blocks_off
; /* offset to data blocks in file */
284 struct cabinet
*prevcab
, *nextcab
; /* multipart cabinet chains */
285 char *prevname
, *nextname
; /* and their filenames */
286 char *previnfo
, *nextinfo
; /* and their visible names */
287 struct cab_folder
*folders
; /* first folder in this cabinet */
288 struct cab_file
*files
; /* first file in this cabinet */
289 cab_UBYTE block_resv
; /* reserved space in datablocks */
290 cab_UBYTE flags
; /* header flags */
293 typedef struct cds_forward
{
294 struct cab_folder
*current
; /* current folder we're extracting from */
295 cab_ULONG offset
; /* uncompressed offset within folder */
296 cab_UBYTE
*outpos
; /* (high level) start of data to use up */
297 cab_UWORD outlen
; /* (high level) amount of data to use up */
298 cab_UWORD split
; /* at which split in current folder? */
299 int (*decompress
)(int, int, struct cds_forward
*); /* chosen compress fn */
300 cab_UBYTE inbuf
[CAB_INPUTMAX
+2]; /* +2 for lzx bitbuffer overflows! */
301 cab_UBYTE outbuf
[CAB_BLOCKMAX
];
302 cab_UBYTE q_length_base
[27], q_length_extra
[27], q_extra_bits
[42];
303 cab_ULONG q_position_base
[42];
304 cab_ULONG lzx_position_base
[51];
305 cab_UBYTE extra_bits
[51];
314 * the rest of these are somewhat kludgy macros which are shared between fdi.c
318 /* Bitstream reading macros (Quantum / normal byte order)
320 * Q_INIT_BITSTREAM should be used first to set up the system
321 * Q_READ_BITS(var,n) takes N bits from the buffer and puts them in var.
322 * unlike LZX, this can loop several times to get the
323 * requisite number of bits.
324 * Q_FILL_BUFFER adds more data to the bit buffer, if there is room
325 * for another 16 bits.
326 * Q_PEEK_BITS(n) extracts (without removing) N bits from the bit
328 * Q_REMOVE_BITS(n) removes N bits from the bit buffer
330 * These bit access routines work by using the area beyond the MSB and the
331 * LSB as a free source of zeroes. This avoids having to mask any bits.
332 * So we have to know the bit width of the bitbuffer variable. This is
333 * defined as ULONG_BITS.
335 * ULONG_BITS should be at least 16 bits. Unlike LZX's Huffman decoding,
336 * Quantum's arithmetic decoding only needs 1 bit at a time, it doesn't
337 * need an assured number. Retrieving larger bitstrings can be done with
338 * multiple reads and fills of the bitbuffer. The code should work fine
339 * for machines where ULONG >= 32 bits.
341 * Also note that Quantum reads bytes in normal order; LZX is in
342 * little-endian order.
345 #define Q_INIT_BITSTREAM do { bitsleft = 0; bitbuf = 0; } while (0)
347 #define Q_FILL_BUFFER do { \
348 if (bitsleft <= (CAB_ULONG_BITS - 16)) { \
349 bitbuf |= ((inpos[0]<<8)|inpos[1]) << (CAB_ULONG_BITS-16 - bitsleft); \
350 bitsleft += 16; inpos += 2; \
354 #define Q_PEEK_BITS(n) (bitbuf >> (CAB_ULONG_BITS - (n)))
355 #define Q_REMOVE_BITS(n) ((bitbuf <<= (n)), (bitsleft -= (n)))
357 #define Q_READ_BITS(v,n) do { \
359 for (bitsneed = (n); bitsneed; bitsneed -= bitrun) { \
361 bitrun = (bitsneed > bitsleft) ? bitsleft : bitsneed; \
362 (v) = ((v) << bitrun) | Q_PEEK_BITS(bitrun); \
363 Q_REMOVE_BITS(bitrun); \
367 #define Q_MENTRIES(model) (QTM(model).entries)
368 #define Q_MSYM(model,symidx) (QTM(model).syms[(symidx)].sym)
369 #define Q_MSYMFREQ(model,symidx) (QTM(model).syms[(symidx)].cumfreq)
371 /* GET_SYMBOL(model, var) fetches the next symbol from the stated model
372 * and puts it in var. it may need to read the bitstream to do this.
374 #define GET_SYMBOL(m, var) do { \
375 range = ((H - L) & 0xFFFF) + 1; \
376 symf = ((((C - L + 1) * Q_MSYMFREQ(m,0)) - 1) / range) & 0xFFFF; \
378 for (i=1; i < Q_MENTRIES(m); i++) { \
379 if (Q_MSYMFREQ(m,i) <= symf) break; \
381 (var) = Q_MSYM(m,i-1); \
383 range = (H - L) + 1; \
384 H = L + ((Q_MSYMFREQ(m,i-1) * range) / Q_MSYMFREQ(m,0)) - 1; \
385 L = L + ((Q_MSYMFREQ(m,i) * range) / Q_MSYMFREQ(m,0)); \
387 if ((L & 0x8000) != (H & 0x8000)) { \
388 if ((L & 0x4000) && !(H & 0x4000)) { \
389 /* underflow case */ \
390 C ^= 0x4000; L &= 0x3FFF; H |= 0x4000; \
394 L <<= 1; H = (H << 1) | 1; \
396 C = (C << 1) | Q_PEEK_BITS(1); \
400 QTMupdatemodel(&(QTM(m)), i); \
403 /* Bitstream reading macros (LZX / intel little-endian byte order)
405 * INIT_BITSTREAM should be used first to set up the system
406 * READ_BITS(var,n) takes N bits from the buffer and puts them in var
408 * ENSURE_BITS(n) ensures there are at least N bits in the bit buffer.
409 * it can guarantee up to 17 bits (i.e. it can read in
410 * 16 new bits when there is down to 1 bit in the buffer,
411 * and it can read 32 bits when there are 0 bits in the
413 * PEEK_BITS(n) extracts (without removing) N bits from the bit buffer
414 * REMOVE_BITS(n) removes N bits from the bit buffer
416 * These bit access routines work by using the area beyond the MSB and the
417 * LSB as a free source of zeroes. This avoids having to mask any bits.
418 * So we have to know the bit width of the bitbuffer variable.
421 #define INIT_BITSTREAM do { bitsleft = 0; bitbuf = 0; } while (0)
423 /* Quantum reads bytes in normal order; LZX is little-endian order */
424 #define ENSURE_BITS(n) \
425 while (bitsleft < (n)) { \
426 bitbuf |= ((inpos[1]<<8)|inpos[0]) << (CAB_ULONG_BITS-16 - bitsleft); \
427 bitsleft += 16; inpos+=2; \
430 #define PEEK_BITS(n) (bitbuf >> (CAB_ULONG_BITS - (n)))
431 #define REMOVE_BITS(n) ((bitbuf <<= (n)), (bitsleft -= (n)))
433 #define READ_BITS(v,n) do { \
436 (v) = PEEK_BITS(n); \
446 #define TABLEBITS(tbl) (LZX_##tbl##_TABLEBITS)
447 #define MAXSYMBOLS(tbl) (LZX_##tbl##_MAXSYMBOLS)
448 #define SYMTABLE(tbl) (LZX(tbl##_table))
449 #define LENTABLE(tbl) (LZX(tbl##_len))
451 /* BUILD_TABLE(tablename) builds a huffman lookup table from code lengths.
452 * In reality, it just calls make_decode_table() with the appropriate
453 * values - they're all fixed by some #defines anyway, so there's no point
454 * writing each call out in full by hand.
456 #define BUILD_TABLE(tbl) \
457 if (make_decode_table( \
458 MAXSYMBOLS(tbl), TABLEBITS(tbl), LENTABLE(tbl), SYMTABLE(tbl) \
459 )) { return DECR_ILLEGALDATA; }
461 /* READ_HUFFSYM(tablename, var) decodes one huffman symbol from the
462 * bitstream using the stated table and puts it in var.
464 #define READ_HUFFSYM(tbl,var) do { \
466 hufftbl = SYMTABLE(tbl); \
467 if ((i = hufftbl[PEEK_BITS(TABLEBITS(tbl))]) >= MAXSYMBOLS(tbl)) { \
468 j = 1 << (CAB_ULONG_BITS - TABLEBITS(tbl)); \
470 j >>= 1; i <<= 1; i |= (bitbuf & j) ? 1 : 0; \
471 if (!j) { return DECR_ILLEGALDATA; } \
472 } while ((i = hufftbl[i]) >= MAXSYMBOLS(tbl)); \
474 j = LENTABLE(tbl)[(var) = i]; \
478 /* READ_LENGTHS(tablename, first, last) reads in code lengths for symbols
479 * first to last in the given table. The code lengths are stored in their
480 * own special LZX way.
482 #define READ_LENGTHS(tbl,first,last,fn) do { \
483 lb.bb = bitbuf; lb.bl = bitsleft; lb.ip = inpos; \
484 if (fn(LENTABLE(tbl),(first),(last),&lb,decomp_state)) { \
485 return DECR_ILLEGALDATA; \
487 bitbuf = lb.bb; bitsleft = lb.bl; inpos = lb.ip; \
490 /* Tables for deflate from PKZIP's appnote.txt. */
492 #define THOSE_ZIP_CONSTS \
493 static const cab_UBYTE Zipborder[] = /* Order of the bit length code lengths */ \
494 { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; \
495 static const cab_UWORD Zipcplens[] = /* Copy lengths for literal codes 257..285 */ \
496 { 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, \
497 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; \
498 static const cab_UWORD Zipcplext[] = /* Extra bits for literal codes 257..285 */ \
499 { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, \
500 4, 5, 5, 5, 5, 0, 99, 99}; /* 99==invalid */ \
501 static const cab_UWORD Zipcpdist[] = /* Copy offsets for distance codes 0..29 */ \
502 { 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, \
503 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577}; \
504 static const cab_UWORD Zipcpdext[] = /* Extra bits for distance codes */ \
505 { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, \
506 10, 11, 11, 12, 12, 13, 13}; \
507 /* And'ing with Zipmask[n] masks the lower n bits */ \
508 static const cab_UWORD Zipmask[17] = { \
509 0x0000, 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, \
510 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff \
513 /* SESSION Operation */
514 #define EXTRACT_FILLFILELIST 0x00000001
515 #define EXTRACT_EXTRACTFILES 0x00000002
519 struct FILELIST
*next
;
526 struct FILELIST
*FileList
;
529 CHAR Destination
[MAX_PATH
];
530 CHAR CurrentFile
[MAX_PATH
];
531 CHAR Reserved
[MAX_PATH
];
532 struct FILELIST
*FilterList
;
535 #endif /* __WINE_CABINET_H */