?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Added some stubs.
[wine/wine64.git] / dlls / cabinet / cabextract.c
blob1f0b49ed1decbc04ae72ec1440f94015b25459f3
1 /*
2 * cabextract.c
3 *
4 * Copyright 2000-2002 Stuart Caie
5 *
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 *
20 * Principal author: Stuart Caie <kyzer@4u.net>
21 *
22 * Based on specification documents from Microsoft Corporation
23 * Quantum decompression researched and implemented by Matthew Russoto
24 * Huffman code adapted from unlzx by Dave Tritscher.
25 * InfoZip team's INFLATE implementation adapted to MSZIP by Dirk Stoecker.
26 * Major LZX fixes by Jae Jung.
27 */
28
29 #include "config.h"
30
31 #include <stdlib.h>
32
33 #include "windef.h"
34 #include "winbase.h"
35 #include "winerror.h"
36
37 #include "cabinet.h"
38
39 #include "wine/debug.h"
40
41 WINE_DEFAULT_DEBUG_CHANNEL(cabinet);
42
43 THOSE_ZIP_CONSTS;
44
45 /* all the file IO is abstracted into these routines:
46 * cabinet_(open|close|read|seek|skip|getoffset)
47 * file_(open|close|write)
48 */
49
50 /* try to open a cabinet file, returns success */
51 BOOL cabinet_open(struct cabinet *cab)
52 {
53 char *name = (char *)cab->filename;
54 HANDLE fh;
55
56 TRACE("(cab == ^%p)\n", cab);
57
58 if ((fh = CreateFileA( name, GENERIC_READ, FILE_SHARE_READ,
59 NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL )) == INVALID_HANDLE_VALUE) {
60 ERR("Couldn't open %s\n", debugstr_a(name));
61 return FALSE;
62 }
63
64 /* seek to end of file and get the length */
65 if ((cab->filelen = SetFilePointer(fh, 0, NULL, FILE_END)) == INVALID_SET_FILE_POINTER) {
66 if (GetLastError() != NO_ERROR) {
67 ERR("Seek END failed: %s", debugstr_a(name));
68 CloseHandle(fh);
69 return FALSE;
70 }
71 }
72
73 /* return to the start of the file */
74 if (SetFilePointer(fh, 0, NULL, FILE_BEGIN) == INVALID_SET_FILE_POINTER) {
75 ERR("Seek BEGIN failed: %s", debugstr_a(name));
76 CloseHandle(fh);
77 return FALSE;
78 }
79
80 cab->fh = fh;
81 return TRUE;
82 }
83
84 /*******************************************************************
85 * cabinet_close (internal)
86 *
87 * close the file handle in a struct cabinet.
88 */
89 void cabinet_close(struct cabinet *cab) {
90 TRACE("(cab == ^%p)\n", cab);
91 if (cab->fh) CloseHandle(cab->fh);
92 cab->fh = 0;
93 }
94
95 /*******************************************************
96 * ensure_filepath2 (internal)
97 */
98 BOOL ensure_filepath2(char *path) {
99 BOOL ret = TRUE;
100 int len;
101 char *new_path;
102
103 new_path = HeapAlloc(GetProcessHeap(), 0, (strlen(path) + 1));
104 strcpy(new_path, path);
105
106 while((len = strlen(new_path)) && new_path[len - 1] == '\\')
107 new_path[len - 1] = 0;
108
109 TRACE("About to try to create directory %s\n", debugstr_a(new_path));
110 while(!CreateDirectoryA(new_path, NULL)) {
111 char *slash;
112 DWORD last_error = GetLastError();
113
114 if(last_error == ERROR_ALREADY_EXISTS)
115 break;
116
117 if(last_error != ERROR_PATH_NOT_FOUND) {
118 ret = FALSE;
119 break;
120 }
121
122 if(!(slash = strrchr(new_path, '\\'))) {
123 ret = FALSE;
124 break;
125 }
126
127 len = slash - new_path;
128 new_path[len] = 0;
129 if(! ensure_filepath2(new_path)) {
130 ret = FALSE;
131 break;
132 }
133 new_path[len] = '\\';
134 TRACE("New path in next iteration: %s\n", debugstr_a(new_path));
135 }
136
137 HeapFree(GetProcessHeap(), 0, new_path);
138 return ret;
139 }
140
141
142 /**********************************************************************
143 * ensure_filepath (internal)
144 *
145 * ensure_filepath("a\b\c\d.txt") ensures a, a\b and a\b\c exist as dirs
146 */
147 BOOL ensure_filepath(char *path) {
148 char new_path[MAX_PATH];
149 int len, i, lastslashpos = -1;
150
151 TRACE("(path == %s)\n", debugstr_a(path));
152
153 strcpy(new_path, path);
154 /* remove trailing slashes (shouldn't need to but wth...) */
155 while ((len = strlen(new_path)) && new_path[len - 1] == '\\')
156 new_path[len - 1] = 0;
157 /* find the position of the last '\\' */
158 for (i=0; i<MAX_PATH; i++) {
159 if (new_path[i] == 0) break;
160 if (new_path[i] == '\\')
161 lastslashpos = i;
162 }
163 if (lastslashpos > 0) {
164 new_path[lastslashpos] = 0;
165 /* may be trailing slashes but ensure_filepath2 will chop them */
166 return ensure_filepath2(new_path);
167 } else
168 return TRUE; /* ? */
169 }
170
171 /*******************************************************************
172 * file_open (internal)
173 *
174 * opens a file for output, returns success
175 */
176 BOOL file_open(struct cab_file *fi, BOOL lower, LPCSTR dir)
177 {
178 char c, *s, *d, *name;
179 BOOL ok = FALSE;
180
181 TRACE("(fi == ^%p, lower == %s, dir == %s)\n", fi, lower ? "TRUE" : "FALSE", debugstr_a(dir));
182
183 if (!(name = malloc(strlen(fi->filename) + (dir ? strlen(dir) : 0) + 2))) {
184 ERR("out of memory!\n");
185 return FALSE;
186 }
187
188 /* start with blank name */
189 *name = 0;
190
191 /* add output directory if needed */
192 if (dir) {
193 strcpy(name, dir);
194 strcat(name, "\\");
195 }
196
197 /* remove leading slashes */
198 s = (char *) fi->filename;
199 while (*s == '\\') s++;
200
201 /* copy from fi->filename to new name.
202 * lowercases characters if needed.
203 */
204 d = &name[strlen(name)];
205 do {
206 c = *s++;
207 *d++ = (lower ? tolower((unsigned char) c) : c);
208 } while (c);
209
210 /* create directories if needed, attempt to write file */
211 if (ensure_filepath(name)) {
212 fi->fh = CreateFileA(name, GENERIC_WRITE, 0, NULL,
213 CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, 0);
214 if (fi->fh != INVALID_HANDLE_VALUE)
215 ok = TRUE;
216 else {
217 ERR("CreateFileA returned INVALID_HANDLE_VALUE\n");
218 fi->fh = 0;
219 }
220 } else
221 ERR("Couldn't ensure filepath for %s", debugstr_a(name));
222
223 if (!ok) {
224 ERR("Couldn't open file %s for writing\n", debugstr_a(name));
225 }
226
227 /* as full filename is no longer needed, free it */
228 free(name);
229
230 return ok;
231 }
232
233 /********************************************************
234 * close_file (internal)
235 *
236 * closes a completed file
237 */
238 void file_close(struct cab_file *fi)
239 {
240 TRACE("(fi == ^%p)\n", fi);
241
242 if (fi->fh) {
243 CloseHandle(fi->fh);
244 }
245 fi->fh = 0;
246 }
247
248 /******************************************************************
249 * file_write (internal)
250 *
251 * writes from buf to a file specified as a cab_file struct.
252 * returns success/failure
253 */
254 BOOL file_write(struct cab_file *fi, cab_UBYTE *buf, cab_off_t length)
255 {
256 DWORD bytes_written;
257
258 TRACE("(fi == ^%p, buf == ^%p, length == %u)\n", fi, buf, length);
259
260 if ((!WriteFile( fi->fh, (LPCVOID) buf, length, &bytes_written, FALSE) ||
261 (bytes_written != length))) {
262 ERR("Error writing file: %s\n", debugstr_a(fi->filename));
263 return FALSE;
264 }
265 return TRUE;
266 }
267
268
269 /*******************************************************************
270 * cabinet_skip (internal)
271 *
272 * advance the file pointer associated with the cab structure
273 * by distance bytes
274 */
275 void cabinet_skip(struct cabinet *cab, cab_off_t distance)
276 {
277 TRACE("(cab == ^%p, distance == %u)\n", cab, distance);
278 if (SetFilePointer(cab->fh, distance, NULL, FILE_CURRENT) == INVALID_SET_FILE_POINTER) {
279 if (distance != INVALID_SET_FILE_POINTER)
280 ERR("%s", debugstr_a((char *) cab->filename));
281 }
282 }
283
284 /*******************************************************************
285 * cabinet_seek (internal)
286 *
287 * seek to the specified absolute offset in a cab
288 */
289 void cabinet_seek(struct cabinet *cab, cab_off_t offset) {
290 TRACE("(cab == ^%p, offset == %u)\n", cab, offset);
291 if (SetFilePointer(cab->fh, offset, NULL, FILE_BEGIN) != offset)
292 ERR("%s seek failure\n", debugstr_a((char *)cab->filename));
293 }
294
295 /*******************************************************************
296 * cabinet_getoffset (internal)
297 *
298 * returns the file pointer position of a cab
299 */
300 cab_off_t cabinet_getoffset(struct cabinet *cab)
301 {
302 return SetFilePointer(cab->fh, 0, NULL, FILE_CURRENT);
303 }
304
305 /*******************************************************************
306 * cabinet_read (internal)
307 *
308 * read data from a cabinet, returns success
309 */
310 BOOL cabinet_read(struct cabinet *cab, cab_UBYTE *buf, cab_off_t length)
311 {
312 DWORD bytes_read;
313 cab_off_t avail = cab->filelen - cabinet_getoffset(cab);
314
315 TRACE("(cab == ^%p, buf == ^%p, length == %u)\n", cab, buf, length);
316
317 if (length > avail) {
318 WARN("%s: WARNING; cabinet is truncated\n", debugstr_a((char *)cab->filename));
319 length = avail;
320 }
321
322 if (! ReadFile( cab->fh, (LPVOID) buf, length, &bytes_read, NULL )) {
323 ERR("%s read error\n", debugstr_a((char *) cab->filename));
324 return FALSE;
325 } else if (bytes_read != length) {
326 ERR("%s read size mismatch\n", debugstr_a((char *) cab->filename));
327 return FALSE;
328 }
329
330 return TRUE;
331 }
332
333 /**********************************************************************
334 * cabinet_read_string (internal)
335 *
336 * allocate and read an aribitrarily long string from the cabinet
337 */
338 char *cabinet_read_string(struct cabinet *cab)
339 {
340 cab_off_t len=256, base = cabinet_getoffset(cab), maxlen = cab->filelen - base;
341 BOOL ok = FALSE;
342 int i;
343 cab_UBYTE *buf = NULL;
344
345 TRACE("(cab == ^%p)\n", cab);
346
347 do {
348 if (len > maxlen) len = maxlen;
349 if (!(buf = realloc(buf, (size_t) len))) break;
350 if (!cabinet_read(cab, buf, (size_t) len)) break;
351
352 /* search for a null terminator in what we've just read */
353 for (i=0; i < len; i++) {
354 if (!buf[i]) {ok=TRUE; break;}
355 }
356
357 if (!ok) {
358 if (len == maxlen) {
359 ERR("%s: WARNING; cabinet is truncated\n", debugstr_a((char *) cab->filename));
360 break;
361 }
362 len += 256;
363 cabinet_seek(cab, base);
364 }
365 } while (!ok);
366
367 if (!ok) {
368 if (buf)
369 free(buf);
370 else
371 ERR("out of memory!\n");
372 return NULL;
373 }
374
375 /* otherwise, set the stream to just after the string and return */
376 cabinet_seek(cab, base + ((cab_off_t) strlen((char *) buf)) + 1);
377
378 return (char *) buf;
379 }
380
381 /******************************************************************
382 * cabinet_read_entries (internal)
383 *
384 * reads the header and all folder and file entries in this cabinet
385 */
386 BOOL cabinet_read_entries(struct cabinet *cab)
387 {
388 int num_folders, num_files, header_resv, folder_resv = 0, i;
389 struct cab_folder *fol, *linkfol = NULL;
390 struct cab_file *file, *linkfile = NULL;
391 cab_off_t base_offset;
392 cab_UBYTE buf[64];
393
394 TRACE("(cab == ^%p)\n", cab);
395
396 /* read in the CFHEADER */
397 base_offset = cabinet_getoffset(cab);
398 if (!cabinet_read(cab, buf, cfhead_SIZEOF)) {
399 return FALSE;
400 }
401
402 /* check basic MSCF signature */
403 if (EndGetI32(buf+cfhead_Signature) != 0x4643534d) {
404 ERR("%s: not a Microsoft cabinet file\n", debugstr_a((char *) cab->filename));
405 return FALSE;
406 }
407
408 /* get the number of folders */
409 num_folders = EndGetI16(buf+cfhead_NumFolders);
410 if (num_folders == 0) {
411 ERR("%s: no folders in cabinet\n", debugstr_a((char *) cab->filename));
412 return FALSE;
413 }
414
415 /* get the number of files */
416 num_files = EndGetI16(buf+cfhead_NumFiles);
417 if (num_files == 0) {
418 ERR("%s: no files in cabinet\n", debugstr_a((char *) cab->filename));
419 return FALSE;
420 }
421
422 /* just check the header revision */
423 if ((buf[cfhead_MajorVersion] > 1) ||
424 (buf[cfhead_MajorVersion] == 1 && buf[cfhead_MinorVersion] > 3))
425 {
426 WARN("%s: WARNING; cabinet format version > 1.3\n", debugstr_a((char *) cab->filename));
427 }
428
429 /* read the reserved-sizes part of header, if present */
430 cab->flags = EndGetI16(buf+cfhead_Flags);
431 if (cab->flags & cfheadRESERVE_PRESENT) {
432 if (!cabinet_read(cab, buf, cfheadext_SIZEOF)) return FALSE;
433 header_resv = EndGetI16(buf+cfheadext_HeaderReserved);
434 folder_resv = buf[cfheadext_FolderReserved];
435 cab->block_resv = buf[cfheadext_DataReserved];
436
437 if (header_resv > 60000) {
438 WARN("%s: WARNING; header reserved space > 60000\n", debugstr_a((char *) cab->filename));
439 }
440
441 /* skip the reserved header */
442 if (header_resv)
443 if (SetFilePointer(cab->fh, (cab_off_t) header_resv, NULL, FILE_CURRENT) == INVALID_SET_FILE_POINTER)
444 ERR("seek failure: %s\n", debugstr_a((char *) cab->filename));
445 }
446
447 if (cab->flags & cfheadPREV_CABINET) {
448 cab->prevname = cabinet_read_string(cab);
449 if (!cab->prevname) return FALSE;
450 cab->previnfo = cabinet_read_string(cab);
451 }
452
453 if (cab->flags & cfheadNEXT_CABINET) {
454 cab->nextname = cabinet_read_string(cab);
455 if (!cab->nextname) return FALSE;
456 cab->nextinfo = cabinet_read_string(cab);
457 }
458
459 /* read folders */
460 for (i = 0; i < num_folders; i++) {
461 if (!cabinet_read(cab, buf, cffold_SIZEOF)) return FALSE;
462 if (folder_resv) cabinet_skip(cab, folder_resv);
463
464 fol = (struct cab_folder *) calloc(1, sizeof(struct cab_folder));
465 if (!fol) {
466 ERR("out of memory!\n");
467 return FALSE;
468 }
469
470 fol->cab[0] = cab;
471 fol->offset[0] = base_offset + (cab_off_t) EndGetI32(buf+cffold_DataOffset);
472 fol->num_blocks = EndGetI16(buf+cffold_NumBlocks);
473 fol->comp_type = EndGetI16(buf+cffold_CompType);
474
475 if (!linkfol)
476 cab->folders = fol;
477 else
478 linkfol->next = fol;
479
480 linkfol = fol;
481 }
482
483 /* read files */
484 for (i = 0; i < num_files; i++) {
485 if (!cabinet_read(cab, buf, cffile_SIZEOF))
486 return FALSE;
487
488 file = (struct cab_file *) calloc(1, sizeof(struct cab_file));
489 if (!file) {
490 ERR("out of memory!\n");
491 return FALSE;
492 }
493
494 file->length = EndGetI32(buf+cffile_UncompressedSize);
495 file->offset = EndGetI32(buf+cffile_FolderOffset);
496 file->index = EndGetI16(buf+cffile_FolderIndex);
497 file->time = EndGetI16(buf+cffile_Time);
498 file->date = EndGetI16(buf+cffile_Date);
499 file->attribs = EndGetI16(buf+cffile_Attribs);
500 file->filename = cabinet_read_string(cab);
501
502 if (!file->filename) {
503 free(file);
504 return FALSE;
505 }
506
507 if (!linkfile)
508 cab->files = file;
509 else
510 linkfile->next = file;
511
512 linkfile = file;
513 }
514 return TRUE;
515 }
516
517 /***********************************************************
518 * load_cab_offset (internal)
519 *
520 * validates and reads file entries from a cabinet at offset [offset] in
521 * file [name]. Returns a cabinet structure if successful, or NULL
522 * otherwise.
523 */
524 struct cabinet *load_cab_offset(LPCSTR name, cab_off_t offset)
525 {
526 struct cabinet *cab = (struct cabinet *) calloc(1, sizeof(struct cabinet));
527 int ok;
528
529 TRACE("(name == %s, offset == %u)\n", debugstr_a((char *) name), offset);
530
531 if (!cab) return NULL;
532
533 cab->filename = name;
534 if ((ok = cabinet_open(cab))) {
535 cabinet_seek(cab, offset);
536 ok = cabinet_read_entries(cab);
537 cabinet_close(cab);
538 }
539
540 if (ok) return cab;
541 free(cab);
542 return NULL;
543 }
544
545 /* MSZIP decruncher */
546
547 /* Dirk Stoecker wrote the ZIP decoder, based on the InfoZip deflate code */
548
549 /********************************************************
550 * Ziphuft_free (internal)
551 */
552 void Ziphuft_free(struct Ziphuft *t)
553 {
554 register struct Ziphuft *p, *q;
555
556 /* Go through linked list, freeing from the allocated (t[-1]) address. */
557 p = t;
558 while (p != (struct Ziphuft *)NULL)
559 {
560 q = (--p)->v.t;
561 free(p);
562 p = q;
563 }
564 }
565
566 /*********************************************************
567 * Ziphuft_build (internal)
568 */
569 cab_LONG Ziphuft_build(cab_ULONG *b, cab_ULONG n, cab_ULONG s, cab_UWORD *d, cab_UWORD *e,
570 struct Ziphuft **t, cab_LONG *m, cab_decomp_state *decomp_state)
571 {
572 cab_ULONG a; /* counter for codes of length k */
573 cab_ULONG el; /* length of EOB code (value 256) */
574 cab_ULONG f; /* i repeats in table every f entries */
575 cab_LONG g; /* maximum code length */
576 cab_LONG h; /* table level */
577 register cab_ULONG i; /* counter, current code */
578 register cab_ULONG j; /* counter */
579 register cab_LONG k; /* number of bits in current code */
580 cab_LONG *l; /* stack of bits per table */
581 register cab_ULONG *p; /* pointer into ZIP(c)[],ZIP(b)[],ZIP(v)[] */
582 register struct Ziphuft *q; /* points to current table */
583 struct Ziphuft r; /* table entry for structure assignment */
584 register cab_LONG w; /* bits before this table == (l * h) */
585 cab_ULONG *xp; /* pointer into x */
586 cab_LONG y; /* number of dummy codes added */
587 cab_ULONG z; /* number of entries in current table */
588
589 l = ZIP(lx)+1;
590
591 /* Generate counts for each bit length */
592 el = n > 256 ? b[256] : ZIPBMAX; /* set length of EOB code, if any */
593
594 for(i = 0; i < ZIPBMAX+1; ++i)
595 ZIP(c)[i] = 0;
596 p = b; i = n;
597 do
598 {
599 ZIP(c)[*p]++; p++; /* assume all entries <= ZIPBMAX */
600 } while (--i);
601 if (ZIP(c)[0] == n) /* null input--all zero length codes */
602 {
603 *t = (struct Ziphuft *)NULL;
604 *m = 0;
605 return 0;
606 }
607
608 /* Find minimum and maximum length, bound *m by those */
609 for (j = 1; j <= ZIPBMAX; j++)
610 if (ZIP(c)[j])
611 break;
612 k = j; /* minimum code length */
613 if ((cab_ULONG)*m < j)
614 *m = j;
615 for (i = ZIPBMAX; i; i--)
616 if (ZIP(c)[i])
617 break;
618 g = i; /* maximum code length */
619 if ((cab_ULONG)*m > i)
620 *m = i;
621
622 /* Adjust last length count to fill out codes, if needed */
623 for (y = 1 << j; j < i; j++, y <<= 1)
624 if ((y -= ZIP(c)[j]) < 0)
625 return 2; /* bad input: more codes than bits */
626 if ((y -= ZIP(c)[i]) < 0)
627 return 2;
628 ZIP(c)[i] += y;
629
630 /* Generate starting offsets LONGo the value table for each length */
631 ZIP(x)[1] = j = 0;
632 p = ZIP(c) + 1; xp = ZIP(x) + 2;
633 while (--i)
634 { /* note that i == g from above */
635 *xp++ = (j += *p++);
636 }
637
638 /* Make a table of values in order of bit lengths */
639 p = b; i = 0;
640 do{
641 if ((j = *p++) != 0)
642 ZIP(v)[ZIP(x)[j]++] = i;
643 } while (++i < n);
644
645
646 /* Generate the Huffman codes and for each, make the table entries */
647 ZIP(x)[0] = i = 0; /* first Huffman code is zero */
648 p = ZIP(v); /* grab values in bit order */
649 h = -1; /* no tables yet--level -1 */
650 w = l[-1] = 0; /* no bits decoded yet */
651 ZIP(u)[0] = (struct Ziphuft *)NULL; /* just to keep compilers happy */
652 q = (struct Ziphuft *)NULL; /* ditto */
653 z = 0; /* ditto */
654
655 /* go through the bit lengths (k already is bits in shortest code) */
656 for (; k <= g; k++)
657 {
658 a = ZIP(c)[k];
659 while (a--)
660 {
661 /* here i is the Huffman code of length k bits for value *p */
662 /* make tables up to required level */
663 while (k > w + l[h])
664 {
665 w += l[h++]; /* add bits already decoded */
666
667 /* compute minimum size table less than or equal to *m bits */
668 z = (z = g - w) > (cab_ULONG)*m ? *m : z; /* upper limit */
669 if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */
670 { /* too few codes for k-w bit table */
671 f -= a + 1; /* deduct codes from patterns left */
672 xp = ZIP(c) + k;
673 while (++j < z) /* try smaller tables up to z bits */
674 {
675 if ((f <<= 1) <= *++xp)
676 break; /* enough codes to use up j bits */
677 f -= *xp; /* else deduct codes from patterns */
678 }
679 }
680 if ((cab_ULONG)w + j > el && (cab_ULONG)w < el)
681 j = el - w; /* make EOB code end at table */
682 z = 1 << j; /* table entries for j-bit table */
683 l[h] = j; /* set table size in stack */
684
685 /* allocate and link in new table */
686 if (!(q = (struct Ziphuft *) malloc((z + 1)*sizeof(struct Ziphuft))))
687 {
688 if(h)
689 Ziphuft_free(ZIP(u)[0]);
690 return 3; /* not enough memory */
691 }
692 *t = q + 1; /* link to list for Ziphuft_free() */
693 *(t = &(q->v.t)) = (struct Ziphuft *)NULL;
694 ZIP(u)[h] = ++q; /* table starts after link */
695
696 /* connect to last table, if there is one */
697 if (h)
698 {
699 ZIP(x)[h] = i; /* save pattern for backing up */
700 r.b = (cab_UBYTE)l[h-1]; /* bits to dump before this table */
701 r.e = (cab_UBYTE)(16 + j); /* bits in this table */
702 r.v.t = q; /* pointer to this table */
703 j = (i & ((1 << w) - 1)) >> (w - l[h-1]);
704 ZIP(u)[h-1][j] = r; /* connect to last table */
705 }
706 }
707
708 /* set up table entry in r */
709 r.b = (cab_UBYTE)(k - w);
710 if (p >= ZIP(v) + n)
711 r.e = 99; /* out of values--invalid code */
712 else if (*p < s)
713 {
714 r.e = (cab_UBYTE)(*p < 256 ? 16 : 15); /* 256 is end-of-block code */
715 r.v.n = *p++; /* simple code is just the value */
716 }
717 else
718 {
719 r.e = (cab_UBYTE)e[*p - s]; /* non-simple--look up in lists */
720 r.v.n = d[*p++ - s];
721 }
722
723 /* fill code-like entries with r */
724 f = 1 << (k - w);
725 for (j = i >> w; j < z; j += f)
726 q[j] = r;
727
728 /* backwards increment the k-bit code i */
729 for (j = 1 << (k - 1); i & j; j >>= 1)
730 i ^= j;
731 i ^= j;
732
733 /* backup over finished tables */
734 while ((i & ((1 << w) - 1)) != ZIP(x)[h])
735 w -= l[--h]; /* don't need to update q */
736 }
737 }
738
739 /* return actual size of base table */
740 *m = l[0];
741
742 /* Return true (1) if we were given an incomplete table */
743 return y != 0 && g != 1;
744 }
745
746 /*********************************************************
747 * Zipinflate_codes (internal)
748 */
749 cab_LONG Zipinflate_codes(struct Ziphuft *tl, struct Ziphuft *td,
750 cab_LONG bl, cab_LONG bd, cab_decomp_state *decomp_state)
751 {
752 register cab_ULONG e; /* table entry flag/number of extra bits */
753 cab_ULONG n, d; /* length and index for copy */
754 cab_ULONG w; /* current window position */
755 struct Ziphuft *t; /* pointer to table entry */
756 cab_ULONG ml, md; /* masks for bl and bd bits */
757 register cab_ULONG b; /* bit buffer */
758 register cab_ULONG k; /* number of bits in bit buffer */
759
760 /* make local copies of globals */
761 b = ZIP(bb); /* initialize bit buffer */
762 k = ZIP(bk);
763 w = ZIP(window_posn); /* initialize window position */
764
765 /* inflate the coded data */
766 ml = Zipmask[bl]; /* precompute masks for speed */
767 md = Zipmask[bd];
768
769 for(;;)
770 {
771 ZIPNEEDBITS((cab_ULONG)bl)
772 if((e = (t = tl + ((cab_ULONG)b & ml))->e) > 16)
773 do
774 {
775 if (e == 99)
776 return 1;
777 ZIPDUMPBITS(t->b)
778 e -= 16;
779 ZIPNEEDBITS(e)
780 } while ((e = (t = t->v.t + ((cab_ULONG)b & Zipmask[e]))->e) > 16);
781 ZIPDUMPBITS(t->b)
782 if (e == 16) /* then it's a literal */
783 CAB(outbuf)[w++] = (cab_UBYTE)t->v.n;
784 else /* it's an EOB or a length */
785 {
786 /* exit if end of block */
787 if(e == 15)
788 break;
789
790 /* get length of block to copy */
791 ZIPNEEDBITS(e)
792 n = t->v.n + ((cab_ULONG)b & Zipmask[e]);
793 ZIPDUMPBITS(e);
794
795 /* decode distance of block to copy */
796 ZIPNEEDBITS((cab_ULONG)bd)
797 if ((e = (t = td + ((cab_ULONG)b & md))->e) > 16)
798 do {
799 if (e == 99)
800 return 1;
801 ZIPDUMPBITS(t->b)
802 e -= 16;
803 ZIPNEEDBITS(e)
804 } while ((e = (t = t->v.t + ((cab_ULONG)b & Zipmask[e]))->e) > 16);
805 ZIPDUMPBITS(t->b)
806 ZIPNEEDBITS(e)
807 d = w - t->v.n - ((cab_ULONG)b & Zipmask[e]);
808 ZIPDUMPBITS(e)
809 do
810 {
811 n -= (e = (e = ZIPWSIZE - ((d &= ZIPWSIZE-1) > w ? d : w)) > n ?n:e);
812 do
813 {
814 CAB(outbuf)[w++] = CAB(outbuf)[d++];
815 } while (--e);
816 } while (n);
817 }
818 }
819
820 /* restore the globals from the locals */
821 ZIP(window_posn) = w; /* restore global window pointer */
822 ZIP(bb) = b; /* restore global bit buffer */
823 ZIP(bk) = k;
824
825 /* done */
826 return 0;
827 }
828
829 /***********************************************************
830 * Zipinflate_stored (internal)
831 */
832 cab_LONG Zipinflate_stored(cab_decomp_state *decomp_state)
833 /* "decompress" an inflated type 0 (stored) block. */
834 {
835 cab_ULONG n; /* number of bytes in block */
836 cab_ULONG w; /* current window position */
837 register cab_ULONG b; /* bit buffer */
838 register cab_ULONG k; /* number of bits in bit buffer */
839
840 /* make local copies of globals */
841 b = ZIP(bb); /* initialize bit buffer */
842 k = ZIP(bk);
843 w = ZIP(window_posn); /* initialize window position */
844
845 /* go to byte boundary */
846 n = k & 7;
847 ZIPDUMPBITS(n);
848
849 /* get the length and its complement */
850 ZIPNEEDBITS(16)
851 n = ((cab_ULONG)b & 0xffff);
852 ZIPDUMPBITS(16)
853 ZIPNEEDBITS(16)
854 if (n != (cab_ULONG)((~b) & 0xffff))
855 return 1; /* error in compressed data */
856 ZIPDUMPBITS(16)
857
858 /* read and output the compressed data */
859 while(n--)
860 {
861 ZIPNEEDBITS(8)
862 CAB(outbuf)[w++] = (cab_UBYTE)b;
863 ZIPDUMPBITS(8)
864 }
865
866 /* restore the globals from the locals */
867 ZIP(window_posn) = w; /* restore global window pointer */
868 ZIP(bb) = b; /* restore global bit buffer */
869 ZIP(bk) = k;
870 return 0;
871 }
872
873 /******************************************************
874 * Zipinflate_fixed (internal)
875 */
876 cab_LONG Zipinflate_fixed(cab_decomp_state *decomp_state)
877 {
878 struct Ziphuft *fixed_tl;
879 struct Ziphuft *fixed_td;
880 cab_LONG fixed_bl, fixed_bd;
881 cab_LONG i; /* temporary variable */
882 cab_ULONG *l;
883
884 l = ZIP(ll);
885
886 /* literal table */
887 for(i = 0; i < 144; i++)
888 l[i] = 8;
889 for(; i < 256; i++)
890 l[i] = 9;
891 for(; i < 280; i++)
892 l[i] = 7;
893 for(; i < 288; i++) /* make a complete, but wrong code set */
894 l[i] = 8;
895 fixed_bl = 7;
896 if((i = Ziphuft_build(l, 288, 257, (cab_UWORD *) Zipcplens,
897 (cab_UWORD *) Zipcplext, &fixed_tl, &fixed_bl, decomp_state)))
898 return i;
899
900 /* distance table */
901 for(i = 0; i < 30; i++) /* make an incomplete code set */
902 l[i] = 5;
903 fixed_bd = 5;
904 if((i = Ziphuft_build(l, 30, 0, (cab_UWORD *) Zipcpdist, (cab_UWORD *) Zipcpdext,
905 &fixed_td, &fixed_bd, decomp_state)) > 1)
906 {
907 Ziphuft_free(fixed_tl);
908 return i;
909 }
910
911 /* decompress until an end-of-block code */
912 i = Zipinflate_codes(fixed_tl, fixed_td, fixed_bl, fixed_bd, decomp_state);
913
914 Ziphuft_free(fixed_td);
915 Ziphuft_free(fixed_tl);
916 return i;
917 }
918
919 /**************************************************************
920 * Zipinflate_dynamic (internal)
921 */
922 cab_LONG Zipinflate_dynamic(cab_decomp_state *decomp_state)
923 /* decompress an inflated type 2 (dynamic Huffman codes) block. */
924 {
925 cab_LONG i; /* temporary variables */
926 cab_ULONG j;
927 cab_ULONG *ll;
928 cab_ULONG l; /* last length */
929 cab_ULONG m; /* mask for bit lengths table */
930 cab_ULONG n; /* number of lengths to get */
931 struct Ziphuft *tl; /* literal/length code table */
932 struct Ziphuft *td; /* distance code table */
933 cab_LONG bl; /* lookup bits for tl */
934 cab_LONG bd; /* lookup bits for td */
935 cab_ULONG nb; /* number of bit length codes */
936 cab_ULONG nl; /* number of literal/length codes */
937 cab_ULONG nd; /* number of distance codes */
938 register cab_ULONG b; /* bit buffer */
939 register cab_ULONG k; /* number of bits in bit buffer */
940
941 /* make local bit buffer */
942 b = ZIP(bb);
943 k = ZIP(bk);
944 ll = ZIP(ll);
945
946 /* read in table lengths */
947 ZIPNEEDBITS(5)
948 nl = 257 + ((cab_ULONG)b & 0x1f); /* number of literal/length codes */
949 ZIPDUMPBITS(5)
950 ZIPNEEDBITS(5)
951 nd = 1 + ((cab_ULONG)b & 0x1f); /* number of distance codes */
952 ZIPDUMPBITS(5)
953 ZIPNEEDBITS(4)
954 nb = 4 + ((cab_ULONG)b & 0xf); /* number of bit length codes */
955 ZIPDUMPBITS(4)
956 if(nl > 288 || nd > 32)
957 return 1; /* bad lengths */
958
959 /* read in bit-length-code lengths */
960 for(j = 0; j < nb; j++)
961 {
962 ZIPNEEDBITS(3)
963 ll[Zipborder[j]] = (cab_ULONG)b & 7;
964 ZIPDUMPBITS(3)
965 }
966 for(; j < 19; j++)
967 ll[Zipborder[j]] = 0;
968
969 /* build decoding table for trees--single level, 7 bit lookup */
970 bl = 7;
971 if((i = Ziphuft_build(ll, 19, 19, NULL, NULL, &tl, &bl, decomp_state)) != 0)
972 {
973 if(i == 1)
974 Ziphuft_free(tl);
975 return i; /* incomplete code set */
976 }
977
978 /* read in literal and distance code lengths */
979 n = nl + nd;
980 m = Zipmask[bl];
981 i = l = 0;
982 while((cab_ULONG)i < n)
983 {
984 ZIPNEEDBITS((cab_ULONG)bl)
985 j = (td = tl + ((cab_ULONG)b & m))->b;
986 ZIPDUMPBITS(j)
987 j = td->v.n;
988 if (j < 16) /* length of code in bits (0..15) */
989 ll[i++] = l = j; /* save last length in l */
990 else if (j == 16) /* repeat last length 3 to 6 times */
991 {
992 ZIPNEEDBITS(2)
993 j = 3 + ((cab_ULONG)b & 3);
994 ZIPDUMPBITS(2)
995 if((cab_ULONG)i + j > n)
996 return 1;
997 while (j--)
998 ll[i++] = l;
999 }
1000 else if (j == 17) /* 3 to 10 zero length codes */
1001 {
1002 ZIPNEEDBITS(3)
1003 j = 3 + ((cab_ULONG)b & 7);
1004 ZIPDUMPBITS(3)
1005 if ((cab_ULONG)i + j > n)
1006 return 1;
1007 while (j--)
1008 ll[i++] = 0;
1009 l = 0;
1010 }
1011 else /* j == 18: 11 to 138 zero length codes */
1012 {
1013 ZIPNEEDBITS(7)
1014 j = 11 + ((cab_ULONG)b & 0x7f);
1015 ZIPDUMPBITS(7)
1016 if ((cab_ULONG)i + j > n)
1017 return 1;
1018 while (j--)
1019 ll[i++] = 0;
1020 l = 0;
1021 }
1022 }
1023
1024 /* free decoding table for trees */
1025 Ziphuft_free(tl);
1026
1027 /* restore the global bit buffer */
1028 ZIP(bb) = b;
1029 ZIP(bk) = k;
1030
1031 /* build the decoding tables for literal/length and distance codes */
1032 bl = ZIPLBITS;
1033 if((i = Ziphuft_build(ll, nl, 257, (cab_UWORD *) Zipcplens, (cab_UWORD *) Zipcplext,
1034 &tl, &bl, decomp_state)) != 0)
1035 {
1036 if(i == 1)
1037 Ziphuft_free(tl);
1038 return i; /* incomplete code set */
1039 }
1040 bd = ZIPDBITS;
1041 Ziphuft_build(ll + nl, nd, 0, (cab_UWORD *) Zipcpdist, (cab_UWORD *) Zipcpdext,
1042 &td, &bd, decomp_state);
1043
1044 /* decompress until an end-of-block code */
1045 if(Zipinflate_codes(tl, td, bl, bd, decomp_state))
1046 return 1;
1047
1048 /* free the decoding tables, return */
1049 Ziphuft_free(tl);
1050 Ziphuft_free(td);
1051 return 0;
1052 }
1053
1054 /*****************************************************
1055 * Zipinflate_block (internal)
1056 */
1057 cab_LONG Zipinflate_block(cab_LONG *e, cab_decomp_state *decomp_state) /* e == last block flag */
1058 { /* decompress an inflated block */
1059 cab_ULONG t; /* block type */
1060 register cab_ULONG b; /* bit buffer */
1061 register cab_ULONG k; /* number of bits in bit buffer */
1062
1063 /* make local bit buffer */
1064 b = ZIP(bb);
1065 k = ZIP(bk);
1066
1067 /* read in last block bit */
1068 ZIPNEEDBITS(1)
1069 *e = (cab_LONG)b & 1;
1070 ZIPDUMPBITS(1)
1071
1072 /* read in block type */
1073 ZIPNEEDBITS(2)
1074 t = (cab_ULONG)b & 3;
1075 ZIPDUMPBITS(2)
1076
1077 /* restore the global bit buffer */
1078 ZIP(bb) = b;
1079 ZIP(bk) = k;
1080
1081 /* inflate that block type */
1082 if(t == 2)
1083 return Zipinflate_dynamic(decomp_state);
1084 if(t == 0)
1085 return Zipinflate_stored(decomp_state);
1086 if(t == 1)
1087 return Zipinflate_fixed(decomp_state);
1088 /* bad block type */
1089 return 2;
1090 }
1091
1092 /****************************************************
1093 * ZIPdecompress (internal)
1094 */
1095 int ZIPdecompress(int inlen, int outlen, cab_decomp_state *decomp_state)
1096 {
1097 cab_LONG e; /* last block flag */
1098
1099 TRACE("(inlen == %d, outlen == %d)\n", inlen, outlen);
1100
1101 ZIP(inpos) = CAB(inbuf);
1102 ZIP(bb) = ZIP(bk) = ZIP(window_posn) = 0;
1103 if(outlen > ZIPWSIZE)
1104 return DECR_DATAFORMAT;
1105
1106 /* CK = Chris Kirmse, official Microsoft purloiner */
1107 if(ZIP(inpos)[0] != 0x43 || ZIP(inpos)[1] != 0x4B)
1108 return DECR_ILLEGALDATA;
1109 ZIP(inpos) += 2;
1110
1111 do
1112 {
1113 if(Zipinflate_block(&e, decomp_state))
1114 return DECR_ILLEGALDATA;
1115 } while(!e);
1116
1117 /* return success */
1118 return DECR_OK;
1119 }
1120
1121 /* Quantum decruncher */
1122
1123 /* This decruncher was researched and implemented by Matthew Russoto. */
1124 /* It has since been tidied up by Stuart Caie */
1125
1126 /* FIXME: eliminate global variables */
1127 static cab_UBYTE q_length_base[27], q_length_extra[27], q_extra_bits[42];
1128 static cab_ULONG q_position_base[42];
1129
1130 /******************************************************************
1131 * QTMinitmodel (internal)
1132 *
1133 * Initialise a model which decodes symbols from [s] to [s]+[n]-1
1134 */
1135 void QTMinitmodel(struct QTMmodel *m, struct QTMmodelsym *sym, int n, int s) {
1136 int i;
1137 m->shiftsleft = 4;
1138 m->entries = n;
1139 m->syms = sym;
1140 memset(m->tabloc, 0xFF, sizeof(m->tabloc)); /* clear out look-up table */
1141 for (i = 0; i < n; i++) {
1142 m->tabloc[i+s] = i; /* set up a look-up entry for symbol */
1143 m->syms[i].sym = i+s; /* actual symbol */
1144 m->syms[i].cumfreq = n-i; /* current frequency of that symbol */
1145 }
1146 m->syms[n].cumfreq = 0;
1147 }
1148
1149 /******************************************************************
1150 * QTMinit (internal)
1151 */
1152 int QTMinit(int window, int level, cab_decomp_state *decomp_state) {
1153 int wndsize = 1 << window, msz = window * 2, i;
1154 cab_ULONG j;
1155
1156 /* QTM supports window sizes of 2^10 (1Kb) through 2^21 (2Mb) */
1157 /* if a previously allocated window is big enough, keep it */
1158 if (window < 10 || window > 21) return DECR_DATAFORMAT;
1159 if (QTM(actual_size) < wndsize) {
1160 if (QTM(window)) free(QTM(window));
1161 QTM(window) = NULL;
1162 }
1163 if (!QTM(window)) {
1164 if (!(QTM(window) = malloc(wndsize))) return DECR_NOMEMORY;
1165 QTM(actual_size) = wndsize;
1166 }
1167 QTM(window_size) = wndsize;
1168 QTM(window_posn) = 0;
1169
1170 /* initialise static slot/extrabits tables */
1171 for (i = 0, j = 0; i < 27; i++) {
1172 q_length_extra[i] = (i == 26) ? 0 : (i < 2 ? 0 : i - 2) >> 2;
1173 q_length_base[i] = j; j += 1 << ((i == 26) ? 5 : q_length_extra[i]);
1174 }
1175 for (i = 0, j = 0; i < 42; i++) {
1176 q_extra_bits[i] = (i < 2 ? 0 : i-2) >> 1;
1177 q_position_base[i] = j; j += 1 << q_extra_bits[i];
1178 }
1179
1180 /* initialise arithmetic coding models */
1181
1182 QTMinitmodel(&QTM(model7), &QTM(m7sym)[0], 7, 0);
1183
1184 QTMinitmodel(&QTM(model00), &QTM(m00sym)[0], 0x40, 0x00);
1185 QTMinitmodel(&QTM(model40), &QTM(m40sym)[0], 0x40, 0x40);
1186 QTMinitmodel(&QTM(model80), &QTM(m80sym)[0], 0x40, 0x80);
1187 QTMinitmodel(&QTM(modelC0), &QTM(mC0sym)[0], 0x40, 0xC0);
1188
1189 /* model 4 depends on table size, ranges from 20 to 24 */
1190 QTMinitmodel(&QTM(model4), &QTM(m4sym)[0], (msz < 24) ? msz : 24, 0);
1191 /* model 5 depends on table size, ranges from 20 to 36 */
1192 QTMinitmodel(&QTM(model5), &QTM(m5sym)[0], (msz < 36) ? msz : 36, 0);
1193 /* model 6pos depends on table size, ranges from 20 to 42 */
1194 QTMinitmodel(&QTM(model6pos), &QTM(m6psym)[0], msz, 0);
1195 QTMinitmodel(&QTM(model6len), &QTM(m6lsym)[0], 27, 0);
1196
1197 return DECR_OK;
1198 }
1199
1200 /****************************************************************
1201 * QTMupdatemodel (internal)
1202 */
1203 void QTMupdatemodel(struct QTMmodel *model, int sym) {
1204 struct QTMmodelsym temp;
1205 int i, j;
1206
1207 for (i = 0; i < sym; i++) model->syms[i].cumfreq += 8;
1208
1209 if (model->syms[0].cumfreq > 3800) {
1210 if (--model->shiftsleft) {
1211 for (i = model->entries - 1; i >= 0; i--) {
1212 /* -1, not -2; the 0 entry saves this */
1213 model->syms[i].cumfreq >>= 1;
1214 if (model->syms[i].cumfreq <= model->syms[i+1].cumfreq) {
1215 model->syms[i].cumfreq = model->syms[i+1].cumfreq + 1;
1216 }
1217 }
1218 }
1219 else {
1220 model->shiftsleft = 50;
1221 for (i = 0; i < model->entries ; i++) {
1222 /* no -1, want to include the 0 entry */
1223 /* this converts cumfreqs into frequencies, then shifts right */
1224 model->syms[i].cumfreq -= model->syms[i+1].cumfreq;
1225 model->syms[i].cumfreq++; /* avoid losing things entirely */
1226 model->syms[i].cumfreq >>= 1;
1227 }
1228
1229 /* now sort by frequencies, decreasing order -- this must be an
1230 * inplace selection sort, or a sort with the same (in)stability
1231 * characteristics
1232 */
1233 for (i = 0; i < model->entries - 1; i++) {
1234 for (j = i + 1; j < model->entries; j++) {
1235 if (model->syms[i].cumfreq < model->syms[j].cumfreq) {
1236 temp = model->syms[i];
1237 model->syms[i] = model->syms[j];
1238 model->syms[j] = temp;
1239 }
1240 }
1241 }
1242
1243 /* then convert frequencies back to cumfreq */
1244 for (i = model->entries - 1; i >= 0; i--) {
1245 model->syms[i].cumfreq += model->syms[i+1].cumfreq;
1246 }
1247 /* then update the other part of the table */
1248 for (i = 0; i < model->entries; i++) {
1249 model->tabloc[model->syms[i].sym] = i;
1250 }
1251 }
1252 }
1253 }
1254
1255 /*******************************************************************
1256 * QTMdecompress (internal)
1257 */
1258 int QTMdecompress(int inlen, int outlen, cab_decomp_state *decomp_state)
1259 {
1260 cab_UBYTE *inpos = CAB(inbuf);
1261 cab_UBYTE *window = QTM(window);
1262 cab_UBYTE *runsrc, *rundest;
1263
1264 cab_ULONG window_posn = QTM(window_posn);
1265 cab_ULONG window_size = QTM(window_size);
1266
1267 /* used by bitstream macros */
1268 register int bitsleft, bitrun, bitsneed;
1269 register cab_ULONG bitbuf;
1270
1271 /* used by GET_SYMBOL */
1272 cab_ULONG range;
1273 cab_UWORD symf;
1274 int i;
1275
1276 int extra, togo = outlen, match_length = 0, copy_length;
1277 cab_UBYTE selector, sym;
1278 cab_ULONG match_offset = 0;
1279
1280 cab_UWORD H = 0xFFFF, L = 0, C;
1281
1282 TRACE("(inlen == %d, outlen == %d)\n", inlen, outlen);
1283
1284 /* read initial value of C */
1285 Q_INIT_BITSTREAM;
1286 Q_READ_BITS(C, 16);
1287
1288 /* apply 2^x-1 mask */
1289 window_posn &= window_size - 1;
1290 /* runs can't straddle the window wraparound */
1291 if ((window_posn + togo) > window_size) {
1292 TRACE("straddled run\n");
1293 return DECR_DATAFORMAT;
1294 }
1295
1296 while (togo > 0) {
1297 GET_SYMBOL(model7, selector);
1298 switch (selector) {
1299 case 0:
1300 GET_SYMBOL(model00, sym); window[window_posn++] = sym; togo--;
1301 break;
1302 case 1:
1303 GET_SYMBOL(model40, sym); window[window_posn++] = sym; togo--;
1304 break;
1305 case 2:
1306 GET_SYMBOL(model80, sym); window[window_posn++] = sym; togo--;
1307 break;
1308 case 3:
1309 GET_SYMBOL(modelC0, sym); window[window_posn++] = sym; togo--;
1310 break;
1311
1312 case 4:
1313 /* selector 4 = fixed length of 3 */
1314 GET_SYMBOL(model4, sym);
1315 Q_READ_BITS(extra, q_extra_bits[sym]);
1316 match_offset = q_position_base[sym] + extra + 1;
1317 match_length = 3;
1318 break;
1319
1320 case 5:
1321 /* selector 5 = fixed length of 4 */
1322 GET_SYMBOL(model5, sym);
1323 Q_READ_BITS(extra, q_extra_bits[sym]);
1324 match_offset = q_position_base[sym] + extra + 1;
1325 match_length = 4;
1326 break;
1327
1328 case 6:
1329 /* selector 6 = variable length */
1330 GET_SYMBOL(model6len, sym);
1331 Q_READ_BITS(extra, q_length_extra[sym]);
1332 match_length = q_length_base[sym] + extra + 5;
1333 GET_SYMBOL(model6pos, sym);
1334 Q_READ_BITS(extra, q_extra_bits[sym]);
1335 match_offset = q_position_base[sym] + extra + 1;
1336 break;
1337
1338 default:
1339 TRACE("Selector is bogus\n");
1340 return DECR_ILLEGALDATA;
1341 }
1342
1343 /* if this is a match */
1344 if (selector >= 4) {
1345 rundest = window + window_posn;
1346 togo -= match_length;
1347
1348 /* copy any wrapped around source data */
1349 if (window_posn >= match_offset) {
1350 /* no wrap */
1351 runsrc = rundest - match_offset;
1352 } else {
1353 runsrc = rundest + (window_size - match_offset);
1354 copy_length = match_offset - window_posn;
1355 if (copy_length < match_length) {
1356 match_length -= copy_length;
1357 window_posn += copy_length;
1358 while (copy_length-- > 0) *rundest++ = *runsrc++;
1359 runsrc = window;
1360 }
1361 }
1362 window_posn += match_length;
1363
1364 /* copy match data - no worries about destination wraps */
1365 while (match_length-- > 0) *rundest++ = *runsrc++;
1366 }
1367 } /* while (togo > 0) */
1368
1369 if (togo != 0) {
1370 TRACE("Frame overflow, this_run = %d\n", togo);
1371 return DECR_ILLEGALDATA;
1372 }
1373
1374 memcpy(CAB(outbuf), window + ((!window_posn) ? window_size : window_posn) -
1375 outlen, outlen);
1376
1377 QTM(window_posn) = window_posn;
1378 return DECR_OK;
1379 }
1380
1381 /* LZX decruncher */
1382
1383 /* Microsoft's LZX document and their implementation of the
1384 * com.ms.util.cab Java package do not concur.
1385 *
1386 * In the LZX document, there is a table showing the correlation between
1387 * window size and the number of position slots. It states that the 1MB
1388 * window = 40 slots and the 2MB window = 42 slots. In the implementation,
1389 * 1MB = 42 slots, 2MB = 50 slots. The actual calculation is 'find the
1390 * first slot whose position base is equal to or more than the required
1391 * window size'. This would explain why other tables in the document refer
1392 * to 50 slots rather than 42.
1393 *
1394 * The constant NUM_PRIMARY_LENGTHS used in the decompression pseudocode
1395 * is not defined in the specification.
1396 *
1397 * The LZX document does not state the uncompressed block has an
1398 * uncompressed length field. Where does this length field come from, so
1399 * we can know how large the block is? The implementation has it as the 24
1400 * bits following after the 3 blocktype bits, before the alignment
1401 * padding.
1402 *
1403 * The LZX document states that aligned offset blocks have their aligned
1404 * offset huffman tree AFTER the main and length trees. The implementation
1405 * suggests that the aligned offset tree is BEFORE the main and length
1406 * trees.
1407 *
1408 * The LZX document decoding algorithm states that, in an aligned offset
1409 * block, if an extra_bits value is 1, 2 or 3, then that number of bits
1410 * should be read and the result added to the match offset. This is
1411 * correct for 1 and 2, but not 3, where just a huffman symbol (using the
1412 * aligned tree) should be read.
1413 *
1414 * Regarding the E8 preprocessing, the LZX document states 'No translation
1415 * may be performed on the last 6 bytes of the input block'. This is
1416 * correct. However, the pseudocode provided checks for the *E8 leader*
1417 * up to the last 6 bytes. If the leader appears between -10 and -7 bytes
1418 * from the end, this would cause the next four bytes to be modified, at
1419 * least one of which would be in the last 6 bytes, which is not allowed
1420 * according to the spec.
1421 *
1422 * The specification states that the huffman trees must always contain at
1423 * least one element. However, many CAB files contain blocks where the
1424 * length tree is completely empty (because there are no matches), and
1425 * this is expected to succeed.
1426 */
1427
1428
1429 /* LZX uses what it calls 'position slots' to represent match offsets.
1430 * What this means is that a small 'position slot' number and a small
1431 * offset from that slot are encoded instead of one large offset for
1432 * every match.
1433 * - lzx_position_base is an index to the position slot bases
1434 * - lzx_extra_bits states how many bits of offset-from-base data is needed.
1435 */
1436
1437 /* FIXME: Eliminate global variables */
1438 static cab_ULONG lzx_position_base[51];
1439 static cab_UBYTE extra_bits[51];
1440
1441 /************************************************************
1442 * LZXinit (internal)
1443 */
1444 int LZXinit(int window, cab_decomp_state *decomp_state) {
1445 cab_ULONG wndsize = 1 << window;
1446 int i, j, posn_slots;
1447
1448 /* LZX supports window sizes of 2^15 (32Kb) through 2^21 (2Mb) */
1449 /* if a previously allocated window is big enough, keep it */
1450 if (window < 15 || window > 21) return DECR_DATAFORMAT;
1451 if (LZX(actual_size) < wndsize) {
1452 if (LZX(window)) free(LZX(window));
1453 LZX(window) = NULL;
1454 }
1455 if (!LZX(window)) {
1456 if (!(LZX(window) = malloc(wndsize))) return DECR_NOMEMORY;
1457 LZX(actual_size) = wndsize;
1458 }
1459 LZX(window_size) = wndsize;
1460
1461 /* initialise static tables */
1462 for (i=0, j=0; i <= 50; i += 2) {
1463 extra_bits[i] = extra_bits[i+1] = j; /* 0,0,0,0,1,1,2,2,3,3... */
1464 if ((i != 0) && (j < 17)) j++; /* 0,0,1,2,3,4...15,16,17,17,17,17... */
1465 }
1466 for (i=0, j=0; i <= 50; i++) {
1467 lzx_position_base[i] = j; /* 0,1,2,3,4,6,8,12,16,24,32,... */
1468 j += 1 << extra_bits[i]; /* 1,1,1,1,2,2,4,4,8,8,16,16,32,32,... */
1469 }
1470
1471 /* calculate required position slots */
1472 if (window == 20) posn_slots = 42;
1473 else if (window == 21) posn_slots = 50;
1474 else posn_slots = window << 1;
1475
1476 /*posn_slots=i=0; while (i < wndsize) i += 1 << extra_bits[posn_slots++]; */
1477
1478 LZX(R0) = LZX(R1) = LZX(R2) = 1;
1479 LZX(main_elements) = LZX_NUM_CHARS + (posn_slots << 3);
1480 LZX(header_read) = 0;
1481 LZX(frames_read) = 0;
1482 LZX(block_remaining) = 0;
1483 LZX(block_type) = LZX_BLOCKTYPE_INVALID;
1484 LZX(intel_curpos) = 0;
1485 LZX(intel_started) = 0;
1486 LZX(window_posn) = 0;
1487
1488 /* initialise tables to 0 (because deltas will be applied to them) */
1489 for (i = 0; i < LZX_MAINTREE_MAXSYMBOLS; i++) LZX(MAINTREE_len)[i] = 0;
1490 for (i = 0; i < LZX_LENGTH_MAXSYMBOLS; i++) LZX(LENGTH_len)[i] = 0;
1491
1492 return DECR_OK;
1493 }
1494
1495 /*************************************************************************
1496 * make_decode_table (internal)
1497 *
1498 * This function was coded by David Tritscher. It builds a fast huffman
1499 * decoding table out of just a canonical huffman code lengths table.
1500 *
1501 * PARAMS
1502 * nsyms: total number of symbols in this huffman tree.
1503 * nbits: any symbols with a code length of nbits or less can be decoded
1504 * in one lookup of the table.
1505 * length: A table to get code lengths from [0 to syms-1]
1506 * table: The table to fill up with decoded symbols and pointers.
1507 *
1508 * RETURNS
1509 * OK: 0
1510 * error: 1
1511 */
1512 int make_decode_table(cab_ULONG nsyms, cab_ULONG nbits, cab_UBYTE *length, cab_UWORD *table) {
1513 register cab_UWORD sym;
1514 register cab_ULONG leaf;
1515 register cab_UBYTE bit_num = 1;
1516 cab_ULONG fill;
1517 cab_ULONG pos = 0; /* the current position in the decode table */
1518 cab_ULONG table_mask = 1 << nbits;
1519 cab_ULONG bit_mask = table_mask >> 1; /* don't do 0 length codes */
1520 cab_ULONG next_symbol = bit_mask; /* base of allocation for long codes */
1521
1522 /* fill entries for codes short enough for a direct mapping */
1523 while (bit_num <= nbits) {
1524 for (sym = 0; sym < nsyms; sym++) {
1525 if (length[sym] == bit_num) {
1526 leaf = pos;
1527
1528 if((pos += bit_mask) > table_mask) return 1; /* table overrun */
1529
1530 /* fill all possible lookups of this symbol with the symbol itself */
1531 fill = bit_mask;
1532 while (fill-- > 0) table[leaf++] = sym;
1533 }
1534 }
1535 bit_mask >>= 1;
1536 bit_num++;
1537 }
1538
1539 /* if there are any codes longer than nbits */
1540 if (pos != table_mask) {
1541 /* clear the remainder of the table */
1542 for (sym = pos; sym < table_mask; sym++) table[sym] = 0;
1543
1544 /* give ourselves room for codes to grow by up to 16 more bits */
1545 pos <<= 16;
1546 table_mask <<= 16;
1547 bit_mask = 1 << 15;
1548
1549 while (bit_num <= 16) {
1550 for (sym = 0; sym < nsyms; sym++) {
1551 if (length[sym] == bit_num) {
1552 leaf = pos >> 16;
1553 for (fill = 0; fill < bit_num - nbits; fill++) {
1554 /* if this path hasn't been taken yet, 'allocate' two entries */
1555 if (table[leaf] == 0) {
1556 table[(next_symbol << 1)] = 0;
1557 table[(next_symbol << 1) + 1] = 0;
1558 table[leaf] = next_symbol++;
1559 }
1560 /* follow the path and select either left or right for next bit */
1561 leaf = table[leaf] << 1;
1562 if ((pos >> (15-fill)) & 1) leaf++;
1563 }
1564 table[leaf] = sym;
1565
1566 if ((pos += bit_mask) > table_mask) return 1; /* table overflow */
1567 }
1568 }
1569 bit_mask >>= 1;
1570 bit_num++;
1571 }
1572 }
1573
1574 /* full table? */
1575 if (pos == table_mask) return 0;
1576
1577 /* either erroneous table, or all elements are 0 - let's find out. */
1578 for (sym = 0; sym < nsyms; sym++) if (length[sym]) return 1;
1579 return 0;
1580 }
1581
1582 /************************************************************
1583 * lzx_read_lens (internal)
1584 */
1585 int lzx_read_lens(cab_UBYTE *lens, cab_ULONG first, cab_ULONG last, struct lzx_bits *lb,
1586 cab_decomp_state *decomp_state) {
1587 cab_ULONG i,j, x,y;
1588 int z;
1589
1590 register cab_ULONG bitbuf = lb->bb;
1591 register int bitsleft = lb->bl;
1592 cab_UBYTE *inpos = lb->ip;
1593 cab_UWORD *hufftbl;
1594
1595 for (x = 0; x < 20; x++) {
1596 READ_BITS(y, 4);
1597 LENTABLE(PRETREE)[x] = y;
1598 }
1599 BUILD_TABLE(PRETREE);
1600
1601 for (x = first; x < last; ) {
1602 READ_HUFFSYM(PRETREE, z);
1603 if (z == 17) {
1604 READ_BITS(y, 4); y += 4;
1605 while (y--) lens[x++] = 0;
1606 }
1607 else if (z == 18) {
1608 READ_BITS(y, 5); y += 20;
1609 while (y--) lens[x++] = 0;
1610 }
1611 else if (z == 19) {
1612 READ_BITS(y, 1); y += 4;
1613 READ_HUFFSYM(PRETREE, z);
1614 z = lens[x] - z; if (z < 0) z += 17;
1615 while (y--) lens[x++] = z;
1616 }
1617 else {
1618 z = lens[x] - z; if (z < 0) z += 17;
1619 lens[x++] = z;
1620 }
1621 }
1622
1623 lb->bb = bitbuf;
1624 lb->bl = bitsleft;
1625 lb->ip = inpos;
1626 return 0;
1627 }
1628
1629 /*******************************************************
1630 * LZXdecompress (internal)
1631 */
1632 int LZXdecompress(int inlen, int outlen, cab_decomp_state *decomp_state) {
1633 cab_UBYTE *inpos = CAB(inbuf);
1634 cab_UBYTE *endinp = inpos + inlen;
1635 cab_UBYTE *window = LZX(window);
1636 cab_UBYTE *runsrc, *rundest;
1637 cab_UWORD *hufftbl; /* used in READ_HUFFSYM macro as chosen decoding table */
1638
1639 cab_ULONG window_posn = LZX(window_posn);
1640 cab_ULONG window_size = LZX(window_size);
1641 cab_ULONG R0 = LZX(R0);
1642 cab_ULONG R1 = LZX(R1);
1643 cab_ULONG R2 = LZX(R2);
1644
1645 register cab_ULONG bitbuf;
1646 register int bitsleft;
1647 cab_ULONG match_offset, i,j,k; /* ijk used in READ_HUFFSYM macro */
1648 struct lzx_bits lb; /* used in READ_LENGTHS macro */
1649
1650 int togo = outlen, this_run, main_element, aligned_bits;
1651 int match_length, copy_length, length_footer, extra, verbatim_bits;
1652
1653 TRACE("(inlen == %d, outlen == %d)\n", inlen, outlen);
1654
1655 INIT_BITSTREAM;
1656
1657 /* read header if necessary */
1658 if (!LZX(header_read)) {
1659 i = j = 0;
1660 READ_BITS(k, 1); if (k) { READ_BITS(i,16); READ_BITS(j,16); }
1661 LZX(intel_filesize) = (i << 16) | j; /* or 0 if not encoded */
1662 LZX(header_read) = 1;
1663 }
1664
1665 /* main decoding loop */
1666 while (togo > 0) {
1667 /* last block finished, new block expected */
1668 if (LZX(block_remaining) == 0) {
1669 if (LZX(block_type) == LZX_BLOCKTYPE_UNCOMPRESSED) {
1670 if (LZX(block_length) & 1) inpos++; /* realign bitstream to word */
1671 INIT_BITSTREAM;
1672 }
1673
1674 READ_BITS(LZX(block_type), 3);
1675 READ_BITS(i, 16);
1676 READ_BITS(j, 8);
1677 LZX(block_remaining) = LZX(block_length) = (i << 8) | j;
1678
1679 switch (LZX(block_type)) {
1680 case LZX_BLOCKTYPE_ALIGNED:
1681 for (i = 0; i < 8; i++) { READ_BITS(j, 3); LENTABLE(ALIGNED)[i] = j; }
1682 BUILD_TABLE(ALIGNED);
1683 /* rest of aligned header is same as verbatim */
1684
1685 case LZX_BLOCKTYPE_VERBATIM:
1686 READ_LENGTHS(MAINTREE, 0, 256, lzx_read_lens);
1687 READ_LENGTHS(MAINTREE, 256, LZX(main_elements), lzx_read_lens);
1688 BUILD_TABLE(MAINTREE);
1689 if (LENTABLE(MAINTREE)[0xE8] != 0) LZX(intel_started) = 1;
1690
1691 READ_LENGTHS(LENGTH, 0, LZX_NUM_SECONDARY_LENGTHS, lzx_read_lens);
1692 BUILD_TABLE(LENGTH);
1693 break;
1694
1695 case LZX_BLOCKTYPE_UNCOMPRESSED:
1696 LZX(intel_started) = 1; /* because we can't assume otherwise */
1697 ENSURE_BITS(16); /* get up to 16 pad bits into the buffer */
1698 if (bitsleft > 16) inpos -= 2; /* and align the bitstream! */
1699 R0 = inpos[0]|(inpos[1]<<8)|(inpos[2]<<16)|(inpos[3]<<24);inpos+=4;
1700 R1 = inpos[0]|(inpos[1]<<8)|(inpos[2]<<16)|(inpos[3]<<24);inpos+=4;
1701 R2 = inpos[0]|(inpos[1]<<8)|(inpos[2]<<16)|(inpos[3]<<24);inpos+=4;
1702 break;
1703
1704 default:
1705 return DECR_ILLEGALDATA;
1706 }
1707 }
1708
1709 /* buffer exhaustion check */
1710 if (inpos > endinp) {
1711 /* it's possible to have a file where the next run is less than
1712 * 16 bits in size. In this case, the READ_HUFFSYM() macro used
1713 * in building the tables will exhaust the buffer, so we should
1714 * allow for this, but not allow those accidentally read bits to
1715 * be used (so we check that there are at least 16 bits
1716 * remaining - in this boundary case they aren't really part of
1717 * the compressed data)
1718 */
1719 if (inpos > (endinp+2) || bitsleft < 16) return DECR_ILLEGALDATA;
1720 }
1721
1722 while ((this_run = LZX(block_remaining)) > 0 && togo > 0) {
1723 if (this_run > togo) this_run = togo;
1724 togo -= this_run;
1725 LZX(block_remaining) -= this_run;
1726
1727 /* apply 2^x-1 mask */
1728 window_posn &= window_size - 1;
1729 /* runs can't straddle the window wraparound */
1730 if ((window_posn + this_run) > window_size)
1731 return DECR_DATAFORMAT;
1732
1733 switch (LZX(block_type)) {
1734
1735 case LZX_BLOCKTYPE_VERBATIM:
1736 while (this_run > 0) {
1737 READ_HUFFSYM(MAINTREE, main_element);
1738
1739 if (main_element < LZX_NUM_CHARS) {
1740 /* literal: 0 to LZX_NUM_CHARS-1 */
1741 window[window_posn++] = main_element;
1742 this_run--;
1743 }
1744 else {
1745 /* match: LZX_NUM_CHARS + ((slot<<3) | length_header (3 bits)) */
1746 main_element -= LZX_NUM_CHARS;
1747
1748 match_length = main_element & LZX_NUM_PRIMARY_LENGTHS;
1749 if (match_length == LZX_NUM_PRIMARY_LENGTHS) {
1750 READ_HUFFSYM(LENGTH, length_footer);
1751 match_length += length_footer;
1752 }
1753 match_length += LZX_MIN_MATCH;
1754
1755 match_offset = main_element >> 3;
1756
1757 if (match_offset > 2) {
1758 /* not repeated offset */
1759 if (match_offset != 3) {
1760 extra = extra_bits[match_offset];
1761 READ_BITS(verbatim_bits, extra);
1762 match_offset = lzx_position_base[match_offset]
1763 - 2 + verbatim_bits;
1764 }
1765 else {
1766 match_offset = 1;
1767 }
1768
1769 /* update repeated offset LRU queue */
1770 R2 = R1; R1 = R0; R0 = match_offset;
1771 }
1772 else if (match_offset == 0) {
1773 match_offset = R0;
1774 }
1775 else if (match_offset == 1) {
1776 match_offset = R1;
1777 R1 = R0; R0 = match_offset;
1778 }
1779 else /* match_offset == 2 */ {
1780 match_offset = R2;
1781 R2 = R0; R0 = match_offset;
1782 }
1783
1784 rundest = window + window_posn;
1785 this_run -= match_length;
1786
1787 /* copy any wrapped around source data */
1788 if (window_posn >= match_offset) {
1789 /* no wrap */
1790 runsrc = rundest - match_offset;
1791 } else {
1792 runsrc = rundest + (window_size - match_offset);
1793 copy_length = match_offset - window_posn;
1794 if (copy_length < match_length) {
1795 match_length -= copy_length;
1796 window_posn += copy_length;
1797 while (copy_length-- > 0) *rundest++ = *runsrc++;
1798 runsrc = window;
1799 }
1800 }
1801 window_posn += match_length;
1802
1803 /* copy match data - no worries about destination wraps */
1804 while (match_length-- > 0) *rundest++ = *runsrc++;
1805 }
1806 }
1807 break;
1808
1809 case LZX_BLOCKTYPE_ALIGNED:
1810 while (this_run > 0) {
1811 READ_HUFFSYM(MAINTREE, main_element);
1812
1813 if (main_element < LZX_NUM_CHARS) {
1814 /* literal: 0 to LZX_NUM_CHARS-1 */
1815 window[window_posn++] = main_element;
1816 this_run--;
1817 }
1818 else {
1819 /* match: LZX_NUM_CHARS + ((slot<<3) | length_header (3 bits)) */
1820 main_element -= LZX_NUM_CHARS;
1821
1822 match_length = main_element & LZX_NUM_PRIMARY_LENGTHS;
1823 if (match_length == LZX_NUM_PRIMARY_LENGTHS) {
1824 READ_HUFFSYM(LENGTH, length_footer);
1825 match_length += length_footer;
1826 }
1827 match_length += LZX_MIN_MATCH;
1828
1829 match_offset = main_element >> 3;
1830
1831 if (match_offset > 2) {
1832 /* not repeated offset */
1833 extra = extra_bits[match_offset];
1834 match_offset = lzx_position_base[match_offset] - 2;
1835 if (extra > 3) {
1836 /* verbatim and aligned bits */
1837 extra -= 3;
1838 READ_BITS(verbatim_bits, extra);
1839 match_offset += (verbatim_bits << 3);
1840 READ_HUFFSYM(ALIGNED, aligned_bits);
1841 match_offset += aligned_bits;
1842 }
1843 else if (extra == 3) {
1844 /* aligned bits only */
1845 READ_HUFFSYM(ALIGNED, aligned_bits);
1846 match_offset += aligned_bits;
1847 }
1848 else if (extra > 0) { /* extra==1, extra==2 */
1849 /* verbatim bits only */
1850 READ_BITS(verbatim_bits, extra);
1851 match_offset += verbatim_bits;
1852 }
1853 else /* extra == 0 */ {
1854 /* ??? */
1855 match_offset = 1;
1856 }
1857
1858 /* update repeated offset LRU queue */
1859 R2 = R1; R1 = R0; R0 = match_offset;
1860 }
1861 else if (match_offset == 0) {
1862 match_offset = R0;
1863 }
1864 else if (match_offset == 1) {
1865 match_offset = R1;
1866 R1 = R0; R0 = match_offset;
1867 }
1868 else /* match_offset == 2 */ {
1869 match_offset = R2;
1870 R2 = R0; R0 = match_offset;
1871 }
1872
1873 rundest = window + window_posn;
1874 this_run -= match_length;
1875
1876 /* copy any wrapped around source data */
1877 if (window_posn >= match_offset) {
1878 /* no wrap */
1879 runsrc = rundest - match_offset;
1880 } else {
1881 runsrc = rundest + (window_size - match_offset);
1882 copy_length = match_offset - window_posn;
1883 if (copy_length < match_length) {
1884 match_length -= copy_length;
1885 window_posn += copy_length;
1886 while (copy_length-- > 0) *rundest++ = *runsrc++;
1887 runsrc = window;
1888 }
1889 }
1890 window_posn += match_length;
1891
1892 /* copy match data - no worries about destination wraps */
1893 while (match_length-- > 0) *rundest++ = *runsrc++;
1894 }
1895 }
1896 break;
1897
1898 case LZX_BLOCKTYPE_UNCOMPRESSED:
1899 if ((inpos + this_run) > endinp) return DECR_ILLEGALDATA;
1900 memcpy(window + window_posn, inpos, (size_t) this_run);
1901 inpos += this_run; window_posn += this_run;
1902 break;
1903
1904 default:
1905 return DECR_ILLEGALDATA; /* might as well */
1906 }
1907
1908 }
1909 }
1910
1911 if (togo != 0) return DECR_ILLEGALDATA;
1912 memcpy(CAB(outbuf), window + ((!window_posn) ? window_size : window_posn) -
1913 outlen, (size_t) outlen);
1914
1915 LZX(window_posn) = window_posn;
1916 LZX(R0) = R0;
1917 LZX(R1) = R1;
1918 LZX(R2) = R2;
1919
1920 /* intel E8 decoding */
1921 if ((LZX(frames_read)++ < 32768) && LZX(intel_filesize) != 0) {
1922 if (outlen <= 6 || !LZX(intel_started)) {
1923 LZX(intel_curpos) += outlen;
1924 }
1925 else {
1926 cab_UBYTE *data = CAB(outbuf);
1927 cab_UBYTE *dataend = data + outlen - 10;
1928 cab_LONG curpos = LZX(intel_curpos);
1929 cab_LONG filesize = LZX(intel_filesize);
1930 cab_LONG abs_off, rel_off;
1931
1932 LZX(intel_curpos) = curpos + outlen;
1933
1934 while (data < dataend) {
1935 if (*data++ != 0xE8) { curpos++; continue; }
1936 abs_off = data[0] | (data[1]<<8) | (data[2]<<16) | (data[3]<<24);
1937 if ((abs_off >= -curpos) && (abs_off < filesize)) {
1938 rel_off = (abs_off >= 0) ? abs_off - curpos : abs_off + filesize;
1939 data[0] = (cab_UBYTE) rel_off;
1940 data[1] = (cab_UBYTE) (rel_off >> 8);
1941 data[2] = (cab_UBYTE) (rel_off >> 16);
1942 data[3] = (cab_UBYTE) (rel_off >> 24);
1943 }
1944 data += 4;
1945 curpos += 5;
1946 }
1947 }
1948 }
1949 return DECR_OK;
1950 }
1951
1952 /*********************************************************
1953 * find_cabs_in_file (internal)
1954 */
1955 struct cabinet *find_cabs_in_file(LPCSTR name, cab_UBYTE search_buf[])
1956 {
1957 struct cabinet *cab, *cab2, *firstcab = NULL, *linkcab = NULL;
1958 cab_UBYTE *pstart = &search_buf[0], *pend, *p;
1959 cab_off_t offset, caboff, cablen = 0, foffset = 0, filelen, length;
1960 int state = 0, found = 0, ok = 0;
1961
1962 TRACE("(name == %s)\n", debugstr_a((char *) name));
1963
1964 /* open the file and search for cabinet headers */
1965 if ((cab = (struct cabinet *) calloc(1, sizeof(struct cabinet)))) {
1966 cab->filename = name;
1967 if (cabinet_open(cab)) {
1968 filelen = cab->filelen;
1969 for (offset = 0; (offset < filelen); offset += length) {
1970 /* search length is either the full length of the search buffer,
1971 * or the amount of data remaining to the end of the file,
1972 * whichever is less.
1973 */
1974 length = filelen - offset;
1975 if (length > CAB_SEARCH_SIZE) length = CAB_SEARCH_SIZE;
1976
1977 /* fill the search buffer with data from disk */
1978 if (!cabinet_read(cab, search_buf, length)) break;
1979
1980 /* read through the entire buffer. */
1981 p = pstart;
1982 pend = &search_buf[length];
1983 while (p < pend) {
1984 switch (state) {
1985 /* starting state */
1986 case 0:
1987 /* we spend most of our time in this while loop, looking for
1988 * a leading 'M' of the 'MSCF' signature
1989 */
1990 while (*p++ != 0x4D && p < pend);
1991 if (p < pend) state = 1; /* if we found tht 'M', advance state */
1992 break;
1993
1994 /* verify that the next 3 bytes are 'S', 'C' and 'F' */
1995 case 1: state = (*p++ == 0x53) ? 2 : 0; break;
1996 case 2: state = (*p++ == 0x43) ? 3 : 0; break;
1997 case 3: state = (*p++ == 0x46) ? 4 : 0; break;
1998
1999 /* we don't care about bytes 4-7 */
2000 /* bytes 8-11 are the overall length of the cabinet */
2001 case 8: cablen = *p++; state++; break;
2002 case 9: cablen |= *p++ << 8; state++; break;
2003 case 10: cablen |= *p++ << 16; state++; break;
2004 case 11: cablen |= *p++ << 24; state++; break;
2005
2006 /* we don't care about bytes 12-15 */
2007 /* bytes 16-19 are the offset within the cabinet of the filedata */
2008 case 16: foffset = *p++; state++; break;
2009 case 17: foffset |= *p++ << 8; state++; break;
2010 case 18: foffset |= *p++ << 16; state++; break;
2011 case 19: foffset |= *p++ << 24;
2012 /* now we have received 20 bytes of potential cab header. */
2013 /* work out the offset in the file of this potential cabinet */
2014 caboff = offset + (p-pstart) - 20;
2015
2016 /* check that the files offset is less than the alleged length
2017 * of the cabinet, and that the offset + the alleged length are
2018 * 'roughly' within the end of overall file length
2019 */
2020 if ((foffset < cablen) &&
2021 ((caboff + foffset) < (filelen + 32)) &&
2022 ((caboff + cablen) < (filelen + 32)) )
2023 {
2024 /* found a potential result - try loading it */
2025 found++;
2026 cab2 = load_cab_offset(name, caboff);
2027 if (cab2) {
2028 /* success */
2029 ok++;
2030
2031 /* cause the search to restart after this cab's data. */
2032 offset = caboff + cablen;
2033 if (offset < cab->filelen) cabinet_seek(cab, offset);
2034 length = 0;
2035 p = pend;
2036
2037 /* link the cab into the list */
2038 if (linkcab == NULL) firstcab = cab2;
2039 else linkcab->next = cab2;
2040 linkcab = cab2;
2041 }
2042 }
2043 state = 0;
2044 break;
2045 default:
2046 p++, state++; break;
2047 }
2048 }
2049 }
2050 cabinet_close(cab);
2051 }
2052 free(cab);
2053 }
2054
2055 /* if there were cabinets that were found but are not ok, point this out */
2056 if (found > ok) {
2057 WARN("%s: found %d bad cabinets\n", debugstr_a(name), found-ok);
2058 }
2059
2060 /* if no cabinets were found, let the user know */
2061 if (!firstcab) {
2062 WARN("%s: not a Microsoft cabinet file.\n", debugstr_a(name));
2063 }
2064 return firstcab;
2065 }
2066
2067 /***********************************************************************
2068 * find_cabinet_file (internal)
2069 *
2070 * tries to find *cabname, from the directory path of origcab, correcting the
2071 * case of *cabname if necessary, If found, writes back to *cabname.
2072 */
2073 void find_cabinet_file(char **cabname, LPCSTR origcab) {
2074
2075 char *tail, *cab, *name, *nextpart, nametmp[MAX_PATH], *filepart;
2076 int found = 0;
2077
2078 TRACE("(*cabname == ^%p, origcab == %s)\n", cabname ? *cabname : NULL, debugstr_a(origcab));
2079
2080 /* ensure we have a cabinet name at all */
2081 if (!(name = *cabname)) {
2082 WARN("no cabinet name at all\n");
2083 }
2084
2085 /* find if there's a directory path in the origcab */
2086 tail = origcab ? max(strrchr(origcab, '/'), strrchr(origcab, '\\')) : NULL;
2087
2088 if ((cab = (char *) malloc(MAX_PATH))) {
2089 /* add the directory path from the original cabinet name */
2090 if (tail) {
2091 memcpy(cab, origcab, tail - origcab);
2092 cab[tail - origcab] = '\0';
2093 } else {
2094 /* default directory path of '.' */
2095 cab[0] = '.';
2096 cab[1] = '\0';
2097 }
2098
2099 do {
2100 TRACE("trying cab == %s", debugstr_a(cab));
2101
2102 /* we don't want null cabinet filenames */
2103 if (name[0] == '\0') {
2104 WARN("null cab name\n");
2105 break;
2106 }
2107
2108 /* if there is a directory component in the cabinet name,
2109 * look for that alone first
2110 */
2111 nextpart = strchr(name, '\\');
2112 if (nextpart) *nextpart = '\0';
2113
2114 found = SearchPathA(cab, name, NULL, MAX_PATH, nametmp, &filepart);
2115
2116 /* if the component was not found, look for it in the current dir */
2117 if (!found) {
2118 found = SearchPathA(".", name, NULL, MAX_PATH, nametmp, &filepart);
2119 }
2120
2121 if (found)
2122 TRACE("found: %s\n", debugstr_a(nametmp));
2123 else
2124 TRACE("not found.\n");
2125
2126 /* restore the real name and skip to the next directory component
2127 * or actual cabinet name
2128 */
2129 if (nextpart) *nextpart = '\\', name = &nextpart[1];
2130
2131 /* while there is another directory component, and while we
2132 * successfully found the current component
2133 */
2134 } while (nextpart && found);
2135
2136 /* if we found the cabinet, change the next cabinet's name.
2137 * otherwise, pretend nothing happened
2138 */
2139 if (found) {
2140 free((void *) *cabname);
2141 *cabname = cab;
2142 strncpy(cab, nametmp, found+1);
2143 TRACE("result: %s\n", debugstr_a(cab));
2144 } else {
2145 free((void *) cab);
2146 TRACE("result: nothing\n");
2147 }
2148 }
2149 }
2150
2151 /************************************************************************
2152 * process_files (internal)
2153 *
2154 * this does the tricky job of running through every file in the cabinet,
2155 * including spanning cabinets, and working out which file is in which
2156 * folder in which cabinet. It also throws out the duplicate file entries
2157 * that appear in spanning cabinets. There is memory leakage here because
2158 * those entries are not freed. See the XAD CAB client (function CAB_GetInfo
2159 * in CAB.c) for an implementation of this that correctly frees the discarded
2160 * file entries.
2161 */
2162 struct cab_file *process_files(struct cabinet *basecab) {
2163 struct cabinet *cab;
2164 struct cab_file *outfi = NULL, *linkfi = NULL, *nextfi, *fi, *cfi;
2165 struct cab_folder *fol, *firstfol, *lastfol = NULL, *predfol;
2166 int i, mergeok;
2167
2168 FIXME("(basecab == ^%p): Memory leak.\n", basecab);
2169
2170 for (cab = basecab; cab; cab = cab->nextcab) {
2171 /* firstfol = first folder in this cabinet */
2172 /* lastfol = last folder in this cabinet */
2173 /* predfol = last folder in previous cabinet (or NULL if first cabinet) */
2174 predfol = lastfol;
2175 firstfol = cab->folders;
2176 for (lastfol = firstfol; lastfol->next;) lastfol = lastfol->next;
2177 mergeok = 1;
2178
2179 for (fi = cab->files; fi; fi = nextfi) {
2180 i = fi->index;
2181 nextfi = fi->next;
2182
2183 if (i < cffileCONTINUED_FROM_PREV) {
2184 for (fol = firstfol; fol && i--; ) fol = fol->next;
2185 fi->folder = fol; /* NULL if an invalid folder index */
2186 }
2187 else {
2188 /* folder merging */
2189 if (i == cffileCONTINUED_TO_NEXT
2190 || i == cffileCONTINUED_PREV_AND_NEXT) {
2191 if (cab->nextcab && !lastfol->contfile) lastfol->contfile = fi;
2192 }
2193
2194 if (i == cffileCONTINUED_FROM_PREV
2195 || i == cffileCONTINUED_PREV_AND_NEXT) {
2196 /* these files are to be continued in yet another
2197 * cabinet, don't merge them in just yet */
2198 if (i == cffileCONTINUED_PREV_AND_NEXT) mergeok = 0;
2199
2200 /* only merge once per cabinet */
2201 if (predfol) {
2202 if ((cfi = predfol->contfile)
2203 && (cfi->offset == fi->offset)
2204 && (cfi->length == fi->length)
2205 && (strcmp(cfi->filename, fi->filename) == 0)
2206 && (predfol->comp_type == firstfol->comp_type)) {
2207 /* increase the number of splits */
2208 if ((i = ++(predfol->num_splits)) > CAB_SPLITMAX) {
2209 mergeok = 0;
2210 ERR("%s: internal error: CAB_SPLITMAX exceeded. please report this to wine-devel@winehq.org)\n",
2211 debugstr_a(basecab->filename));
2212 }
2213 else {
2214 /* copy information across from the merged folder */
2215 predfol->offset[i] = firstfol->offset[0];
2216 predfol->cab[i] = firstfol->cab[0];
2217 predfol->next = firstfol->next;
2218 predfol->contfile = firstfol->contfile;
2219
2220 if (firstfol == lastfol) lastfol = predfol;
2221 firstfol = predfol;
2222 predfol = NULL; /* don't merge again within this cabinet */
2223 }
2224 }
2225 else {
2226 /* if the folders won't merge, don't add their files */
2227 mergeok = 0;
2228 }
2229 }
2230
2231 if (mergeok) fi->folder = firstfol;
2232 }
2233 }
2234
2235 if (fi->folder) {
2236 if (linkfi) linkfi->next = fi; else outfi = fi;
2237 linkfi = fi;
2238 }
2239 } /* for (fi= .. */
2240 } /* for (cab= ...*/
2241
2242 return outfi;
2243 }
2244
2245 /****************************************************************
2246 * convertUTF (internal)
2247 *
2248 * translate UTF -> ASCII
2249 *
2250 * UTF translates two-byte unicode characters into 1, 2 or 3 bytes.
2251 * %000000000xxxxxxx -> %0xxxxxxx
2252 * %00000xxxxxyyyyyy -> %110xxxxx %10yyyyyy
2253 * %xxxxyyyyyyzzzzzz -> %1110xxxx %10yyyyyy %10zzzzzz
2254 *
2255 * Therefore, the inverse is as follows:
2256 * First char:
2257 * 0x00 - 0x7F = one byte char
2258 * 0x80 - 0xBF = invalid
2259 * 0xC0 - 0xDF = 2 byte char (next char only 0x80-0xBF is valid)
2260 * 0xE0 - 0xEF = 3 byte char (next 2 chars only 0x80-0xBF is valid)
2261 * 0xF0 - 0xFF = invalid
2262 *
2263 * FIXME: use a winapi to do this
2264 */
2265 int convertUTF(cab_UBYTE *in) {
2266 cab_UBYTE c, *out = in, *end = in + strlen((char *) in) + 1;
2267 cab_ULONG x;
2268
2269 do {
2270 /* read unicode character */
2271 if ((c = *in++) < 0x80) x = c;
2272 else {
2273 if (c < 0xC0) return 0;
2274 else if (c < 0xE0) {
2275 x = (c & 0x1F) << 6;
2276 if ((c = *in++) < 0x80 || c > 0xBF) return 0; else x |= (c & 0x3F);
2277 }
2278 else if (c < 0xF0) {
2279 x = (c & 0xF) << 12;
2280 if ((c = *in++) < 0x80 || c > 0xBF) return 0; else x |= (c & 0x3F)<<6;
2281 if ((c = *in++) < 0x80 || c > 0xBF) return 0; else x |= (c & 0x3F);
2282 }
2283 else return 0;
2284 }
2285
2286 /* terrible unicode -> ASCII conversion */
2287 if (x > 127) x = '_';
2288
2289 if (in > end) return 0; /* just in case */
2290 } while ((*out++ = (cab_UBYTE) x));
2291 return 1;
2292 }
2293
2294 /****************************************************
2295 * NONEdecompress (internal)
2296 */
2297 int NONEdecompress(int inlen, int outlen, cab_decomp_state *decomp_state)
2298 {
2299 if (inlen != outlen) return DECR_ILLEGALDATA;
2300 memcpy(CAB(outbuf), CAB(inbuf), (size_t) inlen);
2301 return DECR_OK;
2302 }
2303
2304 /**************************************************
2305 * checksum (internal)
2306 */
2307 cab_ULONG checksum(cab_UBYTE *data, cab_UWORD bytes, cab_ULONG csum) {
2308 int len;
2309 cab_ULONG ul = 0;
2310
2311 for (len = bytes >> 2; len--; data += 4) {
2312 csum ^= ((data[0]) | (data[1]<<8) | (data[2]<<16) | (data[3]<<24));
2313 }
2314
2315 switch (bytes & 3) {
2316 case 3: ul |= *data++ << 16;
2317 case 2: ul |= *data++ << 8;
2318 case 1: ul |= *data;
2319 }
2320 csum ^= ul;
2321
2322 return csum;
2323 }
2324
2325 /**********************************************************
2326 * decompress (internal)
2327 */
2328 int decompress(struct cab_file *fi, int savemode, int fix, cab_decomp_state *decomp_state)
2329 {
2330 cab_ULONG bytes = savemode ? fi->length : fi->offset - CAB(offset);
2331 struct cabinet *cab = CAB(current)->cab[CAB(split)];
2332 cab_UBYTE buf[cfdata_SIZEOF], *data;
2333 cab_UWORD inlen, len, outlen, cando;
2334 cab_ULONG cksum;
2335 cab_LONG err;
2336
2337 TRACE("(fi == ^%p, savemode == %d, fix == %d)\n", fi, savemode, fix);
2338
2339 while (bytes > 0) {
2340 /* cando = the max number of bytes we can do */
2341 cando = CAB(outlen);
2342 if (cando > bytes) cando = bytes;
2343
2344 /* if cando != 0 */
2345 if (cando && savemode)
2346 file_write(fi, CAB(outpos), cando);
2347
2348 CAB(outpos) += cando;
2349 CAB(outlen) -= cando;
2350 bytes -= cando; if (!bytes) break;
2351
2352 /* we only get here if we emptied the output buffer */
2353
2354 /* read data header + data */
2355 inlen = outlen = 0;
2356 while (outlen == 0) {
2357 /* read the block header, skip the reserved part */
2358 if (!cabinet_read(cab, buf, cfdata_SIZEOF)) return DECR_INPUT;
2359 cabinet_skip(cab, cab->block_resv);
2360
2361 /* we shouldn't get blocks over CAB_INPUTMAX in size */
2362 data = CAB(inbuf) + inlen;
2363 len = EndGetI16(buf+cfdata_CompressedSize);
2364 inlen += len;
2365 if (inlen > CAB_INPUTMAX) return DECR_INPUT;
2366 if (!cabinet_read(cab, data, len)) return DECR_INPUT;
2367
2368 /* clear two bytes after read-in data */
2369 data[len+1] = data[len+2] = 0;
2370
2371 /* perform checksum test on the block (if one is stored) */
2372 cksum = EndGetI32(buf+cfdata_CheckSum);
2373 if (cksum && cksum != checksum(buf+4, 4, checksum(data, len, 0))) {
2374 /* checksum is wrong */
2375 if (fix && ((fi->folder->comp_type & cffoldCOMPTYPE_MASK)
2376 == cffoldCOMPTYPE_MSZIP))
2377 {
2378 WARN("%s: checksum failed\n", debugstr_a(fi->filename));
2379 }
2380 else {
2381 return DECR_CHECKSUM;
2382 }
2383 }
2384
2385 /* outlen=0 means this block was part of a split block */
2386 outlen = EndGetI16(buf+cfdata_UncompressedSize);
2387 if (outlen == 0) {
2388 cabinet_close(cab);
2389 cab = CAB(current)->cab[++CAB(split)];
2390 if (!cabinet_open(cab)) return DECR_INPUT;
2391 cabinet_seek(cab, CAB(current)->offset[CAB(split)]);
2392 }
2393 }
2394
2395 /* decompress block */
2396 if ((err = CAB(decompress)(inlen, outlen, decomp_state))) {
2397 if (fix && ((fi->folder->comp_type & cffoldCOMPTYPE_MASK)
2398 == cffoldCOMPTYPE_MSZIP))
2399 {
2400 ERR("%s: failed decrunching block\n", debugstr_a(fi->filename));
2401 }
2402 else {
2403 return err;
2404 }
2405 }
2406 CAB(outlen) = outlen;
2407 CAB(outpos) = CAB(outbuf);
2408 }
2409
2410 return DECR_OK;
2411 }
2412
2413 /****************************************************************
2414 * extract_file (internal)
2415 *
2416 * workhorse to extract a particular file from a cab
2417 */
2418 void extract_file(struct cab_file *fi, int lower, int fix, LPCSTR dir, cab_decomp_state *decomp_state)
2419 {
2420 struct cab_folder *fol = fi->folder, *oldfol = CAB(current);
2421 cab_LONG err = DECR_OK;
2422
2423 TRACE("(fi == ^%p, lower == %d, fix == %d, dir == %s)\n", fi, lower, fix, debugstr_a(dir));
2424
2425 /* is a change of folder needed? do we need to reset the current folder? */
2426 if (fol != oldfol || fi->offset < CAB(offset)) {
2427 cab_UWORD comptype = fol->comp_type;
2428 int ct1 = comptype & cffoldCOMPTYPE_MASK;
2429 int ct2 = oldfol ? (oldfol->comp_type & cffoldCOMPTYPE_MASK) : 0;
2430
2431 /* if the archiver has changed, call the old archiver's free() function */
2432 if (ct1 != ct2) {
2433 switch (ct2) {
2434 case cffoldCOMPTYPE_LZX:
2435 if (LZX(window)) {
2436 free(LZX(window));
2437 LZX(window) = NULL;
2438 }
2439 break;
2440 case cffoldCOMPTYPE_QUANTUM:
2441 if (QTM(window)) {
2442 free(QTM(window));
2443 QTM(window) = NULL;
2444 }
2445 break;
2446 }
2447 }
2448
2449 switch (ct1) {
2450 case cffoldCOMPTYPE_NONE:
2451 CAB(decompress) = NONEdecompress;
2452 break;
2453
2454 case cffoldCOMPTYPE_MSZIP:
2455 CAB(decompress) = ZIPdecompress;
2456 break;
2457
2458 case cffoldCOMPTYPE_QUANTUM:
2459 CAB(decompress) = QTMdecompress;
2460 err = QTMinit((comptype >> 8) & 0x1f, (comptype >> 4) & 0xF, decomp_state);
2461 break;
2462
2463 case cffoldCOMPTYPE_LZX:
2464 CAB(decompress) = LZXdecompress;
2465 err = LZXinit((comptype >> 8) & 0x1f, decomp_state);
2466 break;
2467
2468 default:
2469 err = DECR_DATAFORMAT;
2470 }
2471 if (err) goto exit_handler;
2472
2473 /* initialisation OK, set current folder and reset offset */
2474 if (oldfol) cabinet_close(oldfol->cab[CAB(split)]);
2475 if (!cabinet_open(fol->cab[0])) goto exit_handler;
2476 cabinet_seek(fol->cab[0], fol->offset[0]);
2477 CAB(current) = fol;
2478 CAB(offset) = 0;
2479 CAB(outlen) = 0; /* discard existing block */
2480 CAB(split) = 0;
2481 }
2482
2483 if (fi->offset > CAB(offset)) {
2484 /* decode bytes and send them to /dev/null */
2485 if ((err = decompress(fi, 0, fix, decomp_state))) goto exit_handler;
2486 CAB(offset) = fi->offset;
2487 }
2488
2489 if (!file_open(fi, lower, dir)) return;
2490 err = decompress(fi, 1, fix, decomp_state);
2491 if (err) CAB(current) = NULL; else CAB(offset) += fi->length;
2492 file_close(fi);
2493
2494 exit_handler:
2495 if (err) {
2496 char *errmsg, *cabname;
2497 switch (err) {
2498 case DECR_NOMEMORY:
2499 errmsg = "out of memory!\n"; break;
2500 case DECR_ILLEGALDATA:
2501 errmsg = "%s: illegal or corrupt data\n"; break;
2502 case DECR_DATAFORMAT:
2503 errmsg = "%s: unsupported data format\n"; break;
2504 case DECR_CHECKSUM:
2505 errmsg = "%s: checksum error\n"; break;
2506 case DECR_INPUT:
2507 errmsg = "%s: input error\n"; break;
2508 case DECR_OUTPUT:
2509 errmsg = "%s: output error\n"; break;
2510 default:
2511 errmsg = "%s: unknown error (BUG)\n";
2512 }
2513
2514 if (CAB(current)) {
2515 cabname = (char *) (CAB(current)->cab[CAB(split)]->filename);
2516 }
2517 else {
2518 cabname = (char *) (fi->folder->cab[0]->filename);
2519 }
2520
2521 ERR(errmsg, cabname);
2522 }
2523 }
2524
2525 /*********************************************************
2526 * print_fileinfo (internal)
2527 */
2528 void print_fileinfo(struct cab_file *fi) {
2529 int d = fi->date, t = fi->time;
2530 char *fname = NULL;
2531
2532 if (fi->attribs & cffile_A_NAME_IS_UTF) {
2533 fname = malloc(strlen(fi->filename) + 1);
2534 if (fname) {
2535 strcpy(fname, fi->filename);
2536 convertUTF((cab_UBYTE *) fname);
2537 }
2538 }
2539
2540 TRACE("%9u | %02d.%02d.%04d %02d:%02d:%02d | %s\n",
2541 fi->length,
2542 d & 0x1f, (d>>5) & 0xf, (d>>9) + 1980,
2543 t >> 11, (t>>5) & 0x3f, (t << 1) & 0x3e,
2544 fname ? fname : fi->filename
2545 );
2546
2547 if (fname) free(fname);
2548 }
2549
2550 /****************************************************************************
2551 * process_cabinet (internal)
2552 *
2553 * called to simply "extract" a cabinet file. Will find every cabinet file
2554 * in that file, search for every chained cabinet attached to those cabinets,
2555 * and will either extract the cabinets, or ? (call a callback?)
2556 *
2557 * PARAMS
2558 * cabname [I] name of the cabinet file to extract
2559 * dir [I] directory to extract to
2560 * fix [I] attempt to process broken cabinets
2561 * lower [I] ? (lower case something or other?)
2562 *
2563 * RETURNS
2564 * Success: TRUE
2565 * Failure: FALSE
2566 */
2567 BOOL process_cabinet(LPCSTR cabname, LPCSTR dir, BOOL fix, BOOL lower)
2568 {
2569 struct cabinet *basecab, *cab, *cab1, *cab2;
2570 struct cab_file *filelist, *fi;
2571
2572 /* The first result of a search will be returned, and
2573 * the remaining results will be chained to it via the cab->next structure
2574 * member.
2575 */
2576 cab_UBYTE search_buf[CAB_SEARCH_SIZE];
2577
2578 cab_decomp_state decomp_state_local;
2579 cab_decomp_state *decomp_state = &decomp_state_local;
2580
2581 /* has the list-mode header been seen before? */
2582 int viewhdr = 0;
2583
2584 ZeroMemory(decomp_state, sizeof(cab_decomp_state));
2585
2586 TRACE("Extract %s\n", debugstr_a(cabname));
2587
2588 /* load the file requested */
2589 basecab = find_cabs_in_file(cabname, search_buf);
2590 if (!basecab) return FALSE;
2591
2592 /* iterate over all cabinets found in that file */
2593 for (cab = basecab; cab; cab=cab->next) {
2594
2595 /* bi-directionally load any spanning cabinets -- backwards */
2596 for (cab1 = cab; cab1->flags & cfheadPREV_CABINET; cab1 = cab1->prevcab) {
2597 TRACE("%s: extends backwards to %s (%s)\n", debugstr_a(cabname),
2598 debugstr_a(cab1->prevname), debugstr_a(cab1->previnfo));
2599 find_cabinet_file(&(cab1->prevname), cabname);
2600 if (!(cab1->prevcab = load_cab_offset(cab1->prevname, 0))) {
2601 ERR("%s: can't read previous cabinet %s\n", debugstr_a(cabname), debugstr_a(cab1->prevname));
2602 break;
2603 }
2604 cab1->prevcab->nextcab = cab1;
2605 }
2606
2607 /* bi-directionally load any spanning cabinets -- forwards */
2608 for (cab2 = cab; cab2->flags & cfheadNEXT_CABINET; cab2 = cab2->nextcab) {
2609 TRACE("%s: extends to %s (%s)\n", debugstr_a(cabname),
2610 debugstr_a(cab2->nextname), debugstr_a(cab2->nextinfo));
2611 find_cabinet_file(&(cab2->nextname), cabname);
2612 if (!(cab2->nextcab = load_cab_offset(cab2->nextname, 0))) {
2613 ERR("%s: can't read next cabinet %s\n", debugstr_a(cabname), debugstr_a(cab2->nextname));
2614 break;
2615 }
2616 cab2->nextcab->prevcab = cab2;
2617 }
2618
2619 filelist = process_files(cab1);
2620 CAB(current) = NULL;
2621
2622 if (!viewhdr) {
2623 TRACE("File size | Date Time | Name\n");
2624 TRACE("----------+---------------------+-------------\n");
2625 viewhdr = 1;
2626 }
2627 for (fi = filelist; fi; fi = fi->next)
2628 print_fileinfo(fi);
2629 TRACE("Beginning Extraction...\n");
2630 for (fi = filelist; fi; fi = fi->next) {
2631 TRACE(" extracting: %s\n", debugstr_a(fi->filename));
2632 extract_file(fi, lower, fix, dir, decomp_state);
2633 }
2634 }
2635
2636 TRACE("Finished processing cabinet.\n");
2637
2638 return TRUE;
2639 }